beblocksched.c 18.1 KB
Newer Older
1
2
3
4
5
/*
 * Author:      Matthias Braun, Christoph Mallon
 * Date:		27.09.2006
 * Copyright:   (c) Universitaet Karlsruhe
 * License:     This file is protected by GPL -  GNU GENERAL PUBLIC LICENSE.
Christian Würdig's avatar
Christian Würdig committed
6
 * CVS-Id:      $Id$
7
8
 */
#ifdef HAVE_CONFIG_H
9
#include "config.h"
Matthias Braun's avatar
Matthias Braun committed
10
#endif
11
12
13
14
15
16
17
18
19
20
21
22
23
24

#include "beblocksched.h"

#include <stdlib.h>

#include "array.h"
#include "pdeq.h"

#include "iredges.h"
#include "irgwalk.h"
#include "irgraph_t.h"
#include "irloop.h"
#include "irprintf.h"
#include "irdump_t.h"
25
26
#include "irtools.h"
#include "debug.h"
27
#include "beirgmod.h"
28
29
#include "bemodule.h"
#include "be.h"
30
31
32
33
34
35
36
37

#include <libcore/lc_opts.h>
#include <libcore/lc_opts_enum.h>
#include <libcore/lc_timing.h>

#ifdef WITH_ILP
#include <lpp/lpp.h>
#include <lpp/lpp_net.h>
Christian Würdig's avatar
Christian Würdig committed
38
#endif /* WITH_ILP */
39

Matthias Braun's avatar
Matthias Braun committed
40
41
DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)

42
43
44
45
46
47
48
49
50
51
52
53
typedef enum _blocksched_algos_t {
	BLOCKSCHED_NAIV, BLOCKSCHED_EXTBB, BLOCKSCHED_GREEDY, BLOCKSCHED_ILP
} blocksched_algos_t;

static int algo = BLOCKSCHED_GREEDY;

static const lc_opt_enum_int_items_t blockschedalgo_items[] = {
	{ "naiv",	BLOCKSCHED_NAIV },
	{ "extbb",	BLOCKSCHED_EXTBB },
	{ "greedy", BLOCKSCHED_GREEDY },
#ifdef WITH_ILP
	{ "ilp",    BLOCKSCHED_ILP },
Christian Würdig's avatar
Christian Würdig committed
54
#endif /* WITH_ILP */
55
56
57
58
59
60
61
62
	{ NULL,     0 }
};

static lc_opt_enum_int_var_t algo_var = {
	&algo, blockschedalgo_items
};

static const lc_opt_table_entry_t be_blocksched_options[] = {
Christian Würdig's avatar
Christian Würdig committed
63
	LC_OPT_ENT_ENUM_INT ("algo", "the block scheduling algorithm", &algo_var),
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
	{ NULL }
};

/*
 *   ____                   _
 *  / ___|_ __ ___  ___  __| |_   _
 * | |  _| '__/ _ \/ _ \/ _` | | | |
 * | |_| | | |  __/  __/ (_| | |_| |
 *  \____|_|  \___|\___|\__,_|\__, |
 *                            |___/
 */

typedef struct _blocksched_entry_t {
	ir_node *block;
	struct _blocksched_entry_t *next;
	struct _blocksched_entry_t *prev;
} blocksched_entry_t;

typedef struct _edge_t {
83
84
85
86
	ir_node *block;             /**< source block */
	int     pos;                /**< number of cfg predecessor (target) */
	double  execfreq;           /**< the frequency */
	int     highest_execfreq;   /**< flag that indicates wether this edge is the edge with the highest
87
88
89
90
							   	     execfreq pointing away from this block */
} edge_t;

typedef struct _blocksched_env_t {
91
	ir_graph       *irg;
92
	struct obstack *obst;
93
94
95
96
	ir_exec_freq   *execfreqs;
	edge_t         *edges;
	pdeq           *worklist;
	int            blockcount;
97
98
} blocksched_env_t;

99
100
101
102
/**
 * Collect cfg frequencies of all edges between blocks.
 * Also determines edge with highest frequency.
 */
103
104
static void collect_egde_frequency(ir_node *block, void *data)
{
105
	blocksched_env_t   *env = data;
106
107
	int                arity;
	edge_t             edge;
108
109
	blocksched_entry_t *entry;

110
	entry        = obstack_alloc(env->obst, sizeof(entry[0]));
111
	entry->block = block;
112
113
	entry->next  = NULL;
	entry->prev  = NULL;
114
115
	set_irn_link(block, entry);

116
	if (block == get_irg_start_block(env->irg))
117
118
119
		return;

	arity = get_irn_arity(block);
120
121
122
123
124

	if (arity == 1) {
		edge.block            = block;
		edge.pos              = 0;
		edge.execfreq         = get_block_execfreq(env->execfreqs, block);
125
126
127
		edge.highest_execfreq = 1;
		ARR_APP1(edge_t, env->edges, edge);
	} else {
128
		int    i;
129
		double highest_execfreq = -1.0;
130
		int    highest_edge_num = -1;
131
132

		edge.block = block;
133
134
		for (i = 0; i < arity; ++i) {
			double  execfreq;
135
			ir_node *pred_block = get_Block_cfgpred_block(block, i);
136

137
138
			execfreq = get_block_execfreq(env->execfreqs, pred_block);

139
140
			edge.pos              = i;
			edge.execfreq         = execfreq;
141
142
			edge.highest_execfreq = 0;
			ARR_APP1(edge_t, env->edges, edge);
143
144

			if (execfreq > highest_execfreq) {
145
146
147
148
149
				highest_execfreq = execfreq;
				highest_edge_num = ARR_LEN(env->edges) - 1;
			}
		}

150
151
		if(highest_edge_num >= 0)
			env->edges[highest_edge_num].highest_execfreq = 1;
152
153
154
155
156
157
158
	}
}

static int cmp_edges(const void *d1, const void *d2)
{
	const edge_t *e1 = d1;
	const edge_t *e2 = d2;
159
160

	return QSORT_CMP(e2->execfreq, e1->execfreq);
161
162
163
164
165
166
167
}

static void coalesce_blocks(blocksched_env_t *env)
{
	int i;
	int edge_count = ARR_LEN(env->edges);

168
169
170
171
172
	/* run1: only look at jumps */
	for (i = 0; i < edge_count; ++i) {
		const edge_t *edge  = &env->edges[i];
		ir_node      *block = edge->block;
		ir_node      *pred_block;
173
174
		blocksched_entry_t *entry, *pred_entry;

175
176
		/* the block might have been removed already... */
		if (is_Bad(get_Block_cfgpred(block, 0)))
177
178
			continue;

179
180
		/* only check edge with highest frequency */
		if (! edge->highest_execfreq)
181
182
183
			continue;

		pred_block = get_Block_cfgpred_block(block, edge->pos);
184
		entry      = get_irn_link(block);
185
186
		pred_entry = get_irn_link(pred_block);

187
		if (pred_entry->next != NULL || entry->prev != NULL)
188
			continue;
189
190
191

		/* only coalesce jumps */
		if (get_block_succ_next(pred_block, get_block_succ_first(pred_block)) != NULL)
192
193
			continue;

194
		/* schedule the 2 blocks behind each other */
Matthias Braun's avatar
Matthias Braun committed
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
202
203
204
205
	/* run2: remaining edges */
	for (i = 0; i < edge_count; ++i) {
		const edge_t *edge  = &env->edges[i];
		ir_node      *block = edge->block;
		ir_node      *pred_block;
206
207
		blocksched_entry_t *entry, *pred_entry;

208
209
		/* the block might have been removed already... */
		if (is_Bad(get_Block_cfgpred(block, 0)))
210
211
212
			continue;

		pred_block = get_Block_cfgpred_block(block, edge->pos);
213
		entry      = get_irn_link(block);
214
215
		pred_entry = get_irn_link(pred_block);

Matthias Braun's avatar
Matthias Braun committed
216
		/* is 1 of the blocks already attached to another block? */
217
		if (pred_entry->next != NULL || entry->prev != NULL)
218
219
			continue;

220
		/* schedule the 2 blocks behind each other */
Matthias Braun's avatar
Matthias Braun committed
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
229
	}
}

static void pick_block_successor(blocksched_entry_t *entry, blocksched_env_t *env)
{
230
231
	ir_node            *block = entry->block;
	ir_node            *succ  = NULL;
232
	blocksched_entry_t *succ_entry;
233
234
	const ir_edge_t    *edge;
	double             best_succ_execfreq;
235

236
	if (irn_visited(block))
237
		return;
238

239
240
241
	env->blockcount++;
	mark_irn_visited(block);

Matthias Braun's avatar
Matthias Braun committed
242
	DBG((dbg, LEVEL_1, "Pick succ of %+F\n", block));
243

244
	/* put all successors into the worklist */
245
246
247
	foreach_block_succ(block, edge) {
		ir_node *succ_block = get_edge_src_irn(edge);

248
		if (irn_visited(succ_block))
249
250
			continue;

251
252
		/* we only need to put the first of a series of already connected
		 * blocks into the worklist */
253
		succ_entry = get_irn_link(succ_block);
254
255
256
		while (succ_entry->prev != NULL) {
			/* break cycles... */
			if (succ_entry->prev->block == succ_block) {
257
				succ_entry->prev->next = NULL;
258
				succ_entry->prev       = NULL;
259
260
261
262
263
				break;
			}
			succ_entry = succ_entry->prev;
		};

264
		if (irn_visited(succ_entry->block))
265
266
			continue;

Matthias Braun's avatar
Matthias Braun committed
267
		DBG((dbg, LEVEL_1, "Put %+F into worklist\n", succ_entry->block));
268
269
270
		pdeq_putr(env->worklist, succ_entry->block);
	}

271
	if (entry->next != NULL) {
272
273
274
275
		pick_block_successor(entry->next, env);
		return;
	}

Matthias Braun's avatar
Matthias Braun committed
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
281
	 * frequency which has no predecessor yet */

282
283
	foreach_block_succ(block, edge) {
		ir_node *succ_block = get_edge_src_irn(edge);
284
		double  execfreq;
285

286
		if (irn_visited(succ_block))
287
288
289
			continue;

		succ_entry = get_irn_link(succ_block);
290
		if (succ_entry->prev != NULL)
291
292
			continue;

Michael Beck's avatar
Michael Beck committed
293
		execfreq = get_block_execfreq(env->execfreqs, succ_block);
294
		if (execfreq > best_succ_execfreq) {
295
296
297
298
299
			best_succ_execfreq = execfreq;
			succ = succ_block;
		}
	}

300
	if (succ == NULL) {
Matthias Braun's avatar
Matthias Braun committed
301
		DBG((dbg, LEVEL_1, "pick from worklist\n"));
302
303

		do {
304
			if (pdeq_empty(env->worklist)) {
Matthias Braun's avatar
Matthias Braun committed
305
				DBG((dbg, LEVEL_1, "worklist empty\n"));
306
307
308
				return;
			}
			succ = pdeq_getl(env->worklist);
309
		} while (irn_visited(succ));
310
311
	}

312
313
	succ_entry       = get_irn_link(succ);
	entry->next      = succ_entry;
314
315
316
317
318
319
320
	succ_entry->prev = entry;

	pick_block_successor(succ_entry, env);
}

static blocksched_entry_t *finish_block_schedule(blocksched_env_t *env)
{
321
322
323
	ir_graph           *irg        = env->irg;
	ir_node            *startblock = get_irg_start_block(irg);
	blocksched_entry_t *entry      = get_irn_link(startblock);
324

325
	set_using_visited(irg);
326
327
328
329
330
331
332
	inc_irg_visited(irg);

	env->worklist = new_pdeq();
	pick_block_successor(entry, env);
	assert(pdeq_empty(env->worklist));
	del_pdeq(env->worklist);

333
334
	clear_using_visited(irg);

335
336
337
	return entry;
}

338
339
340
341
342
static ir_node **create_blocksched_array(blocksched_env_t *env, blocksched_entry_t *first,
										int count, struct obstack* obst)
{
	int                i = 0;
	ir_node            **block_list;
343
344
345
	blocksched_entry_t *entry;

	block_list = NEW_ARR_D(ir_node *, obst, count);
Matthias Braun's avatar
Matthias Braun committed
346
	DBG((dbg, LEVEL_1, "Blockschedule:\n"));
347
348

	for (entry = first; entry != NULL; entry = entry->next) {
349
350
		assert(i < count);
		block_list[i++] = entry->block;
Matthias Braun's avatar
Matthias Braun committed
351
		DBG((dbg, LEVEL_1, "\t%+F\n", entry->block));
352
353
354
355
356
357
358
359
	}
	assert(i == count);

	return block_list;
}

static ir_node **create_block_schedule_greedy(ir_graph *irg, ir_exec_freq *execfreqs)
{
360
361
	blocksched_env_t   env;
	struct obstack     obst;
362
	blocksched_entry_t *start_entry;
363
	ir_node            **block_list;
364
365
366

	obstack_init(&obst);

367
368
369
370
371
	env.irg        = irg;
	env.obst       = &obst;
	env.execfreqs  = execfreqs;
	env.edges      = NEW_ARR_F(edge_t, 0);
	env.worklist   = NULL;
372
373
374
375
376
377
378
379
	env.blockcount = 0;

	// collect edge execution frequencies
	irg_block_walk_graph(irg, collect_egde_frequency, NULL, &env);

	// sort interblock edges by execution frequency
	qsort(env.edges, ARR_LEN(env.edges), sizeof(env.edges[0]), cmp_edges);

380
	(void)be_remove_empty_blocks(irg);
381

382
	if (algo != BLOCKSCHED_NAIV)
383
384
385
		coalesce_blocks(&env);

	start_entry = finish_block_schedule(&env);
386
	block_list  = create_blocksched_array(&env, start_entry, env.blockcount, get_irg_obstack(irg));
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404

	DEL_ARR_F(env.edges);
	obstack_free(&obst, NULL);

	return block_list;
}

/*
 *  ___ _     ____
 * |_ _| |   |  _ \
 *  | || |   | |_) |
 *  | || |___|  __/
 * |___|_____|_|
 *
 */

#ifdef WITH_ILP
typedef struct _ilp_edge_t {
405
406
407
	ir_node *block;   /**< source block */
	int     pos;      /**< number of cfg predecessor (target) */
	int     ilpvar;
408
409
410
411
} ilp_edge_t;

typedef struct _blocksched_ilp_env_t {
	blocksched_env_t env;
412
413
	ilp_edge_t       *ilpedges;
	lpp_t            *lpp;
414
415
416
417
418
419
420
421
422
423
424
425
} blocksched_ilp_env_t;

typedef struct _blocksched_ilp_entry_t {
	ir_node *block;
	struct _blocksched_entry_t *next;
	struct _blocksched_entry_t *prev;

	int out_cst;
} blocksched_ilp_entry_t;

static int add_ilp_edge(ir_node *block, int pos, double execfreq, blocksched_ilp_env_t *env)
{
426
	char       name[64];
427
	ilp_edge_t edge;
428
	int        edgeidx = ARR_LEN(env->ilpedges);
429
430
431

	snprintf(name, sizeof(name), "edge%d", edgeidx);

432
433
	edge.block  = block;
	edge.pos    = pos;
434
435
436
437
438
439
440
441
	edge.ilpvar = lpp_add_var_default(env->lpp, name, lpp_binary, execfreq, 1.0);

	ARR_APP1(ilp_edge_t, env->ilpedges, edge);
	return edgeidx;
}

static void collect_egde_frequency_ilp(ir_node *block, void *data)
{
442
443
444
445
446
447
448
	blocksched_ilp_env_t *env        = data;
	ir_graph             *irg        = env->env.irg;
	ir_node              *startblock = get_irg_start_block(irg);
	int                  arity;
	lpp_cst_t            cst;
	char                 name[64];
	int                  out_count;
449
450
451
452
453
	blocksched_ilp_entry_t *entry;

	snprintf(name, sizeof(name), "block_out_constr_%ld", get_irn_node_nr(block));
	out_count = get_irn_n_edges_kind(block, EDGE_KIND_BLOCK);

454
455
456
457
	entry          = obstack_alloc(env->env.obst, sizeof(entry[0]));
	entry->block   = block;
	entry->next    = NULL;
	entry->prev    = NULL;
458
459
460
	entry->out_cst = lpp_add_cst_uniq(env->lpp, name, lpp_greater, out_count - 1);
	set_irn_link(block, entry);

461
	if (block == startblock)
462
463
464
		return;

	arity = get_irn_arity(block);
465
	if (arity == 1) {
466
467
		double execfreq = get_block_execfreq(env->env.execfreqs, block);
		add_ilp_edge(block, 0, execfreq, env);
468
469
	}
	else {
470
471
472
473
474
475
		int i;
		int *edgenums = alloca(sizeof(edgenums[0]) * arity);

		snprintf(name, sizeof(name), "block_in_constr_%ld", get_irn_node_nr(block));
		cst = lpp_add_cst_uniq(env->lpp, name, lpp_greater, arity - 1);

476
477
478
		for (i = 0; i < arity; ++i) {
			double     execfreq;
			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
484
			edgenum  = add_ilp_edge(block, i, execfreq, env);
			edge     = &env->ilpedges[edgenum];
485
486
487
488
489
490
491
492
			lpp_set_factor_fast(env->lpp, cst, edge->ilpvar, 1.0);
		}
	}
}


static void coalesce_blocks_ilp(blocksched_ilp_env_t *env)
{
493
494
	int  i;
	int  edge_count = ARR_LEN(env->ilpedges);
495
496
497

	/* complete out constraints */
	for(i = 0; i < edge_count; ++i) {
498
499
500
		const ilp_edge_t *edge  = &env->ilpedges[i];
		ir_node          *block = edge->block;
		ir_node          *pred;
501
502
		blocksched_ilp_entry_t *entry;

503
504
		/* the block might have been removed already... */
		if (is_Bad(get_Block_cfgpred(block, 0)))
505
506
			continue;

507
		pred  = get_Block_cfgpred_block(block, edge->pos);
508
509
		entry = get_irn_link(pred);

Matthias Braun's avatar
Matthias Braun committed
510
		DBG((dbg, LEVEL_1, "Adding out cst to %+F from %+F,%d\n",
511
				  pred, block, edge->pos));
512
513
514
		lpp_set_factor_fast(env->lpp, entry->out_cst, edge->ilpvar, 1.0);
	}

515
516
517
518
519
520
521
522
523
524
525
526
#if 0
	{
		FILE *f;
		char fname[256];
		lpp_dump(env->lpp, "lpp.out");
		snprintf(fname, sizeof(fname), "lpp_%s.plain", get_irg_dump_name(env->env.irg));
		f = fopen(fname, "w");
		lpp_dump_plain(env->lpp, f);
		fclose(f);
	}
#endif

527
528
529
530
531
	//lpp_solve_net(env->lpp, main_env->options->ilp_server, main_env->options->ilp_solver);
	lpp_solve_net(env->lpp, "i44pc52", "cplex");
	assert(lpp_is_sol_valid(env->lpp));

	/* Apply results to edges */
532
533
534
535
536
	for (i = 0; i < edge_count; ++i) {
		const ilp_edge_t   *edge  = &env->ilpedges[i];
		ir_node            *block = edge->block;
		ir_node            *pred;
		int                is_jump;
537
538
539
		blocksched_entry_t *entry;
		blocksched_entry_t *pred_entry;

540
541
		/* the block might have been removed already... */
		if (is_Bad(get_Block_cfgpred(block, 0)))
542
543
544
			continue;

		is_jump = lpp_get_var_sol(env->lpp, edge->ilpvar);
545
		if (is_jump)
546
547
			continue;

548
549
		pred       = get_Block_cfgpred_block(block, edge->pos);
		entry      = get_irn_link(block);
550
551
552
		pred_entry = get_irn_link(pred);

		assert(entry->prev == NULL && pred_entry->next == NULL);
553
		entry->prev      = pred_entry;
554
555
556
557
558
559
560
		pred_entry->next = entry;
	}
}

static ir_node **create_block_schedule_ilp(ir_graph *irg, ir_exec_freq *execfreqs)
{
	blocksched_ilp_env_t env;
561
562
563
	struct obstack       obst;
	blocksched_entry_t   *start_entry;
	ir_node              **block_list;
564
565
566

	obstack_init(&obst);

567
568
569
570
	env.env.irg        = irg;
	env.env.obst       = &obst;
	env.env.execfreqs  = execfreqs;
	env.env.worklist   = NULL;
571
	env.env.blockcount = 0;
572
	env.ilpedges       = NEW_ARR_F(ilp_edge_t, 0);
573
574
575
576
577
578
579

	env.lpp = new_lpp("blockschedule", lpp_minimize);
	lpp_set_time_limit(env.lpp, 20);
	lpp_set_log(env.lpp, stdout);

	irg_block_walk_graph(irg, collect_egde_frequency_ilp, NULL, &env);

580
	(void)be_remove_empty_blocks(irg);
581
582
583
	coalesce_blocks_ilp(&env);

	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
587
588
589
590
591

	DEL_ARR_F(env.ilpedges);
	free_lpp(env.lpp);
	obstack_free(&obst, NULL);

	return block_list;
}
Christian Würdig's avatar
Christian Würdig committed
592
#endif /* WITH_ILP */
593
594
595
596
597
598
599
600
601
602
603
604

/*
 *  _____      _   ____  ____
 * | ____|_  _| |_| __ )| __ )
 * |  _| \ \/ / __|  _ \|  _ \
 * | |___ >  <| |_| |_) | |_) |
 * |_____/_/\_\\__|____/|____/
 *
 */

/** A simple forward single linked list. */
typedef struct {
605
606
	ir_node  *start;   /**< start of the list */
	ir_node  *end;     /**< last block in the list */
607
608
609
610
	unsigned n_blks;  /**< number of blocks in the list */
} anchor;

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
616
617
618
619
620
621
622
		set_irn_link(list->end, block);
		list->end = block;
	}

	list->n_blks++;
}

static void create_block_list(ir_node *leader_block, anchor *list) {
623
	int             i;
624
	const ir_edge_t *edge;
625
626
	ir_node         *block = NULL;
	ir_extblk       *extbb = get_Block_extbb(leader_block);
627

628
	if (extbb_visited(extbb))
629
630
631
		return;
	mark_extbb_visited(extbb);

632
	for (i = 0; i < get_extbb_n_blocks(extbb); ++i) {
633
634
635
636
637
638
		block = get_extbb_block(extbb, i);
		add_block(list, block);
	}

	assert(block != NULL);

639
	/* pick successor extbbs */
640
641
642
643
644
	foreach_block_succ(block, edge) {
		ir_node *succ = get_edge_src_irn(edge);
		create_block_list(succ, list);
	}

645
	for (i = 0; i < get_extbb_n_blocks(extbb) - 1; ++i) {
646
		block = get_extbb_block(extbb, i);
647

648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
		foreach_block_succ(block, edge) {
			ir_node *succ = get_edge_src_irn(edge);
			create_block_list(succ, list);
		}
	}
}

void compute_extbb_execfreqs(ir_graph *irg, ir_exec_freq *execfreqs);

/*
 * Calculates a block schedule. The schedule is stored as a linked
 * list starting at the start_block of the irg.
 */
static ir_node **create_extbb_block_schedule(ir_graph *irg, ir_exec_freq *execfreqs)
{
	anchor list;
	ir_node **blk_list, *b, *n;
	unsigned i;

	/* schedule extended basic blocks */
	compute_extbb_execfreqs(irg, execfreqs);
	//compute_extbb(irg);

	list.start  = NULL;
	list.end    = NULL;
	list.n_blks = 0;
674
675
676

	set_using_irn_link(irg);
	set_using_visited(irg);
677
	inc_irg_block_visited(irg);
678

679
680
681
682
683
684
685
686
687
688
	create_block_list(get_irg_start_block(irg), &list);

	/** create an array, so we can go forward and backward */
	blk_list = NEW_ARR_D(ir_node *, irg->obst,list.n_blks);

	for (i = 0, b = list.start; b; b = n, ++i) {
		n = get_irn_link(b);
		blk_list[i] = b;
	}

689
690
691
	clear_using_irn_link(irg);
	clear_using_visited(irg);

692
693
694
695
696
697
698
699
700
701
702
	return blk_list;
}

/*
 *  __  __       _
 * |  \/  | __ _(_)_ __
 * | |\/| |/ _` | | '_ \
 * | |  | | (_| | | | | |
 * |_|  |_|\__,_|_|_| |_|
 *
 */
703
void be_init_blocksched(void)
704
{
705
706
	lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
	lc_opt_entry_t *blocksched_grp = lc_opt_get_grp(be_grp, "blocksched");
707
708

	lc_opt_add_table(blocksched_grp, be_blocksched_options);
Matthias Braun's avatar
Matthias Braun committed
709
710

	FIRM_DBG_REGISTER(dbg, "firm.be.blocksched");
711
}
712
713

BE_REGISTER_MODULE_CONSTRUCTOR(be_init_blocksched);
714
715
716
717
718
719
720
721
722
723
724
725

ir_node **be_create_block_schedule(ir_graph *irg, ir_exec_freq *execfreqs)
{
	switch(algo) {
	case BLOCKSCHED_GREEDY:
	case BLOCKSCHED_NAIV:
		return create_block_schedule_greedy(irg, execfreqs);
	case BLOCKSCHED_EXTBB:
		return create_extbb_block_schedule(irg, execfreqs);
#ifdef WITH_ILP
	case BLOCKSCHED_ILP:
		return create_block_schedule_ilp(irg, execfreqs);
Christian Würdig's avatar
Christian Würdig committed
726
#endif /* WITH_ILP */
727
728
729
730
731
	}

	assert(0 && "unknown blocksched algo");
	return NULL;
}