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(node))
180 mark_irn_visited(node);
183 if (! is_Block(node)) {
184 ir_node *block = get_nodes_block(node);
185 ir_node *new_block = get_irn_link(block);
187 if (new_block != NULL) {
188 set_nodes_block(node, new_block);
196 arity = get_irn_arity(node);
197 for (i = 0; i < arity; ++i) {
198 ir_node *in = get_irn_n(node, i);
199 ir_node *nw = get_irn_link(in);
201 if (nw != NULL && nw != in) {
202 set_irn_n(node, i, nw);
211 set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
215 arity = get_irn_deps(node);
216 for (i = 0; i < arity; ++i) {
217 ir_node *in = get_irn_dep(node, i);
218 ir_node *nw = get_irn_link(in);
220 if (nw != NULL && nw != in) {
221 set_irn_dep(node, i, nw);
230 identify_remember(current_ir_graph->value_table, node);
234 ir_node *be_pre_transform_node(ir_node *place) {
238 return be_transform_node(place);
241 ir_node *be_get_old_anchor(int anchor)
243 return get_irn_n(env.old_anchor, anchor);
246 static void pre_transform_anchor(int anchor)
248 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
249 ir_node *transformed = be_transform_node(old_anchor_node);
250 set_irg_anchor(current_ir_graph, anchor, transformed);
253 static void kill_unused_anchor(int anchor)
255 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
256 ir_node *old_bad = get_irn_n(env.old_anchor, anchor_bad);
257 if(old_anchor_node != NULL && get_irn_n_edges(old_anchor_node) <= 1) {
258 set_irn_n(env.old_anchor, anchor, old_bad);
263 * Transforms all nodes. Deletes the old obstack and creates a new one.
265 static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform,
269 ir_node *old_end, *new_anchor;
271 hook_dead_node_elim(irg, 1);
273 inc_irg_visited(irg);
276 env.visited = get_irg_visited(irg);
277 env.worklist = new_waitq();
278 env.old_anchor = irg->anchor;
280 old_end = get_irg_end(irg);
282 /* put all anchor nodes in the worklist */
283 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
284 ir_node *anchor = get_irg_anchor(irg, i);
288 waitq_put(env.worklist, anchor);
291 new_anchor = new_Anchor(irg);
292 irg->anchor = new_anchor;
294 /* pre transform some anchors (so they are available in the other transform
296 pre_transform_anchor(anchor_bad);
297 pre_transform_anchor(anchor_no_mem);
298 pre_transform_anchor(anchor_start_block);
299 pre_transform_anchor(anchor_start);
300 pre_transform_anchor(anchor_frame);
301 kill_unused_anchor(anchor_tls);
304 (*pre_transform)(cg);
306 /* process worklist (this should transform all nodes in the graph) */
307 while (! waitq_empty(env.worklist)) {
308 ir_node *node = waitq_get(env.worklist);
309 be_transform_node(node);
312 /* fix loops and set new anchors*/
313 inc_irg_visited(irg);
314 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
315 ir_node *anchor = get_irn_n(env.old_anchor, i);
320 anchor = get_irn_link(anchor);
322 set_irn_n(new_anchor, i, anchor);
324 set_irn_n(new_anchor, -1, get_irg_anchor(irg, anchor_end_block));
326 del_waitq(env.worklist);
328 hook_dead_node_elim(irg, 0);
332 * Transform helper for blocks.
334 static ir_node *gen_Block(ir_node *node) {
335 ir_graph *irg = current_ir_graph;
336 dbg_info *dbgi = get_irn_dbg_info(node);
337 ir_node *old_start_block = get_irn_n(env.old_anchor, anchor_start_block);
338 ir_node *macroblock = get_Block_MacroBlock(node);
342 * We replace the ProjX from the start node with a jump,
343 * so the startblock has no preds anymore now
345 if (node == old_start_block) {
346 return new_rd_Block(dbgi, irg, 0, NULL);
349 /* we use the old blocks for now, because jumps allow cycles in the graph
350 * we have to fix this later */
351 block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), get_irn_mode(node),
352 get_irn_arity(node), get_irn_in(node) + 1);
353 copy_node_attr(node, block);
355 block->node_nr = node->node_nr;
357 if (node == macroblock) {
358 /* this node is a macroblock header */
359 set_irn_n(block, -1, block);
361 macroblock = be_transform_node(macroblock);
362 set_irn_n(block, -1, macroblock);
365 be_set_transformed_node(node, block);
367 /* put the preds in the worklist */
368 be_enqueue_preds(node);
373 static ir_node *gen_End(ir_node *node) {
374 /* end has to be duplicated manually because we need a dynamic in array */
375 ir_graph *irg = current_ir_graph;
376 dbg_info *dbgi = get_irn_dbg_info(node);
377 ir_node *block = be_transform_node(get_nodes_block(node));
381 new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
382 copy_node_attr(node, new_end);
383 be_duplicate_deps(node, new_end);
385 set_irg_end(irg, new_end);
386 be_set_transformed_node(new_end, new_end);
388 /* transform preds */
389 arity = get_irn_arity(node);
390 for (i = 0; i < arity; ++i) {
391 ir_node *in = get_irn_n(node, i);
392 ir_node *new_in = be_transform_node(in);
394 add_End_keepalive(new_end, new_in);
400 void be_transform_graph(be_irg_t *birg, arch_pretrans_nodes *func, void *cg)
402 ir_graph *irg = birg->irg;
403 ir_graph *old_current_ir_graph = current_ir_graph;
404 struct obstack *old_obst = NULL;
405 struct obstack *new_obst = NULL;
407 current_ir_graph = irg;
409 /* create a new obstack */
410 old_obst = irg->obst;
411 new_obst = xmalloc(sizeof(*new_obst));
412 obstack_init(new_obst);
413 irg->obst = new_obst;
414 irg->last_node_idx = 0;
416 /* create new value table for CSE */
417 del_identities(irg->value_table);
418 irg->value_table = new_identities();
420 /* enter special helper */
421 op_Block->ops.generic = (op_func)gen_Block;
422 op_End->ops.generic = (op_func)gen_End;
424 /* do the main transformation */
425 transform_nodes(irg, func, cg);
427 /* we don't want the globals anchor anymore */
428 set_irg_globals(irg, new_r_Bad(irg));
430 /* free the old obstack */
431 obstack_free(old_obst, 0);
435 current_ir_graph = old_current_ir_graph;
437 /* most analysis info is wrong after transformation */
438 free_callee_info(irg);
441 free_loop_information(irg);
442 set_irg_doms_inconsistent(irg);
444 be_liveness_invalidate(be_get_birg_liveness(birg));
445 /* Hack for now, something is buggy with invalidate liveness... */
447 be_invalidate_dom_front(birg);
449 /* recalculate edges */
450 edges_deactivate(irg);
454 be_liveness_free(birg->lv);
455 birg->lv = be_liveness(birg);