2 * Copyright (C) 1995-2008 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 Construction of Confirm nodes
23 * @author Michael Beck
29 #include "irconsconfirm.h"
31 #include "irgraph_t.h"
35 #include "iropt_dbg.h"
36 #include "iredges_t.h"
49 typedef struct _env_t {
50 unsigned num_confirms; /**< Number of inserted Confirm nodes. */
51 unsigned num_consts; /**< Number of constants placed. */
52 unsigned num_eq; /**< Number of equalities placed. */
53 unsigned num_non_null; /**< Number of non-null Confirms. */
56 /** The debug handle. */
57 DEBUG_ONLY(static firm_dbg_module_t *dbg;)
60 * Return the effective use block of a node and it's predecessor on
63 * @param node the node
64 * @param pos the position of the used input
66 * This handles correctly Phi nodes.
68 static ir_node *get_effective_use_block(ir_node *node, int pos)
71 /* the effective use of a Phi argument is in its predecessor block */
72 node = get_nodes_block(node);
73 return get_Block_cfgpred_block(node, pos);
75 return get_nodes_block(node);
79 * Handle a CASE-branch.
81 * @param block the block which is entered by the branch
82 * @param irn the node expressing the switch value
83 * @param nr the branch label
84 * @param env statistical environment
86 * Branch labels are a simple case. We can replace the value
87 * by a Const with the branch label.
89 static void handle_case(ir_node *block, ir_node *irn, long nr, env_t *env)
91 const ir_edge_t *edge, *next;
97 for (edge = get_irn_out_edge_first(irn); edge; edge = next) {
98 ir_node *succ = get_edge_src_irn(edge);
99 int pos = get_edge_src_pos(edge);
100 ir_node *blk = get_effective_use_block(succ, pos);
102 next = get_irn_out_edge_next(irn, edge);
104 if (block_dominates(block, blk)) {
106 * Ok, we found a user of irn that is placed
107 * in a block dominated by the branch block.
108 * We can replace the input with the Constant
113 ir_mode *mode = get_irn_mode(irn);
114 ir_type *tp = get_irn_type(irn);
115 tarval *tv = new_tarval_from_long(nr, mode);
116 c = new_r_Const_type(current_ir_graph, tv, tp);
119 set_irn_n(succ, pos, c);
120 DBG_OPT_CONFIRM_C(irn, c);
121 DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, succ, c));
123 env->num_consts += 1;
129 * Handle a mode_b input of Cond nodes.
131 * @param block the block which is entered by the branch
132 * @param selector the mode_b node expressing the branch condition
133 * @param pnc the true/false condition branch
134 * @param env statistical environment
136 static void handle_modeb(ir_node *block, ir_node *selector, pn_Cond pnc, env_t *env)
138 ir_node *cond, *old, *other_blk = NULL, *con = NULL;
139 ir_node *c_b = NULL, *c_o = NULL;
140 const ir_edge_t *edge, *next;
142 for (edge = get_irn_out_edge_first(selector); edge; edge = next) {
143 ir_node *user = get_edge_src_irn(edge);
144 int pos = get_edge_src_pos(edge);
145 ir_node *user_blk = get_effective_use_block(user, pos);
147 next = get_irn_out_edge_next(selector, edge);
148 if (block_dominates(block, user_blk)) {
150 * Ok, we found a usage of selector in a block
151 * dominated by the branch block.
152 * We can replace the input with true/false.
155 con = new_Const(pnc == pn_Cond_true ? tarval_b_true : tarval_b_false);
157 old = get_irn_n(user, pos);
158 set_irn_n(user, pos, con);
159 DBG_OPT_CONFIRM_C(old, con);
161 DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, user, con));
163 env->num_consts += 1;
167 /* get the other block */
168 if (other_blk == NULL) {
169 /* we have already tested, that block has only ONE Cond predecessor */
170 cond = get_Proj_pred(get_Block_cfgpred(block, 0));
171 foreach_out_edge(cond, edge) {
172 ir_node *proj = get_edge_src_irn(edge);
173 if (get_Proj_proj(proj) == (long)pnc)
175 edge = get_irn_out_edge_first(proj);
176 other_blk = get_edge_src_irn(edge);
182 * Note the special case here: if block is a then, there might be no else
183 * block. In that case the other_block is the user_blk itself and pred_block
184 * is the cond_block ...
186 * Best would be to introduce a block here, removing this critical edge.
187 * For some reasons I cannot repair dominance here, so I have to remove
188 * ALL critical edges...
189 * FIXME: This should not be needed if we could repair dominance ...
193 n = get_Block_n_cfgpreds(user_blk);
196 * We have found a user in a non-dominated block:
197 * check, if all its block predecessors are dominated.
198 * If yes, place a Phi.
200 for (i = n - 1; i >= 0; --i) {
201 ir_node *pred_blk = get_Block_cfgpred_block(user_blk, i);
203 if (!block_dominates(block, pred_blk) &&
204 !block_dominates(other_blk, pred_blk)) {
205 /* can't do anything */
212 NEW_ARR_A(ir_node *, in, n);
213 /* ok, ALL predecessors are either dominated by block OR other block */
215 ir_node *c_true = new_Const(tarval_b_true);
216 ir_node *c_false = new_Const(tarval_b_false);
217 env->num_consts += 2;
218 if (pnc == pn_Cond_true) {
226 for (i = n - 1; i >= 0; --i) {
227 ir_node *pred_blk = get_Block_cfgpred_block(user_blk, i);
229 if (block_dominates(block, pred_blk))
234 phi = new_r_Phi(user_blk, n, in, mode_b);
235 set_irn_n(user, pos, phi);
243 * Handle an IF-branch.
245 * @param block the block which is entered by the branch
246 * @param cmp the Cmp node expressing the branch condition
247 * @param pnc the Compare relation for taking this branch
248 * @param env statistical environment
250 static void handle_if(ir_node *block, ir_node *cmp, pn_Cmp pnc, env_t *env)
252 ir_node *left = get_Cmp_left(cmp);
253 ir_node *right = get_Cmp_right(cmp);
256 const ir_edge_t *edge, *next;
259 if (is_Bad(left) || is_Bad(right))
262 op = get_irn_op(left);
264 /* Do not create Confirm nodes for Cmp(Const, Const) constructs.
265 These are removed anyway */
266 if (op == op_Const && is_Const(right))
269 /* try to place the constant on the right side for a Confirm */
270 if (op == op_Const || op == op_SymConst) {
276 pnc = get_inversed_pnc(pnc);
280 * First case: both values are identical.
281 * replace the left one by the right (potentially const) one.
283 if (pnc == pn_Cmp_Eq) {
284 cond_block = get_Block_cfgpred_block(block, 0);
285 for (edge = get_irn_out_edge_first(left); edge; edge = next) {
286 ir_node *user = get_edge_src_irn(edge);
287 int pos = get_edge_src_pos(edge);
288 ir_node *blk = get_effective_use_block(user, pos);
290 next = get_irn_out_edge_next(left, edge);
291 if (block_dominates(block, blk)) {
293 * Ok, we found a usage of left in a block
294 * dominated by the branch block.
295 * We can replace the input with right.
297 set_irn_n(user, pos, right);
298 DBG_OPT_CONFIRM(left, right);
300 DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, user, right));
303 } else if (block_dominates(blk, cond_block)
305 && get_irn_pinned(user) == op_pin_state_floats) {
307 * left == Const and we found a movable user of left in a
308 * dominator of the Cond block
310 const ir_edge_t *edge, *next;
311 for (edge = get_irn_out_edge_first(user); edge; edge = next) {
312 ir_node *usr_of_usr = get_edge_src_irn(edge);
313 int npos = get_edge_src_pos(edge);
314 ir_node *blk = get_effective_use_block(usr_of_usr, npos);
316 next = get_irn_out_edge_next(user, edge);
317 if (block_dominates(block, blk)) {
319 * The user of the user is dominated by our true/false
320 * block. So, create a copy of user WITH the constant
321 * replacing it's pos'th input.
323 * This is always good for unop's and might be good
326 * If user has other user in the false/true block, code
327 * placement will move it down.
328 * If there are users in cond block or upper, we create
329 * "redundant ops", because one will have a const op,
330 * the other no const ...
332 ir_node *new_op = exact_copy(user);
333 set_nodes_block(new_op, block);
334 set_irn_n(new_op, pos, right);
335 set_irn_n(usr_of_usr, npos, new_op);
341 } else { /* not pn_Cmp_Eq cases */
344 foreach_out_edge_safe(left, edge, next) {
345 ir_node *succ = get_edge_src_irn(edge);
346 int pos = get_edge_src_pos(edge);
347 ir_node *blk = get_effective_use_block(succ, pos);
349 if (block_dominates(block, blk)) {
351 * Ok, we found a usage of left in a block
352 * dominated by the branch block.
353 * We can replace the input with a Confirm(left, pnc, right).
356 c = new_r_Confirm(block, left, right, pnc);
358 pos = get_edge_src_pos(edge);
359 set_irn_n(succ, pos, c);
360 DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, succ, c));
362 env->num_confirms += 1;
366 if (! is_Const(right)) {
367 /* also construct inverse Confirms */
370 pnc = get_inversed_pnc(pnc);
371 foreach_out_edge_safe(right, edge, next) {
372 ir_node *succ = get_edge_src_irn(edge);
379 pos = get_edge_src_pos(edge);
380 blk = get_effective_use_block(succ, pos);
382 if (block_dominates(block, blk)) {
384 * Ok, we found a usage of right in a block
385 * dominated by the branch block.
386 * We can replace the input with a Confirm(right, pnc^-1, left).
389 rc = new_r_Confirm(block, right, left, pnc);
391 pos = get_edge_src_pos(edge);
392 set_irn_n(succ, pos, rc);
393 DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, succ, rc));
395 env->num_confirms += 1;
403 * Pre-block-walker: Called for every block to insert Confirm nodes
405 static void insert_Confirm_in_block(ir_node *block, void *env)
407 ir_node *cond, *proj, *selector;
411 * we can only handle blocks with only ONE control flow
414 if (get_Block_n_cfgpreds(block) != 1)
417 proj = get_Block_cfgpred(block, 0);
421 cond = get_Proj_pred(proj);
425 selector = get_Cond_selector(cond);
426 mode = get_irn_mode(selector);
428 if (mode == mode_b) {
432 handle_modeb(block, selector, get_Proj_proj(proj), env);
434 /* this should be an IF, check this */
435 if (! is_Proj(selector))
438 cmp = get_Proj_pred(selector);
442 pnc = get_Proj_proj(selector);
444 if (get_Proj_proj(proj) != pn_Cond_true) {
445 /* it's the false branch */
446 mode = get_irn_mode(get_Cmp_left(cmp));
447 pnc = get_negated_pnc(pnc, mode);
449 DB((dbg, LEVEL_2, "At %+F using %+F Confirm %=\n", block, cmp, pnc));
451 handle_if(block, cmp, pnc, env);
452 } else if (mode_is_int(mode)) {
453 long proj_nr = get_Proj_proj(proj);
455 /* this is a CASE, but we cannot handle the default case */
456 if (proj_nr == get_Cond_default_proj(cond))
459 handle_case(block, get_Cond_selector(cond), proj_nr, env);
461 } /* insert_Confirm_in_block */
464 * Checks if a node is a non-null Confirm.
466 static int is_non_null_Confirm(const ir_node *ptr)
469 if (! is_Confirm(ptr))
471 if (get_Confirm_cmp(ptr) == pn_Cmp_Lg) {
472 ir_node *bound = get_Confirm_bound(ptr);
474 if (is_Const(bound) && is_Const_null(bound))
477 ptr = get_Confirm_value(ptr);
480 * While a SymConst is not a Confirm, it is non-null
481 * anyway. This helps to reduce the number of
482 * constructed Confirms.
484 if (is_SymConst_addr_ent(ptr))
487 } /* is_non_null_Confirm */
490 * The given pointer will be dereferenced, add non-null Confirms.
492 * @param ptr a node representing an address
493 * @param block the block of the dereferencing instruction
494 * @param env environment
496 static void insert_non_null(ir_node *ptr, ir_node *block, env_t *env)
498 const ir_edge_t *edge, *next;
501 foreach_out_edge_safe(ptr, edge, next) {
502 ir_node *succ = get_edge_src_irn(edge);
507 /* for now, we place a Confirm only in front of a Cmp */
511 pos = get_edge_src_pos(edge);
512 blk = get_effective_use_block(succ, pos);
514 if (block_dominates(block, blk)) {
516 * Ok, we found a usage of ptr in a block
517 * dominated by the Load/Store block.
518 * We can replace the input with a Confirm(ptr, !=, NULL).
521 ir_mode *mode = get_irn_mode(ptr);
522 c = new_Const(get_mode_null(mode));
524 c = new_r_Confirm(block, ptr, c, pn_Cmp_Lg);
527 set_irn_n(succ, pos, c);
528 DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, succ, c));
530 env->num_non_null += 1;
531 env->num_confirms += 1;
534 } /* insert_non_null */
537 * Pre-walker: Called for every node to insert Confirm nodes
539 static void insert_Confirm(ir_node *node, void *env)
543 switch (get_irn_opcode(node)) {
545 insert_Confirm_in_block(node, env);
548 ptr = get_Load_ptr(node);
549 if (! is_non_null_Confirm(ptr))
550 insert_non_null(ptr, get_nodes_block(node), env);
553 ptr = get_Store_ptr(node);
554 if (! is_non_null_Confirm(ptr))
555 insert_non_null(ptr, get_nodes_block(node), env);
560 } /* insert_Confirm */
563 * Construct Confirm nodes
565 void construct_confirms(ir_graph *irg)
568 int edges_active = edges_activated(irg);
570 FIRM_DBG_REGISTER(dbg, "firm.ana.confirm");
572 remove_critical_cf_edges(irg);
574 /* we need dominance info */
577 assert(get_irg_pinned(irg) == op_pin_state_pinned &&
578 "Nodes must be placed to insert Confirms");
580 if (! edges_active) {
585 env.num_confirms = 0;
588 env.num_non_null = 0;
590 if (get_opt_global_null_ptr_elimination()) {
591 /* do global NULL test elimination */
592 irg_walk_graph(irg, insert_Confirm, NULL, &env);
594 /* now, visit all blocks and add Confirms where possible */
595 irg_block_walk_graph(irg, insert_Confirm_in_block, NULL, &env);
598 if (env.num_confirms | env.num_consts | env.num_eq) {
599 /* we have add nodes or changed DF edges */
600 set_irg_outs_inconsistent(irg);
602 /* the new nodes are not in the loop info */
603 set_irg_loopinfo_inconsistent(irg);
606 DB((dbg, LEVEL_1, "# Confirms inserted : %u\n", env.num_confirms));
607 DB((dbg, LEVEL_1, "# Const replacements: %u\n", env.num_consts));
608 DB((dbg, LEVEL_1, "# node equalities : %u\n", env.num_eq));
609 DB((dbg, LEVEL_1, "# non-null Confirms : %u\n", env.num_non_null));
611 /* deactivate edges if they where off */
613 edges_deactivate(irg);
614 } /* construct_confirms */
616 /* Construct a pass. */
617 ir_graph_pass_t *construct_confirms_pass(const char *name)
619 return def_graph_pass(name ? name : "confirm", construct_confirms);
620 } /* construct_confirms_pass */
624 * Post-walker: Remove Confirm nodes
626 static void rem_Confirm(ir_node *n, void *env)
630 ir_node *value = get_Confirm_value(n);
635 * Strange: a Confirm is its own bound. This can happen
636 * in dead blocks when Phi nodes are already removed.
638 exchange(n, new_Bad());
645 * Remove all Confirm nodes from a graph.
647 void remove_confirms(ir_graph *irg)
649 int rem = get_opt_remove_confirm();
651 set_opt_remove_confirm(1);
652 optimize_graph_df(irg);
653 set_opt_remove_confirm(rem);
654 } /* remove_confirms */
656 /* Construct a pass. */
657 ir_graph_pass_t *remove_confirms_pass(const char *name)
659 return def_graph_pass(name ? name : "rem_confirm", remove_confirms);
660 } /* remove_confirms_pass */