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
 */
#ifdef HAVE_CONFIG_H
38
#include "config.h"
Matthias Braun's avatar
Matthias Braun committed
39
#endif
40
41
42
43
44
45
46
47
48
49

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

62
63
64
#include <libcore/lc_opts.h>
#include <libcore/lc_opts_enum.h>

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

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

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

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

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

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

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

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

146
	arity = get_Block_n_cfgpreds(block);
147

148
	if (arity == 0) {
149
150
151
152
		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 */
153
154
		return;
	} else if (arity == 1) {
155
156
157
		edge.block            = block;
		edge.pos              = 0;
		edge.execfreq         = get_block_execfreq(env->execfreqs, block);
158
159
160
		edge.highest_execfreq = 1;
		ARR_APP1(edge_t, env->edges, edge);
	} else {
161
		int    i;
162
		double highest_execfreq = -1.0;
163
		int    highest_edge_num = -1;
164
165

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

275
	if (irn_visited(block))
276
		return;
277

278
279
280
	env->blockcount++;
	mark_irn_visited(block);

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

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

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

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

303
		if (irn_visited(succ_entry->block))
304
305
			continue;

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

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

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

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

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

325
		if (irn_visited(succ_block))
326
327
328
			continue;

		succ_entry = get_irn_link(succ_block);
329
		if (succ_entry->prev != NULL)
330
331
			continue;

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

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

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

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

	pick_block_successor(succ_entry, env);
}

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

364
	set_using_irn_visited(irg);
365
366
367
368
369
370
371
	inc_irg_visited(irg);

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

372
	clear_using_irn_visited(irg);
373

374
375
376
	return entry;
}

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

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

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

	return block_list;
}

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

	obstack_init(&obst);

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

420
	(void)be_remove_empty_blocks(irg);
421

422
	if (algo != BLOCKSCHED_NAIV)
423
424
425
		coalesce_blocks(&env);

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

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

	return block_list;
}

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

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

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

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

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

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

501
	if (block == startblock)
502
503
504
		return;

	arity = get_irn_arity(block);
505
	if (arity == 1) {
506
507
		double execfreq = get_block_execfreq(env->env.execfreqs, block);
		add_ilp_edge(block, 0, execfreq, env);
508
509
	}
	else {
510
511
512
513
514
515
		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);

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

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


static void coalesce_blocks_ilp(blocksched_ilp_env_t *env)
{
533
534
	int  i;
	int  edge_count = ARR_LEN(env->ilpedges);
535
536
537

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

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

547
		pred  = get_Block_cfgpred_block(block, edge->pos);
548
549
		entry = get_irn_link(pred);

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

555
556
557
558
559
560
561
562
563
564
565
566
#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

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

580
581
		/* the block might have been removed already... */
		if (is_Bad(get_Block_cfgpred(block, 0)))
582
583
			continue;

584
		is_jump = (int)lpp_get_var_sol(env->lpp, edge->ilpvar);
585
		if (is_jump)
586
587
			continue;

588
589
		pred       = get_Block_cfgpred_block(block, edge->pos);
		entry      = get_irn_link(block);
590
591
592
		pred_entry = get_irn_link(pred);

		assert(entry->prev == NULL && pred_entry->next == NULL);
593
		entry->prev      = pred_entry;
594
595
596
597
598
599
600
		pred_entry->next = entry;
	}
}

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

	obstack_init(&obst);

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

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

620
	(void)be_remove_empty_blocks(irg);
621
622
623
	coalesce_blocks_ilp(&env);

	start_entry = finish_block_schedule(&env.env);
624
	block_list  = create_blocksched_array(&env.env, start_entry, env.env.blockcount, get_irg_obstack(irg));
625
626
627
628
629
630
631

	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
632
#endif /* WITH_ILP */
633
634
635
636
637
638
639
640
641
642
643
644

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

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

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

	list->n_blks++;
}

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

668
	if (extbb_visited(extbb))
669
670
671
		return;
	mark_extbb_visited(extbb);

672
	for (i = 0; i < get_extbb_n_blocks(extbb); ++i) {
673
674
675
676
677
678
		block = get_extbb_block(extbb, i);
		add_block(list, block);
	}

	assert(block != NULL);

679
	/* pick successor extbbs */
680
681
682
683
684
	foreach_block_succ(block, edge) {
		ir_node *succ = get_edge_src_irn(edge);
		create_block_list(succ, list);
	}

685
	for (i = 0; i < get_extbb_n_blocks(extbb) - 1; ++i) {
686
		block = get_extbb_block(extbb, i);
687

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

	set_using_irn_link(irg);
716
	set_using_irn_visited(irg);
717
	inc_irg_block_visited(irg);
718

719
720
721
722
723
724
725
726
727
728
	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;
	}

729
	clear_using_irn_link(irg);
730
	clear_using_irn_visited(irg);
731

732
733
734
735
736
737
738
739
740
741
742
	return blk_list;
}

/*
 *  __  __       _
 * |  \/  | __ _(_)_ __
 * | |\/| |/ _` | | '_ \
 * | |  | | (_| | | | | |
 * |_|  |_|\__,_|_|_| |_|
 *
 */
743
void be_init_blocksched(void)
744
{
745
746
	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");
747
748

	lc_opt_add_table(blocksched_grp, be_blocksched_options);
749

Matthias Braun's avatar
Matthias Braun committed
750
	FIRM_DBG_REGISTER(dbg, "firm.be.blocksched");
751
}
752
753

BE_REGISTER_MODULE_CONSTRUCTOR(be_init_blocksched);
754
755
756
757
758
759
760
761
762
763
764
765

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
766
#endif /* WITH_ILP */
767
768
769
770
771
	}

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