2 * Copyright (C) 1995-2010 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief be transform helper extracted from the ia32 backend.
23 * @author Matthias Braun, Michael Beck
32 #include "irgraph_t.h"
40 #include "execfreq_t.h"
44 #include "betranshlp.h"
48 typedef struct be_transform_env_t {
49 ir_graph *irg; /**< The irg, the node should be created in */
50 waitq *worklist; /**< worklist of nodes that still need to be
52 ir_node *old_anchor; /**< the old anchor node in the old irg */
56 static be_transform_env_t env;
58 void be_set_transformed_node(ir_node *old_node, ir_node *new_node)
60 set_irn_link(old_node, new_node);
61 mark_irn_visited(old_node);
62 hook_dead_node_elim_subst(irg, old_node, new_node);
65 int be_is_transformed(const ir_node *node)
67 return irn_visited(node);
70 static inline ir_node *be_get_transformed_node(ir_node *old_node)
72 if (irn_visited(old_node)) {
73 ir_node *new_node = (ir_node*)get_irn_link(old_node);
74 assert(new_node != NULL);
80 void be_duplicate_deps(ir_node *old_node, ir_node *new_node)
82 int deps = get_irn_deps(old_node);
83 for (int i = 0; i < deps; ++i) {
84 ir_node *dep = get_irn_dep(old_node, i);
85 ir_node *new_dep = be_transform_node(dep);
87 add_irn_dep(new_node, new_dep);
91 void be_set_transform_function(ir_op *op, be_transform_func func)
93 /* shouldn't be assigned twice (except for exchanging the default
94 * be_duplicate_node entries) */
95 assert(op->ops.generic == NULL
96 || op->ops.generic == (op_func) be_duplicate_node);
97 op->ops.generic = (op_func) func;
101 * Transform helper for blocks.
103 static ir_node *transform_block(ir_node *node)
105 ir_graph *irg = get_irn_irg(node);
106 dbg_info *dbgi = get_irn_dbg_info(node);
107 ir_mode *mode = get_irn_mode(node);
108 ir_node *block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), mode,
109 get_irn_arity(node), get_irn_in(node) + 1);
110 copy_node_attr(irg, node, block);
111 block->node_nr = node->node_nr;
113 /* transfer execfreq value */
114 double execfreq = get_block_execfreq(node);
115 set_block_execfreq(block, execfreq);
117 /* put the preds in the worklist */
118 be_enqueue_preds(node);
123 static ir_node *transform_end(ir_node *node)
125 /* end has to be duplicated manually because we need a dynamic in array */
126 ir_graph *irg = get_irn_irg(node);
127 dbg_info *dbgi = get_irn_dbg_info(node);
128 ir_node *block = be_transform_node(get_nodes_block(node));
129 ir_node *new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
130 copy_node_attr(irg, node, new_end);
131 be_duplicate_deps(node, new_end);
133 set_irg_end(irg, new_end);
135 /* do not transform predecessors yet to keep the pre-transform
136 * phase from visiting all the graph */
137 int arity = get_irn_arity(node);
138 for (int i = 0; i < arity; ++i) {
139 ir_node *in = get_irn_n(node, i);
140 add_End_keepalive(new_end, in);
142 be_enqueue_preds(node);
147 void be_start_transform_setup(void)
149 ir_clear_opcodes_generic_func();
151 be_set_transform_function(op_Bad, be_duplicate_node);
152 be_set_transform_function(op_be_Copy, be_duplicate_node);
153 be_set_transform_function(op_be_CopyKeep, be_duplicate_node);
154 be_set_transform_function(op_be_IncSP, be_duplicate_node);
155 be_set_transform_function(op_be_Keep, be_duplicate_node);
156 be_set_transform_function(op_be_Return, be_duplicate_node);
157 be_set_transform_function(op_be_Start, be_duplicate_node);
158 be_set_transform_function(op_Block, transform_block);
159 be_set_transform_function(op_End, transform_end);
160 be_set_transform_function(op_NoMem, be_duplicate_node);
161 be_set_transform_function(op_Pin, be_duplicate_node);
162 be_set_transform_function(op_Start, be_duplicate_node);
163 be_set_transform_function(op_Sync, be_duplicate_node);
166 ir_node *be_duplicate_node(ir_node *node)
168 ir_node *block = be_transform_node(get_nodes_block(node));
169 ir_graph *irg = env.irg;
170 dbg_info *dbgi = get_irn_dbg_info(node);
171 ir_mode *mode = get_irn_mode(node);
172 ir_op *op = get_irn_op(node);
175 int arity = get_irn_arity(node);
176 if (op->opar == oparity_dynamic) {
177 new_node = new_ir_node(dbgi, irg, block, op, mode, -1, NULL);
178 for (int i = 0; i < arity; ++i) {
179 ir_node *in = get_irn_n(node, i);
180 in = be_transform_node(in);
181 add_irn_n(new_node, in);
184 ir_node **ins = ALLOCAN(ir_node*, arity);
185 for (int i = 0; i < arity; ++i) {
186 ir_node *in = get_irn_n(node, i);
187 ins[i] = be_transform_node(in);
190 new_node = new_ir_node(dbgi, irg, block, op, mode, arity, ins);
193 copy_node_attr(irg, node, new_node);
194 be_duplicate_deps(node, new_node);
196 new_node->node_nr = node->node_nr;
200 ir_node *be_transform_node(ir_node *node)
202 ir_node *new_node = be_get_transformed_node(node);
203 if (new_node != NULL)
206 DEBUG_ONLY(be_set_transformed_node(node, NULL);)
208 ir_op *op = get_irn_op(node);
209 if (op->ops.generic == NULL) {
210 panic("No transform function registered for node %+F.", node);
212 be_transform_func *transform = (be_transform_func *)op->ops.generic;
214 new_node = transform(node);
215 assert(new_node != NULL);
217 be_set_transformed_node(node, new_node);
221 void be_enqueue_preds(ir_node *node)
223 /* put the preds in the worklist */
224 int arity = get_irn_arity(node);
225 for (int i = 0; i < arity; ++i) {
226 ir_node *pred = get_irn_n(node, i);
227 pdeq_putr(env.worklist, pred);
232 * Rewire nodes which are potential loops (like Phis) to avoid endless loops.
234 static void fix_loops(ir_node *node)
236 assert(node_is_in_irgs_storage(env.irg, node));
238 if (irn_visited_else_mark(node))
241 bool changed = false;
242 if (! is_Block(node)) {
243 ir_node *block = get_nodes_block(node);
244 ir_node *new_block = (ir_node*)get_irn_link(block);
246 if (new_block != NULL) {
247 set_nodes_block(node, new_block);
255 int arity = get_irn_arity(node);
256 for (int i = 0; i < arity; ++i) {
257 ir_node *in = get_irn_n(node, i);
258 ir_node *nw = (ir_node*)get_irn_link(in);
260 if (nw != NULL && nw != in) {
261 set_irn_n(node, i, nw);
270 set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
274 arity = get_irn_deps(node);
275 for (int i = 0; i < arity; ++i) {
276 ir_node *in = get_irn_dep(node, i);
277 ir_node *nw = (ir_node*)get_irn_link(in);
279 if (nw != NULL && nw != in) {
280 set_irn_dep(node, i, nw);
289 identify_remember(node);
293 ir_node *be_pre_transform_node(ir_node *place)
298 return be_transform_node(place);
301 static void pre_transform_anchor(ir_graph *irg, int anchor)
303 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
304 ir_node *transformed = be_transform_node(old_anchor_node);
305 set_irg_anchor(irg, anchor, transformed);
309 * Transforms all nodes. Deletes the old obstack and creates a new one.
311 static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform)
313 hook_dead_node_elim(irg, 1);
315 inc_irg_visited(irg);
318 env.worklist = new_waitq();
319 env.old_anchor = irg->anchor;
321 ir_node *old_end = get_irg_end(irg);
323 /* put all anchor nodes in the worklist */
324 for (int i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
325 ir_node *anchor = get_irg_anchor(irg, i);
329 waitq_put(env.worklist, anchor);
332 ir_node *new_anchor = new_r_Anchor(irg);
333 irg->anchor = new_anchor;
335 /* pre transform some anchors (so they are available in the other transform
337 pre_transform_anchor(irg, anchor_no_mem);
338 pre_transform_anchor(irg, anchor_end_block);
339 pre_transform_anchor(irg, anchor_end);
340 pre_transform_anchor(irg, anchor_start_block);
341 pre_transform_anchor(irg, anchor_start);
342 pre_transform_anchor(irg, anchor_frame);
347 /* process worklist (this should transform all nodes in the graph) */
348 while (! waitq_empty(env.worklist)) {
349 ir_node *node = (ir_node*)waitq_get(env.worklist);
350 be_transform_node(node);
353 /* fix loops and set new anchors*/
354 inc_irg_visited(irg);
355 for (int i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
356 ir_node *anchor = get_irn_n(env.old_anchor, i);
361 anchor = (ir_node*)get_irn_link(anchor);
363 set_irn_n(new_anchor, i, anchor);
366 del_waitq(env.worklist);
368 hook_dead_node_elim(irg, 0);
371 void be_transform_graph(ir_graph *irg, arch_pretrans_nodes *func)
373 ir_graph *old_current_ir_graph = current_ir_graph;
374 current_ir_graph = irg;
376 /* create a new obstack */
377 struct obstack *old_obst = irg->obst;
378 struct obstack *new_obst = XMALLOC(struct obstack);
379 obstack_init(new_obst);
380 irg->obst = new_obst;
381 irg->last_node_idx = 0;
385 /* create new value table for CSE */
388 /* do the main transformation */
389 transform_nodes(irg, func);
391 /* free the old obstack */
392 obstack_free(old_obst, 0);
396 current_ir_graph = old_current_ir_graph;
398 /* most analysis info is wrong after transformation */
399 be_invalidate_live_chk(irg);
400 confirm_irg_properties(irg, IR_GRAPH_PROPERTIES_NONE);
402 /* recalculate edges */