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);
125 new_node->node_nr = node->node_nr;
132 * Calls transformation function for given node and marks it visited.
134 ir_node *be_transform_node(ir_node *node) {
136 ir_node *new_node = be_get_transformed_node(node);
138 if (new_node != NULL)
141 DEBUG_ONLY(be_set_transformed_node(node, NULL));
143 op = get_irn_op(node);
144 if (op->ops.generic) {
145 be_transform_func *transform = (be_transform_func *)op->ops.generic;
147 new_node = transform(node);
148 assert(new_node != NULL);
150 new_node = be_duplicate_node(node);
153 be_set_transformed_node(node, new_node);
154 hook_dead_node_elim_subst(current_ir_graph, node, new_node);
159 * enqueue all inputs into the transform queue.
161 void be_enqueue_preds(ir_node *node) {
164 /* put the preds in the worklist */
165 arity = get_irn_arity(node);
166 for (i = 0; i < arity; ++i) {
167 ir_node *pred = get_irn_n(node, i);
168 pdeq_putr(env.worklist, pred);
173 * Rewire nodes which are potential loops (like Phis) to avoid endless loops.
175 static void fix_loops(ir_node *node) {
179 assert(node_is_in_irgs_storage(env.irg, node));
181 if (irn_visited_else_mark(node))
185 if (! is_Block(node)) {
186 ir_node *block = get_nodes_block(node);
187 ir_node *new_block = get_irn_link(block);
189 if (new_block != NULL) {
190 set_nodes_block(node, new_block);
198 arity = get_irn_arity(node);
199 for (i = 0; i < arity; ++i) {
200 ir_node *in = get_irn_n(node, i);
201 ir_node *nw = get_irn_link(in);
203 if (nw != NULL && nw != in) {
204 set_irn_n(node, i, nw);
213 set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
217 arity = get_irn_deps(node);
218 for (i = 0; i < arity; ++i) {
219 ir_node *in = get_irn_dep(node, i);
220 ir_node *nw = get_irn_link(in);
222 if (nw != NULL && nw != in) {
223 set_irn_dep(node, i, nw);
232 identify_remember(current_ir_graph->value_table, node);
236 ir_node *be_pre_transform_node(ir_node *place) {
240 return be_transform_node(place);
243 static void pre_transform_anchor(int anchor)
245 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
246 ir_node *transformed = be_transform_node(old_anchor_node);
247 set_irg_anchor(current_ir_graph, anchor, transformed);
250 static void kill_unused_anchor(int anchor)
252 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
253 ir_node *old_bad = get_irn_n(env.old_anchor, anchor_bad);
254 if(old_anchor_node != NULL && get_irn_n_edges(old_anchor_node) <= 1) {
255 set_irn_n(env.old_anchor, anchor, old_bad);
260 * Transforms all nodes. Deletes the old obstack and creates a new one.
262 static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform)
265 ir_node *old_end, *new_anchor;
267 hook_dead_node_elim(irg, 1);
269 inc_irg_visited(irg);
272 env.worklist = new_waitq();
273 env.old_anchor = irg->anchor;
275 old_end = get_irg_end(irg);
277 /* put all anchor nodes in the worklist */
278 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
279 ir_node *anchor = get_irg_anchor(irg, i);
283 waitq_put(env.worklist, anchor);
286 new_anchor = new_Anchor(irg);
287 irg->anchor = new_anchor;
289 /* pre transform some anchors (so they are available in the other transform
291 pre_transform_anchor(anchor_bad);
292 pre_transform_anchor(anchor_no_mem);
293 pre_transform_anchor(anchor_start_block);
294 pre_transform_anchor(anchor_start);
295 pre_transform_anchor(anchor_frame);
296 kill_unused_anchor(anchor_tls);
301 /* process worklist (this should transform all nodes in the graph) */
302 while (! waitq_empty(env.worklist)) {
303 ir_node *node = waitq_get(env.worklist);
304 be_transform_node(node);
307 /* fix loops and set new anchors*/
308 inc_irg_visited(irg);
309 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
310 ir_node *anchor = get_irn_n(env.old_anchor, i);
315 anchor = get_irn_link(anchor);
317 set_irn_n(new_anchor, i, anchor);
319 set_nodes_block(new_anchor, get_irg_anchor(irg, anchor_end_block));
321 del_waitq(env.worklist);
323 hook_dead_node_elim(irg, 0);
327 * Transform helper for blocks.
329 static ir_node *gen_Block(ir_node *node) {
330 ir_graph *irg = current_ir_graph;
331 dbg_info *dbgi = get_irn_dbg_info(node);
332 ir_node *old_start_block = get_irn_n(env.old_anchor, anchor_start_block);
333 ir_node *macroblock = get_Block_MacroBlock(node);
337 * We replace the ProjX from the start node with a jump,
338 * so the startblock has no preds anymore now
340 if (node == old_start_block) {
341 return new_rd_Block(dbgi, irg, 0, NULL);
344 /* we use the old blocks for now, because jumps allow cycles in the graph
345 * we have to fix this later */
346 block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), get_irn_mode(node),
347 get_irn_arity(node), get_irn_in(node) + 1);
348 copy_node_attr(node, block);
350 block->node_nr = node->node_nr;
352 if (node == macroblock) {
353 /* this node is a macroblock header */
354 set_Block_MacroBlock(block, block);
356 macroblock = be_transform_node(macroblock);
357 set_Block_MacroBlock(block, macroblock);
360 /* put the preds in the worklist */
361 be_enqueue_preds(node);
366 static ir_node *gen_End(ir_node *node) {
367 /* end has to be duplicated manually because we need a dynamic in array */
368 ir_graph *irg = current_ir_graph;
369 dbg_info *dbgi = get_irn_dbg_info(node);
370 ir_node *block = be_transform_node(get_nodes_block(node));
374 new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
375 copy_node_attr(node, new_end);
376 be_duplicate_deps(node, new_end);
378 set_irg_end(irg, new_end);
380 /* transform preds */
381 arity = get_irn_arity(node);
382 for (i = 0; i < arity; ++i) {
383 ir_node *in = get_irn_n(node, i);
384 ir_node *new_in = be_transform_node(in);
386 add_End_keepalive(new_end, new_in);
392 void be_transform_graph(be_irg_t *birg, arch_pretrans_nodes *func)
394 ir_graph *irg = birg->irg;
395 ir_graph *old_current_ir_graph = current_ir_graph;
396 struct obstack *old_obst = NULL;
397 struct obstack *new_obst = NULL;
399 current_ir_graph = irg;
401 /* create a new obstack */
402 old_obst = irg->obst;
403 new_obst = XMALLOC(struct obstack);
404 obstack_init(new_obst);
405 irg->obst = new_obst;
406 irg->last_node_idx = 0;
408 /* create new value table for CSE */
409 del_identities(irg->value_table);
410 irg->value_table = new_identities();
412 /* enter special helper */
413 op_Block->ops.generic = (op_func)gen_Block;
414 op_End->ops.generic = (op_func)gen_End;
416 /* do the main transformation */
417 transform_nodes(irg, func);
419 /* free the old obstack */
420 obstack_free(old_obst, 0);
424 current_ir_graph = old_current_ir_graph;
426 /* most analysis info is wrong after transformation */
427 free_callee_info(irg);
430 free_loop_information(irg);
431 set_irg_doms_inconsistent(irg);
433 be_liveness_invalidate(be_get_birg_liveness(birg));
434 /* Hack for now, something is buggy with invalidate liveness... */
436 be_invalidate_dom_front(birg);
438 /* recalculate edges */
439 edges_deactivate(irg);
443 be_liveness_free(birg->lv);
444 birg->lv = be_liveness(irg);