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 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 DEBUG_ONLY(be_set_transformed_node(node, NULL));
137 op = get_irn_op(node);
138 if (op->ops.generic) {
139 be_transform_func *transform = (be_transform_func *)op->ops.generic;
141 new_node = transform(node);
142 assert(new_node != NULL);
144 new_node = be_duplicate_node(node);
147 be_set_transformed_node(node, new_node);
148 hook_dead_node_elim_subst(current_ir_graph, node, new_node);
153 * enqueue all inputs into the transform queue.
155 void be_enqueue_preds(ir_node *node) {
158 /* put the preds in the worklist */
159 arity = get_irn_arity(node);
160 for (i = 0; i < arity; ++i) {
161 ir_node *pred = get_irn_n(node, i);
162 pdeq_putr(env.worklist, pred);
167 * Rewire nodes which are potential loops (like Phis) to avoid endless loops.
169 static void fix_loops(ir_node *node) {
173 assert(node_is_in_irgs_storage(env.irg, node));
175 if (irn_visited_else_mark(node))
179 if (! is_Block(node)) {
180 ir_node *block = get_nodes_block(node);
181 ir_node *new_block = get_irn_link(block);
183 if (new_block != NULL) {
184 set_nodes_block(node, new_block);
192 arity = get_irn_arity(node);
193 for (i = 0; i < arity; ++i) {
194 ir_node *in = get_irn_n(node, i);
195 ir_node *nw = get_irn_link(in);
197 if (nw != NULL && nw != in) {
198 set_irn_n(node, i, nw);
207 set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
211 arity = get_irn_deps(node);
212 for (i = 0; i < arity; ++i) {
213 ir_node *in = get_irn_dep(node, i);
214 ir_node *nw = get_irn_link(in);
216 if (nw != NULL && nw != in) {
217 set_irn_dep(node, i, nw);
226 identify_remember(current_ir_graph->value_table, node);
230 ir_node *be_pre_transform_node(ir_node *place) {
234 return be_transform_node(place);
237 static void pre_transform_anchor(int anchor)
239 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
240 ir_node *transformed = be_transform_node(old_anchor_node);
241 set_irg_anchor(current_ir_graph, anchor, transformed);
244 static void kill_unused_anchor(int anchor)
246 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
247 ir_node *old_bad = get_irn_n(env.old_anchor, anchor_bad);
248 if(old_anchor_node != NULL && get_irn_n_edges(old_anchor_node) <= 1) {
249 set_irn_n(env.old_anchor, anchor, old_bad);
254 * Transforms all nodes. Deletes the old obstack and creates a new one.
256 static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform,
260 ir_node *old_end, *new_anchor;
262 hook_dead_node_elim(irg, 1);
264 inc_irg_visited(irg);
267 env.worklist = new_waitq();
268 env.old_anchor = irg->anchor;
270 old_end = get_irg_end(irg);
272 /* put all anchor nodes in the worklist */
273 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
274 ir_node *anchor = get_irg_anchor(irg, i);
278 waitq_put(env.worklist, anchor);
281 new_anchor = new_Anchor(irg);
282 irg->anchor = new_anchor;
284 /* pre transform some anchors (so they are available in the other transform
286 pre_transform_anchor(anchor_bad);
287 pre_transform_anchor(anchor_no_mem);
288 pre_transform_anchor(anchor_start_block);
289 pre_transform_anchor(anchor_start);
290 pre_transform_anchor(anchor_frame);
291 kill_unused_anchor(anchor_tls);
294 (*pre_transform)(cg);
296 /* process worklist (this should transform all nodes in the graph) */
297 while (! waitq_empty(env.worklist)) {
298 ir_node *node = waitq_get(env.worklist);
299 be_transform_node(node);
302 /* fix loops and set new anchors*/
303 inc_irg_visited(irg);
304 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
305 ir_node *anchor = get_irn_n(env.old_anchor, i);
310 anchor = get_irn_link(anchor);
312 set_irn_n(new_anchor, i, anchor);
314 set_nodes_block(new_anchor, get_irg_anchor(irg, anchor_end_block));
316 del_waitq(env.worklist);
318 hook_dead_node_elim(irg, 0);
322 * Transform helper for blocks.
324 static ir_node *gen_Block(ir_node *node) {
325 ir_graph *irg = current_ir_graph;
326 dbg_info *dbgi = get_irn_dbg_info(node);
327 ir_node *old_start_block = get_irn_n(env.old_anchor, anchor_start_block);
328 ir_node *macroblock = get_Block_MacroBlock(node);
332 * We replace the ProjX from the start node with a jump,
333 * so the startblock has no preds anymore now
335 if (node == old_start_block) {
336 return new_rd_Block(dbgi, irg, 0, NULL);
339 /* we use the old blocks for now, because jumps allow cycles in the graph
340 * we have to fix this later */
341 block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), get_irn_mode(node),
342 get_irn_arity(node), get_irn_in(node) + 1);
343 copy_node_attr(node, block);
345 block->node_nr = node->node_nr;
347 if (node == macroblock) {
348 /* this node is a macroblock header */
349 set_Block_MacroBlock(block, block);
351 macroblock = be_transform_node(macroblock);
352 set_Block_MacroBlock(block, macroblock);
355 /* put the preds in the worklist */
356 be_enqueue_preds(node);
361 static ir_node *gen_End(ir_node *node) {
362 /* end has to be duplicated manually because we need a dynamic in array */
363 ir_graph *irg = current_ir_graph;
364 dbg_info *dbgi = get_irn_dbg_info(node);
365 ir_node *block = be_transform_node(get_nodes_block(node));
369 new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
370 copy_node_attr(node, new_end);
371 be_duplicate_deps(node, new_end);
373 set_irg_end(irg, new_end);
375 /* transform preds */
376 arity = get_irn_arity(node);
377 for (i = 0; i < arity; ++i) {
378 ir_node *in = get_irn_n(node, i);
379 ir_node *new_in = be_transform_node(in);
381 add_End_keepalive(new_end, new_in);
387 void be_transform_graph(be_irg_t *birg, arch_pretrans_nodes *func, void *cg)
389 ir_graph *irg = birg->irg;
390 ir_graph *old_current_ir_graph = current_ir_graph;
391 struct obstack *old_obst = NULL;
392 struct obstack *new_obst = NULL;
394 current_ir_graph = irg;
396 /* create a new obstack */
397 old_obst = irg->obst;
398 new_obst = XMALLOC(struct obstack);
399 obstack_init(new_obst);
400 irg->obst = new_obst;
401 irg->last_node_idx = 0;
403 /* create new value table for CSE */
404 del_identities(irg->value_table);
405 irg->value_table = new_identities();
407 /* enter special helper */
408 op_Block->ops.generic = (op_func)gen_Block;
409 op_End->ops.generic = (op_func)gen_End;
411 /* do the main transformation */
412 transform_nodes(irg, func, cg);
414 /* free the old obstack */
415 obstack_free(old_obst, 0);
419 current_ir_graph = old_current_ir_graph;
421 /* most analysis info is wrong after transformation */
422 free_callee_info(irg);
425 free_loop_information(irg);
426 set_irg_doms_inconsistent(irg);
428 be_liveness_invalidate(be_get_birg_liveness(birg));
429 /* Hack for now, something is buggy with invalidate liveness... */
431 be_invalidate_dom_front(birg);
433 /* recalculate edges */
434 edges_deactivate(irg);
438 be_liveness_free(birg->lv);
439 birg->lv = be_liveness(birg);