2 * Copyright (C) 1995-2010 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"
44 #include "betranshlp.h"
48 typedef struct be_transform_env_t {
49 ir_graph *irg; /**< The irg, the node should be created in */
50 waitq *worklist; /**< worklist of nodes that still need to be
52 ir_node *old_anchor; /**< the old anchor node in the old irg */
56 static be_transform_env_t env;
58 void be_set_transformed_node(ir_node *old_node, ir_node *new_node)
60 ir_graph *irg = get_irn_irg(old_node);
62 set_irn_link(old_node, new_node);
63 mark_irn_visited(old_node);
64 hook_dead_node_elim_subst(irg, old_node, new_node);
67 int be_is_transformed(const ir_node *node)
69 return irn_visited(node);
72 static inline ir_node *be_get_transformed_node(ir_node *old_node)
74 if (irn_visited(old_node)) {
75 ir_node *new_node = (ir_node*)get_irn_link(old_node);
76 assert(new_node != NULL);
82 void be_duplicate_deps(ir_node *old_node, ir_node *new_node)
85 int deps = get_irn_deps(old_node);
87 for (i = 0; i < deps; ++i) {
88 ir_node *dep = get_irn_dep(old_node, i);
89 ir_node *new_dep = be_transform_node(dep);
91 add_irn_dep(new_node, new_dep);
95 void be_set_transform_function(ir_op *op, be_transform_func func)
97 /* shouldn't be assigned twice (except for exchanging the default
98 * be_duplicate_node entries) */
99 assert(op->ops.generic == NULL
100 || op->ops.generic == (op_func) be_duplicate_node);
101 op->ops.generic = (op_func) func;
105 * Transform helper for blocks.
107 static ir_node *transform_block(ir_node *node)
109 ir_graph *irg = get_irn_irg(node);
110 dbg_info *dbgi = get_irn_dbg_info(node);
113 block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), get_irn_mode(node),
114 get_irn_arity(node), get_irn_in(node) + 1);
115 copy_node_attr(irg, node, block);
116 block->node_nr = node->node_nr;
118 /* put the preds in the worklist */
119 be_enqueue_preds(node);
124 static ir_node *transform_end(ir_node *node)
126 /* end has to be duplicated manually because we need a dynamic in array */
127 ir_graph *irg = get_irn_irg(node);
128 dbg_info *dbgi = get_irn_dbg_info(node);
129 ir_node *block = be_transform_node(get_nodes_block(node));
133 new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
134 copy_node_attr(irg, node, new_end);
135 be_duplicate_deps(node, new_end);
137 set_irg_end(irg, new_end);
139 /* do not transform predecessors yet to keep the pre-transform
140 * phase from visiting all the graph */
141 arity = get_irn_arity(node);
142 for (i = 0; i < arity; ++i) {
143 ir_node *in = get_irn_n(node, i);
144 add_End_keepalive(new_end, in);
146 be_enqueue_preds(node);
151 void be_start_transform_setup(void)
153 clear_irp_opcodes_generic_func();
155 be_set_transform_function(op_Bad, be_duplicate_node);
156 be_set_transform_function(op_be_Copy, be_duplicate_node);
157 be_set_transform_function(op_be_CopyKeep, be_duplicate_node);
158 be_set_transform_function(op_be_IncSP, be_duplicate_node);
159 be_set_transform_function(op_be_Keep, be_duplicate_node);
160 be_set_transform_function(op_be_Return, be_duplicate_node);
161 be_set_transform_function(op_be_Start, be_duplicate_node);
162 be_set_transform_function(op_Block, transform_block);
163 be_set_transform_function(op_End, transform_end);
164 be_set_transform_function(op_NoMem, be_duplicate_node);
165 be_set_transform_function(op_Pin, be_duplicate_node);
166 be_set_transform_function(op_Start, be_duplicate_node);
167 be_set_transform_function(op_Sync, be_duplicate_node);
170 ir_node *be_duplicate_node(ir_node *node)
172 ir_node *block = be_transform_node(get_nodes_block(node));
173 ir_graph *irg = env.irg;
174 dbg_info *dbgi = get_irn_dbg_info(node);
175 ir_mode *mode = get_irn_mode(node);
176 ir_op *op = get_irn_op(node);
180 arity = get_irn_arity(node);
181 if (op->opar == oparity_dynamic) {
182 new_node = new_ir_node(dbgi, irg, block, op, mode, -1, NULL);
183 for (i = 0; i < arity; ++i) {
184 ir_node *in = get_irn_n(node, i);
185 in = be_transform_node(in);
186 add_irn_n(new_node, in);
189 ir_node **ins = ALLOCAN(ir_node*, arity);
190 for (i = 0; i < arity; ++i) {
191 ir_node *in = get_irn_n(node, i);
192 ins[i] = be_transform_node(in);
195 new_node = new_ir_node(dbgi, irg, block, op, mode, arity, ins);
198 copy_node_attr(irg, node, new_node);
199 be_duplicate_deps(node, new_node);
201 new_node->node_nr = node->node_nr;
205 ir_node *be_transform_node(ir_node *node)
208 ir_node *new_node = be_get_transformed_node(node);
209 be_transform_func *transform;
211 if (new_node != NULL)
214 DEBUG_ONLY(be_set_transformed_node(node, NULL));
216 op = get_irn_op(node);
217 if (op->ops.generic == NULL) {
218 panic("No transform function registered for node %+F.", node);
220 transform = (be_transform_func *)op->ops.generic;
222 new_node = transform(node);
223 assert(new_node != NULL);
225 be_set_transformed_node(node, new_node);
229 void be_enqueue_preds(ir_node *node)
233 /* put the preds in the worklist */
234 arity = get_irn_arity(node);
235 for (i = 0; i < arity; ++i) {
236 ir_node *pred = get_irn_n(node, i);
237 pdeq_putr(env.worklist, pred);
242 * Rewire nodes which are potential loops (like Phis) to avoid endless loops.
244 static void fix_loops(ir_node *node)
249 assert(node_is_in_irgs_storage(env.irg, node));
251 if (irn_visited_else_mark(node))
255 if (! is_Block(node)) {
256 ir_node *block = get_nodes_block(node);
257 ir_node *new_block = (ir_node*)get_irn_link(block);
259 if (new_block != NULL) {
260 set_nodes_block(node, new_block);
268 arity = get_irn_arity(node);
269 for (i = 0; i < arity; ++i) {
270 ir_node *in = get_irn_n(node, i);
271 ir_node *nw = (ir_node*)get_irn_link(in);
273 if (nw != NULL && nw != in) {
274 set_irn_n(node, i, nw);
283 set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
287 arity = get_irn_deps(node);
288 for (i = 0; i < arity; ++i) {
289 ir_node *in = get_irn_dep(node, i);
290 ir_node *nw = (ir_node*)get_irn_link(in);
292 if (nw != NULL && nw != in) {
293 set_irn_dep(node, i, nw);
302 identify_remember(node);
306 ir_node *be_pre_transform_node(ir_node *place)
311 return be_transform_node(place);
314 static void pre_transform_anchor(ir_graph *irg, int anchor)
316 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
317 ir_node *transformed = be_transform_node(old_anchor_node);
318 set_irg_anchor(irg, anchor, transformed);
322 * Transforms all nodes. Deletes the old obstack and creates a new one.
324 static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform)
327 ir_node *old_end, *new_anchor;
329 hook_dead_node_elim(irg, 1);
331 inc_irg_visited(irg);
334 env.worklist = new_waitq();
335 env.old_anchor = irg->anchor;
337 old_end = get_irg_end(irg);
339 /* put all anchor nodes in the worklist */
340 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
341 ir_node *anchor = get_irg_anchor(irg, i);
345 waitq_put(env.worklist, anchor);
348 new_anchor = new_r_Anchor(irg);
349 irg->anchor = new_anchor;
351 /* pre transform some anchors (so they are available in the other transform
353 pre_transform_anchor(irg, anchor_no_mem);
354 pre_transform_anchor(irg, anchor_end_block);
355 pre_transform_anchor(irg, anchor_end);
356 pre_transform_anchor(irg, anchor_start_block);
357 pre_transform_anchor(irg, anchor_start);
358 pre_transform_anchor(irg, anchor_frame);
363 /* process worklist (this should transform all nodes in the graph) */
364 while (! waitq_empty(env.worklist)) {
365 ir_node *node = (ir_node*)waitq_get(env.worklist);
366 be_transform_node(node);
369 /* fix loops and set new anchors*/
370 inc_irg_visited(irg);
371 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
372 ir_node *anchor = get_irn_n(env.old_anchor, i);
377 anchor = (ir_node*)get_irn_link(anchor);
379 set_irn_n(new_anchor, i, anchor);
382 del_waitq(env.worklist);
384 hook_dead_node_elim(irg, 0);
387 void be_transform_graph(ir_graph *irg, arch_pretrans_nodes *func)
389 ir_graph *old_current_ir_graph = current_ir_graph;
390 struct obstack *old_obst = NULL;
391 struct obstack *new_obst = NULL;
393 current_ir_graph = irg;
395 /* create a new obstack */
396 old_obst = irg->obst;
397 new_obst = XMALLOC(struct obstack);
398 obstack_init(new_obst);
399 irg->obst = new_obst;
400 irg->last_node_idx = 0;
402 /* invalidate phase info as (at least vrp info) is used inside the
403 * equivalent/compute_value functions and might replace our newly
404 * created nodes with middleend nodes */
405 irg_invalidate_phases(irg);
407 /* create new value table for CSE */
410 /* do the main transformation */
411 transform_nodes(irg, func);
413 /* free the old obstack */
414 obstack_free(old_obst, 0);
418 current_ir_graph = old_current_ir_graph;
420 /* most analysis info is wrong after transformation */
421 free_callee_info(irg);
424 free_loop_information(irg);
425 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_DOMINANCE);
427 be_liveness_invalidate(be_get_irg_liveness(irg));
428 /* Hack for now, something is buggy with invalidate liveness... */
429 be_birg_from_irg(irg)->lv = NULL;
430 be_invalidate_dom_front(irg);
432 /* recalculate edges */
433 edges_deactivate(irg);