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