2 Implemented support for endless loops:
4 Adapted Phi constructors so that memory phis are added.
5 Adapted Cond optimization: add block to End.
6 Adapted dead node elimination: compation of Ends predecessors
7 Adapted inlineing: remember keepalives of inlined graph.
8 Added informative strings to asserts in irvrfy.
11 Added volatile flag to entity, order flag to array.
12 Added a set of assertions.
15 Added access function set_class_members()
18 Asserts in irvrfy that verify the mode of Proj nodes. For Start,
19 Call, Return they check the corresponding function type! Corrected
21 Some asserts for legal values of 'pos' arguments in type/entity
25 Some access routines for visited flags in entity.h, irnode.h,
26 bug in oo_program_example.
29 Removed all obsolete Makefiles
32 Added support for constant entities. A new example program illustrates
33 their use. Extended dumper routines to dump constant values.
36 Extendend "comfortable" construction interface by some methods
37 serving as simple shortcuts.
40 Added a class type to irgs. This class type is to be used as owner
41 for local entities of the procedure. This are all entities allocated
42 for each execution of the procedure.
43 The class type is allocated automatically by new_ir_graph(). Access
44 routines to get this type are in irgraph.h.
45 We chose a class type as this allows to represent "inner" procedures
47 Adapted array-stack-example.
50 irdump outputs nodeids instead of pointers for labels of nodes.
51 With a preprocessor flag in common.h this can be turned off.
54 Added an Id tag to every .c and .h file
57 Changed SSA constuction for exception control flow.
58 If PRECISE_EXC_CONTEXT is used Phi nodes will use the values
59 valid when the execption operation was allocated. This increases
60 the memory consuption of the construction algorithm by
64 Added method to replace in array of a node in irnode.c/h
65 Added functionality to irgmod:
66 * collect all Phi nodes as link-list in the Blocks link field
67 * collect all Proj nodes as link-list in node producing the tuple.
68 * Seperate a Block into two
69 Added inlining transformation in irgopt.h
70 Improved output of dump_ir_block_graph. Now also dumps nodes that
71 don't belong to a block.
72 Added flag opt_unreachable_code, opt_inline.
73 Changed irvrfy so that it accepts nodes with Bad predecessors.
76 renamed get_type_nameid to get_type_ident
79 Bugfix: dead node elimination did not replace the hash table
83 Added routine remove_irp_irg.
84 Changed comment to free_ir_graph.
87 Added routine to free irgraphs.
90 Improved add routines to sub, supertype in type.c
93 Added implementation of overwrites stuff.
96 Implemented stuff to change the type graph. See
97 typegmod.h and tpop.h for basic documentation of the change.
98 There now exists a type of kind type_id. If this appears
99 externally this is a bug.
102 Added some new access routines to types.
103 List of overwritten fields for entities.
104 Removed a bug in irnode.
107 Added a routine to set the mangled entity name.
108 Added two routines to copy entites.
111 Entities now have two more flags, for visibility and allocation mode.
112 Types that have a layout have a flag indicating whether the layout is
116 We distinguish three kinds of Cond nodes. These can be distinguished
117 by the mode of the selector operand and an internal flag of type cond_kind.
118 First we distinguish binary Conds and switch Conds.
119 A binary Cond has as selector a boolean value. Proj(0) projects the control
120 flow for case "False", Proj(1) the control flow for "True". A binary Cond
121 is recognized by the boolean selector.
122 The switch Cond has as selector an unsigned integer. It produces as result
123 an n+1 Tuple (cf0, ... , cfn) of control flows.
124 We differ two flavours of this Cond. The first, the dense Cond, passes
125 control along output i if the selector value is i, 0 <= i <= n. If the
126 selector value is >n it passes control along output n.
127 The second Cond flavor differes in the treatment of cases not specified in
128 the source program. It magically knows about the existence of Proj nodes.
129 It only passes control along output i, 0 <= i <= n, if a node Proj(Cond, i)
130 exists. Else it passes control along output n (even if this Proj does not
131 exist.) This Cond we call "fragmentary". There is a special constructor
132 new_defaultProj that automatically sets the flavor.
133 The two switch flavors are distinguished by a flag of type cond_kind.
134 Default flavor is "dense"
138 tv now implements Minus, Abs.
139 iropt now optimizes these and Div, Mod, Quot, DivMod.
140 Still missing: Shrs, Rot.
141 tarval_shr somtimes performs shrs, depending on the compiler/system!!
142 If the ArmRoq implementation is faulty there might appear errors.
145 Changed ircons: If undefined values are used the Phi construction
146 inserts a constant with value tarval_bad.
149 Changed array bounds in type.h to ir_node*. This allows to
150 construct array bounds that are complex constant expressions
151 simpler. Further dynamic array bounds can be displayed.
152 Comment in ircons.c extended: undefined values in start_block.
155 ifdef'ed all uses of gmp in tv.c away. Optimizations for
156 mode_Z no more supported, as well as constants of that mode.
159 Dokumentation in ir_dump
160 Habe Routinen fuer einzelne Knoten/Kanten aus header entfernt:
161 Benutzen globale Variable die nicht oeffentlich zugaenglich ist.
164 We need an entity for the array elements for the Sel nodes. This
165 entity should be stored in the array type. Changed constructor
166 parameters: include array element type. Entity for elements is built
171 Faulty use of va_arg, became visible with new, stricter gcc 2.96.
174 Added list of member entites to union. unioned_types and delimiters
175 are superfluous now -- removed.
176 Rationale: we want to express selection of a union member as a Sel
177 node. for this we need to have entities. The entities contain the
178 unioned type and have as name the delimiters...
181 Changed Makefile/MakeTargets to install headers and libraries
185 Changed Makefile and Configure scripts to produce a proper tar file
186 for distribution (libfirm-VERSION.tar)
187 Use 'make distrib' instead of 'make dist'
190 Changed implementation of tr module. With this I also changed the
191 interface!! Type casts are unnecessary now, but some access funcions
195 ======================================================================
196 ==================== New version: 0.3.0 ==============================
197 ======================================================================
203 added creation of a tar archive for distribution
204 replaced ir/.dummy.in by ir/Makefile.in
207 Changed equivalent_node() and copy_preds() so that the end block
208 is not optimized away if it has no real predecessors. This fixes
209 the problem with the while examples.
210 Added while_example in Makefile
213 Fooled around with if_while_example: Why does cse make it abort?
214 Cse removes path to End node, Bad remains as pred of Endblock.
215 The block walker can't deal with this.
216 Made new example with only loop: while_example.
219 added auto documentation in Makefiles, configure, etc
220 example in ir/ir/ircons.c - much must be added
221 creation of documentation by 'make autodoc' in architecture directory
224 added lots of #ifdef HAVE_CONFIG_G #include "config.h" #endif
225 replaced some C++ style comments (//) by standard C comments /**/
228 - configure (with some features, see --help for more)
229 - make [depend | tags | install]
230 - make [run] in testprograms
232 - compilation on SunOS
234 - automatic call of autoconf if required
237 More colours in vcg output.
238 Fixed bug: cse found that start block equals it's
239 first successor as both have the Start block as predecessor.
240 This only happens for local_optimize_graph() as during construction
241 the Start block is not entered in the value table.
242 Changed implementation: irgmod: local_optimize_graph() did not
243 empty the hash table with the irnodes for cse. This might cause that
244 cse turns up with a node that seems better but was removed from the
245 graph in an earlier optimization phase.
246 Removed old #if 1 from ircons.c
247 Commented in call of optimization for Block nodes in irgopt.c, copy_preds():
248 Optimizes blocks that had bad predecessors.
253 Moved struct from irprog.h to irprog_t.h, same for irmode.h.
254 Added a module deb_info in debug.h. Adapted makefile. Added example
256 Removed use of debug.h in ident.c. Now debug.c|h can be moved to
258 Removed inabled code for dead node elimination in irgopt.h.
259 Renamed some missnamed access routines (_of_). Macros with old names
260 are in old_fctnames.h.
261 Edited makefiles to remove #* and *.flc.
264 Some minor bugfixes...
267 After compacting of in arrays in dead_node_elimination
268 merge blocks and remove Phis with one pred.
271 Freeing of obstack in dead_node_elimination commented in.
272 Compacting in arrays of Block and Phi nodes in dead_node_
277 added set/get_SymConst_type_or_id in irnode.h
278 added field offset to entity in entity.h
279 added field size to type_class in type.h
280 include "gmp.h" in tv.h with "" instead <>
283 Some changes to make the lib better portable
286 Initialize max_node_nr in irprog.
289 Now outputs warning if faulty type in irdump, dump_type_info.
290 Explicit string termination in irdump, vcg_open.
293 Added external to declaration of irp.
294 Added typedef before pns and pnc_number.
295 irmode.c, init_mode(): We need to memset all new modes as
296 tarval_vrfy reads fields before they are initialized: It
297 compares to min/max when tarvals for min/max are allocated!
300 Changed parameter of Methods in type.h and type.c from
301 class to clss. Class is a C++ keyword.
304 Changed some testprograms to accomodate Uebprakt.
307 Finished implementation of dump_all_types.
308 Added new testprogram inheritance_example.
311 Added seven access routines in type.[hc]:
312 get_class_n_member, get_class_n_subtype, get_class_n_supertype,
313 get_strct_n_member, add_strct_member, get_strct_member and set_strct_member.
314 Fixed the type_walk_2 for those seven routines.
317 Added irdump routine dump_all_types.
318 Did changes to irprog, type, typewalk to achieve this.
319 typewalk needs to walk along members, sub and supertypes, this
320 is still missing! irdump then needs to output these edges.
322 ======================================================================
323 ==================== New version: 0.2.5 ==============================
324 ======================================================================
327 Made new Version: 0.2.5
329 15.8.2000 Goetz until 3.9.00
330 Separated irnode.h and many others into two files: one public
332 Added funcionality to extract headers for lib.
335 type_dump also dumps irg->ent
336 if_example: corrected nr of locals
339 irgopt: Correct copy of self pointer in start block.
340 irgopt: Correct treatment of loops: pre function in walker
341 breaks all possible loops in Phi and Block nodes.
342 irr_loop_example: wrong Return statement
343 Now I fixed all but one error: in memory_example.
344 This error showed a conceptual problem, so I wrote
345 a slightly different algorithm. This now runs for
347 dead_node_example: cse is buggy!! merges start and the
351 looking at bug in dead_node_elimination.
353 irnode: all get_..._arr functions changed
354 ircons: new_r_Block: set matured flag.
355 ircons: new_r_SymConst: needs mode_p for linkage_ptr_info.
356 adapted call_str_example to new concepts.
359 Implemented simpler Phi construction algorithm that constructs
360 correct code for three_cfpred_example in ircons. This algorithm
361 generates more Id nodes than the original algorithm and therefore
363 Also made some changes to optimizations of Not.
366 Fixed a bug, caused by the recursive use in type.h and entity.h.
367 Deleted the _TYPE_TYPEDEF_ and inserted the _ENTITY_TYPEDEF_ instead.
368 Fixed a problem in if_while testprogram, so it now works.
371 Fixed bug in optimize(). Returned Null instead n if
372 get_optimize() == false.
375 Added some access routines in type.[hc]. Solved a recursive definition
376 of type_class struct, entity struct and type union.
379 Separated entity header into pure functional header and header
383 ... a bunch small changes not documented
386 Changed output of oo_prog_example: now uses the internal list
387 of all irgs. Had to implement some of the access routines for
388 that. Also fixed a bug in irdump. Main routines did not use
389 current_ir_graph properly.
392 Implemented some missing parts in irgopt.
393 Added field irg to entity. Only valid if entity is a method.
394 Had to resove a cyclic de[endency between irgraph.h and entity.h
396 Added fields sub and super to type_class for inheritance.
397 Added field main_irg to irprog.
400 Fixed some bugs in irgopt.c
401 Added some missing 'get_new_node' methods, so the new obstack contains
405 Renamed ir_vrfy to irn_vrfy and vrfy_graphg to irg_vrfy.
406 Solved some copy'n'paste problems. Deleted most debug-code!
407 Added comments to several files.
410 Fixed bug in _r_ constructors for all four Div operations.
411 Fixed bug in turn_into_tuple: didn't remember the block.
412 Tested transform_node.
415 Fixed some testprograms to new semantics of firm.
416 Added testprogram global_var_example.
417 Fixed a bug in irop: Size of Sel node was (entity *) instead of
418 sel_attr. Therefor array_heap_example aborted.
419 Also found a missing break in typewalk, case iro_Alloc.
420 Added a construct that unifies all things constructed by the lib
421 and needed to represent a program: irprog.ch
422 This contains a list of all types as well as a list of all ir graphs.
423 I added calls to initialization and constructors so that this is constructed
424 automatically. I changed firm.c, type.c, irgraph.c and ev. more.
425 Removed strange block struct and constructor from ircons.c.
426 Moved routines for automatic Phi construction from irgmod to ircons.
427 Sorted functions in ircons to reflect the different interfaces.
428 Renamed dataseg to globals to be conformant with documentation.
429 Added conservation of current_ir_graph to irgopt.c.
430 Corrected bug in Makefiles: wrong path to directory ./inlude.
433 Commented a whole bunch of stuff, e.g. in ircons.h (Procedure to construct)
434 We should change the naming of the Block constructor.
435 Removed acces routines to attr. "closed" of Block.
436 Removed second implementation of new_ir_node from ircons and some comments
437 concerned with the now resolved cyclic dependency.
438 Fixed some bugs in irgopt so that the compilation goes through.
441 Changed the irnode attribut 'visit' into 'visited'.
442 Added some access functions, like get/set_irn_visit etc.
445 Renamed some access funtion in irgraph.*.
446 Deleted two global flags (ir_visited and block_visited) from irgraph.*.
447 Added two attributes to the irgraph struct. The visited flags belongs
448 to a ir graph, not to a whole program.
451 A new optimization has been finished. The dead-node-elimination copies
452 the existing ir graph from one opstack to another. While walking the
453 graph, only the reachable nodes will be copied, so the "dead-nodes"
454 (unreachable in the controlflow) are removed.
457 Solved some problems in the 'copy_node' function. The in array was not
458 as easy as it seamed.
461 Wrote a new 'post' funtion, for future use in 'dead-node-elimination'
462 optimization, which is needed in the paramter list of 'irg_walk'.
465 Moved 'optimze_in_place_wrapper' from iropt.* tothe new files irgopt.*.
466 New functions 'local_optimze_graph' and 'dead_node_elimination' are added,
470 Removed some files from the archive, after dependencies and usage are
472 - 'ir/common/strerror.c'
474 - 'ir/ident/xx_ident.h'
475 an empty file, only included by 'ident.c', but never used;
476 - 'ir/tv/label.c' and
478 contained a numeric counter;
479 The files were included in 'tv.h' and implemented in 'tarval.c'. The two
480 functions 'tarval_label' and 'tarval_forall_labeled' were also never used.
481 In the old fiasco compiler, the label thing is used in the backend.
482 Search for 'babil' to see the usage.
483 Also removed the two attributes 'lab' and 'used' in the tarval struct.
486 Moved the 'new_ir_node' constructor from ircons.* to irnode.* and fixed
487 afterwards some recursive includes, so libfirm works again.
490 Did a lot of changes, which I never commented until now (4.7.00).
492 * Added new result to Start node: Pointer to global data segment.
493 * Extended Semantics of SymConst node to represent information for the
495 * Added arithmeitc nodes (Shrs, Minus ...)
497 Rearranged the directory structure and adjusted the makefiles.
498 The directories contain:
499 ir: everything for the intermediate representation (better: src?)
500 /ir: the ir itself, and standard optimizations.
501 /tv: the target value module
502 /tr: the type and entity representation
503 /adt: abstract data types
504 /common: stuff needed by all other dirs
505 /debug: debugging Unterstuetzung
507 include: external files needen as includes
508 testprograms: examples to test the lib.
510 The makefiles generate files with extension .d that contain the dependencies
514 Added access routine to attribute link of irnode in irnode.ch.
515 Added get_negated_pnc to irnode.ch.
518 Added an iterator in iropt that calls the optimization for all nodes.
519 Copied optimize's code to optimize_in_place and removed deallocations.
520 Made set_irn_n in irnode.c public.
521 Added Bad as possible cfg predecessor in is_cfg_node in irnode. Bads
522 are allowded as cfgpredecessors to represent dead "incoming" control
524 Added call to optimize_in_place in mature_block. Is this useful?
527 Changed tests from comparing enums to comparing pointers. This is more
528 efficient (is it?) and reads better. e.g., instead get_irn_opcode == irm_And
529 now get_irn_op == op_And
532 Compared equivalent_value to the one in the original fiasco.
533 Added a test in case iro_And.
534 Changed implementation of iro_Div. Added routines turn_into_tuple
535 and set_irn_op() in irgmod/irnode.
536 Changed implementation of irn_Minus (although commented out).
537 Now all features are ported or documented for this function.
540 Compared computed_value to the one in the original fiasco.
541 Added one further optimization in case iro_Proj.
542 Now all features are ported for this function.
545 Updated comments in ircons.h.
548 Changed possible attribute of SymConst from type_class to type.
549 SymConst size could be the size of a union, array, ...
552 Implemented two dumpers that dump type information and a graph with
556 Implemented a walker that walks over the type informatin that can
557 be reached from an ir node.
558 Added routine get_kind(firm_thing) in common.h, Added file common.c.
559 Added files typewalk.ch and routines to irdump.
560 Added visited flags and initialization to entity and all types.
561 Implemented some of the missing access routines in type.c, entity.c
564 Implemented constructor for ShrA.
566 Added routine that iterates the graph and verifies all nodes.
567 Added Phi_in stack to irgraph. This allows to build several
568 graphs at once with respect to the Phi building algorithm.
571 Implemented dumper for control flow graphs. Changed irr_* and dead_*
572 examples to dump cfg.
575 Implemeted explicit stack for the Phi node generation. See ircons.c.
578 added include string.h in xoprintf.c to get rid of warning:
579 implicit declaration of function `bcopy'
583 Added more cases to equivalent_node.
584 Portet gigo, identify, identify_remember.
585 The set/pset library can not handle several hash tables. At least,
586 compiling several procedures causes a segmentation fault during access
587 to the tables (oo_program_example). Need to work on this.
588 transform_node still needs to be ported.
589 some cases in equivalent_node are still missing.
591 To get it running I had to remove the call to optimize in the
592 new_Block constructor. It can only be called when the Block is
596 Introduced a walker that walks only over blocks. The asserts
597 might be too strict for general graphs, but so far it works.
598 For the walker I introduced an additional flag in the attribute
599 of Blocks, an a global block_visited variable (in irgraph.h).
600 Furhter I modularized dump_ir_node, implemented dump_ir_graph
601 with the existing walker, and added new routines to output a
603 Changed the examples to call the new dump routine.
606 Added auxiliary routines to ir_node:
607 skip_Proj, skip_Nop, is_Bad ...
608 Changed access routines to use get_irn_n instead of explicit array
609 accesses. Changed get_irn_n to call skip_Id, so that the access routines
610 never will return Id nodes.
613 Repaired Phi computation, changed new_r_Phi_in. Added test program to
614 test irregular controlflow.
617 Updated optimizations computed_value and equivalent_node to new
618 Syntax of FIRM nodes and to use access routines.
619 Added routine skip_Proj in irnode.
621 2.2.2000 Boris Boesler
622 Added files irgwalk.c and irgwalk.h. They include a simple function to
623 traverse an ir graph and execute pre and post functions to current node.
626 Added arrays with parameters and result types to the type informtion
627 of a procedure. This is needed for the code generation. Also added
628 the corresponding access routines.
629 Adapted the testprograms.
632 Found a bug / complication: the call order
633 get_value (makes Phi0, put's it into graph_arr)
634 set_value (overwrites Phi0 in graph_arr)
635 mature_block (upgrades Phi0, puts it again into graph_arr, overwriting
637 fails. Added test wether graph_arr is already set in phi_merge.
639 Added tons of comments to explain Phi generation -- the stack hack.
643 irdump now outputs the pnc_number for projs of Cmp nodes.
644 Added routine to access the pnc_string.
647 Added result "dataseg" to Start node, with all it's consequences.
648 We need this for the compiler lab to translate global variables.
649 Now they can be selected from the data segment, and the start
650 node supplies the pointer to this segment.
651 These changes are guarded by preprocessor variable UEBPRAKT in
653 Changed files: common.h, irgraph.ch, irnode.h
657 removed array_example, added array-heap_example and
658 array-stack_example and adapted makefile.
660 Entity now also allows type_method as owner. This is to model
661 the stack, Sel nodes that select a variable (array) from the
662 stack need an entity that describes what they select. This
663 entity gets the type of the enclosing procedure as owner.
666 Added future access routines in `irmode.[ch]' as comments,
667 that all attributes in the ir_mode struct can be user-defined.
668 Added access routines in `irgraph.[ch]', for all attributes.
671 Moved verify routines from `irgraph.[ch]' to own files `irvrfy.[ch]'.
672 Added `irvrfy.[ch]' to MAKEFILE
673 Added "inline" before access routines in `irnode.h', that no warnings
674 will appear furthermore.
675 Added three more access routines in `irmode.[ch]':
676 struct tarval *get_min_of_mode (ir_mode *mode);
677 struct tarval *get_max_of_mode (ir_mode *mode);
678 struct tarval *get_null_of_mode (ir_mode *mode);
681 Adaption of Alloc, Sel and Entity to new types:
682 Changed array_example to use type instead of type_class.
683 Changed entity to allow all types as owner instead of
684 only type_class. Added routine "assert_legal_owner_of_ent(type* type)".
685 Changed alloc to allow allocating variables of any type instead of
687 Adapted all testprograms to avoid warnings.
689 removed dtest ... from Makefile, replaced by test.
692 Added "run" to makefile, added array_example to makefile of testprograms.
693 Corrected testprogram array
694 Changed assert in irvrfy -- Conv.
projects / libfirm / blob