]>
Commit | Line | Data |
---|---|---|
058e97ec | 1 | /* IRA conflict builder. |
818ab71a | 2 | Copyright (C) 2006-2016 Free Software Foundation, Inc. |
058e97ec VM |
3 | Contributed by Vladimir Makarov <vmakarov@redhat.com>. |
4 | ||
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify it under | |
8 | the terms of the GNU General Public License as published by the Free | |
9 | Software Foundation; either version 3, or (at your option) any later | |
10 | version. | |
11 | ||
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GCC; see the file COPYING3. If not see | |
19 | <http://www.gnu.org/licenses/>. */ | |
20 | ||
21 | #include "config.h" | |
22 | #include "system.h" | |
23 | #include "coretypes.h" | |
c7131fb2 | 24 | #include "backend.h" |
957060b5 | 25 | #include "target.h" |
058e97ec | 26 | #include "rtl.h" |
957060b5 | 27 | #include "predict.h" |
058e97ec | 28 | #include "tm_p.h" |
058e97ec | 29 | #include "insn-config.h" |
957060b5 AM |
30 | #include "regs.h" |
31 | #include "ira.h" | |
32 | #include "ira-int.h" | |
058e97ec | 33 | #include "params.h" |
058e97ec | 34 | #include "sparseset.h" |
9c7c70ee | 35 | #include "addresses.h" |
058e97ec VM |
36 | |
37 | /* This file contains code responsible for allocno conflict creation, | |
38 | allocno copy creation and allocno info accumulation on upper level | |
39 | regions. */ | |
40 | ||
41 | /* ira_allocnos_num array of arrays of bits, recording whether two | |
42 | allocno's conflict (can't go in the same hardware register). | |
43 | ||
44 | Some arrays will be used as conflict bit vector of the | |
ac0ab4f7 | 45 | corresponding allocnos see function build_object_conflicts. */ |
058e97ec VM |
46 | static IRA_INT_TYPE **conflicts; |
47 | ||
a49ae217 | 48 | /* Macro to test a conflict of C1 and C2 in `conflicts'. */ |
ac0ab4f7 | 49 | #define OBJECTS_CONFLICT_P(C1, C2) \ |
a49ae217 BS |
50 | (OBJECT_MIN (C1) <= OBJECT_CONFLICT_ID (C2) \ |
51 | && OBJECT_CONFLICT_ID (C2) <= OBJECT_MAX (C1) \ | |
52 | && TEST_MINMAX_SET_BIT (conflicts[OBJECT_CONFLICT_ID (C1)], \ | |
53 | OBJECT_CONFLICT_ID (C2), \ | |
54 | OBJECT_MIN (C1), OBJECT_MAX (C1))) | |
058e97ec VM |
55 | |
56 | \f | |
ac0ab4f7 BS |
57 | /* Record a conflict between objects OBJ1 and OBJ2. If necessary, |
58 | canonicalize the conflict by recording it for lower-order subobjects | |
2b9c63a2 | 59 | of the corresponding allocnos. */ |
ac0ab4f7 BS |
60 | static void |
61 | record_object_conflict (ira_object_t obj1, ira_object_t obj2) | |
62 | { | |
63 | ira_allocno_t a1 = OBJECT_ALLOCNO (obj1); | |
64 | ira_allocno_t a2 = OBJECT_ALLOCNO (obj2); | |
65 | int w1 = OBJECT_SUBWORD (obj1); | |
66 | int w2 = OBJECT_SUBWORD (obj2); | |
67 | int id1, id2; | |
68 | ||
69 | /* Canonicalize the conflict. If two identically-numbered words | |
70 | conflict, always record this as a conflict between words 0. That | |
71 | is the only information we need, and it is easier to test for if | |
72 | it is collected in each allocno's lowest-order object. */ | |
73 | if (w1 == w2 && w1 > 0) | |
74 | { | |
75 | obj1 = ALLOCNO_OBJECT (a1, 0); | |
76 | obj2 = ALLOCNO_OBJECT (a2, 0); | |
77 | } | |
78 | id1 = OBJECT_CONFLICT_ID (obj1); | |
79 | id2 = OBJECT_CONFLICT_ID (obj2); | |
80 | ||
81 | SET_MINMAX_SET_BIT (conflicts[id1], id2, OBJECT_MIN (obj1), | |
82 | OBJECT_MAX (obj1)); | |
83 | SET_MINMAX_SET_BIT (conflicts[id2], id1, OBJECT_MIN (obj2), | |
84 | OBJECT_MAX (obj2)); | |
85 | } | |
86 | ||
311aab06 VM |
87 | /* Build allocno conflict table by processing allocno live ranges. |
88 | Return true if the table was built. The table is not built if it | |
89 | is too big. */ | |
90 | static bool | |
058e97ec VM |
91 | build_conflict_bit_table (void) |
92 | { | |
a49ae217 | 93 | int i; |
058e97ec | 94 | unsigned int j; |
1756cb66 | 95 | enum reg_class aclass; |
a49ae217 | 96 | int object_set_words, allocated_words_num, conflict_bit_vec_words_num; |
b14151b5 | 97 | live_range_t r; |
a49ae217 | 98 | ira_allocno_t allocno; |
058e97ec | 99 | ira_allocno_iterator ai; |
a49ae217 | 100 | sparseset objects_live; |
ac0ab4f7 BS |
101 | ira_object_t obj; |
102 | ira_allocno_object_iterator aoi; | |
058e97ec | 103 | |
311aab06 VM |
104 | allocated_words_num = 0; |
105 | FOR_EACH_ALLOCNO (allocno, ai) | |
ac0ab4f7 BS |
106 | FOR_EACH_ALLOCNO_OBJECT (allocno, obj, aoi) |
107 | { | |
108 | if (OBJECT_MAX (obj) < OBJECT_MIN (obj)) | |
311aab06 | 109 | continue; |
ac0ab4f7 BS |
110 | conflict_bit_vec_words_num |
111 | = ((OBJECT_MAX (obj) - OBJECT_MIN (obj) + IRA_INT_BITS) | |
112 | / IRA_INT_BITS); | |
113 | allocated_words_num += conflict_bit_vec_words_num; | |
a9243bfc RB |
114 | if ((uint64_t) allocated_words_num * sizeof (IRA_INT_TYPE) |
115 | > (uint64_t) IRA_MAX_CONFLICT_TABLE_SIZE * 1024 * 1024) | |
ac0ab4f7 BS |
116 | { |
117 | if (internal_flag_ira_verbose > 0 && ira_dump_file != NULL) | |
118 | fprintf | |
119 | (ira_dump_file, | |
120 | "+++Conflict table will be too big(>%dMB) -- don't use it\n", | |
121 | IRA_MAX_CONFLICT_TABLE_SIZE); | |
122 | return false; | |
123 | } | |
124 | } | |
a49ae217 | 125 | |
058e97ec | 126 | conflicts = (IRA_INT_TYPE **) ira_allocate (sizeof (IRA_INT_TYPE *) |
a49ae217 | 127 | * ira_objects_num); |
058e97ec VM |
128 | allocated_words_num = 0; |
129 | FOR_EACH_ALLOCNO (allocno, ai) | |
ac0ab4f7 BS |
130 | FOR_EACH_ALLOCNO_OBJECT (allocno, obj, aoi) |
131 | { | |
132 | int id = OBJECT_CONFLICT_ID (obj); | |
133 | if (OBJECT_MAX (obj) < OBJECT_MIN (obj)) | |
134 | { | |
135 | conflicts[id] = NULL; | |
136 | continue; | |
137 | } | |
138 | conflict_bit_vec_words_num | |
139 | = ((OBJECT_MAX (obj) - OBJECT_MIN (obj) + IRA_INT_BITS) | |
140 | / IRA_INT_BITS); | |
141 | allocated_words_num += conflict_bit_vec_words_num; | |
142 | conflicts[id] | |
143 | = (IRA_INT_TYPE *) ira_allocate (sizeof (IRA_INT_TYPE) | |
144 | * conflict_bit_vec_words_num); | |
145 | memset (conflicts[id], 0, | |
146 | sizeof (IRA_INT_TYPE) * conflict_bit_vec_words_num); | |
147 | } | |
a49ae217 BS |
148 | |
149 | object_set_words = (ira_objects_num + IRA_INT_BITS - 1) / IRA_INT_BITS; | |
058e97ec VM |
150 | if (internal_flag_ira_verbose > 0 && ira_dump_file != NULL) |
151 | fprintf | |
152 | (ira_dump_file, | |
153 | "+++Allocating %ld bytes for conflict table (uncompressed size %ld)\n", | |
154 | (long) allocated_words_num * sizeof (IRA_INT_TYPE), | |
a49ae217 BS |
155 | (long) object_set_words * ira_objects_num * sizeof (IRA_INT_TYPE)); |
156 | ||
157 | objects_live = sparseset_alloc (ira_objects_num); | |
058e97ec VM |
158 | for (i = 0; i < ira_max_point; i++) |
159 | { | |
160 | for (r = ira_start_point_ranges[i]; r != NULL; r = r->start_next) | |
161 | { | |
9140d27b BS |
162 | ira_object_t obj = r->object; |
163 | ira_allocno_t allocno = OBJECT_ALLOCNO (obj); | |
a49ae217 BS |
164 | int id = OBJECT_CONFLICT_ID (obj); |
165 | ||
ac0ab4f7 BS |
166 | gcc_assert (id < ira_objects_num); |
167 | ||
1756cb66 | 168 | aclass = ALLOCNO_CLASS (allocno); |
a49ae217 | 169 | EXECUTE_IF_SET_IN_SPARSESET (objects_live, j) |
058e97ec | 170 | { |
ac0ab4f7 BS |
171 | ira_object_t live_obj = ira_object_id_map[j]; |
172 | ira_allocno_t live_a = OBJECT_ALLOCNO (live_obj); | |
1756cb66 | 173 | enum reg_class live_aclass = ALLOCNO_CLASS (live_a); |
a49ae217 | 174 | |
1756cb66 | 175 | if (ira_reg_classes_intersect_p[aclass][live_aclass] |
058e97ec | 176 | /* Don't set up conflict for the allocno with itself. */ |
ac0ab4f7 | 177 | && live_a != allocno) |
058e97ec | 178 | { |
ac0ab4f7 | 179 | record_object_conflict (obj, live_obj); |
058e97ec VM |
180 | } |
181 | } | |
60408d8b | 182 | sparseset_set_bit (objects_live, id); |
058e97ec | 183 | } |
b8698a0f | 184 | |
058e97ec | 185 | for (r = ira_finish_point_ranges[i]; r != NULL; r = r->finish_next) |
ac0ab4f7 | 186 | sparseset_clear_bit (objects_live, OBJECT_CONFLICT_ID (r->object)); |
058e97ec | 187 | } |
a49ae217 | 188 | sparseset_free (objects_live); |
311aab06 | 189 | return true; |
058e97ec | 190 | } |
058e97ec | 191 | \f |
a49ae217 BS |
192 | /* Return true iff allocnos A1 and A2 cannot be allocated to the same |
193 | register due to conflicts. */ | |
194 | ||
195 | static bool | |
ac0ab4f7 | 196 | allocnos_conflict_for_copy_p (ira_allocno_t a1, ira_allocno_t a2) |
a49ae217 | 197 | { |
ac0ab4f7 BS |
198 | /* Due to the fact that we canonicalize conflicts (see |
199 | record_object_conflict), we only need to test for conflicts of | |
200 | the lowest order words. */ | |
201 | ira_object_t obj1 = ALLOCNO_OBJECT (a1, 0); | |
202 | ira_object_t obj2 = ALLOCNO_OBJECT (a2, 0); | |
1756cb66 | 203 | |
a49ae217 BS |
204 | return OBJECTS_CONFLICT_P (obj1, obj2); |
205 | } | |
058e97ec | 206 | |
a7f32992 VM |
207 | /* Check that X is REG or SUBREG of REG. */ |
208 | #define REG_SUBREG_P(x) \ | |
209 | (REG_P (x) || (GET_CODE (x) == SUBREG && REG_P (SUBREG_REG (x)))) | |
210 | ||
211 | /* Return X if X is a REG, otherwise it should be SUBREG of REG and | |
212 | the function returns the reg in this case. *OFFSET will be set to | |
213 | 0 in the first case or the regno offset in the first case. */ | |
214 | static rtx | |
215 | go_through_subreg (rtx x, int *offset) | |
216 | { | |
217 | rtx reg; | |
218 | ||
219 | *offset = 0; | |
220 | if (REG_P (x)) | |
221 | return x; | |
222 | ira_assert (GET_CODE (x) == SUBREG); | |
223 | reg = SUBREG_REG (x); | |
224 | ira_assert (REG_P (reg)); | |
225 | if (REGNO (reg) < FIRST_PSEUDO_REGISTER) | |
226 | *offset = subreg_regno_offset (REGNO (reg), GET_MODE (reg), | |
227 | SUBREG_BYTE (x), GET_MODE (x)); | |
228 | else | |
229 | *offset = (SUBREG_BYTE (x) / REGMODE_NATURAL_SIZE (GET_MODE (x))); | |
230 | return reg; | |
231 | } | |
232 | ||
058e97ec VM |
233 | /* Process registers REG1 and REG2 in move INSN with execution |
234 | frequency FREQ. The function also processes the registers in a | |
235 | potential move insn (INSN == NULL in this case) with frequency | |
236 | FREQ. The function can modify hard register costs of the | |
237 | corresponding allocnos or create a copy involving the corresponding | |
238 | allocnos. The function does nothing if the both registers are hard | |
239 | registers. When nothing is changed, the function returns | |
240 | FALSE. */ | |
241 | static bool | |
548a6322 | 242 | process_regs_for_copy (rtx reg1, rtx reg2, bool constraint_p, |
070a1983 | 243 | rtx_insn *insn, int freq) |
058e97ec | 244 | { |
496071ca | 245 | int allocno_preferenced_hard_regno, cost, index, offset1, offset2; |
a7f32992 | 246 | bool only_regs_p; |
058e97ec | 247 | ira_allocno_t a; |
a8c44c52 | 248 | reg_class_t rclass, aclass; |
ef4bddc2 | 249 | machine_mode mode; |
058e97ec VM |
250 | ira_copy_t cp; |
251 | ||
a7f32992 VM |
252 | gcc_assert (REG_SUBREG_P (reg1) && REG_SUBREG_P (reg2)); |
253 | only_regs_p = REG_P (reg1) && REG_P (reg2); | |
254 | reg1 = go_through_subreg (reg1, &offset1); | |
255 | reg2 = go_through_subreg (reg2, &offset2); | |
496071ca VM |
256 | /* Set up hard regno preferenced by allocno. If allocno gets the |
257 | hard regno the copy (or potential move) insn will be removed. */ | |
058e97ec VM |
258 | if (HARD_REGISTER_P (reg1)) |
259 | { | |
260 | if (HARD_REGISTER_P (reg2)) | |
261 | return false; | |
496071ca | 262 | allocno_preferenced_hard_regno = REGNO (reg1) + offset1 - offset2; |
058e97ec VM |
263 | a = ira_curr_regno_allocno_map[REGNO (reg2)]; |
264 | } | |
265 | else if (HARD_REGISTER_P (reg2)) | |
266 | { | |
496071ca | 267 | allocno_preferenced_hard_regno = REGNO (reg2) + offset2 - offset1; |
058e97ec VM |
268 | a = ira_curr_regno_allocno_map[REGNO (reg1)]; |
269 | } | |
a49ae217 | 270 | else |
058e97ec | 271 | { |
a49ae217 BS |
272 | ira_allocno_t a1 = ira_curr_regno_allocno_map[REGNO (reg1)]; |
273 | ira_allocno_t a2 = ira_curr_regno_allocno_map[REGNO (reg2)]; | |
2608d841 | 274 | |
ac0ab4f7 | 275 | if (!allocnos_conflict_for_copy_p (a1, a2) && offset1 == offset2) |
a49ae217 BS |
276 | { |
277 | cp = ira_add_allocno_copy (a1, a2, freq, constraint_p, insn, | |
278 | ira_curr_loop_tree_node); | |
279 | bitmap_set_bit (ira_curr_loop_tree_node->local_copies, cp->num); | |
280 | return true; | |
281 | } | |
282 | else | |
283 | return false; | |
058e97ec | 284 | } |
a49ae217 | 285 | |
1756cb66 VM |
286 | if (! IN_RANGE (allocno_preferenced_hard_regno, |
287 | 0, FIRST_PSEUDO_REGISTER - 1)) | |
496071ca VM |
288 | /* Can not be tied. */ |
289 | return false; | |
290 | rclass = REGNO_REG_CLASS (allocno_preferenced_hard_regno); | |
058e97ec | 291 | mode = ALLOCNO_MODE (a); |
1756cb66 | 292 | aclass = ALLOCNO_CLASS (a); |
4cda38d5 | 293 | if (only_regs_p && insn != NULL_RTX |
a8c44c52 | 294 | && reg_class_size[rclass] <= ira_reg_class_max_nregs [rclass][mode]) |
058e97ec VM |
295 | /* It is already taken into account in ira-costs.c. */ |
296 | return false; | |
1756cb66 | 297 | index = ira_class_hard_reg_index[aclass][allocno_preferenced_hard_regno]; |
058e97ec | 298 | if (index < 0) |
1756cb66 | 299 | /* Can not be tied. It is not in the allocno class. */ |
058e97ec | 300 | return false; |
1756cb66 | 301 | ira_init_register_move_cost_if_necessary (mode); |
058e97ec | 302 | if (HARD_REGISTER_P (reg1)) |
1756cb66 | 303 | cost = ira_register_move_cost[mode][aclass][rclass] * freq; |
058e97ec | 304 | else |
1756cb66 | 305 | cost = ira_register_move_cost[mode][rclass][aclass] * freq; |
029da7d4 | 306 | do |
cb1ca6ac VM |
307 | { |
308 | ira_allocate_and_set_costs | |
1756cb66 VM |
309 | (&ALLOCNO_HARD_REG_COSTS (a), aclass, |
310 | ALLOCNO_CLASS_COST (a)); | |
cb1ca6ac | 311 | ira_allocate_and_set_costs |
1756cb66 | 312 | (&ALLOCNO_CONFLICT_HARD_REG_COSTS (a), aclass, 0); |
cb1ca6ac VM |
313 | ALLOCNO_HARD_REG_COSTS (a)[index] -= cost; |
314 | ALLOCNO_CONFLICT_HARD_REG_COSTS (a)[index] -= cost; | |
1756cb66 VM |
315 | if (ALLOCNO_HARD_REG_COSTS (a)[index] < ALLOCNO_CLASS_COST (a)) |
316 | ALLOCNO_CLASS_COST (a) = ALLOCNO_HARD_REG_COSTS (a)[index]; | |
3b6d1699 | 317 | ira_add_allocno_pref (a, allocno_preferenced_hard_regno, freq); |
029da7d4 | 318 | a = ira_parent_or_cap_allocno (a); |
cb1ca6ac | 319 | } |
029da7d4 | 320 | while (a != NULL); |
058e97ec VM |
321 | return true; |
322 | } | |
323 | ||
b09495c1 VM |
324 | /* Process all of the output registers of the current insn which are |
325 | not bound (BOUND_P) and the input register REG (its operand number | |
326 | OP_NUM) which dies in the insn as if there were a move insn between | |
327 | them with frequency FREQ. */ | |
058e97ec | 328 | static void |
b09495c1 | 329 | process_reg_shuffles (rtx reg, int op_num, int freq, bool *bound_p) |
058e97ec VM |
330 | { |
331 | int i; | |
332 | rtx another_reg; | |
333 | ||
a7f32992 | 334 | gcc_assert (REG_SUBREG_P (reg)); |
058e97ec VM |
335 | for (i = 0; i < recog_data.n_operands; i++) |
336 | { | |
337 | another_reg = recog_data.operand[i]; | |
b8698a0f | 338 | |
a7f32992 | 339 | if (!REG_SUBREG_P (another_reg) || op_num == i |
b09495c1 VM |
340 | || recog_data.operand_type[i] != OP_OUT |
341 | || bound_p[i]) | |
058e97ec | 342 | continue; |
b8698a0f | 343 | |
070a1983 | 344 | process_regs_for_copy (reg, another_reg, false, NULL, freq); |
058e97ec VM |
345 | } |
346 | } | |
347 | ||
348 | /* Process INSN and create allocno copies if necessary. For example, | |
349 | it might be because INSN is a pseudo-register move or INSN is two | |
350 | operand insn. */ | |
351 | static void | |
070a1983 | 352 | add_insn_allocno_copies (rtx_insn *insn) |
058e97ec | 353 | { |
56592e03 | 354 | rtx set, operand, dup; |
3b6d1699 VM |
355 | bool bound_p[MAX_RECOG_OPERANDS]; |
356 | int i, n, freq; | |
357 | HARD_REG_SET alts; | |
a49ae217 | 358 | |
058e97ec VM |
359 | freq = REG_FREQ_FROM_BB (BLOCK_FOR_INSN (insn)); |
360 | if (freq == 0) | |
361 | freq = 1; | |
362 | if ((set = single_set (insn)) != NULL_RTX | |
a7f32992 | 363 | && REG_SUBREG_P (SET_DEST (set)) && REG_SUBREG_P (SET_SRC (set)) |
058e97ec | 364 | && ! side_effects_p (set) |
a7f32992 VM |
365 | && find_reg_note (insn, REG_DEAD, |
366 | REG_P (SET_SRC (set)) | |
367 | ? SET_SRC (set) | |
368 | : SUBREG_REG (SET_SRC (set))) != NULL_RTX) | |
058e97ec | 369 | { |
3b6d1699 | 370 | process_regs_for_copy (SET_SRC (set), SET_DEST (set), |
1756cb66 | 371 | false, insn, freq); |
b09495c1 VM |
372 | return; |
373 | } | |
56592e03 VM |
374 | /* Fast check of possibility of constraint or shuffle copies. If |
375 | there are no dead registers, there will be no such copies. */ | |
376 | if (! find_reg_note (insn, REG_DEAD, NULL_RTX)) | |
b09495c1 | 377 | return; |
3b6d1699 | 378 | ira_setup_alts (insn, alts); |
b09495c1 VM |
379 | for (i = 0; i < recog_data.n_operands; i++) |
380 | bound_p[i] = false; | |
381 | for (i = 0; i < recog_data.n_operands; i++) | |
382 | { | |
383 | operand = recog_data.operand[i]; | |
384 | if (! REG_SUBREG_P (operand)) | |
385 | continue; | |
3b6d1699 VM |
386 | if ((n = ira_get_dup_out_num (i, alts)) >= 0) |
387 | { | |
388 | bound_p[n] = true; | |
389 | dup = recog_data.operand[n]; | |
390 | if (REG_SUBREG_P (dup) | |
391 | && find_reg_note (insn, REG_DEAD, | |
392 | REG_P (operand) | |
393 | ? operand | |
394 | : SUBREG_REG (operand)) != NULL_RTX) | |
070a1983 | 395 | process_regs_for_copy (operand, dup, true, NULL, |
3b6d1699 VM |
396 | freq); |
397 | } | |
b09495c1 VM |
398 | } |
399 | for (i = 0; i < recog_data.n_operands; i++) | |
400 | { | |
401 | operand = recog_data.operand[i]; | |
402 | if (REG_SUBREG_P (operand) | |
403 | && find_reg_note (insn, REG_DEAD, | |
404 | REG_P (operand) | |
405 | ? operand : SUBREG_REG (operand)) != NULL_RTX) | |
406 | /* If an operand dies, prefer its hard register for the output | |
407 | operands by decreasing the hard register cost or creating | |
408 | the corresponding allocno copies. The cost will not | |
409 | correspond to a real move insn cost, so make the frequency | |
410 | smaller. */ | |
411 | process_reg_shuffles (operand, i, freq < 8 ? 1 : freq / 8, bound_p); | |
058e97ec VM |
412 | } |
413 | } | |
414 | ||
415 | /* Add copies originated from BB given by LOOP_TREE_NODE. */ | |
416 | static void | |
417 | add_copies (ira_loop_tree_node_t loop_tree_node) | |
418 | { | |
419 | basic_block bb; | |
070a1983 | 420 | rtx_insn *insn; |
058e97ec VM |
421 | |
422 | bb = loop_tree_node->bb; | |
423 | if (bb == NULL) | |
424 | return; | |
425 | FOR_BB_INSNS (bb, insn) | |
b5b8b0ac | 426 | if (NONDEBUG_INSN_P (insn)) |
058e97ec VM |
427 | add_insn_allocno_copies (insn); |
428 | } | |
429 | ||
430 | /* Propagate copies the corresponding allocnos on upper loop tree | |
431 | level. */ | |
432 | static void | |
433 | propagate_copies (void) | |
434 | { | |
435 | ira_copy_t cp; | |
436 | ira_copy_iterator ci; | |
437 | ira_allocno_t a1, a2, parent_a1, parent_a2; | |
058e97ec VM |
438 | |
439 | FOR_EACH_COPY (cp, ci) | |
440 | { | |
441 | a1 = cp->first; | |
442 | a2 = cp->second; | |
443 | if (ALLOCNO_LOOP_TREE_NODE (a1) == ira_loop_tree_root) | |
444 | continue; | |
445 | ira_assert ((ALLOCNO_LOOP_TREE_NODE (a2) != ira_loop_tree_root)); | |
029da7d4 BS |
446 | parent_a1 = ira_parent_or_cap_allocno (a1); |
447 | parent_a2 = ira_parent_or_cap_allocno (a2); | |
058e97ec | 448 | ira_assert (parent_a1 != NULL && parent_a2 != NULL); |
ac0ab4f7 | 449 | if (! allocnos_conflict_for_copy_p (parent_a1, parent_a2)) |
548a6322 VM |
450 | ira_add_allocno_copy (parent_a1, parent_a2, cp->freq, |
451 | cp->constraint_p, cp->insn, cp->loop_tree_node); | |
058e97ec VM |
452 | } |
453 | } | |
454 | ||
058e97ec | 455 | /* Array used to collect all conflict allocnos for given allocno. */ |
a49ae217 | 456 | static ira_object_t *collected_conflict_objects; |
058e97ec VM |
457 | |
458 | /* Build conflict vectors or bit conflict vectors (whatever is more | |
ac0ab4f7 | 459 | profitable) for object OBJ from the conflict table. */ |
058e97ec | 460 | static void |
ac0ab4f7 | 461 | build_object_conflicts (ira_object_t obj) |
058e97ec VM |
462 | { |
463 | int i, px, parent_num; | |
a49ae217 | 464 | ira_allocno_t parent_a, another_parent_a; |
ac0ab4f7 BS |
465 | ira_object_t parent_obj; |
466 | ira_allocno_t a = OBJECT_ALLOCNO (obj); | |
467 | IRA_INT_TYPE *object_conflicts; | |
42ce1cc4 | 468 | minmax_set_iterator asi; |
5c82436e | 469 | int parent_min, parent_max ATTRIBUTE_UNUSED; |
058e97ec | 470 | |
ac0ab4f7 | 471 | object_conflicts = conflicts[OBJECT_CONFLICT_ID (obj)]; |
058e97ec | 472 | px = 0; |
ac0ab4f7 | 473 | FOR_EACH_BIT_IN_MINMAX_SET (object_conflicts, |
a49ae217 | 474 | OBJECT_MIN (obj), OBJECT_MAX (obj), i, asi) |
058e97ec | 475 | { |
a49ae217 BS |
476 | ira_object_t another_obj = ira_object_id_map[i]; |
477 | ira_allocno_t another_a = OBJECT_ALLOCNO (obj); | |
1756cb66 | 478 | |
7db7ed3c | 479 | ira_assert (ira_reg_classes_intersect_p |
1756cb66 | 480 | [ALLOCNO_CLASS (a)][ALLOCNO_CLASS (another_a)]); |
a49ae217 | 481 | collected_conflict_objects[px++] = another_obj; |
058e97ec | 482 | } |
a49ae217 | 483 | if (ira_conflict_vector_profitable_p (obj, px)) |
058e97ec | 484 | { |
ac0ab4f7 | 485 | ira_object_t *vec; |
a49ae217 BS |
486 | ira_allocate_conflict_vec (obj, px); |
487 | vec = OBJECT_CONFLICT_VEC (obj); | |
488 | memcpy (vec, collected_conflict_objects, sizeof (ira_object_t) * px); | |
058e97ec | 489 | vec[px] = NULL; |
a49ae217 | 490 | OBJECT_NUM_CONFLICTS (obj) = px; |
058e97ec VM |
491 | } |
492 | else | |
493 | { | |
ac0ab4f7 | 494 | int conflict_bit_vec_words_num; |
1756cb66 | 495 | |
ac0ab4f7 | 496 | OBJECT_CONFLICT_ARRAY (obj) = object_conflicts; |
a49ae217 | 497 | if (OBJECT_MAX (obj) < OBJECT_MIN (obj)) |
058e97ec VM |
498 | conflict_bit_vec_words_num = 0; |
499 | else | |
500 | conflict_bit_vec_words_num | |
a49ae217 | 501 | = ((OBJECT_MAX (obj) - OBJECT_MIN (obj) + IRA_INT_BITS) |
058e97ec | 502 | / IRA_INT_BITS); |
a49ae217 | 503 | OBJECT_CONFLICT_ARRAY_SIZE (obj) |
058e97ec VM |
504 | = conflict_bit_vec_words_num * sizeof (IRA_INT_TYPE); |
505 | } | |
ac0ab4f7 | 506 | |
029da7d4 BS |
507 | parent_a = ira_parent_or_cap_allocno (a); |
508 | if (parent_a == NULL) | |
058e97ec | 509 | return; |
1756cb66 | 510 | ira_assert (ALLOCNO_CLASS (a) == ALLOCNO_CLASS (parent_a)); |
ac0ab4f7 BS |
511 | ira_assert (ALLOCNO_NUM_OBJECTS (a) == ALLOCNO_NUM_OBJECTS (parent_a)); |
512 | parent_obj = ALLOCNO_OBJECT (parent_a, OBJECT_SUBWORD (obj)); | |
a49ae217 | 513 | parent_num = OBJECT_CONFLICT_ID (parent_obj); |
1756cb66 VM |
514 | parent_min = OBJECT_MIN (parent_obj); |
515 | parent_max = OBJECT_MAX (parent_obj); | |
ac0ab4f7 | 516 | FOR_EACH_BIT_IN_MINMAX_SET (object_conflicts, |
a49ae217 | 517 | OBJECT_MIN (obj), OBJECT_MAX (obj), i, asi) |
058e97ec | 518 | { |
a49ae217 BS |
519 | ira_object_t another_obj = ira_object_id_map[i]; |
520 | ira_allocno_t another_a = OBJECT_ALLOCNO (another_obj); | |
ac0ab4f7 | 521 | int another_word = OBJECT_SUBWORD (another_obj); |
a49ae217 | 522 | |
7db7ed3c | 523 | ira_assert (ira_reg_classes_intersect_p |
1756cb66 | 524 | [ALLOCNO_CLASS (a)][ALLOCNO_CLASS (another_a)]); |
ac0ab4f7 | 525 | |
029da7d4 BS |
526 | another_parent_a = ira_parent_or_cap_allocno (another_a); |
527 | if (another_parent_a == NULL) | |
058e97ec VM |
528 | continue; |
529 | ira_assert (ALLOCNO_NUM (another_parent_a) >= 0); | |
1756cb66 VM |
530 | ira_assert (ALLOCNO_CLASS (another_a) |
531 | == ALLOCNO_CLASS (another_parent_a)); | |
ac0ab4f7 BS |
532 | ira_assert (ALLOCNO_NUM_OBJECTS (another_a) |
533 | == ALLOCNO_NUM_OBJECTS (another_parent_a)); | |
42ce1cc4 | 534 | SET_MINMAX_SET_BIT (conflicts[parent_num], |
ac0ab4f7 | 535 | OBJECT_CONFLICT_ID (ALLOCNO_OBJECT (another_parent_a, |
1756cb66 VM |
536 | another_word)), |
537 | parent_min, parent_max); | |
058e97ec VM |
538 | } |
539 | } | |
540 | ||
541 | /* Build conflict vectors or bit conflict vectors (whatever is more | |
542 | profitable) of all allocnos from the conflict table. */ | |
543 | static void | |
544 | build_conflicts (void) | |
545 | { | |
546 | int i; | |
547 | ira_allocno_t a, cap; | |
548 | ||
a49ae217 BS |
549 | collected_conflict_objects |
550 | = (ira_object_t *) ira_allocate (sizeof (ira_object_t) | |
551 | * ira_objects_num); | |
058e97ec VM |
552 | for (i = max_reg_num () - 1; i >= FIRST_PSEUDO_REGISTER; i--) |
553 | for (a = ira_regno_allocno_map[i]; | |
554 | a != NULL; | |
555 | a = ALLOCNO_NEXT_REGNO_ALLOCNO (a)) | |
556 | { | |
ac0ab4f7 BS |
557 | int j, nregs = ALLOCNO_NUM_OBJECTS (a); |
558 | for (j = 0; j < nregs; j++) | |
559 | { | |
560 | ira_object_t obj = ALLOCNO_OBJECT (a, j); | |
561 | build_object_conflicts (obj); | |
562 | for (cap = ALLOCNO_CAP (a); cap != NULL; cap = ALLOCNO_CAP (cap)) | |
563 | { | |
564 | ira_object_t cap_obj = ALLOCNO_OBJECT (cap, j); | |
565 | gcc_assert (ALLOCNO_NUM_OBJECTS (cap) == ALLOCNO_NUM_OBJECTS (a)); | |
566 | build_object_conflicts (cap_obj); | |
567 | } | |
568 | } | |
058e97ec | 569 | } |
a49ae217 | 570 | ira_free (collected_conflict_objects); |
058e97ec VM |
571 | } |
572 | ||
573 | \f | |
574 | ||
575 | /* Print hard reg set SET with TITLE to FILE. */ | |
576 | static void | |
577 | print_hard_reg_set (FILE *file, const char *title, HARD_REG_SET set) | |
578 | { | |
579 | int i, start; | |
580 | ||
edb30094 | 581 | fputs (title, file); |
058e97ec VM |
582 | for (start = -1, i = 0; i < FIRST_PSEUDO_REGISTER; i++) |
583 | { | |
584 | if (TEST_HARD_REG_BIT (set, i)) | |
585 | { | |
586 | if (i == 0 || ! TEST_HARD_REG_BIT (set, i - 1)) | |
587 | start = i; | |
588 | } | |
589 | if (start >= 0 | |
590 | && (i == FIRST_PSEUDO_REGISTER - 1 || ! TEST_HARD_REG_BIT (set, i))) | |
591 | { | |
592 | if (start == i - 1) | |
593 | fprintf (file, " %d", start); | |
594 | else if (start == i - 2) | |
595 | fprintf (file, " %d %d", start, start + 1); | |
596 | else | |
597 | fprintf (file, " %d-%d", start, i - 1); | |
598 | start = -1; | |
599 | } | |
600 | } | |
edb30094 | 601 | putc ('\n', file); |
058e97ec VM |
602 | } |
603 | ||
058e97ec | 604 | static void |
e4f36d31 | 605 | print_allocno_conflicts (FILE * file, bool reg_p, ira_allocno_t a) |
058e97ec | 606 | { |
058e97ec | 607 | HARD_REG_SET conflicting_hard_regs; |
e4f36d31 | 608 | basic_block bb; |
ac0ab4f7 | 609 | int n, i; |
058e97ec | 610 | |
e4f36d31 JL |
611 | if (reg_p) |
612 | fprintf (file, ";; r%d", ALLOCNO_REGNO (a)); | |
613 | else | |
058e97ec | 614 | { |
e4f36d31 JL |
615 | fprintf (file, ";; a%d(r%d,", ALLOCNO_NUM (a), ALLOCNO_REGNO (a)); |
616 | if ((bb = ALLOCNO_LOOP_TREE_NODE (a)->bb) != NULL) | |
617 | fprintf (file, "b%d", bb->index); | |
058e97ec | 618 | else |
2608d841 | 619 | fprintf (file, "l%d", ALLOCNO_LOOP_TREE_NODE (a)->loop_num); |
e4f36d31 JL |
620 | putc (')', file); |
621 | } | |
a49ae217 | 622 | |
e4f36d31 | 623 | fputs (" conflicts:", file); |
ac0ab4f7 BS |
624 | n = ALLOCNO_NUM_OBJECTS (a); |
625 | for (i = 0; i < n; i++) | |
626 | { | |
627 | ira_object_t obj = ALLOCNO_OBJECT (a, i); | |
628 | ira_object_t conflict_obj; | |
629 | ira_object_conflict_iterator oci; | |
630 | ||
631 | if (OBJECT_CONFLICT_ARRAY (obj) == NULL) | |
632 | continue; | |
633 | if (n > 1) | |
634 | fprintf (file, "\n;; subobject %d:", i); | |
635 | FOR_EACH_OBJECT_CONFLICT (obj, conflict_obj, oci) | |
636 | { | |
637 | ira_allocno_t conflict_a = OBJECT_ALLOCNO (conflict_obj); | |
638 | if (reg_p) | |
639 | fprintf (file, " r%d,", ALLOCNO_REGNO (conflict_a)); | |
640 | else | |
641 | { | |
642 | fprintf (file, " a%d(r%d", ALLOCNO_NUM (conflict_a), | |
643 | ALLOCNO_REGNO (conflict_a)); | |
644 | if (ALLOCNO_NUM_OBJECTS (conflict_a) > 1) | |
645 | fprintf (file, ",w%d", OBJECT_SUBWORD (conflict_obj)); | |
646 | if ((bb = ALLOCNO_LOOP_TREE_NODE (conflict_a)->bb) != NULL) | |
647 | fprintf (file, ",b%d", bb->index); | |
648 | else | |
649 | fprintf (file, ",l%d", | |
2608d841 | 650 | ALLOCNO_LOOP_TREE_NODE (conflict_a)->loop_num); |
ac0ab4f7 BS |
651 | putc (')', file); |
652 | } | |
653 | } | |
654 | COPY_HARD_REG_SET (conflicting_hard_regs, OBJECT_TOTAL_CONFLICT_HARD_REGS (obj)); | |
655 | AND_COMPL_HARD_REG_SET (conflicting_hard_regs, ira_no_alloc_regs); | |
656 | AND_HARD_REG_SET (conflicting_hard_regs, | |
1756cb66 | 657 | reg_class_contents[ALLOCNO_CLASS (a)]); |
ac0ab4f7 BS |
658 | print_hard_reg_set (file, "\n;; total conflict hard regs:", |
659 | conflicting_hard_regs); | |
660 | ||
661 | COPY_HARD_REG_SET (conflicting_hard_regs, OBJECT_CONFLICT_HARD_REGS (obj)); | |
662 | AND_COMPL_HARD_REG_SET (conflicting_hard_regs, ira_no_alloc_regs); | |
663 | AND_HARD_REG_SET (conflicting_hard_regs, | |
1756cb66 | 664 | reg_class_contents[ALLOCNO_CLASS (a)]); |
ac0ab4f7 BS |
665 | print_hard_reg_set (file, ";; conflict hard regs:", |
666 | conflicting_hard_regs); | |
667 | putc ('\n', file); | |
668 | } | |
a49ae217 | 669 | |
058e97ec VM |
670 | } |
671 | ||
e4f36d31 JL |
672 | /* Print information about allocno or only regno (if REG_P) conflicts |
673 | to FILE. */ | |
674 | static void | |
675 | print_conflicts (FILE *file, bool reg_p) | |
676 | { | |
677 | ira_allocno_t a; | |
678 | ira_allocno_iterator ai; | |
679 | ||
680 | FOR_EACH_ALLOCNO (a, ai) | |
681 | print_allocno_conflicts (file, reg_p, a); | |
682 | } | |
683 | ||
058e97ec VM |
684 | /* Print information about allocno or only regno (if REG_P) conflicts |
685 | to stderr. */ | |
686 | void | |
687 | ira_debug_conflicts (bool reg_p) | |
688 | { | |
689 | print_conflicts (stderr, reg_p); | |
690 | } | |
691 | ||
692 | \f | |
693 | ||
694 | /* Entry function which builds allocno conflicts and allocno copies | |
695 | and accumulate some allocno info on upper level regions. */ | |
696 | void | |
697 | ira_build_conflicts (void) | |
698 | { | |
86fc3d06 | 699 | enum reg_class base; |
058e97ec VM |
700 | ira_allocno_t a; |
701 | ira_allocno_iterator ai; | |
7db7ed3c | 702 | HARD_REG_SET temp_hard_reg_set; |
058e97ec | 703 | |
311aab06 | 704 | if (ira_conflicts_p) |
058e97ec | 705 | { |
311aab06 VM |
706 | ira_conflicts_p = build_conflict_bit_table (); |
707 | if (ira_conflicts_p) | |
058e97ec | 708 | { |
a49ae217 BS |
709 | ira_object_t obj; |
710 | ira_object_iterator oi; | |
711 | ||
311aab06 | 712 | build_conflicts (); |
e6a7da82 | 713 | ira_traverse_loop_tree (true, ira_loop_tree_root, add_copies, NULL); |
311aab06 VM |
714 | /* We need finished conflict table for the subsequent call. */ |
715 | if (flag_ira_region == IRA_REGION_ALL | |
716 | || flag_ira_region == IRA_REGION_MIXED) | |
717 | propagate_copies (); | |
a49ae217 | 718 | |
311aab06 | 719 | /* Now we can free memory for the conflict table (see function |
ac0ab4f7 | 720 | build_object_conflicts for details). */ |
a49ae217 | 721 | FOR_EACH_OBJECT (obj, oi) |
311aab06 | 722 | { |
a49ae217 BS |
723 | if (OBJECT_CONFLICT_ARRAY (obj) != conflicts[OBJECT_CONFLICT_ID (obj)]) |
724 | ira_free (conflicts[OBJECT_CONFLICT_ID (obj)]); | |
311aab06 VM |
725 | } |
726 | ira_free (conflicts); | |
058e97ec | 727 | } |
058e97ec | 728 | } |
86fc3d06 UW |
729 | base = base_reg_class (VOIDmode, ADDR_SPACE_GENERIC, ADDRESS, SCRATCH); |
730 | if (! targetm.class_likely_spilled_p (base)) | |
7db7ed3c VM |
731 | CLEAR_HARD_REG_SET (temp_hard_reg_set); |
732 | else | |
733 | { | |
86fc3d06 | 734 | COPY_HARD_REG_SET (temp_hard_reg_set, reg_class_contents[base]); |
7db7ed3c VM |
735 | AND_COMPL_HARD_REG_SET (temp_hard_reg_set, ira_no_alloc_regs); |
736 | AND_HARD_REG_SET (temp_hard_reg_set, call_used_reg_set); | |
737 | } | |
058e97ec VM |
738 | FOR_EACH_ALLOCNO (a, ai) |
739 | { | |
ac0ab4f7 | 740 | int i, n = ALLOCNO_NUM_OBJECTS (a); |
1756cb66 | 741 | |
ac0ab4f7 | 742 | for (i = 0; i < n; i++) |
058e97ec | 743 | { |
ac0ab4f7 | 744 | ira_object_t obj = ALLOCNO_OBJECT (a, i); |
e6d46b5a | 745 | rtx allocno_reg = regno_reg_rtx [ALLOCNO_REGNO (a)]; |
ac0ab4f7 BS |
746 | |
747 | if ((! flag_caller_saves && ALLOCNO_CALLS_CROSSED_NUM (a) != 0) | |
748 | /* For debugging purposes don't put user defined variables in | |
a698cc03 JL |
749 | callee-clobbered registers. However, do allow parameters |
750 | in callee-clobbered registers to improve debugging. This | |
751 | is a bit of a fragile hack. */ | |
752 | || (optimize == 0 | |
753 | && REG_USERVAR_P (allocno_reg) | |
754 | && ! reg_is_parm_p (allocno_reg))) | |
ac0ab4f7 BS |
755 | { |
756 | IOR_HARD_REG_SET (OBJECT_TOTAL_CONFLICT_HARD_REGS (obj), | |
757 | call_used_reg_set); | |
758 | IOR_HARD_REG_SET (OBJECT_CONFLICT_HARD_REGS (obj), | |
759 | call_used_reg_set); | |
760 | } | |
761 | else if (ALLOCNO_CALLS_CROSSED_NUM (a) != 0) | |
762 | { | |
763 | IOR_HARD_REG_SET (OBJECT_TOTAL_CONFLICT_HARD_REGS (obj), | |
764 | no_caller_save_reg_set); | |
765 | IOR_HARD_REG_SET (OBJECT_TOTAL_CONFLICT_HARD_REGS (obj), | |
766 | temp_hard_reg_set); | |
767 | IOR_HARD_REG_SET (OBJECT_CONFLICT_HARD_REGS (obj), | |
768 | no_caller_save_reg_set); | |
769 | IOR_HARD_REG_SET (OBJECT_CONFLICT_HARD_REGS (obj), | |
770 | temp_hard_reg_set); | |
771 | } | |
0644953e | 772 | |
d1bb282e DS |
773 | /* Now we deal with paradoxical subreg cases where certain registers |
774 | cannot be accessed in the widest mode. */ | |
ef4bddc2 RS |
775 | machine_mode outer_mode = ALLOCNO_WMODE (a); |
776 | machine_mode inner_mode = ALLOCNO_MODE (a); | |
d1bb282e DS |
777 | if (GET_MODE_SIZE (outer_mode) > GET_MODE_SIZE (inner_mode)) |
778 | { | |
779 | enum reg_class aclass = ALLOCNO_CLASS (a); | |
780 | for (int j = ira_class_hard_regs_num[aclass] - 1; j >= 0; --j) | |
781 | { | |
782 | int inner_regno = ira_class_hard_regs[aclass][j]; | |
783 | int outer_regno = simplify_subreg_regno (inner_regno, | |
784 | inner_mode, 0, | |
785 | outer_mode); | |
786 | if (outer_regno < 0 | |
787 | || !in_hard_reg_set_p (reg_class_contents[aclass], | |
788 | outer_mode, outer_regno)) | |
789 | SET_HARD_REG_BIT (OBJECT_CONFLICT_HARD_REGS (obj), | |
790 | inner_regno); | |
791 | } | |
792 | } | |
793 | ||
0644953e AK |
794 | if (ALLOCNO_CALLS_CROSSED_NUM (a) != 0) |
795 | { | |
796 | int regno; | |
797 | ||
798 | /* Allocnos bigger than the saved part of call saved | |
799 | regs must conflict with them. */ | |
800 | for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++) | |
801 | if (!TEST_HARD_REG_BIT (call_used_reg_set, regno) | |
802 | && HARD_REGNO_CALL_PART_CLOBBERED (regno, | |
803 | obj->allocno->mode)) | |
804 | { | |
805 | SET_HARD_REG_BIT (OBJECT_CONFLICT_HARD_REGS (obj), regno); | |
806 | SET_HARD_REG_BIT (OBJECT_TOTAL_CONFLICT_HARD_REGS (obj), | |
807 | regno); | |
808 | } | |
809 | } | |
058e97ec VM |
810 | } |
811 | } | |
311aab06 VM |
812 | if (optimize && ira_conflicts_p |
813 | && internal_flag_ira_verbose > 2 && ira_dump_file != NULL) | |
058e97ec VM |
814 | print_conflicts (ira_dump_file, false); |
815 | } |