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