nsz Git - libfirm/blob - ir/be/bestate.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       Handles state switching. This is basically the belady spill
  23  *              algorithm optimized for the 1-register case.
  24  * @author      Matthias Braun
  25  * @date        26.03.2007
  26  * @version     $Id$
  27  */
  28 #include "config.h"
  29
  30 #include "bestate.h"
  31
  32 #include "obst.h"
  33 #include "irgraph_t.h"
  34 #include "irnode_t.h"
  35 #include "irgwalk.h"
  36 #include "irloop.h"
  37 #include "iredges_t.h"
  38 #include "ircons_t.h"
  39 #include "irgmod.h"
  40 #include "irnodeset.h"
  41 #include "irnodemap.h"
  42 #include "adt/cpset.h"
  43
  44 #include "bearch.h"
  45 #include "beuses.h"
  46 #include "besched.h"
  47 #include "belive_t.h"
  48 #include "bemodule.h"
  49 #include "benode.h"
  50 #include "bessaconstr.h"
  51
  52 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
  53
  54 typedef struct spill_info_t {
  55         struct spill_info_t *next;
  56         ir_node *value;
  57         ir_node *spill;
  58         ir_node **reloads;
  59 } spill_info_t;
  60
  61 typedef struct minibelady_env_t {
  62         struct obstack         obst;
  63         const arch_register_t *reg;
  64         const be_lv_t         *lv;
  65         void                  *func_env;
  66         create_reload_func     create_reload;
  67         create_spill_func      create_spill;
  68         spill_info_t          *spills;
  69         ir_nodemap_t           spill_infos;
  70
  71         be_uses_t             *uses;           /**< env for the next-use magic */
  72 } minibelady_env_t;
  73
  74 typedef struct block_info_t {
  75         ir_node *start_state;
  76         ir_node *end_state;
  77 } block_info_t;
  78
  79 static inline block_info_t *new_block_info(struct obstack *obst, ir_node *block)
  80 {
  81         block_info_t *res = OALLOCZ(obst, block_info_t);
  82
  83         assert(is_Block(block));
  84         set_irn_link(block, res);
  85         mark_irn_visited(block);
  86
  87         return res;
  88 }
  89
  90 static inline block_info_t *get_block_info(ir_node *block)
  91 {
  92         assert(irn_visited(block));
  93         return (block_info_t*) get_irn_link(block);
  94 }
  95
  96 static inline spill_info_t *create_spill_info(minibelady_env_t *env, ir_node *state)
  97 {
  98         spill_info_t *spill_info = OALLOCZ(&env->obst, spill_info_t);
  99         spill_info->value = state;
 100         spill_info->reloads = NEW_ARR_F(ir_node*, 0);
 101
 102         ir_nodemap_insert(&env->spill_infos, state, spill_info);
 103         //ir_fprintf(stderr, "Insert %+F -> %p\n", state, spill_info);
 104
 105         spill_info->next = env->spills;
 106         env->spills = spill_info;
 107
 108         return spill_info;
 109 }
 110
 111 static inline spill_info_t *get_spill_info(minibelady_env_t *env, const ir_node *node)
 112 {
 113         spill_info_t *spill_info
 114                 = (spill_info_t*) ir_nodemap_get(&env->spill_infos, node);
 115         //ir_fprintf(stderr, "Get %+F -> %p\n", node, spill_info);
 116         return spill_info;
 117 }
 118
 119 static spill_info_t *create_spill(minibelady_env_t *env, ir_node *state, int force)
 120 {
 121         spill_info_t *spill_info;
 122         ir_node *next;
 123         ir_node *after;
 124
 125         spill_info = get_spill_info(env, state);
 126         if (spill_info == NULL) {
 127                 spill_info = create_spill_info(env, state);
 128         } else if (spill_info->spill != NULL) {
 129                 return spill_info;
 130         }
 131
 132         if (sched_is_scheduled(state)) {
 133                 next = state;
 134                 do {
 135                         after = next;
 136                         next = sched_next(after);
 137                 } while (is_Proj(next) || is_Phi(next) || be_is_Keep(next));
 138         } else {
 139                 after = state;
 140         }
 141         spill_info->spill = env->create_spill(env->func_env, state, force, after);
 142
 143         return spill_info;
 144 }
 145
 146 static void create_reload(minibelady_env_t *env, ir_node *state,
 147                           ir_node *before, ir_node *last_state)
 148 {
 149         spill_info_t *spill_info = create_spill(env, state, 0);
 150         ir_node *spill = spill_info->spill;
 151         ir_node *reload;
 152
 153         reload = env->create_reload(env->func_env, state, spill, before,
 154                                     last_state);
 155         ARR_APP1(ir_node*, spill_info->reloads, reload);
 156 }
 157
 158 static void spill_phi(minibelady_env_t *env, ir_node *phi)
 159 {
 160         ir_graph     *irg           = get_irn_irg(phi);
 161         ir_node      *block         = get_nodes_block(phi);
 162         int           arity         = get_irn_arity(phi);
 163         ir_node     **in            = ALLOCAN(ir_node*, arity);
 164         ir_node      *spill_to_kill = NULL;
 165         spill_info_t *spill_info;
 166         int           i;
 167
 168         /* does a spill exist for the phis value? */
 169         spill_info = get_spill_info(env, phi);
 170         if (spill_info != NULL) {
 171                 spill_to_kill = spill_info->spill;
 172         } else {
 173                 spill_info = create_spill_info(env, phi);
 174         }
 175
 176         /* create a new phi-M with bad preds */
 177         for (i = 0; i < arity; ++i) {
 178                 in[i] = new_r_Unknown(irg, mode_M);
 179         }
 180
 181         DBG((dbg, LEVEL_2, "\tcreate Phi-M for %+F\n", phi));
 182
 183         /* create a Phi-M */
 184         spill_info->spill = new_r_Phi(block, arity, in, mode_M);
 185
 186         if (spill_to_kill != NULL) {
 187                 exchange(spill_to_kill, spill_info->spill);
 188                 sched_remove(spill_to_kill);
 189         }
 190
 191         /* create spills for the phi values */
 192         for (i = 0; i < arity; ++i) {
 193                 ir_node *in = get_irn_n(phi, i);
 194                 spill_info_t *pred_spill = create_spill(env, in, 1);
 195                 set_irn_n(spill_info->spill, i, pred_spill->spill);
 196         }
 197 }
 198
 199 static void belady(minibelady_env_t *env, ir_node *block);
 200
 201 /**
 202  * Collects all values live-in at block @p block and all phi results in this
 203  * block.
 204  * Then it adds the best values (at most n_regs) to the blocks start_workset.
 205  * The phis among the remaining values get spilled: Introduce psudo-copies of
 206  * their args to break interference and make it possible to spill them to the
 207  * same spill slot.
 208  */
 209 static block_info_t *compute_block_start_state(minibelady_env_t *env, ir_node *block)
 210 {
 211         block_info_t  *block_info;
 212         be_next_use_t  next_use;
 213         ir_loop       *loop;
 214         ir_node       *best_starter, *first;
 215         ir_node       *node;
 216         int            n_cfgpreds;
 217         unsigned       best_time;
 218         int            outer_loop_allowed;
 219         int            i;
 220
 221         /* Create the block info for this block. */
 222         block_info = new_block_info(&env->obst, block);
 223         n_cfgpreds = get_Block_n_cfgpreds(block);
 224
 225         /* no cfgpred -> no value active */
 226         if (n_cfgpreds == 0) {
 227                 block_info->start_state = NULL;
 228                 return block_info;
 229         }
 230
 231         /* for 1 pred only: simply take the the end-state of the pred */
 232         if (n_cfgpreds == 1) {
 233                 ir_node *pred_block = get_Block_cfgpred_block(block, 0);
 234                 block_info_t *pred_info;
 235
 236                 /* process pred block */
 237                 belady(env, pred_block);
 238
 239                 pred_info = get_block_info(pred_block);
 240
 241                 DBG((dbg, LEVEL_2, "Taking end state from %+F: %+F\n", pred_block, pred_info->end_state));
 242                 block_info->start_state = pred_info->end_state;
 243                 return block_info;
 244         }
 245
 246         /* Collect all values living at start of block */
 247         DBG((dbg, LEVEL_2, "Living at start of %+F:\n", block));
 248         first = sched_first(block);
 249         loop = get_irn_loop(block);
 250         best_starter = NULL;
 251         best_time = USES_INFINITY;
 252         outer_loop_allowed = 1;
 253
 254         /* check all Phis first */
 255         sched_foreach(block, node) {
 256                 if (!is_Phi(node))
 257                         break;
 258                 if (arch_get_irn_register(node) != env->reg)
 259                         continue;
 260
 261                 DBG((dbg, LEVEL_2, "\t...checking %+F\n", node));
 262                 next_use = be_get_next_use(env->uses, first, 0, node, 0);
 263
 264                 if (USES_IS_INFINITE(next_use.time)) {
 265                         DBG((dbg, LEVEL_2, "\tnot taken (dead)\n"));
 266                         continue;
 267                 }
 268
 269                 if (next_use.outermost_loop >= get_loop_depth(loop)) {
 270                         if (outer_loop_allowed || next_use.time < best_time) {
 271                                 DBG((dbg, LEVEL_2, "\ttaken (%u, loop %d)\n", next_use.time,
 272                                      next_use.outermost_loop));
 273
 274                                 if (best_starter != NULL) {
 275                                         /* spill the phi as it is not used */
 276                                         spill_phi(env, best_starter);
 277                                 }
 278                                 best_starter = node;
 279                                 best_time = next_use.time;
 280                                 outer_loop_allowed = 0;
 281                         }
 282                 } else {
 283                         if (outer_loop_allowed && next_use.time < best_time) {
 284                                 DBG((dbg, LEVEL_2, "\ttaken (%u, loop %d)\n", next_use.time,
 285                                      next_use.outermost_loop));
 286                                 if (best_starter != NULL) {
 287                                         /* spill the phi as it is not used */
 288                                         spill_phi(env, best_starter);
 289                                 }
 290                                 best_starter = node;
 291                                 best_time = next_use.time;
 292                         }
 293                 }
 294
 295                 if (best_starter != node) {
 296                         /* spill the phi as it is not used */
 297                         spill_phi(env, best_starter);
 298                 }
 299         }
 300
 301         /* check all Live-Ins */
 302         be_lv_foreach(env->lv, block, be_lv_state_in, i) {
 303                 node = be_lv_get_irn(env->lv, block, i);
 304
 305                 if (!mode_is_data(get_irn_mode(node)))
 306                         continue;
 307
 308                 if (arch_get_irn_register(node) != env->reg)
 309                         continue;
 310
 311                 DBG((dbg, LEVEL_2, "\t...checking %+F\n", node));
 312                 next_use = be_get_next_use(env->uses, first, 0, node, 0);
 313
 314                 if (USES_IS_INFINITE(next_use.time)) {
 315                         DBG((dbg, LEVEL_2, "\tnot taken (dead)\n"));
 316                         continue;
 317                 }
 318
 319                 if (next_use.outermost_loop >= get_loop_depth(loop)) {
 320                         if (outer_loop_allowed || next_use.time < best_time) {
 321                                 DBG((dbg, LEVEL_2, "\ttaken (%u, loop %d)\n", next_use.time,
 322                                      next_use.outermost_loop));
 323
 324                                 if (best_starter != NULL && is_Phi(best_starter)) {
 325                                         /* spill the phi as it is not used */
 326                                         spill_phi(env, best_starter);
 327                                 }
 328                                 best_starter = node;
 329                                 best_time = next_use.time;
 330                                 outer_loop_allowed = 0;
 331                         }
 332                 } else {
 333                         if (outer_loop_allowed && next_use.time < best_time) {
 334                                 DBG((dbg, LEVEL_2, "\ttaken (%u, loop %d)\n", next_use.time,
 335                                      next_use.outermost_loop));
 336                                 if (best_starter != NULL && is_Phi(best_starter)) {
 337                                         /* spill the phi as it is not used */
 338                                         spill_phi(env, best_starter);
 339                                 }
 340                                 best_starter = node;
 341                                 best_time = next_use.time;
 342                         }
 343                 }
 344         }
 345
 346         block_info->start_state = best_starter;
 347
 348         return block_info;
 349 }
 350
 351 /**
 352  * For the given block @p block, decide for each values
 353  * whether it is used from a register or is reloaded
 354  * before the use.
 355  */
 356 static void belady(minibelady_env_t *env, ir_node *block)
 357 {
 358         ir_node *current_state;
 359         ir_node *node;
 360         block_info_t *block_info;
 361
 362         /* Don't do a block twice */
 363         if (irn_visited(block))
 364                 return;
 365
 366         /* compute value to start with */
 367         block_info = compute_block_start_state(env, block);
 368
 369         /* get the starting workset for this block */
 370         DBG((dbg, LEVEL_3, "\n"));
 371         DBG((dbg, LEVEL_3, "Decide for %+F\n", block));
 372
 373         current_state = block_info->start_state;
 374         DBG((dbg, LEVEL_3, "Start value: %+F\n", current_state));
 375
 376         /* process the block from start to end */
 377         DBG((dbg, LEVEL_3, "Processing...\n"));
 378
 379         sched_foreach(block, node) {
 380                 int i, arity;
 381                 ir_node *need_val = NULL;
 382
 383                 /* projs are handled with the tuple value.
 384                  * Phis are no real instr (see insert_starters()) */
 385                 if (is_Proj(node) || is_Phi(node)) {
 386                         continue;
 387                 }
 388
 389                 /* check which state is desired for the node */
 390                 arity = get_irn_arity(node);
 391                 for (i = 0; i < arity; ++i) {
 392                         const arch_register_t *reg;
 393                         ir_node *in = get_irn_n(node, i);
 394
 395                         if (!mode_is_data(get_irn_mode(in)))
 396                                 continue;
 397
 398                         reg = arch_get_irn_register(in);
 399                         if (reg == env->reg) {
 400                                 assert(need_val == NULL);
 401                                 need_val = in;
 402                                 DBG((dbg, LEVEL_3, "\t... need state %+F\n", need_val));
 403                         }
 404                 }
 405                 /* create a reload to match state if necessary */
 406                 if (need_val != NULL && need_val != current_state) {
 407                         DBG((dbg, LEVEL_3, "\t... reloading %+F\n", need_val));
 408                         create_reload(env, need_val, node, current_state);
 409                         current_state = need_val;
 410                 }
 411
 412                 DBG((dbg, LEVEL_3, "  ...%+F\n", node));
 413
 414                 /* record state changes by the node */
 415                 if (get_irn_mode(node) == mode_T) {
 416                         const ir_edge_t *edge;
 417
 418                         foreach_out_edge(node, edge) {
 419                                 const arch_register_t *reg;
 420                                 ir_node *proj = get_edge_src_irn(edge);
 421
 422                                 if (!mode_is_data(get_irn_mode(proj)))
 423                                         continue;
 424
 425                                 reg = arch_get_irn_register(proj);
 426                                 if (reg == env->reg) {
 427                                         current_state = proj;
 428                                         DBG((dbg, LEVEL_3, "\t... current_state <- %+F\n", current_state));
 429                                 }
 430                         }
 431                 } else {
 432                         if (mode_is_data(get_irn_mode(node))) {
 433                                 const arch_register_t *reg = arch_get_irn_register(node);
 434                                 if (reg == env->reg) {
 435                                         current_state = node;
 436                                         DBG((dbg, LEVEL_3, "\t... current_state <- %+F\n", current_state));
 437                                 }
 438                         }
 439                 }
 440         }
 441
 442         /* Remember end-workset for this block */
 443         block_info->end_state = current_state;
 444         DBG((dbg, LEVEL_3, "End value for %+F: %+F\n", block, current_state));
 445 }
 446
 447 static void belady_walker(ir_node *block, void *data)
 448 {
 449         belady((minibelady_env_t*) data, block);
 450 }
 451
 452 static ir_node *get_end_of_block_insertion_point(ir_node *block)
 453 {
 454         ir_node *last = sched_last(block);
 455
 456         /* skip Projs and Keep-alikes behind the jump... */
 457         while (is_Proj(last) || be_is_Keep(last)) {
 458                 last = sched_prev(last);
 459         }
 460
 461         if (!is_cfop(last)) {
 462                 last = sched_next(last);
 463                 /* last node must be a cfop, only exception is the start block */
 464                 assert(last == get_irg_start_block(get_irn_irg(block)));
 465         }
 466
 467         return last;
 468 }
 469
 470 /**
 471  * We must adapt the live-outs to the live-ins at each block-border.
 472  */
 473 static void fix_block_borders(ir_node *block, void *data)
 474 {
 475         minibelady_env_t *env = data;
 476         ir_graph *irg = get_irn_irg(block);
 477         ir_node *startblock = get_irg_start_block(irg);
 478         int i;
 479         int arity;
 480         block_info_t *block_info;
 481
 482         if (block == startblock)
 483                 return;
 484
 485         DBG((dbg, LEVEL_3, "\n"));
 486
 487         block_info = get_block_info(block);
 488
 489         DBG((dbg, LEVEL_3, "Fixing %+F (needs %+F)\n", block,
 490              block_info->start_state));
 491
 492         /* process all pred blocks */
 493         arity = get_irn_arity(block);
 494         for (i = 0; i < arity; ++i) {
 495                 ir_node      *pred       = get_Block_cfgpred_block(block, i);
 496                 block_info_t *pred_info  = get_block_info(pred);
 497                 ir_node      *need_state = block_info->start_state;
 498
 499                 if (need_state == NULL)
 500                         continue;
 501
 502                 if (is_Phi(need_state) && get_nodes_block(need_state) == block) {
 503                         need_state = get_irn_n(need_state, i);
 504                 }
 505
 506                 DBG((dbg, LEVEL_3, "  Pred %+F (ends in %+F, we need %+F)\n", pred,
 507                      pred_info->end_state, need_state));
 508
 509                 if (pred_info->end_state != need_state) {
 510                         ir_node *insert_point = get_end_of_block_insertion_point(pred);
 511
 512
 513                         DBG((dbg, LEVEL_3, "  Creating reload for %+F\n", need_state));
 514                         create_reload(env, need_state, insert_point, pred_info->end_state);
 515                 }
 516         }
 517 }
 518
 519 void be_assure_state(ir_graph *irg, const arch_register_t *reg, void *func_env,
 520                      create_spill_func create_spill,
 521                      create_reload_func create_reload)
 522 {
 523         minibelady_env_t env;
 524         spill_info_t *info;
 525         be_lv_t *lv = be_assure_liveness(irg);
 526
 527         be_liveness_assure_sets(lv);
 528         /* construct control flow loop tree */
 529         if (! (get_irg_loopinfo_state(irg) & loopinfo_cf_consistent)) {
 530                 construct_cf_backedges(irg);
 531         }
 532
 533         obstack_init(&env.obst);
 534         env.reg           = reg;
 535         env.func_env      = func_env;
 536         env.create_spill  = create_spill;
 537         env.create_reload = create_reload;
 538         env.lv            = be_get_irg_liveness(irg);
 539         env.uses          = be_begin_uses(irg, env.lv);
 540         env.spills        = NULL;
 541         ir_nodemap_init(&env.spill_infos);
 542
 543         assure_doms(irg);
 544         ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED | IR_RESOURCE_IRN_LINK);
 545         inc_irg_visited(irg);
 546
 547         /* process blocks */
 548         irg_block_walk_graph(irg, NULL, belady_walker, &env);
 549
 550         /* fix block end_states that don't match the next blocks start_state */
 551         irg_block_walk_graph(irg, fix_block_borders, NULL, &env);
 552
 553         ir_free_resources(irg, IR_RESOURCE_IRN_VISITED | IR_RESOURCE_IRN_LINK);
 554
 555         /* reconstruct ssa-form */
 556         info = env.spills;
 557         while (info != NULL) {
 558                 be_ssa_construction_env_t senv;
 559                 int i, len;
 560                 ir_node **phis;
 561
 562                 be_ssa_construction_init(&senv, irg);
 563                 if (sched_is_scheduled(info->value))
 564                         be_ssa_construction_add_copy(&senv, info->value);
 565                 be_ssa_construction_add_copies(&senv,
 566                                                info->reloads, ARR_LEN(info->reloads));
 567                 be_ssa_construction_fix_users(&senv, info->value);
 568
 569                 if (lv != NULL) {
 570                         be_ssa_construction_update_liveness_phis(&senv, lv);
 571
 572                         be_liveness_update(lv, info->value);
 573                         len = ARR_LEN(info->reloads);
 574                         for (i = 0; i < len; ++i) {
 575                                 ir_node *reload = info->reloads[i];
 576                                 be_liveness_update(lv, reload);
 577                         }
 578                 }
 579
 580                 phis = be_ssa_construction_get_new_phis(&senv);
 581
 582                 /* set register requirements for phis */
 583                 len = ARR_LEN(phis);
 584                 for (i = 0; i < len; ++i) {
 585                         ir_node *phi = phis[i];
 586                         arch_set_irn_register(phi, env.reg);
 587                 }
 588                 be_ssa_construction_destroy(&senv);
 589
 590                 info = info->next;
 591         }
 592
 593         /* some nodes might be dead now. */
 594         be_remove_dead_nodes_from_schedule(irg);
 595
 596         ir_nodemap_destroy(&env.spill_infos);
 597         be_end_uses(env.uses);
 598         obstack_free(&env.obst, NULL);
 599 }
 600
 601 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_state);
 602 void be_init_state(void)
 603 {
 604         FIRM_DBG_REGISTER(dbg, "firm.be.state");
 605 }