ldstopt.c 61.4 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.
 */

Michael Beck's avatar
Michael Beck committed
20
21
22
23
24
/**
 * @file
 * @brief   Load/Store optimizations.
 * @author  Michael Beck
 * @version $Id$
Michael Beck's avatar
Michael Beck 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>
Michael Beck's avatar
Michael Beck committed
29

30
#include "iroptimize.h"
31
32
33
34
35
36
37
38
39
40
41
42
#include "irnode_t.h"
#include "irgraph_t.h"
#include "irmode_t.h"
#include "iropt_t.h"
#include "ircons_t.h"
#include "irgmod.h"
#include "irgwalk.h"
#include "irvrfy.h"
#include "tv_t.h"
#include "dbginfo_t.h"
#include "iropt_dbg.h"
#include "irflag_t.h"
43
#include "array_t.h"
44
#include "irhooks.h"
Michael Beck's avatar
BugFix:    
Michael Beck committed
45
#include "iredges.h"
46
47
#include "irtools.h"
#include "opt_polymorphy.h"
48
#include "irmemory.h"
49
50
#include "irphase_t.h"
#include "irgopt.h"
51
#include "set.h"
52
53
54
55
#include "debug.h"

/** The debug handle. */
DEBUG_ONLY(static firm_dbg_module_t *dbg;)
56
57
58
59

#ifdef DO_CACHEOPT
#include "cacheopt/cachesim.h"
#endif
Michael Beck's avatar
Michael Beck committed
60
61
62
63

#undef IMAX
#define IMAX(a,b)	((a) > (b) ? (a) : (b))

64
#define MAX_PROJ	IMAX(IMAX(pn_Load_max, pn_Store_max), pn_Call_max)
Michael Beck's avatar
Michael Beck committed
65

66
enum changes_t {
67
68
	DF_CHANGED = 1,       /**< data flow changed */
	CF_CHANGED = 2,       /**< control flow changed */
69
70
};

Michael Beck's avatar
Michael Beck committed
71
72
73
74
/**
 * walker environment
 */
typedef struct _walk_env_t {
75
76
	struct obstack obst;          /**< list of all stores */
	unsigned changes;             /**< a bitmask of graph changes */
Michael Beck's avatar
Michael Beck committed
77
78
} walk_env_t;

79
/** A Load/Store info. */
Michael Beck's avatar
Michael Beck committed
80
typedef struct _ldst_info_t {
81
82
83
84
	ir_node  *projs[MAX_PROJ];    /**< list of Proj's of this node */
	ir_node  *exc_block;          /**< the exception block if available */
	int      exc_idx;             /**< predecessor index in the exception block */
	unsigned visited;             /**< visited counter for breaking loops */
Michael Beck's avatar
Michael Beck committed
85
86
} ldst_info_t;

87
/**
88
 * flags for control flow.
89
90
 */
enum block_flags_t {
91
92
	BLOCK_HAS_COND = 1,      /**< Block has conditional control flow */
	BLOCK_HAS_EXC  = 2       /**< Block has exceptional control flow */
93
94
95
};

/**
96
 * a Block info.
97
98
 */
typedef struct _block_info_t {
99
	unsigned flags;               /**< flags for the block */
100
101
} block_info_t;

102
103
104
105
106
107
108
/** the master visited flag for loop detection. */
static unsigned master_visited = 0;

#define INC_MASTER()       ++master_visited
#define MARK_NODE(info)    (info)->visited = master_visited
#define NODE_VISITED(info) (info)->visited >= master_visited

Michael Beck's avatar
Michael Beck committed
109
110
111
/**
 * get the Load/Store info of a node
 */
112
static ldst_info_t *get_ldst_info(ir_node *node, struct obstack *obst) {
113
	ldst_info_t *info = get_irn_link(node);
Michael Beck's avatar
Michael Beck committed
114

115
	if (! info) {
116
		info = obstack_alloc(obst, sizeof(*info));
117
118
119
120
121
		memset(info, 0, sizeof(*info));
		set_irn_link(node, info);
	}
	return info;
}  /* get_ldst_info */
Michael Beck's avatar
Michael Beck committed
122

123
124
125
/**
 * get the Block info of a node
 */
126
static block_info_t *get_block_info(ir_node *node, struct obstack *obst) {
127
	block_info_t *info = get_irn_link(node);
128

129
	if (! info) {
130
		info = obstack_alloc(obst, sizeof(*info));
131
132
133
134
135
		memset(info, 0, sizeof(*info));
		set_irn_link(node, info);
	}
	return info;
}  /* get_block_info */
136

Michael Beck's avatar
Michael Beck committed
137
/**
Michael Beck's avatar
Michael Beck committed
138
 * update the projection info for a Load/Store
Michael Beck's avatar
Michael Beck committed
139
 */
140
static unsigned update_projs(ldst_info_t *info, ir_node *proj)
Michael Beck's avatar
Michael Beck committed
141
{
142
	long nr = get_Proj_proj(proj);
Michael Beck's avatar
Michael Beck committed
143

144
	assert(0 <= nr && nr <= MAX_PROJ && "Wrong proj from LoadStore");
Michael Beck's avatar
Michael Beck committed
145

146
147
148
149
150
151
152
153
154
155
	if (info->projs[nr]) {
		/* there is already one, do CSE */
		exchange(proj, info->projs[nr]);
		return DF_CHANGED;
	}
	else {
		info->projs[nr] = proj;
		return 0;
	}
}  /* update_projs */
Michael Beck's avatar
Michael Beck committed
156
157

/**
158
159
160
161
162
 * update the exception block info for a Load/Store node.
 *
 * @param info   the load/store info struct
 * @param block  the exception handler block for this load/store
 * @param pos    the control flow input of the block
Michael Beck's avatar
Michael Beck committed
163
 */
164
static unsigned update_exc(ldst_info_t *info, ir_node *block, int pos)
Michael Beck's avatar
Michael Beck committed
165
{
166
	assert(info->exc_block == NULL && "more than one exception block found");
Michael Beck's avatar
Michael Beck committed
167

168
169
170
171
	info->exc_block = block;
	info->exc_idx   = pos;
	return 0;
}  /* update_exc */
Michael Beck's avatar
Michael Beck committed
172

173
/** Return the number of uses of an address node */
Michael Beck's avatar
BugFix:    
Michael Beck committed
174
#define get_irn_n_uses(adr)     get_irn_n_edges(adr)
175

Michael Beck's avatar
Michael Beck committed
176
177
/**
 * walker, collects all Load/Store/Proj nodes
178
 *
179
 * walks from Start -> End
Michael Beck's avatar
Michael Beck committed
180
 */
Michael Beck's avatar
Michael Beck committed
181
static void collect_nodes(ir_node *node, void *env)
Michael Beck's avatar
Michael Beck committed
182
{
183
	ir_opcode   opcode = get_irn_opcode(node);
184
185
186
187
	ir_node     *pred, *blk, *pred_blk;
	ldst_info_t *ldst_info;
	walk_env_t  *wenv = env;

188
189
190
	if (opcode == iro_Proj) {
		pred   = get_Proj_pred(node);
		opcode = get_irn_opcode(pred);
191

192
		if (opcode == iro_Load || opcode == iro_Store || opcode == iro_Call) {
193
			ldst_info = get_ldst_info(pred, &wenv->obst);
194
195
196
197

			wenv->changes |= update_projs(ldst_info, node);

			/*
198
199
200
201
202
			 * Place the Proj's to the same block as the
			 * predecessor Load. This is always ok and prevents
			 * "non-SSA" form after optimizations if the Proj
			 * is in a wrong block.
			 */
203
204
205
206
207
208
209
			blk      = get_nodes_block(node);
			pred_blk = get_nodes_block(pred);
			if (blk != pred_blk) {
				wenv->changes |= DF_CHANGED;
				set_nodes_block(node, pred_blk);
			}
		}
210
	} else if (opcode == iro_Block) {
211
212
213
		int i;

		for (i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) {
214
			ir_node      *pred_block, *proj;
215
			block_info_t *bl_info;
216
217
218
			int          is_exc = 0;

			pred = proj = get_Block_cfgpred(node, i);
219

220
221
222
223
			if (is_Proj(proj)) {
				pred   = get_Proj_pred(proj);
				is_exc = get_Proj_proj(proj) == pn_Generic_X_except;
			}
224
225
226
227
228
229

			/* ignore Bad predecessors, they will be removed later */
			if (is_Bad(pred))
				continue;

			pred_block = get_nodes_block(pred);
230
			bl_info    = get_block_info(pred_block, &wenv->obst);
231

232
			if (is_fragile_op(pred) && is_exc)
233
234
235
236
				bl_info->flags |= BLOCK_HAS_EXC;
			else if (is_irn_forking(pred))
				bl_info->flags |= BLOCK_HAS_COND;

237
238
			opcode = get_irn_opcode(pred);
			if (is_exc && (opcode == iro_Load || opcode == iro_Store || opcode == iro_Call)) {
239
				ldst_info = get_ldst_info(pred, &wenv->obst);
240
241
242
243
244
245

				wenv->changes |= update_exc(ldst_info, node, i);
			}
		}
	}
}  /* collect_nodes */
Michael Beck's avatar
Michael Beck committed
246

Michael Beck's avatar
Michael Beck committed
247
/**
248
 * Returns an entity if the address ptr points to a constant one.
249
250
251
252
 *
 * @param ptr  the address
 *
 * @return an entity or NULL
Michael Beck's avatar
Michael Beck committed
253
 */
254
static ir_entity *find_constant_entity(ir_node *ptr)
Michael Beck's avatar
Michael Beck committed
255
{
256
	for (;;) {
257
		if (is_SymConst(ptr) && get_SymConst_kind(ptr) == symconst_addr_ent) {
258
			return get_SymConst_entity(ptr);
259
		} else if (is_Sel(ptr)) {
260
261
262
263
264
265
266
267
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
301
302
303
304
			ir_entity *ent = get_Sel_entity(ptr);
			ir_type   *tp  = get_entity_owner(ent);

			/* Do not fiddle with polymorphism. */
			if (is_Class_type(get_entity_owner(ent)) &&
				((get_entity_n_overwrites(ent)    != 0) ||
				(get_entity_n_overwrittenby(ent) != 0)   ) )
				return NULL;

			if (is_Array_type(tp)) {
				/* check bounds */
				int i, n;

				for (i = 0, n = get_Sel_n_indexs(ptr); i < n; ++i) {
					ir_node *bound;
					tarval *tlower, *tupper;
					ir_node *index = get_Sel_index(ptr, i);
					tarval *tv     = computed_value(index);

					/* check if the index is constant */
					if (tv == tarval_bad)
						return NULL;

					bound  = get_array_lower_bound(tp, i);
					tlower = computed_value(bound);
					bound  = get_array_upper_bound(tp, i);
					tupper = computed_value(bound);

					if (tlower == tarval_bad || tupper == tarval_bad)
						return NULL;

					if (tarval_cmp(tv, tlower) & pn_Cmp_Lt)
						return NULL;
					if (tarval_cmp(tupper, tv) & pn_Cmp_Lt)
						return NULL;

					/* ok, bounds check finished */
				}
			}

			if (variability_constant == get_entity_variability(ent))
				return ent;

			/* try next */
			ptr = get_Sel_ptr(ptr);
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
		} else if (is_Add(ptr)) {
			ir_node *l = get_Add_left(ptr);
			ir_node *r = get_Add_right(ptr);

			if (get_irn_mode(l) == get_irn_mode(ptr) && is_Const(r))
				ptr = l;
			else if (get_irn_mode(r) == get_irn_mode(ptr) && is_Const(l))
				ptr = r;
			else
				return NULL;

			/* for now, we support only one addition, reassoc should fold all others */
			if (! is_SymConst(ptr) && !is_Sel(ptr))
				return NULL;
		} else if (is_Sub(ptr)) {
			ir_node *l = get_Sub_left(ptr);
			ir_node *r = get_Sub_right(ptr);

			if (get_irn_mode(l) == get_irn_mode(ptr) &&	is_Const(r))
				ptr = l;
			else
				return NULL;
			/* for now, we support only one substraction, reassoc should fold all others */
			if (! is_SymConst(ptr) && !is_Sel(ptr))
				return NULL;
330
331
332
333
		} else
			return NULL;
	}
}  /* find_constant_entity */
Michael Beck's avatar
Michael Beck committed
334

Michael Beck's avatar
Michael Beck committed
335
336
337
/**
 * Return the Selection index of a Sel node from dimension n
 */
338
static long get_Sel_array_index_long(ir_node *n, int dim) {
339
	ir_node *index = get_Sel_index(n, dim);
Michael Beck's avatar
Michael Beck committed
340
	assert(is_Const(index));
341
342
	return get_tarval_long(get_Const_tarval(index));
}  /* get_Sel_array_index_long */
343

Michael Beck's avatar
Michael Beck committed
344
345
346
347
348
349
350
351
/**
 * Returns the accessed component graph path for an
 * node computing an address.
 *
 * @param ptr    the node computing the address
 * @param depth  current depth in steps upward from the root
 *               of the address
 */
Götz Lindenmaier's avatar
bugfix    
Götz Lindenmaier committed
352
static compound_graph_path *rec_get_accessed_path(ir_node *ptr, int depth) {
353
	compound_graph_path *res = NULL;
354
355
356
357
	ir_entity           *root, *field, *ent;
	int                 path_len, pos, idx;
	tarval              *tv;
	ir_type             *tp;
358

359
	if (is_SymConst(ptr)) {
360
361
		/* a SymConst. If the depth is 0, this is an access to a global
		 * entity and we don't need a component path, else we know
Christoph Mallon's avatar
Christoph Mallon committed
362
		 * at least its length.
363
364
365
366
		 */
		assert(get_SymConst_kind(ptr) == symconst_addr_ent);
		root = get_SymConst_entity(ptr);
		res = (depth == 0) ? NULL : new_compound_graph_path(get_entity_type(root), depth);
367
	} else if (is_Sel(ptr)) {
368
369
		/* it's a Sel, go up until we find the root */
		res = rec_get_accessed_path(get_Sel_ptr(ptr), depth+1);
370
371
		if (res == NULL)
			return NULL;
372
373
374
375
376
377
378
379
380
381
382

		/* fill up the step in the path at the current position */
		field    = get_Sel_entity(ptr);
		path_len = get_compound_graph_path_length(res);
		pos      = path_len - depth - 1;
		set_compound_graph_path_node(res, pos, field);

		if (is_Array_type(get_entity_owner(field))) {
			assert(get_Sel_n_indexs(ptr) == 1 && "multi dim arrays not implemented");
			set_compound_graph_path_array_index(res, pos, get_Sel_array_index_long(ptr, 0));
		}
383
	} else if (is_Add(ptr)) {
Michael Beck's avatar
Michael Beck committed
384
385
386
387
		ir_node *l    = get_Add_left(ptr);
		ir_node *r    = get_Add_right(ptr);
		ir_mode *mode = get_irn_mode(ptr);
		tarval  *tmp;
388

Michael Beck's avatar
Michael Beck committed
389
		if (is_Const(r) && get_irn_mode(l) == mode) {
390
391
392
393
394
395
396
397
			ptr = l;
			tv  = get_Const_tarval(r);
		} else {
			ptr = r;
			tv  = get_Const_tarval(l);
		}
ptr_arith:
		mode = get_tarval_mode(tv);
Michael Beck's avatar
Michael Beck committed
398
		tmp  = tv;
399
400
401
402
403
404
405
406
407

		/* ptr must be a Sel or a SymConst, this was checked in find_constant_entity() */
		if (is_Sel(ptr)) {
			field = get_Sel_entity(ptr);
		} else {
			field = get_SymConst_entity(ptr);
		}
		idx = 0;
		for (ent = field;;) {
408
409
410
411
			unsigned size;
			tarval   *sz, *tv_index, *tlower, *tupper;
			ir_node  *bound;

412
413
414
415
			tp = get_entity_type(ent);
			if (! is_Array_type(tp))
				break;
			ent = get_array_element_entity(tp);
416
417
418
			size = get_type_size_bytes(get_entity_type(ent));
			sz   = new_tarval_from_long(size, mode);

Michael Beck's avatar
Michael Beck committed
419
420
			tv_index = tarval_div(tmp, sz);
			tmp      = tarval_mod(tmp, sz);
421

Michael Beck's avatar
Michael Beck committed
422
			if (tv_index == tarval_bad || tmp == tarval_bad)
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
				return NULL;

			assert(get_array_n_dimensions(tp) == 1 && "multiarrays not implemented");
			bound  = get_array_lower_bound(tp, 0);
			tlower = computed_value(bound);
			bound  = get_array_upper_bound(tp, 0);
			tupper = computed_value(bound);

			if (tlower == tarval_bad || tupper == tarval_bad)
				return NULL;

			if (tarval_cmp(tv_index, tlower) & pn_Cmp_Lt)
				return NULL;
			if (tarval_cmp(tupper, tv_index) & pn_Cmp_Lt)
				return NULL;

			/* ok, bounds check finished */
440
441
			++idx;
		}
Michael Beck's avatar
Michael Beck committed
442
		if (! tarval_is_null(tmp)) {
443
444
445
446
			/* access to some struct/union member */
			return NULL;
		}

447
448
449
450
451
452
453
454
455
456
457
458
459
		/* should be at least ONE array */
		if (idx == 0)
			return NULL;

		res = rec_get_accessed_path(ptr, depth + idx);
		if (res == NULL)
			return NULL;

		path_len = get_compound_graph_path_length(res);
		pos      = path_len - depth - idx;

		for (ent = field;;) {
			unsigned size;
460
			tarval   *sz, *tv_index;
461
462
463
464
465
466
467
468
469
470
471
472
473
474
			long     index;

			tp = get_entity_type(ent);
			if (! is_Array_type(tp))
				break;
			ent = get_array_element_entity(tp);
			set_compound_graph_path_node(res, pos, ent);

			size = get_type_size_bytes(get_entity_type(ent));
			sz   = new_tarval_from_long(size, mode);

			tv_index = tarval_div(tv, sz);
			tv       = tarval_mod(tv, sz);

Michael Beck's avatar
Michael Beck committed
475
476
			/* worked above, should work again */
			assert(tv_index != tarval_bad && tv != tarval_bad);
477

478
			/* bounds already checked above */
479
480
481
482
483
484
485
486
487
488
489
490
			index = get_tarval_long(tv_index);
			set_compound_graph_path_array_index(res, pos, index);
			++pos;
		}
	} else if (is_Sub(ptr)) {
		ir_node *l = get_Sub_left(ptr);
		ir_node *r = get_Sub_right(ptr);

		ptr = l;
		tv  = get_Const_tarval(r);
		tv  = tarval_neg(tv);
		goto ptr_arith;
491
492
493
	}
	return res;
}  /* rec_get_accessed_path */
494

495
496
497
/**
 * Returns an access path or NULL.  The access path is only
 * valid, if the graph is in phase_high and _no_ address computation is used.
Michael Beck's avatar
Michael Beck committed
498
 */
Götz Lindenmaier's avatar
bugfix    
Götz Lindenmaier committed
499
static compound_graph_path *get_accessed_path(ir_node *ptr) {
Michael Beck's avatar
Michael Beck committed
500
501
	compound_graph_path *gr = rec_get_accessed_path(ptr, 0);
	return gr;
502
}  /* get_accessed_path */
503

504
505
506
507
508
509
510
511
typedef struct path_entry {
	ir_entity         *ent;
	struct path_entry *next;
	long              index;
} path_entry;

static ir_node *rec_find_compound_ent_value(ir_node *ptr, path_entry *next) {
	path_entry       entry, *p;
512
	ir_entity        *ent, *field;
513
	ir_initializer_t *initializer;
514
515
	tarval           *tv;
	ir_type          *tp;
516
	unsigned         n;
517

518
	entry.next = next;
519
520
	if (is_SymConst(ptr)) {
		/* found the root */
521
		ent         = get_SymConst_entity(ptr);
522
		initializer = get_entity_initializer(ent);
523
		for (p = next; p != NULL;) {
524
525
			if (initializer->kind != IR_INITIALIZER_COMPOUND)
				return NULL;
526
527
			n  = get_initializer_compound_n_entries(initializer);
			tp = get_entity_type(ent);
528

529
530
531
532
533
534
535
536
537
538
			if (is_Array_type(tp)) {
				ent = get_array_element_entity(tp);
				if (ent != p->ent) {
					/* a missing [0] */
					if (0 >= n)
						return NULL;
					initializer = get_initializer_compound_value(initializer, 0);
					continue;
				}
			}
539
			if (p->index >= (int) n)
540
541
				return NULL;
			initializer = get_initializer_compound_value(initializer, p->index);
542
543
544
545
546
547
548
549
550
551
552
553
554

			ent = p->ent;
			p   = p->next;
		}
		tp = get_entity_type(ent);
		while (is_Array_type(tp)) {
			ent = get_array_element_entity(tp);
			tp = get_entity_type(ent);
			/* a missing [0] */
			n  = get_initializer_compound_n_entries(initializer);
			if (0 >= n)
				return NULL;
			initializer = get_initializer_compound_value(initializer, 0);
555
		}
556

557
558
559
560
561
562
563
564
565
		switch (initializer->kind) {
		case IR_INITIALIZER_CONST:
			return get_initializer_const_value(initializer);
		case IR_INITIALIZER_TARVAL:
		case IR_INITIALIZER_NULL:
		default:
			return NULL;
		}
	} else if (is_Sel(ptr)) {
566
567
568
569
		entry.ent = field = get_Sel_entity(ptr);
		tp = get_entity_owner(field);
		if (is_Array_type(tp)) {
			assert(get_Sel_n_indexs(ptr) == 1 && "multi dim arrays not implemented");
570
			entry.index = get_Sel_array_index_long(ptr, 0) - get_array_lower_bound_int(tp, 0);
571
572
573
574
575
576
577
578
579
580
581
582
583
		} else {
			int i, n_members = get_compound_n_members(tp);
			for (i = 0; i < n_members; ++i) {
				if (get_compound_member(tp, i) == field)
					break;
			}
			if (i >= n_members) {
				/* not found: should NOT happen */
				return NULL;
			}
			entry.index = i;
		}
		return rec_find_compound_ent_value(get_Sel_ptr(ptr), &entry);
584
585
586
587
588
	}  else if (is_Add(ptr)) {
		ir_node  *l = get_Add_left(ptr);
		ir_node  *r = get_Add_right(ptr);
		ir_mode  *mode;
		unsigned pos;
589

590
591
592
593
594
595
596
597
598
		if (is_Const(r)) {
			ptr = l;
			tv  = get_Const_tarval(r);
		} else {
			ptr = r;
			tv  = get_Const_tarval(l);
		}
ptr_arith:
		mode = get_tarval_mode(tv);
599

600
601
602
603
604
605
		/* ptr must be a Sel or a SymConst, this was checked in find_constant_entity() */
		if (is_Sel(ptr)) {
			field = get_Sel_entity(ptr);
		} else {
			field = get_SymConst_entity(ptr);
		}
606

607
608
609
610
611
612
613
614
615
616
617
		/* count needed entries */
		pos = 0;
		for (ent = field;;) {
			tp = get_entity_type(ent);
			if (! is_Array_type(tp))
				break;
			ent = get_array_element_entity(tp);
			++pos;
		}
		/* should be at least ONE entry */
		if (pos == 0)
618
619
			return NULL;

620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
		/* allocate the right number of entries */
		NEW_ARR_A(path_entry, p, pos);

		/* fill them up */
		pos = 0;
		for (ent = field;;) {
			unsigned size;
			tarval   *sz, *tv_index, *tlower, *tupper;
			long     index;
			ir_node  *bound;

			tp = get_entity_type(ent);
			if (! is_Array_type(tp))
				break;
			ent = get_array_element_entity(tp);
			p[pos].ent  = ent;
			p[pos].next = &p[pos + 1];

			size = get_type_size_bytes(get_entity_type(ent));
			sz   = new_tarval_from_long(size, mode);

			tv_index = tarval_div(tv, sz);
			tv       = tarval_mod(tv, sz);

			if (tv_index == tarval_bad || tv == tarval_bad)
				return NULL;

			assert(get_array_n_dimensions(tp) == 1 && "multiarrays not implemented");
			bound  = get_array_lower_bound(tp, 0);
			tlower = computed_value(bound);
			bound  = get_array_upper_bound(tp, 0);
			tupper = computed_value(bound);

			if (tlower == tarval_bad || tupper == tarval_bad)
				return NULL;

			if (tarval_cmp(tv_index, tlower) & pn_Cmp_Lt)
				return NULL;
			if (tarval_cmp(tupper, tv_index) & pn_Cmp_Lt)
				return NULL;

			/* ok, bounds check finished */
			index = get_tarval_long(tv_index);
			p[pos].index = index;
			++pos;
		}
		if (! tarval_is_null(tv)) {
			/* hmm, wrong access */
668
			return NULL;
669
670
671
672
673
674
		}
		p[pos - 1].next = next;
		return rec_find_compound_ent_value(ptr, p);
	} else if (is_Sub(ptr)) {
		ir_node *l = get_Sub_left(ptr);
		ir_node *r = get_Sub_right(ptr);
675

676
677
678
679
		ptr = l;
		tv  = get_Const_tarval(r);
		tv  = tarval_neg(tv);
		goto ptr_arith;
680
	}
681
	return NULL;
682
683
684
685
686
687
}

static ir_node *find_compound_ent_value(ir_node *ptr) {
	return rec_find_compound_ent_value(ptr, NULL);
}

688
689
690
691
/* forward */
static void reduce_adr_usage(ir_node *ptr);

/**
Christoph Mallon's avatar
Christoph Mallon committed
692
 * Update a Load that may have lost its users.
693
694
 */
static void handle_load_update(ir_node *load) {
695
	ldst_info_t *info = get_irn_link(load);
696

697
698
699
	/* do NOT touch volatile loads for now */
	if (get_Load_volatility(load) == volatility_is_volatile)
		return;
700

701
702
703
	if (! info->projs[pn_Load_res] && ! info->projs[pn_Load_X_except]) {
		ir_node *ptr = get_Load_ptr(load);
		ir_node *mem = get_Load_mem(load);
704

Christoph Mallon's avatar
Christoph Mallon committed
705
		/* a Load whose value is neither used nor exception checked, remove it */
706
		exchange(info->projs[pn_Load_M], mem);
707
708
		if (info->projs[pn_Load_X_regular])
			exchange(info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
709
		kill_node(load);
710
711
712
		reduce_adr_usage(ptr);
	}
}  /* handle_load_update */
713
714

/**
Christoph Mallon's avatar
Christoph Mallon committed
715
 * A use of an address node has vanished. Check if this was a Proj
716
717
718
 * node and update the counters.
 */
static void reduce_adr_usage(ir_node *ptr) {
719
720
721
722
723
724
725
726
727
	if (is_Proj(ptr)) {
		if (get_irn_n_edges(ptr) <= 0) {
			/* this Proj is dead now */
			ir_node *pred = get_Proj_pred(ptr);

			if (is_Load(pred)) {
				ldst_info_t *info = get_irn_link(pred);
				info->projs[get_Proj_proj(ptr)] = NULL;

Christoph Mallon's avatar
Christoph Mallon committed
728
				/* this node lost its result proj, handle that */
729
730
731
732
733
				handle_load_update(pred);
			}
		}
	}
}  /* reduce_adr_usage */
734

735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
/**
 * Check, if an already existing value of mode old_mode can be converted
 * into the needed one new_mode without loss.
 */
static int can_use_stored_value(ir_mode *old_mode, ir_mode *new_mode) {
	if (old_mode == new_mode)
		return 1;

	/* if both modes are two-complement ones, we can always convert the
	   Stored value into the needed one. */
	if (get_mode_size_bits(old_mode) >= get_mode_size_bits(new_mode) &&
		  get_mode_arithmetic(old_mode) == irma_twos_complement &&
		  get_mode_arithmetic(new_mode) == irma_twos_complement)
		return 1;
	return 0;
}  /* can_use_stored_value */

Michael Beck's avatar
Michael Beck committed
752
/**
753
754
755
756
757
758
759
760
761
762
763
 * Check whether a Call is at least pure, ie. does only read memory.
 */
static unsigned is_Call_pure(ir_node *call) {
	ir_type *call_tp = get_Call_type(call);
	unsigned prop = get_method_additional_properties(call_tp);

	/* check first the call type */
	if ((prop & (mtp_property_const|mtp_property_pure)) == 0) {
		/* try the called entity */
		ir_node *ptr = get_Call_ptr(call);

764
765
		if (is_Global(ptr)) {
			ir_entity *ent = get_Global_entity(ptr);
766
767
768
769
770
771
772

			prop = get_entity_additional_properties(ent);
		}
	}
	return (prop & (mtp_property_const|mtp_property_pure)) != 0;
}  /* is_Call_pure */

Michael Beck's avatar
Michael Beck committed
773
static ir_node *get_base_and_offset(ir_node *ptr, long *pOffset)
774
{
Michael Beck's avatar
Michael Beck committed
775
776
	ir_mode *mode  = get_irn_mode(ptr);
	long    offset = 0;
777
778

	/* TODO: long might not be enough, we should probably use some tarval thingy... */
Michael Beck's avatar
Michael Beck committed
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
	for (;;) {
		if (is_Add(ptr)) {
			ir_node *l = get_Add_left(ptr);
			ir_node *r = get_Add_right(ptr);

			if (get_irn_mode(l) != mode || !is_Const(r))
				break;

			offset += get_tarval_long(get_Const_tarval(r));
			ptr     = l;
		} else if (is_Sub(ptr)) {
			ir_node *l = get_Sub_left(ptr);
			ir_node *r = get_Sub_right(ptr);

			if (get_irn_mode(l) != mode || !is_Const(r))
				break;

			offset -= get_tarval_long(get_Const_tarval(r));
			ptr     = l;
		} else if (is_Sel(ptr)) {
			ir_entity *ent = get_Sel_entity(ptr);
			ir_type   *tp  = get_entity_owner(ent);

			if (is_Array_type(tp)) {
				int     size;
				ir_node *index;

				/* only one dimensional arrays yet */
				if (get_Sel_n_indexs(ptr) != 1)
					break;
				index = get_Sel_index(ptr, 0);
				if (! is_Const(index))
					break;

				tp = get_entity_type(ent);
				if (get_type_state(tp) != layout_fixed)
					break;

				size    = get_type_size_bytes(tp);
				offset += size * get_tarval_long(get_Const_tarval(index));
			} else {
				if (get_type_state(tp) != layout_fixed)
					break;
				offset += get_entity_offset(ent);
			}
			ptr = get_Sel_ptr(ptr);
		} else
826
827
828
			break;
	}

Michael Beck's avatar
Michael Beck committed
829
830
	*pOffset = offset;
	return ptr;
831
832
}

Michael Beck's avatar
Michael Beck committed
833
static int try_load_after_store(ir_node *load,
834
835
836
837
		ir_node *load_base_ptr, long load_offset, ir_node *store)
{
	ldst_info_t *info;
	ir_node *store_ptr      = get_Store_ptr(store);
Michael Beck's avatar
Michael Beck committed
838
839
	long     store_offset;
	ir_node *store_base_ptr = get_base_and_offset(store_ptr, &store_offset);
840
841
842
843
844
845
846
847
848
849
850
851
	ir_node *store_value;
	ir_mode *store_mode;
	ir_node *load_ptr;
	ir_mode *load_mode;
	long     load_mode_len;
	long     store_mode_len;
	long     delta;
	int      res;

	if (load_base_ptr != store_base_ptr)
		return 0;

Michael Beck's avatar
Michael Beck committed
852
853
	load_mode      = get_Load_mode(load);
	load_mode_len  = get_mode_size_bytes(load_mode);
854
855
	store_mode     = get_irn_mode(get_Store_value(store));
	store_mode_len = get_mode_size_bytes(store_mode);
Michael Beck's avatar
Michael Beck committed
856
	delta          = load_offset - store_offset;
857
	store_value    = get_Store_value(store);
858

859
860
861
	if (delta != 0 || store_mode != load_mode) {
		if (delta < 0 || delta + load_mode_len > store_mode_len)
			return 0;
862

863
864
865
		if (get_mode_arithmetic(store_mode) != irma_twos_complement ||
			get_mode_arithmetic(load_mode)  != irma_twos_complement)
			return 0;
866

Michael Beck's avatar
Michael Beck committed
867

868
869
870
		/* produce a shift to adjust offset delta */
		if (delta > 0) {
			ir_node *cnst;
871

872
873
874
875
876
877
878
879
880
			/* FIXME: only true for little endian */
			cnst        = new_Const_long(mode_Iu, delta * 8);
			store_value = new_r_Shr(current_ir_graph, get_nodes_block(load),
									store_value, cnst, store_mode);
		}

		/* add an convert if needed */
		if (store_mode != load_mode) {
			store_value = new_r_Conv(current_ir_graph, get_nodes_block(load),
Moritz Kroll's avatar
Moritz Kroll committed
881
									 store_value, load_mode);
882
		}
883
884
	}

Michael Beck's avatar
Michael Beck committed
885
886
	DBG_OPT_RAW(load, store_value);

887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
	info = get_irn_link(load);
	if (info->projs[pn_Load_M])
		exchange(info->projs[pn_Load_M], get_Load_mem(load));

	res = 0;
	/* no exception */
	if (info->projs[pn_Load_X_except]) {
		exchange( info->projs[pn_Load_X_except], new_Bad());
		res |= CF_CHANGED;
	}
	if (info->projs[pn_Load_X_regular]) {
		exchange( info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
		res |= CF_CHANGED;
	}

	if (info->projs[pn_Load_res])
		exchange(info->projs[pn_Load_res], store_value);

	load_ptr = get_Load_ptr(load);
	kill_node(load);
	reduce_adr_usage(load_ptr);
	return res | DF_CHANGED;
}

911
912
913
914
/**
 * Follow the memory chain as long as there are only Loads,
 * alias free Stores, and constant Calls and try to replace the
 * current Load by a previous ones.
Michael Beck's avatar
Michael Beck committed
915
916
917
918
919
920
 * Note that in unreachable loops it might happen that we reach
 * load again, as well as we can fall into a cycle.
 * We break such cycles using a special visited flag.
 *
 * INC_MASTER() must be called before dive into
 */
921
static unsigned follow_Mem_chain(ir_node *load, ir_node *curr) {
Michael Beck's avatar
Michael Beck committed
922
	unsigned    res = 0;
923
	ldst_info_t *info = get_irn_link(load);
Michael Beck's avatar
Michael Beck committed
924
925
926
927
	ir_node     *pred;
	ir_node     *ptr       = get_Load_ptr(load);
	ir_node     *mem       = get_Load_mem(load);
	ir_mode     *load_mode = get_Load_mode(load);
928
929
930
931
932

	for (pred = curr; load != pred; ) {
		ldst_info_t *pred_info = get_irn_link(pred);

		/*
933
934
935
936
937
938
939
940
941
942
943
		 * a Load immediately after a Store -- a read after write.
		 * We may remove the Load, if both Load & Store does not have an
		 * exception handler OR they are in the same MacroBlock. In the latter
		 * case the Load cannot throw an exception when the previous Store was
		 * quiet.
		 *
		 * Why we need to check for Store Exception? If the Store cannot
		 * be executed (ROM) the exception handler might simply jump into
		 * the load MacroBlock :-(
		 * We could make it a little bit better if we would know that the
		 * exception handler of the Store jumps directly to the end...
944
		 */
945
946
947
948
		if (is_Store(pred) && ((pred_info->projs[pn_Store_X_except] == NULL
				&& info->projs[pn_Load_X_except] == NULL)
				|| get_nodes_MacroBlock(load) == get_nodes_MacroBlock(pred)))
		{
Michael Beck's avatar
Michael Beck committed
949
950
951
952
953
			long    load_offset;
			ir_node *base_ptr = get_base_and_offset(ptr, &load_offset);
			int     changes   = try_load_after_store(load, base_ptr, load_offset, pred);

			if (changes != 0)
954
				return res | changes;
955
		} else if (is_Load(pred) && get_Load_ptr(pred) == ptr &&
956
		           can_use_stored_value(get_Load_mode(pred), load_mode)) {
957
958
959
			/*
			 * a Load after a Load -- a read after read.
			 * We may remove the second Load, if it does not have an exception handler
960
			 * OR they are in the same MacroBlock. In the later case the Load cannot
961
962
963
964
965
			 * throw an exception when the previous Load was quiet.
			 *
			 * Here, there is no need to check if the previous Load has an exception
			 * hander because they would have exact the same exception...
			 */
966
			if (info->projs[pn_Load_X_except] == NULL || get_nodes_MacroBlock(load) == get_nodes_MacroBlock(pred)) {
967
968
				ir_node *value;

969
970
				DBG_OPT_RAR(load, pred);

971
972
973
974
975
976
977
				/* the result is used */
				if (info->projs[pn_Load_res]) {
					if (pred_info->projs[pn_Load_res] == NULL) {
						/* create a new Proj again */
						pred_info->projs[pn_Load_res] = new_r_Proj(current_ir_graph, get_nodes_block(pred), pred, get_Load_mode(pred), pn_Load_res);
					}
					value = pred_info->projs[pn_Load_res];
978
979
980

					/* add an convert if needed */
					if (get_Load_mode(pred) != load_mode) {
Moritz Kroll's avatar
Moritz Kroll committed
981
						value = new_r_Conv(current_ir_graph, get_nodes_block(load), value, load_mode);
982
983
					}

984
					exchange(info->projs[pn_Load_res], value);
985
986
				}

987
988
989
				if (info->projs[pn_Load_M])
					exchange(info->projs[pn_Load_M], mem);

990
991
992
993
994
				/* no exception */
				if (info->projs[pn_Load_X_except]) {
					exchange(info->projs[pn_Load_X_except], new_Bad());
					res |= CF_CHANGED;
				}
995
996
997
998
				if (info->projs[pn_Load_X_regular]) {
					exchange( info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
					res |= CF_CHANGED;
				}
999

1000
				kill_node(load);
1001
1002
1003
1004
1005
				reduce_adr_usage(ptr);
				return res |= DF_CHANGED;
			}
		}

1006
		if (is_Store(pred)) {
1007
			/* check if we can pass through this store */
1008
1009
1010
1011
			ir_alias_relation rel = get_alias_relation(
				current_ir_graph,
				get_Store_ptr(pred),
				get_irn_mode(get_Store_value(pred)),
1012
				ptr, load_mode);
1013
			/* if the might be an alias, we cannot pass this Store */
Michael Beck's avatar
Michael Beck committed
1014
			if (rel != ir_no_alias)
1015
1016
				break;
			pred = skip_Proj(get_Store_mem(pred));
1017
		} else if (is_Load(pred)) {
1018
			pred = skip_Proj(get_Load_mem(pred));
1019
1020
1021
1022
1023
1024
1025
1026
1027
		} else if (is_Call(pred)) {
			if (is_Call_pure(pred)) {
				/* The called graph is at least pure, so there are no Store's
				   in it. We can handle it like a Load and skip it. */
				pred = skip_Proj(get_Call_mem(pred));
			} else {
				/* there might be Store's in the graph, stop here */
				break;
			}
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
		} else {
			/* follow only Load chains */
			break;
		}

		/* check for cycles */
		if (NODE_VISITED(pred_info))
			break;
		MARK_NODE(pred_info);
	}

1039
	if (is_Sync(pred)) {
1040
1041
1042
1043
1044
1045
		int i;

		/* handle all Sync predecessors */
		for (i = get_Sync_n_preds(pred) - 1; i >= 0; --i) {
			res |= follow_Mem_chain(load, skip_Proj(get_Sync_pred(pred, i)));
			if (res)
1046
				return res;
1047
1048
1049
1050
1051
		}
	}

	return res;
}  /* follow_Mem_chain */
Michael Beck's avatar
Michael Beck committed
1052

Michael Beck's avatar
Michael Beck committed
1053
/*
1054
1055
1056
 * Check if we can replace the load by a given const from
 * the const code irg.
 */
Michael Beck's avatar
Michael Beck committed
1057
ir_node *can_replace_load_by_const(const ir_node *load, ir_node *c) {
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
	ir_mode *c_mode = get_irn_mode(c);
	ir_mode *l_mode = get_Load_mode(load);
	ir_node *res    = NULL;

	if (c_mode != l_mode) {
		/* check, if the mode matches OR can be easily converted info */
		if (is_reinterpret_cast(c_mode, l_mode)) {
			/* we can safely cast */
			dbg_info *dbg   = get_irn_dbg_info(load);
			ir_node  *block = get_nodes_block(load);

			/* copy the value from the const code irg and cast it */
			res = copy_const_value(dbg, c);
Moritz Kroll's avatar
Moritz Kroll committed
1071
			res = new_rd_Conv(dbg, current_ir_graph, block, res, l_mode);
1072
1073
1074
1075
1076
1077
1078
1079
		}
	} else {
		/* copy the value from the const code irg */
		res = copy_const_value(get_irn_dbg_info(load), c);
	}
	return res;
}  /* can_replace_load_by_const */

Michael Beck's avatar
Michael Beck committed
1080
1081
/**
 * optimize a Load
1082
1083
 *
 * @param load  the Load node
Michael Beck's avatar
Michael Beck committed
1084
 */
1085
static unsigned optimize_load(ir_node *load)
Michael Beck's avatar
Michael Beck committed
1086
{
1087
	ldst_info_t *info = get_irn_link(load);
Michael Beck's avatar
Michael Beck committed
1088
1089
1090
1091
	ir_node     *mem, *ptr, *value;
	ir_entity   *ent;
	long        dummy;
	unsigned    res = 0;
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108

	/* do NOT touch volatile loads for now */
	if (get_Load_volatility(load) == volatility_is_volatile)
		return 0;

	/* the address of the load to be optimized */
	ptr = get_Load_ptr(load);

	/*
	 * Check if we can remove the exception from a Load:
	 * This can be done, if the address is from an Sel(Alloc) and
	 * the Sel type is a subtype of the allocated type.
	 *
	 * This optimizes some often used OO constructs,
	 * like x = new O; x->t;
	 */
	if (info->projs[pn_Load_X_except]) {
Michael Beck's avatar
Michael Beck committed
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
		ir_node *addr = ptr;

		/* find base address */
		while (is_Sel(addr))
			addr = get_Sel_ptr(addr);
		if (is_Alloc(skip_Proj(skip_Cast(addr)))) {
			/* simple case: a direct load after an Alloc. Firm Alloc throw
			 * an exception in case of out-of-memory. So, there is no way for an
			 * exception in this load.
			 * This code is constructed by the "exception lowering" in the Jack compiler.
			 */
			exchange(info->projs[pn_Load_X_except], new_Bad());
			info->projs[pn_Load_X_except] = NULL;
			exchange(info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
			info->projs[pn_Load_X_regular] = NULL;
			res |= CF_CHANGED;
1125
1126
1127
1128
		}
	}

	/* The mem of the Load. Must still be returned after optimization. */
Christoph Mallon's avatar
Christoph Mallon committed
1129
	mem = get_Load_mem(load);
1130
1131
1132
1133
1134

	if (! info->projs[pn_Load_res] && ! info->projs[pn_Load_X_except]) {
		/* a Load which value is neither used nor exception checked, remove it */
		exchange(info->projs[pn_Load_M], mem);

1135
1136
1137
1138
1139
		if (info->projs[pn_Load_X_regular]) {
			/* should not happen, but if it does, remove it */
			exchange(info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
			res |= CF_CHANGED;
		}
1140
		kill_node(load);
1141
1142
1143
1144
1145
1146
		reduce_adr_usage(ptr);
		return res | DF_CHANGED;
	}

	/* Load from a constant polymorphic field, where we can resolve
	   polymorphism. */
Michael Beck's avatar
Michael Beck committed
1147
	value = transform_polymorph_Load(load);
1148
1149
	if (value == load) {
		value = NULL;
Michael Beck's avatar
Michael Beck committed
1150
1151
		/* check if we can determine the entity that will be loaded */
		ent = find_constant_entity(ptr);
Christoph Mallon's avatar
Christoph Mallon committed
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
		if (ent != NULL                                     &&
		    allocation_static == get_entity_allocation(ent) &&
		    visibility_external_allocated != get_entity_visibility(ent)) {
			/* a static allocation that is not external: there should be NO exception
			 * when loading even if we cannot replace the load itself. */

			/* no exception, clear the info field as it might be checked later again */
			if (info->projs[pn_Load_X_except]) {
				exchange(info->projs[pn_Load_X_except], new_Bad());
				info->projs[pn_Load_X_except] = NULL;
				res |= CF_CHANGED;
			}
			if (info->projs[pn_Load_X_regular]) {
				exchange(info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
				info->projs[pn_Load_X_regular] = NULL;
				res |= CF_CHANGED;
			}
Michael Beck's avatar
Michael Beck committed
1169

Christoph Mallon's avatar
Christoph Mallon committed
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
			if (variability_constant == get_entity_variability(ent)) {
				if (is_atomic_entity(ent)) {
					/* Might not be atomic after lowering of Sels.  In this case we
					 * could also load, but it's more complicated. */
					/* more simpler case: we load the content of a constant value:
					 * replace it by the constant itself */
					value = get_atomic_ent_value(ent);
				} else if (ent->has_initializer) {
					/* new style initializer */
					value = find_compound_ent_value(ptr);
				} else {
					/* old style initializer */
					compound_graph_path *path = get_accessed_path(ptr);

					if (path != NULL) {
						assert(is_proper_compound_graph_path(path, get_compound_graph_path_length(path)-1));

						value = get_compound_ent_value_by_path(ent, path);
						DB((dbg, LEVEL_1, "  Constant access at %F%F resulted in %+F\n", ent, path, value));
						free_compound_graph_path(path);
Michael Beck's avatar
Michael Beck committed
1190
1191
					}
				}
Christoph Mallon's avatar
Christoph Mallon committed
1192
1193
				if (value != NULL)
					value = can_replace_load_by_const(load, value);
Michael Beck's avatar
Michael Beck committed
1194
			}
1195
		}
Michael Beck's avatar
Michael Beck committed
1196
1197
1198
	}
	if (value != NULL) {
		/* we completely replace the load by this value */
1199
1200
1201
		if (info->projs[pn_Load_X_except]) {
			exchange(info->projs[pn_Load_X_except], new_Bad());
			info->projs[pn_Load_X_except] = NULL;
1202
1203
1204
1205
1206
1207
			res |= CF_CHANGED;
		}
		if (info->projs[pn_Load_X_regular]) {
			exchange(info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
			info->projs[pn_Load_X_regular] = NULL;
			res |= CF_CHANGED;
1208
		}
Michael Beck's avatar
Michael Beck committed
1209
1210
1211
1212
1213
1214
1215
1216
		if (info->projs[pn_Load_M]) {
			exchange(info->projs[pn_Load_M], mem);
			res |= DF_CHANGED;
		}
		if (info->projs[pn_Load_res]) {
			exchange(info->projs[pn_Load_res], value);
			res |= DF_CHANGED;
		}
1217
		kill_node(load);
1218
		reduce_adr_usage(ptr);
Michael Beck's avatar
Michael Beck committed
1219
		return res;
1220
1221
1222
	}

	/* Check, if the address of this load is used more than once.
Michael Beck's avatar
Michael Beck committed
1223
1224
	 * If not, more load cannot be removed in any case. */
	if (get_irn_n_uses(ptr) <= 1 && get_irn_n_uses(get_base_and_offset(ptr, &dummy)) <= 1)
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
		return res;

	/*
	 * follow the memory chain as long as there are only Loads
	 * and try to replace current Load or Store by a previous one.
	 * Note that in unreachable loops it might happen that we reach
	 * load again, as well as we can fall into a cycle.
	 * We break such cycles using a special visited flag.
	 */
	INC_MASTER();
	res = follow_Mem_chain(load, skip_Proj(mem));
	return res;
}  /* optimize_load */
Michael Beck's avatar
Michael Beck committed
1238

1239
1240
1241
1242
1243
1244
1245
1246
1247
/**
 * Check whether a value of mode new_mode would completely overwrite a value
 * of mode old_mode in memory.
 */
static int is_completely_overwritten(ir_mode *old_mode, ir_mode *new_mode)
{
	return get_mode_size_bits(new_mode) >= get_mode_size_bits(old_mode);
}  /* is_completely_overwritten */

1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
/**
 * Check whether small is a part of large (starting at same address).
 */
static int is_partially_same(ir_node *small, ir_node *large)
{
	ir_mode *sm = get_irn_mode(small);
	ir_mode *lm = get_irn_mode(large);

	/* FIXME: Check endianness */
	return is_Conv(small) && get_Conv_op(small) == large
	    && get_mode_size_bytes(sm) < get_mode_size_bytes(lm)
	    && get_mode_arithmetic(sm) == irma_twos_complement
1260
	    && get_mode_arithmetic(lm) == irma_twos_complement;
1261
1262
}  /* is_partially_same */

Michael Beck's avatar
Michael Beck committed
1263
/**
1264
 * follow the memory chain as long as there are only Loads and alias free Stores.
Michael Beck's avatar
Michael Beck committed