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

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

32
#include "iroptimize.h"
33
34
35
36
37
38
39
40
41
42
43
44
45
46
#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
47
#include "iredges.h"
48
49
#include "irtools.h"
#include "opt_polymorphy.h"
50
#include "irmemory.h"
51
#include "xmalloc.h"
52
53
54
55
56
57
#include "irphase_t.h"
#include "irgopt.h"
#include "debug.h"

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Michael Beck's avatar
Michael Beck committed
249
/**
250
 * Returns an entity if the address ptr points to a constant one.
251
252
253
254
 *
 * @param ptr  the address
 *
 * @return an entity or NULL
Michael Beck's avatar
Michael Beck committed
255
 */
256
static ir_entity *find_constant_entity(ir_node *ptr)
Michael Beck's avatar
Michael Beck committed
257
{
258
259
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
305
306
307
308
309
310
311
312
313
314
315
	for (;;) {
		ir_op *op = get_irn_op(ptr);

		if (op == op_SymConst && (get_SymConst_kind(ptr) == symconst_addr_ent)) {
			ir_entity *ent = get_SymConst_entity(ptr);
			if (variability_constant == get_entity_variability(ent))
				return ent;
			return NULL;
		} else if (op == op_Sel) {
			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);
		} else
			return NULL;
	}
}  /* find_constant_entity */
Michael Beck's avatar
Michael Beck committed
316

Michael Beck's avatar
Michael Beck committed
317
318
319
/**
 * Return the Selection index of a Sel node from dimension n
 */
320
static long get_Sel_array_index_long(ir_node *n, int dim) {
321
	ir_node *index = get_Sel_index(n, dim);
Michael Beck's avatar
Michael Beck committed
322
	assert(is_Const(index));
323
324
	return get_tarval_long(get_Const_tarval(index));
}  /* get_Sel_array_index_long */
325

Michael Beck's avatar
Michael Beck committed
326
327
328
329
330
331
332
333
/**
 * 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
334
static compound_graph_path *rec_get_accessed_path(ir_node *ptr, int depth) {
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
	compound_graph_path *res = NULL;
	ir_entity           *root, *field;
	int                 path_len, pos;

	if (get_irn_op(ptr) == op_SymConst) {
		/* 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);
	} else {
		assert(get_irn_op(ptr) == op_Sel);
		/* it's a Sel, go up until we find the root */
		res = rec_get_accessed_path(get_Sel_ptr(ptr), depth+1);

		/* 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));
		}
	}
	return res;
}  /* rec_get_accessed_path */
365

Götz Lindenmaier's avatar
bugfix    
Götz Lindenmaier committed
366
/** Returns an access path or NULL.  The access path is only
Michael Beck's avatar
Michael Beck committed
367
368
 *  valid, if the graph is in phase_high and _no_ address computation is used.
 */
Götz Lindenmaier's avatar
bugfix    
Götz Lindenmaier committed
369
static compound_graph_path *get_accessed_path(ir_node *ptr) {
370
371
	return rec_get_accessed_path(ptr, 0);
}  /* get_accessed_path */
372

373
374
375
376
377
378
379
/* 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) {
380
	ldst_info_t *info = get_irn_link(load);
381

382
383
384
	/* do NOT touch volatile loads for now */
	if (get_Load_volatility(load) == volatility_is_volatile)
		return;
385

386
387
388
	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);
389

390
391
		/* a Load which value is neither used nor exception checked, remove it */
		exchange(info->projs[pn_Load_M], mem);
392
393
		if (info->projs[pn_Load_X_regular])
			exchange(info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
394
		kill_node(load);
395
396
397
		reduce_adr_usage(ptr);
	}
}  /* handle_load_update */
398
399
400
401
402
403

/**
 * 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) {
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
	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 */
419

420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
/**
 * 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
437
/**
438
439
440
441
442
443
444
445
446
447
448
 * 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);

449
450
		if (is_Global(ptr)) {
			ir_entity *ent = get_Global_entity(ptr);
451
452
453
454
455
456
457
458
459
460
461

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

/**
 * 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
462
463
464
465
466
467
 * 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
 */
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
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);

	for (pred = curr; load != pred; ) {
		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 in C were the following
		 * is possible a = *(ir_type1 *)p; b = *(ir_type2 *)p ...
		 */
485
		if (is_Store(pred) && get_Store_ptr(pred) == ptr &&
486
		    can_use_stored_value(get_irn_mode(get_Store_value(pred)), load_mode)) {
487
488
489
			/*
			 * 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
490
			 * OR they are in the same MacroBlock. In the latter case the Load cannot
491
492
493
494
			 * 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
495
			 * the load MacroBlock :-(
496
497
498
			 * We could make it a little bit better if we would know that the exception
			 * handler of the Store jumps directly to the end...
			 */
499
			if ((pred_info->projs[pn_Store_X_except] == NULL && info->projs[pn_Load_X_except] == NULL) ||
500
			    get_nodes_MacroBlock(load) == get_nodes_MacroBlock(pred)) {
501
502
503
				ir_node *value = get_Store_value(pred);

				DBG_OPT_RAW(load, value);
504
505
506
507
508
509

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

510
511
512
513
514
515
516
517
				if (info->projs[pn_Load_M])
					exchange(info->projs[pn_Load_M], mem);

				/* no exception */
				if (info->projs[pn_Load_X_except]) {
					exchange( info->projs[pn_Load_X_except], new_Bad());
					res |= CF_CHANGED;
				}
518
519
520
521
				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;
				}
522
523
524
525

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

526
				kill_node(load);
527
528
529
				reduce_adr_usage(ptr);
				return res | DF_CHANGED;
			}
530
		} else if (is_Load(pred) && get_Load_ptr(pred) == ptr &&
531
		           can_use_stored_value(get_Load_mode(pred), load_mode)) {
532
533
534
			/*
			 * a Load after a Load -- a read after read.
			 * We may remove the second Load, if it does not have an exception handler
535
			 * OR they are in the same MacroBlock. In the later case the Load cannot
536
537
538
539
540
			 * 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...
			 */
541
			if (info->projs[pn_Load_X_except] == NULL || get_nodes_MacroBlock(load) == get_nodes_MacroBlock(pred)) {
542
543
				ir_node *value;

544
545
				DBG_OPT_RAR(load, pred);

546
547
548
549
550
551
552
				/* 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];
553
554
555
556
557
558

					/* 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);
					}

559
					exchange(info->projs[pn_Load_res], value);
560
561
				}

562
563
564
				if (info->projs[pn_Load_M])
					exchange(info->projs[pn_Load_M], mem);

565
566
567
568
569
				/* no exception */
				if (info->projs[pn_Load_X_except]) {
					exchange(info->projs[pn_Load_X_except], new_Bad());
					res |= CF_CHANGED;
				}
570
571
572
573
				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;
				}
574

575
				kill_node(load);
576
577
578
579
580
				reduce_adr_usage(ptr);
				return res |= DF_CHANGED;
			}
		}

581
		if (is_Store(pred)) {
582
			/* check if we can pass through this store */
583
584
585
586
			ir_alias_relation rel = get_alias_relation(
				current_ir_graph,
				get_Store_ptr(pred),
				get_irn_mode(get_Store_value(pred)),
587
				ptr, load_mode);
588
589
590
591
			/* if the might be an alias, we cannot pass this Store */
			if (rel != no_alias)
				break;
			pred = skip_Proj(get_Store_mem(pred));
592
		} else if (is_Load(pred)) {
593
			pred = skip_Proj(get_Load_mem(pred));
594
595
596
597
598
599
600
601
602
		} 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;
			}
603
604
605
606
607
608
609
610
611
612
613
		} else {
			/* follow only Load chains */
			break;
		}

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

614
	if (is_Sync(pred)) {
615
616
617
618
619
620
		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)
621
				return res;
622
623
624
625
626
		}
	}

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

Michael Beck's avatar
Michael Beck committed
628
629
/**
 * optimize a Load
630
631
 *
 * @param load  the Load node
Michael Beck's avatar
Michael Beck committed
632
 */
633
static unsigned optimize_load(ir_node *load)
Michael Beck's avatar
Michael Beck committed
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
	ldst_info_t *info = get_irn_link(load);
	ir_node *mem, *ptr, *new_node;
	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]) {
		if (is_Sel(ptr)) {
			ir_node *mem = get_Sel_mem(ptr);

			/* FIXME: works with the current FE, but better use the base */
660
			if (is_Alloc(skip_Proj(mem))) {
661
662
663
664
665
666
667
668
669
670
671
				/* ok, check the types */
				ir_entity *ent    = get_Sel_entity(ptr);
				ir_type   *s_type = get_entity_type(ent);
				ir_type   *a_type = get_Alloc_type(mem);

				if (is_SubClass_of(s_type, a_type)) {
					/* ok, condition met: there can't be an exception because
					* Alloc guarantees that enough memory was allocated */

					exchange(info->projs[pn_Load_X_except], new_Bad());
					info->projs[pn_Load_X_except] = NULL;
672
673
					exchange(info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
					info->projs[pn_Load_X_regular] = NULL;
674
675
676
					res |= CF_CHANGED;
				}
			}
677
		} else if (is_Alloc(skip_Proj(skip_Cast(ptr)))) {
678
679
680
681
682
683
684
				/* 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;
685
686
				exchange(info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
				info->projs[pn_Load_X_regular] = NULL;
687
688
689
690
691
692
693
694
695
696
697
				res |= CF_CHANGED;
		}
	}

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

698
699
700
701
702
		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;
		}
703
		kill_node(load);
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
		reduce_adr_usage(ptr);
		return res | DF_CHANGED;
	}

	/* Load from a constant polymorphic field, where we can resolve
	   polymorphism. */
	new_node = transform_node_Load(load);
	if (new_node != load) {
		if (info->projs[pn_Load_M]) {
			exchange(info->projs[pn_Load_M], mem);
			info->projs[pn_Load_M] = NULL;
		}
		if (info->projs[pn_Load_X_except]) {
			exchange(info->projs[pn_Load_X_except], new_Bad());
			info->projs[pn_Load_X_except] = NULL;
719
720
721
722
723
724
			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;
725
726
727
728
		}
		if (info->projs[pn_Load_res])
			exchange(info->projs[pn_Load_res], new_node);

729
		kill_node(load);
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
		reduce_adr_usage(ptr);
		return res | DF_CHANGED;
	}

	/* check if we can determine the entity that will be loaded */
	ent = find_constant_entity(ptr);
	if (ent) {
		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. */

			/* 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;
			}
748
749
750
751
752
			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;
			}
753

Michael Beck's avatar
Michael Beck committed
754
755
756
757
758
759
760
761
762
763
764
			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
					 */

					/* no memory */
765
766
767
768
					if (info->projs[pn_Load_M]) {
						exchange(info->projs[pn_Load_M], mem);
						res |= DF_CHANGED;
					}
Michael Beck's avatar
Michael Beck committed
769
					/* no result :-) */
770
					if (info->projs[pn_Load_res]) {
Michael Beck's avatar
Michael Beck committed
771
772
773
774
775
776
777
						if (is_atomic_entity(ent)) {
							ir_node *c = copy_const_value(get_irn_dbg_info(load), get_atomic_ent_value(ent));

							DBG_OPT_RC(load, c);
							exchange(info->projs[pn_Load_res], c);
							res |= DF_CHANGED;
						}
778
					}
779
					kill_node(load);
780
781
782
					reduce_adr_usage(ptr);
					return res;
				} else {
Michael Beck's avatar
Michael Beck committed
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
					compound_graph_path *path = get_accessed_path(ptr);

					if (path) {
						ir_node *c;

						assert(is_proper_compound_graph_path(path, get_compound_graph_path_length(path)-1));
						/*
						{
							int j;
							for (j = 0; j < get_compound_graph_path_length(path); ++j) {
								ir_entity *node = get_compound_graph_path_node(path, j);
								fprintf(stdout, ".%s", get_entity_name(node));
								if (is_Array_type(get_entity_owner(node)))
									fprintf(stdout, "[%d]", get_compound_graph_path_array_index(path, j));
							}
							printf("\n");
						}
						*/

						c = get_compound_ent_value_by_path(ent, path);
						free_compound_graph_path(path);

						/* printf("  cons: "); DDMN(c); */

						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], copy_const_value(get_irn_dbg_info(load), c));
							res |= DF_CHANGED;
						}
815
						kill_node(load);
Michael Beck's avatar
Michael Beck committed
816
817
818
819
820
821
822
823
824
825
826
827
						reduce_adr_usage(ptr);
						return res;
					} else {
						/*  We can not determine a correct access path.  E.g., in jack, we load
						a byte from an object to generate an exception.   Happens in test program
						Reflectiontest.
						printf(">>>>>>>>>>>>> Found access to constant entity %s in function %s\n", get_entity_name(ent),
						get_entity_name(get_irg_entity(current_ir_graph)));
						printf("  load: "); DDMN(load);
						printf("  ptr:  "); DDMN(ptr);
						*/
					}
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
				}
			}
		}
	}

	/* Check, if the address of this load is used more than once.
	 * If not, this load cannot be removed in any case. */
	if (get_irn_n_uses(ptr) <= 1)
		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
849

850
851
852
853
854
855
856
857
858
/**
 * 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
859
/**
860
 * follow the memory chain as long as there are only Loads and alias free Stores.
Michael Beck's avatar
Michael Beck committed
861
862
863
 *
 * INC_MASTER() must be called before dive into
 */
864
865
866
867
868
869
870
871
872
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);
873
	ir_node *mblk  = get_Block_MacroBlock(block);
874
875
876
877
878
879
880
881
882

	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 ...
883
884
		 * 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 ...
885
		 */
886
887
		if (is_Store(pred) && get_Store_ptr(pred) == ptr &&
		    get_nodes_MacroBlock(pred) == mblk &&
888
		    is_completely_overwritten(get_irn_mode(get_Store_value(pred)), mode)) {
889
890
891
892
893
894
895
896
			/*
			 * a Store after a Store in the same block -- a write after write.
			 * 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);
897
				exchange(pred_info->projs[pn_Store_M], get_Store_mem(pred));
898
				kill_node(pred);
899
900
901
				reduce_adr_usage(ptr);
				return DF_CHANGED;
			}
902
		} else if (is_Load(pred) && get_Load_ptr(pred) == ptr &&
903
904
		           value == pred_info->projs[pn_Load_res]) {
			/*
905
906
907
908
			 * 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.
909
910
911
			 */
			if (! info->projs[pn_Store_X_except]) {
				DBG_OPT_WAR(store, pred);
912
				exchange(info->projs[pn_Store_M], mem);
913
				kill_node(store);
914
915
916
917
918
				reduce_adr_usage(ptr);
				return DF_CHANGED;
			}
		}

919
		if (is_Store(pred)) {
920
921
922
923
924
			/* check if we can pass thru this store */
			ir_alias_relation rel = get_alias_relation(
				current_ir_graph,
				get_Store_ptr(pred),
				get_irn_mode(get_Store_value(pred)),
925
				ptr, mode);
926
927
928
929
930
			/* if the might be an alias, we cannot pass this Store */
			if (rel != no_alias)
				break;
			pred = skip_Proj(get_Store_mem(pred));
		} else if (get_irn_op(pred) == op_Load) {
931
932
933
934
935
936
			ir_alias_relation rel = get_alias_relation(
				current_ir_graph, get_Load_ptr(pred), get_Load_mode(pred),
				ptr, mode);
			if (rel != no_alias)
				break;

937
938
939
940
941
942
943
944
945
946
947
948
			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);
	}

949
	if (is_Sync(pred)) {
950
951
952
953
954
955
956
957
958
959
960
		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
961
962
963

/**
 * optimize a Store
964
965
 *
 * @param store  the Store node
Michael Beck's avatar
Michael Beck committed
966
 */
967
968
static unsigned optimize_store(ir_node *store) {
	ir_node *ptr, *mem;
Michael Beck's avatar
Michael Beck committed
969

970
971
	if (get_Store_volatility(store) == volatility_is_volatile)
		return 0;
Michael Beck's avatar
Michael Beck committed
972

973
	ptr = get_Store_ptr(store);
974

975
976
977
978
	/* 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;
979

980
	mem = get_Store_mem(store);
Michael Beck's avatar
Michael Beck committed
981

982
983
984
985
	/* follow the memory chain as long as there are only Loads */
	INC_MASTER();
	return follow_Mem_chain_for_Store(store, skip_Proj(mem));
}  /* optimize_store */
Michael Beck's avatar
Michael Beck committed
986

Michael Beck's avatar
Michael Beck committed
987
/**
988
 * walker, optimizes Phi after Stores to identical places:
Michael Beck's avatar
Michael Beck committed
989
 * Does the following optimization:
990
 * @verbatim
Michael Beck's avatar
Michael Beck committed
991
992
993
 *
 *   val1   val2   val3          val1  val2  val3
 *    |      |      |               \    |    /
994
 *  Store  Store  Store              \   |   /
995
 *      \    |    /                   PhiData
Michael Beck's avatar
Michael Beck committed
996
 *       \   |   /                       |
997
 *        \  |  /                      Store
998
 *          PhiM
Michael Beck's avatar
Michael Beck committed
999
 *
1000
 * @endverbatim