From: Sebastian Felis Date: Mon, 13 Jan 2003 10:41:15 +0000 (+0000) Subject: *** empty log message *** X-Git-Url: http://nsz.repo.hu/git/?a=commitdiff_plain;h=de3ad6fcd245b88094f28f89284f2d62d4d50d3c;p=libfirm *** empty log message *** [r593] --- diff --git a/ir/adt/obst.h b/ir/adt/obst.h index 510b275f6..56f95671a 100644 --- a/ir/adt/obst.h +++ b/ir/adt/obst.h @@ -1,8 +1,8 @@ /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Martin Trapp, Christian Schaefer -** +* All rights reserved. +* +* Authors: Martin Trapp, Christian Schaefer +* */ /* $Id$ */ diff --git a/ir/adt/set.c b/ir/adt/set.c index 5c5696bd6..137070360 100644 --- a/ir/adt/set.c +++ b/ir/adt/set.c @@ -14,9 +14,9 @@ Submitted-By: Esmond Pitt Archive-name: dynamic-hash - ** Dynamic hashing, after CACM April 1988 pp 446-457, by Per-Ake Larson. - ** Coded into C, with minor code improvements, and with hsearch(3) interface, - ** by ejp@ausmelb.oz, Jul 26, 1988: 13:16; + * Dynamic hashing, after CACM April 1988 pp 446-457, by Per-Ake Larson. + * Coded into C, with minor code improvements, and with hsearch(3) interface, + * by ejp@ausmelb.oz, Jul 26, 1988: 13:16; TODO: Fix Esmond's ugly MixedCapsIdentifiers ;-> */ diff --git a/ir/ana/cgana.c b/ir/ana/cgana.c index a3a30d4b7..865674812 100644 --- a/ir/ana/cgana.c +++ b/ir/ana/cgana.c @@ -130,7 +130,7 @@ static entity ** get_impl_methods(entity * method) { /** Collect all method entities that can be called here **/ collect_impls(method, set, &size, &open); - /** Gefunden Entitaeten in ein Feld kopieren, ev. Unbekannten +/** Vorgaenger einfuegen. **/ if (size == 0 && !open) { /* keine implementierte überschriebene Methode */ diff --git a/ir/ana/irbackedge.c b/ir/ana/irbackedge.c index 28cd09e2a..dcd024b13 100644 --- a/ir/ana/irbackedge.c +++ b/ir/ana/irbackedge.c @@ -1,10 +1,10 @@ /* Copyright (C) 2002 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Goetz Lindenmaier -** -** irbackedges.c Access function for backedges. -** +* All rights reserved. +* +* Authors: Goetz Lindenmaier +* +* irbackedges.c Access function for backedges. +* */ /* $Id$ */ diff --git a/ir/ana/irdom.c b/ir/ana/irdom.c index de906b8d4..fefdc7910 100644 --- a/ir/ana/irdom.c +++ b/ir/ana/irdom.c @@ -1,10 +1,10 @@ /* Copyright (C) 2002 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Goetz Lindenmaier -** -** irdom.c --- Dominator tree. -** +* All rights reserved. +* +* Authors: Goetz Lindenmaier +* +* irdom.c --- Dominator tree. +* */ /* $Id$ */ @@ -191,7 +191,7 @@ void compute_doms(ir_graph *irg) { if (current_ir_graph->outs_state != outs_consistent) compute_outs(current_ir_graph); - /** Initialize the temporary information, add link to parent. We don't do +/** this with a standard walker as passing the parent to the sons isn't simple. **/ used = 0; diff --git a/ir/ana/irdom.h b/ir/ana/irdom.h index 2fbc7f25b..8262aa11d 100644 --- a/ir/ana/irdom.h +++ b/ir/ana/irdom.h @@ -1,16 +1,16 @@ /* Copyright (C) 2002 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Goetz Lindenmaier -** -** irdom.h: This file contains routines to construct and access dominator -** information. -** The dominator information is stored in three fields of block nodes: -** idom: a reference to the block that is the immediate dominator of -** this block. -** dom_depth: a number giving the depth of the block in the dominator -** tree. -** pre_num: Number in preorder traversal. +* All rights reserved. +* +* Authors: Goetz Lindenmaier +* +* irdom.h: This file contains routines to construct and access dominator +* information. +* The dominator information is stored in three fields of block nodes: +* idom: a reference to the block that is the immediate dominator of +* this block. +* dom_depth: a number giving the depth of the block in the dominator +* tree. +* pre_num: Number in preorder traversal. */ /* $Id$ */ diff --git a/ir/ana/irdom_t.h b/ir/ana/irdom_t.h index 28dfd4038..fa8a0f1af 100644 --- a/ir/ana/irdom_t.h +++ b/ir/ana/irdom_t.h @@ -1,9 +1,9 @@ /* Copyright (C) 2002 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Goetz Lindenmaier -** -** irdom_t.h: private datastructures +* All rights reserved. +* +* Authors: Goetz Lindenmaier +* +* irdom_t.h: private datastructures */ /* $Id$ */ diff --git a/ir/ana/irloop.h b/ir/ana/irloop.h index df81842e3..2dcf42564 100644 --- a/ir/ana/irloop.h +++ b/ir/ana/irloop.h @@ -1,11 +1,11 @@ /* Copyright (C) 2002 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Goetz Lindenmaier -** -** irloops.h: Computes backedges in the control and data flow. -** Only Block and Phi/Filter nodes can have incoming backedges. -** Constructs loops data structure: indicates loop nesting. +* All rights reserved. +* +* Authors: Goetz Lindenmaier +* +* irloops.h: Computes backedges in the control and data flow. +* Only Block and Phi/Filter nodes can have incoming backedges. +* Constructs loops data structure: indicates loop nesting. */ /* $Id$ */ diff --git a/ir/ana/irloop_t.h b/ir/ana/irloop_t.h index 816e69c69..9797db619 100644 --- a/ir/ana/irloop_t.h +++ b/ir/ana/irloop_t.h @@ -1,9 +1,9 @@ /* Copyright (C) 2002 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Goetz Lindenmaier -** -** irloops_t.h: +* All rights reserved. +* +* Authors: Goetz Lindenmaier +* +* irloops_t.h: */ /* $Id$ */ diff --git a/ir/ana/irouts.c b/ir/ana/irouts.c index bc5cbce04..e04a9b0ed 100644 --- a/ir/ana/irouts.c +++ b/ir/ana/irouts.c @@ -1,11 +1,11 @@ /* Copyright (C) 2002 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Goetz Lindenmaier -** -** irouts.c --- Compute out edges for ir nodes (also called def-use -** edges). -** +* All rights reserved. +* +* Authors: Goetz Lindenmaier +* +* irouts.c --- Compute out edges for ir nodes (also called def-use +* edges). +* */ /* $Id$ */ diff --git a/ir/ana/irouts.h b/ir/ana/irouts.h index 3ddbd2edd..6e18ea229 100644 --- a/ir/ana/irouts.h +++ b/ir/ana/irouts.h @@ -1,10 +1,10 @@ /* Copyright (C) 2002 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Goetz Lindenmaier -** -** irouts.h: Implements Def-Use edges, also called outedges. -** @@@ eventually add reverse conrtol flow graph. (If needed.) +* All rights reserved. +* +* Authors: Goetz Lindenmaier +* +* irouts.h: Implements Def-Use edges, also called outedges. +* @@@ eventually add reverse conrtol flow graph. (If needed.) */ /* $Id$ */ diff --git a/ir/ana/irscc.c b/ir/ana/irscc.c index 0d462b821..3080488c7 100644 --- a/ir/ana/irscc.c +++ b/ir/ana/irscc.c @@ -1,11 +1,11 @@ /* Copyright (C) 2002 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Goetz Lindenmaier -** -** irscc.c Computing the strongly connected regions and building -** backedge/loop datastructures. -** +* All rights reserved. +* +* Authors: Goetz Lindenmaier +* +* irscc.c Computing the strongly connected regions and building +* backedge/loop datastructures. +* */ /* $Id$ */ diff --git a/ir/common/firm.c b/ir/common/firm.c index 3f1cd91ec..f97fe2eb2 100644 --- a/ir/common/firm.c +++ b/ir/common/firm.c @@ -1,8 +1,8 @@ /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Martin Trapp, Christian Schaefer -** +* All rights reserved. +* +* Authors: Martin Trapp, Christian Schaefer +* */ /* $Id$ */ diff --git a/ir/common/firm.h b/ir/common/firm.h index 2bee0b1f6..c95c0c307 100644 --- a/ir/common/firm.h +++ b/ir/common/firm.h @@ -1,13 +1,13 @@ /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Martin Trapp, Christian Schaefer, Goetz Lindenmaier. -** -** firm.h: Central FIRM header. -** -** -** -** +* All rights reserved. +* +* Authors: Martin Trapp, Christian Schaefer, Goetz Lindenmaier. +* +* firm.h: Central FIRM header. +* +* +* +* FIRM is a full graph based intermediate representation in SSA Form with a novel concept to model side effects. It allows fast, aggressive optimizations. @@ -50,7 +50,7 @@ irgwalk: walker for ir graphs. irvrfy: verify the correctness of a firm node. -** +* */ /* $Id$ */ diff --git a/ir/common/firm_common.c b/ir/common/firm_common.c index 755c6f254..a996e7b1f 100644 --- a/ir/common/firm_common.c +++ b/ir/common/firm_common.c @@ -1,10 +1,10 @@ /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Martin Trapp, Christian Schaefer & -** Goetz Lindenmaier -** -** firm_common.c: +* All rights reserved. +* +* Authors: Martin Trapp, Christian Schaefer & +* Goetz Lindenmaier +* +* firm_common.c: */ /* $Id$ */ diff --git a/ir/common/firm_common.h b/ir/common/firm_common.h index d994d45ee..233efc3db 100644 --- a/ir/common/firm_common.h +++ b/ir/common/firm_common.h @@ -1,10 +1,10 @@ /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Martin Trapp, Christian Schaefer & -** Goetz Lindenmaier -** -** firm_common.h: common firm declarations +* All rights reserved. +* +* Authors: Martin Trapp, Christian Schaefer & +* Goetz Lindenmaier +* +* firm_common.h: common firm declarations */ /* $Id$ */ diff --git a/ir/common/firm_common_t.h b/ir/common/firm_common_t.h index a5ca5c781..60bb59a2e 100644 --- a/ir/common/firm_common_t.h +++ b/ir/common/firm_common_t.h @@ -1,10 +1,10 @@ /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Martin Trapp, Christian Schaefer & -** Goetz Lindenmaier -** -** firm_common_t.h: preprocessor flags +* All rights reserved. +* +* Authors: Martin Trapp, Christian Schaefer & +* Goetz Lindenmaier +* +* firm_common_t.h: preprocessor flags */ /* $Id$ */ diff --git a/ir/common/panic.c b/ir/common/panic.c index 42c9f1db7..56b76ef3a 100644 --- a/ir/common/panic.c +++ b/ir/common/panic.c @@ -1,8 +1,8 @@ /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Martin Trapp, Christian Schaefer -** +* All rights reserved. +* +* Authors: Martin Trapp, Christian Schaefer +* */ /* $Id$ */ diff --git a/ir/common/panic.h b/ir/common/panic.h index 9c3a87259..88065aead 100644 --- a/ir/common/panic.h +++ b/ir/common/panic.h @@ -1,8 +1,8 @@ /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Martin Trapp, Christian Schaefer -** +* All rights reserved. +* +* Authors: Martin Trapp, Christian Schaefer +* */ /* $Id$ */ diff --git a/ir/debug/dbginfo.c b/ir/debug/dbginfo.c index 1b5b737f6..53233aad8 100644 --- a/ir/debug/dbginfo.c +++ b/ir/debug/dbginfo.c @@ -1,14 +1,14 @@ /* -** Copyright (C) 2001 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Goetz Lindenmaier -** -** dbginfo: This is a empty implementation of the Firm interface to -** debugging support. It only guarantees that the Firm library compiles -** and runs without any real debugging support. -** The functions herein are declared weak so that they can be overriden -** by a real implementation. +* Copyright (C) 2001 by Universitaet Karlsruhe +* All rights reserved. +* +* Authors: Goetz Lindenmaier +* +* dbginfo: This is a empty implementation of the Firm interface to +* debugging support. It only guarantees that the Firm library compiles +* and runs without any real debugging support. +* The functions herein are declared weak so that they can be overriden +* by a real implementation. */ /* $Id$ */ diff --git a/ir/debug/dbginfo.h b/ir/debug/dbginfo.h index 24a48c0bb..1cf81138a 100644 --- a/ir/debug/dbginfo.h +++ b/ir/debug/dbginfo.h @@ -1,18 +1,18 @@ /* -** Copyright (C) 2001 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Goetz Lindenmaier -** -** dbginfo: This is the Firm interface to debugging support. Firm requires -** a debugging module fulfilling this interface, else no debugging information -** is passed to the backend. -** The interface requires a datatype representing the debugging information. -** Firm supports administrating a reference to the debug information -** in every firm node. Further Firm optimizations call routines to -** propagate debug information from old nodes to new nodes if the optimization -** replaces the old ones by the new ones. -** +* Copyright (C) 2001 by Universitaet Karlsruhe +* All rights reserved. +* +* Authors: Goetz Lindenmaier +* +* dbginfo: This is the Firm interface to debugging support. Firm requires +* a debugging module fulfilling this interface, else no debugging information +* is passed to the backend. +* The interface requires a datatype representing the debugging information. +* Firm supports administrating a reference to the debug information +* in every firm node. Further Firm optimizations call routines to +* propagate debug information from old nodes to new nodes if the optimization +* replaces the old ones by the new ones. +* */ /* $Id$ */ @@ -38,16 +38,12 @@ typedef struct entity entity; typedef struct type type; #endif -/****s* dbginfo/dbg_info +/** * - * NAME - * dbg_info - An abstract data type containing information for + * An abstract data type containing information for * debugging support. - * NOTE * This datatype is not defined in the firm library, but pointers * to this type can be stored in firm nodes. - * SEE ALSO - * SOURCE */ typedef struct dbg_info dbg_info; /* Routines to access the field of an ir node containing the @@ -62,15 +58,11 @@ INLINE dbg_info *get_entity_dbg_info(entity *ent); debugging information. */ INLINE void set_type_dbg_info(type *tp, dbg_info* db); INLINE dbg_info *get_type_dbg_info(type *tp); -/*****/ -/****s* dbginfo/dbg_action +/** * - * NAME - * dbg_action - An enumeration indicating the action performed by a + * An enumeration indicating the action performed by a * transformation. - * NOTE - * SOURCE */ typedef enum { dbg_error = 0, @@ -87,17 +79,12 @@ typedef enum { dbg_write_after_read, dbg_max } dbg_action; -/*****/ -/****f* dbginfo/dbg_action_2_str +/** + * + * converts enum to string * - * NAME - * dbg_action_2_str - converts enum to string - * SYNOPSIS - * INPUTS - * RESULT - *** */ static const char* dbg_action_2_str(dbg_action a) { switch(a) { @@ -120,35 +107,27 @@ static const char* dbg_action_2_str(dbg_action a) { } -/****f* dbginfo/dbg_init +/** * - * NAME - * dbg_init - initializes the debug support. - * SYNOPSIS - * void dbg_init( void (merge_pair)(ir_node *nw, ir_node *old, dbg_action info), - * void (merge_sets)(ir_node **new_nodes, int n_new_nodes, - * ir_node **old_nodes, int n_old_nodes, - * dbg_action info)); - * INPUTS - * Pointers to two functions that merge the debug information when a - * transformation of a firm graph is performed. - * Firm transformations call one of these functions. + * initializes the debug support. + * @param Pointers to two functions that merge the debug information when a + * @param transformation of a firm graph is performed. + * @param Firm transformations call one of these functions. * - dbg_info_merge_pair() is called in the following situation: - * The optimization replaced the old node by the new one. The new node - * might be a recent allocated node not containing any debug information, - * or just another node from somewhere in the graph with the same - * semantics. + * @param The optimization replaced the old node by the new one. The new node + * @param might be a recent allocated node not containing any debug information, + * @param or just another node from somewhere in the graph with the same + * @param semantics. * - dbg_info_merge_sets() is called in the following situation: - * The optimization replaced a subgraph by another subgraph. There is no - * obviouse mapping between single nodes in both subgraphs. The optimization - * simply passes two lists to the debug module, one containing the nodes in - * the old subgraph, the other containing the nodes in the new subgraph. - * The same node can be in both lists. - * Further both functions pass an enumeration indicating the action - * performed by the transformation, e.g. the kind of optimization performed. - * RESULT - * No result. - *** + * @param The optimization replaced a subgraph by another subgraph. There is no + * @param obviouse mapping between single nodes in both subgraphs. The optimization + * @param simply passes two lists to the debug module, one containing the nodes in + * @param the old subgraph, the other containing the nodes in the new subgraph. + * @param The same node can be in both lists. + * @param Further both functions pass an enumeration indicating the action + * @param performed by the transformation, e.g. the kind of optimization performed. + * @return No result. + * */ diff --git a/ir/debug/dbginfo_t.h b/ir/debug/dbginfo_t.h index 7d977cb65..f84a4babe 100644 --- a/ir/debug/dbginfo_t.h +++ b/ir/debug/dbginfo_t.h @@ -1,14 +1,14 @@ /* -** Copyright (C) 2001 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Goetz Lindenmaier -** -** dbginfo: This is a empty implementation of the Firm interface to -** debugging support. It only guarantees that the Firm library compiles -** and runs without any real debugging support. -** The functions herein are declared weak so that they can be overriden -** by a real implementation. +* Copyright (C) 2001 by Universitaet Karlsruhe +* All rights reserved. +* +* Authors: Goetz Lindenmaier +* +* dbginfo: This is a empty implementation of the Firm interface to +* debugging support. It only guarantees that the Firm library compiles +* and runs without any real debugging support. +* The functions herein are declared weak so that they can be overriden +* by a real implementation. */ /* $Id$ */