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

   1 /*
   2  * Author:      Matthias Braun, Christoph Mallon
   3  * Date:                27.09.2006
   4  * Copyright:   (c) Universitaet Karlsruhe
   5  * License:     This file is protected by GPL -  GNU GENERAL PUBLIC LICENSE.
   6  * CVS-Id:      $Id$
   7  */
   8 #ifdef HAVE_CONFIG_H
   9 #include "config.h"
  10 #endif /* HAVE_CONFIG_H */
  11
  12 #include "beblocksched.h"
  13
  14 #include <stdlib.h>
  15
  16 #include "array.h"
  17 #include "pdeq.h"
  18
  19 #include "iredges.h"
  20 #include "irgwalk.h"
  21 #include "irgraph_t.h"
  22 #include "irloop.h"
  23 #include "irprintf.h"
  24 #include "irdump_t.h"
  25 #include "irtools.h"
  26 #include "debug.h"
  27 #include "beirgmod.h"
  28 #include "bemodule.h"
  29 #include "be.h"
  30
  31 #include <libcore/lc_opts.h>
  32 #include <libcore/lc_opts_enum.h>
  33 #include <libcore/lc_timing.h>
  34
  35 #ifdef WITH_ILP
  36 #include <lpp/lpp.h>
  37 #include <lpp/lpp_net.h>
  38 #endif /* WITH_ILP */
  39
  40 typedef enum _blocksched_algos_t {
  41         BLOCKSCHED_NAIV, BLOCKSCHED_EXTBB, BLOCKSCHED_GREEDY, BLOCKSCHED_ILP
  42 } blocksched_algos_t;
  43
  44 static int algo = BLOCKSCHED_GREEDY;
  45
  46 static const lc_opt_enum_int_items_t blockschedalgo_items[] = {
  47         { "naiv",       BLOCKSCHED_NAIV },
  48         { "extbb",      BLOCKSCHED_EXTBB },
  49         { "greedy", BLOCKSCHED_GREEDY },
  50 #ifdef WITH_ILP
  51         { "ilp",    BLOCKSCHED_ILP },
  52 #endif /* WITH_ILP */
  53         { NULL,     0 }
  54 };
  55
  56 static lc_opt_enum_int_var_t algo_var = {
  57         &algo, blockschedalgo_items
  58 };
  59
  60 static const lc_opt_table_entry_t be_blocksched_options[] = {
  61         LC_OPT_ENT_ENUM_INT ("algo", "the block scheduling algorithm", &algo_var),
  62         { NULL }
  63 };
  64
  65 /*
  66  *   ____                   _
  67  *  / ___|_ __ ___  ___  __| |_   _
  68  * | |  _| '__/ _ \/ _ \/ _` | | | |
  69  * | |_| | | |  __/  __/ (_| | |_| |
  70  *  \____|_|  \___|\___|\__,_|\__, |
  71  *                            |___/
  72  */
  73
  74 typedef struct _blocksched_entry_t {
  75         ir_node *block;
  76         struct _blocksched_entry_t *next;
  77         struct _blocksched_entry_t *prev;
  78 } blocksched_entry_t;
  79
  80 typedef struct _edge_t {
  81         ir_node *block;             /**< source block */
  82         int     pos;                /**< number of cfg predecessor (target) */
  83         double  execfreq;           /**< the frequency */
  84         int     highest_execfreq;   /**< flag that indicates wether this edge is the edge with the highest
  85                                                                      execfreq pointing away from this block */
  86 } edge_t;
  87
  88 typedef struct _blocksched_env_t {
  89         ir_graph       *irg;
  90         struct obstack *obst;
  91         ir_exec_freq   *execfreqs;
  92         edge_t         *edges;
  93         pdeq           *worklist;
  94         int            blockcount;
  95         DEBUG_ONLY(firm_dbg_module_t *dbg;)
  96 } blocksched_env_t;
  97
  98 /**
  99  * Collect cfg frequencies of all edges between blocks.
 100  * Also determines edge with highest frequency.
 101  */
 102 static void collect_egde_frequency(ir_node *block, void *data)
 103 {
 104         blocksched_env_t   *env = data;
 105         int                arity;
 106         edge_t             edge;
 107         blocksched_entry_t *entry;
 108
 109         entry        = obstack_alloc(env->obst, sizeof(entry[0]));
 110         entry->block = block;
 111         entry->next  = NULL;
 112         entry->prev  = NULL;
 113         set_irn_link(block, entry);
 114
 115         if (block == get_irg_start_block(env->irg))
 116                 return;
 117
 118         arity = get_irn_arity(block);
 119
 120         if (arity == 1) {
 121                 edge.block            = block;
 122                 edge.pos              = 0;
 123                 edge.execfreq         = get_block_execfreq(env->execfreqs, block);
 124                 edge.highest_execfreq = 1;
 125                 ARR_APP1(edge_t, env->edges, edge);
 126         } else {
 127                 int    i;
 128                 double highest_execfreq = -1.0;
 129                 int    highest_edge_num = -1;
 130
 131                 edge.block = block;
 132                 for (i = 0; i < arity; ++i) {
 133                         double  execfreq;
 134                         ir_node *pred_block = get_Block_cfgpred_block(block, i);
 135
 136                         execfreq = get_block_execfreq(env->execfreqs, pred_block);
 137
 138                         edge.pos              = i;
 139                         edge.execfreq         = execfreq;
 140                         edge.highest_execfreq = 0;
 141                         ARR_APP1(edge_t, env->edges, edge);
 142
 143                         if (execfreq > highest_execfreq) {
 144                                 highest_execfreq = execfreq;
 145                                 highest_edge_num = ARR_LEN(env->edges) - 1;
 146                         }
 147                 }
 148
 149                 if(highest_edge_num >= 0)
 150                         env->edges[highest_edge_num].highest_execfreq = 1;
 151         }
 152 }
 153
 154 static int cmp_edges(const void *d1, const void *d2)
 155 {
 156         const edge_t *e1 = d1;
 157         const edge_t *e2 = d2;
 158
 159         return QSORT_CMP(e2->execfreq, e1->execfreq);
 160 }
 161
 162 static void coalesce_blocks(blocksched_env_t *env)
 163 {
 164         int i;
 165         int edge_count = ARR_LEN(env->edges);
 166
 167         /* run1: only look at jumps */
 168         for (i = 0; i < edge_count; ++i) {
 169                 const edge_t *edge  = &env->edges[i];
 170                 ir_node      *block = edge->block;
 171                 ir_node      *pred_block;
 172                 blocksched_entry_t *entry, *pred_entry;
 173
 174                 /* the block might have been removed already... */
 175                 if (is_Bad(get_Block_cfgpred(block, 0)))
 176                         continue;
 177
 178                 /* only check edge with highest frequency */
 179                 if (! edge->highest_execfreq)
 180                         continue;
 181
 182                 pred_block = get_Block_cfgpred_block(block, edge->pos);
 183                 entry      = get_irn_link(block);
 184                 pred_entry = get_irn_link(pred_block);
 185
 186                 if (pred_entry->next != NULL || entry->prev != NULL)
 187                         continue;
 188
 189                 /* only coalesce jumps */
 190                 if (get_block_succ_next(pred_block, get_block_succ_first(pred_block)) != NULL)
 191                         continue;
 192
 193                 /* schedule the 2 blocks behind each other */
 194                 DBG((env->dbg, LEVEL_1, "Coalesce (Jump) %+F -> %+F (%.3g)\n",
 195                            pred_entry->block, entry->block, edge->execfreq));
 196                 pred_entry->next = entry;
 197                 entry->prev      = pred_entry;
 198         }
 199
 200         /* run2: remaining edges */
 201         for (i = 0; i < edge_count; ++i) {
 202                 const edge_t *edge  = &env->edges[i];
 203                 ir_node      *block = edge->block;
 204                 ir_node      *pred_block;
 205                 blocksched_entry_t *entry, *pred_entry;
 206
 207                 /* the block might have been removed already... */
 208                 if (is_Bad(get_Block_cfgpred(block, 0)))
 209                         continue;
 210
 211                 pred_block = get_Block_cfgpred_block(block, edge->pos);
 212                 entry      = get_irn_link(block);
 213                 pred_entry = get_irn_link(pred_block);
 214
 215                 /* is 1 of the blocks already attached to another block? */
 216                 if (pred_entry->next != NULL || entry->prev != NULL)
 217                         continue;
 218
 219                 /* schedule the 2 blocks behind each other */
 220                 DBG((env->dbg, LEVEL_1, "Coalesce (CondJump) %+F -> %+F (%.3g)\n",
 221                            pred_entry->block, entry->block, edge->execfreq));
 222                 pred_entry->next = entry;
 223                 entry->prev      = pred_entry;
 224         }
 225 }
 226
 227 static void pick_block_successor(blocksched_entry_t *entry, blocksched_env_t *env)
 228 {
 229         ir_node            *block = entry->block;
 230         ir_node            *succ  = NULL;
 231         blocksched_entry_t *succ_entry;
 232         const ir_edge_t    *edge;
 233         double             best_succ_execfreq;
 234
 235         if (irn_visited(block))
 236                 return;
 237
 238         env->blockcount++;
 239         mark_irn_visited(block);
 240
 241         DBG((env->dbg, LEVEL_1, "Pick succ of %+F\n", block));
 242
 243         /* put all successors into the worklist */
 244         foreach_block_succ(block, edge) {
 245                 ir_node *succ_block = get_edge_src_irn(edge);
 246
 247                 if (irn_visited(succ_block))
 248                         continue;
 249
 250                 /* we only need to put the first of a series of already connected
 251                  * blocks into the worklist */
 252                 succ_entry = get_irn_link(succ_block);
 253                 while (succ_entry->prev != NULL) {
 254                         /* break cycles... */
 255                         if (succ_entry->prev->block == succ_block) {
 256                                 succ_entry->prev->next = NULL;
 257                                 succ_entry->prev       = NULL;
 258                                 break;
 259                         }
 260                         succ_entry = succ_entry->prev;
 261                 };
 262
 263                 if (irn_visited(succ_entry->block))
 264                         continue;
 265
 266                 DBG((env->dbg, LEVEL_1, "Put %+F into worklist\n", succ_entry->block));
 267                 pdeq_putr(env->worklist, succ_entry->block);
 268         }
 269
 270         if (entry->next != NULL) {
 271                 pick_block_successor(entry->next, env);
 272                 return;
 273         }
 274
 275         DBG((env->dbg, LEVEL_1, "deciding...\n"));
 276         best_succ_execfreq = -1;
 277
 278         /* no successor yet: pick the successor block with the highest execution
 279          * frequency which has no predecessor yet */
 280
 281         foreach_block_succ(block, edge) {
 282                 ir_node *succ_block = get_edge_src_irn(edge);
 283                 double  execfreq;
 284
 285                 if (irn_visited(succ_block))
 286                         continue;
 287
 288                 succ_entry = get_irn_link(succ_block);
 289                 if (succ_entry->prev != NULL)
 290                         continue;
 291
 292                 execfreq = get_block_execfreq(env->execfreqs, succ_block);
 293                 if (execfreq > best_succ_execfreq) {
 294                         best_succ_execfreq = execfreq;
 295                         succ = succ_block;
 296                 }
 297         }
 298
 299         if (succ == NULL) {
 300                 DBG((env->dbg, LEVEL_1, "pick from worklist\n"));
 301
 302                 do {
 303                         if (pdeq_empty(env->worklist)) {
 304                                 DBG((env->dbg, LEVEL_1, "worklist empty\n"));
 305                                 return;
 306                         }
 307                         succ = pdeq_getl(env->worklist);
 308                 } while (irn_visited(succ));
 309         }
 310
 311         succ_entry       = get_irn_link(succ);
 312         entry->next      = succ_entry;
 313         succ_entry->prev = entry;
 314
 315         pick_block_successor(succ_entry, env);
 316 }
 317
 318 static blocksched_entry_t *finish_block_schedule(blocksched_env_t *env)
 319 {
 320         ir_graph           *irg        = env->irg;
 321         ir_node            *startblock = get_irg_start_block(irg);
 322         blocksched_entry_t *entry      = get_irn_link(startblock);
 323
 324         inc_irg_visited(irg);
 325
 326         env->worklist = new_pdeq();
 327         pick_block_successor(entry, env);
 328         assert(pdeq_empty(env->worklist));
 329         del_pdeq(env->worklist);
 330
 331         return entry;
 332 }
 333
 334 static ir_node **create_blocksched_array(blocksched_env_t *env, blocksched_entry_t *first,
 335                                                                                 int count, struct obstack* obst)
 336 {
 337         int                i = 0;
 338         ir_node            **block_list;
 339         blocksched_entry_t *entry;
 340
 341         block_list = NEW_ARR_D(ir_node *, obst, count);
 342         DBG((env->dbg, LEVEL_1, "Blockschedule:\n"));
 343
 344         for (entry = first; entry != NULL; entry = entry->next) {
 345                 assert(i < count);
 346                 block_list[i++] = entry->block;
 347                 DBG((env->dbg, LEVEL_1, "\t%+F\n", entry->block));
 348         }
 349         assert(i == count);
 350
 351         return block_list;
 352 }
 353
 354 static ir_node **create_block_schedule_greedy(ir_graph *irg, ir_exec_freq *execfreqs)
 355 {
 356         blocksched_env_t   env;
 357         struct obstack     obst;
 358         blocksched_entry_t *start_entry;
 359         ir_node            **block_list;
 360
 361         obstack_init(&obst);
 362
 363         env.irg        = irg;
 364         env.obst       = &obst;
 365         env.execfreqs  = execfreqs;
 366         env.edges      = NEW_ARR_F(edge_t, 0);
 367         env.worklist   = NULL;
 368         env.blockcount = 0;
 369         FIRM_DBG_REGISTER(env.dbg, "firm.be.blocksched");
 370
 371         // collect edge execution frequencies
 372         irg_block_walk_graph(irg, collect_egde_frequency, NULL, &env);
 373
 374         // sort interblock edges by execution frequency
 375         qsort(env.edges, ARR_LEN(env.edges), sizeof(env.edges[0]), cmp_edges);
 376
 377         (void)be_remove_empty_blocks(irg);
 378
 379         if (algo != BLOCKSCHED_NAIV)
 380                 coalesce_blocks(&env);
 381
 382         start_entry = finish_block_schedule(&env);
 383         block_list  = create_blocksched_array(&env, start_entry, env.blockcount, get_irg_obstack(irg));
 384
 385         DEL_ARR_F(env.edges);
 386         obstack_free(&obst, NULL);
 387
 388         return block_list;
 389 }
 390
 391 /*
 392  *  ___ _     ____
 393  * |_ _| |   |  _ \
 394  *  | || |   | |_) |
 395  *  | || |___|  __/
 396  * |___|_____|_|
 397  *
 398  */
 399
 400 #ifdef WITH_ILP
 401 typedef struct _ilp_edge_t {
 402         ir_node *block;   /**< source block */
 403         int     pos;      /**< number of cfg predecessor (target) */
 404         int     ilpvar;
 405 } ilp_edge_t;
 406
 407 typedef struct _blocksched_ilp_env_t {
 408         blocksched_env_t env;
 409         ilp_edge_t       *ilpedges;
 410         lpp_t            *lpp;
 411 } blocksched_ilp_env_t;
 412
 413 typedef struct _blocksched_ilp_entry_t {
 414         ir_node *block;
 415         struct _blocksched_entry_t *next;
 416         struct _blocksched_entry_t *prev;
 417
 418         int out_cst;
 419 } blocksched_ilp_entry_t;
 420
 421 static int add_ilp_edge(ir_node *block, int pos, double execfreq, blocksched_ilp_env_t *env)
 422 {
 423         char       name[64];
 424         ilp_edge_t edge;
 425         int        edgeidx = ARR_LEN(env->ilpedges);
 426
 427         snprintf(name, sizeof(name), "edge%d", edgeidx);
 428
 429         edge.block  = block;
 430         edge.pos    = pos;
 431         edge.ilpvar = lpp_add_var_default(env->lpp, name, lpp_binary, execfreq, 1.0);
 432
 433         ARR_APP1(ilp_edge_t, env->ilpedges, edge);
 434         return edgeidx;
 435 }
 436
 437 static void collect_egde_frequency_ilp(ir_node *block, void *data)
 438 {
 439         blocksched_ilp_env_t *env        = data;
 440         ir_graph             *irg        = env->env.irg;
 441         ir_node              *startblock = get_irg_start_block(irg);
 442         int                  arity;
 443         lpp_cst_t            cst;
 444         char                 name[64];
 445         int                  out_count;
 446         blocksched_ilp_entry_t *entry;
 447
 448         snprintf(name, sizeof(name), "block_out_constr_%ld", get_irn_node_nr(block));
 449         out_count = get_irn_n_edges_kind(block, EDGE_KIND_BLOCK);
 450
 451         entry          = obstack_alloc(env->env.obst, sizeof(entry[0]));
 452         entry->block   = block;
 453         entry->next    = NULL;
 454         entry->prev    = NULL;
 455         entry->out_cst = lpp_add_cst_uniq(env->lpp, name, lpp_greater, out_count - 1);
 456         set_irn_link(block, entry);
 457
 458         if (block == startblock)
 459                 return;
 460
 461         arity = get_irn_arity(block);
 462         if (arity == 1) {
 463                 double execfreq = get_block_execfreq(env->env.execfreqs, block);
 464                 add_ilp_edge(block, 0, execfreq, env);
 465         }
 466         else {
 467                 int i;
 468                 int *edgenums = alloca(sizeof(edgenums[0]) * arity);
 469
 470                 snprintf(name, sizeof(name), "block_in_constr_%ld", get_irn_node_nr(block));
 471                 cst = lpp_add_cst_uniq(env->lpp, name, lpp_greater, arity - 1);
 472
 473                 for (i = 0; i < arity; ++i) {
 474                         double     execfreq;
 475                         int        edgenum;
 476                         ilp_edge_t *edge;
 477                         ir_node    *pred_block = get_Block_cfgpred_block(block, i);
 478
 479                         execfreq = get_block_execfreq(env->env.execfreqs, pred_block);
 480                         edgenum  = add_ilp_edge(block, i, execfreq, env);
 481                         edge     = &env->ilpedges[edgenum];
 482                         lpp_set_factor_fast(env->lpp, cst, edge->ilpvar, 1.0);
 483                 }
 484         }
 485 }
 486
 487
 488 static void coalesce_blocks_ilp(blocksched_ilp_env_t *env)
 489 {
 490         int  i;
 491         int  edge_count = ARR_LEN(env->ilpedges);
 492
 493         /* complete out constraints */
 494         for(i = 0; i < edge_count; ++i) {
 495                 const ilp_edge_t *edge  = &env->ilpedges[i];
 496                 ir_node          *block = edge->block;
 497                 ir_node          *pred;
 498                 blocksched_ilp_entry_t *entry;
 499
 500                 /* the block might have been removed already... */
 501                 if (is_Bad(get_Block_cfgpred(block, 0)))
 502                         continue;
 503
 504                 pred  = get_Block_cfgpred_block(block, edge->pos);
 505                 entry = get_irn_link(pred);
 506
 507                 DBG((env->env.dbg, LEVEL_1, "Adding out cst to %+F from %+F,%d\n",
 508                                   pred, block, edge->pos));
 509                 lpp_set_factor_fast(env->lpp, entry->out_cst, edge->ilpvar, 1.0);
 510         }
 511
 512 #if 0
 513         {
 514                 FILE *f;
 515                 char fname[256];
 516                 lpp_dump(env->lpp, "lpp.out");
 517                 snprintf(fname, sizeof(fname), "lpp_%s.plain", get_irg_dump_name(env->env.irg));
 518                 f = fopen(fname, "w");
 519                 lpp_dump_plain(env->lpp, f);
 520                 fclose(f);
 521         }
 522 #endif
 523
 524         //lpp_solve_net(env->lpp, main_env->options->ilp_server, main_env->options->ilp_solver);
 525         lpp_solve_net(env->lpp, "i44pc52", "cplex");
 526         assert(lpp_is_sol_valid(env->lpp));
 527
 528         /* Apply results to edges */
 529         for (i = 0; i < edge_count; ++i) {
 530                 const ilp_edge_t   *edge  = &env->ilpedges[i];
 531                 ir_node            *block = edge->block;
 532                 ir_node            *pred;
 533                 int                is_jump;
 534                 blocksched_entry_t *entry;
 535                 blocksched_entry_t *pred_entry;
 536
 537                 /* the block might have been removed already... */
 538                 if (is_Bad(get_Block_cfgpred(block, 0)))
 539                         continue;
 540
 541                 is_jump = lpp_get_var_sol(env->lpp, edge->ilpvar);
 542                 if (is_jump)
 543                         continue;
 544
 545                 pred       = get_Block_cfgpred_block(block, edge->pos);
 546                 entry      = get_irn_link(block);
 547                 pred_entry = get_irn_link(pred);
 548
 549                 assert(entry->prev == NULL && pred_entry->next == NULL);
 550                 entry->prev      = pred_entry;
 551                 pred_entry->next = entry;
 552         }
 553 }
 554
 555 static ir_node **create_block_schedule_ilp(ir_graph *irg, ir_exec_freq *execfreqs)
 556 {
 557         blocksched_ilp_env_t env;
 558         struct obstack       obst;
 559         blocksched_entry_t   *start_entry;
 560         ir_node              **block_list;
 561
 562         obstack_init(&obst);
 563
 564         env.env.irg        = irg;
 565         env.env.obst       = &obst;
 566         env.env.execfreqs  = execfreqs;
 567         env.env.worklist   = NULL;
 568         env.env.blockcount = 0;
 569         env.ilpedges       = NEW_ARR_F(ilp_edge_t, 0);
 570         FIRM_DBG_REGISTER(env.env.dbg, "firm.be.blocksched");
 571
 572         env.lpp = new_lpp("blockschedule", lpp_minimize);
 573         lpp_set_time_limit(env.lpp, 20);
 574         lpp_set_log(env.lpp, stdout);
 575
 576         irg_block_walk_graph(irg, collect_egde_frequency_ilp, NULL, &env);
 577
 578         (void)be_remove_empty_blocks(irg);
 579         coalesce_blocks_ilp(&env);
 580
 581         start_entry = finish_block_schedule(&env.env);
 582         block_list  = create_blocksched_array(&env.env, start_entry, env.env.blockcount, get_irg_obstack(irg));
 583
 584         DEL_ARR_F(env.ilpedges);
 585         free_lpp(env.lpp);
 586         obstack_free(&obst, NULL);
 587
 588         return block_list;
 589 }
 590 #endif /* WITH_ILP */
 591
 592 /*
 593  *  _____      _   ____  ____
 594  * | ____|_  _| |_| __ )| __ )
 595  * |  _| \ \/ / __|  _ \|  _ \
 596  * | |___ >  <| |_| |_) | |_) |
 597  * |_____/_/\_\\__|____/|____/
 598  *
 599  */
 600
 601 /** A simple forward single linked list. */
 602 typedef struct {
 603         ir_node  *start;   /**< start of the list */
 604         ir_node  *end;     /**< last block in the list */
 605         unsigned n_blks;  /**< number of blocks in the list */
 606 } anchor;
 607
 608 static void add_block(anchor *list, ir_node *block) {
 609         if (list->start == NULL) {
 610                 list->start = block;
 611                 list->end   = block;
 612         }
 613         else {
 614                 set_irn_link(list->end, block);
 615                 list->end = block;
 616         }
 617
 618         list->n_blks++;
 619 }
 620
 621 static void create_block_list(ir_node *leader_block, anchor *list) {
 622         int             i;
 623         const ir_edge_t *edge;
 624         ir_node         *block = NULL;
 625         ir_extblk       *extbb = get_Block_extbb(leader_block);
 626
 627         if (extbb_visited(extbb))
 628                 return;
 629         mark_extbb_visited(extbb);
 630
 631         for (i = 0; i < get_extbb_n_blocks(extbb); ++i) {
 632                 block = get_extbb_block(extbb, i);
 633                 add_block(list, block);
 634         }
 635
 636         assert(block != NULL);
 637
 638         /* pick successor extbbs */
 639         foreach_block_succ(block, edge) {
 640                 ir_node *succ = get_edge_src_irn(edge);
 641                 create_block_list(succ, list);
 642         }
 643
 644         for (i = 0; i < get_extbb_n_blocks(extbb) - 1; ++i) {
 645                 block = get_extbb_block(extbb, i);
 646
 647                 foreach_block_succ(block, edge) {
 648                         ir_node *succ = get_edge_src_irn(edge);
 649                         create_block_list(succ, list);
 650                 }
 651         }
 652 }
 653
 654 void compute_extbb_execfreqs(ir_graph *irg, ir_exec_freq *execfreqs);
 655
 656 /*
 657  * Calculates a block schedule. The schedule is stored as a linked
 658  * list starting at the start_block of the irg.
 659  */
 660 static ir_node **create_extbb_block_schedule(ir_graph *irg, ir_exec_freq *execfreqs)
 661 {
 662         anchor list;
 663         ir_node **blk_list, *b, *n;
 664         unsigned i;
 665
 666         /* schedule extended basic blocks */
 667         compute_extbb_execfreqs(irg, execfreqs);
 668         //compute_extbb(irg);
 669
 670         list.start  = NULL;
 671         list.end    = NULL;
 672         list.n_blks = 0;
 673         inc_irg_block_visited(irg);
 674         create_block_list(get_irg_start_block(irg), &list);
 675
 676         /** create an array, so we can go forward and backward */
 677         blk_list = NEW_ARR_D(ir_node *, irg->obst,list.n_blks);
 678
 679         for (i = 0, b = list.start; b; b = n, ++i) {
 680                 n = get_irn_link(b);
 681                 blk_list[i] = b;
 682         }
 683
 684         return blk_list;
 685 }
 686
 687 /*
 688  *  __  __       _
 689  * |  \/  | __ _(_)_ __
 690  * | |\/| |/ _` | | '_ \
 691  * | |  | | (_| | | | | |
 692  * |_|  |_|\__,_|_|_| |_|
 693  *
 694  */
 695 void be_init_blocksched(void)
 696 {
 697         lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
 698         lc_opt_entry_t *blocksched_grp = lc_opt_get_grp(be_grp, "blocksched");
 699
 700         lc_opt_add_table(blocksched_grp, be_blocksched_options);
 701 }
 702
 703 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_blocksched);
 704
 705 ir_node **be_create_block_schedule(ir_graph *irg, ir_exec_freq *execfreqs)
 706 {
 707         switch(algo) {
 708         case BLOCKSCHED_GREEDY:
 709         case BLOCKSCHED_NAIV:
 710                 return create_block_schedule_greedy(irg, execfreqs);
 711         case BLOCKSCHED_EXTBB:
 712                 return create_extbb_block_schedule(irg, execfreqs);
 713 #ifdef WITH_ILP
 714         case BLOCKSCHED_ILP:
 715                 return create_block_schedule_ilp(irg, execfreqs);
 716 #endif /* WITH_ILP */
 717         }
 718
 719         assert(0 && "unknown blocksched algo");
 720         return NULL;
 721 }