1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987-2014 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"
55 #include "insn-config.h"
56 #include "insn-attr.h"
58 #include "conditions.h"
60 #include "hard-reg-set.h"
64 #include "rtl-error.h"
65 #include "toplev.h" /* exact_log2, floor_log2 */
68 #include "basic-block.h"
70 #include "targhooks.h"
73 #include "tree-pass.h"
81 #include "tree-pretty-print.h" /* for dump_function_header */
84 #ifdef XCOFF_DEBUGGING_INFO
85 #include "xcoffout.h" /* Needed for external data
86 declarations for e.g. AIX 4.x. */
89 #include "dwarf2out.h"
91 #ifdef DBX_DEBUGGING_INFO
95 #ifdef SDB_DEBUGGING_INFO
99 /* Most ports that aren't using cc0 don't need to define CC_STATUS_INIT.
100 So define a null default for it to save conditionalization later. */
101 #ifndef CC_STATUS_INIT
102 #define CC_STATUS_INIT
105 /* Is the given character a logical line separator for the assembler? */
106 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
107 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C, STR) ((C) == ';')
110 #ifndef JUMP_TABLES_IN_TEXT_SECTION
111 #define JUMP_TABLES_IN_TEXT_SECTION 0
114 /* Bitflags used by final_scan_insn. */
116 #define SEEN_EMITTED 2
118 /* Last insn processed by final_scan_insn. */
119 static rtx debug_insn
;
120 rtx current_output_insn
;
122 /* Line number of last NOTE. */
123 static int last_linenum
;
125 /* Last discriminator written to assembly. */
126 static int last_discriminator
;
128 /* Highest line number in current block. */
129 static int high_block_linenum
;
131 /* Likewise for function. */
132 static int high_function_linenum
;
134 /* Filename of last NOTE. */
135 static const char *last_filename
;
137 /* Override filename, line number, and discriminator. */
138 static const char *override_filename
;
139 static int override_linenum
;
140 static int override_discriminator
;
142 /* Whether to force emission of a line note before the next insn. */
143 static bool force_source_line
= false;
145 extern const int length_unit_log
; /* This is defined in insn-attrtab.c. */
147 /* Nonzero while outputting an `asm' with operands.
148 This means that inconsistencies are the user's fault, so don't die.
149 The precise value is the insn being output, to pass to error_for_asm. */
150 rtx this_is_asm_operands
;
152 /* Number of operands of this insn, for an `asm' with operands. */
153 static unsigned int insn_noperands
;
155 /* Compare optimization flag. */
157 static rtx last_ignored_compare
= 0;
159 /* Assign a unique number to each insn that is output.
160 This can be used to generate unique local labels. */
162 static int insn_counter
= 0;
165 /* This variable contains machine-dependent flags (defined in tm.h)
166 set and examined by output routines
167 that describe how to interpret the condition codes properly. */
171 /* During output of an insn, this contains a copy of cc_status
172 from before the insn. */
174 CC_STATUS cc_prev_status
;
177 /* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen. */
179 static int block_depth
;
181 /* Nonzero if have enabled APP processing of our assembler output. */
185 /* If we are outputting an insn sequence, this contains the sequence rtx.
190 #ifdef ASSEMBLER_DIALECT
192 /* Number of the assembler dialect to use, starting at 0. */
193 static int dialect_number
;
196 /* Nonnull if the insn currently being emitted was a COND_EXEC pattern. */
197 rtx current_insn_predicate
;
199 /* True if printing into -fdump-final-insns= dump. */
200 bool final_insns_dump_p
;
202 /* True if profile_function should be called, but hasn't been called yet. */
203 static bool need_profile_function
;
205 /* True if the function has a split cold section. */
206 static bool has_cold_section_p
;
208 static int asm_insn_count (rtx
);
209 static void profile_function (FILE *);
210 static void profile_after_prologue (FILE *);
211 static bool notice_source_line (rtx
, bool *);
212 static rtx
walk_alter_subreg (rtx
*, bool *);
213 static void output_asm_name (void);
214 static void output_alternate_entry_point (FILE *, rtx
);
215 static tree
get_mem_expr_from_op (rtx
, int *);
216 static void output_asm_operand_names (rtx
*, int *, int);
217 #ifdef LEAF_REGISTERS
218 static void leaf_renumber_regs (rtx
);
221 static int alter_cond (rtx
);
223 #ifndef ADDR_VEC_ALIGN
224 static int final_addr_vec_align (rtx
);
226 static int align_fuzz (rtx
, rtx
, int, unsigned);
228 /* Initialize data in final at the beginning of a compilation. */
231 init_final (const char *filename ATTRIBUTE_UNUSED
)
236 #ifdef ASSEMBLER_DIALECT
237 dialect_number
= ASSEMBLER_DIALECT
;
241 /* Default target function prologue and epilogue assembler output.
243 If not overridden for epilogue code, then the function body itself
244 contains return instructions wherever needed. */
246 default_function_pro_epilogue (FILE *file ATTRIBUTE_UNUSED
,
247 HOST_WIDE_INT size ATTRIBUTE_UNUSED
)
252 default_function_switched_text_sections (FILE *file ATTRIBUTE_UNUSED
,
253 tree decl ATTRIBUTE_UNUSED
,
254 bool new_is_cold ATTRIBUTE_UNUSED
)
258 /* Default target hook that outputs nothing to a stream. */
260 no_asm_to_stream (FILE *file ATTRIBUTE_UNUSED
)
264 /* Enable APP processing of subsequent output.
265 Used before the output from an `asm' statement. */
272 fputs (ASM_APP_ON
, asm_out_file
);
277 /* Disable APP processing of subsequent output.
278 Called from varasm.c before most kinds of output. */
285 fputs (ASM_APP_OFF
, asm_out_file
);
290 /* Return the number of slots filled in the current
291 delayed branch sequence (we don't count the insn needing the
292 delay slot). Zero if not in a delayed branch sequence. */
296 dbr_sequence_length (void)
298 if (final_sequence
!= 0)
299 return XVECLEN (final_sequence
, 0) - 1;
305 /* The next two pages contain routines used to compute the length of an insn
306 and to shorten branches. */
308 /* Arrays for insn lengths, and addresses. The latter is referenced by
309 `insn_current_length'. */
311 static int *insn_lengths
;
313 vec
<int> insn_addresses_
;
315 /* Max uid for which the above arrays are valid. */
316 static int insn_lengths_max_uid
;
318 /* Address of insn being processed. Used by `insn_current_length'. */
319 int insn_current_address
;
321 /* Address of insn being processed in previous iteration. */
322 int insn_last_address
;
324 /* known invariant alignment of insn being processed. */
325 int insn_current_align
;
327 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
328 gives the next following alignment insn that increases the known
329 alignment, or NULL_RTX if there is no such insn.
330 For any alignment obtained this way, we can again index uid_align with
331 its uid to obtain the next following align that in turn increases the
332 alignment, till we reach NULL_RTX; the sequence obtained this way
333 for each insn we'll call the alignment chain of this insn in the following
336 struct label_alignment
342 static rtx
*uid_align
;
343 static int *uid_shuid
;
344 static struct label_alignment
*label_align
;
346 /* Indicate that branch shortening hasn't yet been done. */
349 init_insn_lengths (void)
360 insn_lengths_max_uid
= 0;
362 if (HAVE_ATTR_length
)
363 INSN_ADDRESSES_FREE ();
371 /* Obtain the current length of an insn. If branch shortening has been done,
372 get its actual length. Otherwise, use FALLBACK_FN to calculate the
375 get_attr_length_1 (rtx insn
, int (*fallback_fn
) (rtx
))
381 if (!HAVE_ATTR_length
)
384 if (insn_lengths_max_uid
> INSN_UID (insn
))
385 return insn_lengths
[INSN_UID (insn
)];
387 switch (GET_CODE (insn
))
397 length
= fallback_fn (insn
);
401 body
= PATTERN (insn
);
402 if (GET_CODE (body
) == USE
|| GET_CODE (body
) == CLOBBER
)
405 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
406 length
= asm_insn_count (body
) * fallback_fn (insn
);
407 else if (GET_CODE (body
) == SEQUENCE
)
408 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
409 length
+= get_attr_length_1 (XVECEXP (body
, 0, i
), fallback_fn
);
411 length
= fallback_fn (insn
);
418 #ifdef ADJUST_INSN_LENGTH
419 ADJUST_INSN_LENGTH (insn
, length
);
424 /* Obtain the current length of an insn. If branch shortening has been done,
425 get its actual length. Otherwise, get its maximum length. */
427 get_attr_length (rtx insn
)
429 return get_attr_length_1 (insn
, insn_default_length
);
432 /* Obtain the current length of an insn. If branch shortening has been done,
433 get its actual length. Otherwise, get its minimum length. */
435 get_attr_min_length (rtx insn
)
437 return get_attr_length_1 (insn
, insn_min_length
);
440 /* Code to handle alignment inside shorten_branches. */
442 /* Here is an explanation how the algorithm in align_fuzz can give
445 Call a sequence of instructions beginning with alignment point X
446 and continuing until the next alignment point `block X'. When `X'
447 is used in an expression, it means the alignment value of the
450 Call the distance between the start of the first insn of block X, and
451 the end of the last insn of block X `IX', for the `inner size of X'.
452 This is clearly the sum of the instruction lengths.
454 Likewise with the next alignment-delimited block following X, which we
457 Call the distance between the start of the first insn of block X, and
458 the start of the first insn of block Y `OX', for the `outer size of X'.
460 The estimated padding is then OX - IX.
462 OX can be safely estimated as
467 OX = round_up(IX, X) + Y - X
469 Clearly est(IX) >= real(IX), because that only depends on the
470 instruction lengths, and those being overestimated is a given.
472 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
473 we needn't worry about that when thinking about OX.
475 When X >= Y, the alignment provided by Y adds no uncertainty factor
476 for branch ranges starting before X, so we can just round what we have.
477 But when X < Y, we don't know anything about the, so to speak,
478 `middle bits', so we have to assume the worst when aligning up from an
479 address mod X to one mod Y, which is Y - X. */
482 #define LABEL_ALIGN(LABEL) align_labels_log
486 #define LOOP_ALIGN(LABEL) align_loops_log
489 #ifndef LABEL_ALIGN_AFTER_BARRIER
490 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
494 #define JUMP_ALIGN(LABEL) align_jumps_log
498 default_label_align_after_barrier_max_skip (rtx insn ATTRIBUTE_UNUSED
)
504 default_loop_align_max_skip (rtx insn ATTRIBUTE_UNUSED
)
506 return align_loops_max_skip
;
510 default_label_align_max_skip (rtx insn ATTRIBUTE_UNUSED
)
512 return align_labels_max_skip
;
516 default_jump_align_max_skip (rtx insn ATTRIBUTE_UNUSED
)
518 return align_jumps_max_skip
;
521 #ifndef ADDR_VEC_ALIGN
523 final_addr_vec_align (rtx addr_vec
)
525 int align
= GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec
)));
527 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
528 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
529 return exact_log2 (align
);
533 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
536 #ifndef INSN_LENGTH_ALIGNMENT
537 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
540 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
542 static int min_labelno
, max_labelno
;
544 #define LABEL_TO_ALIGNMENT(LABEL) \
545 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
547 #define LABEL_TO_MAX_SKIP(LABEL) \
548 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
550 /* For the benefit of port specific code do this also as a function. */
553 label_to_alignment (rtx label
)
555 if (CODE_LABEL_NUMBER (label
) <= max_labelno
)
556 return LABEL_TO_ALIGNMENT (label
);
561 label_to_max_skip (rtx label
)
563 if (CODE_LABEL_NUMBER (label
) <= max_labelno
)
564 return LABEL_TO_MAX_SKIP (label
);
568 /* The differences in addresses
569 between a branch and its target might grow or shrink depending on
570 the alignment the start insn of the range (the branch for a forward
571 branch or the label for a backward branch) starts out on; if these
572 differences are used naively, they can even oscillate infinitely.
573 We therefore want to compute a 'worst case' address difference that
574 is independent of the alignment the start insn of the range end
575 up on, and that is at least as large as the actual difference.
576 The function align_fuzz calculates the amount we have to add to the
577 naively computed difference, by traversing the part of the alignment
578 chain of the start insn of the range that is in front of the end insn
579 of the range, and considering for each alignment the maximum amount
580 that it might contribute to a size increase.
582 For casesi tables, we also want to know worst case minimum amounts of
583 address difference, in case a machine description wants to introduce
584 some common offset that is added to all offsets in a table.
585 For this purpose, align_fuzz with a growth argument of 0 computes the
586 appropriate adjustment. */
588 /* Compute the maximum delta by which the difference of the addresses of
589 START and END might grow / shrink due to a different address for start
590 which changes the size of alignment insns between START and END.
591 KNOWN_ALIGN_LOG is the alignment known for START.
592 GROWTH should be ~0 if the objective is to compute potential code size
593 increase, and 0 if the objective is to compute potential shrink.
594 The return value is undefined for any other value of GROWTH. */
597 align_fuzz (rtx start
, rtx end
, int known_align_log
, unsigned int growth
)
599 int uid
= INSN_UID (start
);
601 int known_align
= 1 << known_align_log
;
602 int end_shuid
= INSN_SHUID (end
);
605 for (align_label
= uid_align
[uid
]; align_label
; align_label
= uid_align
[uid
])
607 int align_addr
, new_align
;
609 uid
= INSN_UID (align_label
);
610 align_addr
= INSN_ADDRESSES (uid
) - insn_lengths
[uid
];
611 if (uid_shuid
[uid
] > end_shuid
)
613 known_align_log
= LABEL_TO_ALIGNMENT (align_label
);
614 new_align
= 1 << known_align_log
;
615 if (new_align
< known_align
)
617 fuzz
+= (-align_addr
^ growth
) & (new_align
- known_align
);
618 known_align
= new_align
;
623 /* Compute a worst-case reference address of a branch so that it
624 can be safely used in the presence of aligned labels. Since the
625 size of the branch itself is unknown, the size of the branch is
626 not included in the range. I.e. for a forward branch, the reference
627 address is the end address of the branch as known from the previous
628 branch shortening pass, minus a value to account for possible size
629 increase due to alignment. For a backward branch, it is the start
630 address of the branch as known from the current pass, plus a value
631 to account for possible size increase due to alignment.
632 NB.: Therefore, the maximum offset allowed for backward branches needs
633 to exclude the branch size. */
636 insn_current_reference_address (rtx branch
)
641 if (! INSN_ADDRESSES_SET_P ())
644 seq
= NEXT_INSN (PREV_INSN (branch
));
645 seq_uid
= INSN_UID (seq
);
646 if (!JUMP_P (branch
))
647 /* This can happen for example on the PA; the objective is to know the
648 offset to address something in front of the start of the function.
649 Thus, we can treat it like a backward branch.
650 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
651 any alignment we'd encounter, so we skip the call to align_fuzz. */
652 return insn_current_address
;
653 dest
= JUMP_LABEL (branch
);
655 /* BRANCH has no proper alignment chain set, so use SEQ.
656 BRANCH also has no INSN_SHUID. */
657 if (INSN_SHUID (seq
) < INSN_SHUID (dest
))
659 /* Forward branch. */
660 return (insn_last_address
+ insn_lengths
[seq_uid
]
661 - align_fuzz (seq
, dest
, length_unit_log
, ~0));
665 /* Backward branch. */
666 return (insn_current_address
667 + align_fuzz (dest
, seq
, length_unit_log
, ~0));
671 /* Compute branch alignments based on frequency information in the
675 compute_alignments (void)
677 int log
, max_skip
, max_log
;
680 int freq_threshold
= 0;
688 max_labelno
= max_label_num ();
689 min_labelno
= get_first_label_num ();
690 label_align
= XCNEWVEC (struct label_alignment
, max_labelno
- min_labelno
+ 1);
692 /* If not optimizing or optimizing for size, don't assign any alignments. */
693 if (! optimize
|| optimize_function_for_size_p (cfun
))
698 dump_reg_info (dump_file
);
699 dump_flow_info (dump_file
, TDF_DETAILS
);
700 flow_loops_dump (dump_file
, NULL
, 1);
702 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
703 FOR_EACH_BB_FN (bb
, cfun
)
704 if (bb
->frequency
> freq_max
)
705 freq_max
= bb
->frequency
;
706 freq_threshold
= freq_max
/ PARAM_VALUE (PARAM_ALIGN_THRESHOLD
);
709 fprintf (dump_file
, "freq_max: %i\n",freq_max
);
710 FOR_EACH_BB_FN (bb
, cfun
)
712 rtx label
= BB_HEAD (bb
);
713 int fallthru_frequency
= 0, branch_frequency
= 0, has_fallthru
= 0;
718 || optimize_bb_for_size_p (bb
))
722 "BB %4i freq %4i loop %2i loop_depth %2i skipped.\n",
723 bb
->index
, bb
->frequency
, bb
->loop_father
->num
,
727 max_log
= LABEL_ALIGN (label
);
728 max_skip
= targetm
.asm_out
.label_align_max_skip (label
);
730 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
732 if (e
->flags
& EDGE_FALLTHRU
)
733 has_fallthru
= 1, fallthru_frequency
+= EDGE_FREQUENCY (e
);
735 branch_frequency
+= EDGE_FREQUENCY (e
);
739 fprintf (dump_file
, "BB %4i freq %4i loop %2i loop_depth"
740 " %2i fall %4i branch %4i",
741 bb
->index
, bb
->frequency
, bb
->loop_father
->num
,
743 fallthru_frequency
, branch_frequency
);
744 if (!bb
->loop_father
->inner
&& bb
->loop_father
->num
)
745 fprintf (dump_file
, " inner_loop");
746 if (bb
->loop_father
->header
== bb
)
747 fprintf (dump_file
, " loop_header");
748 fprintf (dump_file
, "\n");
751 /* There are two purposes to align block with no fallthru incoming edge:
752 1) to avoid fetch stalls when branch destination is near cache boundary
753 2) to improve cache efficiency in case the previous block is not executed
754 (so it does not need to be in the cache).
756 We to catch first case, we align frequently executed blocks.
757 To catch the second, we align blocks that are executed more frequently
758 than the predecessor and the predecessor is likely to not be executed
759 when function is called. */
762 && (branch_frequency
> freq_threshold
763 || (bb
->frequency
> bb
->prev_bb
->frequency
* 10
764 && (bb
->prev_bb
->frequency
765 <= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
/ 2))))
767 log
= JUMP_ALIGN (label
);
769 fprintf (dump_file
, " jump alignment added.\n");
773 max_skip
= targetm
.asm_out
.jump_align_max_skip (label
);
776 /* In case block is frequent and reached mostly by non-fallthru edge,
777 align it. It is most likely a first block of loop. */
779 && optimize_bb_for_speed_p (bb
)
780 && branch_frequency
+ fallthru_frequency
> freq_threshold
782 > fallthru_frequency
* PARAM_VALUE (PARAM_ALIGN_LOOP_ITERATIONS
)))
784 log
= LOOP_ALIGN (label
);
786 fprintf (dump_file
, " internal loop alignment added.\n");
790 max_skip
= targetm
.asm_out
.loop_align_max_skip (label
);
792 /* For small size loop, let them align more strictly. */
793 if (targetm
.strict_align
794 && bb
->loop_father
->num
795 && (bb
->loop_father
->ninsns
796 <= PARAM_VALUE (PARAM_ALIGN_LOOP_SIZE
)))
798 max_log
= max_log
+ 1;
799 max_skip
= max_skip
* 2;
802 LABEL_TO_ALIGNMENT (label
) = max_log
;
803 LABEL_TO_MAX_SKIP (label
) = max_skip
;
806 loop_optimizer_finalize ();
807 free_dominance_info (CDI_DOMINATORS
);
811 /* Grow the LABEL_ALIGN array after new labels are created. */
814 grow_label_align (void)
816 int old
= max_labelno
;
820 max_labelno
= max_label_num ();
822 n_labels
= max_labelno
- min_labelno
+ 1;
823 n_old_labels
= old
- min_labelno
+ 1;
825 label_align
= XRESIZEVEC (struct label_alignment
, label_align
, n_labels
);
827 /* Range of labels grows monotonically in the function. Failing here
828 means that the initialization of array got lost. */
829 gcc_assert (n_old_labels
<= n_labels
);
831 memset (label_align
+ n_old_labels
, 0,
832 (n_labels
- n_old_labels
) * sizeof (struct label_alignment
));
835 /* Update the already computed alignment information. LABEL_PAIRS is a vector
836 made up of pairs of labels for which the alignment information of the first
837 element will be copied from that of the second element. */
840 update_alignments (vec
<rtx
> &label_pairs
)
843 rtx iter
, label
= NULL_RTX
;
845 if (max_labelno
!= max_label_num ())
848 FOR_EACH_VEC_ELT (label_pairs
, i
, iter
)
851 LABEL_TO_ALIGNMENT (label
) = LABEL_TO_ALIGNMENT (iter
);
852 LABEL_TO_MAX_SKIP (label
) = LABEL_TO_MAX_SKIP (iter
);
860 const pass_data pass_data_compute_alignments
=
863 "alignments", /* name */
864 OPTGROUP_NONE
, /* optinfo_flags */
865 false, /* has_gate */
866 true, /* has_execute */
868 0, /* properties_required */
869 0, /* properties_provided */
870 0, /* properties_destroyed */
871 0, /* todo_flags_start */
872 TODO_verify_rtl_sharing
, /* todo_flags_finish */
875 class pass_compute_alignments
: public rtl_opt_pass
878 pass_compute_alignments (gcc::context
*ctxt
)
879 : rtl_opt_pass (pass_data_compute_alignments
, ctxt
)
882 /* opt_pass methods: */
883 unsigned int execute () { return compute_alignments (); }
885 }; // class pass_compute_alignments
890 make_pass_compute_alignments (gcc::context
*ctxt
)
892 return new pass_compute_alignments (ctxt
);
896 /* Make a pass over all insns and compute their actual lengths by shortening
897 any branches of variable length if possible. */
899 /* shorten_branches might be called multiple times: for example, the SH
900 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
901 In order to do this, it needs proper length information, which it obtains
902 by calling shorten_branches. This cannot be collapsed with
903 shorten_branches itself into a single pass unless we also want to integrate
904 reorg.c, since the branch splitting exposes new instructions with delay
908 shorten_branches (rtx first
)
915 #define MAX_CODE_ALIGN 16
917 int something_changed
= 1;
918 char *varying_length
;
921 rtx align_tab
[MAX_CODE_ALIGN
];
923 /* Compute maximum UID and allocate label_align / uid_shuid. */
924 max_uid
= get_max_uid ();
926 /* Free uid_shuid before reallocating it. */
929 uid_shuid
= XNEWVEC (int, max_uid
);
931 if (max_labelno
!= max_label_num ())
934 /* Initialize label_align and set up uid_shuid to be strictly
935 monotonically rising with insn order. */
936 /* We use max_log here to keep track of the maximum alignment we want to
937 impose on the next CODE_LABEL (or the current one if we are processing
938 the CODE_LABEL itself). */
943 for (insn
= get_insns (), i
= 1; insn
; insn
= NEXT_INSN (insn
))
947 INSN_SHUID (insn
) = i
++;
954 bool next_is_jumptable
;
956 /* Merge in alignments computed by compute_alignments. */
957 log
= LABEL_TO_ALIGNMENT (insn
);
961 max_skip
= LABEL_TO_MAX_SKIP (insn
);
964 next
= next_nonnote_insn (insn
);
965 next_is_jumptable
= next
&& JUMP_TABLE_DATA_P (next
);
966 if (!next_is_jumptable
)
968 log
= LABEL_ALIGN (insn
);
972 max_skip
= targetm
.asm_out
.label_align_max_skip (insn
);
975 /* ADDR_VECs only take room if read-only data goes into the text
977 if ((JUMP_TABLES_IN_TEXT_SECTION
978 || readonly_data_section
== text_section
)
979 && next_is_jumptable
)
981 log
= ADDR_VEC_ALIGN (next
);
985 max_skip
= targetm
.asm_out
.label_align_max_skip (insn
);
988 LABEL_TO_ALIGNMENT (insn
) = max_log
;
989 LABEL_TO_MAX_SKIP (insn
) = max_skip
;
993 else if (BARRIER_P (insn
))
997 for (label
= insn
; label
&& ! INSN_P (label
);
998 label
= NEXT_INSN (label
))
1001 log
= LABEL_ALIGN_AFTER_BARRIER (insn
);
1005 max_skip
= targetm
.asm_out
.label_align_after_barrier_max_skip (label
);
1011 if (!HAVE_ATTR_length
)
1014 /* Allocate the rest of the arrays. */
1015 insn_lengths
= XNEWVEC (int, max_uid
);
1016 insn_lengths_max_uid
= max_uid
;
1017 /* Syntax errors can lead to labels being outside of the main insn stream.
1018 Initialize insn_addresses, so that we get reproducible results. */
1019 INSN_ADDRESSES_ALLOC (max_uid
);
1021 varying_length
= XCNEWVEC (char, max_uid
);
1023 /* Initialize uid_align. We scan instructions
1024 from end to start, and keep in align_tab[n] the last seen insn
1025 that does an alignment of at least n+1, i.e. the successor
1026 in the alignment chain for an insn that does / has a known
1028 uid_align
= XCNEWVEC (rtx
, max_uid
);
1030 for (i
= MAX_CODE_ALIGN
; --i
>= 0;)
1031 align_tab
[i
] = NULL_RTX
;
1032 seq
= get_last_insn ();
1033 for (; seq
; seq
= PREV_INSN (seq
))
1035 int uid
= INSN_UID (seq
);
1037 log
= (LABEL_P (seq
) ? LABEL_TO_ALIGNMENT (seq
) : 0);
1038 uid_align
[uid
] = align_tab
[0];
1041 /* Found an alignment label. */
1042 uid_align
[uid
] = align_tab
[log
];
1043 for (i
= log
- 1; i
>= 0; i
--)
1048 /* When optimizing, we start assuming minimum length, and keep increasing
1049 lengths as we find the need for this, till nothing changes.
1050 When not optimizing, we start assuming maximum lengths, and
1051 do a single pass to update the lengths. */
1052 bool increasing
= optimize
!= 0;
1054 #ifdef CASE_VECTOR_SHORTEN_MODE
1057 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1060 int min_shuid
= INSN_SHUID (get_insns ()) - 1;
1061 int max_shuid
= INSN_SHUID (get_last_insn ()) + 1;
1064 for (insn
= first
; insn
!= 0; insn
= NEXT_INSN (insn
))
1066 rtx min_lab
= NULL_RTX
, max_lab
= NULL_RTX
, pat
;
1067 int len
, i
, min
, max
, insn_shuid
;
1069 addr_diff_vec_flags flags
;
1071 if (! JUMP_TABLE_DATA_P (insn
)
1072 || GET_CODE (PATTERN (insn
)) != ADDR_DIFF_VEC
)
1074 pat
= PATTERN (insn
);
1075 len
= XVECLEN (pat
, 1);
1076 gcc_assert (len
> 0);
1077 min_align
= MAX_CODE_ALIGN
;
1078 for (min
= max_shuid
, max
= min_shuid
, i
= len
- 1; i
>= 0; i
--)
1080 rtx lab
= XEXP (XVECEXP (pat
, 1, i
), 0);
1081 int shuid
= INSN_SHUID (lab
);
1092 if (min_align
> LABEL_TO_ALIGNMENT (lab
))
1093 min_align
= LABEL_TO_ALIGNMENT (lab
);
1095 XEXP (pat
, 2) = gen_rtx_LABEL_REF (Pmode
, min_lab
);
1096 XEXP (pat
, 3) = gen_rtx_LABEL_REF (Pmode
, max_lab
);
1097 insn_shuid
= INSN_SHUID (insn
);
1098 rel
= INSN_SHUID (XEXP (XEXP (pat
, 0), 0));
1099 memset (&flags
, 0, sizeof (flags
));
1100 flags
.min_align
= min_align
;
1101 flags
.base_after_vec
= rel
> insn_shuid
;
1102 flags
.min_after_vec
= min
> insn_shuid
;
1103 flags
.max_after_vec
= max
> insn_shuid
;
1104 flags
.min_after_base
= min
> rel
;
1105 flags
.max_after_base
= max
> rel
;
1106 ADDR_DIFF_VEC_FLAGS (pat
) = flags
;
1109 PUT_MODE (pat
, CASE_VECTOR_SHORTEN_MODE (0, 0, pat
));
1112 #endif /* CASE_VECTOR_SHORTEN_MODE */
1114 /* Compute initial lengths, addresses, and varying flags for each insn. */
1115 int (*length_fun
) (rtx
) = increasing
? insn_min_length
: insn_default_length
;
1117 for (insn_current_address
= 0, insn
= first
;
1119 insn_current_address
+= insn_lengths
[uid
], insn
= NEXT_INSN (insn
))
1121 uid
= INSN_UID (insn
);
1123 insn_lengths
[uid
] = 0;
1127 int log
= LABEL_TO_ALIGNMENT (insn
);
1130 int align
= 1 << log
;
1131 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1132 insn_lengths
[uid
] = new_address
- insn_current_address
;
1136 INSN_ADDRESSES (uid
) = insn_current_address
+ insn_lengths
[uid
];
1138 if (NOTE_P (insn
) || BARRIER_P (insn
)
1139 || LABEL_P (insn
) || DEBUG_INSN_P (insn
))
1141 if (INSN_DELETED_P (insn
))
1144 body
= PATTERN (insn
);
1145 if (JUMP_TABLE_DATA_P (insn
))
1147 /* This only takes room if read-only data goes into the text
1149 if (JUMP_TABLES_IN_TEXT_SECTION
1150 || readonly_data_section
== text_section
)
1151 insn_lengths
[uid
] = (XVECLEN (body
,
1152 GET_CODE (body
) == ADDR_DIFF_VEC
)
1153 * GET_MODE_SIZE (GET_MODE (body
)));
1154 /* Alignment is handled by ADDR_VEC_ALIGN. */
1156 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
1157 insn_lengths
[uid
] = asm_insn_count (body
) * insn_default_length (insn
);
1158 else if (GET_CODE (body
) == SEQUENCE
)
1161 int const_delay_slots
;
1163 const_delay_slots
= const_num_delay_slots (XVECEXP (body
, 0, 0));
1165 const_delay_slots
= 0;
1167 int (*inner_length_fun
) (rtx
)
1168 = const_delay_slots
? length_fun
: insn_default_length
;
1169 /* Inside a delay slot sequence, we do not do any branch shortening
1170 if the shortening could change the number of delay slots
1172 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1174 rtx inner_insn
= XVECEXP (body
, 0, i
);
1175 int inner_uid
= INSN_UID (inner_insn
);
1178 if (GET_CODE (body
) == ASM_INPUT
1179 || asm_noperands (PATTERN (XVECEXP (body
, 0, i
))) >= 0)
1180 inner_length
= (asm_insn_count (PATTERN (inner_insn
))
1181 * insn_default_length (inner_insn
));
1183 inner_length
= inner_length_fun (inner_insn
);
1185 insn_lengths
[inner_uid
] = inner_length
;
1186 if (const_delay_slots
)
1188 if ((varying_length
[inner_uid
]
1189 = insn_variable_length_p (inner_insn
)) != 0)
1190 varying_length
[uid
] = 1;
1191 INSN_ADDRESSES (inner_uid
) = (insn_current_address
1192 + insn_lengths
[uid
]);
1195 varying_length
[inner_uid
] = 0;
1196 insn_lengths
[uid
] += inner_length
;
1199 else if (GET_CODE (body
) != USE
&& GET_CODE (body
) != CLOBBER
)
1201 insn_lengths
[uid
] = length_fun (insn
);
1202 varying_length
[uid
] = insn_variable_length_p (insn
);
1205 /* If needed, do any adjustment. */
1206 #ifdef ADJUST_INSN_LENGTH
1207 ADJUST_INSN_LENGTH (insn
, insn_lengths
[uid
]);
1208 if (insn_lengths
[uid
] < 0)
1209 fatal_insn ("negative insn length", insn
);
1213 /* Now loop over all the insns finding varying length insns. For each,
1214 get the current insn length. If it has changed, reflect the change.
1215 When nothing changes for a full pass, we are done. */
1217 while (something_changed
)
1219 something_changed
= 0;
1220 insn_current_align
= MAX_CODE_ALIGN
- 1;
1221 for (insn_current_address
= 0, insn
= first
;
1223 insn
= NEXT_INSN (insn
))
1226 #ifdef ADJUST_INSN_LENGTH
1231 uid
= INSN_UID (insn
);
1235 int log
= LABEL_TO_ALIGNMENT (insn
);
1237 #ifdef CASE_VECTOR_SHORTEN_MODE
1238 /* If the mode of a following jump table was changed, we
1239 may need to update the alignment of this label. */
1241 bool next_is_jumptable
;
1243 next
= next_nonnote_insn (insn
);
1244 next_is_jumptable
= next
&& JUMP_TABLE_DATA_P (next
);
1245 if ((JUMP_TABLES_IN_TEXT_SECTION
1246 || readonly_data_section
== text_section
)
1247 && next_is_jumptable
)
1249 int newlog
= ADDR_VEC_ALIGN (next
);
1253 LABEL_TO_ALIGNMENT (insn
) = log
;
1254 something_changed
= 1;
1259 if (log
> insn_current_align
)
1261 int align
= 1 << log
;
1262 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1263 insn_lengths
[uid
] = new_address
- insn_current_address
;
1264 insn_current_align
= log
;
1265 insn_current_address
= new_address
;
1268 insn_lengths
[uid
] = 0;
1269 INSN_ADDRESSES (uid
) = insn_current_address
;
1273 length_align
= INSN_LENGTH_ALIGNMENT (insn
);
1274 if (length_align
< insn_current_align
)
1275 insn_current_align
= length_align
;
1277 insn_last_address
= INSN_ADDRESSES (uid
);
1278 INSN_ADDRESSES (uid
) = insn_current_address
;
1280 #ifdef CASE_VECTOR_SHORTEN_MODE
1282 && JUMP_TABLE_DATA_P (insn
)
1283 && GET_CODE (PATTERN (insn
)) == ADDR_DIFF_VEC
)
1285 rtx body
= PATTERN (insn
);
1286 int old_length
= insn_lengths
[uid
];
1287 rtx rel_lab
= XEXP (XEXP (body
, 0), 0);
1288 rtx min_lab
= XEXP (XEXP (body
, 2), 0);
1289 rtx max_lab
= XEXP (XEXP (body
, 3), 0);
1290 int rel_addr
= INSN_ADDRESSES (INSN_UID (rel_lab
));
1291 int min_addr
= INSN_ADDRESSES (INSN_UID (min_lab
));
1292 int max_addr
= INSN_ADDRESSES (INSN_UID (max_lab
));
1295 addr_diff_vec_flags flags
;
1296 enum machine_mode vec_mode
;
1298 /* Avoid automatic aggregate initialization. */
1299 flags
= ADDR_DIFF_VEC_FLAGS (body
);
1301 /* Try to find a known alignment for rel_lab. */
1302 for (prev
= rel_lab
;
1304 && ! insn_lengths
[INSN_UID (prev
)]
1305 && ! (varying_length
[INSN_UID (prev
)] & 1);
1306 prev
= PREV_INSN (prev
))
1307 if (varying_length
[INSN_UID (prev
)] & 2)
1309 rel_align
= LABEL_TO_ALIGNMENT (prev
);
1313 /* See the comment on addr_diff_vec_flags in rtl.h for the
1314 meaning of the flags values. base: REL_LAB vec: INSN */
1315 /* Anything after INSN has still addresses from the last
1316 pass; adjust these so that they reflect our current
1317 estimate for this pass. */
1318 if (flags
.base_after_vec
)
1319 rel_addr
+= insn_current_address
- insn_last_address
;
1320 if (flags
.min_after_vec
)
1321 min_addr
+= insn_current_address
- insn_last_address
;
1322 if (flags
.max_after_vec
)
1323 max_addr
+= insn_current_address
- insn_last_address
;
1324 /* We want to know the worst case, i.e. lowest possible value
1325 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1326 its offset is positive, and we have to be wary of code shrink;
1327 otherwise, it is negative, and we have to be vary of code
1329 if (flags
.min_after_base
)
1331 /* If INSN is between REL_LAB and MIN_LAB, the size
1332 changes we are about to make can change the alignment
1333 within the observed offset, therefore we have to break
1334 it up into two parts that are independent. */
1335 if (! flags
.base_after_vec
&& flags
.min_after_vec
)
1337 min_addr
-= align_fuzz (rel_lab
, insn
, rel_align
, 0);
1338 min_addr
-= align_fuzz (insn
, min_lab
, 0, 0);
1341 min_addr
-= align_fuzz (rel_lab
, min_lab
, rel_align
, 0);
1345 if (flags
.base_after_vec
&& ! flags
.min_after_vec
)
1347 min_addr
-= align_fuzz (min_lab
, insn
, 0, ~0);
1348 min_addr
-= align_fuzz (insn
, rel_lab
, 0, ~0);
1351 min_addr
-= align_fuzz (min_lab
, rel_lab
, 0, ~0);
1353 /* Likewise, determine the highest lowest possible value
1354 for the offset of MAX_LAB. */
1355 if (flags
.max_after_base
)
1357 if (! flags
.base_after_vec
&& flags
.max_after_vec
)
1359 max_addr
+= align_fuzz (rel_lab
, insn
, rel_align
, ~0);
1360 max_addr
+= align_fuzz (insn
, max_lab
, 0, ~0);
1363 max_addr
+= align_fuzz (rel_lab
, max_lab
, rel_align
, ~0);
1367 if (flags
.base_after_vec
&& ! flags
.max_after_vec
)
1369 max_addr
+= align_fuzz (max_lab
, insn
, 0, 0);
1370 max_addr
+= align_fuzz (insn
, rel_lab
, 0, 0);
1373 max_addr
+= align_fuzz (max_lab
, rel_lab
, 0, 0);
1375 vec_mode
= CASE_VECTOR_SHORTEN_MODE (min_addr
- rel_addr
,
1376 max_addr
- rel_addr
, body
);
1378 || (GET_MODE_SIZE (vec_mode
)
1379 >= GET_MODE_SIZE (GET_MODE (body
))))
1380 PUT_MODE (body
, vec_mode
);
1381 if (JUMP_TABLES_IN_TEXT_SECTION
1382 || readonly_data_section
== text_section
)
1385 = (XVECLEN (body
, 1) * GET_MODE_SIZE (GET_MODE (body
)));
1386 insn_current_address
+= insn_lengths
[uid
];
1387 if (insn_lengths
[uid
] != old_length
)
1388 something_changed
= 1;
1393 #endif /* CASE_VECTOR_SHORTEN_MODE */
1395 if (! (varying_length
[uid
]))
1397 if (NONJUMP_INSN_P (insn
)
1398 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1402 body
= PATTERN (insn
);
1403 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1405 rtx inner_insn
= XVECEXP (body
, 0, i
);
1406 int inner_uid
= INSN_UID (inner_insn
);
1408 INSN_ADDRESSES (inner_uid
) = insn_current_address
;
1410 insn_current_address
+= insn_lengths
[inner_uid
];
1414 insn_current_address
+= insn_lengths
[uid
];
1419 if (NONJUMP_INSN_P (insn
) && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1423 body
= PATTERN (insn
);
1425 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1427 rtx inner_insn
= XVECEXP (body
, 0, i
);
1428 int inner_uid
= INSN_UID (inner_insn
);
1431 INSN_ADDRESSES (inner_uid
) = insn_current_address
;
1433 /* insn_current_length returns 0 for insns with a
1434 non-varying length. */
1435 if (! varying_length
[inner_uid
])
1436 inner_length
= insn_lengths
[inner_uid
];
1438 inner_length
= insn_current_length (inner_insn
);
1440 if (inner_length
!= insn_lengths
[inner_uid
])
1442 if (!increasing
|| inner_length
> insn_lengths
[inner_uid
])
1444 insn_lengths
[inner_uid
] = inner_length
;
1445 something_changed
= 1;
1448 inner_length
= insn_lengths
[inner_uid
];
1450 insn_current_address
+= inner_length
;
1451 new_length
+= inner_length
;
1456 new_length
= insn_current_length (insn
);
1457 insn_current_address
+= new_length
;
1460 #ifdef ADJUST_INSN_LENGTH
1461 /* If needed, do any adjustment. */
1462 tmp_length
= new_length
;
1463 ADJUST_INSN_LENGTH (insn
, new_length
);
1464 insn_current_address
+= (new_length
- tmp_length
);
1467 if (new_length
!= insn_lengths
[uid
]
1468 && (!increasing
|| new_length
> insn_lengths
[uid
]))
1470 insn_lengths
[uid
] = new_length
;
1471 something_changed
= 1;
1474 insn_current_address
+= insn_lengths
[uid
] - new_length
;
1476 /* For a non-optimizing compile, do only a single pass. */
1481 free (varying_length
);
1484 /* Given the body of an INSN known to be generated by an ASM statement, return
1485 the number of machine instructions likely to be generated for this insn.
1486 This is used to compute its length. */
1489 asm_insn_count (rtx body
)
1493 if (GET_CODE (body
) == ASM_INPUT
)
1494 templ
= XSTR (body
, 0);
1496 templ
= decode_asm_operands (body
, NULL
, NULL
, NULL
, NULL
, NULL
);
1498 return asm_str_count (templ
);
1501 /* Return the number of machine instructions likely to be generated for the
1502 inline-asm template. */
1504 asm_str_count (const char *templ
)
1511 for (; *templ
; templ
++)
1512 if (IS_ASM_LOGICAL_LINE_SEPARATOR (*templ
, templ
)
1519 /* ??? This is probably the wrong place for these. */
1520 /* Structure recording the mapping from source file and directory
1521 names at compile time to those to be embedded in debug
1523 typedef struct debug_prefix_map
1525 const char *old_prefix
;
1526 const char *new_prefix
;
1529 struct debug_prefix_map
*next
;
1532 /* Linked list of such structures. */
1533 static debug_prefix_map
*debug_prefix_maps
;
1536 /* Record a debug file prefix mapping. ARG is the argument to
1537 -fdebug-prefix-map and must be of the form OLD=NEW. */
1540 add_debug_prefix_map (const char *arg
)
1542 debug_prefix_map
*map
;
1545 p
= strchr (arg
, '=');
1548 error ("invalid argument %qs to -fdebug-prefix-map", arg
);
1551 map
= XNEW (debug_prefix_map
);
1552 map
->old_prefix
= xstrndup (arg
, p
- arg
);
1553 map
->old_len
= p
- arg
;
1555 map
->new_prefix
= xstrdup (p
);
1556 map
->new_len
= strlen (p
);
1557 map
->next
= debug_prefix_maps
;
1558 debug_prefix_maps
= map
;
1561 /* Perform user-specified mapping of debug filename prefixes. Return
1562 the new name corresponding to FILENAME. */
1565 remap_debug_filename (const char *filename
)
1567 debug_prefix_map
*map
;
1572 for (map
= debug_prefix_maps
; map
; map
= map
->next
)
1573 if (filename_ncmp (filename
, map
->old_prefix
, map
->old_len
) == 0)
1577 name
= filename
+ map
->old_len
;
1578 name_len
= strlen (name
) + 1;
1579 s
= (char *) alloca (name_len
+ map
->new_len
);
1580 memcpy (s
, map
->new_prefix
, map
->new_len
);
1581 memcpy (s
+ map
->new_len
, name
, name_len
);
1582 return ggc_strdup (s
);
1585 /* Return true if DWARF2 debug info can be emitted for DECL. */
1588 dwarf2_debug_info_emitted_p (tree decl
)
1590 if (write_symbols
!= DWARF2_DEBUG
&& write_symbols
!= VMS_AND_DWARF2_DEBUG
)
1593 if (DECL_IGNORED_P (decl
))
1599 /* Return scope resulting from combination of S1 and S2. */
1601 choose_inner_scope (tree s1
, tree s2
)
1607 if (BLOCK_NUMBER (s1
) > BLOCK_NUMBER (s2
))
1612 /* Emit lexical block notes needed to change scope from S1 to S2. */
1615 change_scope (rtx orig_insn
, tree s1
, tree s2
)
1617 rtx insn
= orig_insn
;
1618 tree com
= NULL_TREE
;
1619 tree ts1
= s1
, ts2
= s2
;
1624 gcc_assert (ts1
&& ts2
);
1625 if (BLOCK_NUMBER (ts1
) > BLOCK_NUMBER (ts2
))
1626 ts1
= BLOCK_SUPERCONTEXT (ts1
);
1627 else if (BLOCK_NUMBER (ts1
) < BLOCK_NUMBER (ts2
))
1628 ts2
= BLOCK_SUPERCONTEXT (ts2
);
1631 ts1
= BLOCK_SUPERCONTEXT (ts1
);
1632 ts2
= BLOCK_SUPERCONTEXT (ts2
);
1641 rtx note
= emit_note_before (NOTE_INSN_BLOCK_END
, insn
);
1642 NOTE_BLOCK (note
) = s
;
1643 s
= BLOCK_SUPERCONTEXT (s
);
1650 insn
= emit_note_before (NOTE_INSN_BLOCK_BEG
, insn
);
1651 NOTE_BLOCK (insn
) = s
;
1652 s
= BLOCK_SUPERCONTEXT (s
);
1656 /* Rebuild all the NOTE_INSN_BLOCK_BEG and NOTE_INSN_BLOCK_END notes based
1657 on the scope tree and the newly reordered instructions. */
1660 reemit_insn_block_notes (void)
1662 tree cur_block
= DECL_INITIAL (cfun
->decl
);
1665 insn
= get_insns ();
1666 for (; insn
; insn
= NEXT_INSN (insn
))
1670 /* Prevent lexical blocks from straddling section boundaries. */
1671 if (NOTE_P (insn
) && NOTE_KIND (insn
) == NOTE_INSN_SWITCH_TEXT_SECTIONS
)
1673 for (tree s
= cur_block
; s
!= DECL_INITIAL (cfun
->decl
);
1674 s
= BLOCK_SUPERCONTEXT (s
))
1676 rtx note
= emit_note_before (NOTE_INSN_BLOCK_END
, insn
);
1677 NOTE_BLOCK (note
) = s
;
1678 note
= emit_note_after (NOTE_INSN_BLOCK_BEG
, insn
);
1679 NOTE_BLOCK (note
) = s
;
1683 if (!active_insn_p (insn
))
1686 /* Avoid putting scope notes between jump table and its label. */
1687 if (JUMP_TABLE_DATA_P (insn
))
1690 this_block
= insn_scope (insn
);
1691 /* For sequences compute scope resulting from merging all scopes
1692 of instructions nested inside. */
1693 if (GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1696 rtx body
= PATTERN (insn
);
1699 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1700 this_block
= choose_inner_scope (this_block
,
1701 insn_scope (XVECEXP (body
, 0, i
)));
1705 if (INSN_LOCATION (insn
) == UNKNOWN_LOCATION
)
1708 this_block
= DECL_INITIAL (cfun
->decl
);
1711 if (this_block
!= cur_block
)
1713 change_scope (insn
, cur_block
, this_block
);
1714 cur_block
= this_block
;
1718 /* change_scope emits before the insn, not after. */
1719 note
= emit_note (NOTE_INSN_DELETED
);
1720 change_scope (note
, cur_block
, DECL_INITIAL (cfun
->decl
));
1726 /* Output assembler code for the start of a function,
1727 and initialize some of the variables in this file
1728 for the new function. The label for the function and associated
1729 assembler pseudo-ops have already been output in `assemble_start_function'.
1731 FIRST is the first insn of the rtl for the function being compiled.
1732 FILE is the file to write assembler code to.
1733 OPTIMIZE_P is nonzero if we should eliminate redundant
1734 test and compare insns. */
1737 final_start_function (rtx first
, FILE *file
,
1738 int optimize_p ATTRIBUTE_UNUSED
)
1742 this_is_asm_operands
= 0;
1744 need_profile_function
= false;
1746 last_filename
= LOCATION_FILE (prologue_location
);
1747 last_linenum
= LOCATION_LINE (prologue_location
);
1748 last_discriminator
= 0;
1750 high_block_linenum
= high_function_linenum
= last_linenum
;
1752 if (flag_sanitize
& SANITIZE_ADDRESS
)
1753 asan_function_start ();
1755 if (!DECL_IGNORED_P (current_function_decl
))
1756 debug_hooks
->begin_prologue (last_linenum
, last_filename
);
1758 if (!dwarf2_debug_info_emitted_p (current_function_decl
))
1759 dwarf2out_begin_prologue (0, NULL
);
1761 #ifdef LEAF_REG_REMAP
1762 if (crtl
->uses_only_leaf_regs
)
1763 leaf_renumber_regs (first
);
1766 /* The Sun386i and perhaps other machines don't work right
1767 if the profiling code comes after the prologue. */
1768 if (targetm
.profile_before_prologue () && crtl
->profile
)
1770 if (targetm
.asm_out
.function_prologue
1771 == default_function_pro_epilogue
1772 #ifdef HAVE_prologue
1778 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1784 else if (NOTE_KIND (insn
) == NOTE_INSN_BASIC_BLOCK
1785 || NOTE_KIND (insn
) == NOTE_INSN_FUNCTION_BEG
)
1787 else if (NOTE_KIND (insn
) == NOTE_INSN_DELETED
1788 || NOTE_KIND (insn
) == NOTE_INSN_VAR_LOCATION
)
1797 need_profile_function
= true;
1799 profile_function (file
);
1802 profile_function (file
);
1805 if (warn_frame_larger_than
1806 && get_frame_size () > frame_larger_than_size
)
1808 /* Issue a warning. (WARN_FRAME_LARGER_THAN_EXTRA_TEXT is
1809 provided by configuration. The way extra text is added
1810 here may prevent localization from working properly.
1811 It's totally broken.) */
1812 warning (OPT_Wframe_larger_than_
,
1813 "the frame size of %wd bytes is larger than %wd bytes"
1814 WARN_FRAME_LARGER_THAN_EXTRA_TEXT
,
1815 get_frame_size (), frame_larger_than_size
);
1818 /* First output the function prologue: code to set up the stack frame. */
1819 targetm
.asm_out
.function_prologue (file
, get_frame_size ());
1821 /* If the machine represents the prologue as RTL, the profiling code must
1822 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1823 #ifdef HAVE_prologue
1824 if (! HAVE_prologue
)
1826 profile_after_prologue (file
);
1830 profile_after_prologue (FILE *file ATTRIBUTE_UNUSED
)
1832 if (!targetm
.profile_before_prologue () && crtl
->profile
)
1833 profile_function (file
);
1837 profile_function (FILE *file ATTRIBUTE_UNUSED
)
1839 #ifndef NO_PROFILE_COUNTERS
1840 # define NO_PROFILE_COUNTERS 0
1842 #ifdef ASM_OUTPUT_REG_PUSH
1843 rtx sval
= NULL
, chain
= NULL
;
1845 if (cfun
->returns_struct
)
1846 sval
= targetm
.calls
.struct_value_rtx (TREE_TYPE (current_function_decl
),
1848 if (cfun
->static_chain_decl
)
1849 chain
= targetm
.calls
.static_chain (current_function_decl
, true);
1850 #endif /* ASM_OUTPUT_REG_PUSH */
1852 if (! NO_PROFILE_COUNTERS
)
1854 int align
= MIN (BIGGEST_ALIGNMENT
, LONG_TYPE_SIZE
);
1855 switch_to_section (data_section
);
1856 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
1857 targetm
.asm_out
.internal_label (file
, "LP", FUNC_LABEL_ID (cfun
));
1858 assemble_integer (const0_rtx
, LONG_TYPE_SIZE
/ BITS_PER_UNIT
, align
, 1);
1861 switch_to_section (current_function_section ());
1863 #ifdef ASM_OUTPUT_REG_PUSH
1864 if (sval
&& REG_P (sval
))
1865 ASM_OUTPUT_REG_PUSH (file
, REGNO (sval
));
1866 if (chain
&& REG_P (chain
))
1867 ASM_OUTPUT_REG_PUSH (file
, REGNO (chain
));
1870 FUNCTION_PROFILER (file
, FUNC_LABEL_ID (cfun
));
1872 #ifdef ASM_OUTPUT_REG_PUSH
1873 if (chain
&& REG_P (chain
))
1874 ASM_OUTPUT_REG_POP (file
, REGNO (chain
));
1875 if (sval
&& REG_P (sval
))
1876 ASM_OUTPUT_REG_POP (file
, REGNO (sval
));
1880 /* Output assembler code for the end of a function.
1881 For clarity, args are same as those of `final_start_function'
1882 even though not all of them are needed. */
1885 final_end_function (void)
1889 if (!DECL_IGNORED_P (current_function_decl
))
1890 debug_hooks
->end_function (high_function_linenum
);
1892 /* Finally, output the function epilogue:
1893 code to restore the stack frame and return to the caller. */
1894 targetm
.asm_out
.function_epilogue (asm_out_file
, get_frame_size ());
1896 /* And debug output. */
1897 if (!DECL_IGNORED_P (current_function_decl
))
1898 debug_hooks
->end_epilogue (last_linenum
, last_filename
);
1900 if (!dwarf2_debug_info_emitted_p (current_function_decl
)
1901 && dwarf2out_do_frame ())
1902 dwarf2out_end_epilogue (last_linenum
, last_filename
);
1906 /* Dumper helper for basic block information. FILE is the assembly
1907 output file, and INSN is the instruction being emitted. */
1910 dump_basic_block_info (FILE *file
, rtx insn
, basic_block
*start_to_bb
,
1911 basic_block
*end_to_bb
, int bb_map_size
, int *bb_seqn
)
1915 if (!flag_debug_asm
)
1918 if (INSN_UID (insn
) < bb_map_size
1919 && (bb
= start_to_bb
[INSN_UID (insn
)]) != NULL
)
1924 fprintf (file
, "%s BLOCK %d", ASM_COMMENT_START
, bb
->index
);
1926 fprintf (file
, " freq:%d", bb
->frequency
);
1928 fprintf (file
, " count:" HOST_WIDEST_INT_PRINT_DEC
,
1930 fprintf (file
, " seq:%d", (*bb_seqn
)++);
1931 fprintf (file
, "\n%s PRED:", ASM_COMMENT_START
);
1932 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
1934 dump_edge_info (file
, e
, TDF_DETAILS
, 0);
1936 fprintf (file
, "\n");
1938 if (INSN_UID (insn
) < bb_map_size
1939 && (bb
= end_to_bb
[INSN_UID (insn
)]) != NULL
)
1944 fprintf (asm_out_file
, "%s SUCC:", ASM_COMMENT_START
);
1945 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1947 dump_edge_info (asm_out_file
, e
, TDF_DETAILS
, 1);
1949 fprintf (file
, "\n");
1953 /* Output assembler code for some insns: all or part of a function.
1954 For description of args, see `final_start_function', above. */
1957 final (rtx first
, FILE *file
, int optimize_p
)
1962 /* Used for -dA dump. */
1963 basic_block
*start_to_bb
= NULL
;
1964 basic_block
*end_to_bb
= NULL
;
1965 int bb_map_size
= 0;
1968 last_ignored_compare
= 0;
1971 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1973 /* If CC tracking across branches is enabled, record the insn which
1974 jumps to each branch only reached from one place. */
1975 if (optimize_p
&& JUMP_P (insn
))
1977 rtx lab
= JUMP_LABEL (insn
);
1978 if (lab
&& LABEL_P (lab
) && LABEL_NUSES (lab
) == 1)
1980 LABEL_REFS (lab
) = insn
;
1994 bb_map_size
= get_max_uid () + 1;
1995 start_to_bb
= XCNEWVEC (basic_block
, bb_map_size
);
1996 end_to_bb
= XCNEWVEC (basic_block
, bb_map_size
);
1998 /* There is no cfg for a thunk. */
1999 if (!cfun
->is_thunk
)
2000 FOR_EACH_BB_REVERSE_FN (bb
, cfun
)
2002 start_to_bb
[INSN_UID (BB_HEAD (bb
))] = bb
;
2003 end_to_bb
[INSN_UID (BB_END (bb
))] = bb
;
2007 /* Output the insns. */
2008 for (insn
= first
; insn
;)
2010 if (HAVE_ATTR_length
)
2012 if ((unsigned) INSN_UID (insn
) >= INSN_ADDRESSES_SIZE ())
2014 /* This can be triggered by bugs elsewhere in the compiler if
2015 new insns are created after init_insn_lengths is called. */
2016 gcc_assert (NOTE_P (insn
));
2017 insn_current_address
= -1;
2020 insn_current_address
= INSN_ADDRESSES (INSN_UID (insn
));
2023 dump_basic_block_info (file
, insn
, start_to_bb
, end_to_bb
,
2024 bb_map_size
, &bb_seqn
);
2025 insn
= final_scan_insn (insn
, file
, optimize_p
, 0, &seen
);
2034 /* Remove CFI notes, to avoid compare-debug failures. */
2035 for (insn
= first
; insn
; insn
= next
)
2037 next
= NEXT_INSN (insn
);
2039 && (NOTE_KIND (insn
) == NOTE_INSN_CFI
2040 || NOTE_KIND (insn
) == NOTE_INSN_CFI_LABEL
))
2046 get_insn_template (int code
, rtx insn
)
2048 switch (insn_data
[code
].output_format
)
2050 case INSN_OUTPUT_FORMAT_SINGLE
:
2051 return insn_data
[code
].output
.single
;
2052 case INSN_OUTPUT_FORMAT_MULTI
:
2053 return insn_data
[code
].output
.multi
[which_alternative
];
2054 case INSN_OUTPUT_FORMAT_FUNCTION
:
2056 return (*insn_data
[code
].output
.function
) (recog_data
.operand
, insn
);
2063 /* Emit the appropriate declaration for an alternate-entry-point
2064 symbol represented by INSN, to FILE. INSN is a CODE_LABEL with
2065 LABEL_KIND != LABEL_NORMAL.
2067 The case fall-through in this function is intentional. */
2069 output_alternate_entry_point (FILE *file
, rtx insn
)
2071 const char *name
= LABEL_NAME (insn
);
2073 switch (LABEL_KIND (insn
))
2075 case LABEL_WEAK_ENTRY
:
2076 #ifdef ASM_WEAKEN_LABEL
2077 ASM_WEAKEN_LABEL (file
, name
);
2079 case LABEL_GLOBAL_ENTRY
:
2080 targetm
.asm_out
.globalize_label (file
, name
);
2081 case LABEL_STATIC_ENTRY
:
2082 #ifdef ASM_OUTPUT_TYPE_DIRECTIVE
2083 ASM_OUTPUT_TYPE_DIRECTIVE (file
, name
, "function");
2085 ASM_OUTPUT_LABEL (file
, name
);
2094 /* Given a CALL_INSN, find and return the nested CALL. */
2096 call_from_call_insn (rtx insn
)
2099 gcc_assert (CALL_P (insn
));
2102 while (GET_CODE (x
) != CALL
)
2104 switch (GET_CODE (x
))
2109 x
= COND_EXEC_CODE (x
);
2112 x
= XVECEXP (x
, 0, 0);
2122 /* The final scan for one insn, INSN.
2123 Args are same as in `final', except that INSN
2124 is the insn being scanned.
2125 Value returned is the next insn to be scanned.
2127 NOPEEPHOLES is the flag to disallow peephole processing (currently
2128 used for within delayed branch sequence output).
2130 SEEN is used to track the end of the prologue, for emitting
2131 debug information. We force the emission of a line note after
2132 both NOTE_INSN_PROLOGUE_END and NOTE_INSN_FUNCTION_BEG. */
2135 final_scan_insn (rtx insn
, FILE *file
, int optimize_p ATTRIBUTE_UNUSED
,
2136 int nopeepholes ATTRIBUTE_UNUSED
, int *seen
)
2145 /* Ignore deleted insns. These can occur when we split insns (due to a
2146 template of "#") while not optimizing. */
2147 if (INSN_DELETED_P (insn
))
2148 return NEXT_INSN (insn
);
2150 switch (GET_CODE (insn
))
2153 switch (NOTE_KIND (insn
))
2155 case NOTE_INSN_DELETED
:
2158 case NOTE_INSN_SWITCH_TEXT_SECTIONS
:
2159 in_cold_section_p
= !in_cold_section_p
;
2161 if (dwarf2out_do_frame ())
2162 dwarf2out_switch_text_section ();
2163 else if (!DECL_IGNORED_P (current_function_decl
))
2164 debug_hooks
->switch_text_section ();
2166 switch_to_section (current_function_section ());
2167 targetm
.asm_out
.function_switched_text_sections (asm_out_file
,
2168 current_function_decl
,
2170 /* Emit a label for the split cold section. Form label name by
2171 suffixing "cold" to the original function's name. */
2172 if (in_cold_section_p
)
2175 = clone_function_name (current_function_decl
, "cold");
2176 #ifdef ASM_DECLARE_FUNCTION_NAME
2177 ASM_DECLARE_FUNCTION_NAME (asm_out_file
,
2178 IDENTIFIER_POINTER (cold_partition_name
),
2179 current_function_decl
);
2181 ASM_OUTPUT_LABEL (asm_out_file
,
2182 IDENTIFIER_POINTER (cold_partition_name
));
2185 has_cold_section_p
= true;
2188 case NOTE_INSN_BASIC_BLOCK
:
2189 if (need_profile_function
)
2191 profile_function (asm_out_file
);
2192 need_profile_function
= false;
2195 if (targetm
.asm_out
.unwind_emit
)
2196 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
2200 case NOTE_INSN_EH_REGION_BEG
:
2201 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LEHB",
2202 NOTE_EH_HANDLER (insn
));
2205 case NOTE_INSN_EH_REGION_END
:
2206 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LEHE",
2207 NOTE_EH_HANDLER (insn
));
2210 case NOTE_INSN_PROLOGUE_END
:
2211 targetm
.asm_out
.function_end_prologue (file
);
2212 profile_after_prologue (file
);
2214 if ((*seen
& (SEEN_EMITTED
| SEEN_NOTE
)) == SEEN_NOTE
)
2216 *seen
|= SEEN_EMITTED
;
2217 force_source_line
= true;
2224 case NOTE_INSN_EPILOGUE_BEG
:
2225 if (!DECL_IGNORED_P (current_function_decl
))
2226 (*debug_hooks
->begin_epilogue
) (last_linenum
, last_filename
);
2227 targetm
.asm_out
.function_begin_epilogue (file
);
2231 dwarf2out_emit_cfi (NOTE_CFI (insn
));
2234 case NOTE_INSN_CFI_LABEL
:
2235 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LCFI",
2236 NOTE_LABEL_NUMBER (insn
));
2239 case NOTE_INSN_FUNCTION_BEG
:
2240 if (need_profile_function
)
2242 profile_function (asm_out_file
);
2243 need_profile_function
= false;
2247 if (!DECL_IGNORED_P (current_function_decl
))
2248 debug_hooks
->end_prologue (last_linenum
, last_filename
);
2250 if ((*seen
& (SEEN_EMITTED
| SEEN_NOTE
)) == SEEN_NOTE
)
2252 *seen
|= SEEN_EMITTED
;
2253 force_source_line
= true;
2260 case NOTE_INSN_BLOCK_BEG
:
2261 if (debug_info_level
== DINFO_LEVEL_NORMAL
2262 || debug_info_level
== DINFO_LEVEL_VERBOSE
2263 || write_symbols
== DWARF2_DEBUG
2264 || write_symbols
== VMS_AND_DWARF2_DEBUG
2265 || write_symbols
== VMS_DEBUG
)
2267 int n
= BLOCK_NUMBER (NOTE_BLOCK (insn
));
2271 high_block_linenum
= last_linenum
;
2273 /* Output debugging info about the symbol-block beginning. */
2274 if (!DECL_IGNORED_P (current_function_decl
))
2275 debug_hooks
->begin_block (last_linenum
, n
);
2277 /* Mark this block as output. */
2278 TREE_ASM_WRITTEN (NOTE_BLOCK (insn
)) = 1;
2280 if (write_symbols
== DBX_DEBUG
2281 || write_symbols
== SDB_DEBUG
)
2283 location_t
*locus_ptr
2284 = block_nonartificial_location (NOTE_BLOCK (insn
));
2286 if (locus_ptr
!= NULL
)
2288 override_filename
= LOCATION_FILE (*locus_ptr
);
2289 override_linenum
= LOCATION_LINE (*locus_ptr
);
2290 override_discriminator
=
2291 get_discriminator_from_locus (*locus_ptr
);
2296 case NOTE_INSN_BLOCK_END
:
2297 if (debug_info_level
== DINFO_LEVEL_NORMAL
2298 || debug_info_level
== DINFO_LEVEL_VERBOSE
2299 || write_symbols
== DWARF2_DEBUG
2300 || write_symbols
== VMS_AND_DWARF2_DEBUG
2301 || write_symbols
== VMS_DEBUG
)
2303 int n
= BLOCK_NUMBER (NOTE_BLOCK (insn
));
2307 /* End of a symbol-block. */
2309 gcc_assert (block_depth
>= 0);
2311 if (!DECL_IGNORED_P (current_function_decl
))
2312 debug_hooks
->end_block (high_block_linenum
, n
);
2314 if (write_symbols
== DBX_DEBUG
2315 || write_symbols
== SDB_DEBUG
)
2317 tree outer_block
= BLOCK_SUPERCONTEXT (NOTE_BLOCK (insn
));
2318 location_t
*locus_ptr
2319 = block_nonartificial_location (outer_block
);
2321 if (locus_ptr
!= NULL
)
2323 override_filename
= LOCATION_FILE (*locus_ptr
);
2324 override_linenum
= LOCATION_LINE (*locus_ptr
);
2325 override_discriminator
=
2326 get_discriminator_from_locus (*locus_ptr
);
2330 override_filename
= NULL
;
2331 override_linenum
= 0;
2332 override_discriminator
= 0;
2337 case NOTE_INSN_DELETED_LABEL
:
2338 /* Emit the label. We may have deleted the CODE_LABEL because
2339 the label could be proved to be unreachable, though still
2340 referenced (in the form of having its address taken. */
2341 ASM_OUTPUT_DEBUG_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
2344 case NOTE_INSN_DELETED_DEBUG_LABEL
:
2345 /* Similarly, but need to use different namespace for it. */
2346 if (CODE_LABEL_NUMBER (insn
) != -1)
2347 ASM_OUTPUT_DEBUG_LABEL (file
, "LDL", CODE_LABEL_NUMBER (insn
));
2350 case NOTE_INSN_VAR_LOCATION
:
2351 case NOTE_INSN_CALL_ARG_LOCATION
:
2352 if (!DECL_IGNORED_P (current_function_decl
))
2353 debug_hooks
->var_location (insn
);
2366 /* The target port might emit labels in the output function for
2367 some insn, e.g. sh.c output_branchy_insn. */
2368 if (CODE_LABEL_NUMBER (insn
) <= max_labelno
)
2370 int align
= LABEL_TO_ALIGNMENT (insn
);
2371 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2372 int max_skip
= LABEL_TO_MAX_SKIP (insn
);
2375 if (align
&& NEXT_INSN (insn
))
2377 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2378 ASM_OUTPUT_MAX_SKIP_ALIGN (file
, align
, max_skip
);
2380 #ifdef ASM_OUTPUT_ALIGN_WITH_NOP
2381 ASM_OUTPUT_ALIGN_WITH_NOP (file
, align
);
2383 ASM_OUTPUT_ALIGN (file
, align
);
2390 if (!DECL_IGNORED_P (current_function_decl
) && LABEL_NAME (insn
))
2391 debug_hooks
->label (insn
);
2395 next
= next_nonnote_insn (insn
);
2396 /* If this label is followed by a jump-table, make sure we put
2397 the label in the read-only section. Also possibly write the
2398 label and jump table together. */
2399 if (next
!= 0 && JUMP_TABLE_DATA_P (next
))
2401 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2402 /* In this case, the case vector is being moved by the
2403 target, so don't output the label at all. Leave that
2404 to the back end macros. */
2406 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2410 switch_to_section (targetm
.asm_out
.function_rodata_section
2411 (current_function_decl
));
2413 #ifdef ADDR_VEC_ALIGN
2414 log_align
= ADDR_VEC_ALIGN (next
);
2416 log_align
= exact_log2 (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
);
2418 ASM_OUTPUT_ALIGN (file
, log_align
);
2421 switch_to_section (current_function_section ());
2423 #ifdef ASM_OUTPUT_CASE_LABEL
2424 ASM_OUTPUT_CASE_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
),
2427 targetm
.asm_out
.internal_label (file
, "L", CODE_LABEL_NUMBER (insn
));
2432 if (LABEL_ALT_ENTRY_P (insn
))
2433 output_alternate_entry_point (file
, insn
);
2435 targetm
.asm_out
.internal_label (file
, "L", CODE_LABEL_NUMBER (insn
));
2440 rtx body
= PATTERN (insn
);
2441 int insn_code_number
;
2445 /* Reset this early so it is correct for ASM statements. */
2446 current_insn_predicate
= NULL_RTX
;
2448 /* An INSN, JUMP_INSN or CALL_INSN.
2449 First check for special kinds that recog doesn't recognize. */
2451 if (GET_CODE (body
) == USE
/* These are just declarations. */
2452 || GET_CODE (body
) == CLOBBER
)
2457 /* If there is a REG_CC_SETTER note on this insn, it means that
2458 the setting of the condition code was done in the delay slot
2459 of the insn that branched here. So recover the cc status
2460 from the insn that set it. */
2462 rtx note
= find_reg_note (insn
, REG_CC_SETTER
, NULL_RTX
);
2465 NOTICE_UPDATE_CC (PATTERN (XEXP (note
, 0)), XEXP (note
, 0));
2466 cc_prev_status
= cc_status
;
2471 /* Detect insns that are really jump-tables
2472 and output them as such. */
2474 if (JUMP_TABLE_DATA_P (insn
))
2476 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2480 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2481 switch_to_section (targetm
.asm_out
.function_rodata_section
2482 (current_function_decl
));
2484 switch_to_section (current_function_section ());
2488 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2489 if (GET_CODE (body
) == ADDR_VEC
)
2491 #ifdef ASM_OUTPUT_ADDR_VEC
2492 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn
), body
);
2499 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2500 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn
), body
);
2506 vlen
= XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
);
2507 for (idx
= 0; idx
< vlen
; idx
++)
2509 if (GET_CODE (body
) == ADDR_VEC
)
2511 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2512 ASM_OUTPUT_ADDR_VEC_ELT
2513 (file
, CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 0, idx
), 0)));
2520 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2521 ASM_OUTPUT_ADDR_DIFF_ELT
2524 CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 1, idx
), 0)),
2525 CODE_LABEL_NUMBER (XEXP (XEXP (body
, 0), 0)));
2531 #ifdef ASM_OUTPUT_CASE_END
2532 ASM_OUTPUT_CASE_END (file
,
2533 CODE_LABEL_NUMBER (PREV_INSN (insn
)),
2538 switch_to_section (current_function_section ());
2542 /* Output this line note if it is the first or the last line
2544 if (!DECL_IGNORED_P (current_function_decl
)
2545 && notice_source_line (insn
, &is_stmt
))
2546 (*debug_hooks
->source_line
) (last_linenum
, last_filename
,
2547 last_discriminator
, is_stmt
);
2549 if (GET_CODE (body
) == ASM_INPUT
)
2551 const char *string
= XSTR (body
, 0);
2553 /* There's no telling what that did to the condition codes. */
2558 expanded_location loc
;
2561 loc
= expand_location (ASM_INPUT_SOURCE_LOCATION (body
));
2562 if (*loc
.file
&& loc
.line
)
2563 fprintf (asm_out_file
, "%s %i \"%s\" 1\n",
2564 ASM_COMMENT_START
, loc
.line
, loc
.file
);
2565 fprintf (asm_out_file
, "\t%s\n", string
);
2566 #if HAVE_AS_LINE_ZERO
2567 if (*loc
.file
&& loc
.line
)
2568 fprintf (asm_out_file
, "%s 0 \"\" 2\n", ASM_COMMENT_START
);
2574 /* Detect `asm' construct with operands. */
2575 if (asm_noperands (body
) >= 0)
2577 unsigned int noperands
= asm_noperands (body
);
2578 rtx
*ops
= XALLOCAVEC (rtx
, noperands
);
2581 expanded_location expanded
;
2583 /* There's no telling what that did to the condition codes. */
2586 /* Get out the operand values. */
2587 string
= decode_asm_operands (body
, ops
, NULL
, NULL
, NULL
, &loc
);
2588 /* Inhibit dying on what would otherwise be compiler bugs. */
2589 insn_noperands
= noperands
;
2590 this_is_asm_operands
= insn
;
2591 expanded
= expand_location (loc
);
2593 #ifdef FINAL_PRESCAN_INSN
2594 FINAL_PRESCAN_INSN (insn
, ops
, insn_noperands
);
2597 /* Output the insn using them. */
2601 if (expanded
.file
&& expanded
.line
)
2602 fprintf (asm_out_file
, "%s %i \"%s\" 1\n",
2603 ASM_COMMENT_START
, expanded
.line
, expanded
.file
);
2604 output_asm_insn (string
, ops
);
2605 #if HAVE_AS_LINE_ZERO
2606 if (expanded
.file
&& expanded
.line
)
2607 fprintf (asm_out_file
, "%s 0 \"\" 2\n", ASM_COMMENT_START
);
2611 if (targetm
.asm_out
.final_postscan_insn
)
2612 targetm
.asm_out
.final_postscan_insn (file
, insn
, ops
,
2615 this_is_asm_operands
= 0;
2621 if (GET_CODE (body
) == SEQUENCE
)
2623 /* A delayed-branch sequence */
2626 final_sequence
= body
;
2628 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2629 force the restoration of a comparison that was previously
2630 thought unnecessary. If that happens, cancel this sequence
2631 and cause that insn to be restored. */
2633 next
= final_scan_insn (XVECEXP (body
, 0, 0), file
, 0, 1, seen
);
2634 if (next
!= XVECEXP (body
, 0, 1))
2640 for (i
= 1; i
< XVECLEN (body
, 0); i
++)
2642 rtx insn
= XVECEXP (body
, 0, i
);
2643 rtx next
= NEXT_INSN (insn
);
2644 /* We loop in case any instruction in a delay slot gets
2647 insn
= final_scan_insn (insn
, file
, 0, 1, seen
);
2648 while (insn
!= next
);
2650 #ifdef DBR_OUTPUT_SEQEND
2651 DBR_OUTPUT_SEQEND (file
);
2655 /* If the insn requiring the delay slot was a CALL_INSN, the
2656 insns in the delay slot are actually executed before the
2657 called function. Hence we don't preserve any CC-setting
2658 actions in these insns and the CC must be marked as being
2659 clobbered by the function. */
2660 if (CALL_P (XVECEXP (body
, 0, 0)))
2667 /* We have a real machine instruction as rtl. */
2669 body
= PATTERN (insn
);
2672 set
= single_set (insn
);
2674 /* Check for redundant test and compare instructions
2675 (when the condition codes are already set up as desired).
2676 This is done only when optimizing; if not optimizing,
2677 it should be possible for the user to alter a variable
2678 with the debugger in between statements
2679 and the next statement should reexamine the variable
2680 to compute the condition codes. */
2685 && GET_CODE (SET_DEST (set
)) == CC0
2686 && insn
!= last_ignored_compare
)
2689 if (GET_CODE (SET_SRC (set
)) == SUBREG
)
2690 SET_SRC (set
) = alter_subreg (&SET_SRC (set
), true);
2692 src1
= SET_SRC (set
);
2694 if (GET_CODE (SET_SRC (set
)) == COMPARE
)
2696 if (GET_CODE (XEXP (SET_SRC (set
), 0)) == SUBREG
)
2697 XEXP (SET_SRC (set
), 0)
2698 = alter_subreg (&XEXP (SET_SRC (set
), 0), true);
2699 if (GET_CODE (XEXP (SET_SRC (set
), 1)) == SUBREG
)
2700 XEXP (SET_SRC (set
), 1)
2701 = alter_subreg (&XEXP (SET_SRC (set
), 1), true);
2702 if (XEXP (SET_SRC (set
), 1)
2703 == CONST0_RTX (GET_MODE (XEXP (SET_SRC (set
), 0))))
2704 src2
= XEXP (SET_SRC (set
), 0);
2706 if ((cc_status
.value1
!= 0
2707 && rtx_equal_p (src1
, cc_status
.value1
))
2708 || (cc_status
.value2
!= 0
2709 && rtx_equal_p (src1
, cc_status
.value2
))
2710 || (src2
!= 0 && cc_status
.value1
!= 0
2711 && rtx_equal_p (src2
, cc_status
.value1
))
2712 || (src2
!= 0 && cc_status
.value2
!= 0
2713 && rtx_equal_p (src2
, cc_status
.value2
)))
2715 /* Don't delete insn if it has an addressing side-effect. */
2716 if (! FIND_REG_INC_NOTE (insn
, NULL_RTX
)
2717 /* or if anything in it is volatile. */
2718 && ! volatile_refs_p (PATTERN (insn
)))
2720 /* We don't really delete the insn; just ignore it. */
2721 last_ignored_compare
= insn
;
2728 /* If this is a conditional branch, maybe modify it
2729 if the cc's are in a nonstandard state
2730 so that it accomplishes the same thing that it would
2731 do straightforwardly if the cc's were set up normally. */
2733 if (cc_status
.flags
!= 0
2735 && GET_CODE (body
) == SET
2736 && SET_DEST (body
) == pc_rtx
2737 && GET_CODE (SET_SRC (body
)) == IF_THEN_ELSE
2738 && COMPARISON_P (XEXP (SET_SRC (body
), 0))
2739 && XEXP (XEXP (SET_SRC (body
), 0), 0) == cc0_rtx
)
2741 /* This function may alter the contents of its argument
2742 and clear some of the cc_status.flags bits.
2743 It may also return 1 meaning condition now always true
2744 or -1 meaning condition now always false
2745 or 2 meaning condition nontrivial but altered. */
2746 int result
= alter_cond (XEXP (SET_SRC (body
), 0));
2747 /* If condition now has fixed value, replace the IF_THEN_ELSE
2748 with its then-operand or its else-operand. */
2750 SET_SRC (body
) = XEXP (SET_SRC (body
), 1);
2752 SET_SRC (body
) = XEXP (SET_SRC (body
), 2);
2754 /* The jump is now either unconditional or a no-op.
2755 If it has become a no-op, don't try to output it.
2756 (It would not be recognized.) */
2757 if (SET_SRC (body
) == pc_rtx
)
2762 else if (ANY_RETURN_P (SET_SRC (body
)))
2763 /* Replace (set (pc) (return)) with (return). */
2764 PATTERN (insn
) = body
= SET_SRC (body
);
2766 /* Rerecognize the instruction if it has changed. */
2768 INSN_CODE (insn
) = -1;
2771 /* If this is a conditional trap, maybe modify it if the cc's
2772 are in a nonstandard state so that it accomplishes the same
2773 thing that it would do straightforwardly if the cc's were
2775 if (cc_status
.flags
!= 0
2776 && NONJUMP_INSN_P (insn
)
2777 && GET_CODE (body
) == TRAP_IF
2778 && COMPARISON_P (TRAP_CONDITION (body
))
2779 && XEXP (TRAP_CONDITION (body
), 0) == cc0_rtx
)
2781 /* This function may alter the contents of its argument
2782 and clear some of the cc_status.flags bits.
2783 It may also return 1 meaning condition now always true
2784 or -1 meaning condition now always false
2785 or 2 meaning condition nontrivial but altered. */
2786 int result
= alter_cond (TRAP_CONDITION (body
));
2788 /* If TRAP_CONDITION has become always false, delete the
2796 /* If TRAP_CONDITION has become always true, replace
2797 TRAP_CONDITION with const_true_rtx. */
2799 TRAP_CONDITION (body
) = const_true_rtx
;
2801 /* Rerecognize the instruction if it has changed. */
2803 INSN_CODE (insn
) = -1;
2806 /* Make same adjustments to instructions that examine the
2807 condition codes without jumping and instructions that
2808 handle conditional moves (if this machine has either one). */
2810 if (cc_status
.flags
!= 0
2813 rtx cond_rtx
, then_rtx
, else_rtx
;
2816 && GET_CODE (SET_SRC (set
)) == IF_THEN_ELSE
)
2818 cond_rtx
= XEXP (SET_SRC (set
), 0);
2819 then_rtx
= XEXP (SET_SRC (set
), 1);
2820 else_rtx
= XEXP (SET_SRC (set
), 2);
2824 cond_rtx
= SET_SRC (set
);
2825 then_rtx
= const_true_rtx
;
2826 else_rtx
= const0_rtx
;
2829 if (COMPARISON_P (cond_rtx
)
2830 && XEXP (cond_rtx
, 0) == cc0_rtx
)
2833 result
= alter_cond (cond_rtx
);
2835 validate_change (insn
, &SET_SRC (set
), then_rtx
, 0);
2836 else if (result
== -1)
2837 validate_change (insn
, &SET_SRC (set
), else_rtx
, 0);
2838 else if (result
== 2)
2839 INSN_CODE (insn
) = -1;
2840 if (SET_DEST (set
) == SET_SRC (set
))
2847 #ifdef HAVE_peephole
2848 /* Do machine-specific peephole optimizations if desired. */
2850 if (optimize_p
&& !flag_no_peephole
&& !nopeepholes
)
2852 rtx next
= peephole (insn
);
2853 /* When peepholing, if there were notes within the peephole,
2854 emit them before the peephole. */
2855 if (next
!= 0 && next
!= NEXT_INSN (insn
))
2857 rtx note
, prev
= PREV_INSN (insn
);
2859 for (note
= NEXT_INSN (insn
); note
!= next
;
2860 note
= NEXT_INSN (note
))
2861 final_scan_insn (note
, file
, optimize_p
, nopeepholes
, seen
);
2863 /* Put the notes in the proper position for a later
2864 rescan. For example, the SH target can do this
2865 when generating a far jump in a delayed branch
2867 note
= NEXT_INSN (insn
);
2868 PREV_INSN (note
) = prev
;
2869 NEXT_INSN (prev
) = note
;
2870 NEXT_INSN (PREV_INSN (next
)) = insn
;
2871 PREV_INSN (insn
) = PREV_INSN (next
);
2872 NEXT_INSN (insn
) = next
;
2873 PREV_INSN (next
) = insn
;
2876 /* PEEPHOLE might have changed this. */
2877 body
= PATTERN (insn
);
2881 /* Try to recognize the instruction.
2882 If successful, verify that the operands satisfy the
2883 constraints for the instruction. Crash if they don't,
2884 since `reload' should have changed them so that they do. */
2886 insn_code_number
= recog_memoized (insn
);
2887 cleanup_subreg_operands (insn
);
2889 /* Dump the insn in the assembly for debugging (-dAP).
2890 If the final dump is requested as slim RTL, dump slim
2891 RTL to the assembly file also. */
2892 if (flag_dump_rtl_in_asm
)
2894 print_rtx_head
= ASM_COMMENT_START
;
2895 if (! (dump_flags
& TDF_SLIM
))
2896 print_rtl_single (asm_out_file
, insn
);
2898 dump_insn_slim (asm_out_file
, insn
);
2899 print_rtx_head
= "";
2902 if (! constrain_operands_cached (1))
2903 fatal_insn_not_found (insn
);
2905 /* Some target machines need to prescan each insn before
2908 #ifdef FINAL_PRESCAN_INSN
2909 FINAL_PRESCAN_INSN (insn
, recog_data
.operand
, recog_data
.n_operands
);
2912 if (targetm
.have_conditional_execution ()
2913 && GET_CODE (PATTERN (insn
)) == COND_EXEC
)
2914 current_insn_predicate
= COND_EXEC_TEST (PATTERN (insn
));
2917 cc_prev_status
= cc_status
;
2919 /* Update `cc_status' for this instruction.
2920 The instruction's output routine may change it further.
2921 If the output routine for a jump insn needs to depend
2922 on the cc status, it should look at cc_prev_status. */
2924 NOTICE_UPDATE_CC (body
, insn
);
2927 current_output_insn
= debug_insn
= insn
;
2929 /* Find the proper template for this insn. */
2930 templ
= get_insn_template (insn_code_number
, insn
);
2932 /* If the C code returns 0, it means that it is a jump insn
2933 which follows a deleted test insn, and that test insn
2934 needs to be reinserted. */
2939 gcc_assert (prev_nonnote_insn (insn
) == last_ignored_compare
);
2941 /* We have already processed the notes between the setter and
2942 the user. Make sure we don't process them again, this is
2943 particularly important if one of the notes is a block
2944 scope note or an EH note. */
2946 prev
!= last_ignored_compare
;
2947 prev
= PREV_INSN (prev
))
2950 delete_insn (prev
); /* Use delete_note. */
2956 /* If the template is the string "#", it means that this insn must
2958 if (templ
[0] == '#' && templ
[1] == '\0')
2960 rtx new_rtx
= try_split (body
, insn
, 0);
2962 /* If we didn't split the insn, go away. */
2963 if (new_rtx
== insn
&& PATTERN (new_rtx
) == body
)
2964 fatal_insn ("could not split insn", insn
);
2966 /* If we have a length attribute, this instruction should have
2967 been split in shorten_branches, to ensure that we would have
2968 valid length info for the splitees. */
2969 gcc_assert (!HAVE_ATTR_length
);
2974 /* ??? This will put the directives in the wrong place if
2975 get_insn_template outputs assembly directly. However calling it
2976 before get_insn_template breaks if the insns is split. */
2977 if (targetm
.asm_out
.unwind_emit_before_insn
2978 && targetm
.asm_out
.unwind_emit
)
2979 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
2983 rtx x
= call_from_call_insn (insn
);
2985 if (x
&& MEM_P (x
) && GET_CODE (XEXP (x
, 0)) == SYMBOL_REF
)
2989 t
= SYMBOL_REF_DECL (x
);
2991 assemble_external (t
);
2993 if (!DECL_IGNORED_P (current_function_decl
))
2994 debug_hooks
->var_location (insn
);
2997 /* Output assembler code from the template. */
2998 output_asm_insn (templ
, recog_data
.operand
);
3000 /* Some target machines need to postscan each insn after
3002 if (targetm
.asm_out
.final_postscan_insn
)
3003 targetm
.asm_out
.final_postscan_insn (file
, insn
, recog_data
.operand
,
3004 recog_data
.n_operands
);
3006 if (!targetm
.asm_out
.unwind_emit_before_insn
3007 && targetm
.asm_out
.unwind_emit
)
3008 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
3010 current_output_insn
= debug_insn
= 0;
3013 return NEXT_INSN (insn
);
3016 /* Return discriminator of the statement that produced this insn. */
3018 insn_discriminator (const_rtx insn
)
3020 location_t loc
= INSN_LOCATION (insn
);
3023 return get_discriminator_from_locus (loc
);
3027 /* Return whether a source line note needs to be emitted before INSN.
3028 Sets IS_STMT to TRUE if the line should be marked as a possible
3029 breakpoint location. */
3032 notice_source_line (rtx insn
, bool *is_stmt
)
3034 const char *filename
;
3038 if (override_filename
)
3040 filename
= override_filename
;
3041 linenum
= override_linenum
;
3042 discriminator
= override_discriminator
;
3046 filename
= insn_file (insn
);
3047 linenum
= insn_line (insn
);
3048 discriminator
= insn_discriminator (insn
);
3051 if (filename
== NULL
)
3054 if (force_source_line
3055 || filename
!= last_filename
3056 || last_linenum
!= linenum
)
3058 force_source_line
= false;
3059 last_filename
= filename
;
3060 last_linenum
= linenum
;
3061 last_discriminator
= discriminator
;
3063 high_block_linenum
= MAX (last_linenum
, high_block_linenum
);
3064 high_function_linenum
= MAX (last_linenum
, high_function_linenum
);
3068 if (SUPPORTS_DISCRIMINATOR
&& last_discriminator
!= discriminator
)
3070 /* If the discriminator changed, but the line number did not,
3071 output the line table entry with is_stmt false so the
3072 debugger does not treat this as a breakpoint location. */
3073 last_discriminator
= discriminator
;
3081 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3082 directly to the desired hard register. */
3085 cleanup_subreg_operands (rtx insn
)
3088 bool changed
= false;
3089 extract_insn_cached (insn
);
3090 for (i
= 0; i
< recog_data
.n_operands
; i
++)
3092 /* The following test cannot use recog_data.operand when testing
3093 for a SUBREG: the underlying object might have been changed
3094 already if we are inside a match_operator expression that
3095 matches the else clause. Instead we test the underlying
3096 expression directly. */
3097 if (GET_CODE (*recog_data
.operand_loc
[i
]) == SUBREG
)
3099 recog_data
.operand
[i
] = alter_subreg (recog_data
.operand_loc
[i
], true);
3102 else if (GET_CODE (recog_data
.operand
[i
]) == PLUS
3103 || GET_CODE (recog_data
.operand
[i
]) == MULT
3104 || MEM_P (recog_data
.operand
[i
]))
3105 recog_data
.operand
[i
] = walk_alter_subreg (recog_data
.operand_loc
[i
], &changed
);
3108 for (i
= 0; i
< recog_data
.n_dups
; i
++)
3110 if (GET_CODE (*recog_data
.dup_loc
[i
]) == SUBREG
)
3112 *recog_data
.dup_loc
[i
] = alter_subreg (recog_data
.dup_loc
[i
], true);
3115 else if (GET_CODE (*recog_data
.dup_loc
[i
]) == PLUS
3116 || GET_CODE (*recog_data
.dup_loc
[i
]) == MULT
3117 || MEM_P (*recog_data
.dup_loc
[i
]))
3118 *recog_data
.dup_loc
[i
] = walk_alter_subreg (recog_data
.dup_loc
[i
], &changed
);
3121 df_insn_rescan (insn
);
3124 /* If X is a SUBREG, try to replace it with a REG or a MEM, based on
3125 the thing it is a subreg of. Do it anyway if FINAL_P. */
3128 alter_subreg (rtx
*xp
, bool final_p
)
3131 rtx y
= SUBREG_REG (x
);
3133 /* simplify_subreg does not remove subreg from volatile references.
3134 We are required to. */
3137 int offset
= SUBREG_BYTE (x
);
3139 /* For paradoxical subregs on big-endian machines, SUBREG_BYTE
3140 contains 0 instead of the proper offset. See simplify_subreg. */
3142 && GET_MODE_SIZE (GET_MODE (y
)) < GET_MODE_SIZE (GET_MODE (x
)))
3144 int difference
= GET_MODE_SIZE (GET_MODE (y
))
3145 - GET_MODE_SIZE (GET_MODE (x
));
3146 if (WORDS_BIG_ENDIAN
)
3147 offset
+= (difference
/ UNITS_PER_WORD
) * UNITS_PER_WORD
;
3148 if (BYTES_BIG_ENDIAN
)
3149 offset
+= difference
% UNITS_PER_WORD
;
3153 *xp
= adjust_address (y
, GET_MODE (x
), offset
);
3155 *xp
= adjust_address_nv (y
, GET_MODE (x
), offset
);
3159 rtx new_rtx
= simplify_subreg (GET_MODE (x
), y
, GET_MODE (y
),
3164 else if (final_p
&& REG_P (y
))
3166 /* Simplify_subreg can't handle some REG cases, but we have to. */
3168 HOST_WIDE_INT offset
;
3170 regno
= subreg_regno (x
);
3171 if (subreg_lowpart_p (x
))
3172 offset
= byte_lowpart_offset (GET_MODE (x
), GET_MODE (y
));
3174 offset
= SUBREG_BYTE (x
);
3175 *xp
= gen_rtx_REG_offset (y
, GET_MODE (x
), regno
, offset
);
3182 /* Do alter_subreg on all the SUBREGs contained in X. */
3185 walk_alter_subreg (rtx
*xp
, bool *changed
)
3188 switch (GET_CODE (x
))
3193 XEXP (x
, 0) = walk_alter_subreg (&XEXP (x
, 0), changed
);
3194 XEXP (x
, 1) = walk_alter_subreg (&XEXP (x
, 1), changed
);
3199 XEXP (x
, 0) = walk_alter_subreg (&XEXP (x
, 0), changed
);
3204 return alter_subreg (xp
, true);
3215 /* Given BODY, the body of a jump instruction, alter the jump condition
3216 as required by the bits that are set in cc_status.flags.
3217 Not all of the bits there can be handled at this level in all cases.
3219 The value is normally 0.
3220 1 means that the condition has become always true.
3221 -1 means that the condition has become always false.
3222 2 means that COND has been altered. */
3225 alter_cond (rtx cond
)
3229 if (cc_status
.flags
& CC_REVERSED
)
3232 PUT_CODE (cond
, swap_condition (GET_CODE (cond
)));
3235 if (cc_status
.flags
& CC_INVERTED
)
3238 PUT_CODE (cond
, reverse_condition (GET_CODE (cond
)));
3241 if (cc_status
.flags
& CC_NOT_POSITIVE
)
3242 switch (GET_CODE (cond
))
3247 /* Jump becomes unconditional. */
3253 /* Jump becomes no-op. */
3257 PUT_CODE (cond
, EQ
);
3262 PUT_CODE (cond
, NE
);
3270 if (cc_status
.flags
& CC_NOT_NEGATIVE
)
3271 switch (GET_CODE (cond
))
3275 /* Jump becomes unconditional. */
3280 /* Jump becomes no-op. */
3285 PUT_CODE (cond
, EQ
);
3291 PUT_CODE (cond
, NE
);
3299 if (cc_status
.flags
& CC_NO_OVERFLOW
)
3300 switch (GET_CODE (cond
))
3303 /* Jump becomes unconditional. */
3307 PUT_CODE (cond
, EQ
);
3312 PUT_CODE (cond
, NE
);
3317 /* Jump becomes no-op. */
3324 if (cc_status
.flags
& (CC_Z_IN_NOT_N
| CC_Z_IN_N
))
3325 switch (GET_CODE (cond
))
3331 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? GE
: LT
);
3336 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? LT
: GE
);
3341 if (cc_status
.flags
& CC_NOT_SIGNED
)
3342 /* The flags are valid if signed condition operators are converted
3344 switch (GET_CODE (cond
))
3347 PUT_CODE (cond
, LEU
);
3352 PUT_CODE (cond
, LTU
);
3357 PUT_CODE (cond
, GTU
);
3362 PUT_CODE (cond
, GEU
);
3374 /* Report inconsistency between the assembler template and the operands.
3375 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3378 output_operand_lossage (const char *cmsgid
, ...)
3382 const char *pfx_str
;
3385 va_start (ap
, cmsgid
);
3387 pfx_str
= this_is_asm_operands
? _("invalid 'asm': ") : "output_operand: ";
3388 asprintf (&fmt_string
, "%s%s", pfx_str
, _(cmsgid
));
3389 vasprintf (&new_message
, fmt_string
, ap
);
3391 if (this_is_asm_operands
)
3392 error_for_asm (this_is_asm_operands
, "%s", new_message
);
3394 internal_error ("%s", new_message
);
3401 /* Output of assembler code from a template, and its subroutines. */
3403 /* Annotate the assembly with a comment describing the pattern and
3404 alternative used. */
3407 output_asm_name (void)
3411 int num
= INSN_CODE (debug_insn
);
3412 fprintf (asm_out_file
, "\t%s %d\t%s",
3413 ASM_COMMENT_START
, INSN_UID (debug_insn
),
3414 insn_data
[num
].name
);
3415 if (insn_data
[num
].n_alternatives
> 1)
3416 fprintf (asm_out_file
, "/%d", which_alternative
+ 1);
3418 if (HAVE_ATTR_length
)
3419 fprintf (asm_out_file
, "\t[length = %d]",
3420 get_attr_length (debug_insn
));
3422 /* Clear this so only the first assembler insn
3423 of any rtl insn will get the special comment for -dp. */
3428 /* If OP is a REG or MEM and we can find a MEM_EXPR corresponding to it
3429 or its address, return that expr . Set *PADDRESSP to 1 if the expr
3430 corresponds to the address of the object and 0 if to the object. */
3433 get_mem_expr_from_op (rtx op
, int *paddressp
)
3441 return REG_EXPR (op
);
3442 else if (!MEM_P (op
))
3445 if (MEM_EXPR (op
) != 0)
3446 return MEM_EXPR (op
);
3448 /* Otherwise we have an address, so indicate it and look at the address. */
3452 /* First check if we have a decl for the address, then look at the right side
3453 if it is a PLUS. Otherwise, strip off arithmetic and keep looking.
3454 But don't allow the address to itself be indirect. */
3455 if ((expr
= get_mem_expr_from_op (op
, &inner_addressp
)) && ! inner_addressp
)
3457 else if (GET_CODE (op
) == PLUS
3458 && (expr
= get_mem_expr_from_op (XEXP (op
, 1), &inner_addressp
)))
3462 || GET_RTX_CLASS (GET_CODE (op
)) == RTX_BIN_ARITH
)
3465 expr
= get_mem_expr_from_op (op
, &inner_addressp
);
3466 return inner_addressp
? 0 : expr
;
3469 /* Output operand names for assembler instructions. OPERANDS is the
3470 operand vector, OPORDER is the order to write the operands, and NOPS
3471 is the number of operands to write. */
3474 output_asm_operand_names (rtx
*operands
, int *oporder
, int nops
)
3479 for (i
= 0; i
< nops
; i
++)
3482 rtx op
= operands
[oporder
[i
]];
3483 tree expr
= get_mem_expr_from_op (op
, &addressp
);
3485 fprintf (asm_out_file
, "%c%s",
3486 wrote
? ',' : '\t', wrote
? "" : ASM_COMMENT_START
);
3490 fprintf (asm_out_file
, "%s",
3491 addressp
? "*" : "");
3492 print_mem_expr (asm_out_file
, expr
);
3495 else if (REG_P (op
) && ORIGINAL_REGNO (op
)
3496 && ORIGINAL_REGNO (op
) != REGNO (op
))
3497 fprintf (asm_out_file
, " tmp%i", ORIGINAL_REGNO (op
));
3501 #ifdef ASSEMBLER_DIALECT
3502 /* Helper function to parse assembler dialects in the asm string.
3503 This is called from output_asm_insn and asm_fprintf. */
3505 do_assembler_dialects (const char *p
, int *dialect
)
3516 output_operand_lossage ("nested assembly dialect alternatives");
3520 /* If we want the first dialect, do nothing. Otherwise, skip
3521 DIALECT_NUMBER of strings ending with '|'. */
3522 for (i
= 0; i
< dialect_number
; i
++)
3524 while (*p
&& *p
!= '}')
3532 /* Skip over any character after a percent sign. */
3544 output_operand_lossage ("unterminated assembly dialect alternative");
3551 /* Skip to close brace. */
3556 output_operand_lossage ("unterminated assembly dialect alternative");
3560 /* Skip over any character after a percent sign. */
3561 if (*p
== '%' && p
[1])
3575 putc (c
, asm_out_file
);
3580 putc (c
, asm_out_file
);
3591 /* Output text from TEMPLATE to the assembler output file,
3592 obeying %-directions to substitute operands taken from
3593 the vector OPERANDS.
3595 %N (for N a digit) means print operand N in usual manner.
3596 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3597 and print the label name with no punctuation.
3598 %cN means require operand N to be a constant
3599 and print the constant expression with no punctuation.
3600 %aN means expect operand N to be a memory address
3601 (not a memory reference!) and print a reference
3603 %nN means expect operand N to be a constant
3604 and print a constant expression for minus the value
3605 of the operand, with no other punctuation. */
3608 output_asm_insn (const char *templ
, rtx
*operands
)
3612 #ifdef ASSEMBLER_DIALECT
3615 int oporder
[MAX_RECOG_OPERANDS
];
3616 char opoutput
[MAX_RECOG_OPERANDS
];
3619 /* An insn may return a null string template
3620 in a case where no assembler code is needed. */
3624 memset (opoutput
, 0, sizeof opoutput
);
3626 putc ('\t', asm_out_file
);
3628 #ifdef ASM_OUTPUT_OPCODE
3629 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3636 if (flag_verbose_asm
)
3637 output_asm_operand_names (operands
, oporder
, ops
);
3638 if (flag_print_asm_name
)
3642 memset (opoutput
, 0, sizeof opoutput
);
3644 putc (c
, asm_out_file
);
3645 #ifdef ASM_OUTPUT_OPCODE
3646 while ((c
= *p
) == '\t')
3648 putc (c
, asm_out_file
);
3651 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3655 #ifdef ASSEMBLER_DIALECT
3659 p
= do_assembler_dialects (p
, &dialect
);
3664 /* %% outputs a single %. %{, %} and %| print {, } and | respectively
3665 if ASSEMBLER_DIALECT defined and these characters have a special
3666 meaning as dialect delimiters.*/
3668 #ifdef ASSEMBLER_DIALECT
3669 || *p
== '{' || *p
== '}' || *p
== '|'
3673 putc (*p
, asm_out_file
);
3676 /* %= outputs a number which is unique to each insn in the entire
3677 compilation. This is useful for making local labels that are
3678 referred to more than once in a given insn. */
3682 fprintf (asm_out_file
, "%d", insn_counter
);
3684 /* % followed by a letter and some digits
3685 outputs an operand in a special way depending on the letter.
3686 Letters `acln' are implemented directly.
3687 Other letters are passed to `output_operand' so that
3688 the TARGET_PRINT_OPERAND hook can define them. */
3689 else if (ISALPHA (*p
))
3692 unsigned long opnum
;
3695 opnum
= strtoul (p
, &endptr
, 10);
3698 output_operand_lossage ("operand number missing "
3700 else if (this_is_asm_operands
&& opnum
>= insn_noperands
)
3701 output_operand_lossage ("operand number out of range");
3702 else if (letter
== 'l')
3703 output_asm_label (operands
[opnum
]);
3704 else if (letter
== 'a')
3705 output_address (operands
[opnum
]);
3706 else if (letter
== 'c')
3708 if (CONSTANT_ADDRESS_P (operands
[opnum
]))
3709 output_addr_const (asm_out_file
, operands
[opnum
]);
3711 output_operand (operands
[opnum
], 'c');
3713 else if (letter
== 'n')
3715 if (CONST_INT_P (operands
[opnum
]))
3716 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
,
3717 - INTVAL (operands
[opnum
]));
3720 putc ('-', asm_out_file
);
3721 output_addr_const (asm_out_file
, operands
[opnum
]);
3725 output_operand (operands
[opnum
], letter
);
3727 if (!opoutput
[opnum
])
3728 oporder
[ops
++] = opnum
;
3729 opoutput
[opnum
] = 1;
3734 /* % followed by a digit outputs an operand the default way. */
3735 else if (ISDIGIT (*p
))
3737 unsigned long opnum
;
3740 opnum
= strtoul (p
, &endptr
, 10);
3741 if (this_is_asm_operands
&& opnum
>= insn_noperands
)
3742 output_operand_lossage ("operand number out of range");
3744 output_operand (operands
[opnum
], 0);
3746 if (!opoutput
[opnum
])
3747 oporder
[ops
++] = opnum
;
3748 opoutput
[opnum
] = 1;
3753 /* % followed by punctuation: output something for that
3754 punctuation character alone, with no operand. The
3755 TARGET_PRINT_OPERAND hook decides what is actually done. */
3756 else if (targetm
.asm_out
.print_operand_punct_valid_p ((unsigned char) *p
))
3757 output_operand (NULL_RTX
, *p
++);
3759 output_operand_lossage ("invalid %%-code");
3763 putc (c
, asm_out_file
);
3766 /* Write out the variable names for operands, if we know them. */
3767 if (flag_verbose_asm
)
3768 output_asm_operand_names (operands
, oporder
, ops
);
3769 if (flag_print_asm_name
)
3772 putc ('\n', asm_out_file
);
3775 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3778 output_asm_label (rtx x
)
3782 if (GET_CODE (x
) == LABEL_REF
)
3786 && NOTE_KIND (x
) == NOTE_INSN_DELETED_LABEL
))
3787 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3789 output_operand_lossage ("'%%l' operand isn't a label");
3791 assemble_name (asm_out_file
, buf
);
3794 /* Helper rtx-iteration-function for mark_symbol_refs_as_used and
3795 output_operand. Marks SYMBOL_REFs as referenced through use of
3796 assemble_external. */
3799 mark_symbol_ref_as_used (rtx
*xp
, void *dummy ATTRIBUTE_UNUSED
)
3803 /* If we have a used symbol, we may have to emit assembly
3804 annotations corresponding to whether the symbol is external, weak
3805 or has non-default visibility. */
3806 if (GET_CODE (x
) == SYMBOL_REF
)
3810 t
= SYMBOL_REF_DECL (x
);
3812 assemble_external (t
);
3820 /* Marks SYMBOL_REFs in x as referenced through use of assemble_external. */
3823 mark_symbol_refs_as_used (rtx x
)
3825 for_each_rtx (&x
, mark_symbol_ref_as_used
, NULL
);
3828 /* Print operand X using machine-dependent assembler syntax.
3829 CODE is a non-digit that preceded the operand-number in the % spec,
3830 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3831 between the % and the digits.
3832 When CODE is a non-letter, X is 0.
3834 The meanings of the letters are machine-dependent and controlled
3835 by TARGET_PRINT_OPERAND. */
3838 output_operand (rtx x
, int code ATTRIBUTE_UNUSED
)
3840 if (x
&& GET_CODE (x
) == SUBREG
)
3841 x
= alter_subreg (&x
, true);
3843 /* X must not be a pseudo reg. */
3844 gcc_assert (!x
|| !REG_P (x
) || REGNO (x
) < FIRST_PSEUDO_REGISTER
);
3846 targetm
.asm_out
.print_operand (asm_out_file
, x
, code
);
3851 for_each_rtx (&x
, mark_symbol_ref_as_used
, NULL
);
3854 /* Print a memory reference operand for address X using
3855 machine-dependent assembler syntax. */
3858 output_address (rtx x
)
3860 bool changed
= false;
3861 walk_alter_subreg (&x
, &changed
);
3862 targetm
.asm_out
.print_operand_address (asm_out_file
, x
);
3865 /* Print an integer constant expression in assembler syntax.
3866 Addition and subtraction are the only arithmetic
3867 that may appear in these expressions. */
3870 output_addr_const (FILE *file
, rtx x
)
3875 switch (GET_CODE (x
))
3882 if (SYMBOL_REF_DECL (x
))
3883 assemble_external (SYMBOL_REF_DECL (x
));
3884 #ifdef ASM_OUTPUT_SYMBOL_REF
3885 ASM_OUTPUT_SYMBOL_REF (file
, x
);
3887 assemble_name (file
, XSTR (x
, 0));
3895 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3896 #ifdef ASM_OUTPUT_LABEL_REF
3897 ASM_OUTPUT_LABEL_REF (file
, buf
);
3899 assemble_name (file
, buf
);
3904 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, INTVAL (x
));
3908 /* This used to output parentheses around the expression,
3909 but that does not work on the 386 (either ATT or BSD assembler). */
3910 output_addr_const (file
, XEXP (x
, 0));
3914 if (GET_MODE (x
) == VOIDmode
)
3916 /* We can use %d if the number is one word and positive. */
3917 if (CONST_DOUBLE_HIGH (x
))
3918 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
3919 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_HIGH (x
),
3920 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_LOW (x
));
3921 else if (CONST_DOUBLE_LOW (x
) < 0)
3922 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
,
3923 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_LOW (x
));
3925 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_DOUBLE_LOW (x
));
3928 /* We can't handle floating point constants;
3929 PRINT_OPERAND must handle them. */
3930 output_operand_lossage ("floating constant misused");
3934 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_FIXED_VALUE_LOW (x
));
3938 /* Some assemblers need integer constants to appear last (eg masm). */
3939 if (CONST_INT_P (XEXP (x
, 0)))
3941 output_addr_const (file
, XEXP (x
, 1));
3942 if (INTVAL (XEXP (x
, 0)) >= 0)
3943 fprintf (file
, "+");
3944 output_addr_const (file
, XEXP (x
, 0));
3948 output_addr_const (file
, XEXP (x
, 0));
3949 if (!CONST_INT_P (XEXP (x
, 1))
3950 || INTVAL (XEXP (x
, 1)) >= 0)
3951 fprintf (file
, "+");
3952 output_addr_const (file
, XEXP (x
, 1));
3957 /* Avoid outputting things like x-x or x+5-x,
3958 since some assemblers can't handle that. */
3959 x
= simplify_subtraction (x
);
3960 if (GET_CODE (x
) != MINUS
)
3963 output_addr_const (file
, XEXP (x
, 0));
3964 fprintf (file
, "-");
3965 if ((CONST_INT_P (XEXP (x
, 1)) && INTVAL (XEXP (x
, 1)) >= 0)
3966 || GET_CODE (XEXP (x
, 1)) == PC
3967 || GET_CODE (XEXP (x
, 1)) == SYMBOL_REF
)
3968 output_addr_const (file
, XEXP (x
, 1));
3971 fputs (targetm
.asm_out
.open_paren
, file
);
3972 output_addr_const (file
, XEXP (x
, 1));
3973 fputs (targetm
.asm_out
.close_paren
, file
);
3981 output_addr_const (file
, XEXP (x
, 0));
3985 if (targetm
.asm_out
.output_addr_const_extra (file
, x
))
3988 output_operand_lossage ("invalid expression as operand");
3992 /* Output a quoted string. */
3995 output_quoted_string (FILE *asm_file
, const char *string
)
3997 #ifdef OUTPUT_QUOTED_STRING
3998 OUTPUT_QUOTED_STRING (asm_file
, string
);
4002 putc ('\"', asm_file
);
4003 while ((c
= *string
++) != 0)
4007 if (c
== '\"' || c
== '\\')
4008 putc ('\\', asm_file
);
4012 fprintf (asm_file
, "\\%03o", (unsigned char) c
);
4014 putc ('\"', asm_file
);
4018 /* Write a HOST_WIDE_INT number in hex form 0x1234, fast. */
4021 fprint_whex (FILE *f
, unsigned HOST_WIDE_INT value
)
4023 char buf
[2 + CHAR_BIT
* sizeof (value
) / 4];
4028 char *p
= buf
+ sizeof (buf
);
4030 *--p
= "0123456789abcdef"[value
% 16];
4031 while ((value
/= 16) != 0);
4034 fwrite (p
, 1, buf
+ sizeof (buf
) - p
, f
);
4038 /* Internal function that prints an unsigned long in decimal in reverse.
4039 The output string IS NOT null-terminated. */
4042 sprint_ul_rev (char *s
, unsigned long value
)
4047 s
[i
] = "0123456789"[value
% 10];
4050 /* alternate version, without modulo */
4051 /* oldval = value; */
4053 /* s[i] = "0123456789" [oldval - 10*value]; */
4060 /* Write an unsigned long as decimal to a file, fast. */
4063 fprint_ul (FILE *f
, unsigned long value
)
4065 /* python says: len(str(2**64)) == 20 */
4069 i
= sprint_ul_rev (s
, value
);
4071 /* It's probably too small to bother with string reversal and fputs. */
4080 /* Write an unsigned long as decimal to a string, fast.
4081 s must be wide enough to not overflow, at least 21 chars.
4082 Returns the length of the string (without terminating '\0'). */
4085 sprint_ul (char *s
, unsigned long value
)
4092 len
= sprint_ul_rev (s
, value
);
4095 /* Reverse the string. */
4109 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
4110 %R prints the value of REGISTER_PREFIX.
4111 %L prints the value of LOCAL_LABEL_PREFIX.
4112 %U prints the value of USER_LABEL_PREFIX.
4113 %I prints the value of IMMEDIATE_PREFIX.
4114 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
4115 Also supported are %d, %i, %u, %x, %X, %o, %c, %s and %%.
4117 We handle alternate assembler dialects here, just like output_asm_insn. */
4120 asm_fprintf (FILE *file
, const char *p
, ...)
4124 #ifdef ASSEMBLER_DIALECT
4129 va_start (argptr
, p
);
4136 #ifdef ASSEMBLER_DIALECT
4140 p
= do_assembler_dialects (p
, &dialect
);
4147 while (strchr ("-+ #0", c
))
4152 while (ISDIGIT (c
) || c
== '.')
4163 case 'd': case 'i': case 'u':
4164 case 'x': case 'X': case 'o':
4168 fprintf (file
, buf
, va_arg (argptr
, int));
4172 /* This is a prefix to the 'd', 'i', 'u', 'x', 'X', and
4173 'o' cases, but we do not check for those cases. It
4174 means that the value is a HOST_WIDE_INT, which may be
4175 either `long' or `long long'. */
4176 memcpy (q
, HOST_WIDE_INT_PRINT
, strlen (HOST_WIDE_INT_PRINT
));
4177 q
+= strlen (HOST_WIDE_INT_PRINT
);
4180 fprintf (file
, buf
, va_arg (argptr
, HOST_WIDE_INT
));
4185 #ifdef HAVE_LONG_LONG
4191 fprintf (file
, buf
, va_arg (argptr
, long long));
4198 fprintf (file
, buf
, va_arg (argptr
, long));
4206 fprintf (file
, buf
, va_arg (argptr
, char *));
4210 #ifdef ASM_OUTPUT_OPCODE
4211 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
4216 #ifdef REGISTER_PREFIX
4217 fprintf (file
, "%s", REGISTER_PREFIX
);
4222 #ifdef IMMEDIATE_PREFIX
4223 fprintf (file
, "%s", IMMEDIATE_PREFIX
);
4228 #ifdef LOCAL_LABEL_PREFIX
4229 fprintf (file
, "%s", LOCAL_LABEL_PREFIX
);
4234 fputs (user_label_prefix
, file
);
4237 #ifdef ASM_FPRINTF_EXTENSIONS
4238 /* Uppercase letters are reserved for general use by asm_fprintf
4239 and so are not available to target specific code. In order to
4240 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
4241 they are defined here. As they get turned into real extensions
4242 to asm_fprintf they should be removed from this list. */
4243 case 'A': case 'B': case 'C': case 'D': case 'E':
4244 case 'F': case 'G': case 'H': case 'J': case 'K':
4245 case 'M': case 'N': case 'P': case 'Q': case 'S':
4246 case 'T': case 'V': case 'W': case 'Y': case 'Z':
4249 ASM_FPRINTF_EXTENSIONS (file
, argptr
, p
)
4262 /* Return nonzero if this function has no function calls. */
4265 leaf_function_p (void)
4269 if (crtl
->profile
|| profile_arc_flag
)
4272 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4275 && ! SIBLING_CALL_P (insn
))
4277 if (NONJUMP_INSN_P (insn
)
4278 && GET_CODE (PATTERN (insn
)) == SEQUENCE
4279 && CALL_P (XVECEXP (PATTERN (insn
), 0, 0))
4280 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn
), 0, 0)))
4287 /* Return 1 if branch is a forward branch.
4288 Uses insn_shuid array, so it works only in the final pass. May be used by
4289 output templates to customary add branch prediction hints.
4292 final_forward_branch_p (rtx insn
)
4294 int insn_id
, label_id
;
4296 gcc_assert (uid_shuid
);
4297 insn_id
= INSN_SHUID (insn
);
4298 label_id
= INSN_SHUID (JUMP_LABEL (insn
));
4299 /* We've hit some insns that does not have id information available. */
4300 gcc_assert (insn_id
&& label_id
);
4301 return insn_id
< label_id
;
4304 /* On some machines, a function with no call insns
4305 can run faster if it doesn't create its own register window.
4306 When output, the leaf function should use only the "output"
4307 registers. Ordinarily, the function would be compiled to use
4308 the "input" registers to find its arguments; it is a candidate
4309 for leaf treatment if it uses only the "input" registers.
4310 Leaf function treatment means renumbering so the function
4311 uses the "output" registers instead. */
4313 #ifdef LEAF_REGISTERS
4315 /* Return 1 if this function uses only the registers that can be
4316 safely renumbered. */
4319 only_leaf_regs_used (void)
4322 const char *const permitted_reg_in_leaf_functions
= LEAF_REGISTERS
;
4324 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4325 if ((df_regs_ever_live_p (i
) || global_regs
[i
])
4326 && ! permitted_reg_in_leaf_functions
[i
])
4329 if (crtl
->uses_pic_offset_table
4330 && pic_offset_table_rtx
!= 0
4331 && REG_P (pic_offset_table_rtx
)
4332 && ! permitted_reg_in_leaf_functions
[REGNO (pic_offset_table_rtx
)])
4338 /* Scan all instructions and renumber all registers into those
4339 available in leaf functions. */
4342 leaf_renumber_regs (rtx first
)
4346 /* Renumber only the actual patterns.
4347 The reg-notes can contain frame pointer refs,
4348 and renumbering them could crash, and should not be needed. */
4349 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
4351 leaf_renumber_regs_insn (PATTERN (insn
));
4354 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4355 available in leaf functions. */
4358 leaf_renumber_regs_insn (rtx in_rtx
)
4361 const char *format_ptr
;
4366 /* Renumber all input-registers into output-registers.
4367 renumbered_regs would be 1 for an output-register;
4374 /* Don't renumber the same reg twice. */
4378 newreg
= REGNO (in_rtx
);
4379 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4380 to reach here as part of a REG_NOTE. */
4381 if (newreg
>= FIRST_PSEUDO_REGISTER
)
4386 newreg
= LEAF_REG_REMAP (newreg
);
4387 gcc_assert (newreg
>= 0);
4388 df_set_regs_ever_live (REGNO (in_rtx
), false);
4389 df_set_regs_ever_live (newreg
, true);
4390 SET_REGNO (in_rtx
, newreg
);
4394 if (INSN_P (in_rtx
))
4396 /* Inside a SEQUENCE, we find insns.
4397 Renumber just the patterns of these insns,
4398 just as we do for the top-level insns. */
4399 leaf_renumber_regs_insn (PATTERN (in_rtx
));
4403 format_ptr
= GET_RTX_FORMAT (GET_CODE (in_rtx
));
4405 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (in_rtx
)); i
++)
4406 switch (*format_ptr
++)
4409 leaf_renumber_regs_insn (XEXP (in_rtx
, i
));
4413 if (NULL
!= XVEC (in_rtx
, i
))
4415 for (j
= 0; j
< XVECLEN (in_rtx
, i
); j
++)
4416 leaf_renumber_regs_insn (XVECEXP (in_rtx
, i
, j
));
4435 /* List the call graph profiled edges whise value is greater than
4436 PARAM_NOTE_CGRAPH_SECTION_EDGE_THRESHOLD in the
4437 "gnu.callgraph.text" section. */
4439 dump_cgraph_profiles (void)
4441 struct cgraph_node
*node
= cgraph_get_node (current_function_decl
);
4442 struct cgraph_edge
*e
;
4443 struct cgraph_node
*callee
;
4445 for (e
= node
->callees
; e
!= NULL
; e
= e
->next_callee
)
4447 if (e
->count
<= PARAM_VALUE (PARAM_GNU_CGRAPH_SECTION_EDGE_THRESHOLD
))
4450 fprintf (asm_out_file
, "\t.string \"%s\"\n",
4451 IDENTIFIER_POINTER (decl_assembler_name (callee
->decl
)));
4452 fprintf (asm_out_file
, "\t.string \"" HOST_WIDEST_INT_PRINT_DEC
"\"\n",
4457 /* Iterate through the basic blocks in DECL and get the max count.
4458 If COLD is true, find the max count of the cold part of the split. */
4460 get_max_count (tree decl
, bool cold
)
4463 gcov_type max_count
= cold
? 0 :(cgraph_get_node (decl
))->count
;
4465 FOR_EACH_BB_FN (bb
, cfun
)
4467 if (cold
&& BB_PARTITION (bb
) != BB_COLD_PARTITION
)
4469 if (bb
->count
> max_count
)
4470 max_count
= bb
->count
;
4475 /* Turn the RTL into assembly. */
4477 rest_of_handle_final (void)
4481 char *profile_fnname
;
4484 /* Get the function's name, as described by its RTL. This may be
4485 different from the DECL_NAME name used in the source file. */
4487 x
= DECL_RTL (current_function_decl
);
4488 gcc_assert (MEM_P (x
));
4490 gcc_assert (GET_CODE (x
) == SYMBOL_REF
);
4491 fnname
= XSTR (x
, 0);
4493 has_cold_section_p
= false;
4495 /* If debugging, assign block numbers to all of the blocks in this
4499 reemit_insn_block_notes ();
4500 number_blocks (current_function_decl
);
4501 /* We never actually put out begin/end notes for the top-level
4502 block in the function. But, conceptually, that block is
4504 TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl
)) = 1;
4507 assemble_start_function (current_function_decl
, fnname
);
4508 final_start_function (get_insns (), asm_out_file
, optimize
);
4509 final (get_insns (), asm_out_file
, optimize
);
4510 final_end_function ();
4512 /* The IA-64 ".handlerdata" directive must be issued before the ".endp"
4513 directive that closes the procedure descriptor. Similarly, for x64 SEH.
4514 Otherwise it's not strictly necessary, but it doesn't hurt either. */
4515 output_function_exception_table (fnname
);
4517 assemble_end_function (current_function_decl
, fnname
);
4519 /* Free up reg info memory. */
4523 fflush (asm_out_file
);
4525 /* Write DBX symbols if requested. */
4527 /* Note that for those inline functions where we don't initially
4528 know for certain that we will be generating an out-of-line copy,
4529 the first invocation of this routine (rest_of_compilation) will
4530 skip over this code by doing a `goto exit_rest_of_compilation;'.
4531 Later on, wrapup_global_declarations will (indirectly) call
4532 rest_of_compilation again for those inline functions that need
4533 to have out-of-line copies generated. During that call, we
4534 *will* be routed past here. */
4536 timevar_push (TV_SYMOUT
);
4537 if (!DECL_IGNORED_P (current_function_decl
))
4538 debug_hooks
->function_decl (current_function_decl
);
4539 timevar_pop (TV_SYMOUT
);
4541 /* Release the blocks that are linked to DECL_INITIAL() to free the memory. */
4542 DECL_INITIAL (current_function_decl
) = error_mark_node
;
4544 if (DECL_STATIC_CONSTRUCTOR (current_function_decl
)
4545 && targetm
.have_ctors_dtors
)
4546 targetm
.asm_out
.constructor (XEXP (DECL_RTL (current_function_decl
), 0),
4547 decl_init_priority_lookup
4548 (current_function_decl
));
4549 if (DECL_STATIC_DESTRUCTOR (current_function_decl
)
4550 && targetm
.have_ctors_dtors
)
4551 targetm
.asm_out
.destructor (XEXP (DECL_RTL (current_function_decl
), 0),
4552 decl_fini_priority_lookup
4553 (current_function_decl
));
4555 /* With -fcallgraph-profiles-sections and -freorder-functions=,
4556 add ".gnu.callgraph.text" section for storing profiling information. */
4557 if ((flag_reorder_functions
> 1)
4558 && (flag_profile_use
|| flag_auto_profile
)
4559 && cgraph_get_node (current_function_decl
) != NULL
4560 && ((cgraph_get_node (current_function_decl
))->callees
!= NULL
4561 || (cgraph_get_node (current_function_decl
))->count
> 0))
4563 flags
= SECTION_DEBUG
| SECTION_EXCLUDE
;
4564 asprintf (&profile_fnname
, ".gnu.callgraph.text.%s", fnname
);
4565 switch_to_section (get_section (profile_fnname
, flags
, NULL
));
4566 fprintf (asm_out_file
, "\t.string \"Function %s\"\n", fnname
);
4567 fprintf (asm_out_file
, "\t.string \"Weight "
4568 HOST_WIDEST_INT_PRINT_DEC
4570 HOST_WIDEST_INT_PRINT_DEC
4572 (cgraph_get_node (current_function_decl
))->count
,
4573 get_max_count (current_function_decl
, false));
4574 /* If this function is split into a cold section, record that weight
4576 if (has_cold_section_p
)
4577 fprintf (asm_out_file
, "\t.string \"ColdWeight "
4578 HOST_WIDEST_INT_PRINT_DEC
4580 get_max_count (current_function_decl
, true));
4581 dump_cgraph_profiles ();
4582 free (profile_fnname
);
4589 const pass_data pass_data_final
=
4591 RTL_PASS
, /* type */
4593 OPTGROUP_NONE
, /* optinfo_flags */
4594 false, /* has_gate */
4595 true, /* has_execute */
4596 TV_FINAL
, /* tv_id */
4597 0, /* properties_required */
4598 0, /* properties_provided */
4599 0, /* properties_destroyed */
4600 0, /* todo_flags_start */
4601 0, /* todo_flags_finish */
4604 class pass_final
: public rtl_opt_pass
4607 pass_final (gcc::context
*ctxt
)
4608 : rtl_opt_pass (pass_data_final
, ctxt
)
4611 /* opt_pass methods: */
4612 unsigned int execute () { return rest_of_handle_final (); }
4614 }; // class pass_final
4619 make_pass_final (gcc::context
*ctxt
)
4621 return new pass_final (ctxt
);
4626 rest_of_handle_shorten_branches (void)
4628 /* Shorten branches. */
4629 shorten_branches (get_insns ());
4635 const pass_data pass_data_shorten_branches
=
4637 RTL_PASS
, /* type */
4638 "shorten", /* name */
4639 OPTGROUP_NONE
, /* optinfo_flags */
4640 false, /* has_gate */
4641 true, /* has_execute */
4642 TV_SHORTEN_BRANCH
, /* tv_id */
4643 0, /* properties_required */
4644 0, /* properties_provided */
4645 0, /* properties_destroyed */
4646 0, /* todo_flags_start */
4647 0, /* todo_flags_finish */
4650 class pass_shorten_branches
: public rtl_opt_pass
4653 pass_shorten_branches (gcc::context
*ctxt
)
4654 : rtl_opt_pass (pass_data_shorten_branches
, ctxt
)
4657 /* opt_pass methods: */
4658 unsigned int execute () { return rest_of_handle_shorten_branches (); }
4660 }; // class pass_shorten_branches
4665 make_pass_shorten_branches (gcc::context
*ctxt
)
4667 return new pass_shorten_branches (ctxt
);
4672 rest_of_clean_state (void)
4675 FILE *final_output
= NULL
;
4676 int save_unnumbered
= flag_dump_unnumbered
;
4677 int save_noaddr
= flag_dump_noaddr
;
4679 if (flag_dump_final_insns
)
4681 final_output
= fopen (flag_dump_final_insns
, "a");
4684 error ("could not open final insn dump file %qs: %m",
4685 flag_dump_final_insns
);
4686 flag_dump_final_insns
= NULL
;
4690 flag_dump_noaddr
= flag_dump_unnumbered
= 1;
4691 if (flag_compare_debug_opt
|| flag_compare_debug
)
4692 dump_flags
|= TDF_NOUID
;
4693 dump_function_header (final_output
, current_function_decl
,
4695 final_insns_dump_p
= true;
4697 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4699 INSN_UID (insn
) = CODE_LABEL_NUMBER (insn
);
4703 set_block_for_insn (insn
, NULL
);
4704 INSN_UID (insn
) = 0;
4709 /* It is very important to decompose the RTL instruction chain here:
4710 debug information keeps pointing into CODE_LABEL insns inside the function
4711 body. If these remain pointing to the other insns, we end up preserving
4712 whole RTL chain and attached detailed debug info in memory. */
4713 for (insn
= get_insns (); insn
; insn
= next
)
4715 next
= NEXT_INSN (insn
);
4716 NEXT_INSN (insn
) = NULL
;
4717 PREV_INSN (insn
) = NULL
;
4720 && (!NOTE_P (insn
) ||
4721 (NOTE_KIND (insn
) != NOTE_INSN_VAR_LOCATION
4722 && NOTE_KIND (insn
) != NOTE_INSN_CALL_ARG_LOCATION
4723 && NOTE_KIND (insn
) != NOTE_INSN_BLOCK_BEG
4724 && NOTE_KIND (insn
) != NOTE_INSN_BLOCK_END
4725 && NOTE_KIND (insn
) != NOTE_INSN_DELETED_DEBUG_LABEL
)))
4726 print_rtl_single (final_output
, insn
);
4731 flag_dump_noaddr
= save_noaddr
;
4732 flag_dump_unnumbered
= save_unnumbered
;
4733 final_insns_dump_p
= false;
4735 if (fclose (final_output
))
4737 error ("could not close final insn dump file %qs: %m",
4738 flag_dump_final_insns
);
4739 flag_dump_final_insns
= NULL
;
4743 /* In case the function was not output,
4744 don't leave any temporary anonymous types
4745 queued up for sdb output. */
4746 #ifdef SDB_DEBUGGING_INFO
4747 if (write_symbols
== SDB_DEBUG
)
4748 sdbout_types (NULL_TREE
);
4751 flag_rerun_cse_after_global_opts
= 0;
4752 reload_completed
= 0;
4753 epilogue_completed
= 0;
4755 regstack_completed
= 0;
4758 /* Clear out the insn_length contents now that they are no
4760 init_insn_lengths ();
4762 /* Show no temporary slots allocated. */
4765 free_bb_for_insn ();
4769 /* We can reduce stack alignment on call site only when we are sure that
4770 the function body just produced will be actually used in the final
4772 if (decl_binds_to_current_def_p (current_function_decl
))
4774 unsigned int pref
= crtl
->preferred_stack_boundary
;
4775 if (crtl
->stack_alignment_needed
> crtl
->preferred_stack_boundary
)
4776 pref
= crtl
->stack_alignment_needed
;
4777 cgraph_rtl_info (current_function_decl
)->preferred_incoming_stack_boundary
4781 /* Make sure volatile mem refs aren't considered valid operands for
4782 arithmetic insns. We must call this here if this is a nested inline
4783 function, since the above code leaves us in the init_recog state,
4784 and the function context push/pop code does not save/restore volatile_ok.
4786 ??? Maybe it isn't necessary for expand_start_function to call this
4787 anymore if we do it here? */
4789 init_recog_no_volatile ();
4791 /* We're done with this function. Free up memory if we can. */
4792 free_after_parsing (cfun
);
4793 free_after_compilation (cfun
);
4799 const pass_data pass_data_clean_state
=
4801 RTL_PASS
, /* type */
4802 "*clean_state", /* name */
4803 OPTGROUP_NONE
, /* optinfo_flags */
4804 false, /* has_gate */
4805 true, /* has_execute */
4806 TV_FINAL
, /* tv_id */
4807 0, /* properties_required */
4808 0, /* properties_provided */
4809 PROP_rtl
, /* properties_destroyed */
4810 0, /* todo_flags_start */
4811 0, /* todo_flags_finish */
4814 class pass_clean_state
: public rtl_opt_pass
4817 pass_clean_state (gcc::context
*ctxt
)
4818 : rtl_opt_pass (pass_data_clean_state
, ctxt
)
4821 /* opt_pass methods: */
4822 unsigned int execute () { return rest_of_clean_state (); }
4824 }; // class pass_clean_state
4829 make_pass_clean_state (gcc::context
*ctxt
)
4831 return new pass_clean_state (ctxt
);