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