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);
201 arity = get_irn_deps(node);
202 for (i = 0; i < arity; ++i) {
203 ir_node *in = get_irn_dep(node, i);
204 ir_node *nw = get_irn_link(in);
206 if (nw != NULL && nw != in) {
207 set_irn_dep(node, i, nw);
215 ir_node *be_pre_transform_node(ir_node *place) {
219 return be_transform_node(place);
223 * Transforms all nodes. Deletes the old obstack and creates a new one.
225 static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform, void *cg) {
227 ir_node *old_end, *new_anchor;
229 hook_dead_node_elim(irg, 1);
231 inc_irg_visited(irg);
234 env.visited = get_irg_visited(irg);
235 env.worklist = new_waitq();
236 env.old_anchor = irg->anchor;
238 old_end = get_irg_end(irg);
240 /* put all anchor nodes in the worklist */
241 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
242 ir_node *anchor = get_irg_anchor(irg, i);
246 waitq_put(env.worklist, anchor);
249 new_anchor = new_Anchor(irg);
251 /* pre transform some anchors (so they are available in the other transform
253 set_irn_n(new_anchor, anchor_bad, be_transform_node(get_irg_anchor(irg, anchor_bad)));
254 set_irn_n(new_anchor, anchor_no_mem, be_transform_node(get_irg_anchor(irg, anchor_no_mem)));
255 set_irn_n(new_anchor, anchor_start_block, be_transform_node(get_irg_anchor(irg, anchor_start_block)));
256 set_irn_n(new_anchor, anchor_start, be_transform_node(get_irg_anchor(irg, anchor_start)));
257 set_irn_n(new_anchor, anchor_frame, be_transform_node(get_irg_anchor(irg, anchor_frame)));
260 (*pre_transform)(cg);
262 /* process worklist (this should transform all nodes in the graph) */
263 while (! waitq_empty(env.worklist)) {
264 ir_node *node = waitq_get(env.worklist);
265 be_transform_node(node);
268 /* fix loops and set new anchors*/
269 inc_irg_visited(irg);
270 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
271 ir_node *anchor = get_irg_anchor(irg, i);
276 anchor = get_irn_link(anchor);
278 set_irn_n(new_anchor, i, anchor);
280 irg->anchor = new_anchor;
281 set_irn_n(new_anchor, -1, get_irn_intra_n(new_anchor, anchor_end_block));
283 del_waitq(env.worklist);
285 hook_dead_node_elim(irg, 0);
289 * Transform helper for blocks.
291 static ir_node *gen_Block(ir_node *node) {
292 ir_graph *irg = current_ir_graph;
293 dbg_info *dbgi = get_irn_dbg_info(node);
294 ir_node *start_block = get_irg_anchor(irg, anchor_start_block);
298 * We replace the ProjX from the start node with a jump,
299 * so the startblock has no preds anymore now
301 if (node == start_block) {
302 return new_rd_Block(dbgi, irg, 0, NULL);
305 /* we use the old blocks for now, because jumps allow cycles in the graph
306 * we have to fix this later */
307 block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), get_irn_mode(node),
308 get_irn_arity(node), get_irn_in(node) + 1);
309 copy_node_attr(node, block);
312 block->node_nr = node->node_nr;
314 be_set_transformed_node(node, block);
316 /* put the preds in the worklist */
317 be_enqueue_preds(node);
322 static ir_node *gen_End(ir_node *node) {
323 /* end has to be duplicated manually because we need a dynamic in array */
324 ir_graph *irg = current_ir_graph;
325 dbg_info *dbgi = get_irn_dbg_info(node);
326 ir_node *block = be_transform_node(get_nodes_block(node));
330 new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
331 copy_node_attr(node, new_end);
332 be_duplicate_deps(node, new_end);
334 set_irg_end(irg, new_end);
335 be_set_transformed_node(new_end, new_end);
337 /* transform preds */
338 arity = get_irn_arity(node);
339 for (i = 0; i < arity; ++i) {
340 ir_node *in = get_irn_n(node, i);
341 ir_node *new_in = be_transform_node(in);
343 add_End_keepalive(new_end, new_in);
349 void be_transform_graph(be_irg_t *birg, arch_pretrans_nodes *func, void *cg)
351 ir_graph *irg = birg->irg;
352 ir_graph *old_current_ir_graph = current_ir_graph;
353 int old_interprocedural_view = get_interprocedural_view();
354 struct obstack *old_obst = NULL;
355 struct obstack *new_obst = NULL;
357 current_ir_graph = irg;
358 set_interprocedural_view(0);
360 /* most analysis info is wrong after transformation */
361 free_callee_info(irg);
364 free_loop_information(irg);
365 set_irg_doms_inconsistent(irg);
367 be_liveness_invalidate(be_get_birg_liveness(birg));
368 be_invalidate_dom_front(birg);
370 /* create a new obstack */
371 old_obst = irg->obst;
372 new_obst = xmalloc(sizeof(*new_obst));
373 obstack_init(new_obst);
374 irg->obst = new_obst;
375 irg->last_node_idx = 0;
377 /* create new value table for CSE */
378 del_identities(irg->value_table);
379 irg->value_table = new_identities();
381 /* enter special helper */
382 op_Block->ops.generic = (op_func)gen_Block;
383 op_End->ops.generic = (op_func)gen_End;
385 /* do the main transformation */
386 transform_nodes(irg, func, cg);
388 /* we don't want the globals anchor anymore */
389 set_irg_globals(irg, new_r_Bad(irg));
391 /* free the old obstack */
392 obstack_free(old_obst, 0);
396 current_ir_graph = old_current_ir_graph;
397 set_interprocedural_view(old_interprocedural_view);
399 /* recalculate edges */
400 edges_deactivate(irg);
404 be_liveness_free(birg->lv);
405 birg->lv = be_liveness(birg->irg);