1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987-2021 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"
78 #include "stringpool.h"
82 #include "print-rtl.h"
83 #include "function-abi.h"
84 #include "common/common-target.h"
86 #ifdef XCOFF_DEBUGGING_INFO
87 #include "xcoffout.h" /* Needed for external data declarations. */
90 #include "dwarf2out.h"
92 #ifdef DBX_DEBUGGING_INFO
96 /* Most ports don't need to define CC_STATUS_INIT.
97 So define a null default for it to save conditionalization later. */
98 #ifndef CC_STATUS_INIT
99 #define CC_STATUS_INIT
102 /* Is the given character a logical line separator for the assembler? */
103 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
104 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C, STR) ((C) == ';')
107 #ifndef JUMP_TABLES_IN_TEXT_SECTION
108 #define JUMP_TABLES_IN_TEXT_SECTION 0
111 /* Bitflags used by final_scan_insn. */
113 #define SEEN_EMITTED 2
114 #define SEEN_NEXT_VIEW 4
116 /* Last insn processed by final_scan_insn. */
117 static rtx_insn
*debug_insn
;
118 rtx_insn
*current_output_insn
;
120 /* Line number of last NOTE. */
121 static int last_linenum
;
123 /* Column number of last NOTE. */
124 static int last_columnnum
;
126 /* Discriminator written to assembly. */
127 static int last_discriminator
;
129 /* Discriminator to be written to assembly for current instruction.
130 Note: actual usage depends on loc_discriminator_kind setting. */
131 static int discriminator
;
132 static inline int compute_discriminator (location_t loc
);
134 /* Discriminator identifying current basic block among others sharing
136 static int bb_discriminator
;
138 /* Basic block discriminator for previous instruction. */
139 static int last_bb_discriminator
;
141 /* Highest line number in current block. */
142 static int high_block_linenum
;
144 /* Likewise for function. */
145 static int high_function_linenum
;
147 /* Filename of last NOTE. */
148 static const char *last_filename
;
150 /* Override filename, line and column number. */
151 static const char *override_filename
;
152 static int override_linenum
;
153 static int override_columnnum
;
154 static int override_discriminator
;
156 /* Whether to force emission of a line note before the next insn. */
157 static bool force_source_line
= false;
159 extern const int length_unit_log
; /* This is defined in insn-attrtab.c. */
161 /* Nonzero while outputting an `asm' with operands.
162 This means that inconsistencies are the user's fault, so don't die.
163 The precise value is the insn being output, to pass to error_for_asm. */
164 const rtx_insn
*this_is_asm_operands
;
166 /* Number of operands of this insn, for an `asm' with operands. */
167 static unsigned int insn_noperands
;
169 /* Compare optimization flag. */
171 static rtx last_ignored_compare
= 0;
173 /* Assign a unique number to each insn that is output.
174 This can be used to generate unique local labels. */
176 static int insn_counter
= 0;
178 /* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen. */
180 static int block_depth
;
182 /* Nonzero if have enabled APP processing of our assembler output. */
186 /* If we are outputting an insn sequence, this contains the sequence rtx.
189 rtx_sequence
*final_sequence
;
191 #ifdef ASSEMBLER_DIALECT
193 /* Number of the assembler dialect to use, starting at 0. */
194 static int dialect_number
;
197 /* Nonnull if the insn currently being emitted was a COND_EXEC pattern. */
198 rtx current_insn_predicate
;
200 /* True if printing into -fdump-final-insns= dump. */
201 bool final_insns_dump_p
;
203 /* True if profile_function should be called, but hasn't been called yet. */
204 static bool need_profile_function
;
206 static int asm_insn_count (rtx
);
207 static void profile_function (FILE *);
208 static void profile_after_prologue (FILE *);
209 static bool notice_source_line (rtx_insn
*, bool *);
210 static rtx
walk_alter_subreg (rtx
*, bool *);
211 static void output_asm_name (void);
212 static void output_alternate_entry_point (FILE *, rtx_insn
*);
213 static tree
get_mem_expr_from_op (rtx
, int *);
214 static void output_asm_operand_names (rtx
*, int *, int);
215 #ifdef LEAF_REGISTERS
216 static void leaf_renumber_regs (rtx_insn
*);
218 static int align_fuzz (rtx
, rtx
, int, unsigned);
219 static void collect_fn_hard_reg_usage (void);
221 /* Initialize data in final at the beginning of a compilation. */
224 init_final (const char *filename ATTRIBUTE_UNUSED
)
229 #ifdef ASSEMBLER_DIALECT
230 dialect_number
= ASSEMBLER_DIALECT
;
234 /* Default target function prologue and epilogue assembler output.
236 If not overridden for epilogue code, then the function body itself
237 contains return instructions wherever needed. */
239 default_function_pro_epilogue (FILE *)
244 default_function_switched_text_sections (FILE *file ATTRIBUTE_UNUSED
,
245 tree decl ATTRIBUTE_UNUSED
,
246 bool new_is_cold ATTRIBUTE_UNUSED
)
250 /* Default target hook that outputs nothing to a stream. */
252 no_asm_to_stream (FILE *file ATTRIBUTE_UNUSED
)
256 /* Enable APP processing of subsequent output.
257 Used before the output from an `asm' statement. */
264 fputs (ASM_APP_ON
, asm_out_file
);
269 /* Disable APP processing of subsequent output.
270 Called from varasm.c before most kinds of output. */
277 fputs (ASM_APP_OFF
, asm_out_file
);
282 /* Return the number of slots filled in the current
283 delayed branch sequence (we don't count the insn needing the
284 delay slot). Zero if not in a delayed branch sequence. */
287 dbr_sequence_length (void)
289 if (final_sequence
!= 0)
290 return XVECLEN (final_sequence
, 0) - 1;
295 /* The next two pages contain routines used to compute the length of an insn
296 and to shorten branches. */
298 /* Arrays for insn lengths, and addresses. The latter is referenced by
299 `insn_current_length'. */
301 static int *insn_lengths
;
303 vec
<int> insn_addresses_
;
305 /* Max uid for which the above arrays are valid. */
306 static int insn_lengths_max_uid
;
308 /* Address of insn being processed. Used by `insn_current_length'. */
309 int insn_current_address
;
311 /* Address of insn being processed in previous iteration. */
312 int insn_last_address
;
314 /* known invariant alignment of insn being processed. */
315 int insn_current_align
;
317 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
318 gives the next following alignment insn that increases the known
319 alignment, or NULL_RTX if there is no such insn.
320 For any alignment obtained this way, we can again index uid_align with
321 its uid to obtain the next following align that in turn increases the
322 alignment, till we reach NULL_RTX; the sequence obtained this way
323 for each insn we'll call the alignment chain of this insn in the following
326 static rtx
*uid_align
;
327 static int *uid_shuid
;
328 static vec
<align_flags
> label_align
;
330 /* Indicate that branch shortening hasn't yet been done. */
333 init_insn_lengths (void)
344 insn_lengths_max_uid
= 0;
346 if (HAVE_ATTR_length
)
347 INSN_ADDRESSES_FREE ();
355 /* Obtain the current length of an insn. If branch shortening has been done,
356 get its actual length. Otherwise, use FALLBACK_FN to calculate the
359 get_attr_length_1 (rtx_insn
*insn
, int (*fallback_fn
) (rtx_insn
*))
365 if (!HAVE_ATTR_length
)
368 if (insn_lengths_max_uid
> INSN_UID (insn
))
369 return insn_lengths
[INSN_UID (insn
)];
371 switch (GET_CODE (insn
))
381 length
= fallback_fn (insn
);
385 body
= PATTERN (insn
);
386 if (GET_CODE (body
) == USE
|| GET_CODE (body
) == CLOBBER
)
389 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
390 length
= asm_insn_count (body
) * fallback_fn (insn
);
391 else if (rtx_sequence
*seq
= dyn_cast
<rtx_sequence
*> (body
))
392 for (i
= 0; i
< seq
->len (); i
++)
393 length
+= get_attr_length_1 (seq
->insn (i
), fallback_fn
);
395 length
= fallback_fn (insn
);
402 #ifdef ADJUST_INSN_LENGTH
403 ADJUST_INSN_LENGTH (insn
, length
);
408 /* Obtain the current length of an insn. If branch shortening has been done,
409 get its actual length. Otherwise, get its maximum length. */
411 get_attr_length (rtx_insn
*insn
)
413 return get_attr_length_1 (insn
, insn_default_length
);
416 /* Obtain the current length of an insn. If branch shortening has been done,
417 get its actual length. Otherwise, get its minimum length. */
419 get_attr_min_length (rtx_insn
*insn
)
421 return get_attr_length_1 (insn
, insn_min_length
);
424 /* Code to handle alignment inside shorten_branches. */
426 /* Here is an explanation how the algorithm in align_fuzz can give
429 Call a sequence of instructions beginning with alignment point X
430 and continuing until the next alignment point `block X'. When `X'
431 is used in an expression, it means the alignment value of the
434 Call the distance between the start of the first insn of block X, and
435 the end of the last insn of block X `IX', for the `inner size of X'.
436 This is clearly the sum of the instruction lengths.
438 Likewise with the next alignment-delimited block following X, which we
441 Call the distance between the start of the first insn of block X, and
442 the start of the first insn of block Y `OX', for the `outer size of X'.
444 The estimated padding is then OX - IX.
446 OX can be safely estimated as
451 OX = round_up(IX, X) + Y - X
453 Clearly est(IX) >= real(IX), because that only depends on the
454 instruction lengths, and those being overestimated is a given.
456 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
457 we needn't worry about that when thinking about OX.
459 When X >= Y, the alignment provided by Y adds no uncertainty factor
460 for branch ranges starting before X, so we can just round what we have.
461 But when X < Y, we don't know anything about the, so to speak,
462 `middle bits', so we have to assume the worst when aligning up from an
463 address mod X to one mod Y, which is Y - X. */
466 #define LABEL_ALIGN(LABEL) align_labels
470 #define LOOP_ALIGN(LABEL) align_loops
473 #ifndef LABEL_ALIGN_AFTER_BARRIER
474 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
478 #define JUMP_ALIGN(LABEL) align_jumps
481 #ifndef ADDR_VEC_ALIGN
483 final_addr_vec_align (rtx_jump_table_data
*addr_vec
)
485 int align
= GET_MODE_SIZE (addr_vec
->get_data_mode ());
487 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
488 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
489 return exact_log2 (align
);
493 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
496 #ifndef INSN_LENGTH_ALIGNMENT
497 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
500 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
502 static int min_labelno
, max_labelno
;
504 #define LABEL_TO_ALIGNMENT(LABEL) \
505 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno])
507 /* For the benefit of port specific code do this also as a function. */
510 label_to_alignment (rtx label
)
512 if (CODE_LABEL_NUMBER (label
) <= max_labelno
)
513 return LABEL_TO_ALIGNMENT (label
);
514 return align_flags ();
517 /* The differences in addresses
518 between a branch and its target might grow or shrink depending on
519 the alignment the start insn of the range (the branch for a forward
520 branch or the label for a backward branch) starts out on; if these
521 differences are used naively, they can even oscillate infinitely.
522 We therefore want to compute a 'worst case' address difference that
523 is independent of the alignment the start insn of the range end
524 up on, and that is at least as large as the actual difference.
525 The function align_fuzz calculates the amount we have to add to the
526 naively computed difference, by traversing the part of the alignment
527 chain of the start insn of the range that is in front of the end insn
528 of the range, and considering for each alignment the maximum amount
529 that it might contribute to a size increase.
531 For casesi tables, we also want to know worst case minimum amounts of
532 address difference, in case a machine description wants to introduce
533 some common offset that is added to all offsets in a table.
534 For this purpose, align_fuzz with a growth argument of 0 computes the
535 appropriate adjustment. */
537 /* Compute the maximum delta by which the difference of the addresses of
538 START and END might grow / shrink due to a different address for start
539 which changes the size of alignment insns between START and END.
540 KNOWN_ALIGN_LOG is the alignment known for START.
541 GROWTH should be ~0 if the objective is to compute potential code size
542 increase, and 0 if the objective is to compute potential shrink.
543 The return value is undefined for any other value of GROWTH. */
546 align_fuzz (rtx start
, rtx end
, int known_align_log
, unsigned int growth
)
548 int uid
= INSN_UID (start
);
550 int known_align
= 1 << known_align_log
;
551 int end_shuid
= INSN_SHUID (end
);
554 for (align_label
= uid_align
[uid
]; align_label
; align_label
= uid_align
[uid
])
556 int align_addr
, new_align
;
558 uid
= INSN_UID (align_label
);
559 align_addr
= INSN_ADDRESSES (uid
) - insn_lengths
[uid
];
560 if (uid_shuid
[uid
] > end_shuid
)
562 align_flags alignment
= LABEL_TO_ALIGNMENT (align_label
);
563 new_align
= 1 << alignment
.levels
[0].log
;
564 if (new_align
< known_align
)
566 fuzz
+= (-align_addr
^ growth
) & (new_align
- known_align
);
567 known_align
= new_align
;
572 /* Compute a worst-case reference address of a branch so that it
573 can be safely used in the presence of aligned labels. Since the
574 size of the branch itself is unknown, the size of the branch is
575 not included in the range. I.e. for a forward branch, the reference
576 address is the end address of the branch as known from the previous
577 branch shortening pass, minus a value to account for possible size
578 increase due to alignment. For a backward branch, it is the start
579 address of the branch as known from the current pass, plus a value
580 to account for possible size increase due to alignment.
581 NB.: Therefore, the maximum offset allowed for backward branches needs
582 to exclude the branch size. */
585 insn_current_reference_address (rtx_insn
*branch
)
590 if (! INSN_ADDRESSES_SET_P ())
593 rtx_insn
*seq
= NEXT_INSN (PREV_INSN (branch
));
594 seq_uid
= INSN_UID (seq
);
595 if (!jump_to_label_p (branch
))
596 /* This can happen for example on the PA; the objective is to know the
597 offset to address something in front of the start of the function.
598 Thus, we can treat it like a backward branch.
599 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
600 any alignment we'd encounter, so we skip the call to align_fuzz. */
601 return insn_current_address
;
602 dest
= JUMP_LABEL (branch
);
604 /* BRANCH has no proper alignment chain set, so use SEQ.
605 BRANCH also has no INSN_SHUID. */
606 if (INSN_SHUID (seq
) < INSN_SHUID (dest
))
608 /* Forward branch. */
609 return (insn_last_address
+ insn_lengths
[seq_uid
]
610 - align_fuzz (seq
, dest
, length_unit_log
, ~0));
614 /* Backward branch. */
615 return (insn_current_address
616 + align_fuzz (dest
, seq
, length_unit_log
, ~0));
620 /* Compute branch alignments based on CFG profile. */
623 compute_alignments (void)
626 align_flags max_alignment
;
628 label_align
.truncate (0);
630 max_labelno
= max_label_num ();
631 min_labelno
= get_first_label_num ();
632 label_align
.safe_grow_cleared (max_labelno
- min_labelno
+ 1, true);
634 /* If not optimizing or optimizing for size, don't assign any alignments. */
635 if (! optimize
|| optimize_function_for_size_p (cfun
))
640 dump_reg_info (dump_file
);
641 dump_flow_info (dump_file
, TDF_DETAILS
);
642 flow_loops_dump (dump_file
, NULL
, 1);
644 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
645 profile_count count_threshold
= cfun
->cfg
->count_max
.apply_scale
646 (1, param_align_threshold
);
650 fprintf (dump_file
, "count_max: ");
651 cfun
->cfg
->count_max
.dump (dump_file
);
652 fprintf (dump_file
, "\n");
654 FOR_EACH_BB_FN (bb
, cfun
)
656 rtx_insn
*label
= BB_HEAD (bb
);
657 bool has_fallthru
= 0;
662 || optimize_bb_for_size_p (bb
))
666 "BB %4i loop %2i loop_depth %2i skipped.\n",
668 bb
->loop_father
->num
,
672 max_alignment
= LABEL_ALIGN (label
);
673 profile_count fallthru_count
= profile_count::zero ();
674 profile_count branch_count
= profile_count::zero ();
676 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
678 if (e
->flags
& EDGE_FALLTHRU
)
679 has_fallthru
= 1, fallthru_count
+= e
->count ();
681 branch_count
+= e
->count ();
685 fprintf (dump_file
, "BB %4i loop %2i loop_depth"
687 bb
->index
, bb
->loop_father
->num
,
689 fallthru_count
.dump (dump_file
);
690 fprintf (dump_file
, " branch ");
691 branch_count
.dump (dump_file
);
692 if (!bb
->loop_father
->inner
&& bb
->loop_father
->num
)
693 fprintf (dump_file
, " inner_loop");
694 if (bb
->loop_father
->header
== bb
)
695 fprintf (dump_file
, " loop_header");
696 fprintf (dump_file
, "\n");
698 if (!fallthru_count
.initialized_p () || !branch_count
.initialized_p ())
701 /* There are two purposes to align block with no fallthru incoming edge:
702 1) to avoid fetch stalls when branch destination is near cache boundary
703 2) to improve cache efficiency in case the previous block is not executed
704 (so it does not need to be in the cache).
706 We to catch first case, we align frequently executed blocks.
707 To catch the second, we align blocks that are executed more frequently
708 than the predecessor and the predecessor is likely to not be executed
709 when function is called. */
712 && (branch_count
> count_threshold
713 || (bb
->count
> bb
->prev_bb
->count
.apply_scale (10, 1)
714 && (bb
->prev_bb
->count
715 <= ENTRY_BLOCK_PTR_FOR_FN (cfun
)
716 ->count
.apply_scale (1, 2)))))
718 align_flags alignment
= JUMP_ALIGN (label
);
720 fprintf (dump_file
, " jump alignment added.\n");
721 max_alignment
= align_flags::max (max_alignment
, alignment
);
723 /* In case block is frequent and reached mostly by non-fallthru edge,
724 align it. It is most likely a first block of loop. */
726 && !(single_succ_p (bb
)
727 && single_succ (bb
) == EXIT_BLOCK_PTR_FOR_FN (cfun
))
728 && optimize_bb_for_speed_p (bb
)
729 && branch_count
+ fallthru_count
> count_threshold
731 > fallthru_count
.apply_scale
732 (param_align_loop_iterations
, 1)))
734 align_flags alignment
= LOOP_ALIGN (label
);
736 fprintf (dump_file
, " internal loop alignment added.\n");
737 max_alignment
= align_flags::max (max_alignment
, alignment
);
739 LABEL_TO_ALIGNMENT (label
) = max_alignment
;
742 loop_optimizer_finalize ();
743 free_dominance_info (CDI_DOMINATORS
);
747 /* Grow the LABEL_ALIGN array after new labels are created. */
750 grow_label_align (void)
752 int old
= max_labelno
;
756 max_labelno
= max_label_num ();
758 n_labels
= max_labelno
- min_labelno
+ 1;
759 n_old_labels
= old
- min_labelno
+ 1;
761 label_align
.safe_grow_cleared (n_labels
, true);
763 /* Range of labels grows monotonically in the function. Failing here
764 means that the initialization of array got lost. */
765 gcc_assert (n_old_labels
<= n_labels
);
768 /* Update the already computed alignment information. LABEL_PAIRS is a vector
769 made up of pairs of labels for which the alignment information of the first
770 element will be copied from that of the second element. */
773 update_alignments (vec
<rtx
> &label_pairs
)
776 rtx iter
, label
= NULL_RTX
;
778 if (max_labelno
!= max_label_num ())
781 FOR_EACH_VEC_ELT (label_pairs
, i
, iter
)
783 LABEL_TO_ALIGNMENT (label
) = LABEL_TO_ALIGNMENT (iter
);
790 const pass_data pass_data_compute_alignments
=
793 "alignments", /* name */
794 OPTGROUP_NONE
, /* optinfo_flags */
796 0, /* properties_required */
797 0, /* properties_provided */
798 0, /* properties_destroyed */
799 0, /* todo_flags_start */
800 0, /* todo_flags_finish */
803 class pass_compute_alignments
: public rtl_opt_pass
806 pass_compute_alignments (gcc::context
*ctxt
)
807 : rtl_opt_pass (pass_data_compute_alignments
, ctxt
)
810 /* opt_pass methods: */
811 virtual unsigned int execute (function
*) { return compute_alignments (); }
813 }; // class pass_compute_alignments
818 make_pass_compute_alignments (gcc::context
*ctxt
)
820 return new pass_compute_alignments (ctxt
);
824 /* Make a pass over all insns and compute their actual lengths by shortening
825 any branches of variable length if possible. */
827 /* shorten_branches might be called multiple times: for example, the SH
828 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
829 In order to do this, it needs proper length information, which it obtains
830 by calling shorten_branches. This cannot be collapsed with
831 shorten_branches itself into a single pass unless we also want to integrate
832 reorg.c, since the branch splitting exposes new instructions with delay
836 shorten_branches (rtx_insn
*first
)
842 int something_changed
= 1;
843 char *varying_length
;
846 rtx align_tab
[MAX_CODE_ALIGN
+ 1];
848 /* Compute maximum UID and allocate label_align / uid_shuid. */
849 max_uid
= get_max_uid ();
851 /* Free uid_shuid before reallocating it. */
854 uid_shuid
= XNEWVEC (int, max_uid
);
856 if (max_labelno
!= max_label_num ())
859 /* Initialize label_align and set up uid_shuid to be strictly
860 monotonically rising with insn order. */
861 /* We use alignment here to keep track of the maximum alignment we want to
862 impose on the next CODE_LABEL (or the current one if we are processing
863 the CODE_LABEL itself). */
865 align_flags max_alignment
;
867 for (insn
= get_insns (), i
= 1; insn
; insn
= NEXT_INSN (insn
))
869 INSN_SHUID (insn
) = i
++;
873 if (rtx_code_label
*label
= dyn_cast
<rtx_code_label
*> (insn
))
875 /* Merge in alignments computed by compute_alignments. */
876 align_flags alignment
= LABEL_TO_ALIGNMENT (label
);
877 max_alignment
= align_flags::max (max_alignment
, alignment
);
879 rtx_jump_table_data
*table
= jump_table_for_label (label
);
882 align_flags alignment
= LABEL_ALIGN (label
);
883 max_alignment
= align_flags::max (max_alignment
, alignment
);
885 /* ADDR_VECs only take room if read-only data goes into the text
887 if ((JUMP_TABLES_IN_TEXT_SECTION
888 || readonly_data_section
== text_section
)
891 align_flags alignment
= align_flags (ADDR_VEC_ALIGN (table
));
892 max_alignment
= align_flags::max (max_alignment
, alignment
);
894 LABEL_TO_ALIGNMENT (label
) = max_alignment
;
895 max_alignment
= align_flags ();
897 else if (BARRIER_P (insn
))
901 for (label
= insn
; label
&& ! INSN_P (label
);
902 label
= NEXT_INSN (label
))
905 align_flags alignment
906 = align_flags (LABEL_ALIGN_AFTER_BARRIER (insn
));
907 max_alignment
= align_flags::max (max_alignment
, alignment
);
912 if (!HAVE_ATTR_length
)
915 /* Allocate the rest of the arrays. */
916 insn_lengths
= XNEWVEC (int, max_uid
);
917 insn_lengths_max_uid
= max_uid
;
918 /* Syntax errors can lead to labels being outside of the main insn stream.
919 Initialize insn_addresses, so that we get reproducible results. */
920 INSN_ADDRESSES_ALLOC (max_uid
);
922 varying_length
= XCNEWVEC (char, max_uid
);
924 /* Initialize uid_align. We scan instructions
925 from end to start, and keep in align_tab[n] the last seen insn
926 that does an alignment of at least n+1, i.e. the successor
927 in the alignment chain for an insn that does / has a known
929 uid_align
= XCNEWVEC (rtx
, max_uid
);
931 for (i
= MAX_CODE_ALIGN
+ 1; --i
>= 0;)
932 align_tab
[i
] = NULL_RTX
;
933 seq
= get_last_insn ();
934 for (; seq
; seq
= PREV_INSN (seq
))
936 int uid
= INSN_UID (seq
);
938 log
= (LABEL_P (seq
) ? LABEL_TO_ALIGNMENT (seq
).levels
[0].log
: 0);
939 uid_align
[uid
] = align_tab
[0];
942 /* Found an alignment label. */
943 gcc_checking_assert (log
< MAX_CODE_ALIGN
+ 1);
944 uid_align
[uid
] = align_tab
[log
];
945 for (i
= log
- 1; i
>= 0; i
--)
950 /* When optimizing, we start assuming minimum length, and keep increasing
951 lengths as we find the need for this, till nothing changes.
952 When not optimizing, we start assuming maximum lengths, and
953 do a single pass to update the lengths. */
954 bool increasing
= optimize
!= 0;
956 #ifdef CASE_VECTOR_SHORTEN_MODE
959 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
962 int min_shuid
= INSN_SHUID (get_insns ()) - 1;
963 int max_shuid
= INSN_SHUID (get_last_insn ()) + 1;
966 for (insn
= first
; insn
!= 0; insn
= NEXT_INSN (insn
))
968 rtx min_lab
= NULL_RTX
, max_lab
= NULL_RTX
, pat
;
969 int len
, i
, min
, max
, insn_shuid
;
971 addr_diff_vec_flags flags
;
973 if (! JUMP_TABLE_DATA_P (insn
)
974 || GET_CODE (PATTERN (insn
)) != ADDR_DIFF_VEC
)
976 pat
= PATTERN (insn
);
977 len
= XVECLEN (pat
, 1);
978 gcc_assert (len
> 0);
979 min_align
= MAX_CODE_ALIGN
;
980 for (min
= max_shuid
, max
= min_shuid
, i
= len
- 1; i
>= 0; i
--)
982 rtx lab
= XEXP (XVECEXP (pat
, 1, i
), 0);
983 int shuid
= INSN_SHUID (lab
);
995 int label_alignment
= LABEL_TO_ALIGNMENT (lab
).levels
[0].log
;
996 if (min_align
> label_alignment
)
997 min_align
= label_alignment
;
999 XEXP (pat
, 2) = gen_rtx_LABEL_REF (Pmode
, min_lab
);
1000 XEXP (pat
, 3) = gen_rtx_LABEL_REF (Pmode
, max_lab
);
1001 insn_shuid
= INSN_SHUID (insn
);
1002 rel
= INSN_SHUID (XEXP (XEXP (pat
, 0), 0));
1003 memset (&flags
, 0, sizeof (flags
));
1004 flags
.min_align
= min_align
;
1005 flags
.base_after_vec
= rel
> insn_shuid
;
1006 flags
.min_after_vec
= min
> insn_shuid
;
1007 flags
.max_after_vec
= max
> insn_shuid
;
1008 flags
.min_after_base
= min
> rel
;
1009 flags
.max_after_base
= max
> rel
;
1010 ADDR_DIFF_VEC_FLAGS (pat
) = flags
;
1013 PUT_MODE (pat
, CASE_VECTOR_SHORTEN_MODE (0, 0, pat
));
1016 #endif /* CASE_VECTOR_SHORTEN_MODE */
1018 /* Compute initial lengths, addresses, and varying flags for each insn. */
1019 int (*length_fun
) (rtx_insn
*) = increasing
? insn_min_length
: insn_default_length
;
1021 for (insn_current_address
= 0, insn
= first
;
1023 insn_current_address
+= insn_lengths
[uid
], insn
= NEXT_INSN (insn
))
1025 uid
= INSN_UID (insn
);
1027 insn_lengths
[uid
] = 0;
1031 int log
= LABEL_TO_ALIGNMENT (insn
).levels
[0].log
;
1034 int align
= 1 << log
;
1035 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1036 insn_lengths
[uid
] = new_address
- insn_current_address
;
1040 INSN_ADDRESSES (uid
) = insn_current_address
+ insn_lengths
[uid
];
1042 if (NOTE_P (insn
) || BARRIER_P (insn
)
1043 || LABEL_P (insn
) || DEBUG_INSN_P (insn
))
1045 if (insn
->deleted ())
1048 body
= PATTERN (insn
);
1049 if (rtx_jump_table_data
*table
= dyn_cast
<rtx_jump_table_data
*> (insn
))
1051 /* This only takes room if read-only data goes into the text
1053 if (JUMP_TABLES_IN_TEXT_SECTION
1054 || readonly_data_section
== text_section
)
1055 insn_lengths
[uid
] = (XVECLEN (body
,
1056 GET_CODE (body
) == ADDR_DIFF_VEC
)
1057 * GET_MODE_SIZE (table
->get_data_mode ()));
1058 /* Alignment is handled by ADDR_VEC_ALIGN. */
1060 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
1061 insn_lengths
[uid
] = asm_insn_count (body
) * insn_default_length (insn
);
1062 else if (rtx_sequence
*body_seq
= dyn_cast
<rtx_sequence
*> (body
))
1065 int const_delay_slots
;
1067 const_delay_slots
= const_num_delay_slots (body_seq
->insn (0));
1069 const_delay_slots
= 0;
1071 int (*inner_length_fun
) (rtx_insn
*)
1072 = const_delay_slots
? length_fun
: insn_default_length
;
1073 /* Inside a delay slot sequence, we do not do any branch shortening
1074 if the shortening could change the number of delay slots
1076 for (i
= 0; i
< body_seq
->len (); i
++)
1078 rtx_insn
*inner_insn
= body_seq
->insn (i
);
1079 int inner_uid
= INSN_UID (inner_insn
);
1082 if (GET_CODE (PATTERN (inner_insn
)) == ASM_INPUT
1083 || asm_noperands (PATTERN (inner_insn
)) >= 0)
1084 inner_length
= (asm_insn_count (PATTERN (inner_insn
))
1085 * insn_default_length (inner_insn
));
1087 inner_length
= inner_length_fun (inner_insn
);
1089 insn_lengths
[inner_uid
] = inner_length
;
1090 if (const_delay_slots
)
1092 if ((varying_length
[inner_uid
]
1093 = insn_variable_length_p (inner_insn
)) != 0)
1094 varying_length
[uid
] = 1;
1095 INSN_ADDRESSES (inner_uid
) = (insn_current_address
1096 + insn_lengths
[uid
]);
1099 varying_length
[inner_uid
] = 0;
1100 insn_lengths
[uid
] += inner_length
;
1103 else if (GET_CODE (body
) != USE
&& GET_CODE (body
) != CLOBBER
)
1105 insn_lengths
[uid
] = length_fun (insn
);
1106 varying_length
[uid
] = insn_variable_length_p (insn
);
1109 /* If needed, do any adjustment. */
1110 #ifdef ADJUST_INSN_LENGTH
1111 ADJUST_INSN_LENGTH (insn
, insn_lengths
[uid
]);
1112 if (insn_lengths
[uid
] < 0)
1113 fatal_insn ("negative insn length", insn
);
1117 /* Now loop over all the insns finding varying length insns. For each,
1118 get the current insn length. If it has changed, reflect the change.
1119 When nothing changes for a full pass, we are done. */
1121 while (something_changed
)
1123 something_changed
= 0;
1124 insn_current_align
= MAX_CODE_ALIGN
- 1;
1125 for (insn_current_address
= 0, insn
= first
;
1127 insn
= NEXT_INSN (insn
))
1130 #ifdef ADJUST_INSN_LENGTH
1135 uid
= INSN_UID (insn
);
1137 if (rtx_code_label
*label
= dyn_cast
<rtx_code_label
*> (insn
))
1139 int log
= LABEL_TO_ALIGNMENT (label
).levels
[0].log
;
1141 #ifdef CASE_VECTOR_SHORTEN_MODE
1142 /* If the mode of a following jump table was changed, we
1143 may need to update the alignment of this label. */
1145 if (JUMP_TABLES_IN_TEXT_SECTION
1146 || readonly_data_section
== text_section
)
1148 rtx_jump_table_data
*table
= jump_table_for_label (label
);
1151 int newlog
= ADDR_VEC_ALIGN (table
);
1155 LABEL_TO_ALIGNMENT (insn
) = log
;
1156 something_changed
= 1;
1162 if (log
> insn_current_align
)
1164 int align
= 1 << log
;
1165 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1166 insn_lengths
[uid
] = new_address
- insn_current_address
;
1167 insn_current_align
= log
;
1168 insn_current_address
= new_address
;
1171 insn_lengths
[uid
] = 0;
1172 INSN_ADDRESSES (uid
) = insn_current_address
;
1176 length_align
= INSN_LENGTH_ALIGNMENT (insn
);
1177 if (length_align
< insn_current_align
)
1178 insn_current_align
= length_align
;
1180 insn_last_address
= INSN_ADDRESSES (uid
);
1181 INSN_ADDRESSES (uid
) = insn_current_address
;
1183 #ifdef CASE_VECTOR_SHORTEN_MODE
1185 && JUMP_TABLE_DATA_P (insn
)
1186 && GET_CODE (PATTERN (insn
)) == ADDR_DIFF_VEC
)
1188 rtx_jump_table_data
*table
= as_a
<rtx_jump_table_data
*> (insn
);
1189 rtx body
= PATTERN (insn
);
1190 int old_length
= insn_lengths
[uid
];
1192 safe_as_a
<rtx_insn
*> (XEXP (XEXP (body
, 0), 0));
1193 rtx min_lab
= XEXP (XEXP (body
, 2), 0);
1194 rtx max_lab
= XEXP (XEXP (body
, 3), 0);
1195 int rel_addr
= INSN_ADDRESSES (INSN_UID (rel_lab
));
1196 int min_addr
= INSN_ADDRESSES (INSN_UID (min_lab
));
1197 int max_addr
= INSN_ADDRESSES (INSN_UID (max_lab
));
1200 addr_diff_vec_flags flags
;
1201 scalar_int_mode vec_mode
;
1203 /* Avoid automatic aggregate initialization. */
1204 flags
= ADDR_DIFF_VEC_FLAGS (body
);
1206 /* Try to find a known alignment for rel_lab. */
1207 for (prev
= rel_lab
;
1209 && ! insn_lengths
[INSN_UID (prev
)]
1210 && ! (varying_length
[INSN_UID (prev
)] & 1);
1211 prev
= PREV_INSN (prev
))
1212 if (varying_length
[INSN_UID (prev
)] & 2)
1214 rel_align
= LABEL_TO_ALIGNMENT (prev
).levels
[0].log
;
1218 /* See the comment on addr_diff_vec_flags in rtl.h for the
1219 meaning of the flags values. base: REL_LAB vec: INSN */
1220 /* Anything after INSN has still addresses from the last
1221 pass; adjust these so that they reflect our current
1222 estimate for this pass. */
1223 if (flags
.base_after_vec
)
1224 rel_addr
+= insn_current_address
- insn_last_address
;
1225 if (flags
.min_after_vec
)
1226 min_addr
+= insn_current_address
- insn_last_address
;
1227 if (flags
.max_after_vec
)
1228 max_addr
+= insn_current_address
- insn_last_address
;
1229 /* We want to know the worst case, i.e. lowest possible value
1230 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1231 its offset is positive, and we have to be wary of code shrink;
1232 otherwise, it is negative, and we have to be vary of code
1234 if (flags
.min_after_base
)
1236 /* If INSN is between REL_LAB and MIN_LAB, the size
1237 changes we are about to make can change the alignment
1238 within the observed offset, therefore we have to break
1239 it up into two parts that are independent. */
1240 if (! flags
.base_after_vec
&& flags
.min_after_vec
)
1242 min_addr
-= align_fuzz (rel_lab
, insn
, rel_align
, 0);
1243 min_addr
-= align_fuzz (insn
, min_lab
, 0, 0);
1246 min_addr
-= align_fuzz (rel_lab
, min_lab
, rel_align
, 0);
1250 if (flags
.base_after_vec
&& ! flags
.min_after_vec
)
1252 min_addr
-= align_fuzz (min_lab
, insn
, 0, ~0);
1253 min_addr
-= align_fuzz (insn
, rel_lab
, 0, ~0);
1256 min_addr
-= align_fuzz (min_lab
, rel_lab
, 0, ~0);
1258 /* Likewise, determine the highest lowest possible value
1259 for the offset of MAX_LAB. */
1260 if (flags
.max_after_base
)
1262 if (! flags
.base_after_vec
&& flags
.max_after_vec
)
1264 max_addr
+= align_fuzz (rel_lab
, insn
, rel_align
, ~0);
1265 max_addr
+= align_fuzz (insn
, max_lab
, 0, ~0);
1268 max_addr
+= align_fuzz (rel_lab
, max_lab
, rel_align
, ~0);
1272 if (flags
.base_after_vec
&& ! flags
.max_after_vec
)
1274 max_addr
+= align_fuzz (max_lab
, insn
, 0, 0);
1275 max_addr
+= align_fuzz (insn
, rel_lab
, 0, 0);
1278 max_addr
+= align_fuzz (max_lab
, rel_lab
, 0, 0);
1280 vec_mode
= CASE_VECTOR_SHORTEN_MODE (min_addr
- rel_addr
,
1281 max_addr
- rel_addr
, body
);
1283 || (GET_MODE_SIZE (vec_mode
)
1284 >= GET_MODE_SIZE (table
->get_data_mode ())))
1285 PUT_MODE (body
, vec_mode
);
1286 if (JUMP_TABLES_IN_TEXT_SECTION
1287 || readonly_data_section
== text_section
)
1290 = (XVECLEN (body
, 1)
1291 * GET_MODE_SIZE (table
->get_data_mode ()));
1292 insn_current_address
+= insn_lengths
[uid
];
1293 if (insn_lengths
[uid
] != old_length
)
1294 something_changed
= 1;
1299 #endif /* CASE_VECTOR_SHORTEN_MODE */
1301 if (! (varying_length
[uid
]))
1303 if (NONJUMP_INSN_P (insn
)
1304 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1308 body
= PATTERN (insn
);
1309 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1311 rtx inner_insn
= XVECEXP (body
, 0, i
);
1312 int inner_uid
= INSN_UID (inner_insn
);
1314 INSN_ADDRESSES (inner_uid
) = insn_current_address
;
1316 insn_current_address
+= insn_lengths
[inner_uid
];
1320 insn_current_address
+= insn_lengths
[uid
];
1325 if (NONJUMP_INSN_P (insn
) && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1327 rtx_sequence
*seqn
= as_a
<rtx_sequence
*> (PATTERN (insn
));
1330 body
= PATTERN (insn
);
1332 for (i
= 0; i
< seqn
->len (); i
++)
1334 rtx_insn
*inner_insn
= seqn
->insn (i
);
1335 int inner_uid
= INSN_UID (inner_insn
);
1338 INSN_ADDRESSES (inner_uid
) = insn_current_address
;
1340 /* insn_current_length returns 0 for insns with a
1341 non-varying length. */
1342 if (! varying_length
[inner_uid
])
1343 inner_length
= insn_lengths
[inner_uid
];
1345 inner_length
= insn_current_length (inner_insn
);
1347 if (inner_length
!= insn_lengths
[inner_uid
])
1349 if (!increasing
|| inner_length
> insn_lengths
[inner_uid
])
1351 insn_lengths
[inner_uid
] = inner_length
;
1352 something_changed
= 1;
1355 inner_length
= insn_lengths
[inner_uid
];
1357 insn_current_address
+= inner_length
;
1358 new_length
+= inner_length
;
1363 new_length
= insn_current_length (insn
);
1364 insn_current_address
+= new_length
;
1367 #ifdef ADJUST_INSN_LENGTH
1368 /* If needed, do any adjustment. */
1369 tmp_length
= new_length
;
1370 ADJUST_INSN_LENGTH (insn
, new_length
);
1371 insn_current_address
+= (new_length
- tmp_length
);
1374 if (new_length
!= insn_lengths
[uid
]
1375 && (!increasing
|| new_length
> insn_lengths
[uid
]))
1377 insn_lengths
[uid
] = new_length
;
1378 something_changed
= 1;
1381 insn_current_address
+= insn_lengths
[uid
] - new_length
;
1383 /* For a non-optimizing compile, do only a single pass. */
1387 crtl
->max_insn_address
= insn_current_address
;
1388 free (varying_length
);
1391 /* Given the body of an INSN known to be generated by an ASM statement, return
1392 the number of machine instructions likely to be generated for this insn.
1393 This is used to compute its length. */
1396 asm_insn_count (rtx body
)
1400 if (GET_CODE (body
) == ASM_INPUT
)
1401 templ
= XSTR (body
, 0);
1403 templ
= decode_asm_operands (body
, NULL
, NULL
, NULL
, NULL
, NULL
);
1405 return asm_str_count (templ
);
1408 /* Return the number of machine instructions likely to be generated for the
1409 inline-asm template. */
1411 asm_str_count (const char *templ
)
1418 for (; *templ
; templ
++)
1419 if (IS_ASM_LOGICAL_LINE_SEPARATOR (*templ
, templ
)
1426 /* Return true if DWARF2 debug info can be emitted for DECL. */
1429 dwarf2_debug_info_emitted_p (tree decl
)
1431 if (write_symbols
!= DWARF2_DEBUG
&& write_symbols
!= VMS_AND_DWARF2_DEBUG
)
1434 if (DECL_IGNORED_P (decl
))
1440 /* Return scope resulting from combination of S1 and S2. */
1442 choose_inner_scope (tree s1
, tree s2
)
1448 if (BLOCK_NUMBER (s1
) > BLOCK_NUMBER (s2
))
1453 /* Emit lexical block notes needed to change scope from S1 to S2. */
1456 change_scope (rtx_insn
*orig_insn
, tree s1
, tree s2
)
1458 rtx_insn
*insn
= orig_insn
;
1459 tree com
= NULL_TREE
;
1460 tree ts1
= s1
, ts2
= s2
;
1465 gcc_assert (ts1
&& ts2
);
1466 if (BLOCK_NUMBER (ts1
) > BLOCK_NUMBER (ts2
))
1467 ts1
= BLOCK_SUPERCONTEXT (ts1
);
1468 else if (BLOCK_NUMBER (ts1
) < BLOCK_NUMBER (ts2
))
1469 ts2
= BLOCK_SUPERCONTEXT (ts2
);
1472 ts1
= BLOCK_SUPERCONTEXT (ts1
);
1473 ts2
= BLOCK_SUPERCONTEXT (ts2
);
1482 rtx_note
*note
= emit_note_before (NOTE_INSN_BLOCK_END
, insn
);
1483 NOTE_BLOCK (note
) = s
;
1484 s
= BLOCK_SUPERCONTEXT (s
);
1491 insn
= emit_note_before (NOTE_INSN_BLOCK_BEG
, insn
);
1492 NOTE_BLOCK (insn
) = s
;
1493 s
= BLOCK_SUPERCONTEXT (s
);
1497 /* Rebuild all the NOTE_INSN_BLOCK_BEG and NOTE_INSN_BLOCK_END notes based
1498 on the scope tree and the newly reordered instructions. */
1501 reemit_insn_block_notes (void)
1503 tree cur_block
= DECL_INITIAL (cfun
->decl
);
1506 insn
= get_insns ();
1507 for (; insn
; insn
= NEXT_INSN (insn
))
1511 /* Prevent lexical blocks from straddling section boundaries. */
1513 switch (NOTE_KIND (insn
))
1515 case NOTE_INSN_SWITCH_TEXT_SECTIONS
:
1517 for (tree s
= cur_block
; s
!= DECL_INITIAL (cfun
->decl
);
1518 s
= BLOCK_SUPERCONTEXT (s
))
1520 rtx_note
*note
= emit_note_before (NOTE_INSN_BLOCK_END
, insn
);
1521 NOTE_BLOCK (note
) = s
;
1522 note
= emit_note_after (NOTE_INSN_BLOCK_BEG
, insn
);
1523 NOTE_BLOCK (note
) = s
;
1528 case NOTE_INSN_BEGIN_STMT
:
1529 case NOTE_INSN_INLINE_ENTRY
:
1530 this_block
= LOCATION_BLOCK (NOTE_MARKER_LOCATION (insn
));
1531 goto set_cur_block_to_this_block
;
1537 if (!active_insn_p (insn
))
1540 /* Avoid putting scope notes between jump table and its label. */
1541 if (JUMP_TABLE_DATA_P (insn
))
1544 this_block
= insn_scope (insn
);
1545 /* For sequences compute scope resulting from merging all scopes
1546 of instructions nested inside. */
1547 if (rtx_sequence
*body
= dyn_cast
<rtx_sequence
*> (PATTERN (insn
)))
1552 for (i
= 0; i
< body
->len (); i
++)
1553 this_block
= choose_inner_scope (this_block
,
1554 insn_scope (body
->insn (i
)));
1556 set_cur_block_to_this_block
:
1559 if (INSN_LOCATION (insn
) == UNKNOWN_LOCATION
)
1562 this_block
= DECL_INITIAL (cfun
->decl
);
1565 if (this_block
!= cur_block
)
1567 change_scope (insn
, cur_block
, this_block
);
1568 cur_block
= this_block
;
1572 /* change_scope emits before the insn, not after. */
1573 rtx_note
*note
= emit_note (NOTE_INSN_DELETED
);
1574 change_scope (note
, cur_block
, DECL_INITIAL (cfun
->decl
));
1580 static const char *some_local_dynamic_name
;
1582 /* Locate some local-dynamic symbol still in use by this function
1583 so that we can print its name in local-dynamic base patterns.
1584 Return null if there are no local-dynamic references. */
1587 get_some_local_dynamic_name ()
1589 subrtx_iterator::array_type array
;
1592 if (some_local_dynamic_name
)
1593 return some_local_dynamic_name
;
1595 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
1596 if (NONDEBUG_INSN_P (insn
))
1597 FOR_EACH_SUBRTX (iter
, array
, PATTERN (insn
), ALL
)
1599 const_rtx x
= *iter
;
1600 if (GET_CODE (x
) == SYMBOL_REF
)
1602 if (SYMBOL_REF_TLS_MODEL (x
) == TLS_MODEL_LOCAL_DYNAMIC
)
1603 return some_local_dynamic_name
= XSTR (x
, 0);
1604 if (CONSTANT_POOL_ADDRESS_P (x
))
1605 iter
.substitute (get_pool_constant (x
));
1612 /* Arrange for us to emit a source location note before any further
1613 real insns or section changes, by setting the SEEN_NEXT_VIEW bit in
1614 *SEEN, as long as we are keeping track of location views. The bit
1615 indicates we have referenced the next view at the current PC, so we
1616 have to emit it. This should be called next to the var_location
1620 set_next_view_needed (int *seen
)
1622 if (debug_variable_location_views
)
1623 *seen
|= SEEN_NEXT_VIEW
;
1626 /* Clear the flag in *SEEN indicating we need to emit the next view.
1627 This should be called next to the source_line debug hook. */
1630 clear_next_view_needed (int *seen
)
1632 *seen
&= ~SEEN_NEXT_VIEW
;
1635 /* Test whether we have a pending request to emit the next view in
1636 *SEEN, and emit it if needed, clearing the request bit. */
1639 maybe_output_next_view (int *seen
)
1641 if ((*seen
& SEEN_NEXT_VIEW
) != 0)
1643 clear_next_view_needed (seen
);
1644 (*debug_hooks
->source_line
) (last_linenum
, last_columnnum
,
1645 last_filename
, last_discriminator
,
1650 /* We want to emit param bindings (before the first begin_stmt) in the
1651 initial view, if we are emitting views. To that end, we may
1652 consume initial notes in the function, processing them in
1653 final_start_function, before signaling the beginning of the
1654 prologue, rather than in final.
1656 We don't test whether the DECLs are PARM_DECLs: the assumption is
1657 that there will be a NOTE_INSN_BEGIN_STMT marker before any
1658 non-parameter NOTE_INSN_VAR_LOCATION. It's ok if the marker is not
1659 there, we'll just have more variable locations bound in the initial
1660 view, which is consistent with their being bound without any code
1661 that would give them a value. */
1664 in_initial_view_p (rtx_insn
*insn
)
1666 return (!DECL_IGNORED_P (current_function_decl
)
1667 && debug_variable_location_views
1668 && insn
&& GET_CODE (insn
) == NOTE
1669 && (NOTE_KIND (insn
) == NOTE_INSN_VAR_LOCATION
1670 || NOTE_KIND (insn
) == NOTE_INSN_DELETED
));
1673 /* Output assembler code for the start of a function,
1674 and initialize some of the variables in this file
1675 for the new function. The label for the function and associated
1676 assembler pseudo-ops have already been output in `assemble_start_function'.
1678 FIRST is the first insn of the rtl for the function being compiled.
1679 FILE is the file to write assembler code to.
1680 SEEN should be initially set to zero, and it may be updated to
1681 indicate we have references to the next location view, that would
1682 require us to emit it at the current PC.
1683 OPTIMIZE_P is nonzero if we should eliminate redundant
1684 test and compare insns. */
1687 final_start_function_1 (rtx_insn
**firstp
, FILE *file
, int *seen
,
1688 int optimize_p ATTRIBUTE_UNUSED
)
1692 this_is_asm_operands
= 0;
1694 need_profile_function
= false;
1696 last_filename
= LOCATION_FILE (prologue_location
);
1697 last_linenum
= LOCATION_LINE (prologue_location
);
1698 last_columnnum
= LOCATION_COLUMN (prologue_location
);
1699 last_discriminator
= discriminator
= 0;
1700 last_bb_discriminator
= bb_discriminator
= 0;
1701 force_source_line
= false;
1703 high_block_linenum
= high_function_linenum
= last_linenum
;
1705 if (flag_sanitize
& SANITIZE_ADDRESS
)
1706 asan_function_start ();
1708 rtx_insn
*first
= *firstp
;
1709 if (in_initial_view_p (first
))
1713 final_scan_insn (first
, file
, 0, 0, seen
);
1714 first
= NEXT_INSN (first
);
1716 while (in_initial_view_p (first
));
1720 if (!DECL_IGNORED_P (current_function_decl
))
1721 debug_hooks
->begin_prologue (last_linenum
, last_columnnum
,
1724 if (!dwarf2_debug_info_emitted_p (current_function_decl
))
1725 dwarf2out_begin_prologue (0, 0, NULL
);
1727 #ifdef LEAF_REG_REMAP
1728 if (crtl
->uses_only_leaf_regs
)
1729 leaf_renumber_regs (first
);
1732 /* The Sun386i and perhaps other machines don't work right
1733 if the profiling code comes after the prologue. */
1734 if (targetm
.profile_before_prologue () && crtl
->profile
)
1736 if (targetm
.asm_out
.function_prologue
== default_function_pro_epilogue
1737 && targetm
.have_prologue ())
1740 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1746 else if (NOTE_KIND (insn
) == NOTE_INSN_BASIC_BLOCK
1747 || NOTE_KIND (insn
) == NOTE_INSN_FUNCTION_BEG
)
1749 else if (NOTE_KIND (insn
) == NOTE_INSN_DELETED
1750 || NOTE_KIND (insn
) == NOTE_INSN_VAR_LOCATION
)
1759 need_profile_function
= true;
1761 profile_function (file
);
1764 profile_function (file
);
1767 /* If debugging, assign block numbers to all of the blocks in this
1771 reemit_insn_block_notes ();
1772 number_blocks (current_function_decl
);
1773 /* We never actually put out begin/end notes for the top-level
1774 block in the function. But, conceptually, that block is
1776 TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl
)) = 1;
1779 unsigned HOST_WIDE_INT min_frame_size
1780 = constant_lower_bound (get_frame_size ());
1781 if (min_frame_size
> (unsigned HOST_WIDE_INT
) warn_frame_larger_than_size
)
1783 /* Issue a warning */
1784 warning (OPT_Wframe_larger_than_
,
1785 "the frame size of %wu bytes is larger than %wu bytes",
1786 min_frame_size
, warn_frame_larger_than_size
);
1789 /* First output the function prologue: code to set up the stack frame. */
1790 targetm
.asm_out
.function_prologue (file
);
1792 /* If the machine represents the prologue as RTL, the profiling code must
1793 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1794 if (! targetm
.have_prologue ())
1795 profile_after_prologue (file
);
1798 /* This is an exported final_start_function_1, callable without SEEN. */
1801 final_start_function (rtx_insn
*first
, FILE *file
,
1802 int optimize_p ATTRIBUTE_UNUSED
)
1805 final_start_function_1 (&first
, file
, &seen
, optimize_p
);
1806 gcc_assert (seen
== 0);
1810 profile_after_prologue (FILE *file ATTRIBUTE_UNUSED
)
1812 if (!targetm
.profile_before_prologue () && crtl
->profile
)
1813 profile_function (file
);
1817 profile_function (FILE *file ATTRIBUTE_UNUSED
)
1819 #ifndef NO_PROFILE_COUNTERS
1820 # define NO_PROFILE_COUNTERS 0
1822 #ifdef ASM_OUTPUT_REG_PUSH
1823 rtx sval
= NULL
, chain
= NULL
;
1825 if (cfun
->returns_struct
)
1826 sval
= targetm
.calls
.struct_value_rtx (TREE_TYPE (current_function_decl
),
1828 if (cfun
->static_chain_decl
)
1829 chain
= targetm
.calls
.static_chain (current_function_decl
, true);
1830 #endif /* ASM_OUTPUT_REG_PUSH */
1832 if (! NO_PROFILE_COUNTERS
)
1834 int align
= MIN (BIGGEST_ALIGNMENT
, LONG_TYPE_SIZE
);
1835 switch_to_section (data_section
);
1836 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
1837 targetm
.asm_out
.internal_label (file
, "LP", current_function_funcdef_no
);
1838 assemble_integer (const0_rtx
, LONG_TYPE_SIZE
/ BITS_PER_UNIT
, align
, 1);
1841 switch_to_section (current_function_section ());
1843 #ifdef ASM_OUTPUT_REG_PUSH
1844 if (sval
&& REG_P (sval
))
1845 ASM_OUTPUT_REG_PUSH (file
, REGNO (sval
));
1846 if (chain
&& REG_P (chain
))
1847 ASM_OUTPUT_REG_PUSH (file
, REGNO (chain
));
1850 FUNCTION_PROFILER (file
, current_function_funcdef_no
);
1852 #ifdef ASM_OUTPUT_REG_PUSH
1853 if (chain
&& REG_P (chain
))
1854 ASM_OUTPUT_REG_POP (file
, REGNO (chain
));
1855 if (sval
&& REG_P (sval
))
1856 ASM_OUTPUT_REG_POP (file
, REGNO (sval
));
1860 /* Output assembler code for the end of a function.
1861 For clarity, args are same as those of `final_start_function'
1862 even though not all of them are needed. */
1865 final_end_function (void)
1869 if (!DECL_IGNORED_P (current_function_decl
))
1870 debug_hooks
->end_function (high_function_linenum
);
1872 /* Finally, output the function epilogue:
1873 code to restore the stack frame and return to the caller. */
1874 targetm
.asm_out
.function_epilogue (asm_out_file
);
1876 /* And debug output. */
1877 if (!DECL_IGNORED_P (current_function_decl
))
1878 debug_hooks
->end_epilogue (last_linenum
, last_filename
);
1880 if (!dwarf2_debug_info_emitted_p (current_function_decl
)
1881 && dwarf2out_do_frame ())
1882 dwarf2out_end_epilogue (last_linenum
, last_filename
);
1884 some_local_dynamic_name
= 0;
1888 /* Dumper helper for basic block information. FILE is the assembly
1889 output file, and INSN is the instruction being emitted. */
1892 dump_basic_block_info (FILE *file
, rtx_insn
*insn
, basic_block
*start_to_bb
,
1893 basic_block
*end_to_bb
, int bb_map_size
, int *bb_seqn
)
1897 if (!flag_debug_asm
)
1900 if (INSN_UID (insn
) < bb_map_size
1901 && (bb
= start_to_bb
[INSN_UID (insn
)]) != NULL
)
1906 fprintf (file
, "%s BLOCK %d", ASM_COMMENT_START
, bb
->index
);
1907 if (bb
->count
.initialized_p ())
1909 fprintf (file
, ", count:");
1910 bb
->count
.dump (file
);
1912 fprintf (file
, " seq:%d", (*bb_seqn
)++);
1913 fprintf (file
, "\n%s PRED:", ASM_COMMENT_START
);
1914 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
1916 dump_edge_info (file
, e
, TDF_DETAILS
, 0);
1918 fprintf (file
, "\n");
1920 if (INSN_UID (insn
) < bb_map_size
1921 && (bb
= end_to_bb
[INSN_UID (insn
)]) != NULL
)
1926 fprintf (asm_out_file
, "%s SUCC:", ASM_COMMENT_START
);
1927 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1929 dump_edge_info (asm_out_file
, e
, TDF_DETAILS
, 1);
1931 fprintf (file
, "\n");
1935 /* Output assembler code for some insns: all or part of a function.
1936 For description of args, see `final_start_function', above. */
1939 final_1 (rtx_insn
*first
, FILE *file
, int seen
, int optimize_p
)
1941 rtx_insn
*insn
, *next
;
1943 /* Used for -dA dump. */
1944 basic_block
*start_to_bb
= NULL
;
1945 basic_block
*end_to_bb
= NULL
;
1946 int bb_map_size
= 0;
1949 last_ignored_compare
= 0;
1959 bb_map_size
= get_max_uid () + 1;
1960 start_to_bb
= XCNEWVEC (basic_block
, bb_map_size
);
1961 end_to_bb
= XCNEWVEC (basic_block
, bb_map_size
);
1963 /* There is no cfg for a thunk. */
1964 if (!cfun
->is_thunk
)
1965 FOR_EACH_BB_REVERSE_FN (bb
, cfun
)
1967 start_to_bb
[INSN_UID (BB_HEAD (bb
))] = bb
;
1968 end_to_bb
[INSN_UID (BB_END (bb
))] = bb
;
1972 /* Output the insns. */
1973 for (insn
= first
; insn
;)
1975 if (HAVE_ATTR_length
)
1977 if ((unsigned) INSN_UID (insn
) >= INSN_ADDRESSES_SIZE ())
1979 /* This can be triggered by bugs elsewhere in the compiler if
1980 new insns are created after init_insn_lengths is called. */
1981 gcc_assert (NOTE_P (insn
));
1982 insn_current_address
= -1;
1985 insn_current_address
= INSN_ADDRESSES (INSN_UID (insn
));
1986 /* final can be seen as an iteration of shorten_branches that
1987 does nothing (since a fixed point has already been reached). */
1988 insn_last_address
= insn_current_address
;
1991 dump_basic_block_info (file
, insn
, start_to_bb
, end_to_bb
,
1992 bb_map_size
, &bb_seqn
);
1993 insn
= final_scan_insn (insn
, file
, optimize_p
, 0, &seen
);
1996 maybe_output_next_view (&seen
);
2004 /* Remove CFI notes, to avoid compare-debug failures. */
2005 for (insn
= first
; insn
; insn
= next
)
2007 next
= NEXT_INSN (insn
);
2009 && (NOTE_KIND (insn
) == NOTE_INSN_CFI
2010 || NOTE_KIND (insn
) == NOTE_INSN_CFI_LABEL
))
2015 /* This is an exported final_1, callable without SEEN. */
2018 final (rtx_insn
*first
, FILE *file
, int optimize_p
)
2020 /* Those that use the internal final_start_function_1/final_1 API
2021 skip initial debug bind notes in final_start_function_1, and pass
2022 the modified FIRST to final_1. But those that use the public
2023 final_start_function/final APIs, final_start_function can't move
2024 FIRST because it's not passed by reference, so if they were
2025 skipped there, skip them again here. */
2026 while (in_initial_view_p (first
))
2027 first
= NEXT_INSN (first
);
2029 final_1 (first
, file
, 0, optimize_p
);
2033 get_insn_template (int code
, rtx_insn
*insn
)
2035 switch (insn_data
[code
].output_format
)
2037 case INSN_OUTPUT_FORMAT_SINGLE
:
2038 return insn_data
[code
].output
.single
;
2039 case INSN_OUTPUT_FORMAT_MULTI
:
2040 return insn_data
[code
].output
.multi
[which_alternative
];
2041 case INSN_OUTPUT_FORMAT_FUNCTION
:
2043 return (*insn_data
[code
].output
.function
) (recog_data
.operand
, insn
);
2050 /* Emit the appropriate declaration for an alternate-entry-point
2051 symbol represented by INSN, to FILE. INSN is a CODE_LABEL with
2052 LABEL_KIND != LABEL_NORMAL.
2054 The case fall-through in this function is intentional. */
2056 output_alternate_entry_point (FILE *file
, rtx_insn
*insn
)
2058 const char *name
= LABEL_NAME (insn
);
2060 switch (LABEL_KIND (insn
))
2062 case LABEL_WEAK_ENTRY
:
2063 #ifdef ASM_WEAKEN_LABEL
2064 ASM_WEAKEN_LABEL (file
, name
);
2067 case LABEL_GLOBAL_ENTRY
:
2068 targetm
.asm_out
.globalize_label (file
, name
);
2070 case LABEL_STATIC_ENTRY
:
2071 #ifdef ASM_OUTPUT_TYPE_DIRECTIVE
2072 ASM_OUTPUT_TYPE_DIRECTIVE (file
, name
, "function");
2074 ASM_OUTPUT_LABEL (file
, name
);
2083 /* Given a CALL_INSN, find and return the nested CALL. */
2085 call_from_call_insn (rtx_call_insn
*insn
)
2088 gcc_assert (CALL_P (insn
));
2091 while (GET_CODE (x
) != CALL
)
2093 switch (GET_CODE (x
))
2098 x
= COND_EXEC_CODE (x
);
2101 x
= XVECEXP (x
, 0, 0);
2111 /* Print a comment into the asm showing FILENAME, LINENUM, and the
2112 corresponding source line, if available. */
2115 asm_show_source (const char *filename
, int linenum
)
2120 char_span line
= location_get_source_line (filename
, linenum
);
2124 fprintf (asm_out_file
, "%s %s:%i: ", ASM_COMMENT_START
, filename
, linenum
);
2125 /* "line" is not 0-terminated, so we must use its length. */
2126 fwrite (line
.get_buffer (), 1, line
.length (), asm_out_file
);
2127 fputc ('\n', asm_out_file
);
2130 /* Judge if an absolute jump table is relocatable. */
2133 jumptable_relocatable (void)
2135 bool relocatable
= false;
2137 if (!CASE_VECTOR_PC_RELATIVE
2138 && !targetm
.asm_out
.generate_pic_addr_diff_vec ()
2139 && targetm_common
.have_named_sections
)
2140 relocatable
= targetm
.asm_out
.reloc_rw_mask ();
2145 /* The final scan for one insn, INSN.
2146 Args are same as in `final', except that INSN
2147 is the insn being scanned.
2148 Value returned is the next insn to be scanned.
2150 NOPEEPHOLES is the flag to disallow peephole processing (currently
2151 used for within delayed branch sequence output).
2153 SEEN is used to track the end of the prologue, for emitting
2154 debug information. We force the emission of a line note after
2155 both NOTE_INSN_PROLOGUE_END and NOTE_INSN_FUNCTION_BEG. */
2158 final_scan_insn_1 (rtx_insn
*insn
, FILE *file
, int optimize_p ATTRIBUTE_UNUSED
,
2159 int nopeepholes ATTRIBUTE_UNUSED
, int *seen
)
2162 rtx_jump_table_data
*table
;
2166 /* Ignore deleted insns. These can occur when we split insns (due to a
2167 template of "#") while not optimizing. */
2168 if (insn
->deleted ())
2169 return NEXT_INSN (insn
);
2171 switch (GET_CODE (insn
))
2174 switch (NOTE_KIND (insn
))
2176 case NOTE_INSN_DELETED
:
2177 case NOTE_INSN_UPDATE_SJLJ_CONTEXT
:
2180 case NOTE_INSN_SWITCH_TEXT_SECTIONS
:
2181 maybe_output_next_view (seen
);
2183 output_function_exception_table (0);
2185 if (targetm
.asm_out
.unwind_emit
)
2186 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
2188 in_cold_section_p
= !in_cold_section_p
;
2190 if (in_cold_section_p
)
2192 = clone_function_name (current_function_decl
, "cold");
2194 if (dwarf2out_do_frame ())
2196 dwarf2out_switch_text_section ();
2197 if (!dwarf2_debug_info_emitted_p (current_function_decl
)
2198 && !DECL_IGNORED_P (current_function_decl
))
2199 debug_hooks
->switch_text_section ();
2201 else if (!DECL_IGNORED_P (current_function_decl
))
2202 debug_hooks
->switch_text_section ();
2204 switch_to_section (current_function_section ());
2205 targetm
.asm_out
.function_switched_text_sections (asm_out_file
,
2206 current_function_decl
,
2208 /* Emit a label for the split cold section. Form label name by
2209 suffixing "cold" to the original function's name. */
2210 if (in_cold_section_p
)
2212 #ifdef ASM_DECLARE_COLD_FUNCTION_NAME
2213 ASM_DECLARE_COLD_FUNCTION_NAME (asm_out_file
,
2215 (cold_function_name
),
2216 current_function_decl
);
2218 ASM_OUTPUT_LABEL (asm_out_file
,
2219 IDENTIFIER_POINTER (cold_function_name
));
2221 if (dwarf2out_do_frame ()
2222 && cfun
->fde
->dw_fde_second_begin
!= NULL
)
2223 ASM_OUTPUT_LABEL (asm_out_file
, cfun
->fde
->dw_fde_second_begin
);
2227 case NOTE_INSN_BASIC_BLOCK
:
2228 if (need_profile_function
)
2230 profile_function (asm_out_file
);
2231 need_profile_function
= false;
2234 if (targetm
.asm_out
.unwind_emit
)
2235 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
2237 bb_discriminator
= NOTE_BASIC_BLOCK (insn
)->discriminator
;
2240 case NOTE_INSN_EH_REGION_BEG
:
2241 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LEHB",
2242 NOTE_EH_HANDLER (insn
));
2245 case NOTE_INSN_EH_REGION_END
:
2246 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LEHE",
2247 NOTE_EH_HANDLER (insn
));
2250 case NOTE_INSN_PROLOGUE_END
:
2251 targetm
.asm_out
.function_end_prologue (file
);
2252 profile_after_prologue (file
);
2254 if ((*seen
& (SEEN_EMITTED
| SEEN_NOTE
)) == SEEN_NOTE
)
2256 *seen
|= SEEN_EMITTED
;
2257 force_source_line
= true;
2264 case NOTE_INSN_EPILOGUE_BEG
:
2265 if (!DECL_IGNORED_P (current_function_decl
))
2266 (*debug_hooks
->begin_epilogue
) (last_linenum
, last_filename
);
2267 targetm
.asm_out
.function_begin_epilogue (file
);
2271 dwarf2out_emit_cfi (NOTE_CFI (insn
));
2274 case NOTE_INSN_CFI_LABEL
:
2275 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LCFI",
2276 NOTE_LABEL_NUMBER (insn
));
2279 case NOTE_INSN_FUNCTION_BEG
:
2280 if (need_profile_function
)
2282 profile_function (asm_out_file
);
2283 need_profile_function
= false;
2287 if (!DECL_IGNORED_P (current_function_decl
))
2288 debug_hooks
->end_prologue (last_linenum
, last_filename
);
2290 if ((*seen
& (SEEN_EMITTED
| SEEN_NOTE
)) == SEEN_NOTE
)
2292 *seen
|= SEEN_EMITTED
;
2293 force_source_line
= true;
2300 case NOTE_INSN_BLOCK_BEG
:
2301 if (debug_info_level
== DINFO_LEVEL_NORMAL
2302 || debug_info_level
== DINFO_LEVEL_VERBOSE
2303 || write_symbols
== DWARF2_DEBUG
2304 || write_symbols
== VMS_AND_DWARF2_DEBUG
2305 || write_symbols
== VMS_DEBUG
)
2307 int n
= BLOCK_NUMBER (NOTE_BLOCK (insn
));
2311 high_block_linenum
= last_linenum
;
2313 /* Output debugging info about the symbol-block beginning. */
2314 if (!DECL_IGNORED_P (current_function_decl
))
2315 debug_hooks
->begin_block (last_linenum
, n
);
2317 /* Mark this block as output. */
2318 TREE_ASM_WRITTEN (NOTE_BLOCK (insn
)) = 1;
2319 BLOCK_IN_COLD_SECTION_P (NOTE_BLOCK (insn
)) = in_cold_section_p
;
2321 if (write_symbols
== DBX_DEBUG
)
2323 location_t
*locus_ptr
2324 = block_nonartificial_location (NOTE_BLOCK (insn
));
2326 if (locus_ptr
!= NULL
)
2328 override_filename
= LOCATION_FILE (*locus_ptr
);
2329 override_linenum
= LOCATION_LINE (*locus_ptr
);
2330 override_columnnum
= LOCATION_COLUMN (*locus_ptr
);
2331 override_discriminator
= compute_discriminator (*locus_ptr
);
2336 case NOTE_INSN_BLOCK_END
:
2337 maybe_output_next_view (seen
);
2339 if (debug_info_level
== DINFO_LEVEL_NORMAL
2340 || debug_info_level
== DINFO_LEVEL_VERBOSE
2341 || write_symbols
== DWARF2_DEBUG
2342 || write_symbols
== VMS_AND_DWARF2_DEBUG
2343 || write_symbols
== VMS_DEBUG
)
2345 int n
= BLOCK_NUMBER (NOTE_BLOCK (insn
));
2349 /* End of a symbol-block. */
2351 gcc_assert (block_depth
>= 0);
2353 if (!DECL_IGNORED_P (current_function_decl
))
2354 debug_hooks
->end_block (high_block_linenum
, n
);
2355 gcc_assert (BLOCK_IN_COLD_SECTION_P (NOTE_BLOCK (insn
))
2356 == in_cold_section_p
);
2358 if (write_symbols
== DBX_DEBUG
)
2360 tree outer_block
= BLOCK_SUPERCONTEXT (NOTE_BLOCK (insn
));
2361 location_t
*locus_ptr
2362 = block_nonartificial_location (outer_block
);
2364 if (locus_ptr
!= NULL
)
2366 override_filename
= LOCATION_FILE (*locus_ptr
);
2367 override_linenum
= LOCATION_LINE (*locus_ptr
);
2368 override_columnnum
= LOCATION_COLUMN (*locus_ptr
);
2369 override_discriminator
= compute_discriminator (*locus_ptr
);
2373 override_filename
= NULL
;
2374 override_linenum
= 0;
2375 override_columnnum
= 0;
2376 override_discriminator
= 0;
2381 case NOTE_INSN_DELETED_LABEL
:
2382 /* Emit the label. We may have deleted the CODE_LABEL because
2383 the label could be proved to be unreachable, though still
2384 referenced (in the form of having its address taken. */
2385 ASM_OUTPUT_DEBUG_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
2388 case NOTE_INSN_DELETED_DEBUG_LABEL
:
2389 /* Similarly, but need to use different namespace for it. */
2390 if (CODE_LABEL_NUMBER (insn
) != -1)
2391 ASM_OUTPUT_DEBUG_LABEL (file
, "LDL", CODE_LABEL_NUMBER (insn
));
2394 case NOTE_INSN_VAR_LOCATION
:
2395 if (!DECL_IGNORED_P (current_function_decl
))
2397 debug_hooks
->var_location (insn
);
2398 set_next_view_needed (seen
);
2402 case NOTE_INSN_BEGIN_STMT
:
2403 gcc_checking_assert (cfun
->debug_nonbind_markers
);
2404 if (!DECL_IGNORED_P (current_function_decl
)
2405 && notice_source_line (insn
, NULL
))
2408 (*debug_hooks
->source_line
) (last_linenum
, last_columnnum
,
2409 last_filename
, last_discriminator
,
2411 clear_next_view_needed (seen
);
2415 case NOTE_INSN_INLINE_ENTRY
:
2416 gcc_checking_assert (cfun
->debug_nonbind_markers
);
2417 if (!DECL_IGNORED_P (current_function_decl
)
2418 && notice_source_line (insn
, NULL
))
2420 (*debug_hooks
->inline_entry
) (LOCATION_BLOCK
2421 (NOTE_MARKER_LOCATION (insn
)));
2422 goto output_source_line
;
2436 /* The target port might emit labels in the output function for
2437 some insn, e.g. sh.c output_branchy_insn. */
2438 if (CODE_LABEL_NUMBER (insn
) <= max_labelno
)
2440 align_flags alignment
= LABEL_TO_ALIGNMENT (insn
);
2441 if (alignment
.levels
[0].log
&& NEXT_INSN (insn
))
2443 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2444 /* Output both primary and secondary alignment. */
2445 ASM_OUTPUT_MAX_SKIP_ALIGN (file
, alignment
.levels
[0].log
,
2446 alignment
.levels
[0].maxskip
);
2447 ASM_OUTPUT_MAX_SKIP_ALIGN (file
, alignment
.levels
[1].log
,
2448 alignment
.levels
[1].maxskip
);
2450 #ifdef ASM_OUTPUT_ALIGN_WITH_NOP
2451 ASM_OUTPUT_ALIGN_WITH_NOP (file
, alignment
.levels
[0].log
);
2453 ASM_OUTPUT_ALIGN (file
, alignment
.levels
[0].log
);
2460 if (!DECL_IGNORED_P (current_function_decl
) && LABEL_NAME (insn
))
2461 debug_hooks
->label (as_a
<rtx_code_label
*> (insn
));
2465 /* If this label is followed by a jump-table, make sure we put
2466 the label in the read-only section. Also possibly write the
2467 label and jump table together. */
2468 table
= jump_table_for_label (as_a
<rtx_code_label
*> (insn
));
2471 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2472 /* In this case, the case vector is being moved by the
2473 target, so don't output the label at all. Leave that
2474 to the back end macros. */
2476 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2480 switch_to_section (targetm
.asm_out
.function_rodata_section
2481 (current_function_decl
,
2482 jumptable_relocatable ()));
2484 #ifdef ADDR_VEC_ALIGN
2485 log_align
= ADDR_VEC_ALIGN (table
);
2487 log_align
= exact_log2 (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
);
2489 ASM_OUTPUT_ALIGN (file
, log_align
);
2492 switch_to_section (current_function_section ());
2494 #ifdef ASM_OUTPUT_CASE_LABEL
2495 ASM_OUTPUT_CASE_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
), table
);
2497 targetm
.asm_out
.internal_label (file
, "L", CODE_LABEL_NUMBER (insn
));
2502 if (LABEL_ALT_ENTRY_P (insn
))
2503 output_alternate_entry_point (file
, insn
);
2505 targetm
.asm_out
.internal_label (file
, "L", CODE_LABEL_NUMBER (insn
));
2510 rtx body
= PATTERN (insn
);
2511 int insn_code_number
;
2513 bool is_stmt
, *is_stmt_p
;
2515 if (MAY_HAVE_DEBUG_MARKER_INSNS
&& cfun
->debug_nonbind_markers
)
2521 is_stmt_p
= &is_stmt
;
2523 /* Reset this early so it is correct for ASM statements. */
2524 current_insn_predicate
= NULL_RTX
;
2526 /* An INSN, JUMP_INSN or CALL_INSN.
2527 First check for special kinds that recog doesn't recognize. */
2529 if (GET_CODE (body
) == USE
/* These are just declarations. */
2530 || GET_CODE (body
) == CLOBBER
)
2533 /* Detect insns that are really jump-tables
2534 and output them as such. */
2536 if (JUMP_TABLE_DATA_P (insn
))
2538 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2542 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2543 switch_to_section (targetm
.asm_out
.function_rodata_section
2544 (current_function_decl
,
2545 jumptable_relocatable ()));
2547 switch_to_section (current_function_section ());
2551 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2552 if (GET_CODE (body
) == ADDR_VEC
)
2554 #ifdef ASM_OUTPUT_ADDR_VEC
2555 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn
), body
);
2562 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2563 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn
), body
);
2569 vlen
= XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
);
2570 for (idx
= 0; idx
< vlen
; idx
++)
2572 if (GET_CODE (body
) == ADDR_VEC
)
2574 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2575 ASM_OUTPUT_ADDR_VEC_ELT
2576 (file
, CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 0, idx
), 0)));
2583 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2584 ASM_OUTPUT_ADDR_DIFF_ELT
2587 CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 1, idx
), 0)),
2588 CODE_LABEL_NUMBER (XEXP (XEXP (body
, 0), 0)));
2594 #ifdef ASM_OUTPUT_CASE_END
2595 ASM_OUTPUT_CASE_END (file
,
2596 CODE_LABEL_NUMBER (PREV_INSN (insn
)),
2601 switch_to_section (current_function_section ());
2603 if (debug_variable_location_views
2604 && !DECL_IGNORED_P (current_function_decl
))
2605 debug_hooks
->var_location (insn
);
2609 /* Output this line note if it is the first or the last line
2611 if (!DECL_IGNORED_P (current_function_decl
)
2612 && notice_source_line (insn
, is_stmt_p
))
2614 if (flag_verbose_asm
)
2615 asm_show_source (last_filename
, last_linenum
);
2616 (*debug_hooks
->source_line
) (last_linenum
, last_columnnum
,
2617 last_filename
, last_discriminator
,
2619 clear_next_view_needed (seen
);
2622 maybe_output_next_view (seen
);
2624 gcc_checking_assert (!DEBUG_INSN_P (insn
));
2626 if (GET_CODE (body
) == PARALLEL
2627 && GET_CODE (XVECEXP (body
, 0, 0)) == ASM_INPUT
)
2628 body
= XVECEXP (body
, 0, 0);
2630 if (GET_CODE (body
) == ASM_INPUT
)
2632 const char *string
= XSTR (body
, 0);
2634 /* There's no telling what that did to the condition codes. */
2639 expanded_location loc
;
2642 loc
= expand_location (ASM_INPUT_SOURCE_LOCATION (body
));
2643 if (*loc
.file
&& loc
.line
)
2644 fprintf (asm_out_file
, "%s %i \"%s\" 1\n",
2645 ASM_COMMENT_START
, loc
.line
, loc
.file
);
2646 fprintf (asm_out_file
, "\t%s\n", string
);
2647 #if HAVE_AS_LINE_ZERO
2648 if (*loc
.file
&& loc
.line
)
2649 fprintf (asm_out_file
, "%s 0 \"\" 2\n", ASM_COMMENT_START
);
2655 /* Detect `asm' construct with operands. */
2656 if (asm_noperands (body
) >= 0)
2658 unsigned int noperands
= asm_noperands (body
);
2659 rtx
*ops
= XALLOCAVEC (rtx
, noperands
);
2662 expanded_location expanded
;
2664 /* There's no telling what that did to the condition codes. */
2667 /* Get out the operand values. */
2668 string
= decode_asm_operands (body
, ops
, NULL
, NULL
, NULL
, &loc
);
2669 /* Inhibit dying on what would otherwise be compiler bugs. */
2670 insn_noperands
= noperands
;
2671 this_is_asm_operands
= insn
;
2672 expanded
= expand_location (loc
);
2674 #ifdef FINAL_PRESCAN_INSN
2675 FINAL_PRESCAN_INSN (insn
, ops
, insn_noperands
);
2678 /* Output the insn using them. */
2682 if (expanded
.file
&& expanded
.line
)
2683 fprintf (asm_out_file
, "%s %i \"%s\" 1\n",
2684 ASM_COMMENT_START
, expanded
.line
, expanded
.file
);
2685 output_asm_insn (string
, ops
);
2686 #if HAVE_AS_LINE_ZERO
2687 if (expanded
.file
&& expanded
.line
)
2688 fprintf (asm_out_file
, "%s 0 \"\" 2\n", ASM_COMMENT_START
);
2692 if (targetm
.asm_out
.final_postscan_insn
)
2693 targetm
.asm_out
.final_postscan_insn (file
, insn
, ops
,
2696 this_is_asm_operands
= 0;
2702 if (rtx_sequence
*seq
= dyn_cast
<rtx_sequence
*> (body
))
2704 /* A delayed-branch sequence */
2707 final_sequence
= seq
;
2709 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2710 force the restoration of a comparison that was previously
2711 thought unnecessary. If that happens, cancel this sequence
2712 and cause that insn to be restored. */
2714 next
= final_scan_insn (seq
->insn (0), file
, 0, 1, seen
);
2715 if (next
!= seq
->insn (1))
2721 for (i
= 1; i
< seq
->len (); i
++)
2723 rtx_insn
*insn
= seq
->insn (i
);
2724 rtx_insn
*next
= NEXT_INSN (insn
);
2725 /* We loop in case any instruction in a delay slot gets
2728 insn
= final_scan_insn (insn
, file
, 0, 1, seen
);
2729 while (insn
!= next
);
2731 #ifdef DBR_OUTPUT_SEQEND
2732 DBR_OUTPUT_SEQEND (file
);
2736 /* If the insn requiring the delay slot was a CALL_INSN, the
2737 insns in the delay slot are actually executed before the
2738 called function. Hence we don't preserve any CC-setting
2739 actions in these insns and the CC must be marked as being
2740 clobbered by the function. */
2741 if (CALL_P (seq
->insn (0)))
2748 /* We have a real machine instruction as rtl. */
2750 body
= PATTERN (insn
);
2752 /* Do machine-specific peephole optimizations if desired. */
2754 if (HAVE_peephole
&& optimize_p
&& !flag_no_peephole
&& !nopeepholes
)
2756 rtx_insn
*next
= peephole (insn
);
2757 /* When peepholing, if there were notes within the peephole,
2758 emit them before the peephole. */
2759 if (next
!= 0 && next
!= NEXT_INSN (insn
))
2761 rtx_insn
*note
, *prev
= PREV_INSN (insn
);
2763 for (note
= NEXT_INSN (insn
); note
!= next
;
2764 note
= NEXT_INSN (note
))
2765 final_scan_insn (note
, file
, optimize_p
, nopeepholes
, seen
);
2767 /* Put the notes in the proper position for a later
2768 rescan. For example, the SH target can do this
2769 when generating a far jump in a delayed branch
2771 note
= NEXT_INSN (insn
);
2772 SET_PREV_INSN (note
) = prev
;
2773 SET_NEXT_INSN (prev
) = note
;
2774 SET_NEXT_INSN (PREV_INSN (next
)) = insn
;
2775 SET_PREV_INSN (insn
) = PREV_INSN (next
);
2776 SET_NEXT_INSN (insn
) = next
;
2777 SET_PREV_INSN (next
) = insn
;
2780 /* PEEPHOLE might have changed this. */
2781 body
= PATTERN (insn
);
2784 /* Try to recognize the instruction.
2785 If successful, verify that the operands satisfy the
2786 constraints for the instruction. Crash if they don't,
2787 since `reload' should have changed them so that they do. */
2789 insn_code_number
= recog_memoized (insn
);
2790 cleanup_subreg_operands (insn
);
2792 /* Dump the insn in the assembly for debugging (-dAP).
2793 If the final dump is requested as slim RTL, dump slim
2794 RTL to the assembly file also. */
2795 if (flag_dump_rtl_in_asm
)
2797 print_rtx_head
= ASM_COMMENT_START
;
2798 if (! (dump_flags
& TDF_SLIM
))
2799 print_rtl_single (asm_out_file
, insn
);
2801 dump_insn_slim (asm_out_file
, insn
);
2802 print_rtx_head
= "";
2805 if (! constrain_operands_cached (insn
, 1))
2806 fatal_insn_not_found (insn
);
2808 /* Some target machines need to prescan each insn before
2811 #ifdef FINAL_PRESCAN_INSN
2812 FINAL_PRESCAN_INSN (insn
, recog_data
.operand
, recog_data
.n_operands
);
2815 if (targetm
.have_conditional_execution ()
2816 && GET_CODE (PATTERN (insn
)) == COND_EXEC
)
2817 current_insn_predicate
= COND_EXEC_TEST (PATTERN (insn
));
2819 current_output_insn
= debug_insn
= insn
;
2821 /* Find the proper template for this insn. */
2822 templ
= get_insn_template (insn_code_number
, insn
);
2824 /* If the C code returns 0, it means that it is a jump insn
2825 which follows a deleted test insn, and that test insn
2826 needs to be reinserted. */
2831 gcc_assert (prev_nonnote_insn (insn
) == last_ignored_compare
);
2833 /* We have already processed the notes between the setter and
2834 the user. Make sure we don't process them again, this is
2835 particularly important if one of the notes is a block
2836 scope note or an EH note. */
2838 prev
!= last_ignored_compare
;
2839 prev
= PREV_INSN (prev
))
2842 delete_insn (prev
); /* Use delete_note. */
2848 /* If the template is the string "#", it means that this insn must
2850 if (templ
[0] == '#' && templ
[1] == '\0')
2852 rtx_insn
*new_rtx
= try_split (body
, insn
, 0);
2854 /* If we didn't split the insn, go away. */
2855 if (new_rtx
== insn
&& PATTERN (new_rtx
) == body
)
2856 fatal_insn ("could not split insn", insn
);
2858 /* If we have a length attribute, this instruction should have
2859 been split in shorten_branches, to ensure that we would have
2860 valid length info for the splitees. */
2861 gcc_assert (!HAVE_ATTR_length
);
2866 /* ??? This will put the directives in the wrong place if
2867 get_insn_template outputs assembly directly. However calling it
2868 before get_insn_template breaks if the insns is split. */
2869 if (targetm
.asm_out
.unwind_emit_before_insn
2870 && targetm
.asm_out
.unwind_emit
)
2871 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
2873 rtx_call_insn
*call_insn
= dyn_cast
<rtx_call_insn
*> (insn
);
2874 if (call_insn
!= NULL
)
2876 rtx x
= call_from_call_insn (call_insn
);
2878 if (x
&& MEM_P (x
) && GET_CODE (XEXP (x
, 0)) == SYMBOL_REF
)
2882 t
= SYMBOL_REF_DECL (x
);
2884 assemble_external (t
);
2888 /* Output assembler code from the template. */
2889 output_asm_insn (templ
, recog_data
.operand
);
2891 /* Some target machines need to postscan each insn after
2893 if (targetm
.asm_out
.final_postscan_insn
)
2894 targetm
.asm_out
.final_postscan_insn (file
, insn
, recog_data
.operand
,
2895 recog_data
.n_operands
);
2897 if (!targetm
.asm_out
.unwind_emit_before_insn
2898 && targetm
.asm_out
.unwind_emit
)
2899 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
2901 /* Let the debug info back-end know about this call. We do this only
2902 after the instruction has been emitted because labels that may be
2903 created to reference the call instruction must appear after it. */
2904 if ((debug_variable_location_views
|| call_insn
!= NULL
)
2905 && !DECL_IGNORED_P (current_function_decl
))
2906 debug_hooks
->var_location (insn
);
2908 current_output_insn
= debug_insn
= 0;
2911 return NEXT_INSN (insn
);
2914 /* This is a wrapper around final_scan_insn_1 that allows ports to
2915 call it recursively without a known value for SEEN. The value is
2916 saved at the outermost call, and recovered for recursive calls.
2917 Recursive calls MUST pass NULL, or the same pointer if they can
2918 otherwise get to it. */
2921 final_scan_insn (rtx_insn
*insn
, FILE *file
, int optimize_p
,
2922 int nopeepholes
, int *seen
)
2924 static int *enclosing_seen
;
2925 static int recursion_counter
;
2927 gcc_assert (seen
|| recursion_counter
);
2928 gcc_assert (!recursion_counter
|| !seen
|| seen
== enclosing_seen
);
2930 if (!recursion_counter
++)
2931 enclosing_seen
= seen
;
2933 seen
= enclosing_seen
;
2935 rtx_insn
*ret
= final_scan_insn_1 (insn
, file
, optimize_p
, nopeepholes
, seen
);
2937 if (!--recursion_counter
)
2938 enclosing_seen
= NULL
;
2945 /* Map DECLs to instance discriminators. This is allocated and
2946 defined in ada/gcc-interfaces/trans.c, when compiling with -gnateS.
2947 Mappings from this table are saved and restored for LTO, so
2948 link-time compilation will have this map set, at least in
2949 partitions containing at least one DECL with an associated instance
2952 decl_to_instance_map_t
*decl_to_instance_map
;
2954 /* Return the instance number assigned to DECL. */
2957 map_decl_to_instance (const_tree decl
)
2961 if (!decl_to_instance_map
|| !decl
|| !DECL_P (decl
))
2964 inst
= decl_to_instance_map
->get (decl
);
2972 /* Set DISCRIMINATOR to the appropriate value, possibly derived from LOC. */
2975 compute_discriminator (location_t loc
)
2979 if (!decl_to_instance_map
)
2980 discriminator
= bb_discriminator
;
2983 tree block
= LOCATION_BLOCK (loc
);
2985 while (block
&& TREE_CODE (block
) == BLOCK
2986 && !inlined_function_outer_scope_p (block
))
2987 block
= BLOCK_SUPERCONTEXT (block
);
2992 decl
= current_function_decl
;
2993 else if (DECL_P (block
))
2996 decl
= block_ultimate_origin (block
);
2998 discriminator
= map_decl_to_instance (decl
);
3001 return discriminator
;
3004 /* Return whether a source line note needs to be emitted before INSN.
3005 Sets IS_STMT to TRUE if the line should be marked as a possible
3006 breakpoint location. */
3009 notice_source_line (rtx_insn
*insn
, bool *is_stmt
)
3011 const char *filename
;
3012 int linenum
, columnnum
;
3014 if (NOTE_MARKER_P (insn
))
3016 location_t loc
= NOTE_MARKER_LOCATION (insn
);
3017 expanded_location xloc
= expand_location (loc
);
3019 && (LOCATION_LOCUS (loc
) == UNKNOWN_LOCATION
3020 || LOCATION_LOCUS (loc
) == BUILTINS_LOCATION
))
3023 filename
= xloc
.file
;
3024 linenum
= xloc
.line
;
3025 columnnum
= xloc
.column
;
3026 discriminator
= compute_discriminator (loc
);
3027 force_source_line
= true;
3029 else if (override_filename
)
3031 filename
= override_filename
;
3032 linenum
= override_linenum
;
3033 columnnum
= override_columnnum
;
3034 discriminator
= override_discriminator
;
3036 else if (INSN_HAS_LOCATION (insn
))
3038 expanded_location xloc
= insn_location (insn
);
3039 filename
= xloc
.file
;
3040 linenum
= xloc
.line
;
3041 columnnum
= xloc
.column
;
3042 discriminator
= compute_discriminator (INSN_LOCATION (insn
));
3052 if (filename
== NULL
)
3055 if (force_source_line
3056 || filename
!= last_filename
3057 || last_linenum
!= linenum
3058 || (debug_column_info
&& last_columnnum
!= columnnum
))
3060 force_source_line
= false;
3061 last_filename
= filename
;
3062 last_linenum
= linenum
;
3063 last_columnnum
= columnnum
;
3064 last_discriminator
= discriminator
;
3067 high_block_linenum
= MAX (last_linenum
, high_block_linenum
);
3068 high_function_linenum
= MAX (last_linenum
, high_function_linenum
);
3072 if (SUPPORTS_DISCRIMINATOR
&& last_discriminator
!= discriminator
)
3074 /* If the discriminator changed, but the line number did not,
3075 output the line table entry with is_stmt false so the
3076 debugger does not treat this as a breakpoint location. */
3077 last_discriminator
= discriminator
;
3086 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3087 directly to the desired hard register. */
3090 cleanup_subreg_operands (rtx_insn
*insn
)
3093 bool changed
= false;
3094 extract_insn_cached (insn
);
3095 for (i
= 0; i
< recog_data
.n_operands
; i
++)
3097 /* The following test cannot use recog_data.operand when testing
3098 for a SUBREG: the underlying object might have been changed
3099 already if we are inside a match_operator expression that
3100 matches the else clause. Instead we test the underlying
3101 expression directly. */
3102 if (GET_CODE (*recog_data
.operand_loc
[i
]) == SUBREG
)
3104 recog_data
.operand
[i
] = alter_subreg (recog_data
.operand_loc
[i
], true);
3107 else if (GET_CODE (recog_data
.operand
[i
]) == PLUS
3108 || GET_CODE (recog_data
.operand
[i
]) == MULT
3109 || MEM_P (recog_data
.operand
[i
]))
3110 recog_data
.operand
[i
] = walk_alter_subreg (recog_data
.operand_loc
[i
], &changed
);
3113 for (i
= 0; i
< recog_data
.n_dups
; i
++)
3115 if (GET_CODE (*recog_data
.dup_loc
[i
]) == SUBREG
)
3117 *recog_data
.dup_loc
[i
] = alter_subreg (recog_data
.dup_loc
[i
], true);
3120 else if (GET_CODE (*recog_data
.dup_loc
[i
]) == PLUS
3121 || GET_CODE (*recog_data
.dup_loc
[i
]) == MULT
3122 || MEM_P (*recog_data
.dup_loc
[i
]))
3123 *recog_data
.dup_loc
[i
] = walk_alter_subreg (recog_data
.dup_loc
[i
], &changed
);
3126 df_insn_rescan (insn
);
3129 /* If X is a SUBREG, try to replace it with a REG or a MEM, based on
3130 the thing it is a subreg of. Do it anyway if FINAL_P. */
3133 alter_subreg (rtx
*xp
, bool final_p
)
3136 rtx y
= SUBREG_REG (x
);
3138 /* simplify_subreg does not remove subreg from volatile references.
3139 We are required to. */
3142 poly_int64 offset
= SUBREG_BYTE (x
);
3144 /* For paradoxical subregs on big-endian machines, SUBREG_BYTE
3145 contains 0 instead of the proper offset. See simplify_subreg. */
3146 if (paradoxical_subreg_p (x
))
3147 offset
= byte_lowpart_offset (GET_MODE (x
), GET_MODE (y
));
3150 *xp
= adjust_address (y
, GET_MODE (x
), offset
);
3152 *xp
= adjust_address_nv (y
, GET_MODE (x
), offset
);
3154 else if (REG_P (y
) && HARD_REGISTER_P (y
))
3156 rtx new_rtx
= simplify_subreg (GET_MODE (x
), y
, GET_MODE (y
),
3161 else if (final_p
&& REG_P (y
))
3163 /* Simplify_subreg can't handle some REG cases, but we have to. */
3167 regno
= subreg_regno (x
);
3168 if (subreg_lowpart_p (x
))
3169 offset
= byte_lowpart_offset (GET_MODE (x
), GET_MODE (y
));
3171 offset
= SUBREG_BYTE (x
);
3172 *xp
= gen_rtx_REG_offset (y
, GET_MODE (x
), regno
, offset
);
3179 /* Do alter_subreg on all the SUBREGs contained in X. */
3182 walk_alter_subreg (rtx
*xp
, bool *changed
)
3185 switch (GET_CODE (x
))
3190 XEXP (x
, 0) = walk_alter_subreg (&XEXP (x
, 0), changed
);
3191 XEXP (x
, 1) = walk_alter_subreg (&XEXP (x
, 1), changed
);
3196 XEXP (x
, 0) = walk_alter_subreg (&XEXP (x
, 0), changed
);
3201 return alter_subreg (xp
, true);
3210 /* Report inconsistency between the assembler template and the operands.
3211 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3214 output_operand_lossage (const char *cmsgid
, ...)
3218 const char *pfx_str
;
3221 va_start (ap
, cmsgid
);
3223 pfx_str
= this_is_asm_operands
? _("invalid 'asm': ") : "output_operand: ";
3224 fmt_string
= xasprintf ("%s%s", pfx_str
, _(cmsgid
));
3225 new_message
= xvasprintf (fmt_string
, ap
);
3227 if (this_is_asm_operands
)
3228 error_for_asm (this_is_asm_operands
, "%s", new_message
);
3230 internal_error ("%s", new_message
);
3237 /* Output of assembler code from a template, and its subroutines. */
3239 /* Annotate the assembly with a comment describing the pattern and
3240 alternative used. */
3243 output_asm_name (void)
3247 fprintf (asm_out_file
, "\t%s %d\t",
3248 ASM_COMMENT_START
, INSN_UID (debug_insn
));
3250 fprintf (asm_out_file
, "[c=%d",
3251 insn_cost (debug_insn
, optimize_insn_for_speed_p ()));
3252 if (HAVE_ATTR_length
)
3253 fprintf (asm_out_file
, " l=%d",
3254 get_attr_length (debug_insn
));
3255 fprintf (asm_out_file
, "] ");
3257 int num
= INSN_CODE (debug_insn
);
3258 fprintf (asm_out_file
, "%s", insn_data
[num
].name
);
3259 if (insn_data
[num
].n_alternatives
> 1)
3260 fprintf (asm_out_file
, "/%d", which_alternative
);
3262 /* Clear this so only the first assembler insn
3263 of any rtl insn will get the special comment for -dp. */
3268 /* If OP is a REG or MEM and we can find a MEM_EXPR corresponding to it
3269 or its address, return that expr . Set *PADDRESSP to 1 if the expr
3270 corresponds to the address of the object and 0 if to the object. */
3273 get_mem_expr_from_op (rtx op
, int *paddressp
)
3281 return REG_EXPR (op
);
3282 else if (!MEM_P (op
))
3285 if (MEM_EXPR (op
) != 0)
3286 return MEM_EXPR (op
);
3288 /* Otherwise we have an address, so indicate it and look at the address. */
3292 /* First check if we have a decl for the address, then look at the right side
3293 if it is a PLUS. Otherwise, strip off arithmetic and keep looking.
3294 But don't allow the address to itself be indirect. */
3295 if ((expr
= get_mem_expr_from_op (op
, &inner_addressp
)) && ! inner_addressp
)
3297 else if (GET_CODE (op
) == PLUS
3298 && (expr
= get_mem_expr_from_op (XEXP (op
, 1), &inner_addressp
)))
3302 || GET_RTX_CLASS (GET_CODE (op
)) == RTX_BIN_ARITH
)
3305 expr
= get_mem_expr_from_op (op
, &inner_addressp
);
3306 return inner_addressp
? 0 : expr
;
3309 /* Output operand names for assembler instructions. OPERANDS is the
3310 operand vector, OPORDER is the order to write the operands, and NOPS
3311 is the number of operands to write. */
3314 output_asm_operand_names (rtx
*operands
, int *oporder
, int nops
)
3319 for (i
= 0; i
< nops
; i
++)
3322 rtx op
= operands
[oporder
[i
]];
3323 tree expr
= get_mem_expr_from_op (op
, &addressp
);
3325 fprintf (asm_out_file
, "%c%s",
3326 wrote
? ',' : '\t', wrote
? "" : ASM_COMMENT_START
);
3330 fprintf (asm_out_file
, "%s",
3331 addressp
? "*" : "");
3332 print_mem_expr (asm_out_file
, expr
);
3335 else if (REG_P (op
) && ORIGINAL_REGNO (op
)
3336 && ORIGINAL_REGNO (op
) != REGNO (op
))
3337 fprintf (asm_out_file
, " tmp%i", ORIGINAL_REGNO (op
));
3341 #ifdef ASSEMBLER_DIALECT
3342 /* Helper function to parse assembler dialects in the asm string.
3343 This is called from output_asm_insn and asm_fprintf. */
3345 do_assembler_dialects (const char *p
, int *dialect
)
3356 output_operand_lossage ("nested assembly dialect alternatives");
3360 /* If we want the first dialect, do nothing. Otherwise, skip
3361 DIALECT_NUMBER of strings ending with '|'. */
3362 for (i
= 0; i
< dialect_number
; i
++)
3364 while (*p
&& *p
!= '}')
3372 /* Skip over any character after a percent sign. */
3384 output_operand_lossage ("unterminated assembly dialect alternative");
3391 /* Skip to close brace. */
3396 output_operand_lossage ("unterminated assembly dialect alternative");
3400 /* Skip over any character after a percent sign. */
3401 if (*p
== '%' && p
[1])
3415 putc (c
, asm_out_file
);
3420 putc (c
, asm_out_file
);
3431 /* Output text from TEMPLATE to the assembler output file,
3432 obeying %-directions to substitute operands taken from
3433 the vector OPERANDS.
3435 %N (for N a digit) means print operand N in usual manner.
3436 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3437 and print the label name with no punctuation.
3438 %cN means require operand N to be a constant
3439 and print the constant expression with no punctuation.
3440 %aN means expect operand N to be a memory address
3441 (not a memory reference!) and print a reference
3443 %nN means expect operand N to be a constant
3444 and print a constant expression for minus the value
3445 of the operand, with no other punctuation. */
3448 output_asm_insn (const char *templ
, rtx
*operands
)
3452 #ifdef ASSEMBLER_DIALECT
3455 int oporder
[MAX_RECOG_OPERANDS
];
3456 char opoutput
[MAX_RECOG_OPERANDS
];
3459 /* An insn may return a null string template
3460 in a case where no assembler code is needed. */
3464 memset (opoutput
, 0, sizeof opoutput
);
3466 putc ('\t', asm_out_file
);
3468 #ifdef ASM_OUTPUT_OPCODE
3469 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3476 if (flag_verbose_asm
)
3477 output_asm_operand_names (operands
, oporder
, ops
);
3478 if (flag_print_asm_name
)
3482 memset (opoutput
, 0, sizeof opoutput
);
3484 putc (c
, asm_out_file
);
3485 #ifdef ASM_OUTPUT_OPCODE
3486 while ((c
= *p
) == '\t')
3488 putc (c
, asm_out_file
);
3491 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3495 #ifdef ASSEMBLER_DIALECT
3499 p
= do_assembler_dialects (p
, &dialect
);
3504 /* %% outputs a single %. %{, %} and %| print {, } and | respectively
3505 if ASSEMBLER_DIALECT defined and these characters have a special
3506 meaning as dialect delimiters.*/
3508 #ifdef ASSEMBLER_DIALECT
3509 || *p
== '{' || *p
== '}' || *p
== '|'
3513 putc (*p
, asm_out_file
);
3516 /* %= outputs a number which is unique to each insn in the entire
3517 compilation. This is useful for making local labels that are
3518 referred to more than once in a given insn. */
3522 fprintf (asm_out_file
, "%d", insn_counter
);
3524 /* % followed by a letter and some digits
3525 outputs an operand in a special way depending on the letter.
3526 Letters `acln' are implemented directly.
3527 Other letters are passed to `output_operand' so that
3528 the TARGET_PRINT_OPERAND hook can define them. */
3529 else if (ISALPHA (*p
))
3532 unsigned long opnum
;
3535 opnum
= strtoul (p
, &endptr
, 10);
3538 output_operand_lossage ("operand number missing "
3540 else if (this_is_asm_operands
&& opnum
>= insn_noperands
)
3541 output_operand_lossage ("operand number out of range");
3542 else if (letter
== 'l')
3543 output_asm_label (operands
[opnum
]);
3544 else if (letter
== 'a')
3545 output_address (VOIDmode
, operands
[opnum
]);
3546 else if (letter
== 'c')
3548 if (CONSTANT_ADDRESS_P (operands
[opnum
]))
3549 output_addr_const (asm_out_file
, operands
[opnum
]);
3551 output_operand (operands
[opnum
], 'c');
3553 else if (letter
== 'n')
3555 if (CONST_INT_P (operands
[opnum
]))
3556 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
,
3557 - INTVAL (operands
[opnum
]));
3560 putc ('-', asm_out_file
);
3561 output_addr_const (asm_out_file
, operands
[opnum
]);
3565 output_operand (operands
[opnum
], letter
);
3567 if (!opoutput
[opnum
])
3568 oporder
[ops
++] = opnum
;
3569 opoutput
[opnum
] = 1;
3574 /* % followed by a digit outputs an operand the default way. */
3575 else if (ISDIGIT (*p
))
3577 unsigned long opnum
;
3580 opnum
= strtoul (p
, &endptr
, 10);
3581 if (this_is_asm_operands
&& opnum
>= insn_noperands
)
3582 output_operand_lossage ("operand number out of range");
3584 output_operand (operands
[opnum
], 0);
3586 if (!opoutput
[opnum
])
3587 oporder
[ops
++] = opnum
;
3588 opoutput
[opnum
] = 1;
3593 /* % followed by punctuation: output something for that
3594 punctuation character alone, with no operand. The
3595 TARGET_PRINT_OPERAND hook decides what is actually done. */
3596 else if (targetm
.asm_out
.print_operand_punct_valid_p ((unsigned char) *p
))
3597 output_operand (NULL_RTX
, *p
++);
3599 output_operand_lossage ("invalid %%-code");
3603 putc (c
, asm_out_file
);
3606 /* Try to keep the asm a bit more readable. */
3607 if ((flag_verbose_asm
|| flag_print_asm_name
) && strlen (templ
) < 9)
3608 putc ('\t', asm_out_file
);
3610 /* Write out the variable names for operands, if we know them. */
3611 if (flag_verbose_asm
)
3612 output_asm_operand_names (operands
, oporder
, ops
);
3613 if (flag_print_asm_name
)
3616 putc ('\n', asm_out_file
);
3619 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3622 output_asm_label (rtx x
)
3626 if (GET_CODE (x
) == LABEL_REF
)
3627 x
= label_ref_label (x
);
3630 && NOTE_KIND (x
) == NOTE_INSN_DELETED_LABEL
))
3631 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3633 output_operand_lossage ("'%%l' operand isn't a label");
3635 assemble_name (asm_out_file
, buf
);
3638 /* Marks SYMBOL_REFs in x as referenced through use of assemble_external. */
3641 mark_symbol_refs_as_used (rtx x
)
3643 subrtx_iterator::array_type array
;
3644 FOR_EACH_SUBRTX (iter
, array
, x
, ALL
)
3646 const_rtx x
= *iter
;
3647 if (GET_CODE (x
) == SYMBOL_REF
)
3648 if (tree t
= SYMBOL_REF_DECL (x
))
3649 assemble_external (t
);
3653 /* Print operand X using machine-dependent assembler syntax.
3654 CODE is a non-digit that preceded the operand-number in the % spec,
3655 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3656 between the % and the digits.
3657 When CODE is a non-letter, X is 0.
3659 The meanings of the letters are machine-dependent and controlled
3660 by TARGET_PRINT_OPERAND. */
3663 output_operand (rtx x
, int code ATTRIBUTE_UNUSED
)
3665 if (x
&& GET_CODE (x
) == SUBREG
)
3666 x
= alter_subreg (&x
, true);
3668 /* X must not be a pseudo reg. */
3669 if (!targetm
.no_register_allocation
)
3670 gcc_assert (!x
|| !REG_P (x
) || REGNO (x
) < FIRST_PSEUDO_REGISTER
);
3672 targetm
.asm_out
.print_operand (asm_out_file
, x
, code
);
3677 mark_symbol_refs_as_used (x
);
3680 /* Print a memory reference operand for address X using
3681 machine-dependent assembler syntax. */
3684 output_address (machine_mode mode
, rtx x
)
3686 bool changed
= false;
3687 walk_alter_subreg (&x
, &changed
);
3688 targetm
.asm_out
.print_operand_address (asm_out_file
, mode
, x
);
3691 /* Print an integer constant expression in assembler syntax.
3692 Addition and subtraction are the only arithmetic
3693 that may appear in these expressions. */
3696 output_addr_const (FILE *file
, rtx x
)
3701 switch (GET_CODE (x
))
3708 if (SYMBOL_REF_DECL (x
))
3709 assemble_external (SYMBOL_REF_DECL (x
));
3710 #ifdef ASM_OUTPUT_SYMBOL_REF
3711 ASM_OUTPUT_SYMBOL_REF (file
, x
);
3713 assemble_name (file
, XSTR (x
, 0));
3718 x
= label_ref_label (x
);
3721 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3722 #ifdef ASM_OUTPUT_LABEL_REF
3723 ASM_OUTPUT_LABEL_REF (file
, buf
);
3725 assemble_name (file
, buf
);
3730 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, INTVAL (x
));
3734 /* This used to output parentheses around the expression,
3735 but that does not work on the 386 (either ATT or BSD assembler). */
3736 output_addr_const (file
, XEXP (x
, 0));
3739 case CONST_WIDE_INT
:
3740 /* We do not know the mode here so we have to use a round about
3741 way to build a wide-int to get it printed properly. */
3743 wide_int w
= wide_int::from_array (&CONST_WIDE_INT_ELT (x
, 0),
3744 CONST_WIDE_INT_NUNITS (x
),
3745 CONST_WIDE_INT_NUNITS (x
)
3746 * HOST_BITS_PER_WIDE_INT
,
3748 print_decs (w
, file
);
3753 if (CONST_DOUBLE_AS_INT_P (x
))
3755 /* We can use %d if the number is one word and positive. */
3756 if (CONST_DOUBLE_HIGH (x
))
3757 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
3758 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_HIGH (x
),
3759 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_LOW (x
));
3760 else if (CONST_DOUBLE_LOW (x
) < 0)
3761 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
,
3762 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_LOW (x
));
3764 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_DOUBLE_LOW (x
));
3767 /* We can't handle floating point constants;
3768 PRINT_OPERAND must handle them. */
3769 output_operand_lossage ("floating constant misused");
3773 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_FIXED_VALUE_LOW (x
));
3777 /* Some assemblers need integer constants to appear last (eg masm). */
3778 if (CONST_INT_P (XEXP (x
, 0)))
3780 output_addr_const (file
, XEXP (x
, 1));
3781 if (INTVAL (XEXP (x
, 0)) >= 0)
3782 fprintf (file
, "+");
3783 output_addr_const (file
, XEXP (x
, 0));
3787 output_addr_const (file
, XEXP (x
, 0));
3788 if (!CONST_INT_P (XEXP (x
, 1))
3789 || INTVAL (XEXP (x
, 1)) >= 0)
3790 fprintf (file
, "+");
3791 output_addr_const (file
, XEXP (x
, 1));
3796 /* Avoid outputting things like x-x or x+5-x,
3797 since some assemblers can't handle that. */
3798 x
= simplify_subtraction (x
);
3799 if (GET_CODE (x
) != MINUS
)
3802 output_addr_const (file
, XEXP (x
, 0));
3803 fprintf (file
, "-");
3804 if ((CONST_INT_P (XEXP (x
, 1)) && INTVAL (XEXP (x
, 1)) >= 0)
3805 || GET_CODE (XEXP (x
, 1)) == PC
3806 || GET_CODE (XEXP (x
, 1)) == SYMBOL_REF
)
3807 output_addr_const (file
, XEXP (x
, 1));
3810 fputs (targetm
.asm_out
.open_paren
, file
);
3811 output_addr_const (file
, XEXP (x
, 1));
3812 fputs (targetm
.asm_out
.close_paren
, file
);
3820 output_addr_const (file
, XEXP (x
, 0));
3824 if (targetm
.asm_out
.output_addr_const_extra (file
, x
))
3827 output_operand_lossage ("invalid expression as operand");
3831 /* Output a quoted string. */
3834 output_quoted_string (FILE *asm_file
, const char *string
)
3836 #ifdef OUTPUT_QUOTED_STRING
3837 OUTPUT_QUOTED_STRING (asm_file
, string
);
3841 putc ('\"', asm_file
);
3842 while ((c
= *string
++) != 0)
3846 if (c
== '\"' || c
== '\\')
3847 putc ('\\', asm_file
);
3851 fprintf (asm_file
, "\\%03o", (unsigned char) c
);
3853 putc ('\"', asm_file
);
3857 /* Write a HOST_WIDE_INT number in hex form 0x1234, fast. */
3860 fprint_whex (FILE *f
, unsigned HOST_WIDE_INT value
)
3862 char buf
[2 + CHAR_BIT
* sizeof (value
) / 4];
3867 char *p
= buf
+ sizeof (buf
);
3869 *--p
= "0123456789abcdef"[value
% 16];
3870 while ((value
/= 16) != 0);
3873 fwrite (p
, 1, buf
+ sizeof (buf
) - p
, f
);
3877 /* Internal function that prints an unsigned long in decimal in reverse.
3878 The output string IS NOT null-terminated. */
3881 sprint_ul_rev (char *s
, unsigned long value
)
3886 s
[i
] = "0123456789"[value
% 10];
3889 /* alternate version, without modulo */
3890 /* oldval = value; */
3892 /* s[i] = "0123456789" [oldval - 10*value]; */
3899 /* Write an unsigned long as decimal to a file, fast. */
3902 fprint_ul (FILE *f
, unsigned long value
)
3904 /* python says: len(str(2**64)) == 20 */
3908 i
= sprint_ul_rev (s
, value
);
3910 /* It's probably too small to bother with string reversal and fputs. */
3919 /* Write an unsigned long as decimal to a string, fast.
3920 s must be wide enough to not overflow, at least 21 chars.
3921 Returns the length of the string (without terminating '\0'). */
3924 sprint_ul (char *s
, unsigned long value
)
3926 int len
= sprint_ul_rev (s
, value
);
3929 std::reverse (s
, s
+ len
);
3933 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3934 %R prints the value of REGISTER_PREFIX.
3935 %L prints the value of LOCAL_LABEL_PREFIX.
3936 %U prints the value of USER_LABEL_PREFIX.
3937 %I prints the value of IMMEDIATE_PREFIX.
3938 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3939 Also supported are %d, %i, %u, %x, %X, %o, %c, %s and %%.
3941 We handle alternate assembler dialects here, just like output_asm_insn. */
3944 asm_fprintf (FILE *file
, const char *p
, ...)
3948 #ifdef ASSEMBLER_DIALECT
3953 va_start (argptr
, p
);
3960 #ifdef ASSEMBLER_DIALECT
3964 p
= do_assembler_dialects (p
, &dialect
);
3971 while (strchr ("-+ #0", c
))
3976 while (ISDIGIT (c
) || c
== '.')
3987 case 'd': case 'i': case 'u':
3988 case 'x': case 'X': case 'o':
3992 fprintf (file
, buf
, va_arg (argptr
, int));
3996 /* This is a prefix to the 'd', 'i', 'u', 'x', 'X', and
3997 'o' cases, but we do not check for those cases. It
3998 means that the value is a HOST_WIDE_INT, which may be
3999 either `long' or `long long'. */
4000 memcpy (q
, HOST_WIDE_INT_PRINT
, strlen (HOST_WIDE_INT_PRINT
));
4001 q
+= strlen (HOST_WIDE_INT_PRINT
);
4004 fprintf (file
, buf
, va_arg (argptr
, HOST_WIDE_INT
));
4009 #ifdef HAVE_LONG_LONG
4015 fprintf (file
, buf
, va_arg (argptr
, long long));
4022 fprintf (file
, buf
, va_arg (argptr
, long));
4030 fprintf (file
, buf
, va_arg (argptr
, char *));
4034 #ifdef ASM_OUTPUT_OPCODE
4035 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
4040 #ifdef REGISTER_PREFIX
4041 fprintf (file
, "%s", REGISTER_PREFIX
);
4046 #ifdef IMMEDIATE_PREFIX
4047 fprintf (file
, "%s", IMMEDIATE_PREFIX
);
4052 #ifdef LOCAL_LABEL_PREFIX
4053 fprintf (file
, "%s", LOCAL_LABEL_PREFIX
);
4058 fputs (user_label_prefix
, file
);
4061 #ifdef ASM_FPRINTF_EXTENSIONS
4062 /* Uppercase letters are reserved for general use by asm_fprintf
4063 and so are not available to target specific code. In order to
4064 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
4065 they are defined here. As they get turned into real extensions
4066 to asm_fprintf they should be removed from this list. */
4067 case 'A': case 'B': case 'C': case 'D': case 'E':
4068 case 'F': case 'G': case 'H': case 'J': case 'K':
4069 case 'M': case 'N': case 'P': case 'Q': case 'S':
4070 case 'T': case 'V': case 'W': case 'Y': case 'Z':
4073 ASM_FPRINTF_EXTENSIONS (file
, argptr
, p
)
4086 /* Return nonzero if this function has no function calls. */
4089 leaf_function_p (void)
4093 /* Ensure we walk the entire function body. */
4094 gcc_assert (!in_sequence_p ());
4096 /* Some back-ends (e.g. s390) want leaf functions to stay leaf
4097 functions even if they call mcount. */
4098 if (crtl
->profile
&& !targetm
.keep_leaf_when_profiled ())
4101 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4104 && ! SIBLING_CALL_P (insn
))
4106 if (NONJUMP_INSN_P (insn
)
4107 && GET_CODE (PATTERN (insn
)) == SEQUENCE
4108 && CALL_P (XVECEXP (PATTERN (insn
), 0, 0))
4109 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn
), 0, 0)))
4116 /* Return 1 if branch is a forward branch.
4117 Uses insn_shuid array, so it works only in the final pass. May be used by
4118 output templates to customary add branch prediction hints.
4121 final_forward_branch_p (rtx_insn
*insn
)
4123 int insn_id
, label_id
;
4125 gcc_assert (uid_shuid
);
4126 insn_id
= INSN_SHUID (insn
);
4127 label_id
= INSN_SHUID (JUMP_LABEL (insn
));
4128 /* We've hit some insns that does not have id information available. */
4129 gcc_assert (insn_id
&& label_id
);
4130 return insn_id
< label_id
;
4133 /* On some machines, a function with no call insns
4134 can run faster if it doesn't create its own register window.
4135 When output, the leaf function should use only the "output"
4136 registers. Ordinarily, the function would be compiled to use
4137 the "input" registers to find its arguments; it is a candidate
4138 for leaf treatment if it uses only the "input" registers.
4139 Leaf function treatment means renumbering so the function
4140 uses the "output" registers instead. */
4142 #ifdef LEAF_REGISTERS
4144 /* Return 1 if this function uses only the registers that can be
4145 safely renumbered. */
4148 only_leaf_regs_used (void)
4151 const char *const permitted_reg_in_leaf_functions
= LEAF_REGISTERS
;
4153 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4154 if ((df_regs_ever_live_p (i
) || global_regs
[i
])
4155 && ! permitted_reg_in_leaf_functions
[i
])
4158 if (crtl
->uses_pic_offset_table
4159 && pic_offset_table_rtx
!= 0
4160 && REG_P (pic_offset_table_rtx
)
4161 && ! permitted_reg_in_leaf_functions
[REGNO (pic_offset_table_rtx
)])
4167 /* Scan all instructions and renumber all registers into those
4168 available in leaf functions. */
4171 leaf_renumber_regs (rtx_insn
*first
)
4175 /* Renumber only the actual patterns.
4176 The reg-notes can contain frame pointer refs,
4177 and renumbering them could crash, and should not be needed. */
4178 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
4180 leaf_renumber_regs_insn (PATTERN (insn
));
4183 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4184 available in leaf functions. */
4187 leaf_renumber_regs_insn (rtx in_rtx
)
4190 const char *format_ptr
;
4195 /* Renumber all input-registers into output-registers.
4196 renumbered_regs would be 1 for an output-register;
4203 /* Don't renumber the same reg twice. */
4207 newreg
= REGNO (in_rtx
);
4208 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4209 to reach here as part of a REG_NOTE. */
4210 if (newreg
>= FIRST_PSEUDO_REGISTER
)
4215 newreg
= LEAF_REG_REMAP (newreg
);
4216 gcc_assert (newreg
>= 0);
4217 df_set_regs_ever_live (REGNO (in_rtx
), false);
4218 df_set_regs_ever_live (newreg
, true);
4219 SET_REGNO (in_rtx
, newreg
);
4224 if (INSN_P (in_rtx
))
4226 /* Inside a SEQUENCE, we find insns.
4227 Renumber just the patterns of these insns,
4228 just as we do for the top-level insns. */
4229 leaf_renumber_regs_insn (PATTERN (in_rtx
));
4233 format_ptr
= GET_RTX_FORMAT (GET_CODE (in_rtx
));
4235 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (in_rtx
)); i
++)
4236 switch (*format_ptr
++)
4239 leaf_renumber_regs_insn (XEXP (in_rtx
, i
));
4243 if (XVEC (in_rtx
, i
) != NULL
)
4244 for (j
= 0; j
< XVECLEN (in_rtx
, i
); j
++)
4245 leaf_renumber_regs_insn (XVECEXP (in_rtx
, i
, j
));
4264 /* Turn the RTL into assembly. */
4266 rest_of_handle_final (void)
4268 const char *fnname
= get_fnname_from_decl (current_function_decl
);
4270 /* Turn debug markers into notes if the var-tracking pass has not
4272 if (!flag_var_tracking
&& MAY_HAVE_DEBUG_MARKER_INSNS
)
4273 delete_vta_debug_insns (false);
4275 assemble_start_function (current_function_decl
, fnname
);
4276 rtx_insn
*first
= get_insns ();
4278 final_start_function_1 (&first
, asm_out_file
, &seen
, optimize
);
4279 final_1 (first
, asm_out_file
, seen
, optimize
);
4281 && !lookup_attribute ("noipa", DECL_ATTRIBUTES (current_function_decl
))
4282 /* Functions with naked attributes are supported only with basic asm
4283 statements in the body, thus for supported use cases the information
4284 on clobbered registers is not available. */
4285 && !lookup_attribute ("naked", DECL_ATTRIBUTES (current_function_decl
)))
4286 collect_fn_hard_reg_usage ();
4287 final_end_function ();
4289 /* The IA-64 ".handlerdata" directive must be issued before the ".endp"
4290 directive that closes the procedure descriptor. Similarly, for x64 SEH.
4291 Otherwise it's not strictly necessary, but it doesn't hurt either. */
4292 output_function_exception_table (crtl
->has_bb_partition
? 1 : 0);
4294 assemble_end_function (current_function_decl
, fnname
);
4296 /* Free up reg info memory. */
4300 fflush (asm_out_file
);
4302 /* Write DBX symbols if requested. */
4304 /* Note that for those inline functions where we don't initially
4305 know for certain that we will be generating an out-of-line copy,
4306 the first invocation of this routine (rest_of_compilation) will
4307 skip over this code by doing a `goto exit_rest_of_compilation;'.
4308 Later on, wrapup_global_declarations will (indirectly) call
4309 rest_of_compilation again for those inline functions that need
4310 to have out-of-line copies generated. During that call, we
4311 *will* be routed past here. */
4313 timevar_push (TV_SYMOUT
);
4314 if (!DECL_IGNORED_P (current_function_decl
))
4315 debug_hooks
->function_decl (current_function_decl
);
4316 timevar_pop (TV_SYMOUT
);
4318 /* Release the blocks that are linked to DECL_INITIAL() to free the memory. */
4319 DECL_INITIAL (current_function_decl
) = error_mark_node
;
4321 if (DECL_STATIC_CONSTRUCTOR (current_function_decl
)
4322 && targetm
.have_ctors_dtors
)
4323 targetm
.asm_out
.constructor (XEXP (DECL_RTL (current_function_decl
), 0),
4324 decl_init_priority_lookup
4325 (current_function_decl
));
4326 if (DECL_STATIC_DESTRUCTOR (current_function_decl
)
4327 && targetm
.have_ctors_dtors
)
4328 targetm
.asm_out
.destructor (XEXP (DECL_RTL (current_function_decl
), 0),
4329 decl_fini_priority_lookup
4330 (current_function_decl
));
4336 const pass_data pass_data_final
=
4338 RTL_PASS
, /* type */
4340 OPTGROUP_NONE
, /* optinfo_flags */
4341 TV_FINAL
, /* tv_id */
4342 0, /* properties_required */
4343 0, /* properties_provided */
4344 0, /* properties_destroyed */
4345 0, /* todo_flags_start */
4346 0, /* todo_flags_finish */
4349 class pass_final
: public rtl_opt_pass
4352 pass_final (gcc::context
*ctxt
)
4353 : rtl_opt_pass (pass_data_final
, ctxt
)
4356 /* opt_pass methods: */
4357 virtual unsigned int execute (function
*) { return rest_of_handle_final (); }
4359 }; // class pass_final
4364 make_pass_final (gcc::context
*ctxt
)
4366 return new pass_final (ctxt
);
4371 rest_of_handle_shorten_branches (void)
4373 /* Shorten branches. */
4374 shorten_branches (get_insns ());
4380 const pass_data pass_data_shorten_branches
=
4382 RTL_PASS
, /* type */
4383 "shorten", /* name */
4384 OPTGROUP_NONE
, /* optinfo_flags */
4385 TV_SHORTEN_BRANCH
, /* tv_id */
4386 0, /* properties_required */
4387 0, /* properties_provided */
4388 0, /* properties_destroyed */
4389 0, /* todo_flags_start */
4390 0, /* todo_flags_finish */
4393 class pass_shorten_branches
: public rtl_opt_pass
4396 pass_shorten_branches (gcc::context
*ctxt
)
4397 : rtl_opt_pass (pass_data_shorten_branches
, ctxt
)
4400 /* opt_pass methods: */
4401 virtual unsigned int execute (function
*)
4403 return rest_of_handle_shorten_branches ();
4406 }; // class pass_shorten_branches
4411 make_pass_shorten_branches (gcc::context
*ctxt
)
4413 return new pass_shorten_branches (ctxt
);
4418 rest_of_clean_state (void)
4420 rtx_insn
*insn
, *next
;
4421 FILE *final_output
= NULL
;
4422 int save_unnumbered
= flag_dump_unnumbered
;
4423 int save_noaddr
= flag_dump_noaddr
;
4425 if (flag_dump_final_insns
)
4427 final_output
= fopen (flag_dump_final_insns
, "a");
4430 error ("could not open final insn dump file %qs: %m",
4431 flag_dump_final_insns
);
4432 flag_dump_final_insns
= NULL
;
4436 flag_dump_noaddr
= flag_dump_unnumbered
= 1;
4437 if (flag_compare_debug_opt
|| flag_compare_debug
)
4438 dump_flags
|= TDF_NOUID
| TDF_COMPARE_DEBUG
;
4439 dump_function_header (final_output
, current_function_decl
,
4441 final_insns_dump_p
= true;
4443 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4445 INSN_UID (insn
) = CODE_LABEL_NUMBER (insn
);
4449 set_block_for_insn (insn
, NULL
);
4450 INSN_UID (insn
) = 0;
4455 /* It is very important to decompose the RTL instruction chain here:
4456 debug information keeps pointing into CODE_LABEL insns inside the function
4457 body. If these remain pointing to the other insns, we end up preserving
4458 whole RTL chain and attached detailed debug info in memory. */
4459 for (insn
= get_insns (); insn
; insn
= next
)
4461 next
= NEXT_INSN (insn
);
4462 SET_NEXT_INSN (insn
) = NULL
;
4463 SET_PREV_INSN (insn
) = NULL
;
4465 rtx_insn
*call_insn
= insn
;
4466 if (NONJUMP_INSN_P (call_insn
)
4467 && GET_CODE (PATTERN (call_insn
)) == SEQUENCE
)
4469 rtx_sequence
*seq
= as_a
<rtx_sequence
*> (PATTERN (call_insn
));
4470 call_insn
= seq
->insn (0);
4472 if (CALL_P (call_insn
))
4475 = find_reg_note (call_insn
, REG_CALL_ARG_LOCATION
, NULL_RTX
);
4477 remove_note (call_insn
, note
);
4482 || (NOTE_KIND (insn
) != NOTE_INSN_VAR_LOCATION
4483 && NOTE_KIND (insn
) != NOTE_INSN_BEGIN_STMT
4484 && NOTE_KIND (insn
) != NOTE_INSN_INLINE_ENTRY
4485 && NOTE_KIND (insn
) != NOTE_INSN_BLOCK_BEG
4486 && NOTE_KIND (insn
) != NOTE_INSN_BLOCK_END
4487 && NOTE_KIND (insn
) != NOTE_INSN_DELETED_DEBUG_LABEL
)))
4488 print_rtl_single (final_output
, insn
);
4493 flag_dump_noaddr
= save_noaddr
;
4494 flag_dump_unnumbered
= save_unnumbered
;
4495 final_insns_dump_p
= false;
4497 if (fclose (final_output
))
4499 error ("could not close final insn dump file %qs: %m",
4500 flag_dump_final_insns
);
4501 flag_dump_final_insns
= NULL
;
4505 flag_rerun_cse_after_global_opts
= 0;
4506 reload_completed
= 0;
4507 epilogue_completed
= 0;
4509 regstack_completed
= 0;
4512 /* Clear out the insn_length contents now that they are no
4514 init_insn_lengths ();
4516 /* Show no temporary slots allocated. */
4519 free_bb_for_insn ();
4521 if (cfun
->gimple_df
)
4522 delete_tree_ssa (cfun
);
4524 /* We can reduce stack alignment on call site only when we are sure that
4525 the function body just produced will be actually used in the final
4527 if (flag_ipa_stack_alignment
4528 && decl_binds_to_current_def_p (current_function_decl
))
4530 unsigned int pref
= crtl
->preferred_stack_boundary
;
4531 if (crtl
->stack_alignment_needed
> crtl
->preferred_stack_boundary
)
4532 pref
= crtl
->stack_alignment_needed
;
4533 cgraph_node::rtl_info (current_function_decl
)
4534 ->preferred_incoming_stack_boundary
= pref
;
4537 /* Make sure volatile mem refs aren't considered valid operands for
4538 arithmetic insns. We must call this here if this is a nested inline
4539 function, since the above code leaves us in the init_recog state,
4540 and the function context push/pop code does not save/restore volatile_ok.
4542 ??? Maybe it isn't necessary for expand_start_function to call this
4543 anymore if we do it here? */
4545 init_recog_no_volatile ();
4547 /* We're done with this function. Free up memory if we can. */
4548 free_after_parsing (cfun
);
4549 free_after_compilation (cfun
);
4555 const pass_data pass_data_clean_state
=
4557 RTL_PASS
, /* type */
4558 "*clean_state", /* name */
4559 OPTGROUP_NONE
, /* optinfo_flags */
4560 TV_FINAL
, /* tv_id */
4561 0, /* properties_required */
4562 0, /* properties_provided */
4563 PROP_rtl
, /* properties_destroyed */
4564 0, /* todo_flags_start */
4565 0, /* todo_flags_finish */
4568 class pass_clean_state
: public rtl_opt_pass
4571 pass_clean_state (gcc::context
*ctxt
)
4572 : rtl_opt_pass (pass_data_clean_state
, ctxt
)
4575 /* opt_pass methods: */
4576 virtual unsigned int execute (function
*)
4578 return rest_of_clean_state ();
4581 }; // class pass_clean_state
4586 make_pass_clean_state (gcc::context
*ctxt
)
4588 return new pass_clean_state (ctxt
);
4591 /* Return true if INSN is a call to the current function. */
4594 self_recursive_call_p (rtx_insn
*insn
)
4596 tree fndecl
= get_call_fndecl (insn
);
4597 return (fndecl
== current_function_decl
4598 && decl_binds_to_current_def_p (fndecl
));
4601 /* Collect hard register usage for the current function. */
4604 collect_fn_hard_reg_usage (void)
4610 struct cgraph_rtl_info
*node
;
4611 HARD_REG_SET function_used_regs
;
4613 /* ??? To be removed when all the ports have been fixed. */
4614 if (!targetm
.call_fusage_contains_non_callee_clobbers
)
4617 /* Be conservative - mark fixed and global registers as used. */
4618 function_used_regs
= fixed_reg_set
;
4621 /* Handle STACK_REGS conservatively, since the df-framework does not
4622 provide accurate information for them. */
4624 for (i
= FIRST_STACK_REG
; i
<= LAST_STACK_REG
; i
++)
4625 SET_HARD_REG_BIT (function_used_regs
, i
);
4628 for (insn
= get_insns (); insn
!= NULL_RTX
; insn
= next_insn (insn
))
4630 HARD_REG_SET insn_used_regs
;
4632 if (!NONDEBUG_INSN_P (insn
))
4636 && !self_recursive_call_p (insn
))
4638 |= insn_callee_abi (insn
).full_and_partial_reg_clobbers ();
4640 find_all_hard_reg_sets (insn
, &insn_used_regs
, false);
4641 function_used_regs
|= insn_used_regs
;
4643 if (hard_reg_set_subset_p (crtl
->abi
->full_and_partial_reg_clobbers (),
4644 function_used_regs
))
4648 /* Mask out fully-saved registers, so that they don't affect equality
4649 comparisons between function_abis. */
4650 function_used_regs
&= crtl
->abi
->full_and_partial_reg_clobbers ();
4652 node
= cgraph_node::rtl_info (current_function_decl
);
4653 gcc_assert (node
!= NULL
);
4655 node
->function_used_regs
= function_used_regs
;