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
32 #include "irgraph_t.h"
40 #include "execfreq_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)
81 int deps = get_irn_deps(old_node);
82 for (int i = 0; i < deps; ++i) {
83 ir_node *dep = get_irn_dep(old_node, i);
84 ir_node *new_dep = be_transform_node(dep);
86 add_irn_dep(new_node, new_dep);
90 void be_set_transform_function(ir_op *op, be_transform_func func)
92 /* shouldn't be assigned twice (except for exchanging the default
93 * be_duplicate_node entries) */
94 assert(op->ops.generic == NULL
95 || op->ops.generic == (op_func) be_duplicate_node);
96 op->ops.generic = (op_func) func;
100 * Transform helper for blocks.
102 static ir_node *transform_block(ir_node *node)
104 ir_graph *irg = get_irn_irg(node);
105 dbg_info *dbgi = get_irn_dbg_info(node);
106 ir_mode *mode = get_irn_mode(node);
107 ir_node *block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), mode,
108 get_irn_arity(node), get_irn_in(node) + 1);
109 copy_node_attr(irg, node, block);
110 block->node_nr = node->node_nr;
112 /* transfer execfreq value */
113 double execfreq = get_block_execfreq(node);
114 set_block_execfreq(block, execfreq);
116 /* put the preds in the worklist */
117 be_enqueue_preds(node);
122 static ir_node *transform_end(ir_node *node)
124 /* end has to be duplicated manually because we need a dynamic in array */
125 ir_graph *irg = get_irn_irg(node);
126 dbg_info *dbgi = get_irn_dbg_info(node);
127 ir_node *block = be_transform_node(get_nodes_block(node));
128 ir_node *new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
129 copy_node_attr(irg, node, new_end);
130 be_duplicate_deps(node, new_end);
132 set_irg_end(irg, new_end);
134 /* do not transform predecessors yet to keep the pre-transform
135 * phase from visiting all the graph */
136 int arity = get_irn_arity(node);
137 for (int i = 0; i < arity; ++i) {
138 ir_node *in = get_irn_n(node, i);
139 add_End_keepalive(new_end, in);
141 be_enqueue_preds(node);
146 ir_node *be_duplicate_node(ir_node *node)
148 ir_node *block = be_transform_node(get_nodes_block(node));
149 ir_graph *irg = env.irg;
150 dbg_info *dbgi = get_irn_dbg_info(node);
151 ir_mode *mode = get_irn_mode(node);
152 ir_op *op = get_irn_op(node);
155 int arity = get_irn_arity(node);
156 if (op->opar == oparity_dynamic) {
157 new_node = new_ir_node(dbgi, irg, block, op, mode, -1, NULL);
158 for (int i = 0; i < arity; ++i) {
159 ir_node *in = get_irn_n(node, i);
160 in = be_transform_node(in);
161 add_irn_n(new_node, in);
164 ir_node **ins = ALLOCAN(ir_node*, arity);
165 for (int i = 0; i < arity; ++i) {
166 ir_node *in = get_irn_n(node, i);
167 ins[i] = be_transform_node(in);
170 new_node = new_ir_node(dbgi, irg, block, op, mode, arity, ins);
173 copy_node_attr(irg, node, new_node);
174 be_duplicate_deps(node, new_node);
176 new_node->node_nr = node->node_nr;
180 ir_node *be_transform_node(ir_node *node)
182 ir_node *new_node = be_get_transformed_node(node);
183 if (new_node != NULL)
186 DEBUG_ONLY(be_set_transformed_node(node, NULL);)
188 ir_op *op = get_irn_op(node);
189 if (op->ops.generic == NULL) {
190 panic("No transform function registered for node %+F.", node);
192 be_transform_func *transform = (be_transform_func *)op->ops.generic;
194 new_node = transform(node);
195 assert(new_node != NULL);
197 be_set_transformed_node(node, new_node);
201 void be_enqueue_preds(ir_node *node)
203 /* put the preds in the worklist */
204 int arity = get_irn_arity(node);
205 for (int i = 0; i < arity; ++i) {
206 ir_node *pred = get_irn_n(node, i);
207 pdeq_putr(env.worklist, pred);
212 * Rewire nodes which are potential loops (like Phis) to avoid endless loops.
214 static void fix_loops(ir_node *node)
216 assert(node_is_in_irgs_storage(env.irg, node));
218 if (irn_visited_else_mark(node))
221 bool changed = false;
222 if (! is_Block(node)) {
223 ir_node *block = get_nodes_block(node);
224 ir_node *new_block = (ir_node*)get_irn_link(block);
226 if (new_block != NULL) {
227 set_nodes_block(node, new_block);
235 int arity = get_irn_arity(node);
236 for (int i = 0; i < arity; ++i) {
237 ir_node *in = get_irn_n(node, i);
238 ir_node *nw = (ir_node*)get_irn_link(in);
240 if (nw != NULL && nw != in) {
241 set_irn_n(node, i, nw);
250 set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
254 arity = get_irn_deps(node);
255 for (int i = 0; i < arity; ++i) {
256 ir_node *in = get_irn_dep(node, i);
257 ir_node *nw = (ir_node*)get_irn_link(in);
259 if (nw != NULL && nw != in) {
260 set_irn_dep(node, i, nw);
269 identify_remember(node);
273 ir_node *be_pre_transform_node(ir_node *place)
278 return be_transform_node(place);
281 static void pre_transform_anchor(ir_graph *irg, int anchor)
283 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
284 ir_node *transformed = be_transform_node(old_anchor_node);
285 set_irg_anchor(irg, anchor, transformed);
289 * Transforms all nodes. Deletes the old obstack and creates a new one.
291 static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform)
293 hook_dead_node_elim(irg, 1);
295 inc_irg_visited(irg);
298 env.worklist = new_waitq();
299 env.old_anchor = irg->anchor;
301 ir_node *old_end = get_irg_end(irg);
303 /* put all anchor nodes in the worklist */
304 for (int i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
305 ir_node *anchor = get_irg_anchor(irg, i);
309 waitq_put(env.worklist, anchor);
312 ir_node *new_anchor = new_r_Anchor(irg);
313 irg->anchor = new_anchor;
315 /* pre transform some anchors (so they are available in the other transform
317 pre_transform_anchor(irg, anchor_no_mem);
318 pre_transform_anchor(irg, anchor_end_block);
319 pre_transform_anchor(irg, anchor_end);
320 pre_transform_anchor(irg, anchor_start_block);
321 pre_transform_anchor(irg, anchor_start);
322 pre_transform_anchor(irg, anchor_frame);
327 /* process worklist (this should transform all nodes in the graph) */
328 while (! waitq_empty(env.worklist)) {
329 ir_node *node = (ir_node*)waitq_get(env.worklist);
330 be_transform_node(node);
333 /* fix loops and set new anchors*/
334 inc_irg_visited(irg);
335 for (int i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
336 ir_node *anchor = get_irn_n(env.old_anchor, i);
341 anchor = (ir_node*)get_irn_link(anchor);
343 set_irn_n(new_anchor, i, anchor);
346 del_waitq(env.worklist);
348 hook_dead_node_elim(irg, 0);
351 void be_transform_graph(ir_graph *irg, arch_pretrans_nodes *func)
353 ir_graph *old_current_ir_graph = current_ir_graph;
354 current_ir_graph = irg;
356 /* create a new obstack */
357 struct obstack *old_obst = irg->obst;
358 struct obstack *new_obst = XMALLOC(struct obstack);
359 obstack_init(new_obst);
360 irg->obst = new_obst;
361 irg->last_node_idx = 0;
365 /* create new value table for CSE */
368 /* do the main transformation */
369 transform_nodes(irg, func);
371 /* free the old obstack */
372 obstack_free(old_obst, 0);
376 current_ir_graph = old_current_ir_graph;
378 /* most analysis info is wrong after transformation */
379 be_invalidate_live_chk(irg);
380 confirm_irg_properties(irg, IR_GRAPH_PROPERTIES_NONE);
382 /* recalculate edges */
386 bool be_upper_bits_clean(const ir_node *node, ir_mode *mode)
388 ir_op *op = get_irn_op(node);
389 if (op->ops.generic1 == NULL)
391 upper_bits_clean_func func = (upper_bits_clean_func)op->ops.generic1;
392 return func(node, mode);
395 static bool bit_binop_upper_bits_clean(const ir_node *node, ir_mode *mode)
397 return be_upper_bits_clean(get_binop_left(node), mode)
398 && be_upper_bits_clean(get_binop_right(node), mode);
401 static bool mux_upper_bits_clean(const ir_node *node, ir_mode *mode)
403 return be_upper_bits_clean(get_Mux_true(node), mode)
404 && be_upper_bits_clean(get_Mux_false(node), mode);
407 static bool and_upper_bits_clean(const ir_node *node, ir_mode *mode)
409 if (!mode_is_signed(mode)) {
410 return be_upper_bits_clean(get_And_left(node), mode)
411 || be_upper_bits_clean(get_And_right(node), mode);
413 return bit_binop_upper_bits_clean(node, mode);
417 static bool shr_upper_bits_clean(const ir_node *node, ir_mode *mode)
419 if (mode_is_signed(mode)) {
423 const ir_node *right = get_Shr_right(node);
424 if (is_Const(right)) {
425 ir_tarval *tv = get_Const_tarval(right);
426 long val = get_tarval_long(tv);
427 if (val >= 32 - (long)get_mode_size_bits(mode))
430 return be_upper_bits_clean(get_Shr_left(node), mode);
434 static bool shrs_upper_bits_clean(const ir_node *node, ir_mode *mode)
436 return be_upper_bits_clean(get_Shrs_left(node), mode);
439 static bool const_upper_bits_clean(const ir_node *node, ir_mode *mode)
441 ir_tarval *tv = get_Const_tarval(node);
442 long val = get_tarval_long(tv);
443 if (mode_is_signed(mode)) {
444 long shifted = val >> (get_mode_size_bits(mode)-1);
445 return shifted == 0 || shifted == -1;
447 unsigned long shifted = (unsigned long)val;
448 shifted >>= get_mode_size_bits(mode)-1;
454 static bool conv_upper_bits_clean(const ir_node *node, ir_mode *mode)
456 ir_mode *dest_mode = get_irn_mode(node);
457 const ir_node *op = get_Conv_op(node);
458 ir_mode *src_mode = get_irn_mode(op);
459 if (mode_is_float(src_mode))
462 unsigned src_bits = get_mode_size_bits(src_mode);
463 unsigned dest_bits = get_mode_size_bits(dest_mode);
464 /* downconvs are a nop */
465 if (src_bits >= dest_bits)
466 return be_upper_bits_clean(op, mode);
467 /* upconvs are fine if src is big enough or if sign matches */
468 if (src_bits <= get_mode_size_bits(mode)
469 && mode_is_signed(src_mode) == mode_is_signed(mode))
474 static bool proj_upper_bits_clean(const ir_node *node, ir_mode *mode)
476 const ir_node *pred = get_Proj_pred(node);
477 switch (get_irn_opcode(pred)) {
479 ir_mode *load_mode = get_Load_mode(pred);
480 unsigned load_bits = get_mode_size_bits(load_mode);
481 if (load_bits > get_mode_size_bits(mode))
483 if (mode_is_signed(load_mode) != mode_is_signed(mode))
493 void be_set_upper_bits_clean_function(ir_op *op, upper_bits_clean_func func)
495 op->ops.generic1 = (op_func)func;
498 void be_start_transform_setup(void)
500 ir_clear_opcodes_generic_func();
502 be_set_transform_function(op_Bad, be_duplicate_node);
503 be_set_transform_function(op_be_Copy, be_duplicate_node);
504 be_set_transform_function(op_be_CopyKeep, be_duplicate_node);
505 be_set_transform_function(op_be_IncSP, be_duplicate_node);
506 be_set_transform_function(op_be_Keep, be_duplicate_node);
507 be_set_transform_function(op_be_Return, be_duplicate_node);
508 be_set_transform_function(op_be_Start, be_duplicate_node);
509 be_set_transform_function(op_Block, transform_block);
510 be_set_transform_function(op_End, transform_end);
511 be_set_transform_function(op_NoMem, be_duplicate_node);
512 be_set_transform_function(op_Pin, be_duplicate_node);
513 be_set_transform_function(op_Start, be_duplicate_node);
514 be_set_transform_function(op_Sync, be_duplicate_node);
516 be_set_upper_bits_clean_function(op_And, and_upper_bits_clean);
517 be_set_upper_bits_clean_function(op_Const, const_upper_bits_clean);
518 be_set_upper_bits_clean_function(op_Conv, conv_upper_bits_clean);
519 be_set_upper_bits_clean_function(op_Eor, bit_binop_upper_bits_clean);
520 be_set_upper_bits_clean_function(op_Mux, mux_upper_bits_clean);
521 be_set_upper_bits_clean_function(op_Or, bit_binop_upper_bits_clean);
522 be_set_upper_bits_clean_function(op_Proj, proj_upper_bits_clean);
523 be_set_upper_bits_clean_function(op_Shr, shr_upper_bits_clean);
524 be_set_upper_bits_clean_function(op_Shrs, shrs_upper_bits_clean);