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 ir_node *be_transform_phi(ir_node *node, const arch_register_req_t *req)
92 ir_node *block = be_transform_node(get_nodes_block(node));
93 ir_graph *irg = current_ir_graph;
94 dbg_info *dbgi = get_irn_dbg_info(node);
96 /* phi nodes allow loops, so we use the old arguments for now
97 * and fix this later */
98 ir_node **ins = get_irn_in(node)+1;
99 int arity = get_irn_arity(node);
100 ir_mode *mode = req->cls != NULL ? req->cls->mode : get_irn_mode(node);
101 ir_node *phi = new_ir_node(dbgi, irg, block, op_Phi, mode, arity, ins);
102 copy_node_attr(irg, node, phi);
103 be_duplicate_deps(node, phi);
105 backend_info_t *info = be_get_info(phi);
106 struct obstack *obst = be_get_be_obst(irg);
107 info->in_reqs = OALLOCN(obst, const arch_register_req_t*, arity);
108 for (int i = 0; i < arity; ++i) {
109 info->in_reqs[i] = req;
112 arch_set_irn_register_req_out(phi, 0, req);
113 be_enqueue_preds(node);
118 void be_set_transform_function(ir_op *op, be_transform_func func)
120 /* shouldn't be assigned twice (except for exchanging the default
121 * be_duplicate_node entries) */
122 assert(op->ops.generic == NULL
123 || op->ops.generic == (op_func) be_duplicate_node);
124 op->ops.generic = (op_func) func;
128 * Transform helper for blocks.
130 static ir_node *transform_block(ir_node *node)
132 ir_graph *irg = get_irn_irg(node);
133 dbg_info *dbgi = get_irn_dbg_info(node);
134 ir_mode *mode = get_irn_mode(node);
135 ir_node *block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), mode,
136 get_irn_arity(node), get_irn_in(node) + 1);
137 copy_node_attr(irg, node, block);
138 block->node_nr = node->node_nr;
140 /* transfer execfreq value */
141 double execfreq = get_block_execfreq(node);
142 set_block_execfreq(block, execfreq);
144 /* put the preds in the worklist */
145 be_enqueue_preds(node);
150 static ir_node *transform_end(ir_node *node)
152 /* end has to be duplicated manually because we need a dynamic in array */
153 ir_graph *irg = get_irn_irg(node);
154 dbg_info *dbgi = get_irn_dbg_info(node);
155 ir_node *block = be_transform_node(get_nodes_block(node));
156 ir_node *new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
157 copy_node_attr(irg, node, new_end);
158 be_duplicate_deps(node, new_end);
160 set_irg_end(irg, new_end);
162 /* do not transform predecessors yet to keep the pre-transform
163 * phase from visiting all the graph */
164 int arity = get_irn_arity(node);
165 for (int i = 0; i < arity; ++i) {
166 ir_node *in = get_irn_n(node, i);
167 add_End_keepalive(new_end, in);
169 be_enqueue_preds(node);
174 ir_node *be_duplicate_node(ir_node *node)
176 ir_node *block = be_transform_node(get_nodes_block(node));
177 ir_graph *irg = env.irg;
178 dbg_info *dbgi = get_irn_dbg_info(node);
179 ir_mode *mode = get_irn_mode(node);
180 ir_op *op = get_irn_op(node);
183 int arity = get_irn_arity(node);
184 if (op->opar == oparity_dynamic) {
185 new_node = new_ir_node(dbgi, irg, block, op, mode, -1, NULL);
186 for (int i = 0; i < arity; ++i) {
187 ir_node *in = get_irn_n(node, i);
188 in = be_transform_node(in);
189 add_irn_n(new_node, in);
192 ir_node **ins = ALLOCAN(ir_node*, arity);
193 for (int i = 0; i < arity; ++i) {
194 ir_node *in = get_irn_n(node, i);
195 ins[i] = be_transform_node(in);
198 new_node = new_ir_node(dbgi, irg, block, op, mode, arity, ins);
201 copy_node_attr(irg, node, new_node);
202 be_duplicate_deps(node, new_node);
204 new_node->node_nr = node->node_nr;
208 ir_node *be_transform_node(ir_node *node)
210 ir_node *new_node = be_get_transformed_node(node);
211 if (new_node != NULL)
214 DEBUG_ONLY(be_set_transformed_node(node, NULL);)
216 ir_op *op = get_irn_op(node);
217 if (op->ops.generic == NULL) {
218 panic("No transform function registered for node %+F.", node);
220 be_transform_func *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)
231 /* put the preds in the worklist */
232 int arity = get_irn_arity(node);
233 for (int 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)
244 assert(node_is_in_irgs_storage(env.irg, node));
246 if (irn_visited_else_mark(node))
249 bool changed = false;
250 if (! is_Block(node)) {
251 ir_node *block = get_nodes_block(node);
252 ir_node *new_block = (ir_node*)get_irn_link(block);
254 if (new_block != NULL) {
255 set_nodes_block(node, new_block);
263 int arity = get_irn_arity(node);
264 for (int i = 0; i < arity; ++i) {
265 ir_node *in = get_irn_n(node, i);
266 ir_node *nw = (ir_node*)get_irn_link(in);
268 if (nw != NULL && nw != in) {
269 set_irn_n(node, i, nw);
278 set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
282 arity = get_irn_deps(node);
283 for (int i = 0; i < arity; ++i) {
284 ir_node *in = get_irn_dep(node, i);
285 ir_node *nw = (ir_node*)get_irn_link(in);
287 if (nw != NULL && nw != in) {
288 set_irn_dep(node, i, nw);
297 identify_remember(node);
301 ir_node *be_pre_transform_node(ir_node *place)
306 return be_transform_node(place);
309 static void pre_transform_anchor(ir_graph *irg, int anchor)
311 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
312 ir_node *transformed = be_transform_node(old_anchor_node);
313 set_irg_anchor(irg, anchor, transformed);
317 * Transforms all nodes. Deletes the old obstack and creates a new one.
319 static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform)
321 hook_dead_node_elim(irg, 1);
323 inc_irg_visited(irg);
326 env.worklist = new_waitq();
327 env.old_anchor = irg->anchor;
329 ir_node *old_end = get_irg_end(irg);
331 /* put all anchor nodes in the worklist */
332 for (int i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
333 ir_node *anchor = get_irg_anchor(irg, i);
337 waitq_put(env.worklist, anchor);
340 ir_node *new_anchor = new_r_Anchor(irg);
341 irg->anchor = new_anchor;
343 /* pre transform some anchors (so they are available in the other transform
345 pre_transform_anchor(irg, anchor_no_mem);
346 pre_transform_anchor(irg, anchor_end_block);
347 pre_transform_anchor(irg, anchor_end);
348 pre_transform_anchor(irg, anchor_start_block);
349 pre_transform_anchor(irg, anchor_start);
350 pre_transform_anchor(irg, anchor_frame);
355 /* process worklist (this should transform all nodes in the graph) */
356 while (! waitq_empty(env.worklist)) {
357 ir_node *node = (ir_node*)waitq_get(env.worklist);
358 be_transform_node(node);
361 /* fix loops and set new anchors*/
362 inc_irg_visited(irg);
363 for (int i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
364 ir_node *anchor = get_irn_n(env.old_anchor, i);
369 anchor = (ir_node*)get_irn_link(anchor);
371 set_irn_n(new_anchor, i, anchor);
374 del_waitq(env.worklist);
376 hook_dead_node_elim(irg, 0);
379 void be_transform_graph(ir_graph *irg, arch_pretrans_nodes *func)
381 ir_graph *old_current_ir_graph = current_ir_graph;
382 current_ir_graph = irg;
384 /* create a new obstack */
385 struct obstack *old_obst = irg->obst;
386 struct obstack *new_obst = XMALLOC(struct obstack);
387 obstack_init(new_obst);
388 irg->obst = new_obst;
389 irg->last_node_idx = 0;
393 /* create new value table for CSE */
396 /* do the main transformation */
397 transform_nodes(irg, func);
399 /* free the old obstack */
400 obstack_free(old_obst, 0);
404 current_ir_graph = old_current_ir_graph;
406 /* most analysis info is wrong after transformation */
407 be_invalidate_live_chk(irg);
408 confirm_irg_properties(irg, IR_GRAPH_PROPERTIES_NONE);
410 /* recalculate edges */
414 bool be_upper_bits_clean(const ir_node *node, ir_mode *mode)
416 ir_op *op = get_irn_op(node);
417 if (op->ops.generic1 == NULL)
419 upper_bits_clean_func func = (upper_bits_clean_func)op->ops.generic1;
420 return func(node, mode);
423 static bool bit_binop_upper_bits_clean(const ir_node *node, ir_mode *mode)
425 return be_upper_bits_clean(get_binop_left(node), mode)
426 && be_upper_bits_clean(get_binop_right(node), mode);
429 static bool mux_upper_bits_clean(const ir_node *node, ir_mode *mode)
431 return be_upper_bits_clean(get_Mux_true(node), mode)
432 && be_upper_bits_clean(get_Mux_false(node), mode);
435 static bool and_upper_bits_clean(const ir_node *node, ir_mode *mode)
437 if (!mode_is_signed(mode)) {
438 return be_upper_bits_clean(get_And_left(node), mode)
439 || be_upper_bits_clean(get_And_right(node), mode);
441 return bit_binop_upper_bits_clean(node, mode);
445 static bool shr_upper_bits_clean(const ir_node *node, ir_mode *mode)
447 if (mode_is_signed(mode)) {
450 const ir_node *right = get_Shr_right(node);
451 if (is_Const(right)) {
452 ir_tarval *tv = get_Const_tarval(right);
453 long val = get_tarval_long(tv);
454 if (val >= 32 - (long)get_mode_size_bits(mode))
457 return be_upper_bits_clean(get_Shr_left(node), mode);
461 static bool shrs_upper_bits_clean(const ir_node *node, ir_mode *mode)
463 return be_upper_bits_clean(get_Shrs_left(node), mode);
466 static bool const_upper_bits_clean(const ir_node *node, ir_mode *mode)
468 ir_tarval *tv = get_Const_tarval(node);
469 long val = get_tarval_long(tv);
470 if (mode_is_signed(mode)) {
471 long shifted = val >> (get_mode_size_bits(mode)-1);
472 return shifted == 0 || shifted == -1;
474 unsigned long shifted = (unsigned long)val;
475 shifted >>= get_mode_size_bits(mode)-1;
481 static bool conv_upper_bits_clean(const ir_node *node, ir_mode *mode)
483 ir_mode *dest_mode = get_irn_mode(node);
484 const ir_node *op = get_Conv_op(node);
485 ir_mode *src_mode = get_irn_mode(op);
486 if (mode_is_float(src_mode))
489 unsigned src_bits = get_mode_size_bits(src_mode);
490 unsigned dest_bits = get_mode_size_bits(dest_mode);
491 /* downconvs are a nop */
492 if (src_bits >= dest_bits)
493 return be_upper_bits_clean(op, mode);
494 /* upconvs are fine if src is big enough or if sign matches */
495 if (src_bits <= get_mode_size_bits(mode)
496 && mode_is_signed(src_mode) == mode_is_signed(mode))
501 static bool proj_upper_bits_clean(const ir_node *node, ir_mode *mode)
503 const ir_node *pred = get_Proj_pred(node);
504 switch (get_irn_opcode(pred)) {
506 ir_mode *load_mode = get_Load_mode(pred);
507 unsigned load_bits = get_mode_size_bits(load_mode);
508 if (load_bits > get_mode_size_bits(mode))
510 if (mode_is_signed(load_mode) != mode_is_signed(mode))
520 void be_set_upper_bits_clean_function(ir_op *op, upper_bits_clean_func func)
522 op->ops.generic1 = (op_func)func;
525 void be_start_transform_setup(void)
527 ir_clear_opcodes_generic_func();
529 be_set_transform_function(op_Bad, be_duplicate_node);
530 be_set_transform_function(op_be_Copy, be_duplicate_node);
531 be_set_transform_function(op_be_CopyKeep, be_duplicate_node);
532 be_set_transform_function(op_be_IncSP, be_duplicate_node);
533 be_set_transform_function(op_be_Keep, be_duplicate_node);
534 be_set_transform_function(op_be_Return, be_duplicate_node);
535 be_set_transform_function(op_be_Start, be_duplicate_node);
536 be_set_transform_function(op_Block, transform_block);
537 be_set_transform_function(op_End, transform_end);
538 be_set_transform_function(op_NoMem, be_duplicate_node);
539 be_set_transform_function(op_Pin, be_duplicate_node);
540 be_set_transform_function(op_Start, be_duplicate_node);
541 be_set_transform_function(op_Sync, be_duplicate_node);
543 be_set_upper_bits_clean_function(op_And, and_upper_bits_clean);
544 be_set_upper_bits_clean_function(op_Const, const_upper_bits_clean);
545 be_set_upper_bits_clean_function(op_Conv, conv_upper_bits_clean);
546 be_set_upper_bits_clean_function(op_Eor, bit_binop_upper_bits_clean);
547 be_set_upper_bits_clean_function(op_Mux, mux_upper_bits_clean);
548 be_set_upper_bits_clean_function(op_Or, bit_binop_upper_bits_clean);
549 be_set_upper_bits_clean_function(op_Proj, proj_upper_bits_clean);
550 be_set_upper_bits_clean_function(op_Shr, shr_upper_bits_clean);
551 be_set_upper_bits_clean_function(op_Shrs, shrs_upper_bits_clean);