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"
64 #include "rtl-error.h"
65 #include "toplev.h" /* exact_log2, floor_log2 */
68 #include "basic-block.h"
70 #include "targhooks.h"
73 #include "tree-pass.h"
81 #include "tree-pretty-print.h" /* for dump_function_header */
83 #include "wide-int-print.h"
86 #ifdef XCOFF_DEBUGGING_INFO
87 #include "xcoffout.h" /* Needed for external data
88 declarations for e.g. AIX 4.x. */
91 #include "dwarf2out.h"
93 #ifdef DBX_DEBUGGING_INFO
97 #ifdef SDB_DEBUGGING_INFO
101 /* Most ports that aren't using cc0 don't need to define CC_STATUS_INIT.
102 So define a null default for it to save conditionalization later. */
103 #ifndef CC_STATUS_INIT
104 #define CC_STATUS_INIT
107 /* Is the given character a logical line separator for the assembler? */
108 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
109 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C, STR) ((C) == ';')
112 #ifndef JUMP_TABLES_IN_TEXT_SECTION
113 #define JUMP_TABLES_IN_TEXT_SECTION 0
116 /* Bitflags used by final_scan_insn. */
118 #define SEEN_EMITTED 2
120 /* Last insn processed by final_scan_insn. */
121 static rtx_insn
*debug_insn
;
122 rtx_insn
*current_output_insn
;
124 /* Line number of last NOTE. */
125 static int last_linenum
;
127 /* Last discriminator written to assembly. */
128 static int last_discriminator
;
130 /* Discriminator of current block. */
131 static int discriminator
;
133 /* Highest line number in current block. */
134 static int high_block_linenum
;
136 /* Likewise for function. */
137 static int high_function_linenum
;
139 /* Filename of last NOTE. */
140 static const char *last_filename
;
142 /* Override filename and line number. */
143 static const char *override_filename
;
144 static int override_linenum
;
146 /* Whether to force emission of a line note before the next insn. */
147 static bool force_source_line
= false;
149 extern const int length_unit_log
; /* This is defined in insn-attrtab.c. */
151 /* Nonzero while outputting an `asm' with operands.
152 This means that inconsistencies are the user's fault, so don't die.
153 The precise value is the insn being output, to pass to error_for_asm. */
154 rtx this_is_asm_operands
;
156 /* Number of operands of this insn, for an `asm' with operands. */
157 static unsigned int insn_noperands
;
159 /* Compare optimization flag. */
161 static rtx last_ignored_compare
= 0;
163 /* Assign a unique number to each insn that is output.
164 This can be used to generate unique local labels. */
166 static int insn_counter
= 0;
169 /* This variable contains machine-dependent flags (defined in tm.h)
170 set and examined by output routines
171 that describe how to interpret the condition codes properly. */
175 /* During output of an insn, this contains a copy of cc_status
176 from before the insn. */
178 CC_STATUS cc_prev_status
;
181 /* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen. */
183 static int block_depth
;
185 /* Nonzero if have enabled APP processing of our assembler output. */
189 /* If we are outputting an insn sequence, this contains the sequence rtx.
192 rtx_sequence
*final_sequence
;
194 #ifdef ASSEMBLER_DIALECT
196 /* Number of the assembler dialect to use, starting at 0. */
197 static int dialect_number
;
200 /* Nonnull if the insn currently being emitted was a COND_EXEC pattern. */
201 rtx current_insn_predicate
;
203 /* True if printing into -fdump-final-insns= dump. */
204 bool final_insns_dump_p
;
206 /* True if profile_function should be called, but hasn't been called yet. */
207 static bool need_profile_function
;
209 static int asm_insn_count (rtx
);
210 static void profile_function (FILE *);
211 static void profile_after_prologue (FILE *);
212 static bool notice_source_line (rtx_insn
*, bool *);
213 static rtx
walk_alter_subreg (rtx
*, bool *);
214 static void output_asm_name (void);
215 static void output_alternate_entry_point (FILE *, rtx_insn
*);
216 static tree
get_mem_expr_from_op (rtx
, int *);
217 static void output_asm_operand_names (rtx
*, int *, int);
218 #ifdef LEAF_REGISTERS
219 static void leaf_renumber_regs (rtx_insn
*);
222 static int alter_cond (rtx
);
224 #ifndef ADDR_VEC_ALIGN
225 static int final_addr_vec_align (rtx
);
227 static int align_fuzz (rtx
, rtx
, int, unsigned);
228 static void collect_fn_hard_reg_usage (void);
229 static tree
get_call_fndecl (rtx_insn
*);
231 /* Initialize data in final at the beginning of a compilation. */
234 init_final (const char *filename ATTRIBUTE_UNUSED
)
239 #ifdef ASSEMBLER_DIALECT
240 dialect_number
= ASSEMBLER_DIALECT
;
244 /* Default target function prologue and epilogue assembler output.
246 If not overridden for epilogue code, then the function body itself
247 contains return instructions wherever needed. */
249 default_function_pro_epilogue (FILE *file ATTRIBUTE_UNUSED
,
250 HOST_WIDE_INT size ATTRIBUTE_UNUSED
)
255 default_function_switched_text_sections (FILE *file ATTRIBUTE_UNUSED
,
256 tree decl ATTRIBUTE_UNUSED
,
257 bool new_is_cold ATTRIBUTE_UNUSED
)
261 /* Default target hook that outputs nothing to a stream. */
263 no_asm_to_stream (FILE *file ATTRIBUTE_UNUSED
)
267 /* Enable APP processing of subsequent output.
268 Used before the output from an `asm' statement. */
275 fputs (ASM_APP_ON
, asm_out_file
);
280 /* Disable APP processing of subsequent output.
281 Called from varasm.c before most kinds of output. */
288 fputs (ASM_APP_OFF
, asm_out_file
);
293 /* Return the number of slots filled in the current
294 delayed branch sequence (we don't count the insn needing the
295 delay slot). Zero if not in a delayed branch sequence. */
299 dbr_sequence_length (void)
301 if (final_sequence
!= 0)
302 return XVECLEN (final_sequence
, 0) - 1;
308 /* The next two pages contain routines used to compute the length of an insn
309 and to shorten branches. */
311 /* Arrays for insn lengths, and addresses. The latter is referenced by
312 `insn_current_length'. */
314 static int *insn_lengths
;
316 vec
<int> insn_addresses_
;
318 /* Max uid for which the above arrays are valid. */
319 static int insn_lengths_max_uid
;
321 /* Address of insn being processed. Used by `insn_current_length'. */
322 int insn_current_address
;
324 /* Address of insn being processed in previous iteration. */
325 int insn_last_address
;
327 /* known invariant alignment of insn being processed. */
328 int insn_current_align
;
330 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
331 gives the next following alignment insn that increases the known
332 alignment, or NULL_RTX if there is no such insn.
333 For any alignment obtained this way, we can again index uid_align with
334 its uid to obtain the next following align that in turn increases the
335 alignment, till we reach NULL_RTX; the sequence obtained this way
336 for each insn we'll call the alignment chain of this insn in the following
339 struct label_alignment
345 static rtx
*uid_align
;
346 static int *uid_shuid
;
347 static struct label_alignment
*label_align
;
349 /* Indicate that branch shortening hasn't yet been done. */
352 init_insn_lengths (void)
363 insn_lengths_max_uid
= 0;
365 if (HAVE_ATTR_length
)
366 INSN_ADDRESSES_FREE ();
374 /* Obtain the current length of an insn. If branch shortening has been done,
375 get its actual length. Otherwise, use FALLBACK_FN to calculate the
378 get_attr_length_1 (rtx uncast_insn
, int (*fallback_fn
) (rtx
))
380 rtx_insn
*insn
= as_a
<rtx_insn
*> (uncast_insn
);
385 if (!HAVE_ATTR_length
)
388 if (insn_lengths_max_uid
> INSN_UID (insn
))
389 return insn_lengths
[INSN_UID (insn
)];
391 switch (GET_CODE (insn
))
401 length
= fallback_fn (insn
);
405 body
= PATTERN (insn
);
406 if (GET_CODE (body
) == USE
|| GET_CODE (body
) == CLOBBER
)
409 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
410 length
= asm_insn_count (body
) * fallback_fn (insn
);
411 else if (rtx_sequence
*seq
= dyn_cast
<rtx_sequence
*> (body
))
412 for (i
= 0; i
< seq
->len (); i
++)
413 length
+= get_attr_length_1 (seq
->insn (i
), fallback_fn
);
415 length
= fallback_fn (insn
);
422 #ifdef ADJUST_INSN_LENGTH
423 ADJUST_INSN_LENGTH (insn
, length
);
428 /* Obtain the current length of an insn. If branch shortening has been done,
429 get its actual length. Otherwise, get its maximum length. */
431 get_attr_length (rtx insn
)
433 return get_attr_length_1 (insn
, insn_default_length
);
436 /* Obtain the current length of an insn. If branch shortening has been done,
437 get its actual length. Otherwise, get its minimum length. */
439 get_attr_min_length (rtx insn
)
441 return get_attr_length_1 (insn
, insn_min_length
);
444 /* Code to handle alignment inside shorten_branches. */
446 /* Here is an explanation how the algorithm in align_fuzz can give
449 Call a sequence of instructions beginning with alignment point X
450 and continuing until the next alignment point `block X'. When `X'
451 is used in an expression, it means the alignment value of the
454 Call the distance between the start of the first insn of block X, and
455 the end of the last insn of block X `IX', for the `inner size of X'.
456 This is clearly the sum of the instruction lengths.
458 Likewise with the next alignment-delimited block following X, which we
461 Call the distance between the start of the first insn of block X, and
462 the start of the first insn of block Y `OX', for the `outer size of X'.
464 The estimated padding is then OX - IX.
466 OX can be safely estimated as
471 OX = round_up(IX, X) + Y - X
473 Clearly est(IX) >= real(IX), because that only depends on the
474 instruction lengths, and those being overestimated is a given.
476 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
477 we needn't worry about that when thinking about OX.
479 When X >= Y, the alignment provided by Y adds no uncertainty factor
480 for branch ranges starting before X, so we can just round what we have.
481 But when X < Y, we don't know anything about the, so to speak,
482 `middle bits', so we have to assume the worst when aligning up from an
483 address mod X to one mod Y, which is Y - X. */
486 #define LABEL_ALIGN(LABEL) align_labels_log
490 #define LOOP_ALIGN(LABEL) align_loops_log
493 #ifndef LABEL_ALIGN_AFTER_BARRIER
494 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
498 #define JUMP_ALIGN(LABEL) align_jumps_log
502 default_label_align_after_barrier_max_skip (rtx insn ATTRIBUTE_UNUSED
)
508 default_loop_align_max_skip (rtx insn ATTRIBUTE_UNUSED
)
510 return align_loops_max_skip
;
514 default_label_align_max_skip (rtx insn ATTRIBUTE_UNUSED
)
516 return align_labels_max_skip
;
520 default_jump_align_max_skip (rtx insn ATTRIBUTE_UNUSED
)
522 return align_jumps_max_skip
;
525 #ifndef ADDR_VEC_ALIGN
527 final_addr_vec_align (rtx addr_vec
)
529 int align
= GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec
)));
531 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
532 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
533 return exact_log2 (align
);
537 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
540 #ifndef INSN_LENGTH_ALIGNMENT
541 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
544 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
546 static int min_labelno
, max_labelno
;
548 #define LABEL_TO_ALIGNMENT(LABEL) \
549 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
551 #define LABEL_TO_MAX_SKIP(LABEL) \
552 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
554 /* For the benefit of port specific code do this also as a function. */
557 label_to_alignment (rtx label
)
559 if (CODE_LABEL_NUMBER (label
) <= max_labelno
)
560 return LABEL_TO_ALIGNMENT (label
);
565 label_to_max_skip (rtx label
)
567 if (CODE_LABEL_NUMBER (label
) <= max_labelno
)
568 return LABEL_TO_MAX_SKIP (label
);
572 /* The differences in addresses
573 between a branch and its target might grow or shrink depending on
574 the alignment the start insn of the range (the branch for a forward
575 branch or the label for a backward branch) starts out on; if these
576 differences are used naively, they can even oscillate infinitely.
577 We therefore want to compute a 'worst case' address difference that
578 is independent of the alignment the start insn of the range end
579 up on, and that is at least as large as the actual difference.
580 The function align_fuzz calculates the amount we have to add to the
581 naively computed difference, by traversing the part of the alignment
582 chain of the start insn of the range that is in front of the end insn
583 of the range, and considering for each alignment the maximum amount
584 that it might contribute to a size increase.
586 For casesi tables, we also want to know worst case minimum amounts of
587 address difference, in case a machine description wants to introduce
588 some common offset that is added to all offsets in a table.
589 For this purpose, align_fuzz with a growth argument of 0 computes the
590 appropriate adjustment. */
592 /* Compute the maximum delta by which the difference of the addresses of
593 START and END might grow / shrink due to a different address for start
594 which changes the size of alignment insns between START and END.
595 KNOWN_ALIGN_LOG is the alignment known for START.
596 GROWTH should be ~0 if the objective is to compute potential code size
597 increase, and 0 if the objective is to compute potential shrink.
598 The return value is undefined for any other value of GROWTH. */
601 align_fuzz (rtx start
, rtx end
, int known_align_log
, unsigned int growth
)
603 int uid
= INSN_UID (start
);
605 int known_align
= 1 << known_align_log
;
606 int end_shuid
= INSN_SHUID (end
);
609 for (align_label
= uid_align
[uid
]; align_label
; align_label
= uid_align
[uid
])
611 int align_addr
, new_align
;
613 uid
= INSN_UID (align_label
);
614 align_addr
= INSN_ADDRESSES (uid
) - insn_lengths
[uid
];
615 if (uid_shuid
[uid
] > end_shuid
)
617 known_align_log
= LABEL_TO_ALIGNMENT (align_label
);
618 new_align
= 1 << known_align_log
;
619 if (new_align
< known_align
)
621 fuzz
+= (-align_addr
^ growth
) & (new_align
- known_align
);
622 known_align
= new_align
;
627 /* Compute a worst-case reference address of a branch so that it
628 can be safely used in the presence of aligned labels. Since the
629 size of the branch itself is unknown, the size of the branch is
630 not included in the range. I.e. for a forward branch, the reference
631 address is the end address of the branch as known from the previous
632 branch shortening pass, minus a value to account for possible size
633 increase due to alignment. For a backward branch, it is the start
634 address of the branch as known from the current pass, plus a value
635 to account for possible size increase due to alignment.
636 NB.: Therefore, the maximum offset allowed for backward branches needs
637 to exclude the branch size. */
640 insn_current_reference_address (rtx_insn
*branch
)
645 if (! INSN_ADDRESSES_SET_P ())
648 seq
= NEXT_INSN (PREV_INSN (branch
));
649 seq_uid
= INSN_UID (seq
);
650 if (!JUMP_P (branch
))
651 /* This can happen for example on the PA; the objective is to know the
652 offset to address something in front of the start of the function.
653 Thus, we can treat it like a backward branch.
654 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
655 any alignment we'd encounter, so we skip the call to align_fuzz. */
656 return insn_current_address
;
657 dest
= JUMP_LABEL (branch
);
659 /* BRANCH has no proper alignment chain set, so use SEQ.
660 BRANCH also has no INSN_SHUID. */
661 if (INSN_SHUID (seq
) < INSN_SHUID (dest
))
663 /* Forward branch. */
664 return (insn_last_address
+ insn_lengths
[seq_uid
]
665 - align_fuzz (seq
, dest
, length_unit_log
, ~0));
669 /* Backward branch. */
670 return (insn_current_address
671 + align_fuzz (dest
, seq
, length_unit_log
, ~0));
675 /* Compute branch alignments based on frequency information in the
679 compute_alignments (void)
681 int log
, max_skip
, max_log
;
684 int freq_threshold
= 0;
692 max_labelno
= max_label_num ();
693 min_labelno
= get_first_label_num ();
694 label_align
= XCNEWVEC (struct label_alignment
, max_labelno
- min_labelno
+ 1);
696 /* If not optimizing or optimizing for size, don't assign any alignments. */
697 if (! optimize
|| optimize_function_for_size_p (cfun
))
702 dump_reg_info (dump_file
);
703 dump_flow_info (dump_file
, TDF_DETAILS
);
704 flow_loops_dump (dump_file
, NULL
, 1);
706 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
707 FOR_EACH_BB_FN (bb
, cfun
)
708 if (bb
->frequency
> freq_max
)
709 freq_max
= bb
->frequency
;
710 freq_threshold
= freq_max
/ PARAM_VALUE (PARAM_ALIGN_THRESHOLD
);
713 fprintf (dump_file
, "freq_max: %i\n",freq_max
);
714 FOR_EACH_BB_FN (bb
, cfun
)
716 rtx_insn
*label
= BB_HEAD (bb
);
717 int fallthru_frequency
= 0, branch_frequency
= 0, has_fallthru
= 0;
722 || optimize_bb_for_size_p (bb
))
726 "BB %4i freq %4i loop %2i loop_depth %2i skipped.\n",
727 bb
->index
, bb
->frequency
, bb
->loop_father
->num
,
731 max_log
= LABEL_ALIGN (label
);
732 max_skip
= targetm
.asm_out
.label_align_max_skip (label
);
734 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
736 if (e
->flags
& EDGE_FALLTHRU
)
737 has_fallthru
= 1, fallthru_frequency
+= EDGE_FREQUENCY (e
);
739 branch_frequency
+= EDGE_FREQUENCY (e
);
743 fprintf (dump_file
, "BB %4i freq %4i loop %2i loop_depth"
744 " %2i fall %4i branch %4i",
745 bb
->index
, bb
->frequency
, bb
->loop_father
->num
,
747 fallthru_frequency
, branch_frequency
);
748 if (!bb
->loop_father
->inner
&& bb
->loop_father
->num
)
749 fprintf (dump_file
, " inner_loop");
750 if (bb
->loop_father
->header
== bb
)
751 fprintf (dump_file
, " loop_header");
752 fprintf (dump_file
, "\n");
755 /* There are two purposes to align block with no fallthru incoming edge:
756 1) to avoid fetch stalls when branch destination is near cache boundary
757 2) to improve cache efficiency in case the previous block is not executed
758 (so it does not need to be in the cache).
760 We to catch first case, we align frequently executed blocks.
761 To catch the second, we align blocks that are executed more frequently
762 than the predecessor and the predecessor is likely to not be executed
763 when function is called. */
766 && (branch_frequency
> freq_threshold
767 || (bb
->frequency
> bb
->prev_bb
->frequency
* 10
768 && (bb
->prev_bb
->frequency
769 <= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->frequency
/ 2))))
771 log
= JUMP_ALIGN (label
);
773 fprintf (dump_file
, " jump alignment added.\n");
777 max_skip
= targetm
.asm_out
.jump_align_max_skip (label
);
780 /* In case block is frequent and reached mostly by non-fallthru edge,
781 align it. It is most likely a first block of loop. */
783 && !(single_succ_p (bb
)
784 && single_succ (bb
) == EXIT_BLOCK_PTR_FOR_FN (cfun
))
785 && optimize_bb_for_speed_p (bb
)
786 && branch_frequency
+ fallthru_frequency
> freq_threshold
788 > fallthru_frequency
* PARAM_VALUE (PARAM_ALIGN_LOOP_ITERATIONS
)))
790 log
= LOOP_ALIGN (label
);
792 fprintf (dump_file
, " internal loop alignment added.\n");
796 max_skip
= targetm
.asm_out
.loop_align_max_skip (label
);
799 LABEL_TO_ALIGNMENT (label
) = max_log
;
800 LABEL_TO_MAX_SKIP (label
) = max_skip
;
803 loop_optimizer_finalize ();
804 free_dominance_info (CDI_DOMINATORS
);
808 /* Grow the LABEL_ALIGN array after new labels are created. */
811 grow_label_align (void)
813 int old
= max_labelno
;
817 max_labelno
= max_label_num ();
819 n_labels
= max_labelno
- min_labelno
+ 1;
820 n_old_labels
= old
- min_labelno
+ 1;
822 label_align
= XRESIZEVEC (struct label_alignment
, label_align
, n_labels
);
824 /* Range of labels grows monotonically in the function. Failing here
825 means that the initialization of array got lost. */
826 gcc_assert (n_old_labels
<= n_labels
);
828 memset (label_align
+ n_old_labels
, 0,
829 (n_labels
- n_old_labels
) * sizeof (struct label_alignment
));
832 /* Update the already computed alignment information. LABEL_PAIRS is a vector
833 made up of pairs of labels for which the alignment information of the first
834 element will be copied from that of the second element. */
837 update_alignments (vec
<rtx
> &label_pairs
)
840 rtx iter
, label
= NULL_RTX
;
842 if (max_labelno
!= max_label_num ())
845 FOR_EACH_VEC_ELT (label_pairs
, i
, iter
)
848 LABEL_TO_ALIGNMENT (label
) = LABEL_TO_ALIGNMENT (iter
);
849 LABEL_TO_MAX_SKIP (label
) = LABEL_TO_MAX_SKIP (iter
);
857 const pass_data pass_data_compute_alignments
=
860 "alignments", /* name */
861 OPTGROUP_NONE
, /* optinfo_flags */
863 0, /* properties_required */
864 0, /* properties_provided */
865 0, /* properties_destroyed */
866 0, /* todo_flags_start */
867 0, /* todo_flags_finish */
870 class pass_compute_alignments
: public rtl_opt_pass
873 pass_compute_alignments (gcc::context
*ctxt
)
874 : rtl_opt_pass (pass_data_compute_alignments
, ctxt
)
877 /* opt_pass methods: */
878 virtual unsigned int execute (function
*) { return compute_alignments (); }
880 }; // class pass_compute_alignments
885 make_pass_compute_alignments (gcc::context
*ctxt
)
887 return new pass_compute_alignments (ctxt
);
891 /* Make a pass over all insns and compute their actual lengths by shortening
892 any branches of variable length if possible. */
894 /* shorten_branches might be called multiple times: for example, the SH
895 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
896 In order to do this, it needs proper length information, which it obtains
897 by calling shorten_branches. This cannot be collapsed with
898 shorten_branches itself into a single pass unless we also want to integrate
899 reorg.c, since the branch splitting exposes new instructions with delay
903 shorten_branches (rtx_insn
*first
)
910 #define MAX_CODE_ALIGN 16
912 int something_changed
= 1;
913 char *varying_length
;
916 rtx align_tab
[MAX_CODE_ALIGN
];
918 /* Compute maximum UID and allocate label_align / uid_shuid. */
919 max_uid
= get_max_uid ();
921 /* Free uid_shuid before reallocating it. */
924 uid_shuid
= XNEWVEC (int, max_uid
);
926 if (max_labelno
!= max_label_num ())
929 /* Initialize label_align and set up uid_shuid to be strictly
930 monotonically rising with insn order. */
931 /* We use max_log here to keep track of the maximum alignment we want to
932 impose on the next CODE_LABEL (or the current one if we are processing
933 the CODE_LABEL itself). */
938 for (insn
= get_insns (), i
= 1; insn
; insn
= NEXT_INSN (insn
))
942 INSN_SHUID (insn
) = i
++;
949 bool next_is_jumptable
;
951 /* Merge in alignments computed by compute_alignments. */
952 log
= LABEL_TO_ALIGNMENT (insn
);
956 max_skip
= LABEL_TO_MAX_SKIP (insn
);
959 next
= next_nonnote_insn (insn
);
960 next_is_jumptable
= next
&& JUMP_TABLE_DATA_P (next
);
961 if (!next_is_jumptable
)
963 log
= LABEL_ALIGN (insn
);
967 max_skip
= targetm
.asm_out
.label_align_max_skip (insn
);
970 /* ADDR_VECs only take room if read-only data goes into the text
972 if ((JUMP_TABLES_IN_TEXT_SECTION
973 || readonly_data_section
== text_section
)
974 && next_is_jumptable
)
976 log
= ADDR_VEC_ALIGN (next
);
980 max_skip
= targetm
.asm_out
.label_align_max_skip (insn
);
983 LABEL_TO_ALIGNMENT (insn
) = max_log
;
984 LABEL_TO_MAX_SKIP (insn
) = max_skip
;
988 else if (BARRIER_P (insn
))
992 for (label
= insn
; label
&& ! INSN_P (label
);
993 label
= NEXT_INSN (label
))
996 log
= LABEL_ALIGN_AFTER_BARRIER (insn
);
1000 max_skip
= targetm
.asm_out
.label_align_after_barrier_max_skip (label
);
1006 if (!HAVE_ATTR_length
)
1009 /* Allocate the rest of the arrays. */
1010 insn_lengths
= XNEWVEC (int, max_uid
);
1011 insn_lengths_max_uid
= max_uid
;
1012 /* Syntax errors can lead to labels being outside of the main insn stream.
1013 Initialize insn_addresses, so that we get reproducible results. */
1014 INSN_ADDRESSES_ALLOC (max_uid
);
1016 varying_length
= XCNEWVEC (char, max_uid
);
1018 /* Initialize uid_align. We scan instructions
1019 from end to start, and keep in align_tab[n] the last seen insn
1020 that does an alignment of at least n+1, i.e. the successor
1021 in the alignment chain for an insn that does / has a known
1023 uid_align
= XCNEWVEC (rtx
, max_uid
);
1025 for (i
= MAX_CODE_ALIGN
; --i
>= 0;)
1026 align_tab
[i
] = NULL_RTX
;
1027 seq
= get_last_insn ();
1028 for (; seq
; seq
= PREV_INSN (seq
))
1030 int uid
= INSN_UID (seq
);
1032 log
= (LABEL_P (seq
) ? LABEL_TO_ALIGNMENT (seq
) : 0);
1033 uid_align
[uid
] = align_tab
[0];
1036 /* Found an alignment label. */
1037 uid_align
[uid
] = align_tab
[log
];
1038 for (i
= log
- 1; i
>= 0; i
--)
1043 /* When optimizing, we start assuming minimum length, and keep increasing
1044 lengths as we find the need for this, till nothing changes.
1045 When not optimizing, we start assuming maximum lengths, and
1046 do a single pass to update the lengths. */
1047 bool increasing
= optimize
!= 0;
1049 #ifdef CASE_VECTOR_SHORTEN_MODE
1052 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1055 int min_shuid
= INSN_SHUID (get_insns ()) - 1;
1056 int max_shuid
= INSN_SHUID (get_last_insn ()) + 1;
1059 for (insn
= first
; insn
!= 0; insn
= NEXT_INSN (insn
))
1061 rtx min_lab
= NULL_RTX
, max_lab
= NULL_RTX
, pat
;
1062 int len
, i
, min
, max
, insn_shuid
;
1064 addr_diff_vec_flags flags
;
1066 if (! JUMP_TABLE_DATA_P (insn
)
1067 || GET_CODE (PATTERN (insn
)) != ADDR_DIFF_VEC
)
1069 pat
= PATTERN (insn
);
1070 len
= XVECLEN (pat
, 1);
1071 gcc_assert (len
> 0);
1072 min_align
= MAX_CODE_ALIGN
;
1073 for (min
= max_shuid
, max
= min_shuid
, i
= len
- 1; i
>= 0; i
--)
1075 rtx lab
= XEXP (XVECEXP (pat
, 1, i
), 0);
1076 int shuid
= INSN_SHUID (lab
);
1087 if (min_align
> LABEL_TO_ALIGNMENT (lab
))
1088 min_align
= LABEL_TO_ALIGNMENT (lab
);
1090 XEXP (pat
, 2) = gen_rtx_LABEL_REF (Pmode
, min_lab
);
1091 XEXP (pat
, 3) = gen_rtx_LABEL_REF (Pmode
, max_lab
);
1092 insn_shuid
= INSN_SHUID (insn
);
1093 rel
= INSN_SHUID (XEXP (XEXP (pat
, 0), 0));
1094 memset (&flags
, 0, sizeof (flags
));
1095 flags
.min_align
= min_align
;
1096 flags
.base_after_vec
= rel
> insn_shuid
;
1097 flags
.min_after_vec
= min
> insn_shuid
;
1098 flags
.max_after_vec
= max
> insn_shuid
;
1099 flags
.min_after_base
= min
> rel
;
1100 flags
.max_after_base
= max
> rel
;
1101 ADDR_DIFF_VEC_FLAGS (pat
) = flags
;
1104 PUT_MODE (pat
, CASE_VECTOR_SHORTEN_MODE (0, 0, pat
));
1107 #endif /* CASE_VECTOR_SHORTEN_MODE */
1109 /* Compute initial lengths, addresses, and varying flags for each insn. */
1110 int (*length_fun
) (rtx
) = increasing
? insn_min_length
: insn_default_length
;
1112 for (insn_current_address
= 0, insn
= first
;
1114 insn_current_address
+= insn_lengths
[uid
], insn
= NEXT_INSN (insn
))
1116 uid
= INSN_UID (insn
);
1118 insn_lengths
[uid
] = 0;
1122 int log
= LABEL_TO_ALIGNMENT (insn
);
1125 int align
= 1 << log
;
1126 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1127 insn_lengths
[uid
] = new_address
- insn_current_address
;
1131 INSN_ADDRESSES (uid
) = insn_current_address
+ insn_lengths
[uid
];
1133 if (NOTE_P (insn
) || BARRIER_P (insn
)
1134 || LABEL_P (insn
) || DEBUG_INSN_P (insn
))
1136 if (INSN_DELETED_P (insn
))
1139 body
= PATTERN (insn
);
1140 if (JUMP_TABLE_DATA_P (insn
))
1142 /* This only takes room if read-only data goes into the text
1144 if (JUMP_TABLES_IN_TEXT_SECTION
1145 || readonly_data_section
== text_section
)
1146 insn_lengths
[uid
] = (XVECLEN (body
,
1147 GET_CODE (body
) == ADDR_DIFF_VEC
)
1148 * GET_MODE_SIZE (GET_MODE (body
)));
1149 /* Alignment is handled by ADDR_VEC_ALIGN. */
1151 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
1152 insn_lengths
[uid
] = asm_insn_count (body
) * insn_default_length (insn
);
1153 else if (rtx_sequence
*body_seq
= dyn_cast
<rtx_sequence
*> (body
))
1156 int const_delay_slots
;
1158 const_delay_slots
= const_num_delay_slots (body_seq
->insn (0));
1160 const_delay_slots
= 0;
1162 int (*inner_length_fun
) (rtx
)
1163 = const_delay_slots
? length_fun
: insn_default_length
;
1164 /* Inside a delay slot sequence, we do not do any branch shortening
1165 if the shortening could change the number of delay slots
1167 for (i
= 0; i
< body_seq
->len (); i
++)
1169 rtx_insn
*inner_insn
= body_seq
->insn (i
);
1170 int inner_uid
= INSN_UID (inner_insn
);
1173 if (GET_CODE (body
) == ASM_INPUT
1174 || asm_noperands (PATTERN (inner_insn
)) >= 0)
1175 inner_length
= (asm_insn_count (PATTERN (inner_insn
))
1176 * insn_default_length (inner_insn
));
1178 inner_length
= inner_length_fun (inner_insn
);
1180 insn_lengths
[inner_uid
] = inner_length
;
1181 if (const_delay_slots
)
1183 if ((varying_length
[inner_uid
]
1184 = insn_variable_length_p (inner_insn
)) != 0)
1185 varying_length
[uid
] = 1;
1186 INSN_ADDRESSES (inner_uid
) = (insn_current_address
1187 + insn_lengths
[uid
]);
1190 varying_length
[inner_uid
] = 0;
1191 insn_lengths
[uid
] += inner_length
;
1194 else if (GET_CODE (body
) != USE
&& GET_CODE (body
) != CLOBBER
)
1196 insn_lengths
[uid
] = length_fun (insn
);
1197 varying_length
[uid
] = insn_variable_length_p (insn
);
1200 /* If needed, do any adjustment. */
1201 #ifdef ADJUST_INSN_LENGTH
1202 ADJUST_INSN_LENGTH (insn
, insn_lengths
[uid
]);
1203 if (insn_lengths
[uid
] < 0)
1204 fatal_insn ("negative insn length", insn
);
1208 /* Now loop over all the insns finding varying length insns. For each,
1209 get the current insn length. If it has changed, reflect the change.
1210 When nothing changes for a full pass, we are done. */
1212 while (something_changed
)
1214 something_changed
= 0;
1215 insn_current_align
= MAX_CODE_ALIGN
- 1;
1216 for (insn_current_address
= 0, insn
= first
;
1218 insn
= NEXT_INSN (insn
))
1221 #ifdef ADJUST_INSN_LENGTH
1226 uid
= INSN_UID (insn
);
1230 int log
= LABEL_TO_ALIGNMENT (insn
);
1232 #ifdef CASE_VECTOR_SHORTEN_MODE
1233 /* If the mode of a following jump table was changed, we
1234 may need to update the alignment of this label. */
1236 bool next_is_jumptable
;
1238 next
= next_nonnote_insn (insn
);
1239 next_is_jumptable
= next
&& JUMP_TABLE_DATA_P (next
);
1240 if ((JUMP_TABLES_IN_TEXT_SECTION
1241 || readonly_data_section
== text_section
)
1242 && next_is_jumptable
)
1244 int newlog
= ADDR_VEC_ALIGN (next
);
1248 LABEL_TO_ALIGNMENT (insn
) = log
;
1249 something_changed
= 1;
1254 if (log
> insn_current_align
)
1256 int align
= 1 << log
;
1257 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1258 insn_lengths
[uid
] = new_address
- insn_current_address
;
1259 insn_current_align
= log
;
1260 insn_current_address
= new_address
;
1263 insn_lengths
[uid
] = 0;
1264 INSN_ADDRESSES (uid
) = insn_current_address
;
1268 length_align
= INSN_LENGTH_ALIGNMENT (insn
);
1269 if (length_align
< insn_current_align
)
1270 insn_current_align
= length_align
;
1272 insn_last_address
= INSN_ADDRESSES (uid
);
1273 INSN_ADDRESSES (uid
) = insn_current_address
;
1275 #ifdef CASE_VECTOR_SHORTEN_MODE
1277 && JUMP_TABLE_DATA_P (insn
)
1278 && GET_CODE (PATTERN (insn
)) == ADDR_DIFF_VEC
)
1280 rtx body
= PATTERN (insn
);
1281 int old_length
= insn_lengths
[uid
];
1283 safe_as_a
<rtx_insn
*> (XEXP (XEXP (body
, 0), 0));
1284 rtx min_lab
= XEXP (XEXP (body
, 2), 0);
1285 rtx max_lab
= XEXP (XEXP (body
, 3), 0);
1286 int rel_addr
= INSN_ADDRESSES (INSN_UID (rel_lab
));
1287 int min_addr
= INSN_ADDRESSES (INSN_UID (min_lab
));
1288 int max_addr
= INSN_ADDRESSES (INSN_UID (max_lab
));
1291 addr_diff_vec_flags flags
;
1292 enum machine_mode vec_mode
;
1294 /* Avoid automatic aggregate initialization. */
1295 flags
= ADDR_DIFF_VEC_FLAGS (body
);
1297 /* Try to find a known alignment for rel_lab. */
1298 for (prev
= rel_lab
;
1300 && ! insn_lengths
[INSN_UID (prev
)]
1301 && ! (varying_length
[INSN_UID (prev
)] & 1);
1302 prev
= PREV_INSN (prev
))
1303 if (varying_length
[INSN_UID (prev
)] & 2)
1305 rel_align
= LABEL_TO_ALIGNMENT (prev
);
1309 /* See the comment on addr_diff_vec_flags in rtl.h for the
1310 meaning of the flags values. base: REL_LAB vec: INSN */
1311 /* Anything after INSN has still addresses from the last
1312 pass; adjust these so that they reflect our current
1313 estimate for this pass. */
1314 if (flags
.base_after_vec
)
1315 rel_addr
+= insn_current_address
- insn_last_address
;
1316 if (flags
.min_after_vec
)
1317 min_addr
+= insn_current_address
- insn_last_address
;
1318 if (flags
.max_after_vec
)
1319 max_addr
+= insn_current_address
- insn_last_address
;
1320 /* We want to know the worst case, i.e. lowest possible value
1321 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1322 its offset is positive, and we have to be wary of code shrink;
1323 otherwise, it is negative, and we have to be vary of code
1325 if (flags
.min_after_base
)
1327 /* If INSN is between REL_LAB and MIN_LAB, the size
1328 changes we are about to make can change the alignment
1329 within the observed offset, therefore we have to break
1330 it up into two parts that are independent. */
1331 if (! flags
.base_after_vec
&& flags
.min_after_vec
)
1333 min_addr
-= align_fuzz (rel_lab
, insn
, rel_align
, 0);
1334 min_addr
-= align_fuzz (insn
, min_lab
, 0, 0);
1337 min_addr
-= align_fuzz (rel_lab
, min_lab
, rel_align
, 0);
1341 if (flags
.base_after_vec
&& ! flags
.min_after_vec
)
1343 min_addr
-= align_fuzz (min_lab
, insn
, 0, ~0);
1344 min_addr
-= align_fuzz (insn
, rel_lab
, 0, ~0);
1347 min_addr
-= align_fuzz (min_lab
, rel_lab
, 0, ~0);
1349 /* Likewise, determine the highest lowest possible value
1350 for the offset of MAX_LAB. */
1351 if (flags
.max_after_base
)
1353 if (! flags
.base_after_vec
&& flags
.max_after_vec
)
1355 max_addr
+= align_fuzz (rel_lab
, insn
, rel_align
, ~0);
1356 max_addr
+= align_fuzz (insn
, max_lab
, 0, ~0);
1359 max_addr
+= align_fuzz (rel_lab
, max_lab
, rel_align
, ~0);
1363 if (flags
.base_after_vec
&& ! flags
.max_after_vec
)
1365 max_addr
+= align_fuzz (max_lab
, insn
, 0, 0);
1366 max_addr
+= align_fuzz (insn
, rel_lab
, 0, 0);
1369 max_addr
+= align_fuzz (max_lab
, rel_lab
, 0, 0);
1371 vec_mode
= CASE_VECTOR_SHORTEN_MODE (min_addr
- rel_addr
,
1372 max_addr
- rel_addr
, body
);
1374 || (GET_MODE_SIZE (vec_mode
)
1375 >= GET_MODE_SIZE (GET_MODE (body
))))
1376 PUT_MODE (body
, vec_mode
);
1377 if (JUMP_TABLES_IN_TEXT_SECTION
1378 || readonly_data_section
== text_section
)
1381 = (XVECLEN (body
, 1) * GET_MODE_SIZE (GET_MODE (body
)));
1382 insn_current_address
+= insn_lengths
[uid
];
1383 if (insn_lengths
[uid
] != old_length
)
1384 something_changed
= 1;
1389 #endif /* CASE_VECTOR_SHORTEN_MODE */
1391 if (! (varying_length
[uid
]))
1393 if (NONJUMP_INSN_P (insn
)
1394 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1398 body
= PATTERN (insn
);
1399 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1401 rtx inner_insn
= XVECEXP (body
, 0, i
);
1402 int inner_uid
= INSN_UID (inner_insn
);
1404 INSN_ADDRESSES (inner_uid
) = insn_current_address
;
1406 insn_current_address
+= insn_lengths
[inner_uid
];
1410 insn_current_address
+= insn_lengths
[uid
];
1415 if (NONJUMP_INSN_P (insn
) && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1419 body
= PATTERN (insn
);
1421 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1423 rtx inner_insn
= XVECEXP (body
, 0, i
);
1424 int inner_uid
= INSN_UID (inner_insn
);
1427 INSN_ADDRESSES (inner_uid
) = insn_current_address
;
1429 /* insn_current_length returns 0 for insns with a
1430 non-varying length. */
1431 if (! varying_length
[inner_uid
])
1432 inner_length
= insn_lengths
[inner_uid
];
1434 inner_length
= insn_current_length (inner_insn
);
1436 if (inner_length
!= insn_lengths
[inner_uid
])
1438 if (!increasing
|| inner_length
> insn_lengths
[inner_uid
])
1440 insn_lengths
[inner_uid
] = inner_length
;
1441 something_changed
= 1;
1444 inner_length
= insn_lengths
[inner_uid
];
1446 insn_current_address
+= inner_length
;
1447 new_length
+= inner_length
;
1452 new_length
= insn_current_length (insn
);
1453 insn_current_address
+= new_length
;
1456 #ifdef ADJUST_INSN_LENGTH
1457 /* If needed, do any adjustment. */
1458 tmp_length
= new_length
;
1459 ADJUST_INSN_LENGTH (insn
, new_length
);
1460 insn_current_address
+= (new_length
- tmp_length
);
1463 if (new_length
!= insn_lengths
[uid
]
1464 && (!increasing
|| new_length
> insn_lengths
[uid
]))
1466 insn_lengths
[uid
] = new_length
;
1467 something_changed
= 1;
1470 insn_current_address
+= insn_lengths
[uid
] - new_length
;
1472 /* For a non-optimizing compile, do only a single pass. */
1477 free (varying_length
);
1480 /* Given the body of an INSN known to be generated by an ASM statement, return
1481 the number of machine instructions likely to be generated for this insn.
1482 This is used to compute its length. */
1485 asm_insn_count (rtx body
)
1489 if (GET_CODE (body
) == ASM_INPUT
)
1490 templ
= XSTR (body
, 0);
1492 templ
= decode_asm_operands (body
, NULL
, NULL
, NULL
, NULL
, NULL
);
1494 return asm_str_count (templ
);
1497 /* Return the number of machine instructions likely to be generated for the
1498 inline-asm template. */
1500 asm_str_count (const char *templ
)
1507 for (; *templ
; templ
++)
1508 if (IS_ASM_LOGICAL_LINE_SEPARATOR (*templ
, templ
)
1515 /* ??? This is probably the wrong place for these. */
1516 /* Structure recording the mapping from source file and directory
1517 names at compile time to those to be embedded in debug
1519 typedef struct debug_prefix_map
1521 const char *old_prefix
;
1522 const char *new_prefix
;
1525 struct debug_prefix_map
*next
;
1528 /* Linked list of such structures. */
1529 static debug_prefix_map
*debug_prefix_maps
;
1532 /* Record a debug file prefix mapping. ARG is the argument to
1533 -fdebug-prefix-map and must be of the form OLD=NEW. */
1536 add_debug_prefix_map (const char *arg
)
1538 debug_prefix_map
*map
;
1541 p
= strchr (arg
, '=');
1544 error ("invalid argument %qs to -fdebug-prefix-map", arg
);
1547 map
= XNEW (debug_prefix_map
);
1548 map
->old_prefix
= xstrndup (arg
, p
- arg
);
1549 map
->old_len
= p
- arg
;
1551 map
->new_prefix
= xstrdup (p
);
1552 map
->new_len
= strlen (p
);
1553 map
->next
= debug_prefix_maps
;
1554 debug_prefix_maps
= map
;
1557 /* Perform user-specified mapping of debug filename prefixes. Return
1558 the new name corresponding to FILENAME. */
1561 remap_debug_filename (const char *filename
)
1563 debug_prefix_map
*map
;
1568 for (map
= debug_prefix_maps
; map
; map
= map
->next
)
1569 if (filename_ncmp (filename
, map
->old_prefix
, map
->old_len
) == 0)
1573 name
= filename
+ map
->old_len
;
1574 name_len
= strlen (name
) + 1;
1575 s
= (char *) alloca (name_len
+ map
->new_len
);
1576 memcpy (s
, map
->new_prefix
, map
->new_len
);
1577 memcpy (s
+ map
->new_len
, name
, name_len
);
1578 return ggc_strdup (s
);
1581 /* Return true if DWARF2 debug info can be emitted for DECL. */
1584 dwarf2_debug_info_emitted_p (tree decl
)
1586 if (write_symbols
!= DWARF2_DEBUG
&& write_symbols
!= VMS_AND_DWARF2_DEBUG
)
1589 if (DECL_IGNORED_P (decl
))
1595 /* Return scope resulting from combination of S1 and S2. */
1597 choose_inner_scope (tree s1
, tree s2
)
1603 if (BLOCK_NUMBER (s1
) > BLOCK_NUMBER (s2
))
1608 /* Emit lexical block notes needed to change scope from S1 to S2. */
1611 change_scope (rtx_insn
*orig_insn
, tree s1
, tree s2
)
1613 rtx_insn
*insn
= orig_insn
;
1614 tree com
= NULL_TREE
;
1615 tree ts1
= s1
, ts2
= s2
;
1620 gcc_assert (ts1
&& ts2
);
1621 if (BLOCK_NUMBER (ts1
) > BLOCK_NUMBER (ts2
))
1622 ts1
= BLOCK_SUPERCONTEXT (ts1
);
1623 else if (BLOCK_NUMBER (ts1
) < BLOCK_NUMBER (ts2
))
1624 ts2
= BLOCK_SUPERCONTEXT (ts2
);
1627 ts1
= BLOCK_SUPERCONTEXT (ts1
);
1628 ts2
= BLOCK_SUPERCONTEXT (ts2
);
1637 rtx_note
*note
= emit_note_before (NOTE_INSN_BLOCK_END
, insn
);
1638 NOTE_BLOCK (note
) = s
;
1639 s
= BLOCK_SUPERCONTEXT (s
);
1646 insn
= emit_note_before (NOTE_INSN_BLOCK_BEG
, insn
);
1647 NOTE_BLOCK (insn
) = s
;
1648 s
= BLOCK_SUPERCONTEXT (s
);
1652 /* Rebuild all the NOTE_INSN_BLOCK_BEG and NOTE_INSN_BLOCK_END notes based
1653 on the scope tree and the newly reordered instructions. */
1656 reemit_insn_block_notes (void)
1658 tree cur_block
= DECL_INITIAL (cfun
->decl
);
1662 insn
= get_insns ();
1663 for (; insn
; insn
= NEXT_INSN (insn
))
1667 /* Prevent lexical blocks from straddling section boundaries. */
1668 if (NOTE_P (insn
) && NOTE_KIND (insn
) == NOTE_INSN_SWITCH_TEXT_SECTIONS
)
1670 for (tree s
= cur_block
; s
!= DECL_INITIAL (cfun
->decl
);
1671 s
= BLOCK_SUPERCONTEXT (s
))
1673 rtx_note
*note
= emit_note_before (NOTE_INSN_BLOCK_END
, insn
);
1674 NOTE_BLOCK (note
) = s
;
1675 note
= emit_note_after (NOTE_INSN_BLOCK_BEG
, insn
);
1676 NOTE_BLOCK (note
) = s
;
1680 if (!active_insn_p (insn
))
1683 /* Avoid putting scope notes between jump table and its label. */
1684 if (JUMP_TABLE_DATA_P (insn
))
1687 this_block
= insn_scope (insn
);
1688 /* For sequences compute scope resulting from merging all scopes
1689 of instructions nested inside. */
1690 if (rtx_sequence
*body
= dyn_cast
<rtx_sequence
*> (PATTERN (insn
)))
1695 for (i
= 0; i
< body
->len (); i
++)
1696 this_block
= choose_inner_scope (this_block
,
1697 insn_scope (body
->insn (i
)));
1701 if (INSN_LOCATION (insn
) == UNKNOWN_LOCATION
)
1704 this_block
= DECL_INITIAL (cfun
->decl
);
1707 if (this_block
!= cur_block
)
1709 change_scope (insn
, cur_block
, this_block
);
1710 cur_block
= this_block
;
1714 /* change_scope emits before the insn, not after. */
1715 note
= emit_note (NOTE_INSN_DELETED
);
1716 change_scope (note
, cur_block
, DECL_INITIAL (cfun
->decl
));
1722 static const char *some_local_dynamic_name
;
1724 /* Locate some local-dynamic symbol still in use by this function
1725 so that we can print its name in local-dynamic base patterns.
1726 Return null if there are no local-dynamic references. */
1729 get_some_local_dynamic_name ()
1731 subrtx_iterator::array_type array
;
1734 if (some_local_dynamic_name
)
1735 return some_local_dynamic_name
;
1737 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
1738 if (NONDEBUG_INSN_P (insn
))
1739 FOR_EACH_SUBRTX (iter
, array
, PATTERN (insn
), ALL
)
1741 const_rtx x
= *iter
;
1742 if (GET_CODE (x
) == SYMBOL_REF
)
1744 if (SYMBOL_REF_TLS_MODEL (x
) == TLS_MODEL_LOCAL_DYNAMIC
)
1745 return some_local_dynamic_name
= XSTR (x
, 0);
1746 if (CONSTANT_POOL_ADDRESS_P (x
))
1747 iter
.substitute (get_pool_constant (x
));
1754 /* Output assembler code for the start of a function,
1755 and initialize some of the variables in this file
1756 for the new function. The label for the function and associated
1757 assembler pseudo-ops have already been output in `assemble_start_function'.
1759 FIRST is the first insn of the rtl for the function being compiled.
1760 FILE is the file to write assembler code to.
1761 OPTIMIZE_P is nonzero if we should eliminate redundant
1762 test and compare insns. */
1765 final_start_function (rtx_insn
*first
, FILE *file
,
1766 int optimize_p ATTRIBUTE_UNUSED
)
1770 this_is_asm_operands
= 0;
1772 need_profile_function
= false;
1774 last_filename
= LOCATION_FILE (prologue_location
);
1775 last_linenum
= LOCATION_LINE (prologue_location
);
1776 last_discriminator
= discriminator
= 0;
1778 high_block_linenum
= high_function_linenum
= last_linenum
;
1780 if (flag_sanitize
& SANITIZE_ADDRESS
)
1781 asan_function_start ();
1783 if (!DECL_IGNORED_P (current_function_decl
))
1784 debug_hooks
->begin_prologue (last_linenum
, last_filename
);
1786 if (!dwarf2_debug_info_emitted_p (current_function_decl
))
1787 dwarf2out_begin_prologue (0, NULL
);
1789 #ifdef LEAF_REG_REMAP
1790 if (crtl
->uses_only_leaf_regs
)
1791 leaf_renumber_regs (first
);
1794 /* The Sun386i and perhaps other machines don't work right
1795 if the profiling code comes after the prologue. */
1796 if (targetm
.profile_before_prologue () && crtl
->profile
)
1798 if (targetm
.asm_out
.function_prologue
1799 == default_function_pro_epilogue
1800 #ifdef HAVE_prologue
1806 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1812 else if (NOTE_KIND (insn
) == NOTE_INSN_BASIC_BLOCK
1813 || NOTE_KIND (insn
) == NOTE_INSN_FUNCTION_BEG
)
1815 else if (NOTE_KIND (insn
) == NOTE_INSN_DELETED
1816 || NOTE_KIND (insn
) == NOTE_INSN_VAR_LOCATION
)
1825 need_profile_function
= true;
1827 profile_function (file
);
1830 profile_function (file
);
1833 /* If debugging, assign block numbers to all of the blocks in this
1837 reemit_insn_block_notes ();
1838 number_blocks (current_function_decl
);
1839 /* We never actually put out begin/end notes for the top-level
1840 block in the function. But, conceptually, that block is
1842 TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl
)) = 1;
1845 if (warn_frame_larger_than
1846 && get_frame_size () > frame_larger_than_size
)
1848 /* Issue a warning */
1849 warning (OPT_Wframe_larger_than_
,
1850 "the frame size of %wd bytes is larger than %wd bytes",
1851 get_frame_size (), frame_larger_than_size
);
1854 /* First output the function prologue: code to set up the stack frame. */
1855 targetm
.asm_out
.function_prologue (file
, get_frame_size ());
1857 /* If the machine represents the prologue as RTL, the profiling code must
1858 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1859 #ifdef HAVE_prologue
1860 if (! HAVE_prologue
)
1862 profile_after_prologue (file
);
1866 profile_after_prologue (FILE *file ATTRIBUTE_UNUSED
)
1868 if (!targetm
.profile_before_prologue () && crtl
->profile
)
1869 profile_function (file
);
1873 profile_function (FILE *file ATTRIBUTE_UNUSED
)
1875 #ifndef NO_PROFILE_COUNTERS
1876 # define NO_PROFILE_COUNTERS 0
1878 #ifdef ASM_OUTPUT_REG_PUSH
1879 rtx sval
= NULL
, chain
= NULL
;
1881 if (cfun
->returns_struct
)
1882 sval
= targetm
.calls
.struct_value_rtx (TREE_TYPE (current_function_decl
),
1884 if (cfun
->static_chain_decl
)
1885 chain
= targetm
.calls
.static_chain (current_function_decl
, true);
1886 #endif /* ASM_OUTPUT_REG_PUSH */
1888 if (! NO_PROFILE_COUNTERS
)
1890 int align
= MIN (BIGGEST_ALIGNMENT
, LONG_TYPE_SIZE
);
1891 switch_to_section (data_section
);
1892 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
1893 targetm
.asm_out
.internal_label (file
, "LP", current_function_funcdef_no
);
1894 assemble_integer (const0_rtx
, LONG_TYPE_SIZE
/ BITS_PER_UNIT
, align
, 1);
1897 switch_to_section (current_function_section ());
1899 #ifdef ASM_OUTPUT_REG_PUSH
1900 if (sval
&& REG_P (sval
))
1901 ASM_OUTPUT_REG_PUSH (file
, REGNO (sval
));
1902 if (chain
&& REG_P (chain
))
1903 ASM_OUTPUT_REG_PUSH (file
, REGNO (chain
));
1906 FUNCTION_PROFILER (file
, current_function_funcdef_no
);
1908 #ifdef ASM_OUTPUT_REG_PUSH
1909 if (chain
&& REG_P (chain
))
1910 ASM_OUTPUT_REG_POP (file
, REGNO (chain
));
1911 if (sval
&& REG_P (sval
))
1912 ASM_OUTPUT_REG_POP (file
, REGNO (sval
));
1916 /* Output assembler code for the end of a function.
1917 For clarity, args are same as those of `final_start_function'
1918 even though not all of them are needed. */
1921 final_end_function (void)
1925 if (!DECL_IGNORED_P (current_function_decl
))
1926 debug_hooks
->end_function (high_function_linenum
);
1928 /* Finally, output the function epilogue:
1929 code to restore the stack frame and return to the caller. */
1930 targetm
.asm_out
.function_epilogue (asm_out_file
, get_frame_size ());
1932 /* And debug output. */
1933 if (!DECL_IGNORED_P (current_function_decl
))
1934 debug_hooks
->end_epilogue (last_linenum
, last_filename
);
1936 if (!dwarf2_debug_info_emitted_p (current_function_decl
)
1937 && dwarf2out_do_frame ())
1938 dwarf2out_end_epilogue (last_linenum
, last_filename
);
1940 some_local_dynamic_name
= 0;
1944 /* Dumper helper for basic block information. FILE is the assembly
1945 output file, and INSN is the instruction being emitted. */
1948 dump_basic_block_info (FILE *file
, rtx_insn
*insn
, basic_block
*start_to_bb
,
1949 basic_block
*end_to_bb
, int bb_map_size
, int *bb_seqn
)
1953 if (!flag_debug_asm
)
1956 if (INSN_UID (insn
) < bb_map_size
1957 && (bb
= start_to_bb
[INSN_UID (insn
)]) != NULL
)
1962 fprintf (file
, "%s BLOCK %d", ASM_COMMENT_START
, bb
->index
);
1964 fprintf (file
, " freq:%d", bb
->frequency
);
1966 fprintf (file
, " count:%"PRId64
,
1968 fprintf (file
, " seq:%d", (*bb_seqn
)++);
1969 fprintf (file
, "\n%s PRED:", ASM_COMMENT_START
);
1970 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
1972 dump_edge_info (file
, e
, TDF_DETAILS
, 0);
1974 fprintf (file
, "\n");
1976 if (INSN_UID (insn
) < bb_map_size
1977 && (bb
= end_to_bb
[INSN_UID (insn
)]) != NULL
)
1982 fprintf (asm_out_file
, "%s SUCC:", ASM_COMMENT_START
);
1983 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1985 dump_edge_info (asm_out_file
, e
, TDF_DETAILS
, 1);
1987 fprintf (file
, "\n");
1991 /* Output assembler code for some insns: all or part of a function.
1992 For description of args, see `final_start_function', above. */
1995 final (rtx_insn
*first
, FILE *file
, int optimize_p
)
1997 rtx_insn
*insn
, *next
;
2000 /* Used for -dA dump. */
2001 basic_block
*start_to_bb
= NULL
;
2002 basic_block
*end_to_bb
= NULL
;
2003 int bb_map_size
= 0;
2006 last_ignored_compare
= 0;
2009 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
2011 /* If CC tracking across branches is enabled, record the insn which
2012 jumps to each branch only reached from one place. */
2013 if (optimize_p
&& JUMP_P (insn
))
2015 rtx lab
= JUMP_LABEL (insn
);
2016 if (lab
&& LABEL_P (lab
) && LABEL_NUSES (lab
) == 1)
2018 LABEL_REFS (lab
) = insn
;
2032 bb_map_size
= get_max_uid () + 1;
2033 start_to_bb
= XCNEWVEC (basic_block
, bb_map_size
);
2034 end_to_bb
= XCNEWVEC (basic_block
, bb_map_size
);
2036 /* There is no cfg for a thunk. */
2037 if (!cfun
->is_thunk
)
2038 FOR_EACH_BB_REVERSE_FN (bb
, cfun
)
2040 start_to_bb
[INSN_UID (BB_HEAD (bb
))] = bb
;
2041 end_to_bb
[INSN_UID (BB_END (bb
))] = bb
;
2045 /* Output the insns. */
2046 for (insn
= first
; insn
;)
2048 if (HAVE_ATTR_length
)
2050 if ((unsigned) INSN_UID (insn
) >= INSN_ADDRESSES_SIZE ())
2052 /* This can be triggered by bugs elsewhere in the compiler if
2053 new insns are created after init_insn_lengths is called. */
2054 gcc_assert (NOTE_P (insn
));
2055 insn_current_address
= -1;
2058 insn_current_address
= INSN_ADDRESSES (INSN_UID (insn
));
2061 dump_basic_block_info (file
, insn
, start_to_bb
, end_to_bb
,
2062 bb_map_size
, &bb_seqn
);
2063 insn
= final_scan_insn (insn
, file
, optimize_p
, 0, &seen
);
2072 /* Remove CFI notes, to avoid compare-debug failures. */
2073 for (insn
= first
; insn
; insn
= next
)
2075 next
= NEXT_INSN (insn
);
2077 && (NOTE_KIND (insn
) == NOTE_INSN_CFI
2078 || NOTE_KIND (insn
) == NOTE_INSN_CFI_LABEL
))
2084 get_insn_template (int code
, rtx insn
)
2086 switch (insn_data
[code
].output_format
)
2088 case INSN_OUTPUT_FORMAT_SINGLE
:
2089 return insn_data
[code
].output
.single
;
2090 case INSN_OUTPUT_FORMAT_MULTI
:
2091 return insn_data
[code
].output
.multi
[which_alternative
];
2092 case INSN_OUTPUT_FORMAT_FUNCTION
:
2094 return (*insn_data
[code
].output
.function
) (recog_data
.operand
,
2095 as_a
<rtx_insn
*> (insn
));
2102 /* Emit the appropriate declaration for an alternate-entry-point
2103 symbol represented by INSN, to FILE. INSN is a CODE_LABEL with
2104 LABEL_KIND != LABEL_NORMAL.
2106 The case fall-through in this function is intentional. */
2108 output_alternate_entry_point (FILE *file
, rtx_insn
*insn
)
2110 const char *name
= LABEL_NAME (insn
);
2112 switch (LABEL_KIND (insn
))
2114 case LABEL_WEAK_ENTRY
:
2115 #ifdef ASM_WEAKEN_LABEL
2116 ASM_WEAKEN_LABEL (file
, name
);
2118 case LABEL_GLOBAL_ENTRY
:
2119 targetm
.asm_out
.globalize_label (file
, name
);
2120 case LABEL_STATIC_ENTRY
:
2121 #ifdef ASM_OUTPUT_TYPE_DIRECTIVE
2122 ASM_OUTPUT_TYPE_DIRECTIVE (file
, name
, "function");
2124 ASM_OUTPUT_LABEL (file
, name
);
2133 /* Given a CALL_INSN, find and return the nested CALL. */
2135 call_from_call_insn (rtx_call_insn
*insn
)
2138 gcc_assert (CALL_P (insn
));
2141 while (GET_CODE (x
) != CALL
)
2143 switch (GET_CODE (x
))
2148 x
= COND_EXEC_CODE (x
);
2151 x
= XVECEXP (x
, 0, 0);
2161 /* The final scan for one insn, INSN.
2162 Args are same as in `final', except that INSN
2163 is the insn being scanned.
2164 Value returned is the next insn to be scanned.
2166 NOPEEPHOLES is the flag to disallow peephole processing (currently
2167 used for within delayed branch sequence output).
2169 SEEN is used to track the end of the prologue, for emitting
2170 debug information. We force the emission of a line note after
2171 both NOTE_INSN_PROLOGUE_END and NOTE_INSN_FUNCTION_BEG. */
2174 final_scan_insn (rtx uncast_insn
, FILE *file
, int optimize_p ATTRIBUTE_UNUSED
,
2175 int nopeepholes ATTRIBUTE_UNUSED
, int *seen
)
2182 rtx_insn
*insn
= as_a
<rtx_insn
*> (uncast_insn
);
2186 /* Ignore deleted insns. These can occur when we split insns (due to a
2187 template of "#") while not optimizing. */
2188 if (INSN_DELETED_P (insn
))
2189 return NEXT_INSN (insn
);
2191 switch (GET_CODE (insn
))
2194 switch (NOTE_KIND (insn
))
2196 case NOTE_INSN_DELETED
:
2199 case NOTE_INSN_SWITCH_TEXT_SECTIONS
:
2200 in_cold_section_p
= !in_cold_section_p
;
2202 if (dwarf2out_do_frame ())
2203 dwarf2out_switch_text_section ();
2204 else if (!DECL_IGNORED_P (current_function_decl
))
2205 debug_hooks
->switch_text_section ();
2207 switch_to_section (current_function_section ());
2208 targetm
.asm_out
.function_switched_text_sections (asm_out_file
,
2209 current_function_decl
,
2211 /* Emit a label for the split cold section. Form label name by
2212 suffixing "cold" to the original function's name. */
2213 if (in_cold_section_p
)
2215 tree cold_function_name
2216 = clone_function_name (current_function_decl
, "cold");
2217 ASM_OUTPUT_LABEL (asm_out_file
,
2218 IDENTIFIER_POINTER (cold_function_name
));
2222 case NOTE_INSN_BASIC_BLOCK
:
2223 if (need_profile_function
)
2225 profile_function (asm_out_file
);
2226 need_profile_function
= false;
2229 if (targetm
.asm_out
.unwind_emit
)
2230 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
2232 discriminator
= NOTE_BASIC_BLOCK (insn
)->discriminator
;
2236 case NOTE_INSN_EH_REGION_BEG
:
2237 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LEHB",
2238 NOTE_EH_HANDLER (insn
));
2241 case NOTE_INSN_EH_REGION_END
:
2242 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LEHE",
2243 NOTE_EH_HANDLER (insn
));
2246 case NOTE_INSN_PROLOGUE_END
:
2247 targetm
.asm_out
.function_end_prologue (file
);
2248 profile_after_prologue (file
);
2250 if ((*seen
& (SEEN_EMITTED
| SEEN_NOTE
)) == SEEN_NOTE
)
2252 *seen
|= SEEN_EMITTED
;
2253 force_source_line
= true;
2260 case NOTE_INSN_EPILOGUE_BEG
:
2261 if (!DECL_IGNORED_P (current_function_decl
))
2262 (*debug_hooks
->begin_epilogue
) (last_linenum
, last_filename
);
2263 targetm
.asm_out
.function_begin_epilogue (file
);
2267 dwarf2out_emit_cfi (NOTE_CFI (insn
));
2270 case NOTE_INSN_CFI_LABEL
:
2271 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LCFI",
2272 NOTE_LABEL_NUMBER (insn
));
2275 case NOTE_INSN_FUNCTION_BEG
:
2276 if (need_profile_function
)
2278 profile_function (asm_out_file
);
2279 need_profile_function
= false;
2283 if (!DECL_IGNORED_P (current_function_decl
))
2284 debug_hooks
->end_prologue (last_linenum
, last_filename
);
2286 if ((*seen
& (SEEN_EMITTED
| SEEN_NOTE
)) == SEEN_NOTE
)
2288 *seen
|= SEEN_EMITTED
;
2289 force_source_line
= true;
2296 case NOTE_INSN_BLOCK_BEG
:
2297 if (debug_info_level
== DINFO_LEVEL_NORMAL
2298 || debug_info_level
== DINFO_LEVEL_VERBOSE
2299 || write_symbols
== DWARF2_DEBUG
2300 || write_symbols
== VMS_AND_DWARF2_DEBUG
2301 || write_symbols
== VMS_DEBUG
)
2303 int n
= BLOCK_NUMBER (NOTE_BLOCK (insn
));
2307 high_block_linenum
= last_linenum
;
2309 /* Output debugging info about the symbol-block beginning. */
2310 if (!DECL_IGNORED_P (current_function_decl
))
2311 debug_hooks
->begin_block (last_linenum
, n
);
2313 /* Mark this block as output. */
2314 TREE_ASM_WRITTEN (NOTE_BLOCK (insn
)) = 1;
2316 if (write_symbols
== DBX_DEBUG
2317 || write_symbols
== SDB_DEBUG
)
2319 location_t
*locus_ptr
2320 = block_nonartificial_location (NOTE_BLOCK (insn
));
2322 if (locus_ptr
!= NULL
)
2324 override_filename
= LOCATION_FILE (*locus_ptr
);
2325 override_linenum
= LOCATION_LINE (*locus_ptr
);
2330 case NOTE_INSN_BLOCK_END
:
2331 if (debug_info_level
== DINFO_LEVEL_NORMAL
2332 || debug_info_level
== DINFO_LEVEL_VERBOSE
2333 || write_symbols
== DWARF2_DEBUG
2334 || write_symbols
== VMS_AND_DWARF2_DEBUG
2335 || write_symbols
== VMS_DEBUG
)
2337 int n
= BLOCK_NUMBER (NOTE_BLOCK (insn
));
2341 /* End of a symbol-block. */
2343 gcc_assert (block_depth
>= 0);
2345 if (!DECL_IGNORED_P (current_function_decl
))
2346 debug_hooks
->end_block (high_block_linenum
, n
);
2348 if (write_symbols
== DBX_DEBUG
2349 || write_symbols
== SDB_DEBUG
)
2351 tree outer_block
= BLOCK_SUPERCONTEXT (NOTE_BLOCK (insn
));
2352 location_t
*locus_ptr
2353 = block_nonartificial_location (outer_block
);
2355 if (locus_ptr
!= NULL
)
2357 override_filename
= LOCATION_FILE (*locus_ptr
);
2358 override_linenum
= LOCATION_LINE (*locus_ptr
);
2362 override_filename
= NULL
;
2363 override_linenum
= 0;
2368 case NOTE_INSN_DELETED_LABEL
:
2369 /* Emit the label. We may have deleted the CODE_LABEL because
2370 the label could be proved to be unreachable, though still
2371 referenced (in the form of having its address taken. */
2372 ASM_OUTPUT_DEBUG_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
2375 case NOTE_INSN_DELETED_DEBUG_LABEL
:
2376 /* Similarly, but need to use different namespace for it. */
2377 if (CODE_LABEL_NUMBER (insn
) != -1)
2378 ASM_OUTPUT_DEBUG_LABEL (file
, "LDL", CODE_LABEL_NUMBER (insn
));
2381 case NOTE_INSN_VAR_LOCATION
:
2382 case NOTE_INSN_CALL_ARG_LOCATION
:
2383 if (!DECL_IGNORED_P (current_function_decl
))
2384 debug_hooks
->var_location (insn
);
2397 /* The target port might emit labels in the output function for
2398 some insn, e.g. sh.c output_branchy_insn. */
2399 if (CODE_LABEL_NUMBER (insn
) <= max_labelno
)
2401 int align
= LABEL_TO_ALIGNMENT (insn
);
2402 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2403 int max_skip
= LABEL_TO_MAX_SKIP (insn
);
2406 if (align
&& NEXT_INSN (insn
))
2408 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2409 ASM_OUTPUT_MAX_SKIP_ALIGN (file
, align
, max_skip
);
2411 #ifdef ASM_OUTPUT_ALIGN_WITH_NOP
2412 ASM_OUTPUT_ALIGN_WITH_NOP (file
, align
);
2414 ASM_OUTPUT_ALIGN (file
, align
);
2421 if (!DECL_IGNORED_P (current_function_decl
) && LABEL_NAME (insn
))
2422 debug_hooks
->label (as_a
<rtx_code_label
*> (insn
));
2426 next
= next_nonnote_insn (insn
);
2427 /* If this label is followed by a jump-table, make sure we put
2428 the label in the read-only section. Also possibly write the
2429 label and jump table together. */
2430 if (next
!= 0 && JUMP_TABLE_DATA_P (next
))
2432 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2433 /* In this case, the case vector is being moved by the
2434 target, so don't output the label at all. Leave that
2435 to the back end macros. */
2437 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2441 switch_to_section (targetm
.asm_out
.function_rodata_section
2442 (current_function_decl
));
2444 #ifdef ADDR_VEC_ALIGN
2445 log_align
= ADDR_VEC_ALIGN (next
);
2447 log_align
= exact_log2 (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
);
2449 ASM_OUTPUT_ALIGN (file
, log_align
);
2452 switch_to_section (current_function_section ());
2454 #ifdef ASM_OUTPUT_CASE_LABEL
2455 ASM_OUTPUT_CASE_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
),
2458 targetm
.asm_out
.internal_label (file
, "L", CODE_LABEL_NUMBER (insn
));
2463 if (LABEL_ALT_ENTRY_P (insn
))
2464 output_alternate_entry_point (file
, insn
);
2466 targetm
.asm_out
.internal_label (file
, "L", CODE_LABEL_NUMBER (insn
));
2471 rtx body
= PATTERN (insn
);
2472 int insn_code_number
;
2476 /* Reset this early so it is correct for ASM statements. */
2477 current_insn_predicate
= NULL_RTX
;
2479 /* An INSN, JUMP_INSN or CALL_INSN.
2480 First check for special kinds that recog doesn't recognize. */
2482 if (GET_CODE (body
) == USE
/* These are just declarations. */
2483 || GET_CODE (body
) == CLOBBER
)
2488 /* If there is a REG_CC_SETTER note on this insn, it means that
2489 the setting of the condition code was done in the delay slot
2490 of the insn that branched here. So recover the cc status
2491 from the insn that set it. */
2493 rtx note
= find_reg_note (insn
, REG_CC_SETTER
, NULL_RTX
);
2496 NOTICE_UPDATE_CC (PATTERN (XEXP (note
, 0)), XEXP (note
, 0));
2497 cc_prev_status
= cc_status
;
2502 /* Detect insns that are really jump-tables
2503 and output them as such. */
2505 if (JUMP_TABLE_DATA_P (insn
))
2507 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2511 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2512 switch_to_section (targetm
.asm_out
.function_rodata_section
2513 (current_function_decl
));
2515 switch_to_section (current_function_section ());
2519 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2520 if (GET_CODE (body
) == ADDR_VEC
)
2522 #ifdef ASM_OUTPUT_ADDR_VEC
2523 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn
), body
);
2530 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2531 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn
), body
);
2537 vlen
= XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
);
2538 for (idx
= 0; idx
< vlen
; idx
++)
2540 if (GET_CODE (body
) == ADDR_VEC
)
2542 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2543 ASM_OUTPUT_ADDR_VEC_ELT
2544 (file
, CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 0, idx
), 0)));
2551 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2552 ASM_OUTPUT_ADDR_DIFF_ELT
2555 CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 1, idx
), 0)),
2556 CODE_LABEL_NUMBER (XEXP (XEXP (body
, 0), 0)));
2562 #ifdef ASM_OUTPUT_CASE_END
2563 ASM_OUTPUT_CASE_END (file
,
2564 CODE_LABEL_NUMBER (PREV_INSN (insn
)),
2569 switch_to_section (current_function_section ());
2573 /* Output this line note if it is the first or the last line
2575 if (!DECL_IGNORED_P (current_function_decl
)
2576 && notice_source_line (insn
, &is_stmt
))
2577 (*debug_hooks
->source_line
) (last_linenum
, last_filename
,
2578 last_discriminator
, is_stmt
);
2580 if (GET_CODE (body
) == ASM_INPUT
)
2582 const char *string
= XSTR (body
, 0);
2584 /* There's no telling what that did to the condition codes. */
2589 expanded_location loc
;
2592 loc
= expand_location (ASM_INPUT_SOURCE_LOCATION (body
));
2593 if (*loc
.file
&& loc
.line
)
2594 fprintf (asm_out_file
, "%s %i \"%s\" 1\n",
2595 ASM_COMMENT_START
, loc
.line
, loc
.file
);
2596 fprintf (asm_out_file
, "\t%s\n", string
);
2597 #if HAVE_AS_LINE_ZERO
2598 if (*loc
.file
&& loc
.line
)
2599 fprintf (asm_out_file
, "%s 0 \"\" 2\n", ASM_COMMENT_START
);
2605 /* Detect `asm' construct with operands. */
2606 if (asm_noperands (body
) >= 0)
2608 unsigned int noperands
= asm_noperands (body
);
2609 rtx
*ops
= XALLOCAVEC (rtx
, noperands
);
2612 expanded_location expanded
;
2614 /* There's no telling what that did to the condition codes. */
2617 /* Get out the operand values. */
2618 string
= decode_asm_operands (body
, ops
, NULL
, NULL
, NULL
, &loc
);
2619 /* Inhibit dying on what would otherwise be compiler bugs. */
2620 insn_noperands
= noperands
;
2621 this_is_asm_operands
= insn
;
2622 expanded
= expand_location (loc
);
2624 #ifdef FINAL_PRESCAN_INSN
2625 FINAL_PRESCAN_INSN (insn
, ops
, insn_noperands
);
2628 /* Output the insn using them. */
2632 if (expanded
.file
&& expanded
.line
)
2633 fprintf (asm_out_file
, "%s %i \"%s\" 1\n",
2634 ASM_COMMENT_START
, expanded
.line
, expanded
.file
);
2635 output_asm_insn (string
, ops
);
2636 #if HAVE_AS_LINE_ZERO
2637 if (expanded
.file
&& expanded
.line
)
2638 fprintf (asm_out_file
, "%s 0 \"\" 2\n", ASM_COMMENT_START
);
2642 if (targetm
.asm_out
.final_postscan_insn
)
2643 targetm
.asm_out
.final_postscan_insn (file
, insn
, ops
,
2646 this_is_asm_operands
= 0;
2652 if (rtx_sequence
*seq
= dyn_cast
<rtx_sequence
*> (body
))
2654 /* A delayed-branch sequence */
2657 final_sequence
= seq
;
2659 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2660 force the restoration of a comparison that was previously
2661 thought unnecessary. If that happens, cancel this sequence
2662 and cause that insn to be restored. */
2664 next
= final_scan_insn (seq
->insn (0), file
, 0, 1, seen
);
2665 if (next
!= seq
->insn (1))
2671 for (i
= 1; i
< seq
->len (); i
++)
2673 rtx_insn
*insn
= seq
->insn (i
);
2674 rtx_insn
*next
= NEXT_INSN (insn
);
2675 /* We loop in case any instruction in a delay slot gets
2678 insn
= final_scan_insn (insn
, file
, 0, 1, seen
);
2679 while (insn
!= next
);
2681 #ifdef DBR_OUTPUT_SEQEND
2682 DBR_OUTPUT_SEQEND (file
);
2686 /* If the insn requiring the delay slot was a CALL_INSN, the
2687 insns in the delay slot are actually executed before the
2688 called function. Hence we don't preserve any CC-setting
2689 actions in these insns and the CC must be marked as being
2690 clobbered by the function. */
2691 if (CALL_P (seq
->insn (0)))
2698 /* We have a real machine instruction as rtl. */
2700 body
= PATTERN (insn
);
2703 set
= single_set (insn
);
2705 /* Check for redundant test and compare instructions
2706 (when the condition codes are already set up as desired).
2707 This is done only when optimizing; if not optimizing,
2708 it should be possible for the user to alter a variable
2709 with the debugger in between statements
2710 and the next statement should reexamine the variable
2711 to compute the condition codes. */
2716 && GET_CODE (SET_DEST (set
)) == CC0
2717 && insn
!= last_ignored_compare
)
2720 if (GET_CODE (SET_SRC (set
)) == SUBREG
)
2721 SET_SRC (set
) = alter_subreg (&SET_SRC (set
), true);
2723 src1
= SET_SRC (set
);
2725 if (GET_CODE (SET_SRC (set
)) == COMPARE
)
2727 if (GET_CODE (XEXP (SET_SRC (set
), 0)) == SUBREG
)
2728 XEXP (SET_SRC (set
), 0)
2729 = alter_subreg (&XEXP (SET_SRC (set
), 0), true);
2730 if (GET_CODE (XEXP (SET_SRC (set
), 1)) == SUBREG
)
2731 XEXP (SET_SRC (set
), 1)
2732 = alter_subreg (&XEXP (SET_SRC (set
), 1), true);
2733 if (XEXP (SET_SRC (set
), 1)
2734 == CONST0_RTX (GET_MODE (XEXP (SET_SRC (set
), 0))))
2735 src2
= XEXP (SET_SRC (set
), 0);
2737 if ((cc_status
.value1
!= 0
2738 && rtx_equal_p (src1
, cc_status
.value1
))
2739 || (cc_status
.value2
!= 0
2740 && rtx_equal_p (src1
, cc_status
.value2
))
2741 || (src2
!= 0 && cc_status
.value1
!= 0
2742 && rtx_equal_p (src2
, cc_status
.value1
))
2743 || (src2
!= 0 && cc_status
.value2
!= 0
2744 && rtx_equal_p (src2
, cc_status
.value2
)))
2746 /* Don't delete insn if it has an addressing side-effect. */
2747 if (! FIND_REG_INC_NOTE (insn
, NULL_RTX
)
2748 /* or if anything in it is volatile. */
2749 && ! volatile_refs_p (PATTERN (insn
)))
2751 /* We don't really delete the insn; just ignore it. */
2752 last_ignored_compare
= insn
;
2759 /* If this is a conditional branch, maybe modify it
2760 if the cc's are in a nonstandard state
2761 so that it accomplishes the same thing that it would
2762 do straightforwardly if the cc's were set up normally. */
2764 if (cc_status
.flags
!= 0
2766 && GET_CODE (body
) == SET
2767 && SET_DEST (body
) == pc_rtx
2768 && GET_CODE (SET_SRC (body
)) == IF_THEN_ELSE
2769 && COMPARISON_P (XEXP (SET_SRC (body
), 0))
2770 && XEXP (XEXP (SET_SRC (body
), 0), 0) == cc0_rtx
)
2772 /* This function may alter the contents of its argument
2773 and clear some of the cc_status.flags bits.
2774 It may also return 1 meaning condition now always true
2775 or -1 meaning condition now always false
2776 or 2 meaning condition nontrivial but altered. */
2777 int result
= alter_cond (XEXP (SET_SRC (body
), 0));
2778 /* If condition now has fixed value, replace the IF_THEN_ELSE
2779 with its then-operand or its else-operand. */
2781 SET_SRC (body
) = XEXP (SET_SRC (body
), 1);
2783 SET_SRC (body
) = XEXP (SET_SRC (body
), 2);
2785 /* The jump is now either unconditional or a no-op.
2786 If it has become a no-op, don't try to output it.
2787 (It would not be recognized.) */
2788 if (SET_SRC (body
) == pc_rtx
)
2793 else if (ANY_RETURN_P (SET_SRC (body
)))
2794 /* Replace (set (pc) (return)) with (return). */
2795 PATTERN (insn
) = body
= SET_SRC (body
);
2797 /* Rerecognize the instruction if it has changed. */
2799 INSN_CODE (insn
) = -1;
2802 /* If this is a conditional trap, maybe modify it if the cc's
2803 are in a nonstandard state so that it accomplishes the same
2804 thing that it would do straightforwardly if the cc's were
2806 if (cc_status
.flags
!= 0
2807 && NONJUMP_INSN_P (insn
)
2808 && GET_CODE (body
) == TRAP_IF
2809 && COMPARISON_P (TRAP_CONDITION (body
))
2810 && XEXP (TRAP_CONDITION (body
), 0) == cc0_rtx
)
2812 /* This function may alter the contents of its argument
2813 and clear some of the cc_status.flags bits.
2814 It may also return 1 meaning condition now always true
2815 or -1 meaning condition now always false
2816 or 2 meaning condition nontrivial but altered. */
2817 int result
= alter_cond (TRAP_CONDITION (body
));
2819 /* If TRAP_CONDITION has become always false, delete the
2827 /* If TRAP_CONDITION has become always true, replace
2828 TRAP_CONDITION with const_true_rtx. */
2830 TRAP_CONDITION (body
) = const_true_rtx
;
2832 /* Rerecognize the instruction if it has changed. */
2834 INSN_CODE (insn
) = -1;
2837 /* Make same adjustments to instructions that examine the
2838 condition codes without jumping and instructions that
2839 handle conditional moves (if this machine has either one). */
2841 if (cc_status
.flags
!= 0
2844 rtx cond_rtx
, then_rtx
, else_rtx
;
2847 && GET_CODE (SET_SRC (set
)) == IF_THEN_ELSE
)
2849 cond_rtx
= XEXP (SET_SRC (set
), 0);
2850 then_rtx
= XEXP (SET_SRC (set
), 1);
2851 else_rtx
= XEXP (SET_SRC (set
), 2);
2855 cond_rtx
= SET_SRC (set
);
2856 then_rtx
= const_true_rtx
;
2857 else_rtx
= const0_rtx
;
2860 if (COMPARISON_P (cond_rtx
)
2861 && XEXP (cond_rtx
, 0) == cc0_rtx
)
2864 result
= alter_cond (cond_rtx
);
2866 validate_change (insn
, &SET_SRC (set
), then_rtx
, 0);
2867 else if (result
== -1)
2868 validate_change (insn
, &SET_SRC (set
), else_rtx
, 0);
2869 else if (result
== 2)
2870 INSN_CODE (insn
) = -1;
2871 if (SET_DEST (set
) == SET_SRC (set
))
2878 #ifdef HAVE_peephole
2879 /* Do machine-specific peephole optimizations if desired. */
2881 if (optimize_p
&& !flag_no_peephole
&& !nopeepholes
)
2883 rtx_insn
*next
= peephole (insn
);
2884 /* When peepholing, if there were notes within the peephole,
2885 emit them before the peephole. */
2886 if (next
!= 0 && next
!= NEXT_INSN (insn
))
2888 rtx_insn
*note
, *prev
= PREV_INSN (insn
);
2890 for (note
= NEXT_INSN (insn
); note
!= next
;
2891 note
= NEXT_INSN (note
))
2892 final_scan_insn (note
, file
, optimize_p
, nopeepholes
, seen
);
2894 /* Put the notes in the proper position for a later
2895 rescan. For example, the SH target can do this
2896 when generating a far jump in a delayed branch
2898 note
= NEXT_INSN (insn
);
2899 SET_PREV_INSN (note
) = prev
;
2900 SET_NEXT_INSN (prev
) = note
;
2901 SET_NEXT_INSN (PREV_INSN (next
)) = insn
;
2902 SET_PREV_INSN (insn
) = PREV_INSN (next
);
2903 SET_NEXT_INSN (insn
) = next
;
2904 SET_PREV_INSN (next
) = insn
;
2907 /* PEEPHOLE might have changed this. */
2908 body
= PATTERN (insn
);
2912 /* Try to recognize the instruction.
2913 If successful, verify that the operands satisfy the
2914 constraints for the instruction. Crash if they don't,
2915 since `reload' should have changed them so that they do. */
2917 insn_code_number
= recog_memoized (insn
);
2918 cleanup_subreg_operands (insn
);
2920 /* Dump the insn in the assembly for debugging (-dAP).
2921 If the final dump is requested as slim RTL, dump slim
2922 RTL to the assembly file also. */
2923 if (flag_dump_rtl_in_asm
)
2925 print_rtx_head
= ASM_COMMENT_START
;
2926 if (! (dump_flags
& TDF_SLIM
))
2927 print_rtl_single (asm_out_file
, insn
);
2929 dump_insn_slim (asm_out_file
, insn
);
2930 print_rtx_head
= "";
2933 if (! constrain_operands_cached (1))
2934 fatal_insn_not_found (insn
);
2936 /* Some target machines need to prescan each insn before
2939 #ifdef FINAL_PRESCAN_INSN
2940 FINAL_PRESCAN_INSN (insn
, recog_data
.operand
, recog_data
.n_operands
);
2943 if (targetm
.have_conditional_execution ()
2944 && GET_CODE (PATTERN (insn
)) == COND_EXEC
)
2945 current_insn_predicate
= COND_EXEC_TEST (PATTERN (insn
));
2948 cc_prev_status
= cc_status
;
2950 /* Update `cc_status' for this instruction.
2951 The instruction's output routine may change it further.
2952 If the output routine for a jump insn needs to depend
2953 on the cc status, it should look at cc_prev_status. */
2955 NOTICE_UPDATE_CC (body
, insn
);
2958 current_output_insn
= debug_insn
= insn
;
2960 /* Find the proper template for this insn. */
2961 templ
= get_insn_template (insn_code_number
, insn
);
2963 /* If the C code returns 0, it means that it is a jump insn
2964 which follows a deleted test insn, and that test insn
2965 needs to be reinserted. */
2970 gcc_assert (prev_nonnote_insn (insn
) == last_ignored_compare
);
2972 /* We have already processed the notes between the setter and
2973 the user. Make sure we don't process them again, this is
2974 particularly important if one of the notes is a block
2975 scope note or an EH note. */
2977 prev
!= last_ignored_compare
;
2978 prev
= PREV_INSN (prev
))
2981 delete_insn (prev
); /* Use delete_note. */
2987 /* If the template is the string "#", it means that this insn must
2989 if (templ
[0] == '#' && templ
[1] == '\0')
2991 rtx_insn
*new_rtx
= try_split (body
, insn
, 0);
2993 /* If we didn't split the insn, go away. */
2994 if (new_rtx
== insn
&& PATTERN (new_rtx
) == body
)
2995 fatal_insn ("could not split insn", insn
);
2997 /* If we have a length attribute, this instruction should have
2998 been split in shorten_branches, to ensure that we would have
2999 valid length info for the splitees. */
3000 gcc_assert (!HAVE_ATTR_length
);
3005 /* ??? This will put the directives in the wrong place if
3006 get_insn_template outputs assembly directly. However calling it
3007 before get_insn_template breaks if the insns is split. */
3008 if (targetm
.asm_out
.unwind_emit_before_insn
3009 && targetm
.asm_out
.unwind_emit
)
3010 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
3012 if (rtx_call_insn
*call_insn
= dyn_cast
<rtx_call_insn
*> (insn
))
3014 rtx x
= call_from_call_insn (call_insn
);
3016 if (x
&& MEM_P (x
) && GET_CODE (XEXP (x
, 0)) == SYMBOL_REF
)
3020 t
= SYMBOL_REF_DECL (x
);
3022 assemble_external (t
);
3024 if (!DECL_IGNORED_P (current_function_decl
))
3025 debug_hooks
->var_location (insn
);
3028 /* Output assembler code from the template. */
3029 output_asm_insn (templ
, recog_data
.operand
);
3031 /* Some target machines need to postscan each insn after
3033 if (targetm
.asm_out
.final_postscan_insn
)
3034 targetm
.asm_out
.final_postscan_insn (file
, insn
, recog_data
.operand
,
3035 recog_data
.n_operands
);
3037 if (!targetm
.asm_out
.unwind_emit_before_insn
3038 && targetm
.asm_out
.unwind_emit
)
3039 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
3041 current_output_insn
= debug_insn
= 0;
3044 return NEXT_INSN (insn
);
3047 /* Return whether a source line note needs to be emitted before INSN.
3048 Sets IS_STMT to TRUE if the line should be marked as a possible
3049 breakpoint location. */
3052 notice_source_line (rtx_insn
*insn
, bool *is_stmt
)
3054 const char *filename
;
3057 if (override_filename
)
3059 filename
= override_filename
;
3060 linenum
= override_linenum
;
3062 else if (INSN_HAS_LOCATION (insn
))
3064 expanded_location xloc
= insn_location (insn
);
3065 filename
= xloc
.file
;
3066 linenum
= xloc
.line
;
3074 if (filename
== NULL
)
3077 if (force_source_line
3078 || filename
!= last_filename
3079 || last_linenum
!= linenum
)
3081 force_source_line
= false;
3082 last_filename
= filename
;
3083 last_linenum
= linenum
;
3084 last_discriminator
= discriminator
;
3086 high_block_linenum
= MAX (last_linenum
, high_block_linenum
);
3087 high_function_linenum
= MAX (last_linenum
, high_function_linenum
);
3091 if (SUPPORTS_DISCRIMINATOR
&& last_discriminator
!= discriminator
)
3093 /* If the discriminator changed, but the line number did not,
3094 output the line table entry with is_stmt false so the
3095 debugger does not treat this as a breakpoint location. */
3096 last_discriminator
= discriminator
;
3104 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3105 directly to the desired hard register. */
3108 cleanup_subreg_operands (rtx insn
)
3111 bool changed
= false;
3112 extract_insn_cached (insn
);
3113 for (i
= 0; i
< recog_data
.n_operands
; i
++)
3115 /* The following test cannot use recog_data.operand when testing
3116 for a SUBREG: the underlying object might have been changed
3117 already if we are inside a match_operator expression that
3118 matches the else clause. Instead we test the underlying
3119 expression directly. */
3120 if (GET_CODE (*recog_data
.operand_loc
[i
]) == SUBREG
)
3122 recog_data
.operand
[i
] = alter_subreg (recog_data
.operand_loc
[i
], true);
3125 else if (GET_CODE (recog_data
.operand
[i
]) == PLUS
3126 || GET_CODE (recog_data
.operand
[i
]) == MULT
3127 || MEM_P (recog_data
.operand
[i
]))
3128 recog_data
.operand
[i
] = walk_alter_subreg (recog_data
.operand_loc
[i
], &changed
);
3131 for (i
= 0; i
< recog_data
.n_dups
; i
++)
3133 if (GET_CODE (*recog_data
.dup_loc
[i
]) == SUBREG
)
3135 *recog_data
.dup_loc
[i
] = alter_subreg (recog_data
.dup_loc
[i
], true);
3138 else if (GET_CODE (*recog_data
.dup_loc
[i
]) == PLUS
3139 || GET_CODE (*recog_data
.dup_loc
[i
]) == MULT
3140 || MEM_P (*recog_data
.dup_loc
[i
]))
3141 *recog_data
.dup_loc
[i
] = walk_alter_subreg (recog_data
.dup_loc
[i
], &changed
);
3144 df_insn_rescan (as_a
<rtx_insn
*> (insn
));
3147 /* If X is a SUBREG, try to replace it with a REG or a MEM, based on
3148 the thing it is a subreg of. Do it anyway if FINAL_P. */
3151 alter_subreg (rtx
*xp
, bool final_p
)
3154 rtx y
= SUBREG_REG (x
);
3156 /* simplify_subreg does not remove subreg from volatile references.
3157 We are required to. */
3160 int offset
= SUBREG_BYTE (x
);
3162 /* For paradoxical subregs on big-endian machines, SUBREG_BYTE
3163 contains 0 instead of the proper offset. See simplify_subreg. */
3165 && GET_MODE_SIZE (GET_MODE (y
)) < GET_MODE_SIZE (GET_MODE (x
)))
3167 int difference
= GET_MODE_SIZE (GET_MODE (y
))
3168 - GET_MODE_SIZE (GET_MODE (x
));
3169 if (WORDS_BIG_ENDIAN
)
3170 offset
+= (difference
/ UNITS_PER_WORD
) * UNITS_PER_WORD
;
3171 if (BYTES_BIG_ENDIAN
)
3172 offset
+= difference
% UNITS_PER_WORD
;
3176 *xp
= adjust_address (y
, GET_MODE (x
), offset
);
3178 *xp
= adjust_address_nv (y
, GET_MODE (x
), offset
);
3182 rtx new_rtx
= simplify_subreg (GET_MODE (x
), y
, GET_MODE (y
),
3187 else if (final_p
&& REG_P (y
))
3189 /* Simplify_subreg can't handle some REG cases, but we have to. */
3191 HOST_WIDE_INT offset
;
3193 regno
= subreg_regno (x
);
3194 if (subreg_lowpart_p (x
))
3195 offset
= byte_lowpart_offset (GET_MODE (x
), GET_MODE (y
));
3197 offset
= SUBREG_BYTE (x
);
3198 *xp
= gen_rtx_REG_offset (y
, GET_MODE (x
), regno
, offset
);
3205 /* Do alter_subreg on all the SUBREGs contained in X. */
3208 walk_alter_subreg (rtx
*xp
, bool *changed
)
3211 switch (GET_CODE (x
))
3216 XEXP (x
, 0) = walk_alter_subreg (&XEXP (x
, 0), changed
);
3217 XEXP (x
, 1) = walk_alter_subreg (&XEXP (x
, 1), changed
);
3222 XEXP (x
, 0) = walk_alter_subreg (&XEXP (x
, 0), changed
);
3227 return alter_subreg (xp
, true);
3238 /* Given BODY, the body of a jump instruction, alter the jump condition
3239 as required by the bits that are set in cc_status.flags.
3240 Not all of the bits there can be handled at this level in all cases.
3242 The value is normally 0.
3243 1 means that the condition has become always true.
3244 -1 means that the condition has become always false.
3245 2 means that COND has been altered. */
3248 alter_cond (rtx cond
)
3252 if (cc_status
.flags
& CC_REVERSED
)
3255 PUT_CODE (cond
, swap_condition (GET_CODE (cond
)));
3258 if (cc_status
.flags
& CC_INVERTED
)
3261 PUT_CODE (cond
, reverse_condition (GET_CODE (cond
)));
3264 if (cc_status
.flags
& CC_NOT_POSITIVE
)
3265 switch (GET_CODE (cond
))
3270 /* Jump becomes unconditional. */
3276 /* Jump becomes no-op. */
3280 PUT_CODE (cond
, EQ
);
3285 PUT_CODE (cond
, NE
);
3293 if (cc_status
.flags
& CC_NOT_NEGATIVE
)
3294 switch (GET_CODE (cond
))
3298 /* Jump becomes unconditional. */
3303 /* Jump becomes no-op. */
3308 PUT_CODE (cond
, EQ
);
3314 PUT_CODE (cond
, NE
);
3322 if (cc_status
.flags
& CC_NO_OVERFLOW
)
3323 switch (GET_CODE (cond
))
3326 /* Jump becomes unconditional. */
3330 PUT_CODE (cond
, EQ
);
3335 PUT_CODE (cond
, NE
);
3340 /* Jump becomes no-op. */
3347 if (cc_status
.flags
& (CC_Z_IN_NOT_N
| CC_Z_IN_N
))
3348 switch (GET_CODE (cond
))
3354 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? GE
: LT
);
3359 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? LT
: GE
);
3364 if (cc_status
.flags
& CC_NOT_SIGNED
)
3365 /* The flags are valid if signed condition operators are converted
3367 switch (GET_CODE (cond
))
3370 PUT_CODE (cond
, LEU
);
3375 PUT_CODE (cond
, LTU
);
3380 PUT_CODE (cond
, GTU
);
3385 PUT_CODE (cond
, GEU
);
3397 /* Report inconsistency between the assembler template and the operands.
3398 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3401 output_operand_lossage (const char *cmsgid
, ...)
3405 const char *pfx_str
;
3408 va_start (ap
, cmsgid
);
3410 pfx_str
= this_is_asm_operands
? _("invalid 'asm': ") : "output_operand: ";
3411 asprintf (&fmt_string
, "%s%s", pfx_str
, _(cmsgid
));
3412 vasprintf (&new_message
, fmt_string
, ap
);
3414 if (this_is_asm_operands
)
3415 error_for_asm (this_is_asm_operands
, "%s", new_message
);
3417 internal_error ("%s", new_message
);
3424 /* Output of assembler code from a template, and its subroutines. */
3426 /* Annotate the assembly with a comment describing the pattern and
3427 alternative used. */
3430 output_asm_name (void)
3434 int num
= INSN_CODE (debug_insn
);
3435 fprintf (asm_out_file
, "\t%s %d\t%s",
3436 ASM_COMMENT_START
, INSN_UID (debug_insn
),
3437 insn_data
[num
].name
);
3438 if (insn_data
[num
].n_alternatives
> 1)
3439 fprintf (asm_out_file
, "/%d", which_alternative
+ 1);
3441 if (HAVE_ATTR_length
)
3442 fprintf (asm_out_file
, "\t[length = %d]",
3443 get_attr_length (debug_insn
));
3445 /* Clear this so only the first assembler insn
3446 of any rtl insn will get the special comment for -dp. */
3451 /* If OP is a REG or MEM and we can find a MEM_EXPR corresponding to it
3452 or its address, return that expr . Set *PADDRESSP to 1 if the expr
3453 corresponds to the address of the object and 0 if to the object. */
3456 get_mem_expr_from_op (rtx op
, int *paddressp
)
3464 return REG_EXPR (op
);
3465 else if (!MEM_P (op
))
3468 if (MEM_EXPR (op
) != 0)
3469 return MEM_EXPR (op
);
3471 /* Otherwise we have an address, so indicate it and look at the address. */
3475 /* First check if we have a decl for the address, then look at the right side
3476 if it is a PLUS. Otherwise, strip off arithmetic and keep looking.
3477 But don't allow the address to itself be indirect. */
3478 if ((expr
= get_mem_expr_from_op (op
, &inner_addressp
)) && ! inner_addressp
)
3480 else if (GET_CODE (op
) == PLUS
3481 && (expr
= get_mem_expr_from_op (XEXP (op
, 1), &inner_addressp
)))
3485 || GET_RTX_CLASS (GET_CODE (op
)) == RTX_BIN_ARITH
)
3488 expr
= get_mem_expr_from_op (op
, &inner_addressp
);
3489 return inner_addressp
? 0 : expr
;
3492 /* Output operand names for assembler instructions. OPERANDS is the
3493 operand vector, OPORDER is the order to write the operands, and NOPS
3494 is the number of operands to write. */
3497 output_asm_operand_names (rtx
*operands
, int *oporder
, int nops
)
3502 for (i
= 0; i
< nops
; i
++)
3505 rtx op
= operands
[oporder
[i
]];
3506 tree expr
= get_mem_expr_from_op (op
, &addressp
);
3508 fprintf (asm_out_file
, "%c%s",
3509 wrote
? ',' : '\t', wrote
? "" : ASM_COMMENT_START
);
3513 fprintf (asm_out_file
, "%s",
3514 addressp
? "*" : "");
3515 print_mem_expr (asm_out_file
, expr
);
3518 else if (REG_P (op
) && ORIGINAL_REGNO (op
)
3519 && ORIGINAL_REGNO (op
) != REGNO (op
))
3520 fprintf (asm_out_file
, " tmp%i", ORIGINAL_REGNO (op
));
3524 #ifdef ASSEMBLER_DIALECT
3525 /* Helper function to parse assembler dialects in the asm string.
3526 This is called from output_asm_insn and asm_fprintf. */
3528 do_assembler_dialects (const char *p
, int *dialect
)
3539 output_operand_lossage ("nested assembly dialect alternatives");
3543 /* If we want the first dialect, do nothing. Otherwise, skip
3544 DIALECT_NUMBER of strings ending with '|'. */
3545 for (i
= 0; i
< dialect_number
; i
++)
3547 while (*p
&& *p
!= '}')
3555 /* Skip over any character after a percent sign. */
3567 output_operand_lossage ("unterminated assembly dialect alternative");
3574 /* Skip to close brace. */
3579 output_operand_lossage ("unterminated assembly dialect alternative");
3583 /* Skip over any character after a percent sign. */
3584 if (*p
== '%' && p
[1])
3598 putc (c
, asm_out_file
);
3603 putc (c
, asm_out_file
);
3614 /* Output text from TEMPLATE to the assembler output file,
3615 obeying %-directions to substitute operands taken from
3616 the vector OPERANDS.
3618 %N (for N a digit) means print operand N in usual manner.
3619 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3620 and print the label name with no punctuation.
3621 %cN means require operand N to be a constant
3622 and print the constant expression with no punctuation.
3623 %aN means expect operand N to be a memory address
3624 (not a memory reference!) and print a reference
3626 %nN means expect operand N to be a constant
3627 and print a constant expression for minus the value
3628 of the operand, with no other punctuation. */
3631 output_asm_insn (const char *templ
, rtx
*operands
)
3635 #ifdef ASSEMBLER_DIALECT
3638 int oporder
[MAX_RECOG_OPERANDS
];
3639 char opoutput
[MAX_RECOG_OPERANDS
];
3642 /* An insn may return a null string template
3643 in a case where no assembler code is needed. */
3647 memset (opoutput
, 0, sizeof opoutput
);
3649 putc ('\t', asm_out_file
);
3651 #ifdef ASM_OUTPUT_OPCODE
3652 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3659 if (flag_verbose_asm
)
3660 output_asm_operand_names (operands
, oporder
, ops
);
3661 if (flag_print_asm_name
)
3665 memset (opoutput
, 0, sizeof opoutput
);
3667 putc (c
, asm_out_file
);
3668 #ifdef ASM_OUTPUT_OPCODE
3669 while ((c
= *p
) == '\t')
3671 putc (c
, asm_out_file
);
3674 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3678 #ifdef ASSEMBLER_DIALECT
3682 p
= do_assembler_dialects (p
, &dialect
);
3687 /* %% outputs a single %. %{, %} and %| print {, } and | respectively
3688 if ASSEMBLER_DIALECT defined and these characters have a special
3689 meaning as dialect delimiters.*/
3691 #ifdef ASSEMBLER_DIALECT
3692 || *p
== '{' || *p
== '}' || *p
== '|'
3696 putc (*p
, asm_out_file
);
3699 /* %= outputs a number which is unique to each insn in the entire
3700 compilation. This is useful for making local labels that are
3701 referred to more than once in a given insn. */
3705 fprintf (asm_out_file
, "%d", insn_counter
);
3707 /* % followed by a letter and some digits
3708 outputs an operand in a special way depending on the letter.
3709 Letters `acln' are implemented directly.
3710 Other letters are passed to `output_operand' so that
3711 the TARGET_PRINT_OPERAND hook can define them. */
3712 else if (ISALPHA (*p
))
3715 unsigned long opnum
;
3718 opnum
= strtoul (p
, &endptr
, 10);
3721 output_operand_lossage ("operand number missing "
3723 else if (this_is_asm_operands
&& opnum
>= insn_noperands
)
3724 output_operand_lossage ("operand number out of range");
3725 else if (letter
== 'l')
3726 output_asm_label (operands
[opnum
]);
3727 else if (letter
== 'a')
3728 output_address (operands
[opnum
]);
3729 else if (letter
== 'c')
3731 if (CONSTANT_ADDRESS_P (operands
[opnum
]))
3732 output_addr_const (asm_out_file
, operands
[opnum
]);
3734 output_operand (operands
[opnum
], 'c');
3736 else if (letter
== 'n')
3738 if (CONST_INT_P (operands
[opnum
]))
3739 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
,
3740 - INTVAL (operands
[opnum
]));
3743 putc ('-', asm_out_file
);
3744 output_addr_const (asm_out_file
, operands
[opnum
]);
3748 output_operand (operands
[opnum
], letter
);
3750 if (!opoutput
[opnum
])
3751 oporder
[ops
++] = opnum
;
3752 opoutput
[opnum
] = 1;
3757 /* % followed by a digit outputs an operand the default way. */
3758 else if (ISDIGIT (*p
))
3760 unsigned long opnum
;
3763 opnum
= strtoul (p
, &endptr
, 10);
3764 if (this_is_asm_operands
&& opnum
>= insn_noperands
)
3765 output_operand_lossage ("operand number out of range");
3767 output_operand (operands
[opnum
], 0);
3769 if (!opoutput
[opnum
])
3770 oporder
[ops
++] = opnum
;
3771 opoutput
[opnum
] = 1;
3776 /* % followed by punctuation: output something for that
3777 punctuation character alone, with no operand. The
3778 TARGET_PRINT_OPERAND hook decides what is actually done. */
3779 else if (targetm
.asm_out
.print_operand_punct_valid_p ((unsigned char) *p
))
3780 output_operand (NULL_RTX
, *p
++);
3782 output_operand_lossage ("invalid %%-code");
3786 putc (c
, asm_out_file
);
3789 /* Write out the variable names for operands, if we know them. */
3790 if (flag_verbose_asm
)
3791 output_asm_operand_names (operands
, oporder
, ops
);
3792 if (flag_print_asm_name
)
3795 putc ('\n', asm_out_file
);
3798 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3801 output_asm_label (rtx x
)
3805 if (GET_CODE (x
) == LABEL_REF
)
3809 && NOTE_KIND (x
) == NOTE_INSN_DELETED_LABEL
))
3810 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3812 output_operand_lossage ("'%%l' operand isn't a label");
3814 assemble_name (asm_out_file
, buf
);
3817 /* Marks SYMBOL_REFs in x as referenced through use of assemble_external. */
3820 mark_symbol_refs_as_used (rtx x
)
3822 subrtx_iterator::array_type array
;
3823 FOR_EACH_SUBRTX (iter
, array
, x
, ALL
)
3825 const_rtx x
= *iter
;
3826 if (GET_CODE (x
) == SYMBOL_REF
)
3827 if (tree t
= SYMBOL_REF_DECL (x
))
3828 assemble_external (t
);
3832 /* Print operand X using machine-dependent assembler syntax.
3833 CODE is a non-digit that preceded the operand-number in the % spec,
3834 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3835 between the % and the digits.
3836 When CODE is a non-letter, X is 0.
3838 The meanings of the letters are machine-dependent and controlled
3839 by TARGET_PRINT_OPERAND. */
3842 output_operand (rtx x
, int code ATTRIBUTE_UNUSED
)
3844 if (x
&& GET_CODE (x
) == SUBREG
)
3845 x
= alter_subreg (&x
, true);
3847 /* X must not be a pseudo reg. */
3848 gcc_assert (!x
|| !REG_P (x
) || REGNO (x
) < FIRST_PSEUDO_REGISTER
);
3850 targetm
.asm_out
.print_operand (asm_out_file
, x
, code
);
3855 mark_symbol_refs_as_used (x
);
3858 /* Print a memory reference operand for address X using
3859 machine-dependent assembler syntax. */
3862 output_address (rtx x
)
3864 bool changed
= false;
3865 walk_alter_subreg (&x
, &changed
);
3866 targetm
.asm_out
.print_operand_address (asm_out_file
, x
);
3869 /* Print an integer constant expression in assembler syntax.
3870 Addition and subtraction are the only arithmetic
3871 that may appear in these expressions. */
3874 output_addr_const (FILE *file
, rtx x
)
3879 switch (GET_CODE (x
))
3886 if (SYMBOL_REF_DECL (x
))
3887 assemble_external (SYMBOL_REF_DECL (x
));
3888 #ifdef ASM_OUTPUT_SYMBOL_REF
3889 ASM_OUTPUT_SYMBOL_REF (file
, x
);
3891 assemble_name (file
, XSTR (x
, 0));
3899 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3900 #ifdef ASM_OUTPUT_LABEL_REF
3901 ASM_OUTPUT_LABEL_REF (file
, buf
);
3903 assemble_name (file
, buf
);
3908 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, INTVAL (x
));
3912 /* This used to output parentheses around the expression,
3913 but that does not work on the 386 (either ATT or BSD assembler). */
3914 output_addr_const (file
, XEXP (x
, 0));
3917 case CONST_WIDE_INT
:
3918 /* We do not know the mode here so we have to use a round about
3919 way to build a wide-int to get it printed properly. */
3921 wide_int w
= wide_int::from_array (&CONST_WIDE_INT_ELT (x
, 0),
3922 CONST_WIDE_INT_NUNITS (x
),
3923 CONST_WIDE_INT_NUNITS (x
)
3924 * HOST_BITS_PER_WIDE_INT
,
3926 print_decs (w
, file
);
3931 if (CONST_DOUBLE_AS_INT_P (x
))
3933 /* We can use %d if the number is one word and positive. */
3934 if (CONST_DOUBLE_HIGH (x
))
3935 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
3936 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_HIGH (x
),
3937 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_LOW (x
));
3938 else if (CONST_DOUBLE_LOW (x
) < 0)
3939 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
,
3940 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_LOW (x
));
3942 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_DOUBLE_LOW (x
));
3945 /* We can't handle floating point constants;
3946 PRINT_OPERAND must handle them. */
3947 output_operand_lossage ("floating constant misused");
3951 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_FIXED_VALUE_LOW (x
));
3955 /* Some assemblers need integer constants to appear last (eg masm). */
3956 if (CONST_INT_P (XEXP (x
, 0)))
3958 output_addr_const (file
, XEXP (x
, 1));
3959 if (INTVAL (XEXP (x
, 0)) >= 0)
3960 fprintf (file
, "+");
3961 output_addr_const (file
, XEXP (x
, 0));
3965 output_addr_const (file
, XEXP (x
, 0));
3966 if (!CONST_INT_P (XEXP (x
, 1))
3967 || INTVAL (XEXP (x
, 1)) >= 0)
3968 fprintf (file
, "+");
3969 output_addr_const (file
, XEXP (x
, 1));
3974 /* Avoid outputting things like x-x or x+5-x,
3975 since some assemblers can't handle that. */
3976 x
= simplify_subtraction (x
);
3977 if (GET_CODE (x
) != MINUS
)
3980 output_addr_const (file
, XEXP (x
, 0));
3981 fprintf (file
, "-");
3982 if ((CONST_INT_P (XEXP (x
, 1)) && INTVAL (XEXP (x
, 1)) >= 0)
3983 || GET_CODE (XEXP (x
, 1)) == PC
3984 || GET_CODE (XEXP (x
, 1)) == SYMBOL_REF
)
3985 output_addr_const (file
, XEXP (x
, 1));
3988 fputs (targetm
.asm_out
.open_paren
, file
);
3989 output_addr_const (file
, XEXP (x
, 1));
3990 fputs (targetm
.asm_out
.close_paren
, file
);
3998 output_addr_const (file
, XEXP (x
, 0));
4002 if (targetm
.asm_out
.output_addr_const_extra (file
, x
))
4005 output_operand_lossage ("invalid expression as operand");
4009 /* Output a quoted string. */
4012 output_quoted_string (FILE *asm_file
, const char *string
)
4014 #ifdef OUTPUT_QUOTED_STRING
4015 OUTPUT_QUOTED_STRING (asm_file
, string
);
4019 putc ('\"', asm_file
);
4020 while ((c
= *string
++) != 0)
4024 if (c
== '\"' || c
== '\\')
4025 putc ('\\', asm_file
);
4029 fprintf (asm_file
, "\\%03o", (unsigned char) c
);
4031 putc ('\"', asm_file
);
4035 /* Write a HOST_WIDE_INT number in hex form 0x1234, fast. */
4038 fprint_whex (FILE *f
, unsigned HOST_WIDE_INT value
)
4040 char buf
[2 + CHAR_BIT
* sizeof (value
) / 4];
4045 char *p
= buf
+ sizeof (buf
);
4047 *--p
= "0123456789abcdef"[value
% 16];
4048 while ((value
/= 16) != 0);
4051 fwrite (p
, 1, buf
+ sizeof (buf
) - p
, f
);
4055 /* Internal function that prints an unsigned long in decimal in reverse.
4056 The output string IS NOT null-terminated. */
4059 sprint_ul_rev (char *s
, unsigned long value
)
4064 s
[i
] = "0123456789"[value
% 10];
4067 /* alternate version, without modulo */
4068 /* oldval = value; */
4070 /* s[i] = "0123456789" [oldval - 10*value]; */
4077 /* Write an unsigned long as decimal to a file, fast. */
4080 fprint_ul (FILE *f
, unsigned long value
)
4082 /* python says: len(str(2**64)) == 20 */
4086 i
= sprint_ul_rev (s
, value
);
4088 /* It's probably too small to bother with string reversal and fputs. */
4097 /* Write an unsigned long as decimal to a string, fast.
4098 s must be wide enough to not overflow, at least 21 chars.
4099 Returns the length of the string (without terminating '\0'). */
4102 sprint_ul (char *s
, unsigned long value
)
4109 len
= sprint_ul_rev (s
, value
);
4112 /* Reverse the string. */
4126 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
4127 %R prints the value of REGISTER_PREFIX.
4128 %L prints the value of LOCAL_LABEL_PREFIX.
4129 %U prints the value of USER_LABEL_PREFIX.
4130 %I prints the value of IMMEDIATE_PREFIX.
4131 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
4132 Also supported are %d, %i, %u, %x, %X, %o, %c, %s and %%.
4134 We handle alternate assembler dialects here, just like output_asm_insn. */
4137 asm_fprintf (FILE *file
, const char *p
, ...)
4141 #ifdef ASSEMBLER_DIALECT
4146 va_start (argptr
, p
);
4153 #ifdef ASSEMBLER_DIALECT
4157 p
= do_assembler_dialects (p
, &dialect
);
4164 while (strchr ("-+ #0", c
))
4169 while (ISDIGIT (c
) || c
== '.')
4180 case 'd': case 'i': case 'u':
4181 case 'x': case 'X': case 'o':
4185 fprintf (file
, buf
, va_arg (argptr
, int));
4189 /* This is a prefix to the 'd', 'i', 'u', 'x', 'X', and
4190 'o' cases, but we do not check for those cases. It
4191 means that the value is a HOST_WIDE_INT, which may be
4192 either `long' or `long long'. */
4193 memcpy (q
, HOST_WIDE_INT_PRINT
, strlen (HOST_WIDE_INT_PRINT
));
4194 q
+= strlen (HOST_WIDE_INT_PRINT
);
4197 fprintf (file
, buf
, va_arg (argptr
, HOST_WIDE_INT
));
4202 #ifdef HAVE_LONG_LONG
4208 fprintf (file
, buf
, va_arg (argptr
, long long));
4215 fprintf (file
, buf
, va_arg (argptr
, long));
4223 fprintf (file
, buf
, va_arg (argptr
, char *));
4227 #ifdef ASM_OUTPUT_OPCODE
4228 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
4233 #ifdef REGISTER_PREFIX
4234 fprintf (file
, "%s", REGISTER_PREFIX
);
4239 #ifdef IMMEDIATE_PREFIX
4240 fprintf (file
, "%s", IMMEDIATE_PREFIX
);
4245 #ifdef LOCAL_LABEL_PREFIX
4246 fprintf (file
, "%s", LOCAL_LABEL_PREFIX
);
4251 fputs (user_label_prefix
, file
);
4254 #ifdef ASM_FPRINTF_EXTENSIONS
4255 /* Uppercase letters are reserved for general use by asm_fprintf
4256 and so are not available to target specific code. In order to
4257 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
4258 they are defined here. As they get turned into real extensions
4259 to asm_fprintf they should be removed from this list. */
4260 case 'A': case 'B': case 'C': case 'D': case 'E':
4261 case 'F': case 'G': case 'H': case 'J': case 'K':
4262 case 'M': case 'N': case 'P': case 'Q': case 'S':
4263 case 'T': case 'V': case 'W': case 'Y': case 'Z':
4266 ASM_FPRINTF_EXTENSIONS (file
, argptr
, p
)
4279 /* Return nonzero if this function has no function calls. */
4282 leaf_function_p (void)
4286 /* Some back-ends (e.g. s390) want leaf functions to stay leaf
4287 functions even if they call mcount. */
4288 if (crtl
->profile
&& !targetm
.keep_leaf_when_profiled ())
4291 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4294 && ! SIBLING_CALL_P (insn
))
4296 if (NONJUMP_INSN_P (insn
)
4297 && GET_CODE (PATTERN (insn
)) == SEQUENCE
4298 && CALL_P (XVECEXP (PATTERN (insn
), 0, 0))
4299 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn
), 0, 0)))
4306 /* Return 1 if branch is a forward branch.
4307 Uses insn_shuid array, so it works only in the final pass. May be used by
4308 output templates to customary add branch prediction hints.
4311 final_forward_branch_p (rtx_insn
*insn
)
4313 int insn_id
, label_id
;
4315 gcc_assert (uid_shuid
);
4316 insn_id
= INSN_SHUID (insn
);
4317 label_id
= INSN_SHUID (JUMP_LABEL (insn
));
4318 /* We've hit some insns that does not have id information available. */
4319 gcc_assert (insn_id
&& label_id
);
4320 return insn_id
< label_id
;
4323 /* On some machines, a function with no call insns
4324 can run faster if it doesn't create its own register window.
4325 When output, the leaf function should use only the "output"
4326 registers. Ordinarily, the function would be compiled to use
4327 the "input" registers to find its arguments; it is a candidate
4328 for leaf treatment if it uses only the "input" registers.
4329 Leaf function treatment means renumbering so the function
4330 uses the "output" registers instead. */
4332 #ifdef LEAF_REGISTERS
4334 /* Return 1 if this function uses only the registers that can be
4335 safely renumbered. */
4338 only_leaf_regs_used (void)
4341 const char *const permitted_reg_in_leaf_functions
= LEAF_REGISTERS
;
4343 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4344 if ((df_regs_ever_live_p (i
) || global_regs
[i
])
4345 && ! permitted_reg_in_leaf_functions
[i
])
4348 if (crtl
->uses_pic_offset_table
4349 && pic_offset_table_rtx
!= 0
4350 && REG_P (pic_offset_table_rtx
)
4351 && ! permitted_reg_in_leaf_functions
[REGNO (pic_offset_table_rtx
)])
4357 /* Scan all instructions and renumber all registers into those
4358 available in leaf functions. */
4361 leaf_renumber_regs (rtx_insn
*first
)
4365 /* Renumber only the actual patterns.
4366 The reg-notes can contain frame pointer refs,
4367 and renumbering them could crash, and should not be needed. */
4368 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
4370 leaf_renumber_regs_insn (PATTERN (insn
));
4373 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4374 available in leaf functions. */
4377 leaf_renumber_regs_insn (rtx in_rtx
)
4380 const char *format_ptr
;
4385 /* Renumber all input-registers into output-registers.
4386 renumbered_regs would be 1 for an output-register;
4393 /* Don't renumber the same reg twice. */
4397 newreg
= REGNO (in_rtx
);
4398 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4399 to reach here as part of a REG_NOTE. */
4400 if (newreg
>= FIRST_PSEUDO_REGISTER
)
4405 newreg
= LEAF_REG_REMAP (newreg
);
4406 gcc_assert (newreg
>= 0);
4407 df_set_regs_ever_live (REGNO (in_rtx
), false);
4408 df_set_regs_ever_live (newreg
, true);
4409 SET_REGNO (in_rtx
, newreg
);
4413 if (INSN_P (in_rtx
))
4415 /* Inside a SEQUENCE, we find insns.
4416 Renumber just the patterns of these insns,
4417 just as we do for the top-level insns. */
4418 leaf_renumber_regs_insn (PATTERN (in_rtx
));
4422 format_ptr
= GET_RTX_FORMAT (GET_CODE (in_rtx
));
4424 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (in_rtx
)); i
++)
4425 switch (*format_ptr
++)
4428 leaf_renumber_regs_insn (XEXP (in_rtx
, i
));
4432 if (NULL
!= XVEC (in_rtx
, i
))
4434 for (j
= 0; j
< XVECLEN (in_rtx
, i
); j
++)
4435 leaf_renumber_regs_insn (XVECEXP (in_rtx
, i
, j
));
4454 /* Turn the RTL into assembly. */
4456 rest_of_handle_final (void)
4461 /* Get the function's name, as described by its RTL. This may be
4462 different from the DECL_NAME name used in the source file. */
4464 x
= DECL_RTL (current_function_decl
);
4465 gcc_assert (MEM_P (x
));
4467 gcc_assert (GET_CODE (x
) == SYMBOL_REF
);
4468 fnname
= XSTR (x
, 0);
4470 assemble_start_function (current_function_decl
, fnname
);
4471 final_start_function (get_insns (), asm_out_file
, optimize
);
4472 final (get_insns (), asm_out_file
, optimize
);
4473 if (flag_use_caller_save
)
4474 collect_fn_hard_reg_usage ();
4475 final_end_function ();
4477 /* The IA-64 ".handlerdata" directive must be issued before the ".endp"
4478 directive that closes the procedure descriptor. Similarly, for x64 SEH.
4479 Otherwise it's not strictly necessary, but it doesn't hurt either. */
4480 output_function_exception_table (fnname
);
4482 assemble_end_function (current_function_decl
, fnname
);
4484 user_defined_section_attribute
= false;
4486 /* Free up reg info memory. */
4490 fflush (asm_out_file
);
4492 /* Write DBX symbols if requested. */
4494 /* Note that for those inline functions where we don't initially
4495 know for certain that we will be generating an out-of-line copy,
4496 the first invocation of this routine (rest_of_compilation) will
4497 skip over this code by doing a `goto exit_rest_of_compilation;'.
4498 Later on, wrapup_global_declarations will (indirectly) call
4499 rest_of_compilation again for those inline functions that need
4500 to have out-of-line copies generated. During that call, we
4501 *will* be routed past here. */
4503 timevar_push (TV_SYMOUT
);
4504 if (!DECL_IGNORED_P (current_function_decl
))
4505 debug_hooks
->function_decl (current_function_decl
);
4506 timevar_pop (TV_SYMOUT
);
4508 /* Release the blocks that are linked to DECL_INITIAL() to free the memory. */
4509 DECL_INITIAL (current_function_decl
) = error_mark_node
;
4511 if (DECL_STATIC_CONSTRUCTOR (current_function_decl
)
4512 && targetm
.have_ctors_dtors
)
4513 targetm
.asm_out
.constructor (XEXP (DECL_RTL (current_function_decl
), 0),
4514 decl_init_priority_lookup
4515 (current_function_decl
));
4516 if (DECL_STATIC_DESTRUCTOR (current_function_decl
)
4517 && targetm
.have_ctors_dtors
)
4518 targetm
.asm_out
.destructor (XEXP (DECL_RTL (current_function_decl
), 0),
4519 decl_fini_priority_lookup
4520 (current_function_decl
));
4526 const pass_data pass_data_final
=
4528 RTL_PASS
, /* type */
4530 OPTGROUP_NONE
, /* optinfo_flags */
4531 TV_FINAL
, /* tv_id */
4532 0, /* properties_required */
4533 0, /* properties_provided */
4534 0, /* properties_destroyed */
4535 0, /* todo_flags_start */
4536 0, /* todo_flags_finish */
4539 class pass_final
: public rtl_opt_pass
4542 pass_final (gcc::context
*ctxt
)
4543 : rtl_opt_pass (pass_data_final
, ctxt
)
4546 /* opt_pass methods: */
4547 virtual unsigned int execute (function
*) { return rest_of_handle_final (); }
4549 }; // class pass_final
4554 make_pass_final (gcc::context
*ctxt
)
4556 return new pass_final (ctxt
);
4561 rest_of_handle_shorten_branches (void)
4563 /* Shorten branches. */
4564 shorten_branches (get_insns ());
4570 const pass_data pass_data_shorten_branches
=
4572 RTL_PASS
, /* type */
4573 "shorten", /* name */
4574 OPTGROUP_NONE
, /* optinfo_flags */
4575 TV_SHORTEN_BRANCH
, /* tv_id */
4576 0, /* properties_required */
4577 0, /* properties_provided */
4578 0, /* properties_destroyed */
4579 0, /* todo_flags_start */
4580 0, /* todo_flags_finish */
4583 class pass_shorten_branches
: public rtl_opt_pass
4586 pass_shorten_branches (gcc::context
*ctxt
)
4587 : rtl_opt_pass (pass_data_shorten_branches
, ctxt
)
4590 /* opt_pass methods: */
4591 virtual unsigned int execute (function
*)
4593 return rest_of_handle_shorten_branches ();
4596 }; // class pass_shorten_branches
4601 make_pass_shorten_branches (gcc::context
*ctxt
)
4603 return new pass_shorten_branches (ctxt
);
4608 rest_of_clean_state (void)
4610 rtx_insn
*insn
, *next
;
4611 FILE *final_output
= NULL
;
4612 int save_unnumbered
= flag_dump_unnumbered
;
4613 int save_noaddr
= flag_dump_noaddr
;
4615 if (flag_dump_final_insns
)
4617 final_output
= fopen (flag_dump_final_insns
, "a");
4620 error ("could not open final insn dump file %qs: %m",
4621 flag_dump_final_insns
);
4622 flag_dump_final_insns
= NULL
;
4626 flag_dump_noaddr
= flag_dump_unnumbered
= 1;
4627 if (flag_compare_debug_opt
|| flag_compare_debug
)
4628 dump_flags
|= TDF_NOUID
;
4629 dump_function_header (final_output
, current_function_decl
,
4631 final_insns_dump_p
= true;
4633 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4635 INSN_UID (insn
) = CODE_LABEL_NUMBER (insn
);
4639 set_block_for_insn (insn
, NULL
);
4640 INSN_UID (insn
) = 0;
4645 /* It is very important to decompose the RTL instruction chain here:
4646 debug information keeps pointing into CODE_LABEL insns inside the function
4647 body. If these remain pointing to the other insns, we end up preserving
4648 whole RTL chain and attached detailed debug info in memory. */
4649 for (insn
= get_insns (); insn
; insn
= next
)
4651 next
= NEXT_INSN (insn
);
4652 SET_NEXT_INSN (insn
) = NULL
;
4653 SET_PREV_INSN (insn
) = NULL
;
4656 && (!NOTE_P (insn
) ||
4657 (NOTE_KIND (insn
) != NOTE_INSN_VAR_LOCATION
4658 && NOTE_KIND (insn
) != NOTE_INSN_CALL_ARG_LOCATION
4659 && NOTE_KIND (insn
) != NOTE_INSN_BLOCK_BEG
4660 && NOTE_KIND (insn
) != NOTE_INSN_BLOCK_END
4661 && NOTE_KIND (insn
) != NOTE_INSN_DELETED_DEBUG_LABEL
)))
4662 print_rtl_single (final_output
, insn
);
4667 flag_dump_noaddr
= save_noaddr
;
4668 flag_dump_unnumbered
= save_unnumbered
;
4669 final_insns_dump_p
= false;
4671 if (fclose (final_output
))
4673 error ("could not close final insn dump file %qs: %m",
4674 flag_dump_final_insns
);
4675 flag_dump_final_insns
= NULL
;
4679 /* In case the function was not output,
4680 don't leave any temporary anonymous types
4681 queued up for sdb output. */
4682 #ifdef SDB_DEBUGGING_INFO
4683 if (write_symbols
== SDB_DEBUG
)
4684 sdbout_types (NULL_TREE
);
4687 flag_rerun_cse_after_global_opts
= 0;
4688 reload_completed
= 0;
4689 epilogue_completed
= 0;
4691 regstack_completed
= 0;
4694 /* Clear out the insn_length contents now that they are no
4696 init_insn_lengths ();
4698 /* Show no temporary slots allocated. */
4701 free_bb_for_insn ();
4705 /* We can reduce stack alignment on call site only when we are sure that
4706 the function body just produced will be actually used in the final
4708 if (decl_binds_to_current_def_p (current_function_decl
))
4710 unsigned int pref
= crtl
->preferred_stack_boundary
;
4711 if (crtl
->stack_alignment_needed
> crtl
->preferred_stack_boundary
)
4712 pref
= crtl
->stack_alignment_needed
;
4713 cgraph_node::rtl_info (current_function_decl
)
4714 ->preferred_incoming_stack_boundary
= pref
;
4717 /* Make sure volatile mem refs aren't considered valid operands for
4718 arithmetic insns. We must call this here if this is a nested inline
4719 function, since the above code leaves us in the init_recog state,
4720 and the function context push/pop code does not save/restore volatile_ok.
4722 ??? Maybe it isn't necessary for expand_start_function to call this
4723 anymore if we do it here? */
4725 init_recog_no_volatile ();
4727 /* We're done with this function. Free up memory if we can. */
4728 free_after_parsing (cfun
);
4729 free_after_compilation (cfun
);
4735 const pass_data pass_data_clean_state
=
4737 RTL_PASS
, /* type */
4738 "*clean_state", /* name */
4739 OPTGROUP_NONE
, /* optinfo_flags */
4740 TV_FINAL
, /* tv_id */
4741 0, /* properties_required */
4742 0, /* properties_provided */
4743 PROP_rtl
, /* properties_destroyed */
4744 0, /* todo_flags_start */
4745 0, /* todo_flags_finish */
4748 class pass_clean_state
: public rtl_opt_pass
4751 pass_clean_state (gcc::context
*ctxt
)
4752 : rtl_opt_pass (pass_data_clean_state
, ctxt
)
4755 /* opt_pass methods: */
4756 virtual unsigned int execute (function
*)
4758 return rest_of_clean_state ();
4761 }; // class pass_clean_state
4766 make_pass_clean_state (gcc::context
*ctxt
)
4768 return new pass_clean_state (ctxt
);
4771 /* Return true if INSN is a call to the the current function. */
4774 self_recursive_call_p (rtx_insn
*insn
)
4776 tree fndecl
= get_call_fndecl (insn
);
4777 return (fndecl
== current_function_decl
4778 && decl_binds_to_current_def_p (fndecl
));
4781 /* Collect hard register usage for the current function. */
4784 collect_fn_hard_reg_usage (void)
4790 struct cgraph_rtl_info
*node
;
4791 HARD_REG_SET function_used_regs
;
4793 /* ??? To be removed when all the ports have been fixed. */
4794 if (!targetm
.call_fusage_contains_non_callee_clobbers
)
4797 CLEAR_HARD_REG_SET (function_used_regs
);
4799 for (insn
= get_insns (); insn
!= NULL_RTX
; insn
= next_insn (insn
))
4801 HARD_REG_SET insn_used_regs
;
4803 if (!NONDEBUG_INSN_P (insn
))
4807 && !self_recursive_call_p (insn
))
4809 if (!get_call_reg_set_usage (insn
, &insn_used_regs
,
4813 IOR_HARD_REG_SET (function_used_regs
, insn_used_regs
);
4816 find_all_hard_reg_sets (insn
, &insn_used_regs
, false);
4817 IOR_HARD_REG_SET (function_used_regs
, insn_used_regs
);
4820 /* Be conservative - mark fixed and global registers as used. */
4821 IOR_HARD_REG_SET (function_used_regs
, fixed_reg_set
);
4824 /* Handle STACK_REGS conservatively, since the df-framework does not
4825 provide accurate information for them. */
4827 for (i
= FIRST_STACK_REG
; i
<= LAST_STACK_REG
; i
++)
4828 SET_HARD_REG_BIT (function_used_regs
, i
);
4831 /* The information we have gathered is only interesting if it exposes a
4832 register from the call_used_regs that is not used in this function. */
4833 if (hard_reg_set_subset_p (call_used_reg_set
, function_used_regs
))
4836 node
= cgraph_node::rtl_info (current_function_decl
);
4837 gcc_assert (node
!= NULL
);
4839 COPY_HARD_REG_SET (node
->function_used_regs
, function_used_regs
);
4840 node
->function_used_regs_valid
= 1;
4843 /* Get the declaration of the function called by INSN. */
4846 get_call_fndecl (rtx_insn
*insn
)
4850 note
= find_reg_note (insn
, REG_CALL_DECL
, NULL_RTX
);
4851 if (note
== NULL_RTX
)
4854 datum
= XEXP (note
, 0);
4855 if (datum
!= NULL_RTX
)
4856 return SYMBOL_REF_DECL (datum
);
4861 /* Return the cgraph_rtl_info of the function called by INSN. Returns NULL for
4862 call targets that can be overwritten. */
4864 static struct cgraph_rtl_info
*
4865 get_call_cgraph_rtl_info (rtx_insn
*insn
)
4869 if (insn
== NULL_RTX
)
4872 fndecl
= get_call_fndecl (insn
);
4873 if (fndecl
== NULL_TREE
4874 || !decl_binds_to_current_def_p (fndecl
))
4877 return cgraph_node::rtl_info (fndecl
);
4880 /* Find hard registers used by function call instruction INSN, and return them
4881 in REG_SET. Return DEFAULT_SET in REG_SET if not found. */
4884 get_call_reg_set_usage (rtx uncast_insn
, HARD_REG_SET
*reg_set
,
4885 HARD_REG_SET default_set
)
4887 rtx_insn
*insn
= safe_as_a
<rtx_insn
*> (uncast_insn
);
4888 if (flag_use_caller_save
)
4890 struct cgraph_rtl_info
*node
= get_call_cgraph_rtl_info (insn
);
4892 && node
->function_used_regs_valid
)
4894 COPY_HARD_REG_SET (*reg_set
, node
->function_used_regs
);
4895 AND_HARD_REG_SET (*reg_set
, default_set
);
4900 COPY_HARD_REG_SET (*reg_set
, default_set
);