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