]>
Commit | Line | Data |
---|---|---|
242229bb | 1 | /* A pass for lowering trees to RTL. |
3f30a9a6 | 2 | Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 |
66647d44 | 3 | Free Software Foundation, Inc. |
242229bb JH |
4 | |
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9dcd6f09 | 9 | the Free Software Foundation; either version 3, or (at your option) |
242229bb JH |
10 | any later version. |
11 | ||
12 | GCC is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
242229bb JH |
20 | |
21 | #include "config.h" | |
22 | #include "system.h" | |
23 | #include "coretypes.h" | |
24 | #include "tm.h" | |
25 | #include "tree.h" | |
26 | #include "rtl.h" | |
27 | #include "tm_p.h" | |
28 | #include "basic-block.h" | |
29 | #include "function.h" | |
30 | #include "expr.h" | |
31 | #include "langhooks.h" | |
32 | #include "tree-flow.h" | |
242229bb JH |
33 | #include "tree-pass.h" |
34 | #include "except.h" | |
35 | #include "flags.h" | |
1f6d3a08 | 36 | #include "diagnostic.h" |
cf835838 | 37 | #include "gimple-pretty-print.h" |
1f6d3a08 | 38 | #include "toplev.h" |
ef330312 | 39 | #include "debug.h" |
7d69de61 | 40 | #include "params.h" |
ff28a94d | 41 | #include "tree-inline.h" |
6946b3f7 | 42 | #include "value-prof.h" |
e41b2a33 | 43 | #include "target.h" |
4e3825db | 44 | #include "ssaexpand.h" |
7a8cba34 SB |
45 | #include "bitmap.h" |
46 | #include "sbitmap.h" | |
7d776ee2 | 47 | #include "cfgloop.h" |
be147e84 | 48 | #include "regs.h" /* For reg_renumber. */ |
2b21299c | 49 | #include "insn-attr.h" /* For INSN_SCHEDULING. */ |
726a989a | 50 | |
4e3825db MM |
51 | /* This variable holds information helping the rewriting of SSA trees |
52 | into RTL. */ | |
53 | struct ssaexpand SA; | |
54 | ||
a5883ba0 MM |
55 | /* This variable holds the currently expanded gimple statement for purposes |
56 | of comminucating the profile info to the builtin expanders. */ | |
57 | gimple currently_expanding_gimple_stmt; | |
58 | ||
ddb555ed JJ |
59 | static rtx expand_debug_expr (tree); |
60 | ||
726a989a RB |
61 | /* Return an expression tree corresponding to the RHS of GIMPLE |
62 | statement STMT. */ | |
63 | ||
64 | tree | |
65 | gimple_assign_rhs_to_tree (gimple stmt) | |
66 | { | |
67 | tree t; | |
82d6e6fc | 68 | enum gimple_rhs_class grhs_class; |
b8698a0f | 69 | |
82d6e6fc | 70 | grhs_class = get_gimple_rhs_class (gimple_expr_code (stmt)); |
726a989a | 71 | |
0354c0c7 BS |
72 | if (grhs_class == GIMPLE_TERNARY_RHS) |
73 | t = build3 (gimple_assign_rhs_code (stmt), | |
74 | TREE_TYPE (gimple_assign_lhs (stmt)), | |
75 | gimple_assign_rhs1 (stmt), | |
76 | gimple_assign_rhs2 (stmt), | |
77 | gimple_assign_rhs3 (stmt)); | |
78 | else if (grhs_class == GIMPLE_BINARY_RHS) | |
726a989a RB |
79 | t = build2 (gimple_assign_rhs_code (stmt), |
80 | TREE_TYPE (gimple_assign_lhs (stmt)), | |
81 | gimple_assign_rhs1 (stmt), | |
82 | gimple_assign_rhs2 (stmt)); | |
82d6e6fc | 83 | else if (grhs_class == GIMPLE_UNARY_RHS) |
726a989a RB |
84 | t = build1 (gimple_assign_rhs_code (stmt), |
85 | TREE_TYPE (gimple_assign_lhs (stmt)), | |
86 | gimple_assign_rhs1 (stmt)); | |
82d6e6fc | 87 | else if (grhs_class == GIMPLE_SINGLE_RHS) |
b5b8b0ac AO |
88 | { |
89 | t = gimple_assign_rhs1 (stmt); | |
90 | /* Avoid modifying this tree in place below. */ | |
d0ed412a JJ |
91 | if ((gimple_has_location (stmt) && CAN_HAVE_LOCATION_P (t) |
92 | && gimple_location (stmt) != EXPR_LOCATION (t)) | |
93 | || (gimple_block (stmt) | |
94 | && currently_expanding_to_rtl | |
5368224f | 95 | && EXPR_P (t))) |
b5b8b0ac AO |
96 | t = copy_node (t); |
97 | } | |
726a989a RB |
98 | else |
99 | gcc_unreachable (); | |
100 | ||
f5045c96 AM |
101 | if (gimple_has_location (stmt) && CAN_HAVE_LOCATION_P (t)) |
102 | SET_EXPR_LOCATION (t, gimple_location (stmt)); | |
103 | ||
726a989a RB |
104 | return t; |
105 | } | |
106 | ||
726a989a | 107 | |
1f6d3a08 RH |
108 | #ifndef STACK_ALIGNMENT_NEEDED |
109 | #define STACK_ALIGNMENT_NEEDED 1 | |
110 | #endif | |
111 | ||
4e3825db MM |
112 | #define SSAVAR(x) (TREE_CODE (x) == SSA_NAME ? SSA_NAME_VAR (x) : x) |
113 | ||
114 | /* Associate declaration T with storage space X. If T is no | |
115 | SSA name this is exactly SET_DECL_RTL, otherwise make the | |
116 | partition of T associated with X. */ | |
117 | static inline void | |
118 | set_rtl (tree t, rtx x) | |
119 | { | |
120 | if (TREE_CODE (t) == SSA_NAME) | |
121 | { | |
122 | SA.partition_to_pseudo[var_to_partition (SA.map, t)] = x; | |
123 | if (x && !MEM_P (x)) | |
124 | set_reg_attrs_for_decl_rtl (SSA_NAME_VAR (t), x); | |
eb7adebc MM |
125 | /* For the benefit of debug information at -O0 (where vartracking |
126 | doesn't run) record the place also in the base DECL if it's | |
127 | a normal variable (not a parameter). */ | |
128 | if (x && x != pc_rtx && TREE_CODE (SSA_NAME_VAR (t)) == VAR_DECL) | |
129 | { | |
130 | tree var = SSA_NAME_VAR (t); | |
131 | /* If we don't yet have something recorded, just record it now. */ | |
132 | if (!DECL_RTL_SET_P (var)) | |
133 | SET_DECL_RTL (var, x); | |
47598145 | 134 | /* If we have it set already to "multiple places" don't |
eb7adebc MM |
135 | change this. */ |
136 | else if (DECL_RTL (var) == pc_rtx) | |
137 | ; | |
138 | /* If we have something recorded and it's not the same place | |
139 | as we want to record now, we have multiple partitions for the | |
140 | same base variable, with different places. We can't just | |
141 | randomly chose one, hence we have to say that we don't know. | |
142 | This only happens with optimization, and there var-tracking | |
143 | will figure out the right thing. */ | |
144 | else if (DECL_RTL (var) != x) | |
145 | SET_DECL_RTL (var, pc_rtx); | |
146 | } | |
4e3825db MM |
147 | } |
148 | else | |
149 | SET_DECL_RTL (t, x); | |
150 | } | |
1f6d3a08 RH |
151 | |
152 | /* This structure holds data relevant to one variable that will be | |
153 | placed in a stack slot. */ | |
154 | struct stack_var | |
155 | { | |
156 | /* The Variable. */ | |
157 | tree decl; | |
158 | ||
1f6d3a08 RH |
159 | /* Initially, the size of the variable. Later, the size of the partition, |
160 | if this variable becomes it's partition's representative. */ | |
161 | HOST_WIDE_INT size; | |
162 | ||
163 | /* The *byte* alignment required for this variable. Or as, with the | |
164 | size, the alignment for this partition. */ | |
165 | unsigned int alignb; | |
166 | ||
167 | /* The partition representative. */ | |
168 | size_t representative; | |
169 | ||
170 | /* The next stack variable in the partition, or EOC. */ | |
171 | size_t next; | |
2bdbbe94 MM |
172 | |
173 | /* The numbers of conflicting stack variables. */ | |
174 | bitmap conflicts; | |
1f6d3a08 RH |
175 | }; |
176 | ||
177 | #define EOC ((size_t)-1) | |
178 | ||
179 | /* We have an array of such objects while deciding allocation. */ | |
180 | static struct stack_var *stack_vars; | |
181 | static size_t stack_vars_alloc; | |
182 | static size_t stack_vars_num; | |
47598145 | 183 | static struct pointer_map_t *decl_to_stack_part; |
1f6d3a08 | 184 | |
3f9b14ff SB |
185 | /* Conflict bitmaps go on this obstack. This allows us to destroy |
186 | all of them in one big sweep. */ | |
187 | static bitmap_obstack stack_var_bitmap_obstack; | |
188 | ||
fa10beec | 189 | /* An array of indices such that stack_vars[stack_vars_sorted[i]].size |
1f6d3a08 RH |
190 | is non-decreasing. */ |
191 | static size_t *stack_vars_sorted; | |
192 | ||
1f6d3a08 RH |
193 | /* The phase of the stack frame. This is the known misalignment of |
194 | virtual_stack_vars_rtx from PREFERRED_STACK_BOUNDARY. That is, | |
195 | (frame_offset+frame_phase) % PREFERRED_STACK_BOUNDARY == 0. */ | |
196 | static int frame_phase; | |
197 | ||
7d69de61 RH |
198 | /* Used during expand_used_vars to remember if we saw any decls for |
199 | which we'd like to enable stack smashing protection. */ | |
200 | static bool has_protected_decls; | |
201 | ||
202 | /* Used during expand_used_vars. Remember if we say a character buffer | |
203 | smaller than our cutoff threshold. Used for -Wstack-protector. */ | |
204 | static bool has_short_buffer; | |
1f6d3a08 | 205 | |
6f197850 | 206 | /* Compute the byte alignment to use for DECL. Ignore alignment |
765c3e8f L |
207 | we can't do with expected alignment of the stack boundary. */ |
208 | ||
209 | static unsigned int | |
6f197850 | 210 | align_local_variable (tree decl) |
765c3e8f | 211 | { |
3a42502d | 212 | unsigned int align = LOCAL_DECL_ALIGNMENT (decl); |
6f197850 | 213 | DECL_ALIGN (decl) = align; |
1f6d3a08 RH |
214 | return align / BITS_PER_UNIT; |
215 | } | |
216 | ||
217 | /* Allocate SIZE bytes at byte alignment ALIGN from the stack frame. | |
218 | Return the frame offset. */ | |
219 | ||
220 | static HOST_WIDE_INT | |
3a42502d | 221 | alloc_stack_frame_space (HOST_WIDE_INT size, unsigned HOST_WIDE_INT align) |
1f6d3a08 RH |
222 | { |
223 | HOST_WIDE_INT offset, new_frame_offset; | |
224 | ||
225 | new_frame_offset = frame_offset; | |
226 | if (FRAME_GROWS_DOWNWARD) | |
227 | { | |
228 | new_frame_offset -= size + frame_phase; | |
229 | new_frame_offset &= -align; | |
230 | new_frame_offset += frame_phase; | |
231 | offset = new_frame_offset; | |
232 | } | |
233 | else | |
234 | { | |
235 | new_frame_offset -= frame_phase; | |
236 | new_frame_offset += align - 1; | |
237 | new_frame_offset &= -align; | |
238 | new_frame_offset += frame_phase; | |
239 | offset = new_frame_offset; | |
240 | new_frame_offset += size; | |
241 | } | |
242 | frame_offset = new_frame_offset; | |
243 | ||
9fb798d7 EB |
244 | if (frame_offset_overflow (frame_offset, cfun->decl)) |
245 | frame_offset = offset = 0; | |
246 | ||
1f6d3a08 RH |
247 | return offset; |
248 | } | |
249 | ||
250 | /* Accumulate DECL into STACK_VARS. */ | |
251 | ||
252 | static void | |
253 | add_stack_var (tree decl) | |
254 | { | |
533f611a RH |
255 | struct stack_var *v; |
256 | ||
1f6d3a08 RH |
257 | if (stack_vars_num >= stack_vars_alloc) |
258 | { | |
259 | if (stack_vars_alloc) | |
260 | stack_vars_alloc = stack_vars_alloc * 3 / 2; | |
261 | else | |
262 | stack_vars_alloc = 32; | |
263 | stack_vars | |
264 | = XRESIZEVEC (struct stack_var, stack_vars, stack_vars_alloc); | |
265 | } | |
47598145 MM |
266 | if (!decl_to_stack_part) |
267 | decl_to_stack_part = pointer_map_create (); | |
268 | ||
533f611a | 269 | v = &stack_vars[stack_vars_num]; |
47598145 | 270 | * (size_t *)pointer_map_insert (decl_to_stack_part, decl) = stack_vars_num; |
533f611a RH |
271 | |
272 | v->decl = decl; | |
533f611a RH |
273 | v->size = tree_low_cst (DECL_SIZE_UNIT (SSAVAR (decl)), 1); |
274 | /* Ensure that all variables have size, so that &a != &b for any two | |
275 | variables that are simultaneously live. */ | |
276 | if (v->size == 0) | |
277 | v->size = 1; | |
6f197850 | 278 | v->alignb = align_local_variable (SSAVAR (decl)); |
13868f40 EB |
279 | /* An alignment of zero can mightily confuse us later. */ |
280 | gcc_assert (v->alignb != 0); | |
1f6d3a08 RH |
281 | |
282 | /* All variables are initially in their own partition. */ | |
533f611a RH |
283 | v->representative = stack_vars_num; |
284 | v->next = EOC; | |
1f6d3a08 | 285 | |
2bdbbe94 | 286 | /* All variables initially conflict with no other. */ |
533f611a | 287 | v->conflicts = NULL; |
2bdbbe94 | 288 | |
1f6d3a08 | 289 | /* Ensure that this decl doesn't get put onto the list twice. */ |
4e3825db | 290 | set_rtl (decl, pc_rtx); |
1f6d3a08 RH |
291 | |
292 | stack_vars_num++; | |
293 | } | |
294 | ||
1f6d3a08 RH |
295 | /* Make the decls associated with luid's X and Y conflict. */ |
296 | ||
297 | static void | |
298 | add_stack_var_conflict (size_t x, size_t y) | |
299 | { | |
2bdbbe94 MM |
300 | struct stack_var *a = &stack_vars[x]; |
301 | struct stack_var *b = &stack_vars[y]; | |
302 | if (!a->conflicts) | |
3f9b14ff | 303 | a->conflicts = BITMAP_ALLOC (&stack_var_bitmap_obstack); |
2bdbbe94 | 304 | if (!b->conflicts) |
3f9b14ff | 305 | b->conflicts = BITMAP_ALLOC (&stack_var_bitmap_obstack); |
2bdbbe94 MM |
306 | bitmap_set_bit (a->conflicts, y); |
307 | bitmap_set_bit (b->conflicts, x); | |
1f6d3a08 RH |
308 | } |
309 | ||
310 | /* Check whether the decls associated with luid's X and Y conflict. */ | |
311 | ||
312 | static bool | |
313 | stack_var_conflict_p (size_t x, size_t y) | |
314 | { | |
2bdbbe94 MM |
315 | struct stack_var *a = &stack_vars[x]; |
316 | struct stack_var *b = &stack_vars[y]; | |
47598145 MM |
317 | if (x == y) |
318 | return false; | |
319 | /* Partitions containing an SSA name result from gimple registers | |
320 | with things like unsupported modes. They are top-level and | |
321 | hence conflict with everything else. */ | |
322 | if (TREE_CODE (a->decl) == SSA_NAME || TREE_CODE (b->decl) == SSA_NAME) | |
323 | return true; | |
324 | ||
2bdbbe94 MM |
325 | if (!a->conflicts || !b->conflicts) |
326 | return false; | |
327 | return bitmap_bit_p (a->conflicts, y); | |
1f6d3a08 | 328 | } |
b8698a0f | 329 | |
47598145 MM |
330 | /* Callback for walk_stmt_ops. If OP is a decl touched by add_stack_var |
331 | enter its partition number into bitmap DATA. */ | |
332 | ||
333 | static bool | |
334 | visit_op (gimple stmt ATTRIBUTE_UNUSED, tree op, void *data) | |
335 | { | |
336 | bitmap active = (bitmap)data; | |
337 | op = get_base_address (op); | |
338 | if (op | |
339 | && DECL_P (op) | |
340 | && DECL_RTL_IF_SET (op) == pc_rtx) | |
341 | { | |
342 | size_t *v = (size_t *) pointer_map_contains (decl_to_stack_part, op); | |
343 | if (v) | |
344 | bitmap_set_bit (active, *v); | |
345 | } | |
346 | return false; | |
347 | } | |
348 | ||
349 | /* Callback for walk_stmt_ops. If OP is a decl touched by add_stack_var | |
350 | record conflicts between it and all currently active other partitions | |
351 | from bitmap DATA. */ | |
352 | ||
353 | static bool | |
354 | visit_conflict (gimple stmt ATTRIBUTE_UNUSED, tree op, void *data) | |
355 | { | |
356 | bitmap active = (bitmap)data; | |
357 | op = get_base_address (op); | |
358 | if (op | |
359 | && DECL_P (op) | |
360 | && DECL_RTL_IF_SET (op) == pc_rtx) | |
361 | { | |
362 | size_t *v = | |
363 | (size_t *) pointer_map_contains (decl_to_stack_part, op); | |
364 | if (v && bitmap_set_bit (active, *v)) | |
365 | { | |
366 | size_t num = *v; | |
367 | bitmap_iterator bi; | |
368 | unsigned i; | |
369 | gcc_assert (num < stack_vars_num); | |
370 | EXECUTE_IF_SET_IN_BITMAP (active, 0, i, bi) | |
371 | add_stack_var_conflict (num, i); | |
372 | } | |
373 | } | |
374 | return false; | |
375 | } | |
376 | ||
377 | /* Helper routine for add_scope_conflicts, calculating the active partitions | |
378 | at the end of BB, leaving the result in WORK. We're called to generate | |
81bfd197 MM |
379 | conflicts when FOR_CONFLICT is true, otherwise we're just tracking |
380 | liveness. */ | |
47598145 MM |
381 | |
382 | static void | |
81bfd197 | 383 | add_scope_conflicts_1 (basic_block bb, bitmap work, bool for_conflict) |
47598145 MM |
384 | { |
385 | edge e; | |
386 | edge_iterator ei; | |
387 | gimple_stmt_iterator gsi; | |
388 | bool (*visit)(gimple, tree, void *); | |
389 | ||
390 | bitmap_clear (work); | |
391 | FOR_EACH_EDGE (e, ei, bb->preds) | |
392 | bitmap_ior_into (work, (bitmap)e->src->aux); | |
393 | ||
ea85edfe | 394 | visit = visit_op; |
47598145 MM |
395 | |
396 | for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
397 | { | |
398 | gimple stmt = gsi_stmt (gsi); | |
ea85edfe | 399 | walk_stmt_load_store_addr_ops (stmt, work, NULL, NULL, visit); |
47598145 | 400 | } |
ea85edfe | 401 | for (gsi = gsi_after_labels (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
47598145 MM |
402 | { |
403 | gimple stmt = gsi_stmt (gsi); | |
404 | ||
405 | if (gimple_clobber_p (stmt)) | |
406 | { | |
407 | tree lhs = gimple_assign_lhs (stmt); | |
408 | size_t *v; | |
409 | /* Nested function lowering might introduce LHSs | |
410 | that are COMPONENT_REFs. */ | |
411 | if (TREE_CODE (lhs) != VAR_DECL) | |
412 | continue; | |
413 | if (DECL_RTL_IF_SET (lhs) == pc_rtx | |
414 | && (v = (size_t *) | |
415 | pointer_map_contains (decl_to_stack_part, lhs))) | |
416 | bitmap_clear_bit (work, *v); | |
417 | } | |
418 | else if (!is_gimple_debug (stmt)) | |
ea85edfe | 419 | { |
81bfd197 | 420 | if (for_conflict |
ea85edfe JJ |
421 | && visit == visit_op) |
422 | { | |
423 | /* If this is the first real instruction in this BB we need | |
88d599dc MM |
424 | to add conflicts for everything live at this point now. |
425 | Unlike classical liveness for named objects we can't | |
ea85edfe JJ |
426 | rely on seeing a def/use of the names we're interested in. |
427 | There might merely be indirect loads/stores. We'd not add any | |
81bfd197 | 428 | conflicts for such partitions. */ |
ea85edfe JJ |
429 | bitmap_iterator bi; |
430 | unsigned i; | |
81bfd197 | 431 | EXECUTE_IF_SET_IN_BITMAP (work, 0, i, bi) |
ea85edfe | 432 | { |
9b44f5d9 MM |
433 | struct stack_var *a = &stack_vars[i]; |
434 | if (!a->conflicts) | |
3f9b14ff | 435 | a->conflicts = BITMAP_ALLOC (&stack_var_bitmap_obstack); |
9b44f5d9 | 436 | bitmap_ior_into (a->conflicts, work); |
ea85edfe JJ |
437 | } |
438 | visit = visit_conflict; | |
439 | } | |
440 | walk_stmt_load_store_addr_ops (stmt, work, visit, visit, visit); | |
441 | } | |
47598145 MM |
442 | } |
443 | } | |
444 | ||
445 | /* Generate stack partition conflicts between all partitions that are | |
446 | simultaneously live. */ | |
447 | ||
448 | static void | |
449 | add_scope_conflicts (void) | |
450 | { | |
451 | basic_block bb; | |
452 | bool changed; | |
453 | bitmap work = BITMAP_ALLOC (NULL); | |
9b44f5d9 MM |
454 | int *rpo; |
455 | int n_bbs; | |
47598145 | 456 | |
88d599dc | 457 | /* We approximate the live range of a stack variable by taking the first |
47598145 MM |
458 | mention of its name as starting point(s), and by the end-of-scope |
459 | death clobber added by gimplify as ending point(s) of the range. | |
460 | This overapproximates in the case we for instance moved an address-taken | |
461 | operation upward, without also moving a dereference to it upwards. | |
462 | But it's conservatively correct as a variable never can hold values | |
463 | before its name is mentioned at least once. | |
464 | ||
88d599dc | 465 | We then do a mostly classical bitmap liveness algorithm. */ |
47598145 MM |
466 | |
467 | FOR_ALL_BB (bb) | |
3f9b14ff | 468 | bb->aux = BITMAP_ALLOC (&stack_var_bitmap_obstack); |
47598145 | 469 | |
9b44f5d9 MM |
470 | rpo = XNEWVEC (int, last_basic_block); |
471 | n_bbs = pre_and_rev_post_order_compute (NULL, rpo, false); | |
472 | ||
47598145 MM |
473 | changed = true; |
474 | while (changed) | |
475 | { | |
9b44f5d9 | 476 | int i; |
47598145 | 477 | changed = false; |
9b44f5d9 | 478 | for (i = 0; i < n_bbs; i++) |
47598145 | 479 | { |
9b44f5d9 MM |
480 | bitmap active; |
481 | bb = BASIC_BLOCK (rpo[i]); | |
482 | active = (bitmap)bb->aux; | |
81bfd197 | 483 | add_scope_conflicts_1 (bb, work, false); |
47598145 MM |
484 | if (bitmap_ior_into (active, work)) |
485 | changed = true; | |
486 | } | |
487 | } | |
488 | ||
489 | FOR_EACH_BB (bb) | |
81bfd197 | 490 | add_scope_conflicts_1 (bb, work, true); |
47598145 | 491 | |
9b44f5d9 | 492 | free (rpo); |
47598145 MM |
493 | BITMAP_FREE (work); |
494 | FOR_ALL_BB (bb) | |
495 | BITMAP_FREE (bb->aux); | |
496 | } | |
497 | ||
1f6d3a08 | 498 | /* A subroutine of partition_stack_vars. A comparison function for qsort, |
3a42502d | 499 | sorting an array of indices by the properties of the object. */ |
1f6d3a08 RH |
500 | |
501 | static int | |
3a42502d | 502 | stack_var_cmp (const void *a, const void *b) |
1f6d3a08 | 503 | { |
3a42502d RH |
504 | size_t ia = *(const size_t *)a; |
505 | size_t ib = *(const size_t *)b; | |
506 | unsigned int aligna = stack_vars[ia].alignb; | |
507 | unsigned int alignb = stack_vars[ib].alignb; | |
508 | HOST_WIDE_INT sizea = stack_vars[ia].size; | |
509 | HOST_WIDE_INT sizeb = stack_vars[ib].size; | |
510 | tree decla = stack_vars[ia].decl; | |
511 | tree declb = stack_vars[ib].decl; | |
512 | bool largea, largeb; | |
4e3825db | 513 | unsigned int uida, uidb; |
1f6d3a08 | 514 | |
3a42502d RH |
515 | /* Primary compare on "large" alignment. Large comes first. */ |
516 | largea = (aligna * BITS_PER_UNIT > MAX_SUPPORTED_STACK_ALIGNMENT); | |
517 | largeb = (alignb * BITS_PER_UNIT > MAX_SUPPORTED_STACK_ALIGNMENT); | |
518 | if (largea != largeb) | |
519 | return (int)largeb - (int)largea; | |
520 | ||
521 | /* Secondary compare on size, decreasing */ | |
3a42502d | 522 | if (sizea > sizeb) |
6ddfda8a ER |
523 | return -1; |
524 | if (sizea < sizeb) | |
1f6d3a08 | 525 | return 1; |
3a42502d RH |
526 | |
527 | /* Tertiary compare on true alignment, decreasing. */ | |
528 | if (aligna < alignb) | |
529 | return -1; | |
530 | if (aligna > alignb) | |
531 | return 1; | |
532 | ||
533 | /* Final compare on ID for sort stability, increasing. | |
534 | Two SSA names are compared by their version, SSA names come before | |
535 | non-SSA names, and two normal decls are compared by their DECL_UID. */ | |
4e3825db MM |
536 | if (TREE_CODE (decla) == SSA_NAME) |
537 | { | |
538 | if (TREE_CODE (declb) == SSA_NAME) | |
539 | uida = SSA_NAME_VERSION (decla), uidb = SSA_NAME_VERSION (declb); | |
540 | else | |
541 | return -1; | |
542 | } | |
543 | else if (TREE_CODE (declb) == SSA_NAME) | |
544 | return 1; | |
545 | else | |
546 | uida = DECL_UID (decla), uidb = DECL_UID (declb); | |
79f802f5 | 547 | if (uida < uidb) |
79f802f5 | 548 | return 1; |
3a42502d RH |
549 | if (uida > uidb) |
550 | return -1; | |
1f6d3a08 RH |
551 | return 0; |
552 | } | |
553 | ||
55b34b5f RG |
554 | |
555 | /* If the points-to solution *PI points to variables that are in a partition | |
556 | together with other variables add all partition members to the pointed-to | |
557 | variables bitmap. */ | |
558 | ||
559 | static void | |
560 | add_partitioned_vars_to_ptset (struct pt_solution *pt, | |
561 | struct pointer_map_t *decls_to_partitions, | |
562 | struct pointer_set_t *visited, bitmap temp) | |
563 | { | |
564 | bitmap_iterator bi; | |
565 | unsigned i; | |
566 | bitmap *part; | |
567 | ||
568 | if (pt->anything | |
569 | || pt->vars == NULL | |
570 | /* The pointed-to vars bitmap is shared, it is enough to | |
571 | visit it once. */ | |
572 | || pointer_set_insert(visited, pt->vars)) | |
573 | return; | |
574 | ||
575 | bitmap_clear (temp); | |
576 | ||
577 | /* By using a temporary bitmap to store all members of the partitions | |
578 | we have to add we make sure to visit each of the partitions only | |
579 | once. */ | |
580 | EXECUTE_IF_SET_IN_BITMAP (pt->vars, 0, i, bi) | |
581 | if ((!temp | |
582 | || !bitmap_bit_p (temp, i)) | |
583 | && (part = (bitmap *) pointer_map_contains (decls_to_partitions, | |
584 | (void *)(size_t) i))) | |
585 | bitmap_ior_into (temp, *part); | |
586 | if (!bitmap_empty_p (temp)) | |
587 | bitmap_ior_into (pt->vars, temp); | |
588 | } | |
589 | ||
590 | /* Update points-to sets based on partition info, so we can use them on RTL. | |
591 | The bitmaps representing stack partitions will be saved until expand, | |
592 | where partitioned decls used as bases in memory expressions will be | |
593 | rewritten. */ | |
594 | ||
595 | static void | |
596 | update_alias_info_with_stack_vars (void) | |
597 | { | |
598 | struct pointer_map_t *decls_to_partitions = NULL; | |
599 | size_t i, j; | |
600 | tree var = NULL_TREE; | |
601 | ||
602 | for (i = 0; i < stack_vars_num; i++) | |
603 | { | |
604 | bitmap part = NULL; | |
605 | tree name; | |
606 | struct ptr_info_def *pi; | |
607 | ||
608 | /* Not interested in partitions with single variable. */ | |
609 | if (stack_vars[i].representative != i | |
610 | || stack_vars[i].next == EOC) | |
611 | continue; | |
612 | ||
613 | if (!decls_to_partitions) | |
614 | { | |
615 | decls_to_partitions = pointer_map_create (); | |
616 | cfun->gimple_df->decls_to_pointers = pointer_map_create (); | |
617 | } | |
618 | ||
619 | /* Create an SSA_NAME that points to the partition for use | |
620 | as base during alias-oracle queries on RTL for bases that | |
621 | have been partitioned. */ | |
622 | if (var == NULL_TREE) | |
623 | var = create_tmp_var (ptr_type_node, NULL); | |
624 | name = make_ssa_name (var, NULL); | |
625 | ||
626 | /* Create bitmaps representing partitions. They will be used for | |
627 | points-to sets later, so use GGC alloc. */ | |
628 | part = BITMAP_GGC_ALLOC (); | |
629 | for (j = i; j != EOC; j = stack_vars[j].next) | |
630 | { | |
631 | tree decl = stack_vars[j].decl; | |
25a6a873 | 632 | unsigned int uid = DECL_PT_UID (decl); |
55b34b5f RG |
633 | bitmap_set_bit (part, uid); |
634 | *((bitmap *) pointer_map_insert (decls_to_partitions, | |
635 | (void *)(size_t) uid)) = part; | |
636 | *((tree *) pointer_map_insert (cfun->gimple_df->decls_to_pointers, | |
637 | decl)) = name; | |
638 | } | |
639 | ||
640 | /* Make the SSA name point to all partition members. */ | |
641 | pi = get_ptr_info (name); | |
d3553615 | 642 | pt_solution_set (&pi->pt, part, false); |
55b34b5f RG |
643 | } |
644 | ||
645 | /* Make all points-to sets that contain one member of a partition | |
646 | contain all members of the partition. */ | |
647 | if (decls_to_partitions) | |
648 | { | |
649 | unsigned i; | |
650 | struct pointer_set_t *visited = pointer_set_create (); | |
3f9b14ff | 651 | bitmap temp = BITMAP_ALLOC (&stack_var_bitmap_obstack); |
55b34b5f RG |
652 | |
653 | for (i = 1; i < num_ssa_names; i++) | |
654 | { | |
655 | tree name = ssa_name (i); | |
656 | struct ptr_info_def *pi; | |
657 | ||
658 | if (name | |
659 | && POINTER_TYPE_P (TREE_TYPE (name)) | |
660 | && ((pi = SSA_NAME_PTR_INFO (name)) != NULL)) | |
661 | add_partitioned_vars_to_ptset (&pi->pt, decls_to_partitions, | |
662 | visited, temp); | |
663 | } | |
664 | ||
665 | add_partitioned_vars_to_ptset (&cfun->gimple_df->escaped, | |
666 | decls_to_partitions, visited, temp); | |
55b34b5f RG |
667 | |
668 | pointer_set_destroy (visited); | |
669 | pointer_map_destroy (decls_to_partitions); | |
670 | BITMAP_FREE (temp); | |
671 | } | |
672 | } | |
673 | ||
1f6d3a08 RH |
674 | /* A subroutine of partition_stack_vars. The UNION portion of a UNION/FIND |
675 | partitioning algorithm. Partitions A and B are known to be non-conflicting. | |
6ddfda8a | 676 | Merge them into a single partition A. */ |
1f6d3a08 RH |
677 | |
678 | static void | |
6ddfda8a | 679 | union_stack_vars (size_t a, size_t b) |
1f6d3a08 | 680 | { |
2bdbbe94 MM |
681 | struct stack_var *vb = &stack_vars[b]; |
682 | bitmap_iterator bi; | |
683 | unsigned u; | |
1f6d3a08 | 684 | |
6ddfda8a ER |
685 | gcc_assert (stack_vars[b].next == EOC); |
686 | /* Add B to A's partition. */ | |
687 | stack_vars[b].next = stack_vars[a].next; | |
688 | stack_vars[b].representative = a; | |
1f6d3a08 RH |
689 | stack_vars[a].next = b; |
690 | ||
691 | /* Update the required alignment of partition A to account for B. */ | |
692 | if (stack_vars[a].alignb < stack_vars[b].alignb) | |
693 | stack_vars[a].alignb = stack_vars[b].alignb; | |
694 | ||
695 | /* Update the interference graph and merge the conflicts. */ | |
2bdbbe94 MM |
696 | if (vb->conflicts) |
697 | { | |
698 | EXECUTE_IF_SET_IN_BITMAP (vb->conflicts, 0, u, bi) | |
699 | add_stack_var_conflict (a, stack_vars[u].representative); | |
700 | BITMAP_FREE (vb->conflicts); | |
701 | } | |
1f6d3a08 RH |
702 | } |
703 | ||
704 | /* A subroutine of expand_used_vars. Binpack the variables into | |
705 | partitions constrained by the interference graph. The overall | |
706 | algorithm used is as follows: | |
707 | ||
6ddfda8a | 708 | Sort the objects by size in descending order. |
1f6d3a08 RH |
709 | For each object A { |
710 | S = size(A) | |
711 | O = 0 | |
712 | loop { | |
713 | Look for the largest non-conflicting object B with size <= S. | |
714 | UNION (A, B) | |
1f6d3a08 RH |
715 | } |
716 | } | |
717 | */ | |
718 | ||
719 | static void | |
720 | partition_stack_vars (void) | |
721 | { | |
722 | size_t si, sj, n = stack_vars_num; | |
723 | ||
724 | stack_vars_sorted = XNEWVEC (size_t, stack_vars_num); | |
725 | for (si = 0; si < n; ++si) | |
726 | stack_vars_sorted[si] = si; | |
727 | ||
728 | if (n == 1) | |
729 | return; | |
730 | ||
3a42502d | 731 | qsort (stack_vars_sorted, n, sizeof (size_t), stack_var_cmp); |
1f6d3a08 | 732 | |
1f6d3a08 RH |
733 | for (si = 0; si < n; ++si) |
734 | { | |
735 | size_t i = stack_vars_sorted[si]; | |
3a42502d | 736 | unsigned int ialign = stack_vars[i].alignb; |
1f6d3a08 | 737 | |
6ddfda8a ER |
738 | /* Ignore objects that aren't partition representatives. If we |
739 | see a var that is not a partition representative, it must | |
740 | have been merged earlier. */ | |
741 | if (stack_vars[i].representative != i) | |
742 | continue; | |
743 | ||
744 | for (sj = si + 1; sj < n; ++sj) | |
1f6d3a08 RH |
745 | { |
746 | size_t j = stack_vars_sorted[sj]; | |
1f6d3a08 RH |
747 | unsigned int jalign = stack_vars[j].alignb; |
748 | ||
749 | /* Ignore objects that aren't partition representatives. */ | |
750 | if (stack_vars[j].representative != j) | |
751 | continue; | |
752 | ||
1f6d3a08 RH |
753 | /* Ignore conflicting objects. */ |
754 | if (stack_var_conflict_p (i, j)) | |
755 | continue; | |
756 | ||
3a42502d RH |
757 | /* Do not mix objects of "small" (supported) alignment |
758 | and "large" (unsupported) alignment. */ | |
759 | if ((ialign * BITS_PER_UNIT <= MAX_SUPPORTED_STACK_ALIGNMENT) | |
760 | != (jalign * BITS_PER_UNIT <= MAX_SUPPORTED_STACK_ALIGNMENT)) | |
761 | continue; | |
762 | ||
1f6d3a08 | 763 | /* UNION the objects, placing J at OFFSET. */ |
6ddfda8a | 764 | union_stack_vars (i, j); |
1f6d3a08 RH |
765 | } |
766 | } | |
55b34b5f | 767 | |
9b999dc5 | 768 | update_alias_info_with_stack_vars (); |
1f6d3a08 RH |
769 | } |
770 | ||
771 | /* A debugging aid for expand_used_vars. Dump the generated partitions. */ | |
772 | ||
773 | static void | |
774 | dump_stack_var_partition (void) | |
775 | { | |
776 | size_t si, i, j, n = stack_vars_num; | |
777 | ||
778 | for (si = 0; si < n; ++si) | |
779 | { | |
780 | i = stack_vars_sorted[si]; | |
781 | ||
782 | /* Skip variables that aren't partition representatives, for now. */ | |
783 | if (stack_vars[i].representative != i) | |
784 | continue; | |
785 | ||
786 | fprintf (dump_file, "Partition %lu: size " HOST_WIDE_INT_PRINT_DEC | |
787 | " align %u\n", (unsigned long) i, stack_vars[i].size, | |
788 | stack_vars[i].alignb); | |
789 | ||
790 | for (j = i; j != EOC; j = stack_vars[j].next) | |
791 | { | |
792 | fputc ('\t', dump_file); | |
793 | print_generic_expr (dump_file, stack_vars[j].decl, dump_flags); | |
1f6d3a08 | 794 | } |
6ddfda8a | 795 | fputc ('\n', dump_file); |
1f6d3a08 RH |
796 | } |
797 | } | |
798 | ||
3a42502d | 799 | /* Assign rtl to DECL at BASE + OFFSET. */ |
1f6d3a08 RH |
800 | |
801 | static void | |
3a42502d RH |
802 | expand_one_stack_var_at (tree decl, rtx base, unsigned base_align, |
803 | HOST_WIDE_INT offset) | |
1f6d3a08 | 804 | { |
3a42502d | 805 | unsigned align; |
1f6d3a08 | 806 | rtx x; |
c22cacf3 | 807 | |
1f6d3a08 RH |
808 | /* If this fails, we've overflowed the stack frame. Error nicely? */ |
809 | gcc_assert (offset == trunc_int_for_mode (offset, Pmode)); | |
810 | ||
0a81f074 | 811 | x = plus_constant (Pmode, base, offset); |
4e3825db | 812 | x = gen_rtx_MEM (DECL_MODE (SSAVAR (decl)), x); |
1f6d3a08 | 813 | |
4e3825db MM |
814 | if (TREE_CODE (decl) != SSA_NAME) |
815 | { | |
816 | /* Set alignment we actually gave this decl if it isn't an SSA name. | |
817 | If it is we generate stack slots only accidentally so it isn't as | |
818 | important, we'll simply use the alignment that is already set. */ | |
3a42502d RH |
819 | if (base == virtual_stack_vars_rtx) |
820 | offset -= frame_phase; | |
4e3825db MM |
821 | align = offset & -offset; |
822 | align *= BITS_PER_UNIT; | |
3a42502d RH |
823 | if (align == 0 || align > base_align) |
824 | align = base_align; | |
825 | ||
826 | /* One would think that we could assert that we're not decreasing | |
827 | alignment here, but (at least) the i386 port does exactly this | |
828 | via the MINIMUM_ALIGNMENT hook. */ | |
4e3825db MM |
829 | |
830 | DECL_ALIGN (decl) = align; | |
831 | DECL_USER_ALIGN (decl) = 0; | |
832 | } | |
833 | ||
834 | set_mem_attributes (x, SSAVAR (decl), true); | |
835 | set_rtl (decl, x); | |
1f6d3a08 RH |
836 | } |
837 | ||
838 | /* A subroutine of expand_used_vars. Give each partition representative | |
839 | a unique location within the stack frame. Update each partition member | |
840 | with that location. */ | |
841 | ||
842 | static void | |
7d69de61 | 843 | expand_stack_vars (bool (*pred) (tree)) |
1f6d3a08 RH |
844 | { |
845 | size_t si, i, j, n = stack_vars_num; | |
3a42502d RH |
846 | HOST_WIDE_INT large_size = 0, large_alloc = 0; |
847 | rtx large_base = NULL; | |
848 | unsigned large_align = 0; | |
849 | tree decl; | |
850 | ||
851 | /* Determine if there are any variables requiring "large" alignment. | |
852 | Since these are dynamically allocated, we only process these if | |
853 | no predicate involved. */ | |
854 | large_align = stack_vars[stack_vars_sorted[0]].alignb * BITS_PER_UNIT; | |
855 | if (pred == NULL && large_align > MAX_SUPPORTED_STACK_ALIGNMENT) | |
856 | { | |
857 | /* Find the total size of these variables. */ | |
858 | for (si = 0; si < n; ++si) | |
859 | { | |
860 | unsigned alignb; | |
861 | ||
862 | i = stack_vars_sorted[si]; | |
863 | alignb = stack_vars[i].alignb; | |
864 | ||
865 | /* Stop when we get to the first decl with "small" alignment. */ | |
866 | if (alignb * BITS_PER_UNIT <= MAX_SUPPORTED_STACK_ALIGNMENT) | |
867 | break; | |
868 | ||
869 | /* Skip variables that aren't partition representatives. */ | |
870 | if (stack_vars[i].representative != i) | |
871 | continue; | |
872 | ||
873 | /* Skip variables that have already had rtl assigned. See also | |
874 | add_stack_var where we perpetrate this pc_rtx hack. */ | |
875 | decl = stack_vars[i].decl; | |
876 | if ((TREE_CODE (decl) == SSA_NAME | |
877 | ? SA.partition_to_pseudo[var_to_partition (SA.map, decl)] | |
878 | : DECL_RTL (decl)) != pc_rtx) | |
879 | continue; | |
880 | ||
881 | large_size += alignb - 1; | |
882 | large_size &= -(HOST_WIDE_INT)alignb; | |
883 | large_size += stack_vars[i].size; | |
884 | } | |
885 | ||
886 | /* If there were any, allocate space. */ | |
887 | if (large_size > 0) | |
888 | large_base = allocate_dynamic_stack_space (GEN_INT (large_size), 0, | |
889 | large_align, true); | |
890 | } | |
1f6d3a08 RH |
891 | |
892 | for (si = 0; si < n; ++si) | |
893 | { | |
3a42502d RH |
894 | rtx base; |
895 | unsigned base_align, alignb; | |
1f6d3a08 RH |
896 | HOST_WIDE_INT offset; |
897 | ||
898 | i = stack_vars_sorted[si]; | |
899 | ||
900 | /* Skip variables that aren't partition representatives, for now. */ | |
901 | if (stack_vars[i].representative != i) | |
902 | continue; | |
903 | ||
7d69de61 RH |
904 | /* Skip variables that have already had rtl assigned. See also |
905 | add_stack_var where we perpetrate this pc_rtx hack. */ | |
3a42502d RH |
906 | decl = stack_vars[i].decl; |
907 | if ((TREE_CODE (decl) == SSA_NAME | |
908 | ? SA.partition_to_pseudo[var_to_partition (SA.map, decl)] | |
909 | : DECL_RTL (decl)) != pc_rtx) | |
7d69de61 RH |
910 | continue; |
911 | ||
c22cacf3 | 912 | /* Check the predicate to see whether this variable should be |
7d69de61 | 913 | allocated in this pass. */ |
3a42502d | 914 | if (pred && !pred (decl)) |
7d69de61 RH |
915 | continue; |
916 | ||
3a42502d RH |
917 | alignb = stack_vars[i].alignb; |
918 | if (alignb * BITS_PER_UNIT <= MAX_SUPPORTED_STACK_ALIGNMENT) | |
919 | { | |
920 | offset = alloc_stack_frame_space (stack_vars[i].size, alignb); | |
921 | base = virtual_stack_vars_rtx; | |
922 | base_align = crtl->max_used_stack_slot_alignment; | |
923 | } | |
924 | else | |
925 | { | |
926 | /* Large alignment is only processed in the last pass. */ | |
927 | if (pred) | |
928 | continue; | |
533f611a | 929 | gcc_assert (large_base != NULL); |
3a42502d RH |
930 | |
931 | large_alloc += alignb - 1; | |
932 | large_alloc &= -(HOST_WIDE_INT)alignb; | |
933 | offset = large_alloc; | |
934 | large_alloc += stack_vars[i].size; | |
935 | ||
936 | base = large_base; | |
937 | base_align = large_align; | |
938 | } | |
1f6d3a08 RH |
939 | |
940 | /* Create rtl for each variable based on their location within the | |
941 | partition. */ | |
942 | for (j = i; j != EOC; j = stack_vars[j].next) | |
f8da8190 | 943 | { |
f8da8190 | 944 | expand_one_stack_var_at (stack_vars[j].decl, |
3a42502d | 945 | base, base_align, |
6ddfda8a | 946 | offset); |
f8da8190 | 947 | } |
1f6d3a08 | 948 | } |
3a42502d RH |
949 | |
950 | gcc_assert (large_alloc == large_size); | |
1f6d3a08 RH |
951 | } |
952 | ||
ff28a94d JH |
953 | /* Take into account all sizes of partitions and reset DECL_RTLs. */ |
954 | static HOST_WIDE_INT | |
955 | account_stack_vars (void) | |
956 | { | |
957 | size_t si, j, i, n = stack_vars_num; | |
958 | HOST_WIDE_INT size = 0; | |
959 | ||
960 | for (si = 0; si < n; ++si) | |
961 | { | |
962 | i = stack_vars_sorted[si]; | |
963 | ||
964 | /* Skip variables that aren't partition representatives, for now. */ | |
965 | if (stack_vars[i].representative != i) | |
966 | continue; | |
967 | ||
968 | size += stack_vars[i].size; | |
969 | for (j = i; j != EOC; j = stack_vars[j].next) | |
4e3825db | 970 | set_rtl (stack_vars[j].decl, NULL); |
ff28a94d JH |
971 | } |
972 | return size; | |
973 | } | |
974 | ||
1f6d3a08 RH |
975 | /* A subroutine of expand_one_var. Called to immediately assign rtl |
976 | to a variable to be allocated in the stack frame. */ | |
977 | ||
978 | static void | |
979 | expand_one_stack_var (tree var) | |
980 | { | |
3a42502d RH |
981 | HOST_WIDE_INT size, offset; |
982 | unsigned byte_align; | |
1f6d3a08 | 983 | |
4e3825db | 984 | size = tree_low_cst (DECL_SIZE_UNIT (SSAVAR (var)), 1); |
6f197850 | 985 | byte_align = align_local_variable (SSAVAR (var)); |
3a42502d RH |
986 | |
987 | /* We handle highly aligned variables in expand_stack_vars. */ | |
988 | gcc_assert (byte_align * BITS_PER_UNIT <= MAX_SUPPORTED_STACK_ALIGNMENT); | |
1f6d3a08 | 989 | |
3a42502d RH |
990 | offset = alloc_stack_frame_space (size, byte_align); |
991 | ||
992 | expand_one_stack_var_at (var, virtual_stack_vars_rtx, | |
993 | crtl->max_used_stack_slot_alignment, offset); | |
1f6d3a08 RH |
994 | } |
995 | ||
1f6d3a08 RH |
996 | /* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL |
997 | that will reside in a hard register. */ | |
998 | ||
999 | static void | |
1000 | expand_one_hard_reg_var (tree var) | |
1001 | { | |
1002 | rest_of_decl_compilation (var, 0, 0); | |
1003 | } | |
1004 | ||
1005 | /* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL | |
1006 | that will reside in a pseudo register. */ | |
1007 | ||
1008 | static void | |
1009 | expand_one_register_var (tree var) | |
1010 | { | |
4e3825db MM |
1011 | tree decl = SSAVAR (var); |
1012 | tree type = TREE_TYPE (decl); | |
cde0f3fd | 1013 | enum machine_mode reg_mode = promote_decl_mode (decl, NULL); |
1f6d3a08 RH |
1014 | rtx x = gen_reg_rtx (reg_mode); |
1015 | ||
4e3825db | 1016 | set_rtl (var, x); |
1f6d3a08 RH |
1017 | |
1018 | /* Note if the object is a user variable. */ | |
4e3825db MM |
1019 | if (!DECL_ARTIFICIAL (decl)) |
1020 | mark_user_reg (x); | |
1f6d3a08 | 1021 | |
61021c2c | 1022 | if (POINTER_TYPE_P (type)) |
d466b407 | 1023 | mark_reg_pointer (x, get_pointer_alignment (var)); |
1f6d3a08 RH |
1024 | } |
1025 | ||
1026 | /* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL that | |
128a79fb | 1027 | has some associated error, e.g. its type is error-mark. We just need |
1f6d3a08 RH |
1028 | to pick something that won't crash the rest of the compiler. */ |
1029 | ||
1030 | static void | |
1031 | expand_one_error_var (tree var) | |
1032 | { | |
1033 | enum machine_mode mode = DECL_MODE (var); | |
1034 | rtx x; | |
1035 | ||
1036 | if (mode == BLKmode) | |
1037 | x = gen_rtx_MEM (BLKmode, const0_rtx); | |
1038 | else if (mode == VOIDmode) | |
1039 | x = const0_rtx; | |
1040 | else | |
1041 | x = gen_reg_rtx (mode); | |
1042 | ||
1043 | SET_DECL_RTL (var, x); | |
1044 | } | |
1045 | ||
c22cacf3 | 1046 | /* A subroutine of expand_one_var. VAR is a variable that will be |
1f6d3a08 RH |
1047 | allocated to the local stack frame. Return true if we wish to |
1048 | add VAR to STACK_VARS so that it will be coalesced with other | |
1049 | variables. Return false to allocate VAR immediately. | |
1050 | ||
1051 | This function is used to reduce the number of variables considered | |
1052 | for coalescing, which reduces the size of the quadratic problem. */ | |
1053 | ||
1054 | static bool | |
1055 | defer_stack_allocation (tree var, bool toplevel) | |
1056 | { | |
7d69de61 RH |
1057 | /* If stack protection is enabled, *all* stack variables must be deferred, |
1058 | so that we can re-order the strings to the top of the frame. */ | |
1059 | if (flag_stack_protect) | |
1060 | return true; | |
1061 | ||
3a42502d RH |
1062 | /* We handle "large" alignment via dynamic allocation. We want to handle |
1063 | this extra complication in only one place, so defer them. */ | |
1064 | if (DECL_ALIGN (var) > MAX_SUPPORTED_STACK_ALIGNMENT) | |
1065 | return true; | |
1066 | ||
1f6d3a08 RH |
1067 | /* Variables in the outermost scope automatically conflict with |
1068 | every other variable. The only reason to want to defer them | |
1069 | at all is that, after sorting, we can more efficiently pack | |
1070 | small variables in the stack frame. Continue to defer at -O2. */ | |
1071 | if (toplevel && optimize < 2) | |
1072 | return false; | |
1073 | ||
1074 | /* Without optimization, *most* variables are allocated from the | |
1075 | stack, which makes the quadratic problem large exactly when we | |
c22cacf3 | 1076 | want compilation to proceed as quickly as possible. On the |
1f6d3a08 RH |
1077 | other hand, we don't want the function's stack frame size to |
1078 | get completely out of hand. So we avoid adding scalars and | |
1079 | "small" aggregates to the list at all. */ | |
1080 | if (optimize == 0 && tree_low_cst (DECL_SIZE_UNIT (var), 1) < 32) | |
1081 | return false; | |
1082 | ||
1083 | return true; | |
1084 | } | |
1085 | ||
1086 | /* A subroutine of expand_used_vars. Expand one variable according to | |
2a7e31df | 1087 | its flavor. Variables to be placed on the stack are not actually |
b8698a0f | 1088 | expanded yet, merely recorded. |
ff28a94d JH |
1089 | When REALLY_EXPAND is false, only add stack values to be allocated. |
1090 | Return stack usage this variable is supposed to take. | |
1091 | */ | |
1f6d3a08 | 1092 | |
ff28a94d JH |
1093 | static HOST_WIDE_INT |
1094 | expand_one_var (tree var, bool toplevel, bool really_expand) | |
1f6d3a08 | 1095 | { |
3a42502d | 1096 | unsigned int align = BITS_PER_UNIT; |
4e3825db | 1097 | tree origvar = var; |
3a42502d | 1098 | |
4e3825db MM |
1099 | var = SSAVAR (var); |
1100 | ||
3a42502d | 1101 | if (TREE_TYPE (var) != error_mark_node && TREE_CODE (var) == VAR_DECL) |
2e3f842f | 1102 | { |
2e3f842f L |
1103 | /* Because we don't know if VAR will be in register or on stack, |
1104 | we conservatively assume it will be on stack even if VAR is | |
1105 | eventually put into register after RA pass. For non-automatic | |
1106 | variables, which won't be on stack, we collect alignment of | |
1107 | type and ignore user specified alignment. */ | |
1108 | if (TREE_STATIC (var) || DECL_EXTERNAL (var)) | |
ae58e548 JJ |
1109 | align = MINIMUM_ALIGNMENT (TREE_TYPE (var), |
1110 | TYPE_MODE (TREE_TYPE (var)), | |
1111 | TYPE_ALIGN (TREE_TYPE (var))); | |
f3184b4c JJ |
1112 | else if (DECL_HAS_VALUE_EXPR_P (var) |
1113 | || (DECL_RTL_SET_P (var) && MEM_P (DECL_RTL (var)))) | |
1114 | /* Don't consider debug only variables with DECL_HAS_VALUE_EXPR_P set | |
1115 | or variables which were assigned a stack slot already by | |
1116 | expand_one_stack_var_at - in the latter case DECL_ALIGN has been | |
1117 | changed from the offset chosen to it. */ | |
1118 | align = crtl->stack_alignment_estimated; | |
2e3f842f | 1119 | else |
ae58e548 | 1120 | align = MINIMUM_ALIGNMENT (var, DECL_MODE (var), DECL_ALIGN (var)); |
2e3f842f | 1121 | |
3a42502d RH |
1122 | /* If the variable alignment is very large we'll dynamicaly allocate |
1123 | it, which means that in-frame portion is just a pointer. */ | |
1124 | if (align > MAX_SUPPORTED_STACK_ALIGNMENT) | |
1125 | align = POINTER_SIZE; | |
1126 | } | |
1127 | ||
1128 | if (SUPPORTS_STACK_ALIGNMENT | |
1129 | && crtl->stack_alignment_estimated < align) | |
1130 | { | |
1131 | /* stack_alignment_estimated shouldn't change after stack | |
1132 | realign decision made */ | |
1133 | gcc_assert(!crtl->stack_realign_processed); | |
1134 | crtl->stack_alignment_estimated = align; | |
2e3f842f L |
1135 | } |
1136 | ||
3a42502d RH |
1137 | /* stack_alignment_needed > PREFERRED_STACK_BOUNDARY is permitted. |
1138 | So here we only make sure stack_alignment_needed >= align. */ | |
1139 | if (crtl->stack_alignment_needed < align) | |
1140 | crtl->stack_alignment_needed = align; | |
1141 | if (crtl->max_used_stack_slot_alignment < align) | |
1142 | crtl->max_used_stack_slot_alignment = align; | |
1143 | ||
4e3825db MM |
1144 | if (TREE_CODE (origvar) == SSA_NAME) |
1145 | { | |
1146 | gcc_assert (TREE_CODE (var) != VAR_DECL | |
1147 | || (!DECL_EXTERNAL (var) | |
1148 | && !DECL_HAS_VALUE_EXPR_P (var) | |
1149 | && !TREE_STATIC (var) | |
4e3825db MM |
1150 | && TREE_TYPE (var) != error_mark_node |
1151 | && !DECL_HARD_REGISTER (var) | |
1152 | && really_expand)); | |
1153 | } | |
1154 | if (TREE_CODE (var) != VAR_DECL && TREE_CODE (origvar) != SSA_NAME) | |
4846b435 | 1155 | ; |
1f6d3a08 RH |
1156 | else if (DECL_EXTERNAL (var)) |
1157 | ; | |
833b3afe | 1158 | else if (DECL_HAS_VALUE_EXPR_P (var)) |
1f6d3a08 RH |
1159 | ; |
1160 | else if (TREE_STATIC (var)) | |
7e8b322a | 1161 | ; |
eb7adebc | 1162 | else if (TREE_CODE (origvar) != SSA_NAME && DECL_RTL_SET_P (var)) |
1f6d3a08 RH |
1163 | ; |
1164 | else if (TREE_TYPE (var) == error_mark_node) | |
ff28a94d JH |
1165 | { |
1166 | if (really_expand) | |
1167 | expand_one_error_var (var); | |
1168 | } | |
4e3825db | 1169 | else if (TREE_CODE (var) == VAR_DECL && DECL_HARD_REGISTER (var)) |
ff28a94d JH |
1170 | { |
1171 | if (really_expand) | |
1172 | expand_one_hard_reg_var (var); | |
1173 | } | |
1f6d3a08 | 1174 | else if (use_register_for_decl (var)) |
ff28a94d JH |
1175 | { |
1176 | if (really_expand) | |
4e3825db | 1177 | expand_one_register_var (origvar); |
ff28a94d | 1178 | } |
56099f00 | 1179 | else if (! valid_constant_size_p (DECL_SIZE_UNIT (var))) |
7604eb4e | 1180 | { |
56099f00 | 1181 | /* Reject variables which cover more than half of the address-space. */ |
7604eb4e JJ |
1182 | if (really_expand) |
1183 | { | |
1184 | error ("size of variable %q+D is too large", var); | |
1185 | expand_one_error_var (var); | |
1186 | } | |
1187 | } | |
1f6d3a08 | 1188 | else if (defer_stack_allocation (var, toplevel)) |
4e3825db | 1189 | add_stack_var (origvar); |
1f6d3a08 | 1190 | else |
ff28a94d | 1191 | { |
bd9f1b4b | 1192 | if (really_expand) |
4e3825db | 1193 | expand_one_stack_var (origvar); |
ff28a94d JH |
1194 | return tree_low_cst (DECL_SIZE_UNIT (var), 1); |
1195 | } | |
1196 | return 0; | |
1f6d3a08 RH |
1197 | } |
1198 | ||
1199 | /* A subroutine of expand_used_vars. Walk down through the BLOCK tree | |
1200 | expanding variables. Those variables that can be put into registers | |
1201 | are allocated pseudos; those that can't are put on the stack. | |
1202 | ||
1203 | TOPLEVEL is true if this is the outermost BLOCK. */ | |
1204 | ||
1205 | static void | |
1206 | expand_used_vars_for_block (tree block, bool toplevel) | |
1207 | { | |
1f6d3a08 RH |
1208 | tree t; |
1209 | ||
1f6d3a08 | 1210 | /* Expand all variables at this level. */ |
910ad8de | 1211 | for (t = BLOCK_VARS (block); t ; t = DECL_CHAIN (t)) |
1ace6185 JJ |
1212 | if (TREE_USED (t) |
1213 | && ((TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != RESULT_DECL) | |
1214 | || !DECL_NONSHAREABLE (t))) | |
ff28a94d | 1215 | expand_one_var (t, toplevel, true); |
1f6d3a08 | 1216 | |
1f6d3a08 RH |
1217 | /* Expand all variables at containing levels. */ |
1218 | for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t)) | |
1219 | expand_used_vars_for_block (t, false); | |
1f6d3a08 RH |
1220 | } |
1221 | ||
1222 | /* A subroutine of expand_used_vars. Walk down through the BLOCK tree | |
1223 | and clear TREE_USED on all local variables. */ | |
1224 | ||
1225 | static void | |
1226 | clear_tree_used (tree block) | |
1227 | { | |
1228 | tree t; | |
1229 | ||
910ad8de | 1230 | for (t = BLOCK_VARS (block); t ; t = DECL_CHAIN (t)) |
1f6d3a08 | 1231 | /* if (!TREE_STATIC (t) && !DECL_EXTERNAL (t)) */ |
1ace6185 JJ |
1232 | if ((TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != RESULT_DECL) |
1233 | || !DECL_NONSHAREABLE (t)) | |
1f6d3a08 RH |
1234 | TREE_USED (t) = 0; |
1235 | ||
1236 | for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t)) | |
1237 | clear_tree_used (t); | |
1238 | } | |
1239 | ||
7d69de61 RH |
1240 | /* Examine TYPE and determine a bit mask of the following features. */ |
1241 | ||
1242 | #define SPCT_HAS_LARGE_CHAR_ARRAY 1 | |
1243 | #define SPCT_HAS_SMALL_CHAR_ARRAY 2 | |
1244 | #define SPCT_HAS_ARRAY 4 | |
1245 | #define SPCT_HAS_AGGREGATE 8 | |
1246 | ||
1247 | static unsigned int | |
1248 | stack_protect_classify_type (tree type) | |
1249 | { | |
1250 | unsigned int ret = 0; | |
1251 | tree t; | |
1252 | ||
1253 | switch (TREE_CODE (type)) | |
1254 | { | |
1255 | case ARRAY_TYPE: | |
1256 | t = TYPE_MAIN_VARIANT (TREE_TYPE (type)); | |
1257 | if (t == char_type_node | |
1258 | || t == signed_char_type_node | |
1259 | || t == unsigned_char_type_node) | |
1260 | { | |
15362b89 JJ |
1261 | unsigned HOST_WIDE_INT max = PARAM_VALUE (PARAM_SSP_BUFFER_SIZE); |
1262 | unsigned HOST_WIDE_INT len; | |
7d69de61 | 1263 | |
15362b89 JJ |
1264 | if (!TYPE_SIZE_UNIT (type) |
1265 | || !host_integerp (TYPE_SIZE_UNIT (type), 1)) | |
1266 | len = max; | |
7d69de61 | 1267 | else |
15362b89 | 1268 | len = tree_low_cst (TYPE_SIZE_UNIT (type), 1); |
7d69de61 RH |
1269 | |
1270 | if (len < max) | |
1271 | ret = SPCT_HAS_SMALL_CHAR_ARRAY | SPCT_HAS_ARRAY; | |
1272 | else | |
1273 | ret = SPCT_HAS_LARGE_CHAR_ARRAY | SPCT_HAS_ARRAY; | |
1274 | } | |
1275 | else | |
1276 | ret = SPCT_HAS_ARRAY; | |
1277 | break; | |
1278 | ||
1279 | case UNION_TYPE: | |
1280 | case QUAL_UNION_TYPE: | |
1281 | case RECORD_TYPE: | |
1282 | ret = SPCT_HAS_AGGREGATE; | |
1283 | for (t = TYPE_FIELDS (type); t ; t = TREE_CHAIN (t)) | |
1284 | if (TREE_CODE (t) == FIELD_DECL) | |
1285 | ret |= stack_protect_classify_type (TREE_TYPE (t)); | |
1286 | break; | |
1287 | ||
1288 | default: | |
1289 | break; | |
1290 | } | |
1291 | ||
1292 | return ret; | |
1293 | } | |
1294 | ||
a4d05547 KH |
1295 | /* Return nonzero if DECL should be segregated into the "vulnerable" upper |
1296 | part of the local stack frame. Remember if we ever return nonzero for | |
7d69de61 RH |
1297 | any variable in this function. The return value is the phase number in |
1298 | which the variable should be allocated. */ | |
1299 | ||
1300 | static int | |
1301 | stack_protect_decl_phase (tree decl) | |
1302 | { | |
1303 | unsigned int bits = stack_protect_classify_type (TREE_TYPE (decl)); | |
1304 | int ret = 0; | |
1305 | ||
1306 | if (bits & SPCT_HAS_SMALL_CHAR_ARRAY) | |
1307 | has_short_buffer = true; | |
1308 | ||
1309 | if (flag_stack_protect == 2) | |
1310 | { | |
1311 | if ((bits & (SPCT_HAS_SMALL_CHAR_ARRAY | SPCT_HAS_LARGE_CHAR_ARRAY)) | |
1312 | && !(bits & SPCT_HAS_AGGREGATE)) | |
1313 | ret = 1; | |
1314 | else if (bits & SPCT_HAS_ARRAY) | |
1315 | ret = 2; | |
1316 | } | |
1317 | else | |
1318 | ret = (bits & SPCT_HAS_LARGE_CHAR_ARRAY) != 0; | |
1319 | ||
1320 | if (ret) | |
1321 | has_protected_decls = true; | |
1322 | ||
1323 | return ret; | |
1324 | } | |
1325 | ||
1326 | /* Two helper routines that check for phase 1 and phase 2. These are used | |
1327 | as callbacks for expand_stack_vars. */ | |
1328 | ||
1329 | static bool | |
1330 | stack_protect_decl_phase_1 (tree decl) | |
1331 | { | |
1332 | return stack_protect_decl_phase (decl) == 1; | |
1333 | } | |
1334 | ||
1335 | static bool | |
1336 | stack_protect_decl_phase_2 (tree decl) | |
1337 | { | |
1338 | return stack_protect_decl_phase (decl) == 2; | |
1339 | } | |
1340 | ||
1341 | /* Ensure that variables in different stack protection phases conflict | |
1342 | so that they are not merged and share the same stack slot. */ | |
1343 | ||
1344 | static void | |
1345 | add_stack_protection_conflicts (void) | |
1346 | { | |
1347 | size_t i, j, n = stack_vars_num; | |
1348 | unsigned char *phase; | |
1349 | ||
1350 | phase = XNEWVEC (unsigned char, n); | |
1351 | for (i = 0; i < n; ++i) | |
1352 | phase[i] = stack_protect_decl_phase (stack_vars[i].decl); | |
1353 | ||
1354 | for (i = 0; i < n; ++i) | |
1355 | { | |
1356 | unsigned char ph_i = phase[i]; | |
9b44f5d9 | 1357 | for (j = i + 1; j < n; ++j) |
7d69de61 RH |
1358 | if (ph_i != phase[j]) |
1359 | add_stack_var_conflict (i, j); | |
1360 | } | |
1361 | ||
1362 | XDELETEVEC (phase); | |
1363 | } | |
1364 | ||
1365 | /* Create a decl for the guard at the top of the stack frame. */ | |
1366 | ||
1367 | static void | |
1368 | create_stack_guard (void) | |
1369 | { | |
c2255bc4 AH |
1370 | tree guard = build_decl (DECL_SOURCE_LOCATION (current_function_decl), |
1371 | VAR_DECL, NULL, ptr_type_node); | |
7d69de61 RH |
1372 | TREE_THIS_VOLATILE (guard) = 1; |
1373 | TREE_USED (guard) = 1; | |
1374 | expand_one_stack_var (guard); | |
cb91fab0 | 1375 | crtl->stack_protect_guard = guard; |
7d69de61 RH |
1376 | } |
1377 | ||
ff28a94d | 1378 | /* Prepare for expanding variables. */ |
b8698a0f | 1379 | static void |
ff28a94d JH |
1380 | init_vars_expansion (void) |
1381 | { | |
3f9b14ff SB |
1382 | /* Conflict bitmaps, and a few related temporary bitmaps, go here. */ |
1383 | bitmap_obstack_initialize (&stack_var_bitmap_obstack); | |
ff28a94d | 1384 | |
3f9b14ff SB |
1385 | /* A map from decl to stack partition. */ |
1386 | decl_to_stack_part = pointer_map_create (); | |
ff28a94d JH |
1387 | |
1388 | /* Initialize local stack smashing state. */ | |
1389 | has_protected_decls = false; | |
1390 | has_short_buffer = false; | |
1391 | } | |
1392 | ||
1393 | /* Free up stack variable graph data. */ | |
1394 | static void | |
1395 | fini_vars_expansion (void) | |
1396 | { | |
3f9b14ff SB |
1397 | bitmap_obstack_release (&stack_var_bitmap_obstack); |
1398 | if (stack_vars) | |
1399 | XDELETEVEC (stack_vars); | |
1400 | if (stack_vars_sorted) | |
1401 | XDELETEVEC (stack_vars_sorted); | |
ff28a94d | 1402 | stack_vars = NULL; |
9b44f5d9 | 1403 | stack_vars_sorted = NULL; |
ff28a94d | 1404 | stack_vars_alloc = stack_vars_num = 0; |
47598145 MM |
1405 | pointer_map_destroy (decl_to_stack_part); |
1406 | decl_to_stack_part = NULL; | |
ff28a94d JH |
1407 | } |
1408 | ||
30925d94 AO |
1409 | /* Make a fair guess for the size of the stack frame of the function |
1410 | in NODE. This doesn't have to be exact, the result is only used in | |
1411 | the inline heuristics. So we don't want to run the full stack var | |
1412 | packing algorithm (which is quadratic in the number of stack vars). | |
1413 | Instead, we calculate the total size of all stack vars. This turns | |
1414 | out to be a pretty fair estimate -- packing of stack vars doesn't | |
1415 | happen very often. */ | |
b5a430f3 | 1416 | |
ff28a94d | 1417 | HOST_WIDE_INT |
30925d94 | 1418 | estimated_stack_frame_size (struct cgraph_node *node) |
ff28a94d JH |
1419 | { |
1420 | HOST_WIDE_INT size = 0; | |
b5a430f3 | 1421 | size_t i; |
bb7e6d55 | 1422 | tree var; |
960bfb69 | 1423 | struct function *fn = DECL_STRUCT_FUNCTION (node->symbol.decl); |
30925d94 | 1424 | |
bb7e6d55 | 1425 | push_cfun (fn); |
ff28a94d | 1426 | |
3f9b14ff SB |
1427 | init_vars_expansion (); |
1428 | ||
824f71b9 RG |
1429 | FOR_EACH_LOCAL_DECL (fn, i, var) |
1430 | if (auto_var_in_fn_p (var, fn->decl)) | |
1431 | size += expand_one_var (var, true, false); | |
b5a430f3 | 1432 | |
ff28a94d JH |
1433 | if (stack_vars_num > 0) |
1434 | { | |
b5a430f3 SB |
1435 | /* Fake sorting the stack vars for account_stack_vars (). */ |
1436 | stack_vars_sorted = XNEWVEC (size_t, stack_vars_num); | |
1437 | for (i = 0; i < stack_vars_num; ++i) | |
1438 | stack_vars_sorted[i] = i; | |
ff28a94d | 1439 | size += account_stack_vars (); |
ff28a94d | 1440 | } |
3f9b14ff SB |
1441 | |
1442 | fini_vars_expansion (); | |
2e1ec94f | 1443 | pop_cfun (); |
ff28a94d JH |
1444 | return size; |
1445 | } | |
1446 | ||
1f6d3a08 | 1447 | /* Expand all variables used in the function. */ |
727a31fa RH |
1448 | |
1449 | static void | |
1450 | expand_used_vars (void) | |
1451 | { | |
c021f10b NF |
1452 | tree var, outer_block = DECL_INITIAL (current_function_decl); |
1453 | VEC(tree,heap) *maybe_local_decls = NULL; | |
70b5e7dc | 1454 | struct pointer_map_t *ssa_name_decls; |
4e3825db | 1455 | unsigned i; |
c021f10b | 1456 | unsigned len; |
727a31fa | 1457 | |
1f6d3a08 RH |
1458 | /* Compute the phase of the stack frame for this function. */ |
1459 | { | |
1460 | int align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT; | |
1461 | int off = STARTING_FRAME_OFFSET % align; | |
1462 | frame_phase = off ? align - off : 0; | |
1463 | } | |
727a31fa | 1464 | |
3f9b14ff SB |
1465 | /* Set TREE_USED on all variables in the local_decls. */ |
1466 | FOR_EACH_LOCAL_DECL (cfun, i, var) | |
1467 | TREE_USED (var) = 1; | |
1468 | /* Clear TREE_USED on all variables associated with a block scope. */ | |
1469 | clear_tree_used (DECL_INITIAL (current_function_decl)); | |
1470 | ||
ff28a94d | 1471 | init_vars_expansion (); |
7d69de61 | 1472 | |
70b5e7dc | 1473 | ssa_name_decls = pointer_map_create (); |
4e3825db MM |
1474 | for (i = 0; i < SA.map->num_partitions; i++) |
1475 | { | |
1476 | tree var = partition_to_var (SA.map, i); | |
1477 | ||
ea057359 | 1478 | gcc_assert (!virtual_operand_p (var)); |
70b5e7dc RG |
1479 | |
1480 | /* Assign decls to each SSA name partition, share decls for partitions | |
1481 | we could have coalesced (those with the same type). */ | |
1482 | if (SSA_NAME_VAR (var) == NULL_TREE) | |
1483 | { | |
1484 | void **slot = pointer_map_insert (ssa_name_decls, TREE_TYPE (var)); | |
1485 | if (!*slot) | |
1486 | *slot = (void *) create_tmp_reg (TREE_TYPE (var), NULL); | |
1487 | replace_ssa_name_symbol (var, (tree) *slot); | |
1488 | } | |
1489 | ||
4e3825db MM |
1490 | if (TREE_CODE (SSA_NAME_VAR (var)) == VAR_DECL) |
1491 | expand_one_var (var, true, true); | |
1492 | else | |
1493 | { | |
1494 | /* This is a PARM_DECL or RESULT_DECL. For those partitions that | |
1495 | contain the default def (representing the parm or result itself) | |
1496 | we don't do anything here. But those which don't contain the | |
1497 | default def (representing a temporary based on the parm/result) | |
1498 | we need to allocate space just like for normal VAR_DECLs. */ | |
1499 | if (!bitmap_bit_p (SA.partition_has_default_def, i)) | |
1500 | { | |
1501 | expand_one_var (var, true, true); | |
1502 | gcc_assert (SA.partition_to_pseudo[i]); | |
1503 | } | |
1504 | } | |
1505 | } | |
70b5e7dc | 1506 | pointer_map_destroy (ssa_name_decls); |
4e3825db | 1507 | |
cb91fab0 | 1508 | /* At this point all variables on the local_decls with TREE_USED |
1f6d3a08 | 1509 | set are not associated with any block scope. Lay them out. */ |
c021f10b NF |
1510 | |
1511 | len = VEC_length (tree, cfun->local_decls); | |
1512 | FOR_EACH_LOCAL_DECL (cfun, i, var) | |
1f6d3a08 | 1513 | { |
1f6d3a08 RH |
1514 | bool expand_now = false; |
1515 | ||
4e3825db MM |
1516 | /* Expanded above already. */ |
1517 | if (is_gimple_reg (var)) | |
eb7adebc MM |
1518 | { |
1519 | TREE_USED (var) = 0; | |
3adcf52c | 1520 | goto next; |
eb7adebc | 1521 | } |
1f6d3a08 RH |
1522 | /* We didn't set a block for static or extern because it's hard |
1523 | to tell the difference between a global variable (re)declared | |
1524 | in a local scope, and one that's really declared there to | |
1525 | begin with. And it doesn't really matter much, since we're | |
1526 | not giving them stack space. Expand them now. */ | |
4e3825db | 1527 | else if (TREE_STATIC (var) || DECL_EXTERNAL (var)) |
1f6d3a08 RH |
1528 | expand_now = true; |
1529 | ||
1530 | /* If the variable is not associated with any block, then it | |
1531 | was created by the optimizers, and could be live anywhere | |
1532 | in the function. */ | |
1533 | else if (TREE_USED (var)) | |
1534 | expand_now = true; | |
1535 | ||
1536 | /* Finally, mark all variables on the list as used. We'll use | |
1537 | this in a moment when we expand those associated with scopes. */ | |
1538 | TREE_USED (var) = 1; | |
1539 | ||
1540 | if (expand_now) | |
3adcf52c JM |
1541 | expand_one_var (var, true, true); |
1542 | ||
1543 | next: | |
1544 | if (DECL_ARTIFICIAL (var) && !DECL_IGNORED_P (var)) | |
802e9f8e | 1545 | { |
3adcf52c JM |
1546 | rtx rtl = DECL_RTL_IF_SET (var); |
1547 | ||
1548 | /* Keep artificial non-ignored vars in cfun->local_decls | |
1549 | chain until instantiate_decls. */ | |
1550 | if (rtl && (MEM_P (rtl) || GET_CODE (rtl) == CONCAT)) | |
c021f10b | 1551 | add_local_decl (cfun, var); |
6c6366f6 | 1552 | else if (rtl == NULL_RTX) |
c021f10b NF |
1553 | /* If rtl isn't set yet, which can happen e.g. with |
1554 | -fstack-protector, retry before returning from this | |
1555 | function. */ | |
1556 | VEC_safe_push (tree, heap, maybe_local_decls, var); | |
802e9f8e | 1557 | } |
1f6d3a08 | 1558 | } |
1f6d3a08 | 1559 | |
c021f10b NF |
1560 | /* We duplicated some of the decls in CFUN->LOCAL_DECLS. |
1561 | ||
1562 | +-----------------+-----------------+ | |
1563 | | ...processed... | ...duplicates...| | |
1564 | +-----------------+-----------------+ | |
1565 | ^ | |
1566 | +-- LEN points here. | |
1567 | ||
1568 | We just want the duplicates, as those are the artificial | |
1569 | non-ignored vars that we want to keep until instantiate_decls. | |
1570 | Move them down and truncate the array. */ | |
1571 | if (!VEC_empty (tree, cfun->local_decls)) | |
1572 | VEC_block_remove (tree, cfun->local_decls, 0, len); | |
1573 | ||
1f6d3a08 RH |
1574 | /* At this point, all variables within the block tree with TREE_USED |
1575 | set are actually used by the optimized function. Lay them out. */ | |
1576 | expand_used_vars_for_block (outer_block, true); | |
1577 | ||
1578 | if (stack_vars_num > 0) | |
1579 | { | |
47598145 | 1580 | add_scope_conflicts (); |
1f6d3a08 | 1581 | |
c22cacf3 | 1582 | /* If stack protection is enabled, we don't share space between |
7d69de61 RH |
1583 | vulnerable data and non-vulnerable data. */ |
1584 | if (flag_stack_protect) | |
1585 | add_stack_protection_conflicts (); | |
1586 | ||
c22cacf3 | 1587 | /* Now that we have collected all stack variables, and have computed a |
1f6d3a08 RH |
1588 | minimal interference graph, attempt to save some stack space. */ |
1589 | partition_stack_vars (); | |
1590 | if (dump_file) | |
1591 | dump_stack_var_partition (); | |
7d69de61 RH |
1592 | } |
1593 | ||
1594 | /* There are several conditions under which we should create a | |
1595 | stack guard: protect-all, alloca used, protected decls present. */ | |
1596 | if (flag_stack_protect == 2 | |
1597 | || (flag_stack_protect | |
e3b5732b | 1598 | && (cfun->calls_alloca || has_protected_decls))) |
7d69de61 | 1599 | create_stack_guard (); |
1f6d3a08 | 1600 | |
7d69de61 RH |
1601 | /* Assign rtl to each variable based on these partitions. */ |
1602 | if (stack_vars_num > 0) | |
1603 | { | |
1604 | /* Reorder decls to be protected by iterating over the variables | |
1605 | array multiple times, and allocating out of each phase in turn. */ | |
c22cacf3 | 1606 | /* ??? We could probably integrate this into the qsort we did |
7d69de61 RH |
1607 | earlier, such that we naturally see these variables first, |
1608 | and thus naturally allocate things in the right order. */ | |
1609 | if (has_protected_decls) | |
1610 | { | |
1611 | /* Phase 1 contains only character arrays. */ | |
1612 | expand_stack_vars (stack_protect_decl_phase_1); | |
1613 | ||
1614 | /* Phase 2 contains other kinds of arrays. */ | |
1615 | if (flag_stack_protect == 2) | |
1616 | expand_stack_vars (stack_protect_decl_phase_2); | |
1617 | } | |
1618 | ||
1619 | expand_stack_vars (NULL); | |
1f6d3a08 RH |
1620 | } |
1621 | ||
3f9b14ff SB |
1622 | fini_vars_expansion (); |
1623 | ||
6c6366f6 JJ |
1624 | /* If there were any artificial non-ignored vars without rtl |
1625 | found earlier, see if deferred stack allocation hasn't assigned | |
1626 | rtl to them. */ | |
c021f10b | 1627 | FOR_EACH_VEC_ELT_REVERSE (tree, maybe_local_decls, i, var) |
6c6366f6 | 1628 | { |
6c6366f6 JJ |
1629 | rtx rtl = DECL_RTL_IF_SET (var); |
1630 | ||
6c6366f6 JJ |
1631 | /* Keep artificial non-ignored vars in cfun->local_decls |
1632 | chain until instantiate_decls. */ | |
1633 | if (rtl && (MEM_P (rtl) || GET_CODE (rtl) == CONCAT)) | |
c021f10b | 1634 | add_local_decl (cfun, var); |
6c6366f6 | 1635 | } |
c021f10b | 1636 | VEC_free (tree, heap, maybe_local_decls); |
6c6366f6 | 1637 | |
1f6d3a08 RH |
1638 | /* If the target requires that FRAME_OFFSET be aligned, do it. */ |
1639 | if (STACK_ALIGNMENT_NEEDED) | |
1640 | { | |
1641 | HOST_WIDE_INT align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT; | |
1642 | if (!FRAME_GROWS_DOWNWARD) | |
1643 | frame_offset += align - 1; | |
1644 | frame_offset &= -align; | |
1645 | } | |
727a31fa RH |
1646 | } |
1647 | ||
1648 | ||
b7211528 SB |
1649 | /* If we need to produce a detailed dump, print the tree representation |
1650 | for STMT to the dump file. SINCE is the last RTX after which the RTL | |
1651 | generated for STMT should have been appended. */ | |
1652 | ||
1653 | static void | |
726a989a | 1654 | maybe_dump_rtl_for_gimple_stmt (gimple stmt, rtx since) |
b7211528 SB |
1655 | { |
1656 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
1657 | { | |
1658 | fprintf (dump_file, "\n;; "); | |
b5b8b0ac AO |
1659 | print_gimple_stmt (dump_file, stmt, 0, |
1660 | TDF_SLIM | (dump_flags & TDF_LINENO)); | |
b7211528 SB |
1661 | fprintf (dump_file, "\n"); |
1662 | ||
1663 | print_rtl (dump_file, since ? NEXT_INSN (since) : since); | |
1664 | } | |
1665 | } | |
1666 | ||
8b11009b ZD |
1667 | /* Maps the blocks that do not contain tree labels to rtx labels. */ |
1668 | ||
1669 | static struct pointer_map_t *lab_rtx_for_bb; | |
1670 | ||
a9b77cd1 ZD |
1671 | /* Returns the label_rtx expression for a label starting basic block BB. */ |
1672 | ||
1673 | static rtx | |
726a989a | 1674 | label_rtx_for_bb (basic_block bb ATTRIBUTE_UNUSED) |
a9b77cd1 | 1675 | { |
726a989a RB |
1676 | gimple_stmt_iterator gsi; |
1677 | tree lab; | |
1678 | gimple lab_stmt; | |
8b11009b | 1679 | void **elt; |
a9b77cd1 ZD |
1680 | |
1681 | if (bb->flags & BB_RTL) | |
1682 | return block_label (bb); | |
1683 | ||
8b11009b ZD |
1684 | elt = pointer_map_contains (lab_rtx_for_bb, bb); |
1685 | if (elt) | |
ae50c0cb | 1686 | return (rtx) *elt; |
8b11009b ZD |
1687 | |
1688 | /* Find the tree label if it is present. */ | |
b8698a0f | 1689 | |
726a989a | 1690 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
a9b77cd1 | 1691 | { |
726a989a RB |
1692 | lab_stmt = gsi_stmt (gsi); |
1693 | if (gimple_code (lab_stmt) != GIMPLE_LABEL) | |
a9b77cd1 ZD |
1694 | break; |
1695 | ||
726a989a | 1696 | lab = gimple_label_label (lab_stmt); |
a9b77cd1 ZD |
1697 | if (DECL_NONLOCAL (lab)) |
1698 | break; | |
1699 | ||
1700 | return label_rtx (lab); | |
1701 | } | |
1702 | ||
8b11009b ZD |
1703 | elt = pointer_map_insert (lab_rtx_for_bb, bb); |
1704 | *elt = gen_label_rtx (); | |
ae50c0cb | 1705 | return (rtx) *elt; |
a9b77cd1 ZD |
1706 | } |
1707 | ||
726a989a | 1708 | |
529ff441 MM |
1709 | /* A subroutine of expand_gimple_cond. Given E, a fallthrough edge |
1710 | of a basic block where we just expanded the conditional at the end, | |
315adeda MM |
1711 | possibly clean up the CFG and instruction sequence. LAST is the |
1712 | last instruction before the just emitted jump sequence. */ | |
529ff441 MM |
1713 | |
1714 | static void | |
315adeda | 1715 | maybe_cleanup_end_of_block (edge e, rtx last) |
529ff441 MM |
1716 | { |
1717 | /* Special case: when jumpif decides that the condition is | |
1718 | trivial it emits an unconditional jump (and the necessary | |
1719 | barrier). But we still have two edges, the fallthru one is | |
1720 | wrong. purge_dead_edges would clean this up later. Unfortunately | |
1721 | we have to insert insns (and split edges) before | |
1722 | find_many_sub_basic_blocks and hence before purge_dead_edges. | |
1723 | But splitting edges might create new blocks which depend on the | |
1724 | fact that if there are two edges there's no barrier. So the | |
1725 | barrier would get lost and verify_flow_info would ICE. Instead | |
1726 | of auditing all edge splitters to care for the barrier (which | |
1727 | normally isn't there in a cleaned CFG), fix it here. */ | |
1728 | if (BARRIER_P (get_last_insn ())) | |
1729 | { | |
529ff441 MM |
1730 | rtx insn; |
1731 | remove_edge (e); | |
1732 | /* Now, we have a single successor block, if we have insns to | |
1733 | insert on the remaining edge we potentially will insert | |
1734 | it at the end of this block (if the dest block isn't feasible) | |
1735 | in order to avoid splitting the edge. This insertion will take | |
1736 | place in front of the last jump. But we might have emitted | |
1737 | multiple jumps (conditional and one unconditional) to the | |
1738 | same destination. Inserting in front of the last one then | |
1739 | is a problem. See PR 40021. We fix this by deleting all | |
1740 | jumps except the last unconditional one. */ | |
1741 | insn = PREV_INSN (get_last_insn ()); | |
1742 | /* Make sure we have an unconditional jump. Otherwise we're | |
1743 | confused. */ | |
1744 | gcc_assert (JUMP_P (insn) && !any_condjump_p (insn)); | |
315adeda | 1745 | for (insn = PREV_INSN (insn); insn != last;) |
529ff441 MM |
1746 | { |
1747 | insn = PREV_INSN (insn); | |
1748 | if (JUMP_P (NEXT_INSN (insn))) | |
90eb3e33 | 1749 | { |
8a269cb7 | 1750 | if (!any_condjump_p (NEXT_INSN (insn))) |
90eb3e33 JJ |
1751 | { |
1752 | gcc_assert (BARRIER_P (NEXT_INSN (NEXT_INSN (insn)))); | |
1753 | delete_insn (NEXT_INSN (NEXT_INSN (insn))); | |
1754 | } | |
1755 | delete_insn (NEXT_INSN (insn)); | |
1756 | } | |
529ff441 MM |
1757 | } |
1758 | } | |
1759 | } | |
1760 | ||
726a989a | 1761 | /* A subroutine of expand_gimple_basic_block. Expand one GIMPLE_COND. |
80c7a9eb RH |
1762 | Returns a new basic block if we've terminated the current basic |
1763 | block and created a new one. */ | |
1764 | ||
1765 | static basic_block | |
726a989a | 1766 | expand_gimple_cond (basic_block bb, gimple stmt) |
80c7a9eb RH |
1767 | { |
1768 | basic_block new_bb, dest; | |
1769 | edge new_edge; | |
1770 | edge true_edge; | |
1771 | edge false_edge; | |
b7211528 | 1772 | rtx last2, last; |
28ed065e MM |
1773 | enum tree_code code; |
1774 | tree op0, op1; | |
1775 | ||
1776 | code = gimple_cond_code (stmt); | |
1777 | op0 = gimple_cond_lhs (stmt); | |
1778 | op1 = gimple_cond_rhs (stmt); | |
1779 | /* We're sometimes presented with such code: | |
1780 | D.123_1 = x < y; | |
1781 | if (D.123_1 != 0) | |
1782 | ... | |
1783 | This would expand to two comparisons which then later might | |
1784 | be cleaned up by combine. But some pattern matchers like if-conversion | |
1785 | work better when there's only one compare, so make up for this | |
1786 | here as special exception if TER would have made the same change. */ | |
1787 | if (gimple_cond_single_var_p (stmt) | |
1788 | && SA.values | |
1789 | && TREE_CODE (op0) == SSA_NAME | |
1790 | && bitmap_bit_p (SA.values, SSA_NAME_VERSION (op0))) | |
1791 | { | |
1792 | gimple second = SSA_NAME_DEF_STMT (op0); | |
e83f4b68 | 1793 | if (gimple_code (second) == GIMPLE_ASSIGN) |
28ed065e | 1794 | { |
e83f4b68 MM |
1795 | enum tree_code code2 = gimple_assign_rhs_code (second); |
1796 | if (TREE_CODE_CLASS (code2) == tcc_comparison) | |
1797 | { | |
1798 | code = code2; | |
1799 | op0 = gimple_assign_rhs1 (second); | |
1800 | op1 = gimple_assign_rhs2 (second); | |
1801 | } | |
1802 | /* If jumps are cheap turn some more codes into | |
1803 | jumpy sequences. */ | |
1804 | else if (BRANCH_COST (optimize_insn_for_speed_p (), false) < 4) | |
1805 | { | |
1806 | if ((code2 == BIT_AND_EXPR | |
1807 | && TYPE_PRECISION (TREE_TYPE (op0)) == 1 | |
1808 | && TREE_CODE (gimple_assign_rhs2 (second)) != INTEGER_CST) | |
1809 | || code2 == TRUTH_AND_EXPR) | |
1810 | { | |
1811 | code = TRUTH_ANDIF_EXPR; | |
1812 | op0 = gimple_assign_rhs1 (second); | |
1813 | op1 = gimple_assign_rhs2 (second); | |
1814 | } | |
1815 | else if (code2 == BIT_IOR_EXPR || code2 == TRUTH_OR_EXPR) | |
1816 | { | |
1817 | code = TRUTH_ORIF_EXPR; | |
1818 | op0 = gimple_assign_rhs1 (second); | |
1819 | op1 = gimple_assign_rhs2 (second); | |
1820 | } | |
1821 | } | |
28ed065e MM |
1822 | } |
1823 | } | |
b7211528 SB |
1824 | |
1825 | last2 = last = get_last_insn (); | |
80c7a9eb RH |
1826 | |
1827 | extract_true_false_edges_from_block (bb, &true_edge, &false_edge); | |
5368224f | 1828 | set_curr_insn_location (gimple_location (stmt)); |
80c7a9eb RH |
1829 | |
1830 | /* These flags have no purpose in RTL land. */ | |
1831 | true_edge->flags &= ~EDGE_TRUE_VALUE; | |
1832 | false_edge->flags &= ~EDGE_FALSE_VALUE; | |
1833 | ||
1834 | /* We can either have a pure conditional jump with one fallthru edge or | |
1835 | two-way jump that needs to be decomposed into two basic blocks. */ | |
a9b77cd1 | 1836 | if (false_edge->dest == bb->next_bb) |
80c7a9eb | 1837 | { |
40e90eac JJ |
1838 | jumpif_1 (code, op0, op1, label_rtx_for_bb (true_edge->dest), |
1839 | true_edge->probability); | |
726a989a | 1840 | maybe_dump_rtl_for_gimple_stmt (stmt, last); |
5368224f DC |
1841 | if (!IS_UNKNOWN_LOCATION (true_edge->goto_locus)) |
1842 | set_curr_insn_location (true_edge->goto_locus); | |
a9b77cd1 | 1843 | false_edge->flags |= EDGE_FALLTHRU; |
315adeda | 1844 | maybe_cleanup_end_of_block (false_edge, last); |
80c7a9eb RH |
1845 | return NULL; |
1846 | } | |
a9b77cd1 | 1847 | if (true_edge->dest == bb->next_bb) |
80c7a9eb | 1848 | { |
40e90eac JJ |
1849 | jumpifnot_1 (code, op0, op1, label_rtx_for_bb (false_edge->dest), |
1850 | false_edge->probability); | |
726a989a | 1851 | maybe_dump_rtl_for_gimple_stmt (stmt, last); |
5368224f DC |
1852 | if (!IS_UNKNOWN_LOCATION (false_edge->goto_locus)) |
1853 | set_curr_insn_location (false_edge->goto_locus); | |
a9b77cd1 | 1854 | true_edge->flags |= EDGE_FALLTHRU; |
315adeda | 1855 | maybe_cleanup_end_of_block (true_edge, last); |
80c7a9eb RH |
1856 | return NULL; |
1857 | } | |
80c7a9eb | 1858 | |
40e90eac JJ |
1859 | jumpif_1 (code, op0, op1, label_rtx_for_bb (true_edge->dest), |
1860 | true_edge->probability); | |
80c7a9eb | 1861 | last = get_last_insn (); |
5368224f DC |
1862 | if (!IS_UNKNOWN_LOCATION (false_edge->goto_locus)) |
1863 | set_curr_insn_location (false_edge->goto_locus); | |
a9b77cd1 | 1864 | emit_jump (label_rtx_for_bb (false_edge->dest)); |
80c7a9eb RH |
1865 | |
1866 | BB_END (bb) = last; | |
1867 | if (BARRIER_P (BB_END (bb))) | |
1868 | BB_END (bb) = PREV_INSN (BB_END (bb)); | |
1869 | update_bb_for_insn (bb); | |
1870 | ||
1871 | new_bb = create_basic_block (NEXT_INSN (last), get_last_insn (), bb); | |
1872 | dest = false_edge->dest; | |
1873 | redirect_edge_succ (false_edge, new_bb); | |
1874 | false_edge->flags |= EDGE_FALLTHRU; | |
1875 | new_bb->count = false_edge->count; | |
1876 | new_bb->frequency = EDGE_FREQUENCY (false_edge); | |
7d776ee2 RG |
1877 | if (current_loops && bb->loop_father) |
1878 | add_bb_to_loop (new_bb, bb->loop_father); | |
80c7a9eb RH |
1879 | new_edge = make_edge (new_bb, dest, 0); |
1880 | new_edge->probability = REG_BR_PROB_BASE; | |
1881 | new_edge->count = new_bb->count; | |
1882 | if (BARRIER_P (BB_END (new_bb))) | |
1883 | BB_END (new_bb) = PREV_INSN (BB_END (new_bb)); | |
1884 | update_bb_for_insn (new_bb); | |
1885 | ||
726a989a | 1886 | maybe_dump_rtl_for_gimple_stmt (stmt, last2); |
c22cacf3 | 1887 | |
5368224f | 1888 | if (!IS_UNKNOWN_LOCATION (true_edge->goto_locus)) |
7787b4aa | 1889 | { |
5368224f DC |
1890 | set_curr_insn_location (true_edge->goto_locus); |
1891 | true_edge->goto_locus = curr_insn_location (); | |
7787b4aa | 1892 | } |
7787b4aa | 1893 | |
80c7a9eb RH |
1894 | return new_bb; |
1895 | } | |
1896 | ||
0a35513e AH |
1897 | /* Mark all calls that can have a transaction restart. */ |
1898 | ||
1899 | static void | |
1900 | mark_transaction_restart_calls (gimple stmt) | |
1901 | { | |
1902 | struct tm_restart_node dummy; | |
1903 | void **slot; | |
1904 | ||
1905 | if (!cfun->gimple_df->tm_restart) | |
1906 | return; | |
1907 | ||
1908 | dummy.stmt = stmt; | |
1909 | slot = htab_find_slot (cfun->gimple_df->tm_restart, &dummy, NO_INSERT); | |
1910 | if (slot) | |
1911 | { | |
1912 | struct tm_restart_node *n = (struct tm_restart_node *) *slot; | |
1913 | tree list = n->label_or_list; | |
1914 | rtx insn; | |
1915 | ||
1916 | for (insn = next_real_insn (get_last_insn ()); | |
1917 | !CALL_P (insn); | |
1918 | insn = next_real_insn (insn)) | |
1919 | continue; | |
1920 | ||
1921 | if (TREE_CODE (list) == LABEL_DECL) | |
1922 | add_reg_note (insn, REG_TM, label_rtx (list)); | |
1923 | else | |
1924 | for (; list ; list = TREE_CHAIN (list)) | |
1925 | add_reg_note (insn, REG_TM, label_rtx (TREE_VALUE (list))); | |
1926 | } | |
1927 | } | |
1928 | ||
28ed065e MM |
1929 | /* A subroutine of expand_gimple_stmt_1, expanding one GIMPLE_CALL |
1930 | statement STMT. */ | |
1931 | ||
1932 | static void | |
1933 | expand_call_stmt (gimple stmt) | |
1934 | { | |
25583c4f | 1935 | tree exp, decl, lhs; |
e23817b3 | 1936 | bool builtin_p; |
e7925582 | 1937 | size_t i; |
28ed065e | 1938 | |
25583c4f RS |
1939 | if (gimple_call_internal_p (stmt)) |
1940 | { | |
1941 | expand_internal_call (stmt); | |
1942 | return; | |
1943 | } | |
1944 | ||
28ed065e MM |
1945 | exp = build_vl_exp (CALL_EXPR, gimple_call_num_args (stmt) + 3); |
1946 | ||
1947 | CALL_EXPR_FN (exp) = gimple_call_fn (stmt); | |
e23817b3 RG |
1948 | decl = gimple_call_fndecl (stmt); |
1949 | builtin_p = decl && DECL_BUILT_IN (decl); | |
1950 | ||
e7925582 EB |
1951 | /* If this is not a builtin function, the function type through which the |
1952 | call is made may be different from the type of the function. */ | |
1953 | if (!builtin_p) | |
1954 | CALL_EXPR_FN (exp) | |
b25aa0e8 EB |
1955 | = fold_convert (build_pointer_type (gimple_call_fntype (stmt)), |
1956 | CALL_EXPR_FN (exp)); | |
e7925582 | 1957 | |
28ed065e MM |
1958 | TREE_TYPE (exp) = gimple_call_return_type (stmt); |
1959 | CALL_EXPR_STATIC_CHAIN (exp) = gimple_call_chain (stmt); | |
1960 | ||
1961 | for (i = 0; i < gimple_call_num_args (stmt); i++) | |
e23817b3 RG |
1962 | { |
1963 | tree arg = gimple_call_arg (stmt, i); | |
1964 | gimple def; | |
1965 | /* TER addresses into arguments of builtin functions so we have a | |
1966 | chance to infer more correct alignment information. See PR39954. */ | |
1967 | if (builtin_p | |
1968 | && TREE_CODE (arg) == SSA_NAME | |
1969 | && (def = get_gimple_for_ssa_name (arg)) | |
1970 | && gimple_assign_rhs_code (def) == ADDR_EXPR) | |
1971 | arg = gimple_assign_rhs1 (def); | |
1972 | CALL_EXPR_ARG (exp, i) = arg; | |
1973 | } | |
28ed065e | 1974 | |
93f28ca7 | 1975 | if (gimple_has_side_effects (stmt)) |
28ed065e MM |
1976 | TREE_SIDE_EFFECTS (exp) = 1; |
1977 | ||
93f28ca7 | 1978 | if (gimple_call_nothrow_p (stmt)) |
28ed065e MM |
1979 | TREE_NOTHROW (exp) = 1; |
1980 | ||
1981 | CALL_EXPR_TAILCALL (exp) = gimple_call_tail_p (stmt); | |
1982 | CALL_EXPR_RETURN_SLOT_OPT (exp) = gimple_call_return_slot_opt_p (stmt); | |
63d2a353 MM |
1983 | if (decl |
1984 | && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL | |
13e49da9 TV |
1985 | && (DECL_FUNCTION_CODE (decl) == BUILT_IN_ALLOCA |
1986 | || DECL_FUNCTION_CODE (decl) == BUILT_IN_ALLOCA_WITH_ALIGN)) | |
63d2a353 MM |
1987 | CALL_ALLOCA_FOR_VAR_P (exp) = gimple_call_alloca_for_var_p (stmt); |
1988 | else | |
1989 | CALL_FROM_THUNK_P (exp) = gimple_call_from_thunk_p (stmt); | |
28ed065e MM |
1990 | CALL_EXPR_VA_ARG_PACK (exp) = gimple_call_va_arg_pack_p (stmt); |
1991 | SET_EXPR_LOCATION (exp, gimple_location (stmt)); | |
28ed065e | 1992 | |
ddb555ed JJ |
1993 | /* Ensure RTL is created for debug args. */ |
1994 | if (decl && DECL_HAS_DEBUG_ARGS_P (decl)) | |
1995 | { | |
1996 | VEC(tree, gc) **debug_args = decl_debug_args_lookup (decl); | |
1997 | unsigned int ix; | |
1998 | tree dtemp; | |
1999 | ||
2000 | if (debug_args) | |
2001 | for (ix = 1; VEC_iterate (tree, *debug_args, ix, dtemp); ix += 2) | |
2002 | { | |
2003 | gcc_assert (TREE_CODE (dtemp) == DEBUG_EXPR_DECL); | |
2004 | expand_debug_expr (dtemp); | |
2005 | } | |
2006 | } | |
2007 | ||
25583c4f | 2008 | lhs = gimple_call_lhs (stmt); |
28ed065e MM |
2009 | if (lhs) |
2010 | expand_assignment (lhs, exp, false); | |
2011 | else | |
2012 | expand_expr_real_1 (exp, const0_rtx, VOIDmode, EXPAND_NORMAL, NULL); | |
0a35513e AH |
2013 | |
2014 | mark_transaction_restart_calls (stmt); | |
28ed065e MM |
2015 | } |
2016 | ||
2017 | /* A subroutine of expand_gimple_stmt, expanding one gimple statement | |
2018 | STMT that doesn't require special handling for outgoing edges. That | |
2019 | is no tailcalls and no GIMPLE_COND. */ | |
2020 | ||
2021 | static void | |
2022 | expand_gimple_stmt_1 (gimple stmt) | |
2023 | { | |
2024 | tree op0; | |
c82fee88 | 2025 | |
5368224f | 2026 | set_curr_insn_location (gimple_location (stmt)); |
c82fee88 | 2027 | |
28ed065e MM |
2028 | switch (gimple_code (stmt)) |
2029 | { | |
2030 | case GIMPLE_GOTO: | |
2031 | op0 = gimple_goto_dest (stmt); | |
2032 | if (TREE_CODE (op0) == LABEL_DECL) | |
2033 | expand_goto (op0); | |
2034 | else | |
2035 | expand_computed_goto (op0); | |
2036 | break; | |
2037 | case GIMPLE_LABEL: | |
2038 | expand_label (gimple_label_label (stmt)); | |
2039 | break; | |
2040 | case GIMPLE_NOP: | |
2041 | case GIMPLE_PREDICT: | |
2042 | break; | |
28ed065e MM |
2043 | case GIMPLE_SWITCH: |
2044 | expand_case (stmt); | |
2045 | break; | |
2046 | case GIMPLE_ASM: | |
2047 | expand_asm_stmt (stmt); | |
2048 | break; | |
2049 | case GIMPLE_CALL: | |
2050 | expand_call_stmt (stmt); | |
2051 | break; | |
2052 | ||
2053 | case GIMPLE_RETURN: | |
2054 | op0 = gimple_return_retval (stmt); | |
2055 | ||
2056 | if (op0 && op0 != error_mark_node) | |
2057 | { | |
2058 | tree result = DECL_RESULT (current_function_decl); | |
2059 | ||
2060 | /* If we are not returning the current function's RESULT_DECL, | |
2061 | build an assignment to it. */ | |
2062 | if (op0 != result) | |
2063 | { | |
2064 | /* I believe that a function's RESULT_DECL is unique. */ | |
2065 | gcc_assert (TREE_CODE (op0) != RESULT_DECL); | |
2066 | ||
2067 | /* ??? We'd like to use simply expand_assignment here, | |
2068 | but this fails if the value is of BLKmode but the return | |
2069 | decl is a register. expand_return has special handling | |
2070 | for this combination, which eventually should move | |
2071 | to common code. See comments there. Until then, let's | |
2072 | build a modify expression :-/ */ | |
2073 | op0 = build2 (MODIFY_EXPR, TREE_TYPE (result), | |
2074 | result, op0); | |
2075 | } | |
2076 | } | |
2077 | if (!op0) | |
2078 | expand_null_return (); | |
2079 | else | |
2080 | expand_return (op0); | |
2081 | break; | |
2082 | ||
2083 | case GIMPLE_ASSIGN: | |
2084 | { | |
2085 | tree lhs = gimple_assign_lhs (stmt); | |
2086 | ||
2087 | /* Tree expand used to fiddle with |= and &= of two bitfield | |
2088 | COMPONENT_REFs here. This can't happen with gimple, the LHS | |
2089 | of binary assigns must be a gimple reg. */ | |
2090 | ||
2091 | if (TREE_CODE (lhs) != SSA_NAME | |
2092 | || get_gimple_rhs_class (gimple_expr_code (stmt)) | |
2093 | == GIMPLE_SINGLE_RHS) | |
2094 | { | |
2095 | tree rhs = gimple_assign_rhs1 (stmt); | |
2096 | gcc_assert (get_gimple_rhs_class (gimple_expr_code (stmt)) | |
2097 | == GIMPLE_SINGLE_RHS); | |
2098 | if (gimple_has_location (stmt) && CAN_HAVE_LOCATION_P (rhs)) | |
2099 | SET_EXPR_LOCATION (rhs, gimple_location (stmt)); | |
47598145 MM |
2100 | if (TREE_CLOBBER_P (rhs)) |
2101 | /* This is a clobber to mark the going out of scope for | |
2102 | this LHS. */ | |
2103 | ; | |
2104 | else | |
2105 | expand_assignment (lhs, rhs, | |
2106 | gimple_assign_nontemporal_move_p (stmt)); | |
28ed065e MM |
2107 | } |
2108 | else | |
2109 | { | |
2110 | rtx target, temp; | |
2111 | bool nontemporal = gimple_assign_nontemporal_move_p (stmt); | |
2112 | struct separate_ops ops; | |
2113 | bool promoted = false; | |
2114 | ||
2115 | target = expand_expr (lhs, NULL_RTX, VOIDmode, EXPAND_WRITE); | |
2116 | if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target)) | |
2117 | promoted = true; | |
2118 | ||
2119 | ops.code = gimple_assign_rhs_code (stmt); | |
2120 | ops.type = TREE_TYPE (lhs); | |
2121 | switch (get_gimple_rhs_class (gimple_expr_code (stmt))) | |
2122 | { | |
0354c0c7 BS |
2123 | case GIMPLE_TERNARY_RHS: |
2124 | ops.op2 = gimple_assign_rhs3 (stmt); | |
2125 | /* Fallthru */ | |
28ed065e MM |
2126 | case GIMPLE_BINARY_RHS: |
2127 | ops.op1 = gimple_assign_rhs2 (stmt); | |
2128 | /* Fallthru */ | |
2129 | case GIMPLE_UNARY_RHS: | |
2130 | ops.op0 = gimple_assign_rhs1 (stmt); | |
2131 | break; | |
2132 | default: | |
2133 | gcc_unreachable (); | |
2134 | } | |
2135 | ops.location = gimple_location (stmt); | |
2136 | ||
2137 | /* If we want to use a nontemporal store, force the value to | |
2138 | register first. If we store into a promoted register, | |
2139 | don't directly expand to target. */ | |
2140 | temp = nontemporal || promoted ? NULL_RTX : target; | |
2141 | temp = expand_expr_real_2 (&ops, temp, GET_MODE (target), | |
2142 | EXPAND_NORMAL); | |
2143 | ||
2144 | if (temp == target) | |
2145 | ; | |
2146 | else if (promoted) | |
2147 | { | |
4e18a7d4 | 2148 | int unsignedp = SUBREG_PROMOTED_UNSIGNED_P (target); |
28ed065e MM |
2149 | /* If TEMP is a VOIDmode constant, use convert_modes to make |
2150 | sure that we properly convert it. */ | |
2151 | if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode) | |
2152 | { | |
2153 | temp = convert_modes (GET_MODE (target), | |
2154 | TYPE_MODE (ops.type), | |
4e18a7d4 | 2155 | temp, unsignedp); |
28ed065e | 2156 | temp = convert_modes (GET_MODE (SUBREG_REG (target)), |
4e18a7d4 | 2157 | GET_MODE (target), temp, unsignedp); |
28ed065e MM |
2158 | } |
2159 | ||
4e18a7d4 | 2160 | convert_move (SUBREG_REG (target), temp, unsignedp); |
28ed065e MM |
2161 | } |
2162 | else if (nontemporal && emit_storent_insn (target, temp)) | |
2163 | ; | |
2164 | else | |
2165 | { | |
2166 | temp = force_operand (temp, target); | |
2167 | if (temp != target) | |
2168 | emit_move_insn (target, temp); | |
2169 | } | |
2170 | } | |
2171 | } | |
2172 | break; | |
2173 | ||
2174 | default: | |
2175 | gcc_unreachable (); | |
2176 | } | |
2177 | } | |
2178 | ||
2179 | /* Expand one gimple statement STMT and return the last RTL instruction | |
2180 | before any of the newly generated ones. | |
2181 | ||
2182 | In addition to generating the necessary RTL instructions this also | |
2183 | sets REG_EH_REGION notes if necessary and sets the current source | |
2184 | location for diagnostics. */ | |
2185 | ||
2186 | static rtx | |
2187 | expand_gimple_stmt (gimple stmt) | |
2188 | { | |
28ed065e | 2189 | location_t saved_location = input_location; |
c82fee88 EB |
2190 | rtx last = get_last_insn (); |
2191 | int lp_nr; | |
28ed065e | 2192 | |
28ed065e MM |
2193 | gcc_assert (cfun); |
2194 | ||
c82fee88 EB |
2195 | /* We need to save and restore the current source location so that errors |
2196 | discovered during expansion are emitted with the right location. But | |
2197 | it would be better if the diagnostic routines used the source location | |
2198 | embedded in the tree nodes rather than globals. */ | |
28ed065e | 2199 | if (gimple_has_location (stmt)) |
c82fee88 | 2200 | input_location = gimple_location (stmt); |
28ed065e MM |
2201 | |
2202 | expand_gimple_stmt_1 (stmt); | |
c82fee88 | 2203 | |
28ed065e MM |
2204 | /* Free any temporaries used to evaluate this statement. */ |
2205 | free_temp_slots (); | |
2206 | ||
2207 | input_location = saved_location; | |
2208 | ||
2209 | /* Mark all insns that may trap. */ | |
1d65f45c RH |
2210 | lp_nr = lookup_stmt_eh_lp (stmt); |
2211 | if (lp_nr) | |
28ed065e MM |
2212 | { |
2213 | rtx insn; | |
2214 | for (insn = next_real_insn (last); insn; | |
2215 | insn = next_real_insn (insn)) | |
2216 | { | |
2217 | if (! find_reg_note (insn, REG_EH_REGION, NULL_RTX) | |
2218 | /* If we want exceptions for non-call insns, any | |
2219 | may_trap_p instruction may throw. */ | |
2220 | && GET_CODE (PATTERN (insn)) != CLOBBER | |
2221 | && GET_CODE (PATTERN (insn)) != USE | |
1d65f45c RH |
2222 | && insn_could_throw_p (insn)) |
2223 | make_reg_eh_region_note (insn, 0, lp_nr); | |
28ed065e MM |
2224 | } |
2225 | } | |
2226 | ||
2227 | return last; | |
2228 | } | |
2229 | ||
726a989a | 2230 | /* A subroutine of expand_gimple_basic_block. Expand one GIMPLE_CALL |
224e770b RH |
2231 | that has CALL_EXPR_TAILCALL set. Returns non-null if we actually |
2232 | generated a tail call (something that might be denied by the ABI | |
cea49550 RH |
2233 | rules governing the call; see calls.c). |
2234 | ||
2235 | Sets CAN_FALLTHRU if we generated a *conditional* tail call, and | |
2236 | can still reach the rest of BB. The case here is __builtin_sqrt, | |
2237 | where the NaN result goes through the external function (with a | |
2238 | tailcall) and the normal result happens via a sqrt instruction. */ | |
80c7a9eb RH |
2239 | |
2240 | static basic_block | |
726a989a | 2241 | expand_gimple_tailcall (basic_block bb, gimple stmt, bool *can_fallthru) |
80c7a9eb | 2242 | { |
b7211528 | 2243 | rtx last2, last; |
224e770b | 2244 | edge e; |
628f6a4e | 2245 | edge_iterator ei; |
224e770b RH |
2246 | int probability; |
2247 | gcov_type count; | |
80c7a9eb | 2248 | |
28ed065e | 2249 | last2 = last = expand_gimple_stmt (stmt); |
80c7a9eb RH |
2250 | |
2251 | for (last = NEXT_INSN (last); last; last = NEXT_INSN (last)) | |
224e770b RH |
2252 | if (CALL_P (last) && SIBLING_CALL_P (last)) |
2253 | goto found; | |
80c7a9eb | 2254 | |
726a989a | 2255 | maybe_dump_rtl_for_gimple_stmt (stmt, last2); |
b7211528 | 2256 | |
cea49550 | 2257 | *can_fallthru = true; |
224e770b | 2258 | return NULL; |
80c7a9eb | 2259 | |
224e770b RH |
2260 | found: |
2261 | /* ??? Wouldn't it be better to just reset any pending stack adjust? | |
2262 | Any instructions emitted here are about to be deleted. */ | |
2263 | do_pending_stack_adjust (); | |
2264 | ||
2265 | /* Remove any non-eh, non-abnormal edges that don't go to exit. */ | |
2266 | /* ??? I.e. the fallthrough edge. HOWEVER! If there were to be | |
2267 | EH or abnormal edges, we shouldn't have created a tail call in | |
2268 | the first place. So it seems to me we should just be removing | |
2269 | all edges here, or redirecting the existing fallthru edge to | |
2270 | the exit block. */ | |
2271 | ||
224e770b RH |
2272 | probability = 0; |
2273 | count = 0; | |
224e770b | 2274 | |
628f6a4e BE |
2275 | for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) |
2276 | { | |
224e770b RH |
2277 | if (!(e->flags & (EDGE_ABNORMAL | EDGE_EH))) |
2278 | { | |
2279 | if (e->dest != EXIT_BLOCK_PTR) | |
80c7a9eb | 2280 | { |
224e770b RH |
2281 | e->dest->count -= e->count; |
2282 | e->dest->frequency -= EDGE_FREQUENCY (e); | |
2283 | if (e->dest->count < 0) | |
c22cacf3 | 2284 | e->dest->count = 0; |
224e770b | 2285 | if (e->dest->frequency < 0) |
c22cacf3 | 2286 | e->dest->frequency = 0; |
80c7a9eb | 2287 | } |
224e770b RH |
2288 | count += e->count; |
2289 | probability += e->probability; | |
2290 | remove_edge (e); | |
80c7a9eb | 2291 | } |
628f6a4e BE |
2292 | else |
2293 | ei_next (&ei); | |
80c7a9eb RH |
2294 | } |
2295 | ||
224e770b RH |
2296 | /* This is somewhat ugly: the call_expr expander often emits instructions |
2297 | after the sibcall (to perform the function return). These confuse the | |
12eff7b7 | 2298 | find_many_sub_basic_blocks code, so we need to get rid of these. */ |
224e770b | 2299 | last = NEXT_INSN (last); |
341c100f | 2300 | gcc_assert (BARRIER_P (last)); |
cea49550 RH |
2301 | |
2302 | *can_fallthru = false; | |
224e770b RH |
2303 | while (NEXT_INSN (last)) |
2304 | { | |
2305 | /* For instance an sqrt builtin expander expands if with | |
2306 | sibcall in the then and label for `else`. */ | |
2307 | if (LABEL_P (NEXT_INSN (last))) | |
cea49550 RH |
2308 | { |
2309 | *can_fallthru = true; | |
2310 | break; | |
2311 | } | |
224e770b RH |
2312 | delete_insn (NEXT_INSN (last)); |
2313 | } | |
2314 | ||
2315 | e = make_edge (bb, EXIT_BLOCK_PTR, EDGE_ABNORMAL | EDGE_SIBCALL); | |
2316 | e->probability += probability; | |
2317 | e->count += count; | |
2318 | BB_END (bb) = last; | |
2319 | update_bb_for_insn (bb); | |
2320 | ||
2321 | if (NEXT_INSN (last)) | |
2322 | { | |
2323 | bb = create_basic_block (NEXT_INSN (last), get_last_insn (), bb); | |
2324 | ||
2325 | last = BB_END (bb); | |
2326 | if (BARRIER_P (last)) | |
2327 | BB_END (bb) = PREV_INSN (last); | |
2328 | } | |
2329 | ||
726a989a | 2330 | maybe_dump_rtl_for_gimple_stmt (stmt, last2); |
b7211528 | 2331 | |
224e770b | 2332 | return bb; |
80c7a9eb RH |
2333 | } |
2334 | ||
b5b8b0ac AO |
2335 | /* Return the difference between the floor and the truncated result of |
2336 | a signed division by OP1 with remainder MOD. */ | |
2337 | static rtx | |
2338 | floor_sdiv_adjust (enum machine_mode mode, rtx mod, rtx op1) | |
2339 | { | |
2340 | /* (mod != 0 ? (op1 / mod < 0 ? -1 : 0) : 0) */ | |
2341 | return gen_rtx_IF_THEN_ELSE | |
2342 | (mode, gen_rtx_NE (BImode, mod, const0_rtx), | |
2343 | gen_rtx_IF_THEN_ELSE | |
2344 | (mode, gen_rtx_LT (BImode, | |
2345 | gen_rtx_DIV (mode, op1, mod), | |
2346 | const0_rtx), | |
2347 | constm1_rtx, const0_rtx), | |
2348 | const0_rtx); | |
2349 | } | |
2350 | ||
2351 | /* Return the difference between the ceil and the truncated result of | |
2352 | a signed division by OP1 with remainder MOD. */ | |
2353 | static rtx | |
2354 | ceil_sdiv_adjust (enum machine_mode mode, rtx mod, rtx op1) | |
2355 | { | |
2356 | /* (mod != 0 ? (op1 / mod > 0 ? 1 : 0) : 0) */ | |
2357 | return gen_rtx_IF_THEN_ELSE | |
2358 | (mode, gen_rtx_NE (BImode, mod, const0_rtx), | |
2359 | gen_rtx_IF_THEN_ELSE | |
2360 | (mode, gen_rtx_GT (BImode, | |
2361 | gen_rtx_DIV (mode, op1, mod), | |
2362 | const0_rtx), | |
2363 | const1_rtx, const0_rtx), | |
2364 | const0_rtx); | |
2365 | } | |
2366 | ||
2367 | /* Return the difference between the ceil and the truncated result of | |
2368 | an unsigned division by OP1 with remainder MOD. */ | |
2369 | static rtx | |
2370 | ceil_udiv_adjust (enum machine_mode mode, rtx mod, rtx op1 ATTRIBUTE_UNUSED) | |
2371 | { | |
2372 | /* (mod != 0 ? 1 : 0) */ | |
2373 | return gen_rtx_IF_THEN_ELSE | |
2374 | (mode, gen_rtx_NE (BImode, mod, const0_rtx), | |
2375 | const1_rtx, const0_rtx); | |
2376 | } | |
2377 | ||
2378 | /* Return the difference between the rounded and the truncated result | |
2379 | of a signed division by OP1 with remainder MOD. Halfway cases are | |
2380 | rounded away from zero, rather than to the nearest even number. */ | |
2381 | static rtx | |
2382 | round_sdiv_adjust (enum machine_mode mode, rtx mod, rtx op1) | |
2383 | { | |
2384 | /* (abs (mod) >= abs (op1) - abs (mod) | |
2385 | ? (op1 / mod > 0 ? 1 : -1) | |
2386 | : 0) */ | |
2387 | return gen_rtx_IF_THEN_ELSE | |
2388 | (mode, gen_rtx_GE (BImode, gen_rtx_ABS (mode, mod), | |
2389 | gen_rtx_MINUS (mode, | |
2390 | gen_rtx_ABS (mode, op1), | |
2391 | gen_rtx_ABS (mode, mod))), | |
2392 | gen_rtx_IF_THEN_ELSE | |
2393 | (mode, gen_rtx_GT (BImode, | |
2394 | gen_rtx_DIV (mode, op1, mod), | |
2395 | const0_rtx), | |
2396 | const1_rtx, constm1_rtx), | |
2397 | const0_rtx); | |
2398 | } | |
2399 | ||
2400 | /* Return the difference between the rounded and the truncated result | |
2401 | of a unsigned division by OP1 with remainder MOD. Halfway cases | |
2402 | are rounded away from zero, rather than to the nearest even | |
2403 | number. */ | |
2404 | static rtx | |
2405 | round_udiv_adjust (enum machine_mode mode, rtx mod, rtx op1) | |
2406 | { | |
2407 | /* (mod >= op1 - mod ? 1 : 0) */ | |
2408 | return gen_rtx_IF_THEN_ELSE | |
2409 | (mode, gen_rtx_GE (BImode, mod, | |
2410 | gen_rtx_MINUS (mode, op1, mod)), | |
2411 | const1_rtx, const0_rtx); | |
2412 | } | |
2413 | ||
dda2da58 AO |
2414 | /* Convert X to MODE, that must be Pmode or ptr_mode, without emitting |
2415 | any rtl. */ | |
2416 | ||
2417 | static rtx | |
f61c6f34 JJ |
2418 | convert_debug_memory_address (enum machine_mode mode, rtx x, |
2419 | addr_space_t as) | |
dda2da58 AO |
2420 | { |
2421 | enum machine_mode xmode = GET_MODE (x); | |
2422 | ||
2423 | #ifndef POINTERS_EXTEND_UNSIGNED | |
f61c6f34 JJ |
2424 | gcc_assert (mode == Pmode |
2425 | || mode == targetm.addr_space.address_mode (as)); | |
dda2da58 AO |
2426 | gcc_assert (xmode == mode || xmode == VOIDmode); |
2427 | #else | |
f61c6f34 | 2428 | rtx temp; |
f61c6f34 | 2429 | |
639d4bb8 | 2430 | gcc_assert (targetm.addr_space.valid_pointer_mode (mode, as)); |
dda2da58 AO |
2431 | |
2432 | if (GET_MODE (x) == mode || GET_MODE (x) == VOIDmode) | |
2433 | return x; | |
2434 | ||
69660a70 | 2435 | if (GET_MODE_PRECISION (mode) < GET_MODE_PRECISION (xmode)) |
dda2da58 AO |
2436 | x = simplify_gen_subreg (mode, x, xmode, |
2437 | subreg_lowpart_offset | |
2438 | (mode, xmode)); | |
2439 | else if (POINTERS_EXTEND_UNSIGNED > 0) | |
2440 | x = gen_rtx_ZERO_EXTEND (mode, x); | |
2441 | else if (!POINTERS_EXTEND_UNSIGNED) | |
2442 | x = gen_rtx_SIGN_EXTEND (mode, x); | |
2443 | else | |
f61c6f34 JJ |
2444 | { |
2445 | switch (GET_CODE (x)) | |
2446 | { | |
2447 | case SUBREG: | |
2448 | if ((SUBREG_PROMOTED_VAR_P (x) | |
2449 | || (REG_P (SUBREG_REG (x)) && REG_POINTER (SUBREG_REG (x))) | |
2450 | || (GET_CODE (SUBREG_REG (x)) == PLUS | |
2451 | && REG_P (XEXP (SUBREG_REG (x), 0)) | |
2452 | && REG_POINTER (XEXP (SUBREG_REG (x), 0)) | |
2453 | && CONST_INT_P (XEXP (SUBREG_REG (x), 1)))) | |
2454 | && GET_MODE (SUBREG_REG (x)) == mode) | |
2455 | return SUBREG_REG (x); | |
2456 | break; | |
2457 | case LABEL_REF: | |
2458 | temp = gen_rtx_LABEL_REF (mode, XEXP (x, 0)); | |
2459 | LABEL_REF_NONLOCAL_P (temp) = LABEL_REF_NONLOCAL_P (x); | |
2460 | return temp; | |
2461 | case SYMBOL_REF: | |
2462 | temp = shallow_copy_rtx (x); | |
2463 | PUT_MODE (temp, mode); | |
2464 | return temp; | |
2465 | case CONST: | |
2466 | temp = convert_debug_memory_address (mode, XEXP (x, 0), as); | |
2467 | if (temp) | |
2468 | temp = gen_rtx_CONST (mode, temp); | |
2469 | return temp; | |
2470 | case PLUS: | |
2471 | case MINUS: | |
2472 | if (CONST_INT_P (XEXP (x, 1))) | |
2473 | { | |
2474 | temp = convert_debug_memory_address (mode, XEXP (x, 0), as); | |
2475 | if (temp) | |
2476 | return gen_rtx_fmt_ee (GET_CODE (x), mode, temp, XEXP (x, 1)); | |
2477 | } | |
2478 | break; | |
2479 | default: | |
2480 | break; | |
2481 | } | |
2482 | /* Don't know how to express ptr_extend as operation in debug info. */ | |
2483 | return NULL; | |
2484 | } | |
dda2da58 AO |
2485 | #endif /* POINTERS_EXTEND_UNSIGNED */ |
2486 | ||
2487 | return x; | |
2488 | } | |
2489 | ||
12c5ffe5 EB |
2490 | /* Return an RTX equivalent to the value of the parameter DECL. */ |
2491 | ||
2492 | static rtx | |
2493 | expand_debug_parm_decl (tree decl) | |
2494 | { | |
2495 | rtx incoming = DECL_INCOMING_RTL (decl); | |
2496 | ||
2497 | if (incoming | |
2498 | && GET_MODE (incoming) != BLKmode | |
2499 | && ((REG_P (incoming) && HARD_REGISTER_P (incoming)) | |
2500 | || (MEM_P (incoming) | |
2501 | && REG_P (XEXP (incoming, 0)) | |
2502 | && HARD_REGISTER_P (XEXP (incoming, 0))))) | |
2503 | { | |
2504 | rtx rtl = gen_rtx_ENTRY_VALUE (GET_MODE (incoming)); | |
2505 | ||
2506 | #ifdef HAVE_window_save | |
2507 | /* DECL_INCOMING_RTL uses the INCOMING_REGNO of parameter registers. | |
2508 | If the target machine has an explicit window save instruction, the | |
2509 | actual entry value is the corresponding OUTGOING_REGNO instead. */ | |
2510 | if (REG_P (incoming) | |
2511 | && OUTGOING_REGNO (REGNO (incoming)) != REGNO (incoming)) | |
2512 | incoming | |
2513 | = gen_rtx_REG_offset (incoming, GET_MODE (incoming), | |
2514 | OUTGOING_REGNO (REGNO (incoming)), 0); | |
2515 | else if (MEM_P (incoming)) | |
2516 | { | |
2517 | rtx reg = XEXP (incoming, 0); | |
2518 | if (OUTGOING_REGNO (REGNO (reg)) != REGNO (reg)) | |
2519 | { | |
2520 | reg = gen_raw_REG (GET_MODE (reg), OUTGOING_REGNO (REGNO (reg))); | |
2521 | incoming = replace_equiv_address_nv (incoming, reg); | |
2522 | } | |
2523 | } | |
2524 | #endif | |
2525 | ||
2526 | ENTRY_VALUE_EXP (rtl) = incoming; | |
2527 | return rtl; | |
2528 | } | |
2529 | ||
2530 | if (incoming | |
2531 | && GET_MODE (incoming) != BLKmode | |
2532 | && !TREE_ADDRESSABLE (decl) | |
2533 | && MEM_P (incoming) | |
2534 | && (XEXP (incoming, 0) == virtual_incoming_args_rtx | |
2535 | || (GET_CODE (XEXP (incoming, 0)) == PLUS | |
2536 | && XEXP (XEXP (incoming, 0), 0) == virtual_incoming_args_rtx | |
2537 | && CONST_INT_P (XEXP (XEXP (incoming, 0), 1))))) | |
2538 | return incoming; | |
2539 | ||
2540 | return NULL_RTX; | |
2541 | } | |
2542 | ||
2543 | /* Return an RTX equivalent to the value of the tree expression EXP. */ | |
b5b8b0ac AO |
2544 | |
2545 | static rtx | |
2546 | expand_debug_expr (tree exp) | |
2547 | { | |
2548 | rtx op0 = NULL_RTX, op1 = NULL_RTX, op2 = NULL_RTX; | |
2549 | enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp)); | |
2ba172e0 | 2550 | enum machine_mode inner_mode = VOIDmode; |
b5b8b0ac | 2551 | int unsignedp = TYPE_UNSIGNED (TREE_TYPE (exp)); |
09e881c9 | 2552 | addr_space_t as; |
b5b8b0ac AO |
2553 | |
2554 | switch (TREE_CODE_CLASS (TREE_CODE (exp))) | |
2555 | { | |
2556 | case tcc_expression: | |
2557 | switch (TREE_CODE (exp)) | |
2558 | { | |
2559 | case COND_EXPR: | |
7ece48b1 | 2560 | case DOT_PROD_EXPR: |
0354c0c7 BS |
2561 | case WIDEN_MULT_PLUS_EXPR: |
2562 | case WIDEN_MULT_MINUS_EXPR: | |
0f59b812 | 2563 | case FMA_EXPR: |
b5b8b0ac AO |
2564 | goto ternary; |
2565 | ||
2566 | case TRUTH_ANDIF_EXPR: | |
2567 | case TRUTH_ORIF_EXPR: | |
2568 | case TRUTH_AND_EXPR: | |
2569 | case TRUTH_OR_EXPR: | |
2570 | case TRUTH_XOR_EXPR: | |
2571 | goto binary; | |
2572 | ||
2573 | case TRUTH_NOT_EXPR: | |
2574 | goto unary; | |
2575 | ||
2576 | default: | |
2577 | break; | |
2578 | } | |
2579 | break; | |
2580 | ||
2581 | ternary: | |
2582 | op2 = expand_debug_expr (TREE_OPERAND (exp, 2)); | |
2583 | if (!op2) | |
2584 | return NULL_RTX; | |
2585 | /* Fall through. */ | |
2586 | ||
2587 | binary: | |
2588 | case tcc_binary: | |
2589 | case tcc_comparison: | |
2590 | op1 = expand_debug_expr (TREE_OPERAND (exp, 1)); | |
2591 | if (!op1) | |
2592 | return NULL_RTX; | |
2593 | /* Fall through. */ | |
2594 | ||
2595 | unary: | |
2596 | case tcc_unary: | |
2ba172e0 | 2597 | inner_mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))); |
b5b8b0ac AO |
2598 | op0 = expand_debug_expr (TREE_OPERAND (exp, 0)); |
2599 | if (!op0) | |
2600 | return NULL_RTX; | |
2601 | break; | |
2602 | ||
2603 | case tcc_type: | |
2604 | case tcc_statement: | |
2605 | gcc_unreachable (); | |
2606 | ||
2607 | case tcc_constant: | |
2608 | case tcc_exceptional: | |
2609 | case tcc_declaration: | |
2610 | case tcc_reference: | |
2611 | case tcc_vl_exp: | |
2612 | break; | |
2613 | } | |
2614 | ||
2615 | switch (TREE_CODE (exp)) | |
2616 | { | |
2617 | case STRING_CST: | |
2618 | if (!lookup_constant_def (exp)) | |
2619 | { | |
e1b243a8 JJ |
2620 | if (strlen (TREE_STRING_POINTER (exp)) + 1 |
2621 | != (size_t) TREE_STRING_LENGTH (exp)) | |
2622 | return NULL_RTX; | |
b5b8b0ac AO |
2623 | op0 = gen_rtx_CONST_STRING (Pmode, TREE_STRING_POINTER (exp)); |
2624 | op0 = gen_rtx_MEM (BLKmode, op0); | |
2625 | set_mem_attributes (op0, exp, 0); | |
2626 | return op0; | |
2627 | } | |
2628 | /* Fall through... */ | |
2629 | ||
2630 | case INTEGER_CST: | |
2631 | case REAL_CST: | |
2632 | case FIXED_CST: | |
2633 | op0 = expand_expr (exp, NULL_RTX, mode, EXPAND_INITIALIZER); | |
2634 | return op0; | |
2635 | ||
2636 | case COMPLEX_CST: | |
2637 | gcc_assert (COMPLEX_MODE_P (mode)); | |
2638 | op0 = expand_debug_expr (TREE_REALPART (exp)); | |
b5b8b0ac | 2639 | op1 = expand_debug_expr (TREE_IMAGPART (exp)); |
b5b8b0ac AO |
2640 | return gen_rtx_CONCAT (mode, op0, op1); |
2641 | ||
0ca5af51 AO |
2642 | case DEBUG_EXPR_DECL: |
2643 | op0 = DECL_RTL_IF_SET (exp); | |
2644 | ||
2645 | if (op0) | |
2646 | return op0; | |
2647 | ||
2648 | op0 = gen_rtx_DEBUG_EXPR (mode); | |
e4fb38bd | 2649 | DEBUG_EXPR_TREE_DECL (op0) = exp; |
0ca5af51 AO |
2650 | SET_DECL_RTL (exp, op0); |
2651 | ||
2652 | return op0; | |
2653 | ||
b5b8b0ac AO |
2654 | case VAR_DECL: |
2655 | case PARM_DECL: | |
2656 | case FUNCTION_DECL: | |
2657 | case LABEL_DECL: | |
2658 | case CONST_DECL: | |
2659 | case RESULT_DECL: | |
2660 | op0 = DECL_RTL_IF_SET (exp); | |
2661 | ||
2662 | /* This decl was probably optimized away. */ | |
2663 | if (!op0) | |
e1b243a8 JJ |
2664 | { |
2665 | if (TREE_CODE (exp) != VAR_DECL | |
2666 | || DECL_EXTERNAL (exp) | |
2667 | || !TREE_STATIC (exp) | |
2668 | || !DECL_NAME (exp) | |
0fba566c | 2669 | || DECL_HARD_REGISTER (exp) |
7d5fc814 | 2670 | || DECL_IN_CONSTANT_POOL (exp) |
0fba566c | 2671 | || mode == VOIDmode) |
e1b243a8 JJ |
2672 | return NULL; |
2673 | ||
b1aa0655 | 2674 | op0 = make_decl_rtl_for_debug (exp); |
e1b243a8 JJ |
2675 | if (!MEM_P (op0) |
2676 | || GET_CODE (XEXP (op0, 0)) != SYMBOL_REF | |
2677 | || SYMBOL_REF_DECL (XEXP (op0, 0)) != exp) | |
2678 | return NULL; | |
2679 | } | |
2680 | else | |
2681 | op0 = copy_rtx (op0); | |
b5b8b0ac | 2682 | |
06796564 JJ |
2683 | if (GET_MODE (op0) == BLKmode |
2684 | /* If op0 is not BLKmode, but BLKmode is, adjust_mode | |
2685 | below would ICE. While it is likely a FE bug, | |
2686 | try to be robust here. See PR43166. */ | |
132b4e82 JJ |
2687 | || mode == BLKmode |
2688 | || (mode == VOIDmode && GET_MODE (op0) != VOIDmode)) | |
b5b8b0ac AO |
2689 | { |
2690 | gcc_assert (MEM_P (op0)); | |
2691 | op0 = adjust_address_nv (op0, mode, 0); | |
2692 | return op0; | |
2693 | } | |
2694 | ||
2695 | /* Fall through. */ | |
2696 | ||
2697 | adjust_mode: | |
2698 | case PAREN_EXPR: | |
2699 | case NOP_EXPR: | |
2700 | case CONVERT_EXPR: | |
2701 | { | |
2ba172e0 | 2702 | inner_mode = GET_MODE (op0); |
b5b8b0ac AO |
2703 | |
2704 | if (mode == inner_mode) | |
2705 | return op0; | |
2706 | ||
2707 | if (inner_mode == VOIDmode) | |
2708 | { | |
2a8e30fb MM |
2709 | if (TREE_CODE (exp) == SSA_NAME) |
2710 | inner_mode = TYPE_MODE (TREE_TYPE (exp)); | |
2711 | else | |
2712 | inner_mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))); | |
b5b8b0ac AO |
2713 | if (mode == inner_mode) |
2714 | return op0; | |
2715 | } | |
2716 | ||
2717 | if (FLOAT_MODE_P (mode) && FLOAT_MODE_P (inner_mode)) | |
2718 | { | |
2719 | if (GET_MODE_BITSIZE (mode) == GET_MODE_BITSIZE (inner_mode)) | |
2720 | op0 = simplify_gen_subreg (mode, op0, inner_mode, 0); | |
2721 | else if (GET_MODE_BITSIZE (mode) < GET_MODE_BITSIZE (inner_mode)) | |
2722 | op0 = simplify_gen_unary (FLOAT_TRUNCATE, mode, op0, inner_mode); | |
2723 | else | |
2724 | op0 = simplify_gen_unary (FLOAT_EXTEND, mode, op0, inner_mode); | |
2725 | } | |
2726 | else if (FLOAT_MODE_P (mode)) | |
2727 | { | |
2a8e30fb | 2728 | gcc_assert (TREE_CODE (exp) != SSA_NAME); |
b5b8b0ac AO |
2729 | if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0)))) |
2730 | op0 = simplify_gen_unary (UNSIGNED_FLOAT, mode, op0, inner_mode); | |
2731 | else | |
2732 | op0 = simplify_gen_unary (FLOAT, mode, op0, inner_mode); | |
2733 | } | |
2734 | else if (FLOAT_MODE_P (inner_mode)) | |
2735 | { | |
2736 | if (unsignedp) | |
2737 | op0 = simplify_gen_unary (UNSIGNED_FIX, mode, op0, inner_mode); | |
2738 | else | |
2739 | op0 = simplify_gen_unary (FIX, mode, op0, inner_mode); | |
2740 | } | |
2741 | else if (CONSTANT_P (op0) | |
69660a70 | 2742 | || GET_MODE_PRECISION (mode) <= GET_MODE_PRECISION (inner_mode)) |
b5b8b0ac AO |
2743 | op0 = simplify_gen_subreg (mode, op0, inner_mode, |
2744 | subreg_lowpart_offset (mode, | |
2745 | inner_mode)); | |
1b47fe3f JJ |
2746 | else if (TREE_CODE_CLASS (TREE_CODE (exp)) == tcc_unary |
2747 | ? TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))) | |
2748 | : unsignedp) | |
2ba172e0 | 2749 | op0 = simplify_gen_unary (ZERO_EXTEND, mode, op0, inner_mode); |
b5b8b0ac | 2750 | else |
2ba172e0 | 2751 | op0 = simplify_gen_unary (SIGN_EXTEND, mode, op0, inner_mode); |
b5b8b0ac AO |
2752 | |
2753 | return op0; | |
2754 | } | |
2755 | ||
70f34814 | 2756 | case MEM_REF: |
71f3a3f5 JJ |
2757 | if (!is_gimple_mem_ref_addr (TREE_OPERAND (exp, 0))) |
2758 | { | |
2759 | tree newexp = fold_binary (MEM_REF, TREE_TYPE (exp), | |
2760 | TREE_OPERAND (exp, 0), | |
2761 | TREE_OPERAND (exp, 1)); | |
2762 | if (newexp) | |
2763 | return expand_debug_expr (newexp); | |
2764 | } | |
2765 | /* FALLTHROUGH */ | |
b5b8b0ac | 2766 | case INDIRECT_REF: |
0a81f074 | 2767 | inner_mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))); |
b5b8b0ac AO |
2768 | op0 = expand_debug_expr (TREE_OPERAND (exp, 0)); |
2769 | if (!op0) | |
2770 | return NULL; | |
2771 | ||
cb115041 JJ |
2772 | if (TREE_CODE (exp) == MEM_REF) |
2773 | { | |
583ac69c JJ |
2774 | if (GET_CODE (op0) == DEBUG_IMPLICIT_PTR |
2775 | || (GET_CODE (op0) == PLUS | |
2776 | && GET_CODE (XEXP (op0, 0)) == DEBUG_IMPLICIT_PTR)) | |
2777 | /* (mem (debug_implicit_ptr)) might confuse aliasing. | |
2778 | Instead just use get_inner_reference. */ | |
2779 | goto component_ref; | |
2780 | ||
cb115041 JJ |
2781 | op1 = expand_debug_expr (TREE_OPERAND (exp, 1)); |
2782 | if (!op1 || !CONST_INT_P (op1)) | |
2783 | return NULL; | |
2784 | ||
0a81f074 | 2785 | op0 = plus_constant (inner_mode, op0, INTVAL (op1)); |
cb115041 JJ |
2786 | } |
2787 | ||
09e881c9 | 2788 | if (POINTER_TYPE_P (TREE_TYPE (exp))) |
75421dcd | 2789 | as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp))); |
09e881c9 | 2790 | else |
75421dcd | 2791 | as = ADDR_SPACE_GENERIC; |
b5b8b0ac | 2792 | |
f61c6f34 JJ |
2793 | op0 = convert_debug_memory_address (targetm.addr_space.address_mode (as), |
2794 | op0, as); | |
2795 | if (op0 == NULL_RTX) | |
2796 | return NULL; | |
b5b8b0ac | 2797 | |
f61c6f34 | 2798 | op0 = gen_rtx_MEM (mode, op0); |
b5b8b0ac | 2799 | set_mem_attributes (op0, exp, 0); |
71f3a3f5 JJ |
2800 | if (TREE_CODE (exp) == MEM_REF |
2801 | && !is_gimple_mem_ref_addr (TREE_OPERAND (exp, 0))) | |
2802 | set_mem_expr (op0, NULL_TREE); | |
09e881c9 | 2803 | set_mem_addr_space (op0, as); |
b5b8b0ac AO |
2804 | |
2805 | return op0; | |
2806 | ||
2807 | case TARGET_MEM_REF: | |
4d948885 RG |
2808 | if (TREE_CODE (TMR_BASE (exp)) == ADDR_EXPR |
2809 | && !DECL_RTL_SET_P (TREE_OPERAND (TMR_BASE (exp), 0))) | |
b5b8b0ac AO |
2810 | return NULL; |
2811 | ||
2812 | op0 = expand_debug_expr | |
4e25ca6b | 2813 | (tree_mem_ref_addr (build_pointer_type (TREE_TYPE (exp)), exp)); |
b5b8b0ac AO |
2814 | if (!op0) |
2815 | return NULL; | |
2816 | ||
f61c6f34 JJ |
2817 | if (POINTER_TYPE_P (TREE_TYPE (exp))) |
2818 | as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp))); | |
2819 | else | |
2820 | as = ADDR_SPACE_GENERIC; | |
2821 | ||
2822 | op0 = convert_debug_memory_address (targetm.addr_space.address_mode (as), | |
2823 | op0, as); | |
2824 | if (op0 == NULL_RTX) | |
2825 | return NULL; | |
b5b8b0ac AO |
2826 | |
2827 | op0 = gen_rtx_MEM (mode, op0); | |
2828 | ||
2829 | set_mem_attributes (op0, exp, 0); | |
09e881c9 | 2830 | set_mem_addr_space (op0, as); |
b5b8b0ac AO |
2831 | |
2832 | return op0; | |
2833 | ||
583ac69c | 2834 | component_ref: |
b5b8b0ac AO |
2835 | case ARRAY_REF: |
2836 | case ARRAY_RANGE_REF: | |
2837 | case COMPONENT_REF: | |
2838 | case BIT_FIELD_REF: | |
2839 | case REALPART_EXPR: | |
2840 | case IMAGPART_EXPR: | |
2841 | case VIEW_CONVERT_EXPR: | |
2842 | { | |
2843 | enum machine_mode mode1; | |
2844 | HOST_WIDE_INT bitsize, bitpos; | |
2845 | tree offset; | |
2846 | int volatilep = 0; | |
2847 | tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset, | |
2848 | &mode1, &unsignedp, &volatilep, false); | |
2849 | rtx orig_op0; | |
2850 | ||
4f2a9af8 JJ |
2851 | if (bitsize == 0) |
2852 | return NULL; | |
2853 | ||
b5b8b0ac AO |
2854 | orig_op0 = op0 = expand_debug_expr (tem); |
2855 | ||
2856 | if (!op0) | |
2857 | return NULL; | |
2858 | ||
2859 | if (offset) | |
2860 | { | |
dda2da58 AO |
2861 | enum machine_mode addrmode, offmode; |
2862 | ||
aa847cc8 JJ |
2863 | if (!MEM_P (op0)) |
2864 | return NULL; | |
b5b8b0ac | 2865 | |
dda2da58 AO |
2866 | op0 = XEXP (op0, 0); |
2867 | addrmode = GET_MODE (op0); | |
2868 | if (addrmode == VOIDmode) | |
2869 | addrmode = Pmode; | |
2870 | ||
b5b8b0ac AO |
2871 | op1 = expand_debug_expr (offset); |
2872 | if (!op1) | |
2873 | return NULL; | |
2874 | ||
dda2da58 AO |
2875 | offmode = GET_MODE (op1); |
2876 | if (offmode == VOIDmode) | |
2877 | offmode = TYPE_MODE (TREE_TYPE (offset)); | |
2878 | ||
2879 | if (addrmode != offmode) | |
2880 | op1 = simplify_gen_subreg (addrmode, op1, offmode, | |
2881 | subreg_lowpart_offset (addrmode, | |
2882 | offmode)); | |
2883 | ||
2884 | /* Don't use offset_address here, we don't need a | |
2885 | recognizable address, and we don't want to generate | |
2886 | code. */ | |
2ba172e0 JJ |
2887 | op0 = gen_rtx_MEM (mode, simplify_gen_binary (PLUS, addrmode, |
2888 | op0, op1)); | |
b5b8b0ac AO |
2889 | } |
2890 | ||
2891 | if (MEM_P (op0)) | |
2892 | { | |
4f2a9af8 JJ |
2893 | if (mode1 == VOIDmode) |
2894 | /* Bitfield. */ | |
2895 | mode1 = smallest_mode_for_size (bitsize, MODE_INT); | |
b5b8b0ac AO |
2896 | if (bitpos >= BITS_PER_UNIT) |
2897 | { | |
2898 | op0 = adjust_address_nv (op0, mode1, bitpos / BITS_PER_UNIT); | |
2899 | bitpos %= BITS_PER_UNIT; | |
2900 | } | |
2901 | else if (bitpos < 0) | |
2902 | { | |
4f2a9af8 JJ |
2903 | HOST_WIDE_INT units |
2904 | = (-bitpos + BITS_PER_UNIT - 1) / BITS_PER_UNIT; | |
b5b8b0ac AO |
2905 | op0 = adjust_address_nv (op0, mode1, units); |
2906 | bitpos += units * BITS_PER_UNIT; | |
2907 | } | |
2908 | else if (bitpos == 0 && bitsize == GET_MODE_BITSIZE (mode)) | |
2909 | op0 = adjust_address_nv (op0, mode, 0); | |
2910 | else if (GET_MODE (op0) != mode1) | |
2911 | op0 = adjust_address_nv (op0, mode1, 0); | |
2912 | else | |
2913 | op0 = copy_rtx (op0); | |
2914 | if (op0 == orig_op0) | |
2915 | op0 = shallow_copy_rtx (op0); | |
2916 | set_mem_attributes (op0, exp, 0); | |
2917 | } | |
2918 | ||
2919 | if (bitpos == 0 && mode == GET_MODE (op0)) | |
2920 | return op0; | |
2921 | ||
2d3fc6aa JJ |
2922 | if (bitpos < 0) |
2923 | return NULL; | |
2924 | ||
88c04a5d JJ |
2925 | if (GET_MODE (op0) == BLKmode) |
2926 | return NULL; | |
2927 | ||
b5b8b0ac AO |
2928 | if ((bitpos % BITS_PER_UNIT) == 0 |
2929 | && bitsize == GET_MODE_BITSIZE (mode1)) | |
2930 | { | |
2931 | enum machine_mode opmode = GET_MODE (op0); | |
2932 | ||
b5b8b0ac | 2933 | if (opmode == VOIDmode) |
9712cba0 | 2934 | opmode = TYPE_MODE (TREE_TYPE (tem)); |
b5b8b0ac AO |
2935 | |
2936 | /* This condition may hold if we're expanding the address | |
2937 | right past the end of an array that turned out not to | |
2938 | be addressable (i.e., the address was only computed in | |
2939 | debug stmts). The gen_subreg below would rightfully | |
2940 | crash, and the address doesn't really exist, so just | |
2941 | drop it. */ | |
2942 | if (bitpos >= GET_MODE_BITSIZE (opmode)) | |
2943 | return NULL; | |
2944 | ||
7d5d39bb JJ |
2945 | if ((bitpos % GET_MODE_BITSIZE (mode)) == 0) |
2946 | return simplify_gen_subreg (mode, op0, opmode, | |
2947 | bitpos / BITS_PER_UNIT); | |
b5b8b0ac AO |
2948 | } |
2949 | ||
2950 | return simplify_gen_ternary (SCALAR_INT_MODE_P (GET_MODE (op0)) | |
2951 | && TYPE_UNSIGNED (TREE_TYPE (exp)) | |
2952 | ? SIGN_EXTRACT | |
2953 | : ZERO_EXTRACT, mode, | |
2954 | GET_MODE (op0) != VOIDmode | |
9712cba0 JJ |
2955 | ? GET_MODE (op0) |
2956 | : TYPE_MODE (TREE_TYPE (tem)), | |
b5b8b0ac AO |
2957 | op0, GEN_INT (bitsize), GEN_INT (bitpos)); |
2958 | } | |
2959 | ||
b5b8b0ac | 2960 | case ABS_EXPR: |
2ba172e0 | 2961 | return simplify_gen_unary (ABS, mode, op0, mode); |
b5b8b0ac AO |
2962 | |
2963 | case NEGATE_EXPR: | |
2ba172e0 | 2964 | return simplify_gen_unary (NEG, mode, op0, mode); |
b5b8b0ac AO |
2965 | |
2966 | case BIT_NOT_EXPR: | |
2ba172e0 | 2967 | return simplify_gen_unary (NOT, mode, op0, mode); |
b5b8b0ac AO |
2968 | |
2969 | case FLOAT_EXPR: | |
2ba172e0 JJ |
2970 | return simplify_gen_unary (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, |
2971 | 0))) | |
2972 | ? UNSIGNED_FLOAT : FLOAT, mode, op0, | |
2973 | inner_mode); | |
b5b8b0ac AO |
2974 | |
2975 | case FIX_TRUNC_EXPR: | |
2ba172e0 JJ |
2976 | return simplify_gen_unary (unsignedp ? UNSIGNED_FIX : FIX, mode, op0, |
2977 | inner_mode); | |
b5b8b0ac AO |
2978 | |
2979 | case POINTER_PLUS_EXPR: | |
576319a7 DD |
2980 | /* For the rare target where pointers are not the same size as |
2981 | size_t, we need to check for mis-matched modes and correct | |
2982 | the addend. */ | |
2983 | if (op0 && op1 | |
2984 | && GET_MODE (op0) != VOIDmode && GET_MODE (op1) != VOIDmode | |
2985 | && GET_MODE (op0) != GET_MODE (op1)) | |
2986 | { | |
2987 | if (GET_MODE_BITSIZE (GET_MODE (op0)) < GET_MODE_BITSIZE (GET_MODE (op1))) | |
2ba172e0 JJ |
2988 | op1 = simplify_gen_unary (TRUNCATE, GET_MODE (op0), op1, |
2989 | GET_MODE (op1)); | |
576319a7 DD |
2990 | else |
2991 | /* We always sign-extend, regardless of the signedness of | |
2992 | the operand, because the operand is always unsigned | |
2993 | here even if the original C expression is signed. */ | |
2ba172e0 JJ |
2994 | op1 = simplify_gen_unary (SIGN_EXTEND, GET_MODE (op0), op1, |
2995 | GET_MODE (op1)); | |
576319a7 DD |
2996 | } |
2997 | /* Fall through. */ | |
b5b8b0ac | 2998 | case PLUS_EXPR: |
2ba172e0 | 2999 | return simplify_gen_binary (PLUS, mode, op0, op1); |
b5b8b0ac AO |
3000 | |
3001 | case MINUS_EXPR: | |
2ba172e0 | 3002 | return simplify_gen_binary (MINUS, mode, op0, op1); |
b5b8b0ac AO |
3003 | |
3004 | case MULT_EXPR: | |
2ba172e0 | 3005 | return simplify_gen_binary (MULT, mode, op0, op1); |
b5b8b0ac AO |
3006 | |
3007 | case RDIV_EXPR: | |
3008 | case TRUNC_DIV_EXPR: | |
3009 | case EXACT_DIV_EXPR: | |
3010 | if (unsignedp) | |
2ba172e0 | 3011 | return simplify_gen_binary (UDIV, mode, op0, op1); |
b5b8b0ac | 3012 | else |
2ba172e0 | 3013 | return simplify_gen_binary (DIV, mode, op0, op1); |
b5b8b0ac AO |
3014 | |
3015 | case TRUNC_MOD_EXPR: | |
2ba172e0 | 3016 | return simplify_gen_binary (unsignedp ? UMOD : MOD, mode, op0, op1); |
b5b8b0ac AO |
3017 | |
3018 | case FLOOR_DIV_EXPR: | |
3019 | if (unsignedp) | |
2ba172e0 | 3020 | return simplify_gen_binary (UDIV, mode, op0, op1); |
b5b8b0ac AO |
3021 | else |
3022 | { | |
2ba172e0 JJ |
3023 | rtx div = simplify_gen_binary (DIV, mode, op0, op1); |
3024 | rtx mod = simplify_gen_binary (MOD, mode, op0, op1); | |
b5b8b0ac | 3025 | rtx adj = floor_sdiv_adjust (mode, mod, op1); |
2ba172e0 | 3026 | return simplify_gen_binary (PLUS, mode, div, adj); |
b5b8b0ac AO |
3027 | } |
3028 | ||
3029 | case FLOOR_MOD_EXPR: | |
3030 | if (unsignedp) | |
2ba172e0 | 3031 | return simplify_gen_binary (UMOD, mode, op0, op1); |
b5b8b0ac AO |
3032 | else |
3033 | { | |
2ba172e0 | 3034 | rtx mod = simplify_gen_binary (MOD, mode, op0, op1); |
b5b8b0ac | 3035 | rtx adj = floor_sdiv_adjust (mode, mod, op1); |
2ba172e0 JJ |
3036 | adj = simplify_gen_unary (NEG, mode, |
3037 | simplify_gen_binary (MULT, mode, adj, op1), | |
3038 | mode); | |
3039 | return simplify_gen_binary (PLUS, mode, mod, adj); | |
b5b8b0ac AO |
3040 | } |
3041 | ||
3042 | case CEIL_DIV_EXPR: | |
3043 | if (unsignedp) | |
3044 | { | |
2ba172e0 JJ |
3045 | rtx div = simplify_gen_binary (UDIV, mode, op0, op1); |
3046 | rtx mod = simplify_gen_binary (UMOD, mode, op0, op1); | |
b5b8b0ac | 3047 | rtx adj = ceil_udiv_adjust (mode, mod, op1); |
2ba172e0 | 3048 | return simplify_gen_binary (PLUS, mode, div, adj); |
b5b8b0ac AO |
3049 | } |
3050 | else | |
3051 | { | |
2ba172e0 JJ |
3052 | rtx div = simplify_gen_binary (DIV, mode, op0, op1); |
3053 | rtx mod = simplify_gen_binary (MOD, mode, op0, op1); | |
b5b8b0ac | 3054 | rtx adj = ceil_sdiv_adjust (mode, mod, op1); |
2ba172e0 | 3055 | return simplify_gen_binary (PLUS, mode, div, adj); |
b5b8b0ac AO |
3056 | } |
3057 | ||
3058 | case CEIL_MOD_EXPR: | |
3059 | if (unsignedp) | |
3060 | { | |
2ba172e0 | 3061 | rtx mod = simplify_gen_binary (UMOD, mode, op0, op1); |
b5b8b0ac | 3062 | rtx adj = ceil_udiv_adjust (mode, mod, op1); |
2ba172e0 JJ |
3063 | adj = simplify_gen_unary (NEG, mode, |
3064 | simplify_gen_binary (MULT, mode, adj, op1), | |
3065 | mode); | |
3066 | return simplify_gen_binary (PLUS, mode, mod, adj); | |
b5b8b0ac AO |
3067 | } |
3068 | else | |
3069 | { | |
2ba172e0 | 3070 | rtx mod = simplify_gen_binary (MOD, mode, op0, op1); |
b5b8b0ac | 3071 | rtx adj = ceil_sdiv_adjust (mode, mod, op1); |
2ba172e0 JJ |
3072 | adj = simplify_gen_unary (NEG, mode, |
3073 | simplify_gen_binary (MULT, mode, adj, op1), | |
3074 | mode); | |
3075 | return simplify_gen_binary (PLUS, mode, mod, adj); | |
b5b8b0ac AO |
3076 | } |
3077 | ||
3078 | case ROUND_DIV_EXPR: | |
3079 | if (unsignedp) | |
3080 | { | |
2ba172e0 JJ |
3081 | rtx div = simplify_gen_binary (UDIV, mode, op0, op1); |
3082 | rtx mod = simplify_gen_binary (UMOD, mode, op0, op1); | |
b5b8b0ac | 3083 | rtx adj = round_udiv_adjust (mode, mod, op1); |
2ba172e0 | 3084 | return simplify_gen_binary (PLUS, mode, div, adj); |
b5b8b0ac AO |
3085 | } |
3086 | else | |
3087 | { | |
2ba172e0 JJ |
3088 | rtx div = simplify_gen_binary (DIV, mode, op0, op1); |
3089 | rtx mod = simplify_gen_binary (MOD, mode, op0, op1); | |
b5b8b0ac | 3090 | rtx adj = round_sdiv_adjust (mode, mod, op1); |
2ba172e0 | 3091 | return simplify_gen_binary (PLUS, mode, div, adj); |
b5b8b0ac AO |
3092 | } |
3093 | ||
3094 | case ROUND_MOD_EXPR: | |
3095 | if (unsignedp) | |
3096 | { | |
2ba172e0 | 3097 | rtx mod = simplify_gen_binary (UMOD, mode, op0, op1); |
b5b8b0ac | 3098 | rtx adj = round_udiv_adjust (mode, mod, op1); |
2ba172e0 JJ |
3099 | adj = simplify_gen_unary (NEG, mode, |
3100 | simplify_gen_binary (MULT, mode, adj, op1), | |
3101 | mode); | |
3102 | return simplify_gen_binary (PLUS, mode, mod, adj); | |
b5b8b0ac AO |
3103 | } |
3104 | else | |
3105 | { | |
2ba172e0 | 3106 | rtx mod = simplify_gen_binary (MOD, mode, op0, op1); |
b5b8b0ac | 3107 | rtx adj = round_sdiv_adjust (mode, mod, op1); |
2ba172e0 JJ |
3108 | adj = simplify_gen_unary (NEG, mode, |
3109 | simplify_gen_binary (MULT, mode, adj, op1), | |
3110 | mode); | |
3111 | return simplify_gen_binary (PLUS, mode, mod, adj); | |
b5b8b0ac AO |
3112 | } |
3113 | ||
3114 | case LSHIFT_EXPR: | |
2ba172e0 | 3115 | return simplify_gen_binary (ASHIFT, mode, op0, op1); |
b5b8b0ac AO |
3116 | |
3117 | case RSHIFT_EXPR: | |
3118 | if (unsignedp) | |
2ba172e0 | 3119 | return simplify_gen_binary (LSHIFTRT, mode, op0, op1); |
b5b8b0ac | 3120 | else |
2ba172e0 | 3121 | return simplify_gen_binary (ASHIFTRT, mode, op0, op1); |
b5b8b0ac AO |
3122 | |
3123 | case LROTATE_EXPR: | |
2ba172e0 | 3124 | return simplify_gen_binary (ROTATE, mode, op0, op1); |
b5b8b0ac AO |
3125 | |
3126 | case RROTATE_EXPR: | |
2ba172e0 | 3127 | return simplify_gen_binary (ROTATERT, mode, op0, op1); |
b5b8b0ac AO |
3128 | |
3129 | case MIN_EXPR: | |
2ba172e0 | 3130 | return simplify_gen_binary (unsignedp ? UMIN : SMIN, mode, op0, op1); |
b5b8b0ac AO |
3131 | |
3132 | case MAX_EXPR: | |
2ba172e0 | 3133 | return simplify_gen_binary (unsignedp ? UMAX : SMAX, mode, op0, op1); |
b5b8b0ac AO |
3134 | |
3135 | case BIT_AND_EXPR: | |
3136 | case TRUTH_AND_EXPR: | |
2ba172e0 | 3137 | return simplify_gen_binary (AND, mode, op0, op1); |
b5b8b0ac AO |
3138 | |
3139 | case BIT_IOR_EXPR: | |
3140 | case TRUTH_OR_EXPR: | |
2ba172e0 | 3141 | return simplify_gen_binary (IOR, mode, op0, op1); |
b5b8b0ac AO |
3142 | |
3143 | case BIT_XOR_EXPR: | |
3144 | case TRUTH_XOR_EXPR: | |
2ba172e0 | 3145 | return simplify_gen_binary (XOR, mode, op0, op1); |
b5b8b0ac AO |
3146 | |
3147 | case TRUTH_ANDIF_EXPR: | |
3148 | return gen_rtx_IF_THEN_ELSE (mode, op0, op1, const0_rtx); | |
3149 | ||
3150 | case TRUTH_ORIF_EXPR: | |
3151 | return gen_rtx_IF_THEN_ELSE (mode, op0, const_true_rtx, op1); | |
3152 | ||
3153 | case TRUTH_NOT_EXPR: | |
2ba172e0 | 3154 | return simplify_gen_relational (EQ, mode, inner_mode, op0, const0_rtx); |
b5b8b0ac AO |
3155 | |
3156 | case LT_EXPR: | |
2ba172e0 JJ |
3157 | return simplify_gen_relational (unsignedp ? LTU : LT, mode, inner_mode, |
3158 | op0, op1); | |
b5b8b0ac AO |
3159 | |
3160 | case LE_EXPR: | |
2ba172e0 JJ |
3161 | return simplify_gen_relational (unsignedp ? LEU : LE, mode, inner_mode, |
3162 | op0, op1); | |
b5b8b0ac AO |
3163 | |
3164 | case GT_EXPR: | |
2ba172e0 JJ |
3165 | return simplify_gen_relational (unsignedp ? GTU : GT, mode, inner_mode, |
3166 | op0, op1); | |
b5b8b0ac AO |
3167 | |
3168 | case GE_EXPR: | |
2ba172e0 JJ |
3169 | return simplify_gen_relational (unsignedp ? GEU : GE, mode, inner_mode, |
3170 | op0, op1); | |
b5b8b0ac AO |
3171 | |
3172 | case EQ_EXPR: | |
2ba172e0 | 3173 | return simplify_gen_relational (EQ, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
3174 | |
3175 | case NE_EXPR: | |
2ba172e0 | 3176 | return simplify_gen_relational (NE, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
3177 | |
3178 | case UNORDERED_EXPR: | |
2ba172e0 | 3179 | return simplify_gen_relational (UNORDERED, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
3180 | |
3181 | case ORDERED_EXPR: | |
2ba172e0 | 3182 | return simplify_gen_relational (ORDERED, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
3183 | |
3184 | case UNLT_EXPR: | |
2ba172e0 | 3185 | return simplify_gen_relational (UNLT, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
3186 | |
3187 | case UNLE_EXPR: | |
2ba172e0 | 3188 | return simplify_gen_relational (UNLE, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
3189 | |
3190 | case UNGT_EXPR: | |
2ba172e0 | 3191 | return simplify_gen_relational (UNGT, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
3192 | |
3193 | case UNGE_EXPR: | |
2ba172e0 | 3194 | return simplify_gen_relational (UNGE, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
3195 | |
3196 | case UNEQ_EXPR: | |
2ba172e0 | 3197 | return simplify_gen_relational (UNEQ, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
3198 | |
3199 | case LTGT_EXPR: | |
2ba172e0 | 3200 | return simplify_gen_relational (LTGT, mode, inner_mode, op0, op1); |
b5b8b0ac AO |
3201 | |
3202 | case COND_EXPR: | |
3203 | return gen_rtx_IF_THEN_ELSE (mode, op0, op1, op2); | |
3204 | ||
3205 | case COMPLEX_EXPR: | |
3206 | gcc_assert (COMPLEX_MODE_P (mode)); | |
3207 | if (GET_MODE (op0) == VOIDmode) | |
3208 | op0 = gen_rtx_CONST (GET_MODE_INNER (mode), op0); | |
3209 | if (GET_MODE (op1) == VOIDmode) | |
3210 | op1 = gen_rtx_CONST (GET_MODE_INNER (mode), op1); | |
3211 | return gen_rtx_CONCAT (mode, op0, op1); | |
3212 | ||
d02a5a4b JJ |
3213 | case CONJ_EXPR: |
3214 | if (GET_CODE (op0) == CONCAT) | |
3215 | return gen_rtx_CONCAT (mode, XEXP (op0, 0), | |
2ba172e0 JJ |
3216 | simplify_gen_unary (NEG, GET_MODE_INNER (mode), |
3217 | XEXP (op0, 1), | |
3218 | GET_MODE_INNER (mode))); | |
d02a5a4b JJ |
3219 | else |
3220 | { | |
3221 | enum machine_mode imode = GET_MODE_INNER (mode); | |
3222 | rtx re, im; | |
3223 | ||
3224 | if (MEM_P (op0)) | |
3225 | { | |
3226 | re = adjust_address_nv (op0, imode, 0); | |
3227 | im = adjust_address_nv (op0, imode, GET_MODE_SIZE (imode)); | |
3228 | } | |
3229 | else | |
3230 | { | |
3231 | enum machine_mode ifmode = int_mode_for_mode (mode); | |
3232 | enum machine_mode ihmode = int_mode_for_mode (imode); | |
3233 | rtx halfsize; | |
3234 | if (ifmode == BLKmode || ihmode == BLKmode) | |
3235 | return NULL; | |
3236 | halfsize = GEN_INT (GET_MODE_BITSIZE (ihmode)); | |
3237 | re = op0; | |
3238 | if (mode != ifmode) | |
3239 | re = gen_rtx_SUBREG (ifmode, re, 0); | |
3240 | re = gen_rtx_ZERO_EXTRACT (ihmode, re, halfsize, const0_rtx); | |
3241 | if (imode != ihmode) | |
3242 | re = gen_rtx_SUBREG (imode, re, 0); | |
3243 | im = copy_rtx (op0); | |
3244 | if (mode != ifmode) | |
3245 | im = gen_rtx_SUBREG (ifmode, im, 0); | |
3246 | im = gen_rtx_ZERO_EXTRACT (ihmode, im, halfsize, halfsize); | |
3247 | if (imode != ihmode) | |
3248 | im = gen_rtx_SUBREG (imode, im, 0); | |
3249 | } | |
3250 | im = gen_rtx_NEG (imode, im); | |
3251 | return gen_rtx_CONCAT (mode, re, im); | |
3252 | } | |
3253 | ||
b5b8b0ac AO |
3254 | case ADDR_EXPR: |
3255 | op0 = expand_debug_expr (TREE_OPERAND (exp, 0)); | |
3256 | if (!op0 || !MEM_P (op0)) | |
c8a27c40 JJ |
3257 | { |
3258 | if ((TREE_CODE (TREE_OPERAND (exp, 0)) == VAR_DECL | |
3259 | || TREE_CODE (TREE_OPERAND (exp, 0)) == PARM_DECL | |
3260 | || TREE_CODE (TREE_OPERAND (exp, 0)) == RESULT_DECL) | |
f8cca67b JJ |
3261 | && (!TREE_ADDRESSABLE (TREE_OPERAND (exp, 0)) |
3262 | || target_for_debug_bind (TREE_OPERAND (exp, 0)))) | |
c8a27c40 JJ |
3263 | return gen_rtx_DEBUG_IMPLICIT_PTR (mode, TREE_OPERAND (exp, 0)); |
3264 | ||
3265 | if (handled_component_p (TREE_OPERAND (exp, 0))) | |
3266 | { | |
3267 | HOST_WIDE_INT bitoffset, bitsize, maxsize; | |
3268 | tree decl | |
3269 | = get_ref_base_and_extent (TREE_OPERAND (exp, 0), | |
3270 | &bitoffset, &bitsize, &maxsize); | |
3271 | if ((TREE_CODE (decl) == VAR_DECL | |
3272 | || TREE_CODE (decl) == PARM_DECL | |
3273 | || TREE_CODE (decl) == RESULT_DECL) | |
f8cca67b JJ |
3274 | && (!TREE_ADDRESSABLE (decl) |
3275 | || target_for_debug_bind (decl)) | |
c8a27c40 JJ |
3276 | && (bitoffset % BITS_PER_UNIT) == 0 |
3277 | && bitsize > 0 | |
3278 | && bitsize == maxsize) | |
0a81f074 RS |
3279 | { |
3280 | rtx base = gen_rtx_DEBUG_IMPLICIT_PTR (mode, decl); | |
3281 | return plus_constant (mode, base, bitoffset / BITS_PER_UNIT); | |
3282 | } | |
c8a27c40 JJ |
3283 | } |
3284 | ||
3285 | return NULL; | |
3286 | } | |
b5b8b0ac | 3287 | |
f61c6f34 JJ |
3288 | as = TYPE_ADDR_SPACE (TREE_TYPE (exp)); |
3289 | op0 = convert_debug_memory_address (mode, XEXP (op0, 0), as); | |
dda2da58 AO |
3290 | |
3291 | return op0; | |
b5b8b0ac AO |
3292 | |
3293 | case VECTOR_CST: | |
d2a12ae7 RG |
3294 | { |
3295 | unsigned i; | |
3296 | ||
3297 | op0 = gen_rtx_CONCATN | |
3298 | (mode, rtvec_alloc (TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp)))); | |
3299 | ||
3300 | for (i = 0; i < VECTOR_CST_NELTS (exp); ++i) | |
3301 | { | |
3302 | op1 = expand_debug_expr (VECTOR_CST_ELT (exp, i)); | |
3303 | if (!op1) | |
3304 | return NULL; | |
3305 | XVECEXP (op0, 0, i) = op1; | |
3306 | } | |
3307 | ||
3308 | return op0; | |
3309 | } | |
b5b8b0ac AO |
3310 | |
3311 | case CONSTRUCTOR: | |
47598145 MM |
3312 | if (TREE_CLOBBER_P (exp)) |
3313 | return NULL; | |
3314 | else if (TREE_CODE (TREE_TYPE (exp)) == VECTOR_TYPE) | |
b5b8b0ac AO |
3315 | { |
3316 | unsigned i; | |
3317 | tree val; | |
3318 | ||
3319 | op0 = gen_rtx_CONCATN | |
3320 | (mode, rtvec_alloc (TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp)))); | |
3321 | ||
3322 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), i, val) | |
3323 | { | |
3324 | op1 = expand_debug_expr (val); | |
3325 | if (!op1) | |
3326 | return NULL; | |
3327 | XVECEXP (op0, 0, i) = op1; | |
3328 | } | |
3329 | ||
3330 | if (i < TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp))) | |
3331 | { | |
3332 | op1 = expand_debug_expr | |
e8160c9a | 3333 | (build_zero_cst (TREE_TYPE (TREE_TYPE (exp)))); |
b5b8b0ac AO |
3334 | |
3335 | if (!op1) | |
3336 | return NULL; | |
3337 | ||
3338 | for (; i < TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp)); i++) | |
3339 | XVECEXP (op0, 0, i) = op1; | |
3340 | } | |
3341 | ||
3342 | return op0; | |
3343 | } | |
3344 | else | |
3345 | goto flag_unsupported; | |
3346 | ||
3347 | case CALL_EXPR: | |
3348 | /* ??? Maybe handle some builtins? */ | |
3349 | return NULL; | |
3350 | ||
3351 | case SSA_NAME: | |
3352 | { | |
2a8e30fb MM |
3353 | gimple g = get_gimple_for_ssa_name (exp); |
3354 | if (g) | |
3355 | { | |
3356 | op0 = expand_debug_expr (gimple_assign_rhs_to_tree (g)); | |
3357 | if (!op0) | |
3358 | return NULL; | |
3359 | } | |
3360 | else | |
3361 | { | |
3362 | int part = var_to_partition (SA.map, exp); | |
b5b8b0ac | 3363 | |
2a8e30fb | 3364 | if (part == NO_PARTITION) |
a58a8e4b JJ |
3365 | { |
3366 | /* If this is a reference to an incoming value of parameter | |
3367 | that is never used in the code or where the incoming | |
3368 | value is never used in the code, use PARM_DECL's | |
3369 | DECL_RTL if set. */ | |
3370 | if (SSA_NAME_IS_DEFAULT_DEF (exp) | |
3371 | && TREE_CODE (SSA_NAME_VAR (exp)) == PARM_DECL) | |
3372 | { | |
12c5ffe5 EB |
3373 | op0 = expand_debug_parm_decl (SSA_NAME_VAR (exp)); |
3374 | if (op0) | |
3375 | goto adjust_mode; | |
a58a8e4b | 3376 | op0 = expand_debug_expr (SSA_NAME_VAR (exp)); |
12c5ffe5 EB |
3377 | if (op0) |
3378 | goto adjust_mode; | |
a58a8e4b JJ |
3379 | } |
3380 | return NULL; | |
3381 | } | |
b5b8b0ac | 3382 | |
2a8e30fb | 3383 | gcc_assert (part >= 0 && (unsigned)part < SA.map->num_partitions); |
b5b8b0ac | 3384 | |
abfea58d | 3385 | op0 = copy_rtx (SA.partition_to_pseudo[part]); |
2a8e30fb | 3386 | } |
b5b8b0ac AO |
3387 | goto adjust_mode; |
3388 | } | |
3389 | ||
3390 | case ERROR_MARK: | |
3391 | return NULL; | |
3392 | ||
7ece48b1 JJ |
3393 | /* Vector stuff. For most of the codes we don't have rtl codes. */ |
3394 | case REALIGN_LOAD_EXPR: | |
3395 | case REDUC_MAX_EXPR: | |
3396 | case REDUC_MIN_EXPR: | |
3397 | case REDUC_PLUS_EXPR: | |
3398 | case VEC_COND_EXPR: | |
7ece48b1 JJ |
3399 | case VEC_LSHIFT_EXPR: |
3400 | case VEC_PACK_FIX_TRUNC_EXPR: | |
3401 | case VEC_PACK_SAT_EXPR: | |
3402 | case VEC_PACK_TRUNC_EXPR: | |
3403 | case VEC_RSHIFT_EXPR: | |
3404 | case VEC_UNPACK_FLOAT_HI_EXPR: | |
3405 | case VEC_UNPACK_FLOAT_LO_EXPR: | |
3406 | case VEC_UNPACK_HI_EXPR: | |
3407 | case VEC_UNPACK_LO_EXPR: | |
3408 | case VEC_WIDEN_MULT_HI_EXPR: | |
3409 | case VEC_WIDEN_MULT_LO_EXPR: | |
3f30a9a6 RH |
3410 | case VEC_WIDEN_MULT_EVEN_EXPR: |
3411 | case VEC_WIDEN_MULT_ODD_EXPR: | |
36ba4aae IR |
3412 | case VEC_WIDEN_LSHIFT_HI_EXPR: |
3413 | case VEC_WIDEN_LSHIFT_LO_EXPR: | |
3f3af9df | 3414 | case VEC_PERM_EXPR: |
7ece48b1 JJ |
3415 | return NULL; |
3416 | ||
98449720 | 3417 | /* Misc codes. */ |
7ece48b1 JJ |
3418 | case ADDR_SPACE_CONVERT_EXPR: |
3419 | case FIXED_CONVERT_EXPR: | |
3420 | case OBJ_TYPE_REF: | |
3421 | case WITH_SIZE_EXPR: | |
3422 | return NULL; | |
3423 | ||
3424 | case DOT_PROD_EXPR: | |
3425 | if (SCALAR_INT_MODE_P (GET_MODE (op0)) | |
3426 | && SCALAR_INT_MODE_P (mode)) | |
3427 | { | |
2ba172e0 JJ |
3428 | op0 |
3429 | = simplify_gen_unary (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, | |
3430 | 0))) | |
3431 | ? ZERO_EXTEND : SIGN_EXTEND, mode, op0, | |
3432 | inner_mode); | |
3433 | op1 | |
3434 | = simplify_gen_unary (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, | |
3435 | 1))) | |
3436 | ? ZERO_EXTEND : SIGN_EXTEND, mode, op1, | |
3437 | inner_mode); | |
3438 | op0 = simplify_gen_binary (MULT, mode, op0, op1); | |
3439 | return simplify_gen_binary (PLUS, mode, op0, op2); | |
7ece48b1 JJ |
3440 | } |
3441 | return NULL; | |
3442 | ||
3443 | case WIDEN_MULT_EXPR: | |
0354c0c7 BS |
3444 | case WIDEN_MULT_PLUS_EXPR: |
3445 | case WIDEN_MULT_MINUS_EXPR: | |
7ece48b1 JJ |
3446 | if (SCALAR_INT_MODE_P (GET_MODE (op0)) |
3447 | && SCALAR_INT_MODE_P (mode)) | |
3448 | { | |
2ba172e0 | 3449 | inner_mode = GET_MODE (op0); |
7ece48b1 | 3450 | if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0)))) |
5b58b39b | 3451 | op0 = simplify_gen_unary (ZERO_EXTEND, mode, op0, inner_mode); |
7ece48b1 | 3452 | else |
5b58b39b | 3453 | op0 = simplify_gen_unary (SIGN_EXTEND, mode, op0, inner_mode); |
7ece48b1 | 3454 | if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 1)))) |
5b58b39b | 3455 | op1 = simplify_gen_unary (ZERO_EXTEND, mode, op1, inner_mode); |
7ece48b1 | 3456 | else |
5b58b39b | 3457 | op1 = simplify_gen_unary (SIGN_EXTEND, mode, op1, inner_mode); |
2ba172e0 | 3458 | op0 = simplify_gen_binary (MULT, mode, op0, op1); |
0354c0c7 BS |
3459 | if (TREE_CODE (exp) == WIDEN_MULT_EXPR) |
3460 | return op0; | |
3461 | else if (TREE_CODE (exp) == WIDEN_MULT_PLUS_EXPR) | |
2ba172e0 | 3462 | return simplify_gen_binary (PLUS, mode, op0, op2); |
0354c0c7 | 3463 | else |
2ba172e0 | 3464 | return simplify_gen_binary (MINUS, mode, op2, op0); |
7ece48b1 JJ |
3465 | } |
3466 | return NULL; | |
3467 | ||
98449720 RH |
3468 | case MULT_HIGHPART_EXPR: |
3469 | /* ??? Similar to the above. */ | |
3470 | return NULL; | |
3471 | ||
7ece48b1 | 3472 | case WIDEN_SUM_EXPR: |
3f3af9df | 3473 | case WIDEN_LSHIFT_EXPR: |
7ece48b1 JJ |
3474 | if (SCALAR_INT_MODE_P (GET_MODE (op0)) |
3475 | && SCALAR_INT_MODE_P (mode)) | |
3476 | { | |
2ba172e0 JJ |
3477 | op0 |
3478 | = simplify_gen_unary (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, | |
3479 | 0))) | |
3480 | ? ZERO_EXTEND : SIGN_EXTEND, mode, op0, | |
3481 | inner_mode); | |
3f3af9df JJ |
3482 | return simplify_gen_binary (TREE_CODE (exp) == WIDEN_LSHIFT_EXPR |
3483 | ? ASHIFT : PLUS, mode, op0, op1); | |
7ece48b1 JJ |
3484 | } |
3485 | return NULL; | |
3486 | ||
0f59b812 | 3487 | case FMA_EXPR: |
2ba172e0 | 3488 | return simplify_gen_ternary (FMA, mode, inner_mode, op0, op1, op2); |
0f59b812 | 3489 | |
b5b8b0ac AO |
3490 | default: |
3491 | flag_unsupported: | |
3492 | #ifdef ENABLE_CHECKING | |
3493 | debug_tree (exp); | |
3494 | gcc_unreachable (); | |
3495 | #else | |
3496 | return NULL; | |
3497 | #endif | |
3498 | } | |
3499 | } | |
3500 | ||
ddb555ed JJ |
3501 | /* Return an RTX equivalent to the source bind value of the tree expression |
3502 | EXP. */ | |
3503 | ||
3504 | static rtx | |
3505 | expand_debug_source_expr (tree exp) | |
3506 | { | |
3507 | rtx op0 = NULL_RTX; | |
3508 | enum machine_mode mode = VOIDmode, inner_mode; | |
3509 | ||
3510 | switch (TREE_CODE (exp)) | |
3511 | { | |
3512 | case PARM_DECL: | |
3513 | { | |
ddb555ed | 3514 | mode = DECL_MODE (exp); |
12c5ffe5 EB |
3515 | op0 = expand_debug_parm_decl (exp); |
3516 | if (op0) | |
3517 | break; | |
ddb555ed JJ |
3518 | /* See if this isn't an argument that has been completely |
3519 | optimized out. */ | |
3520 | if (!DECL_RTL_SET_P (exp) | |
12c5ffe5 | 3521 | && !DECL_INCOMING_RTL (exp) |
ddb555ed JJ |
3522 | && DECL_ABSTRACT_ORIGIN (current_function_decl)) |
3523 | { | |
3524 | tree aexp = exp; | |
3525 | if (DECL_ABSTRACT_ORIGIN (exp)) | |
3526 | aexp = DECL_ABSTRACT_ORIGIN (exp); | |
3527 | if (DECL_CONTEXT (aexp) | |
3528 | == DECL_ABSTRACT_ORIGIN (current_function_decl)) | |
3529 | { | |
3530 | VEC(tree, gc) **debug_args; | |
3531 | unsigned int ix; | |
3532 | tree ddecl; | |
3533 | #ifdef ENABLE_CHECKING | |
3534 | tree parm; | |
3535 | for (parm = DECL_ARGUMENTS (current_function_decl); | |
3536 | parm; parm = DECL_CHAIN (parm)) | |
3537 | gcc_assert (parm != exp | |
3538 | && DECL_ABSTRACT_ORIGIN (parm) != aexp); | |
3539 | #endif | |
3540 | debug_args = decl_debug_args_lookup (current_function_decl); | |
3541 | if (debug_args != NULL) | |
3542 | { | |
3543 | for (ix = 0; VEC_iterate (tree, *debug_args, ix, ddecl); | |
3544 | ix += 2) | |
3545 | if (ddecl == aexp) | |
3546 | return gen_rtx_DEBUG_PARAMETER_REF (mode, aexp); | |
3547 | } | |
3548 | } | |
3549 | } | |
3550 | break; | |
3551 | } | |
3552 | default: | |
3553 | break; | |
3554 | } | |
3555 | ||
3556 | if (op0 == NULL_RTX) | |
3557 | return NULL_RTX; | |
3558 | ||
3559 | inner_mode = GET_MODE (op0); | |
3560 | if (mode == inner_mode) | |
3561 | return op0; | |
3562 | ||
3563 | if (FLOAT_MODE_P (mode) && FLOAT_MODE_P (inner_mode)) | |
3564 | { | |
3565 | if (GET_MODE_BITSIZE (mode) == GET_MODE_BITSIZE (inner_mode)) | |
3566 | op0 = simplify_gen_subreg (mode, op0, inner_mode, 0); | |
3567 | else if (GET_MODE_BITSIZE (mode) < GET_MODE_BITSIZE (inner_mode)) | |
3568 | op0 = simplify_gen_unary (FLOAT_TRUNCATE, mode, op0, inner_mode); | |
3569 | else | |
3570 | op0 = simplify_gen_unary (FLOAT_EXTEND, mode, op0, inner_mode); | |
3571 | } | |
3572 | else if (FLOAT_MODE_P (mode)) | |
3573 | gcc_unreachable (); | |
3574 | else if (FLOAT_MODE_P (inner_mode)) | |
3575 | { | |
3576 | if (TYPE_UNSIGNED (TREE_TYPE (exp))) | |
3577 | op0 = simplify_gen_unary (UNSIGNED_FIX, mode, op0, inner_mode); | |
3578 | else | |
3579 | op0 = simplify_gen_unary (FIX, mode, op0, inner_mode); | |
3580 | } | |
3581 | else if (CONSTANT_P (op0) | |
3582 | || GET_MODE_BITSIZE (mode) <= GET_MODE_BITSIZE (inner_mode)) | |
3583 | op0 = simplify_gen_subreg (mode, op0, inner_mode, | |
3584 | subreg_lowpart_offset (mode, inner_mode)); | |
3585 | else if (TYPE_UNSIGNED (TREE_TYPE (exp))) | |
3586 | op0 = simplify_gen_unary (ZERO_EXTEND, mode, op0, inner_mode); | |
3587 | else | |
3588 | op0 = simplify_gen_unary (SIGN_EXTEND, mode, op0, inner_mode); | |
3589 | ||
3590 | return op0; | |
3591 | } | |
3592 | ||
b5b8b0ac AO |
3593 | /* Expand the _LOCs in debug insns. We run this after expanding all |
3594 | regular insns, so that any variables referenced in the function | |
3595 | will have their DECL_RTLs set. */ | |
3596 | ||
3597 | static void | |
3598 | expand_debug_locations (void) | |
3599 | { | |
3600 | rtx insn; | |
3601 | rtx last = get_last_insn (); | |
3602 | int save_strict_alias = flag_strict_aliasing; | |
3603 | ||
3604 | /* New alias sets while setting up memory attributes cause | |
3605 | -fcompare-debug failures, even though it doesn't bring about any | |
3606 | codegen changes. */ | |
3607 | flag_strict_aliasing = 0; | |
3608 | ||
3609 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) | |
3610 | if (DEBUG_INSN_P (insn)) | |
3611 | { | |
3612 | tree value = (tree)INSN_VAR_LOCATION_LOC (insn); | |
3613 | rtx val; | |
3614 | enum machine_mode mode; | |
3615 | ||
3616 | if (value == NULL_TREE) | |
3617 | val = NULL_RTX; | |
3618 | else | |
3619 | { | |
ddb555ed JJ |
3620 | if (INSN_VAR_LOCATION_STATUS (insn) |
3621 | == VAR_INIT_STATUS_UNINITIALIZED) | |
3622 | val = expand_debug_source_expr (value); | |
3623 | else | |
3624 | val = expand_debug_expr (value); | |
b5b8b0ac AO |
3625 | gcc_assert (last == get_last_insn ()); |
3626 | } | |
3627 | ||
3628 | if (!val) | |
3629 | val = gen_rtx_UNKNOWN_VAR_LOC (); | |
3630 | else | |
3631 | { | |
3632 | mode = GET_MODE (INSN_VAR_LOCATION (insn)); | |
3633 | ||
3634 | gcc_assert (mode == GET_MODE (val) | |
3635 | || (GET_MODE (val) == VOIDmode | |
3636 | && (CONST_INT_P (val) | |
3637 | || GET_CODE (val) == CONST_FIXED | |
48175537 | 3638 | || CONST_DOUBLE_AS_INT_P (val) |
b5b8b0ac AO |
3639 | || GET_CODE (val) == LABEL_REF))); |
3640 | } | |
3641 | ||
3642 | INSN_VAR_LOCATION_LOC (insn) = val; | |
3643 | } | |
3644 | ||
3645 | flag_strict_aliasing = save_strict_alias; | |
3646 | } | |
3647 | ||
242229bb JH |
3648 | /* Expand basic block BB from GIMPLE trees to RTL. */ |
3649 | ||
3650 | static basic_block | |
10d22567 | 3651 | expand_gimple_basic_block (basic_block bb) |
242229bb | 3652 | { |
726a989a RB |
3653 | gimple_stmt_iterator gsi; |
3654 | gimple_seq stmts; | |
3655 | gimple stmt = NULL; | |
242229bb JH |
3656 | rtx note, last; |
3657 | edge e; | |
628f6a4e | 3658 | edge_iterator ei; |
8b11009b | 3659 | void **elt; |
242229bb JH |
3660 | |
3661 | if (dump_file) | |
726a989a RB |
3662 | fprintf (dump_file, "\n;; Generating RTL for gimple basic block %d\n", |
3663 | bb->index); | |
3664 | ||
3665 | /* Note that since we are now transitioning from GIMPLE to RTL, we | |
3666 | cannot use the gsi_*_bb() routines because they expect the basic | |
3667 | block to be in GIMPLE, instead of RTL. Therefore, we need to | |
3668 | access the BB sequence directly. */ | |
3669 | stmts = bb_seq (bb); | |
3e8b732e MM |
3670 | bb->il.gimple.seq = NULL; |
3671 | bb->il.gimple.phi_nodes = NULL; | |
bf08ebeb | 3672 | rtl_profile_for_bb (bb); |
5e2d947c JH |
3673 | init_rtl_bb_info (bb); |
3674 | bb->flags |= BB_RTL; | |
3675 | ||
a9b77cd1 ZD |
3676 | /* Remove the RETURN_EXPR if we may fall though to the exit |
3677 | instead. */ | |
726a989a RB |
3678 | gsi = gsi_last (stmts); |
3679 | if (!gsi_end_p (gsi) | |
3680 | && gimple_code (gsi_stmt (gsi)) == GIMPLE_RETURN) | |
a9b77cd1 | 3681 | { |
726a989a | 3682 | gimple ret_stmt = gsi_stmt (gsi); |
a9b77cd1 ZD |
3683 | |
3684 | gcc_assert (single_succ_p (bb)); | |
3685 | gcc_assert (single_succ (bb) == EXIT_BLOCK_PTR); | |
3686 | ||
3687 | if (bb->next_bb == EXIT_BLOCK_PTR | |
726a989a | 3688 | && !gimple_return_retval (ret_stmt)) |
a9b77cd1 | 3689 | { |
726a989a | 3690 | gsi_remove (&gsi, false); |
a9b77cd1 ZD |
3691 | single_succ_edge (bb)->flags |= EDGE_FALLTHRU; |
3692 | } | |
3693 | } | |
3694 | ||
726a989a RB |
3695 | gsi = gsi_start (stmts); |
3696 | if (!gsi_end_p (gsi)) | |
8b11009b | 3697 | { |
726a989a RB |
3698 | stmt = gsi_stmt (gsi); |
3699 | if (gimple_code (stmt) != GIMPLE_LABEL) | |
3700 | stmt = NULL; | |
8b11009b | 3701 | } |
242229bb | 3702 | |
8b11009b ZD |
3703 | elt = pointer_map_contains (lab_rtx_for_bb, bb); |
3704 | ||
3705 | if (stmt || elt) | |
242229bb JH |
3706 | { |
3707 | last = get_last_insn (); | |
3708 | ||
8b11009b ZD |
3709 | if (stmt) |
3710 | { | |
28ed065e | 3711 | expand_gimple_stmt (stmt); |
726a989a | 3712 | gsi_next (&gsi); |
8b11009b ZD |
3713 | } |
3714 | ||
3715 | if (elt) | |
ae50c0cb | 3716 | emit_label ((rtx) *elt); |
242229bb | 3717 | |
caf93cb0 | 3718 | /* Java emits line number notes in the top of labels. |
c22cacf3 | 3719 | ??? Make this go away once line number notes are obsoleted. */ |
242229bb | 3720 | BB_HEAD (bb) = NEXT_INSN (last); |
4b4bf941 | 3721 | if (NOTE_P (BB_HEAD (bb))) |
242229bb | 3722 | BB_HEAD (bb) = NEXT_INSN (BB_HEAD (bb)); |
242229bb | 3723 | note = emit_note_after (NOTE_INSN_BASIC_BLOCK, BB_HEAD (bb)); |
b7211528 | 3724 | |
726a989a | 3725 | maybe_dump_rtl_for_gimple_stmt (stmt, last); |
242229bb JH |
3726 | } |
3727 | else | |
3728 | note = BB_HEAD (bb) = emit_note (NOTE_INSN_BASIC_BLOCK); | |
3729 | ||
3730 | NOTE_BASIC_BLOCK (note) = bb; | |
3731 | ||
726a989a | 3732 | for (; !gsi_end_p (gsi); gsi_next (&gsi)) |
242229bb | 3733 | { |
cea49550 | 3734 | basic_block new_bb; |
242229bb | 3735 | |
b5b8b0ac | 3736 | stmt = gsi_stmt (gsi); |
2a8e30fb MM |
3737 | |
3738 | /* If this statement is a non-debug one, and we generate debug | |
3739 | insns, then this one might be the last real use of a TERed | |
3740 | SSA_NAME, but where there are still some debug uses further | |
3741 | down. Expanding the current SSA name in such further debug | |
3742 | uses by their RHS might lead to wrong debug info, as coalescing | |
3743 | might make the operands of such RHS be placed into the same | |
3744 | pseudo as something else. Like so: | |
3745 | a_1 = a_0 + 1; // Assume a_1 is TERed and a_0 is dead | |
3746 | use(a_1); | |
3747 | a_2 = ... | |
3748 | #DEBUG ... => a_1 | |
3749 | As a_0 and a_2 don't overlap in lifetime, assume they are coalesced. | |
3750 | If we now would expand a_1 by it's RHS (a_0 + 1) in the debug use, | |
3751 | the write to a_2 would actually have clobbered the place which | |
3752 | formerly held a_0. | |
3753 | ||
3754 | So, instead of that, we recognize the situation, and generate | |
3755 | debug temporaries at the last real use of TERed SSA names: | |
3756 | a_1 = a_0 + 1; | |
3757 | #DEBUG #D1 => a_1 | |
3758 | use(a_1); | |
3759 | a_2 = ... | |
3760 | #DEBUG ... => #D1 | |
3761 | */ | |
3762 | if (MAY_HAVE_DEBUG_INSNS | |
3763 | && SA.values | |
3764 | && !is_gimple_debug (stmt)) | |
3765 | { | |
3766 | ssa_op_iter iter; | |
3767 | tree op; | |
3768 | gimple def; | |
3769 | ||
5368224f | 3770 | location_t sloc = curr_insn_location (); |
2a8e30fb MM |
3771 | |
3772 | /* Look for SSA names that have their last use here (TERed | |
3773 | names always have only one real use). */ | |
3774 | FOR_EACH_SSA_TREE_OPERAND (op, stmt, iter, SSA_OP_USE) | |
3775 | if ((def = get_gimple_for_ssa_name (op))) | |
3776 | { | |
3777 | imm_use_iterator imm_iter; | |
3778 | use_operand_p use_p; | |
3779 | bool have_debug_uses = false; | |
3780 | ||
3781 | FOR_EACH_IMM_USE_FAST (use_p, imm_iter, op) | |
3782 | { | |
3783 | if (gimple_debug_bind_p (USE_STMT (use_p))) | |
3784 | { | |
3785 | have_debug_uses = true; | |
3786 | break; | |
3787 | } | |
3788 | } | |
3789 | ||
3790 | if (have_debug_uses) | |
3791 | { | |
3792 | /* OP is a TERed SSA name, with DEF it's defining | |
3793 | statement, and where OP is used in further debug | |
3794 | instructions. Generate a debug temporary, and | |
3795 | replace all uses of OP in debug insns with that | |
3796 | temporary. */ | |
3797 | gimple debugstmt; | |
3798 | tree value = gimple_assign_rhs_to_tree (def); | |
3799 | tree vexpr = make_node (DEBUG_EXPR_DECL); | |
3800 | rtx val; | |
3801 | enum machine_mode mode; | |
3802 | ||
5368224f | 3803 | set_curr_insn_location (gimple_location (def)); |
2a8e30fb MM |
3804 | |
3805 | DECL_ARTIFICIAL (vexpr) = 1; | |
3806 | TREE_TYPE (vexpr) = TREE_TYPE (value); | |
3807 | if (DECL_P (value)) | |
3808 | mode = DECL_MODE (value); | |
3809 | else | |
3810 | mode = TYPE_MODE (TREE_TYPE (value)); | |
3811 | DECL_MODE (vexpr) = mode; | |
3812 | ||
3813 | val = gen_rtx_VAR_LOCATION | |
3814 | (mode, vexpr, (rtx)value, VAR_INIT_STATUS_INITIALIZED); | |
3815 | ||
e8c6bb74 | 3816 | emit_debug_insn (val); |
2a8e30fb MM |
3817 | |
3818 | FOR_EACH_IMM_USE_STMT (debugstmt, imm_iter, op) | |
3819 | { | |
3820 | if (!gimple_debug_bind_p (debugstmt)) | |
3821 | continue; | |
3822 | ||
3823 | FOR_EACH_IMM_USE_ON_STMT (use_p, imm_iter) | |
3824 | SET_USE (use_p, vexpr); | |
3825 | ||
3826 | update_stmt (debugstmt); | |
3827 | } | |
3828 | } | |
3829 | } | |
5368224f | 3830 | set_curr_insn_location (sloc); |
2a8e30fb MM |
3831 | } |
3832 | ||
a5883ba0 | 3833 | currently_expanding_gimple_stmt = stmt; |
b5b8b0ac | 3834 | |
242229bb JH |
3835 | /* Expand this statement, then evaluate the resulting RTL and |
3836 | fixup the CFG accordingly. */ | |
726a989a | 3837 | if (gimple_code (stmt) == GIMPLE_COND) |
cea49550 | 3838 | { |
726a989a | 3839 | new_bb = expand_gimple_cond (bb, stmt); |
cea49550 RH |
3840 | if (new_bb) |
3841 | return new_bb; | |
3842 | } | |
b5b8b0ac AO |
3843 | else if (gimple_debug_bind_p (stmt)) |
3844 | { | |
5368224f | 3845 | location_t sloc = curr_insn_location (); |
b5b8b0ac AO |
3846 | gimple_stmt_iterator nsi = gsi; |
3847 | ||
3848 | for (;;) | |
3849 | { | |
3850 | tree var = gimple_debug_bind_get_var (stmt); | |
3851 | tree value; | |
3852 | rtx val; | |
3853 | enum machine_mode mode; | |
3854 | ||
ec8c1492 JJ |
3855 | if (TREE_CODE (var) != DEBUG_EXPR_DECL |
3856 | && TREE_CODE (var) != LABEL_DECL | |
3857 | && !target_for_debug_bind (var)) | |
3858 | goto delink_debug_stmt; | |
3859 | ||
b5b8b0ac AO |
3860 | if (gimple_debug_bind_has_value_p (stmt)) |
3861 | value = gimple_debug_bind_get_value (stmt); | |
3862 | else | |
3863 | value = NULL_TREE; | |
3864 | ||
3865 | last = get_last_insn (); | |
3866 | ||
5368224f | 3867 | set_curr_insn_location (gimple_location (stmt)); |
b5b8b0ac AO |
3868 | |
3869 | if (DECL_P (var)) | |
3870 | mode = DECL_MODE (var); | |
3871 | else | |
3872 | mode = TYPE_MODE (TREE_TYPE (var)); | |
3873 | ||
3874 | val = gen_rtx_VAR_LOCATION | |
3875 | (mode, var, (rtx)value, VAR_INIT_STATUS_INITIALIZED); | |
3876 | ||
e16b6fd0 | 3877 | emit_debug_insn (val); |
b5b8b0ac AO |
3878 | |
3879 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
3880 | { | |
3881 | /* We can't dump the insn with a TREE where an RTX | |
3882 | is expected. */ | |
e8c6bb74 | 3883 | PAT_VAR_LOCATION_LOC (val) = const0_rtx; |
b5b8b0ac | 3884 | maybe_dump_rtl_for_gimple_stmt (stmt, last); |
e8c6bb74 | 3885 | PAT_VAR_LOCATION_LOC (val) = (rtx)value; |
b5b8b0ac AO |
3886 | } |
3887 | ||
ec8c1492 | 3888 | delink_debug_stmt: |
2a8e30fb MM |
3889 | /* In order not to generate too many debug temporaries, |
3890 | we delink all uses of debug statements we already expanded. | |
3891 | Therefore debug statements between definition and real | |
3892 | use of TERed SSA names will continue to use the SSA name, | |
3893 | and not be replaced with debug temps. */ | |
3894 | delink_stmt_imm_use (stmt); | |
3895 | ||
b5b8b0ac AO |
3896 | gsi = nsi; |
3897 | gsi_next (&nsi); | |
3898 | if (gsi_end_p (nsi)) | |
3899 | break; | |
3900 | stmt = gsi_stmt (nsi); | |
3901 | if (!gimple_debug_bind_p (stmt)) | |
3902 | break; | |
3903 | } | |
3904 | ||
5368224f | 3905 | set_curr_insn_location (sloc); |
ddb555ed JJ |
3906 | } |
3907 | else if (gimple_debug_source_bind_p (stmt)) | |
3908 | { | |
5368224f | 3909 | location_t sloc = curr_insn_location (); |
ddb555ed JJ |
3910 | tree var = gimple_debug_source_bind_get_var (stmt); |
3911 | tree value = gimple_debug_source_bind_get_value (stmt); | |
3912 | rtx val; | |
3913 | enum machine_mode mode; | |
3914 | ||
3915 | last = get_last_insn (); | |
3916 | ||
5368224f | 3917 | set_curr_insn_location (gimple_location (stmt)); |
ddb555ed JJ |
3918 | |
3919 | mode = DECL_MODE (var); | |
3920 | ||
3921 | val = gen_rtx_VAR_LOCATION (mode, var, (rtx)value, | |
3922 | VAR_INIT_STATUS_UNINITIALIZED); | |
3923 | ||
3924 | emit_debug_insn (val); | |
3925 | ||
3926 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
3927 | { | |
3928 | /* We can't dump the insn with a TREE where an RTX | |
3929 | is expected. */ | |
3930 | PAT_VAR_LOCATION_LOC (val) = const0_rtx; | |
3931 | maybe_dump_rtl_for_gimple_stmt (stmt, last); | |
3932 | PAT_VAR_LOCATION_LOC (val) = (rtx)value; | |
3933 | } | |
3934 | ||
5368224f | 3935 | set_curr_insn_location (sloc); |
b5b8b0ac | 3936 | } |
80c7a9eb | 3937 | else |
242229bb | 3938 | { |
726a989a | 3939 | if (is_gimple_call (stmt) && gimple_call_tail_p (stmt)) |
cea49550 RH |
3940 | { |
3941 | bool can_fallthru; | |
3942 | new_bb = expand_gimple_tailcall (bb, stmt, &can_fallthru); | |
3943 | if (new_bb) | |
3944 | { | |
3945 | if (can_fallthru) | |
3946 | bb = new_bb; | |
3947 | else | |
3948 | return new_bb; | |
3949 | } | |
3950 | } | |
4d7a65ea | 3951 | else |
b7211528 | 3952 | { |
4e3825db | 3953 | def_operand_p def_p; |
4e3825db MM |
3954 | def_p = SINGLE_SSA_DEF_OPERAND (stmt, SSA_OP_DEF); |
3955 | ||
3956 | if (def_p != NULL) | |
3957 | { | |
3958 | /* Ignore this stmt if it is in the list of | |
3959 | replaceable expressions. */ | |
3960 | if (SA.values | |
b8698a0f | 3961 | && bitmap_bit_p (SA.values, |
e97809c6 | 3962 | SSA_NAME_VERSION (DEF_FROM_PTR (def_p)))) |
4e3825db MM |
3963 | continue; |
3964 | } | |
28ed065e | 3965 | last = expand_gimple_stmt (stmt); |
726a989a | 3966 | maybe_dump_rtl_for_gimple_stmt (stmt, last); |
b7211528 | 3967 | } |
242229bb JH |
3968 | } |
3969 | } | |
3970 | ||
a5883ba0 MM |
3971 | currently_expanding_gimple_stmt = NULL; |
3972 | ||
7241571e | 3973 | /* Expand implicit goto and convert goto_locus. */ |
a9b77cd1 ZD |
3974 | FOR_EACH_EDGE (e, ei, bb->succs) |
3975 | { | |
5368224f DC |
3976 | if (!IS_UNKNOWN_LOCATION (e->goto_locus)) |
3977 | set_curr_insn_location (e->goto_locus); | |
7241571e JJ |
3978 | if ((e->flags & EDGE_FALLTHRU) && e->dest != bb->next_bb) |
3979 | { | |
3980 | emit_jump (label_rtx_for_bb (e->dest)); | |
3981 | e->flags &= ~EDGE_FALLTHRU; | |
3982 | } | |
a9b77cd1 ZD |
3983 | } |
3984 | ||
ae761c45 AH |
3985 | /* Expanded RTL can create a jump in the last instruction of block. |
3986 | This later might be assumed to be a jump to successor and break edge insertion. | |
3987 | We need to insert dummy move to prevent this. PR41440. */ | |
3988 | if (single_succ_p (bb) | |
3989 | && (single_succ_edge (bb)->flags & EDGE_FALLTHRU) | |
3990 | && (last = get_last_insn ()) | |
3991 | && JUMP_P (last)) | |
3992 | { | |
3993 | rtx dummy = gen_reg_rtx (SImode); | |
3994 | emit_insn_after_noloc (gen_move_insn (dummy, dummy), last, NULL); | |
3995 | } | |
3996 | ||
242229bb JH |
3997 | do_pending_stack_adjust (); |
3998 | ||
3f117656 | 3999 | /* Find the block tail. The last insn in the block is the insn |
242229bb JH |
4000 | before a barrier and/or table jump insn. */ |
4001 | last = get_last_insn (); | |
4b4bf941 | 4002 | if (BARRIER_P (last)) |
242229bb JH |
4003 | last = PREV_INSN (last); |
4004 | if (JUMP_TABLE_DATA_P (last)) | |
4005 | last = PREV_INSN (PREV_INSN (last)); | |
4006 | BB_END (bb) = last; | |
caf93cb0 | 4007 | |
242229bb | 4008 | update_bb_for_insn (bb); |
80c7a9eb | 4009 | |
242229bb JH |
4010 | return bb; |
4011 | } | |
4012 | ||
4013 | ||
4014 | /* Create a basic block for initialization code. */ | |
4015 | ||
4016 | static basic_block | |
4017 | construct_init_block (void) | |
4018 | { | |
4019 | basic_block init_block, first_block; | |
fd44f634 JH |
4020 | edge e = NULL; |
4021 | int flags; | |
275a4187 | 4022 | |
fd44f634 JH |
4023 | /* Multiple entry points not supported yet. */ |
4024 | gcc_assert (EDGE_COUNT (ENTRY_BLOCK_PTR->succs) == 1); | |
5e2d947c JH |
4025 | init_rtl_bb_info (ENTRY_BLOCK_PTR); |
4026 | init_rtl_bb_info (EXIT_BLOCK_PTR); | |
4027 | ENTRY_BLOCK_PTR->flags |= BB_RTL; | |
4028 | EXIT_BLOCK_PTR->flags |= BB_RTL; | |
242229bb | 4029 | |
fd44f634 | 4030 | e = EDGE_SUCC (ENTRY_BLOCK_PTR, 0); |
275a4187 | 4031 | |
fd44f634 JH |
4032 | /* When entry edge points to first basic block, we don't need jump, |
4033 | otherwise we have to jump into proper target. */ | |
4034 | if (e && e->dest != ENTRY_BLOCK_PTR->next_bb) | |
4035 | { | |
726a989a | 4036 | tree label = gimple_block_label (e->dest); |
fd44f634 JH |
4037 | |
4038 | emit_jump (label_rtx (label)); | |
4039 | flags = 0; | |
275a4187 | 4040 | } |
fd44f634 JH |
4041 | else |
4042 | flags = EDGE_FALLTHRU; | |
242229bb JH |
4043 | |
4044 | init_block = create_basic_block (NEXT_INSN (get_insns ()), | |
4045 | get_last_insn (), | |
4046 | ENTRY_BLOCK_PTR); | |
4047 | init_block->frequency = ENTRY_BLOCK_PTR->frequency; | |
4048 | init_block->count = ENTRY_BLOCK_PTR->count; | |
7d776ee2 RG |
4049 | if (current_loops && ENTRY_BLOCK_PTR->loop_father) |
4050 | add_bb_to_loop (init_block, ENTRY_BLOCK_PTR->loop_father); | |
242229bb JH |
4051 | if (e) |
4052 | { | |
4053 | first_block = e->dest; | |
4054 | redirect_edge_succ (e, init_block); | |
fd44f634 | 4055 | e = make_edge (init_block, first_block, flags); |
242229bb JH |
4056 | } |
4057 | else | |
4058 | e = make_edge (init_block, EXIT_BLOCK_PTR, EDGE_FALLTHRU); | |
4059 | e->probability = REG_BR_PROB_BASE; | |
4060 | e->count = ENTRY_BLOCK_PTR->count; | |
4061 | ||
4062 | update_bb_for_insn (init_block); | |
4063 | return init_block; | |
4064 | } | |
4065 | ||
55e092c4 JH |
4066 | /* For each lexical block, set BLOCK_NUMBER to the depth at which it is |
4067 | found in the block tree. */ | |
4068 | ||
4069 | static void | |
4070 | set_block_levels (tree block, int level) | |
4071 | { | |
4072 | while (block) | |
4073 | { | |
4074 | BLOCK_NUMBER (block) = level; | |
4075 | set_block_levels (BLOCK_SUBBLOCKS (block), level + 1); | |
4076 | block = BLOCK_CHAIN (block); | |
4077 | } | |
4078 | } | |
242229bb JH |
4079 | |
4080 | /* Create a block containing landing pads and similar stuff. */ | |
4081 | ||
4082 | static void | |
4083 | construct_exit_block (void) | |
4084 | { | |
4085 | rtx head = get_last_insn (); | |
4086 | rtx end; | |
4087 | basic_block exit_block; | |
628f6a4e BE |
4088 | edge e, e2; |
4089 | unsigned ix; | |
4090 | edge_iterator ei; | |
071a42f9 | 4091 | rtx orig_end = BB_END (EXIT_BLOCK_PTR->prev_bb); |
242229bb | 4092 | |
bf08ebeb JH |
4093 | rtl_profile_for_bb (EXIT_BLOCK_PTR); |
4094 | ||
caf93cb0 | 4095 | /* Make sure the locus is set to the end of the function, so that |
242229bb | 4096 | epilogue line numbers and warnings are set properly. */ |
5368224f | 4097 | if (!IS_UNKNOWN_LOCATION (cfun->function_end_locus)) |
242229bb JH |
4098 | input_location = cfun->function_end_locus; |
4099 | ||
242229bb JH |
4100 | /* Generate rtl for function exit. */ |
4101 | expand_function_end (); | |
4102 | ||
4103 | end = get_last_insn (); | |
4104 | if (head == end) | |
4105 | return; | |
071a42f9 JH |
4106 | /* While emitting the function end we could move end of the last basic block. |
4107 | */ | |
4108 | BB_END (EXIT_BLOCK_PTR->prev_bb) = orig_end; | |
4b4bf941 | 4109 | while (NEXT_INSN (head) && NOTE_P (NEXT_INSN (head))) |
242229bb | 4110 | head = NEXT_INSN (head); |
80c7a9eb RH |
4111 | exit_block = create_basic_block (NEXT_INSN (head), end, |
4112 | EXIT_BLOCK_PTR->prev_bb); | |
242229bb JH |
4113 | exit_block->frequency = EXIT_BLOCK_PTR->frequency; |
4114 | exit_block->count = EXIT_BLOCK_PTR->count; | |
7d776ee2 RG |
4115 | if (current_loops && EXIT_BLOCK_PTR->loop_father) |
4116 | add_bb_to_loop (exit_block, EXIT_BLOCK_PTR->loop_father); | |
628f6a4e BE |
4117 | |
4118 | ix = 0; | |
4119 | while (ix < EDGE_COUNT (EXIT_BLOCK_PTR->preds)) | |
242229bb | 4120 | { |
8fb790fd | 4121 | e = EDGE_PRED (EXIT_BLOCK_PTR, ix); |
242229bb | 4122 | if (!(e->flags & EDGE_ABNORMAL)) |
628f6a4e BE |
4123 | redirect_edge_succ (e, exit_block); |
4124 | else | |
4125 | ix++; | |
242229bb | 4126 | } |
628f6a4e | 4127 | |
242229bb JH |
4128 | e = make_edge (exit_block, EXIT_BLOCK_PTR, EDGE_FALLTHRU); |
4129 | e->probability = REG_BR_PROB_BASE; | |
4130 | e->count = EXIT_BLOCK_PTR->count; | |
628f6a4e | 4131 | FOR_EACH_EDGE (e2, ei, EXIT_BLOCK_PTR->preds) |
242229bb JH |
4132 | if (e2 != e) |
4133 | { | |
c22cacf3 | 4134 | e->count -= e2->count; |
242229bb JH |
4135 | exit_block->count -= e2->count; |
4136 | exit_block->frequency -= EDGE_FREQUENCY (e2); | |
4137 | } | |
4138 | if (e->count < 0) | |
4139 | e->count = 0; | |
4140 | if (exit_block->count < 0) | |
4141 | exit_block->count = 0; | |
4142 | if (exit_block->frequency < 0) | |
4143 | exit_block->frequency = 0; | |
4144 | update_bb_for_insn (exit_block); | |
4145 | } | |
4146 | ||
c22cacf3 | 4147 | /* Helper function for discover_nonconstant_array_refs. |
a1b23b2f UW |
4148 | Look for ARRAY_REF nodes with non-constant indexes and mark them |
4149 | addressable. */ | |
4150 | ||
4151 | static tree | |
4152 | discover_nonconstant_array_refs_r (tree * tp, int *walk_subtrees, | |
4153 | void *data ATTRIBUTE_UNUSED) | |
4154 | { | |
4155 | tree t = *tp; | |
4156 | ||
4157 | if (IS_TYPE_OR_DECL_P (t)) | |
4158 | *walk_subtrees = 0; | |
4159 | else if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF) | |
4160 | { | |
4161 | while (((TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF) | |
4162 | && is_gimple_min_invariant (TREE_OPERAND (t, 1)) | |
4163 | && (!TREE_OPERAND (t, 2) | |
4164 | || is_gimple_min_invariant (TREE_OPERAND (t, 2)))) | |
4165 | || (TREE_CODE (t) == COMPONENT_REF | |
4166 | && (!TREE_OPERAND (t,2) | |
4167 | || is_gimple_min_invariant (TREE_OPERAND (t, 2)))) | |
4168 | || TREE_CODE (t) == BIT_FIELD_REF | |
4169 | || TREE_CODE (t) == REALPART_EXPR | |
4170 | || TREE_CODE (t) == IMAGPART_EXPR | |
4171 | || TREE_CODE (t) == VIEW_CONVERT_EXPR | |
1043771b | 4172 | || CONVERT_EXPR_P (t)) |
a1b23b2f UW |
4173 | t = TREE_OPERAND (t, 0); |
4174 | ||
4175 | if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF) | |
4176 | { | |
4177 | t = get_base_address (t); | |
6f11d690 RG |
4178 | if (t && DECL_P (t) |
4179 | && DECL_MODE (t) != BLKmode) | |
a1b23b2f UW |
4180 | TREE_ADDRESSABLE (t) = 1; |
4181 | } | |
4182 | ||
4183 | *walk_subtrees = 0; | |
4184 | } | |
4185 | ||
4186 | return NULL_TREE; | |
4187 | } | |
4188 | ||
4189 | /* RTL expansion is not able to compile array references with variable | |
4190 | offsets for arrays stored in single register. Discover such | |
4191 | expressions and mark variables as addressable to avoid this | |
4192 | scenario. */ | |
4193 | ||
4194 | static void | |
4195 | discover_nonconstant_array_refs (void) | |
4196 | { | |
4197 | basic_block bb; | |
726a989a | 4198 | gimple_stmt_iterator gsi; |
a1b23b2f UW |
4199 | |
4200 | FOR_EACH_BB (bb) | |
726a989a RB |
4201 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
4202 | { | |
4203 | gimple stmt = gsi_stmt (gsi); | |
aa847cc8 JJ |
4204 | if (!is_gimple_debug (stmt)) |
4205 | walk_gimple_op (stmt, discover_nonconstant_array_refs_r, NULL); | |
726a989a | 4206 | } |
a1b23b2f UW |
4207 | } |
4208 | ||
2e3f842f L |
4209 | /* This function sets crtl->args.internal_arg_pointer to a virtual |
4210 | register if DRAP is needed. Local register allocator will replace | |
4211 | virtual_incoming_args_rtx with the virtual register. */ | |
4212 | ||
4213 | static void | |
4214 | expand_stack_alignment (void) | |
4215 | { | |
4216 | rtx drap_rtx; | |
e939805b | 4217 | unsigned int preferred_stack_boundary; |
2e3f842f L |
4218 | |
4219 | if (! SUPPORTS_STACK_ALIGNMENT) | |
4220 | return; | |
b8698a0f | 4221 | |
2e3f842f L |
4222 | if (cfun->calls_alloca |
4223 | || cfun->has_nonlocal_label | |
4224 | || crtl->has_nonlocal_goto) | |
4225 | crtl->need_drap = true; | |
4226 | ||
890b9b96 L |
4227 | /* Call update_stack_boundary here again to update incoming stack |
4228 | boundary. It may set incoming stack alignment to a different | |
4229 | value after RTL expansion. TARGET_FUNCTION_OK_FOR_SIBCALL may | |
4230 | use the minimum incoming stack alignment to check if it is OK | |
4231 | to perform sibcall optimization since sibcall optimization will | |
4232 | only align the outgoing stack to incoming stack boundary. */ | |
4233 | if (targetm.calls.update_stack_boundary) | |
4234 | targetm.calls.update_stack_boundary (); | |
4235 | ||
4236 | /* The incoming stack frame has to be aligned at least at | |
4237 | parm_stack_boundary. */ | |
4238 | gcc_assert (crtl->parm_stack_boundary <= INCOMING_STACK_BOUNDARY); | |
2e3f842f | 4239 | |
2e3f842f L |
4240 | /* Update crtl->stack_alignment_estimated and use it later to align |
4241 | stack. We check PREFERRED_STACK_BOUNDARY if there may be non-call | |
4242 | exceptions since callgraph doesn't collect incoming stack alignment | |
4243 | in this case. */ | |
8f4f502f | 4244 | if (cfun->can_throw_non_call_exceptions |
2e3f842f L |
4245 | && PREFERRED_STACK_BOUNDARY > crtl->preferred_stack_boundary) |
4246 | preferred_stack_boundary = PREFERRED_STACK_BOUNDARY; | |
4247 | else | |
4248 | preferred_stack_boundary = crtl->preferred_stack_boundary; | |
4249 | if (preferred_stack_boundary > crtl->stack_alignment_estimated) | |
4250 | crtl->stack_alignment_estimated = preferred_stack_boundary; | |
4251 | if (preferred_stack_boundary > crtl->stack_alignment_needed) | |
4252 | crtl->stack_alignment_needed = preferred_stack_boundary; | |
4253 | ||
890b9b96 L |
4254 | gcc_assert (crtl->stack_alignment_needed |
4255 | <= crtl->stack_alignment_estimated); | |
4256 | ||
2e3f842f | 4257 | crtl->stack_realign_needed |
e939805b | 4258 | = INCOMING_STACK_BOUNDARY < crtl->stack_alignment_estimated; |
d2d93c32 | 4259 | crtl->stack_realign_tried = crtl->stack_realign_needed; |
2e3f842f L |
4260 | |
4261 | crtl->stack_realign_processed = true; | |
4262 | ||
4263 | /* Target has to redefine TARGET_GET_DRAP_RTX to support stack | |
4264 | alignment. */ | |
4265 | gcc_assert (targetm.calls.get_drap_rtx != NULL); | |
b8698a0f | 4266 | drap_rtx = targetm.calls.get_drap_rtx (); |
2e3f842f | 4267 | |
d015f7cc L |
4268 | /* stack_realign_drap and drap_rtx must match. */ |
4269 | gcc_assert ((stack_realign_drap != 0) == (drap_rtx != NULL)); | |
4270 | ||
2e3f842f L |
4271 | /* Do nothing if NULL is returned, which means DRAP is not needed. */ |
4272 | if (NULL != drap_rtx) | |
4273 | { | |
4274 | crtl->args.internal_arg_pointer = drap_rtx; | |
4275 | ||
4276 | /* Call fixup_tail_calls to clean up REG_EQUIV note if DRAP is | |
4277 | needed. */ | |
4278 | fixup_tail_calls (); | |
4279 | } | |
4280 | } | |
4281 | ||
242229bb JH |
4282 | /* Translate the intermediate representation contained in the CFG |
4283 | from GIMPLE trees to RTL. | |
4284 | ||
4285 | We do conversion per basic block and preserve/update the tree CFG. | |
4286 | This implies we have to do some magic as the CFG can simultaneously | |
4287 | consist of basic blocks containing RTL and GIMPLE trees. This can | |
61ada8ae | 4288 | confuse the CFG hooks, so be careful to not manipulate CFG during |
242229bb JH |
4289 | the expansion. */ |
4290 | ||
c2924966 | 4291 | static unsigned int |
726a989a | 4292 | gimple_expand_cfg (void) |
242229bb JH |
4293 | { |
4294 | basic_block bb, init_block; | |
4295 | sbitmap blocks; | |
0ef90296 ZD |
4296 | edge_iterator ei; |
4297 | edge e; | |
3a42502d | 4298 | rtx var_seq; |
4e3825db MM |
4299 | unsigned i; |
4300 | ||
f029db69 | 4301 | timevar_push (TV_OUT_OF_SSA); |
4e3825db | 4302 | rewrite_out_of_ssa (&SA); |
f029db69 | 4303 | timevar_pop (TV_OUT_OF_SSA); |
c302207e | 4304 | SA.partition_to_pseudo = XCNEWVEC (rtx, SA.map->num_partitions); |
242229bb | 4305 | |
be147e84 RG |
4306 | /* Make sure all values used by the optimization passes have sane |
4307 | defaults. */ | |
4308 | reg_renumber = 0; | |
4309 | ||
4586b4ca SB |
4310 | /* Some backends want to know that we are expanding to RTL. */ |
4311 | currently_expanding_to_rtl = 1; | |
cd7d9fd7 RG |
4312 | /* Dominators are not kept up-to-date as we may create new basic-blocks. */ |
4313 | free_dominance_info (CDI_DOMINATORS); | |
4586b4ca | 4314 | |
bf08ebeb JH |
4315 | rtl_profile_for_bb (ENTRY_BLOCK_PTR); |
4316 | ||
5368224f | 4317 | insn_locations_init (); |
fe8a7779 | 4318 | if (!DECL_IS_BUILTIN (current_function_decl)) |
1751ecd6 AH |
4319 | { |
4320 | /* Eventually, all FEs should explicitly set function_start_locus. */ | |
5368224f DC |
4321 | if (IS_UNKNOWN_LOCATION (cfun->function_start_locus)) |
4322 | set_curr_insn_location | |
1751ecd6 AH |
4323 | (DECL_SOURCE_LOCATION (current_function_decl)); |
4324 | else | |
5368224f | 4325 | set_curr_insn_location (cfun->function_start_locus); |
1751ecd6 | 4326 | } |
9ff70652 | 4327 | else |
5368224f DC |
4328 | set_curr_insn_location (UNKNOWN_LOCATION); |
4329 | prologue_location = curr_insn_location (); | |
55e092c4 | 4330 | |
2b21299c JJ |
4331 | #ifdef INSN_SCHEDULING |
4332 | init_sched_attrs (); | |
4333 | #endif | |
4334 | ||
55e092c4 JH |
4335 | /* Make sure first insn is a note even if we don't want linenums. |
4336 | This makes sure the first insn will never be deleted. | |
4337 | Also, final expects a note to appear there. */ | |
4338 | emit_note (NOTE_INSN_DELETED); | |
6429e3be | 4339 | |
a1b23b2f UW |
4340 | /* Mark arrays indexed with non-constant indices with TREE_ADDRESSABLE. */ |
4341 | discover_nonconstant_array_refs (); | |
4342 | ||
e41b2a33 | 4343 | targetm.expand_to_rtl_hook (); |
cb91fab0 | 4344 | crtl->stack_alignment_needed = STACK_BOUNDARY; |
2e3f842f | 4345 | crtl->max_used_stack_slot_alignment = STACK_BOUNDARY; |
890b9b96 | 4346 | crtl->stack_alignment_estimated = 0; |
cb91fab0 JH |
4347 | crtl->preferred_stack_boundary = STACK_BOUNDARY; |
4348 | cfun->cfg->max_jumptable_ents = 0; | |
4349 | ||
ae9fd6b7 JH |
4350 | /* Resovle the function section. Some targets, like ARM EABI rely on knowledge |
4351 | of the function section at exapnsion time to predict distance of calls. */ | |
4352 | resolve_unique_section (current_function_decl, 0, flag_function_sections); | |
4353 | ||
727a31fa | 4354 | /* Expand the variables recorded during gimple lowering. */ |
f029db69 | 4355 | timevar_push (TV_VAR_EXPAND); |
3a42502d RH |
4356 | start_sequence (); |
4357 | ||
242229bb | 4358 | expand_used_vars (); |
3a42502d RH |
4359 | |
4360 | var_seq = get_insns (); | |
4361 | end_sequence (); | |
f029db69 | 4362 | timevar_pop (TV_VAR_EXPAND); |
242229bb | 4363 | |
7d69de61 RH |
4364 | /* Honor stack protection warnings. */ |
4365 | if (warn_stack_protect) | |
4366 | { | |
e3b5732b | 4367 | if (cfun->calls_alloca) |
b8698a0f | 4368 | warning (OPT_Wstack_protector, |
3b123595 SB |
4369 | "stack protector not protecting local variables: " |
4370 | "variable length buffer"); | |
cb91fab0 | 4371 | if (has_short_buffer && !crtl->stack_protect_guard) |
b8698a0f | 4372 | warning (OPT_Wstack_protector, |
3b123595 SB |
4373 | "stack protector not protecting function: " |
4374 | "all local arrays are less than %d bytes long", | |
7d69de61 RH |
4375 | (int) PARAM_VALUE (PARAM_SSP_BUFFER_SIZE)); |
4376 | } | |
4377 | ||
242229bb | 4378 | /* Set up parameters and prepare for return, for the function. */ |
b79c5284 | 4379 | expand_function_start (current_function_decl); |
242229bb | 4380 | |
3a42502d RH |
4381 | /* If we emitted any instructions for setting up the variables, |
4382 | emit them before the FUNCTION_START note. */ | |
4383 | if (var_seq) | |
4384 | { | |
4385 | emit_insn_before (var_seq, parm_birth_insn); | |
4386 | ||
4387 | /* In expand_function_end we'll insert the alloca save/restore | |
4388 | before parm_birth_insn. We've just insertted an alloca call. | |
4389 | Adjust the pointer to match. */ | |
4390 | parm_birth_insn = var_seq; | |
4391 | } | |
4392 | ||
4e3825db MM |
4393 | /* Now that we also have the parameter RTXs, copy them over to our |
4394 | partitions. */ | |
4395 | for (i = 0; i < SA.map->num_partitions; i++) | |
4396 | { | |
4397 | tree var = SSA_NAME_VAR (partition_to_var (SA.map, i)); | |
4398 | ||
4399 | if (TREE_CODE (var) != VAR_DECL | |
4400 | && !SA.partition_to_pseudo[i]) | |
4401 | SA.partition_to_pseudo[i] = DECL_RTL_IF_SET (var); | |
4402 | gcc_assert (SA.partition_to_pseudo[i]); | |
eb7adebc MM |
4403 | |
4404 | /* If this decl was marked as living in multiple places, reset | |
4405 | this now to NULL. */ | |
4406 | if (DECL_RTL_IF_SET (var) == pc_rtx) | |
4407 | SET_DECL_RTL (var, NULL); | |
4408 | ||
4e3825db MM |
4409 | /* Some RTL parts really want to look at DECL_RTL(x) when x |
4410 | was a decl marked in REG_ATTR or MEM_ATTR. We could use | |
4411 | SET_DECL_RTL here making this available, but that would mean | |
4412 | to select one of the potentially many RTLs for one DECL. Instead | |
4413 | of doing that we simply reset the MEM_EXPR of the RTL in question, | |
4414 | then nobody can get at it and hence nobody can call DECL_RTL on it. */ | |
4415 | if (!DECL_RTL_SET_P (var)) | |
4416 | { | |
4417 | if (MEM_P (SA.partition_to_pseudo[i])) | |
4418 | set_mem_expr (SA.partition_to_pseudo[i], NULL); | |
4419 | } | |
4420 | } | |
4421 | ||
d466b407 MM |
4422 | /* If we have a class containing differently aligned pointers |
4423 | we need to merge those into the corresponding RTL pointer | |
4424 | alignment. */ | |
4425 | for (i = 1; i < num_ssa_names; i++) | |
4426 | { | |
4427 | tree name = ssa_name (i); | |
4428 | int part; | |
4429 | rtx r; | |
4430 | ||
4431 | if (!name | |
d466b407 MM |
4432 | /* We might have generated new SSA names in |
4433 | update_alias_info_with_stack_vars. They will have a NULL | |
4434 | defining statements, and won't be part of the partitioning, | |
4435 | so ignore those. */ | |
4436 | || !SSA_NAME_DEF_STMT (name)) | |
4437 | continue; | |
4438 | part = var_to_partition (SA.map, name); | |
4439 | if (part == NO_PARTITION) | |
4440 | continue; | |
70b5e7dc RG |
4441 | |
4442 | /* Adjust all partition members to get the underlying decl of | |
4443 | the representative which we might have created in expand_one_var. */ | |
4444 | if (SSA_NAME_VAR (name) == NULL_TREE) | |
4445 | { | |
4446 | tree leader = partition_to_var (SA.map, part); | |
4447 | gcc_assert (SSA_NAME_VAR (leader) != NULL_TREE); | |
4448 | replace_ssa_name_symbol (name, SSA_NAME_VAR (leader)); | |
4449 | } | |
4450 | if (!POINTER_TYPE_P (TREE_TYPE (name))) | |
4451 | continue; | |
4452 | ||
d466b407 MM |
4453 | r = SA.partition_to_pseudo[part]; |
4454 | if (REG_P (r)) | |
4455 | mark_reg_pointer (r, get_pointer_alignment (name)); | |
4456 | } | |
4457 | ||
242229bb JH |
4458 | /* If this function is `main', emit a call to `__main' |
4459 | to run global initializers, etc. */ | |
4460 | if (DECL_NAME (current_function_decl) | |
4461 | && MAIN_NAME_P (DECL_NAME (current_function_decl)) | |
4462 | && DECL_FILE_SCOPE_P (current_function_decl)) | |
4463 | expand_main_function (); | |
4464 | ||
7d69de61 RH |
4465 | /* Initialize the stack_protect_guard field. This must happen after the |
4466 | call to __main (if any) so that the external decl is initialized. */ | |
cb91fab0 | 4467 | if (crtl->stack_protect_guard) |
7d69de61 RH |
4468 | stack_protect_prologue (); |
4469 | ||
4e3825db MM |
4470 | expand_phi_nodes (&SA); |
4471 | ||
3fbd86b1 | 4472 | /* Register rtl specific functions for cfg. */ |
242229bb JH |
4473 | rtl_register_cfg_hooks (); |
4474 | ||
4475 | init_block = construct_init_block (); | |
4476 | ||
0ef90296 | 4477 | /* Clear EDGE_EXECUTABLE on the entry edge(s). It is cleaned from the |
4e3825db | 4478 | remaining edges later. */ |
0ef90296 ZD |
4479 | FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) |
4480 | e->flags &= ~EDGE_EXECUTABLE; | |
4481 | ||
8b11009b | 4482 | lab_rtx_for_bb = pointer_map_create (); |
242229bb | 4483 | FOR_BB_BETWEEN (bb, init_block->next_bb, EXIT_BLOCK_PTR, next_bb) |
10d22567 | 4484 | bb = expand_gimple_basic_block (bb); |
bf08ebeb | 4485 | |
b5b8b0ac AO |
4486 | if (MAY_HAVE_DEBUG_INSNS) |
4487 | expand_debug_locations (); | |
4488 | ||
452aa9c5 RG |
4489 | /* Free stuff we no longer need after GIMPLE optimizations. */ |
4490 | free_dominance_info (CDI_DOMINATORS); | |
4491 | free_dominance_info (CDI_POST_DOMINATORS); | |
4492 | delete_tree_cfg_annotations (); | |
4493 | ||
f029db69 | 4494 | timevar_push (TV_OUT_OF_SSA); |
4e3825db | 4495 | finish_out_of_ssa (&SA); |
f029db69 | 4496 | timevar_pop (TV_OUT_OF_SSA); |
4e3825db | 4497 | |
f029db69 | 4498 | timevar_push (TV_POST_EXPAND); |
91753e21 RG |
4499 | /* We are no longer in SSA form. */ |
4500 | cfun->gimple_df->in_ssa_p = false; | |
7d776ee2 RG |
4501 | if (current_loops) |
4502 | loops_state_clear (LOOP_CLOSED_SSA); | |
91753e21 | 4503 | |
bf08ebeb JH |
4504 | /* Expansion is used by optimization passes too, set maybe_hot_insn_p |
4505 | conservatively to true until they are all profile aware. */ | |
8b11009b | 4506 | pointer_map_destroy (lab_rtx_for_bb); |
cb91fab0 | 4507 | free_histograms (); |
242229bb JH |
4508 | |
4509 | construct_exit_block (); | |
5368224f | 4510 | insn_locations_finalize (); |
242229bb | 4511 | |
1d65f45c | 4512 | /* Zap the tree EH table. */ |
e8a2a782 | 4513 | set_eh_throw_stmt_table (cfun, NULL); |
242229bb | 4514 | |
42821aff MM |
4515 | /* We need JUMP_LABEL be set in order to redirect jumps, and hence |
4516 | split edges which edge insertions might do. */ | |
242229bb | 4517 | rebuild_jump_labels (get_insns ()); |
242229bb | 4518 | |
4e3825db MM |
4519 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb) |
4520 | { | |
4521 | edge e; | |
4522 | edge_iterator ei; | |
4523 | for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) | |
4524 | { | |
4525 | if (e->insns.r) | |
bc470c24 | 4526 | { |
42821aff | 4527 | rebuild_jump_labels_chain (e->insns.r); |
bc470c24 JJ |
4528 | /* Avoid putting insns before parm_birth_insn. */ |
4529 | if (e->src == ENTRY_BLOCK_PTR | |
4530 | && single_succ_p (ENTRY_BLOCK_PTR) | |
4531 | && parm_birth_insn) | |
4532 | { | |
4533 | rtx insns = e->insns.r; | |
4534 | e->insns.r = NULL_RTX; | |
4535 | emit_insn_after_noloc (insns, parm_birth_insn, e->dest); | |
4536 | } | |
4537 | else | |
4538 | commit_one_edge_insertion (e); | |
4539 | } | |
4e3825db MM |
4540 | else |
4541 | ei_next (&ei); | |
4542 | } | |
4543 | } | |
4544 | ||
4545 | /* We're done expanding trees to RTL. */ | |
4546 | currently_expanding_to_rtl = 0; | |
4547 | ||
4548 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR->next_bb, EXIT_BLOCK_PTR, next_bb) | |
4549 | { | |
4550 | edge e; | |
4551 | edge_iterator ei; | |
4552 | for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) | |
4553 | { | |
4554 | /* Clear EDGE_EXECUTABLE. This flag is never used in the backend. */ | |
4555 | e->flags &= ~EDGE_EXECUTABLE; | |
4556 | ||
4557 | /* At the moment not all abnormal edges match the RTL | |
4558 | representation. It is safe to remove them here as | |
4559 | find_many_sub_basic_blocks will rediscover them. | |
4560 | In the future we should get this fixed properly. */ | |
4561 | if ((e->flags & EDGE_ABNORMAL) | |
4562 | && !(e->flags & EDGE_SIBCALL)) | |
4563 | remove_edge (e); | |
4564 | else | |
4565 | ei_next (&ei); | |
4566 | } | |
4567 | } | |
4568 | ||
242229bb JH |
4569 | blocks = sbitmap_alloc (last_basic_block); |
4570 | sbitmap_ones (blocks); | |
4571 | find_many_sub_basic_blocks (blocks); | |
242229bb | 4572 | sbitmap_free (blocks); |
4e3825db | 4573 | purge_all_dead_edges (); |
242229bb | 4574 | |
2e3f842f L |
4575 | expand_stack_alignment (); |
4576 | ||
be147e84 RG |
4577 | /* Fixup REG_EQUIV notes in the prologue if there are tailcalls in this |
4578 | function. */ | |
4579 | if (crtl->tail_call_emit) | |
4580 | fixup_tail_calls (); | |
4581 | ||
dac1fbf8 RG |
4582 | /* After initial rtl generation, call back to finish generating |
4583 | exception support code. We need to do this before cleaning up | |
4584 | the CFG as the code does not expect dead landing pads. */ | |
4585 | if (cfun->eh->region_tree != NULL) | |
4586 | finish_eh_generation (); | |
4587 | ||
4588 | /* Remove unreachable blocks, otherwise we cannot compute dominators | |
4589 | which are needed for loop state verification. As a side-effect | |
4590 | this also compacts blocks. | |
4591 | ??? We cannot remove trivially dead insns here as for example | |
4592 | the DRAP reg on i?86 is not magically live at this point. | |
4593 | gcc.c-torture/execute/ipa-sra-2.c execution, -Os -m32 fails otherwise. */ | |
4594 | cleanup_cfg (CLEANUP_NO_INSN_DEL); | |
4595 | ||
242229bb | 4596 | #ifdef ENABLE_CHECKING |
62e5bf5d | 4597 | verify_flow_info (); |
242229bb | 4598 | #endif |
9f8628ba | 4599 | |
be147e84 RG |
4600 | /* Initialize pseudos allocated for hard registers. */ |
4601 | emit_initial_value_sets (); | |
4602 | ||
4603 | /* And finally unshare all RTL. */ | |
4604 | unshare_all_rtl (); | |
4605 | ||
9f8628ba PB |
4606 | /* There's no need to defer outputting this function any more; we |
4607 | know we want to output it. */ | |
4608 | DECL_DEFER_OUTPUT (current_function_decl) = 0; | |
4609 | ||
4610 | /* Now that we're done expanding trees to RTL, we shouldn't have any | |
4611 | more CONCATs anywhere. */ | |
4612 | generating_concat_p = 0; | |
4613 | ||
b7211528 SB |
4614 | if (dump_file) |
4615 | { | |
4616 | fprintf (dump_file, | |
4617 | "\n\n;;\n;; Full RTL generated for this function:\n;;\n"); | |
4618 | /* And the pass manager will dump RTL for us. */ | |
4619 | } | |
ef330312 PB |
4620 | |
4621 | /* If we're emitting a nested function, make sure its parent gets | |
4622 | emitted as well. Doing otherwise confuses debug info. */ | |
c22cacf3 | 4623 | { |
ef330312 PB |
4624 | tree parent; |
4625 | for (parent = DECL_CONTEXT (current_function_decl); | |
c22cacf3 MS |
4626 | parent != NULL_TREE; |
4627 | parent = get_containing_scope (parent)) | |
ef330312 | 4628 | if (TREE_CODE (parent) == FUNCTION_DECL) |
c22cacf3 | 4629 | TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (parent)) = 1; |
ef330312 | 4630 | } |
c22cacf3 | 4631 | |
ef330312 PB |
4632 | /* We are now committed to emitting code for this function. Do any |
4633 | preparation, such as emitting abstract debug info for the inline | |
4634 | before it gets mangled by optimization. */ | |
4635 | if (cgraph_function_possibly_inlined_p (current_function_decl)) | |
4636 | (*debug_hooks->outlining_inline_function) (current_function_decl); | |
4637 | ||
4638 | TREE_ASM_WRITTEN (current_function_decl) = 1; | |
4bb1e037 AP |
4639 | |
4640 | /* After expanding, the return labels are no longer needed. */ | |
4641 | return_label = NULL; | |
4642 | naked_return_label = NULL; | |
0a35513e AH |
4643 | |
4644 | /* After expanding, the tm_restart map is no longer needed. */ | |
4645 | if (cfun->gimple_df->tm_restart) | |
4646 | { | |
4647 | htab_delete (cfun->gimple_df->tm_restart); | |
4648 | cfun->gimple_df->tm_restart = NULL; | |
4649 | } | |
4650 | ||
55e092c4 JH |
4651 | /* Tag the blocks with a depth number so that change_scope can find |
4652 | the common parent easily. */ | |
4653 | set_block_levels (DECL_INITIAL (cfun->decl), 0); | |
bf08ebeb | 4654 | default_rtl_profile (); |
be147e84 | 4655 | |
f029db69 | 4656 | timevar_pop (TV_POST_EXPAND); |
be147e84 | 4657 | |
c2924966 | 4658 | return 0; |
242229bb JH |
4659 | } |
4660 | ||
e3b5732b | 4661 | struct rtl_opt_pass pass_expand = |
242229bb | 4662 | { |
8ddbbcae | 4663 | { |
e3b5732b | 4664 | RTL_PASS, |
c22cacf3 | 4665 | "expand", /* name */ |
242229bb | 4666 | NULL, /* gate */ |
726a989a | 4667 | gimple_expand_cfg, /* execute */ |
242229bb JH |
4668 | NULL, /* sub */ |
4669 | NULL, /* next */ | |
4670 | 0, /* static_pass_number */ | |
c22cacf3 | 4671 | TV_EXPAND, /* tv_id */ |
688a482d RG |
4672 | PROP_ssa | PROP_gimple_leh | PROP_cfg |
4673 | | PROP_gimple_lcx, /* properties_required */ | |
242229bb | 4674 | PROP_rtl, /* properties_provided */ |
4e3825db MM |
4675 | PROP_ssa | PROP_trees, /* properties_destroyed */ |
4676 | TODO_verify_ssa | TODO_verify_flow | |
4677 | | TODO_verify_stmts, /* todo_flags_start */ | |
22c5fa5f | 4678 | TODO_ggc_collect /* todo_flags_finish */ |
8ddbbcae | 4679 | } |
242229bb | 4680 | }; |