3 irdom implemented: dominator information.
6 Bugfix Optmierung Binops mit mode Tupel.
9 irgopt: inline_small_irgs implemented
12 Bugfixes, some access functions ...
15 New directory: ana for analyses. Adapted configure/makefiles
16 implemented irout: backedges. Added one field to ir_graph, one to ir_node.
17 Implemented state management for irgraphs: see irgraph.h.
18 Must now call finalize_cons() after graph construction!!
22 Flag pinned in irop, irgraph.
23 Global cse in irop, setting the irgraph flag.
24 Example programs: Endless_loop.c. global_cse.c.
28 Implemented support for endless loops:
30 Adapted Phi constructors so that memory phis are added.
31 Adapted Cond optimization: add block to End.
32 Adapted dead node elimination: compation of Ends predecessors
33 Adapted inlineing: remember keepalives of inlined graph.
34 Added informative strings to asserts in irvrfy.
37 Added volatile flag to entity, order flag to array.
38 Added a set of assertions.
41 Added access function set_class_members()
44 Asserts in irvrfy that verify the mode of Proj nodes. For Start,
45 Call, Return they check the corresponding function type! Corrected
47 Some asserts for legal values of 'pos' arguments in type/entity
51 Some access routines for visited flags in entity.h, irnode.h,
52 bug in oo_program_example.
55 Removed all obsolete Makefiles
58 Added support for constant entities. A new example program illustrates
59 their use. Extended dumper routines to dump constant values.
62 Extendend "comfortable" construction interface by some methods
63 serving as simple shortcuts.
66 Added a class type to irgs. This class type is to be used as owner
67 for local entities of the procedure. This are all entities allocated
68 for each execution of the procedure.
69 The class type is allocated automatically by new_ir_graph(). Access
70 routines to get this type are in irgraph.h.
71 We chose a class type as this allows to represent "inner" procedures
73 Adapted array-stack-example.
76 irdump outputs nodeids instead of pointers for labels of nodes.
77 With a preprocessor flag in common.h this can be turned off.
80 Added an Id tag to every .c and .h file
83 Changed SSA constuction for exception control flow.
84 If PRECISE_EXC_CONTEXT is used Phi nodes will use the values
85 valid when the execption operation was allocated. This increases
86 the memory consuption of the construction algorithm by
90 Added method to replace in array of a node in irnode.c/h
91 Added functionality to irgmod:
92 * collect all Phi nodes as link-list in the Blocks link field
93 * collect all Proj nodes as link-list in node producing the tuple.
94 * Seperate a Block into two
95 Added inlining transformation in irgopt.h
96 Improved output of dump_ir_block_graph. Now also dumps nodes that
97 don't belong to a block.
98 Added flag opt_unreachable_code, opt_inline.
99 Changed irvrfy so that it accepts nodes with Bad predecessors.
102 renamed get_type_nameid to get_type_ident
105 Bugfix: dead node elimination did not replace the hash table
109 Added routine remove_irp_irg.
110 Changed comment to free_ir_graph.
113 Added routine to free irgraphs.
116 Improved add routines to sub, supertype in type.c
119 Added implementation of overwrites stuff.
122 Implemented stuff to change the type graph. See
123 typegmod.h and tpop.h for basic documentation of the change.
124 There now exists a type of kind type_id. If this appears
125 externally this is a bug.
128 Added some new access routines to types.
129 List of overwritten fields for entities.
130 Removed a bug in irnode.
133 Added a routine to set the mangled entity name.
134 Added two routines to copy entites.
137 Entities now have two more flags, for visibility and allocation mode.
138 Types that have a layout have a flag indicating whether the layout is
142 We distinguish three kinds of Cond nodes. These can be distinguished
143 by the mode of the selector operand and an internal flag of type cond_kind.
144 First we distinguish binary Conds and switch Conds.
145 A binary Cond has as selector a boolean value. Proj(0) projects the control
146 flow for case "False", Proj(1) the control flow for "True". A binary Cond
147 is recognized by the boolean selector.
148 The switch Cond has as selector an unsigned integer. It produces as result
149 an n+1 Tuple (cf0, ... , cfn) of control flows.
150 We differ two flavours of this Cond. The first, the dense Cond, passes
151 control along output i if the selector value is i, 0 <= i <= n. If the
152 selector value is >n it passes control along output n.
153 The second Cond flavor differes in the treatment of cases not specified in
154 the source program. It magically knows about the existence of Proj nodes.
155 It only passes control along output i, 0 <= i <= n, if a node Proj(Cond, i)
156 exists. Else it passes control along output n (even if this Proj does not
157 exist.) This Cond we call "fragmentary". There is a special constructor
158 new_defaultProj that automatically sets the flavor.
159 The two switch flavors are distinguished by a flag of type cond_kind.
160 Default flavor is "dense"
164 tv now implements Minus, Abs.
165 iropt now optimizes these and Div, Mod, Quot, DivMod.
166 Still missing: Shrs, Rot.
167 tarval_shr somtimes performs shrs, depending on the compiler/system!!
168 If the ArmRoq implementation is faulty there might appear errors.
171 Changed ircons: If undefined values are used the Phi construction
172 inserts a constant with value tarval_bad.
175 Changed array bounds in type.h to ir_node*. This allows to
176 construct array bounds that are complex constant expressions
177 simpler. Further dynamic array bounds can be displayed.
178 Comment in ircons.c extended: undefined values in start_block.
181 ifdef'ed all uses of gmp in tv.c away. Optimizations for
182 mode_Z no more supported, as well as constants of that mode.
185 Dokumentation in ir_dump
186 Habe Routinen fuer einzelne Knoten/Kanten aus header entfernt:
187 Benutzen globale Variable die nicht oeffentlich zugaenglich ist.
190 We need an entity for the array elements for the Sel nodes. This
191 entity should be stored in the array type. Changed constructor
192 parameters: include array element type. Entity for elements is built
197 Faulty use of va_arg, became visible with new, stricter gcc 2.96.
200 Added list of member entites to union. unioned_types and delimiters
201 are superfluous now -- removed.
202 Rationale: we want to express selection of a union member as a Sel
203 node. for this we need to have entities. The entities contain the
204 unioned type and have as name the delimiters...
207 Changed Makefile/MakeTargets to install headers and libraries
211 Changed Makefile and Configure scripts to produce a proper tar file
212 for distribution (libfirm-VERSION.tar)
213 Use 'make distrib' instead of 'make dist'
216 Changed implementation of tr module. With this I also changed the
217 interface!! Type casts are unnecessary now, but some access funcions
221 ======================================================================
222 ==================== New version: 0.3.0 ==============================
223 ======================================================================
229 added creation of a tar archive for distribution
230 replaced ir/.dummy.in by ir/Makefile.in
233 Changed equivalent_node() and copy_preds() so that the end block
234 is not optimized away if it has no real predecessors. This fixes
235 the problem with the while examples.
236 Added while_example in Makefile
239 Fooled around with if_while_example: Why does cse make it abort?
240 Cse removes path to End node, Bad remains as pred of Endblock.
241 The block walker can't deal with this.
242 Made new example with only loop: while_example.
245 added auto documentation in Makefiles, configure, etc
246 example in ir/ir/ircons.c - much must be added
247 creation of documentation by 'make autodoc' in architecture directory
250 added lots of #ifdef HAVE_CONFIG_G #include "config.h" #endif
251 replaced some C++ style comments (//) by standard C comments /**/
254 - configure (with some features, see --help for more)
255 - make [depend | tags | install]
256 - make [run] in testprograms
258 - compilation on SunOS
260 - automatic call of autoconf if required
263 More colours in vcg output.
264 Fixed bug: cse found that start block equals it's
265 first successor as both have the Start block as predecessor.
266 This only happens for local_optimize_graph() as during construction
267 the Start block is not entered in the value table.
268 Changed implementation: irgmod: local_optimize_graph() did not
269 empty the hash table with the irnodes for cse. This might cause that
270 cse turns up with a node that seems better but was removed from the
271 graph in an earlier optimization phase.
272 Removed old #if 1 from ircons.c
273 Commented in call of optimization for Block nodes in irgopt.c, copy_preds():
274 Optimizes blocks that had bad predecessors.
279 Moved struct from irprog.h to irprog_t.h, same for irmode.h.
280 Added a module deb_info in debug.h. Adapted makefile. Added example
282 Removed use of debug.h in ident.c. Now debug.c|h can be moved to
284 Removed inabled code for dead node elimination in irgopt.h.
285 Renamed some missnamed access routines (_of_). Macros with old names
286 are in old_fctnames.h.
287 Edited makefiles to remove #* and *.flc.
290 Some minor bugfixes...
293 After compacting of in arrays in dead_node_elimination
294 merge blocks and remove Phis with one pred.
297 Freeing of obstack in dead_node_elimination commented in.
298 Compacting in arrays of Block and Phi nodes in dead_node_
303 added set/get_SymConst_type_or_id in irnode.h
304 added field offset to entity in entity.h
305 added field size to type_class in type.h
306 include "gmp.h" in tv.h with "" instead <>
309 Some changes to make the lib better portable
312 Initialize max_node_nr in irprog.
315 Now outputs warning if faulty type in irdump, dump_type_info.
316 Explicit string termination in irdump, vcg_open.
319 Added external to declaration of irp.
320 Added typedef before pns and pnc_number.
321 irmode.c, init_mode(): We need to memset all new modes as
322 tarval_vrfy reads fields before they are initialized: It
323 compares to min/max when tarvals for min/max are allocated!
326 Changed parameter of Methods in type.h and type.c from
327 class to clss. Class is a C++ keyword.
330 Changed some testprograms to accomodate Uebprakt.
333 Finished implementation of dump_all_types.
334 Added new testprogram inheritance_example.
337 Added seven access routines in type.[hc]:
338 get_class_n_member, get_class_n_subtype, get_class_n_supertype,
339 get_strct_n_member, add_strct_member, get_strct_member and set_strct_member.
340 Fixed the type_walk_2 for those seven routines.
343 Added irdump routine dump_all_types.
344 Did changes to irprog, type, typewalk to achieve this.
345 typewalk needs to walk along members, sub and supertypes, this
346 is still missing! irdump then needs to output these edges.
348 ======================================================================
349 ==================== New version: 0.2.5 ==============================
350 ======================================================================
353 Made new Version: 0.2.5
355 15.8.2000 Goetz until 3.9.00
356 Separated irnode.h and many others into two files: one public
358 Added funcionality to extract headers for lib.
361 type_dump also dumps irg->ent
362 if_example: corrected nr of locals
365 irgopt: Correct copy of self pointer in start block.
366 irgopt: Correct treatment of loops: pre function in walker
367 breaks all possible loops in Phi and Block nodes.
368 irr_loop_example: wrong Return statement
369 Now I fixed all but one error: in memory_example.
370 This error showed a conceptual problem, so I wrote
371 a slightly different algorithm. This now runs for
373 dead_node_example: cse is buggy!! merges start and the
377 looking at bug in dead_node_elimination.
379 irnode: all get_..._arr functions changed
380 ircons: new_r_Block: set matured flag.
381 ircons: new_r_SymConst: needs mode_p for linkage_ptr_info.
382 adapted call_str_example to new concepts.
385 Implemented simpler Phi construction algorithm that constructs
386 correct code for three_cfpred_example in ircons. This algorithm
387 generates more Id nodes than the original algorithm and therefore
389 Also made some changes to optimizations of Not.
392 Fixed a bug, caused by the recursive use in type.h and entity.h.
393 Deleted the _TYPE_TYPEDEF_ and inserted the _ENTITY_TYPEDEF_ instead.
394 Fixed a problem in if_while testprogram, so it now works.
397 Fixed bug in optimize(). Returned Null instead n if
398 get_optimize() == false.
401 Added some access routines in type.[hc]. Solved a recursive definition
402 of type_class struct, entity struct and type union.
405 Separated entity header into pure functional header and header
409 ... a bunch small changes not documented
412 Changed output of oo_prog_example: now uses the internal list
413 of all irgs. Had to implement some of the access routines for
414 that. Also fixed a bug in irdump. Main routines did not use
415 current_ir_graph properly.
418 Implemented some missing parts in irgopt.
419 Added field irg to entity. Only valid if entity is a method.
420 Had to resove a cyclic de[endency between irgraph.h and entity.h
422 Added fields sub and super to type_class for inheritance.
423 Added field main_irg to irprog.
426 Fixed some bugs in irgopt.c
427 Added some missing 'get_new_node' methods, so the new obstack contains
431 Renamed ir_vrfy to irn_vrfy and vrfy_graphg to irg_vrfy.
432 Solved some copy'n'paste problems. Deleted most debug-code!
433 Added comments to several files.
436 Fixed bug in _r_ constructors for all four Div operations.
437 Fixed bug in turn_into_tuple: didn't remember the block.
438 Tested transform_node.
441 Fixed some testprograms to new semantics of firm.
442 Added testprogram global_var_example.
443 Fixed a bug in irop: Size of Sel node was (entity *) instead of
444 sel_attr. Therefor array_heap_example aborted.
445 Also found a missing break in typewalk, case iro_Alloc.
446 Added a construct that unifies all things constructed by the lib
447 and needed to represent a program: irprog.ch
448 This contains a list of all types as well as a list of all ir graphs.
449 I added calls to initialization and constructors so that this is constructed
450 automatically. I changed firm.c, type.c, irgraph.c and ev. more.
451 Removed strange block struct and constructor from ircons.c.
452 Moved routines for automatic Phi construction from irgmod to ircons.
453 Sorted functions in ircons to reflect the different interfaces.
454 Renamed dataseg to globals to be conformant with documentation.
455 Added conservation of current_ir_graph to irgopt.c.
456 Corrected bug in Makefiles: wrong path to directory ./inlude.
459 Commented a whole bunch of stuff, e.g. in ircons.h (Procedure to construct)
460 We should change the naming of the Block constructor.
461 Removed acces routines to attr. "closed" of Block.
462 Removed second implementation of new_ir_node from ircons and some comments
463 concerned with the now resolved cyclic dependency.
464 Fixed some bugs in irgopt so that the compilation goes through.
467 Changed the irnode attribut 'visit' into 'visited'.
468 Added some access functions, like get/set_irn_visit etc.
471 Renamed some access funtion in irgraph.*.
472 Deleted two global flags (ir_visited and block_visited) from irgraph.*.
473 Added two attributes to the irgraph struct. The visited flags belongs
474 to a ir graph, not to a whole program.
477 A new optimization has been finished. The dead-node-elimination copies
478 the existing ir graph from one opstack to another. While walking the
479 graph, only the reachable nodes will be copied, so the "dead-nodes"
480 (unreachable in the controlflow) are removed.
483 Solved some problems in the 'copy_node' function. The in array was not
484 as easy as it seamed.
487 Wrote a new 'post' funtion, for future use in 'dead-node-elimination'
488 optimization, which is needed in the paramter list of 'irg_walk'.
491 Moved 'optimze_in_place_wrapper' from iropt.* tothe new files irgopt.*.
492 New functions 'local_optimze_graph' and 'dead_node_elimination' are added,
496 Removed some files from the archive, after dependencies and usage are
498 - 'ir/common/strerror.c'
500 - 'ir/ident/xx_ident.h'
501 an empty file, only included by 'ident.c', but never used;
502 - 'ir/tv/label.c' and
504 contained a numeric counter;
505 The files were included in 'tv.h' and implemented in 'tarval.c'. The two
506 functions 'tarval_label' and 'tarval_forall_labeled' were also never used.
507 In the old fiasco compiler, the label thing is used in the backend.
508 Search for 'babil' to see the usage.
509 Also removed the two attributes 'lab' and 'used' in the tarval struct.
512 Moved the 'new_ir_node' constructor from ircons.* to irnode.* and fixed
513 afterwards some recursive includes, so libfirm works again.
516 Did a lot of changes, which I never commented until now (4.7.00).
518 * Added new result to Start node: Pointer to global data segment.
519 * Extended Semantics of SymConst node to represent information for the
521 * Added arithmeitc nodes (Shrs, Minus ...)
523 Rearranged the directory structure and adjusted the makefiles.
524 The directories contain:
525 ir: everything for the intermediate representation (better: src?)
526 /ir: the ir itself, and standard optimizations.
527 /tv: the target value module
528 /tr: the type and entity representation
529 /adt: abstract data types
530 /common: stuff needed by all other dirs
531 /debug: debugging Unterstuetzung
533 include: external files needen as includes
534 testprograms: examples to test the lib.
536 The makefiles generate files with extension .d that contain the dependencies
540 Added access routine to attribute link of irnode in irnode.ch.
541 Added get_negated_pnc to irnode.ch.
544 Added an iterator in iropt that calls the optimization for all nodes.
545 Copied optimize's code to optimize_in_place and removed deallocations.
546 Made set_irn_n in irnode.c public.
547 Added Bad as possible cfg predecessor in is_cfg_node in irnode. Bads
548 are allowded as cfgpredecessors to represent dead "incoming" control
550 Added call to optimize_in_place in mature_block. Is this useful?
553 Changed tests from comparing enums to comparing pointers. This is more
554 efficient (is it?) and reads better. e.g., instead get_irn_opcode == irm_And
555 now get_irn_op == op_And
558 Compared equivalent_value to the one in the original fiasco.
559 Added a test in case iro_And.
560 Changed implementation of iro_Div. Added routines turn_into_tuple
561 and set_irn_op() in irgmod/irnode.
562 Changed implementation of irn_Minus (although commented out).
563 Now all features are ported or documented for this function.
566 Compared computed_value to the one in the original fiasco.
567 Added one further optimization in case iro_Proj.
568 Now all features are ported for this function.
571 Updated comments in ircons.h.
574 Changed possible attribute of SymConst from type_class to type.
575 SymConst size could be the size of a union, array, ...
578 Implemented two dumpers that dump type information and a graph with
582 Implemented a walker that walks over the type informatin that can
583 be reached from an ir node.
584 Added routine get_kind(firm_thing) in common.h, Added file common.c.
585 Added files typewalk.ch and routines to irdump.
586 Added visited flags and initialization to entity and all types.
587 Implemented some of the missing access routines in type.c, entity.c
590 Implemented constructor for ShrA.
592 Added routine that iterates the graph and verifies all nodes.
593 Added Phi_in stack to irgraph. This allows to build several
594 graphs at once with respect to the Phi building algorithm.
597 Implemented dumper for control flow graphs. Changed irr_* and dead_*
598 examples to dump cfg.
601 Implemeted explicit stack for the Phi node generation. See ircons.c.
604 added include string.h in xoprintf.c to get rid of warning:
605 implicit declaration of function `bcopy'
609 Added more cases to equivalent_node.
610 Portet gigo, identify, identify_remember.
611 The set/pset library can not handle several hash tables. At least,
612 compiling several procedures causes a segmentation fault during access
613 to the tables (oo_program_example). Need to work on this.
614 transform_node still needs to be ported.
615 some cases in equivalent_node are still missing.
617 To get it running I had to remove the call to optimize in the
618 new_Block constructor. It can only be called when the Block is
622 Introduced a walker that walks only over blocks. The asserts
623 might be too strict for general graphs, but so far it works.
624 For the walker I introduced an additional flag in the attribute
625 of Blocks, an a global block_visited variable (in irgraph.h).
626 Furhter I modularized dump_ir_node, implemented dump_ir_graph
627 with the existing walker, and added new routines to output a
629 Changed the examples to call the new dump routine.
632 Added auxiliary routines to ir_node:
633 skip_Proj, skip_Nop, is_Bad ...
634 Changed access routines to use get_irn_n instead of explicit array
635 accesses. Changed get_irn_n to call skip_Id, so that the access routines
636 never will return Id nodes.
639 Repaired Phi computation, changed new_r_Phi_in. Added test program to
640 test irregular controlflow.
643 Updated optimizations computed_value and equivalent_node to new
644 Syntax of FIRM nodes and to use access routines.
645 Added routine skip_Proj in irnode.
647 2.2.2000 Boris Boesler
648 Added files irgwalk.c and irgwalk.h. They include a simple function to
649 traverse an ir graph and execute pre and post functions to current node.
652 Added arrays with parameters and result types to the type informtion
653 of a procedure. This is needed for the code generation. Also added
654 the corresponding access routines.
655 Adapted the testprograms.
658 Found a bug / complication: the call order
659 get_value (makes Phi0, put's it into graph_arr)
660 set_value (overwrites Phi0 in graph_arr)
661 mature_block (upgrades Phi0, puts it again into graph_arr, overwriting
663 fails. Added test wether graph_arr is already set in phi_merge.
665 Added tons of comments to explain Phi generation -- the stack hack.
669 irdump now outputs the pnc_number for projs of Cmp nodes.
670 Added routine to access the pnc_string.
673 Added result "dataseg" to Start node, with all it's consequences.
674 We need this for the compiler lab to translate global variables.
675 Now they can be selected from the data segment, and the start
676 node supplies the pointer to this segment.
677 These changes are guarded by preprocessor variable UEBPRAKT in
679 Changed files: common.h, irgraph.ch, irnode.h
683 removed array_example, added array-heap_example and
684 array-stack_example and adapted makefile.
686 Entity now also allows type_method as owner. This is to model
687 the stack, Sel nodes that select a variable (array) from the
688 stack need an entity that describes what they select. This
689 entity gets the type of the enclosing procedure as owner.
692 Added future access routines in `irmode.[ch]' as comments,
693 that all attributes in the ir_mode struct can be user-defined.
694 Added access routines in `irgraph.[ch]', for all attributes.
697 Moved verify routines from `irgraph.[ch]' to own files `irvrfy.[ch]'.
698 Added `irvrfy.[ch]' to MAKEFILE
699 Added "inline" before access routines in `irnode.h', that no warnings
700 will appear furthermore.
701 Added three more access routines in `irmode.[ch]':
702 struct tarval *get_min_of_mode (ir_mode *mode);
703 struct tarval *get_max_of_mode (ir_mode *mode);
704 struct tarval *get_null_of_mode (ir_mode *mode);
707 Adaption of Alloc, Sel and Entity to new types:
708 Changed array_example to use type instead of type_class.
709 Changed entity to allow all types as owner instead of
710 only type_class. Added routine "assert_legal_owner_of_ent(type* type)".
711 Changed alloc to allow allocating variables of any type instead of
713 Adapted all testprograms to avoid warnings.
715 removed dtest ... from Makefile, replaced by test.
718 Added "run" to makefile, added array_example to makefile of testprograms.
719 Corrected testprogram array
720 Changed assert in irvrfy -- Conv.