3 Changed SSA constuction for exception control flow.
4 If PRECISE_EXC_CONTEXT is used Phi nodes will use the values
5 valid when the execption operation was allocated. This increases
6 the memory consuption of the construction algorithm by
10 Added method to replace in array of a node in irnode.c/h
11 Added functionality to irgmod:
12 * collect all Phi nodes as link-list in the Blocks link field
13 * collect all Proj nodes as link-list in node producing the tuple.
14 * Seperate a Block into two
15 Added inlining transformation in irgopt.h
16 Improved output of dump_ir_block_graph. Now also dumps nodes that
17 don't belong to a block.
18 Added flag opt_unreachable_code, opt_inline.
19 Changed irvrfy so that it accepts nodes with Bad predecessors.
22 renamed get_type_nameid to get_type_ident
25 Bugfix: dead node elimination did not replace the hash table
29 Added routine remove_irp_irg.
30 Changed comment to free_ir_graph.
33 Added routine to free irgraphs.
36 Improved add routines to sub, supertype in type.c
39 Added implementation of overwrites stuff.
42 Implemented stuff to change the type graph. See
43 typegmod.h and tpop.h for basic documentation of the change.
44 There now exists a type of kind type_id. If this appears
45 externally this is a bug.
48 Added some new access routines to types.
49 List of overwritten fields for entities.
50 Removed a bug in irnode.
53 Added a routine to set the mangled entity name.
54 Added two routines to copy entites.
57 Entities now have two more flags, for visibility and allocation mode.
58 Types that have a layout have a flag indicating whether the layout is
62 We distinguish three kinds of Cond nodes. These can be distinguished
63 by the mode of the selector operand and an internal flag of type cond_kind.
64 First we distinguish binary Conds and switch Conds.
65 A binary Cond has as selector a boolean value. Proj(0) projects the control
66 flow for case "False", Proj(1) the control flow for "True". A binary Cond
67 is recognized by the boolean selector.
68 The switch Cond has as selector an unsigned integer. It produces as result
69 an n+1 Tuple (cf0, ... , cfn) of control flows.
70 We differ two flavours of this Cond. The first, the dense Cond, passes
71 control along output i if the selector value is i, 0 <= i <= n. If the
72 selector value is >n it passes control along output n.
73 The second Cond flavor differes in the treatment of cases not specified in
74 the source program. It magically knows about the existence of Proj nodes.
75 It only passes control along output i, 0 <= i <= n, if a node Proj(Cond, i)
76 exists. Else it passes control along output n (even if this Proj does not
77 exist.) This Cond we call "fragmentary". There is a special constructor
78 new_defaultProj that automatically sets the flavor.
79 The two switch flavors are distinguished by a flag of type cond_kind.
80 Default flavor is "dense"
84 tv now implements Minus, Abs.
85 iropt now optimizes these and Div, Mod, Quot, DivMod.
86 Still missing: Shrs, Rot.
87 tarval_shr somtimes performs shrs, depending on the compiler/system!!
88 If the ArmRoq implementation is faulty there might appear errors.
91 Changed ircons: If undefined values are used the Phi construction
92 inserts a constant with value tarval_bad.
95 Changed array bounds in type.h to ir_node*. This allows to
96 construct array bounds that are complex constant expressions
97 simpler. Further dynamic array bounds can be displayed.
98 Comment in ircons.c extended: undefined values in start_block.
101 ifdef'ed all uses of gmp in tv.c away. Optimizations for
102 mode_Z no more supported, as well as constants of that mode.
105 Dokumentation in ir_dump
106 Habe Routinen fuer einzelne Knoten/Kanten aus header entfernt:
107 Benutzen globale Variable die nicht oeffentlich zugaenglich ist.
110 We need an entity for the array elements for the Sel nodes. This
111 entity should be stored in the array type. Changed constructor
112 parameters: include array element type. Entity for elements is built
117 Faulty use of va_arg, became visible with new, stricter gcc 2.96.
120 Added list of member entites to union. unioned_types and delimiters
121 are superfluous now -- removed.
122 Rationale: we want to express selection of a union member as a Sel
123 node. for this we need to have entities. The entities contain the
124 unioned type and have as name the delimiters...
127 Changed Makefile/MakeTargets to install headers and libraries
131 Changed Makefile and Configure scripts to produce a proper tar file
132 for distribution (libfirm-VERSION.tar)
133 Use 'make distrib' instead of 'make dist'
136 Changed implementation of tr module. With this I also changed the
137 interface!! Type casts are unnecessary now, but some access funcions
141 ======================================================================
142 ==================== New version: 0.3.0 ==============================
143 ======================================================================
149 added creation of a tar archive for distribution
150 replaced ir/.dummy.in by ir/Makefile.in
153 Changed equivalent_node() and copy_preds() so that the end block
154 is not optimized away if it has no real predecessors. This fixes
155 the problem with the while examples.
156 Added while_example in Makefile
159 Fooled around with if_while_example: Why does cse make it abort?
160 Cse removes path to End node, Bad remains as pred of Endblock.
161 The block walker can't deal with this.
162 Made new example with only loop: while_example.
165 added auto documentation in Makefiles, configure, etc
166 example in ir/ir/ircons.c - much must be added
167 creation of documentation by 'make autodoc' in architecture directory
170 added lots of #ifdef HAVE_CONFIG_G #include "config.h" #endif
171 replaced some C++ style comments (//) by standard C comments /**/
174 - configure (with some features, see --help for more)
175 - make [depend | tags | install]
176 - make [run] in testprograms
178 - compilation on SunOS
180 - automatic call of autoconf if required
183 More colours in vcg output.
184 Fixed bug: cse found that start block equals it's
185 first successor as both have the Start block as predecessor.
186 This only happens for local_optimize_graph() as during construction
187 the Start block is not entered in the value table.
188 Changed implementation: irgmod: local_optimize_graph() did not
189 empty the hash table with the irnodes for cse. This might cause that
190 cse turns up with a node that seems better but was removed from the
191 graph in an earlier optimization phase.
192 Removed old #if 1 from ircons.c
193 Commented in call of optimization for Block nodes in irgopt.c, copy_preds():
194 Optimizes blocks that had bad predecessors.
199 Moved struct from irprog.h to irprog_t.h, same for irmode.h.
200 Added a module deb_info in debug.h. Adapted makefile. Added example
202 Removed use of debug.h in ident.c. Now debug.c|h can be moved to
204 Removed inabled code for dead node elimination in irgopt.h.
205 Renamed some missnamed access routines (_of_). Macros with old names
206 are in old_fctnames.h.
207 Edited makefiles to remove #* and *.flc.
210 Some minor bugfixes...
213 After compacting of in arrays in dead_node_elimination
214 merge blocks and remove Phis with one pred.
217 Freeing of obstack in dead_node_elimination commented in.
218 Compacting in arrays of Block and Phi nodes in dead_node_
223 added set/get_SymConst_type_or_id in irnode.h
224 added field offset to entity in entity.h
225 added field size to type_class in type.h
226 include "gmp.h" in tv.h with "" instead <>
229 Some changes to make the lib better portable
232 Initialize max_node_nr in irprog.
235 Now outputs warning if faulty type in irdump, dump_type_info.
236 Explicit string termination in irdump, vcg_open.
239 Added external to declaration of irp.
240 Added typedef before pns and pnc_number.
241 irmode.c, init_mode(): We need to memset all new modes as
242 tarval_vrfy reads fields before they are initialized: It
243 compares to min/max when tarvals for min/max are allocated!
246 Changed parameter of Methods in type.h and type.c from
247 class to clss. Class is a C++ keyword.
250 Changed some testprograms to accomodate Uebprakt.
253 Finished implementation of dump_all_types.
254 Added new testprogram inheritance_example.
257 Added seven access routines in type.[hc]:
258 get_class_n_member, get_class_n_subtype, get_class_n_supertype,
259 get_strct_n_member, add_strct_member, get_strct_member and set_strct_member.
260 Fixed the type_walk_2 for those seven routines.
263 Added irdump routine dump_all_types.
264 Did changes to irprog, type, typewalk to achieve this.
265 typewalk needs to walk along members, sub and supertypes, this
266 is still missing! irdump then needs to output these edges.
268 ======================================================================
269 ==================== New version: 0.2.5 ==============================
270 ======================================================================
273 Made new Version: 0.2.5
275 15.8.2000 Goetz until 3.9.00
276 Separated irnode.h and many others into two files: one public
278 Added funcionality to extract headers for lib.
281 type_dump also dumps irg->ent
282 if_example: corrected nr of locals
285 irgopt: Correct copy of self pointer in start block.
286 irgopt: Correct treatment of loops: pre function in walker
287 breaks all possible loops in Phi and Block nodes.
288 irr_loop_example: wrong Return statement
289 Now I fixed all but one error: in memory_example.
290 This error showed a conceptual problem, so I wrote
291 a slightly different algorithm. This now runs for
293 dead_node_example: cse is buggy!! merges start and the
297 looking at bug in dead_node_elimination.
299 irnode: all get_..._arr functions changed
300 ircons: new_r_Block: set matured flag.
301 ircons: new_r_SymConst: needs mode_p for linkage_ptr_info.
302 adapted call_str_example to new concepts.
305 Implemented simpler Phi construction algorithm that constructs
306 correct code for three_cfpred_example in ircons. This algorithm
307 generates more Id nodes than the original algorithm and therefore
309 Also made some changes to optimizations of Not.
312 Fixed a bug, caused by the recursive use in type.h and entity.h.
313 Deleted the _TYPE_TYPEDEF_ and inserted the _ENTITY_TYPEDEF_ instead.
314 Fixed a problem in if_while testprogram, so it now works.
317 Fixed bug in optimize(). Returned Null instead n if
318 get_optimize() == false.
321 Added some access routines in type.[hc]. Solved a recursive definition
322 of type_class struct, entity struct and type union.
325 Separated entity header into pure functional header and header
329 ... a bunch small changes not documented
332 Changed output of oo_prog_example: now uses the internal list
333 of all irgs. Had to implement some of the access routines for
334 that. Also fixed a bug in irdump. Main routines did not use
335 current_ir_graph properly.
338 Implemented some missing parts in irgopt.
339 Added field irg to entity. Only valid if entity is a method.
340 Had to resove a cyclic de[endency between irgraph.h and entity.h
342 Added fields sub and super to type_class for inheritance.
343 Added field main_irg to irprog.
346 Fixed some bugs in irgopt.c
347 Added some missing 'get_new_node' methods, so the new obstack contains
351 Renamed ir_vrfy to irn_vrfy and vrfy_graphg to irg_vrfy.
352 Solved some copy'n'paste problems. Deleted most debug-code!
353 Added comments to several files.
356 Fixed bug in _r_ constructors for all four Div operations.
357 Fixed bug in turn_into_tuple: didn't remember the block.
358 Tested transform_node.
361 Fixed some testprograms to new semantics of firm.
362 Added testprogram global_var_example.
363 Fixed a bug in irop: Size of Sel node was (entity *) instead of
364 sel_attr. Therefor array_heap_example aborted.
365 Also found a missing break in typewalk, case iro_Alloc.
366 Added a construct that unifies all things constructed by the lib
367 and needed to represent a program: irprog.ch
368 This contains a list of all types as well as a list of all ir graphs.
369 I added calls to initialization and constructors so that this is constructed
370 automatically. I changed firm.c, type.c, irgraph.c and ev. more.
371 Removed strange block struct and constructor from ircons.c.
372 Moved routines for automatic Phi construction from irgmod to ircons.
373 Sorted functions in ircons to reflect the different interfaces.
374 Renamed dataseg to globals to be conformant with documentation.
375 Added conservation of current_ir_graph to irgopt.c.
376 Corrected bug in Makefiles: wrong path to directory ./inlude.
379 Commented a whole bunch of stuff, e.g. in ircons.h (Procedure to construct)
380 We should change the naming of the Block constructor.
381 Removed acces routines to attr. "closed" of Block.
382 Removed second implementation of new_ir_node from ircons and some comments
383 concerned with the now resolved cyclic dependency.
384 Fixed some bugs in irgopt so that the compilation goes through.
387 Changed the irnode attribut 'visit' into 'visited'.
388 Added some access functions, like get/set_irn_visit etc.
391 Renamed some access funtion in irgraph.*.
392 Deleted two global flags (ir_visited and block_visited) from irgraph.*.
393 Added two attributes to the irgraph struct. The visited flags belongs
394 to a ir graph, not to a whole program.
397 A new optimization has been finished. The dead-node-elimination copies
398 the existing ir graph from one opstack to another. While walking the
399 graph, only the reachable nodes will be copied, so the "dead-nodes"
400 (unreachable in the controlflow) are removed.
403 Solved some problems in the 'copy_node' function. The in array was not
404 as easy as it seamed.
407 Wrote a new 'post' funtion, for future use in 'dead-node-elimination'
408 optimization, which is needed in the paramter list of 'irg_walk'.
411 Moved 'optimze_in_place_wrapper' from iropt.* tothe new files irgopt.*.
412 New functions 'local_optimze_graph' and 'dead_node_elimination' are added,
416 Removed some files from the archive, after dependencies and usage are
418 - 'ir/common/strerror.c'
420 - 'ir/ident/xx_ident.h'
421 an empty file, only included by 'ident.c', but never used;
422 - 'ir/tv/label.c' and
424 contained a numeric counter;
425 The files were included in 'tv.h' and implemented in 'tarval.c'. The two
426 functions 'tarval_label' and 'tarval_forall_labeled' were also never used.
427 In the old fiasco compiler, the label thing is used in the backend.
428 Search for 'babil' to see the usage.
429 Also removed the two attributes 'lab' and 'used' in the tarval struct.
432 Moved the 'new_ir_node' constructor from ircons.* to irnode.* and fixed
433 afterwards some recursive includes, so libfirm works again.
436 Did a lot of changes, which I never commented until now (4.7.00).
438 * Added new result to Start node: Pointer to global data segment.
439 * Extended Semantics of SymConst node to represent information for the
441 * Added arithmeitc nodes (Shrs, Minus ...)
443 Rearranged the directory structure and adjusted the makefiles.
444 The directories contain:
445 ir: everything for the intermediate representation (better: src?)
446 /ir: the ir itself, and standard optimizations.
447 /tv: the target value module
448 /tr: the type and entity representation
449 /adt: abstract data types
450 /common: stuff needed by all other dirs
451 /debug: debugging Unterstuetzung
453 include: external files needen as includes
454 testprograms: examples to test the lib.
456 The makefiles generate files with extension .d that contain the dependencies
460 Added access routine to attribute link of irnode in irnode.ch.
461 Added get_negated_pnc to irnode.ch.
464 Added an iterator in iropt that calls the optimization for all nodes.
465 Copied optimize's code to optimize_in_place and removed deallocations.
466 Made set_irn_n in irnode.c public.
467 Added Bad as possible cfg predecessor in is_cfg_node in irnode. Bads
468 are allowded as cfgpredecessors to represent dead "incoming" control
470 Added call to optimize_in_place in mature_block. Is this useful?
473 Changed tests from comparing enums to comparing pointers. This is more
474 efficient (is it?) and reads better. e.g., instead get_irn_opcode == irm_And
475 now get_irn_op == op_And
478 Compared equivalent_value to the one in the original fiasco.
479 Added a test in case iro_And.
480 Changed implementation of iro_Div. Added routines turn_into_tuple
481 and set_irn_op() in irgmod/irnode.
482 Changed implementation of irn_Minus (although commented out).
483 Now all features are ported or documented for this function.
486 Compared computed_value to the one in the original fiasco.
487 Added one further optimization in case iro_Proj.
488 Now all features are ported for this function.
491 Updated comments in ircons.h.
494 Changed possible attribute of SymConst from type_class to type.
495 SymConst size could be the size of a union, array, ...
498 Implemented two dumpers that dump type information and a graph with
502 Implemented a walker that walks over the type informatin that can
503 be reached from an ir node.
504 Added routine get_kind(firm_thing) in common.h, Added file common.c.
505 Added files typewalk.ch and routines to irdump.
506 Added visited flags and initialization to entity and all types.
507 Implemented some of the missing access routines in type.c, entity.c
510 Implemented constructor for ShrA.
512 Added routine that iterates the graph and verifies all nodes.
513 Added Phi_in stack to irgraph. This allows to build several
514 graphs at once with respect to the Phi building algorithm.
517 Implemented dumper for control flow graphs. Changed irr_* and dead_*
518 examples to dump cfg.
521 Implemeted explicit stack for the Phi node generation. See ircons.c.
524 added include string.h in xoprintf.c to get rid of warning:
525 implicit declaration of function `bcopy'
529 Added more cases to equivalent_node.
530 Portet gigo, identify, identify_remember.
531 The set/pset library can not handle several hash tables. At least,
532 compiling several procedures causes a segmentation fault during access
533 to the tables (oo_program_example). Need to work on this.
534 transform_node still needs to be ported.
535 some cases in equivalent_node are still missing.
537 To get it running I had to remove the call to optimize in the
538 new_Block constructor. It can only be called when the Block is
542 Introduced a walker that walks only over blocks. The asserts
543 might be too strict for general graphs, but so far it works.
544 For the walker I introduced an additional flag in the attribute
545 of Blocks, an a global block_visited variable (in irgraph.h).
546 Furhter I modularized dump_ir_node, implemented dump_ir_graph
547 with the existing walker, and added new routines to output a
549 Changed the examples to call the new dump routine.
552 Added auxiliary routines to ir_node:
553 skip_Proj, skip_Nop, is_Bad ...
554 Changed access routines to use get_irn_n instead of explicit array
555 accesses. Changed get_irn_n to call skip_Id, so that the access routines
556 never will return Id nodes.
559 Repaired Phi computation, changed new_r_Phi_in. Added test program to
560 test irregular controlflow.
563 Updated optimizations computed_value and equivalent_node to new
564 Syntax of FIRM nodes and to use access routines.
565 Added routine skip_Proj in irnode.
567 2.2.2000 Boris Boesler
568 Added files irgwalk.c and irgwalk.h. They include a simple function to
569 traverse an ir graph and execute pre and post functions to current node.
572 Added arrays with parameters and result types to the type informtion
573 of a procedure. This is needed for the code generation. Also added
574 the corresponding access routines.
575 Adapted the testprograms.
578 Found a bug / complication: the call order
579 get_value (makes Phi0, put's it into graph_arr)
580 set_value (overwrites Phi0 in graph_arr)
581 mature_block (upgrades Phi0, puts it again into graph_arr, overwriting
583 fails. Added test wether graph_arr is already set in phi_merge.
585 Added tons of comments to explain Phi generation -- the stack hack.
589 irdump now outputs the pnc_number for projs of Cmp nodes.
590 Added routine to access the pnc_string.
593 Added result "dataseg" to Start node, with all it's consequences.
594 We need this for the compiler lab to translate global variables.
595 Now they can be selected from the data segment, and the start
596 node supplies the pointer to this segment.
597 These changes are guarded by preprocessor variable UEBPRAKT in
599 Changed files: common.h, irgraph.ch, irnode.h
603 removed array_example, added array-heap_example and
604 array-stack_example and adapted makefile.
606 Entity now also allows type_method as owner. This is to model
607 the stack, Sel nodes that select a variable (array) from the
608 stack need an entity that describes what they select. This
609 entity gets the type of the enclosing procedure as owner.
612 Added future access routines in `irmode.[ch]' as comments,
613 that all attributes in the ir_mode struct can be user-defined.
614 Added access routines in `irgraph.[ch]', for all attributes.
617 Moved verify routines from `irgraph.[ch]' to own files `irvrfy.[ch]'.
618 Added `irvrfy.[ch]' to MAKEFILE
619 Added "inline" before access routines in `irnode.h', that no warnings
620 will appear furthermore.
621 Added three more access routines in `irmode.[ch]':
622 struct tarval *get_min_of_mode (ir_mode *mode);
623 struct tarval *get_max_of_mode (ir_mode *mode);
624 struct tarval *get_null_of_mode (ir_mode *mode);
627 Adaption of Alloc, Sel and Entity to new types:
628 Changed array_example to use type instead of type_class.
629 Changed entity to allow all types as owner instead of
630 only type_class. Added routine "assert_legal_owner_of_ent(type* type)".
631 Changed alloc to allow allocating variables of any type instead of
633 Adapted all testprograms to avoid warnings.
635 removed dtest ... from Makefile, replaced by test.
638 Added "run" to makefile, added array_example to makefile of testprograms.
639 Corrected testprogram array
640 Changed assert in irvrfy -- Conv.