1 /* A pass for lowering trees to RTL.
2 Copyright (C) 2004-2017 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3, or (at your option)
11 GCC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
22 #include "coretypes.h"
29 #include "tree-pass.h"
34 #include "regs.h" /* For reg_renumber. */
38 #include "diagnostic.h"
39 #include "fold-const.h"
41 #include "stor-layout.h"
43 #include "print-tree.h"
47 #include "cfgcleanup.h"
52 #include "internal-fn.h"
54 #include "gimple-iterator.h"
55 #include "gimple-expr.h"
56 #include "gimple-walk.h"
61 #include "gimple-pretty-print.h"
65 #include "tree-inline.h"
66 #include "value-prof.h"
67 #include "tree-ssa-live.h"
68 #include "tree-outof-ssa.h"
70 #include "insn-attr.h" /* For INSN_SCHEDULING. */
72 #include "tree-ssa-address.h"
75 #include "tree-chkp.h"
78 /* Some systems use __main in a way incompatible with its use in gcc, in these
79 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
80 give the same symbol without quotes for an alternative entry point. You
81 must define both, or neither. */
83 #define NAME__MAIN "__main"
86 /* This variable holds information helping the rewriting of SSA trees
90 /* This variable holds the currently expanded gimple statement for purposes
91 of comminucating the profile info to the builtin expanders. */
92 gimple
*currently_expanding_gimple_stmt
;
94 static rtx
expand_debug_expr (tree
);
96 static bool defer_stack_allocation (tree
, bool);
98 static void record_alignment_for_reg_var (unsigned int);
100 /* Return an expression tree corresponding to the RHS of GIMPLE
104 gimple_assign_rhs_to_tree (gimple
*stmt
)
107 enum gimple_rhs_class grhs_class
;
109 grhs_class
= get_gimple_rhs_class (gimple_expr_code (stmt
));
111 if (grhs_class
== GIMPLE_TERNARY_RHS
)
112 t
= build3 (gimple_assign_rhs_code (stmt
),
113 TREE_TYPE (gimple_assign_lhs (stmt
)),
114 gimple_assign_rhs1 (stmt
),
115 gimple_assign_rhs2 (stmt
),
116 gimple_assign_rhs3 (stmt
));
117 else if (grhs_class
== GIMPLE_BINARY_RHS
)
118 t
= build2 (gimple_assign_rhs_code (stmt
),
119 TREE_TYPE (gimple_assign_lhs (stmt
)),
120 gimple_assign_rhs1 (stmt
),
121 gimple_assign_rhs2 (stmt
));
122 else if (grhs_class
== GIMPLE_UNARY_RHS
)
123 t
= build1 (gimple_assign_rhs_code (stmt
),
124 TREE_TYPE (gimple_assign_lhs (stmt
)),
125 gimple_assign_rhs1 (stmt
));
126 else if (grhs_class
== GIMPLE_SINGLE_RHS
)
128 t
= gimple_assign_rhs1 (stmt
);
129 /* Avoid modifying this tree in place below. */
130 if ((gimple_has_location (stmt
) && CAN_HAVE_LOCATION_P (t
)
131 && gimple_location (stmt
) != EXPR_LOCATION (t
))
132 || (gimple_block (stmt
)
133 && currently_expanding_to_rtl
140 if (gimple_has_location (stmt
) && CAN_HAVE_LOCATION_P (t
))
141 SET_EXPR_LOCATION (t
, gimple_location (stmt
));
147 #ifndef STACK_ALIGNMENT_NEEDED
148 #define STACK_ALIGNMENT_NEEDED 1
151 #define SSAVAR(x) (TREE_CODE (x) == SSA_NAME ? SSA_NAME_VAR (x) : x)
153 /* Choose either CUR or NEXT as the leader DECL for a partition.
154 Prefer ignored decls, to simplify debug dumps and reduce ambiguity
155 out of the same user variable being in multiple partitions (this is
156 less likely for compiler-introduced temps). */
159 leader_merge (tree cur
, tree next
)
161 if (cur
== NULL
|| cur
== next
)
164 if (DECL_P (cur
) && DECL_IGNORED_P (cur
))
167 if (DECL_P (next
) && DECL_IGNORED_P (next
))
173 /* Associate declaration T with storage space X. If T is no
174 SSA name this is exactly SET_DECL_RTL, otherwise make the
175 partition of T associated with X. */
177 set_rtl (tree t
, rtx x
)
179 gcc_checking_assert (!x
180 || !(TREE_CODE (t
) == SSA_NAME
|| is_gimple_reg (t
))
181 || (use_register_for_decl (t
)
183 || (GET_CODE (x
) == CONCAT
184 && (REG_P (XEXP (x
, 0))
185 || SUBREG_P (XEXP (x
, 0)))
186 && (REG_P (XEXP (x
, 1))
187 || SUBREG_P (XEXP (x
, 1))))
188 /* We need to accept PARALLELs for RESUT_DECLs
189 because of vector types with BLKmode returned
190 in multiple registers, but they are supposed
191 to be uncoalesced. */
192 || (GET_CODE (x
) == PARALLEL
194 && TREE_CODE (SSAVAR (t
)) == RESULT_DECL
195 && (GET_MODE (x
) == BLKmode
196 || !flag_tree_coalesce_vars
)))
197 : (MEM_P (x
) || x
== pc_rtx
198 || (GET_CODE (x
) == CONCAT
199 && MEM_P (XEXP (x
, 0))
200 && MEM_P (XEXP (x
, 1))))));
201 /* Check that the RTL for SSA_NAMEs and gimple-reg PARM_DECLs and
202 RESULT_DECLs has the expected mode. For memory, we accept
203 unpromoted modes, since that's what we're likely to get. For
204 PARM_DECLs and RESULT_DECLs, we'll have been called by
205 set_parm_rtl, which will give us the default def, so we don't
206 have to compute it ourselves. For RESULT_DECLs, we accept mode
207 mismatches too, as long as we have BLKmode or are not coalescing
208 across variables, so that we don't reject BLKmode PARALLELs or
210 gcc_checking_assert (!x
|| x
== pc_rtx
|| TREE_CODE (t
) != SSA_NAME
212 && TREE_CODE (SSAVAR (t
)) == RESULT_DECL
213 && (promote_ssa_mode (t
, NULL
) == BLKmode
214 || !flag_tree_coalesce_vars
))
215 || !use_register_for_decl (t
)
216 || GET_MODE (x
) == promote_ssa_mode (t
, NULL
));
221 tree cur
= NULL_TREE
;
229 else if (SUBREG_P (xm
))
231 gcc_assert (subreg_lowpart_p (xm
));
232 xm
= SUBREG_REG (xm
);
235 else if (GET_CODE (xm
) == CONCAT
)
240 else if (GET_CODE (xm
) == PARALLEL
)
242 xm
= XVECEXP (xm
, 0, 0);
243 gcc_assert (GET_CODE (xm
) == EXPR_LIST
);
247 else if (xm
== pc_rtx
)
252 tree next
= skip
? cur
: leader_merge (cur
, SSAVAR (t
) ? SSAVAR (t
) : t
);
257 set_mem_attributes (x
,
258 next
&& TREE_CODE (next
) == SSA_NAME
262 set_reg_attrs_for_decl_rtl (next
, x
);
266 if (TREE_CODE (t
) == SSA_NAME
)
268 int part
= var_to_partition (SA
.map
, t
);
269 if (part
!= NO_PARTITION
)
271 if (SA
.partition_to_pseudo
[part
])
272 gcc_assert (SA
.partition_to_pseudo
[part
] == x
);
273 else if (x
!= pc_rtx
)
274 SA
.partition_to_pseudo
[part
] = x
;
276 /* For the benefit of debug information at -O0 (where
277 vartracking doesn't run) record the place also in the base
278 DECL. For PARMs and RESULTs, do so only when setting the
280 if (x
&& x
!= pc_rtx
&& SSA_NAME_VAR (t
)
281 && (VAR_P (SSA_NAME_VAR (t
))
282 || SSA_NAME_IS_DEFAULT_DEF (t
)))
284 tree var
= SSA_NAME_VAR (t
);
285 /* If we don't yet have something recorded, just record it now. */
286 if (!DECL_RTL_SET_P (var
))
287 SET_DECL_RTL (var
, x
);
288 /* If we have it set already to "multiple places" don't
290 else if (DECL_RTL (var
) == pc_rtx
)
292 /* If we have something recorded and it's not the same place
293 as we want to record now, we have multiple partitions for the
294 same base variable, with different places. We can't just
295 randomly chose one, hence we have to say that we don't know.
296 This only happens with optimization, and there var-tracking
297 will figure out the right thing. */
298 else if (DECL_RTL (var
) != x
)
299 SET_DECL_RTL (var
, pc_rtx
);
306 /* This structure holds data relevant to one variable that will be
307 placed in a stack slot. */
313 /* Initially, the size of the variable. Later, the size of the partition,
314 if this variable becomes it's partition's representative. */
317 /* The *byte* alignment required for this variable. Or as, with the
318 size, the alignment for this partition. */
321 /* The partition representative. */
322 size_t representative
;
324 /* The next stack variable in the partition, or EOC. */
327 /* The numbers of conflicting stack variables. */
331 #define EOC ((size_t)-1)
333 /* We have an array of such objects while deciding allocation. */
334 static struct stack_var
*stack_vars
;
335 static size_t stack_vars_alloc
;
336 static size_t stack_vars_num
;
337 static hash_map
<tree
, size_t> *decl_to_stack_part
;
339 /* Conflict bitmaps go on this obstack. This allows us to destroy
340 all of them in one big sweep. */
341 static bitmap_obstack stack_var_bitmap_obstack
;
343 /* An array of indices such that stack_vars[stack_vars_sorted[i]].size
344 is non-decreasing. */
345 static size_t *stack_vars_sorted
;
347 /* The phase of the stack frame. This is the known misalignment of
348 virtual_stack_vars_rtx from PREFERRED_STACK_BOUNDARY. That is,
349 (frame_offset+frame_phase) % PREFERRED_STACK_BOUNDARY == 0. */
350 static int frame_phase
;
352 /* Used during expand_used_vars to remember if we saw any decls for
353 which we'd like to enable stack smashing protection. */
354 static bool has_protected_decls
;
356 /* Used during expand_used_vars. Remember if we say a character buffer
357 smaller than our cutoff threshold. Used for -Wstack-protector. */
358 static bool has_short_buffer
;
360 /* Compute the byte alignment to use for DECL. Ignore alignment
361 we can't do with expected alignment of the stack boundary. */
364 align_local_variable (tree decl
)
368 if (TREE_CODE (decl
) == SSA_NAME
)
369 align
= TYPE_ALIGN (TREE_TYPE (decl
));
372 align
= LOCAL_DECL_ALIGNMENT (decl
);
373 SET_DECL_ALIGN (decl
, align
);
375 return align
/ BITS_PER_UNIT
;
378 /* Align given offset BASE with ALIGN. Truncate up if ALIGN_UP is true,
379 down otherwise. Return truncated BASE value. */
381 static inline unsigned HOST_WIDE_INT
382 align_base (HOST_WIDE_INT base
, unsigned HOST_WIDE_INT align
, bool align_up
)
384 return align_up
? (base
+ align
- 1) & -align
: base
& -align
;
387 /* Allocate SIZE bytes at byte alignment ALIGN from the stack frame.
388 Return the frame offset. */
391 alloc_stack_frame_space (HOST_WIDE_INT size
, unsigned HOST_WIDE_INT align
)
393 HOST_WIDE_INT offset
, new_frame_offset
;
395 if (FRAME_GROWS_DOWNWARD
)
398 = align_base (frame_offset
- frame_phase
- size
,
399 align
, false) + frame_phase
;
400 offset
= new_frame_offset
;
405 = align_base (frame_offset
- frame_phase
, align
, true) + frame_phase
;
406 offset
= new_frame_offset
;
407 new_frame_offset
+= size
;
409 frame_offset
= new_frame_offset
;
411 if (frame_offset_overflow (frame_offset
, cfun
->decl
))
412 frame_offset
= offset
= 0;
417 /* Accumulate DECL into STACK_VARS. */
420 add_stack_var (tree decl
)
424 if (stack_vars_num
>= stack_vars_alloc
)
426 if (stack_vars_alloc
)
427 stack_vars_alloc
= stack_vars_alloc
* 3 / 2;
429 stack_vars_alloc
= 32;
431 = XRESIZEVEC (struct stack_var
, stack_vars
, stack_vars_alloc
);
433 if (!decl_to_stack_part
)
434 decl_to_stack_part
= new hash_map
<tree
, size_t>;
436 v
= &stack_vars
[stack_vars_num
];
437 decl_to_stack_part
->put (decl
, stack_vars_num
);
440 tree size
= TREE_CODE (decl
) == SSA_NAME
441 ? TYPE_SIZE_UNIT (TREE_TYPE (decl
))
442 : DECL_SIZE_UNIT (decl
);
443 v
->size
= tree_to_uhwi (size
);
444 /* Ensure that all variables have size, so that &a != &b for any two
445 variables that are simultaneously live. */
448 v
->alignb
= align_local_variable (decl
);
449 /* An alignment of zero can mightily confuse us later. */
450 gcc_assert (v
->alignb
!= 0);
452 /* All variables are initially in their own partition. */
453 v
->representative
= stack_vars_num
;
456 /* All variables initially conflict with no other. */
459 /* Ensure that this decl doesn't get put onto the list twice. */
460 set_rtl (decl
, pc_rtx
);
465 /* Make the decls associated with luid's X and Y conflict. */
468 add_stack_var_conflict (size_t x
, size_t y
)
470 struct stack_var
*a
= &stack_vars
[x
];
471 struct stack_var
*b
= &stack_vars
[y
];
473 a
->conflicts
= BITMAP_ALLOC (&stack_var_bitmap_obstack
);
475 b
->conflicts
= BITMAP_ALLOC (&stack_var_bitmap_obstack
);
476 bitmap_set_bit (a
->conflicts
, y
);
477 bitmap_set_bit (b
->conflicts
, x
);
480 /* Check whether the decls associated with luid's X and Y conflict. */
483 stack_var_conflict_p (size_t x
, size_t y
)
485 struct stack_var
*a
= &stack_vars
[x
];
486 struct stack_var
*b
= &stack_vars
[y
];
489 /* Partitions containing an SSA name result from gimple registers
490 with things like unsupported modes. They are top-level and
491 hence conflict with everything else. */
492 if (TREE_CODE (a
->decl
) == SSA_NAME
|| TREE_CODE (b
->decl
) == SSA_NAME
)
495 if (!a
->conflicts
|| !b
->conflicts
)
497 return bitmap_bit_p (a
->conflicts
, y
);
500 /* Callback for walk_stmt_ops. If OP is a decl touched by add_stack_var
501 enter its partition number into bitmap DATA. */
504 visit_op (gimple
*, tree op
, tree
, void *data
)
506 bitmap active
= (bitmap
)data
;
507 op
= get_base_address (op
);
510 && DECL_RTL_IF_SET (op
) == pc_rtx
)
512 size_t *v
= decl_to_stack_part
->get (op
);
514 bitmap_set_bit (active
, *v
);
519 /* Callback for walk_stmt_ops. If OP is a decl touched by add_stack_var
520 record conflicts between it and all currently active other partitions
524 visit_conflict (gimple
*, tree op
, tree
, void *data
)
526 bitmap active
= (bitmap
)data
;
527 op
= get_base_address (op
);
530 && DECL_RTL_IF_SET (op
) == pc_rtx
)
532 size_t *v
= decl_to_stack_part
->get (op
);
533 if (v
&& bitmap_set_bit (active
, *v
))
538 gcc_assert (num
< stack_vars_num
);
539 EXECUTE_IF_SET_IN_BITMAP (active
, 0, i
, bi
)
540 add_stack_var_conflict (num
, i
);
546 /* Helper routine for add_scope_conflicts, calculating the active partitions
547 at the end of BB, leaving the result in WORK. We're called to generate
548 conflicts when FOR_CONFLICT is true, otherwise we're just tracking
552 add_scope_conflicts_1 (basic_block bb
, bitmap work
, bool for_conflict
)
556 gimple_stmt_iterator gsi
;
557 walk_stmt_load_store_addr_fn visit
;
560 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
561 bitmap_ior_into (work
, (bitmap
)e
->src
->aux
);
565 for (gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
567 gimple
*stmt
= gsi_stmt (gsi
);
568 walk_stmt_load_store_addr_ops (stmt
, work
, NULL
, NULL
, visit
);
570 for (gsi
= gsi_after_labels (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
572 gimple
*stmt
= gsi_stmt (gsi
);
574 if (gimple_clobber_p (stmt
))
576 tree lhs
= gimple_assign_lhs (stmt
);
578 /* Nested function lowering might introduce LHSs
579 that are COMPONENT_REFs. */
582 if (DECL_RTL_IF_SET (lhs
) == pc_rtx
583 && (v
= decl_to_stack_part
->get (lhs
)))
584 bitmap_clear_bit (work
, *v
);
586 else if (!is_gimple_debug (stmt
))
589 && visit
== visit_op
)
591 /* If this is the first real instruction in this BB we need
592 to add conflicts for everything live at this point now.
593 Unlike classical liveness for named objects we can't
594 rely on seeing a def/use of the names we're interested in.
595 There might merely be indirect loads/stores. We'd not add any
596 conflicts for such partitions. */
599 EXECUTE_IF_SET_IN_BITMAP (work
, 0, i
, bi
)
601 struct stack_var
*a
= &stack_vars
[i
];
603 a
->conflicts
= BITMAP_ALLOC (&stack_var_bitmap_obstack
);
604 bitmap_ior_into (a
->conflicts
, work
);
606 visit
= visit_conflict
;
608 walk_stmt_load_store_addr_ops (stmt
, work
, visit
, visit
, visit
);
613 /* Generate stack partition conflicts between all partitions that are
614 simultaneously live. */
617 add_scope_conflicts (void)
621 bitmap work
= BITMAP_ALLOC (NULL
);
625 /* We approximate the live range of a stack variable by taking the first
626 mention of its name as starting point(s), and by the end-of-scope
627 death clobber added by gimplify as ending point(s) of the range.
628 This overapproximates in the case we for instance moved an address-taken
629 operation upward, without also moving a dereference to it upwards.
630 But it's conservatively correct as a variable never can hold values
631 before its name is mentioned at least once.
633 We then do a mostly classical bitmap liveness algorithm. */
635 FOR_ALL_BB_FN (bb
, cfun
)
636 bb
->aux
= BITMAP_ALLOC (&stack_var_bitmap_obstack
);
638 rpo
= XNEWVEC (int, last_basic_block_for_fn (cfun
));
639 n_bbs
= pre_and_rev_post_order_compute (NULL
, rpo
, false);
646 for (i
= 0; i
< n_bbs
; i
++)
649 bb
= BASIC_BLOCK_FOR_FN (cfun
, rpo
[i
]);
650 active
= (bitmap
)bb
->aux
;
651 add_scope_conflicts_1 (bb
, work
, false);
652 if (bitmap_ior_into (active
, work
))
657 FOR_EACH_BB_FN (bb
, cfun
)
658 add_scope_conflicts_1 (bb
, work
, true);
662 FOR_ALL_BB_FN (bb
, cfun
)
663 BITMAP_FREE (bb
->aux
);
666 /* A subroutine of partition_stack_vars. A comparison function for qsort,
667 sorting an array of indices by the properties of the object. */
670 stack_var_cmp (const void *a
, const void *b
)
672 size_t ia
= *(const size_t *)a
;
673 size_t ib
= *(const size_t *)b
;
674 unsigned int aligna
= stack_vars
[ia
].alignb
;
675 unsigned int alignb
= stack_vars
[ib
].alignb
;
676 HOST_WIDE_INT sizea
= stack_vars
[ia
].size
;
677 HOST_WIDE_INT sizeb
= stack_vars
[ib
].size
;
678 tree decla
= stack_vars
[ia
].decl
;
679 tree declb
= stack_vars
[ib
].decl
;
681 unsigned int uida
, uidb
;
683 /* Primary compare on "large" alignment. Large comes first. */
684 largea
= (aligna
* BITS_PER_UNIT
> MAX_SUPPORTED_STACK_ALIGNMENT
);
685 largeb
= (alignb
* BITS_PER_UNIT
> MAX_SUPPORTED_STACK_ALIGNMENT
);
686 if (largea
!= largeb
)
687 return (int)largeb
- (int)largea
;
689 /* Secondary compare on size, decreasing */
695 /* Tertiary compare on true alignment, decreasing. */
701 /* Final compare on ID for sort stability, increasing.
702 Two SSA names are compared by their version, SSA names come before
703 non-SSA names, and two normal decls are compared by their DECL_UID. */
704 if (TREE_CODE (decla
) == SSA_NAME
)
706 if (TREE_CODE (declb
) == SSA_NAME
)
707 uida
= SSA_NAME_VERSION (decla
), uidb
= SSA_NAME_VERSION (declb
);
711 else if (TREE_CODE (declb
) == SSA_NAME
)
714 uida
= DECL_UID (decla
), uidb
= DECL_UID (declb
);
722 struct part_traits
: unbounded_int_hashmap_traits
<size_t, bitmap
> {};
723 typedef hash_map
<size_t, bitmap
, part_traits
> part_hashmap
;
725 /* If the points-to solution *PI points to variables that are in a partition
726 together with other variables add all partition members to the pointed-to
730 add_partitioned_vars_to_ptset (struct pt_solution
*pt
,
731 part_hashmap
*decls_to_partitions
,
732 hash_set
<bitmap
> *visited
, bitmap temp
)
740 /* The pointed-to vars bitmap is shared, it is enough to
742 || visited
->add (pt
->vars
))
747 /* By using a temporary bitmap to store all members of the partitions
748 we have to add we make sure to visit each of the partitions only
750 EXECUTE_IF_SET_IN_BITMAP (pt
->vars
, 0, i
, bi
)
752 || !bitmap_bit_p (temp
, i
))
753 && (part
= decls_to_partitions
->get (i
)))
754 bitmap_ior_into (temp
, *part
);
755 if (!bitmap_empty_p (temp
))
756 bitmap_ior_into (pt
->vars
, temp
);
759 /* Update points-to sets based on partition info, so we can use them on RTL.
760 The bitmaps representing stack partitions will be saved until expand,
761 where partitioned decls used as bases in memory expressions will be
765 update_alias_info_with_stack_vars (void)
767 part_hashmap
*decls_to_partitions
= NULL
;
769 tree var
= NULL_TREE
;
771 for (i
= 0; i
< stack_vars_num
; i
++)
775 struct ptr_info_def
*pi
;
777 /* Not interested in partitions with single variable. */
778 if (stack_vars
[i
].representative
!= i
779 || stack_vars
[i
].next
== EOC
)
782 if (!decls_to_partitions
)
784 decls_to_partitions
= new part_hashmap
;
785 cfun
->gimple_df
->decls_to_pointers
= new hash_map
<tree
, tree
>;
788 /* Create an SSA_NAME that points to the partition for use
789 as base during alias-oracle queries on RTL for bases that
790 have been partitioned. */
791 if (var
== NULL_TREE
)
792 var
= create_tmp_var (ptr_type_node
);
793 name
= make_ssa_name (var
);
795 /* Create bitmaps representing partitions. They will be used for
796 points-to sets later, so use GGC alloc. */
797 part
= BITMAP_GGC_ALLOC ();
798 for (j
= i
; j
!= EOC
; j
= stack_vars
[j
].next
)
800 tree decl
= stack_vars
[j
].decl
;
801 unsigned int uid
= DECL_PT_UID (decl
);
802 bitmap_set_bit (part
, uid
);
803 decls_to_partitions
->put (uid
, part
);
804 cfun
->gimple_df
->decls_to_pointers
->put (decl
, name
);
805 if (TREE_ADDRESSABLE (decl
))
806 TREE_ADDRESSABLE (name
) = 1;
809 /* Make the SSA name point to all partition members. */
810 pi
= get_ptr_info (name
);
811 pt_solution_set (&pi
->pt
, part
, false);
814 /* Make all points-to sets that contain one member of a partition
815 contain all members of the partition. */
816 if (decls_to_partitions
)
820 hash_set
<bitmap
> visited
;
821 bitmap temp
= BITMAP_ALLOC (&stack_var_bitmap_obstack
);
823 FOR_EACH_SSA_NAME (i
, name
, cfun
)
825 struct ptr_info_def
*pi
;
827 if (POINTER_TYPE_P (TREE_TYPE (name
))
828 && ((pi
= SSA_NAME_PTR_INFO (name
)) != NULL
))
829 add_partitioned_vars_to_ptset (&pi
->pt
, decls_to_partitions
,
833 add_partitioned_vars_to_ptset (&cfun
->gimple_df
->escaped
,
834 decls_to_partitions
, &visited
, temp
);
836 delete decls_to_partitions
;
841 /* A subroutine of partition_stack_vars. The UNION portion of a UNION/FIND
842 partitioning algorithm. Partitions A and B are known to be non-conflicting.
843 Merge them into a single partition A. */
846 union_stack_vars (size_t a
, size_t b
)
848 struct stack_var
*vb
= &stack_vars
[b
];
852 gcc_assert (stack_vars
[b
].next
== EOC
);
853 /* Add B to A's partition. */
854 stack_vars
[b
].next
= stack_vars
[a
].next
;
855 stack_vars
[b
].representative
= a
;
856 stack_vars
[a
].next
= b
;
858 /* Update the required alignment of partition A to account for B. */
859 if (stack_vars
[a
].alignb
< stack_vars
[b
].alignb
)
860 stack_vars
[a
].alignb
= stack_vars
[b
].alignb
;
862 /* Update the interference graph and merge the conflicts. */
865 EXECUTE_IF_SET_IN_BITMAP (vb
->conflicts
, 0, u
, bi
)
866 add_stack_var_conflict (a
, stack_vars
[u
].representative
);
867 BITMAP_FREE (vb
->conflicts
);
871 /* A subroutine of expand_used_vars. Binpack the variables into
872 partitions constrained by the interference graph. The overall
873 algorithm used is as follows:
875 Sort the objects by size in descending order.
880 Look for the largest non-conflicting object B with size <= S.
887 partition_stack_vars (void)
889 size_t si
, sj
, n
= stack_vars_num
;
891 stack_vars_sorted
= XNEWVEC (size_t, stack_vars_num
);
892 for (si
= 0; si
< n
; ++si
)
893 stack_vars_sorted
[si
] = si
;
898 qsort (stack_vars_sorted
, n
, sizeof (size_t), stack_var_cmp
);
900 for (si
= 0; si
< n
; ++si
)
902 size_t i
= stack_vars_sorted
[si
];
903 unsigned int ialign
= stack_vars
[i
].alignb
;
904 HOST_WIDE_INT isize
= stack_vars
[i
].size
;
906 /* Ignore objects that aren't partition representatives. If we
907 see a var that is not a partition representative, it must
908 have been merged earlier. */
909 if (stack_vars
[i
].representative
!= i
)
912 for (sj
= si
+ 1; sj
< n
; ++sj
)
914 size_t j
= stack_vars_sorted
[sj
];
915 unsigned int jalign
= stack_vars
[j
].alignb
;
916 HOST_WIDE_INT jsize
= stack_vars
[j
].size
;
918 /* Ignore objects that aren't partition representatives. */
919 if (stack_vars
[j
].representative
!= j
)
922 /* Do not mix objects of "small" (supported) alignment
923 and "large" (unsupported) alignment. */
924 if ((ialign
* BITS_PER_UNIT
<= MAX_SUPPORTED_STACK_ALIGNMENT
)
925 != (jalign
* BITS_PER_UNIT
<= MAX_SUPPORTED_STACK_ALIGNMENT
))
928 /* For Address Sanitizer do not mix objects with different
929 sizes, as the shorter vars wouldn't be adequately protected.
930 Don't do that for "large" (unsupported) alignment objects,
931 those aren't protected anyway. */
932 if ((asan_sanitize_stack_p ())
934 && ialign
* BITS_PER_UNIT
<= MAX_SUPPORTED_STACK_ALIGNMENT
)
937 /* Ignore conflicting objects. */
938 if (stack_var_conflict_p (i
, j
))
941 /* UNION the objects, placing J at OFFSET. */
942 union_stack_vars (i
, j
);
946 update_alias_info_with_stack_vars ();
949 /* A debugging aid for expand_used_vars. Dump the generated partitions. */
952 dump_stack_var_partition (void)
954 size_t si
, i
, j
, n
= stack_vars_num
;
956 for (si
= 0; si
< n
; ++si
)
958 i
= stack_vars_sorted
[si
];
960 /* Skip variables that aren't partition representatives, for now. */
961 if (stack_vars
[i
].representative
!= i
)
964 fprintf (dump_file
, "Partition %lu: size " HOST_WIDE_INT_PRINT_DEC
965 " align %u\n", (unsigned long) i
, stack_vars
[i
].size
,
966 stack_vars
[i
].alignb
);
968 for (j
= i
; j
!= EOC
; j
= stack_vars
[j
].next
)
970 fputc ('\t', dump_file
);
971 print_generic_expr (dump_file
, stack_vars
[j
].decl
, dump_flags
);
973 fputc ('\n', dump_file
);
977 /* Assign rtl to DECL at BASE + OFFSET. */
980 expand_one_stack_var_at (tree decl
, rtx base
, unsigned base_align
,
981 HOST_WIDE_INT offset
)
986 /* If this fails, we've overflowed the stack frame. Error nicely? */
987 gcc_assert (offset
== trunc_int_for_mode (offset
, Pmode
));
989 x
= plus_constant (Pmode
, base
, offset
);
990 x
= gen_rtx_MEM (TREE_CODE (decl
) == SSA_NAME
991 ? TYPE_MODE (TREE_TYPE (decl
))
992 : DECL_MODE (SSAVAR (decl
)), x
);
994 if (TREE_CODE (decl
) != SSA_NAME
)
996 /* Set alignment we actually gave this decl if it isn't an SSA name.
997 If it is we generate stack slots only accidentally so it isn't as
998 important, we'll simply use the alignment that is already set. */
999 if (base
== virtual_stack_vars_rtx
)
1000 offset
-= frame_phase
;
1001 align
= least_bit_hwi (offset
);
1002 align
*= BITS_PER_UNIT
;
1003 if (align
== 0 || align
> base_align
)
1006 /* One would think that we could assert that we're not decreasing
1007 alignment here, but (at least) the i386 port does exactly this
1008 via the MINIMUM_ALIGNMENT hook. */
1010 SET_DECL_ALIGN (decl
, align
);
1011 DECL_USER_ALIGN (decl
) = 0;
1017 struct stack_vars_data
1019 /* Vector of offset pairs, always end of some padding followed
1020 by start of the padding that needs Address Sanitizer protection.
1021 The vector is in reversed, highest offset pairs come first. */
1022 auto_vec
<HOST_WIDE_INT
> asan_vec
;
1024 /* Vector of partition representative decls in between the paddings. */
1025 auto_vec
<tree
> asan_decl_vec
;
1027 /* Base pseudo register for Address Sanitizer protected automatic vars. */
1030 /* Alignment needed for the Address Sanitizer protected automatic vars. */
1031 unsigned int asan_alignb
;
1034 /* A subroutine of expand_used_vars. Give each partition representative
1035 a unique location within the stack frame. Update each partition member
1036 with that location. */
1039 expand_stack_vars (bool (*pred
) (size_t), struct stack_vars_data
*data
)
1041 size_t si
, i
, j
, n
= stack_vars_num
;
1042 HOST_WIDE_INT large_size
= 0, large_alloc
= 0;
1043 rtx large_base
= NULL
;
1044 unsigned large_align
= 0;
1045 bool large_allocation_done
= false;
1048 /* Determine if there are any variables requiring "large" alignment.
1049 Since these are dynamically allocated, we only process these if
1050 no predicate involved. */
1051 large_align
= stack_vars
[stack_vars_sorted
[0]].alignb
* BITS_PER_UNIT
;
1052 if (pred
== NULL
&& large_align
> MAX_SUPPORTED_STACK_ALIGNMENT
)
1054 /* Find the total size of these variables. */
1055 for (si
= 0; si
< n
; ++si
)
1059 i
= stack_vars_sorted
[si
];
1060 alignb
= stack_vars
[i
].alignb
;
1062 /* All "large" alignment decls come before all "small" alignment
1063 decls, but "large" alignment decls are not sorted based on
1064 their alignment. Increase large_align to track the largest
1065 required alignment. */
1066 if ((alignb
* BITS_PER_UNIT
) > large_align
)
1067 large_align
= alignb
* BITS_PER_UNIT
;
1069 /* Stop when we get to the first decl with "small" alignment. */
1070 if (alignb
* BITS_PER_UNIT
<= MAX_SUPPORTED_STACK_ALIGNMENT
)
1073 /* Skip variables that aren't partition representatives. */
1074 if (stack_vars
[i
].representative
!= i
)
1077 /* Skip variables that have already had rtl assigned. See also
1078 add_stack_var where we perpetrate this pc_rtx hack. */
1079 decl
= stack_vars
[i
].decl
;
1080 if (TREE_CODE (decl
) == SSA_NAME
1081 ? SA
.partition_to_pseudo
[var_to_partition (SA
.map
, decl
)] != NULL_RTX
1082 : DECL_RTL (decl
) != pc_rtx
)
1085 large_size
+= alignb
- 1;
1086 large_size
&= -(HOST_WIDE_INT
)alignb
;
1087 large_size
+= stack_vars
[i
].size
;
1091 for (si
= 0; si
< n
; ++si
)
1094 unsigned base_align
, alignb
;
1095 HOST_WIDE_INT offset
;
1097 i
= stack_vars_sorted
[si
];
1099 /* Skip variables that aren't partition representatives, for now. */
1100 if (stack_vars
[i
].representative
!= i
)
1103 /* Skip variables that have already had rtl assigned. See also
1104 add_stack_var where we perpetrate this pc_rtx hack. */
1105 decl
= stack_vars
[i
].decl
;
1106 if (TREE_CODE (decl
) == SSA_NAME
1107 ? SA
.partition_to_pseudo
[var_to_partition (SA
.map
, decl
)] != NULL_RTX
1108 : DECL_RTL (decl
) != pc_rtx
)
1111 /* Check the predicate to see whether this variable should be
1112 allocated in this pass. */
1113 if (pred
&& !pred (i
))
1116 alignb
= stack_vars
[i
].alignb
;
1117 if (alignb
* BITS_PER_UNIT
<= MAX_SUPPORTED_STACK_ALIGNMENT
)
1119 base
= virtual_stack_vars_rtx
;
1120 if ((asan_sanitize_stack_p ())
1123 HOST_WIDE_INT prev_offset
1124 = align_base (frame_offset
,
1125 MAX (alignb
, ASAN_RED_ZONE_SIZE
),
1126 !FRAME_GROWS_DOWNWARD
);
1127 tree repr_decl
= NULL_TREE
;
1129 = alloc_stack_frame_space (stack_vars
[i
].size
1130 + ASAN_RED_ZONE_SIZE
,
1131 MAX (alignb
, ASAN_RED_ZONE_SIZE
));
1133 data
->asan_vec
.safe_push (prev_offset
);
1134 data
->asan_vec
.safe_push (offset
+ stack_vars
[i
].size
);
1135 /* Find best representative of the partition.
1136 Prefer those with DECL_NAME, even better
1137 satisfying asan_protect_stack_decl predicate. */
1138 for (j
= i
; j
!= EOC
; j
= stack_vars
[j
].next
)
1139 if (asan_protect_stack_decl (stack_vars
[j
].decl
)
1140 && DECL_NAME (stack_vars
[j
].decl
))
1142 repr_decl
= stack_vars
[j
].decl
;
1145 else if (repr_decl
== NULL_TREE
1146 && DECL_P (stack_vars
[j
].decl
)
1147 && DECL_NAME (stack_vars
[j
].decl
))
1148 repr_decl
= stack_vars
[j
].decl
;
1149 if (repr_decl
== NULL_TREE
)
1150 repr_decl
= stack_vars
[i
].decl
;
1151 data
->asan_decl_vec
.safe_push (repr_decl
);
1152 data
->asan_alignb
= MAX (data
->asan_alignb
, alignb
);
1153 if (data
->asan_base
== NULL
)
1154 data
->asan_base
= gen_reg_rtx (Pmode
);
1155 base
= data
->asan_base
;
1157 if (!STRICT_ALIGNMENT
)
1158 base_align
= crtl
->max_used_stack_slot_alignment
;
1160 base_align
= MAX (crtl
->max_used_stack_slot_alignment
,
1161 GET_MODE_ALIGNMENT (SImode
)
1162 << ASAN_SHADOW_SHIFT
);
1166 offset
= alloc_stack_frame_space (stack_vars
[i
].size
, alignb
);
1167 base_align
= crtl
->max_used_stack_slot_alignment
;
1172 /* Large alignment is only processed in the last pass. */
1176 /* If there were any variables requiring "large" alignment, allocate
1178 if (large_size
> 0 && ! large_allocation_done
)
1180 HOST_WIDE_INT loffset
;
1181 rtx large_allocsize
;
1183 large_allocsize
= GEN_INT (large_size
);
1184 get_dynamic_stack_size (&large_allocsize
, 0, large_align
, NULL
);
1185 loffset
= alloc_stack_frame_space
1186 (INTVAL (large_allocsize
),
1187 PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
);
1188 large_base
= get_dynamic_stack_base (loffset
, large_align
);
1189 large_allocation_done
= true;
1191 gcc_assert (large_base
!= NULL
);
1193 large_alloc
+= alignb
- 1;
1194 large_alloc
&= -(HOST_WIDE_INT
)alignb
;
1195 offset
= large_alloc
;
1196 large_alloc
+= stack_vars
[i
].size
;
1199 base_align
= large_align
;
1202 /* Create rtl for each variable based on their location within the
1204 for (j
= i
; j
!= EOC
; j
= stack_vars
[j
].next
)
1206 expand_one_stack_var_at (stack_vars
[j
].decl
,
1212 gcc_assert (large_alloc
== large_size
);
1215 /* Take into account all sizes of partitions and reset DECL_RTLs. */
1216 static HOST_WIDE_INT
1217 account_stack_vars (void)
1219 size_t si
, j
, i
, n
= stack_vars_num
;
1220 HOST_WIDE_INT size
= 0;
1222 for (si
= 0; si
< n
; ++si
)
1224 i
= stack_vars_sorted
[si
];
1226 /* Skip variables that aren't partition representatives, for now. */
1227 if (stack_vars
[i
].representative
!= i
)
1230 size
+= stack_vars
[i
].size
;
1231 for (j
= i
; j
!= EOC
; j
= stack_vars
[j
].next
)
1232 set_rtl (stack_vars
[j
].decl
, NULL
);
1237 /* Record the RTL assignment X for the default def of PARM. */
1240 set_parm_rtl (tree parm
, rtx x
)
1242 gcc_assert (TREE_CODE (parm
) == PARM_DECL
1243 || TREE_CODE (parm
) == RESULT_DECL
);
1245 if (x
&& !MEM_P (x
))
1247 unsigned int align
= MINIMUM_ALIGNMENT (TREE_TYPE (parm
),
1248 TYPE_MODE (TREE_TYPE (parm
)),
1249 TYPE_ALIGN (TREE_TYPE (parm
)));
1251 /* If the variable alignment is very large we'll dynamicaly
1252 allocate it, which means that in-frame portion is just a
1253 pointer. ??? We've got a pseudo for sure here, do we
1254 actually dynamically allocate its spilling area if needed?
1255 ??? Isn't it a problem when POINTER_SIZE also exceeds
1256 MAX_SUPPORTED_STACK_ALIGNMENT, as on cris and lm32? */
1257 if (align
> MAX_SUPPORTED_STACK_ALIGNMENT
)
1258 align
= POINTER_SIZE
;
1260 record_alignment_for_reg_var (align
);
1263 tree ssa
= ssa_default_def (cfun
, parm
);
1265 return set_rtl (parm
, x
);
1267 int part
= var_to_partition (SA
.map
, ssa
);
1268 gcc_assert (part
!= NO_PARTITION
);
1270 bool changed
= bitmap_bit_p (SA
.partitions_for_parm_default_defs
, part
);
1271 gcc_assert (changed
);
1274 gcc_assert (DECL_RTL (parm
) == x
);
1277 /* A subroutine of expand_one_var. Called to immediately assign rtl
1278 to a variable to be allocated in the stack frame. */
1281 expand_one_stack_var_1 (tree var
)
1283 HOST_WIDE_INT size
, offset
;
1284 unsigned byte_align
;
1286 if (TREE_CODE (var
) == SSA_NAME
)
1288 tree type
= TREE_TYPE (var
);
1289 size
= tree_to_uhwi (TYPE_SIZE_UNIT (type
));
1290 byte_align
= TYPE_ALIGN_UNIT (type
);
1294 size
= tree_to_uhwi (DECL_SIZE_UNIT (var
));
1295 byte_align
= align_local_variable (var
);
1298 /* We handle highly aligned variables in expand_stack_vars. */
1299 gcc_assert (byte_align
* BITS_PER_UNIT
<= MAX_SUPPORTED_STACK_ALIGNMENT
);
1301 offset
= alloc_stack_frame_space (size
, byte_align
);
1303 expand_one_stack_var_at (var
, virtual_stack_vars_rtx
,
1304 crtl
->max_used_stack_slot_alignment
, offset
);
1307 /* Wrapper for expand_one_stack_var_1 that checks SSA_NAMEs are
1308 already assigned some MEM. */
1311 expand_one_stack_var (tree var
)
1313 if (TREE_CODE (var
) == SSA_NAME
)
1315 int part
= var_to_partition (SA
.map
, var
);
1316 if (part
!= NO_PARTITION
)
1318 rtx x
= SA
.partition_to_pseudo
[part
];
1320 gcc_assert (MEM_P (x
));
1325 return expand_one_stack_var_1 (var
);
1328 /* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL
1329 that will reside in a hard register. */
1332 expand_one_hard_reg_var (tree var
)
1334 rest_of_decl_compilation (var
, 0, 0);
1337 /* Record the alignment requirements of some variable assigned to a
1341 record_alignment_for_reg_var (unsigned int align
)
1343 if (SUPPORTS_STACK_ALIGNMENT
1344 && crtl
->stack_alignment_estimated
< align
)
1346 /* stack_alignment_estimated shouldn't change after stack
1347 realign decision made */
1348 gcc_assert (!crtl
->stack_realign_processed
);
1349 crtl
->stack_alignment_estimated
= align
;
1352 /* stack_alignment_needed > PREFERRED_STACK_BOUNDARY is permitted.
1353 So here we only make sure stack_alignment_needed >= align. */
1354 if (crtl
->stack_alignment_needed
< align
)
1355 crtl
->stack_alignment_needed
= align
;
1356 if (crtl
->max_used_stack_slot_alignment
< align
)
1357 crtl
->max_used_stack_slot_alignment
= align
;
1360 /* Create RTL for an SSA partition. */
1363 expand_one_ssa_partition (tree var
)
1365 int part
= var_to_partition (SA
.map
, var
);
1366 gcc_assert (part
!= NO_PARTITION
);
1368 if (SA
.partition_to_pseudo
[part
])
1371 unsigned int align
= MINIMUM_ALIGNMENT (TREE_TYPE (var
),
1372 TYPE_MODE (TREE_TYPE (var
)),
1373 TYPE_ALIGN (TREE_TYPE (var
)));
1375 /* If the variable alignment is very large we'll dynamicaly allocate
1376 it, which means that in-frame portion is just a pointer. */
1377 if (align
> MAX_SUPPORTED_STACK_ALIGNMENT
)
1378 align
= POINTER_SIZE
;
1380 record_alignment_for_reg_var (align
);
1382 if (!use_register_for_decl (var
))
1384 if (defer_stack_allocation (var
, true))
1385 add_stack_var (var
);
1387 expand_one_stack_var_1 (var
);
1391 machine_mode reg_mode
= promote_ssa_mode (var
, NULL
);
1393 rtx x
= gen_reg_rtx (reg_mode
);
1398 /* Record the association between the RTL generated for partition PART
1399 and the underlying variable of the SSA_NAME VAR. */
1402 adjust_one_expanded_partition_var (tree var
)
1407 tree decl
= SSA_NAME_VAR (var
);
1409 int part
= var_to_partition (SA
.map
, var
);
1410 if (part
== NO_PARTITION
)
1413 rtx x
= SA
.partition_to_pseudo
[part
];
1422 /* Note if the object is a user variable. */
1423 if (decl
&& !DECL_ARTIFICIAL (decl
))
1426 if (POINTER_TYPE_P (decl
? TREE_TYPE (decl
) : TREE_TYPE (var
)))
1427 mark_reg_pointer (x
, get_pointer_alignment (var
));
1430 /* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL
1431 that will reside in a pseudo register. */
1434 expand_one_register_var (tree var
)
1436 if (TREE_CODE (var
) == SSA_NAME
)
1438 int part
= var_to_partition (SA
.map
, var
);
1439 if (part
!= NO_PARTITION
)
1441 rtx x
= SA
.partition_to_pseudo
[part
];
1443 gcc_assert (REG_P (x
));
1450 tree type
= TREE_TYPE (decl
);
1451 machine_mode reg_mode
= promote_decl_mode (decl
, NULL
);
1452 rtx x
= gen_reg_rtx (reg_mode
);
1456 /* Note if the object is a user variable. */
1457 if (!DECL_ARTIFICIAL (decl
))
1460 if (POINTER_TYPE_P (type
))
1461 mark_reg_pointer (x
, get_pointer_alignment (var
));
1464 /* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL that
1465 has some associated error, e.g. its type is error-mark. We just need
1466 to pick something that won't crash the rest of the compiler. */
1469 expand_one_error_var (tree var
)
1471 machine_mode mode
= DECL_MODE (var
);
1474 if (mode
== BLKmode
)
1475 x
= gen_rtx_MEM (BLKmode
, const0_rtx
);
1476 else if (mode
== VOIDmode
)
1479 x
= gen_reg_rtx (mode
);
1481 SET_DECL_RTL (var
, x
);
1484 /* A subroutine of expand_one_var. VAR is a variable that will be
1485 allocated to the local stack frame. Return true if we wish to
1486 add VAR to STACK_VARS so that it will be coalesced with other
1487 variables. Return false to allocate VAR immediately.
1489 This function is used to reduce the number of variables considered
1490 for coalescing, which reduces the size of the quadratic problem. */
1493 defer_stack_allocation (tree var
, bool toplevel
)
1495 tree size_unit
= TREE_CODE (var
) == SSA_NAME
1496 ? TYPE_SIZE_UNIT (TREE_TYPE (var
))
1497 : DECL_SIZE_UNIT (var
);
1499 /* Whether the variable is small enough for immediate allocation not to be
1500 a problem with regard to the frame size. */
1502 = ((HOST_WIDE_INT
) tree_to_uhwi (size_unit
)
1503 < PARAM_VALUE (PARAM_MIN_SIZE_FOR_STACK_SHARING
));
1505 /* If stack protection is enabled, *all* stack variables must be deferred,
1506 so that we can re-order the strings to the top of the frame.
1507 Similarly for Address Sanitizer. */
1508 if (flag_stack_protect
|| asan_sanitize_stack_p ())
1511 unsigned int align
= TREE_CODE (var
) == SSA_NAME
1512 ? TYPE_ALIGN (TREE_TYPE (var
))
1515 /* We handle "large" alignment via dynamic allocation. We want to handle
1516 this extra complication in only one place, so defer them. */
1517 if (align
> MAX_SUPPORTED_STACK_ALIGNMENT
)
1520 bool ignored
= TREE_CODE (var
) == SSA_NAME
1521 ? !SSAVAR (var
) || DECL_IGNORED_P (SSA_NAME_VAR (var
))
1522 : DECL_IGNORED_P (var
);
1524 /* When optimization is enabled, DECL_IGNORED_P variables originally scoped
1525 might be detached from their block and appear at toplevel when we reach
1526 here. We want to coalesce them with variables from other blocks when
1527 the immediate contribution to the frame size would be noticeable. */
1528 if (toplevel
&& optimize
> 0 && ignored
&& !smallish
)
1531 /* Variables declared in the outermost scope automatically conflict
1532 with every other variable. The only reason to want to defer them
1533 at all is that, after sorting, we can more efficiently pack
1534 small variables in the stack frame. Continue to defer at -O2. */
1535 if (toplevel
&& optimize
< 2)
1538 /* Without optimization, *most* variables are allocated from the
1539 stack, which makes the quadratic problem large exactly when we
1540 want compilation to proceed as quickly as possible. On the
1541 other hand, we don't want the function's stack frame size to
1542 get completely out of hand. So we avoid adding scalars and
1543 "small" aggregates to the list at all. */
1544 if (optimize
== 0 && smallish
)
1550 /* A subroutine of expand_used_vars. Expand one variable according to
1551 its flavor. Variables to be placed on the stack are not actually
1552 expanded yet, merely recorded.
1553 When REALLY_EXPAND is false, only add stack values to be allocated.
1554 Return stack usage this variable is supposed to take.
1557 static HOST_WIDE_INT
1558 expand_one_var (tree var
, bool toplevel
, bool really_expand
)
1560 unsigned int align
= BITS_PER_UNIT
;
1565 if (TREE_TYPE (var
) != error_mark_node
&& VAR_P (var
))
1567 if (is_global_var (var
))
1570 /* Because we don't know if VAR will be in register or on stack,
1571 we conservatively assume it will be on stack even if VAR is
1572 eventually put into register after RA pass. For non-automatic
1573 variables, which won't be on stack, we collect alignment of
1574 type and ignore user specified alignment. Similarly for
1575 SSA_NAMEs for which use_register_for_decl returns true. */
1576 if (TREE_STATIC (var
)
1577 || DECL_EXTERNAL (var
)
1578 || (TREE_CODE (origvar
) == SSA_NAME
&& use_register_for_decl (var
)))
1579 align
= MINIMUM_ALIGNMENT (TREE_TYPE (var
),
1580 TYPE_MODE (TREE_TYPE (var
)),
1581 TYPE_ALIGN (TREE_TYPE (var
)));
1582 else if (DECL_HAS_VALUE_EXPR_P (var
)
1583 || (DECL_RTL_SET_P (var
) && MEM_P (DECL_RTL (var
))))
1584 /* Don't consider debug only variables with DECL_HAS_VALUE_EXPR_P set
1585 or variables which were assigned a stack slot already by
1586 expand_one_stack_var_at - in the latter case DECL_ALIGN has been
1587 changed from the offset chosen to it. */
1588 align
= crtl
->stack_alignment_estimated
;
1590 align
= MINIMUM_ALIGNMENT (var
, DECL_MODE (var
), DECL_ALIGN (var
));
1592 /* If the variable alignment is very large we'll dynamicaly allocate
1593 it, which means that in-frame portion is just a pointer. */
1594 if (align
> MAX_SUPPORTED_STACK_ALIGNMENT
)
1595 align
= POINTER_SIZE
;
1598 record_alignment_for_reg_var (align
);
1600 if (TREE_CODE (origvar
) == SSA_NAME
)
1602 gcc_assert (!VAR_P (var
)
1603 || (!DECL_EXTERNAL (var
)
1604 && !DECL_HAS_VALUE_EXPR_P (var
)
1605 && !TREE_STATIC (var
)
1606 && TREE_TYPE (var
) != error_mark_node
1607 && !DECL_HARD_REGISTER (var
)
1610 if (!VAR_P (var
) && TREE_CODE (origvar
) != SSA_NAME
)
1612 else if (DECL_EXTERNAL (var
))
1614 else if (DECL_HAS_VALUE_EXPR_P (var
))
1616 else if (TREE_STATIC (var
))
1618 else if (TREE_CODE (origvar
) != SSA_NAME
&& DECL_RTL_SET_P (var
))
1620 else if (TREE_TYPE (var
) == error_mark_node
)
1623 expand_one_error_var (var
);
1625 else if (VAR_P (var
) && DECL_HARD_REGISTER (var
))
1629 expand_one_hard_reg_var (var
);
1630 if (!DECL_HARD_REGISTER (var
))
1631 /* Invalid register specification. */
1632 expand_one_error_var (var
);
1635 else if (use_register_for_decl (var
))
1638 expand_one_register_var (origvar
);
1640 else if (! valid_constant_size_p (DECL_SIZE_UNIT (var
)))
1642 /* Reject variables which cover more than half of the address-space. */
1645 error ("size of variable %q+D is too large", var
);
1646 expand_one_error_var (var
);
1649 else if (defer_stack_allocation (var
, toplevel
))
1650 add_stack_var (origvar
);
1655 if (lookup_attribute ("naked",
1656 DECL_ATTRIBUTES (current_function_decl
)))
1657 error ("cannot allocate stack for variable %q+D, naked function.",
1660 expand_one_stack_var (origvar
);
1664 return tree_to_uhwi (DECL_SIZE_UNIT (var
));
1669 /* A subroutine of expand_used_vars. Walk down through the BLOCK tree
1670 expanding variables. Those variables that can be put into registers
1671 are allocated pseudos; those that can't are put on the stack.
1673 TOPLEVEL is true if this is the outermost BLOCK. */
1676 expand_used_vars_for_block (tree block
, bool toplevel
)
1680 /* Expand all variables at this level. */
1681 for (t
= BLOCK_VARS (block
); t
; t
= DECL_CHAIN (t
))
1683 && ((!VAR_P (t
) && TREE_CODE (t
) != RESULT_DECL
)
1684 || !DECL_NONSHAREABLE (t
)))
1685 expand_one_var (t
, toplevel
, true);
1687 /* Expand all variables at containing levels. */
1688 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
1689 expand_used_vars_for_block (t
, false);
1692 /* A subroutine of expand_used_vars. Walk down through the BLOCK tree
1693 and clear TREE_USED on all local variables. */
1696 clear_tree_used (tree block
)
1700 for (t
= BLOCK_VARS (block
); t
; t
= DECL_CHAIN (t
))
1701 /* if (!TREE_STATIC (t) && !DECL_EXTERNAL (t)) */
1702 if ((!VAR_P (t
) && TREE_CODE (t
) != RESULT_DECL
)
1703 || !DECL_NONSHAREABLE (t
))
1706 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
1707 clear_tree_used (t
);
1711 SPCT_FLAG_DEFAULT
= 1,
1713 SPCT_FLAG_STRONG
= 3,
1714 SPCT_FLAG_EXPLICIT
= 4
1717 /* Examine TYPE and determine a bit mask of the following features. */
1719 #define SPCT_HAS_LARGE_CHAR_ARRAY 1
1720 #define SPCT_HAS_SMALL_CHAR_ARRAY 2
1721 #define SPCT_HAS_ARRAY 4
1722 #define SPCT_HAS_AGGREGATE 8
1725 stack_protect_classify_type (tree type
)
1727 unsigned int ret
= 0;
1730 switch (TREE_CODE (type
))
1733 t
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
1734 if (t
== char_type_node
1735 || t
== signed_char_type_node
1736 || t
== unsigned_char_type_node
)
1738 unsigned HOST_WIDE_INT max
= PARAM_VALUE (PARAM_SSP_BUFFER_SIZE
);
1739 unsigned HOST_WIDE_INT len
;
1741 if (!TYPE_SIZE_UNIT (type
)
1742 || !tree_fits_uhwi_p (TYPE_SIZE_UNIT (type
)))
1745 len
= tree_to_uhwi (TYPE_SIZE_UNIT (type
));
1748 ret
= SPCT_HAS_SMALL_CHAR_ARRAY
| SPCT_HAS_ARRAY
;
1750 ret
= SPCT_HAS_LARGE_CHAR_ARRAY
| SPCT_HAS_ARRAY
;
1753 ret
= SPCT_HAS_ARRAY
;
1757 case QUAL_UNION_TYPE
:
1759 ret
= SPCT_HAS_AGGREGATE
;
1760 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
1761 if (TREE_CODE (t
) == FIELD_DECL
)
1762 ret
|= stack_protect_classify_type (TREE_TYPE (t
));
1772 /* Return nonzero if DECL should be segregated into the "vulnerable" upper
1773 part of the local stack frame. Remember if we ever return nonzero for
1774 any variable in this function. The return value is the phase number in
1775 which the variable should be allocated. */
1778 stack_protect_decl_phase (tree decl
)
1780 unsigned int bits
= stack_protect_classify_type (TREE_TYPE (decl
));
1783 if (bits
& SPCT_HAS_SMALL_CHAR_ARRAY
)
1784 has_short_buffer
= true;
1786 if (flag_stack_protect
== SPCT_FLAG_ALL
1787 || flag_stack_protect
== SPCT_FLAG_STRONG
1788 || (flag_stack_protect
== SPCT_FLAG_EXPLICIT
1789 && lookup_attribute ("stack_protect",
1790 DECL_ATTRIBUTES (current_function_decl
))))
1792 if ((bits
& (SPCT_HAS_SMALL_CHAR_ARRAY
| SPCT_HAS_LARGE_CHAR_ARRAY
))
1793 && !(bits
& SPCT_HAS_AGGREGATE
))
1795 else if (bits
& SPCT_HAS_ARRAY
)
1799 ret
= (bits
& SPCT_HAS_LARGE_CHAR_ARRAY
) != 0;
1802 has_protected_decls
= true;
1807 /* Two helper routines that check for phase 1 and phase 2. These are used
1808 as callbacks for expand_stack_vars. */
1811 stack_protect_decl_phase_1 (size_t i
)
1813 return stack_protect_decl_phase (stack_vars
[i
].decl
) == 1;
1817 stack_protect_decl_phase_2 (size_t i
)
1819 return stack_protect_decl_phase (stack_vars
[i
].decl
) == 2;
1822 /* And helper function that checks for asan phase (with stack protector
1823 it is phase 3). This is used as callback for expand_stack_vars.
1824 Returns true if any of the vars in the partition need to be protected. */
1827 asan_decl_phase_3 (size_t i
)
1831 if (asan_protect_stack_decl (stack_vars
[i
].decl
))
1833 i
= stack_vars
[i
].next
;
1838 /* Ensure that variables in different stack protection phases conflict
1839 so that they are not merged and share the same stack slot. */
1842 add_stack_protection_conflicts (void)
1844 size_t i
, j
, n
= stack_vars_num
;
1845 unsigned char *phase
;
1847 phase
= XNEWVEC (unsigned char, n
);
1848 for (i
= 0; i
< n
; ++i
)
1849 phase
[i
] = stack_protect_decl_phase (stack_vars
[i
].decl
);
1851 for (i
= 0; i
< n
; ++i
)
1853 unsigned char ph_i
= phase
[i
];
1854 for (j
= i
+ 1; j
< n
; ++j
)
1855 if (ph_i
!= phase
[j
])
1856 add_stack_var_conflict (i
, j
);
1862 /* Create a decl for the guard at the top of the stack frame. */
1865 create_stack_guard (void)
1867 tree guard
= build_decl (DECL_SOURCE_LOCATION (current_function_decl
),
1868 VAR_DECL
, NULL
, ptr_type_node
);
1869 TREE_THIS_VOLATILE (guard
) = 1;
1870 TREE_USED (guard
) = 1;
1871 expand_one_stack_var (guard
);
1872 crtl
->stack_protect_guard
= guard
;
1875 /* Prepare for expanding variables. */
1877 init_vars_expansion (void)
1879 /* Conflict bitmaps, and a few related temporary bitmaps, go here. */
1880 bitmap_obstack_initialize (&stack_var_bitmap_obstack
);
1882 /* A map from decl to stack partition. */
1883 decl_to_stack_part
= new hash_map
<tree
, size_t>;
1885 /* Initialize local stack smashing state. */
1886 has_protected_decls
= false;
1887 has_short_buffer
= false;
1890 /* Free up stack variable graph data. */
1892 fini_vars_expansion (void)
1894 bitmap_obstack_release (&stack_var_bitmap_obstack
);
1896 XDELETEVEC (stack_vars
);
1897 if (stack_vars_sorted
)
1898 XDELETEVEC (stack_vars_sorted
);
1900 stack_vars_sorted
= NULL
;
1901 stack_vars_alloc
= stack_vars_num
= 0;
1902 delete decl_to_stack_part
;
1903 decl_to_stack_part
= NULL
;
1906 /* Make a fair guess for the size of the stack frame of the function
1907 in NODE. This doesn't have to be exact, the result is only used in
1908 the inline heuristics. So we don't want to run the full stack var
1909 packing algorithm (which is quadratic in the number of stack vars).
1910 Instead, we calculate the total size of all stack vars. This turns
1911 out to be a pretty fair estimate -- packing of stack vars doesn't
1912 happen very often. */
1915 estimated_stack_frame_size (struct cgraph_node
*node
)
1917 HOST_WIDE_INT size
= 0;
1920 struct function
*fn
= DECL_STRUCT_FUNCTION (node
->decl
);
1924 init_vars_expansion ();
1926 FOR_EACH_LOCAL_DECL (fn
, i
, var
)
1927 if (auto_var_in_fn_p (var
, fn
->decl
))
1928 size
+= expand_one_var (var
, true, false);
1930 if (stack_vars_num
> 0)
1932 /* Fake sorting the stack vars for account_stack_vars (). */
1933 stack_vars_sorted
= XNEWVEC (size_t, stack_vars_num
);
1934 for (i
= 0; i
< stack_vars_num
; ++i
)
1935 stack_vars_sorted
[i
] = i
;
1936 size
+= account_stack_vars ();
1939 fini_vars_expansion ();
1944 /* Helper routine to check if a record or union contains an array field. */
1947 record_or_union_type_has_array_p (const_tree tree_type
)
1949 tree fields
= TYPE_FIELDS (tree_type
);
1952 for (f
= fields
; f
; f
= DECL_CHAIN (f
))
1953 if (TREE_CODE (f
) == FIELD_DECL
)
1955 tree field_type
= TREE_TYPE (f
);
1956 if (RECORD_OR_UNION_TYPE_P (field_type
)
1957 && record_or_union_type_has_array_p (field_type
))
1959 if (TREE_CODE (field_type
) == ARRAY_TYPE
)
1965 /* Check if the current function has local referenced variables that
1966 have their addresses taken, contain an array, or are arrays. */
1969 stack_protect_decl_p ()
1974 FOR_EACH_LOCAL_DECL (cfun
, i
, var
)
1975 if (!is_global_var (var
))
1977 tree var_type
= TREE_TYPE (var
);
1979 && (TREE_CODE (var_type
) == ARRAY_TYPE
1980 || TREE_ADDRESSABLE (var
)
1981 || (RECORD_OR_UNION_TYPE_P (var_type
)
1982 && record_or_union_type_has_array_p (var_type
))))
1988 /* Check if the current function has calls that use a return slot. */
1991 stack_protect_return_slot_p ()
1995 FOR_ALL_BB_FN (bb
, cfun
)
1996 for (gimple_stmt_iterator gsi
= gsi_start_bb (bb
);
1997 !gsi_end_p (gsi
); gsi_next (&gsi
))
1999 gimple
*stmt
= gsi_stmt (gsi
);
2000 /* This assumes that calls to internal-only functions never
2001 use a return slot. */
2002 if (is_gimple_call (stmt
)
2003 && !gimple_call_internal_p (stmt
)
2004 && aggregate_value_p (TREE_TYPE (gimple_call_fntype (stmt
)),
2005 gimple_call_fndecl (stmt
)))
2011 /* Expand all variables used in the function. */
2014 expand_used_vars (void)
2016 tree var
, outer_block
= DECL_INITIAL (current_function_decl
);
2017 auto_vec
<tree
> maybe_local_decls
;
2018 rtx_insn
*var_end_seq
= NULL
;
2021 bool gen_stack_protect_signal
= false;
2023 /* Compute the phase of the stack frame for this function. */
2025 int align
= PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
;
2026 int off
= STARTING_FRAME_OFFSET
% align
;
2027 frame_phase
= off
? align
- off
: 0;
2030 /* Set TREE_USED on all variables in the local_decls. */
2031 FOR_EACH_LOCAL_DECL (cfun
, i
, var
)
2032 TREE_USED (var
) = 1;
2033 /* Clear TREE_USED on all variables associated with a block scope. */
2034 clear_tree_used (DECL_INITIAL (current_function_decl
));
2036 init_vars_expansion ();
2038 if (targetm
.use_pseudo_pic_reg ())
2039 pic_offset_table_rtx
= gen_reg_rtx (Pmode
);
2041 for (i
= 0; i
< SA
.map
->num_partitions
; i
++)
2043 if (bitmap_bit_p (SA
.partitions_for_parm_default_defs
, i
))
2046 tree var
= partition_to_var (SA
.map
, i
);
2048 gcc_assert (!virtual_operand_p (var
));
2050 expand_one_ssa_partition (var
);
2053 if (flag_stack_protect
== SPCT_FLAG_STRONG
)
2054 gen_stack_protect_signal
2055 = stack_protect_decl_p () || stack_protect_return_slot_p ();
2057 /* At this point all variables on the local_decls with TREE_USED
2058 set are not associated with any block scope. Lay them out. */
2060 len
= vec_safe_length (cfun
->local_decls
);
2061 FOR_EACH_LOCAL_DECL (cfun
, i
, var
)
2063 bool expand_now
= false;
2065 /* Expanded above already. */
2066 if (is_gimple_reg (var
))
2068 TREE_USED (var
) = 0;
2071 /* We didn't set a block for static or extern because it's hard
2072 to tell the difference between a global variable (re)declared
2073 in a local scope, and one that's really declared there to
2074 begin with. And it doesn't really matter much, since we're
2075 not giving them stack space. Expand them now. */
2076 else if (TREE_STATIC (var
) || DECL_EXTERNAL (var
))
2079 /* Expand variables not associated with any block now. Those created by
2080 the optimizers could be live anywhere in the function. Those that
2081 could possibly have been scoped originally and detached from their
2082 block will have their allocation deferred so we coalesce them with
2083 others when optimization is enabled. */
2084 else if (TREE_USED (var
))
2087 /* Finally, mark all variables on the list as used. We'll use
2088 this in a moment when we expand those associated with scopes. */
2089 TREE_USED (var
) = 1;
2092 expand_one_var (var
, true, true);
2095 if (DECL_ARTIFICIAL (var
) && !DECL_IGNORED_P (var
))
2097 rtx rtl
= DECL_RTL_IF_SET (var
);
2099 /* Keep artificial non-ignored vars in cfun->local_decls
2100 chain until instantiate_decls. */
2101 if (rtl
&& (MEM_P (rtl
) || GET_CODE (rtl
) == CONCAT
))
2102 add_local_decl (cfun
, var
);
2103 else if (rtl
== NULL_RTX
)
2104 /* If rtl isn't set yet, which can happen e.g. with
2105 -fstack-protector, retry before returning from this
2107 maybe_local_decls
.safe_push (var
);
2111 /* We duplicated some of the decls in CFUN->LOCAL_DECLS.
2113 +-----------------+-----------------+
2114 | ...processed... | ...duplicates...|
2115 +-----------------+-----------------+
2117 +-- LEN points here.
2119 We just want the duplicates, as those are the artificial
2120 non-ignored vars that we want to keep until instantiate_decls.
2121 Move them down and truncate the array. */
2122 if (!vec_safe_is_empty (cfun
->local_decls
))
2123 cfun
->local_decls
->block_remove (0, len
);
2125 /* At this point, all variables within the block tree with TREE_USED
2126 set are actually used by the optimized function. Lay them out. */
2127 expand_used_vars_for_block (outer_block
, true);
2129 if (stack_vars_num
> 0)
2131 add_scope_conflicts ();
2133 /* If stack protection is enabled, we don't share space between
2134 vulnerable data and non-vulnerable data. */
2135 if (flag_stack_protect
!= 0
2136 && (flag_stack_protect
!= SPCT_FLAG_EXPLICIT
2137 || (flag_stack_protect
== SPCT_FLAG_EXPLICIT
2138 && lookup_attribute ("stack_protect",
2139 DECL_ATTRIBUTES (current_function_decl
)))))
2140 add_stack_protection_conflicts ();
2142 /* Now that we have collected all stack variables, and have computed a
2143 minimal interference graph, attempt to save some stack space. */
2144 partition_stack_vars ();
2146 dump_stack_var_partition ();
2149 switch (flag_stack_protect
)
2152 create_stack_guard ();
2155 case SPCT_FLAG_STRONG
:
2156 if (gen_stack_protect_signal
2157 || cfun
->calls_alloca
|| has_protected_decls
2158 || lookup_attribute ("stack_protect",
2159 DECL_ATTRIBUTES (current_function_decl
)))
2160 create_stack_guard ();
2163 case SPCT_FLAG_DEFAULT
:
2164 if (cfun
->calls_alloca
|| has_protected_decls
2165 || lookup_attribute ("stack_protect",
2166 DECL_ATTRIBUTES (current_function_decl
)))
2167 create_stack_guard ();
2170 case SPCT_FLAG_EXPLICIT
:
2171 if (lookup_attribute ("stack_protect",
2172 DECL_ATTRIBUTES (current_function_decl
)))
2173 create_stack_guard ();
2179 /* Assign rtl to each variable based on these partitions. */
2180 if (stack_vars_num
> 0)
2182 struct stack_vars_data data
;
2184 data
.asan_base
= NULL_RTX
;
2185 data
.asan_alignb
= 0;
2187 /* Reorder decls to be protected by iterating over the variables
2188 array multiple times, and allocating out of each phase in turn. */
2189 /* ??? We could probably integrate this into the qsort we did
2190 earlier, such that we naturally see these variables first,
2191 and thus naturally allocate things in the right order. */
2192 if (has_protected_decls
)
2194 /* Phase 1 contains only character arrays. */
2195 expand_stack_vars (stack_protect_decl_phase_1
, &data
);
2197 /* Phase 2 contains other kinds of arrays. */
2198 if (flag_stack_protect
== SPCT_FLAG_ALL
2199 || flag_stack_protect
== SPCT_FLAG_STRONG
2200 || (flag_stack_protect
== SPCT_FLAG_EXPLICIT
2201 && lookup_attribute ("stack_protect",
2202 DECL_ATTRIBUTES (current_function_decl
))))
2203 expand_stack_vars (stack_protect_decl_phase_2
, &data
);
2206 if (asan_sanitize_stack_p ())
2207 /* Phase 3, any partitions that need asan protection
2208 in addition to phase 1 and 2. */
2209 expand_stack_vars (asan_decl_phase_3
, &data
);
2211 if (!data
.asan_vec
.is_empty ())
2213 HOST_WIDE_INT prev_offset
= frame_offset
;
2214 HOST_WIDE_INT offset
, sz
, redzonesz
;
2215 redzonesz
= ASAN_RED_ZONE_SIZE
;
2216 sz
= data
.asan_vec
[0] - prev_offset
;
2217 if (data
.asan_alignb
> ASAN_RED_ZONE_SIZE
2218 && data
.asan_alignb
<= 4096
2219 && sz
+ ASAN_RED_ZONE_SIZE
>= (int) data
.asan_alignb
)
2220 redzonesz
= ((sz
+ ASAN_RED_ZONE_SIZE
+ data
.asan_alignb
- 1)
2221 & ~(data
.asan_alignb
- HOST_WIDE_INT_1
)) - sz
;
2223 = alloc_stack_frame_space (redzonesz
, ASAN_RED_ZONE_SIZE
);
2224 data
.asan_vec
.safe_push (prev_offset
);
2225 data
.asan_vec
.safe_push (offset
);
2226 /* Leave space for alignment if STRICT_ALIGNMENT. */
2227 if (STRICT_ALIGNMENT
)
2228 alloc_stack_frame_space ((GET_MODE_ALIGNMENT (SImode
)
2229 << ASAN_SHADOW_SHIFT
)
2230 / BITS_PER_UNIT
, 1);
2233 = asan_emit_stack_protection (virtual_stack_vars_rtx
,
2236 data
.asan_vec
.address (),
2237 data
.asan_decl_vec
.address (),
2238 data
.asan_vec
.length ());
2241 expand_stack_vars (NULL
, &data
);
2244 fini_vars_expansion ();
2246 /* If there were any artificial non-ignored vars without rtl
2247 found earlier, see if deferred stack allocation hasn't assigned
2249 FOR_EACH_VEC_ELT_REVERSE (maybe_local_decls
, i
, var
)
2251 rtx rtl
= DECL_RTL_IF_SET (var
);
2253 /* Keep artificial non-ignored vars in cfun->local_decls
2254 chain until instantiate_decls. */
2255 if (rtl
&& (MEM_P (rtl
) || GET_CODE (rtl
) == CONCAT
))
2256 add_local_decl (cfun
, var
);
2259 /* If the target requires that FRAME_OFFSET be aligned, do it. */
2260 if (STACK_ALIGNMENT_NEEDED
)
2262 HOST_WIDE_INT align
= PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
;
2263 if (!FRAME_GROWS_DOWNWARD
)
2264 frame_offset
+= align
- 1;
2265 frame_offset
&= -align
;
2272 /* If we need to produce a detailed dump, print the tree representation
2273 for STMT to the dump file. SINCE is the last RTX after which the RTL
2274 generated for STMT should have been appended. */
2277 maybe_dump_rtl_for_gimple_stmt (gimple
*stmt
, rtx_insn
*since
)
2279 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2281 fprintf (dump_file
, "\n;; ");
2282 print_gimple_stmt (dump_file
, stmt
, 0,
2283 TDF_SLIM
| (dump_flags
& TDF_LINENO
));
2284 fprintf (dump_file
, "\n");
2286 print_rtl (dump_file
, since
? NEXT_INSN (since
) : since
);
2290 /* Maps the blocks that do not contain tree labels to rtx labels. */
2292 static hash_map
<basic_block
, rtx_code_label
*> *lab_rtx_for_bb
;
2294 /* Returns the label_rtx expression for a label starting basic block BB. */
2296 static rtx_code_label
*
2297 label_rtx_for_bb (basic_block bb ATTRIBUTE_UNUSED
)
2299 gimple_stmt_iterator gsi
;
2302 if (bb
->flags
& BB_RTL
)
2303 return block_label (bb
);
2305 rtx_code_label
**elt
= lab_rtx_for_bb
->get (bb
);
2309 /* Find the tree label if it is present. */
2311 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
2315 lab_stmt
= dyn_cast
<glabel
*> (gsi_stmt (gsi
));
2319 lab
= gimple_label_label (lab_stmt
);
2320 if (DECL_NONLOCAL (lab
))
2323 return jump_target_rtx (lab
);
2326 rtx_code_label
*l
= gen_label_rtx ();
2327 lab_rtx_for_bb
->put (bb
, l
);
2332 /* A subroutine of expand_gimple_cond. Given E, a fallthrough edge
2333 of a basic block where we just expanded the conditional at the end,
2334 possibly clean up the CFG and instruction sequence. LAST is the
2335 last instruction before the just emitted jump sequence. */
2338 maybe_cleanup_end_of_block (edge e
, rtx_insn
*last
)
2340 /* Special case: when jumpif decides that the condition is
2341 trivial it emits an unconditional jump (and the necessary
2342 barrier). But we still have two edges, the fallthru one is
2343 wrong. purge_dead_edges would clean this up later. Unfortunately
2344 we have to insert insns (and split edges) before
2345 find_many_sub_basic_blocks and hence before purge_dead_edges.
2346 But splitting edges might create new blocks which depend on the
2347 fact that if there are two edges there's no barrier. So the
2348 barrier would get lost and verify_flow_info would ICE. Instead
2349 of auditing all edge splitters to care for the barrier (which
2350 normally isn't there in a cleaned CFG), fix it here. */
2351 if (BARRIER_P (get_last_insn ()))
2355 /* Now, we have a single successor block, if we have insns to
2356 insert on the remaining edge we potentially will insert
2357 it at the end of this block (if the dest block isn't feasible)
2358 in order to avoid splitting the edge. This insertion will take
2359 place in front of the last jump. But we might have emitted
2360 multiple jumps (conditional and one unconditional) to the
2361 same destination. Inserting in front of the last one then
2362 is a problem. See PR 40021. We fix this by deleting all
2363 jumps except the last unconditional one. */
2364 insn
= PREV_INSN (get_last_insn ());
2365 /* Make sure we have an unconditional jump. Otherwise we're
2367 gcc_assert (JUMP_P (insn
) && !any_condjump_p (insn
));
2368 for (insn
= PREV_INSN (insn
); insn
!= last
;)
2370 insn
= PREV_INSN (insn
);
2371 if (JUMP_P (NEXT_INSN (insn
)))
2373 if (!any_condjump_p (NEXT_INSN (insn
)))
2375 gcc_assert (BARRIER_P (NEXT_INSN (NEXT_INSN (insn
))));
2376 delete_insn (NEXT_INSN (NEXT_INSN (insn
)));
2378 delete_insn (NEXT_INSN (insn
));
2384 /* A subroutine of expand_gimple_basic_block. Expand one GIMPLE_COND.
2385 Returns a new basic block if we've terminated the current basic
2386 block and created a new one. */
2389 expand_gimple_cond (basic_block bb
, gcond
*stmt
)
2391 basic_block new_bb
, dest
;
2395 rtx_insn
*last2
, *last
;
2396 enum tree_code code
;
2399 code
= gimple_cond_code (stmt
);
2400 op0
= gimple_cond_lhs (stmt
);
2401 op1
= gimple_cond_rhs (stmt
);
2402 /* We're sometimes presented with such code:
2406 This would expand to two comparisons which then later might
2407 be cleaned up by combine. But some pattern matchers like if-conversion
2408 work better when there's only one compare, so make up for this
2409 here as special exception if TER would have made the same change. */
2411 && TREE_CODE (op0
) == SSA_NAME
2412 && TREE_CODE (TREE_TYPE (op0
)) == BOOLEAN_TYPE
2413 && TREE_CODE (op1
) == INTEGER_CST
2414 && ((gimple_cond_code (stmt
) == NE_EXPR
2415 && integer_zerop (op1
))
2416 || (gimple_cond_code (stmt
) == EQ_EXPR
2417 && integer_onep (op1
)))
2418 && bitmap_bit_p (SA
.values
, SSA_NAME_VERSION (op0
)))
2420 gimple
*second
= SSA_NAME_DEF_STMT (op0
);
2421 if (gimple_code (second
) == GIMPLE_ASSIGN
)
2423 enum tree_code code2
= gimple_assign_rhs_code (second
);
2424 if (TREE_CODE_CLASS (code2
) == tcc_comparison
)
2427 op0
= gimple_assign_rhs1 (second
);
2428 op1
= gimple_assign_rhs2 (second
);
2430 /* If jumps are cheap and the target does not support conditional
2431 compare, turn some more codes into jumpy sequences. */
2432 else if (BRANCH_COST (optimize_insn_for_speed_p (), false) < 4
2433 && targetm
.gen_ccmp_first
== NULL
)
2435 if ((code2
== BIT_AND_EXPR
2436 && TYPE_PRECISION (TREE_TYPE (op0
)) == 1
2437 && TREE_CODE (gimple_assign_rhs2 (second
)) != INTEGER_CST
)
2438 || code2
== TRUTH_AND_EXPR
)
2440 code
= TRUTH_ANDIF_EXPR
;
2441 op0
= gimple_assign_rhs1 (second
);
2442 op1
= gimple_assign_rhs2 (second
);
2444 else if (code2
== BIT_IOR_EXPR
|| code2
== TRUTH_OR_EXPR
)
2446 code
= TRUTH_ORIF_EXPR
;
2447 op0
= gimple_assign_rhs1 (second
);
2448 op1
= gimple_assign_rhs2 (second
);
2454 last2
= last
= get_last_insn ();
2456 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
2457 set_curr_insn_location (gimple_location (stmt
));
2459 /* These flags have no purpose in RTL land. */
2460 true_edge
->flags
&= ~EDGE_TRUE_VALUE
;
2461 false_edge
->flags
&= ~EDGE_FALSE_VALUE
;
2463 /* We can either have a pure conditional jump with one fallthru edge or
2464 two-way jump that needs to be decomposed into two basic blocks. */
2465 if (false_edge
->dest
== bb
->next_bb
)
2467 jumpif_1 (code
, op0
, op1
, label_rtx_for_bb (true_edge
->dest
),
2468 true_edge
->probability
);
2469 maybe_dump_rtl_for_gimple_stmt (stmt
, last
);
2470 if (true_edge
->goto_locus
!= UNKNOWN_LOCATION
)
2471 set_curr_insn_location (true_edge
->goto_locus
);
2472 false_edge
->flags
|= EDGE_FALLTHRU
;
2473 maybe_cleanup_end_of_block (false_edge
, last
);
2476 if (true_edge
->dest
== bb
->next_bb
)
2478 jumpifnot_1 (code
, op0
, op1
, label_rtx_for_bb (false_edge
->dest
),
2479 false_edge
->probability
);
2480 maybe_dump_rtl_for_gimple_stmt (stmt
, last
);
2481 if (false_edge
->goto_locus
!= UNKNOWN_LOCATION
)
2482 set_curr_insn_location (false_edge
->goto_locus
);
2483 true_edge
->flags
|= EDGE_FALLTHRU
;
2484 maybe_cleanup_end_of_block (true_edge
, last
);
2488 jumpif_1 (code
, op0
, op1
, label_rtx_for_bb (true_edge
->dest
),
2489 true_edge
->probability
);
2490 last
= get_last_insn ();
2491 if (false_edge
->goto_locus
!= UNKNOWN_LOCATION
)
2492 set_curr_insn_location (false_edge
->goto_locus
);
2493 emit_jump (label_rtx_for_bb (false_edge
->dest
));
2496 if (BARRIER_P (BB_END (bb
)))
2497 BB_END (bb
) = PREV_INSN (BB_END (bb
));
2498 update_bb_for_insn (bb
);
2500 new_bb
= create_basic_block (NEXT_INSN (last
), get_last_insn (), bb
);
2501 dest
= false_edge
->dest
;
2502 redirect_edge_succ (false_edge
, new_bb
);
2503 false_edge
->flags
|= EDGE_FALLTHRU
;
2504 new_bb
->count
= false_edge
->count
;
2505 new_bb
->frequency
= EDGE_FREQUENCY (false_edge
);
2506 loop_p loop
= find_common_loop (bb
->loop_father
, dest
->loop_father
);
2507 add_bb_to_loop (new_bb
, loop
);
2508 if (loop
->latch
== bb
2509 && loop
->header
== dest
)
2510 loop
->latch
= new_bb
;
2511 new_edge
= make_edge (new_bb
, dest
, 0);
2512 new_edge
->probability
= REG_BR_PROB_BASE
;
2513 new_edge
->count
= new_bb
->count
;
2514 if (BARRIER_P (BB_END (new_bb
)))
2515 BB_END (new_bb
) = PREV_INSN (BB_END (new_bb
));
2516 update_bb_for_insn (new_bb
);
2518 maybe_dump_rtl_for_gimple_stmt (stmt
, last2
);
2520 if (true_edge
->goto_locus
!= UNKNOWN_LOCATION
)
2522 set_curr_insn_location (true_edge
->goto_locus
);
2523 true_edge
->goto_locus
= curr_insn_location ();
2529 /* Mark all calls that can have a transaction restart. */
2532 mark_transaction_restart_calls (gimple
*stmt
)
2534 struct tm_restart_node dummy
;
2535 tm_restart_node
**slot
;
2537 if (!cfun
->gimple_df
->tm_restart
)
2541 slot
= cfun
->gimple_df
->tm_restart
->find_slot (&dummy
, NO_INSERT
);
2544 struct tm_restart_node
*n
= *slot
;
2545 tree list
= n
->label_or_list
;
2548 for (insn
= next_real_insn (get_last_insn ());
2550 insn
= next_real_insn (insn
))
2553 if (TREE_CODE (list
) == LABEL_DECL
)
2554 add_reg_note (insn
, REG_TM
, label_rtx (list
));
2556 for (; list
; list
= TREE_CHAIN (list
))
2557 add_reg_note (insn
, REG_TM
, label_rtx (TREE_VALUE (list
)));
2561 /* A subroutine of expand_gimple_stmt_1, expanding one GIMPLE_CALL
2565 expand_call_stmt (gcall
*stmt
)
2567 tree exp
, decl
, lhs
;
2571 if (gimple_call_internal_p (stmt
))
2573 expand_internal_call (stmt
);
2577 /* If this is a call to a built-in function and it has no effect other
2578 than setting the lhs, try to implement it using an internal function
2580 decl
= gimple_call_fndecl (stmt
);
2581 if (gimple_call_lhs (stmt
)
2582 && !gimple_has_side_effects (stmt
)
2583 && (optimize
|| (decl
&& called_as_built_in (decl
))))
2585 internal_fn ifn
= replacement_internal_fn (stmt
);
2586 if (ifn
!= IFN_LAST
)
2588 expand_internal_call (ifn
, stmt
);
2593 exp
= build_vl_exp (CALL_EXPR
, gimple_call_num_args (stmt
) + 3);
2595 CALL_EXPR_FN (exp
) = gimple_call_fn (stmt
);
2596 builtin_p
= decl
&& DECL_BUILT_IN (decl
);
2598 /* If this is not a builtin function, the function type through which the
2599 call is made may be different from the type of the function. */
2602 = fold_convert (build_pointer_type (gimple_call_fntype (stmt
)),
2603 CALL_EXPR_FN (exp
));
2605 TREE_TYPE (exp
) = gimple_call_return_type (stmt
);
2606 CALL_EXPR_STATIC_CHAIN (exp
) = gimple_call_chain (stmt
);
2608 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
2610 tree arg
= gimple_call_arg (stmt
, i
);
2612 /* TER addresses into arguments of builtin functions so we have a
2613 chance to infer more correct alignment information. See PR39954. */
2615 && TREE_CODE (arg
) == SSA_NAME
2616 && (def
= get_gimple_for_ssa_name (arg
))
2617 && gimple_assign_rhs_code (def
) == ADDR_EXPR
)
2618 arg
= gimple_assign_rhs1 (def
);
2619 CALL_EXPR_ARG (exp
, i
) = arg
;
2622 if (gimple_has_side_effects (stmt
))
2623 TREE_SIDE_EFFECTS (exp
) = 1;
2625 if (gimple_call_nothrow_p (stmt
))
2626 TREE_NOTHROW (exp
) = 1;
2628 CALL_EXPR_TAILCALL (exp
) = gimple_call_tail_p (stmt
);
2629 CALL_EXPR_MUST_TAIL_CALL (exp
) = gimple_call_must_tail_p (stmt
);
2630 CALL_EXPR_RETURN_SLOT_OPT (exp
) = gimple_call_return_slot_opt_p (stmt
);
2632 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
2633 && (DECL_FUNCTION_CODE (decl
) == BUILT_IN_ALLOCA
2634 || DECL_FUNCTION_CODE (decl
) == BUILT_IN_ALLOCA_WITH_ALIGN
))
2635 CALL_ALLOCA_FOR_VAR_P (exp
) = gimple_call_alloca_for_var_p (stmt
);
2637 CALL_FROM_THUNK_P (exp
) = gimple_call_from_thunk_p (stmt
);
2638 CALL_EXPR_VA_ARG_PACK (exp
) = gimple_call_va_arg_pack_p (stmt
);
2639 CALL_EXPR_BY_DESCRIPTOR (exp
) = gimple_call_by_descriptor_p (stmt
);
2640 SET_EXPR_LOCATION (exp
, gimple_location (stmt
));
2641 CALL_WITH_BOUNDS_P (exp
) = gimple_call_with_bounds_p (stmt
);
2643 /* Ensure RTL is created for debug args. */
2644 if (decl
&& DECL_HAS_DEBUG_ARGS_P (decl
))
2646 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (decl
);
2651 for (ix
= 1; (*debug_args
)->iterate (ix
, &dtemp
); ix
+= 2)
2653 gcc_assert (TREE_CODE (dtemp
) == DEBUG_EXPR_DECL
);
2654 expand_debug_expr (dtemp
);
2658 lhs
= gimple_call_lhs (stmt
);
2660 expand_assignment (lhs
, exp
, false);
2662 expand_expr (exp
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
2664 mark_transaction_restart_calls (stmt
);
2668 /* Generate RTL for an asm statement (explicit assembler code).
2669 STRING is a STRING_CST node containing the assembler code text,
2670 or an ADDR_EXPR containing a STRING_CST. VOL nonzero means the
2671 insn is volatile; don't optimize it. */
2674 expand_asm_loc (tree string
, int vol
, location_t locus
)
2678 body
= gen_rtx_ASM_INPUT_loc (VOIDmode
,
2679 ggc_strdup (TREE_STRING_POINTER (string
)),
2682 MEM_VOLATILE_P (body
) = vol
;
2684 /* Non-empty basic ASM implicitly clobbers memory. */
2685 if (TREE_STRING_LENGTH (string
) != 0)
2688 unsigned i
, nclobbers
;
2689 auto_vec
<rtx
> input_rvec
, output_rvec
;
2690 auto_vec
<const char *> constraints
;
2691 auto_vec
<rtx
> clobber_rvec
;
2692 HARD_REG_SET clobbered_regs
;
2693 CLEAR_HARD_REG_SET (clobbered_regs
);
2695 clob
= gen_rtx_MEM (BLKmode
, gen_rtx_SCRATCH (VOIDmode
));
2696 clobber_rvec
.safe_push (clob
);
2698 if (targetm
.md_asm_adjust
)
2699 targetm
.md_asm_adjust (output_rvec
, input_rvec
,
2700 constraints
, clobber_rvec
,
2704 nclobbers
= clobber_rvec
.length ();
2705 body
= gen_rtx_PARALLEL (VOIDmode
, rtvec_alloc (1 + nclobbers
));
2707 XVECEXP (body
, 0, 0) = asm_op
;
2708 for (i
= 0; i
< nclobbers
; i
++)
2709 XVECEXP (body
, 0, i
+ 1) = gen_rtx_CLOBBER (VOIDmode
, clobber_rvec
[i
]);
2715 /* Return the number of times character C occurs in string S. */
2717 n_occurrences (int c
, const char *s
)
2725 /* A subroutine of expand_asm_operands. Check that all operands have
2726 the same number of alternatives. Return true if so. */
2729 check_operand_nalternatives (const vec
<const char *> &constraints
)
2731 unsigned len
= constraints
.length();
2734 int nalternatives
= n_occurrences (',', constraints
[0]);
2736 if (nalternatives
+ 1 > MAX_RECOG_ALTERNATIVES
)
2738 error ("too many alternatives in %<asm%>");
2742 for (unsigned i
= 1; i
< len
; ++i
)
2743 if (n_occurrences (',', constraints
[i
]) != nalternatives
)
2745 error ("operand constraints for %<asm%> differ "
2746 "in number of alternatives");
2753 /* Check for overlap between registers marked in CLOBBERED_REGS and
2754 anything inappropriate in T. Emit error and return the register
2755 variable definition for error, NULL_TREE for ok. */
2758 tree_conflicts_with_clobbers_p (tree t
, HARD_REG_SET
*clobbered_regs
)
2760 /* Conflicts between asm-declared register variables and the clobber
2761 list are not allowed. */
2762 tree overlap
= tree_overlaps_hard_reg_set (t
, clobbered_regs
);
2766 error ("asm-specifier for variable %qE conflicts with asm clobber list",
2767 DECL_NAME (overlap
));
2769 /* Reset registerness to stop multiple errors emitted for a single
2771 DECL_REGISTER (overlap
) = 0;
2778 /* Generate RTL for an asm statement with arguments.
2779 STRING is the instruction template.
2780 OUTPUTS is a list of output arguments (lvalues); INPUTS a list of inputs.
2781 Each output or input has an expression in the TREE_VALUE and
2782 a tree list in TREE_PURPOSE which in turn contains a constraint
2783 name in TREE_VALUE (or NULL_TREE) and a constraint string
2785 CLOBBERS is a list of STRING_CST nodes each naming a hard register
2786 that is clobbered by this insn.
2788 LABELS is a list of labels, and if LABELS is non-NULL, FALLTHRU_BB
2789 should be the fallthru basic block of the asm goto.
2791 Not all kinds of lvalue that may appear in OUTPUTS can be stored directly.
2792 Some elements of OUTPUTS may be replaced with trees representing temporary
2793 values. The caller should copy those temporary values to the originally
2796 VOL nonzero means the insn is volatile; don't optimize it. */
2799 expand_asm_stmt (gasm
*stmt
)
2801 class save_input_location
2806 explicit save_input_location(location_t where
)
2808 old
= input_location
;
2809 input_location
= where
;
2812 ~save_input_location()
2814 input_location
= old
;
2818 location_t locus
= gimple_location (stmt
);
2820 if (gimple_asm_input_p (stmt
))
2822 const char *s
= gimple_asm_string (stmt
);
2823 tree string
= build_string (strlen (s
), s
);
2824 expand_asm_loc (string
, gimple_asm_volatile_p (stmt
), locus
);
2828 /* There are some legacy diagnostics in here, and also avoids a
2829 sixth parameger to targetm.md_asm_adjust. */
2830 save_input_location
s_i_l(locus
);
2832 unsigned noutputs
= gimple_asm_noutputs (stmt
);
2833 unsigned ninputs
= gimple_asm_ninputs (stmt
);
2834 unsigned nlabels
= gimple_asm_nlabels (stmt
);
2837 /* ??? Diagnose during gimplification? */
2838 if (ninputs
+ noutputs
+ nlabels
> MAX_RECOG_OPERANDS
)
2840 error ("more than %d operands in %<asm%>", MAX_RECOG_OPERANDS
);
2844 auto_vec
<tree
, MAX_RECOG_OPERANDS
> output_tvec
;
2845 auto_vec
<tree
, MAX_RECOG_OPERANDS
> input_tvec
;
2846 auto_vec
<const char *, MAX_RECOG_OPERANDS
> constraints
;
2848 /* Copy the gimple vectors into new vectors that we can manipulate. */
2850 output_tvec
.safe_grow (noutputs
);
2851 input_tvec
.safe_grow (ninputs
);
2852 constraints
.safe_grow (noutputs
+ ninputs
);
2854 for (i
= 0; i
< noutputs
; ++i
)
2856 tree t
= gimple_asm_output_op (stmt
, i
);
2857 output_tvec
[i
] = TREE_VALUE (t
);
2858 constraints
[i
] = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
2860 for (i
= 0; i
< ninputs
; i
++)
2862 tree t
= gimple_asm_input_op (stmt
, i
);
2863 input_tvec
[i
] = TREE_VALUE (t
);
2864 constraints
[i
+ noutputs
]
2865 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
2868 /* ??? Diagnose during gimplification? */
2869 if (! check_operand_nalternatives (constraints
))
2872 /* Count the number of meaningful clobbered registers, ignoring what
2873 we would ignore later. */
2874 auto_vec
<rtx
> clobber_rvec
;
2875 HARD_REG_SET clobbered_regs
;
2876 CLEAR_HARD_REG_SET (clobbered_regs
);
2878 if (unsigned n
= gimple_asm_nclobbers (stmt
))
2880 clobber_rvec
.reserve (n
);
2881 for (i
= 0; i
< n
; i
++)
2883 tree t
= gimple_asm_clobber_op (stmt
, i
);
2884 const char *regname
= TREE_STRING_POINTER (TREE_VALUE (t
));
2887 j
= decode_reg_name_and_count (regname
, &nregs
);
2892 /* ??? Diagnose during gimplification? */
2893 error ("unknown register name %qs in %<asm%>", regname
);
2897 rtx x
= gen_rtx_MEM (BLKmode
, gen_rtx_SCRATCH (VOIDmode
));
2898 clobber_rvec
.safe_push (x
);
2902 /* Otherwise we should have -1 == empty string
2903 or -3 == cc, which is not a register. */
2904 gcc_assert (j
== -1 || j
== -3);
2908 for (int reg
= j
; reg
< j
+ nregs
; reg
++)
2910 /* Clobbering the PIC register is an error. */
2911 if (reg
== (int) PIC_OFFSET_TABLE_REGNUM
)
2913 /* ??? Diagnose during gimplification? */
2914 error ("PIC register clobbered by %qs in %<asm%>",
2919 SET_HARD_REG_BIT (clobbered_regs
, reg
);
2920 rtx x
= gen_rtx_REG (reg_raw_mode
[reg
], reg
);
2921 clobber_rvec
.safe_push (x
);
2925 unsigned nclobbers
= clobber_rvec
.length();
2927 /* First pass over inputs and outputs checks validity and sets
2928 mark_addressable if needed. */
2929 /* ??? Diagnose during gimplification? */
2931 for (i
= 0; i
< noutputs
; ++i
)
2933 tree val
= output_tvec
[i
];
2934 tree type
= TREE_TYPE (val
);
2935 const char *constraint
;
2940 /* Try to parse the output constraint. If that fails, there's
2941 no point in going further. */
2942 constraint
= constraints
[i
];
2943 if (!parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
2944 &allows_mem
, &allows_reg
, &is_inout
))
2951 && REG_P (DECL_RTL (val
))
2952 && GET_MODE (DECL_RTL (val
)) != TYPE_MODE (type
))))
2953 mark_addressable (val
);
2956 for (i
= 0; i
< ninputs
; ++i
)
2958 bool allows_reg
, allows_mem
;
2959 const char *constraint
;
2961 constraint
= constraints
[i
+ noutputs
];
2962 if (! parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
2963 constraints
.address (),
2964 &allows_mem
, &allows_reg
))
2967 if (! allows_reg
&& allows_mem
)
2968 mark_addressable (input_tvec
[i
]);
2971 /* Second pass evaluates arguments. */
2973 /* Make sure stack is consistent for asm goto. */
2975 do_pending_stack_adjust ();
2976 int old_generating_concat_p
= generating_concat_p
;
2978 /* Vector of RTX's of evaluated output operands. */
2979 auto_vec
<rtx
, MAX_RECOG_OPERANDS
> output_rvec
;
2980 auto_vec
<int, MAX_RECOG_OPERANDS
> inout_opnum
;
2981 rtx_insn
*after_rtl_seq
= NULL
, *after_rtl_end
= NULL
;
2983 output_rvec
.safe_grow (noutputs
);
2985 for (i
= 0; i
< noutputs
; ++i
)
2987 tree val
= output_tvec
[i
];
2988 tree type
= TREE_TYPE (val
);
2989 bool is_inout
, allows_reg
, allows_mem
, ok
;
2992 ok
= parse_output_constraint (&constraints
[i
], i
, ninputs
,
2993 noutputs
, &allows_mem
, &allows_reg
,
2997 /* If an output operand is not a decl or indirect ref and our constraint
2998 allows a register, make a temporary to act as an intermediate.
2999 Make the asm insn write into that, then we will copy it to
3000 the real output operand. Likewise for promoted variables. */
3002 generating_concat_p
= 0;
3004 if ((TREE_CODE (val
) == INDIRECT_REF
3007 && (allows_mem
|| REG_P (DECL_RTL (val
)))
3008 && ! (REG_P (DECL_RTL (val
))
3009 && GET_MODE (DECL_RTL (val
)) != TYPE_MODE (type
)))
3013 op
= expand_expr (val
, NULL_RTX
, VOIDmode
,
3014 !allows_reg
? EXPAND_MEMORY
: EXPAND_WRITE
);
3016 op
= validize_mem (op
);
3018 if (! allows_reg
&& !MEM_P (op
))
3019 error ("output number %d not directly addressable", i
);
3020 if ((! allows_mem
&& MEM_P (op
))
3021 || GET_CODE (op
) == CONCAT
)
3024 op
= gen_reg_rtx (GET_MODE (op
));
3026 generating_concat_p
= old_generating_concat_p
;
3029 emit_move_insn (op
, old_op
);
3031 push_to_sequence2 (after_rtl_seq
, after_rtl_end
);
3032 emit_move_insn (old_op
, op
);
3033 after_rtl_seq
= get_insns ();
3034 after_rtl_end
= get_last_insn ();
3040 op
= assign_temp (type
, 0, 1);
3041 op
= validize_mem (op
);
3042 if (!MEM_P (op
) && TREE_CODE (val
) == SSA_NAME
)
3043 set_reg_attrs_for_decl_rtl (SSA_NAME_VAR (val
), op
);
3045 generating_concat_p
= old_generating_concat_p
;
3047 push_to_sequence2 (after_rtl_seq
, after_rtl_end
);
3048 expand_assignment (val
, make_tree (type
, op
), false);
3049 after_rtl_seq
= get_insns ();
3050 after_rtl_end
= get_last_insn ();
3053 output_rvec
[i
] = op
;
3056 inout_opnum
.safe_push (i
);
3059 auto_vec
<rtx
, MAX_RECOG_OPERANDS
> input_rvec
;
3060 auto_vec
<machine_mode
, MAX_RECOG_OPERANDS
> input_mode
;
3062 input_rvec
.safe_grow (ninputs
);
3063 input_mode
.safe_grow (ninputs
);
3065 generating_concat_p
= 0;
3067 for (i
= 0; i
< ninputs
; ++i
)
3069 tree val
= input_tvec
[i
];
3070 tree type
= TREE_TYPE (val
);
3071 bool allows_reg
, allows_mem
, ok
;
3072 const char *constraint
;
3075 constraint
= constraints
[i
+ noutputs
];
3076 ok
= parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
3077 constraints
.address (),
3078 &allows_mem
, &allows_reg
);
3081 /* EXPAND_INITIALIZER will not generate code for valid initializer
3082 constants, but will still generate code for other types of operand.
3083 This is the behavior we want for constant constraints. */
3084 op
= expand_expr (val
, NULL_RTX
, VOIDmode
,
3085 allows_reg
? EXPAND_NORMAL
3086 : allows_mem
? EXPAND_MEMORY
3087 : EXPAND_INITIALIZER
);
3089 /* Never pass a CONCAT to an ASM. */
3090 if (GET_CODE (op
) == CONCAT
)
3091 op
= force_reg (GET_MODE (op
), op
);
3092 else if (MEM_P (op
))
3093 op
= validize_mem (op
);
3095 if (asm_operand_ok (op
, constraint
, NULL
) <= 0)
3097 if (allows_reg
&& TYPE_MODE (type
) != BLKmode
)
3098 op
= force_reg (TYPE_MODE (type
), op
);
3099 else if (!allows_mem
)
3100 warning (0, "asm operand %d probably doesn%'t match constraints",
3102 else if (MEM_P (op
))
3104 /* We won't recognize either volatile memory or memory
3105 with a queued address as available a memory_operand
3106 at this point. Ignore it: clearly this *is* a memory. */
3112 input_mode
[i
] = TYPE_MODE (type
);
3115 /* For in-out operands, copy output rtx to input rtx. */
3116 unsigned ninout
= inout_opnum
.length();
3117 for (i
= 0; i
< ninout
; i
++)
3119 int j
= inout_opnum
[i
];
3120 rtx o
= output_rvec
[j
];
3122 input_rvec
.safe_push (o
);
3123 input_mode
.safe_push (GET_MODE (o
));
3126 sprintf (buffer
, "%d", j
);
3127 constraints
.safe_push (ggc_strdup (buffer
));
3131 /* Sometimes we wish to automatically clobber registers across an asm.
3132 Case in point is when the i386 backend moved from cc0 to a hard reg --
3133 maintaining source-level compatibility means automatically clobbering
3134 the flags register. */
3135 rtx_insn
*after_md_seq
= NULL
;
3136 if (targetm
.md_asm_adjust
)
3137 after_md_seq
= targetm
.md_asm_adjust (output_rvec
, input_rvec
,
3138 constraints
, clobber_rvec
,
3141 /* Do not allow the hook to change the output and input count,
3142 lest it mess up the operand numbering. */
3143 gcc_assert (output_rvec
.length() == noutputs
);
3144 gcc_assert (input_rvec
.length() == ninputs
);
3145 gcc_assert (constraints
.length() == noutputs
+ ninputs
);
3147 /* But it certainly can adjust the clobbers. */
3148 nclobbers
= clobber_rvec
.length();
3150 /* Third pass checks for easy conflicts. */
3151 /* ??? Why are we doing this on trees instead of rtx. */
3153 bool clobber_conflict_found
= 0;
3154 for (i
= 0; i
< noutputs
; ++i
)
3155 if (tree_conflicts_with_clobbers_p (output_tvec
[i
], &clobbered_regs
))
3156 clobber_conflict_found
= 1;
3157 for (i
= 0; i
< ninputs
- ninout
; ++i
)
3158 if (tree_conflicts_with_clobbers_p (input_tvec
[i
], &clobbered_regs
))
3159 clobber_conflict_found
= 1;
3161 /* Make vectors for the expression-rtx, constraint strings,
3162 and named operands. */
3164 rtvec argvec
= rtvec_alloc (ninputs
);
3165 rtvec constraintvec
= rtvec_alloc (ninputs
);
3166 rtvec labelvec
= rtvec_alloc (nlabels
);
3168 rtx body
= gen_rtx_ASM_OPERANDS ((noutputs
== 0 ? VOIDmode
3169 : GET_MODE (output_rvec
[0])),
3170 ggc_strdup (gimple_asm_string (stmt
)),
3171 empty_string
, 0, argvec
, constraintvec
,
3173 MEM_VOLATILE_P (body
) = gimple_asm_volatile_p (stmt
);
3175 for (i
= 0; i
< ninputs
; ++i
)
3177 ASM_OPERANDS_INPUT (body
, i
) = input_rvec
[i
];
3178 ASM_OPERANDS_INPUT_CONSTRAINT_EXP (body
, i
)
3179 = gen_rtx_ASM_INPUT_loc (input_mode
[i
],
3180 constraints
[i
+ noutputs
],
3184 /* Copy labels to the vector. */
3185 rtx_code_label
*fallthru_label
= NULL
;
3188 basic_block fallthru_bb
= NULL
;
3189 edge fallthru
= find_fallthru_edge (gimple_bb (stmt
)->succs
);
3191 fallthru_bb
= fallthru
->dest
;
3193 for (i
= 0; i
< nlabels
; ++i
)
3195 tree label
= TREE_VALUE (gimple_asm_label_op (stmt
, i
));
3197 /* If asm goto has any labels in the fallthru basic block, use
3198 a label that we emit immediately after the asm goto. Expansion
3199 may insert further instructions into the same basic block after
3200 asm goto and if we don't do this, insertion of instructions on
3201 the fallthru edge might misbehave. See PR58670. */
3202 if (fallthru_bb
&& label_to_block_fn (cfun
, label
) == fallthru_bb
)
3204 if (fallthru_label
== NULL_RTX
)
3205 fallthru_label
= gen_label_rtx ();
3209 r
= label_rtx (label
);
3210 ASM_OPERANDS_LABEL (body
, i
) = gen_rtx_LABEL_REF (Pmode
, r
);
3214 /* Now, for each output, construct an rtx
3215 (set OUTPUT (asm_operands INSN OUTPUTCONSTRAINT OUTPUTNUMBER
3216 ARGVEC CONSTRAINTS OPNAMES))
3217 If there is more than one, put them inside a PARALLEL. */
3219 if (nlabels
> 0 && nclobbers
== 0)
3221 gcc_assert (noutputs
== 0);
3222 emit_jump_insn (body
);
3224 else if (noutputs
== 0 && nclobbers
== 0)
3226 /* No output operands: put in a raw ASM_OPERANDS rtx. */
3229 else if (noutputs
== 1 && nclobbers
== 0)
3231 ASM_OPERANDS_OUTPUT_CONSTRAINT (body
) = constraints
[0];
3232 emit_insn (gen_rtx_SET (output_rvec
[0], body
));
3242 body
= gen_rtx_PARALLEL (VOIDmode
, rtvec_alloc (num
+ nclobbers
));
3244 /* For each output operand, store a SET. */
3245 for (i
= 0; i
< noutputs
; ++i
)
3247 rtx src
, o
= output_rvec
[i
];
3250 ASM_OPERANDS_OUTPUT_CONSTRAINT (obody
) = constraints
[0];
3255 src
= gen_rtx_ASM_OPERANDS (GET_MODE (o
),
3256 ASM_OPERANDS_TEMPLATE (obody
),
3257 constraints
[i
], i
, argvec
,
3258 constraintvec
, labelvec
, locus
);
3259 MEM_VOLATILE_P (src
) = gimple_asm_volatile_p (stmt
);
3261 XVECEXP (body
, 0, i
) = gen_rtx_SET (o
, src
);
3264 /* If there are no outputs (but there are some clobbers)
3265 store the bare ASM_OPERANDS into the PARALLEL. */
3267 XVECEXP (body
, 0, i
++) = obody
;
3269 /* Store (clobber REG) for each clobbered register specified. */
3270 for (unsigned j
= 0; j
< nclobbers
; ++j
)
3272 rtx clobbered_reg
= clobber_rvec
[j
];
3274 /* Do sanity check for overlap between clobbers and respectively
3275 input and outputs that hasn't been handled. Such overlap
3276 should have been detected and reported above. */
3277 if (!clobber_conflict_found
&& REG_P (clobbered_reg
))
3279 /* We test the old body (obody) contents to avoid
3280 tripping over the under-construction body. */
3281 for (unsigned k
= 0; k
< noutputs
; ++k
)
3282 if (reg_overlap_mentioned_p (clobbered_reg
, output_rvec
[k
]))
3283 internal_error ("asm clobber conflict with output operand");
3285 for (unsigned k
= 0; k
< ninputs
- ninout
; ++k
)
3286 if (reg_overlap_mentioned_p (clobbered_reg
, input_rvec
[k
]))
3287 internal_error ("asm clobber conflict with input operand");
3290 XVECEXP (body
, 0, i
++) = gen_rtx_CLOBBER (VOIDmode
, clobbered_reg
);
3294 emit_jump_insn (body
);
3299 generating_concat_p
= old_generating_concat_p
;
3302 emit_label (fallthru_label
);
3305 emit_insn (after_md_seq
);
3307 emit_insn (after_rtl_seq
);
3310 crtl
->has_asm_statement
= 1;
3313 /* Emit code to jump to the address
3314 specified by the pointer expression EXP. */
3317 expand_computed_goto (tree exp
)
3319 rtx x
= expand_normal (exp
);
3321 do_pending_stack_adjust ();
3322 emit_indirect_jump (x
);
3325 /* Generate RTL code for a `goto' statement with target label LABEL.
3326 LABEL should be a LABEL_DECL tree node that was or will later be
3327 defined with `expand_label'. */
3330 expand_goto (tree label
)
3334 /* Check for a nonlocal goto to a containing function. Should have
3335 gotten translated to __builtin_nonlocal_goto. */
3336 tree context
= decl_function_context (label
);
3337 gcc_assert (!context
|| context
== current_function_decl
);
3340 emit_jump (jump_target_rtx (label
));
3343 /* Output a return with no value. */
3346 expand_null_return_1 (void)
3348 clear_pending_stack_adjust ();
3349 do_pending_stack_adjust ();
3350 emit_jump (return_label
);
3353 /* Generate RTL to return from the current function, with no value.
3354 (That is, we do not do anything about returning any value.) */
3357 expand_null_return (void)
3359 /* If this function was declared to return a value, but we
3360 didn't, clobber the return registers so that they are not
3361 propagated live to the rest of the function. */
3362 clobber_return_register ();
3364 expand_null_return_1 ();
3367 /* Generate RTL to return from the current function, with value VAL. */
3370 expand_value_return (rtx val
)
3372 /* Copy the value to the return location unless it's already there. */
3374 tree decl
= DECL_RESULT (current_function_decl
);
3375 rtx return_reg
= DECL_RTL (decl
);
3376 if (return_reg
!= val
)
3378 tree funtype
= TREE_TYPE (current_function_decl
);
3379 tree type
= TREE_TYPE (decl
);
3380 int unsignedp
= TYPE_UNSIGNED (type
);
3381 machine_mode old_mode
= DECL_MODE (decl
);
3383 if (DECL_BY_REFERENCE (decl
))
3384 mode
= promote_function_mode (type
, old_mode
, &unsignedp
, funtype
, 2);
3386 mode
= promote_function_mode (type
, old_mode
, &unsignedp
, funtype
, 1);
3388 if (mode
!= old_mode
)
3389 val
= convert_modes (mode
, old_mode
, val
, unsignedp
);
3391 if (GET_CODE (return_reg
) == PARALLEL
)
3392 emit_group_load (return_reg
, val
, type
, int_size_in_bytes (type
));
3394 emit_move_insn (return_reg
, val
);
3397 expand_null_return_1 ();
3400 /* Generate RTL to evaluate the expression RETVAL and return it
3401 from the current function. */
3404 expand_return (tree retval
, tree bounds
)
3411 /* If function wants no value, give it none. */
3412 if (TREE_CODE (TREE_TYPE (TREE_TYPE (current_function_decl
))) == VOID_TYPE
)
3414 expand_normal (retval
);
3415 expand_null_return ();
3419 if (retval
== error_mark_node
)
3421 /* Treat this like a return of no value from a function that
3423 expand_null_return ();
3426 else if ((TREE_CODE (retval
) == MODIFY_EXPR
3427 || TREE_CODE (retval
) == INIT_EXPR
)
3428 && TREE_CODE (TREE_OPERAND (retval
, 0)) == RESULT_DECL
)
3429 retval_rhs
= TREE_OPERAND (retval
, 1);
3431 retval_rhs
= retval
;
3433 result_rtl
= DECL_RTL (DECL_RESULT (current_function_decl
));
3435 /* Put returned bounds to the right place. */
3436 bounds_rtl
= DECL_BOUNDS_RTL (DECL_RESULT (current_function_decl
));
3442 if (bounds
&& bounds
!= error_mark_node
)
3444 bnd
= expand_normal (bounds
);
3445 targetm
.calls
.store_returned_bounds (bounds_rtl
, bnd
);
3447 else if (REG_P (bounds_rtl
))
3450 bnd
= chkp_expand_zero_bounds ();
3453 addr
= expand_normal (build_fold_addr_expr (retval_rhs
));
3454 addr
= gen_rtx_MEM (Pmode
, addr
);
3455 bnd
= targetm
.calls
.load_bounds_for_arg (addr
, NULL
, NULL
);
3458 targetm
.calls
.store_returned_bounds (bounds_rtl
, bnd
);
3464 gcc_assert (GET_CODE (bounds_rtl
) == PARALLEL
);
3467 bnd
= chkp_expand_zero_bounds ();
3470 addr
= expand_normal (build_fold_addr_expr (retval_rhs
));
3471 addr
= gen_rtx_MEM (Pmode
, addr
);
3474 for (n
= 0; n
< XVECLEN (bounds_rtl
, 0); n
++)
3476 rtx slot
= XEXP (XVECEXP (bounds_rtl
, 0, n
), 0);
3479 rtx offs
= XEXP (XVECEXP (bounds_rtl
, 0, n
), 1);
3480 rtx from
= adjust_address (addr
, Pmode
, INTVAL (offs
));
3481 bnd
= targetm
.calls
.load_bounds_for_arg (from
, NULL
, NULL
);
3483 targetm
.calls
.store_returned_bounds (slot
, bnd
);
3487 else if (chkp_function_instrumented_p (current_function_decl
)
3488 && !BOUNDED_P (retval_rhs
)
3489 && chkp_type_has_pointer (TREE_TYPE (retval_rhs
))
3490 && TREE_CODE (retval_rhs
) != RESULT_DECL
)
3492 rtx addr
= expand_normal (build_fold_addr_expr (retval_rhs
));
3493 addr
= gen_rtx_MEM (Pmode
, addr
);
3495 gcc_assert (MEM_P (result_rtl
));
3497 chkp_copy_bounds_for_stack_parm (result_rtl
, addr
, TREE_TYPE (retval_rhs
));
3500 /* If we are returning the RESULT_DECL, then the value has already
3501 been stored into it, so we don't have to do anything special. */
3502 if (TREE_CODE (retval_rhs
) == RESULT_DECL
)
3503 expand_value_return (result_rtl
);
3505 /* If the result is an aggregate that is being returned in one (or more)
3506 registers, load the registers here. */
3508 else if (retval_rhs
!= 0
3509 && TYPE_MODE (TREE_TYPE (retval_rhs
)) == BLKmode
3510 && REG_P (result_rtl
))
3512 val
= copy_blkmode_to_reg (GET_MODE (result_rtl
), retval_rhs
);
3515 /* Use the mode of the result value on the return register. */
3516 PUT_MODE (result_rtl
, GET_MODE (val
));
3517 expand_value_return (val
);
3520 expand_null_return ();
3522 else if (retval_rhs
!= 0
3523 && !VOID_TYPE_P (TREE_TYPE (retval_rhs
))
3524 && (REG_P (result_rtl
)
3525 || (GET_CODE (result_rtl
) == PARALLEL
)))
3527 /* Compute the return value into a temporary (usually a pseudo reg). */
3529 = assign_temp (TREE_TYPE (DECL_RESULT (current_function_decl
)), 0, 1);
3530 val
= expand_expr (retval_rhs
, val
, GET_MODE (val
), EXPAND_NORMAL
);
3531 val
= force_not_mem (val
);
3532 expand_value_return (val
);
3536 /* No hard reg used; calculate value into hard return reg. */
3537 expand_expr (retval
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
3538 expand_value_return (result_rtl
);
3542 /* A subroutine of expand_gimple_stmt, expanding one gimple statement
3543 STMT that doesn't require special handling for outgoing edges. That
3544 is no tailcalls and no GIMPLE_COND. */
3547 expand_gimple_stmt_1 (gimple
*stmt
)
3551 set_curr_insn_location (gimple_location (stmt
));
3553 switch (gimple_code (stmt
))
3556 op0
= gimple_goto_dest (stmt
);
3557 if (TREE_CODE (op0
) == LABEL_DECL
)
3560 expand_computed_goto (op0
);
3563 expand_label (gimple_label_label (as_a
<glabel
*> (stmt
)));
3566 case GIMPLE_PREDICT
:
3569 expand_case (as_a
<gswitch
*> (stmt
));
3572 expand_asm_stmt (as_a
<gasm
*> (stmt
));
3575 expand_call_stmt (as_a
<gcall
*> (stmt
));
3580 tree bnd
= gimple_return_retbnd (as_a
<greturn
*> (stmt
));
3581 op0
= gimple_return_retval (as_a
<greturn
*> (stmt
));
3583 if (op0
&& op0
!= error_mark_node
)
3585 tree result
= DECL_RESULT (current_function_decl
);
3587 /* Mark we have return statement with missing bounds. */
3589 && chkp_function_instrumented_p (cfun
->decl
)
3591 bnd
= error_mark_node
;
3593 /* If we are not returning the current function's RESULT_DECL,
3594 build an assignment to it. */
3597 /* I believe that a function's RESULT_DECL is unique. */
3598 gcc_assert (TREE_CODE (op0
) != RESULT_DECL
);
3600 /* ??? We'd like to use simply expand_assignment here,
3601 but this fails if the value is of BLKmode but the return
3602 decl is a register. expand_return has special handling
3603 for this combination, which eventually should move
3604 to common code. See comments there. Until then, let's
3605 build a modify expression :-/ */
3606 op0
= build2 (MODIFY_EXPR
, TREE_TYPE (result
),
3612 expand_null_return ();
3614 expand_return (op0
, bnd
);
3620 gassign
*assign_stmt
= as_a
<gassign
*> (stmt
);
3621 tree lhs
= gimple_assign_lhs (assign_stmt
);
3623 /* Tree expand used to fiddle with |= and &= of two bitfield
3624 COMPONENT_REFs here. This can't happen with gimple, the LHS
3625 of binary assigns must be a gimple reg. */
3627 if (TREE_CODE (lhs
) != SSA_NAME
3628 || get_gimple_rhs_class (gimple_expr_code (stmt
))
3629 == GIMPLE_SINGLE_RHS
)
3631 tree rhs
= gimple_assign_rhs1 (assign_stmt
);
3632 gcc_assert (get_gimple_rhs_class (gimple_expr_code (stmt
))
3633 == GIMPLE_SINGLE_RHS
);
3634 if (gimple_has_location (stmt
) && CAN_HAVE_LOCATION_P (rhs
)
3635 /* Do not put locations on possibly shared trees. */
3636 && !is_gimple_min_invariant (rhs
))
3637 SET_EXPR_LOCATION (rhs
, gimple_location (stmt
));
3638 if (TREE_CLOBBER_P (rhs
))
3639 /* This is a clobber to mark the going out of scope for
3643 expand_assignment (lhs
, rhs
,
3644 gimple_assign_nontemporal_move_p (
3650 bool nontemporal
= gimple_assign_nontemporal_move_p (assign_stmt
);
3651 struct separate_ops ops
;
3652 bool promoted
= false;
3654 target
= expand_expr (lhs
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
3655 if (GET_CODE (target
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (target
))
3658 ops
.code
= gimple_assign_rhs_code (assign_stmt
);
3659 ops
.type
= TREE_TYPE (lhs
);
3660 switch (get_gimple_rhs_class (ops
.code
))
3662 case GIMPLE_TERNARY_RHS
:
3663 ops
.op2
= gimple_assign_rhs3 (assign_stmt
);
3665 case GIMPLE_BINARY_RHS
:
3666 ops
.op1
= gimple_assign_rhs2 (assign_stmt
);
3668 case GIMPLE_UNARY_RHS
:
3669 ops
.op0
= gimple_assign_rhs1 (assign_stmt
);
3674 ops
.location
= gimple_location (stmt
);
3676 /* If we want to use a nontemporal store, force the value to
3677 register first. If we store into a promoted register,
3678 don't directly expand to target. */
3679 temp
= nontemporal
|| promoted
? NULL_RTX
: target
;
3680 temp
= expand_expr_real_2 (&ops
, temp
, GET_MODE (target
),
3687 int unsignedp
= SUBREG_PROMOTED_SIGN (target
);
3688 /* If TEMP is a VOIDmode constant, use convert_modes to make
3689 sure that we properly convert it. */
3690 if (CONSTANT_P (temp
) && GET_MODE (temp
) == VOIDmode
)
3692 temp
= convert_modes (GET_MODE (target
),
3693 TYPE_MODE (ops
.type
),
3695 temp
= convert_modes (GET_MODE (SUBREG_REG (target
)),
3696 GET_MODE (target
), temp
, unsignedp
);
3699 convert_move (SUBREG_REG (target
), temp
, unsignedp
);
3701 else if (nontemporal
&& emit_storent_insn (target
, temp
))
3705 temp
= force_operand (temp
, target
);
3707 emit_move_insn (target
, temp
);
3718 /* Expand one gimple statement STMT and return the last RTL instruction
3719 before any of the newly generated ones.
3721 In addition to generating the necessary RTL instructions this also
3722 sets REG_EH_REGION notes if necessary and sets the current source
3723 location for diagnostics. */
3726 expand_gimple_stmt (gimple
*stmt
)
3728 location_t saved_location
= input_location
;
3729 rtx_insn
*last
= get_last_insn ();
3734 /* We need to save and restore the current source location so that errors
3735 discovered during expansion are emitted with the right location. But
3736 it would be better if the diagnostic routines used the source location
3737 embedded in the tree nodes rather than globals. */
3738 if (gimple_has_location (stmt
))
3739 input_location
= gimple_location (stmt
);
3741 expand_gimple_stmt_1 (stmt
);
3743 /* Free any temporaries used to evaluate this statement. */
3746 input_location
= saved_location
;
3748 /* Mark all insns that may trap. */
3749 lp_nr
= lookup_stmt_eh_lp (stmt
);
3753 for (insn
= next_real_insn (last
); insn
;
3754 insn
= next_real_insn (insn
))
3756 if (! find_reg_note (insn
, REG_EH_REGION
, NULL_RTX
)
3757 /* If we want exceptions for non-call insns, any
3758 may_trap_p instruction may throw. */
3759 && GET_CODE (PATTERN (insn
)) != CLOBBER
3760 && GET_CODE (PATTERN (insn
)) != USE
3761 && insn_could_throw_p (insn
))
3762 make_reg_eh_region_note (insn
, 0, lp_nr
);
3769 /* A subroutine of expand_gimple_basic_block. Expand one GIMPLE_CALL
3770 that has CALL_EXPR_TAILCALL set. Returns non-null if we actually
3771 generated a tail call (something that might be denied by the ABI
3772 rules governing the call; see calls.c).
3774 Sets CAN_FALLTHRU if we generated a *conditional* tail call, and
3775 can still reach the rest of BB. The case here is __builtin_sqrt,
3776 where the NaN result goes through the external function (with a
3777 tailcall) and the normal result happens via a sqrt instruction. */
3780 expand_gimple_tailcall (basic_block bb
, gcall
*stmt
, bool *can_fallthru
)
3782 rtx_insn
*last2
, *last
;
3787 last2
= last
= expand_gimple_stmt (stmt
);
3789 for (last
= NEXT_INSN (last
); last
; last
= NEXT_INSN (last
))
3790 if (CALL_P (last
) && SIBLING_CALL_P (last
))
3793 maybe_dump_rtl_for_gimple_stmt (stmt
, last2
);
3795 *can_fallthru
= true;
3799 /* ??? Wouldn't it be better to just reset any pending stack adjust?
3800 Any instructions emitted here are about to be deleted. */
3801 do_pending_stack_adjust ();
3803 /* Remove any non-eh, non-abnormal edges that don't go to exit. */
3804 /* ??? I.e. the fallthrough edge. HOWEVER! If there were to be
3805 EH or abnormal edges, we shouldn't have created a tail call in
3806 the first place. So it seems to me we should just be removing
3807 all edges here, or redirecting the existing fallthru edge to
3811 profile_count count
= profile_count::zero ();
3813 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
3815 if (!(e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
)))
3817 if (e
->dest
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
3819 e
->dest
->count
-= e
->count
;
3820 e
->dest
->frequency
-= EDGE_FREQUENCY (e
);
3821 if (e
->dest
->frequency
< 0)
3822 e
->dest
->frequency
= 0;
3825 probability
+= e
->probability
;
3832 /* This is somewhat ugly: the call_expr expander often emits instructions
3833 after the sibcall (to perform the function return). These confuse the
3834 find_many_sub_basic_blocks code, so we need to get rid of these. */
3835 last
= NEXT_INSN (last
);
3836 gcc_assert (BARRIER_P (last
));
3838 *can_fallthru
= false;
3839 while (NEXT_INSN (last
))
3841 /* For instance an sqrt builtin expander expands if with
3842 sibcall in the then and label for `else`. */
3843 if (LABEL_P (NEXT_INSN (last
)))
3845 *can_fallthru
= true;
3848 delete_insn (NEXT_INSN (last
));
3851 e
= make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), EDGE_ABNORMAL
3853 e
->probability
= probability
;
3856 update_bb_for_insn (bb
);
3858 if (NEXT_INSN (last
))
3860 bb
= create_basic_block (NEXT_INSN (last
), get_last_insn (), bb
);
3863 if (BARRIER_P (last
))
3864 BB_END (bb
) = PREV_INSN (last
);
3867 maybe_dump_rtl_for_gimple_stmt (stmt
, last2
);
3872 /* Return the difference between the floor and the truncated result of
3873 a signed division by OP1 with remainder MOD. */
3875 floor_sdiv_adjust (machine_mode mode
, rtx mod
, rtx op1
)
3877 /* (mod != 0 ? (op1 / mod < 0 ? -1 : 0) : 0) */
3878 return gen_rtx_IF_THEN_ELSE
3879 (mode
, gen_rtx_NE (BImode
, mod
, const0_rtx
),
3880 gen_rtx_IF_THEN_ELSE
3881 (mode
, gen_rtx_LT (BImode
,
3882 gen_rtx_DIV (mode
, op1
, mod
),
3884 constm1_rtx
, const0_rtx
),
3888 /* Return the difference between the ceil and the truncated result of
3889 a signed division by OP1 with remainder MOD. */
3891 ceil_sdiv_adjust (machine_mode mode
, rtx mod
, rtx op1
)
3893 /* (mod != 0 ? (op1 / mod > 0 ? 1 : 0) : 0) */
3894 return gen_rtx_IF_THEN_ELSE
3895 (mode
, gen_rtx_NE (BImode
, mod
, const0_rtx
),
3896 gen_rtx_IF_THEN_ELSE
3897 (mode
, gen_rtx_GT (BImode
,
3898 gen_rtx_DIV (mode
, op1
, mod
),
3900 const1_rtx
, const0_rtx
),
3904 /* Return the difference between the ceil and the truncated result of
3905 an unsigned division by OP1 with remainder MOD. */
3907 ceil_udiv_adjust (machine_mode mode
, rtx mod
, rtx op1 ATTRIBUTE_UNUSED
)
3909 /* (mod != 0 ? 1 : 0) */
3910 return gen_rtx_IF_THEN_ELSE
3911 (mode
, gen_rtx_NE (BImode
, mod
, const0_rtx
),
3912 const1_rtx
, const0_rtx
);
3915 /* Return the difference between the rounded and the truncated result
3916 of a signed division by OP1 with remainder MOD. Halfway cases are
3917 rounded away from zero, rather than to the nearest even number. */
3919 round_sdiv_adjust (machine_mode mode
, rtx mod
, rtx op1
)
3921 /* (abs (mod) >= abs (op1) - abs (mod)
3922 ? (op1 / mod > 0 ? 1 : -1)
3924 return gen_rtx_IF_THEN_ELSE
3925 (mode
, gen_rtx_GE (BImode
, gen_rtx_ABS (mode
, mod
),
3926 gen_rtx_MINUS (mode
,
3927 gen_rtx_ABS (mode
, op1
),
3928 gen_rtx_ABS (mode
, mod
))),
3929 gen_rtx_IF_THEN_ELSE
3930 (mode
, gen_rtx_GT (BImode
,
3931 gen_rtx_DIV (mode
, op1
, mod
),
3933 const1_rtx
, constm1_rtx
),
3937 /* Return the difference between the rounded and the truncated result
3938 of a unsigned division by OP1 with remainder MOD. Halfway cases
3939 are rounded away from zero, rather than to the nearest even
3942 round_udiv_adjust (machine_mode mode
, rtx mod
, rtx op1
)
3944 /* (mod >= op1 - mod ? 1 : 0) */
3945 return gen_rtx_IF_THEN_ELSE
3946 (mode
, gen_rtx_GE (BImode
, mod
,
3947 gen_rtx_MINUS (mode
, op1
, mod
)),
3948 const1_rtx
, const0_rtx
);
3951 /* Convert X to MODE, that must be Pmode or ptr_mode, without emitting
3955 convert_debug_memory_address (machine_mode mode
, rtx x
,
3958 machine_mode xmode
= GET_MODE (x
);
3960 #ifndef POINTERS_EXTEND_UNSIGNED
3961 gcc_assert (mode
== Pmode
3962 || mode
== targetm
.addr_space
.address_mode (as
));
3963 gcc_assert (xmode
== mode
|| xmode
== VOIDmode
);
3967 gcc_assert (targetm
.addr_space
.valid_pointer_mode (mode
, as
));
3969 if (GET_MODE (x
) == mode
|| GET_MODE (x
) == VOIDmode
)
3972 if (GET_MODE_PRECISION (mode
) < GET_MODE_PRECISION (xmode
))
3973 x
= lowpart_subreg (mode
, x
, xmode
);
3974 else if (POINTERS_EXTEND_UNSIGNED
> 0)
3975 x
= gen_rtx_ZERO_EXTEND (mode
, x
);
3976 else if (!POINTERS_EXTEND_UNSIGNED
)
3977 x
= gen_rtx_SIGN_EXTEND (mode
, x
);
3980 switch (GET_CODE (x
))
3983 if ((SUBREG_PROMOTED_VAR_P (x
)
3984 || (REG_P (SUBREG_REG (x
)) && REG_POINTER (SUBREG_REG (x
)))
3985 || (GET_CODE (SUBREG_REG (x
)) == PLUS
3986 && REG_P (XEXP (SUBREG_REG (x
), 0))
3987 && REG_POINTER (XEXP (SUBREG_REG (x
), 0))
3988 && CONST_INT_P (XEXP (SUBREG_REG (x
), 1))))
3989 && GET_MODE (SUBREG_REG (x
)) == mode
)
3990 return SUBREG_REG (x
);
3993 temp
= gen_rtx_LABEL_REF (mode
, label_ref_label (x
));
3994 LABEL_REF_NONLOCAL_P (temp
) = LABEL_REF_NONLOCAL_P (x
);
3997 temp
= shallow_copy_rtx (x
);
3998 PUT_MODE (temp
, mode
);
4001 temp
= convert_debug_memory_address (mode
, XEXP (x
, 0), as
);
4003 temp
= gen_rtx_CONST (mode
, temp
);
4007 if (CONST_INT_P (XEXP (x
, 1)))
4009 temp
= convert_debug_memory_address (mode
, XEXP (x
, 0), as
);
4011 return gen_rtx_fmt_ee (GET_CODE (x
), mode
, temp
, XEXP (x
, 1));
4017 /* Don't know how to express ptr_extend as operation in debug info. */
4020 #endif /* POINTERS_EXTEND_UNSIGNED */
4025 /* Map from SSA_NAMEs to corresponding DEBUG_EXPR_DECLs created
4026 by avoid_deep_ter_for_debug. */
4028 static hash_map
<tree
, tree
> *deep_ter_debug_map
;
4030 /* Split too deep TER chains for debug stmts using debug temporaries. */
4033 avoid_deep_ter_for_debug (gimple
*stmt
, int depth
)
4035 use_operand_p use_p
;
4037 FOR_EACH_SSA_USE_OPERAND (use_p
, stmt
, iter
, SSA_OP_USE
)
4039 tree use
= USE_FROM_PTR (use_p
);
4040 if (TREE_CODE (use
) != SSA_NAME
|| SSA_NAME_IS_DEFAULT_DEF (use
))
4042 gimple
*g
= get_gimple_for_ssa_name (use
);
4045 if (depth
> 6 && !stmt_ends_bb_p (g
))
4047 if (deep_ter_debug_map
== NULL
)
4048 deep_ter_debug_map
= new hash_map
<tree
, tree
>;
4050 tree
&vexpr
= deep_ter_debug_map
->get_or_insert (use
);
4053 vexpr
= make_node (DEBUG_EXPR_DECL
);
4054 gimple
*def_temp
= gimple_build_debug_bind (vexpr
, use
, g
);
4055 DECL_ARTIFICIAL (vexpr
) = 1;
4056 TREE_TYPE (vexpr
) = TREE_TYPE (use
);
4057 SET_DECL_MODE (vexpr
, TYPE_MODE (TREE_TYPE (use
)));
4058 gimple_stmt_iterator gsi
= gsi_for_stmt (g
);
4059 gsi_insert_after (&gsi
, def_temp
, GSI_NEW_STMT
);
4060 avoid_deep_ter_for_debug (def_temp
, 0);
4063 avoid_deep_ter_for_debug (g
, depth
+ 1);
4067 /* Return an RTX equivalent to the value of the parameter DECL. */
4070 expand_debug_parm_decl (tree decl
)
4072 rtx incoming
= DECL_INCOMING_RTL (decl
);
4075 && GET_MODE (incoming
) != BLKmode
4076 && ((REG_P (incoming
) && HARD_REGISTER_P (incoming
))
4077 || (MEM_P (incoming
)
4078 && REG_P (XEXP (incoming
, 0))
4079 && HARD_REGISTER_P (XEXP (incoming
, 0)))))
4081 rtx rtl
= gen_rtx_ENTRY_VALUE (GET_MODE (incoming
));
4083 #ifdef HAVE_window_save
4084 /* DECL_INCOMING_RTL uses the INCOMING_REGNO of parameter registers.
4085 If the target machine has an explicit window save instruction, the
4086 actual entry value is the corresponding OUTGOING_REGNO instead. */
4087 if (REG_P (incoming
)
4088 && OUTGOING_REGNO (REGNO (incoming
)) != REGNO (incoming
))
4090 = gen_rtx_REG_offset (incoming
, GET_MODE (incoming
),
4091 OUTGOING_REGNO (REGNO (incoming
)), 0);
4092 else if (MEM_P (incoming
))
4094 rtx reg
= XEXP (incoming
, 0);
4095 if (OUTGOING_REGNO (REGNO (reg
)) != REGNO (reg
))
4097 reg
= gen_raw_REG (GET_MODE (reg
), OUTGOING_REGNO (REGNO (reg
)));
4098 incoming
= replace_equiv_address_nv (incoming
, reg
);
4101 incoming
= copy_rtx (incoming
);
4105 ENTRY_VALUE_EXP (rtl
) = incoming
;
4110 && GET_MODE (incoming
) != BLKmode
4111 && !TREE_ADDRESSABLE (decl
)
4113 && (XEXP (incoming
, 0) == virtual_incoming_args_rtx
4114 || (GET_CODE (XEXP (incoming
, 0)) == PLUS
4115 && XEXP (XEXP (incoming
, 0), 0) == virtual_incoming_args_rtx
4116 && CONST_INT_P (XEXP (XEXP (incoming
, 0), 1)))))
4117 return copy_rtx (incoming
);
4122 /* Return an RTX equivalent to the value of the tree expression EXP. */
4125 expand_debug_expr (tree exp
)
4127 rtx op0
= NULL_RTX
, op1
= NULL_RTX
, op2
= NULL_RTX
;
4128 machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
4129 machine_mode inner_mode
= VOIDmode
;
4130 int unsignedp
= TYPE_UNSIGNED (TREE_TYPE (exp
));
4133 switch (TREE_CODE_CLASS (TREE_CODE (exp
)))
4135 case tcc_expression
:
4136 switch (TREE_CODE (exp
))
4141 case WIDEN_MULT_PLUS_EXPR
:
4142 case WIDEN_MULT_MINUS_EXPR
:
4146 case TRUTH_ANDIF_EXPR
:
4147 case TRUTH_ORIF_EXPR
:
4148 case TRUTH_AND_EXPR
:
4150 case TRUTH_XOR_EXPR
:
4153 case TRUTH_NOT_EXPR
:
4162 op2
= expand_debug_expr (TREE_OPERAND (exp
, 2));
4169 op1
= expand_debug_expr (TREE_OPERAND (exp
, 1));
4172 switch (TREE_CODE (exp
))
4178 case WIDEN_LSHIFT_EXPR
:
4179 /* Ensure second operand isn't wider than the first one. */
4180 inner_mode
= TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 1)));
4181 if (SCALAR_INT_MODE_P (inner_mode
))
4183 machine_mode opmode
= mode
;
4184 if (VECTOR_MODE_P (mode
))
4185 opmode
= GET_MODE_INNER (mode
);
4186 if (SCALAR_INT_MODE_P (opmode
)
4187 && (GET_MODE_PRECISION (opmode
)
4188 < GET_MODE_PRECISION (inner_mode
)))
4189 op1
= lowpart_subreg (opmode
, op1
, inner_mode
);
4199 inner_mode
= TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
4200 op0
= expand_debug_expr (TREE_OPERAND (exp
, 0));
4205 case tcc_comparison
:
4206 unsignedp
= TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0)));
4214 case tcc_exceptional
:
4215 case tcc_declaration
:
4221 switch (TREE_CODE (exp
))
4224 if (!lookup_constant_def (exp
))
4226 if (strlen (TREE_STRING_POINTER (exp
)) + 1
4227 != (size_t) TREE_STRING_LENGTH (exp
))
4229 op0
= gen_rtx_CONST_STRING (Pmode
, TREE_STRING_POINTER (exp
));
4230 op0
= gen_rtx_MEM (BLKmode
, op0
);
4231 set_mem_attributes (op0
, exp
, 0);
4239 op0
= expand_expr (exp
, NULL_RTX
, mode
, EXPAND_INITIALIZER
);
4243 gcc_assert (COMPLEX_MODE_P (mode
));
4244 op0
= expand_debug_expr (TREE_REALPART (exp
));
4245 op1
= expand_debug_expr (TREE_IMAGPART (exp
));
4246 return gen_rtx_CONCAT (mode
, op0
, op1
);
4248 case DEBUG_EXPR_DECL
:
4249 op0
= DECL_RTL_IF_SET (exp
);
4254 op0
= gen_rtx_DEBUG_EXPR (mode
);
4255 DEBUG_EXPR_TREE_DECL (op0
) = exp
;
4256 SET_DECL_RTL (exp
, op0
);
4266 op0
= DECL_RTL_IF_SET (exp
);
4268 /* This decl was probably optimized away. */
4272 || DECL_EXTERNAL (exp
)
4273 || !TREE_STATIC (exp
)
4275 || DECL_HARD_REGISTER (exp
)
4276 || DECL_IN_CONSTANT_POOL (exp
)
4277 || mode
== VOIDmode
)
4280 op0
= make_decl_rtl_for_debug (exp
);
4282 || GET_CODE (XEXP (op0
, 0)) != SYMBOL_REF
4283 || SYMBOL_REF_DECL (XEXP (op0
, 0)) != exp
)
4287 op0
= copy_rtx (op0
);
4289 if (GET_MODE (op0
) == BLKmode
4290 /* If op0 is not BLKmode, but mode is, adjust_mode
4291 below would ICE. While it is likely a FE bug,
4292 try to be robust here. See PR43166. */
4294 || (mode
== VOIDmode
&& GET_MODE (op0
) != VOIDmode
))
4296 gcc_assert (MEM_P (op0
));
4297 op0
= adjust_address_nv (op0
, mode
, 0);
4307 inner_mode
= GET_MODE (op0
);
4309 if (mode
== inner_mode
)
4312 if (inner_mode
== VOIDmode
)
4314 if (TREE_CODE (exp
) == SSA_NAME
)
4315 inner_mode
= TYPE_MODE (TREE_TYPE (exp
));
4317 inner_mode
= TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
4318 if (mode
== inner_mode
)
4322 if (FLOAT_MODE_P (mode
) && FLOAT_MODE_P (inner_mode
))
4324 if (GET_MODE_BITSIZE (mode
) == GET_MODE_BITSIZE (inner_mode
))
4325 op0
= simplify_gen_subreg (mode
, op0
, inner_mode
, 0);
4326 else if (GET_MODE_BITSIZE (mode
) < GET_MODE_BITSIZE (inner_mode
))
4327 op0
= simplify_gen_unary (FLOAT_TRUNCATE
, mode
, op0
, inner_mode
);
4329 op0
= simplify_gen_unary (FLOAT_EXTEND
, mode
, op0
, inner_mode
);
4331 else if (FLOAT_MODE_P (mode
))
4333 gcc_assert (TREE_CODE (exp
) != SSA_NAME
);
4334 if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))))
4335 op0
= simplify_gen_unary (UNSIGNED_FLOAT
, mode
, op0
, inner_mode
);
4337 op0
= simplify_gen_unary (FLOAT
, mode
, op0
, inner_mode
);
4339 else if (FLOAT_MODE_P (inner_mode
))
4342 op0
= simplify_gen_unary (UNSIGNED_FIX
, mode
, op0
, inner_mode
);
4344 op0
= simplify_gen_unary (FIX
, mode
, op0
, inner_mode
);
4346 else if (CONSTANT_P (op0
)
4347 || GET_MODE_PRECISION (mode
) <= GET_MODE_PRECISION (inner_mode
))
4348 op0
= lowpart_subreg (mode
, op0
, inner_mode
);
4349 else if (UNARY_CLASS_P (exp
)
4350 ? TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0)))
4352 op0
= simplify_gen_unary (ZERO_EXTEND
, mode
, op0
, inner_mode
);
4354 op0
= simplify_gen_unary (SIGN_EXTEND
, mode
, op0
, inner_mode
);
4360 if (!is_gimple_mem_ref_addr (TREE_OPERAND (exp
, 0)))
4362 tree newexp
= fold_binary (MEM_REF
, TREE_TYPE (exp
),
4363 TREE_OPERAND (exp
, 0),
4364 TREE_OPERAND (exp
, 1));
4366 return expand_debug_expr (newexp
);
4370 inner_mode
= TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
4371 op0
= expand_debug_expr (TREE_OPERAND (exp
, 0));
4375 if (TREE_CODE (exp
) == MEM_REF
)
4377 if (GET_CODE (op0
) == DEBUG_IMPLICIT_PTR
4378 || (GET_CODE (op0
) == PLUS
4379 && GET_CODE (XEXP (op0
, 0)) == DEBUG_IMPLICIT_PTR
))
4380 /* (mem (debug_implicit_ptr)) might confuse aliasing.
4381 Instead just use get_inner_reference. */
4384 op1
= expand_debug_expr (TREE_OPERAND (exp
, 1));
4385 if (!op1
|| !CONST_INT_P (op1
))
4388 op0
= plus_constant (inner_mode
, op0
, INTVAL (op1
));
4391 as
= TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0))));
4393 op0
= convert_debug_memory_address (targetm
.addr_space
.address_mode (as
),
4395 if (op0
== NULL_RTX
)
4398 op0
= gen_rtx_MEM (mode
, op0
);
4399 set_mem_attributes (op0
, exp
, 0);
4400 if (TREE_CODE (exp
) == MEM_REF
4401 && !is_gimple_mem_ref_addr (TREE_OPERAND (exp
, 0)))
4402 set_mem_expr (op0
, NULL_TREE
);
4403 set_mem_addr_space (op0
, as
);
4407 case TARGET_MEM_REF
:
4408 if (TREE_CODE (TMR_BASE (exp
)) == ADDR_EXPR
4409 && !DECL_RTL_SET_P (TREE_OPERAND (TMR_BASE (exp
), 0)))
4412 op0
= expand_debug_expr
4413 (tree_mem_ref_addr (build_pointer_type (TREE_TYPE (exp
)), exp
));
4417 as
= TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0))));
4418 op0
= convert_debug_memory_address (targetm
.addr_space
.address_mode (as
),
4420 if (op0
== NULL_RTX
)
4423 op0
= gen_rtx_MEM (mode
, op0
);
4425 set_mem_attributes (op0
, exp
, 0);
4426 set_mem_addr_space (op0
, as
);
4432 case ARRAY_RANGE_REF
:
4437 case VIEW_CONVERT_EXPR
:
4440 HOST_WIDE_INT bitsize
, bitpos
;
4442 int reversep
, volatilep
= 0;
4444 = get_inner_reference (exp
, &bitsize
, &bitpos
, &offset
, &mode1
,
4445 &unsignedp
, &reversep
, &volatilep
);
4451 orig_op0
= op0
= expand_debug_expr (tem
);
4458 machine_mode addrmode
, offmode
;
4463 op0
= XEXP (op0
, 0);
4464 addrmode
= GET_MODE (op0
);
4465 if (addrmode
== VOIDmode
)
4468 op1
= expand_debug_expr (offset
);
4472 offmode
= GET_MODE (op1
);
4473 if (offmode
== VOIDmode
)
4474 offmode
= TYPE_MODE (TREE_TYPE (offset
));
4476 if (addrmode
!= offmode
)
4477 op1
= lowpart_subreg (addrmode
, op1
, offmode
);
4479 /* Don't use offset_address here, we don't need a
4480 recognizable address, and we don't want to generate
4482 op0
= gen_rtx_MEM (mode
, simplify_gen_binary (PLUS
, addrmode
,
4488 if (mode1
== VOIDmode
)
4490 mode1
= smallest_mode_for_size (bitsize
, MODE_INT
);
4491 if (bitpos
>= BITS_PER_UNIT
)
4493 op0
= adjust_address_nv (op0
, mode1
, bitpos
/ BITS_PER_UNIT
);
4494 bitpos
%= BITS_PER_UNIT
;
4496 else if (bitpos
< 0)
4499 = (-bitpos
+ BITS_PER_UNIT
- 1) / BITS_PER_UNIT
;
4500 op0
= adjust_address_nv (op0
, mode1
, -units
);
4501 bitpos
+= units
* BITS_PER_UNIT
;
4503 else if (bitpos
== 0 && bitsize
== GET_MODE_BITSIZE (mode
))
4504 op0
= adjust_address_nv (op0
, mode
, 0);
4505 else if (GET_MODE (op0
) != mode1
)
4506 op0
= adjust_address_nv (op0
, mode1
, 0);
4508 op0
= copy_rtx (op0
);
4509 if (op0
== orig_op0
)
4510 op0
= shallow_copy_rtx (op0
);
4511 set_mem_attributes (op0
, exp
, 0);
4514 if (bitpos
== 0 && mode
== GET_MODE (op0
))
4520 if (GET_MODE (op0
) == BLKmode
)
4523 if ((bitpos
% BITS_PER_UNIT
) == 0
4524 && bitsize
== GET_MODE_BITSIZE (mode1
))
4526 machine_mode opmode
= GET_MODE (op0
);
4528 if (opmode
== VOIDmode
)
4529 opmode
= TYPE_MODE (TREE_TYPE (tem
));
4531 /* This condition may hold if we're expanding the address
4532 right past the end of an array that turned out not to
4533 be addressable (i.e., the address was only computed in
4534 debug stmts). The gen_subreg below would rightfully
4535 crash, and the address doesn't really exist, so just
4537 if (bitpos
>= GET_MODE_BITSIZE (opmode
))
4540 if ((bitpos
% GET_MODE_BITSIZE (mode
)) == 0)
4541 return simplify_gen_subreg (mode
, op0
, opmode
,
4542 bitpos
/ BITS_PER_UNIT
);
4545 return simplify_gen_ternary (SCALAR_INT_MODE_P (GET_MODE (op0
))
4546 && TYPE_UNSIGNED (TREE_TYPE (exp
))
4548 : ZERO_EXTRACT
, mode
,
4549 GET_MODE (op0
) != VOIDmode
4551 : TYPE_MODE (TREE_TYPE (tem
)),
4552 op0
, GEN_INT (bitsize
), GEN_INT (bitpos
));
4556 return simplify_gen_unary (ABS
, mode
, op0
, mode
);
4559 return simplify_gen_unary (NEG
, mode
, op0
, mode
);
4562 return simplify_gen_unary (NOT
, mode
, op0
, mode
);
4565 return simplify_gen_unary (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
,
4567 ? UNSIGNED_FLOAT
: FLOAT
, mode
, op0
,
4570 case FIX_TRUNC_EXPR
:
4571 return simplify_gen_unary (unsignedp
? UNSIGNED_FIX
: FIX
, mode
, op0
,
4574 case POINTER_PLUS_EXPR
:
4575 /* For the rare target where pointers are not the same size as
4576 size_t, we need to check for mis-matched modes and correct
4579 && GET_MODE (op0
) != VOIDmode
&& GET_MODE (op1
) != VOIDmode
4580 && GET_MODE (op0
) != GET_MODE (op1
))
4582 if (GET_MODE_BITSIZE (GET_MODE (op0
)) < GET_MODE_BITSIZE (GET_MODE (op1
))
4583 /* If OP0 is a partial mode, then we must truncate, even if it has
4584 the same bitsize as OP1 as GCC's representation of partial modes
4586 || (GET_MODE_CLASS (GET_MODE (op0
)) == MODE_PARTIAL_INT
4587 && GET_MODE_BITSIZE (GET_MODE (op0
)) == GET_MODE_BITSIZE (GET_MODE (op1
))))
4588 op1
= simplify_gen_unary (TRUNCATE
, GET_MODE (op0
), op1
,
4591 /* We always sign-extend, regardless of the signedness of
4592 the operand, because the operand is always unsigned
4593 here even if the original C expression is signed. */
4594 op1
= simplify_gen_unary (SIGN_EXTEND
, GET_MODE (op0
), op1
,
4599 return simplify_gen_binary (PLUS
, mode
, op0
, op1
);
4602 return simplify_gen_binary (MINUS
, mode
, op0
, op1
);
4605 return simplify_gen_binary (MULT
, mode
, op0
, op1
);
4608 case TRUNC_DIV_EXPR
:
4609 case EXACT_DIV_EXPR
:
4611 return simplify_gen_binary (UDIV
, mode
, op0
, op1
);
4613 return simplify_gen_binary (DIV
, mode
, op0
, op1
);
4615 case TRUNC_MOD_EXPR
:
4616 return simplify_gen_binary (unsignedp
? UMOD
: MOD
, mode
, op0
, op1
);
4618 case FLOOR_DIV_EXPR
:
4620 return simplify_gen_binary (UDIV
, mode
, op0
, op1
);
4623 rtx div
= simplify_gen_binary (DIV
, mode
, op0
, op1
);
4624 rtx mod
= simplify_gen_binary (MOD
, mode
, op0
, op1
);
4625 rtx adj
= floor_sdiv_adjust (mode
, mod
, op1
);
4626 return simplify_gen_binary (PLUS
, mode
, div
, adj
);
4629 case FLOOR_MOD_EXPR
:
4631 return simplify_gen_binary (UMOD
, mode
, op0
, op1
);
4634 rtx mod
= simplify_gen_binary (MOD
, mode
, op0
, op1
);
4635 rtx adj
= floor_sdiv_adjust (mode
, mod
, op1
);
4636 adj
= simplify_gen_unary (NEG
, mode
,
4637 simplify_gen_binary (MULT
, mode
, adj
, op1
),
4639 return simplify_gen_binary (PLUS
, mode
, mod
, adj
);
4645 rtx div
= simplify_gen_binary (UDIV
, mode
, op0
, op1
);
4646 rtx mod
= simplify_gen_binary (UMOD
, mode
, op0
, op1
);
4647 rtx adj
= ceil_udiv_adjust (mode
, mod
, op1
);
4648 return simplify_gen_binary (PLUS
, mode
, div
, adj
);
4652 rtx div
= simplify_gen_binary (DIV
, mode
, op0
, op1
);
4653 rtx mod
= simplify_gen_binary (MOD
, mode
, op0
, op1
);
4654 rtx adj
= ceil_sdiv_adjust (mode
, mod
, op1
);
4655 return simplify_gen_binary (PLUS
, mode
, div
, adj
);
4661 rtx mod
= simplify_gen_binary (UMOD
, mode
, op0
, op1
);
4662 rtx adj
= ceil_udiv_adjust (mode
, mod
, op1
);
4663 adj
= simplify_gen_unary (NEG
, mode
,
4664 simplify_gen_binary (MULT
, mode
, adj
, op1
),
4666 return simplify_gen_binary (PLUS
, mode
, mod
, adj
);
4670 rtx mod
= simplify_gen_binary (MOD
, mode
, op0
, op1
);
4671 rtx adj
= ceil_sdiv_adjust (mode
, mod
, op1
);
4672 adj
= simplify_gen_unary (NEG
, mode
,
4673 simplify_gen_binary (MULT
, mode
, adj
, op1
),
4675 return simplify_gen_binary (PLUS
, mode
, mod
, adj
);
4678 case ROUND_DIV_EXPR
:
4681 rtx div
= simplify_gen_binary (UDIV
, mode
, op0
, op1
);
4682 rtx mod
= simplify_gen_binary (UMOD
, mode
, op0
, op1
);
4683 rtx adj
= round_udiv_adjust (mode
, mod
, op1
);
4684 return simplify_gen_binary (PLUS
, mode
, div
, adj
);
4688 rtx div
= simplify_gen_binary (DIV
, mode
, op0
, op1
);
4689 rtx mod
= simplify_gen_binary (MOD
, mode
, op0
, op1
);
4690 rtx adj
= round_sdiv_adjust (mode
, mod
, op1
);
4691 return simplify_gen_binary (PLUS
, mode
, div
, adj
);
4694 case ROUND_MOD_EXPR
:
4697 rtx mod
= simplify_gen_binary (UMOD
, mode
, op0
, op1
);
4698 rtx adj
= round_udiv_adjust (mode
, mod
, op1
);
4699 adj
= simplify_gen_unary (NEG
, mode
,
4700 simplify_gen_binary (MULT
, mode
, adj
, op1
),
4702 return simplify_gen_binary (PLUS
, mode
, mod
, adj
);
4706 rtx mod
= simplify_gen_binary (MOD
, mode
, op0
, op1
);
4707 rtx adj
= round_sdiv_adjust (mode
, mod
, op1
);
4708 adj
= simplify_gen_unary (NEG
, mode
,
4709 simplify_gen_binary (MULT
, mode
, adj
, op1
),
4711 return simplify_gen_binary (PLUS
, mode
, mod
, adj
);
4715 return simplify_gen_binary (ASHIFT
, mode
, op0
, op1
);
4719 return simplify_gen_binary (LSHIFTRT
, mode
, op0
, op1
);
4721 return simplify_gen_binary (ASHIFTRT
, mode
, op0
, op1
);
4724 return simplify_gen_binary (ROTATE
, mode
, op0
, op1
);
4727 return simplify_gen_binary (ROTATERT
, mode
, op0
, op1
);
4730 return simplify_gen_binary (unsignedp
? UMIN
: SMIN
, mode
, op0
, op1
);
4733 return simplify_gen_binary (unsignedp
? UMAX
: SMAX
, mode
, op0
, op1
);
4736 case TRUTH_AND_EXPR
:
4737 return simplify_gen_binary (AND
, mode
, op0
, op1
);
4741 return simplify_gen_binary (IOR
, mode
, op0
, op1
);
4744 case TRUTH_XOR_EXPR
:
4745 return simplify_gen_binary (XOR
, mode
, op0
, op1
);
4747 case TRUTH_ANDIF_EXPR
:
4748 return gen_rtx_IF_THEN_ELSE (mode
, op0
, op1
, const0_rtx
);
4750 case TRUTH_ORIF_EXPR
:
4751 return gen_rtx_IF_THEN_ELSE (mode
, op0
, const_true_rtx
, op1
);
4753 case TRUTH_NOT_EXPR
:
4754 return simplify_gen_relational (EQ
, mode
, inner_mode
, op0
, const0_rtx
);
4757 return simplify_gen_relational (unsignedp
? LTU
: LT
, mode
, inner_mode
,
4761 return simplify_gen_relational (unsignedp
? LEU
: LE
, mode
, inner_mode
,
4765 return simplify_gen_relational (unsignedp
? GTU
: GT
, mode
, inner_mode
,
4769 return simplify_gen_relational (unsignedp
? GEU
: GE
, mode
, inner_mode
,
4773 return simplify_gen_relational (EQ
, mode
, inner_mode
, op0
, op1
);
4776 return simplify_gen_relational (NE
, mode
, inner_mode
, op0
, op1
);
4778 case UNORDERED_EXPR
:
4779 return simplify_gen_relational (UNORDERED
, mode
, inner_mode
, op0
, op1
);
4782 return simplify_gen_relational (ORDERED
, mode
, inner_mode
, op0
, op1
);
4785 return simplify_gen_relational (UNLT
, mode
, inner_mode
, op0
, op1
);
4788 return simplify_gen_relational (UNLE
, mode
, inner_mode
, op0
, op1
);
4791 return simplify_gen_relational (UNGT
, mode
, inner_mode
, op0
, op1
);
4794 return simplify_gen_relational (UNGE
, mode
, inner_mode
, op0
, op1
);
4797 return simplify_gen_relational (UNEQ
, mode
, inner_mode
, op0
, op1
);
4800 return simplify_gen_relational (LTGT
, mode
, inner_mode
, op0
, op1
);
4803 return gen_rtx_IF_THEN_ELSE (mode
, op0
, op1
, op2
);
4806 gcc_assert (COMPLEX_MODE_P (mode
));
4807 if (GET_MODE (op0
) == VOIDmode
)
4808 op0
= gen_rtx_CONST (GET_MODE_INNER (mode
), op0
);
4809 if (GET_MODE (op1
) == VOIDmode
)
4810 op1
= gen_rtx_CONST (GET_MODE_INNER (mode
), op1
);
4811 return gen_rtx_CONCAT (mode
, op0
, op1
);
4814 if (GET_CODE (op0
) == CONCAT
)
4815 return gen_rtx_CONCAT (mode
, XEXP (op0
, 0),
4816 simplify_gen_unary (NEG
, GET_MODE_INNER (mode
),
4818 GET_MODE_INNER (mode
)));
4821 machine_mode imode
= GET_MODE_INNER (mode
);
4826 re
= adjust_address_nv (op0
, imode
, 0);
4827 im
= adjust_address_nv (op0
, imode
, GET_MODE_SIZE (imode
));
4831 machine_mode ifmode
= int_mode_for_mode (mode
);
4832 machine_mode ihmode
= int_mode_for_mode (imode
);
4834 if (ifmode
== BLKmode
|| ihmode
== BLKmode
)
4836 halfsize
= GEN_INT (GET_MODE_BITSIZE (ihmode
));
4839 re
= gen_rtx_SUBREG (ifmode
, re
, 0);
4840 re
= gen_rtx_ZERO_EXTRACT (ihmode
, re
, halfsize
, const0_rtx
);
4841 if (imode
!= ihmode
)
4842 re
= gen_rtx_SUBREG (imode
, re
, 0);
4843 im
= copy_rtx (op0
);
4845 im
= gen_rtx_SUBREG (ifmode
, im
, 0);
4846 im
= gen_rtx_ZERO_EXTRACT (ihmode
, im
, halfsize
, halfsize
);
4847 if (imode
!= ihmode
)
4848 im
= gen_rtx_SUBREG (imode
, im
, 0);
4850 im
= gen_rtx_NEG (imode
, im
);
4851 return gen_rtx_CONCAT (mode
, re
, im
);
4855 op0
= expand_debug_expr (TREE_OPERAND (exp
, 0));
4856 if (!op0
|| !MEM_P (op0
))
4858 if ((TREE_CODE (TREE_OPERAND (exp
, 0)) == VAR_DECL
4859 || TREE_CODE (TREE_OPERAND (exp
, 0)) == PARM_DECL
4860 || TREE_CODE (TREE_OPERAND (exp
, 0)) == RESULT_DECL
)
4861 && (!TREE_ADDRESSABLE (TREE_OPERAND (exp
, 0))
4862 || target_for_debug_bind (TREE_OPERAND (exp
, 0))))
4863 return gen_rtx_DEBUG_IMPLICIT_PTR (mode
, TREE_OPERAND (exp
, 0));
4865 if (handled_component_p (TREE_OPERAND (exp
, 0)))
4867 HOST_WIDE_INT bitoffset
, bitsize
, maxsize
;
4870 = get_ref_base_and_extent (TREE_OPERAND (exp
, 0), &bitoffset
,
4871 &bitsize
, &maxsize
, &reverse
);
4873 || TREE_CODE (decl
) == PARM_DECL
4874 || TREE_CODE (decl
) == RESULT_DECL
)
4875 && (!TREE_ADDRESSABLE (decl
)
4876 || target_for_debug_bind (decl
))
4877 && (bitoffset
% BITS_PER_UNIT
) == 0
4879 && bitsize
== maxsize
)
4881 rtx base
= gen_rtx_DEBUG_IMPLICIT_PTR (mode
, decl
);
4882 return plus_constant (mode
, base
, bitoffset
/ BITS_PER_UNIT
);
4886 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == MEM_REF
4887 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
4890 op0
= expand_debug_expr (TREE_OPERAND (TREE_OPERAND (exp
, 0),
4893 && (GET_CODE (op0
) == DEBUG_IMPLICIT_PTR
4894 || (GET_CODE (op0
) == PLUS
4895 && GET_CODE (XEXP (op0
, 0)) == DEBUG_IMPLICIT_PTR
4896 && CONST_INT_P (XEXP (op0
, 1)))))
4898 op1
= expand_debug_expr (TREE_OPERAND (TREE_OPERAND (exp
, 0),
4900 if (!op1
|| !CONST_INT_P (op1
))
4903 return plus_constant (mode
, op0
, INTVAL (op1
));
4910 as
= TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp
)));
4911 op0
= convert_debug_memory_address (mode
, XEXP (op0
, 0), as
);
4919 op0
= gen_rtx_CONCATN
4920 (mode
, rtvec_alloc (TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp
))));
4922 for (i
= 0; i
< VECTOR_CST_NELTS (exp
); ++i
)
4924 op1
= expand_debug_expr (VECTOR_CST_ELT (exp
, i
));
4927 XVECEXP (op0
, 0, i
) = op1
;
4934 if (TREE_CLOBBER_P (exp
))
4936 else if (TREE_CODE (TREE_TYPE (exp
)) == VECTOR_TYPE
)
4941 op0
= gen_rtx_CONCATN
4942 (mode
, rtvec_alloc (TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp
))));
4944 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp
), i
, val
)
4946 op1
= expand_debug_expr (val
);
4949 XVECEXP (op0
, 0, i
) = op1
;
4952 if (i
< TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp
)))
4954 op1
= expand_debug_expr
4955 (build_zero_cst (TREE_TYPE (TREE_TYPE (exp
))));
4960 for (; i
< TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp
)); i
++)
4961 XVECEXP (op0
, 0, i
) = op1
;
4967 goto flag_unsupported
;
4970 /* ??? Maybe handle some builtins? */
4975 gimple
*g
= get_gimple_for_ssa_name (exp
);
4979 if (deep_ter_debug_map
)
4981 tree
*slot
= deep_ter_debug_map
->get (exp
);
4986 t
= gimple_assign_rhs_to_tree (g
);
4987 op0
= expand_debug_expr (t
);
4993 /* If this is a reference to an incoming value of
4994 parameter that is never used in the code or where the
4995 incoming value is never used in the code, use
4996 PARM_DECL's DECL_RTL if set. */
4997 if (SSA_NAME_IS_DEFAULT_DEF (exp
)
4998 && SSA_NAME_VAR (exp
)
4999 && TREE_CODE (SSA_NAME_VAR (exp
)) == PARM_DECL
5000 && has_zero_uses (exp
))
5002 op0
= expand_debug_parm_decl (SSA_NAME_VAR (exp
));
5005 op0
= expand_debug_expr (SSA_NAME_VAR (exp
));
5010 int part
= var_to_partition (SA
.map
, exp
);
5012 if (part
== NO_PARTITION
)
5015 gcc_assert (part
>= 0 && (unsigned)part
< SA
.map
->num_partitions
);
5017 op0
= copy_rtx (SA
.partition_to_pseudo
[part
]);
5025 /* Vector stuff. For most of the codes we don't have rtl codes. */
5026 case REALIGN_LOAD_EXPR
:
5027 case REDUC_MAX_EXPR
:
5028 case REDUC_MIN_EXPR
:
5029 case REDUC_PLUS_EXPR
:
5031 case VEC_PACK_FIX_TRUNC_EXPR
:
5032 case VEC_PACK_SAT_EXPR
:
5033 case VEC_PACK_TRUNC_EXPR
:
5034 case VEC_UNPACK_FLOAT_HI_EXPR
:
5035 case VEC_UNPACK_FLOAT_LO_EXPR
:
5036 case VEC_UNPACK_HI_EXPR
:
5037 case VEC_UNPACK_LO_EXPR
:
5038 case VEC_WIDEN_MULT_HI_EXPR
:
5039 case VEC_WIDEN_MULT_LO_EXPR
:
5040 case VEC_WIDEN_MULT_EVEN_EXPR
:
5041 case VEC_WIDEN_MULT_ODD_EXPR
:
5042 case VEC_WIDEN_LSHIFT_HI_EXPR
:
5043 case VEC_WIDEN_LSHIFT_LO_EXPR
:
5048 case ADDR_SPACE_CONVERT_EXPR
:
5049 case FIXED_CONVERT_EXPR
:
5051 case WITH_SIZE_EXPR
:
5052 case BIT_INSERT_EXPR
:
5056 if (SCALAR_INT_MODE_P (GET_MODE (op0
))
5057 && SCALAR_INT_MODE_P (mode
))
5060 = simplify_gen_unary (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
,
5062 ? ZERO_EXTEND
: SIGN_EXTEND
, mode
, op0
,
5065 = simplify_gen_unary (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
,
5067 ? ZERO_EXTEND
: SIGN_EXTEND
, mode
, op1
,
5069 op0
= simplify_gen_binary (MULT
, mode
, op0
, op1
);
5070 return simplify_gen_binary (PLUS
, mode
, op0
, op2
);
5074 case WIDEN_MULT_EXPR
:
5075 case WIDEN_MULT_PLUS_EXPR
:
5076 case WIDEN_MULT_MINUS_EXPR
:
5077 if (SCALAR_INT_MODE_P (GET_MODE (op0
))
5078 && SCALAR_INT_MODE_P (mode
))
5080 inner_mode
= GET_MODE (op0
);
5081 if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))))
5082 op0
= simplify_gen_unary (ZERO_EXTEND
, mode
, op0
, inner_mode
);
5084 op0
= simplify_gen_unary (SIGN_EXTEND
, mode
, op0
, inner_mode
);
5085 if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 1))))
5086 op1
= simplify_gen_unary (ZERO_EXTEND
, mode
, op1
, inner_mode
);
5088 op1
= simplify_gen_unary (SIGN_EXTEND
, mode
, op1
, inner_mode
);
5089 op0
= simplify_gen_binary (MULT
, mode
, op0
, op1
);
5090 if (TREE_CODE (exp
) == WIDEN_MULT_EXPR
)
5092 else if (TREE_CODE (exp
) == WIDEN_MULT_PLUS_EXPR
)
5093 return simplify_gen_binary (PLUS
, mode
, op0
, op2
);
5095 return simplify_gen_binary (MINUS
, mode
, op2
, op0
);
5099 case MULT_HIGHPART_EXPR
:
5100 /* ??? Similar to the above. */
5103 case WIDEN_SUM_EXPR
:
5104 case WIDEN_LSHIFT_EXPR
:
5105 if (SCALAR_INT_MODE_P (GET_MODE (op0
))
5106 && SCALAR_INT_MODE_P (mode
))
5109 = simplify_gen_unary (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
,
5111 ? ZERO_EXTEND
: SIGN_EXTEND
, mode
, op0
,
5113 return simplify_gen_binary (TREE_CODE (exp
) == WIDEN_LSHIFT_EXPR
5114 ? ASHIFT
: PLUS
, mode
, op0
, op1
);
5119 return simplify_gen_ternary (FMA
, mode
, inner_mode
, op0
, op1
, op2
);
5132 /* Return an RTX equivalent to the source bind value of the tree expression
5136 expand_debug_source_expr (tree exp
)
5139 machine_mode mode
= VOIDmode
, inner_mode
;
5141 switch (TREE_CODE (exp
))
5145 mode
= DECL_MODE (exp
);
5146 op0
= expand_debug_parm_decl (exp
);
5149 /* See if this isn't an argument that has been completely
5151 if (!DECL_RTL_SET_P (exp
)
5152 && !DECL_INCOMING_RTL (exp
)
5153 && DECL_ABSTRACT_ORIGIN (current_function_decl
))
5155 tree aexp
= DECL_ORIGIN (exp
);
5156 if (DECL_CONTEXT (aexp
)
5157 == DECL_ABSTRACT_ORIGIN (current_function_decl
))
5159 vec
<tree
, va_gc
> **debug_args
;
5162 debug_args
= decl_debug_args_lookup (current_function_decl
);
5163 if (debug_args
!= NULL
)
5165 for (ix
= 0; vec_safe_iterate (*debug_args
, ix
, &ddecl
);
5168 return gen_rtx_DEBUG_PARAMETER_REF (mode
, aexp
);
5178 if (op0
== NULL_RTX
)
5181 inner_mode
= GET_MODE (op0
);
5182 if (mode
== inner_mode
)
5185 if (FLOAT_MODE_P (mode
) && FLOAT_MODE_P (inner_mode
))
5187 if (GET_MODE_BITSIZE (mode
) == GET_MODE_BITSIZE (inner_mode
))
5188 op0
= simplify_gen_subreg (mode
, op0
, inner_mode
, 0);
5189 else if (GET_MODE_BITSIZE (mode
) < GET_MODE_BITSIZE (inner_mode
))
5190 op0
= simplify_gen_unary (FLOAT_TRUNCATE
, mode
, op0
, inner_mode
);
5192 op0
= simplify_gen_unary (FLOAT_EXTEND
, mode
, op0
, inner_mode
);
5194 else if (FLOAT_MODE_P (mode
))
5196 else if (FLOAT_MODE_P (inner_mode
))
5198 if (TYPE_UNSIGNED (TREE_TYPE (exp
)))
5199 op0
= simplify_gen_unary (UNSIGNED_FIX
, mode
, op0
, inner_mode
);
5201 op0
= simplify_gen_unary (FIX
, mode
, op0
, inner_mode
);
5203 else if (CONSTANT_P (op0
)
5204 || GET_MODE_BITSIZE (mode
) <= GET_MODE_BITSIZE (inner_mode
))
5205 op0
= lowpart_subreg (mode
, op0
, inner_mode
);
5206 else if (TYPE_UNSIGNED (TREE_TYPE (exp
)))
5207 op0
= simplify_gen_unary (ZERO_EXTEND
, mode
, op0
, inner_mode
);
5209 op0
= simplify_gen_unary (SIGN_EXTEND
, mode
, op0
, inner_mode
);
5214 /* Ensure INSN_VAR_LOCATION_LOC (insn) doesn't have unbound complexity.
5215 Allow 4 levels of rtl nesting for most rtl codes, and if we see anything
5216 deeper than that, create DEBUG_EXPRs and emit DEBUG_INSNs before INSN. */
5219 avoid_complex_debug_insns (rtx_insn
*insn
, rtx
*exp_p
, int depth
)
5223 if (exp
== NULL_RTX
)
5226 if ((OBJECT_P (exp
) && !MEM_P (exp
)) || GET_CODE (exp
) == CLOBBER
)
5231 /* Create DEBUG_EXPR (and DEBUG_EXPR_DECL). */
5232 rtx dval
= make_debug_expr_from_rtl (exp
);
5234 /* Emit a debug bind insn before INSN. */
5235 rtx bind
= gen_rtx_VAR_LOCATION (GET_MODE (exp
),
5236 DEBUG_EXPR_TREE_DECL (dval
), exp
,
5237 VAR_INIT_STATUS_INITIALIZED
);
5239 emit_debug_insn_before (bind
, insn
);
5244 const char *format_ptr
= GET_RTX_FORMAT (GET_CODE (exp
));
5246 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (exp
)); i
++)
5247 switch (*format_ptr
++)
5250 avoid_complex_debug_insns (insn
, &XEXP (exp
, i
), depth
+ 1);
5255 for (j
= 0; j
< XVECLEN (exp
, i
); j
++)
5256 avoid_complex_debug_insns (insn
, &XVECEXP (exp
, i
, j
), depth
+ 1);
5264 /* Expand the _LOCs in debug insns. We run this after expanding all
5265 regular insns, so that any variables referenced in the function
5266 will have their DECL_RTLs set. */
5269 expand_debug_locations (void)
5272 rtx_insn
*last
= get_last_insn ();
5273 int save_strict_alias
= flag_strict_aliasing
;
5275 /* New alias sets while setting up memory attributes cause
5276 -fcompare-debug failures, even though it doesn't bring about any
5278 flag_strict_aliasing
= 0;
5280 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
5281 if (DEBUG_INSN_P (insn
))
5283 tree value
= (tree
)INSN_VAR_LOCATION_LOC (insn
);
5285 rtx_insn
*prev_insn
, *insn2
;
5288 if (value
== NULL_TREE
)
5292 if (INSN_VAR_LOCATION_STATUS (insn
)
5293 == VAR_INIT_STATUS_UNINITIALIZED
)
5294 val
= expand_debug_source_expr (value
);
5295 /* The avoid_deep_ter_for_debug function inserts
5296 debug bind stmts after SSA_NAME definition, with the
5297 SSA_NAME as the whole bind location. Disable temporarily
5298 expansion of that SSA_NAME into the DEBUG_EXPR_DECL
5299 being defined in this DEBUG_INSN. */
5300 else if (deep_ter_debug_map
&& TREE_CODE (value
) == SSA_NAME
)
5302 tree
*slot
= deep_ter_debug_map
->get (value
);
5305 if (*slot
== INSN_VAR_LOCATION_DECL (insn
))
5310 val
= expand_debug_expr (value
);
5312 *slot
= INSN_VAR_LOCATION_DECL (insn
);
5315 val
= expand_debug_expr (value
);
5316 gcc_assert (last
== get_last_insn ());
5320 val
= gen_rtx_UNKNOWN_VAR_LOC ();
5323 mode
= GET_MODE (INSN_VAR_LOCATION (insn
));
5325 gcc_assert (mode
== GET_MODE (val
)
5326 || (GET_MODE (val
) == VOIDmode
5327 && (CONST_SCALAR_INT_P (val
)
5328 || GET_CODE (val
) == CONST_FIXED
5329 || GET_CODE (val
) == LABEL_REF
)));
5332 INSN_VAR_LOCATION_LOC (insn
) = val
;
5333 prev_insn
= PREV_INSN (insn
);
5334 for (insn2
= insn
; insn2
!= prev_insn
; insn2
= PREV_INSN (insn2
))
5335 avoid_complex_debug_insns (insn2
, &INSN_VAR_LOCATION_LOC (insn2
), 0);
5338 flag_strict_aliasing
= save_strict_alias
;
5341 /* Performs swapping operands of commutative operations to expand
5342 the expensive one first. */
5345 reorder_operands (basic_block bb
)
5347 unsigned int *lattice
; /* Hold cost of each statement. */
5348 unsigned int i
= 0, n
= 0;
5349 gimple_stmt_iterator gsi
;
5355 use_operand_p use_p
;
5356 gimple
*def0
, *def1
;
5358 /* Compute cost of each statement using estimate_num_insns. */
5359 stmts
= bb_seq (bb
);
5360 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5362 stmt
= gsi_stmt (gsi
);
5363 if (!is_gimple_debug (stmt
))
5364 gimple_set_uid (stmt
, n
++);
5366 lattice
= XNEWVEC (unsigned int, n
);
5367 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5370 stmt
= gsi_stmt (gsi
);
5371 if (is_gimple_debug (stmt
))
5373 cost
= estimate_num_insns (stmt
, &eni_size_weights
);
5375 FOR_EACH_SSA_USE_OPERAND (use_p
, stmt
, iter
, SSA_OP_USE
)
5377 tree use
= USE_FROM_PTR (use_p
);
5379 if (TREE_CODE (use
) != SSA_NAME
)
5381 def_stmt
= get_gimple_for_ssa_name (use
);
5384 lattice
[i
] += lattice
[gimple_uid (def_stmt
)];
5387 if (!is_gimple_assign (stmt
)
5388 || !commutative_tree_code (gimple_assign_rhs_code (stmt
)))
5390 op0
= gimple_op (stmt
, 1);
5391 op1
= gimple_op (stmt
, 2);
5392 if (TREE_CODE (op0
) != SSA_NAME
5393 || TREE_CODE (op1
) != SSA_NAME
)
5395 /* Swap operands if the second one is more expensive. */
5396 def0
= get_gimple_for_ssa_name (op0
);
5397 def1
= get_gimple_for_ssa_name (op1
);
5401 if (!def0
|| lattice
[gimple_uid (def1
)] > lattice
[gimple_uid (def0
)])
5405 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5407 fprintf (dump_file
, "Swap operands in stmt:\n");
5408 print_gimple_stmt (dump_file
, stmt
, 0, TDF_SLIM
);
5409 fprintf (dump_file
, "Cost left opnd=%d, right opnd=%d\n",
5410 def0
? lattice
[gimple_uid (def0
)] : 0,
5411 lattice
[gimple_uid (def1
)]);
5413 swap_ssa_operands (stmt
, gimple_assign_rhs1_ptr (stmt
),
5414 gimple_assign_rhs2_ptr (stmt
));
5420 /* Expand basic block BB from GIMPLE trees to RTL. */
5423 expand_gimple_basic_block (basic_block bb
, bool disable_tail_calls
)
5425 gimple_stmt_iterator gsi
;
5427 gimple
*stmt
= NULL
;
5434 fprintf (dump_file
, "\n;; Generating RTL for gimple basic block %d\n",
5437 /* Note that since we are now transitioning from GIMPLE to RTL, we
5438 cannot use the gsi_*_bb() routines because they expect the basic
5439 block to be in GIMPLE, instead of RTL. Therefore, we need to
5440 access the BB sequence directly. */
5442 reorder_operands (bb
);
5443 stmts
= bb_seq (bb
);
5444 bb
->il
.gimple
.seq
= NULL
;
5445 bb
->il
.gimple
.phi_nodes
= NULL
;
5446 rtl_profile_for_bb (bb
);
5447 init_rtl_bb_info (bb
);
5448 bb
->flags
|= BB_RTL
;
5450 /* Remove the RETURN_EXPR if we may fall though to the exit
5452 gsi
= gsi_last (stmts
);
5453 if (!gsi_end_p (gsi
)
5454 && gimple_code (gsi_stmt (gsi
)) == GIMPLE_RETURN
)
5456 greturn
*ret_stmt
= as_a
<greturn
*> (gsi_stmt (gsi
));
5458 gcc_assert (single_succ_p (bb
));
5459 gcc_assert (single_succ (bb
) == EXIT_BLOCK_PTR_FOR_FN (cfun
));
5461 if (bb
->next_bb
== EXIT_BLOCK_PTR_FOR_FN (cfun
)
5462 && !gimple_return_retval (ret_stmt
))
5464 gsi_remove (&gsi
, false);
5465 single_succ_edge (bb
)->flags
|= EDGE_FALLTHRU
;
5469 gsi
= gsi_start (stmts
);
5470 if (!gsi_end_p (gsi
))
5472 stmt
= gsi_stmt (gsi
);
5473 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5477 rtx_code_label
**elt
= lab_rtx_for_bb
->get (bb
);
5481 last
= get_last_insn ();
5485 expand_gimple_stmt (stmt
);
5492 /* Java emits line number notes in the top of labels.
5493 ??? Make this go away once line number notes are obsoleted. */
5494 BB_HEAD (bb
) = NEXT_INSN (last
);
5495 if (NOTE_P (BB_HEAD (bb
)))
5496 BB_HEAD (bb
) = NEXT_INSN (BB_HEAD (bb
));
5497 note
= emit_note_after (NOTE_INSN_BASIC_BLOCK
, BB_HEAD (bb
));
5499 maybe_dump_rtl_for_gimple_stmt (stmt
, last
);
5502 BB_HEAD (bb
) = note
= emit_note (NOTE_INSN_BASIC_BLOCK
);
5504 NOTE_BASIC_BLOCK (note
) = bb
;
5506 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
5510 stmt
= gsi_stmt (gsi
);
5512 /* If this statement is a non-debug one, and we generate debug
5513 insns, then this one might be the last real use of a TERed
5514 SSA_NAME, but where there are still some debug uses further
5515 down. Expanding the current SSA name in such further debug
5516 uses by their RHS might lead to wrong debug info, as coalescing
5517 might make the operands of such RHS be placed into the same
5518 pseudo as something else. Like so:
5519 a_1 = a_0 + 1; // Assume a_1 is TERed and a_0 is dead
5523 As a_0 and a_2 don't overlap in lifetime, assume they are coalesced.
5524 If we now would expand a_1 by it's RHS (a_0 + 1) in the debug use,
5525 the write to a_2 would actually have clobbered the place which
5528 So, instead of that, we recognize the situation, and generate
5529 debug temporaries at the last real use of TERed SSA names:
5536 if (MAY_HAVE_DEBUG_INSNS
5538 && !is_gimple_debug (stmt
))
5544 location_t sloc
= curr_insn_location ();
5546 /* Look for SSA names that have their last use here (TERed
5547 names always have only one real use). */
5548 FOR_EACH_SSA_TREE_OPERAND (op
, stmt
, iter
, SSA_OP_USE
)
5549 if ((def
= get_gimple_for_ssa_name (op
)))
5551 imm_use_iterator imm_iter
;
5552 use_operand_p use_p
;
5553 bool have_debug_uses
= false;
5555 FOR_EACH_IMM_USE_FAST (use_p
, imm_iter
, op
)
5557 if (gimple_debug_bind_p (USE_STMT (use_p
)))
5559 have_debug_uses
= true;
5564 if (have_debug_uses
)
5566 /* OP is a TERed SSA name, with DEF its defining
5567 statement, and where OP is used in further debug
5568 instructions. Generate a debug temporary, and
5569 replace all uses of OP in debug insns with that
5572 tree value
= gimple_assign_rhs_to_tree (def
);
5573 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
5577 set_curr_insn_location (gimple_location (def
));
5579 DECL_ARTIFICIAL (vexpr
) = 1;
5580 TREE_TYPE (vexpr
) = TREE_TYPE (value
);
5582 mode
= DECL_MODE (value
);
5584 mode
= TYPE_MODE (TREE_TYPE (value
));
5585 SET_DECL_MODE (vexpr
, mode
);
5587 val
= gen_rtx_VAR_LOCATION
5588 (mode
, vexpr
, (rtx
)value
, VAR_INIT_STATUS_INITIALIZED
);
5590 emit_debug_insn (val
);
5592 FOR_EACH_IMM_USE_STMT (debugstmt
, imm_iter
, op
)
5594 if (!gimple_debug_bind_p (debugstmt
))
5597 FOR_EACH_IMM_USE_ON_STMT (use_p
, imm_iter
)
5598 SET_USE (use_p
, vexpr
);
5600 update_stmt (debugstmt
);
5604 set_curr_insn_location (sloc
);
5607 currently_expanding_gimple_stmt
= stmt
;
5609 /* Expand this statement, then evaluate the resulting RTL and
5610 fixup the CFG accordingly. */
5611 if (gimple_code (stmt
) == GIMPLE_COND
)
5613 new_bb
= expand_gimple_cond (bb
, as_a
<gcond
*> (stmt
));
5617 else if (gimple_debug_bind_p (stmt
))
5619 location_t sloc
= curr_insn_location ();
5620 gimple_stmt_iterator nsi
= gsi
;
5624 tree var
= gimple_debug_bind_get_var (stmt
);
5629 if (TREE_CODE (var
) != DEBUG_EXPR_DECL
5630 && TREE_CODE (var
) != LABEL_DECL
5631 && !target_for_debug_bind (var
))
5632 goto delink_debug_stmt
;
5634 if (gimple_debug_bind_has_value_p (stmt
))
5635 value
= gimple_debug_bind_get_value (stmt
);
5639 last
= get_last_insn ();
5641 set_curr_insn_location (gimple_location (stmt
));
5644 mode
= DECL_MODE (var
);
5646 mode
= TYPE_MODE (TREE_TYPE (var
));
5648 val
= gen_rtx_VAR_LOCATION
5649 (mode
, var
, (rtx
)value
, VAR_INIT_STATUS_INITIALIZED
);
5651 emit_debug_insn (val
);
5653 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5655 /* We can't dump the insn with a TREE where an RTX
5657 PAT_VAR_LOCATION_LOC (val
) = const0_rtx
;
5658 maybe_dump_rtl_for_gimple_stmt (stmt
, last
);
5659 PAT_VAR_LOCATION_LOC (val
) = (rtx
)value
;
5663 /* In order not to generate too many debug temporaries,
5664 we delink all uses of debug statements we already expanded.
5665 Therefore debug statements between definition and real
5666 use of TERed SSA names will continue to use the SSA name,
5667 and not be replaced with debug temps. */
5668 delink_stmt_imm_use (stmt
);
5672 if (gsi_end_p (nsi
))
5674 stmt
= gsi_stmt (nsi
);
5675 if (!gimple_debug_bind_p (stmt
))
5679 set_curr_insn_location (sloc
);
5681 else if (gimple_debug_source_bind_p (stmt
))
5683 location_t sloc
= curr_insn_location ();
5684 tree var
= gimple_debug_source_bind_get_var (stmt
);
5685 tree value
= gimple_debug_source_bind_get_value (stmt
);
5689 last
= get_last_insn ();
5691 set_curr_insn_location (gimple_location (stmt
));
5693 mode
= DECL_MODE (var
);
5695 val
= gen_rtx_VAR_LOCATION (mode
, var
, (rtx
)value
,
5696 VAR_INIT_STATUS_UNINITIALIZED
);
5698 emit_debug_insn (val
);
5700 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5702 /* We can't dump the insn with a TREE where an RTX
5704 PAT_VAR_LOCATION_LOC (val
) = const0_rtx
;
5705 maybe_dump_rtl_for_gimple_stmt (stmt
, last
);
5706 PAT_VAR_LOCATION_LOC (val
) = (rtx
)value
;
5709 set_curr_insn_location (sloc
);
5713 gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
);
5715 && gimple_call_tail_p (call_stmt
)
5716 && disable_tail_calls
)
5717 gimple_call_set_tail (call_stmt
, false);
5719 if (call_stmt
&& gimple_call_tail_p (call_stmt
))
5722 new_bb
= expand_gimple_tailcall (bb
, call_stmt
, &can_fallthru
);
5733 def_operand_p def_p
;
5734 def_p
= SINGLE_SSA_DEF_OPERAND (stmt
, SSA_OP_DEF
);
5738 /* Ignore this stmt if it is in the list of
5739 replaceable expressions. */
5741 && bitmap_bit_p (SA
.values
,
5742 SSA_NAME_VERSION (DEF_FROM_PTR (def_p
))))
5745 last
= expand_gimple_stmt (stmt
);
5746 maybe_dump_rtl_for_gimple_stmt (stmt
, last
);
5751 currently_expanding_gimple_stmt
= NULL
;
5753 /* Expand implicit goto and convert goto_locus. */
5754 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5756 if (e
->goto_locus
!= UNKNOWN_LOCATION
)
5757 set_curr_insn_location (e
->goto_locus
);
5758 if ((e
->flags
& EDGE_FALLTHRU
) && e
->dest
!= bb
->next_bb
)
5760 emit_jump (label_rtx_for_bb (e
->dest
));
5761 e
->flags
&= ~EDGE_FALLTHRU
;
5765 /* Expanded RTL can create a jump in the last instruction of block.
5766 This later might be assumed to be a jump to successor and break edge insertion.
5767 We need to insert dummy move to prevent this. PR41440. */
5768 if (single_succ_p (bb
)
5769 && (single_succ_edge (bb
)->flags
& EDGE_FALLTHRU
)
5770 && (last
= get_last_insn ())
5772 || (DEBUG_INSN_P (last
)
5773 && JUMP_P (prev_nondebug_insn (last
)))))
5775 rtx dummy
= gen_reg_rtx (SImode
);
5776 emit_insn_after_noloc (gen_move_insn (dummy
, dummy
), last
, NULL
);
5779 do_pending_stack_adjust ();
5781 /* Find the block tail. The last insn in the block is the insn
5782 before a barrier and/or table jump insn. */
5783 last
= get_last_insn ();
5784 if (BARRIER_P (last
))
5785 last
= PREV_INSN (last
);
5786 if (JUMP_TABLE_DATA_P (last
))
5787 last
= PREV_INSN (PREV_INSN (last
));
5790 update_bb_for_insn (bb
);
5796 /* Create a basic block for initialization code. */
5799 construct_init_block (void)
5801 basic_block init_block
, first_block
;
5805 /* Multiple entry points not supported yet. */
5806 gcc_assert (EDGE_COUNT (ENTRY_BLOCK_PTR_FOR_FN (cfun
)->succs
) == 1);
5807 init_rtl_bb_info (ENTRY_BLOCK_PTR_FOR_FN (cfun
));
5808 init_rtl_bb_info (EXIT_BLOCK_PTR_FOR_FN (cfun
));
5809 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->flags
|= BB_RTL
;
5810 EXIT_BLOCK_PTR_FOR_FN (cfun
)->flags
|= BB_RTL
;
5812 e
= EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun
), 0);
5814 /* When entry edge points to first basic block, we don't need jump,
5815 otherwise we have to jump into proper target. */
5816 if (e
&& e
->dest
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->next_bb
)
5818 tree label
= gimple_block_label (e
->dest
);
5820 emit_jump (jump_target_rtx (label
));
5824 flags
= EDGE_FALLTHRU
;
5826 init_block
= create_basic_block (NEXT_INSN (get_insns ()),
5828 ENTRY_BLOCK_PTR_FOR_FN (cfun
));
5829 init_block
->frequency
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
;
5830 init_block
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
5831 add_bb_to_loop (init_block
, ENTRY_BLOCK_PTR_FOR_FN (cfun
)->loop_father
);
5834 first_block
= e
->dest
;
5835 redirect_edge_succ (e
, init_block
);
5836 e
= make_edge (init_block
, first_block
, flags
);
5839 e
= make_edge (init_block
, EXIT_BLOCK_PTR_FOR_FN (cfun
), EDGE_FALLTHRU
);
5840 e
->probability
= REG_BR_PROB_BASE
;
5841 e
->count
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
5843 update_bb_for_insn (init_block
);
5847 /* For each lexical block, set BLOCK_NUMBER to the depth at which it is
5848 found in the block tree. */
5851 set_block_levels (tree block
, int level
)
5855 BLOCK_NUMBER (block
) = level
;
5856 set_block_levels (BLOCK_SUBBLOCKS (block
), level
+ 1);
5857 block
= BLOCK_CHAIN (block
);
5861 /* Create a block containing landing pads and similar stuff. */
5864 construct_exit_block (void)
5866 rtx_insn
*head
= get_last_insn ();
5868 basic_block exit_block
;
5872 basic_block prev_bb
= EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
;
5873 rtx_insn
*orig_end
= BB_END (prev_bb
);
5875 rtl_profile_for_bb (EXIT_BLOCK_PTR_FOR_FN (cfun
));
5877 /* Make sure the locus is set to the end of the function, so that
5878 epilogue line numbers and warnings are set properly. */
5879 if (LOCATION_LOCUS (cfun
->function_end_locus
) != UNKNOWN_LOCATION
)
5880 input_location
= cfun
->function_end_locus
;
5882 /* Generate rtl for function exit. */
5883 expand_function_end ();
5885 end
= get_last_insn ();
5888 /* While emitting the function end we could move end of the last basic
5890 BB_END (prev_bb
) = orig_end
;
5891 while (NEXT_INSN (head
) && NOTE_P (NEXT_INSN (head
)))
5892 head
= NEXT_INSN (head
);
5893 /* But make sure exit_block starts with RETURN_LABEL, otherwise the
5894 bb frequency counting will be confused. Any instructions before that
5895 label are emitted for the case where PREV_BB falls through into the
5896 exit block, so append those instructions to prev_bb in that case. */
5897 if (NEXT_INSN (head
) != return_label
)
5899 while (NEXT_INSN (head
) != return_label
)
5901 if (!NOTE_P (NEXT_INSN (head
)))
5902 BB_END (prev_bb
) = NEXT_INSN (head
);
5903 head
= NEXT_INSN (head
);
5906 exit_block
= create_basic_block (NEXT_INSN (head
), end
, prev_bb
);
5907 exit_block
->frequency
= EXIT_BLOCK_PTR_FOR_FN (cfun
)->frequency
;
5908 exit_block
->count
= EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
;
5909 add_bb_to_loop (exit_block
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->loop_father
);
5912 while (ix
< EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
))
5914 e
= EDGE_PRED (EXIT_BLOCK_PTR_FOR_FN (cfun
), ix
);
5915 if (!(e
->flags
& EDGE_ABNORMAL
))
5916 redirect_edge_succ (e
, exit_block
);
5921 e
= make_edge (exit_block
, EXIT_BLOCK_PTR_FOR_FN (cfun
), EDGE_FALLTHRU
);
5922 e
->probability
= REG_BR_PROB_BASE
;
5923 e
->count
= EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
;
5924 FOR_EACH_EDGE (e2
, ei
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
)
5927 e
->count
-= e2
->count
;
5928 exit_block
->count
-= e2
->count
;
5929 exit_block
->frequency
-= EDGE_FREQUENCY (e2
);
5931 if (exit_block
->frequency
< 0)
5932 exit_block
->frequency
= 0;
5933 update_bb_for_insn (exit_block
);
5936 /* Helper function for discover_nonconstant_array_refs.
5937 Look for ARRAY_REF nodes with non-constant indexes and mark them
5941 discover_nonconstant_array_refs_r (tree
* tp
, int *walk_subtrees
,
5942 void *data ATTRIBUTE_UNUSED
)
5946 if (IS_TYPE_OR_DECL_P (t
))
5948 else if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
5950 while (((TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
5951 && is_gimple_min_invariant (TREE_OPERAND (t
, 1))
5952 && (!TREE_OPERAND (t
, 2)
5953 || is_gimple_min_invariant (TREE_OPERAND (t
, 2))))
5954 || (TREE_CODE (t
) == COMPONENT_REF
5955 && (!TREE_OPERAND (t
,2)
5956 || is_gimple_min_invariant (TREE_OPERAND (t
, 2))))
5957 || TREE_CODE (t
) == BIT_FIELD_REF
5958 || TREE_CODE (t
) == REALPART_EXPR
5959 || TREE_CODE (t
) == IMAGPART_EXPR
5960 || TREE_CODE (t
) == VIEW_CONVERT_EXPR
5961 || CONVERT_EXPR_P (t
))
5962 t
= TREE_OPERAND (t
, 0);
5964 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
5966 t
= get_base_address (t
);
5968 && DECL_MODE (t
) != BLKmode
)
5969 TREE_ADDRESSABLE (t
) = 1;
5978 /* RTL expansion is not able to compile array references with variable
5979 offsets for arrays stored in single register. Discover such
5980 expressions and mark variables as addressable to avoid this
5984 discover_nonconstant_array_refs (void)
5987 gimple_stmt_iterator gsi
;
5989 FOR_EACH_BB_FN (bb
, cfun
)
5990 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5992 gimple
*stmt
= gsi_stmt (gsi
);
5993 if (!is_gimple_debug (stmt
))
5994 walk_gimple_op (stmt
, discover_nonconstant_array_refs_r
, NULL
);
5998 /* This function sets crtl->args.internal_arg_pointer to a virtual
5999 register if DRAP is needed. Local register allocator will replace
6000 virtual_incoming_args_rtx with the virtual register. */
6003 expand_stack_alignment (void)
6006 unsigned int preferred_stack_boundary
;
6008 if (! SUPPORTS_STACK_ALIGNMENT
)
6011 if (cfun
->calls_alloca
6012 || cfun
->has_nonlocal_label
6013 || crtl
->has_nonlocal_goto
)
6014 crtl
->need_drap
= true;
6016 /* Call update_stack_boundary here again to update incoming stack
6017 boundary. It may set incoming stack alignment to a different
6018 value after RTL expansion. TARGET_FUNCTION_OK_FOR_SIBCALL may
6019 use the minimum incoming stack alignment to check if it is OK
6020 to perform sibcall optimization since sibcall optimization will
6021 only align the outgoing stack to incoming stack boundary. */
6022 if (targetm
.calls
.update_stack_boundary
)
6023 targetm
.calls
.update_stack_boundary ();
6025 /* The incoming stack frame has to be aligned at least at
6026 parm_stack_boundary. */
6027 gcc_assert (crtl
->parm_stack_boundary
<= INCOMING_STACK_BOUNDARY
);
6029 /* Update crtl->stack_alignment_estimated and use it later to align
6030 stack. We check PREFERRED_STACK_BOUNDARY if there may be non-call
6031 exceptions since callgraph doesn't collect incoming stack alignment
6033 if (cfun
->can_throw_non_call_exceptions
6034 && PREFERRED_STACK_BOUNDARY
> crtl
->preferred_stack_boundary
)
6035 preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
6037 preferred_stack_boundary
= crtl
->preferred_stack_boundary
;
6038 if (preferred_stack_boundary
> crtl
->stack_alignment_estimated
)
6039 crtl
->stack_alignment_estimated
= preferred_stack_boundary
;
6040 if (preferred_stack_boundary
> crtl
->stack_alignment_needed
)
6041 crtl
->stack_alignment_needed
= preferred_stack_boundary
;
6043 gcc_assert (crtl
->stack_alignment_needed
6044 <= crtl
->stack_alignment_estimated
);
6046 crtl
->stack_realign_needed
6047 = INCOMING_STACK_BOUNDARY
< crtl
->stack_alignment_estimated
;
6048 crtl
->stack_realign_tried
= crtl
->stack_realign_needed
;
6050 crtl
->stack_realign_processed
= true;
6052 /* Target has to redefine TARGET_GET_DRAP_RTX to support stack
6054 gcc_assert (targetm
.calls
.get_drap_rtx
!= NULL
);
6055 drap_rtx
= targetm
.calls
.get_drap_rtx ();
6057 /* stack_realign_drap and drap_rtx must match. */
6058 gcc_assert ((stack_realign_drap
!= 0) == (drap_rtx
!= NULL
));
6060 /* Do nothing if NULL is returned, which means DRAP is not needed. */
6061 if (NULL
!= drap_rtx
)
6063 crtl
->args
.internal_arg_pointer
= drap_rtx
;
6065 /* Call fixup_tail_calls to clean up REG_EQUIV note if DRAP is
6067 fixup_tail_calls ();
6073 expand_main_function (void)
6075 #if (defined(INVOKE__main) \
6076 || (!defined(HAS_INIT_SECTION) \
6077 && !defined(INIT_SECTION_ASM_OP) \
6078 && !defined(INIT_ARRAY_SECTION_ASM_OP)))
6079 emit_library_call (init_one_libfunc (NAME__MAIN
), LCT_NORMAL
, VOIDmode
, 0);
6084 /* Expand code to initialize the stack_protect_guard. This is invoked at
6085 the beginning of a function to be protected. */
6088 stack_protect_prologue (void)
6090 tree guard_decl
= targetm
.stack_protect_guard ();
6093 x
= expand_normal (crtl
->stack_protect_guard
);
6095 y
= expand_normal (guard_decl
);
6099 /* Allow the target to copy from Y to X without leaking Y into a
6101 if (targetm
.have_stack_protect_set ())
6102 if (rtx_insn
*insn
= targetm
.gen_stack_protect_set (x
, y
))
6108 /* Otherwise do a straight move. */
6109 emit_move_insn (x
, y
);
6112 /* Translate the intermediate representation contained in the CFG
6113 from GIMPLE trees to RTL.
6115 We do conversion per basic block and preserve/update the tree CFG.
6116 This implies we have to do some magic as the CFG can simultaneously
6117 consist of basic blocks containing RTL and GIMPLE trees. This can
6118 confuse the CFG hooks, so be careful to not manipulate CFG during
6123 const pass_data pass_data_expand
=
6125 RTL_PASS
, /* type */
6126 "expand", /* name */
6127 OPTGROUP_NONE
, /* optinfo_flags */
6128 TV_EXPAND
, /* tv_id */
6129 ( PROP_ssa
| PROP_gimple_leh
| PROP_cfg
6132 | PROP_gimple_lva
), /* properties_required */
6133 PROP_rtl
, /* properties_provided */
6134 ( PROP_ssa
| PROP_trees
), /* properties_destroyed */
6135 0, /* todo_flags_start */
6136 0, /* todo_flags_finish */
6139 class pass_expand
: public rtl_opt_pass
6142 pass_expand (gcc::context
*ctxt
)
6143 : rtl_opt_pass (pass_data_expand
, ctxt
)
6146 /* opt_pass methods: */
6147 virtual unsigned int execute (function
*);
6149 }; // class pass_expand
6152 pass_expand::execute (function
*fun
)
6154 basic_block bb
, init_block
;
6157 rtx_insn
*var_seq
, *var_ret_seq
;
6160 timevar_push (TV_OUT_OF_SSA
);
6161 rewrite_out_of_ssa (&SA
);
6162 timevar_pop (TV_OUT_OF_SSA
);
6163 SA
.partition_to_pseudo
= XCNEWVEC (rtx
, SA
.map
->num_partitions
);
6165 if (MAY_HAVE_DEBUG_STMTS
&& flag_tree_ter
)
6167 gimple_stmt_iterator gsi
;
6168 FOR_EACH_BB_FN (bb
, cfun
)
6169 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
6170 if (gimple_debug_bind_p (gsi_stmt (gsi
)))
6171 avoid_deep_ter_for_debug (gsi_stmt (gsi
), 0);
6174 /* Make sure all values used by the optimization passes have sane
6178 /* Some backends want to know that we are expanding to RTL. */
6179 currently_expanding_to_rtl
= 1;
6180 /* Dominators are not kept up-to-date as we may create new basic-blocks. */
6181 free_dominance_info (CDI_DOMINATORS
);
6183 rtl_profile_for_bb (ENTRY_BLOCK_PTR_FOR_FN (fun
));
6185 if (chkp_function_instrumented_p (current_function_decl
))
6186 chkp_reset_rtl_bounds ();
6188 insn_locations_init ();
6189 if (!DECL_IS_BUILTIN (current_function_decl
))
6191 /* Eventually, all FEs should explicitly set function_start_locus. */
6192 if (LOCATION_LOCUS (fun
->function_start_locus
) == UNKNOWN_LOCATION
)
6193 set_curr_insn_location
6194 (DECL_SOURCE_LOCATION (current_function_decl
));
6196 set_curr_insn_location (fun
->function_start_locus
);
6199 set_curr_insn_location (UNKNOWN_LOCATION
);
6200 prologue_location
= curr_insn_location ();
6202 #ifdef INSN_SCHEDULING
6203 init_sched_attrs ();
6206 /* Make sure first insn is a note even if we don't want linenums.
6207 This makes sure the first insn will never be deleted.
6208 Also, final expects a note to appear there. */
6209 emit_note (NOTE_INSN_DELETED
);
6211 /* Mark arrays indexed with non-constant indices with TREE_ADDRESSABLE. */
6212 discover_nonconstant_array_refs ();
6214 targetm
.expand_to_rtl_hook ();
6215 crtl
->init_stack_alignment ();
6216 fun
->cfg
->max_jumptable_ents
= 0;
6218 /* Resovle the function section. Some targets, like ARM EABI rely on knowledge
6219 of the function section at exapnsion time to predict distance of calls. */
6220 resolve_unique_section (current_function_decl
, 0, flag_function_sections
);
6222 /* Expand the variables recorded during gimple lowering. */
6223 timevar_push (TV_VAR_EXPAND
);
6226 var_ret_seq
= expand_used_vars ();
6228 var_seq
= get_insns ();
6230 timevar_pop (TV_VAR_EXPAND
);
6232 /* Honor stack protection warnings. */
6233 if (warn_stack_protect
)
6235 if (fun
->calls_alloca
)
6236 warning (OPT_Wstack_protector
,
6237 "stack protector not protecting local variables: "
6238 "variable length buffer");
6239 if (has_short_buffer
&& !crtl
->stack_protect_guard
)
6240 warning (OPT_Wstack_protector
,
6241 "stack protector not protecting function: "
6242 "all local arrays are less than %d bytes long",
6243 (int) PARAM_VALUE (PARAM_SSP_BUFFER_SIZE
));
6246 /* Set up parameters and prepare for return, for the function. */
6247 expand_function_start (current_function_decl
);
6249 /* If we emitted any instructions for setting up the variables,
6250 emit them before the FUNCTION_START note. */
6253 emit_insn_before (var_seq
, parm_birth_insn
);
6255 /* In expand_function_end we'll insert the alloca save/restore
6256 before parm_birth_insn. We've just insertted an alloca call.
6257 Adjust the pointer to match. */
6258 parm_birth_insn
= var_seq
;
6261 /* Now propagate the RTL assignment of each partition to the
6262 underlying var of each SSA_NAME. */
6265 FOR_EACH_SSA_NAME (i
, name
, cfun
)
6267 /* We might have generated new SSA names in
6268 update_alias_info_with_stack_vars. They will have a NULL
6269 defining statements, and won't be part of the partitioning,
6271 if (!SSA_NAME_DEF_STMT (name
))
6274 adjust_one_expanded_partition_var (name
);
6277 /* Clean up RTL of variables that straddle across multiple
6278 partitions, and check that the rtl of any PARM_DECLs that are not
6279 cleaned up is that of their default defs. */
6280 FOR_EACH_SSA_NAME (i
, name
, cfun
)
6284 /* We might have generated new SSA names in
6285 update_alias_info_with_stack_vars. They will have a NULL
6286 defining statements, and won't be part of the partitioning,
6288 if (!SSA_NAME_DEF_STMT (name
))
6290 part
= var_to_partition (SA
.map
, name
);
6291 if (part
== NO_PARTITION
)
6294 /* If this decl was marked as living in multiple places, reset
6295 this now to NULL. */
6296 tree var
= SSA_NAME_VAR (name
);
6297 if (var
&& DECL_RTL_IF_SET (var
) == pc_rtx
)
6298 SET_DECL_RTL (var
, NULL
);
6299 /* Check that the pseudos chosen by assign_parms are those of
6300 the corresponding default defs. */
6301 else if (SSA_NAME_IS_DEFAULT_DEF (name
)
6302 && (TREE_CODE (var
) == PARM_DECL
6303 || TREE_CODE (var
) == RESULT_DECL
))
6305 rtx in
= DECL_RTL_IF_SET (var
);
6307 rtx out
= SA
.partition_to_pseudo
[part
];
6308 gcc_assert (in
== out
);
6310 /* Now reset VAR's RTL to IN, so that the _EXPR attrs match
6311 those expected by debug backends for each parm and for
6312 the result. This is particularly important for stabs,
6313 whose register elimination from parm's DECL_RTL may cause
6314 -fcompare-debug differences as SET_DECL_RTL changes reg's
6315 attrs. So, make sure the RTL already has the parm as the
6316 EXPR, so that it won't change. */
6317 SET_DECL_RTL (var
, NULL_RTX
);
6319 set_mem_attributes (in
, var
, true);
6320 SET_DECL_RTL (var
, in
);
6324 /* If this function is `main', emit a call to `__main'
6325 to run global initializers, etc. */
6326 if (DECL_NAME (current_function_decl
)
6327 && MAIN_NAME_P (DECL_NAME (current_function_decl
))
6328 && DECL_FILE_SCOPE_P (current_function_decl
))
6329 expand_main_function ();
6331 /* Initialize the stack_protect_guard field. This must happen after the
6332 call to __main (if any) so that the external decl is initialized. */
6333 if (crtl
->stack_protect_guard
&& targetm
.stack_protect_runtime_enabled_p ())
6334 stack_protect_prologue ();
6336 expand_phi_nodes (&SA
);
6338 /* Release any stale SSA redirection data. */
6339 redirect_edge_var_map_empty ();
6341 /* Register rtl specific functions for cfg. */
6342 rtl_register_cfg_hooks ();
6344 init_block
= construct_init_block ();
6346 /* Clear EDGE_EXECUTABLE on the entry edge(s). It is cleaned from the
6347 remaining edges later. */
6348 FOR_EACH_EDGE (e
, ei
, ENTRY_BLOCK_PTR_FOR_FN (fun
)->succs
)
6349 e
->flags
&= ~EDGE_EXECUTABLE
;
6351 lab_rtx_for_bb
= new hash_map
<basic_block
, rtx_code_label
*>;
6352 FOR_BB_BETWEEN (bb
, init_block
->next_bb
, EXIT_BLOCK_PTR_FOR_FN (fun
),
6354 bb
= expand_gimple_basic_block (bb
, var_ret_seq
!= NULL_RTX
);
6356 if (MAY_HAVE_DEBUG_INSNS
)
6357 expand_debug_locations ();
6359 if (deep_ter_debug_map
)
6361 delete deep_ter_debug_map
;
6362 deep_ter_debug_map
= NULL
;
6365 /* Free stuff we no longer need after GIMPLE optimizations. */
6366 free_dominance_info (CDI_DOMINATORS
);
6367 free_dominance_info (CDI_POST_DOMINATORS
);
6368 delete_tree_cfg_annotations (fun
);
6370 timevar_push (TV_OUT_OF_SSA
);
6371 finish_out_of_ssa (&SA
);
6372 timevar_pop (TV_OUT_OF_SSA
);
6374 timevar_push (TV_POST_EXPAND
);
6375 /* We are no longer in SSA form. */
6376 fun
->gimple_df
->in_ssa_p
= false;
6377 loops_state_clear (LOOP_CLOSED_SSA
);
6379 /* Expansion is used by optimization passes too, set maybe_hot_insn_p
6380 conservatively to true until they are all profile aware. */
6381 delete lab_rtx_for_bb
;
6382 free_histograms (fun
);
6384 construct_exit_block ();
6385 insn_locations_finalize ();
6389 rtx_insn
*after
= return_label
;
6390 rtx_insn
*next
= NEXT_INSN (after
);
6391 if (next
&& NOTE_INSN_BASIC_BLOCK_P (next
))
6393 emit_insn_after (var_ret_seq
, after
);
6396 /* Zap the tree EH table. */
6397 set_eh_throw_stmt_table (fun
, NULL
);
6399 /* We need JUMP_LABEL be set in order to redirect jumps, and hence
6400 split edges which edge insertions might do. */
6401 rebuild_jump_labels (get_insns ());
6403 FOR_BB_BETWEEN (bb
, ENTRY_BLOCK_PTR_FOR_FN (fun
),
6404 EXIT_BLOCK_PTR_FOR_FN (fun
), next_bb
)
6408 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
6412 rebuild_jump_labels_chain (e
->insns
.r
);
6413 /* Put insns after parm birth, but before
6414 NOTE_INSNS_FUNCTION_BEG. */
6415 if (e
->src
== ENTRY_BLOCK_PTR_FOR_FN (fun
)
6416 && single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (fun
)))
6418 rtx_insn
*insns
= e
->insns
.r
;
6420 if (NOTE_P (parm_birth_insn
)
6421 && NOTE_KIND (parm_birth_insn
) == NOTE_INSN_FUNCTION_BEG
)
6422 emit_insn_before_noloc (insns
, parm_birth_insn
, e
->dest
);
6424 emit_insn_after_noloc (insns
, parm_birth_insn
, e
->dest
);
6427 commit_one_edge_insertion (e
);
6434 /* We're done expanding trees to RTL. */
6435 currently_expanding_to_rtl
= 0;
6437 flush_mark_addressable_queue ();
6439 FOR_BB_BETWEEN (bb
, ENTRY_BLOCK_PTR_FOR_FN (fun
)->next_bb
,
6440 EXIT_BLOCK_PTR_FOR_FN (fun
), next_bb
)
6444 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
6446 /* Clear EDGE_EXECUTABLE. This flag is never used in the backend. */
6447 e
->flags
&= ~EDGE_EXECUTABLE
;
6449 /* At the moment not all abnormal edges match the RTL
6450 representation. It is safe to remove them here as
6451 find_many_sub_basic_blocks will rediscover them.
6452 In the future we should get this fixed properly. */
6453 if ((e
->flags
& EDGE_ABNORMAL
)
6454 && !(e
->flags
& EDGE_SIBCALL
))
6461 auto_sbitmap
blocks (last_basic_block_for_fn (fun
));
6462 bitmap_ones (blocks
);
6463 find_many_sub_basic_blocks (blocks
);
6464 purge_all_dead_edges ();
6466 expand_stack_alignment ();
6468 /* Fixup REG_EQUIV notes in the prologue if there are tailcalls in this
6470 if (crtl
->tail_call_emit
)
6471 fixup_tail_calls ();
6473 /* After initial rtl generation, call back to finish generating
6474 exception support code. We need to do this before cleaning up
6475 the CFG as the code does not expect dead landing pads. */
6476 if (fun
->eh
->region_tree
!= NULL
)
6477 finish_eh_generation ();
6479 /* Remove unreachable blocks, otherwise we cannot compute dominators
6480 which are needed for loop state verification. As a side-effect
6481 this also compacts blocks.
6482 ??? We cannot remove trivially dead insns here as for example
6483 the DRAP reg on i?86 is not magically live at this point.
6484 gcc.c-torture/execute/ipa-sra-2.c execution, -Os -m32 fails otherwise. */
6485 cleanup_cfg (CLEANUP_NO_INSN_DEL
);
6487 checking_verify_flow_info ();
6489 /* Initialize pseudos allocated for hard registers. */
6490 emit_initial_value_sets ();
6492 /* And finally unshare all RTL. */
6495 /* There's no need to defer outputting this function any more; we
6496 know we want to output it. */
6497 DECL_DEFER_OUTPUT (current_function_decl
) = 0;
6499 /* Now that we're done expanding trees to RTL, we shouldn't have any
6500 more CONCATs anywhere. */
6501 generating_concat_p
= 0;
6506 "\n\n;;\n;; Full RTL generated for this function:\n;;\n");
6507 /* And the pass manager will dump RTL for us. */
6510 /* If we're emitting a nested function, make sure its parent gets
6511 emitted as well. Doing otherwise confuses debug info. */
6514 for (parent
= DECL_CONTEXT (current_function_decl
);
6515 parent
!= NULL_TREE
;
6516 parent
= get_containing_scope (parent
))
6517 if (TREE_CODE (parent
) == FUNCTION_DECL
)
6518 TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (parent
)) = 1;
6521 /* We are now committed to emitting code for this function. Do any
6522 preparation, such as emitting abstract debug info for the inline
6523 before it gets mangled by optimization. */
6524 if (cgraph_function_possibly_inlined_p (current_function_decl
))
6525 (*debug_hooks
->outlining_inline_function
) (current_function_decl
);
6527 TREE_ASM_WRITTEN (current_function_decl
) = 1;
6529 /* After expanding, the return labels are no longer needed. */
6530 return_label
= NULL
;
6531 naked_return_label
= NULL
;
6533 /* After expanding, the tm_restart map is no longer needed. */
6534 if (fun
->gimple_df
->tm_restart
)
6535 fun
->gimple_df
->tm_restart
= NULL
;
6537 /* Tag the blocks with a depth number so that change_scope can find
6538 the common parent easily. */
6539 set_block_levels (DECL_INITIAL (fun
->decl
), 0);
6540 default_rtl_profile ();
6542 /* For -dx discard loops now, otherwise IL verify in clean_state will
6544 if (rtl_dump_and_exit
)
6546 cfun
->curr_properties
&= ~PROP_loops
;
6547 loop_optimizer_finalize ();
6550 timevar_pop (TV_POST_EXPAND
);
6558 make_pass_expand (gcc::context
*ctxt
)
6560 return new pass_expand (ctxt
);