besched.c 7.99 KB
Newer Older
Christian Würdig's avatar
Christian Würdig committed
1
2
/* $Id$ */

Michael Beck's avatar
Michael Beck committed
3
#ifdef HAVE_CONFIG_H
Michael Beck's avatar
Michael Beck committed
4
# include "config.h"
Michael Beck's avatar
Michael Beck committed
5
#endif
6

Michael Beck's avatar
Michael Beck committed
7
8
9
#ifdef HAVE_STDLIB_H
# include <stdlib.h>
#endif
Sebastian Hack's avatar
Sebastian Hack committed
10

Sebastian Hack's avatar
Sebastian Hack committed
11
#include "impl.h"
12
13
#include "irprintf.h"
#include "irgwalk.h"
14
#include "irnode_t.h"
Michael Beck's avatar
Michael Beck committed
15
#include "irgraph_t.h"
16
#include "iredges_t.h"
17
#include "ircons.h"
Christian Würdig's avatar
Christian Würdig committed
18
#include "irextbb.h"
Sebastian Hack's avatar
Sebastian Hack committed
19
#include "debug.h"
20

Daniel Grund's avatar
Daniel Grund committed
21
#include "bearch.h"
Sebastian Hack's avatar
Sebastian Hack committed
22
#include "besched_t.h"
Sebastian Hack's avatar
Sebastian Hack committed
23
#include "beutil.h"
24
25
#include "belistsched.h"

Sebastian Hack's avatar
Sebastian Hack committed
26
FIRM_IMPL1(sched_get_time_step, int, const ir_node *)
27
FIRM_IMPL1(sched_has_next, int, const ir_node *)
Sebastian Hack's avatar
Sebastian Hack committed
28
FIRM_IMPL1(sched_has_prev, int, const ir_node *)
29
FIRM_IMPL1(sched_next, ir_node *, const ir_node *)
Sebastian Hack's avatar
Sebastian Hack committed
30
31
32
FIRM_IMPL1(sched_prev, ir_node *, const ir_node *)
FIRM_IMPL1(sched_first, ir_node *, const ir_node *)
FIRM_IMPL1(sched_last, ir_node *, const ir_node *)
Sebastian Hack's avatar
Sebastian Hack committed
33
34
FIRM_IMPL2(sched_add_after, ir_node *, ir_node *, ir_node *)
FIRM_IMPL2(sched_add_before, ir_node *, ir_node *, ir_node *)
Michael Beck's avatar
Michael Beck committed
35
FIRM_IMPL2(sched_comes_after, int, const ir_node *, const ir_node *)
36
FIRM_IMPL1_VOID(sched_remove, ir_node *)
Sebastian Hack's avatar
Sebastian Hack committed
37

38
39
40
41
42
43
44
size_t sched_irn_data_offset = 0;

static void block_sched_dumper(ir_node *block, void *env)
{
	FILE *f = env;
	const ir_node *curr;

45
	ir_fprintf(f, "%+F:\n", block);
46
	sched_foreach(block, curr) {
47
48
    sched_info_t *info = get_irn_sched_info(curr);
		ir_fprintf(f, "\t%6d: %+F\n", info->time_step, curr);
49
50
51
	}
}

Michael Beck's avatar
Michael Beck committed
52
void be_sched_dump(FILE *f, ir_graph *irg)
53
{
Michael Beck's avatar
Michael Beck committed
54
	irg_block_walk_graph(irg, block_sched_dumper, NULL, f);
55
56
}

Michael Beck's avatar
Michael Beck committed
57
/* Init the scheduling stuff. */
58
59
60
61
62
void be_sched_init(void)
{
	sched_irn_data_offset = register_additional_node_data(sizeof(sched_info_t));
}

Sebastian Hack's avatar
Sebastian Hack committed
63
64
void sched_renumber(const ir_node *block)
{
Michael Beck's avatar
BugFix:    
Michael Beck committed
65
66
	ir_node *irn;
	sched_info_t *inf;
67
	sched_timestep_t step = SCHED_INITIAL_GRANULARITY;
Michael Beck's avatar
BugFix:    
Michael Beck committed
68
69
70
71
72
73

	sched_foreach(block, irn) {
		inf = get_irn_sched_info(irn);
		inf->time_step = step;
		step += SCHED_INITIAL_GRANULARITY;
	}
Sebastian Hack's avatar
Sebastian Hack committed
74
75
}

Michael Beck's avatar
Michael Beck committed
76
/* Verify a schedule. */
Sebastian Hack's avatar
Sebastian Hack committed
77
78
int sched_verify(const ir_node *block)
{
Michael Beck's avatar
BugFix:    
Michael Beck committed
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
	int res = 1;
	const ir_node *irn;
	int i, n;
	int *save_time_step;
	const ir_node **save_nodes;
	const ir_edge_t *edge;
	pset *scheduled_nodes = pset_new_ptr_default();
	FIRM_DBG_REGISTER(firm_dbg_module_t *dbg_sched, "firm.be.sched");

	/* Count the number of nodes in the schedule. */
	n = 0;
	sched_foreach(block, irn)
		n++;

	if(n <= 0)
		return 1;

	save_time_step = xmalloc(n * sizeof(save_time_step[0]));
	save_nodes = xmalloc(n * sizeof(save_nodes[0]));

	i = 0;
	sched_foreach(block, irn) {
		sched_info_t *info = get_irn_sched_info(irn);
		save_time_step[i] = info->time_step;
		save_nodes[i] = (ir_node *)irn;
		info->time_step = i;
		pset_insert_ptr(scheduled_nodes, irn);

		i += 1;
	}

	/*
	 * Check if each relevant operand of a node is scheduled before
	 * the node itself.
	 */
	sched_foreach(block, irn) {
		int i, n;
		int step = sched_get_time_step(irn);

		for(i = 0, n = get_irn_arity(irn); i < n; i++) {
			ir_node *op = get_irn_n(irn, i);

			if(to_appear_in_schedule(op)
				&& !is_Phi(irn)
				&& get_nodes_block(op) == block
				&& sched_get_time_step(op) > step) {

				DBG((dbg_sched, LEVEL_DEFAULT,
					"%+F: %+F is operand of %+F but scheduled after\n", block, op, irn));
				res = 0;
			}
		}
	}

	/* Check, if the time steps are correct */
	for(i = 1; i < n; ++i) {
		if(save_time_step[i] - save_time_step[i - 1] <= 0) {
			DBG((dbg_sched, LEVEL_DEFAULT,
				"%+F from %+F(%d) -> %+F(%d) step shrinks from %d -> %d\n",
				block, save_nodes[i - 1], i - 1, save_nodes[i], i,
				save_time_step[i - 1], save_time_step[i]));
			res = 0;
		}
	}

	/* Restore the old time steps */
	i = 0;
	sched_foreach(block, irn) {
		sched_info_t *info = get_irn_sched_info(irn);
		info->time_step = save_time_step[i++];
	}

	/* Check for all nodes in the block if they are scheduled. */
	foreach_out_edge(block, edge) {
		ir_node *irn = get_edge_src_irn(edge);
		if(to_appear_in_schedule(irn) && !pset_find_ptr(scheduled_nodes, irn)) {
			DBG((dbg_sched, LEVEL_DEFAULT,
				"%+F: %+F is in block but not scheduled\n", block, irn));
			res = 0;
		}
	}

	del_pset(scheduled_nodes);
	free(save_time_step);
	free((void *) save_nodes);
	return res;
Sebastian Hack's avatar
Sebastian Hack committed
165
166
}

Michael Beck's avatar
Michael Beck committed
167
168
169
170
/**
 * Block-Walker: verify the current block and update the status
 */
static void sched_verify_walker(ir_node *block, void *data)
Sebastian Hack's avatar
Sebastian Hack committed
171
{
Michael Beck's avatar
BugFix:    
Michael Beck committed
172
173
	int *res = data;
	*res &= sched_verify(block);
Sebastian Hack's avatar
Sebastian Hack committed
174
175
}

Michael Beck's avatar
Michael Beck committed
176
/* Verify the schedules in all blocks of the irg. */
Sebastian Hack's avatar
Sebastian Hack committed
177
178
int sched_verify_irg(ir_graph *irg)
{
Michael Beck's avatar
BugFix:    
Michael Beck committed
179
180
	int res = 1;
	irg_block_walk_graph(irg, sched_verify_walker, NULL, &res);
Sebastian Hack's avatar
Sebastian Hack committed
181

Michael Beck's avatar
BugFix:    
Michael Beck committed
182
	return res;
Sebastian Hack's avatar
Sebastian Hack committed
183
}
Sebastian Hack's avatar
Sebastian Hack committed
184

Daniel Grund's avatar
Daniel Grund committed
185
int sched_skip_cf_predicator(const ir_node *irn, void *data) {
Michael Beck's avatar
BugFix:    
Michael Beck committed
186
	arch_env_t *ae = data;
Christian Würdig's avatar
Christian Würdig committed
187
	return arch_irn_class_is(ae, irn, branch);
Daniel Grund's avatar
Daniel Grund committed
188
189
190
191
192
193
}

int sched_skip_phi_predicator(const ir_node *irn, void *data) {
	return is_Phi(irn);
}

194
/* Skip nodes in a schedule. */
Michael Beck's avatar
Michael Beck committed
195
ir_node *sched_skip(ir_node *from, int forward, sched_predicator_t *predicator, void *data)
Sebastian Hack's avatar
Sebastian Hack committed
196
{
Daniel Grund's avatar
Daniel Grund committed
197
198
	const ir_node *bl = get_block(from);
	ir_node *curr;
Sebastian Hack's avatar
Sebastian Hack committed
199

Daniel Grund's avatar
Daniel Grund committed
200
201
202
203
204
205
	if (is_Block(from))
		from = forward ? sched_next(from) : sched_prev(from);

	for(curr = from; curr != bl && predicator(curr, data); curr = forward ? sched_next(curr) : sched_prev(curr));

	return curr;
Sebastian Hack's avatar
Sebastian Hack committed
206
}
207
208
209
210
211
212
213
214

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

215
216
217
218
219
220
221
222
static void add_block(anchor *list, ir_node *block) {
	if(list->start == NULL) {
		list->start = block;
		list->end = block;
	} else {
		set_irn_link(list->end, block);
		list->end = block;
	}
223

224
225
	list->n_blks++;
}
226

227
228
229
230
static void create_block_list(ir_node *leader_block, anchor *list) {
	int i;
	ir_node *block = NULL;
	const ir_edge_t *edge;
231

232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
	ir_extblk *extbb = get_Block_extbb(leader_block);
	if(extbb_visited(extbb))
		return;
	mark_extbb_visited(extbb);

	for(i = 0; i < get_extbb_n_blocks(extbb); ++i) {
		block = get_extbb_block(extbb, i);
		add_block(list, block);
	}

	assert(block != NULL);

	// pick successor extbbs
	foreach_block_succ(block, edge) {
		ir_node *succ = get_edge_src_irn(edge);

		create_block_list(succ, list);
	}

	for(i = 0; i < get_extbb_n_blocks(extbb) - 1; ++i) {
		block = get_extbb_block(extbb, i);
		foreach_block_succ(block, edge) {
			ir_node *succ = get_edge_src_irn(edge);

			create_block_list(succ, list);
		}
258
259
260
	}
}

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

263
264
265
266
/*
 * Calculates a block schedule. The schedule is stored as a linked
 * list starting at the start_block of the irg.
 */
267
ir_node **sched_create_block_schedule(ir_graph *irg, ir_exec_freq *execfreqs)
268
269
270
271
272
273
{
	anchor list;
	ir_node **blk_list, *b, *n;
	unsigned i;

	/* schedule extended basic blocks */
274
275
	compute_extbb_execfreqs(irg, execfreqs);
	//compute_extbb(irg);
276
277
278
279

	list.start  = NULL;
	list.end    = NULL;
	list.n_blks = 0;
280
281
	inc_irg_block_visited(irg);
	create_block_list(get_irg_start_block(irg), &list);
282
283
284
285
286
287
288
289

	/** 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;
	}
290

291
292
	return blk_list;
}
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307

typedef struct remove_dead_nodes_env_t_ {
	ir_graph *irg;
	bitset_t *reachable;
} remove_dead_nodes_env_t;

static void mark_dead_nodes_walker(ir_node *node, void *data)
{
	remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
	bitset_set(env->reachable, get_irn_idx(node));
}

static void remove_dead_nodes_walker(ir_node *block, void *data)
{
	remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
Matthias Braun's avatar
Matthias Braun committed
308
	ir_node *node, *next;
309

Matthias Braun's avatar
Matthias Braun committed
310
	for(node = sched_first(block); !sched_is_end(node); node = next) {
311
312
		int i, arity;

Matthias Braun's avatar
Matthias Braun committed
313
314
315
316
		// get next node now, as after calling sched_remove it will be invalid
		next = sched_next(node);

		if(bitset_is_set(env->reachable, get_irn_idx(node)))
317
318
319
320
321
322
			continue;

		arity = get_irn_arity(node);
		for(i = 0; i < arity; ++i)
			set_irn_n(node, i, new_r_Bad(env->irg));

Matthias Braun's avatar
Matthias Braun committed
323
		sched_remove(node);
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
	}
}

void be_remove_dead_nodes_from_schedule(ir_graph *irg)
{
	remove_dead_nodes_env_t env;
	env.irg = irg;
	env.reachable = bitset_alloca(get_irg_last_idx(irg));

	// mark all reachable nodes
	irg_walk_graph(irg, mark_dead_nodes_walker, NULL, &env);

	// walk schedule and remove non-marked nodes
	irg_block_walk_graph(irg, remove_dead_nodes_walker, NULL, &env);
}