iropt.c 186 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.
 */

Matthias Braun's avatar
Matthias Braun committed
20
21
22
23
24
/**
 * @file
 * @brief   iropt --- optimizations intertwined with IR construction.
 * @author  Christian Schaefer, Goetz Lindenmaier, Michael Beck
 * @version $Id$
Götz Lindenmaier's avatar
Götz Lindenmaier committed
25
 */
Matthias Braun's avatar
Matthias Braun committed
26
#include "config.h"
Michael Beck's avatar
Michael Beck committed
27
28

#include <string.h>
Boris Boesler's avatar
added    
Boris Boesler committed
29

Michael Beck's avatar
Michael Beck committed
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include "irnode_t.h"
#include "irgraph_t.h"
#include "iredges_t.h"
#include "irmode_t.h"
#include "iropt_t.h"
#include "ircons_t.h"
#include "irgmod.h"
#include "irvrfy.h"
#include "tv_t.h"
#include "dbginfo_t.h"
#include "iropt_dbg.h"
#include "irflag_t.h"
#include "irhooks.h"
#include "irarch.h"
#include "hashptr.h"
#include "opt_confirms.h"
46
#include "opt_polymorphy.h"
Michael Beck's avatar
Michael Beck committed
47
#include "irtools.h"
48
#include "irhooks.h"
49
#include "array_t.h"
50
51
#include "vrp.h"
#include "firm_types.h"
Christian Schäfer's avatar
Christian Schäfer committed
52

Götz Lindenmaier's avatar
Götz Lindenmaier committed
53
/* Make types visible to allow most efficient access */
54
#include "entity_t.h"
Götz Lindenmaier's avatar
Götz Lindenmaier committed
55

56
57
58
59
60
61
62
63
64
65
66
67
/**
 * Returns the tarval of a Const node or tarval_bad for all other nodes.
 */
static tarval *default_value_of(const ir_node *n) {
	if (is_Const(n))
		return get_Const_tarval(n); /* might return tarval_bad */
	else
		return tarval_bad;
}

value_of_func value_of_ptr = default_value_of;

Michael Beck's avatar
Michael Beck committed
68
/* * Set a new value_of function. */
69
70
71
72
73
74
75
void set_value_of_func(value_of_func func) {
	if (func != NULL)
		value_of_ptr = func;
	else
		value_of_ptr = default_value_of;
}

76
/**
77
 * Return the value of a Constant.
78
 */
Michael Beck's avatar
Michael Beck committed
79
static tarval *computed_value_Const(const ir_node *n) {
Michael Beck's avatar
Michael Beck committed
80
	return get_Const_tarval(n);
81
}  /* computed_value_Const */
Christian Schäfer's avatar
Christian Schäfer committed
82

83
/**
Michael Beck's avatar
Michael Beck committed
84
 * Return the value of a 'sizeof', 'alignof' or 'offsetof' SymConst.
85
 */
Michael Beck's avatar
Michael Beck committed
86
static tarval *computed_value_SymConst(const ir_node *n) {
Michael Beck's avatar
Michael Beck committed
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
	ir_type   *type;
	ir_entity *ent;

	switch (get_SymConst_kind(n)) {
	case symconst_type_size:
		type = get_SymConst_type(n);
		if (get_type_state(type) == layout_fixed)
			return new_tarval_from_long(get_type_size_bytes(type), get_irn_mode(n));
		break;
	case symconst_type_align:
		type = get_SymConst_type(n);
		if (get_type_state(type) == layout_fixed)
			return new_tarval_from_long(get_type_alignment_bytes(type), get_irn_mode(n));
		break;
	case symconst_ofs_ent:
		ent  = get_SymConst_entity(n);
		type = get_entity_owner(ent);
		if (get_type_state(type) == layout_fixed)
			return new_tarval_from_long(get_entity_offset(ent), get_irn_mode(n));
		break;
	default:
		break;
	}
	return tarval_bad;
111
}  /* computed_value_SymConst */
Christian Schäfer's avatar
Christian Schäfer committed
112

Michael Beck's avatar
Michael Beck committed
113
/**
114
 * Return the value of an Add.
Michael Beck's avatar
Michael Beck committed
115
 */
Michael Beck's avatar
Michael Beck committed
116
static tarval *computed_value_Add(const ir_node *n) {
Michael Beck's avatar
Michael Beck committed
117
118
	ir_node *a = get_Add_left(n);
	ir_node *b = get_Add_right(n);
Christian Schäfer's avatar
Christian Schäfer committed
119

Michael Beck's avatar
Michael Beck committed
120
121
	tarval *ta = value_of(a);
	tarval *tb = value_of(b);
122

123
	if ((ta != tarval_bad) && (tb != tarval_bad))
Michael Beck's avatar
Michael Beck committed
124
		return tarval_add(ta, tb);
125

Michael Beck's avatar
Michael Beck committed
126
	return tarval_bad;
127
}  /* computed_value_Add */
Christian Schäfer's avatar
Christian Schäfer committed
128

Michael Beck's avatar
Michael Beck committed
129
/**
130
 * Return the value of a Sub.
Michael Beck's avatar
Michael Beck committed
131
132
 * Special case: a - a
 */
Michael Beck's avatar
Michael Beck committed
133
static tarval *computed_value_Sub(const ir_node *n) {
134
135
136
137
138
	ir_mode *mode = get_irn_mode(n);
	ir_node *a    = get_Sub_left(n);
	ir_node *b    = get_Sub_right(n);
	tarval  *ta;
	tarval  *tb;
Christian Schäfer's avatar
Christian Schäfer committed
139

140
141
142
143
144
145
	/* NaN - NaN != 0 */
	if (! mode_is_float(mode)) {
		/* a - a = 0 */
		if (a == b)
			return get_mode_null(mode);
	}
Michael Beck's avatar
Michael Beck committed
146

Michael Beck's avatar
Michael Beck committed
147
148
	ta = value_of(a);
	tb = value_of(b);
149

150
151
	if ((ta != tarval_bad) && (tb != tarval_bad))
		return tarval_sub(ta, tb, mode);
152

Michael Beck's avatar
Michael Beck committed
153
	return tarval_bad;
154
}  /* computed_value_Sub */
155

156
/**
157
 * Return the value of a Carry.
158
159
 * Special : a op 0, 0 op b
 */
Michael Beck's avatar
Michael Beck committed
160
static tarval *computed_value_Carry(const ir_node *n) {
Michael Beck's avatar
Michael Beck committed
161
162
163
164
165
166
167
168
169
170
171
	ir_node *a = get_binop_left(n);
	ir_node *b = get_binop_right(n);
	ir_mode *m = get_irn_mode(n);

	tarval *ta = value_of(a);
	tarval *tb = value_of(b);

	if ((ta != tarval_bad) && (tb != tarval_bad)) {
		tarval_add(ta, tb);
		return tarval_carry() ? get_mode_one(m) : get_mode_null(m);
	} else {
172
		if (tarval_is_null(ta) || tarval_is_null(tb))
Michael Beck's avatar
Michael Beck committed
173
174
175
			return get_mode_null(m);
	}
	return tarval_bad;
176
}  /* computed_value_Carry */
177
178

/**
179
 * Return the value of a Borrow.
180
181
 * Special : a op 0
 */
Michael Beck's avatar
Michael Beck committed
182
static tarval *computed_value_Borrow(const ir_node *n) {
Michael Beck's avatar
Michael Beck committed
183
184
185
186
187
188
189
190
191
	ir_node *a = get_binop_left(n);
	ir_node *b = get_binop_right(n);
	ir_mode *m = get_irn_mode(n);

	tarval *ta = value_of(a);
	tarval *tb = value_of(b);

	if ((ta != tarval_bad) && (tb != tarval_bad)) {
		return tarval_cmp(ta, tb) == pn_Cmp_Lt ? get_mode_one(m) : get_mode_null(m);
192
	} else if (tarval_is_null(ta)) {
Michael Beck's avatar
Michael Beck committed
193
194
195
		return get_mode_null(m);
	}
	return tarval_bad;
196
}  /* computed_value_Borrow */
197

Michael Beck's avatar
Michael Beck committed
198
/**
199
 * Return the value of an unary Minus.
Michael Beck's avatar
Michael Beck committed
200
 */
Michael Beck's avatar
Michael Beck committed
201
static tarval *computed_value_Minus(const ir_node *n) {
Michael Beck's avatar
Michael Beck committed
202
203
	ir_node *a = get_Minus_op(n);
	tarval *ta = value_of(a);
204

Michael Beck's avatar
Michael Beck committed
205
	if (ta != tarval_bad)
Michael Beck's avatar
Michael Beck committed
206
		return tarval_neg(ta);
207

Michael Beck's avatar
Michael Beck committed
208
	return tarval_bad;
209
}  /* computed_value_Minus */
210

Michael Beck's avatar
Michael Beck committed
211
/**
212
 * Return the value of a Mul.
Michael Beck's avatar
Michael Beck committed
213
 */
Michael Beck's avatar
Michael Beck committed
214
static tarval *computed_value_Mul(const ir_node *n) {
Michael Beck's avatar
Michael Beck committed
215
216
	ir_node *a = get_Mul_left(n);
	ir_node *b = get_Mul_right(n);
Michael Beck's avatar
Michael Beck committed
217
	ir_mode *mode;
Michael Beck's avatar
Michael Beck committed
218
219
220
221

	tarval *ta = value_of(a);
	tarval *tb = value_of(b);

Michael Beck's avatar
Michael Beck committed
222
223
224
225
226
227
228
229
	mode = get_irn_mode(n);
	if (mode != get_irn_mode(a)) {
		/* n * n = 2n bit multiplication */
		ta = tarval_convert_to(ta, mode);
		tb = tarval_convert_to(tb, mode);
	}

	if (ta != tarval_bad && tb != tarval_bad) {
Michael Beck's avatar
Michael Beck committed
230
231
		return tarval_mul(ta, tb);
	} else {
232
233
234
235
236
237
238
239
		/* a * 0 != 0 if a == NaN or a == Inf */
		if (!mode_is_float(mode)) {
			/* a*0 = 0 or 0*b = 0 */
			if (ta == get_mode_null(mode))
				return ta;
			if (tb == get_mode_null(mode))
				return tb;
		}
Michael Beck's avatar
Michael Beck committed
240
241
	}
	return tarval_bad;
242
}  /* computed_value_Mul */
243

Michael Beck's avatar
Michael Beck committed
244
/**
245
 * Return the value of an Abs.
Michael Beck's avatar
Michael Beck committed
246
 */
Michael Beck's avatar
Michael Beck committed
247
static tarval *computed_value_Abs(const ir_node *n) {
Michael Beck's avatar
Michael Beck committed
248
249
	ir_node *a = get_Abs_op(n);
	tarval *ta = value_of(a);
250

Michael Beck's avatar
Michael Beck committed
251
252
	if (ta != tarval_bad)
		return tarval_abs(ta);
253

Michael Beck's avatar
Michael Beck committed
254
	return tarval_bad;
255
}  /* computed_value_Abs */
256

Michael Beck's avatar
Michael Beck committed
257
/**
258
 * Return the value of an And.
Michael Beck's avatar
Michael Beck committed
259
260
 * Special case: a & 0, 0 & b
 */
Michael Beck's avatar
Michael Beck committed
261
static tarval *computed_value_And(const ir_node *n) {
Michael Beck's avatar
Michael Beck committed
262
263
264
265
266
267
268
269
270
	ir_node *a = get_And_left(n);
	ir_node *b = get_And_right(n);

	tarval *ta = value_of(a);
	tarval *tb = value_of(b);

	if ((ta != tarval_bad) && (tb != tarval_bad)) {
		return tarval_and (ta, tb);
	} else {
271
272
		if (tarval_is_null(ta)) return ta;
		if (tarval_is_null(tb)) return tb;
Michael Beck's avatar
Michael Beck committed
273
274
	}
	return tarval_bad;
275
}  /* computed_value_And */
276

Michael Beck's avatar
Michael Beck committed
277
/**
278
 * Return the value of an Or.
Michael Beck's avatar
Michael Beck committed
279
280
 * Special case: a | 1...1, 1...1 | b
 */
Michael Beck's avatar
Michael Beck committed
281
static tarval *computed_value_Or(const ir_node *n) {
Michael Beck's avatar
Michael Beck committed
282
283
284
285
286
287
288
289
290
	ir_node *a = get_Or_left(n);
	ir_node *b = get_Or_right(n);

	tarval *ta = value_of(a);
	tarval *tb = value_of(b);

	if ((ta != tarval_bad) && (tb != tarval_bad)) {
		return tarval_or (ta, tb);
	} else {
291
292
		if (tarval_is_all_one(ta)) return ta;
		if (tarval_is_all_one(tb)) return tb;
Michael Beck's avatar
Michael Beck committed
293
294
	}
	return tarval_bad;
295
}  /* computed_value_Or */
296

Michael Beck's avatar
Michael Beck committed
297
/**
298
 * Return the value of an Eor.
Michael Beck's avatar
Michael Beck committed
299
 */
Michael Beck's avatar
Michael Beck committed
300
static tarval *computed_value_Eor(const ir_node *n) {
Michael Beck's avatar
Michael Beck committed
301
302
	ir_node *a = get_Eor_left(n);
	ir_node *b = get_Eor_right(n);
303

Michael Beck's avatar
Michael Beck committed
304
	tarval *ta, *tb;
Michael Beck's avatar
Michael Beck committed
305

Michael Beck's avatar
Michael Beck committed
306
307
	if (a == b)
		return get_mode_null(get_irn_mode(n));
Michael Beck's avatar
Michael Beck committed
308

Michael Beck's avatar
Michael Beck committed
309
310
	ta = value_of(a);
	tb = value_of(b);
311

Michael Beck's avatar
Michael Beck committed
312
	if ((ta != tarval_bad) && (tb != tarval_bad)) {
313
		return tarval_eor(ta, tb);
Michael Beck's avatar
Michael Beck committed
314
315
	}
	return tarval_bad;
316
}  /* computed_value_Eor */
317

Michael Beck's avatar
Michael Beck committed
318
/**
319
 * Return the value of a Not.
Michael Beck's avatar
Michael Beck committed
320
 */
Michael Beck's avatar
Michael Beck committed
321
static tarval *computed_value_Not(const ir_node *n) {
Michael Beck's avatar
Michael Beck committed
322
323
	ir_node *a = get_Not_op(n);
	tarval *ta = value_of(a);
324

Michael Beck's avatar
Michael Beck committed
325
326
	if (ta != tarval_bad)
		return tarval_not(ta);
327

Michael Beck's avatar
Michael Beck committed
328
	return tarval_bad;
329
}  /* computed_value_Not */
330

Michael Beck's avatar
Michael Beck committed
331
/**
332
 * Return the value of a Shl.
Michael Beck's avatar
Michael Beck committed
333
 */
Michael Beck's avatar
Michael Beck committed
334
static tarval *computed_value_Shl(const ir_node *n) {
Michael Beck's avatar
Michael Beck committed
335
336
	ir_node *a = get_Shl_left(n);
	ir_node *b = get_Shl_right(n);
337

Michael Beck's avatar
Michael Beck committed
338
339
	tarval *ta = value_of(a);
	tarval *tb = value_of(b);
340

Michael Beck's avatar
Michael Beck committed
341
	if ((ta != tarval_bad) && (tb != tarval_bad)) {
342
		return tarval_shl(ta, tb);
Michael Beck's avatar
Michael Beck committed
343
344
	}
	return tarval_bad;
345
}  /* computed_value_Shl */
346

Michael Beck's avatar
Michael Beck committed
347
/**
348
 * Return the value of a Shr.
Michael Beck's avatar
Michael Beck committed
349
 */
Michael Beck's avatar
Michael Beck committed
350
static tarval *computed_value_Shr(const ir_node *n) {
Michael Beck's avatar
Michael Beck committed
351
352
	ir_node *a = get_Shr_left(n);
	ir_node *b = get_Shr_right(n);
353

Michael Beck's avatar
Michael Beck committed
354
355
	tarval *ta = value_of(a);
	tarval *tb = value_of(b);
356

Michael Beck's avatar
Michael Beck committed
357
	if ((ta != tarval_bad) && (tb != tarval_bad)) {
358
		return tarval_shr(ta, tb);
Michael Beck's avatar
Michael Beck committed
359
360
	}
	return tarval_bad;
361
}  /* computed_value_Shr */
362

Michael Beck's avatar
Michael Beck committed
363
/**
364
 * Return the value of a Shrs.
Michael Beck's avatar
Michael Beck committed
365
 */
Michael Beck's avatar
Michael Beck committed
366
static tarval *computed_value_Shrs(const ir_node *n) {
Michael Beck's avatar
Michael Beck committed
367
368
	ir_node *a = get_Shrs_left(n);
	ir_node *b = get_Shrs_right(n);
369

Michael Beck's avatar
Michael Beck committed
370
371
	tarval *ta = value_of(a);
	tarval *tb = value_of(b);
372

Michael Beck's avatar
Michael Beck committed
373
	if ((ta != tarval_bad) && (tb != tarval_bad)) {
374
		return tarval_shrs(ta, tb);
Michael Beck's avatar
Michael Beck committed
375
376
	}
	return tarval_bad;
377
}  /* computed_value_Shrs */
378

Michael Beck's avatar
Michael Beck committed
379
/**
380
 * Return the value of a Rotl.
Michael Beck's avatar
Michael Beck committed
381
 */
Michael Beck's avatar
Michael Beck committed
382
static tarval *computed_value_Rotl(const ir_node *n) {
383
384
	ir_node *a = get_Rotl_left(n);
	ir_node *b = get_Rotl_right(n);
385

Michael Beck's avatar
Michael Beck committed
386
387
	tarval *ta = value_of(a);
	tarval *tb = value_of(b);
388

Michael Beck's avatar
Michael Beck committed
389
	if ((ta != tarval_bad) && (tb != tarval_bad)) {
390
		return tarval_rotl(ta, tb);
Michael Beck's avatar
Michael Beck committed
391
392
	}
	return tarval_bad;
393
}  /* computed_value_Rotl */
394

Michael Beck's avatar
Michael Beck committed
395
/**
396
 * Return the value of a Conv.
Michael Beck's avatar
Michael Beck committed
397
 */
Michael Beck's avatar
Michael Beck committed
398
static tarval *computed_value_Conv(const ir_node *n) {
Michael Beck's avatar
Michael Beck committed
399
400
	ir_node *a = get_Conv_op(n);
	tarval *ta = value_of(a);
401

Michael Beck's avatar
Michael Beck committed
402
403
	if (ta != tarval_bad)
		return tarval_convert_to(ta, get_irn_mode(n));
404

Michael Beck's avatar
Michael Beck committed
405
	return tarval_bad;
406
}  /* computed_value_Conv */
407

Michael Beck's avatar
Michael Beck committed
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
/**
 * Calculate the value of a Mux: can be evaluated, if the
 * sel and the right input are known.
 */
static tarval *computed_value_Mux(const ir_node *n) {
	ir_node *sel = get_Mux_sel(n);
	tarval *ts = value_of(sel);

	if (ts == get_tarval_b_true()) {
		ir_node *v = get_Mux_true(n);
		return value_of(v);
	}
	else if (ts == get_tarval_b_false()) {
		ir_node *v = get_Mux_false(n);
		return value_of(v);
	}
	return tarval_bad;
}  /* computed_value_Mux */

/**
 * Calculate the value of a Confirm: can be evaluated,
 * if it has the form Confirm(x, '=', Const).
 */
static tarval *computed_value_Confirm(const ir_node *n) {
	/*
	 * Beware: we might produce Phi(Confirm(x == true), Confirm(x == false)).
yb9976's avatar
yb9976 committed
434
	 * Do NOT optimize them away (jump threading wants them), so wait until
Michael Beck's avatar
Michael Beck committed
435
436
437
438
439
440
441
442
443
444
445
446
	 * remove_confirm is activated.
	 */
	if (get_opt_remove_confirm()) {
		if (get_Confirm_cmp(n) == pn_Cmp_Eq) {
			tarval *tv = value_of(get_Confirm_bound(n));
			if (tv != tarval_bad)
				return tv;
		}
	}
	return value_of(get_Confirm_value(n));
}  /* computed_value_Confirm */

447
/**
448
 * Return the value of a Proj(Cmp).
449
450
451
452
453
454
455
 *
 * This performs a first step of unreachable code elimination.
 * Proj can not be computed, but folding a Cmp above the Proj here is
 * not as wasteful as folding a Cmp into a Tuple of 16 Consts of which
 * only 1 is used.
 * There are several case where we can evaluate a Cmp node, see later.
 */
Michael Beck's avatar
Michael Beck committed
456
static tarval *computed_value_Proj_Cmp(const ir_node *n) {
Michael Beck's avatar
Michael Beck committed
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
	ir_node *a   = get_Proj_pred(n);
	ir_node *aa  = get_Cmp_left(a);
	ir_node *ab  = get_Cmp_right(a);
	long proj_nr = get_Proj_proj(n);

	/*
	 * BEWARE: a == a is NOT always True for floating Point values, as
	 * NaN != NaN is defined, so we must check this here.
	 */
	if (aa == ab && (
		!mode_is_float(get_irn_mode(aa)) || proj_nr == pn_Cmp_Lt ||  proj_nr == pn_Cmp_Gt)
		) { /* 1.: */

		/* This is a trick with the bits used for encoding the Cmp
		   Proj numbers, the following statement is not the same:
		return new_tarval_from_long (proj_nr == pn_Cmp_Eq, mode_b) */
		return new_tarval_from_long (proj_nr & pn_Cmp_Eq, mode_b);
	}
475
476
477
478
479
480
481
482
483
484
485
486
487
	tarval *taa = value_of(aa);
	tarval *tab = value_of(ab);
	ir_mode *mode = get_irn_mode(aa);

	/*
	 * The predecessors of Cmp are target values.  We can evaluate
	 * the Cmp.
	 */
	if ((taa != tarval_bad) && (tab != tarval_bad)) {
		/* strange checks... */
		pn_Cmp flags = tarval_cmp(taa, tab);
		if (flags != pn_Cmp_False) {
			return new_tarval_from_long (proj_nr & flags, mode_b);
Michael Beck's avatar
Michael Beck committed
488
		}
489
490
491
492
493
494
495
496
497
498
499
500
501
502
	}
	/* for integer values, we can check against MIN/MAX */
	else if (mode_is_int(mode)) {
		/* MIN <=/> x.  This results in true/false. */
		if (taa == get_mode_min(mode)) {
			/* a compare with the MIN value */
			if (proj_nr == pn_Cmp_Le)
				return get_tarval_b_true();
			else if (proj_nr == pn_Cmp_Gt)
				return get_tarval_b_false();
		}
		/* x >=/< MIN.  This results in true/false. */
		else
			if (tab == get_mode_min(mode)) {
Michael Beck's avatar
Michael Beck committed
503
				/* a compare with the MIN value */
504
505
506
507
508
509
510
511
512
513
514
515
516
517
				if (proj_nr == pn_Cmp_Ge)
					return get_tarval_b_true();
				else if (proj_nr == pn_Cmp_Lt)
					return get_tarval_b_false();
			}
		/* MAX >=/< x.  This results in true/false. */
			else if (taa == get_mode_max(mode)) {
				if (proj_nr == pn_Cmp_Ge)
					return get_tarval_b_true();
				else if (proj_nr == pn_Cmp_Lt)
					return get_tarval_b_false();
			}
		/* x <=/> MAX.  This results in true/false. */
			else if (tab == get_mode_max(mode)) {
Michael Beck's avatar
Michael Beck committed
518
519
520
521
522
				if (proj_nr == pn_Cmp_Le)
					return get_tarval_b_true();
				else if (proj_nr == pn_Cmp_Gt)
					return get_tarval_b_false();
			}
523
524
525

		pn_Cmp cmp_result = vrp_cmp(aa, ab);
		if (cmp_result != pn_Cmp_False) {
526
527
528
529
530
531
532
533
534
			if (cmp_result == pn_Cmp_Lg) {
				if( proj_nr == pn_Cmp_Eq) {
				return get_tarval_b_false();
				} else if(proj_nr == pn_Cmp_Lg) {
					return get_tarval_b_true();
				}
			} else {
				return new_tarval_from_long(cmp_result & proj_nr, mode_b);
			}
Michael Beck's avatar
Michael Beck committed
535
		}
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
	}
	/*
	 * The predecessors are Allocs or (void*)(0) constants.  Allocs never
	 * return NULL, they raise an exception.   Therefore we can predict
	 * the Cmp result.
	 */
	else {
		ir_node *aaa = skip_Proj(aa);
		ir_node *aba = skip_Proj(ab);

		if (   (   (/* aa is ProjP and aaa is Alloc */
						is_Proj(aa)
						&& mode_is_reference(get_irn_mode(aa))
						&& is_Alloc(aaa))
					&& (   (/* ab is NULL */
							mode_is_reference(get_irn_mode(ab))
							&& tarval_is_null(tab))
						|| (/* ab is other Alloc */
							is_Proj(ab)
							&& mode_is_reference(get_irn_mode(ab))
							&& is_Alloc(aba)
							&& (aaa != aba))))
				|| (/* aa is NULL and aba is Alloc */
					mode_is_reference(get_irn_mode(aa))
					&& tarval_is_null(taa)
					&& is_Proj(ab)
					&& mode_is_reference(get_irn_mode(ab))
					&& is_Alloc(aba)))
			/* 3.: */
565
			return new_tarval_from_long(proj_nr & pn_Cmp_Lg, mode_b);
Michael Beck's avatar
Michael Beck committed
566
567
	}
	return computed_value_Cmp_Confirm(a, aa, ab, proj_nr);
568
}  /* computed_value_Proj_Cmp */
569

570
571
572
/**
 * Return the value of a floating point Quot.
 */
Michael Beck's avatar
Michael Beck committed
573
static tarval *do_computed_value_Quot(const ir_node *a, const ir_node *b) {
574
575
576
577
578
579
580
581
582
583
584
585
586
	tarval  *ta = value_of(a);
	tarval  *tb = value_of(b);

	/* cannot optimize 0 / b = 0 because of NaN */
	if (ta != tarval_bad && tb != tarval_bad)
		return tarval_quo(ta, tb);
	return tarval_bad;
}  /* do_computed_value_Quot */

/**
 * Calculate the value of an integer Div of two nodes.
 * Special case: 0 / b
 */
Michael Beck's avatar
Michael Beck committed
587
static tarval *do_computed_value_Div(const ir_node *a, const ir_node *b) {
Michael Beck's avatar
Michael Beck committed
588
589
590
	tarval        *ta = value_of(a);
	tarval        *tb;
	const ir_node *dummy;
591
592
593
594
595
596
597
598
599
600
601
602
603
604

	/* Compute c1 / c2 or 0 / a, a != 0 */
	if (tarval_is_null(ta) && value_not_zero(b, &dummy))
		return ta;  /* 0 / b == 0 */
	tb = value_of(b);
	if (ta != tarval_bad && tb != tarval_bad)
		return tarval_div(ta, tb);
	return tarval_bad;
}  /* do_computed_value_Div */

/**
 * Calculate the value of an integer Mod of two nodes.
 * Special case: a % 1
 */
Michael Beck's avatar
Michael Beck committed
605
static tarval *do_computed_value_Mod(const ir_node *a, const ir_node *b) {
606
607
608
609
610
611
	tarval *ta = value_of(a);
	tarval *tb = value_of(b);

	/* Compute a % 1 or c1 % c2 */
	if (tarval_is_one(tb))
		return get_mode_null(get_irn_mode(a));
Michael Beck's avatar
Michael Beck committed
612
	if (ta != tarval_bad && tb != tarval_bad)
613
614
615
616
		return tarval_mod(ta, tb);
	return tarval_bad;
}  /* do_computed_value_Mod */

Michael Beck's avatar
Michael Beck committed
617
/**
Michael Beck's avatar
Michael Beck committed
618
 * Return the value of a Proj(DivMod).
Michael Beck's avatar
Michael Beck committed
619
 */
Michael Beck's avatar
Michael Beck committed
620
621
static tarval *computed_value_Proj_DivMod(const ir_node *n) {
	long proj_nr = get_Proj_proj(n);
Michael Beck's avatar
Michael Beck committed
622

Michael Beck's avatar
Michael Beck committed
623
624
625
626
627
628
629
630
631
632
	/* compute either the Div or the Mod part */
	if (proj_nr == pn_DivMod_res_div) {
		const ir_node *a = get_Proj_pred(n);
		return do_computed_value_Div(get_DivMod_left(a), get_DivMod_right(a));
	} else if (proj_nr == pn_DivMod_res_mod) {
		const ir_node *a = get_Proj_pred(n);
		return do_computed_value_Mod(get_DivMod_left(a), get_DivMod_right(a));
	}
	return tarval_bad;
}  /* computed_value_Proj_DivMod */
Michael Beck's avatar
Michael Beck committed
633

Michael Beck's avatar
Michael Beck committed
634
635
636
637
638
/**
 * Return the value of a Proj(Div).
 */
static tarval *computed_value_Proj_Div(const ir_node *n) {
	long proj_nr = get_Proj_proj(n);
Michael Beck's avatar
Michael Beck committed
639

Michael Beck's avatar
Michael Beck committed
640
641
642
	if (proj_nr == pn_Div_res) {
		const ir_node *a = get_Proj_pred(n);
		return do_computed_value_Div(get_Div_left(a), get_Div_right(a));
Michael Beck's avatar
Michael Beck committed
643
644
	}
	return tarval_bad;
Michael Beck's avatar
Michael Beck committed
645
}  /* computed_value_Proj_Div */
646

647
/**
Michael Beck's avatar
Michael Beck committed
648
 * Return the value of a Proj(Mod).
649
 */
Michael Beck's avatar
Michael Beck committed
650
651
static tarval *computed_value_Proj_Mod(const ir_node *n) {
	long proj_nr = get_Proj_proj(n);
Michael Beck's avatar
Michael Beck committed
652

Michael Beck's avatar
Michael Beck committed
653
654
655
	if (proj_nr == pn_Mod_res) {
		const ir_node *a = get_Proj_pred(n);
		return do_computed_value_Mod(get_Mod_left(a), get_Mod_right(a));
Michael Beck's avatar
Michael Beck committed
656
657
	}
	return tarval_bad;
Michael Beck's avatar
Michael Beck committed
658
}  /* computed_value_Proj_Mod */
659

Michael Beck's avatar
BugFix:    
Michael Beck committed
660
/**
Michael Beck's avatar
Michael Beck committed
661
 * Return the value of a Proj(Quot).
Michael Beck's avatar
BugFix:    
Michael Beck committed
662
 */
Michael Beck's avatar
Michael Beck committed
663
664
665
666
667
668
669
static tarval *computed_value_Proj_Quot(const ir_node *n) {
	long proj_nr = get_Proj_proj(n);

	if (proj_nr == pn_Quot_res) {
		const ir_node *a = get_Proj_pred(n);
		return do_computed_value_Quot(get_Quot_left(a), get_Quot_right(a));
	}
Michael Beck's avatar
Michael Beck committed
670
	return tarval_bad;
Michael Beck's avatar
Michael Beck committed
671
}  /* computed_value_Proj_Quot */
Michael Beck's avatar
BugFix:    
Michael Beck committed
672

Michael Beck's avatar
Michael Beck committed
673
/**
Michael Beck's avatar
Michael Beck committed
674
 * Return the value of a Proj.
Michael Beck's avatar
Michael Beck committed
675
 */
Michael Beck's avatar
Michael Beck committed
676
677
678
679
680
681
682
static tarval *computed_value_Proj(const ir_node *proj) {
	ir_node *n = get_Proj_pred(proj);

	if (n->op->ops.computed_value_Proj != NULL)
		return n->op->ops.computed_value_Proj(proj);
	return tarval_bad;
}  /* computed_value_Proj */
Michael Beck's avatar
Michael Beck committed
683

684
685
686
/**
 * If the parameter n can be computed, return its value, else tarval_bad.
 * Performs constant folding.
687
688
 *
 * @param n  The node this should be evaluated
689
 */
Michael Beck's avatar
Michael Beck committed
690
tarval *computed_value(const ir_node *n) {
691
692
693
694
	if(mode_is_int(get_irn_mode(n)) && tarval_is_all_one(
				tarval_or(n->vrp.bits_set, n->vrp.bits_not_set))) {
		return n->vrp.bits_set;
	}
Michael Beck's avatar
Michael Beck committed
695
696
697
	if (n->op->ops.computed_value)
		return n->op->ops.computed_value(n);
	return tarval_bad;
698
}  /* computed_value */
Christian Schäfer's avatar
Christian Schäfer committed
699

700
/**
701
 * Set the default computed_value evaluator in an ir_op_ops.
Michael Beck's avatar
Michael Beck committed
702
703
704
705
706
707
 *
 * @param code   the opcode for the default operation
 * @param ops    the operations initialized
 *
 * @return
 *    The operations.
708
 */
709
710
static ir_op_ops *firm_set_default_computed_value(ir_opcode code, ir_op_ops *ops)
{
Michael Beck's avatar
Michael Beck committed
711
712
713
714
715
716
717
#define CASE(a)                                        \
	case iro_##a:                                      \
		ops->computed_value      = computed_value_##a; \
		break
#define CASE_PROJ(a)                                        \
	case iro_##a:                                           \
		ops->computed_value_Proj = computed_value_Proj_##a; \
Michael Beck's avatar
Michael Beck committed
718
719
720
721
722
723
724
		break

	switch (code) {
	CASE(Const);
	CASE(SymConst);
	CASE(Add);
	CASE(Sub);
Michael Beck's avatar
Michael Beck committed
725
726
	CASE(Carry);
	CASE(Borrow);
Michael Beck's avatar
Michael Beck committed
727
728
729
730
731
732
733
734
735
736
	CASE(Minus);
	CASE(Mul);
	CASE(Abs);
	CASE(And);
	CASE(Or);
	CASE(Eor);
	CASE(Not);
	CASE(Shl);
	CASE(Shr);
	CASE(Shrs);
737
	CASE(Rotl);
Michael Beck's avatar
Michael Beck committed
738
739
740
	CASE(Conv);
	CASE(Mux);
	CASE(Confirm);
Michael Beck's avatar
Michael Beck committed
741
742
743
744
745
746
	CASE_PROJ(Cmp);
	CASE_PROJ(DivMod);
	CASE_PROJ(Div);
	CASE_PROJ(Mod);
	CASE_PROJ(Quot);
	CASE(Proj);
Michael Beck's avatar
Michael Beck committed
747
748
749
750
751
	default:
		/* leave NULL */;
	}

	return ops;
Michael Beck's avatar
Michael Beck committed
752
#undef CASE_PROJ
753
#undef CASE
754
}  /* firm_set_default_computed_value */
Christian Schäfer's avatar
Christian Schäfer committed
755

Michael Beck's avatar
Michael Beck committed
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
/**
 * Returns a equivalent block for another block.
 * If the block has only one predecessor, this is
 * the equivalent one. If the only predecessor of a block is
 * the block itself, this is a dead block.
 *
 * If both predecessors of a block are the branches of a binary
 * Cond, the equivalent block is Cond's block.
 *
 * If all predecessors of a block are bad or lies in a dead
 * block, the current block is dead as well.
 *
 * Note, that blocks are NEVER turned into Bad's, instead
 * the dead_block flag is set. So, never test for is_Bad(block),
 * always use is_dead_Block(block).
 */
772
773
static ir_node *equivalent_node_Block(ir_node *n)
{
Michael Beck's avatar
Michael Beck committed
774
	ir_node *oldn = n;
775
	int     n_preds;
Michael Beck's avatar
Michael Beck committed
776

777
	/* don't optimize dead or labeled blocks */
778
	if (is_Block_dead(n) || has_Block_entity(n))
779
780
781
782
783
784
		return n;

	n_preds = get_Block_n_cfgpreds(n);

	/* The Block constructor does not call optimize, but mature_immBlock()
	   calls the optimization. */
Michael Beck's avatar
Michael Beck committed
785
786
787
788
789
790
791
792
	assert(get_Block_matured(n));

	/* Straightening: a single entry Block following a single exit Block
	   can be merged, if it is not the Start block. */
	/* !!! Beware, all Phi-nodes of n must have been optimized away.
	   This should be true, as the block is matured before optimize is called.
	   But what about Phi-cycles with the Phi0/Id that could not be resolved?
	   Remaining Phi nodes are just Ids. */
Michael Beck's avatar
Michael Beck committed
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
	if (n_preds == 1) {
		ir_node *pred = skip_Proj(get_Block_cfgpred(n, 0));

		if (is_Jmp(pred)) {
			ir_node *predblock = get_nodes_block(pred);
			if (predblock == oldn) {
				/* Jmp jumps into the block it is in -- deal self cycle. */
				n = set_Block_dead(n);
				DBG_OPT_DEAD_BLOCK(oldn, n);
			} else if (get_opt_control_flow_straightening()) {
				n = predblock;
				DBG_OPT_STG(oldn, n);
			}
		} else if (is_Cond(pred)) {
			ir_node *predblock = get_nodes_block(pred);
			if (predblock == oldn) {
				/* Jmp jumps into the block it is in -- deal self cycle. */
				n = set_Block_dead(n);
				DBG_OPT_DEAD_BLOCK(oldn, n);
			}
Michael Beck's avatar
Michael Beck committed
813
814
815
816
817
818
819
820
821
822
		}
	} else if ((n_preds == 2) &&
	           (get_opt_control_flow_weak_simplification())) {
		/* Test whether Cond jumps twice to this block
		 * The more general case which more than 2 predecessors is handles
		 * in optimize_cf(), we handle only this special case for speed here.
		 */
		ir_node *a = get_Block_cfgpred(n, 0);
		ir_node *b = get_Block_cfgpred(n, 1);

Michael Beck's avatar
Michael Beck committed
823
824
825
826
827
828
829
830
831
832
		if (is_Proj(a) && is_Proj(b)) {
			ir_node *cond = get_Proj_pred(a);

		    if (cond == get_Proj_pred(b) && is_Cond(cond) &&
		        get_irn_mode(get_Cond_selector(cond)) == mode_b) {
				/* Also a single entry Block following a single exit Block.  Phis have
				   twice the same operand and will be optimized away. */
				n = get_nodes_block(cond);
				DBG_OPT_IFSIM1(oldn, a, b, n);
			}
Michael Beck's avatar
Michael Beck committed
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
		}
	} else if (get_opt_unreachable_code() &&
	           (n != get_irg_start_block(current_ir_graph)) &&
	           (n != get_irg_end_block(current_ir_graph))    ) {
		int i;

		/* If all inputs are dead, this block is dead too, except if it is
		   the start or end block.  This is one step of unreachable code
		   elimination */
		for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
			ir_node *pred = get_Block_cfgpred(n, i);
			ir_node *pred_blk;

			if (is_Bad(pred)) continue;
			pred_blk = get_nodes_block(skip_Proj(pred));

			if (is_Block_dead(pred_blk)) continue;

			if (pred_blk != n) {
				/* really found a living input */
				break;
			}
		}
		if (i < 0) {
			n = set_Block_dead(n);
			DBG_OPT_DEAD_BLOCK(oldn, n);
		}
	}

	return n;
863
}  /* equivalent_node_Block */
864

865
866
/**
 * Returns a equivalent node for a Jmp, a Bad :-)
867
 * Of course this only happens if the Block of the Jmp is dead.
868
 */
869
static ir_node *equivalent_node_Jmp(ir_node *n) {
Michael Beck's avatar
Michael Beck committed
870
	ir_node *oldn = n;
871

Michael Beck's avatar
Michael Beck committed
872
873
874
875
876
	/* unreachable code elimination */
	if (is_Block_dead(get_nodes_block(n))) {
		n = get_irg_bad(current_ir_graph);
		DBG_OPT_DEAD_BLOCK(oldn, n);
	}
Michael Beck's avatar
Michael Beck committed
877
	return n;
878
}  /* equivalent_node_Jmp */
879

880
/** Raise is handled in the same way as Jmp. */
881
882
883
#define equivalent_node_Raise   equivalent_node_Jmp


884
885
/* We do not evaluate Cond here as we replace it by a new node, a Jmp.
   See transform_node_Proj_Cond(). */
886

887
/**
888
 * Optimize operations that are commutative and have neutral 0,
889
 * so a op 0 = 0 op a = a.
890
 */
Michael Beck's avatar
Michael Beck committed
891
static ir_node *equivalent_node_neutral_zero(ir_node *n) {
Michael Beck's avatar
Michael Beck committed
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
	ir_node *oldn = n;

	ir_node *a = get_binop_left(n);
	ir_node *b = get_binop_right(n);

	tarval *tv;
	ir_node *on;

	/* After running compute_node there is only one constant predecessor.
	   Find this predecessors value and remember the other node: */
	if ((tv = value_of(a)) != tarval_bad) {
		on = b;
	} else if ((tv = value_of(b)) != tarval_bad) {
		on = a;
	} else
		return n;

	/* If this predecessors constant value is zero, the operation is
	 * unnecessary. Remove it.
	 *
	 * Beware: If n is a Add, the mode of on and n might be different
	 * which happens in this rare construction: NULL + 3.
	 * Then, a Conv would be needed which we cannot include here.
	 */
916
917
	if (tarval_is_null(tv) && get_irn_mode(on) == get_irn_mode(n)) {
		n = on;
Michael Beck's avatar
Michael Beck committed
918

919
		DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_NEUTRAL_0);
Michael Beck's avatar
Michael Beck committed
920
921
922
	}

	return n;
923
}  /* equivalent_node_neutral_zero */
924

925
926
927
/**
 * Eor is commutative and has neutral 0.
 */
Michael Beck's avatar
Michael Beck committed
928
static ir_node *equivalent_node_Eor(ir_node *n) {
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
	ir_node *oldn = n;
	ir_node *a;
	ir_node *b;

	n = equivalent_node_neutral_zero(n);
	if (n != oldn) return n;

	a = get_Eor_left(n);
	b = get_Eor_right(n);

	if (is_Eor(a)) {
		ir_node *aa = get_Eor_left(a);
		ir_node *ab = get_Eor_right(a);

		if (aa == b) {
			/* (a ^ b) ^ a -> b */
			n = ab;
Michael Beck's avatar
Michael Beck committed
946
			DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_EOR_A_B_A);
Michael Beck's avatar
Michael Beck committed
947
			return n;
948
949
950
		} else if (ab == b) {
			/* (a ^ b) ^ b -> a */
			n = aa;
Michael Beck's avatar
Michael Beck committed
951
			DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_EOR_A_B_A);
Michael Beck's avatar
Michael Beck committed
952
			return n;
953
		}
954
955
	}
	if (is_Eor(b)) {
956
957
958
959
960
961
		ir_node *ba = get_Eor_left(b);
		ir_node *bb = get_Eor_right(b);

		if (ba == a) {
			/* a ^ (a ^ b) -> b */
			n = bb;
Michael Beck's avatar
Michael Beck committed
962
			DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_EOR_A_B_A);
Michael Beck's avatar
Michael Beck committed
963
			return n;
964
965
966
		} else if (bb == a) {
			/* a ^ (b ^ a) -> b */
			n = ba;
Michael Beck's avatar
Michael Beck committed
967
			DBG_OPT_ALGSIM1(oldn, a, b, n, FS_OPT_EOR_A_B_A);
Michael Beck's avatar
Michael Beck committed
968
			return n;
969
970
971
972
		}
	}
	return n;
}
973

974
975
976
977
978
/*
 * Optimize a - 0 and (a - x) + x (for modes with wrap-around).
 *
 * The second one looks strange, but this construct
 * is used heavily in the LCC sources :-).
979
980
981
 *
 * Beware: The Mode of an Add may be different than the mode of its
 * predecessors, so we could not return a predecessors in all cases.
982
 */
Michael Beck's avatar
Michael Beck committed
983
984
985
986
987
988
989
990
991
static ir_node *equivalent_node_Add(ir_node *n) {
	ir_node *oldn = n;
	ir_node *left, *right;
	ir_mode *mode = get_irn_mode(n);

	n = equivalent_node_neutral_zero(n);
	if (n != oldn)
		return n;

992
993
994
995
	/* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
	if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
		return n;

Michael Beck's avatar
Michael Beck committed
996
997
998
	left  = get_Add_left(n);
	right = get_Add_right(n);

999
	if (is_Sub(left)) {
Michael Beck's avatar
Michael Beck committed
1000
		if (get_Sub_right(left) == right) {
For faster browsing, not all history is shown. View entire blame