beblocksched.c 19.8 KB
Newer Older
Christian Würdig's avatar
Christian Würdig committed
1
/*
Michael Beck's avatar
Michael Beck committed
2
 * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
Christian Würdig's avatar
Christian Würdig committed
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 *
 * 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
28
29
30
31
32
33
34
35
 *
 * The goals of the greedy (and ILP) algorithm here works by assuming that
 * we want to change as many jumps to fallthroughs as possible (executed jumps
 * actually, we have to look at the execution frequencies). The algorithms
 * do this by collecting execution frequencies of all branches (which is easily
 * possible when all critical edges are split) then removes critical edges where
 * possible as we don't need and want them anymore now. The algorithms then try
 * to change as many edges to fallthroughs as possible, this is done by setting
 * a next and prev pointers on blocks. The greedy algorithm sorts the edges by
 * execution frequencies and tries to transform them to fallthroughs in this order
36
 */
37
#include "config.h"
38
39
40
41
42
43
44
45
46
47

#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
48
#include "irnode_t.h"
49
50
51
#include "irgraph_t.h"
#include "irloop.h"
#include "irprintf.h"
Michael Beck's avatar
Michael Beck committed
52
#include "execfreq.h"
53
#include "irdump_t.h"
54
55
#include "irtools.h"
#include "debug.h"
56
#include "beirgmod.h"
57
58
#include "bemodule.h"
#include "be.h"
59
#include "error.h"
60

Matthias Braun's avatar
Matthias Braun committed
61
62
#include "lc_opts.h"
#include "lc_opts_enum.h"
63

64
65
66
#ifdef WITH_ILP
#include <lpp/lpp.h>
#include <lpp/lpp_net.h>
Christian Würdig's avatar
Christian Würdig committed
67
#endif /* WITH_ILP */
68

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

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

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

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

typedef struct _blocksched_env_t {
120
	ir_graph       *irg;
121
	struct obstack *obst;
122
123
124
125
	ir_exec_freq   *execfreqs;
	edge_t         *edges;
	pdeq           *worklist;
	int            blockcount;
126
127
} blocksched_env_t;

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

139
	entry        = obstack_alloc(env->obst, sizeof(entry[0]));
140
	entry->block = block;
141
142
	entry->next  = NULL;
	entry->prev  = NULL;
143
144
	set_irn_link(block, entry);

145
	arity = get_Block_n_cfgpreds(block);
146

147
	if (arity == 0) {
148
149
150
151
		assert(block == get_irg_start_block(env->irg)
				|| block == get_irg_end_block(env->irg));
		/* must be the start block (or end-block for endless loops), nothing to
		 * do here */
152
153
		return;
	} else if (arity == 1) {
154
155
156
		edge.block            = block;
		edge.pos              = 0;
		edge.execfreq         = get_block_execfreq(env->execfreqs, block);
157
158
159
		edge.highest_execfreq = 1;
		ARR_APP1(edge_t, env->edges, edge);
	} else {
160
		int    i;
161
		double highest_execfreq = -1.0;
162
		int    highest_edge_num = -1;
163
164

		edge.block = block;
165
166
		for (i = 0; i < arity; ++i) {
			double  execfreq;
167
			ir_node *pred_block = get_Block_cfgpred_block(block, i);
168

169
170
			execfreq = get_block_execfreq(env->execfreqs, pred_block);

171
172
			edge.pos              = i;
			edge.execfreq         = execfreq;
173
174
			edge.highest_execfreq = 0;
			ARR_APP1(edge_t, env->edges, edge);
175
176

			if (execfreq > highest_execfreq) {
177
178
179
180
181
				highest_execfreq = execfreq;
				highest_edge_num = ARR_LEN(env->edges) - 1;
			}
		}

182
183
		if(highest_edge_num >= 0)
			env->edges[highest_edge_num].highest_execfreq = 1;
184
185
186
187
188
189
190
	}
}

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

	return QSORT_CMP(e2->execfreq, e1->execfreq);
193
194
195
196
197
198
199
}

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

200
201
202
203
	/* run1: only look at jumps */
	for (i = 0; i < edge_count; ++i) {
		const edge_t *edge  = &env->edges[i];
		ir_node      *block = edge->block;
204
		int           pos   = edge->pos;
205
		ir_node      *pred_block;
206
207
		blocksched_entry_t *entry, *pred_entry;

208
209
		/* only check edge with highest frequency */
		if (! edge->highest_execfreq)
210
211
			continue;

212
213
214
215
216
		/* the block might have been removed already... */
		if (is_Bad(get_Block_cfgpred(block, 0)))
			continue;

		pred_block = get_Block_cfgpred_block(block, pos);
217
		entry      = get_irn_link(block);
218
219
		pred_entry = get_irn_link(pred_block);

220
		if (pred_entry->next != NULL || entry->prev != NULL)
221
			continue;
222
223
224

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

227
		/* schedule the 2 blocks behind each other */
Matthias Braun's avatar
Matthias Braun committed
228
		DBG((dbg, LEVEL_1, "Coalesce (Jump) %+F -> %+F (%.3g)\n",
229
		           pred_entry->block, entry->block, edge->execfreq));
230
		pred_entry->next = entry;
231
		entry->prev      = pred_entry;
232
233
	}

234
235
236
237
	/* run2: remaining edges */
	for (i = 0; i < edge_count; ++i) {
		const edge_t *edge  = &env->edges[i];
		ir_node      *block = edge->block;
238
		int           pos   = edge->pos;
239
		ir_node      *pred_block;
240
241
		blocksched_entry_t *entry, *pred_entry;

242
243
		/* the block might have been removed already... */
		if (is_Bad(get_Block_cfgpred(block, 0)))
244
245
			continue;

246
247
		/* we can't do fallthroughs in backedges */
		if (is_backedge(block, pos))
248
249
250
			continue;

		pred_block = get_Block_cfgpred_block(block, pos);
251
		entry      = get_irn_link(block);
252
253
		pred_entry = get_irn_link(pred_block);

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

258
		/* schedule the 2 blocks behind each other */
Matthias Braun's avatar
Matthias Braun committed
259
		DBG((dbg, LEVEL_1, "Coalesce (CondJump) %+F -> %+F (%.3g)\n",
260
		           pred_entry->block, entry->block, edge->execfreq));
261
		pred_entry->next = entry;
262
		entry->prev      = pred_entry;
263
264
265
266
267
	}
}

static void pick_block_successor(blocksched_entry_t *entry, blocksched_env_t *env)
{
268
269
	ir_node            *block = entry->block;
	ir_node            *succ  = NULL;
270
	blocksched_entry_t *succ_entry;
271
272
	const ir_edge_t    *edge;
	double             best_succ_execfreq;
273

274
	if (irn_visited_else_mark(block))
275
		return;
276

277
278
	env->blockcount++;

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

281
	/* put all successors into the worklist */
282
283
284
	foreach_block_succ(block, edge) {
		ir_node *succ_block = get_edge_src_irn(edge);

285
		if (irn_visited(succ_block))
286
287
			continue;

288
289
		/* we only need to put the first of a series of already connected
		 * blocks into the worklist */
290
		succ_entry = get_irn_link(succ_block);
291
292
293
		while (succ_entry->prev != NULL) {
			/* break cycles... */
			if (succ_entry->prev->block == succ_block) {
294
				succ_entry->prev->next = NULL;
295
				succ_entry->prev       = NULL;
296
297
298
299
300
				break;
			}
			succ_entry = succ_entry->prev;
		};

301
		if (irn_visited(succ_entry->block))
302
303
			continue;

Matthias Braun's avatar
Matthias Braun committed
304
		DBG((dbg, LEVEL_1, "Put %+F into worklist\n", succ_entry->block));
305
306
307
		pdeq_putr(env->worklist, succ_entry->block);
	}

308
	if (entry->next != NULL) {
309
310
311
312
		pick_block_successor(entry->next, env);
		return;
	}

Matthias Braun's avatar
Matthias Braun committed
313
	DBG((dbg, LEVEL_1, "deciding...\n"));
314
	best_succ_execfreq = -1;
315

316
	/* no successor yet: pick the successor block with the highest execution
317
318
	 * frequency which has no predecessor yet */

319
320
	foreach_block_succ(block, edge) {
		ir_node *succ_block = get_edge_src_irn(edge);
321
		double  execfreq;
322

323
		if (irn_visited(succ_block))
324
325
326
			continue;

		succ_entry = get_irn_link(succ_block);
327
		if (succ_entry->prev != NULL)
328
329
			continue;

Michael Beck's avatar
Michael Beck committed
330
		execfreq = get_block_execfreq(env->execfreqs, succ_block);
331
		if (execfreq > best_succ_execfreq) {
332
333
334
335
336
			best_succ_execfreq = execfreq;
			succ = succ_block;
		}
	}

337
	if (succ == NULL) {
Matthias Braun's avatar
Matthias Braun committed
338
		DBG((dbg, LEVEL_1, "pick from worklist\n"));
339
340

		do {
341
			if (pdeq_empty(env->worklist)) {
Matthias Braun's avatar
Matthias Braun committed
342
				DBG((dbg, LEVEL_1, "worklist empty\n"));
343
344
345
				return;
			}
			succ = pdeq_getl(env->worklist);
346
		} while (irn_visited(succ));
347
348
	}

349
350
	succ_entry       = get_irn_link(succ);
	entry->next      = succ_entry;
351
352
353
354
355
356
357
	succ_entry->prev = entry;

	pick_block_successor(succ_entry, env);
}

static blocksched_entry_t *finish_block_schedule(blocksched_env_t *env)
{
358
359
360
	ir_graph           *irg        = env->irg;
	ir_node            *startblock = get_irg_start_block(irg);
	blocksched_entry_t *entry      = get_irn_link(startblock);
361

362
	ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
363
364
365
366
367
368
369
	inc_irg_visited(irg);

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

370
	ir_free_resources(irg, IR_RESOURCE_IRN_VISITED);
371

372
373
374
	return entry;
}

375
376
377
378
379
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;
380
	blocksched_entry_t *entry;
381
	(void) env;
382
383

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

	for (entry = first; entry != NULL; entry = entry->next) {
387
388
		assert(i < count);
		block_list[i++] = entry->block;
Matthias Braun's avatar
Matthias Braun committed
389
		DBG((dbg, LEVEL_1, "\t%+F\n", entry->block));
390
391
392
393
394
395
396
397
	}
	assert(i == count);

	return block_list;
}

static ir_node **create_block_schedule_greedy(ir_graph *irg, ir_exec_freq *execfreqs)
{
398
399
	blocksched_env_t   env;
	struct obstack     obst;
400
	blocksched_entry_t *start_entry;
401
	ir_node            **block_list;
402
403
404

	obstack_init(&obst);

405
406
407
408
409
	env.irg        = irg;
	env.obst       = &obst;
	env.execfreqs  = execfreqs;
	env.edges      = NEW_ARR_F(edge_t, 0);
	env.worklist   = NULL;
410
411
412
413
414
415
416
417
	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);

418
	(void)be_remove_empty_blocks(irg);
419

420
	if (algo != BLOCKSCHED_NAIV)
421
422
423
		coalesce_blocks(&env);

	start_entry = finish_block_schedule(&env);
424
	block_list  = create_blocksched_array(&env, start_entry, env.blockcount, get_irg_obstack(irg));
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442

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

	return block_list;
}

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

#ifdef WITH_ILP
typedef struct _ilp_edge_t {
443
444
445
	ir_node *block;   /**< source block */
	int     pos;      /**< number of cfg predecessor (target) */
	int     ilpvar;
446
447
448
449
} ilp_edge_t;

typedef struct _blocksched_ilp_env_t {
	blocksched_env_t env;
450
451
	ilp_edge_t       *ilpedges;
	lpp_t            *lpp;
452
453
454
455
456
457
458
459
460
461
462
463
} 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)
{
464
	char       name[64];
465
	ilp_edge_t edge;
466
	int        edgeidx = ARR_LEN(env->ilpedges);
467
468
469

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

470
471
	edge.block  = block;
	edge.pos    = pos;
472
473
474
475
476
477
478
479
	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)
{
480
481
482
483
484
485
486
	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;
487
488
489
490
491
	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);

492
493
494
495
	entry          = obstack_alloc(env->env.obst, sizeof(entry[0]));
	entry->block   = block;
	entry->next    = NULL;
	entry->prev    = NULL;
496
497
498
	entry->out_cst = lpp_add_cst_uniq(env->lpp, name, lpp_greater, out_count - 1);
	set_irn_link(block, entry);

499
	if (block == startblock)
500
501
502
		return;

	arity = get_irn_arity(block);
503
	if (arity == 1) {
504
505
		double execfreq = get_block_execfreq(env->env.execfreqs, block);
		add_ilp_edge(block, 0, execfreq, env);
506
507
	}
	else {
508
509
510
511
512
		int i;

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

513
514
515
		for (i = 0; i < arity; ++i) {
			double     execfreq;
			int        edgenum;
516
			ilp_edge_t *edge;
517
			ir_node    *pred_block = get_Block_cfgpred_block(block, i);
518
519

			execfreq = get_block_execfreq(env->env.execfreqs, pred_block);
520
521
			edgenum  = add_ilp_edge(block, i, execfreq, env);
			edge     = &env->ilpedges[edgenum];
522
523
524
525
526
527
528
529
			lpp_set_factor_fast(env->lpp, cst, edge->ilpvar, 1.0);
		}
	}
}


static void coalesce_blocks_ilp(blocksched_ilp_env_t *env)
{
530
531
	int  i;
	int  edge_count = ARR_LEN(env->ilpedges);
532
533
534

	/* complete out constraints */
	for(i = 0; i < edge_count; ++i) {
535
536
537
		const ilp_edge_t *edge  = &env->ilpedges[i];
		ir_node          *block = edge->block;
		ir_node          *pred;
538
539
		blocksched_ilp_entry_t *entry;

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

544
		pred  = get_Block_cfgpred_block(block, edge->pos);
545
546
		entry = get_irn_link(pred);

Matthias Braun's avatar
Matthias Braun committed
547
		DBG((dbg, LEVEL_1, "Adding out cst to %+F from %+F,%d\n",
548
				  pred, block, edge->pos));
549
550
551
		lpp_set_factor_fast(env->lpp, entry->out_cst, edge->ilpvar, 1.0);
	}

552
553
554
555
556
557
558
559
560
561
562
563
#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

564
565
566
567
568
	//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 */
569
570
571
572
573
	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;
574
575
576
		blocksched_entry_t *entry;
		blocksched_entry_t *pred_entry;

577
578
		/* the block might have been removed already... */
		if (is_Bad(get_Block_cfgpred(block, 0)))
579
580
			continue;

581
		is_jump = (int)lpp_get_var_sol(env->lpp, edge->ilpvar);
582
		if (is_jump)
583
584
			continue;

585
586
		pred       = get_Block_cfgpred_block(block, edge->pos);
		entry      = get_irn_link(block);
587
588
589
		pred_entry = get_irn_link(pred);

		assert(entry->prev == NULL && pred_entry->next == NULL);
590
		entry->prev      = pred_entry;
591
592
593
594
595
596
597
		pred_entry->next = entry;
	}
}

static ir_node **create_block_schedule_ilp(ir_graph *irg, ir_exec_freq *execfreqs)
{
	blocksched_ilp_env_t env;
598
599
600
	struct obstack       obst;
	blocksched_entry_t   *start_entry;
	ir_node              **block_list;
601
602
603

	obstack_init(&obst);

604
605
606
607
	env.env.irg        = irg;
	env.env.obst       = &obst;
	env.env.execfreqs  = execfreqs;
	env.env.worklist   = NULL;
608
	env.env.blockcount = 0;
609
	env.ilpedges       = NEW_ARR_F(ilp_edge_t, 0);
610
611
612
613
614
615
616

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

617
	(void)be_remove_empty_blocks(irg);
618
619
620
	coalesce_blocks_ilp(&env);

	start_entry = finish_block_schedule(&env.env);
621
	block_list  = create_blocksched_array(&env.env, start_entry, env.env.blockcount, get_irg_obstack(irg));
622
623
624
625
626
627
628

	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
629
#endif /* WITH_ILP */
630
631
632
633
634
635
636
637
638
639
640
641

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

/** A simple forward single linked list. */
typedef struct {
642
643
	ir_node  *start;   /**< start of the list */
	ir_node  *end;     /**< last block in the list */
644
645
646
647
	unsigned n_blks;  /**< number of blocks in the list */
} anchor;

static void add_block(anchor *list, ir_node *block) {
648
	if (list->start == NULL) {
649
		list->start = block;
650
		list->end   = block;
651
	} else {
652
653
654
655
656
657
658
659
		set_irn_link(list->end, block);
		list->end = block;
	}

	list->n_blks++;
}

static void create_block_list(ir_node *leader_block, anchor *list) {
660
	int             i;
661
	const ir_edge_t *edge;
662
663
	ir_node         *block = NULL;
	ir_extblk       *extbb = get_Block_extbb(leader_block);
664

665
	if (extbb_visited(extbb))
666
667
668
		return;
	mark_extbb_visited(extbb);

669
	for (i = 0; i < get_extbb_n_blocks(extbb); ++i) {
670
671
672
673
674
675
		block = get_extbb_block(extbb, i);
		add_block(list, block);
	}

	assert(block != NULL);

676
	/* pick successor extbbs */
677
678
679
680
681
	foreach_block_succ(block, edge) {
		ir_node *succ = get_edge_src_irn(edge);
		create_block_list(succ, list);
	}

682
	for (i = 0; i < get_extbb_n_blocks(extbb) - 1; ++i) {
683
		block = get_extbb_block(extbb, i);
684

685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
		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;
711

712
	ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED | IR_RESOURCE_IRN_LINK);
713
	inc_irg_block_visited(irg);
714

715
716
717
718
719
720
721
722
723
724
	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;
	}

725
	ir_free_resources(irg, IR_RESOURCE_IRN_VISITED | IR_RESOURCE_IRN_LINK);
726

727
728
729
730
731
732
733
734
735
736
737
	return blk_list;
}

/*
 *  __  __       _
 * |  \/  | __ _(_)_ __
 * | |\/| |/ _` | | '_ \
 * | |  | | (_| | | | | |
 * |_|  |_|\__,_|_|_| |_|
 *
 */
738
void be_init_blocksched(void)
739
{
740
741
	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");
742
743

	lc_opt_add_table(blocksched_grp, be_blocksched_options);
744

Matthias Braun's avatar
Matthias Braun committed
745
	FIRM_DBG_REGISTER(dbg, "firm.be.blocksched");
746
}
747
748

BE_REGISTER_MODULE_CONSTRUCTOR(be_init_blocksched);
749
750
751
752
753
754
755
756
757
758
759
760

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
761
#endif /* WITH_ILP */
762
763
	}

764
	panic("unknown blocksched algo");
765
766
	return NULL;
}