nsz Git - libfirm/blob - ir/be/bessaconstr.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       SSA construction for a set of nodes
  23  * @author      Sebastian Hack, Daniel Grund, Matthias Braun, Christian Wuerdig,
  24  *              Sebastian Buchwald
  25  * @date        04.05.2005
  26  *
  27  * The problem: Given a value and a set of "copies" that are known to
  28  * represent the same abstract value, rewire all usages of the original value
  29  * to their closest copy while introducing phis as necessary.
  30  *
  31  * Algorithm: Mark all blocks in the iterated dominance frontiers of the value
  32  * and its copies. Link the copies ordered by dominance to the blocks.  Then
  33  * we search for each use all definitions in the current block, if none is
  34  * found, then we search one in the immediate dominator. If we are in a block
  35  * of the dominance frontier, create a phi and do the same search for all
  36  * phi arguments.
  37  *
  38  * A copy in this context means, that you want to introduce several new
  39  * abstract values (in Firm: nodes) for which you know, that they
  40  * represent the same concrete value. This is the case if you
  41  * - copy
  42  * - spill and reload
  43  * - re-materialize
  44  * a value.
  45  *
  46  * This function reroutes all uses of the original value to the copies in the
  47  * corresponding dominance subtrees and creates Phi functions where necessary.
  48  */
  49 #include "config.h"
  50
  51 /* statev in this file is extensive, so only enable if needed */
  52 #define DISABLE_STATEV
  53
  54 #include "bessaconstr.h"
  55 #include "bemodule.h"
  56 #include "besched.h"
  57 #include "beintlive_t.h"
  58 #include "beirg.h"
  59 #include "be_t.h"
  60 #include "benode.h"
  61
  62 #include "debug.h"
  63 #include "error.h"
  64 #include "pdeq.h"
  65 #include "array.h"
  66 #include "irdom.h"
  67 #include "irnodeset.h"
  68
  69 #include "ircons.h"
  70 #include "iredges_t.h"
  71
  72 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
  73
  74 static ir_node *search_def_end_of_block(be_ssa_construction_env_t *env,
  75                                         ir_node *block);
  76
  77 struct constr_info {
  78         bool is_definition     : 1;
  79         bool is_use            : 1;
  80         bool already_processed : 1;
  81         union {
  82                 /* Since we only consider scheduled nodes,
  83                  * this points to the real definition (e.g. a Proj). */
  84                 ir_node *definition;
  85
  86                 /* Last definition of a block. */
  87                 ir_node *last_definition;
  88         };
  89 };
  90
  91 typedef struct constr_info constr_info;
  92
  93 /**
  94  * @return Whether the block contains a definition.
  95  */
  96 static bool has_definition(const ir_node *block)
  97 {
  98         return irn_visited(block);
  99 }
 100
 101 static constr_info *get_or_set_info(be_ssa_construction_env_t *env,
 102                                     const ir_node *node)
 103 {
 104         constr_info *info = (constr_info*)ir_nodemap_get(&env->infos, node);
 105         if (info == NULL) {
 106                 info = OALLOCZ(&env->obst, constr_info);
 107                 ir_nodemap_insert(&env->infos, node, info);
 108         }
 109         return info;
 110 }
 111
 112 static constr_info *get_info(const be_ssa_construction_env_t *env,
 113                              const ir_node *node)
 114 {
 115         return (constr_info*)ir_nodemap_get(&env->infos, node);
 116 }
 117
 118 /**
 119  * @return Whether the block contains a use.
 120  */
 121 static inline bool has_use(be_ssa_construction_env_t *env, ir_node *block)
 122 {
 123         constr_info *info = get_or_set_info(env, block);
 124         return info->is_use;
 125 }
 126
 127 /**
 128  * @return Whether the node is a definition.
 129  */
 130 static bool is_definition(be_ssa_construction_env_t *env, ir_node *node)
 131 {
 132         constr_info *info = get_info(env, node);
 133         return info != NULL && info->is_definition;
 134 }
 135
 136 /**
 137  * @return Whether the node is a use.
 138  */
 139 static bool is_use(const be_ssa_construction_env_t *env, ir_node *node)
 140 {
 141         constr_info *info = get_info(env, node);
 142         return info != NULL && info->is_use;
 143 }
 144
 145 /**
 146  * Introduces a definition at the corresponding block.
 147  */
 148 static void introduce_definition(be_ssa_construction_env_t *env, ir_node *def)
 149 {
 150         ir_node     *block      = get_nodes_block(def);
 151         constr_info *def_info   = get_or_set_info(env, def);
 152         ir_node     *skip       = skip_Proj(def);
 153         constr_info *skip_info  = get_or_set_info(env, skip);
 154         constr_info *block_info = get_or_set_info(env, block);
 155
 156         DBG((dbg, LEVEL_2, "\tintroducing definition %+F in %+F\n", def, block));
 157
 158         def_info->is_definition = true;
 159
 160         skip_info->is_definition = true;
 161         skip_info->definition    = def;
 162
 163         // Set the last definition if we only introduce one definition for the block
 164         if (has_definition(block)) {
 165                 assert(!block_info->already_processed);
 166                 block_info->last_definition = NULL;
 167         } else {
 168                 mark_irn_visited(block);
 169                 block_info->last_definition = def;
 170         }
 171 }
 172
 173 static void introduce_use(be_ssa_construction_env_t *env, ir_node *use)
 174 {
 175         ir_node     *block      = get_nodes_block(use);
 176         constr_info *info       = get_or_set_info(env, use);
 177         constr_info *block_info = get_or_set_info(env, block);
 178
 179         DBG((dbg, LEVEL_2, "\tintroducing use %+F in %+F\n", use, block));
 180
 181         info->is_use       = true;
 182         block_info->is_use = true;
 183
 184         waitq_put(env->worklist, use);
 185 }
 186
 187 /**
 188  * Calculates the iterated dominance frontier of a set of blocks. Marks the
 189  * blocks as visited. Sets the link fields of the blocks in the dominance
 190  * frontier to the block itself.
 191  */
 192 static void mark_iterated_dominance_frontiers(
 193                                            const be_ssa_construction_env_t *env)
 194 {
 195         stat_ev_cnt_decl(blocks);
 196         DBG((dbg, LEVEL_3, "Dominance Frontier:"));
 197         stat_ev_tim_push();
 198         while (!waitq_empty(env->worklist)) {
 199                 int i;
 200                 ir_node  *block    = (ir_node*)waitq_get(env->worklist);
 201                 ir_node **domfront = be_get_dominance_frontier(env->domfronts, block);
 202                 int domfront_len = ARR_LEN(domfront);
 203
 204                 for (i = 0; i < domfront_len; ++i) {
 205                         ir_node *y = domfront[i];
 206                         if (Block_block_visited(y))
 207                                 continue;
 208
 209                         if (!irn_visited(y)) {
 210                                 set_irn_link(y, NULL);
 211                                 waitq_put(env->worklist, y);
 212                         }
 213
 214                         DBG((dbg, LEVEL_3, " %+F", y));
 215                         mark_Block_block_visited(y);
 216                         stat_ev_cnt_inc(blocks);
 217                 }
 218         }
 219         stat_ev_tim_pop("bessaconstr_idf_time");
 220         stat_ev_cnt_done(blocks, "bessaconstr_idf_blocks");
 221         DBG((dbg, LEVEL_3, "\n"));
 222 }
 223
 224 /**
 225  * Inserts a new phi at the given block.
 226  *
 227  * The constructed phi has only Dummy operands,
 228  * but can be used as definition for other nodes.
 229  *
 230  * @see fix_phi_arguments
 231  */
 232 static ir_node *insert_dummy_phi(be_ssa_construction_env_t *env, ir_node *block)
 233 {
 234         int i, n_preds = get_Block_n_cfgpreds(block);
 235         ir_graph *irg = get_Block_irg(block);
 236         ir_node **ins = ALLOCAN(ir_node*, n_preds);
 237         ir_node  *dummy;
 238         ir_node  *phi;
 239
 240         DBG((dbg, LEVEL_3, "\t...create phi at block %+F\n", block));
 241
 242         assert(n_preds > 1);
 243
 244         dummy = new_r_Dummy(irg, env->mode);
 245         for (i = 0; i < n_preds; ++i) {
 246                 ins[i] = dummy;
 247         }
 248         phi = be_new_Phi(block, n_preds, ins, env->mode, env->phi_req);
 249         sched_add_after(block, phi);
 250         ARR_APP1(ir_node*, env->new_phis, phi);
 251
 252         DBG((dbg, LEVEL_2, "\tcreating phi %+F in %+F\n", phi, block));
 253         introduce_definition(env, phi);
 254
 255         waitq_put(env->worklist, phi);
 256
 257         return phi;
 258 }
 259
 260 /**
 261  * @return Last definition of the immediate dominator.
 262  */
 263 static ir_node *get_def_at_idom(be_ssa_construction_env_t *env, ir_node *block)
 264 {
 265         ir_node *dom = get_Block_idom(block);
 266         assert(dom != NULL);
 267         DBG((dbg, LEVEL_3, "\t...continue at idom %+F\n", dom));
 268         return search_def_end_of_block(env, dom);
 269 }
 270
 271 /**
 272  * Fixes all operands of a use.
 273  *
 274  * If an operand of the use is a (original) definition,
 275  * it will be replaced by the given definition.
 276  */
 277 static void set_operands(be_ssa_construction_env_t *env, ir_node *use, ir_node *def)
 278 {
 279         constr_info *info  = get_info(env, use);
 280         int          arity = get_irn_arity(use);
 281         int          i;
 282
 283         for (i = 0; i < arity; ++i) {
 284                 ir_node *op = get_irn_n(use, i);
 285
 286                 if (is_definition(env, op)) {
 287                         DBG((dbg, LEVEL_1, "\t...%+F(%d) -> %+F\n", use, i, def));
 288                         set_irn_n(use, i, def);
 289                 }
 290         }
 291
 292         info->already_processed = true;
 293 }
 294
 295 /**
 296  * Fixes all uses of the given block.
 297  */
 298 static void process_block(be_ssa_construction_env_t *env, ir_node *block)
 299 {
 300         ir_node     *node;
 301         ir_node     *def        = NULL;
 302         constr_info *block_info = get_or_set_info(env, block);
 303
 304         assert(has_definition(block));
 305         assert(!block_info->already_processed && "Block already processed");
 306
 307         DBG((dbg, LEVEL_3, "\tprocessing block  %+F\n", block));
 308
 309         sched_foreach(block, node) {
 310                 if (is_use(env, node) && !is_Phi(node)) {
 311                         DBG((dbg, LEVEL_3, "\t...found use %+F\n", node));
 312
 313                         if (def == NULL) {
 314                                 /* Create a phi if the block is in the dominance frontier. */
 315                                 if (Block_block_visited(block)) {
 316                                         def = insert_dummy_phi(env, block);
 317                                 }
 318                                 else {
 319                                         def = get_def_at_idom(env, block);
 320                                 }
 321                         }
 322
 323                         set_operands(env, node, def);
 324                 }
 325
 326                 if (is_definition(env, node)) {
 327                         constr_info *info = get_info(env, node);
 328                         def = info->definition;
 329                         DBG((dbg, LEVEL_3, "\t...found definition %+F\n", def));
 330                 }
 331         }
 332
 333         block_info->already_processed = true;
 334         block_info->last_definition   = def;
 335 }
 336
 337 /**
 338  * @return Last definition of the given block.
 339  */
 340 static ir_node *search_def_end_of_block(be_ssa_construction_env_t *env,
 341                                         ir_node *block)
 342 {
 343         constr_info *block_info      = get_or_set_info(env, block);
 344         ir_node     *last_definition = block_info->last_definition;
 345
 346         if (last_definition != NULL)
 347                 return last_definition;
 348
 349         if (has_definition(block)) {
 350                 if (has_use(env, block)) {
 351                         if (!block_info->already_processed) {
 352                                 process_block(env, block);
 353                         }
 354                 }
 355                 else {
 356                         ir_node *def = NULL;
 357
 358                         /* Search the last definition of the block. */
 359                         sched_foreach_reverse(block, def) {
 360                                 if (is_definition(env, def)) {
 361                                         constr_info *info = get_info(env, def);
 362                                         def = info->definition;
 363                                         DBG((dbg, LEVEL_3, "\t...found definition %+F\n", def));
 364
 365                                         break;
 366                                 }
 367                         }
 368
 369                         assert(def && "No definition found");
 370
 371                         block_info->last_definition = def;
 372                 }
 373
 374                 return block_info->last_definition;
 375         } else if (Block_block_visited(block)) {
 376                 ir_node *phi = insert_dummy_phi(env, block);
 377
 378                 block_info->last_definition = phi;
 379
 380                 return phi;
 381         } else {
 382                 ir_node *def = get_def_at_idom(env, block);
 383
 384                 block_info->last_definition = def;
 385
 386                 return def;
 387         }
 388 }
 389
 390 /**
 391  * Fixes all operands of the given use.
 392  */
 393 static void search_def_at_block(be_ssa_construction_env_t *env, ir_node *use)
 394 {
 395         ir_node     *block      = get_nodes_block(use);
 396         constr_info *block_info = get_or_set_info(env, block);
 397
 398         if (block_info->already_processed)
 399                 return;
 400
 401         if (has_definition(block)) {
 402                 process_block(env, block);
 403         } else if (Block_block_visited(block)) {
 404                 ir_node *phi = insert_dummy_phi(env, block);
 405
 406                 set_operands(env, use, phi);
 407         } else {
 408                 ir_node *def = get_def_at_idom(env, block);
 409
 410                 set_operands(env, use, def);
 411         }
 412 }
 413
 414 void be_ssa_construction_init(be_ssa_construction_env_t *env, ir_graph *irg)
 415 {
 416         ir_node *sb   = get_irg_start_block(irg);
 417         int n_blocks  = get_Block_dom_max_subtree_pre_num(sb);
 418
 419         stat_ev_ctx_push_fobj("bessaconstr", irg);
 420         stat_ev_tim_push();
 421
 422         (void) n_blocks;
 423         stat_ev_dbl("bessaconstr_n_blocks", n_blocks);
 424
 425         memset(env, 0, sizeof(env[0]));
 426         be_assure_dom_front(irg);
 427
 428         env->irg       = irg;
 429         env->domfronts = be_get_irg_dom_front(irg);
 430         env->new_phis  = NEW_ARR_F(ir_node*, 0);
 431         env->worklist  = new_waitq();
 432         ir_nodemap_init(&env->infos, irg);
 433         obstack_init(&env->obst);
 434
 435         ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED
 436                         | IR_RESOURCE_BLOCK_VISITED | IR_RESOURCE_IRN_LINK);
 437
 438         /* we use the visited flag to indicate blocks in the dominance frontier
 439          * and blocks that already have the relevant value at the end calculated */
 440         inc_irg_visited(irg);
 441         /* We use the block visited flag to indicate blocks in the dominance
 442          * frontier of some values (and this potentially needing phis) */
 443         inc_irg_block_visited(irg);
 444 }
 445
 446 void be_ssa_construction_destroy(be_ssa_construction_env_t *env)
 447 {
 448         stat_ev_int("bessaconstr_phis", ARR_LEN(env->new_phis));
 449         obstack_free(&env->obst, NULL);
 450         ir_nodemap_destroy(&env->infos);
 451         del_waitq(env->worklist);
 452         DEL_ARR_F(env->new_phis);
 453
 454         ir_free_resources(env->irg, IR_RESOURCE_IRN_VISITED
 455                         | IR_RESOURCE_BLOCK_VISITED | IR_RESOURCE_IRN_LINK);
 456
 457         stat_ev_tim_pop("bessaconstr_total_time");
 458         stat_ev_ctx_pop("bessaconstr");
 459 }
 460
 461 static void determine_phi_req(be_ssa_construction_env_t *env, ir_node *value)
 462 {
 463         const arch_register_req_t *req   = arch_get_irn_register_req(value);
 464         env->mode = get_irn_mode(value);
 465         if (req->width == 1) {
 466                 env->phi_req = req->cls->class_req;
 467         } else {
 468                 /* construct a new register req... */
 469                 ir_graph            *irg     = get_irn_irg(value);
 470                 struct obstack      *obst    = be_get_be_obst(irg);
 471                 arch_register_req_t *new_req = OALLOCZ(obst, arch_register_req_t);
 472                 new_req->cls   = req->cls;
 473                 new_req->type  = req->type & arch_register_req_type_aligned;
 474                 new_req->width = req->width;
 475                 env->phi_req = new_req;
 476         }
 477 }
 478
 479 void be_ssa_construction_add_copy(be_ssa_construction_env_t *env,
 480                                   ir_node *copy)
 481 {
 482         ir_node *block;
 483
 484         assert(env->iterated_domfront_calculated == 0);
 485
 486         if (env->mode == NULL) {
 487                 determine_phi_req(env, copy);
 488         } else {
 489                 assert(env->mode == get_irn_mode(copy));
 490         }
 491
 492         block = get_nodes_block(copy);
 493
 494         if (!has_definition(block)) {
 495                 waitq_put(env->worklist, block);
 496         }
 497         introduce_definition(env, copy);
 498 }
 499
 500 void be_ssa_construction_add_copies(be_ssa_construction_env_t *env,
 501                                     ir_node **copies, size_t copies_len)
 502 {
 503         size_t i;
 504
 505         assert(env->iterated_domfront_calculated == 0);
 506
 507         if (env->mode == NULL) {
 508                 determine_phi_req(env, copies[0]);
 509         }
 510
 511         for (i = 0; i < copies_len; ++i) {
 512                 ir_node *copy  = copies[i];
 513                 ir_node *block = get_nodes_block(copy);
 514
 515                 assert(env->mode == get_irn_mode(copy));
 516                 if (!has_definition(block)) {
 517                         waitq_put(env->worklist, block);
 518                 }
 519                 introduce_definition(env, copy);
 520         }
 521 }
 522
 523 void be_ssa_construction_set_ignore_uses(be_ssa_construction_env_t *env,
 524                                          const ir_nodeset_t *ignore_uses)
 525 {
 526         env->ignore_uses = ignore_uses;
 527 }
 528
 529 ir_node **be_ssa_construction_get_new_phis(be_ssa_construction_env_t *env)
 530 {
 531         return env->new_phis;
 532 }
 533
 534 /**
 535  * Fixes all arguments of a newly constructed phi.
 536  *
 537  * @see insert_dummy_phi
 538  */
 539 static void fix_phi_arguments(be_ssa_construction_env_t *env, ir_node *phi)
 540 {
 541         constr_info *info    = get_info(env, phi);
 542         ir_node     *block   = get_nodes_block(phi);
 543         int          i;
 544         int          n_preds = get_Block_n_cfgpreds(block);
 545
 546         DBG((dbg, LEVEL_3, "\tfixing phi arguments  %+F\n", phi));
 547
 548         for (i = 0; i < n_preds; ++i) {
 549                 ir_node *op = get_irn_n(phi, i);
 550
 551                 if (is_definition(env, op) || is_Dummy(op)) {
 552                         ir_node *pred_block = get_Block_cfgpred_block(block, i);
 553                         ir_node *pred_def   = search_def_end_of_block(env, pred_block);
 554
 555                         DBG((dbg, LEVEL_1, "\t...%+F(%d) -> %+F\n", phi, i, pred_def));
 556                         set_irn_n(phi, i, pred_def);
 557                 }
 558         }
 559
 560         info->already_processed = true;
 561 }
 562
 563 void be_ssa_construction_fix_users_array(be_ssa_construction_env_t *env,
 564                                          ir_node **nodes, size_t nodes_len)
 565 {
 566         size_t i;
 567         stat_ev_cnt_decl(uses);
 568
 569         be_timer_push(T_SSA_CONSTR);
 570
 571         if (!env->iterated_domfront_calculated) {
 572                 mark_iterated_dominance_frontiers(env);
 573                 env->iterated_domfront_calculated = 1;
 574         }
 575
 576         DBG((dbg, LEVEL_1, "\tfixing users array\n"));
 577
 578         assert(waitq_empty(env->worklist));
 579
 580         stat_ev_tim_push();
 581
 582         for (i = 0; i < nodes_len; ++i) {
 583                 const ir_edge_t *edge, *next;
 584                 ir_node *value = nodes[i];
 585                 DBG((dbg, LEVEL_3, "\tfixing users of %+F\n", value));
 586                 introduce_definition(env, value);
 587
 588                 foreach_out_edge_safe(value, edge, next) {
 589                         ir_node *use   = get_edge_src_irn(edge);
 590
 591                         if (env->ignore_uses != NULL &&
 592                                         ir_nodeset_contains(env->ignore_uses, use))
 593                                 continue;
 594
 595                         if (is_Anchor(use) || is_End(use))
 596                                 continue;
 597
 598                         introduce_use(env, use);
 599                 }
 600         }
 601
 602         assert(!waitq_empty(env->worklist));
 603
 604         while (!waitq_empty(env->worklist)) {
 605                 ir_node     *use  = (ir_node *)waitq_get(env->worklist);
 606                 constr_info *info = get_info(env, use);
 607
 608                 if (info->already_processed)
 609                         continue;
 610
 611                 if (is_Phi(use)) {
 612                         fix_phi_arguments(env, use);
 613                 }
 614                 else {
 615                         DBG((dbg, LEVEL_3, "\tsearching def for %+F at %+F\n", use, get_nodes_block(use)));
 616                         search_def_at_block(env, use);
 617                 }
 618
 619                 stat_ev_cnt_inc(uses);
 620         }
 621
 622         be_timer_pop(T_SSA_CONSTR);
 623
 624         stat_ev_tim_pop("bessaconstr_fix_time");
 625         stat_ev_cnt_done(uses, "bessaconstr_uses");
 626 }
 627
 628 void be_ssa_construction_fix_users(be_ssa_construction_env_t *env, ir_node *value)
 629 {
 630         be_ssa_construction_fix_users_array(env, &value, 1);
 631 }
 632
 633
 634 void be_ssa_construction_update_liveness_phis(be_ssa_construction_env_t *env,
 635                                               be_lv_t *lv)
 636 {
 637         int i, n;
 638
 639         be_timer_push(T_SSA_CONSTR);
 640
 641         n = ARR_LEN(env->new_phis);
 642         for (i = 0; i < n; ++i) {
 643                 ir_node *phi = env->new_phis[i];
 644                 be_liveness_introduce(lv, phi);
 645         }
 646
 647         be_timer_pop(T_SSA_CONSTR);
 648 }
 649
 650 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_ssaconstr)
 651 void be_init_ssaconstr(void)
 652 {
 653         FIRM_DBG_REGISTER(dbg, "firm.be.ssaconstr");
 654 }