2 New directory: ana for analyses. Adapted configure/makefiles
3 implemented irout: backedges. Added one field to ir_graph, one to ir_node.
4 Implemented state management for irgraphs: see irgraph.h.
5 Must now call finalize_cons() after graph construction!!
9 Flag pinned in irop, irgraph.
10 Global cse in irop, setting the irgraph flag.
11 Example programs: Endless_loop.c. global_cse.c.
15 Implemented support for endless loops:
17 Adapted Phi constructors so that memory phis are added.
18 Adapted Cond optimization: add block to End.
19 Adapted dead node elimination: compation of Ends predecessors
20 Adapted inlineing: remember keepalives of inlined graph.
21 Added informative strings to asserts in irvrfy.
24 Added volatile flag to entity, order flag to array.
25 Added a set of assertions.
28 Added access function set_class_members()
31 Asserts in irvrfy that verify the mode of Proj nodes. For Start,
32 Call, Return they check the corresponding function type! Corrected
34 Some asserts for legal values of 'pos' arguments in type/entity
38 Some access routines for visited flags in entity.h, irnode.h,
39 bug in oo_program_example.
42 Removed all obsolete Makefiles
45 Added support for constant entities. A new example program illustrates
46 their use. Extended dumper routines to dump constant values.
49 Extendend "comfortable" construction interface by some methods
50 serving as simple shortcuts.
53 Added a class type to irgs. This class type is to be used as owner
54 for local entities of the procedure. This are all entities allocated
55 for each execution of the procedure.
56 The class type is allocated automatically by new_ir_graph(). Access
57 routines to get this type are in irgraph.h.
58 We chose a class type as this allows to represent "inner" procedures
60 Adapted array-stack-example.
63 irdump outputs nodeids instead of pointers for labels of nodes.
64 With a preprocessor flag in common.h this can be turned off.
67 Added an Id tag to every .c and .h file
70 Changed SSA constuction for exception control flow.
71 If PRECISE_EXC_CONTEXT is used Phi nodes will use the values
72 valid when the execption operation was allocated. This increases
73 the memory consuption of the construction algorithm by
77 Added method to replace in array of a node in irnode.c/h
78 Added functionality to irgmod:
79 * collect all Phi nodes as link-list in the Blocks link field
80 * collect all Proj nodes as link-list in node producing the tuple.
81 * Seperate a Block into two
82 Added inlining transformation in irgopt.h
83 Improved output of dump_ir_block_graph. Now also dumps nodes that
84 don't belong to a block.
85 Added flag opt_unreachable_code, opt_inline.
86 Changed irvrfy so that it accepts nodes with Bad predecessors.
89 renamed get_type_nameid to get_type_ident
92 Bugfix: dead node elimination did not replace the hash table
96 Added routine remove_irp_irg.
97 Changed comment to free_ir_graph.
100 Added routine to free irgraphs.
103 Improved add routines to sub, supertype in type.c
106 Added implementation of overwrites stuff.
109 Implemented stuff to change the type graph. See
110 typegmod.h and tpop.h for basic documentation of the change.
111 There now exists a type of kind type_id. If this appears
112 externally this is a bug.
115 Added some new access routines to types.
116 List of overwritten fields for entities.
117 Removed a bug in irnode.
120 Added a routine to set the mangled entity name.
121 Added two routines to copy entites.
124 Entities now have two more flags, for visibility and allocation mode.
125 Types that have a layout have a flag indicating whether the layout is
129 We distinguish three kinds of Cond nodes. These can be distinguished
130 by the mode of the selector operand and an internal flag of type cond_kind.
131 First we distinguish binary Conds and switch Conds.
132 A binary Cond has as selector a boolean value. Proj(0) projects the control
133 flow for case "False", Proj(1) the control flow for "True". A binary Cond
134 is recognized by the boolean selector.
135 The switch Cond has as selector an unsigned integer. It produces as result
136 an n+1 Tuple (cf0, ... , cfn) of control flows.
137 We differ two flavours of this Cond. The first, the dense Cond, passes
138 control along output i if the selector value is i, 0 <= i <= n. If the
139 selector value is >n it passes control along output n.
140 The second Cond flavor differes in the treatment of cases not specified in
141 the source program. It magically knows about the existence of Proj nodes.
142 It only passes control along output i, 0 <= i <= n, if a node Proj(Cond, i)
143 exists. Else it passes control along output n (even if this Proj does not
144 exist.) This Cond we call "fragmentary". There is a special constructor
145 new_defaultProj that automatically sets the flavor.
146 The two switch flavors are distinguished by a flag of type cond_kind.
147 Default flavor is "dense"
151 tv now implements Minus, Abs.
152 iropt now optimizes these and Div, Mod, Quot, DivMod.
153 Still missing: Shrs, Rot.
154 tarval_shr somtimes performs shrs, depending on the compiler/system!!
155 If the ArmRoq implementation is faulty there might appear errors.
158 Changed ircons: If undefined values are used the Phi construction
159 inserts a constant with value tarval_bad.
162 Changed array bounds in type.h to ir_node*. This allows to
163 construct array bounds that are complex constant expressions
164 simpler. Further dynamic array bounds can be displayed.
165 Comment in ircons.c extended: undefined values in start_block.
168 ifdef'ed all uses of gmp in tv.c away. Optimizations for
169 mode_Z no more supported, as well as constants of that mode.
172 Dokumentation in ir_dump
173 Habe Routinen fuer einzelne Knoten/Kanten aus header entfernt:
174 Benutzen globale Variable die nicht oeffentlich zugaenglich ist.
177 We need an entity for the array elements for the Sel nodes. This
178 entity should be stored in the array type. Changed constructor
179 parameters: include array element type. Entity for elements is built
184 Faulty use of va_arg, became visible with new, stricter gcc 2.96.
187 Added list of member entites to union. unioned_types and delimiters
188 are superfluous now -- removed.
189 Rationale: we want to express selection of a union member as a Sel
190 node. for this we need to have entities. The entities contain the
191 unioned type and have as name the delimiters...
194 Changed Makefile/MakeTargets to install headers and libraries
198 Changed Makefile and Configure scripts to produce a proper tar file
199 for distribution (libfirm-VERSION.tar)
200 Use 'make distrib' instead of 'make dist'
203 Changed implementation of tr module. With this I also changed the
204 interface!! Type casts are unnecessary now, but some access funcions
208 ======================================================================
209 ==================== New version: 0.3.0 ==============================
210 ======================================================================
216 added creation of a tar archive for distribution
217 replaced ir/.dummy.in by ir/Makefile.in
220 Changed equivalent_node() and copy_preds() so that the end block
221 is not optimized away if it has no real predecessors. This fixes
222 the problem with the while examples.
223 Added while_example in Makefile
226 Fooled around with if_while_example: Why does cse make it abort?
227 Cse removes path to End node, Bad remains as pred of Endblock.
228 The block walker can't deal with this.
229 Made new example with only loop: while_example.
232 added auto documentation in Makefiles, configure, etc
233 example in ir/ir/ircons.c - much must be added
234 creation of documentation by 'make autodoc' in architecture directory
237 added lots of #ifdef HAVE_CONFIG_G #include "config.h" #endif
238 replaced some C++ style comments (//) by standard C comments /**/
241 - configure (with some features, see --help for more)
242 - make [depend | tags | install]
243 - make [run] in testprograms
245 - compilation on SunOS
247 - automatic call of autoconf if required
250 More colours in vcg output.
251 Fixed bug: cse found that start block equals it's
252 first successor as both have the Start block as predecessor.
253 This only happens for local_optimize_graph() as during construction
254 the Start block is not entered in the value table.
255 Changed implementation: irgmod: local_optimize_graph() did not
256 empty the hash table with the irnodes for cse. This might cause that
257 cse turns up with a node that seems better but was removed from the
258 graph in an earlier optimization phase.
259 Removed old #if 1 from ircons.c
260 Commented in call of optimization for Block nodes in irgopt.c, copy_preds():
261 Optimizes blocks that had bad predecessors.
266 Moved struct from irprog.h to irprog_t.h, same for irmode.h.
267 Added a module deb_info in debug.h. Adapted makefile. Added example
269 Removed use of debug.h in ident.c. Now debug.c|h can be moved to
271 Removed inabled code for dead node elimination in irgopt.h.
272 Renamed some missnamed access routines (_of_). Macros with old names
273 are in old_fctnames.h.
274 Edited makefiles to remove #* and *.flc.
277 Some minor bugfixes...
280 After compacting of in arrays in dead_node_elimination
281 merge blocks and remove Phis with one pred.
284 Freeing of obstack in dead_node_elimination commented in.
285 Compacting in arrays of Block and Phi nodes in dead_node_
290 added set/get_SymConst_type_or_id in irnode.h
291 added field offset to entity in entity.h
292 added field size to type_class in type.h
293 include "gmp.h" in tv.h with "" instead <>
296 Some changes to make the lib better portable
299 Initialize max_node_nr in irprog.
302 Now outputs warning if faulty type in irdump, dump_type_info.
303 Explicit string termination in irdump, vcg_open.
306 Added external to declaration of irp.
307 Added typedef before pns and pnc_number.
308 irmode.c, init_mode(): We need to memset all new modes as
309 tarval_vrfy reads fields before they are initialized: It
310 compares to min/max when tarvals for min/max are allocated!
313 Changed parameter of Methods in type.h and type.c from
314 class to clss. Class is a C++ keyword.
317 Changed some testprograms to accomodate Uebprakt.
320 Finished implementation of dump_all_types.
321 Added new testprogram inheritance_example.
324 Added seven access routines in type.[hc]:
325 get_class_n_member, get_class_n_subtype, get_class_n_supertype,
326 get_strct_n_member, add_strct_member, get_strct_member and set_strct_member.
327 Fixed the type_walk_2 for those seven routines.
330 Added irdump routine dump_all_types.
331 Did changes to irprog, type, typewalk to achieve this.
332 typewalk needs to walk along members, sub and supertypes, this
333 is still missing! irdump then needs to output these edges.
335 ======================================================================
336 ==================== New version: 0.2.5 ==============================
337 ======================================================================
340 Made new Version: 0.2.5
342 15.8.2000 Goetz until 3.9.00
343 Separated irnode.h and many others into two files: one public
345 Added funcionality to extract headers for lib.
348 type_dump also dumps irg->ent
349 if_example: corrected nr of locals
352 irgopt: Correct copy of self pointer in start block.
353 irgopt: Correct treatment of loops: pre function in walker
354 breaks all possible loops in Phi and Block nodes.
355 irr_loop_example: wrong Return statement
356 Now I fixed all but one error: in memory_example.
357 This error showed a conceptual problem, so I wrote
358 a slightly different algorithm. This now runs for
360 dead_node_example: cse is buggy!! merges start and the
364 looking at bug in dead_node_elimination.
366 irnode: all get_..._arr functions changed
367 ircons: new_r_Block: set matured flag.
368 ircons: new_r_SymConst: needs mode_p for linkage_ptr_info.
369 adapted call_str_example to new concepts.
372 Implemented simpler Phi construction algorithm that constructs
373 correct code for three_cfpred_example in ircons. This algorithm
374 generates more Id nodes than the original algorithm and therefore
376 Also made some changes to optimizations of Not.
379 Fixed a bug, caused by the recursive use in type.h and entity.h.
380 Deleted the _TYPE_TYPEDEF_ and inserted the _ENTITY_TYPEDEF_ instead.
381 Fixed a problem in if_while testprogram, so it now works.
384 Fixed bug in optimize(). Returned Null instead n if
385 get_optimize() == false.
388 Added some access routines in type.[hc]. Solved a recursive definition
389 of type_class struct, entity struct and type union.
392 Separated entity header into pure functional header and header
396 ... a bunch small changes not documented
399 Changed output of oo_prog_example: now uses the internal list
400 of all irgs. Had to implement some of the access routines for
401 that. Also fixed a bug in irdump. Main routines did not use
402 current_ir_graph properly.
405 Implemented some missing parts in irgopt.
406 Added field irg to entity. Only valid if entity is a method.
407 Had to resove a cyclic de[endency between irgraph.h and entity.h
409 Added fields sub and super to type_class for inheritance.
410 Added field main_irg to irprog.
413 Fixed some bugs in irgopt.c
414 Added some missing 'get_new_node' methods, so the new obstack contains
418 Renamed ir_vrfy to irn_vrfy and vrfy_graphg to irg_vrfy.
419 Solved some copy'n'paste problems. Deleted most debug-code!
420 Added comments to several files.
423 Fixed bug in _r_ constructors for all four Div operations.
424 Fixed bug in turn_into_tuple: didn't remember the block.
425 Tested transform_node.
428 Fixed some testprograms to new semantics of firm.
429 Added testprogram global_var_example.
430 Fixed a bug in irop: Size of Sel node was (entity *) instead of
431 sel_attr. Therefor array_heap_example aborted.
432 Also found a missing break in typewalk, case iro_Alloc.
433 Added a construct that unifies all things constructed by the lib
434 and needed to represent a program: irprog.ch
435 This contains a list of all types as well as a list of all ir graphs.
436 I added calls to initialization and constructors so that this is constructed
437 automatically. I changed firm.c, type.c, irgraph.c and ev. more.
438 Removed strange block struct and constructor from ircons.c.
439 Moved routines for automatic Phi construction from irgmod to ircons.
440 Sorted functions in ircons to reflect the different interfaces.
441 Renamed dataseg to globals to be conformant with documentation.
442 Added conservation of current_ir_graph to irgopt.c.
443 Corrected bug in Makefiles: wrong path to directory ./inlude.
446 Commented a whole bunch of stuff, e.g. in ircons.h (Procedure to construct)
447 We should change the naming of the Block constructor.
448 Removed acces routines to attr. "closed" of Block.
449 Removed second implementation of new_ir_node from ircons and some comments
450 concerned with the now resolved cyclic dependency.
451 Fixed some bugs in irgopt so that the compilation goes through.
454 Changed the irnode attribut 'visit' into 'visited'.
455 Added some access functions, like get/set_irn_visit etc.
458 Renamed some access funtion in irgraph.*.
459 Deleted two global flags (ir_visited and block_visited) from irgraph.*.
460 Added two attributes to the irgraph struct. The visited flags belongs
461 to a ir graph, not to a whole program.
464 A new optimization has been finished. The dead-node-elimination copies
465 the existing ir graph from one opstack to another. While walking the
466 graph, only the reachable nodes will be copied, so the "dead-nodes"
467 (unreachable in the controlflow) are removed.
470 Solved some problems in the 'copy_node' function. The in array was not
471 as easy as it seamed.
474 Wrote a new 'post' funtion, for future use in 'dead-node-elimination'
475 optimization, which is needed in the paramter list of 'irg_walk'.
478 Moved 'optimze_in_place_wrapper' from iropt.* tothe new files irgopt.*.
479 New functions 'local_optimze_graph' and 'dead_node_elimination' are added,
483 Removed some files from the archive, after dependencies and usage are
485 - 'ir/common/strerror.c'
487 - 'ir/ident/xx_ident.h'
488 an empty file, only included by 'ident.c', but never used;
489 - 'ir/tv/label.c' and
491 contained a numeric counter;
492 The files were included in 'tv.h' and implemented in 'tarval.c'. The two
493 functions 'tarval_label' and 'tarval_forall_labeled' were also never used.
494 In the old fiasco compiler, the label thing is used in the backend.
495 Search for 'babil' to see the usage.
496 Also removed the two attributes 'lab' and 'used' in the tarval struct.
499 Moved the 'new_ir_node' constructor from ircons.* to irnode.* and fixed
500 afterwards some recursive includes, so libfirm works again.
503 Did a lot of changes, which I never commented until now (4.7.00).
505 * Added new result to Start node: Pointer to global data segment.
506 * Extended Semantics of SymConst node to represent information for the
508 * Added arithmeitc nodes (Shrs, Minus ...)
510 Rearranged the directory structure and adjusted the makefiles.
511 The directories contain:
512 ir: everything for the intermediate representation (better: src?)
513 /ir: the ir itself, and standard optimizations.
514 /tv: the target value module
515 /tr: the type and entity representation
516 /adt: abstract data types
517 /common: stuff needed by all other dirs
518 /debug: debugging Unterstuetzung
520 include: external files needen as includes
521 testprograms: examples to test the lib.
523 The makefiles generate files with extension .d that contain the dependencies
527 Added access routine to attribute link of irnode in irnode.ch.
528 Added get_negated_pnc to irnode.ch.
531 Added an iterator in iropt that calls the optimization for all nodes.
532 Copied optimize's code to optimize_in_place and removed deallocations.
533 Made set_irn_n in irnode.c public.
534 Added Bad as possible cfg predecessor in is_cfg_node in irnode. Bads
535 are allowded as cfgpredecessors to represent dead "incoming" control
537 Added call to optimize_in_place in mature_block. Is this useful?
540 Changed tests from comparing enums to comparing pointers. This is more
541 efficient (is it?) and reads better. e.g., instead get_irn_opcode == irm_And
542 now get_irn_op == op_And
545 Compared equivalent_value to the one in the original fiasco.
546 Added a test in case iro_And.
547 Changed implementation of iro_Div. Added routines turn_into_tuple
548 and set_irn_op() in irgmod/irnode.
549 Changed implementation of irn_Minus (although commented out).
550 Now all features are ported or documented for this function.
553 Compared computed_value to the one in the original fiasco.
554 Added one further optimization in case iro_Proj.
555 Now all features are ported for this function.
558 Updated comments in ircons.h.
561 Changed possible attribute of SymConst from type_class to type.
562 SymConst size could be the size of a union, array, ...
565 Implemented two dumpers that dump type information and a graph with
569 Implemented a walker that walks over the type informatin that can
570 be reached from an ir node.
571 Added routine get_kind(firm_thing) in common.h, Added file common.c.
572 Added files typewalk.ch and routines to irdump.
573 Added visited flags and initialization to entity and all types.
574 Implemented some of the missing access routines in type.c, entity.c
577 Implemented constructor for ShrA.
579 Added routine that iterates the graph and verifies all nodes.
580 Added Phi_in stack to irgraph. This allows to build several
581 graphs at once with respect to the Phi building algorithm.
584 Implemented dumper for control flow graphs. Changed irr_* and dead_*
585 examples to dump cfg.
588 Implemeted explicit stack for the Phi node generation. See ircons.c.
591 added include string.h in xoprintf.c to get rid of warning:
592 implicit declaration of function `bcopy'
596 Added more cases to equivalent_node.
597 Portet gigo, identify, identify_remember.
598 The set/pset library can not handle several hash tables. At least,
599 compiling several procedures causes a segmentation fault during access
600 to the tables (oo_program_example). Need to work on this.
601 transform_node still needs to be ported.
602 some cases in equivalent_node are still missing.
604 To get it running I had to remove the call to optimize in the
605 new_Block constructor. It can only be called when the Block is
609 Introduced a walker that walks only over blocks. The asserts
610 might be too strict for general graphs, but so far it works.
611 For the walker I introduced an additional flag in the attribute
612 of Blocks, an a global block_visited variable (in irgraph.h).
613 Furhter I modularized dump_ir_node, implemented dump_ir_graph
614 with the existing walker, and added new routines to output a
616 Changed the examples to call the new dump routine.
619 Added auxiliary routines to ir_node:
620 skip_Proj, skip_Nop, is_Bad ...
621 Changed access routines to use get_irn_n instead of explicit array
622 accesses. Changed get_irn_n to call skip_Id, so that the access routines
623 never will return Id nodes.
626 Repaired Phi computation, changed new_r_Phi_in. Added test program to
627 test irregular controlflow.
630 Updated optimizations computed_value and equivalent_node to new
631 Syntax of FIRM nodes and to use access routines.
632 Added routine skip_Proj in irnode.
634 2.2.2000 Boris Boesler
635 Added files irgwalk.c and irgwalk.h. They include a simple function to
636 traverse an ir graph and execute pre and post functions to current node.
639 Added arrays with parameters and result types to the type informtion
640 of a procedure. This is needed for the code generation. Also added
641 the corresponding access routines.
642 Adapted the testprograms.
645 Found a bug / complication: the call order
646 get_value (makes Phi0, put's it into graph_arr)
647 set_value (overwrites Phi0 in graph_arr)
648 mature_block (upgrades Phi0, puts it again into graph_arr, overwriting
650 fails. Added test wether graph_arr is already set in phi_merge.
652 Added tons of comments to explain Phi generation -- the stack hack.
656 irdump now outputs the pnc_number for projs of Cmp nodes.
657 Added routine to access the pnc_string.
660 Added result "dataseg" to Start node, with all it's consequences.
661 We need this for the compiler lab to translate global variables.
662 Now they can be selected from the data segment, and the start
663 node supplies the pointer to this segment.
664 These changes are guarded by preprocessor variable UEBPRAKT in
666 Changed files: common.h, irgraph.ch, irnode.h
670 removed array_example, added array-heap_example and
671 array-stack_example and adapted makefile.
673 Entity now also allows type_method as owner. This is to model
674 the stack, Sel nodes that select a variable (array) from the
675 stack need an entity that describes what they select. This
676 entity gets the type of the enclosing procedure as owner.
679 Added future access routines in `irmode.[ch]' as comments,
680 that all attributes in the ir_mode struct can be user-defined.
681 Added access routines in `irgraph.[ch]', for all attributes.
684 Moved verify routines from `irgraph.[ch]' to own files `irvrfy.[ch]'.
685 Added `irvrfy.[ch]' to MAKEFILE
686 Added "inline" before access routines in `irnode.h', that no warnings
687 will appear furthermore.
688 Added three more access routines in `irmode.[ch]':
689 struct tarval *get_min_of_mode (ir_mode *mode);
690 struct tarval *get_max_of_mode (ir_mode *mode);
691 struct tarval *get_null_of_mode (ir_mode *mode);
694 Adaption of Alloc, Sel and Entity to new types:
695 Changed array_example to use type instead of type_class.
696 Changed entity to allow all types as owner instead of
697 only type_class. Added routine "assert_legal_owner_of_ent(type* type)".
698 Changed alloc to allow allocating variables of any type instead of
700 Adapted all testprograms to avoid warnings.
702 removed dtest ... from Makefile, replaced by test.
705 Added "run" to makefile, added array_example to makefile of testprograms.
706 Corrected testprogram array
707 Changed assert in irvrfy -- Conv.