[r588]

[r573]

[r570]

[r569]

fixed error in set_irn_in: backedge array was not updated

[r566]

irgopt: Bugfix in optimize_cf
irdump: added argument to dump_keep_alives

[r548]

by Sebastian Felis

[r543]

sather und fiasco tarvals entfernt

[r523]

[r514]

as no check for optimized nodes.

[r477]

dump const nodes local
access routines of ip_cfop nodes

[r474]

[r463]

  backedges (ana/backedge.h) and to represent loops
  (ana/irloop.h).  The scc algorithm (ana/irscc.c) builds
  both datastructures.
  The algorithm does not yet work properly for interprocedural
  graphs.  Finds more loops than only recursions.

  Improved place_code: now moves nodes out of loops.
  Fixed bug in iropt.c:  wrong parameter in debug info: iropt_dbg.c
  Now flag set_opt_control_flow can be set to 1 again.

[r457]

in dead node elimination.

[r453]

do not do the test and hope that the programmer did everything correct.

[r446]

[r445]

irprog.c: avoid endless loop

[r443]

frame und global type sind nicht mehr in irp_types

[r439]

[r432]

[r429]

[r409]

Optimization sitll looses information.

[r372]

  as well as the preprocessor flags are no more visible externaly.
  Adapted include directives.
  Bug: dominator construction aborts for BreakTest with flag 3.31
  Problem: optimization of many subsequent blocks (Jmp-chains)
  where one is inlined (Tuple control flow) in a loop.  Not all
  nodes in merged blocks are moved to remaining block.
  Fix:  different calling order to optimize_in_place_2 from
  optimize_in_place_wrapper.
  Bug: dumping cfg when a block is Bad.  Fix: Output Bad node.
  Change: not only turn off cse but all optimizations during
  inlining.

[r336]

[r326]

  Checked compiler flags -- sorted better to fit optimizations.

[r325]

  Implemented code placement.

[r323]

[r315]

[r311]

  implemented irout: backedges.  Added one field to ir_graph, one to ir_node.
  Implemented state management for irgraphs:  see irgraph.h.
  Must now call finalize_cons() after graph construction!!C

[r304]

  Adapted End node.
  Adapted Phi constructors so that memory phis are added.
  Adapted Cond optimization: add block to End.
  Adapted dead node elimination: compation of Ends predecessors
  Adapted inlineing:  remember keepalives of inlined graph.
  Added informative strings to asserts in irvrfy.

[r301]

mfortable" construction interface by some methods
  serving as simple shortcuts.

  30.11.2001 Goetz
  Added a class type to irgs.  This class type is to be used as owner
  for local entities of the procedure. This are all entities allocated
  for each execution of the procedure.
  The class type is allocated automatically by new_ir_graph().  Access
  routines to get this type are in irgraph.h.
  We chose a class type as this allows to represent "inner" procedures
  as, e.g., in Pascal.
  Adapted array-stack-example.

[r285]

[r279]

[r275]

  Added functionality to irgmod:
  * collect all Phi nodes as link-list in th eBlocks link field
  * collect all Proj nodes as link-list in node productin the tuple
  * Seperate a Block into two
  Added inlining transformation in irgopt.h
  Improved output of dump_ir_block_graph.  Now also dumps nodes that
  don't belong to a block.
  Added flag opt_unreachable_code, opt_inline.
  Changed irvrfy so that it accepts nodes with Bad predecessors.

[r272]

irmode.c : changed sizes

[r269]

[r250]

  for cse
VS: ----------------------------------------------------------------------

[r249]

[r130]

#ifdef HAVE_CONFIG_H
# include <config.h>
#endif

and replaced C++ comments bt standard C comments

[r109]

tChanges
:wq

[r104]