2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Load/Store optimizations.
23 * @author Michael Beck
32 #include "iroptimize.h"
34 #include "irgraph_t.h"
42 #include "dbginfo_t.h"
43 #include "iropt_dbg.h"
49 #include "opt_polymorphy.h"
52 #include "irphase_t.h"
56 /** The debug handle. */
57 DEBUG_ONLY(static firm_dbg_module_t *dbg;)
60 #include "cacheopt/cachesim.h"
64 #define IMAX(a,b) ((a) > (b) ? (a) : (b))
66 #define MAX_PROJ IMAX(IMAX(pn_Load_max, pn_Store_max), pn_Call_max)
69 DF_CHANGED = 1, /**< data flow changed */
70 CF_CHANGED = 2, /**< control flow changed */
76 typedef struct _walk_env_t {
77 struct obstack obst; /**< list of all stores */
78 unsigned changes; /**< a bitmask of graph changes */
81 /** A Load/Store info. */
82 typedef struct _ldst_info_t {
83 ir_node *projs[MAX_PROJ]; /**< list of Proj's of this node */
84 ir_node *exc_block; /**< the exception block if available */
85 int exc_idx; /**< predecessor index in the exception block */
86 unsigned visited; /**< visited counter for breaking loops */
90 * flags for control flow.
93 BLOCK_HAS_COND = 1, /**< Block has conditional control flow */
94 BLOCK_HAS_EXC = 2 /**< Block has exceptional control flow */
100 typedef struct _block_info_t {
101 unsigned flags; /**< flags for the block */
104 /** the master visited flag for loop detection. */
105 static unsigned master_visited = 0;
107 #define INC_MASTER() ++master_visited
108 #define MARK_NODE(info) (info)->visited = master_visited
109 #define NODE_VISITED(info) (info)->visited >= master_visited
112 * 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);
118 info = obstack_alloc(obst, sizeof(*info));
119 memset(info, 0, sizeof(*info));
120 set_irn_link(node, info);
123 } /* get_ldst_info */
126 * 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);
132 info = obstack_alloc(obst, sizeof(*info));
133 memset(info, 0, sizeof(*info));
134 set_irn_link(node, info);
137 } /* get_block_info */
140 * update the projection info for a Load/Store
142 static unsigned update_projs(ldst_info_t *info, ir_node *proj)
144 long nr = get_Proj_proj(proj);
146 assert(0 <= nr && nr <= MAX_PROJ && "Wrong proj from LoadStore");
148 if (info->projs[nr]) {
149 /* there is already one, do CSE */
150 exchange(proj, info->projs[nr]);
154 info->projs[nr] = proj;
160 * update the exception block info for a Load/Store node.
162 * @param info the load/store info struct
163 * @param block the exception handler block for this load/store
164 * @param pos the control flow input of the block
166 static unsigned update_exc(ldst_info_t *info, ir_node *block, int pos)
168 assert(info->exc_block == NULL && "more than one exception block found");
170 info->exc_block = block;
175 /** Return the number of uses of an address node */
176 #define get_irn_n_uses(adr) get_irn_n_edges(adr)
179 * walker, collects all Load/Store/Proj nodes
181 * walks from Start -> End
183 static void collect_nodes(ir_node *node, void *env)
185 ir_opcode opcode = get_irn_opcode(node);
186 ir_node *pred, *blk, *pred_blk;
187 ldst_info_t *ldst_info;
188 walk_env_t *wenv = env;
190 if (opcode == iro_Proj) {
191 pred = get_Proj_pred(node);
192 opcode = get_irn_opcode(pred);
194 if (opcode == iro_Load || opcode == iro_Store || opcode == iro_Call) {
195 ldst_info = get_ldst_info(pred, &wenv->obst);
197 wenv->changes |= update_projs(ldst_info, node);
200 * Place the Proj's to the same block as the
201 * predecessor Load. This is always ok and prevents
202 * "non-SSA" form after optimizations if the Proj
203 * is in a wrong block.
205 blk = get_nodes_block(node);
206 pred_blk = get_nodes_block(pred);
207 if (blk != pred_blk) {
208 wenv->changes |= DF_CHANGED;
209 set_nodes_block(node, pred_blk);
212 } else if (opcode == iro_Block) {
215 for (i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) {
216 ir_node *pred_block, *proj;
217 block_info_t *bl_info;
220 pred = proj = get_Block_cfgpred(node, i);
223 pred = get_Proj_pred(proj);
224 is_exc = get_Proj_proj(proj) == pn_Generic_X_except;
227 /* ignore Bad predecessors, they will be removed later */
231 pred_block = get_nodes_block(pred);
232 bl_info = get_block_info(pred_block, &wenv->obst);
234 if (is_fragile_op(pred) && is_exc)
235 bl_info->flags |= BLOCK_HAS_EXC;
236 else if (is_irn_forking(pred))
237 bl_info->flags |= BLOCK_HAS_COND;
239 opcode = get_irn_opcode(pred);
240 if (is_exc && (opcode == iro_Load || opcode == iro_Store || opcode == iro_Call)) {
241 ldst_info = get_ldst_info(pred, &wenv->obst);
243 wenv->changes |= update_exc(ldst_info, node, i);
247 } /* collect_nodes */
250 * Returns an entity if the address ptr points to a constant one.
252 * @param ptr the address
254 * @return an entity or NULL
256 static ir_entity *find_constant_entity(ir_node *ptr)
259 if (is_SymConst(ptr) && get_SymConst_kind(ptr) == symconst_addr_ent) {
260 ir_entity *ent = get_SymConst_entity(ptr);
261 if (variability_constant == get_entity_variability(ent))
264 } else if (is_Sel(ptr)) {
265 ir_entity *ent = get_Sel_entity(ptr);
266 ir_type *tp = get_entity_owner(ent);
268 /* Do not fiddle with polymorphism. */
269 if (is_Class_type(get_entity_owner(ent)) &&
270 ((get_entity_n_overwrites(ent) != 0) ||
271 (get_entity_n_overwrittenby(ent) != 0) ) )
274 if (is_Array_type(tp)) {
278 for (i = 0, n = get_Sel_n_indexs(ptr); i < n; ++i) {
280 tarval *tlower, *tupper;
281 ir_node *index = get_Sel_index(ptr, i);
282 tarval *tv = computed_value(index);
284 /* check if the index is constant */
285 if (tv == tarval_bad)
288 bound = get_array_lower_bound(tp, i);
289 tlower = computed_value(bound);
290 bound = get_array_upper_bound(tp, i);
291 tupper = computed_value(bound);
293 if (tlower == tarval_bad || tupper == tarval_bad)
296 if (tarval_cmp(tv, tlower) & pn_Cmp_Lt)
298 if (tarval_cmp(tupper, tv) & pn_Cmp_Lt)
301 /* ok, bounds check finished */
305 if (variability_constant == get_entity_variability(ent))
309 ptr = get_Sel_ptr(ptr);
310 } else if (is_Add(ptr)) {
311 ir_node *l = get_Add_left(ptr);
312 ir_node *r = get_Add_right(ptr);
314 if (get_irn_mode(l) == get_irn_mode(ptr) && is_Const(r))
316 else if (get_irn_mode(r) == get_irn_mode(ptr) && is_Const(l))
321 /* for now, we support only one addition, reassoc should fold all others */
322 if (! is_SymConst(ptr) && !is_Sel(ptr))
324 } else if (is_Sub(ptr)) {
325 ir_node *l = get_Sub_left(ptr);
326 ir_node *r = get_Sub_right(ptr);
328 if (get_irn_mode(l) == get_irn_mode(ptr) && is_Const(r))
332 /* for now, we support only one substraction, reassoc should fold all others */
333 if (! is_SymConst(ptr) && !is_Sel(ptr))
338 } /* find_constant_entity */
341 * Return the Selection index of a Sel node from dimension n
343 static long get_Sel_array_index_long(ir_node *n, int dim) {
344 ir_node *index = get_Sel_index(n, dim);
345 assert(is_Const(index));
346 return get_tarval_long(get_Const_tarval(index));
347 } /* get_Sel_array_index_long */
350 * Returns the accessed component graph path for an
351 * node computing an address.
353 * @param ptr the node computing the address
354 * @param depth current depth in steps upward from the root
357 static compound_graph_path *rec_get_accessed_path(ir_node *ptr, int depth) {
358 compound_graph_path *res = NULL;
359 ir_entity *root, *field, *ent;
360 int path_len, pos, idx;
364 if (is_SymConst(ptr)) {
365 /* a SymConst. If the depth is 0, this is an access to a global
366 * entity and we don't need a component path, else we know
367 * at least it's length.
369 assert(get_SymConst_kind(ptr) == symconst_addr_ent);
370 root = get_SymConst_entity(ptr);
371 res = (depth == 0) ? NULL : new_compound_graph_path(get_entity_type(root), depth);
372 } else if (is_Sel(ptr)) {
373 /* it's a Sel, go up until we find the root */
374 res = rec_get_accessed_path(get_Sel_ptr(ptr), depth+1);
378 /* fill up the step in the path at the current position */
379 field = get_Sel_entity(ptr);
380 path_len = get_compound_graph_path_length(res);
381 pos = path_len - depth - 1;
382 set_compound_graph_path_node(res, pos, field);
384 if (is_Array_type(get_entity_owner(field))) {
385 assert(get_Sel_n_indexs(ptr) == 1 && "multi dim arrays not implemented");
386 set_compound_graph_path_array_index(res, pos, get_Sel_array_index_long(ptr, 0));
388 } else if (is_Add(ptr)) {
389 ir_node *l = get_Add_left(ptr);
390 ir_node *r = get_Add_right(ptr);
395 tv = get_Const_tarval(r);
398 tv = get_Const_tarval(l);
401 mode = get_tarval_mode(tv);
403 /* ptr must be a Sel or a SymConst, this was checked in find_constant_entity() */
405 field = get_Sel_entity(ptr);
407 field = get_SymConst_entity(ptr);
410 for (ent = field;;) {
412 tarval *sz, *tv_index, *tlower, *tupper;
416 tp = get_entity_type(ent);
417 if (! is_Array_type(tp))
419 ent = get_array_element_entity(tp);
420 size = get_type_size_bytes(get_entity_type(ent));
421 sz = new_tarval_from_long(size, mode);
423 tv_index = tarval_div(tv, sz);
424 tv = tarval_mod(tv, sz);
426 if (tv_index == tarval_bad || tv == tarval_bad)
429 assert(get_array_n_dimensions(tp) == 1 && "multiarrays not implemented");
430 bound = get_array_lower_bound(tp, 0);
431 tlower = computed_value(bound);
432 bound = get_array_upper_bound(tp, 0);
433 tupper = computed_value(bound);
435 if (tlower == tarval_bad || tupper == tarval_bad)
438 if (tarval_cmp(tv_index, tlower) & pn_Cmp_Lt)
440 if (tarval_cmp(tupper, tv_index) & pn_Cmp_Lt)
443 /* ok, bounds check finished */
444 index = get_tarval_long(tv_index);
447 if (! tarval_is_null(tv)) {
448 /* access to some struct/union member */
452 /* should be at least ONE array */
456 res = rec_get_accessed_path(ptr, depth + idx);
460 path_len = get_compound_graph_path_length(res);
461 pos = path_len - depth - idx;
463 for (ent = field;;) {
465 tarval *sz, *tv_index;
468 tp = get_entity_type(ent);
469 if (! is_Array_type(tp))
471 ent = get_array_element_entity(tp);
472 set_compound_graph_path_node(res, pos, ent);
474 size = get_type_size_bytes(get_entity_type(ent));
475 sz = new_tarval_from_long(size, mode);
477 tv_index = tarval_div(tv, sz);
478 tv = tarval_mod(tv, sz);
480 /* worked above, should work again */
481 assert(tv_index != tarval_bad && tv != tarval_bad);
483 /* bounds already checked above */
484 index = get_tarval_long(tv_index);
485 set_compound_graph_path_array_index(res, pos, index);
488 } else if (is_Sub(ptr)) {
489 ir_node *l = get_Sub_left(ptr);
490 ir_node *r = get_Sub_right(ptr);
493 tv = get_Const_tarval(r);
498 } /* rec_get_accessed_path */
501 * Returns an access path or NULL. The access path is only
502 * valid, if the graph is in phase_high and _no_ address computation is used.
504 static compound_graph_path *get_accessed_path(ir_node *ptr) {
505 return rec_get_accessed_path(ptr, 0);
506 } /* get_accessed_path */
508 typedef struct path_entry {
510 struct path_entry *next;
514 static ir_node *rec_find_compound_ent_value(ir_node *ptr, path_entry *next) {
515 path_entry entry, *p;
516 ir_entity *ent, *field;
517 ir_initializer_t *initializer;
523 if (is_SymConst(ptr)) {
525 ent = get_SymConst_entity(ptr);
526 initializer = get_entity_initializer(ent);
527 for (p = next; p != NULL;) {
528 if (initializer->kind != IR_INITIALIZER_COMPOUND)
530 n = get_initializer_compound_n_entries(initializer);
531 tp = get_entity_type(ent);
533 if (is_Array_type(tp)) {
534 ent = get_array_element_entity(tp);
539 initializer = get_initializer_compound_value(initializer, 0);
545 initializer = get_initializer_compound_value(initializer, p->index);
550 tp = get_entity_type(ent);
551 while (is_Array_type(tp)) {
552 ent = get_array_element_entity(tp);
553 tp = get_entity_type(ent);
555 n = get_initializer_compound_n_entries(initializer);
558 initializer = get_initializer_compound_value(initializer, 0);
561 switch (initializer->kind) {
562 case IR_INITIALIZER_CONST:
563 return get_initializer_const_value(initializer);
564 case IR_INITIALIZER_TARVAL:
565 case IR_INITIALIZER_NULL:
569 } else if (is_Sel(ptr)) {
570 entry.ent = field = get_Sel_entity(ptr);
571 tp = get_entity_owner(field);
572 if (is_Array_type(tp)) {
573 assert(get_Sel_n_indexs(ptr) == 1 && "multi dim arrays not implemented");
574 entry.index = get_Sel_array_index_long(ptr, 0) - get_array_lower_bound_int(tp, 0);
576 int i, n_members = get_compound_n_members(tp);
577 for (i = 0; i < n_members; ++i) {
578 if (get_compound_member(tp, i) == field)
581 if (i >= n_members) {
582 /* not found: should NOT happen */
587 return rec_find_compound_ent_value(get_Sel_ptr(ptr), &entry);
588 } else if (is_Add(ptr)) {
589 ir_node *l = get_Add_left(ptr);
590 ir_node *r = get_Add_right(ptr);
596 tv = get_Const_tarval(r);
599 tv = get_Const_tarval(l);
602 mode = get_tarval_mode(tv);
604 /* ptr must be a Sel or a SymConst, this was checked in find_constant_entity() */
606 field = get_Sel_entity(ptr);
608 field = get_SymConst_entity(ptr);
611 /* count needed entries */
613 for (ent = field;;) {
614 tp = get_entity_type(ent);
615 if (! is_Array_type(tp))
617 ent = get_array_element_entity(tp);
620 /* should be at least ONE entry */
624 /* allocate the right number of entries */
625 NEW_ARR_A(path_entry, p, pos);
629 for (ent = field;;) {
631 tarval *sz, *tv_index, *tlower, *tupper;
635 tp = get_entity_type(ent);
636 if (! is_Array_type(tp))
638 ent = get_array_element_entity(tp);
640 p[pos].next = &p[pos + 1];
642 size = get_type_size_bytes(get_entity_type(ent));
643 sz = new_tarval_from_long(size, mode);
645 tv_index = tarval_div(tv, sz);
646 tv = tarval_mod(tv, sz);
648 if (tv_index == tarval_bad || tv == tarval_bad)
651 assert(get_array_n_dimensions(tp) == 1 && "multiarrays not implemented");
652 bound = get_array_lower_bound(tp, 0);
653 tlower = computed_value(bound);
654 bound = get_array_upper_bound(tp, 0);
655 tupper = computed_value(bound);
657 if (tlower == tarval_bad || tupper == tarval_bad)
660 if (tarval_cmp(tv_index, tlower) & pn_Cmp_Lt)
662 if (tarval_cmp(tupper, tv_index) & pn_Cmp_Lt)
665 /* ok, bounds check finished */
666 index = get_tarval_long(tv_index);
667 p[pos].index = index;
670 if (! tarval_is_null(tv)) {
671 /* hmm, wrong access */
674 p[pos - 1].next = next;
675 return rec_find_compound_ent_value(ptr, p);
676 } else if (is_Sub(ptr)) {
677 ir_node *l = get_Sub_left(ptr);
678 ir_node *r = get_Sub_right(ptr);
681 tv = get_Const_tarval(r);
688 static ir_node *find_compound_ent_value(ir_node *ptr) {
689 return rec_find_compound_ent_value(ptr, NULL);
693 static void reduce_adr_usage(ir_node *ptr);
696 * Update a Load that may lost it's usage.
698 static void handle_load_update(ir_node *load) {
699 ldst_info_t *info = get_irn_link(load);
701 /* do NOT touch volatile loads for now */
702 if (get_Load_volatility(load) == volatility_is_volatile)
705 if (! info->projs[pn_Load_res] && ! info->projs[pn_Load_X_except]) {
706 ir_node *ptr = get_Load_ptr(load);
707 ir_node *mem = get_Load_mem(load);
709 /* a Load which value is neither used nor exception checked, remove it */
710 exchange(info->projs[pn_Load_M], mem);
711 if (info->projs[pn_Load_X_regular])
712 exchange(info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
714 reduce_adr_usage(ptr);
716 } /* handle_load_update */
719 * A Use of an address node is vanished. Check if this was a Proj
720 * node and update the counters.
722 static void reduce_adr_usage(ir_node *ptr) {
724 if (get_irn_n_edges(ptr) <= 0) {
725 /* this Proj is dead now */
726 ir_node *pred = get_Proj_pred(ptr);
729 ldst_info_t *info = get_irn_link(pred);
730 info->projs[get_Proj_proj(ptr)] = NULL;
732 /* this node lost it's result proj, handle that */
733 handle_load_update(pred);
737 } /* reduce_adr_usage */
740 * Check, if an already existing value of mode old_mode can be converted
741 * into the needed one new_mode without loss.
743 static int can_use_stored_value(ir_mode *old_mode, ir_mode *new_mode) {
744 if (old_mode == new_mode)
747 /* if both modes are two-complement ones, we can always convert the
748 Stored value into the needed one. */
749 if (get_mode_size_bits(old_mode) >= get_mode_size_bits(new_mode) &&
750 get_mode_arithmetic(old_mode) == irma_twos_complement &&
751 get_mode_arithmetic(new_mode) == irma_twos_complement)
754 } /* can_use_stored_value */
757 * Check whether a Call is at least pure, ie. does only read memory.
759 static unsigned is_Call_pure(ir_node *call) {
760 ir_type *call_tp = get_Call_type(call);
761 unsigned prop = get_method_additional_properties(call_tp);
763 /* check first the call type */
764 if ((prop & (mtp_property_const|mtp_property_pure)) == 0) {
765 /* try the called entity */
766 ir_node *ptr = get_Call_ptr(call);
768 if (is_Global(ptr)) {
769 ir_entity *ent = get_Global_entity(ptr);
771 prop = get_entity_additional_properties(ent);
774 return (prop & (mtp_property_const|mtp_property_pure)) != 0;
778 * Follow the memory chain as long as there are only Loads,
779 * alias free Stores, and constant Calls and try to replace the
780 * current Load by a previous ones.
781 * Note that in unreachable loops it might happen that we reach
782 * load again, as well as we can fall into a cycle.
783 * We break such cycles using a special visited flag.
785 * INC_MASTER() must be called before dive into
787 static unsigned follow_Mem_chain(ir_node *load, ir_node *curr) {
789 ldst_info_t *info = get_irn_link(load);
791 ir_node *ptr = get_Load_ptr(load);
792 ir_node *mem = get_Load_mem(load);
793 ir_mode *load_mode = get_Load_mode(load);
795 for (pred = curr; load != pred; ) {
796 ldst_info_t *pred_info = get_irn_link(pred);
799 * BEWARE: one might think that checking the modes is useless, because
800 * if the pointers are identical, they refer to the same object.
801 * This is only true in strong typed languages, not in C were the following
802 * is possible a = *(ir_type1 *)p; b = *(ir_type2 *)p ...
804 if (is_Store(pred) && get_Store_ptr(pred) == ptr &&
805 can_use_stored_value(get_irn_mode(get_Store_value(pred)), load_mode)) {
807 * a Load immediately after a Store -- a read after write.
808 * We may remove the Load, if both Load & Store does not have an exception handler
809 * OR they are in the same MacroBlock. In the latter case the Load cannot
810 * throw an exception when the previous Store was quiet.
812 * Why we need to check for Store Exception? If the Store cannot
813 * be executed (ROM) the exception handler might simply jump into
814 * the load MacroBlock :-(
815 * We could make it a little bit better if we would know that the exception
816 * handler of the Store jumps directly to the end...
818 if ((pred_info->projs[pn_Store_X_except] == NULL && info->projs[pn_Load_X_except] == NULL) ||
819 get_nodes_MacroBlock(load) == get_nodes_MacroBlock(pred)) {
820 ir_node *value = get_Store_value(pred);
822 DBG_OPT_RAW(load, value);
824 /* add an convert if needed */
825 if (get_irn_mode(get_Store_value(pred)) != load_mode) {
826 value = new_r_Conv(current_ir_graph, get_nodes_block(load), value, load_mode);
829 if (info->projs[pn_Load_M])
830 exchange(info->projs[pn_Load_M], mem);
833 if (info->projs[pn_Load_X_except]) {
834 exchange( info->projs[pn_Load_X_except], new_Bad());
837 if (info->projs[pn_Load_X_regular]) {
838 exchange( info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
842 if (info->projs[pn_Load_res])
843 exchange(info->projs[pn_Load_res], value);
846 reduce_adr_usage(ptr);
847 return res | DF_CHANGED;
849 } else if (is_Load(pred) && get_Load_ptr(pred) == ptr &&
850 can_use_stored_value(get_Load_mode(pred), load_mode)) {
852 * a Load after a Load -- a read after read.
853 * We may remove the second Load, if it does not have an exception handler
854 * OR they are in the same MacroBlock. In the later case the Load cannot
855 * throw an exception when the previous Load was quiet.
857 * Here, there is no need to check if the previous Load has an exception
858 * hander because they would have exact the same exception...
860 if (info->projs[pn_Load_X_except] == NULL || get_nodes_MacroBlock(load) == get_nodes_MacroBlock(pred)) {
863 DBG_OPT_RAR(load, pred);
865 /* the result is used */
866 if (info->projs[pn_Load_res]) {
867 if (pred_info->projs[pn_Load_res] == NULL) {
868 /* create a new Proj again */
869 pred_info->projs[pn_Load_res] = new_r_Proj(current_ir_graph, get_nodes_block(pred), pred, get_Load_mode(pred), pn_Load_res);
871 value = pred_info->projs[pn_Load_res];
873 /* add an convert if needed */
874 if (get_Load_mode(pred) != load_mode) {
875 value = new_r_Conv(current_ir_graph, get_nodes_block(load), value, load_mode);
878 exchange(info->projs[pn_Load_res], value);
881 if (info->projs[pn_Load_M])
882 exchange(info->projs[pn_Load_M], mem);
885 if (info->projs[pn_Load_X_except]) {
886 exchange(info->projs[pn_Load_X_except], new_Bad());
889 if (info->projs[pn_Load_X_regular]) {
890 exchange( info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
895 reduce_adr_usage(ptr);
896 return res |= DF_CHANGED;
900 if (is_Store(pred)) {
901 /* check if we can pass through this store */
902 ir_alias_relation rel = get_alias_relation(
905 get_irn_mode(get_Store_value(pred)),
907 /* if the might be an alias, we cannot pass this Store */
908 if (rel != ir_no_alias)
910 pred = skip_Proj(get_Store_mem(pred));
911 } else if (is_Load(pred)) {
912 pred = skip_Proj(get_Load_mem(pred));
913 } else if (is_Call(pred)) {
914 if (is_Call_pure(pred)) {
915 /* The called graph is at least pure, so there are no Store's
916 in it. We can handle it like a Load and skip it. */
917 pred = skip_Proj(get_Call_mem(pred));
919 /* there might be Store's in the graph, stop here */
923 /* follow only Load chains */
927 /* check for cycles */
928 if (NODE_VISITED(pred_info))
930 MARK_NODE(pred_info);
936 /* handle all Sync predecessors */
937 for (i = get_Sync_n_preds(pred) - 1; i >= 0; --i) {
938 res |= follow_Mem_chain(load, skip_Proj(get_Sync_pred(pred, i)));
945 } /* follow_Mem_chain */
950 * @param load the Load node
952 static unsigned optimize_load(ir_node *load)
954 ldst_info_t *info = get_irn_link(load);
955 ir_node *mem, *ptr, *new_node;
959 /* do NOT touch volatile loads for now */
960 if (get_Load_volatility(load) == volatility_is_volatile)
963 /* the address of the load to be optimized */
964 ptr = get_Load_ptr(load);
967 * Check if we can remove the exception from a Load:
968 * This can be done, if the address is from an Sel(Alloc) and
969 * the Sel type is a subtype of the allocated type.
971 * This optimizes some often used OO constructs,
972 * like x = new O; x->t;
974 if (info->projs[pn_Load_X_except]) {
976 ir_node *mem = get_Sel_mem(ptr);
978 /* FIXME: works with the current FE, but better use the base */
979 if (is_Alloc(skip_Proj(mem))) {
980 /* ok, check the types */
981 ir_entity *ent = get_Sel_entity(ptr);
982 ir_type *s_type = get_entity_type(ent);
983 ir_type *a_type = get_Alloc_type(mem);
985 if (is_SubClass_of(s_type, a_type)) {
986 /* ok, condition met: there can't be an exception because
987 * Alloc guarantees that enough memory was allocated */
989 exchange(info->projs[pn_Load_X_except], new_Bad());
990 info->projs[pn_Load_X_except] = NULL;
991 exchange(info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
992 info->projs[pn_Load_X_regular] = NULL;
996 } else if (is_Alloc(skip_Proj(skip_Cast(ptr)))) {
997 /* simple case: a direct load after an Alloc. Firm Alloc throw
998 * an exception in case of out-of-memory. So, there is no way for an
999 * exception in this load.
1000 * This code is constructed by the "exception lowering" in the Jack compiler.
1002 exchange(info->projs[pn_Load_X_except], new_Bad());
1003 info->projs[pn_Load_X_except] = NULL;
1004 exchange(info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
1005 info->projs[pn_Load_X_regular] = NULL;
1010 /* The mem of the Load. Must still be returned after optimization. */
1011 mem = get_Load_mem(load);
1013 if (! info->projs[pn_Load_res] && ! info->projs[pn_Load_X_except]) {
1014 /* a Load which value is neither used nor exception checked, remove it */
1015 exchange(info->projs[pn_Load_M], mem);
1017 if (info->projs[pn_Load_X_regular]) {
1018 /* should not happen, but if it does, remove it */
1019 exchange(info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
1023 reduce_adr_usage(ptr);
1024 return res | DF_CHANGED;
1027 /* Load from a constant polymorphic field, where we can resolve
1029 new_node = transform_node_Load(load);
1030 if (new_node != load) {
1031 if (info->projs[pn_Load_M]) {
1032 exchange(info->projs[pn_Load_M], mem);
1033 info->projs[pn_Load_M] = NULL;
1035 if (info->projs[pn_Load_X_except]) {
1036 exchange(info->projs[pn_Load_X_except], new_Bad());
1037 info->projs[pn_Load_X_except] = NULL;
1040 if (info->projs[pn_Load_X_regular]) {
1041 exchange(info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
1042 info->projs[pn_Load_X_regular] = NULL;
1045 if (info->projs[pn_Load_res])
1046 exchange(info->projs[pn_Load_res], new_node);
1049 reduce_adr_usage(ptr);
1050 return res | DF_CHANGED;
1053 /* check if we can determine the entity that will be loaded */
1054 ent = find_constant_entity(ptr);
1056 if ((allocation_static == get_entity_allocation(ent)) &&
1057 (visibility_external_allocated != get_entity_visibility(ent))) {
1058 /* a static allocation that is not external: there should be NO exception
1061 /* no exception, clear the info field as it might be checked later again */
1062 if (info->projs[pn_Load_X_except]) {
1063 exchange(info->projs[pn_Load_X_except], new_Bad());
1064 info->projs[pn_Load_X_except] = NULL;
1067 if (info->projs[pn_Load_X_regular]) {
1068 exchange(info->projs[pn_Load_X_regular], new_r_Jmp(current_ir_graph, get_nodes_block(load)));
1069 info->projs[pn_Load_X_regular] = NULL;
1073 if (variability_constant == get_entity_variability(ent)) {
1075 if (is_atomic_entity(ent)) {
1076 /* Might not be atomic after
1077 lowering of Sels. In this
1078 case we could also load, but
1079 it's more complicated. */
1080 /* more simpler case: we load the content of a constant value:
1081 * replace it by the constant itself
1083 c = get_atomic_ent_value(ent);
1085 if (ent->has_initializer) {
1086 /* new style initializer */
1087 c = find_compound_ent_value(ptr);
1089 /* old style initializer */
1090 compound_graph_path *path = get_accessed_path(ptr);
1093 assert(is_proper_compound_graph_path(path, get_compound_graph_path_length(path)-1));
1095 c = get_compound_ent_value_by_path(ent, path);
1096 free_compound_graph_path(path);
1101 /* check, if the mode matches OR can be easily converted info */
1102 ir_mode *c_mode = get_irn_mode(c);
1103 ir_mode *l_mode = get_Load_mode(load);
1105 if (c_mode != l_mode) {
1106 if (is_reinterpret_cast(c_mode, l_mode)) {
1107 /* we can safely cast */
1108 dbg_info *dbg = get_irn_dbg_info(load);
1109 ir_node *block = get_nodes_block(load);
1111 /* copy the value from the const code irg and cast it */
1112 c = copy_const_value(dbg, c);
1113 c = new_rd_Conv(dbg, current_ir_graph, block, c, l_mode);
1115 /* must be some operation */
1119 /* copy the value from the const code irg */
1120 c = copy_const_value(get_irn_dbg_info(load), c);
1124 if (info->projs[pn_Load_M]) {
1125 exchange(info->projs[pn_Load_M], mem);
1128 if (info->projs[pn_Load_res]) {
1129 exchange(info->projs[pn_Load_res], c);
1133 reduce_adr_usage(ptr);
1140 /* Check, if the address of this load is used more than once.
1141 * If not, this load cannot be removed in any case. */
1142 if (get_irn_n_uses(ptr) <= 1)
1146 * follow the memory chain as long as there are only Loads
1147 * and try to replace current Load or Store by a previous one.
1148 * Note that in unreachable loops it might happen that we reach
1149 * load again, as well as we can fall into a cycle.
1150 * We break such cycles using a special visited flag.
1153 res = follow_Mem_chain(load, skip_Proj(mem));
1155 } /* optimize_load */
1158 * Check whether a value of mode new_mode would completely overwrite a value
1159 * of mode old_mode in memory.
1161 static int is_completely_overwritten(ir_mode *old_mode, ir_mode *new_mode)
1163 return get_mode_size_bits(new_mode) >= get_mode_size_bits(old_mode);
1164 } /* is_completely_overwritten */
1167 * follow the memory chain as long as there are only Loads and alias free Stores.
1169 * INC_MASTER() must be called before dive into
1171 static unsigned follow_Mem_chain_for_Store(ir_node *store, ir_node *curr) {
1173 ldst_info_t *info = get_irn_link(store);
1175 ir_node *ptr = get_Store_ptr(store);
1176 ir_node *mem = get_Store_mem(store);
1177 ir_node *value = get_Store_value(store);
1178 ir_mode *mode = get_irn_mode(value);
1179 ir_node *block = get_nodes_block(store);
1180 ir_node *mblk = get_Block_MacroBlock(block);
1182 for (pred = curr; pred != store;) {
1183 ldst_info_t *pred_info = get_irn_link(pred);
1186 * BEWARE: one might think that checking the modes is useless, because
1187 * if the pointers are identical, they refer to the same object.
1188 * This is only true in strong typed languages, not is C were the following
1189 * is possible *(ir_type1 *)p = a; *(ir_type2 *)p = b ...
1190 * However, if the mode that is written have a bigger or equal size the the old
1191 * one, the old value is completely overwritten and can be killed ...
1193 if (is_Store(pred) && get_Store_ptr(pred) == ptr &&
1194 get_nodes_MacroBlock(pred) == mblk &&
1195 is_completely_overwritten(get_irn_mode(get_Store_value(pred)), mode)) {
1197 * a Store after a Store in the same MacroBlock -- a write after write.
1198 * We may remove the first Store, if it does not have an exception handler.
1200 * TODO: What, if both have the same exception handler ???
1202 if (get_Store_volatility(pred) != volatility_is_volatile && !pred_info->projs[pn_Store_X_except]) {
1203 DBG_OPT_WAW(pred, store);
1204 exchange(pred_info->projs[pn_Store_M], get_Store_mem(pred));
1206 reduce_adr_usage(ptr);
1209 } else if (is_Load(pred) && get_Load_ptr(pred) == ptr &&
1210 value == pred_info->projs[pn_Load_res]) {
1212 * a Store of a value just loaded from the same address
1213 * -- a write after read.
1214 * We may remove the Store, if it does not have an exception
1217 if (! info->projs[pn_Store_X_except]) {
1218 DBG_OPT_WAR(store, pred);
1219 exchange(info->projs[pn_Store_M], mem);
1221 reduce_adr_usage(ptr);
1226 if (is_Store(pred)) {
1227 /* check if we can pass thru this store */
1228 ir_alias_relation rel = get_alias_relation(
1230 get_Store_ptr(pred),
1231 get_irn_mode(get_Store_value(pred)),
1233 /* if the might be an alias, we cannot pass this Store */
1234 if (rel != ir_no_alias)
1236 pred = skip_Proj(get_Store_mem(pred));
1237 } else if (is_Load(pred)) {
1238 ir_alias_relation rel = get_alias_relation(
1239 current_ir_graph, get_Load_ptr(pred), get_Load_mode(pred),
1241 if (rel != ir_no_alias)
1244 pred = skip_Proj(get_Load_mem(pred));
1246 /* follow only Load chains */
1250 /* check for cycles */
1251 if (NODE_VISITED(pred_info))
1253 MARK_NODE(pred_info);
1256 if (is_Sync(pred)) {
1259 /* handle all Sync predecessors */
1260 for (i = get_Sync_n_preds(pred) - 1; i >= 0; --i) {
1261 res |= follow_Mem_chain_for_Store(store, skip_Proj(get_Sync_pred(pred, i)));
1267 } /* follow_Mem_chain_for_Store */
1272 * @param store the Store node
1274 static unsigned optimize_store(ir_node *store) {
1277 if (get_Store_volatility(store) == volatility_is_volatile)
1280 ptr = get_Store_ptr(store);
1282 /* Check, if the address of this Store is used more than once.
1283 * If not, this Store cannot be removed in any case. */
1284 if (get_irn_n_uses(ptr) <= 1)
1287 mem = get_Store_mem(store);
1289 /* follow the memory chain as long as there are only Loads */
1292 return follow_Mem_chain_for_Store(store, skip_Proj(mem));
1293 } /* optimize_store */
1296 * walker, optimizes Phi after Stores to identical places:
1297 * Does the following optimization:
1300 * val1 val2 val3 val1 val2 val3
1302 * Store Store Store \ | /
1309 * This reduces the number of stores and allows for predicated execution.
1310 * Moves Stores back to the end of a function which may be bad.
1312 * This is only possible if the predecessor blocks have only one successor.
1314 static unsigned optimize_phi(ir_node *phi, walk_env_t *wenv)
1317 ir_node *store, *old_store, *ptr, *block, *phi_block, *phiM, *phiD, *exc, *projM;
1319 ir_node **inM, **inD, **projMs;
1321 dbg_info *db = NULL;
1323 block_info_t *bl_info;
1326 /* Must be a memory Phi */
1327 if (get_irn_mode(phi) != mode_M)
1330 n = get_Phi_n_preds(phi);
1334 /* must be only one user */
1335 projM = get_Phi_pred(phi, 0);
1336 if (get_irn_n_edges(projM) != 1)
1339 store = skip_Proj(projM);
1341 if (!is_Store(store))
1344 block = get_nodes_block(store);
1346 /* abort on dead blocks */
1347 if (is_Block_dead(block))
1350 /* check if the block is post dominated by Phi-block
1351 and has no exception exit */
1352 bl_info = get_irn_link(block);
1353 if (bl_info->flags & BLOCK_HAS_EXC)
1356 phi_block = get_nodes_block(phi);
1357 if (! block_strictly_postdominates(phi_block, block))
1360 /* this is the address of the store */
1361 ptr = get_Store_ptr(store);
1362 mode = get_irn_mode(get_Store_value(store));
1363 info = get_irn_link(store);
1364 exc = info->exc_block;
1366 for (i = 1; i < n; ++i) {
1367 ir_node *pred = get_Phi_pred(phi, i);
1369 if (get_irn_n_edges(pred) != 1)
1372 pred = skip_Proj(pred);
1373 if (!is_Store(pred))
1376 if (ptr != get_Store_ptr(pred) || mode != get_irn_mode(get_Store_value(pred)))
1379 info = get_irn_link(pred);
1381 /* check, if all stores have the same exception flow */
1382 if (exc != info->exc_block)
1385 /* abort on dead blocks */
1386 block = get_nodes_block(pred);
1387 if (is_Block_dead(block))
1390 /* check if the block is post dominated by Phi-block
1391 and has no exception exit. Note that block must be different from
1392 Phi-block, else we would move a Store from end End of a block to its
1394 bl_info = get_irn_link(block);
1395 if (bl_info->flags & BLOCK_HAS_EXC)
1397 if (block == phi_block || ! block_postdominates(phi_block, block))
1402 * ok, when we are here, we found all predecessors of a Phi that
1403 * are Stores to the same address and size. That means whatever
1404 * we do before we enter the block of the Phi, we do a Store.
1405 * So, we can move the Store to the current block:
1407 * val1 val2 val3 val1 val2 val3
1409 * | Str | | Str | | Str | \ | /
1415 * Is only allowed if the predecessor blocks have only one successor.
1418 NEW_ARR_A(ir_node *, projMs, n);
1419 NEW_ARR_A(ir_node *, inM, n);
1420 NEW_ARR_A(ir_node *, inD, n);
1421 NEW_ARR_A(int, idx, n);
1423 /* Prepare: Collect all Store nodes. We must do this
1424 first because we otherwise may loose a store when exchanging its
1427 for (i = n - 1; i >= 0; --i) {
1430 projMs[i] = get_Phi_pred(phi, i);
1431 assert(is_Proj(projMs[i]));
1433 store = get_Proj_pred(projMs[i]);
1434 info = get_irn_link(store);
1436 inM[i] = get_Store_mem(store);
1437 inD[i] = get_Store_value(store);
1438 idx[i] = info->exc_idx;
1440 block = get_nodes_block(phi);
1442 /* second step: create a new memory Phi */
1443 phiM = new_rd_Phi(get_irn_dbg_info(phi), current_ir_graph, block, n, inM, mode_M);
1445 /* third step: create a new data Phi */
1446 phiD = new_rd_Phi(get_irn_dbg_info(phi), current_ir_graph, block, n, inD, mode);
1448 /* rewire memory and kill the node */
1449 for (i = n - 1; i >= 0; --i) {
1450 ir_node *proj = projMs[i];
1453 ir_node *store = get_Proj_pred(proj);
1454 exchange(proj, inM[i]);
1459 /* fourth step: create the Store */
1460 store = new_rd_Store(db, current_ir_graph, block, phiM, ptr, phiD);
1462 co_set_irn_name(store, co_get_irn_ident(old_store));
1465 projM = new_rd_Proj(NULL, current_ir_graph, block, store, mode_M, pn_Store_M);
1467 info = get_ldst_info(store, &wenv->obst);
1468 info->projs[pn_Store_M] = projM;
1470 /* fifths step: repair exception flow */
1472 ir_node *projX = new_rd_Proj(NULL, current_ir_graph, block, store, mode_X, pn_Store_X_except);
1474 info->projs[pn_Store_X_except] = projX;
1475 info->exc_block = exc;
1476 info->exc_idx = idx[0];
1478 for (i = 0; i < n; ++i) {
1479 set_Block_cfgpred(exc, idx[i], projX);
1483 /* the exception block should be optimized as some inputs are identical now */
1489 /* sixth step: replace old Phi */
1490 exchange(phi, projM);
1492 return res | DF_CHANGED;
1493 } /* optimize_phi */
1496 * walker, do the optimizations
1498 static void do_load_store_optimize(ir_node *n, void *env) {
1499 walk_env_t *wenv = env;
1501 switch (get_irn_opcode(n)) {
1504 wenv->changes |= optimize_load(n);
1508 wenv->changes |= optimize_store(n);
1512 wenv->changes |= optimize_phi(n, wenv);
1518 } /* do_load_store_optimize */
1521 typedef struct scc {
1522 ir_node *head; /**< the head of the list */
1525 /** A node entry. */
1526 typedef struct node_entry {
1527 unsigned DFSnum; /**< the DFS number of this node */
1528 unsigned low; /**< the low number of this node */
1529 ir_node *header; /**< the header of this node */
1530 int in_stack; /**< flag, set if the node is on the stack */
1531 ir_node *next; /**< link to the next node the the same scc */
1532 scc *pscc; /**< the scc of this node */
1533 unsigned POnum; /**< the post order number for blocks */
1536 /** A loop entry. */
1537 typedef struct loop_env {
1538 ir_phase ph; /**< the phase object */
1539 ir_node **stack; /**< the node stack */
1540 int tos; /**< tos index */
1541 unsigned nextDFSnum; /**< the current DFS number */
1542 unsigned POnum; /**< current post order number */
1544 unsigned changes; /**< a bitmask of graph changes */
1548 * Gets the node_entry of a node
1550 static node_entry *get_irn_ne(ir_node *irn, loop_env *env) {
1551 ir_phase *ph = &env->ph;
1552 node_entry *e = phase_get_irn_data(&env->ph, irn);
1555 e = phase_alloc(ph, sizeof(*e));
1556 memset(e, 0, sizeof(*e));
1557 phase_set_irn_data(ph, irn, e);
1563 * Push a node onto the stack.
1565 * @param env the loop environment
1566 * @param n the node to push
1568 static void push(loop_env *env, ir_node *n) {
1571 if (env->tos == ARR_LEN(env->stack)) {
1572 int nlen = ARR_LEN(env->stack) * 2;
1573 ARR_RESIZE(ir_node *, env->stack, nlen);
1575 env->stack[env->tos++] = n;
1576 e = get_irn_ne(n, env);
1581 * pop a node from the stack
1583 * @param env the loop environment
1585 * @return The topmost node
1587 static ir_node *pop(loop_env *env) {
1588 ir_node *n = env->stack[--env->tos];
1589 node_entry *e = get_irn_ne(n, env);
1596 * Check if irn is a region constant.
1597 * The block or irn must strictly dominate the header block.
1599 * @param irn the node to check
1600 * @param header_block the header block of the induction variable
1602 static int is_rc(ir_node *irn, ir_node *header_block) {
1603 ir_node *block = get_nodes_block(irn);
1605 return (block != header_block) && block_dominates(block, header_block);
1608 typedef struct phi_entry phi_entry;
1610 ir_node *phi; /**< A phi with a region const memory. */
1611 int pos; /**< The position of the region const memory */
1612 ir_node *load; /**< the newly created load for this phi */
1617 * Move loops out of loops if possible.
1619 * @param pscc the loop described by an SCC
1620 * @param env the loop environment
1622 static void move_loads_out_of_loops(scc *pscc, loop_env *env) {
1623 ir_node *phi, *load, *next, *other, *next_other;
1626 phi_entry *phi_list = NULL;
1628 /* collect all outer memories */
1629 for (phi = pscc->head; phi != NULL; phi = next) {
1630 node_entry *ne = get_irn_ne(phi, env);
1633 /* check all memory Phi's */
1637 assert(get_irn_mode(phi) == mode_M && "DFS geturn non-memory Phi");
1639 for (j = get_irn_arity(phi) - 1; j >= 0; --j) {
1640 ir_node *pred = get_irn_n(phi, j);
1641 node_entry *pe = get_irn_ne(pred, env);
1643 if (pe->pscc != ne->pscc) {
1644 /* not in the same SCC, is region const */
1645 phi_entry *pe = phase_alloc(&env->ph, sizeof(*pe));
1649 pe->next = phi_list;
1654 /* no Phis no fun */
1655 assert(phi_list != NULL && "DFS found a loop without Phi");
1657 for (load = pscc->head; load; load = next) {
1659 node_entry *ne = get_irn_ne(load, env);
1662 if (is_Load(load)) {
1663 ldst_info_t *info = get_irn_link(load);
1664 ir_node *ptr = get_Load_ptr(load);
1666 /* for now, we cannot handle Loads with exceptions */
1667 if (info->projs[pn_Load_res] == NULL || info->projs[pn_Load_X_regular] != NULL || info->projs[pn_Load_X_except] != NULL)
1670 /* for now, we can only handle Load(Global) */
1671 if (! is_Global(ptr))
1673 ent = get_Global_entity(ptr);
1674 load_mode = get_Load_mode(load);
1675 for (other = pscc->head; other != NULL; other = next_other) {
1676 node_entry *ne = get_irn_ne(other, env);
1677 next_other = ne->next;
1679 if (is_Store(other)) {
1680 ir_alias_relation rel = get_alias_relation(
1682 get_Store_ptr(other),
1683 get_irn_mode(get_Store_value(other)),
1685 /* if the might be an alias, we cannot pass this Store */
1686 if (rel != ir_no_alias)
1689 /* only pure Calls are allowed here, so ignore them */
1691 if (other == NULL) {
1696 /* for now, we cannot handle more than one input */
1697 if (phi_list->next != NULL)
1700 /* yep, no aliasing Store found, Load can be moved */
1701 DB((dbg, LEVEL_1, " Found a Load that could be moved: %+F\n", load));
1703 db = get_irn_dbg_info(load);
1704 for (pe = phi_list; pe != NULL; pe = pe->next) {
1706 ir_node *phi = pe->phi;
1707 ir_node *blk = get_nodes_block(phi);
1708 ir_node *pred = get_Block_cfgpred_block(blk, pos);
1711 pe->load = irn = new_rd_Load(db, current_ir_graph, pred, get_Phi_pred(phi, pos), ptr, load_mode);
1712 ninfo = get_ldst_info(irn, phase_obst(&env->ph));
1714 ninfo->projs[pn_Load_M] = mem = new_r_Proj(current_ir_graph, pred, irn, mode_M, pn_Load_M);
1715 set_Phi_pred(phi, pos, mem);
1717 ninfo->projs[pn_Load_res] = new_r_Proj(current_ir_graph, pred, irn, load_mode, pn_Load_res);
1719 DB((dbg, LEVEL_1, " Created %+F in %+F\n", irn, pred));
1722 /* now kill the old Load */
1723 exchange(info->projs[pn_Load_M], get_Load_mem(load));
1724 exchange(info->projs[pn_Load_res], ninfo->projs[pn_Load_res]);
1726 env->changes |= DF_CHANGED;
1730 } /* move_loads_out_of_loops */
1733 * Process a loop SCC.
1735 * @param pscc the SCC
1736 * @param env the loop environment
1738 static void process_loop(scc *pscc, loop_env *env) {
1739 ir_node *irn, *next, *header = NULL;
1740 node_entry *b, *h = NULL;
1741 int j, only_phi, num_outside, process = 0;
1744 /* find the header block for this scc */
1745 for (irn = pscc->head; irn; irn = next) {
1746 node_entry *e = get_irn_ne(irn, env);
1747 ir_node *block = get_nodes_block(irn);
1750 b = get_irn_ne(block, env);
1753 if (h->POnum < b->POnum) {
1764 /* check if this scc contains only Phi, Loads or Stores nodes */
1768 for (irn = pscc->head; irn; irn = next) {
1769 node_entry *e = get_irn_ne(irn, env);
1772 switch (get_irn_opcode(irn)) {
1774 if (is_Call_pure(irn)) {
1775 /* pure calls can be treated like loads */
1779 /* non-pure calls must be handle like may-alias Stores */
1782 /* cannot handle CopyB yet */
1786 if (get_Load_volatility(irn) == volatility_is_volatile) {
1787 /* cannot handle loops with volatile Loads */
1793 if (get_Store_volatility(irn) == volatility_is_volatile) {
1794 /* cannot handle loops with volatile Stores */
1803 for (j = get_irn_arity(irn) - 1; j >= 0; --j) {
1804 ir_node *pred = get_irn_n(irn, j);
1805 node_entry *pe = get_irn_ne(pred, env);
1807 if (pe->pscc != e->pscc) {
1808 /* not in the same SCC, must be a region const */
1809 if (! is_rc(pred, header)) {
1810 /* not a memory loop */
1816 } else if (out_rc != pred) {
1827 /* found a memory loop */
1828 DB((dbg, LEVEL_2, " Found a memory loop:\n "));
1829 if (only_phi && num_outside == 1) {
1830 /* a phi cycle with only one real predecessor can be collapsed */
1831 DB((dbg, LEVEL_2, " Found an USELESS Phi cycle:\n "));
1833 for (irn = pscc->head; irn; irn = next) {
1834 node_entry *e = get_irn_ne(irn, env);
1837 exchange(irn, out_rc);
1839 env->changes |= DF_CHANGED;
1843 /* set the header for every node in this scc */
1844 for (irn = pscc->head; irn; irn = next) {
1845 node_entry *e = get_irn_ne(irn, env);
1848 DB((dbg, LEVEL_2, " %+F,", irn));
1850 DB((dbg, LEVEL_2, "\n"));
1852 move_loads_out_of_loops(pscc, env);
1856 } /* process_loop */
1861 * @param pscc the SCC
1862 * @param env the loop environment
1864 static void process_scc(scc *pscc, loop_env *env) {
1865 ir_node *head = pscc->head;
1866 node_entry *e = get_irn_ne(head, env);
1868 #ifdef DEBUG_libfirm
1870 ir_node *irn, *next;
1872 DB((dbg, LEVEL_4, " SCC at %p:\n ", pscc));
1873 for (irn = pscc->head; irn; irn = next) {
1874 node_entry *e = get_irn_ne(irn, env);
1878 DB((dbg, LEVEL_4, " %+F,", irn));
1880 DB((dbg, LEVEL_4, "\n"));
1884 if (e->next != NULL) {
1885 /* this SCC has more than one member */
1886 process_loop(pscc, env);
1891 * Do Tarjan's SCC algorithm and drive load/store optimization.
1893 * @param irn start at this node
1894 * @param env the loop environment
1896 static void dfs(ir_node *irn, loop_env *env)
1899 node_entry *node = get_irn_ne(irn, env);
1901 mark_irn_visited(irn);
1903 node->DFSnum = env->nextDFSnum++;
1904 node->low = node->DFSnum;
1908 if (is_Phi(irn) || is_Sync(irn)) {
1909 n = get_irn_arity(irn);
1910 for (i = 0; i < n; ++i) {
1911 ir_node *pred = get_irn_n(irn, i);
1912 node_entry *o = get_irn_ne(pred, env);
1914 if (irn_not_visited(pred)) {
1916 node->low = MIN(node->low, o->low);
1918 if (o->DFSnum < node->DFSnum && o->in_stack)
1919 node->low = MIN(o->DFSnum, node->low);
1921 } else if (is_fragile_op(irn)) {
1922 ir_node *pred = get_fragile_op_mem(irn);
1923 node_entry *o = get_irn_ne(pred, env);
1925 if (irn_not_visited(pred)) {
1927 node->low = MIN(node->low, o->low);
1929 if (o->DFSnum < node->DFSnum && o->in_stack)
1930 node->low = MIN(o->DFSnum, node->low);
1931 } else if (is_Proj(irn)) {
1932 ir_node *pred = get_Proj_pred(irn);
1933 node_entry *o = get_irn_ne(pred, env);
1935 if (irn_not_visited(pred)) {
1937 node->low = MIN(node->low, o->low);
1939 if (o->DFSnum < node->DFSnum && o->in_stack)
1940 node->low = MIN(o->DFSnum, node->low);
1943 /* IGNORE predecessors */
1946 if (node->low == node->DFSnum) {
1947 scc *pscc = phase_alloc(&env->ph, sizeof(*pscc));
1955 e = get_irn_ne(x, env);
1957 e->next = pscc->head;
1961 process_scc(pscc, env);
1966 * Do the DFS on the memory edges a graph.
1968 * @param irg the graph to process
1969 * @param env the loop environment
1971 static void do_dfs(ir_graph *irg, loop_env *env) {
1972 ir_graph *rem = current_ir_graph;
1973 ir_node *endblk, *end;
1976 current_ir_graph = irg;
1977 inc_irg_visited(irg);
1979 /* visit all memory nodes */
1980 endblk = get_irg_end_block(irg);
1981 for (i = get_Block_n_cfgpreds(endblk) - 1; i >= 0; --i) {
1982 ir_node *pred = get_Block_cfgpred(endblk, i);
1984 pred = skip_Proj(pred);
1985 if (is_Return(pred))
1986 dfs(get_Return_mem(pred), env);
1987 else if (is_Raise(pred))
1988 dfs(get_Raise_mem(pred), env);
1989 else if (is_fragile_op(pred))
1990 dfs(get_fragile_op_mem(pred), env);
1992 assert(0 && "Unknown EndBlock predecessor");
1996 /* visit the keep-alives */
1997 end = get_irg_end(irg);
1998 for (i = get_End_n_keepalives(end) - 1; i >= 0; --i) {
1999 ir_node *ka = get_End_keepalive(end, i);
2001 if (is_Phi(ka) && irn_not_visited(ka))
2004 current_ir_graph = rem;
2008 * Initialize new phase data. We do this always explicit, so return NULL here
2010 static void *init_loop_data(ir_phase *ph, const ir_node *irn, void *data) {
2015 } /* init_loop_data */
2018 * Optimize Loads/Stores in loops.
2020 * @param irg the graph
2022 static int optimize_loops(ir_graph *irg) {
2025 env.stack = NEW_ARR_F(ir_node *, 128);
2030 phase_init(&env.ph, "ldstopt", irg, PHASE_DEFAULT_GROWTH, init_loop_data, NULL);
2032 /* calculate the SCC's and drive loop optimization. */
2035 DEL_ARR_F(env.stack);
2036 phase_free(&env.ph);
2039 } /* optimize_loops */
2042 * do the load store optimization
2044 void optimize_load_store(ir_graph *irg) {
2047 FIRM_DBG_REGISTER(dbg, "firm.opt.ldstopt");
2049 assert(get_irg_phase_state(irg) != phase_building);
2050 assert(get_irg_pinned(irg) != op_pin_state_floats &&
2051 "LoadStore optimization needs pinned graph");
2053 /* we need landing pads */
2054 remove_critical_cf_edges(irg);
2058 /* for Phi optimization post-dominators are needed ... */
2059 assure_postdoms(irg);
2061 if (get_opt_alias_analysis()) {
2062 assure_irg_address_taken_computed(irg);
2063 assure_irp_globals_address_taken_computed();
2066 obstack_init(&env.obst);
2069 /* init the links, then collect Loads/Stores/Proj's in lists */
2071 irg_walk_graph(irg, firm_clear_link, collect_nodes, &env);
2073 /* now we have collected enough information, optimize */
2074 irg_walk_graph(irg, NULL, do_load_store_optimize, &env);
2076 env.changes |= optimize_loops(irg);
2078 obstack_free(&env.obst, NULL);
2080 /* Handle graph state */
2082 set_irg_outs_inconsistent(irg);
2085 if (env.changes & CF_CHANGED) {
2086 /* is this really needed: Yes, control flow changed, block might
2087 have Bad() predecessors. */
2088 set_irg_doms_inconsistent(irg);
2090 } /* optimize_load_store */