2 * Copyright (C) 1995-2011 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 Scalar replacement of compounds.
23 * @author Beyhan Veliev, Michael Beck
30 #include "iroptimize.h"
31 #include "scalar_replace.h"
50 static unsigned get_vnum(const ir_node *node)
52 return (unsigned)PTR_TO_INT(get_irn_link(node));
55 static void set_vnum(ir_node *node, unsigned vnum)
57 set_irn_link(node, INT_TO_PTR(vnum));
61 * A path element entry: it is either an entity
62 * or a tarval, because we evaluate only constant array
63 * accesses like a.b.c[8].d
71 * An access path, used to assign value numbers
72 * to variables that will be scalar replaced.
74 typedef struct path_t {
75 unsigned vnum; /**< The value number. */
76 size_t path_len; /**< The length of the access path. */
77 path_elem_t path[1]; /**< The path. */
80 /** The size of a path in bytes. */
81 static size_t path_size(path_t *p)
83 return sizeof(*p) + sizeof(p->path[0]) * (p->path_len-1);
86 typedef struct scalars_t {
87 ir_entity *ent; /**< A entity for scalar replacement. */
90 DEBUG_ONLY(static firm_dbg_module_t *dbg;)
95 * @return 0 if they are identically
97 static int path_cmp(const void *elt, const void *key, size_t size)
99 const path_t *p1 = (const path_t*)elt;
100 const path_t *p2 = (const path_t*)key;
103 /* we can use memcmp here, because identical tarvals should have identical addresses */
104 return memcmp(p1->path, p2->path, p1->path_len * sizeof(p1->path[0]));
108 * Compare two elements of the scalars_t set.
110 * @return 0 if they are identically
112 static int ent_cmp(const void *elt, const void *key, size_t size)
114 const scalars_t *c1 = (const scalars_t*)elt;
115 const scalars_t *c2 = (const scalars_t*)key;
118 return c1->ent != c2->ent;
122 * Calculate a hash value for a path.
124 static unsigned path_hash(const path_t *path)
129 for (i = 0; i < path->path_len; ++i)
130 hash ^= (unsigned)PTR_TO_INT(path->path[i].ent);
136 * Returns non-zero, if all indeces of a Sel node are constants.
138 * @param sel the Sel node that will be checked
140 static bool is_const_sel(ir_node *sel)
142 int i, n = get_Sel_n_indexs(sel);
144 for (i = 0; i < n; ++i) {
145 ir_node *idx = get_Sel_index(sel, i);
154 * Check the mode of a Load/Store with the mode of the entity
156 * If the mode of the entity and the Load/Store mode do not match, we
157 * have the bad reinterpret case:
160 * char b = *(char *)&i;
162 * We do NOT count this as one value and return address_taken
164 * However, we support an often used case. If the mode is two-complement
165 * we allow casts between signed/unsigned.
167 * @param mode the mode of the Load/Store
168 * @param ent_mode the mode of the accessed entity
170 static bool check_load_store_mode(ir_mode *mode, ir_mode *ent_mode)
172 if (ent_mode != mode) {
173 if (ent_mode == NULL ||
174 get_mode_size_bits(ent_mode) != get_mode_size_bits(mode) ||
175 get_mode_arithmetic(ent_mode) != irma_twos_complement ||
176 get_mode_arithmetic(mode) != irma_twos_complement)
183 * Returns non-zero, if the address of an entity
184 * represented by a Sel node (or its successor Sels) is taken.
186 bool is_address_taken(ir_node *sel)
189 ir_mode *emode, *mode;
193 if (! is_const_sel(sel))
196 for (i = get_irn_n_outs(sel) - 1; i >= 0; --i) {
197 ir_node *succ = get_irn_out(sel, i);
199 switch (get_irn_opcode(succ)) {
201 /* do not remove volatile variables */
202 if (get_Load_volatility(succ) == volatility_is_volatile)
204 /* check if this load is not a hidden conversion */
205 mode = get_Load_mode(succ);
206 ent = get_Sel_entity(sel);
207 emode = get_type_mode(get_entity_type(ent));
208 if (! check_load_store_mode(mode, emode))
213 /* check that Sel is not the Store's value */
214 value = get_Store_value(succ);
217 /* do not remove volatile variables */
218 if (get_Store_volatility(succ) == volatility_is_volatile)
220 /* check if this Store is not a hidden conversion */
221 mode = get_irn_mode(value);
222 ent = get_Sel_entity(sel);
223 emode = get_type_mode(get_entity_type(ent));
224 if (! check_load_store_mode(mode, emode))
230 ir_entity *entity = get_Sel_entity(succ);
231 /* we can't handle unions correctly yet -> address taken */
232 if (is_Union_type(get_entity_owner(entity)))
235 /* Check the Sel successor of Sel */
236 res = is_address_taken(succ);
243 /* The address of an entity is given as a parameter.
244 * As long as we do not have analyses that can tell what
245 * is done with parameters, think is taken.
246 * One special case: If the Call type tells that it's a
247 * value parameter, the address is NOT taken.
252 int res = is_address_taken(succ);
259 /* Non-optimized Tuple, happens in inlining */
260 for (input_nr = get_Tuple_n_preds(succ) - 1; input_nr >= 0; --input_nr) {
261 ir_node *pred = get_Tuple_pred(succ, input_nr);
264 /* we found one input */
265 for (k = get_irn_n_outs(succ) - 1; k >= 0; --k) {
266 ir_node *proj = get_irn_out(succ, k);
268 if (is_Proj(proj) && get_Proj_proj(proj) == input_nr) {
269 int res = is_address_taken(proj);
279 /* another op, the address is taken */
287 * Link all leave Sels with the entity.
289 * @param ent the entity that will be scalar replaced
290 * @param sel a Sel node that selects some fields of this entity
292 static bool link_all_leave_sels(ir_entity *ent, ir_node *sel)
295 bool is_leave = true;
297 for (i = get_irn_n_outs(sel) - 1; i >= 0; --i) {
298 ir_node *succ = get_irn_out(sel, i);
301 /* the current leave has further Sel's, no leave */
303 link_all_leave_sels(ent, succ);
304 } else if (is_Id(succ)) {
305 is_leave &= link_all_leave_sels(ent, succ);
313 /* we know we are at a leave, because this function is only
314 * called if the address is NOT taken, so sel's successor(s)
315 * must be Loads or Stores
317 set_irn_link(sel, get_entity_link(ent));
318 set_entity_link(ent, sel);
323 /* we need a special address that serves as an address taken marker */
325 static void *ADDRESS_TAKEN = &_x;
328 * Find possible scalar replacements.
330 * @param irg an IR graph
332 * This function finds variables on the (members of the) frame type
333 * that can be scalar replaced, because their address is never taken.
334 * If such a variable is found, its entity link will hold a list of all
335 * Sel nodes, that selects the atomic fields of this entity.
336 * Otherwise, the link will be ADDRESS_TAKEN or NULL.
338 * @return non-zero if at least one entity could be replaced
341 static int find_possible_replacements(ir_graph *irg)
347 long static_link_arg;
351 * First, clear the link field of all interesting entities.
353 frame_tp = get_irg_frame_type(irg);
354 for (mem_idx = get_class_n_members(frame_tp); mem_idx > 0;) {
355 ir_entity *ent = get_class_member(frame_tp, --mem_idx);
356 set_entity_link(ent, NULL);
359 /* check for inner functions:
360 * FIXME: need a way to get the argument position for the static link */
362 for (mem_idx = get_class_n_members(frame_tp); mem_idx > 0;) {
363 ir_entity *ent = get_class_member(frame_tp, --mem_idx);
364 if (is_method_entity(ent)) {
365 ir_graph *inner_irg = get_entity_irg(ent);
369 assure_irg_properties(inner_irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
370 args = get_irg_args(inner_irg);
371 for (j = get_irn_n_outs(args) - 1; j >= 0; --j) {
372 ir_node *arg = get_irn_out(args, j);
374 if (get_Proj_proj(arg) == static_link_arg) {
376 for (k = get_irn_n_outs(arg) - 1; k >= 0; --k) {
377 ir_node *succ = get_irn_out(arg, k);
380 ir_entity *ent = get_Sel_entity(succ);
382 if (get_entity_owner(ent) == frame_tp) {
383 /* found an access to the outer frame */
384 set_entity_link(ent, ADDRESS_TAKEN);
394 * Check the ir_graph for Sel nodes. If the entity of Sel
395 * isn't a scalar replacement set the link of this entity
396 * equal ADDRESS_TAKEN.
398 irg_frame = get_irg_frame(irg);
399 for (i = get_irn_n_outs(irg_frame) - 1; i >= 0; --i) {
400 ir_node *succ = get_irn_out(irg_frame, i);
403 ir_entity *ent = get_Sel_entity(succ);
406 /* we are only interested in entities on the frame, NOT
408 if (get_entity_owner(ent) != frame_tp)
411 if (get_entity_link(ent) == ADDRESS_TAKEN)
414 ent_type = get_entity_type(ent);
416 /* we can handle arrays, structs and atomic types yet */
417 if (is_Array_type(ent_type) || is_Struct_type(ent_type) || is_atomic_type(ent_type)) {
418 if (is_address_taken(succ)) {
420 if (get_entity_link(ent))
422 set_entity_link(ent, ADDRESS_TAKEN);
424 /* possible found one */
425 if (get_entity_link(ent) == NULL)
427 link_all_leave_sels(ent, succ);
437 * Return a path from the Sel node "sel" to its root.
439 * @param sel the Sel node
440 * @param len the length of the path so far
442 static path_t *find_path(ir_node *sel, size_t len)
447 ir_node *pred = get_Sel_ptr(sel);
449 /* the current Sel node will add some path elements */
450 n = get_Sel_n_indexs(sel);
453 if (! is_Sel(pred)) {
454 /* we found the root */
455 res = XMALLOCF(path_t, path, len);
458 res = find_path(pred, len);
460 assert(len <= res->path_len);
461 pos = res->path_len - len;
463 res->path[pos++].ent = get_Sel_entity(sel);
464 for (i = 0; i < n; ++i) {
465 ir_node *index = get_Sel_index(sel, i);
467 res->path[pos++].tv = get_Const_tarval(index);
474 * Allocate value numbers for the leaves
475 * in our found entities.
477 * @param sels a set that will contain all Sels that have a value number
478 * @param ent the entity that will be scalar replaced
479 * @param vnum the first value number we can assign
480 * @param modes a flexible array, containing all the modes of
483 * @return the next free value number
485 static unsigned allocate_value_numbers(pset *sels, ir_entity *ent, unsigned vnum, ir_mode ***modes)
489 set *pathes = new_set(path_cmp, 8);
491 DB((dbg, SET_LEVEL_3, " Visiting Sel nodes of entity %+F\n", ent));
492 /* visit all Sel nodes in the chain of the entity */
493 for (sel = (ir_node*)get_entity_link(ent); sel != NULL; sel = next) {
494 next = (ir_node*)get_irn_link(sel);
496 /* we must mark this sel for later */
497 pset_insert_ptr(sels, sel);
499 key = find_path(sel, 0);
500 path = set_find(path_t, pathes, key, path_size(key), path_hash(key));
503 set_vnum(sel, path->vnum);
504 DB((dbg, SET_LEVEL_3, " %+F represents value %u\n", sel, path->vnum));
508 (void)set_insert(path_t, pathes, key, path_size(key), path_hash(key));
510 set_vnum(sel, key->vnum);
511 DB((dbg, SET_LEVEL_3, " %+F represents value %u\n", sel, key->vnum));
513 ARR_EXTO(ir_mode *, *modes, (key->vnum + 15) & ~15);
515 (*modes)[key->vnum] = get_type_mode(get_entity_type(get_Sel_entity(sel)));
517 assert((*modes)[key->vnum] && "Value is not atomic");
523 DB((dbg, SET_LEVEL_2, " %s", get_entity_name(key->path[0].ent)));
524 for (i = 1; i < key->path_len; ++i) {
525 if (is_entity(key->path[i].ent))
526 DB((dbg, SET_LEVEL_2, ".%s", get_entity_name(key->path[i].ent)));
528 DB((dbg, SET_LEVEL_2, "[%ld]", get_tarval_long(key->path[i].tv)));
530 DB((dbg, SET_LEVEL_2, " = %u (%s)\n", PTR_TO_INT(get_irn_link(sel)), get_mode_name((*modes)[key->vnum])));
532 #endif /* DEBUG_libfirm */
538 set_entity_link(ent, NULL);
543 * environment for memory walker
545 typedef struct env_t {
546 unsigned nvals; /**< number of values */
547 ir_mode **modes; /**< the modes of the values */
548 pset *sels; /**< A set of all Sel nodes that have a value number */
552 * topological post-walker.
554 static void walker(ir_node *node, void *ctx)
556 env_t *env = (env_t*)ctx;
557 ir_graph *irg = get_irn_irg(node);
558 ir_node *addr, *block, *mem, *val;
563 /* a load, check if we can resolve it */
564 addr = get_Load_ptr(node);
566 DB((dbg, SET_LEVEL_3, " checking %+F for replacement ", node));
567 if (! is_Sel(addr)) {
568 DB((dbg, SET_LEVEL_3, "no Sel input (%+F)\n", addr));
572 if (! pset_find_ptr(env->sels, addr)) {
573 DB((dbg, SET_LEVEL_3, "Sel %+F has no VNUM\n", addr));
577 /* ok, we have a Load that will be replaced */
578 vnum = get_vnum(addr);
579 assert(vnum < env->nvals);
581 DB((dbg, SET_LEVEL_3, "replacing by value %u\n", vnum));
583 block = get_nodes_block(node);
584 set_cur_block(block);
586 /* check, if we can replace this Load */
587 val = get_value(vnum, env->modes[vnum]);
589 /* Beware: A Load can contain a hidden conversion in Firm.
590 This happens for instance in the following code:
593 unsigned j = *(unsigned *)&i;
596 mode = get_Load_mode(node);
597 if (mode != get_irn_mode(val))
598 val = new_rd_Conv(get_irn_dbg_info(node), block, val, mode);
600 mem = get_Load_mem(node);
601 turn_into_tuple(node, pn_Load_max+1);
602 set_Tuple_pred(node, pn_Load_M, mem);
603 set_Tuple_pred(node, pn_Load_res, val);
604 set_Tuple_pred(node, pn_Load_X_regular, new_r_Jmp(block));
605 set_Tuple_pred(node, pn_Load_X_except, new_r_Bad(irg, mode_X));
606 } else if (is_Store(node)) {
607 DB((dbg, SET_LEVEL_3, " checking %+F for replacement ", node));
609 /* a Store always can be replaced */
610 addr = get_Store_ptr(node);
612 if (! is_Sel(addr)) {
613 DB((dbg, SET_LEVEL_3, "no Sel input (%+F)\n", addr));
617 if (! pset_find_ptr(env->sels, addr)) {
618 DB((dbg, SET_LEVEL_3, "Sel %+F has no VNUM\n", addr));
622 vnum = get_vnum(addr);
623 assert(vnum < env->nvals);
625 DB((dbg, SET_LEVEL_3, "replacing by value %u\n", vnum));
627 block = get_nodes_block(node);
628 set_cur_block(block);
630 /* Beware: A Store can contain a hidden conversion in Firm. */
631 val = get_Store_value(node);
632 if (get_irn_mode(val) != env->modes[vnum])
633 val = new_rd_Conv(get_irn_dbg_info(node), block, val, env->modes[vnum]);
635 set_value(vnum, val);
637 mem = get_Store_mem(node);
638 turn_into_tuple(node, pn_Store_max+1);
639 set_Tuple_pred(node, pn_Store_M, mem);
640 set_Tuple_pred(node, pn_Store_X_regular, new_r_Jmp(block));
641 set_Tuple_pred(node, pn_Store_X_except, new_r_Bad(irg, mode_X));
646 * Make scalar replacement.
648 * @param sels A set containing all Sel nodes that have a value number
649 * @param nvals The number of scalars.
650 * @param modes A flexible array, containing all the modes of
653 static void do_scalar_replacements(ir_graph *irg, pset *sels, unsigned nvals,
658 ssa_cons_start(irg, (int)nvals);
665 * second step: walk over the graph blockwise in topological order
666 * and fill the array as much as possible.
668 DB((dbg, SET_LEVEL_3, "Substituting Loads and Stores in %+F\n", irg));
669 irg_walk_blkwise_graph(irg, NULL, walker, &env);
671 ssa_cons_finish(irg);
675 * Find possible scalar replacements
677 * @param irg The current ir graph.
679 void scalar_replacement_opt(ir_graph *irg)
688 ir_type *ent_type, *frame_tp;
690 assure_irg_properties(irg,
691 IR_GRAPH_PROPERTY_NO_UNREACHABLE_CODE
692 | IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
694 /* we use the link field to store the VNUM */
695 ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK);
696 irp_reserve_resources(irp, IRP_RESOURCE_ENTITY_LINK);
698 /* Find possible scalar replacements */
699 if (find_possible_replacements(irg)) {
700 DB((dbg, SET_LEVEL_1, "Scalar Replacement: %+F\n", irg));
702 /* Insert in set the scalar replacements. */
703 irg_frame = get_irg_frame(irg);
705 modes = NEW_ARR_F(ir_mode *, 16);
706 set_ent = new_set(ent_cmp, 8);
707 sels = pset_new_ptr(8);
708 frame_tp = get_irg_frame_type(irg);
710 for (i = get_irn_n_outs(irg_frame) - 1; i >= 0; --i) {
711 ir_node *succ = get_irn_out(irg_frame, i);
714 ir_entity *ent = get_Sel_entity(succ);
716 /* we are only interested in entities on the frame, NOT
718 if (get_entity_owner(ent) != frame_tp
719 || is_parameter_entity(ent))
722 if (get_entity_link(ent) == NULL || get_entity_link(ent) == ADDRESS_TAKEN)
725 ent_type = get_entity_type(ent);
728 (void)set_insert(scalars_t, set_ent, &key, sizeof(key), hash_ptr(key.ent));
731 if (is_Array_type(ent_type)) {
732 DB((dbg, SET_LEVEL_1, " found array %s\n", get_entity_name(ent)));
733 } else if (is_Struct_type(ent_type)) {
734 DB((dbg, SET_LEVEL_1, " found struct %s\n", get_entity_name(ent)));
735 } else if (is_atomic_type(ent_type))
736 DB((dbg, SET_LEVEL_1, " found atomic value %s\n", get_entity_name(ent)));
738 panic("Neither an array nor a struct or atomic value found in scalar replace");
740 #endif /* DEBUG_libfirm */
742 nvals = allocate_value_numbers(sels, ent, nvals, &modes);
746 DB((dbg, SET_LEVEL_1, " %u values will be needed\n", nvals));
748 /* If scalars were found. */
750 do_scalar_replacements(irg, sels, nvals, modes);
752 foreach_set(set_ent, scalars_t, value) {
753 free_entity(value->ent);
757 * We changed the graph, but did NOT introduce new blocks
758 * neither changed control flow, cf-backedges should be still
767 ir_free_resources(irg, IR_RESOURCE_IRN_LINK);
768 irp_free_resources(irp, IRP_RESOURCE_ENTITY_LINK);
770 confirm_irg_properties(irg, IR_GRAPH_PROPERTIES_NONE);
773 ir_graph_pass_t *scalar_replacement_opt_pass(const char *name)
775 return def_graph_pass(name ? name : "scalar_rep", scalar_replacement_opt);
778 void firm_init_scalar_replace(void)
780 FIRM_DBG_REGISTER(dbg, "firm.opt.scalar_replace");