]>
Commit | Line | Data |
---|---|---|
058e97ec | 1 | /* Building internal representation for IRA. |
d1e082c2 | 2 | Copyright (C) 2006-2013 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" | |
24 | #include "tm.h" | |
25 | #include "rtl.h" | |
26 | #include "tm_p.h" | |
27 | #include "target.h" | |
28 | #include "regs.h" | |
29 | #include "flags.h" | |
30 | #include "hard-reg-set.h" | |
31 | #include "basic-block.h" | |
32 | #include "insn-config.h" | |
33 | #include "recog.h" | |
718f9c0f | 34 | #include "diagnostic-core.h" |
058e97ec VM |
35 | #include "params.h" |
36 | #include "df.h" | |
058e97ec VM |
37 | #include "reload.h" |
38 | #include "sparseset.h" | |
39 | #include "ira-int.h" | |
5936d944 | 40 | #include "emit-rtl.h" /* FIXME: Can go away once crtl is moved to rtl.h. */ |
058e97ec VM |
41 | |
42 | static ira_copy_t find_allocno_copy (ira_allocno_t, ira_allocno_t, rtx, | |
43 | ira_loop_tree_node_t); | |
44 | ||
45 | /* The root of the loop tree corresponding to the all function. */ | |
46 | ira_loop_tree_node_t ira_loop_tree_root; | |
47 | ||
48 | /* Height of the loop tree. */ | |
49 | int ira_loop_tree_height; | |
50 | ||
51 | /* All nodes representing basic blocks are referred through the | |
52 | following array. We can not use basic block member `aux' for this | |
53 | because it is used for insertion of insns on edges. */ | |
54 | ira_loop_tree_node_t ira_bb_nodes; | |
55 | ||
56 | /* All nodes representing loops are referred through the following | |
57 | array. */ | |
58 | ira_loop_tree_node_t ira_loop_nodes; | |
59 | ||
caff7edf JJ |
60 | /* And size of the ira_loop_nodes array. */ |
61 | unsigned int ira_loop_nodes_count; | |
62 | ||
b8698a0f | 63 | /* Map regno -> allocnos with given regno (see comments for |
058e97ec VM |
64 | allocno member `next_regno_allocno'). */ |
65 | ira_allocno_t *ira_regno_allocno_map; | |
66 | ||
67 | /* Array of references to all allocnos. The order number of the | |
68 | allocno corresponds to the index in the array. Removed allocnos | |
69 | have NULL element value. */ | |
70 | ira_allocno_t *ira_allocnos; | |
71 | ||
72 | /* Sizes of the previous array. */ | |
73 | int ira_allocnos_num; | |
74 | ||
a49ae217 BS |
75 | /* Count of conflict record structures we've created, used when creating |
76 | a new conflict id. */ | |
77 | int ira_objects_num; | |
78 | ||
79 | /* Map a conflict id to its conflict record. */ | |
80 | ira_object_t *ira_object_id_map; | |
058e97ec | 81 | |
3b6d1699 VM |
82 | /* Array of references to all allocno preferences. The order number |
83 | of the preference corresponds to the index in the array. */ | |
84 | ira_pref_t *ira_prefs; | |
85 | ||
86 | /* Size of the previous array. */ | |
87 | int ira_prefs_num; | |
88 | ||
058e97ec VM |
89 | /* Array of references to all copies. The order number of the copy |
90 | corresponds to the index in the array. Removed copies have NULL | |
91 | element value. */ | |
92 | ira_copy_t *ira_copies; | |
93 | ||
94 | /* Size of the previous array. */ | |
95 | int ira_copies_num; | |
96 | ||
97 | \f | |
98 | ||
99 | /* LAST_BASIC_BLOCK before generating additional insns because of live | |
100 | range splitting. Emitting insns on a critical edge creates a new | |
101 | basic block. */ | |
102 | static int last_basic_block_before_change; | |
103 | ||
2608d841 VM |
104 | /* Initialize some members in loop tree node NODE. Use LOOP_NUM for |
105 | the member loop_num. */ | |
058e97ec | 106 | static void |
2608d841 VM |
107 | init_loop_tree_node (struct ira_loop_tree_node *node, int loop_num) |
108 | { | |
109 | int max_regno = max_reg_num (); | |
110 | ||
111 | node->regno_allocno_map | |
112 | = (ira_allocno_t *) ira_allocate (sizeof (ira_allocno_t) * max_regno); | |
113 | memset (node->regno_allocno_map, 0, sizeof (ira_allocno_t) * max_regno); | |
114 | memset (node->reg_pressure, 0, sizeof (node->reg_pressure)); | |
115 | node->all_allocnos = ira_allocate_bitmap (); | |
116 | node->modified_regnos = ira_allocate_bitmap (); | |
117 | node->border_allocnos = ira_allocate_bitmap (); | |
118 | node->local_copies = ira_allocate_bitmap (); | |
119 | node->loop_num = loop_num; | |
120 | node->children = NULL; | |
121 | node->subloops = NULL; | |
122 | } | |
123 | ||
124 | ||
125 | /* The following function allocates the loop tree nodes. If | |
126 | CURRENT_LOOPS is NULL, the nodes corresponding to the loops (except | |
127 | the root which corresponds the all function) will be not allocated | |
128 | but nodes will still be allocated for basic blocks. */ | |
129 | static void | |
130 | create_loop_tree_nodes (void) | |
058e97ec VM |
131 | { |
132 | unsigned int i, j; | |
058e97ec VM |
133 | bool skip_p; |
134 | edge_iterator ei; | |
135 | edge e; | |
9771b263 | 136 | vec<edge> edges; |
058e97ec VM |
137 | loop_p loop; |
138 | ||
139 | ira_bb_nodes | |
140 | = ((struct ira_loop_tree_node *) | |
141 | ira_allocate (sizeof (struct ira_loop_tree_node) * last_basic_block)); | |
142 | last_basic_block_before_change = last_basic_block; | |
143 | for (i = 0; i < (unsigned int) last_basic_block; i++) | |
144 | { | |
145 | ira_bb_nodes[i].regno_allocno_map = NULL; | |
146 | memset (ira_bb_nodes[i].reg_pressure, 0, | |
147 | sizeof (ira_bb_nodes[i].reg_pressure)); | |
49d988e7 | 148 | ira_bb_nodes[i].all_allocnos = NULL; |
058e97ec VM |
149 | ira_bb_nodes[i].modified_regnos = NULL; |
150 | ira_bb_nodes[i].border_allocnos = NULL; | |
151 | ira_bb_nodes[i].local_copies = NULL; | |
152 | } | |
2608d841 VM |
153 | if (current_loops == NULL) |
154 | { | |
caff7edf | 155 | ira_loop_nodes_count = 1; |
2608d841 VM |
156 | ira_loop_nodes = ((struct ira_loop_tree_node *) |
157 | ira_allocate (sizeof (struct ira_loop_tree_node))); | |
158 | init_loop_tree_node (ira_loop_nodes, 0); | |
159 | return; | |
160 | } | |
0fc822d0 | 161 | ira_loop_nodes_count = number_of_loops (cfun); |
058e97ec VM |
162 | ira_loop_nodes = ((struct ira_loop_tree_node *) |
163 | ira_allocate (sizeof (struct ira_loop_tree_node) | |
caff7edf | 164 | * ira_loop_nodes_count)); |
0fc822d0 | 165 | FOR_EACH_VEC_SAFE_ELT (get_loops (cfun), i, loop) |
058e97ec | 166 | { |
661bc682 | 167 | if (loop_outer (loop) != NULL) |
058e97ec VM |
168 | { |
169 | ira_loop_nodes[i].regno_allocno_map = NULL; | |
058e97ec VM |
170 | skip_p = false; |
171 | FOR_EACH_EDGE (e, ei, loop->header->preds) | |
172 | if (e->src != loop->latch | |
173 | && (e->flags & EDGE_ABNORMAL) && EDGE_CRITICAL_P (e)) | |
174 | { | |
175 | skip_p = true; | |
176 | break; | |
177 | } | |
178 | if (skip_p) | |
179 | continue; | |
180 | edges = get_loop_exit_edges (loop); | |
9771b263 | 181 | FOR_EACH_VEC_ELT (edges, j, e) |
058e97ec VM |
182 | if ((e->flags & EDGE_ABNORMAL) && EDGE_CRITICAL_P (e)) |
183 | { | |
184 | skip_p = true; | |
185 | break; | |
186 | } | |
9771b263 | 187 | edges.release (); |
058e97ec VM |
188 | if (skip_p) |
189 | continue; | |
190 | } | |
2608d841 | 191 | init_loop_tree_node (&ira_loop_nodes[i], loop->num); |
058e97ec VM |
192 | } |
193 | } | |
194 | ||
195 | /* The function returns TRUE if there are more one allocation | |
196 | region. */ | |
197 | static bool | |
198 | more_one_region_p (void) | |
199 | { | |
200 | unsigned int i; | |
201 | loop_p loop; | |
202 | ||
2608d841 | 203 | if (current_loops != NULL) |
0fc822d0 | 204 | FOR_EACH_VEC_SAFE_ELT (get_loops (cfun), i, loop) |
2608d841 VM |
205 | if (ira_loop_nodes[i].regno_allocno_map != NULL |
206 | && ira_loop_tree_root != &ira_loop_nodes[i]) | |
207 | return true; | |
058e97ec VM |
208 | return false; |
209 | } | |
210 | ||
211 | /* Free the loop tree node of a loop. */ | |
212 | static void | |
213 | finish_loop_tree_node (ira_loop_tree_node_t loop) | |
214 | { | |
215 | if (loop->regno_allocno_map != NULL) | |
216 | { | |
217 | ira_assert (loop->bb == NULL); | |
218 | ira_free_bitmap (loop->local_copies); | |
219 | ira_free_bitmap (loop->border_allocnos); | |
220 | ira_free_bitmap (loop->modified_regnos); | |
49d988e7 | 221 | ira_free_bitmap (loop->all_allocnos); |
058e97ec VM |
222 | ira_free (loop->regno_allocno_map); |
223 | loop->regno_allocno_map = NULL; | |
224 | } | |
225 | } | |
226 | ||
227 | /* Free the loop tree nodes. */ | |
228 | static void | |
229 | finish_loop_tree_nodes (void) | |
230 | { | |
231 | unsigned int i; | |
058e97ec | 232 | |
caff7edf JJ |
233 | for (i = 0; i < ira_loop_nodes_count; i++) |
234 | finish_loop_tree_node (&ira_loop_nodes[i]); | |
058e97ec VM |
235 | ira_free (ira_loop_nodes); |
236 | for (i = 0; i < (unsigned int) last_basic_block_before_change; i++) | |
237 | { | |
238 | if (ira_bb_nodes[i].local_copies != NULL) | |
239 | ira_free_bitmap (ira_bb_nodes[i].local_copies); | |
240 | if (ira_bb_nodes[i].border_allocnos != NULL) | |
241 | ira_free_bitmap (ira_bb_nodes[i].border_allocnos); | |
242 | if (ira_bb_nodes[i].modified_regnos != NULL) | |
243 | ira_free_bitmap (ira_bb_nodes[i].modified_regnos); | |
49d988e7 VM |
244 | if (ira_bb_nodes[i].all_allocnos != NULL) |
245 | ira_free_bitmap (ira_bb_nodes[i].all_allocnos); | |
058e97ec VM |
246 | if (ira_bb_nodes[i].regno_allocno_map != NULL) |
247 | ira_free (ira_bb_nodes[i].regno_allocno_map); | |
248 | } | |
249 | ira_free (ira_bb_nodes); | |
250 | } | |
251 | ||
252 | \f | |
253 | ||
254 | /* The following recursive function adds LOOP to the loop tree | |
2608d841 VM |
255 | hierarchy. LOOP is added only once. If LOOP is NULL we adding |
256 | loop designating the whole function when CFG loops are not | |
257 | built. */ | |
058e97ec VM |
258 | static void |
259 | add_loop_to_tree (struct loop *loop) | |
260 | { | |
2608d841 | 261 | int loop_num; |
058e97ec VM |
262 | struct loop *parent; |
263 | ira_loop_tree_node_t loop_node, parent_node; | |
264 | ||
265 | /* We can not use loop node access macros here because of potential | |
266 | checking and because the nodes are not initialized enough | |
267 | yet. */ | |
2608d841 | 268 | if (loop != NULL && loop_outer (loop) != NULL) |
058e97ec | 269 | add_loop_to_tree (loop_outer (loop)); |
2608d841 VM |
270 | loop_num = loop != NULL ? loop->num : 0; |
271 | if (ira_loop_nodes[loop_num].regno_allocno_map != NULL | |
272 | && ira_loop_nodes[loop_num].children == NULL) | |
058e97ec VM |
273 | { |
274 | /* We have not added loop node to the tree yet. */ | |
2608d841 | 275 | loop_node = &ira_loop_nodes[loop_num]; |
058e97ec VM |
276 | loop_node->loop = loop; |
277 | loop_node->bb = NULL; | |
2608d841 VM |
278 | if (loop == NULL) |
279 | parent = NULL; | |
280 | else | |
281 | { | |
282 | for (parent = loop_outer (loop); | |
283 | parent != NULL; | |
284 | parent = loop_outer (parent)) | |
285 | if (ira_loop_nodes[parent->num].regno_allocno_map != NULL) | |
286 | break; | |
287 | } | |
058e97ec VM |
288 | if (parent == NULL) |
289 | { | |
290 | loop_node->next = NULL; | |
291 | loop_node->subloop_next = NULL; | |
292 | loop_node->parent = NULL; | |
293 | } | |
294 | else | |
295 | { | |
296 | parent_node = &ira_loop_nodes[parent->num]; | |
297 | loop_node->next = parent_node->children; | |
298 | parent_node->children = loop_node; | |
299 | loop_node->subloop_next = parent_node->subloops; | |
300 | parent_node->subloops = loop_node; | |
301 | loop_node->parent = parent_node; | |
302 | } | |
303 | } | |
304 | } | |
305 | ||
306 | /* The following recursive function sets up levels of nodes of the | |
307 | tree given its root LOOP_NODE. The enumeration starts with LEVEL. | |
308 | The function returns maximal value of level in the tree + 1. */ | |
309 | static int | |
310 | setup_loop_tree_level (ira_loop_tree_node_t loop_node, int level) | |
311 | { | |
312 | int height, max_height; | |
313 | ira_loop_tree_node_t subloop_node; | |
314 | ||
315 | ira_assert (loop_node->bb == NULL); | |
316 | loop_node->level = level; | |
317 | max_height = level + 1; | |
318 | for (subloop_node = loop_node->subloops; | |
319 | subloop_node != NULL; | |
320 | subloop_node = subloop_node->subloop_next) | |
321 | { | |
322 | ira_assert (subloop_node->bb == NULL); | |
323 | height = setup_loop_tree_level (subloop_node, level + 1); | |
324 | if (height > max_height) | |
325 | max_height = height; | |
326 | } | |
327 | return max_height; | |
328 | } | |
329 | ||
330 | /* Create the loop tree. The algorithm is designed to provide correct | |
331 | order of loops (they are ordered by their last loop BB) and basic | |
332 | blocks in the chain formed by member next. */ | |
333 | static void | |
334 | form_loop_tree (void) | |
335 | { | |
058e97ec VM |
336 | basic_block bb; |
337 | struct loop *parent; | |
338 | ira_loop_tree_node_t bb_node, loop_node; | |
058e97ec VM |
339 | |
340 | /* We can not use loop/bb node access macros because of potential | |
341 | checking and because the nodes are not initialized enough | |
342 | yet. */ | |
acb37d29 | 343 | FOR_EACH_BB (bb) |
058e97ec VM |
344 | { |
345 | bb_node = &ira_bb_nodes[bb->index]; | |
346 | bb_node->bb = bb; | |
347 | bb_node->loop = NULL; | |
348 | bb_node->subloops = NULL; | |
349 | bb_node->children = NULL; | |
350 | bb_node->subloop_next = NULL; | |
351 | bb_node->next = NULL; | |
2608d841 VM |
352 | if (current_loops == NULL) |
353 | parent = NULL; | |
354 | else | |
355 | { | |
356 | for (parent = bb->loop_father; | |
357 | parent != NULL; | |
358 | parent = loop_outer (parent)) | |
359 | if (ira_loop_nodes[parent->num].regno_allocno_map != NULL) | |
360 | break; | |
361 | } | |
058e97ec | 362 | add_loop_to_tree (parent); |
2608d841 | 363 | loop_node = &ira_loop_nodes[parent == NULL ? 0 : parent->num]; |
058e97ec VM |
364 | bb_node->next = loop_node->children; |
365 | bb_node->parent = loop_node; | |
366 | loop_node->children = bb_node; | |
367 | } | |
2608d841 | 368 | ira_loop_tree_root = IRA_LOOP_NODE_BY_INDEX (0); |
058e97ec VM |
369 | ira_loop_tree_height = setup_loop_tree_level (ira_loop_tree_root, 0); |
370 | ira_assert (ira_loop_tree_root->regno_allocno_map != NULL); | |
371 | } | |
372 | ||
373 | \f | |
374 | ||
375 | /* Rebuild IRA_REGNO_ALLOCNO_MAP and REGNO_ALLOCNO_MAPs of the loop | |
376 | tree nodes. */ | |
377 | static void | |
378 | rebuild_regno_allocno_maps (void) | |
379 | { | |
380 | unsigned int l; | |
381 | int max_regno, regno; | |
382 | ira_allocno_t a; | |
383 | ira_loop_tree_node_t loop_tree_node; | |
384 | loop_p loop; | |
385 | ira_allocno_iterator ai; | |
386 | ||
2608d841 | 387 | ira_assert (current_loops != NULL); |
058e97ec | 388 | max_regno = max_reg_num (); |
0fc822d0 | 389 | FOR_EACH_VEC_SAFE_ELT (get_loops (cfun), l, loop) |
058e97ec VM |
390 | if (ira_loop_nodes[l].regno_allocno_map != NULL) |
391 | { | |
392 | ira_free (ira_loop_nodes[l].regno_allocno_map); | |
393 | ira_loop_nodes[l].regno_allocno_map | |
394 | = (ira_allocno_t *) ira_allocate (sizeof (ira_allocno_t) | |
395 | * max_regno); | |
396 | memset (ira_loop_nodes[l].regno_allocno_map, 0, | |
397 | sizeof (ira_allocno_t) * max_regno); | |
398 | } | |
399 | ira_free (ira_regno_allocno_map); | |
400 | ira_regno_allocno_map | |
401 | = (ira_allocno_t *) ira_allocate (max_regno * sizeof (ira_allocno_t)); | |
402 | memset (ira_regno_allocno_map, 0, max_regno * sizeof (ira_allocno_t)); | |
403 | FOR_EACH_ALLOCNO (a, ai) | |
404 | { | |
405 | if (ALLOCNO_CAP_MEMBER (a) != NULL) | |
406 | /* Caps are not in the regno allocno maps. */ | |
407 | continue; | |
408 | regno = ALLOCNO_REGNO (a); | |
409 | loop_tree_node = ALLOCNO_LOOP_TREE_NODE (a); | |
410 | ALLOCNO_NEXT_REGNO_ALLOCNO (a) = ira_regno_allocno_map[regno]; | |
411 | ira_regno_allocno_map[regno] = a; | |
412 | if (loop_tree_node->regno_allocno_map[regno] == NULL) | |
413 | /* Remember that we can create temporary allocnos to break | |
414 | cycles in register shuffle. */ | |
415 | loop_tree_node->regno_allocno_map[regno] = a; | |
416 | } | |
417 | } | |
058e97ec VM |
418 | \f |
419 | ||
a49ae217 BS |
420 | /* Pools for allocnos, allocno live ranges and objects. */ |
421 | static alloc_pool allocno_pool, live_range_pool, object_pool; | |
058e97ec VM |
422 | |
423 | /* Vec containing references to all created allocnos. It is a | |
424 | container of array allocnos. */ | |
9771b263 | 425 | static vec<ira_allocno_t> allocno_vec; |
058e97ec | 426 | |
a49ae217 BS |
427 | /* Vec containing references to all created ira_objects. It is a |
428 | container of ira_object_id_map. */ | |
9771b263 | 429 | static vec<ira_object_t> ira_object_id_map_vec; |
058e97ec VM |
430 | |
431 | /* Initialize data concerning allocnos. */ | |
432 | static void | |
433 | initiate_allocnos (void) | |
434 | { | |
b14151b5 BS |
435 | live_range_pool |
436 | = create_alloc_pool ("live ranges", | |
437 | sizeof (struct live_range), 100); | |
058e97ec VM |
438 | allocno_pool |
439 | = create_alloc_pool ("allocnos", sizeof (struct ira_allocno), 100); | |
a49ae217 BS |
440 | object_pool |
441 | = create_alloc_pool ("objects", sizeof (struct ira_object), 100); | |
9771b263 | 442 | allocno_vec.create (max_reg_num () * 2); |
058e97ec VM |
443 | ira_allocnos = NULL; |
444 | ira_allocnos_num = 0; | |
a49ae217 | 445 | ira_objects_num = 0; |
9771b263 | 446 | ira_object_id_map_vec.create (max_reg_num () * 2); |
a49ae217 | 447 | ira_object_id_map = NULL; |
058e97ec | 448 | ira_regno_allocno_map |
1756cb66 VM |
449 | = (ira_allocno_t *) ira_allocate (max_reg_num () |
450 | * sizeof (ira_allocno_t)); | |
058e97ec VM |
451 | memset (ira_regno_allocno_map, 0, max_reg_num () * sizeof (ira_allocno_t)); |
452 | } | |
453 | ||
a49ae217 BS |
454 | /* Create and return an object corresponding to a new allocno A. */ |
455 | static ira_object_t | |
ac0ab4f7 | 456 | ira_create_object (ira_allocno_t a, int subword) |
a49ae217 | 457 | { |
1756cb66 | 458 | enum reg_class aclass = ALLOCNO_CLASS (a); |
a49ae217 BS |
459 | ira_object_t obj = (ira_object_t) pool_alloc (object_pool); |
460 | ||
461 | OBJECT_ALLOCNO (obj) = a; | |
ac0ab4f7 | 462 | OBJECT_SUBWORD (obj) = subword; |
a49ae217 BS |
463 | OBJECT_CONFLICT_ID (obj) = ira_objects_num; |
464 | OBJECT_CONFLICT_VEC_P (obj) = false; | |
465 | OBJECT_CONFLICT_ARRAY (obj) = NULL; | |
466 | OBJECT_NUM_CONFLICTS (obj) = 0; | |
467 | COPY_HARD_REG_SET (OBJECT_CONFLICT_HARD_REGS (obj), ira_no_alloc_regs); | |
468 | COPY_HARD_REG_SET (OBJECT_TOTAL_CONFLICT_HARD_REGS (obj), ira_no_alloc_regs); | |
469 | IOR_COMPL_HARD_REG_SET (OBJECT_CONFLICT_HARD_REGS (obj), | |
1756cb66 | 470 | reg_class_contents[aclass]); |
a49ae217 | 471 | IOR_COMPL_HARD_REG_SET (OBJECT_TOTAL_CONFLICT_HARD_REGS (obj), |
1756cb66 | 472 | reg_class_contents[aclass]); |
a49ae217 BS |
473 | OBJECT_MIN (obj) = INT_MAX; |
474 | OBJECT_MAX (obj) = -1; | |
9140d27b | 475 | OBJECT_LIVE_RANGES (obj) = NULL; |
a49ae217 | 476 | |
9771b263 | 477 | ira_object_id_map_vec.safe_push (obj); |
a49ae217 | 478 | ira_object_id_map |
9771b263 DN |
479 | = ira_object_id_map_vec.address (); |
480 | ira_objects_num = ira_object_id_map_vec.length (); | |
ac0ab4f7 | 481 | |
a49ae217 BS |
482 | return obj; |
483 | } | |
484 | ||
058e97ec VM |
485 | /* Create and return the allocno corresponding to REGNO in |
486 | LOOP_TREE_NODE. Add the allocno to the list of allocnos with the | |
487 | same regno if CAP_P is FALSE. */ | |
488 | ira_allocno_t | |
1756cb66 VM |
489 | ira_create_allocno (int regno, bool cap_p, |
490 | ira_loop_tree_node_t loop_tree_node) | |
058e97ec VM |
491 | { |
492 | ira_allocno_t a; | |
493 | ||
494 | a = (ira_allocno_t) pool_alloc (allocno_pool); | |
495 | ALLOCNO_REGNO (a) = regno; | |
496 | ALLOCNO_LOOP_TREE_NODE (a) = loop_tree_node; | |
497 | if (! cap_p) | |
498 | { | |
499 | ALLOCNO_NEXT_REGNO_ALLOCNO (a) = ira_regno_allocno_map[regno]; | |
500 | ira_regno_allocno_map[regno] = a; | |
501 | if (loop_tree_node->regno_allocno_map[regno] == NULL) | |
502 | /* Remember that we can create temporary allocnos to break | |
503 | cycles in register shuffle on region borders (see | |
504 | ira-emit.c). */ | |
505 | loop_tree_node->regno_allocno_map[regno] = a; | |
506 | } | |
507 | ALLOCNO_CAP (a) = NULL; | |
508 | ALLOCNO_CAP_MEMBER (a) = NULL; | |
509 | ALLOCNO_NUM (a) = ira_allocnos_num; | |
49d988e7 | 510 | bitmap_set_bit (loop_tree_node->all_allocnos, ALLOCNO_NUM (a)); |
058e97ec | 511 | ALLOCNO_NREFS (a) = 0; |
854bd721 | 512 | ALLOCNO_FREQ (a) = 0; |
058e97ec VM |
513 | ALLOCNO_HARD_REGNO (a) = -1; |
514 | ALLOCNO_CALL_FREQ (a) = 0; | |
515 | ALLOCNO_CALLS_CROSSED_NUM (a) = 0; | |
e384e6b5 | 516 | ALLOCNO_CHEAP_CALLS_CROSSED_NUM (a) = 0; |
058e97ec VM |
517 | #ifdef STACK_REGS |
518 | ALLOCNO_NO_STACK_REG_P (a) = false; | |
519 | ALLOCNO_TOTAL_NO_STACK_REG_P (a) = false; | |
520 | #endif | |
058e97ec | 521 | ALLOCNO_DONT_REASSIGN_P (a) = false; |
927425df | 522 | ALLOCNO_BAD_SPILL_P (a) = false; |
058e97ec | 523 | ALLOCNO_ASSIGNED_P (a) = false; |
058e97ec | 524 | ALLOCNO_MODE (a) = (regno < 0 ? VOIDmode : PSEUDO_REGNO_MODE (regno)); |
3b6d1699 | 525 | ALLOCNO_PREFS (a) = NULL; |
058e97ec VM |
526 | ALLOCNO_COPIES (a) = NULL; |
527 | ALLOCNO_HARD_REG_COSTS (a) = NULL; | |
528 | ALLOCNO_CONFLICT_HARD_REG_COSTS (a) = NULL; | |
529 | ALLOCNO_UPDATED_HARD_REG_COSTS (a) = NULL; | |
530 | ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS (a) = NULL; | |
1756cb66 VM |
531 | ALLOCNO_CLASS (a) = NO_REGS; |
532 | ALLOCNO_UPDATED_CLASS_COST (a) = 0; | |
533 | ALLOCNO_CLASS_COST (a) = 0; | |
058e97ec VM |
534 | ALLOCNO_MEMORY_COST (a) = 0; |
535 | ALLOCNO_UPDATED_MEMORY_COST (a) = 0; | |
536 | ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (a) = 0; | |
ac0ab4f7 | 537 | ALLOCNO_NUM_OBJECTS (a) = 0; |
a49ae217 | 538 | |
1756cb66 | 539 | ALLOCNO_ADD_DATA (a) = NULL; |
9771b263 DN |
540 | allocno_vec.safe_push (a); |
541 | ira_allocnos = allocno_vec.address (); | |
542 | ira_allocnos_num = allocno_vec.length (); | |
ac0ab4f7 | 543 | |
058e97ec VM |
544 | return a; |
545 | } | |
546 | ||
1756cb66 VM |
547 | /* Set up register class for A and update its conflict hard |
548 | registers. */ | |
058e97ec | 549 | void |
1756cb66 | 550 | ira_set_allocno_class (ira_allocno_t a, enum reg_class aclass) |
058e97ec | 551 | { |
1756cb66 VM |
552 | ira_allocno_object_iterator oi; |
553 | ira_object_t obj; | |
554 | ||
555 | ALLOCNO_CLASS (a) = aclass; | |
556 | FOR_EACH_ALLOCNO_OBJECT (a, obj, oi) | |
557 | { | |
558 | IOR_COMPL_HARD_REG_SET (OBJECT_CONFLICT_HARD_REGS (obj), | |
559 | reg_class_contents[aclass]); | |
560 | IOR_COMPL_HARD_REG_SET (OBJECT_TOTAL_CONFLICT_HARD_REGS (obj), | |
561 | reg_class_contents[aclass]); | |
562 | } | |
a49ae217 BS |
563 | } |
564 | ||
ac0ab4f7 BS |
565 | /* Determine the number of objects we should associate with allocno A |
566 | and allocate them. */ | |
a49ae217 | 567 | void |
ac0ab4f7 | 568 | ira_create_allocno_objects (ira_allocno_t a) |
a49ae217 | 569 | { |
ac0ab4f7 | 570 | enum machine_mode mode = ALLOCNO_MODE (a); |
1756cb66 VM |
571 | enum reg_class aclass = ALLOCNO_CLASS (a); |
572 | int n = ira_reg_class_max_nregs[aclass][mode]; | |
ac0ab4f7 BS |
573 | int i; |
574 | ||
575 | if (GET_MODE_SIZE (mode) != 2 * UNITS_PER_WORD || n != 2) | |
576 | n = 1; | |
577 | ||
578 | ALLOCNO_NUM_OBJECTS (a) = n; | |
579 | for (i = 0; i < n; i++) | |
580 | ALLOCNO_OBJECT (a, i) = ira_create_object (a, i); | |
a49ae217 BS |
581 | } |
582 | ||
ac0ab4f7 | 583 | /* For each allocno, set ALLOCNO_NUM_OBJECTS and create the |
1756cb66 | 584 | ALLOCNO_OBJECT structures. This must be called after the allocno |
ac0ab4f7 | 585 | classes are known. */ |
a49ae217 BS |
586 | static void |
587 | create_allocno_objects (void) | |
588 | { | |
589 | ira_allocno_t a; | |
590 | ira_allocno_iterator ai; | |
591 | ||
592 | FOR_EACH_ALLOCNO (a, ai) | |
ac0ab4f7 | 593 | ira_create_allocno_objects (a); |
058e97ec VM |
594 | } |
595 | ||
ac0ab4f7 BS |
596 | /* Merge hard register conflict information for all objects associated with |
597 | allocno TO into the corresponding objects associated with FROM. | |
598 | If TOTAL_ONLY is true, we only merge OBJECT_TOTAL_CONFLICT_HARD_REGS. */ | |
3c55880a BS |
599 | static void |
600 | merge_hard_reg_conflicts (ira_allocno_t from, ira_allocno_t to, | |
601 | bool total_only) | |
602 | { | |
ac0ab4f7 BS |
603 | int i; |
604 | gcc_assert (ALLOCNO_NUM_OBJECTS (to) == ALLOCNO_NUM_OBJECTS (from)); | |
605 | for (i = 0; i < ALLOCNO_NUM_OBJECTS (to); i++) | |
606 | { | |
607 | ira_object_t from_obj = ALLOCNO_OBJECT (from, i); | |
608 | ira_object_t to_obj = ALLOCNO_OBJECT (to, i); | |
1756cb66 | 609 | |
ac0ab4f7 BS |
610 | if (!total_only) |
611 | IOR_HARD_REG_SET (OBJECT_CONFLICT_HARD_REGS (to_obj), | |
612 | OBJECT_CONFLICT_HARD_REGS (from_obj)); | |
613 | IOR_HARD_REG_SET (OBJECT_TOTAL_CONFLICT_HARD_REGS (to_obj), | |
614 | OBJECT_TOTAL_CONFLICT_HARD_REGS (from_obj)); | |
615 | } | |
3c55880a BS |
616 | #ifdef STACK_REGS |
617 | if (!total_only && ALLOCNO_NO_STACK_REG_P (from)) | |
618 | ALLOCNO_NO_STACK_REG_P (to) = true; | |
619 | if (ALLOCNO_TOTAL_NO_STACK_REG_P (from)) | |
620 | ALLOCNO_TOTAL_NO_STACK_REG_P (to) = true; | |
621 | #endif | |
622 | } | |
623 | ||
ac0ab4f7 BS |
624 | /* Update hard register conflict information for all objects associated with |
625 | A to include the regs in SET. */ | |
626 | void | |
627 | ior_hard_reg_conflicts (ira_allocno_t a, HARD_REG_SET *set) | |
628 | { | |
629 | ira_allocno_object_iterator i; | |
630 | ira_object_t obj; | |
1756cb66 | 631 | |
ac0ab4f7 BS |
632 | FOR_EACH_ALLOCNO_OBJECT (a, obj, i) |
633 | { | |
634 | IOR_HARD_REG_SET (OBJECT_CONFLICT_HARD_REGS (obj), *set); | |
635 | IOR_HARD_REG_SET (OBJECT_TOTAL_CONFLICT_HARD_REGS (obj), *set); | |
636 | } | |
637 | } | |
638 | ||
a49ae217 BS |
639 | /* Return TRUE if a conflict vector with NUM elements is more |
640 | profitable than a conflict bit vector for OBJ. */ | |
058e97ec | 641 | bool |
a49ae217 | 642 | ira_conflict_vector_profitable_p (ira_object_t obj, int num) |
058e97ec VM |
643 | { |
644 | int nw; | |
a49ae217 BS |
645 | int max = OBJECT_MAX (obj); |
646 | int min = OBJECT_MIN (obj); | |
058e97ec | 647 | |
a49ae217 BS |
648 | if (max < min) |
649 | /* We prefer a bit vector in such case because it does not result | |
650 | in allocation. */ | |
058e97ec VM |
651 | return false; |
652 | ||
a49ae217 BS |
653 | nw = (max - min + IRA_INT_BITS) / IRA_INT_BITS; |
654 | return (2 * sizeof (ira_object_t) * (num + 1) | |
058e97ec VM |
655 | < 3 * nw * sizeof (IRA_INT_TYPE)); |
656 | } | |
657 | ||
a49ae217 BS |
658 | /* Allocates and initialize the conflict vector of OBJ for NUM |
659 | conflicting objects. */ | |
058e97ec | 660 | void |
a49ae217 | 661 | ira_allocate_conflict_vec (ira_object_t obj, int num) |
058e97ec VM |
662 | { |
663 | int size; | |
a49ae217 | 664 | ira_object_t *vec; |
058e97ec | 665 | |
a49ae217 | 666 | ira_assert (OBJECT_CONFLICT_ARRAY (obj) == NULL); |
058e97ec | 667 | num++; /* for NULL end marker */ |
a49ae217 BS |
668 | size = sizeof (ira_object_t) * num; |
669 | OBJECT_CONFLICT_ARRAY (obj) = ira_allocate (size); | |
670 | vec = (ira_object_t *) OBJECT_CONFLICT_ARRAY (obj); | |
058e97ec | 671 | vec[0] = NULL; |
a49ae217 BS |
672 | OBJECT_NUM_CONFLICTS (obj) = 0; |
673 | OBJECT_CONFLICT_ARRAY_SIZE (obj) = size; | |
674 | OBJECT_CONFLICT_VEC_P (obj) = true; | |
058e97ec VM |
675 | } |
676 | ||
a49ae217 | 677 | /* Allocate and initialize the conflict bit vector of OBJ. */ |
058e97ec | 678 | static void |
a49ae217 | 679 | allocate_conflict_bit_vec (ira_object_t obj) |
058e97ec VM |
680 | { |
681 | unsigned int size; | |
682 | ||
a49ae217 BS |
683 | ira_assert (OBJECT_CONFLICT_ARRAY (obj) == NULL); |
684 | size = ((OBJECT_MAX (obj) - OBJECT_MIN (obj) + IRA_INT_BITS) | |
058e97ec | 685 | / IRA_INT_BITS * sizeof (IRA_INT_TYPE)); |
a49ae217 BS |
686 | OBJECT_CONFLICT_ARRAY (obj) = ira_allocate (size); |
687 | memset (OBJECT_CONFLICT_ARRAY (obj), 0, size); | |
688 | OBJECT_CONFLICT_ARRAY_SIZE (obj) = size; | |
689 | OBJECT_CONFLICT_VEC_P (obj) = false; | |
058e97ec VM |
690 | } |
691 | ||
692 | /* Allocate and initialize the conflict vector or conflict bit vector | |
ac0ab4f7 | 693 | of OBJ for NUM conflicting allocnos whatever is more profitable. */ |
058e97ec | 694 | void |
ac0ab4f7 | 695 | ira_allocate_object_conflicts (ira_object_t obj, int num) |
058e97ec | 696 | { |
ac0ab4f7 BS |
697 | if (ira_conflict_vector_profitable_p (obj, num)) |
698 | ira_allocate_conflict_vec (obj, num); | |
058e97ec | 699 | else |
ac0ab4f7 | 700 | allocate_conflict_bit_vec (obj); |
058e97ec VM |
701 | } |
702 | ||
a49ae217 | 703 | /* Add OBJ2 to the conflicts of OBJ1. */ |
058e97ec | 704 | static void |
a49ae217 | 705 | add_to_conflicts (ira_object_t obj1, ira_object_t obj2) |
058e97ec VM |
706 | { |
707 | int num; | |
708 | unsigned int size; | |
709 | ||
a49ae217 | 710 | if (OBJECT_CONFLICT_VEC_P (obj1)) |
058e97ec | 711 | { |
a49ae217 BS |
712 | ira_object_t *vec = OBJECT_CONFLICT_VEC (obj1); |
713 | int curr_num = OBJECT_NUM_CONFLICTS (obj1); | |
714 | num = curr_num + 2; | |
715 | if (OBJECT_CONFLICT_ARRAY_SIZE (obj1) < num * sizeof (ira_object_t)) | |
058e97ec | 716 | { |
a49ae217 | 717 | ira_object_t *newvec; |
058e97ec | 718 | size = (3 * num / 2 + 1) * sizeof (ira_allocno_t); |
a49ae217 BS |
719 | newvec = (ira_object_t *) ira_allocate (size); |
720 | memcpy (newvec, vec, curr_num * sizeof (ira_object_t)); | |
721 | ira_free (vec); | |
722 | vec = newvec; | |
723 | OBJECT_CONFLICT_ARRAY (obj1) = vec; | |
724 | OBJECT_CONFLICT_ARRAY_SIZE (obj1) = size; | |
058e97ec | 725 | } |
a49ae217 | 726 | vec[num - 2] = obj2; |
058e97ec | 727 | vec[num - 1] = NULL; |
a49ae217 | 728 | OBJECT_NUM_CONFLICTS (obj1)++; |
058e97ec VM |
729 | } |
730 | else | |
731 | { | |
732 | int nw, added_head_nw, id; | |
a49ae217 | 733 | IRA_INT_TYPE *vec = OBJECT_CONFLICT_BITVEC (obj1); |
058e97ec | 734 | |
a49ae217 BS |
735 | id = OBJECT_CONFLICT_ID (obj2); |
736 | if (OBJECT_MIN (obj1) > id) | |
058e97ec VM |
737 | { |
738 | /* Expand head of the bit vector. */ | |
a49ae217 BS |
739 | added_head_nw = (OBJECT_MIN (obj1) - id - 1) / IRA_INT_BITS + 1; |
740 | nw = (OBJECT_MAX (obj1) - OBJECT_MIN (obj1)) / IRA_INT_BITS + 1; | |
058e97ec | 741 | size = (nw + added_head_nw) * sizeof (IRA_INT_TYPE); |
a49ae217 | 742 | if (OBJECT_CONFLICT_ARRAY_SIZE (obj1) >= size) |
058e97ec VM |
743 | { |
744 | memmove ((char *) vec + added_head_nw * sizeof (IRA_INT_TYPE), | |
745 | vec, nw * sizeof (IRA_INT_TYPE)); | |
746 | memset (vec, 0, added_head_nw * sizeof (IRA_INT_TYPE)); | |
747 | } | |
748 | else | |
749 | { | |
750 | size | |
751 | = (3 * (nw + added_head_nw) / 2 + 1) * sizeof (IRA_INT_TYPE); | |
752 | vec = (IRA_INT_TYPE *) ira_allocate (size); | |
753 | memcpy ((char *) vec + added_head_nw * sizeof (IRA_INT_TYPE), | |
a49ae217 | 754 | OBJECT_CONFLICT_ARRAY (obj1), nw * sizeof (IRA_INT_TYPE)); |
058e97ec VM |
755 | memset (vec, 0, added_head_nw * sizeof (IRA_INT_TYPE)); |
756 | memset ((char *) vec | |
757 | + (nw + added_head_nw) * sizeof (IRA_INT_TYPE), | |
758 | 0, size - (nw + added_head_nw) * sizeof (IRA_INT_TYPE)); | |
a49ae217 BS |
759 | ira_free (OBJECT_CONFLICT_ARRAY (obj1)); |
760 | OBJECT_CONFLICT_ARRAY (obj1) = vec; | |
761 | OBJECT_CONFLICT_ARRAY_SIZE (obj1) = size; | |
058e97ec | 762 | } |
a49ae217 | 763 | OBJECT_MIN (obj1) -= added_head_nw * IRA_INT_BITS; |
058e97ec | 764 | } |
a49ae217 | 765 | else if (OBJECT_MAX (obj1) < id) |
058e97ec | 766 | { |
a49ae217 | 767 | nw = (id - OBJECT_MIN (obj1)) / IRA_INT_BITS + 1; |
058e97ec | 768 | size = nw * sizeof (IRA_INT_TYPE); |
a49ae217 | 769 | if (OBJECT_CONFLICT_ARRAY_SIZE (obj1) < size) |
058e97ec VM |
770 | { |
771 | /* Expand tail of the bit vector. */ | |
772 | size = (3 * nw / 2 + 1) * sizeof (IRA_INT_TYPE); | |
773 | vec = (IRA_INT_TYPE *) ira_allocate (size); | |
a49ae217 BS |
774 | memcpy (vec, OBJECT_CONFLICT_ARRAY (obj1), OBJECT_CONFLICT_ARRAY_SIZE (obj1)); |
775 | memset ((char *) vec + OBJECT_CONFLICT_ARRAY_SIZE (obj1), | |
776 | 0, size - OBJECT_CONFLICT_ARRAY_SIZE (obj1)); | |
777 | ira_free (OBJECT_CONFLICT_ARRAY (obj1)); | |
778 | OBJECT_CONFLICT_ARRAY (obj1) = vec; | |
779 | OBJECT_CONFLICT_ARRAY_SIZE (obj1) = size; | |
058e97ec | 780 | } |
a49ae217 | 781 | OBJECT_MAX (obj1) = id; |
058e97ec | 782 | } |
a49ae217 | 783 | SET_MINMAX_SET_BIT (vec, id, OBJECT_MIN (obj1), OBJECT_MAX (obj1)); |
058e97ec VM |
784 | } |
785 | } | |
786 | ||
a49ae217 BS |
787 | /* Add OBJ1 to the conflicts of OBJ2 and vice versa. */ |
788 | static void | |
789 | ira_add_conflict (ira_object_t obj1, ira_object_t obj2) | |
058e97ec | 790 | { |
a49ae217 BS |
791 | add_to_conflicts (obj1, obj2); |
792 | add_to_conflicts (obj2, obj1); | |
058e97ec VM |
793 | } |
794 | ||
a49ae217 | 795 | /* Clear all conflicts of OBJ. */ |
058e97ec | 796 | static void |
a49ae217 | 797 | clear_conflicts (ira_object_t obj) |
058e97ec | 798 | { |
a49ae217 | 799 | if (OBJECT_CONFLICT_VEC_P (obj)) |
058e97ec | 800 | { |
a49ae217 BS |
801 | OBJECT_NUM_CONFLICTS (obj) = 0; |
802 | OBJECT_CONFLICT_VEC (obj)[0] = NULL; | |
058e97ec | 803 | } |
a49ae217 | 804 | else if (OBJECT_CONFLICT_ARRAY_SIZE (obj) != 0) |
058e97ec VM |
805 | { |
806 | int nw; | |
807 | ||
a49ae217 BS |
808 | nw = (OBJECT_MAX (obj) - OBJECT_MIN (obj)) / IRA_INT_BITS + 1; |
809 | memset (OBJECT_CONFLICT_BITVEC (obj), 0, nw * sizeof (IRA_INT_TYPE)); | |
058e97ec VM |
810 | } |
811 | } | |
812 | ||
813 | /* The array used to find duplications in conflict vectors of | |
814 | allocnos. */ | |
a49ae217 | 815 | static int *conflict_check; |
058e97ec VM |
816 | |
817 | /* The value used to mark allocation presence in conflict vector of | |
818 | the current allocno. */ | |
a49ae217 | 819 | static int curr_conflict_check_tick; |
058e97ec | 820 | |
a49ae217 | 821 | /* Remove duplications in conflict vector of OBJ. */ |
058e97ec | 822 | static void |
a49ae217 | 823 | compress_conflict_vec (ira_object_t obj) |
058e97ec | 824 | { |
a49ae217 | 825 | ira_object_t *vec, conflict_obj; |
058e97ec VM |
826 | int i, j; |
827 | ||
a49ae217 BS |
828 | ira_assert (OBJECT_CONFLICT_VEC_P (obj)); |
829 | vec = OBJECT_CONFLICT_VEC (obj); | |
830 | curr_conflict_check_tick++; | |
831 | for (i = j = 0; (conflict_obj = vec[i]) != NULL; i++) | |
058e97ec | 832 | { |
a49ae217 BS |
833 | int id = OBJECT_CONFLICT_ID (conflict_obj); |
834 | if (conflict_check[id] != curr_conflict_check_tick) | |
058e97ec | 835 | { |
a49ae217 BS |
836 | conflict_check[id] = curr_conflict_check_tick; |
837 | vec[j++] = conflict_obj; | |
058e97ec VM |
838 | } |
839 | } | |
a49ae217 | 840 | OBJECT_NUM_CONFLICTS (obj) = j; |
058e97ec VM |
841 | vec[j] = NULL; |
842 | } | |
843 | ||
844 | /* Remove duplications in conflict vectors of all allocnos. */ | |
845 | static void | |
846 | compress_conflict_vecs (void) | |
847 | { | |
ac0ab4f7 BS |
848 | ira_object_t obj; |
849 | ira_object_iterator oi; | |
058e97ec | 850 | |
a49ae217 BS |
851 | conflict_check = (int *) ira_allocate (sizeof (int) * ira_objects_num); |
852 | memset (conflict_check, 0, sizeof (int) * ira_objects_num); | |
853 | curr_conflict_check_tick = 0; | |
ac0ab4f7 | 854 | FOR_EACH_OBJECT (obj, oi) |
a49ae217 | 855 | { |
a49ae217 BS |
856 | if (OBJECT_CONFLICT_VEC_P (obj)) |
857 | compress_conflict_vec (obj); | |
858 | } | |
859 | ira_free (conflict_check); | |
058e97ec VM |
860 | } |
861 | ||
862 | /* This recursive function outputs allocno A and if it is a cap the | |
863 | function outputs its members. */ | |
864 | void | |
865 | ira_print_expanded_allocno (ira_allocno_t a) | |
866 | { | |
867 | basic_block bb; | |
868 | ||
869 | fprintf (ira_dump_file, " a%d(r%d", ALLOCNO_NUM (a), ALLOCNO_REGNO (a)); | |
870 | if ((bb = ALLOCNO_LOOP_TREE_NODE (a)->bb) != NULL) | |
871 | fprintf (ira_dump_file, ",b%d", bb->index); | |
872 | else | |
2608d841 | 873 | fprintf (ira_dump_file, ",l%d", ALLOCNO_LOOP_TREE_NODE (a)->loop_num); |
058e97ec VM |
874 | if (ALLOCNO_CAP_MEMBER (a) != NULL) |
875 | { | |
876 | fprintf (ira_dump_file, ":"); | |
877 | ira_print_expanded_allocno (ALLOCNO_CAP_MEMBER (a)); | |
878 | } | |
879 | fprintf (ira_dump_file, ")"); | |
880 | } | |
881 | ||
882 | /* Create and return the cap representing allocno A in the | |
883 | parent loop. */ | |
884 | static ira_allocno_t | |
885 | create_cap_allocno (ira_allocno_t a) | |
886 | { | |
887 | ira_allocno_t cap; | |
888 | ira_loop_tree_node_t parent; | |
1756cb66 | 889 | enum reg_class aclass; |
058e97ec | 890 | |
058e97ec VM |
891 | parent = ALLOCNO_LOOP_TREE_NODE (a)->parent; |
892 | cap = ira_create_allocno (ALLOCNO_REGNO (a), true, parent); | |
893 | ALLOCNO_MODE (cap) = ALLOCNO_MODE (a); | |
1756cb66 VM |
894 | aclass = ALLOCNO_CLASS (a); |
895 | ira_set_allocno_class (cap, aclass); | |
ac0ab4f7 | 896 | ira_create_allocno_objects (cap); |
058e97ec | 897 | ALLOCNO_CAP_MEMBER (cap) = a; |
058e97ec | 898 | ALLOCNO_CAP (a) = cap; |
1756cb66 | 899 | ALLOCNO_CLASS_COST (cap) = ALLOCNO_CLASS_COST (a); |
058e97ec | 900 | ALLOCNO_MEMORY_COST (cap) = ALLOCNO_MEMORY_COST (a); |
058e97ec | 901 | ira_allocate_and_copy_costs |
1756cb66 | 902 | (&ALLOCNO_HARD_REG_COSTS (cap), aclass, ALLOCNO_HARD_REG_COSTS (a)); |
058e97ec | 903 | ira_allocate_and_copy_costs |
1756cb66 | 904 | (&ALLOCNO_CONFLICT_HARD_REG_COSTS (cap), aclass, |
058e97ec | 905 | ALLOCNO_CONFLICT_HARD_REG_COSTS (a)); |
927425df | 906 | ALLOCNO_BAD_SPILL_P (cap) = ALLOCNO_BAD_SPILL_P (a); |
058e97ec VM |
907 | ALLOCNO_NREFS (cap) = ALLOCNO_NREFS (a); |
908 | ALLOCNO_FREQ (cap) = ALLOCNO_FREQ (a); | |
909 | ALLOCNO_CALL_FREQ (cap) = ALLOCNO_CALL_FREQ (a); | |
ac0ab4f7 | 910 | |
3c55880a | 911 | merge_hard_reg_conflicts (a, cap, false); |
ac0ab4f7 | 912 | |
058e97ec | 913 | ALLOCNO_CALLS_CROSSED_NUM (cap) = ALLOCNO_CALLS_CROSSED_NUM (a); |
e384e6b5 | 914 | ALLOCNO_CHEAP_CALLS_CROSSED_NUM (cap) = ALLOCNO_CHEAP_CALLS_CROSSED_NUM (a); |
058e97ec VM |
915 | if (internal_flag_ira_verbose > 2 && ira_dump_file != NULL) |
916 | { | |
917 | fprintf (ira_dump_file, " Creating cap "); | |
918 | ira_print_expanded_allocno (cap); | |
919 | fprintf (ira_dump_file, "\n"); | |
920 | } | |
921 | return cap; | |
922 | } | |
923 | ||
ac0ab4f7 | 924 | /* Create and return a live range for OBJECT with given attributes. */ |
b14151b5 | 925 | live_range_t |
9140d27b BS |
926 | ira_create_live_range (ira_object_t obj, int start, int finish, |
927 | live_range_t next) | |
058e97ec | 928 | { |
b14151b5 | 929 | live_range_t p; |
058e97ec | 930 | |
b14151b5 | 931 | p = (live_range_t) pool_alloc (live_range_pool); |
9140d27b | 932 | p->object = obj; |
058e97ec VM |
933 | p->start = start; |
934 | p->finish = finish; | |
935 | p->next = next; | |
936 | return p; | |
937 | } | |
938 | ||
ac0ab4f7 BS |
939 | /* Create a new live range for OBJECT and queue it at the head of its |
940 | live range list. */ | |
941 | void | |
942 | ira_add_live_range_to_object (ira_object_t object, int start, int finish) | |
943 | { | |
944 | live_range_t p; | |
945 | p = ira_create_live_range (object, start, finish, | |
946 | OBJECT_LIVE_RANGES (object)); | |
947 | OBJECT_LIVE_RANGES (object) = p; | |
948 | } | |
949 | ||
058e97ec | 950 | /* Copy allocno live range R and return the result. */ |
b14151b5 | 951 | static live_range_t |
9140d27b | 952 | copy_live_range (live_range_t r) |
058e97ec | 953 | { |
b14151b5 | 954 | live_range_t p; |
058e97ec | 955 | |
b14151b5 | 956 | p = (live_range_t) pool_alloc (live_range_pool); |
058e97ec VM |
957 | *p = *r; |
958 | return p; | |
959 | } | |
960 | ||
961 | /* Copy allocno live range list given by its head R and return the | |
962 | result. */ | |
b14151b5 | 963 | live_range_t |
9140d27b | 964 | ira_copy_live_range_list (live_range_t r) |
058e97ec | 965 | { |
b14151b5 | 966 | live_range_t p, first, last; |
058e97ec VM |
967 | |
968 | if (r == NULL) | |
969 | return NULL; | |
970 | for (first = last = NULL; r != NULL; r = r->next) | |
971 | { | |
9140d27b | 972 | p = copy_live_range (r); |
058e97ec VM |
973 | if (first == NULL) |
974 | first = p; | |
975 | else | |
976 | last->next = p; | |
977 | last = p; | |
978 | } | |
979 | return first; | |
980 | } | |
981 | ||
3553f0bb VM |
982 | /* Merge ranges R1 and R2 and returns the result. The function |
983 | maintains the order of ranges and tries to minimize number of the | |
984 | result ranges. */ | |
b14151b5 | 985 | live_range_t |
9140d27b | 986 | ira_merge_live_ranges (live_range_t r1, live_range_t r2) |
3553f0bb | 987 | { |
b14151b5 | 988 | live_range_t first, last, temp; |
3553f0bb VM |
989 | |
990 | if (r1 == NULL) | |
991 | return r2; | |
992 | if (r2 == NULL) | |
993 | return r1; | |
994 | for (first = last = NULL; r1 != NULL && r2 != NULL;) | |
995 | { | |
996 | if (r1->start < r2->start) | |
997 | { | |
998 | temp = r1; | |
999 | r1 = r2; | |
1000 | r2 = temp; | |
1001 | } | |
1002 | if (r1->start <= r2->finish + 1) | |
1003 | { | |
1004 | /* Intersected ranges: merge r1 and r2 into r1. */ | |
1005 | r1->start = r2->start; | |
1006 | if (r1->finish < r2->finish) | |
1007 | r1->finish = r2->finish; | |
1008 | temp = r2; | |
1009 | r2 = r2->next; | |
9140d27b | 1010 | ira_finish_live_range (temp); |
3553f0bb VM |
1011 | if (r2 == NULL) |
1012 | { | |
1013 | /* To try to merge with subsequent ranges in r1. */ | |
1014 | r2 = r1->next; | |
1015 | r1->next = NULL; | |
1016 | } | |
1017 | } | |
1018 | else | |
1019 | { | |
1020 | /* Add r1 to the result. */ | |
1021 | if (first == NULL) | |
1022 | first = last = r1; | |
1023 | else | |
1024 | { | |
1025 | last->next = r1; | |
1026 | last = r1; | |
1027 | } | |
1028 | r1 = r1->next; | |
1029 | if (r1 == NULL) | |
1030 | { | |
1031 | /* To try to merge with subsequent ranges in r2. */ | |
1032 | r1 = r2->next; | |
1033 | r2->next = NULL; | |
1034 | } | |
1035 | } | |
1036 | } | |
1037 | if (r1 != NULL) | |
1038 | { | |
1039 | if (first == NULL) | |
1040 | first = r1; | |
1041 | else | |
1042 | last->next = r1; | |
1043 | ira_assert (r1->next == NULL); | |
1044 | } | |
1045 | else if (r2 != NULL) | |
1046 | { | |
1047 | if (first == NULL) | |
1048 | first = r2; | |
1049 | else | |
1050 | last->next = r2; | |
1051 | ira_assert (r2->next == NULL); | |
1052 | } | |
1053 | else | |
1054 | { | |
1055 | ira_assert (last->next == NULL); | |
1056 | } | |
1057 | return first; | |
1058 | } | |
1059 | ||
1060 | /* Return TRUE if live ranges R1 and R2 intersect. */ | |
1061 | bool | |
9140d27b | 1062 | ira_live_ranges_intersect_p (live_range_t r1, live_range_t r2) |
3553f0bb VM |
1063 | { |
1064 | /* Remember the live ranges are always kept ordered. */ | |
1065 | while (r1 != NULL && r2 != NULL) | |
1066 | { | |
1067 | if (r1->start > r2->finish) | |
1068 | r1 = r1->next; | |
1069 | else if (r2->start > r1->finish) | |
1070 | r2 = r2->next; | |
1071 | else | |
1072 | return true; | |
1073 | } | |
1074 | return false; | |
1075 | } | |
1076 | ||
058e97ec VM |
1077 | /* Free allocno live range R. */ |
1078 | void | |
9140d27b | 1079 | ira_finish_live_range (live_range_t r) |
058e97ec | 1080 | { |
b14151b5 | 1081 | pool_free (live_range_pool, r); |
058e97ec VM |
1082 | } |
1083 | ||
3553f0bb VM |
1084 | /* Free list of allocno live ranges starting with R. */ |
1085 | void | |
9140d27b | 1086 | ira_finish_live_range_list (live_range_t r) |
3553f0bb | 1087 | { |
b14151b5 | 1088 | live_range_t next_r; |
3553f0bb VM |
1089 | |
1090 | for (; r != NULL; r = next_r) | |
1091 | { | |
1092 | next_r = r->next; | |
9140d27b | 1093 | ira_finish_live_range (r); |
3553f0bb VM |
1094 | } |
1095 | } | |
1096 | ||
058e97ec VM |
1097 | /* Free updated register costs of allocno A. */ |
1098 | void | |
1099 | ira_free_allocno_updated_costs (ira_allocno_t a) | |
1100 | { | |
1756cb66 | 1101 | enum reg_class aclass; |
058e97ec | 1102 | |
1756cb66 | 1103 | aclass = ALLOCNO_CLASS (a); |
058e97ec | 1104 | if (ALLOCNO_UPDATED_HARD_REG_COSTS (a) != NULL) |
1756cb66 | 1105 | ira_free_cost_vector (ALLOCNO_UPDATED_HARD_REG_COSTS (a), aclass); |
058e97ec VM |
1106 | ALLOCNO_UPDATED_HARD_REG_COSTS (a) = NULL; |
1107 | if (ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS (a) != NULL) | |
1108 | ira_free_cost_vector (ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS (a), | |
1756cb66 | 1109 | aclass); |
058e97ec VM |
1110 | ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS (a) = NULL; |
1111 | } | |
1112 | ||
1756cb66 VM |
1113 | /* Free and nullify all cost vectors allocated earlier for allocno |
1114 | A. */ | |
058e97ec | 1115 | static void |
1756cb66 | 1116 | ira_free_allocno_costs (ira_allocno_t a) |
058e97ec | 1117 | { |
1756cb66 | 1118 | enum reg_class aclass = ALLOCNO_CLASS (a); |
ac0ab4f7 BS |
1119 | ira_object_t obj; |
1120 | ira_allocno_object_iterator oi; | |
058e97ec | 1121 | |
ac0ab4f7 BS |
1122 | FOR_EACH_ALLOCNO_OBJECT (a, obj, oi) |
1123 | { | |
1124 | ira_finish_live_range_list (OBJECT_LIVE_RANGES (obj)); | |
1125 | ira_object_id_map[OBJECT_CONFLICT_ID (obj)] = NULL; | |
1126 | if (OBJECT_CONFLICT_ARRAY (obj) != NULL) | |
1127 | ira_free (OBJECT_CONFLICT_ARRAY (obj)); | |
1128 | pool_free (object_pool, obj); | |
1129 | } | |
9140d27b | 1130 | |
058e97ec | 1131 | ira_allocnos[ALLOCNO_NUM (a)] = NULL; |
058e97ec | 1132 | if (ALLOCNO_HARD_REG_COSTS (a) != NULL) |
1756cb66 | 1133 | ira_free_cost_vector (ALLOCNO_HARD_REG_COSTS (a), aclass); |
058e97ec | 1134 | if (ALLOCNO_CONFLICT_HARD_REG_COSTS (a) != NULL) |
1756cb66 | 1135 | ira_free_cost_vector (ALLOCNO_CONFLICT_HARD_REG_COSTS (a), aclass); |
058e97ec | 1136 | if (ALLOCNO_UPDATED_HARD_REG_COSTS (a) != NULL) |
1756cb66 | 1137 | ira_free_cost_vector (ALLOCNO_UPDATED_HARD_REG_COSTS (a), aclass); |
058e97ec VM |
1138 | if (ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS (a) != NULL) |
1139 | ira_free_cost_vector (ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS (a), | |
1756cb66 VM |
1140 | aclass); |
1141 | ALLOCNO_HARD_REG_COSTS (a) = NULL; | |
1142 | ALLOCNO_CONFLICT_HARD_REG_COSTS (a) = NULL; | |
1143 | ALLOCNO_UPDATED_HARD_REG_COSTS (a) = NULL; | |
1144 | ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS (a) = NULL; | |
1145 | } | |
1146 | ||
1147 | /* Free the memory allocated for allocno A. */ | |
1148 | static void | |
1149 | finish_allocno (ira_allocno_t a) | |
1150 | { | |
1151 | ira_free_allocno_costs (a); | |
058e97ec VM |
1152 | pool_free (allocno_pool, a); |
1153 | } | |
1154 | ||
1155 | /* Free the memory allocated for all allocnos. */ | |
1156 | static void | |
1157 | finish_allocnos (void) | |
1158 | { | |
1159 | ira_allocno_t a; | |
1160 | ira_allocno_iterator ai; | |
1161 | ||
1162 | FOR_EACH_ALLOCNO (a, ai) | |
1163 | finish_allocno (a); | |
1164 | ira_free (ira_regno_allocno_map); | |
9771b263 DN |
1165 | ira_object_id_map_vec.release (); |
1166 | allocno_vec.release (); | |
058e97ec | 1167 | free_alloc_pool (allocno_pool); |
a49ae217 | 1168 | free_alloc_pool (object_pool); |
b14151b5 | 1169 | free_alloc_pool (live_range_pool); |
058e97ec VM |
1170 | } |
1171 | ||
1172 | \f | |
1173 | ||
3b6d1699 VM |
1174 | /* Pools for allocno preferences. */ |
1175 | static alloc_pool pref_pool; | |
1176 | ||
1177 | /* Vec containing references to all created preferences. It is a | |
1178 | container of array ira_prefs. */ | |
1179 | static vec<ira_pref_t> pref_vec; | |
1180 | ||
1181 | /* The function initializes data concerning allocno prefs. */ | |
1182 | static void | |
1183 | initiate_prefs (void) | |
1184 | { | |
1185 | pref_pool | |
1186 | = create_alloc_pool ("prefs", sizeof (struct ira_allocno_pref), 100); | |
1187 | pref_vec.create (get_max_uid ()); | |
1188 | ira_prefs = NULL; | |
1189 | ira_prefs_num = 0; | |
1190 | } | |
1191 | ||
1192 | /* Return pref for A and HARD_REGNO if any. */ | |
1193 | static ira_pref_t | |
1194 | find_allocno_pref (ira_allocno_t a, int hard_regno) | |
1195 | { | |
1196 | ira_pref_t pref; | |
1197 | ||
1198 | for (pref = ALLOCNO_PREFS (a); pref != NULL; pref = pref->next_pref) | |
1199 | if (pref->allocno == a && pref->hard_regno == hard_regno) | |
1200 | return pref; | |
1201 | return NULL; | |
1202 | } | |
1203 | ||
1204 | /* Create and return pref with given attributes A, HARD_REGNO, and FREQ. */ | |
1205 | ira_pref_t | |
1206 | ira_create_pref (ira_allocno_t a, int hard_regno, int freq) | |
1207 | { | |
1208 | ira_pref_t pref; | |
1209 | ||
1210 | pref = (ira_pref_t) pool_alloc (pref_pool); | |
1211 | pref->num = ira_prefs_num; | |
1212 | pref->allocno = a; | |
1213 | pref->hard_regno = hard_regno; | |
1214 | pref->freq = freq; | |
1215 | pref_vec.safe_push (pref); | |
1216 | ira_prefs = pref_vec.address (); | |
1217 | ira_prefs_num = pref_vec.length (); | |
1218 | return pref; | |
1219 | } | |
1220 | ||
1221 | /* Attach a pref PREF to the cooresponding allocno. */ | |
1222 | static void | |
1223 | add_allocno_pref_to_list (ira_pref_t pref) | |
1224 | { | |
1225 | ira_allocno_t a = pref->allocno; | |
1226 | ||
1227 | pref->next_pref = ALLOCNO_PREFS (a); | |
1228 | ALLOCNO_PREFS (a) = pref; | |
1229 | } | |
1230 | ||
1231 | /* Create (or update frequency if the pref already exists) the pref of | |
1232 | allocnos A preferring HARD_REGNO with frequency FREQ. */ | |
1233 | void | |
1234 | ira_add_allocno_pref (ira_allocno_t a, int hard_regno, int freq) | |
1235 | { | |
1236 | ira_pref_t pref; | |
1237 | ||
1238 | if (freq <= 0) | |
1239 | return; | |
1240 | if ((pref = find_allocno_pref (a, hard_regno)) != NULL) | |
1241 | { | |
1242 | pref->freq += freq; | |
1243 | return; | |
1244 | } | |
1245 | pref = ira_create_pref (a, hard_regno, freq); | |
1246 | ira_assert (a != NULL); | |
1247 | add_allocno_pref_to_list (pref); | |
1248 | } | |
1249 | ||
1250 | /* Print info about PREF into file F. */ | |
1251 | static void | |
1252 | print_pref (FILE *f, ira_pref_t pref) | |
1253 | { | |
1254 | fprintf (f, " pref%d:a%d(r%d)<-hr%d@%d\n", pref->num, | |
1255 | ALLOCNO_NUM (pref->allocno), ALLOCNO_REGNO (pref->allocno), | |
1256 | pref->hard_regno, pref->freq); | |
1257 | } | |
1258 | ||
1259 | /* Print info about PREF into stderr. */ | |
1260 | void | |
1261 | ira_debug_pref (ira_pref_t pref) | |
1262 | { | |
1263 | print_pref (stderr, pref); | |
1264 | } | |
1265 | ||
1266 | /* Print info about all prefs into file F. */ | |
1267 | static void | |
1268 | print_prefs (FILE *f) | |
1269 | { | |
1270 | ira_pref_t pref; | |
1271 | ira_pref_iterator pi; | |
1272 | ||
1273 | FOR_EACH_PREF (pref, pi) | |
1274 | print_pref (f, pref); | |
1275 | } | |
1276 | ||
1277 | /* Print info about all prefs into stderr. */ | |
1278 | void | |
1279 | ira_debug_prefs (void) | |
1280 | { | |
1281 | print_prefs (stderr); | |
1282 | } | |
1283 | ||
1284 | /* Print info about prefs involving allocno A into file F. */ | |
1285 | static void | |
1286 | print_allocno_prefs (FILE *f, ira_allocno_t a) | |
1287 | { | |
1288 | ira_pref_t pref; | |
1289 | ||
1290 | fprintf (f, " a%d(r%d):", ALLOCNO_NUM (a), ALLOCNO_REGNO (a)); | |
1291 | for (pref = ALLOCNO_PREFS (a); pref != NULL; pref = pref->next_pref) | |
1292 | fprintf (f, " pref%d:hr%d@%d", pref->num, pref->hard_regno, pref->freq); | |
1293 | fprintf (f, "\n"); | |
1294 | } | |
1295 | ||
1296 | /* Print info about prefs involving allocno A into stderr. */ | |
1297 | void | |
1298 | ira_debug_allocno_prefs (ira_allocno_t a) | |
1299 | { | |
1300 | print_allocno_prefs (stderr, a); | |
1301 | } | |
1302 | ||
1303 | /* The function frees memory allocated for PREF. */ | |
1304 | static void | |
1305 | finish_pref (ira_pref_t pref) | |
1306 | { | |
1307 | ira_prefs[pref->num] = NULL; | |
1308 | pool_free (pref_pool, pref); | |
1309 | } | |
1310 | ||
1311 | /* Remove PREF from the list of allocno prefs and free memory for | |
1312 | it. */ | |
1313 | void | |
1314 | ira_remove_pref (ira_pref_t pref) | |
1315 | { | |
1316 | ira_pref_t cpref, prev; | |
1317 | ||
1318 | if (internal_flag_ira_verbose > 1 && ira_dump_file != NULL) | |
1319 | fprintf (ira_dump_file, " Removing pref%d:hr%d@%d\n", | |
1320 | pref->num, pref->hard_regno, pref->freq); | |
1321 | for (prev = NULL, cpref = ALLOCNO_PREFS (pref->allocno); | |
1322 | cpref != NULL; | |
1323 | prev = cpref, cpref = cpref->next_pref) | |
1324 | if (cpref == pref) | |
1325 | break; | |
1326 | ira_assert (cpref != NULL); | |
1327 | if (prev == NULL) | |
1328 | ALLOCNO_PREFS (pref->allocno) = pref->next_pref; | |
1329 | else | |
1330 | prev->next_pref = pref->next_pref; | |
1331 | finish_pref (pref); | |
1332 | } | |
1333 | ||
1334 | /* Remove all prefs of allocno A. */ | |
1335 | void | |
1336 | ira_remove_allocno_prefs (ira_allocno_t a) | |
1337 | { | |
1338 | ira_pref_t pref, next_pref; | |
1339 | ||
1340 | for (pref = ALLOCNO_PREFS (a); pref != NULL; pref = next_pref) | |
1341 | { | |
1342 | next_pref = pref->next_pref; | |
1343 | finish_pref (pref); | |
1344 | } | |
1345 | ALLOCNO_PREFS (a) = NULL; | |
1346 | } | |
1347 | ||
1348 | /* Free memory allocated for all prefs. */ | |
1349 | static void | |
1350 | finish_prefs (void) | |
1351 | { | |
1352 | ira_pref_t pref; | |
1353 | ira_pref_iterator pi; | |
1354 | ||
1355 | FOR_EACH_PREF (pref, pi) | |
1356 | finish_pref (pref); | |
1357 | pref_vec.release (); | |
1358 | free_alloc_pool (pref_pool); | |
1359 | } | |
1360 | ||
1361 | \f | |
1362 | ||
058e97ec VM |
1363 | /* Pools for copies. */ |
1364 | static alloc_pool copy_pool; | |
1365 | ||
1366 | /* Vec containing references to all created copies. It is a | |
1367 | container of array ira_copies. */ | |
9771b263 | 1368 | static vec<ira_copy_t> copy_vec; |
058e97ec VM |
1369 | |
1370 | /* The function initializes data concerning allocno copies. */ | |
1371 | static void | |
1372 | initiate_copies (void) | |
1373 | { | |
1374 | copy_pool | |
1375 | = create_alloc_pool ("copies", sizeof (struct ira_allocno_copy), 100); | |
9771b263 | 1376 | copy_vec.create (get_max_uid ()); |
058e97ec VM |
1377 | ira_copies = NULL; |
1378 | ira_copies_num = 0; | |
1379 | } | |
1380 | ||
1381 | /* Return copy connecting A1 and A2 and originated from INSN of | |
1382 | LOOP_TREE_NODE if any. */ | |
1383 | static ira_copy_t | |
1384 | find_allocno_copy (ira_allocno_t a1, ira_allocno_t a2, rtx insn, | |
1385 | ira_loop_tree_node_t loop_tree_node) | |
1386 | { | |
1387 | ira_copy_t cp, next_cp; | |
1388 | ira_allocno_t another_a; | |
1389 | ||
1390 | for (cp = ALLOCNO_COPIES (a1); cp != NULL; cp = next_cp) | |
1391 | { | |
1392 | if (cp->first == a1) | |
1393 | { | |
1394 | next_cp = cp->next_first_allocno_copy; | |
1395 | another_a = cp->second; | |
1396 | } | |
1397 | else if (cp->second == a1) | |
1398 | { | |
1399 | next_cp = cp->next_second_allocno_copy; | |
1400 | another_a = cp->first; | |
1401 | } | |
1402 | else | |
1403 | gcc_unreachable (); | |
1404 | if (another_a == a2 && cp->insn == insn | |
1405 | && cp->loop_tree_node == loop_tree_node) | |
1406 | return cp; | |
1407 | } | |
1408 | return NULL; | |
1409 | } | |
1410 | ||
1411 | /* Create and return copy with given attributes LOOP_TREE_NODE, FIRST, | |
548a6322 | 1412 | SECOND, FREQ, CONSTRAINT_P, and INSN. */ |
058e97ec | 1413 | ira_copy_t |
548a6322 VM |
1414 | ira_create_copy (ira_allocno_t first, ira_allocno_t second, int freq, |
1415 | bool constraint_p, rtx insn, | |
058e97ec VM |
1416 | ira_loop_tree_node_t loop_tree_node) |
1417 | { | |
1418 | ira_copy_t cp; | |
1419 | ||
1420 | cp = (ira_copy_t) pool_alloc (copy_pool); | |
1421 | cp->num = ira_copies_num; | |
1422 | cp->first = first; | |
1423 | cp->second = second; | |
1424 | cp->freq = freq; | |
548a6322 | 1425 | cp->constraint_p = constraint_p; |
058e97ec VM |
1426 | cp->insn = insn; |
1427 | cp->loop_tree_node = loop_tree_node; | |
9771b263 DN |
1428 | copy_vec.safe_push (cp); |
1429 | ira_copies = copy_vec.address (); | |
1430 | ira_copies_num = copy_vec.length (); | |
058e97ec VM |
1431 | return cp; |
1432 | } | |
1433 | ||
1434 | /* Attach a copy CP to allocnos involved into the copy. */ | |
3b6d1699 VM |
1435 | static void |
1436 | add_allocno_copy_to_list (ira_copy_t cp) | |
058e97ec VM |
1437 | { |
1438 | ira_allocno_t first = cp->first, second = cp->second; | |
1439 | ||
1440 | cp->prev_first_allocno_copy = NULL; | |
1441 | cp->prev_second_allocno_copy = NULL; | |
1442 | cp->next_first_allocno_copy = ALLOCNO_COPIES (first); | |
1443 | if (cp->next_first_allocno_copy != NULL) | |
1444 | { | |
1445 | if (cp->next_first_allocno_copy->first == first) | |
1446 | cp->next_first_allocno_copy->prev_first_allocno_copy = cp; | |
1447 | else | |
1448 | cp->next_first_allocno_copy->prev_second_allocno_copy = cp; | |
1449 | } | |
1450 | cp->next_second_allocno_copy = ALLOCNO_COPIES (second); | |
1451 | if (cp->next_second_allocno_copy != NULL) | |
1452 | { | |
1453 | if (cp->next_second_allocno_copy->second == second) | |
1454 | cp->next_second_allocno_copy->prev_second_allocno_copy = cp; | |
1455 | else | |
1456 | cp->next_second_allocno_copy->prev_first_allocno_copy = cp; | |
1457 | } | |
1458 | ALLOCNO_COPIES (first) = cp; | |
1459 | ALLOCNO_COPIES (second) = cp; | |
1460 | } | |
1461 | ||
058e97ec VM |
1462 | /* Make a copy CP a canonical copy where number of the |
1463 | first allocno is less than the second one. */ | |
3b6d1699 VM |
1464 | static void |
1465 | swap_allocno_copy_ends_if_necessary (ira_copy_t cp) | |
058e97ec VM |
1466 | { |
1467 | ira_allocno_t temp; | |
1468 | ira_copy_t temp_cp; | |
1469 | ||
1470 | if (ALLOCNO_NUM (cp->first) <= ALLOCNO_NUM (cp->second)) | |
1471 | return; | |
1472 | ||
1473 | temp = cp->first; | |
1474 | cp->first = cp->second; | |
1475 | cp->second = temp; | |
1476 | ||
1477 | temp_cp = cp->prev_first_allocno_copy; | |
1478 | cp->prev_first_allocno_copy = cp->prev_second_allocno_copy; | |
1479 | cp->prev_second_allocno_copy = temp_cp; | |
1480 | ||
1481 | temp_cp = cp->next_first_allocno_copy; | |
1482 | cp->next_first_allocno_copy = cp->next_second_allocno_copy; | |
1483 | cp->next_second_allocno_copy = temp_cp; | |
1484 | } | |
1485 | ||
1486 | /* Create (or update frequency if the copy already exists) and return | |
1487 | the copy of allocnos FIRST and SECOND with frequency FREQ | |
1488 | corresponding to move insn INSN (if any) and originated from | |
1489 | LOOP_TREE_NODE. */ | |
1490 | ira_copy_t | |
1491 | ira_add_allocno_copy (ira_allocno_t first, ira_allocno_t second, int freq, | |
548a6322 VM |
1492 | bool constraint_p, rtx insn, |
1493 | ira_loop_tree_node_t loop_tree_node) | |
058e97ec VM |
1494 | { |
1495 | ira_copy_t cp; | |
1496 | ||
1497 | if ((cp = find_allocno_copy (first, second, insn, loop_tree_node)) != NULL) | |
1498 | { | |
1499 | cp->freq += freq; | |
1500 | return cp; | |
1501 | } | |
548a6322 VM |
1502 | cp = ira_create_copy (first, second, freq, constraint_p, insn, |
1503 | loop_tree_node); | |
058e97ec | 1504 | ira_assert (first != NULL && second != NULL); |
3b6d1699 VM |
1505 | add_allocno_copy_to_list (cp); |
1506 | swap_allocno_copy_ends_if_necessary (cp); | |
058e97ec VM |
1507 | return cp; |
1508 | } | |
1509 | ||
4cda38d5 VM |
1510 | /* Print info about copy CP into file F. */ |
1511 | static void | |
1512 | print_copy (FILE *f, ira_copy_t cp) | |
1513 | { | |
548a6322 | 1514 | fprintf (f, " cp%d:a%d(r%d)<->a%d(r%d)@%d:%s\n", cp->num, |
4cda38d5 | 1515 | ALLOCNO_NUM (cp->first), ALLOCNO_REGNO (cp->first), |
548a6322 VM |
1516 | ALLOCNO_NUM (cp->second), ALLOCNO_REGNO (cp->second), cp->freq, |
1517 | cp->insn != NULL | |
1518 | ? "move" : cp->constraint_p ? "constraint" : "shuffle"); | |
4cda38d5 VM |
1519 | } |
1520 | ||
7b3b6ae4 LC |
1521 | DEBUG_FUNCTION void |
1522 | debug (ira_allocno_copy &ref) | |
1523 | { | |
1524 | print_copy (stderr, &ref); | |
1525 | } | |
1526 | ||
1527 | DEBUG_FUNCTION void | |
1528 | debug (ira_allocno_copy *ptr) | |
1529 | { | |
1530 | if (ptr) | |
1531 | debug (*ptr); | |
1532 | else | |
1533 | fprintf (stderr, "<nil>\n"); | |
1534 | } | |
1535 | ||
4cda38d5 VM |
1536 | /* Print info about copy CP into stderr. */ |
1537 | void | |
1538 | ira_debug_copy (ira_copy_t cp) | |
1539 | { | |
1540 | print_copy (stderr, cp); | |
1541 | } | |
1542 | ||
1543 | /* Print info about all copies into file F. */ | |
1544 | static void | |
1545 | print_copies (FILE *f) | |
1546 | { | |
1547 | ira_copy_t cp; | |
1548 | ira_copy_iterator ci; | |
1549 | ||
1550 | FOR_EACH_COPY (cp, ci) | |
1551 | print_copy (f, cp); | |
1552 | } | |
1553 | ||
1554 | /* Print info about all copies into stderr. */ | |
1555 | void | |
1556 | ira_debug_copies (void) | |
1557 | { | |
1558 | print_copies (stderr); | |
1559 | } | |
1560 | ||
058e97ec VM |
1561 | /* Print info about copies involving allocno A into file F. */ |
1562 | static void | |
1563 | print_allocno_copies (FILE *f, ira_allocno_t a) | |
1564 | { | |
1565 | ira_allocno_t another_a; | |
1566 | ira_copy_t cp, next_cp; | |
1567 | ||
1568 | fprintf (f, " a%d(r%d):", ALLOCNO_NUM (a), ALLOCNO_REGNO (a)); | |
1569 | for (cp = ALLOCNO_COPIES (a); cp != NULL; cp = next_cp) | |
1570 | { | |
1571 | if (cp->first == a) | |
1572 | { | |
1573 | next_cp = cp->next_first_allocno_copy; | |
1574 | another_a = cp->second; | |
1575 | } | |
1576 | else if (cp->second == a) | |
1577 | { | |
1578 | next_cp = cp->next_second_allocno_copy; | |
1579 | another_a = cp->first; | |
1580 | } | |
1581 | else | |
1582 | gcc_unreachable (); | |
1583 | fprintf (f, " cp%d:a%d(r%d)@%d", cp->num, | |
1584 | ALLOCNO_NUM (another_a), ALLOCNO_REGNO (another_a), cp->freq); | |
1585 | } | |
1586 | fprintf (f, "\n"); | |
1587 | } | |
1588 | ||
7b3b6ae4 LC |
1589 | DEBUG_FUNCTION void |
1590 | debug (ira_allocno &ref) | |
1591 | { | |
1592 | print_allocno_copies (stderr, &ref); | |
1593 | } | |
1594 | ||
1595 | DEBUG_FUNCTION void | |
1596 | debug (ira_allocno *ptr) | |
1597 | { | |
1598 | if (ptr) | |
1599 | debug (*ptr); | |
1600 | else | |
1601 | fprintf (stderr, "<nil>\n"); | |
1602 | } | |
1603 | ||
1604 | ||
058e97ec VM |
1605 | /* Print info about copies involving allocno A into stderr. */ |
1606 | void | |
1607 | ira_debug_allocno_copies (ira_allocno_t a) | |
1608 | { | |
1609 | print_allocno_copies (stderr, a); | |
1610 | } | |
1611 | ||
1612 | /* The function frees memory allocated for copy CP. */ | |
1613 | static void | |
1614 | finish_copy (ira_copy_t cp) | |
1615 | { | |
1616 | pool_free (copy_pool, cp); | |
1617 | } | |
1618 | ||
1619 | ||
1620 | /* Free memory allocated for all copies. */ | |
1621 | static void | |
1622 | finish_copies (void) | |
1623 | { | |
1624 | ira_copy_t cp; | |
1625 | ira_copy_iterator ci; | |
1626 | ||
1627 | FOR_EACH_COPY (cp, ci) | |
1628 | finish_copy (cp); | |
9771b263 | 1629 | copy_vec.release (); |
058e97ec VM |
1630 | free_alloc_pool (copy_pool); |
1631 | } | |
1632 | ||
1633 | \f | |
1634 | ||
1756cb66 | 1635 | /* Pools for cost vectors. It is defined only for allocno classes. */ |
058e97ec VM |
1636 | static alloc_pool cost_vector_pool[N_REG_CLASSES]; |
1637 | ||
1638 | /* The function initiates work with hard register cost vectors. It | |
1756cb66 | 1639 | creates allocation pool for each allocno class. */ |
058e97ec VM |
1640 | static void |
1641 | initiate_cost_vectors (void) | |
1642 | { | |
1643 | int i; | |
1756cb66 | 1644 | enum reg_class aclass; |
058e97ec | 1645 | |
1756cb66 | 1646 | for (i = 0; i < ira_allocno_classes_num; i++) |
058e97ec | 1647 | { |
1756cb66 VM |
1648 | aclass = ira_allocno_classes[i]; |
1649 | cost_vector_pool[aclass] | |
058e97ec | 1650 | = create_alloc_pool ("cost vectors", |
1756cb66 | 1651 | sizeof (int) * ira_class_hard_regs_num[aclass], |
058e97ec VM |
1652 | 100); |
1653 | } | |
1654 | } | |
1655 | ||
1756cb66 | 1656 | /* Allocate and return a cost vector VEC for ACLASS. */ |
058e97ec | 1657 | int * |
6f76a878 | 1658 | ira_allocate_cost_vector (reg_class_t aclass) |
058e97ec | 1659 | { |
6f76a878 | 1660 | return (int *) pool_alloc (cost_vector_pool[(int) aclass]); |
058e97ec VM |
1661 | } |
1662 | ||
1756cb66 | 1663 | /* Free a cost vector VEC for ACLASS. */ |
058e97ec | 1664 | void |
6f76a878 | 1665 | ira_free_cost_vector (int *vec, reg_class_t aclass) |
058e97ec VM |
1666 | { |
1667 | ira_assert (vec != NULL); | |
6f76a878 | 1668 | pool_free (cost_vector_pool[(int) aclass], vec); |
058e97ec VM |
1669 | } |
1670 | ||
1671 | /* Finish work with hard register cost vectors. Release allocation | |
1756cb66 | 1672 | pool for each allocno class. */ |
058e97ec VM |
1673 | static void |
1674 | finish_cost_vectors (void) | |
1675 | { | |
1676 | int i; | |
1756cb66 | 1677 | enum reg_class aclass; |
058e97ec | 1678 | |
1756cb66 | 1679 | for (i = 0; i < ira_allocno_classes_num; i++) |
058e97ec | 1680 | { |
1756cb66 VM |
1681 | aclass = ira_allocno_classes[i]; |
1682 | free_alloc_pool (cost_vector_pool[aclass]); | |
058e97ec VM |
1683 | } |
1684 | } | |
1685 | ||
1686 | \f | |
1687 | ||
e6a7da82 SB |
1688 | /* Compute a post-ordering of the reverse control flow of the loop body |
1689 | designated by the children nodes of LOOP_NODE, whose body nodes in | |
1690 | pre-order are input as LOOP_PREORDER. Return a VEC with a post-order | |
1691 | of the reverse loop body. | |
1692 | ||
1693 | For the post-order of the reverse CFG, we visit the basic blocks in | |
1694 | LOOP_PREORDER array in the reverse order of where they appear. | |
1695 | This is important: We do not just want to compute a post-order of | |
1696 | the reverse CFG, we want to make a best-guess for a visiting order that | |
1697 | minimizes the number of chain elements per allocno live range. If the | |
1698 | blocks would be visited in a different order, we would still compute a | |
1699 | correct post-ordering but it would be less likely that two nodes | |
1700 | connected by an edge in the CFG are neighbours in the topsort. */ | |
1701 | ||
9771b263 | 1702 | static vec<ira_loop_tree_node_t> |
e6a7da82 | 1703 | ira_loop_tree_body_rev_postorder (ira_loop_tree_node_t loop_node ATTRIBUTE_UNUSED, |
9771b263 | 1704 | vec<ira_loop_tree_node_t> loop_preorder) |
e6a7da82 | 1705 | { |
6e1aa848 | 1706 | vec<ira_loop_tree_node_t> topsort_nodes = vNULL; |
e6a7da82 SB |
1707 | unsigned int n_loop_preorder; |
1708 | ||
9771b263 | 1709 | n_loop_preorder = loop_preorder.length (); |
e6a7da82 SB |
1710 | if (n_loop_preorder != 0) |
1711 | { | |
1712 | ira_loop_tree_node_t subloop_node; | |
1713 | unsigned int i; | |
9771b263 | 1714 | vec<ira_loop_tree_node_t> dfs_stack; |
e6a7da82 SB |
1715 | |
1716 | /* This is a bit of strange abuse of the BB_VISITED flag: We use | |
1717 | the flag to mark blocks we still have to visit to add them to | |
1718 | our post-order. Define an alias to avoid confusion. */ | |
1719 | #define BB_TO_VISIT BB_VISITED | |
1720 | ||
9771b263 | 1721 | FOR_EACH_VEC_ELT (loop_preorder, i, subloop_node) |
e6a7da82 SB |
1722 | { |
1723 | gcc_checking_assert (! (subloop_node->bb->flags & BB_TO_VISIT)); | |
1724 | subloop_node->bb->flags |= BB_TO_VISIT; | |
1725 | } | |
1726 | ||
9771b263 DN |
1727 | topsort_nodes.create (n_loop_preorder); |
1728 | dfs_stack.create (n_loop_preorder); | |
e6a7da82 | 1729 | |
9771b263 | 1730 | FOR_EACH_VEC_ELT_REVERSE (loop_preorder, i, subloop_node) |
e6a7da82 SB |
1731 | { |
1732 | if (! (subloop_node->bb->flags & BB_TO_VISIT)) | |
1733 | continue; | |
1734 | ||
1735 | subloop_node->bb->flags &= ~BB_TO_VISIT; | |
9771b263 DN |
1736 | dfs_stack.quick_push (subloop_node); |
1737 | while (! dfs_stack.is_empty ()) | |
e6a7da82 SB |
1738 | { |
1739 | edge e; | |
1740 | edge_iterator ei; | |
1741 | ||
9771b263 | 1742 | ira_loop_tree_node_t n = dfs_stack.last (); |
e6a7da82 SB |
1743 | FOR_EACH_EDGE (e, ei, n->bb->preds) |
1744 | { | |
1745 | ira_loop_tree_node_t pred_node; | |
1746 | basic_block pred_bb = e->src; | |
1747 | ||
1748 | if (e->src == ENTRY_BLOCK_PTR) | |
1749 | continue; | |
1750 | ||
1751 | pred_node = IRA_BB_NODE_BY_INDEX (pred_bb->index); | |
1752 | if (pred_node != n | |
1753 | && (pred_node->bb->flags & BB_TO_VISIT)) | |
1754 | { | |
1755 | pred_node->bb->flags &= ~BB_TO_VISIT; | |
9771b263 | 1756 | dfs_stack.quick_push (pred_node); |
e6a7da82 SB |
1757 | } |
1758 | } | |
9771b263 | 1759 | if (n == dfs_stack.last ()) |
e6a7da82 | 1760 | { |
9771b263 DN |
1761 | dfs_stack.pop (); |
1762 | topsort_nodes.quick_push (n); | |
e6a7da82 SB |
1763 | } |
1764 | } | |
1765 | } | |
1766 | ||
1767 | #undef BB_TO_VISIT | |
9771b263 | 1768 | dfs_stack.release (); |
e6a7da82 SB |
1769 | } |
1770 | ||
9771b263 | 1771 | gcc_assert (topsort_nodes.length () == n_loop_preorder); |
e6a7da82 SB |
1772 | return topsort_nodes; |
1773 | } | |
1774 | ||
058e97ec VM |
1775 | /* The current loop tree node and its regno allocno map. */ |
1776 | ira_loop_tree_node_t ira_curr_loop_tree_node; | |
1777 | ira_allocno_t *ira_curr_regno_allocno_map; | |
1778 | ||
1779 | /* This recursive function traverses loop tree with root LOOP_NODE | |
1780 | calling non-null functions PREORDER_FUNC and POSTORDER_FUNC | |
1781 | correspondingly in preorder and postorder. The function sets up | |
1782 | IRA_CURR_LOOP_TREE_NODE and IRA_CURR_REGNO_ALLOCNO_MAP. If BB_P, | |
1783 | basic block nodes of LOOP_NODE is also processed (before its | |
e6a7da82 SB |
1784 | subloop nodes). |
1785 | ||
1786 | If BB_P is set and POSTORDER_FUNC is given, the basic blocks in | |
1787 | the loop are passed in the *reverse* post-order of the *reverse* | |
1788 | CFG. This is only used by ira_create_allocno_live_ranges, which | |
1789 | wants to visit basic blocks in this order to minimize the number | |
1790 | of elements per live range chain. | |
1791 | Note that the loop tree nodes are still visited in the normal, | |
1792 | forward post-order of the loop tree. */ | |
1793 | ||
058e97ec VM |
1794 | void |
1795 | ira_traverse_loop_tree (bool bb_p, ira_loop_tree_node_t loop_node, | |
1796 | void (*preorder_func) (ira_loop_tree_node_t), | |
1797 | void (*postorder_func) (ira_loop_tree_node_t)) | |
1798 | { | |
1799 | ira_loop_tree_node_t subloop_node; | |
1800 | ||
1801 | ira_assert (loop_node->bb == NULL); | |
1802 | ira_curr_loop_tree_node = loop_node; | |
1803 | ira_curr_regno_allocno_map = ira_curr_loop_tree_node->regno_allocno_map; | |
1804 | ||
1805 | if (preorder_func != NULL) | |
1806 | (*preorder_func) (loop_node); | |
b8698a0f | 1807 | |
058e97ec | 1808 | if (bb_p) |
e6a7da82 | 1809 | { |
9771b263 | 1810 | vec<ira_loop_tree_node_t> |
6e1aa848 | 1811 | loop_preorder = vNULL; |
e6a7da82 SB |
1812 | unsigned int i; |
1813 | ||
1814 | /* Add all nodes to the set of nodes to visit. The IRA loop tree | |
1815 | is set up such that nodes in the loop body appear in a pre-order | |
1816 | of their place in the CFG. */ | |
1817 | for (subloop_node = loop_node->children; | |
1818 | subloop_node != NULL; | |
1819 | subloop_node = subloop_node->next) | |
1820 | if (subloop_node->bb != NULL) | |
9771b263 | 1821 | loop_preorder.safe_push (subloop_node); |
e6a7da82 SB |
1822 | |
1823 | if (preorder_func != NULL) | |
9771b263 | 1824 | FOR_EACH_VEC_ELT (loop_preorder, i, subloop_node) |
e6a7da82 SB |
1825 | (*preorder_func) (subloop_node); |
1826 | ||
1827 | if (postorder_func != NULL) | |
058e97ec | 1828 | { |
9771b263 | 1829 | vec<ira_loop_tree_node_t> loop_rev_postorder = |
e6a7da82 | 1830 | ira_loop_tree_body_rev_postorder (loop_node, loop_preorder); |
9771b263 | 1831 | FOR_EACH_VEC_ELT_REVERSE (loop_rev_postorder, i, subloop_node) |
058e97ec | 1832 | (*postorder_func) (subloop_node); |
9771b263 | 1833 | loop_rev_postorder.release (); |
058e97ec | 1834 | } |
b8698a0f | 1835 | |
9771b263 | 1836 | loop_preorder.release (); |
e6a7da82 SB |
1837 | } |
1838 | ||
058e97ec VM |
1839 | for (subloop_node = loop_node->subloops; |
1840 | subloop_node != NULL; | |
1841 | subloop_node = subloop_node->subloop_next) | |
1842 | { | |
1843 | ira_assert (subloop_node->bb == NULL); | |
1844 | ira_traverse_loop_tree (bb_p, subloop_node, | |
1845 | preorder_func, postorder_func); | |
1846 | } | |
1847 | ||
1848 | ira_curr_loop_tree_node = loop_node; | |
1849 | ira_curr_regno_allocno_map = ira_curr_loop_tree_node->regno_allocno_map; | |
1850 | ||
1851 | if (postorder_func != NULL) | |
1852 | (*postorder_func) (loop_node); | |
1853 | } | |
1854 | ||
1855 | \f | |
1856 | ||
1857 | /* The basic block currently being processed. */ | |
1858 | static basic_block curr_bb; | |
1859 | ||
1860 | /* This recursive function creates allocnos corresponding to | |
1861 | pseudo-registers containing in X. True OUTPUT_P means that X is | |
1862 | a lvalue. */ | |
1863 | static void | |
1864 | create_insn_allocnos (rtx x, bool output_p) | |
1865 | { | |
1866 | int i, j; | |
1867 | const char *fmt; | |
1868 | enum rtx_code code = GET_CODE (x); | |
1869 | ||
1870 | if (code == REG) | |
1871 | { | |
1872 | int regno; | |
1873 | ||
1874 | if ((regno = REGNO (x)) >= FIRST_PSEUDO_REGISTER) | |
1875 | { | |
1876 | ira_allocno_t a; | |
1877 | ||
1878 | if ((a = ira_curr_regno_allocno_map[regno]) == NULL) | |
1879 | a = ira_create_allocno (regno, false, ira_curr_loop_tree_node); | |
b8698a0f | 1880 | |
058e97ec VM |
1881 | ALLOCNO_NREFS (a)++; |
1882 | ALLOCNO_FREQ (a) += REG_FREQ_FROM_BB (curr_bb); | |
058e97ec VM |
1883 | if (output_p) |
1884 | bitmap_set_bit (ira_curr_loop_tree_node->modified_regnos, regno); | |
1885 | } | |
1886 | return; | |
1887 | } | |
1888 | else if (code == SET) | |
1889 | { | |
1890 | create_insn_allocnos (SET_DEST (x), true); | |
1891 | create_insn_allocnos (SET_SRC (x), false); | |
1892 | return; | |
1893 | } | |
1894 | else if (code == CLOBBER) | |
1895 | { | |
1896 | create_insn_allocnos (XEXP (x, 0), true); | |
1897 | return; | |
1898 | } | |
1899 | else if (code == MEM) | |
1900 | { | |
1901 | create_insn_allocnos (XEXP (x, 0), false); | |
1902 | return; | |
1903 | } | |
b8698a0f | 1904 | else if (code == PRE_DEC || code == POST_DEC || code == PRE_INC || |
058e97ec VM |
1905 | code == POST_INC || code == POST_MODIFY || code == PRE_MODIFY) |
1906 | { | |
1907 | create_insn_allocnos (XEXP (x, 0), true); | |
1908 | create_insn_allocnos (XEXP (x, 0), false); | |
1909 | return; | |
1910 | } | |
1911 | ||
1912 | fmt = GET_RTX_FORMAT (code); | |
1913 | for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
1914 | { | |
1915 | if (fmt[i] == 'e') | |
1916 | create_insn_allocnos (XEXP (x, i), output_p); | |
1917 | else if (fmt[i] == 'E') | |
1918 | for (j = 0; j < XVECLEN (x, i); j++) | |
1919 | create_insn_allocnos (XVECEXP (x, i, j), output_p); | |
1920 | } | |
1921 | } | |
1922 | ||
1923 | /* Create allocnos corresponding to pseudo-registers living in the | |
1924 | basic block represented by the corresponding loop tree node | |
1925 | BB_NODE. */ | |
1926 | static void | |
1927 | create_bb_allocnos (ira_loop_tree_node_t bb_node) | |
1928 | { | |
1929 | basic_block bb; | |
1930 | rtx insn; | |
1931 | unsigned int i; | |
1932 | bitmap_iterator bi; | |
1933 | ||
1934 | curr_bb = bb = bb_node->bb; | |
1935 | ira_assert (bb != NULL); | |
acb37d29 | 1936 | FOR_BB_INSNS_REVERSE (bb, insn) |
b5b8b0ac | 1937 | if (NONDEBUG_INSN_P (insn)) |
058e97ec VM |
1938 | create_insn_allocnos (PATTERN (insn), false); |
1939 | /* It might be a allocno living through from one subloop to | |
1940 | another. */ | |
bf744527 | 1941 | EXECUTE_IF_SET_IN_REG_SET (df_get_live_in (bb), FIRST_PSEUDO_REGISTER, i, bi) |
058e97ec VM |
1942 | if (ira_curr_regno_allocno_map[i] == NULL) |
1943 | ira_create_allocno (i, false, ira_curr_loop_tree_node); | |
1944 | } | |
1945 | ||
1946 | /* Create allocnos corresponding to pseudo-registers living on edge E | |
1947 | (a loop entry or exit). Also mark the allocnos as living on the | |
1948 | loop border. */ | |
1949 | static void | |
1950 | create_loop_allocnos (edge e) | |
1951 | { | |
1952 | unsigned int i; | |
1953 | bitmap live_in_regs, border_allocnos; | |
1954 | bitmap_iterator bi; | |
1955 | ira_loop_tree_node_t parent; | |
1956 | ||
bf744527 | 1957 | live_in_regs = df_get_live_in (e->dest); |
058e97ec | 1958 | border_allocnos = ira_curr_loop_tree_node->border_allocnos; |
bf744527 | 1959 | EXECUTE_IF_SET_IN_REG_SET (df_get_live_out (e->src), |
058e97ec VM |
1960 | FIRST_PSEUDO_REGISTER, i, bi) |
1961 | if (bitmap_bit_p (live_in_regs, i)) | |
1962 | { | |
1963 | if (ira_curr_regno_allocno_map[i] == NULL) | |
1964 | { | |
1965 | /* The order of creations is important for right | |
1966 | ira_regno_allocno_map. */ | |
1967 | if ((parent = ira_curr_loop_tree_node->parent) != NULL | |
1968 | && parent->regno_allocno_map[i] == NULL) | |
1969 | ira_create_allocno (i, false, parent); | |
1970 | ira_create_allocno (i, false, ira_curr_loop_tree_node); | |
1971 | } | |
1972 | bitmap_set_bit (border_allocnos, | |
1973 | ALLOCNO_NUM (ira_curr_regno_allocno_map[i])); | |
1974 | } | |
1975 | } | |
1976 | ||
1977 | /* Create allocnos corresponding to pseudo-registers living in loop | |
1978 | represented by the corresponding loop tree node LOOP_NODE. This | |
1979 | function is called by ira_traverse_loop_tree. */ | |
1980 | static void | |
1981 | create_loop_tree_node_allocnos (ira_loop_tree_node_t loop_node) | |
1982 | { | |
1983 | if (loop_node->bb != NULL) | |
1984 | create_bb_allocnos (loop_node); | |
1985 | else if (loop_node != ira_loop_tree_root) | |
1986 | { | |
1987 | int i; | |
1988 | edge_iterator ei; | |
1989 | edge e; | |
9771b263 | 1990 | vec<edge> edges; |
058e97ec | 1991 | |
2608d841 | 1992 | ira_assert (current_loops != NULL); |
058e97ec VM |
1993 | FOR_EACH_EDGE (e, ei, loop_node->loop->header->preds) |
1994 | if (e->src != loop_node->loop->latch) | |
1995 | create_loop_allocnos (e); | |
b8698a0f | 1996 | |
058e97ec | 1997 | edges = get_loop_exit_edges (loop_node->loop); |
9771b263 | 1998 | FOR_EACH_VEC_ELT (edges, i, e) |
058e97ec | 1999 | create_loop_allocnos (e); |
9771b263 | 2000 | edges.release (); |
058e97ec VM |
2001 | } |
2002 | } | |
2003 | ||
2004 | /* Propagate information about allocnos modified inside the loop given | |
2005 | by its LOOP_TREE_NODE to its parent. */ | |
2006 | static void | |
2007 | propagate_modified_regnos (ira_loop_tree_node_t loop_tree_node) | |
2008 | { | |
2009 | if (loop_tree_node == ira_loop_tree_root) | |
2010 | return; | |
2011 | ira_assert (loop_tree_node->bb == NULL); | |
2012 | bitmap_ior_into (loop_tree_node->parent->modified_regnos, | |
2013 | loop_tree_node->modified_regnos); | |
2014 | } | |
2015 | ||
2016 | /* Propagate new info about allocno A (see comments about accumulated | |
2017 | info in allocno definition) to the corresponding allocno on upper | |
2018 | loop tree level. So allocnos on upper levels accumulate | |
2019 | information about the corresponding allocnos in nested regions. | |
2020 | The new info means allocno info finally calculated in this | |
2021 | file. */ | |
2022 | static void | |
2023 | propagate_allocno_info (void) | |
2024 | { | |
2025 | int i; | |
2026 | ira_allocno_t a, parent_a; | |
2027 | ira_loop_tree_node_t parent; | |
1756cb66 | 2028 | enum reg_class aclass; |
058e97ec | 2029 | |
7db7ed3c VM |
2030 | if (flag_ira_region != IRA_REGION_ALL |
2031 | && flag_ira_region != IRA_REGION_MIXED) | |
058e97ec VM |
2032 | return; |
2033 | for (i = max_reg_num () - 1; i >= FIRST_PSEUDO_REGISTER; i--) | |
2034 | for (a = ira_regno_allocno_map[i]; | |
2035 | a != NULL; | |
2036 | a = ALLOCNO_NEXT_REGNO_ALLOCNO (a)) | |
2037 | if ((parent = ALLOCNO_LOOP_TREE_NODE (a)->parent) != NULL | |
2038 | && (parent_a = parent->regno_allocno_map[i]) != NULL | |
2039 | /* There are no caps yet at this point. So use | |
2040 | border_allocnos to find allocnos for the propagation. */ | |
2041 | && bitmap_bit_p (ALLOCNO_LOOP_TREE_NODE (a)->border_allocnos, | |
2042 | ALLOCNO_NUM (a))) | |
2043 | { | |
927425df VM |
2044 | if (! ALLOCNO_BAD_SPILL_P (a)) |
2045 | ALLOCNO_BAD_SPILL_P (parent_a) = false; | |
058e97ec VM |
2046 | ALLOCNO_NREFS (parent_a) += ALLOCNO_NREFS (a); |
2047 | ALLOCNO_FREQ (parent_a) += ALLOCNO_FREQ (a); | |
2048 | ALLOCNO_CALL_FREQ (parent_a) += ALLOCNO_CALL_FREQ (a); | |
3c55880a | 2049 | merge_hard_reg_conflicts (a, parent_a, true); |
058e97ec VM |
2050 | ALLOCNO_CALLS_CROSSED_NUM (parent_a) |
2051 | += ALLOCNO_CALLS_CROSSED_NUM (a); | |
e384e6b5 BS |
2052 | ALLOCNO_CHEAP_CALLS_CROSSED_NUM (parent_a) |
2053 | += ALLOCNO_CHEAP_CALLS_CROSSED_NUM (a); | |
058e97ec VM |
2054 | ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (parent_a) |
2055 | += ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (a); | |
1756cb66 VM |
2056 | aclass = ALLOCNO_CLASS (a); |
2057 | ira_assert (aclass == ALLOCNO_CLASS (parent_a)); | |
058e97ec | 2058 | ira_allocate_and_accumulate_costs |
1756cb66 | 2059 | (&ALLOCNO_HARD_REG_COSTS (parent_a), aclass, |
058e97ec VM |
2060 | ALLOCNO_HARD_REG_COSTS (a)); |
2061 | ira_allocate_and_accumulate_costs | |
2062 | (&ALLOCNO_CONFLICT_HARD_REG_COSTS (parent_a), | |
1756cb66 | 2063 | aclass, |
058e97ec | 2064 | ALLOCNO_CONFLICT_HARD_REG_COSTS (a)); |
1756cb66 VM |
2065 | ALLOCNO_CLASS_COST (parent_a) |
2066 | += ALLOCNO_CLASS_COST (a); | |
058e97ec | 2067 | ALLOCNO_MEMORY_COST (parent_a) += ALLOCNO_MEMORY_COST (a); |
058e97ec VM |
2068 | } |
2069 | } | |
2070 | ||
2071 | /* Create allocnos corresponding to pseudo-registers in the current | |
2072 | function. Traverse the loop tree for this. */ | |
2073 | static void | |
2074 | create_allocnos (void) | |
2075 | { | |
2076 | /* We need to process BB first to correctly link allocnos by member | |
2077 | next_regno_allocno. */ | |
2078 | ira_traverse_loop_tree (true, ira_loop_tree_root, | |
2079 | create_loop_tree_node_allocnos, NULL); | |
2080 | if (optimize) | |
2081 | ira_traverse_loop_tree (false, ira_loop_tree_root, NULL, | |
2082 | propagate_modified_regnos); | |
2083 | } | |
2084 | ||
2085 | \f | |
2086 | ||
2087 | /* The page contains function to remove some regions from a separate | |
2088 | register allocation. We remove regions whose separate allocation | |
2089 | will hardly improve the result. As a result we speed up regional | |
2090 | register allocation. */ | |
2091 | ||
9140d27b | 2092 | /* The function changes the object in range list given by R to OBJ. */ |
058e97ec | 2093 | static void |
9140d27b | 2094 | change_object_in_range_list (live_range_t r, ira_object_t obj) |
058e97ec VM |
2095 | { |
2096 | for (; r != NULL; r = r->next) | |
9140d27b | 2097 | r->object = obj; |
058e97ec VM |
2098 | } |
2099 | ||
3c55880a BS |
2100 | /* Move all live ranges associated with allocno FROM to allocno TO. */ |
2101 | static void | |
2102 | move_allocno_live_ranges (ira_allocno_t from, ira_allocno_t to) | |
2103 | { | |
ac0ab4f7 BS |
2104 | int i; |
2105 | int n = ALLOCNO_NUM_OBJECTS (from); | |
2106 | ||
2107 | gcc_assert (n == ALLOCNO_NUM_OBJECTS (to)); | |
3c55880a | 2108 | |
ac0ab4f7 | 2109 | for (i = 0; i < n; i++) |
3c55880a | 2110 | { |
ac0ab4f7 BS |
2111 | ira_object_t from_obj = ALLOCNO_OBJECT (from, i); |
2112 | ira_object_t to_obj = ALLOCNO_OBJECT (to, i); | |
2113 | live_range_t lr = OBJECT_LIVE_RANGES (from_obj); | |
2114 | ||
2115 | if (internal_flag_ira_verbose > 4 && ira_dump_file != NULL) | |
2116 | { | |
2117 | fprintf (ira_dump_file, | |
2118 | " Moving ranges of a%dr%d to a%dr%d: ", | |
2119 | ALLOCNO_NUM (from), ALLOCNO_REGNO (from), | |
2120 | ALLOCNO_NUM (to), ALLOCNO_REGNO (to)); | |
2121 | ira_print_live_range_list (ira_dump_file, lr); | |
2122 | } | |
2123 | change_object_in_range_list (lr, to_obj); | |
2124 | OBJECT_LIVE_RANGES (to_obj) | |
2125 | = ira_merge_live_ranges (lr, OBJECT_LIVE_RANGES (to_obj)); | |
2126 | OBJECT_LIVE_RANGES (from_obj) = NULL; | |
3c55880a | 2127 | } |
3c55880a BS |
2128 | } |
2129 | ||
3c55880a BS |
2130 | static void |
2131 | copy_allocno_live_ranges (ira_allocno_t from, ira_allocno_t to) | |
2132 | { | |
ac0ab4f7 BS |
2133 | int i; |
2134 | int n = ALLOCNO_NUM_OBJECTS (from); | |
3c55880a | 2135 | |
ac0ab4f7 BS |
2136 | gcc_assert (n == ALLOCNO_NUM_OBJECTS (to)); |
2137 | ||
2138 | for (i = 0; i < n; i++) | |
3c55880a | 2139 | { |
ac0ab4f7 BS |
2140 | ira_object_t from_obj = ALLOCNO_OBJECT (from, i); |
2141 | ira_object_t to_obj = ALLOCNO_OBJECT (to, i); | |
2142 | live_range_t lr = OBJECT_LIVE_RANGES (from_obj); | |
2143 | ||
2144 | if (internal_flag_ira_verbose > 4 && ira_dump_file != NULL) | |
2145 | { | |
2146 | fprintf (ira_dump_file, " Copying ranges of a%dr%d to a%dr%d: ", | |
2147 | ALLOCNO_NUM (from), ALLOCNO_REGNO (from), | |
2148 | ALLOCNO_NUM (to), ALLOCNO_REGNO (to)); | |
2149 | ira_print_live_range_list (ira_dump_file, lr); | |
2150 | } | |
2151 | lr = ira_copy_live_range_list (lr); | |
2152 | change_object_in_range_list (lr, to_obj); | |
2153 | OBJECT_LIVE_RANGES (to_obj) | |
2154 | = ira_merge_live_ranges (lr, OBJECT_LIVE_RANGES (to_obj)); | |
3c55880a | 2155 | } |
3c55880a BS |
2156 | } |
2157 | ||
058e97ec VM |
2158 | /* Return TRUE if NODE represents a loop with low register |
2159 | pressure. */ | |
2160 | static bool | |
2161 | low_pressure_loop_node_p (ira_loop_tree_node_t node) | |
2162 | { | |
2163 | int i; | |
1756cb66 | 2164 | enum reg_class pclass; |
b8698a0f | 2165 | |
058e97ec VM |
2166 | if (node->bb != NULL) |
2167 | return false; | |
b8698a0f | 2168 | |
1756cb66 | 2169 | for (i = 0; i < ira_pressure_classes_num; i++) |
058e97ec | 2170 | { |
1756cb66 | 2171 | pclass = ira_pressure_classes[i]; |
f508f827 RS |
2172 | if (node->reg_pressure[pclass] > ira_class_hard_regs_num[pclass] |
2173 | && ira_class_hard_regs_num[pclass] > 1) | |
058e97ec VM |
2174 | return false; |
2175 | } | |
2176 | return true; | |
2177 | } | |
2178 | ||
30a435d8 VM |
2179 | #ifdef STACK_REGS |
2180 | /* Return TRUE if LOOP has a complex enter or exit edge. We don't | |
2181 | form a region from such loop if the target use stack register | |
2182 | because reg-stack.c can not deal with such edges. */ | |
8c5fdaae | 2183 | static bool |
30a435d8 | 2184 | loop_with_complex_edge_p (struct loop *loop) |
8c5fdaae VM |
2185 | { |
2186 | int i; | |
2187 | edge_iterator ei; | |
2188 | edge e; | |
9771b263 | 2189 | vec<edge> edges; |
f5843d08 | 2190 | bool res; |
8c5fdaae VM |
2191 | |
2192 | FOR_EACH_EDGE (e, ei, loop->header->preds) | |
2193 | if (e->flags & EDGE_EH) | |
2194 | return true; | |
2195 | edges = get_loop_exit_edges (loop); | |
f5843d08 | 2196 | res = false; |
9771b263 | 2197 | FOR_EACH_VEC_ELT (edges, i, e) |
30a435d8 | 2198 | if (e->flags & EDGE_COMPLEX) |
f5843d08 RG |
2199 | { |
2200 | res = true; | |
2201 | break; | |
2202 | } | |
9771b263 | 2203 | edges.release (); |
f5843d08 | 2204 | return res; |
8c5fdaae | 2205 | } |
30a435d8 | 2206 | #endif |
8c5fdaae | 2207 | |
30ea859e VM |
2208 | /* Sort loops for marking them for removal. We put already marked |
2209 | loops first, then less frequent loops next, and then outer loops | |
2210 | next. */ | |
2211 | static int | |
2212 | loop_compare_func (const void *v1p, const void *v2p) | |
2213 | { | |
2214 | int diff; | |
2215 | ira_loop_tree_node_t l1 = *(const ira_loop_tree_node_t *) v1p; | |
2216 | ira_loop_tree_node_t l2 = *(const ira_loop_tree_node_t *) v2p; | |
2217 | ||
2218 | ira_assert (l1->parent != NULL && l2->parent != NULL); | |
2219 | if (l1->to_remove_p && ! l2->to_remove_p) | |
2220 | return -1; | |
2221 | if (! l1->to_remove_p && l2->to_remove_p) | |
2222 | return 1; | |
2223 | if ((diff = l1->loop->header->frequency - l2->loop->header->frequency) != 0) | |
2224 | return diff; | |
2225 | if ((diff = (int) loop_depth (l1->loop) - (int) loop_depth (l2->loop)) != 0) | |
2226 | return diff; | |
2227 | /* Make sorting stable. */ | |
2608d841 | 2228 | return l1->loop_num - l2->loop_num; |
30ea859e VM |
2229 | } |
2230 | ||
30ea859e VM |
2231 | /* Mark loops which should be removed from regional allocation. We |
2232 | remove a loop with low register pressure inside another loop with | |
2233 | register pressure. In this case a separate allocation of the loop | |
2234 | hardly helps (for irregular register file architecture it could | |
2235 | help by choosing a better hard register in the loop but we prefer | |
2236 | faster allocation even in this case). We also remove cheap loops | |
8c5fdaae VM |
2237 | if there are more than IRA_MAX_LOOPS_NUM of them. Loop with EH |
2238 | exit or enter edges are removed too because the allocation might | |
2239 | require put pseudo moves on the EH edges (we could still do this | |
2240 | for pseudos with caller saved hard registers in some cases but it | |
2241 | is impossible to say here or during top-down allocation pass what | |
2242 | hard register the pseudos get finally). */ | |
30ea859e VM |
2243 | static void |
2244 | mark_loops_for_removal (void) | |
058e97ec | 2245 | { |
30ea859e VM |
2246 | int i, n; |
2247 | ira_loop_tree_node_t *sorted_loops; | |
2248 | loop_p loop; | |
2249 | ||
2608d841 | 2250 | ira_assert (current_loops != NULL); |
30ea859e VM |
2251 | sorted_loops |
2252 | = (ira_loop_tree_node_t *) ira_allocate (sizeof (ira_loop_tree_node_t) | |
0fc822d0 RB |
2253 | * number_of_loops (cfun)); |
2254 | for (n = i = 0; vec_safe_iterate (get_loops (cfun), i, &loop); i++) | |
30ea859e VM |
2255 | if (ira_loop_nodes[i].regno_allocno_map != NULL) |
2256 | { | |
2257 | if (ira_loop_nodes[i].parent == NULL) | |
2258 | { | |
2259 | /* Don't remove the root. */ | |
2260 | ira_loop_nodes[i].to_remove_p = false; | |
2261 | continue; | |
2262 | } | |
2263 | sorted_loops[n++] = &ira_loop_nodes[i]; | |
2264 | ira_loop_nodes[i].to_remove_p | |
8c5fdaae VM |
2265 | = ((low_pressure_loop_node_p (ira_loop_nodes[i].parent) |
2266 | && low_pressure_loop_node_p (&ira_loop_nodes[i])) | |
30a435d8 VM |
2267 | #ifdef STACK_REGS |
2268 | || loop_with_complex_edge_p (ira_loop_nodes[i].loop) | |
2269 | #endif | |
2270 | ); | |
30ea859e VM |
2271 | } |
2272 | qsort (sorted_loops, n, sizeof (ira_loop_tree_node_t), loop_compare_func); | |
2273 | for (i = 0; n - i + 1 > IRA_MAX_LOOPS_NUM; i++) | |
2274 | { | |
2275 | sorted_loops[i]->to_remove_p = true; | |
2276 | if (internal_flag_ira_verbose > 1 && ira_dump_file != NULL) | |
2277 | fprintf | |
2278 | (ira_dump_file, | |
2279 | " Mark loop %d (header %d, freq %d, depth %d) for removal (%s)\n", | |
2608d841 | 2280 | sorted_loops[i]->loop_num, sorted_loops[i]->loop->header->index, |
30ea859e VM |
2281 | sorted_loops[i]->loop->header->frequency, |
2282 | loop_depth (sorted_loops[i]->loop), | |
2283 | low_pressure_loop_node_p (sorted_loops[i]->parent) | |
2284 | && low_pressure_loop_node_p (sorted_loops[i]) | |
2285 | ? "low pressure" : "cheap loop"); | |
2286 | } | |
2287 | ira_free (sorted_loops); | |
058e97ec VM |
2288 | } |
2289 | ||
311aab06 VM |
2290 | /* Mark all loops but root for removing. */ |
2291 | static void | |
2292 | mark_all_loops_for_removal (void) | |
2293 | { | |
2294 | int i; | |
2295 | loop_p loop; | |
2296 | ||
2608d841 | 2297 | ira_assert (current_loops != NULL); |
0fc822d0 | 2298 | FOR_EACH_VEC_SAFE_ELT (get_loops (cfun), i, loop) |
311aab06 VM |
2299 | if (ira_loop_nodes[i].regno_allocno_map != NULL) |
2300 | { | |
2301 | if (ira_loop_nodes[i].parent == NULL) | |
2302 | { | |
2303 | /* Don't remove the root. */ | |
2304 | ira_loop_nodes[i].to_remove_p = false; | |
2305 | continue; | |
2306 | } | |
2307 | ira_loop_nodes[i].to_remove_p = true; | |
2308 | if (internal_flag_ira_verbose > 1 && ira_dump_file != NULL) | |
2309 | fprintf | |
2310 | (ira_dump_file, | |
2311 | " Mark loop %d (header %d, freq %d, depth %d) for removal\n", | |
2608d841 | 2312 | ira_loop_nodes[i].loop_num, |
311aab06 VM |
2313 | ira_loop_nodes[i].loop->header->index, |
2314 | ira_loop_nodes[i].loop->header->frequency, | |
2315 | loop_depth (ira_loop_nodes[i].loop)); | |
2316 | } | |
2317 | } | |
30ea859e | 2318 | |
058e97ec | 2319 | /* Definition of vector of loop tree nodes. */ |
058e97ec VM |
2320 | |
2321 | /* Vec containing references to all removed loop tree nodes. */ | |
9771b263 | 2322 | static vec<ira_loop_tree_node_t> removed_loop_vec; |
058e97ec VM |
2323 | |
2324 | /* Vec containing references to all children of loop tree nodes. */ | |
9771b263 | 2325 | static vec<ira_loop_tree_node_t> children_vec; |
058e97ec VM |
2326 | |
2327 | /* Remove subregions of NODE if their separate allocation will not | |
2328 | improve the result. */ | |
2329 | static void | |
2330 | remove_uneccesary_loop_nodes_from_loop_tree (ira_loop_tree_node_t node) | |
2331 | { | |
2332 | unsigned int start; | |
2333 | bool remove_p; | |
2334 | ira_loop_tree_node_t subnode; | |
2335 | ||
30ea859e | 2336 | remove_p = node->to_remove_p; |
058e97ec | 2337 | if (! remove_p) |
9771b263 DN |
2338 | children_vec.safe_push (node); |
2339 | start = children_vec.length (); | |
058e97ec VM |
2340 | for (subnode = node->children; subnode != NULL; subnode = subnode->next) |
2341 | if (subnode->bb == NULL) | |
2342 | remove_uneccesary_loop_nodes_from_loop_tree (subnode); | |
2343 | else | |
9771b263 | 2344 | children_vec.safe_push (subnode); |
058e97ec VM |
2345 | node->children = node->subloops = NULL; |
2346 | if (remove_p) | |
2347 | { | |
9771b263 | 2348 | removed_loop_vec.safe_push (node); |
058e97ec VM |
2349 | return; |
2350 | } | |
9771b263 | 2351 | while (children_vec.length () > start) |
058e97ec | 2352 | { |
9771b263 | 2353 | subnode = children_vec.pop (); |
058e97ec VM |
2354 | subnode->parent = node; |
2355 | subnode->next = node->children; | |
2356 | node->children = subnode; | |
2357 | if (subnode->bb == NULL) | |
2358 | { | |
2359 | subnode->subloop_next = node->subloops; | |
2360 | node->subloops = subnode; | |
2361 | } | |
2362 | } | |
2363 | } | |
2364 | ||
c6bb4c93 VM |
2365 | /* Return TRUE if NODE is inside PARENT. */ |
2366 | static bool | |
2367 | loop_is_inside_p (ira_loop_tree_node_t node, ira_loop_tree_node_t parent) | |
2368 | { | |
2369 | for (node = node->parent; node != NULL; node = node->parent) | |
2370 | if (node == parent) | |
2371 | return true; | |
2372 | return false; | |
2373 | } | |
2374 | ||
2375 | /* Sort allocnos according to their order in regno allocno list. */ | |
2376 | static int | |
2377 | regno_allocno_order_compare_func (const void *v1p, const void *v2p) | |
2378 | { | |
2379 | ira_allocno_t a1 = *(const ira_allocno_t *) v1p; | |
2380 | ira_allocno_t a2 = *(const ira_allocno_t *) v2p; | |
2381 | ira_loop_tree_node_t n1 = ALLOCNO_LOOP_TREE_NODE (a1); | |
2382 | ira_loop_tree_node_t n2 = ALLOCNO_LOOP_TREE_NODE (a2); | |
2383 | ||
2384 | if (loop_is_inside_p (n1, n2)) | |
2385 | return -1; | |
2386 | else if (loop_is_inside_p (n2, n1)) | |
2387 | return 1; | |
2388 | /* If allocnos are equally good, sort by allocno numbers, so that | |
2389 | the results of qsort leave nothing to chance. We put allocnos | |
2390 | with higher number first in the list because it is the original | |
2391 | order for allocnos from loops on the same levels. */ | |
2392 | return ALLOCNO_NUM (a2) - ALLOCNO_NUM (a1); | |
2393 | } | |
2394 | ||
2395 | /* This array is used to sort allocnos to restore allocno order in | |
2396 | the regno allocno list. */ | |
2397 | static ira_allocno_t *regno_allocnos; | |
2398 | ||
2399 | /* Restore allocno order for REGNO in the regno allocno list. */ | |
2400 | static void | |
2401 | ira_rebuild_regno_allocno_list (int regno) | |
2402 | { | |
2403 | int i, n; | |
2404 | ira_allocno_t a; | |
2405 | ||
2406 | for (n = 0, a = ira_regno_allocno_map[regno]; | |
2407 | a != NULL; | |
2408 | a = ALLOCNO_NEXT_REGNO_ALLOCNO (a)) | |
2409 | regno_allocnos[n++] = a; | |
2410 | ira_assert (n > 0); | |
b8698a0f | 2411 | qsort (regno_allocnos, n, sizeof (ira_allocno_t), |
c6bb4c93 VM |
2412 | regno_allocno_order_compare_func); |
2413 | for (i = 1; i < n; i++) | |
2414 | ALLOCNO_NEXT_REGNO_ALLOCNO (regno_allocnos[i - 1]) = regno_allocnos[i]; | |
2415 | ALLOCNO_NEXT_REGNO_ALLOCNO (regno_allocnos[n - 1]) = NULL; | |
2416 | ira_regno_allocno_map[regno] = regno_allocnos[0]; | |
2417 | if (internal_flag_ira_verbose > 1 && ira_dump_file != NULL) | |
2418 | fprintf (ira_dump_file, " Rebuilding regno allocno list for %d\n", regno); | |
2419 | } | |
2420 | ||
311aab06 VM |
2421 | /* Propagate info from allocno FROM_A to allocno A. */ |
2422 | static void | |
2423 | propagate_some_info_from_allocno (ira_allocno_t a, ira_allocno_t from_a) | |
2424 | { | |
1756cb66 | 2425 | enum reg_class aclass; |
311aab06 | 2426 | |
3c55880a | 2427 | merge_hard_reg_conflicts (from_a, a, false); |
311aab06 VM |
2428 | ALLOCNO_NREFS (a) += ALLOCNO_NREFS (from_a); |
2429 | ALLOCNO_FREQ (a) += ALLOCNO_FREQ (from_a); | |
2430 | ALLOCNO_CALL_FREQ (a) += ALLOCNO_CALL_FREQ (from_a); | |
311aab06 | 2431 | ALLOCNO_CALLS_CROSSED_NUM (a) += ALLOCNO_CALLS_CROSSED_NUM (from_a); |
e384e6b5 BS |
2432 | ALLOCNO_CHEAP_CALLS_CROSSED_NUM (a) |
2433 | += ALLOCNO_CHEAP_CALLS_CROSSED_NUM (from_a); | |
311aab06 VM |
2434 | ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (a) |
2435 | += ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (from_a); | |
2436 | if (! ALLOCNO_BAD_SPILL_P (from_a)) | |
2437 | ALLOCNO_BAD_SPILL_P (a) = false; | |
1756cb66 VM |
2438 | aclass = ALLOCNO_CLASS (from_a); |
2439 | ira_assert (aclass == ALLOCNO_CLASS (a)); | |
2440 | ira_allocate_and_accumulate_costs (&ALLOCNO_HARD_REG_COSTS (a), aclass, | |
311aab06 VM |
2441 | ALLOCNO_HARD_REG_COSTS (from_a)); |
2442 | ira_allocate_and_accumulate_costs (&ALLOCNO_CONFLICT_HARD_REG_COSTS (a), | |
1756cb66 | 2443 | aclass, |
311aab06 | 2444 | ALLOCNO_CONFLICT_HARD_REG_COSTS (from_a)); |
1756cb66 | 2445 | ALLOCNO_CLASS_COST (a) += ALLOCNO_CLASS_COST (from_a); |
311aab06 VM |
2446 | ALLOCNO_MEMORY_COST (a) += ALLOCNO_MEMORY_COST (from_a); |
2447 | } | |
2448 | ||
058e97ec VM |
2449 | /* Remove allocnos from loops removed from the allocation |
2450 | consideration. */ | |
2451 | static void | |
2452 | remove_unnecessary_allocnos (void) | |
2453 | { | |
2454 | int regno; | |
c6bb4c93 | 2455 | bool merged_p, rebuild_p; |
058e97ec VM |
2456 | ira_allocno_t a, prev_a, next_a, parent_a; |
2457 | ira_loop_tree_node_t a_node, parent; | |
058e97ec VM |
2458 | |
2459 | merged_p = false; | |
c6bb4c93 | 2460 | regno_allocnos = NULL; |
058e97ec | 2461 | for (regno = max_reg_num () - 1; regno >= FIRST_PSEUDO_REGISTER; regno--) |
c6bb4c93 VM |
2462 | { |
2463 | rebuild_p = false; | |
2464 | for (prev_a = NULL, a = ira_regno_allocno_map[regno]; | |
2465 | a != NULL; | |
2466 | a = next_a) | |
2467 | { | |
2468 | next_a = ALLOCNO_NEXT_REGNO_ALLOCNO (a); | |
2469 | a_node = ALLOCNO_LOOP_TREE_NODE (a); | |
2470 | if (! a_node->to_remove_p) | |
2471 | prev_a = a; | |
2472 | else | |
2473 | { | |
2474 | for (parent = a_node->parent; | |
2475 | (parent_a = parent->regno_allocno_map[regno]) == NULL | |
2476 | && parent->to_remove_p; | |
2477 | parent = parent->parent) | |
2478 | ; | |
2479 | if (parent_a == NULL) | |
2480 | { | |
311aab06 VM |
2481 | /* There are no allocnos with the same regno in |
2482 | upper region -- just move the allocno to the | |
2483 | upper region. */ | |
c6bb4c93 VM |
2484 | prev_a = a; |
2485 | ALLOCNO_LOOP_TREE_NODE (a) = parent; | |
2486 | parent->regno_allocno_map[regno] = a; | |
2487 | bitmap_set_bit (parent->all_allocnos, ALLOCNO_NUM (a)); | |
2488 | rebuild_p = true; | |
2489 | } | |
2490 | else | |
2491 | { | |
2492 | /* Remove the allocno and update info of allocno in | |
2493 | the upper region. */ | |
2494 | if (prev_a == NULL) | |
2495 | ira_regno_allocno_map[regno] = next_a; | |
2496 | else | |
2497 | ALLOCNO_NEXT_REGNO_ALLOCNO (prev_a) = next_a; | |
3c55880a | 2498 | move_allocno_live_ranges (a, parent_a); |
c6bb4c93 | 2499 | merged_p = true; |
311aab06 | 2500 | propagate_some_info_from_allocno (parent_a, a); |
46044dd9 L |
2501 | /* Remove it from the corresponding regno allocno |
2502 | map to avoid info propagation of subsequent | |
2503 | allocno into this already removed allocno. */ | |
2504 | a_node->regno_allocno_map[regno] = NULL; | |
3b6d1699 | 2505 | ira_remove_allocno_prefs (a); |
c6bb4c93 VM |
2506 | finish_allocno (a); |
2507 | } | |
2508 | } | |
2509 | } | |
2510 | if (rebuild_p) | |
2511 | /* We need to restore the order in regno allocno list. */ | |
2512 | { | |
2513 | if (regno_allocnos == NULL) | |
2514 | regno_allocnos | |
2515 | = (ira_allocno_t *) ira_allocate (sizeof (ira_allocno_t) | |
2516 | * ira_allocnos_num); | |
2517 | ira_rebuild_regno_allocno_list (regno); | |
2518 | } | |
2519 | } | |
058e97ec VM |
2520 | if (merged_p) |
2521 | ira_rebuild_start_finish_chains (); | |
c6bb4c93 VM |
2522 | if (regno_allocnos != NULL) |
2523 | ira_free (regno_allocnos); | |
058e97ec VM |
2524 | } |
2525 | ||
311aab06 | 2526 | /* Remove allocnos from all loops but the root. */ |
058e97ec | 2527 | static void |
311aab06 | 2528 | remove_low_level_allocnos (void) |
058e97ec | 2529 | { |
311aab06 VM |
2530 | int regno; |
2531 | bool merged_p, propagate_p; | |
2532 | ira_allocno_t a, top_a; | |
2533 | ira_loop_tree_node_t a_node, parent; | |
311aab06 VM |
2534 | ira_allocno_iterator ai; |
2535 | ||
2536 | merged_p = false; | |
2537 | FOR_EACH_ALLOCNO (a, ai) | |
2538 | { | |
2539 | a_node = ALLOCNO_LOOP_TREE_NODE (a); | |
2540 | if (a_node == ira_loop_tree_root || ALLOCNO_CAP_MEMBER (a) != NULL) | |
2541 | continue; | |
2542 | regno = ALLOCNO_REGNO (a); | |
2543 | if ((top_a = ira_loop_tree_root->regno_allocno_map[regno]) == NULL) | |
2544 | { | |
2545 | ALLOCNO_LOOP_TREE_NODE (a) = ira_loop_tree_root; | |
2546 | ira_loop_tree_root->regno_allocno_map[regno] = a; | |
2547 | continue; | |
2548 | } | |
2549 | propagate_p = a_node->parent->regno_allocno_map[regno] == NULL; | |
2550 | /* Remove the allocno and update info of allocno in the upper | |
2551 | region. */ | |
3c55880a | 2552 | move_allocno_live_ranges (a, top_a); |
311aab06 | 2553 | merged_p = true; |
311aab06 VM |
2554 | if (propagate_p) |
2555 | propagate_some_info_from_allocno (top_a, a); | |
2556 | } | |
2557 | FOR_EACH_ALLOCNO (a, ai) | |
2558 | { | |
2559 | a_node = ALLOCNO_LOOP_TREE_NODE (a); | |
2560 | if (a_node == ira_loop_tree_root) | |
2561 | continue; | |
2562 | parent = a_node->parent; | |
2563 | regno = ALLOCNO_REGNO (a); | |
2564 | if (ALLOCNO_CAP_MEMBER (a) != NULL) | |
2565 | ira_assert (ALLOCNO_CAP (a) != NULL); | |
2566 | else if (ALLOCNO_CAP (a) == NULL) | |
2567 | ira_assert (parent->regno_allocno_map[regno] != NULL); | |
2568 | } | |
2569 | FOR_EACH_ALLOCNO (a, ai) | |
2570 | { | |
2571 | regno = ALLOCNO_REGNO (a); | |
2572 | if (ira_loop_tree_root->regno_allocno_map[regno] == a) | |
2573 | { | |
ac0ab4f7 BS |
2574 | ira_object_t obj; |
2575 | ira_allocno_object_iterator oi; | |
a49ae217 | 2576 | |
311aab06 VM |
2577 | ira_regno_allocno_map[regno] = a; |
2578 | ALLOCNO_NEXT_REGNO_ALLOCNO (a) = NULL; | |
2579 | ALLOCNO_CAP_MEMBER (a) = NULL; | |
ac0ab4f7 BS |
2580 | FOR_EACH_ALLOCNO_OBJECT (a, obj, oi) |
2581 | COPY_HARD_REG_SET (OBJECT_CONFLICT_HARD_REGS (obj), | |
2582 | OBJECT_TOTAL_CONFLICT_HARD_REGS (obj)); | |
311aab06 VM |
2583 | #ifdef STACK_REGS |
2584 | if (ALLOCNO_TOTAL_NO_STACK_REG_P (a)) | |
2585 | ALLOCNO_NO_STACK_REG_P (a) = true; | |
2586 | #endif | |
2587 | } | |
2588 | else | |
3b6d1699 VM |
2589 | { |
2590 | ira_remove_allocno_prefs (a); | |
2591 | finish_allocno (a); | |
2592 | } | |
311aab06 VM |
2593 | } |
2594 | if (merged_p) | |
2595 | ira_rebuild_start_finish_chains (); | |
2596 | } | |
2597 | ||
2598 | /* Remove loops from consideration. We remove all loops except for | |
2599 | root if ALL_P or loops for which a separate allocation will not | |
2600 | improve the result. We have to do this after allocno creation and | |
1756cb66 VM |
2601 | their costs and allocno class evaluation because only after that |
2602 | the register pressure can be known and is calculated. */ | |
311aab06 VM |
2603 | static void |
2604 | remove_unnecessary_regions (bool all_p) | |
2605 | { | |
2608d841 VM |
2606 | if (current_loops == NULL) |
2607 | return; | |
311aab06 VM |
2608 | if (all_p) |
2609 | mark_all_loops_for_removal (); | |
2610 | else | |
2611 | mark_loops_for_removal (); | |
c3284718 RS |
2612 | children_vec.create (last_basic_block + number_of_loops (cfun)); |
2613 | removed_loop_vec.create (last_basic_block + number_of_loops (cfun)); | |
9771b263 DN |
2614 | remove_uneccesary_loop_nodes_from_loop_tree (ira_loop_tree_root); |
2615 | children_vec.release (); | |
311aab06 VM |
2616 | if (all_p) |
2617 | remove_low_level_allocnos (); | |
2618 | else | |
2619 | remove_unnecessary_allocnos (); | |
9771b263 DN |
2620 | while (removed_loop_vec.length () > 0) |
2621 | finish_loop_tree_node (removed_loop_vec.pop ()); | |
2622 | removed_loop_vec.release (); | |
058e97ec VM |
2623 | } |
2624 | ||
2625 | \f | |
2626 | ||
927425df VM |
2627 | /* At this point true value of allocno attribute bad_spill_p means |
2628 | that there is an insn where allocno occurs and where the allocno | |
2629 | can not be used as memory. The function updates the attribute, now | |
2630 | it can be true only for allocnos which can not be used as memory in | |
2631 | an insn and in whose live ranges there is other allocno deaths. | |
2632 | Spilling allocnos with true value will not improve the code because | |
2633 | it will not make other allocnos colorable and additional reloads | |
2634 | for the corresponding pseudo will be generated in reload pass for | |
2635 | each insn it occurs. | |
2636 | ||
2637 | This is a trick mentioned in one classic article of Chaitin etc | |
2638 | which is frequently omitted in other implementations of RA based on | |
2639 | graph coloring. */ | |
2640 | static void | |
2641 | update_bad_spill_attribute (void) | |
2642 | { | |
2643 | int i; | |
2644 | ira_allocno_t a; | |
2645 | ira_allocno_iterator ai; | |
ac0ab4f7 BS |
2646 | ira_allocno_object_iterator aoi; |
2647 | ira_object_t obj; | |
b14151b5 | 2648 | live_range_t r; |
1756cb66 | 2649 | enum reg_class aclass; |
927425df VM |
2650 | bitmap_head dead_points[N_REG_CLASSES]; |
2651 | ||
1756cb66 | 2652 | for (i = 0; i < ira_allocno_classes_num; i++) |
927425df | 2653 | { |
1756cb66 VM |
2654 | aclass = ira_allocno_classes[i]; |
2655 | bitmap_initialize (&dead_points[aclass], ®_obstack); | |
927425df VM |
2656 | } |
2657 | FOR_EACH_ALLOCNO (a, ai) | |
2658 | { | |
1756cb66 VM |
2659 | aclass = ALLOCNO_CLASS (a); |
2660 | if (aclass == NO_REGS) | |
927425df | 2661 | continue; |
ac0ab4f7 BS |
2662 | FOR_EACH_ALLOCNO_OBJECT (a, obj, aoi) |
2663 | for (r = OBJECT_LIVE_RANGES (obj); r != NULL; r = r->next) | |
1756cb66 | 2664 | bitmap_set_bit (&dead_points[aclass], r->finish); |
927425df VM |
2665 | } |
2666 | FOR_EACH_ALLOCNO (a, ai) | |
2667 | { | |
1756cb66 VM |
2668 | aclass = ALLOCNO_CLASS (a); |
2669 | if (aclass == NO_REGS) | |
927425df VM |
2670 | continue; |
2671 | if (! ALLOCNO_BAD_SPILL_P (a)) | |
2672 | continue; | |
ac0ab4f7 | 2673 | FOR_EACH_ALLOCNO_OBJECT (a, obj, aoi) |
927425df | 2674 | { |
ac0ab4f7 BS |
2675 | for (r = OBJECT_LIVE_RANGES (obj); r != NULL; r = r->next) |
2676 | { | |
2677 | for (i = r->start + 1; i < r->finish; i++) | |
1756cb66 | 2678 | if (bitmap_bit_p (&dead_points[aclass], i)) |
ac0ab4f7 BS |
2679 | break; |
2680 | if (i < r->finish) | |
2681 | break; | |
2682 | } | |
2683 | if (r != NULL) | |
2684 | { | |
2685 | ALLOCNO_BAD_SPILL_P (a) = false; | |
927425df | 2686 | break; |
ac0ab4f7 | 2687 | } |
927425df | 2688 | } |
927425df | 2689 | } |
1756cb66 | 2690 | for (i = 0; i < ira_allocno_classes_num; i++) |
927425df | 2691 | { |
1756cb66 VM |
2692 | aclass = ira_allocno_classes[i]; |
2693 | bitmap_clear (&dead_points[aclass]); | |
927425df VM |
2694 | } |
2695 | } | |
2696 | ||
2697 | \f | |
2698 | ||
058e97ec VM |
2699 | /* Set up minimal and maximal live range points for allocnos. */ |
2700 | static void | |
2701 | setup_min_max_allocno_live_range_point (void) | |
2702 | { | |
2703 | int i; | |
2704 | ira_allocno_t a, parent_a, cap; | |
2705 | ira_allocno_iterator ai; | |
ac0ab4f7 BS |
2706 | #ifdef ENABLE_IRA_CHECKING |
2707 | ira_object_iterator oi; | |
2708 | ira_object_t obj; | |
2709 | #endif | |
b14151b5 | 2710 | live_range_t r; |
058e97ec VM |
2711 | ira_loop_tree_node_t parent; |
2712 | ||
2713 | FOR_EACH_ALLOCNO (a, ai) | |
2714 | { | |
ac0ab4f7 | 2715 | int n = ALLOCNO_NUM_OBJECTS (a); |
1756cb66 | 2716 | |
ac0ab4f7 BS |
2717 | for (i = 0; i < n; i++) |
2718 | { | |
2719 | ira_object_t obj = ALLOCNO_OBJECT (a, i); | |
2720 | r = OBJECT_LIVE_RANGES (obj); | |
2721 | if (r == NULL) | |
2722 | continue; | |
2723 | OBJECT_MAX (obj) = r->finish; | |
2724 | for (; r->next != NULL; r = r->next) | |
2725 | ; | |
2726 | OBJECT_MIN (obj) = r->start; | |
2727 | } | |
058e97ec VM |
2728 | } |
2729 | for (i = max_reg_num () - 1; i >= FIRST_PSEUDO_REGISTER; i--) | |
2730 | for (a = ira_regno_allocno_map[i]; | |
2731 | a != NULL; | |
2732 | a = ALLOCNO_NEXT_REGNO_ALLOCNO (a)) | |
2733 | { | |
ac0ab4f7 BS |
2734 | int j; |
2735 | int n = ALLOCNO_NUM_OBJECTS (a); | |
1756cb66 | 2736 | |
ac0ab4f7 | 2737 | for (j = 0; j < n; j++) |
058e97ec | 2738 | { |
ac0ab4f7 BS |
2739 | ira_object_t obj = ALLOCNO_OBJECT (a, j); |
2740 | ira_object_t parent_obj; | |
2741 | ||
2742 | if (OBJECT_MAX (obj) < 0) | |
2743 | continue; | |
2744 | ira_assert (ALLOCNO_CAP_MEMBER (a) == NULL); | |
2745 | /* Accumulation of range info. */ | |
2746 | if (ALLOCNO_CAP (a) != NULL) | |
058e97ec | 2747 | { |
ac0ab4f7 BS |
2748 | for (cap = ALLOCNO_CAP (a); cap != NULL; cap = ALLOCNO_CAP (cap)) |
2749 | { | |
2750 | ira_object_t cap_obj = ALLOCNO_OBJECT (cap, j); | |
2751 | if (OBJECT_MAX (cap_obj) < OBJECT_MAX (obj)) | |
2752 | OBJECT_MAX (cap_obj) = OBJECT_MAX (obj); | |
2753 | if (OBJECT_MIN (cap_obj) > OBJECT_MIN (obj)) | |
2754 | OBJECT_MIN (cap_obj) = OBJECT_MIN (obj); | |
2755 | } | |
2756 | continue; | |
058e97ec | 2757 | } |
ac0ab4f7 BS |
2758 | if ((parent = ALLOCNO_LOOP_TREE_NODE (a)->parent) == NULL) |
2759 | continue; | |
2760 | parent_a = parent->regno_allocno_map[i]; | |
2761 | parent_obj = ALLOCNO_OBJECT (parent_a, j); | |
2762 | if (OBJECT_MAX (parent_obj) < OBJECT_MAX (obj)) | |
2763 | OBJECT_MAX (parent_obj) = OBJECT_MAX (obj); | |
2764 | if (OBJECT_MIN (parent_obj) > OBJECT_MIN (obj)) | |
2765 | OBJECT_MIN (parent_obj) = OBJECT_MIN (obj); | |
058e97ec | 2766 | } |
058e97ec VM |
2767 | } |
2768 | #ifdef ENABLE_IRA_CHECKING | |
ac0ab4f7 | 2769 | FOR_EACH_OBJECT (obj, oi) |
058e97ec | 2770 | { |
a49ae217 BS |
2771 | if ((0 <= OBJECT_MIN (obj) && OBJECT_MIN (obj) <= ira_max_point) |
2772 | && (0 <= OBJECT_MAX (obj) && OBJECT_MAX (obj) <= ira_max_point)) | |
058e97ec VM |
2773 | continue; |
2774 | gcc_unreachable (); | |
2775 | } | |
2776 | #endif | |
2777 | } | |
2778 | ||
2779 | /* Sort allocnos according to their live ranges. Allocnos with | |
1756cb66 VM |
2780 | smaller allocno class are put first unless we use priority |
2781 | coloring. Allocnos with the same class are ordered according | |
2782 | their start (min). Allocnos with the same start are ordered | |
2783 | according their finish (max). */ | |
058e97ec | 2784 | static int |
ac0ab4f7 | 2785 | object_range_compare_func (const void *v1p, const void *v2p) |
058e97ec VM |
2786 | { |
2787 | int diff; | |
a49ae217 BS |
2788 | ira_object_t obj1 = *(const ira_object_t *) v1p; |
2789 | ira_object_t obj2 = *(const ira_object_t *) v2p; | |
2790 | ira_allocno_t a1 = OBJECT_ALLOCNO (obj1); | |
2791 | ira_allocno_t a2 = OBJECT_ALLOCNO (obj2); | |
058e97ec | 2792 | |
a49ae217 | 2793 | if ((diff = OBJECT_MIN (obj1) - OBJECT_MIN (obj2)) != 0) |
058e97ec | 2794 | return diff; |
a49ae217 | 2795 | if ((diff = OBJECT_MAX (obj1) - OBJECT_MAX (obj2)) != 0) |
058e97ec VM |
2796 | return diff; |
2797 | return ALLOCNO_NUM (a1) - ALLOCNO_NUM (a2); | |
2798 | } | |
2799 | ||
a49ae217 | 2800 | /* Sort ira_object_id_map and set up conflict id of allocnos. */ |
058e97ec | 2801 | static void |
a49ae217 | 2802 | sort_conflict_id_map (void) |
058e97ec VM |
2803 | { |
2804 | int i, num; | |
2805 | ira_allocno_t a; | |
2806 | ira_allocno_iterator ai; | |
2807 | ||
2808 | num = 0; | |
2809 | FOR_EACH_ALLOCNO (a, ai) | |
ac0ab4f7 BS |
2810 | { |
2811 | ira_allocno_object_iterator oi; | |
2812 | ira_object_t obj; | |
2813 | ||
2814 | FOR_EACH_ALLOCNO_OBJECT (a, obj, oi) | |
2815 | ira_object_id_map[num++] = obj; | |
2816 | } | |
a49ae217 | 2817 | qsort (ira_object_id_map, num, sizeof (ira_object_t), |
ac0ab4f7 | 2818 | object_range_compare_func); |
058e97ec | 2819 | for (i = 0; i < num; i++) |
a49ae217 BS |
2820 | { |
2821 | ira_object_t obj = ira_object_id_map[i]; | |
1756cb66 | 2822 | |
a49ae217 BS |
2823 | gcc_assert (obj != NULL); |
2824 | OBJECT_CONFLICT_ID (obj) = i; | |
2825 | } | |
2826 | for (i = num; i < ira_objects_num; i++) | |
2827 | ira_object_id_map[i] = NULL; | |
058e97ec VM |
2828 | } |
2829 | ||
2830 | /* Set up minimal and maximal conflict ids of allocnos with which | |
2831 | given allocno can conflict. */ | |
2832 | static void | |
2833 | setup_min_max_conflict_allocno_ids (void) | |
2834 | { | |
1756cb66 | 2835 | int aclass; |
058e97ec VM |
2836 | int i, j, min, max, start, finish, first_not_finished, filled_area_start; |
2837 | int *live_range_min, *last_lived; | |
ac0ab4f7 | 2838 | int word0_min, word0_max; |
058e97ec | 2839 | ira_allocno_t a; |
ac0ab4f7 | 2840 | ira_allocno_iterator ai; |
058e97ec | 2841 | |
a49ae217 | 2842 | live_range_min = (int *) ira_allocate (sizeof (int) * ira_objects_num); |
1756cb66 | 2843 | aclass = -1; |
058e97ec | 2844 | first_not_finished = -1; |
a49ae217 | 2845 | for (i = 0; i < ira_objects_num; i++) |
058e97ec | 2846 | { |
a49ae217 | 2847 | ira_object_t obj = ira_object_id_map[i]; |
1756cb66 | 2848 | |
a49ae217 | 2849 | if (obj == NULL) |
058e97ec | 2850 | continue; |
a49ae217 BS |
2851 | |
2852 | a = OBJECT_ALLOCNO (obj); | |
2853 | ||
1756cb66 | 2854 | if (aclass < 0) |
058e97ec | 2855 | { |
1756cb66 | 2856 | aclass = ALLOCNO_CLASS (a); |
058e97ec VM |
2857 | min = i; |
2858 | first_not_finished = i; | |
2859 | } | |
2860 | else | |
2861 | { | |
a49ae217 | 2862 | start = OBJECT_MIN (obj); |
058e97ec VM |
2863 | /* If we skip an allocno, the allocno with smaller ids will |
2864 | be also skipped because of the secondary sorting the | |
2865 | range finishes (see function | |
ac0ab4f7 | 2866 | object_range_compare_func). */ |
058e97ec | 2867 | while (first_not_finished < i |
a49ae217 | 2868 | && start > OBJECT_MAX (ira_object_id_map |
ac0ab4f7 | 2869 | [first_not_finished])) |
058e97ec VM |
2870 | first_not_finished++; |
2871 | min = first_not_finished; | |
b8698a0f | 2872 | } |
058e97ec VM |
2873 | if (min == i) |
2874 | /* We could increase min further in this case but it is good | |
2875 | enough. */ | |
2876 | min++; | |
a49ae217 BS |
2877 | live_range_min[i] = OBJECT_MIN (obj); |
2878 | OBJECT_MIN (obj) = min; | |
058e97ec VM |
2879 | } |
2880 | last_lived = (int *) ira_allocate (sizeof (int) * ira_max_point); | |
1756cb66 | 2881 | aclass = -1; |
058e97ec | 2882 | filled_area_start = -1; |
a49ae217 | 2883 | for (i = ira_objects_num - 1; i >= 0; i--) |
058e97ec | 2884 | { |
a49ae217 | 2885 | ira_object_t obj = ira_object_id_map[i]; |
1756cb66 | 2886 | |
a49ae217 | 2887 | if (obj == NULL) |
058e97ec | 2888 | continue; |
a49ae217 BS |
2889 | |
2890 | a = OBJECT_ALLOCNO (obj); | |
1756cb66 | 2891 | if (aclass < 0) |
058e97ec | 2892 | { |
1756cb66 | 2893 | aclass = ALLOCNO_CLASS (a); |
058e97ec VM |
2894 | for (j = 0; j < ira_max_point; j++) |
2895 | last_lived[j] = -1; | |
2896 | filled_area_start = ira_max_point; | |
2897 | } | |
2898 | min = live_range_min[i]; | |
a49ae217 | 2899 | finish = OBJECT_MAX (obj); |
058e97ec VM |
2900 | max = last_lived[finish]; |
2901 | if (max < 0) | |
2902 | /* We could decrease max further in this case but it is good | |
2903 | enough. */ | |
a49ae217 BS |
2904 | max = OBJECT_CONFLICT_ID (obj) - 1; |
2905 | OBJECT_MAX (obj) = max; | |
058e97ec VM |
2906 | /* In filling, we can go further A range finish to recognize |
2907 | intersection quickly because if the finish of subsequently | |
2908 | processed allocno (it has smaller conflict id) range is | |
2909 | further A range finish than they are definitely intersected | |
2910 | (the reason for this is the allocnos with bigger conflict id | |
2911 | have their range starts not smaller than allocnos with | |
2912 | smaller ids. */ | |
2913 | for (j = min; j < filled_area_start; j++) | |
2914 | last_lived[j] = i; | |
2915 | filled_area_start = min; | |
2916 | } | |
2917 | ira_free (last_lived); | |
2918 | ira_free (live_range_min); | |
ac0ab4f7 BS |
2919 | |
2920 | /* For allocnos with more than one object, we may later record extra conflicts in | |
2921 | subobject 0 that we cannot really know about here. | |
2922 | For now, simply widen the min/max range of these subobjects. */ | |
2923 | ||
2924 | word0_min = INT_MAX; | |
2925 | word0_max = INT_MIN; | |
2926 | ||
2927 | FOR_EACH_ALLOCNO (a, ai) | |
2928 | { | |
2929 | int n = ALLOCNO_NUM_OBJECTS (a); | |
2930 | ira_object_t obj0; | |
1756cb66 | 2931 | |
ac0ab4f7 BS |
2932 | if (n < 2) |
2933 | continue; | |
2934 | obj0 = ALLOCNO_OBJECT (a, 0); | |
2935 | if (OBJECT_CONFLICT_ID (obj0) < word0_min) | |
2936 | word0_min = OBJECT_CONFLICT_ID (obj0); | |
2937 | if (OBJECT_CONFLICT_ID (obj0) > word0_max) | |
2938 | word0_max = OBJECT_CONFLICT_ID (obj0); | |
2939 | } | |
2940 | FOR_EACH_ALLOCNO (a, ai) | |
2941 | { | |
2942 | int n = ALLOCNO_NUM_OBJECTS (a); | |
2943 | ira_object_t obj0; | |
1756cb66 | 2944 | |
ac0ab4f7 BS |
2945 | if (n < 2) |
2946 | continue; | |
2947 | obj0 = ALLOCNO_OBJECT (a, 0); | |
2948 | if (OBJECT_MIN (obj0) > word0_min) | |
2949 | OBJECT_MIN (obj0) = word0_min; | |
2950 | if (OBJECT_MAX (obj0) < word0_max) | |
2951 | OBJECT_MAX (obj0) = word0_max; | |
2952 | } | |
058e97ec VM |
2953 | } |
2954 | ||
2955 | \f | |
2956 | ||
2957 | static void | |
2958 | create_caps (void) | |
2959 | { | |
2960 | ira_allocno_t a; | |
2961 | ira_allocno_iterator ai; | |
2962 | ira_loop_tree_node_t loop_tree_node; | |
2963 | ||
2964 | FOR_EACH_ALLOCNO (a, ai) | |
2965 | { | |
2966 | if (ALLOCNO_LOOP_TREE_NODE (a) == ira_loop_tree_root) | |
2967 | continue; | |
2968 | if (ALLOCNO_CAP_MEMBER (a) != NULL) | |
2969 | create_cap_allocno (a); | |
2970 | else if (ALLOCNO_CAP (a) == NULL) | |
2971 | { | |
2972 | loop_tree_node = ALLOCNO_LOOP_TREE_NODE (a); | |
2973 | if (!bitmap_bit_p (loop_tree_node->border_allocnos, ALLOCNO_NUM (a))) | |
2974 | create_cap_allocno (a); | |
2975 | } | |
2976 | } | |
2977 | } | |
2978 | ||
2979 | \f | |
2980 | ||
2981 | /* The page contains code transforming more one region internal | |
2982 | representation (IR) to one region IR which is necessary for reload. | |
2983 | This transformation is called IR flattening. We might just rebuild | |
2984 | the IR for one region but we don't do it because it takes a lot of | |
2985 | time. */ | |
2986 | ||
82b33628 VM |
2987 | /* Map: regno -> allocnos which will finally represent the regno for |
2988 | IR with one region. */ | |
2989 | static ira_allocno_t *regno_top_level_allocno_map; | |
2990 | ||
029da7d4 BS |
2991 | /* Find the allocno that corresponds to A at a level one higher up in the |
2992 | loop tree. Returns NULL if A is a cap, or if it has no parent. */ | |
2993 | ira_allocno_t | |
2994 | ira_parent_allocno (ira_allocno_t a) | |
2995 | { | |
2996 | ira_loop_tree_node_t parent; | |
2997 | ||
2998 | if (ALLOCNO_CAP (a) != NULL) | |
2999 | return NULL; | |
3000 | ||
3001 | parent = ALLOCNO_LOOP_TREE_NODE (a)->parent; | |
3002 | if (parent == NULL) | |
3003 | return NULL; | |
3004 | ||
3005 | return parent->regno_allocno_map[ALLOCNO_REGNO (a)]; | |
3006 | } | |
3007 | ||
3008 | /* Find the allocno that corresponds to A at a level one higher up in the | |
3009 | loop tree. If ALLOCNO_CAP is set for A, return that. */ | |
3010 | ira_allocno_t | |
3011 | ira_parent_or_cap_allocno (ira_allocno_t a) | |
3012 | { | |
3013 | if (ALLOCNO_CAP (a) != NULL) | |
3014 | return ALLOCNO_CAP (a); | |
3015 | ||
3016 | return ira_parent_allocno (a); | |
3017 | } | |
3018 | ||
82b33628 | 3019 | /* Process all allocnos originated from pseudo REGNO and copy live |
801f03e3 VM |
3020 | ranges, hard reg conflicts, and allocno stack reg attributes from |
3021 | low level allocnos to final allocnos which are destinations of | |
3022 | removed stores at a loop exit. Return true if we copied live | |
3023 | ranges. */ | |
82b33628 | 3024 | static bool |
801f03e3 | 3025 | copy_info_to_removed_store_destinations (int regno) |
82b33628 | 3026 | { |
504b33d8 ILT |
3027 | ira_allocno_t a; |
3028 | ira_allocno_t parent_a = NULL; | |
82b33628 | 3029 | ira_loop_tree_node_t parent; |
82b33628 VM |
3030 | bool merged_p; |
3031 | ||
3032 | merged_p = false; | |
3033 | for (a = ira_regno_allocno_map[regno]; | |
3034 | a != NULL; | |
3035 | a = ALLOCNO_NEXT_REGNO_ALLOCNO (a)) | |
3036 | { | |
1756cb66 | 3037 | if (a != regno_top_level_allocno_map[REGNO (allocno_emit_reg (a))]) |
82b33628 VM |
3038 | /* This allocno will be removed. */ |
3039 | continue; | |
ac0ab4f7 | 3040 | |
82b33628 VM |
3041 | /* Caps will be removed. */ |
3042 | ira_assert (ALLOCNO_CAP_MEMBER (a) == NULL); | |
3043 | for (parent = ALLOCNO_LOOP_TREE_NODE (a)->parent; | |
3044 | parent != NULL; | |
3045 | parent = parent->parent) | |
3046 | if ((parent_a = parent->regno_allocno_map[regno]) == NULL | |
1756cb66 VM |
3047 | || (parent_a |
3048 | == regno_top_level_allocno_map[REGNO | |
3049 | (allocno_emit_reg (parent_a))] | |
3050 | && ALLOCNO_EMIT_DATA (parent_a)->mem_optimized_dest_p)) | |
82b33628 VM |
3051 | break; |
3052 | if (parent == NULL || parent_a == NULL) | |
3053 | continue; | |
ac0ab4f7 | 3054 | |
3c55880a BS |
3055 | copy_allocno_live_ranges (a, parent_a); |
3056 | merge_hard_reg_conflicts (a, parent_a, true); | |
ac0ab4f7 | 3057 | |
ea1c67e6 VM |
3058 | ALLOCNO_CALL_FREQ (parent_a) += ALLOCNO_CALL_FREQ (a); |
3059 | ALLOCNO_CALLS_CROSSED_NUM (parent_a) | |
3060 | += ALLOCNO_CALLS_CROSSED_NUM (a); | |
e384e6b5 BS |
3061 | ALLOCNO_CHEAP_CALLS_CROSSED_NUM (parent_a) |
3062 | += ALLOCNO_CHEAP_CALLS_CROSSED_NUM (a); | |
ea1c67e6 VM |
3063 | ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (parent_a) |
3064 | += ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (a); | |
82b33628 VM |
3065 | merged_p = true; |
3066 | } | |
3067 | return merged_p; | |
058e97ec VM |
3068 | } |
3069 | ||
3070 | /* Flatten the IR. In other words, this function transforms IR as if | |
3071 | it were built with one region (without loops). We could make it | |
3072 | much simpler by rebuilding IR with one region, but unfortunately it | |
3073 | takes a lot of time. MAX_REGNO_BEFORE_EMIT and | |
3074 | IRA_MAX_POINT_BEFORE_EMIT are correspondingly MAX_REG_NUM () and | |
3075 | IRA_MAX_POINT before emitting insns on the loop borders. */ | |
3076 | void | |
3077 | ira_flattening (int max_regno_before_emit, int ira_max_point_before_emit) | |
3078 | { | |
9140d27b | 3079 | int i, j; |
ea1c67e6 | 3080 | bool keep_p; |
058e97ec | 3081 | int hard_regs_num; |
82b33628 | 3082 | bool new_pseudos_p, merged_p, mem_dest_p; |
058e97ec | 3083 | unsigned int n; |
1756cb66 | 3084 | enum reg_class aclass; |
058e97ec | 3085 | ira_allocno_t a, parent_a, first, second, node_first, node_second; |
058e97ec | 3086 | ira_copy_t cp; |
029da7d4 | 3087 | ira_loop_tree_node_t node; |
b14151b5 | 3088 | live_range_t r; |
058e97ec VM |
3089 | ira_allocno_iterator ai; |
3090 | ira_copy_iterator ci; | |
058e97ec VM |
3091 | |
3092 | regno_top_level_allocno_map | |
1756cb66 VM |
3093 | = (ira_allocno_t *) ira_allocate (max_reg_num () |
3094 | * sizeof (ira_allocno_t)); | |
058e97ec VM |
3095 | memset (regno_top_level_allocno_map, 0, |
3096 | max_reg_num () * sizeof (ira_allocno_t)); | |
058e97ec | 3097 | new_pseudos_p = merged_p = false; |
0ca9fa56 VM |
3098 | FOR_EACH_ALLOCNO (a, ai) |
3099 | { | |
ac0ab4f7 BS |
3100 | ira_allocno_object_iterator oi; |
3101 | ira_object_t obj; | |
1756cb66 | 3102 | |
0ca9fa56 VM |
3103 | if (ALLOCNO_CAP_MEMBER (a) != NULL) |
3104 | /* Caps are not in the regno allocno maps and they are never | |
3105 | will be transformed into allocnos existing after IR | |
3106 | flattening. */ | |
3107 | continue; | |
ac0ab4f7 BS |
3108 | FOR_EACH_ALLOCNO_OBJECT (a, obj, oi) |
3109 | COPY_HARD_REG_SET (OBJECT_TOTAL_CONFLICT_HARD_REGS (obj), | |
3110 | OBJECT_CONFLICT_HARD_REGS (obj)); | |
0ca9fa56 VM |
3111 | #ifdef STACK_REGS |
3112 | ALLOCNO_TOTAL_NO_STACK_REG_P (a) = ALLOCNO_NO_STACK_REG_P (a); | |
3113 | #endif | |
3114 | } | |
058e97ec VM |
3115 | /* Fix final allocno attributes. */ |
3116 | for (i = max_regno_before_emit - 1; i >= FIRST_PSEUDO_REGISTER; i--) | |
3117 | { | |
0ca9fa56 | 3118 | mem_dest_p = false; |
058e97ec VM |
3119 | for (a = ira_regno_allocno_map[i]; |
3120 | a != NULL; | |
3121 | a = ALLOCNO_NEXT_REGNO_ALLOCNO (a)) | |
3122 | { | |
1756cb66 VM |
3123 | ira_emit_data_t parent_data, data = ALLOCNO_EMIT_DATA (a); |
3124 | ||
058e97ec | 3125 | ira_assert (ALLOCNO_CAP_MEMBER (a) == NULL); |
1756cb66 | 3126 | if (data->somewhere_renamed_p) |
058e97ec | 3127 | new_pseudos_p = true; |
029da7d4 BS |
3128 | parent_a = ira_parent_allocno (a); |
3129 | if (parent_a == NULL) | |
058e97ec VM |
3130 | { |
3131 | ALLOCNO_COPIES (a) = NULL; | |
1756cb66 | 3132 | regno_top_level_allocno_map[REGNO (data->reg)] = a; |
058e97ec VM |
3133 | continue; |
3134 | } | |
3135 | ira_assert (ALLOCNO_CAP_MEMBER (parent_a) == NULL); | |
b8698a0f | 3136 | |
1756cb66 | 3137 | if (data->mem_optimized_dest != NULL) |
82b33628 | 3138 | mem_dest_p = true; |
1756cb66 VM |
3139 | parent_data = ALLOCNO_EMIT_DATA (parent_a); |
3140 | if (REGNO (data->reg) == REGNO (parent_data->reg)) | |
058e97ec | 3141 | { |
3c55880a BS |
3142 | merge_hard_reg_conflicts (a, parent_a, true); |
3143 | move_allocno_live_ranges (a, parent_a); | |
058e97ec | 3144 | merged_p = true; |
1756cb66 VM |
3145 | parent_data->mem_optimized_dest_p |
3146 | = (parent_data->mem_optimized_dest_p | |
3147 | || data->mem_optimized_dest_p); | |
058e97ec VM |
3148 | continue; |
3149 | } | |
3150 | new_pseudos_p = true; | |
058e97ec VM |
3151 | for (;;) |
3152 | { | |
058e97ec VM |
3153 | ALLOCNO_NREFS (parent_a) -= ALLOCNO_NREFS (a); |
3154 | ALLOCNO_FREQ (parent_a) -= ALLOCNO_FREQ (a); | |
ea1c67e6 VM |
3155 | ALLOCNO_CALL_FREQ (parent_a) -= ALLOCNO_CALL_FREQ (a); |
3156 | ALLOCNO_CALLS_CROSSED_NUM (parent_a) | |
3157 | -= ALLOCNO_CALLS_CROSSED_NUM (a); | |
e384e6b5 BS |
3158 | ALLOCNO_CHEAP_CALLS_CROSSED_NUM (parent_a) |
3159 | -= ALLOCNO_CHEAP_CALLS_CROSSED_NUM (a); | |
ea1c67e6 VM |
3160 | ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (parent_a) |
3161 | -= ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (a); | |
058e97ec VM |
3162 | ira_assert (ALLOCNO_CALLS_CROSSED_NUM (parent_a) >= 0 |
3163 | && ALLOCNO_NREFS (parent_a) >= 0 | |
3164 | && ALLOCNO_FREQ (parent_a) >= 0); | |
1756cb66 VM |
3165 | aclass = ALLOCNO_CLASS (parent_a); |
3166 | hard_regs_num = ira_class_hard_regs_num[aclass]; | |
058e97ec VM |
3167 | if (ALLOCNO_HARD_REG_COSTS (a) != NULL |
3168 | && ALLOCNO_HARD_REG_COSTS (parent_a) != NULL) | |
3169 | for (j = 0; j < hard_regs_num; j++) | |
3170 | ALLOCNO_HARD_REG_COSTS (parent_a)[j] | |
3171 | -= ALLOCNO_HARD_REG_COSTS (a)[j]; | |
3172 | if (ALLOCNO_CONFLICT_HARD_REG_COSTS (a) != NULL | |
3173 | && ALLOCNO_CONFLICT_HARD_REG_COSTS (parent_a) != NULL) | |
3174 | for (j = 0; j < hard_regs_num; j++) | |
3175 | ALLOCNO_CONFLICT_HARD_REG_COSTS (parent_a)[j] | |
3176 | -= ALLOCNO_CONFLICT_HARD_REG_COSTS (a)[j]; | |
1756cb66 VM |
3177 | ALLOCNO_CLASS_COST (parent_a) |
3178 | -= ALLOCNO_CLASS_COST (a); | |
058e97ec | 3179 | ALLOCNO_MEMORY_COST (parent_a) -= ALLOCNO_MEMORY_COST (a); |
029da7d4 BS |
3180 | parent_a = ira_parent_allocno (parent_a); |
3181 | if (parent_a == NULL) | |
058e97ec VM |
3182 | break; |
3183 | } | |
058e97ec | 3184 | ALLOCNO_COPIES (a) = NULL; |
1756cb66 | 3185 | regno_top_level_allocno_map[REGNO (data->reg)] = a; |
058e97ec | 3186 | } |
801f03e3 | 3187 | if (mem_dest_p && copy_info_to_removed_store_destinations (i)) |
82b33628 | 3188 | merged_p = true; |
058e97ec | 3189 | } |
058e97ec VM |
3190 | ira_assert (new_pseudos_p || ira_max_point_before_emit == ira_max_point); |
3191 | if (merged_p || ira_max_point_before_emit != ira_max_point) | |
3192 | ira_rebuild_start_finish_chains (); | |
3193 | if (new_pseudos_p) | |
3194 | { | |
9140d27b BS |
3195 | sparseset objects_live; |
3196 | ||
058e97ec VM |
3197 | /* Rebuild conflicts. */ |
3198 | FOR_EACH_ALLOCNO (a, ai) | |
3199 | { | |
ac0ab4f7 BS |
3200 | ira_allocno_object_iterator oi; |
3201 | ira_object_t obj; | |
1756cb66 VM |
3202 | |
3203 | if (a != regno_top_level_allocno_map[REGNO (allocno_emit_reg (a))] | |
058e97ec VM |
3204 | || ALLOCNO_CAP_MEMBER (a) != NULL) |
3205 | continue; | |
ac0ab4f7 BS |
3206 | FOR_EACH_ALLOCNO_OBJECT (a, obj, oi) |
3207 | { | |
3208 | for (r = OBJECT_LIVE_RANGES (obj); r != NULL; r = r->next) | |
3209 | ira_assert (r->object == obj); | |
3210 | clear_conflicts (obj); | |
3211 | } | |
058e97ec | 3212 | } |
9140d27b | 3213 | objects_live = sparseset_alloc (ira_objects_num); |
058e97ec VM |
3214 | for (i = 0; i < ira_max_point; i++) |
3215 | { | |
3216 | for (r = ira_start_point_ranges[i]; r != NULL; r = r->start_next) | |
3217 | { | |
9140d27b | 3218 | ira_object_t obj = r->object; |
1756cb66 | 3219 | |
9140d27b | 3220 | a = OBJECT_ALLOCNO (obj); |
1756cb66 | 3221 | if (a != regno_top_level_allocno_map[REGNO (allocno_emit_reg (a))] |
058e97ec VM |
3222 | || ALLOCNO_CAP_MEMBER (a) != NULL) |
3223 | continue; | |
ac0ab4f7 | 3224 | |
1756cb66 | 3225 | aclass = ALLOCNO_CLASS (a); |
9140d27b BS |
3226 | sparseset_set_bit (objects_live, OBJECT_CONFLICT_ID (obj)); |
3227 | EXECUTE_IF_SET_IN_SPARSESET (objects_live, n) | |
058e97ec | 3228 | { |
9140d27b BS |
3229 | ira_object_t live_obj = ira_object_id_map[n]; |
3230 | ira_allocno_t live_a = OBJECT_ALLOCNO (live_obj); | |
1756cb66 VM |
3231 | enum reg_class live_aclass = ALLOCNO_CLASS (live_a); |
3232 | ||
3233 | if (ira_reg_classes_intersect_p[aclass][live_aclass] | |
058e97ec | 3234 | /* Don't set up conflict for the allocno with itself. */ |
9140d27b BS |
3235 | && live_a != a) |
3236 | ira_add_conflict (obj, live_obj); | |
058e97ec VM |
3237 | } |
3238 | } | |
b8698a0f | 3239 | |
058e97ec | 3240 | for (r = ira_finish_point_ranges[i]; r != NULL; r = r->finish_next) |
9140d27b | 3241 | sparseset_clear_bit (objects_live, OBJECT_CONFLICT_ID (r->object)); |
058e97ec | 3242 | } |
9140d27b | 3243 | sparseset_free (objects_live); |
058e97ec VM |
3244 | compress_conflict_vecs (); |
3245 | } | |
3246 | /* Mark some copies for removing and change allocnos in the rest | |
3247 | copies. */ | |
3248 | FOR_EACH_COPY (cp, ci) | |
3249 | { | |
3250 | if (ALLOCNO_CAP_MEMBER (cp->first) != NULL | |
3251 | || ALLOCNO_CAP_MEMBER (cp->second) != NULL) | |
3252 | { | |
3253 | if (internal_flag_ira_verbose > 4 && ira_dump_file != NULL) | |
3254 | fprintf | |
3255 | (ira_dump_file, " Remove cp%d:%c%dr%d-%c%dr%d\n", | |
3256 | cp->num, ALLOCNO_CAP_MEMBER (cp->first) != NULL ? 'c' : 'a', | |
1756cb66 VM |
3257 | ALLOCNO_NUM (cp->first), |
3258 | REGNO (allocno_emit_reg (cp->first)), | |
058e97ec | 3259 | ALLOCNO_CAP_MEMBER (cp->second) != NULL ? 'c' : 'a', |
1756cb66 VM |
3260 | ALLOCNO_NUM (cp->second), |
3261 | REGNO (allocno_emit_reg (cp->second))); | |
058e97ec VM |
3262 | cp->loop_tree_node = NULL; |
3263 | continue; | |
3264 | } | |
1756cb66 VM |
3265 | first |
3266 | = regno_top_level_allocno_map[REGNO (allocno_emit_reg (cp->first))]; | |
3267 | second | |
3268 | = regno_top_level_allocno_map[REGNO (allocno_emit_reg (cp->second))]; | |
058e97ec VM |
3269 | node = cp->loop_tree_node; |
3270 | if (node == NULL) | |
3271 | keep_p = true; /* It copy generated in ira-emit.c. */ | |
3272 | else | |
3273 | { | |
3274 | /* Check that the copy was not propagated from level on | |
3275 | which we will have different pseudos. */ | |
3276 | node_first = node->regno_allocno_map[ALLOCNO_REGNO (cp->first)]; | |
3277 | node_second = node->regno_allocno_map[ALLOCNO_REGNO (cp->second)]; | |
1756cb66 VM |
3278 | keep_p = ((REGNO (allocno_emit_reg (first)) |
3279 | == REGNO (allocno_emit_reg (node_first))) | |
3280 | && (REGNO (allocno_emit_reg (second)) | |
3281 | == REGNO (allocno_emit_reg (node_second)))); | |
058e97ec VM |
3282 | } |
3283 | if (keep_p) | |
3284 | { | |
3285 | cp->loop_tree_node = ira_loop_tree_root; | |
3286 | cp->first = first; | |
3287 | cp->second = second; | |
3288 | } | |
3289 | else | |
3290 | { | |
3291 | cp->loop_tree_node = NULL; | |
3292 | if (internal_flag_ira_verbose > 4 && ira_dump_file != NULL) | |
3293 | fprintf (ira_dump_file, " Remove cp%d:a%dr%d-a%dr%d\n", | |
3294 | cp->num, ALLOCNO_NUM (cp->first), | |
1756cb66 VM |
3295 | REGNO (allocno_emit_reg (cp->first)), |
3296 | ALLOCNO_NUM (cp->second), | |
3297 | REGNO (allocno_emit_reg (cp->second))); | |
058e97ec VM |
3298 | } |
3299 | } | |
3300 | /* Remove unnecessary allocnos on lower levels of the loop tree. */ | |
3301 | FOR_EACH_ALLOCNO (a, ai) | |
3302 | { | |
1756cb66 | 3303 | if (a != regno_top_level_allocno_map[REGNO (allocno_emit_reg (a))] |
058e97ec VM |
3304 | || ALLOCNO_CAP_MEMBER (a) != NULL) |
3305 | { | |
3306 | if (internal_flag_ira_verbose > 4 && ira_dump_file != NULL) | |
3307 | fprintf (ira_dump_file, " Remove a%dr%d\n", | |
1756cb66 | 3308 | ALLOCNO_NUM (a), REGNO (allocno_emit_reg (a))); |
3b6d1699 | 3309 | ira_remove_allocno_prefs (a); |
058e97ec VM |
3310 | finish_allocno (a); |
3311 | continue; | |
3312 | } | |
3313 | ALLOCNO_LOOP_TREE_NODE (a) = ira_loop_tree_root; | |
1756cb66 | 3314 | ALLOCNO_REGNO (a) = REGNO (allocno_emit_reg (a)); |
058e97ec | 3315 | ALLOCNO_CAP (a) = NULL; |
cb1ca6ac | 3316 | /* Restore updated costs for assignments from reload. */ |
058e97ec | 3317 | ALLOCNO_UPDATED_MEMORY_COST (a) = ALLOCNO_MEMORY_COST (a); |
1756cb66 | 3318 | ALLOCNO_UPDATED_CLASS_COST (a) = ALLOCNO_CLASS_COST (a); |
058e97ec VM |
3319 | if (! ALLOCNO_ASSIGNED_P (a)) |
3320 | ira_free_allocno_updated_costs (a); | |
3321 | ira_assert (ALLOCNO_UPDATED_HARD_REG_COSTS (a) == NULL); | |
3322 | ira_assert (ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS (a) == NULL); | |
3323 | } | |
3324 | /* Remove unnecessary copies. */ | |
3325 | FOR_EACH_COPY (cp, ci) | |
3326 | { | |
3327 | if (cp->loop_tree_node == NULL) | |
3328 | { | |
3329 | ira_copies[cp->num] = NULL; | |
3330 | finish_copy (cp); | |
3331 | continue; | |
3332 | } | |
3333 | ira_assert | |
3334 | (ALLOCNO_LOOP_TREE_NODE (cp->first) == ira_loop_tree_root | |
3335 | && ALLOCNO_LOOP_TREE_NODE (cp->second) == ira_loop_tree_root); | |
3b6d1699 VM |
3336 | add_allocno_copy_to_list (cp); |
3337 | swap_allocno_copy_ends_if_necessary (cp); | |
058e97ec VM |
3338 | } |
3339 | rebuild_regno_allocno_maps (); | |
b15a7ae6 VM |
3340 | if (ira_max_point != ira_max_point_before_emit) |
3341 | ira_compress_allocno_live_ranges (); | |
058e97ec VM |
3342 | ira_free (regno_top_level_allocno_map); |
3343 | } | |
3344 | ||
3345 | \f | |
3346 | ||
3347 | #ifdef ENABLE_IRA_CHECKING | |
3348 | /* Check creation of all allocnos. Allocnos on lower levels should | |
3349 | have allocnos or caps on all upper levels. */ | |
3350 | static void | |
3351 | check_allocno_creation (void) | |
3352 | { | |
3353 | ira_allocno_t a; | |
3354 | ira_allocno_iterator ai; | |
3355 | ira_loop_tree_node_t loop_tree_node; | |
3356 | ||
3357 | FOR_EACH_ALLOCNO (a, ai) | |
3358 | { | |
49d988e7 VM |
3359 | loop_tree_node = ALLOCNO_LOOP_TREE_NODE (a); |
3360 | ira_assert (bitmap_bit_p (loop_tree_node->all_allocnos, | |
3361 | ALLOCNO_NUM (a))); | |
3362 | if (loop_tree_node == ira_loop_tree_root) | |
058e97ec VM |
3363 | continue; |
3364 | if (ALLOCNO_CAP_MEMBER (a) != NULL) | |
49d988e7 | 3365 | ira_assert (ALLOCNO_CAP (a) != NULL); |
058e97ec | 3366 | else if (ALLOCNO_CAP (a) == NULL) |
49d988e7 VM |
3367 | ira_assert (loop_tree_node->parent |
3368 | ->regno_allocno_map[ALLOCNO_REGNO (a)] != NULL | |
3369 | && bitmap_bit_p (loop_tree_node->border_allocnos, | |
3370 | ALLOCNO_NUM (a))); | |
058e97ec VM |
3371 | } |
3372 | } | |
3373 | #endif | |
3374 | ||
4ac293e2 VM |
3375 | /* Identify allocnos which prefer a register class with a single hard register. |
3376 | Adjust ALLOCNO_CONFLICT_HARD_REG_COSTS so that conflicting allocnos are | |
3377 | less likely to use the preferred singleton register. */ | |
3378 | static void | |
3379 | update_conflict_hard_reg_costs (void) | |
3380 | { | |
3381 | ira_allocno_t a; | |
3382 | ira_allocno_iterator ai; | |
3383 | int i, index, min; | |
3384 | ||
3385 | FOR_EACH_ALLOCNO (a, ai) | |
3386 | { | |
6f76a878 AS |
3387 | reg_class_t aclass = ALLOCNO_CLASS (a); |
3388 | reg_class_t pref = reg_preferred_class (ALLOCNO_REGNO (a)); | |
c9d74da6 RS |
3389 | int singleton = ira_class_singleton[pref][ALLOCNO_MODE (a)]; |
3390 | if (singleton < 0) | |
4ac293e2 | 3391 | continue; |
c9d74da6 | 3392 | index = ira_class_hard_reg_index[(int) aclass][singleton]; |
4ac293e2 VM |
3393 | if (index < 0) |
3394 | continue; | |
3395 | if (ALLOCNO_CONFLICT_HARD_REG_COSTS (a) == NULL | |
3396 | || ALLOCNO_HARD_REG_COSTS (a) == NULL) | |
3397 | continue; | |
3398 | min = INT_MAX; | |
6f76a878 | 3399 | for (i = ira_class_hard_regs_num[(int) aclass] - 1; i >= 0; i--) |
1756cb66 | 3400 | if (ALLOCNO_HARD_REG_COSTS (a)[i] > ALLOCNO_CLASS_COST (a) |
4ac293e2 VM |
3401 | && min > ALLOCNO_HARD_REG_COSTS (a)[i]) |
3402 | min = ALLOCNO_HARD_REG_COSTS (a)[i]; | |
3403 | if (min == INT_MAX) | |
3404 | continue; | |
3405 | ira_allocate_and_set_costs (&ALLOCNO_CONFLICT_HARD_REG_COSTS (a), | |
1756cb66 | 3406 | aclass, 0); |
4ac293e2 | 3407 | ALLOCNO_CONFLICT_HARD_REG_COSTS (a)[index] |
1756cb66 | 3408 | -= min - ALLOCNO_CLASS_COST (a); |
4ac293e2 VM |
3409 | } |
3410 | } | |
3411 | ||
058e97ec | 3412 | /* Create a internal representation (IR) for IRA (allocnos, copies, |
2608d841 VM |
3413 | loop tree nodes). The function returns TRUE if we generate loop |
3414 | structure (besides nodes representing all function and the basic | |
3415 | blocks) for regional allocation. A true return means that we | |
3416 | really need to flatten IR before the reload. */ | |
058e97ec | 3417 | bool |
2608d841 | 3418 | ira_build (void) |
058e97ec | 3419 | { |
2608d841 | 3420 | bool loops_p; |
058e97ec | 3421 | |
2608d841 | 3422 | df_analyze (); |
058e97ec VM |
3423 | initiate_cost_vectors (); |
3424 | initiate_allocnos (); | |
3b6d1699 | 3425 | initiate_prefs (); |
058e97ec | 3426 | initiate_copies (); |
2608d841 | 3427 | create_loop_tree_nodes (); |
058e97ec VM |
3428 | form_loop_tree (); |
3429 | create_allocnos (); | |
3430 | ira_costs (); | |
a49ae217 | 3431 | create_allocno_objects (); |
058e97ec | 3432 | ira_create_allocno_live_ranges (); |
311aab06 | 3433 | remove_unnecessary_regions (false); |
b15a7ae6 | 3434 | ira_compress_allocno_live_ranges (); |
927425df | 3435 | update_bad_spill_attribute (); |
058e97ec VM |
3436 | loops_p = more_one_region_p (); |
3437 | if (loops_p) | |
3438 | { | |
3439 | propagate_allocno_info (); | |
3440 | create_caps (); | |
3441 | } | |
1756cb66 | 3442 | ira_tune_allocno_costs (); |
058e97ec VM |
3443 | #ifdef ENABLE_IRA_CHECKING |
3444 | check_allocno_creation (); | |
3445 | #endif | |
3446 | setup_min_max_allocno_live_range_point (); | |
a49ae217 | 3447 | sort_conflict_id_map (); |
058e97ec VM |
3448 | setup_min_max_conflict_allocno_ids (); |
3449 | ira_build_conflicts (); | |
4ac293e2 | 3450 | update_conflict_hard_reg_costs (); |
311aab06 VM |
3451 | if (! ira_conflicts_p) |
3452 | { | |
3453 | ira_allocno_t a; | |
3454 | ira_allocno_iterator ai; | |
3455 | ||
3456 | /* Remove all regions but root one. */ | |
3457 | if (loops_p) | |
3458 | { | |
3459 | remove_unnecessary_regions (true); | |
3460 | loops_p = false; | |
3461 | } | |
3462 | /* We don't save hard registers around calls for fast allocation | |
3463 | -- add caller clobbered registers as conflicting ones to | |
3464 | allocno crossing calls. */ | |
3465 | FOR_EACH_ALLOCNO (a, ai) | |
3466 | if (ALLOCNO_CALLS_CROSSED_NUM (a) != 0) | |
ac0ab4f7 | 3467 | ior_hard_reg_conflicts (a, &call_used_reg_set); |
311aab06 | 3468 | } |
4cda38d5 VM |
3469 | if (internal_flag_ira_verbose > 2 && ira_dump_file != NULL) |
3470 | print_copies (ira_dump_file); | |
3b6d1699 VM |
3471 | if (internal_flag_ira_verbose > 2 && ira_dump_file != NULL) |
3472 | print_prefs (ira_dump_file); | |
058e97ec VM |
3473 | if (internal_flag_ira_verbose > 0 && ira_dump_file != NULL) |
3474 | { | |
ac0ab4f7 | 3475 | int n, nr, nr_big; |
058e97ec | 3476 | ira_allocno_t a; |
b14151b5 | 3477 | live_range_t r; |
058e97ec VM |
3478 | ira_allocno_iterator ai; |
3479 | ||
3480 | n = 0; | |
ac0ab4f7 BS |
3481 | nr = 0; |
3482 | nr_big = 0; | |
058e97ec | 3483 | FOR_EACH_ALLOCNO (a, ai) |
a49ae217 | 3484 | { |
ac0ab4f7 | 3485 | int j, nobj = ALLOCNO_NUM_OBJECTS (a); |
1756cb66 | 3486 | |
ac0ab4f7 BS |
3487 | if (nobj > 1) |
3488 | nr_big++; | |
3489 | for (j = 0; j < nobj; j++) | |
3490 | { | |
3491 | ira_object_t obj = ALLOCNO_OBJECT (a, j); | |
3492 | n += OBJECT_NUM_CONFLICTS (obj); | |
3493 | for (r = OBJECT_LIVE_RANGES (obj); r != NULL; r = r->next) | |
3494 | nr++; | |
3495 | } | |
a49ae217 | 3496 | } |
058e97ec | 3497 | fprintf (ira_dump_file, " regions=%d, blocks=%d, points=%d\n", |
0fc822d0 | 3498 | current_loops == NULL ? 1 : number_of_loops (cfun), |
0cae8d31 | 3499 | n_basic_blocks_for_fn (cfun), ira_max_point); |
058e97ec | 3500 | fprintf (ira_dump_file, |
ac0ab4f7 BS |
3501 | " allocnos=%d (big %d), copies=%d, conflicts=%d, ranges=%d\n", |
3502 | ira_allocnos_num, nr_big, ira_copies_num, n, nr); | |
058e97ec VM |
3503 | } |
3504 | return loops_p; | |
3505 | } | |
3506 | ||
3507 | /* Release the data created by function ira_build. */ | |
3508 | void | |
3509 | ira_destroy (void) | |
3510 | { | |
3511 | finish_loop_tree_nodes (); | |
3b6d1699 | 3512 | finish_prefs (); |
058e97ec VM |
3513 | finish_copies (); |
3514 | finish_allocnos (); | |
3515 | finish_cost_vectors (); | |
3516 | ira_finish_allocno_live_ranges (); | |
3517 | } |