1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987-2017 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. */
46 #define INCLUDE_ALGORITHM /* reverse */
48 #include "coretypes.h"
57 #include "insn-config.h"
62 #include "tree-pretty-print.h" /* for dump_function_header */
64 #include "insn-attr.h"
65 #include "conditions.h"
69 #include "rtl-error.h"
70 #include "toplev.h" /* exact_log2, floor_log2 */
75 #include "tree-pass.h"
79 #include "stringpool.h"
83 #include "print-rtl.h"
85 #ifdef XCOFF_DEBUGGING_INFO
86 #include "xcoffout.h" /* Needed for external data declarations. */
89 #include "dwarf2out.h"
91 #ifdef DBX_DEBUGGING_INFO
95 /* Most ports that aren't using cc0 don't need to define CC_STATUS_INIT.
96 So define a null default for it to save conditionalization later. */
97 #ifndef CC_STATUS_INIT
98 #define CC_STATUS_INIT
101 /* Is the given character a logical line separator for the assembler? */
102 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
103 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C, STR) ((C) == ';')
106 #ifndef JUMP_TABLES_IN_TEXT_SECTION
107 #define JUMP_TABLES_IN_TEXT_SECTION 0
110 /* Bitflags used by final_scan_insn. */
112 #define SEEN_EMITTED 2
114 /* Last insn processed by final_scan_insn. */
115 static rtx_insn
*debug_insn
;
116 rtx_insn
*current_output_insn
;
118 /* Line number of last NOTE. */
119 static int last_linenum
;
121 /* Column number of last NOTE. */
122 static int last_columnnum
;
124 /* Last discriminator written to assembly. */
125 static int last_discriminator
;
127 /* Discriminator of current block. */
128 static int discriminator
;
130 /* Highest line number in current block. */
131 static int high_block_linenum
;
133 /* Likewise for function. */
134 static int high_function_linenum
;
136 /* Filename of last NOTE. */
137 static const char *last_filename
;
139 /* Override filename, line and column number. */
140 static const char *override_filename
;
141 static int override_linenum
;
142 static int override_columnnum
;
144 /* Whether to force emission of a line note before the next insn. */
145 static bool force_source_line
= false;
147 extern const int length_unit_log
; /* This is defined in insn-attrtab.c. */
149 /* Nonzero while outputting an `asm' with operands.
150 This means that inconsistencies are the user's fault, so don't die.
151 The precise value is the insn being output, to pass to error_for_asm. */
152 const rtx_insn
*this_is_asm_operands
;
154 /* Number of operands of this insn, for an `asm' with operands. */
155 static unsigned int insn_noperands
;
157 /* Compare optimization flag. */
159 static rtx last_ignored_compare
= 0;
161 /* Assign a unique number to each insn that is output.
162 This can be used to generate unique local labels. */
164 static int insn_counter
= 0;
166 /* This variable contains machine-dependent flags (defined in tm.h)
167 set and examined by output routines
168 that describe how to interpret the condition codes properly. */
172 /* During output of an insn, this contains a copy of cc_status
173 from before the insn. */
175 CC_STATUS cc_prev_status
;
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.
188 rtx_sequence
*final_sequence
;
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 static int asm_insn_count (rtx
);
206 static void profile_function (FILE *);
207 static void profile_after_prologue (FILE *);
208 static bool notice_source_line (rtx_insn
*, bool *);
209 static rtx
walk_alter_subreg (rtx
*, bool *);
210 static void output_asm_name (void);
211 static void output_alternate_entry_point (FILE *, rtx_insn
*);
212 static tree
get_mem_expr_from_op (rtx
, int *);
213 static void output_asm_operand_names (rtx
*, int *, int);
214 #ifdef LEAF_REGISTERS
215 static void leaf_renumber_regs (rtx_insn
*);
218 static int alter_cond (rtx
);
220 static int align_fuzz (rtx
, rtx
, int, unsigned);
221 static void collect_fn_hard_reg_usage (void);
222 static tree
get_call_fndecl (rtx_insn
*);
224 /* Initialize data in final at the beginning of a compilation. */
227 init_final (const char *filename ATTRIBUTE_UNUSED
)
232 #ifdef ASSEMBLER_DIALECT
233 dialect_number
= ASSEMBLER_DIALECT
;
237 /* Default target function prologue and epilogue assembler output.
239 If not overridden for epilogue code, then the function body itself
240 contains return instructions wherever needed. */
242 default_function_pro_epilogue (FILE *)
247 default_function_switched_text_sections (FILE *file ATTRIBUTE_UNUSED
,
248 tree decl ATTRIBUTE_UNUSED
,
249 bool new_is_cold ATTRIBUTE_UNUSED
)
253 /* Default target hook that outputs nothing to a stream. */
255 no_asm_to_stream (FILE *file ATTRIBUTE_UNUSED
)
259 /* Enable APP processing of subsequent output.
260 Used before the output from an `asm' statement. */
267 fputs (ASM_APP_ON
, asm_out_file
);
272 /* Disable APP processing of subsequent output.
273 Called from varasm.c before most kinds of output. */
280 fputs (ASM_APP_OFF
, asm_out_file
);
285 /* Return the number of slots filled in the current
286 delayed branch sequence (we don't count the insn needing the
287 delay slot). Zero if not in a delayed branch sequence. */
290 dbr_sequence_length (void)
292 if (final_sequence
!= 0)
293 return XVECLEN (final_sequence
, 0) - 1;
298 /* The next two pages contain routines used to compute the length of an insn
299 and to shorten branches. */
301 /* Arrays for insn lengths, and addresses. The latter is referenced by
302 `insn_current_length'. */
304 static int *insn_lengths
;
306 vec
<int> insn_addresses_
;
308 /* Max uid for which the above arrays are valid. */
309 static int insn_lengths_max_uid
;
311 /* Address of insn being processed. Used by `insn_current_length'. */
312 int insn_current_address
;
314 /* Address of insn being processed in previous iteration. */
315 int insn_last_address
;
317 /* known invariant alignment of insn being processed. */
318 int insn_current_align
;
320 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
321 gives the next following alignment insn that increases the known
322 alignment, or NULL_RTX if there is no such insn.
323 For any alignment obtained this way, we can again index uid_align with
324 its uid to obtain the next following align that in turn increases the
325 alignment, till we reach NULL_RTX; the sequence obtained this way
326 for each insn we'll call the alignment chain of this insn in the following
329 struct label_alignment
335 static rtx
*uid_align
;
336 static int *uid_shuid
;
337 static struct label_alignment
*label_align
;
339 /* Indicate that branch shortening hasn't yet been done. */
342 init_insn_lengths (void)
353 insn_lengths_max_uid
= 0;
355 if (HAVE_ATTR_length
)
356 INSN_ADDRESSES_FREE ();
364 /* Obtain the current length of an insn. If branch shortening has been done,
365 get its actual length. Otherwise, use FALLBACK_FN to calculate the
368 get_attr_length_1 (rtx_insn
*insn
, int (*fallback_fn
) (rtx_insn
*))
374 if (!HAVE_ATTR_length
)
377 if (insn_lengths_max_uid
> INSN_UID (insn
))
378 return insn_lengths
[INSN_UID (insn
)];
380 switch (GET_CODE (insn
))
390 length
= fallback_fn (insn
);
394 body
= PATTERN (insn
);
395 if (GET_CODE (body
) == USE
|| GET_CODE (body
) == CLOBBER
)
398 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
399 length
= asm_insn_count (body
) * fallback_fn (insn
);
400 else if (rtx_sequence
*seq
= dyn_cast
<rtx_sequence
*> (body
))
401 for (i
= 0; i
< seq
->len (); i
++)
402 length
+= get_attr_length_1 (seq
->insn (i
), fallback_fn
);
404 length
= fallback_fn (insn
);
411 #ifdef ADJUST_INSN_LENGTH
412 ADJUST_INSN_LENGTH (insn
, length
);
417 /* Obtain the current length of an insn. If branch shortening has been done,
418 get its actual length. Otherwise, get its maximum length. */
420 get_attr_length (rtx_insn
*insn
)
422 return get_attr_length_1 (insn
, insn_default_length
);
425 /* Obtain the current length of an insn. If branch shortening has been done,
426 get its actual length. Otherwise, get its minimum length. */
428 get_attr_min_length (rtx_insn
*insn
)
430 return get_attr_length_1 (insn
, insn_min_length
);
433 /* Code to handle alignment inside shorten_branches. */
435 /* Here is an explanation how the algorithm in align_fuzz can give
438 Call a sequence of instructions beginning with alignment point X
439 and continuing until the next alignment point `block X'. When `X'
440 is used in an expression, it means the alignment value of the
443 Call the distance between the start of the first insn of block X, and
444 the end of the last insn of block X `IX', for the `inner size of X'.
445 This is clearly the sum of the instruction lengths.
447 Likewise with the next alignment-delimited block following X, which we
450 Call the distance between the start of the first insn of block X, and
451 the start of the first insn of block Y `OX', for the `outer size of X'.
453 The estimated padding is then OX - IX.
455 OX can be safely estimated as
460 OX = round_up(IX, X) + Y - X
462 Clearly est(IX) >= real(IX), because that only depends on the
463 instruction lengths, and those being overestimated is a given.
465 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
466 we needn't worry about that when thinking about OX.
468 When X >= Y, the alignment provided by Y adds no uncertainty factor
469 for branch ranges starting before X, so we can just round what we have.
470 But when X < Y, we don't know anything about the, so to speak,
471 `middle bits', so we have to assume the worst when aligning up from an
472 address mod X to one mod Y, which is Y - X. */
475 #define LABEL_ALIGN(LABEL) align_labels_log
479 #define LOOP_ALIGN(LABEL) align_loops_log
482 #ifndef LABEL_ALIGN_AFTER_BARRIER
483 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
487 #define JUMP_ALIGN(LABEL) align_jumps_log
491 default_label_align_after_barrier_max_skip (rtx_insn
*insn ATTRIBUTE_UNUSED
)
497 default_loop_align_max_skip (rtx_insn
*insn ATTRIBUTE_UNUSED
)
499 return align_loops_max_skip
;
503 default_label_align_max_skip (rtx_insn
*insn ATTRIBUTE_UNUSED
)
505 return align_labels_max_skip
;
509 default_jump_align_max_skip (rtx_insn
*insn ATTRIBUTE_UNUSED
)
511 return align_jumps_max_skip
;
514 #ifndef ADDR_VEC_ALIGN
516 final_addr_vec_align (rtx_jump_table_data
*addr_vec
)
518 int align
= GET_MODE_SIZE (addr_vec
->get_data_mode ());
520 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
521 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
522 return exact_log2 (align
);
526 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
529 #ifndef INSN_LENGTH_ALIGNMENT
530 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
533 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
535 static int min_labelno
, max_labelno
;
537 #define LABEL_TO_ALIGNMENT(LABEL) \
538 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
540 #define LABEL_TO_MAX_SKIP(LABEL) \
541 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
543 /* For the benefit of port specific code do this also as a function. */
546 label_to_alignment (rtx label
)
548 if (CODE_LABEL_NUMBER (label
) <= max_labelno
)
549 return LABEL_TO_ALIGNMENT (label
);
554 label_to_max_skip (rtx label
)
556 if (CODE_LABEL_NUMBER (label
) <= max_labelno
)
557 return LABEL_TO_MAX_SKIP (label
);
561 /* The differences in addresses
562 between a branch and its target might grow or shrink depending on
563 the alignment the start insn of the range (the branch for a forward
564 branch or the label for a backward branch) starts out on; if these
565 differences are used naively, they can even oscillate infinitely.
566 We therefore want to compute a 'worst case' address difference that
567 is independent of the alignment the start insn of the range end
568 up on, and that is at least as large as the actual difference.
569 The function align_fuzz calculates the amount we have to add to the
570 naively computed difference, by traversing the part of the alignment
571 chain of the start insn of the range that is in front of the end insn
572 of the range, and considering for each alignment the maximum amount
573 that it might contribute to a size increase.
575 For casesi tables, we also want to know worst case minimum amounts of
576 address difference, in case a machine description wants to introduce
577 some common offset that is added to all offsets in a table.
578 For this purpose, align_fuzz with a growth argument of 0 computes the
579 appropriate adjustment. */
581 /* Compute the maximum delta by which the difference of the addresses of
582 START and END might grow / shrink due to a different address for start
583 which changes the size of alignment insns between START and END.
584 KNOWN_ALIGN_LOG is the alignment known for START.
585 GROWTH should be ~0 if the objective is to compute potential code size
586 increase, and 0 if the objective is to compute potential shrink.
587 The return value is undefined for any other value of GROWTH. */
590 align_fuzz (rtx start
, rtx end
, int known_align_log
, unsigned int growth
)
592 int uid
= INSN_UID (start
);
594 int known_align
= 1 << known_align_log
;
595 int end_shuid
= INSN_SHUID (end
);
598 for (align_label
= uid_align
[uid
]; align_label
; align_label
= uid_align
[uid
])
600 int align_addr
, new_align
;
602 uid
= INSN_UID (align_label
);
603 align_addr
= INSN_ADDRESSES (uid
) - insn_lengths
[uid
];
604 if (uid_shuid
[uid
] > end_shuid
)
606 known_align_log
= LABEL_TO_ALIGNMENT (align_label
);
607 new_align
= 1 << known_align_log
;
608 if (new_align
< known_align
)
610 fuzz
+= (-align_addr
^ growth
) & (new_align
- known_align
);
611 known_align
= new_align
;
616 /* Compute a worst-case reference address of a branch so that it
617 can be safely used in the presence of aligned labels. Since the
618 size of the branch itself is unknown, the size of the branch is
619 not included in the range. I.e. for a forward branch, the reference
620 address is the end address of the branch as known from the previous
621 branch shortening pass, minus a value to account for possible size
622 increase due to alignment. For a backward branch, it is the start
623 address of the branch as known from the current pass, plus a value
624 to account for possible size increase due to alignment.
625 NB.: Therefore, the maximum offset allowed for backward branches needs
626 to exclude the branch size. */
629 insn_current_reference_address (rtx_insn
*branch
)
634 if (! INSN_ADDRESSES_SET_P ())
637 rtx_insn
*seq
= NEXT_INSN (PREV_INSN (branch
));
638 seq_uid
= INSN_UID (seq
);
639 if (!JUMP_P (branch
))
640 /* This can happen for example on the PA; the objective is to know the
641 offset to address something in front of the start of the function.
642 Thus, we can treat it like a backward branch.
643 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
644 any alignment we'd encounter, so we skip the call to align_fuzz. */
645 return insn_current_address
;
646 dest
= JUMP_LABEL (branch
);
648 /* BRANCH has no proper alignment chain set, so use SEQ.
649 BRANCH also has no INSN_SHUID. */
650 if (INSN_SHUID (seq
) < INSN_SHUID (dest
))
652 /* Forward branch. */
653 return (insn_last_address
+ insn_lengths
[seq_uid
]
654 - align_fuzz (seq
, dest
, length_unit_log
, ~0));
658 /* Backward branch. */
659 return (insn_current_address
660 + align_fuzz (dest
, seq
, length_unit_log
, ~0));
664 /* Compute branch alignments based on frequency information in the
668 compute_alignments (void)
670 int log
, max_skip
, max_log
;
673 int freq_threshold
= 0;
681 max_labelno
= max_label_num ();
682 min_labelno
= get_first_label_num ();
683 label_align
= XCNEWVEC (struct label_alignment
, max_labelno
- min_labelno
+ 1);
685 /* If not optimizing or optimizing for size, don't assign any alignments. */
686 if (! optimize
|| optimize_function_for_size_p (cfun
))
691 dump_reg_info (dump_file
);
692 dump_flow_info (dump_file
, TDF_DETAILS
);
693 flow_loops_dump (dump_file
, NULL
, 1);
695 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
696 FOR_EACH_BB_FN (bb
, cfun
)
697 if (bb
->frequency
> freq_max
)
698 freq_max
= bb
->frequency
;
699 freq_threshold
= freq_max
/ PARAM_VALUE (PARAM_ALIGN_THRESHOLD
);
702 fprintf (dump_file
, "freq_max: %i\n",freq_max
);
703 FOR_EACH_BB_FN (bb
, cfun
)
705 rtx_insn
*label
= BB_HEAD (bb
);
706 int fallthru_frequency
= 0, branch_frequency
= 0, has_fallthru
= 0;
711 || optimize_bb_for_size_p (bb
))
715 "BB %4i freq %4i loop %2i loop_depth %2i skipped.\n",
716 bb
->index
, bb
->frequency
, bb
->loop_father
->num
,
720 max_log
= LABEL_ALIGN (label
);
721 max_skip
= targetm
.asm_out
.label_align_max_skip (label
);
723 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
725 if (e
->flags
& EDGE_FALLTHRU
)
726 has_fallthru
= 1, fallthru_frequency
+= EDGE_FREQUENCY (e
);
728 branch_frequency
+= EDGE_FREQUENCY (e
);
732 fprintf (dump_file
, "BB %4i freq %4i loop %2i loop_depth"
733 " %2i fall %4i branch %4i",
734 bb
->index
, bb
->frequency
, bb
->loop_father
->num
,
736 fallthru_frequency
, branch_frequency
);
737 if (!bb
->loop_father
->inner
&& bb
->loop_father
->num
)
738 fprintf (dump_file
, " inner_loop");
739 if (bb
->loop_father
->header
== bb
)
740 fprintf (dump_file
, " loop_header");
741 fprintf (dump_file
, "\n");
744 /* There are two purposes to align block with no fallthru incoming edge:
745 1) to avoid fetch stalls when branch destination is near cache boundary
746 2) to improve cache efficiency in case the previous block is not executed
747 (so it does not need to be in the cache).
749 We to catch first case, we align frequently executed blocks.
750 To catch the second, we align blocks that are executed more frequently
751 than the predecessor and the predecessor is likely to not be executed
752 when function is called. */
755 && (branch_frequency
> freq_threshold
756 || (bb
->frequency
> bb
->prev_bb
->frequency
* 10
757 && (bb
->prev_bb
->frequency
758 <= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
/ 2))))
760 log
= JUMP_ALIGN (label
);
762 fprintf (dump_file
, " jump alignment added.\n");
766 max_skip
= targetm
.asm_out
.jump_align_max_skip (label
);
769 /* In case block is frequent and reached mostly by non-fallthru edge,
770 align it. It is most likely a first block of loop. */
772 && !(single_succ_p (bb
)
773 && single_succ (bb
) == EXIT_BLOCK_PTR_FOR_FN (cfun
))
774 && optimize_bb_for_speed_p (bb
)
775 && branch_frequency
+ fallthru_frequency
> freq_threshold
777 > fallthru_frequency
* PARAM_VALUE (PARAM_ALIGN_LOOP_ITERATIONS
)))
779 log
= LOOP_ALIGN (label
);
781 fprintf (dump_file
, " internal loop alignment added.\n");
785 max_skip
= targetm
.asm_out
.loop_align_max_skip (label
);
788 LABEL_TO_ALIGNMENT (label
) = max_log
;
789 LABEL_TO_MAX_SKIP (label
) = max_skip
;
792 loop_optimizer_finalize ();
793 free_dominance_info (CDI_DOMINATORS
);
797 /* Grow the LABEL_ALIGN array after new labels are created. */
800 grow_label_align (void)
802 int old
= max_labelno
;
806 max_labelno
= max_label_num ();
808 n_labels
= max_labelno
- min_labelno
+ 1;
809 n_old_labels
= old
- min_labelno
+ 1;
811 label_align
= XRESIZEVEC (struct label_alignment
, label_align
, n_labels
);
813 /* Range of labels grows monotonically in the function. Failing here
814 means that the initialization of array got lost. */
815 gcc_assert (n_old_labels
<= n_labels
);
817 memset (label_align
+ n_old_labels
, 0,
818 (n_labels
- n_old_labels
) * sizeof (struct label_alignment
));
821 /* Update the already computed alignment information. LABEL_PAIRS is a vector
822 made up of pairs of labels for which the alignment information of the first
823 element will be copied from that of the second element. */
826 update_alignments (vec
<rtx
> &label_pairs
)
829 rtx iter
, label
= NULL_RTX
;
831 if (max_labelno
!= max_label_num ())
834 FOR_EACH_VEC_ELT (label_pairs
, i
, iter
)
837 LABEL_TO_ALIGNMENT (label
) = LABEL_TO_ALIGNMENT (iter
);
838 LABEL_TO_MAX_SKIP (label
) = LABEL_TO_MAX_SKIP (iter
);
846 const pass_data pass_data_compute_alignments
=
849 "alignments", /* name */
850 OPTGROUP_NONE
, /* optinfo_flags */
852 0, /* properties_required */
853 0, /* properties_provided */
854 0, /* properties_destroyed */
855 0, /* todo_flags_start */
856 0, /* todo_flags_finish */
859 class pass_compute_alignments
: public rtl_opt_pass
862 pass_compute_alignments (gcc::context
*ctxt
)
863 : rtl_opt_pass (pass_data_compute_alignments
, ctxt
)
866 /* opt_pass methods: */
867 virtual unsigned int execute (function
*) { return compute_alignments (); }
869 }; // class pass_compute_alignments
874 make_pass_compute_alignments (gcc::context
*ctxt
)
876 return new pass_compute_alignments (ctxt
);
880 /* Make a pass over all insns and compute their actual lengths by shortening
881 any branches of variable length if possible. */
883 /* shorten_branches might be called multiple times: for example, the SH
884 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
885 In order to do this, it needs proper length information, which it obtains
886 by calling shorten_branches. This cannot be collapsed with
887 shorten_branches itself into a single pass unless we also want to integrate
888 reorg.c, since the branch splitting exposes new instructions with delay
892 shorten_branches (rtx_insn
*first
)
899 #define MAX_CODE_ALIGN 16
901 int something_changed
= 1;
902 char *varying_length
;
905 rtx align_tab
[MAX_CODE_ALIGN
];
907 /* Compute maximum UID and allocate label_align / uid_shuid. */
908 max_uid
= get_max_uid ();
910 /* Free uid_shuid before reallocating it. */
913 uid_shuid
= XNEWVEC (int, max_uid
);
915 if (max_labelno
!= max_label_num ())
918 /* Initialize label_align and set up uid_shuid to be strictly
919 monotonically rising with insn order. */
920 /* We use max_log here to keep track of the maximum alignment we want to
921 impose on the next CODE_LABEL (or the current one if we are processing
922 the CODE_LABEL itself). */
927 for (insn
= get_insns (), i
= 1; insn
; insn
= NEXT_INSN (insn
))
931 INSN_SHUID (insn
) = i
++;
935 if (rtx_code_label
*label
= dyn_cast
<rtx_code_label
*> (insn
))
937 /* Merge in alignments computed by compute_alignments. */
938 log
= LABEL_TO_ALIGNMENT (label
);
942 max_skip
= LABEL_TO_MAX_SKIP (label
);
945 rtx_jump_table_data
*table
= jump_table_for_label (label
);
948 log
= LABEL_ALIGN (label
);
952 max_skip
= targetm
.asm_out
.label_align_max_skip (label
);
955 /* ADDR_VECs only take room if read-only data goes into the text
957 if ((JUMP_TABLES_IN_TEXT_SECTION
958 || readonly_data_section
== text_section
)
961 log
= ADDR_VEC_ALIGN (table
);
965 max_skip
= targetm
.asm_out
.label_align_max_skip (label
);
968 LABEL_TO_ALIGNMENT (label
) = max_log
;
969 LABEL_TO_MAX_SKIP (label
) = max_skip
;
973 else if (BARRIER_P (insn
))
977 for (label
= insn
; label
&& ! INSN_P (label
);
978 label
= NEXT_INSN (label
))
981 log
= LABEL_ALIGN_AFTER_BARRIER (insn
);
985 max_skip
= targetm
.asm_out
.label_align_after_barrier_max_skip (label
);
991 if (!HAVE_ATTR_length
)
994 /* Allocate the rest of the arrays. */
995 insn_lengths
= XNEWVEC (int, max_uid
);
996 insn_lengths_max_uid
= max_uid
;
997 /* Syntax errors can lead to labels being outside of the main insn stream.
998 Initialize insn_addresses, so that we get reproducible results. */
999 INSN_ADDRESSES_ALLOC (max_uid
);
1001 varying_length
= XCNEWVEC (char, max_uid
);
1003 /* Initialize uid_align. We scan instructions
1004 from end to start, and keep in align_tab[n] the last seen insn
1005 that does an alignment of at least n+1, i.e. the successor
1006 in the alignment chain for an insn that does / has a known
1008 uid_align
= XCNEWVEC (rtx
, max_uid
);
1010 for (i
= MAX_CODE_ALIGN
; --i
>= 0;)
1011 align_tab
[i
] = NULL_RTX
;
1012 seq
= get_last_insn ();
1013 for (; seq
; seq
= PREV_INSN (seq
))
1015 int uid
= INSN_UID (seq
);
1017 log
= (LABEL_P (seq
) ? LABEL_TO_ALIGNMENT (seq
) : 0);
1018 uid_align
[uid
] = align_tab
[0];
1021 /* Found an alignment label. */
1022 uid_align
[uid
] = align_tab
[log
];
1023 for (i
= log
- 1; i
>= 0; i
--)
1028 /* When optimizing, we start assuming minimum length, and keep increasing
1029 lengths as we find the need for this, till nothing changes.
1030 When not optimizing, we start assuming maximum lengths, and
1031 do a single pass to update the lengths. */
1032 bool increasing
= optimize
!= 0;
1034 #ifdef CASE_VECTOR_SHORTEN_MODE
1037 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1040 int min_shuid
= INSN_SHUID (get_insns ()) - 1;
1041 int max_shuid
= INSN_SHUID (get_last_insn ()) + 1;
1044 for (insn
= first
; insn
!= 0; insn
= NEXT_INSN (insn
))
1046 rtx min_lab
= NULL_RTX
, max_lab
= NULL_RTX
, pat
;
1047 int len
, i
, min
, max
, insn_shuid
;
1049 addr_diff_vec_flags flags
;
1051 if (! JUMP_TABLE_DATA_P (insn
)
1052 || GET_CODE (PATTERN (insn
)) != ADDR_DIFF_VEC
)
1054 pat
= PATTERN (insn
);
1055 len
= XVECLEN (pat
, 1);
1056 gcc_assert (len
> 0);
1057 min_align
= MAX_CODE_ALIGN
;
1058 for (min
= max_shuid
, max
= min_shuid
, i
= len
- 1; i
>= 0; i
--)
1060 rtx lab
= XEXP (XVECEXP (pat
, 1, i
), 0);
1061 int shuid
= INSN_SHUID (lab
);
1072 if (min_align
> LABEL_TO_ALIGNMENT (lab
))
1073 min_align
= LABEL_TO_ALIGNMENT (lab
);
1075 XEXP (pat
, 2) = gen_rtx_LABEL_REF (Pmode
, min_lab
);
1076 XEXP (pat
, 3) = gen_rtx_LABEL_REF (Pmode
, max_lab
);
1077 insn_shuid
= INSN_SHUID (insn
);
1078 rel
= INSN_SHUID (XEXP (XEXP (pat
, 0), 0));
1079 memset (&flags
, 0, sizeof (flags
));
1080 flags
.min_align
= min_align
;
1081 flags
.base_after_vec
= rel
> insn_shuid
;
1082 flags
.min_after_vec
= min
> insn_shuid
;
1083 flags
.max_after_vec
= max
> insn_shuid
;
1084 flags
.min_after_base
= min
> rel
;
1085 flags
.max_after_base
= max
> rel
;
1086 ADDR_DIFF_VEC_FLAGS (pat
) = flags
;
1089 PUT_MODE (pat
, CASE_VECTOR_SHORTEN_MODE (0, 0, pat
));
1092 #endif /* CASE_VECTOR_SHORTEN_MODE */
1094 /* Compute initial lengths, addresses, and varying flags for each insn. */
1095 int (*length_fun
) (rtx_insn
*) = increasing
? insn_min_length
: insn_default_length
;
1097 for (insn_current_address
= 0, insn
= first
;
1099 insn_current_address
+= insn_lengths
[uid
], insn
= NEXT_INSN (insn
))
1101 uid
= INSN_UID (insn
);
1103 insn_lengths
[uid
] = 0;
1107 int log
= LABEL_TO_ALIGNMENT (insn
);
1110 int align
= 1 << log
;
1111 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1112 insn_lengths
[uid
] = new_address
- insn_current_address
;
1116 INSN_ADDRESSES (uid
) = insn_current_address
+ insn_lengths
[uid
];
1118 if (NOTE_P (insn
) || BARRIER_P (insn
)
1119 || LABEL_P (insn
) || DEBUG_INSN_P (insn
))
1121 if (insn
->deleted ())
1124 body
= PATTERN (insn
);
1125 if (rtx_jump_table_data
*table
= dyn_cast
<rtx_jump_table_data
*> (insn
))
1127 /* This only takes room if read-only data goes into the text
1129 if (JUMP_TABLES_IN_TEXT_SECTION
1130 || readonly_data_section
== text_section
)
1131 insn_lengths
[uid
] = (XVECLEN (body
,
1132 GET_CODE (body
) == ADDR_DIFF_VEC
)
1133 * GET_MODE_SIZE (table
->get_data_mode ()));
1134 /* Alignment is handled by ADDR_VEC_ALIGN. */
1136 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
1137 insn_lengths
[uid
] = asm_insn_count (body
) * insn_default_length (insn
);
1138 else if (rtx_sequence
*body_seq
= dyn_cast
<rtx_sequence
*> (body
))
1141 int const_delay_slots
;
1143 const_delay_slots
= const_num_delay_slots (body_seq
->insn (0));
1145 const_delay_slots
= 0;
1147 int (*inner_length_fun
) (rtx_insn
*)
1148 = const_delay_slots
? length_fun
: insn_default_length
;
1149 /* Inside a delay slot sequence, we do not do any branch shortening
1150 if the shortening could change the number of delay slots
1152 for (i
= 0; i
< body_seq
->len (); i
++)
1154 rtx_insn
*inner_insn
= body_seq
->insn (i
);
1155 int inner_uid
= INSN_UID (inner_insn
);
1158 if (GET_CODE (PATTERN (inner_insn
)) == ASM_INPUT
1159 || asm_noperands (PATTERN (inner_insn
)) >= 0)
1160 inner_length
= (asm_insn_count (PATTERN (inner_insn
))
1161 * insn_default_length (inner_insn
));
1163 inner_length
= inner_length_fun (inner_insn
);
1165 insn_lengths
[inner_uid
] = inner_length
;
1166 if (const_delay_slots
)
1168 if ((varying_length
[inner_uid
]
1169 = insn_variable_length_p (inner_insn
)) != 0)
1170 varying_length
[uid
] = 1;
1171 INSN_ADDRESSES (inner_uid
) = (insn_current_address
1172 + insn_lengths
[uid
]);
1175 varying_length
[inner_uid
] = 0;
1176 insn_lengths
[uid
] += inner_length
;
1179 else if (GET_CODE (body
) != USE
&& GET_CODE (body
) != CLOBBER
)
1181 insn_lengths
[uid
] = length_fun (insn
);
1182 varying_length
[uid
] = insn_variable_length_p (insn
);
1185 /* If needed, do any adjustment. */
1186 #ifdef ADJUST_INSN_LENGTH
1187 ADJUST_INSN_LENGTH (insn
, insn_lengths
[uid
]);
1188 if (insn_lengths
[uid
] < 0)
1189 fatal_insn ("negative insn length", insn
);
1193 /* Now loop over all the insns finding varying length insns. For each,
1194 get the current insn length. If it has changed, reflect the change.
1195 When nothing changes for a full pass, we are done. */
1197 while (something_changed
)
1199 something_changed
= 0;
1200 insn_current_align
= MAX_CODE_ALIGN
- 1;
1201 for (insn_current_address
= 0, insn
= first
;
1203 insn
= NEXT_INSN (insn
))
1206 #ifdef ADJUST_INSN_LENGTH
1211 uid
= INSN_UID (insn
);
1213 if (rtx_code_label
*label
= dyn_cast
<rtx_code_label
*> (insn
))
1215 int log
= LABEL_TO_ALIGNMENT (label
);
1217 #ifdef CASE_VECTOR_SHORTEN_MODE
1218 /* If the mode of a following jump table was changed, we
1219 may need to update the alignment of this label. */
1221 if (JUMP_TABLES_IN_TEXT_SECTION
1222 || readonly_data_section
== text_section
)
1224 rtx_jump_table_data
*table
= jump_table_for_label (label
);
1227 int newlog
= ADDR_VEC_ALIGN (table
);
1231 LABEL_TO_ALIGNMENT (insn
) = log
;
1232 something_changed
= 1;
1238 if (log
> insn_current_align
)
1240 int align
= 1 << log
;
1241 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1242 insn_lengths
[uid
] = new_address
- insn_current_address
;
1243 insn_current_align
= log
;
1244 insn_current_address
= new_address
;
1247 insn_lengths
[uid
] = 0;
1248 INSN_ADDRESSES (uid
) = insn_current_address
;
1252 length_align
= INSN_LENGTH_ALIGNMENT (insn
);
1253 if (length_align
< insn_current_align
)
1254 insn_current_align
= length_align
;
1256 insn_last_address
= INSN_ADDRESSES (uid
);
1257 INSN_ADDRESSES (uid
) = insn_current_address
;
1259 #ifdef CASE_VECTOR_SHORTEN_MODE
1261 && JUMP_TABLE_DATA_P (insn
)
1262 && GET_CODE (PATTERN (insn
)) == ADDR_DIFF_VEC
)
1264 rtx_jump_table_data
*table
= as_a
<rtx_jump_table_data
*> (insn
);
1265 rtx body
= PATTERN (insn
);
1266 int old_length
= insn_lengths
[uid
];
1268 safe_as_a
<rtx_insn
*> (XEXP (XEXP (body
, 0), 0));
1269 rtx min_lab
= XEXP (XEXP (body
, 2), 0);
1270 rtx max_lab
= XEXP (XEXP (body
, 3), 0);
1271 int rel_addr
= INSN_ADDRESSES (INSN_UID (rel_lab
));
1272 int min_addr
= INSN_ADDRESSES (INSN_UID (min_lab
));
1273 int max_addr
= INSN_ADDRESSES (INSN_UID (max_lab
));
1276 addr_diff_vec_flags flags
;
1277 scalar_int_mode vec_mode
;
1279 /* Avoid automatic aggregate initialization. */
1280 flags
= ADDR_DIFF_VEC_FLAGS (body
);
1282 /* Try to find a known alignment for rel_lab. */
1283 for (prev
= rel_lab
;
1285 && ! insn_lengths
[INSN_UID (prev
)]
1286 && ! (varying_length
[INSN_UID (prev
)] & 1);
1287 prev
= PREV_INSN (prev
))
1288 if (varying_length
[INSN_UID (prev
)] & 2)
1290 rel_align
= LABEL_TO_ALIGNMENT (prev
);
1294 /* See the comment on addr_diff_vec_flags in rtl.h for the
1295 meaning of the flags values. base: REL_LAB vec: INSN */
1296 /* Anything after INSN has still addresses from the last
1297 pass; adjust these so that they reflect our current
1298 estimate for this pass. */
1299 if (flags
.base_after_vec
)
1300 rel_addr
+= insn_current_address
- insn_last_address
;
1301 if (flags
.min_after_vec
)
1302 min_addr
+= insn_current_address
- insn_last_address
;
1303 if (flags
.max_after_vec
)
1304 max_addr
+= insn_current_address
- insn_last_address
;
1305 /* We want to know the worst case, i.e. lowest possible value
1306 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1307 its offset is positive, and we have to be wary of code shrink;
1308 otherwise, it is negative, and we have to be vary of code
1310 if (flags
.min_after_base
)
1312 /* If INSN is between REL_LAB and MIN_LAB, the size
1313 changes we are about to make can change the alignment
1314 within the observed offset, therefore we have to break
1315 it up into two parts that are independent. */
1316 if (! flags
.base_after_vec
&& flags
.min_after_vec
)
1318 min_addr
-= align_fuzz (rel_lab
, insn
, rel_align
, 0);
1319 min_addr
-= align_fuzz (insn
, min_lab
, 0, 0);
1322 min_addr
-= align_fuzz (rel_lab
, min_lab
, rel_align
, 0);
1326 if (flags
.base_after_vec
&& ! flags
.min_after_vec
)
1328 min_addr
-= align_fuzz (min_lab
, insn
, 0, ~0);
1329 min_addr
-= align_fuzz (insn
, rel_lab
, 0, ~0);
1332 min_addr
-= align_fuzz (min_lab
, rel_lab
, 0, ~0);
1334 /* Likewise, determine the highest lowest possible value
1335 for the offset of MAX_LAB. */
1336 if (flags
.max_after_base
)
1338 if (! flags
.base_after_vec
&& flags
.max_after_vec
)
1340 max_addr
+= align_fuzz (rel_lab
, insn
, rel_align
, ~0);
1341 max_addr
+= align_fuzz (insn
, max_lab
, 0, ~0);
1344 max_addr
+= align_fuzz (rel_lab
, max_lab
, rel_align
, ~0);
1348 if (flags
.base_after_vec
&& ! flags
.max_after_vec
)
1350 max_addr
+= align_fuzz (max_lab
, insn
, 0, 0);
1351 max_addr
+= align_fuzz (insn
, rel_lab
, 0, 0);
1354 max_addr
+= align_fuzz (max_lab
, rel_lab
, 0, 0);
1356 vec_mode
= CASE_VECTOR_SHORTEN_MODE (min_addr
- rel_addr
,
1357 max_addr
- rel_addr
, body
);
1359 || (GET_MODE_SIZE (vec_mode
)
1360 >= GET_MODE_SIZE (table
->get_data_mode ())))
1361 PUT_MODE (body
, vec_mode
);
1362 if (JUMP_TABLES_IN_TEXT_SECTION
1363 || readonly_data_section
== text_section
)
1366 = (XVECLEN (body
, 1)
1367 * GET_MODE_SIZE (table
->get_data_mode ()));
1368 insn_current_address
+= insn_lengths
[uid
];
1369 if (insn_lengths
[uid
] != old_length
)
1370 something_changed
= 1;
1375 #endif /* CASE_VECTOR_SHORTEN_MODE */
1377 if (! (varying_length
[uid
]))
1379 if (NONJUMP_INSN_P (insn
)
1380 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1384 body
= PATTERN (insn
);
1385 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1387 rtx inner_insn
= XVECEXP (body
, 0, i
);
1388 int inner_uid
= INSN_UID (inner_insn
);
1390 INSN_ADDRESSES (inner_uid
) = insn_current_address
;
1392 insn_current_address
+= insn_lengths
[inner_uid
];
1396 insn_current_address
+= insn_lengths
[uid
];
1401 if (NONJUMP_INSN_P (insn
) && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1403 rtx_sequence
*seqn
= as_a
<rtx_sequence
*> (PATTERN (insn
));
1406 body
= PATTERN (insn
);
1408 for (i
= 0; i
< seqn
->len (); i
++)
1410 rtx_insn
*inner_insn
= seqn
->insn (i
);
1411 int inner_uid
= INSN_UID (inner_insn
);
1414 INSN_ADDRESSES (inner_uid
) = insn_current_address
;
1416 /* insn_current_length returns 0 for insns with a
1417 non-varying length. */
1418 if (! varying_length
[inner_uid
])
1419 inner_length
= insn_lengths
[inner_uid
];
1421 inner_length
= insn_current_length (inner_insn
);
1423 if (inner_length
!= insn_lengths
[inner_uid
])
1425 if (!increasing
|| inner_length
> insn_lengths
[inner_uid
])
1427 insn_lengths
[inner_uid
] = inner_length
;
1428 something_changed
= 1;
1431 inner_length
= insn_lengths
[inner_uid
];
1433 insn_current_address
+= inner_length
;
1434 new_length
+= inner_length
;
1439 new_length
= insn_current_length (insn
);
1440 insn_current_address
+= new_length
;
1443 #ifdef ADJUST_INSN_LENGTH
1444 /* If needed, do any adjustment. */
1445 tmp_length
= new_length
;
1446 ADJUST_INSN_LENGTH (insn
, new_length
);
1447 insn_current_address
+= (new_length
- tmp_length
);
1450 if (new_length
!= insn_lengths
[uid
]
1451 && (!increasing
|| new_length
> insn_lengths
[uid
]))
1453 insn_lengths
[uid
] = new_length
;
1454 something_changed
= 1;
1457 insn_current_address
+= insn_lengths
[uid
] - new_length
;
1459 /* For a non-optimizing compile, do only a single pass. */
1463 crtl
->max_insn_address
= insn_current_address
;
1464 free (varying_length
);
1467 /* Given the body of an INSN known to be generated by an ASM statement, return
1468 the number of machine instructions likely to be generated for this insn.
1469 This is used to compute its length. */
1472 asm_insn_count (rtx body
)
1476 if (GET_CODE (body
) == ASM_INPUT
)
1477 templ
= XSTR (body
, 0);
1479 templ
= decode_asm_operands (body
, NULL
, NULL
, NULL
, NULL
, NULL
);
1481 return asm_str_count (templ
);
1484 /* Return the number of machine instructions likely to be generated for the
1485 inline-asm template. */
1487 asm_str_count (const char *templ
)
1494 for (; *templ
; templ
++)
1495 if (IS_ASM_LOGICAL_LINE_SEPARATOR (*templ
, templ
)
1502 /* ??? This is probably the wrong place for these. */
1503 /* Structure recording the mapping from source file and directory
1504 names at compile time to those to be embedded in debug
1506 struct debug_prefix_map
1508 const char *old_prefix
;
1509 const char *new_prefix
;
1512 struct debug_prefix_map
*next
;
1515 /* Linked list of such structures. */
1516 static debug_prefix_map
*debug_prefix_maps
;
1519 /* Record a debug file prefix mapping. ARG is the argument to
1520 -fdebug-prefix-map and must be of the form OLD=NEW. */
1523 add_debug_prefix_map (const char *arg
)
1525 debug_prefix_map
*map
;
1528 p
= strchr (arg
, '=');
1531 error ("invalid argument %qs to -fdebug-prefix-map", arg
);
1534 map
= XNEW (debug_prefix_map
);
1535 map
->old_prefix
= xstrndup (arg
, p
- arg
);
1536 map
->old_len
= p
- arg
;
1538 map
->new_prefix
= xstrdup (p
);
1539 map
->new_len
= strlen (p
);
1540 map
->next
= debug_prefix_maps
;
1541 debug_prefix_maps
= map
;
1544 /* Perform user-specified mapping of debug filename prefixes. Return
1545 the new name corresponding to FILENAME. */
1548 remap_debug_filename (const char *filename
)
1550 debug_prefix_map
*map
;
1555 for (map
= debug_prefix_maps
; map
; map
= map
->next
)
1556 if (filename_ncmp (filename
, map
->old_prefix
, map
->old_len
) == 0)
1560 name
= filename
+ map
->old_len
;
1561 name_len
= strlen (name
) + 1;
1562 s
= (char *) alloca (name_len
+ map
->new_len
);
1563 memcpy (s
, map
->new_prefix
, map
->new_len
);
1564 memcpy (s
+ map
->new_len
, name
, name_len
);
1565 return ggc_strdup (s
);
1568 /* Return true if DWARF2 debug info can be emitted for DECL. */
1571 dwarf2_debug_info_emitted_p (tree decl
)
1573 if (write_symbols
!= DWARF2_DEBUG
&& write_symbols
!= VMS_AND_DWARF2_DEBUG
)
1576 if (DECL_IGNORED_P (decl
))
1582 /* Return scope resulting from combination of S1 and S2. */
1584 choose_inner_scope (tree s1
, tree s2
)
1590 if (BLOCK_NUMBER (s1
) > BLOCK_NUMBER (s2
))
1595 /* Emit lexical block notes needed to change scope from S1 to S2. */
1598 change_scope (rtx_insn
*orig_insn
, tree s1
, tree s2
)
1600 rtx_insn
*insn
= orig_insn
;
1601 tree com
= NULL_TREE
;
1602 tree ts1
= s1
, ts2
= s2
;
1607 gcc_assert (ts1
&& ts2
);
1608 if (BLOCK_NUMBER (ts1
) > BLOCK_NUMBER (ts2
))
1609 ts1
= BLOCK_SUPERCONTEXT (ts1
);
1610 else if (BLOCK_NUMBER (ts1
) < BLOCK_NUMBER (ts2
))
1611 ts2
= BLOCK_SUPERCONTEXT (ts2
);
1614 ts1
= BLOCK_SUPERCONTEXT (ts1
);
1615 ts2
= BLOCK_SUPERCONTEXT (ts2
);
1624 rtx_note
*note
= emit_note_before (NOTE_INSN_BLOCK_END
, insn
);
1625 NOTE_BLOCK (note
) = s
;
1626 s
= BLOCK_SUPERCONTEXT (s
);
1633 insn
= emit_note_before (NOTE_INSN_BLOCK_BEG
, insn
);
1634 NOTE_BLOCK (insn
) = s
;
1635 s
= BLOCK_SUPERCONTEXT (s
);
1639 /* Rebuild all the NOTE_INSN_BLOCK_BEG and NOTE_INSN_BLOCK_END notes based
1640 on the scope tree and the newly reordered instructions. */
1643 reemit_insn_block_notes (void)
1645 tree cur_block
= DECL_INITIAL (cfun
->decl
);
1649 insn
= get_insns ();
1650 for (; insn
; insn
= NEXT_INSN (insn
))
1654 /* Prevent lexical blocks from straddling section boundaries. */
1655 if (NOTE_P (insn
) && NOTE_KIND (insn
) == NOTE_INSN_SWITCH_TEXT_SECTIONS
)
1657 for (tree s
= cur_block
; s
!= DECL_INITIAL (cfun
->decl
);
1658 s
= BLOCK_SUPERCONTEXT (s
))
1660 rtx_note
*note
= emit_note_before (NOTE_INSN_BLOCK_END
, insn
);
1661 NOTE_BLOCK (note
) = s
;
1662 note
= emit_note_after (NOTE_INSN_BLOCK_BEG
, insn
);
1663 NOTE_BLOCK (note
) = s
;
1667 if (!active_insn_p (insn
))
1670 /* Avoid putting scope notes between jump table and its label. */
1671 if (JUMP_TABLE_DATA_P (insn
))
1674 this_block
= insn_scope (insn
);
1675 /* For sequences compute scope resulting from merging all scopes
1676 of instructions nested inside. */
1677 if (rtx_sequence
*body
= dyn_cast
<rtx_sequence
*> (PATTERN (insn
)))
1682 for (i
= 0; i
< body
->len (); i
++)
1683 this_block
= choose_inner_scope (this_block
,
1684 insn_scope (body
->insn (i
)));
1688 if (INSN_LOCATION (insn
) == UNKNOWN_LOCATION
)
1691 this_block
= DECL_INITIAL (cfun
->decl
);
1694 if (this_block
!= cur_block
)
1696 change_scope (insn
, cur_block
, this_block
);
1697 cur_block
= this_block
;
1701 /* change_scope emits before the insn, not after. */
1702 note
= emit_note (NOTE_INSN_DELETED
);
1703 change_scope (note
, cur_block
, DECL_INITIAL (cfun
->decl
));
1709 static const char *some_local_dynamic_name
;
1711 /* Locate some local-dynamic symbol still in use by this function
1712 so that we can print its name in local-dynamic base patterns.
1713 Return null if there are no local-dynamic references. */
1716 get_some_local_dynamic_name ()
1718 subrtx_iterator::array_type array
;
1721 if (some_local_dynamic_name
)
1722 return some_local_dynamic_name
;
1724 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
1725 if (NONDEBUG_INSN_P (insn
))
1726 FOR_EACH_SUBRTX (iter
, array
, PATTERN (insn
), ALL
)
1728 const_rtx x
= *iter
;
1729 if (GET_CODE (x
) == SYMBOL_REF
)
1731 if (SYMBOL_REF_TLS_MODEL (x
) == TLS_MODEL_LOCAL_DYNAMIC
)
1732 return some_local_dynamic_name
= XSTR (x
, 0);
1733 if (CONSTANT_POOL_ADDRESS_P (x
))
1734 iter
.substitute (get_pool_constant (x
));
1741 /* Output assembler code for the start of a function,
1742 and initialize some of the variables in this file
1743 for the new function. The label for the function and associated
1744 assembler pseudo-ops have already been output in `assemble_start_function'.
1746 FIRST is the first insn of the rtl for the function being compiled.
1747 FILE is the file to write assembler code to.
1748 OPTIMIZE_P is nonzero if we should eliminate redundant
1749 test and compare insns. */
1752 final_start_function (rtx_insn
*first
, FILE *file
,
1753 int optimize_p ATTRIBUTE_UNUSED
)
1757 this_is_asm_operands
= 0;
1759 need_profile_function
= false;
1761 last_filename
= LOCATION_FILE (prologue_location
);
1762 last_linenum
= LOCATION_LINE (prologue_location
);
1763 last_columnnum
= LOCATION_COLUMN (prologue_location
);
1764 last_discriminator
= discriminator
= 0;
1766 high_block_linenum
= high_function_linenum
= last_linenum
;
1768 if (flag_sanitize
& SANITIZE_ADDRESS
)
1769 asan_function_start ();
1771 if (!DECL_IGNORED_P (current_function_decl
))
1772 debug_hooks
->begin_prologue (last_linenum
, last_columnnum
, last_filename
);
1774 if (!dwarf2_debug_info_emitted_p (current_function_decl
))
1775 dwarf2out_begin_prologue (0, 0, NULL
);
1777 #ifdef LEAF_REG_REMAP
1778 if (crtl
->uses_only_leaf_regs
)
1779 leaf_renumber_regs (first
);
1782 /* The Sun386i and perhaps other machines don't work right
1783 if the profiling code comes after the prologue. */
1784 if (targetm
.profile_before_prologue () && crtl
->profile
)
1786 if (targetm
.asm_out
.function_prologue
== default_function_pro_epilogue
1787 && targetm
.have_prologue ())
1790 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1796 else if (NOTE_KIND (insn
) == NOTE_INSN_BASIC_BLOCK
1797 || NOTE_KIND (insn
) == NOTE_INSN_FUNCTION_BEG
)
1799 else if (NOTE_KIND (insn
) == NOTE_INSN_DELETED
1800 || NOTE_KIND (insn
) == NOTE_INSN_VAR_LOCATION
)
1809 need_profile_function
= true;
1811 profile_function (file
);
1814 profile_function (file
);
1817 /* If debugging, assign block numbers to all of the blocks in this
1821 reemit_insn_block_notes ();
1822 number_blocks (current_function_decl
);
1823 /* We never actually put out begin/end notes for the top-level
1824 block in the function. But, conceptually, that block is
1826 TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl
)) = 1;
1829 if (warn_frame_larger_than
1830 && get_frame_size () > frame_larger_than_size
)
1832 /* Issue a warning */
1833 warning (OPT_Wframe_larger_than_
,
1834 "the frame size of %wd bytes is larger than %wd bytes",
1835 get_frame_size (), frame_larger_than_size
);
1838 /* First output the function prologue: code to set up the stack frame. */
1839 targetm
.asm_out
.function_prologue (file
);
1841 /* If the machine represents the prologue as RTL, the profiling code must
1842 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1843 if (! targetm
.have_prologue ())
1844 profile_after_prologue (file
);
1848 profile_after_prologue (FILE *file ATTRIBUTE_UNUSED
)
1850 if (!targetm
.profile_before_prologue () && crtl
->profile
)
1851 profile_function (file
);
1855 profile_function (FILE *file ATTRIBUTE_UNUSED
)
1857 #ifndef NO_PROFILE_COUNTERS
1858 # define NO_PROFILE_COUNTERS 0
1860 #ifdef ASM_OUTPUT_REG_PUSH
1861 rtx sval
= NULL
, chain
= NULL
;
1863 if (cfun
->returns_struct
)
1864 sval
= targetm
.calls
.struct_value_rtx (TREE_TYPE (current_function_decl
),
1866 if (cfun
->static_chain_decl
)
1867 chain
= targetm
.calls
.static_chain (current_function_decl
, true);
1868 #endif /* ASM_OUTPUT_REG_PUSH */
1870 if (! NO_PROFILE_COUNTERS
)
1872 int align
= MIN (BIGGEST_ALIGNMENT
, LONG_TYPE_SIZE
);
1873 switch_to_section (data_section
);
1874 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
1875 targetm
.asm_out
.internal_label (file
, "LP", current_function_funcdef_no
);
1876 assemble_integer (const0_rtx
, LONG_TYPE_SIZE
/ BITS_PER_UNIT
, align
, 1);
1879 switch_to_section (current_function_section ());
1881 #ifdef ASM_OUTPUT_REG_PUSH
1882 if (sval
&& REG_P (sval
))
1883 ASM_OUTPUT_REG_PUSH (file
, REGNO (sval
));
1884 if (chain
&& REG_P (chain
))
1885 ASM_OUTPUT_REG_PUSH (file
, REGNO (chain
));
1888 FUNCTION_PROFILER (file
, current_function_funcdef_no
);
1890 #ifdef ASM_OUTPUT_REG_PUSH
1891 if (chain
&& REG_P (chain
))
1892 ASM_OUTPUT_REG_POP (file
, REGNO (chain
));
1893 if (sval
&& REG_P (sval
))
1894 ASM_OUTPUT_REG_POP (file
, REGNO (sval
));
1898 /* Output assembler code for the end of a function.
1899 For clarity, args are same as those of `final_start_function'
1900 even though not all of them are needed. */
1903 final_end_function (void)
1907 if (!DECL_IGNORED_P (current_function_decl
))
1908 debug_hooks
->end_function (high_function_linenum
);
1910 /* Finally, output the function epilogue:
1911 code to restore the stack frame and return to the caller. */
1912 targetm
.asm_out
.function_epilogue (asm_out_file
);
1914 /* And debug output. */
1915 if (!DECL_IGNORED_P (current_function_decl
))
1916 debug_hooks
->end_epilogue (last_linenum
, last_filename
);
1918 if (!dwarf2_debug_info_emitted_p (current_function_decl
)
1919 && dwarf2out_do_frame ())
1920 dwarf2out_end_epilogue (last_linenum
, last_filename
);
1922 some_local_dynamic_name
= 0;
1926 /* Dumper helper for basic block information. FILE is the assembly
1927 output file, and INSN is the instruction being emitted. */
1930 dump_basic_block_info (FILE *file
, rtx_insn
*insn
, basic_block
*start_to_bb
,
1931 basic_block
*end_to_bb
, int bb_map_size
, int *bb_seqn
)
1935 if (!flag_debug_asm
)
1938 if (INSN_UID (insn
) < bb_map_size
1939 && (bb
= start_to_bb
[INSN_UID (insn
)]) != NULL
)
1944 fprintf (file
, "%s BLOCK %d", ASM_COMMENT_START
, bb
->index
);
1946 fprintf (file
, " freq:%d", bb
->frequency
);
1947 if (bb
->count
.initialized_p ())
1949 fprintf (file
, ", count:");
1950 bb
->count
.dump (file
);
1952 fprintf (file
, " seq:%d", (*bb_seqn
)++);
1953 fprintf (file
, "\n%s PRED:", ASM_COMMENT_START
);
1954 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
1956 dump_edge_info (file
, e
, TDF_DETAILS
, 0);
1958 fprintf (file
, "\n");
1960 if (INSN_UID (insn
) < bb_map_size
1961 && (bb
= end_to_bb
[INSN_UID (insn
)]) != NULL
)
1966 fprintf (asm_out_file
, "%s SUCC:", ASM_COMMENT_START
);
1967 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1969 dump_edge_info (asm_out_file
, e
, TDF_DETAILS
, 1);
1971 fprintf (file
, "\n");
1975 /* Output assembler code for some insns: all or part of a function.
1976 For description of args, see `final_start_function', above. */
1979 final (rtx_insn
*first
, FILE *file
, int optimize_p
)
1981 rtx_insn
*insn
, *next
;
1984 /* Used for -dA dump. */
1985 basic_block
*start_to_bb
= NULL
;
1986 basic_block
*end_to_bb
= NULL
;
1987 int bb_map_size
= 0;
1990 last_ignored_compare
= 0;
1993 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1995 /* If CC tracking across branches is enabled, record the insn which
1996 jumps to each branch only reached from one place. */
1997 if (optimize_p
&& JUMP_P (insn
))
1999 rtx lab
= JUMP_LABEL (insn
);
2000 if (lab
&& LABEL_P (lab
) && LABEL_NUSES (lab
) == 1)
2002 LABEL_REFS (lab
) = insn
;
2015 bb_map_size
= get_max_uid () + 1;
2016 start_to_bb
= XCNEWVEC (basic_block
, bb_map_size
);
2017 end_to_bb
= XCNEWVEC (basic_block
, bb_map_size
);
2019 /* There is no cfg for a thunk. */
2020 if (!cfun
->is_thunk
)
2021 FOR_EACH_BB_REVERSE_FN (bb
, cfun
)
2023 start_to_bb
[INSN_UID (BB_HEAD (bb
))] = bb
;
2024 end_to_bb
[INSN_UID (BB_END (bb
))] = bb
;
2028 /* Output the insns. */
2029 for (insn
= first
; insn
;)
2031 if (HAVE_ATTR_length
)
2033 if ((unsigned) INSN_UID (insn
) >= INSN_ADDRESSES_SIZE ())
2035 /* This can be triggered by bugs elsewhere in the compiler if
2036 new insns are created after init_insn_lengths is called. */
2037 gcc_assert (NOTE_P (insn
));
2038 insn_current_address
= -1;
2041 insn_current_address
= INSN_ADDRESSES (INSN_UID (insn
));
2044 dump_basic_block_info (file
, insn
, start_to_bb
, end_to_bb
,
2045 bb_map_size
, &bb_seqn
);
2046 insn
= final_scan_insn (insn
, file
, optimize_p
, 0, &seen
);
2055 /* Remove CFI notes, to avoid compare-debug failures. */
2056 for (insn
= first
; insn
; insn
= next
)
2058 next
= NEXT_INSN (insn
);
2060 && (NOTE_KIND (insn
) == NOTE_INSN_CFI
2061 || NOTE_KIND (insn
) == NOTE_INSN_CFI_LABEL
))
2067 get_insn_template (int code
, rtx insn
)
2069 switch (insn_data
[code
].output_format
)
2071 case INSN_OUTPUT_FORMAT_SINGLE
:
2072 return insn_data
[code
].output
.single
;
2073 case INSN_OUTPUT_FORMAT_MULTI
:
2074 return insn_data
[code
].output
.multi
[which_alternative
];
2075 case INSN_OUTPUT_FORMAT_FUNCTION
:
2077 return (*insn_data
[code
].output
.function
) (recog_data
.operand
,
2078 as_a
<rtx_insn
*> (insn
));
2085 /* Emit the appropriate declaration for an alternate-entry-point
2086 symbol represented by INSN, to FILE. INSN is a CODE_LABEL with
2087 LABEL_KIND != LABEL_NORMAL.
2089 The case fall-through in this function is intentional. */
2091 output_alternate_entry_point (FILE *file
, rtx_insn
*insn
)
2093 const char *name
= LABEL_NAME (insn
);
2095 switch (LABEL_KIND (insn
))
2097 case LABEL_WEAK_ENTRY
:
2098 #ifdef ASM_WEAKEN_LABEL
2099 ASM_WEAKEN_LABEL (file
, name
);
2102 case LABEL_GLOBAL_ENTRY
:
2103 targetm
.asm_out
.globalize_label (file
, name
);
2105 case LABEL_STATIC_ENTRY
:
2106 #ifdef ASM_OUTPUT_TYPE_DIRECTIVE
2107 ASM_OUTPUT_TYPE_DIRECTIVE (file
, name
, "function");
2109 ASM_OUTPUT_LABEL (file
, name
);
2118 /* Given a CALL_INSN, find and return the nested CALL. */
2120 call_from_call_insn (rtx_call_insn
*insn
)
2123 gcc_assert (CALL_P (insn
));
2126 while (GET_CODE (x
) != CALL
)
2128 switch (GET_CODE (x
))
2133 x
= COND_EXEC_CODE (x
);
2136 x
= XVECEXP (x
, 0, 0);
2146 /* Print a comment into the asm showing FILENAME, LINENUM, and the
2147 corresponding source line, if available. */
2150 asm_show_source (const char *filename
, int linenum
)
2156 const char *line
= location_get_source_line (filename
, linenum
, &line_size
);
2160 fprintf (asm_out_file
, "%s %s:%i: ", ASM_COMMENT_START
, filename
, linenum
);
2161 /* "line" is not 0-terminated, so we must use line_size. */
2162 fwrite (line
, 1, line_size
, asm_out_file
);
2163 fputc ('\n', asm_out_file
);
2166 /* The final scan for one insn, INSN.
2167 Args are same as in `final', except that INSN
2168 is the insn being scanned.
2169 Value returned is the next insn to be scanned.
2171 NOPEEPHOLES is the flag to disallow peephole processing (currently
2172 used for within delayed branch sequence output).
2174 SEEN is used to track the end of the prologue, for emitting
2175 debug information. We force the emission of a line note after
2176 both NOTE_INSN_PROLOGUE_END and NOTE_INSN_FUNCTION_BEG. */
2179 final_scan_insn (rtx_insn
*insn
, FILE *file
, int optimize_p ATTRIBUTE_UNUSED
,
2180 int nopeepholes ATTRIBUTE_UNUSED
, int *seen
)
2186 rtx_jump_table_data
*table
;
2190 /* Ignore deleted insns. These can occur when we split insns (due to a
2191 template of "#") while not optimizing. */
2192 if (insn
->deleted ())
2193 return NEXT_INSN (insn
);
2195 switch (GET_CODE (insn
))
2198 switch (NOTE_KIND (insn
))
2200 case NOTE_INSN_DELETED
:
2201 case NOTE_INSN_UPDATE_SJLJ_CONTEXT
:
2204 case NOTE_INSN_SWITCH_TEXT_SECTIONS
:
2205 in_cold_section_p
= !in_cold_section_p
;
2207 if (dwarf2out_do_frame ())
2208 dwarf2out_switch_text_section ();
2209 else if (!DECL_IGNORED_P (current_function_decl
))
2210 debug_hooks
->switch_text_section ();
2212 switch_to_section (current_function_section ());
2213 targetm
.asm_out
.function_switched_text_sections (asm_out_file
,
2214 current_function_decl
,
2216 /* Emit a label for the split cold section. Form label name by
2217 suffixing "cold" to the original function's name. */
2218 if (in_cold_section_p
)
2221 = clone_function_name (current_function_decl
, "cold");
2222 #ifdef ASM_DECLARE_COLD_FUNCTION_NAME
2223 ASM_DECLARE_COLD_FUNCTION_NAME (asm_out_file
,
2225 (cold_function_name
),
2226 current_function_decl
);
2228 ASM_OUTPUT_LABEL (asm_out_file
,
2229 IDENTIFIER_POINTER (cold_function_name
));
2234 case NOTE_INSN_BASIC_BLOCK
:
2235 if (need_profile_function
)
2237 profile_function (asm_out_file
);
2238 need_profile_function
= false;
2241 if (targetm
.asm_out
.unwind_emit
)
2242 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
2244 discriminator
= NOTE_BASIC_BLOCK (insn
)->discriminator
;
2248 case NOTE_INSN_EH_REGION_BEG
:
2249 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LEHB",
2250 NOTE_EH_HANDLER (insn
));
2253 case NOTE_INSN_EH_REGION_END
:
2254 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LEHE",
2255 NOTE_EH_HANDLER (insn
));
2258 case NOTE_INSN_PROLOGUE_END
:
2259 targetm
.asm_out
.function_end_prologue (file
);
2260 profile_after_prologue (file
);
2262 if ((*seen
& (SEEN_EMITTED
| SEEN_NOTE
)) == SEEN_NOTE
)
2264 *seen
|= SEEN_EMITTED
;
2265 force_source_line
= true;
2272 case NOTE_INSN_EPILOGUE_BEG
:
2273 if (!DECL_IGNORED_P (current_function_decl
))
2274 (*debug_hooks
->begin_epilogue
) (last_linenum
, last_filename
);
2275 targetm
.asm_out
.function_begin_epilogue (file
);
2279 dwarf2out_emit_cfi (NOTE_CFI (insn
));
2282 case NOTE_INSN_CFI_LABEL
:
2283 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LCFI",
2284 NOTE_LABEL_NUMBER (insn
));
2287 case NOTE_INSN_FUNCTION_BEG
:
2288 if (need_profile_function
)
2290 profile_function (asm_out_file
);
2291 need_profile_function
= false;
2295 if (!DECL_IGNORED_P (current_function_decl
))
2296 debug_hooks
->end_prologue (last_linenum
, last_filename
);
2298 if ((*seen
& (SEEN_EMITTED
| SEEN_NOTE
)) == SEEN_NOTE
)
2300 *seen
|= SEEN_EMITTED
;
2301 force_source_line
= true;
2308 case NOTE_INSN_BLOCK_BEG
:
2309 if (debug_info_level
== DINFO_LEVEL_NORMAL
2310 || debug_info_level
== DINFO_LEVEL_VERBOSE
2311 || write_symbols
== DWARF2_DEBUG
2312 || write_symbols
== VMS_AND_DWARF2_DEBUG
2313 || write_symbols
== VMS_DEBUG
)
2315 int n
= BLOCK_NUMBER (NOTE_BLOCK (insn
));
2319 high_block_linenum
= last_linenum
;
2321 /* Output debugging info about the symbol-block beginning. */
2322 if (!DECL_IGNORED_P (current_function_decl
))
2323 debug_hooks
->begin_block (last_linenum
, n
);
2325 /* Mark this block as output. */
2326 TREE_ASM_WRITTEN (NOTE_BLOCK (insn
)) = 1;
2327 BLOCK_IN_COLD_SECTION_P (NOTE_BLOCK (insn
)) = in_cold_section_p
;
2329 if (write_symbols
== DBX_DEBUG
)
2331 location_t
*locus_ptr
2332 = block_nonartificial_location (NOTE_BLOCK (insn
));
2334 if (locus_ptr
!= NULL
)
2336 override_filename
= LOCATION_FILE (*locus_ptr
);
2337 override_linenum
= LOCATION_LINE (*locus_ptr
);
2338 override_columnnum
= LOCATION_COLUMN (*locus_ptr
);
2343 case NOTE_INSN_BLOCK_END
:
2344 if (debug_info_level
== DINFO_LEVEL_NORMAL
2345 || debug_info_level
== DINFO_LEVEL_VERBOSE
2346 || write_symbols
== DWARF2_DEBUG
2347 || write_symbols
== VMS_AND_DWARF2_DEBUG
2348 || write_symbols
== VMS_DEBUG
)
2350 int n
= BLOCK_NUMBER (NOTE_BLOCK (insn
));
2354 /* End of a symbol-block. */
2356 gcc_assert (block_depth
>= 0);
2358 if (!DECL_IGNORED_P (current_function_decl
))
2359 debug_hooks
->end_block (high_block_linenum
, n
);
2360 gcc_assert (BLOCK_IN_COLD_SECTION_P (NOTE_BLOCK (insn
))
2361 == in_cold_section_p
);
2363 if (write_symbols
== DBX_DEBUG
)
2365 tree outer_block
= BLOCK_SUPERCONTEXT (NOTE_BLOCK (insn
));
2366 location_t
*locus_ptr
2367 = block_nonartificial_location (outer_block
);
2369 if (locus_ptr
!= NULL
)
2371 override_filename
= LOCATION_FILE (*locus_ptr
);
2372 override_linenum
= LOCATION_LINE (*locus_ptr
);
2373 override_columnnum
= LOCATION_COLUMN (*locus_ptr
);
2377 override_filename
= NULL
;
2378 override_linenum
= 0;
2379 override_columnnum
= 0;
2384 case NOTE_INSN_DELETED_LABEL
:
2385 /* Emit the label. We may have deleted the CODE_LABEL because
2386 the label could be proved to be unreachable, though still
2387 referenced (in the form of having its address taken. */
2388 ASM_OUTPUT_DEBUG_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
2391 case NOTE_INSN_DELETED_DEBUG_LABEL
:
2392 /* Similarly, but need to use different namespace for it. */
2393 if (CODE_LABEL_NUMBER (insn
) != -1)
2394 ASM_OUTPUT_DEBUG_LABEL (file
, "LDL", CODE_LABEL_NUMBER (insn
));
2397 case NOTE_INSN_VAR_LOCATION
:
2398 case NOTE_INSN_CALL_ARG_LOCATION
:
2399 if (!DECL_IGNORED_P (current_function_decl
))
2400 debug_hooks
->var_location (insn
);
2413 /* The target port might emit labels in the output function for
2414 some insn, e.g. sh.c output_branchy_insn. */
2415 if (CODE_LABEL_NUMBER (insn
) <= max_labelno
)
2417 int align
= LABEL_TO_ALIGNMENT (insn
);
2418 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2419 int max_skip
= LABEL_TO_MAX_SKIP (insn
);
2422 if (align
&& NEXT_INSN (insn
))
2424 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2425 ASM_OUTPUT_MAX_SKIP_ALIGN (file
, align
, max_skip
);
2427 #ifdef ASM_OUTPUT_ALIGN_WITH_NOP
2428 ASM_OUTPUT_ALIGN_WITH_NOP (file
, align
);
2430 ASM_OUTPUT_ALIGN (file
, align
);
2437 if (!DECL_IGNORED_P (current_function_decl
) && LABEL_NAME (insn
))
2438 debug_hooks
->label (as_a
<rtx_code_label
*> (insn
));
2442 /* If this label is followed by a jump-table, make sure we put
2443 the label in the read-only section. Also possibly write the
2444 label and jump table together. */
2445 table
= jump_table_for_label (as_a
<rtx_code_label
*> (insn
));
2448 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2449 /* In this case, the case vector is being moved by the
2450 target, so don't output the label at all. Leave that
2451 to the back end macros. */
2453 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2457 switch_to_section (targetm
.asm_out
.function_rodata_section
2458 (current_function_decl
));
2460 #ifdef ADDR_VEC_ALIGN
2461 log_align
= ADDR_VEC_ALIGN (table
);
2463 log_align
= exact_log2 (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
);
2465 ASM_OUTPUT_ALIGN (file
, log_align
);
2468 switch_to_section (current_function_section ());
2470 #ifdef ASM_OUTPUT_CASE_LABEL
2471 ASM_OUTPUT_CASE_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
), table
);
2473 targetm
.asm_out
.internal_label (file
, "L", CODE_LABEL_NUMBER (insn
));
2478 if (LABEL_ALT_ENTRY_P (insn
))
2479 output_alternate_entry_point (file
, insn
);
2481 targetm
.asm_out
.internal_label (file
, "L", CODE_LABEL_NUMBER (insn
));
2486 rtx body
= PATTERN (insn
);
2487 int insn_code_number
;
2491 /* Reset this early so it is correct for ASM statements. */
2492 current_insn_predicate
= NULL_RTX
;
2494 /* An INSN, JUMP_INSN or CALL_INSN.
2495 First check for special kinds that recog doesn't recognize. */
2497 if (GET_CODE (body
) == USE
/* These are just declarations. */
2498 || GET_CODE (body
) == CLOBBER
)
2503 /* If there is a REG_CC_SETTER note on this insn, it means that
2504 the setting of the condition code was done in the delay slot
2505 of the insn that branched here. So recover the cc status
2506 from the insn that set it. */
2508 rtx note
= find_reg_note (insn
, REG_CC_SETTER
, NULL_RTX
);
2511 rtx_insn
*other
= as_a
<rtx_insn
*> (XEXP (note
, 0));
2512 NOTICE_UPDATE_CC (PATTERN (other
), other
);
2513 cc_prev_status
= cc_status
;
2518 /* Detect insns that are really jump-tables
2519 and output them as such. */
2521 if (JUMP_TABLE_DATA_P (insn
))
2523 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2527 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2528 switch_to_section (targetm
.asm_out
.function_rodata_section
2529 (current_function_decl
));
2531 switch_to_section (current_function_section ());
2535 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2536 if (GET_CODE (body
) == ADDR_VEC
)
2538 #ifdef ASM_OUTPUT_ADDR_VEC
2539 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn
), body
);
2546 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2547 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn
), body
);
2553 vlen
= XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
);
2554 for (idx
= 0; idx
< vlen
; idx
++)
2556 if (GET_CODE (body
) == ADDR_VEC
)
2558 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2559 ASM_OUTPUT_ADDR_VEC_ELT
2560 (file
, CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 0, idx
), 0)));
2567 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2568 ASM_OUTPUT_ADDR_DIFF_ELT
2571 CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 1, idx
), 0)),
2572 CODE_LABEL_NUMBER (XEXP (XEXP (body
, 0), 0)));
2578 #ifdef ASM_OUTPUT_CASE_END
2579 ASM_OUTPUT_CASE_END (file
,
2580 CODE_LABEL_NUMBER (PREV_INSN (insn
)),
2585 switch_to_section (current_function_section ());
2589 /* Output this line note if it is the first or the last line
2591 if (!DECL_IGNORED_P (current_function_decl
)
2592 && notice_source_line (insn
, &is_stmt
))
2594 if (flag_verbose_asm
)
2595 asm_show_source (last_filename
, last_linenum
);
2596 (*debug_hooks
->source_line
) (last_linenum
, last_columnnum
,
2597 last_filename
, last_discriminator
,
2601 if (GET_CODE (body
) == PARALLEL
2602 && GET_CODE (XVECEXP (body
, 0, 0)) == ASM_INPUT
)
2603 body
= XVECEXP (body
, 0, 0);
2605 if (GET_CODE (body
) == ASM_INPUT
)
2607 const char *string
= XSTR (body
, 0);
2609 /* There's no telling what that did to the condition codes. */
2614 expanded_location loc
;
2617 loc
= expand_location (ASM_INPUT_SOURCE_LOCATION (body
));
2618 if (*loc
.file
&& loc
.line
)
2619 fprintf (asm_out_file
, "%s %i \"%s\" 1\n",
2620 ASM_COMMENT_START
, loc
.line
, loc
.file
);
2621 fprintf (asm_out_file
, "\t%s\n", string
);
2622 #if HAVE_AS_LINE_ZERO
2623 if (*loc
.file
&& loc
.line
)
2624 fprintf (asm_out_file
, "%s 0 \"\" 2\n", ASM_COMMENT_START
);
2630 /* Detect `asm' construct with operands. */
2631 if (asm_noperands (body
) >= 0)
2633 unsigned int noperands
= asm_noperands (body
);
2634 rtx
*ops
= XALLOCAVEC (rtx
, noperands
);
2637 expanded_location expanded
;
2639 /* There's no telling what that did to the condition codes. */
2642 /* Get out the operand values. */
2643 string
= decode_asm_operands (body
, ops
, NULL
, NULL
, NULL
, &loc
);
2644 /* Inhibit dying on what would otherwise be compiler bugs. */
2645 insn_noperands
= noperands
;
2646 this_is_asm_operands
= insn
;
2647 expanded
= expand_location (loc
);
2649 #ifdef FINAL_PRESCAN_INSN
2650 FINAL_PRESCAN_INSN (insn
, ops
, insn_noperands
);
2653 /* Output the insn using them. */
2657 if (expanded
.file
&& expanded
.line
)
2658 fprintf (asm_out_file
, "%s %i \"%s\" 1\n",
2659 ASM_COMMENT_START
, expanded
.line
, expanded
.file
);
2660 output_asm_insn (string
, ops
);
2661 #if HAVE_AS_LINE_ZERO
2662 if (expanded
.file
&& expanded
.line
)
2663 fprintf (asm_out_file
, "%s 0 \"\" 2\n", ASM_COMMENT_START
);
2667 if (targetm
.asm_out
.final_postscan_insn
)
2668 targetm
.asm_out
.final_postscan_insn (file
, insn
, ops
,
2671 this_is_asm_operands
= 0;
2677 if (rtx_sequence
*seq
= dyn_cast
<rtx_sequence
*> (body
))
2679 /* A delayed-branch sequence */
2682 final_sequence
= seq
;
2684 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2685 force the restoration of a comparison that was previously
2686 thought unnecessary. If that happens, cancel this sequence
2687 and cause that insn to be restored. */
2689 next
= final_scan_insn (seq
->insn (0), file
, 0, 1, seen
);
2690 if (next
!= seq
->insn (1))
2696 for (i
= 1; i
< seq
->len (); i
++)
2698 rtx_insn
*insn
= seq
->insn (i
);
2699 rtx_insn
*next
= NEXT_INSN (insn
);
2700 /* We loop in case any instruction in a delay slot gets
2703 insn
= final_scan_insn (insn
, file
, 0, 1, seen
);
2704 while (insn
!= next
);
2706 #ifdef DBR_OUTPUT_SEQEND
2707 DBR_OUTPUT_SEQEND (file
);
2711 /* If the insn requiring the delay slot was a CALL_INSN, the
2712 insns in the delay slot are actually executed before the
2713 called function. Hence we don't preserve any CC-setting
2714 actions in these insns and the CC must be marked as being
2715 clobbered by the function. */
2716 if (CALL_P (seq
->insn (0)))
2723 /* We have a real machine instruction as rtl. */
2725 body
= PATTERN (insn
);
2728 set
= single_set (insn
);
2730 /* Check for redundant test and compare instructions
2731 (when the condition codes are already set up as desired).
2732 This is done only when optimizing; if not optimizing,
2733 it should be possible for the user to alter a variable
2734 with the debugger in between statements
2735 and the next statement should reexamine the variable
2736 to compute the condition codes. */
2741 && GET_CODE (SET_DEST (set
)) == CC0
2742 && insn
!= last_ignored_compare
)
2745 if (GET_CODE (SET_SRC (set
)) == SUBREG
)
2746 SET_SRC (set
) = alter_subreg (&SET_SRC (set
), true);
2748 src1
= SET_SRC (set
);
2750 if (GET_CODE (SET_SRC (set
)) == COMPARE
)
2752 if (GET_CODE (XEXP (SET_SRC (set
), 0)) == SUBREG
)
2753 XEXP (SET_SRC (set
), 0)
2754 = alter_subreg (&XEXP (SET_SRC (set
), 0), true);
2755 if (GET_CODE (XEXP (SET_SRC (set
), 1)) == SUBREG
)
2756 XEXP (SET_SRC (set
), 1)
2757 = alter_subreg (&XEXP (SET_SRC (set
), 1), true);
2758 if (XEXP (SET_SRC (set
), 1)
2759 == CONST0_RTX (GET_MODE (XEXP (SET_SRC (set
), 0))))
2760 src2
= XEXP (SET_SRC (set
), 0);
2762 if ((cc_status
.value1
!= 0
2763 && rtx_equal_p (src1
, cc_status
.value1
))
2764 || (cc_status
.value2
!= 0
2765 && rtx_equal_p (src1
, cc_status
.value2
))
2766 || (src2
!= 0 && cc_status
.value1
!= 0
2767 && rtx_equal_p (src2
, cc_status
.value1
))
2768 || (src2
!= 0 && cc_status
.value2
!= 0
2769 && rtx_equal_p (src2
, cc_status
.value2
)))
2771 /* Don't delete insn if it has an addressing side-effect. */
2772 if (! FIND_REG_INC_NOTE (insn
, NULL_RTX
)
2773 /* or if anything in it is volatile. */
2774 && ! volatile_refs_p (PATTERN (insn
)))
2776 /* We don't really delete the insn; just ignore it. */
2777 last_ignored_compare
= insn
;
2784 /* If this is a conditional branch, maybe modify it
2785 if the cc's are in a nonstandard state
2786 so that it accomplishes the same thing that it would
2787 do straightforwardly if the cc's were set up normally. */
2789 if (cc_status
.flags
!= 0
2791 && GET_CODE (body
) == SET
2792 && SET_DEST (body
) == pc_rtx
2793 && GET_CODE (SET_SRC (body
)) == IF_THEN_ELSE
2794 && COMPARISON_P (XEXP (SET_SRC (body
), 0))
2795 && XEXP (XEXP (SET_SRC (body
), 0), 0) == cc0_rtx
)
2797 /* This function may alter the contents of its argument
2798 and clear some of the cc_status.flags bits.
2799 It may also return 1 meaning condition now always true
2800 or -1 meaning condition now always false
2801 or 2 meaning condition nontrivial but altered. */
2802 int result
= alter_cond (XEXP (SET_SRC (body
), 0));
2803 /* If condition now has fixed value, replace the IF_THEN_ELSE
2804 with its then-operand or its else-operand. */
2806 SET_SRC (body
) = XEXP (SET_SRC (body
), 1);
2808 SET_SRC (body
) = XEXP (SET_SRC (body
), 2);
2810 /* The jump is now either unconditional or a no-op.
2811 If it has become a no-op, don't try to output it.
2812 (It would not be recognized.) */
2813 if (SET_SRC (body
) == pc_rtx
)
2818 else if (ANY_RETURN_P (SET_SRC (body
)))
2819 /* Replace (set (pc) (return)) with (return). */
2820 PATTERN (insn
) = body
= SET_SRC (body
);
2822 /* Rerecognize the instruction if it has changed. */
2824 INSN_CODE (insn
) = -1;
2827 /* If this is a conditional trap, maybe modify it if the cc's
2828 are in a nonstandard state so that it accomplishes the same
2829 thing that it would do straightforwardly if the cc's were
2831 if (cc_status
.flags
!= 0
2832 && NONJUMP_INSN_P (insn
)
2833 && GET_CODE (body
) == TRAP_IF
2834 && COMPARISON_P (TRAP_CONDITION (body
))
2835 && XEXP (TRAP_CONDITION (body
), 0) == cc0_rtx
)
2837 /* This function may alter the contents of its argument
2838 and clear some of the cc_status.flags bits.
2839 It may also return 1 meaning condition now always true
2840 or -1 meaning condition now always false
2841 or 2 meaning condition nontrivial but altered. */
2842 int result
= alter_cond (TRAP_CONDITION (body
));
2844 /* If TRAP_CONDITION has become always false, delete the
2852 /* If TRAP_CONDITION has become always true, replace
2853 TRAP_CONDITION with const_true_rtx. */
2855 TRAP_CONDITION (body
) = const_true_rtx
;
2857 /* Rerecognize the instruction if it has changed. */
2859 INSN_CODE (insn
) = -1;
2862 /* Make same adjustments to instructions that examine the
2863 condition codes without jumping and instructions that
2864 handle conditional moves (if this machine has either one). */
2866 if (cc_status
.flags
!= 0
2869 rtx cond_rtx
, then_rtx
, else_rtx
;
2872 && GET_CODE (SET_SRC (set
)) == IF_THEN_ELSE
)
2874 cond_rtx
= XEXP (SET_SRC (set
), 0);
2875 then_rtx
= XEXP (SET_SRC (set
), 1);
2876 else_rtx
= XEXP (SET_SRC (set
), 2);
2880 cond_rtx
= SET_SRC (set
);
2881 then_rtx
= const_true_rtx
;
2882 else_rtx
= const0_rtx
;
2885 if (COMPARISON_P (cond_rtx
)
2886 && XEXP (cond_rtx
, 0) == cc0_rtx
)
2889 result
= alter_cond (cond_rtx
);
2891 validate_change (insn
, &SET_SRC (set
), then_rtx
, 0);
2892 else if (result
== -1)
2893 validate_change (insn
, &SET_SRC (set
), else_rtx
, 0);
2894 else if (result
== 2)
2895 INSN_CODE (insn
) = -1;
2896 if (SET_DEST (set
) == SET_SRC (set
))
2903 /* Do machine-specific peephole optimizations if desired. */
2905 if (HAVE_peephole
&& optimize_p
&& !flag_no_peephole
&& !nopeepholes
)
2907 rtx_insn
*next
= peephole (insn
);
2908 /* When peepholing, if there were notes within the peephole,
2909 emit them before the peephole. */
2910 if (next
!= 0 && next
!= NEXT_INSN (insn
))
2912 rtx_insn
*note
, *prev
= PREV_INSN (insn
);
2914 for (note
= NEXT_INSN (insn
); note
!= next
;
2915 note
= NEXT_INSN (note
))
2916 final_scan_insn (note
, file
, optimize_p
, nopeepholes
, seen
);
2918 /* Put the notes in the proper position for a later
2919 rescan. For example, the SH target can do this
2920 when generating a far jump in a delayed branch
2922 note
= NEXT_INSN (insn
);
2923 SET_PREV_INSN (note
) = prev
;
2924 SET_NEXT_INSN (prev
) = note
;
2925 SET_NEXT_INSN (PREV_INSN (next
)) = insn
;
2926 SET_PREV_INSN (insn
) = PREV_INSN (next
);
2927 SET_NEXT_INSN (insn
) = next
;
2928 SET_PREV_INSN (next
) = insn
;
2931 /* PEEPHOLE might have changed this. */
2932 body
= PATTERN (insn
);
2935 /* Try to recognize the instruction.
2936 If successful, verify that the operands satisfy the
2937 constraints for the instruction. Crash if they don't,
2938 since `reload' should have changed them so that they do. */
2940 insn_code_number
= recog_memoized (insn
);
2941 cleanup_subreg_operands (insn
);
2943 /* Dump the insn in the assembly for debugging (-dAP).
2944 If the final dump is requested as slim RTL, dump slim
2945 RTL to the assembly file also. */
2946 if (flag_dump_rtl_in_asm
)
2948 print_rtx_head
= ASM_COMMENT_START
;
2949 if (! (dump_flags
& TDF_SLIM
))
2950 print_rtl_single (asm_out_file
, insn
);
2952 dump_insn_slim (asm_out_file
, insn
);
2953 print_rtx_head
= "";
2956 if (! constrain_operands_cached (insn
, 1))
2957 fatal_insn_not_found (insn
);
2959 /* Some target machines need to prescan each insn before
2962 #ifdef FINAL_PRESCAN_INSN
2963 FINAL_PRESCAN_INSN (insn
, recog_data
.operand
, recog_data
.n_operands
);
2966 if (targetm
.have_conditional_execution ()
2967 && GET_CODE (PATTERN (insn
)) == COND_EXEC
)
2968 current_insn_predicate
= COND_EXEC_TEST (PATTERN (insn
));
2971 cc_prev_status
= cc_status
;
2973 /* Update `cc_status' for this instruction.
2974 The instruction's output routine may change it further.
2975 If the output routine for a jump insn needs to depend
2976 on the cc status, it should look at cc_prev_status. */
2978 NOTICE_UPDATE_CC (body
, insn
);
2981 current_output_insn
= debug_insn
= insn
;
2983 /* Find the proper template for this insn. */
2984 templ
= get_insn_template (insn_code_number
, insn
);
2986 /* If the C code returns 0, it means that it is a jump insn
2987 which follows a deleted test insn, and that test insn
2988 needs to be reinserted. */
2993 gcc_assert (prev_nonnote_insn (insn
) == last_ignored_compare
);
2995 /* We have already processed the notes between the setter and
2996 the user. Make sure we don't process them again, this is
2997 particularly important if one of the notes is a block
2998 scope note or an EH note. */
3000 prev
!= last_ignored_compare
;
3001 prev
= PREV_INSN (prev
))
3004 delete_insn (prev
); /* Use delete_note. */
3010 /* If the template is the string "#", it means that this insn must
3012 if (templ
[0] == '#' && templ
[1] == '\0')
3014 rtx_insn
*new_rtx
= try_split (body
, insn
, 0);
3016 /* If we didn't split the insn, go away. */
3017 if (new_rtx
== insn
&& PATTERN (new_rtx
) == body
)
3018 fatal_insn ("could not split insn", insn
);
3020 /* If we have a length attribute, this instruction should have
3021 been split in shorten_branches, to ensure that we would have
3022 valid length info for the splitees. */
3023 gcc_assert (!HAVE_ATTR_length
);
3028 /* ??? This will put the directives in the wrong place if
3029 get_insn_template outputs assembly directly. However calling it
3030 before get_insn_template breaks if the insns is split. */
3031 if (targetm
.asm_out
.unwind_emit_before_insn
3032 && targetm
.asm_out
.unwind_emit
)
3033 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
3035 rtx_call_insn
*call_insn
= dyn_cast
<rtx_call_insn
*> (insn
);
3036 if (call_insn
!= NULL
)
3038 rtx x
= call_from_call_insn (call_insn
);
3040 if (x
&& MEM_P (x
) && GET_CODE (XEXP (x
, 0)) == SYMBOL_REF
)
3044 t
= SYMBOL_REF_DECL (x
);
3046 assemble_external (t
);
3050 /* Output assembler code from the template. */
3051 output_asm_insn (templ
, recog_data
.operand
);
3053 /* Some target machines need to postscan each insn after
3055 if (targetm
.asm_out
.final_postscan_insn
)
3056 targetm
.asm_out
.final_postscan_insn (file
, insn
, recog_data
.operand
,
3057 recog_data
.n_operands
);
3059 if (!targetm
.asm_out
.unwind_emit_before_insn
3060 && targetm
.asm_out
.unwind_emit
)
3061 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
3063 /* Let the debug info back-end know about this call. We do this only
3064 after the instruction has been emitted because labels that may be
3065 created to reference the call instruction must appear after it. */
3066 if (call_insn
!= NULL
&& !DECL_IGNORED_P (current_function_decl
))
3067 debug_hooks
->var_location (insn
);
3069 current_output_insn
= debug_insn
= 0;
3072 return NEXT_INSN (insn
);
3075 /* Return whether a source line note needs to be emitted before INSN.
3076 Sets IS_STMT to TRUE if the line should be marked as a possible
3077 breakpoint location. */
3080 notice_source_line (rtx_insn
*insn
, bool *is_stmt
)
3082 const char *filename
;
3083 int linenum
, columnnum
;
3085 if (override_filename
)
3087 filename
= override_filename
;
3088 linenum
= override_linenum
;
3089 columnnum
= override_columnnum
;
3091 else if (INSN_HAS_LOCATION (insn
))
3093 expanded_location xloc
= insn_location (insn
);
3094 filename
= xloc
.file
;
3095 linenum
= xloc
.line
;
3096 columnnum
= xloc
.column
;
3105 if (filename
== NULL
)
3108 if (force_source_line
3109 || filename
!= last_filename
3110 || last_linenum
!= linenum
3111 || (debug_column_info
&& last_columnnum
!= columnnum
))
3113 force_source_line
= false;
3114 last_filename
= filename
;
3115 last_linenum
= linenum
;
3116 last_columnnum
= columnnum
;
3117 last_discriminator
= discriminator
;
3119 high_block_linenum
= MAX (last_linenum
, high_block_linenum
);
3120 high_function_linenum
= MAX (last_linenum
, high_function_linenum
);
3124 if (SUPPORTS_DISCRIMINATOR
&& last_discriminator
!= discriminator
)
3126 /* If the discriminator changed, but the line number did not,
3127 output the line table entry with is_stmt false so the
3128 debugger does not treat this as a breakpoint location. */
3129 last_discriminator
= discriminator
;
3137 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3138 directly to the desired hard register. */
3141 cleanup_subreg_operands (rtx_insn
*insn
)
3144 bool changed
= false;
3145 extract_insn_cached (insn
);
3146 for (i
= 0; i
< recog_data
.n_operands
; i
++)
3148 /* The following test cannot use recog_data.operand when testing
3149 for a SUBREG: the underlying object might have been changed
3150 already if we are inside a match_operator expression that
3151 matches the else clause. Instead we test the underlying
3152 expression directly. */
3153 if (GET_CODE (*recog_data
.operand_loc
[i
]) == SUBREG
)
3155 recog_data
.operand
[i
] = alter_subreg (recog_data
.operand_loc
[i
], true);
3158 else if (GET_CODE (recog_data
.operand
[i
]) == PLUS
3159 || GET_CODE (recog_data
.operand
[i
]) == MULT
3160 || MEM_P (recog_data
.operand
[i
]))
3161 recog_data
.operand
[i
] = walk_alter_subreg (recog_data
.operand_loc
[i
], &changed
);
3164 for (i
= 0; i
< recog_data
.n_dups
; i
++)
3166 if (GET_CODE (*recog_data
.dup_loc
[i
]) == SUBREG
)
3168 *recog_data
.dup_loc
[i
] = alter_subreg (recog_data
.dup_loc
[i
], true);
3171 else if (GET_CODE (*recog_data
.dup_loc
[i
]) == PLUS
3172 || GET_CODE (*recog_data
.dup_loc
[i
]) == MULT
3173 || MEM_P (*recog_data
.dup_loc
[i
]))
3174 *recog_data
.dup_loc
[i
] = walk_alter_subreg (recog_data
.dup_loc
[i
], &changed
);
3177 df_insn_rescan (insn
);
3180 /* If X is a SUBREG, try to replace it with a REG or a MEM, based on
3181 the thing it is a subreg of. Do it anyway if FINAL_P. */
3184 alter_subreg (rtx
*xp
, bool final_p
)
3187 rtx y
= SUBREG_REG (x
);
3189 /* simplify_subreg does not remove subreg from volatile references.
3190 We are required to. */
3193 int offset
= SUBREG_BYTE (x
);
3195 /* For paradoxical subregs on big-endian machines, SUBREG_BYTE
3196 contains 0 instead of the proper offset. See simplify_subreg. */
3197 if (paradoxical_subreg_p (x
))
3198 offset
= byte_lowpart_offset (GET_MODE (x
), GET_MODE (y
));
3201 *xp
= adjust_address (y
, GET_MODE (x
), offset
);
3203 *xp
= adjust_address_nv (y
, GET_MODE (x
), offset
);
3205 else if (REG_P (y
) && HARD_REGISTER_P (y
))
3207 rtx new_rtx
= simplify_subreg (GET_MODE (x
), y
, GET_MODE (y
),
3212 else if (final_p
&& REG_P (y
))
3214 /* Simplify_subreg can't handle some REG cases, but we have to. */
3216 HOST_WIDE_INT offset
;
3218 regno
= subreg_regno (x
);
3219 if (subreg_lowpart_p (x
))
3220 offset
= byte_lowpart_offset (GET_MODE (x
), GET_MODE (y
));
3222 offset
= SUBREG_BYTE (x
);
3223 *xp
= gen_rtx_REG_offset (y
, GET_MODE (x
), regno
, offset
);
3230 /* Do alter_subreg on all the SUBREGs contained in X. */
3233 walk_alter_subreg (rtx
*xp
, bool *changed
)
3236 switch (GET_CODE (x
))
3241 XEXP (x
, 0) = walk_alter_subreg (&XEXP (x
, 0), changed
);
3242 XEXP (x
, 1) = walk_alter_subreg (&XEXP (x
, 1), changed
);
3247 XEXP (x
, 0) = walk_alter_subreg (&XEXP (x
, 0), changed
);
3252 return alter_subreg (xp
, true);
3263 /* Given BODY, the body of a jump instruction, alter the jump condition
3264 as required by the bits that are set in cc_status.flags.
3265 Not all of the bits there can be handled at this level in all cases.
3267 The value is normally 0.
3268 1 means that the condition has become always true.
3269 -1 means that the condition has become always false.
3270 2 means that COND has been altered. */
3273 alter_cond (rtx cond
)
3277 if (cc_status
.flags
& CC_REVERSED
)
3280 PUT_CODE (cond
, swap_condition (GET_CODE (cond
)));
3283 if (cc_status
.flags
& CC_INVERTED
)
3286 PUT_CODE (cond
, reverse_condition (GET_CODE (cond
)));
3289 if (cc_status
.flags
& CC_NOT_POSITIVE
)
3290 switch (GET_CODE (cond
))
3295 /* Jump becomes unconditional. */
3301 /* Jump becomes no-op. */
3305 PUT_CODE (cond
, EQ
);
3310 PUT_CODE (cond
, NE
);
3318 if (cc_status
.flags
& CC_NOT_NEGATIVE
)
3319 switch (GET_CODE (cond
))
3323 /* Jump becomes unconditional. */
3328 /* Jump becomes no-op. */
3333 PUT_CODE (cond
, EQ
);
3339 PUT_CODE (cond
, NE
);
3347 if (cc_status
.flags
& CC_NO_OVERFLOW
)
3348 switch (GET_CODE (cond
))
3351 /* Jump becomes unconditional. */
3355 PUT_CODE (cond
, EQ
);
3360 PUT_CODE (cond
, NE
);
3365 /* Jump becomes no-op. */
3372 if (cc_status
.flags
& (CC_Z_IN_NOT_N
| CC_Z_IN_N
))
3373 switch (GET_CODE (cond
))
3379 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? GE
: LT
);
3384 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? LT
: GE
);
3389 if (cc_status
.flags
& CC_NOT_SIGNED
)
3390 /* The flags are valid if signed condition operators are converted
3392 switch (GET_CODE (cond
))
3395 PUT_CODE (cond
, LEU
);
3400 PUT_CODE (cond
, LTU
);
3405 PUT_CODE (cond
, GTU
);
3410 PUT_CODE (cond
, GEU
);
3422 /* Report inconsistency between the assembler template and the operands.
3423 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3426 output_operand_lossage (const char *cmsgid
, ...)
3430 const char *pfx_str
;
3433 va_start (ap
, cmsgid
);
3435 pfx_str
= this_is_asm_operands
? _("invalid 'asm': ") : "output_operand: ";
3436 fmt_string
= xasprintf ("%s%s", pfx_str
, _(cmsgid
));
3437 new_message
= xvasprintf (fmt_string
, ap
);
3439 if (this_is_asm_operands
)
3440 error_for_asm (this_is_asm_operands
, "%s", new_message
);
3442 internal_error ("%s", new_message
);
3449 /* Output of assembler code from a template, and its subroutines. */
3451 /* Annotate the assembly with a comment describing the pattern and
3452 alternative used. */
3455 output_asm_name (void)
3459 int num
= INSN_CODE (debug_insn
);
3460 fprintf (asm_out_file
, "\t%s %d\t%s",
3461 ASM_COMMENT_START
, INSN_UID (debug_insn
),
3462 insn_data
[num
].name
);
3463 if (insn_data
[num
].n_alternatives
> 1)
3464 fprintf (asm_out_file
, "/%d", which_alternative
+ 1);
3466 if (HAVE_ATTR_length
)
3467 fprintf (asm_out_file
, "\t[length = %d]",
3468 get_attr_length (debug_insn
));
3470 /* Clear this so only the first assembler insn
3471 of any rtl insn will get the special comment for -dp. */
3476 /* If OP is a REG or MEM and we can find a MEM_EXPR corresponding to it
3477 or its address, return that expr . Set *PADDRESSP to 1 if the expr
3478 corresponds to the address of the object and 0 if to the object. */
3481 get_mem_expr_from_op (rtx op
, int *paddressp
)
3489 return REG_EXPR (op
);
3490 else if (!MEM_P (op
))
3493 if (MEM_EXPR (op
) != 0)
3494 return MEM_EXPR (op
);
3496 /* Otherwise we have an address, so indicate it and look at the address. */
3500 /* First check if we have a decl for the address, then look at the right side
3501 if it is a PLUS. Otherwise, strip off arithmetic and keep looking.
3502 But don't allow the address to itself be indirect. */
3503 if ((expr
= get_mem_expr_from_op (op
, &inner_addressp
)) && ! inner_addressp
)
3505 else if (GET_CODE (op
) == PLUS
3506 && (expr
= get_mem_expr_from_op (XEXP (op
, 1), &inner_addressp
)))
3510 || GET_RTX_CLASS (GET_CODE (op
)) == RTX_BIN_ARITH
)
3513 expr
= get_mem_expr_from_op (op
, &inner_addressp
);
3514 return inner_addressp
? 0 : expr
;
3517 /* Output operand names for assembler instructions. OPERANDS is the
3518 operand vector, OPORDER is the order to write the operands, and NOPS
3519 is the number of operands to write. */
3522 output_asm_operand_names (rtx
*operands
, int *oporder
, int nops
)
3527 for (i
= 0; i
< nops
; i
++)
3530 rtx op
= operands
[oporder
[i
]];
3531 tree expr
= get_mem_expr_from_op (op
, &addressp
);
3533 fprintf (asm_out_file
, "%c%s",
3534 wrote
? ',' : '\t', wrote
? "" : ASM_COMMENT_START
);
3538 fprintf (asm_out_file
, "%s",
3539 addressp
? "*" : "");
3540 print_mem_expr (asm_out_file
, expr
);
3543 else if (REG_P (op
) && ORIGINAL_REGNO (op
)
3544 && ORIGINAL_REGNO (op
) != REGNO (op
))
3545 fprintf (asm_out_file
, " tmp%i", ORIGINAL_REGNO (op
));
3549 #ifdef ASSEMBLER_DIALECT
3550 /* Helper function to parse assembler dialects in the asm string.
3551 This is called from output_asm_insn and asm_fprintf. */
3553 do_assembler_dialects (const char *p
, int *dialect
)
3564 output_operand_lossage ("nested assembly dialect alternatives");
3568 /* If we want the first dialect, do nothing. Otherwise, skip
3569 DIALECT_NUMBER of strings ending with '|'. */
3570 for (i
= 0; i
< dialect_number
; i
++)
3572 while (*p
&& *p
!= '}')
3580 /* Skip over any character after a percent sign. */
3592 output_operand_lossage ("unterminated assembly dialect alternative");
3599 /* Skip to close brace. */
3604 output_operand_lossage ("unterminated assembly dialect alternative");
3608 /* Skip over any character after a percent sign. */
3609 if (*p
== '%' && p
[1])
3623 putc (c
, asm_out_file
);
3628 putc (c
, asm_out_file
);
3639 /* Output text from TEMPLATE to the assembler output file,
3640 obeying %-directions to substitute operands taken from
3641 the vector OPERANDS.
3643 %N (for N a digit) means print operand N in usual manner.
3644 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3645 and print the label name with no punctuation.
3646 %cN means require operand N to be a constant
3647 and print the constant expression with no punctuation.
3648 %aN means expect operand N to be a memory address
3649 (not a memory reference!) and print a reference
3651 %nN means expect operand N to be a constant
3652 and print a constant expression for minus the value
3653 of the operand, with no other punctuation. */
3656 output_asm_insn (const char *templ
, rtx
*operands
)
3660 #ifdef ASSEMBLER_DIALECT
3663 int oporder
[MAX_RECOG_OPERANDS
];
3664 char opoutput
[MAX_RECOG_OPERANDS
];
3667 /* An insn may return a null string template
3668 in a case where no assembler code is needed. */
3672 memset (opoutput
, 0, sizeof opoutput
);
3674 putc ('\t', asm_out_file
);
3676 #ifdef ASM_OUTPUT_OPCODE
3677 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3684 if (flag_verbose_asm
)
3685 output_asm_operand_names (operands
, oporder
, ops
);
3686 if (flag_print_asm_name
)
3690 memset (opoutput
, 0, sizeof opoutput
);
3692 putc (c
, asm_out_file
);
3693 #ifdef ASM_OUTPUT_OPCODE
3694 while ((c
= *p
) == '\t')
3696 putc (c
, asm_out_file
);
3699 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3703 #ifdef ASSEMBLER_DIALECT
3707 p
= do_assembler_dialects (p
, &dialect
);
3712 /* %% outputs a single %. %{, %} and %| print {, } and | respectively
3713 if ASSEMBLER_DIALECT defined and these characters have a special
3714 meaning as dialect delimiters.*/
3716 #ifdef ASSEMBLER_DIALECT
3717 || *p
== '{' || *p
== '}' || *p
== '|'
3721 putc (*p
, asm_out_file
);
3724 /* %= outputs a number which is unique to each insn in the entire
3725 compilation. This is useful for making local labels that are
3726 referred to more than once in a given insn. */
3730 fprintf (asm_out_file
, "%d", insn_counter
);
3732 /* % followed by a letter and some digits
3733 outputs an operand in a special way depending on the letter.
3734 Letters `acln' are implemented directly.
3735 Other letters are passed to `output_operand' so that
3736 the TARGET_PRINT_OPERAND hook can define them. */
3737 else if (ISALPHA (*p
))
3740 unsigned long opnum
;
3743 opnum
= strtoul (p
, &endptr
, 10);
3746 output_operand_lossage ("operand number missing "
3748 else if (this_is_asm_operands
&& opnum
>= insn_noperands
)
3749 output_operand_lossage ("operand number out of range");
3750 else if (letter
== 'l')
3751 output_asm_label (operands
[opnum
]);
3752 else if (letter
== 'a')
3753 output_address (VOIDmode
, operands
[opnum
]);
3754 else if (letter
== 'c')
3756 if (CONSTANT_ADDRESS_P (operands
[opnum
]))
3757 output_addr_const (asm_out_file
, operands
[opnum
]);
3759 output_operand (operands
[opnum
], 'c');
3761 else if (letter
== 'n')
3763 if (CONST_INT_P (operands
[opnum
]))
3764 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
,
3765 - INTVAL (operands
[opnum
]));
3768 putc ('-', asm_out_file
);
3769 output_addr_const (asm_out_file
, operands
[opnum
]);
3773 output_operand (operands
[opnum
], letter
);
3775 if (!opoutput
[opnum
])
3776 oporder
[ops
++] = opnum
;
3777 opoutput
[opnum
] = 1;
3782 /* % followed by a digit outputs an operand the default way. */
3783 else if (ISDIGIT (*p
))
3785 unsigned long opnum
;
3788 opnum
= strtoul (p
, &endptr
, 10);
3789 if (this_is_asm_operands
&& opnum
>= insn_noperands
)
3790 output_operand_lossage ("operand number out of range");
3792 output_operand (operands
[opnum
], 0);
3794 if (!opoutput
[opnum
])
3795 oporder
[ops
++] = opnum
;
3796 opoutput
[opnum
] = 1;
3801 /* % followed by punctuation: output something for that
3802 punctuation character alone, with no operand. The
3803 TARGET_PRINT_OPERAND hook decides what is actually done. */
3804 else if (targetm
.asm_out
.print_operand_punct_valid_p ((unsigned char) *p
))
3805 output_operand (NULL_RTX
, *p
++);
3807 output_operand_lossage ("invalid %%-code");
3811 putc (c
, asm_out_file
);
3814 /* Write out the variable names for operands, if we know them. */
3815 if (flag_verbose_asm
)
3816 output_asm_operand_names (operands
, oporder
, ops
);
3817 if (flag_print_asm_name
)
3820 putc ('\n', asm_out_file
);
3823 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3826 output_asm_label (rtx x
)
3830 if (GET_CODE (x
) == LABEL_REF
)
3831 x
= label_ref_label (x
);
3834 && NOTE_KIND (x
) == NOTE_INSN_DELETED_LABEL
))
3835 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3837 output_operand_lossage ("'%%l' operand isn't a label");
3839 assemble_name (asm_out_file
, buf
);
3842 /* Marks SYMBOL_REFs in x as referenced through use of assemble_external. */
3845 mark_symbol_refs_as_used (rtx x
)
3847 subrtx_iterator::array_type array
;
3848 FOR_EACH_SUBRTX (iter
, array
, x
, ALL
)
3850 const_rtx x
= *iter
;
3851 if (GET_CODE (x
) == SYMBOL_REF
)
3852 if (tree t
= SYMBOL_REF_DECL (x
))
3853 assemble_external (t
);
3857 /* Print operand X using machine-dependent assembler syntax.
3858 CODE is a non-digit that preceded the operand-number in the % spec,
3859 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3860 between the % and the digits.
3861 When CODE is a non-letter, X is 0.
3863 The meanings of the letters are machine-dependent and controlled
3864 by TARGET_PRINT_OPERAND. */
3867 output_operand (rtx x
, int code ATTRIBUTE_UNUSED
)
3869 if (x
&& GET_CODE (x
) == SUBREG
)
3870 x
= alter_subreg (&x
, true);
3872 /* X must not be a pseudo reg. */
3873 if (!targetm
.no_register_allocation
)
3874 gcc_assert (!x
|| !REG_P (x
) || REGNO (x
) < FIRST_PSEUDO_REGISTER
);
3876 targetm
.asm_out
.print_operand (asm_out_file
, x
, code
);
3881 mark_symbol_refs_as_used (x
);
3884 /* Print a memory reference operand for address X using
3885 machine-dependent assembler syntax. */
3888 output_address (machine_mode mode
, rtx x
)
3890 bool changed
= false;
3891 walk_alter_subreg (&x
, &changed
);
3892 targetm
.asm_out
.print_operand_address (asm_out_file
, mode
, x
);
3895 /* Print an integer constant expression in assembler syntax.
3896 Addition and subtraction are the only arithmetic
3897 that may appear in these expressions. */
3900 output_addr_const (FILE *file
, rtx x
)
3905 switch (GET_CODE (x
))
3912 if (SYMBOL_REF_DECL (x
))
3913 assemble_external (SYMBOL_REF_DECL (x
));
3914 #ifdef ASM_OUTPUT_SYMBOL_REF
3915 ASM_OUTPUT_SYMBOL_REF (file
, x
);
3917 assemble_name (file
, XSTR (x
, 0));
3922 x
= label_ref_label (x
);
3925 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3926 #ifdef ASM_OUTPUT_LABEL_REF
3927 ASM_OUTPUT_LABEL_REF (file
, buf
);
3929 assemble_name (file
, buf
);
3934 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, INTVAL (x
));
3938 /* This used to output parentheses around the expression,
3939 but that does not work on the 386 (either ATT or BSD assembler). */
3940 output_addr_const (file
, XEXP (x
, 0));
3943 case CONST_WIDE_INT
:
3944 /* We do not know the mode here so we have to use a round about
3945 way to build a wide-int to get it printed properly. */
3947 wide_int w
= wide_int::from_array (&CONST_WIDE_INT_ELT (x
, 0),
3948 CONST_WIDE_INT_NUNITS (x
),
3949 CONST_WIDE_INT_NUNITS (x
)
3950 * HOST_BITS_PER_WIDE_INT
,
3952 print_decs (w
, file
);
3957 if (CONST_DOUBLE_AS_INT_P (x
))
3959 /* We can use %d if the number is one word and positive. */
3960 if (CONST_DOUBLE_HIGH (x
))
3961 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
3962 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_HIGH (x
),
3963 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_LOW (x
));
3964 else if (CONST_DOUBLE_LOW (x
) < 0)
3965 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
,
3966 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_LOW (x
));
3968 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_DOUBLE_LOW (x
));
3971 /* We can't handle floating point constants;
3972 PRINT_OPERAND must handle them. */
3973 output_operand_lossage ("floating constant misused");
3977 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_FIXED_VALUE_LOW (x
));
3981 /* Some assemblers need integer constants to appear last (eg masm). */
3982 if (CONST_INT_P (XEXP (x
, 0)))
3984 output_addr_const (file
, XEXP (x
, 1));
3985 if (INTVAL (XEXP (x
, 0)) >= 0)
3986 fprintf (file
, "+");
3987 output_addr_const (file
, XEXP (x
, 0));
3991 output_addr_const (file
, XEXP (x
, 0));
3992 if (!CONST_INT_P (XEXP (x
, 1))
3993 || INTVAL (XEXP (x
, 1)) >= 0)
3994 fprintf (file
, "+");
3995 output_addr_const (file
, XEXP (x
, 1));
4000 /* Avoid outputting things like x-x or x+5-x,
4001 since some assemblers can't handle that. */
4002 x
= simplify_subtraction (x
);
4003 if (GET_CODE (x
) != MINUS
)
4006 output_addr_const (file
, XEXP (x
, 0));
4007 fprintf (file
, "-");
4008 if ((CONST_INT_P (XEXP (x
, 1)) && INTVAL (XEXP (x
, 1)) >= 0)
4009 || GET_CODE (XEXP (x
, 1)) == PC
4010 || GET_CODE (XEXP (x
, 1)) == SYMBOL_REF
)
4011 output_addr_const (file
, XEXP (x
, 1));
4014 fputs (targetm
.asm_out
.open_paren
, file
);
4015 output_addr_const (file
, XEXP (x
, 1));
4016 fputs (targetm
.asm_out
.close_paren
, file
);
4024 output_addr_const (file
, XEXP (x
, 0));
4028 if (targetm
.asm_out
.output_addr_const_extra (file
, x
))
4031 output_operand_lossage ("invalid expression as operand");
4035 /* Output a quoted string. */
4038 output_quoted_string (FILE *asm_file
, const char *string
)
4040 #ifdef OUTPUT_QUOTED_STRING
4041 OUTPUT_QUOTED_STRING (asm_file
, string
);
4045 putc ('\"', asm_file
);
4046 while ((c
= *string
++) != 0)
4050 if (c
== '\"' || c
== '\\')
4051 putc ('\\', asm_file
);
4055 fprintf (asm_file
, "\\%03o", (unsigned char) c
);
4057 putc ('\"', asm_file
);
4061 /* Write a HOST_WIDE_INT number in hex form 0x1234, fast. */
4064 fprint_whex (FILE *f
, unsigned HOST_WIDE_INT value
)
4066 char buf
[2 + CHAR_BIT
* sizeof (value
) / 4];
4071 char *p
= buf
+ sizeof (buf
);
4073 *--p
= "0123456789abcdef"[value
% 16];
4074 while ((value
/= 16) != 0);
4077 fwrite (p
, 1, buf
+ sizeof (buf
) - p
, f
);
4081 /* Internal function that prints an unsigned long in decimal in reverse.
4082 The output string IS NOT null-terminated. */
4085 sprint_ul_rev (char *s
, unsigned long value
)
4090 s
[i
] = "0123456789"[value
% 10];
4093 /* alternate version, without modulo */
4094 /* oldval = value; */
4096 /* s[i] = "0123456789" [oldval - 10*value]; */
4103 /* Write an unsigned long as decimal to a file, fast. */
4106 fprint_ul (FILE *f
, unsigned long value
)
4108 /* python says: len(str(2**64)) == 20 */
4112 i
= sprint_ul_rev (s
, value
);
4114 /* It's probably too small to bother with string reversal and fputs. */
4123 /* Write an unsigned long as decimal to a string, fast.
4124 s must be wide enough to not overflow, at least 21 chars.
4125 Returns the length of the string (without terminating '\0'). */
4128 sprint_ul (char *s
, unsigned long value
)
4130 int len
= sprint_ul_rev (s
, value
);
4133 std::reverse (s
, s
+ len
);
4137 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
4138 %R prints the value of REGISTER_PREFIX.
4139 %L prints the value of LOCAL_LABEL_PREFIX.
4140 %U prints the value of USER_LABEL_PREFIX.
4141 %I prints the value of IMMEDIATE_PREFIX.
4142 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
4143 Also supported are %d, %i, %u, %x, %X, %o, %c, %s and %%.
4145 We handle alternate assembler dialects here, just like output_asm_insn. */
4148 asm_fprintf (FILE *file
, const char *p
, ...)
4152 #ifdef ASSEMBLER_DIALECT
4157 va_start (argptr
, p
);
4164 #ifdef ASSEMBLER_DIALECT
4168 p
= do_assembler_dialects (p
, &dialect
);
4175 while (strchr ("-+ #0", c
))
4180 while (ISDIGIT (c
) || c
== '.')
4191 case 'd': case 'i': case 'u':
4192 case 'x': case 'X': case 'o':
4196 fprintf (file
, buf
, va_arg (argptr
, int));
4200 /* This is a prefix to the 'd', 'i', 'u', 'x', 'X', and
4201 'o' cases, but we do not check for those cases. It
4202 means that the value is a HOST_WIDE_INT, which may be
4203 either `long' or `long long'. */
4204 memcpy (q
, HOST_WIDE_INT_PRINT
, strlen (HOST_WIDE_INT_PRINT
));
4205 q
+= strlen (HOST_WIDE_INT_PRINT
);
4208 fprintf (file
, buf
, va_arg (argptr
, HOST_WIDE_INT
));
4213 #ifdef HAVE_LONG_LONG
4219 fprintf (file
, buf
, va_arg (argptr
, long long));
4226 fprintf (file
, buf
, va_arg (argptr
, long));
4234 fprintf (file
, buf
, va_arg (argptr
, char *));
4238 #ifdef ASM_OUTPUT_OPCODE
4239 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
4244 #ifdef REGISTER_PREFIX
4245 fprintf (file
, "%s", REGISTER_PREFIX
);
4250 #ifdef IMMEDIATE_PREFIX
4251 fprintf (file
, "%s", IMMEDIATE_PREFIX
);
4256 #ifdef LOCAL_LABEL_PREFIX
4257 fprintf (file
, "%s", LOCAL_LABEL_PREFIX
);
4262 fputs (user_label_prefix
, file
);
4265 #ifdef ASM_FPRINTF_EXTENSIONS
4266 /* Uppercase letters are reserved for general use by asm_fprintf
4267 and so are not available to target specific code. In order to
4268 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
4269 they are defined here. As they get turned into real extensions
4270 to asm_fprintf they should be removed from this list. */
4271 case 'A': case 'B': case 'C': case 'D': case 'E':
4272 case 'F': case 'G': case 'H': case 'J': case 'K':
4273 case 'M': case 'N': case 'P': case 'Q': case 'S':
4274 case 'T': case 'V': case 'W': case 'Y': case 'Z':
4277 ASM_FPRINTF_EXTENSIONS (file
, argptr
, p
)
4290 /* Return nonzero if this function has no function calls. */
4293 leaf_function_p (void)
4297 /* Ensure we walk the entire function body. */
4298 gcc_assert (!in_sequence_p ());
4300 /* Some back-ends (e.g. s390) want leaf functions to stay leaf
4301 functions even if they call mcount. */
4302 if (crtl
->profile
&& !targetm
.keep_leaf_when_profiled ())
4305 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4308 && ! SIBLING_CALL_P (insn
))
4310 if (NONJUMP_INSN_P (insn
)
4311 && GET_CODE (PATTERN (insn
)) == SEQUENCE
4312 && CALL_P (XVECEXP (PATTERN (insn
), 0, 0))
4313 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn
), 0, 0)))
4320 /* Return 1 if branch is a forward branch.
4321 Uses insn_shuid array, so it works only in the final pass. May be used by
4322 output templates to customary add branch prediction hints.
4325 final_forward_branch_p (rtx_insn
*insn
)
4327 int insn_id
, label_id
;
4329 gcc_assert (uid_shuid
);
4330 insn_id
= INSN_SHUID (insn
);
4331 label_id
= INSN_SHUID (JUMP_LABEL (insn
));
4332 /* We've hit some insns that does not have id information available. */
4333 gcc_assert (insn_id
&& label_id
);
4334 return insn_id
< label_id
;
4337 /* On some machines, a function with no call insns
4338 can run faster if it doesn't create its own register window.
4339 When output, the leaf function should use only the "output"
4340 registers. Ordinarily, the function would be compiled to use
4341 the "input" registers to find its arguments; it is a candidate
4342 for leaf treatment if it uses only the "input" registers.
4343 Leaf function treatment means renumbering so the function
4344 uses the "output" registers instead. */
4346 #ifdef LEAF_REGISTERS
4348 /* Return 1 if this function uses only the registers that can be
4349 safely renumbered. */
4352 only_leaf_regs_used (void)
4355 const char *const permitted_reg_in_leaf_functions
= LEAF_REGISTERS
;
4357 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4358 if ((df_regs_ever_live_p (i
) || global_regs
[i
])
4359 && ! permitted_reg_in_leaf_functions
[i
])
4362 if (crtl
->uses_pic_offset_table
4363 && pic_offset_table_rtx
!= 0
4364 && REG_P (pic_offset_table_rtx
)
4365 && ! permitted_reg_in_leaf_functions
[REGNO (pic_offset_table_rtx
)])
4371 /* Scan all instructions and renumber all registers into those
4372 available in leaf functions. */
4375 leaf_renumber_regs (rtx_insn
*first
)
4379 /* Renumber only the actual patterns.
4380 The reg-notes can contain frame pointer refs,
4381 and renumbering them could crash, and should not be needed. */
4382 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
4384 leaf_renumber_regs_insn (PATTERN (insn
));
4387 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4388 available in leaf functions. */
4391 leaf_renumber_regs_insn (rtx in_rtx
)
4394 const char *format_ptr
;
4399 /* Renumber all input-registers into output-registers.
4400 renumbered_regs would be 1 for an output-register;
4407 /* Don't renumber the same reg twice. */
4411 newreg
= REGNO (in_rtx
);
4412 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4413 to reach here as part of a REG_NOTE. */
4414 if (newreg
>= FIRST_PSEUDO_REGISTER
)
4419 newreg
= LEAF_REG_REMAP (newreg
);
4420 gcc_assert (newreg
>= 0);
4421 df_set_regs_ever_live (REGNO (in_rtx
), false);
4422 df_set_regs_ever_live (newreg
, true);
4423 SET_REGNO (in_rtx
, newreg
);
4428 if (INSN_P (in_rtx
))
4430 /* Inside a SEQUENCE, we find insns.
4431 Renumber just the patterns of these insns,
4432 just as we do for the top-level insns. */
4433 leaf_renumber_regs_insn (PATTERN (in_rtx
));
4437 format_ptr
= GET_RTX_FORMAT (GET_CODE (in_rtx
));
4439 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (in_rtx
)); i
++)
4440 switch (*format_ptr
++)
4443 leaf_renumber_regs_insn (XEXP (in_rtx
, i
));
4447 if (NULL
!= XVEC (in_rtx
, i
))
4449 for (j
= 0; j
< XVECLEN (in_rtx
, i
); j
++)
4450 leaf_renumber_regs_insn (XVECEXP (in_rtx
, i
, j
));
4469 /* Turn the RTL into assembly. */
4471 rest_of_handle_final (void)
4473 const char *fnname
= get_fnname_from_decl (current_function_decl
);
4475 assemble_start_function (current_function_decl
, fnname
);
4476 final_start_function (get_insns (), asm_out_file
, optimize
);
4477 final (get_insns (), asm_out_file
, optimize
);
4479 && !lookup_attribute ("noipa", DECL_ATTRIBUTES (current_function_decl
)))
4480 collect_fn_hard_reg_usage ();
4481 final_end_function ();
4483 /* The IA-64 ".handlerdata" directive must be issued before the ".endp"
4484 directive that closes the procedure descriptor. Similarly, for x64 SEH.
4485 Otherwise it's not strictly necessary, but it doesn't hurt either. */
4486 output_function_exception_table (fnname
);
4488 assemble_end_function (current_function_decl
, fnname
);
4490 /* Free up reg info memory. */
4494 fflush (asm_out_file
);
4496 /* Write DBX symbols if requested. */
4498 /* Note that for those inline functions where we don't initially
4499 know for certain that we will be generating an out-of-line copy,
4500 the first invocation of this routine (rest_of_compilation) will
4501 skip over this code by doing a `goto exit_rest_of_compilation;'.
4502 Later on, wrapup_global_declarations will (indirectly) call
4503 rest_of_compilation again for those inline functions that need
4504 to have out-of-line copies generated. During that call, we
4505 *will* be routed past here. */
4507 timevar_push (TV_SYMOUT
);
4508 if (!DECL_IGNORED_P (current_function_decl
))
4509 debug_hooks
->function_decl (current_function_decl
);
4510 timevar_pop (TV_SYMOUT
);
4512 /* Release the blocks that are linked to DECL_INITIAL() to free the memory. */
4513 DECL_INITIAL (current_function_decl
) = error_mark_node
;
4515 if (DECL_STATIC_CONSTRUCTOR (current_function_decl
)
4516 && targetm
.have_ctors_dtors
)
4517 targetm
.asm_out
.constructor (XEXP (DECL_RTL (current_function_decl
), 0),
4518 decl_init_priority_lookup
4519 (current_function_decl
));
4520 if (DECL_STATIC_DESTRUCTOR (current_function_decl
)
4521 && targetm
.have_ctors_dtors
)
4522 targetm
.asm_out
.destructor (XEXP (DECL_RTL (current_function_decl
), 0),
4523 decl_fini_priority_lookup
4524 (current_function_decl
));
4530 const pass_data pass_data_final
=
4532 RTL_PASS
, /* type */
4534 OPTGROUP_NONE
, /* optinfo_flags */
4535 TV_FINAL
, /* tv_id */
4536 0, /* properties_required */
4537 0, /* properties_provided */
4538 0, /* properties_destroyed */
4539 0, /* todo_flags_start */
4540 0, /* todo_flags_finish */
4543 class pass_final
: public rtl_opt_pass
4546 pass_final (gcc::context
*ctxt
)
4547 : rtl_opt_pass (pass_data_final
, ctxt
)
4550 /* opt_pass methods: */
4551 virtual unsigned int execute (function
*) { return rest_of_handle_final (); }
4553 }; // class pass_final
4558 make_pass_final (gcc::context
*ctxt
)
4560 return new pass_final (ctxt
);
4565 rest_of_handle_shorten_branches (void)
4567 /* Shorten branches. */
4568 shorten_branches (get_insns ());
4574 const pass_data pass_data_shorten_branches
=
4576 RTL_PASS
, /* type */
4577 "shorten", /* name */
4578 OPTGROUP_NONE
, /* optinfo_flags */
4579 TV_SHORTEN_BRANCH
, /* tv_id */
4580 0, /* properties_required */
4581 0, /* properties_provided */
4582 0, /* properties_destroyed */
4583 0, /* todo_flags_start */
4584 0, /* todo_flags_finish */
4587 class pass_shorten_branches
: public rtl_opt_pass
4590 pass_shorten_branches (gcc::context
*ctxt
)
4591 : rtl_opt_pass (pass_data_shorten_branches
, ctxt
)
4594 /* opt_pass methods: */
4595 virtual unsigned int execute (function
*)
4597 return rest_of_handle_shorten_branches ();
4600 }; // class pass_shorten_branches
4605 make_pass_shorten_branches (gcc::context
*ctxt
)
4607 return new pass_shorten_branches (ctxt
);
4612 rest_of_clean_state (void)
4614 rtx_insn
*insn
, *next
;
4615 FILE *final_output
= NULL
;
4616 int save_unnumbered
= flag_dump_unnumbered
;
4617 int save_noaddr
= flag_dump_noaddr
;
4619 if (flag_dump_final_insns
)
4621 final_output
= fopen (flag_dump_final_insns
, "a");
4624 error ("could not open final insn dump file %qs: %m",
4625 flag_dump_final_insns
);
4626 flag_dump_final_insns
= NULL
;
4630 flag_dump_noaddr
= flag_dump_unnumbered
= 1;
4631 if (flag_compare_debug_opt
|| flag_compare_debug
)
4632 dump_flags
|= TDF_NOUID
;
4633 dump_function_header (final_output
, current_function_decl
,
4635 final_insns_dump_p
= true;
4637 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4639 INSN_UID (insn
) = CODE_LABEL_NUMBER (insn
);
4643 set_block_for_insn (insn
, NULL
);
4644 INSN_UID (insn
) = 0;
4649 /* It is very important to decompose the RTL instruction chain here:
4650 debug information keeps pointing into CODE_LABEL insns inside the function
4651 body. If these remain pointing to the other insns, we end up preserving
4652 whole RTL chain and attached detailed debug info in memory. */
4653 for (insn
= get_insns (); insn
; insn
= next
)
4655 next
= NEXT_INSN (insn
);
4656 SET_NEXT_INSN (insn
) = NULL
;
4657 SET_PREV_INSN (insn
) = NULL
;
4660 && (!NOTE_P (insn
) ||
4661 (NOTE_KIND (insn
) != NOTE_INSN_VAR_LOCATION
4662 && NOTE_KIND (insn
) != NOTE_INSN_CALL_ARG_LOCATION
4663 && NOTE_KIND (insn
) != NOTE_INSN_BLOCK_BEG
4664 && NOTE_KIND (insn
) != NOTE_INSN_BLOCK_END
4665 && NOTE_KIND (insn
) != NOTE_INSN_DELETED_DEBUG_LABEL
)))
4666 print_rtl_single (final_output
, insn
);
4671 flag_dump_noaddr
= save_noaddr
;
4672 flag_dump_unnumbered
= save_unnumbered
;
4673 final_insns_dump_p
= false;
4675 if (fclose (final_output
))
4677 error ("could not close final insn dump file %qs: %m",
4678 flag_dump_final_insns
);
4679 flag_dump_final_insns
= NULL
;
4683 flag_rerun_cse_after_global_opts
= 0;
4684 reload_completed
= 0;
4685 epilogue_completed
= 0;
4687 regstack_completed
= 0;
4690 /* Clear out the insn_length contents now that they are no
4692 init_insn_lengths ();
4694 /* Show no temporary slots allocated. */
4697 free_bb_for_insn ();
4699 if (cfun
->gimple_df
)
4700 delete_tree_ssa (cfun
);
4702 /* We can reduce stack alignment on call site only when we are sure that
4703 the function body just produced will be actually used in the final
4705 if (decl_binds_to_current_def_p (current_function_decl
))
4707 unsigned int pref
= crtl
->preferred_stack_boundary
;
4708 if (crtl
->stack_alignment_needed
> crtl
->preferred_stack_boundary
)
4709 pref
= crtl
->stack_alignment_needed
;
4710 cgraph_node::rtl_info (current_function_decl
)
4711 ->preferred_incoming_stack_boundary
= pref
;
4714 /* Make sure volatile mem refs aren't considered valid operands for
4715 arithmetic insns. We must call this here if this is a nested inline
4716 function, since the above code leaves us in the init_recog state,
4717 and the function context push/pop code does not save/restore volatile_ok.
4719 ??? Maybe it isn't necessary for expand_start_function to call this
4720 anymore if we do it here? */
4722 init_recog_no_volatile ();
4724 /* We're done with this function. Free up memory if we can. */
4725 free_after_parsing (cfun
);
4726 free_after_compilation (cfun
);
4732 const pass_data pass_data_clean_state
=
4734 RTL_PASS
, /* type */
4735 "*clean_state", /* name */
4736 OPTGROUP_NONE
, /* optinfo_flags */
4737 TV_FINAL
, /* tv_id */
4738 0, /* properties_required */
4739 0, /* properties_provided */
4740 PROP_rtl
, /* properties_destroyed */
4741 0, /* todo_flags_start */
4742 0, /* todo_flags_finish */
4745 class pass_clean_state
: public rtl_opt_pass
4748 pass_clean_state (gcc::context
*ctxt
)
4749 : rtl_opt_pass (pass_data_clean_state
, ctxt
)
4752 /* opt_pass methods: */
4753 virtual unsigned int execute (function
*)
4755 return rest_of_clean_state ();
4758 }; // class pass_clean_state
4763 make_pass_clean_state (gcc::context
*ctxt
)
4765 return new pass_clean_state (ctxt
);
4768 /* Return true if INSN is a call to the current function. */
4771 self_recursive_call_p (rtx_insn
*insn
)
4773 tree fndecl
= get_call_fndecl (insn
);
4774 return (fndecl
== current_function_decl
4775 && decl_binds_to_current_def_p (fndecl
));
4778 /* Collect hard register usage for the current function. */
4781 collect_fn_hard_reg_usage (void)
4787 struct cgraph_rtl_info
*node
;
4788 HARD_REG_SET function_used_regs
;
4790 /* ??? To be removed when all the ports have been fixed. */
4791 if (!targetm
.call_fusage_contains_non_callee_clobbers
)
4794 CLEAR_HARD_REG_SET (function_used_regs
);
4796 for (insn
= get_insns (); insn
!= NULL_RTX
; insn
= next_insn (insn
))
4798 HARD_REG_SET insn_used_regs
;
4800 if (!NONDEBUG_INSN_P (insn
))
4804 && !self_recursive_call_p (insn
))
4806 if (!get_call_reg_set_usage (insn
, &insn_used_regs
,
4810 IOR_HARD_REG_SET (function_used_regs
, insn_used_regs
);
4813 find_all_hard_reg_sets (insn
, &insn_used_regs
, false);
4814 IOR_HARD_REG_SET (function_used_regs
, insn_used_regs
);
4817 /* Be conservative - mark fixed and global registers as used. */
4818 IOR_HARD_REG_SET (function_used_regs
, fixed_reg_set
);
4821 /* Handle STACK_REGS conservatively, since the df-framework does not
4822 provide accurate information for them. */
4824 for (i
= FIRST_STACK_REG
; i
<= LAST_STACK_REG
; i
++)
4825 SET_HARD_REG_BIT (function_used_regs
, i
);
4828 /* The information we have gathered is only interesting if it exposes a
4829 register from the call_used_regs that is not used in this function. */
4830 if (hard_reg_set_subset_p (call_used_reg_set
, function_used_regs
))
4833 node
= cgraph_node::rtl_info (current_function_decl
);
4834 gcc_assert (node
!= NULL
);
4836 COPY_HARD_REG_SET (node
->function_used_regs
, function_used_regs
);
4837 node
->function_used_regs_valid
= 1;
4840 /* Get the declaration of the function called by INSN. */
4843 get_call_fndecl (rtx_insn
*insn
)
4847 note
= find_reg_note (insn
, REG_CALL_DECL
, NULL_RTX
);
4848 if (note
== NULL_RTX
)
4851 datum
= XEXP (note
, 0);
4852 if (datum
!= NULL_RTX
)
4853 return SYMBOL_REF_DECL (datum
);
4858 /* Return the cgraph_rtl_info of the function called by INSN. Returns NULL for
4859 call targets that can be overwritten. */
4861 static struct cgraph_rtl_info
*
4862 get_call_cgraph_rtl_info (rtx_insn
*insn
)
4866 if (insn
== NULL_RTX
)
4869 fndecl
= get_call_fndecl (insn
);
4870 if (fndecl
== NULL_TREE
4871 || !decl_binds_to_current_def_p (fndecl
))
4874 return cgraph_node::rtl_info (fndecl
);
4877 /* Find hard registers used by function call instruction INSN, and return them
4878 in REG_SET. Return DEFAULT_SET in REG_SET if not found. */
4881 get_call_reg_set_usage (rtx_insn
*insn
, HARD_REG_SET
*reg_set
,
4882 HARD_REG_SET default_set
)
4886 struct cgraph_rtl_info
*node
= get_call_cgraph_rtl_info (insn
);
4888 && node
->function_used_regs_valid
)
4890 COPY_HARD_REG_SET (*reg_set
, node
->function_used_regs
);
4891 AND_HARD_REG_SET (*reg_set
, default_set
);
4896 COPY_HARD_REG_SET (*reg_set
, default_set
);