2 * Copyright (C) 1995-2007 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 * File name: ir/opt/scalar_replace.c
23 * Purpose: scalar replacement of arrays and compounds
24 * Author: Beyhan Veliev
25 * Modified by: Michael Beck
28 * Copyright: (c) 1998-2005 Universität Karlsruhe
38 #include "scalar_replace.h"
53 #define SET_VNUM(node, vnum) set_irn_link(node, INT_TO_PTR(vnum))
54 #define GET_VNUM(node) (unsigned)PTR_TO_INT(get_irn_link(node))
57 * A path element entry: it is either an entity
58 * or a tarval, because we evaluate only constant array
59 * accesses like a.b.c[8].d
67 * An access path, used to assign value numbers
68 * to variables that will be scalar replaced.
70 typedef struct _path_t {
71 unsigned vnum; /**< The value number. */
72 unsigned path_len; /**< The length of the access path. */
73 path_elem_t path[1]; /**< The path. */
76 /** The size of a path in bytes. */
77 #define PATH_SIZE(p) (sizeof(*(p)) + sizeof((p)->path[0]) * ((p)->path_len - 1))
79 typedef struct _scalars_t {
80 ir_entity *ent; /**< A entity for scalar replacement. */
81 ir_type *ent_owner; /**< The owner of this entity. */
88 * @return 0 if they are identically
90 static int path_cmp(const void *elt, const void *key, size_t size)
92 const path_t *p1 = elt;
93 const path_t *p2 = key;
95 /* we can use memcmp here, because identical tarvals should have identical addresses */
96 return memcmp(p1->path, p2->path, p1->path_len * sizeof(p1->path[0]));
100 * Compare two elements of the scalars_t set.
102 * @return 0 if they are identically
104 static int ent_cmp(const void *elt, const void *key, size_t size)
106 const scalars_t *c1 = elt;
107 const scalars_t *c2 = key;
109 return c1->ent != c2->ent;
113 * Calculate a hash value for a path.
115 static unsigned path_hash(const path_t *path)
120 for (i = 0; i < path->path_len; ++i)
121 hash ^= (unsigned)PTR_TO_INT(path->path[i].ent);
127 * Returns non-zero, if all indeces of a Sel node are constants.
129 * @param sel the Sel node that will be checked
131 static int is_const_sel(ir_node *sel) {
132 int i, n = get_Sel_n_indexs(sel);
134 for (i = 0; i < n; ++i) {
135 ir_node *idx = get_Sel_index(sel, i);
137 if (get_irn_op(idx) != op_Const)
144 * Check the mode of a Load/Store with the mode of the entity
146 * If the mode of the entity and the Load/Store mode do not match, we
147 * have the bad reinterpret case:
150 * char b = *(char *)&i;
152 * We do NOT count this as one value and return address_taken
154 * However, we support an often used case. If the mode is two-complement
155 * we allow casts between signed/unsigned.
157 * @param mode the mode of the Load/Store
158 * @param ent_mode the mode of the accessed entity
160 static int check_load_store_mode(ir_mode *mode, ir_mode *ent_mode) {
161 if (ent_mode != mode) {
162 if (ent_mode == NULL ||
163 get_mode_size_bits(ent_mode) != get_mode_size_bits(mode) ||
164 get_mode_sort(ent_mode) != get_mode_sort(mode) ||
165 get_mode_arithmetic(ent_mode) != irma_twos_complement ||
166 get_mode_arithmetic(mode) != irma_twos_complement)
173 * Returns non-zero, if the address of an entity
174 * represented by a Sel node (or it's successor Sels) is taken.
176 int is_address_taken(ir_node *sel)
179 ir_mode *emode, *mode;
183 if (! is_const_sel(sel))
186 for (i = get_irn_n_outs(sel) - 1; i >= 0; --i) {
187 ir_node *succ = get_irn_out(sel, i);
189 switch (get_irn_opcode(succ)) {
191 /* check if this load is not a hidden conversion */
192 mode = get_Load_mode(succ);
193 ent = get_Sel_entity(sel);
194 emode = get_type_mode(get_entity_type(ent));
195 if (! check_load_store_mode(mode, emode))
200 /* check that Sel is not the Store's value */
201 value = get_Store_value(succ);
204 /* check if this Store is not a hidden conversion */
205 mode = get_irn_mode(value);
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 the Sel successor of Sel */
214 int res = is_address_taken(succ);
222 /* The address of an entity is given as a parameter.
223 * As long as we do not have analyses that can tell what
224 * is done with parameters, think is taken.
229 /* another op, the address is taken */
237 * Link all leave Sels with the entity.
239 * @param ent the entity that will be scalar replaced
240 * @param sel a Sel node that selects some fields of this entity
242 static void link_all_leave_sels(ir_entity *ent, ir_node *sel)
246 n = get_irn_n_outs(sel);
247 for (i = 0; i < n; ++i) {
248 ir_node *succ = get_irn_out(sel, i);
251 link_all_leave_sels(ent, succ);
257 /* if Sel nodes with memory inputs are used, a entity can be
258 * visited more than once causing a ring here, so we use the
259 * node flag to mark linked nodes
261 if (irn_visited(sel))
264 /* we know we are at a leave, because this function is only
265 * called if the address is NOT taken, so succ must be a Load
268 set_irn_link(sel, get_entity_link(ent));
269 set_entity_link(ent, sel);
271 mark_irn_visited(sel);
275 /* we need a special address that serves as an address taken marker */
277 static void *ADDRESS_TAKEN = &_x;
280 * Find possible scalar replacements.
282 * @param irg an IR graph
284 * This function finds variables on the (members of the) frame type
285 * that can be scalar replaced, because their address is never taken.
286 * If such a variable is found, it's entity link will hold a list of all
287 * Sel nodes, that selects the atomic fields of this entity.
288 * Otherwise, the link will be ADDRESS_TAKEN or NULL.
290 * @return non-zero if at least one entity could be replaced
293 static int find_possible_replacements(ir_graph *irg)
295 ir_node *irg_frame = get_irg_frame(irg);
299 inc_irg_visited(irg);
301 n = get_irn_n_outs(irg_frame);
304 * First, clear the link field of all interesting entities.
305 * Note that we did not rely on the fact that there is only
306 * one Sel node per entity, so we might access one entity
307 * more than once here.
308 * That's why we have need two loops.
310 for (i = 0; i < n; ++i) {
311 ir_node *succ = get_irn_out(irg_frame, i);
314 ir_entity *ent = get_Sel_entity(succ);
315 set_entity_link(ent, NULL);
320 * Check the ir_graph for Sel nodes. If the entity of Sel
321 * isn't a scalar replacement set the link of this entity
322 * equal ADDRESS_TAKEN.
324 for (i = 0; i < n; ++i) {
325 ir_node *succ = get_irn_out(irg_frame, i);
328 ir_entity *ent = get_Sel_entity(succ);
331 if (get_entity_link(ent) == ADDRESS_TAKEN)
335 * Beware: in rare cases even entities on the frame might be
336 * volatile. This might happen if the entity serves as a store
337 * to a value that must survive a exception. Do not optimize
338 * such entities away.
340 if (get_entity_volatility(ent) == volatility_is_volatile) {
341 set_entity_link(ent, ADDRESS_TAKEN);
345 ent_type = get_entity_type(ent);
347 /* we can handle arrays, structs and atomic types yet */
348 if (is_Array_type(ent_type) || is_Struct_type(ent_type) || is_atomic_type(ent_type)) {
349 if (is_address_taken(succ)) {
350 if (get_entity_link(ent)) /* killing one */
352 set_entity_link(ent, ADDRESS_TAKEN);
355 /* possible found one */
356 if (get_entity_link(ent) == NULL)
358 link_all_leave_sels(ent, succ);
368 * Return a path from the Sel node sel to it's root.
370 * @param sel the Sel node
371 * @param len the length of the path so far
373 static path_t *find_path(ir_node *sel, unsigned len)
377 ir_node *pred = get_Sel_ptr(sel);
379 /* the current Sel node will add some path elements */
380 n = get_Sel_n_indexs(sel);
383 if (! is_Sel(pred)) {
384 /* we found the root */
386 res = xmalloc(sizeof(*res) + (len - 1) * sizeof(res->path));
390 res = find_path(pred, len);
392 pos = res->path_len - len;
394 res->path[pos++].ent = get_Sel_entity(sel);
395 for (i = 0; i < n; ++i) {
396 ir_node *index = get_Sel_index(sel, i);
398 res->path[pos++].tv = get_Const_tarval(index);
405 * Allocate value numbers for the leaves
406 * in our found entities.
408 * @param sels a set that will contain all Sels that have a value number
409 * @param ent the entity that will be scalar replaced
410 * @param vnum the first value number we can assign
411 * @param modes a flexible array, containing all the modes of
414 * @return the next free value number
416 static unsigned allocate_value_numbers(pset *sels, ir_entity *ent, unsigned vnum, ir_mode ***modes)
420 set *pathes = new_set(path_cmp, 8);
422 /* visit all Sel nodes in the chain of the entity */
423 for (sel = get_entity_link(ent); sel; sel = next) {
424 next = get_irn_link(sel);
426 /* we must mark this sel for later */
427 pset_insert_ptr(sels, sel);
429 key = find_path(sel, 0);
430 path = set_find(pathes, key, PATH_SIZE(key), path_hash(key));
433 SET_VNUM(sel, path->vnum);
437 set_insert(pathes, key, PATH_SIZE(key), path_hash(key));
439 SET_VNUM(sel, key->vnum);
440 ARR_EXTO(ir_mode *, *modes, (key->vnum + 15) & ~15);
442 (*modes)[key->vnum] = get_type_mode(get_entity_type(get_Sel_entity(sel)));
444 assert((*modes)[key->vnum] && "Value is not atomic");
448 if (get_opt_scalar_replacement_verbose() && get_firm_verbosity() > 1) {
450 printf(" %s", get_entity_name(key->path[0].ent));
451 for (i = 1; i < key->path_len; ++i) {
452 if (is_entity(key->path[i].ent))
453 printf(".%s", get_entity_name(key->path[i].ent));
455 printf("[%ld]", get_tarval_long(key->path[i].tv));
457 printf(" = %u (%s)\n", PTR_TO_INT(get_irn_link(sel)), get_mode_name((*modes)[key->vnum]));
459 #endif /* DEBUG_libfirm */
465 set_entity_link(ent, NULL);
470 * A list entry for the fixing lists
472 typedef struct _list_entry_t {
473 ir_node *node; /**< the node that must be fixed */
474 unsigned vnum; /**< the value number of this node */
478 * environment for memory walker
480 typedef struct _env_t {
481 struct obstack obst; /**< a obstack for the value blocks */
482 int nvals; /**< number of values */
483 ir_mode **modes; /**< the modes of the values */
484 list_entry_t *fix_phis; /**< list of all Phi nodes that must be fixed */
485 list_entry_t *fix_loads; /**< list of all Load nodes that must be fixed */
486 pset *sels; /**< A set of all Sel nodes that have a value number */
490 * topological walker.
492 static void topologic_walker(ir_node *node, void *ctx)
495 ir_op *op = get_irn_op(node);
496 ir_node *adr, *block, *mem, *unk, **value_arr, **in, *val;
503 /* a load, check if we can resolve it */
504 adr = get_Load_ptr(node);
509 if (! pset_find_ptr(env->sels, adr))
512 /* ok, we have a Load that will be replaced */
513 vnum = GET_VNUM(adr);
515 assert(vnum < (unsigned)env->nvals);
517 block = get_nodes_block(node);
518 value_arr = get_irn_link(block);
520 /* check, if we can replace this Load */
521 if (value_arr[vnum]) {
522 mem = get_Load_mem(node);
524 /* Beware: A Load can contain a hidden conversion in Firm.
525 This happens for instance in the following code:
528 unsigned j = *(unsigned *)&i;
531 val = value_arr[vnum];
532 mode = get_Load_mode(node);
533 if (mode != get_irn_mode(val))
534 val = new_d_Conv(get_irn_dbg_info(node), val, mode);
536 turn_into_tuple(node, pn_Load_max);
537 set_Tuple_pred(node, pn_Load_M, mem);
538 set_Tuple_pred(node, pn_Load_res, val);
539 set_Tuple_pred(node, pn_Load_X_except, new_Bad());
541 l = obstack_alloc(&env->obst, sizeof(*l));
545 set_irn_link(node, env->fix_loads);
548 } else if (op == op_Store) {
549 /* a Store always can be replaced */
550 adr = get_Store_ptr(node);
555 if (! pset_find_ptr(env->sels, adr))
558 vnum = GET_VNUM(adr);
560 assert(vnum < (unsigned)env->nvals);
562 block = get_nodes_block(node);
563 value_arr = get_irn_link(block);
565 /* Beware: A Store can contain a hidden conversion in Firm. */
566 val = get_Store_value(node);
567 if (get_irn_mode(val) != env->modes[vnum])
568 val = new_d_Conv(get_irn_dbg_info(node), val, env->modes[vnum]);
569 value_arr[vnum] = val;
571 mem = get_Store_mem(node);
573 turn_into_tuple(node, pn_Store_max);
574 set_Tuple_pred(node, pn_Store_M, mem);
575 set_Tuple_pred(node, pn_Store_X_except, new_Bad());
576 } else if (op == op_Phi && get_irn_mode(node) == mode_M) {
578 * found a memory Phi: Here, we must create new Phi nodes
580 block = get_nodes_block(node);
581 value_arr = get_irn_link(block);
583 n = get_Block_n_cfgpreds(block);
585 in = alloca(sizeof(*in) * n);
587 for (i = env->nvals - 1; i >= 0; --i) {
588 unk = new_Unknown(env->modes[i]);
589 for (j = n - 1; j >= 0; --j)
592 value_arr[i] = new_r_Phi(current_ir_graph, block, n, in, env->modes[i]);
594 l = obstack_alloc(&env->obst, sizeof(*l));
595 l->node = value_arr[i];
598 set_irn_link(value_arr[i], env->fix_phis);
605 * Walker: allocate the value array for every block.
607 static void alloc_value_arr(ir_node *block, void *ctx)
610 ir_node **var_arr = obstack_alloc(&env->obst, sizeof(*var_arr) * env->nvals);
612 /* the value array is empty at start */
613 memset(var_arr, 0, sizeof(*var_arr) * env->nvals);
614 set_irn_link(block, var_arr);
618 * searches through blocks beginning from block for value
619 * vnum and return it.
621 static ir_node *find_vnum_value(ir_node *block, unsigned vnum)
627 if (Block_not_block_visited(block)) {
628 mark_Block_block_visited(block);
630 value_arr = get_irn_link(block);
633 return value_arr[vnum];
635 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
636 ir_node *pred = get_Block_cfgpred(block, i);
638 res = find_vnum_value(get_nodes_block(pred), vnum);
649 static void fix_phis(env_t *env)
652 ir_node *phi, *block, *pred, *val;
655 for (l = env->fix_phis; l; l = get_irn_link(phi)) {
658 block = get_nodes_block(phi);
659 for (i = get_irn_arity(phi) - 1; i >= 0; --i) {
660 pred = get_Block_cfgpred(block, i);
661 pred = get_nodes_block(pred);
663 inc_irg_block_visited(current_ir_graph);
664 val = find_vnum_value(pred, l->vnum);
667 set_irn_n(phi, i, val);
675 static void fix_loads(env_t *env)
678 ir_node *load, *block, *pred, *val = NULL, *mem;
682 for (l = env->fix_loads; l; l = get_irn_link(load)) {
685 block = get_nodes_block(load);
686 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
687 pred = get_Block_cfgpred(block, i);
688 pred = get_nodes_block(pred);
690 inc_irg_block_visited(current_ir_graph);
691 val = find_vnum_value(pred, l->vnum);
698 /* access of an uninitialized value */
699 val = new_Unknown(env->modes[l->vnum]);
702 mem = get_Load_mem(load);
703 /* Beware: A Load can contain a hidden conversion in Firm.
705 mode = get_Load_mode(load);
706 if (mode != get_irn_mode(val))
707 val = new_d_Conv(get_irn_dbg_info(load), val, mode);
709 turn_into_tuple(load, pn_Load_max);
710 set_Tuple_pred(load, pn_Load_M, mem);
711 set_Tuple_pred(load, pn_Load_res, val);
712 set_Tuple_pred(load, pn_Load_X_except, new_Bad());
717 * Make scalar replacement.
719 * @param sels A set containing all Sel nodes that have a value number
720 * @param nvals The number of scalars.
721 * @param modes A flexible array, containing all the modes of
724 static void do_scalar_replacements(pset *sels, int nvals, ir_mode **modes)
728 obstack_init(&env.obst);
732 env.fix_loads = NULL;
735 /* first step: allocate the value arrays for every block */
736 irg_block_walk_graph(current_ir_graph, NULL, alloc_value_arr, &env);
739 * second step: walk over the graph blockwise in topological order
740 * and fill the array as much as possible.
742 irg_walk_blkwise_graph(current_ir_graph, NULL, topologic_walker, &env);
744 /* third, fix the list of Phis, then the list of Loads */
748 obstack_free(&env.obst, NULL);
752 * Find possible scalar replacements
754 * @param irg The current ir graph.
756 void scalar_replacement_opt(ir_graph *irg)
760 scalars_t key, *value;
768 if (! get_opt_scalar_replacement())
771 rem = current_ir_graph;
773 /* Call algorithm that computes the out edges */
774 assure_irg_outs(irg);
776 /* Find possible scalar replacements */
777 if (find_possible_replacements(irg)) {
779 if (get_opt_scalar_replacement_verbose()) {
780 printf("Scalar Replacement: %s\n", get_entity_name(get_irg_entity(irg)));
783 /* Insert in set the scalar replacements. */
784 irg_frame = get_irg_frame(irg);
786 modes = NEW_ARR_F(ir_mode *, 16);
787 set_ent = new_set(ent_cmp, 8);
788 sels = pset_new_ptr(8);
790 for (i = 0 ; i < get_irn_n_outs(irg_frame); i++) {
791 ir_node *succ = get_irn_out(irg_frame, i);
794 ir_entity *ent = get_Sel_entity(succ);
796 if (get_entity_link(ent) == NULL || get_entity_link(ent) == ADDRESS_TAKEN)
799 ent_type = get_entity_type(ent);
802 key.ent_owner = get_entity_owner(ent);
803 set_insert(set_ent, &key, sizeof(key), HASH_PTR(key.ent));
805 if (get_opt_scalar_replacement_verbose()) {
806 if (is_Array_type(ent_type)) {
807 printf(" found array %s\n", get_entity_name(ent));
809 else if (is_Struct_type(ent_type)) {
810 printf(" found struct %s\n", get_entity_name(ent));
812 else if (is_atomic_type(ent_type))
813 printf(" found atomic value %s\n", get_entity_name(ent));
815 assert(0 && "Neither an array nor a struct or atomic value");
819 nvals = allocate_value_numbers(sels, ent, nvals, &modes);
823 if (get_opt_scalar_replacement_verbose()) {
824 printf(" %u values will be needed\n", nvals);
827 /* If scalars were found. */
829 do_scalar_replacements(sels, nvals, modes);
831 for (value = set_first(set_ent); value; value = set_next(set_ent)) {
832 remove_class_member(value->ent_owner, value->ent);
842 * We changed the graph, but did NOT introduce new blocks
843 * neither changed control flow, cf-backedges should be still
846 set_irg_outs_inconsistent(irg);
847 set_irg_loopinfo_inconsistent(irg);
851 current_ir_graph = rem;