Mercurial > hg > CbC > CbC_gcc
annotate gcc/ira-int.h @ 67:f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
| author | nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp> |
|---|---|
| date | Tue, 22 Mar 2011 17:18:12 +0900 |
| parents | b7f97abdc517 |
| children | 04ced10e8804 |
| rev | line source |
|---|---|
| 0 | 1 /* Integrated Register Allocator (IRA) intercommunication header file. |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
2 Copyright (C) 2006, 2007, 2008, 2009, 2010 |
| 0 | 3 Free Software Foundation, Inc. |
| 4 Contributed by Vladimir Makarov <vmakarov@redhat.com>. | |
| 5 | |
| 6 This file is part of GCC. | |
| 7 | |
| 8 GCC is free software; you can redistribute it and/or modify it under | |
| 9 the terms of the GNU General Public License as published by the Free | |
| 10 Software Foundation; either version 3, or (at your option) any later | |
| 11 version. | |
| 12 | |
| 13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
| 14 WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 16 for more details. | |
| 17 | |
| 18 You should have received a copy of the GNU General Public License | |
| 19 along with GCC; see the file COPYING3. If not see | |
| 20 <http://www.gnu.org/licenses/>. */ | |
| 21 | |
| 22 #include "cfgloop.h" | |
| 23 #include "ira.h" | |
| 24 #include "alloc-pool.h" | |
| 25 | |
| 26 /* To provide consistency in naming, all IRA external variables, | |
| 27 functions, common typedefs start with prefix ira_. */ | |
| 28 | |
| 29 #ifdef ENABLE_CHECKING | |
| 30 #define ENABLE_IRA_CHECKING | |
| 31 #endif | |
| 32 | |
| 33 #ifdef ENABLE_IRA_CHECKING | |
| 34 #define ira_assert(c) gcc_assert (c) | |
| 35 #else | |
| 36 /* Always define and include C, so that warnings for empty body in an | |
| 37 ‘if’ statement and unused variable do not occur. */ | |
| 38 #define ira_assert(c) ((void)(0 && (c))) | |
| 39 #endif | |
| 40 | |
| 41 /* Compute register frequency from edge frequency FREQ. It is | |
| 42 analogous to REG_FREQ_FROM_BB. When optimizing for size, or | |
| 43 profile driven feedback is available and the function is never | |
| 44 executed, frequency is always equivalent. Otherwise rescale the | |
| 45 edge frequency. */ | |
| 46 #define REG_FREQ_FROM_EDGE_FREQ(freq) \ | |
| 47 (optimize_size || (flag_branch_probabilities && !ENTRY_BLOCK_PTR->count) \ | |
| 48 ? REG_FREQ_MAX : (freq * REG_FREQ_MAX / BB_FREQ_MAX) \ | |
| 49 ? (freq * REG_FREQ_MAX / BB_FREQ_MAX) : 1) | |
| 50 | |
| 51 /* All natural loops. */ | |
| 52 extern struct loops ira_loops; | |
| 53 | |
| 54 /* A modified value of flag `-fira-verbose' used internally. */ | |
| 55 extern int internal_flag_ira_verbose; | |
| 56 | |
| 57 /* Dump file of the allocator if it is not NULL. */ | |
| 58 extern FILE *ira_dump_file; | |
| 59 | |
| 60 /* Typedefs for pointers to allocno live range, allocno, and copy of | |
| 61 allocnos. */ | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
62 typedef struct live_range *live_range_t; |
| 0 | 63 typedef struct ira_allocno *ira_allocno_t; |
| 64 typedef struct ira_allocno_copy *ira_copy_t; | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
65 typedef struct ira_object *ira_object_t; |
| 0 | 66 |
| 67 /* Definition of vector of allocnos and copies. */ | |
| 68 DEF_VEC_P(ira_allocno_t); | |
| 69 DEF_VEC_ALLOC_P(ira_allocno_t, heap); | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
70 DEF_VEC_P(ira_object_t); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
71 DEF_VEC_ALLOC_P(ira_object_t, heap); |
| 0 | 72 DEF_VEC_P(ira_copy_t); |
| 73 DEF_VEC_ALLOC_P(ira_copy_t, heap); | |
| 74 | |
| 75 /* Typedef for pointer to the subsequent structure. */ | |
| 76 typedef struct ira_loop_tree_node *ira_loop_tree_node_t; | |
| 77 | |
| 78 /* In general case, IRA is a regional allocator. The regions are | |
| 79 nested and form a tree. Currently regions are natural loops. The | |
| 80 following structure describes loop tree node (representing basic | |
| 81 block or loop). We need such tree because the loop tree from | |
| 82 cfgloop.h is not convenient for the optimization: basic blocks are | |
| 83 not a part of the tree from cfgloop.h. We also use the nodes for | |
| 84 storing additional information about basic blocks/loops for the | |
| 85 register allocation purposes. */ | |
| 86 struct ira_loop_tree_node | |
| 87 { | |
| 88 /* The node represents basic block if children == NULL. */ | |
| 89 basic_block bb; /* NULL for loop. */ | |
| 90 struct loop *loop; /* NULL for BB. */ | |
| 91 /* NEXT/SUBLOOP_NEXT is the next node/loop-node of the same parent. | |
| 92 SUBLOOP_NEXT is always NULL for BBs. */ | |
| 93 ira_loop_tree_node_t subloop_next, next; | |
| 94 /* CHILDREN/SUBLOOPS is the first node/loop-node immediately inside | |
| 95 the node. They are NULL for BBs. */ | |
| 96 ira_loop_tree_node_t subloops, children; | |
| 97 /* The node immediately containing given node. */ | |
| 98 ira_loop_tree_node_t parent; | |
| 99 | |
| 100 /* Loop level in range [0, ira_loop_tree_height). */ | |
| 101 int level; | |
| 102 | |
| 103 /* All the following members are defined only for nodes representing | |
| 104 loops. */ | |
| 105 | |
| 106 /* True if the loop was marked for removal from the register | |
| 107 allocation. */ | |
| 108 bool to_remove_p; | |
| 109 | |
| 110 /* Allocnos in the loop corresponding to their regnos. If it is | |
| 111 NULL the loop does not form a separate register allocation region | |
| 112 (e.g. because it has abnormal enter/exit edges and we can not put | |
| 113 code for register shuffling on the edges if a different | |
| 114 allocation is used for a pseudo-register on different sides of | |
| 115 the edges). Caps are not in the map (remember we can have more | |
| 116 one cap with the same regno in a region). */ | |
| 117 ira_allocno_t *regno_allocno_map; | |
| 118 | |
| 119 /* True if there is an entry to given loop not from its parent (or | |
| 120 grandparent) basic block. For example, it is possible for two | |
| 121 adjacent loops inside another loop. */ | |
| 122 bool entered_from_non_parent_p; | |
| 123 | |
| 124 /* Maximal register pressure inside loop for given register class | |
| 125 (defined only for the cover classes). */ | |
| 126 int reg_pressure[N_REG_CLASSES]; | |
| 127 | |
| 128 /* Numbers of allocnos referred or living in the loop node (except | |
| 129 for its subloops). */ | |
| 130 bitmap all_allocnos; | |
| 131 | |
| 132 /* Numbers of allocnos living at the loop borders. */ | |
| 133 bitmap border_allocnos; | |
| 134 | |
| 135 /* Regnos of pseudos modified in the loop node (including its | |
| 136 subloops). */ | |
| 137 bitmap modified_regnos; | |
| 138 | |
| 139 /* Numbers of copies referred in the corresponding loop. */ | |
| 140 bitmap local_copies; | |
| 141 }; | |
| 142 | |
| 143 /* The root of the loop tree corresponding to the all function. */ | |
| 144 extern ira_loop_tree_node_t ira_loop_tree_root; | |
| 145 | |
| 146 /* Height of the loop tree. */ | |
| 147 extern int ira_loop_tree_height; | |
| 148 | |
| 149 /* All nodes representing basic blocks are referred through the | |
| 150 following array. We can not use basic block member `aux' for this | |
| 151 because it is used for insertion of insns on edges. */ | |
| 152 extern ira_loop_tree_node_t ira_bb_nodes; | |
| 153 | |
| 154 /* Two access macros to the nodes representing basic blocks. */ | |
| 155 #if defined ENABLE_IRA_CHECKING && (GCC_VERSION >= 2007) | |
| 156 #define IRA_BB_NODE_BY_INDEX(index) __extension__ \ | |
| 157 (({ ira_loop_tree_node_t _node = (&ira_bb_nodes[index]); \ | |
| 158 if (_node->children != NULL || _node->loop != NULL || _node->bb == NULL)\ | |
| 159 { \ | |
| 160 fprintf (stderr, \ | |
| 161 "\n%s: %d: error in %s: it is not a block node\n", \ | |
| 162 __FILE__, __LINE__, __FUNCTION__); \ | |
| 163 gcc_unreachable (); \ | |
| 164 } \ | |
| 165 _node; })) | |
| 166 #else | |
| 167 #define IRA_BB_NODE_BY_INDEX(index) (&ira_bb_nodes[index]) | |
| 168 #endif | |
| 169 | |
| 170 #define IRA_BB_NODE(bb) IRA_BB_NODE_BY_INDEX ((bb)->index) | |
| 171 | |
| 172 /* All nodes representing loops are referred through the following | |
| 173 array. */ | |
| 174 extern ira_loop_tree_node_t ira_loop_nodes; | |
| 175 | |
| 176 /* Two access macros to the nodes representing loops. */ | |
| 177 #if defined ENABLE_IRA_CHECKING && (GCC_VERSION >= 2007) | |
| 178 #define IRA_LOOP_NODE_BY_INDEX(index) __extension__ \ | |
| 179 (({ ira_loop_tree_node_t const _node = (&ira_loop_nodes[index]);\ | |
| 180 if (_node->children == NULL || _node->bb != NULL || _node->loop == NULL)\ | |
| 181 { \ | |
| 182 fprintf (stderr, \ | |
| 183 "\n%s: %d: error in %s: it is not a loop node\n", \ | |
| 184 __FILE__, __LINE__, __FUNCTION__); \ | |
| 185 gcc_unreachable (); \ | |
| 186 } \ | |
| 187 _node; })) | |
| 188 #else | |
| 189 #define IRA_LOOP_NODE_BY_INDEX(index) (&ira_loop_nodes[index]) | |
| 190 #endif | |
| 191 | |
| 192 #define IRA_LOOP_NODE(loop) IRA_LOOP_NODE_BY_INDEX ((loop)->num) | |
| 193 | |
| 194 | |
| 195 /* The structure describes program points where a given allocno lives. | |
| 196 To save memory we store allocno conflicts only for the same cover | |
| 197 class allocnos which is enough to assign hard registers. To find | |
| 198 conflicts for other allocnos (e.g. to assign stack memory slot) we | |
| 199 use the live ranges. If the live ranges of two allocnos are | |
| 200 intersected, the allocnos are in conflict. */ | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
201 struct live_range |
| 0 | 202 { |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
203 /* Object whose live range is described by given structure. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
204 ira_object_t object; |
| 0 | 205 /* Program point range. */ |
| 206 int start, finish; | |
| 207 /* Next structure describing program points where the allocno | |
| 208 lives. */ | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
209 live_range_t next; |
| 0 | 210 /* Pointer to structures with the same start/finish. */ |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
211 live_range_t start_next, finish_next; |
| 0 | 212 }; |
| 213 | |
| 214 /* Program points are enumerated by numbers from range | |
| 215 0..IRA_MAX_POINT-1. There are approximately two times more program | |
| 216 points than insns. Program points are places in the program where | |
| 217 liveness info can be changed. In most general case (there are more | |
| 218 complicated cases too) some program points correspond to places | |
| 219 where input operand dies and other ones correspond to places where | |
| 220 output operands are born. */ | |
| 221 extern int ira_max_point; | |
| 222 | |
| 223 /* Arrays of size IRA_MAX_POINT mapping a program point to the allocno | |
| 224 live ranges with given start/finish point. */ | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
225 extern live_range_t *ira_start_point_ranges, *ira_finish_point_ranges; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
226 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
227 /* A structure representing conflict information for an allocno |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
228 (or one of its subwords). */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
229 struct ira_object |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
230 { |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
231 /* The allocno associated with this record. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
232 ira_allocno_t allocno; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
233 /* Vector of accumulated conflicting conflict_redords with NULL end |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
234 marker (if OBJECT_CONFLICT_VEC_P is true) or conflict bit vector |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
235 otherwise. Only ira_objects belonging to allocnos with the |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
236 same cover class are in the vector or in the bit vector. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
237 void *conflicts_array; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
238 /* Pointer to structures describing at what program point the |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
239 object lives. We always maintain the list in such way that *the |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
240 ranges in the list are not intersected and ordered by decreasing |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
241 their program points*. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
242 live_range_t live_ranges; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
243 /* The subword within ALLOCNO which is represented by this object. |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
244 Zero means the lowest-order subword (or the entire allocno in case |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
245 it is not being tracked in subwords). */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
246 int subword; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
247 /* Allocated size of the conflicts array. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
248 unsigned int conflicts_array_size; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
249 /* A unique number for every instance of this structure, which is used |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
250 to represent it in conflict bit vectors. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
251 int id; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
252 /* Before building conflicts, MIN and MAX are initialized to |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
253 correspondingly minimal and maximal points of the accumulated |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
254 live ranges. Afterwards, they hold the minimal and maximal ids |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
255 of other ira_objects that this one can conflict with. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
256 int min, max; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
257 /* Initial and accumulated hard registers conflicting with this |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
258 object and as a consequences can not be assigned to the allocno. |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
259 All non-allocatable hard regs and hard regs of cover classes |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
260 different from given allocno one are included in the sets. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
261 HARD_REG_SET conflict_hard_regs, total_conflict_hard_regs; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
262 /* Number of accumulated conflicts in the vector of conflicting |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
263 objects. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
264 int num_accumulated_conflicts; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
265 /* TRUE if conflicts are represented by a vector of pointers to |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
266 ira_object structures. Otherwise, we use a bit vector indexed |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
267 by conflict ID numbers. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
268 unsigned int conflict_vec_p : 1; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
269 }; |
| 0 | 270 |
| 271 /* A structure representing an allocno (allocation entity). Allocno | |
| 272 represents a pseudo-register in an allocation region. If | |
| 273 pseudo-register does not live in a region but it lives in the | |
| 274 nested regions, it is represented in the region by special allocno | |
| 275 called *cap*. There may be more one cap representing the same | |
| 276 pseudo-register in region. It means that the corresponding | |
| 277 pseudo-register lives in more one non-intersected subregion. */ | |
| 278 struct ira_allocno | |
| 279 { | |
| 280 /* The allocno order number starting with 0. Each allocno has an | |
| 281 unique number and the number is never changed for the | |
| 282 allocno. */ | |
| 283 int num; | |
| 284 /* Regno for allocno or cap. */ | |
| 285 int regno; | |
| 286 /* Mode of the allocno which is the mode of the corresponding | |
| 287 pseudo-register. */ | |
| 288 enum machine_mode mode; | |
| 289 /* Hard register assigned to given allocno. Negative value means | |
| 290 that memory was allocated to the allocno. During the reload, | |
| 291 spilled allocno has value equal to the corresponding stack slot | |
| 292 number (0, ...) - 2. Value -1 is used for allocnos spilled by the | |
| 293 reload (at this point pseudo-register has only one allocno) which | |
| 294 did not get stack slot yet. */ | |
| 295 int hard_regno; | |
| 296 /* Final rtx representation of the allocno. */ | |
| 297 rtx reg; | |
| 298 /* Allocnos with the same regno are linked by the following member. | |
| 299 Allocnos corresponding to inner loops are first in the list (it | |
| 300 corresponds to depth-first traverse of the loops). */ | |
| 301 ira_allocno_t next_regno_allocno; | |
| 302 /* There may be different allocnos with the same regno in different | |
| 303 regions. Allocnos are bound to the corresponding loop tree node. | |
| 304 Pseudo-register may have only one regular allocno with given loop | |
| 305 tree node but more than one cap (see comments above). */ | |
| 306 ira_loop_tree_node_t loop_tree_node; | |
| 307 /* Accumulated usage references of the allocno. Here and below, | |
| 308 word 'accumulated' means info for given region and all nested | |
| 309 subregions. In this case, 'accumulated' means sum of references | |
| 310 of the corresponding pseudo-register in this region and in all | |
| 311 nested subregions recursively. */ | |
| 312 int nrefs; | |
| 313 /* Accumulated frequency of usage of the allocno. */ | |
| 314 int freq; | |
| 315 /* Register class which should be used for allocation for given | |
| 316 allocno. NO_REGS means that we should use memory. */ | |
| 317 enum reg_class cover_class; | |
| 318 /* Minimal accumulated and updated costs of usage register of the | |
| 319 cover class for the allocno. */ | |
| 320 int cover_class_cost, updated_cover_class_cost; | |
| 321 /* Minimal accumulated, and updated costs of memory for the allocno. | |
| 322 At the allocation start, the original and updated costs are | |
| 323 equal. The updated cost may be changed after finishing | |
| 324 allocation in a region and starting allocation in a subregion. | |
| 325 The change reflects the cost of spill/restore code on the | |
| 326 subregion border if we assign memory to the pseudo in the | |
| 327 subregion. */ | |
| 328 int memory_cost, updated_memory_cost; | |
| 329 /* Accumulated number of points where the allocno lives and there is | |
| 330 excess pressure for its class. Excess pressure for a register | |
| 331 class at some point means that there are more allocnos of given | |
| 332 register class living at the point than number of hard-registers | |
| 333 of the class available for the allocation. */ | |
| 334 int excess_pressure_points_num; | |
| 335 /* Copies to other non-conflicting allocnos. The copies can | |
| 336 represent move insn or potential move insn usually because of two | |
| 337 operand insn constraints. */ | |
| 338 ira_copy_t allocno_copies; | |
| 339 /* It is a allocno (cap) representing given allocno on upper loop tree | |
| 340 level. */ | |
| 341 ira_allocno_t cap; | |
| 342 /* It is a link to allocno (cap) on lower loop level represented by | |
| 343 given cap. Null if given allocno is not a cap. */ | |
| 344 ira_allocno_t cap_member; | |
| 345 /* Coalesced allocnos form a cyclic list. One allocno given by | |
| 346 FIRST_COALESCED_ALLOCNO represents all coalesced allocnos. The | |
| 347 list is chained by NEXT_COALESCED_ALLOCNO. */ | |
| 348 ira_allocno_t first_coalesced_allocno; | |
| 349 ira_allocno_t next_coalesced_allocno; | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
350 /* The number of objects tracked in the following array. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
351 int num_objects; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
352 /* An array of structures describing conflict information and live |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
353 ranges for each object associated with the allocno. There may be |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
354 more than one such object in cases where the allocno represents a |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
355 multi-word register. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
356 ira_object_t objects[2]; |
| 0 | 357 /* Accumulated frequency of calls which given allocno |
| 358 intersects. */ | |
| 359 int call_freq; | |
| 360 /* Accumulated number of the intersected calls. */ | |
| 361 int calls_crossed_num; | |
| 362 /* TRUE if the allocno assigned to memory was a destination of | |
| 363 removed move (see ira-emit.c) at loop exit because the value of | |
| 364 the corresponding pseudo-register is not changed inside the | |
| 365 loop. */ | |
| 366 unsigned int mem_optimized_dest_p : 1; | |
| 367 /* TRUE if the corresponding pseudo-register has disjoint live | |
| 368 ranges and the other allocnos of the pseudo-register except this | |
| 369 one changed REG. */ | |
| 370 unsigned int somewhere_renamed_p : 1; | |
| 371 /* TRUE if allocno with the same REGNO in a subregion has been | |
| 372 renamed, in other words, got a new pseudo-register. */ | |
| 373 unsigned int child_renamed_p : 1; | |
| 374 /* During the reload, value TRUE means that we should not reassign a | |
| 375 hard register to the allocno got memory earlier. It is set up | |
| 376 when we removed memory-memory move insn before each iteration of | |
| 377 the reload. */ | |
| 378 unsigned int dont_reassign_p : 1; | |
| 379 #ifdef STACK_REGS | |
| 380 /* Set to TRUE if allocno can't be assigned to the stack hard | |
| 381 register correspondingly in this region and area including the | |
| 382 region and all its subregions recursively. */ | |
| 383 unsigned int no_stack_reg_p : 1, total_no_stack_reg_p : 1; | |
| 384 #endif | |
| 385 /* TRUE value means that there is no sense to spill the allocno | |
| 386 during coloring because the spill will result in additional | |
| 387 reloads in reload pass. */ | |
| 388 unsigned int bad_spill_p : 1; | |
| 389 /* TRUE value means that the allocno was not removed yet from the | |
| 390 conflicting graph during colouring. */ | |
| 391 unsigned int in_graph_p : 1; | |
| 392 /* TRUE if a hard register or memory has been assigned to the | |
| 393 allocno. */ | |
| 394 unsigned int assigned_p : 1; | |
| 395 /* TRUE if it is put on the stack to make other allocnos | |
| 396 colorable. */ | |
| 397 unsigned int may_be_spilled_p : 1; | |
| 398 /* TRUE if the allocno was removed from the splay tree used to | |
| 399 choose allocn for spilling (see ira-color.c::. */ | |
| 400 unsigned int splay_removed_p : 1; | |
| 401 /* Non NULL if we remove restoring value from given allocno to | |
| 402 MEM_OPTIMIZED_DEST at loop exit (see ira-emit.c) because the | |
| 403 allocno value is not changed inside the loop. */ | |
| 404 ira_allocno_t mem_optimized_dest; | |
| 405 /* Array of usage costs (accumulated and the one updated during | |
| 406 coloring) for each hard register of the allocno cover class. The | |
| 407 member value can be NULL if all costs are the same and equal to | |
| 408 COVER_CLASS_COST. For example, the costs of two different hard | |
| 409 registers can be different if one hard register is callee-saved | |
| 410 and another one is callee-used and the allocno lives through | |
| 411 calls. Another example can be case when for some insn the | |
| 412 corresponding pseudo-register value should be put in specific | |
| 413 register class (e.g. AREG for x86) which is a strict subset of | |
| 414 the allocno cover class (GENERAL_REGS for x86). We have updated | |
| 415 costs to reflect the situation when the usage cost of a hard | |
| 416 register is decreased because the allocno is connected to another | |
| 417 allocno by a copy and the another allocno has been assigned to | |
| 418 the hard register. */ | |
| 419 int *hard_reg_costs, *updated_hard_reg_costs; | |
| 420 /* Array of decreasing costs (accumulated and the one updated during | |
| 421 coloring) for allocnos conflicting with given allocno for hard | |
| 422 regno of the allocno cover class. The member value can be NULL | |
| 423 if all costs are the same. These costs are used to reflect | |
| 424 preferences of other allocnos not assigned yet during assigning | |
| 425 to given allocno. */ | |
| 426 int *conflict_hard_reg_costs, *updated_conflict_hard_reg_costs; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
427 /* Size (in hard registers) of the same cover class allocnos with |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
428 TRUE in_graph_p value and conflicting with given allocno during |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
429 each point of graph coloring. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
430 int left_conflicts_size; |
| 0 | 431 /* Number of hard registers of the allocno cover class really |
| 432 available for the allocno allocation. */ | |
| 433 int available_regs_num; | |
| 434 /* Allocnos in a bucket (used in coloring) chained by the following | |
| 435 two members. */ | |
| 436 ira_allocno_t next_bucket_allocno; | |
| 437 ira_allocno_t prev_bucket_allocno; | |
| 438 /* Used for temporary purposes. */ | |
| 439 int temp; | |
| 440 }; | |
| 441 | |
| 442 /* All members of the allocno structures should be accessed only | |
| 443 through the following macros. */ | |
| 444 #define ALLOCNO_NUM(A) ((A)->num) | |
| 445 #define ALLOCNO_REGNO(A) ((A)->regno) | |
| 446 #define ALLOCNO_REG(A) ((A)->reg) | |
| 447 #define ALLOCNO_NEXT_REGNO_ALLOCNO(A) ((A)->next_regno_allocno) | |
| 448 #define ALLOCNO_LOOP_TREE_NODE(A) ((A)->loop_tree_node) | |
| 449 #define ALLOCNO_CAP(A) ((A)->cap) | |
| 450 #define ALLOCNO_CAP_MEMBER(A) ((A)->cap_member) | |
| 451 #define ALLOCNO_NREFS(A) ((A)->nrefs) | |
| 452 #define ALLOCNO_FREQ(A) ((A)->freq) | |
| 453 #define ALLOCNO_HARD_REGNO(A) ((A)->hard_regno) | |
| 454 #define ALLOCNO_CALL_FREQ(A) ((A)->call_freq) | |
| 455 #define ALLOCNO_CALLS_CROSSED_NUM(A) ((A)->calls_crossed_num) | |
| 456 #define ALLOCNO_MEM_OPTIMIZED_DEST(A) ((A)->mem_optimized_dest) | |
| 457 #define ALLOCNO_MEM_OPTIMIZED_DEST_P(A) ((A)->mem_optimized_dest_p) | |
| 458 #define ALLOCNO_SOMEWHERE_RENAMED_P(A) ((A)->somewhere_renamed_p) | |
| 459 #define ALLOCNO_CHILD_RENAMED_P(A) ((A)->child_renamed_p) | |
| 460 #define ALLOCNO_DONT_REASSIGN_P(A) ((A)->dont_reassign_p) | |
| 461 #ifdef STACK_REGS | |
| 462 #define ALLOCNO_NO_STACK_REG_P(A) ((A)->no_stack_reg_p) | |
| 463 #define ALLOCNO_TOTAL_NO_STACK_REG_P(A) ((A)->total_no_stack_reg_p) | |
| 464 #endif | |
| 465 #define ALLOCNO_BAD_SPILL_P(A) ((A)->bad_spill_p) | |
| 466 #define ALLOCNO_IN_GRAPH_P(A) ((A)->in_graph_p) | |
| 467 #define ALLOCNO_ASSIGNED_P(A) ((A)->assigned_p) | |
| 468 #define ALLOCNO_MAY_BE_SPILLED_P(A) ((A)->may_be_spilled_p) | |
| 469 #define ALLOCNO_SPLAY_REMOVED_P(A) ((A)->splay_removed_p) | |
| 470 #define ALLOCNO_MODE(A) ((A)->mode) | |
| 471 #define ALLOCNO_COPIES(A) ((A)->allocno_copies) | |
| 472 #define ALLOCNO_HARD_REG_COSTS(A) ((A)->hard_reg_costs) | |
| 473 #define ALLOCNO_UPDATED_HARD_REG_COSTS(A) ((A)->updated_hard_reg_costs) | |
| 474 #define ALLOCNO_CONFLICT_HARD_REG_COSTS(A) \ | |
| 475 ((A)->conflict_hard_reg_costs) | |
| 476 #define ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS(A) \ | |
| 477 ((A)->updated_conflict_hard_reg_costs) | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
478 #define ALLOCNO_LEFT_CONFLICTS_SIZE(A) ((A)->left_conflicts_size) |
| 0 | 479 #define ALLOCNO_COVER_CLASS(A) ((A)->cover_class) |
| 480 #define ALLOCNO_COVER_CLASS_COST(A) ((A)->cover_class_cost) | |
| 481 #define ALLOCNO_UPDATED_COVER_CLASS_COST(A) ((A)->updated_cover_class_cost) | |
| 482 #define ALLOCNO_MEMORY_COST(A) ((A)->memory_cost) | |
| 483 #define ALLOCNO_UPDATED_MEMORY_COST(A) ((A)->updated_memory_cost) | |
| 484 #define ALLOCNO_EXCESS_PRESSURE_POINTS_NUM(A) ((A)->excess_pressure_points_num) | |
| 485 #define ALLOCNO_AVAILABLE_REGS_NUM(A) ((A)->available_regs_num) | |
| 486 #define ALLOCNO_NEXT_BUCKET_ALLOCNO(A) ((A)->next_bucket_allocno) | |
| 487 #define ALLOCNO_PREV_BUCKET_ALLOCNO(A) ((A)->prev_bucket_allocno) | |
| 488 #define ALLOCNO_TEMP(A) ((A)->temp) | |
| 489 #define ALLOCNO_FIRST_COALESCED_ALLOCNO(A) ((A)->first_coalesced_allocno) | |
| 490 #define ALLOCNO_NEXT_COALESCED_ALLOCNO(A) ((A)->next_coalesced_allocno) | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
491 #define ALLOCNO_OBJECT(A,N) ((A)->objects[N]) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
492 #define ALLOCNO_NUM_OBJECTS(A) ((A)->num_objects) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
493 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
494 #define OBJECT_ALLOCNO(C) ((C)->allocno) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
495 #define OBJECT_SUBWORD(C) ((C)->subword) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
496 #define OBJECT_CONFLICT_ARRAY(C) ((C)->conflicts_array) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
497 #define OBJECT_CONFLICT_VEC(C) ((ira_object_t *)(C)->conflicts_array) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
498 #define OBJECT_CONFLICT_BITVEC(C) ((IRA_INT_TYPE *)(C)->conflicts_array) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
499 #define OBJECT_CONFLICT_ARRAY_SIZE(C) ((C)->conflicts_array_size) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
500 #define OBJECT_CONFLICT_VEC_P(C) ((C)->conflict_vec_p) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
501 #define OBJECT_NUM_CONFLICTS(C) ((C)->num_accumulated_conflicts) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
502 #define OBJECT_CONFLICT_HARD_REGS(C) ((C)->conflict_hard_regs) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
503 #define OBJECT_TOTAL_CONFLICT_HARD_REGS(C) ((C)->total_conflict_hard_regs) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
504 #define OBJECT_MIN(C) ((C)->min) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
505 #define OBJECT_MAX(C) ((C)->max) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
506 #define OBJECT_CONFLICT_ID(C) ((C)->id) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
507 #define OBJECT_LIVE_RANGES(A) ((A)->live_ranges) |
| 0 | 508 |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
509 /* Map regno -> allocnos with given regno (see comments for |
| 0 | 510 allocno member `next_regno_allocno'). */ |
| 511 extern ira_allocno_t *ira_regno_allocno_map; | |
| 512 | |
| 513 /* Array of references to all allocnos. The order number of the | |
| 514 allocno corresponds to the index in the array. Removed allocnos | |
| 515 have NULL element value. */ | |
| 516 extern ira_allocno_t *ira_allocnos; | |
| 517 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
518 /* The size of the previous array. */ |
| 0 | 519 extern int ira_allocnos_num; |
| 520 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
521 /* Map a conflict id to its corresponding ira_object structure. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
522 extern ira_object_t *ira_object_id_map; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
523 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
524 /* The size of the previous array. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
525 extern int ira_objects_num; |
| 0 | 526 |
| 527 /* The following structure represents a copy of two allocnos. The | |
| 528 copies represent move insns or potential move insns usually because | |
| 529 of two operand insn constraints. To remove register shuffle, we | |
| 530 also create copies between allocno which is output of an insn and | |
| 531 allocno becoming dead in the insn. */ | |
| 532 struct ira_allocno_copy | |
| 533 { | |
| 534 /* The unique order number of the copy node starting with 0. */ | |
| 535 int num; | |
| 536 /* Allocnos connected by the copy. The first allocno should have | |
| 537 smaller order number than the second one. */ | |
| 538 ira_allocno_t first, second; | |
| 539 /* Execution frequency of the copy. */ | |
| 540 int freq; | |
| 541 bool constraint_p; | |
| 542 /* It is a move insn which is an origin of the copy. The member | |
| 543 value for the copy representing two operand insn constraints or | |
| 544 for the copy created to remove register shuffle is NULL. In last | |
| 545 case the copy frequency is smaller than the corresponding insn | |
| 546 execution frequency. */ | |
| 547 rtx insn; | |
| 548 /* All copies with the same allocno as FIRST are linked by the two | |
| 549 following members. */ | |
| 550 ira_copy_t prev_first_allocno_copy, next_first_allocno_copy; | |
| 551 /* All copies with the same allocno as SECOND are linked by the two | |
| 552 following members. */ | |
| 553 ira_copy_t prev_second_allocno_copy, next_second_allocno_copy; | |
| 554 /* Region from which given copy is originated. */ | |
| 555 ira_loop_tree_node_t loop_tree_node; | |
| 556 }; | |
| 557 | |
| 558 /* Array of references to all copies. The order number of the copy | |
| 559 corresponds to the index in the array. Removed copies have NULL | |
| 560 element value. */ | |
| 561 extern ira_copy_t *ira_copies; | |
| 562 | |
| 563 /* Size of the previous array. */ | |
| 564 extern int ira_copies_num; | |
| 565 | |
| 566 /* The following structure describes a stack slot used for spilled | |
| 567 pseudo-registers. */ | |
| 568 struct ira_spilled_reg_stack_slot | |
| 569 { | |
| 570 /* pseudo-registers assigned to the stack slot. */ | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
571 bitmap_head spilled_regs; |
| 0 | 572 /* RTL representation of the stack slot. */ |
| 573 rtx mem; | |
| 574 /* Size of the stack slot. */ | |
| 575 unsigned int width; | |
| 576 }; | |
| 577 | |
| 578 /* The number of elements in the following array. */ | |
| 579 extern int ira_spilled_reg_stack_slots_num; | |
| 580 | |
| 581 /* The following array contains info about spilled pseudo-registers | |
| 582 stack slots used in current function so far. */ | |
| 583 extern struct ira_spilled_reg_stack_slot *ira_spilled_reg_stack_slots; | |
| 584 | |
| 585 /* Correspondingly overall cost of the allocation, cost of the | |
| 586 allocnos assigned to hard-registers, cost of the allocnos assigned | |
| 587 to memory, cost of loads, stores and register move insns generated | |
| 588 for pseudo-register live range splitting (see ira-emit.c). */ | |
| 589 extern int ira_overall_cost; | |
| 590 extern int ira_reg_cost, ira_mem_cost; | |
| 591 extern int ira_load_cost, ira_store_cost, ira_shuffle_cost; | |
| 592 extern int ira_move_loops_num, ira_additional_jumps_num; | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
593 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
594 /* This page contains a bitset implementation called 'min/max sets' used to |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
595 record conflicts in IRA. |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
596 They are named min/maxs set since we keep track of a minimum and a maximum |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
597 bit number for each set representing the bounds of valid elements. Otherwise, |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
598 the implementation resembles sbitmaps in that we store an array of integers |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
599 whose bits directly represent the members of the set. */ |
| 0 | 600 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
601 /* The type used as elements in the array, and the number of bits in |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
602 this type. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
603 |
| 0 | 604 #define IRA_INT_BITS HOST_BITS_PER_WIDE_INT |
| 605 #define IRA_INT_TYPE HOST_WIDE_INT | |
| 606 | |
| 607 /* Set, clear or test bit number I in R, a bit vector of elements with | |
| 608 minimal index and maximal index equal correspondingly to MIN and | |
| 609 MAX. */ | |
| 610 #if defined ENABLE_IRA_CHECKING && (GCC_VERSION >= 2007) | |
| 611 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
612 #define SET_MINMAX_SET_BIT(R, I, MIN, MAX) __extension__ \ |
| 0 | 613 (({ int _min = (MIN), _max = (MAX), _i = (I); \ |
| 614 if (_i < _min || _i > _max) \ | |
| 615 { \ | |
| 616 fprintf (stderr, \ | |
| 617 "\n%s: %d: error in %s: %d not in range [%d,%d]\n", \ | |
| 618 __FILE__, __LINE__, __FUNCTION__, _i, _min, _max); \ | |
| 619 gcc_unreachable (); \ | |
| 620 } \ | |
| 621 ((R)[(unsigned) (_i - _min) / IRA_INT_BITS] \ | |
| 622 |= ((IRA_INT_TYPE) 1 << ((unsigned) (_i - _min) % IRA_INT_BITS))); })) | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
623 |
| 0 | 624 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
625 #define CLEAR_MINMAX_SET_BIT(R, I, MIN, MAX) __extension__ \ |
| 0 | 626 (({ int _min = (MIN), _max = (MAX), _i = (I); \ |
| 627 if (_i < _min || _i > _max) \ | |
| 628 { \ | |
| 629 fprintf (stderr, \ | |
| 630 "\n%s: %d: error in %s: %d not in range [%d,%d]\n", \ | |
| 631 __FILE__, __LINE__, __FUNCTION__, _i, _min, _max); \ | |
| 632 gcc_unreachable (); \ | |
| 633 } \ | |
| 634 ((R)[(unsigned) (_i - _min) / IRA_INT_BITS] \ | |
| 635 &= ~((IRA_INT_TYPE) 1 << ((unsigned) (_i - _min) % IRA_INT_BITS))); })) | |
| 636 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
637 #define TEST_MINMAX_SET_BIT(R, I, MIN, MAX) __extension__ \ |
| 0 | 638 (({ int _min = (MIN), _max = (MAX), _i = (I); \ |
| 639 if (_i < _min || _i > _max) \ | |
| 640 { \ | |
| 641 fprintf (stderr, \ | |
| 642 "\n%s: %d: error in %s: %d not in range [%d,%d]\n", \ | |
| 643 __FILE__, __LINE__, __FUNCTION__, _i, _min, _max); \ | |
| 644 gcc_unreachable (); \ | |
| 645 } \ | |
| 646 ((R)[(unsigned) (_i - _min) / IRA_INT_BITS] \ | |
| 647 & ((IRA_INT_TYPE) 1 << ((unsigned) (_i - _min) % IRA_INT_BITS))); })) | |
| 648 | |
| 649 #else | |
| 650 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
651 #define SET_MINMAX_SET_BIT(R, I, MIN, MAX) \ |
| 0 | 652 ((R)[(unsigned) ((I) - (MIN)) / IRA_INT_BITS] \ |
| 653 |= ((IRA_INT_TYPE) 1 << ((unsigned) ((I) - (MIN)) % IRA_INT_BITS))) | |
| 654 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
655 #define CLEAR_MINMAX_SET_BIT(R, I, MIN, MAX) \ |
| 0 | 656 ((R)[(unsigned) ((I) - (MIN)) / IRA_INT_BITS] \ |
| 657 &= ~((IRA_INT_TYPE) 1 << ((unsigned) ((I) - (MIN)) % IRA_INT_BITS))) | |
| 658 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
659 #define TEST_MINMAX_SET_BIT(R, I, MIN, MAX) \ |
| 0 | 660 ((R)[(unsigned) ((I) - (MIN)) / IRA_INT_BITS] \ |
| 661 & ((IRA_INT_TYPE) 1 << ((unsigned) ((I) - (MIN)) % IRA_INT_BITS))) | |
| 662 | |
| 663 #endif | |
| 664 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
665 /* The iterator for min/max sets. */ |
| 0 | 666 typedef struct { |
| 667 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
668 /* Array containing the bit vector. */ |
| 0 | 669 IRA_INT_TYPE *vec; |
| 670 | |
| 671 /* The number of the current element in the vector. */ | |
| 672 unsigned int word_num; | |
| 673 | |
| 674 /* The number of bits in the bit vector. */ | |
| 675 unsigned int nel; | |
| 676 | |
| 677 /* The current bit index of the bit vector. */ | |
| 678 unsigned int bit_num; | |
| 679 | |
| 680 /* Index corresponding to the 1st bit of the bit vector. */ | |
| 681 int start_val; | |
| 682 | |
| 683 /* The word of the bit vector currently visited. */ | |
| 684 unsigned IRA_INT_TYPE word; | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
685 } minmax_set_iterator; |
| 0 | 686 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
687 /* Initialize the iterator I for bit vector VEC containing minimal and |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
688 maximal values MIN and MAX. */ |
| 0 | 689 static inline void |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
690 minmax_set_iter_init (minmax_set_iterator *i, IRA_INT_TYPE *vec, int min, |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
691 int max) |
| 0 | 692 { |
| 693 i->vec = vec; | |
| 694 i->word_num = 0; | |
| 695 i->nel = max < min ? 0 : max - min + 1; | |
| 696 i->start_val = min; | |
| 697 i->bit_num = 0; | |
| 698 i->word = i->nel == 0 ? 0 : vec[0]; | |
| 699 } | |
| 700 | |
| 701 /* Return TRUE if we have more allocnos to visit, in which case *N is | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
702 set to the number of the element to be visited. Otherwise, return |
| 0 | 703 FALSE. */ |
| 704 static inline bool | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
705 minmax_set_iter_cond (minmax_set_iterator *i, int *n) |
| 0 | 706 { |
| 707 /* Skip words that are zeros. */ | |
| 708 for (; i->word == 0; i->word = i->vec[i->word_num]) | |
| 709 { | |
| 710 i->word_num++; | |
| 711 i->bit_num = i->word_num * IRA_INT_BITS; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
712 |
| 0 | 713 /* If we have reached the end, break. */ |
| 714 if (i->bit_num >= i->nel) | |
| 715 return false; | |
| 716 } | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
717 |
| 0 | 718 /* Skip bits that are zero. */ |
| 719 for (; (i->word & 1) == 0; i->word >>= 1) | |
| 720 i->bit_num++; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
721 |
| 0 | 722 *n = (int) i->bit_num + i->start_val; |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
723 |
| 0 | 724 return true; |
| 725 } | |
| 726 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
727 /* Advance to the next element in the set. */ |
| 0 | 728 static inline void |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
729 minmax_set_iter_next (minmax_set_iterator *i) |
| 0 | 730 { |
| 731 i->word >>= 1; | |
| 732 i->bit_num++; | |
| 733 } | |
| 734 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
735 /* Loop over all elements of a min/max set given by bit vector VEC and |
| 0 | 736 their minimal and maximal values MIN and MAX. In each iteration, N |
| 737 is set to the number of next allocno. ITER is an instance of | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
738 minmax_set_iterator used to iterate over the set. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
739 #define FOR_EACH_BIT_IN_MINMAX_SET(VEC, MIN, MAX, N, ITER) \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
740 for (minmax_set_iter_init (&(ITER), (VEC), (MIN), (MAX)); \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
741 minmax_set_iter_cond (&(ITER), &(N)); \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
742 minmax_set_iter_next (&(ITER))) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
743 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
744 struct target_ira_int { |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
745 /* Initialized once. It is a maximal possible size of the allocated |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
746 struct costs. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
747 int x_max_struct_costs_size; |
| 0 | 748 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
749 /* Allocated and initialized once, and used to initialize cost values |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
750 for each insn. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
751 struct costs *x_init_cost; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
752 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
753 /* Allocated once, and used for temporary purposes. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
754 struct costs *x_temp_costs; |
| 0 | 755 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
756 /* Allocated once, and used for the cost calculation. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
757 struct costs *x_op_costs[MAX_RECOG_OPERANDS]; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
758 struct costs *x_this_op_costs[MAX_RECOG_OPERANDS]; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
759 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
760 /* Classes used for cost calculation. They may be different on |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
761 different iterations of the cost calculations or in different |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
762 optimization modes. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
763 enum reg_class *x_cost_classes; |
| 0 | 764 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
765 /* Hard registers that can not be used for the register allocator for |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
766 all functions of the current compilation unit. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
767 HARD_REG_SET x_no_unit_alloc_regs; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
768 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
769 /* Map: hard regs X modes -> set of hard registers for storing value |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
770 of given mode starting with given hard register. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
771 HARD_REG_SET (x_ira_reg_mode_hard_regset |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
772 [FIRST_PSEUDO_REGISTER][NUM_MACHINE_MODES]); |
| 0 | 773 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
774 /* Array based on TARGET_REGISTER_MOVE_COST. Don't use |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
775 ira_register_move_cost directly. Use function of |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
776 ira_get_may_move_cost instead. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
777 move_table *x_ira_register_move_cost[MAX_MACHINE_MODE]; |
| 0 | 778 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
779 /* Similar to may_move_in_cost but it is calculated in IRA instead of |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
780 regclass. Another difference we take only available hard registers |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
781 into account to figure out that one register class is a subset of |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
782 the another one. Don't use it directly. Use function of |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
783 ira_get_may_move_cost instead. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
784 move_table *x_ira_may_move_in_cost[MAX_MACHINE_MODE]; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
785 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
786 /* Similar to may_move_out_cost but it is calculated in IRA instead of |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
787 regclass. Another difference we take only available hard registers |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
788 into account to figure out that one register class is a subset of |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
789 the another one. Don't use it directly. Use function of |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
790 ira_get_may_move_cost instead. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
791 move_table *x_ira_may_move_out_cost[MAX_MACHINE_MODE]; |
| 0 | 792 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
793 /* Register class subset relation: TRUE if the first class is a subset |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
794 of the second one considering only hard registers available for the |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
795 allocation. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
796 int x_ira_class_subset_p[N_REG_CLASSES][N_REG_CLASSES]; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
797 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
798 /* Array of the number of hard registers of given class which are |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
799 available for allocation. The order is defined by the the hard |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
800 register numbers. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
801 short x_ira_non_ordered_class_hard_regs[N_REG_CLASSES][FIRST_PSEUDO_REGISTER]; |
| 0 | 802 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
803 /* Index (in ira_class_hard_regs; for given register class and hard |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
804 register (in general case a hard register can belong to several |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
805 register classes;. The index is negative for hard registers |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
806 unavailable for the allocation. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
807 short x_ira_class_hard_reg_index[N_REG_CLASSES][FIRST_PSEUDO_REGISTER]; |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
808 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
809 /* Array whose values are hard regset of hard registers available for |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
810 the allocation of given register class whose HARD_REGNO_MODE_OK |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
811 values for given mode are zero. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
812 HARD_REG_SET x_prohibited_class_mode_regs[N_REG_CLASSES][NUM_MACHINE_MODES]; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
813 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
814 /* The value is number of elements in the subsequent array. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
815 int x_ira_important_classes_num; |
| 0 | 816 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
817 /* The array containing non-empty classes (including non-empty cover |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
818 classes; which are subclasses of cover classes. Such classes is |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
819 important for calculation of the hard register usage costs. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
820 enum reg_class x_ira_important_classes[N_REG_CLASSES]; |
| 0 | 821 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
822 /* The biggest important class inside of intersection of the two |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
823 classes (that is calculated taking only hard registers available |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
824 for allocation into account;. If the both classes contain no hard |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
825 registers available for allocation, the value is calculated with |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
826 taking all hard-registers including fixed ones into account. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
827 enum reg_class x_ira_reg_class_intersect[N_REG_CLASSES][N_REG_CLASSES]; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
828 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
829 /* True if the two classes (that is calculated taking only hard |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
830 registers available for allocation into account; are |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
831 intersected. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
832 bool x_ira_reg_classes_intersect_p[N_REG_CLASSES][N_REG_CLASSES]; |
| 0 | 833 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
834 /* Classes with end marker LIM_REG_CLASSES which are intersected with |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
835 given class (the first index;. That includes given class itself. |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
836 This is calculated taking only hard registers available for |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
837 allocation into account. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
838 enum reg_class x_ira_reg_class_super_classes[N_REG_CLASSES][N_REG_CLASSES]; |
| 0 | 839 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
840 /* The biggest important class inside of union of the two classes |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
841 (that is calculated taking only hard registers available for |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
842 allocation into account;. If the both classes contain no hard |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
843 registers available for allocation, the value is calculated with |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
844 taking all hard-registers including fixed ones into account. In |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
845 other words, the value is the corresponding reg_class_subunion |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
846 value. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
847 enum reg_class x_ira_reg_class_union[N_REG_CLASSES][N_REG_CLASSES]; |
| 0 | 848 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
849 /* For each reg class, table listing all the classes contained in it |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
850 (excluding the class itself. Non-allocatable registers are |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
851 excluded from the consideration;. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
852 enum reg_class x_alloc_reg_class_subclasses[N_REG_CLASSES][N_REG_CLASSES]; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
853 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
854 /* Array whose values are hard regset of hard registers for which |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
855 move of the hard register in given mode into itself is |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
856 prohibited. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
857 HARD_REG_SET x_ira_prohibited_mode_move_regs[NUM_MACHINE_MODES]; |
| 0 | 858 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
859 /* Flag of that the above array has been initialized. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
860 bool x_ira_prohibited_mode_move_regs_initialized_p; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
861 }; |
| 0 | 862 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
863 extern struct target_ira_int default_target_ira_int; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
864 #if SWITCHABLE_TARGET |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
865 extern struct target_ira_int *this_target_ira_int; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
866 #else |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
867 #define this_target_ira_int (&default_target_ira_int) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
868 #endif |
| 0 | 869 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
870 #define ira_reg_mode_hard_regset \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
871 (this_target_ira_int->x_ira_reg_mode_hard_regset) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
872 #define ira_register_move_cost \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
873 (this_target_ira_int->x_ira_register_move_cost) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
874 #define ira_may_move_in_cost \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
875 (this_target_ira_int->x_ira_may_move_in_cost) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
876 #define ira_may_move_out_cost \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
877 (this_target_ira_int->x_ira_may_move_out_cost) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
878 #define ira_class_subset_p \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
879 (this_target_ira_int->x_ira_class_subset_p) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
880 #define ira_non_ordered_class_hard_regs \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
881 (this_target_ira_int->x_ira_non_ordered_class_hard_regs) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
882 #define ira_class_hard_reg_index \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
883 (this_target_ira_int->x_ira_class_hard_reg_index) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
884 #define prohibited_class_mode_regs \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
885 (this_target_ira_int->x_prohibited_class_mode_regs) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
886 #define ira_important_classes_num \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
887 (this_target_ira_int->x_ira_important_classes_num) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
888 #define ira_important_classes \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
889 (this_target_ira_int->x_ira_important_classes) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
890 #define ira_reg_class_intersect \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
891 (this_target_ira_int->x_ira_reg_class_intersect) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
892 #define ira_reg_classes_intersect_p \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
893 (this_target_ira_int->x_ira_reg_classes_intersect_p) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
894 #define ira_reg_class_super_classes \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
895 (this_target_ira_int->x_ira_reg_class_super_classes) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
896 #define ira_reg_class_union \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
897 (this_target_ira_int->x_ira_reg_class_union) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
898 #define ira_prohibited_mode_move_regs \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
899 (this_target_ira_int->x_ira_prohibited_mode_move_regs) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
900 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
901 /* ira.c: */ |
| 0 | 902 |
| 903 extern void *ira_allocate (size_t); | |
| 904 extern void *ira_reallocate (void *, size_t); | |
| 905 extern void ira_free (void *addr); | |
| 906 extern bitmap ira_allocate_bitmap (void); | |
| 907 extern void ira_free_bitmap (bitmap); | |
| 908 extern void ira_print_disposition (FILE *); | |
| 909 extern void ira_debug_disposition (void); | |
| 910 extern void ira_debug_class_cover (void); | |
| 911 extern void ira_init_register_move_cost (enum machine_mode); | |
| 912 | |
| 913 /* The length of the two following arrays. */ | |
| 914 extern int ira_reg_equiv_len; | |
| 915 | |
| 916 /* The element value is TRUE if the corresponding regno value is | |
| 917 invariant. */ | |
| 918 extern bool *ira_reg_equiv_invariant_p; | |
| 919 | |
| 920 /* The element value is equiv constant of given pseudo-register or | |
| 921 NULL_RTX. */ | |
| 922 extern rtx *ira_reg_equiv_const; | |
| 923 | |
| 924 /* ira-build.c */ | |
| 925 | |
| 926 /* The current loop tree node and its regno allocno map. */ | |
| 927 extern ira_loop_tree_node_t ira_curr_loop_tree_node; | |
| 928 extern ira_allocno_t *ira_curr_regno_allocno_map; | |
| 929 | |
| 930 extern void ira_debug_copy (ira_copy_t); | |
| 931 extern void ira_debug_copies (void); | |
| 932 extern void ira_debug_allocno_copies (ira_allocno_t); | |
| 933 | |
| 934 extern void ira_traverse_loop_tree (bool, ira_loop_tree_node_t, | |
| 935 void (*) (ira_loop_tree_node_t), | |
| 936 void (*) (ira_loop_tree_node_t)); | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
937 extern ira_allocno_t ira_parent_allocno (ira_allocno_t); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
938 extern ira_allocno_t ira_parent_or_cap_allocno (ira_allocno_t); |
| 0 | 939 extern ira_allocno_t ira_create_allocno (int, bool, ira_loop_tree_node_t); |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
940 extern void ira_create_allocno_objects (ira_allocno_t); |
| 0 | 941 extern void ira_set_allocno_cover_class (ira_allocno_t, enum reg_class); |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
942 extern bool ira_conflict_vector_profitable_p (ira_object_t, int); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
943 extern void ira_allocate_conflict_vec (ira_object_t, int); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
944 extern void ira_allocate_object_conflicts (ira_object_t, int); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
945 extern void ior_hard_reg_conflicts (ira_allocno_t, HARD_REG_SET *); |
| 0 | 946 extern void ira_print_expanded_allocno (ira_allocno_t); |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
947 extern void ira_add_live_range_to_object (ira_object_t, int, int); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
948 extern live_range_t ira_create_live_range (ira_object_t, int, int, |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
949 live_range_t); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
950 extern live_range_t ira_copy_live_range_list (live_range_t); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
951 extern live_range_t ira_merge_live_ranges (live_range_t, live_range_t); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
952 extern bool ira_live_ranges_intersect_p (live_range_t, live_range_t); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
953 extern void ira_finish_live_range (live_range_t); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
954 extern void ira_finish_live_range_list (live_range_t); |
| 0 | 955 extern void ira_free_allocno_updated_costs (ira_allocno_t); |
| 956 extern ira_copy_t ira_create_copy (ira_allocno_t, ira_allocno_t, | |
| 957 int, bool, rtx, ira_loop_tree_node_t); | |
| 958 extern void ira_add_allocno_copy_to_list (ira_copy_t); | |
| 959 extern void ira_swap_allocno_copy_ends_if_necessary (ira_copy_t); | |
| 960 extern ira_copy_t ira_add_allocno_copy (ira_allocno_t, ira_allocno_t, int, | |
| 961 bool, rtx, ira_loop_tree_node_t); | |
| 962 | |
| 963 extern int *ira_allocate_cost_vector (enum reg_class); | |
| 964 extern void ira_free_cost_vector (int *, enum reg_class); | |
| 965 | |
| 966 extern void ira_flattening (int, int); | |
| 967 extern bool ira_build (bool); | |
| 968 extern void ira_destroy (void); | |
| 969 | |
| 970 /* ira-costs.c */ | |
| 971 extern void ira_init_costs_once (void); | |
| 972 extern void ira_init_costs (void); | |
| 973 extern void ira_finish_costs_once (void); | |
| 974 extern void ira_costs (void); | |
| 975 extern void ira_tune_allocno_costs_and_cover_classes (void); | |
| 976 | |
| 977 /* ira-lives.c */ | |
| 978 | |
| 979 extern void ira_rebuild_start_finish_chains (void); | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
980 extern void ira_print_live_range_list (FILE *, live_range_t); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
981 extern void ira_debug_live_range_list (live_range_t); |
| 0 | 982 extern void ira_debug_allocno_live_ranges (ira_allocno_t); |
| 983 extern void ira_debug_live_ranges (void); | |
| 984 extern void ira_create_allocno_live_ranges (void); | |
| 985 extern void ira_compress_allocno_live_ranges (void); | |
| 986 extern void ira_finish_allocno_live_ranges (void); | |
| 987 | |
| 988 /* ira-conflicts.c */ | |
| 989 extern void ira_debug_conflicts (bool); | |
| 990 extern void ira_build_conflicts (void); | |
| 991 | |
| 992 /* ira-color.c */ | |
| 993 extern int ira_loop_edge_freq (ira_loop_tree_node_t, int, bool); | |
| 994 extern void ira_reassign_conflict_allocnos (int); | |
| 995 extern void ira_initiate_assign (void); | |
| 996 extern void ira_finish_assign (void); | |
| 997 extern void ira_color (void); | |
| 998 | |
| 999 /* ira-emit.c */ | |
| 1000 extern void ira_emit (bool); | |
| 1001 | |
| 1002 | |
| 1003 | |
|
19
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1004 /* Return cost of moving value of MODE from register of class FROM to |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1005 register of class TO. */ |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1006 static inline int |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1007 ira_get_register_move_cost (enum machine_mode mode, |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1008 enum reg_class from, enum reg_class to) |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1009 { |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1010 if (ira_register_move_cost[mode] == NULL) |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1011 ira_init_register_move_cost (mode); |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1012 return ira_register_move_cost[mode][from][to]; |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1013 } |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1014 |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1015 /* Return cost of moving value of MODE from register of class FROM to |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1016 register of class TO. Return zero if IN_P is true and FROM is |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1017 subset of TO or if IN_P is false and FROM is superset of TO. */ |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1018 static inline int |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1019 ira_get_may_move_cost (enum machine_mode mode, |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1020 enum reg_class from, enum reg_class to, |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1021 bool in_p) |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1022 { |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1023 if (ira_register_move_cost[mode] == NULL) |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1024 ira_init_register_move_cost (mode); |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1025 return (in_p |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1026 ? ira_may_move_in_cost[mode][from][to] |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1027 : ira_may_move_out_cost[mode][from][to]); |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1028 } |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1029 |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1030 |
|
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
1031 |
| 0 | 1032 /* The iterator for all allocnos. */ |
| 1033 typedef struct { | |
| 1034 /* The number of the current element in IRA_ALLOCNOS. */ | |
| 1035 int n; | |
| 1036 } ira_allocno_iterator; | |
| 1037 | |
| 1038 /* Initialize the iterator I. */ | |
| 1039 static inline void | |
| 1040 ira_allocno_iter_init (ira_allocno_iterator *i) | |
| 1041 { | |
| 1042 i->n = 0; | |
| 1043 } | |
| 1044 | |
| 1045 /* Return TRUE if we have more allocnos to visit, in which case *A is | |
| 1046 set to the allocno to be visited. Otherwise, return FALSE. */ | |
| 1047 static inline bool | |
| 1048 ira_allocno_iter_cond (ira_allocno_iterator *i, ira_allocno_t *a) | |
| 1049 { | |
| 1050 int n; | |
| 1051 | |
| 1052 for (n = i->n; n < ira_allocnos_num; n++) | |
| 1053 if (ira_allocnos[n] != NULL) | |
| 1054 { | |
| 1055 *a = ira_allocnos[n]; | |
| 1056 i->n = n + 1; | |
| 1057 return true; | |
| 1058 } | |
| 1059 return false; | |
| 1060 } | |
| 1061 | |
| 1062 /* Loop over all allocnos. In each iteration, A is set to the next | |
| 1063 allocno. ITER is an instance of ira_allocno_iterator used to iterate | |
| 1064 the allocnos. */ | |
| 1065 #define FOR_EACH_ALLOCNO(A, ITER) \ | |
| 1066 for (ira_allocno_iter_init (&(ITER)); \ | |
| 1067 ira_allocno_iter_cond (&(ITER), &(A));) | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1068 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1069 /* The iterator for all objects. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1070 typedef struct { |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1071 /* The number of the current element in ira_object_id_map. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1072 int n; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1073 } ira_object_iterator; |
| 0 | 1074 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1075 /* Initialize the iterator I. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1076 static inline void |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1077 ira_object_iter_init (ira_object_iterator *i) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1078 { |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1079 i->n = 0; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1080 } |
| 0 | 1081 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1082 /* Return TRUE if we have more objects to visit, in which case *OBJ is |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1083 set to the object to be visited. Otherwise, return FALSE. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1084 static inline bool |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1085 ira_object_iter_cond (ira_object_iterator *i, ira_object_t *obj) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1086 { |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1087 int n; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1088 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1089 for (n = i->n; n < ira_objects_num; n++) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1090 if (ira_object_id_map[n] != NULL) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1091 { |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1092 *obj = ira_object_id_map[n]; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1093 i->n = n + 1; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1094 return true; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1095 } |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1096 return false; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1097 } |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1098 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1099 /* Loop over all objects. In each iteration, OBJ is set to the next |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1100 object. ITER is an instance of ira_object_iterator used to iterate |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1101 the objects. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1102 #define FOR_EACH_OBJECT(OBJ, ITER) \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1103 for (ira_object_iter_init (&(ITER)); \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1104 ira_object_iter_cond (&(ITER), &(OBJ));) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1105 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1106 /* The iterator for objects associated with an allocno. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1107 typedef struct { |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1108 /* The number of the element the allocno's object array. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1109 int n; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1110 } ira_allocno_object_iterator; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1111 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1112 /* Initialize the iterator I. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1113 static inline void |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1114 ira_allocno_object_iter_init (ira_allocno_object_iterator *i) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1115 { |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1116 i->n = 0; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1117 } |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1118 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1119 /* Return TRUE if we have more objects to visit in allocno A, in which |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1120 case *O is set to the object to be visited. Otherwise, return |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1121 FALSE. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1122 static inline bool |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1123 ira_allocno_object_iter_cond (ira_allocno_object_iterator *i, ira_allocno_t a, |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1124 ira_object_t *o) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1125 { |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1126 *o = ALLOCNO_OBJECT (a, i->n); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1127 return i->n++ < ALLOCNO_NUM_OBJECTS (a); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1128 } |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1129 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1130 /* Loop over all objects associated with allocno A. In each |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1131 iteration, O is set to the next object. ITER is an instance of |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1132 ira_allocno_object_iterator used to iterate the conflicts. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1133 #define FOR_EACH_ALLOCNO_OBJECT(A, O, ITER) \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1134 for (ira_allocno_object_iter_init (&(ITER)); \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1135 ira_allocno_object_iter_cond (&(ITER), (A), &(O));) |
| 0 | 1136 |
| 1137 | |
| 1138 /* The iterator for copies. */ | |
| 1139 typedef struct { | |
| 1140 /* The number of the current element in IRA_COPIES. */ | |
| 1141 int n; | |
| 1142 } ira_copy_iterator; | |
| 1143 | |
| 1144 /* Initialize the iterator I. */ | |
| 1145 static inline void | |
| 1146 ira_copy_iter_init (ira_copy_iterator *i) | |
| 1147 { | |
| 1148 i->n = 0; | |
| 1149 } | |
| 1150 | |
| 1151 /* Return TRUE if we have more copies to visit, in which case *CP is | |
| 1152 set to the copy to be visited. Otherwise, return FALSE. */ | |
| 1153 static inline bool | |
| 1154 ira_copy_iter_cond (ira_copy_iterator *i, ira_copy_t *cp) | |
| 1155 { | |
| 1156 int n; | |
| 1157 | |
| 1158 for (n = i->n; n < ira_copies_num; n++) | |
| 1159 if (ira_copies[n] != NULL) | |
| 1160 { | |
| 1161 *cp = ira_copies[n]; | |
| 1162 i->n = n + 1; | |
| 1163 return true; | |
| 1164 } | |
| 1165 return false; | |
| 1166 } | |
| 1167 | |
| 1168 /* Loop over all copies. In each iteration, C is set to the next | |
| 1169 copy. ITER is an instance of ira_copy_iterator used to iterate | |
| 1170 the copies. */ | |
| 1171 #define FOR_EACH_COPY(C, ITER) \ | |
| 1172 for (ira_copy_iter_init (&(ITER)); \ | |
| 1173 ira_copy_iter_cond (&(ITER), &(C));) | |
| 1174 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1175 /* The iterator for object conflicts. */ |
| 0 | 1176 typedef struct { |
| 1177 | |
| 1178 /* TRUE if the conflicts are represented by vector of allocnos. */ | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1179 bool conflict_vec_p; |
| 0 | 1180 |
| 1181 /* The conflict vector or conflict bit vector. */ | |
| 1182 void *vec; | |
| 1183 | |
| 1184 /* The number of the current element in the vector (of type | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1185 ira_object_t or IRA_INT_TYPE). */ |
| 0 | 1186 unsigned int word_num; |
| 1187 | |
| 1188 /* The bit vector size. It is defined only if | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1189 OBJECT_CONFLICT_VEC_P is FALSE. */ |
| 0 | 1190 unsigned int size; |
| 1191 | |
| 1192 /* The current bit index of bit vector. It is defined only if | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1193 OBJECT_CONFLICT_VEC_P is FALSE. */ |
| 0 | 1194 unsigned int bit_num; |
| 1195 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1196 /* The object id corresponding to the 1st bit of the bit vector. It |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1197 is defined only if OBJECT_CONFLICT_VEC_P is FALSE. */ |
| 0 | 1198 int base_conflict_id; |
| 1199 | |
| 1200 /* The word of bit vector currently visited. It is defined only if | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1201 OBJECT_CONFLICT_VEC_P is FALSE. */ |
| 0 | 1202 unsigned IRA_INT_TYPE word; |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1203 } ira_object_conflict_iterator; |
| 0 | 1204 |
| 1205 /* Initialize the iterator I with ALLOCNO conflicts. */ | |
| 1206 static inline void | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1207 ira_object_conflict_iter_init (ira_object_conflict_iterator *i, |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1208 ira_object_t obj) |
| 0 | 1209 { |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1210 i->conflict_vec_p = OBJECT_CONFLICT_VEC_P (obj); |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1211 i->vec = OBJECT_CONFLICT_ARRAY (obj); |
| 0 | 1212 i->word_num = 0; |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1213 if (i->conflict_vec_p) |
| 0 | 1214 i->size = i->bit_num = i->base_conflict_id = i->word = 0; |
| 1215 else | |
| 1216 { | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1217 if (OBJECT_MIN (obj) > OBJECT_MAX (obj)) |
| 0 | 1218 i->size = 0; |
| 1219 else | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1220 i->size = ((OBJECT_MAX (obj) - OBJECT_MIN (obj) |
| 0 | 1221 + IRA_INT_BITS) |
| 1222 / IRA_INT_BITS) * sizeof (IRA_INT_TYPE); | |
| 1223 i->bit_num = 0; | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1224 i->base_conflict_id = OBJECT_MIN (obj); |
| 0 | 1225 i->word = (i->size == 0 ? 0 : ((IRA_INT_TYPE *) i->vec)[0]); |
| 1226 } | |
| 1227 } | |
| 1228 | |
| 1229 /* Return TRUE if we have more conflicting allocnos to visit, in which | |
| 1230 case *A is set to the allocno to be visited. Otherwise, return | |
| 1231 FALSE. */ | |
| 1232 static inline bool | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1233 ira_object_conflict_iter_cond (ira_object_conflict_iterator *i, |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1234 ira_object_t *pobj) |
| 0 | 1235 { |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1236 ira_object_t obj; |
| 0 | 1237 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1238 if (i->conflict_vec_p) |
| 0 | 1239 { |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1240 obj = ((ira_object_t *) i->vec)[i->word_num]; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1241 if (obj == NULL) |
| 0 | 1242 return false; |
| 1243 } | |
| 1244 else | |
| 1245 { | |
| 1246 /* Skip words that are zeros. */ | |
| 1247 for (; i->word == 0; i->word = ((IRA_INT_TYPE *) i->vec)[i->word_num]) | |
| 1248 { | |
| 1249 i->word_num++; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1250 |
| 0 | 1251 /* If we have reached the end, break. */ |
| 1252 if (i->word_num * sizeof (IRA_INT_TYPE) >= i->size) | |
| 1253 return false; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1254 |
| 0 | 1255 i->bit_num = i->word_num * IRA_INT_BITS; |
| 1256 } | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1257 |
| 0 | 1258 /* Skip bits that are zero. */ |
| 1259 for (; (i->word & 1) == 0; i->word >>= 1) | |
| 1260 i->bit_num++; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1261 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1262 obj = ira_object_id_map[i->bit_num + i->base_conflict_id]; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1263 } |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1264 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1265 *pobj = obj; |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1266 return true; |
| 0 | 1267 } |
| 1268 | |
| 1269 /* Advance to the next conflicting allocno. */ | |
| 1270 static inline void | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1271 ira_object_conflict_iter_next (ira_object_conflict_iterator *i) |
| 0 | 1272 { |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1273 if (i->conflict_vec_p) |
| 0 | 1274 i->word_num++; |
| 1275 else | |
| 1276 { | |
| 1277 i->word >>= 1; | |
| 1278 i->bit_num++; | |
| 1279 } | |
| 1280 } | |
| 1281 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1282 /* Loop over all objects conflicting with OBJ. In each iteration, |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1283 CONF is set to the next conflicting object. ITER is an instance |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1284 of ira_object_conflict_iterator used to iterate the conflicts. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1285 #define FOR_EACH_OBJECT_CONFLICT(OBJ, CONF, ITER) \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1286 for (ira_object_conflict_iter_init (&(ITER), (OBJ)); \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1287 ira_object_conflict_iter_cond (&(ITER), &(CONF)); \ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1288 ira_object_conflict_iter_next (&(ITER))) |
| 0 | 1289 |
| 1290 | |
| 1291 | |
| 1292 /* The function returns TRUE if hard registers starting with | |
| 1293 HARD_REGNO and containing value of MODE are not in set | |
| 1294 HARD_REGSET. */ | |
| 1295 static inline bool | |
| 1296 ira_hard_reg_not_in_set_p (int hard_regno, enum machine_mode mode, | |
| 1297 HARD_REG_SET hard_regset) | |
| 1298 { | |
| 1299 int i; | |
| 1300 | |
| 1301 ira_assert (hard_regno >= 0); | |
| 1302 for (i = hard_regno_nregs[hard_regno][mode] - 1; i >= 0; i--) | |
| 1303 if (TEST_HARD_REG_BIT (hard_regset, hard_regno + i)) | |
| 1304 return false; | |
| 1305 return true; | |
| 1306 } | |
| 1307 | |
| 1308 | |
| 1309 | |
| 1310 /* To save memory we use a lazy approach for allocation and | |
| 1311 initialization of the cost vectors. We do this only when it is | |
| 1312 really necessary. */ | |
| 1313 | |
| 1314 /* Allocate cost vector *VEC for hard registers of COVER_CLASS and | |
| 1315 initialize the elements by VAL if it is necessary */ | |
| 1316 static inline void | |
| 1317 ira_allocate_and_set_costs (int **vec, enum reg_class cover_class, int val) | |
| 1318 { | |
| 1319 int i, *reg_costs; | |
| 1320 int len; | |
| 1321 | |
| 1322 if (*vec != NULL) | |
| 1323 return; | |
| 1324 *vec = reg_costs = ira_allocate_cost_vector (cover_class); | |
| 1325 len = ira_class_hard_regs_num[cover_class]; | |
| 1326 for (i = 0; i < len; i++) | |
| 1327 reg_costs[i] = val; | |
| 1328 } | |
| 1329 | |
| 1330 /* Allocate cost vector *VEC for hard registers of COVER_CLASS and | |
| 1331 copy values of vector SRC into the vector if it is necessary */ | |
| 1332 static inline void | |
| 1333 ira_allocate_and_copy_costs (int **vec, enum reg_class cover_class, int *src) | |
| 1334 { | |
| 1335 int len; | |
| 1336 | |
| 1337 if (*vec != NULL || src == NULL) | |
| 1338 return; | |
| 1339 *vec = ira_allocate_cost_vector (cover_class); | |
| 1340 len = ira_class_hard_regs_num[cover_class]; | |
| 1341 memcpy (*vec, src, sizeof (int) * len); | |
| 1342 } | |
| 1343 | |
| 1344 /* Allocate cost vector *VEC for hard registers of COVER_CLASS and | |
| 1345 add values of vector SRC into the vector if it is necessary */ | |
| 1346 static inline void | |
| 1347 ira_allocate_and_accumulate_costs (int **vec, enum reg_class cover_class, | |
| 1348 int *src) | |
| 1349 { | |
| 1350 int i, len; | |
| 1351 | |
| 1352 if (src == NULL) | |
| 1353 return; | |
| 1354 len = ira_class_hard_regs_num[cover_class]; | |
| 1355 if (*vec == NULL) | |
| 1356 { | |
| 1357 *vec = ira_allocate_cost_vector (cover_class); | |
| 1358 memset (*vec, 0, sizeof (int) * len); | |
| 1359 } | |
| 1360 for (i = 0; i < len; i++) | |
| 1361 (*vec)[i] += src[i]; | |
| 1362 } | |
| 1363 | |
| 1364 /* Allocate cost vector *VEC for hard registers of COVER_CLASS and | |
| 1365 copy values of vector SRC into the vector or initialize it by VAL | |
| 1366 (if SRC is null). */ | |
| 1367 static inline void | |
| 1368 ira_allocate_and_set_or_copy_costs (int **vec, enum reg_class cover_class, | |
| 1369 int val, int *src) | |
| 1370 { | |
| 1371 int i, *reg_costs; | |
| 1372 int len; | |
| 1373 | |
| 1374 if (*vec != NULL) | |
| 1375 return; | |
| 1376 *vec = reg_costs = ira_allocate_cost_vector (cover_class); | |
| 1377 len = ira_class_hard_regs_num[cover_class]; | |
| 1378 if (src != NULL) | |
| 1379 memcpy (reg_costs, src, sizeof (int) * len); | |
| 1380 else | |
| 1381 { | |
| 1382 for (i = 0; i < len; i++) | |
| 1383 reg_costs[i] = val; | |
| 1384 } | |
| 1385 } |