1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This is the final pass of the compiler.
23 It looks at the rtl code for a function and outputs assembler code.
25 Call `final_start_function' to output the assembler code for function entry,
26 `final' to output assembler code for some RTL code,
27 `final_end_function' to output assembler code for function exit.
28 If a function is compiled in several pieces, each piece is
29 output separately with `final'.
31 Some optimizations are also done at this level.
32 Move instructions that were made unnecessary by good register allocation
33 are detected and omitted from the output. (Though most of these
34 are removed by the last jump pass.)
36 Instructions to set the condition codes are omitted when it can be
37 seen that the condition codes already had the desired values.
39 In some cases it is sufficient if the inherited condition codes
40 have related values, but this may require the following insn
41 (the one that tests the condition codes) to be modified.
43 The code for the function prologue and epilogue are generated
44 directly in assembler by the target functions function_prologue and
45 function_epilogue. Those instructions never exist as rtl. */
49 #include "coretypes.h"
56 #include "insn-config.h"
57 #include "insn-attr.h"
59 #include "conditions.h"
61 #include "hard-reg-set.h"
65 #include "rtl-error.h"
66 #include "toplev.h" /* exact_log2, floor_log2 */
69 #include "basic-block.h"
73 #include "cfglayout.h"
74 #include "tree-pass.h"
75 #include "tree-flow.h"
85 #ifdef XCOFF_DEBUGGING_INFO
86 #include "xcoffout.h" /* Needed for external data
87 declarations for e.g. AIX 4.x. */
90 #include "dwarf2out.h"
92 #ifdef DBX_DEBUGGING_INFO
96 #ifdef SDB_DEBUGGING_INFO
100 /* Most ports that aren't using cc0 don't need to define CC_STATUS_INIT.
101 So define a null default for it to save conditionalization later. */
102 #ifndef CC_STATUS_INIT
103 #define CC_STATUS_INIT
106 /* How to start an assembler comment. */
107 #ifndef ASM_COMMENT_START
108 #define ASM_COMMENT_START ";#"
111 /* Is the given character a logical line separator for the assembler? */
112 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
113 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C, STR) ((C) == ';')
116 #ifndef JUMP_TABLES_IN_TEXT_SECTION
117 #define JUMP_TABLES_IN_TEXT_SECTION 0
120 /* Bitflags used by final_scan_insn. */
123 #define SEEN_EMITTED 4
125 /* Last insn processed by final_scan_insn. */
126 static rtx debug_insn
;
127 rtx current_output_insn
;
129 /* Line number of last NOTE. */
130 static int last_linenum
;
132 /* Last discriminator written to assembly. */
133 static int last_discriminator
;
135 /* Discriminator of current block. */
136 static int discriminator
;
138 /* Highest line number in current block. */
139 static int high_block_linenum
;
141 /* Likewise for function. */
142 static int high_function_linenum
;
144 /* Filename of last NOTE. */
145 static const char *last_filename
;
147 /* Override filename and line number. */
148 static const char *override_filename
;
149 static int override_linenum
;
151 /* Whether to force emission of a line note before the next insn. */
152 static bool force_source_line
= false;
154 extern const int length_unit_log
; /* This is defined in insn-attrtab.c. */
156 /* Nonzero while outputting an `asm' with operands.
157 This means that inconsistencies are the user's fault, so don't die.
158 The precise value is the insn being output, to pass to error_for_asm. */
159 rtx this_is_asm_operands
;
161 /* Number of operands of this insn, for an `asm' with operands. */
162 static unsigned int insn_noperands
;
164 /* Compare optimization flag. */
166 static rtx last_ignored_compare
= 0;
168 /* Assign a unique number to each insn that is output.
169 This can be used to generate unique local labels. */
171 static int insn_counter
= 0;
174 /* This variable contains machine-dependent flags (defined in tm.h)
175 set and examined by output routines
176 that describe how to interpret the condition codes properly. */
180 /* During output of an insn, this contains a copy of cc_status
181 from before the insn. */
183 CC_STATUS cc_prev_status
;
186 /* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen. */
188 static int block_depth
;
190 /* Nonzero if have enabled APP processing of our assembler output. */
194 /* If we are outputting an insn sequence, this contains the sequence rtx.
199 #ifdef ASSEMBLER_DIALECT
201 /* Number of the assembler dialect to use, starting at 0. */
202 static int dialect_number
;
205 /* Nonnull if the insn currently being emitted was a COND_EXEC pattern. */
206 rtx current_insn_predicate
;
208 /* True if printing into -fdump-final-insns= dump. */
209 bool final_insns_dump_p
;
211 #ifdef HAVE_ATTR_length
212 static int asm_insn_count (rtx
);
214 static void profile_function (FILE *);
215 static void profile_after_prologue (FILE *);
216 static bool notice_source_line (rtx
, bool *);
217 static rtx
walk_alter_subreg (rtx
*, bool *);
218 static void output_asm_name (void);
219 static void output_alternate_entry_point (FILE *, rtx
);
220 static tree
get_mem_expr_from_op (rtx
, int *);
221 static void output_asm_operand_names (rtx
*, int *, int);
222 #ifdef LEAF_REGISTERS
223 static void leaf_renumber_regs (rtx
);
226 static int alter_cond (rtx
);
228 #ifndef ADDR_VEC_ALIGN
229 static int final_addr_vec_align (rtx
);
231 #ifdef HAVE_ATTR_length
232 static int align_fuzz (rtx
, rtx
, int, unsigned);
235 /* Initialize data in final at the beginning of a compilation. */
238 init_final (const char *filename ATTRIBUTE_UNUSED
)
243 #ifdef ASSEMBLER_DIALECT
244 dialect_number
= ASSEMBLER_DIALECT
;
248 /* Default target function prologue and epilogue assembler output.
250 If not overridden for epilogue code, then the function body itself
251 contains return instructions wherever needed. */
253 default_function_pro_epilogue (FILE *file ATTRIBUTE_UNUSED
,
254 HOST_WIDE_INT size ATTRIBUTE_UNUSED
)
258 /* Default target hook that outputs nothing to a stream. */
260 no_asm_to_stream (FILE *file ATTRIBUTE_UNUSED
)
264 /* Enable APP processing of subsequent output.
265 Used before the output from an `asm' statement. */
272 fputs (ASM_APP_ON
, asm_out_file
);
277 /* Disable APP processing of subsequent output.
278 Called from varasm.c before most kinds of output. */
285 fputs (ASM_APP_OFF
, asm_out_file
);
290 /* Return the number of slots filled in the current
291 delayed branch sequence (we don't count the insn needing the
292 delay slot). Zero if not in a delayed branch sequence. */
296 dbr_sequence_length (void)
298 if (final_sequence
!= 0)
299 return XVECLEN (final_sequence
, 0) - 1;
305 /* The next two pages contain routines used to compute the length of an insn
306 and to shorten branches. */
308 /* Arrays for insn lengths, and addresses. The latter is referenced by
309 `insn_current_length'. */
311 static int *insn_lengths
;
313 VEC(int,heap
) *insn_addresses_
;
315 /* Max uid for which the above arrays are valid. */
316 static int insn_lengths_max_uid
;
318 /* Address of insn being processed. Used by `insn_current_length'. */
319 int insn_current_address
;
321 /* Address of insn being processed in previous iteration. */
322 int insn_last_address
;
324 /* known invariant alignment of insn being processed. */
325 int insn_current_align
;
327 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
328 gives the next following alignment insn that increases the known
329 alignment, or NULL_RTX if there is no such insn.
330 For any alignment obtained this way, we can again index uid_align with
331 its uid to obtain the next following align that in turn increases the
332 alignment, till we reach NULL_RTX; the sequence obtained this way
333 for each insn we'll call the alignment chain of this insn in the following
336 struct label_alignment
342 static rtx
*uid_align
;
343 static int *uid_shuid
;
344 static struct label_alignment
*label_align
;
346 /* Indicate that branch shortening hasn't yet been done. */
349 init_insn_lengths (void)
360 insn_lengths_max_uid
= 0;
362 #ifdef HAVE_ATTR_length
363 INSN_ADDRESSES_FREE ();
372 /* Obtain the current length of an insn. If branch shortening has been done,
373 get its actual length. Otherwise, use FALLBACK_FN to calculate the
376 get_attr_length_1 (rtx insn ATTRIBUTE_UNUSED
,
377 int (*fallback_fn
) (rtx
) ATTRIBUTE_UNUSED
)
379 #ifdef HAVE_ATTR_length
384 if (insn_lengths_max_uid
> INSN_UID (insn
))
385 return insn_lengths
[INSN_UID (insn
)];
387 switch (GET_CODE (insn
))
396 length
= fallback_fn (insn
);
400 body
= PATTERN (insn
);
401 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
403 /* Alignment is machine-dependent and should be handled by
407 length
= fallback_fn (insn
);
411 body
= PATTERN (insn
);
412 if (GET_CODE (body
) == USE
|| GET_CODE (body
) == CLOBBER
)
415 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
416 length
= asm_insn_count (body
) * fallback_fn (insn
);
417 else if (GET_CODE (body
) == SEQUENCE
)
418 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
419 length
+= get_attr_length_1 (XVECEXP (body
, 0, i
), fallback_fn
);
421 length
= fallback_fn (insn
);
428 #ifdef ADJUST_INSN_LENGTH
429 ADJUST_INSN_LENGTH (insn
, length
);
432 #else /* not HAVE_ATTR_length */
434 #define insn_default_length 0
435 #define insn_min_length 0
436 #endif /* not HAVE_ATTR_length */
439 /* Obtain the current length of an insn. If branch shortening has been done,
440 get its actual length. Otherwise, get its maximum length. */
442 get_attr_length (rtx insn
)
444 return get_attr_length_1 (insn
, insn_default_length
);
447 /* Obtain the current length of an insn. If branch shortening has been done,
448 get its actual length. Otherwise, get its minimum length. */
450 get_attr_min_length (rtx insn
)
452 return get_attr_length_1 (insn
, insn_min_length
);
455 /* Code to handle alignment inside shorten_branches. */
457 /* Here is an explanation how the algorithm in align_fuzz can give
460 Call a sequence of instructions beginning with alignment point X
461 and continuing until the next alignment point `block X'. When `X'
462 is used in an expression, it means the alignment value of the
465 Call the distance between the start of the first insn of block X, and
466 the end of the last insn of block X `IX', for the `inner size of X'.
467 This is clearly the sum of the instruction lengths.
469 Likewise with the next alignment-delimited block following X, which we
472 Call the distance between the start of the first insn of block X, and
473 the start of the first insn of block Y `OX', for the `outer size of X'.
475 The estimated padding is then OX - IX.
477 OX can be safely estimated as
482 OX = round_up(IX, X) + Y - X
484 Clearly est(IX) >= real(IX), because that only depends on the
485 instruction lengths, and those being overestimated is a given.
487 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
488 we needn't worry about that when thinking about OX.
490 When X >= Y, the alignment provided by Y adds no uncertainty factor
491 for branch ranges starting before X, so we can just round what we have.
492 But when X < Y, we don't know anything about the, so to speak,
493 `middle bits', so we have to assume the worst when aligning up from an
494 address mod X to one mod Y, which is Y - X. */
497 #define LABEL_ALIGN(LABEL) align_labels_log
500 #ifndef LABEL_ALIGN_MAX_SKIP
501 #define LABEL_ALIGN_MAX_SKIP align_labels_max_skip
505 #define LOOP_ALIGN(LABEL) align_loops_log
508 #ifndef LOOP_ALIGN_MAX_SKIP
509 #define LOOP_ALIGN_MAX_SKIP align_loops_max_skip
512 #ifndef LABEL_ALIGN_AFTER_BARRIER
513 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
516 #ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
517 #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP 0
521 #define JUMP_ALIGN(LABEL) align_jumps_log
524 #ifndef JUMP_ALIGN_MAX_SKIP
525 #define JUMP_ALIGN_MAX_SKIP align_jumps_max_skip
528 #ifndef ADDR_VEC_ALIGN
530 final_addr_vec_align (rtx addr_vec
)
532 int align
= GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec
)));
534 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
535 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
536 return exact_log2 (align
);
540 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
543 #ifndef INSN_LENGTH_ALIGNMENT
544 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
547 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
549 static int min_labelno
, max_labelno
;
551 #define LABEL_TO_ALIGNMENT(LABEL) \
552 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
554 #define LABEL_TO_MAX_SKIP(LABEL) \
555 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
557 /* For the benefit of port specific code do this also as a function. */
560 label_to_alignment (rtx label
)
562 if (CODE_LABEL_NUMBER (label
) <= max_labelno
)
563 return LABEL_TO_ALIGNMENT (label
);
568 label_to_max_skip (rtx label
)
570 if (CODE_LABEL_NUMBER (label
) <= max_labelno
)
571 return LABEL_TO_MAX_SKIP (label
);
575 #ifdef HAVE_ATTR_length
576 /* The differences in addresses
577 between a branch and its target might grow or shrink depending on
578 the alignment the start insn of the range (the branch for a forward
579 branch or the label for a backward branch) starts out on; if these
580 differences are used naively, they can even oscillate infinitely.
581 We therefore want to compute a 'worst case' address difference that
582 is independent of the alignment the start insn of the range end
583 up on, and that is at least as large as the actual difference.
584 The function align_fuzz calculates the amount we have to add to the
585 naively computed difference, by traversing the part of the alignment
586 chain of the start insn of the range that is in front of the end insn
587 of the range, and considering for each alignment the maximum amount
588 that it might contribute to a size increase.
590 For casesi tables, we also want to know worst case minimum amounts of
591 address difference, in case a machine description wants to introduce
592 some common offset that is added to all offsets in a table.
593 For this purpose, align_fuzz with a growth argument of 0 computes the
594 appropriate adjustment. */
596 /* Compute the maximum delta by which the difference of the addresses of
597 START and END might grow / shrink due to a different address for start
598 which changes the size of alignment insns between START and END.
599 KNOWN_ALIGN_LOG is the alignment known for START.
600 GROWTH should be ~0 if the objective is to compute potential code size
601 increase, and 0 if the objective is to compute potential shrink.
602 The return value is undefined for any other value of GROWTH. */
605 align_fuzz (rtx start
, rtx end
, int known_align_log
, unsigned int growth
)
607 int uid
= INSN_UID (start
);
609 int known_align
= 1 << known_align_log
;
610 int end_shuid
= INSN_SHUID (end
);
613 for (align_label
= uid_align
[uid
]; align_label
; align_label
= uid_align
[uid
])
615 int align_addr
, new_align
;
617 uid
= INSN_UID (align_label
);
618 align_addr
= INSN_ADDRESSES (uid
) - insn_lengths
[uid
];
619 if (uid_shuid
[uid
] > end_shuid
)
621 known_align_log
= LABEL_TO_ALIGNMENT (align_label
);
622 new_align
= 1 << known_align_log
;
623 if (new_align
< known_align
)
625 fuzz
+= (-align_addr
^ growth
) & (new_align
- known_align
);
626 known_align
= new_align
;
631 /* Compute a worst-case reference address of a branch so that it
632 can be safely used in the presence of aligned labels. Since the
633 size of the branch itself is unknown, the size of the branch is
634 not included in the range. I.e. for a forward branch, the reference
635 address is the end address of the branch as known from the previous
636 branch shortening pass, minus a value to account for possible size
637 increase due to alignment. For a backward branch, it is the start
638 address of the branch as known from the current pass, plus a value
639 to account for possible size increase due to alignment.
640 NB.: Therefore, the maximum offset allowed for backward branches needs
641 to exclude the branch size. */
644 insn_current_reference_address (rtx branch
)
649 if (! INSN_ADDRESSES_SET_P ())
652 seq
= NEXT_INSN (PREV_INSN (branch
));
653 seq_uid
= INSN_UID (seq
);
654 if (!JUMP_P (branch
))
655 /* This can happen for example on the PA; the objective is to know the
656 offset to address something in front of the start of the function.
657 Thus, we can treat it like a backward branch.
658 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
659 any alignment we'd encounter, so we skip the call to align_fuzz. */
660 return insn_current_address
;
661 dest
= JUMP_LABEL (branch
);
663 /* BRANCH has no proper alignment chain set, so use SEQ.
664 BRANCH also has no INSN_SHUID. */
665 if (INSN_SHUID (seq
) < INSN_SHUID (dest
))
667 /* Forward branch. */
668 return (insn_last_address
+ insn_lengths
[seq_uid
]
669 - align_fuzz (seq
, dest
, length_unit_log
, ~0));
673 /* Backward branch. */
674 return (insn_current_address
675 + align_fuzz (dest
, seq
, length_unit_log
, ~0));
678 #endif /* HAVE_ATTR_length */
680 /* Compute branch alignments based on frequency information in the
684 compute_alignments (void)
686 int log
, max_skip
, max_log
;
689 int freq_threshold
= 0;
697 max_labelno
= max_label_num ();
698 min_labelno
= get_first_label_num ();
699 label_align
= XCNEWVEC (struct label_alignment
, max_labelno
- min_labelno
+ 1);
701 /* If not optimizing or optimizing for size, don't assign any alignments. */
702 if (! optimize
|| optimize_function_for_size_p (cfun
))
707 dump_flow_info (dump_file
, TDF_DETAILS
);
708 flow_loops_dump (dump_file
, NULL
, 1);
709 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
712 if (bb
->frequency
> freq_max
)
713 freq_max
= bb
->frequency
;
714 freq_threshold
= freq_max
/ PARAM_VALUE (PARAM_ALIGN_THRESHOLD
);
717 fprintf(dump_file
, "freq_max: %i\n",freq_max
);
720 rtx label
= BB_HEAD (bb
);
721 int fallthru_frequency
= 0, branch_frequency
= 0, has_fallthru
= 0;
726 || optimize_bb_for_size_p (bb
))
729 fprintf(dump_file
, "BB %4i freq %4i loop %2i loop_depth %2i skipped.\n",
730 bb
->index
, bb
->frequency
, bb
->loop_father
->num
, bb
->loop_depth
);
733 max_log
= LABEL_ALIGN (label
);
734 max_skip
= LABEL_ALIGN_MAX_SKIP
;
736 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
738 if (e
->flags
& EDGE_FALLTHRU
)
739 has_fallthru
= 1, fallthru_frequency
+= EDGE_FREQUENCY (e
);
741 branch_frequency
+= EDGE_FREQUENCY (e
);
745 fprintf(dump_file
, "BB %4i freq %4i loop %2i loop_depth %2i fall %4i branch %4i",
746 bb
->index
, bb
->frequency
, bb
->loop_father
->num
,
748 fallthru_frequency
, branch_frequency
);
749 if (!bb
->loop_father
->inner
&& bb
->loop_father
->num
)
750 fprintf (dump_file
, " inner_loop");
751 if (bb
->loop_father
->header
== bb
)
752 fprintf (dump_file
, " loop_header");
753 fprintf (dump_file
, "\n");
756 /* There are two purposes to align block with no fallthru incoming edge:
757 1) to avoid fetch stalls when branch destination is near cache boundary
758 2) to improve cache efficiency in case the previous block is not executed
759 (so it does not need to be in the cache).
761 We to catch first case, we align frequently executed blocks.
762 To catch the second, we align blocks that are executed more frequently
763 than the predecessor and the predecessor is likely to not be executed
764 when function is called. */
767 && (branch_frequency
> freq_threshold
768 || (bb
->frequency
> bb
->prev_bb
->frequency
* 10
769 && (bb
->prev_bb
->frequency
770 <= ENTRY_BLOCK_PTR
->frequency
/ 2))))
772 log
= JUMP_ALIGN (label
);
774 fprintf(dump_file
, " jump alignment added.\n");
778 max_skip
= JUMP_ALIGN_MAX_SKIP
;
781 /* In case block is frequent and reached mostly by non-fallthru edge,
782 align it. It is most likely a first block of loop. */
784 && optimize_bb_for_speed_p (bb
)
785 && branch_frequency
+ fallthru_frequency
> freq_threshold
787 > fallthru_frequency
* PARAM_VALUE (PARAM_ALIGN_LOOP_ITERATIONS
)))
789 log
= LOOP_ALIGN (label
);
791 fprintf(dump_file
, " internal loop alignment added.\n");
795 max_skip
= LOOP_ALIGN_MAX_SKIP
;
798 LABEL_TO_ALIGNMENT (label
) = max_log
;
799 LABEL_TO_MAX_SKIP (label
) = max_skip
;
804 loop_optimizer_finalize ();
805 free_dominance_info (CDI_DOMINATORS
);
810 struct rtl_opt_pass pass_compute_alignments
=
814 "alignments", /* name */
816 compute_alignments
, /* execute */
819 0, /* static_pass_number */
821 0, /* properties_required */
822 0, /* properties_provided */
823 0, /* properties_destroyed */
824 0, /* todo_flags_start */
825 TODO_dump_func
| TODO_verify_rtl_sharing
826 | TODO_ggc_collect
/* todo_flags_finish */
831 /* Make a pass over all insns and compute their actual lengths by shortening
832 any branches of variable length if possible. */
834 /* shorten_branches might be called multiple times: for example, the SH
835 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
836 In order to do this, it needs proper length information, which it obtains
837 by calling shorten_branches. This cannot be collapsed with
838 shorten_branches itself into a single pass unless we also want to integrate
839 reorg.c, since the branch splitting exposes new instructions with delay
843 shorten_branches (rtx first ATTRIBUTE_UNUSED
)
850 #ifdef HAVE_ATTR_length
851 #define MAX_CODE_ALIGN 16
853 int something_changed
= 1;
854 char *varying_length
;
857 rtx align_tab
[MAX_CODE_ALIGN
];
861 /* Compute maximum UID and allocate label_align / uid_shuid. */
862 max_uid
= get_max_uid ();
864 /* Free uid_shuid before reallocating it. */
867 uid_shuid
= XNEWVEC (int, max_uid
);
869 if (max_labelno
!= max_label_num ())
871 int old
= max_labelno
;
875 max_labelno
= max_label_num ();
877 n_labels
= max_labelno
- min_labelno
+ 1;
878 n_old_labels
= old
- min_labelno
+ 1;
880 label_align
= XRESIZEVEC (struct label_alignment
, label_align
, n_labels
);
882 /* Range of labels grows monotonically in the function. Failing here
883 means that the initialization of array got lost. */
884 gcc_assert (n_old_labels
<= n_labels
);
886 memset (label_align
+ n_old_labels
, 0,
887 (n_labels
- n_old_labels
) * sizeof (struct label_alignment
));
890 /* Initialize label_align and set up uid_shuid to be strictly
891 monotonically rising with insn order. */
892 /* We use max_log here to keep track of the maximum alignment we want to
893 impose on the next CODE_LABEL (or the current one if we are processing
894 the CODE_LABEL itself). */
899 for (insn
= get_insns (), i
= 1; insn
; insn
= NEXT_INSN (insn
))
903 INSN_SHUID (insn
) = i
++;
910 bool next_is_jumptable
;
912 /* Merge in alignments computed by compute_alignments. */
913 log
= LABEL_TO_ALIGNMENT (insn
);
917 max_skip
= LABEL_TO_MAX_SKIP (insn
);
920 next
= next_nonnote_insn (insn
);
921 next_is_jumptable
= next
&& JUMP_TABLE_DATA_P (next
);
922 if (!next_is_jumptable
)
924 log
= LABEL_ALIGN (insn
);
928 max_skip
= LABEL_ALIGN_MAX_SKIP
;
931 /* ADDR_VECs only take room if read-only data goes into the text
933 if ((JUMP_TABLES_IN_TEXT_SECTION
934 || readonly_data_section
== text_section
)
935 && next_is_jumptable
)
937 log
= ADDR_VEC_ALIGN (next
);
941 max_skip
= LABEL_ALIGN_MAX_SKIP
;
944 LABEL_TO_ALIGNMENT (insn
) = max_log
;
945 LABEL_TO_MAX_SKIP (insn
) = max_skip
;
949 else if (BARRIER_P (insn
))
953 for (label
= insn
; label
&& ! INSN_P (label
);
954 label
= NEXT_INSN (label
))
957 log
= LABEL_ALIGN_AFTER_BARRIER (insn
);
961 max_skip
= LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
;
967 #ifdef HAVE_ATTR_length
969 /* Allocate the rest of the arrays. */
970 insn_lengths
= XNEWVEC (int, max_uid
);
971 insn_lengths_max_uid
= max_uid
;
972 /* Syntax errors can lead to labels being outside of the main insn stream.
973 Initialize insn_addresses, so that we get reproducible results. */
974 INSN_ADDRESSES_ALLOC (max_uid
);
976 varying_length
= XCNEWVEC (char, max_uid
);
978 /* Initialize uid_align. We scan instructions
979 from end to start, and keep in align_tab[n] the last seen insn
980 that does an alignment of at least n+1, i.e. the successor
981 in the alignment chain for an insn that does / has a known
983 uid_align
= XCNEWVEC (rtx
, max_uid
);
985 for (i
= MAX_CODE_ALIGN
; --i
>= 0;)
986 align_tab
[i
] = NULL_RTX
;
987 seq
= get_last_insn ();
988 for (; seq
; seq
= PREV_INSN (seq
))
990 int uid
= INSN_UID (seq
);
992 log
= (LABEL_P (seq
) ? LABEL_TO_ALIGNMENT (seq
) : 0);
993 uid_align
[uid
] = align_tab
[0];
996 /* Found an alignment label. */
997 uid_align
[uid
] = align_tab
[log
];
998 for (i
= log
- 1; i
>= 0; i
--)
1002 #ifdef CASE_VECTOR_SHORTEN_MODE
1005 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1008 int min_shuid
= INSN_SHUID (get_insns ()) - 1;
1009 int max_shuid
= INSN_SHUID (get_last_insn ()) + 1;
1012 for (insn
= first
; insn
!= 0; insn
= NEXT_INSN (insn
))
1014 rtx min_lab
= NULL_RTX
, max_lab
= NULL_RTX
, pat
;
1015 int len
, i
, min
, max
, insn_shuid
;
1017 addr_diff_vec_flags flags
;
1020 || GET_CODE (PATTERN (insn
)) != ADDR_DIFF_VEC
)
1022 pat
= PATTERN (insn
);
1023 len
= XVECLEN (pat
, 1);
1024 gcc_assert (len
> 0);
1025 min_align
= MAX_CODE_ALIGN
;
1026 for (min
= max_shuid
, max
= min_shuid
, i
= len
- 1; i
>= 0; i
--)
1028 rtx lab
= XEXP (XVECEXP (pat
, 1, i
), 0);
1029 int shuid
= INSN_SHUID (lab
);
1040 if (min_align
> LABEL_TO_ALIGNMENT (lab
))
1041 min_align
= LABEL_TO_ALIGNMENT (lab
);
1043 XEXP (pat
, 2) = gen_rtx_LABEL_REF (Pmode
, min_lab
);
1044 XEXP (pat
, 3) = gen_rtx_LABEL_REF (Pmode
, max_lab
);
1045 insn_shuid
= INSN_SHUID (insn
);
1046 rel
= INSN_SHUID (XEXP (XEXP (pat
, 0), 0));
1047 memset (&flags
, 0, sizeof (flags
));
1048 flags
.min_align
= min_align
;
1049 flags
.base_after_vec
= rel
> insn_shuid
;
1050 flags
.min_after_vec
= min
> insn_shuid
;
1051 flags
.max_after_vec
= max
> insn_shuid
;
1052 flags
.min_after_base
= min
> rel
;
1053 flags
.max_after_base
= max
> rel
;
1054 ADDR_DIFF_VEC_FLAGS (pat
) = flags
;
1057 #endif /* CASE_VECTOR_SHORTEN_MODE */
1059 /* Compute initial lengths, addresses, and varying flags for each insn. */
1060 for (insn_current_address
= 0, insn
= first
;
1062 insn_current_address
+= insn_lengths
[uid
], insn
= NEXT_INSN (insn
))
1064 uid
= INSN_UID (insn
);
1066 insn_lengths
[uid
] = 0;
1070 int log
= LABEL_TO_ALIGNMENT (insn
);
1073 int align
= 1 << log
;
1074 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1075 insn_lengths
[uid
] = new_address
- insn_current_address
;
1079 INSN_ADDRESSES (uid
) = insn_current_address
+ insn_lengths
[uid
];
1081 if (NOTE_P (insn
) || BARRIER_P (insn
)
1082 || LABEL_P (insn
) || DEBUG_INSN_P(insn
))
1084 if (INSN_DELETED_P (insn
))
1087 body
= PATTERN (insn
);
1088 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
1090 /* This only takes room if read-only data goes into the text
1092 if (JUMP_TABLES_IN_TEXT_SECTION
1093 || readonly_data_section
== text_section
)
1094 insn_lengths
[uid
] = (XVECLEN (body
,
1095 GET_CODE (body
) == ADDR_DIFF_VEC
)
1096 * GET_MODE_SIZE (GET_MODE (body
)));
1097 /* Alignment is handled by ADDR_VEC_ALIGN. */
1099 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
1100 insn_lengths
[uid
] = asm_insn_count (body
) * insn_default_length (insn
);
1101 else if (GET_CODE (body
) == SEQUENCE
)
1104 int const_delay_slots
;
1106 const_delay_slots
= const_num_delay_slots (XVECEXP (body
, 0, 0));
1108 const_delay_slots
= 0;
1110 /* Inside a delay slot sequence, we do not do any branch shortening
1111 if the shortening could change the number of delay slots
1113 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1115 rtx inner_insn
= XVECEXP (body
, 0, i
);
1116 int inner_uid
= INSN_UID (inner_insn
);
1119 if (GET_CODE (body
) == ASM_INPUT
1120 || asm_noperands (PATTERN (XVECEXP (body
, 0, i
))) >= 0)
1121 inner_length
= (asm_insn_count (PATTERN (inner_insn
))
1122 * insn_default_length (inner_insn
));
1124 inner_length
= insn_default_length (inner_insn
);
1126 insn_lengths
[inner_uid
] = inner_length
;
1127 if (const_delay_slots
)
1129 if ((varying_length
[inner_uid
]
1130 = insn_variable_length_p (inner_insn
)) != 0)
1131 varying_length
[uid
] = 1;
1132 INSN_ADDRESSES (inner_uid
) = (insn_current_address
1133 + insn_lengths
[uid
]);
1136 varying_length
[inner_uid
] = 0;
1137 insn_lengths
[uid
] += inner_length
;
1140 else if (GET_CODE (body
) != USE
&& GET_CODE (body
) != CLOBBER
)
1142 insn_lengths
[uid
] = insn_default_length (insn
);
1143 varying_length
[uid
] = insn_variable_length_p (insn
);
1146 /* If needed, do any adjustment. */
1147 #ifdef ADJUST_INSN_LENGTH
1148 ADJUST_INSN_LENGTH (insn
, insn_lengths
[uid
]);
1149 if (insn_lengths
[uid
] < 0)
1150 fatal_insn ("negative insn length", insn
);
1154 /* Now loop over all the insns finding varying length insns. For each,
1155 get the current insn length. If it has changed, reflect the change.
1156 When nothing changes for a full pass, we are done. */
1158 while (something_changed
)
1160 something_changed
= 0;
1161 insn_current_align
= MAX_CODE_ALIGN
- 1;
1162 for (insn_current_address
= 0, insn
= first
;
1164 insn
= NEXT_INSN (insn
))
1167 #ifdef ADJUST_INSN_LENGTH
1172 uid
= INSN_UID (insn
);
1176 int log
= LABEL_TO_ALIGNMENT (insn
);
1177 if (log
> insn_current_align
)
1179 int align
= 1 << log
;
1180 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1181 insn_lengths
[uid
] = new_address
- insn_current_address
;
1182 insn_current_align
= log
;
1183 insn_current_address
= new_address
;
1186 insn_lengths
[uid
] = 0;
1187 INSN_ADDRESSES (uid
) = insn_current_address
;
1191 length_align
= INSN_LENGTH_ALIGNMENT (insn
);
1192 if (length_align
< insn_current_align
)
1193 insn_current_align
= length_align
;
1195 insn_last_address
= INSN_ADDRESSES (uid
);
1196 INSN_ADDRESSES (uid
) = insn_current_address
;
1198 #ifdef CASE_VECTOR_SHORTEN_MODE
1199 if (optimize
&& JUMP_P (insn
)
1200 && GET_CODE (PATTERN (insn
)) == ADDR_DIFF_VEC
)
1202 rtx body
= PATTERN (insn
);
1203 int old_length
= insn_lengths
[uid
];
1204 rtx rel_lab
= XEXP (XEXP (body
, 0), 0);
1205 rtx min_lab
= XEXP (XEXP (body
, 2), 0);
1206 rtx max_lab
= XEXP (XEXP (body
, 3), 0);
1207 int rel_addr
= INSN_ADDRESSES (INSN_UID (rel_lab
));
1208 int min_addr
= INSN_ADDRESSES (INSN_UID (min_lab
));
1209 int max_addr
= INSN_ADDRESSES (INSN_UID (max_lab
));
1212 addr_diff_vec_flags flags
;
1214 /* Avoid automatic aggregate initialization. */
1215 flags
= ADDR_DIFF_VEC_FLAGS (body
);
1217 /* Try to find a known alignment for rel_lab. */
1218 for (prev
= rel_lab
;
1220 && ! insn_lengths
[INSN_UID (prev
)]
1221 && ! (varying_length
[INSN_UID (prev
)] & 1);
1222 prev
= PREV_INSN (prev
))
1223 if (varying_length
[INSN_UID (prev
)] & 2)
1225 rel_align
= LABEL_TO_ALIGNMENT (prev
);
1229 /* See the comment on addr_diff_vec_flags in rtl.h for the
1230 meaning of the flags values. base: REL_LAB vec: INSN */
1231 /* Anything after INSN has still addresses from the last
1232 pass; adjust these so that they reflect our current
1233 estimate for this pass. */
1234 if (flags
.base_after_vec
)
1235 rel_addr
+= insn_current_address
- insn_last_address
;
1236 if (flags
.min_after_vec
)
1237 min_addr
+= insn_current_address
- insn_last_address
;
1238 if (flags
.max_after_vec
)
1239 max_addr
+= insn_current_address
- insn_last_address
;
1240 /* We want to know the worst case, i.e. lowest possible value
1241 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1242 its offset is positive, and we have to be wary of code shrink;
1243 otherwise, it is negative, and we have to be vary of code
1245 if (flags
.min_after_base
)
1247 /* If INSN is between REL_LAB and MIN_LAB, the size
1248 changes we are about to make can change the alignment
1249 within the observed offset, therefore we have to break
1250 it up into two parts that are independent. */
1251 if (! flags
.base_after_vec
&& flags
.min_after_vec
)
1253 min_addr
-= align_fuzz (rel_lab
, insn
, rel_align
, 0);
1254 min_addr
-= align_fuzz (insn
, min_lab
, 0, 0);
1257 min_addr
-= align_fuzz (rel_lab
, min_lab
, rel_align
, 0);
1261 if (flags
.base_after_vec
&& ! flags
.min_after_vec
)
1263 min_addr
-= align_fuzz (min_lab
, insn
, 0, ~0);
1264 min_addr
-= align_fuzz (insn
, rel_lab
, 0, ~0);
1267 min_addr
-= align_fuzz (min_lab
, rel_lab
, 0, ~0);
1269 /* Likewise, determine the highest lowest possible value
1270 for the offset of MAX_LAB. */
1271 if (flags
.max_after_base
)
1273 if (! flags
.base_after_vec
&& flags
.max_after_vec
)
1275 max_addr
+= align_fuzz (rel_lab
, insn
, rel_align
, ~0);
1276 max_addr
+= align_fuzz (insn
, max_lab
, 0, ~0);
1279 max_addr
+= align_fuzz (rel_lab
, max_lab
, rel_align
, ~0);
1283 if (flags
.base_after_vec
&& ! flags
.max_after_vec
)
1285 max_addr
+= align_fuzz (max_lab
, insn
, 0, 0);
1286 max_addr
+= align_fuzz (insn
, rel_lab
, 0, 0);
1289 max_addr
+= align_fuzz (max_lab
, rel_lab
, 0, 0);
1291 PUT_MODE (body
, CASE_VECTOR_SHORTEN_MODE (min_addr
- rel_addr
,
1292 max_addr
- rel_addr
,
1294 if (JUMP_TABLES_IN_TEXT_SECTION
1295 || readonly_data_section
== text_section
)
1298 = (XVECLEN (body
, 1) * GET_MODE_SIZE (GET_MODE (body
)));
1299 insn_current_address
+= insn_lengths
[uid
];
1300 if (insn_lengths
[uid
] != old_length
)
1301 something_changed
= 1;
1306 #endif /* CASE_VECTOR_SHORTEN_MODE */
1308 if (! (varying_length
[uid
]))
1310 if (NONJUMP_INSN_P (insn
)
1311 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1315 body
= PATTERN (insn
);
1316 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1318 rtx inner_insn
= XVECEXP (body
, 0, i
);
1319 int inner_uid
= INSN_UID (inner_insn
);
1321 INSN_ADDRESSES (inner_uid
) = insn_current_address
;
1323 insn_current_address
+= insn_lengths
[inner_uid
];
1327 insn_current_address
+= insn_lengths
[uid
];
1332 if (NONJUMP_INSN_P (insn
) && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1336 body
= PATTERN (insn
);
1338 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1340 rtx inner_insn
= XVECEXP (body
, 0, i
);
1341 int inner_uid
= INSN_UID (inner_insn
);
1344 INSN_ADDRESSES (inner_uid
) = insn_current_address
;
1346 /* insn_current_length returns 0 for insns with a
1347 non-varying length. */
1348 if (! varying_length
[inner_uid
])
1349 inner_length
= insn_lengths
[inner_uid
];
1351 inner_length
= insn_current_length (inner_insn
);
1353 if (inner_length
!= insn_lengths
[inner_uid
])
1355 insn_lengths
[inner_uid
] = inner_length
;
1356 something_changed
= 1;
1358 insn_current_address
+= insn_lengths
[inner_uid
];
1359 new_length
+= inner_length
;
1364 new_length
= insn_current_length (insn
);
1365 insn_current_address
+= new_length
;
1368 #ifdef ADJUST_INSN_LENGTH
1369 /* If needed, do any adjustment. */
1370 tmp_length
= new_length
;
1371 ADJUST_INSN_LENGTH (insn
, new_length
);
1372 insn_current_address
+= (new_length
- tmp_length
);
1375 if (new_length
!= insn_lengths
[uid
])
1377 insn_lengths
[uid
] = new_length
;
1378 something_changed
= 1;
1381 /* For a non-optimizing compile, do only a single pass. */
1386 free (varying_length
);
1388 #endif /* HAVE_ATTR_length */
1391 #ifdef HAVE_ATTR_length
1392 /* Given the body of an INSN known to be generated by an ASM statement, return
1393 the number of machine instructions likely to be generated for this insn.
1394 This is used to compute its length. */
1397 asm_insn_count (rtx body
)
1401 if (GET_CODE (body
) == ASM_INPUT
)
1402 templ
= XSTR (body
, 0);
1404 templ
= decode_asm_operands (body
, NULL
, NULL
, NULL
, NULL
, NULL
);
1406 return asm_str_count (templ
);
1410 /* Return the number of machine instructions likely to be generated for the
1411 inline-asm template. */
1413 asm_str_count (const char *templ
)
1420 for (; *templ
; templ
++)
1421 if (IS_ASM_LOGICAL_LINE_SEPARATOR (*templ
, templ
)
1428 /* ??? This is probably the wrong place for these. */
1429 /* Structure recording the mapping from source file and directory
1430 names at compile time to those to be embedded in debug
1432 typedef struct debug_prefix_map
1434 const char *old_prefix
;
1435 const char *new_prefix
;
1438 struct debug_prefix_map
*next
;
1441 /* Linked list of such structures. */
1442 debug_prefix_map
*debug_prefix_maps
;
1445 /* Record a debug file prefix mapping. ARG is the argument to
1446 -fdebug-prefix-map and must be of the form OLD=NEW. */
1449 add_debug_prefix_map (const char *arg
)
1451 debug_prefix_map
*map
;
1454 p
= strchr (arg
, '=');
1457 error ("invalid argument %qs to -fdebug-prefix-map", arg
);
1460 map
= XNEW (debug_prefix_map
);
1461 map
->old_prefix
= xstrndup (arg
, p
- arg
);
1462 map
->old_len
= p
- arg
;
1464 map
->new_prefix
= xstrdup (p
);
1465 map
->new_len
= strlen (p
);
1466 map
->next
= debug_prefix_maps
;
1467 debug_prefix_maps
= map
;
1470 /* Perform user-specified mapping of debug filename prefixes. Return
1471 the new name corresponding to FILENAME. */
1474 remap_debug_filename (const char *filename
)
1476 debug_prefix_map
*map
;
1481 for (map
= debug_prefix_maps
; map
; map
= map
->next
)
1482 if (strncmp (filename
, map
->old_prefix
, map
->old_len
) == 0)
1486 name
= filename
+ map
->old_len
;
1487 name_len
= strlen (name
) + 1;
1488 s
= (char *) alloca (name_len
+ map
->new_len
);
1489 memcpy (s
, map
->new_prefix
, map
->new_len
);
1490 memcpy (s
+ map
->new_len
, name
, name_len
);
1491 return ggc_strdup (s
);
1494 /* Return true if DWARF2 debug info can be emitted for DECL. */
1497 dwarf2_debug_info_emitted_p (tree decl
)
1499 if (write_symbols
!= DWARF2_DEBUG
&& write_symbols
!= VMS_AND_DWARF2_DEBUG
)
1502 if (DECL_IGNORED_P (decl
))
1508 /* Output assembler code for the start of a function,
1509 and initialize some of the variables in this file
1510 for the new function. The label for the function and associated
1511 assembler pseudo-ops have already been output in `assemble_start_function'.
1513 FIRST is the first insn of the rtl for the function being compiled.
1514 FILE is the file to write assembler code to.
1515 OPTIMIZE_P is nonzero if we should eliminate redundant
1516 test and compare insns. */
1519 final_start_function (rtx first ATTRIBUTE_UNUSED
, FILE *file
,
1520 int optimize_p ATTRIBUTE_UNUSED
)
1524 this_is_asm_operands
= 0;
1526 last_filename
= locator_file (prologue_locator
);
1527 last_linenum
= locator_line (prologue_locator
);
1528 last_discriminator
= discriminator
= 0;
1530 high_block_linenum
= high_function_linenum
= last_linenum
;
1532 if (!DECL_IGNORED_P (current_function_decl
))
1533 debug_hooks
->begin_prologue (last_linenum
, last_filename
);
1535 if (!dwarf2_debug_info_emitted_p (current_function_decl
))
1536 dwarf2out_begin_prologue (0, NULL
);
1538 #ifdef LEAF_REG_REMAP
1539 if (current_function_uses_only_leaf_regs
)
1540 leaf_renumber_regs (first
);
1543 /* The Sun386i and perhaps other machines don't work right
1544 if the profiling code comes after the prologue. */
1545 if (targetm
.profile_before_prologue () && crtl
->profile
)
1546 profile_function (file
);
1548 #if defined (HAVE_prologue)
1549 if (dwarf2out_do_frame ())
1550 dwarf2out_frame_debug (NULL_RTX
, false);
1553 /* If debugging, assign block numbers to all of the blocks in this
1557 reemit_insn_block_notes ();
1558 number_blocks (current_function_decl
);
1559 /* We never actually put out begin/end notes for the top-level
1560 block in the function. But, conceptually, that block is
1562 TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl
)) = 1;
1565 if (warn_frame_larger_than
1566 && get_frame_size () > frame_larger_than_size
)
1568 /* Issue a warning */
1569 warning (OPT_Wframe_larger_than_
,
1570 "the frame size of %wd bytes is larger than %wd bytes",
1571 get_frame_size (), frame_larger_than_size
);
1574 /* First output the function prologue: code to set up the stack frame. */
1575 targetm
.asm_out
.function_prologue (file
, get_frame_size ());
1577 /* If the machine represents the prologue as RTL, the profiling code must
1578 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1579 #ifdef HAVE_prologue
1580 if (! HAVE_prologue
)
1582 profile_after_prologue (file
);
1586 profile_after_prologue (FILE *file ATTRIBUTE_UNUSED
)
1588 if (!targetm
.profile_before_prologue () && crtl
->profile
)
1589 profile_function (file
);
1593 profile_function (FILE *file ATTRIBUTE_UNUSED
)
1595 #ifndef NO_PROFILE_COUNTERS
1596 # define NO_PROFILE_COUNTERS 0
1598 #ifdef ASM_OUTPUT_REG_PUSH
1599 rtx sval
= NULL
, chain
= NULL
;
1601 if (cfun
->returns_struct
)
1602 sval
= targetm
.calls
.struct_value_rtx (TREE_TYPE (current_function_decl
),
1604 if (cfun
->static_chain_decl
)
1605 chain
= targetm
.calls
.static_chain (current_function_decl
, true);
1606 #endif /* ASM_OUTPUT_REG_PUSH */
1608 if (! NO_PROFILE_COUNTERS
)
1610 int align
= MIN (BIGGEST_ALIGNMENT
, LONG_TYPE_SIZE
);
1611 switch_to_section (data_section
);
1612 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
1613 targetm
.asm_out
.internal_label (file
, "LP", current_function_funcdef_no
);
1614 assemble_integer (const0_rtx
, LONG_TYPE_SIZE
/ BITS_PER_UNIT
, align
, 1);
1617 switch_to_section (current_function_section ());
1619 #ifdef ASM_OUTPUT_REG_PUSH
1620 if (sval
&& REG_P (sval
))
1621 ASM_OUTPUT_REG_PUSH (file
, REGNO (sval
));
1622 if (chain
&& REG_P (chain
))
1623 ASM_OUTPUT_REG_PUSH (file
, REGNO (chain
));
1626 FUNCTION_PROFILER (file
, current_function_funcdef_no
);
1628 #ifdef ASM_OUTPUT_REG_PUSH
1629 if (chain
&& REG_P (chain
))
1630 ASM_OUTPUT_REG_POP (file
, REGNO (chain
));
1631 if (sval
&& REG_P (sval
))
1632 ASM_OUTPUT_REG_POP (file
, REGNO (sval
));
1636 /* Output assembler code for the end of a function.
1637 For clarity, args are same as those of `final_start_function'
1638 even though not all of them are needed. */
1641 final_end_function (void)
1645 if (!DECL_IGNORED_P (current_function_decl
))
1646 debug_hooks
->end_function (high_function_linenum
);
1648 /* Finally, output the function epilogue:
1649 code to restore the stack frame and return to the caller. */
1650 targetm
.asm_out
.function_epilogue (asm_out_file
, get_frame_size ());
1652 /* And debug output. */
1653 if (!DECL_IGNORED_P (current_function_decl
))
1654 debug_hooks
->end_epilogue (last_linenum
, last_filename
);
1656 if (!dwarf2_debug_info_emitted_p (current_function_decl
)
1657 && dwarf2out_do_frame ())
1658 dwarf2out_end_epilogue (last_linenum
, last_filename
);
1661 /* Output assembler code for some insns: all or part of a function.
1662 For description of args, see `final_start_function', above. */
1665 final (rtx first
, FILE *file
, int optimize_p
)
1671 last_ignored_compare
= 0;
1673 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1675 if (INSN_UID (insn
) > max_uid
) /* Find largest UID. */
1676 max_uid
= INSN_UID (insn
);
1678 /* If CC tracking across branches is enabled, record the insn which
1679 jumps to each branch only reached from one place. */
1680 if (optimize_p
&& JUMP_P (insn
))
1682 rtx lab
= JUMP_LABEL (insn
);
1683 if (lab
&& LABEL_NUSES (lab
) == 1)
1685 LABEL_REFS (lab
) = insn
;
1695 /* Output the insns. */
1696 for (insn
= first
; insn
;)
1698 #ifdef HAVE_ATTR_length
1699 if ((unsigned) INSN_UID (insn
) >= INSN_ADDRESSES_SIZE ())
1701 /* This can be triggered by bugs elsewhere in the compiler if
1702 new insns are created after init_insn_lengths is called. */
1703 gcc_assert (NOTE_P (insn
));
1704 insn_current_address
= -1;
1707 insn_current_address
= INSN_ADDRESSES (INSN_UID (insn
));
1708 #endif /* HAVE_ATTR_length */
1710 insn
= final_scan_insn (insn
, file
, optimize_p
, 0, &seen
);
1715 get_insn_template (int code
, rtx insn
)
1717 switch (insn_data
[code
].output_format
)
1719 case INSN_OUTPUT_FORMAT_SINGLE
:
1720 return insn_data
[code
].output
.single
;
1721 case INSN_OUTPUT_FORMAT_MULTI
:
1722 return insn_data
[code
].output
.multi
[which_alternative
];
1723 case INSN_OUTPUT_FORMAT_FUNCTION
:
1725 return (*insn_data
[code
].output
.function
) (recog_data
.operand
, insn
);
1732 /* Emit the appropriate declaration for an alternate-entry-point
1733 symbol represented by INSN, to FILE. INSN is a CODE_LABEL with
1734 LABEL_KIND != LABEL_NORMAL.
1736 The case fall-through in this function is intentional. */
1738 output_alternate_entry_point (FILE *file
, rtx insn
)
1740 const char *name
= LABEL_NAME (insn
);
1742 switch (LABEL_KIND (insn
))
1744 case LABEL_WEAK_ENTRY
:
1745 #ifdef ASM_WEAKEN_LABEL
1746 ASM_WEAKEN_LABEL (file
, name
);
1748 case LABEL_GLOBAL_ENTRY
:
1749 targetm
.asm_out
.globalize_label (file
, name
);
1750 case LABEL_STATIC_ENTRY
:
1751 #ifdef ASM_OUTPUT_TYPE_DIRECTIVE
1752 ASM_OUTPUT_TYPE_DIRECTIVE (file
, name
, "function");
1754 ASM_OUTPUT_LABEL (file
, name
);
1763 /* Given a CALL_INSN, find and return the nested CALL. */
1765 call_from_call_insn (rtx insn
)
1768 gcc_assert (CALL_P (insn
));
1771 while (GET_CODE (x
) != CALL
)
1773 switch (GET_CODE (x
))
1778 x
= COND_EXEC_CODE (x
);
1781 x
= XVECEXP (x
, 0, 0);
1791 /* The final scan for one insn, INSN.
1792 Args are same as in `final', except that INSN
1793 is the insn being scanned.
1794 Value returned is the next insn to be scanned.
1796 NOPEEPHOLES is the flag to disallow peephole processing (currently
1797 used for within delayed branch sequence output).
1799 SEEN is used to track the end of the prologue, for emitting
1800 debug information. We force the emission of a line note after
1801 both NOTE_INSN_PROLOGUE_END and NOTE_INSN_FUNCTION_BEG, or
1802 at the beginning of the second basic block, whichever comes
1806 final_scan_insn (rtx insn
, FILE *file
, int optimize_p ATTRIBUTE_UNUSED
,
1807 int nopeepholes ATTRIBUTE_UNUSED
, int *seen
)
1816 /* Ignore deleted insns. These can occur when we split insns (due to a
1817 template of "#") while not optimizing. */
1818 if (INSN_DELETED_P (insn
))
1819 return NEXT_INSN (insn
);
1821 switch (GET_CODE (insn
))
1824 switch (NOTE_KIND (insn
))
1826 case NOTE_INSN_DELETED
:
1829 case NOTE_INSN_SWITCH_TEXT_SECTIONS
:
1830 in_cold_section_p
= !in_cold_section_p
;
1832 if (dwarf2out_do_frame ())
1833 dwarf2out_switch_text_section ();
1834 else if (!DECL_IGNORED_P (current_function_decl
))
1835 debug_hooks
->switch_text_section ();
1837 switch_to_section (current_function_section ());
1840 case NOTE_INSN_BASIC_BLOCK
:
1841 if (targetm
.asm_out
.unwind_emit
)
1842 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
1845 fprintf (asm_out_file
, "\t%s basic block %d\n",
1846 ASM_COMMENT_START
, NOTE_BASIC_BLOCK (insn
)->index
);
1848 if ((*seen
& (SEEN_EMITTED
| SEEN_BB
)) == SEEN_BB
)
1850 *seen
|= SEEN_EMITTED
;
1851 force_source_line
= true;
1856 discriminator
= NOTE_BASIC_BLOCK (insn
)->discriminator
;
1860 case NOTE_INSN_EH_REGION_BEG
:
1861 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LEHB",
1862 NOTE_EH_HANDLER (insn
));
1865 case NOTE_INSN_EH_REGION_END
:
1866 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LEHE",
1867 NOTE_EH_HANDLER (insn
));
1870 case NOTE_INSN_PROLOGUE_END
:
1871 targetm
.asm_out
.function_end_prologue (file
);
1872 profile_after_prologue (file
);
1874 if ((*seen
& (SEEN_EMITTED
| SEEN_NOTE
)) == SEEN_NOTE
)
1876 *seen
|= SEEN_EMITTED
;
1877 force_source_line
= true;
1884 case NOTE_INSN_EPILOGUE_BEG
:
1885 #if defined (HAVE_epilogue)
1886 if (dwarf2out_do_frame ())
1887 dwarf2out_cfi_begin_epilogue (insn
);
1889 (*debug_hooks
->begin_epilogue
) (last_linenum
, last_filename
);
1890 targetm
.asm_out
.function_begin_epilogue (file
);
1893 case NOTE_INSN_CFA_RESTORE_STATE
:
1894 dwarf2out_frame_debug_restore_state ();
1897 case NOTE_INSN_FUNCTION_BEG
:
1899 if (!DECL_IGNORED_P (current_function_decl
))
1900 debug_hooks
->end_prologue (last_linenum
, last_filename
);
1902 if ((*seen
& (SEEN_EMITTED
| SEEN_NOTE
)) == SEEN_NOTE
)
1904 *seen
|= SEEN_EMITTED
;
1905 force_source_line
= true;
1912 case NOTE_INSN_BLOCK_BEG
:
1913 if (debug_info_level
== DINFO_LEVEL_NORMAL
1914 || debug_info_level
== DINFO_LEVEL_VERBOSE
1915 || write_symbols
== DWARF2_DEBUG
1916 || write_symbols
== VMS_AND_DWARF2_DEBUG
1917 || write_symbols
== VMS_DEBUG
)
1919 int n
= BLOCK_NUMBER (NOTE_BLOCK (insn
));
1923 high_block_linenum
= last_linenum
;
1925 /* Output debugging info about the symbol-block beginning. */
1926 if (!DECL_IGNORED_P (current_function_decl
))
1927 debug_hooks
->begin_block (last_linenum
, n
);
1929 /* Mark this block as output. */
1930 TREE_ASM_WRITTEN (NOTE_BLOCK (insn
)) = 1;
1932 if (write_symbols
== DBX_DEBUG
1933 || write_symbols
== SDB_DEBUG
)
1935 location_t
*locus_ptr
1936 = block_nonartificial_location (NOTE_BLOCK (insn
));
1938 if (locus_ptr
!= NULL
)
1940 override_filename
= LOCATION_FILE (*locus_ptr
);
1941 override_linenum
= LOCATION_LINE (*locus_ptr
);
1946 case NOTE_INSN_BLOCK_END
:
1947 if (debug_info_level
== DINFO_LEVEL_NORMAL
1948 || debug_info_level
== DINFO_LEVEL_VERBOSE
1949 || write_symbols
== DWARF2_DEBUG
1950 || write_symbols
== VMS_AND_DWARF2_DEBUG
1951 || write_symbols
== VMS_DEBUG
)
1953 int n
= BLOCK_NUMBER (NOTE_BLOCK (insn
));
1957 /* End of a symbol-block. */
1959 gcc_assert (block_depth
>= 0);
1961 if (!DECL_IGNORED_P (current_function_decl
))
1962 debug_hooks
->end_block (high_block_linenum
, n
);
1964 if (write_symbols
== DBX_DEBUG
1965 || write_symbols
== SDB_DEBUG
)
1967 tree outer_block
= BLOCK_SUPERCONTEXT (NOTE_BLOCK (insn
));
1968 location_t
*locus_ptr
1969 = block_nonartificial_location (outer_block
);
1971 if (locus_ptr
!= NULL
)
1973 override_filename
= LOCATION_FILE (*locus_ptr
);
1974 override_linenum
= LOCATION_LINE (*locus_ptr
);
1978 override_filename
= NULL
;
1979 override_linenum
= 0;
1984 case NOTE_INSN_DELETED_LABEL
:
1985 /* Emit the label. We may have deleted the CODE_LABEL because
1986 the label could be proved to be unreachable, though still
1987 referenced (in the form of having its address taken. */
1988 ASM_OUTPUT_DEBUG_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
1991 case NOTE_INSN_VAR_LOCATION
:
1992 if (!DECL_IGNORED_P (current_function_decl
))
1993 debug_hooks
->var_location (insn
);
2003 if (dwarf2out_do_frame ())
2004 dwarf2out_frame_debug (insn
, false);
2008 /* The target port might emit labels in the output function for
2009 some insn, e.g. sh.c output_branchy_insn. */
2010 if (CODE_LABEL_NUMBER (insn
) <= max_labelno
)
2012 int align
= LABEL_TO_ALIGNMENT (insn
);
2013 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2014 int max_skip
= LABEL_TO_MAX_SKIP (insn
);
2017 if (align
&& NEXT_INSN (insn
))
2019 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2020 ASM_OUTPUT_MAX_SKIP_ALIGN (file
, align
, max_skip
);
2022 #ifdef ASM_OUTPUT_ALIGN_WITH_NOP
2023 ASM_OUTPUT_ALIGN_WITH_NOP (file
, align
);
2025 ASM_OUTPUT_ALIGN (file
, align
);
2032 if (!DECL_IGNORED_P (current_function_decl
) && LABEL_NAME (insn
))
2033 debug_hooks
->label (insn
);
2037 next
= next_nonnote_insn (insn
);
2038 /* If this label is followed by a jump-table, make sure we put
2039 the label in the read-only section. Also possibly write the
2040 label and jump table together. */
2041 if (next
!= 0 && JUMP_TABLE_DATA_P (next
))
2043 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2044 /* In this case, the case vector is being moved by the
2045 target, so don't output the label at all. Leave that
2046 to the back end macros. */
2048 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2052 switch_to_section (targetm
.asm_out
.function_rodata_section
2053 (current_function_decl
));
2055 #ifdef ADDR_VEC_ALIGN
2056 log_align
= ADDR_VEC_ALIGN (next
);
2058 log_align
= exact_log2 (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
);
2060 ASM_OUTPUT_ALIGN (file
, log_align
);
2063 switch_to_section (current_function_section ());
2065 #ifdef ASM_OUTPUT_CASE_LABEL
2066 ASM_OUTPUT_CASE_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
),
2069 targetm
.asm_out
.internal_label (file
, "L", CODE_LABEL_NUMBER (insn
));
2074 if (LABEL_ALT_ENTRY_P (insn
))
2075 output_alternate_entry_point (file
, insn
);
2077 targetm
.asm_out
.internal_label (file
, "L", CODE_LABEL_NUMBER (insn
));
2082 rtx body
= PATTERN (insn
);
2083 int insn_code_number
;
2087 /* Reset this early so it is correct for ASM statements. */
2088 current_insn_predicate
= NULL_RTX
;
2090 /* An INSN, JUMP_INSN or CALL_INSN.
2091 First check for special kinds that recog doesn't recognize. */
2093 if (GET_CODE (body
) == USE
/* These are just declarations. */
2094 || GET_CODE (body
) == CLOBBER
)
2099 /* If there is a REG_CC_SETTER note on this insn, it means that
2100 the setting of the condition code was done in the delay slot
2101 of the insn that branched here. So recover the cc status
2102 from the insn that set it. */
2104 rtx note
= find_reg_note (insn
, REG_CC_SETTER
, NULL_RTX
);
2107 NOTICE_UPDATE_CC (PATTERN (XEXP (note
, 0)), XEXP (note
, 0));
2108 cc_prev_status
= cc_status
;
2113 /* Detect insns that are really jump-tables
2114 and output them as such. */
2116 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
2118 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2122 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2123 switch_to_section (targetm
.asm_out
.function_rodata_section
2124 (current_function_decl
));
2126 switch_to_section (current_function_section ());
2130 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2131 if (GET_CODE (body
) == ADDR_VEC
)
2133 #ifdef ASM_OUTPUT_ADDR_VEC
2134 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn
), body
);
2141 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2142 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn
), body
);
2148 vlen
= XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
);
2149 for (idx
= 0; idx
< vlen
; idx
++)
2151 if (GET_CODE (body
) == ADDR_VEC
)
2153 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2154 ASM_OUTPUT_ADDR_VEC_ELT
2155 (file
, CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 0, idx
), 0)));
2162 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2163 ASM_OUTPUT_ADDR_DIFF_ELT
2166 CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 1, idx
), 0)),
2167 CODE_LABEL_NUMBER (XEXP (XEXP (body
, 0), 0)));
2173 #ifdef ASM_OUTPUT_CASE_END
2174 ASM_OUTPUT_CASE_END (file
,
2175 CODE_LABEL_NUMBER (PREV_INSN (insn
)),
2180 switch_to_section (current_function_section ());
2184 /* Output this line note if it is the first or the last line
2186 if (!DECL_IGNORED_P (current_function_decl
)
2187 && notice_source_line (insn
, &is_stmt
))
2188 (*debug_hooks
->source_line
) (last_linenum
, last_filename
,
2189 last_discriminator
, is_stmt
);
2191 if (GET_CODE (body
) == ASM_INPUT
)
2193 const char *string
= XSTR (body
, 0);
2195 /* There's no telling what that did to the condition codes. */
2200 expanded_location loc
;
2203 loc
= expand_location (ASM_INPUT_SOURCE_LOCATION (body
));
2204 if (*loc
.file
&& loc
.line
)
2205 fprintf (asm_out_file
, "%s %i \"%s\" 1\n",
2206 ASM_COMMENT_START
, loc
.line
, loc
.file
);
2207 fprintf (asm_out_file
, "\t%s\n", string
);
2208 #if HAVE_AS_LINE_ZERO
2209 if (*loc
.file
&& loc
.line
)
2210 fprintf (asm_out_file
, "%s 0 \"\" 2\n", ASM_COMMENT_START
);
2216 /* Detect `asm' construct with operands. */
2217 if (asm_noperands (body
) >= 0)
2219 unsigned int noperands
= asm_noperands (body
);
2220 rtx
*ops
= XALLOCAVEC (rtx
, noperands
);
2223 expanded_location expanded
;
2225 /* There's no telling what that did to the condition codes. */
2228 /* Get out the operand values. */
2229 string
= decode_asm_operands (body
, ops
, NULL
, NULL
, NULL
, &loc
);
2230 /* Inhibit dying on what would otherwise be compiler bugs. */
2231 insn_noperands
= noperands
;
2232 this_is_asm_operands
= insn
;
2233 expanded
= expand_location (loc
);
2235 #ifdef FINAL_PRESCAN_INSN
2236 FINAL_PRESCAN_INSN (insn
, ops
, insn_noperands
);
2239 /* Output the insn using them. */
2243 if (expanded
.file
&& expanded
.line
)
2244 fprintf (asm_out_file
, "%s %i \"%s\" 1\n",
2245 ASM_COMMENT_START
, expanded
.line
, expanded
.file
);
2246 output_asm_insn (string
, ops
);
2247 #if HAVE_AS_LINE_ZERO
2248 if (expanded
.file
&& expanded
.line
)
2249 fprintf (asm_out_file
, "%s 0 \"\" 2\n", ASM_COMMENT_START
);
2253 if (targetm
.asm_out
.final_postscan_insn
)
2254 targetm
.asm_out
.final_postscan_insn (file
, insn
, ops
,
2257 this_is_asm_operands
= 0;
2263 if (GET_CODE (body
) == SEQUENCE
)
2265 /* A delayed-branch sequence */
2268 final_sequence
= body
;
2270 /* Record the delay slots' frame information before the branch.
2271 This is needed for delayed calls: see execute_cfa_program(). */
2272 if (dwarf2out_do_frame ())
2273 for (i
= 1; i
< XVECLEN (body
, 0); i
++)
2274 dwarf2out_frame_debug (XVECEXP (body
, 0, i
), false);
2276 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2277 force the restoration of a comparison that was previously
2278 thought unnecessary. If that happens, cancel this sequence
2279 and cause that insn to be restored. */
2281 next
= final_scan_insn (XVECEXP (body
, 0, 0), file
, 0, 1, seen
);
2282 if (next
!= XVECEXP (body
, 0, 1))
2288 for (i
= 1; i
< XVECLEN (body
, 0); i
++)
2290 rtx insn
= XVECEXP (body
, 0, i
);
2291 rtx next
= NEXT_INSN (insn
);
2292 /* We loop in case any instruction in a delay slot gets
2295 insn
= final_scan_insn (insn
, file
, 0, 1, seen
);
2296 while (insn
!= next
);
2298 #ifdef DBR_OUTPUT_SEQEND
2299 DBR_OUTPUT_SEQEND (file
);
2303 /* If the insn requiring the delay slot was a CALL_INSN, the
2304 insns in the delay slot are actually executed before the
2305 called function. Hence we don't preserve any CC-setting
2306 actions in these insns and the CC must be marked as being
2307 clobbered by the function. */
2308 if (CALL_P (XVECEXP (body
, 0, 0)))
2315 /* We have a real machine instruction as rtl. */
2317 body
= PATTERN (insn
);
2320 set
= single_set (insn
);
2322 /* Check for redundant test and compare instructions
2323 (when the condition codes are already set up as desired).
2324 This is done only when optimizing; if not optimizing,
2325 it should be possible for the user to alter a variable
2326 with the debugger in between statements
2327 and the next statement should reexamine the variable
2328 to compute the condition codes. */
2333 && GET_CODE (SET_DEST (set
)) == CC0
2334 && insn
!= last_ignored_compare
)
2337 if (GET_CODE (SET_SRC (set
)) == SUBREG
)
2338 SET_SRC (set
) = alter_subreg (&SET_SRC (set
));
2340 src1
= SET_SRC (set
);
2342 if (GET_CODE (SET_SRC (set
)) == COMPARE
)
2344 if (GET_CODE (XEXP (SET_SRC (set
), 0)) == SUBREG
)
2345 XEXP (SET_SRC (set
), 0)
2346 = alter_subreg (&XEXP (SET_SRC (set
), 0));
2347 if (GET_CODE (XEXP (SET_SRC (set
), 1)) == SUBREG
)
2348 XEXP (SET_SRC (set
), 1)
2349 = alter_subreg (&XEXP (SET_SRC (set
), 1));
2350 if (XEXP (SET_SRC (set
), 1)
2351 == CONST0_RTX (GET_MODE (XEXP (SET_SRC (set
), 0))))
2352 src2
= XEXP (SET_SRC (set
), 0);
2354 if ((cc_status
.value1
!= 0
2355 && rtx_equal_p (src1
, cc_status
.value1
))
2356 || (cc_status
.value2
!= 0
2357 && rtx_equal_p (src1
, cc_status
.value2
))
2358 || (src2
!= 0 && cc_status
.value1
!= 0
2359 && rtx_equal_p (src2
, cc_status
.value1
))
2360 || (src2
!= 0 && cc_status
.value2
!= 0
2361 && rtx_equal_p (src2
, cc_status
.value2
)))
2363 /* Don't delete insn if it has an addressing side-effect. */
2364 if (! FIND_REG_INC_NOTE (insn
, NULL_RTX
)
2365 /* or if anything in it is volatile. */
2366 && ! volatile_refs_p (PATTERN (insn
)))
2368 /* We don't really delete the insn; just ignore it. */
2369 last_ignored_compare
= insn
;
2376 /* If this is a conditional branch, maybe modify it
2377 if the cc's are in a nonstandard state
2378 so that it accomplishes the same thing that it would
2379 do straightforwardly if the cc's were set up normally. */
2381 if (cc_status
.flags
!= 0
2383 && GET_CODE (body
) == SET
2384 && SET_DEST (body
) == pc_rtx
2385 && GET_CODE (SET_SRC (body
)) == IF_THEN_ELSE
2386 && COMPARISON_P (XEXP (SET_SRC (body
), 0))
2387 && XEXP (XEXP (SET_SRC (body
), 0), 0) == cc0_rtx
)
2389 /* This function may alter the contents of its argument
2390 and clear some of the cc_status.flags bits.
2391 It may also return 1 meaning condition now always true
2392 or -1 meaning condition now always false
2393 or 2 meaning condition nontrivial but altered. */
2394 int result
= alter_cond (XEXP (SET_SRC (body
), 0));
2395 /* If condition now has fixed value, replace the IF_THEN_ELSE
2396 with its then-operand or its else-operand. */
2398 SET_SRC (body
) = XEXP (SET_SRC (body
), 1);
2400 SET_SRC (body
) = XEXP (SET_SRC (body
), 2);
2402 /* The jump is now either unconditional or a no-op.
2403 If it has become a no-op, don't try to output it.
2404 (It would not be recognized.) */
2405 if (SET_SRC (body
) == pc_rtx
)
2410 else if (GET_CODE (SET_SRC (body
)) == RETURN
)
2411 /* Replace (set (pc) (return)) with (return). */
2412 PATTERN (insn
) = body
= SET_SRC (body
);
2414 /* Rerecognize the instruction if it has changed. */
2416 INSN_CODE (insn
) = -1;
2419 /* If this is a conditional trap, maybe modify it if the cc's
2420 are in a nonstandard state so that it accomplishes the same
2421 thing that it would do straightforwardly if the cc's were
2423 if (cc_status
.flags
!= 0
2424 && NONJUMP_INSN_P (insn
)
2425 && GET_CODE (body
) == TRAP_IF
2426 && COMPARISON_P (TRAP_CONDITION (body
))
2427 && XEXP (TRAP_CONDITION (body
), 0) == cc0_rtx
)
2429 /* This function may alter the contents of its argument
2430 and clear some of the cc_status.flags bits.
2431 It may also return 1 meaning condition now always true
2432 or -1 meaning condition now always false
2433 or 2 meaning condition nontrivial but altered. */
2434 int result
= alter_cond (TRAP_CONDITION (body
));
2436 /* If TRAP_CONDITION has become always false, delete the
2444 /* If TRAP_CONDITION has become always true, replace
2445 TRAP_CONDITION with const_true_rtx. */
2447 TRAP_CONDITION (body
) = const_true_rtx
;
2449 /* Rerecognize the instruction if it has changed. */
2451 INSN_CODE (insn
) = -1;
2454 /* Make same adjustments to instructions that examine the
2455 condition codes without jumping and instructions that
2456 handle conditional moves (if this machine has either one). */
2458 if (cc_status
.flags
!= 0
2461 rtx cond_rtx
, then_rtx
, else_rtx
;
2464 && GET_CODE (SET_SRC (set
)) == IF_THEN_ELSE
)
2466 cond_rtx
= XEXP (SET_SRC (set
), 0);
2467 then_rtx
= XEXP (SET_SRC (set
), 1);
2468 else_rtx
= XEXP (SET_SRC (set
), 2);
2472 cond_rtx
= SET_SRC (set
);
2473 then_rtx
= const_true_rtx
;
2474 else_rtx
= const0_rtx
;
2477 switch (GET_CODE (cond_rtx
))
2491 if (XEXP (cond_rtx
, 0) != cc0_rtx
)
2493 result
= alter_cond (cond_rtx
);
2495 validate_change (insn
, &SET_SRC (set
), then_rtx
, 0);
2496 else if (result
== -1)
2497 validate_change (insn
, &SET_SRC (set
), else_rtx
, 0);
2498 else if (result
== 2)
2499 INSN_CODE (insn
) = -1;
2500 if (SET_DEST (set
) == SET_SRC (set
))
2512 #ifdef HAVE_peephole
2513 /* Do machine-specific peephole optimizations if desired. */
2515 if (optimize_p
&& !flag_no_peephole
&& !nopeepholes
)
2517 rtx next
= peephole (insn
);
2518 /* When peepholing, if there were notes within the peephole,
2519 emit them before the peephole. */
2520 if (next
!= 0 && next
!= NEXT_INSN (insn
))
2522 rtx note
, prev
= PREV_INSN (insn
);
2524 for (note
= NEXT_INSN (insn
); note
!= next
;
2525 note
= NEXT_INSN (note
))
2526 final_scan_insn (note
, file
, optimize_p
, nopeepholes
, seen
);
2528 /* Put the notes in the proper position for a later
2529 rescan. For example, the SH target can do this
2530 when generating a far jump in a delayed branch
2532 note
= NEXT_INSN (insn
);
2533 PREV_INSN (note
) = prev
;
2534 NEXT_INSN (prev
) = note
;
2535 NEXT_INSN (PREV_INSN (next
)) = insn
;
2536 PREV_INSN (insn
) = PREV_INSN (next
);
2537 NEXT_INSN (insn
) = next
;
2538 PREV_INSN (next
) = insn
;
2541 /* PEEPHOLE might have changed this. */
2542 body
= PATTERN (insn
);
2546 /* Try to recognize the instruction.
2547 If successful, verify that the operands satisfy the
2548 constraints for the instruction. Crash if they don't,
2549 since `reload' should have changed them so that they do. */
2551 insn_code_number
= recog_memoized (insn
);
2552 cleanup_subreg_operands (insn
);
2554 /* Dump the insn in the assembly for debugging. */
2555 if (flag_dump_rtl_in_asm
)
2557 print_rtx_head
= ASM_COMMENT_START
;
2558 print_rtl_single (asm_out_file
, insn
);
2559 print_rtx_head
= "";
2562 if (! constrain_operands_cached (1))
2563 fatal_insn_not_found (insn
);
2565 /* Some target machines need to prescan each insn before
2568 #ifdef FINAL_PRESCAN_INSN
2569 FINAL_PRESCAN_INSN (insn
, recog_data
.operand
, recog_data
.n_operands
);
2572 if (targetm
.have_conditional_execution ()
2573 && GET_CODE (PATTERN (insn
)) == COND_EXEC
)
2574 current_insn_predicate
= COND_EXEC_TEST (PATTERN (insn
));
2577 cc_prev_status
= cc_status
;
2579 /* Update `cc_status' for this instruction.
2580 The instruction's output routine may change it further.
2581 If the output routine for a jump insn needs to depend
2582 on the cc status, it should look at cc_prev_status. */
2584 NOTICE_UPDATE_CC (body
, insn
);
2587 current_output_insn
= debug_insn
= insn
;
2589 if (CALL_P (insn
) && dwarf2out_do_frame ())
2590 dwarf2out_frame_debug (insn
, false);
2592 /* Find the proper template for this insn. */
2593 templ
= get_insn_template (insn_code_number
, insn
);
2595 /* If the C code returns 0, it means that it is a jump insn
2596 which follows a deleted test insn, and that test insn
2597 needs to be reinserted. */
2602 gcc_assert (prev_nonnote_insn (insn
) == last_ignored_compare
);
2604 /* We have already processed the notes between the setter and
2605 the user. Make sure we don't process them again, this is
2606 particularly important if one of the notes is a block
2607 scope note or an EH note. */
2609 prev
!= last_ignored_compare
;
2610 prev
= PREV_INSN (prev
))
2613 delete_insn (prev
); /* Use delete_note. */
2619 /* If the template is the string "#", it means that this insn must
2621 if (templ
[0] == '#' && templ
[1] == '\0')
2623 rtx new_rtx
= try_split (body
, insn
, 0);
2625 /* If we didn't split the insn, go away. */
2626 if (new_rtx
== insn
&& PATTERN (new_rtx
) == body
)
2627 fatal_insn ("could not split insn", insn
);
2629 #ifdef HAVE_ATTR_length
2630 /* This instruction should have been split in shorten_branches,
2631 to ensure that we would have valid length info for the
2639 /* ??? This will put the directives in the wrong place if
2640 get_insn_template outputs assembly directly. However calling it
2641 before get_insn_template breaks if the insns is split. */
2642 if (targetm
.asm_out
.unwind_emit_before_insn
2643 && targetm
.asm_out
.unwind_emit
)
2644 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
2648 rtx x
= call_from_call_insn (insn
);
2650 if (x
&& MEM_P (x
) && GET_CODE (XEXP (x
, 0)) == SYMBOL_REF
)
2654 t
= SYMBOL_REF_DECL (x
);
2656 assemble_external (t
);
2660 /* Output assembler code from the template. */
2661 output_asm_insn (templ
, recog_data
.operand
);
2663 /* Record point-of-call information for ICF debugging. */
2664 if (flag_enable_icf_debug
&& CALL_P (insn
))
2666 rtx x
= call_from_call_insn (insn
);
2670 if (GET_CODE (XEXP (x
, 0)) == SYMBOL_REF
)
2674 t
= SYMBOL_REF_DECL (x
);
2676 (*debug_hooks
->direct_call
) (t
);
2679 (*debug_hooks
->virtual_call
) (INSN_UID (insn
));
2683 /* Some target machines need to postscan each insn after
2685 if (targetm
.asm_out
.final_postscan_insn
)
2686 targetm
.asm_out
.final_postscan_insn (file
, insn
, recog_data
.operand
,
2687 recog_data
.n_operands
);
2689 /* If necessary, report the effect that the instruction has on
2690 the unwind info. We've already done this for delay slots
2691 and call instructions. */
2692 if (final_sequence
== 0
2693 #if !defined (HAVE_prologue)
2694 && !ACCUMULATE_OUTGOING_ARGS
2696 && dwarf2out_do_frame ())
2697 dwarf2out_frame_debug (insn
, true);
2699 if (!targetm
.asm_out
.unwind_emit_before_insn
2700 && targetm
.asm_out
.unwind_emit
)
2701 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
2703 current_output_insn
= debug_insn
= 0;
2706 return NEXT_INSN (insn
);
2709 /* Return whether a source line note needs to be emitted before INSN.
2710 Sets IS_STMT to TRUE if the line should be marked as a possible
2711 breakpoint location. */
2714 notice_source_line (rtx insn
, bool *is_stmt
)
2716 const char *filename
;
2719 if (override_filename
)
2721 filename
= override_filename
;
2722 linenum
= override_linenum
;
2726 filename
= insn_file (insn
);
2727 linenum
= insn_line (insn
);
2730 if (filename
== NULL
)
2733 if (force_source_line
2734 || filename
!= last_filename
2735 || last_linenum
!= linenum
)
2737 force_source_line
= false;
2738 last_filename
= filename
;
2739 last_linenum
= linenum
;
2740 last_discriminator
= discriminator
;
2742 high_block_linenum
= MAX (last_linenum
, high_block_linenum
);
2743 high_function_linenum
= MAX (last_linenum
, high_function_linenum
);
2747 if (SUPPORTS_DISCRIMINATOR
&& last_discriminator
!= discriminator
)
2749 /* If the discriminator changed, but the line number did not,
2750 output the line table entry with is_stmt false so the
2751 debugger does not treat this as a breakpoint location. */
2752 last_discriminator
= discriminator
;
2760 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
2761 directly to the desired hard register. */
2764 cleanup_subreg_operands (rtx insn
)
2767 bool changed
= false;
2768 extract_insn_cached (insn
);
2769 for (i
= 0; i
< recog_data
.n_operands
; i
++)
2771 /* The following test cannot use recog_data.operand when testing
2772 for a SUBREG: the underlying object might have been changed
2773 already if we are inside a match_operator expression that
2774 matches the else clause. Instead we test the underlying
2775 expression directly. */
2776 if (GET_CODE (*recog_data
.operand_loc
[i
]) == SUBREG
)
2778 recog_data
.operand
[i
] = alter_subreg (recog_data
.operand_loc
[i
]);
2781 else if (GET_CODE (recog_data
.operand
[i
]) == PLUS
2782 || GET_CODE (recog_data
.operand
[i
]) == MULT
2783 || MEM_P (recog_data
.operand
[i
]))
2784 recog_data
.operand
[i
] = walk_alter_subreg (recog_data
.operand_loc
[i
], &changed
);
2787 for (i
= 0; i
< recog_data
.n_dups
; i
++)
2789 if (GET_CODE (*recog_data
.dup_loc
[i
]) == SUBREG
)
2791 *recog_data
.dup_loc
[i
] = alter_subreg (recog_data
.dup_loc
[i
]);
2794 else if (GET_CODE (*recog_data
.dup_loc
[i
]) == PLUS
2795 || GET_CODE (*recog_data
.dup_loc
[i
]) == MULT
2796 || MEM_P (*recog_data
.dup_loc
[i
]))
2797 *recog_data
.dup_loc
[i
] = walk_alter_subreg (recog_data
.dup_loc
[i
], &changed
);
2800 df_insn_rescan (insn
);
2803 /* If X is a SUBREG, replace it with a REG or a MEM,
2804 based on the thing it is a subreg of. */
2807 alter_subreg (rtx
*xp
)
2810 rtx y
= SUBREG_REG (x
);
2812 /* simplify_subreg does not remove subreg from volatile references.
2813 We are required to. */
2816 int offset
= SUBREG_BYTE (x
);
2818 /* For paradoxical subregs on big-endian machines, SUBREG_BYTE
2819 contains 0 instead of the proper offset. See simplify_subreg. */
2821 && GET_MODE_SIZE (GET_MODE (y
)) < GET_MODE_SIZE (GET_MODE (x
)))
2823 int difference
= GET_MODE_SIZE (GET_MODE (y
))
2824 - GET_MODE_SIZE (GET_MODE (x
));
2825 if (WORDS_BIG_ENDIAN
)
2826 offset
+= (difference
/ UNITS_PER_WORD
) * UNITS_PER_WORD
;
2827 if (BYTES_BIG_ENDIAN
)
2828 offset
+= difference
% UNITS_PER_WORD
;
2831 *xp
= adjust_address (y
, GET_MODE (x
), offset
);
2835 rtx new_rtx
= simplify_subreg (GET_MODE (x
), y
, GET_MODE (y
),
2842 /* Simplify_subreg can't handle some REG cases, but we have to. */
2844 HOST_WIDE_INT offset
;
2846 regno
= subreg_regno (x
);
2847 if (subreg_lowpart_p (x
))
2848 offset
= byte_lowpart_offset (GET_MODE (x
), GET_MODE (y
));
2850 offset
= SUBREG_BYTE (x
);
2851 *xp
= gen_rtx_REG_offset (y
, GET_MODE (x
), regno
, offset
);
2858 /* Do alter_subreg on all the SUBREGs contained in X. */
2861 walk_alter_subreg (rtx
*xp
, bool *changed
)
2864 switch (GET_CODE (x
))
2869 XEXP (x
, 0) = walk_alter_subreg (&XEXP (x
, 0), changed
);
2870 XEXP (x
, 1) = walk_alter_subreg (&XEXP (x
, 1), changed
);
2875 XEXP (x
, 0) = walk_alter_subreg (&XEXP (x
, 0), changed
);
2880 return alter_subreg (xp
);
2891 /* Given BODY, the body of a jump instruction, alter the jump condition
2892 as required by the bits that are set in cc_status.flags.
2893 Not all of the bits there can be handled at this level in all cases.
2895 The value is normally 0.
2896 1 means that the condition has become always true.
2897 -1 means that the condition has become always false.
2898 2 means that COND has been altered. */
2901 alter_cond (rtx cond
)
2905 if (cc_status
.flags
& CC_REVERSED
)
2908 PUT_CODE (cond
, swap_condition (GET_CODE (cond
)));
2911 if (cc_status
.flags
& CC_INVERTED
)
2914 PUT_CODE (cond
, reverse_condition (GET_CODE (cond
)));
2917 if (cc_status
.flags
& CC_NOT_POSITIVE
)
2918 switch (GET_CODE (cond
))
2923 /* Jump becomes unconditional. */
2929 /* Jump becomes no-op. */
2933 PUT_CODE (cond
, EQ
);
2938 PUT_CODE (cond
, NE
);
2946 if (cc_status
.flags
& CC_NOT_NEGATIVE
)
2947 switch (GET_CODE (cond
))
2951 /* Jump becomes unconditional. */
2956 /* Jump becomes no-op. */
2961 PUT_CODE (cond
, EQ
);
2967 PUT_CODE (cond
, NE
);
2975 if (cc_status
.flags
& CC_NO_OVERFLOW
)
2976 switch (GET_CODE (cond
))
2979 /* Jump becomes unconditional. */
2983 PUT_CODE (cond
, EQ
);
2988 PUT_CODE (cond
, NE
);
2993 /* Jump becomes no-op. */
3000 if (cc_status
.flags
& (CC_Z_IN_NOT_N
| CC_Z_IN_N
))
3001 switch (GET_CODE (cond
))
3007 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? GE
: LT
);
3012 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? LT
: GE
);
3017 if (cc_status
.flags
& CC_NOT_SIGNED
)
3018 /* The flags are valid if signed condition operators are converted
3020 switch (GET_CODE (cond
))
3023 PUT_CODE (cond
, LEU
);
3028 PUT_CODE (cond
, LTU
);
3033 PUT_CODE (cond
, GTU
);
3038 PUT_CODE (cond
, GEU
);
3050 /* Report inconsistency between the assembler template and the operands.
3051 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3054 output_operand_lossage (const char *cmsgid
, ...)
3058 const char *pfx_str
;
3061 va_start (ap
, cmsgid
);
3063 pfx_str
= this_is_asm_operands
? _("invalid 'asm': ") : "output_operand: ";
3064 asprintf (&fmt_string
, "%s%s", pfx_str
, _(cmsgid
));
3065 vasprintf (&new_message
, fmt_string
, ap
);
3067 if (this_is_asm_operands
)
3068 error_for_asm (this_is_asm_operands
, "%s", new_message
);
3070 internal_error ("%s", new_message
);
3077 /* Output of assembler code from a template, and its subroutines. */
3079 /* Annotate the assembly with a comment describing the pattern and
3080 alternative used. */
3083 output_asm_name (void)
3087 int num
= INSN_CODE (debug_insn
);
3088 fprintf (asm_out_file
, "\t%s %d\t%s",
3089 ASM_COMMENT_START
, INSN_UID (debug_insn
),
3090 insn_data
[num
].name
);
3091 if (insn_data
[num
].n_alternatives
> 1)
3092 fprintf (asm_out_file
, "/%d", which_alternative
+ 1);
3093 #ifdef HAVE_ATTR_length
3094 fprintf (asm_out_file
, "\t[length = %d]",
3095 get_attr_length (debug_insn
));
3097 /* Clear this so only the first assembler insn
3098 of any rtl insn will get the special comment for -dp. */
3103 /* If OP is a REG or MEM and we can find a MEM_EXPR corresponding to it
3104 or its address, return that expr . Set *PADDRESSP to 1 if the expr
3105 corresponds to the address of the object and 0 if to the object. */
3108 get_mem_expr_from_op (rtx op
, int *paddressp
)
3116 return REG_EXPR (op
);
3117 else if (!MEM_P (op
))
3120 if (MEM_EXPR (op
) != 0)
3121 return MEM_EXPR (op
);
3123 /* Otherwise we have an address, so indicate it and look at the address. */
3127 /* First check if we have a decl for the address, then look at the right side
3128 if it is a PLUS. Otherwise, strip off arithmetic and keep looking.
3129 But don't allow the address to itself be indirect. */
3130 if ((expr
= get_mem_expr_from_op (op
, &inner_addressp
)) && ! inner_addressp
)
3132 else if (GET_CODE (op
) == PLUS
3133 && (expr
= get_mem_expr_from_op (XEXP (op
, 1), &inner_addressp
)))
3137 || GET_RTX_CLASS (GET_CODE (op
)) == RTX_BIN_ARITH
)
3140 expr
= get_mem_expr_from_op (op
, &inner_addressp
);
3141 return inner_addressp
? 0 : expr
;
3144 /* Output operand names for assembler instructions. OPERANDS is the
3145 operand vector, OPORDER is the order to write the operands, and NOPS
3146 is the number of operands to write. */
3149 output_asm_operand_names (rtx
*operands
, int *oporder
, int nops
)
3154 for (i
= 0; i
< nops
; i
++)
3157 rtx op
= operands
[oporder
[i
]];
3158 tree expr
= get_mem_expr_from_op (op
, &addressp
);
3160 fprintf (asm_out_file
, "%c%s",
3161 wrote
? ',' : '\t', wrote
? "" : ASM_COMMENT_START
);
3165 fprintf (asm_out_file
, "%s",
3166 addressp
? "*" : "");
3167 print_mem_expr (asm_out_file
, expr
);
3170 else if (REG_P (op
) && ORIGINAL_REGNO (op
)
3171 && ORIGINAL_REGNO (op
) != REGNO (op
))
3172 fprintf (asm_out_file
, " tmp%i", ORIGINAL_REGNO (op
));
3176 /* Output text from TEMPLATE to the assembler output file,
3177 obeying %-directions to substitute operands taken from
3178 the vector OPERANDS.
3180 %N (for N a digit) means print operand N in usual manner.
3181 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3182 and print the label name with no punctuation.
3183 %cN means require operand N to be a constant
3184 and print the constant expression with no punctuation.
3185 %aN means expect operand N to be a memory address
3186 (not a memory reference!) and print a reference
3188 %nN means expect operand N to be a constant
3189 and print a constant expression for minus the value
3190 of the operand, with no other punctuation. */
3193 output_asm_insn (const char *templ
, rtx
*operands
)
3197 #ifdef ASSEMBLER_DIALECT
3200 int oporder
[MAX_RECOG_OPERANDS
];
3201 char opoutput
[MAX_RECOG_OPERANDS
];
3204 /* An insn may return a null string template
3205 in a case where no assembler code is needed. */
3209 memset (opoutput
, 0, sizeof opoutput
);
3211 putc ('\t', asm_out_file
);
3213 #ifdef ASM_OUTPUT_OPCODE
3214 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3221 if (flag_verbose_asm
)
3222 output_asm_operand_names (operands
, oporder
, ops
);
3223 if (flag_print_asm_name
)
3227 memset (opoutput
, 0, sizeof opoutput
);
3229 putc (c
, asm_out_file
);
3230 #ifdef ASM_OUTPUT_OPCODE
3231 while ((c
= *p
) == '\t')
3233 putc (c
, asm_out_file
);
3236 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3240 #ifdef ASSEMBLER_DIALECT
3246 output_operand_lossage ("nested assembly dialect alternatives");
3250 /* If we want the first dialect, do nothing. Otherwise, skip
3251 DIALECT_NUMBER of strings ending with '|'. */
3252 for (i
= 0; i
< dialect_number
; i
++)
3254 while (*p
&& *p
!= '}' && *p
++ != '|')
3263 output_operand_lossage ("unterminated assembly dialect alternative");
3270 /* Skip to close brace. */
3275 output_operand_lossage ("unterminated assembly dialect alternative");
3279 while (*p
++ != '}');
3283 putc (c
, asm_out_file
);
3288 putc (c
, asm_out_file
);
3294 /* %% outputs a single %. */
3298 putc (c
, asm_out_file
);
3300 /* %= outputs a number which is unique to each insn in the entire
3301 compilation. This is useful for making local labels that are
3302 referred to more than once in a given insn. */
3306 fprintf (asm_out_file
, "%d", insn_counter
);
3308 /* % followed by a letter and some digits
3309 outputs an operand in a special way depending on the letter.
3310 Letters `acln' are implemented directly.
3311 Other letters are passed to `output_operand' so that
3312 the TARGET_PRINT_OPERAND hook can define them. */
3313 else if (ISALPHA (*p
))
3316 unsigned long opnum
;
3319 opnum
= strtoul (p
, &endptr
, 10);
3322 output_operand_lossage ("operand number missing "
3324 else if (this_is_asm_operands
&& opnum
>= insn_noperands
)
3325 output_operand_lossage ("operand number out of range");
3326 else if (letter
== 'l')
3327 output_asm_label (operands
[opnum
]);
3328 else if (letter
== 'a')
3329 output_address (operands
[opnum
]);
3330 else if (letter
== 'c')
3332 if (CONSTANT_ADDRESS_P (operands
[opnum
]))
3333 output_addr_const (asm_out_file
, operands
[opnum
]);
3335 output_operand (operands
[opnum
], 'c');
3337 else if (letter
== 'n')
3339 if (CONST_INT_P (operands
[opnum
]))
3340 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
,
3341 - INTVAL (operands
[opnum
]));
3344 putc ('-', asm_out_file
);
3345 output_addr_const (asm_out_file
, operands
[opnum
]);
3349 output_operand (operands
[opnum
], letter
);
3351 if (!opoutput
[opnum
])
3352 oporder
[ops
++] = opnum
;
3353 opoutput
[opnum
] = 1;
3358 /* % followed by a digit outputs an operand the default way. */
3359 else if (ISDIGIT (*p
))
3361 unsigned long opnum
;
3364 opnum
= strtoul (p
, &endptr
, 10);
3365 if (this_is_asm_operands
&& opnum
>= insn_noperands
)
3366 output_operand_lossage ("operand number out of range");
3368 output_operand (operands
[opnum
], 0);
3370 if (!opoutput
[opnum
])
3371 oporder
[ops
++] = opnum
;
3372 opoutput
[opnum
] = 1;
3377 /* % followed by punctuation: output something for that
3378 punctuation character alone, with no operand. The
3379 TARGET_PRINT_OPERAND hook decides what is actually done. */
3380 else if (targetm
.asm_out
.print_operand_punct_valid_p ((unsigned char) *p
))
3381 output_operand (NULL_RTX
, *p
++);
3383 output_operand_lossage ("invalid %%-code");
3387 putc (c
, asm_out_file
);
3390 /* Write out the variable names for operands, if we know them. */
3391 if (flag_verbose_asm
)
3392 output_asm_operand_names (operands
, oporder
, ops
);
3393 if (flag_print_asm_name
)
3396 putc ('\n', asm_out_file
);
3399 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3402 output_asm_label (rtx x
)
3406 if (GET_CODE (x
) == LABEL_REF
)
3410 && NOTE_KIND (x
) == NOTE_INSN_DELETED_LABEL
))
3411 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3413 output_operand_lossage ("'%%l' operand isn't a label");
3415 assemble_name (asm_out_file
, buf
);
3418 /* Helper rtx-iteration-function for mark_symbol_refs_as_used and
3419 output_operand. Marks SYMBOL_REFs as referenced through use of
3420 assemble_external. */
3423 mark_symbol_ref_as_used (rtx
*xp
, void *dummy ATTRIBUTE_UNUSED
)
3427 /* If we have a used symbol, we may have to emit assembly
3428 annotations corresponding to whether the symbol is external, weak
3429 or has non-default visibility. */
3430 if (GET_CODE (x
) == SYMBOL_REF
)
3434 t
= SYMBOL_REF_DECL (x
);
3436 assemble_external (t
);
3444 /* Marks SYMBOL_REFs in x as referenced through use of assemble_external. */
3447 mark_symbol_refs_as_used (rtx x
)
3449 for_each_rtx (&x
, mark_symbol_ref_as_used
, NULL
);
3452 /* Print operand X using machine-dependent assembler syntax.
3453 CODE is a non-digit that preceded the operand-number in the % spec,
3454 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3455 between the % and the digits.
3456 When CODE is a non-letter, X is 0.
3458 The meanings of the letters are machine-dependent and controlled
3459 by TARGET_PRINT_OPERAND. */
3462 output_operand (rtx x
, int code ATTRIBUTE_UNUSED
)
3464 if (x
&& GET_CODE (x
) == SUBREG
)
3465 x
= alter_subreg (&x
);
3467 /* X must not be a pseudo reg. */
3468 gcc_assert (!x
|| !REG_P (x
) || REGNO (x
) < FIRST_PSEUDO_REGISTER
);
3470 targetm
.asm_out
.print_operand (asm_out_file
, x
, code
);
3475 for_each_rtx (&x
, mark_symbol_ref_as_used
, NULL
);
3478 /* Print a memory reference operand for address X using
3479 machine-dependent assembler syntax. */
3482 output_address (rtx x
)
3484 bool changed
= false;
3485 walk_alter_subreg (&x
, &changed
);
3486 targetm
.asm_out
.print_operand_address (asm_out_file
, x
);
3489 /* Print an integer constant expression in assembler syntax.
3490 Addition and subtraction are the only arithmetic
3491 that may appear in these expressions. */
3494 output_addr_const (FILE *file
, rtx x
)
3499 switch (GET_CODE (x
))
3506 if (SYMBOL_REF_DECL (x
))
3507 assemble_external (SYMBOL_REF_DECL (x
));
3508 #ifdef ASM_OUTPUT_SYMBOL_REF
3509 ASM_OUTPUT_SYMBOL_REF (file
, x
);
3511 assemble_name (file
, XSTR (x
, 0));
3519 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3520 #ifdef ASM_OUTPUT_LABEL_REF
3521 ASM_OUTPUT_LABEL_REF (file
, buf
);
3523 assemble_name (file
, buf
);
3528 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, INTVAL (x
));
3532 /* This used to output parentheses around the expression,
3533 but that does not work on the 386 (either ATT or BSD assembler). */
3534 output_addr_const (file
, XEXP (x
, 0));
3538 if (GET_MODE (x
) == VOIDmode
)
3540 /* We can use %d if the number is one word and positive. */
3541 if (CONST_DOUBLE_HIGH (x
))
3542 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
3543 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_HIGH (x
),
3544 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_LOW (x
));
3545 else if (CONST_DOUBLE_LOW (x
) < 0)
3546 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
,
3547 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_LOW (x
));
3549 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_DOUBLE_LOW (x
));
3552 /* We can't handle floating point constants;
3553 PRINT_OPERAND must handle them. */
3554 output_operand_lossage ("floating constant misused");
3558 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
,
3559 (unsigned HOST_WIDE_INT
) CONST_FIXED_VALUE_LOW (x
));
3563 /* Some assemblers need integer constants to appear last (eg masm). */
3564 if (CONST_INT_P (XEXP (x
, 0)))
3566 output_addr_const (file
, XEXP (x
, 1));
3567 if (INTVAL (XEXP (x
, 0)) >= 0)
3568 fprintf (file
, "+");
3569 output_addr_const (file
, XEXP (x
, 0));
3573 output_addr_const (file
, XEXP (x
, 0));
3574 if (!CONST_INT_P (XEXP (x
, 1))
3575 || INTVAL (XEXP (x
, 1)) >= 0)
3576 fprintf (file
, "+");
3577 output_addr_const (file
, XEXP (x
, 1));
3582 /* Avoid outputting things like x-x or x+5-x,
3583 since some assemblers can't handle that. */
3584 x
= simplify_subtraction (x
);
3585 if (GET_CODE (x
) != MINUS
)
3588 output_addr_const (file
, XEXP (x
, 0));
3589 fprintf (file
, "-");
3590 if ((CONST_INT_P (XEXP (x
, 1)) && INTVAL (XEXP (x
, 1)) >= 0)
3591 || GET_CODE (XEXP (x
, 1)) == PC
3592 || GET_CODE (XEXP (x
, 1)) == SYMBOL_REF
)
3593 output_addr_const (file
, XEXP (x
, 1));
3596 fputs (targetm
.asm_out
.open_paren
, file
);
3597 output_addr_const (file
, XEXP (x
, 1));
3598 fputs (targetm
.asm_out
.close_paren
, file
);
3606 output_addr_const (file
, XEXP (x
, 0));
3610 if (targetm
.asm_out
.output_addr_const_extra (file
, x
))
3613 output_operand_lossage ("invalid expression as operand");
3617 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3618 %R prints the value of REGISTER_PREFIX.
3619 %L prints the value of LOCAL_LABEL_PREFIX.
3620 %U prints the value of USER_LABEL_PREFIX.
3621 %I prints the value of IMMEDIATE_PREFIX.
3622 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3623 Also supported are %d, %i, %u, %x, %X, %o, %c, %s and %%.
3625 We handle alternate assembler dialects here, just like output_asm_insn. */
3628 asm_fprintf (FILE *file
, const char *p
, ...)
3634 va_start (argptr
, p
);
3641 #ifdef ASSEMBLER_DIALECT
3646 /* If we want the first dialect, do nothing. Otherwise, skip
3647 DIALECT_NUMBER of strings ending with '|'. */
3648 for (i
= 0; i
< dialect_number
; i
++)
3650 while (*p
&& *p
++ != '|')
3660 /* Skip to close brace. */
3661 while (*p
&& *p
++ != '}')
3672 while (strchr ("-+ #0", c
))
3677 while (ISDIGIT (c
) || c
== '.')
3688 case 'd': case 'i': case 'u':
3689 case 'x': case 'X': case 'o':
3693 fprintf (file
, buf
, va_arg (argptr
, int));
3697 /* This is a prefix to the 'd', 'i', 'u', 'x', 'X', and
3698 'o' cases, but we do not check for those cases. It
3699 means that the value is a HOST_WIDE_INT, which may be
3700 either `long' or `long long'. */
3701 memcpy (q
, HOST_WIDE_INT_PRINT
, strlen (HOST_WIDE_INT_PRINT
));
3702 q
+= strlen (HOST_WIDE_INT_PRINT
);
3705 fprintf (file
, buf
, va_arg (argptr
, HOST_WIDE_INT
));
3710 #ifdef HAVE_LONG_LONG
3716 fprintf (file
, buf
, va_arg (argptr
, long long));
3723 fprintf (file
, buf
, va_arg (argptr
, long));
3731 fprintf (file
, buf
, va_arg (argptr
, char *));
3735 #ifdef ASM_OUTPUT_OPCODE
3736 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3741 #ifdef REGISTER_PREFIX
3742 fprintf (file
, "%s", REGISTER_PREFIX
);
3747 #ifdef IMMEDIATE_PREFIX
3748 fprintf (file
, "%s", IMMEDIATE_PREFIX
);
3753 #ifdef LOCAL_LABEL_PREFIX
3754 fprintf (file
, "%s", LOCAL_LABEL_PREFIX
);
3759 fputs (user_label_prefix
, file
);
3762 #ifdef ASM_FPRINTF_EXTENSIONS
3763 /* Uppercase letters are reserved for general use by asm_fprintf
3764 and so are not available to target specific code. In order to
3765 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
3766 they are defined here. As they get turned into real extensions
3767 to asm_fprintf they should be removed from this list. */
3768 case 'A': case 'B': case 'C': case 'D': case 'E':
3769 case 'F': case 'G': case 'H': case 'J': case 'K':
3770 case 'M': case 'N': case 'P': case 'Q': case 'S':
3771 case 'T': case 'V': case 'W': case 'Y': case 'Z':
3774 ASM_FPRINTF_EXTENSIONS (file
, argptr
, p
)
3787 /* Split up a CONST_DOUBLE or integer constant rtx
3788 into two rtx's for single words,
3789 storing in *FIRST the word that comes first in memory in the target
3790 and in *SECOND the other. */
3793 split_double (rtx value
, rtx
*first
, rtx
*second
)
3795 if (CONST_INT_P (value
))
3797 if (HOST_BITS_PER_WIDE_INT
>= (2 * BITS_PER_WORD
))
3799 /* In this case the CONST_INT holds both target words.
3800 Extract the bits from it into two word-sized pieces.
3801 Sign extend each half to HOST_WIDE_INT. */
3802 unsigned HOST_WIDE_INT low
, high
;
3803 unsigned HOST_WIDE_INT mask
, sign_bit
, sign_extend
;
3805 /* Set sign_bit to the most significant bit of a word. */
3807 sign_bit
<<= BITS_PER_WORD
- 1;
3809 /* Set mask so that all bits of the word are set. We could
3810 have used 1 << BITS_PER_WORD instead of basing the
3811 calculation on sign_bit. However, on machines where
3812 HOST_BITS_PER_WIDE_INT == BITS_PER_WORD, it could cause a
3813 compiler warning, even though the code would never be
3815 mask
= sign_bit
<< 1;
3818 /* Set sign_extend as any remaining bits. */
3819 sign_extend
= ~mask
;
3821 /* Pick the lower word and sign-extend it. */
3822 low
= INTVAL (value
);
3827 /* Pick the higher word, shifted to the least significant
3828 bits, and sign-extend it. */
3829 high
= INTVAL (value
);
3830 high
>>= BITS_PER_WORD
- 1;
3833 if (high
& sign_bit
)
3834 high
|= sign_extend
;
3836 /* Store the words in the target machine order. */
3837 if (WORDS_BIG_ENDIAN
)
3839 *first
= GEN_INT (high
);
3840 *second
= GEN_INT (low
);
3844 *first
= GEN_INT (low
);
3845 *second
= GEN_INT (high
);
3850 /* The rule for using CONST_INT for a wider mode
3851 is that we regard the value as signed.
3852 So sign-extend it. */
3853 rtx high
= (INTVAL (value
) < 0 ? constm1_rtx
: const0_rtx
);
3854 if (WORDS_BIG_ENDIAN
)
3866 else if (GET_CODE (value
) != CONST_DOUBLE
)
3868 if (WORDS_BIG_ENDIAN
)
3870 *first
= const0_rtx
;
3876 *second
= const0_rtx
;
3879 else if (GET_MODE (value
) == VOIDmode
3880 /* This is the old way we did CONST_DOUBLE integers. */
3881 || GET_MODE_CLASS (GET_MODE (value
)) == MODE_INT
)
3883 /* In an integer, the words are defined as most and least significant.
3884 So order them by the target's convention. */
3885 if (WORDS_BIG_ENDIAN
)
3887 *first
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3888 *second
= GEN_INT (CONST_DOUBLE_LOW (value
));
3892 *first
= GEN_INT (CONST_DOUBLE_LOW (value
));
3893 *second
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3900 REAL_VALUE_FROM_CONST_DOUBLE (r
, value
);
3902 /* Note, this converts the REAL_VALUE_TYPE to the target's
3903 format, splits up the floating point double and outputs
3904 exactly 32 bits of it into each of l[0] and l[1] --
3905 not necessarily BITS_PER_WORD bits. */
3906 REAL_VALUE_TO_TARGET_DOUBLE (r
, l
);
3908 /* If 32 bits is an entire word for the target, but not for the host,
3909 then sign-extend on the host so that the number will look the same
3910 way on the host that it would on the target. See for instance
3911 simplify_unary_operation. The #if is needed to avoid compiler
3914 #if HOST_BITS_PER_LONG > 32
3915 if (BITS_PER_WORD
< HOST_BITS_PER_LONG
&& BITS_PER_WORD
== 32)
3917 if (l
[0] & ((long) 1 << 31))
3918 l
[0] |= ((long) (-1) << 32);
3919 if (l
[1] & ((long) 1 << 31))
3920 l
[1] |= ((long) (-1) << 32);
3924 *first
= GEN_INT (l
[0]);
3925 *second
= GEN_INT (l
[1]);
3929 /* Return nonzero if this function has no function calls. */
3932 leaf_function_p (void)
3937 if (crtl
->profile
|| profile_arc_flag
)
3940 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3943 && ! SIBLING_CALL_P (insn
))
3945 if (NONJUMP_INSN_P (insn
)
3946 && GET_CODE (PATTERN (insn
)) == SEQUENCE
3947 && CALL_P (XVECEXP (PATTERN (insn
), 0, 0))
3948 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn
), 0, 0)))
3951 for (link
= crtl
->epilogue_delay_list
;
3953 link
= XEXP (link
, 1))
3955 insn
= XEXP (link
, 0);
3958 && ! SIBLING_CALL_P (insn
))
3960 if (NONJUMP_INSN_P (insn
)
3961 && GET_CODE (PATTERN (insn
)) == SEQUENCE
3962 && CALL_P (XVECEXP (PATTERN (insn
), 0, 0))
3963 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn
), 0, 0)))
3970 /* Return 1 if branch is a forward branch.
3971 Uses insn_shuid array, so it works only in the final pass. May be used by
3972 output templates to customary add branch prediction hints.
3975 final_forward_branch_p (rtx insn
)
3977 int insn_id
, label_id
;
3979 gcc_assert (uid_shuid
);
3980 insn_id
= INSN_SHUID (insn
);
3981 label_id
= INSN_SHUID (JUMP_LABEL (insn
));
3982 /* We've hit some insns that does not have id information available. */
3983 gcc_assert (insn_id
&& label_id
);
3984 return insn_id
< label_id
;
3987 /* On some machines, a function with no call insns
3988 can run faster if it doesn't create its own register window.
3989 When output, the leaf function should use only the "output"
3990 registers. Ordinarily, the function would be compiled to use
3991 the "input" registers to find its arguments; it is a candidate
3992 for leaf treatment if it uses only the "input" registers.
3993 Leaf function treatment means renumbering so the function
3994 uses the "output" registers instead. */
3996 #ifdef LEAF_REGISTERS
3998 /* Return 1 if this function uses only the registers that can be
3999 safely renumbered. */
4002 only_leaf_regs_used (void)
4005 const char *const permitted_reg_in_leaf_functions
= LEAF_REGISTERS
;
4007 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4008 if ((df_regs_ever_live_p (i
) || global_regs
[i
])
4009 && ! permitted_reg_in_leaf_functions
[i
])
4012 if (crtl
->uses_pic_offset_table
4013 && pic_offset_table_rtx
!= 0
4014 && REG_P (pic_offset_table_rtx
)
4015 && ! permitted_reg_in_leaf_functions
[REGNO (pic_offset_table_rtx
)])
4021 /* Scan all instructions and renumber all registers into those
4022 available in leaf functions. */
4025 leaf_renumber_regs (rtx first
)
4029 /* Renumber only the actual patterns.
4030 The reg-notes can contain frame pointer refs,
4031 and renumbering them could crash, and should not be needed. */
4032 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
4034 leaf_renumber_regs_insn (PATTERN (insn
));
4035 for (insn
= crtl
->epilogue_delay_list
;
4037 insn
= XEXP (insn
, 1))
4038 if (INSN_P (XEXP (insn
, 0)))
4039 leaf_renumber_regs_insn (PATTERN (XEXP (insn
, 0)));
4042 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4043 available in leaf functions. */
4046 leaf_renumber_regs_insn (rtx in_rtx
)
4049 const char *format_ptr
;
4054 /* Renumber all input-registers into output-registers.
4055 renumbered_regs would be 1 for an output-register;
4062 /* Don't renumber the same reg twice. */
4066 newreg
= REGNO (in_rtx
);
4067 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4068 to reach here as part of a REG_NOTE. */
4069 if (newreg
>= FIRST_PSEUDO_REGISTER
)
4074 newreg
= LEAF_REG_REMAP (newreg
);
4075 gcc_assert (newreg
>= 0);
4076 df_set_regs_ever_live (REGNO (in_rtx
), false);
4077 df_set_regs_ever_live (newreg
, true);
4078 SET_REGNO (in_rtx
, newreg
);
4082 if (INSN_P (in_rtx
))
4084 /* Inside a SEQUENCE, we find insns.
4085 Renumber just the patterns of these insns,
4086 just as we do for the top-level insns. */
4087 leaf_renumber_regs_insn (PATTERN (in_rtx
));
4091 format_ptr
= GET_RTX_FORMAT (GET_CODE (in_rtx
));
4093 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (in_rtx
)); i
++)
4094 switch (*format_ptr
++)
4097 leaf_renumber_regs_insn (XEXP (in_rtx
, i
));
4101 if (NULL
!= XVEC (in_rtx
, i
))
4103 for (j
= 0; j
< XVECLEN (in_rtx
, i
); j
++)
4104 leaf_renumber_regs_insn (XVECEXP (in_rtx
, i
, j
));
4124 /* When -gused is used, emit debug info for only used symbols. But in
4125 addition to the standard intercepted debug_hooks there are some direct
4126 calls into this file, i.e., dbxout_symbol, dbxout_parms, and dbxout_reg_params.
4127 Those routines may also be called from a higher level intercepted routine. So
4128 to prevent recording data for an inner call to one of these for an intercept,
4129 we maintain an intercept nesting counter (debug_nesting). We only save the
4130 intercepted arguments if the nesting is 1. */
4131 int debug_nesting
= 0;
4133 static tree
*symbol_queue
;
4134 int symbol_queue_index
= 0;
4135 static int symbol_queue_size
= 0;
4137 /* Generate the symbols for any queued up type symbols we encountered
4138 while generating the type info for some originally used symbol.
4139 This might generate additional entries in the queue. Only when
4140 the nesting depth goes to 0 is this routine called. */
4143 debug_flush_symbol_queue (void)
4147 /* Make sure that additionally queued items are not flushed
4152 for (i
= 0; i
< symbol_queue_index
; ++i
)
4154 /* If we pushed queued symbols then such symbols must be
4155 output no matter what anyone else says. Specifically,
4156 we need to make sure dbxout_symbol() thinks the symbol was
4157 used and also we need to override TYPE_DECL_SUPPRESS_DEBUG
4158 which may be set for outside reasons. */
4159 int saved_tree_used
= TREE_USED (symbol_queue
[i
]);
4160 int saved_suppress_debug
= TYPE_DECL_SUPPRESS_DEBUG (symbol_queue
[i
]);
4161 TREE_USED (symbol_queue
[i
]) = 1;
4162 TYPE_DECL_SUPPRESS_DEBUG (symbol_queue
[i
]) = 0;
4164 #ifdef DBX_DEBUGGING_INFO
4165 dbxout_symbol (symbol_queue
[i
], 0);
4168 TREE_USED (symbol_queue
[i
]) = saved_tree_used
;
4169 TYPE_DECL_SUPPRESS_DEBUG (symbol_queue
[i
]) = saved_suppress_debug
;
4172 symbol_queue_index
= 0;
4176 /* Queue a type symbol needed as part of the definition of a decl
4177 symbol. These symbols are generated when debug_flush_symbol_queue()
4181 debug_queue_symbol (tree decl
)
4183 if (symbol_queue_index
>= symbol_queue_size
)
4185 symbol_queue_size
+= 10;
4186 symbol_queue
= XRESIZEVEC (tree
, symbol_queue
, symbol_queue_size
);
4189 symbol_queue
[symbol_queue_index
++] = decl
;
4192 /* Free symbol queue. */
4194 debug_free_queue (void)
4198 free (symbol_queue
);
4199 symbol_queue
= NULL
;
4200 symbol_queue_size
= 0;
4204 /* Turn the RTL into assembly. */
4206 rest_of_handle_final (void)
4211 /* Get the function's name, as described by its RTL. This may be
4212 different from the DECL_NAME name used in the source file. */
4214 x
= DECL_RTL (current_function_decl
);
4215 gcc_assert (MEM_P (x
));
4217 gcc_assert (GET_CODE (x
) == SYMBOL_REF
);
4218 fnname
= XSTR (x
, 0);
4220 assemble_start_function (current_function_decl
, fnname
);
4221 final_start_function (get_insns (), asm_out_file
, optimize
);
4222 final (get_insns (), asm_out_file
, optimize
);
4223 final_end_function ();
4225 /* The IA-64 ".handlerdata" directive must be issued before the ".endp"
4226 directive that closes the procedure descriptor. Similarly, for x64 SEH.
4227 Otherwise it's not strictly necessary, but it doesn't hurt either. */
4228 output_function_exception_table (fnname
);
4230 assemble_end_function (current_function_decl
, fnname
);
4232 user_defined_section_attribute
= false;
4234 /* Free up reg info memory. */
4238 fflush (asm_out_file
);
4240 /* Write DBX symbols if requested. */
4242 /* Note that for those inline functions where we don't initially
4243 know for certain that we will be generating an out-of-line copy,
4244 the first invocation of this routine (rest_of_compilation) will
4245 skip over this code by doing a `goto exit_rest_of_compilation;'.
4246 Later on, wrapup_global_declarations will (indirectly) call
4247 rest_of_compilation again for those inline functions that need
4248 to have out-of-line copies generated. During that call, we
4249 *will* be routed past here. */
4251 timevar_push (TV_SYMOUT
);
4252 if (!DECL_IGNORED_P (current_function_decl
))
4253 debug_hooks
->function_decl (current_function_decl
);
4254 timevar_pop (TV_SYMOUT
);
4256 /* Release the blocks that are linked to DECL_INITIAL() to free the memory. */
4257 DECL_INITIAL (current_function_decl
) = error_mark_node
;
4259 if (DECL_STATIC_CONSTRUCTOR (current_function_decl
)
4260 && targetm
.have_ctors_dtors
)
4261 targetm
.asm_out
.constructor (XEXP (DECL_RTL (current_function_decl
), 0),
4262 decl_init_priority_lookup
4263 (current_function_decl
));
4264 if (DECL_STATIC_DESTRUCTOR (current_function_decl
)
4265 && targetm
.have_ctors_dtors
)
4266 targetm
.asm_out
.destructor (XEXP (DECL_RTL (current_function_decl
), 0),
4267 decl_fini_priority_lookup
4268 (current_function_decl
));
4272 struct rtl_opt_pass pass_final
=
4278 rest_of_handle_final
, /* execute */
4281 0, /* static_pass_number */
4282 TV_FINAL
, /* tv_id */
4283 0, /* properties_required */
4284 0, /* properties_provided */
4285 0, /* properties_destroyed */
4286 0, /* todo_flags_start */
4287 TODO_ggc_collect
/* todo_flags_finish */
4293 rest_of_handle_shorten_branches (void)
4295 /* Shorten branches. */
4296 shorten_branches (get_insns ());
4300 struct rtl_opt_pass pass_shorten_branches
=
4304 "shorten", /* name */
4306 rest_of_handle_shorten_branches
, /* execute */
4309 0, /* static_pass_number */
4310 TV_FINAL
, /* tv_id */
4311 0, /* properties_required */
4312 0, /* properties_provided */
4313 0, /* properties_destroyed */
4314 0, /* todo_flags_start */
4315 TODO_dump_func
/* todo_flags_finish */
4321 rest_of_clean_state (void)
4324 FILE *final_output
= NULL
;
4325 int save_unnumbered
= flag_dump_unnumbered
;
4326 int save_noaddr
= flag_dump_noaddr
;
4328 if (flag_dump_final_insns
)
4330 final_output
= fopen (flag_dump_final_insns
, "a");
4333 error ("could not open final insn dump file %qs: %m",
4334 flag_dump_final_insns
);
4335 flag_dump_final_insns
= NULL
;
4340 struct cgraph_node
*node
= cgraph_node (current_function_decl
);
4342 aname
= (IDENTIFIER_POINTER
4343 (DECL_ASSEMBLER_NAME (current_function_decl
)));
4344 fprintf (final_output
, "\n;; Function (%s) %s\n\n", aname
,
4345 node
->frequency
== NODE_FREQUENCY_HOT
4347 : node
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
4348 ? " (unlikely executed)"
4349 : node
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
4350 ? " (executed once)"
4353 flag_dump_noaddr
= flag_dump_unnumbered
= 1;
4354 if (flag_compare_debug_opt
|| flag_compare_debug
)
4355 dump_flags
|= TDF_NOUID
;
4356 final_insns_dump_p
= true;
4358 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4360 INSN_UID (insn
) = CODE_LABEL_NUMBER (insn
);
4362 INSN_UID (insn
) = 0;
4366 /* It is very important to decompose the RTL instruction chain here:
4367 debug information keeps pointing into CODE_LABEL insns inside the function
4368 body. If these remain pointing to the other insns, we end up preserving
4369 whole RTL chain and attached detailed debug info in memory. */
4370 for (insn
= get_insns (); insn
; insn
= next
)
4372 next
= NEXT_INSN (insn
);
4373 NEXT_INSN (insn
) = NULL
;
4374 PREV_INSN (insn
) = NULL
;
4377 && (!NOTE_P (insn
) ||
4378 (NOTE_KIND (insn
) != NOTE_INSN_VAR_LOCATION
4379 && NOTE_KIND (insn
) != NOTE_INSN_BLOCK_BEG
4380 && NOTE_KIND (insn
) != NOTE_INSN_BLOCK_END
4381 && NOTE_KIND (insn
) != NOTE_INSN_CFA_RESTORE_STATE
)))
4382 print_rtl_single (final_output
, insn
);
4388 flag_dump_noaddr
= save_noaddr
;
4389 flag_dump_unnumbered
= save_unnumbered
;
4390 final_insns_dump_p
= false;
4392 if (fclose (final_output
))
4394 error ("could not close final insn dump file %qs: %m",
4395 flag_dump_final_insns
);
4396 flag_dump_final_insns
= NULL
;
4400 /* In case the function was not output,
4401 don't leave any temporary anonymous types
4402 queued up for sdb output. */
4403 #ifdef SDB_DEBUGGING_INFO
4404 if (write_symbols
== SDB_DEBUG
)
4405 sdbout_types (NULL_TREE
);
4408 flag_rerun_cse_after_global_opts
= 0;
4409 reload_completed
= 0;
4410 epilogue_completed
= 0;
4412 regstack_completed
= 0;
4415 /* Clear out the insn_length contents now that they are no
4417 init_insn_lengths ();
4419 /* Show no temporary slots allocated. */
4422 free_bb_for_insn ();
4426 /* We can reduce stack alignment on call site only when we are sure that
4427 the function body just produced will be actually used in the final
4429 if (decl_binds_to_current_def_p (current_function_decl
))
4431 unsigned int pref
= crtl
->preferred_stack_boundary
;
4432 if (crtl
->stack_alignment_needed
> crtl
->preferred_stack_boundary
)
4433 pref
= crtl
->stack_alignment_needed
;
4434 cgraph_rtl_info (current_function_decl
)->preferred_incoming_stack_boundary
4438 /* Make sure volatile mem refs aren't considered valid operands for
4439 arithmetic insns. We must call this here if this is a nested inline
4440 function, since the above code leaves us in the init_recog state,
4441 and the function context push/pop code does not save/restore volatile_ok.
4443 ??? Maybe it isn't necessary for expand_start_function to call this
4444 anymore if we do it here? */
4446 init_recog_no_volatile ();
4448 /* We're done with this function. Free up memory if we can. */
4449 free_after_parsing (cfun
);
4450 free_after_compilation (cfun
);
4454 struct rtl_opt_pass pass_clean_state
=
4458 "*clean_state", /* name */
4460 rest_of_clean_state
, /* execute */
4463 0, /* static_pass_number */
4464 TV_FINAL
, /* tv_id */
4465 0, /* properties_required */
4466 0, /* properties_provided */
4467 PROP_rtl
, /* properties_destroyed */
4468 0, /* todo_flags_start */
4469 0 /* todo_flags_finish */