1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987-2014 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This is the final pass of the compiler.
21 It looks at the rtl code for a function and outputs assembler code.
23 Call `final_start_function' to output the assembler code for function entry,
24 `final' to output assembler code for some RTL code,
25 `final_end_function' to output assembler code for function exit.
26 If a function is compiled in several pieces, each piece is
27 output separately with `final'.
29 Some optimizations are also done at this level.
30 Move instructions that were made unnecessary by good register allocation
31 are detected and omitted from the output. (Though most of these
32 are removed by the last jump pass.)
34 Instructions to set the condition codes are omitted when it can be
35 seen that the condition codes already had the desired values.
37 In some cases it is sufficient if the inherited condition codes
38 have related values, but this may require the following insn
39 (the one that tests the condition codes) to be modified.
41 The code for the function prologue and epilogue are generated
42 directly in assembler by the target functions function_prologue and
43 function_epilogue. Those instructions never exist as rtl. */
47 #include "coretypes.h"
52 #include "hard-reg-set.h"
56 #include "insn-config.h"
57 #include "insn-attr.h"
59 #include "conditions.h"
69 #include "rtl-error.h"
70 #include "toplev.h" /* exact_log2, floor_log2 */
73 #include "basic-block.h"
75 #include "targhooks.h"
78 #include "tree-pass.h"
86 #include "tree-pretty-print.h" /* for dump_function_header */
88 #include "wide-int-print.h"
91 #ifdef XCOFF_DEBUGGING_INFO
92 #include "xcoffout.h" /* Needed for external data
93 declarations for e.g. AIX 4.x. */
96 #include "dwarf2out.h"
98 #ifdef DBX_DEBUGGING_INFO
102 #ifdef SDB_DEBUGGING_INFO
106 /* Most ports that aren't using cc0 don't need to define CC_STATUS_INIT.
107 So define a null default for it to save conditionalization later. */
108 #ifndef CC_STATUS_INIT
109 #define CC_STATUS_INIT
112 /* Is the given character a logical line separator for the assembler? */
113 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
114 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C, STR) ((C) == ';')
117 #ifndef JUMP_TABLES_IN_TEXT_SECTION
118 #define JUMP_TABLES_IN_TEXT_SECTION 0
121 /* Bitflags used by final_scan_insn. */
123 #define SEEN_EMITTED 2
125 /* Last insn processed by final_scan_insn. */
126 static rtx_insn
*debug_insn
;
127 rtx_insn
*current_output_insn
;
129 /* Line number of last NOTE. */
130 static int last_linenum
;
132 /* Last discriminator written to assembly. */
133 static int last_discriminator
;
135 /* Discriminator of current block. */
136 static int discriminator
;
138 /* Highest line number in current block. */
139 static int high_block_linenum
;
141 /* Likewise for function. */
142 static int high_function_linenum
;
144 /* Filename of last NOTE. */
145 static const char *last_filename
;
147 /* Override filename and line number. */
148 static const char *override_filename
;
149 static int override_linenum
;
151 /* Whether to force emission of a line note before the next insn. */
152 static bool force_source_line
= false;
154 extern const int length_unit_log
; /* This is defined in insn-attrtab.c. */
156 /* Nonzero while outputting an `asm' with operands.
157 This means that inconsistencies are the user's fault, so don't die.
158 The precise value is the insn being output, to pass to error_for_asm. */
159 const rtx_insn
*this_is_asm_operands
;
161 /* Number of operands of this insn, for an `asm' with operands. */
162 static unsigned int insn_noperands
;
164 /* Compare optimization flag. */
166 static rtx last_ignored_compare
= 0;
168 /* Assign a unique number to each insn that is output.
169 This can be used to generate unique local labels. */
171 static int insn_counter
= 0;
174 /* This variable contains machine-dependent flags (defined in tm.h)
175 set and examined by output routines
176 that describe how to interpret the condition codes properly. */
180 /* During output of an insn, this contains a copy of cc_status
181 from before the insn. */
183 CC_STATUS cc_prev_status
;
186 /* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen. */
188 static int block_depth
;
190 /* Nonzero if have enabled APP processing of our assembler output. */
194 /* If we are outputting an insn sequence, this contains the sequence rtx.
197 rtx_sequence
*final_sequence
;
199 #ifdef ASSEMBLER_DIALECT
201 /* Number of the assembler dialect to use, starting at 0. */
202 static int dialect_number
;
205 /* Nonnull if the insn currently being emitted was a COND_EXEC pattern. */
206 rtx current_insn_predicate
;
208 /* True if printing into -fdump-final-insns= dump. */
209 bool final_insns_dump_p
;
211 /* True if profile_function should be called, but hasn't been called yet. */
212 static bool need_profile_function
;
214 static int asm_insn_count (rtx
);
215 static void profile_function (FILE *);
216 static void profile_after_prologue (FILE *);
217 static bool notice_source_line (rtx_insn
*, bool *);
218 static rtx
walk_alter_subreg (rtx
*, bool *);
219 static void output_asm_name (void);
220 static void output_alternate_entry_point (FILE *, rtx_insn
*);
221 static tree
get_mem_expr_from_op (rtx
, int *);
222 static void output_asm_operand_names (rtx
*, int *, int);
223 #ifdef LEAF_REGISTERS
224 static void leaf_renumber_regs (rtx_insn
*);
227 static int alter_cond (rtx
);
229 #ifndef ADDR_VEC_ALIGN
230 static int final_addr_vec_align (rtx
);
232 static int align_fuzz (rtx
, rtx
, int, unsigned);
233 static void collect_fn_hard_reg_usage (void);
234 static tree
get_call_fndecl (rtx_insn
*);
236 /* Initialize data in final at the beginning of a compilation. */
239 init_final (const char *filename ATTRIBUTE_UNUSED
)
244 #ifdef ASSEMBLER_DIALECT
245 dialect_number
= ASSEMBLER_DIALECT
;
249 /* Default target function prologue and epilogue assembler output.
251 If not overridden for epilogue code, then the function body itself
252 contains return instructions wherever needed. */
254 default_function_pro_epilogue (FILE *file ATTRIBUTE_UNUSED
,
255 HOST_WIDE_INT size ATTRIBUTE_UNUSED
)
260 default_function_switched_text_sections (FILE *file ATTRIBUTE_UNUSED
,
261 tree decl ATTRIBUTE_UNUSED
,
262 bool new_is_cold ATTRIBUTE_UNUSED
)
266 /* Default target hook that outputs nothing to a stream. */
268 no_asm_to_stream (FILE *file ATTRIBUTE_UNUSED
)
272 /* Enable APP processing of subsequent output.
273 Used before the output from an `asm' statement. */
280 fputs (ASM_APP_ON
, asm_out_file
);
285 /* Disable APP processing of subsequent output.
286 Called from varasm.c before most kinds of output. */
293 fputs (ASM_APP_OFF
, asm_out_file
);
298 /* Return the number of slots filled in the current
299 delayed branch sequence (we don't count the insn needing the
300 delay slot). Zero if not in a delayed branch sequence. */
304 dbr_sequence_length (void)
306 if (final_sequence
!= 0)
307 return XVECLEN (final_sequence
, 0) - 1;
313 /* The next two pages contain routines used to compute the length of an insn
314 and to shorten branches. */
316 /* Arrays for insn lengths, and addresses. The latter is referenced by
317 `insn_current_length'. */
319 static int *insn_lengths
;
321 vec
<int> insn_addresses_
;
323 /* Max uid for which the above arrays are valid. */
324 static int insn_lengths_max_uid
;
326 /* Address of insn being processed. Used by `insn_current_length'. */
327 int insn_current_address
;
329 /* Address of insn being processed in previous iteration. */
330 int insn_last_address
;
332 /* known invariant alignment of insn being processed. */
333 int insn_current_align
;
335 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
336 gives the next following alignment insn that increases the known
337 alignment, or NULL_RTX if there is no such insn.
338 For any alignment obtained this way, we can again index uid_align with
339 its uid to obtain the next following align that in turn increases the
340 alignment, till we reach NULL_RTX; the sequence obtained this way
341 for each insn we'll call the alignment chain of this insn in the following
344 struct label_alignment
350 static rtx
*uid_align
;
351 static int *uid_shuid
;
352 static struct label_alignment
*label_align
;
354 /* Indicate that branch shortening hasn't yet been done. */
357 init_insn_lengths (void)
368 insn_lengths_max_uid
= 0;
370 if (HAVE_ATTR_length
)
371 INSN_ADDRESSES_FREE ();
379 /* Obtain the current length of an insn. If branch shortening has been done,
380 get its actual length. Otherwise, use FALLBACK_FN to calculate the
383 get_attr_length_1 (rtx_insn
*insn
, int (*fallback_fn
) (rtx_insn
*))
389 if (!HAVE_ATTR_length
)
392 if (insn_lengths_max_uid
> INSN_UID (insn
))
393 return insn_lengths
[INSN_UID (insn
)];
395 switch (GET_CODE (insn
))
405 length
= fallback_fn (insn
);
409 body
= PATTERN (insn
);
410 if (GET_CODE (body
) == USE
|| GET_CODE (body
) == CLOBBER
)
413 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
414 length
= asm_insn_count (body
) * fallback_fn (insn
);
415 else if (rtx_sequence
*seq
= dyn_cast
<rtx_sequence
*> (body
))
416 for (i
= 0; i
< seq
->len (); i
++)
417 length
+= get_attr_length_1 (seq
->insn (i
), fallback_fn
);
419 length
= fallback_fn (insn
);
426 #ifdef ADJUST_INSN_LENGTH
427 ADJUST_INSN_LENGTH (insn
, length
);
432 /* Obtain the current length of an insn. If branch shortening has been done,
433 get its actual length. Otherwise, get its maximum length. */
435 get_attr_length (rtx_insn
*insn
)
437 return get_attr_length_1 (insn
, insn_default_length
);
440 /* Obtain the current length of an insn. If branch shortening has been done,
441 get its actual length. Otherwise, get its minimum length. */
443 get_attr_min_length (rtx_insn
*insn
)
445 return get_attr_length_1 (insn
, insn_min_length
);
448 /* Code to handle alignment inside shorten_branches. */
450 /* Here is an explanation how the algorithm in align_fuzz can give
453 Call a sequence of instructions beginning with alignment point X
454 and continuing until the next alignment point `block X'. When `X'
455 is used in an expression, it means the alignment value of the
458 Call the distance between the start of the first insn of block X, and
459 the end of the last insn of block X `IX', for the `inner size of X'.
460 This is clearly the sum of the instruction lengths.
462 Likewise with the next alignment-delimited block following X, which we
465 Call the distance between the start of the first insn of block X, and
466 the start of the first insn of block Y `OX', for the `outer size of X'.
468 The estimated padding is then OX - IX.
470 OX can be safely estimated as
475 OX = round_up(IX, X) + Y - X
477 Clearly est(IX) >= real(IX), because that only depends on the
478 instruction lengths, and those being overestimated is a given.
480 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
481 we needn't worry about that when thinking about OX.
483 When X >= Y, the alignment provided by Y adds no uncertainty factor
484 for branch ranges starting before X, so we can just round what we have.
485 But when X < Y, we don't know anything about the, so to speak,
486 `middle bits', so we have to assume the worst when aligning up from an
487 address mod X to one mod Y, which is Y - X. */
490 #define LABEL_ALIGN(LABEL) align_labels_log
494 #define LOOP_ALIGN(LABEL) align_loops_log
497 #ifndef LABEL_ALIGN_AFTER_BARRIER
498 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
502 #define JUMP_ALIGN(LABEL) align_jumps_log
506 default_label_align_after_barrier_max_skip (rtx_insn
*insn ATTRIBUTE_UNUSED
)
512 default_loop_align_max_skip (rtx_insn
*insn ATTRIBUTE_UNUSED
)
514 return align_loops_max_skip
;
518 default_label_align_max_skip (rtx_insn
*insn ATTRIBUTE_UNUSED
)
520 return align_labels_max_skip
;
524 default_jump_align_max_skip (rtx_insn
*insn ATTRIBUTE_UNUSED
)
526 return align_jumps_max_skip
;
529 #ifndef ADDR_VEC_ALIGN
531 final_addr_vec_align (rtx addr_vec
)
533 int align
= GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec
)));
535 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
536 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
537 return exact_log2 (align
);
541 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
544 #ifndef INSN_LENGTH_ALIGNMENT
545 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
548 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
550 static int min_labelno
, max_labelno
;
552 #define LABEL_TO_ALIGNMENT(LABEL) \
553 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
555 #define LABEL_TO_MAX_SKIP(LABEL) \
556 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
558 /* For the benefit of port specific code do this also as a function. */
561 label_to_alignment (rtx label
)
563 if (CODE_LABEL_NUMBER (label
) <= max_labelno
)
564 return LABEL_TO_ALIGNMENT (label
);
569 label_to_max_skip (rtx label
)
571 if (CODE_LABEL_NUMBER (label
) <= max_labelno
)
572 return LABEL_TO_MAX_SKIP (label
);
576 /* The differences in addresses
577 between a branch and its target might grow or shrink depending on
578 the alignment the start insn of the range (the branch for a forward
579 branch or the label for a backward branch) starts out on; if these
580 differences are used naively, they can even oscillate infinitely.
581 We therefore want to compute a 'worst case' address difference that
582 is independent of the alignment the start insn of the range end
583 up on, and that is at least as large as the actual difference.
584 The function align_fuzz calculates the amount we have to add to the
585 naively computed difference, by traversing the part of the alignment
586 chain of the start insn of the range that is in front of the end insn
587 of the range, and considering for each alignment the maximum amount
588 that it might contribute to a size increase.
590 For casesi tables, we also want to know worst case minimum amounts of
591 address difference, in case a machine description wants to introduce
592 some common offset that is added to all offsets in a table.
593 For this purpose, align_fuzz with a growth argument of 0 computes the
594 appropriate adjustment. */
596 /* Compute the maximum delta by which the difference of the addresses of
597 START and END might grow / shrink due to a different address for start
598 which changes the size of alignment insns between START and END.
599 KNOWN_ALIGN_LOG is the alignment known for START.
600 GROWTH should be ~0 if the objective is to compute potential code size
601 increase, and 0 if the objective is to compute potential shrink.
602 The return value is undefined for any other value of GROWTH. */
605 align_fuzz (rtx start
, rtx end
, int known_align_log
, unsigned int growth
)
607 int uid
= INSN_UID (start
);
609 int known_align
= 1 << known_align_log
;
610 int end_shuid
= INSN_SHUID (end
);
613 for (align_label
= uid_align
[uid
]; align_label
; align_label
= uid_align
[uid
])
615 int align_addr
, new_align
;
617 uid
= INSN_UID (align_label
);
618 align_addr
= INSN_ADDRESSES (uid
) - insn_lengths
[uid
];
619 if (uid_shuid
[uid
] > end_shuid
)
621 known_align_log
= LABEL_TO_ALIGNMENT (align_label
);
622 new_align
= 1 << known_align_log
;
623 if (new_align
< known_align
)
625 fuzz
+= (-align_addr
^ growth
) & (new_align
- known_align
);
626 known_align
= new_align
;
631 /* Compute a worst-case reference address of a branch so that it
632 can be safely used in the presence of aligned labels. Since the
633 size of the branch itself is unknown, the size of the branch is
634 not included in the range. I.e. for a forward branch, the reference
635 address is the end address of the branch as known from the previous
636 branch shortening pass, minus a value to account for possible size
637 increase due to alignment. For a backward branch, it is the start
638 address of the branch as known from the current pass, plus a value
639 to account for possible size increase due to alignment.
640 NB.: Therefore, the maximum offset allowed for backward branches needs
641 to exclude the branch size. */
644 insn_current_reference_address (rtx_insn
*branch
)
649 if (! INSN_ADDRESSES_SET_P ())
652 seq
= NEXT_INSN (PREV_INSN (branch
));
653 seq_uid
= INSN_UID (seq
);
654 if (!JUMP_P (branch
))
655 /* This can happen for example on the PA; the objective is to know the
656 offset to address something in front of the start of the function.
657 Thus, we can treat it like a backward branch.
658 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
659 any alignment we'd encounter, so we skip the call to align_fuzz. */
660 return insn_current_address
;
661 dest
= JUMP_LABEL (branch
);
663 /* BRANCH has no proper alignment chain set, so use SEQ.
664 BRANCH also has no INSN_SHUID. */
665 if (INSN_SHUID (seq
) < INSN_SHUID (dest
))
667 /* Forward branch. */
668 return (insn_last_address
+ insn_lengths
[seq_uid
]
669 - align_fuzz (seq
, dest
, length_unit_log
, ~0));
673 /* Backward branch. */
674 return (insn_current_address
675 + align_fuzz (dest
, seq
, length_unit_log
, ~0));
679 /* Compute branch alignments based on frequency information in the
683 compute_alignments (void)
685 int log
, max_skip
, max_log
;
688 int freq_threshold
= 0;
696 max_labelno
= max_label_num ();
697 min_labelno
= get_first_label_num ();
698 label_align
= XCNEWVEC (struct label_alignment
, max_labelno
- min_labelno
+ 1);
700 /* If not optimizing or optimizing for size, don't assign any alignments. */
701 if (! optimize
|| optimize_function_for_size_p (cfun
))
706 dump_reg_info (dump_file
);
707 dump_flow_info (dump_file
, TDF_DETAILS
);
708 flow_loops_dump (dump_file
, NULL
, 1);
710 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
711 FOR_EACH_BB_FN (bb
, cfun
)
712 if (bb
->frequency
> freq_max
)
713 freq_max
= bb
->frequency
;
714 freq_threshold
= freq_max
/ PARAM_VALUE (PARAM_ALIGN_THRESHOLD
);
717 fprintf (dump_file
, "freq_max: %i\n",freq_max
);
718 FOR_EACH_BB_FN (bb
, cfun
)
720 rtx_insn
*label
= BB_HEAD (bb
);
721 int fallthru_frequency
= 0, branch_frequency
= 0, has_fallthru
= 0;
726 || optimize_bb_for_size_p (bb
))
730 "BB %4i freq %4i loop %2i loop_depth %2i skipped.\n",
731 bb
->index
, bb
->frequency
, bb
->loop_father
->num
,
735 max_log
= LABEL_ALIGN (label
);
736 max_skip
= targetm
.asm_out
.label_align_max_skip (label
);
738 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
740 if (e
->flags
& EDGE_FALLTHRU
)
741 has_fallthru
= 1, fallthru_frequency
+= EDGE_FREQUENCY (e
);
743 branch_frequency
+= EDGE_FREQUENCY (e
);
747 fprintf (dump_file
, "BB %4i freq %4i loop %2i loop_depth"
748 " %2i fall %4i branch %4i",
749 bb
->index
, bb
->frequency
, bb
->loop_father
->num
,
751 fallthru_frequency
, branch_frequency
);
752 if (!bb
->loop_father
->inner
&& bb
->loop_father
->num
)
753 fprintf (dump_file
, " inner_loop");
754 if (bb
->loop_father
->header
== bb
)
755 fprintf (dump_file
, " loop_header");
756 fprintf (dump_file
, "\n");
759 /* There are two purposes to align block with no fallthru incoming edge:
760 1) to avoid fetch stalls when branch destination is near cache boundary
761 2) to improve cache efficiency in case the previous block is not executed
762 (so it does not need to be in the cache).
764 We to catch first case, we align frequently executed blocks.
765 To catch the second, we align blocks that are executed more frequently
766 than the predecessor and the predecessor is likely to not be executed
767 when function is called. */
770 && (branch_frequency
> freq_threshold
771 || (bb
->frequency
> bb
->prev_bb
->frequency
* 10
772 && (bb
->prev_bb
->frequency
773 <= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
/ 2))))
775 log
= JUMP_ALIGN (label
);
777 fprintf (dump_file
, " jump alignment added.\n");
781 max_skip
= targetm
.asm_out
.jump_align_max_skip (label
);
784 /* In case block is frequent and reached mostly by non-fallthru edge,
785 align it. It is most likely a first block of loop. */
787 && !(single_succ_p (bb
)
788 && single_succ (bb
) == EXIT_BLOCK_PTR_FOR_FN (cfun
))
789 && optimize_bb_for_speed_p (bb
)
790 && branch_frequency
+ fallthru_frequency
> freq_threshold
792 > fallthru_frequency
* PARAM_VALUE (PARAM_ALIGN_LOOP_ITERATIONS
)))
794 log
= LOOP_ALIGN (label
);
796 fprintf (dump_file
, " internal loop alignment added.\n");
800 max_skip
= targetm
.asm_out
.loop_align_max_skip (label
);
803 LABEL_TO_ALIGNMENT (label
) = max_log
;
804 LABEL_TO_MAX_SKIP (label
) = max_skip
;
807 loop_optimizer_finalize ();
808 free_dominance_info (CDI_DOMINATORS
);
812 /* Grow the LABEL_ALIGN array after new labels are created. */
815 grow_label_align (void)
817 int old
= max_labelno
;
821 max_labelno
= max_label_num ();
823 n_labels
= max_labelno
- min_labelno
+ 1;
824 n_old_labels
= old
- min_labelno
+ 1;
826 label_align
= XRESIZEVEC (struct label_alignment
, label_align
, n_labels
);
828 /* Range of labels grows monotonically in the function. Failing here
829 means that the initialization of array got lost. */
830 gcc_assert (n_old_labels
<= n_labels
);
832 memset (label_align
+ n_old_labels
, 0,
833 (n_labels
- n_old_labels
) * sizeof (struct label_alignment
));
836 /* Update the already computed alignment information. LABEL_PAIRS is a vector
837 made up of pairs of labels for which the alignment information of the first
838 element will be copied from that of the second element. */
841 update_alignments (vec
<rtx
> &label_pairs
)
844 rtx iter
, label
= NULL_RTX
;
846 if (max_labelno
!= max_label_num ())
849 FOR_EACH_VEC_ELT (label_pairs
, i
, iter
)
852 LABEL_TO_ALIGNMENT (label
) = LABEL_TO_ALIGNMENT (iter
);
853 LABEL_TO_MAX_SKIP (label
) = LABEL_TO_MAX_SKIP (iter
);
861 const pass_data pass_data_compute_alignments
=
864 "alignments", /* name */
865 OPTGROUP_NONE
, /* optinfo_flags */
867 0, /* properties_required */
868 0, /* properties_provided */
869 0, /* properties_destroyed */
870 0, /* todo_flags_start */
871 0, /* todo_flags_finish */
874 class pass_compute_alignments
: public rtl_opt_pass
877 pass_compute_alignments (gcc::context
*ctxt
)
878 : rtl_opt_pass (pass_data_compute_alignments
, ctxt
)
881 /* opt_pass methods: */
882 virtual unsigned int execute (function
*) { return compute_alignments (); }
884 }; // class pass_compute_alignments
889 make_pass_compute_alignments (gcc::context
*ctxt
)
891 return new pass_compute_alignments (ctxt
);
895 /* Make a pass over all insns and compute their actual lengths by shortening
896 any branches of variable length if possible. */
898 /* shorten_branches might be called multiple times: for example, the SH
899 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
900 In order to do this, it needs proper length information, which it obtains
901 by calling shorten_branches. This cannot be collapsed with
902 shorten_branches itself into a single pass unless we also want to integrate
903 reorg.c, since the branch splitting exposes new instructions with delay
907 shorten_branches (rtx_insn
*first
)
914 #define MAX_CODE_ALIGN 16
916 int something_changed
= 1;
917 char *varying_length
;
920 rtx align_tab
[MAX_CODE_ALIGN
];
922 /* Compute maximum UID and allocate label_align / uid_shuid. */
923 max_uid
= get_max_uid ();
925 /* Free uid_shuid before reallocating it. */
928 uid_shuid
= XNEWVEC (int, max_uid
);
930 if (max_labelno
!= max_label_num ())
933 /* Initialize label_align and set up uid_shuid to be strictly
934 monotonically rising with insn order. */
935 /* We use max_log here to keep track of the maximum alignment we want to
936 impose on the next CODE_LABEL (or the current one if we are processing
937 the CODE_LABEL itself). */
942 for (insn
= get_insns (), i
= 1; insn
; insn
= NEXT_INSN (insn
))
946 INSN_SHUID (insn
) = i
++;
953 bool next_is_jumptable
;
955 /* Merge in alignments computed by compute_alignments. */
956 log
= LABEL_TO_ALIGNMENT (insn
);
960 max_skip
= LABEL_TO_MAX_SKIP (insn
);
963 next
= next_nonnote_insn (insn
);
964 next_is_jumptable
= next
&& JUMP_TABLE_DATA_P (next
);
965 if (!next_is_jumptable
)
967 log
= LABEL_ALIGN (insn
);
971 max_skip
= targetm
.asm_out
.label_align_max_skip (insn
);
974 /* ADDR_VECs only take room if read-only data goes into the text
976 if ((JUMP_TABLES_IN_TEXT_SECTION
977 || readonly_data_section
== text_section
)
978 && next_is_jumptable
)
980 log
= ADDR_VEC_ALIGN (next
);
984 max_skip
= targetm
.asm_out
.label_align_max_skip (insn
);
987 LABEL_TO_ALIGNMENT (insn
) = max_log
;
988 LABEL_TO_MAX_SKIP (insn
) = max_skip
;
992 else if (BARRIER_P (insn
))
996 for (label
= insn
; label
&& ! INSN_P (label
);
997 label
= NEXT_INSN (label
))
1000 log
= LABEL_ALIGN_AFTER_BARRIER (insn
);
1004 max_skip
= targetm
.asm_out
.label_align_after_barrier_max_skip (label
);
1010 if (!HAVE_ATTR_length
)
1013 /* Allocate the rest of the arrays. */
1014 insn_lengths
= XNEWVEC (int, max_uid
);
1015 insn_lengths_max_uid
= max_uid
;
1016 /* Syntax errors can lead to labels being outside of the main insn stream.
1017 Initialize insn_addresses, so that we get reproducible results. */
1018 INSN_ADDRESSES_ALLOC (max_uid
);
1020 varying_length
= XCNEWVEC (char, max_uid
);
1022 /* Initialize uid_align. We scan instructions
1023 from end to start, and keep in align_tab[n] the last seen insn
1024 that does an alignment of at least n+1, i.e. the successor
1025 in the alignment chain for an insn that does / has a known
1027 uid_align
= XCNEWVEC (rtx
, max_uid
);
1029 for (i
= MAX_CODE_ALIGN
; --i
>= 0;)
1030 align_tab
[i
] = NULL_RTX
;
1031 seq
= get_last_insn ();
1032 for (; seq
; seq
= PREV_INSN (seq
))
1034 int uid
= INSN_UID (seq
);
1036 log
= (LABEL_P (seq
) ? LABEL_TO_ALIGNMENT (seq
) : 0);
1037 uid_align
[uid
] = align_tab
[0];
1040 /* Found an alignment label. */
1041 uid_align
[uid
] = align_tab
[log
];
1042 for (i
= log
- 1; i
>= 0; i
--)
1047 /* When optimizing, we start assuming minimum length, and keep increasing
1048 lengths as we find the need for this, till nothing changes.
1049 When not optimizing, we start assuming maximum lengths, and
1050 do a single pass to update the lengths. */
1051 bool increasing
= optimize
!= 0;
1053 #ifdef CASE_VECTOR_SHORTEN_MODE
1056 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1059 int min_shuid
= INSN_SHUID (get_insns ()) - 1;
1060 int max_shuid
= INSN_SHUID (get_last_insn ()) + 1;
1063 for (insn
= first
; insn
!= 0; insn
= NEXT_INSN (insn
))
1065 rtx min_lab
= NULL_RTX
, max_lab
= NULL_RTX
, pat
;
1066 int len
, i
, min
, max
, insn_shuid
;
1068 addr_diff_vec_flags flags
;
1070 if (! JUMP_TABLE_DATA_P (insn
)
1071 || GET_CODE (PATTERN (insn
)) != ADDR_DIFF_VEC
)
1073 pat
= PATTERN (insn
);
1074 len
= XVECLEN (pat
, 1);
1075 gcc_assert (len
> 0);
1076 min_align
= MAX_CODE_ALIGN
;
1077 for (min
= max_shuid
, max
= min_shuid
, i
= len
- 1; i
>= 0; i
--)
1079 rtx lab
= XEXP (XVECEXP (pat
, 1, i
), 0);
1080 int shuid
= INSN_SHUID (lab
);
1091 if (min_align
> LABEL_TO_ALIGNMENT (lab
))
1092 min_align
= LABEL_TO_ALIGNMENT (lab
);
1094 XEXP (pat
, 2) = gen_rtx_LABEL_REF (Pmode
, min_lab
);
1095 XEXP (pat
, 3) = gen_rtx_LABEL_REF (Pmode
, max_lab
);
1096 insn_shuid
= INSN_SHUID (insn
);
1097 rel
= INSN_SHUID (XEXP (XEXP (pat
, 0), 0));
1098 memset (&flags
, 0, sizeof (flags
));
1099 flags
.min_align
= min_align
;
1100 flags
.base_after_vec
= rel
> insn_shuid
;
1101 flags
.min_after_vec
= min
> insn_shuid
;
1102 flags
.max_after_vec
= max
> insn_shuid
;
1103 flags
.min_after_base
= min
> rel
;
1104 flags
.max_after_base
= max
> rel
;
1105 ADDR_DIFF_VEC_FLAGS (pat
) = flags
;
1108 PUT_MODE (pat
, CASE_VECTOR_SHORTEN_MODE (0, 0, pat
));
1111 #endif /* CASE_VECTOR_SHORTEN_MODE */
1113 /* Compute initial lengths, addresses, and varying flags for each insn. */
1114 int (*length_fun
) (rtx_insn
*) = increasing
? insn_min_length
: insn_default_length
;
1116 for (insn_current_address
= 0, insn
= first
;
1118 insn_current_address
+= insn_lengths
[uid
], insn
= NEXT_INSN (insn
))
1120 uid
= INSN_UID (insn
);
1122 insn_lengths
[uid
] = 0;
1126 int log
= LABEL_TO_ALIGNMENT (insn
);
1129 int align
= 1 << log
;
1130 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1131 insn_lengths
[uid
] = new_address
- insn_current_address
;
1135 INSN_ADDRESSES (uid
) = insn_current_address
+ insn_lengths
[uid
];
1137 if (NOTE_P (insn
) || BARRIER_P (insn
)
1138 || LABEL_P (insn
) || DEBUG_INSN_P (insn
))
1140 if (insn
->deleted ())
1143 body
= PATTERN (insn
);
1144 if (JUMP_TABLE_DATA_P (insn
))
1146 /* This only takes room if read-only data goes into the text
1148 if (JUMP_TABLES_IN_TEXT_SECTION
1149 || readonly_data_section
== text_section
)
1150 insn_lengths
[uid
] = (XVECLEN (body
,
1151 GET_CODE (body
) == ADDR_DIFF_VEC
)
1152 * GET_MODE_SIZE (GET_MODE (body
)));
1153 /* Alignment is handled by ADDR_VEC_ALIGN. */
1155 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
1156 insn_lengths
[uid
] = asm_insn_count (body
) * insn_default_length (insn
);
1157 else if (rtx_sequence
*body_seq
= dyn_cast
<rtx_sequence
*> (body
))
1160 int const_delay_slots
;
1162 const_delay_slots
= const_num_delay_slots (body_seq
->insn (0));
1164 const_delay_slots
= 0;
1166 int (*inner_length_fun
) (rtx_insn
*)
1167 = const_delay_slots
? length_fun
: insn_default_length
;
1168 /* Inside a delay slot sequence, we do not do any branch shortening
1169 if the shortening could change the number of delay slots
1171 for (i
= 0; i
< body_seq
->len (); i
++)
1173 rtx_insn
*inner_insn
= body_seq
->insn (i
);
1174 int inner_uid
= INSN_UID (inner_insn
);
1177 if (GET_CODE (body
) == ASM_INPUT
1178 || asm_noperands (PATTERN (inner_insn
)) >= 0)
1179 inner_length
= (asm_insn_count (PATTERN (inner_insn
))
1180 * insn_default_length (inner_insn
));
1182 inner_length
= inner_length_fun (inner_insn
);
1184 insn_lengths
[inner_uid
] = inner_length
;
1185 if (const_delay_slots
)
1187 if ((varying_length
[inner_uid
]
1188 = insn_variable_length_p (inner_insn
)) != 0)
1189 varying_length
[uid
] = 1;
1190 INSN_ADDRESSES (inner_uid
) = (insn_current_address
1191 + insn_lengths
[uid
]);
1194 varying_length
[inner_uid
] = 0;
1195 insn_lengths
[uid
] += inner_length
;
1198 else if (GET_CODE (body
) != USE
&& GET_CODE (body
) != CLOBBER
)
1200 insn_lengths
[uid
] = length_fun (insn
);
1201 varying_length
[uid
] = insn_variable_length_p (insn
);
1204 /* If needed, do any adjustment. */
1205 #ifdef ADJUST_INSN_LENGTH
1206 ADJUST_INSN_LENGTH (insn
, insn_lengths
[uid
]);
1207 if (insn_lengths
[uid
] < 0)
1208 fatal_insn ("negative insn length", insn
);
1212 /* Now loop over all the insns finding varying length insns. For each,
1213 get the current insn length. If it has changed, reflect the change.
1214 When nothing changes for a full pass, we are done. */
1216 while (something_changed
)
1218 something_changed
= 0;
1219 insn_current_align
= MAX_CODE_ALIGN
- 1;
1220 for (insn_current_address
= 0, insn
= first
;
1222 insn
= NEXT_INSN (insn
))
1225 #ifdef ADJUST_INSN_LENGTH
1230 uid
= INSN_UID (insn
);
1234 int log
= LABEL_TO_ALIGNMENT (insn
);
1236 #ifdef CASE_VECTOR_SHORTEN_MODE
1237 /* If the mode of a following jump table was changed, we
1238 may need to update the alignment of this label. */
1240 bool next_is_jumptable
;
1242 next
= next_nonnote_insn (insn
);
1243 next_is_jumptable
= next
&& JUMP_TABLE_DATA_P (next
);
1244 if ((JUMP_TABLES_IN_TEXT_SECTION
1245 || readonly_data_section
== text_section
)
1246 && next_is_jumptable
)
1248 int newlog
= ADDR_VEC_ALIGN (next
);
1252 LABEL_TO_ALIGNMENT (insn
) = log
;
1253 something_changed
= 1;
1258 if (log
> insn_current_align
)
1260 int align
= 1 << log
;
1261 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1262 insn_lengths
[uid
] = new_address
- insn_current_address
;
1263 insn_current_align
= log
;
1264 insn_current_address
= new_address
;
1267 insn_lengths
[uid
] = 0;
1268 INSN_ADDRESSES (uid
) = insn_current_address
;
1272 length_align
= INSN_LENGTH_ALIGNMENT (insn
);
1273 if (length_align
< insn_current_align
)
1274 insn_current_align
= length_align
;
1276 insn_last_address
= INSN_ADDRESSES (uid
);
1277 INSN_ADDRESSES (uid
) = insn_current_address
;
1279 #ifdef CASE_VECTOR_SHORTEN_MODE
1281 && JUMP_TABLE_DATA_P (insn
)
1282 && GET_CODE (PATTERN (insn
)) == ADDR_DIFF_VEC
)
1284 rtx body
= PATTERN (insn
);
1285 int old_length
= insn_lengths
[uid
];
1287 safe_as_a
<rtx_insn
*> (XEXP (XEXP (body
, 0), 0));
1288 rtx min_lab
= XEXP (XEXP (body
, 2), 0);
1289 rtx max_lab
= XEXP (XEXP (body
, 3), 0);
1290 int rel_addr
= INSN_ADDRESSES (INSN_UID (rel_lab
));
1291 int min_addr
= INSN_ADDRESSES (INSN_UID (min_lab
));
1292 int max_addr
= INSN_ADDRESSES (INSN_UID (max_lab
));
1295 addr_diff_vec_flags flags
;
1296 enum machine_mode vec_mode
;
1298 /* Avoid automatic aggregate initialization. */
1299 flags
= ADDR_DIFF_VEC_FLAGS (body
);
1301 /* Try to find a known alignment for rel_lab. */
1302 for (prev
= rel_lab
;
1304 && ! insn_lengths
[INSN_UID (prev
)]
1305 && ! (varying_length
[INSN_UID (prev
)] & 1);
1306 prev
= PREV_INSN (prev
))
1307 if (varying_length
[INSN_UID (prev
)] & 2)
1309 rel_align
= LABEL_TO_ALIGNMENT (prev
);
1313 /* See the comment on addr_diff_vec_flags in rtl.h for the
1314 meaning of the flags values. base: REL_LAB vec: INSN */
1315 /* Anything after INSN has still addresses from the last
1316 pass; adjust these so that they reflect our current
1317 estimate for this pass. */
1318 if (flags
.base_after_vec
)
1319 rel_addr
+= insn_current_address
- insn_last_address
;
1320 if (flags
.min_after_vec
)
1321 min_addr
+= insn_current_address
- insn_last_address
;
1322 if (flags
.max_after_vec
)
1323 max_addr
+= insn_current_address
- insn_last_address
;
1324 /* We want to know the worst case, i.e. lowest possible value
1325 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1326 its offset is positive, and we have to be wary of code shrink;
1327 otherwise, it is negative, and we have to be vary of code
1329 if (flags
.min_after_base
)
1331 /* If INSN is between REL_LAB and MIN_LAB, the size
1332 changes we are about to make can change the alignment
1333 within the observed offset, therefore we have to break
1334 it up into two parts that are independent. */
1335 if (! flags
.base_after_vec
&& flags
.min_after_vec
)
1337 min_addr
-= align_fuzz (rel_lab
, insn
, rel_align
, 0);
1338 min_addr
-= align_fuzz (insn
, min_lab
, 0, 0);
1341 min_addr
-= align_fuzz (rel_lab
, min_lab
, rel_align
, 0);
1345 if (flags
.base_after_vec
&& ! flags
.min_after_vec
)
1347 min_addr
-= align_fuzz (min_lab
, insn
, 0, ~0);
1348 min_addr
-= align_fuzz (insn
, rel_lab
, 0, ~0);
1351 min_addr
-= align_fuzz (min_lab
, rel_lab
, 0, ~0);
1353 /* Likewise, determine the highest lowest possible value
1354 for the offset of MAX_LAB. */
1355 if (flags
.max_after_base
)
1357 if (! flags
.base_after_vec
&& flags
.max_after_vec
)
1359 max_addr
+= align_fuzz (rel_lab
, insn
, rel_align
, ~0);
1360 max_addr
+= align_fuzz (insn
, max_lab
, 0, ~0);
1363 max_addr
+= align_fuzz (rel_lab
, max_lab
, rel_align
, ~0);
1367 if (flags
.base_after_vec
&& ! flags
.max_after_vec
)
1369 max_addr
+= align_fuzz (max_lab
, insn
, 0, 0);
1370 max_addr
+= align_fuzz (insn
, rel_lab
, 0, 0);
1373 max_addr
+= align_fuzz (max_lab
, rel_lab
, 0, 0);
1375 vec_mode
= CASE_VECTOR_SHORTEN_MODE (min_addr
- rel_addr
,
1376 max_addr
- rel_addr
, body
);
1378 || (GET_MODE_SIZE (vec_mode
)
1379 >= GET_MODE_SIZE (GET_MODE (body
))))
1380 PUT_MODE (body
, vec_mode
);
1381 if (JUMP_TABLES_IN_TEXT_SECTION
1382 || readonly_data_section
== text_section
)
1385 = (XVECLEN (body
, 1) * GET_MODE_SIZE (GET_MODE (body
)));
1386 insn_current_address
+= insn_lengths
[uid
];
1387 if (insn_lengths
[uid
] != old_length
)
1388 something_changed
= 1;
1393 #endif /* CASE_VECTOR_SHORTEN_MODE */
1395 if (! (varying_length
[uid
]))
1397 if (NONJUMP_INSN_P (insn
)
1398 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1402 body
= PATTERN (insn
);
1403 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1405 rtx inner_insn
= XVECEXP (body
, 0, i
);
1406 int inner_uid
= INSN_UID (inner_insn
);
1408 INSN_ADDRESSES (inner_uid
) = insn_current_address
;
1410 insn_current_address
+= insn_lengths
[inner_uid
];
1414 insn_current_address
+= insn_lengths
[uid
];
1419 if (NONJUMP_INSN_P (insn
) && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1421 rtx_sequence
*seqn
= as_a
<rtx_sequence
*> (PATTERN (insn
));
1424 body
= PATTERN (insn
);
1426 for (i
= 0; i
< seqn
->len (); i
++)
1428 rtx_insn
*inner_insn
= seqn
->insn (i
);
1429 int inner_uid
= INSN_UID (inner_insn
);
1432 INSN_ADDRESSES (inner_uid
) = insn_current_address
;
1434 /* insn_current_length returns 0 for insns with a
1435 non-varying length. */
1436 if (! varying_length
[inner_uid
])
1437 inner_length
= insn_lengths
[inner_uid
];
1439 inner_length
= insn_current_length (inner_insn
);
1441 if (inner_length
!= insn_lengths
[inner_uid
])
1443 if (!increasing
|| inner_length
> insn_lengths
[inner_uid
])
1445 insn_lengths
[inner_uid
] = inner_length
;
1446 something_changed
= 1;
1449 inner_length
= insn_lengths
[inner_uid
];
1451 insn_current_address
+= inner_length
;
1452 new_length
+= inner_length
;
1457 new_length
= insn_current_length (insn
);
1458 insn_current_address
+= new_length
;
1461 #ifdef ADJUST_INSN_LENGTH
1462 /* If needed, do any adjustment. */
1463 tmp_length
= new_length
;
1464 ADJUST_INSN_LENGTH (insn
, new_length
);
1465 insn_current_address
+= (new_length
- tmp_length
);
1468 if (new_length
!= insn_lengths
[uid
]
1469 && (!increasing
|| new_length
> insn_lengths
[uid
]))
1471 insn_lengths
[uid
] = new_length
;
1472 something_changed
= 1;
1475 insn_current_address
+= insn_lengths
[uid
] - new_length
;
1477 /* For a non-optimizing compile, do only a single pass. */
1482 free (varying_length
);
1485 /* Given the body of an INSN known to be generated by an ASM statement, return
1486 the number of machine instructions likely to be generated for this insn.
1487 This is used to compute its length. */
1490 asm_insn_count (rtx body
)
1494 if (GET_CODE (body
) == ASM_INPUT
)
1495 templ
= XSTR (body
, 0);
1497 templ
= decode_asm_operands (body
, NULL
, NULL
, NULL
, NULL
, NULL
);
1499 return asm_str_count (templ
);
1502 /* Return the number of machine instructions likely to be generated for the
1503 inline-asm template. */
1505 asm_str_count (const char *templ
)
1512 for (; *templ
; templ
++)
1513 if (IS_ASM_LOGICAL_LINE_SEPARATOR (*templ
, templ
)
1520 /* ??? This is probably the wrong place for these. */
1521 /* Structure recording the mapping from source file and directory
1522 names at compile time to those to be embedded in debug
1524 typedef struct debug_prefix_map
1526 const char *old_prefix
;
1527 const char *new_prefix
;
1530 struct debug_prefix_map
*next
;
1533 /* Linked list of such structures. */
1534 static debug_prefix_map
*debug_prefix_maps
;
1537 /* Record a debug file prefix mapping. ARG is the argument to
1538 -fdebug-prefix-map and must be of the form OLD=NEW. */
1541 add_debug_prefix_map (const char *arg
)
1543 debug_prefix_map
*map
;
1546 p
= strchr (arg
, '=');
1549 error ("invalid argument %qs to -fdebug-prefix-map", arg
);
1552 map
= XNEW (debug_prefix_map
);
1553 map
->old_prefix
= xstrndup (arg
, p
- arg
);
1554 map
->old_len
= p
- arg
;
1556 map
->new_prefix
= xstrdup (p
);
1557 map
->new_len
= strlen (p
);
1558 map
->next
= debug_prefix_maps
;
1559 debug_prefix_maps
= map
;
1562 /* Perform user-specified mapping of debug filename prefixes. Return
1563 the new name corresponding to FILENAME. */
1566 remap_debug_filename (const char *filename
)
1568 debug_prefix_map
*map
;
1573 for (map
= debug_prefix_maps
; map
; map
= map
->next
)
1574 if (filename_ncmp (filename
, map
->old_prefix
, map
->old_len
) == 0)
1578 name
= filename
+ map
->old_len
;
1579 name_len
= strlen (name
) + 1;
1580 s
= (char *) alloca (name_len
+ map
->new_len
);
1581 memcpy (s
, map
->new_prefix
, map
->new_len
);
1582 memcpy (s
+ map
->new_len
, name
, name_len
);
1583 return ggc_strdup (s
);
1586 /* Return true if DWARF2 debug info can be emitted for DECL. */
1589 dwarf2_debug_info_emitted_p (tree decl
)
1591 if (write_symbols
!= DWARF2_DEBUG
&& write_symbols
!= VMS_AND_DWARF2_DEBUG
)
1594 if (DECL_IGNORED_P (decl
))
1600 /* Return scope resulting from combination of S1 and S2. */
1602 choose_inner_scope (tree s1
, tree s2
)
1608 if (BLOCK_NUMBER (s1
) > BLOCK_NUMBER (s2
))
1613 /* Emit lexical block notes needed to change scope from S1 to S2. */
1616 change_scope (rtx_insn
*orig_insn
, tree s1
, tree s2
)
1618 rtx_insn
*insn
= orig_insn
;
1619 tree com
= NULL_TREE
;
1620 tree ts1
= s1
, ts2
= s2
;
1625 gcc_assert (ts1
&& ts2
);
1626 if (BLOCK_NUMBER (ts1
) > BLOCK_NUMBER (ts2
))
1627 ts1
= BLOCK_SUPERCONTEXT (ts1
);
1628 else if (BLOCK_NUMBER (ts1
) < BLOCK_NUMBER (ts2
))
1629 ts2
= BLOCK_SUPERCONTEXT (ts2
);
1632 ts1
= BLOCK_SUPERCONTEXT (ts1
);
1633 ts2
= BLOCK_SUPERCONTEXT (ts2
);
1642 rtx_note
*note
= emit_note_before (NOTE_INSN_BLOCK_END
, insn
);
1643 NOTE_BLOCK (note
) = s
;
1644 s
= BLOCK_SUPERCONTEXT (s
);
1651 insn
= emit_note_before (NOTE_INSN_BLOCK_BEG
, insn
);
1652 NOTE_BLOCK (insn
) = s
;
1653 s
= BLOCK_SUPERCONTEXT (s
);
1657 /* Rebuild all the NOTE_INSN_BLOCK_BEG and NOTE_INSN_BLOCK_END notes based
1658 on the scope tree and the newly reordered instructions. */
1661 reemit_insn_block_notes (void)
1663 tree cur_block
= DECL_INITIAL (cfun
->decl
);
1667 insn
= get_insns ();
1668 for (; insn
; insn
= NEXT_INSN (insn
))
1672 /* Prevent lexical blocks from straddling section boundaries. */
1673 if (NOTE_P (insn
) && NOTE_KIND (insn
) == NOTE_INSN_SWITCH_TEXT_SECTIONS
)
1675 for (tree s
= cur_block
; s
!= DECL_INITIAL (cfun
->decl
);
1676 s
= BLOCK_SUPERCONTEXT (s
))
1678 rtx_note
*note
= emit_note_before (NOTE_INSN_BLOCK_END
, insn
);
1679 NOTE_BLOCK (note
) = s
;
1680 note
= emit_note_after (NOTE_INSN_BLOCK_BEG
, insn
);
1681 NOTE_BLOCK (note
) = s
;
1685 if (!active_insn_p (insn
))
1688 /* Avoid putting scope notes between jump table and its label. */
1689 if (JUMP_TABLE_DATA_P (insn
))
1692 this_block
= insn_scope (insn
);
1693 /* For sequences compute scope resulting from merging all scopes
1694 of instructions nested inside. */
1695 if (rtx_sequence
*body
= dyn_cast
<rtx_sequence
*> (PATTERN (insn
)))
1700 for (i
= 0; i
< body
->len (); i
++)
1701 this_block
= choose_inner_scope (this_block
,
1702 insn_scope (body
->insn (i
)));
1706 if (INSN_LOCATION (insn
) == UNKNOWN_LOCATION
)
1709 this_block
= DECL_INITIAL (cfun
->decl
);
1712 if (this_block
!= cur_block
)
1714 change_scope (insn
, cur_block
, this_block
);
1715 cur_block
= this_block
;
1719 /* change_scope emits before the insn, not after. */
1720 note
= emit_note (NOTE_INSN_DELETED
);
1721 change_scope (note
, cur_block
, DECL_INITIAL (cfun
->decl
));
1727 static const char *some_local_dynamic_name
;
1729 /* Locate some local-dynamic symbol still in use by this function
1730 so that we can print its name in local-dynamic base patterns.
1731 Return null if there are no local-dynamic references. */
1734 get_some_local_dynamic_name ()
1736 subrtx_iterator::array_type array
;
1739 if (some_local_dynamic_name
)
1740 return some_local_dynamic_name
;
1742 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
1743 if (NONDEBUG_INSN_P (insn
))
1744 FOR_EACH_SUBRTX (iter
, array
, PATTERN (insn
), ALL
)
1746 const_rtx x
= *iter
;
1747 if (GET_CODE (x
) == SYMBOL_REF
)
1749 if (SYMBOL_REF_TLS_MODEL (x
) == TLS_MODEL_LOCAL_DYNAMIC
)
1750 return some_local_dynamic_name
= XSTR (x
, 0);
1751 if (CONSTANT_POOL_ADDRESS_P (x
))
1752 iter
.substitute (get_pool_constant (x
));
1759 /* Output assembler code for the start of a function,
1760 and initialize some of the variables in this file
1761 for the new function. The label for the function and associated
1762 assembler pseudo-ops have already been output in `assemble_start_function'.
1764 FIRST is the first insn of the rtl for the function being compiled.
1765 FILE is the file to write assembler code to.
1766 OPTIMIZE_P is nonzero if we should eliminate redundant
1767 test and compare insns. */
1770 final_start_function (rtx_insn
*first
, FILE *file
,
1771 int optimize_p ATTRIBUTE_UNUSED
)
1775 this_is_asm_operands
= 0;
1777 need_profile_function
= false;
1779 last_filename
= LOCATION_FILE (prologue_location
);
1780 last_linenum
= LOCATION_LINE (prologue_location
);
1781 last_discriminator
= discriminator
= 0;
1783 high_block_linenum
= high_function_linenum
= last_linenum
;
1785 if (flag_sanitize
& SANITIZE_ADDRESS
)
1786 asan_function_start ();
1788 if (!DECL_IGNORED_P (current_function_decl
))
1789 debug_hooks
->begin_prologue (last_linenum
, last_filename
);
1791 if (!dwarf2_debug_info_emitted_p (current_function_decl
))
1792 dwarf2out_begin_prologue (0, NULL
);
1794 #ifdef LEAF_REG_REMAP
1795 if (crtl
->uses_only_leaf_regs
)
1796 leaf_renumber_regs (first
);
1799 /* The Sun386i and perhaps other machines don't work right
1800 if the profiling code comes after the prologue. */
1801 if (targetm
.profile_before_prologue () && crtl
->profile
)
1803 if (targetm
.asm_out
.function_prologue
1804 == default_function_pro_epilogue
1805 #ifdef HAVE_prologue
1811 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1817 else if (NOTE_KIND (insn
) == NOTE_INSN_BASIC_BLOCK
1818 || NOTE_KIND (insn
) == NOTE_INSN_FUNCTION_BEG
)
1820 else if (NOTE_KIND (insn
) == NOTE_INSN_DELETED
1821 || NOTE_KIND (insn
) == NOTE_INSN_VAR_LOCATION
)
1830 need_profile_function
= true;
1832 profile_function (file
);
1835 profile_function (file
);
1838 /* If debugging, assign block numbers to all of the blocks in this
1842 reemit_insn_block_notes ();
1843 number_blocks (current_function_decl
);
1844 /* We never actually put out begin/end notes for the top-level
1845 block in the function. But, conceptually, that block is
1847 TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl
)) = 1;
1850 if (warn_frame_larger_than
1851 && get_frame_size () > frame_larger_than_size
)
1853 /* Issue a warning */
1854 warning (OPT_Wframe_larger_than_
,
1855 "the frame size of %wd bytes is larger than %wd bytes",
1856 get_frame_size (), frame_larger_than_size
);
1859 /* First output the function prologue: code to set up the stack frame. */
1860 targetm
.asm_out
.function_prologue (file
, get_frame_size ());
1862 /* If the machine represents the prologue as RTL, the profiling code must
1863 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1864 #ifdef HAVE_prologue
1865 if (! HAVE_prologue
)
1867 profile_after_prologue (file
);
1871 profile_after_prologue (FILE *file ATTRIBUTE_UNUSED
)
1873 if (!targetm
.profile_before_prologue () && crtl
->profile
)
1874 profile_function (file
);
1878 profile_function (FILE *file ATTRIBUTE_UNUSED
)
1880 #ifndef NO_PROFILE_COUNTERS
1881 # define NO_PROFILE_COUNTERS 0
1883 #ifdef ASM_OUTPUT_REG_PUSH
1884 rtx sval
= NULL
, chain
= NULL
;
1886 if (cfun
->returns_struct
)
1887 sval
= targetm
.calls
.struct_value_rtx (TREE_TYPE (current_function_decl
),
1889 if (cfun
->static_chain_decl
)
1890 chain
= targetm
.calls
.static_chain (current_function_decl
, true);
1891 #endif /* ASM_OUTPUT_REG_PUSH */
1893 if (! NO_PROFILE_COUNTERS
)
1895 int align
= MIN (BIGGEST_ALIGNMENT
, LONG_TYPE_SIZE
);
1896 switch_to_section (data_section
);
1897 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
1898 targetm
.asm_out
.internal_label (file
, "LP", current_function_funcdef_no
);
1899 assemble_integer (const0_rtx
, LONG_TYPE_SIZE
/ BITS_PER_UNIT
, align
, 1);
1902 switch_to_section (current_function_section ());
1904 #ifdef ASM_OUTPUT_REG_PUSH
1905 if (sval
&& REG_P (sval
))
1906 ASM_OUTPUT_REG_PUSH (file
, REGNO (sval
));
1907 if (chain
&& REG_P (chain
))
1908 ASM_OUTPUT_REG_PUSH (file
, REGNO (chain
));
1911 FUNCTION_PROFILER (file
, current_function_funcdef_no
);
1913 #ifdef ASM_OUTPUT_REG_PUSH
1914 if (chain
&& REG_P (chain
))
1915 ASM_OUTPUT_REG_POP (file
, REGNO (chain
));
1916 if (sval
&& REG_P (sval
))
1917 ASM_OUTPUT_REG_POP (file
, REGNO (sval
));
1921 /* Output assembler code for the end of a function.
1922 For clarity, args are same as those of `final_start_function'
1923 even though not all of them are needed. */
1926 final_end_function (void)
1930 if (!DECL_IGNORED_P (current_function_decl
))
1931 debug_hooks
->end_function (high_function_linenum
);
1933 /* Finally, output the function epilogue:
1934 code to restore the stack frame and return to the caller. */
1935 targetm
.asm_out
.function_epilogue (asm_out_file
, get_frame_size ());
1937 /* And debug output. */
1938 if (!DECL_IGNORED_P (current_function_decl
))
1939 debug_hooks
->end_epilogue (last_linenum
, last_filename
);
1941 if (!dwarf2_debug_info_emitted_p (current_function_decl
)
1942 && dwarf2out_do_frame ())
1943 dwarf2out_end_epilogue (last_linenum
, last_filename
);
1945 some_local_dynamic_name
= 0;
1949 /* Dumper helper for basic block information. FILE is the assembly
1950 output file, and INSN is the instruction being emitted. */
1953 dump_basic_block_info (FILE *file
, rtx_insn
*insn
, basic_block
*start_to_bb
,
1954 basic_block
*end_to_bb
, int bb_map_size
, int *bb_seqn
)
1958 if (!flag_debug_asm
)
1961 if (INSN_UID (insn
) < bb_map_size
1962 && (bb
= start_to_bb
[INSN_UID (insn
)]) != NULL
)
1967 fprintf (file
, "%s BLOCK %d", ASM_COMMENT_START
, bb
->index
);
1969 fprintf (file
, " freq:%d", bb
->frequency
);
1971 fprintf (file
, " count:%"PRId64
,
1973 fprintf (file
, " seq:%d", (*bb_seqn
)++);
1974 fprintf (file
, "\n%s PRED:", ASM_COMMENT_START
);
1975 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
1977 dump_edge_info (file
, e
, TDF_DETAILS
, 0);
1979 fprintf (file
, "\n");
1981 if (INSN_UID (insn
) < bb_map_size
1982 && (bb
= end_to_bb
[INSN_UID (insn
)]) != NULL
)
1987 fprintf (asm_out_file
, "%s SUCC:", ASM_COMMENT_START
);
1988 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1990 dump_edge_info (asm_out_file
, e
, TDF_DETAILS
, 1);
1992 fprintf (file
, "\n");
1996 /* Output assembler code for some insns: all or part of a function.
1997 For description of args, see `final_start_function', above. */
2000 final (rtx_insn
*first
, FILE *file
, int optimize_p
)
2002 rtx_insn
*insn
, *next
;
2005 /* Used for -dA dump. */
2006 basic_block
*start_to_bb
= NULL
;
2007 basic_block
*end_to_bb
= NULL
;
2008 int bb_map_size
= 0;
2011 last_ignored_compare
= 0;
2014 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
2016 /* If CC tracking across branches is enabled, record the insn which
2017 jumps to each branch only reached from one place. */
2018 if (optimize_p
&& JUMP_P (insn
))
2020 rtx lab
= JUMP_LABEL (insn
);
2021 if (lab
&& LABEL_P (lab
) && LABEL_NUSES (lab
) == 1)
2023 LABEL_REFS (lab
) = insn
;
2037 bb_map_size
= get_max_uid () + 1;
2038 start_to_bb
= XCNEWVEC (basic_block
, bb_map_size
);
2039 end_to_bb
= XCNEWVEC (basic_block
, bb_map_size
);
2041 /* There is no cfg for a thunk. */
2042 if (!cfun
->is_thunk
)
2043 FOR_EACH_BB_REVERSE_FN (bb
, cfun
)
2045 start_to_bb
[INSN_UID (BB_HEAD (bb
))] = bb
;
2046 end_to_bb
[INSN_UID (BB_END (bb
))] = bb
;
2050 /* Output the insns. */
2051 for (insn
= first
; insn
;)
2053 if (HAVE_ATTR_length
)
2055 if ((unsigned) INSN_UID (insn
) >= INSN_ADDRESSES_SIZE ())
2057 /* This can be triggered by bugs elsewhere in the compiler if
2058 new insns are created after init_insn_lengths is called. */
2059 gcc_assert (NOTE_P (insn
));
2060 insn_current_address
= -1;
2063 insn_current_address
= INSN_ADDRESSES (INSN_UID (insn
));
2066 dump_basic_block_info (file
, insn
, start_to_bb
, end_to_bb
,
2067 bb_map_size
, &bb_seqn
);
2068 insn
= final_scan_insn (insn
, file
, optimize_p
, 0, &seen
);
2077 /* Remove CFI notes, to avoid compare-debug failures. */
2078 for (insn
= first
; insn
; insn
= next
)
2080 next
= NEXT_INSN (insn
);
2082 && (NOTE_KIND (insn
) == NOTE_INSN_CFI
2083 || NOTE_KIND (insn
) == NOTE_INSN_CFI_LABEL
))
2089 get_insn_template (int code
, rtx insn
)
2091 switch (insn_data
[code
].output_format
)
2093 case INSN_OUTPUT_FORMAT_SINGLE
:
2094 return insn_data
[code
].output
.single
;
2095 case INSN_OUTPUT_FORMAT_MULTI
:
2096 return insn_data
[code
].output
.multi
[which_alternative
];
2097 case INSN_OUTPUT_FORMAT_FUNCTION
:
2099 return (*insn_data
[code
].output
.function
) (recog_data
.operand
,
2100 as_a
<rtx_insn
*> (insn
));
2107 /* Emit the appropriate declaration for an alternate-entry-point
2108 symbol represented by INSN, to FILE. INSN is a CODE_LABEL with
2109 LABEL_KIND != LABEL_NORMAL.
2111 The case fall-through in this function is intentional. */
2113 output_alternate_entry_point (FILE *file
, rtx_insn
*insn
)
2115 const char *name
= LABEL_NAME (insn
);
2117 switch (LABEL_KIND (insn
))
2119 case LABEL_WEAK_ENTRY
:
2120 #ifdef ASM_WEAKEN_LABEL
2121 ASM_WEAKEN_LABEL (file
, name
);
2123 case LABEL_GLOBAL_ENTRY
:
2124 targetm
.asm_out
.globalize_label (file
, name
);
2125 case LABEL_STATIC_ENTRY
:
2126 #ifdef ASM_OUTPUT_TYPE_DIRECTIVE
2127 ASM_OUTPUT_TYPE_DIRECTIVE (file
, name
, "function");
2129 ASM_OUTPUT_LABEL (file
, name
);
2138 /* Given a CALL_INSN, find and return the nested CALL. */
2140 call_from_call_insn (rtx_call_insn
*insn
)
2143 gcc_assert (CALL_P (insn
));
2146 while (GET_CODE (x
) != CALL
)
2148 switch (GET_CODE (x
))
2153 x
= COND_EXEC_CODE (x
);
2156 x
= XVECEXP (x
, 0, 0);
2166 /* The final scan for one insn, INSN.
2167 Args are same as in `final', except that INSN
2168 is the insn being scanned.
2169 Value returned is the next insn to be scanned.
2171 NOPEEPHOLES is the flag to disallow peephole processing (currently
2172 used for within delayed branch sequence output).
2174 SEEN is used to track the end of the prologue, for emitting
2175 debug information. We force the emission of a line note after
2176 both NOTE_INSN_PROLOGUE_END and NOTE_INSN_FUNCTION_BEG. */
2179 final_scan_insn (rtx_insn
*insn
, FILE *file
, int optimize_p ATTRIBUTE_UNUSED
,
2180 int nopeepholes ATTRIBUTE_UNUSED
, int *seen
)
2189 /* Ignore deleted insns. These can occur when we split insns (due to a
2190 template of "#") while not optimizing. */
2191 if (insn
->deleted ())
2192 return NEXT_INSN (insn
);
2194 switch (GET_CODE (insn
))
2197 switch (NOTE_KIND (insn
))
2199 case NOTE_INSN_DELETED
:
2202 case NOTE_INSN_SWITCH_TEXT_SECTIONS
:
2203 in_cold_section_p
= !in_cold_section_p
;
2205 if (dwarf2out_do_frame ())
2206 dwarf2out_switch_text_section ();
2207 else if (!DECL_IGNORED_P (current_function_decl
))
2208 debug_hooks
->switch_text_section ();
2210 switch_to_section (current_function_section ());
2211 targetm
.asm_out
.function_switched_text_sections (asm_out_file
,
2212 current_function_decl
,
2214 /* Emit a label for the split cold section. Form label name by
2215 suffixing "cold" to the original function's name. */
2216 if (in_cold_section_p
)
2218 tree cold_function_name
2219 = clone_function_name (current_function_decl
, "cold");
2220 ASM_OUTPUT_LABEL (asm_out_file
,
2221 IDENTIFIER_POINTER (cold_function_name
));
2225 case NOTE_INSN_BASIC_BLOCK
:
2226 if (need_profile_function
)
2228 profile_function (asm_out_file
);
2229 need_profile_function
= false;
2232 if (targetm
.asm_out
.unwind_emit
)
2233 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
2235 discriminator
= NOTE_BASIC_BLOCK (insn
)->discriminator
;
2239 case NOTE_INSN_EH_REGION_BEG
:
2240 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LEHB",
2241 NOTE_EH_HANDLER (insn
));
2244 case NOTE_INSN_EH_REGION_END
:
2245 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LEHE",
2246 NOTE_EH_HANDLER (insn
));
2249 case NOTE_INSN_PROLOGUE_END
:
2250 targetm
.asm_out
.function_end_prologue (file
);
2251 profile_after_prologue (file
);
2253 if ((*seen
& (SEEN_EMITTED
| SEEN_NOTE
)) == SEEN_NOTE
)
2255 *seen
|= SEEN_EMITTED
;
2256 force_source_line
= true;
2263 case NOTE_INSN_EPILOGUE_BEG
:
2264 if (!DECL_IGNORED_P (current_function_decl
))
2265 (*debug_hooks
->begin_epilogue
) (last_linenum
, last_filename
);
2266 targetm
.asm_out
.function_begin_epilogue (file
);
2270 dwarf2out_emit_cfi (NOTE_CFI (insn
));
2273 case NOTE_INSN_CFI_LABEL
:
2274 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LCFI",
2275 NOTE_LABEL_NUMBER (insn
));
2278 case NOTE_INSN_FUNCTION_BEG
:
2279 if (need_profile_function
)
2281 profile_function (asm_out_file
);
2282 need_profile_function
= false;
2286 if (!DECL_IGNORED_P (current_function_decl
))
2287 debug_hooks
->end_prologue (last_linenum
, last_filename
);
2289 if ((*seen
& (SEEN_EMITTED
| SEEN_NOTE
)) == SEEN_NOTE
)
2291 *seen
|= SEEN_EMITTED
;
2292 force_source_line
= true;
2299 case NOTE_INSN_BLOCK_BEG
:
2300 if (debug_info_level
== DINFO_LEVEL_NORMAL
2301 || debug_info_level
== DINFO_LEVEL_VERBOSE
2302 || write_symbols
== DWARF2_DEBUG
2303 || write_symbols
== VMS_AND_DWARF2_DEBUG
2304 || write_symbols
== VMS_DEBUG
)
2306 int n
= BLOCK_NUMBER (NOTE_BLOCK (insn
));
2310 high_block_linenum
= last_linenum
;
2312 /* Output debugging info about the symbol-block beginning. */
2313 if (!DECL_IGNORED_P (current_function_decl
))
2314 debug_hooks
->begin_block (last_linenum
, n
);
2316 /* Mark this block as output. */
2317 TREE_ASM_WRITTEN (NOTE_BLOCK (insn
)) = 1;
2319 if (write_symbols
== DBX_DEBUG
2320 || write_symbols
== SDB_DEBUG
)
2322 location_t
*locus_ptr
2323 = block_nonartificial_location (NOTE_BLOCK (insn
));
2325 if (locus_ptr
!= NULL
)
2327 override_filename
= LOCATION_FILE (*locus_ptr
);
2328 override_linenum
= LOCATION_LINE (*locus_ptr
);
2333 case NOTE_INSN_BLOCK_END
:
2334 if (debug_info_level
== DINFO_LEVEL_NORMAL
2335 || debug_info_level
== DINFO_LEVEL_VERBOSE
2336 || write_symbols
== DWARF2_DEBUG
2337 || write_symbols
== VMS_AND_DWARF2_DEBUG
2338 || write_symbols
== VMS_DEBUG
)
2340 int n
= BLOCK_NUMBER (NOTE_BLOCK (insn
));
2344 /* End of a symbol-block. */
2346 gcc_assert (block_depth
>= 0);
2348 if (!DECL_IGNORED_P (current_function_decl
))
2349 debug_hooks
->end_block (high_block_linenum
, n
);
2351 if (write_symbols
== DBX_DEBUG
2352 || write_symbols
== SDB_DEBUG
)
2354 tree outer_block
= BLOCK_SUPERCONTEXT (NOTE_BLOCK (insn
));
2355 location_t
*locus_ptr
2356 = block_nonartificial_location (outer_block
);
2358 if (locus_ptr
!= NULL
)
2360 override_filename
= LOCATION_FILE (*locus_ptr
);
2361 override_linenum
= LOCATION_LINE (*locus_ptr
);
2365 override_filename
= NULL
;
2366 override_linenum
= 0;
2371 case NOTE_INSN_DELETED_LABEL
:
2372 /* Emit the label. We may have deleted the CODE_LABEL because
2373 the label could be proved to be unreachable, though still
2374 referenced (in the form of having its address taken. */
2375 ASM_OUTPUT_DEBUG_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
2378 case NOTE_INSN_DELETED_DEBUG_LABEL
:
2379 /* Similarly, but need to use different namespace for it. */
2380 if (CODE_LABEL_NUMBER (insn
) != -1)
2381 ASM_OUTPUT_DEBUG_LABEL (file
, "LDL", CODE_LABEL_NUMBER (insn
));
2384 case NOTE_INSN_VAR_LOCATION
:
2385 case NOTE_INSN_CALL_ARG_LOCATION
:
2386 if (!DECL_IGNORED_P (current_function_decl
))
2387 debug_hooks
->var_location (insn
);
2400 /* The target port might emit labels in the output function for
2401 some insn, e.g. sh.c output_branchy_insn. */
2402 if (CODE_LABEL_NUMBER (insn
) <= max_labelno
)
2404 int align
= LABEL_TO_ALIGNMENT (insn
);
2405 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2406 int max_skip
= LABEL_TO_MAX_SKIP (insn
);
2409 if (align
&& NEXT_INSN (insn
))
2411 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2412 ASM_OUTPUT_MAX_SKIP_ALIGN (file
, align
, max_skip
);
2414 #ifdef ASM_OUTPUT_ALIGN_WITH_NOP
2415 ASM_OUTPUT_ALIGN_WITH_NOP (file
, align
);
2417 ASM_OUTPUT_ALIGN (file
, align
);
2424 if (!DECL_IGNORED_P (current_function_decl
) && LABEL_NAME (insn
))
2425 debug_hooks
->label (as_a
<rtx_code_label
*> (insn
));
2429 next
= next_nonnote_insn (insn
);
2430 /* If this label is followed by a jump-table, make sure we put
2431 the label in the read-only section. Also possibly write the
2432 label and jump table together. */
2433 if (next
!= 0 && JUMP_TABLE_DATA_P (next
))
2435 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2436 /* In this case, the case vector is being moved by the
2437 target, so don't output the label at all. Leave that
2438 to the back end macros. */
2440 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2444 switch_to_section (targetm
.asm_out
.function_rodata_section
2445 (current_function_decl
));
2447 #ifdef ADDR_VEC_ALIGN
2448 log_align
= ADDR_VEC_ALIGN (next
);
2450 log_align
= exact_log2 (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
);
2452 ASM_OUTPUT_ALIGN (file
, log_align
);
2455 switch_to_section (current_function_section ());
2457 #ifdef ASM_OUTPUT_CASE_LABEL
2458 ASM_OUTPUT_CASE_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
),
2461 targetm
.asm_out
.internal_label (file
, "L", CODE_LABEL_NUMBER (insn
));
2466 if (LABEL_ALT_ENTRY_P (insn
))
2467 output_alternate_entry_point (file
, insn
);
2469 targetm
.asm_out
.internal_label (file
, "L", CODE_LABEL_NUMBER (insn
));
2474 rtx body
= PATTERN (insn
);
2475 int insn_code_number
;
2479 /* Reset this early so it is correct for ASM statements. */
2480 current_insn_predicate
= NULL_RTX
;
2482 /* An INSN, JUMP_INSN or CALL_INSN.
2483 First check for special kinds that recog doesn't recognize. */
2485 if (GET_CODE (body
) == USE
/* These are just declarations. */
2486 || GET_CODE (body
) == CLOBBER
)
2491 /* If there is a REG_CC_SETTER note on this insn, it means that
2492 the setting of the condition code was done in the delay slot
2493 of the insn that branched here. So recover the cc status
2494 from the insn that set it. */
2496 rtx note
= find_reg_note (insn
, REG_CC_SETTER
, NULL_RTX
);
2499 rtx_insn
*other
= as_a
<rtx_insn
*> (XEXP (note
, 0));
2500 NOTICE_UPDATE_CC (PATTERN (other
), other
);
2501 cc_prev_status
= cc_status
;
2506 /* Detect insns that are really jump-tables
2507 and output them as such. */
2509 if (JUMP_TABLE_DATA_P (insn
))
2511 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2515 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2516 switch_to_section (targetm
.asm_out
.function_rodata_section
2517 (current_function_decl
));
2519 switch_to_section (current_function_section ());
2523 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2524 if (GET_CODE (body
) == ADDR_VEC
)
2526 #ifdef ASM_OUTPUT_ADDR_VEC
2527 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn
), body
);
2534 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2535 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn
), body
);
2541 vlen
= XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
);
2542 for (idx
= 0; idx
< vlen
; idx
++)
2544 if (GET_CODE (body
) == ADDR_VEC
)
2546 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2547 ASM_OUTPUT_ADDR_VEC_ELT
2548 (file
, CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 0, idx
), 0)));
2555 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2556 ASM_OUTPUT_ADDR_DIFF_ELT
2559 CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 1, idx
), 0)),
2560 CODE_LABEL_NUMBER (XEXP (XEXP (body
, 0), 0)));
2566 #ifdef ASM_OUTPUT_CASE_END
2567 ASM_OUTPUT_CASE_END (file
,
2568 CODE_LABEL_NUMBER (PREV_INSN (insn
)),
2573 switch_to_section (current_function_section ());
2577 /* Output this line note if it is the first or the last line
2579 if (!DECL_IGNORED_P (current_function_decl
)
2580 && notice_source_line (insn
, &is_stmt
))
2581 (*debug_hooks
->source_line
) (last_linenum
, last_filename
,
2582 last_discriminator
, is_stmt
);
2584 if (GET_CODE (body
) == ASM_INPUT
)
2586 const char *string
= XSTR (body
, 0);
2588 /* There's no telling what that did to the condition codes. */
2593 expanded_location loc
;
2596 loc
= expand_location (ASM_INPUT_SOURCE_LOCATION (body
));
2597 if (*loc
.file
&& loc
.line
)
2598 fprintf (asm_out_file
, "%s %i \"%s\" 1\n",
2599 ASM_COMMENT_START
, loc
.line
, loc
.file
);
2600 fprintf (asm_out_file
, "\t%s\n", string
);
2601 #if HAVE_AS_LINE_ZERO
2602 if (*loc
.file
&& loc
.line
)
2603 fprintf (asm_out_file
, "%s 0 \"\" 2\n", ASM_COMMENT_START
);
2609 /* Detect `asm' construct with operands. */
2610 if (asm_noperands (body
) >= 0)
2612 unsigned int noperands
= asm_noperands (body
);
2613 rtx
*ops
= XALLOCAVEC (rtx
, noperands
);
2616 expanded_location expanded
;
2618 /* There's no telling what that did to the condition codes. */
2621 /* Get out the operand values. */
2622 string
= decode_asm_operands (body
, ops
, NULL
, NULL
, NULL
, &loc
);
2623 /* Inhibit dying on what would otherwise be compiler bugs. */
2624 insn_noperands
= noperands
;
2625 this_is_asm_operands
= insn
;
2626 expanded
= expand_location (loc
);
2628 #ifdef FINAL_PRESCAN_INSN
2629 FINAL_PRESCAN_INSN (insn
, ops
, insn_noperands
);
2632 /* Output the insn using them. */
2636 if (expanded
.file
&& expanded
.line
)
2637 fprintf (asm_out_file
, "%s %i \"%s\" 1\n",
2638 ASM_COMMENT_START
, expanded
.line
, expanded
.file
);
2639 output_asm_insn (string
, ops
);
2640 #if HAVE_AS_LINE_ZERO
2641 if (expanded
.file
&& expanded
.line
)
2642 fprintf (asm_out_file
, "%s 0 \"\" 2\n", ASM_COMMENT_START
);
2646 if (targetm
.asm_out
.final_postscan_insn
)
2647 targetm
.asm_out
.final_postscan_insn (file
, insn
, ops
,
2650 this_is_asm_operands
= 0;
2656 if (rtx_sequence
*seq
= dyn_cast
<rtx_sequence
*> (body
))
2658 /* A delayed-branch sequence */
2661 final_sequence
= seq
;
2663 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2664 force the restoration of a comparison that was previously
2665 thought unnecessary. If that happens, cancel this sequence
2666 and cause that insn to be restored. */
2668 next
= final_scan_insn (seq
->insn (0), file
, 0, 1, seen
);
2669 if (next
!= seq
->insn (1))
2675 for (i
= 1; i
< seq
->len (); i
++)
2677 rtx_insn
*insn
= seq
->insn (i
);
2678 rtx_insn
*next
= NEXT_INSN (insn
);
2679 /* We loop in case any instruction in a delay slot gets
2682 insn
= final_scan_insn (insn
, file
, 0, 1, seen
);
2683 while (insn
!= next
);
2685 #ifdef DBR_OUTPUT_SEQEND
2686 DBR_OUTPUT_SEQEND (file
);
2690 /* If the insn requiring the delay slot was a CALL_INSN, the
2691 insns in the delay slot are actually executed before the
2692 called function. Hence we don't preserve any CC-setting
2693 actions in these insns and the CC must be marked as being
2694 clobbered by the function. */
2695 if (CALL_P (seq
->insn (0)))
2702 /* We have a real machine instruction as rtl. */
2704 body
= PATTERN (insn
);
2707 set
= single_set (insn
);
2709 /* Check for redundant test and compare instructions
2710 (when the condition codes are already set up as desired).
2711 This is done only when optimizing; if not optimizing,
2712 it should be possible for the user to alter a variable
2713 with the debugger in between statements
2714 and the next statement should reexamine the variable
2715 to compute the condition codes. */
2720 && GET_CODE (SET_DEST (set
)) == CC0
2721 && insn
!= last_ignored_compare
)
2724 if (GET_CODE (SET_SRC (set
)) == SUBREG
)
2725 SET_SRC (set
) = alter_subreg (&SET_SRC (set
), true);
2727 src1
= SET_SRC (set
);
2729 if (GET_CODE (SET_SRC (set
)) == COMPARE
)
2731 if (GET_CODE (XEXP (SET_SRC (set
), 0)) == SUBREG
)
2732 XEXP (SET_SRC (set
), 0)
2733 = alter_subreg (&XEXP (SET_SRC (set
), 0), true);
2734 if (GET_CODE (XEXP (SET_SRC (set
), 1)) == SUBREG
)
2735 XEXP (SET_SRC (set
), 1)
2736 = alter_subreg (&XEXP (SET_SRC (set
), 1), true);
2737 if (XEXP (SET_SRC (set
), 1)
2738 == CONST0_RTX (GET_MODE (XEXP (SET_SRC (set
), 0))))
2739 src2
= XEXP (SET_SRC (set
), 0);
2741 if ((cc_status
.value1
!= 0
2742 && rtx_equal_p (src1
, cc_status
.value1
))
2743 || (cc_status
.value2
!= 0
2744 && rtx_equal_p (src1
, cc_status
.value2
))
2745 || (src2
!= 0 && cc_status
.value1
!= 0
2746 && rtx_equal_p (src2
, cc_status
.value1
))
2747 || (src2
!= 0 && cc_status
.value2
!= 0
2748 && rtx_equal_p (src2
, cc_status
.value2
)))
2750 /* Don't delete insn if it has an addressing side-effect. */
2751 if (! FIND_REG_INC_NOTE (insn
, NULL_RTX
)
2752 /* or if anything in it is volatile. */
2753 && ! volatile_refs_p (PATTERN (insn
)))
2755 /* We don't really delete the insn; just ignore it. */
2756 last_ignored_compare
= insn
;
2763 /* If this is a conditional branch, maybe modify it
2764 if the cc's are in a nonstandard state
2765 so that it accomplishes the same thing that it would
2766 do straightforwardly if the cc's were set up normally. */
2768 if (cc_status
.flags
!= 0
2770 && GET_CODE (body
) == SET
2771 && SET_DEST (body
) == pc_rtx
2772 && GET_CODE (SET_SRC (body
)) == IF_THEN_ELSE
2773 && COMPARISON_P (XEXP (SET_SRC (body
), 0))
2774 && XEXP (XEXP (SET_SRC (body
), 0), 0) == cc0_rtx
)
2776 /* This function may alter the contents of its argument
2777 and clear some of the cc_status.flags bits.
2778 It may also return 1 meaning condition now always true
2779 or -1 meaning condition now always false
2780 or 2 meaning condition nontrivial but altered. */
2781 int result
= alter_cond (XEXP (SET_SRC (body
), 0));
2782 /* If condition now has fixed value, replace the IF_THEN_ELSE
2783 with its then-operand or its else-operand. */
2785 SET_SRC (body
) = XEXP (SET_SRC (body
), 1);
2787 SET_SRC (body
) = XEXP (SET_SRC (body
), 2);
2789 /* The jump is now either unconditional or a no-op.
2790 If it has become a no-op, don't try to output it.
2791 (It would not be recognized.) */
2792 if (SET_SRC (body
) == pc_rtx
)
2797 else if (ANY_RETURN_P (SET_SRC (body
)))
2798 /* Replace (set (pc) (return)) with (return). */
2799 PATTERN (insn
) = body
= SET_SRC (body
);
2801 /* Rerecognize the instruction if it has changed. */
2803 INSN_CODE (insn
) = -1;
2806 /* If this is a conditional trap, maybe modify it if the cc's
2807 are in a nonstandard state so that it accomplishes the same
2808 thing that it would do straightforwardly if the cc's were
2810 if (cc_status
.flags
!= 0
2811 && NONJUMP_INSN_P (insn
)
2812 && GET_CODE (body
) == TRAP_IF
2813 && COMPARISON_P (TRAP_CONDITION (body
))
2814 && XEXP (TRAP_CONDITION (body
), 0) == cc0_rtx
)
2816 /* This function may alter the contents of its argument
2817 and clear some of the cc_status.flags bits.
2818 It may also return 1 meaning condition now always true
2819 or -1 meaning condition now always false
2820 or 2 meaning condition nontrivial but altered. */
2821 int result
= alter_cond (TRAP_CONDITION (body
));
2823 /* If TRAP_CONDITION has become always false, delete the
2831 /* If TRAP_CONDITION has become always true, replace
2832 TRAP_CONDITION with const_true_rtx. */
2834 TRAP_CONDITION (body
) = const_true_rtx
;
2836 /* Rerecognize the instruction if it has changed. */
2838 INSN_CODE (insn
) = -1;
2841 /* Make same adjustments to instructions that examine the
2842 condition codes without jumping and instructions that
2843 handle conditional moves (if this machine has either one). */
2845 if (cc_status
.flags
!= 0
2848 rtx cond_rtx
, then_rtx
, else_rtx
;
2851 && GET_CODE (SET_SRC (set
)) == IF_THEN_ELSE
)
2853 cond_rtx
= XEXP (SET_SRC (set
), 0);
2854 then_rtx
= XEXP (SET_SRC (set
), 1);
2855 else_rtx
= XEXP (SET_SRC (set
), 2);
2859 cond_rtx
= SET_SRC (set
);
2860 then_rtx
= const_true_rtx
;
2861 else_rtx
= const0_rtx
;
2864 if (COMPARISON_P (cond_rtx
)
2865 && XEXP (cond_rtx
, 0) == cc0_rtx
)
2868 result
= alter_cond (cond_rtx
);
2870 validate_change (insn
, &SET_SRC (set
), then_rtx
, 0);
2871 else if (result
== -1)
2872 validate_change (insn
, &SET_SRC (set
), else_rtx
, 0);
2873 else if (result
== 2)
2874 INSN_CODE (insn
) = -1;
2875 if (SET_DEST (set
) == SET_SRC (set
))
2882 #ifdef HAVE_peephole
2883 /* Do machine-specific peephole optimizations if desired. */
2885 if (optimize_p
&& !flag_no_peephole
&& !nopeepholes
)
2887 rtx_insn
*next
= peephole (insn
);
2888 /* When peepholing, if there were notes within the peephole,
2889 emit them before the peephole. */
2890 if (next
!= 0 && next
!= NEXT_INSN (insn
))
2892 rtx_insn
*note
, *prev
= PREV_INSN (insn
);
2894 for (note
= NEXT_INSN (insn
); note
!= next
;
2895 note
= NEXT_INSN (note
))
2896 final_scan_insn (note
, file
, optimize_p
, nopeepholes
, seen
);
2898 /* Put the notes in the proper position for a later
2899 rescan. For example, the SH target can do this
2900 when generating a far jump in a delayed branch
2902 note
= NEXT_INSN (insn
);
2903 SET_PREV_INSN (note
) = prev
;
2904 SET_NEXT_INSN (prev
) = note
;
2905 SET_NEXT_INSN (PREV_INSN (next
)) = insn
;
2906 SET_PREV_INSN (insn
) = PREV_INSN (next
);
2907 SET_NEXT_INSN (insn
) = next
;
2908 SET_PREV_INSN (next
) = insn
;
2911 /* PEEPHOLE might have changed this. */
2912 body
= PATTERN (insn
);
2916 /* Try to recognize the instruction.
2917 If successful, verify that the operands satisfy the
2918 constraints for the instruction. Crash if they don't,
2919 since `reload' should have changed them so that they do. */
2921 insn_code_number
= recog_memoized (insn
);
2922 cleanup_subreg_operands (insn
);
2924 /* Dump the insn in the assembly for debugging (-dAP).
2925 If the final dump is requested as slim RTL, dump slim
2926 RTL to the assembly file also. */
2927 if (flag_dump_rtl_in_asm
)
2929 print_rtx_head
= ASM_COMMENT_START
;
2930 if (! (dump_flags
& TDF_SLIM
))
2931 print_rtl_single (asm_out_file
, insn
);
2933 dump_insn_slim (asm_out_file
, insn
);
2934 print_rtx_head
= "";
2937 if (! constrain_operands_cached (insn
, 1))
2938 fatal_insn_not_found (insn
);
2940 /* Some target machines need to prescan each insn before
2943 #ifdef FINAL_PRESCAN_INSN
2944 FINAL_PRESCAN_INSN (insn
, recog_data
.operand
, recog_data
.n_operands
);
2947 if (targetm
.have_conditional_execution ()
2948 && GET_CODE (PATTERN (insn
)) == COND_EXEC
)
2949 current_insn_predicate
= COND_EXEC_TEST (PATTERN (insn
));
2952 cc_prev_status
= cc_status
;
2954 /* Update `cc_status' for this instruction.
2955 The instruction's output routine may change it further.
2956 If the output routine for a jump insn needs to depend
2957 on the cc status, it should look at cc_prev_status. */
2959 NOTICE_UPDATE_CC (body
, insn
);
2962 current_output_insn
= debug_insn
= insn
;
2964 /* Find the proper template for this insn. */
2965 templ
= get_insn_template (insn_code_number
, insn
);
2967 /* If the C code returns 0, it means that it is a jump insn
2968 which follows a deleted test insn, and that test insn
2969 needs to be reinserted. */
2974 gcc_assert (prev_nonnote_insn (insn
) == last_ignored_compare
);
2976 /* We have already processed the notes between the setter and
2977 the user. Make sure we don't process them again, this is
2978 particularly important if one of the notes is a block
2979 scope note or an EH note. */
2981 prev
!= last_ignored_compare
;
2982 prev
= PREV_INSN (prev
))
2985 delete_insn (prev
); /* Use delete_note. */
2991 /* If the template is the string "#", it means that this insn must
2993 if (templ
[0] == '#' && templ
[1] == '\0')
2995 rtx_insn
*new_rtx
= try_split (body
, insn
, 0);
2997 /* If we didn't split the insn, go away. */
2998 if (new_rtx
== insn
&& PATTERN (new_rtx
) == body
)
2999 fatal_insn ("could not split insn", insn
);
3001 /* If we have a length attribute, this instruction should have
3002 been split in shorten_branches, to ensure that we would have
3003 valid length info for the splitees. */
3004 gcc_assert (!HAVE_ATTR_length
);
3009 /* ??? This will put the directives in the wrong place if
3010 get_insn_template outputs assembly directly. However calling it
3011 before get_insn_template breaks if the insns is split. */
3012 if (targetm
.asm_out
.unwind_emit_before_insn
3013 && targetm
.asm_out
.unwind_emit
)
3014 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
3016 if (rtx_call_insn
*call_insn
= dyn_cast
<rtx_call_insn
*> (insn
))
3018 rtx x
= call_from_call_insn (call_insn
);
3020 if (x
&& MEM_P (x
) && GET_CODE (XEXP (x
, 0)) == SYMBOL_REF
)
3024 t
= SYMBOL_REF_DECL (x
);
3026 assemble_external (t
);
3028 if (!DECL_IGNORED_P (current_function_decl
))
3029 debug_hooks
->var_location (insn
);
3032 /* Output assembler code from the template. */
3033 output_asm_insn (templ
, recog_data
.operand
);
3035 /* Some target machines need to postscan each insn after
3037 if (targetm
.asm_out
.final_postscan_insn
)
3038 targetm
.asm_out
.final_postscan_insn (file
, insn
, recog_data
.operand
,
3039 recog_data
.n_operands
);
3041 if (!targetm
.asm_out
.unwind_emit_before_insn
3042 && targetm
.asm_out
.unwind_emit
)
3043 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
3045 current_output_insn
= debug_insn
= 0;
3048 return NEXT_INSN (insn
);
3051 /* Return whether a source line note needs to be emitted before INSN.
3052 Sets IS_STMT to TRUE if the line should be marked as a possible
3053 breakpoint location. */
3056 notice_source_line (rtx_insn
*insn
, bool *is_stmt
)
3058 const char *filename
;
3061 if (override_filename
)
3063 filename
= override_filename
;
3064 linenum
= override_linenum
;
3066 else if (INSN_HAS_LOCATION (insn
))
3068 expanded_location xloc
= insn_location (insn
);
3069 filename
= xloc
.file
;
3070 linenum
= xloc
.line
;
3078 if (filename
== NULL
)
3081 if (force_source_line
3082 || filename
!= last_filename
3083 || last_linenum
!= linenum
)
3085 force_source_line
= false;
3086 last_filename
= filename
;
3087 last_linenum
= linenum
;
3088 last_discriminator
= discriminator
;
3090 high_block_linenum
= MAX (last_linenum
, high_block_linenum
);
3091 high_function_linenum
= MAX (last_linenum
, high_function_linenum
);
3095 if (SUPPORTS_DISCRIMINATOR
&& last_discriminator
!= discriminator
)
3097 /* If the discriminator changed, but the line number did not,
3098 output the line table entry with is_stmt false so the
3099 debugger does not treat this as a breakpoint location. */
3100 last_discriminator
= discriminator
;
3108 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3109 directly to the desired hard register. */
3112 cleanup_subreg_operands (rtx_insn
*insn
)
3115 bool changed
= false;
3116 extract_insn_cached (insn
);
3117 for (i
= 0; i
< recog_data
.n_operands
; i
++)
3119 /* The following test cannot use recog_data.operand when testing
3120 for a SUBREG: the underlying object might have been changed
3121 already if we are inside a match_operator expression that
3122 matches the else clause. Instead we test the underlying
3123 expression directly. */
3124 if (GET_CODE (*recog_data
.operand_loc
[i
]) == SUBREG
)
3126 recog_data
.operand
[i
] = alter_subreg (recog_data
.operand_loc
[i
], true);
3129 else if (GET_CODE (recog_data
.operand
[i
]) == PLUS
3130 || GET_CODE (recog_data
.operand
[i
]) == MULT
3131 || MEM_P (recog_data
.operand
[i
]))
3132 recog_data
.operand
[i
] = walk_alter_subreg (recog_data
.operand_loc
[i
], &changed
);
3135 for (i
= 0; i
< recog_data
.n_dups
; i
++)
3137 if (GET_CODE (*recog_data
.dup_loc
[i
]) == SUBREG
)
3139 *recog_data
.dup_loc
[i
] = alter_subreg (recog_data
.dup_loc
[i
], true);
3142 else if (GET_CODE (*recog_data
.dup_loc
[i
]) == PLUS
3143 || GET_CODE (*recog_data
.dup_loc
[i
]) == MULT
3144 || MEM_P (*recog_data
.dup_loc
[i
]))
3145 *recog_data
.dup_loc
[i
] = walk_alter_subreg (recog_data
.dup_loc
[i
], &changed
);
3148 df_insn_rescan (insn
);
3151 /* If X is a SUBREG, try to replace it with a REG or a MEM, based on
3152 the thing it is a subreg of. Do it anyway if FINAL_P. */
3155 alter_subreg (rtx
*xp
, bool final_p
)
3158 rtx y
= SUBREG_REG (x
);
3160 /* simplify_subreg does not remove subreg from volatile references.
3161 We are required to. */
3164 int offset
= SUBREG_BYTE (x
);
3166 /* For paradoxical subregs on big-endian machines, SUBREG_BYTE
3167 contains 0 instead of the proper offset. See simplify_subreg. */
3169 && GET_MODE_SIZE (GET_MODE (y
)) < GET_MODE_SIZE (GET_MODE (x
)))
3171 int difference
= GET_MODE_SIZE (GET_MODE (y
))
3172 - GET_MODE_SIZE (GET_MODE (x
));
3173 if (WORDS_BIG_ENDIAN
)
3174 offset
+= (difference
/ UNITS_PER_WORD
) * UNITS_PER_WORD
;
3175 if (BYTES_BIG_ENDIAN
)
3176 offset
+= difference
% UNITS_PER_WORD
;
3180 *xp
= adjust_address (y
, GET_MODE (x
), offset
);
3182 *xp
= adjust_address_nv (y
, GET_MODE (x
), offset
);
3186 rtx new_rtx
= simplify_subreg (GET_MODE (x
), y
, GET_MODE (y
),
3191 else if (final_p
&& REG_P (y
))
3193 /* Simplify_subreg can't handle some REG cases, but we have to. */
3195 HOST_WIDE_INT offset
;
3197 regno
= subreg_regno (x
);
3198 if (subreg_lowpart_p (x
))
3199 offset
= byte_lowpart_offset (GET_MODE (x
), GET_MODE (y
));
3201 offset
= SUBREG_BYTE (x
);
3202 *xp
= gen_rtx_REG_offset (y
, GET_MODE (x
), regno
, offset
);
3209 /* Do alter_subreg on all the SUBREGs contained in X. */
3212 walk_alter_subreg (rtx
*xp
, bool *changed
)
3215 switch (GET_CODE (x
))
3220 XEXP (x
, 0) = walk_alter_subreg (&XEXP (x
, 0), changed
);
3221 XEXP (x
, 1) = walk_alter_subreg (&XEXP (x
, 1), changed
);
3226 XEXP (x
, 0) = walk_alter_subreg (&XEXP (x
, 0), changed
);
3231 return alter_subreg (xp
, true);
3242 /* Given BODY, the body of a jump instruction, alter the jump condition
3243 as required by the bits that are set in cc_status.flags.
3244 Not all of the bits there can be handled at this level in all cases.
3246 The value is normally 0.
3247 1 means that the condition has become always true.
3248 -1 means that the condition has become always false.
3249 2 means that COND has been altered. */
3252 alter_cond (rtx cond
)
3256 if (cc_status
.flags
& CC_REVERSED
)
3259 PUT_CODE (cond
, swap_condition (GET_CODE (cond
)));
3262 if (cc_status
.flags
& CC_INVERTED
)
3265 PUT_CODE (cond
, reverse_condition (GET_CODE (cond
)));
3268 if (cc_status
.flags
& CC_NOT_POSITIVE
)
3269 switch (GET_CODE (cond
))
3274 /* Jump becomes unconditional. */
3280 /* Jump becomes no-op. */
3284 PUT_CODE (cond
, EQ
);
3289 PUT_CODE (cond
, NE
);
3297 if (cc_status
.flags
& CC_NOT_NEGATIVE
)
3298 switch (GET_CODE (cond
))
3302 /* Jump becomes unconditional. */
3307 /* Jump becomes no-op. */
3312 PUT_CODE (cond
, EQ
);
3318 PUT_CODE (cond
, NE
);
3326 if (cc_status
.flags
& CC_NO_OVERFLOW
)
3327 switch (GET_CODE (cond
))
3330 /* Jump becomes unconditional. */
3334 PUT_CODE (cond
, EQ
);
3339 PUT_CODE (cond
, NE
);
3344 /* Jump becomes no-op. */
3351 if (cc_status
.flags
& (CC_Z_IN_NOT_N
| CC_Z_IN_N
))
3352 switch (GET_CODE (cond
))
3358 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? GE
: LT
);
3363 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? LT
: GE
);
3368 if (cc_status
.flags
& CC_NOT_SIGNED
)
3369 /* The flags are valid if signed condition operators are converted
3371 switch (GET_CODE (cond
))
3374 PUT_CODE (cond
, LEU
);
3379 PUT_CODE (cond
, LTU
);
3384 PUT_CODE (cond
, GTU
);
3389 PUT_CODE (cond
, GEU
);
3401 /* Report inconsistency between the assembler template and the operands.
3402 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3405 output_operand_lossage (const char *cmsgid
, ...)
3409 const char *pfx_str
;
3412 va_start (ap
, cmsgid
);
3414 pfx_str
= this_is_asm_operands
? _("invalid 'asm': ") : "output_operand: ";
3415 asprintf (&fmt_string
, "%s%s", pfx_str
, _(cmsgid
));
3416 vasprintf (&new_message
, fmt_string
, ap
);
3418 if (this_is_asm_operands
)
3419 error_for_asm (this_is_asm_operands
, "%s", new_message
);
3421 internal_error ("%s", new_message
);
3428 /* Output of assembler code from a template, and its subroutines. */
3430 /* Annotate the assembly with a comment describing the pattern and
3431 alternative used. */
3434 output_asm_name (void)
3438 int num
= INSN_CODE (debug_insn
);
3439 fprintf (asm_out_file
, "\t%s %d\t%s",
3440 ASM_COMMENT_START
, INSN_UID (debug_insn
),
3441 insn_data
[num
].name
);
3442 if (insn_data
[num
].n_alternatives
> 1)
3443 fprintf (asm_out_file
, "/%d", which_alternative
+ 1);
3445 if (HAVE_ATTR_length
)
3446 fprintf (asm_out_file
, "\t[length = %d]",
3447 get_attr_length (debug_insn
));
3449 /* Clear this so only the first assembler insn
3450 of any rtl insn will get the special comment for -dp. */
3455 /* If OP is a REG or MEM and we can find a MEM_EXPR corresponding to it
3456 or its address, return that expr . Set *PADDRESSP to 1 if the expr
3457 corresponds to the address of the object and 0 if to the object. */
3460 get_mem_expr_from_op (rtx op
, int *paddressp
)
3468 return REG_EXPR (op
);
3469 else if (!MEM_P (op
))
3472 if (MEM_EXPR (op
) != 0)
3473 return MEM_EXPR (op
);
3475 /* Otherwise we have an address, so indicate it and look at the address. */
3479 /* First check if we have a decl for the address, then look at the right side
3480 if it is a PLUS. Otherwise, strip off arithmetic and keep looking.
3481 But don't allow the address to itself be indirect. */
3482 if ((expr
= get_mem_expr_from_op (op
, &inner_addressp
)) && ! inner_addressp
)
3484 else if (GET_CODE (op
) == PLUS
3485 && (expr
= get_mem_expr_from_op (XEXP (op
, 1), &inner_addressp
)))
3489 || GET_RTX_CLASS (GET_CODE (op
)) == RTX_BIN_ARITH
)
3492 expr
= get_mem_expr_from_op (op
, &inner_addressp
);
3493 return inner_addressp
? 0 : expr
;
3496 /* Output operand names for assembler instructions. OPERANDS is the
3497 operand vector, OPORDER is the order to write the operands, and NOPS
3498 is the number of operands to write. */
3501 output_asm_operand_names (rtx
*operands
, int *oporder
, int nops
)
3506 for (i
= 0; i
< nops
; i
++)
3509 rtx op
= operands
[oporder
[i
]];
3510 tree expr
= get_mem_expr_from_op (op
, &addressp
);
3512 fprintf (asm_out_file
, "%c%s",
3513 wrote
? ',' : '\t', wrote
? "" : ASM_COMMENT_START
);
3517 fprintf (asm_out_file
, "%s",
3518 addressp
? "*" : "");
3519 print_mem_expr (asm_out_file
, expr
);
3522 else if (REG_P (op
) && ORIGINAL_REGNO (op
)
3523 && ORIGINAL_REGNO (op
) != REGNO (op
))
3524 fprintf (asm_out_file
, " tmp%i", ORIGINAL_REGNO (op
));
3528 #ifdef ASSEMBLER_DIALECT
3529 /* Helper function to parse assembler dialects in the asm string.
3530 This is called from output_asm_insn and asm_fprintf. */
3532 do_assembler_dialects (const char *p
, int *dialect
)
3543 output_operand_lossage ("nested assembly dialect alternatives");
3547 /* If we want the first dialect, do nothing. Otherwise, skip
3548 DIALECT_NUMBER of strings ending with '|'. */
3549 for (i
= 0; i
< dialect_number
; i
++)
3551 while (*p
&& *p
!= '}')
3559 /* Skip over any character after a percent sign. */
3571 output_operand_lossage ("unterminated assembly dialect alternative");
3578 /* Skip to close brace. */
3583 output_operand_lossage ("unterminated assembly dialect alternative");
3587 /* Skip over any character after a percent sign. */
3588 if (*p
== '%' && p
[1])
3602 putc (c
, asm_out_file
);
3607 putc (c
, asm_out_file
);
3618 /* Output text from TEMPLATE to the assembler output file,
3619 obeying %-directions to substitute operands taken from
3620 the vector OPERANDS.
3622 %N (for N a digit) means print operand N in usual manner.
3623 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3624 and print the label name with no punctuation.
3625 %cN means require operand N to be a constant
3626 and print the constant expression with no punctuation.
3627 %aN means expect operand N to be a memory address
3628 (not a memory reference!) and print a reference
3630 %nN means expect operand N to be a constant
3631 and print a constant expression for minus the value
3632 of the operand, with no other punctuation. */
3635 output_asm_insn (const char *templ
, rtx
*operands
)
3639 #ifdef ASSEMBLER_DIALECT
3642 int oporder
[MAX_RECOG_OPERANDS
];
3643 char opoutput
[MAX_RECOG_OPERANDS
];
3646 /* An insn may return a null string template
3647 in a case where no assembler code is needed. */
3651 memset (opoutput
, 0, sizeof opoutput
);
3653 putc ('\t', asm_out_file
);
3655 #ifdef ASM_OUTPUT_OPCODE
3656 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3663 if (flag_verbose_asm
)
3664 output_asm_operand_names (operands
, oporder
, ops
);
3665 if (flag_print_asm_name
)
3669 memset (opoutput
, 0, sizeof opoutput
);
3671 putc (c
, asm_out_file
);
3672 #ifdef ASM_OUTPUT_OPCODE
3673 while ((c
= *p
) == '\t')
3675 putc (c
, asm_out_file
);
3678 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3682 #ifdef ASSEMBLER_DIALECT
3686 p
= do_assembler_dialects (p
, &dialect
);
3691 /* %% outputs a single %. %{, %} and %| print {, } and | respectively
3692 if ASSEMBLER_DIALECT defined and these characters have a special
3693 meaning as dialect delimiters.*/
3695 #ifdef ASSEMBLER_DIALECT
3696 || *p
== '{' || *p
== '}' || *p
== '|'
3700 putc (*p
, asm_out_file
);
3703 /* %= outputs a number which is unique to each insn in the entire
3704 compilation. This is useful for making local labels that are
3705 referred to more than once in a given insn. */
3709 fprintf (asm_out_file
, "%d", insn_counter
);
3711 /* % followed by a letter and some digits
3712 outputs an operand in a special way depending on the letter.
3713 Letters `acln' are implemented directly.
3714 Other letters are passed to `output_operand' so that
3715 the TARGET_PRINT_OPERAND hook can define them. */
3716 else if (ISALPHA (*p
))
3719 unsigned long opnum
;
3722 opnum
= strtoul (p
, &endptr
, 10);
3725 output_operand_lossage ("operand number missing "
3727 else if (this_is_asm_operands
&& opnum
>= insn_noperands
)
3728 output_operand_lossage ("operand number out of range");
3729 else if (letter
== 'l')
3730 output_asm_label (operands
[opnum
]);
3731 else if (letter
== 'a')
3732 output_address (operands
[opnum
]);
3733 else if (letter
== 'c')
3735 if (CONSTANT_ADDRESS_P (operands
[opnum
]))
3736 output_addr_const (asm_out_file
, operands
[opnum
]);
3738 output_operand (operands
[opnum
], 'c');
3740 else if (letter
== 'n')
3742 if (CONST_INT_P (operands
[opnum
]))
3743 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
,
3744 - INTVAL (operands
[opnum
]));
3747 putc ('-', asm_out_file
);
3748 output_addr_const (asm_out_file
, operands
[opnum
]);
3752 output_operand (operands
[opnum
], letter
);
3754 if (!opoutput
[opnum
])
3755 oporder
[ops
++] = opnum
;
3756 opoutput
[opnum
] = 1;
3761 /* % followed by a digit outputs an operand the default way. */
3762 else if (ISDIGIT (*p
))
3764 unsigned long opnum
;
3767 opnum
= strtoul (p
, &endptr
, 10);
3768 if (this_is_asm_operands
&& opnum
>= insn_noperands
)
3769 output_operand_lossage ("operand number out of range");
3771 output_operand (operands
[opnum
], 0);
3773 if (!opoutput
[opnum
])
3774 oporder
[ops
++] = opnum
;
3775 opoutput
[opnum
] = 1;
3780 /* % followed by punctuation: output something for that
3781 punctuation character alone, with no operand. The
3782 TARGET_PRINT_OPERAND hook decides what is actually done. */
3783 else if (targetm
.asm_out
.print_operand_punct_valid_p ((unsigned char) *p
))
3784 output_operand (NULL_RTX
, *p
++);
3786 output_operand_lossage ("invalid %%-code");
3790 putc (c
, asm_out_file
);
3793 /* Write out the variable names for operands, if we know them. */
3794 if (flag_verbose_asm
)
3795 output_asm_operand_names (operands
, oporder
, ops
);
3796 if (flag_print_asm_name
)
3799 putc ('\n', asm_out_file
);
3802 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3805 output_asm_label (rtx x
)
3809 if (GET_CODE (x
) == LABEL_REF
)
3810 x
= LABEL_REF_LABEL (x
);
3813 && NOTE_KIND (x
) == NOTE_INSN_DELETED_LABEL
))
3814 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3816 output_operand_lossage ("'%%l' operand isn't a label");
3818 assemble_name (asm_out_file
, buf
);
3821 /* Marks SYMBOL_REFs in x as referenced through use of assemble_external. */
3824 mark_symbol_refs_as_used (rtx x
)
3826 subrtx_iterator::array_type array
;
3827 FOR_EACH_SUBRTX (iter
, array
, x
, ALL
)
3829 const_rtx x
= *iter
;
3830 if (GET_CODE (x
) == SYMBOL_REF
)
3831 if (tree t
= SYMBOL_REF_DECL (x
))
3832 assemble_external (t
);
3836 /* Print operand X using machine-dependent assembler syntax.
3837 CODE is a non-digit that preceded the operand-number in the % spec,
3838 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3839 between the % and the digits.
3840 When CODE is a non-letter, X is 0.
3842 The meanings of the letters are machine-dependent and controlled
3843 by TARGET_PRINT_OPERAND. */
3846 output_operand (rtx x
, int code ATTRIBUTE_UNUSED
)
3848 if (x
&& GET_CODE (x
) == SUBREG
)
3849 x
= alter_subreg (&x
, true);
3851 /* X must not be a pseudo reg. */
3852 gcc_assert (!x
|| !REG_P (x
) || REGNO (x
) < FIRST_PSEUDO_REGISTER
);
3854 targetm
.asm_out
.print_operand (asm_out_file
, x
, code
);
3859 mark_symbol_refs_as_used (x
);
3862 /* Print a memory reference operand for address X using
3863 machine-dependent assembler syntax. */
3866 output_address (rtx x
)
3868 bool changed
= false;
3869 walk_alter_subreg (&x
, &changed
);
3870 targetm
.asm_out
.print_operand_address (asm_out_file
, x
);
3873 /* Print an integer constant expression in assembler syntax.
3874 Addition and subtraction are the only arithmetic
3875 that may appear in these expressions. */
3878 output_addr_const (FILE *file
, rtx x
)
3883 switch (GET_CODE (x
))
3890 if (SYMBOL_REF_DECL (x
))
3891 assemble_external (SYMBOL_REF_DECL (x
));
3892 #ifdef ASM_OUTPUT_SYMBOL_REF
3893 ASM_OUTPUT_SYMBOL_REF (file
, x
);
3895 assemble_name (file
, XSTR (x
, 0));
3900 x
= LABEL_REF_LABEL (x
);
3903 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3904 #ifdef ASM_OUTPUT_LABEL_REF
3905 ASM_OUTPUT_LABEL_REF (file
, buf
);
3907 assemble_name (file
, buf
);
3912 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, INTVAL (x
));
3916 /* This used to output parentheses around the expression,
3917 but that does not work on the 386 (either ATT or BSD assembler). */
3918 output_addr_const (file
, XEXP (x
, 0));
3921 case CONST_WIDE_INT
:
3922 /* We do not know the mode here so we have to use a round about
3923 way to build a wide-int to get it printed properly. */
3925 wide_int w
= wide_int::from_array (&CONST_WIDE_INT_ELT (x
, 0),
3926 CONST_WIDE_INT_NUNITS (x
),
3927 CONST_WIDE_INT_NUNITS (x
)
3928 * HOST_BITS_PER_WIDE_INT
,
3930 print_decs (w
, file
);
3935 if (CONST_DOUBLE_AS_INT_P (x
))
3937 /* We can use %d if the number is one word and positive. */
3938 if (CONST_DOUBLE_HIGH (x
))
3939 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
3940 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_HIGH (x
),
3941 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_LOW (x
));
3942 else if (CONST_DOUBLE_LOW (x
) < 0)
3943 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
,
3944 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_LOW (x
));
3946 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_DOUBLE_LOW (x
));
3949 /* We can't handle floating point constants;
3950 PRINT_OPERAND must handle them. */
3951 output_operand_lossage ("floating constant misused");
3955 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_FIXED_VALUE_LOW (x
));
3959 /* Some assemblers need integer constants to appear last (eg masm). */
3960 if (CONST_INT_P (XEXP (x
, 0)))
3962 output_addr_const (file
, XEXP (x
, 1));
3963 if (INTVAL (XEXP (x
, 0)) >= 0)
3964 fprintf (file
, "+");
3965 output_addr_const (file
, XEXP (x
, 0));
3969 output_addr_const (file
, XEXP (x
, 0));
3970 if (!CONST_INT_P (XEXP (x
, 1))
3971 || INTVAL (XEXP (x
, 1)) >= 0)
3972 fprintf (file
, "+");
3973 output_addr_const (file
, XEXP (x
, 1));
3978 /* Avoid outputting things like x-x or x+5-x,
3979 since some assemblers can't handle that. */
3980 x
= simplify_subtraction (x
);
3981 if (GET_CODE (x
) != MINUS
)
3984 output_addr_const (file
, XEXP (x
, 0));
3985 fprintf (file
, "-");
3986 if ((CONST_INT_P (XEXP (x
, 1)) && INTVAL (XEXP (x
, 1)) >= 0)
3987 || GET_CODE (XEXP (x
, 1)) == PC
3988 || GET_CODE (XEXP (x
, 1)) == SYMBOL_REF
)
3989 output_addr_const (file
, XEXP (x
, 1));
3992 fputs (targetm
.asm_out
.open_paren
, file
);
3993 output_addr_const (file
, XEXP (x
, 1));
3994 fputs (targetm
.asm_out
.close_paren
, file
);
4002 output_addr_const (file
, XEXP (x
, 0));
4006 if (targetm
.asm_out
.output_addr_const_extra (file
, x
))
4009 output_operand_lossage ("invalid expression as operand");
4013 /* Output a quoted string. */
4016 output_quoted_string (FILE *asm_file
, const char *string
)
4018 #ifdef OUTPUT_QUOTED_STRING
4019 OUTPUT_QUOTED_STRING (asm_file
, string
);
4023 putc ('\"', asm_file
);
4024 while ((c
= *string
++) != 0)
4028 if (c
== '\"' || c
== '\\')
4029 putc ('\\', asm_file
);
4033 fprintf (asm_file
, "\\%03o", (unsigned char) c
);
4035 putc ('\"', asm_file
);
4039 /* Write a HOST_WIDE_INT number in hex form 0x1234, fast. */
4042 fprint_whex (FILE *f
, unsigned HOST_WIDE_INT value
)
4044 char buf
[2 + CHAR_BIT
* sizeof (value
) / 4];
4049 char *p
= buf
+ sizeof (buf
);
4051 *--p
= "0123456789abcdef"[value
% 16];
4052 while ((value
/= 16) != 0);
4055 fwrite (p
, 1, buf
+ sizeof (buf
) - p
, f
);
4059 /* Internal function that prints an unsigned long in decimal in reverse.
4060 The output string IS NOT null-terminated. */
4063 sprint_ul_rev (char *s
, unsigned long value
)
4068 s
[i
] = "0123456789"[value
% 10];
4071 /* alternate version, without modulo */
4072 /* oldval = value; */
4074 /* s[i] = "0123456789" [oldval - 10*value]; */
4081 /* Write an unsigned long as decimal to a file, fast. */
4084 fprint_ul (FILE *f
, unsigned long value
)
4086 /* python says: len(str(2**64)) == 20 */
4090 i
= sprint_ul_rev (s
, value
);
4092 /* It's probably too small to bother with string reversal and fputs. */
4101 /* Write an unsigned long as decimal to a string, fast.
4102 s must be wide enough to not overflow, at least 21 chars.
4103 Returns the length of the string (without terminating '\0'). */
4106 sprint_ul (char *s
, unsigned long value
)
4113 len
= sprint_ul_rev (s
, value
);
4116 /* Reverse the string. */
4130 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
4131 %R prints the value of REGISTER_PREFIX.
4132 %L prints the value of LOCAL_LABEL_PREFIX.
4133 %U prints the value of USER_LABEL_PREFIX.
4134 %I prints the value of IMMEDIATE_PREFIX.
4135 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
4136 Also supported are %d, %i, %u, %x, %X, %o, %c, %s and %%.
4138 We handle alternate assembler dialects here, just like output_asm_insn. */
4141 asm_fprintf (FILE *file
, const char *p
, ...)
4145 #ifdef ASSEMBLER_DIALECT
4150 va_start (argptr
, p
);
4157 #ifdef ASSEMBLER_DIALECT
4161 p
= do_assembler_dialects (p
, &dialect
);
4168 while (strchr ("-+ #0", c
))
4173 while (ISDIGIT (c
) || c
== '.')
4184 case 'd': case 'i': case 'u':
4185 case 'x': case 'X': case 'o':
4189 fprintf (file
, buf
, va_arg (argptr
, int));
4193 /* This is a prefix to the 'd', 'i', 'u', 'x', 'X', and
4194 'o' cases, but we do not check for those cases. It
4195 means that the value is a HOST_WIDE_INT, which may be
4196 either `long' or `long long'. */
4197 memcpy (q
, HOST_WIDE_INT_PRINT
, strlen (HOST_WIDE_INT_PRINT
));
4198 q
+= strlen (HOST_WIDE_INT_PRINT
);
4201 fprintf (file
, buf
, va_arg (argptr
, HOST_WIDE_INT
));
4206 #ifdef HAVE_LONG_LONG
4212 fprintf (file
, buf
, va_arg (argptr
, long long));
4219 fprintf (file
, buf
, va_arg (argptr
, long));
4227 fprintf (file
, buf
, va_arg (argptr
, char *));
4231 #ifdef ASM_OUTPUT_OPCODE
4232 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
4237 #ifdef REGISTER_PREFIX
4238 fprintf (file
, "%s", REGISTER_PREFIX
);
4243 #ifdef IMMEDIATE_PREFIX
4244 fprintf (file
, "%s", IMMEDIATE_PREFIX
);
4249 #ifdef LOCAL_LABEL_PREFIX
4250 fprintf (file
, "%s", LOCAL_LABEL_PREFIX
);
4255 fputs (user_label_prefix
, file
);
4258 #ifdef ASM_FPRINTF_EXTENSIONS
4259 /* Uppercase letters are reserved for general use by asm_fprintf
4260 and so are not available to target specific code. In order to
4261 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
4262 they are defined here. As they get turned into real extensions
4263 to asm_fprintf they should be removed from this list. */
4264 case 'A': case 'B': case 'C': case 'D': case 'E':
4265 case 'F': case 'G': case 'H': case 'J': case 'K':
4266 case 'M': case 'N': case 'P': case 'Q': case 'S':
4267 case 'T': case 'V': case 'W': case 'Y': case 'Z':
4270 ASM_FPRINTF_EXTENSIONS (file
, argptr
, p
)
4283 /* Return nonzero if this function has no function calls. */
4286 leaf_function_p (void)
4290 /* Some back-ends (e.g. s390) want leaf functions to stay leaf
4291 functions even if they call mcount. */
4292 if (crtl
->profile
&& !targetm
.keep_leaf_when_profiled ())
4295 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4298 && ! SIBLING_CALL_P (insn
))
4300 if (NONJUMP_INSN_P (insn
)
4301 && GET_CODE (PATTERN (insn
)) == SEQUENCE
4302 && CALL_P (XVECEXP (PATTERN (insn
), 0, 0))
4303 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn
), 0, 0)))
4310 /* Return 1 if branch is a forward branch.
4311 Uses insn_shuid array, so it works only in the final pass. May be used by
4312 output templates to customary add branch prediction hints.
4315 final_forward_branch_p (rtx_insn
*insn
)
4317 int insn_id
, label_id
;
4319 gcc_assert (uid_shuid
);
4320 insn_id
= INSN_SHUID (insn
);
4321 label_id
= INSN_SHUID (JUMP_LABEL (insn
));
4322 /* We've hit some insns that does not have id information available. */
4323 gcc_assert (insn_id
&& label_id
);
4324 return insn_id
< label_id
;
4327 /* On some machines, a function with no call insns
4328 can run faster if it doesn't create its own register window.
4329 When output, the leaf function should use only the "output"
4330 registers. Ordinarily, the function would be compiled to use
4331 the "input" registers to find its arguments; it is a candidate
4332 for leaf treatment if it uses only the "input" registers.
4333 Leaf function treatment means renumbering so the function
4334 uses the "output" registers instead. */
4336 #ifdef LEAF_REGISTERS
4338 /* Return 1 if this function uses only the registers that can be
4339 safely renumbered. */
4342 only_leaf_regs_used (void)
4345 const char *const permitted_reg_in_leaf_functions
= LEAF_REGISTERS
;
4347 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4348 if ((df_regs_ever_live_p (i
) || global_regs
[i
])
4349 && ! permitted_reg_in_leaf_functions
[i
])
4352 if (crtl
->uses_pic_offset_table
4353 && pic_offset_table_rtx
!= 0
4354 && REG_P (pic_offset_table_rtx
)
4355 && ! permitted_reg_in_leaf_functions
[REGNO (pic_offset_table_rtx
)])
4361 /* Scan all instructions and renumber all registers into those
4362 available in leaf functions. */
4365 leaf_renumber_regs (rtx_insn
*first
)
4369 /* Renumber only the actual patterns.
4370 The reg-notes can contain frame pointer refs,
4371 and renumbering them could crash, and should not be needed. */
4372 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
4374 leaf_renumber_regs_insn (PATTERN (insn
));
4377 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4378 available in leaf functions. */
4381 leaf_renumber_regs_insn (rtx in_rtx
)
4384 const char *format_ptr
;
4389 /* Renumber all input-registers into output-registers.
4390 renumbered_regs would be 1 for an output-register;
4397 /* Don't renumber the same reg twice. */
4401 newreg
= REGNO (in_rtx
);
4402 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4403 to reach here as part of a REG_NOTE. */
4404 if (newreg
>= FIRST_PSEUDO_REGISTER
)
4409 newreg
= LEAF_REG_REMAP (newreg
);
4410 gcc_assert (newreg
>= 0);
4411 df_set_regs_ever_live (REGNO (in_rtx
), false);
4412 df_set_regs_ever_live (newreg
, true);
4413 SET_REGNO (in_rtx
, newreg
);
4417 if (INSN_P (in_rtx
))
4419 /* Inside a SEQUENCE, we find insns.
4420 Renumber just the patterns of these insns,
4421 just as we do for the top-level insns. */
4422 leaf_renumber_regs_insn (PATTERN (in_rtx
));
4426 format_ptr
= GET_RTX_FORMAT (GET_CODE (in_rtx
));
4428 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (in_rtx
)); i
++)
4429 switch (*format_ptr
++)
4432 leaf_renumber_regs_insn (XEXP (in_rtx
, i
));
4436 if (NULL
!= XVEC (in_rtx
, i
))
4438 for (j
= 0; j
< XVECLEN (in_rtx
, i
); j
++)
4439 leaf_renumber_regs_insn (XVECEXP (in_rtx
, i
, j
));
4458 /* Turn the RTL into assembly. */
4460 rest_of_handle_final (void)
4465 /* Get the function's name, as described by its RTL. This may be
4466 different from the DECL_NAME name used in the source file. */
4468 x
= DECL_RTL (current_function_decl
);
4469 gcc_assert (MEM_P (x
));
4471 gcc_assert (GET_CODE (x
) == SYMBOL_REF
);
4472 fnname
= XSTR (x
, 0);
4474 assemble_start_function (current_function_decl
, fnname
);
4475 final_start_function (get_insns (), asm_out_file
, optimize
);
4476 final (get_insns (), asm_out_file
, optimize
);
4477 if (flag_use_caller_save
)
4478 collect_fn_hard_reg_usage ();
4479 final_end_function ();
4481 /* The IA-64 ".handlerdata" directive must be issued before the ".endp"
4482 directive that closes the procedure descriptor. Similarly, for x64 SEH.
4483 Otherwise it's not strictly necessary, but it doesn't hurt either. */
4484 output_function_exception_table (fnname
);
4486 assemble_end_function (current_function_decl
, fnname
);
4488 user_defined_section_attribute
= false;
4490 /* Free up reg info memory. */
4494 fflush (asm_out_file
);
4496 /* Write DBX symbols if requested. */
4498 /* Note that for those inline functions where we don't initially
4499 know for certain that we will be generating an out-of-line copy,
4500 the first invocation of this routine (rest_of_compilation) will
4501 skip over this code by doing a `goto exit_rest_of_compilation;'.
4502 Later on, wrapup_global_declarations will (indirectly) call
4503 rest_of_compilation again for those inline functions that need
4504 to have out-of-line copies generated. During that call, we
4505 *will* be routed past here. */
4507 timevar_push (TV_SYMOUT
);
4508 if (!DECL_IGNORED_P (current_function_decl
))
4509 debug_hooks
->function_decl (current_function_decl
);
4510 timevar_pop (TV_SYMOUT
);
4512 /* Release the blocks that are linked to DECL_INITIAL() to free the memory. */
4513 DECL_INITIAL (current_function_decl
) = error_mark_node
;
4515 if (DECL_STATIC_CONSTRUCTOR (current_function_decl
)
4516 && targetm
.have_ctors_dtors
)
4517 targetm
.asm_out
.constructor (XEXP (DECL_RTL (current_function_decl
), 0),
4518 decl_init_priority_lookup
4519 (current_function_decl
));
4520 if (DECL_STATIC_DESTRUCTOR (current_function_decl
)
4521 && targetm
.have_ctors_dtors
)
4522 targetm
.asm_out
.destructor (XEXP (DECL_RTL (current_function_decl
), 0),
4523 decl_fini_priority_lookup
4524 (current_function_decl
));
4530 const pass_data pass_data_final
=
4532 RTL_PASS
, /* type */
4534 OPTGROUP_NONE
, /* optinfo_flags */
4535 TV_FINAL
, /* tv_id */
4536 0, /* properties_required */
4537 0, /* properties_provided */
4538 0, /* properties_destroyed */
4539 0, /* todo_flags_start */
4540 0, /* todo_flags_finish */
4543 class pass_final
: public rtl_opt_pass
4546 pass_final (gcc::context
*ctxt
)
4547 : rtl_opt_pass (pass_data_final
, ctxt
)
4550 /* opt_pass methods: */
4551 virtual unsigned int execute (function
*) { return rest_of_handle_final (); }
4553 }; // class pass_final
4558 make_pass_final (gcc::context
*ctxt
)
4560 return new pass_final (ctxt
);
4565 rest_of_handle_shorten_branches (void)
4567 /* Shorten branches. */
4568 shorten_branches (get_insns ());
4574 const pass_data pass_data_shorten_branches
=
4576 RTL_PASS
, /* type */
4577 "shorten", /* name */
4578 OPTGROUP_NONE
, /* optinfo_flags */
4579 TV_SHORTEN_BRANCH
, /* tv_id */
4580 0, /* properties_required */
4581 0, /* properties_provided */
4582 0, /* properties_destroyed */
4583 0, /* todo_flags_start */
4584 0, /* todo_flags_finish */
4587 class pass_shorten_branches
: public rtl_opt_pass
4590 pass_shorten_branches (gcc::context
*ctxt
)
4591 : rtl_opt_pass (pass_data_shorten_branches
, ctxt
)
4594 /* opt_pass methods: */
4595 virtual unsigned int execute (function
*)
4597 return rest_of_handle_shorten_branches ();
4600 }; // class pass_shorten_branches
4605 make_pass_shorten_branches (gcc::context
*ctxt
)
4607 return new pass_shorten_branches (ctxt
);
4612 rest_of_clean_state (void)
4614 rtx_insn
*insn
, *next
;
4615 FILE *final_output
= NULL
;
4616 int save_unnumbered
= flag_dump_unnumbered
;
4617 int save_noaddr
= flag_dump_noaddr
;
4619 if (flag_dump_final_insns
)
4621 final_output
= fopen (flag_dump_final_insns
, "a");
4624 error ("could not open final insn dump file %qs: %m",
4625 flag_dump_final_insns
);
4626 flag_dump_final_insns
= NULL
;
4630 flag_dump_noaddr
= flag_dump_unnumbered
= 1;
4631 if (flag_compare_debug_opt
|| flag_compare_debug
)
4632 dump_flags
|= TDF_NOUID
;
4633 dump_function_header (final_output
, current_function_decl
,
4635 final_insns_dump_p
= true;
4637 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4639 INSN_UID (insn
) = CODE_LABEL_NUMBER (insn
);
4643 set_block_for_insn (insn
, NULL
);
4644 INSN_UID (insn
) = 0;
4649 /* It is very important to decompose the RTL instruction chain here:
4650 debug information keeps pointing into CODE_LABEL insns inside the function
4651 body. If these remain pointing to the other insns, we end up preserving
4652 whole RTL chain and attached detailed debug info in memory. */
4653 for (insn
= get_insns (); insn
; insn
= next
)
4655 next
= NEXT_INSN (insn
);
4656 SET_NEXT_INSN (insn
) = NULL
;
4657 SET_PREV_INSN (insn
) = NULL
;
4660 && (!NOTE_P (insn
) ||
4661 (NOTE_KIND (insn
) != NOTE_INSN_VAR_LOCATION
4662 && NOTE_KIND (insn
) != NOTE_INSN_CALL_ARG_LOCATION
4663 && NOTE_KIND (insn
) != NOTE_INSN_BLOCK_BEG
4664 && NOTE_KIND (insn
) != NOTE_INSN_BLOCK_END
4665 && NOTE_KIND (insn
) != NOTE_INSN_DELETED_DEBUG_LABEL
)))
4666 print_rtl_single (final_output
, insn
);
4671 flag_dump_noaddr
= save_noaddr
;
4672 flag_dump_unnumbered
= save_unnumbered
;
4673 final_insns_dump_p
= false;
4675 if (fclose (final_output
))
4677 error ("could not close final insn dump file %qs: %m",
4678 flag_dump_final_insns
);
4679 flag_dump_final_insns
= NULL
;
4683 /* In case the function was not output,
4684 don't leave any temporary anonymous types
4685 queued up for sdb output. */
4686 #ifdef SDB_DEBUGGING_INFO
4687 if (write_symbols
== SDB_DEBUG
)
4688 sdbout_types (NULL_TREE
);
4691 flag_rerun_cse_after_global_opts
= 0;
4692 reload_completed
= 0;
4693 epilogue_completed
= 0;
4695 regstack_completed
= 0;
4698 /* Clear out the insn_length contents now that they are no
4700 init_insn_lengths ();
4702 /* Show no temporary slots allocated. */
4705 free_bb_for_insn ();
4709 /* We can reduce stack alignment on call site only when we are sure that
4710 the function body just produced will be actually used in the final
4712 if (decl_binds_to_current_def_p (current_function_decl
))
4714 unsigned int pref
= crtl
->preferred_stack_boundary
;
4715 if (crtl
->stack_alignment_needed
> crtl
->preferred_stack_boundary
)
4716 pref
= crtl
->stack_alignment_needed
;
4717 cgraph_node::rtl_info (current_function_decl
)
4718 ->preferred_incoming_stack_boundary
= pref
;
4721 /* Make sure volatile mem refs aren't considered valid operands for
4722 arithmetic insns. We must call this here if this is a nested inline
4723 function, since the above code leaves us in the init_recog state,
4724 and the function context push/pop code does not save/restore volatile_ok.
4726 ??? Maybe it isn't necessary for expand_start_function to call this
4727 anymore if we do it here? */
4729 init_recog_no_volatile ();
4731 /* We're done with this function. Free up memory if we can. */
4732 free_after_parsing (cfun
);
4733 free_after_compilation (cfun
);
4739 const pass_data pass_data_clean_state
=
4741 RTL_PASS
, /* type */
4742 "*clean_state", /* name */
4743 OPTGROUP_NONE
, /* optinfo_flags */
4744 TV_FINAL
, /* tv_id */
4745 0, /* properties_required */
4746 0, /* properties_provided */
4747 PROP_rtl
, /* properties_destroyed */
4748 0, /* todo_flags_start */
4749 0, /* todo_flags_finish */
4752 class pass_clean_state
: public rtl_opt_pass
4755 pass_clean_state (gcc::context
*ctxt
)
4756 : rtl_opt_pass (pass_data_clean_state
, ctxt
)
4759 /* opt_pass methods: */
4760 virtual unsigned int execute (function
*)
4762 return rest_of_clean_state ();
4765 }; // class pass_clean_state
4770 make_pass_clean_state (gcc::context
*ctxt
)
4772 return new pass_clean_state (ctxt
);
4775 /* Return true if INSN is a call to the the current function. */
4778 self_recursive_call_p (rtx_insn
*insn
)
4780 tree fndecl
= get_call_fndecl (insn
);
4781 return (fndecl
== current_function_decl
4782 && decl_binds_to_current_def_p (fndecl
));
4785 /* Collect hard register usage for the current function. */
4788 collect_fn_hard_reg_usage (void)
4794 struct cgraph_rtl_info
*node
;
4795 HARD_REG_SET function_used_regs
;
4797 /* ??? To be removed when all the ports have been fixed. */
4798 if (!targetm
.call_fusage_contains_non_callee_clobbers
)
4801 CLEAR_HARD_REG_SET (function_used_regs
);
4803 for (insn
= get_insns (); insn
!= NULL_RTX
; insn
= next_insn (insn
))
4805 HARD_REG_SET insn_used_regs
;
4807 if (!NONDEBUG_INSN_P (insn
))
4811 && !self_recursive_call_p (insn
))
4813 if (!get_call_reg_set_usage (insn
, &insn_used_regs
,
4817 IOR_HARD_REG_SET (function_used_regs
, insn_used_regs
);
4820 find_all_hard_reg_sets (insn
, &insn_used_regs
, false);
4821 IOR_HARD_REG_SET (function_used_regs
, insn_used_regs
);
4824 /* Be conservative - mark fixed and global registers as used. */
4825 IOR_HARD_REG_SET (function_used_regs
, fixed_reg_set
);
4828 /* Handle STACK_REGS conservatively, since the df-framework does not
4829 provide accurate information for them. */
4831 for (i
= FIRST_STACK_REG
; i
<= LAST_STACK_REG
; i
++)
4832 SET_HARD_REG_BIT (function_used_regs
, i
);
4835 /* The information we have gathered is only interesting if it exposes a
4836 register from the call_used_regs that is not used in this function. */
4837 if (hard_reg_set_subset_p (call_used_reg_set
, function_used_regs
))
4840 node
= cgraph_node::rtl_info (current_function_decl
);
4841 gcc_assert (node
!= NULL
);
4843 COPY_HARD_REG_SET (node
->function_used_regs
, function_used_regs
);
4844 node
->function_used_regs_valid
= 1;
4847 /* Get the declaration of the function called by INSN. */
4850 get_call_fndecl (rtx_insn
*insn
)
4854 note
= find_reg_note (insn
, REG_CALL_DECL
, NULL_RTX
);
4855 if (note
== NULL_RTX
)
4858 datum
= XEXP (note
, 0);
4859 if (datum
!= NULL_RTX
)
4860 return SYMBOL_REF_DECL (datum
);
4865 /* Return the cgraph_rtl_info of the function called by INSN. Returns NULL for
4866 call targets that can be overwritten. */
4868 static struct cgraph_rtl_info
*
4869 get_call_cgraph_rtl_info (rtx_insn
*insn
)
4873 if (insn
== NULL_RTX
)
4876 fndecl
= get_call_fndecl (insn
);
4877 if (fndecl
== NULL_TREE
4878 || !decl_binds_to_current_def_p (fndecl
))
4881 return cgraph_node::rtl_info (fndecl
);
4884 /* Find hard registers used by function call instruction INSN, and return them
4885 in REG_SET. Return DEFAULT_SET in REG_SET if not found. */
4888 get_call_reg_set_usage (rtx_insn
*insn
, HARD_REG_SET
*reg_set
,
4889 HARD_REG_SET default_set
)
4891 if (flag_use_caller_save
)
4893 struct cgraph_rtl_info
*node
= get_call_cgraph_rtl_info (insn
);
4895 && node
->function_used_regs_valid
)
4897 COPY_HARD_REG_SET (*reg_set
, node
->function_used_regs
);
4898 AND_HARD_REG_SET (*reg_set
, default_set
);
4903 COPY_HARD_REG_SET (*reg_set
, default_set
);