]>
Commit | Line | Data |
---|---|---|
242229bb | 1 | /* A pass for lowering trees to RTL. |
5624e564 | 2 | Copyright (C) 2004-2015 Free Software Foundation, Inc. |
242229bb JH |
3 | |
4 | This file is part of GCC. | |
5 | ||
6 | GCC is free software; you can redistribute it and/or modify | |
7 | it under the terms of the GNU General Public License as published by | |
9dcd6f09 | 8 | the Free Software Foundation; either version 3, or (at your option) |
242229bb JH |
9 | any later version. |
10 | ||
11 | GCC is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
242229bb JH |
19 | |
20 | #include "config.h" | |
21 | #include "system.h" | |
22 | #include "coretypes.h" | |
c7131fb2 | 23 | #include "backend.h" |
9fdcd34e | 24 | #include "cfghooks.h" |
c7131fb2 AM |
25 | #include "tree.h" |
26 | #include "gimple.h" | |
242229bb | 27 | #include "rtl.h" |
c7131fb2 | 28 | #include "ssa.h" |
40e23961 | 29 | #include "alias.h" |
40e23961 | 30 | #include "fold-const.h" |
d8a2d370 DN |
31 | #include "varasm.h" |
32 | #include "stor-layout.h" | |
33 | #include "stmt.h" | |
34 | #include "print-tree.h" | |
242229bb | 35 | #include "tm_p.h" |
60393bbc AM |
36 | #include "cfgrtl.h" |
37 | #include "cfganal.h" | |
38 | #include "cfgbuild.h" | |
39 | #include "cfgcleanup.h" | |
b0710fe1 AM |
40 | #include "insn-codes.h" |
41 | #include "optabs.h" | |
36566b39 | 42 | #include "flags.h" |
36566b39 PK |
43 | #include "insn-config.h" |
44 | #include "expmed.h" | |
45 | #include "dojump.h" | |
46 | #include "explow.h" | |
47 | #include "calls.h" | |
48 | #include "emit-rtl.h" | |
242229bb JH |
49 | #include "expr.h" |
50 | #include "langhooks.h" | |
2fb9a547 AM |
51 | #include "internal-fn.h" |
52 | #include "tree-eh.h" | |
5be5c238 AM |
53 | #include "gimple-iterator.h" |
54 | #include "gimple-walk.h" | |
442b4905 AM |
55 | #include "cgraph.h" |
56 | #include "tree-cfg.h" | |
442b4905 | 57 | #include "tree-dfa.h" |
7a300452 | 58 | #include "tree-ssa.h" |
242229bb JH |
59 | #include "tree-pass.h" |
60 | #include "except.h" | |
1f6d3a08 | 61 | #include "diagnostic.h" |
cf835838 | 62 | #include "gimple-pretty-print.h" |
1f6d3a08 | 63 | #include "toplev.h" |
ef330312 | 64 | #include "debug.h" |
7d69de61 | 65 | #include "params.h" |
ff28a94d | 66 | #include "tree-inline.h" |
6946b3f7 | 67 | #include "value-prof.h" |
e41b2a33 | 68 | #include "target.h" |
8e9055ae | 69 | #include "tree-ssa-live.h" |
78bca40d | 70 | #include "tree-outof-ssa.h" |
7d776ee2 | 71 | #include "cfgloop.h" |
be147e84 | 72 | #include "regs.h" /* For reg_renumber. */ |
2b21299c | 73 | #include "insn-attr.h" /* For INSN_SCHEDULING. */ |
f3ddd692 | 74 | #include "asan.h" |
4484a35a | 75 | #include "tree-ssa-address.h" |
862d0b35 DN |
76 | #include "recog.h" |
77 | #include "output.h" | |
9b2b7279 | 78 | #include "builtins.h" |
d5e254e1 IE |
79 | #include "tree-chkp.h" |
80 | #include "rtl-chkp.h" | |
726a989a | 81 | |
8a6ce562 JBG |
82 | /* Some systems use __main in a way incompatible with its use in gcc, in these |
83 | cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to | |
84 | give the same symbol without quotes for an alternative entry point. You | |
85 | must define both, or neither. */ | |
86 | #ifndef NAME__MAIN | |
87 | #define NAME__MAIN "__main" | |
88 | #endif | |
89 | ||
4e3825db MM |
90 | /* This variable holds information helping the rewriting of SSA trees |
91 | into RTL. */ | |
92 | struct ssaexpand SA; | |
93 | ||
a5883ba0 MM |
94 | /* This variable holds the currently expanded gimple statement for purposes |
95 | of comminucating the profile info to the builtin expanders. */ | |
96 | gimple currently_expanding_gimple_stmt; | |
97 | ||
ddb555ed JJ |
98 | static rtx expand_debug_expr (tree); |
99 | ||
1f9ceff1 AO |
100 | static bool defer_stack_allocation (tree, bool); |
101 | ||
726a989a RB |
102 | /* Return an expression tree corresponding to the RHS of GIMPLE |
103 | statement STMT. */ | |
104 | ||
105 | tree | |
106 | gimple_assign_rhs_to_tree (gimple stmt) | |
107 | { | |
108 | tree t; | |
82d6e6fc | 109 | enum gimple_rhs_class grhs_class; |
b8698a0f | 110 | |
82d6e6fc | 111 | grhs_class = get_gimple_rhs_class (gimple_expr_code (stmt)); |
726a989a | 112 | |
0354c0c7 BS |
113 | if (grhs_class == GIMPLE_TERNARY_RHS) |
114 | t = build3 (gimple_assign_rhs_code (stmt), | |
115 | TREE_TYPE (gimple_assign_lhs (stmt)), | |
116 | gimple_assign_rhs1 (stmt), | |
117 | gimple_assign_rhs2 (stmt), | |
118 | gimple_assign_rhs3 (stmt)); | |
119 | else if (grhs_class == GIMPLE_BINARY_RHS) | |
726a989a RB |
120 | t = build2 (gimple_assign_rhs_code (stmt), |
121 | TREE_TYPE (gimple_assign_lhs (stmt)), | |
122 | gimple_assign_rhs1 (stmt), | |
123 | gimple_assign_rhs2 (stmt)); | |
82d6e6fc | 124 | else if (grhs_class == GIMPLE_UNARY_RHS) |
726a989a RB |
125 | t = build1 (gimple_assign_rhs_code (stmt), |
126 | TREE_TYPE (gimple_assign_lhs (stmt)), | |
127 | gimple_assign_rhs1 (stmt)); | |
82d6e6fc | 128 | else if (grhs_class == GIMPLE_SINGLE_RHS) |
b5b8b0ac AO |
129 | { |
130 | t = gimple_assign_rhs1 (stmt); | |
131 | /* Avoid modifying this tree in place below. */ | |
d0ed412a JJ |
132 | if ((gimple_has_location (stmt) && CAN_HAVE_LOCATION_P (t) |
133 | && gimple_location (stmt) != EXPR_LOCATION (t)) | |
134 | || (gimple_block (stmt) | |
135 | && currently_expanding_to_rtl | |
5368224f | 136 | && EXPR_P (t))) |
b5b8b0ac AO |
137 | t = copy_node (t); |
138 | } | |
726a989a RB |
139 | else |
140 | gcc_unreachable (); | |
141 | ||
f5045c96 AM |
142 | if (gimple_has_location (stmt) && CAN_HAVE_LOCATION_P (t)) |
143 | SET_EXPR_LOCATION (t, gimple_location (stmt)); | |
144 | ||
726a989a RB |
145 | return t; |
146 | } | |
147 | ||
726a989a | 148 | |
1f6d3a08 RH |
149 | #ifndef STACK_ALIGNMENT_NEEDED |
150 | #define STACK_ALIGNMENT_NEEDED 1 | |
151 | #endif | |
152 | ||
4e3825db MM |
153 | #define SSAVAR(x) (TREE_CODE (x) == SSA_NAME ? SSA_NAME_VAR (x) : x) |
154 | ||
1f9ceff1 AO |
155 | /* Choose either CUR or NEXT as the leader DECL for a partition. |
156 | Prefer ignored decls, to simplify debug dumps and reduce ambiguity | |
157 | out of the same user variable being in multiple partitions (this is | |
158 | less likely for compiler-introduced temps). */ | |
159 | ||
160 | static tree | |
161 | leader_merge (tree cur, tree next) | |
162 | { | |
163 | if (cur == NULL || cur == next) | |
164 | return next; | |
165 | ||
166 | if (DECL_P (cur) && DECL_IGNORED_P (cur)) | |
167 | return cur; | |
168 | ||
169 | if (DECL_P (next) && DECL_IGNORED_P (next)) | |
170 | return next; | |
171 | ||
172 | return cur; | |
173 | } | |
174 | ||
c24f5688 AO |
175 | /* Return true if VAR is a PARM_DECL or a RESULT_DECL that ought to be |
176 | assigned to a stack slot. We can't have expand_one_ssa_partition | |
177 | choose their address: the pseudo holding the address would be set | |
178 | up too late for assign_params to copy the parameter if needed. | |
179 | ||
1f9ceff1 AO |
180 | Such parameters are likely passed as a pointer to the value, rather |
181 | than as a value, and so we must not coalesce them, nor allocate | |
182 | stack space for them before determining the calling conventions for | |
c24f5688 AO |
183 | them. |
184 | ||
185 | For their SSA_NAMEs, expand_one_ssa_partition emits RTL as MEMs | |
186 | with pc_rtx as the address, and then it replaces the pc_rtx with | |
187 | NULL so as to make sure the MEM is not used before it is adjusted | |
188 | in assign_parm_setup_reg. */ | |
1f9ceff1 AO |
189 | |
190 | bool | |
c24f5688 | 191 | parm_in_stack_slot_p (tree var) |
1f9ceff1 AO |
192 | { |
193 | if (!var || VAR_P (var)) | |
194 | return false; | |
195 | ||
196 | gcc_assert (TREE_CODE (var) == PARM_DECL | |
197 | || TREE_CODE (var) == RESULT_DECL); | |
198 | ||
c24f5688 | 199 | return !use_register_for_decl (var); |
1f9ceff1 AO |
200 | } |
201 | ||
202 | /* Return the partition of the default SSA_DEF for decl VAR. */ | |
203 | ||
204 | static int | |
205 | ssa_default_def_partition (tree var) | |
206 | { | |
207 | tree name = ssa_default_def (cfun, var); | |
208 | ||
209 | if (!name) | |
210 | return NO_PARTITION; | |
211 | ||
212 | return var_to_partition (SA.map, name); | |
213 | } | |
214 | ||
215 | /* Return the RTL for the default SSA def of a PARM or RESULT, if | |
216 | there is one. */ | |
217 | ||
218 | rtx | |
219 | get_rtl_for_parm_ssa_default_def (tree var) | |
220 | { | |
221 | gcc_assert (TREE_CODE (var) == PARM_DECL || TREE_CODE (var) == RESULT_DECL); | |
222 | ||
223 | if (!is_gimple_reg (var)) | |
224 | return NULL_RTX; | |
225 | ||
226 | /* If we've already determined RTL for the decl, use it. This is | |
227 | not just an optimization: if VAR is a PARM whose incoming value | |
228 | is unused, we won't find a default def to use its partition, but | |
229 | we still want to use the location of the parm, if it was used at | |
230 | all. During assign_parms, until a location is assigned for the | |
231 | VAR, RTL can only for a parm or result if we're not coalescing | |
232 | across variables, when we know we're coalescing all SSA_NAMEs of | |
233 | each parm or result, and we're not coalescing them with names | |
234 | pertaining to other variables, such as other parms' default | |
235 | defs. */ | |
236 | if (DECL_RTL_SET_P (var)) | |
237 | { | |
238 | gcc_assert (DECL_RTL (var) != pc_rtx); | |
239 | return DECL_RTL (var); | |
240 | } | |
241 | ||
242 | int part = ssa_default_def_partition (var); | |
243 | if (part == NO_PARTITION) | |
244 | return NULL_RTX; | |
245 | ||
246 | return SA.partition_to_pseudo[part]; | |
247 | } | |
248 | ||
4e3825db MM |
249 | /* Associate declaration T with storage space X. If T is no |
250 | SSA name this is exactly SET_DECL_RTL, otherwise make the | |
251 | partition of T associated with X. */ | |
252 | static inline void | |
253 | set_rtl (tree t, rtx x) | |
254 | { | |
1f9ceff1 AO |
255 | if (x && SSAVAR (t)) |
256 | { | |
257 | bool skip = false; | |
258 | tree cur = NULL_TREE; | |
259 | ||
260 | if (MEM_P (x)) | |
261 | cur = MEM_EXPR (x); | |
262 | else if (REG_P (x)) | |
263 | cur = REG_EXPR (x); | |
264 | else if (GET_CODE (x) == CONCAT | |
265 | && REG_P (XEXP (x, 0))) | |
266 | cur = REG_EXPR (XEXP (x, 0)); | |
267 | else if (GET_CODE (x) == PARALLEL) | |
268 | cur = REG_EXPR (XVECEXP (x, 0, 0)); | |
269 | else if (x == pc_rtx) | |
270 | skip = true; | |
271 | else | |
272 | gcc_unreachable (); | |
273 | ||
274 | tree next = skip ? cur : leader_merge (cur, SSAVAR (t)); | |
275 | ||
276 | if (cur != next) | |
277 | { | |
278 | if (MEM_P (x)) | |
279 | set_mem_attributes (x, next, true); | |
280 | else | |
281 | set_reg_attrs_for_decl_rtl (next, x); | |
282 | } | |
283 | } | |
284 | ||
4e3825db MM |
285 | if (TREE_CODE (t) == SSA_NAME) |
286 | { | |
1f9ceff1 AO |
287 | int part = var_to_partition (SA.map, t); |
288 | if (part != NO_PARTITION) | |
289 | { | |
290 | if (SA.partition_to_pseudo[part]) | |
291 | gcc_assert (SA.partition_to_pseudo[part] == x); | |
292 | else if (x != pc_rtx) | |
293 | SA.partition_to_pseudo[part] = x; | |
294 | } | |
295 | /* For the benefit of debug information at -O0 (where | |
296 | vartracking doesn't run) record the place also in the base | |
297 | DECL. For PARMs and RESULTs, we may end up resetting these | |
298 | in function.c:maybe_reset_rtl_for_parm, but in some rare | |
299 | cases we may need them (unused and overwritten incoming | |
300 | value, that at -O0 must share the location with the other | |
301 | uses in spite of the missing default def), and this may be | |
302 | the only chance to preserve them. */ | |
303 | if (x && x != pc_rtx && SSA_NAME_VAR (t)) | |
eb7adebc MM |
304 | { |
305 | tree var = SSA_NAME_VAR (t); | |
306 | /* If we don't yet have something recorded, just record it now. */ | |
307 | if (!DECL_RTL_SET_P (var)) | |
308 | SET_DECL_RTL (var, x); | |
47598145 | 309 | /* If we have it set already to "multiple places" don't |
eb7adebc MM |
310 | change this. */ |
311 | else if (DECL_RTL (var) == pc_rtx) | |
312 | ; | |
313 | /* If we have something recorded and it's not the same place | |
314 | as we want to record now, we have multiple partitions for the | |
315 | same base variable, with different places. We can't just | |
316 | randomly chose one, hence we have to say that we don't know. | |
317 | This only happens with optimization, and there var-tracking | |
318 | will figure out the right thing. */ | |
319 | else if (DECL_RTL (var) != x) | |
320 | SET_DECL_RTL (var, pc_rtx); | |
321 | } | |
4e3825db MM |
322 | } |
323 | else | |
324 | SET_DECL_RTL (t, x); | |
325 | } | |
1f6d3a08 RH |
326 | |
327 | /* This structure holds data relevant to one variable that will be | |
328 | placed in a stack slot. */ | |
329 | struct stack_var | |
330 | { | |
331 | /* The Variable. */ | |
332 | tree decl; | |
333 | ||
1f6d3a08 RH |
334 | /* Initially, the size of the variable. Later, the size of the partition, |
335 | if this variable becomes it's partition's representative. */ | |
336 | HOST_WIDE_INT size; | |
337 | ||
338 | /* The *byte* alignment required for this variable. Or as, with the | |
339 | size, the alignment for this partition. */ | |
340 | unsigned int alignb; | |
341 | ||
342 | /* The partition representative. */ | |
343 | size_t representative; | |
344 | ||
345 | /* The next stack variable in the partition, or EOC. */ | |
346 | size_t next; | |
2bdbbe94 MM |
347 | |
348 | /* The numbers of conflicting stack variables. */ | |
349 | bitmap conflicts; | |
1f6d3a08 RH |
350 | }; |
351 | ||
352 | #define EOC ((size_t)-1) | |
353 | ||
354 | /* We have an array of such objects while deciding allocation. */ | |
355 | static struct stack_var *stack_vars; | |
356 | static size_t stack_vars_alloc; | |
357 | static size_t stack_vars_num; | |
39c8aaa4 | 358 | static hash_map<tree, size_t> *decl_to_stack_part; |
1f6d3a08 | 359 | |
3f9b14ff SB |
360 | /* Conflict bitmaps go on this obstack. This allows us to destroy |
361 | all of them in one big sweep. */ | |
362 | static bitmap_obstack stack_var_bitmap_obstack; | |
363 | ||
fa10beec | 364 | /* An array of indices such that stack_vars[stack_vars_sorted[i]].size |
1f6d3a08 RH |
365 | is non-decreasing. */ |
366 | static size_t *stack_vars_sorted; | |
367 | ||
1f6d3a08 RH |
368 | /* The phase of the stack frame. This is the known misalignment of |
369 | virtual_stack_vars_rtx from PREFERRED_STACK_BOUNDARY. That is, | |
370 | (frame_offset+frame_phase) % PREFERRED_STACK_BOUNDARY == 0. */ | |
371 | static int frame_phase; | |
372 | ||
7d69de61 RH |
373 | /* Used during expand_used_vars to remember if we saw any decls for |
374 | which we'd like to enable stack smashing protection. */ | |
375 | static bool has_protected_decls; | |
376 | ||
377 | /* Used during expand_used_vars. Remember if we say a character buffer | |
378 | smaller than our cutoff threshold. Used for -Wstack-protector. */ | |
379 | static bool has_short_buffer; | |
1f6d3a08 | 380 | |
6f197850 | 381 | /* Compute the byte alignment to use for DECL. Ignore alignment |
765c3e8f L |
382 | we can't do with expected alignment of the stack boundary. */ |
383 | ||
384 | static unsigned int | |
6f197850 | 385 | align_local_variable (tree decl) |
765c3e8f | 386 | { |
1f9ceff1 AO |
387 | unsigned int align; |
388 | ||
389 | if (TREE_CODE (decl) == SSA_NAME) | |
390 | align = TYPE_ALIGN (TREE_TYPE (decl)); | |
391 | else | |
392 | { | |
393 | align = LOCAL_DECL_ALIGNMENT (decl); | |
394 | DECL_ALIGN (decl) = align; | |
395 | } | |
1f6d3a08 RH |
396 | return align / BITS_PER_UNIT; |
397 | } | |
398 | ||
435be747 MO |
399 | /* Align given offset BASE with ALIGN. Truncate up if ALIGN_UP is true, |
400 | down otherwise. Return truncated BASE value. */ | |
401 | ||
402 | static inline unsigned HOST_WIDE_INT | |
403 | align_base (HOST_WIDE_INT base, unsigned HOST_WIDE_INT align, bool align_up) | |
404 | { | |
405 | return align_up ? (base + align - 1) & -align : base & -align; | |
406 | } | |
407 | ||
1f6d3a08 RH |
408 | /* Allocate SIZE bytes at byte alignment ALIGN from the stack frame. |
409 | Return the frame offset. */ | |
410 | ||
411 | static HOST_WIDE_INT | |
3a42502d | 412 | alloc_stack_frame_space (HOST_WIDE_INT size, unsigned HOST_WIDE_INT align) |
1f6d3a08 RH |
413 | { |
414 | HOST_WIDE_INT offset, new_frame_offset; | |
415 | ||
1f6d3a08 RH |
416 | if (FRAME_GROWS_DOWNWARD) |
417 | { | |
435be747 MO |
418 | new_frame_offset |
419 | = align_base (frame_offset - frame_phase - size, | |
420 | align, false) + frame_phase; | |
1f6d3a08 RH |
421 | offset = new_frame_offset; |
422 | } | |
423 | else | |
424 | { | |
435be747 MO |
425 | new_frame_offset |
426 | = align_base (frame_offset - frame_phase, align, true) + frame_phase; | |
1f6d3a08 RH |
427 | offset = new_frame_offset; |
428 | new_frame_offset += size; | |
429 | } | |
430 | frame_offset = new_frame_offset; | |
431 | ||
9fb798d7 EB |
432 | if (frame_offset_overflow (frame_offset, cfun->decl)) |
433 | frame_offset = offset = 0; | |
434 | ||
1f6d3a08 RH |
435 | return offset; |
436 | } | |
437 | ||
438 | /* Accumulate DECL into STACK_VARS. */ | |
439 | ||
440 | static void | |
441 | add_stack_var (tree decl) | |
442 | { | |
533f611a RH |
443 | struct stack_var *v; |
444 | ||
1f6d3a08 RH |
445 | if (stack_vars_num >= stack_vars_alloc) |
446 | { | |
447 | if (stack_vars_alloc) | |
448 | stack_vars_alloc = stack_vars_alloc * 3 / 2; | |
449 | else | |
450 | stack_vars_alloc = 32; | |
451 | stack_vars | |
452 | = XRESIZEVEC (struct stack_var, stack_vars, stack_vars_alloc); | |
453 | } | |
47598145 | 454 | if (!decl_to_stack_part) |
39c8aaa4 | 455 | decl_to_stack_part = new hash_map<tree, size_t>; |
47598145 | 456 | |
533f611a | 457 | v = &stack_vars[stack_vars_num]; |
39c8aaa4 | 458 | decl_to_stack_part->put (decl, stack_vars_num); |
533f611a RH |
459 | |
460 | v->decl = decl; | |
1f9ceff1 AO |
461 | tree size = TREE_CODE (decl) == SSA_NAME |
462 | ? TYPE_SIZE_UNIT (TREE_TYPE (decl)) | |
463 | : DECL_SIZE_UNIT (decl); | |
464 | v->size = tree_to_uhwi (size); | |
533f611a RH |
465 | /* Ensure that all variables have size, so that &a != &b for any two |
466 | variables that are simultaneously live. */ | |
467 | if (v->size == 0) | |
468 | v->size = 1; | |
1f9ceff1 | 469 | v->alignb = align_local_variable (decl); |
13868f40 EB |
470 | /* An alignment of zero can mightily confuse us later. */ |
471 | gcc_assert (v->alignb != 0); | |
1f6d3a08 RH |
472 | |
473 | /* All variables are initially in their own partition. */ | |
533f611a RH |
474 | v->representative = stack_vars_num; |
475 | v->next = EOC; | |
1f6d3a08 | 476 | |
2bdbbe94 | 477 | /* All variables initially conflict with no other. */ |
533f611a | 478 | v->conflicts = NULL; |
2bdbbe94 | 479 | |
1f6d3a08 | 480 | /* Ensure that this decl doesn't get put onto the list twice. */ |
4e3825db | 481 | set_rtl (decl, pc_rtx); |
1f6d3a08 RH |
482 | |
483 | stack_vars_num++; | |
484 | } | |
485 | ||
1f6d3a08 RH |
486 | /* Make the decls associated with luid's X and Y conflict. */ |
487 | ||
488 | static void | |
489 | add_stack_var_conflict (size_t x, size_t y) | |
490 | { | |
2bdbbe94 MM |
491 | struct stack_var *a = &stack_vars[x]; |
492 | struct stack_var *b = &stack_vars[y]; | |
493 | if (!a->conflicts) | |
3f9b14ff | 494 | a->conflicts = BITMAP_ALLOC (&stack_var_bitmap_obstack); |
2bdbbe94 | 495 | if (!b->conflicts) |
3f9b14ff | 496 | b->conflicts = BITMAP_ALLOC (&stack_var_bitmap_obstack); |
2bdbbe94 MM |
497 | bitmap_set_bit (a->conflicts, y); |
498 | bitmap_set_bit (b->conflicts, x); | |
1f6d3a08 RH |
499 | } |
500 | ||
501 | /* Check whether the decls associated with luid's X and Y conflict. */ | |
502 | ||
503 | static bool | |
504 | stack_var_conflict_p (size_t x, size_t y) | |
505 | { | |
2bdbbe94 MM |
506 | struct stack_var *a = &stack_vars[x]; |
507 | struct stack_var *b = &stack_vars[y]; | |
47598145 MM |
508 | if (x == y) |
509 | return false; | |
510 | /* Partitions containing an SSA name result from gimple registers | |
511 | with things like unsupported modes. They are top-level and | |
512 | hence conflict with everything else. */ | |
513 | if (TREE_CODE (a->decl) == SSA_NAME || TREE_CODE (b->decl) == SSA_NAME) | |
514 | return true; | |
515 | ||
2bdbbe94 MM |
516 | if (!a->conflicts || !b->conflicts) |
517 | return false; | |
518 | return bitmap_bit_p (a->conflicts, y); | |
1f6d3a08 | 519 | } |
b8698a0f | 520 | |
47598145 MM |
521 | /* Callback for walk_stmt_ops. If OP is a decl touched by add_stack_var |
522 | enter its partition number into bitmap DATA. */ | |
523 | ||
524 | static bool | |
9f1363cd | 525 | visit_op (gimple, tree op, tree, void *data) |
47598145 MM |
526 | { |
527 | bitmap active = (bitmap)data; | |
528 | op = get_base_address (op); | |
529 | if (op | |
530 | && DECL_P (op) | |
531 | && DECL_RTL_IF_SET (op) == pc_rtx) | |
532 | { | |
39c8aaa4 | 533 | size_t *v = decl_to_stack_part->get (op); |
47598145 MM |
534 | if (v) |
535 | bitmap_set_bit (active, *v); | |
536 | } | |
537 | return false; | |
538 | } | |
539 | ||
540 | /* Callback for walk_stmt_ops. If OP is a decl touched by add_stack_var | |
541 | record conflicts between it and all currently active other partitions | |
542 | from bitmap DATA. */ | |
543 | ||
544 | static bool | |
9f1363cd | 545 | visit_conflict (gimple, tree op, tree, void *data) |
47598145 MM |
546 | { |
547 | bitmap active = (bitmap)data; | |
548 | op = get_base_address (op); | |
549 | if (op | |
550 | && DECL_P (op) | |
551 | && DECL_RTL_IF_SET (op) == pc_rtx) | |
552 | { | |
39c8aaa4 | 553 | size_t *v = decl_to_stack_part->get (op); |
47598145 MM |
554 | if (v && bitmap_set_bit (active, *v)) |
555 | { | |
556 | size_t num = *v; | |
557 | bitmap_iterator bi; | |
558 | unsigned i; | |
559 | gcc_assert (num < stack_vars_num); | |
560 | EXECUTE_IF_SET_IN_BITMAP (active, 0, i, bi) | |
561 | add_stack_var_conflict (num, i); | |
562 | } | |
563 | } | |
564 | return false; | |
565 | } | |
566 | ||
567 | /* Helper routine for add_scope_conflicts, calculating the active partitions | |
568 | at the end of BB, leaving the result in WORK. We're called to generate | |
81bfd197 MM |
569 | conflicts when FOR_CONFLICT is true, otherwise we're just tracking |
570 | liveness. */ | |
47598145 MM |
571 | |
572 | static void | |
81bfd197 | 573 | add_scope_conflicts_1 (basic_block bb, bitmap work, bool for_conflict) |
47598145 MM |
574 | { |
575 | edge e; | |
576 | edge_iterator ei; | |
577 | gimple_stmt_iterator gsi; | |
9f1363cd | 578 | walk_stmt_load_store_addr_fn visit; |
47598145 MM |
579 | |
580 | bitmap_clear (work); | |
581 | FOR_EACH_EDGE (e, ei, bb->preds) | |
582 | bitmap_ior_into (work, (bitmap)e->src->aux); | |
583 | ||
ea85edfe | 584 | visit = visit_op; |
47598145 MM |
585 | |
586 | for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
587 | { | |
588 | gimple stmt = gsi_stmt (gsi); | |
ea85edfe | 589 | walk_stmt_load_store_addr_ops (stmt, work, NULL, NULL, visit); |
47598145 | 590 | } |
ea85edfe | 591 | for (gsi = gsi_after_labels (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
47598145 MM |
592 | { |
593 | gimple stmt = gsi_stmt (gsi); | |
594 | ||
595 | if (gimple_clobber_p (stmt)) | |
596 | { | |
597 | tree lhs = gimple_assign_lhs (stmt); | |
598 | size_t *v; | |
599 | /* Nested function lowering might introduce LHSs | |
600 | that are COMPONENT_REFs. */ | |
601 | if (TREE_CODE (lhs) != VAR_DECL) | |
602 | continue; | |
603 | if (DECL_RTL_IF_SET (lhs) == pc_rtx | |
39c8aaa4 | 604 | && (v = decl_to_stack_part->get (lhs))) |
47598145 MM |
605 | bitmap_clear_bit (work, *v); |
606 | } | |
607 | else if (!is_gimple_debug (stmt)) | |
ea85edfe | 608 | { |
81bfd197 | 609 | if (for_conflict |
ea85edfe JJ |
610 | && visit == visit_op) |
611 | { | |
612 | /* If this is the first real instruction in this BB we need | |
88d599dc MM |
613 | to add conflicts for everything live at this point now. |
614 | Unlike classical liveness for named objects we can't | |
ea85edfe JJ |
615 | rely on seeing a def/use of the names we're interested in. |
616 | There might merely be indirect loads/stores. We'd not add any | |
81bfd197 | 617 | conflicts for such partitions. */ |
ea85edfe JJ |
618 | bitmap_iterator bi; |
619 | unsigned i; | |
81bfd197 | 620 | EXECUTE_IF_SET_IN_BITMAP (work, 0, i, bi) |
ea85edfe | 621 | { |
9b44f5d9 MM |
622 | struct stack_var *a = &stack_vars[i]; |
623 | if (!a->conflicts) | |
3f9b14ff | 624 | a->conflicts = BITMAP_ALLOC (&stack_var_bitmap_obstack); |
9b44f5d9 | 625 | bitmap_ior_into (a->conflicts, work); |
ea85edfe JJ |
626 | } |
627 | visit = visit_conflict; | |
628 | } | |
629 | walk_stmt_load_store_addr_ops (stmt, work, visit, visit, visit); | |
630 | } | |
47598145 MM |
631 | } |
632 | } | |
633 | ||
634 | /* Generate stack partition conflicts between all partitions that are | |
635 | simultaneously live. */ | |
636 | ||
637 | static void | |
638 | add_scope_conflicts (void) | |
639 | { | |
640 | basic_block bb; | |
641 | bool changed; | |
642 | bitmap work = BITMAP_ALLOC (NULL); | |
9b44f5d9 MM |
643 | int *rpo; |
644 | int n_bbs; | |
47598145 | 645 | |
88d599dc | 646 | /* We approximate the live range of a stack variable by taking the first |
47598145 MM |
647 | mention of its name as starting point(s), and by the end-of-scope |
648 | death clobber added by gimplify as ending point(s) of the range. | |
649 | This overapproximates in the case we for instance moved an address-taken | |
650 | operation upward, without also moving a dereference to it upwards. | |
651 | But it's conservatively correct as a variable never can hold values | |
652 | before its name is mentioned at least once. | |
653 | ||
88d599dc | 654 | We then do a mostly classical bitmap liveness algorithm. */ |
47598145 | 655 | |
04a90bec | 656 | FOR_ALL_BB_FN (bb, cfun) |
3f9b14ff | 657 | bb->aux = BITMAP_ALLOC (&stack_var_bitmap_obstack); |
47598145 | 658 | |
8b1c6fd7 | 659 | rpo = XNEWVEC (int, last_basic_block_for_fn (cfun)); |
9b44f5d9 MM |
660 | n_bbs = pre_and_rev_post_order_compute (NULL, rpo, false); |
661 | ||
47598145 MM |
662 | changed = true; |
663 | while (changed) | |
664 | { | |
9b44f5d9 | 665 | int i; |
47598145 | 666 | changed = false; |
9b44f5d9 | 667 | for (i = 0; i < n_bbs; i++) |
47598145 | 668 | { |
9b44f5d9 | 669 | bitmap active; |
06e28de2 | 670 | bb = BASIC_BLOCK_FOR_FN (cfun, rpo[i]); |
9b44f5d9 | 671 | active = (bitmap)bb->aux; |
81bfd197 | 672 | add_scope_conflicts_1 (bb, work, false); |
47598145 MM |
673 | if (bitmap_ior_into (active, work)) |
674 | changed = true; | |
675 | } | |
676 | } | |
677 | ||
11cd3bed | 678 | FOR_EACH_BB_FN (bb, cfun) |
81bfd197 | 679 | add_scope_conflicts_1 (bb, work, true); |
47598145 | 680 | |
9b44f5d9 | 681 | free (rpo); |
47598145 | 682 | BITMAP_FREE (work); |
04a90bec | 683 | FOR_ALL_BB_FN (bb, cfun) |
47598145 MM |
684 | BITMAP_FREE (bb->aux); |
685 | } | |
686 | ||
1f6d3a08 | 687 | /* A subroutine of partition_stack_vars. A comparison function for qsort, |
3a42502d | 688 | sorting an array of indices by the properties of the object. */ |
1f6d3a08 RH |
689 | |
690 | static int | |
3a42502d | 691 | stack_var_cmp (const void *a, const void *b) |
1f6d3a08 | 692 | { |
3a42502d RH |
693 | size_t ia = *(const size_t *)a; |
694 | size_t ib = *(const size_t *)b; | |
695 | unsigned int aligna = stack_vars[ia].alignb; | |
696 | unsigned int alignb = stack_vars[ib].alignb; | |
697 | HOST_WIDE_INT sizea = stack_vars[ia].size; | |
698 | HOST_WIDE_INT sizeb = stack_vars[ib].size; | |
699 | tree decla = stack_vars[ia].decl; | |
700 | tree declb = stack_vars[ib].decl; | |
701 | bool largea, largeb; | |
4e3825db | 702 | unsigned int uida, uidb; |
1f6d3a08 | 703 | |
3a42502d RH |
704 | /* Primary compare on "large" alignment. Large comes first. */ |
705 | largea = (aligna * BITS_PER_UNIT > MAX_SUPPORTED_STACK_ALIGNMENT); | |
706 | largeb = (alignb * BITS_PER_UNIT > MAX_SUPPORTED_STACK_ALIGNMENT); | |
707 | if (largea != largeb) | |
708 | return (int)largeb - (int)largea; | |
709 | ||
710 | /* Secondary compare on size, decreasing */ | |
3a42502d | 711 | if (sizea > sizeb) |
6ddfda8a ER |
712 | return -1; |
713 | if (sizea < sizeb) | |
1f6d3a08 | 714 | return 1; |
3a42502d RH |
715 | |
716 | /* Tertiary compare on true alignment, decreasing. */ | |
717 | if (aligna < alignb) | |
718 | return -1; | |
719 | if (aligna > alignb) | |
720 | return 1; | |
721 | ||
722 | /* Final compare on ID for sort stability, increasing. | |
723 | Two SSA names are compared by their version, SSA names come before | |
724 | non-SSA names, and two normal decls are compared by their DECL_UID. */ | |
4e3825db MM |
725 | if (TREE_CODE (decla) == SSA_NAME) |
726 | { | |
727 | if (TREE_CODE (declb) == SSA_NAME) | |
728 | uida = SSA_NAME_VERSION (decla), uidb = SSA_NAME_VERSION (declb); | |
729 | else | |
730 | return -1; | |
731 | } | |
732 | else if (TREE_CODE (declb) == SSA_NAME) | |
733 | return 1; | |
734 | else | |
735 | uida = DECL_UID (decla), uidb = DECL_UID (declb); | |
79f802f5 | 736 | if (uida < uidb) |
79f802f5 | 737 | return 1; |
3a42502d RH |
738 | if (uida > uidb) |
739 | return -1; | |
1f6d3a08 RH |
740 | return 0; |
741 | } | |
742 | ||
0ef08bc5 | 743 | struct part_traits : unbounded_int_hashmap_traits <size_t, bitmap> {}; |
39c8aaa4 | 744 | typedef hash_map<size_t, bitmap, part_traits> part_hashmap; |
55b34b5f RG |
745 | |
746 | /* If the points-to solution *PI points to variables that are in a partition | |
747 | together with other variables add all partition members to the pointed-to | |
748 | variables bitmap. */ | |
749 | ||
750 | static void | |
751 | add_partitioned_vars_to_ptset (struct pt_solution *pt, | |
39c8aaa4 | 752 | part_hashmap *decls_to_partitions, |
6e2830c3 | 753 | hash_set<bitmap> *visited, bitmap temp) |
55b34b5f RG |
754 | { |
755 | bitmap_iterator bi; | |
756 | unsigned i; | |
757 | bitmap *part; | |
758 | ||
759 | if (pt->anything | |
760 | || pt->vars == NULL | |
761 | /* The pointed-to vars bitmap is shared, it is enough to | |
762 | visit it once. */ | |
6e2830c3 | 763 | || visited->add (pt->vars)) |
55b34b5f RG |
764 | return; |
765 | ||
766 | bitmap_clear (temp); | |
767 | ||
768 | /* By using a temporary bitmap to store all members of the partitions | |
769 | we have to add we make sure to visit each of the partitions only | |
770 | once. */ | |
771 | EXECUTE_IF_SET_IN_BITMAP (pt->vars, 0, i, bi) | |
772 | if ((!temp | |
773 | || !bitmap_bit_p (temp, i)) | |
39c8aaa4 | 774 | && (part = decls_to_partitions->get (i))) |
55b34b5f RG |
775 | bitmap_ior_into (temp, *part); |
776 | if (!bitmap_empty_p (temp)) | |
777 | bitmap_ior_into (pt->vars, temp); | |
778 | } | |
779 | ||
780 | /* Update points-to sets based on partition info, so we can use them on RTL. | |
781 | The bitmaps representing stack partitions will be saved until expand, | |
782 | where partitioned decls used as bases in memory expressions will be | |
783 | rewritten. */ | |
784 | ||
785 | static void | |
786 | update_alias_info_with_stack_vars (void) | |
787 | { | |
39c8aaa4 | 788 | part_hashmap *decls_to_partitions = NULL; |
55b34b5f RG |
789 | size_t i, j; |
790 | tree var = NULL_TREE; | |
791 | ||
792 | for (i = 0; i < stack_vars_num; i++) | |
793 | { | |
794 | bitmap part = NULL; | |
795 | tree name; | |
796 | struct ptr_info_def *pi; | |
797 | ||
798 | /* Not interested in partitions with single variable. */ | |
799 | if (stack_vars[i].representative != i | |
800 | || stack_vars[i].next == EOC) | |
801 | continue; | |
802 | ||
803 | if (!decls_to_partitions) | |
804 | { | |
39c8aaa4 TS |
805 | decls_to_partitions = new part_hashmap; |
806 | cfun->gimple_df->decls_to_pointers = new hash_map<tree, tree>; | |
55b34b5f RG |
807 | } |
808 | ||
809 | /* Create an SSA_NAME that points to the partition for use | |
810 | as base during alias-oracle queries on RTL for bases that | |
811 | have been partitioned. */ | |
812 | if (var == NULL_TREE) | |
b731b390 JJ |
813 | var = create_tmp_var (ptr_type_node); |
814 | name = make_ssa_name (var); | |
55b34b5f RG |
815 | |
816 | /* Create bitmaps representing partitions. They will be used for | |
817 | points-to sets later, so use GGC alloc. */ | |
818 | part = BITMAP_GGC_ALLOC (); | |
819 | for (j = i; j != EOC; j = stack_vars[j].next) | |
820 | { | |
821 | tree decl = stack_vars[j].decl; | |
25a6a873 | 822 | unsigned int uid = DECL_PT_UID (decl); |
55b34b5f | 823 | bitmap_set_bit (part, uid); |
39c8aaa4 TS |
824 | decls_to_partitions->put (uid, part); |
825 | cfun->gimple_df->decls_to_pointers->put (decl, name); | |
88d8330d EB |
826 | if (TREE_ADDRESSABLE (decl)) |
827 | TREE_ADDRESSABLE (name) = 1; | |
55b34b5f RG |
828 | } |
829 | ||
830 | /* Make the SSA name point to all partition members. */ | |
831 | pi = get_ptr_info (name); | |
d3553615 | 832 | pt_solution_set (&pi->pt, part, false); |
55b34b5f RG |
833 | } |
834 | ||
835 | /* Make all points-to sets that contain one member of a partition | |
836 | contain all members of the partition. */ | |
837 | if (decls_to_partitions) | |
838 | { | |
839 | unsigned i; | |
6e2830c3 | 840 | hash_set<bitmap> visited; |
3f9b14ff | 841 | bitmap temp = BITMAP_ALLOC (&stack_var_bitmap_obstack); |
55b34b5f RG |
842 | |
843 | for (i = 1; i < num_ssa_names; i++) | |
844 | { | |
845 | tree name = ssa_name (i); | |
846 | struct ptr_info_def *pi; | |
847 | ||
848 | if (name | |
849 | && POINTER_TYPE_P (TREE_TYPE (name)) | |
850 | && ((pi = SSA_NAME_PTR_INFO (name)) != NULL)) | |
851 | add_partitioned_vars_to_ptset (&pi->pt, decls_to_partitions, | |
6e2830c3 | 852 | &visited, temp); |
55b34b5f RG |
853 | } |
854 | ||
855 | add_partitioned_vars_to_ptset (&cfun->gimple_df->escaped, | |
6e2830c3 | 856 | decls_to_partitions, &visited, temp); |
55b34b5f | 857 | |
39c8aaa4 | 858 | delete decls_to_partitions; |
55b34b5f RG |
859 | BITMAP_FREE (temp); |
860 | } | |
861 | } | |
862 | ||
1f6d3a08 RH |
863 | /* A subroutine of partition_stack_vars. The UNION portion of a UNION/FIND |
864 | partitioning algorithm. Partitions A and B are known to be non-conflicting. | |
6ddfda8a | 865 | Merge them into a single partition A. */ |
1f6d3a08 RH |
866 | |
867 | static void | |
6ddfda8a | 868 | union_stack_vars (size_t a, size_t b) |
1f6d3a08 | 869 | { |
2bdbbe94 MM |
870 | struct stack_var *vb = &stack_vars[b]; |
871 | bitmap_iterator bi; | |
872 | unsigned u; | |
1f6d3a08 | 873 | |
6ddfda8a ER |
874 | gcc_assert (stack_vars[b].next == EOC); |
875 | /* Add B to A's partition. */ | |
876 | stack_vars[b].next = stack_vars[a].next; | |
877 | stack_vars[b].representative = a; | |
1f6d3a08 RH |
878 | stack_vars[a].next = b; |
879 | ||
880 | /* Update the required alignment of partition A to account for B. */ | |
881 | if (stack_vars[a].alignb < stack_vars[b].alignb) | |
882 | stack_vars[a].alignb = stack_vars[b].alignb; | |
883 | ||
884 | /* Update the interference graph and merge the conflicts. */ | |
2bdbbe94 MM |
885 | if (vb->conflicts) |
886 | { | |
887 | EXECUTE_IF_SET_IN_BITMAP (vb->conflicts, 0, u, bi) | |
888 | add_stack_var_conflict (a, stack_vars[u].representative); | |
889 | BITMAP_FREE (vb->conflicts); | |
890 | } | |
1f6d3a08 RH |
891 | } |
892 | ||
893 | /* A subroutine of expand_used_vars. Binpack the variables into | |
894 | partitions constrained by the interference graph. The overall | |
895 | algorithm used is as follows: | |
896 | ||
6ddfda8a | 897 | Sort the objects by size in descending order. |
1f6d3a08 RH |
898 | For each object A { |
899 | S = size(A) | |
900 | O = 0 | |
901 | loop { | |
902 | Look for the largest non-conflicting object B with size <= S. | |
903 | UNION (A, B) | |
1f6d3a08 RH |
904 | } |
905 | } | |
906 | */ | |
907 | ||
908 | static void | |
909 | partition_stack_vars (void) | |
910 | { | |
911 | size_t si, sj, n = stack_vars_num; | |
912 | ||
913 | stack_vars_sorted = XNEWVEC (size_t, stack_vars_num); | |
914 | for (si = 0; si < n; ++si) | |
915 | stack_vars_sorted[si] = si; | |
916 | ||
917 | if (n == 1) | |
918 | return; | |
919 | ||
3a42502d | 920 | qsort (stack_vars_sorted, n, sizeof (size_t), stack_var_cmp); |
1f6d3a08 | 921 | |
1f6d3a08 RH |
922 | for (si = 0; si < n; ++si) |
923 | { | |
924 | size_t i = stack_vars_sorted[si]; | |
3a42502d | 925 | unsigned int ialign = stack_vars[i].alignb; |
f3ddd692 | 926 | HOST_WIDE_INT isize = stack_vars[i].size; |
1f6d3a08 | 927 | |
6ddfda8a ER |
928 | /* Ignore objects that aren't partition representatives. If we |
929 | see a var that is not a partition representative, it must | |
930 | have been merged earlier. */ | |
931 | if (stack_vars[i].representative != i) | |
932 | continue; | |
933 | ||
934 | for (sj = si + 1; sj < n; ++sj) | |
1f6d3a08 RH |
935 | { |
936 | size_t j = stack_vars_sorted[sj]; | |
1f6d3a08 | 937 | unsigned int jalign = stack_vars[j].alignb; |
f3ddd692 | 938 | HOST_WIDE_INT jsize = stack_vars[j].size; |
1f6d3a08 RH |
939 | |
940 | /* Ignore objects that aren't partition representatives. */ | |
941 | if (stack_vars[j].representative != j) | |
942 | continue; | |
943 | ||
3a42502d RH |
944 | /* Do not mix objects of "small" (supported) alignment |
945 | and "large" (unsupported) alignment. */ | |
946 | if ((ialign * BITS_PER_UNIT <= MAX_SUPPORTED_STACK_ALIGNMENT) | |
947 | != (jalign * BITS_PER_UNIT <= MAX_SUPPORTED_STACK_ALIGNMENT)) | |
f3ddd692 JJ |
948 | break; |
949 | ||
950 | /* For Address Sanitizer do not mix objects with different | |
951 | sizes, as the shorter vars wouldn't be adequately protected. | |
952 | Don't do that for "large" (unsupported) alignment objects, | |
953 | those aren't protected anyway. */ | |
b5ebc991 | 954 | if ((flag_sanitize & SANITIZE_ADDRESS) && ASAN_STACK && isize != jsize |
f3ddd692 JJ |
955 | && ialign * BITS_PER_UNIT <= MAX_SUPPORTED_STACK_ALIGNMENT) |
956 | break; | |
957 | ||
958 | /* Ignore conflicting objects. */ | |
959 | if (stack_var_conflict_p (i, j)) | |
3a42502d RH |
960 | continue; |
961 | ||
1f6d3a08 | 962 | /* UNION the objects, placing J at OFFSET. */ |
6ddfda8a | 963 | union_stack_vars (i, j); |
1f6d3a08 RH |
964 | } |
965 | } | |
55b34b5f | 966 | |
9b999dc5 | 967 | update_alias_info_with_stack_vars (); |
1f6d3a08 RH |
968 | } |
969 | ||
970 | /* A debugging aid for expand_used_vars. Dump the generated partitions. */ | |
971 | ||
972 | static void | |
973 | dump_stack_var_partition (void) | |
974 | { | |
975 | size_t si, i, j, n = stack_vars_num; | |
976 | ||
977 | for (si = 0; si < n; ++si) | |
978 | { | |
979 | i = stack_vars_sorted[si]; | |
980 | ||
981 | /* Skip variables that aren't partition representatives, for now. */ | |
982 | if (stack_vars[i].representative != i) | |
983 | continue; | |
984 | ||
985 | fprintf (dump_file, "Partition %lu: size " HOST_WIDE_INT_PRINT_DEC | |
986 | " align %u\n", (unsigned long) i, stack_vars[i].size, | |
987 | stack_vars[i].alignb); | |
988 | ||
989 | for (j = i; j != EOC; j = stack_vars[j].next) | |
990 | { | |
991 | fputc ('\t', dump_file); | |
992 | print_generic_expr (dump_file, stack_vars[j].decl, dump_flags); | |
1f6d3a08 | 993 | } |
6ddfda8a | 994 | fputc ('\n', dump_file); |
1f6d3a08 RH |
995 | } |
996 | } | |
997 | ||
3a42502d | 998 | /* Assign rtl to DECL at BASE + OFFSET. */ |
1f6d3a08 RH |
999 | |
1000 | static void | |
3a42502d RH |
1001 | expand_one_stack_var_at (tree decl, rtx base, unsigned base_align, |
1002 | HOST_WIDE_INT offset) | |
1f6d3a08 | 1003 | { |
3a42502d | 1004 | unsigned align; |
1f6d3a08 | 1005 | rtx x; |
c22cacf3 | 1006 | |
1f6d3a08 RH |
1007 | /* If this fails, we've overflowed the stack frame. Error nicely? */ |
1008 | gcc_assert (offset == trunc_int_for_mode (offset, Pmode)); | |
1009 | ||
0a81f074 | 1010 | x = plus_constant (Pmode, base, offset); |
1f9ceff1 AO |
1011 | x = gen_rtx_MEM (TREE_CODE (decl) == SSA_NAME |
1012 | ? TYPE_MODE (TREE_TYPE (decl)) | |
1013 | : DECL_MODE (SSAVAR (decl)), x); | |
1f6d3a08 | 1014 | |
4e3825db MM |
1015 | if (TREE_CODE (decl) != SSA_NAME) |
1016 | { | |
1017 | /* Set alignment we actually gave this decl if it isn't an SSA name. | |
1018 | If it is we generate stack slots only accidentally so it isn't as | |
1019 | important, we'll simply use the alignment that is already set. */ | |
3a42502d RH |
1020 | if (base == virtual_stack_vars_rtx) |
1021 | offset -= frame_phase; | |
4e3825db MM |
1022 | align = offset & -offset; |
1023 | align *= BITS_PER_UNIT; | |
3a42502d RH |
1024 | if (align == 0 || align > base_align) |
1025 | align = base_align; | |
1026 | ||
1027 | /* One would think that we could assert that we're not decreasing | |
1028 | alignment here, but (at least) the i386 port does exactly this | |
1029 | via the MINIMUM_ALIGNMENT hook. */ | |
4e3825db MM |
1030 | |
1031 | DECL_ALIGN (decl) = align; | |
1032 | DECL_USER_ALIGN (decl) = 0; | |
1033 | } | |
1034 | ||
4e3825db | 1035 | set_rtl (decl, x); |
1f6d3a08 RH |
1036 | } |
1037 | ||
f3ddd692 JJ |
1038 | struct stack_vars_data |
1039 | { | |
1040 | /* Vector of offset pairs, always end of some padding followed | |
1041 | by start of the padding that needs Address Sanitizer protection. | |
1042 | The vector is in reversed, highest offset pairs come first. */ | |
9771b263 | 1043 | vec<HOST_WIDE_INT> asan_vec; |
f3ddd692 JJ |
1044 | |
1045 | /* Vector of partition representative decls in between the paddings. */ | |
9771b263 | 1046 | vec<tree> asan_decl_vec; |
e361382f JJ |
1047 | |
1048 | /* Base pseudo register for Address Sanitizer protected automatic vars. */ | |
1049 | rtx asan_base; | |
1050 | ||
1051 | /* Alignment needed for the Address Sanitizer protected automatic vars. */ | |
1052 | unsigned int asan_alignb; | |
f3ddd692 JJ |
1053 | }; |
1054 | ||
1f6d3a08 RH |
1055 | /* A subroutine of expand_used_vars. Give each partition representative |
1056 | a unique location within the stack frame. Update each partition member | |
1057 | with that location. */ | |
1058 | ||
1059 | static void | |
f3ddd692 | 1060 | expand_stack_vars (bool (*pred) (size_t), struct stack_vars_data *data) |
1f6d3a08 RH |
1061 | { |
1062 | size_t si, i, j, n = stack_vars_num; | |
3a42502d RH |
1063 | HOST_WIDE_INT large_size = 0, large_alloc = 0; |
1064 | rtx large_base = NULL; | |
1065 | unsigned large_align = 0; | |
1066 | tree decl; | |
1067 | ||
1068 | /* Determine if there are any variables requiring "large" alignment. | |
1069 | Since these are dynamically allocated, we only process these if | |
1070 | no predicate involved. */ | |
1071 | large_align = stack_vars[stack_vars_sorted[0]].alignb * BITS_PER_UNIT; | |
1072 | if (pred == NULL && large_align > MAX_SUPPORTED_STACK_ALIGNMENT) | |
1073 | { | |
1074 | /* Find the total size of these variables. */ | |
1075 | for (si = 0; si < n; ++si) | |
1076 | { | |
1077 | unsigned alignb; | |
1078 | ||
1079 | i = stack_vars_sorted[si]; | |
1080 | alignb = stack_vars[i].alignb; | |
1081 | ||
a8eeec27 SE |
1082 | /* All "large" alignment decls come before all "small" alignment |
1083 | decls, but "large" alignment decls are not sorted based on | |
1084 | their alignment. Increase large_align to track the largest | |
1085 | required alignment. */ | |
1086 | if ((alignb * BITS_PER_UNIT) > large_align) | |
1087 | large_align = alignb * BITS_PER_UNIT; | |
1088 | ||
3a42502d RH |
1089 | /* Stop when we get to the first decl with "small" alignment. */ |
1090 | if (alignb * BITS_PER_UNIT <= MAX_SUPPORTED_STACK_ALIGNMENT) | |
1091 | break; | |
1092 | ||
1093 | /* Skip variables that aren't partition representatives. */ | |
1094 | if (stack_vars[i].representative != i) | |
1095 | continue; | |
1096 | ||
1097 | /* Skip variables that have already had rtl assigned. See also | |
1098 | add_stack_var where we perpetrate this pc_rtx hack. */ | |
1099 | decl = stack_vars[i].decl; | |
1f9ceff1 AO |
1100 | if (TREE_CODE (decl) == SSA_NAME |
1101 | ? SA.partition_to_pseudo[var_to_partition (SA.map, decl)] != NULL_RTX | |
1102 | : DECL_RTL (decl) != pc_rtx) | |
3a42502d RH |
1103 | continue; |
1104 | ||
1105 | large_size += alignb - 1; | |
1106 | large_size &= -(HOST_WIDE_INT)alignb; | |
1107 | large_size += stack_vars[i].size; | |
1108 | } | |
1109 | ||
1110 | /* If there were any, allocate space. */ | |
1111 | if (large_size > 0) | |
1112 | large_base = allocate_dynamic_stack_space (GEN_INT (large_size), 0, | |
1113 | large_align, true); | |
1114 | } | |
1f6d3a08 RH |
1115 | |
1116 | for (si = 0; si < n; ++si) | |
1117 | { | |
3a42502d RH |
1118 | rtx base; |
1119 | unsigned base_align, alignb; | |
1f6d3a08 RH |
1120 | HOST_WIDE_INT offset; |
1121 | ||
1122 | i = stack_vars_sorted[si]; | |
1123 | ||
1124 | /* Skip variables that aren't partition representatives, for now. */ | |
1125 | if (stack_vars[i].representative != i) | |
1126 | continue; | |
1127 | ||
7d69de61 RH |
1128 | /* Skip variables that have already had rtl assigned. See also |
1129 | add_stack_var where we perpetrate this pc_rtx hack. */ | |
3a42502d | 1130 | decl = stack_vars[i].decl; |
1f9ceff1 AO |
1131 | if (TREE_CODE (decl) == SSA_NAME |
1132 | ? SA.partition_to_pseudo[var_to_partition (SA.map, decl)] != NULL_RTX | |
1133 | : DECL_RTL (decl) != pc_rtx) | |
7d69de61 RH |
1134 | continue; |
1135 | ||
c22cacf3 | 1136 | /* Check the predicate to see whether this variable should be |
7d69de61 | 1137 | allocated in this pass. */ |
f3ddd692 | 1138 | if (pred && !pred (i)) |
7d69de61 RH |
1139 | continue; |
1140 | ||
3a42502d RH |
1141 | alignb = stack_vars[i].alignb; |
1142 | if (alignb * BITS_PER_UNIT <= MAX_SUPPORTED_STACK_ALIGNMENT) | |
1143 | { | |
e361382f | 1144 | base = virtual_stack_vars_rtx; |
b5ebc991 | 1145 | if ((flag_sanitize & SANITIZE_ADDRESS) && ASAN_STACK && pred) |
f3ddd692 | 1146 | { |
435be747 MO |
1147 | HOST_WIDE_INT prev_offset |
1148 | = align_base (frame_offset, | |
1149 | MAX (alignb, ASAN_RED_ZONE_SIZE), | |
1150 | FRAME_GROWS_DOWNWARD); | |
f3ddd692 | 1151 | tree repr_decl = NULL_TREE; |
f3ddd692 JJ |
1152 | offset |
1153 | = alloc_stack_frame_space (stack_vars[i].size | |
1154 | + ASAN_RED_ZONE_SIZE, | |
1155 | MAX (alignb, ASAN_RED_ZONE_SIZE)); | |
435be747 | 1156 | |
9771b263 DN |
1157 | data->asan_vec.safe_push (prev_offset); |
1158 | data->asan_vec.safe_push (offset + stack_vars[i].size); | |
f3ddd692 JJ |
1159 | /* Find best representative of the partition. |
1160 | Prefer those with DECL_NAME, even better | |
1161 | satisfying asan_protect_stack_decl predicate. */ | |
1162 | for (j = i; j != EOC; j = stack_vars[j].next) | |
1163 | if (asan_protect_stack_decl (stack_vars[j].decl) | |
1164 | && DECL_NAME (stack_vars[j].decl)) | |
1165 | { | |
1166 | repr_decl = stack_vars[j].decl; | |
1167 | break; | |
1168 | } | |
1169 | else if (repr_decl == NULL_TREE | |
1170 | && DECL_P (stack_vars[j].decl) | |
1171 | && DECL_NAME (stack_vars[j].decl)) | |
1172 | repr_decl = stack_vars[j].decl; | |
1173 | if (repr_decl == NULL_TREE) | |
1174 | repr_decl = stack_vars[i].decl; | |
9771b263 | 1175 | data->asan_decl_vec.safe_push (repr_decl); |
e361382f JJ |
1176 | data->asan_alignb = MAX (data->asan_alignb, alignb); |
1177 | if (data->asan_base == NULL) | |
1178 | data->asan_base = gen_reg_rtx (Pmode); | |
1179 | base = data->asan_base; | |
e5dcd695 LZ |
1180 | |
1181 | if (!STRICT_ALIGNMENT) | |
1182 | base_align = crtl->max_used_stack_slot_alignment; | |
1183 | else | |
1184 | base_align = MAX (crtl->max_used_stack_slot_alignment, | |
1185 | GET_MODE_ALIGNMENT (SImode) | |
1186 | << ASAN_SHADOW_SHIFT); | |
f3ddd692 JJ |
1187 | } |
1188 | else | |
e5dcd695 LZ |
1189 | { |
1190 | offset = alloc_stack_frame_space (stack_vars[i].size, alignb); | |
1191 | base_align = crtl->max_used_stack_slot_alignment; | |
1192 | } | |
3a42502d RH |
1193 | } |
1194 | else | |
1195 | { | |
1196 | /* Large alignment is only processed in the last pass. */ | |
1197 | if (pred) | |
1198 | continue; | |
533f611a | 1199 | gcc_assert (large_base != NULL); |
3a42502d RH |
1200 | |
1201 | large_alloc += alignb - 1; | |
1202 | large_alloc &= -(HOST_WIDE_INT)alignb; | |
1203 | offset = large_alloc; | |
1204 | large_alloc += stack_vars[i].size; | |
1205 | ||
1206 | base = large_base; | |
1207 | base_align = large_align; | |
1208 | } | |
1f6d3a08 RH |
1209 | |
1210 | /* Create rtl for each variable based on their location within the | |
1211 | partition. */ | |
1212 | for (j = i; j != EOC; j = stack_vars[j].next) | |
f8da8190 | 1213 | { |
f8da8190 | 1214 | expand_one_stack_var_at (stack_vars[j].decl, |
3a42502d | 1215 | base, base_align, |
6ddfda8a | 1216 | offset); |
f8da8190 | 1217 | } |
1f6d3a08 | 1218 | } |
3a42502d RH |
1219 | |
1220 | gcc_assert (large_alloc == large_size); | |
1f6d3a08 RH |
1221 | } |
1222 | ||
ff28a94d JH |
1223 | /* Take into account all sizes of partitions and reset DECL_RTLs. */ |
1224 | static HOST_WIDE_INT | |
1225 | account_stack_vars (void) | |
1226 | { | |
1227 | size_t si, j, i, n = stack_vars_num; | |
1228 | HOST_WIDE_INT size = 0; | |
1229 | ||
1230 | for (si = 0; si < n; ++si) | |
1231 | { | |
1232 | i = stack_vars_sorted[si]; | |
1233 | ||
1234 | /* Skip variables that aren't partition representatives, for now. */ | |
1235 | if (stack_vars[i].representative != i) | |
1236 | continue; | |
1237 | ||
1238 | size += stack_vars[i].size; | |
1239 | for (j = i; j != EOC; j = stack_vars[j].next) | |
4e3825db | 1240 | set_rtl (stack_vars[j].decl, NULL); |
ff28a94d JH |
1241 | } |
1242 | return size; | |
1243 | } | |
1244 | ||
1f6d3a08 RH |
1245 | /* A subroutine of expand_one_var. Called to immediately assign rtl |
1246 | to a variable to be allocated in the stack frame. */ | |
1247 | ||
1248 | static void | |
1f9ceff1 | 1249 | expand_one_stack_var_1 (tree var) |
1f6d3a08 | 1250 | { |
3a42502d RH |
1251 | HOST_WIDE_INT size, offset; |
1252 | unsigned byte_align; | |
1f6d3a08 | 1253 | |
1f9ceff1 AO |
1254 | if (TREE_CODE (var) == SSA_NAME) |
1255 | { | |
1256 | tree type = TREE_TYPE (var); | |
1257 | size = tree_to_uhwi (TYPE_SIZE_UNIT (type)); | |
1258 | byte_align = TYPE_ALIGN_UNIT (type); | |
1259 | } | |
1260 | else | |
1261 | { | |
1262 | size = tree_to_uhwi (DECL_SIZE_UNIT (var)); | |
1263 | byte_align = align_local_variable (var); | |
1264 | } | |
3a42502d RH |
1265 | |
1266 | /* We handle highly aligned variables in expand_stack_vars. */ | |
1267 | gcc_assert (byte_align * BITS_PER_UNIT <= MAX_SUPPORTED_STACK_ALIGNMENT); | |
1f6d3a08 | 1268 | |
3a42502d RH |
1269 | offset = alloc_stack_frame_space (size, byte_align); |
1270 | ||
1271 | expand_one_stack_var_at (var, virtual_stack_vars_rtx, | |
1272 | crtl->max_used_stack_slot_alignment, offset); | |
1f6d3a08 RH |
1273 | } |
1274 | ||
1f9ceff1 AO |
1275 | /* Wrapper for expand_one_stack_var_1 that checks SSA_NAMEs are |
1276 | already assigned some MEM. */ | |
1277 | ||
1278 | static void | |
1279 | expand_one_stack_var (tree var) | |
1280 | { | |
1281 | if (TREE_CODE (var) == SSA_NAME) | |
1282 | { | |
1283 | int part = var_to_partition (SA.map, var); | |
1284 | if (part != NO_PARTITION) | |
1285 | { | |
1286 | rtx x = SA.partition_to_pseudo[part]; | |
1287 | gcc_assert (x); | |
1288 | gcc_assert (MEM_P (x)); | |
1289 | return; | |
1290 | } | |
1291 | } | |
1292 | ||
1293 | return expand_one_stack_var_1 (var); | |
1294 | } | |
1295 | ||
1f6d3a08 RH |
1296 | /* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL |
1297 | that will reside in a hard register. */ | |
1298 | ||
1299 | static void | |
1300 | expand_one_hard_reg_var (tree var) | |
1301 | { | |
1302 | rest_of_decl_compilation (var, 0, 0); | |
1303 | } | |
1304 | ||
1f9ceff1 AO |
1305 | /* Record the alignment requirements of some variable assigned to a |
1306 | pseudo. */ | |
1307 | ||
1308 | static void | |
1309 | record_alignment_for_reg_var (unsigned int align) | |
1310 | { | |
1311 | if (SUPPORTS_STACK_ALIGNMENT | |
1312 | && crtl->stack_alignment_estimated < align) | |
1313 | { | |
1314 | /* stack_alignment_estimated shouldn't change after stack | |
1315 | realign decision made */ | |
1316 | gcc_assert (!crtl->stack_realign_processed); | |
1317 | crtl->stack_alignment_estimated = align; | |
1318 | } | |
1319 | ||
1320 | /* stack_alignment_needed > PREFERRED_STACK_BOUNDARY is permitted. | |
1321 | So here we only make sure stack_alignment_needed >= align. */ | |
1322 | if (crtl->stack_alignment_needed < align) | |
1323 | crtl->stack_alignment_needed = align; | |
1324 | if (crtl->max_used_stack_slot_alignment < align) | |
1325 | crtl->max_used_stack_slot_alignment = align; | |
1326 | } | |
1327 | ||
1328 | /* Create RTL for an SSA partition. */ | |
1329 | ||
1330 | static void | |
1331 | expand_one_ssa_partition (tree var) | |
1332 | { | |
1333 | int part = var_to_partition (SA.map, var); | |
1334 | gcc_assert (part != NO_PARTITION); | |
1335 | ||
1336 | if (SA.partition_to_pseudo[part]) | |
1337 | return; | |
1338 | ||
1339 | unsigned int align = MINIMUM_ALIGNMENT (TREE_TYPE (var), | |
1340 | TYPE_MODE (TREE_TYPE (var)), | |
1341 | TYPE_ALIGN (TREE_TYPE (var))); | |
1342 | ||
1343 | /* If the variable alignment is very large we'll dynamicaly allocate | |
1344 | it, which means that in-frame portion is just a pointer. */ | |
1345 | if (align > MAX_SUPPORTED_STACK_ALIGNMENT) | |
1346 | align = POINTER_SIZE; | |
1347 | ||
1348 | record_alignment_for_reg_var (align); | |
1349 | ||
1350 | if (!use_register_for_decl (var)) | |
1351 | { | |
c24f5688 AO |
1352 | /* We can't risk having the parm assigned to a MEM location |
1353 | whose address references a pseudo, for the pseudo will only | |
1354 | be set up after arguments are copied to the stack slot. | |
1355 | ||
1356 | If the parm doesn't have a default def (e.g., because its | |
1357 | incoming value is unused), then we want to let assign_params | |
1358 | do the allocation, too. In this case we want to make sure | |
1359 | SSA_NAMEs associated with the parm don't get assigned to more | |
1360 | than one partition, lest we'd create two unassigned stac | |
1361 | slots for the same parm, thus the assert at the end of the | |
1362 | block. */ | |
1363 | if (parm_in_stack_slot_p (SSA_NAME_VAR (var)) | |
1364 | && (ssa_default_def_partition (SSA_NAME_VAR (var)) == part | |
1365 | || !ssa_default_def (cfun, SSA_NAME_VAR (var)))) | |
1f9ceff1 AO |
1366 | { |
1367 | expand_one_stack_var_at (var, pc_rtx, 0, 0); | |
1368 | rtx x = SA.partition_to_pseudo[part]; | |
1369 | gcc_assert (GET_CODE (x) == MEM); | |
1f9ceff1 AO |
1370 | gcc_assert (XEXP (x, 0) == pc_rtx); |
1371 | /* Reset the address, so that any attempt to use it will | |
1372 | ICE. It will be adjusted in assign_parm_setup_reg. */ | |
1373 | XEXP (x, 0) = NULL_RTX; | |
c24f5688 AO |
1374 | /* If the RTL associated with the parm is not what we have |
1375 | just created, the parm has been split over multiple | |
1376 | partitions. In order for this to work, we must have a | |
1377 | default def for the parm, otherwise assign_params won't | |
1378 | know what to do. */ | |
1379 | gcc_assert (DECL_RTL_IF_SET (SSA_NAME_VAR (var)) == x | |
1380 | || ssa_default_def (cfun, SSA_NAME_VAR (var))); | |
1f9ceff1 AO |
1381 | } |
1382 | else if (defer_stack_allocation (var, true)) | |
1383 | add_stack_var (var); | |
1384 | else | |
1385 | expand_one_stack_var_1 (var); | |
1386 | return; | |
1387 | } | |
1388 | ||
1389 | machine_mode reg_mode = promote_ssa_mode (var, NULL); | |
1390 | ||
1391 | rtx x = gen_reg_rtx (reg_mode); | |
1392 | ||
1393 | set_rtl (var, x); | |
1394 | } | |
1395 | ||
1396 | /* Record the association between the RTL generated for a partition | |
1397 | and the underlying variable of the SSA_NAME. */ | |
1398 | ||
1399 | static void | |
1400 | adjust_one_expanded_partition_var (tree var) | |
1401 | { | |
1402 | if (!var) | |
1403 | return; | |
1404 | ||
1405 | tree decl = SSA_NAME_VAR (var); | |
1406 | ||
1407 | int part = var_to_partition (SA.map, var); | |
1408 | if (part == NO_PARTITION) | |
1409 | return; | |
1410 | ||
1411 | rtx x = SA.partition_to_pseudo[part]; | |
1412 | ||
1413 | if (!x) | |
1414 | { | |
1415 | /* This var will get a stack slot later. */ | |
1416 | gcc_assert (defer_stack_allocation (var, true)); | |
1417 | return; | |
1418 | } | |
1419 | ||
1420 | set_rtl (var, x); | |
1421 | ||
1422 | if (!REG_P (x)) | |
1423 | return; | |
1424 | ||
1425 | /* Note if the object is a user variable. */ | |
1426 | if (decl && !DECL_ARTIFICIAL (decl)) | |
1427 | mark_user_reg (x); | |
1428 | ||
1429 | if (POINTER_TYPE_P (decl ? TREE_TYPE (decl) : TREE_TYPE (var))) | |
1430 | mark_reg_pointer (x, get_pointer_alignment (var)); | |
1431 | } | |
1432 | ||
1f6d3a08 RH |
1433 | /* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL |
1434 | that will reside in a pseudo register. */ | |
1435 | ||
1436 | static void | |
1437 | expand_one_register_var (tree var) | |
1438 | { | |
1f9ceff1 AO |
1439 | if (TREE_CODE (var) == SSA_NAME) |
1440 | { | |
1441 | int part = var_to_partition (SA.map, var); | |
1442 | if (part != NO_PARTITION) | |
1443 | { | |
1444 | rtx x = SA.partition_to_pseudo[part]; | |
1445 | gcc_assert (x); | |
1446 | gcc_assert (REG_P (x)); | |
1447 | return; | |
1448 | } | |
1449 | gcc_unreachable (); | |
1450 | } | |
1451 | ||
1452 | tree decl = var; | |
4e3825db | 1453 | tree type = TREE_TYPE (decl); |
ef4bddc2 | 1454 | machine_mode reg_mode = promote_decl_mode (decl, NULL); |
1f6d3a08 RH |
1455 | rtx x = gen_reg_rtx (reg_mode); |
1456 | ||
4e3825db | 1457 | set_rtl (var, x); |
1f6d3a08 RH |
1458 | |
1459 | /* Note if the object is a user variable. */ | |
4e3825db MM |
1460 | if (!DECL_ARTIFICIAL (decl)) |
1461 | mark_user_reg (x); | |
1f6d3a08 | 1462 | |
61021c2c | 1463 | if (POINTER_TYPE_P (type)) |
d466b407 | 1464 | mark_reg_pointer (x, get_pointer_alignment (var)); |
1f6d3a08 RH |
1465 | } |
1466 | ||
1467 | /* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL that | |
128a79fb | 1468 | has some associated error, e.g. its type is error-mark. We just need |
1f6d3a08 RH |
1469 | to pick something that won't crash the rest of the compiler. */ |
1470 | ||
1471 | static void | |
1472 | expand_one_error_var (tree var) | |
1473 | { | |
ef4bddc2 | 1474 | machine_mode mode = DECL_MODE (var); |
1f6d3a08 RH |
1475 | rtx x; |
1476 | ||
1477 | if (mode == BLKmode) | |
1478 | x = gen_rtx_MEM (BLKmode, const0_rtx); | |
1479 | else if (mode == VOIDmode) | |
1480 | x = const0_rtx; | |
1481 | else | |
1482 | x = gen_reg_rtx (mode); | |
1483 | ||
1484 | SET_DECL_RTL (var, x); | |
1485 | } | |
1486 | ||
c22cacf3 | 1487 | /* A subroutine of expand_one_var. VAR is a variable that will be |
1f6d3a08 RH |
1488 | allocated to the local stack frame. Return true if we wish to |
1489 | add VAR to STACK_VARS so that it will be coalesced with other | |
1490 | variables. Return false to allocate VAR immediately. | |
1491 | ||
1492 | This function is used to reduce the number of variables considered | |
1493 | for coalescing, which reduces the size of the quadratic problem. */ | |
1494 | ||
1495 | static bool | |
1496 | defer_stack_allocation (tree var, bool toplevel) | |
1497 | { | |
1f9ceff1 AO |
1498 | tree size_unit = TREE_CODE (var) == SSA_NAME |
1499 | ? TYPE_SIZE_UNIT (TREE_TYPE (var)) | |
1500 | : DECL_SIZE_UNIT (var); | |
1501 | ||
ee2e8462 EB |
1502 | /* Whether the variable is small enough for immediate allocation not to be |
1503 | a problem with regard to the frame size. */ | |
1504 | bool smallish | |
1f9ceff1 | 1505 | = ((HOST_WIDE_INT) tree_to_uhwi (size_unit) |
ee2e8462 EB |
1506 | < PARAM_VALUE (PARAM_MIN_SIZE_FOR_STACK_SHARING)); |
1507 | ||
7d69de61 | 1508 | /* If stack protection is enabled, *all* stack variables must be deferred, |
f3ddd692 JJ |
1509 | so that we can re-order the strings to the top of the frame. |
1510 | Similarly for Address Sanitizer. */ | |
b5ebc991 | 1511 | if (flag_stack_protect || ((flag_sanitize & SANITIZE_ADDRESS) && ASAN_STACK)) |
7d69de61 RH |
1512 | return true; |
1513 | ||
1f9ceff1 AO |
1514 | unsigned int align = TREE_CODE (var) == SSA_NAME |
1515 | ? TYPE_ALIGN (TREE_TYPE (var)) | |
1516 | : DECL_ALIGN (var); | |
1517 | ||
3a42502d RH |
1518 | /* We handle "large" alignment via dynamic allocation. We want to handle |
1519 | this extra complication in only one place, so defer them. */ | |
1f9ceff1 | 1520 | if (align > MAX_SUPPORTED_STACK_ALIGNMENT) |
3a42502d RH |
1521 | return true; |
1522 | ||
1f9ceff1 AO |
1523 | bool ignored = TREE_CODE (var) == SSA_NAME |
1524 | ? !SSAVAR (var) || DECL_IGNORED_P (SSA_NAME_VAR (var)) | |
1525 | : DECL_IGNORED_P (var); | |
1526 | ||
ee2e8462 EB |
1527 | /* When optimization is enabled, DECL_IGNORED_P variables originally scoped |
1528 | might be detached from their block and appear at toplevel when we reach | |
1529 | here. We want to coalesce them with variables from other blocks when | |
1530 | the immediate contribution to the frame size would be noticeable. */ | |
1f9ceff1 | 1531 | if (toplevel && optimize > 0 && ignored && !smallish) |
ee2e8462 EB |
1532 | return true; |
1533 | ||
1534 | /* Variables declared in the outermost scope automatically conflict | |
1535 | with every other variable. The only reason to want to defer them | |
1f6d3a08 RH |
1536 | at all is that, after sorting, we can more efficiently pack |
1537 | small variables in the stack frame. Continue to defer at -O2. */ | |
1538 | if (toplevel && optimize < 2) | |
1539 | return false; | |
1540 | ||
1541 | /* Without optimization, *most* variables are allocated from the | |
1542 | stack, which makes the quadratic problem large exactly when we | |
c22cacf3 | 1543 | want compilation to proceed as quickly as possible. On the |
1f6d3a08 RH |
1544 | other hand, we don't want the function's stack frame size to |
1545 | get completely out of hand. So we avoid adding scalars and | |
1546 | "small" aggregates to the list at all. */ | |
ee2e8462 | 1547 | if (optimize == 0 && smallish) |
1f6d3a08 RH |
1548 | return false; |
1549 | ||
1550 | return true; | |
1551 | } | |
1552 | ||
1553 | /* A subroutine of expand_used_vars. Expand one variable according to | |
2a7e31df | 1554 | its flavor. Variables to be placed on the stack are not actually |
b8698a0f | 1555 | expanded yet, merely recorded. |
ff28a94d JH |
1556 | When REALLY_EXPAND is false, only add stack values to be allocated. |
1557 | Return stack usage this variable is supposed to take. | |
1558 | */ | |
1f6d3a08 | 1559 | |
ff28a94d JH |
1560 | static HOST_WIDE_INT |
1561 | expand_one_var (tree var, bool toplevel, bool really_expand) | |
1f6d3a08 | 1562 | { |
3a42502d | 1563 | unsigned int align = BITS_PER_UNIT; |
4e3825db | 1564 | tree origvar = var; |
3a42502d | 1565 | |
4e3825db MM |
1566 | var = SSAVAR (var); |
1567 | ||
3a42502d | 1568 | if (TREE_TYPE (var) != error_mark_node && TREE_CODE (var) == VAR_DECL) |
2e3f842f | 1569 | { |
2e3f842f L |
1570 | /* Because we don't know if VAR will be in register or on stack, |
1571 | we conservatively assume it will be on stack even if VAR is | |
1572 | eventually put into register after RA pass. For non-automatic | |
1573 | variables, which won't be on stack, we collect alignment of | |
3396aba5 JJ |
1574 | type and ignore user specified alignment. Similarly for |
1575 | SSA_NAMEs for which use_register_for_decl returns true. */ | |
1576 | if (TREE_STATIC (var) | |
1577 | || DECL_EXTERNAL (var) | |
1578 | || (TREE_CODE (origvar) == SSA_NAME && use_register_for_decl (var))) | |
ae58e548 JJ |
1579 | align = MINIMUM_ALIGNMENT (TREE_TYPE (var), |
1580 | TYPE_MODE (TREE_TYPE (var)), | |
1581 | TYPE_ALIGN (TREE_TYPE (var))); | |
f3184b4c JJ |
1582 | else if (DECL_HAS_VALUE_EXPR_P (var) |
1583 | || (DECL_RTL_SET_P (var) && MEM_P (DECL_RTL (var)))) | |
1584 | /* Don't consider debug only variables with DECL_HAS_VALUE_EXPR_P set | |
1585 | or variables which were assigned a stack slot already by | |
1586 | expand_one_stack_var_at - in the latter case DECL_ALIGN has been | |
1587 | changed from the offset chosen to it. */ | |
1588 | align = crtl->stack_alignment_estimated; | |
2e3f842f | 1589 | else |
ae58e548 | 1590 | align = MINIMUM_ALIGNMENT (var, DECL_MODE (var), DECL_ALIGN (var)); |
2e3f842f | 1591 | |
3a42502d RH |
1592 | /* If the variable alignment is very large we'll dynamicaly allocate |
1593 | it, which means that in-frame portion is just a pointer. */ | |
1594 | if (align > MAX_SUPPORTED_STACK_ALIGNMENT) | |
1595 | align = POINTER_SIZE; | |
1596 | } | |
1597 | ||
1f9ceff1 | 1598 | record_alignment_for_reg_var (align); |
3a42502d | 1599 | |
4e3825db MM |
1600 | if (TREE_CODE (origvar) == SSA_NAME) |
1601 | { | |
1602 | gcc_assert (TREE_CODE (var) != VAR_DECL | |
1603 | || (!DECL_EXTERNAL (var) | |
1604 | && !DECL_HAS_VALUE_EXPR_P (var) | |
1605 | && !TREE_STATIC (var) | |
4e3825db MM |
1606 | && TREE_TYPE (var) != error_mark_node |
1607 | && !DECL_HARD_REGISTER (var) | |
1608 | && really_expand)); | |
1609 | } | |
1610 | if (TREE_CODE (var) != VAR_DECL && TREE_CODE (origvar) != SSA_NAME) | |
4846b435 | 1611 | ; |
1f6d3a08 RH |
1612 | else if (DECL_EXTERNAL (var)) |
1613 | ; | |
833b3afe | 1614 | else if (DECL_HAS_VALUE_EXPR_P (var)) |
1f6d3a08 RH |
1615 | ; |
1616 | else if (TREE_STATIC (var)) | |
7e8b322a | 1617 | ; |
eb7adebc | 1618 | else if (TREE_CODE (origvar) != SSA_NAME && DECL_RTL_SET_P (var)) |
1f6d3a08 RH |
1619 | ; |
1620 | else if (TREE_TYPE (var) == error_mark_node) | |
ff28a94d JH |
1621 | { |
1622 | if (really_expand) | |
1623 | expand_one_error_var (var); | |
1624 | } | |
4e3825db | 1625 | else if (TREE_CODE (var) == VAR_DECL && DECL_HARD_REGISTER (var)) |
ff28a94d JH |
1626 | { |
1627 | if (really_expand) | |
c218f6e8 JM |
1628 | { |
1629 | expand_one_hard_reg_var (var); | |
1630 | if (!DECL_HARD_REGISTER (var)) | |
1631 | /* Invalid register specification. */ | |
1632 | expand_one_error_var (var); | |
1633 | } | |
ff28a94d | 1634 | } |
1f6d3a08 | 1635 | else if (use_register_for_decl (var)) |
ff28a94d JH |
1636 | { |
1637 | if (really_expand) | |
4e3825db | 1638 | expand_one_register_var (origvar); |
ff28a94d | 1639 | } |
56099f00 | 1640 | else if (! valid_constant_size_p (DECL_SIZE_UNIT (var))) |
7604eb4e | 1641 | { |
56099f00 | 1642 | /* Reject variables which cover more than half of the address-space. */ |
7604eb4e JJ |
1643 | if (really_expand) |
1644 | { | |
1645 | error ("size of variable %q+D is too large", var); | |
1646 | expand_one_error_var (var); | |
1647 | } | |
1648 | } | |
1f6d3a08 | 1649 | else if (defer_stack_allocation (var, toplevel)) |
4e3825db | 1650 | add_stack_var (origvar); |
1f6d3a08 | 1651 | else |
ff28a94d | 1652 | { |
bd9f1b4b | 1653 | if (really_expand) |
de0fb905 AB |
1654 | { |
1655 | if (lookup_attribute ("naked", | |
1656 | DECL_ATTRIBUTES (current_function_decl))) | |
1657 | error ("cannot allocate stack for variable %q+D, naked function.", | |
1658 | var); | |
1659 | ||
1660 | expand_one_stack_var (origvar); | |
1661 | } | |
1662 | ||
1663 | ||
ae7e9ddd | 1664 | return tree_to_uhwi (DECL_SIZE_UNIT (var)); |
ff28a94d JH |
1665 | } |
1666 | return 0; | |
1f6d3a08 RH |
1667 | } |
1668 | ||
1669 | /* A subroutine of expand_used_vars. Walk down through the BLOCK tree | |
1670 | expanding variables. Those variables that can be put into registers | |
1671 | are allocated pseudos; those that can't are put on the stack. | |
1672 | ||
1673 | TOPLEVEL is true if this is the outermost BLOCK. */ | |
1674 | ||
1675 | static void | |
1676 | expand_used_vars_for_block (tree block, bool toplevel) | |
1677 | { | |
1f6d3a08 RH |
1678 | tree t; |
1679 | ||
1f6d3a08 | 1680 | /* Expand all variables at this level. */ |
910ad8de | 1681 | for (t = BLOCK_VARS (block); t ; t = DECL_CHAIN (t)) |
1ace6185 JJ |
1682 | if (TREE_USED (t) |
1683 | && ((TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != RESULT_DECL) | |
1684 | || !DECL_NONSHAREABLE (t))) | |
ff28a94d | 1685 | expand_one_var (t, toplevel, true); |
1f6d3a08 | 1686 | |
1f6d3a08 RH |
1687 | /* Expand all variables at containing levels. */ |
1688 | for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t)) | |
1689 | expand_used_vars_for_block (t, false); | |
1f6d3a08 RH |
1690 | } |
1691 | ||
1692 | /* A subroutine of expand_used_vars. Walk down through the BLOCK tree | |
1693 | and clear TREE_USED on all local variables. */ | |
1694 | ||
1695 | static void | |
1696 | clear_tree_used (tree block) | |
1697 | { | |
1698 | tree t; | |
1699 | ||
910ad8de | 1700 | for (t = BLOCK_VARS (block); t ; t = DECL_CHAIN (t)) |
1f6d3a08 | 1701 | /* if (!TREE_STATIC (t) && !DECL_EXTERNAL (t)) */ |
1ace6185 JJ |
1702 | if ((TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != RESULT_DECL) |
1703 | || !DECL_NONSHAREABLE (t)) | |
1f6d3a08 RH |
1704 | TREE_USED (t) = 0; |
1705 | ||
1706 | for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t)) | |
1707 | clear_tree_used (t); | |
1708 | } | |
1709 | ||
f6bc1c4a HS |
1710 | enum { |
1711 | SPCT_FLAG_DEFAULT = 1, | |
1712 | SPCT_FLAG_ALL = 2, | |
5434dc07 MD |
1713 | SPCT_FLAG_STRONG = 3, |
1714 | SPCT_FLAG_EXPLICIT = 4 | |
f6bc1c4a HS |
1715 | }; |
1716 | ||
7d69de61 RH |
1717 | /* Examine TYPE and determine a bit mask of the following features. */ |
1718 | ||
1719 | #define SPCT_HAS_LARGE_CHAR_ARRAY 1 | |
1720 | #define SPCT_HAS_SMALL_CHAR_ARRAY 2 | |
1721 | #define SPCT_HAS_ARRAY 4 | |
1722 | #define SPCT_HAS_AGGREGATE 8 | |
1723 | ||
1724 | static unsigned int | |
1725 | stack_protect_classify_type (tree type) | |
1726 | { | |
1727 | unsigned int ret = 0; | |
1728 | tree t; | |
1729 | ||
1730 | switch (TREE_CODE (type)) | |
1731 | { | |
1732 | case ARRAY_TYPE: | |
1733 | t = TYPE_MAIN_VARIANT (TREE_TYPE (type)); | |
1734 | if (t == char_type_node | |
1735 | || t == signed_char_type_node | |
1736 | || t == unsigned_char_type_node) | |
1737 | { | |
15362b89 JJ |
1738 | unsigned HOST_WIDE_INT max = PARAM_VALUE (PARAM_SSP_BUFFER_SIZE); |
1739 | unsigned HOST_WIDE_INT len; | |
7d69de61 | 1740 | |
15362b89 | 1741 | if (!TYPE_SIZE_UNIT (type) |
cc269bb6 | 1742 | || !tree_fits_uhwi_p (TYPE_SIZE_UNIT (type))) |
15362b89 | 1743 | len = max; |
7d69de61 | 1744 | else |
ae7e9ddd | 1745 | len = tree_to_uhwi (TYPE_SIZE_UNIT (type)); |
7d69de61 RH |
1746 | |
1747 | if (len < max) | |
1748 | ret = SPCT_HAS_SMALL_CHAR_ARRAY | SPCT_HAS_ARRAY; | |
1749 | else | |
1750 | ret = SPCT_HAS_LARGE_CHAR_ARRAY | SPCT_HAS_ARRAY; | |
1751 | } | |
1752 | else | |
1753 | ret = SPCT_HAS_ARRAY; | |
1754 | break; | |
1755 | ||
1756 | case UNION_TYPE: | |
1757 | case QUAL_UNION_TYPE: | |
1758 | case RECORD_TYPE: | |
1759 | ret = SPCT_HAS_AGGREGATE; | |
1760 | for (t = TYPE_FIELDS (type); t ; t = TREE_CHAIN (t)) | |
1761 | if (TREE_CODE (t) == FIELD_DECL) | |
1762 | ret |= stack_protect_classify_type (TREE_TYPE (t)); | |
1763 | break; | |
1764 | ||
1765 | default: | |
1766 | break; | |
1767 | } | |
1768 | ||
1769 | return ret; | |
1770 | } | |
1771 | ||
a4d05547 KH |
1772 | /* Return nonzero if DECL should be segregated into the "vulnerable" upper |
1773 | part of the local stack frame. Remember if we ever return nonzero for | |
7d69de61 RH |
1774 | any variable in this function. The return value is the phase number in |
1775 | which the variable should be allocated. */ | |
1776 | ||
1777 | static int | |
1778 | stack_protect_decl_phase (tree decl) | |
1779 | { | |
1780 | unsigned int bits = stack_protect_classify_type (TREE_TYPE (decl)); | |
1781 | int ret = 0; | |
1782 | ||
1783 | if (bits & SPCT_HAS_SMALL_CHAR_ARRAY) | |
1784 | has_short_buffer = true; | |
1785 | ||
f6bc1c4a | 1786 | if (flag_stack_protect == SPCT_FLAG_ALL |
5434dc07 MD |
1787 | || flag_stack_protect == SPCT_FLAG_STRONG |
1788 | || (flag_stack_protect == SPCT_FLAG_EXPLICIT | |
1789 | && lookup_attribute ("stack_protect", | |
1790 | DECL_ATTRIBUTES (current_function_decl)))) | |
7d69de61 RH |
1791 | { |
1792 | if ((bits & (SPCT_HAS_SMALL_CHAR_ARRAY | SPCT_HAS_LARGE_CHAR_ARRAY)) | |
1793 | && !(bits & SPCT_HAS_AGGREGATE)) | |
1794 | ret = 1; | |
1795 | else if (bits & SPCT_HAS_ARRAY) | |
1796 | ret = 2; | |
1797 | } | |
1798 | else | |
1799 | ret = (bits & SPCT_HAS_LARGE_CHAR_ARRAY) != 0; | |
1800 | ||
1801 | if (ret) | |
1802 | has_protected_decls = true; | |
1803 | ||
1804 | return ret; | |
1805 | } | |
1806 | ||
1807 | /* Two helper routines that check for phase 1 and phase 2. These are used | |
1808 | as callbacks for expand_stack_vars. */ | |
1809 | ||
1810 | static bool | |
f3ddd692 JJ |
1811 | stack_protect_decl_phase_1 (size_t i) |
1812 | { | |
1813 | return stack_protect_decl_phase (stack_vars[i].decl) == 1; | |
1814 | } | |
1815 | ||
1816 | static bool | |
1817 | stack_protect_decl_phase_2 (size_t i) | |
7d69de61 | 1818 | { |
f3ddd692 | 1819 | return stack_protect_decl_phase (stack_vars[i].decl) == 2; |
7d69de61 RH |
1820 | } |
1821 | ||
f3ddd692 JJ |
1822 | /* And helper function that checks for asan phase (with stack protector |
1823 | it is phase 3). This is used as callback for expand_stack_vars. | |
1824 | Returns true if any of the vars in the partition need to be protected. */ | |
1825 | ||
7d69de61 | 1826 | static bool |
f3ddd692 | 1827 | asan_decl_phase_3 (size_t i) |
7d69de61 | 1828 | { |
f3ddd692 JJ |
1829 | while (i != EOC) |
1830 | { | |
1831 | if (asan_protect_stack_decl (stack_vars[i].decl)) | |
1832 | return true; | |
1833 | i = stack_vars[i].next; | |
1834 | } | |
1835 | return false; | |
7d69de61 RH |
1836 | } |
1837 | ||
1838 | /* Ensure that variables in different stack protection phases conflict | |
1839 | so that they are not merged and share the same stack slot. */ | |
1840 | ||
1841 | static void | |
1842 | add_stack_protection_conflicts (void) | |
1843 | { | |
1844 | size_t i, j, n = stack_vars_num; | |
1845 | unsigned char *phase; | |
1846 | ||
1847 | phase = XNEWVEC (unsigned char, n); | |
1848 | for (i = 0; i < n; ++i) | |
1849 | phase[i] = stack_protect_decl_phase (stack_vars[i].decl); | |
1850 | ||
1851 | for (i = 0; i < n; ++i) | |
1852 | { | |
1853 | unsigned char ph_i = phase[i]; | |
9b44f5d9 | 1854 | for (j = i + 1; j < n; ++j) |
7d69de61 RH |
1855 | if (ph_i != phase[j]) |
1856 | add_stack_var_conflict (i, j); | |
1857 | } | |
1858 | ||
1859 | XDELETEVEC (phase); | |
1860 | } | |
1861 | ||
1862 | /* Create a decl for the guard at the top of the stack frame. */ | |
1863 | ||
1864 | static void | |
1865 | create_stack_guard (void) | |
1866 | { | |
c2255bc4 AH |
1867 | tree guard = build_decl (DECL_SOURCE_LOCATION (current_function_decl), |
1868 | VAR_DECL, NULL, ptr_type_node); | |
7d69de61 RH |
1869 | TREE_THIS_VOLATILE (guard) = 1; |
1870 | TREE_USED (guard) = 1; | |
1871 | expand_one_stack_var (guard); | |
cb91fab0 | 1872 | crtl->stack_protect_guard = guard; |
7d69de61 RH |
1873 | } |
1874 | ||
ff28a94d | 1875 | /* Prepare for expanding variables. */ |
b8698a0f | 1876 | static void |
ff28a94d JH |
1877 | init_vars_expansion (void) |
1878 | { | |
3f9b14ff SB |
1879 | /* Conflict bitmaps, and a few related temporary bitmaps, go here. */ |
1880 | bitmap_obstack_initialize (&stack_var_bitmap_obstack); | |
ff28a94d | 1881 | |
3f9b14ff | 1882 | /* A map from decl to stack partition. */ |
39c8aaa4 | 1883 | decl_to_stack_part = new hash_map<tree, size_t>; |
ff28a94d JH |
1884 | |
1885 | /* Initialize local stack smashing state. */ | |
1886 | has_protected_decls = false; | |
1887 | has_short_buffer = false; | |
1888 | } | |
1889 | ||
1890 | /* Free up stack variable graph data. */ | |
1891 | static void | |
1892 | fini_vars_expansion (void) | |
1893 | { | |
3f9b14ff SB |
1894 | bitmap_obstack_release (&stack_var_bitmap_obstack); |
1895 | if (stack_vars) | |
1896 | XDELETEVEC (stack_vars); | |
1897 | if (stack_vars_sorted) | |
1898 | XDELETEVEC (stack_vars_sorted); | |
ff28a94d | 1899 | stack_vars = NULL; |
9b44f5d9 | 1900 | stack_vars_sorted = NULL; |
ff28a94d | 1901 | stack_vars_alloc = stack_vars_num = 0; |
39c8aaa4 | 1902 | delete decl_to_stack_part; |
47598145 | 1903 | decl_to_stack_part = NULL; |
ff28a94d JH |
1904 | } |
1905 | ||
30925d94 AO |
1906 | /* Make a fair guess for the size of the stack frame of the function |
1907 | in NODE. This doesn't have to be exact, the result is only used in | |
1908 | the inline heuristics. So we don't want to run the full stack var | |
1909 | packing algorithm (which is quadratic in the number of stack vars). | |
1910 | Instead, we calculate the total size of all stack vars. This turns | |
1911 | out to be a pretty fair estimate -- packing of stack vars doesn't | |
1912 | happen very often. */ | |
b5a430f3 | 1913 | |
ff28a94d | 1914 | HOST_WIDE_INT |
30925d94 | 1915 | estimated_stack_frame_size (struct cgraph_node *node) |
ff28a94d JH |
1916 | { |
1917 | HOST_WIDE_INT size = 0; | |
b5a430f3 | 1918 | size_t i; |
bb7e6d55 | 1919 | tree var; |
67348ccc | 1920 | struct function *fn = DECL_STRUCT_FUNCTION (node->decl); |
30925d94 | 1921 | |
bb7e6d55 | 1922 | push_cfun (fn); |
ff28a94d | 1923 | |
3f9b14ff SB |
1924 | init_vars_expansion (); |
1925 | ||
824f71b9 RG |
1926 | FOR_EACH_LOCAL_DECL (fn, i, var) |
1927 | if (auto_var_in_fn_p (var, fn->decl)) | |
1928 | size += expand_one_var (var, true, false); | |
b5a430f3 | 1929 | |
ff28a94d JH |
1930 | if (stack_vars_num > 0) |
1931 | { | |
b5a430f3 SB |
1932 | /* Fake sorting the stack vars for account_stack_vars (). */ |
1933 | stack_vars_sorted = XNEWVEC (size_t, stack_vars_num); | |
1934 | for (i = 0; i < stack_vars_num; ++i) | |
1935 | stack_vars_sorted[i] = i; | |
ff28a94d | 1936 | size += account_stack_vars (); |
ff28a94d | 1937 | } |
3f9b14ff SB |
1938 | |
1939 | fini_vars_expansion (); | |
2e1ec94f | 1940 | pop_cfun (); |
ff28a94d JH |
1941 | return size; |
1942 | } | |
1943 | ||
f6bc1c4a HS |
1944 | /* Helper routine to check if a record or union contains an array field. */ |
1945 | ||
1946 | static int | |
1947 | record_or_union_type_has_array_p (const_tree tree_type) | |
1948 | { | |
1949 | tree fields = TYPE_FIELDS (tree_type); | |
1950 | tree f; | |
1951 | ||
1952 | for (f = fields; f; f = DECL_CHAIN (f)) | |
1953 | if (TREE_CODE (f) == FIELD_DECL) | |
1954 | { | |
1955 | tree field_type = TREE_TYPE (f); | |
1956 | if (RECORD_OR_UNION_TYPE_P (field_type) | |
1957 | && record_or_union_type_has_array_p (field_type)) | |
1958 | return 1; | |
1959 | if (TREE_CODE (field_type) == ARRAY_TYPE) | |
1960 | return 1; | |
1961 | } | |
1962 | return 0; | |
1963 | } | |
1964 | ||
6545746e FW |
1965 | /* Check if the current function has local referenced variables that |
1966 | have their addresses taken, contain an array, or are arrays. */ | |
1967 | ||
1968 | static bool | |
1969 | stack_protect_decl_p () | |
1970 | { | |
1971 | unsigned i; | |
1972 | tree var; | |
1973 | ||
1974 | FOR_EACH_LOCAL_DECL (cfun, i, var) | |
1975 | if (!is_global_var (var)) | |
1976 | { | |
1977 | tree var_type = TREE_TYPE (var); | |
1978 | if (TREE_CODE (var) == VAR_DECL | |
1979 | && (TREE_CODE (var_type) == ARRAY_TYPE | |
1980 | || TREE_ADDRESSABLE (var) | |
1981 | || (RECORD_OR_UNION_TYPE_P (var_type) | |
1982 | && record_or_union_type_has_array_p (var_type)))) | |
1983 | return true; | |
1984 | } | |
1985 | return false; | |
1986 | } | |
1987 | ||
1988 | /* Check if the current function has calls that use a return slot. */ | |
1989 | ||
1990 | static bool | |
1991 | stack_protect_return_slot_p () | |
1992 | { | |
1993 | basic_block bb; | |
1994 | ||
1995 | FOR_ALL_BB_FN (bb, cfun) | |
1996 | for (gimple_stmt_iterator gsi = gsi_start_bb (bb); | |
1997 | !gsi_end_p (gsi); gsi_next (&gsi)) | |
1998 | { | |
1999 | gimple stmt = gsi_stmt (gsi); | |
2000 | /* This assumes that calls to internal-only functions never | |
2001 | use a return slot. */ | |
2002 | if (is_gimple_call (stmt) | |
2003 | && !gimple_call_internal_p (stmt) | |
2004 | && aggregate_value_p (TREE_TYPE (gimple_call_fntype (stmt)), | |
2005 | gimple_call_fndecl (stmt))) | |
2006 | return true; | |
2007 | } | |
2008 | return false; | |
2009 | } | |
2010 | ||
1f6d3a08 | 2011 | /* Expand all variables used in the function. */ |
727a31fa | 2012 | |
b47aae36 | 2013 | static rtx_insn * |
727a31fa RH |
2014 | expand_used_vars (void) |
2015 | { | |
c021f10b | 2016 | tree var, outer_block = DECL_INITIAL (current_function_decl); |
6e1aa848 | 2017 | vec<tree> maybe_local_decls = vNULL; |
b47aae36 | 2018 | rtx_insn *var_end_seq = NULL; |
4e3825db | 2019 | unsigned i; |
c021f10b | 2020 | unsigned len; |
f6bc1c4a | 2021 | bool gen_stack_protect_signal = false; |
727a31fa | 2022 | |
1f6d3a08 RH |
2023 | /* Compute the phase of the stack frame for this function. */ |
2024 | { | |
2025 | int align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT; | |
2026 | int off = STARTING_FRAME_OFFSET % align; | |
2027 | frame_phase = off ? align - off : 0; | |
2028 | } | |
727a31fa | 2029 | |
3f9b14ff SB |
2030 | /* Set TREE_USED on all variables in the local_decls. */ |
2031 | FOR_EACH_LOCAL_DECL (cfun, i, var) | |
2032 | TREE_USED (var) = 1; | |
2033 | /* Clear TREE_USED on all variables associated with a block scope. */ | |
2034 | clear_tree_used (DECL_INITIAL (current_function_decl)); | |
2035 | ||
ff28a94d | 2036 | init_vars_expansion (); |
7d69de61 | 2037 | |
8f51aa6b IZ |
2038 | if (targetm.use_pseudo_pic_reg ()) |
2039 | pic_offset_table_rtx = gen_reg_rtx (Pmode); | |
2040 | ||
4e3825db MM |
2041 | for (i = 0; i < SA.map->num_partitions; i++) |
2042 | { | |
2043 | tree var = partition_to_var (SA.map, i); | |
2044 | ||
ea057359 | 2045 | gcc_assert (!virtual_operand_p (var)); |
70b5e7dc | 2046 | |
1f9ceff1 | 2047 | expand_one_ssa_partition (var); |
64d7fb90 | 2048 | } |
7eb9f42e | 2049 | |
1f9ceff1 AO |
2050 | for (i = 1; i < num_ssa_names; i++) |
2051 | adjust_one_expanded_partition_var (ssa_name (i)); | |
2052 | ||
f6bc1c4a | 2053 | if (flag_stack_protect == SPCT_FLAG_STRONG) |
6545746e FW |
2054 | gen_stack_protect_signal |
2055 | = stack_protect_decl_p () || stack_protect_return_slot_p (); | |
f6bc1c4a | 2056 | |
cb91fab0 | 2057 | /* At this point all variables on the local_decls with TREE_USED |
1f6d3a08 | 2058 | set are not associated with any block scope. Lay them out. */ |
c021f10b | 2059 | |
9771b263 | 2060 | len = vec_safe_length (cfun->local_decls); |
c021f10b | 2061 | FOR_EACH_LOCAL_DECL (cfun, i, var) |
1f6d3a08 | 2062 | { |
1f6d3a08 RH |
2063 | bool expand_now = false; |
2064 | ||
4e3825db MM |
2065 | /* Expanded above already. */ |
2066 | if (is_gimple_reg (var)) | |
eb7adebc MM |
2067 | { |
2068 | TREE_USED (var) = 0; | |
3adcf52c | 2069 | goto next; |
eb7adebc | 2070 | } |
1f6d3a08 RH |
2071 | /* We didn't set a block for static or extern because it's hard |
2072 | to tell the difference between a global variable (re)declared | |
2073 | in a local scope, and one that's really declared there to | |
2074 | begin with. And it doesn't really matter much, since we're | |
2075 | not giving them stack space. Expand them now. */ | |
4e3825db | 2076 | else if (TREE_STATIC (var) || DECL_EXTERNAL (var)) |
1f6d3a08 RH |
2077 | expand_now = true; |
2078 | ||
ee2e8462 EB |
2079 | /* Expand variables not associated with any block now. Those created by |
2080 | the optimizers could be live anywhere in the function. Those that | |
2081 | could possibly have been scoped originally and detached from their | |
2082 | block will have their allocation deferred so we coalesce them with | |
2083 | others when optimization is enabled. */ | |
1f6d3a08 RH |
2084 | else if (TREE_USED (var)) |
2085 | expand_now = true; | |
2086 | ||
2087 | /* Finally, mark all variables on the list as used. We'll use | |
2088 | this in a moment when we expand those associated with scopes. */ | |
2089 | TREE_USED (var) = 1; | |
2090 | ||
2091 | if (expand_now) | |
3adcf52c JM |
2092 | expand_one_var (var, true, true); |
2093 | ||
2094 | next: | |
2095 | if (DECL_ARTIFICIAL (var) && !DECL_IGNORED_P (var)) | |
802e9f8e | 2096 | { |
3adcf52c JM |
2097 | rtx rtl = DECL_RTL_IF_SET (var); |
2098 | ||
2099 | /* Keep artificial non-ignored vars in cfun->local_decls | |
2100 | chain until instantiate_decls. */ | |
2101 | if (rtl && (MEM_P (rtl) || GET_CODE (rtl) == CONCAT)) | |
c021f10b | 2102 | add_local_decl (cfun, var); |
6c6366f6 | 2103 | else if (rtl == NULL_RTX) |
c021f10b NF |
2104 | /* If rtl isn't set yet, which can happen e.g. with |
2105 | -fstack-protector, retry before returning from this | |
2106 | function. */ | |
9771b263 | 2107 | maybe_local_decls.safe_push (var); |
802e9f8e | 2108 | } |
1f6d3a08 | 2109 | } |
1f6d3a08 | 2110 | |
c021f10b NF |
2111 | /* We duplicated some of the decls in CFUN->LOCAL_DECLS. |
2112 | ||
2113 | +-----------------+-----------------+ | |
2114 | | ...processed... | ...duplicates...| | |
2115 | +-----------------+-----------------+ | |
2116 | ^ | |
2117 | +-- LEN points here. | |
2118 | ||
2119 | We just want the duplicates, as those are the artificial | |
2120 | non-ignored vars that we want to keep until instantiate_decls. | |
2121 | Move them down and truncate the array. */ | |
9771b263 DN |
2122 | if (!vec_safe_is_empty (cfun->local_decls)) |
2123 | cfun->local_decls->block_remove (0, len); | |
c021f10b | 2124 | |
1f6d3a08 RH |
2125 | /* At this point, all variables within the block tree with TREE_USED |
2126 | set are actually used by the optimized function. Lay them out. */ | |
2127 | expand_used_vars_for_block (outer_block, true); | |
2128 | ||
2129 | if (stack_vars_num > 0) | |
2130 | { | |
47598145 | 2131 | add_scope_conflicts (); |
1f6d3a08 | 2132 | |
c22cacf3 | 2133 | /* If stack protection is enabled, we don't share space between |
7d69de61 | 2134 | vulnerable data and non-vulnerable data. */ |
5434dc07 MD |
2135 | if (flag_stack_protect != 0 |
2136 | && (flag_stack_protect != SPCT_FLAG_EXPLICIT | |
2137 | || (flag_stack_protect == SPCT_FLAG_EXPLICIT | |
2138 | && lookup_attribute ("stack_protect", | |
2139 | DECL_ATTRIBUTES (current_function_decl))))) | |
7d69de61 RH |
2140 | add_stack_protection_conflicts (); |
2141 | ||
c22cacf3 | 2142 | /* Now that we have collected all stack variables, and have computed a |
1f6d3a08 RH |
2143 | minimal interference graph, attempt to save some stack space. */ |
2144 | partition_stack_vars (); | |
2145 | if (dump_file) | |
2146 | dump_stack_var_partition (); | |
7d69de61 RH |
2147 | } |
2148 | ||
f6bc1c4a HS |
2149 | switch (flag_stack_protect) |
2150 | { | |
2151 | case SPCT_FLAG_ALL: | |
2152 | create_stack_guard (); | |
2153 | break; | |
2154 | ||
2155 | case SPCT_FLAG_STRONG: | |
2156 | if (gen_stack_protect_signal | |
5434dc07 MD |
2157 | || cfun->calls_alloca || has_protected_decls |
2158 | || lookup_attribute ("stack_protect", | |
2159 | DECL_ATTRIBUTES (current_function_decl))) | |
f6bc1c4a HS |
2160 | create_stack_guard (); |
2161 | break; | |
2162 | ||
2163 | case SPCT_FLAG_DEFAULT: | |
5434dc07 MD |
2164 | if (cfun->calls_alloca || has_protected_decls |
2165 | || lookup_attribute ("stack_protect", | |
2166 | DECL_ATTRIBUTES (current_function_decl))) | |
c3284718 | 2167 | create_stack_guard (); |
f6bc1c4a HS |
2168 | break; |
2169 | ||
5434dc07 MD |
2170 | case SPCT_FLAG_EXPLICIT: |
2171 | if (lookup_attribute ("stack_protect", | |
2172 | DECL_ATTRIBUTES (current_function_decl))) | |
2173 | create_stack_guard (); | |
2174 | break; | |
f6bc1c4a HS |
2175 | default: |
2176 | ; | |
2177 | } | |
1f6d3a08 | 2178 | |
7d69de61 RH |
2179 | /* Assign rtl to each variable based on these partitions. */ |
2180 | if (stack_vars_num > 0) | |
2181 | { | |
f3ddd692 JJ |
2182 | struct stack_vars_data data; |
2183 | ||
6e1aa848 DN |
2184 | data.asan_vec = vNULL; |
2185 | data.asan_decl_vec = vNULL; | |
e361382f JJ |
2186 | data.asan_base = NULL_RTX; |
2187 | data.asan_alignb = 0; | |
f3ddd692 | 2188 | |
7d69de61 RH |
2189 | /* Reorder decls to be protected by iterating over the variables |
2190 | array multiple times, and allocating out of each phase in turn. */ | |
c22cacf3 | 2191 | /* ??? We could probably integrate this into the qsort we did |
7d69de61 RH |
2192 | earlier, such that we naturally see these variables first, |
2193 | and thus naturally allocate things in the right order. */ | |
2194 | if (has_protected_decls) | |
2195 | { | |
2196 | /* Phase 1 contains only character arrays. */ | |
f3ddd692 | 2197 | expand_stack_vars (stack_protect_decl_phase_1, &data); |
7d69de61 RH |
2198 | |
2199 | /* Phase 2 contains other kinds of arrays. */ | |
5434dc07 MD |
2200 | if (flag_stack_protect == SPCT_FLAG_ALL |
2201 | || flag_stack_protect == SPCT_FLAG_STRONG | |
2202 | || (flag_stack_protect == SPCT_FLAG_EXPLICIT | |
2203 | && lookup_attribute ("stack_protect", | |
2204 | DECL_ATTRIBUTES (current_function_decl)))) | |
f3ddd692 | 2205 | expand_stack_vars (stack_protect_decl_phase_2, &data); |
7d69de61 RH |
2206 | } |
2207 | ||
b5ebc991 | 2208 | if ((flag_sanitize & SANITIZE_ADDRESS) && ASAN_STACK) |
f3ddd692 JJ |
2209 | /* Phase 3, any partitions that need asan protection |
2210 | in addition to phase 1 and 2. */ | |
2211 | expand_stack_vars (asan_decl_phase_3, &data); | |
2212 | ||
9771b263 | 2213 | if (!data.asan_vec.is_empty ()) |
f3ddd692 JJ |
2214 | { |
2215 | HOST_WIDE_INT prev_offset = frame_offset; | |
e361382f JJ |
2216 | HOST_WIDE_INT offset, sz, redzonesz; |
2217 | redzonesz = ASAN_RED_ZONE_SIZE; | |
2218 | sz = data.asan_vec[0] - prev_offset; | |
2219 | if (data.asan_alignb > ASAN_RED_ZONE_SIZE | |
2220 | && data.asan_alignb <= 4096 | |
3dc87cc0 | 2221 | && sz + ASAN_RED_ZONE_SIZE >= (int) data.asan_alignb) |
e361382f JJ |
2222 | redzonesz = ((sz + ASAN_RED_ZONE_SIZE + data.asan_alignb - 1) |
2223 | & ~(data.asan_alignb - HOST_WIDE_INT_1)) - sz; | |
2224 | offset | |
2225 | = alloc_stack_frame_space (redzonesz, ASAN_RED_ZONE_SIZE); | |
9771b263 DN |
2226 | data.asan_vec.safe_push (prev_offset); |
2227 | data.asan_vec.safe_push (offset); | |
e5dcd695 LZ |
2228 | /* Leave space for alignment if STRICT_ALIGNMENT. */ |
2229 | if (STRICT_ALIGNMENT) | |
2230 | alloc_stack_frame_space ((GET_MODE_ALIGNMENT (SImode) | |
2231 | << ASAN_SHADOW_SHIFT) | |
2232 | / BITS_PER_UNIT, 1); | |
f3ddd692 JJ |
2233 | |
2234 | var_end_seq | |
2235 | = asan_emit_stack_protection (virtual_stack_vars_rtx, | |
e361382f JJ |
2236 | data.asan_base, |
2237 | data.asan_alignb, | |
9771b263 | 2238 | data.asan_vec.address (), |
e361382f | 2239 | data.asan_decl_vec.address (), |
9771b263 | 2240 | data.asan_vec.length ()); |
f3ddd692 JJ |
2241 | } |
2242 | ||
2243 | expand_stack_vars (NULL, &data); | |
2244 | ||
9771b263 DN |
2245 | data.asan_vec.release (); |
2246 | data.asan_decl_vec.release (); | |
1f6d3a08 RH |
2247 | } |
2248 | ||
3f9b14ff SB |
2249 | fini_vars_expansion (); |
2250 | ||
6c6366f6 JJ |
2251 | /* If there were any artificial non-ignored vars without rtl |
2252 | found earlier, see if deferred stack allocation hasn't assigned | |
2253 | rtl to them. */ | |
9771b263 | 2254 | FOR_EACH_VEC_ELT_REVERSE (maybe_local_decls, i, var) |
6c6366f6 | 2255 | { |
6c6366f6 JJ |
2256 | rtx rtl = DECL_RTL_IF_SET (var); |
2257 | ||
6c6366f6 JJ |
2258 | /* Keep artificial non-ignored vars in cfun->local_decls |
2259 | chain until instantiate_decls. */ | |
2260 | if (rtl && (MEM_P (rtl) || GET_CODE (rtl) == CONCAT)) | |
c021f10b | 2261 | add_local_decl (cfun, var); |
6c6366f6 | 2262 | } |
9771b263 | 2263 | maybe_local_decls.release (); |
6c6366f6 | 2264 | |
1f6d3a08 RH |
2265 | /* If the target requires that FRAME_OFFSET be aligned, do it. */ |
2266 | if (STACK_ALIGNMENT_NEEDED) | |
2267 | { | |
2268 | HOST_WIDE_INT align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT; | |
2269 | if (!FRAME_GROWS_DOWNWARD) | |
2270 | frame_offset += align - 1; | |
2271 | frame_offset &= -align; | |
2272 | } | |
f3ddd692 JJ |
2273 | |
2274 | return var_end_seq; | |
727a31fa RH |
2275 | } |
2276 | ||
2277 | ||
b7211528 SB |
2278 | /* If we need to produce a detailed dump, print the tree representation |
2279 | for STMT to the dump file. SINCE is the last RTX after which the RTL | |
2280 | generated for STMT should have been appended. */ | |
2281 | ||
2282 | static void | |
b47aae36 | 2283 | maybe_dump_rtl_for_gimple_stmt (gimple stmt, rtx_insn *since) |
b7211528 SB |
2284 | { |
2285 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
2286 | { | |
2287 | fprintf (dump_file, "\n;; "); | |
b5b8b0ac AO |
2288 | print_gimple_stmt (dump_file, stmt, 0, |
2289 | TDF_SLIM | (dump_flags & TDF_LINENO)); | |
b7211528 SB |
2290 | fprintf (dump_file, "\n"); |
2291 | ||
2292 | print_rtl (dump_file, since ? NEXT_INSN (since) : since); | |
2293 | } | |
2294 | } | |
2295 | ||
8b11009b ZD |
2296 | /* Maps the blocks that do not contain tree labels to rtx labels. */ |
2297 | ||
134aa83c | 2298 | static hash_map<basic_block, rtx_code_label *> *lab_rtx_for_bb; |
8b11009b | 2299 | |
a9b77cd1 ZD |
2300 | /* Returns the label_rtx expression for a label starting basic block BB. */ |
2301 | ||
1476d1bd | 2302 | static rtx_code_label * |
726a989a | 2303 | label_rtx_for_bb (basic_block bb ATTRIBUTE_UNUSED) |
a9b77cd1 | 2304 | { |
726a989a RB |
2305 | gimple_stmt_iterator gsi; |
2306 | tree lab; | |
a9b77cd1 ZD |
2307 | |
2308 | if (bb->flags & BB_RTL) | |
2309 | return block_label (bb); | |
2310 | ||
134aa83c | 2311 | rtx_code_label **elt = lab_rtx_for_bb->get (bb); |
8b11009b | 2312 | if (elt) |
39c8aaa4 | 2313 | return *elt; |
8b11009b ZD |
2314 | |
2315 | /* Find the tree label if it is present. */ | |
b8698a0f | 2316 | |
726a989a | 2317 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
a9b77cd1 | 2318 | { |
538dd0b7 DM |
2319 | glabel *lab_stmt; |
2320 | ||
2321 | lab_stmt = dyn_cast <glabel *> (gsi_stmt (gsi)); | |
2322 | if (!lab_stmt) | |
a9b77cd1 ZD |
2323 | break; |
2324 | ||
726a989a | 2325 | lab = gimple_label_label (lab_stmt); |
a9b77cd1 ZD |
2326 | if (DECL_NONLOCAL (lab)) |
2327 | break; | |
2328 | ||
1476d1bd | 2329 | return jump_target_rtx (lab); |
a9b77cd1 ZD |
2330 | } |
2331 | ||
19f8b229 | 2332 | rtx_code_label *l = gen_label_rtx (); |
39c8aaa4 TS |
2333 | lab_rtx_for_bb->put (bb, l); |
2334 | return l; | |
a9b77cd1 ZD |
2335 | } |
2336 | ||
726a989a | 2337 | |
529ff441 MM |
2338 | /* A subroutine of expand_gimple_cond. Given E, a fallthrough edge |
2339 | of a basic block where we just expanded the conditional at the end, | |
315adeda MM |
2340 | possibly clean up the CFG and instruction sequence. LAST is the |
2341 | last instruction before the just emitted jump sequence. */ | |
529ff441 MM |
2342 | |
2343 | static void | |
b47aae36 | 2344 | maybe_cleanup_end_of_block (edge e, rtx_insn *last) |
529ff441 MM |
2345 | { |
2346 | /* Special case: when jumpif decides that the condition is | |
2347 | trivial it emits an unconditional jump (and the necessary | |
2348 | barrier). But we still have two edges, the fallthru one is | |
2349 | wrong. purge_dead_edges would clean this up later. Unfortunately | |
2350 | we have to insert insns (and split edges) before | |
2351 | find_many_sub_basic_blocks and hence before purge_dead_edges. | |
2352 | But splitting edges might create new blocks which depend on the | |
2353 | fact that if there are two edges there's no barrier. So the | |
2354 | barrier would get lost and verify_flow_info would ICE. Instead | |
2355 | of auditing all edge splitters to care for the barrier (which | |
2356 | normally isn't there in a cleaned CFG), fix it here. */ | |
2357 | if (BARRIER_P (get_last_insn ())) | |
2358 | { | |
b47aae36 | 2359 | rtx_insn *insn; |
529ff441 MM |
2360 | remove_edge (e); |
2361 | /* Now, we have a single successor block, if we have insns to | |
2362 | insert on the remaining edge we potentially will insert | |
2363 | it at the end of this block (if the dest block isn't feasible) | |
2364 | in order to avoid splitting the edge. This insertion will take | |
2365 | place in front of the last jump. But we might have emitted | |
2366 | multiple jumps (conditional and one unconditional) to the | |
2367 | same destination. Inserting in front of the last one then | |
2368 | is a problem. See PR 40021. We fix this by deleting all | |
2369 | jumps except the last unconditional one. */ | |
2370 | insn = PREV_INSN (get_last_insn ()); | |
2371 | /* Make sure we have an unconditional jump. Otherwise we're | |
2372 | confused. */ | |
2373 | gcc_assert (JUMP_P (insn) && !any_condjump_p (insn)); | |
315adeda | 2374 | for (insn = PREV_INSN (insn); insn != last;) |
529ff441 MM |
2375 | { |
2376 | insn = PREV_INSN (insn); | |
2377 | if (JUMP_P (NEXT_INSN (insn))) | |
90eb3e33 | 2378 | { |
8a269cb7 | 2379 | if (!any_condjump_p (NEXT_INSN (insn))) |
90eb3e33 JJ |
2380 | { |
2381 | gcc_assert (BARRIER_P (NEXT_INSN (NEXT_INSN (insn)))); | |
2382 | delete_insn (NEXT_INSN (NEXT_INSN (insn))); | |
2383 | } | |
2384 | delete_insn (NEXT_INSN (insn)); | |
2385 | } | |
529ff441 MM |
2386 | } |
2387 | } | |
2388 | } | |
2389 | ||
726a989a | 2390 | /* A subroutine of expand_gimple_basic_block. Expand one GIMPLE_COND. |
80c7a9eb RH |
2391 | Returns a new basic block if we've terminated the current basic |
2392 | block and created a new one. */ | |
2393 | ||
2394 | static basic_block | |
538dd0b7 | 2395 | expand_gimple_cond (basic_block bb, gcond *stmt) |
80c7a9eb RH |
2396 | { |
2397 | basic_block new_bb, dest; | |
2398 | edge new_edge; | |
2399 | edge true_edge; | |
2400 | edge false_edge; | |
b47aae36 | 2401 | rtx_insn *last2, *last; |
28ed065e MM |
2402 | enum tree_code code; |
2403 | tree op0, op1; | |
2404 | ||
2405 | code = gimple_cond_code (stmt); | |
2406 | op0 = gimple_cond_lhs (stmt); | |
2407 | op1 = gimple_cond_rhs (stmt); | |
2408 | /* We're sometimes presented with such code: | |
2409 | D.123_1 = x < y; | |
2410 | if (D.123_1 != 0) | |
2411 | ... | |
2412 | This would expand to two comparisons which then later might | |
2413 | be cleaned up by combine. But some pattern matchers like if-conversion | |
2414 | work better when there's only one compare, so make up for this | |
2415 | here as special exception if TER would have made the same change. */ | |
31348d52 | 2416 | if (SA.values |
28ed065e | 2417 | && TREE_CODE (op0) == SSA_NAME |
31348d52 RB |
2418 | && TREE_CODE (TREE_TYPE (op0)) == BOOLEAN_TYPE |
2419 | && TREE_CODE (op1) == INTEGER_CST | |
2420 | && ((gimple_cond_code (stmt) == NE_EXPR | |
2421 | && integer_zerop (op1)) | |
2422 | || (gimple_cond_code (stmt) == EQ_EXPR | |
2423 | && integer_onep (op1))) | |
28ed065e MM |
2424 | && bitmap_bit_p (SA.values, SSA_NAME_VERSION (op0))) |
2425 | { | |
2426 | gimple second = SSA_NAME_DEF_STMT (op0); | |
e83f4b68 | 2427 | if (gimple_code (second) == GIMPLE_ASSIGN) |
28ed065e | 2428 | { |
e83f4b68 MM |
2429 | enum tree_code code2 = gimple_assign_rhs_code (second); |
2430 | if (TREE_CODE_CLASS (code2) == tcc_comparison) | |
2431 | { | |
2432 | code = code2; | |
2433 | op0 = gimple_assign_rhs1 (second); | |
2434 | op1 = gimple_assign_rhs2 (second); | |
2435 | } | |
2d52a3a1 ZC |
2436 | /* If jumps are cheap and the target does not support conditional |
2437 | compare, turn some more codes into jumpy sequences. */ | |
2438 | else if (BRANCH_COST (optimize_insn_for_speed_p (), false) < 4 | |
2439 | && targetm.gen_ccmp_first == NULL) | |
e83f4b68 MM |
2440 | { |
2441 | if ((code2 == BIT_AND_EXPR | |
2442 | && TYPE_PRECISION (TREE_TYPE (op0)) == 1 | |
2443 | && TREE_CODE (gimple_assign_rhs2 (second)) != INTEGER_CST) | |
2444 | || code2 == TRUTH_AND_EXPR) | |
2445 | { | |
2446 | code = TRUTH_ANDIF_EXPR; | |
2447 | op0 = gimple_assign_rhs1 (second); | |
2448 | op1 = gimple_assign_rhs2 (second); | |
2449 | } | |
2450 | else if (code2 == BIT_IOR_EXPR || code2 == TRUTH_OR_EXPR) | |
2451 | { | |
2452 | code = TRUTH_ORIF_EXPR; | |
2453 | op0 = gimple_assign_rhs1 (second); | |
2454 | op1 = gimple_assign_rhs2 (second); | |
2455 | } | |
2456 | } | |
28ed065e MM |
2457 | } |
2458 | } | |
b7211528 SB |
2459 | |
2460 | last2 = last = get_last_insn (); | |
80c7a9eb RH |
2461 | |
2462 | extract_true_false_edges_from_block (bb, &true_edge, &false_edge); | |
5368224f | 2463 | set_curr_insn_location (gimple_location (stmt)); |
80c7a9eb RH |
2464 | |
2465 | /* These flags have no purpose in RTL land. */ | |
2466 | true_edge->flags &= ~EDGE_TRUE_VALUE; | |
2467 | false_edge->flags &= ~EDGE_FALSE_VALUE; | |
2468 | ||
2469 | /* We can either have a pure conditional jump with one fallthru edge or | |
2470 | two-way jump that needs to be decomposed into two basic blocks. */ | |
a9b77cd1 | 2471 | if (false_edge->dest == bb->next_bb) |
80c7a9eb | 2472 | { |
40e90eac JJ |
2473 | jumpif_1 (code, op0, op1, label_rtx_for_bb (true_edge->dest), |
2474 | true_edge->probability); | |
726a989a | 2475 | maybe_dump_rtl_for_gimple_stmt (stmt, last); |
2f13f2de | 2476 | if (true_edge->goto_locus != UNKNOWN_LOCATION) |
5368224f | 2477 | set_curr_insn_location (true_edge->goto_locus); |
a9b77cd1 | 2478 | false_edge->flags |= EDGE_FALLTHRU; |
315adeda | 2479 | maybe_cleanup_end_of_block (false_edge, last); |
80c7a9eb RH |
2480 | return NULL; |
2481 | } | |
a9b77cd1 | 2482 | if (true_edge->dest == bb->next_bb) |
80c7a9eb | 2483 | { |
40e90eac JJ |
2484 | jumpifnot_1 (code, op0, op1, label_rtx_for_bb (false_edge->dest), |
2485 | false_edge->probability); | |
726a989a | 2486 | maybe_dump_rtl_for_gimple_stmt (stmt, last); |
2f13f2de | 2487 | if (false_edge->goto_locus != UNKNOWN_LOCATION) |
5368224f | 2488 | set_curr_insn_location (false_edge->goto_locus); |
a9b77cd1 | 2489 | true_edge->flags |= EDGE_FALLTHRU; |
315adeda | 2490 | maybe_cleanup_end_of_block (true_edge, last); |
80c7a9eb RH |
2491 | return NULL; |
2492 | } | |
80c7a9eb | 2493 | |
40e90eac JJ |
2494 | jumpif_1 (code, op0, op1, label_rtx_for_bb (true_edge->dest), |
2495 | true_edge->probability); | |
80c7a9eb | 2496 | last = get_last_insn (); |
2f13f2de | 2497 | if (false_edge->goto_locus != UNKNOWN_LOCATION) |
5368224f | 2498 | set_curr_insn_location (false_edge->goto_locus); |
a9b77cd1 | 2499 | emit_jump (label_rtx_for_bb (false_edge->dest)); |
80c7a9eb | 2500 | |
1130d5e3 | 2501 | BB_END (bb) = last; |
80c7a9eb | 2502 | if (BARRIER_P (BB_END (bb))) |
1130d5e3 | 2503 | BB_END (bb) = PREV_INSN (BB_END (bb)); |
80c7a9eb RH |
2504 | update_bb_for_insn (bb); |
2505 | ||
2506 | new_bb = create_basic_block (NEXT_INSN (last), get_last_insn (), bb); | |
2507 | dest = false_edge->dest; | |
2508 | redirect_edge_succ (false_edge, new_bb); | |
2509 | false_edge->flags |= EDGE_FALLTHRU; | |
2510 | new_bb->count = false_edge->count; | |
2511 | new_bb->frequency = EDGE_FREQUENCY (false_edge); | |
726338f4 | 2512 | add_bb_to_loop (new_bb, bb->loop_father); |
80c7a9eb RH |
2513 | new_edge = make_edge (new_bb, dest, 0); |
2514 | new_edge->probability = REG_BR_PROB_BASE; | |
2515 | new_edge->count = new_bb->count; | |
2516 | if (BARRIER_P (BB_END (new_bb))) | |
1130d5e3 | 2517 | BB_END (new_bb) = PREV_INSN (BB_END (new_bb)); |
80c7a9eb RH |
2518 | update_bb_for_insn (new_bb); |
2519 | ||
726a989a | 2520 | maybe_dump_rtl_for_gimple_stmt (stmt, last2); |
c22cacf3 | 2521 | |
2f13f2de | 2522 | if (true_edge->goto_locus != UNKNOWN_LOCATION) |
7787b4aa | 2523 | { |
5368224f DC |
2524 | set_curr_insn_location (true_edge->goto_locus); |
2525 | true_edge->goto_locus = curr_insn_location (); | |
7787b4aa | 2526 | } |
7787b4aa | 2527 | |
80c7a9eb RH |
2528 | return new_bb; |
2529 | } | |
2530 | ||
0a35513e AH |
2531 | /* Mark all calls that can have a transaction restart. */ |
2532 | ||
2533 | static void | |
2534 | mark_transaction_restart_calls (gimple stmt) | |
2535 | { | |
2536 | struct tm_restart_node dummy; | |
50979347 | 2537 | tm_restart_node **slot; |
0a35513e AH |
2538 | |
2539 | if (!cfun->gimple_df->tm_restart) | |
2540 | return; | |
2541 | ||
2542 | dummy.stmt = stmt; | |
50979347 | 2543 | slot = cfun->gimple_df->tm_restart->find_slot (&dummy, NO_INSERT); |
0a35513e AH |
2544 | if (slot) |
2545 | { | |
50979347 | 2546 | struct tm_restart_node *n = *slot; |
0a35513e | 2547 | tree list = n->label_or_list; |
b47aae36 | 2548 | rtx_insn *insn; |
0a35513e AH |
2549 | |
2550 | for (insn = next_real_insn (get_last_insn ()); | |
2551 | !CALL_P (insn); | |
2552 | insn = next_real_insn (insn)) | |
2553 | continue; | |
2554 | ||
2555 | if (TREE_CODE (list) == LABEL_DECL) | |
2556 | add_reg_note (insn, REG_TM, label_rtx (list)); | |
2557 | else | |
2558 | for (; list ; list = TREE_CHAIN (list)) | |
2559 | add_reg_note (insn, REG_TM, label_rtx (TREE_VALUE (list))); | |
2560 | } | |
2561 | } | |
2562 | ||
28ed065e MM |
2563 | /* A subroutine of expand_gimple_stmt_1, expanding one GIMPLE_CALL |
2564 | statement STMT. */ | |
2565 | ||
2566 | static void | |
538dd0b7 | 2567 | expand_call_stmt (gcall *stmt) |
28ed065e | 2568 | { |
25583c4f | 2569 | tree exp, decl, lhs; |
e23817b3 | 2570 | bool builtin_p; |
e7925582 | 2571 | size_t i; |
28ed065e | 2572 | |
25583c4f RS |
2573 | if (gimple_call_internal_p (stmt)) |
2574 | { | |
2575 | expand_internal_call (stmt); | |
2576 | return; | |
2577 | } | |
2578 | ||
01156003 | 2579 | exp = build_vl_exp (CALL_EXPR, gimple_call_num_args (stmt) + 3); |
089d1227 | 2580 | |
01156003 | 2581 | CALL_EXPR_FN (exp) = gimple_call_fn (stmt); |
089d1227 IE |
2582 | decl = gimple_call_fndecl (stmt); |
2583 | builtin_p = decl && DECL_BUILT_IN (decl); | |
01156003 | 2584 | |
e7925582 EB |
2585 | /* If this is not a builtin function, the function type through which the |
2586 | call is made may be different from the type of the function. */ | |
2587 | if (!builtin_p) | |
2588 | CALL_EXPR_FN (exp) | |
b25aa0e8 EB |
2589 | = fold_convert (build_pointer_type (gimple_call_fntype (stmt)), |
2590 | CALL_EXPR_FN (exp)); | |
e7925582 | 2591 | |
28ed065e MM |
2592 | TREE_TYPE (exp) = gimple_call_return_type (stmt); |
2593 | CALL_EXPR_STATIC_CHAIN (exp) = gimple_call_chain (stmt); | |
2594 | ||
2595 | for (i = 0; i < gimple_call_num_args (stmt); i++) | |
e23817b3 RG |
2596 | { |
2597 | tree arg = gimple_call_arg (stmt, i); | |
2598 | gimple def; | |
2599 | /* TER addresses into arguments of builtin functions so we have a | |
2600 | chance to infer more correct alignment information. See PR39954. */ | |
2601 | if (builtin_p | |
2602 | && TREE_CODE (arg) == SSA_NAME | |
2603 | && (def = get_gimple_for_ssa_name (arg)) | |
2604 | && gimple_assign_rhs_code (def) == ADDR_EXPR) | |
2605 | arg = gimple_assign_rhs1 (def); | |
2606 | CALL_EXPR_ARG (exp, i) = arg; | |
2607 | } | |
28ed065e | 2608 | |
93f28ca7 | 2609 | if (gimple_has_side_effects (stmt)) |
28ed065e MM |
2610 | TREE_SIDE_EFFECTS (exp) = 1; |
2611 | ||
93f28ca7 | 2612 | if (gimple_call_nothrow_p (stmt)) |
28ed065e MM |
2613 | TREE_NOTHROW (exp) = 1; |
2614 | ||
2615 | CALL_EXPR_TAILCALL (exp) = gimple_call_tail_p (stmt); | |
2616 | CALL_EXPR_RETURN_SLOT_OPT (exp) = gimple_call_return_slot_opt_p (stmt); | |
63d2a353 MM |
2617 | if (decl |
2618 | && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL | |
13e49da9 TV |
2619 | && (DECL_FUNCTION_CODE (decl) == BUILT_IN_ALLOCA |
2620 | || DECL_FUNCTION_CODE (decl) == BUILT_IN_ALLOCA_WITH_ALIGN)) | |
63d2a353 MM |
2621 | CALL_ALLOCA_FOR_VAR_P (exp) = gimple_call_alloca_for_var_p (stmt); |
2622 | else | |
2623 | CALL_FROM_THUNK_P (exp) = gimple_call_from_thunk_p (stmt); | |
28ed065e MM |
2624 | CALL_EXPR_VA_ARG_PACK (exp) = gimple_call_va_arg_pack_p (stmt); |
2625 | SET_EXPR_LOCATION (exp, gimple_location (stmt)); | |
d5e254e1 | 2626 | CALL_WITH_BOUNDS_P (exp) = gimple_call_with_bounds_p (stmt); |
28ed065e | 2627 | |
ddb555ed JJ |
2628 | /* Ensure RTL is created for debug args. */ |
2629 | if (decl && DECL_HAS_DEBUG_ARGS_P (decl)) | |
2630 | { | |
9771b263 | 2631 | vec<tree, va_gc> **debug_args = decl_debug_args_lookup (decl); |
ddb555ed JJ |
2632 | unsigned int ix; |
2633 | tree dtemp; | |
2634 | ||
2635 | if (debug_args) | |
9771b263 | 2636 | for (ix = 1; (*debug_args)->iterate (ix, &dtemp); ix += 2) |
ddb555ed JJ |
2637 | { |
2638 | gcc_assert (TREE_CODE (dtemp) == DEBUG_EXPR_DECL); | |
2639 | expand_debug_expr (dtemp); | |
2640 | } | |
2641 | } | |
2642 | ||
25583c4f | 2643 | lhs = gimple_call_lhs (stmt); |
28ed065e MM |
2644 | if (lhs) |
2645 | expand_assignment (lhs, exp, false); | |
2646 | else | |
4c437f02 | 2647 | expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL); |
0a35513e AH |
2648 | |
2649 | mark_transaction_restart_calls (stmt); | |
28ed065e MM |
2650 | } |
2651 | ||
862d0b35 DN |
2652 | |
2653 | /* Generate RTL for an asm statement (explicit assembler code). | |
2654 | STRING is a STRING_CST node containing the assembler code text, | |
2655 | or an ADDR_EXPR containing a STRING_CST. VOL nonzero means the | |
2656 | insn is volatile; don't optimize it. */ | |
2657 | ||
2658 | static void | |
2659 | expand_asm_loc (tree string, int vol, location_t locus) | |
2660 | { | |
2661 | rtx body; | |
2662 | ||
2663 | if (TREE_CODE (string) == ADDR_EXPR) | |
2664 | string = TREE_OPERAND (string, 0); | |
2665 | ||
2666 | body = gen_rtx_ASM_INPUT_loc (VOIDmode, | |
2667 | ggc_strdup (TREE_STRING_POINTER (string)), | |
2668 | locus); | |
2669 | ||
2670 | MEM_VOLATILE_P (body) = vol; | |
2671 | ||
2672 | emit_insn (body); | |
2673 | } | |
2674 | ||
2675 | /* Return the number of times character C occurs in string S. */ | |
2676 | static int | |
2677 | n_occurrences (int c, const char *s) | |
2678 | { | |
2679 | int n = 0; | |
2680 | while (*s) | |
2681 | n += (*s++ == c); | |
2682 | return n; | |
2683 | } | |
2684 | ||
2685 | /* A subroutine of expand_asm_operands. Check that all operands have | |
2686 | the same number of alternatives. Return true if so. */ | |
2687 | ||
2688 | static bool | |
7ca35180 | 2689 | check_operand_nalternatives (const vec<const char *> &constraints) |
862d0b35 | 2690 | { |
7ca35180 RH |
2691 | unsigned len = constraints.length(); |
2692 | if (len > 0) | |
862d0b35 | 2693 | { |
7ca35180 | 2694 | int nalternatives = n_occurrences (',', constraints[0]); |
862d0b35 DN |
2695 | |
2696 | if (nalternatives + 1 > MAX_RECOG_ALTERNATIVES) | |
2697 | { | |
2698 | error ("too many alternatives in %<asm%>"); | |
2699 | return false; | |
2700 | } | |
2701 | ||
7ca35180 RH |
2702 | for (unsigned i = 1; i < len; ++i) |
2703 | if (n_occurrences (',', constraints[i]) != nalternatives) | |
2704 | { | |
2705 | error ("operand constraints for %<asm%> differ " | |
2706 | "in number of alternatives"); | |
2707 | return false; | |
2708 | } | |
862d0b35 | 2709 | } |
862d0b35 DN |
2710 | return true; |
2711 | } | |
2712 | ||
2713 | /* Check for overlap between registers marked in CLOBBERED_REGS and | |
2714 | anything inappropriate in T. Emit error and return the register | |
2715 | variable definition for error, NULL_TREE for ok. */ | |
2716 | ||
2717 | static bool | |
2718 | tree_conflicts_with_clobbers_p (tree t, HARD_REG_SET *clobbered_regs) | |
2719 | { | |
2720 | /* Conflicts between asm-declared register variables and the clobber | |
2721 | list are not allowed. */ | |
2722 | tree overlap = tree_overlaps_hard_reg_set (t, clobbered_regs); | |
2723 | ||
2724 | if (overlap) | |
2725 | { | |
2726 | error ("asm-specifier for variable %qE conflicts with asm clobber list", | |
2727 | DECL_NAME (overlap)); | |
2728 | ||
2729 | /* Reset registerness to stop multiple errors emitted for a single | |
2730 | variable. */ | |
2731 | DECL_REGISTER (overlap) = 0; | |
2732 | return true; | |
2733 | } | |
2734 | ||
2735 | return false; | |
2736 | } | |
2737 | ||
2738 | /* Generate RTL for an asm statement with arguments. | |
2739 | STRING is the instruction template. | |
2740 | OUTPUTS is a list of output arguments (lvalues); INPUTS a list of inputs. | |
2741 | Each output or input has an expression in the TREE_VALUE and | |
2742 | a tree list in TREE_PURPOSE which in turn contains a constraint | |
2743 | name in TREE_VALUE (or NULL_TREE) and a constraint string | |
2744 | in TREE_PURPOSE. | |
2745 | CLOBBERS is a list of STRING_CST nodes each naming a hard register | |
2746 | that is clobbered by this insn. | |
2747 | ||
2748 | LABELS is a list of labels, and if LABELS is non-NULL, FALLTHRU_BB | |
2749 | should be the fallthru basic block of the asm goto. | |
2750 | ||
2751 | Not all kinds of lvalue that may appear in OUTPUTS can be stored directly. | |
2752 | Some elements of OUTPUTS may be replaced with trees representing temporary | |
2753 | values. The caller should copy those temporary values to the originally | |
2754 | specified lvalues. | |
2755 | ||
2756 | VOL nonzero means the insn is volatile; don't optimize it. */ | |
2757 | ||
2758 | static void | |
6476a8fd | 2759 | expand_asm_stmt (gasm *stmt) |
862d0b35 | 2760 | { |
7ca35180 RH |
2761 | class save_input_location |
2762 | { | |
2763 | location_t old; | |
6476a8fd | 2764 | |
7ca35180 RH |
2765 | public: |
2766 | explicit save_input_location(location_t where) | |
6476a8fd | 2767 | { |
7ca35180 RH |
2768 | old = input_location; |
2769 | input_location = where; | |
6476a8fd RH |
2770 | } |
2771 | ||
7ca35180 | 2772 | ~save_input_location() |
6476a8fd | 2773 | { |
7ca35180 | 2774 | input_location = old; |
6476a8fd | 2775 | } |
7ca35180 | 2776 | }; |
6476a8fd | 2777 | |
7ca35180 | 2778 | location_t locus = gimple_location (stmt); |
6476a8fd | 2779 | |
7ca35180 | 2780 | if (gimple_asm_input_p (stmt)) |
6476a8fd | 2781 | { |
7ca35180 RH |
2782 | const char *s = gimple_asm_string (stmt); |
2783 | tree string = build_string (strlen (s), s); | |
2784 | expand_asm_loc (string, gimple_asm_volatile_p (stmt), locus); | |
2785 | return; | |
6476a8fd RH |
2786 | } |
2787 | ||
7ca35180 RH |
2788 | /* There are some legacy diagnostics in here, and also avoids a |
2789 | sixth parameger to targetm.md_asm_adjust. */ | |
2790 | save_input_location s_i_l(locus); | |
6476a8fd | 2791 | |
7ca35180 RH |
2792 | unsigned noutputs = gimple_asm_noutputs (stmt); |
2793 | unsigned ninputs = gimple_asm_ninputs (stmt); | |
2794 | unsigned nlabels = gimple_asm_nlabels (stmt); | |
2795 | unsigned i; | |
2796 | ||
2797 | /* ??? Diagnose during gimplification? */ | |
2798 | if (ninputs + noutputs + nlabels > MAX_RECOG_OPERANDS) | |
6476a8fd | 2799 | { |
7ca35180 | 2800 | error ("more than %d operands in %<asm%>", MAX_RECOG_OPERANDS); |
6476a8fd RH |
2801 | return; |
2802 | } | |
2803 | ||
7ca35180 RH |
2804 | auto_vec<tree, MAX_RECOG_OPERANDS> output_tvec; |
2805 | auto_vec<tree, MAX_RECOG_OPERANDS> input_tvec; | |
2806 | auto_vec<const char *, MAX_RECOG_OPERANDS> constraints; | |
6476a8fd | 2807 | |
7ca35180 | 2808 | /* Copy the gimple vectors into new vectors that we can manipulate. */ |
862d0b35 | 2809 | |
7ca35180 RH |
2810 | output_tvec.safe_grow (noutputs); |
2811 | input_tvec.safe_grow (ninputs); | |
2812 | constraints.safe_grow (noutputs + ninputs); | |
862d0b35 | 2813 | |
7ca35180 RH |
2814 | for (i = 0; i < noutputs; ++i) |
2815 | { | |
2816 | tree t = gimple_asm_output_op (stmt, i); | |
2817 | output_tvec[i] = TREE_VALUE (t); | |
2818 | constraints[i] = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t))); | |
2819 | } | |
2820 | for (i = 0; i < ninputs; i++) | |
2821 | { | |
2822 | tree t = gimple_asm_input_op (stmt, i); | |
2823 | input_tvec[i] = TREE_VALUE (t); | |
2824 | constraints[i + noutputs] | |
2825 | = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t))); | |
2826 | } | |
862d0b35 | 2827 | |
7ca35180 RH |
2828 | /* ??? Diagnose during gimplification? */ |
2829 | if (! check_operand_nalternatives (constraints)) | |
2830 | return; | |
862d0b35 DN |
2831 | |
2832 | /* Count the number of meaningful clobbered registers, ignoring what | |
2833 | we would ignore later. */ | |
7ca35180 RH |
2834 | auto_vec<rtx> clobber_rvec; |
2835 | HARD_REG_SET clobbered_regs; | |
862d0b35 | 2836 | CLEAR_HARD_REG_SET (clobbered_regs); |
862d0b35 | 2837 | |
7ca35180 RH |
2838 | if (unsigned n = gimple_asm_nclobbers (stmt)) |
2839 | { | |
2840 | clobber_rvec.reserve (n); | |
2841 | for (i = 0; i < n; i++) | |
2842 | { | |
2843 | tree t = gimple_asm_clobber_op (stmt, i); | |
2844 | const char *regname = TREE_STRING_POINTER (TREE_VALUE (t)); | |
2845 | int nregs, j; | |
862d0b35 | 2846 | |
7ca35180 RH |
2847 | j = decode_reg_name_and_count (regname, &nregs); |
2848 | if (j < 0) | |
862d0b35 | 2849 | { |
7ca35180 | 2850 | if (j == -2) |
862d0b35 | 2851 | { |
7ca35180 RH |
2852 | /* ??? Diagnose during gimplification? */ |
2853 | error ("unknown register name %qs in %<asm%>", regname); | |
2854 | } | |
2855 | else if (j == -4) | |
2856 | { | |
2857 | rtx x = gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode)); | |
2858 | clobber_rvec.safe_push (x); | |
2859 | } | |
2860 | else | |
2861 | { | |
2862 | /* Otherwise we should have -1 == empty string | |
2863 | or -3 == cc, which is not a register. */ | |
2864 | gcc_assert (j == -1 || j == -3); | |
862d0b35 | 2865 | } |
862d0b35 | 2866 | } |
7ca35180 RH |
2867 | else |
2868 | for (int reg = j; reg < j + nregs; reg++) | |
2869 | { | |
2870 | /* Clobbering the PIC register is an error. */ | |
2871 | if (reg == (int) PIC_OFFSET_TABLE_REGNUM) | |
2872 | { | |
2873 | /* ??? Diagnose during gimplification? */ | |
2874 | error ("PIC register clobbered by %qs in %<asm%>", | |
2875 | regname); | |
2876 | return; | |
2877 | } | |
2878 | ||
2879 | SET_HARD_REG_BIT (clobbered_regs, reg); | |
2880 | rtx x = gen_rtx_REG (reg_raw_mode[reg], reg); | |
2881 | clobber_rvec.safe_push (x); | |
2882 | } | |
862d0b35 DN |
2883 | } |
2884 | } | |
7ca35180 | 2885 | unsigned nclobbers = clobber_rvec.length(); |
862d0b35 DN |
2886 | |
2887 | /* First pass over inputs and outputs checks validity and sets | |
2888 | mark_addressable if needed. */ | |
7ca35180 | 2889 | /* ??? Diagnose during gimplification? */ |
862d0b35 | 2890 | |
7ca35180 | 2891 | for (i = 0; i < noutputs; ++i) |
862d0b35 | 2892 | { |
7ca35180 | 2893 | tree val = output_tvec[i]; |
862d0b35 DN |
2894 | tree type = TREE_TYPE (val); |
2895 | const char *constraint; | |
2896 | bool is_inout; | |
2897 | bool allows_reg; | |
2898 | bool allows_mem; | |
2899 | ||
862d0b35 DN |
2900 | /* Try to parse the output constraint. If that fails, there's |
2901 | no point in going further. */ | |
2902 | constraint = constraints[i]; | |
2903 | if (!parse_output_constraint (&constraint, i, ninputs, noutputs, | |
2904 | &allows_mem, &allows_reg, &is_inout)) | |
2905 | return; | |
2906 | ||
2907 | if (! allows_reg | |
2908 | && (allows_mem | |
2909 | || is_inout | |
2910 | || (DECL_P (val) | |
2911 | && REG_P (DECL_RTL (val)) | |
2912 | && GET_MODE (DECL_RTL (val)) != TYPE_MODE (type)))) | |
2913 | mark_addressable (val); | |
862d0b35 DN |
2914 | } |
2915 | ||
7ca35180 | 2916 | for (i = 0; i < ninputs; ++i) |
862d0b35 DN |
2917 | { |
2918 | bool allows_reg, allows_mem; | |
2919 | const char *constraint; | |
2920 | ||
862d0b35 | 2921 | constraint = constraints[i + noutputs]; |
7ca35180 RH |
2922 | if (! parse_input_constraint (&constraint, i, ninputs, noutputs, 0, |
2923 | constraints.address (), | |
2924 | &allows_mem, &allows_reg)) | |
862d0b35 DN |
2925 | return; |
2926 | ||
2927 | if (! allows_reg && allows_mem) | |
7ca35180 | 2928 | mark_addressable (input_tvec[i]); |
862d0b35 DN |
2929 | } |
2930 | ||
2931 | /* Second pass evaluates arguments. */ | |
2932 | ||
2933 | /* Make sure stack is consistent for asm goto. */ | |
2934 | if (nlabels > 0) | |
2935 | do_pending_stack_adjust (); | |
7ca35180 RH |
2936 | int old_generating_concat_p = generating_concat_p; |
2937 | ||
2938 | /* Vector of RTX's of evaluated output operands. */ | |
2939 | auto_vec<rtx, MAX_RECOG_OPERANDS> output_rvec; | |
2940 | auto_vec<int, MAX_RECOG_OPERANDS> inout_opnum; | |
2941 | rtx_insn *after_rtl_seq = NULL, *after_rtl_end = NULL; | |
862d0b35 | 2942 | |
7ca35180 RH |
2943 | output_rvec.safe_grow (noutputs); |
2944 | ||
2945 | for (i = 0; i < noutputs; ++i) | |
862d0b35 | 2946 | { |
7ca35180 | 2947 | tree val = output_tvec[i]; |
862d0b35 | 2948 | tree type = TREE_TYPE (val); |
7ca35180 | 2949 | bool is_inout, allows_reg, allows_mem, ok; |
862d0b35 | 2950 | rtx op; |
862d0b35 DN |
2951 | |
2952 | ok = parse_output_constraint (&constraints[i], i, ninputs, | |
2953 | noutputs, &allows_mem, &allows_reg, | |
2954 | &is_inout); | |
2955 | gcc_assert (ok); | |
2956 | ||
2957 | /* If an output operand is not a decl or indirect ref and our constraint | |
2958 | allows a register, make a temporary to act as an intermediate. | |
7ca35180 | 2959 | Make the asm insn write into that, then we will copy it to |
862d0b35 DN |
2960 | the real output operand. Likewise for promoted variables. */ |
2961 | ||
2962 | generating_concat_p = 0; | |
2963 | ||
862d0b35 DN |
2964 | if ((TREE_CODE (val) == INDIRECT_REF |
2965 | && allows_mem) | |
2966 | || (DECL_P (val) | |
2967 | && (allows_mem || REG_P (DECL_RTL (val))) | |
2968 | && ! (REG_P (DECL_RTL (val)) | |
2969 | && GET_MODE (DECL_RTL (val)) != TYPE_MODE (type))) | |
2970 | || ! allows_reg | |
2971 | || is_inout) | |
2972 | { | |
2973 | op = expand_expr (val, NULL_RTX, VOIDmode, | |
2974 | !allows_reg ? EXPAND_MEMORY : EXPAND_WRITE); | |
2975 | if (MEM_P (op)) | |
2976 | op = validize_mem (op); | |
2977 | ||
2978 | if (! allows_reg && !MEM_P (op)) | |
2979 | error ("output number %d not directly addressable", i); | |
2980 | if ((! allows_mem && MEM_P (op)) | |
2981 | || GET_CODE (op) == CONCAT) | |
2982 | { | |
7ca35180 | 2983 | rtx old_op = op; |
862d0b35 | 2984 | op = gen_reg_rtx (GET_MODE (op)); |
7ca35180 RH |
2985 | |
2986 | generating_concat_p = old_generating_concat_p; | |
2987 | ||
862d0b35 | 2988 | if (is_inout) |
7ca35180 RH |
2989 | emit_move_insn (op, old_op); |
2990 | ||
2991 | push_to_sequence2 (after_rtl_seq, after_rtl_end); | |
2992 | emit_move_insn (old_op, op); | |
2993 | after_rtl_seq = get_insns (); | |
2994 | after_rtl_end = get_last_insn (); | |
2995 | end_sequence (); | |
862d0b35 DN |
2996 | } |
2997 | } | |
2998 | else | |
2999 | { | |
3000 | op = assign_temp (type, 0, 1); | |
3001 | op = validize_mem (op); | |
7ca35180 RH |
3002 | if (!MEM_P (op) && TREE_CODE (val) == SSA_NAME) |
3003 | set_reg_attrs_for_decl_rtl (SSA_NAME_VAR (val), op); | |
862d0b35 | 3004 | |
7ca35180 | 3005 | generating_concat_p = old_generating_concat_p; |
862d0b35 | 3006 | |
7ca35180 RH |
3007 | push_to_sequence2 (after_rtl_seq, after_rtl_end); |
3008 | expand_assignment (val, make_tree (type, op), false); | |
3009 | after_rtl_seq = get_insns (); | |
3010 | after_rtl_end = get_last_insn (); | |
3011 | end_sequence (); | |
862d0b35 | 3012 | } |
7ca35180 | 3013 | output_rvec[i] = op; |
862d0b35 | 3014 | |
7ca35180 RH |
3015 | if (is_inout) |
3016 | inout_opnum.safe_push (i); | |
862d0b35 DN |
3017 | } |
3018 | ||
7ca35180 RH |
3019 | auto_vec<rtx, MAX_RECOG_OPERANDS> input_rvec; |
3020 | auto_vec<machine_mode, MAX_RECOG_OPERANDS> input_mode; | |
862d0b35 | 3021 | |
7ca35180 RH |
3022 | input_rvec.safe_grow (ninputs); |
3023 | input_mode.safe_grow (ninputs); | |
862d0b35 | 3024 | |
7ca35180 | 3025 | generating_concat_p = 0; |
862d0b35 | 3026 | |
7ca35180 | 3027 | for (i = 0; i < ninputs; ++i) |
862d0b35 | 3028 | { |
7ca35180 RH |
3029 | tree val = input_tvec[i]; |
3030 | tree type = TREE_TYPE (val); | |
3031 | bool allows_reg, allows_mem, ok; | |
862d0b35 | 3032 | const char *constraint; |
862d0b35 | 3033 | rtx op; |
862d0b35 DN |
3034 | |
3035 | constraint = constraints[i + noutputs]; | |
7ca35180 RH |
3036 | ok = parse_input_constraint (&constraint, i, ninputs, noutputs, 0, |
3037 | constraints.address (), | |
3038 | &allows_mem, &allows_reg); | |
862d0b35 DN |
3039 | gcc_assert (ok); |
3040 | ||
862d0b35 DN |
3041 | /* EXPAND_INITIALIZER will not generate code for valid initializer |
3042 | constants, but will still generate code for other types of operand. | |
3043 | This is the behavior we want for constant constraints. */ | |
3044 | op = expand_expr (val, NULL_RTX, VOIDmode, | |
3045 | allows_reg ? EXPAND_NORMAL | |
3046 | : allows_mem ? EXPAND_MEMORY | |
3047 | : EXPAND_INITIALIZER); | |
3048 | ||
3049 | /* Never pass a CONCAT to an ASM. */ | |
3050 | if (GET_CODE (op) == CONCAT) | |
3051 | op = force_reg (GET_MODE (op), op); | |
3052 | else if (MEM_P (op)) | |
3053 | op = validize_mem (op); | |
3054 | ||
3055 | if (asm_operand_ok (op, constraint, NULL) <= 0) | |
3056 | { | |
3057 | if (allows_reg && TYPE_MODE (type) != BLKmode) | |
3058 | op = force_reg (TYPE_MODE (type), op); | |
3059 | else if (!allows_mem) | |
3060 | warning (0, "asm operand %d probably doesn%'t match constraints", | |
3061 | i + noutputs); | |
3062 | else if (MEM_P (op)) | |
3063 | { | |
3064 | /* We won't recognize either volatile memory or memory | |
3065 | with a queued address as available a memory_operand | |
3066 | at this point. Ignore it: clearly this *is* a memory. */ | |
3067 | } | |
3068 | else | |
3069 | gcc_unreachable (); | |
3070 | } | |
7ca35180 RH |
3071 | input_rvec[i] = op; |
3072 | input_mode[i] = TYPE_MODE (type); | |
862d0b35 DN |
3073 | } |
3074 | ||
862d0b35 | 3075 | /* For in-out operands, copy output rtx to input rtx. */ |
7ca35180 | 3076 | unsigned ninout = inout_opnum.length(); |
862d0b35 DN |
3077 | for (i = 0; i < ninout; i++) |
3078 | { | |
3079 | int j = inout_opnum[i]; | |
7ca35180 | 3080 | rtx o = output_rvec[j]; |
862d0b35 | 3081 | |
7ca35180 RH |
3082 | input_rvec.safe_push (o); |
3083 | input_mode.safe_push (GET_MODE (o)); | |
862d0b35 | 3084 | |
7ca35180 | 3085 | char buffer[16]; |
862d0b35 | 3086 | sprintf (buffer, "%d", j); |
7ca35180 RH |
3087 | constraints.safe_push (ggc_strdup (buffer)); |
3088 | } | |
3089 | ninputs += ninout; | |
3090 | ||
3091 | /* Sometimes we wish to automatically clobber registers across an asm. | |
3092 | Case in point is when the i386 backend moved from cc0 to a hard reg -- | |
3093 | maintaining source-level compatibility means automatically clobbering | |
3094 | the flags register. */ | |
3095 | rtx_insn *after_md_seq = NULL; | |
3096 | if (targetm.md_asm_adjust) | |
3097 | after_md_seq = targetm.md_asm_adjust (output_rvec, input_rvec, | |
3098 | constraints, clobber_rvec, | |
3099 | clobbered_regs); | |
3100 | ||
3101 | /* Do not allow the hook to change the output and input count, | |
3102 | lest it mess up the operand numbering. */ | |
3103 | gcc_assert (output_rvec.length() == noutputs); | |
3104 | gcc_assert (input_rvec.length() == ninputs); | |
3105 | gcc_assert (constraints.length() == noutputs + ninputs); | |
3106 | ||
3107 | /* But it certainly can adjust the clobbers. */ | |
3108 | nclobbers = clobber_rvec.length(); | |
3109 | ||
3110 | /* Third pass checks for easy conflicts. */ | |
3111 | /* ??? Why are we doing this on trees instead of rtx. */ | |
3112 | ||
3113 | bool clobber_conflict_found = 0; | |
3114 | for (i = 0; i < noutputs; ++i) | |
3115 | if (tree_conflicts_with_clobbers_p (output_tvec[i], &clobbered_regs)) | |
3116 | clobber_conflict_found = 1; | |
3117 | for (i = 0; i < ninputs - ninout; ++i) | |
3118 | if (tree_conflicts_with_clobbers_p (input_tvec[i], &clobbered_regs)) | |
3119 | clobber_conflict_found = 1; | |
3120 | ||
3121 | /* Make vectors for the expression-rtx, constraint strings, | |
3122 | and named operands. */ | |
3123 | ||
3124 | rtvec argvec = rtvec_alloc (ninputs); | |
3125 | rtvec constraintvec = rtvec_alloc (ninputs); | |
3126 | rtvec labelvec = rtvec_alloc (nlabels); | |
3127 | ||
3128 | rtx body = gen_rtx_ASM_OPERANDS ((noutputs == 0 ? VOIDmode | |
3129 | : GET_MODE (output_rvec[0])), | |
3130 | ggc_strdup (gimple_asm_string (stmt)), | |
3131 | empty_string, 0, argvec, constraintvec, | |
3132 | labelvec, locus); | |
3133 | MEM_VOLATILE_P (body) = gimple_asm_volatile_p (stmt); | |
3134 | ||
3135 | for (i = 0; i < ninputs; ++i) | |
3136 | { | |
3137 | ASM_OPERANDS_INPUT (body, i) = input_rvec[i]; | |
3138 | ASM_OPERANDS_INPUT_CONSTRAINT_EXP (body, i) | |
3139 | = gen_rtx_ASM_INPUT_loc (input_mode[i], | |
3140 | constraints[i + noutputs], | |
3141 | locus); | |
862d0b35 DN |
3142 | } |
3143 | ||
3144 | /* Copy labels to the vector. */ | |
7ca35180 RH |
3145 | rtx_code_label *fallthru_label = NULL; |
3146 | if (nlabels > 0) | |
3147 | { | |
3148 | basic_block fallthru_bb = NULL; | |
3149 | edge fallthru = find_fallthru_edge (gimple_bb (stmt)->succs); | |
3150 | if (fallthru) | |
3151 | fallthru_bb = fallthru->dest; | |
3152 | ||
3153 | for (i = 0; i < nlabels; ++i) | |
862d0b35 | 3154 | { |
7ca35180 | 3155 | tree label = TREE_VALUE (gimple_asm_label_op (stmt, i)); |
e67d1102 | 3156 | rtx_insn *r; |
7ca35180 RH |
3157 | /* If asm goto has any labels in the fallthru basic block, use |
3158 | a label that we emit immediately after the asm goto. Expansion | |
3159 | may insert further instructions into the same basic block after | |
3160 | asm goto and if we don't do this, insertion of instructions on | |
3161 | the fallthru edge might misbehave. See PR58670. */ | |
3162 | if (fallthru_bb && label_to_block_fn (cfun, label) == fallthru_bb) | |
3163 | { | |
3164 | if (fallthru_label == NULL_RTX) | |
3165 | fallthru_label = gen_label_rtx (); | |
3166 | r = fallthru_label; | |
3167 | } | |
3168 | else | |
3169 | r = label_rtx (label); | |
3170 | ASM_OPERANDS_LABEL (body, i) = gen_rtx_LABEL_REF (Pmode, r); | |
862d0b35 | 3171 | } |
862d0b35 DN |
3172 | } |
3173 | ||
862d0b35 DN |
3174 | /* Now, for each output, construct an rtx |
3175 | (set OUTPUT (asm_operands INSN OUTPUTCONSTRAINT OUTPUTNUMBER | |
3176 | ARGVEC CONSTRAINTS OPNAMES)) | |
3177 | If there is more than one, put them inside a PARALLEL. */ | |
3178 | ||
3179 | if (nlabels > 0 && nclobbers == 0) | |
3180 | { | |
3181 | gcc_assert (noutputs == 0); | |
3182 | emit_jump_insn (body); | |
3183 | } | |
3184 | else if (noutputs == 0 && nclobbers == 0) | |
3185 | { | |
3186 | /* No output operands: put in a raw ASM_OPERANDS rtx. */ | |
3187 | emit_insn (body); | |
3188 | } | |
3189 | else if (noutputs == 1 && nclobbers == 0) | |
3190 | { | |
7ca35180 RH |
3191 | ASM_OPERANDS_OUTPUT_CONSTRAINT (body) = constraints[0]; |
3192 | emit_insn (gen_rtx_SET (output_rvec[0], body)); | |
862d0b35 DN |
3193 | } |
3194 | else | |
3195 | { | |
3196 | rtx obody = body; | |
3197 | int num = noutputs; | |
3198 | ||
3199 | if (num == 0) | |
3200 | num = 1; | |
3201 | ||
3202 | body = gen_rtx_PARALLEL (VOIDmode, rtvec_alloc (num + nclobbers)); | |
3203 | ||
3204 | /* For each output operand, store a SET. */ | |
7ca35180 | 3205 | for (i = 0; i < noutputs; ++i) |
862d0b35 | 3206 | { |
7ca35180 RH |
3207 | rtx src, o = output_rvec[i]; |
3208 | if (i == 0) | |
3209 | { | |
3210 | ASM_OPERANDS_OUTPUT_CONSTRAINT (obody) = constraints[0]; | |
3211 | src = obody; | |
3212 | } | |
3213 | else | |
3214 | { | |
3215 | src = gen_rtx_ASM_OPERANDS (GET_MODE (o), | |
3216 | ASM_OPERANDS_TEMPLATE (obody), | |
3217 | constraints[i], i, argvec, | |
3218 | constraintvec, labelvec, locus); | |
3219 | MEM_VOLATILE_P (src) = gimple_asm_volatile_p (stmt); | |
3220 | } | |
3221 | XVECEXP (body, 0, i) = gen_rtx_SET (o, src); | |
862d0b35 DN |
3222 | } |
3223 | ||
3224 | /* If there are no outputs (but there are some clobbers) | |
3225 | store the bare ASM_OPERANDS into the PARALLEL. */ | |
862d0b35 DN |
3226 | if (i == 0) |
3227 | XVECEXP (body, 0, i++) = obody; | |
3228 | ||
3229 | /* Store (clobber REG) for each clobbered register specified. */ | |
7ca35180 | 3230 | for (unsigned j = 0; j < nclobbers; ++j) |
862d0b35 | 3231 | { |
7ca35180 | 3232 | rtx clobbered_reg = clobber_rvec[j]; |
862d0b35 | 3233 | |
7ca35180 RH |
3234 | /* Do sanity check for overlap between clobbers and respectively |
3235 | input and outputs that hasn't been handled. Such overlap | |
3236 | should have been detected and reported above. */ | |
3237 | if (!clobber_conflict_found && REG_P (clobbered_reg)) | |
862d0b35 | 3238 | { |
7ca35180 RH |
3239 | /* We test the old body (obody) contents to avoid |
3240 | tripping over the under-construction body. */ | |
3241 | for (unsigned k = 0; k < noutputs; ++k) | |
3242 | if (reg_overlap_mentioned_p (clobbered_reg, output_rvec[k])) | |
3243 | internal_error ("asm clobber conflict with output operand"); | |
3244 | ||
3245 | for (unsigned k = 0; k < ninputs - ninout; ++k) | |
3246 | if (reg_overlap_mentioned_p (clobbered_reg, input_rvec[k])) | |
3247 | internal_error ("asm clobber conflict with input operand"); | |
862d0b35 DN |
3248 | } |
3249 | ||
7ca35180 | 3250 | XVECEXP (body, 0, i++) = gen_rtx_CLOBBER (VOIDmode, clobbered_reg); |
862d0b35 DN |
3251 | } |
3252 | ||
3253 | if (nlabels > 0) | |
3254 | emit_jump_insn (body); | |
3255 | else | |
3256 | emit_insn (body); | |
3257 | } | |
3258 | ||
7ca35180 RH |
3259 | generating_concat_p = old_generating_concat_p; |
3260 | ||
862d0b35 DN |
3261 | if (fallthru_label) |
3262 | emit_label (fallthru_label); | |
3263 | ||
7ca35180 RH |
3264 | if (after_md_seq) |
3265 | emit_insn (after_md_seq); | |
3266 | if (after_rtl_seq) | |
3267 | emit_insn (after_rtl_seq); | |
862d0b35 | 3268 | |
6476a8fd | 3269 | free_temp_slots (); |
7ca35180 | 3270 | crtl->has_asm_statement = 1; |
862d0b35 DN |
3271 | } |
3272 | ||
3273 | /* Emit code to jump to the address | |
3274 | specified by the pointer expression EXP. */ | |
3275 | ||
3276 | static void | |
3277 | expand_computed_goto (tree exp) | |
3278 | { | |
3279 | rtx x = expand_normal (exp); | |
3280 | ||
862d0b35 DN |
3281 | do_pending_stack_adjust (); |
3282 | emit_indirect_jump (x); | |
3283 | } | |
3284 | ||
3285 | /* Generate RTL code for a `goto' statement with target label LABEL. | |
3286 | LABEL should be a LABEL_DECL tree node that was or will later be | |
3287 | defined with `expand_label'. */ | |
3288 | ||
3289 | static void | |
3290 | expand_goto (tree label) | |
3291 | { | |
3292 | #ifdef ENABLE_CHECKING | |
3293 | /* Check for a nonlocal goto to a containing function. Should have | |
3294 | gotten translated to __builtin_nonlocal_goto. */ | |
3295 | tree context = decl_function_context (label); | |
3296 | gcc_assert (!context || context == current_function_decl); | |
3297 | #endif | |
3298 | ||
1476d1bd | 3299 | emit_jump (jump_target_rtx (label)); |
862d0b35 DN |
3300 | } |
3301 | ||
3302 | /* Output a return with no value. */ | |
3303 | ||
3304 | static void | |
3305 | expand_null_return_1 (void) | |
3306 | { | |
3307 | clear_pending_stack_adjust (); | |
3308 | do_pending_stack_adjust (); | |
3309 | emit_jump (return_label); | |
3310 | } | |
3311 | ||
3312 | /* Generate RTL to return from the current function, with no value. | |
3313 | (That is, we do not do anything about returning any value.) */ | |
3314 | ||
3315 | void | |
3316 | expand_null_return (void) | |
3317 | { | |
3318 | /* If this function was declared to return a value, but we | |
3319 | didn't, clobber the return registers so that they are not | |
3320 | propagated live to the rest of the function. */ | |
3321 | clobber_return_register (); | |
3322 | ||
3323 | expand_null_return_1 (); | |
3324 | } | |
3325 | ||
3326 | /* Generate RTL to return from the current function, with value VAL. */ | |
3327 | ||
3328 | static void | |
3329 | expand_value_return (rtx val) | |
3330 | { | |
3331 | /* Copy the value to the return location unless it's already there. */ | |
3332 | ||
3333 | tree decl = DECL_RESULT (current_function_decl); | |
3334 | rtx return_reg = DECL_RTL (decl); | |
3335 | if (return_reg != val) | |
3336 | { | |
3337 | tree funtype = TREE_TYPE (current_function_decl); | |
3338 | tree type = TREE_TYPE (decl); | |
3339 | int unsignedp = TYPE_UNSIGNED (type); | |
ef4bddc2 RS |
3340 | machine_mode old_mode = DECL_MODE (decl); |
3341 | machine_mode mode; | |
862d0b35 DN |
3342 | if (DECL_BY_REFERENCE (decl)) |
3343 | mode = promote_function_mode (type, old_mode, &unsignedp, funtype, 2); | |
3344 | else | |
3345 | mode = promote_function_mode (type, old_mode, &unsignedp, funtype, 1); | |
3346 | ||
3347 | if (mode != old_mode) | |
3348 | val = convert_modes (mode, old_mode, val, unsignedp); | |
3349 | ||
3350 | if (GET_CODE (return_reg) == PARALLEL) | |
3351 | emit_group_load (return_reg, val, type, int_size_in_bytes (type)); | |
3352 | else | |
3353 | emit_move_insn (return_reg, val); | |
3354 | } | |
3355 | ||
3356 | expand_null_return_1 (); | |
3357 | } | |
3358 | ||
3359 | /* Generate RTL to evaluate the expression RETVAL and return it | |
3360 | from the current function. */ | |
3361 | ||
3362 | static void | |
d5e254e1 | 3363 | expand_return (tree retval, tree bounds) |
862d0b35 DN |
3364 | { |
3365 | rtx result_rtl; | |
3366 | rtx val = 0; | |
3367 | tree retval_rhs; | |
d5e254e1 | 3368 | rtx bounds_rtl; |
862d0b35 DN |
3369 | |
3370 | /* If function wants no value, give it none. */ | |
3371 | if (TREE_CODE (TREE_TYPE (TREE_TYPE (current_function_decl))) == VOID_TYPE) | |
3372 | { | |
3373 | expand_normal (retval); | |
3374 | expand_null_return (); | |
3375 | return; | |
3376 | } | |
3377 | ||
3378 | if (retval == error_mark_node) | |
3379 | { | |
3380 | /* Treat this like a return of no value from a function that | |
3381 | returns a value. */ | |
3382 | expand_null_return (); | |
3383 | return; | |
3384 | } | |
3385 | else if ((TREE_CODE (retval) == MODIFY_EXPR | |
3386 | || TREE_CODE (retval) == INIT_EXPR) | |
3387 | && TREE_CODE (TREE_OPERAND (retval, 0)) == RESULT_DECL) | |
3388 | retval_rhs = TREE_OPERAND (retval, 1); | |
3389 | else | |
3390 | retval_rhs = retval; | |
3391 | ||
3392 | result_rtl = DECL_RTL (DECL_RESULT (current_function_decl)); | |
3393 | ||
d5e254e1 IE |
3394 | /* Put returned bounds to the right place. */ |
3395 | bounds_rtl = DECL_BOUNDS_RTL (DECL_RESULT (current_function_decl)); | |
3396 | if (bounds_rtl) | |
3397 | { | |
855f036d IE |
3398 | rtx addr = NULL; |
3399 | rtx bnd = NULL; | |
d5e254e1 | 3400 | |
855f036d | 3401 | if (bounds && bounds != error_mark_node) |
d5e254e1 IE |
3402 | { |
3403 | bnd = expand_normal (bounds); | |
3404 | targetm.calls.store_returned_bounds (bounds_rtl, bnd); | |
3405 | } | |
3406 | else if (REG_P (bounds_rtl)) | |
3407 | { | |
855f036d IE |
3408 | if (bounds) |
3409 | bnd = chkp_expand_zero_bounds (); | |
3410 | else | |
3411 | { | |
3412 | addr = expand_normal (build_fold_addr_expr (retval_rhs)); | |
3413 | addr = gen_rtx_MEM (Pmode, addr); | |
3414 | bnd = targetm.calls.load_bounds_for_arg (addr, NULL, NULL); | |
3415 | } | |
3416 | ||
d5e254e1 IE |
3417 | targetm.calls.store_returned_bounds (bounds_rtl, bnd); |
3418 | } | |
3419 | else | |
3420 | { | |
3421 | int n; | |
3422 | ||
3423 | gcc_assert (GET_CODE (bounds_rtl) == PARALLEL); | |
3424 | ||
855f036d IE |
3425 | if (bounds) |
3426 | bnd = chkp_expand_zero_bounds (); | |
3427 | else | |
3428 | { | |
3429 | addr = expand_normal (build_fold_addr_expr (retval_rhs)); | |
3430 | addr = gen_rtx_MEM (Pmode, addr); | |
3431 | } | |
d5e254e1 IE |
3432 | |
3433 | for (n = 0; n < XVECLEN (bounds_rtl, 0); n++) | |
3434 | { | |
d5e254e1 | 3435 | rtx slot = XEXP (XVECEXP (bounds_rtl, 0, n), 0); |
855f036d IE |
3436 | if (!bounds) |
3437 | { | |
3438 | rtx offs = XEXP (XVECEXP (bounds_rtl, 0, n), 1); | |
3439 | rtx from = adjust_address (addr, Pmode, INTVAL (offs)); | |
3440 | bnd = targetm.calls.load_bounds_for_arg (from, NULL, NULL); | |
3441 | } | |
d5e254e1 IE |
3442 | targetm.calls.store_returned_bounds (slot, bnd); |
3443 | } | |
3444 | } | |
3445 | } | |
3446 | else if (chkp_function_instrumented_p (current_function_decl) | |
3447 | && !BOUNDED_P (retval_rhs) | |
3448 | && chkp_type_has_pointer (TREE_TYPE (retval_rhs)) | |
3449 | && TREE_CODE (retval_rhs) != RESULT_DECL) | |
3450 | { | |
3451 | rtx addr = expand_normal (build_fold_addr_expr (retval_rhs)); | |
3452 | addr = gen_rtx_MEM (Pmode, addr); | |
3453 | ||
3454 | gcc_assert (MEM_P (result_rtl)); | |
3455 | ||
3456 | chkp_copy_bounds_for_stack_parm (result_rtl, addr, TREE_TYPE (retval_rhs)); | |
3457 | } | |
3458 | ||
862d0b35 DN |
3459 | /* If we are returning the RESULT_DECL, then the value has already |
3460 | been stored into it, so we don't have to do anything special. */ | |
3461 | if (TREE_CODE (retval_rhs) == RESULT_DECL) | |
3462 | expand_value_return (result_rtl); | |
3463 | ||
3464 | /* If the result is an aggregate that is being returned in one (or more) | |
3465 | registers, load the registers here. */ | |
3466 | ||
3467 | else if (retval_rhs != 0 | |
3468 | && TYPE_MODE (TREE_TYPE (retval_rhs)) == BLKmode | |
3469 | && REG_P (result_rtl)) | |
3470 | { | |
3471 | val = copy_blkmode_to_reg (GET_MODE (result_rtl), retval_rhs); | |
3472 | if (val) | |
3473 | { | |
3474 | /* Use the mode of the result value on the return register. */ | |
3475 | PUT_MODE (result_rtl, GET_MODE (val)); | |
3476 | expand_value_return (val); | |
3477 | } | |
3478 | else | |
3479 | expand_null_return (); | |
3480 | } | |
3481 | else if (retval_rhs != 0 | |
3482 | && !VOID_TYPE_P (TREE_TYPE (retval_rhs)) | |
3483 | && (REG_P (result_rtl) | |
3484 | || (GET_CODE (result_rtl) == PARALLEL))) | |
3485 | { | |
9ee5337d EB |
3486 | /* Compute the return value into a temporary (usually a pseudo reg). */ |
3487 | val | |
3488 | = assign_temp (TREE_TYPE (DECL_RESULT (current_function_decl)), 0, 1); | |
862d0b35 DN |
3489 | val = expand_expr (retval_rhs, val, GET_MODE (val), EXPAND_NORMAL); |
3490 | val = force_not_mem (val); | |
862d0b35 DN |
3491 | expand_value_return (val); |
3492 | } | |
3493 | else | |
3494 | { | |
3495 | /* No hard reg used; calculate value into hard return reg. */ | |
3496 | expand_expr (retval, const0_rtx, VOIDmode, EXPAND_NORMAL); | |
3497 | expand_value_return (result_rtl); | |
3498 | } | |
3499 | } | |
3500 | ||
28ed065e MM |
3501 | /* A subroutine of expand_gimple_stmt, expanding one gimple statement |
3502 | STMT that doesn't require special handling for outgoing edges. That | |
3503 | is no tailcalls and no GIMPLE_COND. */ | |
3504 | ||
3505 | static void | |
3506 | expand_gimple_stmt_1 (gimple stmt) | |
3507 | { | |
3508 | tree op0; | |
c82fee88 | 3509 | |
5368224f | 3510 | set_curr_insn_location (gimple_location (stmt)); |
c82fee88 | 3511 | |
28ed065e MM |
3512 | switch (gimple_code (stmt)) |
3513 | { | |
3514 | case GIMPLE_GOTO: | |
3515 | op0 = gimple_goto_dest (stmt); | |
3516 | if (TREE_CODE (op0) == LABEL_DECL) | |
3517 | expand_goto (op0); | |
3518 | else | |
3519 | expand_computed_goto (op0); | |
3520 | break; | |
3521 | case GIMPLE_LABEL: | |
538dd0b7 | 3522 | expand_label (gimple_label_label (as_a <glabel *> (stmt))); |
28ed065e MM |
3523 | break; |
3524 | case GIMPLE_NOP: | |
3525 | case GIMPLE_PREDICT: | |
3526 | break; | |
28ed065e | 3527 | case GIMPLE_SWITCH: |
538dd0b7 | 3528 | expand_case (as_a <gswitch *> (stmt)); |
28ed065e MM |
3529 | break; |
3530 | case GIMPLE_ASM: | |
538dd0b7 | 3531 | expand_asm_stmt (as_a <gasm *> (stmt)); |
28ed065e MM |
3532 | break; |
3533 | case GIMPLE_CALL: | |
538dd0b7 | 3534 | expand_call_stmt (as_a <gcall *> (stmt)); |
28ed065e MM |
3535 | break; |
3536 | ||
3537 | case GIMPLE_RETURN: | |
855f036d IE |
3538 | { |
3539 | tree bnd = gimple_return_retbnd (as_a <greturn *> (stmt)); | |
3540 | op0 = gimple_return_retval (as_a <greturn *> (stmt)); | |
28ed065e | 3541 | |
855f036d IE |
3542 | if (op0 && op0 != error_mark_node) |
3543 | { | |
3544 | tree result = DECL_RESULT (current_function_decl); | |
28ed065e | 3545 | |
855f036d IE |
3546 | /* If we are not returning the current function's RESULT_DECL, |
3547 | build an assignment to it. */ | |
3548 | if (op0 != result) | |
3549 | { | |
3550 | /* I believe that a function's RESULT_DECL is unique. */ | |
3551 | gcc_assert (TREE_CODE (op0) != RESULT_DECL); | |
3552 | ||
3553 | /* ??? We'd like to use simply expand_assignment here, | |
3554 | but this fails if the value is of BLKmode but the return | |
3555 | decl is a register. expand_return has special handling | |
3556 | for this combination, which eventually should move | |
3557 | to common code. See comments there. Until then, let's | |
3558 | build a modify expression :-/ */ | |
3559 | op0 = build2 (MODIFY_EXPR, TREE_TYPE (result), | |
3560 | result, op0); | |
3561 | } | |
3562 | /* Mark we have return statement with missing bounds. */ | |
3563 | if (!bnd && chkp_function_instrumented_p (cfun->decl)) | |
3564 | bnd = error_mark_node; | |
3565 | } | |
3566 | ||
3567 | if (!op0) | |
3568 | expand_null_return (); | |
3569 | else | |
3570 | expand_return (op0, bnd); | |
3571 | } | |
28ed065e MM |
3572 | break; |
3573 | ||
3574 | case GIMPLE_ASSIGN: | |
3575 | { | |
538dd0b7 DM |
3576 | gassign *assign_stmt = as_a <gassign *> (stmt); |
3577 | tree lhs = gimple_assign_lhs (assign_stmt); | |
28ed065e MM |
3578 | |
3579 | /* Tree expand used to fiddle with |= and &= of two bitfield | |
3580 | COMPONENT_REFs here. This can't happen with gimple, the LHS | |
3581 | of binary assigns must be a gimple reg. */ | |
3582 | ||
3583 | if (TREE_CODE (lhs) != SSA_NAME | |
3584 | || get_gimple_rhs_class (gimple_expr_code (stmt)) | |
3585 | == GIMPLE_SINGLE_RHS) | |
3586 | { | |
538dd0b7 | 3587 | tree rhs = gimple_assign_rhs1 (assign_stmt); |
28ed065e MM |
3588 | gcc_assert (get_gimple_rhs_class (gimple_expr_code (stmt)) |
3589 | == GIMPLE_SINGLE_RHS); | |
3590 | if (gimple_has_location (stmt) && CAN_HAVE_LOCATION_P (rhs)) | |
3591 | SET_EXPR_LOCATION (rhs, gimple_location (stmt)); | |
47598145 MM |
3592 | if (TREE_CLOBBER_P (rhs)) |
3593 | /* This is a clobber to mark the going out of scope for | |
3594 | this LHS. */ | |
3595 | ; | |
3596 | else | |
3597 | expand_assignment (lhs, rhs, | |
538dd0b7 DM |
3598 | gimple_assign_nontemporal_move_p ( |
3599 | assign_stmt)); | |
28ed065e MM |
3600 | } |
3601 | else | |
3602 | { | |
3603 | rtx target, temp; | |
538dd0b7 | 3604 | bool nontemporal = gimple_assign_nontemporal_move_p (assign_stmt); |
28ed065e MM |
3605 | struct separate_ops ops; |
3606 | bool promoted = false; | |
3607 | ||
3608 | target = expand_expr (lhs, NULL_RTX, VOIDmode, EXPAND_WRITE); | |
3609 | if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target)) | |
3610 | promoted = true; | |
3611 | ||
538dd0b7 | 3612 | ops.code = gimple_assign_rhs_code (assign_stmt); |
28ed065e | 3613 | ops.type = TREE_TYPE (lhs); |
b0dd8c90 | 3614 | switch (get_gimple_rhs_class (ops.code)) |
28ed065e | 3615 | { |
0354c0c7 | 3616 | case GIMPLE_TERNARY_RHS: |
538dd0b7 | 3617 | ops.op2 = gimple_assign_rhs3 (assign_stmt); |
0354c0c7 | 3618 | /* Fallthru */ |
28ed065e | 3619 | case GIMPLE_BINARY_RHS: |
538dd0b7 | 3620 | ops.op1 = gimple_assign_rhs2 (assign_stmt); |
28ed065e MM |
3621 | /* Fallthru */ |
3622 | case GIMPLE_UNARY_RHS: | |
538dd0b7 | 3623 | ops.op0 = gimple_assign_rhs1 (assign_stmt); |
28ed065e MM |
3624 | break; |
3625 | default: | |
3626 | gcc_unreachable (); | |
3627 | } | |
3628 | ops.location = gimple_location (stmt); | |
3629 | ||
3630 | /* If we want to use a nontemporal store, force the value to | |
3631 | register first. If we store into a promoted register, | |
3632 | don't directly expand to target. */ | |
3633 | temp = nontemporal || promoted ? NULL_RTX : target; | |
3634 | temp = expand_expr_real_2 (&ops, temp, GET_MODE (target), | |
3635 | EXPAND_NORMAL); | |
3636 | ||
3637 | if (temp == target) | |
3638 | ; | |
3639 | else if (promoted) | |
3640 | { | |
362d42dc | 3641 | int unsignedp = SUBREG_PROMOTED_SIGN (target); |
28ed065e MM |
3642 | /* If TEMP is a VOIDmode constant, use convert_modes to make |
3643 | sure that we properly convert it. */ | |
3644 | if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode) | |
3645 | { | |
3646 | temp = convert_modes (GET_MODE (target), | |
3647 | TYPE_MODE (ops.type), | |
4e18a7d4 | 3648 | temp, unsignedp); |
28ed065e | 3649 | temp = convert_modes (GET_MODE (SUBREG_REG (target)), |
4e18a7d4 | 3650 | GET_MODE (target), temp, unsignedp); |
28ed065e MM |
3651 | } |
3652 | ||
27be0c32 | 3653 | convert_move (SUBREG_REG (target), temp, unsignedp); |
28ed065e MM |
3654 | } |
3655 | else if (nontemporal && emit_storent_insn (target, temp)) | |
3656 | ; | |
3657 | else | |
3658 | { | |
3659 | temp = force_operand (temp, target); | |
3660 | if (temp != target) | |
3661 | emit_move_insn (target, temp); | |
3662 | } | |
3663 | } | |
3664 | } | |
3665 | break; | |
3666 | ||
3667 | default: | |
3668 | gcc_unreachable (); | |
3669 | } | |
3670 | } | |
3671 | ||
3672 | /* Expand one gimple statement STMT and return the last RTL instruction | |
3673 | before any of the newly generated ones. | |
3674 | ||
3675 | In addition to generating the necessary RTL instructions this also | |
3676 | sets REG_EH_REGION notes if necessary and sets the current source | |
3677 | location for diagnostics. */ | |
3678 | ||
b47aae36 | 3679 | static rtx_insn * |
28ed065e MM |
3680 | expand_gimple_stmt (gimple stmt) |
3681 | { | |
28ed065e | 3682 | location_t saved_location = input_location; |
b47aae36 | 3683 | rtx_insn *last = get_last_insn (); |
c82fee88 | 3684 | int lp_nr; |
28ed065e | 3685 | |
28ed065e MM |
3686 | gcc_assert (cfun); |
3687 | ||
c82fee88 EB |
3688 | /* We need to save and restore the current source location so that errors |
3689 | discovered during expansion are emitted with the right location. But | |
3690 | it would be better if the diagnostic routines used the source location | |
3691 | embedded in the tree nodes rather than globals. */ | |
28ed065e | 3692 | if (gimple_has_location (stmt)) |
c82fee88 | 3693 | input_location = gimple_location (stmt); |
28ed065e MM |
3694 | |
3695 | expand_gimple_stmt_1 (stmt); | |
c82fee88 | 3696 | |
28ed065e MM |
3697 | /* Free any temporaries used to evaluate this statement. */ |
3698 | free_temp_slots (); | |
3699 | ||
3700 | input_location = saved_location; | |
3701 | ||
3702 | /* Mark all insns that may trap. */ | |
1d65f45c RH |
3703 | lp_nr = lookup_stmt_eh_lp (stmt); |
3704 | if (lp_nr) | |
28ed065e | 3705 | { |
b47aae36 | 3706 | rtx_insn *insn; |
28ed065e MM |
3707 | for (insn = next_real_insn (last); insn; |
3708 | insn = next_real_insn (insn)) | |
3709 | { | |
3710 | if (! find_reg_note (insn, REG_EH_REGION, NULL_RTX) | |
3711 | /* If we want exceptions for non-call insns, any | |
3712 | may_trap_p instruction may throw. */ | |
3713 | && GET_CODE (PATTERN (insn)) != CLOBBER | |
3714 | && GET_CODE (PATTERN (insn)) != USE | |
1d65f45c RH |
3715 | && insn_could_throw_p (insn)) |
3716 | make_reg_eh_region_note (insn, 0, lp_nr); | |
28ed065e MM |
3717 | } |
3718 | } | |
3719 | ||
3720 | return last; | |
3721 | } | |
3722 | ||
726a989a | 3723 | /* A subroutine of expand_gimple_basic_block. Expand one GIMPLE_CALL |
224e770b RH |
3724 | that has CALL_EXPR_TAILCALL set. Returns non-null if we actually |
3725 | generated a tail call (something that might be denied by the ABI | |
cea49550 RH |
3726 | rules governing the call; see calls.c). |
3727 | ||
3728 | Sets CAN_FALLTHRU if we generated a *conditional* tail call, and | |
3729 | can still reach the rest of BB. The case here is __builtin_sqrt, | |
3730 | where the NaN result goes through the external function (with a | |
3731 | tailcall) and the normal result happens via a sqrt instruction. */ | |
80c7a9eb RH |
3732 | |
3733 | static basic_block | |
538dd0b7 | 3734 | expand_gimple_tailcall (basic_block bb, gcall *stmt, bool *can_fallthru) |
80c7a9eb | 3735 | { |
b47aae36 | 3736 | rtx_insn *last2, *last; |
224e770b | 3737 | edge e; |
628f6a4e | 3738 | edge_iterator ei; |
224e770b RH |
3739 | int probability; |
3740 | gcov_type count; | |
80c7a9eb | 3741 | |
28ed065e | 3742 | last2 = last = expand_gimple_stmt (stmt); |
80c7a9eb RH |
3743 | |
3744 | for (last = NEXT_INSN (last); last; last = NEXT_INSN (last)) | |
224e770b RH |
3745 | if (CALL_P (last) && SIBLING_CALL_P (last)) |
3746 | goto found; | |
80c7a9eb | 3747 | |
726a989a | 3748 | maybe_dump_rtl_for_gimple_stmt (stmt, last2); |
b7211528 | 3749 | |
cea49550 | 3750 | *can_fallthru = true; |
224e770b | 3751 | return NULL; |
80c7a9eb | 3752 | |
224e770b RH |
3753 | found: |
3754 | /* ??? Wouldn't it be better to just reset any pending stack adjust? | |
3755 | Any instructions emitted here are about to be deleted. */ | |
3756 | do_pending_stack_adjust (); | |
3757 | ||
3758 | /* Remove any non-eh, non-abnormal edges that don't go to exit. */ | |
3759 | /* ??? I.e. the fallthrough edge. HOWEVER! If there were to be | |
3760 | EH or abnormal edges, we shouldn't have created a tail call in | |
3761 | the first place. So it seems to me we should just be removing | |
3762 | all edges here, or redirecting the existing fallthru edge to | |
3763 | the exit block. */ | |
3764 | ||
224e770b RH |
3765 | probability = 0; |
3766 | count = 0; | |
224e770b | 3767 | |
628f6a4e BE |
3768 | for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) |
3769 | { | |
224e770b RH |
3770 | if (!(e->flags & (EDGE_ABNORMAL | EDGE_EH))) |
3771 | { | |
fefa31b5 | 3772 | if (e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun)) |
80c7a9eb | 3773 | { |
224e770b RH |
3774 | e->dest->count -= e->count; |
3775 | e->dest->frequency -= EDGE_FREQUENCY (e); | |
3776 | if (e->dest->count < 0) | |
c22cacf3 | 3777 | e->dest->count = 0; |
224e770b | 3778 | if (e->dest->frequency < 0) |
c22cacf3 | 3779 | e->dest->frequency = 0; |
80c7a9eb | 3780 | } |
224e770b RH |
3781 | count += e->count; |
3782 | probability += e->probability; | |
3783 | remove_edge (e); | |
80c7a9eb | 3784 | } |
628f6a4e BE |
3785 | else |
3786 | ei_next (&ei); | |
80c7a9eb RH |
3787 | } |
3788 | ||
224e770b RH |
3789 | /* This is somewhat ugly: the call_expr expander often emits instructions |
3790 | after the sibcall (to perform the function return). These confuse the | |
12eff7b7 | 3791 | find_many_sub_basic_blocks code, so we need to get rid of these. */ |
224e770b | 3792 | last = NEXT_INSN (last); |
341c100f | 3793 | gcc_assert (BARRIER_P (last)); |
cea49550 RH |
3794 | |
3795 | *can_fallthru = false; | |
224e770b RH |
3796 | while (NEXT_INSN (last)) |
3797 | { | |
3798 | /* For instance an sqrt builtin expander expands if with | |
3799 | sibcall in the then and label for `else`. */ | |
3800 | if (LABEL_P (NEXT_INSN (last))) | |
cea49550 RH |
3801 | { |
3802 | *can_fallthru = true; | |
3803 | break; | |
3804 | } | |
224e770b RH |
3805 | delete_insn (NEXT_INSN (last)); |
3806 | } | |
3807 | ||
fefa31b5 DM |
3808 | e = make_edge (bb, EXIT_BLOCK_PTR_FOR_FN (cfun), EDGE_ABNORMAL |
3809 | | EDGE_SIBCALL); | |
224e770b RH |
3810 | e->probability += probability; |
3811 | e->count += count; | |
1130d5e3 | 3812 | BB_END (bb) = last; |
224e770b RH |
3813 | update_bb_for_insn (bb); |
3814 | ||
3815 | if (NEXT_INSN (last)) | |
3816 | { | |
3817 | bb = create_basic_block (NEXT_INSN (last), get_last_insn (), bb); | |
3818 | ||
3819 | last = BB_END (bb); | |
3820 | if (BARRIER_P (last)) | |
1130d5e3 | 3821 | BB_END (bb) = PREV_INSN (last); |
224e770b RH |
3822 | } |
3823 | ||
726a989a | 3824 | maybe_dump_rtl_for_gimple_stmt (stmt, last2); |
b7211528 | 3825 | |
224e770b | 3826 | return bb; |
80c7a9eb RH |
3827 | } |
3828 | ||
b5b8b0ac AO |
3829 | /* Return the difference between the floor and the truncated result of |
3830 | a signed division by OP1 with remainder MOD. */ | |
3831 | static rtx | |
ef4bddc2 | 3832 | floor_sdiv_adjust (machine_mode mode, rtx mod, rtx op1) |
b5b8b0ac AO |
3833 | { |
3834 | /* (mod != 0 ? (op1 / mod < 0 ? -1 : 0) : 0) */ | |
3835 | return gen_rtx_IF_THEN_ELSE | |
3836 | (mode, gen_rtx_NE (BImode, mod, const0_rtx), | |
3837 | gen_rtx_IF_THEN_ELSE | |
3838 | (mode, gen_rtx_LT (BImode, | |
3839 | gen_rtx_DIV (mode, op1, mod), | |
3840 | const0_rtx), | |
3841 | constm1_rtx, const0_rtx), | |
3842 | const0_rtx); | |
3843 | } | |
3844 | ||
3845 | /* Return the difference between the ceil and the truncated result of | |
3846 | a signed division by OP1 with remainder MOD. */ | |
3847 | static rtx | |
ef4bddc2 | 3848 | ceil_sdiv_adjust (machine_mode mode, rtx mod, rtx op1) |
b5b8b0ac AO |
3849 | { |
3850 | /* (mod != 0 ? (op1 / mod > 0 ? 1 : 0) : 0) */ | |
3851 | return gen_rtx_IF_THEN_ELSE | |
3852 | (mode, gen_rtx_NE (BImode, mod, const0_rtx), | |
3853 | gen_rtx_IF_THEN_ELSE | |
3854 | (mode, gen_rtx_GT (BImode, | |
3855 | gen_rtx_DIV (mode, op1, mod), | |
3856 | const0_rtx), | |
3857 | const1_rtx, const0_rtx), | |
3858 | const0_rtx); | |
3859 | } | |
3860 | ||
3861 | /* Return the difference between the ceil and the truncated result of | |
3862 | an unsigned division by OP1 with remainder MOD. */ | |
3863 | static rtx | |
ef4bddc2 | 3864 | ceil_udiv_adjust (machine_mode mode, rtx mod, rtx op1 ATTRIBUTE_UNUSED) |
b5b8b0ac AO |
3865 | { |
3866 | /* (mod != 0 ? 1 : 0) */ | |
3867 | return gen_rtx_IF_THEN_ELSE | |
3868 | (mode, gen_rtx_NE (BImode, mod, const0_rtx), | |
3869 | const1_rtx, const0_rtx); | |
3870 | } | |
3871 | ||
3872 | /* Return the difference between the rounded and the truncated result | |
3873 | of a signed division by OP1 with remainder MOD. Halfway cases are | |
3874 | rounded away from zero, rather than to the nearest even number. */ | |
3875 | static rtx | |
ef4bddc2 | 3876 | round_sdiv_adjust (machine_mode mode, rtx mod, rtx op1) |
b5b8b0ac AO |
3877 | { |
3878 | /* (abs (mod) >= abs (op1) - abs (mod) | |
3879 | ? (op1 / mod > 0 ? 1 : -1) | |
3880 | : 0) */ | |
3881 | return gen_rtx_IF_THEN_ELSE | |
3882 | (mode, gen_rtx_GE (BImode, gen_rtx_ABS (mode, mod), | |
3883 | gen_rtx_MINUS (mode, | |
3884 | gen_rtx_ABS (mode, op1), | |
3885 | gen_rtx_ABS (mode, mod))), | |
3886 | gen_rtx_IF_THEN_ELSE | |
3887 | (mode, gen_rtx_GT (BImode, | |
3888 | gen_rtx_DIV (mode, op1, mod), | |
3889 | const0_rtx), | |
3890 | const1_rtx, constm1_rtx), | |
3891 | const0_rtx); | |
3892 | } | |
3893 | ||
3894 | /* Return the difference between the rounded and the truncated result | |
3895 | of a unsigned division by OP1 with remainder MOD. Halfway cases | |
3896 | are rounded away from zero, rather than to the nearest even | |
3897 | number. */ | |
3898 | static rtx | |
ef4bddc2 | 3899 | round_udiv_adjust (machine_mode mode, rtx mod, rtx op1) |
b5b8b0ac AO |
3900 | { |
3901 | /* (mod >= op1 - mod ? 1 : 0) */ | |
3902 | return gen_rtx_IF_THEN_ELSE | |
3903 | (mode, gen_rtx_GE (BImode, mod, | |
3904 | gen_rtx_MINUS (mode, op1, mod)), | |
3905 | const1_rtx, const0_rtx); | |
3906 | } | |
3907 | ||
dda2da58 AO |
3908 | /* Convert X to MODE, that must be Pmode or ptr_mode, without emitting |
3909 | any rtl. */ | |
3910 | ||
3911 | static rtx | |
ef4bddc2 | 3912 | convert_debug_memory_address (machine_mode mode, rtx x, |
f61c6f34 | 3913 | addr_space_t as) |
dda2da58 | 3914 | { |
ef4bddc2 | 3915 | machine_mode xmode = GET_MODE (x); |
dda2da58 AO |
3916 | |
3917 | #ifndef POINTERS_EXTEND_UNSIGNED | |
f61c6f34 JJ |
3918 | gcc_assert (mode == Pmode |
3919 | || mode == targetm.addr_space.address_mode (as)); | |
dda2da58 AO |
3920 | gcc_assert (xmode == mode || xmode == VOIDmode); |
3921 | #else | |
f61c6f34 | 3922 | rtx temp; |
f61c6f34 | 3923 | |
639d4bb8 | 3924 | gcc_assert (targetm.addr_space.valid_pointer_mode (mode, as)); |
dda2da58 AO |
3925 | |
3926 | if (GET_MODE (x) == mode || GET_MODE (x) == VOIDmode) | |
3927 | return x; | |
3928 | ||
69660a70 | 3929 | if (GET_MODE_PRECISION (mode) < GET_MODE_PRECISION (xmode)) |
3403a1a9 | 3930 | x = lowpart_subreg (mode, x, xmode); |
dda2da58 AO |
3931 | else if (POINTERS_EXTEND_UNSIGNED > 0) |
3932 | x = gen_rtx_ZERO_EXTEND (mode, x); | |
3933 | else if (!POINTERS_EXTEND_UNSIGNED) | |
3934 | x = gen_rtx_SIGN_EXTEND (mode, x); | |
3935 | else | |
f61c6f34 JJ |
3936 | { |
3937 | switch (GET_CODE (x)) | |
3938 | { | |
3939 | case SUBREG: | |
3940 | if ((SUBREG_PROMOTED_VAR_P (x) | |
3941 | || (REG_P (SUBREG_REG (x)) && REG_POINTER (SUBREG_REG (x))) | |
3942 | || (GET_CODE (SUBREG_REG (x)) == PLUS | |
3943 | && REG_P (XEXP (SUBREG_REG (x), 0)) | |
3944 | && REG_POINTER (XEXP (SUBREG_REG (x), 0)) | |
3945 | && CONST_INT_P (XEXP (SUBREG_REG (x), 1)))) | |
3946 | && GET_MODE (SUBREG_REG (x)) == mode) | |
3947 | return SUBREG_REG (x); | |
3948 | break; | |
3949 | case LABEL_REF: | |
a827d9b1 | 3950 | temp = gen_rtx_LABEL_REF (mode, LABEL_REF_LABEL (x)); |
f61c6f34 JJ |
3951 | LABEL_REF_NONLOCAL_P (temp) = LABEL_REF_NONLOCAL_P (x); |
3952 | return temp; | |
3953 | case SYMBOL_REF: | |
3954 | temp = shallow_copy_rtx (x); | |
3955 | PUT_MODE (temp, mode); | |
3956 | return temp; | |
3957 | case CONST: | |
3958 | temp = convert_debug_memory_address (mode, XEXP (x, 0), as); | |
3959 | if (temp) | |
3960 | temp = gen_rtx_CONST (mode, temp); | |
3961 | return temp; | |
3962 | case PLUS: | |
3963 | case MINUS: | |
3964 | if (CONST_INT_P (XEXP (x, 1))) | |
3965 | { | |
3966 | temp = convert_debug_memory_address (mode, XEXP (x, 0), as); | |
3967 | if (temp) | |
3968 | return gen_rtx_fmt_ee (GET_CODE (x), mode, temp, XEXP (x, 1)); | |
3969 | } | |
3970 | break; | |
3971 | default: | |
3972 | break; | |
3973 | } | |
3974 | /* Don't know how to express ptr_extend as operation in debug info. */ | |
3975 | return NULL; | |
3976 | } | |
dda2da58 AO |
3977 | #endif /* POINTERS_EXTEND_UNSIGNED */ |
3978 | ||
3979 | return x; | |
3980 | } | |
3981 | ||
dfde35b3 JJ |
3982 | /* Map from SSA_NAMEs to corresponding DEBUG_EXPR_DECLs created |
3983 | by avoid_deep_ter_for_debug. */ | |
3984 | ||
3985 | static hash_map<tree, tree> *deep_ter_debug_map; | |
3986 | ||
3987 | /* Split too deep TER chains for debug stmts using debug temporaries. */ | |
3988 | ||
3989 | static void | |
3990 | avoid_deep_ter_for_debug (gimple stmt, int depth) | |
3991 | { | |
3992 | use_operand_p use_p; | |
3993 | ssa_op_iter iter; | |
3994 | FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter, SSA_OP_USE) | |
3995 | { | |
3996 | tree use = USE_FROM_PTR (use_p); | |
3997 | if (TREE_CODE (use) != SSA_NAME || SSA_NAME_IS_DEFAULT_DEF (use)) | |
3998 | continue; | |
3999 | gimple g = get_gimple_for_ssa_name (use); | |
4000 | if (g == NULL) | |
4001 | continue; | |
4002 | if (depth > 6 && !stmt_ends_bb_p (g)) | |
4003 | { | |
4004 | if (deep_ter_debug_map == NULL) | |
4005 | deep_ter_debug_map = new hash_map<tree, tree>; | |
4006 | ||
4007 | tree &vexpr = deep_ter_debug_map->get_or_insert (use); | |
4008 | if (vexpr != NULL) | |
4009 | continue; | |
4010 | vexpr = make_node (DEBUG_EXPR_DECL); | |
4011 | gimple def_temp = gimple_build_debug_bind (vexpr, use, g); | |
4012 | DECL_ARTIFICIAL (vexpr) = 1; | |
4013 | TREE_TYPE (vexpr) = TREE_TYPE (use); | |
4014 | DECL_MODE (vexpr) = TYPE_MODE (TREE_TYPE (use)); | |
4015 | gimple_stmt_iterator gsi = gsi_for_stmt (g); | |
4016 | gsi_insert_after (&gsi, def_temp, GSI_NEW_STMT); | |
4017 | avoid_deep_ter_for_debug (def_temp, 0); | |
4018 | } | |
4019 | else | |
4020 | avoid_deep_ter_for_debug (g, depth + 1); | |
4021 | } | |
4022 | } | |
4023 | ||
12c5ffe5 EB |
4024 | /* Return an RTX equivalent to the value of the parameter DECL. */ |
4025 | ||
4026 | static rtx | |
4027 | expand_debug_parm_decl (tree decl) | |
4028 | { | |
4029 | rtx incoming = DECL_INCOMING_RTL (decl); | |
4030 | ||
4031 | if (incoming | |
4032 | && GET_MODE (incoming) != BLKmode | |
4033 | && ((REG_P (incoming) && HARD_REGISTER_P (incoming)) | |
4034 | || (MEM_P (incoming) | |
4035 | && REG_P (XEXP (incoming, 0)) | |
4036 | && HARD_REGISTER_P (XEXP (incoming, 0))))) | |
4037 | { | |
4038 | rtx rtl = gen_rtx_ENTRY_VALUE (GET_MODE (incoming)); | |
4039 | ||
4040 | #ifdef HAVE_window_save | |
4041 | /* DECL_INCOMING_RTL uses the INCOMING_REGNO of parameter registers. | |
4042 | If the target machine has an explicit window save instruction, the | |
4043 | actual entry value is the corresponding OUTGOING_REGNO instead. */ | |
4044 | if (REG_P (incoming) | |
4045 | && OUTGOING_REGNO (REGNO (incoming)) != REGNO (incoming)) | |
4046 | incoming | |
4047 | = gen_rtx_REG_offset (incoming, GET_MODE (incoming), | |
4048 | OUTGOING_REGNO (REGNO (incoming)), 0); | |
4049 | else if (MEM_P (incoming)) | |
4050 | { | |
4051 | rtx reg = XEXP (incoming, 0); | |
4052 | if (OUTGOING_REGNO (REGNO (reg)) != REGNO (reg)) | |
4053 | { | |
4054 | reg = gen_raw_REG (GET_MODE (reg), OUTGOING_REGNO (REGNO (reg))); | |
4055 | incoming = replace_equiv_address_nv (incoming, reg); | |
4056 | } | |
6cfa417f JJ |
4057 | else |
4058 | incoming = copy_rtx (incoming); | |
12c5ffe5 EB |
4059 | } |
4060 | #endif | |
4061 | ||
4062 | ENTRY_VALUE_EXP (rtl) = incoming; | |
4063 | return rtl; | |
4064 | } | |
4065 | ||
4066 | if (incoming | |
4067 | && GET_MODE (incoming) != BLKmode | |
4068 | && !TREE_ADDRESSABLE (decl) | |
4069 | && MEM_P (incoming) | |
4070 | && (XEXP (incoming, 0) == virtual_incoming_args_rtx | |
4071 | || (GET_CODE (XEXP (incoming, 0)) == PLUS | |
4072 | && XEXP (XEXP (incoming, 0), 0) == virtual_incoming_args_rtx | |
4073 | && CONST_INT_P (XEXP (XEXP (incoming, 0), 1))))) | |
6cfa417f | 4074 | return copy_rtx (incoming); |
12c5ffe5 EB |
4075 | |
4076 | return NULL_RTX; | |
4077 | } | |
4078 | ||
4079 | /* Return an RTX equivalent to the value of the tree expression EXP. */ | |
b5b8b0ac AO |
4080 | |
4081 | static rtx | |
4082 | expand_debug_expr (tree exp) | |
4083 | { | |
4084 | rtx op0 = NULL_RTX, op1 = NULL_RTX, op2 = NULL_RTX; | |
ef4bddc2 RS |
4085 | machine_mode mode = TYPE_MODE (TREE_TYPE (exp)); |
4086 | machine_mode inner_mode = VOIDmode; | |
b5b8b0ac | 4087 | int unsignedp = TYPE_UNSIGNED (TREE_TYPE (exp)); |
09e881c9 | 4088 | addr_space_t as; |
b5b8b0ac AO |
4089 | |
4090 | switch (TREE_CODE_CLASS (TREE_CODE (exp))) | |
4091 | { | |
4092 | case tcc_expression: | |
4093 | switch (TREE_CODE (exp)) | |
4094 | { | |
4095 | case COND_EXPR: | |
7ece48b1 | 4096 | case DOT_PROD_EXPR: |
79d652a5 | 4097 | case SAD_EXPR: |
0354c0c7 BS |
4098 | case WIDEN_MULT_PLUS_EXPR: |
4099 | case WIDEN_MULT_MINUS_EXPR: | |
0f59b812 | 4100 | case FMA_EXPR: |
b5b8b0ac AO |
4101 | goto ternary; |
4102 | ||
4103 | case TRUTH_ANDIF_EXPR: | |
4104 | case TRUTH_ORIF_EXPR: | |
4105 | case TRUTH_AND_EXPR: | |
4106 | case TRUTH_OR_EXPR: | |
4107 | case TRUTH_XOR_EXPR: | |
4108 | goto binary; | |
4109 | ||
4110 | case TRUTH_NOT_EXPR: | |
4111 | goto unary; | |
4112 | ||
4113 | default: | |
4114 | break; | |
4115 | } | |
4116 | break; | |
4117 | ||
4118 | ternary: | |
4119 | op2 = expand_debug_expr (TREE_OPERAND (exp, 2)); | |
4120 | if (!op2) | |
4121 | return NULL_RTX; | |
4122 | /* Fall through. */ | |
4123 | ||
4124 | binary: | |
4125 | case tcc_binary: | |
b5b8b0ac AO |
4126 | op1 = expand_debug_expr (TREE_OPERAND (exp, 1)); |
4127 | if (!op1) | |
4128 | return NULL_RTX; | |
26d83bcc JJ |
4129 | switch (TREE_CODE (exp)) |
4130 | { | |
4131 | case LSHIFT_EXPR: | |
4132 | case RSHIFT_EXPR: | |
4133 | case LROTATE_EXPR: | |
4134 | case RROTATE_EXPR: | |
4135 | case WIDEN_LSHIFT_EXPR: | |
4136 | /* Ensure second operand isn't wider than the first one. */ | |
4137 | inner_mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1))); | |
4138 | if (SCALAR_INT_MODE_P (inner_mode)) | |
4139 | { | |
4140 | machine_mode opmode = mode; | |
4141 | if (VECTOR_MODE_P (mode)) | |
4142 | opmode = GET_MODE_INNER (mode); | |
4143 | if (SCALAR_INT_MODE_P (opmode) | |
4144 | && (GET_MODE_PRECISION (opmode) | |
4145 | < GET_MODE_PRECISION (inner_mode))) | |
3403a1a9 | 4146 | op1 = lowpart_subreg (opmode, op1, inner_mode); |
26d83bcc JJ |
4147 | } |
4148 | break; | |
4149 | default: | |
4150 | break; | |
4151 | } | |
b5b8b0ac AO |
4152 | /* Fall through. */ |
4153 | ||
4154 | unary: | |
4155 | case tcc_unary: | |
2ba172e0 | 4156 | inner_mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))); |
b5b8b0ac AO |
4157 | op0 = expand_debug_expr (TREE_OPERAND (exp, 0)); |
4158 | if (!op0) | |
4159 | return NULL_RTX; | |
4160 | break; | |
4161 | ||
871dae34 AO |
4162 | case tcc_comparison: |
4163 | unsignedp = TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))); | |
4164 | goto binary; | |
4165 | ||
b5b8b0ac AO |
4166 | case tcc_type: |
4167 | case tcc_statement: | |
4168 | gcc_unreachable (); | |
4169 | ||
4170 | case tcc_constant: | |
4171 | case tcc_exceptional: | |
4172 | case tcc_declaration: | |
4173 | case tcc_reference: | |
4174 | case tcc_vl_exp: | |
4175 | break; | |
4176 | } | |
4177 | ||
4178 | switch (TREE_CODE (exp)) | |
4179 | { | |
4180 | case STRING_CST: | |
4181 | if (!lookup_constant_def (exp)) | |
4182 | { | |
e1b243a8 JJ |
4183 | if (strlen (TREE_STRING_POINTER (exp)) + 1 |
4184 | != (size_t) TREE_STRING_LENGTH (exp)) | |
4185 | return NULL_RTX; | |
b5b8b0ac AO |
4186 | op0 = gen_rtx_CONST_STRING (Pmode, TREE_STRING_POINTER (exp)); |
4187 | op0 = gen_rtx_MEM (BLKmode, op0); | |
4188 | set_mem_attributes (op0, exp, 0); | |
4189 | return op0; | |
4190 | } | |
4191 | /* Fall through... */ | |
4192 | ||
4193 | case INTEGER_CST: | |
4194 | case REAL_CST: | |
4195 | case FIXED_CST: | |
4196 | op0 = expand_expr (exp, NULL_RTX, mode, EXPAND_INITIALIZER); | |
4197 | return op0; | |
4198 | ||
4199 | case COMPLEX_CST: | |
4200 | gcc_assert (COMPLEX_MODE_P (mode)); | |
4201 | op0 = expand_debug_expr (TREE_REALPART (exp)); | |
b5b8b0ac | 4202 | op1 = expand_debug_expr (TREE_IMAGPART (exp)); |
b5b8b0ac AO |
4203 | return gen_rtx_CONCAT (mode, op0, op1); |
4204 | ||
0ca5af51 AO |
4205 | case DEBUG_EXPR_DECL: |
4206 | op0 = DECL_RTL_IF_SET (exp); | |
4207 | ||
4208 | if (op0) | |
4209 | return op0; | |
4210 | ||
4211 | op0 = gen_rtx_DEBUG_EXPR (mode); | |
e4fb38bd | 4212 | DEBUG_EXPR_TREE_DECL (op0) = exp; |
0ca5af51 AO |
4213 | SET_DECL_RTL (exp, op0); |
4214 | ||
4215 | return op0; | |
4216 | ||
b5b8b0ac AO |
4217 | case VAR_DECL: |
4218 | case PARM_DECL: | |
4219 | case FUNCTION_DECL: | |
4220 | case LABEL_DECL: | |
4221 | case CONST_DECL: | |
4222 | case RESULT_DECL: | |
4223 | op0 = DECL_RTL_IF_SET (exp); | |
4224 | ||
4225 | /* This decl was probably optimized away. */ | |
4226 | if (!op0) | |
e1b243a8 JJ |
4227 | { |
4228 | if (TREE_CODE (exp) != VAR_DECL | |
4229 | || DECL_EXTERNAL (exp) | |
4230 | || !TREE_STATIC (exp) | |
4231 | || !DECL_NAME (exp) | |
0fba566c | 4232 | || DECL_HARD_REGISTER (exp) |
7d5fc814 | 4233 | || DECL_IN_CONSTANT_POOL (exp) |
0fba566c | 4234 | || mode == VOIDmode) |
e1b243a8 JJ |
4235 | return NULL; |
4236 | ||
b1aa0655 | 4237 | op0 = make_decl_rtl_for_debug (exp); |
e1b243a8 JJ |
4238 | if (!MEM_P (op0) |
4239 | || GET_CODE (XEXP (op0, 0)) != SYMBOL_REF | |
4240 | || SYMBOL_REF_DECL (XEXP (op0, 0)) != exp) | |
4241 | return NULL; | |
4242 | } | |
4243 | else | |
4244 | op0 = copy_rtx (op0); | |
b5b8b0ac | 4245 | |
06796564 | 4246 | if (GET_MODE (op0) == BLKmode |
871dae34 | 4247 | /* If op0 is not BLKmode, but mode is, adjust_mode |
06796564 JJ |
4248 | below would ICE. While it is likely a FE bug, |
4249 | try to be robust here. See PR43166. */ | |
132b4e82 JJ |
4250 | || mode == BLKmode |
4251 | || (mode == VOIDmode && GET_MODE (op0) != VOIDmode)) | |
b5b8b0ac AO |
4252 | { |
4253 | gcc_assert (MEM_P (op0)); | |
4254 | op0 = adjust_address_nv (op0, mode, 0); | |
4255 | return op0; | |
4256 | } | |
4257 | ||
4258 | /* Fall through. */ | |
4259 | ||
4260 | adjust_mode: | |
4261 | case PAREN_EXPR: | |
625a9766 | 4262 | CASE_CONVERT: |
b5b8b0ac | 4263 | { |
2ba172e0 | 4264 | inner_mode = GET_MODE (op0); |
b5b8b0ac AO |
4265 | |
4266 | if (mode == inner_mode) | |
4267 | return op0; | |
4268 | ||
4269 | if (inner_mode == VOIDmode) | |
4270 | { | |
2a8e30fb MM |
4271 | if (TREE_CODE (exp) == SSA_NAME) |
4272 | inner_mode = TYPE_MODE (TREE_TYPE (exp)); | |
4273 | else | |
4274 | inner_mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))); | |
b5b8b0ac AO |
4275 | if (mode == inner_mode) |
4276 | return op0; | |
4277 | } | |
4278 | ||
4279 | if (FLOAT_MODE_P (mode) && FLOAT_MODE_P (inner_mode)) | |
4280 | { | |
4281 | if (GET_MODE_BITSIZE (mode) == GET_MODE_BITSIZE (inner_mode)) | |
4282 | op0 = simplify_gen_subreg (mode, op0, inner_mode, 0); | |
4283 | else if (GET_MODE_BITSIZE (mode) < GET_MODE_BITSIZE (inner_mode)) | |
4284 | op0 = simplify_gen_unary (FLOAT_TRUNCATE, mode, op0, inner_mode); | |
4285 | else | |
4286 | op0 = simplify_gen_unary (FLOAT_EXTEND, mode, op0, inner_mode); | |
4287 | } | |
4288 | else if (FLOAT_MODE_P (mode)) | |
4289 | { | |
2a8e30fb | 4290 | gcc_assert (TREE_CODE (exp) != SSA_NAME); |
b5b8b0ac AO |
4291 | if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0)))) |
4292 | op0 = simplify_gen_unary (UNSIGNED_FLOAT, mode, op0, inner_mode); | |
4293 | else | |
4294 | op0 = simplify_gen_unary (FLOAT, mode, op0, inner_mode); | |
4295 | } | |
4296 | else if (FLOAT_MODE_P (inner_mode)) | |
4297 | { | |
4298 | if (unsignedp) | |
4299 | op0 = simplify_gen_unary (UNSIGNED_FIX, mode, op0, inner_mode); | |
4300 | else | |
4301 | op0 = simplify_gen_unary (FIX, mode, op0, inner_mode); | |
4302 | } | |
4303 | else if (CONSTANT_P (op0) | |
69660a70 | 4304 | || GET_MODE_PRECISION (mode) <= GET_MODE_PRECISION (inner_mode)) |
3403a1a9 | 4305 | op0 = lowpart_subreg (mode, op0, inner_mode); |
cf4ef6f7 | 4306 | else if (UNARY_CLASS_P (exp) |
1b47fe3f JJ |
4307 | ? TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))) |
4308 | : unsignedp) | |
2ba172e0 | 4309 | op0 = simplify_gen_unary (ZERO_EXTEND, mode, op0, inner_mode); |
b5b8b0ac | 4310 | else |
2ba172e0 | 4311 | op0 = simplify_gen_unary (SIGN_EXTEND, mode, op0, inner_mode); |
b5b8b0ac AO |
4312 | |
4313 | return op0; | |
4314 | } | |
4315 | ||
70f34814 | 4316 | case MEM_REF: |
71f3a3f5 JJ |
4317 | if (!is_gimple_mem_ref_addr (TREE_OPERAND (exp, 0))) |
4318 | { | |
4319 | tree newexp = fold_binary (MEM_REF, TREE_TYPE (exp), | |
4320 | TREE_OPERAND (exp, 0), | |
4321 | TREE_OPERAND (exp, 1)); | |
4322 | if (newexp) | |
4323 | return expand_debug_expr (newexp); | |
4324 | } | |
4325 | /* FALLTHROUGH */ | |
b5b8b0ac | 4326 | case INDIRECT_REF: |
0a81f074 | 4327 | inner_mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))); |
b5b8b0ac AO |
4328 | op0 = expand_debug_expr (TREE_OPERAND (exp, 0)); |
4329 | if (!op0) | |
4330 | return NULL; | |
4331 | ||
cb115041 JJ |
4332 | if (TREE_CODE (exp) == MEM_REF) |
4333 | { | |
583ac69c JJ |
4334 | if (GET_CODE (op0) == DEBUG_IMPLICIT_PTR |
4335 | || (GET_CODE (op0) == PLUS | |
4336 | && GET_CODE (XEXP (op0, 0)) == DEBUG_IMPLICIT_PTR)) | |
4337 | /* (mem (debug_implicit_ptr)) might confuse aliasing. | |
4338 | Instead just use get_inner_reference. */ | |
4339 | goto component_ref; | |
4340 | ||
cb115041 JJ |
4341 | op1 = expand_debug_expr (TREE_OPERAND (exp, 1)); |
4342 | if (!op1 || !CONST_INT_P (op1)) | |
4343 | return NULL; | |
4344 | ||
0a81f074 | 4345 | op0 = plus_constant (inner_mode, op0, INTVAL (op1)); |
cb115041 JJ |
4346 | } |
4347 | ||
a148c4b2 | 4348 | as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)))); |
b5b8b0ac | 4349 | |
f61c6f34 JJ |
4350 | op0 = convert_debug_memory_address (targetm.addr_space.address_mode (as), |
4351 | op0, as); | |
4352 | if (op0 == NULL_RTX) | |
4353 | return NULL; | |
b5b8b0ac | 4354 | |
f61c6f34 | 4355 | op0 = gen_rtx_MEM (mode, op0); |
b5b8b0ac | 4356 | set_mem_attributes (op0, exp, 0); |
71f3a3f5 JJ |
4357 | if (TREE_CODE (exp) == MEM_REF |
4358 | && !is_gimple_mem_ref_addr (TREE_OPERAND (exp, 0))) | |
4359 | set_mem_expr (op0, NULL_TREE); | |
09e881c9 | 4360 | set_mem_addr_space (op0, as); |
b5b8b0ac AO |
4361 | |
4362 | return op0; | |
4363 | ||
4364 | case TARGET_MEM_REF: | |
4d948885 RG |
4365 | if (TREE_CODE (TMR_BASE (exp)) == ADDR_EXPR |
4366 | && !DECL_RTL_SET_P (TREE_OPERAND (TMR_BASE (exp), 0))) | |
b5b8b0ac AO |
4367 | return NULL; |
4368 | ||
4369 | op0 = expand_debug_expr | |
4e25ca6b | 4370 | (tree_mem_ref_addr (build_pointer_type (TREE_TYPE (exp)), exp)); |
b5b8b0ac AO |
4371 | if (!op0) |
4372 | return NULL; | |
4373 | ||
c168f180 | 4374 | as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)))); |
f61c6f34 JJ |
4375 | op0 = convert_debug_memory_address (targetm.addr_space.address_mode (as), |
4376 | op0, as); | |
4377 | if (op0 == NULL_RTX) | |
4378 | return NULL; | |
b5b8b0ac AO |
4379 | |
4380 | op0 = gen_rtx_MEM (mode, op0); | |
4381 | ||
4382 | set_mem_attributes (op0, exp, 0); | |
09e881c9 | 4383 | set_mem_addr_space (op0, as); |
b5b8b0ac AO |
4384 | |
4385 | return op0; | |
4386 | ||
583ac69c | 4387 | component_ref: |
b5b8b0ac AO |
4388 | case ARRAY_REF: |
4389 | case ARRAY_RANGE_REF: | |
4390 | case COMPONENT_REF: | |
4391 | case BIT_FIELD_REF: | |
4392 | case REALPART_EXPR: | |
4393 | case IMAGPART_EXPR: | |
4394 | case VIEW_CONVERT_EXPR: | |
4395 | { | |
ef4bddc2 | 4396 | machine_mode mode1; |
b5b8b0ac AO |
4397 | HOST_WIDE_INT bitsize, bitpos; |
4398 | tree offset; | |
4399 | int volatilep = 0; | |
4400 | tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset, | |
b3ecff82 | 4401 | &mode1, &unsignedp, &volatilep, false); |
b5b8b0ac AO |
4402 | rtx orig_op0; |
4403 | ||
4f2a9af8 JJ |
4404 | if (bitsize == 0) |
4405 | return NULL; | |
4406 | ||
b5b8b0ac AO |
4407 | orig_op0 = op0 = expand_debug_expr (tem); |
4408 | ||
4409 | if (!op0) | |
4410 | return NULL; | |
4411 | ||
4412 | if (offset) | |
4413 | { | |
ef4bddc2 | 4414 | machine_mode addrmode, offmode; |
dda2da58 | 4415 | |
aa847cc8 JJ |
4416 | if (!MEM_P (op0)) |
4417 | return NULL; | |
b5b8b0ac | 4418 | |
dda2da58 AO |
4419 | op0 = XEXP (op0, 0); |
4420 | addrmode = GET_MODE (op0); | |
4421 | if (addrmode == VOIDmode) | |
4422 | addrmode = Pmode; | |
4423 | ||
b5b8b0ac AO |
4424 | op1 = expand_debug_expr (offset); |
4425 | if (!op1) | |
4426 | return NULL; | |
4427 | ||
dda2da58 AO |
4428 | offmode = GET_MODE (op1); |
4429 | if (offmode == VOIDmode) | |
4430 | offmode = TYPE_MODE (TREE_TYPE (offset)); | |
4431 | ||
4432 | if (addrmode != offmode) | |
3403a1a9 | 4433 | op1 = lowpart_subreg (addrmode, op1, offmode); |
dda2da58 AO |
4434 | |
4435 | /* Don't use offset_address here, we don't need a | |
4436 | recognizable address, and we don't want to generate | |
4437 | code. */ | |
2ba172e0 JJ |
4438 | op0 = gen_rtx_MEM (mode, simplify_gen_binary (PLUS, addrmode, |
4439 | op0, op1)); | |
b5b8b0ac AO |
4440 | } |
4441 | ||
4442 | if (MEM_P (op0)) | |
4443 | { | |
4f2a9af8 JJ |
4444 | if (mode1 == VOIDmode) |
4445 | /* Bitfield. */ | |
4446 | mode1 = smallest_mode_for_size (bitsize, MODE_INT); | |
b5b8b0ac AO |
4447 | if (bitpos >= BITS_PER_UNIT) |
4448 | { | |
4449 | op0 = adjust_address_nv (op0, mode1, bitpos / BITS_PER_UNIT); | |
4450 | bitpos %= BITS_PER_UNIT; | |
4451 | } | |
4452 | else if (bitpos < 0) | |
4453 | { | |
4f2a9af8 JJ |
4454 | HOST_WIDE_INT units |
4455 | = (-bitpos + BITS_PER_UNIT - 1) / BITS_PER_UNIT; | |
b5b8b0ac AO |
4456 | op0 = adjust_address_nv (op0, mode1, units); |
4457 | bitpos += units * BITS_PER_UNIT; | |
4458 | } | |
4459 | else if (bitpos == 0 && bitsize == GET_MODE_BITSIZE (mode)) | |
4460 | op0 = adjust_address_nv (op0, mode, 0); | |
4461 | else if (GET_MODE (op0) != mode1) | |
4462 | op0 = adjust_address_nv (op0, mode1, 0); | |
4463 | else | |
4464 | op0 = copy_rtx (op0); | |
4465 | if (op0 == orig_op0) | |
4466 | op0 = shallow_copy_rtx (op0); | |
4467 | set_mem_attributes (op0, exp, 0); | |
4468 | } | |
4469 | ||
4470 | if (bitpos == 0 && mode == GET_MODE (op0)) | |
4471 | return op0; | |
4472 | ||
2d3fc6aa JJ |
4473 | if (bitpos < 0) |
4474 | return NULL; | |
4475 | ||
88c04a5d JJ |
4476 | if (GET_MODE (op0) == BLKmode) |
4477 | return NULL; | |
4478 | ||
b5b8b0ac AO |
4479 | if ((bitpos % BITS_PER_UNIT) == 0 |
4480 | && bitsize == GET_MODE_BITSIZE (mode1)) | |
4481 | { | |
ef4bddc2 | 4482 | machine_mode opmode = GET_MODE (op0); |
b5b8b0ac | 4483 | |
b5b8b0ac | 4484 | if (opmode == VOIDmode) |
9712cba0 | 4485 | opmode = TYPE_MODE (TREE_TYPE (tem)); |
b5b8b0ac AO |
4486 | |
4487 | /* This condition may hold if we're expanding the address | |
4488 | right past the end of an array that turned out not to | |
4489 | be addressable (i.e., the address was only computed in | |
4490 | debug stmts). The gen_subreg below would rightfully | |
4491 | crash, and the address doesn't really exist, so just | |
4492 | drop it. */ | |
4493 | if (bitpos >= GET_MODE_BITSIZE (opmode)) | |
4494 | return NULL; | |
4495 | ||
7d5d39bb JJ |
4496 | if ((bitpos % GET_MODE_BITSIZE (mode)) == 0) |
4497 | return simplify_gen_subreg (mode, op0, opmode, | |
4498 | bitpos / BITS_PER_UNIT); | |
b5b8b0ac AO |
4499 | } |
4500 | ||
4501 | return simplify_gen_ternary (SCALAR_INT_MODE_P (GET_MODE (op0)) | |
4502 | && TYPE_UNSIGNED (TREE_TYPE (exp)) | |
4503 | ? SIGN_EXTRACT | |
4504 | : ZERO_EXTRACT, mode, | |
4505 | GET_MODE (op0) != VOIDmode | |
9712cba0 JJ |
4506 | ? GET_MODE (op0) |
4507 | : TYPE_MODE (TREE_TYPE (tem)), | |
b5b8b0ac AO |
4508 | op0, GEN_INT (bitsize), GEN_INT (bitpos)); |
4509 | } | |
4510 | ||
b5b8b0ac | 4511 | case ABS_EXPR: |
2ba172e0 | 4512 | return simplify_gen_unary (ABS, mode, op0, mode); |
b5b8b0ac AO |
4513 | |
4514 | case NEGATE_EXPR: | |
2ba172e0 | 4515 | return simplify_gen_unary (NEG, mode, op0, mode); |
b5b8b0ac AO |
4516 | |
4517 | case BIT_NOT_EXPR: | |
2ba172e0 | 4518 | return simplify_gen_unary (NOT, mode, op0, mode); |
b5b8b0ac AO |
4519 | |
4520 | case FLOAT_EXPR: | |
2ba172e0 JJ |
4521 | return simplify_gen_unary (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, |
4522 | 0))) | |
4523 | ? UNSIGNED_FLOAT : FLOAT, mode, op0, | |
4524 | inner_mode); | |
b5b8b0ac AO |
4525 | |
4526 | case FIX_TRUNC_EXPR: | |
2ba172e0 JJ |
4527 | return simplify_gen_unary (unsignedp ? UNSIGNED_FIX : FIX, mode, op0, |
4528 | inner_mode); | |
b5b8b0ac AO |
4529 | |
4530 | case POINTER_PLUS_EXPR: | |
576319a7 DD |
4531 | /* For the rare target where pointers are not the same size as |
4532 | size_t, we need to check for mis-matched modes and correct | |
4533 | the addend. */ | |
4534 | if (op0 && op1 | |
4535 | && GET_MODE (op0) != VOIDmode && GET_MODE (op1) != VOIDmode | |
4536 | && GET_MODE (op0) != GET_MODE (op1)) | |
4537 | { | |
8369f38a DD |
4538 | if (GET_MODE_BITSIZE (GET_MODE (op0)) < GET_MODE_BITSIZE (GET_MODE (op1)) |
4539 | /* If OP0 is a partial mode, then we must truncate, even if it has | |
4540 | the same bitsize as OP1 as GCC's representation of partial modes | |
4541 | is opaque. */ | |
4542 | || (GET_MODE_CLASS (GET_MODE (op0)) == MODE_PARTIAL_INT | |
4543 | && GET_MODE_BITSIZE (GET_MODE (op0)) == GET_MODE_BITSIZE (GET_MODE (op1)))) | |
2ba172e0 JJ |
4544 | op1 = simplify_gen_unary (TRUNCATE, GET_MODE (op0), op1, |
4545 | GET_MODE (op1)); | |
576319a7 DD |
4546 | else |
4547 | /* We always sign-extend, regardless of the signedness of | |
4548 | the operand, because the operand is always unsigned | |
4549 | here even if the original C expression is signed. */ | |
2ba172e0 JJ |
4550 | op1 = simplify_gen_unary (SIGN_EXTEND, GET_MODE (op0), op1, |
4551 | GET_MODE (op1)); | |
576319a7 DD |
4552 | } |
4553 | /* Fall through. */ | |
b5b8b0ac | 4554 | case PLUS_EXPR: |
2ba172e0 | 4555 | return simplify_gen_binary (PLUS, mode, op0, op1); |
b5b8b0ac AO |
4556 | |
4557 | case MINUS_EXPR: | |
2ba172e0 | 4558 | return simplify_gen_binary (MINUS, mode, op0, op1); |
b5b8b0ac AO |
4559 | |
4560 | case MULT_EXPR: | |
2ba172e0 | 4561 | return simplify_gen_binary (MULT, mode, op0, op1); |
b5b8b0ac AO |
4562 | |
4563 | case RDIV_EXPR: | |
4564 | case TRUNC_DIV_EXPR: | |
4565 | case EXACT_DIV_EXPR: | |
4566 | if (unsignedp) | |
2ba172e0 | 4567 | return simplify_gen_binary (UDIV, mode, op0, op1); |
b5b8b0ac | 4568 | else |
2ba172e0 | 4569 | return simplify_gen_binary (DIV, mode, op0, op1); |
b5b8b0ac AO |
4570 | |
4571 | case TRUNC_MOD_EXPR: | |
2ba172e0 | 4572 | return simplify_gen_binary (unsignedp ? UMOD : MOD, mode, op0, op1); |
b5b8b0ac AO |
4573 | |
4574 | case FLOOR_DIV_EXPR: | |
4575 | if (unsignedp) | |
2ba172e0 | 4576 | return simplify_gen_binary (UDIV, mode, op0, op1); |
b5b8b0ac AO |
4577 | else |
4578 | { | |
2ba172e0 JJ |
4579 | rtx div = simplify_gen_binary (DIV, mode, op0, op1); |
4580 | rtx mod = simplify_gen_binary (MOD, mode, op0, op1); | |
b5b8b0ac | 4581 | rtx adj = floor_sdiv_adjust (mode, mod, op1); |
2ba172e0 | 4582 | return simplify_gen_binary (PLUS, mode, div, adj); |
b5b8b0ac AO |
4583 | } |
4584 | ||
4585 | case FLOOR_MOD_EXPR: | |
4586 | if (unsignedp) | |
2ba172e0 | 4587 | return simplify_gen_binary (UMOD, mode, op0, op1); |
b5b8b0ac AO |
4588 | else |
4589 | { | |
2ba172e0 | 4590 | rtx mod = simplify_gen_binary (MOD, mode, op0, op1); |
b5b8b0ac | 4591 | rtx adj = floor_sdiv_adjust (mode, mod, op1); |
2ba172e0 JJ |
4592 | adj = simplify_gen_unary (NEG, mode, |
4593 | simplify_gen_binary (MULT, mode, adj, op1), | |
4594 | mode); | |
4595 | return simplify_gen_binary (PLUS, mode, mod, adj); | |
b5b8b0ac AO |
4596 | } |
4597 | ||
4598 | case CEIL_DIV_EXPR: | |
4599 | if (unsignedp) | |
4600 | { | |
2ba172e0 JJ |
4601 | rtx div = simplify_gen_binary (UDIV, mode, op0, op1); |
4602 | rtx mod = simplify_gen_binary (UMOD, mode, op0, op1); | |
b5b8b0ac | 4603 | rtx adj = ceil_udiv_adjust (mode, mod, op1); |
2ba172e0 | 4604 | return simplify_gen_binary (PLUS, mode, div, adj); |
b5b8b0ac AO |
4605 | } |
4606 | else | |
4607 | { | |
2ba172e0 JJ |
4608 | rtx div = simplify_gen_binary (DIV, mode, op0, op1); |
4609 | rtx mod = simplify_gen_binary (MOD, mode, op0, op1); | |
b5b8b0ac | 4610 | rtx adj = ceil_sdiv_adjust (mode, mod, op1); |
2ba172e0 | 4611 | return simplify_gen_binary (PLUS, mode, div, adj); |
b5b8b0ac AO |
4612 | } |
4613 | ||
4614 | case CEIL_MOD_EXPR: | |
4615 | if (unsignedp) | |
4616 | { | |
2ba172e0 | 4617 | rtx mod = simplify_gen_binary (UMOD, mode, op0, op1); |
b5b8b0ac | 4618 | rtx adj = ceil_udiv_adjust (mode, mod, op1); |
2ba172e0 JJ |
4619 | adj = simplify_gen_unary (NEG, mode, |
4620 | simplify_gen_binary (MULT, mode, adj, op1), | |
4621 | mode); | |
4622 | return simplify_gen_binary (PLUS, mode, mod, adj); | |
b5b8b0ac AO |
4623 | } |
4624 | else | |
4625 | { | |
2ba172e0 | 4626 | rtx mod = simplify_gen_binary (MOD, mode, op0, op1); |
b5b8b0ac | 4627 | rtx adj = ceil_sdiv_adjust (mode, mod, op1); |
2ba172e0 JJ |
4628 | adj = simplify_gen_unary (NEG, mode, |
4629 | simplify_gen_binary (MULT, mode, adj, op1), | |
4630 | mode); | |
4631 | return simplify_gen_binary (PLUS, mode, mod, adj); | |
b5b8b0ac AO |
4632 | } |
4633 | ||
4634 | case ROUND_DIV_EXPR: | |
4635 | if (unsignedp) | |
4636 | { | |
2ba172e0 JJ |
4637 | rtx div = simplify_gen_binary (UDIV, mode, op0, op1); |
4638 | rtx mod = simplify_gen_binary (UMOD, mode, op0, op1); | |
b5b8b0ac | 4639 | rtx adj = round_udiv_adjust (mode, mod, op1); |
2ba172e0 | 4640 | return simplify_gen_binary (PLUS, mode, div, adj); |
b5b8b0ac AO |
4641 | } |
4642 | else | |
4643 | { | |
2ba172e0 JJ |
4644 | rtx div = simplify_gen_binary (DIV, mode, op0, op1); |
4645 | rtx mod = simplify_gen_binary (MOD, mode, op0, op1); | |
b5b8b0ac | 4646 | rtx adj = round_sdiv_adjust (mode, mod, op1); |
2ba172e0 | 4647 | return simplify_gen_binary (PLUS, mode, div, adj); |
b5b8b0ac AO |
4648 | } |
4649 | ||
4650 | case ROUND_MOD_EXPR: | |
4651 | if (unsignedp) | |
4652 | { | |
2ba172e0 | 4653 | rtx mod = simplify_gen_binary (UMOD, mode, op0, op1); |
b5b8b0ac | 4654 | rtx adj = round_udiv_adjust (mode, mod, op1); |
2ba172e0 JJ |
4655 | adj = simplify_gen_unary (NEG, mode, |
4656 | simplify_gen_binary (MULT, mode, adj, op1), | |
4657 | mode); | |
4658 | return simplify_gen_binary (PLUS, mode, mod, adj); | |
b5b8b0ac AO |
4659 | } |
4660 | else | |
4661 | { | |
2ba172e0 | 4662 | rtx mod = simplify_gen_binary (MOD, mode, op0, op1); |
b5b8b0ac | 4663 | rtx adj = round_sdiv_adjust (mode, mod, op1); |
2ba172e0 JJ |
4664 | adj = simplify_gen_unary (NEG, mode, |
4665 | simplify_gen_binary (MULT, mode, adj, op1), | |
4666 | mode); | |
4667 | return simplify_gen_binary (PLUS, mode, mod, adj); | |
b5b8b0ac AO |
4668 | } |
4669 | ||
4670 | case LSHIFT_EXPR: | |
2ba172e0 | 4671 | return simplify_gen_binary (ASHIFT, mode, op0, op1); |
b5b8b0ac AO |
4672 | |
4673 | case RSHIFT_EXPR: | |
4674 | if (unsignedp) | |
2ba172e0 | 4675 | return simplify_gen_binary (LSHIFTRT, mode, op0, op1); |
b5b8b0ac | 4676 | else |
2ba172e0 | 4677 | return simplify_gen_binary (ASHIFTRT, mode, op0, op1); |
b5b8b0ac AO |
4678 | |
4679 | case LROTATE_EXPR: | |
2ba172e0 | 4680 | return simplify_gen_binary (ROTATE, mode, op0, op1); |
b5b8b0ac AO |
4681 | |
4682 | case RROTATE_EXPR: | |
2ba172e0 | 4683 | return simplify_gen_binary (ROTATERT, mode, op0, op1); |
b5b8b0ac AO |
4684 | |
4685 | case MIN_EXPR: | |
2ba172e0 | 4686 | return simplify_gen_binary (unsignedp ? UMIN : SMIN, mode, op0, op1); |
b5b8b0ac AO |
4687 | |
4688 | case MAX_EXPR: | |
2ba172e0 | 4689 | return simplify_gen_binary (unsignedp ? UMAX : SMAX, mode, op0, op1); |
b5b8b0ac AO |
4690 | |
4691 | case BIT_AND_EXPR: | |
4692 | case TRUTH_AND_EXPR: | |
2ba172e0 | 4693 | return simplify_gen_binary (AND, mode, op0, op1); |
b5b8b0ac AO |
4694 | |
4695 | case BIT_IOR_EXPR: | |
4696 | case TRUTH_OR_EXPR: | |
2ba172e0 | 4697 | return simplify_gen_binary (IOR, mode, op0, op1); |
b5b8b0ac AO |
4698 | |
4699 | case BIT_XOR_EXPR: | |
4700 | case TRUTH_XOR_EXPR: | |
2ba172e0 | 4701 | return simplify_gen_binary (XOR, mode, op0, op1); |
b5b8b0ac AO |
4702 | |
4703 | case TRUTH_ANDIF_EXPR: | |
4704 | return gen_rtx_IF_THEN_ELSE (mode, op0, op1, const0_rtx); | |
4705 | ||
4706 | case TRUTH_ORIF_EXPR: | |
4707 | return gen_rtx_IF_THEN_ELSE (mode, op0, const_true_rtx, op1); | |
4708 | ||
4709 | case TRUTH_NOT_EXPR: | |
2ba172e0 | 4710 | return simplify_gen_relational (EQ, mode, inner_mode, op0, const0_rtx); |
b5b8b0ac AO |
4711 | |
4712 | case LT_EXPR: | |
2ba172e0 JJ |
4713 | return simplify_gen_relational (unsignedp ? LTU : LT, mode, inner_mode, |
4714 | op0, op1); | |
b5b8b0ac AO |
4715 | |
4716 | case LE_EXPR: | |
2ba172e0 JJ |
4717 | return simplify_gen_relational (unsignedp ? LEU : LE, mode, inner_mode, |
4718 | op0, op1); | |
b5b8b0ac AO |
4719 | |
4720 | case GT_EXPR: | |
2ba172e0 JJ |
4721 | return simplify_gen_relational (unsignedp ? GTU : GT, mode, inner_mode, |
4722 | op0, op1); | |
b5b8b0ac AO |
4723 | |
4724 | case GE_EXPR: | |
2ba172e0 JJ |
4725 | return simplify_gen_relational (unsignedp ? GEU : GE, mode, inner_mode, |
4726 | op0, op1); | |
b5b8b0ac AO |
4727 | |
4728 | case EQ_EXPR: | |
2ba172e0 | 4729 | return simplify_gen_relational (EQ, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
4730 | |
4731 | case NE_EXPR: | |
2ba172e0 | 4732 | return simplify_gen_relational (NE, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
4733 | |
4734 | case UNORDERED_EXPR: | |
2ba172e0 | 4735 | return simplify_gen_relational (UNORDERED, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
4736 | |
4737 | case ORDERED_EXPR: | |
2ba172e0 | 4738 | return simplify_gen_relational (ORDERED, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
4739 | |
4740 | case UNLT_EXPR: | |
2ba172e0 | 4741 | return simplify_gen_relational (UNLT, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
4742 | |
4743 | case UNLE_EXPR: | |
2ba172e0 | 4744 | return simplify_gen_relational (UNLE, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
4745 | |
4746 | case UNGT_EXPR: | |
2ba172e0 | 4747 | return simplify_gen_relational (UNGT, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
4748 | |
4749 | case UNGE_EXPR: | |
2ba172e0 | 4750 | return simplify_gen_relational (UNGE, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
4751 | |
4752 | case UNEQ_EXPR: | |
2ba172e0 | 4753 | return simplify_gen_relational (UNEQ, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
4754 | |
4755 | case LTGT_EXPR: | |
2ba172e0 | 4756 | return simplify_gen_relational (LTGT, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
4757 | |
4758 | case COND_EXPR: | |
4759 | return gen_rtx_IF_THEN_ELSE (mode, op0, op1, op2); | |
4760 | ||
4761 | case COMPLEX_EXPR: | |
4762 | gcc_assert (COMPLEX_MODE_P (mode)); | |
4763 | if (GET_MODE (op0) == VOIDmode) | |
4764 | op0 = gen_rtx_CONST (GET_MODE_INNER (mode), op0); | |
4765 | if (GET_MODE (op1) == VOIDmode) | |
4766 | op1 = gen_rtx_CONST (GET_MODE_INNER (mode), op1); | |
4767 | return gen_rtx_CONCAT (mode, op0, op1); | |
4768 | ||
d02a5a4b JJ |
4769 | case CONJ_EXPR: |
4770 | if (GET_CODE (op0) == CONCAT) | |
4771 | return gen_rtx_CONCAT (mode, XEXP (op0, 0), | |
2ba172e0 JJ |
4772 | simplify_gen_unary (NEG, GET_MODE_INNER (mode), |
4773 | XEXP (op0, 1), | |
4774 | GET_MODE_INNER (mode))); | |
d02a5a4b JJ |
4775 | else |
4776 | { | |
ef4bddc2 | 4777 | machine_mode imode = GET_MODE_INNER (mode); |
d02a5a4b JJ |
4778 | rtx re, im; |
4779 | ||
4780 | if (MEM_P (op0)) | |
4781 | { | |
4782 | re = adjust_address_nv (op0, imode, 0); | |
4783 | im = adjust_address_nv (op0, imode, GET_MODE_SIZE (imode)); | |
4784 | } | |
4785 | else | |
4786 | { | |
ef4bddc2 RS |
4787 | machine_mode ifmode = int_mode_for_mode (mode); |
4788 | machine_mode ihmode = int_mode_for_mode (imode); | |
d02a5a4b JJ |
4789 | rtx halfsize; |
4790 | if (ifmode == BLKmode || ihmode == BLKmode) | |
4791 | return NULL; | |
4792 | halfsize = GEN_INT (GET_MODE_BITSIZE (ihmode)); | |
4793 | re = op0; | |
4794 | if (mode != ifmode) | |
4795 | re = gen_rtx_SUBREG (ifmode, re, 0); | |
4796 | re = gen_rtx_ZERO_EXTRACT (ihmode, re, halfsize, const0_rtx); | |
4797 | if (imode != ihmode) | |
4798 | re = gen_rtx_SUBREG (imode, re, 0); | |
4799 | im = copy_rtx (op0); | |
4800 | if (mode != ifmode) | |
4801 | im = gen_rtx_SUBREG (ifmode, im, 0); | |
4802 | im = gen_rtx_ZERO_EXTRACT (ihmode, im, halfsize, halfsize); | |
4803 | if (imode != ihmode) | |
4804 | im = gen_rtx_SUBREG (imode, im, 0); | |
4805 | } | |
4806 | im = gen_rtx_NEG (imode, im); | |
4807 | return gen_rtx_CONCAT (mode, re, im); | |
4808 | } | |
4809 | ||
b5b8b0ac AO |
4810 | case ADDR_EXPR: |
4811 | op0 = expand_debug_expr (TREE_OPERAND (exp, 0)); | |
4812 | if (!op0 || !MEM_P (op0)) | |
c8a27c40 JJ |
4813 | { |
4814 | if ((TREE_CODE (TREE_OPERAND (exp, 0)) == VAR_DECL | |
4815 | || TREE_CODE (TREE_OPERAND (exp, 0)) == PARM_DECL | |
4816 | || TREE_CODE (TREE_OPERAND (exp, 0)) == RESULT_DECL) | |
f8cca67b JJ |
4817 | && (!TREE_ADDRESSABLE (TREE_OPERAND (exp, 0)) |
4818 | || target_for_debug_bind (TREE_OPERAND (exp, 0)))) | |
c8a27c40 JJ |
4819 | return gen_rtx_DEBUG_IMPLICIT_PTR (mode, TREE_OPERAND (exp, 0)); |
4820 | ||
4821 | if (handled_component_p (TREE_OPERAND (exp, 0))) | |
4822 | { | |
4823 | HOST_WIDE_INT bitoffset, bitsize, maxsize; | |
4824 | tree decl | |
4825 | = get_ref_base_and_extent (TREE_OPERAND (exp, 0), | |
4826 | &bitoffset, &bitsize, &maxsize); | |
4827 | if ((TREE_CODE (decl) == VAR_DECL | |
4828 | || TREE_CODE (decl) == PARM_DECL | |
4829 | || TREE_CODE (decl) == RESULT_DECL) | |
f8cca67b JJ |
4830 | && (!TREE_ADDRESSABLE (decl) |
4831 | || target_for_debug_bind (decl)) | |
c8a27c40 JJ |
4832 | && (bitoffset % BITS_PER_UNIT) == 0 |
4833 | && bitsize > 0 | |
4834 | && bitsize == maxsize) | |
0a81f074 RS |
4835 | { |
4836 | rtx base = gen_rtx_DEBUG_IMPLICIT_PTR (mode, decl); | |
4837 | return plus_constant (mode, base, bitoffset / BITS_PER_UNIT); | |
4838 | } | |
c8a27c40 JJ |
4839 | } |
4840 | ||
9430b7ba JJ |
4841 | if (TREE_CODE (TREE_OPERAND (exp, 0)) == MEM_REF |
4842 | && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)) | |
4843 | == ADDR_EXPR) | |
4844 | { | |
4845 | op0 = expand_debug_expr (TREE_OPERAND (TREE_OPERAND (exp, 0), | |
4846 | 0)); | |
4847 | if (op0 != NULL | |
4848 | && (GET_CODE (op0) == DEBUG_IMPLICIT_PTR | |
4849 | || (GET_CODE (op0) == PLUS | |
4850 | && GET_CODE (XEXP (op0, 0)) == DEBUG_IMPLICIT_PTR | |
4851 | && CONST_INT_P (XEXP (op0, 1))))) | |
4852 | { | |
4853 | op1 = expand_debug_expr (TREE_OPERAND (TREE_OPERAND (exp, 0), | |
4854 | 1)); | |
4855 | if (!op1 || !CONST_INT_P (op1)) | |
4856 | return NULL; | |
4857 | ||
4858 | return plus_constant (mode, op0, INTVAL (op1)); | |
4859 | } | |
4860 | } | |
4861 | ||
c8a27c40 JJ |
4862 | return NULL; |
4863 | } | |
b5b8b0ac | 4864 | |
a148c4b2 | 4865 | as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp))); |
f61c6f34 | 4866 | op0 = convert_debug_memory_address (mode, XEXP (op0, 0), as); |
dda2da58 AO |
4867 | |
4868 | return op0; | |
b5b8b0ac AO |
4869 | |
4870 | case VECTOR_CST: | |
d2a12ae7 RG |
4871 | { |
4872 | unsigned i; | |
4873 | ||
4874 | op0 = gen_rtx_CONCATN | |
4875 | (mode, rtvec_alloc (TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp)))); | |
4876 | ||
4877 | for (i = 0; i < VECTOR_CST_NELTS (exp); ++i) | |
4878 | { | |
4879 | op1 = expand_debug_expr (VECTOR_CST_ELT (exp, i)); | |
4880 | if (!op1) | |
4881 | return NULL; | |
4882 | XVECEXP (op0, 0, i) = op1; | |
4883 | } | |
4884 | ||
4885 | return op0; | |
4886 | } | |
b5b8b0ac AO |
4887 | |
4888 | case CONSTRUCTOR: | |
47598145 MM |
4889 | if (TREE_CLOBBER_P (exp)) |
4890 | return NULL; | |
4891 | else if (TREE_CODE (TREE_TYPE (exp)) == VECTOR_TYPE) | |
b5b8b0ac AO |
4892 | { |
4893 | unsigned i; | |
4894 | tree val; | |
4895 | ||
4896 | op0 = gen_rtx_CONCATN | |
4897 | (mode, rtvec_alloc (TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp)))); | |
4898 | ||
4899 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), i, val) | |
4900 | { | |
4901 | op1 = expand_debug_expr (val); | |
4902 | if (!op1) | |
4903 | return NULL; | |
4904 | XVECEXP (op0, 0, i) = op1; | |
4905 | } | |
4906 | ||
4907 | if (i < TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp))) | |
4908 | { | |
4909 | op1 = expand_debug_expr | |
e8160c9a | 4910 | (build_zero_cst (TREE_TYPE (TREE_TYPE (exp)))); |
b5b8b0ac AO |
4911 | |
4912 | if (!op1) | |
4913 | return NULL; | |
4914 | ||
4915 | for (; i < TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp)); i++) | |
4916 | XVECEXP (op0, 0, i) = op1; | |
4917 | } | |
4918 | ||
4919 | return op0; | |
4920 | } | |
4921 | else | |
4922 | goto flag_unsupported; | |
4923 | ||
4924 | case CALL_EXPR: | |
4925 | /* ??? Maybe handle some builtins? */ | |
4926 | return NULL; | |
4927 | ||
4928 | case SSA_NAME: | |
4929 | { | |
2a8e30fb MM |
4930 | gimple g = get_gimple_for_ssa_name (exp); |
4931 | if (g) | |
4932 | { | |
dfde35b3 JJ |
4933 | tree t = NULL_TREE; |
4934 | if (deep_ter_debug_map) | |
4935 | { | |
4936 | tree *slot = deep_ter_debug_map->get (exp); | |
4937 | if (slot) | |
4938 | t = *slot; | |
4939 | } | |
4940 | if (t == NULL_TREE) | |
4941 | t = gimple_assign_rhs_to_tree (g); | |
4942 | op0 = expand_debug_expr (t); | |
2a8e30fb MM |
4943 | if (!op0) |
4944 | return NULL; | |
4945 | } | |
4946 | else | |
4947 | { | |
4948 | int part = var_to_partition (SA.map, exp); | |
b5b8b0ac | 4949 | |
2a8e30fb | 4950 | if (part == NO_PARTITION) |
a58a8e4b JJ |
4951 | { |
4952 | /* If this is a reference to an incoming value of parameter | |
4953 | that is never used in the code or where the incoming | |
4954 | value is never used in the code, use PARM_DECL's | |
4955 | DECL_RTL if set. */ | |
4956 | if (SSA_NAME_IS_DEFAULT_DEF (exp) | |
4957 | && TREE_CODE (SSA_NAME_VAR (exp)) == PARM_DECL) | |
4958 | { | |
12c5ffe5 EB |
4959 | op0 = expand_debug_parm_decl (SSA_NAME_VAR (exp)); |
4960 | if (op0) | |
4961 | goto adjust_mode; | |
a58a8e4b | 4962 | op0 = expand_debug_expr (SSA_NAME_VAR (exp)); |
12c5ffe5 EB |
4963 | if (op0) |
4964 | goto adjust_mode; | |
a58a8e4b JJ |
4965 | } |
4966 | return NULL; | |
4967 | } | |
b5b8b0ac | 4968 | |
2a8e30fb | 4969 | gcc_assert (part >= 0 && (unsigned)part < SA.map->num_partitions); |
b5b8b0ac | 4970 | |
abfea58d | 4971 | op0 = copy_rtx (SA.partition_to_pseudo[part]); |
2a8e30fb | 4972 | } |
b5b8b0ac AO |
4973 | goto adjust_mode; |
4974 | } | |
4975 | ||
4976 | case ERROR_MARK: | |
4977 | return NULL; | |
4978 | ||
7ece48b1 JJ |
4979 | /* Vector stuff. For most of the codes we don't have rtl codes. */ |
4980 | case REALIGN_LOAD_EXPR: | |
4981 | case REDUC_MAX_EXPR: | |
4982 | case REDUC_MIN_EXPR: | |
4983 | case REDUC_PLUS_EXPR: | |
4984 | case VEC_COND_EXPR: | |
7ece48b1 JJ |
4985 | case VEC_PACK_FIX_TRUNC_EXPR: |
4986 | case VEC_PACK_SAT_EXPR: | |
4987 | case VEC_PACK_TRUNC_EXPR: | |
7ece48b1 JJ |
4988 | case VEC_UNPACK_FLOAT_HI_EXPR: |
4989 | case VEC_UNPACK_FLOAT_LO_EXPR: | |
4990 | case VEC_UNPACK_HI_EXPR: | |
4991 | case VEC_UNPACK_LO_EXPR: | |
4992 | case VEC_WIDEN_MULT_HI_EXPR: | |
4993 | case VEC_WIDEN_MULT_LO_EXPR: | |
3f30a9a6 RH |
4994 | case VEC_WIDEN_MULT_EVEN_EXPR: |
4995 | case VEC_WIDEN_MULT_ODD_EXPR: | |
36ba4aae IR |
4996 | case VEC_WIDEN_LSHIFT_HI_EXPR: |
4997 | case VEC_WIDEN_LSHIFT_LO_EXPR: | |
3f3af9df | 4998 | case VEC_PERM_EXPR: |
7ece48b1 JJ |
4999 | return NULL; |
5000 | ||
98449720 | 5001 | /* Misc codes. */ |
7ece48b1 JJ |
5002 | case ADDR_SPACE_CONVERT_EXPR: |
5003 | case FIXED_CONVERT_EXPR: | |
5004 | case OBJ_TYPE_REF: | |
5005 | case WITH_SIZE_EXPR: | |
5006 | return NULL; | |
5007 | ||
5008 | case DOT_PROD_EXPR: | |
5009 | if (SCALAR_INT_MODE_P (GET_MODE (op0)) | |
5010 | && SCALAR_INT_MODE_P (mode)) | |
5011 | { | |
2ba172e0 JJ |
5012 | op0 |
5013 | = simplify_gen_unary (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, | |
5014 | 0))) | |
5015 | ? ZERO_EXTEND : SIGN_EXTEND, mode, op0, | |
5016 | inner_mode); | |
5017 | op1 | |
5018 | = simplify_gen_unary (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, | |
5019 | 1))) | |
5020 | ? ZERO_EXTEND : SIGN_EXTEND, mode, op1, | |
5021 | inner_mode); | |
5022 | op0 = simplify_gen_binary (MULT, mode, op0, op1); | |
5023 | return simplify_gen_binary (PLUS, mode, op0, op2); | |
7ece48b1 JJ |
5024 | } |
5025 | return NULL; | |
5026 | ||
5027 | case WIDEN_MULT_EXPR: | |
0354c0c7 BS |
5028 | case WIDEN_MULT_PLUS_EXPR: |
5029 | case WIDEN_MULT_MINUS_EXPR: | |
7ece48b1 JJ |
5030 | if (SCALAR_INT_MODE_P (GET_MODE (op0)) |
5031 | && SCALAR_INT_MODE_P (mode)) | |
5032 | { | |
2ba172e0 | 5033 | inner_mode = GET_MODE (op0); |
7ece48b1 | 5034 | if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0)))) |
5b58b39b | 5035 | op0 = simplify_gen_unary (ZERO_EXTEND, mode, op0, inner_mode); |
7ece48b1 | 5036 | else |
5b58b39b | 5037 | op0 = simplify_gen_unary (SIGN_EXTEND, mode, op0, inner_mode); |
7ece48b1 | 5038 | if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 1)))) |
5b58b39b | 5039 | op1 = simplify_gen_unary (ZERO_EXTEND, mode, op1, inner_mode); |
7ece48b1 | 5040 | else |
5b58b39b | 5041 | op1 = simplify_gen_unary (SIGN_EXTEND, mode, op1, inner_mode); |
2ba172e0 | 5042 | op0 = simplify_gen_binary (MULT, mode, op0, op1); |
0354c0c7 BS |
5043 | if (TREE_CODE (exp) == WIDEN_MULT_EXPR) |
5044 | return op0; | |
5045 | else if (TREE_CODE (exp) == WIDEN_MULT_PLUS_EXPR) | |
2ba172e0 | 5046 | return simplify_gen_binary (PLUS, mode, op0, op2); |
0354c0c7 | 5047 | else |
2ba172e0 | 5048 | return simplify_gen_binary (MINUS, mode, op2, op0); |
7ece48b1 JJ |
5049 | } |
5050 | return NULL; | |
5051 | ||
98449720 RH |
5052 | case MULT_HIGHPART_EXPR: |
5053 | /* ??? Similar to the above. */ | |
5054 | return NULL; | |
5055 | ||
7ece48b1 | 5056 | case WIDEN_SUM_EXPR: |
3f3af9df | 5057 | case WIDEN_LSHIFT_EXPR: |
7ece48b1 JJ |
5058 | if (SCALAR_INT_MODE_P (GET_MODE (op0)) |
5059 | && SCALAR_INT_MODE_P (mode)) | |
5060 | { | |
2ba172e0 JJ |
5061 | op0 |
5062 | = simplify_gen_unary (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, | |
5063 | 0))) | |
5064 | ? ZERO_EXTEND : SIGN_EXTEND, mode, op0, | |
5065 | inner_mode); | |
3f3af9df JJ |
5066 | return simplify_gen_binary (TREE_CODE (exp) == WIDEN_LSHIFT_EXPR |
5067 | ? ASHIFT : PLUS, mode, op0, op1); | |
7ece48b1 JJ |
5068 | } |
5069 | return NULL; | |
5070 | ||
0f59b812 | 5071 | case FMA_EXPR: |
2ba172e0 | 5072 | return simplify_gen_ternary (FMA, mode, inner_mode, op0, op1, op2); |
0f59b812 | 5073 | |
b5b8b0ac AO |
5074 | default: |
5075 | flag_unsupported: | |
5076 | #ifdef ENABLE_CHECKING | |
5077 | debug_tree (exp); | |
5078 | gcc_unreachable (); | |
5079 | #else | |
5080 | return NULL; | |
5081 | #endif | |
5082 | } | |
5083 | } | |
5084 | ||
ddb555ed JJ |
5085 | /* Return an RTX equivalent to the source bind value of the tree expression |
5086 | EXP. */ | |
5087 | ||
5088 | static rtx | |
5089 | expand_debug_source_expr (tree exp) | |
5090 | { | |
5091 | rtx op0 = NULL_RTX; | |
ef4bddc2 | 5092 | machine_mode mode = VOIDmode, inner_mode; |
ddb555ed JJ |
5093 | |
5094 | switch (TREE_CODE (exp)) | |
5095 | { | |
5096 | case PARM_DECL: | |
5097 | { | |
ddb555ed | 5098 | mode = DECL_MODE (exp); |
12c5ffe5 EB |
5099 | op0 = expand_debug_parm_decl (exp); |
5100 | if (op0) | |
5101 | break; | |
ddb555ed JJ |
5102 | /* See if this isn't an argument that has been completely |
5103 | optimized out. */ | |
5104 | if (!DECL_RTL_SET_P (exp) | |
12c5ffe5 | 5105 | && !DECL_INCOMING_RTL (exp) |
ddb555ed JJ |
5106 | && DECL_ABSTRACT_ORIGIN (current_function_decl)) |
5107 | { | |
7b575cfa | 5108 | tree aexp = DECL_ORIGIN (exp); |
ddb555ed JJ |
5109 | if (DECL_CONTEXT (aexp) |
5110 | == DECL_ABSTRACT_ORIGIN (current_function_decl)) | |
5111 | { | |
9771b263 | 5112 | vec<tree, va_gc> **debug_args; |
ddb555ed JJ |
5113 | unsigned int ix; |
5114 | tree ddecl; | |
ddb555ed JJ |
5115 | debug_args = decl_debug_args_lookup (current_function_decl); |
5116 | if (debug_args != NULL) | |
5117 | { | |
9771b263 | 5118 | for (ix = 0; vec_safe_iterate (*debug_args, ix, &ddecl); |
ddb555ed JJ |
5119 | ix += 2) |
5120 | if (ddecl == aexp) | |
5121 | return gen_rtx_DEBUG_PARAMETER_REF (mode, aexp); | |
5122 | } | |
5123 | } | |
5124 | } | |
5125 | break; | |
5126 | } | |
5127 | default: | |
5128 | break; | |
5129 | } | |
5130 | ||
5131 | if (op0 == NULL_RTX) | |
5132 | return NULL_RTX; | |
5133 | ||
5134 | inner_mode = GET_MODE (op0); | |
5135 | if (mode == inner_mode) | |
5136 | return op0; | |
5137 | ||
5138 | if (FLOAT_MODE_P (mode) && FLOAT_MODE_P (inner_mode)) | |
5139 | { | |
5140 | if (GET_MODE_BITSIZE (mode) == GET_MODE_BITSIZE (inner_mode)) | |
5141 | op0 = simplify_gen_subreg (mode, op0, inner_mode, 0); | |
5142 | else if (GET_MODE_BITSIZE (mode) < GET_MODE_BITSIZE (inner_mode)) | |
5143 | op0 = simplify_gen_unary (FLOAT_TRUNCATE, mode, op0, inner_mode); | |
5144 | else | |
5145 | op0 = simplify_gen_unary (FLOAT_EXTEND, mode, op0, inner_mode); | |
5146 | } | |
5147 | else if (FLOAT_MODE_P (mode)) | |
5148 | gcc_unreachable (); | |
5149 | else if (FLOAT_MODE_P (inner_mode)) | |
5150 | { | |
5151 | if (TYPE_UNSIGNED (TREE_TYPE (exp))) | |
5152 | op0 = simplify_gen_unary (UNSIGNED_FIX, mode, op0, inner_mode); | |
5153 | else | |
5154 | op0 = simplify_gen_unary (FIX, mode, op0, inner_mode); | |
5155 | } | |
5156 | else if (CONSTANT_P (op0) | |
5157 | || GET_MODE_BITSIZE (mode) <= GET_MODE_BITSIZE (inner_mode)) | |
3403a1a9 | 5158 | op0 = lowpart_subreg (mode, op0, inner_mode); |
ddb555ed JJ |
5159 | else if (TYPE_UNSIGNED (TREE_TYPE (exp))) |
5160 | op0 = simplify_gen_unary (ZERO_EXTEND, mode, op0, inner_mode); | |
5161 | else | |
5162 | op0 = simplify_gen_unary (SIGN_EXTEND, mode, op0, inner_mode); | |
5163 | ||
5164 | return op0; | |
5165 | } | |
5166 | ||
6cfa417f JJ |
5167 | /* Ensure INSN_VAR_LOCATION_LOC (insn) doesn't have unbound complexity. |
5168 | Allow 4 levels of rtl nesting for most rtl codes, and if we see anything | |
5169 | deeper than that, create DEBUG_EXPRs and emit DEBUG_INSNs before INSN. */ | |
5170 | ||
5171 | static void | |
b47aae36 | 5172 | avoid_complex_debug_insns (rtx_insn *insn, rtx *exp_p, int depth) |
6cfa417f JJ |
5173 | { |
5174 | rtx exp = *exp_p; | |
5175 | ||
5176 | if (exp == NULL_RTX) | |
5177 | return; | |
5178 | ||
5179 | if ((OBJECT_P (exp) && !MEM_P (exp)) || GET_CODE (exp) == CLOBBER) | |
5180 | return; | |
5181 | ||
5182 | if (depth == 4) | |
5183 | { | |
5184 | /* Create DEBUG_EXPR (and DEBUG_EXPR_DECL). */ | |
5185 | rtx dval = make_debug_expr_from_rtl (exp); | |
5186 | ||
5187 | /* Emit a debug bind insn before INSN. */ | |
5188 | rtx bind = gen_rtx_VAR_LOCATION (GET_MODE (exp), | |
5189 | DEBUG_EXPR_TREE_DECL (dval), exp, | |
5190 | VAR_INIT_STATUS_INITIALIZED); | |
5191 | ||
5192 | emit_debug_insn_before (bind, insn); | |
5193 | *exp_p = dval; | |
5194 | return; | |
5195 | } | |
5196 | ||
5197 | const char *format_ptr = GET_RTX_FORMAT (GET_CODE (exp)); | |
5198 | int i, j; | |
5199 | for (i = 0; i < GET_RTX_LENGTH (GET_CODE (exp)); i++) | |
5200 | switch (*format_ptr++) | |
5201 | { | |
5202 | case 'e': | |
5203 | avoid_complex_debug_insns (insn, &XEXP (exp, i), depth + 1); | |
5204 | break; | |
5205 | ||
5206 | case 'E': | |
5207 | case 'V': | |
5208 | for (j = 0; j < XVECLEN (exp, i); j++) | |
5209 | avoid_complex_debug_insns (insn, &XVECEXP (exp, i, j), depth + 1); | |
5210 | break; | |
5211 | ||
5212 | default: | |
5213 | break; | |
5214 | } | |
5215 | } | |
5216 | ||
b5b8b0ac AO |
5217 | /* Expand the _LOCs in debug insns. We run this after expanding all |
5218 | regular insns, so that any variables referenced in the function | |
5219 | will have their DECL_RTLs set. */ | |
5220 | ||
5221 | static void | |
5222 | expand_debug_locations (void) | |
5223 | { | |
b47aae36 DM |
5224 | rtx_insn *insn; |
5225 | rtx_insn *last = get_last_insn (); | |
b5b8b0ac AO |
5226 | int save_strict_alias = flag_strict_aliasing; |
5227 | ||
5228 | /* New alias sets while setting up memory attributes cause | |
5229 | -fcompare-debug failures, even though it doesn't bring about any | |
5230 | codegen changes. */ | |
5231 | flag_strict_aliasing = 0; | |
5232 | ||
5233 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) | |
5234 | if (DEBUG_INSN_P (insn)) | |
5235 | { | |
5236 | tree value = (tree)INSN_VAR_LOCATION_LOC (insn); | |
b47aae36 DM |
5237 | rtx val; |
5238 | rtx_insn *prev_insn, *insn2; | |
ef4bddc2 | 5239 | machine_mode mode; |
b5b8b0ac AO |
5240 | |
5241 | if (value == NULL_TREE) | |
5242 | val = NULL_RTX; | |
5243 | else | |
5244 | { | |
ddb555ed JJ |
5245 | if (INSN_VAR_LOCATION_STATUS (insn) |
5246 | == VAR_INIT_STATUS_UNINITIALIZED) | |
5247 | val = expand_debug_source_expr (value); | |
dfde35b3 JJ |
5248 | /* The avoid_deep_ter_for_debug function inserts |
5249 | debug bind stmts after SSA_NAME definition, with the | |
5250 | SSA_NAME as the whole bind location. Disable temporarily | |
5251 | expansion of that SSA_NAME into the DEBUG_EXPR_DECL | |
5252 | being defined in this DEBUG_INSN. */ | |
5253 | else if (deep_ter_debug_map && TREE_CODE (value) == SSA_NAME) | |
5254 | { | |
5255 | tree *slot = deep_ter_debug_map->get (value); | |
5256 | if (slot) | |
5257 | { | |
5258 | if (*slot == INSN_VAR_LOCATION_DECL (insn)) | |
5259 | *slot = NULL_TREE; | |
5260 | else | |
5261 | slot = NULL; | |
5262 | } | |
5263 | val = expand_debug_expr (value); | |
5264 | if (slot) | |
5265 | *slot = INSN_VAR_LOCATION_DECL (insn); | |
5266 | } | |
ddb555ed JJ |
5267 | else |
5268 | val = expand_debug_expr (value); | |
b5b8b0ac AO |
5269 | gcc_assert (last == get_last_insn ()); |
5270 | } | |
5271 | ||
5272 | if (!val) | |
5273 | val = gen_rtx_UNKNOWN_VAR_LOC (); | |
5274 | else | |
5275 | { | |
5276 | mode = GET_MODE (INSN_VAR_LOCATION (insn)); | |
5277 | ||
5278 | gcc_assert (mode == GET_MODE (val) | |
5279 | || (GET_MODE (val) == VOIDmode | |
33ffb5c5 | 5280 | && (CONST_SCALAR_INT_P (val) |
b5b8b0ac | 5281 | || GET_CODE (val) == CONST_FIXED |
b5b8b0ac AO |
5282 | || GET_CODE (val) == LABEL_REF))); |
5283 | } | |
5284 | ||
5285 | INSN_VAR_LOCATION_LOC (insn) = val; | |
6cfa417f JJ |
5286 | prev_insn = PREV_INSN (insn); |
5287 | for (insn2 = insn; insn2 != prev_insn; insn2 = PREV_INSN (insn2)) | |
5288 | avoid_complex_debug_insns (insn2, &INSN_VAR_LOCATION_LOC (insn2), 0); | |
b5b8b0ac AO |
5289 | } |
5290 | ||
5291 | flag_strict_aliasing = save_strict_alias; | |
5292 | } | |
5293 | ||
d2626c0b YR |
5294 | /* Performs swapping operands of commutative operations to expand |
5295 | the expensive one first. */ | |
5296 | ||
5297 | static void | |
5298 | reorder_operands (basic_block bb) | |
5299 | { | |
5300 | unsigned int *lattice; /* Hold cost of each statement. */ | |
5301 | unsigned int i = 0, n = 0; | |
5302 | gimple_stmt_iterator gsi; | |
5303 | gimple_seq stmts; | |
5304 | gimple stmt; | |
5305 | bool swap; | |
5306 | tree op0, op1; | |
5307 | ssa_op_iter iter; | |
5308 | use_operand_p use_p; | |
5309 | gimple def0, def1; | |
5310 | ||
5311 | /* Compute cost of each statement using estimate_num_insns. */ | |
5312 | stmts = bb_seq (bb); | |
5313 | for (gsi = gsi_start (stmts); !gsi_end_p (gsi); gsi_next (&gsi)) | |
5314 | { | |
5315 | stmt = gsi_stmt (gsi); | |
090238ee YR |
5316 | if (!is_gimple_debug (stmt)) |
5317 | gimple_set_uid (stmt, n++); | |
d2626c0b YR |
5318 | } |
5319 | lattice = XNEWVEC (unsigned int, n); | |
5320 | for (gsi = gsi_start (stmts); !gsi_end_p (gsi); gsi_next (&gsi)) | |
5321 | { | |
5322 | unsigned cost; | |
5323 | stmt = gsi_stmt (gsi); | |
090238ee YR |
5324 | if (is_gimple_debug (stmt)) |
5325 | continue; | |
d2626c0b YR |
5326 | cost = estimate_num_insns (stmt, &eni_size_weights); |
5327 | lattice[i] = cost; | |
5328 | FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter, SSA_OP_USE) | |
5329 | { | |
5330 | tree use = USE_FROM_PTR (use_p); | |
5331 | gimple def_stmt; | |
5332 | if (TREE_CODE (use) != SSA_NAME) | |
5333 | continue; | |
5334 | def_stmt = get_gimple_for_ssa_name (use); | |
5335 | if (!def_stmt) | |
5336 | continue; | |
5337 | lattice[i] += lattice[gimple_uid (def_stmt)]; | |
5338 | } | |
5339 | i++; | |
5340 | if (!is_gimple_assign (stmt) | |
5341 | || !commutative_tree_code (gimple_assign_rhs_code (stmt))) | |
5342 | continue; | |
5343 | op0 = gimple_op (stmt, 1); | |
5344 | op1 = gimple_op (stmt, 2); | |
5345 | if (TREE_CODE (op0) != SSA_NAME | |
5346 | || TREE_CODE (op1) != SSA_NAME) | |
5347 | continue; | |
5348 | /* Swap operands if the second one is more expensive. */ | |
5349 | def0 = get_gimple_for_ssa_name (op0); | |
d2626c0b YR |
5350 | def1 = get_gimple_for_ssa_name (op1); |
5351 | if (!def1) | |
5352 | continue; | |
5353 | swap = false; | |
68ca4ac9 | 5354 | if (!def0 || lattice[gimple_uid (def1)] > lattice[gimple_uid (def0)]) |
d2626c0b YR |
5355 | swap = true; |
5356 | if (swap) | |
5357 | { | |
5358 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
5359 | { | |
5360 | fprintf (dump_file, "Swap operands in stmt:\n"); | |
5361 | print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM); | |
5362 | fprintf (dump_file, "Cost left opnd=%d, right opnd=%d\n", | |
68ca4ac9 | 5363 | def0 ? lattice[gimple_uid (def0)] : 0, |
d2626c0b YR |
5364 | lattice[gimple_uid (def1)]); |
5365 | } | |
5366 | swap_ssa_operands (stmt, gimple_assign_rhs1_ptr (stmt), | |
5367 | gimple_assign_rhs2_ptr (stmt)); | |
5368 | } | |
5369 | } | |
5370 | XDELETE (lattice); | |
5371 | } | |
5372 | ||
242229bb JH |
5373 | /* Expand basic block BB from GIMPLE trees to RTL. */ |
5374 | ||
5375 | static basic_block | |
f3ddd692 | 5376 | expand_gimple_basic_block (basic_block bb, bool disable_tail_calls) |
242229bb | 5377 | { |
726a989a RB |
5378 | gimple_stmt_iterator gsi; |
5379 | gimple_seq stmts; | |
5380 | gimple stmt = NULL; | |
66e8df53 | 5381 | rtx_note *note; |
b47aae36 | 5382 | rtx_insn *last; |
242229bb | 5383 | edge e; |
628f6a4e | 5384 | edge_iterator ei; |
242229bb JH |
5385 | |
5386 | if (dump_file) | |
726a989a RB |
5387 | fprintf (dump_file, "\n;; Generating RTL for gimple basic block %d\n", |
5388 | bb->index); | |
5389 | ||
5390 | /* Note that since we are now transitioning from GIMPLE to RTL, we | |
5391 | cannot use the gsi_*_bb() routines because they expect the basic | |
5392 | block to be in GIMPLE, instead of RTL. Therefore, we need to | |
5393 | access the BB sequence directly. */ | |
d2626c0b YR |
5394 | if (optimize) |
5395 | reorder_operands (bb); | |
726a989a | 5396 | stmts = bb_seq (bb); |
3e8b732e MM |
5397 | bb->il.gimple.seq = NULL; |
5398 | bb->il.gimple.phi_nodes = NULL; | |
bf08ebeb | 5399 | rtl_profile_for_bb (bb); |
5e2d947c JH |
5400 | init_rtl_bb_info (bb); |
5401 | bb->flags |= BB_RTL; | |
5402 | ||
a9b77cd1 ZD |
5403 | /* Remove the RETURN_EXPR if we may fall though to the exit |
5404 | instead. */ | |
726a989a RB |
5405 | gsi = gsi_last (stmts); |
5406 | if (!gsi_end_p (gsi) | |
5407 | && gimple_code (gsi_stmt (gsi)) == GIMPLE_RETURN) | |
a9b77cd1 | 5408 | { |
538dd0b7 | 5409 | greturn *ret_stmt = as_a <greturn *> (gsi_stmt (gsi)); |
a9b77cd1 ZD |
5410 | |
5411 | gcc_assert (single_succ_p (bb)); | |
fefa31b5 | 5412 | gcc_assert (single_succ (bb) == EXIT_BLOCK_PTR_FOR_FN (cfun)); |
a9b77cd1 | 5413 | |
fefa31b5 | 5414 | if (bb->next_bb == EXIT_BLOCK_PTR_FOR_FN (cfun) |
726a989a | 5415 | && !gimple_return_retval (ret_stmt)) |
a9b77cd1 | 5416 | { |
726a989a | 5417 | gsi_remove (&gsi, false); |
a9b77cd1 ZD |
5418 | single_succ_edge (bb)->flags |= EDGE_FALLTHRU; |
5419 | } | |
5420 | } | |
5421 | ||
726a989a RB |
5422 | gsi = gsi_start (stmts); |
5423 | if (!gsi_end_p (gsi)) | |
8b11009b | 5424 | { |
726a989a RB |
5425 | stmt = gsi_stmt (gsi); |
5426 | if (gimple_code (stmt) != GIMPLE_LABEL) | |
5427 | stmt = NULL; | |
8b11009b | 5428 | } |
242229bb | 5429 | |
134aa83c | 5430 | rtx_code_label **elt = lab_rtx_for_bb->get (bb); |
8b11009b ZD |
5431 | |
5432 | if (stmt || elt) | |
242229bb JH |
5433 | { |
5434 | last = get_last_insn (); | |
5435 | ||
8b11009b ZD |
5436 | if (stmt) |
5437 | { | |
28ed065e | 5438 | expand_gimple_stmt (stmt); |
726a989a | 5439 | gsi_next (&gsi); |
8b11009b ZD |
5440 | } |
5441 | ||
5442 | if (elt) | |
39c8aaa4 | 5443 | emit_label (*elt); |
242229bb | 5444 | |
caf93cb0 | 5445 | /* Java emits line number notes in the top of labels. |
c22cacf3 | 5446 | ??? Make this go away once line number notes are obsoleted. */ |
1130d5e3 | 5447 | BB_HEAD (bb) = NEXT_INSN (last); |
4b4bf941 | 5448 | if (NOTE_P (BB_HEAD (bb))) |
1130d5e3 | 5449 | BB_HEAD (bb) = NEXT_INSN (BB_HEAD (bb)); |
242229bb | 5450 | note = emit_note_after (NOTE_INSN_BASIC_BLOCK, BB_HEAD (bb)); |
b7211528 | 5451 | |
726a989a | 5452 | maybe_dump_rtl_for_gimple_stmt (stmt, last); |
242229bb JH |
5453 | } |
5454 | else | |
1130d5e3 | 5455 | BB_HEAD (bb) = note = emit_note (NOTE_INSN_BASIC_BLOCK); |
242229bb JH |
5456 | |
5457 | NOTE_BASIC_BLOCK (note) = bb; | |
5458 | ||
726a989a | 5459 | for (; !gsi_end_p (gsi); gsi_next (&gsi)) |
242229bb | 5460 | { |
cea49550 | 5461 | basic_block new_bb; |
242229bb | 5462 | |
b5b8b0ac | 5463 | stmt = gsi_stmt (gsi); |
2a8e30fb MM |
5464 | |
5465 | /* If this statement is a non-debug one, and we generate debug | |
5466 | insns, then this one might be the last real use of a TERed | |
5467 | SSA_NAME, but where there are still some debug uses further | |
5468 | down. Expanding the current SSA name in such further debug | |
5469 | uses by their RHS might lead to wrong debug info, as coalescing | |
5470 | might make the operands of such RHS be placed into the same | |
5471 | pseudo as something else. Like so: | |
5472 | a_1 = a_0 + 1; // Assume a_1 is TERed and a_0 is dead | |
5473 | use(a_1); | |
5474 | a_2 = ... | |
5475 | #DEBUG ... => a_1 | |
5476 | As a_0 and a_2 don't overlap in lifetime, assume they are coalesced. | |
5477 | If we now would expand a_1 by it's RHS (a_0 + 1) in the debug use, | |
5478 | the write to a_2 would actually have clobbered the place which | |
5479 | formerly held a_0. | |
5480 | ||
5481 | So, instead of that, we recognize the situation, and generate | |
5482 | debug temporaries at the last real use of TERed SSA names: | |
5483 | a_1 = a_0 + 1; | |
5484 | #DEBUG #D1 => a_1 | |
5485 | use(a_1); | |
5486 | a_2 = ... | |
5487 | #DEBUG ... => #D1 | |
5488 | */ | |
5489 | if (MAY_HAVE_DEBUG_INSNS | |
5490 | && SA.values | |
5491 | && !is_gimple_debug (stmt)) | |
5492 | { | |
5493 | ssa_op_iter iter; | |
5494 | tree op; | |
5495 | gimple def; | |
5496 | ||
5368224f | 5497 | location_t sloc = curr_insn_location (); |
2a8e30fb MM |
5498 | |
5499 | /* Look for SSA names that have their last use here (TERed | |
5500 | names always have only one real use). */ | |
5501 | FOR_EACH_SSA_TREE_OPERAND (op, stmt, iter, SSA_OP_USE) | |
5502 | if ((def = get_gimple_for_ssa_name (op))) | |
5503 | { | |
5504 | imm_use_iterator imm_iter; | |
5505 | use_operand_p use_p; | |
5506 | bool have_debug_uses = false; | |
5507 | ||
5508 | FOR_EACH_IMM_USE_FAST (use_p, imm_iter, op) | |
5509 | { | |
5510 | if (gimple_debug_bind_p (USE_STMT (use_p))) | |
5511 | { | |
5512 | have_debug_uses = true; | |
5513 | break; | |
5514 | } | |
5515 | } | |
5516 | ||
5517 | if (have_debug_uses) | |
5518 | { | |
871dae34 | 5519 | /* OP is a TERed SSA name, with DEF its defining |
2a8e30fb MM |
5520 | statement, and where OP is used in further debug |
5521 | instructions. Generate a debug temporary, and | |
5522 | replace all uses of OP in debug insns with that | |
5523 | temporary. */ | |
5524 | gimple debugstmt; | |
5525 | tree value = gimple_assign_rhs_to_tree (def); | |
5526 | tree vexpr = make_node (DEBUG_EXPR_DECL); | |
5527 | rtx val; | |
ef4bddc2 | 5528 | machine_mode mode; |
2a8e30fb | 5529 | |
5368224f | 5530 | set_curr_insn_location (gimple_location (def)); |
2a8e30fb MM |
5531 | |
5532 | DECL_ARTIFICIAL (vexpr) = 1; | |
5533 | TREE_TYPE (vexpr) = TREE_TYPE (value); | |
5534 | if (DECL_P (value)) | |
5535 | mode = DECL_MODE (value); | |
5536 | else | |
5537 | mode = TYPE_MODE (TREE_TYPE (value)); | |
5538 | DECL_MODE (vexpr) = mode; | |
5539 | ||
5540 | val = gen_rtx_VAR_LOCATION | |
5541 | (mode, vexpr, (rtx)value, VAR_INIT_STATUS_INITIALIZED); | |
5542 | ||
e8c6bb74 | 5543 | emit_debug_insn (val); |
2a8e30fb MM |
5544 | |
5545 | FOR_EACH_IMM_USE_STMT (debugstmt, imm_iter, op) | |
5546 | { | |
5547 | if (!gimple_debug_bind_p (debugstmt)) | |
5548 | continue; | |
5549 | ||
5550 | FOR_EACH_IMM_USE_ON_STMT (use_p, imm_iter) | |
5551 | SET_USE (use_p, vexpr); | |
5552 | ||
5553 | update_stmt (debugstmt); | |
5554 | } | |
5555 | } | |
5556 | } | |
5368224f | 5557 | set_curr_insn_location (sloc); |
2a8e30fb MM |
5558 | } |
5559 | ||
a5883ba0 | 5560 | currently_expanding_gimple_stmt = stmt; |
b5b8b0ac | 5561 | |
242229bb JH |
5562 | /* Expand this statement, then evaluate the resulting RTL and |
5563 | fixup the CFG accordingly. */ | |
726a989a | 5564 | if (gimple_code (stmt) == GIMPLE_COND) |
cea49550 | 5565 | { |
538dd0b7 | 5566 | new_bb = expand_gimple_cond (bb, as_a <gcond *> (stmt)); |
cea49550 RH |
5567 | if (new_bb) |
5568 | return new_bb; | |
5569 | } | |
b5b8b0ac AO |
5570 | else if (gimple_debug_bind_p (stmt)) |
5571 | { | |
5368224f | 5572 | location_t sloc = curr_insn_location (); |
b5b8b0ac AO |
5573 | gimple_stmt_iterator nsi = gsi; |
5574 | ||
5575 | for (;;) | |
5576 | { | |
5577 | tree var = gimple_debug_bind_get_var (stmt); | |
5578 | tree value; | |
5579 | rtx val; | |
ef4bddc2 | 5580 | machine_mode mode; |
b5b8b0ac | 5581 | |
ec8c1492 JJ |
5582 | if (TREE_CODE (var) != DEBUG_EXPR_DECL |
5583 | && TREE_CODE (var) != LABEL_DECL | |
5584 | && !target_for_debug_bind (var)) | |
5585 | goto delink_debug_stmt; | |
5586 | ||
b5b8b0ac AO |
5587 | if (gimple_debug_bind_has_value_p (stmt)) |
5588 | value = gimple_debug_bind_get_value (stmt); | |
5589 | else | |
5590 | value = NULL_TREE; | |
5591 | ||
5592 | last = get_last_insn (); | |
5593 | ||
5368224f | 5594 | set_curr_insn_location (gimple_location (stmt)); |
b5b8b0ac AO |
5595 | |
5596 | if (DECL_P (var)) | |
5597 | mode = DECL_MODE (var); | |
5598 | else | |
5599 | mode = TYPE_MODE (TREE_TYPE (var)); | |
5600 | ||
5601 | val = gen_rtx_VAR_LOCATION | |
5602 | (mode, var, (rtx)value, VAR_INIT_STATUS_INITIALIZED); | |
5603 | ||
e16b6fd0 | 5604 | emit_debug_insn (val); |
b5b8b0ac AO |
5605 | |
5606 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
5607 | { | |
5608 | /* We can't dump the insn with a TREE where an RTX | |
5609 | is expected. */ | |
e8c6bb74 | 5610 | PAT_VAR_LOCATION_LOC (val) = const0_rtx; |
b5b8b0ac | 5611 | maybe_dump_rtl_for_gimple_stmt (stmt, last); |
e8c6bb74 | 5612 | PAT_VAR_LOCATION_LOC (val) = (rtx)value; |
b5b8b0ac AO |
5613 | } |
5614 | ||
ec8c1492 | 5615 | delink_debug_stmt: |
2a8e30fb MM |
5616 | /* In order not to generate too many debug temporaries, |
5617 | we delink all uses of debug statements we already expanded. | |
5618 | Therefore debug statements between definition and real | |
5619 | use of TERed SSA names will continue to use the SSA name, | |
5620 | and not be replaced with debug temps. */ | |
5621 | delink_stmt_imm_use (stmt); | |
5622 | ||
b5b8b0ac AO |
5623 | gsi = nsi; |
5624 | gsi_next (&nsi); | |
5625 | if (gsi_end_p (nsi)) | |
5626 | break; | |
5627 | stmt = gsi_stmt (nsi); | |
5628 | if (!gimple_debug_bind_p (stmt)) | |
5629 | break; | |
5630 | } | |
5631 | ||
5368224f | 5632 | set_curr_insn_location (sloc); |
ddb555ed JJ |
5633 | } |
5634 | else if (gimple_debug_source_bind_p (stmt)) | |
5635 | { | |
5368224f | 5636 | location_t sloc = curr_insn_location (); |
ddb555ed JJ |
5637 | tree var = gimple_debug_source_bind_get_var (stmt); |
5638 | tree value = gimple_debug_source_bind_get_value (stmt); | |
5639 | rtx val; | |
ef4bddc2 | 5640 | machine_mode mode; |
ddb555ed JJ |
5641 | |
5642 | last = get_last_insn (); | |
5643 | ||
5368224f | 5644 | set_curr_insn_location (gimple_location (stmt)); |
ddb555ed JJ |
5645 | |
5646 | mode = DECL_MODE (var); | |
5647 | ||
5648 | val = gen_rtx_VAR_LOCATION (mode, var, (rtx)value, | |
5649 | VAR_INIT_STATUS_UNINITIALIZED); | |
5650 | ||
5651 | emit_debug_insn (val); | |
5652 | ||
5653 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
5654 | { | |
5655 | /* We can't dump the insn with a TREE where an RTX | |
5656 | is expected. */ | |
5657 | PAT_VAR_LOCATION_LOC (val) = const0_rtx; | |
5658 | maybe_dump_rtl_for_gimple_stmt (stmt, last); | |
5659 | PAT_VAR_LOCATION_LOC (val) = (rtx)value; | |
5660 | } | |
5661 | ||
5368224f | 5662 | set_curr_insn_location (sloc); |
b5b8b0ac | 5663 | } |
80c7a9eb | 5664 | else |
242229bb | 5665 | { |
538dd0b7 DM |
5666 | gcall *call_stmt = dyn_cast <gcall *> (stmt); |
5667 | if (call_stmt | |
5668 | && gimple_call_tail_p (call_stmt) | |
f3ddd692 | 5669 | && disable_tail_calls) |
538dd0b7 | 5670 | gimple_call_set_tail (call_stmt, false); |
f3ddd692 | 5671 | |
538dd0b7 | 5672 | if (call_stmt && gimple_call_tail_p (call_stmt)) |
cea49550 RH |
5673 | { |
5674 | bool can_fallthru; | |
538dd0b7 | 5675 | new_bb = expand_gimple_tailcall (bb, call_stmt, &can_fallthru); |
cea49550 RH |
5676 | if (new_bb) |
5677 | { | |
5678 | if (can_fallthru) | |
5679 | bb = new_bb; | |
5680 | else | |
5681 | return new_bb; | |
5682 | } | |
5683 | } | |
4d7a65ea | 5684 | else |
b7211528 | 5685 | { |
4e3825db | 5686 | def_operand_p def_p; |
4e3825db MM |
5687 | def_p = SINGLE_SSA_DEF_OPERAND (stmt, SSA_OP_DEF); |
5688 | ||
5689 | if (def_p != NULL) | |
5690 | { | |
5691 | /* Ignore this stmt if it is in the list of | |
5692 | replaceable expressions. */ | |
5693 | if (SA.values | |
b8698a0f | 5694 | && bitmap_bit_p (SA.values, |
e97809c6 | 5695 | SSA_NAME_VERSION (DEF_FROM_PTR (def_p)))) |
4e3825db MM |
5696 | continue; |
5697 | } | |
28ed065e | 5698 | last = expand_gimple_stmt (stmt); |
726a989a | 5699 | maybe_dump_rtl_for_gimple_stmt (stmt, last); |
b7211528 | 5700 | } |
242229bb JH |
5701 | } |
5702 | } | |
5703 | ||
a5883ba0 MM |
5704 | currently_expanding_gimple_stmt = NULL; |
5705 | ||
7241571e | 5706 | /* Expand implicit goto and convert goto_locus. */ |
a9b77cd1 ZD |
5707 | FOR_EACH_EDGE (e, ei, bb->succs) |
5708 | { | |
2f13f2de | 5709 | if (e->goto_locus != UNKNOWN_LOCATION) |
5368224f | 5710 | set_curr_insn_location (e->goto_locus); |
7241571e JJ |
5711 | if ((e->flags & EDGE_FALLTHRU) && e->dest != bb->next_bb) |
5712 | { | |
5713 | emit_jump (label_rtx_for_bb (e->dest)); | |
5714 | e->flags &= ~EDGE_FALLTHRU; | |
5715 | } | |
a9b77cd1 ZD |
5716 | } |
5717 | ||
ae761c45 AH |
5718 | /* Expanded RTL can create a jump in the last instruction of block. |
5719 | This later might be assumed to be a jump to successor and break edge insertion. | |
5720 | We need to insert dummy move to prevent this. PR41440. */ | |
5721 | if (single_succ_p (bb) | |
5722 | && (single_succ_edge (bb)->flags & EDGE_FALLTHRU) | |
5723 | && (last = get_last_insn ()) | |
5724 | && JUMP_P (last)) | |
5725 | { | |
5726 | rtx dummy = gen_reg_rtx (SImode); | |
5727 | emit_insn_after_noloc (gen_move_insn (dummy, dummy), last, NULL); | |
5728 | } | |
5729 | ||
242229bb JH |
5730 | do_pending_stack_adjust (); |
5731 | ||
3f117656 | 5732 | /* Find the block tail. The last insn in the block is the insn |
242229bb JH |
5733 | before a barrier and/or table jump insn. */ |
5734 | last = get_last_insn (); | |
4b4bf941 | 5735 | if (BARRIER_P (last)) |
242229bb JH |
5736 | last = PREV_INSN (last); |
5737 | if (JUMP_TABLE_DATA_P (last)) | |
5738 | last = PREV_INSN (PREV_INSN (last)); | |
1130d5e3 | 5739 | BB_END (bb) = last; |
caf93cb0 | 5740 | |
242229bb | 5741 | update_bb_for_insn (bb); |
80c7a9eb | 5742 | |
242229bb JH |
5743 | return bb; |
5744 | } | |
5745 | ||
5746 | ||
5747 | /* Create a basic block for initialization code. */ | |
5748 | ||
5749 | static basic_block | |
5750 | construct_init_block (void) | |
5751 | { | |
5752 | basic_block init_block, first_block; | |
fd44f634 JH |
5753 | edge e = NULL; |
5754 | int flags; | |
275a4187 | 5755 | |
fd44f634 | 5756 | /* Multiple entry points not supported yet. */ |
fefa31b5 DM |
5757 | gcc_assert (EDGE_COUNT (ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs) == 1); |
5758 | init_rtl_bb_info (ENTRY_BLOCK_PTR_FOR_FN (cfun)); | |
5759 | init_rtl_bb_info (EXIT_BLOCK_PTR_FOR_FN (cfun)); | |
5760 | ENTRY_BLOCK_PTR_FOR_FN (cfun)->flags |= BB_RTL; | |
5761 | EXIT_BLOCK_PTR_FOR_FN (cfun)->flags |= BB_RTL; | |
242229bb | 5762 | |
fefa31b5 | 5763 | e = EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun), 0); |
275a4187 | 5764 | |
fd44f634 JH |
5765 | /* When entry edge points to first basic block, we don't need jump, |
5766 | otherwise we have to jump into proper target. */ | |
fefa31b5 | 5767 | if (e && e->dest != ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb) |
fd44f634 | 5768 | { |
726a989a | 5769 | tree label = gimple_block_label (e->dest); |
fd44f634 | 5770 | |
1476d1bd | 5771 | emit_jump (jump_target_rtx (label)); |
fd44f634 | 5772 | flags = 0; |
275a4187 | 5773 | } |
fd44f634 JH |
5774 | else |
5775 | flags = EDGE_FALLTHRU; | |
242229bb JH |
5776 | |
5777 | init_block = create_basic_block (NEXT_INSN (get_insns ()), | |
5778 | get_last_insn (), | |
fefa31b5 DM |
5779 | ENTRY_BLOCK_PTR_FOR_FN (cfun)); |
5780 | init_block->frequency = ENTRY_BLOCK_PTR_FOR_FN (cfun)->frequency; | |
5781 | init_block->count = ENTRY_BLOCK_PTR_FOR_FN (cfun)->count; | |
726338f4 | 5782 | add_bb_to_loop (init_block, ENTRY_BLOCK_PTR_FOR_FN (cfun)->loop_father); |
242229bb JH |
5783 | if (e) |
5784 | { | |
5785 | first_block = e->dest; | |
5786 | redirect_edge_succ (e, init_block); | |
fd44f634 | 5787 | e = make_edge (init_block, first_block, flags); |
242229bb JH |
5788 | } |
5789 | else | |
fefa31b5 | 5790 | e = make_edge (init_block, EXIT_BLOCK_PTR_FOR_FN (cfun), EDGE_FALLTHRU); |
242229bb | 5791 | e->probability = REG_BR_PROB_BASE; |
fefa31b5 | 5792 | e->count = ENTRY_BLOCK_PTR_FOR_FN (cfun)->count; |
242229bb JH |
5793 | |
5794 | update_bb_for_insn (init_block); | |
5795 | return init_block; | |
5796 | } | |
5797 | ||
55e092c4 JH |
5798 | /* For each lexical block, set BLOCK_NUMBER to the depth at which it is |
5799 | found in the block tree. */ | |
5800 | ||
5801 | static void | |
5802 | set_block_levels (tree block, int level) | |
5803 | { | |
5804 | while (block) | |
5805 | { | |
5806 | BLOCK_NUMBER (block) = level; | |
5807 | set_block_levels (BLOCK_SUBBLOCKS (block), level + 1); | |
5808 | block = BLOCK_CHAIN (block); | |
5809 | } | |
5810 | } | |
242229bb JH |
5811 | |
5812 | /* Create a block containing landing pads and similar stuff. */ | |
5813 | ||
5814 | static void | |
5815 | construct_exit_block (void) | |
5816 | { | |
b47aae36 DM |
5817 | rtx_insn *head = get_last_insn (); |
5818 | rtx_insn *end; | |
242229bb | 5819 | basic_block exit_block; |
628f6a4e BE |
5820 | edge e, e2; |
5821 | unsigned ix; | |
5822 | edge_iterator ei; | |
79c7fda6 | 5823 | basic_block prev_bb = EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb; |
b47aae36 | 5824 | rtx_insn *orig_end = BB_END (prev_bb); |
242229bb | 5825 | |
fefa31b5 | 5826 | rtl_profile_for_bb (EXIT_BLOCK_PTR_FOR_FN (cfun)); |
bf08ebeb | 5827 | |
caf93cb0 | 5828 | /* Make sure the locus is set to the end of the function, so that |
242229bb | 5829 | epilogue line numbers and warnings are set properly. */ |
2f13f2de | 5830 | if (LOCATION_LOCUS (cfun->function_end_locus) != UNKNOWN_LOCATION) |
242229bb JH |
5831 | input_location = cfun->function_end_locus; |
5832 | ||
242229bb JH |
5833 | /* Generate rtl for function exit. */ |
5834 | expand_function_end (); | |
5835 | ||
5836 | end = get_last_insn (); | |
5837 | if (head == end) | |
5838 | return; | |
79c7fda6 JJ |
5839 | /* While emitting the function end we could move end of the last basic |
5840 | block. */ | |
1130d5e3 | 5841 | BB_END (prev_bb) = orig_end; |
4b4bf941 | 5842 | while (NEXT_INSN (head) && NOTE_P (NEXT_INSN (head))) |
242229bb | 5843 | head = NEXT_INSN (head); |
79c7fda6 JJ |
5844 | /* But make sure exit_block starts with RETURN_LABEL, otherwise the |
5845 | bb frequency counting will be confused. Any instructions before that | |
5846 | label are emitted for the case where PREV_BB falls through into the | |
5847 | exit block, so append those instructions to prev_bb in that case. */ | |
5848 | if (NEXT_INSN (head) != return_label) | |
5849 | { | |
5850 | while (NEXT_INSN (head) != return_label) | |
5851 | { | |
5852 | if (!NOTE_P (NEXT_INSN (head))) | |
1130d5e3 | 5853 | BB_END (prev_bb) = NEXT_INSN (head); |
79c7fda6 JJ |
5854 | head = NEXT_INSN (head); |
5855 | } | |
5856 | } | |
5857 | exit_block = create_basic_block (NEXT_INSN (head), end, prev_bb); | |
fefa31b5 DM |
5858 | exit_block->frequency = EXIT_BLOCK_PTR_FOR_FN (cfun)->frequency; |
5859 | exit_block->count = EXIT_BLOCK_PTR_FOR_FN (cfun)->count; | |
726338f4 | 5860 | add_bb_to_loop (exit_block, EXIT_BLOCK_PTR_FOR_FN (cfun)->loop_father); |
628f6a4e BE |
5861 | |
5862 | ix = 0; | |
fefa31b5 | 5863 | while (ix < EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)) |
242229bb | 5864 | { |
fefa31b5 | 5865 | e = EDGE_PRED (EXIT_BLOCK_PTR_FOR_FN (cfun), ix); |
242229bb | 5866 | if (!(e->flags & EDGE_ABNORMAL)) |
628f6a4e BE |
5867 | redirect_edge_succ (e, exit_block); |
5868 | else | |
5869 | ix++; | |
242229bb | 5870 | } |
628f6a4e | 5871 | |
fefa31b5 | 5872 | e = make_edge (exit_block, EXIT_BLOCK_PTR_FOR_FN (cfun), EDGE_FALLTHRU); |
242229bb | 5873 | e->probability = REG_BR_PROB_BASE; |
fefa31b5 DM |
5874 | e->count = EXIT_BLOCK_PTR_FOR_FN (cfun)->count; |
5875 | FOR_EACH_EDGE (e2, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds) | |
242229bb JH |
5876 | if (e2 != e) |
5877 | { | |
c22cacf3 | 5878 | e->count -= e2->count; |
242229bb JH |
5879 | exit_block->count -= e2->count; |
5880 | exit_block->frequency -= EDGE_FREQUENCY (e2); | |
5881 | } | |
5882 | if (e->count < 0) | |
5883 | e->count = 0; | |
5884 | if (exit_block->count < 0) | |
5885 | exit_block->count = 0; | |
5886 | if (exit_block->frequency < 0) | |
5887 | exit_block->frequency = 0; | |
5888 | update_bb_for_insn (exit_block); | |
5889 | } | |
5890 | ||
c22cacf3 | 5891 | /* Helper function for discover_nonconstant_array_refs. |
a1b23b2f UW |
5892 | Look for ARRAY_REF nodes with non-constant indexes and mark them |
5893 | addressable. */ | |
5894 | ||
5895 | static tree | |
5896 | discover_nonconstant_array_refs_r (tree * tp, int *walk_subtrees, | |
5897 | void *data ATTRIBUTE_UNUSED) | |
5898 | { | |
5899 | tree t = *tp; | |
5900 | ||
5901 | if (IS_TYPE_OR_DECL_P (t)) | |
5902 | *walk_subtrees = 0; | |
5903 | else if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF) | |
5904 | { | |
5905 | while (((TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF) | |
5906 | && is_gimple_min_invariant (TREE_OPERAND (t, 1)) | |
5907 | && (!TREE_OPERAND (t, 2) | |
5908 | || is_gimple_min_invariant (TREE_OPERAND (t, 2)))) | |
5909 | || (TREE_CODE (t) == COMPONENT_REF | |
5910 | && (!TREE_OPERAND (t,2) | |
5911 | || is_gimple_min_invariant (TREE_OPERAND (t, 2)))) | |
5912 | || TREE_CODE (t) == BIT_FIELD_REF | |
5913 | || TREE_CODE (t) == REALPART_EXPR | |
5914 | || TREE_CODE (t) == IMAGPART_EXPR | |
5915 | || TREE_CODE (t) == VIEW_CONVERT_EXPR | |
1043771b | 5916 | || CONVERT_EXPR_P (t)) |
a1b23b2f UW |
5917 | t = TREE_OPERAND (t, 0); |
5918 | ||
5919 | if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF) | |
5920 | { | |
5921 | t = get_base_address (t); | |
6f11d690 RG |
5922 | if (t && DECL_P (t) |
5923 | && DECL_MODE (t) != BLKmode) | |
a1b23b2f UW |
5924 | TREE_ADDRESSABLE (t) = 1; |
5925 | } | |
5926 | ||
5927 | *walk_subtrees = 0; | |
5928 | } | |
5929 | ||
5930 | return NULL_TREE; | |
5931 | } | |
5932 | ||
5933 | /* RTL expansion is not able to compile array references with variable | |
5934 | offsets for arrays stored in single register. Discover such | |
5935 | expressions and mark variables as addressable to avoid this | |
5936 | scenario. */ | |
5937 | ||
5938 | static void | |
5939 | discover_nonconstant_array_refs (void) | |
5940 | { | |
5941 | basic_block bb; | |
726a989a | 5942 | gimple_stmt_iterator gsi; |
a1b23b2f | 5943 | |
11cd3bed | 5944 | FOR_EACH_BB_FN (bb, cfun) |
726a989a RB |
5945 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
5946 | { | |
5947 | gimple stmt = gsi_stmt (gsi); | |
aa847cc8 JJ |
5948 | if (!is_gimple_debug (stmt)) |
5949 | walk_gimple_op (stmt, discover_nonconstant_array_refs_r, NULL); | |
726a989a | 5950 | } |
a1b23b2f UW |
5951 | } |
5952 | ||
2e3f842f L |
5953 | /* This function sets crtl->args.internal_arg_pointer to a virtual |
5954 | register if DRAP is needed. Local register allocator will replace | |
5955 | virtual_incoming_args_rtx with the virtual register. */ | |
5956 | ||
5957 | static void | |
5958 | expand_stack_alignment (void) | |
5959 | { | |
5960 | rtx drap_rtx; | |
e939805b | 5961 | unsigned int preferred_stack_boundary; |
2e3f842f L |
5962 | |
5963 | if (! SUPPORTS_STACK_ALIGNMENT) | |
5964 | return; | |
b8698a0f | 5965 | |
2e3f842f L |
5966 | if (cfun->calls_alloca |
5967 | || cfun->has_nonlocal_label | |
5968 | || crtl->has_nonlocal_goto) | |
5969 | crtl->need_drap = true; | |
5970 | ||
890b9b96 L |
5971 | /* Call update_stack_boundary here again to update incoming stack |
5972 | boundary. It may set incoming stack alignment to a different | |
5973 | value after RTL expansion. TARGET_FUNCTION_OK_FOR_SIBCALL may | |
5974 | use the minimum incoming stack alignment to check if it is OK | |
5975 | to perform sibcall optimization since sibcall optimization will | |
5976 | only align the outgoing stack to incoming stack boundary. */ | |
5977 | if (targetm.calls.update_stack_boundary) | |
5978 | targetm.calls.update_stack_boundary (); | |
5979 | ||
5980 | /* The incoming stack frame has to be aligned at least at | |
5981 | parm_stack_boundary. */ | |
5982 | gcc_assert (crtl->parm_stack_boundary <= INCOMING_STACK_BOUNDARY); | |
2e3f842f | 5983 | |
2e3f842f L |
5984 | /* Update crtl->stack_alignment_estimated and use it later to align |
5985 | stack. We check PREFERRED_STACK_BOUNDARY if there may be non-call | |
5986 | exceptions since callgraph doesn't collect incoming stack alignment | |
5987 | in this case. */ | |
8f4f502f | 5988 | if (cfun->can_throw_non_call_exceptions |
2e3f842f L |
5989 | && PREFERRED_STACK_BOUNDARY > crtl->preferred_stack_boundary) |
5990 | preferred_stack_boundary = PREFERRED_STACK_BOUNDARY; | |
5991 | else | |
5992 | preferred_stack_boundary = crtl->preferred_stack_boundary; | |
5993 | if (preferred_stack_boundary > crtl->stack_alignment_estimated) | |
5994 | crtl->stack_alignment_estimated = preferred_stack_boundary; | |
5995 | if (preferred_stack_boundary > crtl->stack_alignment_needed) | |
5996 | crtl->stack_alignment_needed = preferred_stack_boundary; | |
5997 | ||
890b9b96 L |
5998 | gcc_assert (crtl->stack_alignment_needed |
5999 | <= crtl->stack_alignment_estimated); | |
6000 | ||
2e3f842f | 6001 | crtl->stack_realign_needed |
e939805b | 6002 | = INCOMING_STACK_BOUNDARY < crtl->stack_alignment_estimated; |
d2d93c32 | 6003 | crtl->stack_realign_tried = crtl->stack_realign_needed; |
2e3f842f L |
6004 | |
6005 | crtl->stack_realign_processed = true; | |
6006 | ||
6007 | /* Target has to redefine TARGET_GET_DRAP_RTX to support stack | |
6008 | alignment. */ | |
6009 | gcc_assert (targetm.calls.get_drap_rtx != NULL); | |
b8698a0f | 6010 | drap_rtx = targetm.calls.get_drap_rtx (); |
2e3f842f | 6011 | |
d015f7cc L |
6012 | /* stack_realign_drap and drap_rtx must match. */ |
6013 | gcc_assert ((stack_realign_drap != 0) == (drap_rtx != NULL)); | |
6014 | ||
2e3f842f L |
6015 | /* Do nothing if NULL is returned, which means DRAP is not needed. */ |
6016 | if (NULL != drap_rtx) | |
6017 | { | |
6018 | crtl->args.internal_arg_pointer = drap_rtx; | |
6019 | ||
6020 | /* Call fixup_tail_calls to clean up REG_EQUIV note if DRAP is | |
6021 | needed. */ | |
6022 | fixup_tail_calls (); | |
6023 | } | |
6024 | } | |
862d0b35 DN |
6025 | \f |
6026 | ||
6027 | static void | |
6028 | expand_main_function (void) | |
6029 | { | |
6030 | #if (defined(INVOKE__main) \ | |
6031 | || (!defined(HAS_INIT_SECTION) \ | |
6032 | && !defined(INIT_SECTION_ASM_OP) \ | |
6033 | && !defined(INIT_ARRAY_SECTION_ASM_OP))) | |
6034 | emit_library_call (init_one_libfunc (NAME__MAIN), LCT_NORMAL, VOIDmode, 0); | |
6035 | #endif | |
6036 | } | |
6037 | \f | |
6038 | ||
6039 | /* Expand code to initialize the stack_protect_guard. This is invoked at | |
6040 | the beginning of a function to be protected. */ | |
6041 | ||
862d0b35 DN |
6042 | static void |
6043 | stack_protect_prologue (void) | |
6044 | { | |
6045 | tree guard_decl = targetm.stack_protect_guard (); | |
6046 | rtx x, y; | |
6047 | ||
6048 | x = expand_normal (crtl->stack_protect_guard); | |
6049 | y = expand_normal (guard_decl); | |
6050 | ||
6051 | /* Allow the target to copy from Y to X without leaking Y into a | |
6052 | register. */ | |
c65aa042 RS |
6053 | if (targetm.have_stack_protect_set ()) |
6054 | if (rtx_insn *insn = targetm.gen_stack_protect_set (x, y)) | |
6055 | { | |
6056 | emit_insn (insn); | |
6057 | return; | |
6058 | } | |
862d0b35 DN |
6059 | |
6060 | /* Otherwise do a straight move. */ | |
6061 | emit_move_insn (x, y); | |
6062 | } | |
2e3f842f | 6063 | |
242229bb JH |
6064 | /* Translate the intermediate representation contained in the CFG |
6065 | from GIMPLE trees to RTL. | |
6066 | ||
6067 | We do conversion per basic block and preserve/update the tree CFG. | |
6068 | This implies we have to do some magic as the CFG can simultaneously | |
6069 | consist of basic blocks containing RTL and GIMPLE trees. This can | |
61ada8ae | 6070 | confuse the CFG hooks, so be careful to not manipulate CFG during |
242229bb JH |
6071 | the expansion. */ |
6072 | ||
be55bfe6 TS |
6073 | namespace { |
6074 | ||
6075 | const pass_data pass_data_expand = | |
6076 | { | |
6077 | RTL_PASS, /* type */ | |
6078 | "expand", /* name */ | |
6079 | OPTGROUP_NONE, /* optinfo_flags */ | |
be55bfe6 TS |
6080 | TV_EXPAND, /* tv_id */ |
6081 | ( PROP_ssa | PROP_gimple_leh | PROP_cfg | |
6082 | | PROP_gimple_lcx | |
f8e89441 TV |
6083 | | PROP_gimple_lvec |
6084 | | PROP_gimple_lva), /* properties_required */ | |
be55bfe6 TS |
6085 | PROP_rtl, /* properties_provided */ |
6086 | ( PROP_ssa | PROP_trees ), /* properties_destroyed */ | |
3bea341f | 6087 | 0, /* todo_flags_start */ |
be55bfe6 TS |
6088 | 0, /* todo_flags_finish */ |
6089 | }; | |
6090 | ||
6091 | class pass_expand : public rtl_opt_pass | |
6092 | { | |
6093 | public: | |
6094 | pass_expand (gcc::context *ctxt) | |
6095 | : rtl_opt_pass (pass_data_expand, ctxt) | |
6096 | {} | |
6097 | ||
6098 | /* opt_pass methods: */ | |
6099 | virtual unsigned int execute (function *); | |
6100 | ||
6101 | }; // class pass_expand | |
6102 | ||
6103 | unsigned int | |
6104 | pass_expand::execute (function *fun) | |
242229bb JH |
6105 | { |
6106 | basic_block bb, init_block; | |
6107 | sbitmap blocks; | |
0ef90296 ZD |
6108 | edge_iterator ei; |
6109 | edge e; | |
b47aae36 | 6110 | rtx_insn *var_seq, *var_ret_seq; |
4e3825db MM |
6111 | unsigned i; |
6112 | ||
f029db69 | 6113 | timevar_push (TV_OUT_OF_SSA); |
4e3825db | 6114 | rewrite_out_of_ssa (&SA); |
f029db69 | 6115 | timevar_pop (TV_OUT_OF_SSA); |
c302207e | 6116 | SA.partition_to_pseudo = XCNEWVEC (rtx, SA.map->num_partitions); |
242229bb | 6117 | |
dfde35b3 JJ |
6118 | if (MAY_HAVE_DEBUG_STMTS && flag_tree_ter) |
6119 | { | |
6120 | gimple_stmt_iterator gsi; | |
6121 | FOR_EACH_BB_FN (bb, cfun) | |
6122 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
6123 | if (gimple_debug_bind_p (gsi_stmt (gsi))) | |
6124 | avoid_deep_ter_for_debug (gsi_stmt (gsi), 0); | |
6125 | } | |
6126 | ||
be147e84 RG |
6127 | /* Make sure all values used by the optimization passes have sane |
6128 | defaults. */ | |
6129 | reg_renumber = 0; | |
6130 | ||
4586b4ca SB |
6131 | /* Some backends want to know that we are expanding to RTL. */ |
6132 | currently_expanding_to_rtl = 1; | |
cd7d9fd7 RG |
6133 | /* Dominators are not kept up-to-date as we may create new basic-blocks. */ |
6134 | free_dominance_info (CDI_DOMINATORS); | |
4586b4ca | 6135 | |
be55bfe6 | 6136 | rtl_profile_for_bb (ENTRY_BLOCK_PTR_FOR_FN (fun)); |
bf08ebeb | 6137 | |
d5e254e1 IE |
6138 | if (chkp_function_instrumented_p (current_function_decl)) |
6139 | chkp_reset_rtl_bounds (); | |
6140 | ||
5368224f | 6141 | insn_locations_init (); |
fe8a7779 | 6142 | if (!DECL_IS_BUILTIN (current_function_decl)) |
1751ecd6 AH |
6143 | { |
6144 | /* Eventually, all FEs should explicitly set function_start_locus. */ | |
be55bfe6 TS |
6145 | if (LOCATION_LOCUS (fun->function_start_locus) == UNKNOWN_LOCATION) |
6146 | set_curr_insn_location | |
6147 | (DECL_SOURCE_LOCATION (current_function_decl)); | |
1751ecd6 | 6148 | else |
be55bfe6 | 6149 | set_curr_insn_location (fun->function_start_locus); |
1751ecd6 | 6150 | } |
9ff70652 | 6151 | else |
5368224f DC |
6152 | set_curr_insn_location (UNKNOWN_LOCATION); |
6153 | prologue_location = curr_insn_location (); | |
55e092c4 | 6154 | |
2b21299c JJ |
6155 | #ifdef INSN_SCHEDULING |
6156 | init_sched_attrs (); | |
6157 | #endif | |
6158 | ||
55e092c4 JH |
6159 | /* Make sure first insn is a note even if we don't want linenums. |
6160 | This makes sure the first insn will never be deleted. | |
6161 | Also, final expects a note to appear there. */ | |
6162 | emit_note (NOTE_INSN_DELETED); | |
6429e3be | 6163 | |
a1b23b2f UW |
6164 | /* Mark arrays indexed with non-constant indices with TREE_ADDRESSABLE. */ |
6165 | discover_nonconstant_array_refs (); | |
6166 | ||
e41b2a33 | 6167 | targetm.expand_to_rtl_hook (); |
cb91fab0 | 6168 | crtl->stack_alignment_needed = STACK_BOUNDARY; |
2e3f842f | 6169 | crtl->max_used_stack_slot_alignment = STACK_BOUNDARY; |
890b9b96 | 6170 | crtl->stack_alignment_estimated = 0; |
cb91fab0 | 6171 | crtl->preferred_stack_boundary = STACK_BOUNDARY; |
be55bfe6 | 6172 | fun->cfg->max_jumptable_ents = 0; |
cb91fab0 | 6173 | |
ae9fd6b7 JH |
6174 | /* Resovle the function section. Some targets, like ARM EABI rely on knowledge |
6175 | of the function section at exapnsion time to predict distance of calls. */ | |
6176 | resolve_unique_section (current_function_decl, 0, flag_function_sections); | |
6177 | ||
727a31fa | 6178 | /* Expand the variables recorded during gimple lowering. */ |
f029db69 | 6179 | timevar_push (TV_VAR_EXPAND); |
3a42502d RH |
6180 | start_sequence (); |
6181 | ||
f3ddd692 | 6182 | var_ret_seq = expand_used_vars (); |
3a42502d RH |
6183 | |
6184 | var_seq = get_insns (); | |
6185 | end_sequence (); | |
f029db69 | 6186 | timevar_pop (TV_VAR_EXPAND); |
242229bb | 6187 | |
7d69de61 RH |
6188 | /* Honor stack protection warnings. */ |
6189 | if (warn_stack_protect) | |
6190 | { | |
be55bfe6 | 6191 | if (fun->calls_alloca) |
b8698a0f | 6192 | warning (OPT_Wstack_protector, |
3b123595 | 6193 | "stack protector not protecting local variables: " |
be55bfe6 | 6194 | "variable length buffer"); |
cb91fab0 | 6195 | if (has_short_buffer && !crtl->stack_protect_guard) |
b8698a0f | 6196 | warning (OPT_Wstack_protector, |
3b123595 | 6197 | "stack protector not protecting function: " |
be55bfe6 | 6198 | "all local arrays are less than %d bytes long", |
7d69de61 RH |
6199 | (int) PARAM_VALUE (PARAM_SSP_BUFFER_SIZE)); |
6200 | } | |
6201 | ||
242229bb | 6202 | /* Set up parameters and prepare for return, for the function. */ |
b79c5284 | 6203 | expand_function_start (current_function_decl); |
242229bb | 6204 | |
3a42502d RH |
6205 | /* If we emitted any instructions for setting up the variables, |
6206 | emit them before the FUNCTION_START note. */ | |
6207 | if (var_seq) | |
6208 | { | |
6209 | emit_insn_before (var_seq, parm_birth_insn); | |
6210 | ||
6211 | /* In expand_function_end we'll insert the alloca save/restore | |
6212 | before parm_birth_insn. We've just insertted an alloca call. | |
6213 | Adjust the pointer to match. */ | |
6214 | parm_birth_insn = var_seq; | |
6215 | } | |
6216 | ||
d466b407 MM |
6217 | /* If we have a class containing differently aligned pointers |
6218 | we need to merge those into the corresponding RTL pointer | |
6219 | alignment. */ | |
6220 | for (i = 1; i < num_ssa_names; i++) | |
6221 | { | |
6222 | tree name = ssa_name (i); | |
6223 | int part; | |
d466b407 MM |
6224 | |
6225 | if (!name | |
d466b407 MM |
6226 | /* We might have generated new SSA names in |
6227 | update_alias_info_with_stack_vars. They will have a NULL | |
6228 | defining statements, and won't be part of the partitioning, | |
6229 | so ignore those. */ | |
6230 | || !SSA_NAME_DEF_STMT (name)) | |
6231 | continue; | |
6232 | part = var_to_partition (SA.map, name); | |
6233 | if (part == NO_PARTITION) | |
6234 | continue; | |
70b5e7dc | 6235 | |
1f9ceff1 AO |
6236 | gcc_assert (SA.partition_to_pseudo[part] |
6237 | || defer_stack_allocation (name, true)); | |
6238 | ||
6239 | /* If this decl was marked as living in multiple places, reset | |
6240 | this now to NULL. */ | |
6241 | tree var = SSA_NAME_VAR (name); | |
6242 | if (var && DECL_RTL_IF_SET (var) == pc_rtx) | |
6243 | SET_DECL_RTL (var, NULL); | |
6244 | /* Check that the pseudos chosen by assign_parms are those of | |
6245 | the corresponding default defs. */ | |
6246 | else if (SSA_NAME_IS_DEFAULT_DEF (name) | |
6247 | && (TREE_CODE (var) == PARM_DECL | |
6248 | || TREE_CODE (var) == RESULT_DECL)) | |
70b5e7dc | 6249 | { |
1f9ceff1 AO |
6250 | rtx in = DECL_RTL_IF_SET (var); |
6251 | gcc_assert (in); | |
6252 | rtx out = SA.partition_to_pseudo[part]; | |
6253 | gcc_assert (in == out || rtx_equal_p (in, out)); | |
70b5e7dc | 6254 | } |
d466b407 MM |
6255 | } |
6256 | ||
242229bb JH |
6257 | /* If this function is `main', emit a call to `__main' |
6258 | to run global initializers, etc. */ | |
6259 | if (DECL_NAME (current_function_decl) | |
6260 | && MAIN_NAME_P (DECL_NAME (current_function_decl)) | |
6261 | && DECL_FILE_SCOPE_P (current_function_decl)) | |
6262 | expand_main_function (); | |
6263 | ||
7d69de61 RH |
6264 | /* Initialize the stack_protect_guard field. This must happen after the |
6265 | call to __main (if any) so that the external decl is initialized. */ | |
cb91fab0 | 6266 | if (crtl->stack_protect_guard) |
7d69de61 RH |
6267 | stack_protect_prologue (); |
6268 | ||
4e3825db MM |
6269 | expand_phi_nodes (&SA); |
6270 | ||
3fbd86b1 | 6271 | /* Register rtl specific functions for cfg. */ |
242229bb JH |
6272 | rtl_register_cfg_hooks (); |
6273 | ||
6274 | init_block = construct_init_block (); | |
6275 | ||
0ef90296 | 6276 | /* Clear EDGE_EXECUTABLE on the entry edge(s). It is cleaned from the |
4e3825db | 6277 | remaining edges later. */ |
be55bfe6 | 6278 | FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (fun)->succs) |
0ef90296 ZD |
6279 | e->flags &= ~EDGE_EXECUTABLE; |
6280 | ||
134aa83c | 6281 | lab_rtx_for_bb = new hash_map<basic_block, rtx_code_label *>; |
be55bfe6 | 6282 | FOR_BB_BETWEEN (bb, init_block->next_bb, EXIT_BLOCK_PTR_FOR_FN (fun), |
fefa31b5 | 6283 | next_bb) |
f3ddd692 | 6284 | bb = expand_gimple_basic_block (bb, var_ret_seq != NULL_RTX); |
bf08ebeb | 6285 | |
b5b8b0ac AO |
6286 | if (MAY_HAVE_DEBUG_INSNS) |
6287 | expand_debug_locations (); | |
6288 | ||
dfde35b3 JJ |
6289 | if (deep_ter_debug_map) |
6290 | { | |
6291 | delete deep_ter_debug_map; | |
6292 | deep_ter_debug_map = NULL; | |
6293 | } | |
6294 | ||
452aa9c5 RG |
6295 | /* Free stuff we no longer need after GIMPLE optimizations. */ |
6296 | free_dominance_info (CDI_DOMINATORS); | |
6297 | free_dominance_info (CDI_POST_DOMINATORS); | |
6298 | delete_tree_cfg_annotations (); | |
6299 | ||
f029db69 | 6300 | timevar_push (TV_OUT_OF_SSA); |
4e3825db | 6301 | finish_out_of_ssa (&SA); |
f029db69 | 6302 | timevar_pop (TV_OUT_OF_SSA); |
4e3825db | 6303 | |
f029db69 | 6304 | timevar_push (TV_POST_EXPAND); |
91753e21 | 6305 | /* We are no longer in SSA form. */ |
be55bfe6 | 6306 | fun->gimple_df->in_ssa_p = false; |
726338f4 | 6307 | loops_state_clear (LOOP_CLOSED_SSA); |
91753e21 | 6308 | |
bf08ebeb JH |
6309 | /* Expansion is used by optimization passes too, set maybe_hot_insn_p |
6310 | conservatively to true until they are all profile aware. */ | |
39c8aaa4 | 6311 | delete lab_rtx_for_bb; |
cb91fab0 | 6312 | free_histograms (); |
242229bb JH |
6313 | |
6314 | construct_exit_block (); | |
5368224f | 6315 | insn_locations_finalize (); |
242229bb | 6316 | |
f3ddd692 JJ |
6317 | if (var_ret_seq) |
6318 | { | |
dc01c3d1 | 6319 | rtx_insn *after = return_label; |
b47aae36 | 6320 | rtx_insn *next = NEXT_INSN (after); |
f3ddd692 JJ |
6321 | if (next && NOTE_INSN_BASIC_BLOCK_P (next)) |
6322 | after = next; | |
6323 | emit_insn_after (var_ret_seq, after); | |
6324 | } | |
6325 | ||
1d65f45c | 6326 | /* Zap the tree EH table. */ |
be55bfe6 | 6327 | set_eh_throw_stmt_table (fun, NULL); |
242229bb | 6328 | |
42821aff MM |
6329 | /* We need JUMP_LABEL be set in order to redirect jumps, and hence |
6330 | split edges which edge insertions might do. */ | |
242229bb | 6331 | rebuild_jump_labels (get_insns ()); |
242229bb | 6332 | |
be55bfe6 TS |
6333 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (fun), |
6334 | EXIT_BLOCK_PTR_FOR_FN (fun), next_bb) | |
4e3825db MM |
6335 | { |
6336 | edge e; | |
6337 | edge_iterator ei; | |
6338 | for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) | |
6339 | { | |
6340 | if (e->insns.r) | |
bc470c24 | 6341 | { |
3ffa95c2 | 6342 | rebuild_jump_labels_chain (e->insns.r); |
e40191f1 TV |
6343 | /* Put insns after parm birth, but before |
6344 | NOTE_INSNS_FUNCTION_BEG. */ | |
be55bfe6 TS |
6345 | if (e->src == ENTRY_BLOCK_PTR_FOR_FN (fun) |
6346 | && single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (fun))) | |
bc470c24 | 6347 | { |
3ffa95c2 DM |
6348 | rtx_insn *insns = e->insns.r; |
6349 | e->insns.r = NULL; | |
e40191f1 TV |
6350 | if (NOTE_P (parm_birth_insn) |
6351 | && NOTE_KIND (parm_birth_insn) == NOTE_INSN_FUNCTION_BEG) | |
6352 | emit_insn_before_noloc (insns, parm_birth_insn, e->dest); | |
6353 | else | |
6354 | emit_insn_after_noloc (insns, parm_birth_insn, e->dest); | |
bc470c24 JJ |
6355 | } |
6356 | else | |
6357 | commit_one_edge_insertion (e); | |
6358 | } | |
4e3825db MM |
6359 | else |
6360 | ei_next (&ei); | |
6361 | } | |
6362 | } | |
6363 | ||
6364 | /* We're done expanding trees to RTL. */ | |
6365 | currently_expanding_to_rtl = 0; | |
6366 | ||
be55bfe6 TS |
6367 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (fun)->next_bb, |
6368 | EXIT_BLOCK_PTR_FOR_FN (fun), next_bb) | |
4e3825db MM |
6369 | { |
6370 | edge e; | |
6371 | edge_iterator ei; | |
6372 | for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) | |
6373 | { | |
6374 | /* Clear EDGE_EXECUTABLE. This flag is never used in the backend. */ | |
6375 | e->flags &= ~EDGE_EXECUTABLE; | |
6376 | ||
6377 | /* At the moment not all abnormal edges match the RTL | |
6378 | representation. It is safe to remove them here as | |
6379 | find_many_sub_basic_blocks will rediscover them. | |
6380 | In the future we should get this fixed properly. */ | |
6381 | if ((e->flags & EDGE_ABNORMAL) | |
6382 | && !(e->flags & EDGE_SIBCALL)) | |
6383 | remove_edge (e); | |
6384 | else | |
6385 | ei_next (&ei); | |
6386 | } | |
6387 | } | |
6388 | ||
be55bfe6 | 6389 | blocks = sbitmap_alloc (last_basic_block_for_fn (fun)); |
f61e445a | 6390 | bitmap_ones (blocks); |
242229bb | 6391 | find_many_sub_basic_blocks (blocks); |
242229bb | 6392 | sbitmap_free (blocks); |
4e3825db | 6393 | purge_all_dead_edges (); |
242229bb | 6394 | |
2e3f842f L |
6395 | expand_stack_alignment (); |
6396 | ||
be147e84 RG |
6397 | /* Fixup REG_EQUIV notes in the prologue if there are tailcalls in this |
6398 | function. */ | |
6399 | if (crtl->tail_call_emit) | |
6400 | fixup_tail_calls (); | |
6401 | ||
dac1fbf8 RG |
6402 | /* After initial rtl generation, call back to finish generating |
6403 | exception support code. We need to do this before cleaning up | |
6404 | the CFG as the code does not expect dead landing pads. */ | |
be55bfe6 | 6405 | if (fun->eh->region_tree != NULL) |
dac1fbf8 RG |
6406 | finish_eh_generation (); |
6407 | ||
6408 | /* Remove unreachable blocks, otherwise we cannot compute dominators | |
6409 | which are needed for loop state verification. As a side-effect | |
6410 | this also compacts blocks. | |
6411 | ??? We cannot remove trivially dead insns here as for example | |
6412 | the DRAP reg on i?86 is not magically live at this point. | |
6413 | gcc.c-torture/execute/ipa-sra-2.c execution, -Os -m32 fails otherwise. */ | |
6414 | cleanup_cfg (CLEANUP_NO_INSN_DEL); | |
6415 | ||
242229bb | 6416 | #ifdef ENABLE_CHECKING |
62e5bf5d | 6417 | verify_flow_info (); |
242229bb | 6418 | #endif |
9f8628ba | 6419 | |
be147e84 RG |
6420 | /* Initialize pseudos allocated for hard registers. */ |
6421 | emit_initial_value_sets (); | |
6422 | ||
6423 | /* And finally unshare all RTL. */ | |
6424 | unshare_all_rtl (); | |
6425 | ||
9f8628ba PB |
6426 | /* There's no need to defer outputting this function any more; we |
6427 | know we want to output it. */ | |
6428 | DECL_DEFER_OUTPUT (current_function_decl) = 0; | |
6429 | ||
6430 | /* Now that we're done expanding trees to RTL, we shouldn't have any | |
6431 | more CONCATs anywhere. */ | |
6432 | generating_concat_p = 0; | |
6433 | ||
b7211528 SB |
6434 | if (dump_file) |
6435 | { | |
6436 | fprintf (dump_file, | |
6437 | "\n\n;;\n;; Full RTL generated for this function:\n;;\n"); | |
6438 | /* And the pass manager will dump RTL for us. */ | |
6439 | } | |
ef330312 PB |
6440 | |
6441 | /* If we're emitting a nested function, make sure its parent gets | |
6442 | emitted as well. Doing otherwise confuses debug info. */ | |
be55bfe6 TS |
6443 | { |
6444 | tree parent; | |
6445 | for (parent = DECL_CONTEXT (current_function_decl); | |
6446 | parent != NULL_TREE; | |
6447 | parent = get_containing_scope (parent)) | |
6448 | if (TREE_CODE (parent) == FUNCTION_DECL) | |
6449 | TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (parent)) = 1; | |
6450 | } | |
c22cacf3 | 6451 | |
ef330312 PB |
6452 | /* We are now committed to emitting code for this function. Do any |
6453 | preparation, such as emitting abstract debug info for the inline | |
6454 | before it gets mangled by optimization. */ | |
6455 | if (cgraph_function_possibly_inlined_p (current_function_decl)) | |
6456 | (*debug_hooks->outlining_inline_function) (current_function_decl); | |
6457 | ||
6458 | TREE_ASM_WRITTEN (current_function_decl) = 1; | |
4bb1e037 AP |
6459 | |
6460 | /* After expanding, the return labels are no longer needed. */ | |
6461 | return_label = NULL; | |
6462 | naked_return_label = NULL; | |
0a35513e AH |
6463 | |
6464 | /* After expanding, the tm_restart map is no longer needed. */ | |
be55bfe6 | 6465 | if (fun->gimple_df->tm_restart) |
50979347 | 6466 | fun->gimple_df->tm_restart = NULL; |
0a35513e | 6467 | |
55e092c4 JH |
6468 | /* Tag the blocks with a depth number so that change_scope can find |
6469 | the common parent easily. */ | |
be55bfe6 | 6470 | set_block_levels (DECL_INITIAL (fun->decl), 0); |
bf08ebeb | 6471 | default_rtl_profile (); |
be147e84 | 6472 | |
f029db69 | 6473 | timevar_pop (TV_POST_EXPAND); |
be147e84 | 6474 | |
c2924966 | 6475 | return 0; |
242229bb JH |
6476 | } |
6477 | ||
27a4cd48 DM |
6478 | } // anon namespace |
6479 | ||
6480 | rtl_opt_pass * | |
6481 | make_pass_expand (gcc::context *ctxt) | |
6482 | { | |
6483 | return new pass_expand (ctxt); | |
6484 | } |