2 Added external to declaration of irp.
3 Added typedef before pns and pnc_number.
4 irmode.c, init_mode(): We need to memset all new modes as
5 tarval_vrfy reads fields before they are initialized: It
6 compares to min/max when tarvals for min/max are allocated!
9 Changed parameter of Methods in type.h and type.c from
10 class to clss. Class is a C++ keyword.
13 Changed some testprograms to accomodate Uebprakt.
16 Finished implementation of dump_all_types.
17 Added new testprogram inheritance_example.
20 Added seven access routines in type.[hc]:
21 get_class_n_member, get_class_n_subtype, get_class_n_supertype,
22 get_strct_n_member, add_strct_member, get_strct_member and set_strct_member.
23 Fixed the type_walk_2 for those seven routines.
26 Added irdump routine dump_all_types.
27 Did changes to irprog, type, typewalk to achieve this.
28 typewalk needs to walk along members, sub and supertypes, this
29 is still missing! irdump then needs to output these edges.
31 ======================================================================
32 ==================== New version: 0.2.5 ==============================
33 ======================================================================
36 Made new Version: 0.2.5
38 15.8.2000 Goetz until 3.9.00
39 Separated irnode.h and many others into two files: one public
41 Added funcionality to extract headers for lib.
44 type_dump also dumps irg->ent
45 if_example: corrected nr of locals
48 irgopt: Correct copy of self pointer in start block.
49 irgopt: Correct treatment of loops: pre function in walker
50 breaks all possible loops in Phi and Block nodes.
51 irr_loop_example: wrong Return statement
52 Now I fixed all but one error: in memory_example.
53 This error showed a conceptual problem, so I wrote
54 a slightly different algorithm. This now runs for
56 dead_node_example: cse is buggy!! merges start and the
60 looking at bug in dead_node_elimination.
62 irnode: all get_..._arr functions changed
63 ircons: new_r_Block: set matured flag.
64 ircons: new_r_SymConst: needs mode_p for linkage_ptr_info.
65 adapted call_str_example to new concepts.
68 Implemented simpler Phi construction algorithm that constructs
69 correct code for three_cfpred_example in ircons. This algorithm
70 generates more Id nodes than the original algorithm and therefore
72 Also made some changes to optimizations of Not.
75 Fixed a bug, caused by the recursive use in type.h and entity.h.
76 Deleted the _TYPE_TYPEDEF_ and inserted the _ENTITY_TYPEDEF_ instead.
77 Fixed a problem in if_while testprogram, so it now works.
80 Fixed bug in optimize(). Returned Null instead n if
81 get_optimize() == false.
84 Added some access routines in type.[hc]. Solved a recursive definition
85 of type_class struct, entity struct and type union.
88 Separated entity header into pure functional header and header
92 ... a bunch small changes not documented
95 Changed output of oo_prog_example: now uses the internal list
96 of all irgs. Had to implement some of the access routines for
97 that. Also fixed a bug in irdump. Main routines did not use
98 current_ir_graph properly.
101 Implemented some missing parts in irgopt.
102 Added field irg to entity. Only valid if entity is a method.
103 Had to resove a cyclic de[endency between irgraph.h and entity.h
105 Added fields sub and super to type_class for inheritance.
106 Added field main_irg to irprog.
109 Fixed some bugs in irgopt.c
110 Added some missing 'get_new_node' methods, so the new obstack contains
114 Renamed ir_vrfy to irn_vrfy and vrfy_graphg to irg_vrfy.
115 Solved some copy'n'paste problems. Deleted most debug-code!
116 Added comments to several files.
119 Fixed bug in _r_ constructors for all four Div operations.
120 Fixed bug in turn_into_tuple: didn't remember the block.
121 Tested transform_node.
124 Fixed some testprograms to new semantics of firm.
125 Added testprogram global_var_example.
126 Fixed a bug in irop: Size of Sel node was (entity *) instead of
127 sel_attr. Therefor array_heap_example aborted.
128 Also found a missing break in typewalk, case iro_Alloc.
129 Added a construct that unifies all things constructed by the lib
130 and needed to represent a program: irprog.ch
131 This contains a list of all types as well as a list of all ir graphs.
132 I added calls to initialization and constructors so that this is constructed
133 automatically. I changed firm.c, type.c, irgraph.c and ev. more.
134 Removed strange block struct and constructor from ircons.c.
135 Moved routines for automatic Phi construction from irgmod to ircons.
136 Sorted functions in ircons to reflect the different interfaces.
137 Renamed dataseg to globals to be conformant with documentation.
138 Added conservation of current_ir_graph to irgopt.c.
139 Corrected bug in Makefiles: wrong path to directory ./inlude.
142 Commented a whole bunch of stuff, e.g. in ircons.h (Procedure to construct)
143 We should change the naming of the Block constructor.
144 Removed acces routines to attr. "closed" of Block.
145 Removed second implementation of new_ir_node from ircons and some comments
146 concerned with the now resolved cyclic dependency.
147 Fixed some bugs in irgopt so that the compilation goes through.
150 Changed the irnode attribut 'visit' into 'visited'.
151 Added some access functions, like get/set_irn_visit etc.
154 Renamed some access funtion in irgraph.*.
155 Deleted two global flags (ir_visited and block_visited) from irgraph.*.
156 Added two attributes to the irgraph struct. The visited flags belongs
157 to a ir graph, not to a whole program.
160 A new optimization has been finished. The dead-node-elimination copies
161 the existing ir graph from one opstack to another. While walking the
162 graph, only the reachable nodes will be copied, so the "dead-nodes"
163 (unreachable in the controlflow) are removed.
166 Solved some problems in the 'copy_node' function. The in array was not
167 as easy as it seamed.
170 Wrote a new 'post' funtion, for future use in 'dead-node-elimination'
171 optimization, which is needed in the paramter list of 'irg_walk'.
174 Moved 'optimze_in_place_wrapper' from iropt.* tothe new files irgopt.*.
175 New functions 'local_optimze_graph' and 'dead_node_elimination' are added,
179 Removed some files from the archive, after dependencies and usage are
181 - 'ir/common/strerror.c'
183 - 'ir/ident/xx_ident.h'
184 an empty file, only included by 'ident.c', but never used;
185 - 'ir/tv/label.c' and
187 contained a numeric counter;
188 The files were included in 'tv.h' and implemented in 'tarval.c'. The two
189 functions 'tarval_label' and 'tarval_forall_labeled' were also never used.
190 In the old fiasco compiler, the label thing is used in the backend.
191 Search for 'babil' to see the usage.
192 Also removed the two attributes 'lab' and 'used' in the tarval struct.
195 Moved the 'new_ir_node' constructor from ircons.* to irnode.* and fixed
196 afterwards some recursive includes, so libfirm works again.
199 Did a lot of changes, which I never commented until now (4.7.00).
201 * Added new result to Start node: Pointer to global data segment.
202 * Extended Semantics of SymConst node to represent information for the
204 * Added arithmeitc nodes (Shrs, Minus ...)
206 Rearranged the directory structure and adjusted the makefiles.
207 The directories contain:
208 ir: everything for the intermediate representation (better: src?)
209 /ir: the ir itself, and standard optimizations.
210 /tv: the target value module
211 /tr: the type and entity representation
212 /adt: abstract data types
213 /common: stuff needed by all other dirs
214 /debug: debugging Unterstuetzung
216 include: external files needen as includes
217 testprograms: examples to test the lib.
219 The makefiles generate files with extension .d that contain the dependencies
223 Added access routine to attribute link of irnode in irnode.ch.
224 Added get_negated_pnc to irnode.ch.
227 Added an iterator in iropt that calls the optimization for all nodes.
228 Copied optimize's code to optimize_in_place and removed deallocations.
229 Made set_irn_n in irnode.c public.
230 Added Bad as possible cfg predecessor in is_cfg_node in irnode. Bads
231 are allowded as cfgpredecessors to represent dead "incoming" control
233 Added call to optimize_in_place in mature_block. Is this useful?
236 Changed tests from comparing enums to comparing pointers. This is more
237 efficient (is it?) and reads better. e.g., instead get_irn_opcode == irm_And
238 now get_irn_op == op_And
241 Compared equivalent_value to the one in the original fiasco.
242 Added a test in case iro_And.
243 Changed implementation of iro_Div. Added routines turn_into_tuple
244 and set_irn_op() in irgmod/irnode.
245 Changed implementation of irn_Minus (although commented out).
246 Now all features are ported or documented for this function.
249 Compared computed_value to the one in the original fiasco.
250 Added one further optimization in case iro_Proj.
251 Now all features are ported for this function.
254 Updated comments in ircons.h.
257 Changed possible attribute of SymConst from type_class to type.
258 SymConst size could be the size of a union, array, ...
261 Implemented two dumpers that dump type information and a graph with
265 Implemented a walker that walks over the type informatin that can
266 be reached from an ir node.
267 Added routine get_kind(firm_thing) in common.h, Added file common.c.
268 Added files typewalk.ch and routines to irdump.
269 Added visited flags and initialization to entity and all types.
270 Implemented some of the missing access routines in type.c, entity.c
273 Implemented constructor for ShrA.
275 Added routine that iterates the graph and verifies all nodes.
276 Added Phi_in stack to irgraph. This allows to build several
277 graphs at once with respect to the Phi building algorithm.
280 Implemented dumper for control flow graphs. Changed irr_* and dead_*
281 examples to dump cfg.
284 Implemeted explicit stack for the Phi node generation. See ircons.c.
287 added include string.h in xoprintf.c to get rid of warning:
288 implicit declaration of function `bcopy'
292 Added more cases to equivalent_node.
293 Portet gigo, identify, identify_remember.
294 The set/pset library can not handle several hash tables. At least,
295 compiling several procedures causes a segmentation fault during access
296 to the tables (oo_program_example). Need to work on this.
297 transform_node still needs to be ported.
298 some cases in equivalent_node are still missing.
300 To get it running I had to remove the call to optimize in the
301 new_Block constructor. It can only be called when the Block is
305 Introduced a walker that walks only over blocks. The asserts
306 might be too strict for general graphs, but so far it works.
307 For the walker I introduced an additional flag in the attribute
308 of Blocks, an a global block_visited variable (in irgraph.h).
309 Furhter I modularized dump_ir_node, implemented dump_ir_graph
310 with the existing walker, and added new routines to output a
312 Changed the examples to call the new dump routine.
315 Added auxiliary routines to ir_node:
316 skip_Proj, skip_Nop, is_Bad ...
317 Changed access routines to use get_irn_n instead of explicit array
318 accesses. Changed get_irn_n to call skip_Id, so that the access routines
319 never will return Id nodes.
322 Repaired Phi computation, changed new_r_Phi_in. Added test program to
323 test irregular controlflow.
326 Updated optimizations computed_value and equivalent_node to new
327 Syntax of FIRM nodes and to use access routines.
328 Added routine skip_Proj in irnode.
330 2.2.2000 Boris Boesler
331 Added files irgwalk.c and irgwalk.h. They include a simple function to
332 traverse an ir graph and execute pre and post functions to current node.
335 Added arrays with parameters and result types to the type informtion
336 of a procedure. This is needed for the code generation. Also added
337 the corresponding access routines.
338 Adapted the testprograms.
341 Found a bug / complication: the call order
342 get_value (makes Phi0, put's it into graph_arr)
343 set_value (overwrites Phi0 in graph_arr)
344 mature_block (upgrades Phi0, puts it again into graph_arr, overwriting
346 fails. Added test wether graph_arr is already set in phi_merge.
348 Added tons of comments to explain Phi generation -- the stack hack.
352 irdump now outputs the pnc_number for projs of Cmp nodes.
353 Added routine to access the pnc_string.
356 Added result "dataseg" to Start node, with all it's consequences.
357 We need this for the compiler lab to translate global variables.
358 Now they can be selected from the data segment, and the start
359 node supplies the pointer to this segment.
360 These changes are guarded by preprocessor variable UEBPRAKT in
362 Changed files: common.h, irgraph.ch, irnode.h
366 removed array_example, added array-heap_example and
367 array-stack_example and adapted makefile.
369 Entity now also allows type_method as owner. This is to model
370 the stack, Sel nodes that select a variable (array) from the
371 stack need an entity that describes what they select. This
372 entity gets the type of the enclosing procedure as owner.
375 Added future access routines in `irmode.[ch]' as comments,
376 that all attributes in the ir_mode struct can be user-defined.
377 Added access routines in `irgraph.[ch]', for all attributes.
380 Moved verify routines from `irgraph.[ch]' to own files `irvrfy.[ch]'.
381 Added `irvrfy.[ch]' to MAKEFILE
382 Added "inline" before access routines in `irnode.h', that no warnings
383 will appear furthermore.
384 Added three more access routines in `irmode.[ch]':
385 struct tarval *get_min_of_mode (ir_mode *mode);
386 struct tarval *get_max_of_mode (ir_mode *mode);
387 struct tarval *get_null_of_mode (ir_mode *mode);
390 Adaption of Alloc, Sel and Entity to new types:
391 Changed array_example to use type instead of type_class.
392 Changed entity to allow all types as owner instead of
393 only type_class. Added routine "assert_legal_owner_of_ent(type* type)".
394 Changed alloc to allow allocating variables of any type instead of
396 Adapted all testprograms to avoid warnings.
398 removed dtest ... from Makefile, replaced by test.
401 Added "run" to makefile, added array_example to makefile of testprograms.
402 Corrected testprogram array
403 Changed assert in irvrfy -- Conv.