- ldst_info_t *info = get_irn_link(load);
- ir_mode *load_mode = get_Load_mode(load);
- ir_node *pred, *mem, *ptr, *new_node;
- entity *ent;
- int res = 0;
-
- /* the address of the load to be optimized */
- ptr = get_Load_ptr(load);
-
- /*
- * Check if we can remove the exception form a Load:
- * this can be done, if the address is from an Sel(Alloc) and
- * the Sel type is a subtype of the alloc type.
- *
- * This optimizes some often used OO constructs,
- * like x = new O; x->t;
- */
- if (info->projs[pn_Load_X_except]) {
- if (get_irn_op(ptr) == op_Sel) {
- ir_node *mem = get_Sel_mem(ptr);
-
- if (get_irn_op(mem) == op_Alloc) {
- /* ok, check the types */
- entity *ent = get_Sel_entity(ptr);
- type *s_type = get_entity_type(ent);
- 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;
- }
- }
- }
- else if ((get_irn_op(skip_Proj(ptr)) == op_Alloc) ||
- ((get_irn_op(ptr) == op_Cast) && (get_irn_op(skip_Proj(get_Cast_op(ptr))) == op_Alloc))) {
- /* 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;
- }
- }
-
- /* do NOT touch volatile loads for now */
- if (get_Load_volatility(load) == volatility_is_volatile)
- return 0;
-
- if (! info->projs[pn_Load_res] && ! info->projs[pn_Load_X_except]) {
- /* a Load which value is neither used nor exception checked, remove it */
- mem = get_Load_mem(load);
- exchange(info->projs[pn_Load_M], mem);
-
- return 1;
- }
-
- /* the mem of the Load. Must still be returned after optimization */
- mem = get_Load_mem(load);
-
- /* Load from a constant polymorphic field, where we can resolve
- polymorphy. */
- 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;
- }
- if (info->projs[pn_Load_res])
- exchange(info->projs[pn_Load_res], new_node);
- return 1;
- }
-
- /* 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;
- }
-
- if (variability_constant == get_entity_variability(ent)
- && 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 */
- if (info->projs[pn_Load_M])
- exchange(info->projs[pn_Load_M], mem);
-
- /* no result :-) */
- if (info->projs[pn_Load_res]) {
- if (is_atomic_entity(ent)) {
- ir_node *c = copy_const_value(get_atomic_ent_value(ent));
-
- DBG_OPT_RC(load, c);
- exchange(info->projs[pn_Load_res], c);
-
- return 1;
- }
- }
- }
- else if (variability_constant == get_entity_variability(ent)) {
- compound_graph_path *path;
- /*
- 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);
- */
- path = get_accessed_path(ptr);
- if (path) {
- ir_node *c;
-
- assert(is_proper_compound_graph_path(path, get_compound_graph_path_length(path)-1));
- c = get_compound_ent_value_by_path(ent, path);
-
- /* printf(" cons: "); DDMN(c); */
-
- if (info->projs[pn_Load_M])
- exchange(info->projs[pn_Load_M], mem);
- if (info->projs[pn_Load_res])
- exchange(info->projs[pn_Load_res], copy_const_value(c));
- /*
- {
- int j;
- for (j = 0; j < get_compound_graph_path_length(path); ++j) {
- 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");
- }
- */
- } 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);
- if (get_irn_op(ptr) == op_SymConst &&
- get_SymConst_kind(ptr) == symconst_addr_ent) { printf(" "); DDMEO(get_SymConst_entity(ptr)); }
- printf("cannot optimize.\n");
- */
+ return get_mode_size_bits(new_mode) >= get_mode_size_bits(old_mode);
+} /* is_completely_overwritten */
+
+/**
+ * follow the memory chain as long as there are only Loads and alias free Stores.
+ *
+ * INC_MASTER() must be called before dive into
+ */
+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);
+
+ 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 ...
+ * 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 ...
+ */
+ if (get_irn_op(pred) == op_Store && get_Store_ptr(pred) == ptr &&
+ get_nodes_block(pred) == block &&
+ is_completely_overwritten(get_irn_mode(get_Store_value(pred)), mode)) {
+ /*
+ * 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);
+ exchange( pred_info->projs[pn_Store_M], get_Store_mem(pred) );
+ exchange(pred, new_Bad());
+ reduce_adr_usage(ptr);
+ return DF_CHANGED;
+ }
+ } else if (get_irn_op(pred) == op_Load && get_Load_ptr(pred) == ptr &&
+ value == pred_info->projs[pn_Load_res]) {
+ /*
+ * a Store of a value after a Load -- a write after read.
+ * We may remove the second Store, if it does not have an exception handler.
+ */
+ if (! info->projs[pn_Store_X_except]) {
+ DBG_OPT_WAR(store, pred);
+ exchange( info->projs[pn_Store_M], mem );
+ exchange(store, new_Bad());
+ reduce_adr_usage(ptr);
+ return DF_CHANGED;
+ }
+ }
+
+ if (get_irn_op(pred) == op_Store) {
+ /* 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)),
+ ptr, mode);
+ /* 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) {
+ 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);
+ }
+
+ if (get_irn_op(pred) == op_Sync) {
+ 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;
+ }