nsz Git - libfirm/blob - ir/ana/irconsconfirm.c

   1 /*
   2  * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
   3  *
   4  * This file is part of libFirm.
   5  *
   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.
  10  *
  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.
  14  *
  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
  17  * PURPOSE.
  18  */
  19
  20 /**
  21  * @file
  22  * @brief    Construction of Confirm nodes
  23  * @author   Michael Beck
  24  * @date     6.2005
  25  * @version  $Id$
  26  */
  27 #include "config.h"
  28
  29 #include "irconsconfirm.h"
  30
  31 #include "irgraph_t.h"
  32 #include "irnode_t.h"
  33 #include "ircons_t.h"
  34 #include "irgmod.h"
  35 #include "iropt_dbg.h"
  36 #include "iredges_t.h"
  37 #include "irgwalk.h"
  38 #include "irprintf.h"
  39 #include "irgopt.h"
  40 #include "irpass.h"
  41 #include "irtools.h"
  42 #include "array_t.h"
  43 #include "debug.h"
  44 #include "irflag.h"
  45
  46 /**
  47  * Walker environment.
  48  */
  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. */
  54 } env_t;
  55
  56 /** The debug handle. */
  57 DEBUG_ONLY(static firm_dbg_module_t *dbg;)
  58
  59 /**
  60  * Return the effective use block of a node and it's predecessor on
  61  * position pos.
  62  *
  63  * @param node  the node
  64  * @param pos   the position of the used input
  65  *
  66  * This handles correctly Phi nodes.
  67  */
  68 static ir_node *get_effective_use_block(ir_node *node, int pos)
  69 {
  70         if (is_Phi(node)) {
  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);
  74         }
  75         return get_nodes_block(node);
  76 }
  77
  78 /**
  79  * Handle a CASE-branch.
  80  *
  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
  85  *
  86  * Branch labels are a simple case. We can replace the value
  87  * by a Const with the branch label.
  88  */
  89 static void handle_case(ir_node *block, ir_node *irn, long nr, env_t *env)
  90 {
  91         const ir_edge_t *edge, *next;
  92         ir_node *c = NULL;
  93
  94         if (is_Bad(irn))
  95                 return;
  96
  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);
 101
 102                 next = get_irn_out_edge_next(irn, edge);
 103
 104                 if (block_dominates(block, blk)) {
 105                         /*
 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
 109                          * branch label.
 110                          */
 111
 112                         if (! c) {
 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);
 117                         }
 118
 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));
 122
 123                         env->num_consts += 1;
 124                 }
 125         }
 126 }  /* handle_case */
 127
 128 /**
 129  * Handle a mode_b input of Cond nodes.
 130  *
 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
 135  */
 136 static void handle_modeb(ir_node *block, ir_node *selector, pn_Cond pnc, env_t *env)
 137 {
 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;
 141
 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);
 146
 147                 next = get_irn_out_edge_next(selector, edge);
 148                 if (block_dominates(block, user_blk)) {
 149                         /*
 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.
 153                          */
 154                         if (con == NULL) {
 155                                 ir_graph *irg = get_irn_irg(block);
 156                                 con = new_r_Const(irg, pnc == pn_Cond_true ? tarval_b_true : tarval_b_false);
 157                         }
 158                         old = get_irn_n(user, pos);
 159                         set_irn_n(user, pos, con);
 160                         DBG_OPT_CONFIRM_C(old, con);
 161
 162                         DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, user, con));
 163
 164                         env->num_consts += 1;
 165                 } else {
 166                         int i, n;
 167
 168                         /* get the other block */
 169                         if (other_blk == NULL) {
 170                                 /* we have already tested, that block has only ONE Cond predecessor */
 171                                 cond = get_Proj_pred(get_Block_cfgpred(block, 0));
 172                                 foreach_out_edge(cond, edge) {
 173                                         ir_node *proj = get_edge_src_irn(edge);
 174                                         if (get_Proj_proj(proj) == (long)pnc)
 175                                                 continue;
 176                                         edge = get_irn_out_edge_first(proj);
 177                                         other_blk = get_edge_src_irn(edge);
 178                                         break;
 179                                 }
 180                                 assert(other_blk);
 181
 182                                 /*
 183                                  * Note the special case here: if block is a then, there might be no else
 184                                  * block. In that case the other_block is the user_blk itself and pred_block
 185                                  * is the cond_block ...
 186                                  *
 187                                  * Best would be to introduce a block here, removing this critical edge.
 188                                  * For some reasons I cannot repair dominance here, so I have to remove
 189                                  * ALL critical edges...
 190                                  * FIXME: This should not be needed if we could repair dominance ...
 191                                  */
 192                         }
 193
 194                         n = get_Block_n_cfgpreds(user_blk);
 195
 196                         /*
 197                          * We have found a user in a non-dominated block:
 198                          * check, if all its block predecessors are dominated.
 199                          * If yes, place a Phi.
 200                          */
 201                         for (i = n - 1; i >= 0; --i) {
 202                                 ir_node *pred_blk = get_Block_cfgpred_block(user_blk, i);
 203
 204                                 if (!block_dominates(block, pred_blk) &&
 205                                     !block_dominates(other_blk, pred_blk)) {
 206                                         /* can't do anything */
 207                                         break;
 208                                 }
 209                         }
 210                         if (i < 0) {
 211                                 ir_node *phi, **in;
 212
 213                                 NEW_ARR_A(ir_node *, in, n);
 214                                 /* ok, ALL predecessors are either dominated by block OR other block */
 215                                 if (c_b == NULL) {
 216                                         ir_graph *irg    = get_irn_irg(block);
 217                                         ir_node *c_true  = new_r_Const(irg, tarval_b_true);
 218                                         ir_node *c_false = new_r_Const(irg, tarval_b_false);
 219                                         env->num_consts += 2;
 220                                         if (pnc == pn_Cond_true) {
 221                                                 c_b = c_true;
 222                                                 c_o = c_false;
 223                                         } else {
 224                                                 c_b = c_false;
 225                                                 c_o = c_true;
 226                                         }
 227                                 }
 228                                 for (i = n - 1; i >= 0; --i) {
 229                                         ir_node *pred_blk = get_Block_cfgpred_block(user_blk, i);
 230
 231                                         if (block_dominates(block, pred_blk))
 232                                                 in[i] = c_b;
 233                                         else
 234                                                 in[i] = c_o;
 235                                 }
 236                                 phi = new_r_Phi(user_blk, n, in, mode_b);
 237                                 set_irn_n(user, pos, phi);
 238                                 env->num_eq += 1;
 239                         }
 240                 }
 241         }
 242 }
 243
 244 /**
 245  * Handle an IF-branch.
 246  *
 247  * @param block   the block which is entered by the branch
 248  * @param cmp     the Cmp node expressing the branch condition
 249  * @param pnc     the Compare relation for taking this branch
 250  * @param env     statistical environment
 251  */
 252 static void handle_if(ir_node *block, ir_node *cmp, pn_Cmp pnc, env_t *env)
 253 {
 254         ir_node *left  = get_Cmp_left(cmp);
 255         ir_node *right = get_Cmp_right(cmp);
 256         ir_node *cond_block;
 257         ir_op *op;
 258         const ir_edge_t *edge, *next;
 259
 260         /* Beware of Bads */
 261         if (is_Bad(left) || is_Bad(right))
 262                 return;
 263
 264         op = get_irn_op(left);
 265
 266         /* Do not create Confirm nodes for Cmp(Const, Const) constructs.
 267            These are removed anyway */
 268         if (op == op_Const && is_Const(right))
 269                 return;
 270
 271         /* try to place the constant on the right side for a Confirm */
 272         if (op == op_Const || op == op_SymConst) {
 273                 ir_node *t = left;
 274
 275                 left  = right;
 276                 right = t;
 277
 278                 pnc = get_inversed_pnc(pnc);
 279         }
 280
 281         /*
 282          * First case: both values are identical.
 283          * replace the left one by the right (potentially const) one.
 284          */
 285         if (pnc == pn_Cmp_Eq) {
 286                 cond_block = get_Block_cfgpred_block(block, 0);
 287                 for (edge = get_irn_out_edge_first(left); edge; edge = next) {
 288                         ir_node *user = get_edge_src_irn(edge);
 289                         int     pos   = get_edge_src_pos(edge);
 290                         ir_node *blk  = get_effective_use_block(user, pos);
 291
 292                         next = get_irn_out_edge_next(left, edge);
 293                         if (block_dominates(block, blk)) {
 294                                 /*
 295                                  * Ok, we found a usage of left in a block
 296                                  * dominated by the branch block.
 297                                  * We can replace the input with right.
 298                                  */
 299                                 set_irn_n(user, pos, right);
 300                                 DBG_OPT_CONFIRM(left, right);
 301
 302                                 DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, user, right));
 303
 304                                 env->num_eq += 1;
 305                         } else if (block_dominates(blk, cond_block)
 306                                         && is_Const(right)
 307                                         && get_irn_pinned(user) == op_pin_state_floats) {
 308                                 /*
 309                                  * left == Const and we found a movable user of left in a
 310                                  * dominator of the Cond block
 311                                  */
 312                                 const ir_edge_t *edge, *next;
 313                                 for (edge = get_irn_out_edge_first(user); edge; edge = next) {
 314                                         ir_node *usr_of_usr = get_edge_src_irn(edge);
 315                                         int      npos = get_edge_src_pos(edge);
 316                                         ir_node *blk  = get_effective_use_block(usr_of_usr, npos);
 317
 318                                         next = get_irn_out_edge_next(user, edge);
 319                                         if (block_dominates(block, blk)) {
 320                                                 /*
 321                                                  * The user of the user is dominated by our true/false
 322                                                  * block. So, create a copy of user WITH the constant
 323                                                  * replacing it's pos'th input.
 324                                                  *
 325                                                  * This is always good for unop's and might be good
 326                                                  * for binops.
 327                                                  *
 328                                                  * If user has other user in the false/true block, code
 329                                                  * placement will move it down.
 330                                                  * If there are users in cond block or upper, we create
 331                                                  * "redundant ops", because one will have a const op,
 332                                                  * the other no const ...
 333                                                  */
 334                                                 ir_node *new_op = exact_copy(user);
 335                                                 set_nodes_block(new_op, block);
 336                                                 set_irn_n(new_op, pos, right);
 337                                                 set_irn_n(usr_of_usr, npos, new_op);
 338                                                 env->num_eq += 1;
 339                                         }
 340                                 }
 341                         }
 342                 }
 343         } else { /* not pn_Cmp_Eq cases */
 344                 ir_node *c = NULL;
 345
 346                 foreach_out_edge_safe(left, edge, next) {
 347                         ir_node *succ = get_edge_src_irn(edge);
 348                         int     pos   = get_edge_src_pos(edge);
 349                         ir_node *blk  = get_effective_use_block(succ, pos);
 350
 351                         if (block_dominates(block, blk)) {
 352                                 /*
 353                                  * Ok, we found a usage of left in a block
 354                                  * dominated by the branch block.
 355                                  * We can replace the input with a Confirm(left, pnc, right).
 356                                  */
 357                                 if (! c)
 358                                         c = new_r_Confirm(block, left, right, pnc);
 359
 360                                 pos = get_edge_src_pos(edge);
 361                                 set_irn_n(succ, pos, c);
 362                                 DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, succ, c));
 363
 364                                 env->num_confirms += 1;
 365                         }
 366                 }
 367
 368                 if (! is_Const(right)) {
 369                         /* also construct inverse Confirms */
 370                         ir_node *rc = NULL;
 371
 372                         pnc = get_inversed_pnc(pnc);
 373                         foreach_out_edge_safe(right, edge, next) {
 374                                 ir_node *succ = get_edge_src_irn(edge);
 375                                 int     pos;
 376                                 ir_node *blk;
 377
 378                                 if (succ == c)
 379                                         continue;
 380
 381                                 pos  = get_edge_src_pos(edge);
 382                                 blk  = get_effective_use_block(succ, pos);
 383
 384                                 if (block_dominates(block, blk)) {
 385                                         /*
 386                                          * Ok, we found a usage of right in a block
 387                                          * dominated by the branch block.
 388                                          * We can replace the input with a Confirm(right, pnc^-1, left).
 389                                          */
 390                                         if (! rc)
 391                                                 rc = new_r_Confirm(block, right, left, pnc);
 392
 393                                         pos = get_edge_src_pos(edge);
 394                                         set_irn_n(succ, pos, rc);
 395                                         DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, succ, rc));
 396
 397                                         env->num_confirms += 1;
 398                                 }
 399                         }
 400                 }
 401         }
 402 }  /* handle_if */
 403
 404 /**
 405  * Pre-block-walker: Called for every block to insert Confirm nodes
 406  */
 407 static void insert_Confirm_in_block(ir_node *block, void *env)
 408 {
 409         ir_node *cond, *proj, *selector;
 410         ir_mode *mode;
 411
 412         /*
 413          * we can only handle blocks with only ONE control flow
 414          * predecessor yet.
 415          */
 416         if (get_Block_n_cfgpreds(block) != 1)
 417                 return;
 418
 419         proj = get_Block_cfgpred(block, 0);
 420         if (! is_Proj(proj))
 421                 return;
 422
 423         cond = get_Proj_pred(proj);
 424         if (! is_Cond(cond))
 425                 return;
 426
 427         selector = get_Cond_selector(cond);
 428         mode = get_irn_mode(selector);
 429
 430         if (mode == mode_b) {
 431                 ir_node *cmp;
 432                 pn_Cmp pnc;
 433
 434                 handle_modeb(block, selector, get_Proj_proj(proj), env);
 435
 436                 /* this should be an IF, check this */
 437                 if (! is_Proj(selector))
 438                         return;
 439
 440                 cmp = get_Proj_pred(selector);
 441                 if (! is_Cmp(cmp))
 442                         return;
 443
 444                 pnc = get_Proj_proj(selector);
 445
 446                 if (get_Proj_proj(proj) != pn_Cond_true) {
 447                         /* it's the false branch */
 448                         mode = get_irn_mode(get_Cmp_left(cmp));
 449                         pnc = get_negated_pnc(pnc, mode);
 450                 }
 451                 DB((dbg, LEVEL_2, "At %+F using %+F Confirm %=\n", block, cmp, pnc));
 452
 453                 handle_if(block, cmp, pnc, env);
 454         } else if (mode_is_int(mode)) {
 455                 long proj_nr = get_Proj_proj(proj);
 456
 457                 /* this is a CASE, but we cannot handle the default case */
 458                 if (proj_nr == get_Cond_default_proj(cond))
 459                         return;
 460
 461                 handle_case(block, get_Cond_selector(cond), proj_nr, env);
 462         }
 463 }  /* insert_Confirm_in_block */
 464
 465 /**
 466  * Checks if a node is a non-null Confirm.
 467  */
 468 static int is_non_null_Confirm(const ir_node *ptr)
 469 {
 470         for (;;) {
 471                 if (! is_Confirm(ptr))
 472                         break;
 473                 if (get_Confirm_cmp(ptr) == pn_Cmp_Lg) {
 474                         ir_node *bound = get_Confirm_bound(ptr);
 475
 476                         if (is_Const(bound) && is_Const_null(bound))
 477                                 return 1;
 478                 }
 479                 ptr = get_Confirm_value(ptr);
 480         }
 481         /*
 482          * While a SymConst is not a Confirm, it is non-null
 483          * anyway. This helps to reduce the number of
 484          * constructed Confirms.
 485          */
 486         if (is_SymConst_addr_ent(ptr))
 487                 return 1;
 488         return 0;
 489 }  /* is_non_null_Confirm */
 490
 491 /**
 492  * The given pointer will be dereferenced, add non-null Confirms.
 493  *
 494  * @param ptr    a node representing an address
 495  * @param block  the block of the dereferencing instruction
 496  * @param env    environment
 497  */
 498 static void insert_non_null(ir_node *ptr, ir_node *block, env_t *env)
 499 {
 500         const ir_edge_t *edge, *next;
 501         ir_node         *c = NULL;
 502
 503         foreach_out_edge_safe(ptr, edge, next) {
 504                 ir_node *succ = get_edge_src_irn(edge);
 505                 int     pos;
 506                 ir_node *blk;
 507
 508
 509                 /* for now, we place a Confirm only in front of a Cmp */
 510                 if (! is_Cmp(succ))
 511                         continue;
 512
 513                 pos = get_edge_src_pos(edge);
 514                 blk = get_effective_use_block(succ, pos);
 515
 516                 if (block_dominates(block, blk)) {
 517                         /*
 518                          * Ok, we found a usage of ptr in a block
 519                          * dominated by the Load/Store block.
 520                          * We can replace the input with a Confirm(ptr, !=, NULL).
 521                          */
 522                         if (c == NULL) {
 523                                 ir_mode  *mode = get_irn_mode(ptr);
 524                                 ir_graph *irg  = get_irn_irg(block);
 525                                 c = new_r_Const(irg, get_mode_null(mode));
 526                                 c = new_r_Confirm(block, ptr, c, pn_Cmp_Lg);
 527                         }
 528
 529                         set_irn_n(succ, pos, c);
 530                         DB((dbg, LEVEL_2, "Replacing input %d of node %+F with %+F\n", pos, succ, c));
 531
 532                         env->num_non_null += 1;
 533                         env->num_confirms += 1;
 534                 }
 535         }
 536 }  /* insert_non_null */
 537
 538 /**
 539  * Pre-walker: Called for every node to insert Confirm nodes
 540  */
 541 static void insert_Confirm(ir_node *node, void *env)
 542 {
 543         ir_node *ptr;
 544
 545         switch (get_irn_opcode(node)) {
 546         case iro_Block:
 547                 insert_Confirm_in_block(node, env);
 548                 break;
 549         case iro_Load:
 550                 ptr = get_Load_ptr(node);
 551                 if (! is_non_null_Confirm(ptr))
 552                         insert_non_null(ptr, get_nodes_block(node), env);
 553                 break;
 554         case iro_Store:
 555                 ptr = get_Store_ptr(node);
 556                 if (! is_non_null_Confirm(ptr))
 557                         insert_non_null(ptr, get_nodes_block(node), env);
 558                 break;
 559         default:
 560                 break;
 561         }
 562 }  /* insert_Confirm */
 563
 564 /*
 565  * Construct Confirm nodes
 566  */
 567 void construct_confirms(ir_graph *irg)
 568 {
 569         env_t env;
 570         int edges_active = edges_activated(irg);
 571
 572         FIRM_DBG_REGISTER(dbg, "firm.ana.confirm");
 573
 574         remove_critical_cf_edges(irg);
 575
 576         /* we need dominance info */
 577         assure_doms(irg);
 578
 579         assert(get_irg_pinned(irg) == op_pin_state_pinned &&
 580                "Nodes must be placed to insert Confirms");
 581
 582         if (! edges_active) {
 583                 /* We need edges */
 584                 edges_activate(irg);
 585         }
 586
 587         env.num_confirms = 0;
 588         env.num_consts   = 0;
 589         env.num_eq       = 0;
 590         env.num_non_null = 0;
 591
 592         if (get_opt_global_null_ptr_elimination()) {
 593                 /* do global NULL test elimination */
 594                 irg_walk_graph(irg, insert_Confirm, NULL, &env);
 595         } else {
 596                 /* now, visit all blocks and add Confirms where possible */
 597                 irg_block_walk_graph(irg, insert_Confirm_in_block, NULL, &env);
 598         }
 599
 600         if (env.num_confirms | env.num_consts | env.num_eq) {
 601                 /* we have add nodes or changed DF edges */
 602                 set_irg_outs_inconsistent(irg);
 603
 604                 /* the new nodes are not in the loop info */
 605                 set_irg_loopinfo_inconsistent(irg);
 606         }
 607
 608         DB((dbg, LEVEL_1, "# Confirms inserted : %u\n", env.num_confirms));
 609         DB((dbg, LEVEL_1, "# Const replacements: %u\n", env.num_consts));
 610         DB((dbg, LEVEL_1, "# node equalities   : %u\n", env.num_eq));
 611         DB((dbg, LEVEL_1, "# non-null Confirms : %u\n", env.num_non_null));
 612
 613         /* deactivate edges if they where off */
 614         if (! edges_active)
 615                 edges_deactivate(irg);
 616 }  /* construct_confirms */
 617
 618 /* Construct a pass. */
 619 ir_graph_pass_t *construct_confirms_pass(const char *name)
 620 {
 621         return def_graph_pass(name ? name : "confirm", construct_confirms);
 622 }  /* construct_confirms_pass */
 623
 624 static void remove_confirm(ir_node *n, void *env)
 625 {
 626         ir_node *value;
 627
 628         (void) env;
 629         if (!is_Confirm(n))
 630                 return;
 631
 632         value = get_Confirm_value(n);
 633         exchange(n, value);
 634 }
 635
 636 /*
 637  * Remove all Confirm nodes from a graph.
 638  */
 639 void remove_confirms(ir_graph *irg)
 640 {
 641         irg_walk_graph(irg, NULL, remove_confirm, NULL);
 642 }  /* remove_confirms */
 643
 644 /* Construct a pass. */
 645 ir_graph_pass_t *remove_confirms_pass(const char *name)
 646 {
 647         return def_graph_pass(name ? name : "rem_confirm", remove_confirms);
 648 }  /* remove_confirms_pass */