nsz Git - libfirm/blob - ir/be/bestate.c

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