ldstopt.c 56.7 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
 */
Michael Beck's avatar
Michael Beck committed
26
27
28
29
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif

30
#include <string.h>
31
#include <stdbool.h>
Michael Beck's avatar
Michael Beck committed
32

33
#include "iroptimize.h"
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#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"
#include "array.h"
#include "irhooks.h"
Michael Beck's avatar
BugFix:    
Michael Beck committed
48
#include "iredges.h"
49
50
#include "irtools.h"
#include "opt_polymorphy.h"
51
#include "irmemory.h"
52
#include "xmalloc.h"
53
54
55
56
57
58
#include "irphase_t.h"
#include "irgopt.h"
#include "debug.h"

/** The debug handle. */
DEBUG_ONLY(static firm_dbg_module_t *dbg;)
59
60
61
62

#ifdef DO_CACHEOPT
#include "cacheopt/cachesim.h"
#endif
Michael Beck's avatar
Michael Beck committed
63
64
65
66

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

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

69
enum changes_t {
70
71
	DF_CHANGED = 1,       /**< data flow changed */
	CF_CHANGED = 2,       /**< control flow changed */
72
73
};

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

82
/** A Load/Store info. */
Michael Beck's avatar
Michael Beck committed
83
typedef struct _ldst_info_t {
84
85
86
87
	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
88
89
} ldst_info_t;

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

/**
99
 * a Block info.
100
101
 */
typedef struct _block_info_t {
102
	unsigned flags;               /**< flags for the block */
103
104
} block_info_t;

105
106
107
108
109
110
111
/** 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
112
113
114
/**
 * get the Load/Store info of a node
 */
115
static ldst_info_t *get_ldst_info(ir_node *node, struct obstack *obst) {
116
	ldst_info_t *info = get_irn_link(node);
Michael Beck's avatar
Michael Beck committed
117

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

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

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

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

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

149
150
151
152
153
154
155
156
157
158
	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
159
160

/**
161
162
163
164
165
 * 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
166
 */
167
static unsigned update_exc(ldst_info_t *info, ir_node *block, int pos)
Michael Beck's avatar
Michael Beck committed
168
{
169
	assert(info->exc_block == NULL && "more than one exception block found");
Michael Beck's avatar
Michael Beck committed
170

171
172
173
174
	info->exc_block = block;
	info->exc_idx   = pos;
	return 0;
}  /* update_exc */
Michael Beck's avatar
Michael Beck committed
175

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

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

191
192
193
	if (opcode == iro_Proj) {
		pred   = get_Proj_pred(node);
		opcode = get_irn_opcode(pred);
194

195
		if (opcode == iro_Load || opcode == iro_Store || opcode == iro_Call) {
196
			ldst_info = get_ldst_info(pred, &wenv->obst);
197
198
199
200

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

			/*
201
202
203
204
205
			 * 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.
			 */
206
207
208
209
210
211
212
			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);
			}
		}
213
	} else if (opcode == iro_Block) {
214
215
216
		int i;

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

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

223
224
225
226
			if (is_Proj(proj)) {
				pred   = get_Proj_pred(proj);
				is_exc = get_Proj_proj(proj) == pn_Generic_X_except;
			}
227
228
229
230
231
232

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

			pred_block = get_nodes_block(pred);
233
			bl_info    = get_block_info(pred_block, &wenv->obst);
234

235
			if (is_fragile_op(pred) && is_exc)
236
237
238
239
				bl_info->flags |= BLOCK_HAS_EXC;
			else if (is_irn_forking(pred))
				bl_info->flags |= BLOCK_HAS_COND;

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

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

Michael Beck's avatar
Michael Beck committed
250
/**
251
 * Returns an entity if the address ptr points to a constant one.
252
253
254
255
 *
 * @param ptr  the address
 *
 * @return an entity or NULL
Michael Beck's avatar
Michael Beck committed
256
 */
257
static ir_entity *find_constant_entity(ir_node *ptr)
Michael Beck's avatar
Michael Beck committed
258
{
259
	for (;;) {
260
		if (is_SymConst(ptr) && get_SymConst_kind(ptr) == symconst_addr_ent) {
261
262
263
264
			ir_entity *ent = get_SymConst_entity(ptr);
			if (variability_constant == get_entity_variability(ent))
				return ent;
			return NULL;
265
		} else if (is_Sel(ptr)) {
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
305
306
307
308
309
310
			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);
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
		} 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;
336
337
338
339
		} else
			return NULL;
	}
}  /* find_constant_entity */
Michael Beck's avatar
Michael Beck committed
340

Michael Beck's avatar
Michael Beck committed
341
342
343
/**
 * Return the Selection index of a Sel node from dimension n
 */
344
static long get_Sel_array_index_long(ir_node *n, int dim) {
345
	ir_node *index = get_Sel_index(n, dim);
Michael Beck's avatar
Michael Beck committed
346
	assert(is_Const(index));
347
348
	return get_tarval_long(get_Const_tarval(index));
}  /* get_Sel_array_index_long */
349

Michael Beck's avatar
Michael Beck committed
350
351
352
353
354
355
356
357
/**
 * 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
358
static compound_graph_path *rec_get_accessed_path(ir_node *ptr, int depth) {
359
	compound_graph_path *res = NULL;
360
361
362
363
	ir_entity           *root, *field, *ent;
	int                 path_len, pos, idx;
	tarval              *tv;
	ir_type             *tp;
364

365
	if (is_SymConst(ptr)) {
366
367
368
369
370
371
372
		/* 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
		 * at least it's length.
		 */
		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);
373
	} else if (is_Sel(ptr)) {
374
375
		/* it's a Sel, go up until we find the root */
		res = rec_get_accessed_path(get_Sel_ptr(ptr), depth+1);
376
377
		if (res == NULL)
			return NULL;
378
379
380
381
382
383
384
385
386
387
388

		/* 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));
		}
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
	} else if (is_Add(ptr)) {
		ir_node *l = get_Add_left(ptr);
		ir_node *r = get_Add_right(ptr);
		ir_mode *mode;

		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);

		/* 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;;) {
412
413
414
415
			unsigned size;
			tarval   *sz, *tv_index, *tlower, *tupper;
			ir_node  *bound;

416
417
418
419
			tp = get_entity_type(ent);
			if (! is_Array_type(tp))
				break;
			ent = get_array_element_entity(tp);
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
			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 */
444
445
			++idx;
		}
446
447
448
449
450
		if (! tarval_is_null(tv)) {
			/* access to some struct/union member */
			return NULL;
		}

451
452
453
454
455
456
457
458
459
460
461
462
463
		/* 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;
464
			tarval   *sz, *tv_index;
465
466
467
468
469
470
471
472
473
474
475
476
477
478
			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
479
480
			/* worked above, should work again */
			assert(tv_index != tarval_bad && tv != tarval_bad);
481

482
			/* bounds already checked above */
483
484
485
486
487
488
489
490
491
492
493
494
			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;
495
496
497
	}
	return res;
}  /* rec_get_accessed_path */
498

499
500
501
/**
 * 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
502
 */
Götz Lindenmaier's avatar
bugfix    
Götz Lindenmaier committed
503
static compound_graph_path *get_accessed_path(ir_node *ptr) {
504
505
	return rec_get_accessed_path(ptr, 0);
}  /* get_accessed_path */
506

507
508
509
510
511
512
513
514
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;
515
	ir_entity        *ent, *field;
516
	ir_initializer_t *initializer;
517
518
	tarval           *tv;
	ir_type          *tp;
519
	unsigned         n;
520

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

532
533
534
535
536
537
538
539
540
541
			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;
				}
			}
542
543
544
			if (p->index >= n)
				return NULL;
			initializer = get_initializer_compound_value(initializer, p->index);
545
546
547
548
549
550
551
552
553
554
555
556
557

			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);
558
		}
559

560
561
562
563
564
565
566
567
568
		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)) {
569
570
571
572
		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");
573
			entry.index = get_Sel_array_index_long(ptr, 0) - get_array_lower_bound_int(tp, 0);
574
575
576
577
578
579
580
581
582
583
584
585
586
		} 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);
587
588
589
590
591
	}  else if (is_Add(ptr)) {
		ir_node  *l = get_Add_left(ptr);
		ir_node  *r = get_Add_right(ptr);
		ir_mode  *mode;
		unsigned pos;
592

593
594
595
596
597
598
599
600
601
		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);
602

603
604
605
606
607
608
		/* 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);
		}
609

610
611
612
613
614
615
616
617
618
619
620
		/* 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)
621
622
			return NULL;

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
668
669
670
		/* 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 */
671
			return NULL;
672
673
674
675
676
677
		}
		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);
678

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

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

691
692
693
694
695
696
697
/* forward */
static void reduce_adr_usage(ir_node *ptr);

/**
 * Update a Load that may lost it's usage.
 */
static void handle_load_update(ir_node *load) {
698
	ldst_info_t *info = get_irn_link(load);
699

700
701
702
	/* do NOT touch volatile loads for now */
	if (get_Load_volatility(load) == volatility_is_volatile)
		return;
703

704
705
706
	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);
707

708
709
		/* a Load which value is neither used nor exception checked, remove it */
		exchange(info->projs[pn_Load_M], mem);
710
711
		if (info->projs[pn_Load_X_regular])
			exchange(info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
712
		kill_node(load);
713
714
715
		reduce_adr_usage(ptr);
	}
}  /* handle_load_update */
716
717
718
719
720
721

/**
 * A Use of an address node is vanished. Check if this was a Proj
 * node and update the counters.
 */
static void reduce_adr_usage(ir_node *ptr) {
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
	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;

				/* this node lost it's result proj, handle that */
				handle_load_update(pred);
			}
		}
	}
}  /* reduce_adr_usage */
737

738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
/**
 * 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
755
/**
756
757
758
759
760
761
762
763
764
765
766
 * 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);

767
768
		if (is_Global(ptr)) {
			ir_entity *ent = get_Global_entity(ptr);
769
770
771
772
773
774
775

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

776
777
778
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
826
827
828
829
830
831
832
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
863
864
865
866
867
868
869
870
871
static ir_node *get_base_ptr(ir_node *ptr)
{
	while (is_Add(ptr) && is_Const(get_Add_right(ptr))) {
		ptr = get_Add_left(ptr);
	}

	return ptr;
}

static long get_base_offset(ir_node *ptr)
{
	/* TODO: long might not be enough, we should probably use some tarval thingy... */
	long offset = 0;
	while (is_Add(ptr)) {
		ir_node *right = get_Add_right(ptr);
		if (!is_Const(right))
			break;
		offset += get_tarval_long(get_Const_tarval(right));
		ptr = get_Add_left(ptr);
	}

	return offset;
}

static int try_load_store(ir_node *load,
		ir_node *load_base_ptr, long load_offset, ir_node *store)
{
	ldst_info_t *info;
	ir_node *store_ptr      = get_Store_ptr(store);
	ir_node *store_base_ptr = get_base_ptr(store_ptr);
	ir_node *store_value;
	ir_mode *store_mode;
	ir_node *load_ptr;
	ir_mode *load_mode;
	long     store_offset   = get_base_offset(store_ptr);
	long     load_mode_len;
	long     store_mode_len;
	long     delta;
	int      res;

	if (load_base_ptr != store_base_ptr)
		return 0;

	load_mode     = get_Load_mode(load);
	load_mode_len = get_mode_size_bytes(load_mode);
	store_mode     = get_irn_mode(get_Store_value(store));
	store_mode_len = get_mode_size_bytes(store_mode);

	delta         = load_offset - store_offset;
	if (delta < 0 || delta >= store_mode_len)
		return 0;

	if (store_mode_len - delta > load_mode_len)
		return 0;

	store_value = get_Store_value(store);
	DBG_OPT_RAW(load, store_value);

	/* produce a shift to adjust offset delta */
	if (delta > 0) {
		ir_node *cnst = new_r_Const_long(current_ir_graph,
				get_irg_start_block(current_ir_graph), 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),
		                         store_value, load_mode);
	}

	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;
}

872
873
874
875
/**
 * 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
876
877
878
879
880
881
 * 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
 */
882
883
884
885
886
887
888
static unsigned follow_Mem_chain(ir_node *load, ir_node *curr) {
	unsigned res = 0;
	ldst_info_t *info = get_irn_link(load);
	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);
889
890
	ir_node *base_ptr  = get_base_ptr(ptr);
	long     load_offset = get_base_offset(ptr);
891
892
893
894
895

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

		/*
896
897
898
899
900
901
902
903
904
905
906
		 * 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...
907
		 */
908
909
910
911
912
913
914
915
		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)))
		{
			int changes
				= try_load_store(load, base_ptr, load_offset, pred);
			if (changes != 0) {
				return res | changes;
916
			}
917
		} else if (is_Load(pred) && get_Load_ptr(pred) == ptr &&
918
		           can_use_stored_value(get_Load_mode(pred), load_mode)) {
919
920
921
			/*
			 * a Load after a Load -- a read after read.
			 * We may remove the second Load, if it does not have an exception handler
922
			 * OR they are in the same MacroBlock. In the later case the Load cannot
923
924
925
926
927
			 * 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...
			 */
928
			if (info->projs[pn_Load_X_except] == NULL || get_nodes_MacroBlock(load) == get_nodes_MacroBlock(pred)) {
929
930
				ir_node *value;

931
932
				DBG_OPT_RAR(load, pred);

933
934
935
936
937
938
939
				/* 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];
940
941
942
943
944
945

					/* add an convert if needed */
					if (get_Load_mode(pred) != load_mode) {
						value = new_r_Conv(current_ir_graph, get_nodes_block(load), value, load_mode);
					}

946
					exchange(info->projs[pn_Load_res], value);
947
948
				}

949
950
951
				if (info->projs[pn_Load_M])
					exchange(info->projs[pn_Load_M], mem);

952
953
954
955
956
				/* no exception */
				if (info->projs[pn_Load_X_except]) {
					exchange(info->projs[pn_Load_X_except], new_Bad());
					res |= CF_CHANGED;
				}
957
958
959
960
				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;
				}
961

962
				kill_node(load);
963
964
965
966
967
				reduce_adr_usage(ptr);
				return res |= DF_CHANGED;
			}
		}

968
		if (is_Store(pred)) {
969
			/* check if we can pass through this store */
970
971
972
973
			ir_alias_relation rel = get_alias_relation(
				current_ir_graph,
				get_Store_ptr(pred),
				get_irn_mode(get_Store_value(pred)),
974
				ptr, load_mode);
975
			/* if the might be an alias, we cannot pass this Store */
Michael Beck's avatar
Michael Beck committed
976
			if (rel != ir_no_alias)
977
978
				break;
			pred = skip_Proj(get_Store_mem(pred));
979
		} else if (is_Load(pred)) {
980
			pred = skip_Proj(get_Load_mem(pred));
981
982
983
984
985
986
987
988
989
		} 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;
			}
990
991
992
993
994
995
996
997
998
999
1000
		} else {
			/* follow only Load chains */
			break;
		}

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

1001
	if (is_Sync(pred)) {
1002
1003
1004
1005
1006
1007
		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)
1008
				return res;
1009
1010
1011
1012
1013
		}
	}

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

Michael Beck's avatar
Michael Beck committed
1015
/*
1016
1017
1018
 * Check if we can replace the load by a given const from
 * the const code irg.
 */
Michael Beck's avatar
Michael Beck committed
1019
ir_node *can_replace_load_by_const(const ir_node *load, ir_node *c) {
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
	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);
			res = new_rd_Conv(dbg, current_ir_graph, block, res, l_mode);
		}
	} 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
1042
1043
/**
 * optimize a Load
1044
1045
 *
 * @param load  the Load node
Michael Beck's avatar
Michael Beck committed
1046
 */
1047
static unsigned optimize_load(ir_node *load)
Michael Beck's avatar
Michael Beck committed
1048
{
1049
	ldst_info_t *info = get_irn_link(load);
Michael Beck's avatar
Michael Beck committed
1050
	ir_node *mem, *ptr, *value;
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
	ir_entity *ent;
	unsigned res = 0;

	/* 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
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
		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;
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
		}
	}

	/* The mem of the Load. Must still be returned after optimization. */
	mem  = get_Load_mem(load);

	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);

1096
1097
1098
1099
1100
		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;
		}
1101
		kill_node(load);
1102
1103
1104
1105
1106
1107
		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
1108
	value = transform_polymorph_Load(load);
1109
1110
	if (value == load) {
		value = NULL;
Michael Beck's avatar
Michael Beck committed
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
		/* check if we can determine the entity that will be loaded */
		ent = find_constant_entity(ptr);
		if (ent != NULL) {
			if ((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;
				}

				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);
								free_compound_graph_path(path);
							}
						}
					}
					if (value != NULL)
						value = can_replace_load_by_const(load, value);
				}
			}
1161
		}
Michael Beck's avatar
Michael Beck committed
1162
1163
1164
	}
	if (value != NULL) {
		/* we completely replace the load by this value */
1165
1166
1167
		if (info->projs[pn_Load_X_except]) {
			exchange(info->projs[pn_Load_X_except], new_Bad());
			info->projs[pn_Load_X_except] = NULL;
1168
1169
1170
1171
1172
1173
			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;
1174
		}
Michael Beck's avatar
Michael Beck committed
1175
1176
1177
1178
1179
1180
1181
1182
		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;
		}
1183
		kill_node(load);
1184
		reduce_adr_usage(ptr);
Michael Beck's avatar
Michael Beck committed
1185
		return res;
1186
1187
1188
1189
	}

	/* Check, if the address of this load is used more than once.
	 * If not, this load cannot be removed in any case. */
1190
	if (get_irn_n_uses(ptr) <= 1 && get_irn_n_uses(get_base_ptr(ptr)) <= 1)
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
		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
1204

1205
1206
1207
1208
1209
1210
1211
1212
1213
/**
 * 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 */

Michael Beck's avatar
Michael Beck committed
1214
/**
1215
 * follow the memory chain as long as there are only Loads and alias free Stores.
Michael Beck's avatar
Michael Beck committed
1216
1217
1218
 *
 * INC_MASTER() must be called before dive into
 */
1219
1220
1221
1222
1223
1224
1225
1226
1227
static unsigned follow_Mem_chain_for_Store(ir_node *store, ir_node *curr) {
	unsigned res = 0;
	ldst_info_t *info = get_irn_link(store);
	ir_node *pred;
	ir_node *ptr = get_Store_ptr(store);
	ir_node *mem = get_Store_mem(store);
	ir_node *value = get_Store_value(store);
	ir_mode *mode  = get_irn_mode(value);
	ir_node *block = get_nodes_block(store);
1228
	ir_node *mblk  = get_Block_MacroBlock(block);
1229
1230
1231
1232
1233
1234
1235
1236
1237

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

		/*
		 * BEWARE: one might think that checking the modes is useless, because
		 * if the pointers are identical, they refer to the same object.
		 * This is only true in strong typed languages, not is C were the following
		 * is possible *(ir_type1 *)p = a; *(ir_type2 *)p = b ...
1238
1239
		 * However, if the mode that is written have a bigger  or equal size the the old
		 * one, the old value is completely overwritten and can be killed ...
1240
		 */
1241
1242
		if (is_Store(pred) && get_Store_ptr(pred) == ptr &&
		    get_nodes_MacroBlock(pred) == mblk &&
1243
		    is_completely_overwritten(get_irn_mode(get_Store_value(pred)), mode)) {
1244
			/*
Michael Beck's avatar
Michael Beck committed
1245
			 * a Store after a Store in the same MacroBlock -- a write after write.
1246
1247
1248
1249
1250
1251
			 * We may remove the first Store, if it does not have an exception handler.
			 *
			 * TODO: What, if both have the same exception handler ???
			 */
			if (get_Store_volatility(pred) != volatility_is_volatile && !pred_info->projs[pn_Store_X_except]) {
				DBG_OPT_WAW(pred, store);
1252
				exchange(pred_info->projs[pn_Store_M], get_Store_mem(pred));
1253
				kill_node(pred);
1254
1255
1256
				reduce_adr_usage(ptr);
				return DF_CHANGED;
			}
1257
		} else if (is_Load(pred) && get_Load_ptr(pred) == ptr &&
1258
1259
		           value == pred_info->projs[pn_Load_res]) {
			/*
1260
1261
1262
1263
			 * a Store of a value just loaded from the same address
			 * -- a write after read.
			 * We may remove the Store, if it does not have an exception
			 * handler.
1264
1265
1266
			 */
			if (! info->projs[pn_Store_X_except]) {
				DBG_OPT_WAR(store, pred);
1267
				exchange(info->projs[pn_Store_M], mem);
1268
				kill_node(store);
1269
1270
1271
1272
1273
				reduce_adr_usage(ptr);
				return DF_CHANGED;
			}
		}

1274
		if (is_Store(pred)) {
Michael Beck's avatar
Michael Beck committed
1275
			/* check if we can pass through this store */
1276
1277
1278
1279
			ir_alias_relation rel = get_alias_relation(
				current_ir_graph,
				get_Store_ptr(pred),
				get_irn_mode(get_Store_value(pred)),
1280
				ptr, mode);
1281
			/* if the might be an alias, we cannot pass this Store */
Michael Beck's avatar
Michael Beck committed
1282
			if (rel != ir_no_alias)
1283
1284
				break;
			pred = skip_Proj(get_Store_mem(pred));
1285
		} else if (is_Load(pred)) {
1286
1287
1288
			ir_alias_relation rel = get_alias_relation(
				current_ir_graph, get_Load_ptr(pred), get_Load_mode(pred),
				ptr, mode);
Michael Beck's avatar
Michael Beck committed
1289
			if (rel != ir_no_alias)
1290
1291
				break;

1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
			pred = skip_Proj(get_Load_mem(pred));
		} else {
			/* follow only Load chains */
			break;
		}

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

1304
	if (is_Sync(pred)) {
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
		int i;

		/* handle all Sync predecessors */
		for (i = get_Sync_n_preds(pred) - 1; i >= 0; --i) {
			res |= follow_Mem_chain_for_Store(store, skip_Proj(get_Sync_pred(pred, i)));
			if (res)
				break;
		}
	}
	return res;
}  /* follow_Mem_chain_for_Store */
Michael Beck's avatar
Michael Beck committed
1316
1317
1318

/**
 * optimize a Store
1319
1320
 *
 * @param store  the Store node
Michael Beck's avatar
Michael Beck committed
1321
 */
1322
1323
static unsigned optimize_store(ir_node *store) {
	ir_node *ptr, *mem;
Michael Beck's avatar
Michael Beck committed
1324

1325
1326
	if (get_Store_volatility(store) == volatility_is_volatile)
		return 0;
Michael Beck's avatar
Michael Beck committed
1327

1328
	ptr = get_Store_ptr(store);
1329

1330
1331
1332
1333
	/* Check, if the address of this Store is used more than once.
	 * If not, this Store cannot be removed in any case. */
	if (get_irn_n_uses(ptr) <= 1)
		return 0;
1334

1335
	mem = get_Store_mem(store);
Michael Beck's avatar
Michael Beck committed
1336

1337
1338
	/* follow the memory chain as long as there are only Loads */
	INC_MASTER();
Michael Beck's avatar
Michael Beck committed
1339

1340
1341
	return follow_Mem_chain_for_Store(store, skip_Proj(mem));
}  /* optimize_store */
Michael Beck's avatar
Michael Beck committed
1342

Michael Beck's avatar
Michael Beck committed
1343
/**
1344
 * walker, optimizes Phi after Stores to identical places:
Michael Beck's avatar
Michael Beck committed
1345
 * Does the following optimization: