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