1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987-2013 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This is the final pass of the compiler.
21 It looks at the rtl code for a function and outputs assembler code.
23 Call `final_start_function' to output the assembler code for function entry,
24 `final' to output assembler code for some RTL code,
25 `final_end_function' to output assembler code for function exit.
26 If a function is compiled in several pieces, each piece is
27 output separately with `final'.
29 Some optimizations are also done at this level.
30 Move instructions that were made unnecessary by good register allocation
31 are detected and omitted from the output. (Though most of these
32 are removed by the last jump pass.)
34 Instructions to set the condition codes are omitted when it can be
35 seen that the condition codes already had the desired values.
37 In some cases it is sufficient if the inherited condition codes
38 have related values, but this may require the following insn
39 (the one that tests the condition codes) to be modified.
41 The code for the function prologue and epilogue are generated
42 directly in assembler by the target functions function_prologue and
43 function_epilogue. Those instructions never exist as rtl. */
47 #include "coretypes.h"
54 #include "insn-config.h"
55 #include "insn-attr.h"
57 #include "conditions.h"
59 #include "hard-reg-set.h"
63 #include "rtl-error.h"
64 #include "toplev.h" /* exact_log2, floor_log2 */
67 #include "basic-block.h"
69 #include "targhooks.h"
72 #include "tree-pass.h"
73 #include "tree-flow.h"
80 #include "tree-pretty-print.h" /* for dump_function_header */
82 #ifdef XCOFF_DEBUGGING_INFO
83 #include "xcoffout.h" /* Needed for external data
84 declarations for e.g. AIX 4.x. */
87 #include "dwarf2out.h"
89 #ifdef DBX_DEBUGGING_INFO
93 #ifdef SDB_DEBUGGING_INFO
97 /* Most ports that aren't using cc0 don't need to define CC_STATUS_INIT.
98 So define a null default for it to save conditionalization later. */
99 #ifndef CC_STATUS_INIT
100 #define CC_STATUS_INIT
103 /* Is the given character a logical line separator for the assembler? */
104 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
105 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C, STR) ((C) == ';')
108 #ifndef JUMP_TABLES_IN_TEXT_SECTION
109 #define JUMP_TABLES_IN_TEXT_SECTION 0
112 /* Bitflags used by final_scan_insn. */
115 #define SEEN_EMITTED 4
117 /* Last insn processed by final_scan_insn. */
118 static rtx debug_insn
;
119 rtx current_output_insn
;
121 /* Line number of last NOTE. */
122 static int last_linenum
;
124 /* Last discriminator written to assembly. */
125 static int last_discriminator
;
127 /* Discriminator of current block. */
128 static int discriminator
;
130 /* Highest line number in current block. */
131 static int high_block_linenum
;
133 /* Likewise for function. */
134 static int high_function_linenum
;
136 /* Filename of last NOTE. */
137 static const char *last_filename
;
139 /* Override filename and line number. */
140 static const char *override_filename
;
141 static int override_linenum
;
143 /* Whether to force emission of a line note before the next insn. */
144 static bool force_source_line
= false;
146 extern const int length_unit_log
; /* This is defined in insn-attrtab.c. */
148 /* Nonzero while outputting an `asm' with operands.
149 This means that inconsistencies are the user's fault, so don't die.
150 The precise value is the insn being output, to pass to error_for_asm. */
151 rtx this_is_asm_operands
;
153 /* Number of operands of this insn, for an `asm' with operands. */
154 static unsigned int insn_noperands
;
156 /* Compare optimization flag. */
158 static rtx last_ignored_compare
= 0;
160 /* Assign a unique number to each insn that is output.
161 This can be used to generate unique local labels. */
163 static int insn_counter
= 0;
166 /* This variable contains machine-dependent flags (defined in tm.h)
167 set and examined by output routines
168 that describe how to interpret the condition codes properly. */
172 /* During output of an insn, this contains a copy of cc_status
173 from before the insn. */
175 CC_STATUS cc_prev_status
;
178 /* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen. */
180 static int block_depth
;
182 /* Nonzero if have enabled APP processing of our assembler output. */
186 /* If we are outputting an insn sequence, this contains the sequence rtx.
191 #ifdef ASSEMBLER_DIALECT
193 /* Number of the assembler dialect to use, starting at 0. */
194 static int dialect_number
;
197 /* Nonnull if the insn currently being emitted was a COND_EXEC pattern. */
198 rtx current_insn_predicate
;
200 /* True if printing into -fdump-final-insns= dump. */
201 bool final_insns_dump_p
;
203 static int asm_insn_count (rtx
);
204 static void profile_function (FILE *);
205 static void profile_after_prologue (FILE *);
206 static bool notice_source_line (rtx
, bool *);
207 static rtx
walk_alter_subreg (rtx
*, bool *);
208 static void output_asm_name (void);
209 static void output_alternate_entry_point (FILE *, rtx
);
210 static tree
get_mem_expr_from_op (rtx
, int *);
211 static void output_asm_operand_names (rtx
*, int *, int);
212 #ifdef LEAF_REGISTERS
213 static void leaf_renumber_regs (rtx
);
216 static int alter_cond (rtx
);
218 #ifndef ADDR_VEC_ALIGN
219 static int final_addr_vec_align (rtx
);
221 static int align_fuzz (rtx
, rtx
, int, unsigned);
223 /* Initialize data in final at the beginning of a compilation. */
226 init_final (const char *filename ATTRIBUTE_UNUSED
)
231 #ifdef ASSEMBLER_DIALECT
232 dialect_number
= ASSEMBLER_DIALECT
;
236 /* Default target function prologue and epilogue assembler output.
238 If not overridden for epilogue code, then the function body itself
239 contains return instructions wherever needed. */
241 default_function_pro_epilogue (FILE *file ATTRIBUTE_UNUSED
,
242 HOST_WIDE_INT size ATTRIBUTE_UNUSED
)
247 default_function_switched_text_sections (FILE *file ATTRIBUTE_UNUSED
,
248 tree decl ATTRIBUTE_UNUSED
,
249 bool new_is_cold ATTRIBUTE_UNUSED
)
253 /* Default target hook that outputs nothing to a stream. */
255 no_asm_to_stream (FILE *file ATTRIBUTE_UNUSED
)
259 /* Enable APP processing of subsequent output.
260 Used before the output from an `asm' statement. */
267 fputs (ASM_APP_ON
, asm_out_file
);
272 /* Disable APP processing of subsequent output.
273 Called from varasm.c before most kinds of output. */
280 fputs (ASM_APP_OFF
, asm_out_file
);
285 /* Return the number of slots filled in the current
286 delayed branch sequence (we don't count the insn needing the
287 delay slot). Zero if not in a delayed branch sequence. */
291 dbr_sequence_length (void)
293 if (final_sequence
!= 0)
294 return XVECLEN (final_sequence
, 0) - 1;
300 /* The next two pages contain routines used to compute the length of an insn
301 and to shorten branches. */
303 /* Arrays for insn lengths, and addresses. The latter is referenced by
304 `insn_current_length'. */
306 static int *insn_lengths
;
308 vec
<int> insn_addresses_
;
310 /* Max uid for which the above arrays are valid. */
311 static int insn_lengths_max_uid
;
313 /* Address of insn being processed. Used by `insn_current_length'. */
314 int insn_current_address
;
316 /* Address of insn being processed in previous iteration. */
317 int insn_last_address
;
319 /* known invariant alignment of insn being processed. */
320 int insn_current_align
;
322 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
323 gives the next following alignment insn that increases the known
324 alignment, or NULL_RTX if there is no such insn.
325 For any alignment obtained this way, we can again index uid_align with
326 its uid to obtain the next following align that in turn increases the
327 alignment, till we reach NULL_RTX; the sequence obtained this way
328 for each insn we'll call the alignment chain of this insn in the following
331 struct label_alignment
337 static rtx
*uid_align
;
338 static int *uid_shuid
;
339 static struct label_alignment
*label_align
;
341 /* Indicate that branch shortening hasn't yet been done. */
344 init_insn_lengths (void)
355 insn_lengths_max_uid
= 0;
357 if (HAVE_ATTR_length
)
358 INSN_ADDRESSES_FREE ();
366 /* Obtain the current length of an insn. If branch shortening has been done,
367 get its actual length. Otherwise, use FALLBACK_FN to calculate the
370 get_attr_length_1 (rtx insn
, int (*fallback_fn
) (rtx
))
376 if (!HAVE_ATTR_length
)
379 if (insn_lengths_max_uid
> INSN_UID (insn
))
380 return insn_lengths
[INSN_UID (insn
)];
382 switch (GET_CODE (insn
))
391 length
= fallback_fn (insn
);
395 body
= PATTERN (insn
);
396 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
398 /* Alignment is machine-dependent and should be handled by
402 length
= fallback_fn (insn
);
406 body
= PATTERN (insn
);
407 if (GET_CODE (body
) == USE
|| GET_CODE (body
) == CLOBBER
)
410 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
411 length
= asm_insn_count (body
) * fallback_fn (insn
);
412 else if (GET_CODE (body
) == SEQUENCE
)
413 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
414 length
+= get_attr_length_1 (XVECEXP (body
, 0, i
), fallback_fn
);
416 length
= fallback_fn (insn
);
423 #ifdef ADJUST_INSN_LENGTH
424 ADJUST_INSN_LENGTH (insn
, length
);
429 /* Obtain the current length of an insn. If branch shortening has been done,
430 get its actual length. Otherwise, get its maximum length. */
432 get_attr_length (rtx insn
)
434 return get_attr_length_1 (insn
, insn_default_length
);
437 /* Obtain the current length of an insn. If branch shortening has been done,
438 get its actual length. Otherwise, get its minimum length. */
440 get_attr_min_length (rtx insn
)
442 return get_attr_length_1 (insn
, insn_min_length
);
445 /* Code to handle alignment inside shorten_branches. */
447 /* Here is an explanation how the algorithm in align_fuzz can give
450 Call a sequence of instructions beginning with alignment point X
451 and continuing until the next alignment point `block X'. When `X'
452 is used in an expression, it means the alignment value of the
455 Call the distance between the start of the first insn of block X, and
456 the end of the last insn of block X `IX', for the `inner size of X'.
457 This is clearly the sum of the instruction lengths.
459 Likewise with the next alignment-delimited block following X, which we
462 Call the distance between the start of the first insn of block X, and
463 the start of the first insn of block Y `OX', for the `outer size of X'.
465 The estimated padding is then OX - IX.
467 OX can be safely estimated as
472 OX = round_up(IX, X) + Y - X
474 Clearly est(IX) >= real(IX), because that only depends on the
475 instruction lengths, and those being overestimated is a given.
477 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
478 we needn't worry about that when thinking about OX.
480 When X >= Y, the alignment provided by Y adds no uncertainty factor
481 for branch ranges starting before X, so we can just round what we have.
482 But when X < Y, we don't know anything about the, so to speak,
483 `middle bits', so we have to assume the worst when aligning up from an
484 address mod X to one mod Y, which is Y - X. */
487 #define LABEL_ALIGN(LABEL) align_labels_log
491 #define LOOP_ALIGN(LABEL) align_loops_log
494 #ifndef LABEL_ALIGN_AFTER_BARRIER
495 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
499 #define JUMP_ALIGN(LABEL) align_jumps_log
503 default_label_align_after_barrier_max_skip (rtx insn ATTRIBUTE_UNUSED
)
509 default_loop_align_max_skip (rtx insn ATTRIBUTE_UNUSED
)
511 return align_loops_max_skip
;
515 default_label_align_max_skip (rtx insn ATTRIBUTE_UNUSED
)
517 return align_labels_max_skip
;
521 default_jump_align_max_skip (rtx insn ATTRIBUTE_UNUSED
)
523 return align_jumps_max_skip
;
526 #ifndef ADDR_VEC_ALIGN
528 final_addr_vec_align (rtx addr_vec
)
530 int align
= GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec
)));
532 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
533 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
534 return exact_log2 (align
);
538 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
541 #ifndef INSN_LENGTH_ALIGNMENT
542 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
545 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
547 static int min_labelno
, max_labelno
;
549 #define LABEL_TO_ALIGNMENT(LABEL) \
550 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
552 #define LABEL_TO_MAX_SKIP(LABEL) \
553 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
555 /* For the benefit of port specific code do this also as a function. */
558 label_to_alignment (rtx label
)
560 if (CODE_LABEL_NUMBER (label
) <= max_labelno
)
561 return LABEL_TO_ALIGNMENT (label
);
566 label_to_max_skip (rtx label
)
568 if (CODE_LABEL_NUMBER (label
) <= max_labelno
)
569 return LABEL_TO_MAX_SKIP (label
);
573 /* The differences in addresses
574 between a branch and its target might grow or shrink depending on
575 the alignment the start insn of the range (the branch for a forward
576 branch or the label for a backward branch) starts out on; if these
577 differences are used naively, they can even oscillate infinitely.
578 We therefore want to compute a 'worst case' address difference that
579 is independent of the alignment the start insn of the range end
580 up on, and that is at least as large as the actual difference.
581 The function align_fuzz calculates the amount we have to add to the
582 naively computed difference, by traversing the part of the alignment
583 chain of the start insn of the range that is in front of the end insn
584 of the range, and considering for each alignment the maximum amount
585 that it might contribute to a size increase.
587 For casesi tables, we also want to know worst case minimum amounts of
588 address difference, in case a machine description wants to introduce
589 some common offset that is added to all offsets in a table.
590 For this purpose, align_fuzz with a growth argument of 0 computes the
591 appropriate adjustment. */
593 /* Compute the maximum delta by which the difference of the addresses of
594 START and END might grow / shrink due to a different address for start
595 which changes the size of alignment insns between START and END.
596 KNOWN_ALIGN_LOG is the alignment known for START.
597 GROWTH should be ~0 if the objective is to compute potential code size
598 increase, and 0 if the objective is to compute potential shrink.
599 The return value is undefined for any other value of GROWTH. */
602 align_fuzz (rtx start
, rtx end
, int known_align_log
, unsigned int growth
)
604 int uid
= INSN_UID (start
);
606 int known_align
= 1 << known_align_log
;
607 int end_shuid
= INSN_SHUID (end
);
610 for (align_label
= uid_align
[uid
]; align_label
; align_label
= uid_align
[uid
])
612 int align_addr
, new_align
;
614 uid
= INSN_UID (align_label
);
615 align_addr
= INSN_ADDRESSES (uid
) - insn_lengths
[uid
];
616 if (uid_shuid
[uid
] > end_shuid
)
618 known_align_log
= LABEL_TO_ALIGNMENT (align_label
);
619 new_align
= 1 << known_align_log
;
620 if (new_align
< known_align
)
622 fuzz
+= (-align_addr
^ growth
) & (new_align
- known_align
);
623 known_align
= new_align
;
628 /* Compute a worst-case reference address of a branch so that it
629 can be safely used in the presence of aligned labels. Since the
630 size of the branch itself is unknown, the size of the branch is
631 not included in the range. I.e. for a forward branch, the reference
632 address is the end address of the branch as known from the previous
633 branch shortening pass, minus a value to account for possible size
634 increase due to alignment. For a backward branch, it is the start
635 address of the branch as known from the current pass, plus a value
636 to account for possible size increase due to alignment.
637 NB.: Therefore, the maximum offset allowed for backward branches needs
638 to exclude the branch size. */
641 insn_current_reference_address (rtx branch
)
646 if (! INSN_ADDRESSES_SET_P ())
649 seq
= NEXT_INSN (PREV_INSN (branch
));
650 seq_uid
= INSN_UID (seq
);
651 if (!JUMP_P (branch
))
652 /* This can happen for example on the PA; the objective is to know the
653 offset to address something in front of the start of the function.
654 Thus, we can treat it like a backward branch.
655 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
656 any alignment we'd encounter, so we skip the call to align_fuzz. */
657 return insn_current_address
;
658 dest
= JUMP_LABEL (branch
);
660 /* BRANCH has no proper alignment chain set, so use SEQ.
661 BRANCH also has no INSN_SHUID. */
662 if (INSN_SHUID (seq
) < INSN_SHUID (dest
))
664 /* Forward branch. */
665 return (insn_last_address
+ insn_lengths
[seq_uid
]
666 - align_fuzz (seq
, dest
, length_unit_log
, ~0));
670 /* Backward branch. */
671 return (insn_current_address
672 + align_fuzz (dest
, seq
, length_unit_log
, ~0));
676 /* Compute branch alignments based on frequency information in the
680 compute_alignments (void)
682 int log
, max_skip
, max_log
;
685 int freq_threshold
= 0;
693 max_labelno
= max_label_num ();
694 min_labelno
= get_first_label_num ();
695 label_align
= XCNEWVEC (struct label_alignment
, max_labelno
- min_labelno
+ 1);
697 /* If not optimizing or optimizing for size, don't assign any alignments. */
698 if (! optimize
|| optimize_function_for_size_p (cfun
))
703 dump_reg_info (dump_file
);
704 dump_flow_info (dump_file
, TDF_DETAILS
);
705 flow_loops_dump (dump_file
, NULL
, 1);
707 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
709 if (bb
->frequency
> freq_max
)
710 freq_max
= bb
->frequency
;
711 freq_threshold
= freq_max
/ PARAM_VALUE (PARAM_ALIGN_THRESHOLD
);
714 fprintf(dump_file
, "freq_max: %i\n",freq_max
);
717 rtx label
= BB_HEAD (bb
);
718 int fallthru_frequency
= 0, branch_frequency
= 0, has_fallthru
= 0;
723 || optimize_bb_for_size_p (bb
))
726 fprintf(dump_file
, "BB %4i freq %4i loop %2i loop_depth %2i skipped.\n",
727 bb
->index
, bb
->frequency
, bb
->loop_father
->num
,
731 max_log
= LABEL_ALIGN (label
);
732 max_skip
= targetm
.asm_out
.label_align_max_skip (label
);
734 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
736 if (e
->flags
& EDGE_FALLTHRU
)
737 has_fallthru
= 1, fallthru_frequency
+= EDGE_FREQUENCY (e
);
739 branch_frequency
+= EDGE_FREQUENCY (e
);
743 fprintf(dump_file
, "BB %4i freq %4i loop %2i loop_depth %2i fall %4i branch %4i",
744 bb
->index
, bb
->frequency
, bb
->loop_father
->num
,
746 fallthru_frequency
, branch_frequency
);
747 if (!bb
->loop_father
->inner
&& bb
->loop_father
->num
)
748 fprintf (dump_file
, " inner_loop");
749 if (bb
->loop_father
->header
== bb
)
750 fprintf (dump_file
, " loop_header");
751 fprintf (dump_file
, "\n");
754 /* There are two purposes to align block with no fallthru incoming edge:
755 1) to avoid fetch stalls when branch destination is near cache boundary
756 2) to improve cache efficiency in case the previous block is not executed
757 (so it does not need to be in the cache).
759 We to catch first case, we align frequently executed blocks.
760 To catch the second, we align blocks that are executed more frequently
761 than the predecessor and the predecessor is likely to not be executed
762 when function is called. */
765 && (branch_frequency
> freq_threshold
766 || (bb
->frequency
> bb
->prev_bb
->frequency
* 10
767 && (bb
->prev_bb
->frequency
768 <= ENTRY_BLOCK_PTR
->frequency
/ 2))))
770 log
= JUMP_ALIGN (label
);
772 fprintf(dump_file
, " jump alignment added.\n");
776 max_skip
= targetm
.asm_out
.jump_align_max_skip (label
);
779 /* In case block is frequent and reached mostly by non-fallthru edge,
780 align it. It is most likely a first block of loop. */
782 && optimize_bb_for_speed_p (bb
)
783 && branch_frequency
+ fallthru_frequency
> freq_threshold
785 > fallthru_frequency
* PARAM_VALUE (PARAM_ALIGN_LOOP_ITERATIONS
)))
787 log
= LOOP_ALIGN (label
);
789 fprintf(dump_file
, " internal loop alignment added.\n");
793 max_skip
= targetm
.asm_out
.loop_align_max_skip (label
);
796 LABEL_TO_ALIGNMENT (label
) = max_log
;
797 LABEL_TO_MAX_SKIP (label
) = max_skip
;
800 loop_optimizer_finalize ();
801 free_dominance_info (CDI_DOMINATORS
);
805 struct rtl_opt_pass pass_compute_alignments
=
809 "alignments", /* name */
810 OPTGROUP_NONE
, /* optinfo_flags */
812 compute_alignments
, /* execute */
815 0, /* static_pass_number */
817 0, /* properties_required */
818 0, /* properties_provided */
819 0, /* properties_destroyed */
820 0, /* todo_flags_start */
821 TODO_verify_rtl_sharing
822 | TODO_ggc_collect
/* todo_flags_finish */
827 /* Make a pass over all insns and compute their actual lengths by shortening
828 any branches of variable length if possible. */
830 /* shorten_branches might be called multiple times: for example, the SH
831 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
832 In order to do this, it needs proper length information, which it obtains
833 by calling shorten_branches. This cannot be collapsed with
834 shorten_branches itself into a single pass unless we also want to integrate
835 reorg.c, since the branch splitting exposes new instructions with delay
839 shorten_branches (rtx first
)
846 #define MAX_CODE_ALIGN 16
848 int something_changed
= 1;
849 char *varying_length
;
852 rtx align_tab
[MAX_CODE_ALIGN
];
854 /* Compute maximum UID and allocate label_align / uid_shuid. */
855 max_uid
= get_max_uid ();
857 /* Free uid_shuid before reallocating it. */
860 uid_shuid
= XNEWVEC (int, max_uid
);
862 if (max_labelno
!= max_label_num ())
864 int old
= max_labelno
;
868 max_labelno
= max_label_num ();
870 n_labels
= max_labelno
- min_labelno
+ 1;
871 n_old_labels
= old
- min_labelno
+ 1;
873 label_align
= XRESIZEVEC (struct label_alignment
, label_align
, n_labels
);
875 /* Range of labels grows monotonically in the function. Failing here
876 means that the initialization of array got lost. */
877 gcc_assert (n_old_labels
<= n_labels
);
879 memset (label_align
+ n_old_labels
, 0,
880 (n_labels
- n_old_labels
) * sizeof (struct label_alignment
));
883 /* Initialize label_align and set up uid_shuid to be strictly
884 monotonically rising with insn order. */
885 /* We use max_log here to keep track of the maximum alignment we want to
886 impose on the next CODE_LABEL (or the current one if we are processing
887 the CODE_LABEL itself). */
892 for (insn
= get_insns (), i
= 1; insn
; insn
= NEXT_INSN (insn
))
896 INSN_SHUID (insn
) = i
++;
903 bool next_is_jumptable
;
905 /* Merge in alignments computed by compute_alignments. */
906 log
= LABEL_TO_ALIGNMENT (insn
);
910 max_skip
= LABEL_TO_MAX_SKIP (insn
);
913 next
= next_nonnote_insn (insn
);
914 next_is_jumptable
= next
&& JUMP_TABLE_DATA_P (next
);
915 if (!next_is_jumptable
)
917 log
= LABEL_ALIGN (insn
);
921 max_skip
= targetm
.asm_out
.label_align_max_skip (insn
);
924 /* ADDR_VECs only take room if read-only data goes into the text
926 if ((JUMP_TABLES_IN_TEXT_SECTION
927 || readonly_data_section
== text_section
)
928 && next_is_jumptable
)
930 log
= ADDR_VEC_ALIGN (next
);
934 max_skip
= targetm
.asm_out
.label_align_max_skip (insn
);
937 LABEL_TO_ALIGNMENT (insn
) = max_log
;
938 LABEL_TO_MAX_SKIP (insn
) = max_skip
;
942 else if (BARRIER_P (insn
))
946 for (label
= insn
; label
&& ! INSN_P (label
);
947 label
= NEXT_INSN (label
))
950 log
= LABEL_ALIGN_AFTER_BARRIER (insn
);
954 max_skip
= targetm
.asm_out
.label_align_after_barrier_max_skip (label
);
960 if (!HAVE_ATTR_length
)
963 /* Allocate the rest of the arrays. */
964 insn_lengths
= XNEWVEC (int, max_uid
);
965 insn_lengths_max_uid
= max_uid
;
966 /* Syntax errors can lead to labels being outside of the main insn stream.
967 Initialize insn_addresses, so that we get reproducible results. */
968 INSN_ADDRESSES_ALLOC (max_uid
);
970 varying_length
= XCNEWVEC (char, max_uid
);
972 /* Initialize uid_align. We scan instructions
973 from end to start, and keep in align_tab[n] the last seen insn
974 that does an alignment of at least n+1, i.e. the successor
975 in the alignment chain for an insn that does / has a known
977 uid_align
= XCNEWVEC (rtx
, max_uid
);
979 for (i
= MAX_CODE_ALIGN
; --i
>= 0;)
980 align_tab
[i
] = NULL_RTX
;
981 seq
= get_last_insn ();
982 for (; seq
; seq
= PREV_INSN (seq
))
984 int uid
= INSN_UID (seq
);
986 log
= (LABEL_P (seq
) ? LABEL_TO_ALIGNMENT (seq
) : 0);
987 uid_align
[uid
] = align_tab
[0];
990 /* Found an alignment label. */
991 uid_align
[uid
] = align_tab
[log
];
992 for (i
= log
- 1; i
>= 0; i
--)
997 /* When optimizing, we start assuming minimum length, and keep increasing
998 lengths as we find the need for this, till nothing changes.
999 When not optimizing, we start assuming maximum lengths, and
1000 do a single pass to update the lengths. */
1001 bool increasing
= optimize
!= 0;
1003 #ifdef CASE_VECTOR_SHORTEN_MODE
1006 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1009 int min_shuid
= INSN_SHUID (get_insns ()) - 1;
1010 int max_shuid
= INSN_SHUID (get_last_insn ()) + 1;
1013 for (insn
= first
; insn
!= 0; insn
= NEXT_INSN (insn
))
1015 rtx min_lab
= NULL_RTX
, max_lab
= NULL_RTX
, pat
;
1016 int len
, i
, min
, max
, insn_shuid
;
1018 addr_diff_vec_flags flags
;
1021 || GET_CODE (PATTERN (insn
)) != ADDR_DIFF_VEC
)
1023 pat
= PATTERN (insn
);
1024 len
= XVECLEN (pat
, 1);
1025 gcc_assert (len
> 0);
1026 min_align
= MAX_CODE_ALIGN
;
1027 for (min
= max_shuid
, max
= min_shuid
, i
= len
- 1; i
>= 0; i
--)
1029 rtx lab
= XEXP (XVECEXP (pat
, 1, i
), 0);
1030 int shuid
= INSN_SHUID (lab
);
1041 if (min_align
> LABEL_TO_ALIGNMENT (lab
))
1042 min_align
= LABEL_TO_ALIGNMENT (lab
);
1044 XEXP (pat
, 2) = gen_rtx_LABEL_REF (Pmode
, min_lab
);
1045 XEXP (pat
, 3) = gen_rtx_LABEL_REF (Pmode
, max_lab
);
1046 insn_shuid
= INSN_SHUID (insn
);
1047 rel
= INSN_SHUID (XEXP (XEXP (pat
, 0), 0));
1048 memset (&flags
, 0, sizeof (flags
));
1049 flags
.min_align
= min_align
;
1050 flags
.base_after_vec
= rel
> insn_shuid
;
1051 flags
.min_after_vec
= min
> insn_shuid
;
1052 flags
.max_after_vec
= max
> insn_shuid
;
1053 flags
.min_after_base
= min
> rel
;
1054 flags
.max_after_base
= max
> rel
;
1055 ADDR_DIFF_VEC_FLAGS (pat
) = flags
;
1058 PUT_MODE (pat
, CASE_VECTOR_SHORTEN_MODE (0, 0, pat
));
1061 #endif /* CASE_VECTOR_SHORTEN_MODE */
1063 /* Compute initial lengths, addresses, and varying flags for each insn. */
1064 int (*length_fun
) (rtx
) = increasing
? insn_min_length
: insn_default_length
;
1066 for (insn_current_address
= 0, insn
= first
;
1068 insn_current_address
+= insn_lengths
[uid
], insn
= NEXT_INSN (insn
))
1070 uid
= INSN_UID (insn
);
1072 insn_lengths
[uid
] = 0;
1076 int log
= LABEL_TO_ALIGNMENT (insn
);
1079 int align
= 1 << log
;
1080 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1081 insn_lengths
[uid
] = new_address
- insn_current_address
;
1085 INSN_ADDRESSES (uid
) = insn_current_address
+ insn_lengths
[uid
];
1087 if (NOTE_P (insn
) || BARRIER_P (insn
)
1088 || LABEL_P (insn
) || DEBUG_INSN_P(insn
))
1090 if (INSN_DELETED_P (insn
))
1093 body
= PATTERN (insn
);
1094 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
1096 /* This only takes room if read-only data goes into the text
1098 if (JUMP_TABLES_IN_TEXT_SECTION
1099 || readonly_data_section
== text_section
)
1100 insn_lengths
[uid
] = (XVECLEN (body
,
1101 GET_CODE (body
) == ADDR_DIFF_VEC
)
1102 * GET_MODE_SIZE (GET_MODE (body
)));
1103 /* Alignment is handled by ADDR_VEC_ALIGN. */
1105 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
1106 insn_lengths
[uid
] = asm_insn_count (body
) * insn_default_length (insn
);
1107 else if (GET_CODE (body
) == SEQUENCE
)
1110 int const_delay_slots
;
1112 const_delay_slots
= const_num_delay_slots (XVECEXP (body
, 0, 0));
1114 const_delay_slots
= 0;
1116 int (*inner_length_fun
) (rtx
)
1117 = const_delay_slots
? length_fun
: insn_default_length
;
1118 /* Inside a delay slot sequence, we do not do any branch shortening
1119 if the shortening could change the number of delay slots
1121 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1123 rtx inner_insn
= XVECEXP (body
, 0, i
);
1124 int inner_uid
= INSN_UID (inner_insn
);
1127 if (GET_CODE (body
) == ASM_INPUT
1128 || asm_noperands (PATTERN (XVECEXP (body
, 0, i
))) >= 0)
1129 inner_length
= (asm_insn_count (PATTERN (inner_insn
))
1130 * insn_default_length (inner_insn
));
1132 inner_length
= inner_length_fun (inner_insn
);
1134 insn_lengths
[inner_uid
] = inner_length
;
1135 if (const_delay_slots
)
1137 if ((varying_length
[inner_uid
]
1138 = insn_variable_length_p (inner_insn
)) != 0)
1139 varying_length
[uid
] = 1;
1140 INSN_ADDRESSES (inner_uid
) = (insn_current_address
1141 + insn_lengths
[uid
]);
1144 varying_length
[inner_uid
] = 0;
1145 insn_lengths
[uid
] += inner_length
;
1148 else if (GET_CODE (body
) != USE
&& GET_CODE (body
) != CLOBBER
)
1150 insn_lengths
[uid
] = length_fun (insn
);
1151 varying_length
[uid
] = insn_variable_length_p (insn
);
1154 /* If needed, do any adjustment. */
1155 #ifdef ADJUST_INSN_LENGTH
1156 ADJUST_INSN_LENGTH (insn
, insn_lengths
[uid
]);
1157 if (insn_lengths
[uid
] < 0)
1158 fatal_insn ("negative insn length", insn
);
1162 /* Now loop over all the insns finding varying length insns. For each,
1163 get the current insn length. If it has changed, reflect the change.
1164 When nothing changes for a full pass, we are done. */
1166 while (something_changed
)
1168 something_changed
= 0;
1169 insn_current_align
= MAX_CODE_ALIGN
- 1;
1170 for (insn_current_address
= 0, insn
= first
;
1172 insn
= NEXT_INSN (insn
))
1175 #ifdef ADJUST_INSN_LENGTH
1180 uid
= INSN_UID (insn
);
1184 int log
= LABEL_TO_ALIGNMENT (insn
);
1185 if (log
> insn_current_align
)
1187 int align
= 1 << log
;
1188 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1189 insn_lengths
[uid
] = new_address
- insn_current_address
;
1190 insn_current_align
= log
;
1191 insn_current_address
= new_address
;
1194 insn_lengths
[uid
] = 0;
1195 INSN_ADDRESSES (uid
) = insn_current_address
;
1199 length_align
= INSN_LENGTH_ALIGNMENT (insn
);
1200 if (length_align
< insn_current_align
)
1201 insn_current_align
= length_align
;
1203 insn_last_address
= INSN_ADDRESSES (uid
);
1204 INSN_ADDRESSES (uid
) = insn_current_address
;
1206 #ifdef CASE_VECTOR_SHORTEN_MODE
1207 if (optimize
&& JUMP_P (insn
)
1208 && GET_CODE (PATTERN (insn
)) == ADDR_DIFF_VEC
)
1210 rtx body
= PATTERN (insn
);
1211 int old_length
= insn_lengths
[uid
];
1212 rtx rel_lab
= XEXP (XEXP (body
, 0), 0);
1213 rtx min_lab
= XEXP (XEXP (body
, 2), 0);
1214 rtx max_lab
= XEXP (XEXP (body
, 3), 0);
1215 int rel_addr
= INSN_ADDRESSES (INSN_UID (rel_lab
));
1216 int min_addr
= INSN_ADDRESSES (INSN_UID (min_lab
));
1217 int max_addr
= INSN_ADDRESSES (INSN_UID (max_lab
));
1220 addr_diff_vec_flags flags
;
1221 enum machine_mode vec_mode
;
1223 /* Avoid automatic aggregate initialization. */
1224 flags
= ADDR_DIFF_VEC_FLAGS (body
);
1226 /* Try to find a known alignment for rel_lab. */
1227 for (prev
= rel_lab
;
1229 && ! insn_lengths
[INSN_UID (prev
)]
1230 && ! (varying_length
[INSN_UID (prev
)] & 1);
1231 prev
= PREV_INSN (prev
))
1232 if (varying_length
[INSN_UID (prev
)] & 2)
1234 rel_align
= LABEL_TO_ALIGNMENT (prev
);
1238 /* See the comment on addr_diff_vec_flags in rtl.h for the
1239 meaning of the flags values. base: REL_LAB vec: INSN */
1240 /* Anything after INSN has still addresses from the last
1241 pass; adjust these so that they reflect our current
1242 estimate for this pass. */
1243 if (flags
.base_after_vec
)
1244 rel_addr
+= insn_current_address
- insn_last_address
;
1245 if (flags
.min_after_vec
)
1246 min_addr
+= insn_current_address
- insn_last_address
;
1247 if (flags
.max_after_vec
)
1248 max_addr
+= insn_current_address
- insn_last_address
;
1249 /* We want to know the worst case, i.e. lowest possible value
1250 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1251 its offset is positive, and we have to be wary of code shrink;
1252 otherwise, it is negative, and we have to be vary of code
1254 if (flags
.min_after_base
)
1256 /* If INSN is between REL_LAB and MIN_LAB, the size
1257 changes we are about to make can change the alignment
1258 within the observed offset, therefore we have to break
1259 it up into two parts that are independent. */
1260 if (! flags
.base_after_vec
&& flags
.min_after_vec
)
1262 min_addr
-= align_fuzz (rel_lab
, insn
, rel_align
, 0);
1263 min_addr
-= align_fuzz (insn
, min_lab
, 0, 0);
1266 min_addr
-= align_fuzz (rel_lab
, min_lab
, rel_align
, 0);
1270 if (flags
.base_after_vec
&& ! flags
.min_after_vec
)
1272 min_addr
-= align_fuzz (min_lab
, insn
, 0, ~0);
1273 min_addr
-= align_fuzz (insn
, rel_lab
, 0, ~0);
1276 min_addr
-= align_fuzz (min_lab
, rel_lab
, 0, ~0);
1278 /* Likewise, determine the highest lowest possible value
1279 for the offset of MAX_LAB. */
1280 if (flags
.max_after_base
)
1282 if (! flags
.base_after_vec
&& flags
.max_after_vec
)
1284 max_addr
+= align_fuzz (rel_lab
, insn
, rel_align
, ~0);
1285 max_addr
+= align_fuzz (insn
, max_lab
, 0, ~0);
1288 max_addr
+= align_fuzz (rel_lab
, max_lab
, rel_align
, ~0);
1292 if (flags
.base_after_vec
&& ! flags
.max_after_vec
)
1294 max_addr
+= align_fuzz (max_lab
, insn
, 0, 0);
1295 max_addr
+= align_fuzz (insn
, rel_lab
, 0, 0);
1298 max_addr
+= align_fuzz (max_lab
, rel_lab
, 0, 0);
1300 vec_mode
= CASE_VECTOR_SHORTEN_MODE (min_addr
- rel_addr
,
1301 max_addr
- rel_addr
, body
);
1303 || (GET_MODE_SIZE (vec_mode
)
1304 >= GET_MODE_SIZE (GET_MODE (body
))))
1305 PUT_MODE (body
, vec_mode
);
1306 if (JUMP_TABLES_IN_TEXT_SECTION
1307 || readonly_data_section
== text_section
)
1310 = (XVECLEN (body
, 1) * GET_MODE_SIZE (GET_MODE (body
)));
1311 insn_current_address
+= insn_lengths
[uid
];
1312 if (insn_lengths
[uid
] != old_length
)
1313 something_changed
= 1;
1318 #endif /* CASE_VECTOR_SHORTEN_MODE */
1320 if (! (varying_length
[uid
]))
1322 if (NONJUMP_INSN_P (insn
)
1323 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1327 body
= PATTERN (insn
);
1328 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1330 rtx inner_insn
= XVECEXP (body
, 0, i
);
1331 int inner_uid
= INSN_UID (inner_insn
);
1333 INSN_ADDRESSES (inner_uid
) = insn_current_address
;
1335 insn_current_address
+= insn_lengths
[inner_uid
];
1339 insn_current_address
+= insn_lengths
[uid
];
1344 if (NONJUMP_INSN_P (insn
) && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1348 body
= PATTERN (insn
);
1350 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1352 rtx inner_insn
= XVECEXP (body
, 0, i
);
1353 int inner_uid
= INSN_UID (inner_insn
);
1356 INSN_ADDRESSES (inner_uid
) = insn_current_address
;
1358 /* insn_current_length returns 0 for insns with a
1359 non-varying length. */
1360 if (! varying_length
[inner_uid
])
1361 inner_length
= insn_lengths
[inner_uid
];
1363 inner_length
= insn_current_length (inner_insn
);
1365 if (inner_length
!= insn_lengths
[inner_uid
])
1367 if (!increasing
|| inner_length
> insn_lengths
[inner_uid
])
1369 insn_lengths
[inner_uid
] = inner_length
;
1370 something_changed
= 1;
1373 inner_length
= insn_lengths
[inner_uid
];
1375 insn_current_address
+= inner_length
;
1376 new_length
+= inner_length
;
1381 new_length
= insn_current_length (insn
);
1382 insn_current_address
+= new_length
;
1385 #ifdef ADJUST_INSN_LENGTH
1386 /* If needed, do any adjustment. */
1387 tmp_length
= new_length
;
1388 ADJUST_INSN_LENGTH (insn
, new_length
);
1389 insn_current_address
+= (new_length
- tmp_length
);
1392 if (new_length
!= insn_lengths
[uid
]
1393 && (!increasing
|| new_length
> insn_lengths
[uid
]))
1395 insn_lengths
[uid
] = new_length
;
1396 something_changed
= 1;
1399 insn_current_address
+= insn_lengths
[uid
] - new_length
;
1401 /* For a non-optimizing compile, do only a single pass. */
1406 free (varying_length
);
1409 /* Given the body of an INSN known to be generated by an ASM statement, return
1410 the number of machine instructions likely to be generated for this insn.
1411 This is used to compute its length. */
1414 asm_insn_count (rtx body
)
1418 if (GET_CODE (body
) == ASM_INPUT
)
1419 templ
= XSTR (body
, 0);
1421 templ
= decode_asm_operands (body
, NULL
, NULL
, NULL
, NULL
, NULL
);
1423 return asm_str_count (templ
);
1426 /* Return the number of machine instructions likely to be generated for the
1427 inline-asm template. */
1429 asm_str_count (const char *templ
)
1436 for (; *templ
; templ
++)
1437 if (IS_ASM_LOGICAL_LINE_SEPARATOR (*templ
, templ
)
1444 /* ??? This is probably the wrong place for these. */
1445 /* Structure recording the mapping from source file and directory
1446 names at compile time to those to be embedded in debug
1448 typedef struct debug_prefix_map
1450 const char *old_prefix
;
1451 const char *new_prefix
;
1454 struct debug_prefix_map
*next
;
1457 /* Linked list of such structures. */
1458 debug_prefix_map
*debug_prefix_maps
;
1461 /* Record a debug file prefix mapping. ARG is the argument to
1462 -fdebug-prefix-map and must be of the form OLD=NEW. */
1465 add_debug_prefix_map (const char *arg
)
1467 debug_prefix_map
*map
;
1470 p
= strchr (arg
, '=');
1473 error ("invalid argument %qs to -fdebug-prefix-map", arg
);
1476 map
= XNEW (debug_prefix_map
);
1477 map
->old_prefix
= xstrndup (arg
, p
- arg
);
1478 map
->old_len
= p
- arg
;
1480 map
->new_prefix
= xstrdup (p
);
1481 map
->new_len
= strlen (p
);
1482 map
->next
= debug_prefix_maps
;
1483 debug_prefix_maps
= map
;
1486 /* Perform user-specified mapping of debug filename prefixes. Return
1487 the new name corresponding to FILENAME. */
1490 remap_debug_filename (const char *filename
)
1492 debug_prefix_map
*map
;
1497 for (map
= debug_prefix_maps
; map
; map
= map
->next
)
1498 if (filename_ncmp (filename
, map
->old_prefix
, map
->old_len
) == 0)
1502 name
= filename
+ map
->old_len
;
1503 name_len
= strlen (name
) + 1;
1504 s
= (char *) alloca (name_len
+ map
->new_len
);
1505 memcpy (s
, map
->new_prefix
, map
->new_len
);
1506 memcpy (s
+ map
->new_len
, name
, name_len
);
1507 return ggc_strdup (s
);
1510 /* Return true if DWARF2 debug info can be emitted for DECL. */
1513 dwarf2_debug_info_emitted_p (tree decl
)
1515 if (write_symbols
!= DWARF2_DEBUG
&& write_symbols
!= VMS_AND_DWARF2_DEBUG
)
1518 if (DECL_IGNORED_P (decl
))
1524 /* Return scope resulting from combination of S1 and S2. */
1526 choose_inner_scope (tree s1
, tree s2
)
1532 if (BLOCK_NUMBER (s1
) > BLOCK_NUMBER (s2
))
1537 /* Emit lexical block notes needed to change scope from S1 to S2. */
1540 change_scope (rtx orig_insn
, tree s1
, tree s2
)
1542 rtx insn
= orig_insn
;
1543 tree com
= NULL_TREE
;
1544 tree ts1
= s1
, ts2
= s2
;
1549 gcc_assert (ts1
&& ts2
);
1550 if (BLOCK_NUMBER (ts1
) > BLOCK_NUMBER (ts2
))
1551 ts1
= BLOCK_SUPERCONTEXT (ts1
);
1552 else if (BLOCK_NUMBER (ts1
) < BLOCK_NUMBER (ts2
))
1553 ts2
= BLOCK_SUPERCONTEXT (ts2
);
1556 ts1
= BLOCK_SUPERCONTEXT (ts1
);
1557 ts2
= BLOCK_SUPERCONTEXT (ts2
);
1566 rtx note
= emit_note_before (NOTE_INSN_BLOCK_END
, insn
);
1567 NOTE_BLOCK (note
) = s
;
1568 s
= BLOCK_SUPERCONTEXT (s
);
1575 insn
= emit_note_before (NOTE_INSN_BLOCK_BEG
, insn
);
1576 NOTE_BLOCK (insn
) = s
;
1577 s
= BLOCK_SUPERCONTEXT (s
);
1581 /* Rebuild all the NOTE_INSN_BLOCK_BEG and NOTE_INSN_BLOCK_END notes based
1582 on the scope tree and the newly reordered instructions. */
1585 reemit_insn_block_notes (void)
1587 tree cur_block
= DECL_INITIAL (cfun
->decl
);
1590 insn
= get_insns ();
1591 if (!active_insn_p (insn
))
1592 insn
= next_active_insn (insn
);
1593 for (; insn
; insn
= next_active_insn (insn
))
1597 /* Avoid putting scope notes between jump table and its label. */
1598 if (JUMP_TABLE_DATA_P (insn
))
1601 this_block
= insn_scope (insn
);
1602 /* For sequences compute scope resulting from merging all scopes
1603 of instructions nested inside. */
1604 if (GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1607 rtx body
= PATTERN (insn
);
1610 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1611 this_block
= choose_inner_scope (this_block
,
1612 insn_scope (XVECEXP (body
, 0, i
)));
1616 if (INSN_LOCATION (insn
) == UNKNOWN_LOCATION
)
1619 this_block
= DECL_INITIAL (cfun
->decl
);
1622 if (this_block
!= cur_block
)
1624 change_scope (insn
, cur_block
, this_block
);
1625 cur_block
= this_block
;
1629 /* change_scope emits before the insn, not after. */
1630 note
= emit_note (NOTE_INSN_DELETED
);
1631 change_scope (note
, cur_block
, DECL_INITIAL (cfun
->decl
));
1637 /* Output assembler code for the start of a function,
1638 and initialize some of the variables in this file
1639 for the new function. The label for the function and associated
1640 assembler pseudo-ops have already been output in `assemble_start_function'.
1642 FIRST is the first insn of the rtl for the function being compiled.
1643 FILE is the file to write assembler code to.
1644 OPTIMIZE_P is nonzero if we should eliminate redundant
1645 test and compare insns. */
1648 final_start_function (rtx first ATTRIBUTE_UNUSED
, FILE *file
,
1649 int optimize_p ATTRIBUTE_UNUSED
)
1653 this_is_asm_operands
= 0;
1655 last_filename
= LOCATION_FILE (prologue_location
);
1656 last_linenum
= LOCATION_LINE (prologue_location
);
1657 last_discriminator
= discriminator
= 0;
1659 high_block_linenum
= high_function_linenum
= last_linenum
;
1661 if (!DECL_IGNORED_P (current_function_decl
))
1662 debug_hooks
->begin_prologue (last_linenum
, last_filename
);
1664 if (!dwarf2_debug_info_emitted_p (current_function_decl
))
1665 dwarf2out_begin_prologue (0, NULL
);
1667 #ifdef LEAF_REG_REMAP
1668 if (crtl
->uses_only_leaf_regs
)
1669 leaf_renumber_regs (first
);
1672 /* The Sun386i and perhaps other machines don't work right
1673 if the profiling code comes after the prologue. */
1674 if (targetm
.profile_before_prologue () && crtl
->profile
)
1675 profile_function (file
);
1677 /* If debugging, assign block numbers to all of the blocks in this
1681 reemit_insn_block_notes ();
1682 number_blocks (current_function_decl
);
1683 /* We never actually put out begin/end notes for the top-level
1684 block in the function. But, conceptually, that block is
1686 TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl
)) = 1;
1689 if (warn_frame_larger_than
1690 && get_frame_size () > frame_larger_than_size
)
1692 /* Issue a warning */
1693 warning (OPT_Wframe_larger_than_
,
1694 "the frame size of %wd bytes is larger than %wd bytes",
1695 get_frame_size (), frame_larger_than_size
);
1698 /* First output the function prologue: code to set up the stack frame. */
1699 targetm
.asm_out
.function_prologue (file
, get_frame_size ());
1701 /* If the machine represents the prologue as RTL, the profiling code must
1702 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1703 #ifdef HAVE_prologue
1704 if (! HAVE_prologue
)
1706 profile_after_prologue (file
);
1710 profile_after_prologue (FILE *file ATTRIBUTE_UNUSED
)
1712 if (!targetm
.profile_before_prologue () && crtl
->profile
)
1713 profile_function (file
);
1717 profile_function (FILE *file ATTRIBUTE_UNUSED
)
1719 #ifndef NO_PROFILE_COUNTERS
1720 # define NO_PROFILE_COUNTERS 0
1722 #ifdef ASM_OUTPUT_REG_PUSH
1723 rtx sval
= NULL
, chain
= NULL
;
1725 if (cfun
->returns_struct
)
1726 sval
= targetm
.calls
.struct_value_rtx (TREE_TYPE (current_function_decl
),
1728 if (cfun
->static_chain_decl
)
1729 chain
= targetm
.calls
.static_chain (current_function_decl
, true);
1730 #endif /* ASM_OUTPUT_REG_PUSH */
1732 if (! NO_PROFILE_COUNTERS
)
1734 int align
= MIN (BIGGEST_ALIGNMENT
, LONG_TYPE_SIZE
);
1735 switch_to_section (data_section
);
1736 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
1737 targetm
.asm_out
.internal_label (file
, "LP", current_function_funcdef_no
);
1738 assemble_integer (const0_rtx
, LONG_TYPE_SIZE
/ BITS_PER_UNIT
, align
, 1);
1741 switch_to_section (current_function_section ());
1743 #ifdef ASM_OUTPUT_REG_PUSH
1744 if (sval
&& REG_P (sval
))
1745 ASM_OUTPUT_REG_PUSH (file
, REGNO (sval
));
1746 if (chain
&& REG_P (chain
))
1747 ASM_OUTPUT_REG_PUSH (file
, REGNO (chain
));
1750 FUNCTION_PROFILER (file
, current_function_funcdef_no
);
1752 #ifdef ASM_OUTPUT_REG_PUSH
1753 if (chain
&& REG_P (chain
))
1754 ASM_OUTPUT_REG_POP (file
, REGNO (chain
));
1755 if (sval
&& REG_P (sval
))
1756 ASM_OUTPUT_REG_POP (file
, REGNO (sval
));
1760 /* Output assembler code for the end of a function.
1761 For clarity, args are same as those of `final_start_function'
1762 even though not all of them are needed. */
1765 final_end_function (void)
1769 if (!DECL_IGNORED_P (current_function_decl
))
1770 debug_hooks
->end_function (high_function_linenum
);
1772 /* Finally, output the function epilogue:
1773 code to restore the stack frame and return to the caller. */
1774 targetm
.asm_out
.function_epilogue (asm_out_file
, get_frame_size ());
1776 /* And debug output. */
1777 if (!DECL_IGNORED_P (current_function_decl
))
1778 debug_hooks
->end_epilogue (last_linenum
, last_filename
);
1780 if (!dwarf2_debug_info_emitted_p (current_function_decl
)
1781 && dwarf2out_do_frame ())
1782 dwarf2out_end_epilogue (last_linenum
, last_filename
);
1786 /* Dumper helper for basic block information. FILE is the assembly
1787 output file, and INSN is the instruction being emitted. */
1790 dump_basic_block_info (FILE *file
, rtx insn
, basic_block
*start_to_bb
,
1791 basic_block
*end_to_bb
, int bb_map_size
, int *bb_seqn
)
1795 if (!flag_debug_asm
)
1798 if (INSN_UID (insn
) < bb_map_size
1799 && (bb
= start_to_bb
[INSN_UID (insn
)]) != NULL
)
1804 fprintf (file
, "%s BLOCK %d", ASM_COMMENT_START
, bb
->index
);
1806 fprintf (file
, " freq:%d", bb
->frequency
);
1808 fprintf (file
, " count:" HOST_WIDEST_INT_PRINT_DEC
,
1810 fprintf (file
, " seq:%d", (*bb_seqn
)++);
1811 fprintf (file
, "\n%s PRED:", ASM_COMMENT_START
);
1812 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
1814 dump_edge_info (file
, e
, TDF_DETAILS
, 0);
1816 fprintf (file
, "\n");
1818 if (INSN_UID (insn
) < bb_map_size
1819 && (bb
= end_to_bb
[INSN_UID (insn
)]) != NULL
)
1824 fprintf (asm_out_file
, "%s SUCC:", ASM_COMMENT_START
);
1825 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1827 dump_edge_info (asm_out_file
, e
, TDF_DETAILS
, 1);
1829 fprintf (file
, "\n");
1833 /* Output assembler code for some insns: all or part of a function.
1834 For description of args, see `final_start_function', above. */
1837 final (rtx first
, FILE *file
, int optimize_p
)
1842 /* Used for -dA dump. */
1843 basic_block
*start_to_bb
= NULL
;
1844 basic_block
*end_to_bb
= NULL
;
1845 int bb_map_size
= 0;
1848 last_ignored_compare
= 0;
1851 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1853 /* If CC tracking across branches is enabled, record the insn which
1854 jumps to each branch only reached from one place. */
1855 if (optimize_p
&& JUMP_P (insn
))
1857 rtx lab
= JUMP_LABEL (insn
);
1858 if (lab
&& LABEL_P (lab
) && LABEL_NUSES (lab
) == 1)
1860 LABEL_REFS (lab
) = insn
;
1874 bb_map_size
= get_max_uid () + 1;
1875 start_to_bb
= XCNEWVEC (basic_block
, bb_map_size
);
1876 end_to_bb
= XCNEWVEC (basic_block
, bb_map_size
);
1878 /* There is no cfg for a thunk. */
1879 if (!cfun
->is_thunk
)
1880 FOR_EACH_BB_REVERSE (bb
)
1882 start_to_bb
[INSN_UID (BB_HEAD (bb
))] = bb
;
1883 end_to_bb
[INSN_UID (BB_END (bb
))] = bb
;
1887 /* Output the insns. */
1888 for (insn
= first
; insn
;)
1890 if (HAVE_ATTR_length
)
1892 if ((unsigned) INSN_UID (insn
) >= INSN_ADDRESSES_SIZE ())
1894 /* This can be triggered by bugs elsewhere in the compiler if
1895 new insns are created after init_insn_lengths is called. */
1896 gcc_assert (NOTE_P (insn
));
1897 insn_current_address
= -1;
1900 insn_current_address
= INSN_ADDRESSES (INSN_UID (insn
));
1903 dump_basic_block_info (file
, insn
, start_to_bb
, end_to_bb
,
1904 bb_map_size
, &bb_seqn
);
1905 insn
= final_scan_insn (insn
, file
, optimize_p
, 0, &seen
);
1914 /* Remove CFI notes, to avoid compare-debug failures. */
1915 for (insn
= first
; insn
; insn
= next
)
1917 next
= NEXT_INSN (insn
);
1919 && (NOTE_KIND (insn
) == NOTE_INSN_CFI
1920 || NOTE_KIND (insn
) == NOTE_INSN_CFI_LABEL
))
1926 get_insn_template (int code
, rtx insn
)
1928 switch (insn_data
[code
].output_format
)
1930 case INSN_OUTPUT_FORMAT_SINGLE
:
1931 return insn_data
[code
].output
.single
;
1932 case INSN_OUTPUT_FORMAT_MULTI
:
1933 return insn_data
[code
].output
.multi
[which_alternative
];
1934 case INSN_OUTPUT_FORMAT_FUNCTION
:
1936 return (*insn_data
[code
].output
.function
) (recog_data
.operand
, insn
);
1943 /* Emit the appropriate declaration for an alternate-entry-point
1944 symbol represented by INSN, to FILE. INSN is a CODE_LABEL with
1945 LABEL_KIND != LABEL_NORMAL.
1947 The case fall-through in this function is intentional. */
1949 output_alternate_entry_point (FILE *file
, rtx insn
)
1951 const char *name
= LABEL_NAME (insn
);
1953 switch (LABEL_KIND (insn
))
1955 case LABEL_WEAK_ENTRY
:
1956 #ifdef ASM_WEAKEN_LABEL
1957 ASM_WEAKEN_LABEL (file
, name
);
1959 case LABEL_GLOBAL_ENTRY
:
1960 targetm
.asm_out
.globalize_label (file
, name
);
1961 case LABEL_STATIC_ENTRY
:
1962 #ifdef ASM_OUTPUT_TYPE_DIRECTIVE
1963 ASM_OUTPUT_TYPE_DIRECTIVE (file
, name
, "function");
1965 ASM_OUTPUT_LABEL (file
, name
);
1974 /* Given a CALL_INSN, find and return the nested CALL. */
1976 call_from_call_insn (rtx insn
)
1979 gcc_assert (CALL_P (insn
));
1982 while (GET_CODE (x
) != CALL
)
1984 switch (GET_CODE (x
))
1989 x
= COND_EXEC_CODE (x
);
1992 x
= XVECEXP (x
, 0, 0);
2002 /* The final scan for one insn, INSN.
2003 Args are same as in `final', except that INSN
2004 is the insn being scanned.
2005 Value returned is the next insn to be scanned.
2007 NOPEEPHOLES is the flag to disallow peephole processing (currently
2008 used for within delayed branch sequence output).
2010 SEEN is used to track the end of the prologue, for emitting
2011 debug information. We force the emission of a line note after
2012 both NOTE_INSN_PROLOGUE_END and NOTE_INSN_FUNCTION_BEG, or
2013 at the beginning of the second basic block, whichever comes
2017 final_scan_insn (rtx insn
, FILE *file
, int optimize_p ATTRIBUTE_UNUSED
,
2018 int nopeepholes ATTRIBUTE_UNUSED
, int *seen
)
2027 /* Ignore deleted insns. These can occur when we split insns (due to a
2028 template of "#") while not optimizing. */
2029 if (INSN_DELETED_P (insn
))
2030 return NEXT_INSN (insn
);
2032 switch (GET_CODE (insn
))
2035 switch (NOTE_KIND (insn
))
2037 case NOTE_INSN_DELETED
:
2040 case NOTE_INSN_SWITCH_TEXT_SECTIONS
:
2041 in_cold_section_p
= !in_cold_section_p
;
2043 if (dwarf2out_do_frame ())
2044 dwarf2out_switch_text_section ();
2045 else if (!DECL_IGNORED_P (current_function_decl
))
2046 debug_hooks
->switch_text_section ();
2048 switch_to_section (current_function_section ());
2049 targetm
.asm_out
.function_switched_text_sections (asm_out_file
,
2050 current_function_decl
,
2054 case NOTE_INSN_BASIC_BLOCK
:
2055 if (targetm
.asm_out
.unwind_emit
)
2056 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
2058 if ((*seen
& (SEEN_EMITTED
| SEEN_BB
)) == SEEN_BB
)
2060 *seen
|= SEEN_EMITTED
;
2061 force_source_line
= true;
2066 discriminator
= NOTE_BASIC_BLOCK (insn
)->discriminator
;
2070 case NOTE_INSN_EH_REGION_BEG
:
2071 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LEHB",
2072 NOTE_EH_HANDLER (insn
));
2075 case NOTE_INSN_EH_REGION_END
:
2076 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LEHE",
2077 NOTE_EH_HANDLER (insn
));
2080 case NOTE_INSN_PROLOGUE_END
:
2081 targetm
.asm_out
.function_end_prologue (file
);
2082 profile_after_prologue (file
);
2084 if ((*seen
& (SEEN_EMITTED
| SEEN_NOTE
)) == SEEN_NOTE
)
2086 *seen
|= SEEN_EMITTED
;
2087 force_source_line
= true;
2094 case NOTE_INSN_EPILOGUE_BEG
:
2095 if (!DECL_IGNORED_P (current_function_decl
))
2096 (*debug_hooks
->begin_epilogue
) (last_linenum
, last_filename
);
2097 targetm
.asm_out
.function_begin_epilogue (file
);
2101 dwarf2out_emit_cfi (NOTE_CFI (insn
));
2104 case NOTE_INSN_CFI_LABEL
:
2105 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LCFI",
2106 NOTE_LABEL_NUMBER (insn
));
2109 case NOTE_INSN_FUNCTION_BEG
:
2111 if (!DECL_IGNORED_P (current_function_decl
))
2112 debug_hooks
->end_prologue (last_linenum
, last_filename
);
2114 if ((*seen
& (SEEN_EMITTED
| SEEN_NOTE
)) == SEEN_NOTE
)
2116 *seen
|= SEEN_EMITTED
;
2117 force_source_line
= true;
2124 case NOTE_INSN_BLOCK_BEG
:
2125 if (debug_info_level
== DINFO_LEVEL_NORMAL
2126 || debug_info_level
== DINFO_LEVEL_VERBOSE
2127 || write_symbols
== DWARF2_DEBUG
2128 || write_symbols
== VMS_AND_DWARF2_DEBUG
2129 || write_symbols
== VMS_DEBUG
)
2131 int n
= BLOCK_NUMBER (NOTE_BLOCK (insn
));
2135 high_block_linenum
= last_linenum
;
2137 /* Output debugging info about the symbol-block beginning. */
2138 if (!DECL_IGNORED_P (current_function_decl
))
2139 debug_hooks
->begin_block (last_linenum
, n
);
2141 /* Mark this block as output. */
2142 TREE_ASM_WRITTEN (NOTE_BLOCK (insn
)) = 1;
2144 if (write_symbols
== DBX_DEBUG
2145 || write_symbols
== SDB_DEBUG
)
2147 location_t
*locus_ptr
2148 = block_nonartificial_location (NOTE_BLOCK (insn
));
2150 if (locus_ptr
!= NULL
)
2152 override_filename
= LOCATION_FILE (*locus_ptr
);
2153 override_linenum
= LOCATION_LINE (*locus_ptr
);
2158 case NOTE_INSN_BLOCK_END
:
2159 if (debug_info_level
== DINFO_LEVEL_NORMAL
2160 || debug_info_level
== DINFO_LEVEL_VERBOSE
2161 || write_symbols
== DWARF2_DEBUG
2162 || write_symbols
== VMS_AND_DWARF2_DEBUG
2163 || write_symbols
== VMS_DEBUG
)
2165 int n
= BLOCK_NUMBER (NOTE_BLOCK (insn
));
2169 /* End of a symbol-block. */
2171 gcc_assert (block_depth
>= 0);
2173 if (!DECL_IGNORED_P (current_function_decl
))
2174 debug_hooks
->end_block (high_block_linenum
, n
);
2176 if (write_symbols
== DBX_DEBUG
2177 || write_symbols
== SDB_DEBUG
)
2179 tree outer_block
= BLOCK_SUPERCONTEXT (NOTE_BLOCK (insn
));
2180 location_t
*locus_ptr
2181 = block_nonartificial_location (outer_block
);
2183 if (locus_ptr
!= NULL
)
2185 override_filename
= LOCATION_FILE (*locus_ptr
);
2186 override_linenum
= LOCATION_LINE (*locus_ptr
);
2190 override_filename
= NULL
;
2191 override_linenum
= 0;
2196 case NOTE_INSN_DELETED_LABEL
:
2197 /* Emit the label. We may have deleted the CODE_LABEL because
2198 the label could be proved to be unreachable, though still
2199 referenced (in the form of having its address taken. */
2200 ASM_OUTPUT_DEBUG_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
2203 case NOTE_INSN_DELETED_DEBUG_LABEL
:
2204 /* Similarly, but need to use different namespace for it. */
2205 if (CODE_LABEL_NUMBER (insn
) != -1)
2206 ASM_OUTPUT_DEBUG_LABEL (file
, "LDL", CODE_LABEL_NUMBER (insn
));
2209 case NOTE_INSN_VAR_LOCATION
:
2210 case NOTE_INSN_CALL_ARG_LOCATION
:
2211 if (!DECL_IGNORED_P (current_function_decl
))
2212 debug_hooks
->var_location (insn
);
2225 /* The target port might emit labels in the output function for
2226 some insn, e.g. sh.c output_branchy_insn. */
2227 if (CODE_LABEL_NUMBER (insn
) <= max_labelno
)
2229 int align
= LABEL_TO_ALIGNMENT (insn
);
2230 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2231 int max_skip
= LABEL_TO_MAX_SKIP (insn
);
2234 if (align
&& NEXT_INSN (insn
))
2236 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2237 ASM_OUTPUT_MAX_SKIP_ALIGN (file
, align
, max_skip
);
2239 #ifdef ASM_OUTPUT_ALIGN_WITH_NOP
2240 ASM_OUTPUT_ALIGN_WITH_NOP (file
, align
);
2242 ASM_OUTPUT_ALIGN (file
, align
);
2249 if (!DECL_IGNORED_P (current_function_decl
) && LABEL_NAME (insn
))
2250 debug_hooks
->label (insn
);
2254 next
= next_nonnote_insn (insn
);
2255 /* If this label is followed by a jump-table, make sure we put
2256 the label in the read-only section. Also possibly write the
2257 label and jump table together. */
2258 if (next
!= 0 && JUMP_TABLE_DATA_P (next
))
2260 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2261 /* In this case, the case vector is being moved by the
2262 target, so don't output the label at all. Leave that
2263 to the back end macros. */
2265 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2269 switch_to_section (targetm
.asm_out
.function_rodata_section
2270 (current_function_decl
));
2272 #ifdef ADDR_VEC_ALIGN
2273 log_align
= ADDR_VEC_ALIGN (next
);
2275 log_align
= exact_log2 (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
);
2277 ASM_OUTPUT_ALIGN (file
, log_align
);
2280 switch_to_section (current_function_section ());
2282 #ifdef ASM_OUTPUT_CASE_LABEL
2283 ASM_OUTPUT_CASE_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
),
2286 targetm
.asm_out
.internal_label (file
, "L", CODE_LABEL_NUMBER (insn
));
2291 if (LABEL_ALT_ENTRY_P (insn
))
2292 output_alternate_entry_point (file
, insn
);
2294 targetm
.asm_out
.internal_label (file
, "L", CODE_LABEL_NUMBER (insn
));
2299 rtx body
= PATTERN (insn
);
2300 int insn_code_number
;
2304 /* Reset this early so it is correct for ASM statements. */
2305 current_insn_predicate
= NULL_RTX
;
2307 /* An INSN, JUMP_INSN or CALL_INSN.
2308 First check for special kinds that recog doesn't recognize. */
2310 if (GET_CODE (body
) == USE
/* These are just declarations. */
2311 || GET_CODE (body
) == CLOBBER
)
2316 /* If there is a REG_CC_SETTER note on this insn, it means that
2317 the setting of the condition code was done in the delay slot
2318 of the insn that branched here. So recover the cc status
2319 from the insn that set it. */
2321 rtx note
= find_reg_note (insn
, REG_CC_SETTER
, NULL_RTX
);
2324 NOTICE_UPDATE_CC (PATTERN (XEXP (note
, 0)), XEXP (note
, 0));
2325 cc_prev_status
= cc_status
;
2330 /* Detect insns that are really jump-tables
2331 and output them as such. */
2333 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
2335 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2339 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2340 switch_to_section (targetm
.asm_out
.function_rodata_section
2341 (current_function_decl
));
2343 switch_to_section (current_function_section ());
2347 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2348 if (GET_CODE (body
) == ADDR_VEC
)
2350 #ifdef ASM_OUTPUT_ADDR_VEC
2351 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn
), body
);
2358 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2359 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn
), body
);
2365 vlen
= XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
);
2366 for (idx
= 0; idx
< vlen
; idx
++)
2368 if (GET_CODE (body
) == ADDR_VEC
)
2370 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2371 ASM_OUTPUT_ADDR_VEC_ELT
2372 (file
, CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 0, idx
), 0)));
2379 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2380 ASM_OUTPUT_ADDR_DIFF_ELT
2383 CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 1, idx
), 0)),
2384 CODE_LABEL_NUMBER (XEXP (XEXP (body
, 0), 0)));
2390 #ifdef ASM_OUTPUT_CASE_END
2391 ASM_OUTPUT_CASE_END (file
,
2392 CODE_LABEL_NUMBER (PREV_INSN (insn
)),
2397 switch_to_section (current_function_section ());
2401 /* Output this line note if it is the first or the last line
2403 if (!DECL_IGNORED_P (current_function_decl
)
2404 && notice_source_line (insn
, &is_stmt
))
2405 (*debug_hooks
->source_line
) (last_linenum
, last_filename
,
2406 last_discriminator
, is_stmt
);
2408 if (GET_CODE (body
) == ASM_INPUT
)
2410 const char *string
= XSTR (body
, 0);
2412 /* There's no telling what that did to the condition codes. */
2417 expanded_location loc
;
2420 loc
= expand_location (ASM_INPUT_SOURCE_LOCATION (body
));
2421 if (*loc
.file
&& loc
.line
)
2422 fprintf (asm_out_file
, "%s %i \"%s\" 1\n",
2423 ASM_COMMENT_START
, loc
.line
, loc
.file
);
2424 fprintf (asm_out_file
, "\t%s\n", string
);
2425 #if HAVE_AS_LINE_ZERO
2426 if (*loc
.file
&& loc
.line
)
2427 fprintf (asm_out_file
, "%s 0 \"\" 2\n", ASM_COMMENT_START
);
2433 /* Detect `asm' construct with operands. */
2434 if (asm_noperands (body
) >= 0)
2436 unsigned int noperands
= asm_noperands (body
);
2437 rtx
*ops
= XALLOCAVEC (rtx
, noperands
);
2440 expanded_location expanded
;
2442 /* There's no telling what that did to the condition codes. */
2445 /* Get out the operand values. */
2446 string
= decode_asm_operands (body
, ops
, NULL
, NULL
, NULL
, &loc
);
2447 /* Inhibit dying on what would otherwise be compiler bugs. */
2448 insn_noperands
= noperands
;
2449 this_is_asm_operands
= insn
;
2450 expanded
= expand_location (loc
);
2452 #ifdef FINAL_PRESCAN_INSN
2453 FINAL_PRESCAN_INSN (insn
, ops
, insn_noperands
);
2456 /* Output the insn using them. */
2460 if (expanded
.file
&& expanded
.line
)
2461 fprintf (asm_out_file
, "%s %i \"%s\" 1\n",
2462 ASM_COMMENT_START
, expanded
.line
, expanded
.file
);
2463 output_asm_insn (string
, ops
);
2464 #if HAVE_AS_LINE_ZERO
2465 if (expanded
.file
&& expanded
.line
)
2466 fprintf (asm_out_file
, "%s 0 \"\" 2\n", ASM_COMMENT_START
);
2470 if (targetm
.asm_out
.final_postscan_insn
)
2471 targetm
.asm_out
.final_postscan_insn (file
, insn
, ops
,
2474 this_is_asm_operands
= 0;
2480 if (GET_CODE (body
) == SEQUENCE
)
2482 /* A delayed-branch sequence */
2485 final_sequence
= body
;
2487 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2488 force the restoration of a comparison that was previously
2489 thought unnecessary. If that happens, cancel this sequence
2490 and cause that insn to be restored. */
2492 next
= final_scan_insn (XVECEXP (body
, 0, 0), file
, 0, 1, seen
);
2493 if (next
!= XVECEXP (body
, 0, 1))
2499 for (i
= 1; i
< XVECLEN (body
, 0); i
++)
2501 rtx insn
= XVECEXP (body
, 0, i
);
2502 rtx next
= NEXT_INSN (insn
);
2503 /* We loop in case any instruction in a delay slot gets
2506 insn
= final_scan_insn (insn
, file
, 0, 1, seen
);
2507 while (insn
!= next
);
2509 #ifdef DBR_OUTPUT_SEQEND
2510 DBR_OUTPUT_SEQEND (file
);
2514 /* If the insn requiring the delay slot was a CALL_INSN, the
2515 insns in the delay slot are actually executed before the
2516 called function. Hence we don't preserve any CC-setting
2517 actions in these insns and the CC must be marked as being
2518 clobbered by the function. */
2519 if (CALL_P (XVECEXP (body
, 0, 0)))
2526 /* We have a real machine instruction as rtl. */
2528 body
= PATTERN (insn
);
2531 set
= single_set (insn
);
2533 /* Check for redundant test and compare instructions
2534 (when the condition codes are already set up as desired).
2535 This is done only when optimizing; if not optimizing,
2536 it should be possible for the user to alter a variable
2537 with the debugger in between statements
2538 and the next statement should reexamine the variable
2539 to compute the condition codes. */
2544 && GET_CODE (SET_DEST (set
)) == CC0
2545 && insn
!= last_ignored_compare
)
2548 if (GET_CODE (SET_SRC (set
)) == SUBREG
)
2549 SET_SRC (set
) = alter_subreg (&SET_SRC (set
), true);
2551 src1
= SET_SRC (set
);
2553 if (GET_CODE (SET_SRC (set
)) == COMPARE
)
2555 if (GET_CODE (XEXP (SET_SRC (set
), 0)) == SUBREG
)
2556 XEXP (SET_SRC (set
), 0)
2557 = alter_subreg (&XEXP (SET_SRC (set
), 0), true);
2558 if (GET_CODE (XEXP (SET_SRC (set
), 1)) == SUBREG
)
2559 XEXP (SET_SRC (set
), 1)
2560 = alter_subreg (&XEXP (SET_SRC (set
), 1), true);
2561 if (XEXP (SET_SRC (set
), 1)
2562 == CONST0_RTX (GET_MODE (XEXP (SET_SRC (set
), 0))))
2563 src2
= XEXP (SET_SRC (set
), 0);
2565 if ((cc_status
.value1
!= 0
2566 && rtx_equal_p (src1
, cc_status
.value1
))
2567 || (cc_status
.value2
!= 0
2568 && rtx_equal_p (src1
, cc_status
.value2
))
2569 || (src2
!= 0 && cc_status
.value1
!= 0
2570 && rtx_equal_p (src2
, cc_status
.value1
))
2571 || (src2
!= 0 && cc_status
.value2
!= 0
2572 && rtx_equal_p (src2
, cc_status
.value2
)))
2574 /* Don't delete insn if it has an addressing side-effect. */
2575 if (! FIND_REG_INC_NOTE (insn
, NULL_RTX
)
2576 /* or if anything in it is volatile. */
2577 && ! volatile_refs_p (PATTERN (insn
)))
2579 /* We don't really delete the insn; just ignore it. */
2580 last_ignored_compare
= insn
;
2587 /* If this is a conditional branch, maybe modify it
2588 if the cc's are in a nonstandard state
2589 so that it accomplishes the same thing that it would
2590 do straightforwardly if the cc's were set up normally. */
2592 if (cc_status
.flags
!= 0
2594 && GET_CODE (body
) == SET
2595 && SET_DEST (body
) == pc_rtx
2596 && GET_CODE (SET_SRC (body
)) == IF_THEN_ELSE
2597 && COMPARISON_P (XEXP (SET_SRC (body
), 0))
2598 && XEXP (XEXP (SET_SRC (body
), 0), 0) == cc0_rtx
)
2600 /* This function may alter the contents of its argument
2601 and clear some of the cc_status.flags bits.
2602 It may also return 1 meaning condition now always true
2603 or -1 meaning condition now always false
2604 or 2 meaning condition nontrivial but altered. */
2605 int result
= alter_cond (XEXP (SET_SRC (body
), 0));
2606 /* If condition now has fixed value, replace the IF_THEN_ELSE
2607 with its then-operand or its else-operand. */
2609 SET_SRC (body
) = XEXP (SET_SRC (body
), 1);
2611 SET_SRC (body
) = XEXP (SET_SRC (body
), 2);
2613 /* The jump is now either unconditional or a no-op.
2614 If it has become a no-op, don't try to output it.
2615 (It would not be recognized.) */
2616 if (SET_SRC (body
) == pc_rtx
)
2621 else if (ANY_RETURN_P (SET_SRC (body
)))
2622 /* Replace (set (pc) (return)) with (return). */
2623 PATTERN (insn
) = body
= SET_SRC (body
);
2625 /* Rerecognize the instruction if it has changed. */
2627 INSN_CODE (insn
) = -1;
2630 /* If this is a conditional trap, maybe modify it if the cc's
2631 are in a nonstandard state so that it accomplishes the same
2632 thing that it would do straightforwardly if the cc's were
2634 if (cc_status
.flags
!= 0
2635 && NONJUMP_INSN_P (insn
)
2636 && GET_CODE (body
) == TRAP_IF
2637 && COMPARISON_P (TRAP_CONDITION (body
))
2638 && XEXP (TRAP_CONDITION (body
), 0) == cc0_rtx
)
2640 /* This function may alter the contents of its argument
2641 and clear some of the cc_status.flags bits.
2642 It may also return 1 meaning condition now always true
2643 or -1 meaning condition now always false
2644 or 2 meaning condition nontrivial but altered. */
2645 int result
= alter_cond (TRAP_CONDITION (body
));
2647 /* If TRAP_CONDITION has become always false, delete the
2655 /* If TRAP_CONDITION has become always true, replace
2656 TRAP_CONDITION with const_true_rtx. */
2658 TRAP_CONDITION (body
) = const_true_rtx
;
2660 /* Rerecognize the instruction if it has changed. */
2662 INSN_CODE (insn
) = -1;
2665 /* Make same adjustments to instructions that examine the
2666 condition codes without jumping and instructions that
2667 handle conditional moves (if this machine has either one). */
2669 if (cc_status
.flags
!= 0
2672 rtx cond_rtx
, then_rtx
, else_rtx
;
2675 && GET_CODE (SET_SRC (set
)) == IF_THEN_ELSE
)
2677 cond_rtx
= XEXP (SET_SRC (set
), 0);
2678 then_rtx
= XEXP (SET_SRC (set
), 1);
2679 else_rtx
= XEXP (SET_SRC (set
), 2);
2683 cond_rtx
= SET_SRC (set
);
2684 then_rtx
= const_true_rtx
;
2685 else_rtx
= const0_rtx
;
2688 if (COMPARISON_P (cond_rtx
)
2689 && XEXP (cond_rtx
, 0) == cc0_rtx
)
2692 result
= alter_cond (cond_rtx
);
2694 validate_change (insn
, &SET_SRC (set
), then_rtx
, 0);
2695 else if (result
== -1)
2696 validate_change (insn
, &SET_SRC (set
), else_rtx
, 0);
2697 else if (result
== 2)
2698 INSN_CODE (insn
) = -1;
2699 if (SET_DEST (set
) == SET_SRC (set
))
2706 #ifdef HAVE_peephole
2707 /* Do machine-specific peephole optimizations if desired. */
2709 if (optimize_p
&& !flag_no_peephole
&& !nopeepholes
)
2711 rtx next
= peephole (insn
);
2712 /* When peepholing, if there were notes within the peephole,
2713 emit them before the peephole. */
2714 if (next
!= 0 && next
!= NEXT_INSN (insn
))
2716 rtx note
, prev
= PREV_INSN (insn
);
2718 for (note
= NEXT_INSN (insn
); note
!= next
;
2719 note
= NEXT_INSN (note
))
2720 final_scan_insn (note
, file
, optimize_p
, nopeepholes
, seen
);
2722 /* Put the notes in the proper position for a later
2723 rescan. For example, the SH target can do this
2724 when generating a far jump in a delayed branch
2726 note
= NEXT_INSN (insn
);
2727 PREV_INSN (note
) = prev
;
2728 NEXT_INSN (prev
) = note
;
2729 NEXT_INSN (PREV_INSN (next
)) = insn
;
2730 PREV_INSN (insn
) = PREV_INSN (next
);
2731 NEXT_INSN (insn
) = next
;
2732 PREV_INSN (next
) = insn
;
2735 /* PEEPHOLE might have changed this. */
2736 body
= PATTERN (insn
);
2740 /* Try to recognize the instruction.
2741 If successful, verify that the operands satisfy the
2742 constraints for the instruction. Crash if they don't,
2743 since `reload' should have changed them so that they do. */
2745 insn_code_number
= recog_memoized (insn
);
2746 cleanup_subreg_operands (insn
);
2748 /* Dump the insn in the assembly for debugging (-dAP).
2749 If the final dump is requested as slim RTL, dump slim
2750 RTL to the assembly file also. */
2751 if (flag_dump_rtl_in_asm
)
2753 print_rtx_head
= ASM_COMMENT_START
;
2754 if (! (dump_flags
& TDF_SLIM
))
2755 print_rtl_single (asm_out_file
, insn
);
2757 dump_insn_slim (asm_out_file
, insn
);
2758 print_rtx_head
= "";
2761 if (! constrain_operands_cached (1))
2762 fatal_insn_not_found (insn
);
2764 /* Some target machines need to prescan each insn before
2767 #ifdef FINAL_PRESCAN_INSN
2768 FINAL_PRESCAN_INSN (insn
, recog_data
.operand
, recog_data
.n_operands
);
2771 if (targetm
.have_conditional_execution ()
2772 && GET_CODE (PATTERN (insn
)) == COND_EXEC
)
2773 current_insn_predicate
= COND_EXEC_TEST (PATTERN (insn
));
2776 cc_prev_status
= cc_status
;
2778 /* Update `cc_status' for this instruction.
2779 The instruction's output routine may change it further.
2780 If the output routine for a jump insn needs to depend
2781 on the cc status, it should look at cc_prev_status. */
2783 NOTICE_UPDATE_CC (body
, insn
);
2786 current_output_insn
= debug_insn
= insn
;
2788 /* Find the proper template for this insn. */
2789 templ
= get_insn_template (insn_code_number
, insn
);
2791 /* If the C code returns 0, it means that it is a jump insn
2792 which follows a deleted test insn, and that test insn
2793 needs to be reinserted. */
2798 gcc_assert (prev_nonnote_insn (insn
) == last_ignored_compare
);
2800 /* We have already processed the notes between the setter and
2801 the user. Make sure we don't process them again, this is
2802 particularly important if one of the notes is a block
2803 scope note or an EH note. */
2805 prev
!= last_ignored_compare
;
2806 prev
= PREV_INSN (prev
))
2809 delete_insn (prev
); /* Use delete_note. */
2815 /* If the template is the string "#", it means that this insn must
2817 if (templ
[0] == '#' && templ
[1] == '\0')
2819 rtx new_rtx
= try_split (body
, insn
, 0);
2821 /* If we didn't split the insn, go away. */
2822 if (new_rtx
== insn
&& PATTERN (new_rtx
) == body
)
2823 fatal_insn ("could not split insn", insn
);
2825 /* If we have a length attribute, this instruction should have
2826 been split in shorten_branches, to ensure that we would have
2827 valid length info for the splitees. */
2828 gcc_assert (!HAVE_ATTR_length
);
2833 /* ??? This will put the directives in the wrong place if
2834 get_insn_template outputs assembly directly. However calling it
2835 before get_insn_template breaks if the insns is split. */
2836 if (targetm
.asm_out
.unwind_emit_before_insn
2837 && targetm
.asm_out
.unwind_emit
)
2838 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
2842 rtx x
= call_from_call_insn (insn
);
2844 if (x
&& MEM_P (x
) && GET_CODE (XEXP (x
, 0)) == SYMBOL_REF
)
2848 t
= SYMBOL_REF_DECL (x
);
2850 assemble_external (t
);
2852 if (!DECL_IGNORED_P (current_function_decl
))
2853 debug_hooks
->var_location (insn
);
2856 /* Output assembler code from the template. */
2857 output_asm_insn (templ
, recog_data
.operand
);
2859 /* Some target machines need to postscan each insn after
2861 if (targetm
.asm_out
.final_postscan_insn
)
2862 targetm
.asm_out
.final_postscan_insn (file
, insn
, recog_data
.operand
,
2863 recog_data
.n_operands
);
2865 if (!targetm
.asm_out
.unwind_emit_before_insn
2866 && targetm
.asm_out
.unwind_emit
)
2867 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
2869 current_output_insn
= debug_insn
= 0;
2872 return NEXT_INSN (insn
);
2875 /* Return whether a source line note needs to be emitted before INSN.
2876 Sets IS_STMT to TRUE if the line should be marked as a possible
2877 breakpoint location. */
2880 notice_source_line (rtx insn
, bool *is_stmt
)
2882 const char *filename
;
2885 if (override_filename
)
2887 filename
= override_filename
;
2888 linenum
= override_linenum
;
2892 filename
= insn_file (insn
);
2893 linenum
= insn_line (insn
);
2896 if (filename
== NULL
)
2899 if (force_source_line
2900 || filename
!= last_filename
2901 || last_linenum
!= linenum
)
2903 force_source_line
= false;
2904 last_filename
= filename
;
2905 last_linenum
= linenum
;
2906 last_discriminator
= discriminator
;
2908 high_block_linenum
= MAX (last_linenum
, high_block_linenum
);
2909 high_function_linenum
= MAX (last_linenum
, high_function_linenum
);
2913 if (SUPPORTS_DISCRIMINATOR
&& last_discriminator
!= discriminator
)
2915 /* If the discriminator changed, but the line number did not,
2916 output the line table entry with is_stmt false so the
2917 debugger does not treat this as a breakpoint location. */
2918 last_discriminator
= discriminator
;
2926 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
2927 directly to the desired hard register. */
2930 cleanup_subreg_operands (rtx insn
)
2933 bool changed
= false;
2934 extract_insn_cached (insn
);
2935 for (i
= 0; i
< recog_data
.n_operands
; i
++)
2937 /* The following test cannot use recog_data.operand when testing
2938 for a SUBREG: the underlying object might have been changed
2939 already if we are inside a match_operator expression that
2940 matches the else clause. Instead we test the underlying
2941 expression directly. */
2942 if (GET_CODE (*recog_data
.operand_loc
[i
]) == SUBREG
)
2944 recog_data
.operand
[i
] = alter_subreg (recog_data
.operand_loc
[i
], true);
2947 else if (GET_CODE (recog_data
.operand
[i
]) == PLUS
2948 || GET_CODE (recog_data
.operand
[i
]) == MULT
2949 || MEM_P (recog_data
.operand
[i
]))
2950 recog_data
.operand
[i
] = walk_alter_subreg (recog_data
.operand_loc
[i
], &changed
);
2953 for (i
= 0; i
< recog_data
.n_dups
; i
++)
2955 if (GET_CODE (*recog_data
.dup_loc
[i
]) == SUBREG
)
2957 *recog_data
.dup_loc
[i
] = alter_subreg (recog_data
.dup_loc
[i
], true);
2960 else if (GET_CODE (*recog_data
.dup_loc
[i
]) == PLUS
2961 || GET_CODE (*recog_data
.dup_loc
[i
]) == MULT
2962 || MEM_P (*recog_data
.dup_loc
[i
]))
2963 *recog_data
.dup_loc
[i
] = walk_alter_subreg (recog_data
.dup_loc
[i
], &changed
);
2966 df_insn_rescan (insn
);
2969 /* If X is a SUBREG, try to replace it with a REG or a MEM, based on
2970 the thing it is a subreg of. Do it anyway if FINAL_P. */
2973 alter_subreg (rtx
*xp
, bool final_p
)
2976 rtx y
= SUBREG_REG (x
);
2978 /* simplify_subreg does not remove subreg from volatile references.
2979 We are required to. */
2982 int offset
= SUBREG_BYTE (x
);
2984 /* For paradoxical subregs on big-endian machines, SUBREG_BYTE
2985 contains 0 instead of the proper offset. See simplify_subreg. */
2987 && GET_MODE_SIZE (GET_MODE (y
)) < GET_MODE_SIZE (GET_MODE (x
)))
2989 int difference
= GET_MODE_SIZE (GET_MODE (y
))
2990 - GET_MODE_SIZE (GET_MODE (x
));
2991 if (WORDS_BIG_ENDIAN
)
2992 offset
+= (difference
/ UNITS_PER_WORD
) * UNITS_PER_WORD
;
2993 if (BYTES_BIG_ENDIAN
)
2994 offset
+= difference
% UNITS_PER_WORD
;
2998 *xp
= adjust_address (y
, GET_MODE (x
), offset
);
3000 *xp
= adjust_address_nv (y
, GET_MODE (x
), offset
);
3004 rtx new_rtx
= simplify_subreg (GET_MODE (x
), y
, GET_MODE (y
),
3009 else if (final_p
&& REG_P (y
))
3011 /* Simplify_subreg can't handle some REG cases, but we have to. */
3013 HOST_WIDE_INT offset
;
3015 regno
= subreg_regno (x
);
3016 if (subreg_lowpart_p (x
))
3017 offset
= byte_lowpart_offset (GET_MODE (x
), GET_MODE (y
));
3019 offset
= SUBREG_BYTE (x
);
3020 *xp
= gen_rtx_REG_offset (y
, GET_MODE (x
), regno
, offset
);
3027 /* Do alter_subreg on all the SUBREGs contained in X. */
3030 walk_alter_subreg (rtx
*xp
, bool *changed
)
3033 switch (GET_CODE (x
))
3038 XEXP (x
, 0) = walk_alter_subreg (&XEXP (x
, 0), changed
);
3039 XEXP (x
, 1) = walk_alter_subreg (&XEXP (x
, 1), changed
);
3044 XEXP (x
, 0) = walk_alter_subreg (&XEXP (x
, 0), changed
);
3049 return alter_subreg (xp
, true);
3060 /* Given BODY, the body of a jump instruction, alter the jump condition
3061 as required by the bits that are set in cc_status.flags.
3062 Not all of the bits there can be handled at this level in all cases.
3064 The value is normally 0.
3065 1 means that the condition has become always true.
3066 -1 means that the condition has become always false.
3067 2 means that COND has been altered. */
3070 alter_cond (rtx cond
)
3074 if (cc_status
.flags
& CC_REVERSED
)
3077 PUT_CODE (cond
, swap_condition (GET_CODE (cond
)));
3080 if (cc_status
.flags
& CC_INVERTED
)
3083 PUT_CODE (cond
, reverse_condition (GET_CODE (cond
)));
3086 if (cc_status
.flags
& CC_NOT_POSITIVE
)
3087 switch (GET_CODE (cond
))
3092 /* Jump becomes unconditional. */
3098 /* Jump becomes no-op. */
3102 PUT_CODE (cond
, EQ
);
3107 PUT_CODE (cond
, NE
);
3115 if (cc_status
.flags
& CC_NOT_NEGATIVE
)
3116 switch (GET_CODE (cond
))
3120 /* Jump becomes unconditional. */
3125 /* Jump becomes no-op. */
3130 PUT_CODE (cond
, EQ
);
3136 PUT_CODE (cond
, NE
);
3144 if (cc_status
.flags
& CC_NO_OVERFLOW
)
3145 switch (GET_CODE (cond
))
3148 /* Jump becomes unconditional. */
3152 PUT_CODE (cond
, EQ
);
3157 PUT_CODE (cond
, NE
);
3162 /* Jump becomes no-op. */
3169 if (cc_status
.flags
& (CC_Z_IN_NOT_N
| CC_Z_IN_N
))
3170 switch (GET_CODE (cond
))
3176 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? GE
: LT
);
3181 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? LT
: GE
);
3186 if (cc_status
.flags
& CC_NOT_SIGNED
)
3187 /* The flags are valid if signed condition operators are converted
3189 switch (GET_CODE (cond
))
3192 PUT_CODE (cond
, LEU
);
3197 PUT_CODE (cond
, LTU
);
3202 PUT_CODE (cond
, GTU
);
3207 PUT_CODE (cond
, GEU
);
3219 /* Report inconsistency between the assembler template and the operands.
3220 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3223 output_operand_lossage (const char *cmsgid
, ...)
3227 const char *pfx_str
;
3230 va_start (ap
, cmsgid
);
3232 pfx_str
= this_is_asm_operands
? _("invalid 'asm': ") : "output_operand: ";
3233 asprintf (&fmt_string
, "%s%s", pfx_str
, _(cmsgid
));
3234 vasprintf (&new_message
, fmt_string
, ap
);
3236 if (this_is_asm_operands
)
3237 error_for_asm (this_is_asm_operands
, "%s", new_message
);
3239 internal_error ("%s", new_message
);
3246 /* Output of assembler code from a template, and its subroutines. */
3248 /* Annotate the assembly with a comment describing the pattern and
3249 alternative used. */
3252 output_asm_name (void)
3256 int num
= INSN_CODE (debug_insn
);
3257 fprintf (asm_out_file
, "\t%s %d\t%s",
3258 ASM_COMMENT_START
, INSN_UID (debug_insn
),
3259 insn_data
[num
].name
);
3260 if (insn_data
[num
].n_alternatives
> 1)
3261 fprintf (asm_out_file
, "/%d", which_alternative
+ 1);
3263 if (HAVE_ATTR_length
)
3264 fprintf (asm_out_file
, "\t[length = %d]",
3265 get_attr_length (debug_insn
));
3267 /* Clear this so only the first assembler insn
3268 of any rtl insn will get the special comment for -dp. */
3273 /* If OP is a REG or MEM and we can find a MEM_EXPR corresponding to it
3274 or its address, return that expr . Set *PADDRESSP to 1 if the expr
3275 corresponds to the address of the object and 0 if to the object. */
3278 get_mem_expr_from_op (rtx op
, int *paddressp
)
3286 return REG_EXPR (op
);
3287 else if (!MEM_P (op
))
3290 if (MEM_EXPR (op
) != 0)
3291 return MEM_EXPR (op
);
3293 /* Otherwise we have an address, so indicate it and look at the address. */
3297 /* First check if we have a decl for the address, then look at the right side
3298 if it is a PLUS. Otherwise, strip off arithmetic and keep looking.
3299 But don't allow the address to itself be indirect. */
3300 if ((expr
= get_mem_expr_from_op (op
, &inner_addressp
)) && ! inner_addressp
)
3302 else if (GET_CODE (op
) == PLUS
3303 && (expr
= get_mem_expr_from_op (XEXP (op
, 1), &inner_addressp
)))
3307 || GET_RTX_CLASS (GET_CODE (op
)) == RTX_BIN_ARITH
)
3310 expr
= get_mem_expr_from_op (op
, &inner_addressp
);
3311 return inner_addressp
? 0 : expr
;
3314 /* Output operand names for assembler instructions. OPERANDS is the
3315 operand vector, OPORDER is the order to write the operands, and NOPS
3316 is the number of operands to write. */
3319 output_asm_operand_names (rtx
*operands
, int *oporder
, int nops
)
3324 for (i
= 0; i
< nops
; i
++)
3327 rtx op
= operands
[oporder
[i
]];
3328 tree expr
= get_mem_expr_from_op (op
, &addressp
);
3330 fprintf (asm_out_file
, "%c%s",
3331 wrote
? ',' : '\t', wrote
? "" : ASM_COMMENT_START
);
3335 fprintf (asm_out_file
, "%s",
3336 addressp
? "*" : "");
3337 print_mem_expr (asm_out_file
, expr
);
3340 else if (REG_P (op
) && ORIGINAL_REGNO (op
)
3341 && ORIGINAL_REGNO (op
) != REGNO (op
))
3342 fprintf (asm_out_file
, " tmp%i", ORIGINAL_REGNO (op
));
3346 #ifdef ASSEMBLER_DIALECT
3347 /* Helper function to parse assembler dialects in the asm string.
3348 This is called from output_asm_insn and asm_fprintf. */
3350 do_assembler_dialects (const char *p
, int *dialect
)
3361 output_operand_lossage ("nested assembly dialect alternatives");
3365 /* If we want the first dialect, do nothing. Otherwise, skip
3366 DIALECT_NUMBER of strings ending with '|'. */
3367 for (i
= 0; i
< dialect_number
; i
++)
3369 while (*p
&& *p
!= '}' && *p
++ != '|')
3376 output_operand_lossage ("unterminated assembly dialect alternative");
3383 /* Skip to close brace. */
3388 output_operand_lossage ("unterminated assembly dialect alternative");
3392 while (*p
++ != '}');
3396 putc (c
, asm_out_file
);
3401 putc (c
, asm_out_file
);
3412 /* Output text from TEMPLATE to the assembler output file,
3413 obeying %-directions to substitute operands taken from
3414 the vector OPERANDS.
3416 %N (for N a digit) means print operand N in usual manner.
3417 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3418 and print the label name with no punctuation.
3419 %cN means require operand N to be a constant
3420 and print the constant expression with no punctuation.
3421 %aN means expect operand N to be a memory address
3422 (not a memory reference!) and print a reference
3424 %nN means expect operand N to be a constant
3425 and print a constant expression for minus the value
3426 of the operand, with no other punctuation. */
3429 output_asm_insn (const char *templ
, rtx
*operands
)
3433 #ifdef ASSEMBLER_DIALECT
3436 int oporder
[MAX_RECOG_OPERANDS
];
3437 char opoutput
[MAX_RECOG_OPERANDS
];
3440 /* An insn may return a null string template
3441 in a case where no assembler code is needed. */
3445 memset (opoutput
, 0, sizeof opoutput
);
3447 putc ('\t', asm_out_file
);
3449 #ifdef ASM_OUTPUT_OPCODE
3450 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3457 if (flag_verbose_asm
)
3458 output_asm_operand_names (operands
, oporder
, ops
);
3459 if (flag_print_asm_name
)
3463 memset (opoutput
, 0, sizeof opoutput
);
3465 putc (c
, asm_out_file
);
3466 #ifdef ASM_OUTPUT_OPCODE
3467 while ((c
= *p
) == '\t')
3469 putc (c
, asm_out_file
);
3472 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3476 #ifdef ASSEMBLER_DIALECT
3480 p
= do_assembler_dialects (p
, &dialect
);
3485 /* %% outputs a single %. */
3489 putc (c
, asm_out_file
);
3491 /* %= outputs a number which is unique to each insn in the entire
3492 compilation. This is useful for making local labels that are
3493 referred to more than once in a given insn. */
3497 fprintf (asm_out_file
, "%d", insn_counter
);
3499 /* % followed by a letter and some digits
3500 outputs an operand in a special way depending on the letter.
3501 Letters `acln' are implemented directly.
3502 Other letters are passed to `output_operand' so that
3503 the TARGET_PRINT_OPERAND hook can define them. */
3504 else if (ISALPHA (*p
))
3507 unsigned long opnum
;
3510 opnum
= strtoul (p
, &endptr
, 10);
3513 output_operand_lossage ("operand number missing "
3515 else if (this_is_asm_operands
&& opnum
>= insn_noperands
)
3516 output_operand_lossage ("operand number out of range");
3517 else if (letter
== 'l')
3518 output_asm_label (operands
[opnum
]);
3519 else if (letter
== 'a')
3520 output_address (operands
[opnum
]);
3521 else if (letter
== 'c')
3523 if (CONSTANT_ADDRESS_P (operands
[opnum
]))
3524 output_addr_const (asm_out_file
, operands
[opnum
]);
3526 output_operand (operands
[opnum
], 'c');
3528 else if (letter
== 'n')
3530 if (CONST_INT_P (operands
[opnum
]))
3531 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
,
3532 - INTVAL (operands
[opnum
]));
3535 putc ('-', asm_out_file
);
3536 output_addr_const (asm_out_file
, operands
[opnum
]);
3540 output_operand (operands
[opnum
], letter
);
3542 if (!opoutput
[opnum
])
3543 oporder
[ops
++] = opnum
;
3544 opoutput
[opnum
] = 1;
3549 /* % followed by a digit outputs an operand the default way. */
3550 else if (ISDIGIT (*p
))
3552 unsigned long opnum
;
3555 opnum
= strtoul (p
, &endptr
, 10);
3556 if (this_is_asm_operands
&& opnum
>= insn_noperands
)
3557 output_operand_lossage ("operand number out of range");
3559 output_operand (operands
[opnum
], 0);
3561 if (!opoutput
[opnum
])
3562 oporder
[ops
++] = opnum
;
3563 opoutput
[opnum
] = 1;
3568 /* % followed by punctuation: output something for that
3569 punctuation character alone, with no operand. The
3570 TARGET_PRINT_OPERAND hook decides what is actually done. */
3571 else if (targetm
.asm_out
.print_operand_punct_valid_p ((unsigned char) *p
))
3572 output_operand (NULL_RTX
, *p
++);
3574 output_operand_lossage ("invalid %%-code");
3578 putc (c
, asm_out_file
);
3581 /* Write out the variable names for operands, if we know them. */
3582 if (flag_verbose_asm
)
3583 output_asm_operand_names (operands
, oporder
, ops
);
3584 if (flag_print_asm_name
)
3587 putc ('\n', asm_out_file
);
3590 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3593 output_asm_label (rtx x
)
3597 if (GET_CODE (x
) == LABEL_REF
)
3601 && NOTE_KIND (x
) == NOTE_INSN_DELETED_LABEL
))
3602 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3604 output_operand_lossage ("'%%l' operand isn't a label");
3606 assemble_name (asm_out_file
, buf
);
3609 /* Helper rtx-iteration-function for mark_symbol_refs_as_used and
3610 output_operand. Marks SYMBOL_REFs as referenced through use of
3611 assemble_external. */
3614 mark_symbol_ref_as_used (rtx
*xp
, void *dummy ATTRIBUTE_UNUSED
)
3618 /* If we have a used symbol, we may have to emit assembly
3619 annotations corresponding to whether the symbol is external, weak
3620 or has non-default visibility. */
3621 if (GET_CODE (x
) == SYMBOL_REF
)
3625 t
= SYMBOL_REF_DECL (x
);
3627 assemble_external (t
);
3635 /* Marks SYMBOL_REFs in x as referenced through use of assemble_external. */
3638 mark_symbol_refs_as_used (rtx x
)
3640 for_each_rtx (&x
, mark_symbol_ref_as_used
, NULL
);
3643 /* Print operand X using machine-dependent assembler syntax.
3644 CODE is a non-digit that preceded the operand-number in the % spec,
3645 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3646 between the % and the digits.
3647 When CODE is a non-letter, X is 0.
3649 The meanings of the letters are machine-dependent and controlled
3650 by TARGET_PRINT_OPERAND. */
3653 output_operand (rtx x
, int code ATTRIBUTE_UNUSED
)
3655 if (x
&& GET_CODE (x
) == SUBREG
)
3656 x
= alter_subreg (&x
, true);
3658 /* X must not be a pseudo reg. */
3659 gcc_assert (!x
|| !REG_P (x
) || REGNO (x
) < FIRST_PSEUDO_REGISTER
);
3661 targetm
.asm_out
.print_operand (asm_out_file
, x
, code
);
3666 for_each_rtx (&x
, mark_symbol_ref_as_used
, NULL
);
3669 /* Print a memory reference operand for address X using
3670 machine-dependent assembler syntax. */
3673 output_address (rtx x
)
3675 bool changed
= false;
3676 walk_alter_subreg (&x
, &changed
);
3677 targetm
.asm_out
.print_operand_address (asm_out_file
, x
);
3680 /* Print an integer constant expression in assembler syntax.
3681 Addition and subtraction are the only arithmetic
3682 that may appear in these expressions. */
3685 output_addr_const (FILE *file
, rtx x
)
3690 switch (GET_CODE (x
))
3697 if (SYMBOL_REF_DECL (x
))
3698 assemble_external (SYMBOL_REF_DECL (x
));
3699 #ifdef ASM_OUTPUT_SYMBOL_REF
3700 ASM_OUTPUT_SYMBOL_REF (file
, x
);
3702 assemble_name (file
, XSTR (x
, 0));
3710 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3711 #ifdef ASM_OUTPUT_LABEL_REF
3712 ASM_OUTPUT_LABEL_REF (file
, buf
);
3714 assemble_name (file
, buf
);
3719 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, INTVAL (x
));
3723 /* This used to output parentheses around the expression,
3724 but that does not work on the 386 (either ATT or BSD assembler). */
3725 output_addr_const (file
, XEXP (x
, 0));
3729 if (GET_MODE (x
) == VOIDmode
)
3731 /* We can use %d if the number is one word and positive. */
3732 if (CONST_DOUBLE_HIGH (x
))
3733 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
3734 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_HIGH (x
),
3735 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_LOW (x
));
3736 else if (CONST_DOUBLE_LOW (x
) < 0)
3737 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
,
3738 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_LOW (x
));
3740 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_DOUBLE_LOW (x
));
3743 /* We can't handle floating point constants;
3744 PRINT_OPERAND must handle them. */
3745 output_operand_lossage ("floating constant misused");
3749 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_FIXED_VALUE_LOW (x
));
3753 /* Some assemblers need integer constants to appear last (eg masm). */
3754 if (CONST_INT_P (XEXP (x
, 0)))
3756 output_addr_const (file
, XEXP (x
, 1));
3757 if (INTVAL (XEXP (x
, 0)) >= 0)
3758 fprintf (file
, "+");
3759 output_addr_const (file
, XEXP (x
, 0));
3763 output_addr_const (file
, XEXP (x
, 0));
3764 if (!CONST_INT_P (XEXP (x
, 1))
3765 || INTVAL (XEXP (x
, 1)) >= 0)
3766 fprintf (file
, "+");
3767 output_addr_const (file
, XEXP (x
, 1));
3772 /* Avoid outputting things like x-x or x+5-x,
3773 since some assemblers can't handle that. */
3774 x
= simplify_subtraction (x
);
3775 if (GET_CODE (x
) != MINUS
)
3778 output_addr_const (file
, XEXP (x
, 0));
3779 fprintf (file
, "-");
3780 if ((CONST_INT_P (XEXP (x
, 1)) && INTVAL (XEXP (x
, 1)) >= 0)
3781 || GET_CODE (XEXP (x
, 1)) == PC
3782 || GET_CODE (XEXP (x
, 1)) == SYMBOL_REF
)
3783 output_addr_const (file
, XEXP (x
, 1));
3786 fputs (targetm
.asm_out
.open_paren
, file
);
3787 output_addr_const (file
, XEXP (x
, 1));
3788 fputs (targetm
.asm_out
.close_paren
, file
);
3796 output_addr_const (file
, XEXP (x
, 0));
3800 if (targetm
.asm_out
.output_addr_const_extra (file
, x
))
3803 output_operand_lossage ("invalid expression as operand");
3807 /* Output a quoted string. */
3810 output_quoted_string (FILE *asm_file
, const char *string
)
3812 #ifdef OUTPUT_QUOTED_STRING
3813 OUTPUT_QUOTED_STRING (asm_file
, string
);
3817 putc ('\"', asm_file
);
3818 while ((c
= *string
++) != 0)
3822 if (c
== '\"' || c
== '\\')
3823 putc ('\\', asm_file
);
3827 fprintf (asm_file
, "\\%03o", (unsigned char) c
);
3829 putc ('\"', asm_file
);
3833 /* Write a HOST_WIDE_INT number in hex form 0x1234, fast. */
3836 fprint_whex (FILE *f
, unsigned HOST_WIDE_INT value
)
3838 char buf
[2 + CHAR_BIT
* sizeof (value
) / 4];
3843 char *p
= buf
+ sizeof (buf
);
3845 *--p
= "0123456789abcdef"[value
% 16];
3846 while ((value
/= 16) != 0);
3849 fwrite (p
, 1, buf
+ sizeof (buf
) - p
, f
);
3853 /* Internal function that prints an unsigned long in decimal in reverse.
3854 The output string IS NOT null-terminated. */
3857 sprint_ul_rev (char *s
, unsigned long value
)
3862 s
[i
] = "0123456789"[value
% 10];
3865 /* alternate version, without modulo */
3866 /* oldval = value; */
3868 /* s[i] = "0123456789" [oldval - 10*value]; */
3875 /* Write an unsigned long as decimal to a file, fast. */
3878 fprint_ul (FILE *f
, unsigned long value
)
3880 /* python says: len(str(2**64)) == 20 */
3884 i
= sprint_ul_rev (s
, value
);
3886 /* It's probably too small to bother with string reversal and fputs. */
3895 /* Write an unsigned long as decimal to a string, fast.
3896 s must be wide enough to not overflow, at least 21 chars.
3897 Returns the length of the string (without terminating '\0'). */
3900 sprint_ul (char *s
, unsigned long value
)
3907 len
= sprint_ul_rev (s
, value
);
3910 /* Reverse the string. */
3924 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3925 %R prints the value of REGISTER_PREFIX.
3926 %L prints the value of LOCAL_LABEL_PREFIX.
3927 %U prints the value of USER_LABEL_PREFIX.
3928 %I prints the value of IMMEDIATE_PREFIX.
3929 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3930 Also supported are %d, %i, %u, %x, %X, %o, %c, %s and %%.
3932 We handle alternate assembler dialects here, just like output_asm_insn. */
3935 asm_fprintf (FILE *file
, const char *p
, ...)
3939 #ifdef ASSEMBLER_DIALECT
3944 va_start (argptr
, p
);
3951 #ifdef ASSEMBLER_DIALECT
3955 p
= do_assembler_dialects (p
, &dialect
);
3962 while (strchr ("-+ #0", c
))
3967 while (ISDIGIT (c
) || c
== '.')
3978 case 'd': case 'i': case 'u':
3979 case 'x': case 'X': case 'o':
3983 fprintf (file
, buf
, va_arg (argptr
, int));
3987 /* This is a prefix to the 'd', 'i', 'u', 'x', 'X', and
3988 'o' cases, but we do not check for those cases. It
3989 means that the value is a HOST_WIDE_INT, which may be
3990 either `long' or `long long'. */
3991 memcpy (q
, HOST_WIDE_INT_PRINT
, strlen (HOST_WIDE_INT_PRINT
));
3992 q
+= strlen (HOST_WIDE_INT_PRINT
);
3995 fprintf (file
, buf
, va_arg (argptr
, HOST_WIDE_INT
));
4000 #ifdef HAVE_LONG_LONG
4006 fprintf (file
, buf
, va_arg (argptr
, long long));
4013 fprintf (file
, buf
, va_arg (argptr
, long));
4021 fprintf (file
, buf
, va_arg (argptr
, char *));
4025 #ifdef ASM_OUTPUT_OPCODE
4026 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
4031 #ifdef REGISTER_PREFIX
4032 fprintf (file
, "%s", REGISTER_PREFIX
);
4037 #ifdef IMMEDIATE_PREFIX
4038 fprintf (file
, "%s", IMMEDIATE_PREFIX
);
4043 #ifdef LOCAL_LABEL_PREFIX
4044 fprintf (file
, "%s", LOCAL_LABEL_PREFIX
);
4049 fputs (user_label_prefix
, file
);
4052 #ifdef ASM_FPRINTF_EXTENSIONS
4053 /* Uppercase letters are reserved for general use by asm_fprintf
4054 and so are not available to target specific code. In order to
4055 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
4056 they are defined here. As they get turned into real extensions
4057 to asm_fprintf they should be removed from this list. */
4058 case 'A': case 'B': case 'C': case 'D': case 'E':
4059 case 'F': case 'G': case 'H': case 'J': case 'K':
4060 case 'M': case 'N': case 'P': case 'Q': case 'S':
4061 case 'T': case 'V': case 'W': case 'Y': case 'Z':
4064 ASM_FPRINTF_EXTENSIONS (file
, argptr
, p
)
4077 /* Return nonzero if this function has no function calls. */
4080 leaf_function_p (void)
4084 if (crtl
->profile
|| profile_arc_flag
)
4087 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4090 && ! SIBLING_CALL_P (insn
))
4092 if (NONJUMP_INSN_P (insn
)
4093 && GET_CODE (PATTERN (insn
)) == SEQUENCE
4094 && CALL_P (XVECEXP (PATTERN (insn
), 0, 0))
4095 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn
), 0, 0)))
4102 /* Return 1 if branch is a forward branch.
4103 Uses insn_shuid array, so it works only in the final pass. May be used by
4104 output templates to customary add branch prediction hints.
4107 final_forward_branch_p (rtx insn
)
4109 int insn_id
, label_id
;
4111 gcc_assert (uid_shuid
);
4112 insn_id
= INSN_SHUID (insn
);
4113 label_id
= INSN_SHUID (JUMP_LABEL (insn
));
4114 /* We've hit some insns that does not have id information available. */
4115 gcc_assert (insn_id
&& label_id
);
4116 return insn_id
< label_id
;
4119 /* On some machines, a function with no call insns
4120 can run faster if it doesn't create its own register window.
4121 When output, the leaf function should use only the "output"
4122 registers. Ordinarily, the function would be compiled to use
4123 the "input" registers to find its arguments; it is a candidate
4124 for leaf treatment if it uses only the "input" registers.
4125 Leaf function treatment means renumbering so the function
4126 uses the "output" registers instead. */
4128 #ifdef LEAF_REGISTERS
4130 /* Return 1 if this function uses only the registers that can be
4131 safely renumbered. */
4134 only_leaf_regs_used (void)
4137 const char *const permitted_reg_in_leaf_functions
= LEAF_REGISTERS
;
4139 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4140 if ((df_regs_ever_live_p (i
) || global_regs
[i
])
4141 && ! permitted_reg_in_leaf_functions
[i
])
4144 if (crtl
->uses_pic_offset_table
4145 && pic_offset_table_rtx
!= 0
4146 && REG_P (pic_offset_table_rtx
)
4147 && ! permitted_reg_in_leaf_functions
[REGNO (pic_offset_table_rtx
)])
4153 /* Scan all instructions and renumber all registers into those
4154 available in leaf functions. */
4157 leaf_renumber_regs (rtx first
)
4161 /* Renumber only the actual patterns.
4162 The reg-notes can contain frame pointer refs,
4163 and renumbering them could crash, and should not be needed. */
4164 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
4166 leaf_renumber_regs_insn (PATTERN (insn
));
4169 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4170 available in leaf functions. */
4173 leaf_renumber_regs_insn (rtx in_rtx
)
4176 const char *format_ptr
;
4181 /* Renumber all input-registers into output-registers.
4182 renumbered_regs would be 1 for an output-register;
4189 /* Don't renumber the same reg twice. */
4193 newreg
= REGNO (in_rtx
);
4194 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4195 to reach here as part of a REG_NOTE. */
4196 if (newreg
>= FIRST_PSEUDO_REGISTER
)
4201 newreg
= LEAF_REG_REMAP (newreg
);
4202 gcc_assert (newreg
>= 0);
4203 df_set_regs_ever_live (REGNO (in_rtx
), false);
4204 df_set_regs_ever_live (newreg
, true);
4205 SET_REGNO (in_rtx
, newreg
);
4209 if (INSN_P (in_rtx
))
4211 /* Inside a SEQUENCE, we find insns.
4212 Renumber just the patterns of these insns,
4213 just as we do for the top-level insns. */
4214 leaf_renumber_regs_insn (PATTERN (in_rtx
));
4218 format_ptr
= GET_RTX_FORMAT (GET_CODE (in_rtx
));
4220 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (in_rtx
)); i
++)
4221 switch (*format_ptr
++)
4224 leaf_renumber_regs_insn (XEXP (in_rtx
, i
));
4228 if (NULL
!= XVEC (in_rtx
, i
))
4230 for (j
= 0; j
< XVECLEN (in_rtx
, i
); j
++)
4231 leaf_renumber_regs_insn (XVECEXP (in_rtx
, i
, j
));
4250 /* Turn the RTL into assembly. */
4252 rest_of_handle_final (void)
4257 /* Get the function's name, as described by its RTL. This may be
4258 different from the DECL_NAME name used in the source file. */
4260 x
= DECL_RTL (current_function_decl
);
4261 gcc_assert (MEM_P (x
));
4263 gcc_assert (GET_CODE (x
) == SYMBOL_REF
);
4264 fnname
= XSTR (x
, 0);
4266 assemble_start_function (current_function_decl
, fnname
);
4267 final_start_function (get_insns (), asm_out_file
, optimize
);
4268 final (get_insns (), asm_out_file
, optimize
);
4269 final_end_function ();
4271 /* The IA-64 ".handlerdata" directive must be issued before the ".endp"
4272 directive that closes the procedure descriptor. Similarly, for x64 SEH.
4273 Otherwise it's not strictly necessary, but it doesn't hurt either. */
4274 output_function_exception_table (fnname
);
4276 assemble_end_function (current_function_decl
, fnname
);
4278 user_defined_section_attribute
= false;
4280 /* Free up reg info memory. */
4284 fflush (asm_out_file
);
4286 /* Write DBX symbols if requested. */
4288 /* Note that for those inline functions where we don't initially
4289 know for certain that we will be generating an out-of-line copy,
4290 the first invocation of this routine (rest_of_compilation) will
4291 skip over this code by doing a `goto exit_rest_of_compilation;'.
4292 Later on, wrapup_global_declarations will (indirectly) call
4293 rest_of_compilation again for those inline functions that need
4294 to have out-of-line copies generated. During that call, we
4295 *will* be routed past here. */
4297 timevar_push (TV_SYMOUT
);
4298 if (!DECL_IGNORED_P (current_function_decl
))
4299 debug_hooks
->function_decl (current_function_decl
);
4300 timevar_pop (TV_SYMOUT
);
4302 /* Release the blocks that are linked to DECL_INITIAL() to free the memory. */
4303 DECL_INITIAL (current_function_decl
) = error_mark_node
;
4305 if (DECL_STATIC_CONSTRUCTOR (current_function_decl
)
4306 && targetm
.have_ctors_dtors
)
4307 targetm
.asm_out
.constructor (XEXP (DECL_RTL (current_function_decl
), 0),
4308 decl_init_priority_lookup
4309 (current_function_decl
));
4310 if (DECL_STATIC_DESTRUCTOR (current_function_decl
)
4311 && targetm
.have_ctors_dtors
)
4312 targetm
.asm_out
.destructor (XEXP (DECL_RTL (current_function_decl
), 0),
4313 decl_fini_priority_lookup
4314 (current_function_decl
));
4318 struct rtl_opt_pass pass_final
=
4323 OPTGROUP_NONE
, /* optinfo_flags */
4325 rest_of_handle_final
, /* execute */
4328 0, /* static_pass_number */
4329 TV_FINAL
, /* tv_id */
4330 0, /* properties_required */
4331 0, /* properties_provided */
4332 0, /* properties_destroyed */
4333 0, /* todo_flags_start */
4334 TODO_ggc_collect
/* todo_flags_finish */
4340 rest_of_handle_shorten_branches (void)
4342 /* Shorten branches. */
4343 shorten_branches (get_insns ());
4347 struct rtl_opt_pass pass_shorten_branches
=
4351 "shorten", /* name */
4352 OPTGROUP_NONE
, /* optinfo_flags */
4354 rest_of_handle_shorten_branches
, /* execute */
4357 0, /* static_pass_number */
4358 TV_SHORTEN_BRANCH
, /* tv_id */
4359 0, /* properties_required */
4360 0, /* properties_provided */
4361 0, /* properties_destroyed */
4362 0, /* todo_flags_start */
4363 0 /* todo_flags_finish */
4369 rest_of_clean_state (void)
4372 FILE *final_output
= NULL
;
4373 int save_unnumbered
= flag_dump_unnumbered
;
4374 int save_noaddr
= flag_dump_noaddr
;
4376 if (flag_dump_final_insns
)
4378 final_output
= fopen (flag_dump_final_insns
, "a");
4381 error ("could not open final insn dump file %qs: %m",
4382 flag_dump_final_insns
);
4383 flag_dump_final_insns
= NULL
;
4387 flag_dump_noaddr
= flag_dump_unnumbered
= 1;
4388 if (flag_compare_debug_opt
|| flag_compare_debug
)
4389 dump_flags
|= TDF_NOUID
;
4390 dump_function_header (final_output
, current_function_decl
,
4392 final_insns_dump_p
= true;
4394 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4396 INSN_UID (insn
) = CODE_LABEL_NUMBER (insn
);
4400 set_block_for_insn (insn
, NULL
);
4401 INSN_UID (insn
) = 0;
4406 /* It is very important to decompose the RTL instruction chain here:
4407 debug information keeps pointing into CODE_LABEL insns inside the function
4408 body. If these remain pointing to the other insns, we end up preserving
4409 whole RTL chain and attached detailed debug info in memory. */
4410 for (insn
= get_insns (); insn
; insn
= next
)
4412 next
= NEXT_INSN (insn
);
4413 NEXT_INSN (insn
) = NULL
;
4414 PREV_INSN (insn
) = NULL
;
4417 && (!NOTE_P (insn
) ||
4418 (NOTE_KIND (insn
) != NOTE_INSN_VAR_LOCATION
4419 && NOTE_KIND (insn
) != NOTE_INSN_CALL_ARG_LOCATION
4420 && NOTE_KIND (insn
) != NOTE_INSN_BLOCK_BEG
4421 && NOTE_KIND (insn
) != NOTE_INSN_BLOCK_END
4422 && NOTE_KIND (insn
) != NOTE_INSN_DELETED_DEBUG_LABEL
)))
4423 print_rtl_single (final_output
, insn
);
4428 flag_dump_noaddr
= save_noaddr
;
4429 flag_dump_unnumbered
= save_unnumbered
;
4430 final_insns_dump_p
= false;
4432 if (fclose (final_output
))
4434 error ("could not close final insn dump file %qs: %m",
4435 flag_dump_final_insns
);
4436 flag_dump_final_insns
= NULL
;
4440 /* In case the function was not output,
4441 don't leave any temporary anonymous types
4442 queued up for sdb output. */
4443 #ifdef SDB_DEBUGGING_INFO
4444 if (write_symbols
== SDB_DEBUG
)
4445 sdbout_types (NULL_TREE
);
4448 flag_rerun_cse_after_global_opts
= 0;
4449 reload_completed
= 0;
4450 epilogue_completed
= 0;
4452 regstack_completed
= 0;
4455 /* Clear out the insn_length contents now that they are no
4457 init_insn_lengths ();
4459 /* Show no temporary slots allocated. */
4462 free_bb_for_insn ();
4466 /* We can reduce stack alignment on call site only when we are sure that
4467 the function body just produced will be actually used in the final
4469 if (decl_binds_to_current_def_p (current_function_decl
))
4471 unsigned int pref
= crtl
->preferred_stack_boundary
;
4472 if (crtl
->stack_alignment_needed
> crtl
->preferred_stack_boundary
)
4473 pref
= crtl
->stack_alignment_needed
;
4474 cgraph_rtl_info (current_function_decl
)->preferred_incoming_stack_boundary
4478 /* Make sure volatile mem refs aren't considered valid operands for
4479 arithmetic insns. We must call this here if this is a nested inline
4480 function, since the above code leaves us in the init_recog state,
4481 and the function context push/pop code does not save/restore volatile_ok.
4483 ??? Maybe it isn't necessary for expand_start_function to call this
4484 anymore if we do it here? */
4486 init_recog_no_volatile ();
4488 /* We're done with this function. Free up memory if we can. */
4489 free_after_parsing (cfun
);
4490 free_after_compilation (cfun
);
4494 struct rtl_opt_pass pass_clean_state
=
4498 "*clean_state", /* name */
4499 OPTGROUP_NONE
, /* optinfo_flags */
4501 rest_of_clean_state
, /* execute */
4504 0, /* static_pass_number */
4505 TV_FINAL
, /* tv_id */
4506 0, /* properties_required */
4507 0, /* properties_provided */
4508 PROP_rtl
, /* properties_destroyed */
4509 0, /* todo_flags_start */
4510 0 /* todo_flags_finish */