2 * Copyright (C) 1995-2007 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 assert(irn_visited(old_node));
69 return (ir_node*) get_irn_link(old_node);
72 void be_duplicate_deps(ir_node *old_node, ir_node *new_node) {
74 int deps = get_irn_deps(old_node);
76 for (i = 0; i < deps; ++i) {
77 ir_node *dep = get_irn_dep(old_node, i);
78 ir_node *new_dep = be_transform_node(dep);
80 add_irn_dep(new_node, new_dep);
84 ir_node *be_duplicate_node(ir_node *node) {
85 ir_node *block = be_transform_node(get_nodes_block(node));
86 ir_graph *irg = env.irg;
87 dbg_info *dbgi = get_irn_dbg_info(node);
88 ir_mode *mode = get_irn_mode(node);
89 ir_op *op = get_irn_op(node);
93 arity = get_irn_arity(node);
94 if (op->opar == oparity_dynamic) {
95 new_node = new_ir_node(dbgi, irg, block, op, mode, -1, NULL);
96 for (i = 0; i < arity; ++i) {
97 ir_node *in = get_irn_n(node, i);
98 in = be_transform_node(in);
99 add_irn_n(new_node, in);
102 ir_node **ins = alloca(arity * sizeof(ins[0]));
103 for (i = 0; i < arity; ++i) {
104 ir_node *in = get_irn_n(node, i);
105 ins[i] = be_transform_node(in);
108 new_node = new_ir_node(dbgi, irg, block, op, mode, arity, ins);
111 copy_node_attr(node, new_node);
112 be_duplicate_deps(node, new_node);
115 new_node->node_nr = node->node_nr;
122 * Calls transformation function for given node and marks it visited.
124 ir_node *be_transform_node(ir_node *node) {
128 if (irn_visited(node)) {
129 new_node = be_get_transformed_node(node);
130 assert(new_node != NULL);
134 mark_irn_visited(node);
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 mark_irn_visited(new_node);
149 hook_dead_node_elim_subst(current_ir_graph, node, new_node);
154 * enqueue all inputs into the transform queue.
156 void be_enqueue_preds(ir_node *node) {
159 /* put the preds in the worklist */
160 arity = get_irn_arity(node);
161 for (i = 0; i < arity; ++i) {
162 ir_node *pred = get_irn_n(node, i);
163 pdeq_putr(env.worklist, pred);
168 * Rewire nodes which are potential loops (like Phis) to avoid endless loops.
170 static void fix_loops(ir_node *node) {
174 assert(node_is_in_irgs_storage(env.irg, node));
176 if (irn_visited(node))
179 mark_irn_visited(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 ir_node *be_get_old_anchor(int anchor)
242 return get_irn_n(env.old_anchor, anchor);
245 static void pre_transform_anchor(int anchor)
247 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
248 ir_node *transformed = be_transform_node(old_anchor_node);
249 set_irg_anchor(current_ir_graph, anchor, transformed);
252 static void kill_unused_anchor(int anchor)
254 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
255 ir_node *old_bad = get_irn_n(env.old_anchor, anchor_bad);
256 if(old_anchor_node != NULL && get_irn_n_edges(old_anchor_node) <= 1) {
257 set_irn_n(env.old_anchor, anchor, old_bad);
262 * Transforms all nodes. Deletes the old obstack and creates a new one.
264 static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform,
268 ir_node *old_end, *new_anchor;
270 hook_dead_node_elim(irg, 1);
272 inc_irg_visited(irg);
275 env.visited = get_irg_visited(irg);
276 env.worklist = new_waitq();
277 env.old_anchor = irg->anchor;
279 old_end = get_irg_end(irg);
281 /* put all anchor nodes in the worklist */
282 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
283 ir_node *anchor = get_irg_anchor(irg, i);
287 waitq_put(env.worklist, anchor);
290 new_anchor = new_Anchor(irg);
291 irg->anchor = new_anchor;
293 /* pre transform some anchors (so they are available in the other transform
295 pre_transform_anchor(anchor_bad);
296 pre_transform_anchor(anchor_no_mem);
297 pre_transform_anchor(anchor_start_block);
298 pre_transform_anchor(anchor_start);
299 pre_transform_anchor(anchor_frame);
300 kill_unused_anchor(anchor_tls);
303 (*pre_transform)(cg);
305 /* process worklist (this should transform all nodes in the graph) */
306 while (! waitq_empty(env.worklist)) {
307 ir_node *node = waitq_get(env.worklist);
308 be_transform_node(node);
311 /* fix loops and set new anchors*/
312 inc_irg_visited(irg);
313 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
314 ir_node *anchor = get_irn_n(env.old_anchor, i);
319 anchor = get_irn_link(anchor);
321 set_irn_n(new_anchor, i, anchor);
323 set_irn_n(new_anchor, -1, get_irg_anchor(irg, anchor_end_block));
325 del_waitq(env.worklist);
327 hook_dead_node_elim(irg, 0);
331 * Transform helper for blocks.
333 static ir_node *gen_Block(ir_node *node) {
334 ir_graph *irg = current_ir_graph;
335 dbg_info *dbgi = get_irn_dbg_info(node);
336 ir_node *old_start_block = get_irn_n(env.old_anchor, anchor_start_block);
337 ir_node *macroblock = get_Block_MacroBlock(node);
341 * We replace the ProjX from the start node with a jump,
342 * so the startblock has no preds anymore now
344 if (node == old_start_block) {
345 return new_rd_Block(dbgi, irg, 0, NULL);
348 /* we use the old blocks for now, because jumps allow cycles in the graph
349 * we have to fix this later */
350 block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), get_irn_mode(node),
351 get_irn_arity(node), get_irn_in(node) + 1);
352 copy_node_attr(node, block);
354 block->node_nr = node->node_nr;
356 if (node == macroblock) {
357 /* this node is a macroblock header */
358 set_irn_n(block, -1, block);
360 macroblock = be_transform_node(macroblock);
361 set_irn_n(block, -1, macroblock);
364 be_set_transformed_node(node, block);
366 /* put the preds in the worklist */
367 be_enqueue_preds(node);
372 static ir_node *gen_End(ir_node *node) {
373 /* end has to be duplicated manually because we need a dynamic in array */
374 ir_graph *irg = current_ir_graph;
375 dbg_info *dbgi = get_irn_dbg_info(node);
376 ir_node *block = be_transform_node(get_nodes_block(node));
380 new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
381 copy_node_attr(node, new_end);
382 be_duplicate_deps(node, new_end);
384 set_irg_end(irg, new_end);
385 be_set_transformed_node(new_end, new_end);
387 /* transform preds */
388 arity = get_irn_arity(node);
389 for (i = 0; i < arity; ++i) {
390 ir_node *in = get_irn_n(node, i);
391 ir_node *new_in = be_transform_node(in);
393 add_End_keepalive(new_end, new_in);
399 void be_transform_graph(be_irg_t *birg, arch_pretrans_nodes *func, void *cg)
401 ir_graph *irg = birg->irg;
402 ir_graph *old_current_ir_graph = current_ir_graph;
403 struct obstack *old_obst = NULL;
404 struct obstack *new_obst = NULL;
406 current_ir_graph = irg;
408 /* create a new obstack */
409 old_obst = irg->obst;
410 new_obst = xmalloc(sizeof(*new_obst));
411 obstack_init(new_obst);
412 irg->obst = new_obst;
413 irg->last_node_idx = 0;
415 /* create new value table for CSE */
416 del_identities(irg->value_table);
417 irg->value_table = new_identities();
419 /* enter special helper */
420 op_Block->ops.generic = (op_func)gen_Block;
421 op_End->ops.generic = (op_func)gen_End;
423 /* do the main transformation */
424 transform_nodes(irg, func, cg);
426 /* we don't want the globals anchor anymore */
427 set_irg_globals(irg, new_r_Bad(irg));
429 /* free the old obstack */
430 obstack_free(old_obst, 0);
434 current_ir_graph = old_current_ir_graph;
436 /* most analysis info is wrong after transformation */
437 free_callee_info(irg);
440 free_loop_information(irg);
441 set_irg_doms_inconsistent(irg);
443 be_liveness_invalidate(be_get_birg_liveness(birg));
444 /* Hack for now, something is buggy with invalidate liveness... */
446 be_invalidate_dom_front(birg);
448 /* recalculate edges */
449 edges_deactivate(irg);
453 be_liveness_free(birg->lv);
454 birg->lv = be_liveness(birg);