condeval.c 11.4 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
/*
 * Project:     libFIRM
 * File name:   ir/opt/cfopt.c
 * Purpose:     Partial condition evaluation
 * Author:      Christoph Mallon, Matthias Braun
 * Created:     10. Sep. 2006
 * CVS-ID:      $Id$
 * Copyright:   (c) 1998-2006 Universität Karlsruhe
 * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
 */
11
12
13
14
15
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif

#include <assert.h>
16
#include "array.h"
Christoph Mallon's avatar
Christoph Mallon committed
17
#include "condeval.h"
18
19
#include "debug.h"
#include "ircons.h"
Christoph Mallon's avatar
Christoph Mallon committed
20
21
#include "irgmod.h"
#include "irgopt.h"
22
23
#include "irgwalk.h"
#include "irnode.h"
24
#include "irnode_t.h"
25
#include "iredges.h"
26
#include "iredges_t.h"
27
#include "irtools.h"
28
#include "irgraph.h"
29
30
31
32
#include "tv.h"

DEBUG_ONLY(static firm_dbg_module_t *dbg);

Christoph Mallon's avatar
Christoph Mallon committed
33
34
35
36
37
38
39
40
41
42
43
44
45
/**
 * Add the new predecessor x to node node, which is either a Block or a Phi
 */
static void add_pred(ir_node* node, ir_node* x)
{
	ir_node** ins;
	int n;
	int i;

	assert(is_Block(node) || is_Phi(node));

	n = get_irn_arity(node);
	NEW_ARR_A(ir_node*, ins, n + 1);
46
47
	for (i = 0; i < n; i++)
		ins[i] = get_irn_n(node, i);
Christoph Mallon's avatar
Christoph Mallon committed
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
	ins[n] = x;
	set_irn_in(node, n + 1, ins);
}

/**
 * Remove predecessor j from node, which is either a Block or a Phi
 * returns true if only one predecessor is left
 */
static int remove_pred(ir_node* node, int j)
{
	int n;

	assert(is_Block(node) || is_Phi(node));

	n = get_irn_arity(node);
	if (n == 2) {
		ir_node* pred = get_irn_n(node, 1 - j);

66
67
		if (is_Block(node)) {
			pred = get_nodes_block(pred);
68
			edges_reroute(node, pred, current_ir_graph);
69
70
71
		} else {
			exchange(node, pred);
		}
Christoph Mallon's avatar
Christoph Mallon committed
72
73
74
75
76
77
		return 1;
	} else {
		ir_node** ins;
		int i;

		NEW_ARR_A(ir_node*, ins, n - 1);
78
79
80
81
82
		for (i = 0; i < j; i++)
			ins[i] = get_irn_n(node, i);
		for (i++; i < n; i++)
			ins[i - 1] = get_irn_n(node, i);

Christoph Mallon's avatar
Christoph Mallon committed
83
84
85
86
87
88
89
		set_irn_in(node, n - 1, ins);
		return 0;
	}
}

static ir_node *search_def_and_create_phis(ir_node *block, ir_mode *mode)
{
90
91
92
93
94
95
	int i;
	int n_cfgpreds;
	ir_graph *irg;
	ir_node *phi;
	ir_node **in;

96
97
98
	// This is needed because we create bads sometimes
	if(is_Bad(block))
		return new_Bad();
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117

	// already processed this block?
	if(irn_visited(block)) {
		ir_node *value = (ir_node*) get_irn_link(block);
		return value;
	}

	// blocks with only 1 pred need no phi
	n_cfgpreds = get_Block_n_cfgpreds(block);
	if(n_cfgpreds == 1) {
		ir_node *pred_block = get_Block_cfgpred_block(block, 0);
		ir_node *value = search_def_and_create_phis(pred_block, mode);

		set_irn_link(block, value);
		mark_irn_visited(block);
		return value;
	}

	// create a new phi
Christoph Mallon's avatar
Christoph Mallon committed
118
	NEW_ARR_A(ir_node*, in, n_cfgpreds);
119
120
121
122
123
124
125
126
127
128
129
	for(i = 0; i < n_cfgpreds; ++i)
		in[i] = new_Unknown(mode);

	irg = get_irn_irg(block);
	phi = new_r_Phi(irg, block, n_cfgpreds, in, mode);
	set_irn_link(block, phi);
	mark_irn_visited(block);

	// set phi preds
	for(i = 0; i < n_cfgpreds; ++i) {
		ir_node *pred_block = get_Block_cfgpred_block(block, i);
Christoph Mallon's avatar
Christoph Mallon committed
130
		ir_node *pred_val = search_def_and_create_phis(pred_block, mode);
131
132
133
134
135
136
137
138

		set_irn_n(phi, i, pred_val);
	}

	return phi;
}

/**
139
140
141
 * Given a set of values this function constructs SSA-form for the users of the
 * first value (the users are determined through the out-edges of the value).
 * Uses the irn_visited flags. Works without using the dominance tree.
142
 */
143
static void construct_ssa(ir_node * const *blocks, ir_node * const *vals, int n_vals)
Christoph Mallon's avatar
Christoph Mallon committed
144
{
145
146
147
	int i;
	ir_graph *irg;
	ir_mode *mode;
148
149
150
	const ir_edge_t *edge;
	const ir_edge_t *next;
	ir_node *value;
151
152
153
154
155
156
157
158
159

	assert(n_vals > 0);

	irg = get_irn_irg(vals[0]);
	inc_irg_visited(irg);

	mode = get_irn_mode(vals[0]);
	for(i = 0; i < n_vals; ++i) {
		ir_node *value = vals[i];
160
		ir_node *value_block = blocks[i];
161
162
163
164
165
166
167

		assert(get_irn_mode(value) == mode);

		set_irn_link(value_block, value);
		mark_irn_visited(value_block);
	}

168
169
170
171
172
173
174
175
176
177
178
	// Only fix the users of the first, i.e. the original node
	value = vals[0];

	// this can happen when fixing phi preds, we mustn't fix the users
	if(get_nodes_block(value) != blocks[0]) return;

	foreach_out_edge_safe(value, edge, next) {
		ir_node *user = get_edge_src_irn(edge);
		int j = get_edge_src_pos(edge);
		ir_node *user_block = get_nodes_block(user);
		ir_node *newval;
179

180
181
		// ignore keeps
		if(get_irn_op(user) == op_End)
182
			continue;
183
184
185
186
187
188
189
190

		DB((dbg, LEVEL_3, ">>> Fixing user %+F (pred %d == %+F)\n", user, j, get_irn_n(user, j)));

		if(is_Phi(user)) {
			ir_node *pred_block = get_Block_cfgpred_block(user_block, j);
			newval = search_def_and_create_phis(pred_block, mode);
		} else {
			newval = search_def_and_create_phis(user_block, mode);
191
192
		}

193
194
195
196
		// don't fix newly created phis from the SSA construction
		if (newval != user) {
			DB((dbg, LEVEL_4, ">>>> Setting input %d of %+F to %+F\n", j, user, newval));
			set_irn_n(user, j, newval);
197
198
199
200
		}
	}
}

201
202
203
204
205
static void split_critical_edge(ir_node *block, int pos) {
	ir_graph *irg = get_irn_irg(block);
	ir_node *in[1];
	ir_node *new_block;
	ir_node *new_jmp;
Christoph Mallon's avatar
Christoph Mallon committed
206

207
208
209
210
	in[0] = get_Block_cfgpred(block, pos);
	new_block = new_r_Block(irg, 1, in);
	new_jmp = new_r_Jmp(irg, new_block);
	set_Block_cfgpred(block, pos, new_jmp);
Christoph Mallon's avatar
Christoph Mallon committed
211
212
}

213
214
215
216
typedef struct _condeval_env_t {
	ir_node *true_block;
	pn_Cmp pnc;
	ir_node *cnst;
217
	unsigned long visited_nr;
Christoph Mallon's avatar
Christoph Mallon committed
218

219
220
221
	ir_node *cnst_pred;	/**< the block before the constant */
	int cnst_pos;       /**< the pos to the constant block (needed to kill that edge later) */
} condeval_env_t;
Christoph Mallon's avatar
Christoph Mallon committed
222

223
224
225
226
227
228
229
230
231
232
static void copy_and_fix(ir_node *block, ir_node *copy_block, int j, const condeval_env_t *env) {
	const ir_edge_t *edge;

	/* Look at all nodes in the cond_block and copy them into pred */
	foreach_out_edge(block, edge) {
		ir_node *node = get_edge_src_irn(edge);
		ir_node *copy;

		/* ignore control flow */
		if (get_irn_mode(node) == mode_X)
233
			continue;
Christoph Mallon's avatar
Christoph Mallon committed
234

235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
		/* we can evaluate Phis right now, all other nodes get copied */
		if (is_Phi(node)) {
			copy = get_Phi_pred(node, j);
		} else {
			copy = exact_copy(node);
			set_nodes_block(copy, copy_block);
		}

		set_irn_link(node, copy);
		set_irn_visited(node, env->visited_nr);

		/* we might hit values in blocks that have already been processed by a
		 * recursive find_phi_with_const call */
		assert(get_irn_visited(copy) <= env->visited_nr);
		if(get_irn_visited(copy) >= env->visited_nr) {
			ir_node *prev_copy = get_irn_link(copy);
			if(prev_copy != NULL)
				set_irn_link(node, prev_copy);
		}
	}
Christoph Mallon's avatar
Christoph Mallon committed
255

256
257
258
259
260
261
262
263
264
265
	/* fix data-flow (and reconstruct SSA if needed) */
	foreach_out_edge(block, edge) {
		ir_node *vals[2];
		ir_node *blocks[2];

		ir_node *node = get_edge_src_irn(edge);

		if (get_irn_mode(node) == mode_X)
			continue;

266
267
		DB((dbg, LEVEL_2, ">> Fixing users of %+F\n", node));

268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
		blocks[0] = block;
		vals[0] = node;
		blocks[1] = copy_block;
		vals[1] = get_irn_link(node);
		construct_ssa(blocks, vals, 2);
	}
}

static int eval_cmp(pn_Cmp pnc, tarval *tv1, tarval *tv2) {
	pn_Cmp cmp_result = tarval_cmp(tv1, tv2);

	// does the compare evaluate to true?
	if(cmp_result == pn_Cmp_False)
		return 0;
	if((cmp_result & pnc) != cmp_result)
		return 0;

	return 1;
}

static ir_node *find_phi_with_const(ir_node *jump, ir_node *value, condeval_env_t *env) {
	ir_node *block = get_nodes_block(jump);

	if(irn_visited(value))
		return NULL;
	mark_irn_visited(value);

	if(is_Const(value)) {
		tarval *tv_const = get_Const_tarval(env->cnst);
		tarval *tv = get_Const_tarval(value);

		if(!eval_cmp(env->pnc, tv, tv_const))
			return NULL;
Christoph Mallon's avatar
Christoph Mallon committed
301
302
303

		DB((
			dbg, LEVEL_1,
304
305
			"> Found condition evaluation candidate %+F->%+F\n",
			env->true_block, block
Christoph Mallon's avatar
Christoph Mallon committed
306
307
		));

308
309
		// adjust true_block to point directly towards our jump
		add_pred(env->true_block, jump);
310

311
		split_critical_edge(env->true_block, 0);
312

313
314
		// we need a bigger visited nr when going back
		env->visited_nr++;
315

316
317
		return block;
	}
318

319
320
	if(is_Phi(value)) {
		int i, arity;
Christoph Mallon's avatar
Christoph Mallon committed
321

322
323
324
		// the phi has to be in the same block as the jump
		if(get_nodes_block(value) != block)
			return NULL;
325

326
327
328
329
330
		arity = get_irn_arity(value);
		for(i = 0; i < arity; ++i) {
			ir_node *copy_block;
			ir_node *phi_pred = get_Phi_pred(value, i);
			ir_node *cfgpred = get_Block_cfgpred(block, i);
331

332
333
			copy_block = find_phi_with_const(cfgpred, phi_pred, env);
			if(copy_block == NULL)
334
335
				continue;

336
337
			/* copy duplicated nodes in copy_block and fix SSA */
			copy_and_fix(block, copy_block, i, env);
338

339
340
341
342
			if(copy_block == get_nodes_block(cfgpred)) {
				env->cnst_pred = block;
				env->cnst_pos = i;
			}
343

344
345
			// return now as we can't process more possibilities in 1 run
			return copy_block;
346
		}
Christoph Mallon's avatar
Christoph Mallon committed
347
	}
348

349
	return NULL;
Christoph Mallon's avatar
Christoph Mallon committed
350
351
352
}


353
/**
354
355
356
357
358
359
360
361
362
363
364
 * Block-walker: searchs for the following construct
 *
 *  Const or Phi with constants
 *           |
 *          Cmp
 *           |
 *         Cond
 *          /
 *       ProjX
 *        /
 *     Block
365
 */
366
static void cond_eval(ir_node* block, void* data)
367
{
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
	condeval_env_t env;
	int *changed = data;
	ir_graph *irg = current_ir_graph;
	ir_node *copy_block;
	ir_node *pred;
	ir_node *projx;
	ir_node *cond;
	ir_node *cmp;
	ir_node *left;
	ir_node *right;
	ir_node *cond_block;
	pn_Cmp pnc;

	if(get_Block_n_cfgpreds(block) != 1)
		return;

	projx = get_Block_cfgpred(block, 0);
	if (!is_Proj(projx))
		return;
	assert(get_irn_mode(projx) == mode_X);

	cond = get_Proj_pred(projx);
	if (!is_Cond(cond))
		return;

	pred = get_Cond_selector(cond);
	// TODO handle switches
	if (get_irn_mode(pred) != mode_b)
		return;
	if (!is_Proj(pred))
		return;
	pnc = get_Proj_proj(pred);

	cmp = get_Proj_pred(pred);
	assert(is_Cmp(cmp));

	left  = get_Cmp_left(cmp);
	right = get_Cmp_right(cmp);
	assert(get_irn_mode(left) == get_irn_mode(right));

	/* we assume that the cond_block is the true case */
	if (get_Proj_proj(projx) == pn_Cond_false) {
		pnc = get_negated_pnc(pnc, get_irn_mode(left));
	}
412

413
414
415
416
417
418
	/* we assume that the constant is on the right side, swap left/right
	 * if needed */
	if(is_Const(left)) {
		ir_node *t = left;
		left = right;
		right = t;
419

420
421
422
423
424
425
426
427
428
429
430
431
		pnc = get_inversed_pnc(pnc);
	}

	if(!is_Const(right))
		return;

	cond_block = get_nodes_block(cond);

	// special case: comparing a constant with a constant
	if(is_Const(left)) {
		tarval *tv1 = get_Const_tarval(left);
		tarval *tv2 = get_Const_tarval(right);
432
		ir_node *pred;
433
		if(eval_cmp(pnc, tv1, tv2)) {
434
			pred = new_r_Jmp(irg, cond_block);
435
		} else {
436
			pred = new_Bad();
Christoph Mallon's avatar
Christoph Mallon committed
437
		}
438
		set_Block_cfgpred(block, 0, pred);
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
		*changed = 1;
		set_irg_doms_inconsistent(irg);
		set_irg_extblk_inconsistent(irg);
		set_irg_loopinfo_inconsistent(irg);
	} else {
		if(get_nodes_block(left) != cond_block)
			return;

		// (recursively) look if a pred of a phi is a constant
		env.true_block = block;
		env.pnc = pnc;
		env.cnst = right;
		inc_irg_visited(current_ir_graph);
		env.visited_nr = get_irg_visited(irg);

		copy_block = find_phi_with_const(projx, left, &env);

		if(copy_block != NULL) {
			/* we have to remove the edge towards the pred as the pred now
			 * jumps into the true_block. We also have to shorten phis
			 * in our block because of this */
			const ir_edge_t *edge, *next;

			/* shorten phis */
			foreach_out_edge_safe(env.cnst_pred, edge, next) {
				ir_node *node = get_edge_src_irn(edge);

				if(is_Phi(node))
					remove_pred(node, env.cnst_pos);
			}

			remove_pred(env.cnst_pred, env.cnst_pos);

			// the graph is changed now
			*changed = 1;
			set_irg_doms_inconsistent(irg);
			set_irg_extblk_inconsistent(irg);
			set_irg_loopinfo_inconsistent(irg);
477
478
479
480
481
482
		}
	}
}

void opt_cond_eval(ir_graph* irg)
{
483
484
	int changed;

485
486
487
488
	FIRM_DBG_REGISTER(dbg, "firm.opt.condeval");

	DB((dbg, LEVEL_1, "===> Performing condition evaluation on %+F\n", irg));

489
	edges_assure(irg);
Christoph Mallon's avatar
Christoph Mallon committed
490
491
	remove_critical_cf_edges(irg);

492
493
	normalize_proj_nodes(irg);

494
495
496
	set_using_irn_link(irg);
	set_using_visited(irg);

497
498
499
500
	do {
		changed = 0;
		irg_block_walk_graph(irg, cond_eval, NULL, &changed);
	} while(changed);
501
502
503

	clear_using_visited(irg);
	clear_using_irn_link(irg);
504
}