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