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"
46 typedef struct be_transform_env_t {
47 ir_graph *irg; /**< The irg, the node should be created in */
48 waitq *worklist; /**< worklist of nodes that still need to be
50 ir_node *old_anchor; /**< the old anchor node in the old irg */
54 static be_transform_env_t env;
56 void be_set_transformed_node(ir_node *old_node, ir_node *new_node)
58 set_irn_link(old_node, new_node);
59 mark_irn_visited(old_node);
62 int be_is_transformed(const ir_node *node) {
63 return irn_visited(node);
66 static inline ir_node *be_get_transformed_node(ir_node *old_node) {
67 if (irn_visited(old_node)) {
68 ir_node *new_node = get_irn_link(old_node);
69 assert(new_node != NULL);
75 void be_duplicate_deps(ir_node *old_node, ir_node *new_node) {
77 int deps = get_irn_deps(old_node);
79 for (i = 0; i < deps; ++i) {
80 ir_node *dep = get_irn_dep(old_node, i);
81 ir_node *new_dep = be_transform_node(dep);
83 add_irn_dep(new_node, new_dep);
87 void be_dep_on_frame(ir_node* node)
89 ir_graph *const irg = current_ir_graph;
91 if (get_irg_start_block(irg) == get_nodes_block(node))
92 add_irn_dep(node, get_irg_frame(irg));
95 ir_node *be_duplicate_node(ir_node *node) {
96 ir_node *block = be_transform_node(get_nodes_block(node));
97 ir_graph *irg = env.irg;
98 dbg_info *dbgi = get_irn_dbg_info(node);
99 ir_mode *mode = get_irn_mode(node);
100 ir_op *op = get_irn_op(node);
104 arity = get_irn_arity(node);
105 if (op->opar == oparity_dynamic) {
106 new_node = new_ir_node(dbgi, irg, block, op, mode, -1, NULL);
107 for (i = 0; i < arity; ++i) {
108 ir_node *in = get_irn_n(node, i);
109 in = be_transform_node(in);
110 add_irn_n(new_node, in);
113 ir_node **ins = ALLOCAN(ir_node*, arity);
114 for (i = 0; i < arity; ++i) {
115 ir_node *in = get_irn_n(node, i);
116 ins[i] = be_transform_node(in);
119 new_node = new_ir_node(dbgi, irg, block, op, mode, arity, ins);
122 copy_node_attr(node, new_node);
123 be_duplicate_deps(node, new_node);
125 new_node->node_nr = node->node_nr;
130 * Calls transformation function for given node and marks it visited.
132 ir_node *be_transform_node(ir_node *node) {
134 ir_node *new_node = be_get_transformed_node(node);
136 if (new_node != NULL)
139 DEBUG_ONLY(be_set_transformed_node(node, NULL));
141 op = get_irn_op(node);
142 if (op->ops.generic) {
143 be_transform_func *transform = (be_transform_func *)op->ops.generic;
145 new_node = transform(node);
146 assert(new_node != NULL);
148 new_node = be_duplicate_node(node);
151 be_set_transformed_node(node, new_node);
152 hook_dead_node_elim_subst(current_ir_graph, node, new_node);
157 * enqueue all inputs into the transform queue.
159 void be_enqueue_preds(ir_node *node) {
162 /* put the preds in the worklist */
163 arity = get_irn_arity(node);
164 for (i = 0; i < arity; ++i) {
165 ir_node *pred = get_irn_n(node, i);
166 pdeq_putr(env.worklist, pred);
171 * Rewire nodes which are potential loops (like Phis) to avoid endless loops.
173 static void fix_loops(ir_node *node) {
177 assert(node_is_in_irgs_storage(env.irg, node));
179 if (irn_visited_else_mark(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 static void pre_transform_anchor(int anchor)
243 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
244 ir_node *transformed = be_transform_node(old_anchor_node);
245 set_irg_anchor(current_ir_graph, anchor, transformed);
248 static void kill_unused_anchor(int anchor)
250 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
251 ir_node *old_bad = get_irn_n(env.old_anchor, anchor_bad);
252 if(old_anchor_node != NULL && get_irn_n_edges(old_anchor_node) <= 1) {
253 set_irn_n(env.old_anchor, anchor, old_bad);
258 * Transforms all nodes. Deletes the old obstack and creates a new one.
260 static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform)
263 ir_node *old_end, *new_anchor;
265 hook_dead_node_elim(irg, 1);
267 inc_irg_visited(irg);
270 env.worklist = new_waitq();
271 env.old_anchor = irg->anchor;
273 old_end = get_irg_end(irg);
275 /* put all anchor nodes in the worklist */
276 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
277 ir_node *anchor = get_irg_anchor(irg, i);
281 waitq_put(env.worklist, anchor);
284 new_anchor = new_Anchor(irg);
285 irg->anchor = new_anchor;
287 /* pre transform some anchors (so they are available in the other transform
289 pre_transform_anchor(anchor_bad);
290 pre_transform_anchor(anchor_no_mem);
291 pre_transform_anchor(anchor_start_block);
292 pre_transform_anchor(anchor_start);
293 pre_transform_anchor(anchor_frame);
294 kill_unused_anchor(anchor_tls);
299 /* process worklist (this should transform all nodes in the graph) */
300 while (! waitq_empty(env.worklist)) {
301 ir_node *node = waitq_get(env.worklist);
302 be_transform_node(node);
305 /* fix loops and set new anchors*/
306 inc_irg_visited(irg);
307 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
308 ir_node *anchor = get_irn_n(env.old_anchor, i);
313 anchor = get_irn_link(anchor);
315 set_irn_n(new_anchor, i, anchor);
317 set_nodes_block(new_anchor, get_irg_anchor(irg, anchor_end_block));
319 del_waitq(env.worklist);
321 hook_dead_node_elim(irg, 0);
325 * Transform helper for blocks.
327 static ir_node *gen_Block(ir_node *node) {
328 ir_graph *irg = current_ir_graph;
329 dbg_info *dbgi = get_irn_dbg_info(node);
330 ir_node *macroblock = get_Block_MacroBlock(node);
333 block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), get_irn_mode(node),
334 get_irn_arity(node), get_irn_in(node) + 1);
335 copy_node_attr(node, block);
336 block->node_nr = node->node_nr;
338 if (node == macroblock) {
339 /* this node is a macroblock header */
340 set_Block_MacroBlock(block, block);
342 macroblock = be_transform_node(macroblock);
343 set_Block_MacroBlock(block, macroblock);
346 /* put the preds in the worklist */
347 be_enqueue_preds(node);
352 static ir_node *gen_End(ir_node *node) {
353 /* end has to be duplicated manually because we need a dynamic in array */
354 ir_graph *irg = current_ir_graph;
355 dbg_info *dbgi = get_irn_dbg_info(node);
356 ir_node *block = be_transform_node(get_nodes_block(node));
360 new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
361 copy_node_attr(node, new_end);
362 be_duplicate_deps(node, new_end);
364 set_irg_end(irg, new_end);
366 /* transform preds */
367 arity = get_irn_arity(node);
368 for (i = 0; i < arity; ++i) {
369 ir_node *in = get_irn_n(node, i);
370 ir_node *new_in = be_transform_node(in);
372 add_End_keepalive(new_end, new_in);
378 void be_transform_graph(be_irg_t *birg, arch_pretrans_nodes *func)
380 ir_graph *irg = birg->irg;
381 ir_graph *old_current_ir_graph = current_ir_graph;
382 struct obstack *old_obst = NULL;
383 struct obstack *new_obst = NULL;
385 current_ir_graph = irg;
387 /* create a new obstack */
388 old_obst = irg->obst;
389 new_obst = XMALLOC(struct obstack);
390 obstack_init(new_obst);
391 irg->obst = new_obst;
392 irg->last_node_idx = 0;
394 /* create new value table for CSE */
395 del_identities(irg->value_table);
396 irg->value_table = new_identities();
398 /* enter special helper */
399 op_Block->ops.generic = (op_func)gen_Block;
400 op_End->ops.generic = (op_func)gen_End;
402 /* do the main transformation */
403 transform_nodes(irg, func);
405 /* free the old obstack */
406 obstack_free(old_obst, 0);
410 current_ir_graph = old_current_ir_graph;
412 /* most analysis info is wrong after transformation */
413 free_callee_info(irg);
416 free_loop_information(irg);
417 set_irg_doms_inconsistent(irg);
419 be_liveness_invalidate(be_get_birg_liveness(birg));
420 /* Hack for now, something is buggy with invalidate liveness... */
422 be_invalidate_dom_front(birg);
424 /* recalculate edges */
425 edges_deactivate(irg);
429 be_liveness_free(birg->lv);
430 birg->lv = be_liveness(irg);