2 Changed output of oo_prog_example: now uses the internal list
3 of all irgs. Had to implement some of the access routines for
4 that. Also fixed a bug in irdump. Main routines did not use
5 current_ir_graph properly.
8 Implemented some missing parts in irgopt.
9 Added field irg to entity. Only valid if entity is a method.
10 Had to resove a cyclic de[endency between irgraph.h and entity.h
12 Added fields sub and super to type_class for inheritance.
13 Added field main_irg to irprog.
16 Fixed some bugs in irgopt.c
17 Added some missing 'get_new_node' methods, so the new obstack contains
21 Renamed ir_vrfy to irn_vrfy and vrfy_graphg to irg_vrfy.
22 Solved some copy'n'paste problems. Deleted most debug-code!
23 Added comments to several files.
26 Fixed bug in _r_ constructors for all four Div operations.
27 Fixed bug in turn_into_tuple: didn't remember the block.
28 Tested transform_node.
31 Fixed some testprograms to new semantics of firm.
32 Added testprogram global_var_example.
33 Fixed a bug in irop: Size of Sel node was (entity *) instead of
34 sel_attr. Therefor array_heap_example aborted.
35 Also found a missing break in typewalk, case iro_Alloc.
36 Added a construct that unifies all things constructed by the lib
37 and needed to represent a program: irprog.ch
38 This contains a list of all types as well as a list of all ir graphs.
39 I added calls to initialization and constructors so that this is constructed
40 automatically. I changed firm.c, type.c, irgraph.c and ev. more.
41 Removed strange block struct and constructor from ircons.c.
42 Moved routines for automatic Phi construction from irgmod to ircons.
43 Sorted functions in ircons to reflect the different interfaces.
44 Renamed dataseg to globals to be conformant with documentation.
45 Added conservation of current_ir_graph to irgopt.c.
46 Corrected bug in Makefiles: wrong path to directory ./inlude.
49 Commented a whole bunch of stuff, e.g. in ircons.h (Procedure to construct)
50 We should change the naming of the Block constructor.
51 Removed acces routines to attr. "closed" of Block.
52 Removed second implementation of new_ir_node from ircons and some comments
53 concerned with the now resolved cyclic dependency.
54 Fixed some bugs in irgopt so that the compilation goes through.
57 Changed the irnode attribut 'visit' into 'visited'.
58 Added some access functions, like get/set_irn_visit etc.
61 Renamed some access funtion in irgraph.*.
62 Deleted two global flags (ir_visited and block_visited) from irgraph.*.
63 Added two attributes to the irgraph struct. The visited flags belongs
64 to a ir graph, not to a whole program.
67 A new optimization has been finished. The dead-node-elimination copies
68 the existing ir graph from one opstack to another. While walking the
69 graph, only the reachable nodes will be copied, so the "dead-nodes"
70 (unreachable in the controlflow) are removed.
73 Solved some problems in the 'copy_node' function. The in array was not
77 Wrote a new 'post' funtion, for future use in 'dead-node-elimination'
78 optimization, which is needed in the paramter list of 'irg_walk'.
81 Moved 'optimze_in_place_wrapper' from iropt.* tothe new files irgopt.*.
82 New functions 'local_optimze_graph' and 'dead_node_elimination' are added,
86 Removed some files from the archive, after dependencies and usage are
88 - 'ir/common/strerror.c'
90 - 'ir/ident/xx_ident.h'
91 an empty file, only included by 'ident.c', but never used;
94 contained a numeric counter;
95 The files were included in 'tv.h' and implemented in 'tarval.c'. The two
96 functions 'tarval_label' and 'tarval_forall_labeled' were also never used.
97 In the old fiasco compiler, the label thing is used in the backend.
98 Search for 'babil' to see the usage.
99 Also removed the two attributes 'lab' and 'used' in the tarval struct.
102 Moved the 'new_ir_node' constructor from ircons.* to irnode.* and fixed
103 afterwards some recursive includes, so libfirm works again.
106 Did a lot of changes, which I never commented until now (4.7.00).
108 * Added new result to Start node: Pointer to global data segment.
109 * Extended Semantics of SymConst node to represent information for the
111 * Added arithmeitc nodes (Shrs, Minus ...)
113 Rearranged the directory structure and adjusted the makefiles.
114 The directories contain:
115 ir: everything for the intermediate representation (better: src?)
116 /ir: the ir itself, and standard optimizations.
117 /tv: the target value module
118 /tr: the type and entity representation
119 /adt: abstract data types
120 /common: stuff needed by all other dirs
121 /debug: debugging Unterstuetzung
123 include: external files needen as includes
124 testprograms: examples to test the lib.
126 The makefiles generate files with extension .d that contain the dependencies
130 Added access routine to attribute link of irnode in irnode.ch.
131 Added get_negated_pnc to irnode.ch.
134 Added an iterator in iropt that calls the optimization for all nodes.
135 Copied optimize's code to optimize_in_place and removed deallocations.
136 Made set_irn_n in irnode.c public.
137 Added Bad as possible cfg predecessor in is_cfg_node in irnode. Bads
138 are allowded as cfgpredecessors to represent dead "incoming" control
140 Added call to optimize_in_place in mature_block. Is this useful?
143 Changed tests from comparing enums to comparing pointers. This is more
144 efficient (is it?) and reads better. e.g., instead get_irn_opcode == irm_And
145 now get_irn_op == op_And
148 Compared equivalent_value to the one in the original fiasco.
149 Added a test in case iro_And.
150 Changed implementation of iro_Div. Added routines turn_into_tuple
151 and set_irn_op() in irgmod/irnode.
152 Changed implementation of irn_Minus (although commented out).
153 Now all features are ported or documented for this function.
156 Compared computed_value to the one in the original fiasco.
157 Added one further optimization in case iro_Proj.
158 Now all features are ported for this function.
161 Updated comments in ircons.h.
164 Changed possible attribute of SymConst from type_class to type.
165 SymConst size could be the size of a union, array, ...
168 Implemented two dumpers that dump type information and a graph with
172 Implemented a walker that walks over the type informatin that can
173 be reached from an ir node.
174 Added routine get_kind(firm_thing) in common.h, Added file common.c.
175 Added files typewalk.ch and routines to irdump.
176 Added visited flags and initialization to entity and all types.
177 Implemented some of the missing access routines in type.c, entity.c
180 Implemented constructor for ShrA.
182 Added routine that iterates the graph and verifies all nodes.
183 Added Phi_in stack to irgraph. This allows to build several
184 graphs at once with respect to the Phi building algorithm.
187 Implemented dumper for control flow graphs. Changed irr_* and dead_*
188 examples to dump cfg.
191 Implemeted explicit stack for the Phi node generation. See ircons.c.
194 added include string.h in xoprintf.c to get rid of warning:
195 implicit declaration of function `bcopy'
199 Added more cases to equivalent_node.
200 Portet gigo, identify, identify_remember.
201 The set/pset library can not handle several hash tables. At least,
202 compiling several procedures causes a segmentation fault during access
203 to the tables (oo_program_example). Need to work on this.
204 transform_node still needs to be ported.
205 some cases in equivalent_node are still missing.
207 To get it running I had to remove the call to optimize in the
208 new_Block constructor. It can only be called when the Block is
212 Introduced a walker that walks only over blocks. The asserts
213 might be too strict for general graphs, but so far it works.
214 For the walker I introduced an additional flag in the attribute
215 of Blocks, an a global block_visited variable (in irgraph.h).
216 Furhter I modularized dump_ir_node, implemented dump_ir_graph
217 with the existing walker, and added new routines to output a
219 Changed the examples to call the new dump routine.
222 Added auxiliary routines to ir_node:
223 skip_Proj, skip_Nop, is_Bad ...
224 Changed access routines to use get_irn_n instead of explicit array
225 accesses. Changed get_irn_n to call skip_Id, so that the access routines
226 never will return Id nodes.
229 Repaired Phi computation, changed new_r_Phi_in. Added test program to
230 test irregular controlflow.
233 Updated optimizations computed_value and equivalent_node to new
234 Syntax of FIRM nodes and to use access routines.
235 Added routine skip_Proj in irnode.
237 2.2.2000 Boris Boesler
238 Added files irgwalk.c and irgwalk.h. They include a simple function to
239 traverse an ir graph and execute pre and post functions to current node.
242 Added arrays with parameters and result types to the type informtion
243 of a procedure. This is needed for the code generation. Also added
244 the corresponding access routines.
245 Adapted the testprograms.
248 Found a bug / complication: the call order
249 get_value (makes Phi0, put's it into graph_arr)
250 set_value (overwrites Phi0 in graph_arr)
251 mature_block (upgrades Phi0, puts it again into graph_arr, overwriting
253 fails. Added test wether graph_arr is already set in phi_merge.
255 Added tons of comments to explain Phi generation -- the stack hack.
259 irdump now outputs the pnc_number for projs of Cmp nodes.
260 Added routine to access the pnc_string.
263 Added result "dataseg" to Start node, with all it's consequences.
264 We need this for the compiler lab to translate global variables.
265 Now they can be selected from the data segment, and the start
266 node supplies the pointer to this segment.
267 These changes are guarded by preprocessor variable UEBPRAKT in
269 Changed files: common.h, irgraph.ch, irnode.h
273 removed array_example, added array-heap_example and
274 array-stack_example and adapted makefile.
276 Entity now also allows type_method as owner. This is to model
277 the stack, Sel nodes that select a variable (array) from the
278 stack need an entity that describes what they select. This
279 entity gets the type of the enclosing procedure as owner.
282 Added future access routines in `irmode.[ch]' as comments,
283 that all attributes in the ir_mode struct can be user-defined.
284 Added access routines in `irgraph.[ch]', for all attributes.
287 Moved verify routines from `irgraph.[ch]' to own files `irvrfy.[ch]'.
288 Added `irvrfy.[ch]' to MAKEFILE
289 Added "inline" before access routines in `irnode.h', that no warnings
290 will appear furthermore.
291 Added three more access routines in `irmode.[ch]':
292 struct tarval *get_min_of_mode (ir_mode *mode);
293 struct tarval *get_max_of_mode (ir_mode *mode);
294 struct tarval *get_null_of_mode (ir_mode *mode);
297 Adaption of Alloc, Sel and Entity to new types:
298 Changed array_example to use type instead of type_class.
299 Changed entity to allow all types as owner instead of
300 only type_class. Added routine "assert_legal_owner_of_ent(type* type)".
301 Changed alloc to allow allocating variables of any type instead of
303 Adapted all testprograms to avoid warnings.
305 removed dtest ... from Makefile, replaced by test.
308 Added "run" to makefile, added array_example to makefile of testprograms.
309 Corrected testprogram array
310 Changed assert in irvrfy -- Conv.