1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009,
5 Free Software Foundation, Inc.
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify it under
10 the terms of the GNU General Public License as published by the Free
11 Software Foundation; either version 3, or (at your option) any later
14 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
15 WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
23 /* This is the final pass of the compiler.
24 It looks at the rtl code for a function and outputs assembler code.
26 Call `final_start_function' to output the assembler code for function entry,
27 `final' to output assembler code for some RTL code,
28 `final_end_function' to output assembler code for function exit.
29 If a function is compiled in several pieces, each piece is
30 output separately with `final'.
32 Some optimizations are also done at this level.
33 Move instructions that were made unnecessary by good register allocation
34 are detected and omitted from the output. (Though most of these
35 are removed by the last jump pass.)
37 Instructions to set the condition codes are omitted when it can be
38 seen that the condition codes already had the desired values.
40 In some cases it is sufficient if the inherited condition codes
41 have related values, but this may require the following insn
42 (the one that tests the condition codes) to be modified.
44 The code for the function prologue and epilogue are generated
45 directly in assembler by the target functions function_prologue and
46 function_epilogue. Those instructions never exist as rtl. */
50 #include "coretypes.h"
57 #include "insn-config.h"
58 #include "insn-attr.h"
60 #include "conditions.h"
62 #include "hard-reg-set.h"
66 #include "rtl-error.h"
67 #include "toplev.h" /* exact_log2, floor_log2 */
70 #include "basic-block.h"
72 #include "targhooks.h"
75 #include "tree-pass.h"
76 #include "tree-flow.h"
84 #include "tree-pretty-print.h" /* for dump_function_header */
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. */
119 #define SEEN_EMITTED 4
121 /* Last insn processed by final_scan_insn. */
122 static rtx debug_insn
;
123 rtx current_output_insn
;
125 /* Line number of last NOTE. */
126 static int last_linenum
;
128 /* Last discriminator written to assembly. */
129 static int last_discriminator
;
131 /* Discriminator of current block. */
132 static int discriminator
;
134 /* Highest line number in current block. */
135 static int high_block_linenum
;
137 /* Likewise for function. */
138 static int high_function_linenum
;
140 /* Filename of last NOTE. */
141 static const char *last_filename
;
143 /* Override filename and line number. */
144 static const char *override_filename
;
145 static int override_linenum
;
147 /* Whether to force emission of a line note before the next insn. */
148 static bool force_source_line
= false;
150 extern const int length_unit_log
; /* This is defined in insn-attrtab.c. */
152 /* Nonzero while outputting an `asm' with operands.
153 This means that inconsistencies are the user's fault, so don't die.
154 The precise value is the insn being output, to pass to error_for_asm. */
155 rtx this_is_asm_operands
;
157 /* Number of operands of this insn, for an `asm' with operands. */
158 static unsigned int insn_noperands
;
160 /* Compare optimization flag. */
162 static rtx last_ignored_compare
= 0;
164 /* Assign a unique number to each insn that is output.
165 This can be used to generate unique local labels. */
167 static int insn_counter
= 0;
170 /* This variable contains machine-dependent flags (defined in tm.h)
171 set and examined by output routines
172 that describe how to interpret the condition codes properly. */
176 /* During output of an insn, this contains a copy of cc_status
177 from before the insn. */
179 CC_STATUS cc_prev_status
;
182 /* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen. */
184 static int block_depth
;
186 /* Nonzero if have enabled APP processing of our assembler output. */
190 /* If we are outputting an insn sequence, this contains the sequence rtx.
195 #ifdef ASSEMBLER_DIALECT
197 /* Number of the assembler dialect to use, starting at 0. */
198 static int dialect_number
;
201 /* Nonnull if the insn currently being emitted was a COND_EXEC pattern. */
202 rtx current_insn_predicate
;
204 /* True if printing into -fdump-final-insns= dump. */
205 bool final_insns_dump_p
;
207 static int asm_insn_count (rtx
);
208 static void profile_function (FILE *);
209 static void profile_after_prologue (FILE *);
210 static bool notice_source_line (rtx
, bool *);
211 static rtx
walk_alter_subreg (rtx
*, bool *);
212 static void output_asm_name (void);
213 static void output_alternate_entry_point (FILE *, rtx
);
214 static tree
get_mem_expr_from_op (rtx
, int *);
215 static void output_asm_operand_names (rtx
*, int *, int);
216 #ifdef LEAF_REGISTERS
217 static void leaf_renumber_regs (rtx
);
220 static int alter_cond (rtx
);
222 #ifndef ADDR_VEC_ALIGN
223 static int final_addr_vec_align (rtx
);
225 static int align_fuzz (rtx
, rtx
, int, unsigned);
227 /* Initialize data in final at the beginning of a compilation. */
230 init_final (const char *filename ATTRIBUTE_UNUSED
)
235 #ifdef ASSEMBLER_DIALECT
236 dialect_number
= ASSEMBLER_DIALECT
;
240 /* Default target function prologue and epilogue assembler output.
242 If not overridden for epilogue code, then the function body itself
243 contains return instructions wherever needed. */
245 default_function_pro_epilogue (FILE *file ATTRIBUTE_UNUSED
,
246 HOST_WIDE_INT size ATTRIBUTE_UNUSED
)
251 default_function_switched_text_sections (FILE *file ATTRIBUTE_UNUSED
,
252 tree decl ATTRIBUTE_UNUSED
,
253 bool new_is_cold ATTRIBUTE_UNUSED
)
257 /* Default target hook that outputs nothing to a stream. */
259 no_asm_to_stream (FILE *file ATTRIBUTE_UNUSED
)
263 /* Enable APP processing of subsequent output.
264 Used before the output from an `asm' statement. */
271 fputs (ASM_APP_ON
, asm_out_file
);
276 /* Disable APP processing of subsequent output.
277 Called from varasm.c before most kinds of output. */
284 fputs (ASM_APP_OFF
, asm_out_file
);
289 /* Return the number of slots filled in the current
290 delayed branch sequence (we don't count the insn needing the
291 delay slot). Zero if not in a delayed branch sequence. */
295 dbr_sequence_length (void)
297 if (final_sequence
!= 0)
298 return XVECLEN (final_sequence
, 0) - 1;
304 /* The next two pages contain routines used to compute the length of an insn
305 and to shorten branches. */
307 /* Arrays for insn lengths, and addresses. The latter is referenced by
308 `insn_current_length'. */
310 static int *insn_lengths
;
312 VEC(int,heap
) *insn_addresses_
;
314 /* Max uid for which the above arrays are valid. */
315 static int insn_lengths_max_uid
;
317 /* Address of insn being processed. Used by `insn_current_length'. */
318 int insn_current_address
;
320 /* Address of insn being processed in previous iteration. */
321 int insn_last_address
;
323 /* known invariant alignment of insn being processed. */
324 int insn_current_align
;
326 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
327 gives the next following alignment insn that increases the known
328 alignment, or NULL_RTX if there is no such insn.
329 For any alignment obtained this way, we can again index uid_align with
330 its uid to obtain the next following align that in turn increases the
331 alignment, till we reach NULL_RTX; the sequence obtained this way
332 for each insn we'll call the alignment chain of this insn in the following
335 struct label_alignment
341 static rtx
*uid_align
;
342 static int *uid_shuid
;
343 static struct label_alignment
*label_align
;
345 /* Indicate that branch shortening hasn't yet been done. */
348 init_insn_lengths (void)
359 insn_lengths_max_uid
= 0;
361 if (HAVE_ATTR_length
)
362 INSN_ADDRESSES_FREE ();
370 /* Obtain the current length of an insn. If branch shortening has been done,
371 get its actual length. Otherwise, use FALLBACK_FN to calculate the
374 get_attr_length_1 (rtx insn
, int (*fallback_fn
) (rtx
))
380 if (!HAVE_ATTR_length
)
383 if (insn_lengths_max_uid
> INSN_UID (insn
))
384 return insn_lengths
[INSN_UID (insn
)];
386 switch (GET_CODE (insn
))
395 length
= fallback_fn (insn
);
399 body
= PATTERN (insn
);
400 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
402 /* Alignment is machine-dependent and should be handled by
406 length
= fallback_fn (insn
);
410 body
= PATTERN (insn
);
411 if (GET_CODE (body
) == USE
|| GET_CODE (body
) == CLOBBER
)
414 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
415 length
= asm_insn_count (body
) * fallback_fn (insn
);
416 else if (GET_CODE (body
) == SEQUENCE
)
417 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
418 length
+= get_attr_length_1 (XVECEXP (body
, 0, i
), fallback_fn
);
420 length
= fallback_fn (insn
);
427 #ifdef ADJUST_INSN_LENGTH
428 ADJUST_INSN_LENGTH (insn
, length
);
433 /* Obtain the current length of an insn. If branch shortening has been done,
434 get its actual length. Otherwise, get its maximum length. */
436 get_attr_length (rtx insn
)
438 return get_attr_length_1 (insn
, insn_default_length
);
441 /* Obtain the current length of an insn. If branch shortening has been done,
442 get its actual length. Otherwise, get its minimum length. */
444 get_attr_min_length (rtx insn
)
446 return get_attr_length_1 (insn
, insn_min_length
);
449 /* Code to handle alignment inside shorten_branches. */
451 /* Here is an explanation how the algorithm in align_fuzz can give
454 Call a sequence of instructions beginning with alignment point X
455 and continuing until the next alignment point `block X'. When `X'
456 is used in an expression, it means the alignment value of the
459 Call the distance between the start of the first insn of block X, and
460 the end of the last insn of block X `IX', for the `inner size of X'.
461 This is clearly the sum of the instruction lengths.
463 Likewise with the next alignment-delimited block following X, which we
466 Call the distance between the start of the first insn of block X, and
467 the start of the first insn of block Y `OX', for the `outer size of X'.
469 The estimated padding is then OX - IX.
471 OX can be safely estimated as
476 OX = round_up(IX, X) + Y - X
478 Clearly est(IX) >= real(IX), because that only depends on the
479 instruction lengths, and those being overestimated is a given.
481 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
482 we needn't worry about that when thinking about OX.
484 When X >= Y, the alignment provided by Y adds no uncertainty factor
485 for branch ranges starting before X, so we can just round what we have.
486 But when X < Y, we don't know anything about the, so to speak,
487 `middle bits', so we have to assume the worst when aligning up from an
488 address mod X to one mod Y, which is Y - X. */
491 #define LABEL_ALIGN(LABEL) align_labels_log
495 #define LOOP_ALIGN(LABEL) align_loops_log
498 #ifndef LABEL_ALIGN_AFTER_BARRIER
499 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
503 #define JUMP_ALIGN(LABEL) align_jumps_log
507 default_label_align_after_barrier_max_skip (rtx insn ATTRIBUTE_UNUSED
)
513 default_loop_align_max_skip (rtx insn ATTRIBUTE_UNUSED
)
515 return align_loops_max_skip
;
519 default_label_align_max_skip (rtx insn ATTRIBUTE_UNUSED
)
521 return align_labels_max_skip
;
525 default_jump_align_max_skip (rtx insn ATTRIBUTE_UNUSED
)
527 return align_jumps_max_skip
;
530 #ifndef ADDR_VEC_ALIGN
532 final_addr_vec_align (rtx addr_vec
)
534 int align
= GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec
)));
536 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
537 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
538 return exact_log2 (align
);
542 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
545 #ifndef INSN_LENGTH_ALIGNMENT
546 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
549 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
551 static int min_labelno
, max_labelno
;
553 #define LABEL_TO_ALIGNMENT(LABEL) \
554 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
556 #define LABEL_TO_MAX_SKIP(LABEL) \
557 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
559 /* For the benefit of port specific code do this also as a function. */
562 label_to_alignment (rtx label
)
564 if (CODE_LABEL_NUMBER (label
) <= max_labelno
)
565 return LABEL_TO_ALIGNMENT (label
);
570 label_to_max_skip (rtx label
)
572 if (CODE_LABEL_NUMBER (label
) <= max_labelno
)
573 return LABEL_TO_MAX_SKIP (label
);
577 /* The differences in addresses
578 between a branch and its target might grow or shrink depending on
579 the alignment the start insn of the range (the branch for a forward
580 branch or the label for a backward branch) starts out on; if these
581 differences are used naively, they can even oscillate infinitely.
582 We therefore want to compute a 'worst case' address difference that
583 is independent of the alignment the start insn of the range end
584 up on, and that is at least as large as the actual difference.
585 The function align_fuzz calculates the amount we have to add to the
586 naively computed difference, by traversing the part of the alignment
587 chain of the start insn of the range that is in front of the end insn
588 of the range, and considering for each alignment the maximum amount
589 that it might contribute to a size increase.
591 For casesi tables, we also want to know worst case minimum amounts of
592 address difference, in case a machine description wants to introduce
593 some common offset that is added to all offsets in a table.
594 For this purpose, align_fuzz with a growth argument of 0 computes the
595 appropriate adjustment. */
597 /* Compute the maximum delta by which the difference of the addresses of
598 START and END might grow / shrink due to a different address for start
599 which changes the size of alignment insns between START and END.
600 KNOWN_ALIGN_LOG is the alignment known for START.
601 GROWTH should be ~0 if the objective is to compute potential code size
602 increase, and 0 if the objective is to compute potential shrink.
603 The return value is undefined for any other value of GROWTH. */
606 align_fuzz (rtx start
, rtx end
, int known_align_log
, unsigned int growth
)
608 int uid
= INSN_UID (start
);
610 int known_align
= 1 << known_align_log
;
611 int end_shuid
= INSN_SHUID (end
);
614 for (align_label
= uid_align
[uid
]; align_label
; align_label
= uid_align
[uid
])
616 int align_addr
, new_align
;
618 uid
= INSN_UID (align_label
);
619 align_addr
= INSN_ADDRESSES (uid
) - insn_lengths
[uid
];
620 if (uid_shuid
[uid
] > end_shuid
)
622 known_align_log
= LABEL_TO_ALIGNMENT (align_label
);
623 new_align
= 1 << known_align_log
;
624 if (new_align
< known_align
)
626 fuzz
+= (-align_addr
^ growth
) & (new_align
- known_align
);
627 known_align
= new_align
;
632 /* Compute a worst-case reference address of a branch so that it
633 can be safely used in the presence of aligned labels. Since the
634 size of the branch itself is unknown, the size of the branch is
635 not included in the range. I.e. for a forward branch, the reference
636 address is the end address of the branch as known from the previous
637 branch shortening pass, minus a value to account for possible size
638 increase due to alignment. For a backward branch, it is the start
639 address of the branch as known from the current pass, plus a value
640 to account for possible size increase due to alignment.
641 NB.: Therefore, the maximum offset allowed for backward branches needs
642 to exclude the branch size. */
645 insn_current_reference_address (rtx branch
)
650 if (! INSN_ADDRESSES_SET_P ())
653 seq
= NEXT_INSN (PREV_INSN (branch
));
654 seq_uid
= INSN_UID (seq
);
655 if (!JUMP_P (branch
))
656 /* This can happen for example on the PA; the objective is to know the
657 offset to address something in front of the start of the function.
658 Thus, we can treat it like a backward branch.
659 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
660 any alignment we'd encounter, so we skip the call to align_fuzz. */
661 return insn_current_address
;
662 dest
= JUMP_LABEL (branch
);
664 /* BRANCH has no proper alignment chain set, so use SEQ.
665 BRANCH also has no INSN_SHUID. */
666 if (INSN_SHUID (seq
) < INSN_SHUID (dest
))
668 /* Forward branch. */
669 return (insn_last_address
+ insn_lengths
[seq_uid
]
670 - align_fuzz (seq
, dest
, length_unit_log
, ~0));
674 /* Backward branch. */
675 return (insn_current_address
676 + align_fuzz (dest
, seq
, length_unit_log
, ~0));
680 /* Compute branch alignments based on frequency information in the
684 compute_alignments (void)
686 int log
, max_skip
, max_log
;
689 int freq_threshold
= 0;
697 max_labelno
= max_label_num ();
698 min_labelno
= get_first_label_num ();
699 label_align
= XCNEWVEC (struct label_alignment
, max_labelno
- min_labelno
+ 1);
701 /* If not optimizing or optimizing for size, don't assign any alignments. */
702 if (! optimize
|| optimize_function_for_size_p (cfun
))
707 dump_reg_info (dump_file
);
708 dump_flow_info (dump_file
, TDF_DETAILS
);
709 flow_loops_dump (dump_file
, NULL
, 1);
711 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
713 if (bb
->frequency
> freq_max
)
714 freq_max
= bb
->frequency
;
715 freq_threshold
= freq_max
/ PARAM_VALUE (PARAM_ALIGN_THRESHOLD
);
718 fprintf(dump_file
, "freq_max: %i\n",freq_max
);
721 rtx label
= BB_HEAD (bb
);
722 int fallthru_frequency
= 0, branch_frequency
= 0, has_fallthru
= 0;
727 || optimize_bb_for_size_p (bb
))
730 fprintf(dump_file
, "BB %4i freq %4i loop %2i loop_depth %2i skipped.\n",
731 bb
->index
, bb
->frequency
, bb
->loop_father
->num
,
735 max_log
= LABEL_ALIGN (label
);
736 max_skip
= targetm
.asm_out
.label_align_max_skip (label
);
738 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
740 if (e
->flags
& EDGE_FALLTHRU
)
741 has_fallthru
= 1, fallthru_frequency
+= EDGE_FREQUENCY (e
);
743 branch_frequency
+= EDGE_FREQUENCY (e
);
747 fprintf(dump_file
, "BB %4i freq %4i loop %2i loop_depth %2i fall %4i branch %4i",
748 bb
->index
, bb
->frequency
, bb
->loop_father
->num
,
750 fallthru_frequency
, branch_frequency
);
751 if (!bb
->loop_father
->inner
&& bb
->loop_father
->num
)
752 fprintf (dump_file
, " inner_loop");
753 if (bb
->loop_father
->header
== bb
)
754 fprintf (dump_file
, " loop_header");
755 fprintf (dump_file
, "\n");
758 /* There are two purposes to align block with no fallthru incoming edge:
759 1) to avoid fetch stalls when branch destination is near cache boundary
760 2) to improve cache efficiency in case the previous block is not executed
761 (so it does not need to be in the cache).
763 We to catch first case, we align frequently executed blocks.
764 To catch the second, we align blocks that are executed more frequently
765 than the predecessor and the predecessor is likely to not be executed
766 when function is called. */
769 && (branch_frequency
> freq_threshold
770 || (bb
->frequency
> bb
->prev_bb
->frequency
* 10
771 && (bb
->prev_bb
->frequency
772 <= ENTRY_BLOCK_PTR
->frequency
/ 2))))
774 log
= JUMP_ALIGN (label
);
776 fprintf(dump_file
, " jump alignment added.\n");
780 max_skip
= targetm
.asm_out
.jump_align_max_skip (label
);
783 /* In case block is frequent and reached mostly by non-fallthru edge,
784 align it. It is most likely a first block of loop. */
786 && optimize_bb_for_speed_p (bb
)
787 && branch_frequency
+ fallthru_frequency
> freq_threshold
789 > fallthru_frequency
* PARAM_VALUE (PARAM_ALIGN_LOOP_ITERATIONS
)))
791 log
= LOOP_ALIGN (label
);
793 fprintf(dump_file
, " internal loop alignment added.\n");
797 max_skip
= targetm
.asm_out
.loop_align_max_skip (label
);
800 LABEL_TO_ALIGNMENT (label
) = max_log
;
801 LABEL_TO_MAX_SKIP (label
) = max_skip
;
804 loop_optimizer_finalize ();
805 free_dominance_info (CDI_DOMINATORS
);
809 struct rtl_opt_pass pass_compute_alignments
=
813 "alignments", /* name */
814 OPTGROUP_NONE
, /* optinfo_flags */
816 compute_alignments
, /* execute */
819 0, /* static_pass_number */
821 0, /* properties_required */
822 0, /* properties_provided */
823 0, /* properties_destroyed */
824 0, /* todo_flags_start */
825 TODO_verify_rtl_sharing
826 | TODO_ggc_collect
/* todo_flags_finish */
831 /* Make a pass over all insns and compute their actual lengths by shortening
832 any branches of variable length if possible. */
834 /* shorten_branches might be called multiple times: for example, the SH
835 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
836 In order to do this, it needs proper length information, which it obtains
837 by calling shorten_branches. This cannot be collapsed with
838 shorten_branches itself into a single pass unless we also want to integrate
839 reorg.c, since the branch splitting exposes new instructions with delay
843 shorten_branches (rtx first
)
850 #define MAX_CODE_ALIGN 16
852 int something_changed
= 1;
853 char *varying_length
;
856 rtx align_tab
[MAX_CODE_ALIGN
];
858 /* Compute maximum UID and allocate label_align / uid_shuid. */
859 max_uid
= get_max_uid ();
861 /* Free uid_shuid before reallocating it. */
864 uid_shuid
= XNEWVEC (int, max_uid
);
866 if (max_labelno
!= max_label_num ())
868 int old
= max_labelno
;
872 max_labelno
= max_label_num ();
874 n_labels
= max_labelno
- min_labelno
+ 1;
875 n_old_labels
= old
- min_labelno
+ 1;
877 label_align
= XRESIZEVEC (struct label_alignment
, label_align
, n_labels
);
879 /* Range of labels grows monotonically in the function. Failing here
880 means that the initialization of array got lost. */
881 gcc_assert (n_old_labels
<= n_labels
);
883 memset (label_align
+ n_old_labels
, 0,
884 (n_labels
- n_old_labels
) * sizeof (struct label_alignment
));
887 /* Initialize label_align and set up uid_shuid to be strictly
888 monotonically rising with insn order. */
889 /* We use max_log here to keep track of the maximum alignment we want to
890 impose on the next CODE_LABEL (or the current one if we are processing
891 the CODE_LABEL itself). */
896 for (insn
= get_insns (), i
= 1; insn
; insn
= NEXT_INSN (insn
))
900 INSN_SHUID (insn
) = i
++;
907 bool next_is_jumptable
;
909 /* Merge in alignments computed by compute_alignments. */
910 log
= LABEL_TO_ALIGNMENT (insn
);
914 max_skip
= LABEL_TO_MAX_SKIP (insn
);
917 next
= next_nonnote_insn (insn
);
918 next_is_jumptable
= next
&& JUMP_TABLE_DATA_P (next
);
919 if (!next_is_jumptable
)
921 log
= LABEL_ALIGN (insn
);
925 max_skip
= targetm
.asm_out
.label_align_max_skip (insn
);
928 /* ADDR_VECs only take room if read-only data goes into the text
930 if ((JUMP_TABLES_IN_TEXT_SECTION
931 || readonly_data_section
== text_section
)
932 && next_is_jumptable
)
934 log
= ADDR_VEC_ALIGN (next
);
938 max_skip
= targetm
.asm_out
.label_align_max_skip (insn
);
941 LABEL_TO_ALIGNMENT (insn
) = max_log
;
942 LABEL_TO_MAX_SKIP (insn
) = max_skip
;
946 else if (BARRIER_P (insn
))
950 for (label
= insn
; label
&& ! INSN_P (label
);
951 label
= NEXT_INSN (label
))
954 log
= LABEL_ALIGN_AFTER_BARRIER (insn
);
958 max_skip
= targetm
.asm_out
.label_align_after_barrier_max_skip (label
);
964 if (!HAVE_ATTR_length
)
967 /* Allocate the rest of the arrays. */
968 insn_lengths
= XNEWVEC (int, max_uid
);
969 insn_lengths_max_uid
= max_uid
;
970 /* Syntax errors can lead to labels being outside of the main insn stream.
971 Initialize insn_addresses, so that we get reproducible results. */
972 INSN_ADDRESSES_ALLOC (max_uid
);
974 varying_length
= XCNEWVEC (char, max_uid
);
976 /* Initialize uid_align. We scan instructions
977 from end to start, and keep in align_tab[n] the last seen insn
978 that does an alignment of at least n+1, i.e. the successor
979 in the alignment chain for an insn that does / has a known
981 uid_align
= XCNEWVEC (rtx
, max_uid
);
983 for (i
= MAX_CODE_ALIGN
; --i
>= 0;)
984 align_tab
[i
] = NULL_RTX
;
985 seq
= get_last_insn ();
986 for (; seq
; seq
= PREV_INSN (seq
))
988 int uid
= INSN_UID (seq
);
990 log
= (LABEL_P (seq
) ? LABEL_TO_ALIGNMENT (seq
) : 0);
991 uid_align
[uid
] = align_tab
[0];
994 /* Found an alignment label. */
995 uid_align
[uid
] = align_tab
[log
];
996 for (i
= log
- 1; i
>= 0; i
--)
1001 /* When optimizing, we start assuming minimum length, and keep increasing
1002 lengths as we find the need for this, till nothing changes.
1003 When not optimizing, we start assuming maximum lengths, and
1004 do a single pass to update the lengths. */
1005 bool increasing
= optimize
!= 0;
1007 #ifdef CASE_VECTOR_SHORTEN_MODE
1010 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1013 int min_shuid
= INSN_SHUID (get_insns ()) - 1;
1014 int max_shuid
= INSN_SHUID (get_last_insn ()) + 1;
1017 for (insn
= first
; insn
!= 0; insn
= NEXT_INSN (insn
))
1019 rtx min_lab
= NULL_RTX
, max_lab
= NULL_RTX
, pat
;
1020 int len
, i
, min
, max
, insn_shuid
;
1022 addr_diff_vec_flags flags
;
1025 || GET_CODE (PATTERN (insn
)) != ADDR_DIFF_VEC
)
1027 pat
= PATTERN (insn
);
1028 len
= XVECLEN (pat
, 1);
1029 gcc_assert (len
> 0);
1030 min_align
= MAX_CODE_ALIGN
;
1031 for (min
= max_shuid
, max
= min_shuid
, i
= len
- 1; i
>= 0; i
--)
1033 rtx lab
= XEXP (XVECEXP (pat
, 1, i
), 0);
1034 int shuid
= INSN_SHUID (lab
);
1045 if (min_align
> LABEL_TO_ALIGNMENT (lab
))
1046 min_align
= LABEL_TO_ALIGNMENT (lab
);
1048 XEXP (pat
, 2) = gen_rtx_LABEL_REF (Pmode
, min_lab
);
1049 XEXP (pat
, 3) = gen_rtx_LABEL_REF (Pmode
, max_lab
);
1050 insn_shuid
= INSN_SHUID (insn
);
1051 rel
= INSN_SHUID (XEXP (XEXP (pat
, 0), 0));
1052 memset (&flags
, 0, sizeof (flags
));
1053 flags
.min_align
= min_align
;
1054 flags
.base_after_vec
= rel
> insn_shuid
;
1055 flags
.min_after_vec
= min
> insn_shuid
;
1056 flags
.max_after_vec
= max
> insn_shuid
;
1057 flags
.min_after_base
= min
> rel
;
1058 flags
.max_after_base
= max
> rel
;
1059 ADDR_DIFF_VEC_FLAGS (pat
) = flags
;
1062 PUT_MODE (pat
, CASE_VECTOR_SHORTEN_MODE (0, 0, pat
));
1065 #endif /* CASE_VECTOR_SHORTEN_MODE */
1067 /* Compute initial lengths, addresses, and varying flags for each insn. */
1068 int (*length_fun
) (rtx
) = increasing
? insn_min_length
: insn_default_length
;
1070 for (insn_current_address
= 0, insn
= first
;
1072 insn_current_address
+= insn_lengths
[uid
], insn
= NEXT_INSN (insn
))
1074 uid
= INSN_UID (insn
);
1076 insn_lengths
[uid
] = 0;
1080 int log
= LABEL_TO_ALIGNMENT (insn
);
1083 int align
= 1 << log
;
1084 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1085 insn_lengths
[uid
] = new_address
- insn_current_address
;
1089 INSN_ADDRESSES (uid
) = insn_current_address
+ insn_lengths
[uid
];
1091 if (NOTE_P (insn
) || BARRIER_P (insn
)
1092 || LABEL_P (insn
) || DEBUG_INSN_P(insn
))
1094 if (INSN_DELETED_P (insn
))
1097 body
= PATTERN (insn
);
1098 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
1100 /* This only takes room if read-only data goes into the text
1102 if (JUMP_TABLES_IN_TEXT_SECTION
1103 || readonly_data_section
== text_section
)
1104 insn_lengths
[uid
] = (XVECLEN (body
,
1105 GET_CODE (body
) == ADDR_DIFF_VEC
)
1106 * GET_MODE_SIZE (GET_MODE (body
)));
1107 /* Alignment is handled by ADDR_VEC_ALIGN. */
1109 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
1110 insn_lengths
[uid
] = asm_insn_count (body
) * insn_default_length (insn
);
1111 else if (GET_CODE (body
) == SEQUENCE
)
1114 int const_delay_slots
;
1116 const_delay_slots
= const_num_delay_slots (XVECEXP (body
, 0, 0));
1118 const_delay_slots
= 0;
1120 int (*inner_length_fun
) (rtx
)
1121 = const_delay_slots
? length_fun
: insn_default_length
;
1122 /* Inside a delay slot sequence, we do not do any branch shortening
1123 if the shortening could change the number of delay slots
1125 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1127 rtx inner_insn
= XVECEXP (body
, 0, i
);
1128 int inner_uid
= INSN_UID (inner_insn
);
1131 if (GET_CODE (body
) == ASM_INPUT
1132 || asm_noperands (PATTERN (XVECEXP (body
, 0, i
))) >= 0)
1133 inner_length
= (asm_insn_count (PATTERN (inner_insn
))
1134 * insn_default_length (inner_insn
));
1136 inner_length
= inner_length_fun (inner_insn
);
1138 insn_lengths
[inner_uid
] = inner_length
;
1139 if (const_delay_slots
)
1141 if ((varying_length
[inner_uid
]
1142 = insn_variable_length_p (inner_insn
)) != 0)
1143 varying_length
[uid
] = 1;
1144 INSN_ADDRESSES (inner_uid
) = (insn_current_address
1145 + insn_lengths
[uid
]);
1148 varying_length
[inner_uid
] = 0;
1149 insn_lengths
[uid
] += inner_length
;
1152 else if (GET_CODE (body
) != USE
&& GET_CODE (body
) != CLOBBER
)
1154 insn_lengths
[uid
] = length_fun (insn
);
1155 varying_length
[uid
] = insn_variable_length_p (insn
);
1158 /* If needed, do any adjustment. */
1159 #ifdef ADJUST_INSN_LENGTH
1160 ADJUST_INSN_LENGTH (insn
, insn_lengths
[uid
]);
1161 if (insn_lengths
[uid
] < 0)
1162 fatal_insn ("negative insn length", insn
);
1166 /* Now loop over all the insns finding varying length insns. For each,
1167 get the current insn length. If it has changed, reflect the change.
1168 When nothing changes for a full pass, we are done. */
1170 while (something_changed
)
1172 something_changed
= 0;
1173 insn_current_align
= MAX_CODE_ALIGN
- 1;
1174 for (insn_current_address
= 0, insn
= first
;
1176 insn
= NEXT_INSN (insn
))
1179 #ifdef ADJUST_INSN_LENGTH
1184 uid
= INSN_UID (insn
);
1188 int log
= LABEL_TO_ALIGNMENT (insn
);
1189 if (log
> insn_current_align
)
1191 int align
= 1 << log
;
1192 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1193 insn_lengths
[uid
] = new_address
- insn_current_address
;
1194 insn_current_align
= log
;
1195 insn_current_address
= new_address
;
1198 insn_lengths
[uid
] = 0;
1199 INSN_ADDRESSES (uid
) = insn_current_address
;
1203 length_align
= INSN_LENGTH_ALIGNMENT (insn
);
1204 if (length_align
< insn_current_align
)
1205 insn_current_align
= length_align
;
1207 insn_last_address
= INSN_ADDRESSES (uid
);
1208 INSN_ADDRESSES (uid
) = insn_current_address
;
1210 #ifdef CASE_VECTOR_SHORTEN_MODE
1211 if (optimize
&& JUMP_P (insn
)
1212 && GET_CODE (PATTERN (insn
)) == ADDR_DIFF_VEC
)
1214 rtx body
= PATTERN (insn
);
1215 int old_length
= insn_lengths
[uid
];
1216 rtx rel_lab
= XEXP (XEXP (body
, 0), 0);
1217 rtx min_lab
= XEXP (XEXP (body
, 2), 0);
1218 rtx max_lab
= XEXP (XEXP (body
, 3), 0);
1219 int rel_addr
= INSN_ADDRESSES (INSN_UID (rel_lab
));
1220 int min_addr
= INSN_ADDRESSES (INSN_UID (min_lab
));
1221 int max_addr
= INSN_ADDRESSES (INSN_UID (max_lab
));
1224 addr_diff_vec_flags flags
;
1225 enum machine_mode vec_mode
;
1227 /* Avoid automatic aggregate initialization. */
1228 flags
= ADDR_DIFF_VEC_FLAGS (body
);
1230 /* Try to find a known alignment for rel_lab. */
1231 for (prev
= rel_lab
;
1233 && ! insn_lengths
[INSN_UID (prev
)]
1234 && ! (varying_length
[INSN_UID (prev
)] & 1);
1235 prev
= PREV_INSN (prev
))
1236 if (varying_length
[INSN_UID (prev
)] & 2)
1238 rel_align
= LABEL_TO_ALIGNMENT (prev
);
1242 /* See the comment on addr_diff_vec_flags in rtl.h for the
1243 meaning of the flags values. base: REL_LAB vec: INSN */
1244 /* Anything after INSN has still addresses from the last
1245 pass; adjust these so that they reflect our current
1246 estimate for this pass. */
1247 if (flags
.base_after_vec
)
1248 rel_addr
+= insn_current_address
- insn_last_address
;
1249 if (flags
.min_after_vec
)
1250 min_addr
+= insn_current_address
- insn_last_address
;
1251 if (flags
.max_after_vec
)
1252 max_addr
+= insn_current_address
- insn_last_address
;
1253 /* We want to know the worst case, i.e. lowest possible value
1254 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1255 its offset is positive, and we have to be wary of code shrink;
1256 otherwise, it is negative, and we have to be vary of code
1258 if (flags
.min_after_base
)
1260 /* If INSN is between REL_LAB and MIN_LAB, the size
1261 changes we are about to make can change the alignment
1262 within the observed offset, therefore we have to break
1263 it up into two parts that are independent. */
1264 if (! flags
.base_after_vec
&& flags
.min_after_vec
)
1266 min_addr
-= align_fuzz (rel_lab
, insn
, rel_align
, 0);
1267 min_addr
-= align_fuzz (insn
, min_lab
, 0, 0);
1270 min_addr
-= align_fuzz (rel_lab
, min_lab
, rel_align
, 0);
1274 if (flags
.base_after_vec
&& ! flags
.min_after_vec
)
1276 min_addr
-= align_fuzz (min_lab
, insn
, 0, ~0);
1277 min_addr
-= align_fuzz (insn
, rel_lab
, 0, ~0);
1280 min_addr
-= align_fuzz (min_lab
, rel_lab
, 0, ~0);
1282 /* Likewise, determine the highest lowest possible value
1283 for the offset of MAX_LAB. */
1284 if (flags
.max_after_base
)
1286 if (! flags
.base_after_vec
&& flags
.max_after_vec
)
1288 max_addr
+= align_fuzz (rel_lab
, insn
, rel_align
, ~0);
1289 max_addr
+= align_fuzz (insn
, max_lab
, 0, ~0);
1292 max_addr
+= align_fuzz (rel_lab
, max_lab
, rel_align
, ~0);
1296 if (flags
.base_after_vec
&& ! flags
.max_after_vec
)
1298 max_addr
+= align_fuzz (max_lab
, insn
, 0, 0);
1299 max_addr
+= align_fuzz (insn
, rel_lab
, 0, 0);
1302 max_addr
+= align_fuzz (max_lab
, rel_lab
, 0, 0);
1304 vec_mode
= CASE_VECTOR_SHORTEN_MODE (min_addr
- rel_addr
,
1305 max_addr
- rel_addr
, body
);
1307 || (GET_MODE_SIZE (vec_mode
)
1308 >= GET_MODE_SIZE (GET_MODE (body
))))
1309 PUT_MODE (body
, vec_mode
);
1310 if (JUMP_TABLES_IN_TEXT_SECTION
1311 || readonly_data_section
== text_section
)
1314 = (XVECLEN (body
, 1) * GET_MODE_SIZE (GET_MODE (body
)));
1315 insn_current_address
+= insn_lengths
[uid
];
1316 if (insn_lengths
[uid
] != old_length
)
1317 something_changed
= 1;
1322 #endif /* CASE_VECTOR_SHORTEN_MODE */
1324 if (! (varying_length
[uid
]))
1326 if (NONJUMP_INSN_P (insn
)
1327 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1331 body
= PATTERN (insn
);
1332 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1334 rtx inner_insn
= XVECEXP (body
, 0, i
);
1335 int inner_uid
= INSN_UID (inner_insn
);
1337 INSN_ADDRESSES (inner_uid
) = insn_current_address
;
1339 insn_current_address
+= insn_lengths
[inner_uid
];
1343 insn_current_address
+= insn_lengths
[uid
];
1348 if (NONJUMP_INSN_P (insn
) && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1352 body
= PATTERN (insn
);
1354 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1356 rtx inner_insn
= XVECEXP (body
, 0, i
);
1357 int inner_uid
= INSN_UID (inner_insn
);
1360 INSN_ADDRESSES (inner_uid
) = insn_current_address
;
1362 /* insn_current_length returns 0 for insns with a
1363 non-varying length. */
1364 if (! varying_length
[inner_uid
])
1365 inner_length
= insn_lengths
[inner_uid
];
1367 inner_length
= insn_current_length (inner_insn
);
1369 if (inner_length
!= insn_lengths
[inner_uid
])
1371 if (!increasing
|| inner_length
> insn_lengths
[inner_uid
])
1373 insn_lengths
[inner_uid
] = inner_length
;
1374 something_changed
= 1;
1377 inner_length
= insn_lengths
[inner_uid
];
1379 insn_current_address
+= inner_length
;
1380 new_length
+= inner_length
;
1385 new_length
= insn_current_length (insn
);
1386 insn_current_address
+= new_length
;
1389 #ifdef ADJUST_INSN_LENGTH
1390 /* If needed, do any adjustment. */
1391 tmp_length
= new_length
;
1392 ADJUST_INSN_LENGTH (insn
, new_length
);
1393 insn_current_address
+= (new_length
- tmp_length
);
1396 if (new_length
!= insn_lengths
[uid
]
1397 && (!increasing
|| new_length
> insn_lengths
[uid
]))
1399 insn_lengths
[uid
] = new_length
;
1400 something_changed
= 1;
1403 insn_current_address
+= insn_lengths
[uid
] - new_length
;
1405 /* For a non-optimizing compile, do only a single pass. */
1410 free (varying_length
);
1413 /* Given the body of an INSN known to be generated by an ASM statement, return
1414 the number of machine instructions likely to be generated for this insn.
1415 This is used to compute its length. */
1418 asm_insn_count (rtx body
)
1422 if (GET_CODE (body
) == ASM_INPUT
)
1423 templ
= XSTR (body
, 0);
1425 templ
= decode_asm_operands (body
, NULL
, NULL
, NULL
, NULL
, NULL
);
1427 return asm_str_count (templ
);
1430 /* Return the number of machine instructions likely to be generated for the
1431 inline-asm template. */
1433 asm_str_count (const char *templ
)
1440 for (; *templ
; templ
++)
1441 if (IS_ASM_LOGICAL_LINE_SEPARATOR (*templ
, templ
)
1448 /* ??? This is probably the wrong place for these. */
1449 /* Structure recording the mapping from source file and directory
1450 names at compile time to those to be embedded in debug
1452 typedef struct debug_prefix_map
1454 const char *old_prefix
;
1455 const char *new_prefix
;
1458 struct debug_prefix_map
*next
;
1461 /* Linked list of such structures. */
1462 debug_prefix_map
*debug_prefix_maps
;
1465 /* Record a debug file prefix mapping. ARG is the argument to
1466 -fdebug-prefix-map and must be of the form OLD=NEW. */
1469 add_debug_prefix_map (const char *arg
)
1471 debug_prefix_map
*map
;
1474 p
= strchr (arg
, '=');
1477 error ("invalid argument %qs to -fdebug-prefix-map", arg
);
1480 map
= XNEW (debug_prefix_map
);
1481 map
->old_prefix
= xstrndup (arg
, p
- arg
);
1482 map
->old_len
= p
- arg
;
1484 map
->new_prefix
= xstrdup (p
);
1485 map
->new_len
= strlen (p
);
1486 map
->next
= debug_prefix_maps
;
1487 debug_prefix_maps
= map
;
1490 /* Perform user-specified mapping of debug filename prefixes. Return
1491 the new name corresponding to FILENAME. */
1494 remap_debug_filename (const char *filename
)
1496 debug_prefix_map
*map
;
1501 for (map
= debug_prefix_maps
; map
; map
= map
->next
)
1502 if (filename_ncmp (filename
, map
->old_prefix
, map
->old_len
) == 0)
1506 name
= filename
+ map
->old_len
;
1507 name_len
= strlen (name
) + 1;
1508 s
= (char *) alloca (name_len
+ map
->new_len
);
1509 memcpy (s
, map
->new_prefix
, map
->new_len
);
1510 memcpy (s
+ map
->new_len
, name
, name_len
);
1511 return ggc_strdup (s
);
1514 /* Return true if DWARF2 debug info can be emitted for DECL. */
1517 dwarf2_debug_info_emitted_p (tree decl
)
1519 if (write_symbols
!= DWARF2_DEBUG
&& write_symbols
!= VMS_AND_DWARF2_DEBUG
)
1522 if (DECL_IGNORED_P (decl
))
1528 /* Return scope resulting from combination of S1 and S2. */
1530 choose_inner_scope (tree s1
, tree s2
)
1536 if (BLOCK_NUMBER (s1
) > BLOCK_NUMBER (s2
))
1541 /* Emit lexical block notes needed to change scope from S1 to S2. */
1544 change_scope (rtx orig_insn
, tree s1
, tree s2
)
1546 rtx insn
= orig_insn
;
1547 tree com
= NULL_TREE
;
1548 tree ts1
= s1
, ts2
= s2
;
1553 gcc_assert (ts1
&& ts2
);
1554 if (BLOCK_NUMBER (ts1
) > BLOCK_NUMBER (ts2
))
1555 ts1
= BLOCK_SUPERCONTEXT (ts1
);
1556 else if (BLOCK_NUMBER (ts1
) < BLOCK_NUMBER (ts2
))
1557 ts2
= BLOCK_SUPERCONTEXT (ts2
);
1560 ts1
= BLOCK_SUPERCONTEXT (ts1
);
1561 ts2
= BLOCK_SUPERCONTEXT (ts2
);
1570 rtx note
= emit_note_before (NOTE_INSN_BLOCK_END
, insn
);
1571 NOTE_BLOCK (note
) = s
;
1572 s
= BLOCK_SUPERCONTEXT (s
);
1579 insn
= emit_note_before (NOTE_INSN_BLOCK_BEG
, insn
);
1580 NOTE_BLOCK (insn
) = s
;
1581 s
= BLOCK_SUPERCONTEXT (s
);
1585 /* Rebuild all the NOTE_INSN_BLOCK_BEG and NOTE_INSN_BLOCK_END notes based
1586 on the scope tree and the newly reordered instructions. */
1589 reemit_insn_block_notes (void)
1591 tree cur_block
= DECL_INITIAL (cfun
->decl
);
1594 insn
= get_insns ();
1595 if (!active_insn_p (insn
))
1596 insn
= next_active_insn (insn
);
1597 for (; insn
; insn
= next_active_insn (insn
))
1601 /* Avoid putting scope notes between jump table and its label. */
1602 if (JUMP_TABLE_DATA_P (insn
))
1605 this_block
= insn_scope (insn
);
1606 /* For sequences compute scope resulting from merging all scopes
1607 of instructions nested inside. */
1608 if (GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1611 rtx body
= PATTERN (insn
);
1614 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1615 this_block
= choose_inner_scope (this_block
,
1616 insn_scope (XVECEXP (body
, 0, i
)));
1620 if (INSN_LOCATION (insn
) == UNKNOWN_LOCATION
)
1623 this_block
= DECL_INITIAL (cfun
->decl
);
1626 if (this_block
!= cur_block
)
1628 change_scope (insn
, cur_block
, this_block
);
1629 cur_block
= this_block
;
1633 /* change_scope emits before the insn, not after. */
1634 note
= emit_note (NOTE_INSN_DELETED
);
1635 change_scope (note
, cur_block
, DECL_INITIAL (cfun
->decl
));
1641 /* Output assembler code for the start of a function,
1642 and initialize some of the variables in this file
1643 for the new function. The label for the function and associated
1644 assembler pseudo-ops have already been output in `assemble_start_function'.
1646 FIRST is the first insn of the rtl for the function being compiled.
1647 FILE is the file to write assembler code to.
1648 OPTIMIZE_P is nonzero if we should eliminate redundant
1649 test and compare insns. */
1652 final_start_function (rtx first ATTRIBUTE_UNUSED
, FILE *file
,
1653 int optimize_p ATTRIBUTE_UNUSED
)
1657 this_is_asm_operands
= 0;
1659 last_filename
= LOCATION_FILE (prologue_location
);
1660 last_linenum
= LOCATION_LINE (prologue_location
);
1661 last_discriminator
= discriminator
= 0;
1663 high_block_linenum
= high_function_linenum
= last_linenum
;
1665 if (!DECL_IGNORED_P (current_function_decl
))
1666 debug_hooks
->begin_prologue (last_linenum
, last_filename
);
1668 if (!dwarf2_debug_info_emitted_p (current_function_decl
))
1669 dwarf2out_begin_prologue (0, NULL
);
1671 #ifdef LEAF_REG_REMAP
1672 if (crtl
->uses_only_leaf_regs
)
1673 leaf_renumber_regs (first
);
1676 /* The Sun386i and perhaps other machines don't work right
1677 if the profiling code comes after the prologue. */
1678 if (targetm
.profile_before_prologue () && crtl
->profile
)
1679 profile_function (file
);
1681 /* If debugging, assign block numbers to all of the blocks in this
1685 reemit_insn_block_notes ();
1686 number_blocks (current_function_decl
);
1687 /* We never actually put out begin/end notes for the top-level
1688 block in the function. But, conceptually, that block is
1690 TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl
)) = 1;
1693 if (warn_frame_larger_than
1694 && get_frame_size () > frame_larger_than_size
)
1696 /* Issue a warning */
1697 warning (OPT_Wframe_larger_than_
,
1698 "the frame size of %wd bytes is larger than %wd bytes",
1699 get_frame_size (), frame_larger_than_size
);
1702 /* First output the function prologue: code to set up the stack frame. */
1703 targetm
.asm_out
.function_prologue (file
, get_frame_size ());
1705 /* If the machine represents the prologue as RTL, the profiling code must
1706 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1707 #ifdef HAVE_prologue
1708 if (! HAVE_prologue
)
1710 profile_after_prologue (file
);
1714 profile_after_prologue (FILE *file ATTRIBUTE_UNUSED
)
1716 if (!targetm
.profile_before_prologue () && crtl
->profile
)
1717 profile_function (file
);
1721 profile_function (FILE *file ATTRIBUTE_UNUSED
)
1723 #ifndef NO_PROFILE_COUNTERS
1724 # define NO_PROFILE_COUNTERS 0
1726 #ifdef ASM_OUTPUT_REG_PUSH
1727 rtx sval
= NULL
, chain
= NULL
;
1729 if (cfun
->returns_struct
)
1730 sval
= targetm
.calls
.struct_value_rtx (TREE_TYPE (current_function_decl
),
1732 if (cfun
->static_chain_decl
)
1733 chain
= targetm
.calls
.static_chain (current_function_decl
, true);
1734 #endif /* ASM_OUTPUT_REG_PUSH */
1736 if (! NO_PROFILE_COUNTERS
)
1738 int align
= MIN (BIGGEST_ALIGNMENT
, LONG_TYPE_SIZE
);
1739 switch_to_section (data_section
);
1740 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
1741 targetm
.asm_out
.internal_label (file
, "LP", current_function_funcdef_no
);
1742 assemble_integer (const0_rtx
, LONG_TYPE_SIZE
/ BITS_PER_UNIT
, align
, 1);
1745 switch_to_section (current_function_section ());
1747 #ifdef ASM_OUTPUT_REG_PUSH
1748 if (sval
&& REG_P (sval
))
1749 ASM_OUTPUT_REG_PUSH (file
, REGNO (sval
));
1750 if (chain
&& REG_P (chain
))
1751 ASM_OUTPUT_REG_PUSH (file
, REGNO (chain
));
1754 FUNCTION_PROFILER (file
, current_function_funcdef_no
);
1756 #ifdef ASM_OUTPUT_REG_PUSH
1757 if (chain
&& REG_P (chain
))
1758 ASM_OUTPUT_REG_POP (file
, REGNO (chain
));
1759 if (sval
&& REG_P (sval
))
1760 ASM_OUTPUT_REG_POP (file
, REGNO (sval
));
1764 /* Output assembler code for the end of a function.
1765 For clarity, args are same as those of `final_start_function'
1766 even though not all of them are needed. */
1769 final_end_function (void)
1773 if (!DECL_IGNORED_P (current_function_decl
))
1774 debug_hooks
->end_function (high_function_linenum
);
1776 /* Finally, output the function epilogue:
1777 code to restore the stack frame and return to the caller. */
1778 targetm
.asm_out
.function_epilogue (asm_out_file
, get_frame_size ());
1780 /* And debug output. */
1781 if (!DECL_IGNORED_P (current_function_decl
))
1782 debug_hooks
->end_epilogue (last_linenum
, last_filename
);
1784 if (!dwarf2_debug_info_emitted_p (current_function_decl
)
1785 && dwarf2out_do_frame ())
1786 dwarf2out_end_epilogue (last_linenum
, last_filename
);
1790 /* Dumper helper for basic block information. FILE is the assembly
1791 output file, and INSN is the instruction being emitted. */
1794 dump_basic_block_info (FILE *file
, rtx insn
, basic_block
*start_to_bb
,
1795 basic_block
*end_to_bb
, int bb_map_size
, int *bb_seqn
)
1799 if (!flag_debug_asm
)
1802 if (INSN_UID (insn
) < bb_map_size
1803 && (bb
= start_to_bb
[INSN_UID (insn
)]) != NULL
)
1808 fprintf (file
, "%s BLOCK %d", ASM_COMMENT_START
, bb
->index
);
1810 fprintf (file
, " freq:%d", bb
->frequency
);
1812 fprintf (file
, " count:" HOST_WIDEST_INT_PRINT_DEC
,
1814 fprintf (file
, " seq:%d", (*bb_seqn
)++);
1815 fprintf (file
, "\n%s PRED:", ASM_COMMENT_START
);
1816 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
1818 dump_edge_info (file
, e
, TDF_DETAILS
, 0);
1820 fprintf (file
, "\n");
1822 if (INSN_UID (insn
) < bb_map_size
1823 && (bb
= end_to_bb
[INSN_UID (insn
)]) != NULL
)
1828 fprintf (asm_out_file
, "%s SUCC:", ASM_COMMENT_START
);
1829 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1831 dump_edge_info (asm_out_file
, e
, TDF_DETAILS
, 1);
1833 fprintf (file
, "\n");
1837 /* Output assembler code for some insns: all or part of a function.
1838 For description of args, see `final_start_function', above. */
1841 final (rtx first
, FILE *file
, int optimize_p
)
1846 /* Used for -dA dump. */
1847 basic_block
*start_to_bb
= NULL
;
1848 basic_block
*end_to_bb
= NULL
;
1849 int bb_map_size
= 0;
1852 last_ignored_compare
= 0;
1855 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1857 /* If CC tracking across branches is enabled, record the insn which
1858 jumps to each branch only reached from one place. */
1859 if (optimize_p
&& JUMP_P (insn
))
1861 rtx lab
= JUMP_LABEL (insn
);
1862 if (lab
&& LABEL_P (lab
) && LABEL_NUSES (lab
) == 1)
1864 LABEL_REFS (lab
) = insn
;
1878 bb_map_size
= get_max_uid () + 1;
1879 start_to_bb
= XCNEWVEC (basic_block
, bb_map_size
);
1880 end_to_bb
= XCNEWVEC (basic_block
, bb_map_size
);
1882 /* There is no cfg for a thunk. */
1883 if (!cfun
->is_thunk
)
1884 FOR_EACH_BB_REVERSE (bb
)
1886 start_to_bb
[INSN_UID (BB_HEAD (bb
))] = bb
;
1887 end_to_bb
[INSN_UID (BB_END (bb
))] = bb
;
1891 /* Output the insns. */
1892 for (insn
= first
; insn
;)
1894 if (HAVE_ATTR_length
)
1896 if ((unsigned) INSN_UID (insn
) >= INSN_ADDRESSES_SIZE ())
1898 /* This can be triggered by bugs elsewhere in the compiler if
1899 new insns are created after init_insn_lengths is called. */
1900 gcc_assert (NOTE_P (insn
));
1901 insn_current_address
= -1;
1904 insn_current_address
= INSN_ADDRESSES (INSN_UID (insn
));
1907 dump_basic_block_info (file
, insn
, start_to_bb
, end_to_bb
,
1908 bb_map_size
, &bb_seqn
);
1909 insn
= final_scan_insn (insn
, file
, optimize_p
, 0, &seen
);
1918 /* Remove CFI notes, to avoid compare-debug failures. */
1919 for (insn
= first
; insn
; insn
= next
)
1921 next
= NEXT_INSN (insn
);
1923 && (NOTE_KIND (insn
) == NOTE_INSN_CFI
1924 || NOTE_KIND (insn
) == NOTE_INSN_CFI_LABEL
))
1930 get_insn_template (int code
, rtx insn
)
1932 switch (insn_data
[code
].output_format
)
1934 case INSN_OUTPUT_FORMAT_SINGLE
:
1935 return insn_data
[code
].output
.single
;
1936 case INSN_OUTPUT_FORMAT_MULTI
:
1937 return insn_data
[code
].output
.multi
[which_alternative
];
1938 case INSN_OUTPUT_FORMAT_FUNCTION
:
1940 return (*insn_data
[code
].output
.function
) (recog_data
.operand
, insn
);
1947 /* Emit the appropriate declaration for an alternate-entry-point
1948 symbol represented by INSN, to FILE. INSN is a CODE_LABEL with
1949 LABEL_KIND != LABEL_NORMAL.
1951 The case fall-through in this function is intentional. */
1953 output_alternate_entry_point (FILE *file
, rtx insn
)
1955 const char *name
= LABEL_NAME (insn
);
1957 switch (LABEL_KIND (insn
))
1959 case LABEL_WEAK_ENTRY
:
1960 #ifdef ASM_WEAKEN_LABEL
1961 ASM_WEAKEN_LABEL (file
, name
);
1963 case LABEL_GLOBAL_ENTRY
:
1964 targetm
.asm_out
.globalize_label (file
, name
);
1965 case LABEL_STATIC_ENTRY
:
1966 #ifdef ASM_OUTPUT_TYPE_DIRECTIVE
1967 ASM_OUTPUT_TYPE_DIRECTIVE (file
, name
, "function");
1969 ASM_OUTPUT_LABEL (file
, name
);
1978 /* Given a CALL_INSN, find and return the nested CALL. */
1980 call_from_call_insn (rtx insn
)
1983 gcc_assert (CALL_P (insn
));
1986 while (GET_CODE (x
) != CALL
)
1988 switch (GET_CODE (x
))
1993 x
= COND_EXEC_CODE (x
);
1996 x
= XVECEXP (x
, 0, 0);
2006 /* The final scan for one insn, INSN.
2007 Args are same as in `final', except that INSN
2008 is the insn being scanned.
2009 Value returned is the next insn to be scanned.
2011 NOPEEPHOLES is the flag to disallow peephole processing (currently
2012 used for within delayed branch sequence output).
2014 SEEN is used to track the end of the prologue, for emitting
2015 debug information. We force the emission of a line note after
2016 both NOTE_INSN_PROLOGUE_END and NOTE_INSN_FUNCTION_BEG, or
2017 at the beginning of the second basic block, whichever comes
2021 final_scan_insn (rtx insn
, FILE *file
, int optimize_p ATTRIBUTE_UNUSED
,
2022 int nopeepholes ATTRIBUTE_UNUSED
, int *seen
)
2031 /* Ignore deleted insns. These can occur when we split insns (due to a
2032 template of "#") while not optimizing. */
2033 if (INSN_DELETED_P (insn
))
2034 return NEXT_INSN (insn
);
2036 switch (GET_CODE (insn
))
2039 switch (NOTE_KIND (insn
))
2041 case NOTE_INSN_DELETED
:
2044 case NOTE_INSN_SWITCH_TEXT_SECTIONS
:
2045 in_cold_section_p
= !in_cold_section_p
;
2047 if (dwarf2out_do_frame ())
2048 dwarf2out_switch_text_section ();
2049 else if (!DECL_IGNORED_P (current_function_decl
))
2050 debug_hooks
->switch_text_section ();
2052 switch_to_section (current_function_section ());
2053 targetm
.asm_out
.function_switched_text_sections (asm_out_file
,
2054 current_function_decl
,
2058 case NOTE_INSN_BASIC_BLOCK
:
2059 if (targetm
.asm_out
.unwind_emit
)
2060 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
2062 if ((*seen
& (SEEN_EMITTED
| SEEN_BB
)) == SEEN_BB
)
2064 *seen
|= SEEN_EMITTED
;
2065 force_source_line
= true;
2070 discriminator
= NOTE_BASIC_BLOCK (insn
)->discriminator
;
2074 case NOTE_INSN_EH_REGION_BEG
:
2075 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LEHB",
2076 NOTE_EH_HANDLER (insn
));
2079 case NOTE_INSN_EH_REGION_END
:
2080 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LEHE",
2081 NOTE_EH_HANDLER (insn
));
2084 case NOTE_INSN_PROLOGUE_END
:
2085 targetm
.asm_out
.function_end_prologue (file
);
2086 profile_after_prologue (file
);
2088 if ((*seen
& (SEEN_EMITTED
| SEEN_NOTE
)) == SEEN_NOTE
)
2090 *seen
|= SEEN_EMITTED
;
2091 force_source_line
= true;
2098 case NOTE_INSN_EPILOGUE_BEG
:
2099 if (!DECL_IGNORED_P (current_function_decl
))
2100 (*debug_hooks
->begin_epilogue
) (last_linenum
, last_filename
);
2101 targetm
.asm_out
.function_begin_epilogue (file
);
2105 dwarf2out_emit_cfi (NOTE_CFI (insn
));
2108 case NOTE_INSN_CFI_LABEL
:
2109 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LCFI",
2110 NOTE_LABEL_NUMBER (insn
));
2113 case NOTE_INSN_FUNCTION_BEG
:
2115 if (!DECL_IGNORED_P (current_function_decl
))
2116 debug_hooks
->end_prologue (last_linenum
, last_filename
);
2118 if ((*seen
& (SEEN_EMITTED
| SEEN_NOTE
)) == SEEN_NOTE
)
2120 *seen
|= SEEN_EMITTED
;
2121 force_source_line
= true;
2128 case NOTE_INSN_BLOCK_BEG
:
2129 if (debug_info_level
== DINFO_LEVEL_NORMAL
2130 || debug_info_level
== DINFO_LEVEL_VERBOSE
2131 || write_symbols
== DWARF2_DEBUG
2132 || write_symbols
== VMS_AND_DWARF2_DEBUG
2133 || write_symbols
== VMS_DEBUG
)
2135 int n
= BLOCK_NUMBER (NOTE_BLOCK (insn
));
2139 high_block_linenum
= last_linenum
;
2141 /* Output debugging info about the symbol-block beginning. */
2142 if (!DECL_IGNORED_P (current_function_decl
))
2143 debug_hooks
->begin_block (last_linenum
, n
);
2145 /* Mark this block as output. */
2146 TREE_ASM_WRITTEN (NOTE_BLOCK (insn
)) = 1;
2148 if (write_symbols
== DBX_DEBUG
2149 || write_symbols
== SDB_DEBUG
)
2151 location_t
*locus_ptr
2152 = block_nonartificial_location (NOTE_BLOCK (insn
));
2154 if (locus_ptr
!= NULL
)
2156 override_filename
= LOCATION_FILE (*locus_ptr
);
2157 override_linenum
= LOCATION_LINE (*locus_ptr
);
2162 case NOTE_INSN_BLOCK_END
:
2163 if (debug_info_level
== DINFO_LEVEL_NORMAL
2164 || debug_info_level
== DINFO_LEVEL_VERBOSE
2165 || write_symbols
== DWARF2_DEBUG
2166 || write_symbols
== VMS_AND_DWARF2_DEBUG
2167 || write_symbols
== VMS_DEBUG
)
2169 int n
= BLOCK_NUMBER (NOTE_BLOCK (insn
));
2173 /* End of a symbol-block. */
2175 gcc_assert (block_depth
>= 0);
2177 if (!DECL_IGNORED_P (current_function_decl
))
2178 debug_hooks
->end_block (high_block_linenum
, n
);
2180 if (write_symbols
== DBX_DEBUG
2181 || write_symbols
== SDB_DEBUG
)
2183 tree outer_block
= BLOCK_SUPERCONTEXT (NOTE_BLOCK (insn
));
2184 location_t
*locus_ptr
2185 = block_nonartificial_location (outer_block
);
2187 if (locus_ptr
!= NULL
)
2189 override_filename
= LOCATION_FILE (*locus_ptr
);
2190 override_linenum
= LOCATION_LINE (*locus_ptr
);
2194 override_filename
= NULL
;
2195 override_linenum
= 0;
2200 case NOTE_INSN_DELETED_LABEL
:
2201 /* Emit the label. We may have deleted the CODE_LABEL because
2202 the label could be proved to be unreachable, though still
2203 referenced (in the form of having its address taken. */
2204 ASM_OUTPUT_DEBUG_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
2207 case NOTE_INSN_DELETED_DEBUG_LABEL
:
2208 /* Similarly, but need to use different namespace for it. */
2209 if (CODE_LABEL_NUMBER (insn
) != -1)
2210 ASM_OUTPUT_DEBUG_LABEL (file
, "LDL", CODE_LABEL_NUMBER (insn
));
2213 case NOTE_INSN_VAR_LOCATION
:
2214 case NOTE_INSN_CALL_ARG_LOCATION
:
2215 if (!DECL_IGNORED_P (current_function_decl
))
2216 debug_hooks
->var_location (insn
);
2229 /* The target port might emit labels in the output function for
2230 some insn, e.g. sh.c output_branchy_insn. */
2231 if (CODE_LABEL_NUMBER (insn
) <= max_labelno
)
2233 int align
= LABEL_TO_ALIGNMENT (insn
);
2234 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2235 int max_skip
= LABEL_TO_MAX_SKIP (insn
);
2238 if (align
&& NEXT_INSN (insn
))
2240 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2241 ASM_OUTPUT_MAX_SKIP_ALIGN (file
, align
, max_skip
);
2243 #ifdef ASM_OUTPUT_ALIGN_WITH_NOP
2244 ASM_OUTPUT_ALIGN_WITH_NOP (file
, align
);
2246 ASM_OUTPUT_ALIGN (file
, align
);
2253 if (!DECL_IGNORED_P (current_function_decl
) && LABEL_NAME (insn
))
2254 debug_hooks
->label (insn
);
2258 next
= next_nonnote_insn (insn
);
2259 /* If this label is followed by a jump-table, make sure we put
2260 the label in the read-only section. Also possibly write the
2261 label and jump table together. */
2262 if (next
!= 0 && JUMP_TABLE_DATA_P (next
))
2264 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2265 /* In this case, the case vector is being moved by the
2266 target, so don't output the label at all. Leave that
2267 to the back end macros. */
2269 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2273 switch_to_section (targetm
.asm_out
.function_rodata_section
2274 (current_function_decl
));
2276 #ifdef ADDR_VEC_ALIGN
2277 log_align
= ADDR_VEC_ALIGN (next
);
2279 log_align
= exact_log2 (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
);
2281 ASM_OUTPUT_ALIGN (file
, log_align
);
2284 switch_to_section (current_function_section ());
2286 #ifdef ASM_OUTPUT_CASE_LABEL
2287 ASM_OUTPUT_CASE_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
),
2290 targetm
.asm_out
.internal_label (file
, "L", CODE_LABEL_NUMBER (insn
));
2295 if (LABEL_ALT_ENTRY_P (insn
))
2296 output_alternate_entry_point (file
, insn
);
2298 targetm
.asm_out
.internal_label (file
, "L", CODE_LABEL_NUMBER (insn
));
2303 rtx body
= PATTERN (insn
);
2304 int insn_code_number
;
2308 /* Reset this early so it is correct for ASM statements. */
2309 current_insn_predicate
= NULL_RTX
;
2311 /* An INSN, JUMP_INSN or CALL_INSN.
2312 First check for special kinds that recog doesn't recognize. */
2314 if (GET_CODE (body
) == USE
/* These are just declarations. */
2315 || GET_CODE (body
) == CLOBBER
)
2320 /* If there is a REG_CC_SETTER note on this insn, it means that
2321 the setting of the condition code was done in the delay slot
2322 of the insn that branched here. So recover the cc status
2323 from the insn that set it. */
2325 rtx note
= find_reg_note (insn
, REG_CC_SETTER
, NULL_RTX
);
2328 NOTICE_UPDATE_CC (PATTERN (XEXP (note
, 0)), XEXP (note
, 0));
2329 cc_prev_status
= cc_status
;
2334 /* Detect insns that are really jump-tables
2335 and output them as such. */
2337 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
2339 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2343 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2344 switch_to_section (targetm
.asm_out
.function_rodata_section
2345 (current_function_decl
));
2347 switch_to_section (current_function_section ());
2351 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2352 if (GET_CODE (body
) == ADDR_VEC
)
2354 #ifdef ASM_OUTPUT_ADDR_VEC
2355 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn
), body
);
2362 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2363 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn
), body
);
2369 vlen
= XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
);
2370 for (idx
= 0; idx
< vlen
; idx
++)
2372 if (GET_CODE (body
) == ADDR_VEC
)
2374 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2375 ASM_OUTPUT_ADDR_VEC_ELT
2376 (file
, CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 0, idx
), 0)));
2383 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2384 ASM_OUTPUT_ADDR_DIFF_ELT
2387 CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 1, idx
), 0)),
2388 CODE_LABEL_NUMBER (XEXP (XEXP (body
, 0), 0)));
2394 #ifdef ASM_OUTPUT_CASE_END
2395 ASM_OUTPUT_CASE_END (file
,
2396 CODE_LABEL_NUMBER (PREV_INSN (insn
)),
2401 switch_to_section (current_function_section ());
2405 /* Output this line note if it is the first or the last line
2407 if (!DECL_IGNORED_P (current_function_decl
)
2408 && notice_source_line (insn
, &is_stmt
))
2409 (*debug_hooks
->source_line
) (last_linenum
, last_filename
,
2410 last_discriminator
, is_stmt
);
2412 if (GET_CODE (body
) == ASM_INPUT
)
2414 const char *string
= XSTR (body
, 0);
2416 /* There's no telling what that did to the condition codes. */
2421 expanded_location loc
;
2424 loc
= expand_location (ASM_INPUT_SOURCE_LOCATION (body
));
2425 if (*loc
.file
&& loc
.line
)
2426 fprintf (asm_out_file
, "%s %i \"%s\" 1\n",
2427 ASM_COMMENT_START
, loc
.line
, loc
.file
);
2428 fprintf (asm_out_file
, "\t%s\n", string
);
2429 #if HAVE_AS_LINE_ZERO
2430 if (*loc
.file
&& loc
.line
)
2431 fprintf (asm_out_file
, "%s 0 \"\" 2\n", ASM_COMMENT_START
);
2437 /* Detect `asm' construct with operands. */
2438 if (asm_noperands (body
) >= 0)
2440 unsigned int noperands
= asm_noperands (body
);
2441 rtx
*ops
= XALLOCAVEC (rtx
, noperands
);
2444 expanded_location expanded
;
2446 /* There's no telling what that did to the condition codes. */
2449 /* Get out the operand values. */
2450 string
= decode_asm_operands (body
, ops
, NULL
, NULL
, NULL
, &loc
);
2451 /* Inhibit dying on what would otherwise be compiler bugs. */
2452 insn_noperands
= noperands
;
2453 this_is_asm_operands
= insn
;
2454 expanded
= expand_location (loc
);
2456 #ifdef FINAL_PRESCAN_INSN
2457 FINAL_PRESCAN_INSN (insn
, ops
, insn_noperands
);
2460 /* Output the insn using them. */
2464 if (expanded
.file
&& expanded
.line
)
2465 fprintf (asm_out_file
, "%s %i \"%s\" 1\n",
2466 ASM_COMMENT_START
, expanded
.line
, expanded
.file
);
2467 output_asm_insn (string
, ops
);
2468 #if HAVE_AS_LINE_ZERO
2469 if (expanded
.file
&& expanded
.line
)
2470 fprintf (asm_out_file
, "%s 0 \"\" 2\n", ASM_COMMENT_START
);
2474 if (targetm
.asm_out
.final_postscan_insn
)
2475 targetm
.asm_out
.final_postscan_insn (file
, insn
, ops
,
2478 this_is_asm_operands
= 0;
2484 if (GET_CODE (body
) == SEQUENCE
)
2486 /* A delayed-branch sequence */
2489 final_sequence
= body
;
2491 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2492 force the restoration of a comparison that was previously
2493 thought unnecessary. If that happens, cancel this sequence
2494 and cause that insn to be restored. */
2496 next
= final_scan_insn (XVECEXP (body
, 0, 0), file
, 0, 1, seen
);
2497 if (next
!= XVECEXP (body
, 0, 1))
2503 for (i
= 1; i
< XVECLEN (body
, 0); i
++)
2505 rtx insn
= XVECEXP (body
, 0, i
);
2506 rtx next
= NEXT_INSN (insn
);
2507 /* We loop in case any instruction in a delay slot gets
2510 insn
= final_scan_insn (insn
, file
, 0, 1, seen
);
2511 while (insn
!= next
);
2513 #ifdef DBR_OUTPUT_SEQEND
2514 DBR_OUTPUT_SEQEND (file
);
2518 /* If the insn requiring the delay slot was a CALL_INSN, the
2519 insns in the delay slot are actually executed before the
2520 called function. Hence we don't preserve any CC-setting
2521 actions in these insns and the CC must be marked as being
2522 clobbered by the function. */
2523 if (CALL_P (XVECEXP (body
, 0, 0)))
2530 /* We have a real machine instruction as rtl. */
2532 body
= PATTERN (insn
);
2535 set
= single_set (insn
);
2537 /* Check for redundant test and compare instructions
2538 (when the condition codes are already set up as desired).
2539 This is done only when optimizing; if not optimizing,
2540 it should be possible for the user to alter a variable
2541 with the debugger in between statements
2542 and the next statement should reexamine the variable
2543 to compute the condition codes. */
2548 && GET_CODE (SET_DEST (set
)) == CC0
2549 && insn
!= last_ignored_compare
)
2552 if (GET_CODE (SET_SRC (set
)) == SUBREG
)
2553 SET_SRC (set
) = alter_subreg (&SET_SRC (set
), true);
2555 src1
= SET_SRC (set
);
2557 if (GET_CODE (SET_SRC (set
)) == COMPARE
)
2559 if (GET_CODE (XEXP (SET_SRC (set
), 0)) == SUBREG
)
2560 XEXP (SET_SRC (set
), 0)
2561 = alter_subreg (&XEXP (SET_SRC (set
), 0), true);
2562 if (GET_CODE (XEXP (SET_SRC (set
), 1)) == SUBREG
)
2563 XEXP (SET_SRC (set
), 1)
2564 = alter_subreg (&XEXP (SET_SRC (set
), 1), true);
2565 if (XEXP (SET_SRC (set
), 1)
2566 == CONST0_RTX (GET_MODE (XEXP (SET_SRC (set
), 0))))
2567 src2
= XEXP (SET_SRC (set
), 0);
2569 if ((cc_status
.value1
!= 0
2570 && rtx_equal_p (src1
, cc_status
.value1
))
2571 || (cc_status
.value2
!= 0
2572 && rtx_equal_p (src1
, cc_status
.value2
))
2573 || (src2
!= 0 && cc_status
.value1
!= 0
2574 && rtx_equal_p (src2
, cc_status
.value1
))
2575 || (src2
!= 0 && cc_status
.value2
!= 0
2576 && rtx_equal_p (src2
, cc_status
.value2
)))
2578 /* Don't delete insn if it has an addressing side-effect. */
2579 if (! FIND_REG_INC_NOTE (insn
, NULL_RTX
)
2580 /* or if anything in it is volatile. */
2581 && ! volatile_refs_p (PATTERN (insn
)))
2583 /* We don't really delete the insn; just ignore it. */
2584 last_ignored_compare
= insn
;
2591 /* If this is a conditional branch, maybe modify it
2592 if the cc's are in a nonstandard state
2593 so that it accomplishes the same thing that it would
2594 do straightforwardly if the cc's were set up normally. */
2596 if (cc_status
.flags
!= 0
2598 && GET_CODE (body
) == SET
2599 && SET_DEST (body
) == pc_rtx
2600 && GET_CODE (SET_SRC (body
)) == IF_THEN_ELSE
2601 && COMPARISON_P (XEXP (SET_SRC (body
), 0))
2602 && XEXP (XEXP (SET_SRC (body
), 0), 0) == cc0_rtx
)
2604 /* This function may alter the contents of its argument
2605 and clear some of the cc_status.flags bits.
2606 It may also return 1 meaning condition now always true
2607 or -1 meaning condition now always false
2608 or 2 meaning condition nontrivial but altered. */
2609 int result
= alter_cond (XEXP (SET_SRC (body
), 0));
2610 /* If condition now has fixed value, replace the IF_THEN_ELSE
2611 with its then-operand or its else-operand. */
2613 SET_SRC (body
) = XEXP (SET_SRC (body
), 1);
2615 SET_SRC (body
) = XEXP (SET_SRC (body
), 2);
2617 /* The jump is now either unconditional or a no-op.
2618 If it has become a no-op, don't try to output it.
2619 (It would not be recognized.) */
2620 if (SET_SRC (body
) == pc_rtx
)
2625 else if (ANY_RETURN_P (SET_SRC (body
)))
2626 /* Replace (set (pc) (return)) with (return). */
2627 PATTERN (insn
) = body
= SET_SRC (body
);
2629 /* Rerecognize the instruction if it has changed. */
2631 INSN_CODE (insn
) = -1;
2634 /* If this is a conditional trap, maybe modify it if the cc's
2635 are in a nonstandard state so that it accomplishes the same
2636 thing that it would do straightforwardly if the cc's were
2638 if (cc_status
.flags
!= 0
2639 && NONJUMP_INSN_P (insn
)
2640 && GET_CODE (body
) == TRAP_IF
2641 && COMPARISON_P (TRAP_CONDITION (body
))
2642 && XEXP (TRAP_CONDITION (body
), 0) == cc0_rtx
)
2644 /* This function may alter the contents of its argument
2645 and clear some of the cc_status.flags bits.
2646 It may also return 1 meaning condition now always true
2647 or -1 meaning condition now always false
2648 or 2 meaning condition nontrivial but altered. */
2649 int result
= alter_cond (TRAP_CONDITION (body
));
2651 /* If TRAP_CONDITION has become always false, delete the
2659 /* If TRAP_CONDITION has become always true, replace
2660 TRAP_CONDITION with const_true_rtx. */
2662 TRAP_CONDITION (body
) = const_true_rtx
;
2664 /* Rerecognize the instruction if it has changed. */
2666 INSN_CODE (insn
) = -1;
2669 /* Make same adjustments to instructions that examine the
2670 condition codes without jumping and instructions that
2671 handle conditional moves (if this machine has either one). */
2673 if (cc_status
.flags
!= 0
2676 rtx cond_rtx
, then_rtx
, else_rtx
;
2679 && GET_CODE (SET_SRC (set
)) == IF_THEN_ELSE
)
2681 cond_rtx
= XEXP (SET_SRC (set
), 0);
2682 then_rtx
= XEXP (SET_SRC (set
), 1);
2683 else_rtx
= XEXP (SET_SRC (set
), 2);
2687 cond_rtx
= SET_SRC (set
);
2688 then_rtx
= const_true_rtx
;
2689 else_rtx
= const0_rtx
;
2692 if (COMPARISON_P (cond_rtx
)
2693 && XEXP (cond_rtx
, 0) == cc0_rtx
)
2696 result
= alter_cond (cond_rtx
);
2698 validate_change (insn
, &SET_SRC (set
), then_rtx
, 0);
2699 else if (result
== -1)
2700 validate_change (insn
, &SET_SRC (set
), else_rtx
, 0);
2701 else if (result
== 2)
2702 INSN_CODE (insn
) = -1;
2703 if (SET_DEST (set
) == SET_SRC (set
))
2710 #ifdef HAVE_peephole
2711 /* Do machine-specific peephole optimizations if desired. */
2713 if (optimize_p
&& !flag_no_peephole
&& !nopeepholes
)
2715 rtx next
= peephole (insn
);
2716 /* When peepholing, if there were notes within the peephole,
2717 emit them before the peephole. */
2718 if (next
!= 0 && next
!= NEXT_INSN (insn
))
2720 rtx note
, prev
= PREV_INSN (insn
);
2722 for (note
= NEXT_INSN (insn
); note
!= next
;
2723 note
= NEXT_INSN (note
))
2724 final_scan_insn (note
, file
, optimize_p
, nopeepholes
, seen
);
2726 /* Put the notes in the proper position for a later
2727 rescan. For example, the SH target can do this
2728 when generating a far jump in a delayed branch
2730 note
= NEXT_INSN (insn
);
2731 PREV_INSN (note
) = prev
;
2732 NEXT_INSN (prev
) = note
;
2733 NEXT_INSN (PREV_INSN (next
)) = insn
;
2734 PREV_INSN (insn
) = PREV_INSN (next
);
2735 NEXT_INSN (insn
) = next
;
2736 PREV_INSN (next
) = insn
;
2739 /* PEEPHOLE might have changed this. */
2740 body
= PATTERN (insn
);
2744 /* Try to recognize the instruction.
2745 If successful, verify that the operands satisfy the
2746 constraints for the instruction. Crash if they don't,
2747 since `reload' should have changed them so that they do. */
2749 insn_code_number
= recog_memoized (insn
);
2750 cleanup_subreg_operands (insn
);
2752 /* Dump the insn in the assembly for debugging (-dAP).
2753 If the final dump is requested as slim RTL, dump slim
2754 RTL to the assembly file also. */
2755 if (flag_dump_rtl_in_asm
)
2757 print_rtx_head
= ASM_COMMENT_START
;
2758 if (! (dump_flags
& TDF_SLIM
))
2759 print_rtl_single (asm_out_file
, insn
);
2761 dump_insn_slim (asm_out_file
, insn
);
2762 print_rtx_head
= "";
2765 if (! constrain_operands_cached (1))
2766 fatal_insn_not_found (insn
);
2768 /* Some target machines need to prescan each insn before
2771 #ifdef FINAL_PRESCAN_INSN
2772 FINAL_PRESCAN_INSN (insn
, recog_data
.operand
, recog_data
.n_operands
);
2775 if (targetm
.have_conditional_execution ()
2776 && GET_CODE (PATTERN (insn
)) == COND_EXEC
)
2777 current_insn_predicate
= COND_EXEC_TEST (PATTERN (insn
));
2780 cc_prev_status
= cc_status
;
2782 /* Update `cc_status' for this instruction.
2783 The instruction's output routine may change it further.
2784 If the output routine for a jump insn needs to depend
2785 on the cc status, it should look at cc_prev_status. */
2787 NOTICE_UPDATE_CC (body
, insn
);
2790 current_output_insn
= debug_insn
= insn
;
2792 /* Find the proper template for this insn. */
2793 templ
= get_insn_template (insn_code_number
, insn
);
2795 /* If the C code returns 0, it means that it is a jump insn
2796 which follows a deleted test insn, and that test insn
2797 needs to be reinserted. */
2802 gcc_assert (prev_nonnote_insn (insn
) == last_ignored_compare
);
2804 /* We have already processed the notes between the setter and
2805 the user. Make sure we don't process them again, this is
2806 particularly important if one of the notes is a block
2807 scope note or an EH note. */
2809 prev
!= last_ignored_compare
;
2810 prev
= PREV_INSN (prev
))
2813 delete_insn (prev
); /* Use delete_note. */
2819 /* If the template is the string "#", it means that this insn must
2821 if (templ
[0] == '#' && templ
[1] == '\0')
2823 rtx new_rtx
= try_split (body
, insn
, 0);
2825 /* If we didn't split the insn, go away. */
2826 if (new_rtx
== insn
&& PATTERN (new_rtx
) == body
)
2827 fatal_insn ("could not split insn", insn
);
2829 /* If we have a length attribute, this instruction should have
2830 been split in shorten_branches, to ensure that we would have
2831 valid length info for the splitees. */
2832 gcc_assert (!HAVE_ATTR_length
);
2837 /* ??? This will put the directives in the wrong place if
2838 get_insn_template outputs assembly directly. However calling it
2839 before get_insn_template breaks if the insns is split. */
2840 if (targetm
.asm_out
.unwind_emit_before_insn
2841 && targetm
.asm_out
.unwind_emit
)
2842 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
2846 rtx x
= call_from_call_insn (insn
);
2848 if (x
&& MEM_P (x
) && GET_CODE (XEXP (x
, 0)) == SYMBOL_REF
)
2852 t
= SYMBOL_REF_DECL (x
);
2854 assemble_external (t
);
2856 if (!DECL_IGNORED_P (current_function_decl
))
2857 debug_hooks
->var_location (insn
);
2860 /* Output assembler code from the template. */
2861 output_asm_insn (templ
, recog_data
.operand
);
2863 /* Some target machines need to postscan each insn after
2865 if (targetm
.asm_out
.final_postscan_insn
)
2866 targetm
.asm_out
.final_postscan_insn (file
, insn
, recog_data
.operand
,
2867 recog_data
.n_operands
);
2869 if (!targetm
.asm_out
.unwind_emit_before_insn
2870 && targetm
.asm_out
.unwind_emit
)
2871 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
2873 current_output_insn
= debug_insn
= 0;
2876 return NEXT_INSN (insn
);
2879 /* Return whether a source line note needs to be emitted before INSN.
2880 Sets IS_STMT to TRUE if the line should be marked as a possible
2881 breakpoint location. */
2884 notice_source_line (rtx insn
, bool *is_stmt
)
2886 const char *filename
;
2889 if (override_filename
)
2891 filename
= override_filename
;
2892 linenum
= override_linenum
;
2896 filename
= insn_file (insn
);
2897 linenum
= insn_line (insn
);
2900 if (filename
== NULL
)
2903 if (force_source_line
2904 || filename
!= last_filename
2905 || last_linenum
!= linenum
)
2907 force_source_line
= false;
2908 last_filename
= filename
;
2909 last_linenum
= linenum
;
2910 last_discriminator
= discriminator
;
2912 high_block_linenum
= MAX (last_linenum
, high_block_linenum
);
2913 high_function_linenum
= MAX (last_linenum
, high_function_linenum
);
2917 if (SUPPORTS_DISCRIMINATOR
&& last_discriminator
!= discriminator
)
2919 /* If the discriminator changed, but the line number did not,
2920 output the line table entry with is_stmt false so the
2921 debugger does not treat this as a breakpoint location. */
2922 last_discriminator
= discriminator
;
2930 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
2931 directly to the desired hard register. */
2934 cleanup_subreg_operands (rtx insn
)
2937 bool changed
= false;
2938 extract_insn_cached (insn
);
2939 for (i
= 0; i
< recog_data
.n_operands
; i
++)
2941 /* The following test cannot use recog_data.operand when testing
2942 for a SUBREG: the underlying object might have been changed
2943 already if we are inside a match_operator expression that
2944 matches the else clause. Instead we test the underlying
2945 expression directly. */
2946 if (GET_CODE (*recog_data
.operand_loc
[i
]) == SUBREG
)
2948 recog_data
.operand
[i
] = alter_subreg (recog_data
.operand_loc
[i
], true);
2951 else if (GET_CODE (recog_data
.operand
[i
]) == PLUS
2952 || GET_CODE (recog_data
.operand
[i
]) == MULT
2953 || MEM_P (recog_data
.operand
[i
]))
2954 recog_data
.operand
[i
] = walk_alter_subreg (recog_data
.operand_loc
[i
], &changed
);
2957 for (i
= 0; i
< recog_data
.n_dups
; i
++)
2959 if (GET_CODE (*recog_data
.dup_loc
[i
]) == SUBREG
)
2961 *recog_data
.dup_loc
[i
] = alter_subreg (recog_data
.dup_loc
[i
], true);
2964 else if (GET_CODE (*recog_data
.dup_loc
[i
]) == PLUS
2965 || GET_CODE (*recog_data
.dup_loc
[i
]) == MULT
2966 || MEM_P (*recog_data
.dup_loc
[i
]))
2967 *recog_data
.dup_loc
[i
] = walk_alter_subreg (recog_data
.dup_loc
[i
], &changed
);
2970 df_insn_rescan (insn
);
2973 /* If X is a SUBREG, try to replace it with a REG or a MEM, based on
2974 the thing it is a subreg of. Do it anyway if FINAL_P. */
2977 alter_subreg (rtx
*xp
, bool final_p
)
2980 rtx y
= SUBREG_REG (x
);
2982 /* simplify_subreg does not remove subreg from volatile references.
2983 We are required to. */
2986 int offset
= SUBREG_BYTE (x
);
2988 /* For paradoxical subregs on big-endian machines, SUBREG_BYTE
2989 contains 0 instead of the proper offset. See simplify_subreg. */
2991 && GET_MODE_SIZE (GET_MODE (y
)) < GET_MODE_SIZE (GET_MODE (x
)))
2993 int difference
= GET_MODE_SIZE (GET_MODE (y
))
2994 - GET_MODE_SIZE (GET_MODE (x
));
2995 if (WORDS_BIG_ENDIAN
)
2996 offset
+= (difference
/ UNITS_PER_WORD
) * UNITS_PER_WORD
;
2997 if (BYTES_BIG_ENDIAN
)
2998 offset
+= difference
% UNITS_PER_WORD
;
3002 *xp
= adjust_address (y
, GET_MODE (x
), offset
);
3004 *xp
= adjust_address_nv (y
, GET_MODE (x
), offset
);
3008 rtx new_rtx
= simplify_subreg (GET_MODE (x
), y
, GET_MODE (y
),
3013 else if (final_p
&& REG_P (y
))
3015 /* Simplify_subreg can't handle some REG cases, but we have to. */
3017 HOST_WIDE_INT offset
;
3019 regno
= subreg_regno (x
);
3020 if (subreg_lowpart_p (x
))
3021 offset
= byte_lowpart_offset (GET_MODE (x
), GET_MODE (y
));
3023 offset
= SUBREG_BYTE (x
);
3024 *xp
= gen_rtx_REG_offset (y
, GET_MODE (x
), regno
, offset
);
3031 /* Do alter_subreg on all the SUBREGs contained in X. */
3034 walk_alter_subreg (rtx
*xp
, bool *changed
)
3037 switch (GET_CODE (x
))
3042 XEXP (x
, 0) = walk_alter_subreg (&XEXP (x
, 0), changed
);
3043 XEXP (x
, 1) = walk_alter_subreg (&XEXP (x
, 1), changed
);
3048 XEXP (x
, 0) = walk_alter_subreg (&XEXP (x
, 0), changed
);
3053 return alter_subreg (xp
, true);
3064 /* Given BODY, the body of a jump instruction, alter the jump condition
3065 as required by the bits that are set in cc_status.flags.
3066 Not all of the bits there can be handled at this level in all cases.
3068 The value is normally 0.
3069 1 means that the condition has become always true.
3070 -1 means that the condition has become always false.
3071 2 means that COND has been altered. */
3074 alter_cond (rtx cond
)
3078 if (cc_status
.flags
& CC_REVERSED
)
3081 PUT_CODE (cond
, swap_condition (GET_CODE (cond
)));
3084 if (cc_status
.flags
& CC_INVERTED
)
3087 PUT_CODE (cond
, reverse_condition (GET_CODE (cond
)));
3090 if (cc_status
.flags
& CC_NOT_POSITIVE
)
3091 switch (GET_CODE (cond
))
3096 /* Jump becomes unconditional. */
3102 /* Jump becomes no-op. */
3106 PUT_CODE (cond
, EQ
);
3111 PUT_CODE (cond
, NE
);
3119 if (cc_status
.flags
& CC_NOT_NEGATIVE
)
3120 switch (GET_CODE (cond
))
3124 /* Jump becomes unconditional. */
3129 /* Jump becomes no-op. */
3134 PUT_CODE (cond
, EQ
);
3140 PUT_CODE (cond
, NE
);
3148 if (cc_status
.flags
& CC_NO_OVERFLOW
)
3149 switch (GET_CODE (cond
))
3152 /* Jump becomes unconditional. */
3156 PUT_CODE (cond
, EQ
);
3161 PUT_CODE (cond
, NE
);
3166 /* Jump becomes no-op. */
3173 if (cc_status
.flags
& (CC_Z_IN_NOT_N
| CC_Z_IN_N
))
3174 switch (GET_CODE (cond
))
3180 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? GE
: LT
);
3185 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? LT
: GE
);
3190 if (cc_status
.flags
& CC_NOT_SIGNED
)
3191 /* The flags are valid if signed condition operators are converted
3193 switch (GET_CODE (cond
))
3196 PUT_CODE (cond
, LEU
);
3201 PUT_CODE (cond
, LTU
);
3206 PUT_CODE (cond
, GTU
);
3211 PUT_CODE (cond
, GEU
);
3223 /* Report inconsistency between the assembler template and the operands.
3224 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3227 output_operand_lossage (const char *cmsgid
, ...)
3231 const char *pfx_str
;
3234 va_start (ap
, cmsgid
);
3236 pfx_str
= this_is_asm_operands
? _("invalid 'asm': ") : "output_operand: ";
3237 asprintf (&fmt_string
, "%s%s", pfx_str
, _(cmsgid
));
3238 vasprintf (&new_message
, fmt_string
, ap
);
3240 if (this_is_asm_operands
)
3241 error_for_asm (this_is_asm_operands
, "%s", new_message
);
3243 internal_error ("%s", new_message
);
3250 /* Output of assembler code from a template, and its subroutines. */
3252 /* Annotate the assembly with a comment describing the pattern and
3253 alternative used. */
3256 output_asm_name (void)
3260 int num
= INSN_CODE (debug_insn
);
3261 fprintf (asm_out_file
, "\t%s %d\t%s",
3262 ASM_COMMENT_START
, INSN_UID (debug_insn
),
3263 insn_data
[num
].name
);
3264 if (insn_data
[num
].n_alternatives
> 1)
3265 fprintf (asm_out_file
, "/%d", which_alternative
+ 1);
3267 if (HAVE_ATTR_length
)
3268 fprintf (asm_out_file
, "\t[length = %d]",
3269 get_attr_length (debug_insn
));
3271 /* Clear this so only the first assembler insn
3272 of any rtl insn will get the special comment for -dp. */
3277 /* If OP is a REG or MEM and we can find a MEM_EXPR corresponding to it
3278 or its address, return that expr . Set *PADDRESSP to 1 if the expr
3279 corresponds to the address of the object and 0 if to the object. */
3282 get_mem_expr_from_op (rtx op
, int *paddressp
)
3290 return REG_EXPR (op
);
3291 else if (!MEM_P (op
))
3294 if (MEM_EXPR (op
) != 0)
3295 return MEM_EXPR (op
);
3297 /* Otherwise we have an address, so indicate it and look at the address. */
3301 /* First check if we have a decl for the address, then look at the right side
3302 if it is a PLUS. Otherwise, strip off arithmetic and keep looking.
3303 But don't allow the address to itself be indirect. */
3304 if ((expr
= get_mem_expr_from_op (op
, &inner_addressp
)) && ! inner_addressp
)
3306 else if (GET_CODE (op
) == PLUS
3307 && (expr
= get_mem_expr_from_op (XEXP (op
, 1), &inner_addressp
)))
3311 || GET_RTX_CLASS (GET_CODE (op
)) == RTX_BIN_ARITH
)
3314 expr
= get_mem_expr_from_op (op
, &inner_addressp
);
3315 return inner_addressp
? 0 : expr
;
3318 /* Output operand names for assembler instructions. OPERANDS is the
3319 operand vector, OPORDER is the order to write the operands, and NOPS
3320 is the number of operands to write. */
3323 output_asm_operand_names (rtx
*operands
, int *oporder
, int nops
)
3328 for (i
= 0; i
< nops
; i
++)
3331 rtx op
= operands
[oporder
[i
]];
3332 tree expr
= get_mem_expr_from_op (op
, &addressp
);
3334 fprintf (asm_out_file
, "%c%s",
3335 wrote
? ',' : '\t', wrote
? "" : ASM_COMMENT_START
);
3339 fprintf (asm_out_file
, "%s",
3340 addressp
? "*" : "");
3341 print_mem_expr (asm_out_file
, expr
);
3344 else if (REG_P (op
) && ORIGINAL_REGNO (op
)
3345 && ORIGINAL_REGNO (op
) != REGNO (op
))
3346 fprintf (asm_out_file
, " tmp%i", ORIGINAL_REGNO (op
));
3350 #ifdef ASSEMBLER_DIALECT
3351 /* Helper function to parse assembler dialects in the asm string.
3352 This is called from output_asm_insn and asm_fprintf. */
3354 do_assembler_dialects (const char *p
, int *dialect
)
3365 output_operand_lossage ("nested assembly dialect alternatives");
3369 /* If we want the first dialect, do nothing. Otherwise, skip
3370 DIALECT_NUMBER of strings ending with '|'. */
3371 for (i
= 0; i
< dialect_number
; i
++)
3373 while (*p
&& *p
!= '}' && *p
++ != '|')
3380 output_operand_lossage ("unterminated assembly dialect alternative");
3387 /* Skip to close brace. */
3392 output_operand_lossage ("unterminated assembly dialect alternative");
3396 while (*p
++ != '}');
3400 putc (c
, asm_out_file
);
3405 putc (c
, asm_out_file
);
3416 /* Output text from TEMPLATE to the assembler output file,
3417 obeying %-directions to substitute operands taken from
3418 the vector OPERANDS.
3420 %N (for N a digit) means print operand N in usual manner.
3421 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3422 and print the label name with no punctuation.
3423 %cN means require operand N to be a constant
3424 and print the constant expression with no punctuation.
3425 %aN means expect operand N to be a memory address
3426 (not a memory reference!) and print a reference
3428 %nN means expect operand N to be a constant
3429 and print a constant expression for minus the value
3430 of the operand, with no other punctuation. */
3433 output_asm_insn (const char *templ
, rtx
*operands
)
3437 #ifdef ASSEMBLER_DIALECT
3440 int oporder
[MAX_RECOG_OPERANDS
];
3441 char opoutput
[MAX_RECOG_OPERANDS
];
3444 /* An insn may return a null string template
3445 in a case where no assembler code is needed. */
3449 memset (opoutput
, 0, sizeof opoutput
);
3451 putc ('\t', asm_out_file
);
3453 #ifdef ASM_OUTPUT_OPCODE
3454 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3461 if (flag_verbose_asm
)
3462 output_asm_operand_names (operands
, oporder
, ops
);
3463 if (flag_print_asm_name
)
3467 memset (opoutput
, 0, sizeof opoutput
);
3469 putc (c
, asm_out_file
);
3470 #ifdef ASM_OUTPUT_OPCODE
3471 while ((c
= *p
) == '\t')
3473 putc (c
, asm_out_file
);
3476 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3480 #ifdef ASSEMBLER_DIALECT
3484 p
= do_assembler_dialects (p
, &dialect
);
3489 /* %% outputs a single %. */
3493 putc (c
, asm_out_file
);
3495 /* %= outputs a number which is unique to each insn in the entire
3496 compilation. This is useful for making local labels that are
3497 referred to more than once in a given insn. */
3501 fprintf (asm_out_file
, "%d", insn_counter
);
3503 /* % followed by a letter and some digits
3504 outputs an operand in a special way depending on the letter.
3505 Letters `acln' are implemented directly.
3506 Other letters are passed to `output_operand' so that
3507 the TARGET_PRINT_OPERAND hook can define them. */
3508 else if (ISALPHA (*p
))
3511 unsigned long opnum
;
3514 opnum
= strtoul (p
, &endptr
, 10);
3517 output_operand_lossage ("operand number missing "
3519 else if (this_is_asm_operands
&& opnum
>= insn_noperands
)
3520 output_operand_lossage ("operand number out of range");
3521 else if (letter
== 'l')
3522 output_asm_label (operands
[opnum
]);
3523 else if (letter
== 'a')
3524 output_address (operands
[opnum
]);
3525 else if (letter
== 'c')
3527 if (CONSTANT_ADDRESS_P (operands
[opnum
]))
3528 output_addr_const (asm_out_file
, operands
[opnum
]);
3530 output_operand (operands
[opnum
], 'c');
3532 else if (letter
== 'n')
3534 if (CONST_INT_P (operands
[opnum
]))
3535 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
,
3536 - INTVAL (operands
[opnum
]));
3539 putc ('-', asm_out_file
);
3540 output_addr_const (asm_out_file
, operands
[opnum
]);
3544 output_operand (operands
[opnum
], letter
);
3546 if (!opoutput
[opnum
])
3547 oporder
[ops
++] = opnum
;
3548 opoutput
[opnum
] = 1;
3553 /* % followed by a digit outputs an operand the default way. */
3554 else if (ISDIGIT (*p
))
3556 unsigned long opnum
;
3559 opnum
= strtoul (p
, &endptr
, 10);
3560 if (this_is_asm_operands
&& opnum
>= insn_noperands
)
3561 output_operand_lossage ("operand number out of range");
3563 output_operand (operands
[opnum
], 0);
3565 if (!opoutput
[opnum
])
3566 oporder
[ops
++] = opnum
;
3567 opoutput
[opnum
] = 1;
3572 /* % followed by punctuation: output something for that
3573 punctuation character alone, with no operand. The
3574 TARGET_PRINT_OPERAND hook decides what is actually done. */
3575 else if (targetm
.asm_out
.print_operand_punct_valid_p ((unsigned char) *p
))
3576 output_operand (NULL_RTX
, *p
++);
3578 output_operand_lossage ("invalid %%-code");
3582 putc (c
, asm_out_file
);
3585 /* Write out the variable names for operands, if we know them. */
3586 if (flag_verbose_asm
)
3587 output_asm_operand_names (operands
, oporder
, ops
);
3588 if (flag_print_asm_name
)
3591 putc ('\n', asm_out_file
);
3594 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3597 output_asm_label (rtx x
)
3601 if (GET_CODE (x
) == LABEL_REF
)
3605 && NOTE_KIND (x
) == NOTE_INSN_DELETED_LABEL
))
3606 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3608 output_operand_lossage ("'%%l' operand isn't a label");
3610 assemble_name (asm_out_file
, buf
);
3613 /* Helper rtx-iteration-function for mark_symbol_refs_as_used and
3614 output_operand. Marks SYMBOL_REFs as referenced through use of
3615 assemble_external. */
3618 mark_symbol_ref_as_used (rtx
*xp
, void *dummy ATTRIBUTE_UNUSED
)
3622 /* If we have a used symbol, we may have to emit assembly
3623 annotations corresponding to whether the symbol is external, weak
3624 or has non-default visibility. */
3625 if (GET_CODE (x
) == SYMBOL_REF
)
3629 t
= SYMBOL_REF_DECL (x
);
3631 assemble_external (t
);
3639 /* Marks SYMBOL_REFs in x as referenced through use of assemble_external. */
3642 mark_symbol_refs_as_used (rtx x
)
3644 for_each_rtx (&x
, mark_symbol_ref_as_used
, NULL
);
3647 /* Print operand X using machine-dependent assembler syntax.
3648 CODE is a non-digit that preceded the operand-number in the % spec,
3649 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3650 between the % and the digits.
3651 When CODE is a non-letter, X is 0.
3653 The meanings of the letters are machine-dependent and controlled
3654 by TARGET_PRINT_OPERAND. */
3657 output_operand (rtx x
, int code ATTRIBUTE_UNUSED
)
3659 if (x
&& GET_CODE (x
) == SUBREG
)
3660 x
= alter_subreg (&x
, true);
3662 /* X must not be a pseudo reg. */
3663 gcc_assert (!x
|| !REG_P (x
) || REGNO (x
) < FIRST_PSEUDO_REGISTER
);
3665 targetm
.asm_out
.print_operand (asm_out_file
, x
, code
);
3670 for_each_rtx (&x
, mark_symbol_ref_as_used
, NULL
);
3673 /* Print a memory reference operand for address X using
3674 machine-dependent assembler syntax. */
3677 output_address (rtx x
)
3679 bool changed
= false;
3680 walk_alter_subreg (&x
, &changed
);
3681 targetm
.asm_out
.print_operand_address (asm_out_file
, x
);
3684 /* Print an integer constant expression in assembler syntax.
3685 Addition and subtraction are the only arithmetic
3686 that may appear in these expressions. */
3689 output_addr_const (FILE *file
, rtx x
)
3694 switch (GET_CODE (x
))
3701 if (SYMBOL_REF_DECL (x
))
3702 assemble_external (SYMBOL_REF_DECL (x
));
3703 #ifdef ASM_OUTPUT_SYMBOL_REF
3704 ASM_OUTPUT_SYMBOL_REF (file
, x
);
3706 assemble_name (file
, XSTR (x
, 0));
3714 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3715 #ifdef ASM_OUTPUT_LABEL_REF
3716 ASM_OUTPUT_LABEL_REF (file
, buf
);
3718 assemble_name (file
, buf
);
3723 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, INTVAL (x
));
3727 /* This used to output parentheses around the expression,
3728 but that does not work on the 386 (either ATT or BSD assembler). */
3729 output_addr_const (file
, XEXP (x
, 0));
3733 if (GET_MODE (x
) == VOIDmode
)
3735 /* We can use %d if the number is one word and positive. */
3736 if (CONST_DOUBLE_HIGH (x
))
3737 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
3738 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_HIGH (x
),
3739 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_LOW (x
));
3740 else if (CONST_DOUBLE_LOW (x
) < 0)
3741 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
,
3742 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_LOW (x
));
3744 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_DOUBLE_LOW (x
));
3747 /* We can't handle floating point constants;
3748 PRINT_OPERAND must handle them. */
3749 output_operand_lossage ("floating constant misused");
3753 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_FIXED_VALUE_LOW (x
));
3757 /* Some assemblers need integer constants to appear last (eg masm). */
3758 if (CONST_INT_P (XEXP (x
, 0)))
3760 output_addr_const (file
, XEXP (x
, 1));
3761 if (INTVAL (XEXP (x
, 0)) >= 0)
3762 fprintf (file
, "+");
3763 output_addr_const (file
, XEXP (x
, 0));
3767 output_addr_const (file
, XEXP (x
, 0));
3768 if (!CONST_INT_P (XEXP (x
, 1))
3769 || INTVAL (XEXP (x
, 1)) >= 0)
3770 fprintf (file
, "+");
3771 output_addr_const (file
, XEXP (x
, 1));
3776 /* Avoid outputting things like x-x or x+5-x,
3777 since some assemblers can't handle that. */
3778 x
= simplify_subtraction (x
);
3779 if (GET_CODE (x
) != MINUS
)
3782 output_addr_const (file
, XEXP (x
, 0));
3783 fprintf (file
, "-");
3784 if ((CONST_INT_P (XEXP (x
, 1)) && INTVAL (XEXP (x
, 1)) >= 0)
3785 || GET_CODE (XEXP (x
, 1)) == PC
3786 || GET_CODE (XEXP (x
, 1)) == SYMBOL_REF
)
3787 output_addr_const (file
, XEXP (x
, 1));
3790 fputs (targetm
.asm_out
.open_paren
, file
);
3791 output_addr_const (file
, XEXP (x
, 1));
3792 fputs (targetm
.asm_out
.close_paren
, file
);
3800 output_addr_const (file
, XEXP (x
, 0));
3804 if (targetm
.asm_out
.output_addr_const_extra (file
, x
))
3807 output_operand_lossage ("invalid expression as operand");
3811 /* Output a quoted string. */
3814 output_quoted_string (FILE *asm_file
, const char *string
)
3816 #ifdef OUTPUT_QUOTED_STRING
3817 OUTPUT_QUOTED_STRING (asm_file
, string
);
3821 putc ('\"', asm_file
);
3822 while ((c
= *string
++) != 0)
3826 if (c
== '\"' || c
== '\\')
3827 putc ('\\', asm_file
);
3831 fprintf (asm_file
, "\\%03o", (unsigned char) c
);
3833 putc ('\"', asm_file
);
3837 /* Write a HOST_WIDE_INT number in hex form 0x1234, fast. */
3840 fprint_whex (FILE *f
, unsigned HOST_WIDE_INT value
)
3842 char buf
[2 + CHAR_BIT
* sizeof (value
) / 4];
3847 char *p
= buf
+ sizeof (buf
);
3849 *--p
= "0123456789abcdef"[value
% 16];
3850 while ((value
/= 16) != 0);
3853 fwrite (p
, 1, buf
+ sizeof (buf
) - p
, f
);
3857 /* Internal function that prints an unsigned long in decimal in reverse.
3858 The output string IS NOT null-terminated. */
3861 sprint_ul_rev (char *s
, unsigned long value
)
3866 s
[i
] = "0123456789"[value
% 10];
3869 /* alternate version, without modulo */
3870 /* oldval = value; */
3872 /* s[i] = "0123456789" [oldval - 10*value]; */
3879 /* Write an unsigned long as decimal to a file, fast. */
3882 fprint_ul (FILE *f
, unsigned long value
)
3884 /* python says: len(str(2**64)) == 20 */
3888 i
= sprint_ul_rev (s
, value
);
3890 /* It's probably too small to bother with string reversal and fputs. */
3899 /* Write an unsigned long as decimal to a string, fast.
3900 s must be wide enough to not overflow, at least 21 chars.
3901 Returns the length of the string (without terminating '\0'). */
3904 sprint_ul (char *s
, unsigned long value
)
3911 len
= sprint_ul_rev (s
, value
);
3914 /* Reverse the string. */
3928 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3929 %R prints the value of REGISTER_PREFIX.
3930 %L prints the value of LOCAL_LABEL_PREFIX.
3931 %U prints the value of USER_LABEL_PREFIX.
3932 %I prints the value of IMMEDIATE_PREFIX.
3933 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3934 Also supported are %d, %i, %u, %x, %X, %o, %c, %s and %%.
3936 We handle alternate assembler dialects here, just like output_asm_insn. */
3939 asm_fprintf (FILE *file
, const char *p
, ...)
3943 #ifdef ASSEMBLER_DIALECT
3948 va_start (argptr
, p
);
3955 #ifdef ASSEMBLER_DIALECT
3959 p
= do_assembler_dialects (p
, &dialect
);
3966 while (strchr ("-+ #0", c
))
3971 while (ISDIGIT (c
) || c
== '.')
3982 case 'd': case 'i': case 'u':
3983 case 'x': case 'X': case 'o':
3987 fprintf (file
, buf
, va_arg (argptr
, int));
3991 /* This is a prefix to the 'd', 'i', 'u', 'x', 'X', and
3992 'o' cases, but we do not check for those cases. It
3993 means that the value is a HOST_WIDE_INT, which may be
3994 either `long' or `long long'. */
3995 memcpy (q
, HOST_WIDE_INT_PRINT
, strlen (HOST_WIDE_INT_PRINT
));
3996 q
+= strlen (HOST_WIDE_INT_PRINT
);
3999 fprintf (file
, buf
, va_arg (argptr
, HOST_WIDE_INT
));
4004 #ifdef HAVE_LONG_LONG
4010 fprintf (file
, buf
, va_arg (argptr
, long long));
4017 fprintf (file
, buf
, va_arg (argptr
, long));
4025 fprintf (file
, buf
, va_arg (argptr
, char *));
4029 #ifdef ASM_OUTPUT_OPCODE
4030 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
4035 #ifdef REGISTER_PREFIX
4036 fprintf (file
, "%s", REGISTER_PREFIX
);
4041 #ifdef IMMEDIATE_PREFIX
4042 fprintf (file
, "%s", IMMEDIATE_PREFIX
);
4047 #ifdef LOCAL_LABEL_PREFIX
4048 fprintf (file
, "%s", LOCAL_LABEL_PREFIX
);
4053 fputs (user_label_prefix
, file
);
4056 #ifdef ASM_FPRINTF_EXTENSIONS
4057 /* Uppercase letters are reserved for general use by asm_fprintf
4058 and so are not available to target specific code. In order to
4059 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
4060 they are defined here. As they get turned into real extensions
4061 to asm_fprintf they should be removed from this list. */
4062 case 'A': case 'B': case 'C': case 'D': case 'E':
4063 case 'F': case 'G': case 'H': case 'J': case 'K':
4064 case 'M': case 'N': case 'P': case 'Q': case 'S':
4065 case 'T': case 'V': case 'W': case 'Y': case 'Z':
4068 ASM_FPRINTF_EXTENSIONS (file
, argptr
, p
)
4081 /* Return nonzero if this function has no function calls. */
4084 leaf_function_p (void)
4089 if (crtl
->profile
|| profile_arc_flag
)
4092 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4095 && ! SIBLING_CALL_P (insn
))
4097 if (NONJUMP_INSN_P (insn
)
4098 && GET_CODE (PATTERN (insn
)) == SEQUENCE
4099 && CALL_P (XVECEXP (PATTERN (insn
), 0, 0))
4100 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn
), 0, 0)))
4103 for (link
= crtl
->epilogue_delay_list
;
4105 link
= XEXP (link
, 1))
4107 insn
= XEXP (link
, 0);
4110 && ! SIBLING_CALL_P (insn
))
4112 if (NONJUMP_INSN_P (insn
)
4113 && GET_CODE (PATTERN (insn
)) == SEQUENCE
4114 && CALL_P (XVECEXP (PATTERN (insn
), 0, 0))
4115 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn
), 0, 0)))
4122 /* Return 1 if branch is a forward branch.
4123 Uses insn_shuid array, so it works only in the final pass. May be used by
4124 output templates to customary add branch prediction hints.
4127 final_forward_branch_p (rtx insn
)
4129 int insn_id
, label_id
;
4131 gcc_assert (uid_shuid
);
4132 insn_id
= INSN_SHUID (insn
);
4133 label_id
= INSN_SHUID (JUMP_LABEL (insn
));
4134 /* We've hit some insns that does not have id information available. */
4135 gcc_assert (insn_id
&& label_id
);
4136 return insn_id
< label_id
;
4139 /* On some machines, a function with no call insns
4140 can run faster if it doesn't create its own register window.
4141 When output, the leaf function should use only the "output"
4142 registers. Ordinarily, the function would be compiled to use
4143 the "input" registers to find its arguments; it is a candidate
4144 for leaf treatment if it uses only the "input" registers.
4145 Leaf function treatment means renumbering so the function
4146 uses the "output" registers instead. */
4148 #ifdef LEAF_REGISTERS
4150 /* Return 1 if this function uses only the registers that can be
4151 safely renumbered. */
4154 only_leaf_regs_used (void)
4157 const char *const permitted_reg_in_leaf_functions
= LEAF_REGISTERS
;
4159 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4160 if ((df_regs_ever_live_p (i
) || global_regs
[i
])
4161 && ! permitted_reg_in_leaf_functions
[i
])
4164 if (crtl
->uses_pic_offset_table
4165 && pic_offset_table_rtx
!= 0
4166 && REG_P (pic_offset_table_rtx
)
4167 && ! permitted_reg_in_leaf_functions
[REGNO (pic_offset_table_rtx
)])
4173 /* Scan all instructions and renumber all registers into those
4174 available in leaf functions. */
4177 leaf_renumber_regs (rtx first
)
4181 /* Renumber only the actual patterns.
4182 The reg-notes can contain frame pointer refs,
4183 and renumbering them could crash, and should not be needed. */
4184 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
4186 leaf_renumber_regs_insn (PATTERN (insn
));
4187 for (insn
= crtl
->epilogue_delay_list
;
4189 insn
= XEXP (insn
, 1))
4190 if (INSN_P (XEXP (insn
, 0)))
4191 leaf_renumber_regs_insn (PATTERN (XEXP (insn
, 0)));
4194 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4195 available in leaf functions. */
4198 leaf_renumber_regs_insn (rtx in_rtx
)
4201 const char *format_ptr
;
4206 /* Renumber all input-registers into output-registers.
4207 renumbered_regs would be 1 for an output-register;
4214 /* Don't renumber the same reg twice. */
4218 newreg
= REGNO (in_rtx
);
4219 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4220 to reach here as part of a REG_NOTE. */
4221 if (newreg
>= FIRST_PSEUDO_REGISTER
)
4226 newreg
= LEAF_REG_REMAP (newreg
);
4227 gcc_assert (newreg
>= 0);
4228 df_set_regs_ever_live (REGNO (in_rtx
), false);
4229 df_set_regs_ever_live (newreg
, true);
4230 SET_REGNO (in_rtx
, newreg
);
4234 if (INSN_P (in_rtx
))
4236 /* Inside a SEQUENCE, we find insns.
4237 Renumber just the patterns of these insns,
4238 just as we do for the top-level insns. */
4239 leaf_renumber_regs_insn (PATTERN (in_rtx
));
4243 format_ptr
= GET_RTX_FORMAT (GET_CODE (in_rtx
));
4245 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (in_rtx
)); i
++)
4246 switch (*format_ptr
++)
4249 leaf_renumber_regs_insn (XEXP (in_rtx
, i
));
4253 if (NULL
!= XVEC (in_rtx
, i
))
4255 for (j
= 0; j
< XVECLEN (in_rtx
, i
); j
++)
4256 leaf_renumber_regs_insn (XVECEXP (in_rtx
, i
, j
));
4275 /* Turn the RTL into assembly. */
4277 rest_of_handle_final (void)
4282 /* Get the function's name, as described by its RTL. This may be
4283 different from the DECL_NAME name used in the source file. */
4285 x
= DECL_RTL (current_function_decl
);
4286 gcc_assert (MEM_P (x
));
4288 gcc_assert (GET_CODE (x
) == SYMBOL_REF
);
4289 fnname
= XSTR (x
, 0);
4291 assemble_start_function (current_function_decl
, fnname
);
4292 final_start_function (get_insns (), asm_out_file
, optimize
);
4293 final (get_insns (), asm_out_file
, optimize
);
4294 final_end_function ();
4296 /* The IA-64 ".handlerdata" directive must be issued before the ".endp"
4297 directive that closes the procedure descriptor. Similarly, for x64 SEH.
4298 Otherwise it's not strictly necessary, but it doesn't hurt either. */
4299 output_function_exception_table (fnname
);
4301 assemble_end_function (current_function_decl
, fnname
);
4303 user_defined_section_attribute
= false;
4305 /* Free up reg info memory. */
4309 fflush (asm_out_file
);
4311 /* Write DBX symbols if requested. */
4313 /* Note that for those inline functions where we don't initially
4314 know for certain that we will be generating an out-of-line copy,
4315 the first invocation of this routine (rest_of_compilation) will
4316 skip over this code by doing a `goto exit_rest_of_compilation;'.
4317 Later on, wrapup_global_declarations will (indirectly) call
4318 rest_of_compilation again for those inline functions that need
4319 to have out-of-line copies generated. During that call, we
4320 *will* be routed past here. */
4322 timevar_push (TV_SYMOUT
);
4323 if (!DECL_IGNORED_P (current_function_decl
))
4324 debug_hooks
->function_decl (current_function_decl
);
4325 timevar_pop (TV_SYMOUT
);
4327 /* Release the blocks that are linked to DECL_INITIAL() to free the memory. */
4328 DECL_INITIAL (current_function_decl
) = error_mark_node
;
4330 if (DECL_STATIC_CONSTRUCTOR (current_function_decl
)
4331 && targetm
.have_ctors_dtors
)
4332 targetm
.asm_out
.constructor (XEXP (DECL_RTL (current_function_decl
), 0),
4333 decl_init_priority_lookup
4334 (current_function_decl
));
4335 if (DECL_STATIC_DESTRUCTOR (current_function_decl
)
4336 && targetm
.have_ctors_dtors
)
4337 targetm
.asm_out
.destructor (XEXP (DECL_RTL (current_function_decl
), 0),
4338 decl_fini_priority_lookup
4339 (current_function_decl
));
4343 struct rtl_opt_pass pass_final
=
4348 OPTGROUP_NONE
, /* optinfo_flags */
4350 rest_of_handle_final
, /* execute */
4353 0, /* static_pass_number */
4354 TV_FINAL
, /* tv_id */
4355 0, /* properties_required */
4356 0, /* properties_provided */
4357 0, /* properties_destroyed */
4358 0, /* todo_flags_start */
4359 TODO_ggc_collect
/* todo_flags_finish */
4365 rest_of_handle_shorten_branches (void)
4367 /* Shorten branches. */
4368 shorten_branches (get_insns ());
4372 struct rtl_opt_pass pass_shorten_branches
=
4376 "shorten", /* name */
4377 OPTGROUP_NONE
, /* optinfo_flags */
4379 rest_of_handle_shorten_branches
, /* execute */
4382 0, /* static_pass_number */
4383 TV_SHORTEN_BRANCH
, /* tv_id */
4384 0, /* properties_required */
4385 0, /* properties_provided */
4386 0, /* properties_destroyed */
4387 0, /* todo_flags_start */
4388 0 /* todo_flags_finish */
4394 rest_of_clean_state (void)
4397 FILE *final_output
= NULL
;
4398 int save_unnumbered
= flag_dump_unnumbered
;
4399 int save_noaddr
= flag_dump_noaddr
;
4401 if (flag_dump_final_insns
)
4403 final_output
= fopen (flag_dump_final_insns
, "a");
4406 error ("could not open final insn dump file %qs: %m",
4407 flag_dump_final_insns
);
4408 flag_dump_final_insns
= NULL
;
4412 flag_dump_noaddr
= flag_dump_unnumbered
= 1;
4413 if (flag_compare_debug_opt
|| flag_compare_debug
)
4414 dump_flags
|= TDF_NOUID
;
4415 dump_function_header (final_output
, current_function_decl
,
4417 final_insns_dump_p
= true;
4419 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4421 INSN_UID (insn
) = CODE_LABEL_NUMBER (insn
);
4425 set_block_for_insn (insn
, NULL
);
4426 INSN_UID (insn
) = 0;
4431 /* It is very important to decompose the RTL instruction chain here:
4432 debug information keeps pointing into CODE_LABEL insns inside the function
4433 body. If these remain pointing to the other insns, we end up preserving
4434 whole RTL chain and attached detailed debug info in memory. */
4435 for (insn
= get_insns (); insn
; insn
= next
)
4437 next
= NEXT_INSN (insn
);
4438 NEXT_INSN (insn
) = NULL
;
4439 PREV_INSN (insn
) = NULL
;
4442 && (!NOTE_P (insn
) ||
4443 (NOTE_KIND (insn
) != NOTE_INSN_VAR_LOCATION
4444 && NOTE_KIND (insn
) != NOTE_INSN_CALL_ARG_LOCATION
4445 && NOTE_KIND (insn
) != NOTE_INSN_BLOCK_BEG
4446 && NOTE_KIND (insn
) != NOTE_INSN_BLOCK_END
4447 && NOTE_KIND (insn
) != NOTE_INSN_DELETED_DEBUG_LABEL
)))
4448 print_rtl_single (final_output
, insn
);
4453 flag_dump_noaddr
= save_noaddr
;
4454 flag_dump_unnumbered
= save_unnumbered
;
4455 final_insns_dump_p
= false;
4457 if (fclose (final_output
))
4459 error ("could not close final insn dump file %qs: %m",
4460 flag_dump_final_insns
);
4461 flag_dump_final_insns
= NULL
;
4465 /* In case the function was not output,
4466 don't leave any temporary anonymous types
4467 queued up for sdb output. */
4468 #ifdef SDB_DEBUGGING_INFO
4469 if (write_symbols
== SDB_DEBUG
)
4470 sdbout_types (NULL_TREE
);
4473 flag_rerun_cse_after_global_opts
= 0;
4474 reload_completed
= 0;
4475 epilogue_completed
= 0;
4477 regstack_completed
= 0;
4480 /* Clear out the insn_length contents now that they are no
4482 init_insn_lengths ();
4484 /* Show no temporary slots allocated. */
4487 free_bb_for_insn ();
4491 /* We can reduce stack alignment on call site only when we are sure that
4492 the function body just produced will be actually used in the final
4494 if (decl_binds_to_current_def_p (current_function_decl
))
4496 unsigned int pref
= crtl
->preferred_stack_boundary
;
4497 if (crtl
->stack_alignment_needed
> crtl
->preferred_stack_boundary
)
4498 pref
= crtl
->stack_alignment_needed
;
4499 cgraph_rtl_info (current_function_decl
)->preferred_incoming_stack_boundary
4503 /* Make sure volatile mem refs aren't considered valid operands for
4504 arithmetic insns. We must call this here if this is a nested inline
4505 function, since the above code leaves us in the init_recog state,
4506 and the function context push/pop code does not save/restore volatile_ok.
4508 ??? Maybe it isn't necessary for expand_start_function to call this
4509 anymore if we do it here? */
4511 init_recog_no_volatile ();
4513 /* We're done with this function. Free up memory if we can. */
4514 free_after_parsing (cfun
);
4515 free_after_compilation (cfun
);
4519 struct rtl_opt_pass pass_clean_state
=
4523 "*clean_state", /* name */
4524 OPTGROUP_NONE
, /* optinfo_flags */
4526 rest_of_clean_state
, /* execute */
4529 0, /* static_pass_number */
4530 TV_FINAL
, /* tv_id */
4531 0, /* properties_required */
4532 0, /* properties_provided */
4533 PROP_rtl
, /* properties_destroyed */
4534 0, /* todo_flags_start */
4535 0 /* todo_flags_finish */