2 Removed some files from the archive, after dependences and usage are checked:
3 - 'ir/common/strerror.c'
5 - 'ir/ident/xx_ident.h'
6 an empty file, only included by 'ident.c', but never used;
9 contained a numeric counter;
10 The files were included in 'tv.h' and implemented in 'tarval.c'. The two
11 functions 'tarval_label' and 'tarval_forall_labeled' were also never used.
12 In the old fiasco compiler, the label thing is used in the backend.
13 Search for 'babil' to see the usage.
14 Also removed the two attributes 'lab' and 'used' in the tarval struct.
17 Moved the 'new_ir_node' constructor from ircons.* to irnode.* and fixed
18 afterwards some recursive includes, so libfirm works again.
20 *** Goetz has to complete this lines - several changes are not annotated yet! ***
23 Added access routine to attribute link of irnode in irnode.ch.
24 Added get_negated_pnc to irnode.ch.
27 Added an iterator in iropt that calls the optimization for all nodes.
28 Copied optimize's code to optimize_in_place and removed deallocations.
29 Made set_irn_n in irnode.c public.
30 Added Bad as possible cfg predecessor in is_cfg_node in irnode. Bads
31 are allowded as cfgpredecessors to represent dead "incoming" control
33 Added call to optimize_in_place in mature_block. Is this useful?
36 Changed tests from comparing enums to comparing pointers. This is more
37 efficient and reads better. e.g., instead get_irn_opcode == irm_And
38 now get_irn_op == op_And
41 Compared equivalent_value to the one in the original fiasco.
42 Added a test in case iro_And.
43 Changed implementation of iro_Div. Added routines turn_into_tuple
44 and set_irn_op() in irgmod/irnode.
45 Changed implementation of irn_Minus (although commented out).
46 Now all features are ported or documented for this function.
49 Compared computed_value to the one in the original fiasco.
50 Added one further optimization in case iro_Proj.
51 Now all features are ported for this function.
54 Updated comments in ircons.h.
57 Changed possible attribute of SymConst from type_class to type.
58 SymConst size could be the size of a union, array, ...
61 Implemented two dumpers that dump type information and a graph with
65 Implemented a walker that walks over the type informatin that can
66 be reached from an ir node.
67 Added routine get_kind(firm_thing) in common.h, Added file common.c.
68 Added files typewalk.ch and routines to irdump.
69 Added visited flags and initialization to entity and all types.
70 Implemented some of the missing access routines in type.c, entity.c
73 Implemented constructor for ShrA.
75 Added routine that iterates the graph and verifies all nodes.
76 Added Phi_in stack to irgraph. This allows to build several
77 graphs at once with respect to the Phi building algorithm.
80 Implemented dumper for control flow graphs. Changed irr_* and dead_*
84 Implemeted explicit stack for the Phi node generation. See ircons.c.
87 added include string.h in xoprintf.c to get rid of warning:
88 implicit declaration of function `bcopy'
92 Added more cases to equivalent_node.
93 Portet gigo, identify, identify_remember.
94 The set/pset library can not handle several hash tables. At least,
95 compiling several procedures causes a segmentation fault during access
96 to the tables (oo_program_example). Need to work on this.
97 transform_node still needs to be ported.
98 some cases in equivalent_node are still missing.
100 To get it running I had to remove the call to optimize in the
101 new_Block constructor. It can only be called when the Block is
105 Introduced a walker that walks only over blocks. The asserts
106 might be too strict for general graphs, but so far it works.
107 For the walker I introduced an additional flag in the attribute
108 of Blocks, an a global block_visited variable (in irgraph.h).
109 Furhter I modularized dump_ir_node, implemented dump_ir_graph
110 with the existing walker, and added new routines to output a
112 Changed the examples to call the new dump routine.
115 Added auxiliary routines to ir_node:
116 skip_Proj, skip_Nop, is_Bad ...
117 Changed access routines to use get_irn_n instead of explicit array
118 accesses. Changed get_irn_n to call skip_Id, so that the access routines
119 never will return Id nodes.
122 Repaired Phi computation, changed new_r_Phi_in. Added test program to
123 test irregular controlflow.
126 Updated optimizations computed_value and equivalent_node to new
127 Syntax of FIRM nodes and to use access routines.
128 Added routine skip_Proj in irnode.
130 2.2.2000 Boris Boesler
131 Added files irgwalk.c and irgwalk.h. They include a simple function to
132 traverse an ir graph and execute pre and post functions to current node.
135 Added arrays with parameters and result types to the type informtion
136 of a procedure. This is needed for the code generation. Also added
137 the corresponding access routines.
138 Adapted the testprograms.
141 Found a bug / complication: the call order
142 get_value (makes Phi0, put's it into graph_arr)
143 set_value (overwrites Phi0 in graph_arr)
144 mature_block (upgrades Phi0, puts it again into graph_arr, overwriting
146 fails. Added test wether graph_arr is already set in phi_merge.
148 Added tons of comments to explain Phi generation -- the stack hack.
152 irdump now outputs the pnc_number for projs of Cmp nodes.
153 Added routine to access the pnc_string.
156 Added result "dataseg" to Start node, with all it's consequences.
157 We need this for the compiler lab to translate global variables.
158 Now they can be selected from the data segment, and the start
159 node supplies the pointer to this segment.
160 These changes are guarded by preprocessor variable UEBPRAKT in
162 Changed files: common.h, irgraph.ch, irnode.h
166 removed array_example, added array-heap_example and
167 array-stack_example and adapted makefile.
169 Entity now also allows type_method as owner. This is to model
170 the stack, Sel nodes that select a variable (array) from the
171 stack need an entity that describes what they select. This
172 entity gets the type of the enclosing procedure as owner.
175 Added future access routines in `irmode.[ch]' as comments,
176 that all attributes in the ir_mode struct can be user-defined.
177 Added access routines in `irgraph.[ch]', for all attributes.
180 Moved verify routines from `irgraph.[ch]' to own files `irvrfy.[ch]'.
181 Added `irvrfy.[ch]' to MAKEFILE
182 Added "inline" before access routines in `irnode.h', that no warnings
183 will appear furthermore.
184 Added three more access routines in `irmode.[ch]':
185 struct tarval *get_min_of_mode (ir_mode *mode);
186 struct tarval *get_max_of_mode (ir_mode *mode);
187 struct tarval *get_null_of_mode (ir_mode *mode);
190 Adaption of Alloc, Sel and Entity to new types:
191 Changed array_example to use type instead of type_class.
192 Changed entity to allow all types as owner instead of
193 only type_class. Added routine "assert_legal_owner_of_ent(type* type)".
194 Changed alloc to allow allocating variables of any type instead of
196 Adapted all testprograms to avoid warnings.
198 removed dtest ... from Makefile, replaced by test.
201 Added "run" to makefile, added array_example to makefile of testprograms.
202 Corrected testprogram array
203 Changed assert in irvrfy -- Conv.