1 /* A pass for lowering trees to RTL.
2 Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009
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"
42 #include "tree-inline.h"
43 #include "value-prof.h"
45 #include "ssaexpand.h"
48 /* This variable holds information helping the rewriting of SSA trees
52 /* This variable holds the currently expanded gimple statement for purposes
53 of comminucating the profile info to the builtin expanders. */
54 gimple currently_expanding_gimple_stmt;
56 /* Return an expression tree corresponding to the RHS of GIMPLE
60 gimple_assign_rhs_to_tree (gimple stmt)
63 enum gimple_rhs_class grhs_class;
65 grhs_class = get_gimple_rhs_class (gimple_expr_code (stmt));
67 if (grhs_class == GIMPLE_BINARY_RHS)
68 t = build2 (gimple_assign_rhs_code (stmt),
69 TREE_TYPE (gimple_assign_lhs (stmt)),
70 gimple_assign_rhs1 (stmt),
71 gimple_assign_rhs2 (stmt));
72 else if (grhs_class == GIMPLE_UNARY_RHS)
73 t = build1 (gimple_assign_rhs_code (stmt),
74 TREE_TYPE (gimple_assign_lhs (stmt)),
75 gimple_assign_rhs1 (stmt));
76 else if (grhs_class == GIMPLE_SINGLE_RHS)
78 t = gimple_assign_rhs1 (stmt);
79 /* Avoid modifying this tree in place below. */
80 if (gimple_has_location (stmt) && CAN_HAVE_LOCATION_P (t)
81 && gimple_location (stmt) != EXPR_LOCATION (t))
87 if (gimple_has_location (stmt) && CAN_HAVE_LOCATION_P (t))
88 SET_EXPR_LOCATION (t, gimple_location (stmt));
94 /* Verify that there is exactly single jump instruction since last and attach
95 REG_BR_PROB note specifying probability.
96 ??? We really ought to pass the probability down to RTL expanders and let it
97 re-distribute it when the conditional expands into multiple conditionals.
98 This is however difficult to do. */
100 add_reg_br_prob_note (rtx last, int probability)
102 if (profile_status == PROFILE_ABSENT)
104 for (last = NEXT_INSN (last); last && NEXT_INSN (last); last = NEXT_INSN (last))
107 /* It is common to emit condjump-around-jump sequence when we don't know
108 how to reverse the conditional. Special case this. */
109 if (!any_condjump_p (last)
110 || !JUMP_P (NEXT_INSN (last))
111 || !simplejump_p (NEXT_INSN (last))
112 || !NEXT_INSN (NEXT_INSN (last))
113 || !BARRIER_P (NEXT_INSN (NEXT_INSN (last)))
114 || !NEXT_INSN (NEXT_INSN (NEXT_INSN (last)))
115 || !LABEL_P (NEXT_INSN (NEXT_INSN (NEXT_INSN (last))))
116 || NEXT_INSN (NEXT_INSN (NEXT_INSN (NEXT_INSN (last)))))
118 gcc_assert (!find_reg_note (last, REG_BR_PROB, 0));
119 add_reg_note (last, REG_BR_PROB,
120 GEN_INT (REG_BR_PROB_BASE - probability));
123 if (!last || !JUMP_P (last) || !any_condjump_p (last))
125 gcc_assert (!find_reg_note (last, REG_BR_PROB, 0));
126 add_reg_note (last, REG_BR_PROB, GEN_INT (probability));
130 fprintf (dump_file, "Failed to add probability note\n");
134 #ifndef STACK_ALIGNMENT_NEEDED
135 #define STACK_ALIGNMENT_NEEDED 1
138 #define SSAVAR(x) (TREE_CODE (x) == SSA_NAME ? SSA_NAME_VAR (x) : x)
140 /* Associate declaration T with storage space X. If T is no
141 SSA name this is exactly SET_DECL_RTL, otherwise make the
142 partition of T associated with X. */
144 set_rtl (tree t, rtx x)
146 if (TREE_CODE (t) == SSA_NAME)
148 SA.partition_to_pseudo[var_to_partition (SA.map, t)] = x;
150 set_reg_attrs_for_decl_rtl (SSA_NAME_VAR (t), x);
151 /* For the benefit of debug information at -O0 (where vartracking
152 doesn't run) record the place also in the base DECL if it's
153 a normal variable (not a parameter). */
154 if (x && x != pc_rtx && TREE_CODE (SSA_NAME_VAR (t)) == VAR_DECL)
156 tree var = SSA_NAME_VAR (t);
157 /* If we don't yet have something recorded, just record it now. */
158 if (!DECL_RTL_SET_P (var))
159 SET_DECL_RTL (var, x);
160 /* If we have it set alrady to "multiple places" don't
162 else if (DECL_RTL (var) == pc_rtx)
164 /* If we have something recorded and it's not the same place
165 as we want to record now, we have multiple partitions for the
166 same base variable, with different places. We can't just
167 randomly chose one, hence we have to say that we don't know.
168 This only happens with optimization, and there var-tracking
169 will figure out the right thing. */
170 else if (DECL_RTL (var) != x)
171 SET_DECL_RTL (var, pc_rtx);
178 /* This structure holds data relevant to one variable that will be
179 placed in a stack slot. */
185 /* The offset of the variable. During partitioning, this is the
186 offset relative to the partition. After partitioning, this
187 is relative to the stack frame. */
188 HOST_WIDE_INT offset;
190 /* Initially, the size of the variable. Later, the size of the partition,
191 if this variable becomes it's partition's representative. */
194 /* The *byte* alignment required for this variable. Or as, with the
195 size, the alignment for this partition. */
198 /* The partition representative. */
199 size_t representative;
201 /* The next stack variable in the partition, or EOC. */
204 /* The numbers of conflicting stack variables. */
208 #define EOC ((size_t)-1)
210 /* We have an array of such objects while deciding allocation. */
211 static struct stack_var *stack_vars;
212 static size_t stack_vars_alloc;
213 static size_t stack_vars_num;
215 /* An array of indices such that stack_vars[stack_vars_sorted[i]].size
216 is non-decreasing. */
217 static size_t *stack_vars_sorted;
219 /* The phase of the stack frame. This is the known misalignment of
220 virtual_stack_vars_rtx from PREFERRED_STACK_BOUNDARY. That is,
221 (frame_offset+frame_phase) % PREFERRED_STACK_BOUNDARY == 0. */
222 static int frame_phase;
224 /* Used during expand_used_vars to remember if we saw any decls for
225 which we'd like to enable stack smashing protection. */
226 static bool has_protected_decls;
228 /* Used during expand_used_vars. Remember if we say a character buffer
229 smaller than our cutoff threshold. Used for -Wstack-protector. */
230 static bool has_short_buffer;
232 /* Discover the byte alignment to use for DECL. Ignore alignment
233 we can't do with expected alignment of the stack boundary. */
236 get_decl_align_unit (tree decl)
240 align = LOCAL_DECL_ALIGNMENT (decl);
242 if (align > MAX_SUPPORTED_STACK_ALIGNMENT)
243 align = MAX_SUPPORTED_STACK_ALIGNMENT;
245 if (SUPPORTS_STACK_ALIGNMENT)
247 if (crtl->stack_alignment_estimated < align)
249 gcc_assert(!crtl->stack_realign_processed);
250 crtl->stack_alignment_estimated = align;
254 /* stack_alignment_needed > PREFERRED_STACK_BOUNDARY is permitted.
255 So here we only make sure stack_alignment_needed >= align. */
256 if (crtl->stack_alignment_needed < align)
257 crtl->stack_alignment_needed = align;
258 if (crtl->max_used_stack_slot_alignment < align)
259 crtl->max_used_stack_slot_alignment = align;
261 return align / BITS_PER_UNIT;
264 /* Allocate SIZE bytes at byte alignment ALIGN from the stack frame.
265 Return the frame offset. */
268 alloc_stack_frame_space (HOST_WIDE_INT size, HOST_WIDE_INT align)
270 HOST_WIDE_INT offset, new_frame_offset;
272 new_frame_offset = frame_offset;
273 if (FRAME_GROWS_DOWNWARD)
275 new_frame_offset -= size + frame_phase;
276 new_frame_offset &= -align;
277 new_frame_offset += frame_phase;
278 offset = new_frame_offset;
282 new_frame_offset -= frame_phase;
283 new_frame_offset += align - 1;
284 new_frame_offset &= -align;
285 new_frame_offset += frame_phase;
286 offset = new_frame_offset;
287 new_frame_offset += size;
289 frame_offset = new_frame_offset;
291 if (frame_offset_overflow (frame_offset, cfun->decl))
292 frame_offset = offset = 0;
297 /* Accumulate DECL into STACK_VARS. */
300 add_stack_var (tree decl)
302 if (stack_vars_num >= stack_vars_alloc)
304 if (stack_vars_alloc)
305 stack_vars_alloc = stack_vars_alloc * 3 / 2;
307 stack_vars_alloc = 32;
309 = XRESIZEVEC (struct stack_var, stack_vars, stack_vars_alloc);
311 stack_vars[stack_vars_num].decl = decl;
312 stack_vars[stack_vars_num].offset = 0;
313 stack_vars[stack_vars_num].size = tree_low_cst (DECL_SIZE_UNIT (SSAVAR (decl)), 1);
314 stack_vars[stack_vars_num].alignb = get_decl_align_unit (SSAVAR (decl));
316 /* All variables are initially in their own partition. */
317 stack_vars[stack_vars_num].representative = stack_vars_num;
318 stack_vars[stack_vars_num].next = EOC;
320 /* All variables initially conflict with no other. */
321 stack_vars[stack_vars_num].conflicts = NULL;
323 /* Ensure that this decl doesn't get put onto the list twice. */
324 set_rtl (decl, pc_rtx);
329 /* Make the decls associated with luid's X and Y conflict. */
332 add_stack_var_conflict (size_t x, size_t y)
334 struct stack_var *a = &stack_vars[x];
335 struct stack_var *b = &stack_vars[y];
337 a->conflicts = BITMAP_ALLOC (NULL);
339 b->conflicts = BITMAP_ALLOC (NULL);
340 bitmap_set_bit (a->conflicts, y);
341 bitmap_set_bit (b->conflicts, x);
344 /* Check whether the decls associated with luid's X and Y conflict. */
347 stack_var_conflict_p (size_t x, size_t y)
349 struct stack_var *a = &stack_vars[x];
350 struct stack_var *b = &stack_vars[y];
351 if (!a->conflicts || !b->conflicts)
353 return bitmap_bit_p (a->conflicts, y);
356 /* Returns true if TYPE is or contains a union type. */
359 aggregate_contains_union_type (tree type)
363 if (TREE_CODE (type) == UNION_TYPE
364 || TREE_CODE (type) == QUAL_UNION_TYPE)
366 if (TREE_CODE (type) == ARRAY_TYPE)
367 return aggregate_contains_union_type (TREE_TYPE (type));
368 if (TREE_CODE (type) != RECORD_TYPE)
371 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
372 if (TREE_CODE (field) == FIELD_DECL)
373 if (aggregate_contains_union_type (TREE_TYPE (field)))
379 /* A subroutine of expand_used_vars. If two variables X and Y have alias
380 sets that do not conflict, then do add a conflict for these variables
381 in the interference graph. We also need to make sure to add conflicts
382 for union containing structures. Else RTL alias analysis comes along
383 and due to type based aliasing rules decides that for two overlapping
384 union temporaries { short s; int i; } accesses to the same mem through
385 different types may not alias and happily reorders stores across
386 life-time boundaries of the temporaries (See PR25654).
387 We also have to mind MEM_IN_STRUCT_P and MEM_SCALAR_P. */
390 add_alias_set_conflicts (void)
392 size_t i, j, n = stack_vars_num;
394 for (i = 0; i < n; ++i)
396 tree type_i = TREE_TYPE (stack_vars[i].decl);
397 bool aggr_i = AGGREGATE_TYPE_P (type_i);
400 contains_union = aggregate_contains_union_type (type_i);
401 for (j = 0; j < i; ++j)
403 tree type_j = TREE_TYPE (stack_vars[j].decl);
404 bool aggr_j = AGGREGATE_TYPE_P (type_j);
406 /* Either the objects conflict by means of type based
407 aliasing rules, or we need to add a conflict. */
408 || !objects_must_conflict_p (type_i, type_j)
409 /* In case the types do not conflict ensure that access
410 to elements will conflict. In case of unions we have
411 to be careful as type based aliasing rules may say
412 access to the same memory does not conflict. So play
413 safe and add a conflict in this case. */
415 add_stack_var_conflict (i, j);
420 /* A subroutine of partition_stack_vars. A comparison function for qsort,
421 sorting an array of indices by the size and type of the object. */
424 stack_var_size_cmp (const void *a, const void *b)
426 HOST_WIDE_INT sa = stack_vars[*(const size_t *)a].size;
427 HOST_WIDE_INT sb = stack_vars[*(const size_t *)b].size;
429 unsigned int uida, uidb;
435 decla = stack_vars[*(const size_t *)a].decl;
436 declb = stack_vars[*(const size_t *)b].decl;
437 /* For stack variables of the same size use and id of the decls
438 to make the sort stable. Two SSA names are compared by their
439 version, SSA names come before non-SSA names, and two normal
440 decls are compared by their DECL_UID. */
441 if (TREE_CODE (decla) == SSA_NAME)
443 if (TREE_CODE (declb) == SSA_NAME)
444 uida = SSA_NAME_VERSION (decla), uidb = SSA_NAME_VERSION (declb);
448 else if (TREE_CODE (declb) == SSA_NAME)
451 uida = DECL_UID (decla), uidb = DECL_UID (declb);
460 /* If the points-to solution *PI points to variables that are in a partition
461 together with other variables add all partition members to the pointed-to
465 add_partitioned_vars_to_ptset (struct pt_solution *pt,
466 struct pointer_map_t *decls_to_partitions,
467 struct pointer_set_t *visited, bitmap temp)
475 /* The pointed-to vars bitmap is shared, it is enough to
477 || pointer_set_insert(visited, pt->vars))
482 /* By using a temporary bitmap to store all members of the partitions
483 we have to add we make sure to visit each of the partitions only
485 EXECUTE_IF_SET_IN_BITMAP (pt->vars, 0, i, bi)
487 || !bitmap_bit_p (temp, i))
488 && (part = (bitmap *) pointer_map_contains (decls_to_partitions,
489 (void *)(size_t) i)))
490 bitmap_ior_into (temp, *part);
491 if (!bitmap_empty_p (temp))
492 bitmap_ior_into (pt->vars, temp);
495 /* Update points-to sets based on partition info, so we can use them on RTL.
496 The bitmaps representing stack partitions will be saved until expand,
497 where partitioned decls used as bases in memory expressions will be
501 update_alias_info_with_stack_vars (void)
503 struct pointer_map_t *decls_to_partitions = NULL;
505 tree var = NULL_TREE;
507 for (i = 0; i < stack_vars_num; i++)
511 struct ptr_info_def *pi;
513 /* Not interested in partitions with single variable. */
514 if (stack_vars[i].representative != i
515 || stack_vars[i].next == EOC)
518 if (!decls_to_partitions)
520 decls_to_partitions = pointer_map_create ();
521 cfun->gimple_df->decls_to_pointers = pointer_map_create ();
524 /* Create an SSA_NAME that points to the partition for use
525 as base during alias-oracle queries on RTL for bases that
526 have been partitioned. */
527 if (var == NULL_TREE)
528 var = create_tmp_var (ptr_type_node, NULL);
529 name = make_ssa_name (var, NULL);
531 /* Create bitmaps representing partitions. They will be used for
532 points-to sets later, so use GGC alloc. */
533 part = BITMAP_GGC_ALLOC ();
534 for (j = i; j != EOC; j = stack_vars[j].next)
536 tree decl = stack_vars[j].decl;
537 unsigned int uid = DECL_UID (decl);
538 /* We should never end up partitioning SSA names (though they
539 may end up on the stack). Neither should we allocate stack
540 space to something that is unused and thus unreferenced. */
541 gcc_assert (DECL_P (decl)
542 && referenced_var_lookup (uid));
543 bitmap_set_bit (part, uid);
544 *((bitmap *) pointer_map_insert (decls_to_partitions,
545 (void *)(size_t) uid)) = part;
546 *((tree *) pointer_map_insert (cfun->gimple_df->decls_to_pointers,
550 /* Make the SSA name point to all partition members. */
551 pi = get_ptr_info (name);
552 pt_solution_set (&pi->pt, part);
555 /* Make all points-to sets that contain one member of a partition
556 contain all members of the partition. */
557 if (decls_to_partitions)
560 struct pointer_set_t *visited = pointer_set_create ();
561 bitmap temp = BITMAP_ALLOC (NULL);
563 for (i = 1; i < num_ssa_names; i++)
565 tree name = ssa_name (i);
566 struct ptr_info_def *pi;
569 && POINTER_TYPE_P (TREE_TYPE (name))
570 && ((pi = SSA_NAME_PTR_INFO (name)) != NULL))
571 add_partitioned_vars_to_ptset (&pi->pt, decls_to_partitions,
575 add_partitioned_vars_to_ptset (&cfun->gimple_df->escaped,
576 decls_to_partitions, visited, temp);
577 add_partitioned_vars_to_ptset (&cfun->gimple_df->callused,
578 decls_to_partitions, visited, temp);
580 pointer_set_destroy (visited);
581 pointer_map_destroy (decls_to_partitions);
586 /* A subroutine of partition_stack_vars. The UNION portion of a UNION/FIND
587 partitioning algorithm. Partitions A and B are known to be non-conflicting.
588 Merge them into a single partition A.
590 At the same time, add OFFSET to all variables in partition B. At the end
591 of the partitioning process we've have a nice block easy to lay out within
595 union_stack_vars (size_t a, size_t b, HOST_WIDE_INT offset)
598 struct stack_var *vb = &stack_vars[b];
602 /* Update each element of partition B with the given offset,
603 and merge them into partition A. */
604 for (last = i = b; i != EOC; last = i, i = stack_vars[i].next)
606 stack_vars[i].offset += offset;
607 stack_vars[i].representative = a;
609 stack_vars[last].next = stack_vars[a].next;
610 stack_vars[a].next = b;
612 /* Update the required alignment of partition A to account for B. */
613 if (stack_vars[a].alignb < stack_vars[b].alignb)
614 stack_vars[a].alignb = stack_vars[b].alignb;
616 /* Update the interference graph and merge the conflicts. */
619 EXECUTE_IF_SET_IN_BITMAP (vb->conflicts, 0, u, bi)
620 add_stack_var_conflict (a, stack_vars[u].representative);
621 BITMAP_FREE (vb->conflicts);
625 /* A subroutine of expand_used_vars. Binpack the variables into
626 partitions constrained by the interference graph. The overall
627 algorithm used is as follows:
629 Sort the objects by size.
634 Look for the largest non-conflicting object B with size <= S.
644 partition_stack_vars (void)
646 size_t si, sj, n = stack_vars_num;
648 stack_vars_sorted = XNEWVEC (size_t, stack_vars_num);
649 for (si = 0; si < n; ++si)
650 stack_vars_sorted[si] = si;
655 qsort (stack_vars_sorted, n, sizeof (size_t), stack_var_size_cmp);
657 for (si = 0; si < n; ++si)
659 size_t i = stack_vars_sorted[si];
660 HOST_WIDE_INT isize = stack_vars[i].size;
661 HOST_WIDE_INT offset = 0;
663 for (sj = si; sj-- > 0; )
665 size_t j = stack_vars_sorted[sj];
666 HOST_WIDE_INT jsize = stack_vars[j].size;
667 unsigned int jalign = stack_vars[j].alignb;
669 /* Ignore objects that aren't partition representatives. */
670 if (stack_vars[j].representative != j)
673 /* Ignore objects too large for the remaining space. */
677 /* Ignore conflicting objects. */
678 if (stack_var_conflict_p (i, j))
681 /* Refine the remaining space check to include alignment. */
682 if (offset & (jalign - 1))
684 HOST_WIDE_INT toff = offset;
686 toff &= -(HOST_WIDE_INT)jalign;
687 if (isize - (toff - offset) < jsize)
690 isize -= toff - offset;
694 /* UNION the objects, placing J at OFFSET. */
695 union_stack_vars (i, j, offset);
704 update_alias_info_with_stack_vars ();
707 /* A debugging aid for expand_used_vars. Dump the generated partitions. */
710 dump_stack_var_partition (void)
712 size_t si, i, j, n = stack_vars_num;
714 for (si = 0; si < n; ++si)
716 i = stack_vars_sorted[si];
718 /* Skip variables that aren't partition representatives, for now. */
719 if (stack_vars[i].representative != i)
722 fprintf (dump_file, "Partition %lu: size " HOST_WIDE_INT_PRINT_DEC
723 " align %u\n", (unsigned long) i, stack_vars[i].size,
724 stack_vars[i].alignb);
726 for (j = i; j != EOC; j = stack_vars[j].next)
728 fputc ('\t', dump_file);
729 print_generic_expr (dump_file, stack_vars[j].decl, dump_flags);
730 fprintf (dump_file, ", offset " HOST_WIDE_INT_PRINT_DEC "\n",
731 stack_vars[j].offset);
736 /* Assign rtl to DECL at frame offset OFFSET. */
739 expand_one_stack_var_at (tree decl, HOST_WIDE_INT offset)
741 /* Alignment is unsigned. */
742 unsigned HOST_WIDE_INT align;
745 /* If this fails, we've overflowed the stack frame. Error nicely? */
746 gcc_assert (offset == trunc_int_for_mode (offset, Pmode));
748 x = plus_constant (virtual_stack_vars_rtx, offset);
749 x = gen_rtx_MEM (DECL_MODE (SSAVAR (decl)), x);
751 if (TREE_CODE (decl) != SSA_NAME)
753 /* Set alignment we actually gave this decl if it isn't an SSA name.
754 If it is we generate stack slots only accidentally so it isn't as
755 important, we'll simply use the alignment that is already set. */
756 offset -= frame_phase;
757 align = offset & -offset;
758 align *= BITS_PER_UNIT;
760 align = STACK_BOUNDARY;
761 else if (align > MAX_SUPPORTED_STACK_ALIGNMENT)
762 align = MAX_SUPPORTED_STACK_ALIGNMENT;
764 DECL_ALIGN (decl) = align;
765 DECL_USER_ALIGN (decl) = 0;
768 set_mem_attributes (x, SSAVAR (decl), true);
772 /* A subroutine of expand_used_vars. Give each partition representative
773 a unique location within the stack frame. Update each partition member
774 with that location. */
777 expand_stack_vars (bool (*pred) (tree))
779 size_t si, i, j, n = stack_vars_num;
781 for (si = 0; si < n; ++si)
783 HOST_WIDE_INT offset;
785 i = stack_vars_sorted[si];
787 /* Skip variables that aren't partition representatives, for now. */
788 if (stack_vars[i].representative != i)
791 /* Skip variables that have already had rtl assigned. See also
792 add_stack_var where we perpetrate this pc_rtx hack. */
793 if ((TREE_CODE (stack_vars[i].decl) == SSA_NAME
794 ? SA.partition_to_pseudo[var_to_partition (SA.map, stack_vars[i].decl)]
795 : DECL_RTL (stack_vars[i].decl)) != pc_rtx)
798 /* Check the predicate to see whether this variable should be
799 allocated in this pass. */
800 if (pred && !pred (stack_vars[i].decl))
803 offset = alloc_stack_frame_space (stack_vars[i].size,
804 stack_vars[i].alignb);
806 /* Create rtl for each variable based on their location within the
808 for (j = i; j != EOC; j = stack_vars[j].next)
810 gcc_assert (stack_vars[j].offset <= stack_vars[i].size);
811 expand_one_stack_var_at (stack_vars[j].decl,
812 stack_vars[j].offset + offset);
817 /* Take into account all sizes of partitions and reset DECL_RTLs. */
819 account_stack_vars (void)
821 size_t si, j, i, n = stack_vars_num;
822 HOST_WIDE_INT size = 0;
824 for (si = 0; si < n; ++si)
826 i = stack_vars_sorted[si];
828 /* Skip variables that aren't partition representatives, for now. */
829 if (stack_vars[i].representative != i)
832 size += stack_vars[i].size;
833 for (j = i; j != EOC; j = stack_vars[j].next)
834 set_rtl (stack_vars[j].decl, NULL);
839 /* A subroutine of expand_one_var. Called to immediately assign rtl
840 to a variable to be allocated in the stack frame. */
843 expand_one_stack_var (tree var)
845 HOST_WIDE_INT size, offset, align;
847 size = tree_low_cst (DECL_SIZE_UNIT (SSAVAR (var)), 1);
848 align = get_decl_align_unit (SSAVAR (var));
849 offset = alloc_stack_frame_space (size, align);
851 expand_one_stack_var_at (var, offset);
854 /* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL
855 that will reside in a hard register. */
858 expand_one_hard_reg_var (tree var)
860 rest_of_decl_compilation (var, 0, 0);
863 /* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL
864 that will reside in a pseudo register. */
867 expand_one_register_var (tree var)
869 tree decl = SSAVAR (var);
870 tree type = TREE_TYPE (decl);
871 enum machine_mode reg_mode = promote_decl_mode (decl, NULL);
872 rtx x = gen_reg_rtx (reg_mode);
876 /* Note if the object is a user variable. */
877 if (!DECL_ARTIFICIAL (decl))
880 if (POINTER_TYPE_P (type))
881 mark_reg_pointer (x, TYPE_ALIGN (TREE_TYPE (type)));
884 /* A subroutine of expand_one_var. Called to assign rtl to a VAR_DECL that
885 has some associated error, e.g. its type is error-mark. We just need
886 to pick something that won't crash the rest of the compiler. */
889 expand_one_error_var (tree var)
891 enum machine_mode mode = DECL_MODE (var);
895 x = gen_rtx_MEM (BLKmode, const0_rtx);
896 else if (mode == VOIDmode)
899 x = gen_reg_rtx (mode);
901 SET_DECL_RTL (var, x);
904 /* A subroutine of expand_one_var. VAR is a variable that will be
905 allocated to the local stack frame. Return true if we wish to
906 add VAR to STACK_VARS so that it will be coalesced with other
907 variables. Return false to allocate VAR immediately.
909 This function is used to reduce the number of variables considered
910 for coalescing, which reduces the size of the quadratic problem. */
913 defer_stack_allocation (tree var, bool toplevel)
915 /* If stack protection is enabled, *all* stack variables must be deferred,
916 so that we can re-order the strings to the top of the frame. */
917 if (flag_stack_protect)
920 /* Variables in the outermost scope automatically conflict with
921 every other variable. The only reason to want to defer them
922 at all is that, after sorting, we can more efficiently pack
923 small variables in the stack frame. Continue to defer at -O2. */
924 if (toplevel && optimize < 2)
927 /* Without optimization, *most* variables are allocated from the
928 stack, which makes the quadratic problem large exactly when we
929 want compilation to proceed as quickly as possible. On the
930 other hand, we don't want the function's stack frame size to
931 get completely out of hand. So we avoid adding scalars and
932 "small" aggregates to the list at all. */
933 if (optimize == 0 && tree_low_cst (DECL_SIZE_UNIT (var), 1) < 32)
939 /* A subroutine of expand_used_vars. Expand one variable according to
940 its flavor. Variables to be placed on the stack are not actually
941 expanded yet, merely recorded.
942 When REALLY_EXPAND is false, only add stack values to be allocated.
943 Return stack usage this variable is supposed to take.
947 expand_one_var (tree var, bool toplevel, bool really_expand)
952 if (SUPPORTS_STACK_ALIGNMENT
953 && TREE_TYPE (var) != error_mark_node
954 && TREE_CODE (var) == VAR_DECL)
958 /* Because we don't know if VAR will be in register or on stack,
959 we conservatively assume it will be on stack even if VAR is
960 eventually put into register after RA pass. For non-automatic
961 variables, which won't be on stack, we collect alignment of
962 type and ignore user specified alignment. */
963 if (TREE_STATIC (var) || DECL_EXTERNAL (var))
964 align = MINIMUM_ALIGNMENT (TREE_TYPE (var),
965 TYPE_MODE (TREE_TYPE (var)),
966 TYPE_ALIGN (TREE_TYPE (var)));
968 align = MINIMUM_ALIGNMENT (var, DECL_MODE (var), DECL_ALIGN (var));
970 if (crtl->stack_alignment_estimated < align)
972 /* stack_alignment_estimated shouldn't change after stack
973 realign decision made */
974 gcc_assert(!crtl->stack_realign_processed);
975 crtl->stack_alignment_estimated = align;
979 if (TREE_CODE (origvar) == SSA_NAME)
981 gcc_assert (TREE_CODE (var) != VAR_DECL
982 || (!DECL_EXTERNAL (var)
983 && !DECL_HAS_VALUE_EXPR_P (var)
984 && !TREE_STATIC (var)
985 && TREE_TYPE (var) != error_mark_node
986 && !DECL_HARD_REGISTER (var)
989 if (TREE_CODE (var) != VAR_DECL && TREE_CODE (origvar) != SSA_NAME)
991 else if (DECL_EXTERNAL (var))
993 else if (DECL_HAS_VALUE_EXPR_P (var))
995 else if (TREE_STATIC (var))
997 else if (TREE_CODE (origvar) != SSA_NAME && DECL_RTL_SET_P (var))
999 else if (TREE_TYPE (var) == error_mark_node)
1002 expand_one_error_var (var);
1004 else if (TREE_CODE (var) == VAR_DECL && DECL_HARD_REGISTER (var))
1007 expand_one_hard_reg_var (var);
1009 else if (use_register_for_decl (var))
1012 expand_one_register_var (origvar);
1014 else if (defer_stack_allocation (var, toplevel))
1015 add_stack_var (origvar);
1019 expand_one_stack_var (origvar);
1020 return tree_low_cst (DECL_SIZE_UNIT (var), 1);
1025 /* A subroutine of expand_used_vars. Walk down through the BLOCK tree
1026 expanding variables. Those variables that can be put into registers
1027 are allocated pseudos; those that can't are put on the stack.
1029 TOPLEVEL is true if this is the outermost BLOCK. */
1032 expand_used_vars_for_block (tree block, bool toplevel)
1034 size_t i, j, old_sv_num, this_sv_num, new_sv_num;
1037 old_sv_num = toplevel ? 0 : stack_vars_num;
1039 /* Expand all variables at this level. */
1040 for (t = BLOCK_VARS (block); t ; t = TREE_CHAIN (t))
1042 expand_one_var (t, toplevel, true);
1044 this_sv_num = stack_vars_num;
1046 /* Expand all variables at containing levels. */
1047 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
1048 expand_used_vars_for_block (t, false);
1050 /* Since we do not track exact variable lifetimes (which is not even
1051 possible for variables whose address escapes), we mirror the block
1052 tree in the interference graph. Here we cause all variables at this
1053 level, and all sublevels, to conflict. */
1054 if (old_sv_num < this_sv_num)
1056 new_sv_num = stack_vars_num;
1058 for (i = old_sv_num; i < new_sv_num; ++i)
1059 for (j = i < this_sv_num ? i : this_sv_num; j-- > old_sv_num ;)
1060 add_stack_var_conflict (i, j);
1064 /* A subroutine of expand_used_vars. Walk down through the BLOCK tree
1065 and clear TREE_USED on all local variables. */
1068 clear_tree_used (tree block)
1072 for (t = BLOCK_VARS (block); t ; t = TREE_CHAIN (t))
1073 /* if (!TREE_STATIC (t) && !DECL_EXTERNAL (t)) */
1076 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
1077 clear_tree_used (t);
1080 /* Examine TYPE and determine a bit mask of the following features. */
1082 #define SPCT_HAS_LARGE_CHAR_ARRAY 1
1083 #define SPCT_HAS_SMALL_CHAR_ARRAY 2
1084 #define SPCT_HAS_ARRAY 4
1085 #define SPCT_HAS_AGGREGATE 8
1088 stack_protect_classify_type (tree type)
1090 unsigned int ret = 0;
1093 switch (TREE_CODE (type))
1096 t = TYPE_MAIN_VARIANT (TREE_TYPE (type));
1097 if (t == char_type_node
1098 || t == signed_char_type_node
1099 || t == unsigned_char_type_node)
1101 unsigned HOST_WIDE_INT max = PARAM_VALUE (PARAM_SSP_BUFFER_SIZE);
1102 unsigned HOST_WIDE_INT len;
1104 if (!TYPE_SIZE_UNIT (type)
1105 || !host_integerp (TYPE_SIZE_UNIT (type), 1))
1108 len = tree_low_cst (TYPE_SIZE_UNIT (type), 1);
1111 ret = SPCT_HAS_SMALL_CHAR_ARRAY | SPCT_HAS_ARRAY;
1113 ret = SPCT_HAS_LARGE_CHAR_ARRAY | SPCT_HAS_ARRAY;
1116 ret = SPCT_HAS_ARRAY;
1120 case QUAL_UNION_TYPE:
1122 ret = SPCT_HAS_AGGREGATE;
1123 for (t = TYPE_FIELDS (type); t ; t = TREE_CHAIN (t))
1124 if (TREE_CODE (t) == FIELD_DECL)
1125 ret |= stack_protect_classify_type (TREE_TYPE (t));
1135 /* Return nonzero if DECL should be segregated into the "vulnerable" upper
1136 part of the local stack frame. Remember if we ever return nonzero for
1137 any variable in this function. The return value is the phase number in
1138 which the variable should be allocated. */
1141 stack_protect_decl_phase (tree decl)
1143 unsigned int bits = stack_protect_classify_type (TREE_TYPE (decl));
1146 if (bits & SPCT_HAS_SMALL_CHAR_ARRAY)
1147 has_short_buffer = true;
1149 if (flag_stack_protect == 2)
1151 if ((bits & (SPCT_HAS_SMALL_CHAR_ARRAY | SPCT_HAS_LARGE_CHAR_ARRAY))
1152 && !(bits & SPCT_HAS_AGGREGATE))
1154 else if (bits & SPCT_HAS_ARRAY)
1158 ret = (bits & SPCT_HAS_LARGE_CHAR_ARRAY) != 0;
1161 has_protected_decls = true;
1166 /* Two helper routines that check for phase 1 and phase 2. These are used
1167 as callbacks for expand_stack_vars. */
1170 stack_protect_decl_phase_1 (tree decl)
1172 return stack_protect_decl_phase (decl) == 1;
1176 stack_protect_decl_phase_2 (tree decl)
1178 return stack_protect_decl_phase (decl) == 2;
1181 /* Ensure that variables in different stack protection phases conflict
1182 so that they are not merged and share the same stack slot. */
1185 add_stack_protection_conflicts (void)
1187 size_t i, j, n = stack_vars_num;
1188 unsigned char *phase;
1190 phase = XNEWVEC (unsigned char, n);
1191 for (i = 0; i < n; ++i)
1192 phase[i] = stack_protect_decl_phase (stack_vars[i].decl);
1194 for (i = 0; i < n; ++i)
1196 unsigned char ph_i = phase[i];
1197 for (j = 0; j < i; ++j)
1198 if (ph_i != phase[j])
1199 add_stack_var_conflict (i, j);
1205 /* Create a decl for the guard at the top of the stack frame. */
1208 create_stack_guard (void)
1210 tree guard = build_decl (DECL_SOURCE_LOCATION (current_function_decl),
1211 VAR_DECL, NULL, ptr_type_node);
1212 TREE_THIS_VOLATILE (guard) = 1;
1213 TREE_USED (guard) = 1;
1214 expand_one_stack_var (guard);
1215 crtl->stack_protect_guard = guard;
1218 /* A subroutine of expand_used_vars. Walk down through the BLOCK tree
1219 expanding variables. Those variables that can be put into registers
1220 are allocated pseudos; those that can't are put on the stack.
1222 TOPLEVEL is true if this is the outermost BLOCK. */
1224 static HOST_WIDE_INT
1225 account_used_vars_for_block (tree block, bool toplevel)
1228 HOST_WIDE_INT size = 0;
1230 /* Expand all variables at this level. */
1231 for (t = BLOCK_VARS (block); t ; t = TREE_CHAIN (t))
1233 size += expand_one_var (t, toplevel, false);
1235 /* Expand all variables at containing levels. */
1236 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
1237 size += account_used_vars_for_block (t, false);
1242 /* Prepare for expanding variables. */
1244 init_vars_expansion (void)
1247 /* Set TREE_USED on all variables in the local_decls. */
1248 for (t = cfun->local_decls; t; t = TREE_CHAIN (t))
1249 TREE_USED (TREE_VALUE (t)) = 1;
1251 /* Clear TREE_USED on all variables associated with a block scope. */
1252 clear_tree_used (DECL_INITIAL (current_function_decl));
1254 /* Initialize local stack smashing state. */
1255 has_protected_decls = false;
1256 has_short_buffer = false;
1259 /* Free up stack variable graph data. */
1261 fini_vars_expansion (void)
1263 size_t i, n = stack_vars_num;
1264 for (i = 0; i < n; i++)
1265 BITMAP_FREE (stack_vars[i].conflicts);
1266 XDELETEVEC (stack_vars);
1267 XDELETEVEC (stack_vars_sorted);
1269 stack_vars_alloc = stack_vars_num = 0;
1272 /* Make a fair guess for the size of the stack frame of the current
1273 function. This doesn't have to be exact, the result is only used
1274 in the inline heuristics. So we don't want to run the full stack
1275 var packing algorithm (which is quadratic in the number of stack
1276 vars). Instead, we calculate the total size of all stack vars.
1277 This turns out to be a pretty fair estimate -- packing of stack
1278 vars doesn't happen very often. */
1281 estimated_stack_frame_size (void)
1283 HOST_WIDE_INT size = 0;
1285 tree t, outer_block = DECL_INITIAL (current_function_decl);
1287 init_vars_expansion ();
1289 for (t = cfun->local_decls; t; t = TREE_CHAIN (t))
1291 tree var = TREE_VALUE (t);
1293 if (TREE_USED (var))
1294 size += expand_one_var (var, true, false);
1295 TREE_USED (var) = 1;
1297 size += account_used_vars_for_block (outer_block, true);
1299 if (stack_vars_num > 0)
1301 /* Fake sorting the stack vars for account_stack_vars (). */
1302 stack_vars_sorted = XNEWVEC (size_t, stack_vars_num);
1303 for (i = 0; i < stack_vars_num; ++i)
1304 stack_vars_sorted[i] = i;
1305 size += account_stack_vars ();
1306 fini_vars_expansion ();
1312 /* Expand all variables used in the function. */
1315 expand_used_vars (void)
1317 tree t, next, outer_block = DECL_INITIAL (current_function_decl);
1320 /* Compute the phase of the stack frame for this function. */
1322 int align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
1323 int off = STARTING_FRAME_OFFSET % align;
1324 frame_phase = off ? align - off : 0;
1327 init_vars_expansion ();
1329 for (i = 0; i < SA.map->num_partitions; i++)
1331 tree var = partition_to_var (SA.map, i);
1333 gcc_assert (is_gimple_reg (var));
1334 if (TREE_CODE (SSA_NAME_VAR (var)) == VAR_DECL)
1335 expand_one_var (var, true, true);
1338 /* This is a PARM_DECL or RESULT_DECL. For those partitions that
1339 contain the default def (representing the parm or result itself)
1340 we don't do anything here. But those which don't contain the
1341 default def (representing a temporary based on the parm/result)
1342 we need to allocate space just like for normal VAR_DECLs. */
1343 if (!bitmap_bit_p (SA.partition_has_default_def, i))
1345 expand_one_var (var, true, true);
1346 gcc_assert (SA.partition_to_pseudo[i]);
1351 /* At this point all variables on the local_decls with TREE_USED
1352 set are not associated with any block scope. Lay them out. */
1353 t = cfun->local_decls;
1354 cfun->local_decls = NULL_TREE;
1357 tree var = TREE_VALUE (t);
1358 bool expand_now = false;
1360 next = TREE_CHAIN (t);
1362 /* Expanded above already. */
1363 if (is_gimple_reg (var))
1365 TREE_USED (var) = 0;
1369 /* We didn't set a block for static or extern because it's hard
1370 to tell the difference between a global variable (re)declared
1371 in a local scope, and one that's really declared there to
1372 begin with. And it doesn't really matter much, since we're
1373 not giving them stack space. Expand them now. */
1374 else if (TREE_STATIC (var) || DECL_EXTERNAL (var))
1377 /* If the variable is not associated with any block, then it
1378 was created by the optimizers, and could be live anywhere
1380 else if (TREE_USED (var))
1383 /* Finally, mark all variables on the list as used. We'll use
1384 this in a moment when we expand those associated with scopes. */
1385 TREE_USED (var) = 1;
1389 expand_one_var (var, true, true);
1390 if (DECL_ARTIFICIAL (var) && !DECL_IGNORED_P (var))
1392 rtx rtl = DECL_RTL_IF_SET (var);
1394 /* Keep artificial non-ignored vars in cfun->local_decls
1395 chain until instantiate_decls. */
1396 if (rtl && (MEM_P (rtl) || GET_CODE (rtl) == CONCAT))
1398 TREE_CHAIN (t) = cfun->local_decls;
1399 cfun->local_decls = t;
1408 /* At this point, all variables within the block tree with TREE_USED
1409 set are actually used by the optimized function. Lay them out. */
1410 expand_used_vars_for_block (outer_block, true);
1412 if (stack_vars_num > 0)
1414 /* Due to the way alias sets work, no variables with non-conflicting
1415 alias sets may be assigned the same address. Add conflicts to
1417 add_alias_set_conflicts ();
1419 /* If stack protection is enabled, we don't share space between
1420 vulnerable data and non-vulnerable data. */
1421 if (flag_stack_protect)
1422 add_stack_protection_conflicts ();
1424 /* Now that we have collected all stack variables, and have computed a
1425 minimal interference graph, attempt to save some stack space. */
1426 partition_stack_vars ();
1428 dump_stack_var_partition ();
1431 /* There are several conditions under which we should create a
1432 stack guard: protect-all, alloca used, protected decls present. */
1433 if (flag_stack_protect == 2
1434 || (flag_stack_protect
1435 && (cfun->calls_alloca || has_protected_decls)))
1436 create_stack_guard ();
1438 /* Assign rtl to each variable based on these partitions. */
1439 if (stack_vars_num > 0)
1441 /* Reorder decls to be protected by iterating over the variables
1442 array multiple times, and allocating out of each phase in turn. */
1443 /* ??? We could probably integrate this into the qsort we did
1444 earlier, such that we naturally see these variables first,
1445 and thus naturally allocate things in the right order. */
1446 if (has_protected_decls)
1448 /* Phase 1 contains only character arrays. */
1449 expand_stack_vars (stack_protect_decl_phase_1);
1451 /* Phase 2 contains other kinds of arrays. */
1452 if (flag_stack_protect == 2)
1453 expand_stack_vars (stack_protect_decl_phase_2);
1456 expand_stack_vars (NULL);
1458 fini_vars_expansion ();
1461 /* If the target requires that FRAME_OFFSET be aligned, do it. */
1462 if (STACK_ALIGNMENT_NEEDED)
1464 HOST_WIDE_INT align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
1465 if (!FRAME_GROWS_DOWNWARD)
1466 frame_offset += align - 1;
1467 frame_offset &= -align;
1472 /* If we need to produce a detailed dump, print the tree representation
1473 for STMT to the dump file. SINCE is the last RTX after which the RTL
1474 generated for STMT should have been appended. */
1477 maybe_dump_rtl_for_gimple_stmt (gimple stmt, rtx since)
1479 if (dump_file && (dump_flags & TDF_DETAILS))
1481 fprintf (dump_file, "\n;; ");
1482 print_gimple_stmt (dump_file, stmt, 0,
1483 TDF_SLIM | (dump_flags & TDF_LINENO));
1484 fprintf (dump_file, "\n");
1486 print_rtl (dump_file, since ? NEXT_INSN (since) : since);
1490 /* Maps the blocks that do not contain tree labels to rtx labels. */
1492 static struct pointer_map_t *lab_rtx_for_bb;
1494 /* Returns the label_rtx expression for a label starting basic block BB. */
1497 label_rtx_for_bb (basic_block bb ATTRIBUTE_UNUSED)
1499 gimple_stmt_iterator gsi;
1504 if (bb->flags & BB_RTL)
1505 return block_label (bb);
1507 elt = pointer_map_contains (lab_rtx_for_bb, bb);
1511 /* Find the tree label if it is present. */
1513 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
1515 lab_stmt = gsi_stmt (gsi);
1516 if (gimple_code (lab_stmt) != GIMPLE_LABEL)
1519 lab = gimple_label_label (lab_stmt);
1520 if (DECL_NONLOCAL (lab))
1523 return label_rtx (lab);
1526 elt = pointer_map_insert (lab_rtx_for_bb, bb);
1527 *elt = gen_label_rtx ();
1532 /* A subroutine of expand_gimple_cond. Given E, a fallthrough edge
1533 of a basic block where we just expanded the conditional at the end,
1534 possibly clean up the CFG and instruction sequence. LAST is the
1535 last instruction before the just emitted jump sequence. */
1538 maybe_cleanup_end_of_block (edge e, rtx last)
1540 /* Special case: when jumpif decides that the condition is
1541 trivial it emits an unconditional jump (and the necessary
1542 barrier). But we still have two edges, the fallthru one is
1543 wrong. purge_dead_edges would clean this up later. Unfortunately
1544 we have to insert insns (and split edges) before
1545 find_many_sub_basic_blocks and hence before purge_dead_edges.
1546 But splitting edges might create new blocks which depend on the
1547 fact that if there are two edges there's no barrier. So the
1548 barrier would get lost and verify_flow_info would ICE. Instead
1549 of auditing all edge splitters to care for the barrier (which
1550 normally isn't there in a cleaned CFG), fix it here. */
1551 if (BARRIER_P (get_last_insn ()))
1555 /* Now, we have a single successor block, if we have insns to
1556 insert on the remaining edge we potentially will insert
1557 it at the end of this block (if the dest block isn't feasible)
1558 in order to avoid splitting the edge. This insertion will take
1559 place in front of the last jump. But we might have emitted
1560 multiple jumps (conditional and one unconditional) to the
1561 same destination. Inserting in front of the last one then
1562 is a problem. See PR 40021. We fix this by deleting all
1563 jumps except the last unconditional one. */
1564 insn = PREV_INSN (get_last_insn ());
1565 /* Make sure we have an unconditional jump. Otherwise we're
1567 gcc_assert (JUMP_P (insn) && !any_condjump_p (insn));
1568 for (insn = PREV_INSN (insn); insn != last;)
1570 insn = PREV_INSN (insn);
1571 if (JUMP_P (NEXT_INSN (insn)))
1572 delete_insn (NEXT_INSN (insn));
1577 /* A subroutine of expand_gimple_basic_block. Expand one GIMPLE_COND.
1578 Returns a new basic block if we've terminated the current basic
1579 block and created a new one. */
1582 expand_gimple_cond (basic_block bb, gimple stmt)
1584 basic_block new_bb, dest;
1589 enum tree_code code;
1592 code = gimple_cond_code (stmt);
1593 op0 = gimple_cond_lhs (stmt);
1594 op1 = gimple_cond_rhs (stmt);
1595 /* We're sometimes presented with such code:
1599 This would expand to two comparisons which then later might
1600 be cleaned up by combine. But some pattern matchers like if-conversion
1601 work better when there's only one compare, so make up for this
1602 here as special exception if TER would have made the same change. */
1603 if (gimple_cond_single_var_p (stmt)
1605 && TREE_CODE (op0) == SSA_NAME
1606 && bitmap_bit_p (SA.values, SSA_NAME_VERSION (op0)))
1608 gimple second = SSA_NAME_DEF_STMT (op0);
1609 if (gimple_code (second) == GIMPLE_ASSIGN
1610 && TREE_CODE_CLASS (gimple_assign_rhs_code (second))
1613 code = gimple_assign_rhs_code (second);
1614 op0 = gimple_assign_rhs1 (second);
1615 op1 = gimple_assign_rhs2 (second);
1619 last2 = last = get_last_insn ();
1621 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
1622 if (gimple_has_location (stmt))
1624 set_curr_insn_source_location (gimple_location (stmt));
1625 set_curr_insn_block (gimple_block (stmt));
1628 /* These flags have no purpose in RTL land. */
1629 true_edge->flags &= ~EDGE_TRUE_VALUE;
1630 false_edge->flags &= ~EDGE_FALSE_VALUE;
1632 /* We can either have a pure conditional jump with one fallthru edge or
1633 two-way jump that needs to be decomposed into two basic blocks. */
1634 if (false_edge->dest == bb->next_bb)
1636 jumpif_1 (code, op0, op1, label_rtx_for_bb (true_edge->dest));
1637 add_reg_br_prob_note (last, true_edge->probability);
1638 maybe_dump_rtl_for_gimple_stmt (stmt, last);
1639 if (true_edge->goto_locus)
1641 set_curr_insn_source_location (true_edge->goto_locus);
1642 set_curr_insn_block (true_edge->goto_block);
1643 true_edge->goto_locus = curr_insn_locator ();
1645 true_edge->goto_block = NULL;
1646 false_edge->flags |= EDGE_FALLTHRU;
1647 maybe_cleanup_end_of_block (false_edge, last);
1650 if (true_edge->dest == bb->next_bb)
1652 jumpifnot_1 (code, op0, op1, label_rtx_for_bb (false_edge->dest));
1653 add_reg_br_prob_note (last, false_edge->probability);
1654 maybe_dump_rtl_for_gimple_stmt (stmt, last);
1655 if (false_edge->goto_locus)
1657 set_curr_insn_source_location (false_edge->goto_locus);
1658 set_curr_insn_block (false_edge->goto_block);
1659 false_edge->goto_locus = curr_insn_locator ();
1661 false_edge->goto_block = NULL;
1662 true_edge->flags |= EDGE_FALLTHRU;
1663 maybe_cleanup_end_of_block (true_edge, last);
1667 jumpif_1 (code, op0, op1, label_rtx_for_bb (true_edge->dest));
1668 add_reg_br_prob_note (last, true_edge->probability);
1669 last = get_last_insn ();
1670 if (false_edge->goto_locus)
1672 set_curr_insn_source_location (false_edge->goto_locus);
1673 set_curr_insn_block (false_edge->goto_block);
1674 false_edge->goto_locus = curr_insn_locator ();
1676 false_edge->goto_block = NULL;
1677 emit_jump (label_rtx_for_bb (false_edge->dest));
1680 if (BARRIER_P (BB_END (bb)))
1681 BB_END (bb) = PREV_INSN (BB_END (bb));
1682 update_bb_for_insn (bb);
1684 new_bb = create_basic_block (NEXT_INSN (last), get_last_insn (), bb);
1685 dest = false_edge->dest;
1686 redirect_edge_succ (false_edge, new_bb);
1687 false_edge->flags |= EDGE_FALLTHRU;
1688 new_bb->count = false_edge->count;
1689 new_bb->frequency = EDGE_FREQUENCY (false_edge);
1690 new_edge = make_edge (new_bb, dest, 0);
1691 new_edge->probability = REG_BR_PROB_BASE;
1692 new_edge->count = new_bb->count;
1693 if (BARRIER_P (BB_END (new_bb)))
1694 BB_END (new_bb) = PREV_INSN (BB_END (new_bb));
1695 update_bb_for_insn (new_bb);
1697 maybe_dump_rtl_for_gimple_stmt (stmt, last2);
1699 if (true_edge->goto_locus)
1701 set_curr_insn_source_location (true_edge->goto_locus);
1702 set_curr_insn_block (true_edge->goto_block);
1703 true_edge->goto_locus = curr_insn_locator ();
1705 true_edge->goto_block = NULL;
1710 /* A subroutine of expand_gimple_stmt_1, expanding one GIMPLE_CALL
1714 expand_call_stmt (gimple stmt)
1717 tree lhs = gimple_call_lhs (stmt);
1720 exp = build_vl_exp (CALL_EXPR, gimple_call_num_args (stmt) + 3);
1722 CALL_EXPR_FN (exp) = gimple_call_fn (stmt);
1723 TREE_TYPE (exp) = gimple_call_return_type (stmt);
1724 CALL_EXPR_STATIC_CHAIN (exp) = gimple_call_chain (stmt);
1726 for (i = 0; i < gimple_call_num_args (stmt); i++)
1727 CALL_EXPR_ARG (exp, i) = gimple_call_arg (stmt, i);
1729 if (gimple_has_side_effects (stmt))
1730 TREE_SIDE_EFFECTS (exp) = 1;
1732 if (gimple_call_nothrow_p (stmt))
1733 TREE_NOTHROW (exp) = 1;
1735 CALL_EXPR_TAILCALL (exp) = gimple_call_tail_p (stmt);
1736 CALL_EXPR_RETURN_SLOT_OPT (exp) = gimple_call_return_slot_opt_p (stmt);
1737 CALL_FROM_THUNK_P (exp) = gimple_call_from_thunk_p (stmt);
1738 CALL_CANNOT_INLINE_P (exp) = gimple_call_cannot_inline_p (stmt);
1739 CALL_EXPR_VA_ARG_PACK (exp) = gimple_call_va_arg_pack_p (stmt);
1740 SET_EXPR_LOCATION (exp, gimple_location (stmt));
1741 TREE_BLOCK (exp) = gimple_block (stmt);
1744 expand_assignment (lhs, exp, false);
1746 expand_expr_real_1 (exp, const0_rtx, VOIDmode, EXPAND_NORMAL, NULL);
1749 /* A subroutine of expand_gimple_stmt, expanding one gimple statement
1750 STMT that doesn't require special handling for outgoing edges. That
1751 is no tailcalls and no GIMPLE_COND. */
1754 expand_gimple_stmt_1 (gimple stmt)
1757 switch (gimple_code (stmt))
1760 op0 = gimple_goto_dest (stmt);
1761 if (TREE_CODE (op0) == LABEL_DECL)
1764 expand_computed_goto (op0);
1767 expand_label (gimple_label_label (stmt));
1770 case GIMPLE_PREDICT:
1776 expand_asm_stmt (stmt);
1779 expand_call_stmt (stmt);
1783 op0 = gimple_return_retval (stmt);
1785 if (op0 && op0 != error_mark_node)
1787 tree result = DECL_RESULT (current_function_decl);
1789 /* If we are not returning the current function's RESULT_DECL,
1790 build an assignment to it. */
1793 /* I believe that a function's RESULT_DECL is unique. */
1794 gcc_assert (TREE_CODE (op0) != RESULT_DECL);
1796 /* ??? We'd like to use simply expand_assignment here,
1797 but this fails if the value is of BLKmode but the return
1798 decl is a register. expand_return has special handling
1799 for this combination, which eventually should move
1800 to common code. See comments there. Until then, let's
1801 build a modify expression :-/ */
1802 op0 = build2 (MODIFY_EXPR, TREE_TYPE (result),
1807 expand_null_return ();
1809 expand_return (op0);
1814 tree lhs = gimple_assign_lhs (stmt);
1816 /* Tree expand used to fiddle with |= and &= of two bitfield
1817 COMPONENT_REFs here. This can't happen with gimple, the LHS
1818 of binary assigns must be a gimple reg. */
1820 if (TREE_CODE (lhs) != SSA_NAME
1821 || get_gimple_rhs_class (gimple_expr_code (stmt))
1822 == GIMPLE_SINGLE_RHS)
1824 tree rhs = gimple_assign_rhs1 (stmt);
1825 gcc_assert (get_gimple_rhs_class (gimple_expr_code (stmt))
1826 == GIMPLE_SINGLE_RHS);
1827 if (gimple_has_location (stmt) && CAN_HAVE_LOCATION_P (rhs))
1828 SET_EXPR_LOCATION (rhs, gimple_location (stmt));
1829 expand_assignment (lhs, rhs,
1830 gimple_assign_nontemporal_move_p (stmt));
1835 bool nontemporal = gimple_assign_nontemporal_move_p (stmt);
1836 struct separate_ops ops;
1837 bool promoted = false;
1839 target = expand_expr (lhs, NULL_RTX, VOIDmode, EXPAND_WRITE);
1840 if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target))
1843 ops.code = gimple_assign_rhs_code (stmt);
1844 ops.type = TREE_TYPE (lhs);
1845 switch (get_gimple_rhs_class (gimple_expr_code (stmt)))
1847 case GIMPLE_BINARY_RHS:
1848 ops.op1 = gimple_assign_rhs2 (stmt);
1850 case GIMPLE_UNARY_RHS:
1851 ops.op0 = gimple_assign_rhs1 (stmt);
1856 ops.location = gimple_location (stmt);
1858 /* If we want to use a nontemporal store, force the value to
1859 register first. If we store into a promoted register,
1860 don't directly expand to target. */
1861 temp = nontemporal || promoted ? NULL_RTX : target;
1862 temp = expand_expr_real_2 (&ops, temp, GET_MODE (target),
1869 int unsignedp = SUBREG_PROMOTED_UNSIGNED_P (target);
1870 /* If TEMP is a VOIDmode constant, use convert_modes to make
1871 sure that we properly convert it. */
1872 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode)
1874 temp = convert_modes (GET_MODE (target),
1875 TYPE_MODE (ops.type),
1877 temp = convert_modes (GET_MODE (SUBREG_REG (target)),
1878 GET_MODE (target), temp, unsignedp);
1881 convert_move (SUBREG_REG (target), temp, unsignedp);
1883 else if (nontemporal && emit_storent_insn (target, temp))
1887 temp = force_operand (temp, target);
1889 emit_move_insn (target, temp);
1900 /* Expand one gimple statement STMT and return the last RTL instruction
1901 before any of the newly generated ones.
1903 In addition to generating the necessary RTL instructions this also
1904 sets REG_EH_REGION notes if necessary and sets the current source
1905 location for diagnostics. */
1908 expand_gimple_stmt (gimple stmt)
1912 location_t saved_location = input_location;
1914 last = get_last_insn ();
1916 /* If this is an expression of some kind and it has an associated line
1917 number, then emit the line number before expanding the expression.
1919 We need to save and restore the file and line information so that
1920 errors discovered during expansion are emitted with the right
1921 information. It would be better of the diagnostic routines
1922 used the file/line information embedded in the tree nodes rather
1926 if (gimple_has_location (stmt))
1928 input_location = gimple_location (stmt);
1929 set_curr_insn_source_location (input_location);
1931 /* Record where the insns produced belong. */
1932 set_curr_insn_block (gimple_block (stmt));
1935 expand_gimple_stmt_1 (stmt);
1936 /* Free any temporaries used to evaluate this statement. */
1939 input_location = saved_location;
1941 /* Mark all insns that may trap. */
1942 lp_nr = lookup_stmt_eh_lp (stmt);
1946 for (insn = next_real_insn (last); insn;
1947 insn = next_real_insn (insn))
1949 if (! find_reg_note (insn, REG_EH_REGION, NULL_RTX)
1950 /* If we want exceptions for non-call insns, any
1951 may_trap_p instruction may throw. */
1952 && GET_CODE (PATTERN (insn)) != CLOBBER
1953 && GET_CODE (PATTERN (insn)) != USE
1954 && insn_could_throw_p (insn))
1955 make_reg_eh_region_note (insn, 0, lp_nr);
1962 /* A subroutine of expand_gimple_basic_block. Expand one GIMPLE_CALL
1963 that has CALL_EXPR_TAILCALL set. Returns non-null if we actually
1964 generated a tail call (something that might be denied by the ABI
1965 rules governing the call; see calls.c).
1967 Sets CAN_FALLTHRU if we generated a *conditional* tail call, and
1968 can still reach the rest of BB. The case here is __builtin_sqrt,
1969 where the NaN result goes through the external function (with a
1970 tailcall) and the normal result happens via a sqrt instruction. */
1973 expand_gimple_tailcall (basic_block bb, gimple stmt, bool *can_fallthru)
1981 last2 = last = expand_gimple_stmt (stmt);
1983 for (last = NEXT_INSN (last); last; last = NEXT_INSN (last))
1984 if (CALL_P (last) && SIBLING_CALL_P (last))
1987 maybe_dump_rtl_for_gimple_stmt (stmt, last2);
1989 *can_fallthru = true;
1993 /* ??? Wouldn't it be better to just reset any pending stack adjust?
1994 Any instructions emitted here are about to be deleted. */
1995 do_pending_stack_adjust ();
1997 /* Remove any non-eh, non-abnormal edges that don't go to exit. */
1998 /* ??? I.e. the fallthrough edge. HOWEVER! If there were to be
1999 EH or abnormal edges, we shouldn't have created a tail call in
2000 the first place. So it seems to me we should just be removing
2001 all edges here, or redirecting the existing fallthru edge to
2007 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
2009 if (!(e->flags & (EDGE_ABNORMAL | EDGE_EH)))
2011 if (e->dest != EXIT_BLOCK_PTR)
2013 e->dest->count -= e->count;
2014 e->dest->frequency -= EDGE_FREQUENCY (e);
2015 if (e->dest->count < 0)
2017 if (e->dest->frequency < 0)
2018 e->dest->frequency = 0;
2021 probability += e->probability;
2028 /* This is somewhat ugly: the call_expr expander often emits instructions
2029 after the sibcall (to perform the function return). These confuse the
2030 find_many_sub_basic_blocks code, so we need to get rid of these. */
2031 last = NEXT_INSN (last);
2032 gcc_assert (BARRIER_P (last));
2034 *can_fallthru = false;
2035 while (NEXT_INSN (last))
2037 /* For instance an sqrt builtin expander expands if with
2038 sibcall in the then and label for `else`. */
2039 if (LABEL_P (NEXT_INSN (last)))
2041 *can_fallthru = true;
2044 delete_insn (NEXT_INSN (last));
2047 e = make_edge (bb, EXIT_BLOCK_PTR, EDGE_ABNORMAL | EDGE_SIBCALL);
2048 e->probability += probability;
2051 update_bb_for_insn (bb);
2053 if (NEXT_INSN (last))
2055 bb = create_basic_block (NEXT_INSN (last), get_last_insn (), bb);
2058 if (BARRIER_P (last))
2059 BB_END (bb) = PREV_INSN (last);
2062 maybe_dump_rtl_for_gimple_stmt (stmt, last2);
2067 /* Return the difference between the floor and the truncated result of
2068 a signed division by OP1 with remainder MOD. */
2070 floor_sdiv_adjust (enum machine_mode mode, rtx mod, rtx op1)
2072 /* (mod != 0 ? (op1 / mod < 0 ? -1 : 0) : 0) */
2073 return gen_rtx_IF_THEN_ELSE
2074 (mode, gen_rtx_NE (BImode, mod, const0_rtx),
2075 gen_rtx_IF_THEN_ELSE
2076 (mode, gen_rtx_LT (BImode,
2077 gen_rtx_DIV (mode, op1, mod),
2079 constm1_rtx, const0_rtx),
2083 /* Return the difference between the ceil and the truncated result of
2084 a signed division by OP1 with remainder MOD. */
2086 ceil_sdiv_adjust (enum machine_mode mode, rtx mod, rtx op1)
2088 /* (mod != 0 ? (op1 / mod > 0 ? 1 : 0) : 0) */
2089 return gen_rtx_IF_THEN_ELSE
2090 (mode, gen_rtx_NE (BImode, mod, const0_rtx),
2091 gen_rtx_IF_THEN_ELSE
2092 (mode, gen_rtx_GT (BImode,
2093 gen_rtx_DIV (mode, op1, mod),
2095 const1_rtx, const0_rtx),
2099 /* Return the difference between the ceil and the truncated result of
2100 an unsigned division by OP1 with remainder MOD. */
2102 ceil_udiv_adjust (enum machine_mode mode, rtx mod, rtx op1 ATTRIBUTE_UNUSED)
2104 /* (mod != 0 ? 1 : 0) */
2105 return gen_rtx_IF_THEN_ELSE
2106 (mode, gen_rtx_NE (BImode, mod, const0_rtx),
2107 const1_rtx, const0_rtx);
2110 /* Return the difference between the rounded and the truncated result
2111 of a signed division by OP1 with remainder MOD. Halfway cases are
2112 rounded away from zero, rather than to the nearest even number. */
2114 round_sdiv_adjust (enum machine_mode mode, rtx mod, rtx op1)
2116 /* (abs (mod) >= abs (op1) - abs (mod)
2117 ? (op1 / mod > 0 ? 1 : -1)
2119 return gen_rtx_IF_THEN_ELSE
2120 (mode, gen_rtx_GE (BImode, gen_rtx_ABS (mode, mod),
2121 gen_rtx_MINUS (mode,
2122 gen_rtx_ABS (mode, op1),
2123 gen_rtx_ABS (mode, mod))),
2124 gen_rtx_IF_THEN_ELSE
2125 (mode, gen_rtx_GT (BImode,
2126 gen_rtx_DIV (mode, op1, mod),
2128 const1_rtx, constm1_rtx),
2132 /* Return the difference between the rounded and the truncated result
2133 of a unsigned division by OP1 with remainder MOD. Halfway cases
2134 are rounded away from zero, rather than to the nearest even
2137 round_udiv_adjust (enum machine_mode mode, rtx mod, rtx op1)
2139 /* (mod >= op1 - mod ? 1 : 0) */
2140 return gen_rtx_IF_THEN_ELSE
2141 (mode, gen_rtx_GE (BImode, mod,
2142 gen_rtx_MINUS (mode, op1, mod)),
2143 const1_rtx, const0_rtx);
2146 /* Convert X to MODE, that must be Pmode or ptr_mode, without emitting
2150 convert_debug_memory_address (enum machine_mode mode, rtx x)
2152 enum machine_mode xmode = GET_MODE (x);
2154 #ifndef POINTERS_EXTEND_UNSIGNED
2155 gcc_assert (mode == Pmode);
2156 gcc_assert (xmode == mode || xmode == VOIDmode);
2158 gcc_assert (mode == Pmode || mode == ptr_mode);
2160 if (GET_MODE (x) == mode || GET_MODE (x) == VOIDmode)
2163 if (GET_MODE_BITSIZE (mode) < GET_MODE_BITSIZE (xmode))
2164 x = simplify_gen_subreg (mode, x, xmode,
2165 subreg_lowpart_offset
2167 else if (POINTERS_EXTEND_UNSIGNED > 0)
2168 x = gen_rtx_ZERO_EXTEND (mode, x);
2169 else if (!POINTERS_EXTEND_UNSIGNED)
2170 x = gen_rtx_SIGN_EXTEND (mode, x);
2173 #endif /* POINTERS_EXTEND_UNSIGNED */
2178 /* Return an RTX equivalent to the value of the tree expression
2182 expand_debug_expr (tree exp)
2184 rtx op0 = NULL_RTX, op1 = NULL_RTX, op2 = NULL_RTX;
2185 enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
2186 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
2188 enum machine_mode address_mode;
2190 switch (TREE_CODE_CLASS (TREE_CODE (exp)))
2192 case tcc_expression:
2193 switch (TREE_CODE (exp))
2198 case TRUTH_ANDIF_EXPR:
2199 case TRUTH_ORIF_EXPR:
2200 case TRUTH_AND_EXPR:
2202 case TRUTH_XOR_EXPR:
2205 case TRUTH_NOT_EXPR:
2214 op2 = expand_debug_expr (TREE_OPERAND (exp, 2));
2221 case tcc_comparison:
2222 op1 = expand_debug_expr (TREE_OPERAND (exp, 1));
2229 op0 = expand_debug_expr (TREE_OPERAND (exp, 0));
2239 case tcc_exceptional:
2240 case tcc_declaration:
2246 switch (TREE_CODE (exp))
2249 if (!lookup_constant_def (exp))
2251 if (strlen (TREE_STRING_POINTER (exp)) + 1
2252 != (size_t) TREE_STRING_LENGTH (exp))
2254 op0 = gen_rtx_CONST_STRING (Pmode, TREE_STRING_POINTER (exp));
2255 op0 = gen_rtx_MEM (BLKmode, op0);
2256 set_mem_attributes (op0, exp, 0);
2259 /* Fall through... */
2264 op0 = expand_expr (exp, NULL_RTX, mode, EXPAND_INITIALIZER);
2268 gcc_assert (COMPLEX_MODE_P (mode));
2269 op0 = expand_debug_expr (TREE_REALPART (exp));
2270 op1 = expand_debug_expr (TREE_IMAGPART (exp));
2271 return gen_rtx_CONCAT (mode, op0, op1);
2273 case DEBUG_EXPR_DECL:
2274 op0 = DECL_RTL_IF_SET (exp);
2279 op0 = gen_rtx_DEBUG_EXPR (mode);
2280 DEBUG_EXPR_TREE_DECL (op0) = exp;
2281 SET_DECL_RTL (exp, op0);
2291 op0 = DECL_RTL_IF_SET (exp);
2293 /* This decl was probably optimized away. */
2296 if (TREE_CODE (exp) != VAR_DECL
2297 || DECL_EXTERNAL (exp)
2298 || !TREE_STATIC (exp)
2300 || DECL_HARD_REGISTER (exp)
2301 || mode == VOIDmode)
2304 op0 = DECL_RTL (exp);
2305 SET_DECL_RTL (exp, NULL);
2307 || GET_CODE (XEXP (op0, 0)) != SYMBOL_REF
2308 || SYMBOL_REF_DECL (XEXP (op0, 0)) != exp)
2312 op0 = copy_rtx (op0);
2314 if (GET_MODE (op0) == BLKmode)
2316 gcc_assert (MEM_P (op0));
2317 op0 = adjust_address_nv (op0, mode, 0);
2328 enum machine_mode inner_mode = GET_MODE (op0);
2330 if (mode == inner_mode)
2333 if (inner_mode == VOIDmode)
2335 inner_mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
2336 if (mode == inner_mode)
2340 if (FLOAT_MODE_P (mode) && FLOAT_MODE_P (inner_mode))
2342 if (GET_MODE_BITSIZE (mode) == GET_MODE_BITSIZE (inner_mode))
2343 op0 = simplify_gen_subreg (mode, op0, inner_mode, 0);
2344 else if (GET_MODE_BITSIZE (mode) < GET_MODE_BITSIZE (inner_mode))
2345 op0 = simplify_gen_unary (FLOAT_TRUNCATE, mode, op0, inner_mode);
2347 op0 = simplify_gen_unary (FLOAT_EXTEND, mode, op0, inner_mode);
2349 else if (FLOAT_MODE_P (mode))
2351 if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))))
2352 op0 = simplify_gen_unary (UNSIGNED_FLOAT, mode, op0, inner_mode);
2354 op0 = simplify_gen_unary (FLOAT, mode, op0, inner_mode);
2356 else if (FLOAT_MODE_P (inner_mode))
2359 op0 = simplify_gen_unary (UNSIGNED_FIX, mode, op0, inner_mode);
2361 op0 = simplify_gen_unary (FIX, mode, op0, inner_mode);
2363 else if (CONSTANT_P (op0)
2364 || GET_MODE_BITSIZE (mode) <= GET_MODE_BITSIZE (inner_mode))
2365 op0 = simplify_gen_subreg (mode, op0, inner_mode,
2366 subreg_lowpart_offset (mode,
2369 op0 = gen_rtx_ZERO_EXTEND (mode, op0);
2371 op0 = gen_rtx_SIGN_EXTEND (mode, op0);
2377 case ALIGN_INDIRECT_REF:
2378 case MISALIGNED_INDIRECT_REF:
2379 op0 = expand_debug_expr (TREE_OPERAND (exp, 0));
2383 if (POINTER_TYPE_P (TREE_TYPE (exp)))
2385 as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp)));
2386 address_mode = targetm.addr_space.address_mode (as);
2390 as = ADDR_SPACE_GENERIC;
2391 address_mode = Pmode;
2394 if (TREE_CODE (exp) == ALIGN_INDIRECT_REF)
2396 int align = TYPE_ALIGN_UNIT (TREE_TYPE (exp));
2397 op0 = gen_rtx_AND (address_mode, op0, GEN_INT (-align));
2400 op0 = gen_rtx_MEM (mode, op0);
2402 set_mem_attributes (op0, exp, 0);
2403 set_mem_addr_space (op0, as);
2407 case TARGET_MEM_REF:
2408 if (TMR_SYMBOL (exp) && !DECL_RTL_SET_P (TMR_SYMBOL (exp)))
2411 op0 = expand_debug_expr
2412 (tree_mem_ref_addr (build_pointer_type (TREE_TYPE (exp)), exp));
2416 as = TYPE_ADDR_SPACE (TREE_TYPE (exp));
2418 op0 = gen_rtx_MEM (mode, op0);
2420 set_mem_attributes (op0, exp, 0);
2421 set_mem_addr_space (op0, as);
2426 case ARRAY_RANGE_REF:
2431 case VIEW_CONVERT_EXPR:
2433 enum machine_mode mode1;
2434 HOST_WIDE_INT bitsize, bitpos;
2437 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
2438 &mode1, &unsignedp, &volatilep, false);
2444 orig_op0 = op0 = expand_debug_expr (tem);
2451 enum machine_mode addrmode, offmode;
2453 gcc_assert (MEM_P (op0));
2455 op0 = XEXP (op0, 0);
2456 addrmode = GET_MODE (op0);
2457 if (addrmode == VOIDmode)
2460 op1 = expand_debug_expr (offset);
2464 offmode = GET_MODE (op1);
2465 if (offmode == VOIDmode)
2466 offmode = TYPE_MODE (TREE_TYPE (offset));
2468 if (addrmode != offmode)
2469 op1 = simplify_gen_subreg (addrmode, op1, offmode,
2470 subreg_lowpart_offset (addrmode,
2473 /* Don't use offset_address here, we don't need a
2474 recognizable address, and we don't want to generate
2476 op0 = gen_rtx_MEM (mode, gen_rtx_PLUS (addrmode, op0, op1));
2481 if (mode1 == VOIDmode)
2483 mode1 = smallest_mode_for_size (bitsize, MODE_INT);
2484 if (bitpos >= BITS_PER_UNIT)
2486 op0 = adjust_address_nv (op0, mode1, bitpos / BITS_PER_UNIT);
2487 bitpos %= BITS_PER_UNIT;
2489 else if (bitpos < 0)
2492 = (-bitpos + BITS_PER_UNIT - 1) / BITS_PER_UNIT;
2493 op0 = adjust_address_nv (op0, mode1, units);
2494 bitpos += units * BITS_PER_UNIT;
2496 else if (bitpos == 0 && bitsize == GET_MODE_BITSIZE (mode))
2497 op0 = adjust_address_nv (op0, mode, 0);
2498 else if (GET_MODE (op0) != mode1)
2499 op0 = adjust_address_nv (op0, mode1, 0);
2501 op0 = copy_rtx (op0);
2502 if (op0 == orig_op0)
2503 op0 = shallow_copy_rtx (op0);
2504 set_mem_attributes (op0, exp, 0);
2507 if (bitpos == 0 && mode == GET_MODE (op0))
2513 if ((bitpos % BITS_PER_UNIT) == 0
2514 && bitsize == GET_MODE_BITSIZE (mode1))
2516 enum machine_mode opmode = GET_MODE (op0);
2518 gcc_assert (opmode != BLKmode);
2520 if (opmode == VOIDmode)
2523 /* This condition may hold if we're expanding the address
2524 right past the end of an array that turned out not to
2525 be addressable (i.e., the address was only computed in
2526 debug stmts). The gen_subreg below would rightfully
2527 crash, and the address doesn't really exist, so just
2529 if (bitpos >= GET_MODE_BITSIZE (opmode))
2532 return simplify_gen_subreg (mode, op0, opmode,
2533 bitpos / BITS_PER_UNIT);
2536 return simplify_gen_ternary (SCALAR_INT_MODE_P (GET_MODE (op0))
2537 && TYPE_UNSIGNED (TREE_TYPE (exp))
2539 : ZERO_EXTRACT, mode,
2540 GET_MODE (op0) != VOIDmode
2541 ? GET_MODE (op0) : mode1,
2542 op0, GEN_INT (bitsize), GEN_INT (bitpos));
2546 return gen_rtx_ABS (mode, op0);
2549 return gen_rtx_NEG (mode, op0);
2552 return gen_rtx_NOT (mode, op0);
2556 return gen_rtx_UNSIGNED_FLOAT (mode, op0);
2558 return gen_rtx_FLOAT (mode, op0);
2560 case FIX_TRUNC_EXPR:
2562 return gen_rtx_UNSIGNED_FIX (mode, op0);
2564 return gen_rtx_FIX (mode, op0);
2566 case POINTER_PLUS_EXPR:
2568 return gen_rtx_PLUS (mode, op0, op1);
2571 return gen_rtx_MINUS (mode, op0, op1);
2574 return gen_rtx_MULT (mode, op0, op1);
2577 case TRUNC_DIV_EXPR:
2578 case EXACT_DIV_EXPR:
2580 return gen_rtx_UDIV (mode, op0, op1);
2582 return gen_rtx_DIV (mode, op0, op1);
2584 case TRUNC_MOD_EXPR:
2586 return gen_rtx_UMOD (mode, op0, op1);
2588 return gen_rtx_MOD (mode, op0, op1);
2590 case FLOOR_DIV_EXPR:
2592 return gen_rtx_UDIV (mode, op0, op1);
2595 rtx div = gen_rtx_DIV (mode, op0, op1);
2596 rtx mod = gen_rtx_MOD (mode, op0, op1);
2597 rtx adj = floor_sdiv_adjust (mode, mod, op1);
2598 return gen_rtx_PLUS (mode, div, adj);
2601 case FLOOR_MOD_EXPR:
2603 return gen_rtx_UMOD (mode, op0, op1);
2606 rtx mod = gen_rtx_MOD (mode, op0, op1);
2607 rtx adj = floor_sdiv_adjust (mode, mod, op1);
2608 adj = gen_rtx_NEG (mode, gen_rtx_MULT (mode, adj, op1));
2609 return gen_rtx_PLUS (mode, mod, adj);
2615 rtx div = gen_rtx_UDIV (mode, op0, op1);
2616 rtx mod = gen_rtx_UMOD (mode, op0, op1);
2617 rtx adj = ceil_udiv_adjust (mode, mod, op1);
2618 return gen_rtx_PLUS (mode, div, adj);
2622 rtx div = gen_rtx_DIV (mode, op0, op1);
2623 rtx mod = gen_rtx_MOD (mode, op0, op1);
2624 rtx adj = ceil_sdiv_adjust (mode, mod, op1);
2625 return gen_rtx_PLUS (mode, div, adj);
2631 rtx mod = gen_rtx_UMOD (mode, op0, op1);
2632 rtx adj = ceil_udiv_adjust (mode, mod, op1);
2633 adj = gen_rtx_NEG (mode, gen_rtx_MULT (mode, adj, op1));
2634 return gen_rtx_PLUS (mode, mod, adj);
2638 rtx mod = gen_rtx_MOD (mode, op0, op1);
2639 rtx adj = ceil_sdiv_adjust (mode, mod, op1);
2640 adj = gen_rtx_NEG (mode, gen_rtx_MULT (mode, adj, op1));
2641 return gen_rtx_PLUS (mode, mod, adj);
2644 case ROUND_DIV_EXPR:
2647 rtx div = gen_rtx_UDIV (mode, op0, op1);
2648 rtx mod = gen_rtx_UMOD (mode, op0, op1);
2649 rtx adj = round_udiv_adjust (mode, mod, op1);
2650 return gen_rtx_PLUS (mode, div, adj);
2654 rtx div = gen_rtx_DIV (mode, op0, op1);
2655 rtx mod = gen_rtx_MOD (mode, op0, op1);
2656 rtx adj = round_sdiv_adjust (mode, mod, op1);
2657 return gen_rtx_PLUS (mode, div, adj);
2660 case ROUND_MOD_EXPR:
2663 rtx mod = gen_rtx_UMOD (mode, op0, op1);
2664 rtx adj = round_udiv_adjust (mode, mod, op1);
2665 adj = gen_rtx_NEG (mode, gen_rtx_MULT (mode, adj, op1));
2666 return gen_rtx_PLUS (mode, mod, adj);
2670 rtx mod = gen_rtx_MOD (mode, op0, op1);
2671 rtx adj = round_sdiv_adjust (mode, mod, op1);
2672 adj = gen_rtx_NEG (mode, gen_rtx_MULT (mode, adj, op1));
2673 return gen_rtx_PLUS (mode, mod, adj);
2677 return gen_rtx_ASHIFT (mode, op0, op1);
2681 return gen_rtx_LSHIFTRT (mode, op0, op1);
2683 return gen_rtx_ASHIFTRT (mode, op0, op1);
2686 return gen_rtx_ROTATE (mode, op0, op1);
2689 return gen_rtx_ROTATERT (mode, op0, op1);
2693 return gen_rtx_UMIN (mode, op0, op1);
2695 return gen_rtx_SMIN (mode, op0, op1);
2699 return gen_rtx_UMAX (mode, op0, op1);
2701 return gen_rtx_SMAX (mode, op0, op1);
2704 case TRUTH_AND_EXPR:
2705 return gen_rtx_AND (mode, op0, op1);
2709 return gen_rtx_IOR (mode, op0, op1);
2712 case TRUTH_XOR_EXPR:
2713 return gen_rtx_XOR (mode, op0, op1);
2715 case TRUTH_ANDIF_EXPR:
2716 return gen_rtx_IF_THEN_ELSE (mode, op0, op1, const0_rtx);
2718 case TRUTH_ORIF_EXPR:
2719 return gen_rtx_IF_THEN_ELSE (mode, op0, const_true_rtx, op1);
2721 case TRUTH_NOT_EXPR:
2722 return gen_rtx_EQ (mode, op0, const0_rtx);
2726 return gen_rtx_LTU (mode, op0, op1);
2728 return gen_rtx_LT (mode, op0, op1);
2732 return gen_rtx_LEU (mode, op0, op1);
2734 return gen_rtx_LE (mode, op0, op1);
2738 return gen_rtx_GTU (mode, op0, op1);
2740 return gen_rtx_GT (mode, op0, op1);
2744 return gen_rtx_GEU (mode, op0, op1);
2746 return gen_rtx_GE (mode, op0, op1);
2749 return gen_rtx_EQ (mode, op0, op1);
2752 return gen_rtx_NE (mode, op0, op1);
2754 case UNORDERED_EXPR:
2755 return gen_rtx_UNORDERED (mode, op0, op1);
2758 return gen_rtx_ORDERED (mode, op0, op1);
2761 return gen_rtx_UNLT (mode, op0, op1);
2764 return gen_rtx_UNLE (mode, op0, op1);
2767 return gen_rtx_UNGT (mode, op0, op1);
2770 return gen_rtx_UNGE (mode, op0, op1);
2773 return gen_rtx_UNEQ (mode, op0, op1);
2776 return gen_rtx_LTGT (mode, op0, op1);
2779 return gen_rtx_IF_THEN_ELSE (mode, op0, op1, op2);
2782 gcc_assert (COMPLEX_MODE_P (mode));
2783 if (GET_MODE (op0) == VOIDmode)
2784 op0 = gen_rtx_CONST (GET_MODE_INNER (mode), op0);
2785 if (GET_MODE (op1) == VOIDmode)
2786 op1 = gen_rtx_CONST (GET_MODE_INNER (mode), op1);
2787 return gen_rtx_CONCAT (mode, op0, op1);
2790 if (GET_CODE (op0) == CONCAT)
2791 return gen_rtx_CONCAT (mode, XEXP (op0, 0),
2792 gen_rtx_NEG (GET_MODE_INNER (mode),
2796 enum machine_mode imode = GET_MODE_INNER (mode);
2801 re = adjust_address_nv (op0, imode, 0);
2802 im = adjust_address_nv (op0, imode, GET_MODE_SIZE (imode));
2806 enum machine_mode ifmode = int_mode_for_mode (mode);
2807 enum machine_mode ihmode = int_mode_for_mode (imode);
2809 if (ifmode == BLKmode || ihmode == BLKmode)
2811 halfsize = GEN_INT (GET_MODE_BITSIZE (ihmode));
2814 re = gen_rtx_SUBREG (ifmode, re, 0);
2815 re = gen_rtx_ZERO_EXTRACT (ihmode, re, halfsize, const0_rtx);
2816 if (imode != ihmode)
2817 re = gen_rtx_SUBREG (imode, re, 0);
2818 im = copy_rtx (op0);
2820 im = gen_rtx_SUBREG (ifmode, im, 0);
2821 im = gen_rtx_ZERO_EXTRACT (ihmode, im, halfsize, halfsize);
2822 if (imode != ihmode)
2823 im = gen_rtx_SUBREG (imode, im, 0);
2825 im = gen_rtx_NEG (imode, im);
2826 return gen_rtx_CONCAT (mode, re, im);
2830 op0 = expand_debug_expr (TREE_OPERAND (exp, 0));
2831 if (!op0 || !MEM_P (op0))
2834 op0 = convert_debug_memory_address (mode, XEXP (op0, 0));
2839 exp = build_constructor_from_list (TREE_TYPE (exp),
2840 TREE_VECTOR_CST_ELTS (exp));
2844 if (TREE_CODE (TREE_TYPE (exp)) == VECTOR_TYPE)
2849 op0 = gen_rtx_CONCATN
2850 (mode, rtvec_alloc (TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp))));
2852 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), i, val)
2854 op1 = expand_debug_expr (val);
2857 XVECEXP (op0, 0, i) = op1;
2860 if (i < TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp)))
2862 op1 = expand_debug_expr
2863 (fold_convert (TREE_TYPE (TREE_TYPE (exp)), integer_zero_node));
2868 for (; i < TYPE_VECTOR_SUBPARTS (TREE_TYPE (exp)); i++)
2869 XVECEXP (op0, 0, i) = op1;
2875 goto flag_unsupported;
2878 /* ??? Maybe handle some builtins? */
2883 int part = var_to_partition (SA.map, exp);
2885 if (part == NO_PARTITION)
2888 gcc_assert (part >= 0 && (unsigned)part < SA.map->num_partitions);
2890 op0 = SA.partition_to_pseudo[part];
2899 #ifdef ENABLE_CHECKING
2908 /* Expand the _LOCs in debug insns. We run this after expanding all
2909 regular insns, so that any variables referenced in the function
2910 will have their DECL_RTLs set. */
2913 expand_debug_locations (void)
2916 rtx last = get_last_insn ();
2917 int save_strict_alias = flag_strict_aliasing;
2919 /* New alias sets while setting up memory attributes cause
2920 -fcompare-debug failures, even though it doesn't bring about any
2922 flag_strict_aliasing = 0;
2924 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
2925 if (DEBUG_INSN_P (insn))
2927 tree value = (tree)INSN_VAR_LOCATION_LOC (insn);
2929 enum machine_mode mode;
2931 if (value == NULL_TREE)
2935 val = expand_debug_expr (value);
2936 gcc_assert (last == get_last_insn ());
2940 val = gen_rtx_UNKNOWN_VAR_LOC ();
2943 mode = GET_MODE (INSN_VAR_LOCATION (insn));
2945 gcc_assert (mode == GET_MODE (val)
2946 || (GET_MODE (val) == VOIDmode
2947 && (CONST_INT_P (val)
2948 || GET_CODE (val) == CONST_FIXED
2949 || GET_CODE (val) == CONST_DOUBLE
2950 || GET_CODE (val) == LABEL_REF)));
2953 INSN_VAR_LOCATION_LOC (insn) = val;
2956 flag_strict_aliasing = save_strict_alias;
2959 /* Expand basic block BB from GIMPLE trees to RTL. */
2962 expand_gimple_basic_block (basic_block bb)
2964 gimple_stmt_iterator gsi;
2973 fprintf (dump_file, "\n;; Generating RTL for gimple basic block %d\n",
2976 /* Note that since we are now transitioning from GIMPLE to RTL, we
2977 cannot use the gsi_*_bb() routines because they expect the basic
2978 block to be in GIMPLE, instead of RTL. Therefore, we need to
2979 access the BB sequence directly. */
2980 stmts = bb_seq (bb);
2981 bb->il.gimple = NULL;
2982 rtl_profile_for_bb (bb);
2983 init_rtl_bb_info (bb);
2984 bb->flags |= BB_RTL;
2986 /* Remove the RETURN_EXPR if we may fall though to the exit
2988 gsi = gsi_last (stmts);
2989 if (!gsi_end_p (gsi)
2990 && gimple_code (gsi_stmt (gsi)) == GIMPLE_RETURN)
2992 gimple ret_stmt = gsi_stmt (gsi);
2994 gcc_assert (single_succ_p (bb));
2995 gcc_assert (single_succ (bb) == EXIT_BLOCK_PTR);
2997 if (bb->next_bb == EXIT_BLOCK_PTR
2998 && !gimple_return_retval (ret_stmt))
3000 gsi_remove (&gsi, false);
3001 single_succ_edge (bb)->flags |= EDGE_FALLTHRU;
3005 gsi = gsi_start (stmts);
3006 if (!gsi_end_p (gsi))
3008 stmt = gsi_stmt (gsi);
3009 if (gimple_code (stmt) != GIMPLE_LABEL)
3013 elt = pointer_map_contains (lab_rtx_for_bb, bb);
3017 last = get_last_insn ();
3021 expand_gimple_stmt (stmt);
3026 emit_label ((rtx) *elt);
3028 /* Java emits line number notes in the top of labels.
3029 ??? Make this go away once line number notes are obsoleted. */
3030 BB_HEAD (bb) = NEXT_INSN (last);
3031 if (NOTE_P (BB_HEAD (bb)))
3032 BB_HEAD (bb) = NEXT_INSN (BB_HEAD (bb));
3033 note = emit_note_after (NOTE_INSN_BASIC_BLOCK, BB_HEAD (bb));
3035 maybe_dump_rtl_for_gimple_stmt (stmt, last);
3038 note = BB_HEAD (bb) = emit_note (NOTE_INSN_BASIC_BLOCK);
3040 NOTE_BASIC_BLOCK (note) = bb;
3042 for (; !gsi_end_p (gsi); gsi_next (&gsi))
3046 stmt = gsi_stmt (gsi);
3047 currently_expanding_gimple_stmt = stmt;
3049 /* Expand this statement, then evaluate the resulting RTL and
3050 fixup the CFG accordingly. */
3051 if (gimple_code (stmt) == GIMPLE_COND)
3053 new_bb = expand_gimple_cond (bb, stmt);
3057 else if (gimple_debug_bind_p (stmt))
3059 location_t sloc = get_curr_insn_source_location ();
3060 tree sblock = get_curr_insn_block ();
3061 gimple_stmt_iterator nsi = gsi;
3065 tree var = gimple_debug_bind_get_var (stmt);
3068 enum machine_mode mode;
3070 if (gimple_debug_bind_has_value_p (stmt))
3071 value = gimple_debug_bind_get_value (stmt);
3075 last = get_last_insn ();
3077 set_curr_insn_source_location (gimple_location (stmt));
3078 set_curr_insn_block (gimple_block (stmt));
3081 mode = DECL_MODE (var);
3083 mode = TYPE_MODE (TREE_TYPE (var));
3085 val = gen_rtx_VAR_LOCATION
3086 (mode, var, (rtx)value, VAR_INIT_STATUS_INITIALIZED);
3088 val = emit_debug_insn (val);
3090 if (dump_file && (dump_flags & TDF_DETAILS))
3092 /* We can't dump the insn with a TREE where an RTX
3094 INSN_VAR_LOCATION_LOC (val) = const0_rtx;
3095 maybe_dump_rtl_for_gimple_stmt (stmt, last);
3096 INSN_VAR_LOCATION_LOC (val) = (rtx)value;
3101 if (gsi_end_p (nsi))
3103 stmt = gsi_stmt (nsi);
3104 if (!gimple_debug_bind_p (stmt))
3108 set_curr_insn_source_location (sloc);
3109 set_curr_insn_block (sblock);
3113 if (is_gimple_call (stmt) && gimple_call_tail_p (stmt))
3116 new_bb = expand_gimple_tailcall (bb, stmt, &can_fallthru);
3127 def_operand_p def_p;
3128 def_p = SINGLE_SSA_DEF_OPERAND (stmt, SSA_OP_DEF);
3132 /* Ignore this stmt if it is in the list of
3133 replaceable expressions. */
3135 && bitmap_bit_p (SA.values,
3136 SSA_NAME_VERSION (DEF_FROM_PTR (def_p))))
3139 last = expand_gimple_stmt (stmt);
3140 maybe_dump_rtl_for_gimple_stmt (stmt, last);
3145 currently_expanding_gimple_stmt = NULL;
3147 /* Expand implicit goto and convert goto_locus. */
3148 FOR_EACH_EDGE (e, ei, bb->succs)
3150 if (e->goto_locus && e->goto_block)
3152 set_curr_insn_source_location (e->goto_locus);
3153 set_curr_insn_block (e->goto_block);
3154 e->goto_locus = curr_insn_locator ();
3156 e->goto_block = NULL;
3157 if ((e->flags & EDGE_FALLTHRU) && e->dest != bb->next_bb)
3159 emit_jump (label_rtx_for_bb (e->dest));
3160 e->flags &= ~EDGE_FALLTHRU;
3164 /* Expanded RTL can create a jump in the last instruction of block.
3165 This later might be assumed to be a jump to successor and break edge insertion.
3166 We need to insert dummy move to prevent this. PR41440. */
3167 if (single_succ_p (bb)
3168 && (single_succ_edge (bb)->flags & EDGE_FALLTHRU)
3169 && (last = get_last_insn ())
3172 rtx dummy = gen_reg_rtx (SImode);
3173 emit_insn_after_noloc (gen_move_insn (dummy, dummy), last, NULL);
3176 do_pending_stack_adjust ();
3178 /* Find the block tail. The last insn in the block is the insn
3179 before a barrier and/or table jump insn. */
3180 last = get_last_insn ();
3181 if (BARRIER_P (last))
3182 last = PREV_INSN (last);
3183 if (JUMP_TABLE_DATA_P (last))
3184 last = PREV_INSN (PREV_INSN (last));
3187 update_bb_for_insn (bb);
3193 /* Create a basic block for initialization code. */
3196 construct_init_block (void)
3198 basic_block init_block, first_block;
3202 /* Multiple entry points not supported yet. */
3203 gcc_assert (EDGE_COUNT (ENTRY_BLOCK_PTR->succs) == 1);
3204 init_rtl_bb_info (ENTRY_BLOCK_PTR);
3205 init_rtl_bb_info (EXIT_BLOCK_PTR);
3206 ENTRY_BLOCK_PTR->flags |= BB_RTL;
3207 EXIT_BLOCK_PTR->flags |= BB_RTL;
3209 e = EDGE_SUCC (ENTRY_BLOCK_PTR, 0);
3211 /* When entry edge points to first basic block, we don't need jump,
3212 otherwise we have to jump into proper target. */
3213 if (e && e->dest != ENTRY_BLOCK_PTR->next_bb)
3215 tree label = gimple_block_label (e->dest);
3217 emit_jump (label_rtx (label));
3221 flags = EDGE_FALLTHRU;
3223 init_block = create_basic_block (NEXT_INSN (get_insns ()),
3226 init_block->frequency = ENTRY_BLOCK_PTR->frequency;
3227 init_block->count = ENTRY_BLOCK_PTR->count;
3230 first_block = e->dest;
3231 redirect_edge_succ (e, init_block);
3232 e = make_edge (init_block, first_block, flags);
3235 e = make_edge (init_block, EXIT_BLOCK_PTR, EDGE_FALLTHRU);
3236 e->probability = REG_BR_PROB_BASE;
3237 e->count = ENTRY_BLOCK_PTR->count;
3239 update_bb_for_insn (init_block);
3243 /* For each lexical block, set BLOCK_NUMBER to the depth at which it is
3244 found in the block tree. */
3247 set_block_levels (tree block, int level)
3251 BLOCK_NUMBER (block) = level;
3252 set_block_levels (BLOCK_SUBBLOCKS (block), level + 1);
3253 block = BLOCK_CHAIN (block);
3257 /* Create a block containing landing pads and similar stuff. */
3260 construct_exit_block (void)
3262 rtx head = get_last_insn ();
3264 basic_block exit_block;
3268 rtx orig_end = BB_END (EXIT_BLOCK_PTR->prev_bb);
3270 rtl_profile_for_bb (EXIT_BLOCK_PTR);
3272 /* Make sure the locus is set to the end of the function, so that
3273 epilogue line numbers and warnings are set properly. */
3274 if (cfun->function_end_locus != UNKNOWN_LOCATION)
3275 input_location = cfun->function_end_locus;
3277 /* The following insns belong to the top scope. */
3278 set_curr_insn_block (DECL_INITIAL (current_function_decl));
3280 /* Generate rtl for function exit. */
3281 expand_function_end ();
3283 end = get_last_insn ();
3286 /* While emitting the function end we could move end of the last basic block.
3288 BB_END (EXIT_BLOCK_PTR->prev_bb) = orig_end;
3289 while (NEXT_INSN (head) && NOTE_P (NEXT_INSN (head)))
3290 head = NEXT_INSN (head);
3291 exit_block = create_basic_block (NEXT_INSN (head), end,
3292 EXIT_BLOCK_PTR->prev_bb);
3293 exit_block->frequency = EXIT_BLOCK_PTR->frequency;
3294 exit_block->count = EXIT_BLOCK_PTR->count;
3297 while (ix < EDGE_COUNT (EXIT_BLOCK_PTR->preds))
3299 e = EDGE_PRED (EXIT_BLOCK_PTR, ix);
3300 if (!(e->flags & EDGE_ABNORMAL))
3301 redirect_edge_succ (e, exit_block);
3306 e = make_edge (exit_block, EXIT_BLOCK_PTR, EDGE_FALLTHRU);
3307 e->probability = REG_BR_PROB_BASE;
3308 e->count = EXIT_BLOCK_PTR->count;
3309 FOR_EACH_EDGE (e2, ei, EXIT_BLOCK_PTR->preds)
3312 e->count -= e2->count;
3313 exit_block->count -= e2->count;
3314 exit_block->frequency -= EDGE_FREQUENCY (e2);
3318 if (exit_block->count < 0)
3319 exit_block->count = 0;
3320 if (exit_block->frequency < 0)
3321 exit_block->frequency = 0;
3322 update_bb_for_insn (exit_block);
3325 /* Helper function for discover_nonconstant_array_refs.
3326 Look for ARRAY_REF nodes with non-constant indexes and mark them
3330 discover_nonconstant_array_refs_r (tree * tp, int *walk_subtrees,
3331 void *data ATTRIBUTE_UNUSED)
3335 if (IS_TYPE_OR_DECL_P (t))
3337 else if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
3339 while (((TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
3340 && is_gimple_min_invariant (TREE_OPERAND (t, 1))
3341 && (!TREE_OPERAND (t, 2)
3342 || is_gimple_min_invariant (TREE_OPERAND (t, 2))))
3343 || (TREE_CODE (t) == COMPONENT_REF
3344 && (!TREE_OPERAND (t,2)
3345 || is_gimple_min_invariant (TREE_OPERAND (t, 2))))
3346 || TREE_CODE (t) == BIT_FIELD_REF
3347 || TREE_CODE (t) == REALPART_EXPR
3348 || TREE_CODE (t) == IMAGPART_EXPR
3349 || TREE_CODE (t) == VIEW_CONVERT_EXPR
3350 || CONVERT_EXPR_P (t))
3351 t = TREE_OPERAND (t, 0);
3353 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
3355 t = get_base_address (t);
3357 && DECL_MODE (t) != BLKmode)
3358 TREE_ADDRESSABLE (t) = 1;
3367 /* RTL expansion is not able to compile array references with variable
3368 offsets for arrays stored in single register. Discover such
3369 expressions and mark variables as addressable to avoid this
3373 discover_nonconstant_array_refs (void)
3376 gimple_stmt_iterator gsi;
3379 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
3381 gimple stmt = gsi_stmt (gsi);
3382 walk_gimple_op (stmt, discover_nonconstant_array_refs_r, NULL);
3386 /* This function sets crtl->args.internal_arg_pointer to a virtual
3387 register if DRAP is needed. Local register allocator will replace
3388 virtual_incoming_args_rtx with the virtual register. */
3391 expand_stack_alignment (void)
3394 unsigned int preferred_stack_boundary;
3396 if (! SUPPORTS_STACK_ALIGNMENT)
3399 if (cfun->calls_alloca
3400 || cfun->has_nonlocal_label
3401 || crtl->has_nonlocal_goto)
3402 crtl->need_drap = true;
3404 /* Call update_stack_boundary here again to update incoming stack
3405 boundary. It may set incoming stack alignment to a different
3406 value after RTL expansion. TARGET_FUNCTION_OK_FOR_SIBCALL may
3407 use the minimum incoming stack alignment to check if it is OK
3408 to perform sibcall optimization since sibcall optimization will
3409 only align the outgoing stack to incoming stack boundary. */
3410 if (targetm.calls.update_stack_boundary)
3411 targetm.calls.update_stack_boundary ();
3413 /* The incoming stack frame has to be aligned at least at
3414 parm_stack_boundary. */
3415 gcc_assert (crtl->parm_stack_boundary <= INCOMING_STACK_BOUNDARY);
3417 /* Update crtl->stack_alignment_estimated and use it later to align
3418 stack. We check PREFERRED_STACK_BOUNDARY if there may be non-call
3419 exceptions since callgraph doesn't collect incoming stack alignment
3421 if (flag_non_call_exceptions
3422 && PREFERRED_STACK_BOUNDARY > crtl->preferred_stack_boundary)
3423 preferred_stack_boundary = PREFERRED_STACK_BOUNDARY;
3425 preferred_stack_boundary = crtl->preferred_stack_boundary;
3426 if (preferred_stack_boundary > crtl->stack_alignment_estimated)
3427 crtl->stack_alignment_estimated = preferred_stack_boundary;
3428 if (preferred_stack_boundary > crtl->stack_alignment_needed)
3429 crtl->stack_alignment_needed = preferred_stack_boundary;
3431 gcc_assert (crtl->stack_alignment_needed
3432 <= crtl->stack_alignment_estimated);
3434 crtl->stack_realign_needed
3435 = INCOMING_STACK_BOUNDARY < crtl->stack_alignment_estimated;
3436 crtl->stack_realign_tried = crtl->stack_realign_needed;
3438 crtl->stack_realign_processed = true;
3440 /* Target has to redefine TARGET_GET_DRAP_RTX to support stack
3442 gcc_assert (targetm.calls.get_drap_rtx != NULL);
3443 drap_rtx = targetm.calls.get_drap_rtx ();
3445 /* stack_realign_drap and drap_rtx must match. */
3446 gcc_assert ((stack_realign_drap != 0) == (drap_rtx != NULL));
3448 /* Do nothing if NULL is returned, which means DRAP is not needed. */
3449 if (NULL != drap_rtx)
3451 crtl->args.internal_arg_pointer = drap_rtx;
3453 /* Call fixup_tail_calls to clean up REG_EQUIV note if DRAP is
3455 fixup_tail_calls ();
3459 /* Translate the intermediate representation contained in the CFG
3460 from GIMPLE trees to RTL.
3462 We do conversion per basic block and preserve/update the tree CFG.
3463 This implies we have to do some magic as the CFG can simultaneously
3464 consist of basic blocks containing RTL and GIMPLE trees. This can
3465 confuse the CFG hooks, so be careful to not manipulate CFG during
3469 gimple_expand_cfg (void)
3471 basic_block bb, init_block;
3477 rewrite_out_of_ssa (&SA);
3478 SA.partition_to_pseudo = (rtx *)xcalloc (SA.map->num_partitions,
3481 /* Some backends want to know that we are expanding to RTL. */
3482 currently_expanding_to_rtl = 1;
3484 rtl_profile_for_bb (ENTRY_BLOCK_PTR);
3486 insn_locators_alloc ();
3487 if (!DECL_IS_BUILTIN (current_function_decl))
3489 /* Eventually, all FEs should explicitly set function_start_locus. */
3490 if (cfun->function_start_locus == UNKNOWN_LOCATION)
3491 set_curr_insn_source_location
3492 (DECL_SOURCE_LOCATION (current_function_decl));
3494 set_curr_insn_source_location (cfun->function_start_locus);
3496 set_curr_insn_block (DECL_INITIAL (current_function_decl));
3497 prologue_locator = curr_insn_locator ();
3499 /* Make sure first insn is a note even if we don't want linenums.
3500 This makes sure the first insn will never be deleted.
3501 Also, final expects a note to appear there. */
3502 emit_note (NOTE_INSN_DELETED);
3504 /* Mark arrays indexed with non-constant indices with TREE_ADDRESSABLE. */
3505 discover_nonconstant_array_refs ();
3507 targetm.expand_to_rtl_hook ();
3508 crtl->stack_alignment_needed = STACK_BOUNDARY;
3509 crtl->max_used_stack_slot_alignment = STACK_BOUNDARY;
3510 crtl->stack_alignment_estimated = 0;
3511 crtl->preferred_stack_boundary = STACK_BOUNDARY;
3512 cfun->cfg->max_jumptable_ents = 0;
3515 /* Expand the variables recorded during gimple lowering. */
3516 expand_used_vars ();
3518 /* Honor stack protection warnings. */
3519 if (warn_stack_protect)
3521 if (cfun->calls_alloca)
3522 warning (OPT_Wstack_protector,
3523 "not protecting local variables: variable length buffer");
3524 if (has_short_buffer && !crtl->stack_protect_guard)
3525 warning (OPT_Wstack_protector,
3526 "not protecting function: no buffer at least %d bytes long",
3527 (int) PARAM_VALUE (PARAM_SSP_BUFFER_SIZE));
3530 /* Set up parameters and prepare for return, for the function. */
3531 expand_function_start (current_function_decl);
3533 /* Now that we also have the parameter RTXs, copy them over to our
3535 for (i = 0; i < SA.map->num_partitions; i++)
3537 tree var = SSA_NAME_VAR (partition_to_var (SA.map, i));
3539 if (TREE_CODE (var) != VAR_DECL
3540 && !SA.partition_to_pseudo[i])
3541 SA.partition_to_pseudo[i] = DECL_RTL_IF_SET (var);
3542 gcc_assert (SA.partition_to_pseudo[i]);
3544 /* If this decl was marked as living in multiple places, reset
3545 this now to NULL. */
3546 if (DECL_RTL_IF_SET (var) == pc_rtx)
3547 SET_DECL_RTL (var, NULL);
3549 /* Some RTL parts really want to look at DECL_RTL(x) when x
3550 was a decl marked in REG_ATTR or MEM_ATTR. We could use
3551 SET_DECL_RTL here making this available, but that would mean
3552 to select one of the potentially many RTLs for one DECL. Instead
3553 of doing that we simply reset the MEM_EXPR of the RTL in question,
3554 then nobody can get at it and hence nobody can call DECL_RTL on it. */
3555 if (!DECL_RTL_SET_P (var))
3557 if (MEM_P (SA.partition_to_pseudo[i]))
3558 set_mem_expr (SA.partition_to_pseudo[i], NULL);
3562 /* If this function is `main', emit a call to `__main'
3563 to run global initializers, etc. */
3564 if (DECL_NAME (current_function_decl)
3565 && MAIN_NAME_P (DECL_NAME (current_function_decl))
3566 && DECL_FILE_SCOPE_P (current_function_decl))
3567 expand_main_function ();
3569 /* Initialize the stack_protect_guard field. This must happen after the
3570 call to __main (if any) so that the external decl is initialized. */
3571 if (crtl->stack_protect_guard)
3572 stack_protect_prologue ();
3574 expand_phi_nodes (&SA);
3576 /* Register rtl specific functions for cfg. */
3577 rtl_register_cfg_hooks ();
3579 init_block = construct_init_block ();
3581 /* Clear EDGE_EXECUTABLE on the entry edge(s). It is cleaned from the
3582 remaining edges later. */
3583 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
3584 e->flags &= ~EDGE_EXECUTABLE;
3586 lab_rtx_for_bb = pointer_map_create ();
3587 FOR_BB_BETWEEN (bb, init_block->next_bb, EXIT_BLOCK_PTR, next_bb)
3588 bb = expand_gimple_basic_block (bb);
3590 if (MAY_HAVE_DEBUG_INSNS)
3591 expand_debug_locations ();
3593 execute_free_datastructures ();
3594 finish_out_of_ssa (&SA);
3596 /* Expansion is used by optimization passes too, set maybe_hot_insn_p
3597 conservatively to true until they are all profile aware. */
3598 pointer_map_destroy (lab_rtx_for_bb);
3601 construct_exit_block ();
3602 set_curr_insn_block (DECL_INITIAL (current_function_decl));
3603 insn_locators_finalize ();
3605 /* Zap the tree EH table. */
3606 set_eh_throw_stmt_table (cfun, NULL);
3608 rebuild_jump_labels (get_insns ());
3610 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb)
3614 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
3617 commit_one_edge_insertion (e);
3623 /* We're done expanding trees to RTL. */
3624 currently_expanding_to_rtl = 0;
3626 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR->next_bb, EXIT_BLOCK_PTR, next_bb)
3630 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
3632 /* Clear EDGE_EXECUTABLE. This flag is never used in the backend. */
3633 e->flags &= ~EDGE_EXECUTABLE;
3635 /* At the moment not all abnormal edges match the RTL
3636 representation. It is safe to remove them here as
3637 find_many_sub_basic_blocks will rediscover them.
3638 In the future we should get this fixed properly. */
3639 if ((e->flags & EDGE_ABNORMAL)
3640 && !(e->flags & EDGE_SIBCALL))
3647 blocks = sbitmap_alloc (last_basic_block);
3648 sbitmap_ones (blocks);
3649 find_many_sub_basic_blocks (blocks);
3650 sbitmap_free (blocks);
3651 purge_all_dead_edges ();
3655 expand_stack_alignment ();
3657 #ifdef ENABLE_CHECKING
3658 verify_flow_info ();
3661 /* There's no need to defer outputting this function any more; we
3662 know we want to output it. */
3663 DECL_DEFER_OUTPUT (current_function_decl) = 0;
3665 /* Now that we're done expanding trees to RTL, we shouldn't have any
3666 more CONCATs anywhere. */
3667 generating_concat_p = 0;
3672 "\n\n;;\n;; Full RTL generated for this function:\n;;\n");
3673 /* And the pass manager will dump RTL for us. */
3676 /* If we're emitting a nested function, make sure its parent gets
3677 emitted as well. Doing otherwise confuses debug info. */
3680 for (parent = DECL_CONTEXT (current_function_decl);
3681 parent != NULL_TREE;
3682 parent = get_containing_scope (parent))
3683 if (TREE_CODE (parent) == FUNCTION_DECL)
3684 TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (parent)) = 1;
3687 /* We are now committed to emitting code for this function. Do any
3688 preparation, such as emitting abstract debug info for the inline
3689 before it gets mangled by optimization. */
3690 if (cgraph_function_possibly_inlined_p (current_function_decl))
3691 (*debug_hooks->outlining_inline_function) (current_function_decl);
3693 TREE_ASM_WRITTEN (current_function_decl) = 1;
3695 /* After expanding, the return labels are no longer needed. */
3696 return_label = NULL;
3697 naked_return_label = NULL;
3698 /* Tag the blocks with a depth number so that change_scope can find
3699 the common parent easily. */
3700 set_block_levels (DECL_INITIAL (cfun->decl), 0);
3701 default_rtl_profile ();
3705 struct rtl_opt_pass pass_expand =
3709 "expand", /* name */
3711 gimple_expand_cfg, /* execute */
3714 0, /* static_pass_number */
3715 TV_EXPAND, /* tv_id */
3716 PROP_ssa | PROP_gimple_leh | PROP_cfg,/* properties_required */
3717 PROP_rtl, /* properties_provided */
3718 PROP_ssa | PROP_trees, /* properties_destroyed */
3719 TODO_verify_ssa | TODO_verify_flow
3720 | TODO_verify_stmts, /* todo_flags_start */
3722 | TODO_ggc_collect /* todo_flags_finish */