]>
Commit | Line | Data |
---|---|---|
0ec80471 | 1 | /* A pass for lowering trees to RTL. |
3aea1f79 | 2 | Copyright (C) 2004-2014 Free Software Foundation, Inc. |
0ec80471 | 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 | |
8c4c00c1 | 8 | the Free Software Foundation; either version 3, or (at your option) |
0ec80471 | 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 | |
8c4c00c1 | 17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
0ec80471 | 19 | |
20 | #include "config.h" | |
21 | #include "system.h" | |
22 | #include "coretypes.h" | |
23 | #include "tm.h" | |
0ec80471 | 24 | #include "rtl.h" |
0e80b01d | 25 | #include "hard-reg-set.h" |
26 | #include "tree.h" | |
9ed99284 | 27 | #include "stringpool.h" |
28 | #include "varasm.h" | |
29 | #include "stor-layout.h" | |
30 | #include "stmt.h" | |
31 | #include "print-tree.h" | |
0ec80471 | 32 | #include "tm_p.h" |
94ea8568 | 33 | #include "predict.h" |
34 | #include "vec.h" | |
a3020f2f | 35 | #include "hashtab.h" |
36 | #include "hash-set.h" | |
a3020f2f | 37 | #include "machmode.h" |
38 | #include "input.h" | |
0ec80471 | 39 | #include "function.h" |
94ea8568 | 40 | #include "dominance.h" |
41 | #include "cfg.h" | |
42 | #include "cfgrtl.h" | |
43 | #include "cfganal.h" | |
44 | #include "cfgbuild.h" | |
45 | #include "cfgcleanup.h" | |
46 | #include "basic-block.h" | |
34517c64 | 47 | #include "insn-codes.h" |
48 | #include "optabs.h" | |
0ec80471 | 49 | #include "expr.h" |
50 | #include "langhooks.h" | |
073c1fd5 | 51 | #include "bitmap.h" |
bc61cadb | 52 | #include "tree-ssa-alias.h" |
53 | #include "internal-fn.h" | |
54 | #include "tree-eh.h" | |
55 | #include "gimple-expr.h" | |
56 | #include "is-a.h" | |
073c1fd5 | 57 | #include "gimple.h" |
dcf1a1ec | 58 | #include "gimple-iterator.h" |
59 | #include "gimple-walk.h" | |
073c1fd5 | 60 | #include "gimple-ssa.h" |
1140c305 | 61 | #include "hash-map.h" |
62 | #include "plugin-api.h" | |
63 | #include "ipa-ref.h" | |
073c1fd5 | 64 | #include "cgraph.h" |
65 | #include "tree-cfg.h" | |
66 | #include "tree-phinodes.h" | |
67 | #include "ssa-iterators.h" | |
68 | #include "tree-ssanames.h" | |
69 | #include "tree-dfa.h" | |
69ee5dbb | 70 | #include "tree-ssa.h" |
0ec80471 | 71 | #include "tree-pass.h" |
72 | #include "except.h" | |
73 | #include "flags.h" | |
60d03123 | 74 | #include "diagnostic.h" |
ce084dfc | 75 | #include "gimple-pretty-print.h" |
60d03123 | 76 | #include "toplev.h" |
77fce4cd | 77 | #include "debug.h" |
f1a0edff | 78 | #include "params.h" |
5a02d67b | 79 | #include "tree-inline.h" |
4992f399 | 80 | #include "value-prof.h" |
bc5e6ea1 | 81 | #include "target.h" |
b23fb4cb | 82 | #include "tree-ssa-live.h" |
f7373a91 | 83 | #include "tree-outof-ssa.h" |
0f71a633 | 84 | #include "sbitmap.h" |
79f958cb | 85 | #include "cfgloop.h" |
212dddd3 | 86 | #include "regs.h" /* For reg_renumber. */ |
fdc86f97 | 87 | #include "insn-attr.h" /* For INSN_SCHEDULING. */ |
3c919612 | 88 | #include "asan.h" |
424a4a92 | 89 | #include "tree-ssa-address.h" |
0e80b01d | 90 | #include "recog.h" |
91 | #include "output.h" | |
f7715905 | 92 | #include "builtins.h" |
058a1b7a | 93 | #include "tree-chkp.h" |
94 | #include "rtl-chkp.h" | |
75a70cf9 | 95 | |
d3211b7e | 96 | /* Some systems use __main in a way incompatible with its use in gcc, in these |
97 | cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to | |
98 | give the same symbol without quotes for an alternative entry point. You | |
99 | must define both, or neither. */ | |
100 | #ifndef NAME__MAIN | |
101 | #define NAME__MAIN "__main" | |
102 | #endif | |
103 | ||
a8dd994c | 104 | /* This variable holds information helping the rewriting of SSA trees |
105 | into RTL. */ | |
106 | struct ssaexpand SA; | |
107 | ||
8cee8dc0 | 108 | /* This variable holds the currently expanded gimple statement for purposes |
109 | of comminucating the profile info to the builtin expanders. */ | |
110 | gimple currently_expanding_gimple_stmt; | |
111 | ||
841424cc | 112 | static rtx expand_debug_expr (tree); |
113 | ||
75a70cf9 | 114 | /* Return an expression tree corresponding to the RHS of GIMPLE |
115 | statement STMT. */ | |
116 | ||
117 | tree | |
118 | gimple_assign_rhs_to_tree (gimple stmt) | |
119 | { | |
120 | tree t; | |
f4e36c33 | 121 | enum gimple_rhs_class grhs_class; |
48e1416a | 122 | |
f4e36c33 | 123 | grhs_class = get_gimple_rhs_class (gimple_expr_code (stmt)); |
75a70cf9 | 124 | |
00f4f705 | 125 | if (grhs_class == GIMPLE_TERNARY_RHS) |
126 | t = build3 (gimple_assign_rhs_code (stmt), | |
127 | TREE_TYPE (gimple_assign_lhs (stmt)), | |
128 | gimple_assign_rhs1 (stmt), | |
129 | gimple_assign_rhs2 (stmt), | |
130 | gimple_assign_rhs3 (stmt)); | |
131 | else if (grhs_class == GIMPLE_BINARY_RHS) | |
75a70cf9 | 132 | t = build2 (gimple_assign_rhs_code (stmt), |
133 | TREE_TYPE (gimple_assign_lhs (stmt)), | |
134 | gimple_assign_rhs1 (stmt), | |
135 | gimple_assign_rhs2 (stmt)); | |
f4e36c33 | 136 | else if (grhs_class == GIMPLE_UNARY_RHS) |
75a70cf9 | 137 | t = build1 (gimple_assign_rhs_code (stmt), |
138 | TREE_TYPE (gimple_assign_lhs (stmt)), | |
139 | gimple_assign_rhs1 (stmt)); | |
f4e36c33 | 140 | else if (grhs_class == GIMPLE_SINGLE_RHS) |
9845d120 | 141 | { |
142 | t = gimple_assign_rhs1 (stmt); | |
143 | /* Avoid modifying this tree in place below. */ | |
dfecf957 | 144 | if ((gimple_has_location (stmt) && CAN_HAVE_LOCATION_P (t) |
145 | && gimple_location (stmt) != EXPR_LOCATION (t)) | |
146 | || (gimple_block (stmt) | |
147 | && currently_expanding_to_rtl | |
5169661d | 148 | && EXPR_P (t))) |
9845d120 | 149 | t = copy_node (t); |
150 | } | |
75a70cf9 | 151 | else |
152 | gcc_unreachable (); | |
153 | ||
efbcb6de | 154 | if (gimple_has_location (stmt) && CAN_HAVE_LOCATION_P (t)) |
155 | SET_EXPR_LOCATION (t, gimple_location (stmt)); | |
156 | ||
75a70cf9 | 157 | return t; |
158 | } | |
159 | ||
75a70cf9 | 160 | |
60d03123 | 161 | #ifndef STACK_ALIGNMENT_NEEDED |
162 | #define STACK_ALIGNMENT_NEEDED 1 | |
163 | #endif | |
164 | ||
a8dd994c | 165 | #define SSAVAR(x) (TREE_CODE (x) == SSA_NAME ? SSA_NAME_VAR (x) : x) |
166 | ||
167 | /* Associate declaration T with storage space X. If T is no | |
168 | SSA name this is exactly SET_DECL_RTL, otherwise make the | |
169 | partition of T associated with X. */ | |
170 | static inline void | |
171 | set_rtl (tree t, rtx x) | |
172 | { | |
173 | if (TREE_CODE (t) == SSA_NAME) | |
174 | { | |
175 | SA.partition_to_pseudo[var_to_partition (SA.map, t)] = x; | |
176 | if (x && !MEM_P (x)) | |
177 | set_reg_attrs_for_decl_rtl (SSA_NAME_VAR (t), x); | |
e32b531f | 178 | /* For the benefit of debug information at -O0 (where vartracking |
179 | doesn't run) record the place also in the base DECL if it's | |
180 | a normal variable (not a parameter). */ | |
181 | if (x && x != pc_rtx && TREE_CODE (SSA_NAME_VAR (t)) == VAR_DECL) | |
182 | { | |
183 | tree var = SSA_NAME_VAR (t); | |
184 | /* If we don't yet have something recorded, just record it now. */ | |
185 | if (!DECL_RTL_SET_P (var)) | |
186 | SET_DECL_RTL (var, x); | |
3c25489e | 187 | /* If we have it set already to "multiple places" don't |
e32b531f | 188 | change this. */ |
189 | else if (DECL_RTL (var) == pc_rtx) | |
190 | ; | |
191 | /* If we have something recorded and it's not the same place | |
192 | as we want to record now, we have multiple partitions for the | |
193 | same base variable, with different places. We can't just | |
194 | randomly chose one, hence we have to say that we don't know. | |
195 | This only happens with optimization, and there var-tracking | |
196 | will figure out the right thing. */ | |
197 | else if (DECL_RTL (var) != x) | |
198 | SET_DECL_RTL (var, pc_rtx); | |
199 | } | |
a8dd994c | 200 | } |
201 | else | |
202 | SET_DECL_RTL (t, x); | |
203 | } | |
60d03123 | 204 | |
205 | /* This structure holds data relevant to one variable that will be | |
206 | placed in a stack slot. */ | |
207 | struct stack_var | |
208 | { | |
209 | /* The Variable. */ | |
210 | tree decl; | |
211 | ||
60d03123 | 212 | /* Initially, the size of the variable. Later, the size of the partition, |
213 | if this variable becomes it's partition's representative. */ | |
214 | HOST_WIDE_INT size; | |
215 | ||
216 | /* The *byte* alignment required for this variable. Or as, with the | |
217 | size, the alignment for this partition. */ | |
218 | unsigned int alignb; | |
219 | ||
220 | /* The partition representative. */ | |
221 | size_t representative; | |
222 | ||
223 | /* The next stack variable in the partition, or EOC. */ | |
224 | size_t next; | |
dfa054ff | 225 | |
226 | /* The numbers of conflicting stack variables. */ | |
227 | bitmap conflicts; | |
60d03123 | 228 | }; |
229 | ||
230 | #define EOC ((size_t)-1) | |
231 | ||
232 | /* We have an array of such objects while deciding allocation. */ | |
233 | static struct stack_var *stack_vars; | |
234 | static size_t stack_vars_alloc; | |
235 | static size_t stack_vars_num; | |
5f8841a5 | 236 | static hash_map<tree, size_t> *decl_to_stack_part; |
60d03123 | 237 | |
4fb07d00 | 238 | /* Conflict bitmaps go on this obstack. This allows us to destroy |
239 | all of them in one big sweep. */ | |
240 | static bitmap_obstack stack_var_bitmap_obstack; | |
241 | ||
f0b5f617 | 242 | /* An array of indices such that stack_vars[stack_vars_sorted[i]].size |
60d03123 | 243 | is non-decreasing. */ |
244 | static size_t *stack_vars_sorted; | |
245 | ||
60d03123 | 246 | /* The phase of the stack frame. This is the known misalignment of |
247 | virtual_stack_vars_rtx from PREFERRED_STACK_BOUNDARY. That is, | |
248 | (frame_offset+frame_phase) % PREFERRED_STACK_BOUNDARY == 0. */ | |
249 | static int frame_phase; | |
250 | ||
f1a0edff | 251 | /* Used during expand_used_vars to remember if we saw any decls for |
252 | which we'd like to enable stack smashing protection. */ | |
253 | static bool has_protected_decls; | |
254 | ||
255 | /* Used during expand_used_vars. Remember if we say a character buffer | |
256 | smaller than our cutoff threshold. Used for -Wstack-protector. */ | |
257 | static bool has_short_buffer; | |
60d03123 | 258 | |
25c513b9 | 259 | /* Compute the byte alignment to use for DECL. Ignore alignment |
f64dc32d | 260 | we can't do with expected alignment of the stack boundary. */ |
261 | ||
262 | static unsigned int | |
25c513b9 | 263 | align_local_variable (tree decl) |
f64dc32d | 264 | { |
5be42b39 | 265 | unsigned int align = LOCAL_DECL_ALIGNMENT (decl); |
25c513b9 | 266 | DECL_ALIGN (decl) = align; |
60d03123 | 267 | return align / BITS_PER_UNIT; |
268 | } | |
269 | ||
270 | /* Allocate SIZE bytes at byte alignment ALIGN from the stack frame. | |
271 | Return the frame offset. */ | |
272 | ||
273 | static HOST_WIDE_INT | |
5be42b39 | 274 | alloc_stack_frame_space (HOST_WIDE_INT size, unsigned HOST_WIDE_INT align) |
60d03123 | 275 | { |
276 | HOST_WIDE_INT offset, new_frame_offset; | |
277 | ||
278 | new_frame_offset = frame_offset; | |
279 | if (FRAME_GROWS_DOWNWARD) | |
280 | { | |
281 | new_frame_offset -= size + frame_phase; | |
282 | new_frame_offset &= -align; | |
283 | new_frame_offset += frame_phase; | |
284 | offset = new_frame_offset; | |
285 | } | |
286 | else | |
287 | { | |
288 | new_frame_offset -= frame_phase; | |
289 | new_frame_offset += align - 1; | |
290 | new_frame_offset &= -align; | |
291 | new_frame_offset += frame_phase; | |
292 | offset = new_frame_offset; | |
293 | new_frame_offset += size; | |
294 | } | |
295 | frame_offset = new_frame_offset; | |
296 | ||
26d04e5f | 297 | if (frame_offset_overflow (frame_offset, cfun->decl)) |
298 | frame_offset = offset = 0; | |
299 | ||
60d03123 | 300 | return offset; |
301 | } | |
302 | ||
303 | /* Accumulate DECL into STACK_VARS. */ | |
304 | ||
305 | static void | |
306 | add_stack_var (tree decl) | |
307 | { | |
e67bda38 | 308 | struct stack_var *v; |
309 | ||
60d03123 | 310 | if (stack_vars_num >= stack_vars_alloc) |
311 | { | |
312 | if (stack_vars_alloc) | |
313 | stack_vars_alloc = stack_vars_alloc * 3 / 2; | |
314 | else | |
315 | stack_vars_alloc = 32; | |
316 | stack_vars | |
317 | = XRESIZEVEC (struct stack_var, stack_vars, stack_vars_alloc); | |
318 | } | |
3c25489e | 319 | if (!decl_to_stack_part) |
5f8841a5 | 320 | decl_to_stack_part = new hash_map<tree, size_t>; |
3c25489e | 321 | |
e67bda38 | 322 | v = &stack_vars[stack_vars_num]; |
5f8841a5 | 323 | decl_to_stack_part->put (decl, stack_vars_num); |
e67bda38 | 324 | |
325 | v->decl = decl; | |
6a0712d4 | 326 | v->size = tree_to_uhwi (DECL_SIZE_UNIT (SSAVAR (decl))); |
e67bda38 | 327 | /* Ensure that all variables have size, so that &a != &b for any two |
328 | variables that are simultaneously live. */ | |
329 | if (v->size == 0) | |
330 | v->size = 1; | |
25c513b9 | 331 | v->alignb = align_local_variable (SSAVAR (decl)); |
0a4cd568 | 332 | /* An alignment of zero can mightily confuse us later. */ |
333 | gcc_assert (v->alignb != 0); | |
60d03123 | 334 | |
335 | /* All variables are initially in their own partition. */ | |
e67bda38 | 336 | v->representative = stack_vars_num; |
337 | v->next = EOC; | |
60d03123 | 338 | |
dfa054ff | 339 | /* All variables initially conflict with no other. */ |
e67bda38 | 340 | v->conflicts = NULL; |
dfa054ff | 341 | |
60d03123 | 342 | /* Ensure that this decl doesn't get put onto the list twice. */ |
a8dd994c | 343 | set_rtl (decl, pc_rtx); |
60d03123 | 344 | |
345 | stack_vars_num++; | |
346 | } | |
347 | ||
60d03123 | 348 | /* Make the decls associated with luid's X and Y conflict. */ |
349 | ||
350 | static void | |
351 | add_stack_var_conflict (size_t x, size_t y) | |
352 | { | |
dfa054ff | 353 | struct stack_var *a = &stack_vars[x]; |
354 | struct stack_var *b = &stack_vars[y]; | |
355 | if (!a->conflicts) | |
4fb07d00 | 356 | a->conflicts = BITMAP_ALLOC (&stack_var_bitmap_obstack); |
dfa054ff | 357 | if (!b->conflicts) |
4fb07d00 | 358 | b->conflicts = BITMAP_ALLOC (&stack_var_bitmap_obstack); |
dfa054ff | 359 | bitmap_set_bit (a->conflicts, y); |
360 | bitmap_set_bit (b->conflicts, x); | |
60d03123 | 361 | } |
362 | ||
363 | /* Check whether the decls associated with luid's X and Y conflict. */ | |
364 | ||
365 | static bool | |
366 | stack_var_conflict_p (size_t x, size_t y) | |
367 | { | |
dfa054ff | 368 | struct stack_var *a = &stack_vars[x]; |
369 | struct stack_var *b = &stack_vars[y]; | |
3c25489e | 370 | if (x == y) |
371 | return false; | |
372 | /* Partitions containing an SSA name result from gimple registers | |
373 | with things like unsupported modes. They are top-level and | |
374 | hence conflict with everything else. */ | |
375 | if (TREE_CODE (a->decl) == SSA_NAME || TREE_CODE (b->decl) == SSA_NAME) | |
376 | return true; | |
377 | ||
dfa054ff | 378 | if (!a->conflicts || !b->conflicts) |
379 | return false; | |
380 | return bitmap_bit_p (a->conflicts, y); | |
60d03123 | 381 | } |
48e1416a | 382 | |
3c25489e | 383 | /* Callback for walk_stmt_ops. If OP is a decl touched by add_stack_var |
384 | enter its partition number into bitmap DATA. */ | |
385 | ||
386 | static bool | |
5b26a9e3 | 387 | visit_op (gimple, tree op, tree, void *data) |
3c25489e | 388 | { |
389 | bitmap active = (bitmap)data; | |
390 | op = get_base_address (op); | |
391 | if (op | |
392 | && DECL_P (op) | |
393 | && DECL_RTL_IF_SET (op) == pc_rtx) | |
394 | { | |
5f8841a5 | 395 | size_t *v = decl_to_stack_part->get (op); |
3c25489e | 396 | if (v) |
397 | bitmap_set_bit (active, *v); | |
398 | } | |
399 | return false; | |
400 | } | |
401 | ||
402 | /* Callback for walk_stmt_ops. If OP is a decl touched by add_stack_var | |
403 | record conflicts between it and all currently active other partitions | |
404 | from bitmap DATA. */ | |
405 | ||
406 | static bool | |
5b26a9e3 | 407 | visit_conflict (gimple, tree op, tree, void *data) |
3c25489e | 408 | { |
409 | bitmap active = (bitmap)data; | |
410 | op = get_base_address (op); | |
411 | if (op | |
412 | && DECL_P (op) | |
413 | && DECL_RTL_IF_SET (op) == pc_rtx) | |
414 | { | |
5f8841a5 | 415 | size_t *v = decl_to_stack_part->get (op); |
3c25489e | 416 | if (v && bitmap_set_bit (active, *v)) |
417 | { | |
418 | size_t num = *v; | |
419 | bitmap_iterator bi; | |
420 | unsigned i; | |
421 | gcc_assert (num < stack_vars_num); | |
422 | EXECUTE_IF_SET_IN_BITMAP (active, 0, i, bi) | |
423 | add_stack_var_conflict (num, i); | |
424 | } | |
425 | } | |
426 | return false; | |
427 | } | |
428 | ||
429 | /* Helper routine for add_scope_conflicts, calculating the active partitions | |
430 | at the end of BB, leaving the result in WORK. We're called to generate | |
b74338cf | 431 | conflicts when FOR_CONFLICT is true, otherwise we're just tracking |
432 | liveness. */ | |
3c25489e | 433 | |
434 | static void | |
b74338cf | 435 | add_scope_conflicts_1 (basic_block bb, bitmap work, bool for_conflict) |
3c25489e | 436 | { |
437 | edge e; | |
438 | edge_iterator ei; | |
439 | gimple_stmt_iterator gsi; | |
5b26a9e3 | 440 | walk_stmt_load_store_addr_fn visit; |
3c25489e | 441 | |
442 | bitmap_clear (work); | |
443 | FOR_EACH_EDGE (e, ei, bb->preds) | |
444 | bitmap_ior_into (work, (bitmap)e->src->aux); | |
445 | ||
07428872 | 446 | visit = visit_op; |
3c25489e | 447 | |
448 | for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
449 | { | |
450 | gimple stmt = gsi_stmt (gsi); | |
07428872 | 451 | walk_stmt_load_store_addr_ops (stmt, work, NULL, NULL, visit); |
3c25489e | 452 | } |
07428872 | 453 | for (gsi = gsi_after_labels (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
3c25489e | 454 | { |
455 | gimple stmt = gsi_stmt (gsi); | |
456 | ||
457 | if (gimple_clobber_p (stmt)) | |
458 | { | |
459 | tree lhs = gimple_assign_lhs (stmt); | |
460 | size_t *v; | |
461 | /* Nested function lowering might introduce LHSs | |
462 | that are COMPONENT_REFs. */ | |
463 | if (TREE_CODE (lhs) != VAR_DECL) | |
464 | continue; | |
465 | if (DECL_RTL_IF_SET (lhs) == pc_rtx | |
5f8841a5 | 466 | && (v = decl_to_stack_part->get (lhs))) |
3c25489e | 467 | bitmap_clear_bit (work, *v); |
468 | } | |
469 | else if (!is_gimple_debug (stmt)) | |
07428872 | 470 | { |
b74338cf | 471 | if (for_conflict |
07428872 | 472 | && visit == visit_op) |
473 | { | |
474 | /* If this is the first real instruction in this BB we need | |
0b44da0d | 475 | to add conflicts for everything live at this point now. |
476 | Unlike classical liveness for named objects we can't | |
07428872 | 477 | rely on seeing a def/use of the names we're interested in. |
478 | There might merely be indirect loads/stores. We'd not add any | |
b74338cf | 479 | conflicts for such partitions. */ |
07428872 | 480 | bitmap_iterator bi; |
481 | unsigned i; | |
b74338cf | 482 | EXECUTE_IF_SET_IN_BITMAP (work, 0, i, bi) |
07428872 | 483 | { |
99fade12 | 484 | struct stack_var *a = &stack_vars[i]; |
485 | if (!a->conflicts) | |
4fb07d00 | 486 | a->conflicts = BITMAP_ALLOC (&stack_var_bitmap_obstack); |
99fade12 | 487 | bitmap_ior_into (a->conflicts, work); |
07428872 | 488 | } |
489 | visit = visit_conflict; | |
490 | } | |
491 | walk_stmt_load_store_addr_ops (stmt, work, visit, visit, visit); | |
492 | } | |
3c25489e | 493 | } |
494 | } | |
495 | ||
496 | /* Generate stack partition conflicts between all partitions that are | |
497 | simultaneously live. */ | |
498 | ||
499 | static void | |
500 | add_scope_conflicts (void) | |
501 | { | |
502 | basic_block bb; | |
503 | bool changed; | |
504 | bitmap work = BITMAP_ALLOC (NULL); | |
99fade12 | 505 | int *rpo; |
506 | int n_bbs; | |
3c25489e | 507 | |
0b44da0d | 508 | /* We approximate the live range of a stack variable by taking the first |
3c25489e | 509 | mention of its name as starting point(s), and by the end-of-scope |
510 | death clobber added by gimplify as ending point(s) of the range. | |
511 | This overapproximates in the case we for instance moved an address-taken | |
512 | operation upward, without also moving a dereference to it upwards. | |
513 | But it's conservatively correct as a variable never can hold values | |
514 | before its name is mentioned at least once. | |
515 | ||
0b44da0d | 516 | We then do a mostly classical bitmap liveness algorithm. */ |
3c25489e | 517 | |
ed7d889a | 518 | FOR_ALL_BB_FN (bb, cfun) |
4fb07d00 | 519 | bb->aux = BITMAP_ALLOC (&stack_var_bitmap_obstack); |
3c25489e | 520 | |
fe672ac0 | 521 | rpo = XNEWVEC (int, last_basic_block_for_fn (cfun)); |
99fade12 | 522 | n_bbs = pre_and_rev_post_order_compute (NULL, rpo, false); |
523 | ||
3c25489e | 524 | changed = true; |
525 | while (changed) | |
526 | { | |
99fade12 | 527 | int i; |
3c25489e | 528 | changed = false; |
99fade12 | 529 | for (i = 0; i < n_bbs; i++) |
3c25489e | 530 | { |
99fade12 | 531 | bitmap active; |
f5a6b05f | 532 | bb = BASIC_BLOCK_FOR_FN (cfun, rpo[i]); |
99fade12 | 533 | active = (bitmap)bb->aux; |
b74338cf | 534 | add_scope_conflicts_1 (bb, work, false); |
3c25489e | 535 | if (bitmap_ior_into (active, work)) |
536 | changed = true; | |
537 | } | |
538 | } | |
539 | ||
fc00614f | 540 | FOR_EACH_BB_FN (bb, cfun) |
b74338cf | 541 | add_scope_conflicts_1 (bb, work, true); |
3c25489e | 542 | |
99fade12 | 543 | free (rpo); |
3c25489e | 544 | BITMAP_FREE (work); |
ed7d889a | 545 | FOR_ALL_BB_FN (bb, cfun) |
3c25489e | 546 | BITMAP_FREE (bb->aux); |
547 | } | |
548 | ||
60d03123 | 549 | /* A subroutine of partition_stack_vars. A comparison function for qsort, |
5be42b39 | 550 | sorting an array of indices by the properties of the object. */ |
60d03123 | 551 | |
552 | static int | |
5be42b39 | 553 | stack_var_cmp (const void *a, const void *b) |
60d03123 | 554 | { |
5be42b39 | 555 | size_t ia = *(const size_t *)a; |
556 | size_t ib = *(const size_t *)b; | |
557 | unsigned int aligna = stack_vars[ia].alignb; | |
558 | unsigned int alignb = stack_vars[ib].alignb; | |
559 | HOST_WIDE_INT sizea = stack_vars[ia].size; | |
560 | HOST_WIDE_INT sizeb = stack_vars[ib].size; | |
561 | tree decla = stack_vars[ia].decl; | |
562 | tree declb = stack_vars[ib].decl; | |
563 | bool largea, largeb; | |
a8dd994c | 564 | unsigned int uida, uidb; |
60d03123 | 565 | |
5be42b39 | 566 | /* Primary compare on "large" alignment. Large comes first. */ |
567 | largea = (aligna * BITS_PER_UNIT > MAX_SUPPORTED_STACK_ALIGNMENT); | |
568 | largeb = (alignb * BITS_PER_UNIT > MAX_SUPPORTED_STACK_ALIGNMENT); | |
569 | if (largea != largeb) | |
570 | return (int)largeb - (int)largea; | |
571 | ||
572 | /* Secondary compare on size, decreasing */ | |
5be42b39 | 573 | if (sizea > sizeb) |
2a24c3a6 | 574 | return -1; |
575 | if (sizea < sizeb) | |
60d03123 | 576 | return 1; |
5be42b39 | 577 | |
578 | /* Tertiary compare on true alignment, decreasing. */ | |
579 | if (aligna < alignb) | |
580 | return -1; | |
581 | if (aligna > alignb) | |
582 | return 1; | |
583 | ||
584 | /* Final compare on ID for sort stability, increasing. | |
585 | Two SSA names are compared by their version, SSA names come before | |
586 | non-SSA names, and two normal decls are compared by their DECL_UID. */ | |
a8dd994c | 587 | if (TREE_CODE (decla) == SSA_NAME) |
588 | { | |
589 | if (TREE_CODE (declb) == SSA_NAME) | |
590 | uida = SSA_NAME_VERSION (decla), uidb = SSA_NAME_VERSION (declb); | |
591 | else | |
592 | return -1; | |
593 | } | |
594 | else if (TREE_CODE (declb) == SSA_NAME) | |
595 | return 1; | |
596 | else | |
597 | uida = DECL_UID (decla), uidb = DECL_UID (declb); | |
7615883a | 598 | if (uida < uidb) |
7615883a | 599 | return 1; |
5be42b39 | 600 | if (uida > uidb) |
601 | return -1; | |
60d03123 | 602 | return 0; |
603 | } | |
604 | ||
5f8841a5 | 605 | struct part_traits : default_hashmap_traits |
606 | { | |
607 | template<typename T> | |
608 | static bool | |
609 | is_deleted (T &e) | |
610 | { return e.m_value == reinterpret_cast<void *> (1); } | |
611 | ||
612 | template<typename T> static bool is_empty (T &e) { return e.m_value == NULL; } | |
613 | template<typename T> | |
614 | static void | |
615 | mark_deleted (T &e) | |
616 | { e.m_value = reinterpret_cast<T> (1); } | |
617 | ||
618 | template<typename T> | |
619 | static void | |
620 | mark_empty (T &e) | |
621 | { e.m_value = NULL; } | |
622 | }; | |
623 | ||
624 | typedef hash_map<size_t, bitmap, part_traits> part_hashmap; | |
3a443843 | 625 | |
626 | /* If the points-to solution *PI points to variables that are in a partition | |
627 | together with other variables add all partition members to the pointed-to | |
628 | variables bitmap. */ | |
629 | ||
630 | static void | |
631 | add_partitioned_vars_to_ptset (struct pt_solution *pt, | |
5f8841a5 | 632 | part_hashmap *decls_to_partitions, |
431205b7 | 633 | hash_set<bitmap> *visited, bitmap temp) |
3a443843 | 634 | { |
635 | bitmap_iterator bi; | |
636 | unsigned i; | |
637 | bitmap *part; | |
638 | ||
639 | if (pt->anything | |
640 | || pt->vars == NULL | |
641 | /* The pointed-to vars bitmap is shared, it is enough to | |
642 | visit it once. */ | |
431205b7 | 643 | || visited->add (pt->vars)) |
3a443843 | 644 | return; |
645 | ||
646 | bitmap_clear (temp); | |
647 | ||
648 | /* By using a temporary bitmap to store all members of the partitions | |
649 | we have to add we make sure to visit each of the partitions only | |
650 | once. */ | |
651 | EXECUTE_IF_SET_IN_BITMAP (pt->vars, 0, i, bi) | |
652 | if ((!temp | |
653 | || !bitmap_bit_p (temp, i)) | |
5f8841a5 | 654 | && (part = decls_to_partitions->get (i))) |
3a443843 | 655 | bitmap_ior_into (temp, *part); |
656 | if (!bitmap_empty_p (temp)) | |
657 | bitmap_ior_into (pt->vars, temp); | |
658 | } | |
659 | ||
660 | /* Update points-to sets based on partition info, so we can use them on RTL. | |
661 | The bitmaps representing stack partitions will be saved until expand, | |
662 | where partitioned decls used as bases in memory expressions will be | |
663 | rewritten. */ | |
664 | ||
665 | static void | |
666 | update_alias_info_with_stack_vars (void) | |
667 | { | |
5f8841a5 | 668 | part_hashmap *decls_to_partitions = NULL; |
3a443843 | 669 | size_t i, j; |
670 | tree var = NULL_TREE; | |
671 | ||
672 | for (i = 0; i < stack_vars_num; i++) | |
673 | { | |
674 | bitmap part = NULL; | |
675 | tree name; | |
676 | struct ptr_info_def *pi; | |
677 | ||
678 | /* Not interested in partitions with single variable. */ | |
679 | if (stack_vars[i].representative != i | |
680 | || stack_vars[i].next == EOC) | |
681 | continue; | |
682 | ||
683 | if (!decls_to_partitions) | |
684 | { | |
5f8841a5 | 685 | decls_to_partitions = new part_hashmap; |
686 | cfun->gimple_df->decls_to_pointers = new hash_map<tree, tree>; | |
3a443843 | 687 | } |
688 | ||
689 | /* Create an SSA_NAME that points to the partition for use | |
690 | as base during alias-oracle queries on RTL for bases that | |
691 | have been partitioned. */ | |
692 | if (var == NULL_TREE) | |
693 | var = create_tmp_var (ptr_type_node, NULL); | |
694 | name = make_ssa_name (var, NULL); | |
695 | ||
696 | /* Create bitmaps representing partitions. They will be used for | |
697 | points-to sets later, so use GGC alloc. */ | |
698 | part = BITMAP_GGC_ALLOC (); | |
699 | for (j = i; j != EOC; j = stack_vars[j].next) | |
700 | { | |
701 | tree decl = stack_vars[j].decl; | |
1a981e1a | 702 | unsigned int uid = DECL_PT_UID (decl); |
3a443843 | 703 | bitmap_set_bit (part, uid); |
5f8841a5 | 704 | decls_to_partitions->put (uid, part); |
705 | cfun->gimple_df->decls_to_pointers->put (decl, name); | |
f7b5f694 | 706 | if (TREE_ADDRESSABLE (decl)) |
707 | TREE_ADDRESSABLE (name) = 1; | |
3a443843 | 708 | } |
709 | ||
710 | /* Make the SSA name point to all partition members. */ | |
711 | pi = get_ptr_info (name); | |
6fc56905 | 712 | pt_solution_set (&pi->pt, part, false); |
3a443843 | 713 | } |
714 | ||
715 | /* Make all points-to sets that contain one member of a partition | |
716 | contain all members of the partition. */ | |
717 | if (decls_to_partitions) | |
718 | { | |
719 | unsigned i; | |
431205b7 | 720 | hash_set<bitmap> visited; |
4fb07d00 | 721 | bitmap temp = BITMAP_ALLOC (&stack_var_bitmap_obstack); |
3a443843 | 722 | |
723 | for (i = 1; i < num_ssa_names; i++) | |
724 | { | |
725 | tree name = ssa_name (i); | |
726 | struct ptr_info_def *pi; | |
727 | ||
728 | if (name | |
729 | && POINTER_TYPE_P (TREE_TYPE (name)) | |
730 | && ((pi = SSA_NAME_PTR_INFO (name)) != NULL)) | |
731 | add_partitioned_vars_to_ptset (&pi->pt, decls_to_partitions, | |
431205b7 | 732 | &visited, temp); |
3a443843 | 733 | } |
734 | ||
735 | add_partitioned_vars_to_ptset (&cfun->gimple_df->escaped, | |
431205b7 | 736 | decls_to_partitions, &visited, temp); |
3a443843 | 737 | |
5f8841a5 | 738 | delete decls_to_partitions; |
3a443843 | 739 | BITMAP_FREE (temp); |
740 | } | |
741 | } | |
742 | ||
60d03123 | 743 | /* A subroutine of partition_stack_vars. The UNION portion of a UNION/FIND |
744 | partitioning algorithm. Partitions A and B are known to be non-conflicting. | |
2a24c3a6 | 745 | Merge them into a single partition A. */ |
60d03123 | 746 | |
747 | static void | |
2a24c3a6 | 748 | union_stack_vars (size_t a, size_t b) |
60d03123 | 749 | { |
dfa054ff | 750 | struct stack_var *vb = &stack_vars[b]; |
751 | bitmap_iterator bi; | |
752 | unsigned u; | |
60d03123 | 753 | |
2a24c3a6 | 754 | gcc_assert (stack_vars[b].next == EOC); |
755 | /* Add B to A's partition. */ | |
756 | stack_vars[b].next = stack_vars[a].next; | |
757 | stack_vars[b].representative = a; | |
60d03123 | 758 | stack_vars[a].next = b; |
759 | ||
760 | /* Update the required alignment of partition A to account for B. */ | |
761 | if (stack_vars[a].alignb < stack_vars[b].alignb) | |
762 | stack_vars[a].alignb = stack_vars[b].alignb; | |
763 | ||
764 | /* Update the interference graph and merge the conflicts. */ | |
dfa054ff | 765 | if (vb->conflicts) |
766 | { | |
767 | EXECUTE_IF_SET_IN_BITMAP (vb->conflicts, 0, u, bi) | |
768 | add_stack_var_conflict (a, stack_vars[u].representative); | |
769 | BITMAP_FREE (vb->conflicts); | |
770 | } | |
60d03123 | 771 | } |
772 | ||
773 | /* A subroutine of expand_used_vars. Binpack the variables into | |
774 | partitions constrained by the interference graph. The overall | |
775 | algorithm used is as follows: | |
776 | ||
2a24c3a6 | 777 | Sort the objects by size in descending order. |
60d03123 | 778 | For each object A { |
779 | S = size(A) | |
780 | O = 0 | |
781 | loop { | |
782 | Look for the largest non-conflicting object B with size <= S. | |
783 | UNION (A, B) | |
60d03123 | 784 | } |
785 | } | |
786 | */ | |
787 | ||
788 | static void | |
789 | partition_stack_vars (void) | |
790 | { | |
791 | size_t si, sj, n = stack_vars_num; | |
792 | ||
793 | stack_vars_sorted = XNEWVEC (size_t, stack_vars_num); | |
794 | for (si = 0; si < n; ++si) | |
795 | stack_vars_sorted[si] = si; | |
796 | ||
797 | if (n == 1) | |
798 | return; | |
799 | ||
5be42b39 | 800 | qsort (stack_vars_sorted, n, sizeof (size_t), stack_var_cmp); |
60d03123 | 801 | |
60d03123 | 802 | for (si = 0; si < n; ++si) |
803 | { | |
804 | size_t i = stack_vars_sorted[si]; | |
5be42b39 | 805 | unsigned int ialign = stack_vars[i].alignb; |
3c919612 | 806 | HOST_WIDE_INT isize = stack_vars[i].size; |
60d03123 | 807 | |
2a24c3a6 | 808 | /* Ignore objects that aren't partition representatives. If we |
809 | see a var that is not a partition representative, it must | |
810 | have been merged earlier. */ | |
811 | if (stack_vars[i].representative != i) | |
812 | continue; | |
813 | ||
814 | for (sj = si + 1; sj < n; ++sj) | |
60d03123 | 815 | { |
816 | size_t j = stack_vars_sorted[sj]; | |
60d03123 | 817 | unsigned int jalign = stack_vars[j].alignb; |
3c919612 | 818 | HOST_WIDE_INT jsize = stack_vars[j].size; |
60d03123 | 819 | |
820 | /* Ignore objects that aren't partition representatives. */ | |
821 | if (stack_vars[j].representative != j) | |
822 | continue; | |
823 | ||
5be42b39 | 824 | /* Do not mix objects of "small" (supported) alignment |
825 | and "large" (unsupported) alignment. */ | |
826 | if ((ialign * BITS_PER_UNIT <= MAX_SUPPORTED_STACK_ALIGNMENT) | |
827 | != (jalign * BITS_PER_UNIT <= MAX_SUPPORTED_STACK_ALIGNMENT)) | |
3c919612 | 828 | break; |
829 | ||
830 | /* For Address Sanitizer do not mix objects with different | |
831 | sizes, as the shorter vars wouldn't be adequately protected. | |
832 | Don't do that for "large" (unsupported) alignment objects, | |
833 | those aren't protected anyway. */ | |
bf2b7c22 | 834 | if ((flag_sanitize & SANITIZE_ADDRESS) && ASAN_STACK && isize != jsize |
3c919612 | 835 | && ialign * BITS_PER_UNIT <= MAX_SUPPORTED_STACK_ALIGNMENT) |
836 | break; | |
837 | ||
838 | /* Ignore conflicting objects. */ | |
839 | if (stack_var_conflict_p (i, j)) | |
5be42b39 | 840 | continue; |
841 | ||
60d03123 | 842 | /* UNION the objects, placing J at OFFSET. */ |
2a24c3a6 | 843 | union_stack_vars (i, j); |
60d03123 | 844 | } |
845 | } | |
3a443843 | 846 | |
ba487639 | 847 | update_alias_info_with_stack_vars (); |
60d03123 | 848 | } |
849 | ||
850 | /* A debugging aid for expand_used_vars. Dump the generated partitions. */ | |
851 | ||
852 | static void | |
853 | dump_stack_var_partition (void) | |
854 | { | |
855 | size_t si, i, j, n = stack_vars_num; | |
856 | ||
857 | for (si = 0; si < n; ++si) | |
858 | { | |
859 | i = stack_vars_sorted[si]; | |
860 | ||
861 | /* Skip variables that aren't partition representatives, for now. */ | |
862 | if (stack_vars[i].representative != i) | |
863 | continue; | |
864 | ||
865 | fprintf (dump_file, "Partition %lu: size " HOST_WIDE_INT_PRINT_DEC | |
866 | " align %u\n", (unsigned long) i, stack_vars[i].size, | |
867 | stack_vars[i].alignb); | |
868 | ||
869 | for (j = i; j != EOC; j = stack_vars[j].next) | |
870 | { | |
871 | fputc ('\t', dump_file); | |
872 | print_generic_expr (dump_file, stack_vars[j].decl, dump_flags); | |
60d03123 | 873 | } |
2a24c3a6 | 874 | fputc ('\n', dump_file); |
60d03123 | 875 | } |
876 | } | |
877 | ||
5be42b39 | 878 | /* Assign rtl to DECL at BASE + OFFSET. */ |
60d03123 | 879 | |
880 | static void | |
5be42b39 | 881 | expand_one_stack_var_at (tree decl, rtx base, unsigned base_align, |
882 | HOST_WIDE_INT offset) | |
60d03123 | 883 | { |
5be42b39 | 884 | unsigned align; |
60d03123 | 885 | rtx x; |
a0c938f0 | 886 | |
60d03123 | 887 | /* If this fails, we've overflowed the stack frame. Error nicely? */ |
888 | gcc_assert (offset == trunc_int_for_mode (offset, Pmode)); | |
889 | ||
29c05e22 | 890 | x = plus_constant (Pmode, base, offset); |
a8dd994c | 891 | x = gen_rtx_MEM (DECL_MODE (SSAVAR (decl)), x); |
60d03123 | 892 | |
a8dd994c | 893 | if (TREE_CODE (decl) != SSA_NAME) |
894 | { | |
895 | /* Set alignment we actually gave this decl if it isn't an SSA name. | |
896 | If it is we generate stack slots only accidentally so it isn't as | |
897 | important, we'll simply use the alignment that is already set. */ | |
5be42b39 | 898 | if (base == virtual_stack_vars_rtx) |
899 | offset -= frame_phase; | |
a8dd994c | 900 | align = offset & -offset; |
901 | align *= BITS_PER_UNIT; | |
5be42b39 | 902 | if (align == 0 || align > base_align) |
903 | align = base_align; | |
904 | ||
905 | /* One would think that we could assert that we're not decreasing | |
906 | alignment here, but (at least) the i386 port does exactly this | |
907 | via the MINIMUM_ALIGNMENT hook. */ | |
a8dd994c | 908 | |
909 | DECL_ALIGN (decl) = align; | |
910 | DECL_USER_ALIGN (decl) = 0; | |
911 | } | |
912 | ||
913 | set_mem_attributes (x, SSAVAR (decl), true); | |
914 | set_rtl (decl, x); | |
60d03123 | 915 | } |
916 | ||
3c919612 | 917 | struct stack_vars_data |
918 | { | |
919 | /* Vector of offset pairs, always end of some padding followed | |
920 | by start of the padding that needs Address Sanitizer protection. | |
921 | The vector is in reversed, highest offset pairs come first. */ | |
f1f41a6c | 922 | vec<HOST_WIDE_INT> asan_vec; |
3c919612 | 923 | |
924 | /* Vector of partition representative decls in between the paddings. */ | |
f1f41a6c | 925 | vec<tree> asan_decl_vec; |
683539f6 | 926 | |
927 | /* Base pseudo register for Address Sanitizer protected automatic vars. */ | |
928 | rtx asan_base; | |
929 | ||
930 | /* Alignment needed for the Address Sanitizer protected automatic vars. */ | |
931 | unsigned int asan_alignb; | |
3c919612 | 932 | }; |
933 | ||
60d03123 | 934 | /* A subroutine of expand_used_vars. Give each partition representative |
935 | a unique location within the stack frame. Update each partition member | |
936 | with that location. */ | |
937 | ||
938 | static void | |
3c919612 | 939 | expand_stack_vars (bool (*pred) (size_t), struct stack_vars_data *data) |
60d03123 | 940 | { |
941 | size_t si, i, j, n = stack_vars_num; | |
5be42b39 | 942 | HOST_WIDE_INT large_size = 0, large_alloc = 0; |
943 | rtx large_base = NULL; | |
944 | unsigned large_align = 0; | |
945 | tree decl; | |
946 | ||
947 | /* Determine if there are any variables requiring "large" alignment. | |
948 | Since these are dynamically allocated, we only process these if | |
949 | no predicate involved. */ | |
950 | large_align = stack_vars[stack_vars_sorted[0]].alignb * BITS_PER_UNIT; | |
951 | if (pred == NULL && large_align > MAX_SUPPORTED_STACK_ALIGNMENT) | |
952 | { | |
953 | /* Find the total size of these variables. */ | |
954 | for (si = 0; si < n; ++si) | |
955 | { | |
956 | unsigned alignb; | |
957 | ||
958 | i = stack_vars_sorted[si]; | |
959 | alignb = stack_vars[i].alignb; | |
960 | ||
961 | /* Stop when we get to the first decl with "small" alignment. */ | |
962 | if (alignb * BITS_PER_UNIT <= MAX_SUPPORTED_STACK_ALIGNMENT) | |
963 | break; | |
964 | ||
965 | /* Skip variables that aren't partition representatives. */ | |
966 | if (stack_vars[i].representative != i) | |
967 | continue; | |
968 | ||
969 | /* Skip variables that have already had rtl assigned. See also | |
970 | add_stack_var where we perpetrate this pc_rtx hack. */ | |
971 | decl = stack_vars[i].decl; | |
972 | if ((TREE_CODE (decl) == SSA_NAME | |
973 | ? SA.partition_to_pseudo[var_to_partition (SA.map, decl)] | |
974 | : DECL_RTL (decl)) != pc_rtx) | |
975 | continue; | |
976 | ||
977 | large_size += alignb - 1; | |
978 | large_size &= -(HOST_WIDE_INT)alignb; | |
979 | large_size += stack_vars[i].size; | |
980 | } | |
981 | ||
982 | /* If there were any, allocate space. */ | |
983 | if (large_size > 0) | |
984 | large_base = allocate_dynamic_stack_space (GEN_INT (large_size), 0, | |
985 | large_align, true); | |
986 | } | |
60d03123 | 987 | |
988 | for (si = 0; si < n; ++si) | |
989 | { | |
5be42b39 | 990 | rtx base; |
991 | unsigned base_align, alignb; | |
60d03123 | 992 | HOST_WIDE_INT offset; |
993 | ||
994 | i = stack_vars_sorted[si]; | |
995 | ||
996 | /* Skip variables that aren't partition representatives, for now. */ | |
997 | if (stack_vars[i].representative != i) | |
998 | continue; | |
999 | ||
f1a0edff | 1000 | /* Skip variables that have already had rtl assigned. See also |
1001 | add_stack_var where we perpetrate this pc_rtx hack. */ | |
5be42b39 | 1002 | decl = stack_vars[i].decl; |
1003 | if ((TREE_CODE (decl) == SSA_NAME | |
1004 | ? SA.partition_to_pseudo[var_to_partition (SA.map, decl)] | |
1005 | : DECL_RTL (decl)) != pc_rtx) | |
f1a0edff | 1006 | continue; |
1007 | ||
a0c938f0 | 1008 | /* Check the predicate to see whether this variable should be |
f1a0edff | 1009 | allocated in this pass. */ |
3c919612 | 1010 | if (pred && !pred (i)) |
f1a0edff | 1011 | continue; |
1012 | ||
5be42b39 | 1013 | alignb = stack_vars[i].alignb; |
1014 | if (alignb * BITS_PER_UNIT <= MAX_SUPPORTED_STACK_ALIGNMENT) | |
1015 | { | |
683539f6 | 1016 | base = virtual_stack_vars_rtx; |
bf2b7c22 | 1017 | if ((flag_sanitize & SANITIZE_ADDRESS) && ASAN_STACK && pred) |
3c919612 | 1018 | { |
1019 | HOST_WIDE_INT prev_offset = frame_offset; | |
1020 | tree repr_decl = NULL_TREE; | |
1021 | ||
1022 | offset | |
1023 | = alloc_stack_frame_space (stack_vars[i].size | |
1024 | + ASAN_RED_ZONE_SIZE, | |
1025 | MAX (alignb, ASAN_RED_ZONE_SIZE)); | |
f1f41a6c | 1026 | data->asan_vec.safe_push (prev_offset); |
1027 | data->asan_vec.safe_push (offset + stack_vars[i].size); | |
3c919612 | 1028 | /* Find best representative of the partition. |
1029 | Prefer those with DECL_NAME, even better | |
1030 | satisfying asan_protect_stack_decl predicate. */ | |
1031 | for (j = i; j != EOC; j = stack_vars[j].next) | |
1032 | if (asan_protect_stack_decl (stack_vars[j].decl) | |
1033 | && DECL_NAME (stack_vars[j].decl)) | |
1034 | { | |
1035 | repr_decl = stack_vars[j].decl; | |
1036 | break; | |
1037 | } | |
1038 | else if (repr_decl == NULL_TREE | |
1039 | && DECL_P (stack_vars[j].decl) | |
1040 | && DECL_NAME (stack_vars[j].decl)) | |
1041 | repr_decl = stack_vars[j].decl; | |
1042 | if (repr_decl == NULL_TREE) | |
1043 | repr_decl = stack_vars[i].decl; | |
f1f41a6c | 1044 | data->asan_decl_vec.safe_push (repr_decl); |
683539f6 | 1045 | data->asan_alignb = MAX (data->asan_alignb, alignb); |
1046 | if (data->asan_base == NULL) | |
1047 | data->asan_base = gen_reg_rtx (Pmode); | |
1048 | base = data->asan_base; | |
f89175bb | 1049 | |
1050 | if (!STRICT_ALIGNMENT) | |
1051 | base_align = crtl->max_used_stack_slot_alignment; | |
1052 | else | |
1053 | base_align = MAX (crtl->max_used_stack_slot_alignment, | |
1054 | GET_MODE_ALIGNMENT (SImode) | |
1055 | << ASAN_SHADOW_SHIFT); | |
3c919612 | 1056 | } |
1057 | else | |
f89175bb | 1058 | { |
1059 | offset = alloc_stack_frame_space (stack_vars[i].size, alignb); | |
1060 | base_align = crtl->max_used_stack_slot_alignment; | |
1061 | } | |
5be42b39 | 1062 | } |
1063 | else | |
1064 | { | |
1065 | /* Large alignment is only processed in the last pass. */ | |
1066 | if (pred) | |
1067 | continue; | |
e67bda38 | 1068 | gcc_assert (large_base != NULL); |
5be42b39 | 1069 | |
1070 | large_alloc += alignb - 1; | |
1071 | large_alloc &= -(HOST_WIDE_INT)alignb; | |
1072 | offset = large_alloc; | |
1073 | large_alloc += stack_vars[i].size; | |
1074 | ||
1075 | base = large_base; | |
1076 | base_align = large_align; | |
1077 | } | |
60d03123 | 1078 | |
1079 | /* Create rtl for each variable based on their location within the | |
1080 | partition. */ | |
1081 | for (j = i; j != EOC; j = stack_vars[j].next) | |
8394f3a0 | 1082 | { |
8394f3a0 | 1083 | expand_one_stack_var_at (stack_vars[j].decl, |
5be42b39 | 1084 | base, base_align, |
2a24c3a6 | 1085 | offset); |
8394f3a0 | 1086 | } |
60d03123 | 1087 | } |
5be42b39 | 1088 | |
1089 | gcc_assert (large_alloc == large_size); | |
60d03123 | 1090 | } |
1091 | ||
5a02d67b | 1092 | /* Take into account all sizes of partitions and reset DECL_RTLs. */ |
1093 | static HOST_WIDE_INT | |
1094 | account_stack_vars (void) | |
1095 | { | |
1096 | size_t si, j, i, n = stack_vars_num; | |
1097 | HOST_WIDE_INT size = 0; | |
1098 | ||
1099 | for (si = 0; si < n; ++si) | |
1100 | { | |
1101 | i = stack_vars_sorted[si]; | |
1102 | ||
1103 | /* Skip variables that aren't partition representatives, for now. */ | |
1104 | if (stack_vars[i].representative != i) | |
1105 | continue; | |
1106 | ||
1107 | size += stack_vars[i].size; | |
1108 | for (j = i; j != EOC; j = stack_vars[j].next) | |
a8dd994c | 1109 | set_rtl (stack_vars[j].decl, NULL); |
5a02d67b | 1110 | } |
1111 | return size; | |
1112 | } | |
1113 | ||
60d03123 | 1114 | /* A subroutine of expand_one_var. Called to immediately assign rtl |
1115 | to a variable to be allocated in the stack frame. */ | |
1116 | ||
1117 | static void | |
1118 | expand_one_stack_var (tree var) | |
1119 | { | |
5be42b39 | 1120 | HOST_WIDE_INT size, offset; |
1121 | unsigned byte_align; | |
60d03123 | 1122 | |
6a0712d4 | 1123 | size = tree_to_uhwi (DECL_SIZE_UNIT (SSAVAR (var))); |
25c513b9 | 1124 | byte_align = align_local_variable (SSAVAR (var)); |
5be42b39 | 1125 | |
1126 | /* We handle highly aligned variables in expand_stack_vars. */ | |
1127 | gcc_assert (byte_align * BITS_PER_UNIT <= MAX_SUPPORTED_STACK_ALIGNMENT); | |
60d03123 | 1128 | |
5be42b39 | 1129 | offset = alloc_stack_frame_space (size, byte_align); |
1130 | ||
1131 | expand_one_stack_var_at (var, virtual_stack_vars_rtx, | |
1132 | crtl->max_used_stack_slot_alignment, offset); | |
60d03123 | 1133 | } |
1134 | ||
60d03123 | 1135 | /* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL |
1136 | that will reside in a hard register. */ | |
1137 | ||
1138 | static void | |
1139 | expand_one_hard_reg_var (tree var) | |
1140 | { | |
1141 | rest_of_decl_compilation (var, 0, 0); | |
1142 | } | |
1143 | ||
1144 | /* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL | |
1145 | that will reside in a pseudo register. */ | |
1146 | ||
1147 | static void | |
1148 | expand_one_register_var (tree var) | |
1149 | { | |
a8dd994c | 1150 | tree decl = SSAVAR (var); |
1151 | tree type = TREE_TYPE (decl); | |
3754d046 | 1152 | machine_mode reg_mode = promote_decl_mode (decl, NULL); |
60d03123 | 1153 | rtx x = gen_reg_rtx (reg_mode); |
1154 | ||
a8dd994c | 1155 | set_rtl (var, x); |
60d03123 | 1156 | |
1157 | /* Note if the object is a user variable. */ | |
a8dd994c | 1158 | if (!DECL_ARTIFICIAL (decl)) |
1159 | mark_user_reg (x); | |
60d03123 | 1160 | |
9961142a | 1161 | if (POINTER_TYPE_P (type)) |
f2ca19b4 | 1162 | mark_reg_pointer (x, get_pointer_alignment (var)); |
60d03123 | 1163 | } |
1164 | ||
1165 | /* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL that | |
c78cbec8 | 1166 | has some associated error, e.g. its type is error-mark. We just need |
60d03123 | 1167 | to pick something that won't crash the rest of the compiler. */ |
1168 | ||
1169 | static void | |
1170 | expand_one_error_var (tree var) | |
1171 | { | |
3754d046 | 1172 | machine_mode mode = DECL_MODE (var); |
60d03123 | 1173 | rtx x; |
1174 | ||
1175 | if (mode == BLKmode) | |
1176 | x = gen_rtx_MEM (BLKmode, const0_rtx); | |
1177 | else if (mode == VOIDmode) | |
1178 | x = const0_rtx; | |
1179 | else | |
1180 | x = gen_reg_rtx (mode); | |
1181 | ||
1182 | SET_DECL_RTL (var, x); | |
1183 | } | |
1184 | ||
a0c938f0 | 1185 | /* A subroutine of expand_one_var. VAR is a variable that will be |
60d03123 | 1186 | allocated to the local stack frame. Return true if we wish to |
1187 | add VAR to STACK_VARS so that it will be coalesced with other | |
1188 | variables. Return false to allocate VAR immediately. | |
1189 | ||
1190 | This function is used to reduce the number of variables considered | |
1191 | for coalescing, which reduces the size of the quadratic problem. */ | |
1192 | ||
1193 | static bool | |
1194 | defer_stack_allocation (tree var, bool toplevel) | |
1195 | { | |
da4b9ed5 | 1196 | /* Whether the variable is small enough for immediate allocation not to be |
1197 | a problem with regard to the frame size. */ | |
1198 | bool smallish | |
aa59f000 | 1199 | = ((HOST_WIDE_INT) tree_to_uhwi (DECL_SIZE_UNIT (var)) |
da4b9ed5 | 1200 | < PARAM_VALUE (PARAM_MIN_SIZE_FOR_STACK_SHARING)); |
1201 | ||
f1a0edff | 1202 | /* If stack protection is enabled, *all* stack variables must be deferred, |
3c919612 | 1203 | so that we can re-order the strings to the top of the frame. |
1204 | Similarly for Address Sanitizer. */ | |
bf2b7c22 | 1205 | if (flag_stack_protect || ((flag_sanitize & SANITIZE_ADDRESS) && ASAN_STACK)) |
f1a0edff | 1206 | return true; |
1207 | ||
5be42b39 | 1208 | /* We handle "large" alignment via dynamic allocation. We want to handle |
1209 | this extra complication in only one place, so defer them. */ | |
1210 | if (DECL_ALIGN (var) > MAX_SUPPORTED_STACK_ALIGNMENT) | |
1211 | return true; | |
1212 | ||
da4b9ed5 | 1213 | /* When optimization is enabled, DECL_IGNORED_P variables originally scoped |
1214 | might be detached from their block and appear at toplevel when we reach | |
1215 | here. We want to coalesce them with variables from other blocks when | |
1216 | the immediate contribution to the frame size would be noticeable. */ | |
1217 | if (toplevel && optimize > 0 && DECL_IGNORED_P (var) && !smallish) | |
1218 | return true; | |
1219 | ||
1220 | /* Variables declared in the outermost scope automatically conflict | |
1221 | with every other variable. The only reason to want to defer them | |
60d03123 | 1222 | at all is that, after sorting, we can more efficiently pack |
1223 | small variables in the stack frame. Continue to defer at -O2. */ | |
1224 | if (toplevel && optimize < 2) | |
1225 | return false; | |
1226 | ||
1227 | /* Without optimization, *most* variables are allocated from the | |
1228 | stack, which makes the quadratic problem large exactly when we | |
a0c938f0 | 1229 | want compilation to proceed as quickly as possible. On the |
60d03123 | 1230 | other hand, we don't want the function's stack frame size to |
1231 | get completely out of hand. So we avoid adding scalars and | |
1232 | "small" aggregates to the list at all. */ | |
da4b9ed5 | 1233 | if (optimize == 0 && smallish) |
60d03123 | 1234 | return false; |
1235 | ||
1236 | return true; | |
1237 | } | |
1238 | ||
1239 | /* A subroutine of expand_used_vars. Expand one variable according to | |
91275768 | 1240 | its flavor. Variables to be placed on the stack are not actually |
48e1416a | 1241 | expanded yet, merely recorded. |
5a02d67b | 1242 | When REALLY_EXPAND is false, only add stack values to be allocated. |
1243 | Return stack usage this variable is supposed to take. | |
1244 | */ | |
60d03123 | 1245 | |
5a02d67b | 1246 | static HOST_WIDE_INT |
1247 | expand_one_var (tree var, bool toplevel, bool really_expand) | |
60d03123 | 1248 | { |
5be42b39 | 1249 | unsigned int align = BITS_PER_UNIT; |
a8dd994c | 1250 | tree origvar = var; |
5be42b39 | 1251 | |
a8dd994c | 1252 | var = SSAVAR (var); |
1253 | ||
5be42b39 | 1254 | if (TREE_TYPE (var) != error_mark_node && TREE_CODE (var) == VAR_DECL) |
27a7a23a | 1255 | { |
27a7a23a | 1256 | /* Because we don't know if VAR will be in register or on stack, |
1257 | we conservatively assume it will be on stack even if VAR is | |
1258 | eventually put into register after RA pass. For non-automatic | |
1259 | variables, which won't be on stack, we collect alignment of | |
fc1995c6 | 1260 | type and ignore user specified alignment. Similarly for |
1261 | SSA_NAMEs for which use_register_for_decl returns true. */ | |
1262 | if (TREE_STATIC (var) | |
1263 | || DECL_EXTERNAL (var) | |
1264 | || (TREE_CODE (origvar) == SSA_NAME && use_register_for_decl (var))) | |
8645d3e7 | 1265 | align = MINIMUM_ALIGNMENT (TREE_TYPE (var), |
1266 | TYPE_MODE (TREE_TYPE (var)), | |
1267 | TYPE_ALIGN (TREE_TYPE (var))); | |
505a6491 | 1268 | else if (DECL_HAS_VALUE_EXPR_P (var) |
1269 | || (DECL_RTL_SET_P (var) && MEM_P (DECL_RTL (var)))) | |
1270 | /* Don't consider debug only variables with DECL_HAS_VALUE_EXPR_P set | |
1271 | or variables which were assigned a stack slot already by | |
1272 | expand_one_stack_var_at - in the latter case DECL_ALIGN has been | |
1273 | changed from the offset chosen to it. */ | |
1274 | align = crtl->stack_alignment_estimated; | |
27a7a23a | 1275 | else |
8645d3e7 | 1276 | align = MINIMUM_ALIGNMENT (var, DECL_MODE (var), DECL_ALIGN (var)); |
27a7a23a | 1277 | |
5be42b39 | 1278 | /* If the variable alignment is very large we'll dynamicaly allocate |
1279 | it, which means that in-frame portion is just a pointer. */ | |
1280 | if (align > MAX_SUPPORTED_STACK_ALIGNMENT) | |
1281 | align = POINTER_SIZE; | |
1282 | } | |
1283 | ||
1284 | if (SUPPORTS_STACK_ALIGNMENT | |
1285 | && crtl->stack_alignment_estimated < align) | |
1286 | { | |
1287 | /* stack_alignment_estimated shouldn't change after stack | |
1288 | realign decision made */ | |
9af5ce0c | 1289 | gcc_assert (!crtl->stack_realign_processed); |
5be42b39 | 1290 | crtl->stack_alignment_estimated = align; |
27a7a23a | 1291 | } |
1292 | ||
5be42b39 | 1293 | /* stack_alignment_needed > PREFERRED_STACK_BOUNDARY is permitted. |
1294 | So here we only make sure stack_alignment_needed >= align. */ | |
1295 | if (crtl->stack_alignment_needed < align) | |
1296 | crtl->stack_alignment_needed = align; | |
1297 | if (crtl->max_used_stack_slot_alignment < align) | |
1298 | crtl->max_used_stack_slot_alignment = align; | |
1299 | ||
a8dd994c | 1300 | if (TREE_CODE (origvar) == SSA_NAME) |
1301 | { | |
1302 | gcc_assert (TREE_CODE (var) != VAR_DECL | |
1303 | || (!DECL_EXTERNAL (var) | |
1304 | && !DECL_HAS_VALUE_EXPR_P (var) | |
1305 | && !TREE_STATIC (var) | |
a8dd994c | 1306 | && TREE_TYPE (var) != error_mark_node |
1307 | && !DECL_HARD_REGISTER (var) | |
1308 | && really_expand)); | |
1309 | } | |
1310 | if (TREE_CODE (var) != VAR_DECL && TREE_CODE (origvar) != SSA_NAME) | |
1a105fae | 1311 | ; |
60d03123 | 1312 | else if (DECL_EXTERNAL (var)) |
1313 | ; | |
75fa4f82 | 1314 | else if (DECL_HAS_VALUE_EXPR_P (var)) |
60d03123 | 1315 | ; |
1316 | else if (TREE_STATIC (var)) | |
6329636b | 1317 | ; |
e32b531f | 1318 | else if (TREE_CODE (origvar) != SSA_NAME && DECL_RTL_SET_P (var)) |
60d03123 | 1319 | ; |
1320 | else if (TREE_TYPE (var) == error_mark_node) | |
5a02d67b | 1321 | { |
1322 | if (really_expand) | |
1323 | expand_one_error_var (var); | |
1324 | } | |
a8dd994c | 1325 | else if (TREE_CODE (var) == VAR_DECL && DECL_HARD_REGISTER (var)) |
5a02d67b | 1326 | { |
1327 | if (really_expand) | |
2ea8d869 | 1328 | { |
1329 | expand_one_hard_reg_var (var); | |
1330 | if (!DECL_HARD_REGISTER (var)) | |
1331 | /* Invalid register specification. */ | |
1332 | expand_one_error_var (var); | |
1333 | } | |
5a02d67b | 1334 | } |
60d03123 | 1335 | else if (use_register_for_decl (var)) |
5a02d67b | 1336 | { |
1337 | if (really_expand) | |
a8dd994c | 1338 | expand_one_register_var (origvar); |
5a02d67b | 1339 | } |
85d86b55 | 1340 | else if (! valid_constant_size_p (DECL_SIZE_UNIT (var))) |
ce0afe34 | 1341 | { |
85d86b55 | 1342 | /* Reject variables which cover more than half of the address-space. */ |
ce0afe34 | 1343 | if (really_expand) |
1344 | { | |
1345 | error ("size of variable %q+D is too large", var); | |
1346 | expand_one_error_var (var); | |
1347 | } | |
1348 | } | |
60d03123 | 1349 | else if (defer_stack_allocation (var, toplevel)) |
a8dd994c | 1350 | add_stack_var (origvar); |
60d03123 | 1351 | else |
5a02d67b | 1352 | { |
15083ac3 | 1353 | if (really_expand) |
a8dd994c | 1354 | expand_one_stack_var (origvar); |
6a0712d4 | 1355 | return tree_to_uhwi (DECL_SIZE_UNIT (var)); |
5a02d67b | 1356 | } |
1357 | return 0; | |
60d03123 | 1358 | } |
1359 | ||
1360 | /* A subroutine of expand_used_vars. Walk down through the BLOCK tree | |
1361 | expanding variables. Those variables that can be put into registers | |
1362 | are allocated pseudos; those that can't are put on the stack. | |
1363 | ||
1364 | TOPLEVEL is true if this is the outermost BLOCK. */ | |
1365 | ||
1366 | static void | |
1367 | expand_used_vars_for_block (tree block, bool toplevel) | |
1368 | { | |
60d03123 | 1369 | tree t; |
1370 | ||
60d03123 | 1371 | /* Expand all variables at this level. */ |
1767a056 | 1372 | for (t = BLOCK_VARS (block); t ; t = DECL_CHAIN (t)) |
c7c68014 | 1373 | if (TREE_USED (t) |
1374 | && ((TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != RESULT_DECL) | |
1375 | || !DECL_NONSHAREABLE (t))) | |
5a02d67b | 1376 | expand_one_var (t, toplevel, true); |
60d03123 | 1377 | |
60d03123 | 1378 | /* Expand all variables at containing levels. */ |
1379 | for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t)) | |
1380 | expand_used_vars_for_block (t, false); | |
60d03123 | 1381 | } |
1382 | ||
1383 | /* A subroutine of expand_used_vars. Walk down through the BLOCK tree | |
1384 | and clear TREE_USED on all local variables. */ | |
1385 | ||
1386 | static void | |
1387 | clear_tree_used (tree block) | |
1388 | { | |
1389 | tree t; | |
1390 | ||
1767a056 | 1391 | for (t = BLOCK_VARS (block); t ; t = DECL_CHAIN (t)) |
60d03123 | 1392 | /* if (!TREE_STATIC (t) && !DECL_EXTERNAL (t)) */ |
c7c68014 | 1393 | if ((TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != RESULT_DECL) |
1394 | || !DECL_NONSHAREABLE (t)) | |
60d03123 | 1395 | TREE_USED (t) = 0; |
1396 | ||
1397 | for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t)) | |
1398 | clear_tree_used (t); | |
1399 | } | |
1400 | ||
b156ec37 | 1401 | enum { |
1402 | SPCT_FLAG_DEFAULT = 1, | |
1403 | SPCT_FLAG_ALL = 2, | |
1404 | SPCT_FLAG_STRONG = 3 | |
1405 | }; | |
1406 | ||
f1a0edff | 1407 | /* Examine TYPE and determine a bit mask of the following features. */ |
1408 | ||
1409 | #define SPCT_HAS_LARGE_CHAR_ARRAY 1 | |
1410 | #define SPCT_HAS_SMALL_CHAR_ARRAY 2 | |
1411 | #define SPCT_HAS_ARRAY 4 | |
1412 | #define SPCT_HAS_AGGREGATE 8 | |
1413 | ||
1414 | static unsigned int | |
1415 | stack_protect_classify_type (tree type) | |
1416 | { | |
1417 | unsigned int ret = 0; | |
1418 | tree t; | |
1419 | ||
1420 | switch (TREE_CODE (type)) | |
1421 | { | |
1422 | case ARRAY_TYPE: | |
1423 | t = TYPE_MAIN_VARIANT (TREE_TYPE (type)); | |
1424 | if (t == char_type_node | |
1425 | || t == signed_char_type_node | |
1426 | || t == unsigned_char_type_node) | |
1427 | { | |
b888d9d5 | 1428 | unsigned HOST_WIDE_INT max = PARAM_VALUE (PARAM_SSP_BUFFER_SIZE); |
1429 | unsigned HOST_WIDE_INT len; | |
f1a0edff | 1430 | |
b888d9d5 | 1431 | if (!TYPE_SIZE_UNIT (type) |
cd4547bf | 1432 | || !tree_fits_uhwi_p (TYPE_SIZE_UNIT (type))) |
b888d9d5 | 1433 | len = max; |
f1a0edff | 1434 | else |
6a0712d4 | 1435 | len = tree_to_uhwi (TYPE_SIZE_UNIT (type)); |
f1a0edff | 1436 | |
1437 | if (len < max) | |
1438 | ret = SPCT_HAS_SMALL_CHAR_ARRAY | SPCT_HAS_ARRAY; | |
1439 | else | |
1440 | ret = SPCT_HAS_LARGE_CHAR_ARRAY | SPCT_HAS_ARRAY; | |
1441 | } | |
1442 | else | |
1443 | ret = SPCT_HAS_ARRAY; | |
1444 | break; | |
1445 | ||
1446 | case UNION_TYPE: | |
1447 | case QUAL_UNION_TYPE: | |
1448 | case RECORD_TYPE: | |
1449 | ret = SPCT_HAS_AGGREGATE; | |
1450 | for (t = TYPE_FIELDS (type); t ; t = TREE_CHAIN (t)) | |
1451 | if (TREE_CODE (t) == FIELD_DECL) | |
1452 | ret |= stack_protect_classify_type (TREE_TYPE (t)); | |
1453 | break; | |
1454 | ||
1455 | default: | |
1456 | break; | |
1457 | } | |
1458 | ||
1459 | return ret; | |
1460 | } | |
1461 | ||
3ce7ff97 | 1462 | /* Return nonzero if DECL should be segregated into the "vulnerable" upper |
1463 | part of the local stack frame. Remember if we ever return nonzero for | |
f1a0edff | 1464 | any variable in this function. The return value is the phase number in |
1465 | which the variable should be allocated. */ | |
1466 | ||
1467 | static int | |
1468 | stack_protect_decl_phase (tree decl) | |
1469 | { | |
1470 | unsigned int bits = stack_protect_classify_type (TREE_TYPE (decl)); | |
1471 | int ret = 0; | |
1472 | ||
1473 | if (bits & SPCT_HAS_SMALL_CHAR_ARRAY) | |
1474 | has_short_buffer = true; | |
1475 | ||
b156ec37 | 1476 | if (flag_stack_protect == SPCT_FLAG_ALL |
1477 | || flag_stack_protect == SPCT_FLAG_STRONG) | |
f1a0edff | 1478 | { |
1479 | if ((bits & (SPCT_HAS_SMALL_CHAR_ARRAY | SPCT_HAS_LARGE_CHAR_ARRAY)) | |
1480 | && !(bits & SPCT_HAS_AGGREGATE)) | |
1481 | ret = 1; | |
1482 | else if (bits & SPCT_HAS_ARRAY) | |
1483 | ret = 2; | |
1484 | } | |
1485 | else | |
1486 | ret = (bits & SPCT_HAS_LARGE_CHAR_ARRAY) != 0; | |
1487 | ||
1488 | if (ret) | |
1489 | has_protected_decls = true; | |
1490 | ||
1491 | return ret; | |
1492 | } | |
1493 | ||
1494 | /* Two helper routines that check for phase 1 and phase 2. These are used | |
1495 | as callbacks for expand_stack_vars. */ | |
1496 | ||
1497 | static bool | |
3c919612 | 1498 | stack_protect_decl_phase_1 (size_t i) |
1499 | { | |
1500 | return stack_protect_decl_phase (stack_vars[i].decl) == 1; | |
1501 | } | |
1502 | ||
1503 | static bool | |
1504 | stack_protect_decl_phase_2 (size_t i) | |
f1a0edff | 1505 | { |
3c919612 | 1506 | return stack_protect_decl_phase (stack_vars[i].decl) == 2; |
f1a0edff | 1507 | } |
1508 | ||
3c919612 | 1509 | /* And helper function that checks for asan phase (with stack protector |
1510 | it is phase 3). This is used as callback for expand_stack_vars. | |
1511 | Returns true if any of the vars in the partition need to be protected. */ | |
1512 | ||
f1a0edff | 1513 | static bool |
3c919612 | 1514 | asan_decl_phase_3 (size_t i) |
f1a0edff | 1515 | { |
3c919612 | 1516 | while (i != EOC) |
1517 | { | |
1518 | if (asan_protect_stack_decl (stack_vars[i].decl)) | |
1519 | return true; | |
1520 | i = stack_vars[i].next; | |
1521 | } | |
1522 | return false; | |
f1a0edff | 1523 | } |
1524 | ||
1525 | /* Ensure that variables in different stack protection phases conflict | |
1526 | so that they are not merged and share the same stack slot. */ | |
1527 | ||
1528 | static void | |
1529 | add_stack_protection_conflicts (void) | |
1530 | { | |
1531 | size_t i, j, n = stack_vars_num; | |
1532 | unsigned char *phase; | |
1533 | ||
1534 | phase = XNEWVEC (unsigned char, n); | |
1535 | for (i = 0; i < n; ++i) | |
1536 | phase[i] = stack_protect_decl_phase (stack_vars[i].decl); | |
1537 | ||
1538 | for (i = 0; i < n; ++i) | |
1539 | { | |
1540 | unsigned char ph_i = phase[i]; | |
99fade12 | 1541 | for (j = i + 1; j < n; ++j) |
f1a0edff | 1542 | if (ph_i != phase[j]) |
1543 | add_stack_var_conflict (i, j); | |
1544 | } | |
1545 | ||
1546 | XDELETEVEC (phase); | |
1547 | } | |
1548 | ||
1549 | /* Create a decl for the guard at the top of the stack frame. */ | |
1550 | ||
1551 | static void | |
1552 | create_stack_guard (void) | |
1553 | { | |
e60a6f7b | 1554 | tree guard = build_decl (DECL_SOURCE_LOCATION (current_function_decl), |
1555 | VAR_DECL, NULL, ptr_type_node); | |
f1a0edff | 1556 | TREE_THIS_VOLATILE (guard) = 1; |
1557 | TREE_USED (guard) = 1; | |
1558 | expand_one_stack_var (guard); | |
edb7afe8 | 1559 | crtl->stack_protect_guard = guard; |
f1a0edff | 1560 | } |
1561 | ||
5a02d67b | 1562 | /* Prepare for expanding variables. */ |
48e1416a | 1563 | static void |
5a02d67b | 1564 | init_vars_expansion (void) |
1565 | { | |
4fb07d00 | 1566 | /* Conflict bitmaps, and a few related temporary bitmaps, go here. */ |
1567 | bitmap_obstack_initialize (&stack_var_bitmap_obstack); | |
5a02d67b | 1568 | |
4fb07d00 | 1569 | /* A map from decl to stack partition. */ |
5f8841a5 | 1570 | decl_to_stack_part = new hash_map<tree, size_t>; |
5a02d67b | 1571 | |
1572 | /* Initialize local stack smashing state. */ | |
1573 | has_protected_decls = false; | |
1574 | has_short_buffer = false; | |
1575 | } | |
1576 | ||
1577 | /* Free up stack variable graph data. */ | |
1578 | static void | |
1579 | fini_vars_expansion (void) | |
1580 | { | |
4fb07d00 | 1581 | bitmap_obstack_release (&stack_var_bitmap_obstack); |
1582 | if (stack_vars) | |
1583 | XDELETEVEC (stack_vars); | |
1584 | if (stack_vars_sorted) | |
1585 | XDELETEVEC (stack_vars_sorted); | |
5a02d67b | 1586 | stack_vars = NULL; |
99fade12 | 1587 | stack_vars_sorted = NULL; |
5a02d67b | 1588 | stack_vars_alloc = stack_vars_num = 0; |
5f8841a5 | 1589 | delete decl_to_stack_part; |
3c25489e | 1590 | decl_to_stack_part = NULL; |
5a02d67b | 1591 | } |
1592 | ||
970270ba | 1593 | /* Make a fair guess for the size of the stack frame of the function |
1594 | in NODE. This doesn't have to be exact, the result is only used in | |
1595 | the inline heuristics. So we don't want to run the full stack var | |
1596 | packing algorithm (which is quadratic in the number of stack vars). | |
1597 | Instead, we calculate the total size of all stack vars. This turns | |
1598 | out to be a pretty fair estimate -- packing of stack vars doesn't | |
1599 | happen very often. */ | |
961c8f72 | 1600 | |
5a02d67b | 1601 | HOST_WIDE_INT |
970270ba | 1602 | estimated_stack_frame_size (struct cgraph_node *node) |
5a02d67b | 1603 | { |
1604 | HOST_WIDE_INT size = 0; | |
961c8f72 | 1605 | size_t i; |
649597af | 1606 | tree var; |
02774f2d | 1607 | struct function *fn = DECL_STRUCT_FUNCTION (node->decl); |
970270ba | 1608 | |
649597af | 1609 | push_cfun (fn); |
5a02d67b | 1610 | |
4fb07d00 | 1611 | init_vars_expansion (); |
1612 | ||
24ccd9c6 | 1613 | FOR_EACH_LOCAL_DECL (fn, i, var) |
1614 | if (auto_var_in_fn_p (var, fn->decl)) | |
1615 | size += expand_one_var (var, true, false); | |
961c8f72 | 1616 | |
5a02d67b | 1617 | if (stack_vars_num > 0) |
1618 | { | |
961c8f72 | 1619 | /* Fake sorting the stack vars for account_stack_vars (). */ |
1620 | stack_vars_sorted = XNEWVEC (size_t, stack_vars_num); | |
1621 | for (i = 0; i < stack_vars_num; ++i) | |
1622 | stack_vars_sorted[i] = i; | |
5a02d67b | 1623 | size += account_stack_vars (); |
5a02d67b | 1624 | } |
4fb07d00 | 1625 | |
1626 | fini_vars_expansion (); | |
73b46517 | 1627 | pop_cfun (); |
5a02d67b | 1628 | return size; |
1629 | } | |
1630 | ||
b156ec37 | 1631 | /* Helper routine to check if a record or union contains an array field. */ |
1632 | ||
1633 | static int | |
1634 | record_or_union_type_has_array_p (const_tree tree_type) | |
1635 | { | |
1636 | tree fields = TYPE_FIELDS (tree_type); | |
1637 | tree f; | |
1638 | ||
1639 | for (f = fields; f; f = DECL_CHAIN (f)) | |
1640 | if (TREE_CODE (f) == FIELD_DECL) | |
1641 | { | |
1642 | tree field_type = TREE_TYPE (f); | |
1643 | if (RECORD_OR_UNION_TYPE_P (field_type) | |
1644 | && record_or_union_type_has_array_p (field_type)) | |
1645 | return 1; | |
1646 | if (TREE_CODE (field_type) == ARRAY_TYPE) | |
1647 | return 1; | |
1648 | } | |
1649 | return 0; | |
1650 | } | |
1651 | ||
ec4af1be | 1652 | /* Check if the current function has local referenced variables that |
1653 | have their addresses taken, contain an array, or are arrays. */ | |
1654 | ||
1655 | static bool | |
1656 | stack_protect_decl_p () | |
1657 | { | |
1658 | unsigned i; | |
1659 | tree var; | |
1660 | ||
1661 | FOR_EACH_LOCAL_DECL (cfun, i, var) | |
1662 | if (!is_global_var (var)) | |
1663 | { | |
1664 | tree var_type = TREE_TYPE (var); | |
1665 | if (TREE_CODE (var) == VAR_DECL | |
1666 | && (TREE_CODE (var_type) == ARRAY_TYPE | |
1667 | || TREE_ADDRESSABLE (var) | |
1668 | || (RECORD_OR_UNION_TYPE_P (var_type) | |
1669 | && record_or_union_type_has_array_p (var_type)))) | |
1670 | return true; | |
1671 | } | |
1672 | return false; | |
1673 | } | |
1674 | ||
1675 | /* Check if the current function has calls that use a return slot. */ | |
1676 | ||
1677 | static bool | |
1678 | stack_protect_return_slot_p () | |
1679 | { | |
1680 | basic_block bb; | |
1681 | ||
1682 | FOR_ALL_BB_FN (bb, cfun) | |
1683 | for (gimple_stmt_iterator gsi = gsi_start_bb (bb); | |
1684 | !gsi_end_p (gsi); gsi_next (&gsi)) | |
1685 | { | |
1686 | gimple stmt = gsi_stmt (gsi); | |
1687 | /* This assumes that calls to internal-only functions never | |
1688 | use a return slot. */ | |
1689 | if (is_gimple_call (stmt) | |
1690 | && !gimple_call_internal_p (stmt) | |
1691 | && aggregate_value_p (TREE_TYPE (gimple_call_fntype (stmt)), | |
1692 | gimple_call_fndecl (stmt))) | |
1693 | return true; | |
1694 | } | |
1695 | return false; | |
1696 | } | |
1697 | ||
60d03123 | 1698 | /* Expand all variables used in the function. */ |
280450fa | 1699 | |
74a0cbc4 | 1700 | static rtx_insn * |
280450fa | 1701 | expand_used_vars (void) |
1702 | { | |
2ab2ce89 | 1703 | tree var, outer_block = DECL_INITIAL (current_function_decl); |
1e094109 | 1704 | vec<tree> maybe_local_decls = vNULL; |
74a0cbc4 | 1705 | rtx_insn *var_end_seq = NULL; |
a8dd994c | 1706 | unsigned i; |
2ab2ce89 | 1707 | unsigned len; |
b156ec37 | 1708 | bool gen_stack_protect_signal = false; |
280450fa | 1709 | |
60d03123 | 1710 | /* Compute the phase of the stack frame for this function. */ |
1711 | { | |
1712 | int align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT; | |
1713 | int off = STARTING_FRAME_OFFSET % align; | |
1714 | frame_phase = off ? align - off : 0; | |
1715 | } | |
280450fa | 1716 | |
4fb07d00 | 1717 | /* Set TREE_USED on all variables in the local_decls. */ |
1718 | FOR_EACH_LOCAL_DECL (cfun, i, var) | |
1719 | TREE_USED (var) = 1; | |
1720 | /* Clear TREE_USED on all variables associated with a block scope. */ | |
1721 | clear_tree_used (DECL_INITIAL (current_function_decl)); | |
1722 | ||
5a02d67b | 1723 | init_vars_expansion (); |
f1a0edff | 1724 | |
5f8841a5 | 1725 | hash_map<tree, tree> ssa_name_decls; |
a8dd994c | 1726 | for (i = 0; i < SA.map->num_partitions; i++) |
1727 | { | |
1728 | tree var = partition_to_var (SA.map, i); | |
1729 | ||
7c782c9b | 1730 | gcc_assert (!virtual_operand_p (var)); |
ec11736b | 1731 | |
1732 | /* Assign decls to each SSA name partition, share decls for partitions | |
1733 | we could have coalesced (those with the same type). */ | |
1734 | if (SSA_NAME_VAR (var) == NULL_TREE) | |
1735 | { | |
5f8841a5 | 1736 | tree *slot = &ssa_name_decls.get_or_insert (TREE_TYPE (var)); |
ec11736b | 1737 | if (!*slot) |
5f8841a5 | 1738 | *slot = create_tmp_reg (TREE_TYPE (var), NULL); |
1739 | replace_ssa_name_symbol (var, *slot); | |
ec11736b | 1740 | } |
1741 | ||
5d1c1f55 | 1742 | /* Always allocate space for partitions based on VAR_DECLs. But for |
1743 | those based on PARM_DECLs or RESULT_DECLs and which matter for the | |
1744 | debug info, there is no need to do so if optimization is disabled | |
1745 | because all the SSA_NAMEs based on these DECLs have been coalesced | |
1746 | into a single partition, which is thus assigned the canonical RTL | |
45ddd4eb | 1747 | location of the DECLs. If in_lto_p, we can't rely on optimize, |
1748 | a function could be compiled with -O1 -flto first and only the | |
1749 | link performed at -O0. */ | |
a8dd994c | 1750 | if (TREE_CODE (SSA_NAME_VAR (var)) == VAR_DECL) |
1751 | expand_one_var (var, true, true); | |
45ddd4eb | 1752 | else if (DECL_IGNORED_P (SSA_NAME_VAR (var)) || optimize || in_lto_p) |
a8dd994c | 1753 | { |
1754 | /* This is a PARM_DECL or RESULT_DECL. For those partitions that | |
1755 | contain the default def (representing the parm or result itself) | |
1756 | we don't do anything here. But those which don't contain the | |
1757 | default def (representing a temporary based on the parm/result) | |
1758 | we need to allocate space just like for normal VAR_DECLs. */ | |
1759 | if (!bitmap_bit_p (SA.partition_has_default_def, i)) | |
1760 | { | |
1761 | expand_one_var (var, true, true); | |
1762 | gcc_assert (SA.partition_to_pseudo[i]); | |
1763 | } | |
1764 | } | |
1765 | } | |
1766 | ||
b156ec37 | 1767 | if (flag_stack_protect == SPCT_FLAG_STRONG) |
ec4af1be | 1768 | gen_stack_protect_signal |
1769 | = stack_protect_decl_p () || stack_protect_return_slot_p (); | |
b156ec37 | 1770 | |
edb7afe8 | 1771 | /* At this point all variables on the local_decls with TREE_USED |
60d03123 | 1772 | set are not associated with any block scope. Lay them out. */ |
2ab2ce89 | 1773 | |
f1f41a6c | 1774 | len = vec_safe_length (cfun->local_decls); |
2ab2ce89 | 1775 | FOR_EACH_LOCAL_DECL (cfun, i, var) |
60d03123 | 1776 | { |
60d03123 | 1777 | bool expand_now = false; |
1778 | ||
a8dd994c | 1779 | /* Expanded above already. */ |
1780 | if (is_gimple_reg (var)) | |
e32b531f | 1781 | { |
1782 | TREE_USED (var) = 0; | |
a45d3ce3 | 1783 | goto next; |
e32b531f | 1784 | } |
60d03123 | 1785 | /* We didn't set a block for static or extern because it's hard |
1786 | to tell the difference between a global variable (re)declared | |
1787 | in a local scope, and one that's really declared there to | |
1788 | begin with. And it doesn't really matter much, since we're | |
1789 | not giving them stack space. Expand them now. */ | |
a8dd994c | 1790 | else if (TREE_STATIC (var) || DECL_EXTERNAL (var)) |
60d03123 | 1791 | expand_now = true; |
1792 | ||
da4b9ed5 | 1793 | /* Expand variables not associated with any block now. Those created by |
1794 | the optimizers could be live anywhere in the function. Those that | |
1795 | could possibly have been scoped originally and detached from their | |
1796 | block will have their allocation deferred so we coalesce them with | |
1797 | others when optimization is enabled. */ | |
60d03123 | 1798 | else if (TREE_USED (var)) |
1799 | expand_now = true; | |
1800 | ||
1801 | /* Finally, mark all variables on the list as used. We'll use | |
1802 | this in a moment when we expand those associated with scopes. */ | |
1803 | TREE_USED (var) = 1; | |
1804 | ||
1805 | if (expand_now) | |
a45d3ce3 | 1806 | expand_one_var (var, true, true); |
1807 | ||
1808 | next: | |
1809 | if (DECL_ARTIFICIAL (var) && !DECL_IGNORED_P (var)) | |
78fa9ba7 | 1810 | { |
a45d3ce3 | 1811 | rtx rtl = DECL_RTL_IF_SET (var); |
1812 | ||
1813 | /* Keep artificial non-ignored vars in cfun->local_decls | |
1814 | chain until instantiate_decls. */ | |
1815 | if (rtl && (MEM_P (rtl) || GET_CODE (rtl) == CONCAT)) | |
2ab2ce89 | 1816 | add_local_decl (cfun, var); |
257b4da1 | 1817 | else if (rtl == NULL_RTX) |
2ab2ce89 | 1818 | /* If rtl isn't set yet, which can happen e.g. with |
1819 | -fstack-protector, retry before returning from this | |
1820 | function. */ | |
f1f41a6c | 1821 | maybe_local_decls.safe_push (var); |
78fa9ba7 | 1822 | } |
60d03123 | 1823 | } |
60d03123 | 1824 | |
2ab2ce89 | 1825 | /* We duplicated some of the decls in CFUN->LOCAL_DECLS. |
1826 | ||
1827 | +-----------------+-----------------+ | |
1828 | | ...processed... | ...duplicates...| | |
1829 | +-----------------+-----------------+ | |
1830 | ^ | |
1831 | +-- LEN points here. | |
1832 | ||
1833 | We just want the duplicates, as those are the artificial | |
1834 | non-ignored vars that we want to keep until instantiate_decls. | |
1835 | Move them down and truncate the array. */ | |
f1f41a6c | 1836 | if (!vec_safe_is_empty (cfun->local_decls)) |
1837 | cfun->local_decls->block_remove (0, len); | |
2ab2ce89 | 1838 | |
60d03123 | 1839 | /* At this point, all variables within the block tree with TREE_USED |
1840 | set are actually used by the optimized function. Lay them out. */ | |
1841 | expand_used_vars_for_block (outer_block, true); | |
1842 | ||
1843 | if (stack_vars_num > 0) | |
1844 | { | |
3c25489e | 1845 | add_scope_conflicts (); |
60d03123 | 1846 | |
a0c938f0 | 1847 | /* If stack protection is enabled, we don't share space between |
f1a0edff | 1848 | vulnerable data and non-vulnerable data. */ |
1849 | if (flag_stack_protect) | |
1850 | add_stack_protection_conflicts (); | |
1851 | ||
a0c938f0 | 1852 | /* Now that we have collected all stack variables, and have computed a |
60d03123 | 1853 | minimal interference graph, attempt to save some stack space. */ |
1854 | partition_stack_vars (); | |
1855 | if (dump_file) | |
1856 | dump_stack_var_partition (); | |
f1a0edff | 1857 | } |
1858 | ||
b156ec37 | 1859 | switch (flag_stack_protect) |
1860 | { | |
1861 | case SPCT_FLAG_ALL: | |
1862 | create_stack_guard (); | |
1863 | break; | |
1864 | ||
1865 | case SPCT_FLAG_STRONG: | |
1866 | if (gen_stack_protect_signal | |
1867 | || cfun->calls_alloca || has_protected_decls) | |
1868 | create_stack_guard (); | |
1869 | break; | |
1870 | ||
1871 | case SPCT_FLAG_DEFAULT: | |
1872 | if (cfun->calls_alloca || has_protected_decls) | |
9af5ce0c | 1873 | create_stack_guard (); |
b156ec37 | 1874 | break; |
1875 | ||
1876 | default: | |
1877 | ; | |
1878 | } | |
60d03123 | 1879 | |
f1a0edff | 1880 | /* Assign rtl to each variable based on these partitions. */ |
1881 | if (stack_vars_num > 0) | |
1882 | { | |
3c919612 | 1883 | struct stack_vars_data data; |
1884 | ||
1e094109 | 1885 | data.asan_vec = vNULL; |
1886 | data.asan_decl_vec = vNULL; | |
683539f6 | 1887 | data.asan_base = NULL_RTX; |
1888 | data.asan_alignb = 0; | |
3c919612 | 1889 | |
f1a0edff | 1890 | /* Reorder decls to be protected by iterating over the variables |
1891 | array multiple times, and allocating out of each phase in turn. */ | |
a0c938f0 | 1892 | /* ??? We could probably integrate this into the qsort we did |
f1a0edff | 1893 | earlier, such that we naturally see these variables first, |
1894 | and thus naturally allocate things in the right order. */ | |
1895 | if (has_protected_decls) | |
1896 | { | |
1897 | /* Phase 1 contains only character arrays. */ | |
3c919612 | 1898 | expand_stack_vars (stack_protect_decl_phase_1, &data); |
f1a0edff | 1899 | |
1900 | /* Phase 2 contains other kinds of arrays. */ | |
1901 | if (flag_stack_protect == 2) | |
3c919612 | 1902 | expand_stack_vars (stack_protect_decl_phase_2, &data); |
f1a0edff | 1903 | } |
1904 | ||
bf2b7c22 | 1905 | if ((flag_sanitize & SANITIZE_ADDRESS) && ASAN_STACK) |
3c919612 | 1906 | /* Phase 3, any partitions that need asan protection |
1907 | in addition to phase 1 and 2. */ | |
1908 | expand_stack_vars (asan_decl_phase_3, &data); | |
1909 | ||
f1f41a6c | 1910 | if (!data.asan_vec.is_empty ()) |
3c919612 | 1911 | { |
1912 | HOST_WIDE_INT prev_offset = frame_offset; | |
683539f6 | 1913 | HOST_WIDE_INT offset, sz, redzonesz; |
1914 | redzonesz = ASAN_RED_ZONE_SIZE; | |
1915 | sz = data.asan_vec[0] - prev_offset; | |
1916 | if (data.asan_alignb > ASAN_RED_ZONE_SIZE | |
1917 | && data.asan_alignb <= 4096 | |
c8c66351 | 1918 | && sz + ASAN_RED_ZONE_SIZE >= (int) data.asan_alignb) |
683539f6 | 1919 | redzonesz = ((sz + ASAN_RED_ZONE_SIZE + data.asan_alignb - 1) |
1920 | & ~(data.asan_alignb - HOST_WIDE_INT_1)) - sz; | |
1921 | offset | |
1922 | = alloc_stack_frame_space (redzonesz, ASAN_RED_ZONE_SIZE); | |
f1f41a6c | 1923 | data.asan_vec.safe_push (prev_offset); |
1924 | data.asan_vec.safe_push (offset); | |
f89175bb | 1925 | /* Leave space for alignment if STRICT_ALIGNMENT. */ |
1926 | if (STRICT_ALIGNMENT) | |
1927 | alloc_stack_frame_space ((GET_MODE_ALIGNMENT (SImode) | |
1928 | << ASAN_SHADOW_SHIFT) | |
1929 | / BITS_PER_UNIT, 1); | |
3c919612 | 1930 | |
1931 | var_end_seq | |
1932 | = asan_emit_stack_protection (virtual_stack_vars_rtx, | |
683539f6 | 1933 | data.asan_base, |
1934 | data.asan_alignb, | |
f1f41a6c | 1935 | data.asan_vec.address (), |
683539f6 | 1936 | data.asan_decl_vec.address (), |
f1f41a6c | 1937 | data.asan_vec.length ()); |
3c919612 | 1938 | } |
1939 | ||
1940 | expand_stack_vars (NULL, &data); | |
1941 | ||
f1f41a6c | 1942 | data.asan_vec.release (); |
1943 | data.asan_decl_vec.release (); | |
60d03123 | 1944 | } |
1945 | ||
4fb07d00 | 1946 | fini_vars_expansion (); |
1947 | ||
257b4da1 | 1948 | /* If there were any artificial non-ignored vars without rtl |
1949 | found earlier, see if deferred stack allocation hasn't assigned | |
1950 | rtl to them. */ | |
f1f41a6c | 1951 | FOR_EACH_VEC_ELT_REVERSE (maybe_local_decls, i, var) |
257b4da1 | 1952 | { |
257b4da1 | 1953 | rtx rtl = DECL_RTL_IF_SET (var); |
1954 | ||
257b4da1 | 1955 | /* Keep artificial non-ignored vars in cfun->local_decls |
1956 | chain until instantiate_decls. */ | |
1957 | if (rtl && (MEM_P (rtl) || GET_CODE (rtl) == CONCAT)) | |
2ab2ce89 | 1958 | add_local_decl (cfun, var); |
257b4da1 | 1959 | } |
f1f41a6c | 1960 | maybe_local_decls.release (); |
257b4da1 | 1961 | |
60d03123 | 1962 | /* If the target requires that FRAME_OFFSET be aligned, do it. */ |
1963 | if (STACK_ALIGNMENT_NEEDED) | |
1964 | { | |
1965 | HOST_WIDE_INT align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT; | |
1966 | if (!FRAME_GROWS_DOWNWARD) | |
1967 | frame_offset += align - 1; | |
1968 | frame_offset &= -align; | |
1969 | } | |
3c919612 | 1970 | |
1971 | return var_end_seq; | |
280450fa | 1972 | } |
1973 | ||
1974 | ||
49377e21 | 1975 | /* If we need to produce a detailed dump, print the tree representation |
1976 | for STMT to the dump file. SINCE is the last RTX after which the RTL | |
1977 | generated for STMT should have been appended. */ | |
1978 | ||
1979 | static void | |
74a0cbc4 | 1980 | maybe_dump_rtl_for_gimple_stmt (gimple stmt, rtx_insn *since) |
49377e21 | 1981 | { |
1982 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
1983 | { | |
1984 | fprintf (dump_file, "\n;; "); | |
9845d120 | 1985 | print_gimple_stmt (dump_file, stmt, 0, |
1986 | TDF_SLIM | (dump_flags & TDF_LINENO)); | |
49377e21 | 1987 | fprintf (dump_file, "\n"); |
1988 | ||
1989 | print_rtl (dump_file, since ? NEXT_INSN (since) : since); | |
1990 | } | |
1991 | } | |
1992 | ||
6313ae8b | 1993 | /* Maps the blocks that do not contain tree labels to rtx labels. */ |
1994 | ||
0699065d | 1995 | static hash_map<basic_block, rtx_code_label *> *lab_rtx_for_bb; |
6313ae8b | 1996 | |
63f88450 | 1997 | /* Returns the label_rtx expression for a label starting basic block BB. */ |
1998 | ||
1999 | static rtx | |
75a70cf9 | 2000 | label_rtx_for_bb (basic_block bb ATTRIBUTE_UNUSED) |
63f88450 | 2001 | { |
75a70cf9 | 2002 | gimple_stmt_iterator gsi; |
2003 | tree lab; | |
63f88450 | 2004 | |
2005 | if (bb->flags & BB_RTL) | |
2006 | return block_label (bb); | |
2007 | ||
0699065d | 2008 | rtx_code_label **elt = lab_rtx_for_bb->get (bb); |
6313ae8b | 2009 | if (elt) |
5f8841a5 | 2010 | return *elt; |
6313ae8b | 2011 | |
2012 | /* Find the tree label if it is present. */ | |
48e1416a | 2013 | |
75a70cf9 | 2014 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
63f88450 | 2015 | { |
1a91d914 | 2016 | glabel *lab_stmt; |
2017 | ||
2018 | lab_stmt = dyn_cast <glabel *> (gsi_stmt (gsi)); | |
2019 | if (!lab_stmt) | |
63f88450 | 2020 | break; |
2021 | ||
75a70cf9 | 2022 | lab = gimple_label_label (lab_stmt); |
63f88450 | 2023 | if (DECL_NONLOCAL (lab)) |
2024 | break; | |
2025 | ||
2026 | return label_rtx (lab); | |
2027 | } | |
2028 | ||
79f6a8ed | 2029 | rtx_code_label *l = gen_label_rtx (); |
5f8841a5 | 2030 | lab_rtx_for_bb->put (bb, l); |
2031 | return l; | |
63f88450 | 2032 | } |
2033 | ||
75a70cf9 | 2034 | |
f800c469 | 2035 | /* A subroutine of expand_gimple_cond. Given E, a fallthrough edge |
2036 | of a basic block where we just expanded the conditional at the end, | |
ee0f3895 | 2037 | possibly clean up the CFG and instruction sequence. LAST is the |
2038 | last instruction before the just emitted jump sequence. */ | |
f800c469 | 2039 | |
2040 | static void | |
74a0cbc4 | 2041 | maybe_cleanup_end_of_block (edge e, rtx_insn *last) |
f800c469 | 2042 | { |
2043 | /* Special case: when jumpif decides that the condition is | |
2044 | trivial it emits an unconditional jump (and the necessary | |
2045 | barrier). But we still have two edges, the fallthru one is | |
2046 | wrong. purge_dead_edges would clean this up later. Unfortunately | |
2047 | we have to insert insns (and split edges) before | |
2048 | find_many_sub_basic_blocks and hence before purge_dead_edges. | |
2049 | But splitting edges might create new blocks which depend on the | |
2050 | fact that if there are two edges there's no barrier. So the | |
2051 | barrier would get lost and verify_flow_info would ICE. Instead | |
2052 | of auditing all edge splitters to care for the barrier (which | |
2053 | normally isn't there in a cleaned CFG), fix it here. */ | |
2054 | if (BARRIER_P (get_last_insn ())) | |
2055 | { | |
74a0cbc4 | 2056 | rtx_insn *insn; |
f800c469 | 2057 | remove_edge (e); |
2058 | /* Now, we have a single successor block, if we have insns to | |
2059 | insert on the remaining edge we potentially will insert | |
2060 | it at the end of this block (if the dest block isn't feasible) | |
2061 | in order to avoid splitting the edge. This insertion will take | |
2062 | place in front of the last jump. But we might have emitted | |
2063 | multiple jumps (conditional and one unconditional) to the | |
2064 | same destination. Inserting in front of the last one then | |
2065 | is a problem. See PR 40021. We fix this by deleting all | |
2066 | jumps except the last unconditional one. */ | |
2067 | insn = PREV_INSN (get_last_insn ()); | |
2068 | /* Make sure we have an unconditional jump. Otherwise we're | |
2069 | confused. */ | |
2070 | gcc_assert (JUMP_P (insn) && !any_condjump_p (insn)); | |
ee0f3895 | 2071 | for (insn = PREV_INSN (insn); insn != last;) |
f800c469 | 2072 | { |
2073 | insn = PREV_INSN (insn); | |
2074 | if (JUMP_P (NEXT_INSN (insn))) | |
2755d767 | 2075 | { |
46a5816d | 2076 | if (!any_condjump_p (NEXT_INSN (insn))) |
2755d767 | 2077 | { |
2078 | gcc_assert (BARRIER_P (NEXT_INSN (NEXT_INSN (insn)))); | |
2079 | delete_insn (NEXT_INSN (NEXT_INSN (insn))); | |
2080 | } | |
2081 | delete_insn (NEXT_INSN (insn)); | |
2082 | } | |
f800c469 | 2083 | } |
2084 | } | |
2085 | } | |
2086 | ||
75a70cf9 | 2087 | /* A subroutine of expand_gimple_basic_block. Expand one GIMPLE_COND. |
3ced8962 | 2088 | Returns a new basic block if we've terminated the current basic |
2089 | block and created a new one. */ | |
2090 | ||
2091 | static basic_block | |
1a91d914 | 2092 | expand_gimple_cond (basic_block bb, gcond *stmt) |
3ced8962 | 2093 | { |
2094 | basic_block new_bb, dest; | |
2095 | edge new_edge; | |
2096 | edge true_edge; | |
2097 | edge false_edge; | |
74a0cbc4 | 2098 | rtx_insn *last2, *last; |
16c9337c | 2099 | enum tree_code code; |
2100 | tree op0, op1; | |
2101 | ||
2102 | code = gimple_cond_code (stmt); | |
2103 | op0 = gimple_cond_lhs (stmt); | |
2104 | op1 = gimple_cond_rhs (stmt); | |
2105 | /* We're sometimes presented with such code: | |
2106 | D.123_1 = x < y; | |
2107 | if (D.123_1 != 0) | |
2108 | ... | |
2109 | This would expand to two comparisons which then later might | |
2110 | be cleaned up by combine. But some pattern matchers like if-conversion | |
2111 | work better when there's only one compare, so make up for this | |
2112 | here as special exception if TER would have made the same change. */ | |
9532a315 | 2113 | if (SA.values |
16c9337c | 2114 | && TREE_CODE (op0) == SSA_NAME |
9532a315 | 2115 | && TREE_CODE (TREE_TYPE (op0)) == BOOLEAN_TYPE |
2116 | && TREE_CODE (op1) == INTEGER_CST | |
2117 | && ((gimple_cond_code (stmt) == NE_EXPR | |
2118 | && integer_zerop (op1)) | |
2119 | || (gimple_cond_code (stmt) == EQ_EXPR | |
2120 | && integer_onep (op1))) | |
16c9337c | 2121 | && bitmap_bit_p (SA.values, SSA_NAME_VERSION (op0))) |
2122 | { | |
2123 | gimple second = SSA_NAME_DEF_STMT (op0); | |
5905fb26 | 2124 | if (gimple_code (second) == GIMPLE_ASSIGN) |
16c9337c | 2125 | { |
5905fb26 | 2126 | enum tree_code code2 = gimple_assign_rhs_code (second); |
2127 | if (TREE_CODE_CLASS (code2) == tcc_comparison) | |
2128 | { | |
2129 | code = code2; | |
2130 | op0 = gimple_assign_rhs1 (second); | |
2131 | op1 = gimple_assign_rhs2 (second); | |
2132 | } | |
01ee997b | 2133 | /* If jumps are cheap and the target does not support conditional |
2134 | compare, turn some more codes into jumpy sequences. */ | |
2135 | else if (BRANCH_COST (optimize_insn_for_speed_p (), false) < 4 | |
2136 | && targetm.gen_ccmp_first == NULL) | |
5905fb26 | 2137 | { |
2138 | if ((code2 == BIT_AND_EXPR | |
2139 | && TYPE_PRECISION (TREE_TYPE (op0)) == 1 | |
2140 | && TREE_CODE (gimple_assign_rhs2 (second)) != INTEGER_CST) | |
2141 | || code2 == TRUTH_AND_EXPR) | |
2142 | { | |
2143 | code = TRUTH_ANDIF_EXPR; | |
2144 | op0 = gimple_assign_rhs1 (second); | |
2145 | op1 = gimple_assign_rhs2 (second); | |
2146 | } | |
2147 | else if (code2 == BIT_IOR_EXPR || code2 == TRUTH_OR_EXPR) | |
2148 | { | |
2149 | code = TRUTH_ORIF_EXPR; | |
2150 | op0 = gimple_assign_rhs1 (second); | |
2151 | op1 = gimple_assign_rhs2 (second); | |
2152 | } | |
2153 | } | |
16c9337c | 2154 | } |
2155 | } | |
49377e21 | 2156 | |
2157 | last2 = last = get_last_insn (); | |
3ced8962 | 2158 | |
2159 | extract_true_false_edges_from_block (bb, &true_edge, &false_edge); | |
5169661d | 2160 | set_curr_insn_location (gimple_location (stmt)); |
3ced8962 | 2161 | |
2162 | /* These flags have no purpose in RTL land. */ | |
2163 | true_edge->flags &= ~EDGE_TRUE_VALUE; | |
2164 | false_edge->flags &= ~EDGE_FALSE_VALUE; | |
2165 | ||
2166 | /* We can either have a pure conditional jump with one fallthru edge or | |
2167 | two-way jump that needs to be decomposed into two basic blocks. */ | |
63f88450 | 2168 | if (false_edge->dest == bb->next_bb) |
3ced8962 | 2169 | { |
79ab74cc | 2170 | jumpif_1 (code, op0, op1, label_rtx_for_bb (true_edge->dest), |
2171 | true_edge->probability); | |
75a70cf9 | 2172 | maybe_dump_rtl_for_gimple_stmt (stmt, last); |
8e7408e3 | 2173 | if (true_edge->goto_locus != UNKNOWN_LOCATION) |
5169661d | 2174 | set_curr_insn_location (true_edge->goto_locus); |
63f88450 | 2175 | false_edge->flags |= EDGE_FALLTHRU; |
ee0f3895 | 2176 | maybe_cleanup_end_of_block (false_edge, last); |
3ced8962 | 2177 | return NULL; |
2178 | } | |
63f88450 | 2179 | if (true_edge->dest == bb->next_bb) |
3ced8962 | 2180 | { |
79ab74cc | 2181 | jumpifnot_1 (code, op0, op1, label_rtx_for_bb (false_edge->dest), |
2182 | false_edge->probability); | |
75a70cf9 | 2183 | maybe_dump_rtl_for_gimple_stmt (stmt, last); |
8e7408e3 | 2184 | if (false_edge->goto_locus != UNKNOWN_LOCATION) |
5169661d | 2185 | set_curr_insn_location (false_edge->goto_locus); |
63f88450 | 2186 | true_edge->flags |= EDGE_FALLTHRU; |
ee0f3895 | 2187 | maybe_cleanup_end_of_block (true_edge, last); |
3ced8962 | 2188 | return NULL; |
2189 | } | |
3ced8962 | 2190 | |
79ab74cc | 2191 | jumpif_1 (code, op0, op1, label_rtx_for_bb (true_edge->dest), |
2192 | true_edge->probability); | |
3ced8962 | 2193 | last = get_last_insn (); |
8e7408e3 | 2194 | if (false_edge->goto_locus != UNKNOWN_LOCATION) |
5169661d | 2195 | set_curr_insn_location (false_edge->goto_locus); |
63f88450 | 2196 | emit_jump (label_rtx_for_bb (false_edge->dest)); |
3ced8962 | 2197 | |
26bb3cb2 | 2198 | BB_END (bb) = last; |
3ced8962 | 2199 | if (BARRIER_P (BB_END (bb))) |
26bb3cb2 | 2200 | BB_END (bb) = PREV_INSN (BB_END (bb)); |
3ced8962 | 2201 | update_bb_for_insn (bb); |
2202 | ||
2203 | new_bb = create_basic_block (NEXT_INSN (last), get_last_insn (), bb); | |
2204 | dest = false_edge->dest; | |
2205 | redirect_edge_succ (false_edge, new_bb); | |
2206 | false_edge->flags |= EDGE_FALLTHRU; | |
2207 | new_bb->count = false_edge->count; | |
2208 | new_bb->frequency = EDGE_FREQUENCY (false_edge); | |
b3083327 | 2209 | add_bb_to_loop (new_bb, bb->loop_father); |
3ced8962 | 2210 | new_edge = make_edge (new_bb, dest, 0); |
2211 | new_edge->probability = REG_BR_PROB_BASE; | |
2212 | new_edge->count = new_bb->count; | |
2213 | if (BARRIER_P (BB_END (new_bb))) | |
26bb3cb2 | 2214 | BB_END (new_bb) = PREV_INSN (BB_END (new_bb)); |
3ced8962 | 2215 | update_bb_for_insn (new_bb); |
2216 | ||
75a70cf9 | 2217 | maybe_dump_rtl_for_gimple_stmt (stmt, last2); |
a0c938f0 | 2218 | |
8e7408e3 | 2219 | if (true_edge->goto_locus != UNKNOWN_LOCATION) |
c4ad3297 | 2220 | { |
5169661d | 2221 | set_curr_insn_location (true_edge->goto_locus); |
2222 | true_edge->goto_locus = curr_insn_location (); | |
c4ad3297 | 2223 | } |
c4ad3297 | 2224 | |
3ced8962 | 2225 | return new_bb; |
2226 | } | |
2227 | ||
4c0315d0 | 2228 | /* Mark all calls that can have a transaction restart. */ |
2229 | ||
2230 | static void | |
2231 | mark_transaction_restart_calls (gimple stmt) | |
2232 | { | |
2233 | struct tm_restart_node dummy; | |
2234 | void **slot; | |
2235 | ||
2236 | if (!cfun->gimple_df->tm_restart) | |
2237 | return; | |
2238 | ||
2239 | dummy.stmt = stmt; | |
2240 | slot = htab_find_slot (cfun->gimple_df->tm_restart, &dummy, NO_INSERT); | |
2241 | if (slot) | |
2242 | { | |
2243 | struct tm_restart_node *n = (struct tm_restart_node *) *slot; | |
2244 | tree list = n->label_or_list; | |
74a0cbc4 | 2245 | rtx_insn *insn; |
4c0315d0 | 2246 | |
2247 | for (insn = next_real_insn (get_last_insn ()); | |
2248 | !CALL_P (insn); | |
2249 | insn = next_real_insn (insn)) | |
2250 | continue; | |
2251 | ||
2252 | if (TREE_CODE (list) == LABEL_DECL) | |
2253 | add_reg_note (insn, REG_TM, label_rtx (list)); | |
2254 | else | |
2255 | for (; list ; list = TREE_CHAIN (list)) | |
2256 | add_reg_note (insn, REG_TM, label_rtx (TREE_VALUE (list))); | |
2257 | } | |
2258 | } | |
2259 | ||
16c9337c | 2260 | /* A subroutine of expand_gimple_stmt_1, expanding one GIMPLE_CALL |
2261 | statement STMT. */ | |
2262 | ||
2263 | static void | |
1a91d914 | 2264 | expand_call_stmt (gcall *stmt) |
16c9337c | 2265 | { |
fb049fba | 2266 | tree exp, decl, lhs; |
facbb5c4 | 2267 | bool builtin_p; |
a967d5e5 | 2268 | size_t i; |
16c9337c | 2269 | |
fb049fba | 2270 | if (gimple_call_internal_p (stmt)) |
2271 | { | |
2272 | expand_internal_call (stmt); | |
2273 | return; | |
2274 | } | |
2275 | ||
0fcb889c | 2276 | exp = build_vl_exp (CALL_EXPR, gimple_call_num_args (stmt) + 3); |
bbc26dcc | 2277 | |
0fcb889c | 2278 | CALL_EXPR_FN (exp) = gimple_call_fn (stmt); |
bbc26dcc | 2279 | decl = gimple_call_fndecl (stmt); |
2280 | builtin_p = decl && DECL_BUILT_IN (decl); | |
0fcb889c | 2281 | |
a967d5e5 | 2282 | /* If this is not a builtin function, the function type through which the |
2283 | call is made may be different from the type of the function. */ | |
2284 | if (!builtin_p) | |
2285 | CALL_EXPR_FN (exp) | |
317bd3b6 | 2286 | = fold_convert (build_pointer_type (gimple_call_fntype (stmt)), |
2287 | CALL_EXPR_FN (exp)); | |
a967d5e5 | 2288 | |
16c9337c | 2289 | TREE_TYPE (exp) = gimple_call_return_type (stmt); |
2290 | CALL_EXPR_STATIC_CHAIN (exp) = gimple_call_chain (stmt); | |
2291 | ||
2292 | for (i = 0; i < gimple_call_num_args (stmt); i++) | |
facbb5c4 | 2293 | { |
2294 | tree arg = gimple_call_arg (stmt, i); | |
2295 | gimple def; | |
2296 | /* TER addresses into arguments of builtin functions so we have a | |
2297 | chance to infer more correct alignment information. See PR39954. */ | |
2298 | if (builtin_p | |
2299 | && TREE_CODE (arg) == SSA_NAME | |
2300 | && (def = get_gimple_for_ssa_name (arg)) | |
2301 | && gimple_assign_rhs_code (def) == ADDR_EXPR) | |
2302 | arg = gimple_assign_rhs1 (def); | |
2303 | CALL_EXPR_ARG (exp, i) = arg; | |
2304 | } | |
16c9337c | 2305 | |
e1ac6f35 | 2306 | if (gimple_has_side_effects (stmt)) |
16c9337c | 2307 | TREE_SIDE_EFFECTS (exp) = 1; |
2308 | ||
e1ac6f35 | 2309 | if (gimple_call_nothrow_p (stmt)) |
16c9337c | 2310 | TREE_NOTHROW (exp) = 1; |
2311 | ||
2312 | CALL_EXPR_TAILCALL (exp) = gimple_call_tail_p (stmt); | |
2313 | CALL_EXPR_RETURN_SLOT_OPT (exp) = gimple_call_return_slot_opt_p (stmt); | |
a882d754 | 2314 | if (decl |
2315 | && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL | |
581bf1c2 | 2316 | && (DECL_FUNCTION_CODE (decl) == BUILT_IN_ALLOCA |
2317 | || DECL_FUNCTION_CODE (decl) == BUILT_IN_ALLOCA_WITH_ALIGN)) | |
a882d754 | 2318 | CALL_ALLOCA_FOR_VAR_P (exp) = gimple_call_alloca_for_var_p (stmt); |
2319 | else | |
2320 | CALL_FROM_THUNK_P (exp) = gimple_call_from_thunk_p (stmt); | |
16c9337c | 2321 | CALL_EXPR_VA_ARG_PACK (exp) = gimple_call_va_arg_pack_p (stmt); |
2322 | SET_EXPR_LOCATION (exp, gimple_location (stmt)); | |
058a1b7a | 2323 | CALL_WITH_BOUNDS_P (exp) = gimple_call_with_bounds_p (stmt); |
16c9337c | 2324 | |
841424cc | 2325 | /* Ensure RTL is created for debug args. */ |
2326 | if (decl && DECL_HAS_DEBUG_ARGS_P (decl)) | |
2327 | { | |
f1f41a6c | 2328 | vec<tree, va_gc> **debug_args = decl_debug_args_lookup (decl); |
841424cc | 2329 | unsigned int ix; |
2330 | tree dtemp; | |
2331 | ||
2332 | if (debug_args) | |
f1f41a6c | 2333 | for (ix = 1; (*debug_args)->iterate (ix, &dtemp); ix += 2) |
841424cc | 2334 | { |
2335 | gcc_assert (TREE_CODE (dtemp) == DEBUG_EXPR_DECL); | |
2336 | expand_debug_expr (dtemp); | |
2337 | } | |
2338 | } | |
2339 | ||
fb049fba | 2340 | lhs = gimple_call_lhs (stmt); |
16c9337c | 2341 | if (lhs) |
2342 | expand_assignment (lhs, exp, false); | |
2343 | else | |
a12f023f | 2344 | expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL); |
4c0315d0 | 2345 | |
2346 | mark_transaction_restart_calls (stmt); | |
16c9337c | 2347 | } |
2348 | ||
0e80b01d | 2349 | |
2350 | /* Generate RTL for an asm statement (explicit assembler code). | |
2351 | STRING is a STRING_CST node containing the assembler code text, | |
2352 | or an ADDR_EXPR containing a STRING_CST. VOL nonzero means the | |
2353 | insn is volatile; don't optimize it. */ | |
2354 | ||
2355 | static void | |
2356 | expand_asm_loc (tree string, int vol, location_t locus) | |
2357 | { | |
2358 | rtx body; | |
2359 | ||
2360 | if (TREE_CODE (string) == ADDR_EXPR) | |
2361 | string = TREE_OPERAND (string, 0); | |
2362 | ||
2363 | body = gen_rtx_ASM_INPUT_loc (VOIDmode, | |
2364 | ggc_strdup (TREE_STRING_POINTER (string)), | |
2365 | locus); | |
2366 | ||
2367 | MEM_VOLATILE_P (body) = vol; | |
2368 | ||
2369 | emit_insn (body); | |
2370 | } | |
2371 | ||
2372 | /* Return the number of times character C occurs in string S. */ | |
2373 | static int | |
2374 | n_occurrences (int c, const char *s) | |
2375 | { | |
2376 | int n = 0; | |
2377 | while (*s) | |
2378 | n += (*s++ == c); | |
2379 | return n; | |
2380 | } | |
2381 | ||
2382 | /* A subroutine of expand_asm_operands. Check that all operands have | |
2383 | the same number of alternatives. Return true if so. */ | |
2384 | ||
2385 | static bool | |
2386 | check_operand_nalternatives (tree outputs, tree inputs) | |
2387 | { | |
2388 | if (outputs || inputs) | |
2389 | { | |
2390 | tree tmp = TREE_PURPOSE (outputs ? outputs : inputs); | |
2391 | int nalternatives | |
2392 | = n_occurrences (',', TREE_STRING_POINTER (TREE_VALUE (tmp))); | |
2393 | tree next = inputs; | |
2394 | ||
2395 | if (nalternatives + 1 > MAX_RECOG_ALTERNATIVES) | |
2396 | { | |
2397 | error ("too many alternatives in %<asm%>"); | |
2398 | return false; | |
2399 | } | |
2400 | ||
2401 | tmp = outputs; | |
2402 | while (tmp) | |
2403 | { | |
2404 | const char *constraint | |
2405 | = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tmp))); | |
2406 | ||
2407 | if (n_occurrences (',', constraint) != nalternatives) | |
2408 | { | |
2409 | error ("operand constraints for %<asm%> differ " | |
2410 | "in number of alternatives"); | |
2411 | return false; | |
2412 | } | |
2413 | ||
2414 | if (TREE_CHAIN (tmp)) | |
2415 | tmp = TREE_CHAIN (tmp); | |
2416 | else | |
2417 | tmp = next, next = 0; | |
2418 | } | |
2419 | } | |
2420 | ||
2421 | return true; | |
2422 | } | |
2423 | ||
2424 | /* Check for overlap between registers marked in CLOBBERED_REGS and | |
2425 | anything inappropriate in T. Emit error and return the register | |
2426 | variable definition for error, NULL_TREE for ok. */ | |
2427 | ||
2428 | static bool | |
2429 | tree_conflicts_with_clobbers_p (tree t, HARD_REG_SET *clobbered_regs) | |
2430 | { | |
2431 | /* Conflicts between asm-declared register variables and the clobber | |
2432 | list are not allowed. */ | |
2433 | tree overlap = tree_overlaps_hard_reg_set (t, clobbered_regs); | |
2434 | ||
2435 | if (overlap) | |
2436 | { | |
2437 | error ("asm-specifier for variable %qE conflicts with asm clobber list", | |
2438 | DECL_NAME (overlap)); | |
2439 | ||
2440 | /* Reset registerness to stop multiple errors emitted for a single | |
2441 | variable. */ | |
2442 | DECL_REGISTER (overlap) = 0; | |
2443 | return true; | |
2444 | } | |
2445 | ||
2446 | return false; | |
2447 | } | |
2448 | ||
2449 | /* Generate RTL for an asm statement with arguments. | |
2450 | STRING is the instruction template. | |
2451 | OUTPUTS is a list of output arguments (lvalues); INPUTS a list of inputs. | |
2452 | Each output or input has an expression in the TREE_VALUE and | |
2453 | a tree list in TREE_PURPOSE which in turn contains a constraint | |
2454 | name in TREE_VALUE (or NULL_TREE) and a constraint string | |
2455 | in TREE_PURPOSE. | |
2456 | CLOBBERS is a list of STRING_CST nodes each naming a hard register | |
2457 | that is clobbered by this insn. | |
2458 | ||
2459 | LABELS is a list of labels, and if LABELS is non-NULL, FALLTHRU_BB | |
2460 | should be the fallthru basic block of the asm goto. | |
2461 | ||
2462 | Not all kinds of lvalue that may appear in OUTPUTS can be stored directly. | |
2463 | Some elements of OUTPUTS may be replaced with trees representing temporary | |
2464 | values. The caller should copy those temporary values to the originally | |
2465 | specified lvalues. | |
2466 | ||
2467 | VOL nonzero means the insn is volatile; don't optimize it. */ | |
2468 | ||
2469 | static void | |
2470 | expand_asm_operands (tree string, tree outputs, tree inputs, | |
2471 | tree clobbers, tree labels, basic_block fallthru_bb, | |
2472 | int vol, location_t locus) | |
2473 | { | |
2474 | rtvec argvec, constraintvec, labelvec; | |
2475 | rtx body; | |
2476 | int ninputs = list_length (inputs); | |
2477 | int noutputs = list_length (outputs); | |
2478 | int nlabels = list_length (labels); | |
2479 | int ninout; | |
2480 | int nclobbers; | |
2481 | HARD_REG_SET clobbered_regs; | |
2482 | int clobber_conflict_found = 0; | |
2483 | tree tail; | |
2484 | tree t; | |
2485 | int i; | |
2486 | /* Vector of RTX's of evaluated output operands. */ | |
2487 | rtx *output_rtx = XALLOCAVEC (rtx, noutputs); | |
2488 | int *inout_opnum = XALLOCAVEC (int, noutputs); | |
2489 | rtx *real_output_rtx = XALLOCAVEC (rtx, noutputs); | |
3754d046 | 2490 | machine_mode *inout_mode = XALLOCAVEC (machine_mode, noutputs); |
0e80b01d | 2491 | const char **constraints = XALLOCAVEC (const char *, noutputs + ninputs); |
2492 | int old_generating_concat_p = generating_concat_p; | |
79f6a8ed | 2493 | rtx_code_label *fallthru_label = NULL; |
0e80b01d | 2494 | |
2495 | /* An ASM with no outputs needs to be treated as volatile, for now. */ | |
2496 | if (noutputs == 0) | |
2497 | vol = 1; | |
2498 | ||
2499 | if (! check_operand_nalternatives (outputs, inputs)) | |
2500 | return; | |
2501 | ||
2502 | string = resolve_asm_operand_names (string, outputs, inputs, labels); | |
2503 | ||
2504 | /* Collect constraints. */ | |
2505 | i = 0; | |
2506 | for (t = outputs; t ; t = TREE_CHAIN (t), i++) | |
2507 | constraints[i] = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t))); | |
2508 | for (t = inputs; t ; t = TREE_CHAIN (t), i++) | |
2509 | constraints[i] = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t))); | |
2510 | ||
2511 | /* Sometimes we wish to automatically clobber registers across an asm. | |
2512 | Case in point is when the i386 backend moved from cc0 to a hard reg -- | |
2513 | maintaining source-level compatibility means automatically clobbering | |
2514 | the flags register. */ | |
2515 | clobbers = targetm.md_asm_clobbers (outputs, inputs, clobbers); | |
2516 | ||
2517 | /* Count the number of meaningful clobbered registers, ignoring what | |
2518 | we would ignore later. */ | |
2519 | nclobbers = 0; | |
2520 | CLEAR_HARD_REG_SET (clobbered_regs); | |
2521 | for (tail = clobbers; tail; tail = TREE_CHAIN (tail)) | |
2522 | { | |
2523 | const char *regname; | |
2524 | int nregs; | |
2525 | ||
2526 | if (TREE_VALUE (tail) == error_mark_node) | |
2527 | return; | |
2528 | regname = TREE_STRING_POINTER (TREE_VALUE (tail)); | |
2529 | ||
2530 | i = decode_reg_name_and_count (regname, &nregs); | |
2531 | if (i == -4) | |
2532 | ++nclobbers; | |
2533 | else if (i == -2) | |
2534 | error ("unknown register name %qs in %<asm%>", regname); | |
2535 | ||
2536 | /* Mark clobbered registers. */ | |
2537 | if (i >= 0) | |
2538 | { | |
2539 | int reg; | |
2540 | ||
2541 | for (reg = i; reg < i + nregs; reg++) | |
2542 | { | |
2543 | ++nclobbers; | |
2544 | ||
2545 | /* Clobbering the PIC register is an error. */ | |
2546 | if (reg == (int) PIC_OFFSET_TABLE_REGNUM) | |
2547 | { | |
2548 | error ("PIC register clobbered by %qs in %<asm%>", regname); | |
2549 | return; | |
2550 | } | |
2551 | ||
2552 | SET_HARD_REG_BIT (clobbered_regs, reg); | |
2553 | } | |
2554 | } | |
2555 | } | |
2556 | ||
2557 | /* First pass over inputs and outputs checks validity and sets | |
2558 | mark_addressable if needed. */ | |
2559 | ||
2560 | ninout = 0; | |
2561 | for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++) | |
2562 | { | |
2563 | tree val = TREE_VALUE (tail); | |
2564 | tree type = TREE_TYPE (val); | |
2565 | const char *constraint; | |
2566 | bool is_inout; | |
2567 | bool allows_reg; | |
2568 | bool allows_mem; | |
2569 | ||
2570 | /* If there's an erroneous arg, emit no insn. */ | |
2571 | if (type == error_mark_node) | |
2572 | return; | |
2573 | ||
2574 | /* Try to parse the output constraint. If that fails, there's | |
2575 | no point in going further. */ | |
2576 | constraint = constraints[i]; | |
2577 | if (!parse_output_constraint (&constraint, i, ninputs, noutputs, | |
2578 | &allows_mem, &allows_reg, &is_inout)) | |
2579 | return; | |
2580 | ||
2581 | if (! allows_reg | |
2582 | && (allows_mem | |
2583 | || is_inout | |
2584 | || (DECL_P (val) | |
2585 | && REG_P (DECL_RTL (val)) | |
2586 | && GET_MODE (DECL_RTL (val)) != TYPE_MODE (type)))) | |
2587 | mark_addressable (val); | |
2588 | ||
2589 | if (is_inout) | |
2590 | ninout++; | |
2591 | } | |
2592 | ||
2593 | ninputs += ninout; | |
2594 | if (ninputs + noutputs > MAX_RECOG_OPERANDS) | |
2595 | { | |
2596 | error ("more than %d operands in %<asm%>", MAX_RECOG_OPERANDS); | |
2597 | return; | |
2598 | } | |
2599 | ||
2600 | for (i = 0, tail = inputs; tail; i++, tail = TREE_CHAIN (tail)) | |
2601 | { | |
2602 | bool allows_reg, allows_mem; | |
2603 | const char *constraint; | |
2604 | ||
2605 | /* If there's an erroneous arg, emit no insn, because the ASM_INPUT | |
2606 | would get VOIDmode and that could cause a crash in reload. */ | |
2607 | if (TREE_TYPE (TREE_VALUE (tail)) == error_mark_node) | |
2608 | return; | |
2609 | ||
2610 | constraint = constraints[i + noutputs]; | |
2611 | if (! parse_input_constraint (&constraint, i, ninputs, noutputs, ninout, | |
2612 | constraints, &allows_mem, &allows_reg)) | |
2613 | return; | |
2614 | ||
2615 | if (! allows_reg && allows_mem) | |
2616 | mark_addressable (TREE_VALUE (tail)); | |
2617 | } | |
2618 | ||
2619 | /* Second pass evaluates arguments. */ | |
2620 | ||
2621 | /* Make sure stack is consistent for asm goto. */ | |
2622 | if (nlabels > 0) | |
2623 | do_pending_stack_adjust (); | |
2624 | ||
2625 | ninout = 0; | |
2626 | for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++) | |
2627 | { | |
2628 | tree val = TREE_VALUE (tail); | |
2629 | tree type = TREE_TYPE (val); | |
2630 | bool is_inout; | |
2631 | bool allows_reg; | |
2632 | bool allows_mem; | |
2633 | rtx op; | |
2634 | bool ok; | |
2635 | ||
2636 | ok = parse_output_constraint (&constraints[i], i, ninputs, | |
2637 | noutputs, &allows_mem, &allows_reg, | |
2638 | &is_inout); | |
2639 | gcc_assert (ok); | |
2640 | ||
2641 | /* If an output operand is not a decl or indirect ref and our constraint | |
2642 | allows a register, make a temporary to act as an intermediate. | |
2643 | Make the asm insn write into that, then our caller will copy it to | |
2644 | the real output operand. Likewise for promoted variables. */ | |
2645 | ||
2646 | generating_concat_p = 0; | |
2647 | ||
2648 | real_output_rtx[i] = NULL_RTX; | |
2649 | if ((TREE_CODE (val) == INDIRECT_REF | |
2650 | && allows_mem) | |
2651 | || (DECL_P (val) | |
2652 | && (allows_mem || REG_P (DECL_RTL (val))) | |
2653 | && ! (REG_P (DECL_RTL (val)) | |
2654 | && GET_MODE (DECL_RTL (val)) != TYPE_MODE (type))) | |
2655 | || ! allows_reg | |
2656 | || is_inout) | |
2657 | { | |
2658 | op = expand_expr (val, NULL_RTX, VOIDmode, | |
2659 | !allows_reg ? EXPAND_MEMORY : EXPAND_WRITE); | |
2660 | if (MEM_P (op)) | |
2661 | op = validize_mem (op); | |
2662 | ||
2663 | if (! allows_reg && !MEM_P (op)) | |
2664 | error ("output number %d not directly addressable", i); | |
2665 | if ((! allows_mem && MEM_P (op)) | |
2666 | || GET_CODE (op) == CONCAT) | |
2667 | { | |
2668 | real_output_rtx[i] = op; | |
2669 | op = gen_reg_rtx (GET_MODE (op)); | |
2670 | if (is_inout) | |
2671 | emit_move_insn (op, real_output_rtx[i]); | |
2672 | } | |
2673 | } | |
2674 | else | |
2675 | { | |
2676 | op = assign_temp (type, 0, 1); | |
2677 | op = validize_mem (op); | |
2678 | if (!MEM_P (op) && TREE_CODE (TREE_VALUE (tail)) == SSA_NAME) | |
2679 | set_reg_attrs_for_decl_rtl (SSA_NAME_VAR (TREE_VALUE (tail)), op); | |
2680 | TREE_VALUE (tail) = make_tree (type, op); | |
2681 | } | |
2682 | output_rtx[i] = op; | |
2683 | ||
2684 | generating_concat_p = old_generating_concat_p; | |
2685 | ||
2686 | if (is_inout) | |
2687 | { | |
2688 | inout_mode[ninout] = TYPE_MODE (type); | |
2689 | inout_opnum[ninout++] = i; | |
2690 | } | |
2691 | ||
2692 | if (tree_conflicts_with_clobbers_p (val, &clobbered_regs)) | |
2693 | clobber_conflict_found = 1; | |
2694 | } | |
2695 | ||
2696 | /* Make vectors for the expression-rtx, constraint strings, | |
2697 | and named operands. */ | |
2698 | ||
2699 | argvec = rtvec_alloc (ninputs); | |
2700 | constraintvec = rtvec_alloc (ninputs); | |
2701 | labelvec = rtvec_alloc (nlabels); | |
2702 | ||
2703 | body = gen_rtx_ASM_OPERANDS ((noutputs == 0 ? VOIDmode | |
2704 | : GET_MODE (output_rtx[0])), | |
2705 | ggc_strdup (TREE_STRING_POINTER (string)), | |
2706 | empty_string, 0, argvec, constraintvec, | |
2707 | labelvec, locus); | |
2708 | ||
2709 | MEM_VOLATILE_P (body) = vol; | |
2710 | ||
2711 | /* Eval the inputs and put them into ARGVEC. | |
2712 | Put their constraints into ASM_INPUTs and store in CONSTRAINTS. */ | |
2713 | ||
2714 | for (i = 0, tail = inputs; tail; tail = TREE_CHAIN (tail), ++i) | |
2715 | { | |
2716 | bool allows_reg, allows_mem; | |
2717 | const char *constraint; | |
2718 | tree val, type; | |
2719 | rtx op; | |
2720 | bool ok; | |
2721 | ||
2722 | constraint = constraints[i + noutputs]; | |
2723 | ok = parse_input_constraint (&constraint, i, ninputs, noutputs, ninout, | |
2724 | constraints, &allows_mem, &allows_reg); | |
2725 | gcc_assert (ok); | |
2726 | ||
2727 | generating_concat_p = 0; | |
2728 | ||
2729 | val = TREE_VALUE (tail); | |
2730 | type = TREE_TYPE (val); | |
2731 | /* EXPAND_INITIALIZER will not generate code for valid initializer | |
2732 | constants, but will still generate code for other types of operand. | |
2733 | This is the behavior we want for constant constraints. */ | |
2734 | op = expand_expr (val, NULL_RTX, VOIDmode, | |
2735 | allows_reg ? EXPAND_NORMAL | |
2736 | : allows_mem ? EXPAND_MEMORY | |
2737 | : EXPAND_INITIALIZER); | |
2738 | ||
2739 | /* Never pass a CONCAT to an ASM. */ | |
2740 | if (GET_CODE (op) == CONCAT) | |
2741 | op = force_reg (GET_MODE (op), op); | |
2742 | else if (MEM_P (op)) | |
2743 | op = validize_mem (op); | |
2744 | ||
2745 | if (asm_operand_ok (op, constraint, NULL) <= 0) | |
2746 | { | |
2747 | if (allows_reg && TYPE_MODE (type) != BLKmode) | |
2748 | op = force_reg (TYPE_MODE (type), op); | |
2749 | else if (!allows_mem) | |
2750 | warning (0, "asm operand %d probably doesn%'t match constraints", | |
2751 | i + noutputs); | |
2752 | else if (MEM_P (op)) | |
2753 | { | |
2754 | /* We won't recognize either volatile memory or memory | |
2755 | with a queued address as available a memory_operand | |
2756 | at this point. Ignore it: clearly this *is* a memory. */ | |
2757 | } | |
2758 | else | |
2759 | gcc_unreachable (); | |
2760 | } | |
2761 | ||
2762 | generating_concat_p = old_generating_concat_p; | |
2763 | ASM_OPERANDS_INPUT (body, i) = op; | |
2764 | ||
2765 | ASM_OPERANDS_INPUT_CONSTRAINT_EXP (body, i) | |
c36804c0 | 2766 | = gen_rtx_ASM_INPUT_loc (TYPE_MODE (type), |
2767 | ggc_strdup (constraints[i + noutputs]), | |
2768 | locus); | |
0e80b01d | 2769 | |
2770 | if (tree_conflicts_with_clobbers_p (val, &clobbered_regs)) | |
2771 | clobber_conflict_found = 1; | |
2772 | } | |
2773 | ||
2774 | /* Protect all the operands from the queue now that they have all been | |
2775 | evaluated. */ | |
2776 | ||
2777 | generating_concat_p = 0; | |
2778 | ||
2779 | /* For in-out operands, copy output rtx to input rtx. */ | |
2780 | for (i = 0; i < ninout; i++) | |
2781 | { | |
2782 | int j = inout_opnum[i]; | |
2783 | char buffer[16]; | |
2784 | ||
2785 | ASM_OPERANDS_INPUT (body, ninputs - ninout + i) | |
2786 | = output_rtx[j]; | |
2787 | ||
2788 | sprintf (buffer, "%d", j); | |
2789 | ASM_OPERANDS_INPUT_CONSTRAINT_EXP (body, ninputs - ninout + i) | |
c36804c0 | 2790 | = gen_rtx_ASM_INPUT_loc (inout_mode[i], ggc_strdup (buffer), locus); |
0e80b01d | 2791 | } |
2792 | ||
2793 | /* Copy labels to the vector. */ | |
2794 | for (i = 0, tail = labels; i < nlabels; ++i, tail = TREE_CHAIN (tail)) | |
2795 | { | |
2796 | rtx r; | |
2797 | /* If asm goto has any labels in the fallthru basic block, use | |
2798 | a label that we emit immediately after the asm goto. Expansion | |
2799 | may insert further instructions into the same basic block after | |
2800 | asm goto and if we don't do this, insertion of instructions on | |
2801 | the fallthru edge might misbehave. See PR58670. */ | |
2802 | if (fallthru_bb | |
2803 | && label_to_block_fn (cfun, TREE_VALUE (tail)) == fallthru_bb) | |
2804 | { | |
2805 | if (fallthru_label == NULL_RTX) | |
2806 | fallthru_label = gen_label_rtx (); | |
2807 | r = fallthru_label; | |
2808 | } | |
2809 | else | |
2810 | r = label_rtx (TREE_VALUE (tail)); | |
2811 | ASM_OPERANDS_LABEL (body, i) = gen_rtx_LABEL_REF (Pmode, r); | |
2812 | } | |
2813 | ||
2814 | generating_concat_p = old_generating_concat_p; | |
2815 | ||
2816 | /* Now, for each output, construct an rtx | |
2817 | (set OUTPUT (asm_operands INSN OUTPUTCONSTRAINT OUTPUTNUMBER | |
2818 | ARGVEC CONSTRAINTS OPNAMES)) | |
2819 | If there is more than one, put them inside a PARALLEL. */ | |
2820 | ||
2821 | if (nlabels > 0 && nclobbers == 0) | |
2822 | { | |
2823 | gcc_assert (noutputs == 0); | |
2824 | emit_jump_insn (body); | |
2825 | } | |
2826 | else if (noutputs == 0 && nclobbers == 0) | |
2827 | { | |
2828 | /* No output operands: put in a raw ASM_OPERANDS rtx. */ | |
2829 | emit_insn (body); | |
2830 | } | |
2831 | else if (noutputs == 1 && nclobbers == 0) | |
2832 | { | |
2833 | ASM_OPERANDS_OUTPUT_CONSTRAINT (body) = ggc_strdup (constraints[0]); | |
2834 | emit_insn (gen_rtx_SET (VOIDmode, output_rtx[0], body)); | |
2835 | } | |
2836 | else | |
2837 | { | |
2838 | rtx obody = body; | |
2839 | int num = noutputs; | |
2840 | ||
2841 | if (num == 0) | |
2842 | num = 1; | |
2843 | ||
2844 | body = gen_rtx_PARALLEL (VOIDmode, rtvec_alloc (num + nclobbers)); | |
2845 | ||
2846 | /* For each output operand, store a SET. */ | |
2847 | for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++) | |
2848 | { | |
2849 | XVECEXP (body, 0, i) | |
2850 | = gen_rtx_SET (VOIDmode, | |
2851 | output_rtx[i], | |
2852 | gen_rtx_ASM_OPERANDS | |
2853 | (GET_MODE (output_rtx[i]), | |
2854 | ggc_strdup (TREE_STRING_POINTER (string)), | |
2855 | ggc_strdup (constraints[i]), | |
2856 | i, argvec, constraintvec, labelvec, locus)); | |
2857 | ||
2858 | MEM_VOLATILE_P (SET_SRC (XVECEXP (body, 0, i))) = vol; | |
2859 | } | |
2860 | ||
2861 | /* If there are no outputs (but there are some clobbers) | |
2862 | store the bare ASM_OPERANDS into the PARALLEL. */ | |
2863 | ||
2864 | if (i == 0) | |
2865 | XVECEXP (body, 0, i++) = obody; | |
2866 | ||
2867 | /* Store (clobber REG) for each clobbered register specified. */ | |
2868 | ||
2869 | for (tail = clobbers; tail; tail = TREE_CHAIN (tail)) | |
2870 | { | |
2871 | const char *regname = TREE_STRING_POINTER (TREE_VALUE (tail)); | |
2872 | int reg, nregs; | |
2873 | int j = decode_reg_name_and_count (regname, &nregs); | |
2874 | rtx clobbered_reg; | |
2875 | ||
2876 | if (j < 0) | |
2877 | { | |
2878 | if (j == -3) /* `cc', which is not a register */ | |
2879 | continue; | |
2880 | ||
2881 | if (j == -4) /* `memory', don't cache memory across asm */ | |
2882 | { | |
2883 | XVECEXP (body, 0, i++) | |
2884 | = gen_rtx_CLOBBER (VOIDmode, | |
2885 | gen_rtx_MEM | |
2886 | (BLKmode, | |
2887 | gen_rtx_SCRATCH (VOIDmode))); | |
2888 | continue; | |
2889 | } | |
2890 | ||
2891 | /* Ignore unknown register, error already signaled. */ | |
2892 | continue; | |
2893 | } | |
2894 | ||
2895 | for (reg = j; reg < j + nregs; reg++) | |
2896 | { | |
2897 | /* Use QImode since that's guaranteed to clobber just | |
2898 | * one reg. */ | |
2899 | clobbered_reg = gen_rtx_REG (QImode, reg); | |
2900 | ||
2901 | /* Do sanity check for overlap between clobbers and | |
2902 | respectively input and outputs that hasn't been | |
2903 | handled. Such overlap should have been detected and | |
2904 | reported above. */ | |
2905 | if (!clobber_conflict_found) | |
2906 | { | |
2907 | int opno; | |
2908 | ||
2909 | /* We test the old body (obody) contents to avoid | |
2910 | tripping over the under-construction body. */ | |
2911 | for (opno = 0; opno < noutputs; opno++) | |
2912 | if (reg_overlap_mentioned_p (clobbered_reg, | |
2913 | output_rtx[opno])) | |
2914 | internal_error | |
2915 | ("asm clobber conflict with output operand"); | |
2916 | ||
2917 | for (opno = 0; opno < ninputs - ninout; opno++) | |
2918 | if (reg_overlap_mentioned_p (clobbered_reg, | |
2919 | ASM_OPERANDS_INPUT (obody, | |
2920 | opno))) | |
2921 | internal_error | |
2922 | ("asm clobber conflict with input operand"); | |
2923 | } | |
2924 | ||
2925 | XVECEXP (body, 0, i++) | |
2926 | = gen_rtx_CLOBBER (VOIDmode, clobbered_reg); | |
2927 | } | |
2928 | } | |
2929 | ||
2930 | if (nlabels > 0) | |
2931 | emit_jump_insn (body); | |
2932 | else | |
2933 | emit_insn (body); | |
2934 | } | |
2935 | ||
2936 | if (fallthru_label) | |
2937 | emit_label (fallthru_label); | |
2938 | ||
2939 | /* For any outputs that needed reloading into registers, spill them | |
2940 | back to where they belong. */ | |
2941 | for (i = 0; i < noutputs; ++i) | |
2942 | if (real_output_rtx[i]) | |
2943 | emit_move_insn (real_output_rtx[i], output_rtx[i]); | |
2944 | ||
2945 | crtl->has_asm_statement = 1; | |
2946 | free_temp_slots (); | |
2947 | } | |
2948 | ||
2949 | ||
2950 | static void | |
1a91d914 | 2951 | expand_asm_stmt (gasm *stmt) |
0e80b01d | 2952 | { |
2953 | int noutputs; | |
2954 | tree outputs, tail, t; | |
2955 | tree *o; | |
2956 | size_t i, n; | |
2957 | const char *s; | |
2958 | tree str, out, in, cl, labels; | |
2959 | location_t locus = gimple_location (stmt); | |
2960 | basic_block fallthru_bb = NULL; | |
2961 | ||
2962 | /* Meh... convert the gimple asm operands into real tree lists. | |
2963 | Eventually we should make all routines work on the vectors instead | |
2964 | of relying on TREE_CHAIN. */ | |
2965 | out = NULL_TREE; | |
2966 | n = gimple_asm_noutputs (stmt); | |
2967 | if (n > 0) | |
2968 | { | |
2969 | t = out = gimple_asm_output_op (stmt, 0); | |
2970 | for (i = 1; i < n; i++) | |
2971 | t = TREE_CHAIN (t) = gimple_asm_output_op (stmt, i); | |
2972 | } | |
2973 | ||
2974 | in = NULL_TREE; | |
2975 | n = gimple_asm_ninputs (stmt); | |
2976 | if (n > 0) | |
2977 | { | |
2978 | t = in = gimple_asm_input_op (stmt, 0); | |
2979 | for (i = 1; i < n; i++) | |
2980 | t = TREE_CHAIN (t) = gimple_asm_input_op (stmt, i); | |
2981 | } | |
2982 | ||
2983 | cl = NULL_TREE; | |
2984 | n = gimple_asm_nclobbers (stmt); | |
2985 | if (n > 0) | |
2986 | { | |
2987 | t = cl = gimple_asm_clobber_op (stmt, 0); | |
2988 | for (i = 1; i < n; i++) | |
2989 | t = TREE_CHAIN (t) = gimple_asm_clobber_op (stmt, i); | |
2990 | } | |
2991 | ||
2992 | labels = NULL_TREE; | |
2993 | n = gimple_asm_nlabels (stmt); | |
2994 | if (n > 0) | |
2995 | { | |
2996 | edge fallthru = find_fallthru_edge (gimple_bb (stmt)->succs); | |
2997 | if (fallthru) | |
2998 | fallthru_bb = fallthru->dest; | |
2999 | t = labels = gimple_asm_label_op (stmt, 0); | |
3000 | for (i = 1; i < n; i++) | |
3001 | t = TREE_CHAIN (t) = gimple_asm_label_op (stmt, i); | |
3002 | } | |
3003 | ||
3004 | s = gimple_asm_string (stmt); | |
3005 | str = build_string (strlen (s), s); | |
3006 | ||
3007 | if (gimple_asm_input_p (stmt)) | |
3008 | { | |
3009 | expand_asm_loc (str, gimple_asm_volatile_p (stmt), locus); | |
3010 | return; | |
3011 | } | |
3012 | ||
3013 | outputs = out; | |
3014 | noutputs = gimple_asm_noutputs (stmt); | |
3015 | /* o[I] is the place that output number I should be written. */ | |
3016 | o = (tree *) alloca (noutputs * sizeof (tree)); | |
3017 | ||
3018 | /* Record the contents of OUTPUTS before it is modified. */ | |
3019 | for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++) | |
3020 | o[i] = TREE_VALUE (tail); | |
3021 | ||
3022 | /* Generate the ASM_OPERANDS insn; store into the TREE_VALUEs of | |
3023 | OUTPUTS some trees for where the values were actually stored. */ | |
3024 | expand_asm_operands (str, outputs, in, cl, labels, fallthru_bb, | |
3025 | gimple_asm_volatile_p (stmt), locus); | |
3026 | ||
3027 | /* Copy all the intermediate outputs into the specified outputs. */ | |
3028 | for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++) | |
3029 | { | |
3030 | if (o[i] != TREE_VALUE (tail)) | |
3031 | { | |
3032 | expand_assignment (o[i], TREE_VALUE (tail), false); | |
3033 | free_temp_slots (); | |
3034 | ||
3035 | /* Restore the original value so that it's correct the next | |
3036 | time we expand this function. */ | |
3037 | TREE_VALUE (tail) = o[i]; | |
3038 | } | |
3039 | } | |
3040 | } | |
3041 | ||
3042 | /* Emit code to jump to the address | |
3043 | specified by the pointer expression EXP. */ | |
3044 | ||
3045 | static void | |
3046 | expand_computed_goto (tree exp) | |
3047 | { | |
3048 | rtx x = expand_normal (exp); | |
3049 | ||
3050 | x = convert_memory_address (Pmode, x); | |
3051 | ||
3052 | do_pending_stack_adjust (); | |
3053 | emit_indirect_jump (x); | |
3054 | } | |
3055 | ||
3056 | /* Generate RTL code for a `goto' statement with target label LABEL. | |
3057 | LABEL should be a LABEL_DECL tree node that was or will later be | |
3058 | defined with `expand_label'. */ | |
3059 | ||
3060 | static void | |
3061 | expand_goto (tree label) | |
3062 | { | |
3063 | #ifdef ENABLE_CHECKING | |
3064 | /* Check for a nonlocal goto to a containing function. Should have | |
3065 | gotten translated to __builtin_nonlocal_goto. */ | |
3066 | tree context = decl_function_context (label); | |
3067 | gcc_assert (!context || context == current_function_decl); | |
3068 | #endif | |
3069 | ||
3070 | emit_jump (label_rtx (label)); | |
3071 | } | |
3072 | ||
3073 | /* Output a return with no value. */ | |
3074 | ||
3075 | static void | |
3076 | expand_null_return_1 (void) | |
3077 | { | |
3078 | clear_pending_stack_adjust (); | |
3079 | do_pending_stack_adjust (); | |
3080 | emit_jump (return_label); | |
3081 | } | |
3082 | ||
3083 | /* Generate RTL to return from the current function, with no value. | |
3084 | (That is, we do not do anything about returning any value.) */ | |
3085 | ||
3086 | void | |
3087 | expand_null_return (void) | |
3088 | { | |
3089 | /* If this function was declared to return a value, but we | |
3090 | didn't, clobber the return registers so that they are not | |
3091 | propagated live to the rest of the function. */ | |
3092 | clobber_return_register (); | |
3093 | ||
3094 | expand_null_return_1 (); | |
3095 | } | |
3096 | ||
3097 | /* Generate RTL to return from the current function, with value VAL. */ | |
3098 | ||
3099 | static void | |
3100 | expand_value_return (rtx val) | |
3101 | { | |
3102 | /* Copy the value to the return location unless it's already there. */ | |
3103 | ||
3104 | tree decl = DECL_RESULT (current_function_decl); | |
3105 | rtx return_reg = DECL_RTL (decl); | |
3106 | if (return_reg != val) | |
3107 | { | |
3108 | tree funtype = TREE_TYPE (current_function_decl); | |
3109 | tree type = TREE_TYPE (decl); | |
3110 | int unsignedp = TYPE_UNSIGNED (type); | |
3754d046 | 3111 | machine_mode old_mode = DECL_MODE (decl); |
3112 | machine_mode mode; | |
0e80b01d | 3113 | if (DECL_BY_REFERENCE (decl)) |
3114 | mode = promote_function_mode (type, old_mode, &unsignedp, funtype, 2); | |
3115 | else | |
3116 | mode = promote_function_mode (type, old_mode, &unsignedp, funtype, 1); | |
3117 | ||
3118 | if (mode != old_mode) | |
3119 | val = convert_modes (mode, old_mode, val, unsignedp); | |
3120 | ||
3121 | if (GET_CODE (return_reg) == PARALLEL) | |
3122 | emit_group_load (return_reg, val, type, int_size_in_bytes (type)); | |
3123 | else | |
3124 | emit_move_insn (return_reg, val); | |
3125 | } | |
3126 | ||
3127 | expand_null_return_1 (); | |
3128 | } | |
3129 | ||
3130 | /* Generate RTL to evaluate the expression RETVAL and return it | |
3131 | from the current function. */ | |
3132 | ||
3133 | static void | |
058a1b7a | 3134 | expand_return (tree retval, tree bounds) |
0e80b01d | 3135 | { |
3136 | rtx result_rtl; | |
3137 | rtx val = 0; | |
3138 | tree retval_rhs; | |
058a1b7a | 3139 | rtx bounds_rtl; |
0e80b01d | 3140 | |
3141 | /* If function wants no value, give it none. */ | |
3142 | if (TREE_CODE (TREE_TYPE (TREE_TYPE (current_function_decl))) == VOID_TYPE) | |
3143 | { | |
3144 | expand_normal (retval); | |
3145 | expand_null_return (); | |
3146 | return; | |
3147 | } | |
3148 | ||
3149 | if (retval == error_mark_node) | |
3150 | { | |
3151 | /* Treat this like a return of no value from a function that | |
3152 | returns a value. */ | |
3153 | expand_null_return (); | |
3154 | return; | |
3155 | } | |
3156 | else if ((TREE_CODE (retval) == MODIFY_EXPR | |
3157 | || TREE_CODE (retval) == INIT_EXPR) | |
3158 | && TREE_CODE (TREE_OPERAND (retval, 0)) == RESULT_DECL) | |
3159 | retval_rhs = TREE_OPERAND (retval, 1); | |
3160 | else | |
3161 | retval_rhs = retval; | |
3162 | ||
3163 | result_rtl = DECL_RTL (DECL_RESULT (current_function_decl)); | |
3164 | ||
058a1b7a | 3165 | /* Put returned bounds to the right place. */ |
3166 | bounds_rtl = DECL_BOUNDS_RTL (DECL_RESULT (current_function_decl)); | |
3167 | if (bounds_rtl) | |
3168 | { | |
3169 | rtx addr, bnd; | |
3170 | ||
3171 | if (bounds) | |
3172 | { | |
3173 | bnd = expand_normal (bounds); | |
3174 | targetm.calls.store_returned_bounds (bounds_rtl, bnd); | |
3175 | } | |
3176 | else if (REG_P (bounds_rtl)) | |
3177 | { | |
3178 | addr = expand_normal (build_fold_addr_expr (retval_rhs)); | |
3179 | addr = gen_rtx_MEM (Pmode, addr); | |
3180 | bnd = targetm.calls.load_bounds_for_arg (addr, NULL, NULL); | |
3181 | targetm.calls.store_returned_bounds (bounds_rtl, bnd); | |
3182 | } | |
3183 | else | |
3184 | { | |
3185 | int n; | |
3186 | ||
3187 | gcc_assert (GET_CODE (bounds_rtl) == PARALLEL); | |
3188 | ||
3189 | addr = expand_normal (build_fold_addr_expr (retval_rhs)); | |
3190 | addr = gen_rtx_MEM (Pmode, addr); | |
3191 | ||
3192 | for (n = 0; n < XVECLEN (bounds_rtl, 0); n++) | |
3193 | { | |
3194 | rtx offs = XEXP (XVECEXP (bounds_rtl, 0, n), 1); | |
3195 | rtx slot = XEXP (XVECEXP (bounds_rtl, 0, n), 0); | |
3196 | rtx from = adjust_address (addr, Pmode, INTVAL (offs)); | |
3197 | rtx bnd = targetm.calls.load_bounds_for_arg (from, NULL, NULL); | |
3198 | targetm.calls.store_returned_bounds (slot, bnd); | |
3199 | } | |
3200 | } | |
3201 | } | |
3202 | else if (chkp_function_instrumented_p (current_function_decl) | |
3203 | && !BOUNDED_P (retval_rhs) | |
3204 | && chkp_type_has_pointer (TREE_TYPE (retval_rhs)) | |
3205 | && TREE_CODE (retval_rhs) != RESULT_DECL) | |
3206 | { | |
3207 | rtx addr = expand_normal (build_fold_addr_expr (retval_rhs)); | |
3208 | addr = gen_rtx_MEM (Pmode, addr); | |
3209 | ||
3210 | gcc_assert (MEM_P (result_rtl)); | |
3211 | ||
3212 | chkp_copy_bounds_for_stack_parm (result_rtl, addr, TREE_TYPE (retval_rhs)); | |
3213 | } | |
3214 | ||
0e80b01d | 3215 | /* If we are returning the RESULT_DECL, then the value has already |
3216 | been stored into it, so we don't have to do anything special. */ | |
3217 | if (TREE_CODE (retval_rhs) == RESULT_DECL) | |
3218 | expand_value_return (result_rtl); | |
3219 | ||
3220 | /* If the result is an aggregate that is being returned in one (or more) | |
3221 | registers, load the registers here. */ | |
3222 | ||
3223 | else if (retval_rhs != 0 | |
3224 | && TYPE_MODE (TREE_TYPE (retval_rhs)) == BLKmode | |
3225 | && REG_P (result_rtl)) | |
3226 | { | |
3227 | val = copy_blkmode_to_reg (GET_MODE (result_rtl), retval_rhs); | |
3228 | if (val) | |
3229 | { | |
3230 | /* Use the mode of the result value on the return register. */ | |
3231 | PUT_MODE (result_rtl, GET_MODE (val)); | |
3232 | expand_value_return (val); | |
3233 | } | |
3234 | else | |
3235 | expand_null_return (); | |
3236 | } | |
3237 | else if (retval_rhs != 0 | |
3238 | && !VOID_TYPE_P (TREE_TYPE (retval_rhs)) | |
3239 | && (REG_P (result_rtl) | |
3240 | || (GET_CODE (result_rtl) == PARALLEL))) | |
3241 | { | |
9f495e8d | 3242 | /* Compute the return value into a temporary (usually a pseudo reg). */ |
3243 | val | |
3244 | = assign_temp (TREE_TYPE (DECL_RESULT (current_function_decl)), 0, 1); | |
0e80b01d | 3245 | val = expand_expr (retval_rhs, val, GET_MODE (val), EXPAND_NORMAL); |
3246 | val = force_not_mem (val); | |
0e80b01d | 3247 | expand_value_return (val); |
3248 | } | |
3249 | else | |
3250 | { | |
3251 | /* No hard reg used; calculate value into hard return reg. */ | |
3252 | expand_expr (retval, const0_rtx, VOIDmode, EXPAND_NORMAL); | |
3253 | expand_value_return (result_rtl); | |
3254 | } | |
3255 | } | |
3256 | ||
16c9337c | 3257 | /* A subroutine of expand_gimple_stmt, expanding one gimple statement |
3258 | STMT that doesn't require special handling for outgoing edges. That | |
3259 | is no tailcalls and no GIMPLE_COND. */ | |
3260 | ||
3261 | static void | |
3262 | expand_gimple_stmt_1 (gimple stmt) | |
3263 | { | |
3264 | tree op0; | |
8c593757 | 3265 | |
5169661d | 3266 | set_curr_insn_location (gimple_location (stmt)); |
8c593757 | 3267 | |
16c9337c | 3268 | switch (gimple_code (stmt)) |
3269 | { | |
3270 | case GIMPLE_GOTO: | |
3271 | op0 = gimple_goto_dest (stmt); | |
3272 | if (TREE_CODE (op0) == LABEL_DECL) | |
3273 | expand_goto (op0); | |
3274 | else | |
3275 | expand_computed_goto (op0); | |
3276 | break; | |
3277 | case GIMPLE_LABEL: | |
1a91d914 | 3278 | expand_label (gimple_label_label (as_a <glabel *> (stmt))); |
16c9337c | 3279 | break; |
3280 | case GIMPLE_NOP: | |
3281 | case GIMPLE_PREDICT: | |
3282 | break; | |
16c9337c | 3283 | case GIMPLE_SWITCH: |
1a91d914 | 3284 | expand_case (as_a <gswitch *> (stmt)); |
16c9337c | 3285 | break; |
3286 | case GIMPLE_ASM: | |
1a91d914 | 3287 | expand_asm_stmt (as_a <gasm *> (stmt)); |
16c9337c | 3288 | break; |
3289 | case GIMPLE_CALL: | |
1a91d914 | 3290 | expand_call_stmt (as_a <gcall *> (stmt)); |
16c9337c | 3291 | break; |
3292 | ||
3293 | case GIMPLE_RETURN: | |
1a91d914 | 3294 | op0 = gimple_return_retval (as_a <greturn *> (stmt)); |
16c9337c | 3295 | |
3296 | if (op0 && op0 != error_mark_node) | |
3297 | { | |
3298 | tree result = DECL_RESULT (current_function_decl); | |
3299 | ||
3300 | /* If we are not returning the current function's RESULT_DECL, | |
3301 | build an assignment to it. */ | |
3302 | if (op0 != result) | |
3303 | { | |
3304 | /* I believe that a function's RESULT_DECL is unique. */ | |
3305 | gcc_assert (TREE_CODE (op0) != RESULT_DECL); | |
3306 | ||
3307 | /* ??? We'd like to use simply expand_assignment here, | |
3308 | but this fails if the value is of BLKmode but the return | |
3309 | decl is a register. expand_return has special handling | |
3310 | for this combination, which eventually should move | |
3311 | to common code. See comments there. Until then, let's | |
3312 | build a modify expression :-/ */ | |
3313 | op0 = build2 (MODIFY_EXPR, TREE_TYPE (result), | |
3314 | result, op0); | |
3315 | } | |
3316 | } | |
3317 | if (!op0) | |
3318 | expand_null_return (); | |
3319 | else | |
058a1b7a | 3320 | expand_return (op0, gimple_return_retbnd (stmt)); |
16c9337c | 3321 | break; |
3322 | ||
3323 | case GIMPLE_ASSIGN: | |
3324 | { | |
1a91d914 | 3325 | gassign *assign_stmt = as_a <gassign *> (stmt); |
3326 | tree lhs = gimple_assign_lhs (assign_stmt); | |
16c9337c | 3327 | |
3328 | /* Tree expand used to fiddle with |= and &= of two bitfield | |
3329 | COMPONENT_REFs here. This can't happen with gimple, the LHS | |
3330 | of binary assigns must be a gimple reg. */ | |
3331 | ||
3332 | if (TREE_CODE (lhs) != SSA_NAME | |
3333 | || get_gimple_rhs_class (gimple_expr_code (stmt)) | |
3334 | == GIMPLE_SINGLE_RHS) | |
3335 | { | |
1a91d914 | 3336 | tree rhs = gimple_assign_rhs1 (assign_stmt); |
16c9337c | 3337 | gcc_assert (get_gimple_rhs_class (gimple_expr_code (stmt)) |
3338 | == GIMPLE_SINGLE_RHS); | |
3339 | if (gimple_has_location (stmt) && CAN_HAVE_LOCATION_P (rhs)) | |
3340 | SET_EXPR_LOCATION (rhs, gimple_location (stmt)); | |
3c25489e | 3341 | if (TREE_CLOBBER_P (rhs)) |
3342 | /* This is a clobber to mark the going out of scope for | |
3343 | this LHS. */ | |
3344 | ; | |
3345 | else | |
3346 | expand_assignment (lhs, rhs, | |
1a91d914 | 3347 | gimple_assign_nontemporal_move_p ( |
3348 | assign_stmt)); | |
16c9337c | 3349 | } |
3350 | else | |
3351 | { | |
3352 | rtx target, temp; | |
1a91d914 | 3353 | bool nontemporal = gimple_assign_nontemporal_move_p (assign_stmt); |
16c9337c | 3354 | struct separate_ops ops; |
3355 | bool promoted = false; | |
3356 | ||
3357 | target = expand_expr (lhs, NULL_RTX, VOIDmode, EXPAND_WRITE); | |
3358 | if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target)) | |
3359 | promoted = true; | |
3360 | ||
1a91d914 | 3361 | ops.code = gimple_assign_rhs_code (assign_stmt); |
16c9337c | 3362 | ops.type = TREE_TYPE (lhs); |
3363 | switch (get_gimple_rhs_class (gimple_expr_code (stmt))) | |
3364 | { | |
00f4f705 | 3365 | case GIMPLE_TERNARY_RHS: |
1a91d914 | 3366 | ops.op2 = gimple_assign_rhs3 (assign_stmt); |
00f4f705 | 3367 | /* Fallthru */ |
16c9337c | 3368 | case GIMPLE_BINARY_RHS: |
1a91d914 | 3369 | ops.op1 = gimple_assign_rhs2 (assign_stmt); |
16c9337c | 3370 | /* Fallthru */ |
3371 | case GIMPLE_UNARY_RHS: | |
1a91d914 | 3372 | ops.op0 = gimple_assign_rhs1 (assign_stmt); |
16c9337c | 3373 | break; |
3374 | default: | |
3375 | gcc_unreachable (); | |
3376 | } | |
3377 | ops.location = gimple_location (stmt); | |
3378 | ||
3379 | /* If we want to use a nontemporal store, force the value to | |
3380 | register first. If we store into a promoted register, | |
3381 | don't directly expand to target. */ | |
3382 | temp = nontemporal || promoted ? NULL_RTX : target; | |
3383 | temp = expand_expr_real_2 (&ops, temp, GET_MODE (target), | |
3384 | EXPAND_NORMAL); | |
3385 | ||
3386 | if (temp == target) | |
3387 | ; | |
3388 | else if (promoted) | |
3389 | { | |
e8629f9e | 3390 | int unsignedp = SUBREG_PROMOTED_SIGN (target); |
16c9337c | 3391 | /* If TEMP is a VOIDmode constant, use convert_modes to make |
3392 | sure that we properly convert it. */ | |
3393 | if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode) | |
3394 | { | |
3395 | temp = convert_modes (GET_MODE (target), | |
3396 | TYPE_MODE (ops.type), | |
088c4b7b | 3397 | temp, unsignedp); |
16c9337c | 3398 | temp = convert_modes (GET_MODE (SUBREG_REG (target)), |
088c4b7b | 3399 | GET_MODE (target), temp, unsignedp); |
16c9337c | 3400 | } |
3401 | ||
5a9ccd1b | 3402 | convert_move (SUBREG_REG (target), temp, unsignedp); |
16c9337c | 3403 | } |
3404 | else if (nontemporal && emit_storent_insn (target, temp)) | |
3405 | ; | |
3406 | else | |
3407 | { | |
3408 | temp = force_operand (temp, target); | |
3409 | if (temp != target) | |
3410 | emit_move_insn (target, temp); | |
3411 | } | |
3412 | } | |
3413 | } | |
3414 | break; | |
3415 | ||
3416 | default: | |
3417 | gcc_unreachable (); | |
3418 | } | |
3419 | } | |
3420 | ||
3421 | /* Expand one gimple statement STMT and return the last RTL instruction | |
3422 | before any of the newly generated ones. | |
3423 | ||
3424 | In addition to generating the necessary RTL instructions this also | |
3425 | sets REG_EH_REGION notes if necessary and sets the current source | |
3426 | location for diagnostics. */ | |
3427 | ||
74a0cbc4 | 3428 | static rtx_insn * |
16c9337c | 3429 | expand_gimple_stmt (gimple stmt) |
3430 | { | |
16c9337c | 3431 | location_t saved_location = input_location; |
74a0cbc4 | 3432 | rtx_insn *last = get_last_insn (); |
8c593757 | 3433 | int lp_nr; |
16c9337c | 3434 | |
16c9337c | 3435 | gcc_assert (cfun); |
3436 | ||
8c593757 | 3437 | /* We need to save and restore the current source location so that errors |
3438 | discovered during expansion are emitted with the right location. But | |
3439 | it would be better if the diagnostic routines used the source location | |
3440 | embedded in the tree nodes rather than globals. */ | |
16c9337c | 3441 | if (gimple_has_location (stmt)) |
8c593757 | 3442 | input_location = gimple_location (stmt); |
16c9337c | 3443 | |
3444 | expand_gimple_stmt_1 (stmt); | |
8c593757 | 3445 | |
16c9337c | 3446 | /* Free any temporaries used to evaluate this statement. */ |
3447 | free_temp_slots (); | |
3448 | ||
3449 | input_location = saved_location; | |
3450 | ||
3451 | /* Mark all insns that may trap. */ | |
e38def9c | 3452 | lp_nr = lookup_stmt_eh_lp (stmt); |
3453 | if (lp_nr) | |
16c9337c | 3454 | { |
74a0cbc4 | 3455 | rtx_insn *insn; |
16c9337c | 3456 | for (insn = next_real_insn (last); insn; |
3457 | insn = next_real_insn (insn)) | |
3458 | { | |
3459 | if (! find_reg_note (insn, REG_EH_REGION, NULL_RTX) | |
3460 | /* If we want exceptions for non-call insns, any | |
3461 | may_trap_p instruction may throw. */ | |
3462 | && GET_CODE (PATTERN (insn)) != CLOBBER | |
3463 | && GET_CODE (PATTERN (insn)) != USE | |
e38def9c | 3464 | && insn_could_throw_p (insn)) |
3465 | make_reg_eh_region_note (insn, 0, lp_nr); | |
16c9337c | 3466 | } |
3467 | } | |
3468 | ||
3469 | return last; | |
3470 | } | |
3471 | ||
75a70cf9 | 3472 | /* A subroutine of expand_gimple_basic_block. Expand one GIMPLE_CALL |
17ceb1d5 | 3473 | that has CALL_EXPR_TAILCALL set. Returns non-null if we actually |
3474 | generated a tail call (something that might be denied by the ABI | |
c578459e | 3475 | rules governing the call; see calls.c). |
3476 | ||
3477 | Sets CAN_FALLTHRU if we generated a *conditional* tail call, and | |
3478 | can still reach the rest of BB. The case here is __builtin_sqrt, | |
3479 | where the NaN result goes through the external function (with a | |
3480 | tailcall) and the normal result happens via a sqrt instruction. */ | |
3ced8962 | 3481 | |
3482 | static basic_block | |
1a91d914 | 3483 | expand_gimple_tailcall (basic_block bb, gcall *stmt, bool *can_fallthru) |
3ced8962 | 3484 | { |
74a0cbc4 | 3485 | rtx_insn *last2, *last; |
17ceb1d5 | 3486 | edge e; |
cd665a06 | 3487 | edge_iterator ei; |
17ceb1d5 | 3488 | int probability; |
3489 | gcov_type count; | |
3ced8962 | 3490 | |
16c9337c | 3491 | last2 = last = expand_gimple_stmt (stmt); |
3ced8962 | 3492 | |
3493 | for (last = NEXT_INSN (last); last; last = NEXT_INSN (last)) | |
17ceb1d5 | 3494 | if (CALL_P (last) && SIBLING_CALL_P (last)) |
3495 | goto found; | |
3ced8962 | 3496 | |
75a70cf9 | 3497 | maybe_dump_rtl_for_gimple_stmt (stmt, last2); |
49377e21 | 3498 | |
c578459e | 3499 | *can_fallthru = true; |
17ceb1d5 | 3500 | return NULL; |
3ced8962 | 3501 | |
17ceb1d5 | 3502 | found: |
3503 | /* ??? Wouldn't it be better to just reset any pending stack adjust? | |
3504 | Any instructions emitted here are about to be deleted. */ | |
3505 | do_pending_stack_adjust (); | |
3506 | ||
3507 | /* Remove any non-eh, non-abnormal edges that don't go to exit. */ | |
3508 | /* ??? I.e. the fallthrough edge. HOWEVER! If there were to be | |
3509 | EH or abnormal edges, we shouldn't have created a tail call in | |
3510 | the first place. So it seems to me we should just be removing | |
3511 | all edges here, or redirecting the existing fallthru edge to | |
3512 | the exit block. */ | |
3513 | ||
17ceb1d5 | 3514 | probability = 0; |
3515 | count = 0; | |
17ceb1d5 | 3516 | |
cd665a06 | 3517 | for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) |
3518 | { | |
17ceb1d5 | 3519 | if (!(e->flags & (EDGE_ABNORMAL | EDGE_EH))) |
3520 | { | |
34154e27 | 3521 | if (e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun)) |
3ced8962 | 3522 | { |
17ceb1d5 | 3523 | e->dest->count -= e->count; |
3524 | e->dest->frequency -= EDGE_FREQUENCY (e); | |
3525 | if (e->dest->count < 0) | |
a0c938f0 | 3526 | e->dest->count = 0; |
17ceb1d5 | 3527 | if (e->dest->frequency < 0) |
a0c938f0 | 3528 | e->dest->frequency = 0; |
3ced8962 | 3529 | } |
17ceb1d5 | 3530 | count += e->count; |
3531 | probability += e->probability; | |
3532 | remove_edge (e); | |
3ced8962 | 3533 | } |
cd665a06 | 3534 | else |
3535 | ei_next (&ei); | |
3ced8962 | 3536 | } |
3537 | ||
17ceb1d5 | 3538 | /* This is somewhat ugly: the call_expr expander often emits instructions |
3539 | after the sibcall (to perform the function return). These confuse the | |
794d8e3f | 3540 | find_many_sub_basic_blocks code, so we need to get rid of these. */ |
17ceb1d5 | 3541 | last = NEXT_INSN (last); |
cc636d56 | 3542 | gcc_assert (BARRIER_P (last)); |
c578459e | 3543 | |
3544 | *can_fallthru = false; | |
17ceb1d5 | 3545 | while (NEXT_INSN (last)) |
3546 | { | |
3547 | /* For instance an sqrt builtin expander expands if with | |
3548 | sibcall in the then and label for `else`. */ | |
3549 | if (LABEL_P (NEXT_INSN (last))) | |
c578459e | 3550 | { |
3551 | *can_fallthru = true; | |
3552 | break; | |
3553 | } | |
17ceb1d5 | 3554 | delete_insn (NEXT_INSN (last)); |
3555 | } | |
3556 | ||
34154e27 | 3557 | e = make_edge (bb, EXIT_BLOCK_PTR_FOR_FN (cfun), EDGE_ABNORMAL |
3558 | | EDGE_SIBCALL); | |
17ceb1d5 | 3559 | e->probability += probability; |
3560 | e->count += count; | |
26bb3cb2 | 3561 | BB_END (bb) = last; |
17ceb1d5 | 3562 | update_bb_for_insn (bb); |
3563 | ||
3564 | if (NEXT_INSN (last)) | |
3565 | { | |
3566 | bb = create_basic_block (NEXT_INSN (last), get_last_insn (), bb); | |
3567 | ||
3568 | last = BB_END (bb); | |
3569 | if (BARRIER_P (last)) | |
26bb3cb2 | 3570 | BB_END (bb) = PREV_INSN (last); |
17ceb1d5 | 3571 | } |
3572 | ||
75a70cf9 | 3573 | maybe_dump_rtl_for_gimple_stmt (stmt, last2); |
49377e21 | 3574 | |
17ceb1d5 | 3575 | return bb; |
3ced8962 | 3576 | } |
3577 | ||
9845d120 | 3578 | /* Return the difference between the floor and the truncated result of |
3579 | a signed division by OP1 with remainder MOD. */ | |
3580 | static rtx | |
3754d046 | 3581 | floor_sdiv_adjust (machine_mode mode, rtx mod, rtx op1) |
9845d120 | 3582 | { |
3583 | /* (mod != 0 ? (op1 / mod < 0 ? -1 : 0) : 0) */ | |
3584 | return gen_rtx_IF_THEN_ELSE | |
3585 | (mode, gen_rtx_NE (BImode, mod, const0_rtx), | |
3586 | gen_rtx_IF_THEN_ELSE | |
3587 | (mode, gen_rtx_LT (BImode, | |
3588 | gen_rtx_DIV (mode, op1, mod), | |
3589 | const0_rtx), | |
3590 | constm1_rtx, const0_rtx), | |
3591 | const0_rtx); | |
3592 | } | |
3593 | ||
3594 | /* Return the difference between the ceil and the truncated result of | |
3595 | a signed division by OP1 with remainder MOD. */ | |
3596 | static rtx | |
3754d046 | 3597 | ceil_sdiv_adjust (machine_mode mode, rtx mod, rtx op1) |
9845d120 | 3598 | { |
3599 | /* (mod != 0 ? (op1 / mod > 0 ? 1 : 0) : 0) */ | |
3600 | return gen_rtx_IF_THEN_ELSE | |
3601 | (mode, gen_rtx_NE (BImode, mod, const0_rtx), | |
3602 | gen_rtx_IF_THEN_ELSE | |
3603 | (mode, gen_rtx_GT (BImode, | |
3604 | gen_rtx_DIV (mode, op1, mod), | |
3605 | const0_rtx), | |
3606 | const1_rtx, const0_rtx), | |
3607 | const0_rtx); | |
3608 | } | |
3609 | ||
3610 | /* Return the difference between the ceil and the truncated result of | |
3611 | an unsigned division by OP1 with remainder MOD. */ | |
3612 | static rtx | |
3754d046 | 3613 | ceil_udiv_adjust (machine_mode mode, rtx mod, rtx op1 ATTRIBUTE_UNUSED) |
9845d120 | 3614 | { |
3615 | /* (mod != 0 ? 1 : 0) */ | |
3616 | return gen_rtx_IF_THEN_ELSE | |
3617 | (mode, gen_rtx_NE (BImode, mod, const0_rtx), | |
3618 | const1_rtx, const0_rtx); | |
3619 | } | |
3620 | ||
3621 | /* Return the difference between the rounded and the truncated result | |
3622 | of a signed division by OP1 with remainder MOD. Halfway cases are | |
3623 | rounded away from zero, rather than to the nearest even number. */ | |
3624 | static rtx | |
3754d046 | 3625 | round_sdiv_adjust (machine_mode mode, rtx mod, rtx op1) |
9845d120 | 3626 | { |
3627 | /* (abs (mod) >= abs (op1) - abs (mod) | |
3628 | ? (op1 / mod > 0 ? 1 : -1) | |
3629 | : 0) */ | |
3630 | return gen_rtx_IF_THEN_ELSE | |
3631 | (mode, gen_rtx_GE (BImode, gen_rtx_ABS (mode, mod), | |
3632 | gen_rtx_MINUS (mode, | |
3633 | gen_rtx_ABS (mode, op1), | |
3634 | gen_rtx_ABS (mode, mod))), | |
3635 | gen_rtx_IF_THEN_ELSE | |
3636 | (mode, gen_rtx_GT (BImode, | |
3637 | gen_rtx_DIV (mode, op1, mod), | |
3638 | const0_rtx), | |
3639 | const1_rtx, constm1_rtx), | |
3640 | const0_rtx); | |
3641 | } | |
3642 | ||
3643 | /* Return the difference between the rounded and the truncated result | |
3644 | of a unsigned division by OP1 with remainder MOD. Halfway cases | |
3645 | are rounded away from zero, rather than to the nearest even | |
3646 | number. */ | |
3647 | static rtx | |
3754d046 | 3648 | round_udiv_adjust (machine_mode mode, rtx mod, rtx op1) |
9845d120 | 3649 | { |
3650 | /* (mod >= op1 - mod ? 1 : 0) */ | |
3651 | return gen_rtx_IF_THEN_ELSE | |
3652 | (mode, gen_rtx_GE (BImode, mod, | |
3653 | gen_rtx_MINUS (mode, op1, mod)), | |
3654 | const1_rtx, const0_rtx); | |
3655 | } | |
3656 | ||
d89c81d6 | 3657 | /* Convert X to MODE, that must be Pmode or ptr_mode, without emitting |
3658 | any rtl. */ | |
3659 | ||
3660 | static rtx | |
3754d046 | 3661 | convert_debug_memory_address (machine_mode mode, rtx x, |
cd799492 | 3662 | addr_space_t as) |
d89c81d6 | 3663 | { |
3754d046 | 3664 | machine_mode xmode = GET_MODE (x); |
d89c81d6 | 3665 | |
3666 | #ifndef POINTERS_EXTEND_UNSIGNED | |
cd799492 | 3667 | gcc_assert (mode == Pmode |
3668 | || mode == targetm.addr_space.address_mode (as)); | |
d89c81d6 | 3669 | gcc_assert (xmode == mode || xmode == VOIDmode); |
3670 | #else | |
cd799492 | 3671 | rtx temp; |
cd799492 | 3672 | |
df7f3935 | 3673 | gcc_assert (targetm.addr_space.valid_pointer_mode (mode, as)); |
d89c81d6 | 3674 | |
3675 | if (GET_MODE (x) == mode || GET_MODE (x) == VOIDmode) | |
3676 | return x; | |
3677 | ||
995b44f5 | 3678 | if (GET_MODE_PRECISION (mode) < GET_MODE_PRECISION (xmode)) |
d89c81d6 | 3679 | x = simplify_gen_subreg (mode, x, xmode, |
3680 | subreg_lowpart_offset | |
3681 | (mode, xmode)); | |
3682 | else if (POINTERS_EXTEND_UNSIGNED > 0) | |
3683 | x = gen_rtx_ZERO_EXTEND (mode, x); | |
3684 | else if (!POINTERS_EXTEND_UNSIGNED) | |
3685 | x = gen_rtx_SIGN_EXTEND (mode, x); | |
3686 | else | |
cd799492 | 3687 | { |
3688 | switch (GET_CODE (x)) | |
3689 | { | |
3690 | case SUBREG: | |
3691 | if ((SUBREG_PROMOTED_VAR_P (x) | |
3692 | || (REG_P (SUBREG_REG (x)) && REG_POINTER (SUBREG_REG (x))) | |
3693 | || (GET_CODE (SUBREG_REG (x)) == PLUS | |
3694 | && REG_P (XEXP (SUBREG_REG (x), 0)) | |
3695 | && REG_POINTER (XEXP (SUBREG_REG (x), 0)) | |
3696 | && CONST_INT_P (XEXP (SUBREG_REG (x), 1)))) | |
3697 | && GET_MODE (SUBREG_REG (x)) == mode) | |
3698 | return SUBREG_REG (x); | |
3699 | break; | |
3700 | case LABEL_REF: | |
b49f2e4b | 3701 | temp = gen_rtx_LABEL_REF (mode, LABEL_REF_LABEL (x)); |
cd799492 | 3702 | LABEL_REF_NONLOCAL_P (temp) = LABEL_REF_NONLOCAL_P (x); |
3703 | return temp; | |
3704 | case SYMBOL_REF: | |
3705 | temp = shallow_copy_rtx (x); | |
3706 | PUT_MODE (temp, mode); | |
3707 | return temp; | |
3708 | case CONST: | |
3709 | temp = convert_debug_memory_address (mode, XEXP (x, 0), as); | |
3710 | if (temp) | |
3711 | temp = gen_rtx_CONST (mode, temp); | |
3712 | return temp; | |
3713 | case PLUS: | |
3714 | case MINUS: | |
3715 | if (CONST_INT_P (XEXP (x, 1))) | |
3716 | { | |
3717 | temp = convert_debug_memory_address (mode, XEXP (x, 0), as); | |
3718 | if (temp) | |
3719 | return gen_rtx_fmt_ee (GET_CODE (x), mode, temp, XEXP (x, 1)); | |
3720 | } | |
3721 | break; | |
3722 | default: | |
3723 | break; | |
3724 | } | |
3725 | /* Don't know how to express ptr_extend as operation in debug info. */ | |
3726 | return NULL; | |
3727 | } | |
d89c81d6 | 3728 | #endif /* POINTERS_EXTEND_UNSIGNED */ |
3729 | ||
3730 | return x; | |
3731 | } | |
3732 | ||
8ee59e4e | 3733 | /* Return an RTX equivalent to the value of the parameter DECL. */ |
3734 | ||
3735 | static rtx | |
3736 | expand_debug_parm_decl (tree decl) | |
3737 | { | |
3738 | rtx incoming = DECL_INCOMING_RTL (decl); | |
3739 | ||
3740 | if (incoming | |
3741 | && GET_MODE (incoming) != BLKmode | |
3742 | && ((REG_P (incoming) && HARD_REGISTER_P (incoming)) | |
3743 | || (MEM_P (incoming) | |
3744 | && REG_P (XEXP (incoming, 0)) | |
3745 | && HARD_REGISTER_P (XEXP (incoming, 0))))) | |
3746 | { | |
3747 | rtx rtl = gen_rtx_ENTRY_VALUE (GET_MODE (incoming)); | |
3748 | ||
3749 | #ifdef HAVE_window_save | |
3750 | /* DECL_INCOMING_RTL uses the INCOMING_REGNO of parameter registers. | |
3751 | If the target machine has an explicit window save instruction, the | |
3752 | actual entry value is the corresponding OUTGOING_REGNO instead. */ | |
3753 | if (REG_P (incoming) | |
3754 | && OUTGOING_REGNO (REGNO (incoming)) != REGNO (incoming)) | |
3755 | incoming | |
3756 | = gen_rtx_REG_offset (incoming, GET_MODE (incoming), | |
3757 | OUTGOING_REGNO (REGNO (incoming)), 0); | |
3758 | else if (MEM_P (incoming)) | |
3759 | { | |
3760 | rtx reg = XEXP (incoming, 0); | |
3761 | if (OUTGOING_REGNO (REGNO (reg)) != REGNO (reg)) | |
3762 | { | |
3763 | reg = gen_raw_REG (GET_MODE (reg), OUTGOING_REGNO (REGNO (reg))); | |
3764 | incoming = replace_equiv_address_nv (incoming, reg); | |
3765 | } | |
848d0536 | 3766 | else |
3767 | incoming = copy_rtx (incoming); | |
8ee59e4e | 3768 | } |
3769 | #endif | |
3770 | ||
3771 | ENTRY_VALUE_EXP (rtl) = incoming; | |
3772 | return rtl; | |
3773 | } | |
3774 | ||
3775 | if (incoming | |
3776 | && GET_MODE (incoming) != BLKmode | |
3777 | && !TREE_ADDRESSABLE (decl) | |
3778 | && MEM_P (incoming) | |
3779 | && (XEXP (incoming, 0) == virtual_incoming_args_rtx | |
3780 | || (GET_CODE (XEXP (incoming, 0)) == PLUS | |
3781 | && XEXP (XEXP (incoming, 0), 0) == virtual_incoming_args_rtx | |
3782 | && CONST_INT_P (XEXP (XEXP (incoming, 0), 1))))) | |
848d0536 | 3783 | return copy_rtx (incoming); |
8ee59e4e | 3784 | |
3785 | return NULL_RTX; | |
3786 | } | |
3787 | ||
3788 | /* Return an RTX equivalent to the value of the tree expression EXP. */ | |
9845d120 | 3789 | |
3790 | static rtx | |
3791 | expand_debug_expr (tree exp) | |
3792 | { | |
3793 | rtx op0 = NULL_RTX, op1 = NULL_RTX, op2 = NULL_RTX; | |
3754d046 | 3794 | machine_mode mode = TYPE_MODE (TREE_TYPE (exp)); |
3795 | machine_mode inner_mode = VOIDmode; | |
9845d120 | 3796 | int unsignedp = TYPE_UNSIGNED (TREE_TYPE (exp)); |
bd1a81f7 | 3797 | addr_space_t as; |
9845d120 | 3798 | |
3799 | switch (TREE_CODE_CLASS (TREE_CODE (exp))) | |
3800 | { | |
3801 | case tcc_expression: | |
3802 | switch (TREE_CODE (exp)) | |
3803 | { | |
3804 | case COND_EXPR: | |
b54ee9da | 3805 | case DOT_PROD_EXPR: |
a2287001 | 3806 | case SAD_EXPR: |
00f4f705 | 3807 | case WIDEN_MULT_PLUS_EXPR: |
3808 | case WIDEN_MULT_MINUS_EXPR: | |
156f51b9 | 3809 | case FMA_EXPR: |
9845d120 | 3810 | goto ternary; |
3811 | ||
3812 | case TRUTH_ANDIF_EXPR: | |
3813 | case TRUTH_ORIF_EXPR: | |
3814 | case TRUTH_AND_EXPR: | |
3815 | case TRUTH_OR_EXPR: | |
3816 | case TRUTH_XOR_EXPR: | |
3817 | goto binary; | |
3818 | ||
3819 | case TRUTH_NOT_EXPR: | |
3820 | goto unary; | |
3821 | ||
3822 | default: | |
3823 | break; | |
3824 | } | |
3825 | break; | |
3826 | ||
3827 | ternary: | |
3828 | op2 = expand_debug_expr (TREE_OPERAND (exp, 2)); | |
3829 | if (!op2) | |
3830 | return NULL_RTX; | |
3831 | /* Fall through. */ | |
3832 | ||
3833 | binary: | |
3834 | case tcc_binary: | |
3835 | case tcc_comparison: | |
3836 | op1 = expand_debug_expr (TREE_OPERAND (exp, 1)); | |
3837 | if (!op1) | |
3838 | return NULL_RTX; | |
3839 | /* Fall through. */ | |
3840 | ||
3841 | unary: | |
3842 | case tcc_unary: | |
9ecadf14 | 3843 | inner_mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))); |
9845d120 | 3844 | op0 = expand_debug_expr (TREE_OPERAND (exp, 0)); |
3845 | if (!op0) | |
3846 | return NULL_RTX; | |
3847 | break; | |
3848 | ||
3849 | case tcc_type: | |
3850 | case tcc_statement: | |
3851 | gcc_unreachable (); | |
3852 | ||
3853 | case tcc_constant: | |
3854 | case tcc_exceptional: | |
3855 | case tcc_declaration: | |
3856 | case tcc_reference: | |
3857 | case tcc_vl_exp: | |
3858 | break; | |
3859 | } | |
3860 | ||
3861 | switch (TREE_CODE (exp)) | |
3862 | { | |
3863 | case STRING_CST: | |
3864 | if (!lookup_constant_def (exp)) | |
3865 | { | |
0f89d483 | 3866 | if (strlen (TREE_STRING_POINTER (exp)) + 1 |
3867 | != (size_t) TREE_STRING_LENGTH (exp)) | |
3868 | return NULL_RTX; | |
9845d120 | 3869 | op0 = gen_rtx_CONST_STRING (Pmode, TREE_STRING_POINTER (exp)); |
3870 | op0 = gen_rtx_MEM (BLKmode, op0); | |
3871 | set_mem_attributes (op0, exp, 0); | |
3872 | return op0; | |
3873 | } | |
3874 | /* Fall through... */ | |
3875 | ||
3876 | case INTEGER_CST: | |
3877 | case REAL_CST: | |
3878 | case FIXED_CST: | |
3879 | op0 = expand_expr (exp, NULL_RTX, mode, EXPAND_INITIALIZER); | |
3880 | return op0; | |
3881 | ||
3882 | case COMPLEX_CST: | |
3883 | gcc_assert (COMPLEX_MODE_P (mode)); | |
3884 | op0 = expand_debug_expr (TREE_REALPART (exp)); | |
9845d120 | 3885 | op1 = expand_debug_expr (TREE_IMAGPART (exp)); |
9845d120 | 3886 | return gen_rtx_CONCAT (mode, op0, op1); |
3887 | ||
688ff29b | 3888 | case DEBUG_EXPR_DECL: |
3889 | op0 = DECL_RTL_IF_SET (exp); | |
3890 | ||
3891 | if (op0) | |
3892 | return op0; | |
3893 | ||
3894 | op0 = gen_rtx_DEBUG_EXPR (mode); | |
23dd51cb | 3895 | DEBUG_EXPR_TREE_DECL (op0) = exp; |
688ff29b | 3896 | SET_DECL_RTL (exp, op0); |
3897 | ||
3898 | return op0; | |
3899 | ||
9845d120 | 3900 | case VAR_DECL: |
3901 | case PARM_DECL: | |
3902 | case FUNCTION_DECL: | |
3903 | case LABEL_DECL: | |
3904 | case CONST_DECL: | |
3905 | case RESULT_DECL: | |
3906 | op0 = DECL_RTL_IF_SET (exp); | |
3907 | ||
3908 | /* This decl was probably optimized away. */ | |
3909 | if (!op0) | |
0f89d483 | 3910 | { |
3911 | if (TREE_CODE (exp) != VAR_DECL | |
3912 | || DECL_EXTERNAL (exp) | |
3913 | || !TREE_STATIC (exp) | |
3914 | || !DECL_NAME (exp) | |
a5653528 | 3915 | || DECL_HARD_REGISTER (exp) |
1cdbcae1 | 3916 | || DECL_IN_CONSTANT_POOL (exp) |
a5653528 | 3917 | || mode == VOIDmode) |
0f89d483 | 3918 | return NULL; |
3919 | ||
e6db644e | 3920 | op0 = make_decl_rtl_for_debug (exp); |
0f89d483 | 3921 | if (!MEM_P (op0) |
3922 | || GET_CODE (XEXP (op0, 0)) != SYMBOL_REF | |
3923 | || SYMBOL_REF_DECL (XEXP (op0, 0)) != exp) | |
3924 | return NULL; | |
3925 | } | |
3926 | else | |
3927 | op0 = copy_rtx (op0); | |
9845d120 | 3928 | |
5d713e67 | 3929 | if (GET_MODE (op0) == BLKmode |
3930 | /* If op0 is not BLKmode, but BLKmode is, adjust_mode | |
3931 | below would ICE. While it is likely a FE bug, | |
3932 | try to be robust here. See PR43166. */ | |
0f18e023 | 3933 | || mode == BLKmode |
3934 | || (mode == VOIDmode && GET_MODE (op0) != VOIDmode)) | |
9845d120 | 3935 | { |
3936 | gcc_assert (MEM_P (op0)); | |
3937 | op0 = adjust_address_nv (op0, mode, 0); | |
3938 | return op0; | |
3939 | } | |
3940 | ||
3941 | /* Fall through. */ | |
3942 | ||
3943 | adjust_mode: | |
3944 | case PAREN_EXPR: | |
d09ef31a | 3945 | CASE_CONVERT: |
9845d120 | 3946 | { |
9ecadf14 | 3947 | inner_mode = GET_MODE (op0); |
9845d120 | 3948 | |
3949 | if (mode == inner_mode) | |
3950 | return op0; | |
3951 | ||
3952 | if (inner_mode == VOIDmode) | |
3953 | { | |
3c800ea7 | 3954 | if (TREE_CODE (exp) == SSA_NAME) |
3955 | inner_mode = TYPE_MODE (TREE_TYPE (exp)); | |
3956 | else | |
3957 | inner_mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))); | |
9845d120 | 3958 | if (mode == inner_mode) |
3959 | return op0; | |
3960 | } | |
3961 | ||
3962 | if (FLOAT_MODE_P (mode) && FLOAT_MODE_P (inner_mode)) | |
3963 | { | |
3964 | if (GET_MODE_BITSIZE (mode) == GET_MODE_BITSIZE (inner_mode)) | |
3965 | op0 = simplify_gen_subreg (mode, op0, inner_mode, 0); | |
3966 | else if (GET_MODE_BITSIZE (mode) < GET_MODE_BITSIZE (inner_mode)) | |
3967 | op0 = simplify_gen_unary (FLOAT_TRUNCATE, mode, op0, inner_mode); | |
3968 | else | |
3969 | op0 = simplify_gen_unary (FLOAT_EXTEND, mode, op0, inner_mode); | |
3970 | } | |
3971 | else if (FLOAT_MODE_P (mode)) | |
3972 | { | |
3c800ea7 | 3973 | gcc_assert (TREE_CODE (exp) != SSA_NAME); |
9845d120 | 3974 | if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0)))) |
3975 | op0 = simplify_gen_unary (UNSIGNED_FLOAT, mode, op0, inner_mode); | |
3976 | else | |
3977 | op0 = simplify_gen_unary (FLOAT, mode, op0, inner_mode); | |
3978 | } | |
3979 | else if (FLOAT_MODE_P (inner_mode)) | |
3980 | { | |
3981 | if (unsignedp) | |
3982 | op0 = simplify_gen_unary (UNSIGNED_FIX, mode, op0, inner_mode); | |
3983 | else | |
3984 | op0 = simplify_gen_unary (FIX, mode, op0, inner_mode); | |
3985 | } | |
3986 | else if (CONSTANT_P (op0) | |
995b44f5 | 3987 | || GET_MODE_PRECISION (mode) <= GET_MODE_PRECISION (inner_mode)) |
9845d120 | 3988 | op0 = simplify_gen_subreg (mode, op0, inner_mode, |
3989 | subreg_lowpart_offset (mode, | |
3990 | inner_mode)); | |
f84ead57 | 3991 | else if (TREE_CODE_CLASS (TREE_CODE (exp)) == tcc_unary |
3992 | ? TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))) | |
3993 | : unsignedp) | |
9ecadf14 | 3994 | op0 = simplify_gen_unary (ZERO_EXTEND, mode, op0, inner_mode); |
9845d120 | 3995 | else |
9ecadf14 | 3996 | op0 = simplify_gen_unary (SIGN_EXTEND, mode, op0, inner_mode); |
9845d120 | 3997 | |
3998 | return op0; | |
3999 | } | |
4000 | ||
182cf5a9 | 4001 | case MEM_REF: |
e488c25f | 4002 | if (!is_gimple_mem_ref_addr (TREE_OPERAND (exp, 0))) |
4003 | { | |
4004 | tree newexp = fold_binary (MEM_REF, TREE_TYPE (exp), | |
4005 | TREE_OPERAND (exp, 0), | |
4006 | TREE_OPERAND (exp, 1)); | |
4007 | if (newexp) | |
4008 | return expand_debug_expr (newexp); | |
4009 | } | |
4010 | /* FALLTHROUGH */ | |
9845d120 | 4011 | case INDIRECT_REF: |
29c05e22 | 4012 | inner_mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))); |
9845d120 | 4013 | op0 = expand_debug_expr (TREE_OPERAND (exp, 0)); |
4014 | if (!op0) | |
4015 | return NULL; | |
4016 | ||
7ef770fa | 4017 | if (TREE_CODE (exp) == MEM_REF) |
4018 | { | |
f87ea39e | 4019 | if (GET_CODE (op0) == DEBUG_IMPLICIT_PTR |
4020 | || (GET_CODE (op0) == PLUS | |
4021 | && GET_CODE (XEXP (op0, 0)) == DEBUG_IMPLICIT_PTR)) | |
4022 | /* (mem (debug_implicit_ptr)) might confuse aliasing. | |
4023 | Instead just use get_inner_reference. */ | |
4024 | goto component_ref; | |
4025 | ||
7ef770fa | 4026 | op1 = expand_debug_expr (TREE_OPERAND (exp, 1)); |
4027 | if (!op1 || !CONST_INT_P (op1)) | |
4028 | return NULL; | |
4029 | ||
29c05e22 | 4030 | op0 = plus_constant (inner_mode, op0, INTVAL (op1)); |
7ef770fa | 4031 | } |
4032 | ||
14a3093e | 4033 | as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)))); |
9845d120 | 4034 | |
cd799492 | 4035 | op0 = convert_debug_memory_address (targetm.addr_space.address_mode (as), |
4036 | op0, as); | |
4037 | if (op0 == NULL_RTX) | |
4038 | return NULL; | |
9845d120 | 4039 | |
cd799492 | 4040 | op0 = gen_rtx_MEM (mode, op0); |
9845d120 | 4041 | set_mem_attributes (op0, exp, 0); |
e488c25f | 4042 | if (TREE_CODE (exp) == MEM_REF |
4043 | && !is_gimple_mem_ref_addr (TREE_OPERAND (exp, 0))) | |
4044 | set_mem_expr (op0, NULL_TREE); | |
bd1a81f7 | 4045 | set_mem_addr_space (op0, as); |
9845d120 | 4046 | |
4047 | return op0; | |
4048 | ||
4049 | case TARGET_MEM_REF: | |
28daba6f | 4050 | if (TREE_CODE (TMR_BASE (exp)) == ADDR_EXPR |
4051 | && !DECL_RTL_SET_P (TREE_OPERAND (TMR_BASE (exp), 0))) | |
9845d120 | 4052 | return NULL; |
4053 | ||
4054 | op0 = expand_debug_expr | |
8d8150c8 | 4055 | (tree_mem_ref_addr (build_pointer_type (TREE_TYPE (exp)), exp)); |
9845d120 | 4056 | if (!op0) |
4057 | return NULL; | |
4058 | ||
27628c9e | 4059 | as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)))); |
cd799492 | 4060 | op0 = convert_debug_memory_address (targetm.addr_space.address_mode (as), |
4061 | op0, as); | |
4062 | if (op0 == NULL_RTX) | |
4063 | return NULL; | |
9845d120 | 4064 | |
4065 | op0 = gen_rtx_MEM (mode, op0); | |
4066 | ||
4067 | set_mem_attributes (op0, exp, 0); | |
bd1a81f7 | 4068 | set_mem_addr_space (op0, as); |
9845d120 | 4069 | |
4070 | return op0; | |
4071 | ||
f87ea39e | 4072 | component_ref: |
9845d120 | 4073 | case ARRAY_REF: |
4074 | case ARRAY_RANGE_REF: | |
4075 | case COMPONENT_REF: | |
4076 | case BIT_FIELD_REF: | |
4077 | case REALPART_EXPR: | |
4078 | case IMAGPART_EXPR: | |
4079 | case VIEW_CONVERT_EXPR: | |
4080 | { | |
3754d046 | 4081 | machine_mode mode1; |
9845d120 | 4082 | HOST_WIDE_INT bitsize, bitpos; |
4083 | tree offset; | |
4084 | int volatilep = 0; | |
4085 | tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset, | |
dc317fc8 | 4086 | &mode1, &unsignedp, &volatilep, false); |
9845d120 | 4087 | rtx orig_op0; |
4088 | ||
9e3c8673 | 4089 | if (bitsize == 0) |
4090 | return NULL; | |
4091 | ||
9845d120 | 4092 | orig_op0 = op0 = expand_debug_expr (tem); |
4093 | ||
4094 | if (!op0) | |
4095 | return NULL; | |
4096 | ||
4097 | if (offset) | |
4098 | { | |
3754d046 | 4099 | machine_mode addrmode, offmode; |
d89c81d6 | 4100 | |
f4b490ea | 4101 | if (!MEM_P (op0)) |
4102 | return NULL; | |
9845d120 | 4103 | |
d89c81d6 | 4104 | op0 = XEXP (op0, 0); |
4105 | addrmode = GET_MODE (op0); | |
4106 | if (addrmode == VOIDmode) | |
4107 | addrmode = Pmode; | |
4108 | ||
9845d120 | 4109 | op1 = expand_debug_expr (offset); |
4110 | if (!op1) | |
4111 | return NULL; | |
4112 | ||
d89c81d6 | 4113 | offmode = GET_MODE (op1); |
4114 | if (offmode == VOIDmode) | |
4115 | offmode = TYPE_MODE (TREE_TYPE (offset)); | |
4116 | ||
4117 | if (addrmode != offmode) | |
4118 | op1 = simplify_gen_subreg (addrmode, op1, offmode, | |
4119 | subreg_lowpart_offset (addrmode, | |
4120 | offmode)); | |
4121 | ||
4122 | /* Don't use offset_address here, we don't need a | |
4123 | recognizable address, and we don't want to generate | |
4124 | code. */ | |
9ecadf14 | 4125 | op0 = gen_rtx_MEM (mode, simplify_gen_binary (PLUS, addrmode, |
4126 | op0, op1)); | |
9845d120 | 4127 | } |
4128 | ||
4129 | if (MEM_P (op0)) | |
4130 | { | |
9e3c8673 | 4131 | if (mode1 == VOIDmode) |
4132 | /* Bitfield. */ | |
4133 | mode1 = smallest_mode_for_size (bitsize, MODE_INT); | |
9845d120 | 4134 | if (bitpos >= BITS_PER_UNIT) |
4135 | { | |
4136 | op0 = adjust_address_nv (op0, mode1, bitpos / BITS_PER_UNIT); | |
4137 | bitpos %= BITS_PER_UNIT; | |
4138 | } | |
4139 | else if (bitpos < 0) | |
4140 | { | |
9e3c8673 | 4141 | HOST_WIDE_INT units |
4142 | = (-bitpos + BITS_PER_UNIT - 1) / BITS_PER_UNIT; | |
9845d120 | 4143 | op0 = adjust_address_nv (op0, mode1, units); |
4144 | bitpos += units * BITS_PER_UNIT; | |
4145 | } | |
4146 | else if (bitpos == 0 && bitsize == GET_MODE_BITSIZE (mode)) | |
4147 | op0 = adjust_address_nv (op0, mode, 0); | |
4148 | else if (GET_MODE (op0) != mode1) | |
4149 | op0 = adjust_address_nv (op0, mode1, 0); | |
4150 | else | |
4151 | op0 = copy_rtx (op0); | |
4152 | if (op0 == orig_op0) | |
4153 | op0 = shallow_copy_rtx (op0); | |
4154 | set_mem_attributes (op0, exp, 0); | |
4155 | } | |
4156 | ||
4157 | if (bitpos == 0 && mode == GET_MODE (op0)) | |
4158 | return op0; | |
4159 | ||
5bd71193 | 4160 | if (bitpos < 0) |
4161 | return NULL; | |
4162 | ||
37cd7b09 | 4163 | if (GET_MODE (op0) == BLKmode) |
4164 | return NULL; | |
4165 | ||
9845d120 | 4166 | if ((bitpos % BITS_PER_UNIT) == 0 |
4167 | && bitsize == GET_MODE_BITSIZE (mode1)) | |
4168 | { | |
3754d046 | 4169 | machine_mode opmode = GET_MODE (op0); |
9845d120 | 4170 | |
9845d120 | 4171 | if (opmode == VOIDmode) |
c8b13e49 | 4172 | opmode = TYPE_MODE (TREE_TYPE (tem)); |
9845d120 | 4173 | |
4174 | /* This condition may hold if we're expanding the address | |
4175 | right past the end of an array that turned out not to | |
4176 | be addressable (i.e., the address was only computed in | |
4177 | debug stmts). The gen_subreg below would rightfully | |
4178 | crash, and the address doesn't really exist, so just | |
4179 | drop it. */ | |
4180 | if (bitpos >= GET_MODE_BITSIZE (opmode)) | |
4181 | return NULL; | |
4182 | ||
406aed5d | 4183 | if ((bitpos % GET_MODE_BITSIZE (mode)) == 0) |
4184 | return simplify_gen_subreg (mode, op0, opmode, | |
4185 | bitpos / BITS_PER_UNIT); | |
9845d120 | 4186 | } |
4187 | ||
4188 | return simplify_gen_ternary (SCALAR_INT_MODE_P (GET_MODE (op0)) | |
4189 | && TYPE_UNSIGNED (TREE_TYPE (exp)) | |
4190 | ? SIGN_EXTRACT | |
4191 | : ZERO_EXTRACT, mode, | |
4192 | GET_MODE (op0) != VOIDmode | |
c8b13e49 | 4193 | ? GET_MODE (op0) |
4194 | : TYPE_MODE (TREE_TYPE (tem)), | |
9845d120 | 4195 | op0, GEN_INT (bitsize), GEN_INT (bitpos)); |
4196 | } | |
4197 | ||
9845d120 | 4198 | case ABS_EXPR: |
9ecadf14 | 4199 | return simplify_gen_unary (ABS, mode, op0, mode); |
9845d120 | 4200 | |
4201 | case NEGATE_EXPR: | |
9ecadf14 | 4202 | return simplify_gen_unary (NEG, mode, op0, mode); |
9845d120 | 4203 | |
4204 | case BIT_NOT_EXPR: | |
9ecadf14 | 4205 | return simplify_gen_unary (NOT, mode, op0, mode); |
9845d120 | 4206 | |
4207 | case FLOAT_EXPR: | |
9ecadf14 | 4208 | return simplify_gen_unary (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, |
4209 | 0))) | |
4210 | ? UNSIGNED_FLOAT : FLOAT, mode, op0, | |
4211 | inner_mode); | |
9845d120 | 4212 | |
4213 | case FIX_TRUNC_EXPR: | |
9ecadf14 | 4214 | return simplify_gen_unary (unsignedp ? UNSIGNED_FIX : FIX, mode, op0, |
4215 | inner_mode); | |
9845d120 | 4216 | |
4217 | case POINTER_PLUS_EXPR: | |
af3d13d6 | 4218 | /* For the rare target where pointers are not the same size as |
4219 | size_t, we need to check for mis-matched modes and correct | |
4220 | the addend. */ | |
4221 | if (op0 && op1 | |
4222 | && GET_MODE (op0) != VOIDmode && GET_MODE (op1) != VOIDmode | |
4223 | && GET_MODE (op0) != GET_MODE (op1)) | |
4224 | { | |
5acc9e33 | 4225 | if (GET_MODE_BITSIZE (GET_MODE (op0)) < GET_MODE_BITSIZE (GET_MODE (op1)) |
4226 | /* If OP0 is a partial mode, then we must truncate, even if it has | |
4227 | the same bitsize as OP1 as GCC's representation of partial modes | |
4228 | is opaque. */ | |
4229 | || (GET_MODE_CLASS (GET_MODE (op0)) == MODE_PARTIAL_INT | |
4230 | && GET_MODE_BITSIZE (GET_MODE (op0)) == GET_MODE_BITSIZE (GET_MODE (op1)))) | |
9ecadf14 | 4231 | op1 = simplify_gen_unary (TRUNCATE, GET_MODE (op0), op1, |
4232 | GET_MODE (op1)); | |
af3d13d6 | 4233 | else |
4234 | /* We always sign-extend, regardless of the signedness of | |
4235 | the operand, because the operand is always unsigned | |
4236 | here even if the original C expression is signed. */ | |
9ecadf14 | 4237 | op1 = simplify_gen_unary (SIGN_EXTEND, GET_MODE (op0), op1, |
4238 | GET_MODE (op1)); | |
af3d13d6 | 4239 | } |
4240 | /* Fall through. */ | |
9845d120 | 4241 | case PLUS_EXPR: |
9ecadf14 | 4242 | return simplify_gen_binary (PLUS, mode, op0, op1); |
9845d120 | 4243 | |
4244 | case MINUS_EXPR: | |
9ecadf14 | 4245 | return simplify_gen_binary (MINUS, mode, op0, op1); |
9845d120 | 4246 | |
4247 | case MULT_EXPR: | |
9ecadf14 | 4248 | return simplify_gen_binary (MULT, mode, op0, op1); |
9845d120 | 4249 | |
4250 | case RDIV_EXPR: | |
4251 | case TRUNC_DIV_EXPR: | |
4252 | case EXACT_DIV_EXPR: | |
4253 | if (unsignedp) | |
9ecadf14 | 4254 | return simplify_gen_binary (UDIV, mode, op0, op1); |
9845d120 | 4255 | else |
9ecadf14 | 4256 | return simplify_gen_binary (DIV, mode, op0, op1); |
9845d120 | 4257 | |
4258 | case TRUNC_MOD_EXPR: | |
9ecadf14 | 4259 | return simplify_gen_binary (unsignedp ? UMOD : MOD, mode, op0, op1); |
9845d120 | 4260 | |
4261 | case FLOOR_DIV_EXPR: | |
4262 | if (unsignedp) | |
9ecadf14 | 4263 | return simplify_gen_binary (UDIV, mode, op0, op1); |
9845d120 | 4264 | else |
4265 | { | |
9ecadf14 | 4266 | rtx div = simplify_gen_binary (DIV, mode, op0, op1); |
4267 | rtx mod = simplify_gen_binary (MOD, mode, op0, op1); | |
9845d120 | 4268 | rtx adj = floor_sdiv_adjust (mode, mod, op1); |
9ecadf14 | 4269 | return simplify_gen_binary (PLUS, mode, div, adj); |
9845d120 | 4270 | } |
4271 | ||
4272 | case FLOOR_MOD_EXPR: | |
4273 | if (unsignedp) | |
9ecadf14 | 4274 | return simplify_gen_binary (UMOD, mode, op0, op1); |
9845d120 | 4275 | else |
4276 | { | |
9ecadf14 | 4277 | rtx mod = simplify_gen_binary (MOD, mode, op0, op1); |
9845d120 | 4278 | rtx adj = floor_sdiv_adjust (mode, mod, op1); |
9ecadf14 | 4279 | adj = simplify_gen_unary (NEG, mode, |
4280 | simplify_gen_binary (MULT, mode, adj, op1), | |
4281 | mode); | |
4282 | return simplify_gen_binary (PLUS, mode, mod, adj); | |
9845d120 | 4283 | } |
4284 | ||
4285 | case CEIL_DIV_EXPR: | |
4286 | if (unsignedp) | |
4287 | { | |
9ecadf14 | 4288 | rtx div = simplify_gen_binary (UDIV, mode, op0, op1); |
4289 | rtx mod = simplify_gen_binary (UMOD, mode, op0, op1); | |
9845d120 | 4290 | rtx adj = ceil_udiv_adjust (mode, mod, op1); |
9ecadf14 | 4291 | return simplify_gen_binary (PLUS, mode, div, adj); |
9845d120 | 4292 | } |
4293 | else | |
4294 | { | |
9ecadf14 | 4295 | rtx div = simplify_gen_binary (DIV, mode, op0, op1); |
4296 | rtx mod = simplify_gen_binary (MOD, mode, op0, op1); | |
9845d120 | 4297 | rtx adj = ceil_sdiv_adjust (mode, mod, op1); |
9ecadf14 | 4298 | return simplify_gen_binary (PLUS, mode, div, adj); |
9845d120 | 4299 | } |
4300 | ||
4301 | case CEIL_MOD_EXPR: | |
4302 | if (unsignedp) | |
4303 | { | |
9ecadf14 | 4304 | rtx mod = simplify_gen_binary (UMOD, mode, op0, op1); |
9845d120 | 4305 | rtx adj = ceil_udiv_adjust (mode, mod, op1); |
9ecadf14 | 4306 | adj = simplify_gen_unary (NEG, mode, |
4307 | simplify_gen_binary (MULT, mode, adj, op1), | |
4308 | mode); | |
4309 | return simplify_gen_binary (PLUS, mode, mod, adj); | |
9845d120 | 4310 | } |
4311 | else | |
4312 | { | |
9ecadf14 | 4313 | rtx mod = simplify_gen_binary (MOD, mode, op0, op1); |
9845d120 | 4314 | rtx adj = ceil_sdiv_adjust (mode, mod, op1); |
9ecadf14 | 4315 | adj = simplify_gen_unary (NEG, mode, |
4316 | simplify_gen_binary (MULT, mode, adj, op1), | |
4317 | mode); | |
4318 | return simplify_gen_binary (PLUS, mode, mod, adj); | |
9845d120 | 4319 | } |
4320 | ||
4321 | case ROUND_DIV_EXPR: | |
4322 | if (unsignedp) | |
4323 | { | |
9ecadf14 | 4324 | rtx div = simplify_gen_binary (UDIV, mode, op0, op1); |
4325 | rtx mod = simplify_gen_binary (UMOD, mode, op0, op1); | |
9845d120 | 4326 | rtx adj = round_udiv_adjust (mode, mod, op1); |
9ecadf14 | 4327 | return simplify_gen_binary (PLUS, mode, div, adj); |
9845d120 | 4328 | } |
4329 | else | |
4330 | { | |
9ecadf14 | 4331 | rtx div = simplify_gen_binary (DIV, mode, op0, op1); |
4332 | rtx mod = simplify_gen_binary (MOD, mode, op0, op1); | |
9845d120 | 4333 | rtx adj = round_sdiv_adjust (mode, mod, op1); |
9ecadf14 | 4334 | return simplify_gen_binary (PLUS, mode, div, adj); |
9845d120 | 4335 | } |
4336 | ||
4337 | case ROUND_MOD_EXPR: | |
4338 | if (unsignedp) | |
4339 | { | |
9ecadf14 | 4340 | rtx mod = simplify_gen_binary (UMOD, mode, op0, op1); |
9845d120 | 4341 | rtx adj = round_udiv_adjust (mode, mod, op1); |
9ecadf14 | 4342 | adj = simplify_gen_unary (NEG, mode, |
4343 | simplify_gen_binary (MULT, mode, adj, op1), | |
4344 | mode); | |
4345 | return simplify_gen_binary (PLUS, mode, mod, adj); | |
9845d120 | 4346 | } |
4347 | else | |
4348 | { | |
9ecadf14 | 4349 | rtx mod = simplify_gen_binary (MOD, mode, op0, op1); |
9845d120 | 4350 | rtx adj = round_sdiv_adjust (mode, mod, op1); |
9ecadf14 | 4351 | adj = simplify_gen_unary (NEG, mode, |
4352 | simplify_gen_binary (MULT, mode, adj, op1), | |
4353 | mode); | |
4354 | return simplify_gen_binary (PLUS, mode, mod, adj); | |
9845d120 | 4355 | } |
4356 | ||
4357 | case LSHIFT_EXPR: | |
9ecadf14 | 4358 | return simplify_gen_binary (ASHIFT, mode, op0, op1); |
9845d120 | 4359 | |
4360 | case RSHIFT_EXPR: | |
4361 | if (unsignedp) | |
9ecadf14 | 4362 | return simplify_gen_binary (LSHIFTRT, mode, op0, op1); |
9845d120 | 4363 | else |
9ecadf14 | 4364 | return simplify_gen_binary (ASHIFTRT, mode, op0, op1); |
9845d120 | 4365 | |
4366 | case LROTATE_EXPR: | |
9ecadf14 | 4367 | return simplify_gen_binary (ROTATE, mode, op0, op1); |
9845d120 | 4368 | |
4369 | case RROTATE_EXPR: | |
9ecadf14 | 4370 | return simplify_gen_binary (ROTATERT, mode, op0, op1); |
9845d120 | 4371 | |
4372 | case MIN_EXPR: | |
9ecadf14 | 4373 | return simplify_gen_binary (unsignedp ? UMIN : SMIN, mode, op0, op1); |
9845d120 | 4374 | |
4375 | case MAX_EXPR: | |
9ecadf14 | 4376 | return simplify_gen_binary (unsignedp ? UMAX : SMAX, mode, op0, op1); |
9845d120 | 4377 | |
4378 | case BIT_AND_EXPR: | |
4379 | case TRUTH_AND_EXPR: | |
9ecadf14 | 4380 | return simplify_gen_binary (AND, mode, op0, op1); |
9845d120 | 4381 | |
4382 | case BIT_IOR_EXPR: | |
4383 | case TRUTH_OR_EXPR: | |
9ecadf14 | 4384 | return simplify_gen_binary (IOR, mode, op0, op1); |
9845d120 | 4385 | |
4386 | case BIT_XOR_EXPR: | |
4387 | case TRUTH_XOR_EXPR: | |
9ecadf14 | 4388 | return simplify_gen_binary (XOR, mode, op0, op1); |
9845d120 | 4389 | |
4390 | case TRUTH_ANDIF_EXPR: | |
4391 | return gen_rtx_IF_THEN_ELSE (mode, op0, op1, const0_rtx); | |
4392 | ||
4393 | case TRUTH_ORIF_EXPR: | |
4394 | return gen_rtx_IF_THEN_ELSE (mode, op0, const_true_rtx, op1); | |
4395 | ||
4396 | case TRUTH_NOT_EXPR: | |
9ecadf14 | 4397 | return simplify_gen_relational (EQ, mode, inner_mode, op0, const0_rtx); |
9845d120 | 4398 | |
4399 | case LT_EXPR: | |
9ecadf14 | 4400 | return simplify_gen_relational (unsignedp ? LTU : LT, mode, inner_mode, |
4401 | op0, op1); | |
9845d120 | 4402 | |
4403 | case LE_EXPR: | |
9ecadf14 | 4404 | return simplify_gen_relational (unsignedp ? LEU : LE, mode, inner_mode, |
4405 | op0, op1); | |
9845d120 | 4406 | |
4407 | case GT_EXPR: | |
9ecadf14 | 4408 | return simplify_gen_relational (unsignedp ? GTU : GT, mode, inner_mode, |
4409 | op0, op1); | |
9845d120 | 4410 | |
4411 | case GE_EXPR: | |
9ecadf14 | 4412 | return simplify_gen_relational (unsignedp ? GEU : GE, mode, inner_mode, |
4413 | op0, op1); | |
9845d120 | 4414 | |
4415 | case EQ_EXPR: | |
9ecadf14 | 4416 | return simplify_gen_relational (EQ, mode, inner_mode, op0, op1); |
9845d120 | 4417 | |
4418 | case NE_EXPR: | |
9ecadf14 | 4419 | return simplify_gen_relational (NE, mode, inner_mode, op0, op1); |
9845d120 | 4420 | |
4421 | case UNORDERED_EXPR: | |
9ecadf14 | 4422 | return simplify_gen_relational (UNORDERED, mode, inner_mode, op0, op1); |
9845d120 | 4423 | |
4424 | case ORDERED_EXPR: | |
9ecadf14 | 4425 | return simplify_gen_relational (ORDERED, mode, inner_mode, op0, op1); |
9845d120 | 4426 | |
4427 | case UNLT_EXPR: | |
9ecadf14 | 4428 | return simplify_gen_relational (UNLT, mode, inner_mode, op0, op1); |
9845d120 | 4429 | |
4430 | case UNLE_EXPR: | |
9ecadf14 | 4431 | return simplify_gen_relational (UNLE, mode, inner_mode, op0, op1); |
9845d120 | 4432 | |
4433 | case UNGT_EXPR: | |
9ecadf14 | 4434 | return simplify_gen_relational (UNGT, mode, inner_mode, op0, op1); |
9845d120 | 4435 | |
4436 | case UNGE_EXPR: | |
9ecadf14 | 4437 | return simplify_gen_relational (UNGE, mode, inner_mode, op0, op1); |
9845d120 | 4438 | |
4439 | case UNEQ_EXPR: | |
9ecadf14 | 4440 | return simplify_gen_relational (UNEQ, mode, inner_mode, op0, op1); |
9845d120 | 4441 | |
4442 | case LTGT_EXPR: | |
9ecadf14 | 4443 | return simplify_gen_relational (LTGT, mode, inner_mode, op0, op1); |
9845d120 | 4444 | |
4445 | case COND_EXPR: | |
4446 | return gen_rtx_IF_THEN_ELSE (mode, op0, op1, op2); | |
4447 | ||
4448 | case COMPLEX_EXPR: | |
4449 | gcc_assert (COMPLEX_MODE_P (mode)); | |
4450 | if (GET_MODE (op0) == VOIDmode) | |
4451 | op0 = gen_rtx_CONST (GET_MODE_INNER (mode), op0); | |
4452 | if (GET_MODE (op1) == VOIDmode) | |
4453 | op1 = gen_rtx_CONST (GET_MODE_INNER (mode), op1); | |
4454 | return gen_rtx_CONCAT (mode, op0, op1); | |
4455 | ||
4e6677f8 | 4456 | case CONJ_EXPR: |
4457 | if (GET_CODE (op0) == CONCAT) | |
4458 | return gen_rtx_CONCAT (mode, XEXP (op0, 0), | |
9ecadf14 | 4459 | simplify_gen_unary (NEG, GET_MODE_INNER (mode), |
4460 | XEXP (op0, 1), | |
4461 | GET_MODE_INNER (mode))); | |
4e6677f8 | 4462 | else |
4463 | { | |
3754d046 | 4464 | machine_mode imode = GET_MODE_INNER (mode); |
4e6677f8 | 4465 | rtx re, im; |
4466 | ||
4467 | if (MEM_P (op0)) | |
4468 | { | |
4469 | re = adjust_address_nv (op0, imode, 0); | |
4470 | im = adjust_address_nv (op0, imode, GET_MODE_SIZE (imode)); | |
4471 | } | |
4472 | else | |
4473 | { | |
3754d046 | 4474 | machine_mode ifmode = int_mode_for_mode (mode); |
4475 | machine_mode ihmode = int_mode_for_mode (imode); | |
4e6677f8 | 4476 | rtx halfsize; |
4477 | if (ifmode == BLKmode || ihmode == BLKmode) | |
4478 | return NULL; | |
4479 | halfsize = GEN_INT (GET_MODE_BITSIZE (ihmode)); | |
4480 | re = op0; | |
4481 | if (mode != ifmode) | |
4482 | re = gen_rtx_SUBREG (ifmode, re, 0); | |
4483 | re = gen_rtx_ZERO_EXTRACT (ihmode, re, halfsize, const0_rtx); | |
4484 | if (imode != ihmode) | |
4485 | re = gen_rtx_SUBREG (imode, re, 0); | |
4486 | im = copy_rtx (op0); | |
4487 | if (mode != ifmode) | |
4488 | im = gen_rtx_SUBREG (ifmode, im, 0); | |
4489 | im = gen_rtx_ZERO_EXTRACT (ihmode, im, halfsize, halfsize); | |
4490 | if (imode != ihmode) | |
4491 | im = gen_rtx_SUBREG (imode, im, 0); | |
4492 | } | |
4493 | im = gen_rtx_NEG (imode, im); | |
4494 | return gen_rtx_CONCAT (mode, re, im); | |
4495 | } | |
4496 | ||
9845d120 | 4497 | case ADDR_EXPR: |
4498 | op0 = expand_debug_expr (TREE_OPERAND (exp, 0)); | |
4499 | if (!op0 || !MEM_P (op0)) | |
f9c61ef7 | 4500 | { |
4501 | if ((TREE_CODE (TREE_OPERAND (exp, 0)) == VAR_DECL | |
4502 | || TREE_CODE (TREE_OPERAND (exp, 0)) == PARM_DECL | |
4503 | || TREE_CODE (TREE_OPERAND (exp, 0)) == RESULT_DECL) | |
88f2e16b | 4504 | && (!TREE_ADDRESSABLE (TREE_OPERAND (exp, 0)) |
4505 | || target_for_debug_bind (TREE_OPERAND (exp, 0)))) | |
f9c61ef7 | 4506 | return gen_rtx_DEBUG_IMPLICIT_PTR (mode, TREE_OPERAND (exp, 0)); |
4507 | ||
4508 | if (handled_component_p (TREE_OPERAND (exp, 0))) | |
4509 | { | |
4510 | HOST_WIDE_INT bitoffset, bitsize, maxsize; | |
4511 | tree decl | |
4512 | = get_ref_base_and_extent (TREE_OPERAND (exp, 0), | |
4513 | &bitoffset, &bitsize, &maxsize); | |
4514 | if ((TREE_CODE (decl) == VAR_DECL | |
4515 | || TREE_CODE (decl) == PARM_DECL | |
4516 | || TREE_CODE (decl) == RESULT_DECL) | |
88f2e16b | 4517 | && (!TREE_ADDRESSABLE (decl) |
4518 | || target_for_debug_bind (decl)) | |
f9c61ef7 | 4519 | && (bitoffset % BITS_PER_UNIT) == 0 |
4520 | && bitsize > 0 | |
4521 | && bitsize == maxsize) | |
29c05e22 | 4522 | { |
4523 | rtx base = gen_rtx_DEBUG_IMPLICIT_PTR (mode, decl); | |
4524 | return plus_constant (mode, base, bitoffset / BITS_PER_UNIT); | |
4525 | } | |
f9c61ef7 | 4526 | } |
4527 | ||
8afb7c4b | 4528 | if (TREE_CODE (TREE_OPERAND (exp, 0)) == MEM_REF |
4529 | && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)) | |
4530 | == ADDR_EXPR) | |
4531 | { | |
4532 | op0 = expand_debug_expr (TREE_OPERAND (TREE_OPERAND (exp, 0), | |
4533 | 0)); | |
4534 | if (op0 != NULL | |
4535 | && (GET_CODE (op0) == DEBUG_IMPLICIT_PTR | |
4536 | || (GET_CODE (op0) == PLUS | |
4537 | && GET_CODE (XEXP (op0, 0)) == DEBUG_IMPLICIT_PTR | |
4538 | && CONST_INT_P (XEXP (op0, 1))))) | |
4539 | { | |
4540 | op1 = expand_debug_expr (TREE_OPERAND (TREE_OPERAND (exp, 0), | |
4541 | 1)); | |
4542 | if (!op1 || !CONST_INT_P (op1)) | |
4543 | return NULL; | |
4544 | ||
4545 | return plus_constant (mode, op0, INTVAL (op1)); | |
4546 | } | |
4547 | } | |
4548 | ||
f9c61ef7 | 4549 | return NULL; |
4550 | } | |
9845d120 | 4551 | |
14a3093e | 4552 | as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp))); |
cd799492 | 4553 | op0 = convert_debug_memory_address (mode, XEXP (op0, 0), as); |
d89c81d6 | 4554 | |
4555 | return op0; | |
9845d120 | 4556 | |
4557 | case VECTOR_CST: | |
fadf62f4 | 4558 | { |
4559 | unsigned i; | |
4560 | ||
4561 | op0 = gen_rtx_CONCATN | |
4562 | (mode, rtvec_alloc (TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp)))); | |
4563 | ||
4564 | for (i = 0; i < VECTOR_CST_NELTS (exp); ++i) | |
4565 | { | |
4566 | op1 = expand_debug_expr (VECTOR_CST_ELT (exp, i)); | |
4567 | if (!op1) | |
4568 | return NULL; | |
4569 | XVECEXP (op0, 0, i) = op1; | |
4570 | } | |
4571 | ||
4572 | return op0; | |
4573 | } | |
9845d120 | 4574 | |
4575 | case CONSTRUCTOR: | |
3c25489e | 4576 | if (TREE_CLOBBER_P (exp)) |
4577 | return NULL; | |
4578 | else if (TREE_CODE (TREE_TYPE (exp)) == VECTOR_TYPE) | |
9845d120 | 4579 | { |
4580 | unsigned i; | |
4581 | tree val; | |
4582 | ||
4583 | op0 = gen_rtx_CONCATN | |
4584 | (mode, rtvec_alloc (TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp)))); | |
4585 | ||
4586 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), i, val) | |
4587 | { | |
4588 | op1 = expand_debug_expr (val); | |
4589 | if (!op1) | |
4590 | return NULL; | |
4591 | XVECEXP (op0, 0, i) = op1; | |
4592 | } | |
4593 | ||
4594 | if (i < TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp))) | |
4595 | { | |
4596 | op1 = expand_debug_expr | |
385f3f36 | 4597 | (build_zero_cst (TREE_TYPE (TREE_TYPE (exp)))); |
9845d120 | 4598 | |
4599 | if (!op1) | |
4600 | return NULL; | |
4601 | ||
4602 | for (; i < TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp)); i++) | |
4603 | XVECEXP (op0, 0, i) = op1; | |
4604 | } | |
4605 | ||
4606 | return op0; | |
4607 | } | |
4608 | else | |
4609 | goto flag_unsupported; | |
4610 | ||
4611 | case CALL_EXPR: | |
4612 | /* ??? Maybe handle some builtins? */ | |
4613 | return NULL; | |
4614 | ||
4615 | case SSA_NAME: | |
4616 | { | |
3c800ea7 | 4617 | gimple g = get_gimple_for_ssa_name (exp); |
4618 | if (g) | |
4619 | { | |
4620 | op0 = expand_debug_expr (gimple_assign_rhs_to_tree (g)); | |
4621 | if (!op0) | |
4622 | return NULL; | |
4623 | } | |
4624 | else | |
4625 | { | |
4626 | int part = var_to_partition (SA.map, exp); | |
9845d120 | 4627 | |
3c800ea7 | 4628 | if (part == NO_PARTITION) |
a5701bde | 4629 | { |
4630 | /* If this is a reference to an incoming value of parameter | |
4631 | that is never used in the code or where the incoming | |
4632 | value is never used in the code, use PARM_DECL's | |
4633 | DECL_RTL if set. */ | |
4634 | if (SSA_NAME_IS_DEFAULT_DEF (exp) | |
4635 | && TREE_CODE (SSA_NAME_VAR (exp)) == PARM_DECL) | |
4636 | { | |
8ee59e4e | 4637 | op0 = expand_debug_parm_decl (SSA_NAME_VAR (exp)); |
4638 | if (op0) | |
4639 | goto adjust_mode; | |
a5701bde | 4640 | op0 = expand_debug_expr (SSA_NAME_VAR (exp)); |
8ee59e4e | 4641 | if (op0) |
4642 | goto adjust_mode; | |
a5701bde | 4643 | } |
4644 | return NULL; | |
4645 | } | |
9845d120 | 4646 | |
3c800ea7 | 4647 | gcc_assert (part >= 0 && (unsigned)part < SA.map->num_partitions); |
9845d120 | 4648 | |
ce6d059c | 4649 | op0 = copy_rtx (SA.partition_to_pseudo[part]); |
3c800ea7 | 4650 | } |
9845d120 | 4651 | goto adjust_mode; |
4652 | } | |
4653 | ||
4654 | case ERROR_MARK: | |
4655 | return NULL; | |
4656 | ||
b54ee9da | 4657 | /* Vector stuff. For most of the codes we don't have rtl codes. */ |
4658 | case REALIGN_LOAD_EXPR: | |
4659 | case REDUC_MAX_EXPR: | |
4660 | case REDUC_MIN_EXPR: | |
4661 | case REDUC_PLUS_EXPR: | |
4662 | case VEC_COND_EXPR: | |
b54ee9da | 4663 | case VEC_PACK_FIX_TRUNC_EXPR: |
4664 | case VEC_PACK_SAT_EXPR: | |
4665 | case VEC_PACK_TRUNC_EXPR: | |
b54ee9da | 4666 | case VEC_UNPACK_FLOAT_HI_EXPR: |
4667 | case VEC_UNPACK_FLOAT_LO_EXPR: | |
4668 | case VEC_UNPACK_HI_EXPR: | |
4669 | case VEC_UNPACK_LO_EXPR: | |
4670 | case VEC_WIDEN_MULT_HI_EXPR: | |
4671 | case VEC_WIDEN_MULT_LO_EXPR: | |
79a78f7f | 4672 | case VEC_WIDEN_MULT_EVEN_EXPR: |
4673 | case VEC_WIDEN_MULT_ODD_EXPR: | |
6083c152 | 4674 | case VEC_WIDEN_LSHIFT_HI_EXPR: |
4675 | case VEC_WIDEN_LSHIFT_LO_EXPR: | |
3557cb99 | 4676 | case VEC_PERM_EXPR: |
b54ee9da | 4677 | return NULL; |
4678 | ||
96504875 | 4679 | /* Misc codes. */ |
b54ee9da | 4680 | case ADDR_SPACE_CONVERT_EXPR: |
4681 | case FIXED_CONVERT_EXPR: | |
4682 | case OBJ_TYPE_REF: | |
4683 | case WITH_SIZE_EXPR: | |
4684 | return NULL; | |
4685 | ||
4686 | case DOT_PROD_EXPR: | |
4687 | if (SCALAR_INT_MODE_P (GET_MODE (op0)) | |
4688 | && SCALAR_INT_MODE_P (mode)) | |
4689 | { | |
9ecadf14 | 4690 | op0 |
4691 | = simplify_gen_unary (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, | |
4692 | 0))) | |
4693 | ? ZERO_EXTEND : SIGN_EXTEND, mode, op0, | |
4694 | inner_mode); | |
4695 | op1 | |
4696 | = simplify_gen_unary (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, | |
4697 | 1))) | |
4698 | ? ZERO_EXTEND : SIGN_EXTEND, mode, op1, | |
4699 | inner_mode); | |
4700 | op0 = simplify_gen_binary (MULT, mode, op0, op1); | |
4701 | return simplify_gen_binary (PLUS, mode, op0, op2); | |
b54ee9da | 4702 | } |
4703 | return NULL; | |
4704 | ||
4705 | case WIDEN_MULT_EXPR: | |
00f4f705 | 4706 | case WIDEN_MULT_PLUS_EXPR: |
4707 | case WIDEN_MULT_MINUS_EXPR: | |
b54ee9da | 4708 | if (SCALAR_INT_MODE_P (GET_MODE (op0)) |
4709 | && SCALAR_INT_MODE_P (mode)) | |
4710 | { | |
9ecadf14 | 4711 | inner_mode = GET_MODE (op0); |
b54ee9da | 4712 | if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0)))) |
62be004c | 4713 | op0 = simplify_gen_unary (ZERO_EXTEND, mode, op0, inner_mode); |
b54ee9da | 4714 | else |
62be004c | 4715 | op0 = simplify_gen_unary (SIGN_EXTEND, mode, op0, inner_mode); |
b54ee9da | 4716 | if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 1)))) |
62be004c | 4717 | op1 = simplify_gen_unary (ZERO_EXTEND, mode, op1, inner_mode); |
b54ee9da | 4718 | else |
62be004c | 4719 | op1 = simplify_gen_unary (SIGN_EXTEND, mode, op1, inner_mode); |
9ecadf14 | 4720 | op0 = simplify_gen_binary (MULT, mode, op0, op1); |
00f4f705 | 4721 | if (TREE_CODE (exp) == WIDEN_MULT_EXPR) |
4722 | return op0; | |
4723 | else if (TREE_CODE (exp) == WIDEN_MULT_PLUS_EXPR) | |
9ecadf14 | 4724 | return simplify_gen_binary (PLUS, mode, op0, op2); |
00f4f705 | 4725 | else |
9ecadf14 | 4726 | return simplify_gen_binary (MINUS, mode, op2, op0); |
b54ee9da | 4727 | } |
4728 | return NULL; | |
4729 | ||
96504875 | 4730 | case MULT_HIGHPART_EXPR: |
4731 | /* ??? Similar to the above. */ | |
4732 | return NULL; | |
4733 | ||
b54ee9da | 4734 | case WIDEN_SUM_EXPR: |
3557cb99 | 4735 | case WIDEN_LSHIFT_EXPR: |
b54ee9da | 4736 | if (SCALAR_INT_MODE_P (GET_MODE (op0)) |
4737 | && SCALAR_INT_MODE_P (mode)) | |
4738 | { | |
9ecadf14 | 4739 | op0 |
4740 | = simplify_gen_unary (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, | |
4741 | 0))) | |
4742 | ? ZERO_EXTEND : SIGN_EXTEND, mode, op0, | |
4743 | inner_mode); | |
3557cb99 | 4744 | return simplify_gen_binary (TREE_CODE (exp) == WIDEN_LSHIFT_EXPR |
4745 | ? ASHIFT : PLUS, mode, op0, op1); | |
b54ee9da | 4746 | } |
4747 | return NULL; | |
4748 | ||
156f51b9 | 4749 | case FMA_EXPR: |
9ecadf14 | 4750 | return simplify_gen_ternary (FMA, mode, inner_mode, op0, op1, op2); |
156f51b9 | 4751 | |
9845d120 | 4752 | default: |
4753 | flag_unsupported: | |
4754 | #ifdef ENABLE_CHECKING | |
4755 | debug_tree (exp); | |
4756 | gcc_unreachable (); | |
4757 | #else | |
4758 | return NULL; | |
4759 | #endif | |
4760 | } | |
4761 | } | |
4762 | ||
841424cc | 4763 | /* Return an RTX equivalent to the source bind value of the tree expression |
4764 | EXP. */ | |
4765 | ||
4766 | static rtx | |
4767 | expand_debug_source_expr (tree exp) | |
4768 | { | |
4769 | rtx op0 = NULL_RTX; | |
3754d046 | 4770 | machine_mode mode = VOIDmode, inner_mode; |
841424cc | 4771 | |
4772 | switch (TREE_CODE (exp)) | |
4773 | { | |
4774 | case PARM_DECL: | |
4775 | { | |
841424cc | 4776 | mode = DECL_MODE (exp); |
8ee59e4e | 4777 | op0 = expand_debug_parm_decl (exp); |
4778 | if (op0) | |
4779 | break; | |
841424cc | 4780 | /* See if this isn't an argument that has been completely |
4781 | optimized out. */ | |
4782 | if (!DECL_RTL_SET_P (exp) | |
8ee59e4e | 4783 | && !DECL_INCOMING_RTL (exp) |
841424cc | 4784 | && DECL_ABSTRACT_ORIGIN (current_function_decl)) |
4785 | { | |
42c442a9 | 4786 | tree aexp = DECL_ORIGIN (exp); |
841424cc | 4787 | if (DECL_CONTEXT (aexp) |
4788 | == DECL_ABSTRACT_ORIGIN (current_function_decl)) | |
4789 | { | |
f1f41a6c | 4790 | vec<tree, va_gc> **debug_args; |
841424cc | 4791 | unsigned int ix; |
4792 | tree ddecl; | |
841424cc | 4793 | debug_args = decl_debug_args_lookup (current_function_decl); |
4794 | if (debug_args != NULL) | |
4795 | { | |
f1f41a6c | 4796 | for (ix = 0; vec_safe_iterate (*debug_args, ix, &ddecl); |
841424cc | 4797 | ix += 2) |
4798 | if (ddecl == aexp) | |
4799 | return gen_rtx_DEBUG_PARAMETER_REF (mode, aexp); | |
4800 | } | |
4801 | } | |
4802 | } | |
4803 | break; | |
4804 | } | |
4805 | default: | |
4806 | break; | |
4807 | } | |
4808 | ||
4809 | if (op0 == NULL_RTX) | |
4810 | return NULL_RTX; | |
4811 | ||
4812 | inner_mode = GET_MODE (op0); | |
4813 | if (mode == inner_mode) | |
4814 | return op0; | |
4815 | ||
4816 | if (FLOAT_MODE_P (mode) && FLOAT_MODE_P (inner_mode)) | |
4817 | { | |
4818 | if (GET_MODE_BITSIZE (mode) == GET_MODE_BITSIZE (inner_mode)) | |
4819 | op0 = simplify_gen_subreg (mode, op0, inner_mode, 0); | |
4820 | else if (GET_MODE_BITSIZE (mode) < GET_MODE_BITSIZE (inner_mode)) | |
4821 | op0 = simplify_gen_unary (FLOAT_TRUNCATE, mode, op0, inner_mode); | |
4822 | else | |
4823 | op0 = simplify_gen_unary (FLOAT_EXTEND, mode, op0, inner_mode); | |
4824 | } | |
4825 | else if (FLOAT_MODE_P (mode)) | |
4826 | gcc_unreachable (); | |
4827 | else if (FLOAT_MODE_P (inner_mode)) | |
4828 | { | |
4829 | if (TYPE_UNSIGNED (TREE_TYPE (exp))) | |
4830 | op0 = simplify_gen_unary (UNSIGNED_FIX, mode, op0, inner_mode); | |
4831 | else | |
4832 | op0 = simplify_gen_unary (FIX, mode, op0, inner_mode); | |
4833 | } | |
4834 | else if (CONSTANT_P (op0) | |
4835 | || GET_MODE_BITSIZE (mode) <= GET_MODE_BITSIZE (inner_mode)) | |
4836 | op0 = simplify_gen_subreg (mode, op0, inner_mode, | |
4837 | subreg_lowpart_offset (mode, inner_mode)); | |
4838 | else if (TYPE_UNSIGNED (TREE_TYPE (exp))) | |
4839 | op0 = simplify_gen_unary (ZERO_EXTEND, mode, op0, inner_mode); | |
4840 | else | |
4841 | op0 = simplify_gen_unary (SIGN_EXTEND, mode, op0, inner_mode); | |
4842 | ||
4843 | return op0; | |
4844 | } | |
4845 | ||
848d0536 | 4846 | /* Ensure INSN_VAR_LOCATION_LOC (insn) doesn't have unbound complexity. |
4847 | Allow 4 levels of rtl nesting for most rtl codes, and if we see anything | |
4848 | deeper than that, create DEBUG_EXPRs and emit DEBUG_INSNs before INSN. */ | |
4849 | ||
4850 | static void | |
74a0cbc4 | 4851 | avoid_complex_debug_insns (rtx_insn *insn, rtx *exp_p, int depth) |
848d0536 | 4852 | { |
4853 | rtx exp = *exp_p; | |
4854 | ||
4855 | if (exp == NULL_RTX) | |
4856 | return; | |
4857 | ||
4858 | if ((OBJECT_P (exp) && !MEM_P (exp)) || GET_CODE (exp) == CLOBBER) | |
4859 | return; | |
4860 | ||
4861 | if (depth == 4) | |
4862 | { | |
4863 | /* Create DEBUG_EXPR (and DEBUG_EXPR_DECL). */ | |
4864 | rtx dval = make_debug_expr_from_rtl (exp); | |
4865 | ||
4866 | /* Emit a debug bind insn before INSN. */ | |
4867 | rtx bind = gen_rtx_VAR_LOCATION (GET_MODE (exp), | |
4868 | DEBUG_EXPR_TREE_DECL (dval), exp, | |
4869 | VAR_INIT_STATUS_INITIALIZED); | |
4870 | ||
4871 | emit_debug_insn_before (bind, insn); | |
4872 | *exp_p = dval; | |
4873 | return; | |
4874 | } | |
4875 | ||
4876 | const char *format_ptr = GET_RTX_FORMAT (GET_CODE (exp)); | |
4877 | int i, j; | |
4878 | for (i = 0; i < GET_RTX_LENGTH (GET_CODE (exp)); i++) | |
4879 | switch (*format_ptr++) | |
4880 | { | |
4881 | case 'e': | |
4882 | avoid_complex_debug_insns (insn, &XEXP (exp, i), depth + 1); | |
4883 | break; | |
4884 | ||
4885 | case 'E': | |
4886 | case 'V': | |
4887 | for (j = 0; j < XVECLEN (exp, i); j++) | |
4888 | avoid_complex_debug_insns (insn, &XVECEXP (exp, i, j), depth + 1); | |
4889 | break; | |
4890 | ||
4891 | default: | |
4892 | break; | |
4893 | } | |
4894 | } | |
4895 | ||
9845d120 | 4896 | /* Expand the _LOCs in debug insns. We run this after expanding all |
4897 | regular insns, so that any variables referenced in the function | |
4898 | will have their DECL_RTLs set. */ | |
4899 | ||
4900 | static void | |
4901 | expand_debug_locations (void) | |
4902 | { | |
74a0cbc4 | 4903 | rtx_insn *insn; |
4904 | rtx_insn *last = get_last_insn (); | |
9845d120 | 4905 | int save_strict_alias = flag_strict_aliasing; |
4906 | ||
4907 | /* New alias sets while setting up memory attributes cause | |
4908 | -fcompare-debug failures, even though it doesn't bring about any | |
4909 | codegen changes. */ | |
4910 | flag_strict_aliasing = 0; | |
4911 | ||
4912 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) | |
4913 | if (DEBUG_INSN_P (insn)) | |
4914 | { | |
4915 | tree value = (tree)INSN_VAR_LOCATION_LOC (insn); | |
74a0cbc4 | 4916 | rtx val; |
4917 | rtx_insn *prev_insn, *insn2; | |
3754d046 | 4918 | machine_mode mode; |
9845d120 | 4919 | |
4920 | if (value == NULL_TREE) | |
4921 | val = NULL_RTX; | |
4922 | else | |
4923 | { | |
841424cc | 4924 | if (INSN_VAR_LOCATION_STATUS (insn) |
4925 | == VAR_INIT_STATUS_UNINITIALIZED) | |
4926 | val = expand_debug_source_expr (value); | |
4927 | else | |
4928 | val = expand_debug_expr (value); | |
9845d120 | 4929 | gcc_assert (last == get_last_insn ()); |
4930 | } | |
4931 | ||
4932 | if (!val) | |
4933 | val = gen_rtx_UNKNOWN_VAR_LOC (); | |
4934 | else | |
4935 | { | |
4936 | mode = GET_MODE (INSN_VAR_LOCATION (insn)); | |
4937 | ||
4938 | gcc_assert (mode == GET_MODE (val) | |
4939 | || (GET_MODE (val) == VOIDmode | |
efa08fc2 | 4940 | && (CONST_SCALAR_INT_P (val) |
9845d120 | 4941 | || GET_CODE (val) == CONST_FIXED |
9845d120 | 4942 | || GET_CODE (val) == LABEL_REF))); |
4943 | } | |
4944 | ||
4945 | INSN_VAR_LOCATION_LOC (insn) = val; | |
848d0536 | 4946 | prev_insn = PREV_INSN (insn); |
4947 | for (insn2 = insn; insn2 != prev_insn; insn2 = PREV_INSN (insn2)) | |
4948 | avoid_complex_debug_insns (insn2, &INSN_VAR_LOCATION_LOC (insn2), 0); | |
9845d120 | 4949 | } |
4950 | ||
4951 | flag_strict_aliasing = save_strict_alias; | |
4952 | } | |
4953 | ||
0ec80471 | 4954 | /* Expand basic block BB from GIMPLE trees to RTL. */ |
4955 | ||
4956 | static basic_block | |
3c919612 | 4957 | expand_gimple_basic_block (basic_block bb, bool disable_tail_calls) |
0ec80471 | 4958 | { |
75a70cf9 | 4959 | gimple_stmt_iterator gsi; |
4960 | gimple_seq stmts; | |
4961 | gimple stmt = NULL; | |
cef3d8ad | 4962 | rtx_note *note; |
74a0cbc4 | 4963 | rtx_insn *last; |
0ec80471 | 4964 | edge e; |
cd665a06 | 4965 | edge_iterator ei; |
0ec80471 | 4966 | |
4967 | if (dump_file) | |
75a70cf9 | 4968 | fprintf (dump_file, "\n;; Generating RTL for gimple basic block %d\n", |
4969 | bb->index); | |
4970 | ||
4971 | /* Note that since we are now transitioning from GIMPLE to RTL, we | |
4972 | cannot use the gsi_*_bb() routines because they expect the basic | |
4973 | block to be in GIMPLE, instead of RTL. Therefore, we need to | |
4974 | access the BB sequence directly. */ | |
4975 | stmts = bb_seq (bb); | |
924c4c71 | 4976 | bb->il.gimple.seq = NULL; |
4977 | bb->il.gimple.phi_nodes = NULL; | |
7dfb44a0 | 4978 | rtl_profile_for_bb (bb); |
e0dde8f8 | 4979 | init_rtl_bb_info (bb); |
4980 | bb->flags |= BB_RTL; | |
4981 | ||
63f88450 | 4982 | /* Remove the RETURN_EXPR if we may fall though to the exit |
4983 | instead. */ | |
75a70cf9 | 4984 | gsi = gsi_last (stmts); |
4985 | if (!gsi_end_p (gsi) | |
4986 | && gimple_code (gsi_stmt (gsi)) == GIMPLE_RETURN) | |
63f88450 | 4987 | { |
1a91d914 | 4988 | greturn *ret_stmt = as_a <greturn *> (gsi_stmt (gsi)); |
63f88450 | 4989 | |
4990 | gcc_assert (single_succ_p (bb)); | |
34154e27 | 4991 | gcc_assert (single_succ (bb) == EXIT_BLOCK_PTR_FOR_FN (cfun)); |
63f88450 | 4992 | |
34154e27 | 4993 | if (bb->next_bb == EXIT_BLOCK_PTR_FOR_FN (cfun) |
75a70cf9 | 4994 | && !gimple_return_retval (ret_stmt)) |
63f88450 | 4995 | { |
75a70cf9 | 4996 | gsi_remove (&gsi, false); |
63f88450 | 4997 | single_succ_edge (bb)->flags |= EDGE_FALLTHRU; |
4998 | } | |
4999 | } | |
5000 | ||
75a70cf9 | 5001 | gsi = gsi_start (stmts); |
5002 | if (!gsi_end_p (gsi)) | |
6313ae8b | 5003 | { |
75a70cf9 | 5004 | stmt = gsi_stmt (gsi); |
5005 | if (gimple_code (stmt) != GIMPLE_LABEL) | |
5006 | stmt = NULL; | |
6313ae8b | 5007 | } |
0ec80471 | 5008 | |
0699065d | 5009 | rtx_code_label **elt = lab_rtx_for_bb->get (bb); |
6313ae8b | 5010 | |
5011 | if (stmt || elt) | |
0ec80471 | 5012 | { |
5013 | last = get_last_insn (); | |
5014 | ||
6313ae8b | 5015 | if (stmt) |
5016 | { | |
16c9337c | 5017 | expand_gimple_stmt (stmt); |
75a70cf9 | 5018 | gsi_next (&gsi); |
6313ae8b | 5019 | } |
5020 | ||
5021 | if (elt) | |
5f8841a5 | 5022 | emit_label (*elt); |
0ec80471 | 5023 | |
491e04ef | 5024 | /* Java emits line number notes in the top of labels. |
a0c938f0 | 5025 | ??? Make this go away once line number notes are obsoleted. */ |
26bb3cb2 | 5026 | BB_HEAD (bb) = NEXT_INSN (last); |
6d7dc5b9 | 5027 | if (NOTE_P (BB_HEAD (bb))) |
26bb3cb2 | 5028 | BB_HEAD (bb) = NEXT_INSN (BB_HEAD (bb)); |
0ec80471 | 5029 | note = emit_note_after (NOTE_INSN_BASIC_BLOCK, BB_HEAD (bb)); |
49377e21 | 5030 | |
75a70cf9 | 5031 | maybe_dump_rtl_for_gimple_stmt (stmt, last); |
0ec80471 | 5032 | } |
5033 | else | |
26bb3cb2 | 5034 | BB_HEAD (bb) = note = emit_note (NOTE_INSN_BASIC_BLOCK); |
0ec80471 | 5035 | |
5036 | NOTE_BASIC_BLOCK (note) = bb; | |
5037 | ||
75a70cf9 | 5038 | for (; !gsi_end_p (gsi); gsi_next (&gsi)) |
0ec80471 | 5039 | { |
c578459e | 5040 | basic_block new_bb; |
0ec80471 | 5041 | |
9845d120 | 5042 | stmt = gsi_stmt (gsi); |
3c800ea7 | 5043 | |
5044 | /* If this statement is a non-debug one, and we generate debug | |
5045 | insns, then this one might be the last real use of a TERed | |
5046 | SSA_NAME, but where there are still some debug uses further | |
5047 | down. Expanding the current SSA name in such further debug | |
5048 | uses by their RHS might lead to wrong debug info, as coalescing | |
5049 | might make the operands of such RHS be placed into the same | |
5050 | pseudo as something else. Like so: | |
5051 | a_1 = a_0 + 1; // Assume a_1 is TERed and a_0 is dead | |
5052 | use(a_1); | |
5053 | a_2 = ... | |
5054 | #DEBUG ... => a_1 | |
5055 | As a_0 and a_2 don't overlap in lifetime, assume they are coalesced. | |
5056 | If we now would expand a_1 by it's RHS (a_0 + 1) in the debug use, | |
5057 | the write to a_2 would actually have clobbered the place which | |
5058 | formerly held a_0. | |
5059 | ||
5060 | So, instead of that, we recognize the situation, and generate | |
5061 | debug temporaries at the last real use of TERed SSA names: | |
5062 | a_1 = a_0 + 1; | |
5063 | #DEBUG #D1 => a_1 | |
5064 | use(a_1); | |
5065 | a_2 = ... | |
5066 | #DEBUG ... => #D1 | |
5067 | */ | |
5068 | if (MAY_HAVE_DEBUG_INSNS | |
5069 | && SA.values | |
5070 | && !is_gimple_debug (stmt)) | |
5071 | { | |
5072 | ssa_op_iter iter; | |
5073 | tree op; | |
5074 | gimple def; | |
5075 | ||
5169661d | 5076 | location_t sloc = curr_insn_location (); |
3c800ea7 | 5077 | |
5078 | /* Look for SSA names that have their last use here (TERed | |
5079 | names always have only one real use). */ | |
5080 | FOR_EACH_SSA_TREE_OPERAND (op, stmt, iter, SSA_OP_USE) | |
5081 | if ((def = get_gimple_for_ssa_name (op))) | |
5082 | { | |
5083 | imm_use_iterator imm_iter; | |
5084 | use_operand_p use_p; | |
5085 | bool have_debug_uses = false; | |
5086 | ||
5087 | FOR_EACH_IMM_USE_FAST (use_p, imm_iter, op) | |
5088 | { | |
5089 | if (gimple_debug_bind_p (USE_STMT (use_p))) | |
5090 | { | |
5091 | have_debug_uses = true; | |
5092 | break; | |
5093 | } | |
5094 | } | |
5095 | ||
5096 | if (have_debug_uses) | |
5097 | { | |
5098 | /* OP is a TERed SSA name, with DEF it's defining | |
5099 | statement, and where OP is used in further debug | |
5100 | instructions. Generate a debug temporary, and | |
5101 | replace all uses of OP in debug insns with that | |
5102 | temporary. */ | |
5103 | gimple debugstmt; | |
5104 | tree value = gimple_assign_rhs_to_tree (def); | |
5105 | tree vexpr = make_node (DEBUG_EXPR_DECL); | |
5106 | rtx val; | |
3754d046 | 5107 | machine_mode mode; |
3c800ea7 | 5108 | |
5169661d | 5109 | set_curr_insn_location (gimple_location (def)); |
3c800ea7 | 5110 | |
5111 | DECL_ARTIFICIAL (vexpr) = 1; | |
5112 | TREE_TYPE (vexpr) = TREE_TYPE (value); | |
5113 | if (DECL_P (value)) | |
5114 | mode = DECL_MODE (value); | |
5115 | else | |
5116 | mode = TYPE_MODE (TREE_TYPE (value)); | |
5117 | DECL_MODE (vexpr) = mode; | |
5118 | ||
5119 | val = gen_rtx_VAR_LOCATION | |
5120 | (mode, vexpr, (rtx)value, VAR_INIT_STATUS_INITIALIZED); | |
5121 | ||
3e549002 | 5122 | emit_debug_insn (val); |
3c800ea7 | 5123 | |
5124 | FOR_EACH_IMM_USE_STMT (debugstmt, imm_iter, op) | |
5125 | { | |
5126 | if (!gimple_debug_bind_p (debugstmt)) | |
5127 | continue; | |
5128 | ||
5129 | FOR_EACH_IMM_USE_ON_STMT (use_p, imm_iter) | |
5130 | SET_USE (use_p, vexpr); | |
5131 | ||
5132 | update_stmt (debugstmt); | |
5133 | } | |
5134 | } | |
5135 | } | |
5169661d | 5136 | set_curr_insn_location (sloc); |
3c800ea7 | 5137 | } |
5138 | ||
8cee8dc0 | 5139 | currently_expanding_gimple_stmt = stmt; |
9845d120 | 5140 | |
0ec80471 | 5141 | /* Expand this statement, then evaluate the resulting RTL and |
5142 | fixup the CFG accordingly. */ | |
75a70cf9 | 5143 | if (gimple_code (stmt) == GIMPLE_COND) |
c578459e | 5144 | { |
1a91d914 | 5145 | new_bb = expand_gimple_cond (bb, as_a <gcond *> (stmt)); |
c578459e | 5146 | if (new_bb) |
5147 | return new_bb; | |
5148 | } | |
9845d120 | 5149 | else if (gimple_debug_bind_p (stmt)) |
5150 | { | |
5169661d | 5151 | location_t sloc = curr_insn_location (); |
9845d120 | 5152 | gimple_stmt_iterator nsi = gsi; |
5153 | ||
5154 | for (;;) | |
5155 | { | |
5156 | tree var = gimple_debug_bind_get_var (stmt); | |
5157 | tree value; | |
5158 | rtx val; | |
3754d046 | 5159 | machine_mode mode; |
9845d120 | 5160 | |
9bae88bc | 5161 | if (TREE_CODE (var) != DEBUG_EXPR_DECL |
5162 | && TREE_CODE (var) != LABEL_DECL | |
5163 | && !target_for_debug_bind (var)) | |
5164 | goto delink_debug_stmt; | |
5165 | ||
9845d120 | 5166 | if (gimple_debug_bind_has_value_p (stmt)) |
5167 | value = gimple_debug_bind_get_value (stmt); | |
5168 | else | |
5169 | value = NULL_TREE; | |
5170 | ||
5171 | last = get_last_insn (); | |
5172 | ||
5169661d | 5173 | set_curr_insn_location (gimple_location (stmt)); |
9845d120 | 5174 | |
5175 | if (DECL_P (var)) | |
5176 | mode = DECL_MODE (var); | |
5177 | else | |
5178 | mode = TYPE_MODE (TREE_TYPE (var)); | |
5179 | ||
5180 | val = gen_rtx_VAR_LOCATION | |
5181 | (mode, var, (rtx)value, VAR_INIT_STATUS_INITIALIZED); | |
5182 | ||
1084097d | 5183 | emit_debug_insn (val); |
9845d120 | 5184 | |
5185 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
5186 | { | |
5187 | /* We can't dump the insn with a TREE where an RTX | |
5188 | is expected. */ | |
3e549002 | 5189 | PAT_VAR_LOCATION_LOC (val) = const0_rtx; |
9845d120 | 5190 | maybe_dump_rtl_for_gimple_stmt (stmt, last); |
3e549002 | 5191 | PAT_VAR_LOCATION_LOC (val) = (rtx)value; |
9845d120 | 5192 | } |
5193 | ||
9bae88bc | 5194 | delink_debug_stmt: |
3c800ea7 | 5195 | /* In order not to generate too many debug temporaries, |
5196 | we delink all uses of debug statements we already expanded. | |
5197 | Therefore debug statements between definition and real | |
5198 | use of TERed SSA names will continue to use the SSA name, | |
5199 | and not be replaced with debug temps. */ | |
5200 | delink_stmt_imm_use (stmt); | |
5201 | ||
9845d120 | 5202 | gsi = nsi; |
5203 | gsi_next (&nsi); | |
5204 | if (gsi_end_p (nsi)) | |
5205 | break; | |
5206 | stmt = gsi_stmt (nsi); | |
5207 | if (!gimple_debug_bind_p (stmt)) | |
5208 | break; | |
5209 | } | |
5210 | ||
5169661d | 5211 | set_curr_insn_location (sloc); |
841424cc | 5212 | } |
5213 | else if (gimple_debug_source_bind_p (stmt)) | |
5214 | { | |
5169661d | 5215 | location_t sloc = curr_insn_location (); |
841424cc | 5216 | tree var = gimple_debug_source_bind_get_var (stmt); |
5217 | tree value = gimple_debug_source_bind_get_value (stmt); | |
5218 | rtx val; | |
3754d046 | 5219 | machine_mode mode; |
841424cc | 5220 | |
5221 | last = get_last_insn (); | |
5222 | ||
5169661d | 5223 | set_curr_insn_location (gimple_location (stmt)); |
841424cc | 5224 | |
5225 | mode = DECL_MODE (var); | |
5226 | ||
5227 | val = gen_rtx_VAR_LOCATION (mode, var, (rtx)value, | |
5228 | VAR_INIT_STATUS_UNINITIALIZED); | |
5229 | ||
5230 | emit_debug_insn (val); | |
5231 | ||
5232 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
5233 | { | |
5234 | /* We can't dump the insn with a TREE where an RTX | |
5235 | is expected. */ | |
5236 | PAT_VAR_LOCATION_LOC (val) = const0_rtx; | |
5237 | maybe_dump_rtl_for_gimple_stmt (stmt, last); | |
5238 | PAT_VAR_LOCATION_LOC (val) = (rtx)value; | |
5239 | } | |
5240 | ||
5169661d | 5241 | set_curr_insn_location (sloc); |
9845d120 | 5242 | } |
3ced8962 | 5243 | else |
0ec80471 | 5244 | { |
1a91d914 | 5245 | gcall *call_stmt = dyn_cast <gcall *> (stmt); |
5246 | if (call_stmt | |
5247 | && gimple_call_tail_p (call_stmt) | |
3c919612 | 5248 | && disable_tail_calls) |
1a91d914 | 5249 | gimple_call_set_tail (call_stmt, false); |
3c919612 | 5250 | |
1a91d914 | 5251 | if (call_stmt && gimple_call_tail_p (call_stmt)) |
c578459e | 5252 | { |
5253 | bool can_fallthru; | |
1a91d914 | 5254 | new_bb = expand_gimple_tailcall (bb, call_stmt, &can_fallthru); |
c578459e | 5255 | if (new_bb) |
5256 | { | |
5257 | if (can_fallthru) | |
5258 | bb = new_bb; | |
5259 | else | |
5260 | return new_bb; | |
5261 | } | |
5262 | } | |
2a3ebafa | 5263 | else |
49377e21 | 5264 | { |
a8dd994c | 5265 | def_operand_p def_p; |
a8dd994c | 5266 | def_p = SINGLE_SSA_DEF_OPERAND (stmt, SSA_OP_DEF); |
5267 | ||
5268 | if (def_p != NULL) | |
5269 | { | |
5270 | /* Ignore this stmt if it is in the list of | |
5271 | replaceable expressions. */ | |
5272 | if (SA.values | |
48e1416a | 5273 | && bitmap_bit_p (SA.values, |
dfdbf3fd | 5274 | SSA_NAME_VERSION (DEF_FROM_PTR (def_p)))) |
a8dd994c | 5275 | continue; |
5276 | } | |
16c9337c | 5277 | last = expand_gimple_stmt (stmt); |
75a70cf9 | 5278 | maybe_dump_rtl_for_gimple_stmt (stmt, last); |
49377e21 | 5279 | } |
0ec80471 | 5280 | } |
5281 | } | |
5282 | ||
8cee8dc0 | 5283 | currently_expanding_gimple_stmt = NULL; |
5284 | ||
9c388755 | 5285 | /* Expand implicit goto and convert goto_locus. */ |
63f88450 | 5286 | FOR_EACH_EDGE (e, ei, bb->succs) |
5287 | { | |
8e7408e3 | 5288 | if (e->goto_locus != UNKNOWN_LOCATION) |
5169661d | 5289 | set_curr_insn_location (e->goto_locus); |
9c388755 | 5290 | if ((e->flags & EDGE_FALLTHRU) && e->dest != bb->next_bb) |
5291 | { | |
5292 | emit_jump (label_rtx_for_bb (e->dest)); | |
5293 | e->flags &= ~EDGE_FALLTHRU; | |
5294 | } | |
63f88450 | 5295 | } |
5296 | ||
8a9ad55b | 5297 | /* Expanded RTL can create a jump in the last instruction of block. |
5298 | This later might be assumed to be a jump to successor and break edge insertion. | |
5299 | We need to insert dummy move to prevent this. PR41440. */ | |
5300 | if (single_succ_p (bb) | |
5301 | && (single_succ_edge (bb)->flags & EDGE_FALLTHRU) | |
5302 | && (last = get_last_insn ()) | |
5303 | && JUMP_P (last)) | |
5304 | { | |
5305 | rtx dummy = gen_reg_rtx (SImode); | |
5306 | emit_insn_after_noloc (gen_move_insn (dummy, dummy), last, NULL); | |
5307 | } | |
5308 | ||
0ec80471 | 5309 | do_pending_stack_adjust (); |
5310 | ||
822e391f | 5311 | /* Find the block tail. The last insn in the block is the insn |
0ec80471 | 5312 | before a barrier and/or table jump insn. */ |
5313 | last = get_last_insn (); | |
6d7dc5b9 | 5314 | if (BARRIER_P (last)) |
0ec80471 | 5315 | last = PREV_INSN (last); |
5316 | if (JUMP_TABLE_DATA_P (last)) | |
5317 | last = PREV_INSN (PREV_INSN (last)); | |
26bb3cb2 | 5318 | BB_END (bb) = last; |
491e04ef | 5319 | |
0ec80471 | 5320 | update_bb_for_insn (bb); |
3ced8962 | 5321 | |
0ec80471 | 5322 | return bb; |
5323 | } | |
5324 | ||
5325 | ||
5326 | /* Create a basic block for initialization code. */ | |
5327 | ||
5328 | static basic_block | |
5329 | construct_init_block (void) | |
5330 | { | |
5331 | basic_block init_block, first_block; | |
9a755727 | 5332 | edge e = NULL; |
5333 | int flags; | |
e20bf721 | 5334 | |
9a755727 | 5335 | /* Multiple entry points not supported yet. */ |
34154e27 | 5336 | gcc_assert (EDGE_COUNT (ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs) == 1); |
5337 | init_rtl_bb_info (ENTRY_BLOCK_PTR_FOR_FN (cfun)); | |
5338 | init_rtl_bb_info (EXIT_BLOCK_PTR_FOR_FN (cfun)); | |
5339 | ENTRY_BLOCK_PTR_FOR_FN (cfun)->flags |= BB_RTL; | |
5340 | EXIT_BLOCK_PTR_FOR_FN (cfun)->flags |= BB_RTL; | |
0ec80471 | 5341 | |
34154e27 | 5342 | e = EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun), 0); |
e20bf721 | 5343 | |
9a755727 | 5344 | /* When entry edge points to first basic block, we don't need jump, |
5345 | otherwise we have to jump into proper target. */ | |
34154e27 | 5346 | if (e && e->dest != ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb) |
9a755727 | 5347 | { |
75a70cf9 | 5348 | tree label = gimple_block_label (e->dest); |
9a755727 | 5349 | |
5350 | emit_jump (label_rtx (label)); | |
5351 | flags = 0; | |
e20bf721 | 5352 | } |
9a755727 | 5353 | else |
5354 | flags = EDGE_FALLTHRU; | |
0ec80471 | 5355 | |
5356 | init_block = create_basic_block (NEXT_INSN (get_insns ()), | |
5357 | get_last_insn (), | |
34154e27 | 5358 | ENTRY_BLOCK_PTR_FOR_FN (cfun)); |
5359 | init_block->frequency = ENTRY_BLOCK_PTR_FOR_FN (cfun)->frequency; | |
5360 | init_block->count = ENTRY_BLOCK_PTR_FOR_FN (cfun)->count; | |
b3083327 | 5361 | add_bb_to_loop (init_block, ENTRY_BLOCK_PTR_FOR_FN (cfun)->loop_father); |
0ec80471 | 5362 | if (e) |
5363 | { | |
5364 | first_block = e->dest; | |
5365 | redirect_edge_succ (e, init_block); | |
9a755727 | 5366 | e = make_edge (init_block, first_block, flags); |
0ec80471 | 5367 | } |
5368 | else | |
34154e27 | 5369 | e = make_edge (init_block, EXIT_BLOCK_PTR_FOR_FN (cfun), EDGE_FALLTHRU); |
0ec80471 | 5370 | e->probability = REG_BR_PROB_BASE; |
34154e27 | 5371 | e->count = ENTRY_BLOCK_PTR_FOR_FN (cfun)->count; |
0ec80471 | 5372 | |
5373 | update_bb_for_insn (init_block); | |
5374 | return init_block; | |
5375 | } | |
5376 | ||
375c1c8a | 5377 | /* For each lexical block, set BLOCK_NUMBER to the depth at which it is |
5378 | found in the block tree. */ | |
5379 | ||
5380 | static void | |
5381 | set_block_levels (tree block, int level) | |
5382 | { | |
5383 | while (block) | |
5384 | { | |
5385 | BLOCK_NUMBER (block) = level; | |
5386 | set_block_levels (BLOCK_SUBBLOCKS (block), level + 1); | |
5387 | block = BLOCK_CHAIN (block); | |
5388 | } | |
5389 | } | |
0ec80471 | 5390 | |
5391 | /* Create a block containing landing pads and similar stuff. */ | |
5392 | ||
5393 | static void | |
5394 | construct_exit_block (void) | |
5395 | { | |
74a0cbc4 | 5396 | rtx_insn *head = get_last_insn (); |
5397 | rtx_insn *end; | |
0ec80471 | 5398 | basic_block exit_block; |
cd665a06 | 5399 | edge e, e2; |
5400 | unsigned ix; | |
5401 | edge_iterator ei; | |
04e7d9cb | 5402 | basic_block prev_bb = EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb; |
74a0cbc4 | 5403 | rtx_insn *orig_end = BB_END (prev_bb); |
0ec80471 | 5404 | |
34154e27 | 5405 | rtl_profile_for_bb (EXIT_BLOCK_PTR_FOR_FN (cfun)); |
7dfb44a0 | 5406 | |
491e04ef | 5407 | /* Make sure the locus is set to the end of the function, so that |
0ec80471 | 5408 | epilogue line numbers and warnings are set properly. */ |
8e7408e3 | 5409 | if (LOCATION_LOCUS (cfun->function_end_locus) != UNKNOWN_LOCATION) |
0ec80471 | 5410 | input_location = cfun->function_end_locus; |
5411 | ||
0ec80471 | 5412 | /* Generate rtl for function exit. */ |
5413 | expand_function_end (); | |
5414 | ||
5415 | end = get_last_insn (); | |
5416 | if (head == end) | |
5417 | return; | |
04e7d9cb | 5418 | /* While emitting the function end we could move end of the last basic |
5419 | block. */ | |
26bb3cb2 | 5420 | BB_END (prev_bb) = orig_end; |
6d7dc5b9 | 5421 | while (NEXT_INSN (head) && NOTE_P (NEXT_INSN (head))) |
0ec80471 | 5422 | head = NEXT_INSN (head); |
04e7d9cb | 5423 | /* But make sure exit_block starts with RETURN_LABEL, otherwise the |
5424 | bb frequency counting will be confused. Any instructions before that | |
5425 | label are emitted for the case where PREV_BB falls through into the | |
5426 | exit block, so append those instructions to prev_bb in that case. */ | |
5427 | if (NEXT_INSN (head) != return_label) | |
5428 | { | |
5429 | while (NEXT_INSN (head) != return_label) | |
5430 | { | |
5431 | if (!NOTE_P (NEXT_INSN (head))) | |
26bb3cb2 | 5432 | BB_END (prev_bb) = NEXT_INSN (head); |
04e7d9cb | 5433 | head = NEXT_INSN (head); |
5434 | } | |
5435 | } | |
5436 | exit_block = create_basic_block (NEXT_INSN (head), end, prev_bb); | |
34154e27 | 5437 | exit_block->frequency = EXIT_BLOCK_PTR_FOR_FN (cfun)->frequency; |
5438 | exit_block->count = EXIT_BLOCK_PTR_FOR_FN (cfun)->count; | |
b3083327 | 5439 | add_bb_to_loop (exit_block, EXIT_BLOCK_PTR_FOR_FN (cfun)->loop_father); |
cd665a06 | 5440 | |
5441 | ix = 0; | |
34154e27 | 5442 | while (ix < EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)) |
0ec80471 | 5443 | { |
34154e27 | 5444 | e = EDGE_PRED (EXIT_BLOCK_PTR_FOR_FN (cfun), ix); |
0ec80471 | 5445 | if (!(e->flags & EDGE_ABNORMAL)) |
cd665a06 | 5446 | redirect_edge_succ (e, exit_block); |
5447 | else | |
5448 | ix++; | |
0ec80471 | 5449 | } |
cd665a06 | 5450 | |
34154e27 | 5451 | e = make_edge (exit_block, EXIT_BLOCK_PTR_FOR_FN (cfun), EDGE_FALLTHRU); |
0ec80471 | 5452 | e->probability = REG_BR_PROB_BASE; |
34154e27 | 5453 | e->count = EXIT_BLOCK_PTR_FOR_FN (cfun)->count; |
5454 | FOR_EACH_EDGE (e2, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds) | |
0ec80471 | 5455 | if (e2 != e) |
5456 | { | |
a0c938f0 | 5457 | e->count -= e2->count; |
0ec80471 | 5458 | exit_block->count -= e2->count; |
5459 | exit_block->frequency -= EDGE_FREQUENCY (e2); | |
5460 | } | |
5461 | if (e->count < 0) | |
5462 | e->count = 0; | |
5463 | if (exit_block->count < 0) | |
5464 | exit_block->count = 0; | |
5465 | if (exit_block->frequency < 0) | |
5466 | exit_block->frequency = 0; | |
5467 | update_bb_for_insn (exit_block); | |
5468 | } | |
5469 | ||
a0c938f0 | 5470 | /* Helper function for discover_nonconstant_array_refs. |
9d5aa3bd | 5471 | Look for ARRAY_REF nodes with non-constant indexes and mark them |
5472 | addressable. */ | |
5473 | ||
5474 | static tree | |
5475 | discover_nonconstant_array_refs_r (tree * tp, int *walk_subtrees, | |
5476 | void *data ATTRIBUTE_UNUSED) | |
5477 | { | |
5478 | tree t = *tp; | |
5479 | ||
5480 | if (IS_TYPE_OR_DECL_P (t)) | |
5481 | *walk_subtrees = 0; | |
5482 | else if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF) | |
5483 | { | |
5484 | while (((TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF) | |
5485 | && is_gimple_min_invariant (TREE_OPERAND (t, 1)) | |
5486 | && (!TREE_OPERAND (t, 2) | |
5487 | || is_gimple_min_invariant (TREE_OPERAND (t, 2)))) | |
5488 | || (TREE_CODE (t) == COMPONENT_REF | |
5489 | && (!TREE_OPERAND (t,2) | |
5490 | || is_gimple_min_invariant (TREE_OPERAND (t, 2)))) | |
5491 | || TREE_CODE (t) == BIT_FIELD_REF | |
5492 | || TREE_CODE (t) == REALPART_EXPR | |
5493 | || TREE_CODE (t) == IMAGPART_EXPR | |
5494 | || TREE_CODE (t) == VIEW_CONVERT_EXPR | |
72dd6141 | 5495 | || CONVERT_EXPR_P (t)) |
9d5aa3bd | 5496 | t = TREE_OPERAND (t, 0); |
5497 | ||
5498 | if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF) | |
5499 | { | |
5500 | t = get_base_address (t); | |
9a60c3b9 | 5501 | if (t && DECL_P (t) |
5502 | && DECL_MODE (t) != BLKmode) | |
9d5aa3bd | 5503 | TREE_ADDRESSABLE (t) = 1; |
5504 | } | |
5505 | ||
5506 | *walk_subtrees = 0; | |
5507 | } | |
5508 | ||
5509 | return NULL_TREE; | |
5510 | } | |
5511 | ||
5512 | /* RTL expansion is not able to compile array references with variable | |
5513 | offsets for arrays stored in single register. Discover such | |
5514 | expressions and mark variables as addressable to avoid this | |
5515 | scenario. */ | |
5516 | ||
5517 | static void | |
5518 | discover_nonconstant_array_refs (void) | |
5519 | { | |
5520 | basic_block bb; | |
75a70cf9 | 5521 | gimple_stmt_iterator gsi; |
9d5aa3bd | 5522 | |
fc00614f | 5523 | FOR_EACH_BB_FN (bb, cfun) |
75a70cf9 | 5524 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
5525 | { | |
5526 | gimple stmt = gsi_stmt (gsi); | |
f4b490ea | 5527 | if (!is_gimple_debug (stmt)) |
5528 | walk_gimple_op (stmt, discover_nonconstant_array_refs_r, NULL); | |
75a70cf9 | 5529 | } |
9d5aa3bd | 5530 | } |
5531 | ||
27a7a23a | 5532 | /* This function sets crtl->args.internal_arg_pointer to a virtual |
5533 | register if DRAP is needed. Local register allocator will replace | |
5534 | virtual_incoming_args_rtx with the virtual register. */ | |
5535 | ||
5536 | static void | |
5537 | expand_stack_alignment (void) | |
5538 | { | |
5539 | rtx drap_rtx; | |
9e1c1bf0 | 5540 | unsigned int preferred_stack_boundary; |
27a7a23a | 5541 | |
5542 | if (! SUPPORTS_STACK_ALIGNMENT) | |
5543 | return; | |
48e1416a | 5544 | |
27a7a23a | 5545 | if (cfun->calls_alloca |
5546 | || cfun->has_nonlocal_label | |
5547 | || crtl->has_nonlocal_goto) | |
5548 | crtl->need_drap = true; | |
5549 | ||
c0a05dc0 | 5550 | /* Call update_stack_boundary here again to update incoming stack |
5551 | boundary. It may set incoming stack alignment to a different | |
5552 | value after RTL expansion. TARGET_FUNCTION_OK_FOR_SIBCALL may | |
5553 | use the minimum incoming stack alignment to check if it is OK | |
5554 | to perform sibcall optimization since sibcall optimization will | |
5555 | only align the outgoing stack to incoming stack boundary. */ | |
5556 | if (targetm.calls.update_stack_boundary) | |
5557 | targetm.calls.update_stack_boundary (); | |
5558 | ||
5559 | /* The incoming stack frame has to be aligned at least at | |
5560 | parm_stack_boundary. */ | |
5561 | gcc_assert (crtl->parm_stack_boundary <= INCOMING_STACK_BOUNDARY); | |
27a7a23a | 5562 | |
27a7a23a | 5563 | /* Update crtl->stack_alignment_estimated and use it later to align |
5564 | stack. We check PREFERRED_STACK_BOUNDARY if there may be non-call | |
5565 | exceptions since callgraph doesn't collect incoming stack alignment | |
5566 | in this case. */ | |
cbeb677e | 5567 | if (cfun->can_throw_non_call_exceptions |
27a7a23a | 5568 | && PREFERRED_STACK_BOUNDARY > crtl->preferred_stack_boundary) |
5569 | preferred_stack_boundary = PREFERRED_STACK_BOUNDARY; | |
5570 | else | |
5571 | preferred_stack_boundary = crtl->preferred_stack_boundary; | |
5572 | if (preferred_stack_boundary > crtl->stack_alignment_estimated) | |
5573 | crtl->stack_alignment_estimated = preferred_stack_boundary; | |
5574 | if (preferred_stack_boundary > crtl->stack_alignment_needed) | |
5575 | crtl->stack_alignment_needed = preferred_stack_boundary; | |
5576 | ||
c0a05dc0 | 5577 | gcc_assert (crtl->stack_alignment_needed |
5578 | <= crtl->stack_alignment_estimated); | |
5579 | ||
27a7a23a | 5580 | crtl->stack_realign_needed |
9e1c1bf0 | 5581 | = INCOMING_STACK_BOUNDARY < crtl->stack_alignment_estimated; |
7b70fdf7 | 5582 | crtl->stack_realign_tried = crtl->stack_realign_needed; |
27a7a23a | 5583 | |
5584 | crtl->stack_realign_processed = true; | |
5585 | ||
5586 | /* Target has to redefine TARGET_GET_DRAP_RTX to support stack | |
5587 | alignment. */ | |
5588 | gcc_assert (targetm.calls.get_drap_rtx != NULL); | |
48e1416a | 5589 | drap_rtx = targetm.calls.get_drap_rtx (); |
27a7a23a | 5590 | |
f6754469 | 5591 | /* stack_realign_drap and drap_rtx must match. */ |
5592 | gcc_assert ((stack_realign_drap != 0) == (drap_rtx != NULL)); | |
5593 | ||
27a7a23a | 5594 | /* Do nothing if NULL is returned, which means DRAP is not needed. */ |
5595 | if (NULL != drap_rtx) | |
5596 | { | |
5597 | crtl->args.internal_arg_pointer = drap_rtx; | |
5598 | ||
5599 | /* Call fixup_tail_calls to clean up REG_EQUIV note if DRAP is | |
5600 | needed. */ | |
5601 | fixup_tail_calls (); | |
5602 | } | |
5603 | } | |
0e80b01d | 5604 | \f |
5605 | ||
5606 | static void | |
5607 | expand_main_function (void) | |
5608 | { | |
5609 | #if (defined(INVOKE__main) \ | |
5610 | || (!defined(HAS_INIT_SECTION) \ | |
5611 | && !defined(INIT_SECTION_ASM_OP) \ | |
5612 | && !defined(INIT_ARRAY_SECTION_ASM_OP))) | |
5613 | emit_library_call (init_one_libfunc (NAME__MAIN), LCT_NORMAL, VOIDmode, 0); | |
5614 | #endif | |
5615 | } | |
5616 | \f | |
5617 | ||
5618 | /* Expand code to initialize the stack_protect_guard. This is invoked at | |
5619 | the beginning of a function to be protected. */ | |
5620 | ||
5621 | #ifndef HAVE_stack_protect_set | |
5622 | # define HAVE_stack_protect_set 0 | |
5623 | # define gen_stack_protect_set(x,y) (gcc_unreachable (), NULL_RTX) | |
5624 | #endif | |
5625 | ||
5626 | static void | |
5627 | stack_protect_prologue (void) | |
5628 | { | |
5629 | tree guard_decl = targetm.stack_protect_guard (); | |
5630 | rtx x, y; | |
5631 | ||
5632 | x = expand_normal (crtl->stack_protect_guard); | |
5633 | y = expand_normal (guard_decl); | |
5634 | ||
5635 | /* Allow the target to copy from Y to X without leaking Y into a | |
5636 | register. */ | |
5637 | if (HAVE_stack_protect_set) | |
5638 | { | |
5639 | rtx insn = gen_stack_protect_set (x, y); | |
5640 | if (insn) | |
5641 | { | |
5642 | emit_insn (insn); | |
5643 | return; | |
5644 | } | |
5645 | } | |
5646 | ||
5647 | /* Otherwise do a straight move. */ | |
5648 | emit_move_insn (x, y); | |
5649 | } | |
27a7a23a | 5650 | |
0ec80471 | 5651 | /* Translate the intermediate representation contained in the CFG |
5652 | from GIMPLE trees to RTL. | |
5653 | ||
5654 | We do conversion per basic block and preserve/update the tree CFG. | |
5655 | This implies we have to do some magic as the CFG can simultaneously | |
5656 | consist of basic blocks containing RTL and GIMPLE trees. This can | |
2c763ed4 | 5657 | confuse the CFG hooks, so be careful to not manipulate CFG during |
0ec80471 | 5658 | the expansion. */ |
5659 | ||
65b0537f | 5660 | namespace { |
5661 | ||
5662 | const pass_data pass_data_expand = | |
5663 | { | |
5664 | RTL_PASS, /* type */ | |
5665 | "expand", /* name */ | |
5666 | OPTGROUP_NONE, /* optinfo_flags */ | |
65b0537f | 5667 | TV_EXPAND, /* tv_id */ |
5668 | ( PROP_ssa | PROP_gimple_leh | PROP_cfg | |
5669 | | PROP_gimple_lcx | |
5670 | | PROP_gimple_lvec ), /* properties_required */ | |
5671 | PROP_rtl, /* properties_provided */ | |
5672 | ( PROP_ssa | PROP_trees ), /* properties_destroyed */ | |
8b88439e | 5673 | 0, /* todo_flags_start */ |
65b0537f | 5674 | 0, /* todo_flags_finish */ |
5675 | }; | |
5676 | ||
5677 | class pass_expand : public rtl_opt_pass | |
5678 | { | |
5679 | public: | |
5680 | pass_expand (gcc::context *ctxt) | |
5681 | : rtl_opt_pass (pass_data_expand, ctxt) | |
5682 | {} | |
5683 | ||
5684 | /* opt_pass methods: */ | |
5685 | virtual unsigned int execute (function *); | |
5686 | ||
5687 | }; // class pass_expand | |
5688 | ||
5689 | unsigned int | |
5690 | pass_expand::execute (function *fun) | |
0ec80471 | 5691 | { |
5692 | basic_block bb, init_block; | |
5693 | sbitmap blocks; | |
ea06d49f | 5694 | edge_iterator ei; |
5695 | edge e; | |
74a0cbc4 | 5696 | rtx_insn *var_seq, *var_ret_seq; |
a8dd994c | 5697 | unsigned i; |
5698 | ||
e2050933 | 5699 | timevar_push (TV_OUT_OF_SSA); |
a8dd994c | 5700 | rewrite_out_of_ssa (&SA); |
e2050933 | 5701 | timevar_pop (TV_OUT_OF_SSA); |
ed7e2206 | 5702 | SA.partition_to_pseudo = XCNEWVEC (rtx, SA.map->num_partitions); |
0ec80471 | 5703 | |
212dddd3 | 5704 | /* Make sure all values used by the optimization passes have sane |
5705 | defaults. */ | |
5706 | reg_renumber = 0; | |
5707 | ||
723c0ee7 | 5708 | /* Some backends want to know that we are expanding to RTL. */ |
5709 | currently_expanding_to_rtl = 1; | |
821ac701 | 5710 | /* Dominators are not kept up-to-date as we may create new basic-blocks. */ |
5711 | free_dominance_info (CDI_DOMINATORS); | |
723c0ee7 | 5712 | |
65b0537f | 5713 | rtl_profile_for_bb (ENTRY_BLOCK_PTR_FOR_FN (fun)); |
7dfb44a0 | 5714 | |
058a1b7a | 5715 | if (chkp_function_instrumented_p (current_function_decl)) |
5716 | chkp_reset_rtl_bounds (); | |
5717 | ||
5169661d | 5718 | insn_locations_init (); |
c3771ec9 | 5719 | if (!DECL_IS_BUILTIN (current_function_decl)) |
30099c0c | 5720 | { |
5721 | /* Eventually, all FEs should explicitly set function_start_locus. */ | |
65b0537f | 5722 | if (LOCATION_LOCUS (fun->function_start_locus) == UNKNOWN_LOCATION) |
5723 | set_curr_insn_location | |
5724 | (DECL_SOURCE_LOCATION (current_function_decl)); | |
30099c0c | 5725 | else |
65b0537f | 5726 | set_curr_insn_location (fun->function_start_locus); |
30099c0c | 5727 | } |
0aecb55e | 5728 | else |
5169661d | 5729 | set_curr_insn_location (UNKNOWN_LOCATION); |
5730 | prologue_location = curr_insn_location (); | |
375c1c8a | 5731 | |
fdc86f97 | 5732 | #ifdef INSN_SCHEDULING |
5733 | init_sched_attrs (); | |
5734 | #endif | |
5735 | ||
375c1c8a | 5736 | /* Make sure first insn is a note even if we don't want linenums. |
5737 | This makes sure the first insn will never be deleted. | |
5738 | Also, final expects a note to appear there. */ | |
5739 | emit_note (NOTE_INSN_DELETED); | |
656047bf | 5740 | |
9d5aa3bd | 5741 | /* Mark arrays indexed with non-constant indices with TREE_ADDRESSABLE. */ |
5742 | discover_nonconstant_array_refs (); | |
5743 | ||
bc5e6ea1 | 5744 | targetm.expand_to_rtl_hook (); |
edb7afe8 | 5745 | crtl->stack_alignment_needed = STACK_BOUNDARY; |
27a7a23a | 5746 | crtl->max_used_stack_slot_alignment = STACK_BOUNDARY; |
c0a05dc0 | 5747 | crtl->stack_alignment_estimated = 0; |
edb7afe8 | 5748 | crtl->preferred_stack_boundary = STACK_BOUNDARY; |
65b0537f | 5749 | fun->cfg->max_jumptable_ents = 0; |
edb7afe8 | 5750 | |
b8a89e7e | 5751 | /* Resovle the function section. Some targets, like ARM EABI rely on knowledge |
5752 | of the function section at exapnsion time to predict distance of calls. */ | |
5753 | resolve_unique_section (current_function_decl, 0, flag_function_sections); | |
5754 | ||
280450fa | 5755 | /* Expand the variables recorded during gimple lowering. */ |
e2050933 | 5756 | timevar_push (TV_VAR_EXPAND); |
5be42b39 | 5757 | start_sequence (); |
5758 | ||
3c919612 | 5759 | var_ret_seq = expand_used_vars (); |
5be42b39 | 5760 | |
5761 | var_seq = get_insns (); | |
5762 | end_sequence (); | |
e2050933 | 5763 | timevar_pop (TV_VAR_EXPAND); |
0ec80471 | 5764 | |
f1a0edff | 5765 | /* Honor stack protection warnings. */ |
5766 | if (warn_stack_protect) | |
5767 | { | |
65b0537f | 5768 | if (fun->calls_alloca) |
48e1416a | 5769 | warning (OPT_Wstack_protector, |
b15b8239 | 5770 | "stack protector not protecting local variables: " |
65b0537f | 5771 | "variable length buffer"); |
edb7afe8 | 5772 | if (has_short_buffer && !crtl->stack_protect_guard) |
48e1416a | 5773 | warning (OPT_Wstack_protector, |
b15b8239 | 5774 | "stack protector not protecting function: " |
65b0537f | 5775 | "all local arrays are less than %d bytes long", |
f1a0edff | 5776 | (int) PARAM_VALUE (PARAM_SSP_BUFFER_SIZE)); |
5777 | } | |
5778 | ||
0ec80471 | 5779 | /* Set up parameters and prepare for return, for the function. */ |
82aa4bd5 | 5780 | expand_function_start (current_function_decl); |
0ec80471 | 5781 | |
5be42b39 | 5782 | /* If we emitted any instructions for setting up the variables, |
5783 | emit them before the FUNCTION_START note. */ | |
5784 | if (var_seq) | |
5785 | { | |
5786 | emit_insn_before (var_seq, parm_birth_insn); | |
5787 | ||
5788 | /* In expand_function_end we'll insert the alloca save/restore | |
5789 | before parm_birth_insn. We've just insertted an alloca call. | |
5790 | Adjust the pointer to match. */ | |
5791 | parm_birth_insn = var_seq; | |
5792 | } | |
5793 | ||
a8dd994c | 5794 | /* Now that we also have the parameter RTXs, copy them over to our |
5795 | partitions. */ | |
5796 | for (i = 0; i < SA.map->num_partitions; i++) | |
5797 | { | |
5798 | tree var = SSA_NAME_VAR (partition_to_var (SA.map, i)); | |
5799 | ||
5800 | if (TREE_CODE (var) != VAR_DECL | |
5801 | && !SA.partition_to_pseudo[i]) | |
5802 | SA.partition_to_pseudo[i] = DECL_RTL_IF_SET (var); | |
5803 | gcc_assert (SA.partition_to_pseudo[i]); | |
e32b531f | 5804 | |
5805 | /* If this decl was marked as living in multiple places, reset | |
65b0537f | 5806 | this now to NULL. */ |
e32b531f | 5807 | if (DECL_RTL_IF_SET (var) == pc_rtx) |
5808 | SET_DECL_RTL (var, NULL); | |
5809 | ||
a8dd994c | 5810 | /* Some RTL parts really want to look at DECL_RTL(x) when x |
65b0537f | 5811 | was a decl marked in REG_ATTR or MEM_ATTR. We could use |
a8dd994c | 5812 | SET_DECL_RTL here making this available, but that would mean |
5813 | to select one of the potentially many RTLs for one DECL. Instead | |
5814 | of doing that we simply reset the MEM_EXPR of the RTL in question, | |
5815 | then nobody can get at it and hence nobody can call DECL_RTL on it. */ | |
5816 | if (!DECL_RTL_SET_P (var)) | |
5817 | { | |
5818 | if (MEM_P (SA.partition_to_pseudo[i])) | |
5819 | set_mem_expr (SA.partition_to_pseudo[i], NULL); | |
5820 | } | |
5821 | } | |
5822 | ||
f2ca19b4 | 5823 | /* If we have a class containing differently aligned pointers |
5824 | we need to merge those into the corresponding RTL pointer | |
5825 | alignment. */ | |
5826 | for (i = 1; i < num_ssa_names; i++) | |
5827 | { | |
5828 | tree name = ssa_name (i); | |
5829 | int part; | |
5830 | rtx r; | |
5831 | ||
5832 | if (!name | |
f2ca19b4 | 5833 | /* We might have generated new SSA names in |
5834 | update_alias_info_with_stack_vars. They will have a NULL | |
5835 | defining statements, and won't be part of the partitioning, | |
5836 | so ignore those. */ | |
5837 | || !SSA_NAME_DEF_STMT (name)) | |
5838 | continue; | |
5839 | part = var_to_partition (SA.map, name); | |
5840 | if (part == NO_PARTITION) | |
5841 | continue; | |
ec11736b | 5842 | |
5843 | /* Adjust all partition members to get the underlying decl of | |
5844 | the representative which we might have created in expand_one_var. */ | |
5845 | if (SSA_NAME_VAR (name) == NULL_TREE) | |
5846 | { | |
5847 | tree leader = partition_to_var (SA.map, part); | |
5848 | gcc_assert (SSA_NAME_VAR (leader) != NULL_TREE); | |
5849 | replace_ssa_name_symbol (name, SSA_NAME_VAR (leader)); | |
5850 | } | |
5851 | if (!POINTER_TYPE_P (TREE_TYPE (name))) | |
5852 | continue; | |
5853 | ||
f2ca19b4 | 5854 | r = SA.partition_to_pseudo[part]; |
5855 | if (REG_P (r)) | |
5856 | mark_reg_pointer (r, get_pointer_alignment (name)); | |
5857 | } | |
5858 | ||
0ec80471 | 5859 | /* If this function is `main', emit a call to `__main' |
5860 | to run global initializers, etc. */ | |
5861 | if (DECL_NAME (current_function_decl) | |
5862 | && MAIN_NAME_P (DECL_NAME (current_function_decl)) | |
5863 | && DECL_FILE_SCOPE_P (current_function_decl)) | |
5864 | expand_main_function (); | |
5865 | ||
f1a0edff | 5866 | /* Initialize the stack_protect_guard field. This must happen after the |
5867 | call to __main (if any) so that the external decl is initialized. */ | |
edb7afe8 | 5868 | if (crtl->stack_protect_guard) |
f1a0edff | 5869 | stack_protect_prologue (); |
5870 | ||
a8dd994c | 5871 | expand_phi_nodes (&SA); |
5872 | ||
011e6b51 | 5873 | /* Register rtl specific functions for cfg. */ |
0ec80471 | 5874 | rtl_register_cfg_hooks (); |
5875 | ||
5876 | init_block = construct_init_block (); | |
5877 | ||
ea06d49f | 5878 | /* Clear EDGE_EXECUTABLE on the entry edge(s). It is cleaned from the |
a8dd994c | 5879 | remaining edges later. */ |
65b0537f | 5880 | FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (fun)->succs) |
ea06d49f | 5881 | e->flags &= ~EDGE_EXECUTABLE; |
5882 | ||
0699065d | 5883 | lab_rtx_for_bb = new hash_map<basic_block, rtx_code_label *>; |
65b0537f | 5884 | FOR_BB_BETWEEN (bb, init_block->next_bb, EXIT_BLOCK_PTR_FOR_FN (fun), |
34154e27 | 5885 | next_bb) |
3c919612 | 5886 | bb = expand_gimple_basic_block (bb, var_ret_seq != NULL_RTX); |
7dfb44a0 | 5887 | |
9845d120 | 5888 | if (MAY_HAVE_DEBUG_INSNS) |
5889 | expand_debug_locations (); | |
5890 | ||
3db65b62 | 5891 | /* Free stuff we no longer need after GIMPLE optimizations. */ |
5892 | free_dominance_info (CDI_DOMINATORS); | |
5893 | free_dominance_info (CDI_POST_DOMINATORS); | |
5894 | delete_tree_cfg_annotations (); | |
5895 | ||
e2050933 | 5896 | timevar_push (TV_OUT_OF_SSA); |
a8dd994c | 5897 | finish_out_of_ssa (&SA); |
e2050933 | 5898 | timevar_pop (TV_OUT_OF_SSA); |
a8dd994c | 5899 | |
e2050933 | 5900 | timevar_push (TV_POST_EXPAND); |
67817f0f | 5901 | /* We are no longer in SSA form. */ |
65b0537f | 5902 | fun->gimple_df->in_ssa_p = false; |
b3083327 | 5903 | loops_state_clear (LOOP_CLOSED_SSA); |
67817f0f | 5904 | |
7dfb44a0 | 5905 | /* Expansion is used by optimization passes too, set maybe_hot_insn_p |
5906 | conservatively to true until they are all profile aware. */ | |
5f8841a5 | 5907 | delete lab_rtx_for_bb; |
edb7afe8 | 5908 | free_histograms (); |
0ec80471 | 5909 | |
5910 | construct_exit_block (); | |
5169661d | 5911 | insn_locations_finalize (); |
0ec80471 | 5912 | |
3c919612 | 5913 | if (var_ret_seq) |
5914 | { | |
4cd001d5 | 5915 | rtx_insn *after = return_label; |
74a0cbc4 | 5916 | rtx_insn *next = NEXT_INSN (after); |
3c919612 | 5917 | if (next && NOTE_INSN_BASIC_BLOCK_P (next)) |
5918 | after = next; | |
5919 | emit_insn_after (var_ret_seq, after); | |
5920 | } | |
5921 | ||
e38def9c | 5922 | /* Zap the tree EH table. */ |
65b0537f | 5923 | set_eh_throw_stmt_table (fun, NULL); |
0ec80471 | 5924 | |
409e049a | 5925 | /* We need JUMP_LABEL be set in order to redirect jumps, and hence |
5926 | split edges which edge insertions might do. */ | |
0ec80471 | 5927 | rebuild_jump_labels (get_insns ()); |
0ec80471 | 5928 | |
65b0537f | 5929 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (fun), |
5930 | EXIT_BLOCK_PTR_FOR_FN (fun), next_bb) | |
a8dd994c | 5931 | { |
5932 | edge e; | |
5933 | edge_iterator ei; | |
5934 | for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) | |
5935 | { | |
5936 | if (e->insns.r) | |
4547eca6 | 5937 | { |
ae5e6486 | 5938 | rebuild_jump_labels_chain (e->insns.r); |
d699f73a | 5939 | /* Put insns after parm birth, but before |
5940 | NOTE_INSNS_FUNCTION_BEG. */ | |
65b0537f | 5941 | if (e->src == ENTRY_BLOCK_PTR_FOR_FN (fun) |
5942 | && single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (fun))) | |
4547eca6 | 5943 | { |
ae5e6486 | 5944 | rtx_insn *insns = e->insns.r; |
5945 | e->insns.r = NULL; | |
d699f73a | 5946 | if (NOTE_P (parm_birth_insn) |
5947 | && NOTE_KIND (parm_birth_insn) == NOTE_INSN_FUNCTION_BEG) | |
5948 | emit_insn_before_noloc (insns, parm_birth_insn, e->dest); | |
5949 | else | |
5950 | emit_insn_after_noloc (insns, parm_birth_insn, e->dest); | |
4547eca6 | 5951 | } |
5952 | else | |
5953 | commit_one_edge_insertion (e); | |
5954 | } | |
a8dd994c | 5955 | else |
5956 | ei_next (&ei); | |
5957 | } | |
5958 | } | |
5959 | ||
5960 | /* We're done expanding trees to RTL. */ | |
5961 | currently_expanding_to_rtl = 0; | |
5962 | ||
65b0537f | 5963 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (fun)->next_bb, |
5964 | EXIT_BLOCK_PTR_FOR_FN (fun), next_bb) | |
a8dd994c | 5965 | { |
5966 | edge e; | |
5967 | edge_iterator ei; | |
5968 | for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) | |
5969 | { | |
5970 | /* Clear EDGE_EXECUTABLE. This flag is never used in the backend. */ | |
5971 | e->flags &= ~EDGE_EXECUTABLE; | |
5972 | ||
5973 | /* At the moment not all abnormal edges match the RTL | |
5974 | representation. It is safe to remove them here as | |
5975 | find_many_sub_basic_blocks will rediscover them. | |
5976 | In the future we should get this fixed properly. */ | |
5977 | if ((e->flags & EDGE_ABNORMAL) | |
5978 | && !(e->flags & EDGE_SIBCALL)) | |
5979 | remove_edge (e); | |
5980 | else | |
5981 | ei_next (&ei); | |
5982 | } | |
5983 | } | |
5984 | ||
65b0537f | 5985 | blocks = sbitmap_alloc (last_basic_block_for_fn (fun)); |
53c5d9d4 | 5986 | bitmap_ones (blocks); |
0ec80471 | 5987 | find_many_sub_basic_blocks (blocks); |
0ec80471 | 5988 | sbitmap_free (blocks); |
a8dd994c | 5989 | purge_all_dead_edges (); |
0ec80471 | 5990 | |
27a7a23a | 5991 | expand_stack_alignment (); |
5992 | ||
212dddd3 | 5993 | /* Fixup REG_EQUIV notes in the prologue if there are tailcalls in this |
5994 | function. */ | |
5995 | if (crtl->tail_call_emit) | |
5996 | fixup_tail_calls (); | |
5997 | ||
1dd4980f | 5998 | /* After initial rtl generation, call back to finish generating |
5999 | exception support code. We need to do this before cleaning up | |
6000 | the CFG as the code does not expect dead landing pads. */ | |
65b0537f | 6001 | if (fun->eh->region_tree != NULL) |
1dd4980f | 6002 | finish_eh_generation (); |
6003 | ||
6004 | /* Remove unreachable blocks, otherwise we cannot compute dominators | |
6005 | which are needed for loop state verification. As a side-effect | |
6006 | this also compacts blocks. | |
6007 | ??? We cannot remove trivially dead insns here as for example | |
6008 | the DRAP reg on i?86 is not magically live at this point. | |
6009 | gcc.c-torture/execute/ipa-sra-2.c execution, -Os -m32 fails otherwise. */ | |
6010 | cleanup_cfg (CLEANUP_NO_INSN_DEL); | |
6011 | ||
0ec80471 | 6012 | #ifdef ENABLE_CHECKING |
d4473c84 | 6013 | verify_flow_info (); |
0ec80471 | 6014 | #endif |
0f9005dd | 6015 | |
212dddd3 | 6016 | /* Initialize pseudos allocated for hard registers. */ |
6017 | emit_initial_value_sets (); | |
6018 | ||
6019 | /* And finally unshare all RTL. */ | |
6020 | unshare_all_rtl (); | |
6021 | ||
0f9005dd | 6022 | /* There's no need to defer outputting this function any more; we |
6023 | know we want to output it. */ | |
6024 | DECL_DEFER_OUTPUT (current_function_decl) = 0; | |
6025 | ||
6026 | /* Now that we're done expanding trees to RTL, we shouldn't have any | |
6027 | more CONCATs anywhere. */ | |
6028 | generating_concat_p = 0; | |
6029 | ||
49377e21 | 6030 | if (dump_file) |
6031 | { | |
6032 | fprintf (dump_file, | |
6033 | "\n\n;;\n;; Full RTL generated for this function:\n;;\n"); | |
6034 | /* And the pass manager will dump RTL for us. */ | |
6035 | } | |
77fce4cd | 6036 | |
6037 | /* If we're emitting a nested function, make sure its parent gets | |
6038 | emitted as well. Doing otherwise confuses debug info. */ | |
65b0537f | 6039 | { |
6040 | tree parent; | |
6041 | for (parent = DECL_CONTEXT (current_function_decl); | |
6042 | parent != NULL_TREE; | |
6043 | parent = get_containing_scope (parent)) | |
6044 | if (TREE_CODE (parent) == FUNCTION_DECL) | |
6045 | TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (parent)) = 1; | |
6046 | } | |
a0c938f0 | 6047 | |
77fce4cd | 6048 | /* We are now committed to emitting code for this function. Do any |
6049 | preparation, such as emitting abstract debug info for the inline | |
6050 | before it gets mangled by optimization. */ | |
6051 | if (cgraph_function_possibly_inlined_p (current_function_decl)) | |
6052 | (*debug_hooks->outlining_inline_function) (current_function_decl); | |
6053 | ||
6054 | TREE_ASM_WRITTEN (current_function_decl) = 1; | |
1a56c787 | 6055 | |
6056 | /* After expanding, the return labels are no longer needed. */ | |
6057 | return_label = NULL; | |
6058 | naked_return_label = NULL; | |
4c0315d0 | 6059 | |
6060 | /* After expanding, the tm_restart map is no longer needed. */ | |
65b0537f | 6061 | if (fun->gimple_df->tm_restart) |
4c0315d0 | 6062 | { |
65b0537f | 6063 | htab_delete (fun->gimple_df->tm_restart); |
6064 | fun->gimple_df->tm_restart = NULL; | |
4c0315d0 | 6065 | } |
6066 | ||
375c1c8a | 6067 | /* Tag the blocks with a depth number so that change_scope can find |
6068 | the common parent easily. */ | |
65b0537f | 6069 | set_block_levels (DECL_INITIAL (fun->decl), 0); |
7dfb44a0 | 6070 | default_rtl_profile (); |
212dddd3 | 6071 | |
e2050933 | 6072 | timevar_pop (TV_POST_EXPAND); |
212dddd3 | 6073 | |
2a1990e9 | 6074 | return 0; |
0ec80471 | 6075 | } |
6076 | ||
cbe8bda8 | 6077 | } // anon namespace |
6078 | ||
6079 | rtl_opt_pass * | |
6080 | make_pass_expand (gcc::context *ctxt) | |
6081 | { | |
6082 | return new pass_expand (ctxt); | |
6083 | } |