2 * Copyright (C) 1995-2008 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
35 #include "irgraph_t.h"
45 #include "betranshlp.h"
47 typedef struct be_transform_env_t {
48 ir_graph *irg; /**< The irg, the node should be created in */
49 waitq *worklist; /**< worklist of nodes that still need to be
51 ir_node *old_anchor; /**< the old anchor node in the old irg */
55 static be_transform_env_t env;
57 void be_set_transformed_node(ir_node *old_node, ir_node *new_node)
59 set_irn_link(old_node, new_node);
60 mark_irn_visited(old_node);
63 int be_is_transformed(const ir_node *node) {
64 return irn_visited(node);
67 static INLINE ir_node *be_get_transformed_node(ir_node *old_node) {
68 if (irn_visited(old_node)) {
69 ir_node *new_node = get_irn_link(old_node);
70 assert(new_node != NULL);
76 void be_duplicate_deps(ir_node *old_node, ir_node *new_node) {
78 int deps = get_irn_deps(old_node);
80 for (i = 0; i < deps; ++i) {
81 ir_node *dep = get_irn_dep(old_node, i);
82 ir_node *new_dep = be_transform_node(dep);
84 add_irn_dep(new_node, new_dep);
88 void be_dep_on_frame(ir_node *const node)
90 ir_graph *const irg = current_ir_graph;
92 if (get_irg_start_block(irg) == get_nodes_block(node))
93 add_irn_dep(node, get_irg_frame(irg));
96 ir_node *be_duplicate_node(ir_node *node) {
97 ir_node *block = be_transform_node(get_nodes_block(node));
98 ir_graph *irg = env.irg;
99 dbg_info *dbgi = get_irn_dbg_info(node);
100 ir_mode *mode = get_irn_mode(node);
101 ir_op *op = get_irn_op(node);
105 arity = get_irn_arity(node);
106 if (op->opar == oparity_dynamic) {
107 new_node = new_ir_node(dbgi, irg, block, op, mode, -1, NULL);
108 for (i = 0; i < arity; ++i) {
109 ir_node *in = get_irn_n(node, i);
110 in = be_transform_node(in);
111 add_irn_n(new_node, in);
114 ir_node **ins = alloca(arity * sizeof(ins[0]));
115 for (i = 0; i < arity; ++i) {
116 ir_node *in = get_irn_n(node, i);
117 ins[i] = be_transform_node(in);
120 new_node = new_ir_node(dbgi, irg, block, op, mode, arity, ins);
123 copy_node_attr(node, new_node);
124 be_duplicate_deps(node, new_node);
127 new_node->node_nr = node->node_nr;
134 * Calls transformation function for given node and marks it visited.
136 ir_node *be_transform_node(ir_node *node) {
138 ir_node *new_node = be_get_transformed_node(node);
140 if (new_node != NULL)
143 DEBUG_ONLY(be_set_transformed_node(node, NULL));
145 op = get_irn_op(node);
146 if (op->ops.generic) {
147 be_transform_func *transform = (be_transform_func *)op->ops.generic;
149 new_node = transform(node);
150 assert(new_node != NULL);
152 new_node = be_duplicate_node(node);
155 be_set_transformed_node(node, new_node);
156 hook_dead_node_elim_subst(current_ir_graph, node, new_node);
161 * enqueue all inputs into the transform queue.
163 void be_enqueue_preds(ir_node *node) {
166 /* put the preds in the worklist */
167 arity = get_irn_arity(node);
168 for (i = 0; i < arity; ++i) {
169 ir_node *pred = get_irn_n(node, i);
170 pdeq_putr(env.worklist, pred);
175 * Rewire nodes which are potential loops (like Phis) to avoid endless loops.
177 static void fix_loops(ir_node *node) {
181 assert(node_is_in_irgs_storage(env.irg, node));
183 if (irn_visited_else_mark(node))
187 if (! is_Block(node)) {
188 ir_node *block = get_nodes_block(node);
189 ir_node *new_block = get_irn_link(block);
191 if (new_block != NULL) {
192 set_nodes_block(node, new_block);
200 arity = get_irn_arity(node);
201 for (i = 0; i < arity; ++i) {
202 ir_node *in = get_irn_n(node, i);
203 ir_node *nw = get_irn_link(in);
205 if (nw != NULL && nw != in) {
206 set_irn_n(node, i, nw);
215 set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
219 arity = get_irn_deps(node);
220 for (i = 0; i < arity; ++i) {
221 ir_node *in = get_irn_dep(node, i);
222 ir_node *nw = get_irn_link(in);
224 if (nw != NULL && nw != in) {
225 set_irn_dep(node, i, nw);
234 identify_remember(current_ir_graph->value_table, node);
238 ir_node *be_pre_transform_node(ir_node *place) {
242 return be_transform_node(place);
245 static void pre_transform_anchor(int anchor)
247 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
248 ir_node *transformed = be_transform_node(old_anchor_node);
249 set_irg_anchor(current_ir_graph, anchor, transformed);
252 static void kill_unused_anchor(int anchor)
254 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
255 ir_node *old_bad = get_irn_n(env.old_anchor, anchor_bad);
256 if(old_anchor_node != NULL && get_irn_n_edges(old_anchor_node) <= 1) {
257 set_irn_n(env.old_anchor, anchor, old_bad);
262 * Transforms all nodes. Deletes the old obstack and creates a new one.
264 static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform)
267 ir_node *old_end, *new_anchor;
269 hook_dead_node_elim(irg, 1);
271 inc_irg_visited(irg);
274 env.worklist = new_waitq();
275 env.old_anchor = irg->anchor;
277 old_end = get_irg_end(irg);
279 /* put all anchor nodes in the worklist */
280 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
281 ir_node *anchor = get_irg_anchor(irg, i);
285 waitq_put(env.worklist, anchor);
288 new_anchor = new_Anchor(irg);
289 irg->anchor = new_anchor;
291 /* pre transform some anchors (so they are available in the other transform
293 pre_transform_anchor(anchor_bad);
294 pre_transform_anchor(anchor_no_mem);
295 pre_transform_anchor(anchor_start_block);
296 pre_transform_anchor(anchor_start);
297 pre_transform_anchor(anchor_frame);
298 kill_unused_anchor(anchor_tls);
303 /* process worklist (this should transform all nodes in the graph) */
304 while (! waitq_empty(env.worklist)) {
305 ir_node *node = waitq_get(env.worklist);
306 be_transform_node(node);
309 /* fix loops and set new anchors*/
310 inc_irg_visited(irg);
311 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
312 ir_node *anchor = get_irn_n(env.old_anchor, i);
317 anchor = get_irn_link(anchor);
319 set_irn_n(new_anchor, i, anchor);
321 set_nodes_block(new_anchor, get_irg_anchor(irg, anchor_end_block));
323 del_waitq(env.worklist);
325 hook_dead_node_elim(irg, 0);
329 * Transform helper for blocks.
331 static ir_node *gen_Block(ir_node *node) {
332 ir_graph *irg = current_ir_graph;
333 dbg_info *dbgi = get_irn_dbg_info(node);
334 ir_node *old_start_block = get_irn_n(env.old_anchor, anchor_start_block);
335 ir_node *macroblock = get_Block_MacroBlock(node);
339 * We replace the ProjX from the start node with a jump,
340 * so the startblock has no preds anymore now
342 if (node == old_start_block) {
343 return new_rd_Block(dbgi, irg, 0, NULL);
346 /* we use the old blocks for now, because jumps allow cycles in the graph
347 * we have to fix this later */
348 block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), get_irn_mode(node),
349 get_irn_arity(node), get_irn_in(node) + 1);
350 copy_node_attr(node, block);
352 block->node_nr = node->node_nr;
354 if (node == macroblock) {
355 /* this node is a macroblock header */
356 set_Block_MacroBlock(block, block);
358 macroblock = be_transform_node(macroblock);
359 set_Block_MacroBlock(block, macroblock);
362 /* put the preds in the worklist */
363 be_enqueue_preds(node);
368 static ir_node *gen_End(ir_node *node) {
369 /* end has to be duplicated manually because we need a dynamic in array */
370 ir_graph *irg = current_ir_graph;
371 dbg_info *dbgi = get_irn_dbg_info(node);
372 ir_node *block = be_transform_node(get_nodes_block(node));
376 new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
377 copy_node_attr(node, new_end);
378 be_duplicate_deps(node, new_end);
380 set_irg_end(irg, new_end);
382 /* transform preds */
383 arity = get_irn_arity(node);
384 for (i = 0; i < arity; ++i) {
385 ir_node *in = get_irn_n(node, i);
386 ir_node *new_in = be_transform_node(in);
388 add_End_keepalive(new_end, new_in);
394 void be_transform_graph(be_irg_t *birg, arch_pretrans_nodes *func)
396 ir_graph *irg = birg->irg;
397 ir_graph *old_current_ir_graph = current_ir_graph;
398 struct obstack *old_obst = NULL;
399 struct obstack *new_obst = NULL;
401 current_ir_graph = irg;
403 /* create a new obstack */
404 old_obst = irg->obst;
405 new_obst = XMALLOC(struct obstack);
406 obstack_init(new_obst);
407 irg->obst = new_obst;
408 irg->last_node_idx = 0;
410 /* create new value table for CSE */
411 del_identities(irg->value_table);
412 irg->value_table = new_identities();
414 /* enter special helper */
415 op_Block->ops.generic = (op_func)gen_Block;
416 op_End->ops.generic = (op_func)gen_End;
418 /* do the main transformation */
419 transform_nodes(irg, func);
421 /* free the old obstack */
422 obstack_free(old_obst, 0);
426 current_ir_graph = old_current_ir_graph;
428 /* most analysis info is wrong after transformation */
429 free_callee_info(irg);
432 free_loop_information(irg);
433 set_irg_doms_inconsistent(irg);
435 be_liveness_invalidate(be_get_birg_liveness(birg));
436 /* Hack for now, something is buggy with invalidate liveness... */
438 be_invalidate_dom_front(birg);
440 /* recalculate edges */
441 edges_deactivate(irg);
445 be_liveness_free(birg->lv);
446 birg->lv = be_liveness(birg);