X-Git-Url: http://git.sourceforge.jp/view?a=blobdiff_plain;f=gcc%2Fira-build.c;h=b3c1e14f8f756ca1b04a4d9859f15219479cfbca;hb=2af78907ef2d37c7bbbf9dd45f44067d682ed9ac;hp=fa0a39c192a8da68bef831b17d27fa6a06aabbf1;hpb=76b340dbd7165cfaaa427c88c58e61197134e144;p=pf3gnuchains%2Fgcc-fork.git diff --git a/gcc/ira-build.c b/gcc/ira-build.c index fa0a39c192a..b3c1e14f8f7 100644 --- a/gcc/ira-build.c +++ b/gcc/ira-build.c @@ -1,5 +1,5 @@ /* Building internal representation for IRA. - Copyright (C) 2006, 2007, 2008 + Copyright (C) 2006, 2007, 2008, 2009, 2010 Free Software Foundation, Inc. Contributed by Vladimir Makarov . @@ -32,13 +32,14 @@ along with GCC; see the file COPYING3. If not see #include "basic-block.h" #include "insn-config.h" #include "recog.h" -#include "toplev.h" +#include "diagnostic-core.h" #include "params.h" #include "df.h" #include "output.h" #include "reload.h" #include "sparseset.h" #include "ira-int.h" +#include "emit-rtl.h" /* FIXME: Can go away once crtl is moved to rtl.h. */ static ira_copy_t find_allocno_copy (ira_allocno_t, ira_allocno_t, rtx, ira_loop_tree_node_t); @@ -58,7 +59,7 @@ ira_loop_tree_node_t ira_bb_nodes; array. */ ira_loop_tree_node_t ira_loop_nodes; -/* Map regno -> allocnos with given regno (see comments for +/* Map regno -> allocnos with given regno (see comments for allocno member `next_regno_allocno'). */ ira_allocno_t *ira_regno_allocno_map; @@ -70,9 +71,12 @@ ira_allocno_t *ira_allocnos; /* Sizes of the previous array. */ int ira_allocnos_num; -/* Map conflict id -> allocno with given conflict id (see comments for - allocno member `conflict_id'). */ -ira_allocno_t *ira_conflict_id_allocno_map; +/* Count of conflict record structures we've created, used when creating + a new conflict id. */ +int ira_objects_num; + +/* Map a conflict id to its conflict record. */ +ira_object_t *ira_object_id_map; /* Array of references to all copies. The order number of the copy corresponds to the index in the array. Removed copies have NULL @@ -122,7 +126,7 @@ create_loop_tree_nodes (bool loops_p) ira_allocate (sizeof (struct ira_loop_tree_node) * VEC_length (loop_p, ira_loops.larray))); max_regno = max_reg_num (); - for (i = 0; VEC_iterate (loop_p, ira_loops.larray, i, loop); i++) + FOR_EACH_VEC_ELT (loop_p, ira_loops.larray, i, loop) { if (loop != ira_loops.tree_root) { @@ -140,7 +144,7 @@ create_loop_tree_nodes (bool loops_p) if (skip_p) continue; edges = get_loop_exit_edges (loop); - for (j = 0; VEC_iterate (edge, edges, j, e); j++) + FOR_EACH_VEC_ELT (edge, edges, j, e) if ((e->flags & EDGE_ABNORMAL) && EDGE_CRITICAL_P (e)) { skip_p = true; @@ -171,7 +175,7 @@ more_one_region_p (void) unsigned int i; loop_p loop; - for (i = 0; VEC_iterate (loop_p, ira_loops.larray, i, loop); i++) + FOR_EACH_VEC_ELT (loop_p, ira_loops.larray, i, loop) if (ira_loop_nodes[i].regno_allocno_map != NULL && ira_loop_tree_root != &ira_loop_nodes[i]) return true; @@ -201,7 +205,7 @@ finish_loop_tree_nodes (void) unsigned int i; loop_p loop; - for (i = 0; VEC_iterate (loop_p, ira_loops.larray, i, loop); i++) + FOR_EACH_VEC_ELT (loop_p, ira_loops.larray, i, loop) finish_loop_tree_node (&ira_loop_nodes[i]); ira_free (ira_loop_nodes); for (i = 0; i < (unsigned int) last_basic_block_before_change; i++) @@ -304,7 +308,7 @@ form_loop_tree (void) /* We can not use loop/bb node access macros because of potential checking and because the nodes are not initialized enough yet. */ - for (i = 0; VEC_iterate (loop_p, ira_loops.larray, i, loop); i++) + FOR_EACH_VEC_ELT (loop_p, ira_loops.larray, i, loop) if (ira_loop_nodes[i].regno_allocno_map != NULL) { ira_loop_nodes[i].children = NULL; @@ -350,7 +354,7 @@ rebuild_regno_allocno_maps (void) ira_allocno_iterator ai; max_regno = max_reg_num (); - for (l = 0; VEC_iterate (loop_p, ira_loops.larray, l, loop); l++) + FOR_EACH_VEC_ELT (loop_p, ira_loops.larray, l, loop) if (ira_loop_nodes[l].regno_allocno_map != NULL) { ira_free (ira_loop_nodes[l].regno_allocno_map); @@ -379,40 +383,73 @@ rebuild_regno_allocno_maps (void) loop_tree_node->regno_allocno_map[regno] = a; } } - -/* Pools for allocnos and allocno live ranges. */ -static alloc_pool allocno_pool, allocno_live_range_pool; +/* Pools for allocnos, allocno live ranges and objects. */ +static alloc_pool allocno_pool, live_range_pool, object_pool; /* Vec containing references to all created allocnos. It is a container of array allocnos. */ static VEC(ira_allocno_t,heap) *allocno_vec; -/* Vec containing references to all created allocnos. It is a - container of ira_conflict_id_allocno_map. */ -static VEC(ira_allocno_t,heap) *ira_conflict_id_allocno_map_vec; +/* Vec containing references to all created ira_objects. It is a + container of ira_object_id_map. */ +static VEC(ira_object_t,heap) *ira_object_id_map_vec; /* Initialize data concerning allocnos. */ static void initiate_allocnos (void) { - allocno_live_range_pool - = create_alloc_pool ("allocno live ranges", - sizeof (struct ira_allocno_live_range), 100); + live_range_pool + = create_alloc_pool ("live ranges", + sizeof (struct live_range), 100); allocno_pool = create_alloc_pool ("allocnos", sizeof (struct ira_allocno), 100); + object_pool + = create_alloc_pool ("objects", sizeof (struct ira_object), 100); allocno_vec = VEC_alloc (ira_allocno_t, heap, max_reg_num () * 2); ira_allocnos = NULL; ira_allocnos_num = 0; - ira_conflict_id_allocno_map_vec - = VEC_alloc (ira_allocno_t, heap, max_reg_num () * 2); - ira_conflict_id_allocno_map = NULL; + ira_objects_num = 0; + ira_object_id_map_vec + = VEC_alloc (ira_object_t, heap, max_reg_num () * 2); + ira_object_id_map = NULL; ira_regno_allocno_map = (ira_allocno_t *) ira_allocate (max_reg_num () * sizeof (ira_allocno_t)); memset (ira_regno_allocno_map, 0, max_reg_num () * sizeof (ira_allocno_t)); } +/* Create and return an object corresponding to a new allocno A. */ +static ira_object_t +ira_create_object (ira_allocno_t a, int subword) +{ + enum reg_class cover_class = ALLOCNO_COVER_CLASS (a); + ira_object_t obj = (ira_object_t) pool_alloc (object_pool); + + OBJECT_ALLOCNO (obj) = a; + OBJECT_SUBWORD (obj) = subword; + OBJECT_CONFLICT_ID (obj) = ira_objects_num; + OBJECT_CONFLICT_VEC_P (obj) = false; + OBJECT_CONFLICT_ARRAY (obj) = NULL; + OBJECT_NUM_CONFLICTS (obj) = 0; + COPY_HARD_REG_SET (OBJECT_CONFLICT_HARD_REGS (obj), ira_no_alloc_regs); + COPY_HARD_REG_SET (OBJECT_TOTAL_CONFLICT_HARD_REGS (obj), ira_no_alloc_regs); + IOR_COMPL_HARD_REG_SET (OBJECT_CONFLICT_HARD_REGS (obj), + reg_class_contents[cover_class]); + IOR_COMPL_HARD_REG_SET (OBJECT_TOTAL_CONFLICT_HARD_REGS (obj), + reg_class_contents[cover_class]); + OBJECT_MIN (obj) = INT_MAX; + OBJECT_MAX (obj) = -1; + OBJECT_LIVE_RANGES (obj) = NULL; + + VEC_safe_push (ira_object_t, heap, ira_object_id_map_vec, obj); + ira_object_id_map + = VEC_address (ira_object_t, ira_object_id_map_vec); + ira_objects_num = VEC_length (ira_object_t, ira_object_id_map_vec); + + return obj; +} + /* Create and return the allocno corresponding to REGNO in LOOP_TREE_NODE. Add the allocno to the list of allocnos with the same regno if CAP_P is FALSE. */ @@ -438,10 +475,6 @@ ira_create_allocno (int regno, bool cap_p, ira_loop_tree_node_t loop_tree_node) ALLOCNO_CAP_MEMBER (a) = NULL; ALLOCNO_NUM (a) = ira_allocnos_num; bitmap_set_bit (loop_tree_node->all_allocnos, ALLOCNO_NUM (a)); - ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a) = NULL; - ALLOCNO_CONFLICT_ALLOCNOS_NUM (a) = 0; - COPY_HARD_REG_SET (ALLOCNO_CONFLICT_HARD_REGS (a), ira_no_alloc_regs); - COPY_HARD_REG_SET (ALLOCNO_TOTAL_CONFLICT_HARD_REGS (a), ira_no_alloc_regs); ALLOCNO_NREFS (a) = 0; ALLOCNO_FREQ (a) = 0; ALLOCNO_HARD_REGNO (a) = -1; @@ -456,19 +489,20 @@ ira_create_allocno (int regno, bool cap_p, ira_loop_tree_node_t loop_tree_node) ALLOCNO_SOMEWHERE_RENAMED_P (a) = false; ALLOCNO_CHILD_RENAMED_P (a) = false; ALLOCNO_DONT_REASSIGN_P (a) = false; + ALLOCNO_BAD_SPILL_P (a) = false; ALLOCNO_IN_GRAPH_P (a) = false; ALLOCNO_ASSIGNED_P (a) = false; ALLOCNO_MAY_BE_SPILLED_P (a) = false; ALLOCNO_SPLAY_REMOVED_P (a) = false; - ALLOCNO_CONFLICT_VEC_P (a) = false; ALLOCNO_MODE (a) = (regno < 0 ? VOIDmode : PSEUDO_REGNO_MODE (regno)); ALLOCNO_COPIES (a) = NULL; ALLOCNO_HARD_REG_COSTS (a) = NULL; ALLOCNO_CONFLICT_HARD_REG_COSTS (a) = NULL; ALLOCNO_UPDATED_HARD_REG_COSTS (a) = NULL; ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS (a) = NULL; - ALLOCNO_LEFT_CONFLICTS_NUM (a) = -1; + ALLOCNO_LEFT_CONFLICTS_SIZE (a) = -1; ALLOCNO_COVER_CLASS (a) = NO_REGS; + ALLOCNO_UPDATED_COVER_CLASS_COST (a) = 0; ALLOCNO_COVER_CLASS_COST (a) = 0; ALLOCNO_MEMORY_COST (a) = 0; ALLOCNO_UPDATED_MEMORY_COST (a) = 0; @@ -477,16 +511,12 @@ ira_create_allocno (int regno, bool cap_p, ira_loop_tree_node_t loop_tree_node) ALLOCNO_PREV_BUCKET_ALLOCNO (a) = NULL; ALLOCNO_FIRST_COALESCED_ALLOCNO (a) = a; ALLOCNO_NEXT_COALESCED_ALLOCNO (a) = a; - ALLOCNO_LIVE_RANGES (a) = NULL; - ALLOCNO_MIN (a) = INT_MAX; - ALLOCNO_MAX (a) = -1; - ALLOCNO_CONFLICT_ID (a) = ira_allocnos_num; + ALLOCNO_NUM_OBJECTS (a) = 0; + VEC_safe_push (ira_allocno_t, heap, allocno_vec, a); ira_allocnos = VEC_address (ira_allocno_t, allocno_vec); ira_allocnos_num = VEC_length (ira_allocno_t, allocno_vec); - VEC_safe_push (ira_allocno_t, heap, ira_conflict_id_allocno_map_vec, a); - ira_conflict_id_allocno_map - = VEC_address (ira_allocno_t, ira_conflict_id_allocno_map_vec); + return a; } @@ -495,117 +525,184 @@ void ira_set_allocno_cover_class (ira_allocno_t a, enum reg_class cover_class) { ALLOCNO_COVER_CLASS (a) = cover_class; - IOR_COMPL_HARD_REG_SET (ALLOCNO_CONFLICT_HARD_REGS (a), - reg_class_contents[cover_class]); - IOR_COMPL_HARD_REG_SET (ALLOCNO_TOTAL_CONFLICT_HARD_REGS (a), - reg_class_contents[cover_class]); } -/* Return TRUE if the conflict vector with NUM elements is more - profitable than conflict bit vector for A. */ +/* Determine the number of objects we should associate with allocno A + and allocate them. */ +void +ira_create_allocno_objects (ira_allocno_t a) +{ + enum machine_mode mode = ALLOCNO_MODE (a); + enum reg_class cover_class = ALLOCNO_COVER_CLASS (a); + int n = ira_reg_class_nregs[cover_class][mode]; + int i; + + if (GET_MODE_SIZE (mode) != 2 * UNITS_PER_WORD || n != 2) + n = 1; + + ALLOCNO_NUM_OBJECTS (a) = n; + for (i = 0; i < n; i++) + ALLOCNO_OBJECT (a, i) = ira_create_object (a, i); +} + +/* For each allocno, set ALLOCNO_NUM_OBJECTS and create the + ALLOCNO_OBJECT structures. This must be called after the cover + classes are known. */ +static void +create_allocno_objects (void) +{ + ira_allocno_t a; + ira_allocno_iterator ai; + + FOR_EACH_ALLOCNO (a, ai) + ira_create_allocno_objects (a); +} + +/* Merge hard register conflict information for all objects associated with + allocno TO into the corresponding objects associated with FROM. + If TOTAL_ONLY is true, we only merge OBJECT_TOTAL_CONFLICT_HARD_REGS. */ +static void +merge_hard_reg_conflicts (ira_allocno_t from, ira_allocno_t to, + bool total_only) +{ + int i; + gcc_assert (ALLOCNO_NUM_OBJECTS (to) == ALLOCNO_NUM_OBJECTS (from)); + for (i = 0; i < ALLOCNO_NUM_OBJECTS (to); i++) + { + ira_object_t from_obj = ALLOCNO_OBJECT (from, i); + ira_object_t to_obj = ALLOCNO_OBJECT (to, i); + if (!total_only) + IOR_HARD_REG_SET (OBJECT_CONFLICT_HARD_REGS (to_obj), + OBJECT_CONFLICT_HARD_REGS (from_obj)); + IOR_HARD_REG_SET (OBJECT_TOTAL_CONFLICT_HARD_REGS (to_obj), + OBJECT_TOTAL_CONFLICT_HARD_REGS (from_obj)); + } +#ifdef STACK_REGS + if (!total_only && ALLOCNO_NO_STACK_REG_P (from)) + ALLOCNO_NO_STACK_REG_P (to) = true; + if (ALLOCNO_TOTAL_NO_STACK_REG_P (from)) + ALLOCNO_TOTAL_NO_STACK_REG_P (to) = true; +#endif +} + +/* Update hard register conflict information for all objects associated with + A to include the regs in SET. */ +void +ior_hard_reg_conflicts (ira_allocno_t a, HARD_REG_SET *set) +{ + ira_allocno_object_iterator i; + ira_object_t obj; + FOR_EACH_ALLOCNO_OBJECT (a, obj, i) + { + IOR_HARD_REG_SET (OBJECT_CONFLICT_HARD_REGS (obj), *set); + IOR_HARD_REG_SET (OBJECT_TOTAL_CONFLICT_HARD_REGS (obj), *set); + } +} + +/* Return TRUE if a conflict vector with NUM elements is more + profitable than a conflict bit vector for OBJ. */ bool -ira_conflict_vector_profitable_p (ira_allocno_t a, int num) +ira_conflict_vector_profitable_p (ira_object_t obj, int num) { int nw; + int max = OBJECT_MAX (obj); + int min = OBJECT_MIN (obj); - if (ALLOCNO_MAX (a) < ALLOCNO_MIN (a)) - /* We prefer bit vector in such case because it does not result in - allocation. */ + if (max < min) + /* We prefer a bit vector in such case because it does not result + in allocation. */ return false; - nw = (ALLOCNO_MAX (a) - ALLOCNO_MIN (a) + IRA_INT_BITS) / IRA_INT_BITS; - return (2 * sizeof (ira_allocno_t) * (num + 1) + nw = (max - min + IRA_INT_BITS) / IRA_INT_BITS; + return (2 * sizeof (ira_object_t) * (num + 1) < 3 * nw * sizeof (IRA_INT_TYPE)); } -/* Allocates and initialize the conflict vector of A for NUM - conflicting allocnos. */ +/* Allocates and initialize the conflict vector of OBJ for NUM + conflicting objects. */ void -ira_allocate_allocno_conflict_vec (ira_allocno_t a, int num) +ira_allocate_conflict_vec (ira_object_t obj, int num) { int size; - ira_allocno_t *vec; + ira_object_t *vec; - ira_assert (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a) == NULL); + ira_assert (OBJECT_CONFLICT_ARRAY (obj) == NULL); num++; /* for NULL end marker */ - size = sizeof (ira_allocno_t) * num; - ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a) = ira_allocate (size); - vec = (ira_allocno_t *) ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a); + size = sizeof (ira_object_t) * num; + OBJECT_CONFLICT_ARRAY (obj) = ira_allocate (size); + vec = (ira_object_t *) OBJECT_CONFLICT_ARRAY (obj); vec[0] = NULL; - ALLOCNO_CONFLICT_ALLOCNOS_NUM (a) = 0; - ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a) = size; - ALLOCNO_CONFLICT_VEC_P (a) = true; + OBJECT_NUM_CONFLICTS (obj) = 0; + OBJECT_CONFLICT_ARRAY_SIZE (obj) = size; + OBJECT_CONFLICT_VEC_P (obj) = true; } -/* Allocate and initialize the conflict bit vector of A. */ +/* Allocate and initialize the conflict bit vector of OBJ. */ static void -allocate_allocno_conflict_bit_vec (ira_allocno_t a) +allocate_conflict_bit_vec (ira_object_t obj) { unsigned int size; - ira_assert (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a) == NULL); - size = ((ALLOCNO_MAX (a) - ALLOCNO_MIN (a) + IRA_INT_BITS) + ira_assert (OBJECT_CONFLICT_ARRAY (obj) == NULL); + size = ((OBJECT_MAX (obj) - OBJECT_MIN (obj) + IRA_INT_BITS) / IRA_INT_BITS * sizeof (IRA_INT_TYPE)); - ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a) = ira_allocate (size); - memset (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a), 0, size); - ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a) = size; - ALLOCNO_CONFLICT_VEC_P (a) = false; + OBJECT_CONFLICT_ARRAY (obj) = ira_allocate (size); + memset (OBJECT_CONFLICT_ARRAY (obj), 0, size); + OBJECT_CONFLICT_ARRAY_SIZE (obj) = size; + OBJECT_CONFLICT_VEC_P (obj) = false; } /* Allocate and initialize the conflict vector or conflict bit vector - of A for NUM conflicting allocnos whatever is more profitable. */ + of OBJ for NUM conflicting allocnos whatever is more profitable. */ void -ira_allocate_allocno_conflicts (ira_allocno_t a, int num) +ira_allocate_object_conflicts (ira_object_t obj, int num) { - if (ira_conflict_vector_profitable_p (a, num)) - ira_allocate_allocno_conflict_vec (a, num); + if (ira_conflict_vector_profitable_p (obj, num)) + ira_allocate_conflict_vec (obj, num); else - allocate_allocno_conflict_bit_vec (a); + allocate_conflict_bit_vec (obj); } -/* Add A2 to the conflicts of A1. */ +/* Add OBJ2 to the conflicts of OBJ1. */ static void -add_to_allocno_conflicts (ira_allocno_t a1, ira_allocno_t a2) +add_to_conflicts (ira_object_t obj1, ira_object_t obj2) { int num; unsigned int size; - if (ALLOCNO_CONFLICT_VEC_P (a1)) + if (OBJECT_CONFLICT_VEC_P (obj1)) { - ira_allocno_t *vec; - - num = ALLOCNO_CONFLICT_ALLOCNOS_NUM (a1) + 2; - if (ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a1) - >= num * sizeof (ira_allocno_t)) - vec = (ira_allocno_t *) ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1); - else + ira_object_t *vec = OBJECT_CONFLICT_VEC (obj1); + int curr_num = OBJECT_NUM_CONFLICTS (obj1); + num = curr_num + 2; + if (OBJECT_CONFLICT_ARRAY_SIZE (obj1) < num * sizeof (ira_object_t)) { + ira_object_t *newvec; size = (3 * num / 2 + 1) * sizeof (ira_allocno_t); - vec = (ira_allocno_t *) ira_allocate (size); - memcpy (vec, ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1), - sizeof (ira_allocno_t) * ALLOCNO_CONFLICT_ALLOCNOS_NUM (a1)); - ira_free (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1)); - ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1) = vec; - ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a1) = size; + newvec = (ira_object_t *) ira_allocate (size); + memcpy (newvec, vec, curr_num * sizeof (ira_object_t)); + ira_free (vec); + vec = newvec; + OBJECT_CONFLICT_ARRAY (obj1) = vec; + OBJECT_CONFLICT_ARRAY_SIZE (obj1) = size; } - vec[num - 2] = a2; + vec[num - 2] = obj2; vec[num - 1] = NULL; - ALLOCNO_CONFLICT_ALLOCNOS_NUM (a1)++; + OBJECT_NUM_CONFLICTS (obj1)++; } else { int nw, added_head_nw, id; - IRA_INT_TYPE *vec; + IRA_INT_TYPE *vec = OBJECT_CONFLICT_BITVEC (obj1); - id = ALLOCNO_CONFLICT_ID (a2); - vec = (IRA_INT_TYPE *) ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1); - if (ALLOCNO_MIN (a1) > id) + id = OBJECT_CONFLICT_ID (obj2); + if (OBJECT_MIN (obj1) > id) { /* Expand head of the bit vector. */ - added_head_nw = (ALLOCNO_MIN (a1) - id - 1) / IRA_INT_BITS + 1; - nw = (ALLOCNO_MAX (a1) - ALLOCNO_MIN (a1)) / IRA_INT_BITS + 1; + added_head_nw = (OBJECT_MIN (obj1) - id - 1) / IRA_INT_BITS + 1; + nw = (OBJECT_MAX (obj1) - OBJECT_MIN (obj1)) / IRA_INT_BITS + 1; size = (nw + added_head_nw) * sizeof (IRA_INT_TYPE); - if (ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a1) >= size) + if (OBJECT_CONFLICT_ARRAY_SIZE (obj1) >= size) { memmove ((char *) vec + added_head_nw * sizeof (IRA_INT_TYPE), vec, nw * sizeof (IRA_INT_TYPE)); @@ -617,97 +714,93 @@ add_to_allocno_conflicts (ira_allocno_t a1, ira_allocno_t a2) = (3 * (nw + added_head_nw) / 2 + 1) * sizeof (IRA_INT_TYPE); vec = (IRA_INT_TYPE *) ira_allocate (size); memcpy ((char *) vec + added_head_nw * sizeof (IRA_INT_TYPE), - ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1), - nw * sizeof (IRA_INT_TYPE)); + OBJECT_CONFLICT_ARRAY (obj1), nw * sizeof (IRA_INT_TYPE)); memset (vec, 0, added_head_nw * sizeof (IRA_INT_TYPE)); memset ((char *) vec + (nw + added_head_nw) * sizeof (IRA_INT_TYPE), 0, size - (nw + added_head_nw) * sizeof (IRA_INT_TYPE)); - ira_free (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1)); - ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1) = vec; - ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a1) = size; + ira_free (OBJECT_CONFLICT_ARRAY (obj1)); + OBJECT_CONFLICT_ARRAY (obj1) = vec; + OBJECT_CONFLICT_ARRAY_SIZE (obj1) = size; } - ALLOCNO_MIN (a1) -= added_head_nw * IRA_INT_BITS; + OBJECT_MIN (obj1) -= added_head_nw * IRA_INT_BITS; } - else if (ALLOCNO_MAX (a1) < id) + else if (OBJECT_MAX (obj1) < id) { - nw = (id - ALLOCNO_MIN (a1)) / IRA_INT_BITS + 1; + nw = (id - OBJECT_MIN (obj1)) / IRA_INT_BITS + 1; size = nw * sizeof (IRA_INT_TYPE); - if (ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a1) < size) + if (OBJECT_CONFLICT_ARRAY_SIZE (obj1) < size) { /* Expand tail of the bit vector. */ size = (3 * nw / 2 + 1) * sizeof (IRA_INT_TYPE); vec = (IRA_INT_TYPE *) ira_allocate (size); - memcpy (vec, ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1), - ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a1)); - memset ((char *) vec + ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a1), - 0, size - ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a1)); - ira_free (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1)); - ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1) = vec; - ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a1) = size; + memcpy (vec, OBJECT_CONFLICT_ARRAY (obj1), OBJECT_CONFLICT_ARRAY_SIZE (obj1)); + memset ((char *) vec + OBJECT_CONFLICT_ARRAY_SIZE (obj1), + 0, size - OBJECT_CONFLICT_ARRAY_SIZE (obj1)); + ira_free (OBJECT_CONFLICT_ARRAY (obj1)); + OBJECT_CONFLICT_ARRAY (obj1) = vec; + OBJECT_CONFLICT_ARRAY_SIZE (obj1) = size; } - ALLOCNO_MAX (a1) = id; + OBJECT_MAX (obj1) = id; } - SET_ALLOCNO_SET_BIT (vec, id, ALLOCNO_MIN (a1), ALLOCNO_MAX (a1)); + SET_MINMAX_SET_BIT (vec, id, OBJECT_MIN (obj1), OBJECT_MAX (obj1)); } } -/* Add A1 to the conflicts of A2 and vise versa. */ -void -ira_add_allocno_conflict (ira_allocno_t a1, ira_allocno_t a2) +/* Add OBJ1 to the conflicts of OBJ2 and vice versa. */ +static void +ira_add_conflict (ira_object_t obj1, ira_object_t obj2) { - add_to_allocno_conflicts (a1, a2); - add_to_allocno_conflicts (a2, a1); + add_to_conflicts (obj1, obj2); + add_to_conflicts (obj2, obj1); } -/* Clear all conflicts of allocno A. */ +/* Clear all conflicts of OBJ. */ static void -clear_allocno_conflicts (ira_allocno_t a) +clear_conflicts (ira_object_t obj) { - if (ALLOCNO_CONFLICT_VEC_P (a)) + if (OBJECT_CONFLICT_VEC_P (obj)) { - ALLOCNO_CONFLICT_ALLOCNOS_NUM (a) = 0; - ((ira_allocno_t *) ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a))[0] = NULL; + OBJECT_NUM_CONFLICTS (obj) = 0; + OBJECT_CONFLICT_VEC (obj)[0] = NULL; } - else if (ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a) != 0) + else if (OBJECT_CONFLICT_ARRAY_SIZE (obj) != 0) { int nw; - nw = (ALLOCNO_MAX (a) - ALLOCNO_MIN (a)) / IRA_INT_BITS + 1; - memset (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a), 0, - nw * sizeof (IRA_INT_TYPE)); + nw = (OBJECT_MAX (obj) - OBJECT_MIN (obj)) / IRA_INT_BITS + 1; + memset (OBJECT_CONFLICT_BITVEC (obj), 0, nw * sizeof (IRA_INT_TYPE)); } } /* The array used to find duplications in conflict vectors of allocnos. */ -static int *allocno_conflict_check; +static int *conflict_check; /* The value used to mark allocation presence in conflict vector of the current allocno. */ -static int curr_allocno_conflict_check_tick; +static int curr_conflict_check_tick; -/* Remove duplications in conflict vector of A. */ +/* Remove duplications in conflict vector of OBJ. */ static void -compress_allocno_conflict_vec (ira_allocno_t a) +compress_conflict_vec (ira_object_t obj) { - ira_allocno_t *vec, conflict_a; + ira_object_t *vec, conflict_obj; int i, j; - ira_assert (ALLOCNO_CONFLICT_VEC_P (a)); - vec = (ira_allocno_t *) ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a); - curr_allocno_conflict_check_tick++; - for (i = j = 0; (conflict_a = vec[i]) != NULL; i++) + ira_assert (OBJECT_CONFLICT_VEC_P (obj)); + vec = OBJECT_CONFLICT_VEC (obj); + curr_conflict_check_tick++; + for (i = j = 0; (conflict_obj = vec[i]) != NULL; i++) { - if (allocno_conflict_check[ALLOCNO_NUM (conflict_a)] - != curr_allocno_conflict_check_tick) + int id = OBJECT_CONFLICT_ID (conflict_obj); + if (conflict_check[id] != curr_conflict_check_tick) { - allocno_conflict_check[ALLOCNO_NUM (conflict_a)] - = curr_allocno_conflict_check_tick; - vec[j++] = conflict_a; + conflict_check[id] = curr_conflict_check_tick; + vec[j++] = conflict_obj; } } - ALLOCNO_CONFLICT_ALLOCNOS_NUM (a) = j; + OBJECT_NUM_CONFLICTS (obj) = j; vec[j] = NULL; } @@ -715,17 +808,18 @@ compress_allocno_conflict_vec (ira_allocno_t a) static void compress_conflict_vecs (void) { - ira_allocno_t a; - ira_allocno_iterator ai; + ira_object_t obj; + ira_object_iterator oi; - allocno_conflict_check - = (int *) ira_allocate (sizeof (int) * ira_allocnos_num); - memset (allocno_conflict_check, 0, sizeof (int) * ira_allocnos_num); - curr_allocno_conflict_check_tick = 0; - FOR_EACH_ALLOCNO (a, ai) - if (ALLOCNO_CONFLICT_VEC_P (a)) - compress_allocno_conflict_vec (a); - ira_free (allocno_conflict_check); + conflict_check = (int *) ira_allocate (sizeof (int) * ira_objects_num); + memset (conflict_check, 0, sizeof (int) * ira_objects_num); + curr_conflict_check_tick = 0; + FOR_EACH_OBJECT (obj, oi) + { + if (OBJECT_CONFLICT_VEC_P (obj)) + compress_conflict_vec (obj); + } + ira_free (conflict_check); } /* This recursive function outputs allocno A and if it is a cap the @@ -764,29 +858,25 @@ create_cap_allocno (ira_allocno_t a) ALLOCNO_MODE (cap) = ALLOCNO_MODE (a); cover_class = ALLOCNO_COVER_CLASS (a); ira_set_allocno_cover_class (cap, cover_class); + ira_create_allocno_objects (cap); ALLOCNO_AVAILABLE_REGS_NUM (cap) = ALLOCNO_AVAILABLE_REGS_NUM (a); ALLOCNO_CAP_MEMBER (cap) = a; ALLOCNO_CAP (a) = cap; ALLOCNO_COVER_CLASS_COST (cap) = ALLOCNO_COVER_CLASS_COST (a); ALLOCNO_MEMORY_COST (cap) = ALLOCNO_MEMORY_COST (a); - ALLOCNO_UPDATED_MEMORY_COST (cap) = ALLOCNO_UPDATED_MEMORY_COST (a); ira_allocate_and_copy_costs (&ALLOCNO_HARD_REG_COSTS (cap), cover_class, ALLOCNO_HARD_REG_COSTS (a)); ira_allocate_and_copy_costs (&ALLOCNO_CONFLICT_HARD_REG_COSTS (cap), cover_class, ALLOCNO_CONFLICT_HARD_REG_COSTS (a)); + ALLOCNO_BAD_SPILL_P (cap) = ALLOCNO_BAD_SPILL_P (a); ALLOCNO_NREFS (cap) = ALLOCNO_NREFS (a); ALLOCNO_FREQ (cap) = ALLOCNO_FREQ (a); ALLOCNO_CALL_FREQ (cap) = ALLOCNO_CALL_FREQ (a); - IOR_HARD_REG_SET (ALLOCNO_CONFLICT_HARD_REGS (cap), - ALLOCNO_CONFLICT_HARD_REGS (a)); - IOR_HARD_REG_SET (ALLOCNO_TOTAL_CONFLICT_HARD_REGS (cap), - ALLOCNO_TOTAL_CONFLICT_HARD_REGS (a)); + + merge_hard_reg_conflicts (a, cap, false); + ALLOCNO_CALLS_CROSSED_NUM (cap) = ALLOCNO_CALLS_CROSSED_NUM (a); -#ifdef STACK_REGS - ALLOCNO_NO_STACK_REG_P (cap) = ALLOCNO_NO_STACK_REG_P (a); - ALLOCNO_TOTAL_NO_STACK_REG_P (cap) = ALLOCNO_TOTAL_NO_STACK_REG_P (a); -#endif if (internal_flag_ira_verbose > 2 && ira_dump_file != NULL) { fprintf (ira_dump_file, " Creating cap "); @@ -796,44 +886,55 @@ create_cap_allocno (ira_allocno_t a) return cap; } -/* Create and return allocno live range with given attributes. */ -allocno_live_range_t -ira_create_allocno_live_range (ira_allocno_t a, int start, int finish, - allocno_live_range_t next) +/* Create and return a live range for OBJECT with given attributes. */ +live_range_t +ira_create_live_range (ira_object_t obj, int start, int finish, + live_range_t next) { - allocno_live_range_t p; + live_range_t p; - p = (allocno_live_range_t) pool_alloc (allocno_live_range_pool); - p->allocno = a; + p = (live_range_t) pool_alloc (live_range_pool); + p->object = obj; p->start = start; p->finish = finish; p->next = next; return p; } +/* Create a new live range for OBJECT and queue it at the head of its + live range list. */ +void +ira_add_live_range_to_object (ira_object_t object, int start, int finish) +{ + live_range_t p; + p = ira_create_live_range (object, start, finish, + OBJECT_LIVE_RANGES (object)); + OBJECT_LIVE_RANGES (object) = p; +} + /* Copy allocno live range R and return the result. */ -static allocno_live_range_t -copy_allocno_live_range (allocno_live_range_t r) +static live_range_t +copy_live_range (live_range_t r) { - allocno_live_range_t p; + live_range_t p; - p = (allocno_live_range_t) pool_alloc (allocno_live_range_pool); + p = (live_range_t) pool_alloc (live_range_pool); *p = *r; return p; } /* Copy allocno live range list given by its head R and return the result. */ -static allocno_live_range_t -copy_allocno_live_range_list (allocno_live_range_t r) +live_range_t +ira_copy_live_range_list (live_range_t r) { - allocno_live_range_t p, first, last; + live_range_t p, first, last; if (r == NULL) return NULL; for (first = last = NULL; r != NULL; r = r->next) { - p = copy_allocno_live_range (r); + p = copy_live_range (r); if (first == NULL) first = p; else @@ -843,11 +944,119 @@ copy_allocno_live_range_list (allocno_live_range_t r) return first; } +/* Merge ranges R1 and R2 and returns the result. The function + maintains the order of ranges and tries to minimize number of the + result ranges. */ +live_range_t +ira_merge_live_ranges (live_range_t r1, live_range_t r2) +{ + live_range_t first, last, temp; + + if (r1 == NULL) + return r2; + if (r2 == NULL) + return r1; + for (first = last = NULL; r1 != NULL && r2 != NULL;) + { + if (r1->start < r2->start) + { + temp = r1; + r1 = r2; + r2 = temp; + } + if (r1->start <= r2->finish + 1) + { + /* Intersected ranges: merge r1 and r2 into r1. */ + r1->start = r2->start; + if (r1->finish < r2->finish) + r1->finish = r2->finish; + temp = r2; + r2 = r2->next; + ira_finish_live_range (temp); + if (r2 == NULL) + { + /* To try to merge with subsequent ranges in r1. */ + r2 = r1->next; + r1->next = NULL; + } + } + else + { + /* Add r1 to the result. */ + if (first == NULL) + first = last = r1; + else + { + last->next = r1; + last = r1; + } + r1 = r1->next; + if (r1 == NULL) + { + /* To try to merge with subsequent ranges in r2. */ + r1 = r2->next; + r2->next = NULL; + } + } + } + if (r1 != NULL) + { + if (first == NULL) + first = r1; + else + last->next = r1; + ira_assert (r1->next == NULL); + } + else if (r2 != NULL) + { + if (first == NULL) + first = r2; + else + last->next = r2; + ira_assert (r2->next == NULL); + } + else + { + ira_assert (last->next == NULL); + } + return first; +} + +/* Return TRUE if live ranges R1 and R2 intersect. */ +bool +ira_live_ranges_intersect_p (live_range_t r1, live_range_t r2) +{ + /* Remember the live ranges are always kept ordered. */ + while (r1 != NULL && r2 != NULL) + { + if (r1->start > r2->finish) + r1 = r1->next; + else if (r2->start > r1->finish) + r2 = r2->next; + else + return true; + } + return false; +} + /* Free allocno live range R. */ void -ira_finish_allocno_live_range (allocno_live_range_t r) +ira_finish_live_range (live_range_t r) +{ + pool_free (live_range_pool, r); +} + +/* Free list of allocno live ranges starting with R. */ +void +ira_finish_live_range_list (live_range_t r) { - pool_free (allocno_live_range_pool, r); + live_range_t next_r; + + for (; r != NULL; r = next_r) + { + next_r = r->next; + ira_finish_live_range (r); + } } /* Free updated register costs of allocno A. */ @@ -870,13 +1079,20 @@ ira_free_allocno_updated_costs (ira_allocno_t a) static void finish_allocno (ira_allocno_t a) { - allocno_live_range_t r, next_r; enum reg_class cover_class = ALLOCNO_COVER_CLASS (a); + ira_object_t obj; + ira_allocno_object_iterator oi; + + FOR_EACH_ALLOCNO_OBJECT (a, obj, oi) + { + ira_finish_live_range_list (OBJECT_LIVE_RANGES (obj)); + ira_object_id_map[OBJECT_CONFLICT_ID (obj)] = NULL; + if (OBJECT_CONFLICT_ARRAY (obj) != NULL) + ira_free (OBJECT_CONFLICT_ARRAY (obj)); + pool_free (object_pool, obj); + } ira_allocnos[ALLOCNO_NUM (a)] = NULL; - ira_conflict_id_allocno_map[ALLOCNO_CONFLICT_ID (a)] = NULL; - if (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a) != NULL) - ira_free (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a)); if (ALLOCNO_HARD_REG_COSTS (a) != NULL) ira_free_cost_vector (ALLOCNO_HARD_REG_COSTS (a), cover_class); if (ALLOCNO_CONFLICT_HARD_REG_COSTS (a) != NULL) @@ -886,11 +1102,6 @@ finish_allocno (ira_allocno_t a) if (ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS (a) != NULL) ira_free_cost_vector (ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS (a), cover_class); - for (r = ALLOCNO_LIVE_RANGES (a); r != NULL; r = next_r) - { - next_r = r->next; - ira_finish_allocno_live_range (r); - } pool_free (allocno_pool, a); } @@ -904,10 +1115,11 @@ finish_allocnos (void) FOR_EACH_ALLOCNO (a, ai) finish_allocno (a); ira_free (ira_regno_allocno_map); - VEC_free (ira_allocno_t, heap, ira_conflict_id_allocno_map_vec); + VEC_free (ira_object_t, heap, ira_object_id_map_vec); VEC_free (ira_allocno_t, heap, allocno_vec); free_alloc_pool (allocno_pool); - free_alloc_pool (allocno_live_range_pool); + free_alloc_pool (object_pool); + free_alloc_pool (live_range_pool); } @@ -961,9 +1173,10 @@ find_allocno_copy (ira_allocno_t a1, ira_allocno_t a2, rtx insn, } /* Create and return copy with given attributes LOOP_TREE_NODE, FIRST, - SECOND, FREQ, and INSN. */ + SECOND, FREQ, CONSTRAINT_P, and INSN. */ ira_copy_t -ira_create_copy (ira_allocno_t first, ira_allocno_t second, int freq, rtx insn, +ira_create_copy (ira_allocno_t first, ira_allocno_t second, int freq, + bool constraint_p, rtx insn, ira_loop_tree_node_t loop_tree_node) { ira_copy_t cp; @@ -973,6 +1186,7 @@ ira_create_copy (ira_allocno_t first, ira_allocno_t second, int freq, rtx insn, cp->first = first; cp->second = second; cp->freq = freq; + cp->constraint_p = constraint_p; cp->insn = insn; cp->loop_tree_node = loop_tree_node; VEC_safe_push (ira_copy_t, heap, copy_vec, cp); @@ -1009,48 +1223,6 @@ ira_add_allocno_copy_to_list (ira_copy_t cp) ALLOCNO_COPIES (second) = cp; } -/* Detach a copy CP from allocnos involved into the copy. */ -void -ira_remove_allocno_copy_from_list (ira_copy_t cp) -{ - ira_allocno_t first = cp->first, second = cp->second; - ira_copy_t prev, next; - - next = cp->next_first_allocno_copy; - prev = cp->prev_first_allocno_copy; - if (prev == NULL) - ALLOCNO_COPIES (first) = next; - else if (prev->first == first) - prev->next_first_allocno_copy = next; - else - prev->next_second_allocno_copy = next; - if (next != NULL) - { - if (next->first == first) - next->prev_first_allocno_copy = prev; - else - next->prev_second_allocno_copy = prev; - } - cp->prev_first_allocno_copy = cp->next_first_allocno_copy = NULL; - - next = cp->next_second_allocno_copy; - prev = cp->prev_second_allocno_copy; - if (prev == NULL) - ALLOCNO_COPIES (second) = next; - else if (prev->second == second) - prev->next_second_allocno_copy = next; - else - prev->next_first_allocno_copy = next; - if (next != NULL) - { - if (next->second == second) - next->prev_second_allocno_copy = prev; - else - next->prev_first_allocno_copy = prev; - } - cp->prev_second_allocno_copy = cp->next_second_allocno_copy = NULL; -} - /* Make a copy CP a canonical copy where number of the first allocno is less than the second one. */ void @@ -1081,7 +1253,8 @@ ira_swap_allocno_copy_ends_if_necessary (ira_copy_t cp) LOOP_TREE_NODE. */ ira_copy_t ira_add_allocno_copy (ira_allocno_t first, ira_allocno_t second, int freq, - rtx insn, ira_loop_tree_node_t loop_tree_node) + bool constraint_p, rtx insn, + ira_loop_tree_node_t loop_tree_node) { ira_copy_t cp; @@ -1090,7 +1263,8 @@ ira_add_allocno_copy (ira_allocno_t first, ira_allocno_t second, int freq, cp->freq += freq; return cp; } - cp = ira_create_copy (first, second, freq, insn, loop_tree_node); + cp = ira_create_copy (first, second, freq, constraint_p, insn, + loop_tree_node); ira_assert (first != NULL && second != NULL); ira_add_allocno_copy_to_list (cp); ira_swap_allocno_copy_ends_if_necessary (cp); @@ -1101,9 +1275,11 @@ ira_add_allocno_copy (ira_allocno_t first, ira_allocno_t second, int freq, static void print_copy (FILE *f, ira_copy_t cp) { - fprintf (f, " cp%d:a%d(r%d)<->a%d(r%d)@%d\n", cp->num, + fprintf (f, " cp%d:a%d(r%d)<->a%d(r%d)@%d:%s\n", cp->num, ALLOCNO_NUM (cp->first), ALLOCNO_REGNO (cp->first), - ALLOCNO_NUM (cp->second), ALLOCNO_REGNO (cp->second), cp->freq); + ALLOCNO_NUM (cp->second), ALLOCNO_REGNO (cp->second), cp->freq, + cp->insn != NULL + ? "move" : cp->constraint_p ? "constraint" : "shuffle"); } /* Print info about copy CP into stderr. */ @@ -1266,7 +1442,7 @@ ira_traverse_loop_tree (bool bb_p, ira_loop_tree_node_t loop_node, if (preorder_func != NULL) (*preorder_func) (loop_node); - + if (bb_p) for (subloop_node = loop_node->children; subloop_node != NULL; @@ -1275,11 +1451,11 @@ ira_traverse_loop_tree (bool bb_p, ira_loop_tree_node_t loop_node, { if (preorder_func != NULL) (*preorder_func) (subloop_node); - + if (postorder_func != NULL) (*postorder_func) (subloop_node); } - + for (subloop_node = loop_node->subloops; subloop_node != NULL; subloop_node = subloop_node->subloop_next) @@ -1321,7 +1497,7 @@ create_insn_allocnos (rtx x, bool output_p) if ((a = ira_curr_regno_allocno_map[regno]) == NULL) a = ira_create_allocno (regno, false, ira_curr_loop_tree_node); - + ALLOCNO_NREFS (a)++; ALLOCNO_FREQ (a) += REG_FREQ_FROM_BB (curr_bb); if (output_p) @@ -1345,7 +1521,7 @@ create_insn_allocnos (rtx x, bool output_p) create_insn_allocnos (XEXP (x, 0), false); return; } - else if (code == PRE_DEC || code == POST_DEC || code == PRE_INC || + else if (code == PRE_DEC || code == POST_DEC || code == PRE_INC || code == POST_INC || code == POST_MODIFY || code == PRE_MODIFY) { create_insn_allocnos (XEXP (x, 0), true); @@ -1378,7 +1554,7 @@ create_bb_allocnos (ira_loop_tree_node_t bb_node) curr_bb = bb = bb_node->bb; ira_assert (bb != NULL); FOR_BB_INSNS_REVERSE (bb, insn) - if (INSN_P (insn)) + if (NONDEBUG_INSN_P (insn)) create_insn_allocnos (PATTERN (insn), false); /* It might be a allocno living through from one subloop to another. */ @@ -1436,9 +1612,9 @@ create_loop_tree_node_allocnos (ira_loop_tree_node_t loop_node) FOR_EACH_EDGE (e, ei, loop_node->loop->header->preds) if (e->src != loop_node->loop->latch) create_loop_allocnos (e); - + edges = get_loop_exit_edges (loop_node->loop); - for (i = 0; VEC_iterate (edge, edges, i, e); i++) + FOR_EACH_VEC_ELT (edge, edges, i, e) create_loop_allocnos (e); VEC_free (edge, heap, edges); } @@ -1470,8 +1646,8 @@ propagate_allocno_info (void) ira_loop_tree_node_t parent; enum reg_class cover_class; - if (flag_ira_algorithm != IRA_ALGORITHM_REGIONAL - && flag_ira_algorithm != IRA_ALGORITHM_MIXED) + if (flag_ira_region != IRA_REGION_ALL + && flag_ira_region != IRA_REGION_MIXED) return; for (i = max_reg_num () - 1; i >= FIRST_PSEUDO_REGISTER; i--) for (a = ira_regno_allocno_map[i]; @@ -1484,15 +1660,12 @@ propagate_allocno_info (void) && bitmap_bit_p (ALLOCNO_LOOP_TREE_NODE (a)->border_allocnos, ALLOCNO_NUM (a))) { + if (! ALLOCNO_BAD_SPILL_P (a)) + ALLOCNO_BAD_SPILL_P (parent_a) = false; ALLOCNO_NREFS (parent_a) += ALLOCNO_NREFS (a); ALLOCNO_FREQ (parent_a) += ALLOCNO_FREQ (a); ALLOCNO_CALL_FREQ (parent_a) += ALLOCNO_CALL_FREQ (a); -#ifdef STACK_REGS - if (ALLOCNO_TOTAL_NO_STACK_REG_P (a)) - ALLOCNO_TOTAL_NO_STACK_REG_P (parent_a) = true; -#endif - IOR_HARD_REG_SET (ALLOCNO_TOTAL_CONFLICT_HARD_REGS (parent_a), - ALLOCNO_TOTAL_CONFLICT_HARD_REGS (a)); + merge_hard_reg_conflicts (a, parent_a, true); ALLOCNO_CALLS_CROSSED_NUM (parent_a) += ALLOCNO_CALLS_CROSSED_NUM (a); ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (parent_a) @@ -1509,8 +1682,6 @@ propagate_allocno_info (void) ALLOCNO_COVER_CLASS_COST (parent_a) += ALLOCNO_COVER_CLASS_COST (a); ALLOCNO_MEMORY_COST (parent_a) += ALLOCNO_MEMORY_COST (a); - ALLOCNO_UPDATED_MEMORY_COST (parent_a) - += ALLOCNO_UPDATED_MEMORY_COST (a); } } @@ -1535,90 +1706,70 @@ create_allocnos (void) will hardly improve the result. As a result we speed up regional register allocation. */ -/* Merge ranges R1 and R2 and returns the result. The function - maintains the order of ranges and tries to minimize number of the - result ranges. */ -static allocno_live_range_t -merge_ranges (allocno_live_range_t r1, allocno_live_range_t r2) +/* The function changes the object in range list given by R to OBJ. */ +static void +change_object_in_range_list (live_range_t r, ira_object_t obj) { - allocno_live_range_t first, last, temp; + for (; r != NULL; r = r->next) + r->object = obj; +} - if (r1 == NULL) - return r2; - if (r2 == NULL) - return r1; - for (first = last = NULL; r1 != NULL && r2 != NULL;) +/* Move all live ranges associated with allocno FROM to allocno TO. */ +static void +move_allocno_live_ranges (ira_allocno_t from, ira_allocno_t to) +{ + int i; + int n = ALLOCNO_NUM_OBJECTS (from); + + gcc_assert (n == ALLOCNO_NUM_OBJECTS (to)); + + for (i = 0; i < n; i++) { - if (r1->start < r2->start) - { - temp = r1; - r1 = r2; - r2 = temp; - } - if (r1->start <= r2->finish + 1) - { - /* Intersected ranges: merge r1 and r2 into r1. */ - r1->start = r2->start; - if (r1->finish < r2->finish) - r1->finish = r2->finish; - temp = r2; - r2 = r2->next; - ira_finish_allocno_live_range (temp); - if (r2 == NULL) - { - /* To try to merge with subsequent ranges in r1. */ - r2 = r1->next; - r1->next = NULL; - } - } - else + ira_object_t from_obj = ALLOCNO_OBJECT (from, i); + ira_object_t to_obj = ALLOCNO_OBJECT (to, i); + live_range_t lr = OBJECT_LIVE_RANGES (from_obj); + + if (internal_flag_ira_verbose > 4 && ira_dump_file != NULL) { - /* Add r1 to the result. */ - if (first == NULL) - first = last = r1; - else - { - last->next = r1; - last = r1; - } - r1 = r1->next; - if (r1 == NULL) - { - /* To try to merge with subsequent ranges in r2. */ - r1 = r2->next; - r2->next = NULL; - } + fprintf (ira_dump_file, + " Moving ranges of a%dr%d to a%dr%d: ", + ALLOCNO_NUM (from), ALLOCNO_REGNO (from), + ALLOCNO_NUM (to), ALLOCNO_REGNO (to)); + ira_print_live_range_list (ira_dump_file, lr); } + change_object_in_range_list (lr, to_obj); + OBJECT_LIVE_RANGES (to_obj) + = ira_merge_live_ranges (lr, OBJECT_LIVE_RANGES (to_obj)); + OBJECT_LIVE_RANGES (from_obj) = NULL; } - if (r1 != NULL) +} + +static void +copy_allocno_live_ranges (ira_allocno_t from, ira_allocno_t to) +{ + int i; + int n = ALLOCNO_NUM_OBJECTS (from); + + gcc_assert (n == ALLOCNO_NUM_OBJECTS (to)); + + for (i = 0; i < n; i++) { - if (first == NULL) - first = r1; - else - last->next = r1; - ira_assert (r1->next == NULL); + ira_object_t from_obj = ALLOCNO_OBJECT (from, i); + ira_object_t to_obj = ALLOCNO_OBJECT (to, i); + live_range_t lr = OBJECT_LIVE_RANGES (from_obj); + + if (internal_flag_ira_verbose > 4 && ira_dump_file != NULL) + { + fprintf (ira_dump_file, " Copying ranges of a%dr%d to a%dr%d: ", + ALLOCNO_NUM (from), ALLOCNO_REGNO (from), + ALLOCNO_NUM (to), ALLOCNO_REGNO (to)); + ira_print_live_range_list (ira_dump_file, lr); + } + lr = ira_copy_live_range_list (lr); + change_object_in_range_list (lr, to_obj); + OBJECT_LIVE_RANGES (to_obj) + = ira_merge_live_ranges (lr, OBJECT_LIVE_RANGES (to_obj)); } - else if (r2 != NULL) - { - if (first == NULL) - first = r2; - else - last->next = r2; - ira_assert (r2->next == NULL); - } - else - { - ira_assert (last->next == NULL); - } - return first; -} - -/* The function changes allocno in range list given by R onto A. */ -static void -change_allocno_in_range_list (allocno_live_range_t r, ira_allocno_t a) -{ - for (; r != NULL; r = r->next) - r->allocno = a; } /* Return TRUE if NODE represents a loop with low register @@ -1628,10 +1779,10 @@ low_pressure_loop_node_p (ira_loop_tree_node_t node) { int i; enum reg_class cover_class; - + if (node->bb != NULL) return false; - + for (i = 0; i < ira_reg_class_cover_size; i++) { cover_class = ira_reg_class_cover[i]; @@ -1642,18 +1793,106 @@ low_pressure_loop_node_p (ira_loop_tree_node_t node) return true; } -/* Return TRUE if NODE represents a loop with should be removed from - regional allocation. We remove a loop with low register pressure - inside another loop with register pressure. In this case a - separate allocation of the loop hardly helps (for irregular - register file architecture it could help by choosing a better hard - register in the loop but we prefer faster allocation even in this - case). */ -static bool -loop_node_to_be_removed_p (ira_loop_tree_node_t node) +/* Sort loops for marking them for removal. We put already marked + loops first, then less frequent loops next, and then outer loops + next. */ +static int +loop_compare_func (const void *v1p, const void *v2p) { - return (node->parent != NULL && low_pressure_loop_node_p (node->parent) - && low_pressure_loop_node_p (node)); + int diff; + ira_loop_tree_node_t l1 = *(const ira_loop_tree_node_t *) v1p; + ira_loop_tree_node_t l2 = *(const ira_loop_tree_node_t *) v2p; + + ira_assert (l1->parent != NULL && l2->parent != NULL); + if (l1->to_remove_p && ! l2->to_remove_p) + return -1; + if (! l1->to_remove_p && l2->to_remove_p) + return 1; + if ((diff = l1->loop->header->frequency - l2->loop->header->frequency) != 0) + return diff; + if ((diff = (int) loop_depth (l1->loop) - (int) loop_depth (l2->loop)) != 0) + return diff; + /* Make sorting stable. */ + return l1->loop->num - l2->loop->num; +} + + +/* Mark loops which should be removed from regional allocation. We + remove a loop with low register pressure inside another loop with + register pressure. In this case a separate allocation of the loop + hardly helps (for irregular register file architecture it could + help by choosing a better hard register in the loop but we prefer + faster allocation even in this case). We also remove cheap loops + if there are more than IRA_MAX_LOOPS_NUM of them. */ +static void +mark_loops_for_removal (void) +{ + int i, n; + ira_loop_tree_node_t *sorted_loops; + loop_p loop; + + sorted_loops + = (ira_loop_tree_node_t *) ira_allocate (sizeof (ira_loop_tree_node_t) + * VEC_length (loop_p, + ira_loops.larray)); + for (n = i = 0; VEC_iterate (loop_p, ira_loops.larray, i, loop); i++) + if (ira_loop_nodes[i].regno_allocno_map != NULL) + { + if (ira_loop_nodes[i].parent == NULL) + { + /* Don't remove the root. */ + ira_loop_nodes[i].to_remove_p = false; + continue; + } + sorted_loops[n++] = &ira_loop_nodes[i]; + ira_loop_nodes[i].to_remove_p + = (low_pressure_loop_node_p (ira_loop_nodes[i].parent) + && low_pressure_loop_node_p (&ira_loop_nodes[i])); + } + qsort (sorted_loops, n, sizeof (ira_loop_tree_node_t), loop_compare_func); + for (i = 0; n - i + 1 > IRA_MAX_LOOPS_NUM; i++) + { + sorted_loops[i]->to_remove_p = true; + if (internal_flag_ira_verbose > 1 && ira_dump_file != NULL) + fprintf + (ira_dump_file, + " Mark loop %d (header %d, freq %d, depth %d) for removal (%s)\n", + sorted_loops[i]->loop->num, sorted_loops[i]->loop->header->index, + sorted_loops[i]->loop->header->frequency, + loop_depth (sorted_loops[i]->loop), + low_pressure_loop_node_p (sorted_loops[i]->parent) + && low_pressure_loop_node_p (sorted_loops[i]) + ? "low pressure" : "cheap loop"); + } + ira_free (sorted_loops); +} + +/* Mark all loops but root for removing. */ +static void +mark_all_loops_for_removal (void) +{ + int i; + loop_p loop; + + FOR_EACH_VEC_ELT (loop_p, ira_loops.larray, i, loop) + if (ira_loop_nodes[i].regno_allocno_map != NULL) + { + if (ira_loop_nodes[i].parent == NULL) + { + /* Don't remove the root. */ + ira_loop_nodes[i].to_remove_p = false; + continue; + } + ira_loop_nodes[i].to_remove_p = true; + if (internal_flag_ira_verbose > 1 && ira_dump_file != NULL) + fprintf + (ira_dump_file, + " Mark loop %d (header %d, freq %d, depth %d) for removal\n", + ira_loop_nodes[i].loop->num, + ira_loop_nodes[i].loop->header->index, + ira_loop_nodes[i].loop->header->frequency, + loop_depth (ira_loop_nodes[i].loop)); + } } /* Definition of vector of loop tree nodes. */ @@ -1675,7 +1914,7 @@ remove_uneccesary_loop_nodes_from_loop_tree (ira_loop_tree_node_t node) bool remove_p; ira_loop_tree_node_t subnode; - remove_p = loop_node_to_be_removed_p (node); + remove_p = node->to_remove_p; if (! remove_p) VEC_safe_push (ira_loop_tree_node_t, heap, children_vec, node); start = VEC_length (ira_loop_tree_node_t, children_vec); @@ -1704,109 +1943,245 @@ remove_uneccesary_loop_nodes_from_loop_tree (ira_loop_tree_node_t node) } } +/* Return TRUE if NODE is inside PARENT. */ +static bool +loop_is_inside_p (ira_loop_tree_node_t node, ira_loop_tree_node_t parent) +{ + for (node = node->parent; node != NULL; node = node->parent) + if (node == parent) + return true; + return false; +} + +/* Sort allocnos according to their order in regno allocno list. */ +static int +regno_allocno_order_compare_func (const void *v1p, const void *v2p) +{ + ira_allocno_t a1 = *(const ira_allocno_t *) v1p; + ira_allocno_t a2 = *(const ira_allocno_t *) v2p; + ira_loop_tree_node_t n1 = ALLOCNO_LOOP_TREE_NODE (a1); + ira_loop_tree_node_t n2 = ALLOCNO_LOOP_TREE_NODE (a2); + + if (loop_is_inside_p (n1, n2)) + return -1; + else if (loop_is_inside_p (n2, n1)) + return 1; + /* If allocnos are equally good, sort by allocno numbers, so that + the results of qsort leave nothing to chance. We put allocnos + with higher number first in the list because it is the original + order for allocnos from loops on the same levels. */ + return ALLOCNO_NUM (a2) - ALLOCNO_NUM (a1); +} + +/* This array is used to sort allocnos to restore allocno order in + the regno allocno list. */ +static ira_allocno_t *regno_allocnos; + +/* Restore allocno order for REGNO in the regno allocno list. */ +static void +ira_rebuild_regno_allocno_list (int regno) +{ + int i, n; + ira_allocno_t a; + + for (n = 0, a = ira_regno_allocno_map[regno]; + a != NULL; + a = ALLOCNO_NEXT_REGNO_ALLOCNO (a)) + regno_allocnos[n++] = a; + ira_assert (n > 0); + qsort (regno_allocnos, n, sizeof (ira_allocno_t), + regno_allocno_order_compare_func); + for (i = 1; i < n; i++) + ALLOCNO_NEXT_REGNO_ALLOCNO (regno_allocnos[i - 1]) = regno_allocnos[i]; + ALLOCNO_NEXT_REGNO_ALLOCNO (regno_allocnos[n - 1]) = NULL; + ira_regno_allocno_map[regno] = regno_allocnos[0]; + if (internal_flag_ira_verbose > 1 && ira_dump_file != NULL) + fprintf (ira_dump_file, " Rebuilding regno allocno list for %d\n", regno); +} + +/* Propagate info from allocno FROM_A to allocno A. */ +static void +propagate_some_info_from_allocno (ira_allocno_t a, ira_allocno_t from_a) +{ + enum reg_class cover_class; + + merge_hard_reg_conflicts (from_a, a, false); + ALLOCNO_NREFS (a) += ALLOCNO_NREFS (from_a); + ALLOCNO_FREQ (a) += ALLOCNO_FREQ (from_a); + ALLOCNO_CALL_FREQ (a) += ALLOCNO_CALL_FREQ (from_a); + ALLOCNO_CALLS_CROSSED_NUM (a) += ALLOCNO_CALLS_CROSSED_NUM (from_a); + ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (a) + += ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (from_a); + if (! ALLOCNO_BAD_SPILL_P (from_a)) + ALLOCNO_BAD_SPILL_P (a) = false; + cover_class = ALLOCNO_COVER_CLASS (from_a); + ira_assert (cover_class == ALLOCNO_COVER_CLASS (a)); + ira_allocate_and_accumulate_costs (&ALLOCNO_HARD_REG_COSTS (a), cover_class, + ALLOCNO_HARD_REG_COSTS (from_a)); + ira_allocate_and_accumulate_costs (&ALLOCNO_CONFLICT_HARD_REG_COSTS (a), + cover_class, + ALLOCNO_CONFLICT_HARD_REG_COSTS (from_a)); + ALLOCNO_COVER_CLASS_COST (a) += ALLOCNO_COVER_CLASS_COST (from_a); + ALLOCNO_MEMORY_COST (a) += ALLOCNO_MEMORY_COST (from_a); +} + /* Remove allocnos from loops removed from the allocation consideration. */ static void remove_unnecessary_allocnos (void) { int regno; - bool merged_p; - enum reg_class cover_class; + bool merged_p, rebuild_p; ira_allocno_t a, prev_a, next_a, parent_a; ira_loop_tree_node_t a_node, parent; - allocno_live_range_t r; merged_p = false; + regno_allocnos = NULL; for (regno = max_reg_num () - 1; regno >= FIRST_PSEUDO_REGISTER; regno--) - for (prev_a = NULL, a = ira_regno_allocno_map[regno]; - a != NULL; - a = next_a) - { - next_a = ALLOCNO_NEXT_REGNO_ALLOCNO (a); - a_node = ALLOCNO_LOOP_TREE_NODE (a); - if (! loop_node_to_be_removed_p (a_node)) - prev_a = a; - else - { - for (parent = a_node->parent; - (parent_a = parent->regno_allocno_map[regno]) == NULL - && loop_node_to_be_removed_p (parent); - parent = parent->parent) - ; - if (parent_a == NULL) - { - /* There are no allocnos with the same regno in upper - region -- just move the allocno to the upper - region. */ - prev_a = a; - ALLOCNO_LOOP_TREE_NODE (a) = parent; - parent->regno_allocno_map[regno] = a; - bitmap_set_bit (parent->all_allocnos, ALLOCNO_NUM (a)); - } - else - { - /* Remove the allocno and update info of allocno in - the upper region. */ - if (prev_a == NULL) - ira_regno_allocno_map[regno] = next_a; - else - ALLOCNO_NEXT_REGNO_ALLOCNO (prev_a) = next_a; - r = ALLOCNO_LIVE_RANGES (a); - change_allocno_in_range_list (r, parent_a); - ALLOCNO_LIVE_RANGES (parent_a) - = merge_ranges (r, ALLOCNO_LIVE_RANGES (parent_a)); - merged_p = true; - ALLOCNO_LIVE_RANGES (a) = NULL; - IOR_HARD_REG_SET (ALLOCNO_CONFLICT_HARD_REGS (parent_a), - ALLOCNO_CONFLICT_HARD_REGS (a)); -#ifdef STACK_REGS - if (ALLOCNO_NO_STACK_REG_P (a)) - ALLOCNO_NO_STACK_REG_P (parent_a) = true; -#endif - ALLOCNO_NREFS (parent_a) += ALLOCNO_NREFS (a); - ALLOCNO_FREQ (parent_a) += ALLOCNO_FREQ (a); - ALLOCNO_CALL_FREQ (parent_a) += ALLOCNO_CALL_FREQ (a); - IOR_HARD_REG_SET - (ALLOCNO_TOTAL_CONFLICT_HARD_REGS (parent_a), - ALLOCNO_TOTAL_CONFLICT_HARD_REGS (a)); - ALLOCNO_CALLS_CROSSED_NUM (parent_a) - += ALLOCNO_CALLS_CROSSED_NUM (a); - ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (parent_a) - += ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (a); + { + rebuild_p = false; + for (prev_a = NULL, a = ira_regno_allocno_map[regno]; + a != NULL; + a = next_a) + { + next_a = ALLOCNO_NEXT_REGNO_ALLOCNO (a); + a_node = ALLOCNO_LOOP_TREE_NODE (a); + if (! a_node->to_remove_p) + prev_a = a; + else + { + for (parent = a_node->parent; + (parent_a = parent->regno_allocno_map[regno]) == NULL + && parent->to_remove_p; + parent = parent->parent) + ; + if (parent_a == NULL) + { + /* There are no allocnos with the same regno in + upper region -- just move the allocno to the + upper region. */ + prev_a = a; + ALLOCNO_LOOP_TREE_NODE (a) = parent; + parent->regno_allocno_map[regno] = a; + bitmap_set_bit (parent->all_allocnos, ALLOCNO_NUM (a)); + rebuild_p = true; + } + else + { + /* Remove the allocno and update info of allocno in + the upper region. */ + if (prev_a == NULL) + ira_regno_allocno_map[regno] = next_a; + else + ALLOCNO_NEXT_REGNO_ALLOCNO (prev_a) = next_a; + move_allocno_live_ranges (a, parent_a); + merged_p = true; + propagate_some_info_from_allocno (parent_a, a); + /* Remove it from the corresponding regno allocno + map to avoid info propagation of subsequent + allocno into this already removed allocno. */ + a_node->regno_allocno_map[regno] = NULL; + finish_allocno (a); + } + } + } + if (rebuild_p) + /* We need to restore the order in regno allocno list. */ + { + if (regno_allocnos == NULL) + regno_allocnos + = (ira_allocno_t *) ira_allocate (sizeof (ira_allocno_t) + * ira_allocnos_num); + ira_rebuild_regno_allocno_list (regno); + } + } + if (merged_p) + ira_rebuild_start_finish_chains (); + if (regno_allocnos != NULL) + ira_free (regno_allocnos); +} + +/* Remove allocnos from all loops but the root. */ +static void +remove_low_level_allocnos (void) +{ + int regno; + bool merged_p, propagate_p; + ira_allocno_t a, top_a; + ira_loop_tree_node_t a_node, parent; + ira_allocno_iterator ai; + + merged_p = false; + FOR_EACH_ALLOCNO (a, ai) + { + a_node = ALLOCNO_LOOP_TREE_NODE (a); + if (a_node == ira_loop_tree_root || ALLOCNO_CAP_MEMBER (a) != NULL) + continue; + regno = ALLOCNO_REGNO (a); + if ((top_a = ira_loop_tree_root->regno_allocno_map[regno]) == NULL) + { + ALLOCNO_LOOP_TREE_NODE (a) = ira_loop_tree_root; + ira_loop_tree_root->regno_allocno_map[regno] = a; + continue; + } + propagate_p = a_node->parent->regno_allocno_map[regno] == NULL; + /* Remove the allocno and update info of allocno in the upper + region. */ + move_allocno_live_ranges (a, top_a); + merged_p = true; + if (propagate_p) + propagate_some_info_from_allocno (top_a, a); + } + FOR_EACH_ALLOCNO (a, ai) + { + a_node = ALLOCNO_LOOP_TREE_NODE (a); + if (a_node == ira_loop_tree_root) + continue; + parent = a_node->parent; + regno = ALLOCNO_REGNO (a); + if (ALLOCNO_CAP_MEMBER (a) != NULL) + ira_assert (ALLOCNO_CAP (a) != NULL); + else if (ALLOCNO_CAP (a) == NULL) + ira_assert (parent->regno_allocno_map[regno] != NULL); + } + FOR_EACH_ALLOCNO (a, ai) + { + regno = ALLOCNO_REGNO (a); + if (ira_loop_tree_root->regno_allocno_map[regno] == a) + { + ira_object_t obj; + ira_allocno_object_iterator oi; + + ira_regno_allocno_map[regno] = a; + ALLOCNO_NEXT_REGNO_ALLOCNO (a) = NULL; + ALLOCNO_CAP_MEMBER (a) = NULL; + FOR_EACH_ALLOCNO_OBJECT (a, obj, oi) + COPY_HARD_REG_SET (OBJECT_CONFLICT_HARD_REGS (obj), + OBJECT_TOTAL_CONFLICT_HARD_REGS (obj)); #ifdef STACK_REGS - if (ALLOCNO_TOTAL_NO_STACK_REG_P (a)) - ALLOCNO_TOTAL_NO_STACK_REG_P (parent_a) = true; + if (ALLOCNO_TOTAL_NO_STACK_REG_P (a)) + ALLOCNO_NO_STACK_REG_P (a) = true; #endif - cover_class = ALLOCNO_COVER_CLASS (a); - ira_assert (cover_class == ALLOCNO_COVER_CLASS (parent_a)); - ira_allocate_and_accumulate_costs - (&ALLOCNO_HARD_REG_COSTS (parent_a), cover_class, - ALLOCNO_HARD_REG_COSTS (a)); - ira_allocate_and_accumulate_costs - (&ALLOCNO_CONFLICT_HARD_REG_COSTS (parent_a), - cover_class, - ALLOCNO_CONFLICT_HARD_REG_COSTS (a)); - ALLOCNO_COVER_CLASS_COST (parent_a) - += ALLOCNO_COVER_CLASS_COST (a); - ALLOCNO_MEMORY_COST (parent_a) += ALLOCNO_MEMORY_COST (a); - ALLOCNO_UPDATED_MEMORY_COST (parent_a) - += ALLOCNO_UPDATED_MEMORY_COST (a); - finish_allocno (a); - } - } - } + } + else + finish_allocno (a); + } if (merged_p) ira_rebuild_start_finish_chains (); } -/* Remove loops from consideration. We remove loops for which a - separate allocation will not improve the result. We have to do - this after allocno creation and their costs and cover class - evaluation because only after that the register pressure can be - known and is calculated. */ +/* Remove loops from consideration. We remove all loops except for + root if ALL_P or loops for which a separate allocation will not + improve the result. We have to do this after allocno creation and + their costs and cover class evaluation because only after that the + register pressure can be known and is calculated. */ static void -remove_unnecessary_regions (void) +remove_unnecessary_regions (bool all_p) { + if (all_p) + mark_all_loops_for_removal (); + else + mark_loops_for_removal (); children_vec = VEC_alloc (ira_loop_tree_node_t, heap, last_basic_block + VEC_length (loop_p, ira_loops.larray)); @@ -1815,7 +2190,10 @@ remove_unnecessary_regions (void) last_basic_block + VEC_length (loop_p, ira_loops.larray)); remove_uneccesary_loop_nodes_from_loop_tree (ira_loop_tree_root) ; VEC_free (ira_loop_tree_node_t, heap, children_vec); - remove_unnecessary_allocnos (); + if (all_p) + remove_low_level_allocnos (); + else + remove_unnecessary_allocnos (); while (VEC_length (ira_loop_tree_node_t, removed_loop_vec) > 0) finish_loop_tree_node (VEC_pop (ira_loop_tree_node_t, removed_loop_vec)); VEC_free (ira_loop_tree_node_t, heap, removed_loop_vec); @@ -1823,6 +2201,78 @@ remove_unnecessary_regions (void) +/* At this point true value of allocno attribute bad_spill_p means + that there is an insn where allocno occurs and where the allocno + can not be used as memory. The function updates the attribute, now + it can be true only for allocnos which can not be used as memory in + an insn and in whose live ranges there is other allocno deaths. + Spilling allocnos with true value will not improve the code because + it will not make other allocnos colorable and additional reloads + for the corresponding pseudo will be generated in reload pass for + each insn it occurs. + + This is a trick mentioned in one classic article of Chaitin etc + which is frequently omitted in other implementations of RA based on + graph coloring. */ +static void +update_bad_spill_attribute (void) +{ + int i; + ira_allocno_t a; + ira_allocno_iterator ai; + ira_allocno_object_iterator aoi; + ira_object_t obj; + live_range_t r; + enum reg_class cover_class; + bitmap_head dead_points[N_REG_CLASSES]; + + for (i = 0; i < ira_reg_class_cover_size; i++) + { + cover_class = ira_reg_class_cover[i]; + bitmap_initialize (&dead_points[cover_class], ®_obstack); + } + FOR_EACH_ALLOCNO (a, ai) + { + cover_class = ALLOCNO_COVER_CLASS (a); + if (cover_class == NO_REGS) + continue; + FOR_EACH_ALLOCNO_OBJECT (a, obj, aoi) + for (r = OBJECT_LIVE_RANGES (obj); r != NULL; r = r->next) + bitmap_set_bit (&dead_points[cover_class], r->finish); + } + FOR_EACH_ALLOCNO (a, ai) + { + cover_class = ALLOCNO_COVER_CLASS (a); + if (cover_class == NO_REGS) + continue; + if (! ALLOCNO_BAD_SPILL_P (a)) + continue; + FOR_EACH_ALLOCNO_OBJECT (a, obj, aoi) + { + for (r = OBJECT_LIVE_RANGES (obj); r != NULL; r = r->next) + { + for (i = r->start + 1; i < r->finish; i++) + if (bitmap_bit_p (&dead_points[cover_class], i)) + break; + if (i < r->finish) + break; + } + if (r != NULL) + { + ALLOCNO_BAD_SPILL_P (a) = false; + break; + } + } + } + for (i = 0; i < ira_reg_class_cover_size; i++) + { + cover_class = ira_reg_class_cover[i]; + bitmap_clear (&dead_points[cover_class]); + } +} + + + /* Set up minimal and maximal live range points for allocnos. */ static void setup_min_max_allocno_live_range_point (void) @@ -1830,52 +2280,71 @@ setup_min_max_allocno_live_range_point (void) int i; ira_allocno_t a, parent_a, cap; ira_allocno_iterator ai; - allocno_live_range_t r; +#ifdef ENABLE_IRA_CHECKING + ira_object_iterator oi; + ira_object_t obj; +#endif + live_range_t r; ira_loop_tree_node_t parent; FOR_EACH_ALLOCNO (a, ai) { - r = ALLOCNO_LIVE_RANGES (a); - if (r == NULL) - continue; - ALLOCNO_MAX (a) = r->finish; - for (; r->next != NULL; r = r->next) - ; - ALLOCNO_MIN (a) = r->start; + int n = ALLOCNO_NUM_OBJECTS (a); + for (i = 0; i < n; i++) + { + ira_object_t obj = ALLOCNO_OBJECT (a, i); + r = OBJECT_LIVE_RANGES (obj); + if (r == NULL) + continue; + OBJECT_MAX (obj) = r->finish; + for (; r->next != NULL; r = r->next) + ; + OBJECT_MIN (obj) = r->start; + } } for (i = max_reg_num () - 1; i >= FIRST_PSEUDO_REGISTER; i--) for (a = ira_regno_allocno_map[i]; a != NULL; a = ALLOCNO_NEXT_REGNO_ALLOCNO (a)) { - if (ALLOCNO_MAX (a) < 0) - continue; - ira_assert (ALLOCNO_CAP_MEMBER (a) == NULL); - /* Accumulation of range info. */ - if (ALLOCNO_CAP (a) != NULL) + int j; + int n = ALLOCNO_NUM_OBJECTS (a); + for (j = 0; j < n; j++) { - for (cap = ALLOCNO_CAP (a); cap != NULL; cap = ALLOCNO_CAP (cap)) + ira_object_t obj = ALLOCNO_OBJECT (a, j); + ira_object_t parent_obj; + + if (OBJECT_MAX (obj) < 0) + continue; + ira_assert (ALLOCNO_CAP_MEMBER (a) == NULL); + /* Accumulation of range info. */ + if (ALLOCNO_CAP (a) != NULL) { - if (ALLOCNO_MAX (cap) < ALLOCNO_MAX (a)) - ALLOCNO_MAX (cap) = ALLOCNO_MAX (a); - if (ALLOCNO_MIN (cap) > ALLOCNO_MIN (a)) - ALLOCNO_MIN (cap) = ALLOCNO_MIN (a); + for (cap = ALLOCNO_CAP (a); cap != NULL; cap = ALLOCNO_CAP (cap)) + { + ira_object_t cap_obj = ALLOCNO_OBJECT (cap, j); + if (OBJECT_MAX (cap_obj) < OBJECT_MAX (obj)) + OBJECT_MAX (cap_obj) = OBJECT_MAX (obj); + if (OBJECT_MIN (cap_obj) > OBJECT_MIN (obj)) + OBJECT_MIN (cap_obj) = OBJECT_MIN (obj); + } + continue; } - continue; + if ((parent = ALLOCNO_LOOP_TREE_NODE (a)->parent) == NULL) + continue; + parent_a = parent->regno_allocno_map[i]; + parent_obj = ALLOCNO_OBJECT (parent_a, j); + if (OBJECT_MAX (parent_obj) < OBJECT_MAX (obj)) + OBJECT_MAX (parent_obj) = OBJECT_MAX (obj); + if (OBJECT_MIN (parent_obj) > OBJECT_MIN (obj)) + OBJECT_MIN (parent_obj) = OBJECT_MIN (obj); } - if ((parent = ALLOCNO_LOOP_TREE_NODE (a)->parent) == NULL) - continue; - parent_a = parent->regno_allocno_map[i]; - if (ALLOCNO_MAX (parent_a) < ALLOCNO_MAX (a)) - ALLOCNO_MAX (parent_a) = ALLOCNO_MAX (a); - if (ALLOCNO_MIN (parent_a) > ALLOCNO_MIN (a)) - ALLOCNO_MIN (parent_a) = ALLOCNO_MIN (a); } #ifdef ENABLE_IRA_CHECKING - FOR_EACH_ALLOCNO (a, ai) + FOR_EACH_OBJECT (obj, oi) { - if ((0 <= ALLOCNO_MIN (a) && ALLOCNO_MIN (a) <= ira_max_point) - && (0 <= ALLOCNO_MAX (a) && ALLOCNO_MAX (a) <= ira_max_point)) + if ((0 <= OBJECT_MIN (obj) && OBJECT_MIN (obj) <= ira_max_point) + && (0 <= OBJECT_MAX (obj) && OBJECT_MAX (obj) <= ira_max_point)) continue; gcc_unreachable (); } @@ -1883,29 +2352,32 @@ setup_min_max_allocno_live_range_point (void) } /* Sort allocnos according to their live ranges. Allocnos with - smaller cover class are put first. Allocnos with the same cove - class are ordered according their start (min). Allocnos with the - same start are ordered according their finish (max). */ + smaller cover class are put first unless we use priority coloring. + Allocnos with the same cover class are ordered according their start + (min). Allocnos with the same start are ordered according their + finish (max). */ static int -allocno_range_compare_func (const void *v1p, const void *v2p) +object_range_compare_func (const void *v1p, const void *v2p) { int diff; - ira_allocno_t a1 = *(const ira_allocno_t *) v1p; - ira_allocno_t a2 = *(const ira_allocno_t *) v2p; + ira_object_t obj1 = *(const ira_object_t *) v1p; + ira_object_t obj2 = *(const ira_object_t *) v2p; + ira_allocno_t a1 = OBJECT_ALLOCNO (obj1); + ira_allocno_t a2 = OBJECT_ALLOCNO (obj2); - if ((diff = ALLOCNO_COVER_CLASS (a1) - ALLOCNO_COVER_CLASS (a2)) != 0) + if (flag_ira_algorithm != IRA_ALGORITHM_PRIORITY + && (diff = ALLOCNO_COVER_CLASS (a1) - ALLOCNO_COVER_CLASS (a2)) != 0) return diff; - if ((diff = ALLOCNO_MIN (a1) - ALLOCNO_MIN (a2)) != 0) + if ((diff = OBJECT_MIN (obj1) - OBJECT_MIN (obj2)) != 0) return diff; - if ((diff = ALLOCNO_MAX (a1) - ALLOCNO_MAX (a2)) != 0) + if ((diff = OBJECT_MAX (obj1) - OBJECT_MAX (obj2)) != 0) return diff; return ALLOCNO_NUM (a1) - ALLOCNO_NUM (a2); } -/* Sort ira_conflict_id_allocno_map and set up conflict id of - allocnos. */ +/* Sort ira_object_id_map and set up conflict id of allocnos. */ static void -sort_conflict_id_allocno_map (void) +sort_conflict_id_map (void) { int i, num; ira_allocno_t a; @@ -1913,14 +2385,23 @@ sort_conflict_id_allocno_map (void) num = 0; FOR_EACH_ALLOCNO (a, ai) - ira_conflict_id_allocno_map[num++] = a; - qsort (ira_conflict_id_allocno_map, num, sizeof (ira_allocno_t), - allocno_range_compare_func); + { + ira_allocno_object_iterator oi; + ira_object_t obj; + + FOR_EACH_ALLOCNO_OBJECT (a, obj, oi) + ira_object_id_map[num++] = obj; + } + qsort (ira_object_id_map, num, sizeof (ira_object_t), + object_range_compare_func); for (i = 0; i < num; i++) - if ((a = ira_conflict_id_allocno_map[i]) != NULL) - ALLOCNO_CONFLICT_ID (a) = i; - for (i = num; i < ira_allocnos_num; i++) - ira_conflict_id_allocno_map[i] = NULL; + { + ira_object_t obj = ira_object_id_map[i]; + gcc_assert (obj != NULL); + OBJECT_CONFLICT_ID (obj) = i; + } + for (i = num; i < ira_objects_num; i++) + ira_object_id_map[i] = NULL; } /* Set up minimal and maximal conflict ids of allocnos with which @@ -1928,20 +2409,27 @@ sort_conflict_id_allocno_map (void) static void setup_min_max_conflict_allocno_ids (void) { - enum reg_class cover_class; + int cover_class; int i, j, min, max, start, finish, first_not_finished, filled_area_start; int *live_range_min, *last_lived; + int word0_min, word0_max; ira_allocno_t a; + ira_allocno_iterator ai; - live_range_min = (int *) ira_allocate (sizeof (int) * ira_allocnos_num); + live_range_min = (int *) ira_allocate (sizeof (int) * ira_objects_num); cover_class = -1; first_not_finished = -1; - for (i = 0; i < ira_allocnos_num; i++) + for (i = 0; i < ira_objects_num; i++) { - a = ira_conflict_id_allocno_map[i]; - if (a == NULL) + ira_object_t obj = ira_object_id_map[i]; + if (obj == NULL) continue; - if (cover_class != ALLOCNO_COVER_CLASS (a)) + + a = OBJECT_ALLOCNO (obj); + + if (cover_class < 0 + || (flag_ira_algorithm != IRA_ALGORITHM_PRIORITY + && cover_class != (int) ALLOCNO_COVER_CLASS (a))) { cover_class = ALLOCNO_COVER_CLASS (a); min = i; @@ -1949,33 +2437,37 @@ setup_min_max_conflict_allocno_ids (void) } else { - start = ALLOCNO_MIN (a); + start = OBJECT_MIN (obj); /* If we skip an allocno, the allocno with smaller ids will be also skipped because of the secondary sorting the range finishes (see function - allocno_range_compare_func). */ + object_range_compare_func). */ while (first_not_finished < i - && start > ALLOCNO_MAX (ira_conflict_id_allocno_map - [first_not_finished])) + && start > OBJECT_MAX (ira_object_id_map + [first_not_finished])) first_not_finished++; min = first_not_finished; - } + } if (min == i) /* We could increase min further in this case but it is good enough. */ min++; - live_range_min[i] = ALLOCNO_MIN (a); - ALLOCNO_MIN (a) = min; + live_range_min[i] = OBJECT_MIN (obj); + OBJECT_MIN (obj) = min; } last_lived = (int *) ira_allocate (sizeof (int) * ira_max_point); cover_class = -1; filled_area_start = -1; - for (i = ira_allocnos_num - 1; i >= 0; i--) + for (i = ira_objects_num - 1; i >= 0; i--) { - a = ira_conflict_id_allocno_map[i]; - if (a == NULL) + ira_object_t obj = ira_object_id_map[i]; + if (obj == NULL) continue; - if (cover_class != ALLOCNO_COVER_CLASS (a)) + + a = OBJECT_ALLOCNO (obj); + if (cover_class < 0 + || (flag_ira_algorithm != IRA_ALGORITHM_PRIORITY + && cover_class != (int) ALLOCNO_COVER_CLASS (a))) { cover_class = ALLOCNO_COVER_CLASS (a); for (j = 0; j < ira_max_point; j++) @@ -1983,13 +2475,13 @@ setup_min_max_conflict_allocno_ids (void) filled_area_start = ira_max_point; } min = live_range_min[i]; - finish = ALLOCNO_MAX (a); + finish = OBJECT_MAX (obj); max = last_lived[finish]; if (max < 0) /* We could decrease max further in this case but it is good enough. */ - max = ALLOCNO_CONFLICT_ID (a) - 1; - ALLOCNO_MAX (a) = max; + max = OBJECT_CONFLICT_ID (obj) - 1; + OBJECT_MAX (obj) = max; /* In filling, we can go further A range finish to recognize intersection quickly because if the finish of subsequently processed allocno (it has smaller conflict id) range is @@ -2003,6 +2495,38 @@ setup_min_max_conflict_allocno_ids (void) } ira_free (last_lived); ira_free (live_range_min); + + /* For allocnos with more than one object, we may later record extra conflicts in + subobject 0 that we cannot really know about here. + For now, simply widen the min/max range of these subobjects. */ + + word0_min = INT_MAX; + word0_max = INT_MIN; + + FOR_EACH_ALLOCNO (a, ai) + { + int n = ALLOCNO_NUM_OBJECTS (a); + ira_object_t obj0; + if (n < 2) + continue; + obj0 = ALLOCNO_OBJECT (a, 0); + if (OBJECT_CONFLICT_ID (obj0) < word0_min) + word0_min = OBJECT_CONFLICT_ID (obj0); + if (OBJECT_CONFLICT_ID (obj0) > word0_max) + word0_max = OBJECT_CONFLICT_ID (obj0); + } + FOR_EACH_ALLOCNO (a, ai) + { + int n = ALLOCNO_NUM_OBJECTS (a); + ira_object_t obj0; + if (n < 2) + continue; + obj0 = ALLOCNO_OBJECT (a, 0); + if (OBJECT_MIN (obj0) > word0_min) + OBJECT_MIN (obj0) = word0_min; + if (OBJECT_MAX (obj0) < word0_max) + OBJECT_MAX (obj0) = word0_max; + } } @@ -2041,16 +2565,45 @@ create_caps (void) IR with one region. */ static ira_allocno_t *regno_top_level_allocno_map; +/* Find the allocno that corresponds to A at a level one higher up in the + loop tree. Returns NULL if A is a cap, or if it has no parent. */ +ira_allocno_t +ira_parent_allocno (ira_allocno_t a) +{ + ira_loop_tree_node_t parent; + + if (ALLOCNO_CAP (a) != NULL) + return NULL; + + parent = ALLOCNO_LOOP_TREE_NODE (a)->parent; + if (parent == NULL) + return NULL; + + return parent->regno_allocno_map[ALLOCNO_REGNO (a)]; +} + +/* Find the allocno that corresponds to A at a level one higher up in the + loop tree. If ALLOCNO_CAP is set for A, return that. */ +ira_allocno_t +ira_parent_or_cap_allocno (ira_allocno_t a) +{ + if (ALLOCNO_CAP (a) != NULL) + return ALLOCNO_CAP (a); + + return ira_parent_allocno (a); +} + /* Process all allocnos originated from pseudo REGNO and copy live - ranges from low level allocnos to final allocnos which are - destinations of removed stores at a loop exit. Return true if we - copied live ranges. */ + ranges, hard reg conflicts, and allocno stack reg attributes from + low level allocnos to final allocnos which are destinations of + removed stores at a loop exit. Return true if we copied live + ranges. */ static bool -copy_live_ranges_to_removed_store_destinations (int regno) +copy_info_to_removed_store_destinations (int regno) { - ira_allocno_t a, parent_a; + ira_allocno_t a; + ira_allocno_t parent_a = NULL; ira_loop_tree_node_t parent; - allocno_live_range_t r; bool merged_p; merged_p = false; @@ -2061,6 +2614,7 @@ copy_live_ranges_to_removed_store_destinations (int regno) if (a != regno_top_level_allocno_map[REGNO (ALLOCNO_REG (a))]) /* This allocno will be removed. */ continue; + /* Caps will be removed. */ ira_assert (ALLOCNO_CAP_MEMBER (a) == NULL); for (parent = ALLOCNO_LOOP_TREE_NODE (a)->parent; @@ -2073,20 +2627,15 @@ copy_live_ranges_to_removed_store_destinations (int regno) break; if (parent == NULL || parent_a == NULL) continue; - if (internal_flag_ira_verbose > 4 && ira_dump_file != NULL) - { - fprintf - (ira_dump_file, - " Coping ranges of a%dr%d to a%dr%d: ", - ALLOCNO_NUM (a), REGNO (ALLOCNO_REG (a)), - ALLOCNO_NUM (parent_a), REGNO (ALLOCNO_REG (parent_a))); - ira_print_live_range_list (ira_dump_file, - ALLOCNO_LIVE_RANGES (a)); - } - r = copy_allocno_live_range_list (ALLOCNO_LIVE_RANGES (a)); - change_allocno_in_range_list (r, parent_a); - ALLOCNO_LIVE_RANGES (parent_a) - = merge_ranges (r, ALLOCNO_LIVE_RANGES (parent_a)); + + copy_allocno_live_ranges (a, parent_a); + merge_hard_reg_conflicts (a, parent_a, true); + + ALLOCNO_CALL_FREQ (parent_a) += ALLOCNO_CALL_FREQ (a); + ALLOCNO_CALLS_CROSSED_NUM (parent_a) + += ALLOCNO_CALLS_CROSSED_NUM (a); + ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (parent_a) + += ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (a); merged_p = true; } return merged_p; @@ -2101,33 +2650,44 @@ copy_live_ranges_to_removed_store_destinations (int regno) void ira_flattening (int max_regno_before_emit, int ira_max_point_before_emit) { - int i, j, num; - bool propagate_p, stop_p, keep_p; + int i, j; + bool keep_p; int hard_regs_num; bool new_pseudos_p, merged_p, mem_dest_p; unsigned int n; enum reg_class cover_class; ira_allocno_t a, parent_a, first, second, node_first, node_second; ira_copy_t cp; - ira_loop_tree_node_t parent, node; - allocno_live_range_t r; + ira_loop_tree_node_t node; + live_range_t r; ira_allocno_iterator ai; ira_copy_iterator ci; - sparseset allocnos_live; - bool *allocno_propagated_p; regno_top_level_allocno_map = (ira_allocno_t *) ira_allocate (max_reg_num () * sizeof (ira_allocno_t)); memset (regno_top_level_allocno_map, 0, max_reg_num () * sizeof (ira_allocno_t)); - allocno_propagated_p - = (bool *) ira_allocate (ira_allocnos_num * sizeof (bool)); - memset (allocno_propagated_p, 0, ira_allocnos_num * sizeof (bool)); new_pseudos_p = merged_p = false; + FOR_EACH_ALLOCNO (a, ai) + { + ira_allocno_object_iterator oi; + ira_object_t obj; + if (ALLOCNO_CAP_MEMBER (a) != NULL) + /* Caps are not in the regno allocno maps and they are never + will be transformed into allocnos existing after IR + flattening. */ + continue; + FOR_EACH_ALLOCNO_OBJECT (a, obj, oi) + COPY_HARD_REG_SET (OBJECT_TOTAL_CONFLICT_HARD_REGS (obj), + OBJECT_CONFLICT_HARD_REGS (obj)); +#ifdef STACK_REGS + ALLOCNO_TOTAL_NO_STACK_REG_P (a) = ALLOCNO_NO_STACK_REG_P (a); +#endif + } /* Fix final allocno attributes. */ for (i = max_regno_before_emit - 1; i >= FIRST_PSEUDO_REGISTER; i--) { - mem_dest_p = propagate_p = false; + mem_dest_p = false; for (a = ira_regno_allocno_map[i]; a != NULL; a = ALLOCNO_NEXT_REGNO_ALLOCNO (a)) @@ -2135,80 +2695,37 @@ ira_flattening (int max_regno_before_emit, int ira_max_point_before_emit) ira_assert (ALLOCNO_CAP_MEMBER (a) == NULL); if (ALLOCNO_SOMEWHERE_RENAMED_P (a)) new_pseudos_p = true; - if (ALLOCNO_CAP (a) != NULL - || (parent = ALLOCNO_LOOP_TREE_NODE (a)->parent) == NULL - || ((parent_a = parent->regno_allocno_map[ALLOCNO_REGNO (a)]) - == NULL)) + parent_a = ira_parent_allocno (a); + if (parent_a == NULL) { ALLOCNO_COPIES (a) = NULL; regno_top_level_allocno_map[REGNO (ALLOCNO_REG (a))] = a; continue; } ira_assert (ALLOCNO_CAP_MEMBER (parent_a) == NULL); + if (ALLOCNO_MEM_OPTIMIZED_DEST (a) != NULL) mem_dest_p = true; - if (propagate_p) - { - if (!allocno_propagated_p [ALLOCNO_NUM (parent_a)]) - COPY_HARD_REG_SET (ALLOCNO_TOTAL_CONFLICT_HARD_REGS (parent_a), - ALLOCNO_CONFLICT_HARD_REGS (parent_a)); - IOR_HARD_REG_SET (ALLOCNO_TOTAL_CONFLICT_HARD_REGS (parent_a), - ALLOCNO_TOTAL_CONFLICT_HARD_REGS (a)); -#ifdef STACK_REGS - if (!allocno_propagated_p [ALLOCNO_NUM (parent_a)]) - ALLOCNO_TOTAL_NO_STACK_REG_P (parent_a) - = ALLOCNO_NO_STACK_REG_P (parent_a); - ALLOCNO_TOTAL_NO_STACK_REG_P (parent_a) - = (ALLOCNO_TOTAL_NO_STACK_REG_P (parent_a) - || ALLOCNO_TOTAL_NO_STACK_REG_P (a)); -#endif - allocno_propagated_p [ALLOCNO_NUM (parent_a)] = true; - } if (REGNO (ALLOCNO_REG (a)) == REGNO (ALLOCNO_REG (parent_a))) { - if (internal_flag_ira_verbose > 4 && ira_dump_file != NULL) - { - fprintf (ira_dump_file, - " Moving ranges of a%dr%d to a%dr%d: ", - ALLOCNO_NUM (a), REGNO (ALLOCNO_REG (a)), - ALLOCNO_NUM (parent_a), - REGNO (ALLOCNO_REG (parent_a))); - ira_print_live_range_list (ira_dump_file, - ALLOCNO_LIVE_RANGES (a)); - } - change_allocno_in_range_list (ALLOCNO_LIVE_RANGES (a), parent_a); - ALLOCNO_LIVE_RANGES (parent_a) - = merge_ranges (ALLOCNO_LIVE_RANGES (a), - ALLOCNO_LIVE_RANGES (parent_a)); + merge_hard_reg_conflicts (a, parent_a, true); + move_allocno_live_ranges (a, parent_a); merged_p = true; - ALLOCNO_LIVE_RANGES (a) = NULL; ALLOCNO_MEM_OPTIMIZED_DEST_P (parent_a) = (ALLOCNO_MEM_OPTIMIZED_DEST_P (parent_a) || ALLOCNO_MEM_OPTIMIZED_DEST_P (a)); continue; } new_pseudos_p = true; - propagate_p = true; - first = ALLOCNO_MEM_OPTIMIZED_DEST (a) == NULL ? NULL : a; - stop_p = false; for (;;) { - if (first == NULL - && ALLOCNO_MEM_OPTIMIZED_DEST (parent_a) != NULL) - first = parent_a; ALLOCNO_NREFS (parent_a) -= ALLOCNO_NREFS (a); ALLOCNO_FREQ (parent_a) -= ALLOCNO_FREQ (a); - if (first != NULL - && ALLOCNO_MEM_OPTIMIZED_DEST (first) == parent_a) - stop_p = true; - else if (!stop_p) - { - ALLOCNO_CALL_FREQ (parent_a) -= ALLOCNO_CALL_FREQ (a); - ALLOCNO_CALLS_CROSSED_NUM (parent_a) - -= ALLOCNO_CALLS_CROSSED_NUM (a); - ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (parent_a) - -= ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (a); - } + ALLOCNO_CALL_FREQ (parent_a) -= ALLOCNO_CALL_FREQ (a); + ALLOCNO_CALLS_CROSSED_NUM (parent_a) + -= ALLOCNO_CALLS_CROSSED_NUM (a); + ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (parent_a) + -= ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (a); ira_assert (ALLOCNO_CALLS_CROSSED_NUM (parent_a) >= 0 && ALLOCNO_NREFS (parent_a) >= 0 && ALLOCNO_FREQ (parent_a) >= 0); @@ -2227,62 +2744,67 @@ ira_flattening (int max_regno_before_emit, int ira_max_point_before_emit) ALLOCNO_COVER_CLASS_COST (parent_a) -= ALLOCNO_COVER_CLASS_COST (a); ALLOCNO_MEMORY_COST (parent_a) -= ALLOCNO_MEMORY_COST (a); - if (ALLOCNO_CAP (parent_a) != NULL - || (parent - = ALLOCNO_LOOP_TREE_NODE (parent_a)->parent) == NULL - || (parent_a = (parent->regno_allocno_map - [ALLOCNO_REGNO (parent_a)])) == NULL) + parent_a = ira_parent_allocno (parent_a); + if (parent_a == NULL) break; } ALLOCNO_COPIES (a) = NULL; regno_top_level_allocno_map[REGNO (ALLOCNO_REG (a))] = a; } - if (mem_dest_p && copy_live_ranges_to_removed_store_destinations (i)) + if (mem_dest_p && copy_info_to_removed_store_destinations (i)) merged_p = true; } - ira_free (allocno_propagated_p); ira_assert (new_pseudos_p || ira_max_point_before_emit == ira_max_point); if (merged_p || ira_max_point_before_emit != ira_max_point) ira_rebuild_start_finish_chains (); if (new_pseudos_p) { + sparseset objects_live; + /* Rebuild conflicts. */ FOR_EACH_ALLOCNO (a, ai) { + ira_allocno_object_iterator oi; + ira_object_t obj; if (a != regno_top_level_allocno_map[REGNO (ALLOCNO_REG (a))] || ALLOCNO_CAP_MEMBER (a) != NULL) continue; - for (r = ALLOCNO_LIVE_RANGES (a); r != NULL; r = r->next) - ira_assert (r->allocno == a); - clear_allocno_conflicts (a); + FOR_EACH_ALLOCNO_OBJECT (a, obj, oi) + { + for (r = OBJECT_LIVE_RANGES (obj); r != NULL; r = r->next) + ira_assert (r->object == obj); + clear_conflicts (obj); + } } - allocnos_live = sparseset_alloc (ira_allocnos_num); + objects_live = sparseset_alloc (ira_objects_num); for (i = 0; i < ira_max_point; i++) { for (r = ira_start_point_ranges[i]; r != NULL; r = r->start_next) { - a = r->allocno; + ira_object_t obj = r->object; + a = OBJECT_ALLOCNO (obj); if (a != regno_top_level_allocno_map[REGNO (ALLOCNO_REG (a))] || ALLOCNO_CAP_MEMBER (a) != NULL) continue; - num = ALLOCNO_NUM (a); + cover_class = ALLOCNO_COVER_CLASS (a); - sparseset_set_bit (allocnos_live, num); - EXECUTE_IF_SET_IN_SPARSESET (allocnos_live, n) + sparseset_set_bit (objects_live, OBJECT_CONFLICT_ID (obj)); + EXECUTE_IF_SET_IN_SPARSESET (objects_live, n) { - ira_allocno_t live_a = ira_allocnos[n]; - - if (cover_class == ALLOCNO_COVER_CLASS (live_a) + ira_object_t live_obj = ira_object_id_map[n]; + ira_allocno_t live_a = OBJECT_ALLOCNO (live_obj); + enum reg_class live_cover = ALLOCNO_COVER_CLASS (live_a); + if (ira_reg_classes_intersect_p[cover_class][live_cover] /* Don't set up conflict for the allocno with itself. */ - && num != (int) n) - ira_add_allocno_conflict (a, live_a); + && live_a != a) + ira_add_conflict (obj, live_obj); } } - + for (r = ira_finish_point_ranges[i]; r != NULL; r = r->finish_next) - sparseset_clear_bit (allocnos_live, ALLOCNO_NUM (r->allocno)); + sparseset_clear_bit (objects_live, OBJECT_CONFLICT_ID (r->object)); } - sparseset_free (allocnos_live); + sparseset_free (objects_live); compress_conflict_vecs (); } /* Mark some copies for removing and change allocnos in the rest @@ -2349,7 +2871,9 @@ ira_flattening (int max_regno_before_emit, int ira_max_point_before_emit) ALLOCNO_LOOP_TREE_NODE (a) = ira_loop_tree_root; ALLOCNO_REGNO (a) = REGNO (ALLOCNO_REG (a)); ALLOCNO_CAP (a) = NULL; + /* Restore updated costs for assignments from reload. */ ALLOCNO_UPDATED_MEMORY_COST (a) = ALLOCNO_MEMORY_COST (a); + ALLOCNO_UPDATED_COVER_CLASS_COST (a) = ALLOCNO_COVER_CLASS_COST (a); if (! ALLOCNO_ASSIGNED_P (a)) ira_free_allocno_updated_costs (a); ira_assert (ALLOCNO_UPDATED_HARD_REG_COSTS (a) == NULL); @@ -2371,6 +2895,8 @@ ira_flattening (int max_regno_before_emit, int ira_max_point_before_emit) ira_swap_allocno_copy_ends_if_necessary (cp); } rebuild_regno_allocno_maps (); + if (ira_max_point != ira_max_point_before_emit) + ira_compress_allocno_live_ranges (); ira_free (regno_top_level_allocno_map); } @@ -2404,6 +2930,44 @@ check_allocno_creation (void) } #endif +/* Identify allocnos which prefer a register class with a single hard register. + Adjust ALLOCNO_CONFLICT_HARD_REG_COSTS so that conflicting allocnos are + less likely to use the preferred singleton register. */ +static void +update_conflict_hard_reg_costs (void) +{ + ira_allocno_t a; + ira_allocno_iterator ai; + int i, index, min; + + FOR_EACH_ALLOCNO (a, ai) + { + enum reg_class cover_class = ALLOCNO_COVER_CLASS (a); + enum reg_class pref = reg_preferred_class (ALLOCNO_REGNO (a)); + + if (reg_class_size[pref] != 1) + continue; + index = (ira_class_hard_reg_index[cover_class] + [ira_class_hard_regs[pref][0]]); + if (index < 0) + continue; + if (ALLOCNO_CONFLICT_HARD_REG_COSTS (a) == NULL + || ALLOCNO_HARD_REG_COSTS (a) == NULL) + continue; + min = INT_MAX; + for (i = ira_class_hard_regs_num[cover_class] - 1; i >= 0; i--) + if (ALLOCNO_HARD_REG_COSTS (a)[i] > ALLOCNO_COVER_CLASS_COST (a) + && min > ALLOCNO_HARD_REG_COSTS (a)[i]) + min = ALLOCNO_HARD_REG_COSTS (a)[i]; + if (min == INT_MAX) + continue; + ira_allocate_and_set_costs (&ALLOCNO_CONFLICT_HARD_REG_COSTS (a), + cover_class, 0); + ALLOCNO_CONFLICT_HARD_REG_COSTS (a)[index] + -= min - ALLOCNO_COVER_CLASS_COST (a); + } +} + /* Create a internal representation (IR) for IRA (allocnos, copies, loop tree nodes). If LOOPS_P is FALSE the nodes corresponding to the loops (except the root which corresponds the all function) and @@ -2425,8 +2989,11 @@ ira_build (bool loops_p) form_loop_tree (); create_allocnos (); ira_costs (); + create_allocno_objects (); ira_create_allocno_live_ranges (); - remove_unnecessary_regions (); + remove_unnecessary_regions (false); + ira_compress_allocno_live_ranges (); + update_bad_spill_attribute (); loops_p = more_one_region_p (); if (loops_p) { @@ -2438,31 +3005,59 @@ ira_build (bool loops_p) check_allocno_creation (); #endif setup_min_max_allocno_live_range_point (); - sort_conflict_id_allocno_map (); + sort_conflict_id_map (); setup_min_max_conflict_allocno_ids (); ira_build_conflicts (); + update_conflict_hard_reg_costs (); + if (! ira_conflicts_p) + { + ira_allocno_t a; + ira_allocno_iterator ai; + + /* Remove all regions but root one. */ + if (loops_p) + { + remove_unnecessary_regions (true); + loops_p = false; + } + /* We don't save hard registers around calls for fast allocation + -- add caller clobbered registers as conflicting ones to + allocno crossing calls. */ + FOR_EACH_ALLOCNO (a, ai) + if (ALLOCNO_CALLS_CROSSED_NUM (a) != 0) + ior_hard_reg_conflicts (a, &call_used_reg_set); + } if (internal_flag_ira_verbose > 2 && ira_dump_file != NULL) print_copies (ira_dump_file); if (internal_flag_ira_verbose > 0 && ira_dump_file != NULL) { - int n, nr; + int n, nr, nr_big; ira_allocno_t a; - allocno_live_range_t r; + live_range_t r; ira_allocno_iterator ai; n = 0; - FOR_EACH_ALLOCNO (a, ai) - n += ALLOCNO_CONFLICT_ALLOCNOS_NUM (a); nr = 0; + nr_big = 0; FOR_EACH_ALLOCNO (a, ai) - for (r = ALLOCNO_LIVE_RANGES (a); r != NULL; r = r->next) - nr++; + { + int j, nobj = ALLOCNO_NUM_OBJECTS (a); + if (nobj > 1) + nr_big++; + for (j = 0; j < nobj; j++) + { + ira_object_t obj = ALLOCNO_OBJECT (a, j); + n += OBJECT_NUM_CONFLICTS (obj); + for (r = OBJECT_LIVE_RANGES (obj); r != NULL; r = r->next) + nr++; + } + } fprintf (ira_dump_file, " regions=%d, blocks=%d, points=%d\n", VEC_length (loop_p, ira_loops.larray), n_basic_blocks, ira_max_point); fprintf (ira_dump_file, - " allocnos=%d, copies=%d, conflicts=%d, ranges=%d\n", - ira_allocnos_num, ira_copies_num, n, nr); + " allocnos=%d (big %d), copies=%d, conflicts=%d, ranges=%d\n", + ira_allocnos_num, nr_big, ira_copies_num, n, nr); } return loops_p; }