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