]>
Commit | Line | Data |
---|---|---|
2f138c1c | 1 | /* CPU mode switching |
3aea1f79 | 2 | Copyright (C) 1998-2014 Free Software Foundation, Inc. |
2f138c1c | 3 | |
4 | This file is part of GCC. | |
5 | ||
6 | GCC is free software; you can redistribute it and/or modify it under | |
7 | the terms of the GNU General Public License as published by the Free | |
8c4c00c1 | 8 | Software Foundation; either version 3, or (at your option) any later |
2f138c1c | 9 | version. |
10 | ||
11 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
12 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
14 | for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
8c4c00c1 | 17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
2f138c1c | 19 | |
20 | #include "config.h" | |
21 | #include "system.h" | |
22 | #include "coretypes.h" | |
23 | #include "tm.h" | |
e1ce1485 | 24 | #include "target.h" |
2f138c1c | 25 | #include "rtl.h" |
26 | #include "regs.h" | |
27 | #include "hard-reg-set.h" | |
28 | #include "flags.h" | |
2f138c1c | 29 | #include "insn-config.h" |
30 | #include "recog.h" | |
31 | #include "basic-block.h" | |
2f138c1c | 32 | #include "tm_p.h" |
33 | #include "function.h" | |
77fce4cd | 34 | #include "tree-pass.h" |
3072d30e | 35 | #include "df.h" |
06f9d6ef | 36 | #include "emit-rtl.h" |
2f138c1c | 37 | |
38 | /* We want target macros for the mode switching code to be able to refer | |
39 | to instruction attribute values. */ | |
40 | #include "insn-attr.h" | |
41 | ||
42 | #ifdef OPTIMIZE_MODE_SWITCHING | |
43 | ||
44 | /* The algorithm for setting the modes consists of scanning the insn list | |
45 | and finding all the insns which require a specific mode. Each insn gets | |
46 | a unique struct seginfo element. These structures are inserted into a list | |
47 | for each basic block. For each entity, there is an array of bb_info over | |
78985618 | 48 | the flow graph basic blocks (local var 'bb_info'), which contains a list |
2f138c1c | 49 | of all insns within that basic block, in the order they are encountered. |
50 | ||
51 | For each entity, any basic block WITHOUT any insns requiring a specific | |
78985618 | 52 | mode are given a single entry without a mode (each basic block in the |
53 | flow graph must have at least one entry in the segment table). | |
2f138c1c | 54 | |
55 | The LCM algorithm is then run over the flow graph to determine where to | |
78985618 | 56 | place the sets to the highest-priority mode with respect to the first |
2f138c1c | 57 | insn in any one block. Any adjustments required to the transparency |
58 | vectors are made, then the next iteration starts for the next-lower | |
59 | priority mode, till for each entity all modes are exhausted. | |
60 | ||
78985618 | 61 | More details can be found in the code of optimize_mode_switching. */ |
2f138c1c | 62 | \f |
63 | /* This structure contains the information for each insn which requires | |
64 | either single or double mode to be set. | |
65 | MODE is the mode this insn must be executed in. | |
66 | INSN_PTR is the insn to be executed (may be the note that marks the | |
67 | beginning of a basic block). | |
68 | BBNUM is the flow graph basic block this insn occurs in. | |
69 | NEXT is the next insn in the same basic block. */ | |
70 | struct seginfo | |
71 | { | |
72 | int mode; | |
d024774f | 73 | rtx_insn *insn_ptr; |
2f138c1c | 74 | int bbnum; |
75 | struct seginfo *next; | |
76 | HARD_REG_SET regs_live; | |
77 | }; | |
78 | ||
79 | struct bb_info | |
80 | { | |
81 | struct seginfo *seginfo; | |
82 | int computing; | |
7fc0df2f | 83 | int mode_out; |
84 | int mode_in; | |
2f138c1c | 85 | }; |
86 | ||
d024774f | 87 | static struct seginfo * new_seginfo (int, rtx_insn *, int, HARD_REG_SET); |
2f138c1c | 88 | static void add_seginfo (struct bb_info *, struct seginfo *); |
0ff4fe1d | 89 | static void reg_dies (rtx, HARD_REG_SET *); |
81a410b1 | 90 | static void reg_becomes_live (rtx, const_rtx, void *); |
2f138c1c | 91 | |
7fc0df2f | 92 | /* Clear ode I from entity J in bitmap B. */ |
93 | #define clear_mode_bit(b, j, i) \ | |
94 | bitmap_clear_bit (b, (j * max_num_modes) + i) | |
95 | ||
96 | /* Test mode I from entity J in bitmap B. */ | |
97 | #define mode_bit_p(b, j, i) \ | |
98 | bitmap_bit_p (b, (j * max_num_modes) + i) | |
99 | ||
100 | /* Set mode I from entity J in bitmal B. */ | |
101 | #define set_mode_bit(b, j, i) \ | |
102 | bitmap_set_bit (b, (j * max_num_modes) + i) | |
103 | ||
104 | /* Emit modes segments from EDGE_LIST associated with entity E. | |
105 | INFO gives mode availability for each mode. */ | |
106 | ||
107 | static bool | |
108 | commit_mode_sets (struct edge_list *edge_list, int e, struct bb_info *info) | |
109 | { | |
110 | bool need_commit = false; | |
111 | ||
112 | for (int ed = NUM_EDGES (edge_list) - 1; ed >= 0; ed--) | |
113 | { | |
114 | edge eg = INDEX_EDGE (edge_list, ed); | |
115 | int mode; | |
116 | ||
117 | if ((mode = (int)(intptr_t)(eg->aux)) != -1) | |
118 | { | |
119 | HARD_REG_SET live_at_edge; | |
120 | basic_block src_bb = eg->src; | |
121 | int cur_mode = info[src_bb->index].mode_out; | |
122 | rtx mode_set; | |
123 | ||
124 | REG_SET_TO_HARD_REG_SET (live_at_edge, df_get_live_out (src_bb)); | |
125 | ||
126 | rtl_profile_for_edge (eg); | |
127 | start_sequence (); | |
128 | ||
129 | targetm.mode_switching.emit (e, mode, cur_mode, live_at_edge); | |
130 | ||
131 | mode_set = get_insns (); | |
132 | end_sequence (); | |
133 | default_rtl_profile (); | |
134 | ||
135 | /* Do not bother to insert empty sequence. */ | |
136 | if (mode_set == NULL_RTX) | |
137 | continue; | |
138 | ||
139 | /* We should not get an abnormal edge here. */ | |
140 | gcc_assert (! (eg->flags & EDGE_ABNORMAL)); | |
141 | ||
142 | need_commit = true; | |
143 | insert_insn_on_edge (mode_set, eg); | |
144 | } | |
145 | } | |
146 | ||
147 | return need_commit; | |
148 | } | |
149 | ||
150 | /* Allocate a new BBINFO structure, initialized with the MODE, INSN, | |
151 | and basic block BB parameters. | |
6d0a5596 | 152 | INSN may not be a NOTE_INSN_BASIC_BLOCK, unless it is an empty |
153 | basic block; that allows us later to insert instructions in a FIFO-like | |
154 | manner. */ | |
2f138c1c | 155 | |
156 | static struct seginfo * | |
d024774f | 157 | new_seginfo (int mode, rtx_insn *insn, int bb, HARD_REG_SET regs_live) |
2f138c1c | 158 | { |
159 | struct seginfo *ptr; | |
6d0a5596 | 160 | |
161 | gcc_assert (!NOTE_INSN_BASIC_BLOCK_P (insn) | |
162 | || insn == BB_END (NOTE_BASIC_BLOCK (insn))); | |
4c36ffe6 | 163 | ptr = XNEW (struct seginfo); |
2f138c1c | 164 | ptr->mode = mode; |
165 | ptr->insn_ptr = insn; | |
166 | ptr->bbnum = bb; | |
167 | ptr->next = NULL; | |
168 | COPY_HARD_REG_SET (ptr->regs_live, regs_live); | |
169 | return ptr; | |
170 | } | |
171 | ||
172 | /* Add a seginfo element to the end of a list. | |
173 | HEAD is a pointer to the list beginning. | |
174 | INFO is the structure to be linked in. */ | |
175 | ||
176 | static void | |
177 | add_seginfo (struct bb_info *head, struct seginfo *info) | |
178 | { | |
179 | struct seginfo *ptr; | |
180 | ||
181 | if (head->seginfo == NULL) | |
182 | head->seginfo = info; | |
183 | else | |
184 | { | |
185 | ptr = head->seginfo; | |
186 | while (ptr->next != NULL) | |
187 | ptr = ptr->next; | |
188 | ptr->next = info; | |
189 | } | |
190 | } | |
191 | ||
2f138c1c | 192 | /* Record in LIVE that register REG died. */ |
193 | ||
194 | static void | |
0ff4fe1d | 195 | reg_dies (rtx reg, HARD_REG_SET *live) |
2f138c1c | 196 | { |
a2c6f0b7 | 197 | int regno; |
2f138c1c | 198 | |
199 | if (!REG_P (reg)) | |
200 | return; | |
201 | ||
202 | regno = REGNO (reg); | |
203 | if (regno < FIRST_PSEUDO_REGISTER) | |
a2c6f0b7 | 204 | remove_from_hard_reg_set (live, GET_MODE (reg), regno); |
2f138c1c | 205 | } |
206 | ||
207 | /* Record in LIVE that register REG became live. | |
208 | This is called via note_stores. */ | |
209 | ||
210 | static void | |
81a410b1 | 211 | reg_becomes_live (rtx reg, const_rtx setter ATTRIBUTE_UNUSED, void *live) |
2f138c1c | 212 | { |
a2c6f0b7 | 213 | int regno; |
2f138c1c | 214 | |
215 | if (GET_CODE (reg) == SUBREG) | |
216 | reg = SUBREG_REG (reg); | |
217 | ||
218 | if (!REG_P (reg)) | |
219 | return; | |
220 | ||
221 | regno = REGNO (reg); | |
222 | if (regno < FIRST_PSEUDO_REGISTER) | |
a2c6f0b7 | 223 | add_to_hard_reg_set ((HARD_REG_SET *) live, GET_MODE (reg), regno); |
2f138c1c | 224 | } |
225 | ||
2f138c1c | 226 | /* Split the fallthrough edge to the exit block, so that we can note |
227 | that there NORMAL_MODE is required. Return the new block if it's | |
228 | inserted before the exit block. Otherwise return null. */ | |
229 | ||
230 | static basic_block | |
231 | create_pre_exit (int n_entities, int *entity_map, const int *num_modes) | |
232 | { | |
233 | edge eg; | |
234 | edge_iterator ei; | |
235 | basic_block pre_exit; | |
236 | ||
237 | /* The only non-call predecessor at this stage is a block with a | |
238 | fallthrough edge; there can be at most one, but there could be | |
239 | none at all, e.g. when exit is called. */ | |
240 | pre_exit = 0; | |
34154e27 | 241 | FOR_EACH_EDGE (eg, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds) |
2f138c1c | 242 | if (eg->flags & EDGE_FALLTHRU) |
243 | { | |
244 | basic_block src_bb = eg->src; | |
d024774f | 245 | rtx_insn *last_insn; |
246 | rtx ret_reg; | |
2f138c1c | 247 | |
248 | gcc_assert (!pre_exit); | |
249 | /* If this function returns a value at the end, we have to | |
250 | insert the final mode switch before the return value copy | |
251 | to its hard register. */ | |
34154e27 | 252 | if (EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds) == 1 |
2f138c1c | 253 | && NONJUMP_INSN_P ((last_insn = BB_END (src_bb))) |
254 | && GET_CODE (PATTERN (last_insn)) == USE | |
255 | && GET_CODE ((ret_reg = XEXP (PATTERN (last_insn), 0))) == REG) | |
256 | { | |
257 | int ret_start = REGNO (ret_reg); | |
258 | int nregs = hard_regno_nregs[ret_start][GET_MODE (ret_reg)]; | |
259 | int ret_end = ret_start + nregs; | |
c9c236e7 | 260 | bool short_block = false; |
261 | bool multi_reg_return = false; | |
262 | bool forced_late_switch = false; | |
d024774f | 263 | rtx_insn *before_return_copy; |
2f138c1c | 264 | |
265 | do | |
266 | { | |
d024774f | 267 | rtx_insn *return_copy = PREV_INSN (last_insn); |
2f138c1c | 268 | rtx return_copy_pat, copy_reg; |
269 | int copy_start, copy_num; | |
270 | int j; | |
271 | ||
8c94ea57 | 272 | if (NONDEBUG_INSN_P (return_copy)) |
2f138c1c | 273 | { |
1915b15f | 274 | /* When using SJLJ exceptions, the call to the |
275 | unregister function is inserted between the | |
276 | clobber of the return value and the copy. | |
277 | We do not want to split the block before this | |
278 | or any other call; if we have not found the | |
279 | copy yet, the copy must have been deleted. */ | |
280 | if (CALL_P (return_copy)) | |
281 | { | |
c9c236e7 | 282 | short_block = true; |
1915b15f | 283 | break; |
284 | } | |
646857a5 | 285 | return_copy_pat = PATTERN (return_copy); |
286 | switch (GET_CODE (return_copy_pat)) | |
8801c4fd | 287 | { |
646857a5 | 288 | case USE: |
c9c236e7 | 289 | /* Skip USEs of multiple return registers. |
290 | __builtin_apply pattern is also handled here. */ | |
646857a5 | 291 | if (GET_CODE (XEXP (return_copy_pat, 0)) == REG |
e1ce1485 | 292 | && (targetm.calls.function_value_regno_p |
646857a5 | 293 | (REGNO (XEXP (return_copy_pat, 0))))) |
294 | { | |
c9c236e7 | 295 | multi_reg_return = true; |
646857a5 | 296 | last_insn = return_copy; |
297 | continue; | |
298 | } | |
299 | break; | |
300 | ||
301 | case ASM_OPERANDS: | |
302 | /* Skip barrier insns. */ | |
303 | if (!MEM_VOLATILE_P (return_copy_pat)) | |
304 | break; | |
305 | ||
306 | /* Fall through. */ | |
307 | ||
308 | case ASM_INPUT: | |
309 | case UNSPEC_VOLATILE: | |
8801c4fd | 310 | last_insn = return_copy; |
311 | continue; | |
646857a5 | 312 | |
313 | default: | |
314 | break; | |
8801c4fd | 315 | } |
646857a5 | 316 | |
2f138c1c | 317 | /* If the return register is not (in its entirety) |
318 | likely spilled, the return copy might be | |
319 | partially or completely optimized away. */ | |
320 | return_copy_pat = single_set (return_copy); | |
321 | if (!return_copy_pat) | |
322 | { | |
323 | return_copy_pat = PATTERN (return_copy); | |
324 | if (GET_CODE (return_copy_pat) != CLOBBER) | |
325 | break; | |
3072d30e | 326 | else if (!optimize) |
327 | { | |
328 | /* This might be (clobber (reg [<result>])) | |
329 | when not optimizing. Then check if | |
330 | the previous insn is the clobber for | |
331 | the return register. */ | |
332 | copy_reg = SET_DEST (return_copy_pat); | |
333 | if (GET_CODE (copy_reg) == REG | |
334 | && !HARD_REGISTER_NUM_P (REGNO (copy_reg))) | |
335 | { | |
336 | if (INSN_P (PREV_INSN (return_copy))) | |
337 | { | |
338 | return_copy = PREV_INSN (return_copy); | |
339 | return_copy_pat = PATTERN (return_copy); | |
340 | if (GET_CODE (return_copy_pat) != CLOBBER) | |
341 | break; | |
342 | } | |
343 | } | |
344 | } | |
2f138c1c | 345 | } |
346 | copy_reg = SET_DEST (return_copy_pat); | |
347 | if (GET_CODE (copy_reg) == REG) | |
348 | copy_start = REGNO (copy_reg); | |
349 | else if (GET_CODE (copy_reg) == SUBREG | |
350 | && GET_CODE (SUBREG_REG (copy_reg)) == REG) | |
351 | copy_start = REGNO (SUBREG_REG (copy_reg)); | |
352 | else | |
419e5c35 | 353 | { |
354 | /* When control reaches end of non-void function, | |
355 | there are no return copy insns at all. This | |
356 | avoids an ice on that invalid function. */ | |
357 | if (ret_start + nregs == ret_end) | |
c9c236e7 | 358 | short_block = true; |
419e5c35 | 359 | break; |
360 | } | |
3f988ca9 | 361 | if (!targetm.calls.function_value_regno_p (copy_start)) |
39be9d26 | 362 | copy_num = 0; |
363 | else | |
364 | copy_num | |
365 | = hard_regno_nregs[copy_start][GET_MODE (copy_reg)]; | |
2f138c1c | 366 | |
367 | /* If the return register is not likely spilled, - as is | |
368 | the case for floating point on SH4 - then it might | |
369 | be set by an arithmetic operation that needs a | |
370 | different mode than the exit block. */ | |
371 | for (j = n_entities - 1; j >= 0; j--) | |
372 | { | |
373 | int e = entity_map[j]; | |
cea19dab | 374 | int mode = |
375 | targetm.mode_switching.needed (e, return_copy); | |
2f138c1c | 376 | |
cea19dab | 377 | if (mode != num_modes[e] |
378 | && mode != targetm.mode_switching.exit (e)) | |
2f138c1c | 379 | break; |
380 | } | |
381 | if (j >= 0) | |
382 | { | |
9cb7855c | 383 | /* __builtin_return emits a sequence of loads to all |
384 | return registers. One of them might require | |
385 | another mode than MODE_EXIT, even if it is | |
386 | unrelated to the return value, so we want to put | |
387 | the final mode switch after it. */ | |
c9c236e7 | 388 | if (multi_reg_return |
9cb7855c | 389 | && targetm.calls.function_value_regno_p |
390 | (copy_start)) | |
c9c236e7 | 391 | forced_late_switch = true; |
9cb7855c | 392 | |
2f138c1c | 393 | /* For the SH4, floating point loads depend on fpscr, |
394 | thus we might need to put the final mode switch | |
395 | after the return value copy. That is still OK, | |
396 | because a floating point return value does not | |
397 | conflict with address reloads. */ | |
398 | if (copy_start >= ret_start | |
399 | && copy_start + copy_num <= ret_end | |
400 | && OBJECT_P (SET_SRC (return_copy_pat))) | |
c9c236e7 | 401 | forced_late_switch = true; |
2f138c1c | 402 | break; |
403 | } | |
39be9d26 | 404 | if (copy_num == 0) |
405 | { | |
406 | last_insn = return_copy; | |
407 | continue; | |
408 | } | |
2f138c1c | 409 | |
410 | if (copy_start >= ret_start | |
411 | && copy_start + copy_num <= ret_end) | |
412 | nregs -= copy_num; | |
c9c236e7 | 413 | else if (!multi_reg_return |
e1ce1485 | 414 | || !targetm.calls.function_value_regno_p |
415 | (copy_start)) | |
2f138c1c | 416 | break; |
417 | last_insn = return_copy; | |
418 | } | |
419 | /* ??? Exception handling can lead to the return value | |
420 | copy being already separated from the return value use, | |
421 | as in unwind-dw2.c . | |
422 | Similarly, conditionally returning without a value, | |
423 | and conditionally using builtin_return can lead to an | |
424 | isolated use. */ | |
425 | if (return_copy == BB_HEAD (src_bb)) | |
426 | { | |
c9c236e7 | 427 | short_block = true; |
2f138c1c | 428 | break; |
429 | } | |
430 | last_insn = return_copy; | |
431 | } | |
432 | while (nregs); | |
48e1416a | 433 | |
2f138c1c | 434 | /* If we didn't see a full return value copy, verify that there |
435 | is a plausible reason for this. If some, but not all of the | |
436 | return register is likely spilled, we can expect that there | |
437 | is a copy for the likely spilled part. */ | |
438 | gcc_assert (!nregs | |
439 | || forced_late_switch | |
440 | || short_block | |
24dd0668 | 441 | || !(targetm.class_likely_spilled_p |
2f138c1c | 442 | (REGNO_REG_CLASS (ret_start))) |
443 | || (nregs | |
444 | != hard_regno_nregs[ret_start][GET_MODE (ret_reg)]) | |
445 | /* For multi-hard-register floating point | |
446 | values, sometimes the likely-spilled part | |
447 | is ordinarily copied first, then the other | |
448 | part is set with an arithmetic operation. | |
449 | This doesn't actually cause reload | |
450 | failures, so let it pass. */ | |
451 | || (GET_MODE_CLASS (GET_MODE (ret_reg)) != MODE_INT | |
452 | && nregs != 1)); | |
48e1416a | 453 | |
4da102b5 | 454 | if (!NOTE_INSN_BASIC_BLOCK_P (last_insn)) |
2f138c1c | 455 | { |
456 | before_return_copy | |
457 | = emit_note_before (NOTE_INSN_DELETED, last_insn); | |
458 | /* Instructions preceding LAST_INSN in the same block might | |
459 | require a different mode than MODE_EXIT, so if we might | |
460 | have such instructions, keep them in a separate block | |
461 | from pre_exit. */ | |
4da102b5 | 462 | src_bb = split_block (src_bb, |
463 | PREV_INSN (before_return_copy))->dest; | |
2f138c1c | 464 | } |
465 | else | |
466 | before_return_copy = last_insn; | |
467 | pre_exit = split_block (src_bb, before_return_copy)->src; | |
468 | } | |
469 | else | |
470 | { | |
471 | pre_exit = split_edge (eg); | |
2f138c1c | 472 | } |
473 | } | |
474 | ||
475 | return pre_exit; | |
476 | } | |
2f138c1c | 477 | |
478 | /* Find all insns that need a particular mode setting, and insert the | |
479 | necessary mode switches. Return true if we did work. */ | |
480 | ||
9d31a126 | 481 | static int |
3f5be5f4 | 482 | optimize_mode_switching (void) |
2f138c1c | 483 | { |
2f138c1c | 484 | int e; |
485 | basic_block bb; | |
7fc0df2f | 486 | bool need_commit = false; |
2f138c1c | 487 | static const int num_modes[] = NUM_MODES_FOR_MODE_SWITCHING; |
488 | #define N_ENTITIES ARRAY_SIZE (num_modes) | |
489 | int entity_map[N_ENTITIES]; | |
490 | struct bb_info *bb_info[N_ENTITIES]; | |
491 | int i, j; | |
7fc0df2f | 492 | int n_entities = 0; |
2f138c1c | 493 | int max_num_modes = 0; |
9d75589a | 494 | bool emitted ATTRIBUTE_UNUSED = false; |
cea19dab | 495 | basic_block post_entry = 0; |
496 | basic_block pre_exit = 0; | |
7fc0df2f | 497 | struct edge_list *edge_list = 0; |
498 | ||
499 | /* These bitmaps are used for the LCM algorithm. */ | |
500 | sbitmap *kill, *del, *insert, *antic, *transp, *comp; | |
501 | sbitmap *avin, *avout; | |
2f138c1c | 502 | |
7fc0df2f | 503 | for (e = N_ENTITIES - 1; e >= 0; e--) |
2f138c1c | 504 | if (OPTIMIZE_MODE_SWITCHING (e)) |
505 | { | |
506 | int entry_exit_extra = 0; | |
507 | ||
508 | /* Create the list of segments within each basic block. | |
509 | If NORMAL_MODE is defined, allow for two extra | |
510 | blocks split from the entry and exit block. */ | |
cea19dab | 511 | if (targetm.mode_switching.entry && targetm.mode_switching.exit) |
512 | entry_exit_extra = 3; | |
513 | ||
2f138c1c | 514 | bb_info[n_entities] |
fe672ac0 | 515 | = XCNEWVEC (struct bb_info, |
516 | last_basic_block_for_fn (cfun) + entry_exit_extra); | |
2f138c1c | 517 | entity_map[n_entities++] = e; |
518 | if (num_modes[e] > max_num_modes) | |
519 | max_num_modes = num_modes[e]; | |
520 | } | |
521 | ||
522 | if (! n_entities) | |
523 | return 0; | |
524 | ||
7fc0df2f | 525 | /* Make sure if MODE_ENTRY is defined MODE_EXIT is defined. */ |
cea19dab | 526 | gcc_assert ((targetm.mode_switching.entry && targetm.mode_switching.exit) |
7fc0df2f | 527 | || (!targetm.mode_switching.entry |
528 | && !targetm.mode_switching.exit)); | |
cea19dab | 529 | |
530 | if (targetm.mode_switching.entry && targetm.mode_switching.exit) | |
531 | { | |
532 | /* Split the edge from the entry block, so that we can note that | |
533 | there NORMAL_MODE is supplied. */ | |
534 | post_entry = split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun))); | |
535 | pre_exit = create_pre_exit (n_entities, entity_map, num_modes); | |
536 | } | |
2f138c1c | 537 | |
3072d30e | 538 | df_analyze (); |
539 | ||
2f138c1c | 540 | /* Create the bitmap vectors. */ |
7fc0df2f | 541 | antic = sbitmap_vector_alloc (last_basic_block_for_fn (cfun), |
542 | n_entities * max_num_modes); | |
543 | transp = sbitmap_vector_alloc (last_basic_block_for_fn (cfun), | |
544 | n_entities * max_num_modes); | |
545 | comp = sbitmap_vector_alloc (last_basic_block_for_fn (cfun), | |
546 | n_entities * max_num_modes); | |
547 | avin = sbitmap_vector_alloc (last_basic_block_for_fn (cfun), | |
548 | n_entities * max_num_modes); | |
549 | avout = sbitmap_vector_alloc (last_basic_block_for_fn (cfun), | |
550 | n_entities * max_num_modes); | |
551 | kill = sbitmap_vector_alloc (last_basic_block_for_fn (cfun), | |
552 | n_entities * max_num_modes); | |
2f138c1c | 553 | |
fe672ac0 | 554 | bitmap_vector_ones (transp, last_basic_block_for_fn (cfun)); |
7fc0df2f | 555 | bitmap_vector_clear (antic, last_basic_block_for_fn (cfun)); |
556 | bitmap_vector_clear (comp, last_basic_block_for_fn (cfun)); | |
2f138c1c | 557 | |
558 | for (j = n_entities - 1; j >= 0; j--) | |
559 | { | |
560 | int e = entity_map[j]; | |
561 | int no_mode = num_modes[e]; | |
562 | struct bb_info *info = bb_info[j]; | |
d024774f | 563 | rtx_insn *insn; |
2f138c1c | 564 | |
565 | /* Determine what the first use (if any) need for a mode of entity E is. | |
566 | This will be the mode that is anticipatable for this block. | |
567 | Also compute the initial transparency settings. */ | |
fc00614f | 568 | FOR_EACH_BB_FN (bb, cfun) |
2f138c1c | 569 | { |
570 | struct seginfo *ptr; | |
571 | int last_mode = no_mode; | |
aadec354 | 572 | bool any_set_required = false; |
2f138c1c | 573 | HARD_REG_SET live_now; |
574 | ||
7fc0df2f | 575 | info[bb->index].mode_out = info[bb->index].mode_in = no_mode; |
576 | ||
3072d30e | 577 | REG_SET_TO_HARD_REG_SET (live_now, df_get_live_in (bb)); |
37430745 | 578 | |
579 | /* Pretend the mode is clobbered across abnormal edges. */ | |
580 | { | |
581 | edge_iterator ei; | |
7fc0df2f | 582 | edge eg; |
583 | FOR_EACH_EDGE (eg, ei, bb->preds) | |
584 | if (eg->flags & EDGE_COMPLEX) | |
37430745 | 585 | break; |
7fc0df2f | 586 | if (eg) |
9e236a59 | 587 | { |
d024774f | 588 | rtx_insn *ins_pos = BB_HEAD (bb); |
6d0a5596 | 589 | if (LABEL_P (ins_pos)) |
590 | ins_pos = NEXT_INSN (ins_pos); | |
591 | gcc_assert (NOTE_INSN_BASIC_BLOCK_P (ins_pos)); | |
592 | if (ins_pos != BB_END (bb)) | |
593 | ins_pos = NEXT_INSN (ins_pos); | |
594 | ptr = new_seginfo (no_mode, ins_pos, bb->index, live_now); | |
9e236a59 | 595 | add_seginfo (info + bb->index, ptr); |
7fc0df2f | 596 | for (i = 0; i < no_mode; i++) |
597 | clear_mode_bit (transp[bb->index], j, i); | |
9e236a59 | 598 | } |
37430745 | 599 | } |
600 | ||
50b15e04 | 601 | FOR_BB_INSNS (bb, insn) |
2f138c1c | 602 | { |
603 | if (INSN_P (insn)) | |
604 | { | |
cea19dab | 605 | int mode = targetm.mode_switching.needed (e, insn); |
2f138c1c | 606 | rtx link; |
607 | ||
608 | if (mode != no_mode && mode != last_mode) | |
609 | { | |
aadec354 | 610 | any_set_required = true; |
2f138c1c | 611 | last_mode = mode; |
612 | ptr = new_seginfo (mode, insn, bb->index, live_now); | |
613 | add_seginfo (info + bb->index, ptr); | |
7fc0df2f | 614 | for (i = 0; i < no_mode; i++) |
615 | clear_mode_bit (transp[bb->index], j, i); | |
2f138c1c | 616 | } |
cea19dab | 617 | |
618 | if (targetm.mode_switching.after) | |
7fc0df2f | 619 | last_mode = targetm.mode_switching.after (e, last_mode, |
620 | insn); | |
cea19dab | 621 | |
2f138c1c | 622 | /* Update LIVE_NOW. */ |
623 | for (link = REG_NOTES (insn); link; link = XEXP (link, 1)) | |
624 | if (REG_NOTE_KIND (link) == REG_DEAD) | |
0ff4fe1d | 625 | reg_dies (XEXP (link, 0), &live_now); |
2f138c1c | 626 | |
627 | note_stores (PATTERN (insn), reg_becomes_live, &live_now); | |
628 | for (link = REG_NOTES (insn); link; link = XEXP (link, 1)) | |
629 | if (REG_NOTE_KIND (link) == REG_UNUSED) | |
0ff4fe1d | 630 | reg_dies (XEXP (link, 0), &live_now); |
2f138c1c | 631 | } |
632 | } | |
633 | ||
634 | info[bb->index].computing = last_mode; | |
aadec354 | 635 | /* Check for blocks without ANY mode requirements. |
d8cefb47 | 636 | N.B. because of MODE_AFTER, last_mode might still |
637 | be different from no_mode, in which case we need to | |
638 | mark the block as nontransparent. */ | |
aadec354 | 639 | if (!any_set_required) |
2f138c1c | 640 | { |
641 | ptr = new_seginfo (no_mode, BB_END (bb), bb->index, live_now); | |
642 | add_seginfo (info + bb->index, ptr); | |
d8cefb47 | 643 | if (last_mode != no_mode) |
7fc0df2f | 644 | for (i = 0; i < no_mode; i++) |
645 | clear_mode_bit (transp[bb->index], j, i); | |
2f138c1c | 646 | } |
647 | } | |
cea19dab | 648 | if (targetm.mode_switching.entry && targetm.mode_switching.exit) |
649 | { | |
650 | int mode = targetm.mode_switching.entry (e); | |
2f138c1c | 651 | |
7fc0df2f | 652 | info[post_entry->index].mode_out = |
653 | info[post_entry->index].mode_in = no_mode; | |
654 | if (pre_exit) | |
655 | { | |
656 | info[pre_exit->index].mode_out = | |
657 | info[pre_exit->index].mode_in = no_mode; | |
658 | } | |
659 | ||
cea19dab | 660 | if (mode != no_mode) |
661 | { | |
662 | bb = post_entry; | |
663 | ||
664 | /* By always making this nontransparent, we save | |
665 | an extra check in make_preds_opaque. We also | |
666 | need this to avoid confusing pre_edge_lcm when | |
667 | antic is cleared but transp and comp are set. */ | |
7fc0df2f | 668 | for (i = 0; i < no_mode; i++) |
669 | clear_mode_bit (transp[bb->index], j, i); | |
cea19dab | 670 | |
671 | /* Insert a fake computing definition of MODE into entry | |
672 | blocks which compute no mode. This represents the mode on | |
673 | entry. */ | |
674 | info[bb->index].computing = mode; | |
675 | ||
676 | if (pre_exit) | |
677 | info[pre_exit->index].seginfo->mode = | |
678 | targetm.mode_switching.exit (e); | |
679 | } | |
680 | } | |
2f138c1c | 681 | |
682 | /* Set the anticipatable and computing arrays. */ | |
7fc0df2f | 683 | for (i = 0; i < no_mode; i++) |
2f138c1c | 684 | { |
7fc0df2f | 685 | int m = targetm.mode_switching.priority (entity_map[j], i); |
2f138c1c | 686 | |
fc00614f | 687 | FOR_EACH_BB_FN (bb, cfun) |
2f138c1c | 688 | { |
689 | if (info[bb->index].seginfo->mode == m) | |
7fc0df2f | 690 | set_mode_bit (antic[bb->index], j, m); |
2f138c1c | 691 | |
692 | if (info[bb->index].computing == m) | |
7fc0df2f | 693 | set_mode_bit (comp[bb->index], j, m); |
2f138c1c | 694 | } |
695 | } | |
7fc0df2f | 696 | } |
2f138c1c | 697 | |
7fc0df2f | 698 | /* Calculate the optimal locations for the |
699 | placement mode switches to modes with priority I. */ | |
2f138c1c | 700 | |
7fc0df2f | 701 | FOR_EACH_BB_FN (bb, cfun) |
702 | bitmap_not (kill[bb->index], transp[bb->index]); | |
2f138c1c | 703 | |
7fc0df2f | 704 | edge_list = pre_edge_lcm_avs (n_entities * max_num_modes, transp, comp, antic, |
705 | kill, avin, avout, &insert, &del); | |
2f138c1c | 706 | |
7fc0df2f | 707 | for (j = n_entities - 1; j >= 0; j--) |
708 | { | |
709 | int no_mode = num_modes[entity_map[j]]; | |
2f138c1c | 710 | |
7fc0df2f | 711 | /* Insert all mode sets that have been inserted by lcm. */ |
2f138c1c | 712 | |
7fc0df2f | 713 | for (int ed = NUM_EDGES (edge_list) - 1; ed >= 0; ed--) |
714 | { | |
715 | edge eg = INDEX_EDGE (edge_list, ed); | |
2f138c1c | 716 | |
7fc0df2f | 717 | eg->aux = (void *)(intptr_t)-1; |
2f138c1c | 718 | |
7fc0df2f | 719 | for (i = 0; i < no_mode; i++) |
720 | { | |
721 | int m = targetm.mode_switching.priority (entity_map[j], i); | |
722 | if (mode_bit_p (insert[ed], j, m)) | |
723 | { | |
724 | eg->aux = (void *)(intptr_t)m; | |
725 | break; | |
726 | } | |
727 | } | |
728 | } | |
2f138c1c | 729 | |
7fc0df2f | 730 | FOR_EACH_BB_FN (bb, cfun) |
731 | { | |
732 | struct bb_info *info = bb_info[j]; | |
733 | int last_mode = no_mode; | |
9e236a59 | 734 | |
7fc0df2f | 735 | /* intialize mode in availability for bb. */ |
736 | for (i = 0; i < no_mode; i++) | |
737 | if (mode_bit_p (avout[bb->index], j, i)) | |
738 | { | |
739 | if (last_mode == no_mode) | |
740 | last_mode = i; | |
741 | if (last_mode != i) | |
742 | { | |
743 | last_mode = no_mode; | |
744 | break; | |
745 | } | |
746 | } | |
747 | info[bb->index].mode_out = last_mode; | |
2f138c1c | 748 | |
7fc0df2f | 749 | /* intialize mode out availability for bb. */ |
750 | last_mode = no_mode; | |
751 | for (i = 0; i < no_mode; i++) | |
752 | if (mode_bit_p (avin[bb->index], j, i)) | |
2f138c1c | 753 | { |
7fc0df2f | 754 | if (last_mode == no_mode) |
755 | last_mode = i; | |
756 | if (last_mode != i) | |
757 | { | |
758 | last_mode = no_mode; | |
759 | break; | |
760 | } | |
2f138c1c | 761 | } |
7fc0df2f | 762 | info[bb->index].mode_in = last_mode; |
763 | ||
764 | for (i = 0; i < no_mode; i++) | |
765 | if (mode_bit_p (del[bb->index], j, i)) | |
766 | info[bb->index].seginfo->mode = no_mode; | |
2f138c1c | 767 | } |
768 | ||
7fc0df2f | 769 | /* Now output the remaining mode sets in all the segments. */ |
2f138c1c | 770 | |
7fc0df2f | 771 | /* In case there was no mode inserted. the mode information on the edge |
772 | might not be complete. | |
773 | Update mode info on edges and commit pending mode sets. */ | |
774 | need_commit |= commit_mode_sets (edge_list, entity_map[j], bb_info[j]); | |
775 | ||
776 | /* Reset modes for next entity. */ | |
777 | clear_aux_for_edges (); | |
2f138c1c | 778 | |
7fc0df2f | 779 | FOR_EACH_BB_FN (bb, cfun) |
2f138c1c | 780 | { |
781 | struct seginfo *ptr, *next; | |
7fc0df2f | 782 | int cur_mode = bb_info[j][bb->index].mode_in; |
783 | ||
2f138c1c | 784 | for (ptr = bb_info[j][bb->index].seginfo; ptr; ptr = next) |
785 | { | |
786 | next = ptr->next; | |
787 | if (ptr->mode != no_mode) | |
788 | { | |
d024774f | 789 | rtx_insn *mode_set; |
2f138c1c | 790 | |
54ef9b16 | 791 | rtl_profile_for_bb (bb); |
2f138c1c | 792 | start_sequence (); |
7fc0df2f | 793 | |
794 | targetm.mode_switching.emit (entity_map[j], ptr->mode, | |
795 | cur_mode, ptr->regs_live); | |
2f138c1c | 796 | mode_set = get_insns (); |
797 | end_sequence (); | |
798 | ||
7fc0df2f | 799 | /* modes kill each other inside a basic block. */ |
800 | cur_mode = ptr->mode; | |
801 | ||
2f138c1c | 802 | /* Insert MODE_SET only if it is nonempty. */ |
803 | if (mode_set != NULL_RTX) | |
804 | { | |
9d75589a | 805 | emitted = true; |
ad4583d9 | 806 | if (NOTE_INSN_BASIC_BLOCK_P (ptr->insn_ptr)) |
6d0a5596 | 807 | /* We need to emit the insns in a FIFO-like manner, |
808 | i.e. the first to be emitted at our insertion | |
809 | point ends up first in the instruction steam. | |
810 | Because we made sure that NOTE_INSN_BASIC_BLOCK is | |
811 | only used for initially empty basic blocks, we | |
794a8431 | 812 | can achieve this by appending at the end of |
6d0a5596 | 813 | the block. */ |
814 | emit_insn_after | |
815 | (mode_set, BB_END (NOTE_BASIC_BLOCK (ptr->insn_ptr))); | |
2f138c1c | 816 | else |
817 | emit_insn_before (mode_set, ptr->insn_ptr); | |
818 | } | |
54ef9b16 | 819 | |
820 | default_rtl_profile (); | |
2f138c1c | 821 | } |
822 | ||
823 | free (ptr); | |
824 | } | |
825 | } | |
826 | ||
827 | free (bb_info[j]); | |
828 | } | |
829 | ||
7fc0df2f | 830 | free_edge_list (edge_list); |
831 | ||
2f138c1c | 832 | /* Finished. Free up all the things we've allocated. */ |
7fc0df2f | 833 | sbitmap_vector_free (del); |
834 | sbitmap_vector_free (insert); | |
2f138c1c | 835 | sbitmap_vector_free (kill); |
836 | sbitmap_vector_free (antic); | |
837 | sbitmap_vector_free (transp); | |
838 | sbitmap_vector_free (comp); | |
7fc0df2f | 839 | sbitmap_vector_free (avin); |
840 | sbitmap_vector_free (avout); | |
2f138c1c | 841 | |
842 | if (need_commit) | |
843 | commit_edge_insertions (); | |
844 | ||
cea19dab | 845 | if (targetm.mode_switching.entry && targetm.mode_switching.exit) |
846 | cleanup_cfg (CLEANUP_NO_INSN_DEL); | |
847 | else if (!need_commit && !emitted) | |
2f138c1c | 848 | return 0; |
2f138c1c | 849 | |
2f138c1c | 850 | return 1; |
851 | } | |
77fce4cd | 852 | |
2f138c1c | 853 | #endif /* OPTIMIZE_MODE_SWITCHING */ |
77fce4cd | 854 | \f |
cbe8bda8 | 855 | namespace { |
856 | ||
857 | const pass_data pass_data_mode_switching = | |
77fce4cd | 858 | { |
cbe8bda8 | 859 | RTL_PASS, /* type */ |
860 | "mode_sw", /* name */ | |
861 | OPTGROUP_NONE, /* optinfo_flags */ | |
cbe8bda8 | 862 | TV_MODE_SWITCH, /* tv_id */ |
863 | 0, /* properties_required */ | |
864 | 0, /* properties_provided */ | |
865 | 0, /* properties_destroyed */ | |
866 | 0, /* todo_flags_start */ | |
8b88439e | 867 | TODO_df_finish, /* todo_flags_finish */ |
77fce4cd | 868 | }; |
cbe8bda8 | 869 | |
870 | class pass_mode_switching : public rtl_opt_pass | |
871 | { | |
872 | public: | |
9af5ce0c | 873 | pass_mode_switching (gcc::context *ctxt) |
874 | : rtl_opt_pass (pass_data_mode_switching, ctxt) | |
cbe8bda8 | 875 | {} |
876 | ||
877 | /* opt_pass methods: */ | |
a6ae2cf4 | 878 | /* The epiphany backend creates a second instance of this pass, so we need |
879 | a clone method. */ | |
ae84f584 | 880 | opt_pass * clone () { return new pass_mode_switching (m_ctxt); } |
31315c24 | 881 | virtual bool gate (function *) |
882 | { | |
883 | #ifdef OPTIMIZE_MODE_SWITCHING | |
884 | return true; | |
885 | #else | |
886 | return false; | |
887 | #endif | |
888 | } | |
889 | ||
65b0537f | 890 | virtual unsigned int execute (function *) |
891 | { | |
892 | #ifdef OPTIMIZE_MODE_SWITCHING | |
893 | optimize_mode_switching (); | |
894 | #endif /* OPTIMIZE_MODE_SWITCHING */ | |
895 | return 0; | |
896 | } | |
cbe8bda8 | 897 | |
898 | }; // class pass_mode_switching | |
899 | ||
900 | } // anon namespace | |
901 | ||
902 | rtl_opt_pass * | |
903 | make_pass_mode_switching (gcc::context *ctxt) | |
904 | { | |
905 | return new pass_mode_switching (ctxt); | |
906 | } |