2 Added volatile flag to entity, order flag to array.
3 Added a set of assertions.
6 Added access function set_class_members()
9 Asserts in irvrfy that verify the mode of Proj nodes. For Start,
10 Call, Return they check the corresponding function type! Corrected
12 Some asserts for legal values of 'pos' arguments in type/entity
16 Some access routines for visited flags in entity.h, irnode.h,
17 bug in oo_program_example.
20 Removed all obsolete Makefiles
23 Added support for constant entities. A new example program illustrates
24 their use. Extended dumper routines to dump constant values.
27 Extendend "comfortable" construction interface by some methods
28 serving as simple shortcuts.
31 Added a class type to irgs. This class type is to be used as owner
32 for local entities of the procedure. This are all entities allocated
33 for each execution of the procedure.
34 The class type is allocated automatically by new_ir_graph(). Access
35 routines to get this type are in irgraph.h.
36 We chose a class type as this allows to represent "inner" procedures
38 Adapted array-stack-example.
41 irdump outputs nodeids instead of pointers for labels of nodes.
42 With a preprocessor flag in common.h this can be turned off.
45 Added an Id tag to every .c and .h file
48 Changed SSA constuction for exception control flow.
49 If PRECISE_EXC_CONTEXT is used Phi nodes will use the values
50 valid when the execption operation was allocated. This increases
51 the memory consuption of the construction algorithm by
55 Added method to replace in array of a node in irnode.c/h
56 Added functionality to irgmod:
57 * collect all Phi nodes as link-list in the Blocks link field
58 * collect all Proj nodes as link-list in node producing the tuple.
59 * Seperate a Block into two
60 Added inlining transformation in irgopt.h
61 Improved output of dump_ir_block_graph. Now also dumps nodes that
62 don't belong to a block.
63 Added flag opt_unreachable_code, opt_inline.
64 Changed irvrfy so that it accepts nodes with Bad predecessors.
67 renamed get_type_nameid to get_type_ident
70 Bugfix: dead node elimination did not replace the hash table
74 Added routine remove_irp_irg.
75 Changed comment to free_ir_graph.
78 Added routine to free irgraphs.
81 Improved add routines to sub, supertype in type.c
84 Added implementation of overwrites stuff.
87 Implemented stuff to change the type graph. See
88 typegmod.h and tpop.h for basic documentation of the change.
89 There now exists a type of kind type_id. If this appears
90 externally this is a bug.
93 Added some new access routines to types.
94 List of overwritten fields for entities.
95 Removed a bug in irnode.
98 Added a routine to set the mangled entity name.
99 Added two routines to copy entites.
102 Entities now have two more flags, for visibility and allocation mode.
103 Types that have a layout have a flag indicating whether the layout is
107 We distinguish three kinds of Cond nodes. These can be distinguished
108 by the mode of the selector operand and an internal flag of type cond_kind.
109 First we distinguish binary Conds and switch Conds.
110 A binary Cond has as selector a boolean value. Proj(0) projects the control
111 flow for case "False", Proj(1) the control flow for "True". A binary Cond
112 is recognized by the boolean selector.
113 The switch Cond has as selector an unsigned integer. It produces as result
114 an n+1 Tuple (cf0, ... , cfn) of control flows.
115 We differ two flavours of this Cond. The first, the dense Cond, passes
116 control along output i if the selector value is i, 0 <= i <= n. If the
117 selector value is >n it passes control along output n.
118 The second Cond flavor differes in the treatment of cases not specified in
119 the source program. It magically knows about the existence of Proj nodes.
120 It only passes control along output i, 0 <= i <= n, if a node Proj(Cond, i)
121 exists. Else it passes control along output n (even if this Proj does not
122 exist.) This Cond we call "fragmentary". There is a special constructor
123 new_defaultProj that automatically sets the flavor.
124 The two switch flavors are distinguished by a flag of type cond_kind.
125 Default flavor is "dense"
129 tv now implements Minus, Abs.
130 iropt now optimizes these and Div, Mod, Quot, DivMod.
131 Still missing: Shrs, Rot.
132 tarval_shr somtimes performs shrs, depending on the compiler/system!!
133 If the ArmRoq implementation is faulty there might appear errors.
136 Changed ircons: If undefined values are used the Phi construction
137 inserts a constant with value tarval_bad.
140 Changed array bounds in type.h to ir_node*. This allows to
141 construct array bounds that are complex constant expressions
142 simpler. Further dynamic array bounds can be displayed.
143 Comment in ircons.c extended: undefined values in start_block.
146 ifdef'ed all uses of gmp in tv.c away. Optimizations for
147 mode_Z no more supported, as well as constants of that mode.
150 Dokumentation in ir_dump
151 Habe Routinen fuer einzelne Knoten/Kanten aus header entfernt:
152 Benutzen globale Variable die nicht oeffentlich zugaenglich ist.
155 We need an entity for the array elements for the Sel nodes. This
156 entity should be stored in the array type. Changed constructor
157 parameters: include array element type. Entity for elements is built
162 Faulty use of va_arg, became visible with new, stricter gcc 2.96.
165 Added list of member entites to union. unioned_types and delimiters
166 are superfluous now -- removed.
167 Rationale: we want to express selection of a union member as a Sel
168 node. for this we need to have entities. The entities contain the
169 unioned type and have as name the delimiters...
172 Changed Makefile/MakeTargets to install headers and libraries
176 Changed Makefile and Configure scripts to produce a proper tar file
177 for distribution (libfirm-VERSION.tar)
178 Use 'make distrib' instead of 'make dist'
181 Changed implementation of tr module. With this I also changed the
182 interface!! Type casts are unnecessary now, but some access funcions
186 ======================================================================
187 ==================== New version: 0.3.0 ==============================
188 ======================================================================
194 added creation of a tar archive for distribution
195 replaced ir/.dummy.in by ir/Makefile.in
198 Changed equivalent_node() and copy_preds() so that the end block
199 is not optimized away if it has no real predecessors. This fixes
200 the problem with the while examples.
201 Added while_example in Makefile
204 Fooled around with if_while_example: Why does cse make it abort?
205 Cse removes path to End node, Bad remains as pred of Endblock.
206 The block walker can't deal with this.
207 Made new example with only loop: while_example.
210 added auto documentation in Makefiles, configure, etc
211 example in ir/ir/ircons.c - much must be added
212 creation of documentation by 'make autodoc' in architecture directory
215 added lots of #ifdef HAVE_CONFIG_G #include "config.h" #endif
216 replaced some C++ style comments (//) by standard C comments /**/
219 - configure (with some features, see --help for more)
220 - make [depend | tags | install]
221 - make [run] in testprograms
223 - compilation on SunOS
225 - automatic call of autoconf if required
228 More colours in vcg output.
229 Fixed bug: cse found that start block equals it's
230 first successor as both have the Start block as predecessor.
231 This only happens for local_optimize_graph() as during construction
232 the Start block is not entered in the value table.
233 Changed implementation: irgmod: local_optimize_graph() did not
234 empty the hash table with the irnodes for cse. This might cause that
235 cse turns up with a node that seems better but was removed from the
236 graph in an earlier optimization phase.
237 Removed old #if 1 from ircons.c
238 Commented in call of optimization for Block nodes in irgopt.c, copy_preds():
239 Optimizes blocks that had bad predecessors.
244 Moved struct from irprog.h to irprog_t.h, same for irmode.h.
245 Added a module deb_info in debug.h. Adapted makefile. Added example
247 Removed use of debug.h in ident.c. Now debug.c|h can be moved to
249 Removed inabled code for dead node elimination in irgopt.h.
250 Renamed some missnamed access routines (_of_). Macros with old names
251 are in old_fctnames.h.
252 Edited makefiles to remove #* and *.flc.
255 Some minor bugfixes...
258 After compacting of in arrays in dead_node_elimination
259 merge blocks and remove Phis with one pred.
262 Freeing of obstack in dead_node_elimination commented in.
263 Compacting in arrays of Block and Phi nodes in dead_node_
268 added set/get_SymConst_type_or_id in irnode.h
269 added field offset to entity in entity.h
270 added field size to type_class in type.h
271 include "gmp.h" in tv.h with "" instead <>
274 Some changes to make the lib better portable
277 Initialize max_node_nr in irprog.
280 Now outputs warning if faulty type in irdump, dump_type_info.
281 Explicit string termination in irdump, vcg_open.
284 Added external to declaration of irp.
285 Added typedef before pns and pnc_number.
286 irmode.c, init_mode(): We need to memset all new modes as
287 tarval_vrfy reads fields before they are initialized: It
288 compares to min/max when tarvals for min/max are allocated!
291 Changed parameter of Methods in type.h and type.c from
292 class to clss. Class is a C++ keyword.
295 Changed some testprograms to accomodate Uebprakt.
298 Finished implementation of dump_all_types.
299 Added new testprogram inheritance_example.
302 Added seven access routines in type.[hc]:
303 get_class_n_member, get_class_n_subtype, get_class_n_supertype,
304 get_strct_n_member, add_strct_member, get_strct_member and set_strct_member.
305 Fixed the type_walk_2 for those seven routines.
308 Added irdump routine dump_all_types.
309 Did changes to irprog, type, typewalk to achieve this.
310 typewalk needs to walk along members, sub and supertypes, this
311 is still missing! irdump then needs to output these edges.
313 ======================================================================
314 ==================== New version: 0.2.5 ==============================
315 ======================================================================
318 Made new Version: 0.2.5
320 15.8.2000 Goetz until 3.9.00
321 Separated irnode.h and many others into two files: one public
323 Added funcionality to extract headers for lib.
326 type_dump also dumps irg->ent
327 if_example: corrected nr of locals
330 irgopt: Correct copy of self pointer in start block.
331 irgopt: Correct treatment of loops: pre function in walker
332 breaks all possible loops in Phi and Block nodes.
333 irr_loop_example: wrong Return statement
334 Now I fixed all but one error: in memory_example.
335 This error showed a conceptual problem, so I wrote
336 a slightly different algorithm. This now runs for
338 dead_node_example: cse is buggy!! merges start and the
342 looking at bug in dead_node_elimination.
344 irnode: all get_..._arr functions changed
345 ircons: new_r_Block: set matured flag.
346 ircons: new_r_SymConst: needs mode_p for linkage_ptr_info.
347 adapted call_str_example to new concepts.
350 Implemented simpler Phi construction algorithm that constructs
351 correct code for three_cfpred_example in ircons. This algorithm
352 generates more Id nodes than the original algorithm and therefore
354 Also made some changes to optimizations of Not.
357 Fixed a bug, caused by the recursive use in type.h and entity.h.
358 Deleted the _TYPE_TYPEDEF_ and inserted the _ENTITY_TYPEDEF_ instead.
359 Fixed a problem in if_while testprogram, so it now works.
362 Fixed bug in optimize(). Returned Null instead n if
363 get_optimize() == false.
366 Added some access routines in type.[hc]. Solved a recursive definition
367 of type_class struct, entity struct and type union.
370 Separated entity header into pure functional header and header
374 ... a bunch small changes not documented
377 Changed output of oo_prog_example: now uses the internal list
378 of all irgs. Had to implement some of the access routines for
379 that. Also fixed a bug in irdump. Main routines did not use
380 current_ir_graph properly.
383 Implemented some missing parts in irgopt.
384 Added field irg to entity. Only valid if entity is a method.
385 Had to resove a cyclic de[endency between irgraph.h and entity.h
387 Added fields sub and super to type_class for inheritance.
388 Added field main_irg to irprog.
391 Fixed some bugs in irgopt.c
392 Added some missing 'get_new_node' methods, so the new obstack contains
396 Renamed ir_vrfy to irn_vrfy and vrfy_graphg to irg_vrfy.
397 Solved some copy'n'paste problems. Deleted most debug-code!
398 Added comments to several files.
401 Fixed bug in _r_ constructors for all four Div operations.
402 Fixed bug in turn_into_tuple: didn't remember the block.
403 Tested transform_node.
406 Fixed some testprograms to new semantics of firm.
407 Added testprogram global_var_example.
408 Fixed a bug in irop: Size of Sel node was (entity *) instead of
409 sel_attr. Therefor array_heap_example aborted.
410 Also found a missing break in typewalk, case iro_Alloc.
411 Added a construct that unifies all things constructed by the lib
412 and needed to represent a program: irprog.ch
413 This contains a list of all types as well as a list of all ir graphs.
414 I added calls to initialization and constructors so that this is constructed
415 automatically. I changed firm.c, type.c, irgraph.c and ev. more.
416 Removed strange block struct and constructor from ircons.c.
417 Moved routines for automatic Phi construction from irgmod to ircons.
418 Sorted functions in ircons to reflect the different interfaces.
419 Renamed dataseg to globals to be conformant with documentation.
420 Added conservation of current_ir_graph to irgopt.c.
421 Corrected bug in Makefiles: wrong path to directory ./inlude.
424 Commented a whole bunch of stuff, e.g. in ircons.h (Procedure to construct)
425 We should change the naming of the Block constructor.
426 Removed acces routines to attr. "closed" of Block.
427 Removed second implementation of new_ir_node from ircons and some comments
428 concerned with the now resolved cyclic dependency.
429 Fixed some bugs in irgopt so that the compilation goes through.
432 Changed the irnode attribut 'visit' into 'visited'.
433 Added some access functions, like get/set_irn_visit etc.
436 Renamed some access funtion in irgraph.*.
437 Deleted two global flags (ir_visited and block_visited) from irgraph.*.
438 Added two attributes to the irgraph struct. The visited flags belongs
439 to a ir graph, not to a whole program.
442 A new optimization has been finished. The dead-node-elimination copies
443 the existing ir graph from one opstack to another. While walking the
444 graph, only the reachable nodes will be copied, so the "dead-nodes"
445 (unreachable in the controlflow) are removed.
448 Solved some problems in the 'copy_node' function. The in array was not
449 as easy as it seamed.
452 Wrote a new 'post' funtion, for future use in 'dead-node-elimination'
453 optimization, which is needed in the paramter list of 'irg_walk'.
456 Moved 'optimze_in_place_wrapper' from iropt.* tothe new files irgopt.*.
457 New functions 'local_optimze_graph' and 'dead_node_elimination' are added,
461 Removed some files from the archive, after dependencies and usage are
463 - 'ir/common/strerror.c'
465 - 'ir/ident/xx_ident.h'
466 an empty file, only included by 'ident.c', but never used;
467 - 'ir/tv/label.c' and
469 contained a numeric counter;
470 The files were included in 'tv.h' and implemented in 'tarval.c'. The two
471 functions 'tarval_label' and 'tarval_forall_labeled' were also never used.
472 In the old fiasco compiler, the label thing is used in the backend.
473 Search for 'babil' to see the usage.
474 Also removed the two attributes 'lab' and 'used' in the tarval struct.
477 Moved the 'new_ir_node' constructor from ircons.* to irnode.* and fixed
478 afterwards some recursive includes, so libfirm works again.
481 Did a lot of changes, which I never commented until now (4.7.00).
483 * Added new result to Start node: Pointer to global data segment.
484 * Extended Semantics of SymConst node to represent information for the
486 * Added arithmeitc nodes (Shrs, Minus ...)
488 Rearranged the directory structure and adjusted the makefiles.
489 The directories contain:
490 ir: everything for the intermediate representation (better: src?)
491 /ir: the ir itself, and standard optimizations.
492 /tv: the target value module
493 /tr: the type and entity representation
494 /adt: abstract data types
495 /common: stuff needed by all other dirs
496 /debug: debugging Unterstuetzung
498 include: external files needen as includes
499 testprograms: examples to test the lib.
501 The makefiles generate files with extension .d that contain the dependencies
505 Added access routine to attribute link of irnode in irnode.ch.
506 Added get_negated_pnc to irnode.ch.
509 Added an iterator in iropt that calls the optimization for all nodes.
510 Copied optimize's code to optimize_in_place and removed deallocations.
511 Made set_irn_n in irnode.c public.
512 Added Bad as possible cfg predecessor in is_cfg_node in irnode. Bads
513 are allowded as cfgpredecessors to represent dead "incoming" control
515 Added call to optimize_in_place in mature_block. Is this useful?
518 Changed tests from comparing enums to comparing pointers. This is more
519 efficient (is it?) and reads better. e.g., instead get_irn_opcode == irm_And
520 now get_irn_op == op_And
523 Compared equivalent_value to the one in the original fiasco.
524 Added a test in case iro_And.
525 Changed implementation of iro_Div. Added routines turn_into_tuple
526 and set_irn_op() in irgmod/irnode.
527 Changed implementation of irn_Minus (although commented out).
528 Now all features are ported or documented for this function.
531 Compared computed_value to the one in the original fiasco.
532 Added one further optimization in case iro_Proj.
533 Now all features are ported for this function.
536 Updated comments in ircons.h.
539 Changed possible attribute of SymConst from type_class to type.
540 SymConst size could be the size of a union, array, ...
543 Implemented two dumpers that dump type information and a graph with
547 Implemented a walker that walks over the type informatin that can
548 be reached from an ir node.
549 Added routine get_kind(firm_thing) in common.h, Added file common.c.
550 Added files typewalk.ch and routines to irdump.
551 Added visited flags and initialization to entity and all types.
552 Implemented some of the missing access routines in type.c, entity.c
555 Implemented constructor for ShrA.
557 Added routine that iterates the graph and verifies all nodes.
558 Added Phi_in stack to irgraph. This allows to build several
559 graphs at once with respect to the Phi building algorithm.
562 Implemented dumper for control flow graphs. Changed irr_* and dead_*
563 examples to dump cfg.
566 Implemeted explicit stack for the Phi node generation. See ircons.c.
569 added include string.h in xoprintf.c to get rid of warning:
570 implicit declaration of function `bcopy'
574 Added more cases to equivalent_node.
575 Portet gigo, identify, identify_remember.
576 The set/pset library can not handle several hash tables. At least,
577 compiling several procedures causes a segmentation fault during access
578 to the tables (oo_program_example). Need to work on this.
579 transform_node still needs to be ported.
580 some cases in equivalent_node are still missing.
582 To get it running I had to remove the call to optimize in the
583 new_Block constructor. It can only be called when the Block is
587 Introduced a walker that walks only over blocks. The asserts
588 might be too strict for general graphs, but so far it works.
589 For the walker I introduced an additional flag in the attribute
590 of Blocks, an a global block_visited variable (in irgraph.h).
591 Furhter I modularized dump_ir_node, implemented dump_ir_graph
592 with the existing walker, and added new routines to output a
594 Changed the examples to call the new dump routine.
597 Added auxiliary routines to ir_node:
598 skip_Proj, skip_Nop, is_Bad ...
599 Changed access routines to use get_irn_n instead of explicit array
600 accesses. Changed get_irn_n to call skip_Id, so that the access routines
601 never will return Id nodes.
604 Repaired Phi computation, changed new_r_Phi_in. Added test program to
605 test irregular controlflow.
608 Updated optimizations computed_value and equivalent_node to new
609 Syntax of FIRM nodes and to use access routines.
610 Added routine skip_Proj in irnode.
612 2.2.2000 Boris Boesler
613 Added files irgwalk.c and irgwalk.h. They include a simple function to
614 traverse an ir graph and execute pre and post functions to current node.
617 Added arrays with parameters and result types to the type informtion
618 of a procedure. This is needed for the code generation. Also added
619 the corresponding access routines.
620 Adapted the testprograms.
623 Found a bug / complication: the call order
624 get_value (makes Phi0, put's it into graph_arr)
625 set_value (overwrites Phi0 in graph_arr)
626 mature_block (upgrades Phi0, puts it again into graph_arr, overwriting
628 fails. Added test wether graph_arr is already set in phi_merge.
630 Added tons of comments to explain Phi generation -- the stack hack.
634 irdump now outputs the pnc_number for projs of Cmp nodes.
635 Added routine to access the pnc_string.
638 Added result "dataseg" to Start node, with all it's consequences.
639 We need this for the compiler lab to translate global variables.
640 Now they can be selected from the data segment, and the start
641 node supplies the pointer to this segment.
642 These changes are guarded by preprocessor variable UEBPRAKT in
644 Changed files: common.h, irgraph.ch, irnode.h
648 removed array_example, added array-heap_example and
649 array-stack_example and adapted makefile.
651 Entity now also allows type_method as owner. This is to model
652 the stack, Sel nodes that select a variable (array) from the
653 stack need an entity that describes what they select. This
654 entity gets the type of the enclosing procedure as owner.
657 Added future access routines in `irmode.[ch]' as comments,
658 that all attributes in the ir_mode struct can be user-defined.
659 Added access routines in `irgraph.[ch]', for all attributes.
662 Moved verify routines from `irgraph.[ch]' to own files `irvrfy.[ch]'.
663 Added `irvrfy.[ch]' to MAKEFILE
664 Added "inline" before access routines in `irnode.h', that no warnings
665 will appear furthermore.
666 Added three more access routines in `irmode.[ch]':
667 struct tarval *get_min_of_mode (ir_mode *mode);
668 struct tarval *get_max_of_mode (ir_mode *mode);
669 struct tarval *get_null_of_mode (ir_mode *mode);
672 Adaption of Alloc, Sel and Entity to new types:
673 Changed array_example to use type instead of type_class.
674 Changed entity to allow all types as owner instead of
675 only type_class. Added routine "assert_legal_owner_of_ent(type* type)".
676 Changed alloc to allow allocating variables of any type instead of
678 Adapted all testprograms to avoid warnings.
680 removed dtest ... from Makefile, replaced by test.
683 Added "run" to makefile, added array_example to makefile of testprograms.
684 Corrected testprogram array
685 Changed assert in irvrfy -- Conv.
projects / libfirm / blob