beblocksched.c 18.9 KB
Newer Older
Christian Würdig's avatar
Christian Würdig committed
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
/*
 * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
 *
 * This file is part of libFirm.
 *
 * This file may be distributed and/or modified under the terms of the
 * GNU General Public License version 2 as published by the Free Software
 * Foundation and appearing in the file LICENSE.GPL included in the
 * packaging of this file.
 *
 * Licensees holding valid libFirm Professional Edition licenses may use
 * this file in accordance with the libFirm Commercial License.
 * Agreement provided with the Software.
 *
 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE.
 */

Christian Würdig's avatar
Christian Würdig committed
20
21
22
23
24
25
/**
 * @file
 * @brief       Block-scheduling strategies.
 * @author      Matthias Braun, Christoph Mallon
 * @date        27.09.2006
 * @version     $Id$
26
27
 */
#ifdef HAVE_CONFIG_H
28
#include "config.h"
Matthias Braun's avatar
Matthias Braun committed
29
#endif
30
31
32
33
34
35
36
37
38
39

#include "beblocksched.h"

#include <stdlib.h>

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

#include "iredges.h"
#include "irgwalk.h"
Michael Beck's avatar
Michael Beck committed
40
#include "irnode_t.h"
41
42
43
#include "irgraph_t.h"
#include "irloop.h"
#include "irprintf.h"
Michael Beck's avatar
Michael Beck committed
44
#include "execfreq.h"
45
#include "irdump_t.h"
46
47
#include "irtools.h"
#include "debug.h"
48
#include "beirgmod.h"
49
50
#include "bemodule.h"
#include "be.h"
51
52
53
54

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

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

59
60
61
62
63
64
typedef enum _blocksched_algos_t {
	BLOCKSCHED_NAIV, BLOCKSCHED_EXTBB, BLOCKSCHED_GREEDY, BLOCKSCHED_ILP
} blocksched_algos_t;

static int algo = BLOCKSCHED_GREEDY;

65
66
67
68
69
70
71

#ifdef WITH_LIBCORE

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

72
73
74
75
76
77
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
78
#endif /* WITH_ILP */
79
80
81
82
83
84
85
86
	{ 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
87
	LC_OPT_ENT_ENUM_INT ("algo", "the block scheduling algorithm", &algo_var),
88
	LC_OPT_LAST
89
};
90
#endif /* WITH_LIBCORE */
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107

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

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 {
108
109
110
	ir_node *block;             /**< source block */
	int     pos;                /**< number of cfg predecessor (target) */
	double  execfreq;           /**< the frequency */
111
	int     highest_execfreq;   /**< flag that indicates whether this edge is the edge with the highest
112
113
114
115
							   	     execfreq pointing away from this block */
} edge_t;

typedef struct _blocksched_env_t {
116
	ir_graph       *irg;
117
	struct obstack *obst;
118
119
120
121
	ir_exec_freq   *execfreqs;
	edge_t         *edges;
	pdeq           *worklist;
	int            blockcount;
122
123
} blocksched_env_t;

124
125
126
127
/**
 * Collect cfg frequencies of all edges between blocks.
 * Also determines edge with highest frequency.
 */
128
129
static void collect_egde_frequency(ir_node *block, void *data)
{
130
	blocksched_env_t   *env = data;
131
132
	int                arity;
	edge_t             edge;
133
134
	blocksched_entry_t *entry;

135
	entry        = obstack_alloc(env->obst, sizeof(entry[0]));
136
	entry->block = block;
137
138
	entry->next  = NULL;
	entry->prev  = NULL;
139
140
	set_irn_link(block, entry);

141
	if (block == get_irg_start_block(env->irg))
142
143
		return;

144
	arity = get_Block_n_cfgpreds(block);
145
146
147
148
149

	if (arity == 1) {
		edge.block            = block;
		edge.pos              = 0;
		edge.execfreq         = get_block_execfreq(env->execfreqs, block);
150
151
152
		edge.highest_execfreq = 1;
		ARR_APP1(edge_t, env->edges, edge);
	} else {
153
		int    i;
154
		double highest_execfreq = -1.0;
155
		int    highest_edge_num = -1;
156
157

		edge.block = block;
158
159
		for (i = 0; i < arity; ++i) {
			double  execfreq;
160
			ir_node *pred_block = get_Block_cfgpred_block(block, i);
161

162
163
			execfreq = get_block_execfreq(env->execfreqs, pred_block);

164
165
			edge.pos              = i;
			edge.execfreq         = execfreq;
166
167
			edge.highest_execfreq = 0;
			ARR_APP1(edge_t, env->edges, edge);
168
169

			if (execfreq > highest_execfreq) {
170
171
172
173
174
				highest_execfreq = execfreq;
				highest_edge_num = ARR_LEN(env->edges) - 1;
			}
		}

175
176
		if(highest_edge_num >= 0)
			env->edges[highest_edge_num].highest_execfreq = 1;
177
178
179
180
181
182
183
	}
}

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

	return QSORT_CMP(e2->execfreq, e1->execfreq);
186
187
188
189
190
191
192
}

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

193
194
195
196
197
	/* 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;
198
199
		blocksched_entry_t *entry, *pred_entry;

200
201
		/* the block might have been removed already... */
		if (is_Bad(get_Block_cfgpred(block, 0)))
202
203
			continue;

204
205
		/* only check edge with highest frequency */
		if (! edge->highest_execfreq)
206
207
208
			continue;

		pred_block = get_Block_cfgpred_block(block, edge->pos);
209
		entry      = get_irn_link(block);
210
211
		pred_entry = get_irn_link(pred_block);

212
		if (pred_entry->next != NULL || entry->prev != NULL)
213
			continue;
214
215
216

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

219
		/* schedule the 2 blocks behind each other */
Matthias Braun's avatar
Matthias Braun committed
220
		DBG((dbg, LEVEL_1, "Coalesce (Jump) %+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
228
229
230
	/* 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;
231
232
		blocksched_entry_t *entry, *pred_entry;

233
234
		/* the block might have been removed already... */
		if (is_Bad(get_Block_cfgpred(block, 0)))
235
236
237
			continue;

		pred_block = get_Block_cfgpred_block(block, edge->pos);
238
		entry      = get_irn_link(block);
239
240
		pred_entry = get_irn_link(pred_block);

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

245
		/* schedule the 2 blocks behind each other */
Matthias Braun's avatar
Matthias Braun committed
246
		DBG((dbg, LEVEL_1, "Coalesce (CondJump) %+F -> %+F (%.3g)\n",
247
		           pred_entry->block, entry->block, edge->execfreq));
248
		pred_entry->next = entry;
249
		entry->prev      = pred_entry;
250
251
252
253
254
	}
}

static void pick_block_successor(blocksched_entry_t *entry, blocksched_env_t *env)
{
255
256
	ir_node            *block = entry->block;
	ir_node            *succ  = NULL;
257
	blocksched_entry_t *succ_entry;
258
259
	const ir_edge_t    *edge;
	double             best_succ_execfreq;
260

261
	if (irn_visited(block))
262
		return;
263

264
265
266
	env->blockcount++;
	mark_irn_visited(block);

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

269
	/* put all successors into the worklist */
270
271
272
	foreach_block_succ(block, edge) {
		ir_node *succ_block = get_edge_src_irn(edge);

273
		if (irn_visited(succ_block))
274
275
			continue;

276
277
		/* we only need to put the first of a series of already connected
		 * blocks into the worklist */
278
		succ_entry = get_irn_link(succ_block);
279
280
281
		while (succ_entry->prev != NULL) {
			/* break cycles... */
			if (succ_entry->prev->block == succ_block) {
282
				succ_entry->prev->next = NULL;
283
				succ_entry->prev       = NULL;
284
285
286
287
288
				break;
			}
			succ_entry = succ_entry->prev;
		};

289
		if (irn_visited(succ_entry->block))
290
291
			continue;

Matthias Braun's avatar
Matthias Braun committed
292
		DBG((dbg, LEVEL_1, "Put %+F into worklist\n", succ_entry->block));
293
294
295
		pdeq_putr(env->worklist, succ_entry->block);
	}

296
	if (entry->next != NULL) {
297
298
299
300
		pick_block_successor(entry->next, env);
		return;
	}

Matthias Braun's avatar
Matthias Braun committed
301
	DBG((dbg, LEVEL_1, "deciding...\n"));
302
	best_succ_execfreq = -1;
303

304
	/* no successor yet: pick the successor block with the highest execution
305
306
	 * frequency which has no predecessor yet */

307
308
	foreach_block_succ(block, edge) {
		ir_node *succ_block = get_edge_src_irn(edge);
309
		double  execfreq;
310

311
		if (irn_visited(succ_block))
312
313
314
			continue;

		succ_entry = get_irn_link(succ_block);
315
		if (succ_entry->prev != NULL)
316
317
			continue;

Michael Beck's avatar
Michael Beck committed
318
		execfreq = get_block_execfreq(env->execfreqs, succ_block);
319
		if (execfreq > best_succ_execfreq) {
320
321
322
323
324
			best_succ_execfreq = execfreq;
			succ = succ_block;
		}
	}

325
	if (succ == NULL) {
Matthias Braun's avatar
Matthias Braun committed
326
		DBG((dbg, LEVEL_1, "pick from worklist\n"));
327
328

		do {
329
			if (pdeq_empty(env->worklist)) {
Matthias Braun's avatar
Matthias Braun committed
330
				DBG((dbg, LEVEL_1, "worklist empty\n"));
331
332
333
				return;
			}
			succ = pdeq_getl(env->worklist);
334
		} while (irn_visited(succ));
335
336
	}

337
338
	succ_entry       = get_irn_link(succ);
	entry->next      = succ_entry;
339
340
341
342
343
344
345
	succ_entry->prev = entry;

	pick_block_successor(succ_entry, env);
}

static blocksched_entry_t *finish_block_schedule(blocksched_env_t *env)
{
346
347
348
	ir_graph           *irg        = env->irg;
	ir_node            *startblock = get_irg_start_block(irg);
	blocksched_entry_t *entry      = get_irn_link(startblock);
349

350
	set_using_visited(irg);
351
352
353
354
355
356
357
	inc_irg_visited(irg);

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

358
359
	clear_using_visited(irg);

360
361
362
	return entry;
}

363
364
365
366
367
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;
368
	blocksched_entry_t *entry;
369
	(void) env;
370
371

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

	for (entry = first; entry != NULL; entry = entry->next) {
375
376
		assert(i < count);
		block_list[i++] = entry->block;
Matthias Braun's avatar
Matthias Braun committed
377
		DBG((dbg, LEVEL_1, "\t%+F\n", entry->block));
378
379
380
381
382
383
384
385
	}
	assert(i == count);

	return block_list;
}

static ir_node **create_block_schedule_greedy(ir_graph *irg, ir_exec_freq *execfreqs)
{
386
387
	blocksched_env_t   env;
	struct obstack     obst;
388
	blocksched_entry_t *start_entry;
389
	ir_node            **block_list;
390
391
392

	obstack_init(&obst);

393
394
395
396
397
	env.irg        = irg;
	env.obst       = &obst;
	env.execfreqs  = execfreqs;
	env.edges      = NEW_ARR_F(edge_t, 0);
	env.worklist   = NULL;
398
399
400
401
402
403
404
405
	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);

406
	(void)be_remove_empty_blocks(irg);
407

408
	if (algo != BLOCKSCHED_NAIV)
409
410
411
		coalesce_blocks(&env);

	start_entry = finish_block_schedule(&env);
412
	block_list  = create_blocksched_array(&env, start_entry, env.blockcount, get_irg_obstack(irg));
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430

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

	return block_list;
}

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

#ifdef WITH_ILP
typedef struct _ilp_edge_t {
431
432
433
	ir_node *block;   /**< source block */
	int     pos;      /**< number of cfg predecessor (target) */
	int     ilpvar;
434
435
436
437
} ilp_edge_t;

typedef struct _blocksched_ilp_env_t {
	blocksched_env_t env;
438
439
	ilp_edge_t       *ilpedges;
	lpp_t            *lpp;
440
441
442
443
444
445
446
447
448
449
450
451
} 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)
{
452
	char       name[64];
453
	ilp_edge_t edge;
454
	int        edgeidx = ARR_LEN(env->ilpedges);
455
456
457

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

458
459
	edge.block  = block;
	edge.pos    = pos;
460
461
462
463
464
465
466
467
	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)
{
468
469
470
471
472
473
474
	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;
475
476
477
478
479
	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);

480
481
482
483
	entry          = obstack_alloc(env->env.obst, sizeof(entry[0]));
	entry->block   = block;
	entry->next    = NULL;
	entry->prev    = NULL;
484
485
486
	entry->out_cst = lpp_add_cst_uniq(env->lpp, name, lpp_greater, out_count - 1);
	set_irn_link(block, entry);

487
	if (block == startblock)
488
489
490
		return;

	arity = get_irn_arity(block);
491
	if (arity == 1) {
492
493
		double execfreq = get_block_execfreq(env->env.execfreqs, block);
		add_ilp_edge(block, 0, execfreq, env);
494
495
	}
	else {
496
497
498
499
500
501
		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);

502
503
504
		for (i = 0; i < arity; ++i) {
			double     execfreq;
			int        edgenum;
505
			ilp_edge_t *edge;
506
			ir_node    *pred_block = get_Block_cfgpred_block(block, i);
507
508

			execfreq = get_block_execfreq(env->env.execfreqs, pred_block);
509
510
			edgenum  = add_ilp_edge(block, i, execfreq, env);
			edge     = &env->ilpedges[edgenum];
511
512
513
514
515
516
517
518
			lpp_set_factor_fast(env->lpp, cst, edge->ilpvar, 1.0);
		}
	}
}


static void coalesce_blocks_ilp(blocksched_ilp_env_t *env)
{
519
520
	int  i;
	int  edge_count = ARR_LEN(env->ilpedges);
521
522
523

	/* complete out constraints */
	for(i = 0; i < edge_count; ++i) {
524
525
526
		const ilp_edge_t *edge  = &env->ilpedges[i];
		ir_node          *block = edge->block;
		ir_node          *pred;
527
528
		blocksched_ilp_entry_t *entry;

529
530
		/* the block might have been removed already... */
		if (is_Bad(get_Block_cfgpred(block, 0)))
531
532
			continue;

533
		pred  = get_Block_cfgpred_block(block, edge->pos);
534
535
		entry = get_irn_link(pred);

Matthias Braun's avatar
Matthias Braun committed
536
		DBG((dbg, LEVEL_1, "Adding out cst to %+F from %+F,%d\n",
537
				  pred, block, edge->pos));
538
539
540
		lpp_set_factor_fast(env->lpp, entry->out_cst, edge->ilpvar, 1.0);
	}

541
542
543
544
545
546
547
548
549
550
551
552
#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

553
554
555
556
557
	//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 */
558
559
560
561
562
	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;
563
564
565
		blocksched_entry_t *entry;
		blocksched_entry_t *pred_entry;

566
567
		/* the block might have been removed already... */
		if (is_Bad(get_Block_cfgpred(block, 0)))
568
569
			continue;

570
		is_jump = (int)lpp_get_var_sol(env->lpp, edge->ilpvar);
571
		if (is_jump)
572
573
			continue;

574
575
		pred       = get_Block_cfgpred_block(block, edge->pos);
		entry      = get_irn_link(block);
576
577
578
		pred_entry = get_irn_link(pred);

		assert(entry->prev == NULL && pred_entry->next == NULL);
579
		entry->prev      = pred_entry;
580
581
582
583
584
585
586
		pred_entry->next = entry;
	}
}

static ir_node **create_block_schedule_ilp(ir_graph *irg, ir_exec_freq *execfreqs)
{
	blocksched_ilp_env_t env;
587
588
589
	struct obstack       obst;
	blocksched_entry_t   *start_entry;
	ir_node              **block_list;
590
591
592

	obstack_init(&obst);

593
594
595
596
	env.env.irg        = irg;
	env.env.obst       = &obst;
	env.env.execfreqs  = execfreqs;
	env.env.worklist   = NULL;
597
	env.env.blockcount = 0;
598
	env.ilpedges       = NEW_ARR_F(ilp_edge_t, 0);
599
600
601
602
603
604
605

	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);

606
	(void)be_remove_empty_blocks(irg);
607
608
609
	coalesce_blocks_ilp(&env);

	start_entry = finish_block_schedule(&env.env);
610
	block_list  = create_blocksched_array(&env.env, start_entry, env.env.blockcount, get_irg_obstack(irg));
611
612
613
614
615
616
617

	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
618
#endif /* WITH_ILP */
619
620
621
622
623
624
625
626
627
628
629
630

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

/** A simple forward single linked list. */
typedef struct {
631
632
	ir_node  *start;   /**< start of the list */
	ir_node  *end;     /**< last block in the list */
633
634
635
636
	unsigned n_blks;  /**< number of blocks in the list */
} anchor;

static void add_block(anchor *list, ir_node *block) {
637
	if (list->start == NULL) {
638
		list->start = block;
639
		list->end   = block;
640
	} else {
641
642
643
644
645
646
647
648
		set_irn_link(list->end, block);
		list->end = block;
	}

	list->n_blks++;
}

static void create_block_list(ir_node *leader_block, anchor *list) {
649
	int             i;
650
	const ir_edge_t *edge;
651
652
	ir_node         *block = NULL;
	ir_extblk       *extbb = get_Block_extbb(leader_block);
653

654
	if (extbb_visited(extbb))
655
656
657
		return;
	mark_extbb_visited(extbb);

658
	for (i = 0; i < get_extbb_n_blocks(extbb); ++i) {
659
660
661
662
663
664
		block = get_extbb_block(extbb, i);
		add_block(list, block);
	}

	assert(block != NULL);

665
	/* pick successor extbbs */
666
667
668
669
670
	foreach_block_succ(block, edge) {
		ir_node *succ = get_edge_src_irn(edge);
		create_block_list(succ, list);
	}

671
	for (i = 0; i < get_extbb_n_blocks(extbb) - 1; ++i) {
672
		block = get_extbb_block(extbb, i);
673

674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
		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;
700
701
702

	set_using_irn_link(irg);
	set_using_visited(irg);
703
	inc_irg_block_visited(irg);
704

705
706
707
708
709
710
711
712
713
714
	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;
	}

715
716
717
	clear_using_irn_link(irg);
	clear_using_visited(irg);

718
719
720
721
722
723
724
725
726
727
728
	return blk_list;
}

/*
 *  __  __       _
 * |  \/  | __ _(_)_ __
 * | |\/| |/ _` | | '_ \
 * | |  | | (_| | | | | |
 * |_|  |_|\__,_|_|_| |_|
 *
 */
729
void be_init_blocksched(void)
730
{
731
#ifdef WITH_LIBCORE
732
733
	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");
734
735

	lc_opt_add_table(blocksched_grp, be_blocksched_options);
736
#endif
Matthias Braun's avatar
Matthias Braun committed
737
	FIRM_DBG_REGISTER(dbg, "firm.be.blocksched");
738
}
739
740

BE_REGISTER_MODULE_CONSTRUCTOR(be_init_blocksched);
741
742
743
744
745
746
747
748
749
750
751
752

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
753
#endif /* WITH_ILP */
754
755
756
757
758
	}

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