2 Implemented scc algorithm. Added datastructure to mark
3 backedges (ana/backedge.h) and to represent loops
4 (ana/irloop.h). The scc algorithm (ana/irscc.c) builds
6 The algorithm does not yet work properly for interprocedural
7 graphs. Finds more loops than only recursions.
9 Improved place_code: now moves nodes out of loops.
10 Fixed bug in iropt.c: wrong parameter in debug info: iropt_dbg.c
11 Now flag set_opt_control_flow can be set to 1 again.
15 u.a. Zugrffsfkt normalisiert,
16 global, frame type nicht mehr in irp_types
18 mehr Zugriffsfkt bei entitaeten
22 Added several constructors to tv.
23 Changed xgprintf so that full precision of double tvs is printed.
24 Fixed bug in irouts.c.
27 Added debug support, renamed stuff in ir/debug.
28 Optimizations still loose debug information.
31 Added flag "peculiarity" to entity.h, type.h.
34 Bug: dominator construction aborts for BreakTest with flag 3.31
35 Problem: optimization of many subsequent blocks (Jmp-chains)
36 where one is inlined (Tuple control flow) in a loop. Not all
37 nodes in merged blocks are moved to remaining block.
38 Fix: different calling order to optimize_in_place_2 from
39 optimize_in_place_wrapper.
40 Bug: dumping cfg when a block is Bad. Fix: Output Bad node.
41 Change: not only turn off cse but all optimizations during
45 Parted common.h into two files common_t.h. By this config.h
46 as well as the preprocessor flags are no more visible externaly.
47 Adapted include directives.
50 Bugfix in inlining: problems in combination with cse.
53 Implemented cf optimizations.
54 Checked compiler flags -- sorted better to fit optimizations.
58 Implemented code placement.
62 irdom implemented: dominator information.
65 Bugfix Optmierung Binops mit mode Tupel.
68 irgopt: inline_small_irgs implemented
71 Bugfixes, some access functions ...
74 New directory: ana for analyses. Adapted configure/makefiles
75 implemented irout: backedges. Added one field to ir_graph, one to ir_node.
76 Implemented state management for irgraphs: see irgraph.h.
77 Must now call finalize_cons() after graph construction!!
81 Flag pinned in irop, irgraph.
82 Global cse in irop, setting the irgraph flag.
83 Example programs: Endless_loop.c. global_cse.c.
87 Implemented support for endless loops:
89 Adapted Phi constructors so that memory phis are added.
90 Adapted Cond optimization: add block to End.
91 Adapted dead node elimination: compation of Ends predecessors
92 Adapted inlineing: remember keepalives of inlined graph.
93 Added informative strings to asserts in irvrfy.
96 Added volatile flag to entity, order flag to array.
97 Added a set of assertions.
100 Added access function set_class_members()
103 Asserts in irvrfy that verify the mode of Proj nodes. For Start,
104 Call, Return they check the corresponding function type! Corrected
105 bugs in testprograms.
106 Some asserts for legal values of 'pos' arguments in type/entity
110 Some access routines for visited flags in entity.h, irnode.h,
111 bug in oo_program_example.
114 Removed all obsolete Makefiles
117 Added support for constant entities. A new example program illustrates
118 their use. Extended dumper routines to dump constant values.
121 Extendend "comfortable" construction interface by some methods
122 serving as simple shortcuts.
125 Added a class type to irgs. This class type is to be used as owner
126 for local entities of the procedure. This are all entities allocated
127 for each execution of the procedure.
128 The class type is allocated automatically by new_ir_graph(). Access
129 routines to get this type are in irgraph.h.
130 We chose a class type as this allows to represent "inner" procedures
132 Adapted array-stack-example.
135 irdump outputs nodeids instead of pointers for labels of nodes.
136 With a preprocessor flag in common.h this can be turned off.
139 Added an Id tag to every .c and .h file
142 Changed SSA constuction for exception control flow.
143 If PRECISE_EXC_CONTEXT is used Phi nodes will use the values
144 valid when the execption operation was allocated. This increases
145 the memory consuption of the construction algorithm by
146 n_loc * #fragile_ops.
149 Added method to replace in array of a node in irnode.c/h
150 Added functionality to irgmod:
151 * collect all Phi nodes as link-list in the Blocks link field
152 * collect all Proj nodes as link-list in node producing the tuple.
153 * Seperate a Block into two
154 Added inlining transformation in irgopt.h
155 Improved output of dump_ir_block_graph. Now also dumps nodes that
156 don't belong to a block.
157 Added flag opt_unreachable_code, opt_inline.
158 Changed irvrfy so that it accepts nodes with Bad predecessors.
161 renamed get_type_nameid to get_type_ident
164 Bugfix: dead node elimination did not replace the hash table
168 Added routine remove_irp_irg.
169 Changed comment to free_ir_graph.
172 Added routine to free irgraphs.
175 Improved add routines to sub, supertype in type.c
178 Added implementation of overwrites stuff.
181 Implemented stuff to change the type graph. See
182 typegmod.h and tpop.h for basic documentation of the change.
183 There now exists a type of kind type_id. If this appears
184 externally this is a bug.
187 Added some new access routines to types.
188 List of overwritten fields for entities.
189 Removed a bug in irnode.
192 Added a routine to set the mangled entity name.
193 Added two routines to copy entites.
196 Entities now have two more flags, for visibility and allocation mode.
197 Types that have a layout have a flag indicating whether the layout is
201 We distinguish three kinds of Cond nodes. These can be distinguished
202 by the mode of the selector operand and an internal flag of type cond_kind.
203 First we distinguish binary Conds and switch Conds.
204 A binary Cond has as selector a boolean value. Proj(0) projects the control
205 flow for case "False", Proj(1) the control flow for "True". A binary Cond
206 is recognized by the boolean selector.
207 The switch Cond has as selector an unsigned integer. It produces as result
208 an n+1 Tuple (cf0, ... , cfn) of control flows.
209 We differ two flavours of this Cond. The first, the dense Cond, passes
210 control along output i if the selector value is i, 0 <= i <= n. If the
211 selector value is >n it passes control along output n.
212 The second Cond flavor differes in the treatment of cases not specified in
213 the source program. It magically knows about the existence of Proj nodes.
214 It only passes control along output i, 0 <= i <= n, if a node Proj(Cond, i)
215 exists. Else it passes control along output n (even if this Proj does not
216 exist.) This Cond we call "fragmentary". There is a special constructor
217 new_defaultProj that automatically sets the flavor.
218 The two switch flavors are distinguished by a flag of type cond_kind.
219 Default flavor is "dense"
223 tv now implements Minus, Abs.
224 iropt now optimizes these and Div, Mod, Quot, DivMod.
225 Still missing: Shrs, Rot.
226 tarval_shr somtimes performs shrs, depending on the compiler/system!!
227 If the ArmRoq implementation is faulty there might appear errors.
230 Changed ircons: If undefined values are used the Phi construction
231 inserts a constant with value tarval_bad.
234 Changed array bounds in type.h to ir_node*. This allows to
235 construct array bounds that are complex constant expressions
236 simpler. Further dynamic array bounds can be displayed.
237 Comment in ircons.c extended: undefined values in start_block.
240 ifdef'ed all uses of gmp in tv.c away. Optimizations for
241 mode_Z no more supported, as well as constants of that mode.
244 Dokumentation in ir_dump
245 Habe Routinen fuer einzelne Knoten/Kanten aus header entfernt:
246 Benutzen globale Variable die nicht oeffentlich zugaenglich ist.
249 We need an entity for the array elements for the Sel nodes. This
250 entity should be stored in the array type. Changed constructor
251 parameters: include array element type. Entity for elements is built
256 Faulty use of va_arg, became visible with new, stricter gcc 2.96.
259 Added list of member entites to union. unioned_types and delimiters
260 are superfluous now -- removed.
261 Rationale: we want to express selection of a union member as a Sel
262 node. for this we need to have entities. The entities contain the
263 unioned type and have as name the delimiters...
266 Changed Makefile/MakeTargets to install headers and libraries
270 Changed Makefile and Configure scripts to produce a proper tar file
271 for distribution (libfirm-VERSION.tar)
272 Use 'make distrib' instead of 'make dist'
275 Changed implementation of tr module. With this I also changed the
276 interface!! Type casts are unnecessary now, but some access funcions
280 ======================================================================
281 ==================== New version: 0.3.0 ==============================
282 ======================================================================
288 added creation of a tar archive for distribution
289 replaced ir/.dummy.in by ir/Makefile.in
292 Changed equivalent_node() and copy_preds() so that the end block
293 is not optimized away if it has no real predecessors. This fixes
294 the problem with the while examples.
295 Added while_example in Makefile
298 Fooled around with if_while_example: Why does cse make it abort?
299 Cse removes path to End node, Bad remains as pred of Endblock.
300 The block walker can't deal with this.
301 Made new example with only loop: while_example.
304 added auto documentation in Makefiles, configure, etc
305 example in ir/ir/ircons.c - much must be added
306 creation of documentation by 'make autodoc' in architecture directory
309 added lots of #ifdef HAVE_CONFIG_G #include "config.h" #endif
310 replaced some C++ style comments (//) by standard C comments /**/
313 - configure (with some features, see --help for more)
314 - make [depend | tags | install]
315 - make [run] in testprograms
317 - compilation on SunOS
319 - automatic call of autoconf if required
322 More colours in vcg output.
323 Fixed bug: cse found that start block equals it's
324 first successor as both have the Start block as predecessor.
325 This only happens for local_optimize_graph() as during construction
326 the Start block is not entered in the value table.
327 Changed implementation: irgmod: local_optimize_graph() did not
328 empty the hash table with the irnodes for cse. This might cause that
329 cse turns up with a node that seems better but was removed from the
330 graph in an earlier optimization phase.
331 Removed old #if 1 from ircons.c
332 Commented in call of optimization for Block nodes in irgopt.c, copy_preds():
333 Optimizes blocks that had bad predecessors.
338 Moved struct from irprog.h to irprog_t.h, same for irmode.h.
339 Added a module deb_info in debug.h. Adapted makefile. Added example
341 Removed use of debug.h in ident.c. Now debug.c|h can be moved to
343 Removed inabled code for dead node elimination in irgopt.h.
344 Renamed some missnamed access routines (_of_). Macros with old names
345 are in old_fctnames.h.
346 Edited makefiles to remove #* and *.flc.
349 Some minor bugfixes...
352 After compacting of in arrays in dead_node_elimination
353 merge blocks and remove Phis with one pred.
356 Freeing of obstack in dead_node_elimination commented in.
357 Compacting in arrays of Block and Phi nodes in dead_node_
362 added set/get_SymConst_type_or_id in irnode.h
363 added field offset to entity in entity.h
364 added field size to type_class in type.h
365 include "gmp.h" in tv.h with "" instead <>
368 Some changes to make the lib better portable
371 Initialize max_node_nr in irprog.
374 Now outputs warning if faulty type in irdump, dump_type_info.
375 Explicit string termination in irdump, vcg_open.
378 Added external to declaration of irp.
379 Added typedef before pns and pnc_number.
380 irmode.c, init_mode(): We need to memset all new modes as
381 tarval_vrfy reads fields before they are initialized: It
382 compares to min/max when tarvals for min/max are allocated!
385 Changed parameter of Methods in type.h and type.c from
386 class to clss. Class is a C++ keyword.
389 Changed some testprograms to accomodate Uebprakt.
392 Finished implementation of dump_all_types.
393 Added new testprogram inheritance_example.
396 Added seven access routines in type.[hc]:
397 get_class_n_member, get_class_n_subtype, get_class_n_supertype,
398 get_strct_n_member, add_strct_member, get_strct_member and set_strct_member.
399 Fixed the type_walk_2 for those seven routines.
402 Added irdump routine dump_all_types.
403 Did changes to irprog, type, typewalk to achieve this.
404 typewalk needs to walk along members, sub and supertypes, this
405 is still missing! irdump then needs to output these edges.
407 ======================================================================
408 ==================== New version: 0.2.5 ==============================
409 ======================================================================
412 Made new Version: 0.2.5
414 15.8.2000 Goetz until 3.9.00
415 Separated irnode.h and many others into two files: one public
417 Added funcionality to extract headers for lib.
420 type_dump also dumps irg->ent
421 if_example: corrected nr of locals
424 irgopt: Correct copy of self pointer in start block.
425 irgopt: Correct treatment of loops: pre function in walker
426 breaks all possible loops in Phi and Block nodes.
427 irr_loop_example: wrong Return statement
428 Now I fixed all but one error: in memory_example.
429 This error showed a conceptual problem, so I wrote
430 a slightly different algorithm. This now runs for
432 dead_node_example: cse is buggy!! merges start and the
436 looking at bug in dead_node_elimination.
438 irnode: all get_..._arr functions changed
439 ircons: new_r_Block: set matured flag.
440 ircons: new_r_SymConst: needs mode_p for linkage_ptr_info.
441 adapted call_str_example to new concepts.
444 Implemented simpler Phi construction algorithm that constructs
445 correct code for three_cfpred_example in ircons. This algorithm
446 generates more Id nodes than the original algorithm and therefore
448 Also made some changes to optimizations of Not.
451 Fixed a bug, caused by the recursive use in type.h and entity.h.
452 Deleted the _TYPE_TYPEDEF_ and inserted the _ENTITY_TYPEDEF_ instead.
453 Fixed a problem in if_while testprogram, so it now works.
456 Fixed bug in optimize(). Returned Null instead n if
457 get_optimize() == false.
460 Added some access routines in type.[hc]. Solved a recursive definition
461 of type_class struct, entity struct and type union.
464 Separated entity header into pure functional header and header
468 ... a bunch small changes not documented
471 Changed output of oo_prog_example: now uses the internal list
472 of all irgs. Had to implement some of the access routines for
473 that. Also fixed a bug in irdump. Main routines did not use
474 current_ir_graph properly.
477 Implemented some missing parts in irgopt.
478 Added field irg to entity. Only valid if entity is a method.
479 Had to resove a cyclic de[endency between irgraph.h and entity.h
481 Added fields sub and super to type_class for inheritance.
482 Added field main_irg to irprog.
485 Fixed some bugs in irgopt.c
486 Added some missing 'get_new_node' methods, so the new obstack contains
490 Renamed ir_vrfy to irn_vrfy and vrfy_graphg to irg_vrfy.
491 Solved some copy'n'paste problems. Deleted most debug-code!
492 Added comments to several files.
495 Fixed bug in _r_ constructors for all four Div operations.
496 Fixed bug in turn_into_tuple: didn't remember the block.
497 Tested transform_node.
500 Fixed some testprograms to new semantics of firm.
501 Added testprogram global_var_example.
502 Fixed a bug in irop: Size of Sel node was (entity *) instead of
503 sel_attr. Therefor array_heap_example aborted.
504 Also found a missing break in typewalk, case iro_Alloc.
505 Added a construct that unifies all things constructed by the lib
506 and needed to represent a program: irprog.ch
507 This contains a list of all types as well as a list of all ir graphs.
508 I added calls to initialization and constructors so that this is constructed
509 automatically. I changed firm.c, type.c, irgraph.c and ev. more.
510 Removed strange block struct and constructor from ircons.c.
511 Moved routines for automatic Phi construction from irgmod to ircons.
512 Sorted functions in ircons to reflect the different interfaces.
513 Renamed dataseg to globals to be conformant with documentation.
514 Added conservation of current_ir_graph to irgopt.c.
515 Corrected bug in Makefiles: wrong path to directory ./inlude.
518 Commented a whole bunch of stuff, e.g. in ircons.h (Procedure to construct)
519 We should change the naming of the Block constructor.
520 Removed acces routines to attr. "closed" of Block.
521 Removed second implementation of new_ir_node from ircons and some comments
522 concerned with the now resolved cyclic dependency.
523 Fixed some bugs in irgopt so that the compilation goes through.
526 Changed the irnode attribut 'visit' into 'visited'.
527 Added some access functions, like get/set_irn_visit etc.
530 Renamed some access funtion in irgraph.*.
531 Deleted two global flags (ir_visited and block_visited) from irgraph.*.
532 Added two attributes to the irgraph struct. The visited flags belongs
533 to a ir graph, not to a whole program.
536 A new optimization has been finished. The dead-node-elimination copies
537 the existing ir graph from one opstack to another. While walking the
538 graph, only the reachable nodes will be copied, so the "dead-nodes"
539 (unreachable in the controlflow) are removed.
542 Solved some problems in the 'copy_node' function. The in array was not
543 as easy as it seamed.
546 Wrote a new 'post' funtion, for future use in 'dead-node-elimination'
547 optimization, which is needed in the paramter list of 'irg_walk'.
550 Moved 'optimze_in_place_wrapper' from iropt.* tothe new files irgopt.*.
551 New functions 'local_optimze_graph' and 'dead_node_elimination' are added,
555 Removed some files from the archive, after dependencies and usage are
557 - 'ir/common/strerror.c'
559 - 'ir/ident/xx_ident.h'
560 an empty file, only included by 'ident.c', but never used;
561 - 'ir/tv/label.c' and
563 contained a numeric counter;
564 The files were included in 'tv.h' and implemented in 'tarval.c'. The two
565 functions 'tarval_label' and 'tarval_forall_labeled' were also never used.
566 In the old fiasco compiler, the label thing is used in the backend.
567 Search for 'babil' to see the usage.
568 Also removed the two attributes 'lab' and 'used' in the tarval struct.
571 Moved the 'new_ir_node' constructor from ircons.* to irnode.* and fixed
572 afterwards some recursive includes, so libfirm works again.
575 Did a lot of changes, which I never commented until now (4.7.00).
577 * Added new result to Start node: Pointer to global data segment.
578 * Extended Semantics of SymConst node to represent information for the
580 * Added arithmeitc nodes (Shrs, Minus ...)
582 Rearranged the directory structure and adjusted the makefiles.
583 The directories contain:
584 ir: everything for the intermediate representation (better: src?)
585 /ir: the ir itself, and standard optimizations.
586 /tv: the target value module
587 /tr: the type and entity representation
588 /adt: abstract data types
589 /common: stuff needed by all other dirs
590 /debug: debugging Unterstuetzung
592 include: external files needen as includes
593 testprograms: examples to test the lib.
595 The makefiles generate files with extension .d that contain the dependencies
599 Added access routine to attribute link of irnode in irnode.ch.
600 Added get_negated_pnc to irnode.ch.
603 Added an iterator in iropt that calls the optimization for all nodes.
604 Copied optimize's code to optimize_in_place and removed deallocations.
605 Made set_irn_n in irnode.c public.
606 Added Bad as possible cfg predecessor in is_cfg_node in irnode. Bads
607 are allowded as cfgpredecessors to represent dead "incoming" control
609 Added call to optimize_in_place in mature_block. Is this useful?
612 Changed tests from comparing enums to comparing pointers. This is more
613 efficient (is it?) and reads better. e.g., instead get_irn_opcode == irm_And
614 now get_irn_op == op_And
617 Compared equivalent_value to the one in the original fiasco.
618 Added a test in case iro_And.
619 Changed implementation of iro_Div. Added routines turn_into_tuple
620 and set_irn_op() in irgmod/irnode.
621 Changed implementation of irn_Minus (although commented out).
622 Now all features are ported or documented for this function.
625 Compared computed_value to the one in the original fiasco.
626 Added one further optimization in case iro_Proj.
627 Now all features are ported for this function.
630 Updated comments in ircons.h.
633 Changed possible attribute of SymConst from type_class to type.
634 SymConst size could be the size of a union, array, ...
637 Implemented two dumpers that dump type information and a graph with
641 Implemented a walker that walks over the type informatin that can
642 be reached from an ir node.
643 Added routine get_kind(firm_thing) in common.h, Added file common.c.
644 Added files typewalk.ch and routines to irdump.
645 Added visited flags and initialization to entity and all types.
646 Implemented some of the missing access routines in type.c, entity.c
649 Implemented constructor for ShrA.
651 Added routine that iterates the graph and verifies all nodes.
652 Added Phi_in stack to irgraph. This allows to build several
653 graphs at once with respect to the Phi building algorithm.
656 Implemented dumper for control flow graphs. Changed irr_* and dead_*
657 examples to dump cfg.
660 Implemeted explicit stack for the Phi node generation. See ircons.c.
663 added include string.h in xoprintf.c to get rid of warning:
664 implicit declaration of function `bcopy'
668 Added more cases to equivalent_node.
669 Portet gigo, identify, identify_remember.
670 The set/pset library can not handle several hash tables. At least,
671 compiling several procedures causes a segmentation fault during access
672 to the tables (oo_program_example). Need to work on this.
673 transform_node still needs to be ported.
674 some cases in equivalent_node are still missing.
676 To get it running I had to remove the call to optimize in the
677 new_Block constructor. It can only be called when the Block is
681 Introduced a walker that walks only over blocks. The asserts
682 might be too strict for general graphs, but so far it works.
683 For the walker I introduced an additional flag in the attribute
684 of Blocks, an a global block_visited variable (in irgraph.h).
685 Furhter I modularized dump_ir_node, implemented dump_ir_graph
686 with the existing walker, and added new routines to output a
688 Changed the examples to call the new dump routine.
691 Added auxiliary routines to ir_node:
692 skip_Proj, skip_Nop, is_Bad ...
693 Changed access routines to use get_irn_n instead of explicit array
694 accesses. Changed get_irn_n to call skip_Id, so that the access routines
695 never will return Id nodes.
698 Repaired Phi computation, changed new_r_Phi_in. Added test program to
699 test irregular controlflow.
702 Updated optimizations computed_value and equivalent_node to new
703 Syntax of FIRM nodes and to use access routines.
704 Added routine skip_Proj in irnode.
706 2.2.2000 Boris Boesler
707 Added files irgwalk.c and irgwalk.h. They include a simple function to
708 traverse an ir graph and execute pre and post functions to current node.
711 Added arrays with parameters and result types to the type informtion
712 of a procedure. This is needed for the code generation. Also added
713 the corresponding access routines.
714 Adapted the testprograms.
717 Found a bug / complication: the call order
718 get_value (makes Phi0, put's it into graph_arr)
719 set_value (overwrites Phi0 in graph_arr)
720 mature_block (upgrades Phi0, puts it again into graph_arr, overwriting
722 fails. Added test wether graph_arr is already set in phi_merge.
724 Added tons of comments to explain Phi generation -- the stack hack.
728 irdump now outputs the pnc_number for projs of Cmp nodes.
729 Added routine to access the pnc_string.
732 Added result "dataseg" to Start node, with all it's consequences.
733 We need this for the compiler lab to translate global variables.
734 Now they can be selected from the data segment, and the start
735 node supplies the pointer to this segment.
736 These changes are guarded by preprocessor variable UEBPRAKT in
738 Changed files: common.h, irgraph.ch, irnode.h
742 removed array_example, added array-heap_example and
743 array-stack_example and adapted makefile.
745 Entity now also allows type_method as owner. This is to model
746 the stack, Sel nodes that select a variable (array) from the
747 stack need an entity that describes what they select. This
748 entity gets the type of the enclosing procedure as owner.
751 Added future access routines in `irmode.[ch]' as comments,
752 that all attributes in the ir_mode struct can be user-defined.
753 Added access routines in `irgraph.[ch]', for all attributes.
756 Moved verify routines from `irgraph.[ch]' to own files `irvrfy.[ch]'.
757 Added `irvrfy.[ch]' to MAKEFILE
758 Added "inline" before access routines in `irnode.h', that no warnings
759 will appear furthermore.
760 Added three more access routines in `irmode.[ch]':
761 struct tarval *get_min_of_mode (ir_mode *mode);
762 struct tarval *get_max_of_mode (ir_mode *mode);
763 struct tarval *get_null_of_mode (ir_mode *mode);
766 Adaption of Alloc, Sel and Entity to new types:
767 Changed array_example to use type instead of type_class.
768 Changed entity to allow all types as owner instead of
769 only type_class. Added routine "assert_legal_owner_of_ent(type* type)".
770 Changed alloc to allow allocating variables of any type instead of
772 Adapted all testprograms to avoid warnings.
774 removed dtest ... from Makefile, replaced by test.
777 Added "run" to makefile, added array_example to makefile of testprograms.
778 Corrected testprogram array
779 Changed assert in irvrfy -- Conv.
projects / libfirm / blob