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
33 #include "irgraph_t.h"
43 #include "betranshlp.h"
45 typedef struct be_transform_env_t {
46 ir_graph *irg; /**< The irg, the node should be created in */
47 waitq *worklist; /**< worklist of nodes that still need to be
49 ir_node *old_anchor; /**< the old anchor node in the old irg */
53 static be_transform_env_t env;
55 void be_set_transformed_node(ir_node *old_node, ir_node *new_node)
57 set_irn_link(old_node, new_node);
58 mark_irn_visited(old_node);
61 int be_is_transformed(const ir_node *node) {
62 return irn_visited(node);
65 static inline ir_node *be_get_transformed_node(ir_node *old_node) {
66 if (irn_visited(old_node)) {
67 ir_node *new_node = get_irn_link(old_node);
68 assert(new_node != NULL);
74 void be_duplicate_deps(ir_node *old_node, ir_node *new_node) {
76 int deps = get_irn_deps(old_node);
78 for (i = 0; i < deps; ++i) {
79 ir_node *dep = get_irn_dep(old_node, i);
80 ir_node *new_dep = be_transform_node(dep);
82 add_irn_dep(new_node, new_dep);
86 void be_dep_on_frame(ir_node* node)
88 ir_graph *const irg = current_ir_graph;
90 if (get_irg_start_block(irg) == get_nodes_block(node))
91 add_irn_dep(node, get_irg_frame(irg));
94 ir_node *be_duplicate_node(ir_node *node) {
95 ir_node *block = be_transform_node(get_nodes_block(node));
96 ir_graph *irg = env.irg;
97 dbg_info *dbgi = get_irn_dbg_info(node);
98 ir_mode *mode = get_irn_mode(node);
99 ir_op *op = get_irn_op(node);
103 arity = get_irn_arity(node);
104 if (op->opar == oparity_dynamic) {
105 new_node = new_ir_node(dbgi, irg, block, op, mode, -1, NULL);
106 for (i = 0; i < arity; ++i) {
107 ir_node *in = get_irn_n(node, i);
108 in = be_transform_node(in);
109 add_irn_n(new_node, in);
112 ir_node **ins = ALLOCAN(ir_node*, arity);
113 for (i = 0; i < arity; ++i) {
114 ir_node *in = get_irn_n(node, i);
115 ins[i] = be_transform_node(in);
118 new_node = new_ir_node(dbgi, irg, block, op, mode, arity, ins);
121 copy_node_attr(node, new_node);
122 be_duplicate_deps(node, new_node);
124 new_node->node_nr = node->node_nr;
129 * Calls transformation function for given node and marks it visited.
131 ir_node *be_transform_node(ir_node *node) {
133 ir_node *new_node = be_get_transformed_node(node);
135 if (new_node != NULL)
138 DEBUG_ONLY(be_set_transformed_node(node, NULL));
140 op = get_irn_op(node);
141 if (op->ops.generic) {
142 be_transform_func *transform = (be_transform_func *)op->ops.generic;
144 new_node = transform(node);
145 assert(new_node != NULL);
147 new_node = be_duplicate_node(node);
150 be_set_transformed_node(node, new_node);
151 hook_dead_node_elim_subst(current_ir_graph, node, new_node);
156 * enqueue all inputs into the transform queue.
158 void be_enqueue_preds(ir_node *node) {
161 /* put the preds in the worklist */
162 arity = get_irn_arity(node);
163 for (i = 0; i < arity; ++i) {
164 ir_node *pred = get_irn_n(node, i);
165 pdeq_putr(env.worklist, pred);
170 * Rewire nodes which are potential loops (like Phis) to avoid endless loops.
172 static void fix_loops(ir_node *node) {
176 assert(node_is_in_irgs_storage(env.irg, node));
178 if (irn_visited_else_mark(node))
182 if (! is_Block(node)) {
183 ir_node *block = get_nodes_block(node);
184 ir_node *new_block = get_irn_link(block);
186 if (new_block != NULL) {
187 set_nodes_block(node, new_block);
195 arity = get_irn_arity(node);
196 for (i = 0; i < arity; ++i) {
197 ir_node *in = get_irn_n(node, i);
198 ir_node *nw = get_irn_link(in);
200 if (nw != NULL && nw != in) {
201 set_irn_n(node, i, nw);
210 set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
214 arity = get_irn_deps(node);
215 for (i = 0; i < arity; ++i) {
216 ir_node *in = get_irn_dep(node, i);
217 ir_node *nw = get_irn_link(in);
219 if (nw != NULL && nw != in) {
220 set_irn_dep(node, i, nw);
229 identify_remember(current_ir_graph->value_table, node);
233 ir_node *be_pre_transform_node(ir_node *place) {
237 return be_transform_node(place);
240 static void pre_transform_anchor(int anchor)
242 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
243 ir_node *transformed = be_transform_node(old_anchor_node);
244 set_irg_anchor(current_ir_graph, anchor, transformed);
247 static void kill_unused_anchor(int anchor)
249 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
250 ir_node *old_bad = get_irn_n(env.old_anchor, anchor_bad);
251 if(old_anchor_node != NULL && get_irn_n_edges(old_anchor_node) <= 1) {
252 set_irn_n(env.old_anchor, anchor, old_bad);
257 * Transforms all nodes. Deletes the old obstack and creates a new one.
259 static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform)
262 ir_node *old_end, *new_anchor;
264 hook_dead_node_elim(irg, 1);
266 inc_irg_visited(irg);
269 env.worklist = new_waitq();
270 env.old_anchor = irg->anchor;
272 old_end = get_irg_end(irg);
274 /* put all anchor nodes in the worklist */
275 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
276 ir_node *anchor = get_irg_anchor(irg, i);
280 waitq_put(env.worklist, anchor);
283 new_anchor = new_Anchor(irg);
284 irg->anchor = new_anchor;
286 /* pre transform some anchors (so they are available in the other transform
288 pre_transform_anchor(anchor_bad);
289 pre_transform_anchor(anchor_no_mem);
290 pre_transform_anchor(anchor_start_block);
291 pre_transform_anchor(anchor_start);
292 pre_transform_anchor(anchor_frame);
293 kill_unused_anchor(anchor_tls);
298 /* process worklist (this should transform all nodes in the graph) */
299 while (! waitq_empty(env.worklist)) {
300 ir_node *node = waitq_get(env.worklist);
301 be_transform_node(node);
304 /* fix loops and set new anchors*/
305 inc_irg_visited(irg);
306 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
307 ir_node *anchor = get_irn_n(env.old_anchor, i);
312 anchor = get_irn_link(anchor);
314 set_irn_n(new_anchor, i, anchor);
316 set_nodes_block(new_anchor, get_irg_anchor(irg, anchor_end_block));
318 del_waitq(env.worklist);
320 hook_dead_node_elim(irg, 0);
324 * Transform helper for blocks.
326 static ir_node *gen_Block(ir_node *node) {
327 ir_graph *irg = current_ir_graph;
328 dbg_info *dbgi = get_irn_dbg_info(node);
329 ir_node *old_start_block = get_irn_n(env.old_anchor, anchor_start_block);
330 ir_node *macroblock = get_Block_MacroBlock(node);
334 * We replace the ProjX from the start node with a jump,
335 * so the startblock has no preds anymore now
337 if (node == old_start_block) {
338 return new_rd_Block(dbgi, irg, 0, NULL);
341 /* we use the old blocks for now, because jumps allow cycles in the graph
342 * we have to fix this later */
343 block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), get_irn_mode(node),
344 get_irn_arity(node), get_irn_in(node) + 1);
345 copy_node_attr(node, block);
346 block->node_nr = node->node_nr;
348 if (node == macroblock) {
349 /* this node is a macroblock header */
350 set_Block_MacroBlock(block, block);
352 macroblock = be_transform_node(macroblock);
353 set_Block_MacroBlock(block, macroblock);
356 /* put the preds in the worklist */
357 be_enqueue_preds(node);
362 static ir_node *gen_End(ir_node *node) {
363 /* end has to be duplicated manually because we need a dynamic in array */
364 ir_graph *irg = current_ir_graph;
365 dbg_info *dbgi = get_irn_dbg_info(node);
366 ir_node *block = be_transform_node(get_nodes_block(node));
370 new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
371 copy_node_attr(node, new_end);
372 be_duplicate_deps(node, new_end);
374 set_irg_end(irg, new_end);
376 /* transform preds */
377 arity = get_irn_arity(node);
378 for (i = 0; i < arity; ++i) {
379 ir_node *in = get_irn_n(node, i);
380 ir_node *new_in = be_transform_node(in);
382 add_End_keepalive(new_end, new_in);
388 void be_transform_graph(be_irg_t *birg, arch_pretrans_nodes *func)
390 ir_graph *irg = birg->irg;
391 ir_graph *old_current_ir_graph = current_ir_graph;
392 struct obstack *old_obst = NULL;
393 struct obstack *new_obst = NULL;
395 current_ir_graph = irg;
397 /* create a new obstack */
398 old_obst = irg->obst;
399 new_obst = XMALLOC(struct obstack);
400 obstack_init(new_obst);
401 irg->obst = new_obst;
402 irg->last_node_idx = 0;
404 /* create new value table for CSE */
405 del_identities(irg->value_table);
406 irg->value_table = new_identities();
408 /* enter special helper */
409 op_Block->ops.generic = (op_func)gen_Block;
410 op_End->ops.generic = (op_func)gen_End;
412 /* do the main transformation */
413 transform_nodes(irg, func);
415 /* free the old obstack */
416 obstack_free(old_obst, 0);
420 current_ir_graph = old_current_ir_graph;
422 /* most analysis info is wrong after transformation */
423 free_callee_info(irg);
426 free_loop_information(irg);
427 set_irg_doms_inconsistent(irg);
429 be_liveness_invalidate(be_get_birg_liveness(birg));
430 /* Hack for now, something is buggy with invalidate liveness... */
432 be_invalidate_dom_front(birg);
434 /* recalculate edges */
435 edges_deactivate(irg);
439 be_liveness_free(birg->lv);
440 birg->lv = be_liveness(irg);