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 int visited; /**< visited count that indicates whether a
50 node is already transformed */
51 waitq *worklist; /**< worklist of nodes that still need to be
53 ir_node *old_anchor; /**< the old anchor node in the old irg */
57 static be_transform_env_t env;
59 void be_set_transformed_node(ir_node *old_node, ir_node *new_node) {
60 set_irn_link(old_node, new_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 ir_node *be_duplicate_node(ir_node *node) {
89 ir_node *block = be_transform_node(get_nodes_block(node));
90 ir_graph *irg = env.irg;
91 dbg_info *dbgi = get_irn_dbg_info(node);
92 ir_mode *mode = get_irn_mode(node);
93 ir_op *op = get_irn_op(node);
97 arity = get_irn_arity(node);
98 if (op->opar == oparity_dynamic) {
99 new_node = new_ir_node(dbgi, irg, block, op, mode, -1, NULL);
100 for (i = 0; i < arity; ++i) {
101 ir_node *in = get_irn_n(node, i);
102 in = be_transform_node(in);
103 add_irn_n(new_node, in);
106 ir_node **ins = alloca(arity * sizeof(ins[0]));
107 for (i = 0; i < arity; ++i) {
108 ir_node *in = get_irn_n(node, i);
109 ins[i] = be_transform_node(in);
112 new_node = new_ir_node(dbgi, irg, block, op, mode, arity, ins);
115 copy_node_attr(node, new_node);
116 be_duplicate_deps(node, new_node);
119 new_node->node_nr = node->node_nr;
126 * Calls transformation function for given node and marks it visited.
128 ir_node *be_transform_node(ir_node *node) {
130 ir_node *new_node = be_get_transformed_node(node);
132 if (new_node != NULL)
135 mark_irn_visited(node);
136 DEBUG_ONLY(be_set_transformed_node(node, NULL));
138 op = get_irn_op(node);
139 if (op->ops.generic) {
140 be_transform_func *transform = (be_transform_func *)op->ops.generic;
142 new_node = transform(node);
143 assert(new_node != NULL);
145 new_node = be_duplicate_node(node);
148 be_set_transformed_node(node, new_node);
149 mark_irn_visited(new_node);
150 hook_dead_node_elim_subst(current_ir_graph, node, new_node);
155 * enqueue all inputs into the transform queue.
157 void be_enqueue_preds(ir_node *node) {
160 /* put the preds in the worklist */
161 arity = get_irn_arity(node);
162 for (i = 0; i < arity; ++i) {
163 ir_node *pred = get_irn_n(node, i);
164 pdeq_putr(env.worklist, pred);
169 * Rewire nodes which are potential loops (like Phis) to avoid endless loops.
171 static void fix_loops(ir_node *node) {
175 assert(node_is_in_irgs_storage(env.irg, node));
177 if (irn_visited_else_mark(node))
181 if (! is_Block(node)) {
182 ir_node *block = get_nodes_block(node);
183 ir_node *new_block = get_irn_link(block);
185 if (new_block != NULL) {
186 set_nodes_block(node, new_block);
194 arity = get_irn_arity(node);
195 for (i = 0; i < arity; ++i) {
196 ir_node *in = get_irn_n(node, i);
197 ir_node *nw = get_irn_link(in);
199 if (nw != NULL && nw != in) {
200 set_irn_n(node, i, nw);
209 set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
213 arity = get_irn_deps(node);
214 for (i = 0; i < arity; ++i) {
215 ir_node *in = get_irn_dep(node, i);
216 ir_node *nw = get_irn_link(in);
218 if (nw != NULL && nw != in) {
219 set_irn_dep(node, i, nw);
228 identify_remember(current_ir_graph->value_table, node);
232 ir_node *be_pre_transform_node(ir_node *place) {
236 return be_transform_node(place);
239 ir_node *be_get_old_anchor(int anchor)
241 return get_irn_n(env.old_anchor, anchor);
244 static void pre_transform_anchor(int anchor)
246 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
247 ir_node *transformed = be_transform_node(old_anchor_node);
248 set_irg_anchor(current_ir_graph, anchor, transformed);
251 static void kill_unused_anchor(int anchor)
253 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
254 ir_node *old_bad = get_irn_n(env.old_anchor, anchor_bad);
255 if(old_anchor_node != NULL && get_irn_n_edges(old_anchor_node) <= 1) {
256 set_irn_n(env.old_anchor, anchor, old_bad);
261 * Transforms all nodes. Deletes the old obstack and creates a new one.
263 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.visited = get_irg_visited(irg);
275 env.worklist = new_waitq();
276 env.old_anchor = irg->anchor;
278 old_end = get_irg_end(irg);
280 /* put all anchor nodes in the worklist */
281 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
282 ir_node *anchor = get_irg_anchor(irg, i);
286 waitq_put(env.worklist, anchor);
289 new_anchor = new_Anchor(irg);
290 irg->anchor = new_anchor;
292 /* pre transform some anchors (so they are available in the other transform
294 pre_transform_anchor(anchor_bad);
295 pre_transform_anchor(anchor_no_mem);
296 pre_transform_anchor(anchor_start_block);
297 pre_transform_anchor(anchor_start);
298 pre_transform_anchor(anchor_frame);
299 kill_unused_anchor(anchor_tls);
302 (*pre_transform)(cg);
304 /* process worklist (this should transform all nodes in the graph) */
305 while (! waitq_empty(env.worklist)) {
306 ir_node *node = waitq_get(env.worklist);
307 be_transform_node(node);
310 /* fix loops and set new anchors*/
311 inc_irg_visited(irg);
312 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
313 ir_node *anchor = get_irn_n(env.old_anchor, i);
318 anchor = get_irn_link(anchor);
320 set_irn_n(new_anchor, i, anchor);
322 set_nodes_block(new_anchor, get_irg_anchor(irg, anchor_end_block));
324 del_waitq(env.worklist);
326 hook_dead_node_elim(irg, 0);
330 * Transform helper for blocks.
332 static ir_node *gen_Block(ir_node *node) {
333 ir_graph *irg = current_ir_graph;
334 dbg_info *dbgi = get_irn_dbg_info(node);
335 ir_node *old_start_block = get_irn_n(env.old_anchor, anchor_start_block);
336 ir_node *macroblock = get_Block_MacroBlock(node);
340 * We replace the ProjX from the start node with a jump,
341 * so the startblock has no preds anymore now
343 if (node == old_start_block) {
344 return new_rd_Block(dbgi, irg, 0, NULL);
347 /* we use the old blocks for now, because jumps allow cycles in the graph
348 * we have to fix this later */
349 block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), get_irn_mode(node),
350 get_irn_arity(node), get_irn_in(node) + 1);
351 copy_node_attr(node, block);
353 block->node_nr = node->node_nr;
355 if (node == macroblock) {
356 /* this node is a macroblock header */
357 set_Block_MacroBlock(block, block);
359 macroblock = be_transform_node(macroblock);
360 set_Block_MacroBlock(block, macroblock);
363 be_set_transformed_node(node, block);
365 /* put the preds in the worklist */
366 be_enqueue_preds(node);
371 static ir_node *gen_End(ir_node *node) {
372 /* end has to be duplicated manually because we need a dynamic in array */
373 ir_graph *irg = current_ir_graph;
374 dbg_info *dbgi = get_irn_dbg_info(node);
375 ir_node *block = be_transform_node(get_nodes_block(node));
379 new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
380 copy_node_attr(node, new_end);
381 be_duplicate_deps(node, new_end);
383 set_irg_end(irg, new_end);
384 be_set_transformed_node(new_end, new_end);
386 /* transform preds */
387 arity = get_irn_arity(node);
388 for (i = 0; i < arity; ++i) {
389 ir_node *in = get_irn_n(node, i);
390 ir_node *new_in = be_transform_node(in);
392 add_End_keepalive(new_end, new_in);
398 void be_transform_graph(be_irg_t *birg, arch_pretrans_nodes *func, void *cg)
400 ir_graph *irg = birg->irg;
401 ir_graph *old_current_ir_graph = current_ir_graph;
402 struct obstack *old_obst = NULL;
403 struct obstack *new_obst = NULL;
405 current_ir_graph = irg;
407 /* create a new obstack */
408 old_obst = irg->obst;
409 new_obst = XMALLOC(struct obstack);
410 obstack_init(new_obst);
411 irg->obst = new_obst;
412 irg->last_node_idx = 0;
414 /* create new value table for CSE */
415 del_identities(irg->value_table);
416 irg->value_table = new_identities();
418 /* enter special helper */
419 op_Block->ops.generic = (op_func)gen_Block;
420 op_End->ops.generic = (op_func)gen_End;
422 /* do the main transformation */
423 transform_nodes(irg, func, cg);
425 /* free the old obstack */
426 obstack_free(old_obst, 0);
430 current_ir_graph = old_current_ir_graph;
432 /* most analysis info is wrong after transformation */
433 free_callee_info(irg);
436 free_loop_information(irg);
437 set_irg_doms_inconsistent(irg);
439 be_liveness_invalidate(be_get_birg_liveness(birg));
440 /* Hack for now, something is buggy with invalidate liveness... */
442 be_invalidate_dom_front(birg);
444 /* recalculate edges */
445 edges_deactivate(irg);
449 be_liveness_free(birg->lv);
450 birg->lv = be_liveness(birg);