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