3 * File name: ir/opt/ldstopt.c
4 * Purpose: load store optimizations
8 * Copyright: (c) 1998-2004 Universit
\81ät Karlsruhe
9 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
11 # include "irnode_t.h"
12 # include "irgraph_t.h"
13 # include "irmode_t.h"
15 # include "ircons_t.h"
20 # include "dbginfo_t.h"
21 # include "iropt_dbg.h"
22 # include "irflag_t.h"
24 # include "firmstat.h"
27 #define IMAX(a,b) ((a) > (b) ? (a) : (b))
29 #define MAX_PROJ IMAX(pn_Load_max, pn_Store_max)
34 typedef struct _walk_env_t {
35 struct obstack obst; /**< list of all stores */
42 typedef struct _ldst_info_t {
43 ir_node *projs[MAX_PROJ]; /**< list of Proj's of this node */
44 ir_node *exc_block; /**< the exception block if available */
45 int exc_idx; /**< predecessor index in the exception block */
49 * flags for control flow
52 BLOCK_HAS_COND = 1, /**< Block has conditional control flow */
53 BLOCK_HAS_EXC = 2 /**< Block has exceptionl control flow */
59 typedef struct _block_info_t {
60 unsigned flags; /**< flags for the block */
64 * walker, clears all links first
66 static void init_links(ir_node *n, void *env)
68 set_irn_link(n, NULL);
72 * get the Load/Store info of a node
74 static ldst_info_t *get_ldst_info(ir_node *node, walk_env_t *env)
76 ldst_info_t *info = get_irn_link(node);
79 info = obstack_alloc(&env->obst, sizeof(*info));
81 memset(info, 0, sizeof(*info));
83 set_irn_link(node, info);
89 * get the Block info of a node
91 static block_info_t *get_block_info(ir_node *node, walk_env_t *env)
93 block_info_t *info = get_irn_link(node);
96 info = obstack_alloc(&env->obst, sizeof(*info));
98 memset(info, 0, sizeof(*info));
100 set_irn_link(node, info);
106 * update the projection info for a Load/Store
108 static int update_projs(ldst_info_t *info, ir_node *proj)
110 long nr = get_Proj_proj(proj);
112 assert(0 <= nr && nr <= MAX_PROJ && "Wrong proj from LoadStore");
114 if (info->projs[nr]) {
115 /* there is already one, do CSE */
116 exchange(proj, info->projs[nr]);
120 info->projs[nr] = proj;
126 * update the exception block info for a Load/Store
128 static int update_exc(ldst_info_t *info, ir_node *block, int pos)
130 assert(info->exc_block == NULL && "more than one exception block found");
132 info->exc_block = block;
138 * walker, collects all Load/Store/Proj nodes
140 * walks form Start -> End
142 static void collect_nodes(ir_node *node, void *env)
145 ldst_info_t *ldst_info;
146 walk_env_t *wenv = env;
148 if (get_irn_op(node) == op_Proj) {
149 pred = get_Proj_pred(node);
151 if (get_irn_op(pred) == op_Load || get_irn_op(pred) == op_Store) {
152 ldst_info = get_ldst_info(pred, wenv);
154 wenv->changes |= update_projs(ldst_info, node);
157 else if (get_irn_op(node) == op_Block) { /* check, if it's an exception block */
160 for (i = 0, n = get_Block_n_cfgpreds(node); i < n; ++i) {
162 block_info_t *bl_info;
164 pred = skip_Proj(get_Block_cfgpred(node, i));
166 /* ignore Bad predecessors, they will be removed later */
170 pred_block = get_nodes_block(pred);
171 bl_info = get_block_info(pred_block, wenv);
173 if (is_fragile_op(pred))
174 bl_info->flags |= BLOCK_HAS_EXC;
175 else if (is_forking_op(pred))
176 bl_info->flags |= BLOCK_HAS_COND;
178 if (get_irn_op(pred) == op_Load || get_irn_op(pred) == op_Store) {
179 ldst_info = get_ldst_info(pred, wenv);
181 wenv->changes |= update_exc(ldst_info, node, i);
190 static int optimize_load(ir_node *load)
192 ldst_info_t *info = get_irn_link(load);
193 ir_mode *load_mode = get_Load_mode(load);
194 ir_node *pred, *mem, *ptr;
197 if (get_Load_volatility(load) == volatility_is_volatile)
201 * BEWARE: one might think that checking the modes is useless, because
202 * if the pointers are identical, they refer to the same object.
203 * This is only true in strong typed languages, not is C were the following
204 * is possible a = *(type1 *)p; b = *(type2 *)p ...
207 ptr = get_Load_ptr(load);
208 mem = get_Load_mem(load);
209 pred = skip_Proj(mem);
211 if (! info->projs[pn_Load_res] && ! info->projs[pn_Load_X_except]) {
212 /* a Load which value is neither used nor exception checked, remove it */
213 exchange(info->projs[pn_Load_M], mem);
216 else if (get_irn_op(pred) == op_Store && get_Store_ptr(pred) == ptr &&
217 get_irn_mode(get_Store_value(pred)) == load_mode) {
219 * a load immediately after a store -- a read after write.
220 * We may remove the Load, if it does not have an exception handler
221 * OR they are in the same block. In the latter case the Load cannot
222 * throw an exception when the previous Store was quiet.
224 if (! info->projs[pn_Load_X_except] || get_nodes_block(load) == get_nodes_block(pred)) {
225 exchange( info->projs[pn_Load_res], get_Store_value(pred) );
226 if (info->projs[pn_Load_M])
227 exchange(info->projs[pn_Load_M], mem);
230 if (info->projs[pn_Load_X_except])
231 exchange( info->projs[pn_Load_X_except], new_Bad());
235 else if (get_irn_op(pred) == op_Load && get_Load_ptr(pred) == ptr &&
236 get_Load_mode(pred) == load_mode) {
238 * a load immediately after a load -- a read after read.
239 * We may remove the second Load, if it does not have an exception handler
240 * OR they are in the same block. In the later case the Load cannot
241 * throw an exception when the previous Load was quiet.
243 if (! info->projs[pn_Load_X_except] || get_nodes_block(load) == get_nodes_block(pred)) {
244 ldst_info_t *pred_info = get_irn_link(pred);
246 if (pred_info->projs[pn_Load_res]) {
247 /* we need a data proj from the previous load for this optimization */
248 exchange( info->projs[pn_Load_res], pred_info->projs[pn_Load_res] );
249 if (info->projs[pn_Load_M])
250 exchange(info->projs[pn_Load_M], mem);
253 if (info->projs[pn_Load_res]) {
254 set_Proj_pred(info->projs[pn_Load_res], pred);
255 set_nodes_block(info->projs[pn_Load_res], get_nodes_block(pred));
257 if (info->projs[pn_Load_M]) {
258 /* Actually, this if should not be necessary. Construct the Loads
260 exchange(info->projs[pn_Load_M], mem);
265 if (info->projs[pn_Load_X_except])
266 exchange(info->projs[pn_Load_X_except], new_Bad());
277 static int optimize_store(ir_node *store)
279 ldst_info_t *info = get_irn_link(store);
280 ir_node *pred, *mem, *ptr, *value, *block;
282 ldst_info_t *pred_info;
285 if (get_Store_volatility(store) == volatility_is_volatile)
289 * BEWARE: one might think that checking the modes is useless, because
290 * if the pointers are identical, they refer to the same object.
291 * This is only true in strong typed languages, not is C were the following
292 * is possible *(type1 *)p = a; *(type2 *)p = b ...
295 block = get_nodes_block(store);
296 ptr = get_Store_ptr(store);
297 mem = get_Store_mem(store);
298 value = get_Store_value(store);
299 pred = skip_Proj(mem);
300 mode = get_irn_mode(value);
302 pred_info = get_irn_link(pred);
304 if (get_irn_op(pred) == op_Store && get_Store_ptr(pred) == ptr &&
305 get_nodes_block(pred) == block && get_irn_mode(get_Store_value(pred)) == mode) {
307 * a store immediately after a store in the same block -- a write after write.
308 * We may remove the first Store, if it does not have an exception handler.
310 * TODO: What, if both have the same exception handler ???
312 if (get_Store_volatility(pred) != volatility_is_volatile && !pred_info->projs[pn_Store_X_except]) {
313 exchange( pred_info->projs[pn_Store_M], get_Store_mem(pred) );
317 else if (get_irn_op(pred) == op_Load && get_Load_ptr(pred) == ptr &&
318 value == pred_info->projs[pn_Load_res]) {
320 * a store a value immediately after a load -- a write after read.
321 * We may remove the second Store, if it does not have an exception handler.
323 if (! info->projs[pn_Store_X_except]) {
324 exchange( info->projs[pn_Store_M], mem );
332 * walker, optimizes Phi after Stores:
333 * Does the following optimization:
335 * val1 val2 val3 val1 val2 val3
343 * This removes the number of stores and allows for predicated execution.
344 * Moves Stores back to the end of a function which may be bad
346 * Is only allowed if the predecessor blocks have only one successor.
348 static int optimize_phi(ir_node *phi)
351 ir_node *store, *ptr, *block, *phiM, *phiD, *exc;
353 ir_node **inM, **inD;
357 block_info_t *bl_info;
359 /* Must be a memory Phi */
360 if (get_irn_mode(phi) != mode_M)
363 n = get_Phi_n_preds(phi);
367 store = skip_Proj(get_Phi_pred(phi, 0));
368 if (get_irn_op(store) != op_Store)
371 /* abort on bad blocks */
372 if (is_Bad(get_nodes_block(store)))
375 /* check if the block has only one output */
376 bl_info = get_irn_link(get_nodes_block(store));
380 /* this is the address of the store */
381 ptr = get_Store_ptr(store);
382 mode = get_irn_mode(get_Store_value(store));
383 info = get_irn_link(store);
384 exc = info->exc_block;
386 for (i = 1; i < n; ++i) {
387 ir_node *pred = skip_Proj(get_Phi_pred(phi, i));
389 if (get_irn_op(pred) != op_Store)
392 if (mode != get_irn_mode(get_Store_value(pred)) || ptr != get_Store_ptr(pred))
395 info = get_irn_link(pred);
397 /* check, if all stores have the same exception flow */
398 if (exc != info->exc_block)
401 /* abort on bad blocks */
402 if (is_Bad(get_nodes_block(store)))
405 /* check if the block has only one output */
406 bl_info = get_irn_link(get_nodes_block(store));
412 * ok, when we are here, we found all predecessors of a Phi that
413 * are Stores to the same address. That means whatever we do before
414 * we enter the block of the Phi, we do a Store.
415 * So, we can move the store to the current block:
417 * val1 val2 val3 val1 val2 val3
419 * | Str | | Str | | Str | \ | /
425 * Is only allowed if the predecessor blocks have only one successor.
428 /* first step: collect all inputs */
429 NEW_ARR_A(ir_node *, inM, n);
430 NEW_ARR_A(ir_node *, inD, n);
431 NEW_ARR_A(int, idx, n);
433 for (i = 0; i < n; ++i) {
434 ir_node *pred = skip_Proj(get_Phi_pred(phi, i));
435 info = get_irn_link(pred);
437 inM[i] = get_Store_mem(pred);
438 inD[i] = get_Store_value(pred);
439 idx[i] = info->exc_idx;
441 block = get_nodes_block(phi);
443 /* second step: create a new memory Phi */
444 phiM = new_rd_Phi(get_irn_dbg_info(phi), current_ir_graph, block, n, inM, mode_M);
446 /* third step: create a new data Phi */
447 phiD = new_rd_Phi(get_irn_dbg_info(phi), current_ir_graph, block, n, inD, mode);
449 /* fourth step: create the Store */
450 store = new_rd_Store(db, current_ir_graph, block, phiM, ptr, phiD);
452 /* fifths step: repair exception flow */
454 ir_node *projX = new_rd_Proj(NULL, current_ir_graph, block, store, mode_X, pn_Store_X_except);
456 for (i = 0; i < n; ++i) {
457 set_Block_cfgpred(exc, idx[i], projX);
461 /* the exception block should be optimized as some inputs are identical now */
465 /* sixt step: replace old Phi */
466 exchange(phi, new_rd_Proj(NULL, current_ir_graph, block, store, mode_M, pn_Store_M));
472 * walker, collects all Load/Store/Proj nodes
474 static void do_load_store_optimize(ir_node *n, void *env)
476 walk_env_t *wenv = env;
478 switch (get_irn_opcode(n)) {
481 wenv->changes |= optimize_load(n);
485 wenv->changes |= optimize_store(n);
489 // wenv->changes |= optimize_phi(n);
497 * do the load store optimization
499 void optimize_load_store(ir_graph *irg)
503 assert(get_irg_phase_state(irg) != phase_building);
505 if (!get_opt_redundant_LoadStore())
508 obstack_init(&env.obst);
511 /* init the links, then collect Loads/Stores/Proj's in lists */
512 irg_walk_graph(irg, init_links, collect_nodes, &env);
514 /* now we have collected enough information, optimize */
515 irg_walk_graph(irg, NULL, do_load_store_optimize, &env);
517 obstack_free(&env.obst, NULL);
519 /* Handle graph state */
521 if (get_irg_outs_state(current_ir_graph) == outs_consistent)
522 set_irg_outs_inconsistent(current_ir_graph);
524 /* is this really needed: Yes, as exception block may get bad but this might be tested */
525 if (get_irg_dom_state(current_ir_graph) == dom_consistent)
526 set_irg_dom_inconsistent(current_ir_graph);