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 set_irn_link(old_node, new_node);
61 mark_irn_visited(old_node);
64 int be_is_transformed(const ir_node *node)
66 return irn_visited(node);
69 static inline ir_node *be_get_transformed_node(ir_node *old_node)
71 if (irn_visited(old_node)) {
72 ir_node *new_node = (ir_node*)get_irn_link(old_node);
73 assert(new_node != NULL);
79 void be_duplicate_deps(ir_node *old_node, ir_node *new_node)
82 int deps = get_irn_deps(old_node);
84 for (i = 0; i < deps; ++i) {
85 ir_node *dep = get_irn_dep(old_node, i);
86 ir_node *new_dep = be_transform_node(dep);
88 add_irn_dep(new_node, new_dep);
92 void be_set_transform_function(ir_op *op, be_transform_func func)
94 /* shouldn't be assigned twice (except for exchanging the default
95 * be_duplicate_node entries) */
96 assert(op->ops.generic == NULL
97 || op->ops.generic == (op_func) be_duplicate_node);
98 op->ops.generic = (op_func) func;
102 * Transform helper for blocks.
104 static ir_node *transform_block(ir_node *node)
106 ir_graph *irg = current_ir_graph;
107 dbg_info *dbgi = get_irn_dbg_info(node);
110 block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), get_irn_mode(node),
111 get_irn_arity(node), get_irn_in(node) + 1);
112 copy_node_attr(irg, node, block);
113 block->node_nr = node->node_nr;
115 /* put the preds in the worklist */
116 be_enqueue_preds(node);
121 static ir_node *transform_end(ir_node *node)
123 /* end has to be duplicated manually because we need a dynamic in array */
124 ir_graph *irg = current_ir_graph;
125 dbg_info *dbgi = get_irn_dbg_info(node);
126 ir_node *block = be_transform_node(get_nodes_block(node));
130 new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
131 copy_node_attr(irg, node, new_end);
132 be_duplicate_deps(node, new_end);
134 set_irg_end(irg, new_end);
136 /* do not transform predecessors yet to keep the pre-transform
137 * phase from visiting all the graph */
138 arity = get_irn_arity(node);
139 for (i = 0; i < arity; ++i) {
140 ir_node *in = get_irn_n(node, i);
141 add_End_keepalive(new_end, in);
143 be_enqueue_preds(node);
148 void be_start_transform_setup(void)
150 clear_irp_opcodes_generic_func();
152 be_set_transform_function(op_Bad, be_duplicate_node);
153 be_set_transform_function(op_be_Copy, be_duplicate_node);
154 be_set_transform_function(op_be_CopyKeep, be_duplicate_node);
155 be_set_transform_function(op_be_IncSP, be_duplicate_node);
156 be_set_transform_function(op_be_Keep, be_duplicate_node);
157 be_set_transform_function(op_be_Return, be_duplicate_node);
158 be_set_transform_function(op_be_Start, be_duplicate_node);
159 be_set_transform_function(op_Block, transform_block);
160 be_set_transform_function(op_End, transform_end);
161 be_set_transform_function(op_NoMem, be_duplicate_node);
162 be_set_transform_function(op_Pin, be_duplicate_node);
163 be_set_transform_function(op_Start, be_duplicate_node);
164 be_set_transform_function(op_Sync, be_duplicate_node);
167 ir_node *be_duplicate_node(ir_node *node)
169 ir_node *block = be_transform_node(get_nodes_block(node));
170 ir_graph *irg = env.irg;
171 dbg_info *dbgi = get_irn_dbg_info(node);
172 ir_mode *mode = get_irn_mode(node);
173 ir_op *op = get_irn_op(node);
177 arity = get_irn_arity(node);
178 if (op->opar == oparity_dynamic) {
179 new_node = new_ir_node(dbgi, irg, block, op, mode, -1, NULL);
180 for (i = 0; i < arity; ++i) {
181 ir_node *in = get_irn_n(node, i);
182 in = be_transform_node(in);
183 add_irn_n(new_node, in);
186 ir_node **ins = ALLOCAN(ir_node*, arity);
187 for (i = 0; i < arity; ++i) {
188 ir_node *in = get_irn_n(node, i);
189 ins[i] = be_transform_node(in);
192 new_node = new_ir_node(dbgi, irg, block, op, mode, arity, ins);
195 copy_node_attr(irg, node, new_node);
196 be_duplicate_deps(node, new_node);
198 new_node->node_nr = node->node_nr;
202 ir_node *be_transform_node(ir_node *node)
205 ir_node *new_node = be_get_transformed_node(node);
206 be_transform_func *transform;
208 if (new_node != NULL)
211 DEBUG_ONLY(be_set_transformed_node(node, NULL));
213 op = get_irn_op(node);
214 if (op->ops.generic == NULL) {
215 panic("No transform function registered for node %+F.", node);
217 transform = (be_transform_func *)op->ops.generic;
219 new_node = transform(node);
220 assert(new_node != NULL);
222 be_set_transformed_node(node, new_node);
223 hook_dead_node_elim_subst(current_ir_graph, node, new_node);
227 void be_enqueue_preds(ir_node *node)
231 /* put the preds in the worklist */
232 arity = get_irn_arity(node);
233 for (i = 0; i < arity; ++i) {
234 ir_node *pred = get_irn_n(node, i);
235 pdeq_putr(env.worklist, pred);
240 * Rewire nodes which are potential loops (like Phis) to avoid endless loops.
242 static void fix_loops(ir_node *node)
247 assert(node_is_in_irgs_storage(env.irg, node));
249 if (irn_visited_else_mark(node))
253 if (! is_Block(node)) {
254 ir_node *block = get_nodes_block(node);
255 ir_node *new_block = (ir_node*)get_irn_link(block);
257 if (new_block != NULL) {
258 set_nodes_block(node, new_block);
266 arity = get_irn_arity(node);
267 for (i = 0; i < arity; ++i) {
268 ir_node *in = get_irn_n(node, i);
269 ir_node *nw = (ir_node*)get_irn_link(in);
271 if (nw != NULL && nw != in) {
272 set_irn_n(node, i, nw);
281 set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
285 arity = get_irn_deps(node);
286 for (i = 0; i < arity; ++i) {
287 ir_node *in = get_irn_dep(node, i);
288 ir_node *nw = (ir_node*)get_irn_link(in);
290 if (nw != NULL && nw != in) {
291 set_irn_dep(node, i, nw);
300 identify_remember(node);
304 ir_node *be_pre_transform_node(ir_node *place)
309 return be_transform_node(place);
312 static void pre_transform_anchor(int anchor)
314 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
315 ir_node *transformed = be_transform_node(old_anchor_node);
316 set_irg_anchor(current_ir_graph, anchor, transformed);
319 static void kill_unused_anchor(int anchor)
321 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
322 ir_node *old_bad = get_irn_n(env.old_anchor, anchor_bad);
323 if (old_anchor_node != NULL && get_irn_n_edges(old_anchor_node) <= 1) {
324 set_irn_n(env.old_anchor, anchor, old_bad);
329 * Transforms all nodes. Deletes the old obstack and creates a new one.
331 static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform)
334 ir_node *old_end, *new_anchor;
336 hook_dead_node_elim(irg, 1);
338 inc_irg_visited(irg);
341 env.worklist = new_waitq();
342 env.old_anchor = irg->anchor;
344 old_end = get_irg_end(irg);
346 /* put all anchor nodes in the worklist */
347 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
348 ir_node *anchor = get_irg_anchor(irg, i);
352 waitq_put(env.worklist, anchor);
355 new_anchor = new_r_Anchor(irg);
356 irg->anchor = new_anchor;
358 /* pre transform some anchors (so they are available in the other transform
360 pre_transform_anchor(anchor_bad);
361 pre_transform_anchor(anchor_no_mem);
362 pre_transform_anchor(anchor_end_block);
363 pre_transform_anchor(anchor_end);
364 pre_transform_anchor(anchor_start_block);
365 pre_transform_anchor(anchor_start);
366 pre_transform_anchor(anchor_frame);
367 kill_unused_anchor(anchor_tls);
372 /* process worklist (this should transform all nodes in the graph) */
373 while (! waitq_empty(env.worklist)) {
374 ir_node *node = (ir_node*)waitq_get(env.worklist);
375 be_transform_node(node);
378 /* let beabi grab new nodes */
379 be_abi_transform_fixup(irg);
380 assert(waitq_empty(env.worklist)); // let's hope this didn't trigger new transforms
382 /* fix loops and set new anchors*/
383 inc_irg_visited(irg);
384 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
385 ir_node *anchor = get_irn_n(env.old_anchor, i);
390 anchor = (ir_node*)get_irn_link(anchor);
392 set_irn_n(new_anchor, i, anchor);
395 del_waitq(env.worklist);
397 hook_dead_node_elim(irg, 0);
400 void be_transform_graph(ir_graph *irg, arch_pretrans_nodes *func)
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(struct obstack);
411 obstack_init(new_obst);
412 irg->obst = new_obst;
413 irg->last_node_idx = 0;
415 /* invalidate phase info as (at least vrp info) is used inside the
416 * equivalent/compute_value functions and might replace our newly
417 * created nodes with middleend nodes */
418 irg_invalidate_phases(irg);
420 /* create new value table for CSE */
423 /* do the main transformation */
424 transform_nodes(irg, func);
426 /* free the old obstack */
427 obstack_free(old_obst, 0);
431 current_ir_graph = old_current_ir_graph;
433 /* most analysis info is wrong after transformation */
434 free_callee_info(irg);
437 free_loop_information(irg);
438 set_irg_doms_inconsistent(irg);
440 be_liveness_invalidate(be_get_irg_liveness(irg));
441 /* Hack for now, something is buggy with invalidate liveness... */
442 be_birg_from_irg(irg)->lv = NULL;
443 be_invalidate_dom_front(irg);
445 /* recalculate edges */
446 edges_deactivate(irg);
450 int be_mux_is_abs(ir_node *sel, ir_node *mux_true, ir_node *mux_false)
455 ir_relation relation;
461 * Note further that these optimization work even for floating point
462 * with NaN's because -NaN == NaN.
463 * However, if +0 and -0 is handled differently, we cannot use the Abs/-Abs
466 mode = get_irn_mode(mux_true);
467 if (mode_honor_signed_zeros(mode))
470 /* must be <, <=, >=, > */
471 relation = get_Cmp_relation(sel);
472 if ((relation & ir_relation_less_greater) == 0)
475 if (!ir_is_negated_value(mux_true, mux_false))
478 /* must be x cmp 0 */
479 cmp_right = get_Cmp_right(sel);
480 if (!is_Const(cmp_right) || !is_Const_null(cmp_right))
483 cmp_left = get_Cmp_left(sel);
484 if (cmp_left == mux_false) {
485 if (relation & ir_relation_less) {
488 assert(relation & ir_relation_greater);
491 } else if (cmp_left == mux_true) {
492 if (relation & ir_relation_less) {
495 assert(relation & ir_relation_greater);
503 ir_node *be_get_abs_op(ir_node *sel)
505 ir_node *cmp_left = get_Cmp_left(sel);