1 /* A pass for lowering trees to RTL.
2 Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010
3 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
28 #include "basic-block.h"
31 #include "langhooks.h"
32 #include "tree-flow.h"
34 #include "tree-dump.h"
35 #include "tree-pass.h"
38 #include "diagnostic.h"
39 #include "tree-pretty-print.h"
40 #include "gimple-pretty-print.h"
44 #include "tree-inline.h"
45 #include "value-prof.h"
47 #include "ssaexpand.h"
50 #include "insn-attr.h" /* For INSN_SCHEDULING. */
52 /* This variable holds information helping the rewriting of SSA trees
56 /* This variable holds the currently expanded gimple statement for purposes
57 of comminucating the profile info to the builtin expanders. */
58 gimple currently_expanding_gimple_stmt
;
60 /* Return an expression tree corresponding to the RHS of GIMPLE
64 gimple_assign_rhs_to_tree (gimple stmt
)
67 enum gimple_rhs_class grhs_class
;
69 grhs_class
= get_gimple_rhs_class (gimple_expr_code (stmt
));
71 if (grhs_class
== GIMPLE_TERNARY_RHS
)
72 t
= build3 (gimple_assign_rhs_code (stmt
),
73 TREE_TYPE (gimple_assign_lhs (stmt
)),
74 gimple_assign_rhs1 (stmt
),
75 gimple_assign_rhs2 (stmt
),
76 gimple_assign_rhs3 (stmt
));
77 else if (grhs_class
== GIMPLE_BINARY_RHS
)
78 t
= build2 (gimple_assign_rhs_code (stmt
),
79 TREE_TYPE (gimple_assign_lhs (stmt
)),
80 gimple_assign_rhs1 (stmt
),
81 gimple_assign_rhs2 (stmt
));
82 else if (grhs_class
== GIMPLE_UNARY_RHS
)
83 t
= build1 (gimple_assign_rhs_code (stmt
),
84 TREE_TYPE (gimple_assign_lhs (stmt
)),
85 gimple_assign_rhs1 (stmt
));
86 else if (grhs_class
== GIMPLE_SINGLE_RHS
)
88 t
= gimple_assign_rhs1 (stmt
);
89 /* Avoid modifying this tree in place below. */
90 if ((gimple_has_location (stmt
) && CAN_HAVE_LOCATION_P (t
)
91 && gimple_location (stmt
) != EXPR_LOCATION (t
))
92 || (gimple_block (stmt
)
93 && currently_expanding_to_rtl
95 && gimple_block (stmt
) != TREE_BLOCK (t
)))
101 if (gimple_has_location (stmt
) && CAN_HAVE_LOCATION_P (t
))
102 SET_EXPR_LOCATION (t
, gimple_location (stmt
));
103 if (gimple_block (stmt
) && currently_expanding_to_rtl
&& EXPR_P (t
))
104 TREE_BLOCK (t
) = gimple_block (stmt
);
110 #ifndef STACK_ALIGNMENT_NEEDED
111 #define STACK_ALIGNMENT_NEEDED 1
114 #define SSAVAR(x) (TREE_CODE (x) == SSA_NAME ? SSA_NAME_VAR (x) : x)
116 /* Associate declaration T with storage space X. If T is no
117 SSA name this is exactly SET_DECL_RTL, otherwise make the
118 partition of T associated with X. */
120 set_rtl (tree t
, rtx x
)
122 if (TREE_CODE (t
) == SSA_NAME
)
124 SA
.partition_to_pseudo
[var_to_partition (SA
.map
, t
)] = x
;
126 set_reg_attrs_for_decl_rtl (SSA_NAME_VAR (t
), x
);
127 /* For the benefit of debug information at -O0 (where vartracking
128 doesn't run) record the place also in the base DECL if it's
129 a normal variable (not a parameter). */
130 if (x
&& x
!= pc_rtx
&& TREE_CODE (SSA_NAME_VAR (t
)) == VAR_DECL
)
132 tree var
= SSA_NAME_VAR (t
);
133 /* If we don't yet have something recorded, just record it now. */
134 if (!DECL_RTL_SET_P (var
))
135 SET_DECL_RTL (var
, x
);
136 /* If we have it set alrady to "multiple places" don't
138 else if (DECL_RTL (var
) == pc_rtx
)
140 /* If we have something recorded and it's not the same place
141 as we want to record now, we have multiple partitions for the
142 same base variable, with different places. We can't just
143 randomly chose one, hence we have to say that we don't know.
144 This only happens with optimization, and there var-tracking
145 will figure out the right thing. */
146 else if (DECL_RTL (var
) != x
)
147 SET_DECL_RTL (var
, pc_rtx
);
154 /* This structure holds data relevant to one variable that will be
155 placed in a stack slot. */
161 /* The offset of the variable. During partitioning, this is the
162 offset relative to the partition. After partitioning, this
163 is relative to the stack frame. */
164 HOST_WIDE_INT offset
;
166 /* Initially, the size of the variable. Later, the size of the partition,
167 if this variable becomes it's partition's representative. */
170 /* The *byte* alignment required for this variable. Or as, with the
171 size, the alignment for this partition. */
174 /* The partition representative. */
175 size_t representative
;
177 /* The next stack variable in the partition, or EOC. */
180 /* The numbers of conflicting stack variables. */
184 #define EOC ((size_t)-1)
186 /* We have an array of such objects while deciding allocation. */
187 static struct stack_var
*stack_vars
;
188 static size_t stack_vars_alloc
;
189 static size_t stack_vars_num
;
191 /* An array of indices such that stack_vars[stack_vars_sorted[i]].size
192 is non-decreasing. */
193 static size_t *stack_vars_sorted
;
195 /* The phase of the stack frame. This is the known misalignment of
196 virtual_stack_vars_rtx from PREFERRED_STACK_BOUNDARY. That is,
197 (frame_offset+frame_phase) % PREFERRED_STACK_BOUNDARY == 0. */
198 static int frame_phase
;
200 /* Used during expand_used_vars to remember if we saw any decls for
201 which we'd like to enable stack smashing protection. */
202 static bool has_protected_decls
;
204 /* Used during expand_used_vars. Remember if we say a character buffer
205 smaller than our cutoff threshold. Used for -Wstack-protector. */
206 static bool has_short_buffer
;
208 /* Discover the byte alignment to use for DECL. Ignore alignment
209 we can't do with expected alignment of the stack boundary. */
212 get_decl_align_unit (tree decl
)
214 unsigned int align
= LOCAL_DECL_ALIGNMENT (decl
);
215 return align
/ BITS_PER_UNIT
;
218 /* Allocate SIZE bytes at byte alignment ALIGN from the stack frame.
219 Return the frame offset. */
222 alloc_stack_frame_space (HOST_WIDE_INT size
, unsigned HOST_WIDE_INT align
)
224 HOST_WIDE_INT offset
, new_frame_offset
;
226 new_frame_offset
= frame_offset
;
227 if (FRAME_GROWS_DOWNWARD
)
229 new_frame_offset
-= size
+ frame_phase
;
230 new_frame_offset
&= -align
;
231 new_frame_offset
+= frame_phase
;
232 offset
= new_frame_offset
;
236 new_frame_offset
-= frame_phase
;
237 new_frame_offset
+= align
- 1;
238 new_frame_offset
&= -align
;
239 new_frame_offset
+= frame_phase
;
240 offset
= new_frame_offset
;
241 new_frame_offset
+= size
;
243 frame_offset
= new_frame_offset
;
245 if (frame_offset_overflow (frame_offset
, cfun
->decl
))
246 frame_offset
= offset
= 0;
251 /* Accumulate DECL into STACK_VARS. */
254 add_stack_var (tree decl
)
258 if (stack_vars_num
>= stack_vars_alloc
)
260 if (stack_vars_alloc
)
261 stack_vars_alloc
= stack_vars_alloc
* 3 / 2;
263 stack_vars_alloc
= 32;
265 = XRESIZEVEC (struct stack_var
, stack_vars
, stack_vars_alloc
);
267 v
= &stack_vars
[stack_vars_num
];
271 v
->size
= tree_low_cst (DECL_SIZE_UNIT (SSAVAR (decl
)), 1);
272 /* Ensure that all variables have size, so that &a != &b for any two
273 variables that are simultaneously live. */
276 v
->alignb
= get_decl_align_unit (SSAVAR (decl
));
278 /* All variables are initially in their own partition. */
279 v
->representative
= stack_vars_num
;
282 /* All variables initially conflict with no other. */
285 /* Ensure that this decl doesn't get put onto the list twice. */
286 set_rtl (decl
, pc_rtx
);
291 /* Make the decls associated with luid's X and Y conflict. */
294 add_stack_var_conflict (size_t x
, size_t y
)
296 struct stack_var
*a
= &stack_vars
[x
];
297 struct stack_var
*b
= &stack_vars
[y
];
299 a
->conflicts
= BITMAP_ALLOC (NULL
);
301 b
->conflicts
= BITMAP_ALLOC (NULL
);
302 bitmap_set_bit (a
->conflicts
, y
);
303 bitmap_set_bit (b
->conflicts
, x
);
306 /* Check whether the decls associated with luid's X and Y conflict. */
309 stack_var_conflict_p (size_t x
, size_t y
)
311 struct stack_var
*a
= &stack_vars
[x
];
312 struct stack_var
*b
= &stack_vars
[y
];
313 if (!a
->conflicts
|| !b
->conflicts
)
315 return bitmap_bit_p (a
->conflicts
, y
);
318 /* Returns true if TYPE is or contains a union type. */
321 aggregate_contains_union_type (tree type
)
325 if (TREE_CODE (type
) == UNION_TYPE
326 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
328 if (TREE_CODE (type
) == ARRAY_TYPE
)
329 return aggregate_contains_union_type (TREE_TYPE (type
));
330 if (TREE_CODE (type
) != RECORD_TYPE
)
333 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
334 if (TREE_CODE (field
) == FIELD_DECL
)
335 if (aggregate_contains_union_type (TREE_TYPE (field
)))
341 /* A subroutine of expand_used_vars. If two variables X and Y have alias
342 sets that do not conflict, then do add a conflict for these variables
343 in the interference graph. We also need to make sure to add conflicts
344 for union containing structures. Else RTL alias analysis comes along
345 and due to type based aliasing rules decides that for two overlapping
346 union temporaries { short s; int i; } accesses to the same mem through
347 different types may not alias and happily reorders stores across
348 life-time boundaries of the temporaries (See PR25654).
349 We also have to mind MEM_IN_STRUCT_P and MEM_SCALAR_P. */
352 add_alias_set_conflicts (void)
354 size_t i
, j
, n
= stack_vars_num
;
356 for (i
= 0; i
< n
; ++i
)
358 tree type_i
= TREE_TYPE (stack_vars
[i
].decl
);
359 bool aggr_i
= AGGREGATE_TYPE_P (type_i
);
362 contains_union
= aggregate_contains_union_type (type_i
);
363 for (j
= 0; j
< i
; ++j
)
365 tree type_j
= TREE_TYPE (stack_vars
[j
].decl
);
366 bool aggr_j
= AGGREGATE_TYPE_P (type_j
);
368 /* Either the objects conflict by means of type based
369 aliasing rules, or we need to add a conflict. */
370 || !objects_must_conflict_p (type_i
, type_j
)
371 /* In case the types do not conflict ensure that access
372 to elements will conflict. In case of unions we have
373 to be careful as type based aliasing rules may say
374 access to the same memory does not conflict. So play
375 safe and add a conflict in this case. */
377 add_stack_var_conflict (i
, j
);
382 /* A subroutine of partition_stack_vars. A comparison function for qsort,
383 sorting an array of indices by the properties of the object. */
386 stack_var_cmp (const void *a
, const void *b
)
388 size_t ia
= *(const size_t *)a
;
389 size_t ib
= *(const size_t *)b
;
390 unsigned int aligna
= stack_vars
[ia
].alignb
;
391 unsigned int alignb
= stack_vars
[ib
].alignb
;
392 HOST_WIDE_INT sizea
= stack_vars
[ia
].size
;
393 HOST_WIDE_INT sizeb
= stack_vars
[ib
].size
;
394 tree decla
= stack_vars
[ia
].decl
;
395 tree declb
= stack_vars
[ib
].decl
;
397 unsigned int uida
, uidb
;
399 /* Primary compare on "large" alignment. Large comes first. */
400 largea
= (aligna
* BITS_PER_UNIT
> MAX_SUPPORTED_STACK_ALIGNMENT
);
401 largeb
= (alignb
* BITS_PER_UNIT
> MAX_SUPPORTED_STACK_ALIGNMENT
);
402 if (largea
!= largeb
)
403 return (int)largeb
- (int)largea
;
405 /* Secondary compare on size, decreasing */
411 /* Tertiary compare on true alignment, decreasing. */
417 /* Final compare on ID for sort stability, increasing.
418 Two SSA names are compared by their version, SSA names come before
419 non-SSA names, and two normal decls are compared by their DECL_UID. */
420 if (TREE_CODE (decla
) == SSA_NAME
)
422 if (TREE_CODE (declb
) == SSA_NAME
)
423 uida
= SSA_NAME_VERSION (decla
), uidb
= SSA_NAME_VERSION (declb
);
427 else if (TREE_CODE (declb
) == SSA_NAME
)
430 uida
= DECL_UID (decla
), uidb
= DECL_UID (declb
);
439 /* If the points-to solution *PI points to variables that are in a partition
440 together with other variables add all partition members to the pointed-to
444 add_partitioned_vars_to_ptset (struct pt_solution
*pt
,
445 struct pointer_map_t
*decls_to_partitions
,
446 struct pointer_set_t
*visited
, bitmap temp
)
454 /* The pointed-to vars bitmap is shared, it is enough to
456 || pointer_set_insert(visited
, pt
->vars
))
461 /* By using a temporary bitmap to store all members of the partitions
462 we have to add we make sure to visit each of the partitions only
464 EXECUTE_IF_SET_IN_BITMAP (pt
->vars
, 0, i
, bi
)
466 || !bitmap_bit_p (temp
, i
))
467 && (part
= (bitmap
*) pointer_map_contains (decls_to_partitions
,
468 (void *)(size_t) i
)))
469 bitmap_ior_into (temp
, *part
);
470 if (!bitmap_empty_p (temp
))
471 bitmap_ior_into (pt
->vars
, temp
);
474 /* Update points-to sets based on partition info, so we can use them on RTL.
475 The bitmaps representing stack partitions will be saved until expand,
476 where partitioned decls used as bases in memory expressions will be
480 update_alias_info_with_stack_vars (void)
482 struct pointer_map_t
*decls_to_partitions
= NULL
;
484 tree var
= NULL_TREE
;
486 for (i
= 0; i
< stack_vars_num
; i
++)
490 struct ptr_info_def
*pi
;
492 /* Not interested in partitions with single variable. */
493 if (stack_vars
[i
].representative
!= i
494 || stack_vars
[i
].next
== EOC
)
497 if (!decls_to_partitions
)
499 decls_to_partitions
= pointer_map_create ();
500 cfun
->gimple_df
->decls_to_pointers
= pointer_map_create ();
503 /* Create an SSA_NAME that points to the partition for use
504 as base during alias-oracle queries on RTL for bases that
505 have been partitioned. */
506 if (var
== NULL_TREE
)
507 var
= create_tmp_var (ptr_type_node
, NULL
);
508 name
= make_ssa_name (var
, NULL
);
510 /* Create bitmaps representing partitions. They will be used for
511 points-to sets later, so use GGC alloc. */
512 part
= BITMAP_GGC_ALLOC ();
513 for (j
= i
; j
!= EOC
; j
= stack_vars
[j
].next
)
515 tree decl
= stack_vars
[j
].decl
;
516 unsigned int uid
= DECL_PT_UID (decl
);
517 /* We should never end up partitioning SSA names (though they
518 may end up on the stack). Neither should we allocate stack
519 space to something that is unused and thus unreferenced, except
520 for -O0 where we are preserving even unreferenced variables. */
521 gcc_assert (DECL_P (decl
)
523 || referenced_var_lookup (DECL_UID (decl
))));
524 bitmap_set_bit (part
, uid
);
525 *((bitmap
*) pointer_map_insert (decls_to_partitions
,
526 (void *)(size_t) uid
)) = part
;
527 *((tree
*) pointer_map_insert (cfun
->gimple_df
->decls_to_pointers
,
531 /* Make the SSA name point to all partition members. */
532 pi
= get_ptr_info (name
);
533 pt_solution_set (&pi
->pt
, part
, false, false);
536 /* Make all points-to sets that contain one member of a partition
537 contain all members of the partition. */
538 if (decls_to_partitions
)
541 struct pointer_set_t
*visited
= pointer_set_create ();
542 bitmap temp
= BITMAP_ALLOC (NULL
);
544 for (i
= 1; i
< num_ssa_names
; i
++)
546 tree name
= ssa_name (i
);
547 struct ptr_info_def
*pi
;
550 && POINTER_TYPE_P (TREE_TYPE (name
))
551 && ((pi
= SSA_NAME_PTR_INFO (name
)) != NULL
))
552 add_partitioned_vars_to_ptset (&pi
->pt
, decls_to_partitions
,
556 add_partitioned_vars_to_ptset (&cfun
->gimple_df
->escaped
,
557 decls_to_partitions
, visited
, temp
);
559 pointer_set_destroy (visited
);
560 pointer_map_destroy (decls_to_partitions
);
565 /* A subroutine of partition_stack_vars. The UNION portion of a UNION/FIND
566 partitioning algorithm. Partitions A and B are known to be non-conflicting.
567 Merge them into a single partition A.
569 At the same time, add OFFSET to all variables in partition B. At the end
570 of the partitioning process we've have a nice block easy to lay out within
574 union_stack_vars (size_t a
, size_t b
, HOST_WIDE_INT offset
)
577 struct stack_var
*vb
= &stack_vars
[b
];
581 /* Update each element of partition B with the given offset,
582 and merge them into partition A. */
583 for (last
= i
= b
; i
!= EOC
; last
= i
, i
= stack_vars
[i
].next
)
585 stack_vars
[i
].offset
+= offset
;
586 stack_vars
[i
].representative
= a
;
588 stack_vars
[last
].next
= stack_vars
[a
].next
;
589 stack_vars
[a
].next
= b
;
591 /* Update the required alignment of partition A to account for B. */
592 if (stack_vars
[a
].alignb
< stack_vars
[b
].alignb
)
593 stack_vars
[a
].alignb
= stack_vars
[b
].alignb
;
595 /* Update the interference graph and merge the conflicts. */
598 EXECUTE_IF_SET_IN_BITMAP (vb
->conflicts
, 0, u
, bi
)
599 add_stack_var_conflict (a
, stack_vars
[u
].representative
);
600 BITMAP_FREE (vb
->conflicts
);
604 /* A subroutine of expand_used_vars. Binpack the variables into
605 partitions constrained by the interference graph. The overall
606 algorithm used is as follows:
608 Sort the objects by size.
613 Look for the largest non-conflicting object B with size <= S.
623 partition_stack_vars (void)
625 size_t si
, sj
, n
= stack_vars_num
;
627 stack_vars_sorted
= XNEWVEC (size_t, stack_vars_num
);
628 for (si
= 0; si
< n
; ++si
)
629 stack_vars_sorted
[si
] = si
;
634 qsort (stack_vars_sorted
, n
, sizeof (size_t), stack_var_cmp
);
636 for (si
= 0; si
< n
; ++si
)
638 size_t i
= stack_vars_sorted
[si
];
639 HOST_WIDE_INT isize
= stack_vars
[i
].size
;
640 unsigned int ialign
= stack_vars
[i
].alignb
;
641 HOST_WIDE_INT offset
= 0;
643 for (sj
= si
; sj
-- > 0; )
645 size_t j
= stack_vars_sorted
[sj
];
646 HOST_WIDE_INT jsize
= stack_vars
[j
].size
;
647 unsigned int jalign
= stack_vars
[j
].alignb
;
649 /* Ignore objects that aren't partition representatives. */
650 if (stack_vars
[j
].representative
!= j
)
653 /* Ignore objects too large for the remaining space. */
657 /* Ignore conflicting objects. */
658 if (stack_var_conflict_p (i
, j
))
661 /* Do not mix objects of "small" (supported) alignment
662 and "large" (unsupported) alignment. */
663 if ((ialign
* BITS_PER_UNIT
<= MAX_SUPPORTED_STACK_ALIGNMENT
)
664 != (jalign
* BITS_PER_UNIT
<= MAX_SUPPORTED_STACK_ALIGNMENT
))
667 /* Refine the remaining space check to include alignment. */
668 if (offset
& (jalign
- 1))
670 HOST_WIDE_INT toff
= offset
;
672 toff
&= -(HOST_WIDE_INT
)jalign
;
673 if (isize
- (toff
- offset
) < jsize
)
676 isize
-= toff
- offset
;
680 /* UNION the objects, placing J at OFFSET. */
681 union_stack_vars (i
, j
, offset
);
689 update_alias_info_with_stack_vars ();
692 /* A debugging aid for expand_used_vars. Dump the generated partitions. */
695 dump_stack_var_partition (void)
697 size_t si
, i
, j
, n
= stack_vars_num
;
699 for (si
= 0; si
< n
; ++si
)
701 i
= stack_vars_sorted
[si
];
703 /* Skip variables that aren't partition representatives, for now. */
704 if (stack_vars
[i
].representative
!= i
)
707 fprintf (dump_file
, "Partition %lu: size " HOST_WIDE_INT_PRINT_DEC
708 " align %u\n", (unsigned long) i
, stack_vars
[i
].size
,
709 stack_vars
[i
].alignb
);
711 for (j
= i
; j
!= EOC
; j
= stack_vars
[j
].next
)
713 fputc ('\t', dump_file
);
714 print_generic_expr (dump_file
, stack_vars
[j
].decl
, dump_flags
);
715 fprintf (dump_file
, ", offset " HOST_WIDE_INT_PRINT_DEC
"\n",
716 stack_vars
[j
].offset
);
721 /* Assign rtl to DECL at BASE + OFFSET. */
724 expand_one_stack_var_at (tree decl
, rtx base
, unsigned base_align
,
725 HOST_WIDE_INT offset
)
730 /* If this fails, we've overflowed the stack frame. Error nicely? */
731 gcc_assert (offset
== trunc_int_for_mode (offset
, Pmode
));
733 x
= plus_constant (base
, offset
);
734 x
= gen_rtx_MEM (DECL_MODE (SSAVAR (decl
)), x
);
736 if (TREE_CODE (decl
) != SSA_NAME
)
738 /* Set alignment we actually gave this decl if it isn't an SSA name.
739 If it is we generate stack slots only accidentally so it isn't as
740 important, we'll simply use the alignment that is already set. */
741 if (base
== virtual_stack_vars_rtx
)
742 offset
-= frame_phase
;
743 align
= offset
& -offset
;
744 align
*= BITS_PER_UNIT
;
745 if (align
== 0 || align
> base_align
)
748 /* One would think that we could assert that we're not decreasing
749 alignment here, but (at least) the i386 port does exactly this
750 via the MINIMUM_ALIGNMENT hook. */
752 DECL_ALIGN (decl
) = align
;
753 DECL_USER_ALIGN (decl
) = 0;
756 set_mem_attributes (x
, SSAVAR (decl
), true);
760 /* A subroutine of expand_used_vars. Give each partition representative
761 a unique location within the stack frame. Update each partition member
762 with that location. */
765 expand_stack_vars (bool (*pred
) (tree
))
767 size_t si
, i
, j
, n
= stack_vars_num
;
768 HOST_WIDE_INT large_size
= 0, large_alloc
= 0;
769 rtx large_base
= NULL
;
770 unsigned large_align
= 0;
773 /* Determine if there are any variables requiring "large" alignment.
774 Since these are dynamically allocated, we only process these if
775 no predicate involved. */
776 large_align
= stack_vars
[stack_vars_sorted
[0]].alignb
* BITS_PER_UNIT
;
777 if (pred
== NULL
&& large_align
> MAX_SUPPORTED_STACK_ALIGNMENT
)
779 /* Find the total size of these variables. */
780 for (si
= 0; si
< n
; ++si
)
784 i
= stack_vars_sorted
[si
];
785 alignb
= stack_vars
[i
].alignb
;
787 /* Stop when we get to the first decl with "small" alignment. */
788 if (alignb
* BITS_PER_UNIT
<= MAX_SUPPORTED_STACK_ALIGNMENT
)
791 /* Skip variables that aren't partition representatives. */
792 if (stack_vars
[i
].representative
!= i
)
795 /* Skip variables that have already had rtl assigned. See also
796 add_stack_var where we perpetrate this pc_rtx hack. */
797 decl
= stack_vars
[i
].decl
;
798 if ((TREE_CODE (decl
) == SSA_NAME
799 ? SA
.partition_to_pseudo
[var_to_partition (SA
.map
, decl
)]
800 : DECL_RTL (decl
)) != pc_rtx
)
803 large_size
+= alignb
- 1;
804 large_size
&= -(HOST_WIDE_INT
)alignb
;
805 large_size
+= stack_vars
[i
].size
;
808 /* If there were any, allocate space. */
810 large_base
= allocate_dynamic_stack_space (GEN_INT (large_size
), 0,
814 for (si
= 0; si
< n
; ++si
)
817 unsigned base_align
, alignb
;
818 HOST_WIDE_INT offset
;
820 i
= stack_vars_sorted
[si
];
822 /* Skip variables that aren't partition representatives, for now. */
823 if (stack_vars
[i
].representative
!= i
)
826 /* Skip variables that have already had rtl assigned. See also
827 add_stack_var where we perpetrate this pc_rtx hack. */
828 decl
= stack_vars
[i
].decl
;
829 if ((TREE_CODE (decl
) == SSA_NAME
830 ? SA
.partition_to_pseudo
[var_to_partition (SA
.map
, decl
)]
831 : DECL_RTL (decl
)) != pc_rtx
)
834 /* Check the predicate to see whether this variable should be
835 allocated in this pass. */
836 if (pred
&& !pred (decl
))
839 alignb
= stack_vars
[i
].alignb
;
840 if (alignb
* BITS_PER_UNIT
<= MAX_SUPPORTED_STACK_ALIGNMENT
)
842 offset
= alloc_stack_frame_space (stack_vars
[i
].size
, alignb
);
843 base
= virtual_stack_vars_rtx
;
844 base_align
= crtl
->max_used_stack_slot_alignment
;
848 /* Large alignment is only processed in the last pass. */
851 gcc_assert (large_base
!= NULL
);
853 large_alloc
+= alignb
- 1;
854 large_alloc
&= -(HOST_WIDE_INT
)alignb
;
855 offset
= large_alloc
;
856 large_alloc
+= stack_vars
[i
].size
;
859 base_align
= large_align
;
862 /* Create rtl for each variable based on their location within the
864 for (j
= i
; j
!= EOC
; j
= stack_vars
[j
].next
)
866 gcc_assert (stack_vars
[j
].offset
<= stack_vars
[i
].size
);
867 expand_one_stack_var_at (stack_vars
[j
].decl
,
869 stack_vars
[j
].offset
+ offset
);
873 gcc_assert (large_alloc
== large_size
);
876 /* Take into account all sizes of partitions and reset DECL_RTLs. */
878 account_stack_vars (void)
880 size_t si
, j
, i
, n
= stack_vars_num
;
881 HOST_WIDE_INT size
= 0;
883 for (si
= 0; si
< n
; ++si
)
885 i
= stack_vars_sorted
[si
];
887 /* Skip variables that aren't partition representatives, for now. */
888 if (stack_vars
[i
].representative
!= i
)
891 size
+= stack_vars
[i
].size
;
892 for (j
= i
; j
!= EOC
; j
= stack_vars
[j
].next
)
893 set_rtl (stack_vars
[j
].decl
, NULL
);
898 /* A subroutine of expand_one_var. Called to immediately assign rtl
899 to a variable to be allocated in the stack frame. */
902 expand_one_stack_var (tree var
)
904 HOST_WIDE_INT size
, offset
;
907 size
= tree_low_cst (DECL_SIZE_UNIT (SSAVAR (var
)), 1);
908 byte_align
= get_decl_align_unit (SSAVAR (var
));
910 /* We handle highly aligned variables in expand_stack_vars. */
911 gcc_assert (byte_align
* BITS_PER_UNIT
<= MAX_SUPPORTED_STACK_ALIGNMENT
);
913 offset
= alloc_stack_frame_space (size
, byte_align
);
915 expand_one_stack_var_at (var
, virtual_stack_vars_rtx
,
916 crtl
->max_used_stack_slot_alignment
, offset
);
919 /* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL
920 that will reside in a hard register. */
923 expand_one_hard_reg_var (tree var
)
925 rest_of_decl_compilation (var
, 0, 0);
928 /* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL
929 that will reside in a pseudo register. */
932 expand_one_register_var (tree var
)
934 tree decl
= SSAVAR (var
);
935 tree type
= TREE_TYPE (decl
);
936 enum machine_mode reg_mode
= promote_decl_mode (decl
, NULL
);
937 rtx x
= gen_reg_rtx (reg_mode
);
941 /* Note if the object is a user variable. */
942 if (!DECL_ARTIFICIAL (decl
))
945 if (POINTER_TYPE_P (type
))
946 mark_reg_pointer (x
, TYPE_ALIGN (TREE_TYPE (type
)));
949 /* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL that
950 has some associated error, e.g. its type is error-mark. We just need
951 to pick something that won't crash the rest of the compiler. */
954 expand_one_error_var (tree var
)
956 enum machine_mode mode
= DECL_MODE (var
);
960 x
= gen_rtx_MEM (BLKmode
, const0_rtx
);
961 else if (mode
== VOIDmode
)
964 x
= gen_reg_rtx (mode
);
966 SET_DECL_RTL (var
, x
);
969 /* A subroutine of expand_one_var. VAR is a variable that will be
970 allocated to the local stack frame. Return true if we wish to
971 add VAR to STACK_VARS so that it will be coalesced with other
972 variables. Return false to allocate VAR immediately.
974 This function is used to reduce the number of variables considered
975 for coalescing, which reduces the size of the quadratic problem. */
978 defer_stack_allocation (tree var
, bool toplevel
)
980 /* If stack protection is enabled, *all* stack variables must be deferred,
981 so that we can re-order the strings to the top of the frame. */
982 if (flag_stack_protect
)
985 /* We handle "large" alignment via dynamic allocation. We want to handle
986 this extra complication in only one place, so defer them. */
987 if (DECL_ALIGN (var
) > MAX_SUPPORTED_STACK_ALIGNMENT
)
990 /* Variables in the outermost scope automatically conflict with
991 every other variable. The only reason to want to defer them
992 at all is that, after sorting, we can more efficiently pack
993 small variables in the stack frame. Continue to defer at -O2. */
994 if (toplevel
&& optimize
< 2)
997 /* Without optimization, *most* variables are allocated from the
998 stack, which makes the quadratic problem large exactly when we
999 want compilation to proceed as quickly as possible. On the
1000 other hand, we don't want the function's stack frame size to
1001 get completely out of hand. So we avoid adding scalars and
1002 "small" aggregates to the list at all. */
1003 if (optimize
== 0 && tree_low_cst (DECL_SIZE_UNIT (var
), 1) < 32)
1009 /* A subroutine of expand_used_vars. Expand one variable according to
1010 its flavor. Variables to be placed on the stack are not actually
1011 expanded yet, merely recorded.
1012 When REALLY_EXPAND is false, only add stack values to be allocated.
1013 Return stack usage this variable is supposed to take.
1016 static HOST_WIDE_INT
1017 expand_one_var (tree var
, bool toplevel
, bool really_expand
)
1019 unsigned int align
= BITS_PER_UNIT
;
1024 if (TREE_TYPE (var
) != error_mark_node
&& TREE_CODE (var
) == VAR_DECL
)
1026 /* Because we don't know if VAR will be in register or on stack,
1027 we conservatively assume it will be on stack even if VAR is
1028 eventually put into register after RA pass. For non-automatic
1029 variables, which won't be on stack, we collect alignment of
1030 type and ignore user specified alignment. */
1031 if (TREE_STATIC (var
) || DECL_EXTERNAL (var
))
1032 align
= MINIMUM_ALIGNMENT (TREE_TYPE (var
),
1033 TYPE_MODE (TREE_TYPE (var
)),
1034 TYPE_ALIGN (TREE_TYPE (var
)));
1035 else if (DECL_HAS_VALUE_EXPR_P (var
)
1036 || (DECL_RTL_SET_P (var
) && MEM_P (DECL_RTL (var
))))
1037 /* Don't consider debug only variables with DECL_HAS_VALUE_EXPR_P set
1038 or variables which were assigned a stack slot already by
1039 expand_one_stack_var_at - in the latter case DECL_ALIGN has been
1040 changed from the offset chosen to it. */
1041 align
= crtl
->stack_alignment_estimated
;
1043 align
= MINIMUM_ALIGNMENT (var
, DECL_MODE (var
), DECL_ALIGN (var
));
1045 /* If the variable alignment is very large we'll dynamicaly allocate
1046 it, which means that in-frame portion is just a pointer. */
1047 if (align
> MAX_SUPPORTED_STACK_ALIGNMENT
)
1048 align
= POINTER_SIZE
;
1051 if (SUPPORTS_STACK_ALIGNMENT
1052 && crtl
->stack_alignment_estimated
< align
)
1054 /* stack_alignment_estimated shouldn't change after stack
1055 realign decision made */
1056 gcc_assert(!crtl
->stack_realign_processed
);
1057 crtl
->stack_alignment_estimated
= align
;
1060 /* stack_alignment_needed > PREFERRED_STACK_BOUNDARY is permitted.
1061 So here we only make sure stack_alignment_needed >= align. */
1062 if (crtl
->stack_alignment_needed
< align
)
1063 crtl
->stack_alignment_needed
= align
;
1064 if (crtl
->max_used_stack_slot_alignment
< align
)
1065 crtl
->max_used_stack_slot_alignment
= align
;
1067 if (TREE_CODE (origvar
) == SSA_NAME
)
1069 gcc_assert (TREE_CODE (var
) != VAR_DECL
1070 || (!DECL_EXTERNAL (var
)
1071 && !DECL_HAS_VALUE_EXPR_P (var
)
1072 && !TREE_STATIC (var
)
1073 && TREE_TYPE (var
) != error_mark_node
1074 && !DECL_HARD_REGISTER (var
)
1077 if (TREE_CODE (var
) != VAR_DECL
&& TREE_CODE (origvar
) != SSA_NAME
)
1079 else if (DECL_EXTERNAL (var
))
1081 else if (DECL_HAS_VALUE_EXPR_P (var
))
1083 else if (TREE_STATIC (var
))
1085 else if (TREE_CODE (origvar
) != SSA_NAME
&& DECL_RTL_SET_P (var
))
1087 else if (TREE_TYPE (var
) == error_mark_node
)
1090 expand_one_error_var (var
);
1092 else if (TREE_CODE (var
) == VAR_DECL
&& DECL_HARD_REGISTER (var
))
1095 expand_one_hard_reg_var (var
);
1097 else if (use_register_for_decl (var
))
1100 expand_one_register_var (origvar
);
1102 else if (!host_integerp (DECL_SIZE_UNIT (var
), 1))
1106 error ("size of variable %q+D is too large", var
);
1107 expand_one_error_var (var
);
1110 else if (defer_stack_allocation (var
, toplevel
))
1111 add_stack_var (origvar
);
1115 expand_one_stack_var (origvar
);
1116 return tree_low_cst (DECL_SIZE_UNIT (var
), 1);
1121 /* A subroutine of expand_used_vars. Walk down through the BLOCK tree
1122 expanding variables. Those variables that can be put into registers
1123 are allocated pseudos; those that can't are put on the stack.
1125 TOPLEVEL is true if this is the outermost BLOCK. */
1128 expand_used_vars_for_block (tree block
, bool toplevel
)
1130 size_t i
, j
, old_sv_num
, this_sv_num
, new_sv_num
;
1133 old_sv_num
= toplevel
? 0 : stack_vars_num
;
1135 /* Expand all variables at this level. */
1136 for (t
= BLOCK_VARS (block
); t
; t
= DECL_CHAIN (t
))
1138 expand_one_var (t
, toplevel
, true);
1140 this_sv_num
= stack_vars_num
;
1142 /* Expand all variables at containing levels. */
1143 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
1144 expand_used_vars_for_block (t
, false);
1146 /* Since we do not track exact variable lifetimes (which is not even
1147 possible for variables whose address escapes), we mirror the block
1148 tree in the interference graph. Here we cause all variables at this
1149 level, and all sublevels, to conflict. */
1150 if (old_sv_num
< this_sv_num
)
1152 new_sv_num
= stack_vars_num
;
1154 for (i
= old_sv_num
; i
< new_sv_num
; ++i
)
1155 for (j
= i
< this_sv_num
? i
: this_sv_num
; j
-- > old_sv_num
;)
1156 add_stack_var_conflict (i
, j
);
1160 /* A subroutine of expand_used_vars. Walk down through the BLOCK tree
1161 and clear TREE_USED on all local variables. */
1164 clear_tree_used (tree block
)
1168 for (t
= BLOCK_VARS (block
); t
; t
= DECL_CHAIN (t
))
1169 /* if (!TREE_STATIC (t) && !DECL_EXTERNAL (t)) */
1172 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
1173 clear_tree_used (t
);
1176 /* Examine TYPE and determine a bit mask of the following features. */
1178 #define SPCT_HAS_LARGE_CHAR_ARRAY 1
1179 #define SPCT_HAS_SMALL_CHAR_ARRAY 2
1180 #define SPCT_HAS_ARRAY 4
1181 #define SPCT_HAS_AGGREGATE 8
1184 stack_protect_classify_type (tree type
)
1186 unsigned int ret
= 0;
1189 switch (TREE_CODE (type
))
1192 t
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
1193 if (t
== char_type_node
1194 || t
== signed_char_type_node
1195 || t
== unsigned_char_type_node
)
1197 unsigned HOST_WIDE_INT max
= PARAM_VALUE (PARAM_SSP_BUFFER_SIZE
);
1198 unsigned HOST_WIDE_INT len
;
1200 if (!TYPE_SIZE_UNIT (type
)
1201 || !host_integerp (TYPE_SIZE_UNIT (type
), 1))
1204 len
= tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
1207 ret
= SPCT_HAS_SMALL_CHAR_ARRAY
| SPCT_HAS_ARRAY
;
1209 ret
= SPCT_HAS_LARGE_CHAR_ARRAY
| SPCT_HAS_ARRAY
;
1212 ret
= SPCT_HAS_ARRAY
;
1216 case QUAL_UNION_TYPE
:
1218 ret
= SPCT_HAS_AGGREGATE
;
1219 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
1220 if (TREE_CODE (t
) == FIELD_DECL
)
1221 ret
|= stack_protect_classify_type (TREE_TYPE (t
));
1231 /* Return nonzero if DECL should be segregated into the "vulnerable" upper
1232 part of the local stack frame. Remember if we ever return nonzero for
1233 any variable in this function. The return value is the phase number in
1234 which the variable should be allocated. */
1237 stack_protect_decl_phase (tree decl
)
1239 unsigned int bits
= stack_protect_classify_type (TREE_TYPE (decl
));
1242 if (bits
& SPCT_HAS_SMALL_CHAR_ARRAY
)
1243 has_short_buffer
= true;
1245 if (flag_stack_protect
== 2)
1247 if ((bits
& (SPCT_HAS_SMALL_CHAR_ARRAY
| SPCT_HAS_LARGE_CHAR_ARRAY
))
1248 && !(bits
& SPCT_HAS_AGGREGATE
))
1250 else if (bits
& SPCT_HAS_ARRAY
)
1254 ret
= (bits
& SPCT_HAS_LARGE_CHAR_ARRAY
) != 0;
1257 has_protected_decls
= true;
1262 /* Two helper routines that check for phase 1 and phase 2. These are used
1263 as callbacks for expand_stack_vars. */
1266 stack_protect_decl_phase_1 (tree decl
)
1268 return stack_protect_decl_phase (decl
) == 1;
1272 stack_protect_decl_phase_2 (tree decl
)
1274 return stack_protect_decl_phase (decl
) == 2;
1277 /* Ensure that variables in different stack protection phases conflict
1278 so that they are not merged and share the same stack slot. */
1281 add_stack_protection_conflicts (void)
1283 size_t i
, j
, n
= stack_vars_num
;
1284 unsigned char *phase
;
1286 phase
= XNEWVEC (unsigned char, n
);
1287 for (i
= 0; i
< n
; ++i
)
1288 phase
[i
] = stack_protect_decl_phase (stack_vars
[i
].decl
);
1290 for (i
= 0; i
< n
; ++i
)
1292 unsigned char ph_i
= phase
[i
];
1293 for (j
= 0; j
< i
; ++j
)
1294 if (ph_i
!= phase
[j
])
1295 add_stack_var_conflict (i
, j
);
1301 /* Create a decl for the guard at the top of the stack frame. */
1304 create_stack_guard (void)
1306 tree guard
= build_decl (DECL_SOURCE_LOCATION (current_function_decl
),
1307 VAR_DECL
, NULL
, ptr_type_node
);
1308 TREE_THIS_VOLATILE (guard
) = 1;
1309 TREE_USED (guard
) = 1;
1310 expand_one_stack_var (guard
);
1311 crtl
->stack_protect_guard
= guard
;
1314 /* A subroutine of expand_used_vars. Walk down through the BLOCK tree
1315 expanding variables. Those variables that can be put into registers
1316 are allocated pseudos; those that can't are put on the stack.
1318 TOPLEVEL is true if this is the outermost BLOCK. */
1320 static HOST_WIDE_INT
1321 account_used_vars_for_block (tree block
, bool toplevel
)
1324 HOST_WIDE_INT size
= 0;
1326 /* Expand all variables at this level. */
1327 for (t
= BLOCK_VARS (block
); t
; t
= DECL_CHAIN (t
))
1329 size
+= expand_one_var (t
, toplevel
, false);
1331 /* Expand all variables at containing levels. */
1332 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
1333 size
+= account_used_vars_for_block (t
, false);
1338 /* Prepare for expanding variables. */
1340 init_vars_expansion (void)
1344 /* Set TREE_USED on all variables in the local_decls. */
1345 FOR_EACH_LOCAL_DECL (cfun
, ix
, t
)
1348 /* Clear TREE_USED on all variables associated with a block scope. */
1349 clear_tree_used (DECL_INITIAL (current_function_decl
));
1351 /* Initialize local stack smashing state. */
1352 has_protected_decls
= false;
1353 has_short_buffer
= false;
1356 /* Free up stack variable graph data. */
1358 fini_vars_expansion (void)
1360 size_t i
, n
= stack_vars_num
;
1361 for (i
= 0; i
< n
; i
++)
1362 BITMAP_FREE (stack_vars
[i
].conflicts
);
1363 XDELETEVEC (stack_vars
);
1364 XDELETEVEC (stack_vars_sorted
);
1366 stack_vars_alloc
= stack_vars_num
= 0;
1369 /* Make a fair guess for the size of the stack frame of the decl
1370 passed. This doesn't have to be exact, the result is only used
1371 in the inline heuristics. So we don't want to run the full stack
1372 var packing algorithm (which is quadratic in the number of stack
1373 vars). Instead, we calculate the total size of all stack vars.
1374 This turns out to be a pretty fair estimate -- packing of stack
1375 vars doesn't happen very often. */
1378 estimated_stack_frame_size (tree decl
)
1380 HOST_WIDE_INT size
= 0;
1382 tree var
, outer_block
= DECL_INITIAL (current_function_decl
);
1384 tree old_cur_fun_decl
= current_function_decl
;
1385 current_function_decl
= decl
;
1386 push_cfun (DECL_STRUCT_FUNCTION (decl
));
1388 init_vars_expansion ();
1390 FOR_EACH_LOCAL_DECL (cfun
, ix
, var
)
1392 if (TREE_USED (var
))
1393 size
+= expand_one_var (var
, true, false);
1394 TREE_USED (var
) = 1;
1396 size
+= account_used_vars_for_block (outer_block
, true);
1398 if (stack_vars_num
> 0)
1400 /* Fake sorting the stack vars for account_stack_vars (). */
1401 stack_vars_sorted
= XNEWVEC (size_t, stack_vars_num
);
1402 for (i
= 0; i
< stack_vars_num
; ++i
)
1403 stack_vars_sorted
[i
] = i
;
1404 size
+= account_stack_vars ();
1405 fini_vars_expansion ();
1408 current_function_decl
= old_cur_fun_decl
;
1412 /* Expand all variables used in the function. */
1415 expand_used_vars (void)
1417 tree var
, outer_block
= DECL_INITIAL (current_function_decl
);
1418 VEC(tree
,heap
) *maybe_local_decls
= NULL
;
1422 /* Compute the phase of the stack frame for this function. */
1424 int align
= PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
;
1425 int off
= STARTING_FRAME_OFFSET
% align
;
1426 frame_phase
= off
? align
- off
: 0;
1429 init_vars_expansion ();
1431 for (i
= 0; i
< SA
.map
->num_partitions
; i
++)
1433 tree var
= partition_to_var (SA
.map
, i
);
1435 gcc_assert (is_gimple_reg (var
));
1436 if (TREE_CODE (SSA_NAME_VAR (var
)) == VAR_DECL
)
1437 expand_one_var (var
, true, true);
1440 /* This is a PARM_DECL or RESULT_DECL. For those partitions that
1441 contain the default def (representing the parm or result itself)
1442 we don't do anything here. But those which don't contain the
1443 default def (representing a temporary based on the parm/result)
1444 we need to allocate space just like for normal VAR_DECLs. */
1445 if (!bitmap_bit_p (SA
.partition_has_default_def
, i
))
1447 expand_one_var (var
, true, true);
1448 gcc_assert (SA
.partition_to_pseudo
[i
]);
1453 /* At this point all variables on the local_decls with TREE_USED
1454 set are not associated with any block scope. Lay them out. */
1456 len
= VEC_length (tree
, cfun
->local_decls
);
1457 FOR_EACH_LOCAL_DECL (cfun
, i
, var
)
1459 bool expand_now
= false;
1461 /* Expanded above already. */
1462 if (is_gimple_reg (var
))
1464 TREE_USED (var
) = 0;
1467 /* We didn't set a block for static or extern because it's hard
1468 to tell the difference between a global variable (re)declared
1469 in a local scope, and one that's really declared there to
1470 begin with. And it doesn't really matter much, since we're
1471 not giving them stack space. Expand them now. */
1472 else if (TREE_STATIC (var
) || DECL_EXTERNAL (var
))
1475 /* If the variable is not associated with any block, then it
1476 was created by the optimizers, and could be live anywhere
1478 else if (TREE_USED (var
))
1481 /* Finally, mark all variables on the list as used. We'll use
1482 this in a moment when we expand those associated with scopes. */
1483 TREE_USED (var
) = 1;
1486 expand_one_var (var
, true, true);
1489 if (DECL_ARTIFICIAL (var
) && !DECL_IGNORED_P (var
))
1491 rtx rtl
= DECL_RTL_IF_SET (var
);
1493 /* Keep artificial non-ignored vars in cfun->local_decls
1494 chain until instantiate_decls. */
1495 if (rtl
&& (MEM_P (rtl
) || GET_CODE (rtl
) == CONCAT
))
1496 add_local_decl (cfun
, var
);
1497 else if (rtl
== NULL_RTX
)
1498 /* If rtl isn't set yet, which can happen e.g. with
1499 -fstack-protector, retry before returning from this
1501 VEC_safe_push (tree
, heap
, maybe_local_decls
, var
);
1505 /* We duplicated some of the decls in CFUN->LOCAL_DECLS.
1507 +-----------------+-----------------+
1508 | ...processed... | ...duplicates...|
1509 +-----------------+-----------------+
1511 +-- LEN points here.
1513 We just want the duplicates, as those are the artificial
1514 non-ignored vars that we want to keep until instantiate_decls.
1515 Move them down and truncate the array. */
1516 if (!VEC_empty (tree
, cfun
->local_decls
))
1517 VEC_block_remove (tree
, cfun
->local_decls
, 0, len
);
1519 /* At this point, all variables within the block tree with TREE_USED
1520 set are actually used by the optimized function. Lay them out. */
1521 expand_used_vars_for_block (outer_block
, true);
1523 if (stack_vars_num
> 0)
1525 /* Due to the way alias sets work, no variables with non-conflicting
1526 alias sets may be assigned the same address. Add conflicts to
1528 add_alias_set_conflicts ();
1530 /* If stack protection is enabled, we don't share space between
1531 vulnerable data and non-vulnerable data. */
1532 if (flag_stack_protect
)
1533 add_stack_protection_conflicts ();
1535 /* Now that we have collected all stack variables, and have computed a
1536 minimal interference graph, attempt to save some stack space. */
1537 partition_stack_vars ();
1539 dump_stack_var_partition ();
1542 /* There are several conditions under which we should create a
1543 stack guard: protect-all, alloca used, protected decls present. */
1544 if (flag_stack_protect
== 2
1545 || (flag_stack_protect
1546 && (cfun
->calls_alloca
|| has_protected_decls
)))
1547 create_stack_guard ();
1549 /* Assign rtl to each variable based on these partitions. */
1550 if (stack_vars_num
> 0)
1552 /* Reorder decls to be protected by iterating over the variables
1553 array multiple times, and allocating out of each phase in turn. */
1554 /* ??? We could probably integrate this into the qsort we did
1555 earlier, such that we naturally see these variables first,
1556 and thus naturally allocate things in the right order. */
1557 if (has_protected_decls
)
1559 /* Phase 1 contains only character arrays. */
1560 expand_stack_vars (stack_protect_decl_phase_1
);
1562 /* Phase 2 contains other kinds of arrays. */
1563 if (flag_stack_protect
== 2)
1564 expand_stack_vars (stack_protect_decl_phase_2
);
1567 expand_stack_vars (NULL
);
1569 fini_vars_expansion ();
1572 /* If there were any artificial non-ignored vars without rtl
1573 found earlier, see if deferred stack allocation hasn't assigned
1575 FOR_EACH_VEC_ELT_REVERSE (tree
, maybe_local_decls
, i
, var
)
1577 rtx rtl
= DECL_RTL_IF_SET (var
);
1579 /* Keep artificial non-ignored vars in cfun->local_decls
1580 chain until instantiate_decls. */
1581 if (rtl
&& (MEM_P (rtl
) || GET_CODE (rtl
) == CONCAT
))
1582 add_local_decl (cfun
, var
);
1584 VEC_free (tree
, heap
, maybe_local_decls
);
1586 /* If the target requires that FRAME_OFFSET be aligned, do it. */
1587 if (STACK_ALIGNMENT_NEEDED
)
1589 HOST_WIDE_INT align
= PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
;
1590 if (!FRAME_GROWS_DOWNWARD
)
1591 frame_offset
+= align
- 1;
1592 frame_offset
&= -align
;
1597 /* If we need to produce a detailed dump, print the tree representation
1598 for STMT to the dump file. SINCE is the last RTX after which the RTL
1599 generated for STMT should have been appended. */
1602 maybe_dump_rtl_for_gimple_stmt (gimple stmt
, rtx since
)
1604 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1606 fprintf (dump_file
, "\n;; ");
1607 print_gimple_stmt (dump_file
, stmt
, 0,
1608 TDF_SLIM
| (dump_flags
& TDF_LINENO
));
1609 fprintf (dump_file
, "\n");
1611 print_rtl (dump_file
, since
? NEXT_INSN (since
) : since
);
1615 /* Maps the blocks that do not contain tree labels to rtx labels. */
1617 static struct pointer_map_t
*lab_rtx_for_bb
;
1619 /* Returns the label_rtx expression for a label starting basic block BB. */
1622 label_rtx_for_bb (basic_block bb ATTRIBUTE_UNUSED
)
1624 gimple_stmt_iterator gsi
;
1629 if (bb
->flags
& BB_RTL
)
1630 return block_label (bb
);
1632 elt
= pointer_map_contains (lab_rtx_for_bb
, bb
);
1636 /* Find the tree label if it is present. */
1638 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1640 lab_stmt
= gsi_stmt (gsi
);
1641 if (gimple_code (lab_stmt
) != GIMPLE_LABEL
)
1644 lab
= gimple_label_label (lab_stmt
);
1645 if (DECL_NONLOCAL (lab
))
1648 return label_rtx (lab
);
1651 elt
= pointer_map_insert (lab_rtx_for_bb
, bb
);
1652 *elt
= gen_label_rtx ();
1657 /* A subroutine of expand_gimple_cond. Given E, a fallthrough edge
1658 of a basic block where we just expanded the conditional at the end,
1659 possibly clean up the CFG and instruction sequence. LAST is the
1660 last instruction before the just emitted jump sequence. */
1663 maybe_cleanup_end_of_block (edge e
, rtx last
)
1665 /* Special case: when jumpif decides that the condition is
1666 trivial it emits an unconditional jump (and the necessary
1667 barrier). But we still have two edges, the fallthru one is
1668 wrong. purge_dead_edges would clean this up later. Unfortunately
1669 we have to insert insns (and split edges) before
1670 find_many_sub_basic_blocks and hence before purge_dead_edges.
1671 But splitting edges might create new blocks which depend on the
1672 fact that if there are two edges there's no barrier. So the
1673 barrier would get lost and verify_flow_info would ICE. Instead
1674 of auditing all edge splitters to care for the barrier (which
1675 normally isn't there in a cleaned CFG), fix it here. */
1676 if (BARRIER_P (get_last_insn ()))
1680 /* Now, we have a single successor block, if we have insns to
1681 insert on the remaining edge we potentially will insert
1682 it at the end of this block (if the dest block isn't feasible)
1683 in order to avoid splitting the edge. This insertion will take
1684 place in front of the last jump. But we might have emitted
1685 multiple jumps (conditional and one unconditional) to the
1686 same destination. Inserting in front of the last one then
1687 is a problem. See PR 40021. We fix this by deleting all
1688 jumps except the last unconditional one. */
1689 insn
= PREV_INSN (get_last_insn ());
1690 /* Make sure we have an unconditional jump. Otherwise we're
1692 gcc_assert (JUMP_P (insn
) && !any_condjump_p (insn
));
1693 for (insn
= PREV_INSN (insn
); insn
!= last
;)
1695 insn
= PREV_INSN (insn
);
1696 if (JUMP_P (NEXT_INSN (insn
)))
1697 delete_insn (NEXT_INSN (insn
));
1702 /* A subroutine of expand_gimple_basic_block. Expand one GIMPLE_COND.
1703 Returns a new basic block if we've terminated the current basic
1704 block and created a new one. */
1707 expand_gimple_cond (basic_block bb
, gimple stmt
)
1709 basic_block new_bb
, dest
;
1714 enum tree_code code
;
1717 code
= gimple_cond_code (stmt
);
1718 op0
= gimple_cond_lhs (stmt
);
1719 op1
= gimple_cond_rhs (stmt
);
1720 /* We're sometimes presented with such code:
1724 This would expand to two comparisons which then later might
1725 be cleaned up by combine. But some pattern matchers like if-conversion
1726 work better when there's only one compare, so make up for this
1727 here as special exception if TER would have made the same change. */
1728 if (gimple_cond_single_var_p (stmt
)
1730 && TREE_CODE (op0
) == SSA_NAME
1731 && bitmap_bit_p (SA
.values
, SSA_NAME_VERSION (op0
)))
1733 gimple second
= SSA_NAME_DEF_STMT (op0
);
1734 if (gimple_code (second
) == GIMPLE_ASSIGN
)
1736 enum tree_code code2
= gimple_assign_rhs_code (second
);
1737 if (TREE_CODE_CLASS (code2
) == tcc_comparison
)
1740 op0
= gimple_assign_rhs1 (second
);
1741 op1
= gimple_assign_rhs2 (second
);
1743 /* If jumps are cheap turn some more codes into
1745 else if (BRANCH_COST (optimize_insn_for_speed_p (), false) < 4)
1747 if ((code2
== BIT_AND_EXPR
1748 && TYPE_PRECISION (TREE_TYPE (op0
)) == 1
1749 && TREE_CODE (gimple_assign_rhs2 (second
)) != INTEGER_CST
)
1750 || code2
== TRUTH_AND_EXPR
)
1752 code
= TRUTH_ANDIF_EXPR
;
1753 op0
= gimple_assign_rhs1 (second
);
1754 op1
= gimple_assign_rhs2 (second
);
1756 else if (code2
== BIT_IOR_EXPR
|| code2
== TRUTH_OR_EXPR
)
1758 code
= TRUTH_ORIF_EXPR
;
1759 op0
= gimple_assign_rhs1 (second
);
1760 op1
= gimple_assign_rhs2 (second
);
1766 last2
= last
= get_last_insn ();
1768 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
1769 if (gimple_has_location (stmt
))
1771 set_curr_insn_source_location (gimple_location (stmt
));
1772 set_curr_insn_block (gimple_block (stmt
));
1775 /* These flags have no purpose in RTL land. */
1776 true_edge
->flags
&= ~EDGE_TRUE_VALUE
;
1777 false_edge
->flags
&= ~EDGE_FALSE_VALUE
;
1779 /* We can either have a pure conditional jump with one fallthru edge or
1780 two-way jump that needs to be decomposed into two basic blocks. */
1781 if (false_edge
->dest
== bb
->next_bb
)
1783 jumpif_1 (code
, op0
, op1
, label_rtx_for_bb (true_edge
->dest
),
1784 true_edge
->probability
);
1785 maybe_dump_rtl_for_gimple_stmt (stmt
, last
);
1786 if (true_edge
->goto_locus
)
1788 set_curr_insn_source_location (true_edge
->goto_locus
);
1789 set_curr_insn_block (true_edge
->goto_block
);
1790 true_edge
->goto_locus
= curr_insn_locator ();
1792 true_edge
->goto_block
= NULL
;
1793 false_edge
->flags
|= EDGE_FALLTHRU
;
1794 maybe_cleanup_end_of_block (false_edge
, last
);
1797 if (true_edge
->dest
== bb
->next_bb
)
1799 jumpifnot_1 (code
, op0
, op1
, label_rtx_for_bb (false_edge
->dest
),
1800 false_edge
->probability
);
1801 maybe_dump_rtl_for_gimple_stmt (stmt
, last
);
1802 if (false_edge
->goto_locus
)
1804 set_curr_insn_source_location (false_edge
->goto_locus
);
1805 set_curr_insn_block (false_edge
->goto_block
);
1806 false_edge
->goto_locus
= curr_insn_locator ();
1808 false_edge
->goto_block
= NULL
;
1809 true_edge
->flags
|= EDGE_FALLTHRU
;
1810 maybe_cleanup_end_of_block (true_edge
, last
);
1814 jumpif_1 (code
, op0
, op1
, label_rtx_for_bb (true_edge
->dest
),
1815 true_edge
->probability
);
1816 last
= get_last_insn ();
1817 if (false_edge
->goto_locus
)
1819 set_curr_insn_source_location (false_edge
->goto_locus
);
1820 set_curr_insn_block (false_edge
->goto_block
);
1821 false_edge
->goto_locus
= curr_insn_locator ();
1823 false_edge
->goto_block
= NULL
;
1824 emit_jump (label_rtx_for_bb (false_edge
->dest
));
1827 if (BARRIER_P (BB_END (bb
)))
1828 BB_END (bb
) = PREV_INSN (BB_END (bb
));
1829 update_bb_for_insn (bb
);
1831 new_bb
= create_basic_block (NEXT_INSN (last
), get_last_insn (), bb
);
1832 dest
= false_edge
->dest
;
1833 redirect_edge_succ (false_edge
, new_bb
);
1834 false_edge
->flags
|= EDGE_FALLTHRU
;
1835 new_bb
->count
= false_edge
->count
;
1836 new_bb
->frequency
= EDGE_FREQUENCY (false_edge
);
1837 new_edge
= make_edge (new_bb
, dest
, 0);
1838 new_edge
->probability
= REG_BR_PROB_BASE
;
1839 new_edge
->count
= new_bb
->count
;
1840 if (BARRIER_P (BB_END (new_bb
)))
1841 BB_END (new_bb
) = PREV_INSN (BB_END (new_bb
));
1842 update_bb_for_insn (new_bb
);
1844 maybe_dump_rtl_for_gimple_stmt (stmt
, last2
);
1846 if (true_edge
->goto_locus
)
1848 set_curr_insn_source_location (true_edge
->goto_locus
);
1849 set_curr_insn_block (true_edge
->goto_block
);
1850 true_edge
->goto_locus
= curr_insn_locator ();
1852 true_edge
->goto_block
= NULL
;
1857 /* A subroutine of expand_gimple_stmt_1, expanding one GIMPLE_CALL
1861 expand_call_stmt (gimple stmt
)
1864 tree lhs
= gimple_call_lhs (stmt
);
1869 exp
= build_vl_exp (CALL_EXPR
, gimple_call_num_args (stmt
) + 3);
1871 CALL_EXPR_FN (exp
) = gimple_call_fn (stmt
);
1872 decl
= gimple_call_fndecl (stmt
);
1873 builtin_p
= decl
&& DECL_BUILT_IN (decl
);
1875 TREE_TYPE (exp
) = gimple_call_return_type (stmt
);
1876 CALL_EXPR_STATIC_CHAIN (exp
) = gimple_call_chain (stmt
);
1878 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
1880 tree arg
= gimple_call_arg (stmt
, i
);
1882 /* TER addresses into arguments of builtin functions so we have a
1883 chance to infer more correct alignment information. See PR39954. */
1885 && TREE_CODE (arg
) == SSA_NAME
1886 && (def
= get_gimple_for_ssa_name (arg
))
1887 && gimple_assign_rhs_code (def
) == ADDR_EXPR
)
1888 arg
= gimple_assign_rhs1 (def
);
1889 CALL_EXPR_ARG (exp
, i
) = arg
;
1892 if (gimple_has_side_effects (stmt
))
1893 TREE_SIDE_EFFECTS (exp
) = 1;
1895 if (gimple_call_nothrow_p (stmt
))
1896 TREE_NOTHROW (exp
) = 1;
1898 CALL_EXPR_TAILCALL (exp
) = gimple_call_tail_p (stmt
);
1899 CALL_EXPR_RETURN_SLOT_OPT (exp
) = gimple_call_return_slot_opt_p (stmt
);
1900 CALL_FROM_THUNK_P (exp
) = gimple_call_from_thunk_p (stmt
);
1901 CALL_CANNOT_INLINE_P (exp
) = gimple_call_cannot_inline_p (stmt
);
1902 CALL_EXPR_VA_ARG_PACK (exp
) = gimple_call_va_arg_pack_p (stmt
);
1903 SET_EXPR_LOCATION (exp
, gimple_location (stmt
));
1904 TREE_BLOCK (exp
) = gimple_block (stmt
);
1907 expand_assignment (lhs
, exp
, false);
1909 expand_expr_real_1 (exp
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
, NULL
);
1912 /* A subroutine of expand_gimple_stmt, expanding one gimple statement
1913 STMT that doesn't require special handling for outgoing edges. That
1914 is no tailcalls and no GIMPLE_COND. */
1917 expand_gimple_stmt_1 (gimple stmt
)
1920 switch (gimple_code (stmt
))
1923 op0
= gimple_goto_dest (stmt
);
1924 if (TREE_CODE (op0
) == LABEL_DECL
)
1927 expand_computed_goto (op0
);
1930 expand_label (gimple_label_label (stmt
));
1933 case GIMPLE_PREDICT
:
1939 expand_asm_stmt (stmt
);
1942 expand_call_stmt (stmt
);
1946 op0
= gimple_return_retval (stmt
);
1948 if (op0
&& op0
!= error_mark_node
)
1950 tree result
= DECL_RESULT (current_function_decl
);
1952 /* If we are not returning the current function's RESULT_DECL,
1953 build an assignment to it. */
1956 /* I believe that a function's RESULT_DECL is unique. */
1957 gcc_assert (TREE_CODE (op0
) != RESULT_DECL
);
1959 /* ??? We'd like to use simply expand_assignment here,
1960 but this fails if the value is of BLKmode but the return
1961 decl is a register. expand_return has special handling
1962 for this combination, which eventually should move
1963 to common code. See comments there. Until then, let's
1964 build a modify expression :-/ */
1965 op0
= build2 (MODIFY_EXPR
, TREE_TYPE (result
),
1970 expand_null_return ();
1972 expand_return (op0
);
1977 tree lhs
= gimple_assign_lhs (stmt
);
1979 /* Tree expand used to fiddle with |= and &= of two bitfield
1980 COMPONENT_REFs here. This can't happen with gimple, the LHS
1981 of binary assigns must be a gimple reg. */
1983 if (TREE_CODE (lhs
) != SSA_NAME
1984 || get_gimple_rhs_class (gimple_expr_code (stmt
))
1985 == GIMPLE_SINGLE_RHS
)
1987 tree rhs
= gimple_assign_rhs1 (stmt
);
1988 gcc_assert (get_gimple_rhs_class (gimple_expr_code (stmt
))
1989 == GIMPLE_SINGLE_RHS
);
1990 if (gimple_has_location (stmt
) && CAN_HAVE_LOCATION_P (rhs
))
1991 SET_EXPR_LOCATION (rhs
, gimple_location (stmt
));
1992 expand_assignment (lhs
, rhs
,
1993 gimple_assign_nontemporal_move_p (stmt
));
1998 bool nontemporal
= gimple_assign_nontemporal_move_p (stmt
);
1999 struct separate_ops ops
;
2000 bool promoted
= false;
2002 target
= expand_expr (lhs
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
2003 if (GET_CODE (target
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (target
))
2006 ops
.code
= gimple_assign_rhs_code (stmt
);
2007 ops
.type
= TREE_TYPE (lhs
);
2008 switch (get_gimple_rhs_class (gimple_expr_code (stmt
)))
2010 case GIMPLE_TERNARY_RHS
:
2011 ops
.op2
= gimple_assign_rhs3 (stmt
);
2013 case GIMPLE_BINARY_RHS
:
2014 ops
.op1
= gimple_assign_rhs2 (stmt
);
2016 case GIMPLE_UNARY_RHS
:
2017 ops
.op0
= gimple_assign_rhs1 (stmt
);
2022 ops
.location
= gimple_location (stmt
);
2024 /* If we want to use a nontemporal store, force the value to
2025 register first. If we store into a promoted register,
2026 don't directly expand to target. */
2027 temp
= nontemporal
|| promoted
? NULL_RTX
: target
;
2028 temp
= expand_expr_real_2 (&ops
, temp
, GET_MODE (target
),
2035 int unsignedp
= SUBREG_PROMOTED_UNSIGNED_P (target
);
2036 /* If TEMP is a VOIDmode constant, use convert_modes to make
2037 sure that we properly convert it. */
2038 if (CONSTANT_P (temp
) && GET_MODE (temp
) == VOIDmode
)
2040 temp
= convert_modes (GET_MODE (target
),
2041 TYPE_MODE (ops
.type
),
2043 temp
= convert_modes (GET_MODE (SUBREG_REG (target
)),
2044 GET_MODE (target
), temp
, unsignedp
);
2047 convert_move (SUBREG_REG (target
), temp
, unsignedp
);
2049 else if (nontemporal
&& emit_storent_insn (target
, temp
))
2053 temp
= force_operand (temp
, target
);
2055 emit_move_insn (target
, temp
);
2066 /* Expand one gimple statement STMT and return the last RTL instruction
2067 before any of the newly generated ones.
2069 In addition to generating the necessary RTL instructions this also
2070 sets REG_EH_REGION notes if necessary and sets the current source
2071 location for diagnostics. */
2074 expand_gimple_stmt (gimple stmt
)
2078 location_t saved_location
= input_location
;
2080 last
= get_last_insn ();
2082 /* If this is an expression of some kind and it has an associated line
2083 number, then emit the line number before expanding the expression.
2085 We need to save and restore the file and line information so that
2086 errors discovered during expansion are emitted with the right
2087 information. It would be better of the diagnostic routines
2088 used the file/line information embedded in the tree nodes rather
2092 if (gimple_has_location (stmt
))
2094 input_location
= gimple_location (stmt
);
2095 set_curr_insn_source_location (input_location
);
2097 /* Record where the insns produced belong. */
2098 set_curr_insn_block (gimple_block (stmt
));
2101 expand_gimple_stmt_1 (stmt
);
2102 /* Free any temporaries used to evaluate this statement. */
2105 input_location
= saved_location
;
2107 /* Mark all insns that may trap. */
2108 lp_nr
= lookup_stmt_eh_lp (stmt
);
2112 for (insn
= next_real_insn (last
); insn
;
2113 insn
= next_real_insn (insn
))
2115 if (! find_reg_note (insn
, REG_EH_REGION
, NULL_RTX
)
2116 /* If we want exceptions for non-call insns, any
2117 may_trap_p instruction may throw. */
2118 && GET_CODE (PATTERN (insn
)) != CLOBBER
2119 && GET_CODE (PATTERN (insn
)) != USE
2120 && insn_could_throw_p (insn
))
2121 make_reg_eh_region_note (insn
, 0, lp_nr
);
2128 /* A subroutine of expand_gimple_basic_block. Expand one GIMPLE_CALL
2129 that has CALL_EXPR_TAILCALL set. Returns non-null if we actually
2130 generated a tail call (something that might be denied by the ABI
2131 rules governing the call; see calls.c).
2133 Sets CAN_FALLTHRU if we generated a *conditional* tail call, and
2134 can still reach the rest of BB. The case here is __builtin_sqrt,
2135 where the NaN result goes through the external function (with a
2136 tailcall) and the normal result happens via a sqrt instruction. */
2139 expand_gimple_tailcall (basic_block bb
, gimple stmt
, bool *can_fallthru
)
2147 last2
= last
= expand_gimple_stmt (stmt
);
2149 for (last
= NEXT_INSN (last
); last
; last
= NEXT_INSN (last
))
2150 if (CALL_P (last
) && SIBLING_CALL_P (last
))
2153 maybe_dump_rtl_for_gimple_stmt (stmt
, last2
);
2155 *can_fallthru
= true;
2159 /* ??? Wouldn't it be better to just reset any pending stack adjust?
2160 Any instructions emitted here are about to be deleted. */
2161 do_pending_stack_adjust ();
2163 /* Remove any non-eh, non-abnormal edges that don't go to exit. */
2164 /* ??? I.e. the fallthrough edge. HOWEVER! If there were to be
2165 EH or abnormal edges, we shouldn't have created a tail call in
2166 the first place. So it seems to me we should just be removing
2167 all edges here, or redirecting the existing fallthru edge to
2173 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
2175 if (!(e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
)))
2177 if (e
->dest
!= EXIT_BLOCK_PTR
)
2179 e
->dest
->count
-= e
->count
;
2180 e
->dest
->frequency
-= EDGE_FREQUENCY (e
);
2181 if (e
->dest
->count
< 0)
2183 if (e
->dest
->frequency
< 0)
2184 e
->dest
->frequency
= 0;
2187 probability
+= e
->probability
;
2194 /* This is somewhat ugly: the call_expr expander often emits instructions
2195 after the sibcall (to perform the function return). These confuse the
2196 find_many_sub_basic_blocks code, so we need to get rid of these. */
2197 last
= NEXT_INSN (last
);
2198 gcc_assert (BARRIER_P (last
));
2200 *can_fallthru
= false;
2201 while (NEXT_INSN (last
))
2203 /* For instance an sqrt builtin expander expands if with
2204 sibcall in the then and label for `else`. */
2205 if (LABEL_P (NEXT_INSN (last
)))
2207 *can_fallthru
= true;
2210 delete_insn (NEXT_INSN (last
));
2213 e
= make_edge (bb
, EXIT_BLOCK_PTR
, EDGE_ABNORMAL
| EDGE_SIBCALL
);
2214 e
->probability
+= probability
;
2217 update_bb_for_insn (bb
);
2219 if (NEXT_INSN (last
))
2221 bb
= create_basic_block (NEXT_INSN (last
), get_last_insn (), bb
);
2224 if (BARRIER_P (last
))
2225 BB_END (bb
) = PREV_INSN (last
);
2228 maybe_dump_rtl_for_gimple_stmt (stmt
, last2
);
2233 /* Return the difference between the floor and the truncated result of
2234 a signed division by OP1 with remainder MOD. */
2236 floor_sdiv_adjust (enum machine_mode mode
, rtx mod
, rtx op1
)
2238 /* (mod != 0 ? (op1 / mod < 0 ? -1 : 0) : 0) */
2239 return gen_rtx_IF_THEN_ELSE
2240 (mode
, gen_rtx_NE (BImode
, mod
, const0_rtx
),
2241 gen_rtx_IF_THEN_ELSE
2242 (mode
, gen_rtx_LT (BImode
,
2243 gen_rtx_DIV (mode
, op1
, mod
),
2245 constm1_rtx
, const0_rtx
),
2249 /* Return the difference between the ceil and the truncated result of
2250 a signed division by OP1 with remainder MOD. */
2252 ceil_sdiv_adjust (enum machine_mode mode
, rtx mod
, rtx op1
)
2254 /* (mod != 0 ? (op1 / mod > 0 ? 1 : 0) : 0) */
2255 return gen_rtx_IF_THEN_ELSE
2256 (mode
, gen_rtx_NE (BImode
, mod
, const0_rtx
),
2257 gen_rtx_IF_THEN_ELSE
2258 (mode
, gen_rtx_GT (BImode
,
2259 gen_rtx_DIV (mode
, op1
, mod
),
2261 const1_rtx
, const0_rtx
),
2265 /* Return the difference between the ceil and the truncated result of
2266 an unsigned division by OP1 with remainder MOD. */
2268 ceil_udiv_adjust (enum machine_mode mode
, rtx mod
, rtx op1 ATTRIBUTE_UNUSED
)
2270 /* (mod != 0 ? 1 : 0) */
2271 return gen_rtx_IF_THEN_ELSE
2272 (mode
, gen_rtx_NE (BImode
, mod
, const0_rtx
),
2273 const1_rtx
, const0_rtx
);
2276 /* Return the difference between the rounded and the truncated result
2277 of a signed division by OP1 with remainder MOD. Halfway cases are
2278 rounded away from zero, rather than to the nearest even number. */
2280 round_sdiv_adjust (enum machine_mode mode
, rtx mod
, rtx op1
)
2282 /* (abs (mod) >= abs (op1) - abs (mod)
2283 ? (op1 / mod > 0 ? 1 : -1)
2285 return gen_rtx_IF_THEN_ELSE
2286 (mode
, gen_rtx_GE (BImode
, gen_rtx_ABS (mode
, mod
),
2287 gen_rtx_MINUS (mode
,
2288 gen_rtx_ABS (mode
, op1
),
2289 gen_rtx_ABS (mode
, mod
))),
2290 gen_rtx_IF_THEN_ELSE
2291 (mode
, gen_rtx_GT (BImode
,
2292 gen_rtx_DIV (mode
, op1
, mod
),
2294 const1_rtx
, constm1_rtx
),
2298 /* Return the difference between the rounded and the truncated result
2299 of a unsigned division by OP1 with remainder MOD. Halfway cases
2300 are rounded away from zero, rather than to the nearest even
2303 round_udiv_adjust (enum machine_mode mode
, rtx mod
, rtx op1
)
2305 /* (mod >= op1 - mod ? 1 : 0) */
2306 return gen_rtx_IF_THEN_ELSE
2307 (mode
, gen_rtx_GE (BImode
, mod
,
2308 gen_rtx_MINUS (mode
, op1
, mod
)),
2309 const1_rtx
, const0_rtx
);
2312 /* Convert X to MODE, that must be Pmode or ptr_mode, without emitting
2316 convert_debug_memory_address (enum machine_mode mode
, rtx x
)
2318 enum machine_mode xmode
= GET_MODE (x
);
2320 #ifndef POINTERS_EXTEND_UNSIGNED
2321 gcc_assert (mode
== Pmode
);
2322 gcc_assert (xmode
== mode
|| xmode
== VOIDmode
);
2324 gcc_assert (mode
== Pmode
|| mode
== ptr_mode
);
2326 if (GET_MODE (x
) == mode
|| GET_MODE (x
) == VOIDmode
)
2329 if (GET_MODE_BITSIZE (mode
) < GET_MODE_BITSIZE (xmode
))
2330 x
= simplify_gen_subreg (mode
, x
, xmode
,
2331 subreg_lowpart_offset
2333 else if (POINTERS_EXTEND_UNSIGNED
> 0)
2334 x
= gen_rtx_ZERO_EXTEND (mode
, x
);
2335 else if (!POINTERS_EXTEND_UNSIGNED
)
2336 x
= gen_rtx_SIGN_EXTEND (mode
, x
);
2339 #endif /* POINTERS_EXTEND_UNSIGNED */
2344 /* Return an RTX equivalent to the value of the tree expression
2348 expand_debug_expr (tree exp
)
2350 rtx op0
= NULL_RTX
, op1
= NULL_RTX
, op2
= NULL_RTX
;
2351 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2352 int unsignedp
= TYPE_UNSIGNED (TREE_TYPE (exp
));
2355 switch (TREE_CODE_CLASS (TREE_CODE (exp
)))
2357 case tcc_expression
:
2358 switch (TREE_CODE (exp
))
2362 case WIDEN_MULT_PLUS_EXPR
:
2363 case WIDEN_MULT_MINUS_EXPR
:
2367 case TRUTH_ANDIF_EXPR
:
2368 case TRUTH_ORIF_EXPR
:
2369 case TRUTH_AND_EXPR
:
2371 case TRUTH_XOR_EXPR
:
2374 case TRUTH_NOT_EXPR
:
2383 op2
= expand_debug_expr (TREE_OPERAND (exp
, 2));
2390 case tcc_comparison
:
2391 op1
= expand_debug_expr (TREE_OPERAND (exp
, 1));
2398 op0
= expand_debug_expr (TREE_OPERAND (exp
, 0));
2408 case tcc_exceptional
:
2409 case tcc_declaration
:
2415 switch (TREE_CODE (exp
))
2418 if (!lookup_constant_def (exp
))
2420 if (strlen (TREE_STRING_POINTER (exp
)) + 1
2421 != (size_t) TREE_STRING_LENGTH (exp
))
2423 op0
= gen_rtx_CONST_STRING (Pmode
, TREE_STRING_POINTER (exp
));
2424 op0
= gen_rtx_MEM (BLKmode
, op0
);
2425 set_mem_attributes (op0
, exp
, 0);
2428 /* Fall through... */
2433 op0
= expand_expr (exp
, NULL_RTX
, mode
, EXPAND_INITIALIZER
);
2437 gcc_assert (COMPLEX_MODE_P (mode
));
2438 op0
= expand_debug_expr (TREE_REALPART (exp
));
2439 op1
= expand_debug_expr (TREE_IMAGPART (exp
));
2440 return gen_rtx_CONCAT (mode
, op0
, op1
);
2442 case DEBUG_EXPR_DECL
:
2443 op0
= DECL_RTL_IF_SET (exp
);
2448 op0
= gen_rtx_DEBUG_EXPR (mode
);
2449 DEBUG_EXPR_TREE_DECL (op0
) = exp
;
2450 SET_DECL_RTL (exp
, op0
);
2460 op0
= DECL_RTL_IF_SET (exp
);
2462 /* This decl was probably optimized away. */
2465 if (TREE_CODE (exp
) != VAR_DECL
2466 || DECL_EXTERNAL (exp
)
2467 || !TREE_STATIC (exp
)
2469 || DECL_HARD_REGISTER (exp
)
2470 || mode
== VOIDmode
)
2473 op0
= make_decl_rtl_for_debug (exp
);
2475 || GET_CODE (XEXP (op0
, 0)) != SYMBOL_REF
2476 || SYMBOL_REF_DECL (XEXP (op0
, 0)) != exp
)
2480 op0
= copy_rtx (op0
);
2482 if (GET_MODE (op0
) == BLKmode
2483 /* If op0 is not BLKmode, but BLKmode is, adjust_mode
2484 below would ICE. While it is likely a FE bug,
2485 try to be robust here. See PR43166. */
2487 || (mode
== VOIDmode
&& GET_MODE (op0
) != VOIDmode
))
2489 gcc_assert (MEM_P (op0
));
2490 op0
= adjust_address_nv (op0
, mode
, 0);
2501 enum machine_mode inner_mode
= GET_MODE (op0
);
2503 if (mode
== inner_mode
)
2506 if (inner_mode
== VOIDmode
)
2508 if (TREE_CODE (exp
) == SSA_NAME
)
2509 inner_mode
= TYPE_MODE (TREE_TYPE (exp
));
2511 inner_mode
= TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
2512 if (mode
== inner_mode
)
2516 if (FLOAT_MODE_P (mode
) && FLOAT_MODE_P (inner_mode
))
2518 if (GET_MODE_BITSIZE (mode
) == GET_MODE_BITSIZE (inner_mode
))
2519 op0
= simplify_gen_subreg (mode
, op0
, inner_mode
, 0);
2520 else if (GET_MODE_BITSIZE (mode
) < GET_MODE_BITSIZE (inner_mode
))
2521 op0
= simplify_gen_unary (FLOAT_TRUNCATE
, mode
, op0
, inner_mode
);
2523 op0
= simplify_gen_unary (FLOAT_EXTEND
, mode
, op0
, inner_mode
);
2525 else if (FLOAT_MODE_P (mode
))
2527 gcc_assert (TREE_CODE (exp
) != SSA_NAME
);
2528 if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))))
2529 op0
= simplify_gen_unary (UNSIGNED_FLOAT
, mode
, op0
, inner_mode
);
2531 op0
= simplify_gen_unary (FLOAT
, mode
, op0
, inner_mode
);
2533 else if (FLOAT_MODE_P (inner_mode
))
2536 op0
= simplify_gen_unary (UNSIGNED_FIX
, mode
, op0
, inner_mode
);
2538 op0
= simplify_gen_unary (FIX
, mode
, op0
, inner_mode
);
2540 else if (CONSTANT_P (op0
)
2541 || GET_MODE_BITSIZE (mode
) <= GET_MODE_BITSIZE (inner_mode
))
2542 op0
= simplify_gen_subreg (mode
, op0
, inner_mode
,
2543 subreg_lowpart_offset (mode
,
2545 else if (TREE_CODE_CLASS (TREE_CODE (exp
)) == tcc_unary
2546 ? TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0)))
2548 op0
= gen_rtx_ZERO_EXTEND (mode
, op0
);
2550 op0
= gen_rtx_SIGN_EXTEND (mode
, op0
);
2557 op0
= expand_debug_expr (TREE_OPERAND (exp
, 0));
2561 if (TREE_CODE (exp
) == MEM_REF
)
2563 op1
= expand_debug_expr (TREE_OPERAND (exp
, 1));
2564 if (!op1
|| !CONST_INT_P (op1
))
2567 op0
= plus_constant (op0
, INTVAL (op1
));
2570 if (POINTER_TYPE_P (TREE_TYPE (exp
)))
2571 as
= TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp
)));
2573 as
= ADDR_SPACE_GENERIC
;
2575 op0
= gen_rtx_MEM (mode
, op0
);
2577 set_mem_attributes (op0
, exp
, 0);
2578 set_mem_addr_space (op0
, as
);
2582 case TARGET_MEM_REF
:
2583 if (TREE_CODE (TMR_BASE (exp
)) == ADDR_EXPR
2584 && !DECL_RTL_SET_P (TREE_OPERAND (TMR_BASE (exp
), 0)))
2587 op0
= expand_debug_expr
2588 (tree_mem_ref_addr (build_pointer_type (TREE_TYPE (exp
)), exp
));
2592 as
= TYPE_ADDR_SPACE (TREE_TYPE (exp
));
2594 op0
= gen_rtx_MEM (mode
, op0
);
2596 set_mem_attributes (op0
, exp
, 0);
2597 set_mem_addr_space (op0
, as
);
2602 case ARRAY_RANGE_REF
:
2607 case VIEW_CONVERT_EXPR
:
2609 enum machine_mode mode1
;
2610 HOST_WIDE_INT bitsize
, bitpos
;
2613 tree tem
= get_inner_reference (exp
, &bitsize
, &bitpos
, &offset
,
2614 &mode1
, &unsignedp
, &volatilep
, false);
2620 orig_op0
= op0
= expand_debug_expr (tem
);
2627 enum machine_mode addrmode
, offmode
;
2632 op0
= XEXP (op0
, 0);
2633 addrmode
= GET_MODE (op0
);
2634 if (addrmode
== VOIDmode
)
2637 op1
= expand_debug_expr (offset
);
2641 offmode
= GET_MODE (op1
);
2642 if (offmode
== VOIDmode
)
2643 offmode
= TYPE_MODE (TREE_TYPE (offset
));
2645 if (addrmode
!= offmode
)
2646 op1
= simplify_gen_subreg (addrmode
, op1
, offmode
,
2647 subreg_lowpart_offset (addrmode
,
2650 /* Don't use offset_address here, we don't need a
2651 recognizable address, and we don't want to generate
2653 op0
= gen_rtx_MEM (mode
, gen_rtx_PLUS (addrmode
, op0
, op1
));
2658 if (mode1
== VOIDmode
)
2660 mode1
= smallest_mode_for_size (bitsize
, MODE_INT
);
2661 if (bitpos
>= BITS_PER_UNIT
)
2663 op0
= adjust_address_nv (op0
, mode1
, bitpos
/ BITS_PER_UNIT
);
2664 bitpos
%= BITS_PER_UNIT
;
2666 else if (bitpos
< 0)
2669 = (-bitpos
+ BITS_PER_UNIT
- 1) / BITS_PER_UNIT
;
2670 op0
= adjust_address_nv (op0
, mode1
, units
);
2671 bitpos
+= units
* BITS_PER_UNIT
;
2673 else if (bitpos
== 0 && bitsize
== GET_MODE_BITSIZE (mode
))
2674 op0
= adjust_address_nv (op0
, mode
, 0);
2675 else if (GET_MODE (op0
) != mode1
)
2676 op0
= adjust_address_nv (op0
, mode1
, 0);
2678 op0
= copy_rtx (op0
);
2679 if (op0
== orig_op0
)
2680 op0
= shallow_copy_rtx (op0
);
2681 set_mem_attributes (op0
, exp
, 0);
2684 if (bitpos
== 0 && mode
== GET_MODE (op0
))
2690 if (GET_MODE (op0
) == BLKmode
)
2693 if ((bitpos
% BITS_PER_UNIT
) == 0
2694 && bitsize
== GET_MODE_BITSIZE (mode1
))
2696 enum machine_mode opmode
= GET_MODE (op0
);
2698 if (opmode
== VOIDmode
)
2701 /* This condition may hold if we're expanding the address
2702 right past the end of an array that turned out not to
2703 be addressable (i.e., the address was only computed in
2704 debug stmts). The gen_subreg below would rightfully
2705 crash, and the address doesn't really exist, so just
2707 if (bitpos
>= GET_MODE_BITSIZE (opmode
))
2710 if ((bitpos
% GET_MODE_BITSIZE (mode
)) == 0)
2711 return simplify_gen_subreg (mode
, op0
, opmode
,
2712 bitpos
/ BITS_PER_UNIT
);
2715 return simplify_gen_ternary (SCALAR_INT_MODE_P (GET_MODE (op0
))
2716 && TYPE_UNSIGNED (TREE_TYPE (exp
))
2718 : ZERO_EXTRACT
, mode
,
2719 GET_MODE (op0
) != VOIDmode
2720 ? GET_MODE (op0
) : mode1
,
2721 op0
, GEN_INT (bitsize
), GEN_INT (bitpos
));
2725 return gen_rtx_ABS (mode
, op0
);
2728 return gen_rtx_NEG (mode
, op0
);
2731 return gen_rtx_NOT (mode
, op0
);
2735 return gen_rtx_UNSIGNED_FLOAT (mode
, op0
);
2737 return gen_rtx_FLOAT (mode
, op0
);
2739 case FIX_TRUNC_EXPR
:
2741 return gen_rtx_UNSIGNED_FIX (mode
, op0
);
2743 return gen_rtx_FIX (mode
, op0
);
2745 case POINTER_PLUS_EXPR
:
2746 /* For the rare target where pointers are not the same size as
2747 size_t, we need to check for mis-matched modes and correct
2750 && GET_MODE (op0
) != VOIDmode
&& GET_MODE (op1
) != VOIDmode
2751 && GET_MODE (op0
) != GET_MODE (op1
))
2753 if (GET_MODE_BITSIZE (GET_MODE (op0
)) < GET_MODE_BITSIZE (GET_MODE (op1
)))
2754 op1
= gen_rtx_TRUNCATE (GET_MODE (op0
), op1
);
2756 /* We always sign-extend, regardless of the signedness of
2757 the operand, because the operand is always unsigned
2758 here even if the original C expression is signed. */
2759 op1
= gen_rtx_SIGN_EXTEND (GET_MODE (op0
), op1
);
2763 return gen_rtx_PLUS (mode
, op0
, op1
);
2766 return gen_rtx_MINUS (mode
, op0
, op1
);
2769 return gen_rtx_MULT (mode
, op0
, op1
);
2772 case TRUNC_DIV_EXPR
:
2773 case EXACT_DIV_EXPR
:
2775 return gen_rtx_UDIV (mode
, op0
, op1
);
2777 return gen_rtx_DIV (mode
, op0
, op1
);
2779 case TRUNC_MOD_EXPR
:
2781 return gen_rtx_UMOD (mode
, op0
, op1
);
2783 return gen_rtx_MOD (mode
, op0
, op1
);
2785 case FLOOR_DIV_EXPR
:
2787 return gen_rtx_UDIV (mode
, op0
, op1
);
2790 rtx div
= gen_rtx_DIV (mode
, op0
, op1
);
2791 rtx mod
= gen_rtx_MOD (mode
, op0
, op1
);
2792 rtx adj
= floor_sdiv_adjust (mode
, mod
, op1
);
2793 return gen_rtx_PLUS (mode
, div
, adj
);
2796 case FLOOR_MOD_EXPR
:
2798 return gen_rtx_UMOD (mode
, op0
, op1
);
2801 rtx mod
= gen_rtx_MOD (mode
, op0
, op1
);
2802 rtx adj
= floor_sdiv_adjust (mode
, mod
, op1
);
2803 adj
= gen_rtx_NEG (mode
, gen_rtx_MULT (mode
, adj
, op1
));
2804 return gen_rtx_PLUS (mode
, mod
, adj
);
2810 rtx div
= gen_rtx_UDIV (mode
, op0
, op1
);
2811 rtx mod
= gen_rtx_UMOD (mode
, op0
, op1
);
2812 rtx adj
= ceil_udiv_adjust (mode
, mod
, op1
);
2813 return gen_rtx_PLUS (mode
, div
, adj
);
2817 rtx div
= gen_rtx_DIV (mode
, op0
, op1
);
2818 rtx mod
= gen_rtx_MOD (mode
, op0
, op1
);
2819 rtx adj
= ceil_sdiv_adjust (mode
, mod
, op1
);
2820 return gen_rtx_PLUS (mode
, div
, adj
);
2826 rtx mod
= gen_rtx_UMOD (mode
, op0
, op1
);
2827 rtx adj
= ceil_udiv_adjust (mode
, mod
, op1
);
2828 adj
= gen_rtx_NEG (mode
, gen_rtx_MULT (mode
, adj
, op1
));
2829 return gen_rtx_PLUS (mode
, mod
, adj
);
2833 rtx mod
= gen_rtx_MOD (mode
, op0
, op1
);
2834 rtx adj
= ceil_sdiv_adjust (mode
, mod
, op1
);
2835 adj
= gen_rtx_NEG (mode
, gen_rtx_MULT (mode
, adj
, op1
));
2836 return gen_rtx_PLUS (mode
, mod
, adj
);
2839 case ROUND_DIV_EXPR
:
2842 rtx div
= gen_rtx_UDIV (mode
, op0
, op1
);
2843 rtx mod
= gen_rtx_UMOD (mode
, op0
, op1
);
2844 rtx adj
= round_udiv_adjust (mode
, mod
, op1
);
2845 return gen_rtx_PLUS (mode
, div
, adj
);
2849 rtx div
= gen_rtx_DIV (mode
, op0
, op1
);
2850 rtx mod
= gen_rtx_MOD (mode
, op0
, op1
);
2851 rtx adj
= round_sdiv_adjust (mode
, mod
, op1
);
2852 return gen_rtx_PLUS (mode
, div
, adj
);
2855 case ROUND_MOD_EXPR
:
2858 rtx mod
= gen_rtx_UMOD (mode
, op0
, op1
);
2859 rtx adj
= round_udiv_adjust (mode
, mod
, op1
);
2860 adj
= gen_rtx_NEG (mode
, gen_rtx_MULT (mode
, adj
, op1
));
2861 return gen_rtx_PLUS (mode
, mod
, adj
);
2865 rtx mod
= gen_rtx_MOD (mode
, op0
, op1
);
2866 rtx adj
= round_sdiv_adjust (mode
, mod
, op1
);
2867 adj
= gen_rtx_NEG (mode
, gen_rtx_MULT (mode
, adj
, op1
));
2868 return gen_rtx_PLUS (mode
, mod
, adj
);
2872 return gen_rtx_ASHIFT (mode
, op0
, op1
);
2876 return gen_rtx_LSHIFTRT (mode
, op0
, op1
);
2878 return gen_rtx_ASHIFTRT (mode
, op0
, op1
);
2881 return gen_rtx_ROTATE (mode
, op0
, op1
);
2884 return gen_rtx_ROTATERT (mode
, op0
, op1
);
2888 return gen_rtx_UMIN (mode
, op0
, op1
);
2890 return gen_rtx_SMIN (mode
, op0
, op1
);
2894 return gen_rtx_UMAX (mode
, op0
, op1
);
2896 return gen_rtx_SMAX (mode
, op0
, op1
);
2899 case TRUTH_AND_EXPR
:
2900 return gen_rtx_AND (mode
, op0
, op1
);
2904 return gen_rtx_IOR (mode
, op0
, op1
);
2907 case TRUTH_XOR_EXPR
:
2908 return gen_rtx_XOR (mode
, op0
, op1
);
2910 case TRUTH_ANDIF_EXPR
:
2911 return gen_rtx_IF_THEN_ELSE (mode
, op0
, op1
, const0_rtx
);
2913 case TRUTH_ORIF_EXPR
:
2914 return gen_rtx_IF_THEN_ELSE (mode
, op0
, const_true_rtx
, op1
);
2916 case TRUTH_NOT_EXPR
:
2917 return gen_rtx_EQ (mode
, op0
, const0_rtx
);
2921 return gen_rtx_LTU (mode
, op0
, op1
);
2923 return gen_rtx_LT (mode
, op0
, op1
);
2927 return gen_rtx_LEU (mode
, op0
, op1
);
2929 return gen_rtx_LE (mode
, op0
, op1
);
2933 return gen_rtx_GTU (mode
, op0
, op1
);
2935 return gen_rtx_GT (mode
, op0
, op1
);
2939 return gen_rtx_GEU (mode
, op0
, op1
);
2941 return gen_rtx_GE (mode
, op0
, op1
);
2944 return gen_rtx_EQ (mode
, op0
, op1
);
2947 return gen_rtx_NE (mode
, op0
, op1
);
2949 case UNORDERED_EXPR
:
2950 return gen_rtx_UNORDERED (mode
, op0
, op1
);
2953 return gen_rtx_ORDERED (mode
, op0
, op1
);
2956 return gen_rtx_UNLT (mode
, op0
, op1
);
2959 return gen_rtx_UNLE (mode
, op0
, op1
);
2962 return gen_rtx_UNGT (mode
, op0
, op1
);
2965 return gen_rtx_UNGE (mode
, op0
, op1
);
2968 return gen_rtx_UNEQ (mode
, op0
, op1
);
2971 return gen_rtx_LTGT (mode
, op0
, op1
);
2974 return gen_rtx_IF_THEN_ELSE (mode
, op0
, op1
, op2
);
2977 gcc_assert (COMPLEX_MODE_P (mode
));
2978 if (GET_MODE (op0
) == VOIDmode
)
2979 op0
= gen_rtx_CONST (GET_MODE_INNER (mode
), op0
);
2980 if (GET_MODE (op1
) == VOIDmode
)
2981 op1
= gen_rtx_CONST (GET_MODE_INNER (mode
), op1
);
2982 return gen_rtx_CONCAT (mode
, op0
, op1
);
2985 if (GET_CODE (op0
) == CONCAT
)
2986 return gen_rtx_CONCAT (mode
, XEXP (op0
, 0),
2987 gen_rtx_NEG (GET_MODE_INNER (mode
),
2991 enum machine_mode imode
= GET_MODE_INNER (mode
);
2996 re
= adjust_address_nv (op0
, imode
, 0);
2997 im
= adjust_address_nv (op0
, imode
, GET_MODE_SIZE (imode
));
3001 enum machine_mode ifmode
= int_mode_for_mode (mode
);
3002 enum machine_mode ihmode
= int_mode_for_mode (imode
);
3004 if (ifmode
== BLKmode
|| ihmode
== BLKmode
)
3006 halfsize
= GEN_INT (GET_MODE_BITSIZE (ihmode
));
3009 re
= gen_rtx_SUBREG (ifmode
, re
, 0);
3010 re
= gen_rtx_ZERO_EXTRACT (ihmode
, re
, halfsize
, const0_rtx
);
3011 if (imode
!= ihmode
)
3012 re
= gen_rtx_SUBREG (imode
, re
, 0);
3013 im
= copy_rtx (op0
);
3015 im
= gen_rtx_SUBREG (ifmode
, im
, 0);
3016 im
= gen_rtx_ZERO_EXTRACT (ihmode
, im
, halfsize
, halfsize
);
3017 if (imode
!= ihmode
)
3018 im
= gen_rtx_SUBREG (imode
, im
, 0);
3020 im
= gen_rtx_NEG (imode
, im
);
3021 return gen_rtx_CONCAT (mode
, re
, im
);
3025 op0
= expand_debug_expr (TREE_OPERAND (exp
, 0));
3026 if (!op0
|| !MEM_P (op0
))
3028 if ((TREE_CODE (TREE_OPERAND (exp
, 0)) == VAR_DECL
3029 || TREE_CODE (TREE_OPERAND (exp
, 0)) == PARM_DECL
3030 || TREE_CODE (TREE_OPERAND (exp
, 0)) == RESULT_DECL
)
3031 && !TREE_ADDRESSABLE (TREE_OPERAND (exp
, 0)))
3032 return gen_rtx_DEBUG_IMPLICIT_PTR (mode
, TREE_OPERAND (exp
, 0));
3034 if (handled_component_p (TREE_OPERAND (exp
, 0)))
3036 HOST_WIDE_INT bitoffset
, bitsize
, maxsize
;
3038 = get_ref_base_and_extent (TREE_OPERAND (exp
, 0),
3039 &bitoffset
, &bitsize
, &maxsize
);
3040 if ((TREE_CODE (decl
) == VAR_DECL
3041 || TREE_CODE (decl
) == PARM_DECL
3042 || TREE_CODE (decl
) == RESULT_DECL
)
3043 && !TREE_ADDRESSABLE (decl
)
3044 && (bitoffset
% BITS_PER_UNIT
) == 0
3046 && bitsize
== maxsize
)
3047 return plus_constant (gen_rtx_DEBUG_IMPLICIT_PTR (mode
, decl
),
3048 bitoffset
/ BITS_PER_UNIT
);
3054 op0
= convert_debug_memory_address (mode
, XEXP (op0
, 0));
3059 exp
= build_constructor_from_list (TREE_TYPE (exp
),
3060 TREE_VECTOR_CST_ELTS (exp
));
3064 if (TREE_CODE (TREE_TYPE (exp
)) == VECTOR_TYPE
)
3069 op0
= gen_rtx_CONCATN
3070 (mode
, rtvec_alloc (TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp
))));
3072 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp
), i
, val
)
3074 op1
= expand_debug_expr (val
);
3077 XVECEXP (op0
, 0, i
) = op1
;
3080 if (i
< TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp
)))
3082 op1
= expand_debug_expr
3083 (build_zero_cst (TREE_TYPE (TREE_TYPE (exp
))));
3088 for (; i
< TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp
)); i
++)
3089 XVECEXP (op0
, 0, i
) = op1
;
3095 goto flag_unsupported
;
3098 /* ??? Maybe handle some builtins? */
3103 gimple g
= get_gimple_for_ssa_name (exp
);
3106 op0
= expand_debug_expr (gimple_assign_rhs_to_tree (g
));
3112 int part
= var_to_partition (SA
.map
, exp
);
3114 if (part
== NO_PARTITION
)
3117 gcc_assert (part
>= 0 && (unsigned)part
< SA
.map
->num_partitions
);
3119 op0
= SA
.partition_to_pseudo
[part
];
3127 /* Vector stuff. For most of the codes we don't have rtl codes. */
3128 case REALIGN_LOAD_EXPR
:
3129 case REDUC_MAX_EXPR
:
3130 case REDUC_MIN_EXPR
:
3131 case REDUC_PLUS_EXPR
:
3133 case VEC_EXTRACT_EVEN_EXPR
:
3134 case VEC_EXTRACT_ODD_EXPR
:
3135 case VEC_INTERLEAVE_HIGH_EXPR
:
3136 case VEC_INTERLEAVE_LOW_EXPR
:
3137 case VEC_LSHIFT_EXPR
:
3138 case VEC_PACK_FIX_TRUNC_EXPR
:
3139 case VEC_PACK_SAT_EXPR
:
3140 case VEC_PACK_TRUNC_EXPR
:
3141 case VEC_RSHIFT_EXPR
:
3142 case VEC_UNPACK_FLOAT_HI_EXPR
:
3143 case VEC_UNPACK_FLOAT_LO_EXPR
:
3144 case VEC_UNPACK_HI_EXPR
:
3145 case VEC_UNPACK_LO_EXPR
:
3146 case VEC_WIDEN_MULT_HI_EXPR
:
3147 case VEC_WIDEN_MULT_LO_EXPR
:
3151 case ADDR_SPACE_CONVERT_EXPR
:
3152 case FIXED_CONVERT_EXPR
:
3154 case WITH_SIZE_EXPR
:
3158 if (SCALAR_INT_MODE_P (GET_MODE (op0
))
3159 && SCALAR_INT_MODE_P (mode
))
3161 if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))))
3162 op0
= gen_rtx_ZERO_EXTEND (mode
, op0
);
3164 op0
= gen_rtx_SIGN_EXTEND (mode
, op0
);
3165 if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 1))))
3166 op1
= gen_rtx_ZERO_EXTEND (mode
, op1
);
3168 op1
= gen_rtx_SIGN_EXTEND (mode
, op1
);
3169 op0
= gen_rtx_MULT (mode
, op0
, op1
);
3170 return gen_rtx_PLUS (mode
, op0
, op2
);
3174 case WIDEN_MULT_EXPR
:
3175 case WIDEN_MULT_PLUS_EXPR
:
3176 case WIDEN_MULT_MINUS_EXPR
:
3177 if (SCALAR_INT_MODE_P (GET_MODE (op0
))
3178 && SCALAR_INT_MODE_P (mode
))
3180 enum machine_mode inner_mode
= GET_MODE (op0
);
3181 if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))))
3182 op0
= simplify_gen_unary (ZERO_EXTEND
, mode
, op0
, inner_mode
);
3184 op0
= simplify_gen_unary (SIGN_EXTEND
, mode
, op0
, inner_mode
);
3185 if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 1))))
3186 op1
= simplify_gen_unary (ZERO_EXTEND
, mode
, op1
, inner_mode
);
3188 op1
= simplify_gen_unary (SIGN_EXTEND
, mode
, op1
, inner_mode
);
3189 op0
= gen_rtx_MULT (mode
, op0
, op1
);
3190 if (TREE_CODE (exp
) == WIDEN_MULT_EXPR
)
3192 else if (TREE_CODE (exp
) == WIDEN_MULT_PLUS_EXPR
)
3193 return gen_rtx_PLUS (mode
, op0
, op2
);
3195 return gen_rtx_MINUS (mode
, op2
, op0
);
3199 case WIDEN_SUM_EXPR
:
3200 if (SCALAR_INT_MODE_P (GET_MODE (op0
))
3201 && SCALAR_INT_MODE_P (mode
))
3203 if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))))
3204 op0
= gen_rtx_ZERO_EXTEND (mode
, op0
);
3206 op0
= gen_rtx_SIGN_EXTEND (mode
, op0
);
3207 return gen_rtx_PLUS (mode
, op0
, op1
);
3212 return gen_rtx_FMA (mode
, op0
, op1
, op2
);
3216 #ifdef ENABLE_CHECKING
3225 /* Expand the _LOCs in debug insns. We run this after expanding all
3226 regular insns, so that any variables referenced in the function
3227 will have their DECL_RTLs set. */
3230 expand_debug_locations (void)
3233 rtx last
= get_last_insn ();
3234 int save_strict_alias
= flag_strict_aliasing
;
3236 /* New alias sets while setting up memory attributes cause
3237 -fcompare-debug failures, even though it doesn't bring about any
3239 flag_strict_aliasing
= 0;
3241 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3242 if (DEBUG_INSN_P (insn
))
3244 tree value
= (tree
)INSN_VAR_LOCATION_LOC (insn
);
3246 enum machine_mode mode
;
3248 if (value
== NULL_TREE
)
3252 val
= expand_debug_expr (value
);
3253 gcc_assert (last
== get_last_insn ());
3257 val
= gen_rtx_UNKNOWN_VAR_LOC ();
3260 mode
= GET_MODE (INSN_VAR_LOCATION (insn
));
3262 gcc_assert (mode
== GET_MODE (val
)
3263 || (GET_MODE (val
) == VOIDmode
3264 && (CONST_INT_P (val
)
3265 || GET_CODE (val
) == CONST_FIXED
3266 || GET_CODE (val
) == CONST_DOUBLE
3267 || GET_CODE (val
) == LABEL_REF
)));
3270 INSN_VAR_LOCATION_LOC (insn
) = val
;
3273 flag_strict_aliasing
= save_strict_alias
;
3276 /* Expand basic block BB from GIMPLE trees to RTL. */
3279 expand_gimple_basic_block (basic_block bb
)
3281 gimple_stmt_iterator gsi
;
3290 fprintf (dump_file
, "\n;; Generating RTL for gimple basic block %d\n",
3293 /* Note that since we are now transitioning from GIMPLE to RTL, we
3294 cannot use the gsi_*_bb() routines because they expect the basic
3295 block to be in GIMPLE, instead of RTL. Therefore, we need to
3296 access the BB sequence directly. */
3297 stmts
= bb_seq (bb
);
3298 bb
->il
.gimple
= NULL
;
3299 rtl_profile_for_bb (bb
);
3300 init_rtl_bb_info (bb
);
3301 bb
->flags
|= BB_RTL
;
3303 /* Remove the RETURN_EXPR if we may fall though to the exit
3305 gsi
= gsi_last (stmts
);
3306 if (!gsi_end_p (gsi
)
3307 && gimple_code (gsi_stmt (gsi
)) == GIMPLE_RETURN
)
3309 gimple ret_stmt
= gsi_stmt (gsi
);
3311 gcc_assert (single_succ_p (bb
));
3312 gcc_assert (single_succ (bb
) == EXIT_BLOCK_PTR
);
3314 if (bb
->next_bb
== EXIT_BLOCK_PTR
3315 && !gimple_return_retval (ret_stmt
))
3317 gsi_remove (&gsi
, false);
3318 single_succ_edge (bb
)->flags
|= EDGE_FALLTHRU
;
3322 gsi
= gsi_start (stmts
);
3323 if (!gsi_end_p (gsi
))
3325 stmt
= gsi_stmt (gsi
);
3326 if (gimple_code (stmt
) != GIMPLE_LABEL
)
3330 elt
= pointer_map_contains (lab_rtx_for_bb
, bb
);
3334 last
= get_last_insn ();
3338 expand_gimple_stmt (stmt
);
3343 emit_label ((rtx
) *elt
);
3345 /* Java emits line number notes in the top of labels.
3346 ??? Make this go away once line number notes are obsoleted. */
3347 BB_HEAD (bb
) = NEXT_INSN (last
);
3348 if (NOTE_P (BB_HEAD (bb
)))
3349 BB_HEAD (bb
) = NEXT_INSN (BB_HEAD (bb
));
3350 note
= emit_note_after (NOTE_INSN_BASIC_BLOCK
, BB_HEAD (bb
));
3352 maybe_dump_rtl_for_gimple_stmt (stmt
, last
);
3355 note
= BB_HEAD (bb
) = emit_note (NOTE_INSN_BASIC_BLOCK
);
3357 NOTE_BASIC_BLOCK (note
) = bb
;
3359 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
3363 stmt
= gsi_stmt (gsi
);
3365 /* If this statement is a non-debug one, and we generate debug
3366 insns, then this one might be the last real use of a TERed
3367 SSA_NAME, but where there are still some debug uses further
3368 down. Expanding the current SSA name in such further debug
3369 uses by their RHS might lead to wrong debug info, as coalescing
3370 might make the operands of such RHS be placed into the same
3371 pseudo as something else. Like so:
3372 a_1 = a_0 + 1; // Assume a_1 is TERed and a_0 is dead
3376 As a_0 and a_2 don't overlap in lifetime, assume they are coalesced.
3377 If we now would expand a_1 by it's RHS (a_0 + 1) in the debug use,
3378 the write to a_2 would actually have clobbered the place which
3381 So, instead of that, we recognize the situation, and generate
3382 debug temporaries at the last real use of TERed SSA names:
3389 if (MAY_HAVE_DEBUG_INSNS
3391 && !is_gimple_debug (stmt
))
3397 location_t sloc
= get_curr_insn_source_location ();
3398 tree sblock
= get_curr_insn_block ();
3400 /* Look for SSA names that have their last use here (TERed
3401 names always have only one real use). */
3402 FOR_EACH_SSA_TREE_OPERAND (op
, stmt
, iter
, SSA_OP_USE
)
3403 if ((def
= get_gimple_for_ssa_name (op
)))
3405 imm_use_iterator imm_iter
;
3406 use_operand_p use_p
;
3407 bool have_debug_uses
= false;
3409 FOR_EACH_IMM_USE_FAST (use_p
, imm_iter
, op
)
3411 if (gimple_debug_bind_p (USE_STMT (use_p
)))
3413 have_debug_uses
= true;
3418 if (have_debug_uses
)
3420 /* OP is a TERed SSA name, with DEF it's defining
3421 statement, and where OP is used in further debug
3422 instructions. Generate a debug temporary, and
3423 replace all uses of OP in debug insns with that
3426 tree value
= gimple_assign_rhs_to_tree (def
);
3427 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
3429 enum machine_mode mode
;
3431 set_curr_insn_source_location (gimple_location (def
));
3432 set_curr_insn_block (gimple_block (def
));
3434 DECL_ARTIFICIAL (vexpr
) = 1;
3435 TREE_TYPE (vexpr
) = TREE_TYPE (value
);
3437 mode
= DECL_MODE (value
);
3439 mode
= TYPE_MODE (TREE_TYPE (value
));
3440 DECL_MODE (vexpr
) = mode
;
3442 val
= gen_rtx_VAR_LOCATION
3443 (mode
, vexpr
, (rtx
)value
, VAR_INIT_STATUS_INITIALIZED
);
3445 val
= emit_debug_insn (val
);
3447 FOR_EACH_IMM_USE_STMT (debugstmt
, imm_iter
, op
)
3449 if (!gimple_debug_bind_p (debugstmt
))
3452 FOR_EACH_IMM_USE_ON_STMT (use_p
, imm_iter
)
3453 SET_USE (use_p
, vexpr
);
3455 update_stmt (debugstmt
);
3459 set_curr_insn_source_location (sloc
);
3460 set_curr_insn_block (sblock
);
3463 currently_expanding_gimple_stmt
= stmt
;
3465 /* Expand this statement, then evaluate the resulting RTL and
3466 fixup the CFG accordingly. */
3467 if (gimple_code (stmt
) == GIMPLE_COND
)
3469 new_bb
= expand_gimple_cond (bb
, stmt
);
3473 else if (gimple_debug_bind_p (stmt
))
3475 location_t sloc
= get_curr_insn_source_location ();
3476 tree sblock
= get_curr_insn_block ();
3477 gimple_stmt_iterator nsi
= gsi
;
3481 tree var
= gimple_debug_bind_get_var (stmt
);
3484 enum machine_mode mode
;
3486 if (gimple_debug_bind_has_value_p (stmt
))
3487 value
= gimple_debug_bind_get_value (stmt
);
3491 last
= get_last_insn ();
3493 set_curr_insn_source_location (gimple_location (stmt
));
3494 set_curr_insn_block (gimple_block (stmt
));
3497 mode
= DECL_MODE (var
);
3499 mode
= TYPE_MODE (TREE_TYPE (var
));
3501 val
= gen_rtx_VAR_LOCATION
3502 (mode
, var
, (rtx
)value
, VAR_INIT_STATUS_INITIALIZED
);
3504 val
= emit_debug_insn (val
);
3506 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
3508 /* We can't dump the insn with a TREE where an RTX
3510 INSN_VAR_LOCATION_LOC (val
) = const0_rtx
;
3511 maybe_dump_rtl_for_gimple_stmt (stmt
, last
);
3512 INSN_VAR_LOCATION_LOC (val
) = (rtx
)value
;
3515 /* In order not to generate too many debug temporaries,
3516 we delink all uses of debug statements we already expanded.
3517 Therefore debug statements between definition and real
3518 use of TERed SSA names will continue to use the SSA name,
3519 and not be replaced with debug temps. */
3520 delink_stmt_imm_use (stmt
);
3524 if (gsi_end_p (nsi
))
3526 stmt
= gsi_stmt (nsi
);
3527 if (!gimple_debug_bind_p (stmt
))
3531 set_curr_insn_source_location (sloc
);
3532 set_curr_insn_block (sblock
);
3536 if (is_gimple_call (stmt
) && gimple_call_tail_p (stmt
))
3539 new_bb
= expand_gimple_tailcall (bb
, stmt
, &can_fallthru
);
3550 def_operand_p def_p
;
3551 def_p
= SINGLE_SSA_DEF_OPERAND (stmt
, SSA_OP_DEF
);
3555 /* Ignore this stmt if it is in the list of
3556 replaceable expressions. */
3558 && bitmap_bit_p (SA
.values
,
3559 SSA_NAME_VERSION (DEF_FROM_PTR (def_p
))))
3562 last
= expand_gimple_stmt (stmt
);
3563 maybe_dump_rtl_for_gimple_stmt (stmt
, last
);
3568 currently_expanding_gimple_stmt
= NULL
;
3570 /* Expand implicit goto and convert goto_locus. */
3571 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
3573 if (e
->goto_locus
&& e
->goto_block
)
3575 set_curr_insn_source_location (e
->goto_locus
);
3576 set_curr_insn_block (e
->goto_block
);
3577 e
->goto_locus
= curr_insn_locator ();
3579 e
->goto_block
= NULL
;
3580 if ((e
->flags
& EDGE_FALLTHRU
) && e
->dest
!= bb
->next_bb
)
3582 emit_jump (label_rtx_for_bb (e
->dest
));
3583 e
->flags
&= ~EDGE_FALLTHRU
;
3587 /* Expanded RTL can create a jump in the last instruction of block.
3588 This later might be assumed to be a jump to successor and break edge insertion.
3589 We need to insert dummy move to prevent this. PR41440. */
3590 if (single_succ_p (bb
)
3591 && (single_succ_edge (bb
)->flags
& EDGE_FALLTHRU
)
3592 && (last
= get_last_insn ())
3595 rtx dummy
= gen_reg_rtx (SImode
);
3596 emit_insn_after_noloc (gen_move_insn (dummy
, dummy
), last
, NULL
);
3599 do_pending_stack_adjust ();
3601 /* Find the block tail. The last insn in the block is the insn
3602 before a barrier and/or table jump insn. */
3603 last
= get_last_insn ();
3604 if (BARRIER_P (last
))
3605 last
= PREV_INSN (last
);
3606 if (JUMP_TABLE_DATA_P (last
))
3607 last
= PREV_INSN (PREV_INSN (last
));
3610 update_bb_for_insn (bb
);
3616 /* Create a basic block for initialization code. */
3619 construct_init_block (void)
3621 basic_block init_block
, first_block
;
3625 /* Multiple entry points not supported yet. */
3626 gcc_assert (EDGE_COUNT (ENTRY_BLOCK_PTR
->succs
) == 1);
3627 init_rtl_bb_info (ENTRY_BLOCK_PTR
);
3628 init_rtl_bb_info (EXIT_BLOCK_PTR
);
3629 ENTRY_BLOCK_PTR
->flags
|= BB_RTL
;
3630 EXIT_BLOCK_PTR
->flags
|= BB_RTL
;
3632 e
= EDGE_SUCC (ENTRY_BLOCK_PTR
, 0);
3634 /* When entry edge points to first basic block, we don't need jump,
3635 otherwise we have to jump into proper target. */
3636 if (e
&& e
->dest
!= ENTRY_BLOCK_PTR
->next_bb
)
3638 tree label
= gimple_block_label (e
->dest
);
3640 emit_jump (label_rtx (label
));
3644 flags
= EDGE_FALLTHRU
;
3646 init_block
= create_basic_block (NEXT_INSN (get_insns ()),
3649 init_block
->frequency
= ENTRY_BLOCK_PTR
->frequency
;
3650 init_block
->count
= ENTRY_BLOCK_PTR
->count
;
3653 first_block
= e
->dest
;
3654 redirect_edge_succ (e
, init_block
);
3655 e
= make_edge (init_block
, first_block
, flags
);
3658 e
= make_edge (init_block
, EXIT_BLOCK_PTR
, EDGE_FALLTHRU
);
3659 e
->probability
= REG_BR_PROB_BASE
;
3660 e
->count
= ENTRY_BLOCK_PTR
->count
;
3662 update_bb_for_insn (init_block
);
3666 /* For each lexical block, set BLOCK_NUMBER to the depth at which it is
3667 found in the block tree. */
3670 set_block_levels (tree block
, int level
)
3674 BLOCK_NUMBER (block
) = level
;
3675 set_block_levels (BLOCK_SUBBLOCKS (block
), level
+ 1);
3676 block
= BLOCK_CHAIN (block
);
3680 /* Create a block containing landing pads and similar stuff. */
3683 construct_exit_block (void)
3685 rtx head
= get_last_insn ();
3687 basic_block exit_block
;
3691 rtx orig_end
= BB_END (EXIT_BLOCK_PTR
->prev_bb
);
3693 rtl_profile_for_bb (EXIT_BLOCK_PTR
);
3695 /* Make sure the locus is set to the end of the function, so that
3696 epilogue line numbers and warnings are set properly. */
3697 if (cfun
->function_end_locus
!= UNKNOWN_LOCATION
)
3698 input_location
= cfun
->function_end_locus
;
3700 /* The following insns belong to the top scope. */
3701 set_curr_insn_block (DECL_INITIAL (current_function_decl
));
3703 /* Generate rtl for function exit. */
3704 expand_function_end ();
3706 end
= get_last_insn ();
3709 /* While emitting the function end we could move end of the last basic block.
3711 BB_END (EXIT_BLOCK_PTR
->prev_bb
) = orig_end
;
3712 while (NEXT_INSN (head
) && NOTE_P (NEXT_INSN (head
)))
3713 head
= NEXT_INSN (head
);
3714 exit_block
= create_basic_block (NEXT_INSN (head
), end
,
3715 EXIT_BLOCK_PTR
->prev_bb
);
3716 exit_block
->frequency
= EXIT_BLOCK_PTR
->frequency
;
3717 exit_block
->count
= EXIT_BLOCK_PTR
->count
;
3720 while (ix
< EDGE_COUNT (EXIT_BLOCK_PTR
->preds
))
3722 e
= EDGE_PRED (EXIT_BLOCK_PTR
, ix
);
3723 if (!(e
->flags
& EDGE_ABNORMAL
))
3724 redirect_edge_succ (e
, exit_block
);
3729 e
= make_edge (exit_block
, EXIT_BLOCK_PTR
, EDGE_FALLTHRU
);
3730 e
->probability
= REG_BR_PROB_BASE
;
3731 e
->count
= EXIT_BLOCK_PTR
->count
;
3732 FOR_EACH_EDGE (e2
, ei
, EXIT_BLOCK_PTR
->preds
)
3735 e
->count
-= e2
->count
;
3736 exit_block
->count
-= e2
->count
;
3737 exit_block
->frequency
-= EDGE_FREQUENCY (e2
);
3741 if (exit_block
->count
< 0)
3742 exit_block
->count
= 0;
3743 if (exit_block
->frequency
< 0)
3744 exit_block
->frequency
= 0;
3745 update_bb_for_insn (exit_block
);
3748 /* Helper function for discover_nonconstant_array_refs.
3749 Look for ARRAY_REF nodes with non-constant indexes and mark them
3753 discover_nonconstant_array_refs_r (tree
* tp
, int *walk_subtrees
,
3754 void *data ATTRIBUTE_UNUSED
)
3758 if (IS_TYPE_OR_DECL_P (t
))
3760 else if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
3762 while (((TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
3763 && is_gimple_min_invariant (TREE_OPERAND (t
, 1))
3764 && (!TREE_OPERAND (t
, 2)
3765 || is_gimple_min_invariant (TREE_OPERAND (t
, 2))))
3766 || (TREE_CODE (t
) == COMPONENT_REF
3767 && (!TREE_OPERAND (t
,2)
3768 || is_gimple_min_invariant (TREE_OPERAND (t
, 2))))
3769 || TREE_CODE (t
) == BIT_FIELD_REF
3770 || TREE_CODE (t
) == REALPART_EXPR
3771 || TREE_CODE (t
) == IMAGPART_EXPR
3772 || TREE_CODE (t
) == VIEW_CONVERT_EXPR
3773 || CONVERT_EXPR_P (t
))
3774 t
= TREE_OPERAND (t
, 0);
3776 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
3778 t
= get_base_address (t
);
3780 && DECL_MODE (t
) != BLKmode
)
3781 TREE_ADDRESSABLE (t
) = 1;
3790 /* RTL expansion is not able to compile array references with variable
3791 offsets for arrays stored in single register. Discover such
3792 expressions and mark variables as addressable to avoid this
3796 discover_nonconstant_array_refs (void)
3799 gimple_stmt_iterator gsi
;
3802 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3804 gimple stmt
= gsi_stmt (gsi
);
3805 if (!is_gimple_debug (stmt
))
3806 walk_gimple_op (stmt
, discover_nonconstant_array_refs_r
, NULL
);
3810 /* This function sets crtl->args.internal_arg_pointer to a virtual
3811 register if DRAP is needed. Local register allocator will replace
3812 virtual_incoming_args_rtx with the virtual register. */
3815 expand_stack_alignment (void)
3818 unsigned int preferred_stack_boundary
;
3820 if (! SUPPORTS_STACK_ALIGNMENT
)
3823 if (cfun
->calls_alloca
3824 || cfun
->has_nonlocal_label
3825 || crtl
->has_nonlocal_goto
)
3826 crtl
->need_drap
= true;
3828 /* Call update_stack_boundary here again to update incoming stack
3829 boundary. It may set incoming stack alignment to a different
3830 value after RTL expansion. TARGET_FUNCTION_OK_FOR_SIBCALL may
3831 use the minimum incoming stack alignment to check if it is OK
3832 to perform sibcall optimization since sibcall optimization will
3833 only align the outgoing stack to incoming stack boundary. */
3834 if (targetm
.calls
.update_stack_boundary
)
3835 targetm
.calls
.update_stack_boundary ();
3837 /* The incoming stack frame has to be aligned at least at
3838 parm_stack_boundary. */
3839 gcc_assert (crtl
->parm_stack_boundary
<= INCOMING_STACK_BOUNDARY
);
3841 /* Update crtl->stack_alignment_estimated and use it later to align
3842 stack. We check PREFERRED_STACK_BOUNDARY if there may be non-call
3843 exceptions since callgraph doesn't collect incoming stack alignment
3845 if (cfun
->can_throw_non_call_exceptions
3846 && PREFERRED_STACK_BOUNDARY
> crtl
->preferred_stack_boundary
)
3847 preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
3849 preferred_stack_boundary
= crtl
->preferred_stack_boundary
;
3850 if (preferred_stack_boundary
> crtl
->stack_alignment_estimated
)
3851 crtl
->stack_alignment_estimated
= preferred_stack_boundary
;
3852 if (preferred_stack_boundary
> crtl
->stack_alignment_needed
)
3853 crtl
->stack_alignment_needed
= preferred_stack_boundary
;
3855 gcc_assert (crtl
->stack_alignment_needed
3856 <= crtl
->stack_alignment_estimated
);
3858 crtl
->stack_realign_needed
3859 = INCOMING_STACK_BOUNDARY
< crtl
->stack_alignment_estimated
;
3860 crtl
->stack_realign_tried
= crtl
->stack_realign_needed
;
3862 crtl
->stack_realign_processed
= true;
3864 /* Target has to redefine TARGET_GET_DRAP_RTX to support stack
3866 gcc_assert (targetm
.calls
.get_drap_rtx
!= NULL
);
3867 drap_rtx
= targetm
.calls
.get_drap_rtx ();
3869 /* stack_realign_drap and drap_rtx must match. */
3870 gcc_assert ((stack_realign_drap
!= 0) == (drap_rtx
!= NULL
));
3872 /* Do nothing if NULL is returned, which means DRAP is not needed. */
3873 if (NULL
!= drap_rtx
)
3875 crtl
->args
.internal_arg_pointer
= drap_rtx
;
3877 /* Call fixup_tail_calls to clean up REG_EQUIV note if DRAP is
3879 fixup_tail_calls ();
3883 /* Translate the intermediate representation contained in the CFG
3884 from GIMPLE trees to RTL.
3886 We do conversion per basic block and preserve/update the tree CFG.
3887 This implies we have to do some magic as the CFG can simultaneously
3888 consist of basic blocks containing RTL and GIMPLE trees. This can
3889 confuse the CFG hooks, so be careful to not manipulate CFG during
3893 gimple_expand_cfg (void)
3895 basic_block bb
, init_block
;
3902 timevar_push (TV_OUT_OF_SSA
);
3903 rewrite_out_of_ssa (&SA
);
3904 timevar_pop (TV_OUT_OF_SSA
);
3905 SA
.partition_to_pseudo
= (rtx
*)xcalloc (SA
.map
->num_partitions
,
3908 /* Some backends want to know that we are expanding to RTL. */
3909 currently_expanding_to_rtl
= 1;
3911 rtl_profile_for_bb (ENTRY_BLOCK_PTR
);
3913 insn_locators_alloc ();
3914 if (!DECL_IS_BUILTIN (current_function_decl
))
3916 /* Eventually, all FEs should explicitly set function_start_locus. */
3917 if (cfun
->function_start_locus
== UNKNOWN_LOCATION
)
3918 set_curr_insn_source_location
3919 (DECL_SOURCE_LOCATION (current_function_decl
));
3921 set_curr_insn_source_location (cfun
->function_start_locus
);
3923 set_curr_insn_block (DECL_INITIAL (current_function_decl
));
3924 prologue_locator
= curr_insn_locator ();
3926 #ifdef INSN_SCHEDULING
3927 init_sched_attrs ();
3930 /* Make sure first insn is a note even if we don't want linenums.
3931 This makes sure the first insn will never be deleted.
3932 Also, final expects a note to appear there. */
3933 emit_note (NOTE_INSN_DELETED
);
3935 /* Mark arrays indexed with non-constant indices with TREE_ADDRESSABLE. */
3936 discover_nonconstant_array_refs ();
3938 targetm
.expand_to_rtl_hook ();
3939 crtl
->stack_alignment_needed
= STACK_BOUNDARY
;
3940 crtl
->max_used_stack_slot_alignment
= STACK_BOUNDARY
;
3941 crtl
->stack_alignment_estimated
= 0;
3942 crtl
->preferred_stack_boundary
= STACK_BOUNDARY
;
3943 cfun
->cfg
->max_jumptable_ents
= 0;
3945 /* Expand the variables recorded during gimple lowering. */
3946 timevar_push (TV_VAR_EXPAND
);
3949 expand_used_vars ();
3951 var_seq
= get_insns ();
3953 timevar_pop (TV_VAR_EXPAND
);
3955 /* Honor stack protection warnings. */
3956 if (warn_stack_protect
)
3958 if (cfun
->calls_alloca
)
3959 warning (OPT_Wstack_protector
,
3960 "stack protector not protecting local variables: "
3961 "variable length buffer");
3962 if (has_short_buffer
&& !crtl
->stack_protect_guard
)
3963 warning (OPT_Wstack_protector
,
3964 "stack protector not protecting function: "
3965 "all local arrays are less than %d bytes long",
3966 (int) PARAM_VALUE (PARAM_SSP_BUFFER_SIZE
));
3969 /* Set up parameters and prepare for return, for the function. */
3970 expand_function_start (current_function_decl
);
3972 /* If we emitted any instructions for setting up the variables,
3973 emit them before the FUNCTION_START note. */
3976 emit_insn_before (var_seq
, parm_birth_insn
);
3978 /* In expand_function_end we'll insert the alloca save/restore
3979 before parm_birth_insn. We've just insertted an alloca call.
3980 Adjust the pointer to match. */
3981 parm_birth_insn
= var_seq
;
3984 /* Now that we also have the parameter RTXs, copy them over to our
3986 for (i
= 0; i
< SA
.map
->num_partitions
; i
++)
3988 tree var
= SSA_NAME_VAR (partition_to_var (SA
.map
, i
));
3990 if (TREE_CODE (var
) != VAR_DECL
3991 && !SA
.partition_to_pseudo
[i
])
3992 SA
.partition_to_pseudo
[i
] = DECL_RTL_IF_SET (var
);
3993 gcc_assert (SA
.partition_to_pseudo
[i
]);
3995 /* If this decl was marked as living in multiple places, reset
3996 this now to NULL. */
3997 if (DECL_RTL_IF_SET (var
) == pc_rtx
)
3998 SET_DECL_RTL (var
, NULL
);
4000 /* Some RTL parts really want to look at DECL_RTL(x) when x
4001 was a decl marked in REG_ATTR or MEM_ATTR. We could use
4002 SET_DECL_RTL here making this available, but that would mean
4003 to select one of the potentially many RTLs for one DECL. Instead
4004 of doing that we simply reset the MEM_EXPR of the RTL in question,
4005 then nobody can get at it and hence nobody can call DECL_RTL on it. */
4006 if (!DECL_RTL_SET_P (var
))
4008 if (MEM_P (SA
.partition_to_pseudo
[i
]))
4009 set_mem_expr (SA
.partition_to_pseudo
[i
], NULL
);
4013 /* If this function is `main', emit a call to `__main'
4014 to run global initializers, etc. */
4015 if (DECL_NAME (current_function_decl
)
4016 && MAIN_NAME_P (DECL_NAME (current_function_decl
))
4017 && DECL_FILE_SCOPE_P (current_function_decl
))
4018 expand_main_function ();
4020 /* Initialize the stack_protect_guard field. This must happen after the
4021 call to __main (if any) so that the external decl is initialized. */
4022 if (crtl
->stack_protect_guard
)
4023 stack_protect_prologue ();
4025 expand_phi_nodes (&SA
);
4027 /* Register rtl specific functions for cfg. */
4028 rtl_register_cfg_hooks ();
4030 init_block
= construct_init_block ();
4032 /* Clear EDGE_EXECUTABLE on the entry edge(s). It is cleaned from the
4033 remaining edges later. */
4034 FOR_EACH_EDGE (e
, ei
, ENTRY_BLOCK_PTR
->succs
)
4035 e
->flags
&= ~EDGE_EXECUTABLE
;
4037 lab_rtx_for_bb
= pointer_map_create ();
4038 FOR_BB_BETWEEN (bb
, init_block
->next_bb
, EXIT_BLOCK_PTR
, next_bb
)
4039 bb
= expand_gimple_basic_block (bb
);
4041 if (MAY_HAVE_DEBUG_INSNS
)
4042 expand_debug_locations ();
4044 execute_free_datastructures ();
4045 timevar_push (TV_OUT_OF_SSA
);
4046 finish_out_of_ssa (&SA
);
4047 timevar_pop (TV_OUT_OF_SSA
);
4049 timevar_push (TV_POST_EXPAND
);
4050 /* We are no longer in SSA form. */
4051 cfun
->gimple_df
->in_ssa_p
= false;
4053 /* Expansion is used by optimization passes too, set maybe_hot_insn_p
4054 conservatively to true until they are all profile aware. */
4055 pointer_map_destroy (lab_rtx_for_bb
);
4058 construct_exit_block ();
4059 set_curr_insn_block (DECL_INITIAL (current_function_decl
));
4060 insn_locators_finalize ();
4062 /* Zap the tree EH table. */
4063 set_eh_throw_stmt_table (cfun
, NULL
);
4065 rebuild_jump_labels (get_insns ());
4067 FOR_BB_BETWEEN (bb
, ENTRY_BLOCK_PTR
, EXIT_BLOCK_PTR
, next_bb
)
4071 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
4074 commit_one_edge_insertion (e
);
4080 /* We're done expanding trees to RTL. */
4081 currently_expanding_to_rtl
= 0;
4083 FOR_BB_BETWEEN (bb
, ENTRY_BLOCK_PTR
->next_bb
, EXIT_BLOCK_PTR
, next_bb
)
4087 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
4089 /* Clear EDGE_EXECUTABLE. This flag is never used in the backend. */
4090 e
->flags
&= ~EDGE_EXECUTABLE
;
4092 /* At the moment not all abnormal edges match the RTL
4093 representation. It is safe to remove them here as
4094 find_many_sub_basic_blocks will rediscover them.
4095 In the future we should get this fixed properly. */
4096 if ((e
->flags
& EDGE_ABNORMAL
)
4097 && !(e
->flags
& EDGE_SIBCALL
))
4104 blocks
= sbitmap_alloc (last_basic_block
);
4105 sbitmap_ones (blocks
);
4106 find_many_sub_basic_blocks (blocks
);
4107 sbitmap_free (blocks
);
4108 purge_all_dead_edges ();
4112 expand_stack_alignment ();
4114 #ifdef ENABLE_CHECKING
4115 verify_flow_info ();
4118 /* There's no need to defer outputting this function any more; we
4119 know we want to output it. */
4120 DECL_DEFER_OUTPUT (current_function_decl
) = 0;
4122 /* Now that we're done expanding trees to RTL, we shouldn't have any
4123 more CONCATs anywhere. */
4124 generating_concat_p
= 0;
4129 "\n\n;;\n;; Full RTL generated for this function:\n;;\n");
4130 /* And the pass manager will dump RTL for us. */
4133 /* If we're emitting a nested function, make sure its parent gets
4134 emitted as well. Doing otherwise confuses debug info. */
4137 for (parent
= DECL_CONTEXT (current_function_decl
);
4138 parent
!= NULL_TREE
;
4139 parent
= get_containing_scope (parent
))
4140 if (TREE_CODE (parent
) == FUNCTION_DECL
)
4141 TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (parent
)) = 1;
4144 /* We are now committed to emitting code for this function. Do any
4145 preparation, such as emitting abstract debug info for the inline
4146 before it gets mangled by optimization. */
4147 if (cgraph_function_possibly_inlined_p (current_function_decl
))
4148 (*debug_hooks
->outlining_inline_function
) (current_function_decl
);
4150 TREE_ASM_WRITTEN (current_function_decl
) = 1;
4152 /* After expanding, the return labels are no longer needed. */
4153 return_label
= NULL
;
4154 naked_return_label
= NULL
;
4155 /* Tag the blocks with a depth number so that change_scope can find
4156 the common parent easily. */
4157 set_block_levels (DECL_INITIAL (cfun
->decl
), 0);
4158 default_rtl_profile ();
4159 timevar_pop (TV_POST_EXPAND
);
4163 struct rtl_opt_pass pass_expand
=
4167 "expand", /* name */
4169 gimple_expand_cfg
, /* execute */
4172 0, /* static_pass_number */
4173 TV_EXPAND
, /* tv_id */
4174 PROP_ssa
| PROP_gimple_leh
| PROP_cfg
4175 | PROP_gimple_lcx
, /* properties_required */
4176 PROP_rtl
, /* properties_provided */
4177 PROP_ssa
| PROP_trees
, /* properties_destroyed */
4178 TODO_verify_ssa
| TODO_verify_flow
4179 | TODO_verify_stmts
, /* todo_flags_start */
4181 | TODO_ggc_collect
/* todo_flags_finish */