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 static INLINE ir_node *be_get_transformed_node(ir_node *old_node) {
64 assert(irn_visited(old_node));
65 return (ir_node*) get_irn_link(old_node);
68 void be_duplicate_deps(ir_node *old_node, ir_node *new_node) {
70 int deps = get_irn_deps(old_node);
72 for (i = 0; i < deps; ++i) {
73 ir_node *dep = get_irn_dep(old_node, i);
74 ir_node *new_dep = be_transform_node(dep);
76 add_irn_dep(new_node, new_dep);
80 ir_node *be_duplicate_node(ir_node *node) {
81 ir_node *block = be_transform_node(get_nodes_block(node));
82 ir_graph *irg = env.irg;
83 dbg_info *dbgi = get_irn_dbg_info(node);
84 ir_mode *mode = get_irn_mode(node);
85 ir_op *op = get_irn_op(node);
89 arity = get_irn_arity(node);
90 if (op->opar == oparity_dynamic) {
91 new_node = new_ir_node(dbgi, irg, block, op, mode, -1, NULL);
92 for (i = 0; i < arity; ++i) {
93 ir_node *in = get_irn_n(node, i);
94 in = be_transform_node(in);
95 add_irn_n(new_node, in);
98 ir_node **ins = alloca(arity * sizeof(ins[0]));
99 for (i = 0; i < arity; ++i) {
100 ir_node *in = get_irn_n(node, i);
101 ins[i] = be_transform_node(in);
104 new_node = new_ir_node(dbgi, irg, block, op, mode, arity, ins);
107 copy_node_attr(node, new_node);
108 be_duplicate_deps(node, new_node);
111 new_node->node_nr = node->node_nr;
118 * Calls transformation function for given node and marks it visited.
120 ir_node *be_transform_node(ir_node *node) {
124 if (irn_visited(node)) {
125 new_node = be_get_transformed_node(node);
126 assert(new_node != NULL);
130 mark_irn_visited(node);
131 DEBUG_ONLY(be_set_transformed_node(node, NULL));
133 op = get_irn_op(node);
134 if (op->ops.generic) {
135 be_transform_func *transform = (be_transform_func *)op->ops.generic;
137 new_node = transform(node);
138 assert(new_node != NULL);
140 new_node = be_duplicate_node(node);
143 be_set_transformed_node(node, new_node);
144 mark_irn_visited(new_node);
145 hook_dead_node_elim_subst(current_ir_graph, node, new_node);
150 * enqueue all inputs into the transform queue.
152 void be_enqueue_preds(ir_node *node) {
155 /* put the preds in the worklist */
156 arity = get_irn_arity(node);
157 for (i = 0; i < arity; ++i) {
158 ir_node *pred = get_irn_n(node, i);
159 pdeq_putr(env.worklist, pred);
164 * Rewire nodes which are potential loops (like Phis) to avoid endless loops.
166 static void fix_loops(ir_node *node) {
169 assert(node_is_in_irgs_storage(env.irg, node));
171 if (irn_visited(node))
174 mark_irn_visited(node);
176 if (! is_Block(node)) {
177 ir_node *block = get_nodes_block(node);
178 ir_node *new_block = get_irn_link(block);
180 if (new_block != NULL) {
181 set_nodes_block(node, new_block);
188 arity = get_irn_arity(node);
189 for (i = 0; i < arity; ++i) {
190 ir_node *in = get_irn_n(node, i);
191 ir_node *nw = get_irn_link(in);
193 if (nw != NULL && nw != in) {
194 set_irn_n(node, i, nw);
202 set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
205 arity = get_irn_deps(node);
206 for (i = 0; i < arity; ++i) {
207 ir_node *in = get_irn_dep(node, i);
208 ir_node *nw = get_irn_link(in);
210 if (nw != NULL && nw != in) {
211 set_irn_dep(node, i, nw);
219 ir_node *be_pre_transform_node(ir_node *place) {
223 return be_transform_node(place);
226 ir_node *be_get_old_anchor(int anchor)
228 return get_irn_n(env.old_anchor, anchor);
231 static void pre_transform_anchor(int anchor)
233 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
234 ir_node *transformed = be_transform_node(old_anchor_node);
235 set_irg_anchor(current_ir_graph, anchor, transformed);
239 * Transforms all nodes. Deletes the old obstack and creates a new one.
241 static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform,
245 ir_node *old_end, *new_anchor;
247 hook_dead_node_elim(irg, 1);
249 inc_irg_visited(irg);
252 env.visited = get_irg_visited(irg);
253 env.worklist = new_waitq();
254 env.old_anchor = irg->anchor;
256 old_end = get_irg_end(irg);
258 /* put all anchor nodes in the worklist */
259 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
260 ir_node *anchor = get_irg_anchor(irg, i);
264 waitq_put(env.worklist, anchor);
267 new_anchor = new_Anchor(irg);
268 irg->anchor = new_anchor;
270 /* pre transform some anchors (so they are available in the other transform
272 pre_transform_anchor(anchor_bad);
273 pre_transform_anchor(anchor_no_mem);
274 pre_transform_anchor(anchor_start_block);
275 pre_transform_anchor(anchor_start);
276 pre_transform_anchor(anchor_frame);
279 (*pre_transform)(cg);
281 /* process worklist (this should transform all nodes in the graph) */
282 while (! waitq_empty(env.worklist)) {
283 ir_node *node = waitq_get(env.worklist);
284 be_transform_node(node);
287 /* fix loops and set new anchors*/
288 inc_irg_visited(irg);
289 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
290 ir_node *anchor = get_irn_n(env.old_anchor, i);
295 anchor = get_irn_link(anchor);
297 set_irn_n(new_anchor, i, anchor);
299 set_irn_n(new_anchor, -1, get_irg_anchor(irg, anchor_end_block));
301 del_waitq(env.worklist);
303 hook_dead_node_elim(irg, 0);
307 * Transform helper for blocks.
309 static ir_node *gen_Block(ir_node *node) {
310 ir_graph *irg = current_ir_graph;
311 dbg_info *dbgi = get_irn_dbg_info(node);
312 ir_node *old_start_block = get_irn_n(env.old_anchor, anchor_start_block);
316 * We replace the ProjX from the start node with a jump,
317 * so the startblock has no preds anymore now
319 if (node == old_start_block) {
320 return new_rd_Block(dbgi, irg, 0, NULL);
323 /* we use the old blocks for now, because jumps allow cycles in the graph
324 * we have to fix this later */
325 block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), get_irn_mode(node),
326 get_irn_arity(node), get_irn_in(node) + 1);
327 copy_node_attr(node, block);
330 block->node_nr = node->node_nr;
332 be_set_transformed_node(node, block);
334 /* put the preds in the worklist */
335 be_enqueue_preds(node);
340 static ir_node *gen_End(ir_node *node) {
341 /* end has to be duplicated manually because we need a dynamic in array */
342 ir_graph *irg = current_ir_graph;
343 dbg_info *dbgi = get_irn_dbg_info(node);
344 ir_node *block = be_transform_node(get_nodes_block(node));
348 new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
349 copy_node_attr(node, new_end);
350 be_duplicate_deps(node, new_end);
352 set_irg_end(irg, new_end);
353 be_set_transformed_node(new_end, new_end);
355 /* transform preds */
356 arity = get_irn_arity(node);
357 for (i = 0; i < arity; ++i) {
358 ir_node *in = get_irn_n(node, i);
359 ir_node *new_in = be_transform_node(in);
361 add_End_keepalive(new_end, new_in);
367 void be_transform_graph(be_irg_t *birg, arch_pretrans_nodes *func, void *cg)
369 ir_graph *irg = birg->irg;
370 ir_graph *old_current_ir_graph = current_ir_graph;
371 int old_interprocedural_view = get_interprocedural_view();
372 struct obstack *old_obst = NULL;
373 struct obstack *new_obst = NULL;
375 current_ir_graph = irg;
376 set_interprocedural_view(0);
378 /* most analysis info is wrong after transformation */
379 free_callee_info(irg);
382 free_loop_information(irg);
383 set_irg_doms_inconsistent(irg);
385 be_liveness_invalidate(be_get_birg_liveness(birg));
386 be_invalidate_dom_front(birg);
388 /* create a new obstack */
389 old_obst = irg->obst;
390 new_obst = xmalloc(sizeof(*new_obst));
391 obstack_init(new_obst);
392 irg->obst = new_obst;
393 irg->last_node_idx = 0;
395 /* create new value table for CSE */
396 del_identities(irg->value_table);
397 irg->value_table = new_identities();
399 /* enter special helper */
400 op_Block->ops.generic = (op_func)gen_Block;
401 op_End->ops.generic = (op_func)gen_End;
403 /* do the main transformation */
404 transform_nodes(irg, func, cg);
406 /* we don't want the globals anchor anymore */
407 set_irg_globals(irg, new_r_Bad(irg));
409 /* free the old obstack */
410 obstack_free(old_obst, 0);
414 current_ir_graph = old_current_ir_graph;
415 set_interprocedural_view(old_interprocedural_view);
417 /* recalculate edges */
418 edges_deactivate(irg);
422 be_liveness_free(birg->lv);
423 birg->lv = be_liveness(birg);