+ ir_node *sel, *next;
+ path_t *key, *path;
+ set *pathes = new_set(path_cmp, 8);
+
+ DB((dbg, SET_LEVEL_3, " Visiting Sel nodes of entity %+F\n", ent));
+ /* visit all Sel nodes in the chain of the entity */
+ for (sel = get_entity_link(ent); sel; sel = next) {
+ next = get_irn_link(sel);
+
+ /* we must mark this sel for later */
+ pset_insert_ptr(sels, sel);
+
+ key = find_path(sel, 0);
+ path = set_find(pathes, key, PATH_SIZE(key), path_hash(key));
+
+ if (path) {
+ SET_VNUM(sel, path->vnum);
+ DB((dbg, SET_LEVEL_3, " %+F represents value %u\n", sel, path->vnum));
+ } else {
+ key->vnum = vnum++;
+
+ set_insert(pathes, key, PATH_SIZE(key), path_hash(key));
+
+ SET_VNUM(sel, key->vnum);
+ DB((dbg, SET_LEVEL_3, " %+F represents value %u\n", sel, key->vnum));
+
+ ARR_EXTO(ir_mode *, *modes, (int)((key->vnum + 15) & ~15));
+
+ (*modes)[key->vnum] = get_type_mode(get_entity_type(get_Sel_entity(sel)));
+
+ assert((*modes)[key->vnum] && "Value is not atomic");
+
+#ifdef DEBUG_libfirm
+ /* Debug output */
+ {
+ unsigned i;
+ DB((dbg, SET_LEVEL_2, " %s", get_entity_name(key->path[0].ent)));
+ for (i = 1; i < key->path_len; ++i) {
+ if (is_entity(key->path[i].ent))
+ DB((dbg, SET_LEVEL_2, ".%s", get_entity_name(key->path[i].ent)));
+ else
+ DB((dbg, SET_LEVEL_2, "[%ld]", get_tarval_long(key->path[i].tv)));
+ }
+ DB((dbg, SET_LEVEL_2, " = %u (%s)\n", PTR_TO_INT(get_irn_link(sel)), get_mode_name((*modes)[key->vnum])));
+ }
+#endif /* DEBUG_libfirm */
+ }
+ free(key);
+ }
+
+ del_set(pathes);
+ set_entity_link(ent, NULL);
+ return vnum;
+}
+
+/**
+ * A list entry for the fixing lists
+ */
+typedef struct _list_entry_t {
+ ir_node *node; /**< the node that must be fixed */
+ unsigned vnum; /**< the value number of this node */
+} list_entry_t;
+
+/**
+ * environment for memory walker
+ */
+typedef struct _env_t {
+ int nvals; /**< number of values */
+ ir_mode **modes; /**< the modes of the values */
+ pset *sels; /**< A set of all Sel nodes that have a value number */
+} env_t;
+
+/**
+ * topological post-walker.
+ */
+static void topologic_walker(ir_node *node, void *ctx) {
+ env_t *env = ctx;
+ ir_op *op = get_irn_op(node);
+ ir_node *adr, *block, *mem, *val;
+ ir_mode *mode;
+ unsigned vnum;
+
+ if (op == op_Load) {
+ /* a load, check if we can resolve it */
+ adr = get_Load_ptr(node);
+
+ DB((dbg, SET_LEVEL_3, " checking %+F for replacement ", node));
+ if (! is_Sel(adr)) {
+ DB((dbg, SET_LEVEL_3, "no Sel input (%+F)\n", adr));
+ return;
+ }
+
+ if (! pset_find_ptr(env->sels, adr)) {
+ DB((dbg, SET_LEVEL_3, "Sel %+F has no VNUM\n", adr));
+ return;
+ }
+
+ /* ok, we have a Load that will be replaced */
+ vnum = GET_VNUM(adr);
+ assert(vnum < (unsigned)env->nvals);
+
+ DB((dbg, SET_LEVEL_3, "replacing by value %u\n", vnum));
+
+ block = get_nodes_block(node);
+ set_cur_block(block);
+
+ /* check, if we can replace this Load */
+ val = get_value(vnum, env->modes[vnum]);
+
+ /* Beware: A Load can contain a hidden conversion in Firm.
+ This happens for instance in the following code:
+
+ int i;
+ unsigned j = *(unsigned *)&i;
+
+ Handle this here. */
+ mode = get_Load_mode(node);
+ if (mode != get_irn_mode(val))
+ val = new_d_Conv(get_irn_dbg_info(node), val, mode);
+
+ mem = get_Load_mem(node);
+ turn_into_tuple(node, pn_Load_max);
+ set_Tuple_pred(node, pn_Load_M, mem);
+ set_Tuple_pred(node, pn_Load_res, val);
+ set_Tuple_pred(node, pn_Load_X_regular, new_Jmp());
+ set_Tuple_pred(node, pn_Load_X_except, new_Bad());
+ } else if (op == op_Store) {
+ DB((dbg, SET_LEVEL_3, " checking %+F for replacement ", node));
+
+ /* a Store always can be replaced */
+ adr = get_Store_ptr(node);
+
+ if (! is_Sel(adr)) {
+ DB((dbg, SET_LEVEL_3, "no Sel input (%+F)\n", adr));
+ return;
+ }
+
+ if (! pset_find_ptr(env->sels, adr)) {
+ DB((dbg, SET_LEVEL_3, "Sel %+F has no VNUM\n", adr));
+ return;
+ }
+
+ vnum = GET_VNUM(adr);
+ assert(vnum < (unsigned)env->nvals);
+
+ DB((dbg, SET_LEVEL_3, "replacing by value %u\n", vnum));
+
+ /* Beware: A Store can contain a hidden conversion in Firm. */
+ val = get_Store_value(node);
+ if (get_irn_mode(val) != env->modes[vnum])
+ val = new_d_Conv(get_irn_dbg_info(node), val, env->modes[vnum]);
+
+ block = get_nodes_block(node);
+ set_cur_block(block);
+ set_value(vnum, val);
+
+ mem = get_Store_mem(node);
+ turn_into_tuple(node, pn_Store_max);
+ set_Tuple_pred(node, pn_Store_M, mem);
+ set_Tuple_pred(node, pn_Store_X_regular, new_Jmp());
+ set_Tuple_pred(node, pn_Store_X_except, new_Bad());
+ }
+}
+
+/**
+ * Make scalar replacement.
+ *
+ * @param sels A set containing all Sel nodes that have a value number
+ * @param nvals The number of scalars.
+ * @param modes A flexible array, containing all the modes of
+ * the value numbers.
+ */
+static void do_scalar_replacements(pset *sels, int nvals, ir_mode **modes) {
+ env_t env;
+
+ ssa_cons_start(current_ir_graph, nvals);
+
+ env.nvals = nvals;
+ env.modes = modes;
+ env.sels = sels;
+
+ /*
+ * second step: walk over the graph blockwise in topological order
+ * and fill the array as much as possible.
+ */
+ DB((dbg, SET_LEVEL_3, "Substituting Loads and Stores in %+F\n", current_ir_graph));
+ irg_walk_blkwise_graph(current_ir_graph, NULL, topologic_walker, &env);
+
+ ssa_cons_finish(current_ir_graph);
+}
+
+/*
+ * Find possible scalar replacements
+ *
+ * @param irg The current ir graph.
+ */
+int scalar_replacement_opt(ir_graph *irg) {
+ unsigned nvals;
+ int i;
+ scalars_t key, *value;
+ ir_node *irg_frame;
+ ir_mode **modes;
+ set *set_ent;
+ pset *sels;
+ ir_type *ent_type;
+ ir_graph *rem;
+ int res = 0;
+
+ if (! get_opt_scalar_replacement())
+ return 0;
+
+ rem = current_ir_graph;
+ current_ir_graph = irg;
+
+ /* Call algorithm that computes the out edges */
+ assure_irg_outs(irg);
+
+ /* Find possible scalar replacements */
+ if (find_possible_replacements(irg)) {
+ DB((dbg, SET_LEVEL_1, "Scalar Replacement: %s\n", get_entity_name(get_irg_entity(irg))));
+
+ /* Insert in set the scalar replacements. */
+ irg_frame = get_irg_frame(irg);
+ nvals = 0;
+ modes = NEW_ARR_F(ir_mode *, 16);
+ set_ent = new_set(ent_cmp, 8);
+ sels = pset_new_ptr(8);
+
+ for (i = get_irn_n_outs(irg_frame) - 1; i >= 0; --i) {
+ ir_node *succ = get_irn_out(irg_frame, i);
+
+ if (is_Sel(succ)) {
+ ir_entity *ent = get_Sel_entity(succ);
+
+ if (get_entity_link(ent) == NULL || get_entity_link(ent) == ADDRESS_TAKEN)
+ continue;
+
+ ent_type = get_entity_type(ent);
+
+ key.ent = ent;
+ key.ent_owner = get_entity_owner(ent);
+ set_insert(set_ent, &key, sizeof(key), HASH_PTR(key.ent));
+
+#ifdef DEBUG_libfirm
+ if (is_Array_type(ent_type)) {
+ DB((dbg, SET_LEVEL_1, " found array %s\n", get_entity_name(ent)));
+ } else if (is_Struct_type(ent_type)) {
+ DB((dbg, SET_LEVEL_1, " found struct %s\n", get_entity_name(ent)));
+ } else if (is_atomic_type(ent_type))
+ DB((dbg, SET_LEVEL_1, " found atomic value %s\n", get_entity_name(ent)));
+ else {
+ panic("Neither an array nor a struct or atomic value found in scalar replace");
+ }
+#endif /* DEBUG_libfirm */
+
+ nvals = allocate_value_numbers(sels, ent, nvals, &modes);
+ }
+ }
+
+ DB((dbg, SET_LEVEL_1, " %u values will be needed\n", nvals));
+
+ /* If scalars were found. */
+ if (nvals > 0) {
+ do_scalar_replacements(sels, nvals, modes);
+
+ foreach_set(set_ent, value) {
+ remove_class_member(value->ent_owner, value->ent);
+ }
+
+ /*
+ * We changed the graph, but did NOT introduce new blocks
+ * neither changed control flow, cf-backedges should be still
+ * consistent.
+ */
+ set_irg_outs_inconsistent(irg);
+ set_irg_loopinfo_inconsistent(irg);
+
+ res = 1;
+ }
+ del_pset(sels);
+ del_set(set_ent);
+ DEL_ARR_F(modes);
+ }
+
+ current_ir_graph = rem;
+ return res;
+}
+
+void firm_init_scalar_replace(void) {
+ FIRM_DBG_REGISTER(dbg, "firm.opt.scalar_replace");