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

   1 /*
   2  * Author:      Matthias Braun
   3  * Date:                05.05.2006
   4  * Copyright:   (c) Universitaet Karlsruhe
   5  * License:     This file is protected by GPL -  GNU GENERAL PUBLIC LICENSE.
   6  *
   7  */
   8 #ifdef HAVE_CONFIG_H
   9 #include "config.h"
  10 #endif
  11
  12 #include "bespillmorgan.h"
  13
  14 #include "bechordal_t.h"
  15 #include "bespill.h"
  16 #include "belive_t.h"
  17 #include "beabi.h"
  18 #include "irgwalk.h"
  19 #include "besched.h"
  20 #include "beutil.h"
  21 #include "irloop_t.h"
  22 #include "irgraph_t.h"
  23 #include "irprintf.h"
  24 #include "obstack.h"
  25
  26 #include "bespillbelady.h"
  27 #include "beverify.h"
  28 #include "benodesets.h"
  29
  30 #define DBG_LIVE                1
  31 #define DBG_LOOPANA             2
  32 #define DBG_PRESSURE    4
  33 #define DBG_SPILLS      8
  34 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
  35
  36 typedef struct morgan_env {
  37         const be_chordal_env_t *cenv;
  38         const arch_env_t *arch;
  39         const arch_register_class_t *cls;
  40         ir_graph *irg;
  41         struct obstack obst;
  42         /** maximum safe register pressure */
  43         int registers_available;
  44
  45         spill_env_t *senv;
  46
  47         set *loop_attr_set;
  48         set *block_attr_set;
  49 } morgan_env_t;
  50
  51 typedef struct loop_edge {
  52         ir_node *block;
  53         int pos;
  54 } loop_edge_t;
  55
  56 typedef struct loop_attr {
  57         const ir_loop *loop;
  58         set *out_edges;
  59         set *in_edges;
  60         /** The set of all values that are live in the loop but not used in the loop */
  61         bitset_t *livethrough_unused;
  62 } loop_attr_t;
  63
  64 typedef struct block_attr {
  65         const ir_node *block;
  66         /** set of all values that are live in the block but not used in the block */
  67         bitset_t *livethrough_unused;
  68 } block_attr_t;
  69
  70 //---------------------------------------------------------------------------
  71
  72 static int loop_edge_cmp(const void* p1, const void* p2, size_t s) {
  73         loop_edge_t *e1 = (loop_edge_t*) p1;
  74         loop_edge_t *e2 = (loop_edge_t*) p2;
  75
  76         return e1->block != e2->block || e1->pos != e2->pos;
  77 }
  78
  79 static int loop_attr_cmp(const void *e1, const void *e2, size_t s) {
  80         loop_attr_t *la1 = (loop_attr_t*) e1;
  81         loop_attr_t *la2 = (loop_attr_t*) e2;
  82
  83         return la1->loop != la2->loop;
  84 }
  85
  86 static int block_attr_cmp(const void *e1, const void *e2, size_t s) {
  87         block_attr_t *b1 = (block_attr_t*) e1;
  88         block_attr_t *b2 = (block_attr_t*) e2;
  89
  90         return b1->block != b2->block;
  91 }
  92
  93 static INLINE int loop_attr_hash(const loop_attr_t *a) {
  94 #ifdef DEBUG_libfirm
  95         return a->loop->loop_nr;
  96 #else
  97         return HASH_PTR(a->loop);
  98 #endif
  99 }
 100
 101 static INLINE int block_attr_hash(const block_attr_t *b) {
 102         return nodeset_hash(b->block);
 103 }
 104
 105 static INLINE int loop_edge_hash(const loop_edge_t *e) {
 106         return nodeset_hash(e->block) ^ (e->pos * 31);
 107 }
 108
 109 static INLINE loop_attr_t *get_loop_attr(morgan_env_t *env, const ir_loop *loop) {
 110         loop_attr_t l_attr, *res;
 111         int hash;
 112         l_attr.loop = loop;
 113
 114         hash = loop_attr_hash(&l_attr);
 115         res = set_find(env->loop_attr_set, &l_attr, sizeof(l_attr), hash);
 116
 117         // create new loop_attr if none exists yet
 118         if (res == NULL) {
 119                 l_attr.out_edges = new_set(loop_edge_cmp, 1);
 120                 l_attr.in_edges = new_set(loop_edge_cmp, 1);
 121                 l_attr.livethrough_unused = bitset_obstack_alloc(&env->obst, get_irg_last_idx(env->irg));
 122                 res = set_insert(env->loop_attr_set, &l_attr, sizeof(l_attr), hash);
 123         }
 124
 125         return res;
 126 }
 127
 128 static INLINE block_attr_t *get_block_attr(morgan_env_t *env, const ir_node *block) {
 129         block_attr_t b_attr, *res;
 130         int hash;
 131         b_attr.block = block;
 132
 133         hash = block_attr_hash(&b_attr);
 134         res = set_find(env->block_attr_set, &b_attr, sizeof(b_attr), hash);
 135
 136         if(res == NULL) {
 137                 b_attr.livethrough_unused = bitset_obstack_alloc(&env->obst, get_irg_last_idx(env->irg));
 138                 res = set_insert(env->block_attr_set, &b_attr, sizeof(b_attr), hash);
 139         }
 140
 141         return res;
 142 }
 143
 144 //---------------------------------------------------------------------------
 145
 146 static INLINE int consider_for_spilling(const arch_env_t *env, const arch_register_class_t *cls, const ir_node *node) {
 147         if(!arch_irn_has_reg_class(env, node, -1, cls))
 148                 return 0;
 149
 150         return !(arch_irn_get_flags(env, node) & (arch_irn_flags_ignore | arch_irn_flags_dont_spill));
 151 }
 152
 153 /**
 154  * Determine edges going out of a loop (= edges that go to a block that is not inside
 155  * the loop or one of its subloops)
 156  */
 157 static INLINE void construct_loop_edges(ir_node* block, void* data) {
 158         morgan_env_t *env = data;
 159         int n_cfgpreds = get_Block_n_cfgpreds(block);
 160         int i;
 161         ir_loop* loop = get_irn_loop(block);
 162         DBG((dbg, DBG_LOOPANA, "Loop for %+F: %d (depth %d)\n", block, loop->loop_nr, loop->depth));
 163
 164         for(i = 0; i < n_cfgpreds; ++i) {
 165                 loop_edge_t edge;
 166                 int hash;
 167                 ir_node* cfgpred = get_Block_cfgpred(block, i);
 168                 ir_node* cfgpred_block = get_nodes_block(cfgpred);
 169                 ir_loop* cfgpred_loop = get_irn_loop(cfgpred_block);
 170
 171                 if(cfgpred_loop == loop)
 172                         continue;
 173
 174                 assert(get_loop_depth(cfgpred_loop) != get_loop_depth(loop));
 175
 176                 edge.block = block;
 177                 edge.pos = i;
 178                 hash = loop_edge_hash(&edge);
 179
 180                 // edge out of a loop?
 181                 if(get_loop_depth(cfgpred_loop) > get_loop_depth(loop)) {
 182                         ir_loop *l;
 183
 184                         DBG((dbg, DBG_LOOPANA, "Loop out edge from %+F (loop %d) to %+F (loop %d)\n", block, get_loop_loop_nr(loop),
 185                              cfgpred_block, get_loop_loop_nr(cfgpred_loop)));
 186
 187                         /* this might be a jump out of multiple loops, so add this to all
 188                      * needed outedge sets */
 189                         l = cfgpred_loop;
 190                         do {
 191                                 loop_attr_t *l_attr = get_loop_attr(env, l);
 192                                 set_insert(l_attr->out_edges, &edge, sizeof(edge), hash);
 193
 194                                 l = get_loop_outer_loop(l);
 195                                 assert(l != NULL);
 196                         } while(l != loop);
 197                 } else {
 198                         ir_loop *l;
 199
 200                         // edge into a loop
 201                         DBG((dbg, DBG_LOOPANA, "Loop in edge from %+F (loop %d) to %+F (loop %d)\n", block, get_loop_loop_nr(loop),
 202                              cfgpred_block, get_loop_loop_nr(cfgpred_loop)));
 203
 204                         l = loop;
 205                         do {
 206                                 loop_attr_t *l_attr = get_loop_attr(env, l);
 207                                 set_insert(l_attr->in_edges, &edge, sizeof(edge), hash);
 208
 209                                 l = get_loop_outer_loop(l);
 210                         } while(l != cfgpred_loop);
 211                 }
 212         }
 213 }
 214
 215 static void free_loop_edges(morgan_env_t *env) {
 216         loop_attr_t *l_attr;
 217
 218         for(l_attr = set_first(env->loop_attr_set); l_attr != NULL; l_attr = set_next(env->loop_attr_set)) {
 219                 del_set(l_attr->out_edges);
 220                 del_set(l_attr->in_edges);
 221         }
 222 }
 223
 224 /**
 225  * Debugging help, shows all nodes in a (node-)bitset
 226  */
 227 static void show_nodebitset(ir_graph* irg, const bitset_t* bitset) {
 228         int i;
 229
 230         bitset_foreach(bitset, i) {
 231                 ir_node* node = get_idx_irn(irg, i);
 232                 ir_fprintf(stderr, " %+F", node);
 233         }
 234         fprintf(stderr, "\n");
 235 }
 236
 237 /**
 238  * Construct the livethrough unused set for a block
 239  */
 240 static bitset_t *construct_block_livethrough_unused(morgan_env_t* env, const ir_node* block) {
 241         block_attr_t *block_attr = get_block_attr(env, block);
 242         ir_node *node;
 243         int i;
 244
 245         DBG((dbg, DBG_LIVE, "Processing block %d\n", get_irn_node_nr(block)));
 246         // copy all live-outs into the livethrough_unused set
 247         be_lv_foreach(env->cenv->lv, block, be_lv_state_in | be_lv_state_out, i) {
 248                 ir_node *irn = be_lv_get_irn(env->cenv->lv, block, i);
 249                 int node_idx;
 250
 251                 if(!consider_for_spilling(env->arch, env->cls, irn))
 252                         continue;
 253
 254                 node_idx = get_irn_idx(irn);
 255                 bitset_set(block_attr->livethrough_unused, node_idx);
 256         }
 257
 258         /*
 259          * All values that are used within the block are not unused (and therefore not
 260          * livethrough_unused)
 261          */
 262         sched_foreach(block, node) {
 263                 int i, arity;
 264
 265                 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
 266                         int idx = get_irn_idx(get_irn_n(node, i));
 267                         bitset_clear(block_attr->livethrough_unused, idx);
 268                 }
 269         }
 270
 271         return block_attr->livethrough_unused;
 272 }
 273
 274 /**
 275  * Construct the livethrough unused set for a loop (and all its subloops+blocks)
 276  */
 277 static bitset_t *construct_loop_livethrough_unused(morgan_env_t *env, const ir_loop *loop) {
 278         int i;
 279         loop_attr_t* loop_attr = get_loop_attr(env, loop);
 280
 281         DBG((dbg, DBG_LIVE, "Processing Loop %d\n", loop->loop_nr));
 282         assert(get_loop_n_elements(loop) > 0);
 283         for(i = 0; i < get_loop_n_elements(loop); ++i) {
 284                 loop_element elem = get_loop_element(loop, i);
 285                 switch (*elem.kind) {
 286                 case k_ir_node: {
 287                         bitset_t *livethrough_block_unused;
 288                         assert(is_Block(elem.node));
 289                         livethrough_block_unused = construct_block_livethrough_unused(env, elem.node);
 290                         if(i == 0) {
 291                                 bitset_copy(loop_attr->livethrough_unused, livethrough_block_unused);
 292                         } else {
 293                                 bitset_and(loop_attr->livethrough_unused, livethrough_block_unused);
 294                         }
 295                         break;
 296                 }
 297                 case k_ir_loop: {
 298                         bitset_t *livethrough_son_unused;
 299
 300                         livethrough_son_unused = construct_loop_livethrough_unused(env, elem.son);
 301                         if(i == 0) {
 302                                 bitset_copy(loop_attr->livethrough_unused, livethrough_son_unused);
 303                         } else {
 304                                 bitset_and(loop_attr->livethrough_unused, livethrough_son_unused);
 305                         }
 306                         break;
 307                 }
 308             default:
 309                         assert(0);
 310                         break;
 311                 }
 312     }
 313         DBG((dbg, DBG_LIVE, "Done with loop %d\n", loop->loop_nr));
 314
 315         // remove all unused livethroughs that are remembered for this loop from child loops and blocks
 316         for(i = 0; i < get_loop_n_elements(loop); ++i) {
 317                 const loop_element elem = get_loop_element(loop, i);
 318
 319                 if(*elem.kind == k_ir_loop) {
 320                         loop_attr_t *son_attr = get_loop_attr(env, elem.son);
 321                         bitset_andnot(son_attr->livethrough_unused, loop_attr->livethrough_unused);
 322
 323                         DBG((dbg, DBG_LIVE, "Livethroughs for loop %d:\n", loop->loop_nr));
 324                 } else if(*elem.kind == k_ir_node) {
 325                         block_attr_t *block_attr = get_block_attr(env, elem.node);
 326                         bitset_andnot(block_attr->livethrough_unused, loop_attr->livethrough_unused);
 327
 328                         DBG((dbg, DBG_LIVE, "Livethroughs for block %+F\n", elem.node));
 329                 } else {
 330                         assert(0);
 331                 }
 332         }
 333
 334         return loop_attr->livethrough_unused;
 335 }
 336
 337 /*---------------------------------------------------------------------------*/
 338
 339 static int reduce_register_pressure_in_block(morgan_env_t *env, const ir_node* block, int loop_unused_spills_possible) {
 340         ir_node *node;
 341         int max_pressure;
 342         int loop_unused_spills_needed;
 343         pset *live_nodes = pset_new_ptr_default();
 344
 345         be_liveness_end_of_block(env->cenv->lv, env->arch, env->cls, block, live_nodes);
 346         max_pressure = pset_count(live_nodes);
 347
 348         DBG((dbg, DBG_LIVE, "Reduce pressure to %d In Block %+F:\n", env->registers_available, block));
 349
 350         /**
 351          * Determine register pressure in block
 352          */
 353         sched_foreach_reverse(block, node) {
 354                 int pressure;
 355
 356                 if(is_Phi(node))
 357                         break;
 358
 359                 be_liveness_transfer(env->arch, env->cls, node, live_nodes);
 360                 pressure = pset_count(live_nodes);
 361                 if(pressure > max_pressure)
 362                         max_pressure = pressure;
 363         }
 364         del_pset(live_nodes);
 365
 366         DBG((dbg, DBG_PRESSURE, "\tMax Pressure in %+F: %d\n", block, max_pressure));
 367
 368         loop_unused_spills_needed = max_pressure - env->registers_available;
 369
 370         if(loop_unused_spills_needed < 0) {
 371                 loop_unused_spills_needed = 0;
 372         } else if(loop_unused_spills_needed > loop_unused_spills_possible) {
 373                 loop_unused_spills_needed = loop_unused_spills_possible;
 374         }
 375
 376         DBG((dbg, DBG_PRESSURE, "Unused spills for Block %+F needed: %d\n", block, loop_unused_spills_needed));
 377         return loop_unused_spills_needed;
 378 }
 379
 380 /**
 381  * Reduce register pressure in a loop
 382  *
 383  * @param unused_spills_possible        Number of spills from livethrough_unused variables possible in outer loops
 384  * @return                                                      Number of spills of livethrough_unused variables needed in outer loops
 385  */
 386 static int reduce_register_pressure_in_loop(morgan_env_t *env, const ir_loop *loop, int outer_spills_possible) {
 387         int i;
 388         loop_attr_t* loop_attr = get_loop_attr(env, loop);
 389         int spills_needed = 0;
 390         int spills_possible = outer_spills_possible + bitset_popcnt(loop_attr->livethrough_unused);
 391         int outer_spills_needed;
 392
 393         DBG((dbg, DBG_PRESSURE, "Reducing Pressure in loop %d\n", loop->loop_nr));
 394         for(i = 0; i < get_loop_n_elements(loop); ++i) {
 395                 loop_element elem = get_loop_element(loop, i);
 396                 switch (*elem.kind) {
 397                 case k_ir_node: {
 398                         int needed;
 399                         assert(is_Block(elem.node));
 400                         needed = reduce_register_pressure_in_block(env, elem.node, spills_possible);
 401                         assert(needed >= 0);
 402                         assert(needed <= spills_possible);
 403                         if(needed > spills_needed)
 404                                 spills_needed = needed;
 405                         break;
 406                 }
 407                 case k_ir_loop: {
 408                         int needed = reduce_register_pressure_in_loop(env, elem.son, spills_possible);
 409                         assert(needed >= 0);
 410                         assert(needed <= spills_possible);
 411                         if(needed > spills_needed)
 412                                 spills_needed = needed;
 413                         break;
 414                 }
 415             default:
 416                         assert(0);
 417                         break;
 418                 }
 419     }
 420
 421         /* calculate number of spills needed in outer loop and spill
 422          * unused livethrough nodes around this loop
 423          */
 424         if(spills_needed > outer_spills_possible) {
 425                 int spills_to_place;
 426                 outer_spills_needed = outer_spills_possible;
 427                 spills_needed -= outer_spills_possible;
 428
 429                 spills_to_place = spills_needed;
 430
 431                 DBG((dbg, DBG_SPILLS, "%d values unused in loop %d, spilling %d\n",
 432                  spills_possible - outer_spills_possible, loop->loop_nr, spills_to_place));
 433                 show_nodebitset(env->irg, loop_attr->livethrough_unused);
 434
 435                 bitset_foreach(loop_attr->livethrough_unused, i) {
 436                         loop_edge_t *edge;
 437                         ir_node *to_spill = get_idx_irn(env->irg, i);
 438
 439                         DBG((dbg, DBG_SPILLS, "Spilling node %+F around loop %d\n", to_spill, loop->loop_nr));
 440
 441                         for(edge = set_first(loop_attr->out_edges); edge != NULL; edge = set_next(loop_attr->out_edges)) {
 442                                 be_add_reload_on_edge(env->senv, to_spill, edge->block, edge->pos);
 443                         }
 444
 445                         spills_to_place--;
 446                         if(spills_to_place <= 0) {
 447                                 break;
 448                         }
 449                 }
 450         } else {
 451                 outer_spills_needed = spills_needed;
 452         }
 453
 454         return outer_spills_needed;
 455 }
 456
 457 void be_spill_morgan(be_chordal_env_t *chordal_env) {
 458         morgan_env_t env;
 459
 460         FIRM_DBG_REGISTER(dbg, "ir.be.spillmorgan");
 461         //firm_dbg_set_mask(dbg, DBG_SPILLS | DBG_LOOPANA);
 462
 463         env.cenv = chordal_env;
 464         env.arch = chordal_env->birg->main_env->arch_env;
 465         env.irg = chordal_env->irg;
 466         env.cls = chordal_env->cls;
 467         env.senv = be_new_spill_env(chordal_env);
 468         DEBUG_ONLY(be_set_spill_env_dbg_module(env.senv, dbg);)
 469
 470         obstack_init(&env.obst);
 471
 472         env.registers_available = env.cls->n_regs - be_put_ignore_regs(chordal_env->birg, env.cls, NULL);
 473
 474         env.loop_attr_set = new_set(loop_attr_cmp, 5);
 475         env.block_attr_set = new_set(block_attr_cmp, 20);
 476
 477         /*-- Part1: Analysis --*/
 478         be_liveness_recompute(chordal_env->lv);
 479
 480         /* construct control flow loop tree */
 481         construct_cf_backedges(chordal_env->irg);
 482
 483         /* construct loop out edges and livethrough_unused sets for loops and blocks */
 484         irg_block_walk_graph(chordal_env->irg, NULL, construct_loop_edges, &env);
 485         construct_loop_livethrough_unused(&env, get_irg_loop(env.irg));
 486
 487         /*-- Part2: Transformation --*/
 488
 489         /* spill unused livethrough values around loops and blocks where
 490          * the pressure is too high
 491          */
 492         reduce_register_pressure_in_loop(&env, get_irg_loop(env.irg), 0);
 493
 494         /* Insert real spill/reload nodes and fix usages */
 495         be_insert_spills_reloads(env.senv);
 496
 497         /* Verify the result */
 498         if (chordal_env->opts->vrfy_option == BE_CH_VRFY_WARN) {
 499                 be_verify_schedule(env.irg);
 500         } else if (chordal_env->opts->vrfy_option == BE_CH_VRFY_ASSERT) {
 501                 assert(be_verify_schedule(env.irg));
 502         }
 503
 504         if (chordal_env->opts->dump_flags & BE_CH_DUMP_SPILL)
 505                 be_dump(env.irg, "-spillmorgan", dump_ir_block_graph_sched);
 506
 507         /* cleanup */
 508         free_loop_edges(&env);
 509         del_set(env.loop_attr_set);
 510         del_set(env.block_attr_set);
 511
 512         /* fix the remaining places with too high register pressure with beladies algorithm */
 513         be_spill_belady_spill_env(chordal_env, env.senv);
 514
 515         be_delete_spill_env(env.senv);
 516         obstack_free(&env.obst, NULL);
 517 }