beuses.c 8.37 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.
 */

Sebastian Hack's avatar
Sebastian Hack committed
20
/**
Christian Würdig's avatar
Christian Würdig committed
21
22
23
24
25
 * @file
 * @brief       Methods to compute when a value will be used again.
 * @author      Sebastian Hack, Matthias Braun
 * @date        27.06.2005
 * @version     $Id$
Sebastian Hack's avatar
Sebastian Hack committed
26
 */
27
#include "config.h"
Sebastian Hack's avatar
Sebastian Hack committed
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46

#include <limits.h>
#include <stdlib.h>

#include "config.h"
#include "obst.h"
#include "pmap.h"
#include "debug.h"

#include "irgwalk.h"
#include "irnode_t.h"
#include "ircons_t.h"
#include "irgraph_t.h"
#include "iredges_t.h"
#include "irdom_t.h"

#include "be_t.h"
#include "beutil.h"
#include "belive_t.h"
47
#include "benode.h"
48
#include "besched.h"
Sebastian Hack's avatar
Sebastian Hack committed
49
#include "beirgmod.h"
50
#include "bearch.h"
Christian Würdig's avatar
Christian Würdig committed
51
#include "beuses.h"
Sebastian Hack's avatar
Sebastian Hack committed
52

53
typedef struct be_use_t {
54
55
	const ir_node *block;
	const ir_node *node;
56
	int outermost_loop;
Daniel Grund's avatar
Daniel Grund committed
57
	unsigned next_use;
58
	unsigned visited;
Sebastian Hack's avatar
Sebastian Hack committed
59
60
} be_use_t;

61
62
struct be_uses_t {
	set *uses;
63
64
	ir_graph *irg;
	const be_lv_t *lv;
65
	unsigned visited_counter;
66
	DEBUG_ONLY(firm_dbg_module_t *dbg;)
Sebastian Hack's avatar
Sebastian Hack committed
67
68
69
70
};

static int cmp_use(const void *a, const void *b, size_t n)
{
71
72
	const be_use_t *p = a;
	const be_use_t *q = b;
73
74
	(void) n;

75
	return !(p->block == q->block && p->node == q->node);
Sebastian Hack's avatar
Sebastian Hack committed
76
77
}

78
79
80
81
82
static be_next_use_t get_next_use(be_uses_t *env, ir_node *from,
								  unsigned from_step, const ir_node *def,
								  int skip_from_uses);

static const be_use_t *get_or_set_use_block(be_uses_t *env,
83
84
                                            const ir_node *block,
                                            const ir_node *def)
Sebastian Hack's avatar
Sebastian Hack committed
85
{
86
	unsigned hash = HASH_COMBINE(hash_irn(block), hash_irn(def));
87
88
	be_use_t temp;
	be_use_t* result;
89

90
91
	temp.block = block;
	temp.node = def;
92
	result = set_find(env->uses, &temp, sizeof(temp), hash);
Sebastian Hack's avatar
Sebastian Hack committed
93

94
	if (result == NULL) {
95
96
97
		// insert templ first as we might end in a loop in the get_next_use
		// call otherwise
		temp.next_use = USES_INFINITY;
98
99
100
101
102
		temp.outermost_loop = -1;
		temp.visited = 0;
		result = set_insert(env->uses, &temp, sizeof(temp), hash);
	}

103
	if (result->outermost_loop < 0 && result->visited < env->visited_counter) {
104
		be_next_use_t next_use;
Sebastian Hack's avatar
Sebastian Hack committed
105

106
107
		result->visited = env->visited_counter;
		next_use = get_next_use(env, sched_first(block), 0, def, 0);
108
		if (next_use.outermost_loop >= 0) {
109
110
111
112
			result->next_use = next_use.time;
			result->outermost_loop = next_use.outermost_loop;
			DBG((env->dbg, LEVEL_5, "Setting nextuse of %+F in block %+F to %u (outermostloop %d)\n", def, block, result->next_use, result->outermost_loop));
		}
113
	}
114

115
	return result;
Sebastian Hack's avatar
Sebastian Hack committed
116
117
}

118
static int be_is_phi_argument(const ir_node *block, const ir_node *def)
119
{
120
	ir_node *node;
Matthias Braun's avatar
Matthias Braun committed
121
	ir_node *succ_block = NULL;
122
123
	int arity, i;

124
125
126
127
#if 1
	if (get_irn_n_edges_kind(block, EDGE_KIND_BLOCK) < 1)
#else
	if (get_irn_n_edges_kind(block, EDGE_KIND_BLOCK) != 1)
128
#endif
129
		return 0;
130

131
	succ_block = get_first_block_succ(block);
132
133

	arity = get_Block_n_cfgpreds(succ_block);
134
	if (arity <= 1)
135
136
		return 0;

137
138
	for (i = 0; i < arity; ++i) {
		if (get_Block_cfgpred_block(succ_block, i) == block)
139
140
141
142
143
144
145
			break;
	}
	assert(i < arity);

	sched_foreach(succ_block, node) {
		ir_node *arg;

146
		if (!is_Phi(node))
147
148
149
			break;

		arg = get_irn_n(node, i);
150
		if (arg == def)
151
152
153
154
			return 1;
	}

	return 0;
155
156
}

157
static inline unsigned get_step(const ir_node *node)
158
159
160
161
{
	return PTR_TO_INT(get_irn_link(node));
}

162
163
164
static be_next_use_t get_next_use(be_uses_t *env, ir_node *from,
								  unsigned from_step, const ir_node *def,
								  int skip_from_uses)
Sebastian Hack's avatar
Sebastian Hack committed
165
{
166
	unsigned  step  = from_step;
167
168
169
170
	ir_node  *block = get_nodes_block(from);
	ir_node  *next_use;
	ir_node  *node;
	unsigned  timestep;
171
	unsigned  next_use_step;
172
	const ir_edge_t *edge;
Sebastian Hack's avatar
Sebastian Hack committed
173

174
	assert(skip_from_uses == 0 || skip_from_uses == 1);
175
	if (skip_from_uses) {
176
177
178
179
180
181
182
183
184
185
		from = sched_next(from);
	}

	next_use      = NULL;
	next_use_step = INT_MAX;
	timestep      = get_step(from);
	foreach_out_edge(def, edge) {
		ir_node  *node = get_edge_src_irn(edge);
		unsigned  node_step;

186
		if (is_Anchor(node))
187
			continue;
188
		if (get_nodes_block(node) != block)
189
			continue;
190
		if (is_Phi(node))
191
192
193
			continue;

		node_step = get_step(node);
194
		if (node_step < timestep)
195
			continue;
196
		if (node_step < next_use_step) {
197
198
199
200
201
			next_use      = node;
			next_use_step = node_step;
		}
	}

202
	if (next_use != NULL) {
203
204
205
		be_next_use_t result;
		result.time           = next_use_step - timestep + skip_from_uses;
		result.outermost_loop = get_loop_depth(get_irn_loop(block));
206
		result.before         = next_use;
207
208
209
210
211
212
		return result;
	}

	node = sched_last(block);
	step = get_step(node) + 1 + timestep + skip_from_uses;

213
	if (be_is_phi_argument(block, def)) {
214
215
216
		// TODO we really should continue searching the uses of the phi,
		// as a phi isn't a real use that implies a reload (because we could
		// easily spill the whole phi)
217
218

		be_next_use_t result;
219
		result.time           = step;
220
		result.outermost_loop = get_loop_depth(get_irn_loop(block));
221
		result.before         = block;
222
		return result;
223
	}
224
225

	{
226
	unsigned next_use   = USES_INFINITY;
227
228
	int outermost_loop;
	be_next_use_t result;
229
230
231
232
233
	ir_loop *loop       = get_irn_loop(block);
	int loopdepth       = get_loop_depth(loop);
	int found_visited   = 0;
	int found_use       = 0;
	ir_graph *irg       = get_irn_irg(block);
234
235
	ir_node *startblock = get_irg_start_block(irg);

236
	result.before  = NULL;
237
	outermost_loop = loopdepth;
238
239
240
	foreach_block_succ(block, edge) {
		const be_use_t *use;
		const ir_node *succ_block = get_edge_src_irn(edge);
241
		ir_loop *succ_loop;
242
		unsigned use_dist;
Christian Würdig's avatar
Christian Würdig committed
243

244
		if (succ_block == startblock)
245
			continue;
Sebastian Hack's avatar
Sebastian Hack committed
246

247
		DBG((env->dbg, LEVEL_5, "Checking succ of block %+F: %+F (for use of %+F)\n", block, succ_block, def));
248
		if (!be_is_live_in(env->lv, succ_block, def)) {
249
250
251
252
			//next_use = USES_INFINITY;
			DBG((env->dbg, LEVEL_5, "   not live in\n"));
			continue;
		}
253

254
255
256
		use = get_or_set_use_block(env, succ_block, def);
		DBG((env->dbg, LEVEL_5, "Found %u (loopdepth %d) (we're in block %+F)\n", use->next_use,
					use->outermost_loop, block));
257
258
		if (USES_IS_INFINITE(use->next_use)) {
			if (use->outermost_loop < 0) {
259
				found_visited = 1;
260
			}
261
262
			continue;
		}
263

264
265
		found_use = 1;
		use_dist = use->next_use;
266

267
		succ_loop = get_irn_loop(succ_block);
268
		if (get_loop_depth(succ_loop) < loopdepth) {
269
			unsigned factor = (loopdepth - get_loop_depth(succ_loop)) * 5000;
270
271
272
			DBG((env->dbg, LEVEL_5, "Increase usestep because of loop out edge %d -> %d (%u)\n", factor));
			// TODO we should use the number of nodes in the loop or so...
			use_dist += factor;
Sebastian Hack's avatar
Sebastian Hack committed
273
		}
274

275
		if (use_dist < next_use) {
276
			next_use       = use_dist;
277
			outermost_loop = use->outermost_loop;
278
			result.before  = use->node;
279
		}
Daniel Grund's avatar
Daniel Grund committed
280
	}
Sebastian Hack's avatar
Sebastian Hack committed
281

282
	if (loopdepth < outermost_loop)
283
		outermost_loop = loopdepth;
Sebastian Hack's avatar
Sebastian Hack committed
284

285
	result.time           = next_use + step;
286
	result.outermost_loop = outermost_loop;
Sebastian Hack's avatar
Sebastian Hack committed
287

288
	if (!found_use && found_visited) {
289
290
291
292
293
294
		// the current result is correct for the current search, but isn't
		// generally correct, so mark it
		result.outermost_loop = -1;
	}
	DBG((env->dbg, LEVEL_5, "Result: %d (outerloop: %d)\n", result.time, result.outermost_loop));
	return result;
295
	}
Sebastian Hack's avatar
Sebastian Hack committed
296
297
}

298
299
300
301
302
303
304
305
be_next_use_t be_get_next_use(be_uses_t *env, ir_node *from,
                         unsigned from_step, const ir_node *def,
                         int skip_from_uses)
{
	env->visited_counter++;
	return get_next_use(env, from, from_step, def, skip_from_uses);
}

306
static void set_sched_step_walker(ir_node *block, void *data)
307
308
309
{
	ir_node  *node;
	unsigned step = 0;
310
	(void) data;
311
312
313

	sched_foreach(block, node) {
		set_irn_link(node, INT_TO_PTR(step));
314
		if (is_Phi(node))
315
316
317
318
319
			continue;
		++step;
	}
}

320
be_uses_t *be_begin_uses(ir_graph *irg, const be_lv_t *lv)
Sebastian Hack's avatar
Sebastian Hack committed
321
{
322
	be_uses_t *env = XMALLOC(be_uses_t);
Sebastian Hack's avatar
Sebastian Hack committed
323

324
	edges_assure(irg);
Sebastian Hack's avatar
Sebastian Hack committed
325

326
327
328
329
330
	//set_using_irn_link(irg);

	/* precalculate sched steps */
	irg_block_walk_graph(irg, set_sched_step_walker, NULL, NULL);

331
332
333
334
335
	env->uses = new_set(cmp_use, 512);
	env->irg = irg;
	env->lv = lv;
	env->visited_counter = 0;
	FIRM_DBG_REGISTER(env->dbg, "firm.be.uses");
Sebastian Hack's avatar
Sebastian Hack committed
336

337
	return env;
Sebastian Hack's avatar
Sebastian Hack committed
338
339
}

340
void be_end_uses(be_uses_t *env)
Sebastian Hack's avatar
Sebastian Hack committed
341
{
342
	//clear_using_irn_link(env->irg);
343
344
	del_set(env->uses);
	free(env);
Sebastian Hack's avatar
Sebastian Hack committed
345
}