[r983]

[r967]

[r827]

[r825]

for compound types.

[r793]

[r767]

[r726]

new dumper

[r675]

[r635]

[r603]

[r594]

[r569]

[r514]

changed functiontype in irgwalk to not include the pointer *.
This can be removed if crecoder includes a type analysis so that
it can find out whether a typedef is a pointer.

[r509]

[r506]

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]

frame und global type sind nicht mehr in irp_types

[r439]

[r432]

[r429]

[r415]

[r409]

[r386]

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]

  Checked compiler flags -- sorted better to fit optimizations.

[r325]

  Implemented code placement.

[r323]

irdom implemented: dominator information.

[r321]

more general.

[r313]

  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]

  bug in oo_program_example.

[r291]

  their use.  Extended dumper routines to dump constant values.

[r287]

[r279]

  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]

[r214]

Optimizations during construction are save.  For others first
transform to standard flavor.  Optimization of Cond is
turned of for new flavor.

[r211]

[r153]

[r141]