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, 2010
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This is the final pass of the compiler.
23 It looks at the rtl code for a function and outputs assembler code.
25 Call `final_start_function' to output the assembler code for function entry,
26 `final' to output assembler code for some RTL code,
27 `final_end_function' to output assembler code for function exit.
28 If a function is compiled in several pieces, each piece is
29 output separately with `final'.
31 Some optimizations are also done at this level.
32 Move instructions that were made unnecessary by good register allocation
33 are detected and omitted from the output. (Though most of these
34 are removed by the last jump pass.)
36 Instructions to set the condition codes are omitted when it can be
37 seen that the condition codes already had the desired values.
39 In some cases it is sufficient if the inherited condition codes
40 have related values, but this may require the following insn
41 (the one that tests the condition codes) to be modified.
43 The code for the function prologue and epilogue are generated
44 directly in assembler by the target functions function_prologue and
45 function_epilogue. Those instructions never exist as rtl. */
49 #include "coretypes.h"
56 #include "insn-config.h"
57 #include "insn-attr.h"
59 #include "conditions.h"
61 #include "hard-reg-set.h"
68 #include "basic-block.h"
72 #include "cfglayout.h"
73 #include "tree-pass.h"
74 #include "tree-flow.h"
84 #ifdef XCOFF_DEBUGGING_INFO
85 #include "xcoffout.h" /* Needed for external data
86 declarations for e.g. AIX 4.x. */
89 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
90 #include "dwarf2out.h"
93 #ifdef DBX_DEBUGGING_INFO
97 #ifdef SDB_DEBUGGING_INFO
101 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
102 null default for it to save conditionalization later. */
103 #ifndef CC_STATUS_INIT
104 #define CC_STATUS_INIT
107 /* How to start an assembler comment. */
108 #ifndef ASM_COMMENT_START
109 #define ASM_COMMENT_START ";#"
112 /* Is the given character a logical line separator for the assembler? */
113 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
114 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C, STR) ((C) == ';')
117 #ifndef JUMP_TABLES_IN_TEXT_SECTION
118 #define JUMP_TABLES_IN_TEXT_SECTION 0
121 /* Bitflags used by final_scan_insn. */
124 #define SEEN_EMITTED 4
126 /* Last insn processed by final_scan_insn. */
127 static rtx debug_insn
;
128 rtx current_output_insn
;
130 /* Line number of last NOTE. */
131 static int last_linenum
;
133 /* Last discriminator written to assembly. */
134 static int last_discriminator
;
136 /* Discriminator of current block. */
137 static int discriminator
;
139 /* Highest line number in current block. */
140 static int high_block_linenum
;
142 /* Likewise for function. */
143 static int high_function_linenum
;
145 /* Filename of last NOTE. */
146 static const char *last_filename
;
148 /* Override filename and line number. */
149 static const char *override_filename
;
150 static int override_linenum
;
152 /* Whether to force emission of a line note before the next insn. */
153 static bool force_source_line
= false;
155 extern const int length_unit_log
; /* This is defined in insn-attrtab.c. */
157 /* Nonzero while outputting an `asm' with operands.
158 This means that inconsistencies are the user's fault, so don't die.
159 The precise value is the insn being output, to pass to error_for_asm. */
160 rtx this_is_asm_operands
;
162 /* Number of operands of this insn, for an `asm' with operands. */
163 static unsigned int insn_noperands
;
165 /* Compare optimization flag. */
167 static rtx last_ignored_compare
= 0;
169 /* Assign a unique number to each insn that is output.
170 This can be used to generate unique local labels. */
172 static int insn_counter
= 0;
175 /* This variable contains machine-dependent flags (defined in tm.h)
176 set and examined by output routines
177 that describe how to interpret the condition codes properly. */
181 /* During output of an insn, this contains a copy of cc_status
182 from before the insn. */
184 CC_STATUS cc_prev_status
;
187 /* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen. */
189 static int block_depth
;
191 /* Nonzero if have enabled APP processing of our assembler output. */
195 /* If we are outputting an insn sequence, this contains the sequence rtx.
200 #ifdef ASSEMBLER_DIALECT
202 /* Number of the assembler dialect to use, starting at 0. */
203 static int dialect_number
;
206 /* Nonnull if the insn currently being emitted was a COND_EXEC pattern. */
207 rtx current_insn_predicate
;
209 /* True if printing into -fdump-final-insns= dump. */
210 bool final_insns_dump_p
;
212 #ifdef HAVE_ATTR_length
213 static int asm_insn_count (rtx
);
215 static void profile_function (FILE *);
216 static void profile_after_prologue (FILE *);
217 static bool notice_source_line (rtx
, bool *);
218 static rtx
walk_alter_subreg (rtx
*, bool *);
219 static void output_asm_name (void);
220 static void output_alternate_entry_point (FILE *, rtx
);
221 static tree
get_mem_expr_from_op (rtx
, int *);
222 static void output_asm_operand_names (rtx
*, int *, int);
223 #ifdef LEAF_REGISTERS
224 static void leaf_renumber_regs (rtx
);
227 static int alter_cond (rtx
);
229 #ifndef ADDR_VEC_ALIGN
230 static int final_addr_vec_align (rtx
);
232 #ifdef HAVE_ATTR_length
233 static int align_fuzz (rtx
, rtx
, int, unsigned);
236 /* Initialize data in final at the beginning of a compilation. */
239 init_final (const char *filename ATTRIBUTE_UNUSED
)
244 #ifdef ASSEMBLER_DIALECT
245 dialect_number
= ASSEMBLER_DIALECT
;
249 /* Default target function prologue and epilogue assembler output.
251 If not overridden for epilogue code, then the function body itself
252 contains return instructions wherever needed. */
254 default_function_pro_epilogue (FILE *file ATTRIBUTE_UNUSED
,
255 HOST_WIDE_INT size ATTRIBUTE_UNUSED
)
259 /* Default target hook that outputs nothing to a stream. */
261 no_asm_to_stream (FILE *file ATTRIBUTE_UNUSED
)
265 /* Enable APP processing of subsequent output.
266 Used before the output from an `asm' statement. */
273 fputs (ASM_APP_ON
, asm_out_file
);
278 /* Disable APP processing of subsequent output.
279 Called from varasm.c before most kinds of output. */
286 fputs (ASM_APP_OFF
, asm_out_file
);
291 /* Return the number of slots filled in the current
292 delayed branch sequence (we don't count the insn needing the
293 delay slot). Zero if not in a delayed branch sequence. */
297 dbr_sequence_length (void)
299 if (final_sequence
!= 0)
300 return XVECLEN (final_sequence
, 0) - 1;
306 /* The next two pages contain routines used to compute the length of an insn
307 and to shorten branches. */
309 /* Arrays for insn lengths, and addresses. The latter is referenced by
310 `insn_current_length'. */
312 static int *insn_lengths
;
314 VEC(int,heap
) *insn_addresses_
;
316 /* Max uid for which the above arrays are valid. */
317 static int insn_lengths_max_uid
;
319 /* Address of insn being processed. Used by `insn_current_length'. */
320 int insn_current_address
;
322 /* Address of insn being processed in previous iteration. */
323 int insn_last_address
;
325 /* known invariant alignment of insn being processed. */
326 int insn_current_align
;
328 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
329 gives the next following alignment insn that increases the known
330 alignment, or NULL_RTX if there is no such insn.
331 For any alignment obtained this way, we can again index uid_align with
332 its uid to obtain the next following align that in turn increases the
333 alignment, till we reach NULL_RTX; the sequence obtained this way
334 for each insn we'll call the alignment chain of this insn in the following
337 struct label_alignment
343 static rtx
*uid_align
;
344 static int *uid_shuid
;
345 static struct label_alignment
*label_align
;
347 /* Indicate that branch shortening hasn't yet been done. */
350 init_insn_lengths (void)
361 insn_lengths_max_uid
= 0;
363 #ifdef HAVE_ATTR_length
364 INSN_ADDRESSES_FREE ();
373 /* Obtain the current length of an insn. If branch shortening has been done,
374 get its actual length. Otherwise, use FALLBACK_FN to calculate the
377 get_attr_length_1 (rtx insn ATTRIBUTE_UNUSED
,
378 int (*fallback_fn
) (rtx
) ATTRIBUTE_UNUSED
)
380 #ifdef HAVE_ATTR_length
385 if (insn_lengths_max_uid
> INSN_UID (insn
))
386 return insn_lengths
[INSN_UID (insn
)];
388 switch (GET_CODE (insn
))
397 length
= fallback_fn (insn
);
401 body
= PATTERN (insn
);
402 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
404 /* Alignment is machine-dependent and should be handled by
408 length
= fallback_fn (insn
);
412 body
= PATTERN (insn
);
413 if (GET_CODE (body
) == USE
|| GET_CODE (body
) == CLOBBER
)
416 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
417 length
= asm_insn_count (body
) * fallback_fn (insn
);
418 else if (GET_CODE (body
) == SEQUENCE
)
419 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
420 length
+= get_attr_length_1 (XVECEXP (body
, 0, i
), fallback_fn
);
422 length
= fallback_fn (insn
);
429 #ifdef ADJUST_INSN_LENGTH
430 ADJUST_INSN_LENGTH (insn
, length
);
433 #else /* not HAVE_ATTR_length */
435 #define insn_default_length 0
436 #define insn_min_length 0
437 #endif /* not HAVE_ATTR_length */
440 /* Obtain the current length of an insn. If branch shortening has been done,
441 get its actual length. Otherwise, get its maximum length. */
443 get_attr_length (rtx insn
)
445 return get_attr_length_1 (insn
, insn_default_length
);
448 /* Obtain the current length of an insn. If branch shortening has been done,
449 get its actual length. Otherwise, get its minimum length. */
451 get_attr_min_length (rtx insn
)
453 return get_attr_length_1 (insn
, insn_min_length
);
456 /* Code to handle alignment inside shorten_branches. */
458 /* Here is an explanation how the algorithm in align_fuzz can give
461 Call a sequence of instructions beginning with alignment point X
462 and continuing until the next alignment point `block X'. When `X'
463 is used in an expression, it means the alignment value of the
466 Call the distance between the start of the first insn of block X, and
467 the end of the last insn of block X `IX', for the `inner size of X'.
468 This is clearly the sum of the instruction lengths.
470 Likewise with the next alignment-delimited block following X, which we
473 Call the distance between the start of the first insn of block X, and
474 the start of the first insn of block Y `OX', for the `outer size of X'.
476 The estimated padding is then OX - IX.
478 OX can be safely estimated as
483 OX = round_up(IX, X) + Y - X
485 Clearly est(IX) >= real(IX), because that only depends on the
486 instruction lengths, and those being overestimated is a given.
488 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
489 we needn't worry about that when thinking about OX.
491 When X >= Y, the alignment provided by Y adds no uncertainty factor
492 for branch ranges starting before X, so we can just round what we have.
493 But when X < Y, we don't know anything about the, so to speak,
494 `middle bits', so we have to assume the worst when aligning up from an
495 address mod X to one mod Y, which is Y - X. */
498 #define LABEL_ALIGN(LABEL) align_labels_log
501 #ifndef LABEL_ALIGN_MAX_SKIP
502 #define LABEL_ALIGN_MAX_SKIP align_labels_max_skip
506 #define LOOP_ALIGN(LABEL) align_loops_log
509 #ifndef LOOP_ALIGN_MAX_SKIP
510 #define LOOP_ALIGN_MAX_SKIP align_loops_max_skip
513 #ifndef LABEL_ALIGN_AFTER_BARRIER
514 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
517 #ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
518 #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP 0
522 #define JUMP_ALIGN(LABEL) align_jumps_log
525 #ifndef JUMP_ALIGN_MAX_SKIP
526 #define JUMP_ALIGN_MAX_SKIP align_jumps_max_skip
529 #ifndef ADDR_VEC_ALIGN
531 final_addr_vec_align (rtx addr_vec
)
533 int align
= GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec
)));
535 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
536 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
537 return exact_log2 (align
);
541 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
544 #ifndef INSN_LENGTH_ALIGNMENT
545 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
548 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
550 static int min_labelno
, max_labelno
;
552 #define LABEL_TO_ALIGNMENT(LABEL) \
553 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
555 #define LABEL_TO_MAX_SKIP(LABEL) \
556 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
558 /* For the benefit of port specific code do this also as a function. */
561 label_to_alignment (rtx label
)
563 if (CODE_LABEL_NUMBER (label
) <= max_labelno
)
564 return LABEL_TO_ALIGNMENT (label
);
569 label_to_max_skip (rtx label
)
571 if (CODE_LABEL_NUMBER (label
) <= max_labelno
)
572 return LABEL_TO_MAX_SKIP (label
);
576 #ifdef HAVE_ATTR_length
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));
679 #endif /* HAVE_ATTR_length */
681 /* Compute branch alignments based on frequency information in the
685 compute_alignments (void)
687 int log
, max_skip
, max_log
;
690 int freq_threshold
= 0;
698 max_labelno
= max_label_num ();
699 min_labelno
= get_first_label_num ();
700 label_align
= XCNEWVEC (struct label_alignment
, max_labelno
- min_labelno
+ 1);
702 /* If not optimizing or optimizing for size, don't assign any alignments. */
703 if (! optimize
|| optimize_function_for_size_p (cfun
))
708 dump_flow_info (dump_file
, TDF_DETAILS
);
709 flow_loops_dump (dump_file
, NULL
, 1);
710 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
, bb
->loop_depth
);
734 max_log
= LABEL_ALIGN (label
);
735 max_skip
= LABEL_ALIGN_MAX_SKIP
;
737 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
739 if (e
->flags
& EDGE_FALLTHRU
)
740 has_fallthru
= 1, fallthru_frequency
+= EDGE_FREQUENCY (e
);
742 branch_frequency
+= EDGE_FREQUENCY (e
);
746 fprintf(dump_file
, "BB %4i freq %4i loop %2i loop_depth %2i fall %4i branch %4i",
747 bb
->index
, bb
->frequency
, bb
->loop_father
->num
,
749 fallthru_frequency
, branch_frequency
);
750 if (!bb
->loop_father
->inner
&& bb
->loop_father
->num
)
751 fprintf (dump_file
, " inner_loop");
752 if (bb
->loop_father
->header
== bb
)
753 fprintf (dump_file
, " loop_header");
754 fprintf (dump_file
, "\n");
757 /* There are two purposes to align block with no fallthru incoming edge:
758 1) to avoid fetch stalls when branch destination is near cache boundary
759 2) to improve cache efficiency in case the previous block is not executed
760 (so it does not need to be in the cache).
762 We to catch first case, we align frequently executed blocks.
763 To catch the second, we align blocks that are executed more frequently
764 than the predecessor and the predecessor is likely to not be executed
765 when function is called. */
768 && (branch_frequency
> freq_threshold
769 || (bb
->frequency
> bb
->prev_bb
->frequency
* 10
770 && (bb
->prev_bb
->frequency
771 <= ENTRY_BLOCK_PTR
->frequency
/ 2))))
773 log
= JUMP_ALIGN (label
);
775 fprintf(dump_file
, " jump alignment added.\n");
779 max_skip
= JUMP_ALIGN_MAX_SKIP
;
782 /* In case block is frequent and reached mostly by non-fallthru edge,
783 align it. It is most likely a first block of loop. */
785 && optimize_bb_for_speed_p (bb
)
786 && branch_frequency
+ fallthru_frequency
> freq_threshold
788 > fallthru_frequency
* PARAM_VALUE (PARAM_ALIGN_LOOP_ITERATIONS
)))
790 log
= LOOP_ALIGN (label
);
792 fprintf(dump_file
, " internal loop alignment added.\n");
796 max_skip
= LOOP_ALIGN_MAX_SKIP
;
799 LABEL_TO_ALIGNMENT (label
) = max_log
;
800 LABEL_TO_MAX_SKIP (label
) = max_skip
;
805 loop_optimizer_finalize ();
806 free_dominance_info (CDI_DOMINATORS
);
811 struct rtl_opt_pass pass_compute_alignments
=
815 "alignments", /* name */
817 compute_alignments
, /* execute */
820 0, /* static_pass_number */
822 0, /* properties_required */
823 0, /* properties_provided */
824 0, /* properties_destroyed */
825 0, /* todo_flags_start */
826 TODO_dump_func
| TODO_verify_rtl_sharing
827 | TODO_ggc_collect
/* todo_flags_finish */
832 /* Make a pass over all insns and compute their actual lengths by shortening
833 any branches of variable length if possible. */
835 /* shorten_branches might be called multiple times: for example, the SH
836 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
837 In order to do this, it needs proper length information, which it obtains
838 by calling shorten_branches. This cannot be collapsed with
839 shorten_branches itself into a single pass unless we also want to integrate
840 reorg.c, since the branch splitting exposes new instructions with delay
844 shorten_branches (rtx first ATTRIBUTE_UNUSED
)
851 #ifdef HAVE_ATTR_length
852 #define MAX_CODE_ALIGN 16
854 int something_changed
= 1;
855 char *varying_length
;
858 rtx align_tab
[MAX_CODE_ALIGN
];
862 /* Compute maximum UID and allocate label_align / uid_shuid. */
863 max_uid
= get_max_uid ();
865 /* Free uid_shuid before reallocating it. */
868 uid_shuid
= XNEWVEC (int, max_uid
);
870 if (max_labelno
!= max_label_num ())
872 int old
= max_labelno
;
876 max_labelno
= max_label_num ();
878 n_labels
= max_labelno
- min_labelno
+ 1;
879 n_old_labels
= old
- min_labelno
+ 1;
881 label_align
= XRESIZEVEC (struct label_alignment
, label_align
, n_labels
);
883 /* Range of labels grows monotonically in the function. Failing here
884 means that the initialization of array got lost. */
885 gcc_assert (n_old_labels
<= n_labels
);
887 memset (label_align
+ n_old_labels
, 0,
888 (n_labels
- n_old_labels
) * sizeof (struct label_alignment
));
891 /* Initialize label_align and set up uid_shuid to be strictly
892 monotonically rising with insn order. */
893 /* We use max_log here to keep track of the maximum alignment we want to
894 impose on the next CODE_LABEL (or the current one if we are processing
895 the CODE_LABEL itself). */
900 for (insn
= get_insns (), i
= 1; insn
; insn
= NEXT_INSN (insn
))
904 INSN_SHUID (insn
) = i
++;
911 bool next_is_jumptable
;
913 /* Merge in alignments computed by compute_alignments. */
914 log
= LABEL_TO_ALIGNMENT (insn
);
918 max_skip
= LABEL_TO_MAX_SKIP (insn
);
921 next
= next_nonnote_insn (insn
);
922 next_is_jumptable
= next
&& JUMP_TABLE_DATA_P (next
);
923 if (!next_is_jumptable
)
925 log
= LABEL_ALIGN (insn
);
929 max_skip
= LABEL_ALIGN_MAX_SKIP
;
932 /* ADDR_VECs only take room if read-only data goes into the text
934 if ((JUMP_TABLES_IN_TEXT_SECTION
935 || readonly_data_section
== text_section
)
936 && next_is_jumptable
)
938 log
= ADDR_VEC_ALIGN (next
);
942 max_skip
= LABEL_ALIGN_MAX_SKIP
;
945 LABEL_TO_ALIGNMENT (insn
) = max_log
;
946 LABEL_TO_MAX_SKIP (insn
) = max_skip
;
950 else if (BARRIER_P (insn
))
954 for (label
= insn
; label
&& ! INSN_P (label
);
955 label
= NEXT_INSN (label
))
958 log
= LABEL_ALIGN_AFTER_BARRIER (insn
);
962 max_skip
= LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
;
968 #ifdef HAVE_ATTR_length
970 /* Allocate the rest of the arrays. */
971 insn_lengths
= XNEWVEC (int, max_uid
);
972 insn_lengths_max_uid
= max_uid
;
973 /* Syntax errors can lead to labels being outside of the main insn stream.
974 Initialize insn_addresses, so that we get reproducible results. */
975 INSN_ADDRESSES_ALLOC (max_uid
);
977 varying_length
= XCNEWVEC (char, max_uid
);
979 /* Initialize uid_align. We scan instructions
980 from end to start, and keep in align_tab[n] the last seen insn
981 that does an alignment of at least n+1, i.e. the successor
982 in the alignment chain for an insn that does / has a known
984 uid_align
= XCNEWVEC (rtx
, max_uid
);
986 for (i
= MAX_CODE_ALIGN
; --i
>= 0;)
987 align_tab
[i
] = NULL_RTX
;
988 seq
= get_last_insn ();
989 for (; seq
; seq
= PREV_INSN (seq
))
991 int uid
= INSN_UID (seq
);
993 log
= (LABEL_P (seq
) ? LABEL_TO_ALIGNMENT (seq
) : 0);
994 uid_align
[uid
] = align_tab
[0];
997 /* Found an alignment label. */
998 uid_align
[uid
] = align_tab
[log
];
999 for (i
= log
- 1; i
>= 0; i
--)
1003 #ifdef CASE_VECTOR_SHORTEN_MODE
1006 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1009 int min_shuid
= INSN_SHUID (get_insns ()) - 1;
1010 int max_shuid
= INSN_SHUID (get_last_insn ()) + 1;
1013 for (insn
= first
; insn
!= 0; insn
= NEXT_INSN (insn
))
1015 rtx min_lab
= NULL_RTX
, max_lab
= NULL_RTX
, pat
;
1016 int len
, i
, min
, max
, insn_shuid
;
1018 addr_diff_vec_flags flags
;
1021 || GET_CODE (PATTERN (insn
)) != ADDR_DIFF_VEC
)
1023 pat
= PATTERN (insn
);
1024 len
= XVECLEN (pat
, 1);
1025 gcc_assert (len
> 0);
1026 min_align
= MAX_CODE_ALIGN
;
1027 for (min
= max_shuid
, max
= min_shuid
, i
= len
- 1; i
>= 0; i
--)
1029 rtx lab
= XEXP (XVECEXP (pat
, 1, i
), 0);
1030 int shuid
= INSN_SHUID (lab
);
1041 if (min_align
> LABEL_TO_ALIGNMENT (lab
))
1042 min_align
= LABEL_TO_ALIGNMENT (lab
);
1044 XEXP (pat
, 2) = gen_rtx_LABEL_REF (Pmode
, min_lab
);
1045 XEXP (pat
, 3) = gen_rtx_LABEL_REF (Pmode
, max_lab
);
1046 insn_shuid
= INSN_SHUID (insn
);
1047 rel
= INSN_SHUID (XEXP (XEXP (pat
, 0), 0));
1048 memset (&flags
, 0, sizeof (flags
));
1049 flags
.min_align
= min_align
;
1050 flags
.base_after_vec
= rel
> insn_shuid
;
1051 flags
.min_after_vec
= min
> insn_shuid
;
1052 flags
.max_after_vec
= max
> insn_shuid
;
1053 flags
.min_after_base
= min
> rel
;
1054 flags
.max_after_base
= max
> rel
;
1055 ADDR_DIFF_VEC_FLAGS (pat
) = flags
;
1058 #endif /* CASE_VECTOR_SHORTEN_MODE */
1060 /* Compute initial lengths, addresses, and varying flags for each insn. */
1061 for (insn_current_address
= 0, insn
= first
;
1063 insn_current_address
+= insn_lengths
[uid
], insn
= NEXT_INSN (insn
))
1065 uid
= INSN_UID (insn
);
1067 insn_lengths
[uid
] = 0;
1071 int log
= LABEL_TO_ALIGNMENT (insn
);
1074 int align
= 1 << log
;
1075 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1076 insn_lengths
[uid
] = new_address
- insn_current_address
;
1080 INSN_ADDRESSES (uid
) = insn_current_address
+ insn_lengths
[uid
];
1082 if (NOTE_P (insn
) || BARRIER_P (insn
)
1083 || LABEL_P (insn
) || DEBUG_INSN_P(insn
))
1085 if (INSN_DELETED_P (insn
))
1088 body
= PATTERN (insn
);
1089 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
1091 /* This only takes room if read-only data goes into the text
1093 if (JUMP_TABLES_IN_TEXT_SECTION
1094 || readonly_data_section
== text_section
)
1095 insn_lengths
[uid
] = (XVECLEN (body
,
1096 GET_CODE (body
) == ADDR_DIFF_VEC
)
1097 * GET_MODE_SIZE (GET_MODE (body
)));
1098 /* Alignment is handled by ADDR_VEC_ALIGN. */
1100 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
1101 insn_lengths
[uid
] = asm_insn_count (body
) * insn_default_length (insn
);
1102 else if (GET_CODE (body
) == SEQUENCE
)
1105 int const_delay_slots
;
1107 const_delay_slots
= const_num_delay_slots (XVECEXP (body
, 0, 0));
1109 const_delay_slots
= 0;
1111 /* Inside a delay slot sequence, we do not do any branch shortening
1112 if the shortening could change the number of delay slots
1114 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1116 rtx inner_insn
= XVECEXP (body
, 0, i
);
1117 int inner_uid
= INSN_UID (inner_insn
);
1120 if (GET_CODE (body
) == ASM_INPUT
1121 || asm_noperands (PATTERN (XVECEXP (body
, 0, i
))) >= 0)
1122 inner_length
= (asm_insn_count (PATTERN (inner_insn
))
1123 * insn_default_length (inner_insn
));
1125 inner_length
= insn_default_length (inner_insn
);
1127 insn_lengths
[inner_uid
] = inner_length
;
1128 if (const_delay_slots
)
1130 if ((varying_length
[inner_uid
]
1131 = insn_variable_length_p (inner_insn
)) != 0)
1132 varying_length
[uid
] = 1;
1133 INSN_ADDRESSES (inner_uid
) = (insn_current_address
1134 + insn_lengths
[uid
]);
1137 varying_length
[inner_uid
] = 0;
1138 insn_lengths
[uid
] += inner_length
;
1141 else if (GET_CODE (body
) != USE
&& GET_CODE (body
) != CLOBBER
)
1143 insn_lengths
[uid
] = insn_default_length (insn
);
1144 varying_length
[uid
] = insn_variable_length_p (insn
);
1147 /* If needed, do any adjustment. */
1148 #ifdef ADJUST_INSN_LENGTH
1149 ADJUST_INSN_LENGTH (insn
, insn_lengths
[uid
]);
1150 if (insn_lengths
[uid
] < 0)
1151 fatal_insn ("negative insn length", insn
);
1155 /* Now loop over all the insns finding varying length insns. For each,
1156 get the current insn length. If it has changed, reflect the change.
1157 When nothing changes for a full pass, we are done. */
1159 while (something_changed
)
1161 something_changed
= 0;
1162 insn_current_align
= MAX_CODE_ALIGN
- 1;
1163 for (insn_current_address
= 0, insn
= first
;
1165 insn
= NEXT_INSN (insn
))
1168 #ifdef ADJUST_INSN_LENGTH
1173 uid
= INSN_UID (insn
);
1177 int log
= LABEL_TO_ALIGNMENT (insn
);
1178 if (log
> insn_current_align
)
1180 int align
= 1 << log
;
1181 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1182 insn_lengths
[uid
] = new_address
- insn_current_address
;
1183 insn_current_align
= log
;
1184 insn_current_address
= new_address
;
1187 insn_lengths
[uid
] = 0;
1188 INSN_ADDRESSES (uid
) = insn_current_address
;
1192 length_align
= INSN_LENGTH_ALIGNMENT (insn
);
1193 if (length_align
< insn_current_align
)
1194 insn_current_align
= length_align
;
1196 insn_last_address
= INSN_ADDRESSES (uid
);
1197 INSN_ADDRESSES (uid
) = insn_current_address
;
1199 #ifdef CASE_VECTOR_SHORTEN_MODE
1200 if (optimize
&& JUMP_P (insn
)
1201 && GET_CODE (PATTERN (insn
)) == ADDR_DIFF_VEC
)
1203 rtx body
= PATTERN (insn
);
1204 int old_length
= insn_lengths
[uid
];
1205 rtx rel_lab
= XEXP (XEXP (body
, 0), 0);
1206 rtx min_lab
= XEXP (XEXP (body
, 2), 0);
1207 rtx max_lab
= XEXP (XEXP (body
, 3), 0);
1208 int rel_addr
= INSN_ADDRESSES (INSN_UID (rel_lab
));
1209 int min_addr
= INSN_ADDRESSES (INSN_UID (min_lab
));
1210 int max_addr
= INSN_ADDRESSES (INSN_UID (max_lab
));
1213 addr_diff_vec_flags flags
;
1215 /* Avoid automatic aggregate initialization. */
1216 flags
= ADDR_DIFF_VEC_FLAGS (body
);
1218 /* Try to find a known alignment for rel_lab. */
1219 for (prev
= rel_lab
;
1221 && ! insn_lengths
[INSN_UID (prev
)]
1222 && ! (varying_length
[INSN_UID (prev
)] & 1);
1223 prev
= PREV_INSN (prev
))
1224 if (varying_length
[INSN_UID (prev
)] & 2)
1226 rel_align
= LABEL_TO_ALIGNMENT (prev
);
1230 /* See the comment on addr_diff_vec_flags in rtl.h for the
1231 meaning of the flags values. base: REL_LAB vec: INSN */
1232 /* Anything after INSN has still addresses from the last
1233 pass; adjust these so that they reflect our current
1234 estimate for this pass. */
1235 if (flags
.base_after_vec
)
1236 rel_addr
+= insn_current_address
- insn_last_address
;
1237 if (flags
.min_after_vec
)
1238 min_addr
+= insn_current_address
- insn_last_address
;
1239 if (flags
.max_after_vec
)
1240 max_addr
+= insn_current_address
- insn_last_address
;
1241 /* We want to know the worst case, i.e. lowest possible value
1242 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1243 its offset is positive, and we have to be wary of code shrink;
1244 otherwise, it is negative, and we have to be vary of code
1246 if (flags
.min_after_base
)
1248 /* If INSN is between REL_LAB and MIN_LAB, the size
1249 changes we are about to make can change the alignment
1250 within the observed offset, therefore we have to break
1251 it up into two parts that are independent. */
1252 if (! flags
.base_after_vec
&& flags
.min_after_vec
)
1254 min_addr
-= align_fuzz (rel_lab
, insn
, rel_align
, 0);
1255 min_addr
-= align_fuzz (insn
, min_lab
, 0, 0);
1258 min_addr
-= align_fuzz (rel_lab
, min_lab
, rel_align
, 0);
1262 if (flags
.base_after_vec
&& ! flags
.min_after_vec
)
1264 min_addr
-= align_fuzz (min_lab
, insn
, 0, ~0);
1265 min_addr
-= align_fuzz (insn
, rel_lab
, 0, ~0);
1268 min_addr
-= align_fuzz (min_lab
, rel_lab
, 0, ~0);
1270 /* Likewise, determine the highest lowest possible value
1271 for the offset of MAX_LAB. */
1272 if (flags
.max_after_base
)
1274 if (! flags
.base_after_vec
&& flags
.max_after_vec
)
1276 max_addr
+= align_fuzz (rel_lab
, insn
, rel_align
, ~0);
1277 max_addr
+= align_fuzz (insn
, max_lab
, 0, ~0);
1280 max_addr
+= align_fuzz (rel_lab
, max_lab
, rel_align
, ~0);
1284 if (flags
.base_after_vec
&& ! flags
.max_after_vec
)
1286 max_addr
+= align_fuzz (max_lab
, insn
, 0, 0);
1287 max_addr
+= align_fuzz (insn
, rel_lab
, 0, 0);
1290 max_addr
+= align_fuzz (max_lab
, rel_lab
, 0, 0);
1292 PUT_MODE (body
, CASE_VECTOR_SHORTEN_MODE (min_addr
- rel_addr
,
1293 max_addr
- rel_addr
,
1295 if (JUMP_TABLES_IN_TEXT_SECTION
1296 || readonly_data_section
== text_section
)
1299 = (XVECLEN (body
, 1) * GET_MODE_SIZE (GET_MODE (body
)));
1300 insn_current_address
+= insn_lengths
[uid
];
1301 if (insn_lengths
[uid
] != old_length
)
1302 something_changed
= 1;
1307 #endif /* CASE_VECTOR_SHORTEN_MODE */
1309 if (! (varying_length
[uid
]))
1311 if (NONJUMP_INSN_P (insn
)
1312 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1316 body
= PATTERN (insn
);
1317 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1319 rtx inner_insn
= XVECEXP (body
, 0, i
);
1320 int inner_uid
= INSN_UID (inner_insn
);
1322 INSN_ADDRESSES (inner_uid
) = insn_current_address
;
1324 insn_current_address
+= insn_lengths
[inner_uid
];
1328 insn_current_address
+= insn_lengths
[uid
];
1333 if (NONJUMP_INSN_P (insn
) && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1337 body
= PATTERN (insn
);
1339 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1341 rtx inner_insn
= XVECEXP (body
, 0, i
);
1342 int inner_uid
= INSN_UID (inner_insn
);
1345 INSN_ADDRESSES (inner_uid
) = insn_current_address
;
1347 /* insn_current_length returns 0 for insns with a
1348 non-varying length. */
1349 if (! varying_length
[inner_uid
])
1350 inner_length
= insn_lengths
[inner_uid
];
1352 inner_length
= insn_current_length (inner_insn
);
1354 if (inner_length
!= insn_lengths
[inner_uid
])
1356 insn_lengths
[inner_uid
] = inner_length
;
1357 something_changed
= 1;
1359 insn_current_address
+= insn_lengths
[inner_uid
];
1360 new_length
+= inner_length
;
1365 new_length
= insn_current_length (insn
);
1366 insn_current_address
+= new_length
;
1369 #ifdef ADJUST_INSN_LENGTH
1370 /* If needed, do any adjustment. */
1371 tmp_length
= new_length
;
1372 ADJUST_INSN_LENGTH (insn
, new_length
);
1373 insn_current_address
+= (new_length
- tmp_length
);
1376 if (new_length
!= insn_lengths
[uid
])
1378 insn_lengths
[uid
] = new_length
;
1379 something_changed
= 1;
1382 /* For a non-optimizing compile, do only a single pass. */
1387 free (varying_length
);
1389 #endif /* HAVE_ATTR_length */
1392 #ifdef HAVE_ATTR_length
1393 /* Given the body of an INSN known to be generated by an ASM statement, return
1394 the number of machine instructions likely to be generated for this insn.
1395 This is used to compute its length. */
1398 asm_insn_count (rtx body
)
1402 if (GET_CODE (body
) == ASM_INPUT
)
1403 templ
= XSTR (body
, 0);
1405 templ
= decode_asm_operands (body
, NULL
, NULL
, NULL
, NULL
, NULL
);
1407 return asm_str_count (templ
);
1411 /* Return the number of machine instructions likely to be generated for the
1412 inline-asm template. */
1414 asm_str_count (const char *templ
)
1421 for (; *templ
; templ
++)
1422 if (IS_ASM_LOGICAL_LINE_SEPARATOR (*templ
, templ
)
1429 /* ??? This is probably the wrong place for these. */
1430 /* Structure recording the mapping from source file and directory
1431 names at compile time to those to be embedded in debug
1433 typedef struct debug_prefix_map
1435 const char *old_prefix
;
1436 const char *new_prefix
;
1439 struct debug_prefix_map
*next
;
1442 /* Linked list of such structures. */
1443 debug_prefix_map
*debug_prefix_maps
;
1446 /* Record a debug file prefix mapping. ARG is the argument to
1447 -fdebug-prefix-map and must be of the form OLD=NEW. */
1450 add_debug_prefix_map (const char *arg
)
1452 debug_prefix_map
*map
;
1455 p
= strchr (arg
, '=');
1458 error ("invalid argument %qs to -fdebug-prefix-map", arg
);
1461 map
= XNEW (debug_prefix_map
);
1462 map
->old_prefix
= xstrndup (arg
, p
- arg
);
1463 map
->old_len
= p
- arg
;
1465 map
->new_prefix
= xstrdup (p
);
1466 map
->new_len
= strlen (p
);
1467 map
->next
= debug_prefix_maps
;
1468 debug_prefix_maps
= map
;
1471 /* Perform user-specified mapping of debug filename prefixes. Return
1472 the new name corresponding to FILENAME. */
1475 remap_debug_filename (const char *filename
)
1477 debug_prefix_map
*map
;
1482 for (map
= debug_prefix_maps
; map
; map
= map
->next
)
1483 if (strncmp (filename
, map
->old_prefix
, map
->old_len
) == 0)
1487 name
= filename
+ map
->old_len
;
1488 name_len
= strlen (name
) + 1;
1489 s
= (char *) alloca (name_len
+ map
->new_len
);
1490 memcpy (s
, map
->new_prefix
, map
->new_len
);
1491 memcpy (s
+ map
->new_len
, name
, name_len
);
1492 return ggc_strdup (s
);
1495 /* Return true if DWARF2 debug info can be emitted for DECL. */
1498 dwarf2_debug_info_emitted_p (tree decl
)
1500 if (write_symbols
!= DWARF2_DEBUG
&& write_symbols
!= VMS_AND_DWARF2_DEBUG
)
1503 if (DECL_IGNORED_P (decl
))
1509 /* Output assembler code for the start of a function,
1510 and initialize some of the variables in this file
1511 for the new function. The label for the function and associated
1512 assembler pseudo-ops have already been output in `assemble_start_function'.
1514 FIRST is the first insn of the rtl for the function being compiled.
1515 FILE is the file to write assembler code to.
1516 OPTIMIZE is nonzero if we should eliminate redundant
1517 test and compare insns. */
1520 final_start_function (rtx first ATTRIBUTE_UNUSED
, FILE *file
,
1521 int optimize ATTRIBUTE_UNUSED
)
1525 this_is_asm_operands
= 0;
1527 last_filename
= locator_file (prologue_locator
);
1528 last_linenum
= locator_line (prologue_locator
);
1529 last_discriminator
= discriminator
= 0;
1531 high_block_linenum
= high_function_linenum
= last_linenum
;
1533 if (!DECL_IGNORED_P (current_function_decl
))
1534 debug_hooks
->begin_prologue (last_linenum
, last_filename
);
1536 #if defined (DWARF2_UNWIND_INFO) || defined (TARGET_UNWIND_INFO)
1537 if (!dwarf2_debug_info_emitted_p (current_function_decl
))
1538 dwarf2out_begin_prologue (0, NULL
);
1541 #ifdef LEAF_REG_REMAP
1542 if (current_function_uses_only_leaf_regs
)
1543 leaf_renumber_regs (first
);
1546 /* The Sun386i and perhaps other machines don't work right
1547 if the profiling code comes after the prologue. */
1548 #ifdef PROFILE_BEFORE_PROLOGUE
1550 profile_function (file
);
1551 #endif /* PROFILE_BEFORE_PROLOGUE */
1553 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1554 if (dwarf2out_do_frame ())
1555 dwarf2out_frame_debug (NULL_RTX
, false);
1558 /* If debugging, assign block numbers to all of the blocks in this
1562 reemit_insn_block_notes ();
1563 number_blocks (current_function_decl
);
1564 /* We never actually put out begin/end notes for the top-level
1565 block in the function. But, conceptually, that block is
1567 TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl
)) = 1;
1570 if (warn_frame_larger_than
1571 && get_frame_size () > frame_larger_than_size
)
1573 /* Issue a warning */
1574 warning (OPT_Wframe_larger_than_
,
1575 "the frame size of %wd bytes is larger than %wd bytes",
1576 get_frame_size (), frame_larger_than_size
);
1579 /* First output the function prologue: code to set up the stack frame. */
1580 targetm
.asm_out
.function_prologue (file
, get_frame_size ());
1582 /* If the machine represents the prologue as RTL, the profiling code must
1583 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1584 #ifdef HAVE_prologue
1585 if (! HAVE_prologue
)
1587 profile_after_prologue (file
);
1591 profile_after_prologue (FILE *file ATTRIBUTE_UNUSED
)
1593 #ifndef PROFILE_BEFORE_PROLOGUE
1595 profile_function (file
);
1596 #endif /* not PROFILE_BEFORE_PROLOGUE */
1600 profile_function (FILE *file ATTRIBUTE_UNUSED
)
1602 #ifndef NO_PROFILE_COUNTERS
1603 # define NO_PROFILE_COUNTERS 0
1605 #ifdef ASM_OUTPUT_REG_PUSH
1606 rtx sval
= NULL
, chain
= NULL
;
1608 if (cfun
->returns_struct
)
1609 sval
= targetm
.calls
.struct_value_rtx (TREE_TYPE (current_function_decl
),
1611 if (cfun
->static_chain_decl
)
1612 chain
= targetm
.calls
.static_chain (current_function_decl
, true);
1613 #endif /* ASM_OUTPUT_REG_PUSH */
1615 if (! NO_PROFILE_COUNTERS
)
1617 int align
= MIN (BIGGEST_ALIGNMENT
, LONG_TYPE_SIZE
);
1618 switch_to_section (data_section
);
1619 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
1620 targetm
.asm_out
.internal_label (file
, "LP", current_function_funcdef_no
);
1621 assemble_integer (const0_rtx
, LONG_TYPE_SIZE
/ BITS_PER_UNIT
, align
, 1);
1624 switch_to_section (current_function_section ());
1626 #ifdef ASM_OUTPUT_REG_PUSH
1627 if (sval
&& REG_P (sval
))
1628 ASM_OUTPUT_REG_PUSH (file
, REGNO (sval
));
1629 if (chain
&& REG_P (chain
))
1630 ASM_OUTPUT_REG_PUSH (file
, REGNO (chain
));
1633 FUNCTION_PROFILER (file
, current_function_funcdef_no
);
1635 #ifdef ASM_OUTPUT_REG_PUSH
1636 if (chain
&& REG_P (chain
))
1637 ASM_OUTPUT_REG_POP (file
, REGNO (chain
));
1638 if (sval
&& REG_P (sval
))
1639 ASM_OUTPUT_REG_POP (file
, REGNO (sval
));
1643 /* Output assembler code for the end of a function.
1644 For clarity, args are same as those of `final_start_function'
1645 even though not all of them are needed. */
1648 final_end_function (void)
1652 if (!DECL_IGNORED_P (current_function_decl
))
1653 debug_hooks
->end_function (high_function_linenum
);
1655 /* Finally, output the function epilogue:
1656 code to restore the stack frame and return to the caller. */
1657 targetm
.asm_out
.function_epilogue (asm_out_file
, get_frame_size ());
1659 /* And debug output. */
1660 if (!DECL_IGNORED_P (current_function_decl
))
1661 debug_hooks
->end_epilogue (last_linenum
, last_filename
);
1663 #if defined (DWARF2_UNWIND_INFO)
1664 if (!dwarf2_debug_info_emitted_p (current_function_decl
)
1665 && dwarf2out_do_frame ())
1666 dwarf2out_end_epilogue (last_linenum
, last_filename
);
1670 /* Output assembler code for some insns: all or part of a function.
1671 For description of args, see `final_start_function', above. */
1674 final (rtx first
, FILE *file
, int optimize
)
1680 last_ignored_compare
= 0;
1682 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1684 if (INSN_UID (insn
) > max_uid
) /* Find largest UID. */
1685 max_uid
= INSN_UID (insn
);
1687 /* If CC tracking across branches is enabled, record the insn which
1688 jumps to each branch only reached from one place. */
1689 if (optimize
&& JUMP_P (insn
))
1691 rtx lab
= JUMP_LABEL (insn
);
1692 if (lab
&& LABEL_NUSES (lab
) == 1)
1694 LABEL_REFS (lab
) = insn
;
1704 /* Output the insns. */
1705 for (insn
= first
; insn
;)
1707 #ifdef HAVE_ATTR_length
1708 if ((unsigned) INSN_UID (insn
) >= INSN_ADDRESSES_SIZE ())
1710 /* This can be triggered by bugs elsewhere in the compiler if
1711 new insns are created after init_insn_lengths is called. */
1712 gcc_assert (NOTE_P (insn
));
1713 insn_current_address
= -1;
1716 insn_current_address
= INSN_ADDRESSES (INSN_UID (insn
));
1717 #endif /* HAVE_ATTR_length */
1719 insn
= final_scan_insn (insn
, file
, optimize
, 0, &seen
);
1724 get_insn_template (int code
, rtx insn
)
1726 switch (insn_data
[code
].output_format
)
1728 case INSN_OUTPUT_FORMAT_SINGLE
:
1729 return insn_data
[code
].output
.single
;
1730 case INSN_OUTPUT_FORMAT_MULTI
:
1731 return insn_data
[code
].output
.multi
[which_alternative
];
1732 case INSN_OUTPUT_FORMAT_FUNCTION
:
1734 return (*insn_data
[code
].output
.function
) (recog_data
.operand
, insn
);
1741 /* Emit the appropriate declaration for an alternate-entry-point
1742 symbol represented by INSN, to FILE. INSN is a CODE_LABEL with
1743 LABEL_KIND != LABEL_NORMAL.
1745 The case fall-through in this function is intentional. */
1747 output_alternate_entry_point (FILE *file
, rtx insn
)
1749 const char *name
= LABEL_NAME (insn
);
1751 switch (LABEL_KIND (insn
))
1753 case LABEL_WEAK_ENTRY
:
1754 #ifdef ASM_WEAKEN_LABEL
1755 ASM_WEAKEN_LABEL (file
, name
);
1757 case LABEL_GLOBAL_ENTRY
:
1758 targetm
.asm_out
.globalize_label (file
, name
);
1759 case LABEL_STATIC_ENTRY
:
1760 #ifdef ASM_OUTPUT_TYPE_DIRECTIVE
1761 ASM_OUTPUT_TYPE_DIRECTIVE (file
, name
, "function");
1763 ASM_OUTPUT_LABEL (file
, name
);
1772 /* Given a CALL_INSN, find and return the nested CALL. */
1774 call_from_call_insn (rtx insn
)
1777 gcc_assert (CALL_P (insn
));
1780 while (GET_CODE (x
) != CALL
)
1782 switch (GET_CODE (x
))
1787 x
= COND_EXEC_CODE (x
);
1790 x
= XVECEXP (x
, 0, 0);
1800 /* The final scan for one insn, INSN.
1801 Args are same as in `final', except that INSN
1802 is the insn being scanned.
1803 Value returned is the next insn to be scanned.
1805 NOPEEPHOLES is the flag to disallow peephole processing (currently
1806 used for within delayed branch sequence output).
1808 SEEN is used to track the end of the prologue, for emitting
1809 debug information. We force the emission of a line note after
1810 both NOTE_INSN_PROLOGUE_END and NOTE_INSN_FUNCTION_BEG, or
1811 at the beginning of the second basic block, whichever comes
1815 final_scan_insn (rtx insn
, FILE *file
, int optimize ATTRIBUTE_UNUSED
,
1816 int nopeepholes ATTRIBUTE_UNUSED
, int *seen
)
1825 /* Ignore deleted insns. These can occur when we split insns (due to a
1826 template of "#") while not optimizing. */
1827 if (INSN_DELETED_P (insn
))
1828 return NEXT_INSN (insn
);
1830 switch (GET_CODE (insn
))
1833 switch (NOTE_KIND (insn
))
1835 case NOTE_INSN_DELETED
:
1838 case NOTE_INSN_SWITCH_TEXT_SECTIONS
:
1839 in_cold_section_p
= !in_cold_section_p
;
1840 #ifdef DWARF2_UNWIND_INFO
1841 if (dwarf2out_do_frame ())
1842 dwarf2out_switch_text_section ();
1845 if (!DECL_IGNORED_P (current_function_decl
))
1846 debug_hooks
->switch_text_section ();
1848 switch_to_section (current_function_section ());
1851 case NOTE_INSN_BASIC_BLOCK
:
1852 #ifdef TARGET_UNWIND_INFO
1853 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
1857 fprintf (asm_out_file
, "\t%s basic block %d\n",
1858 ASM_COMMENT_START
, NOTE_BASIC_BLOCK (insn
)->index
);
1860 if ((*seen
& (SEEN_EMITTED
| SEEN_BB
)) == SEEN_BB
)
1862 *seen
|= SEEN_EMITTED
;
1863 force_source_line
= true;
1868 discriminator
= NOTE_BASIC_BLOCK (insn
)->discriminator
;
1872 case NOTE_INSN_EH_REGION_BEG
:
1873 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LEHB",
1874 NOTE_EH_HANDLER (insn
));
1877 case NOTE_INSN_EH_REGION_END
:
1878 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LEHE",
1879 NOTE_EH_HANDLER (insn
));
1882 case NOTE_INSN_PROLOGUE_END
:
1883 targetm
.asm_out
.function_end_prologue (file
);
1884 profile_after_prologue (file
);
1886 if ((*seen
& (SEEN_EMITTED
| SEEN_NOTE
)) == SEEN_NOTE
)
1888 *seen
|= SEEN_EMITTED
;
1889 force_source_line
= true;
1896 case NOTE_INSN_EPILOGUE_BEG
:
1897 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_epilogue)
1898 if (dwarf2out_do_frame ())
1899 dwarf2out_cfi_begin_epilogue (insn
);
1901 (*debug_hooks
->begin_epilogue
) (last_linenum
, last_filename
);
1902 targetm
.asm_out
.function_begin_epilogue (file
);
1905 case NOTE_INSN_CFA_RESTORE_STATE
:
1906 #if defined (DWARF2_UNWIND_INFO)
1907 dwarf2out_frame_debug_restore_state ();
1911 case NOTE_INSN_FUNCTION_BEG
:
1913 if (!DECL_IGNORED_P (current_function_decl
))
1914 debug_hooks
->end_prologue (last_linenum
, last_filename
);
1916 if ((*seen
& (SEEN_EMITTED
| SEEN_NOTE
)) == SEEN_NOTE
)
1918 *seen
|= SEEN_EMITTED
;
1919 force_source_line
= true;
1926 case NOTE_INSN_BLOCK_BEG
:
1927 if (debug_info_level
== DINFO_LEVEL_NORMAL
1928 || debug_info_level
== DINFO_LEVEL_VERBOSE
1929 || write_symbols
== DWARF2_DEBUG
1930 || write_symbols
== VMS_AND_DWARF2_DEBUG
1931 || write_symbols
== VMS_DEBUG
)
1933 int n
= BLOCK_NUMBER (NOTE_BLOCK (insn
));
1937 high_block_linenum
= last_linenum
;
1939 /* Output debugging info about the symbol-block beginning. */
1940 if (!DECL_IGNORED_P (current_function_decl
))
1941 debug_hooks
->begin_block (last_linenum
, n
);
1943 /* Mark this block as output. */
1944 TREE_ASM_WRITTEN (NOTE_BLOCK (insn
)) = 1;
1946 if (write_symbols
== DBX_DEBUG
1947 || write_symbols
== SDB_DEBUG
)
1949 location_t
*locus_ptr
1950 = block_nonartificial_location (NOTE_BLOCK (insn
));
1952 if (locus_ptr
!= NULL
)
1954 override_filename
= LOCATION_FILE (*locus_ptr
);
1955 override_linenum
= LOCATION_LINE (*locus_ptr
);
1960 case NOTE_INSN_BLOCK_END
:
1961 if (debug_info_level
== DINFO_LEVEL_NORMAL
1962 || debug_info_level
== DINFO_LEVEL_VERBOSE
1963 || write_symbols
== DWARF2_DEBUG
1964 || write_symbols
== VMS_AND_DWARF2_DEBUG
1965 || write_symbols
== VMS_DEBUG
)
1967 int n
= BLOCK_NUMBER (NOTE_BLOCK (insn
));
1971 /* End of a symbol-block. */
1973 gcc_assert (block_depth
>= 0);
1975 if (!DECL_IGNORED_P (current_function_decl
))
1976 debug_hooks
->end_block (high_block_linenum
, n
);
1978 if (write_symbols
== DBX_DEBUG
1979 || write_symbols
== SDB_DEBUG
)
1981 tree outer_block
= BLOCK_SUPERCONTEXT (NOTE_BLOCK (insn
));
1982 location_t
*locus_ptr
1983 = block_nonartificial_location (outer_block
);
1985 if (locus_ptr
!= NULL
)
1987 override_filename
= LOCATION_FILE (*locus_ptr
);
1988 override_linenum
= LOCATION_LINE (*locus_ptr
);
1992 override_filename
= NULL
;
1993 override_linenum
= 0;
1998 case NOTE_INSN_DELETED_LABEL
:
1999 /* Emit the label. We may have deleted the CODE_LABEL because
2000 the label could be proved to be unreachable, though still
2001 referenced (in the form of having its address taken. */
2002 ASM_OUTPUT_DEBUG_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
2005 case NOTE_INSN_VAR_LOCATION
:
2006 if (!DECL_IGNORED_P (current_function_decl
))
2007 debug_hooks
->var_location (insn
);
2017 #if defined (DWARF2_UNWIND_INFO)
2018 if (dwarf2out_do_frame ())
2019 dwarf2out_frame_debug (insn
, false);
2024 /* The target port might emit labels in the output function for
2025 some insn, e.g. sh.c output_branchy_insn. */
2026 if (CODE_LABEL_NUMBER (insn
) <= max_labelno
)
2028 int align
= LABEL_TO_ALIGNMENT (insn
);
2029 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2030 int max_skip
= LABEL_TO_MAX_SKIP (insn
);
2033 if (align
&& NEXT_INSN (insn
))
2035 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2036 ASM_OUTPUT_MAX_SKIP_ALIGN (file
, align
, max_skip
);
2038 #ifdef ASM_OUTPUT_ALIGN_WITH_NOP
2039 ASM_OUTPUT_ALIGN_WITH_NOP (file
, align
);
2041 ASM_OUTPUT_ALIGN (file
, align
);
2050 if (!DECL_IGNORED_P (current_function_decl
) && LABEL_NAME (insn
))
2051 debug_hooks
->label (insn
);
2055 next
= next_nonnote_insn (insn
);
2056 /* If this label is followed by a jump-table, make sure we put
2057 the label in the read-only section. Also possibly write the
2058 label and jump table together. */
2059 if (next
!= 0 && JUMP_TABLE_DATA_P (next
))
2061 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2062 /* In this case, the case vector is being moved by the
2063 target, so don't output the label at all. Leave that
2064 to the back end macros. */
2066 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2070 switch_to_section (targetm
.asm_out
.function_rodata_section
2071 (current_function_decl
));
2073 #ifdef ADDR_VEC_ALIGN
2074 log_align
= ADDR_VEC_ALIGN (next
);
2076 log_align
= exact_log2 (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
);
2078 ASM_OUTPUT_ALIGN (file
, log_align
);
2081 switch_to_section (current_function_section ());
2083 #ifdef ASM_OUTPUT_CASE_LABEL
2084 ASM_OUTPUT_CASE_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
),
2087 targetm
.asm_out
.internal_label (file
, "L", CODE_LABEL_NUMBER (insn
));
2092 if (LABEL_ALT_ENTRY_P (insn
))
2093 output_alternate_entry_point (file
, insn
);
2095 targetm
.asm_out
.internal_label (file
, "L", CODE_LABEL_NUMBER (insn
));
2100 rtx body
= PATTERN (insn
);
2101 int insn_code_number
;
2105 /* Reset this early so it is correct for ASM statements. */
2106 current_insn_predicate
= NULL_RTX
;
2108 /* An INSN, JUMP_INSN or CALL_INSN.
2109 First check for special kinds that recog doesn't recognize. */
2111 if (GET_CODE (body
) == USE
/* These are just declarations. */
2112 || GET_CODE (body
) == CLOBBER
)
2117 /* If there is a REG_CC_SETTER note on this insn, it means that
2118 the setting of the condition code was done in the delay slot
2119 of the insn that branched here. So recover the cc status
2120 from the insn that set it. */
2122 rtx note
= find_reg_note (insn
, REG_CC_SETTER
, NULL_RTX
);
2125 NOTICE_UPDATE_CC (PATTERN (XEXP (note
, 0)), XEXP (note
, 0));
2126 cc_prev_status
= cc_status
;
2131 /* Detect insns that are really jump-tables
2132 and output them as such. */
2134 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
2136 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2140 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2141 switch_to_section (targetm
.asm_out
.function_rodata_section
2142 (current_function_decl
));
2144 switch_to_section (current_function_section ());
2148 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2149 if (GET_CODE (body
) == ADDR_VEC
)
2151 #ifdef ASM_OUTPUT_ADDR_VEC
2152 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn
), body
);
2159 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2160 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn
), body
);
2166 vlen
= XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
);
2167 for (idx
= 0; idx
< vlen
; idx
++)
2169 if (GET_CODE (body
) == ADDR_VEC
)
2171 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2172 ASM_OUTPUT_ADDR_VEC_ELT
2173 (file
, CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 0, idx
), 0)));
2180 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2181 ASM_OUTPUT_ADDR_DIFF_ELT
2184 CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 1, idx
), 0)),
2185 CODE_LABEL_NUMBER (XEXP (XEXP (body
, 0), 0)));
2191 #ifdef ASM_OUTPUT_CASE_END
2192 ASM_OUTPUT_CASE_END (file
,
2193 CODE_LABEL_NUMBER (PREV_INSN (insn
)),
2198 switch_to_section (current_function_section ());
2202 /* Output this line note if it is the first or the last line
2204 if (!DECL_IGNORED_P (current_function_decl
)
2205 && notice_source_line (insn
, &is_stmt
))
2206 (*debug_hooks
->source_line
) (last_linenum
, last_filename
,
2207 last_discriminator
, is_stmt
);
2209 if (GET_CODE (body
) == ASM_INPUT
)
2211 const char *string
= XSTR (body
, 0);
2213 /* There's no telling what that did to the condition codes. */
2218 expanded_location loc
;
2221 loc
= expand_location (ASM_INPUT_SOURCE_LOCATION (body
));
2222 if (*loc
.file
&& loc
.line
)
2223 fprintf (asm_out_file
, "%s %i \"%s\" 1\n",
2224 ASM_COMMENT_START
, loc
.line
, loc
.file
);
2225 fprintf (asm_out_file
, "\t%s\n", string
);
2226 #if HAVE_AS_LINE_ZERO
2227 if (*loc
.file
&& loc
.line
)
2228 fprintf (asm_out_file
, "%s 0 \"\" 2\n", ASM_COMMENT_START
);
2234 /* Detect `asm' construct with operands. */
2235 if (asm_noperands (body
) >= 0)
2237 unsigned int noperands
= asm_noperands (body
);
2238 rtx
*ops
= XALLOCAVEC (rtx
, noperands
);
2241 expanded_location expanded
;
2243 /* There's no telling what that did to the condition codes. */
2246 /* Get out the operand values. */
2247 string
= decode_asm_operands (body
, ops
, NULL
, NULL
, NULL
, &loc
);
2248 /* Inhibit dying on what would otherwise be compiler bugs. */
2249 insn_noperands
= noperands
;
2250 this_is_asm_operands
= insn
;
2251 expanded
= expand_location (loc
);
2253 #ifdef FINAL_PRESCAN_INSN
2254 FINAL_PRESCAN_INSN (insn
, ops
, insn_noperands
);
2257 /* Output the insn using them. */
2261 if (expanded
.file
&& expanded
.line
)
2262 fprintf (asm_out_file
, "%s %i \"%s\" 1\n",
2263 ASM_COMMENT_START
, expanded
.line
, expanded
.file
);
2264 output_asm_insn (string
, ops
);
2265 #if HAVE_AS_LINE_ZERO
2266 if (expanded
.file
&& expanded
.line
)
2267 fprintf (asm_out_file
, "%s 0 \"\" 2\n", ASM_COMMENT_START
);
2271 if (targetm
.asm_out
.final_postscan_insn
)
2272 targetm
.asm_out
.final_postscan_insn (file
, insn
, ops
,
2275 this_is_asm_operands
= 0;
2281 if (GET_CODE (body
) == SEQUENCE
)
2283 /* A delayed-branch sequence */
2286 final_sequence
= body
;
2288 /* Record the delay slots' frame information before the branch.
2289 This is needed for delayed calls: see execute_cfa_program(). */
2290 #if defined (DWARF2_UNWIND_INFO)
2291 if (dwarf2out_do_frame ())
2292 for (i
= 1; i
< XVECLEN (body
, 0); i
++)
2293 dwarf2out_frame_debug (XVECEXP (body
, 0, i
), false);
2296 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2297 force the restoration of a comparison that was previously
2298 thought unnecessary. If that happens, cancel this sequence
2299 and cause that insn to be restored. */
2301 next
= final_scan_insn (XVECEXP (body
, 0, 0), file
, 0, 1, seen
);
2302 if (next
!= XVECEXP (body
, 0, 1))
2308 for (i
= 1; i
< XVECLEN (body
, 0); i
++)
2310 rtx insn
= XVECEXP (body
, 0, i
);
2311 rtx next
= NEXT_INSN (insn
);
2312 /* We loop in case any instruction in a delay slot gets
2315 insn
= final_scan_insn (insn
, file
, 0, 1, seen
);
2316 while (insn
!= next
);
2318 #ifdef DBR_OUTPUT_SEQEND
2319 DBR_OUTPUT_SEQEND (file
);
2323 /* If the insn requiring the delay slot was a CALL_INSN, the
2324 insns in the delay slot are actually executed before the
2325 called function. Hence we don't preserve any CC-setting
2326 actions in these insns and the CC must be marked as being
2327 clobbered by the function. */
2328 if (CALL_P (XVECEXP (body
, 0, 0)))
2335 /* We have a real machine instruction as rtl. */
2337 body
= PATTERN (insn
);
2340 set
= single_set (insn
);
2342 /* Check for redundant test and compare instructions
2343 (when the condition codes are already set up as desired).
2344 This is done only when optimizing; if not optimizing,
2345 it should be possible for the user to alter a variable
2346 with the debugger in between statements
2347 and the next statement should reexamine the variable
2348 to compute the condition codes. */
2353 && GET_CODE (SET_DEST (set
)) == CC0
2354 && insn
!= last_ignored_compare
)
2357 if (GET_CODE (SET_SRC (set
)) == SUBREG
)
2358 SET_SRC (set
) = alter_subreg (&SET_SRC (set
));
2360 src1
= SET_SRC (set
);
2362 if (GET_CODE (SET_SRC (set
)) == COMPARE
)
2364 if (GET_CODE (XEXP (SET_SRC (set
), 0)) == SUBREG
)
2365 XEXP (SET_SRC (set
), 0)
2366 = alter_subreg (&XEXP (SET_SRC (set
), 0));
2367 if (GET_CODE (XEXP (SET_SRC (set
), 1)) == SUBREG
)
2368 XEXP (SET_SRC (set
), 1)
2369 = alter_subreg (&XEXP (SET_SRC (set
), 1));
2370 if (XEXP (SET_SRC (set
), 1)
2371 == CONST0_RTX (GET_MODE (XEXP (SET_SRC (set
), 0))))
2372 src2
= XEXP (SET_SRC (set
), 0);
2374 if ((cc_status
.value1
!= 0
2375 && rtx_equal_p (src1
, cc_status
.value1
))
2376 || (cc_status
.value2
!= 0
2377 && rtx_equal_p (src1
, cc_status
.value2
))
2378 || (src2
!= 0 && cc_status
.value1
!= 0
2379 && rtx_equal_p (src2
, cc_status
.value1
))
2380 || (src2
!= 0 && cc_status
.value2
!= 0
2381 && rtx_equal_p (src2
, cc_status
.value2
)))
2383 /* Don't delete insn if it has an addressing side-effect. */
2384 if (! FIND_REG_INC_NOTE (insn
, NULL_RTX
)
2385 /* or if anything in it is volatile. */
2386 && ! volatile_refs_p (PATTERN (insn
)))
2388 /* We don't really delete the insn; just ignore it. */
2389 last_ignored_compare
= insn
;
2396 /* If this is a conditional branch, maybe modify it
2397 if the cc's are in a nonstandard state
2398 so that it accomplishes the same thing that it would
2399 do straightforwardly if the cc's were set up normally. */
2401 if (cc_status
.flags
!= 0
2403 && GET_CODE (body
) == SET
2404 && SET_DEST (body
) == pc_rtx
2405 && GET_CODE (SET_SRC (body
)) == IF_THEN_ELSE
2406 && COMPARISON_P (XEXP (SET_SRC (body
), 0))
2407 && XEXP (XEXP (SET_SRC (body
), 0), 0) == cc0_rtx
)
2409 /* This function may alter the contents of its argument
2410 and clear some of the cc_status.flags bits.
2411 It may also return 1 meaning condition now always true
2412 or -1 meaning condition now always false
2413 or 2 meaning condition nontrivial but altered. */
2414 int result
= alter_cond (XEXP (SET_SRC (body
), 0));
2415 /* If condition now has fixed value, replace the IF_THEN_ELSE
2416 with its then-operand or its else-operand. */
2418 SET_SRC (body
) = XEXP (SET_SRC (body
), 1);
2420 SET_SRC (body
) = XEXP (SET_SRC (body
), 2);
2422 /* The jump is now either unconditional or a no-op.
2423 If it has become a no-op, don't try to output it.
2424 (It would not be recognized.) */
2425 if (SET_SRC (body
) == pc_rtx
)
2430 else if (GET_CODE (SET_SRC (body
)) == RETURN
)
2431 /* Replace (set (pc) (return)) with (return). */
2432 PATTERN (insn
) = body
= SET_SRC (body
);
2434 /* Rerecognize the instruction if it has changed. */
2436 INSN_CODE (insn
) = -1;
2439 /* If this is a conditional trap, maybe modify it if the cc's
2440 are in a nonstandard state so that it accomplishes the same
2441 thing that it would do straightforwardly if the cc's were
2443 if (cc_status
.flags
!= 0
2444 && NONJUMP_INSN_P (insn
)
2445 && GET_CODE (body
) == TRAP_IF
2446 && COMPARISON_P (TRAP_CONDITION (body
))
2447 && XEXP (TRAP_CONDITION (body
), 0) == cc0_rtx
)
2449 /* This function may alter the contents of its argument
2450 and clear some of the cc_status.flags bits.
2451 It may also return 1 meaning condition now always true
2452 or -1 meaning condition now always false
2453 or 2 meaning condition nontrivial but altered. */
2454 int result
= alter_cond (TRAP_CONDITION (body
));
2456 /* If TRAP_CONDITION has become always false, delete the
2464 /* If TRAP_CONDITION has become always true, replace
2465 TRAP_CONDITION with const_true_rtx. */
2467 TRAP_CONDITION (body
) = const_true_rtx
;
2469 /* Rerecognize the instruction if it has changed. */
2471 INSN_CODE (insn
) = -1;
2474 /* Make same adjustments to instructions that examine the
2475 condition codes without jumping and instructions that
2476 handle conditional moves (if this machine has either one). */
2478 if (cc_status
.flags
!= 0
2481 rtx cond_rtx
, then_rtx
, else_rtx
;
2484 && GET_CODE (SET_SRC (set
)) == IF_THEN_ELSE
)
2486 cond_rtx
= XEXP (SET_SRC (set
), 0);
2487 then_rtx
= XEXP (SET_SRC (set
), 1);
2488 else_rtx
= XEXP (SET_SRC (set
), 2);
2492 cond_rtx
= SET_SRC (set
);
2493 then_rtx
= const_true_rtx
;
2494 else_rtx
= const0_rtx
;
2497 switch (GET_CODE (cond_rtx
))
2511 if (XEXP (cond_rtx
, 0) != cc0_rtx
)
2513 result
= alter_cond (cond_rtx
);
2515 validate_change (insn
, &SET_SRC (set
), then_rtx
, 0);
2516 else if (result
== -1)
2517 validate_change (insn
, &SET_SRC (set
), else_rtx
, 0);
2518 else if (result
== 2)
2519 INSN_CODE (insn
) = -1;
2520 if (SET_DEST (set
) == SET_SRC (set
))
2532 #ifdef HAVE_peephole
2533 /* Do machine-specific peephole optimizations if desired. */
2535 if (optimize
&& !flag_no_peephole
&& !nopeepholes
)
2537 rtx next
= peephole (insn
);
2538 /* When peepholing, if there were notes within the peephole,
2539 emit them before the peephole. */
2540 if (next
!= 0 && next
!= NEXT_INSN (insn
))
2542 rtx note
, prev
= PREV_INSN (insn
);
2544 for (note
= NEXT_INSN (insn
); note
!= next
;
2545 note
= NEXT_INSN (note
))
2546 final_scan_insn (note
, file
, optimize
, nopeepholes
, seen
);
2548 /* Put the notes in the proper position for a later
2549 rescan. For example, the SH target can do this
2550 when generating a far jump in a delayed branch
2552 note
= NEXT_INSN (insn
);
2553 PREV_INSN (note
) = prev
;
2554 NEXT_INSN (prev
) = note
;
2555 NEXT_INSN (PREV_INSN (next
)) = insn
;
2556 PREV_INSN (insn
) = PREV_INSN (next
);
2557 NEXT_INSN (insn
) = next
;
2558 PREV_INSN (next
) = insn
;
2561 /* PEEPHOLE might have changed this. */
2562 body
= PATTERN (insn
);
2566 /* Try to recognize the instruction.
2567 If successful, verify that the operands satisfy the
2568 constraints for the instruction. Crash if they don't,
2569 since `reload' should have changed them so that they do. */
2571 insn_code_number
= recog_memoized (insn
);
2572 cleanup_subreg_operands (insn
);
2574 /* Dump the insn in the assembly for debugging. */
2575 if (flag_dump_rtl_in_asm
)
2577 print_rtx_head
= ASM_COMMENT_START
;
2578 print_rtl_single (asm_out_file
, insn
);
2579 print_rtx_head
= "";
2582 if (! constrain_operands_cached (1))
2583 fatal_insn_not_found (insn
);
2585 /* Some target machines need to prescan each insn before
2588 #ifdef FINAL_PRESCAN_INSN
2589 FINAL_PRESCAN_INSN (insn
, recog_data
.operand
, recog_data
.n_operands
);
2592 if (targetm
.have_conditional_execution ()
2593 && GET_CODE (PATTERN (insn
)) == COND_EXEC
)
2594 current_insn_predicate
= COND_EXEC_TEST (PATTERN (insn
));
2597 cc_prev_status
= cc_status
;
2599 /* Update `cc_status' for this instruction.
2600 The instruction's output routine may change it further.
2601 If the output routine for a jump insn needs to depend
2602 on the cc status, it should look at cc_prev_status. */
2604 NOTICE_UPDATE_CC (body
, insn
);
2607 current_output_insn
= debug_insn
= insn
;
2609 #if defined (DWARF2_UNWIND_INFO)
2610 if (CALL_P (insn
) && dwarf2out_do_frame ())
2611 dwarf2out_frame_debug (insn
, false);
2614 /* Find the proper template for this insn. */
2615 templ
= get_insn_template (insn_code_number
, insn
);
2617 /* If the C code returns 0, it means that it is a jump insn
2618 which follows a deleted test insn, and that test insn
2619 needs to be reinserted. */
2624 gcc_assert (prev_nonnote_insn (insn
) == last_ignored_compare
);
2626 /* We have already processed the notes between the setter and
2627 the user. Make sure we don't process them again, this is
2628 particularly important if one of the notes is a block
2629 scope note or an EH note. */
2631 prev
!= last_ignored_compare
;
2632 prev
= PREV_INSN (prev
))
2635 delete_insn (prev
); /* Use delete_note. */
2641 /* If the template is the string "#", it means that this insn must
2643 if (templ
[0] == '#' && templ
[1] == '\0')
2645 rtx new_rtx
= try_split (body
, insn
, 0);
2647 /* If we didn't split the insn, go away. */
2648 if (new_rtx
== insn
&& PATTERN (new_rtx
) == body
)
2649 fatal_insn ("could not split insn", insn
);
2651 #ifdef HAVE_ATTR_length
2652 /* This instruction should have been split in shorten_branches,
2653 to ensure that we would have valid length info for the
2661 #ifdef TARGET_UNWIND_INFO
2662 /* ??? This will put the directives in the wrong place if
2663 get_insn_template outputs assembly directly. However calling it
2664 before get_insn_template breaks if the insns is split. */
2665 targetm
.asm_out
.unwind_emit (asm_out_file
, insn
);
2670 rtx x
= call_from_call_insn (insn
);
2672 if (x
&& MEM_P (x
) && GET_CODE (XEXP (x
, 0)) == SYMBOL_REF
)
2676 t
= SYMBOL_REF_DECL (x
);
2678 assemble_external (t
);
2682 /* Output assembler code from the template. */
2683 output_asm_insn (templ
, recog_data
.operand
);
2685 /* Record point-of-call information for ICF debugging. */
2686 if (flag_enable_icf_debug
&& CALL_P (insn
))
2688 rtx x
= call_from_call_insn (insn
);
2692 if (GET_CODE (XEXP (x
, 0)) == SYMBOL_REF
)
2696 t
= SYMBOL_REF_DECL (x
);
2698 (*debug_hooks
->direct_call
) (t
);
2701 (*debug_hooks
->virtual_call
) (INSN_UID (insn
));
2705 /* Some target machines need to postscan each insn after
2707 if (targetm
.asm_out
.final_postscan_insn
)
2708 targetm
.asm_out
.final_postscan_insn (file
, insn
, recog_data
.operand
,
2709 recog_data
.n_operands
);
2711 /* If necessary, report the effect that the instruction has on
2712 the unwind info. We've already done this for delay slots
2713 and call instructions. */
2714 #if defined (DWARF2_UNWIND_INFO)
2715 if (final_sequence
== 0
2716 #if !defined (HAVE_prologue)
2717 && !ACCUMULATE_OUTGOING_ARGS
2719 && dwarf2out_do_frame ())
2720 dwarf2out_frame_debug (insn
, true);
2723 current_output_insn
= debug_insn
= 0;
2726 return NEXT_INSN (insn
);
2729 /* Return whether a source line note needs to be emitted before INSN.
2730 Sets IS_STMT to TRUE if the line should be marked as a possible
2731 breakpoint location. */
2734 notice_source_line (rtx insn
, bool *is_stmt
)
2736 const char *filename
;
2739 if (override_filename
)
2741 filename
= override_filename
;
2742 linenum
= override_linenum
;
2746 filename
= insn_file (insn
);
2747 linenum
= insn_line (insn
);
2750 if (filename
== NULL
)
2753 if (force_source_line
2754 || filename
!= last_filename
2755 || last_linenum
!= linenum
)
2757 force_source_line
= false;
2758 last_filename
= filename
;
2759 last_linenum
= linenum
;
2760 last_discriminator
= discriminator
;
2762 high_block_linenum
= MAX (last_linenum
, high_block_linenum
);
2763 high_function_linenum
= MAX (last_linenum
, high_function_linenum
);
2767 if (SUPPORTS_DISCRIMINATOR
&& last_discriminator
!= discriminator
)
2769 /* If the discriminator changed, but the line number did not,
2770 output the line table entry with is_stmt false so the
2771 debugger does not treat this as a breakpoint location. */
2772 last_discriminator
= discriminator
;
2780 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
2781 directly to the desired hard register. */
2784 cleanup_subreg_operands (rtx insn
)
2787 bool changed
= false;
2788 extract_insn_cached (insn
);
2789 for (i
= 0; i
< recog_data
.n_operands
; i
++)
2791 /* The following test cannot use recog_data.operand when testing
2792 for a SUBREG: the underlying object might have been changed
2793 already if we are inside a match_operator expression that
2794 matches the else clause. Instead we test the underlying
2795 expression directly. */
2796 if (GET_CODE (*recog_data
.operand_loc
[i
]) == SUBREG
)
2798 recog_data
.operand
[i
] = alter_subreg (recog_data
.operand_loc
[i
]);
2801 else if (GET_CODE (recog_data
.operand
[i
]) == PLUS
2802 || GET_CODE (recog_data
.operand
[i
]) == MULT
2803 || MEM_P (recog_data
.operand
[i
]))
2804 recog_data
.operand
[i
] = walk_alter_subreg (recog_data
.operand_loc
[i
], &changed
);
2807 for (i
= 0; i
< recog_data
.n_dups
; i
++)
2809 if (GET_CODE (*recog_data
.dup_loc
[i
]) == SUBREG
)
2811 *recog_data
.dup_loc
[i
] = alter_subreg (recog_data
.dup_loc
[i
]);
2814 else if (GET_CODE (*recog_data
.dup_loc
[i
]) == PLUS
2815 || GET_CODE (*recog_data
.dup_loc
[i
]) == MULT
2816 || MEM_P (*recog_data
.dup_loc
[i
]))
2817 *recog_data
.dup_loc
[i
] = walk_alter_subreg (recog_data
.dup_loc
[i
], &changed
);
2820 df_insn_rescan (insn
);
2823 /* If X is a SUBREG, replace it with a REG or a MEM,
2824 based on the thing it is a subreg of. */
2827 alter_subreg (rtx
*xp
)
2830 rtx y
= SUBREG_REG (x
);
2832 /* simplify_subreg does not remove subreg from volatile references.
2833 We are required to. */
2836 int offset
= SUBREG_BYTE (x
);
2838 /* For paradoxical subregs on big-endian machines, SUBREG_BYTE
2839 contains 0 instead of the proper offset. See simplify_subreg. */
2841 && GET_MODE_SIZE (GET_MODE (y
)) < GET_MODE_SIZE (GET_MODE (x
)))
2843 int difference
= GET_MODE_SIZE (GET_MODE (y
))
2844 - GET_MODE_SIZE (GET_MODE (x
));
2845 if (WORDS_BIG_ENDIAN
)
2846 offset
+= (difference
/ UNITS_PER_WORD
) * UNITS_PER_WORD
;
2847 if (BYTES_BIG_ENDIAN
)
2848 offset
+= difference
% UNITS_PER_WORD
;
2851 *xp
= adjust_address (y
, GET_MODE (x
), offset
);
2855 rtx new_rtx
= simplify_subreg (GET_MODE (x
), y
, GET_MODE (y
),
2862 /* Simplify_subreg can't handle some REG cases, but we have to. */
2864 HOST_WIDE_INT offset
;
2866 regno
= subreg_regno (x
);
2867 if (subreg_lowpart_p (x
))
2868 offset
= byte_lowpart_offset (GET_MODE (x
), GET_MODE (y
));
2870 offset
= SUBREG_BYTE (x
);
2871 *xp
= gen_rtx_REG_offset (y
, GET_MODE (x
), regno
, offset
);
2878 /* Do alter_subreg on all the SUBREGs contained in X. */
2881 walk_alter_subreg (rtx
*xp
, bool *changed
)
2884 switch (GET_CODE (x
))
2889 XEXP (x
, 0) = walk_alter_subreg (&XEXP (x
, 0), changed
);
2890 XEXP (x
, 1) = walk_alter_subreg (&XEXP (x
, 1), changed
);
2895 XEXP (x
, 0) = walk_alter_subreg (&XEXP (x
, 0), changed
);
2900 return alter_subreg (xp
);
2911 /* Given BODY, the body of a jump instruction, alter the jump condition
2912 as required by the bits that are set in cc_status.flags.
2913 Not all of the bits there can be handled at this level in all cases.
2915 The value is normally 0.
2916 1 means that the condition has become always true.
2917 -1 means that the condition has become always false.
2918 2 means that COND has been altered. */
2921 alter_cond (rtx cond
)
2925 if (cc_status
.flags
& CC_REVERSED
)
2928 PUT_CODE (cond
, swap_condition (GET_CODE (cond
)));
2931 if (cc_status
.flags
& CC_INVERTED
)
2934 PUT_CODE (cond
, reverse_condition (GET_CODE (cond
)));
2937 if (cc_status
.flags
& CC_NOT_POSITIVE
)
2938 switch (GET_CODE (cond
))
2943 /* Jump becomes unconditional. */
2949 /* Jump becomes no-op. */
2953 PUT_CODE (cond
, EQ
);
2958 PUT_CODE (cond
, NE
);
2966 if (cc_status
.flags
& CC_NOT_NEGATIVE
)
2967 switch (GET_CODE (cond
))
2971 /* Jump becomes unconditional. */
2976 /* Jump becomes no-op. */
2981 PUT_CODE (cond
, EQ
);
2987 PUT_CODE (cond
, NE
);
2995 if (cc_status
.flags
& CC_NO_OVERFLOW
)
2996 switch (GET_CODE (cond
))
2999 /* Jump becomes unconditional. */
3003 PUT_CODE (cond
, EQ
);
3008 PUT_CODE (cond
, NE
);
3013 /* Jump becomes no-op. */
3020 if (cc_status
.flags
& (CC_Z_IN_NOT_N
| CC_Z_IN_N
))
3021 switch (GET_CODE (cond
))
3027 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? GE
: LT
);
3032 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? LT
: GE
);
3037 if (cc_status
.flags
& CC_NOT_SIGNED
)
3038 /* The flags are valid if signed condition operators are converted
3040 switch (GET_CODE (cond
))
3043 PUT_CODE (cond
, LEU
);
3048 PUT_CODE (cond
, LTU
);
3053 PUT_CODE (cond
, GTU
);
3058 PUT_CODE (cond
, GEU
);
3070 /* Report inconsistency between the assembler template and the operands.
3071 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3074 output_operand_lossage (const char *cmsgid
, ...)
3078 const char *pfx_str
;
3081 va_start (ap
, cmsgid
);
3083 pfx_str
= this_is_asm_operands
? _("invalid 'asm': ") : "output_operand: ";
3084 asprintf (&fmt_string
, "%s%s", pfx_str
, _(cmsgid
));
3085 vasprintf (&new_message
, fmt_string
, ap
);
3087 if (this_is_asm_operands
)
3088 error_for_asm (this_is_asm_operands
, "%s", new_message
);
3090 internal_error ("%s", new_message
);
3097 /* Output of assembler code from a template, and its subroutines. */
3099 /* Annotate the assembly with a comment describing the pattern and
3100 alternative used. */
3103 output_asm_name (void)
3107 int num
= INSN_CODE (debug_insn
);
3108 fprintf (asm_out_file
, "\t%s %d\t%s",
3109 ASM_COMMENT_START
, INSN_UID (debug_insn
),
3110 insn_data
[num
].name
);
3111 if (insn_data
[num
].n_alternatives
> 1)
3112 fprintf (asm_out_file
, "/%d", which_alternative
+ 1);
3113 #ifdef HAVE_ATTR_length
3114 fprintf (asm_out_file
, "\t[length = %d]",
3115 get_attr_length (debug_insn
));
3117 /* Clear this so only the first assembler insn
3118 of any rtl insn will get the special comment for -dp. */
3123 /* If OP is a REG or MEM and we can find a MEM_EXPR corresponding to it
3124 or its address, return that expr . Set *PADDRESSP to 1 if the expr
3125 corresponds to the address of the object and 0 if to the object. */
3128 get_mem_expr_from_op (rtx op
, int *paddressp
)
3136 return REG_EXPR (op
);
3137 else if (!MEM_P (op
))
3140 if (MEM_EXPR (op
) != 0)
3141 return MEM_EXPR (op
);
3143 /* Otherwise we have an address, so indicate it and look at the address. */
3147 /* First check if we have a decl for the address, then look at the right side
3148 if it is a PLUS. Otherwise, strip off arithmetic and keep looking.
3149 But don't allow the address to itself be indirect. */
3150 if ((expr
= get_mem_expr_from_op (op
, &inner_addressp
)) && ! inner_addressp
)
3152 else if (GET_CODE (op
) == PLUS
3153 && (expr
= get_mem_expr_from_op (XEXP (op
, 1), &inner_addressp
)))
3157 || GET_RTX_CLASS (GET_CODE (op
)) == RTX_BIN_ARITH
)
3160 expr
= get_mem_expr_from_op (op
, &inner_addressp
);
3161 return inner_addressp
? 0 : expr
;
3164 /* Output operand names for assembler instructions. OPERANDS is the
3165 operand vector, OPORDER is the order to write the operands, and NOPS
3166 is the number of operands to write. */
3169 output_asm_operand_names (rtx
*operands
, int *oporder
, int nops
)
3174 for (i
= 0; i
< nops
; i
++)
3177 rtx op
= operands
[oporder
[i
]];
3178 tree expr
= get_mem_expr_from_op (op
, &addressp
);
3180 fprintf (asm_out_file
, "%c%s",
3181 wrote
? ',' : '\t', wrote
? "" : ASM_COMMENT_START
);
3185 fprintf (asm_out_file
, "%s",
3186 addressp
? "*" : "");
3187 print_mem_expr (asm_out_file
, expr
);
3190 else if (REG_P (op
) && ORIGINAL_REGNO (op
)
3191 && ORIGINAL_REGNO (op
) != REGNO (op
))
3192 fprintf (asm_out_file
, " tmp%i", ORIGINAL_REGNO (op
));
3196 /* Output text from TEMPLATE to the assembler output file,
3197 obeying %-directions to substitute operands taken from
3198 the vector OPERANDS.
3200 %N (for N a digit) means print operand N in usual manner.
3201 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3202 and print the label name with no punctuation.
3203 %cN means require operand N to be a constant
3204 and print the constant expression with no punctuation.
3205 %aN means expect operand N to be a memory address
3206 (not a memory reference!) and print a reference
3208 %nN means expect operand N to be a constant
3209 and print a constant expression for minus the value
3210 of the operand, with no other punctuation. */
3213 output_asm_insn (const char *templ
, rtx
*operands
)
3217 #ifdef ASSEMBLER_DIALECT
3220 int oporder
[MAX_RECOG_OPERANDS
];
3221 char opoutput
[MAX_RECOG_OPERANDS
];
3224 /* An insn may return a null string template
3225 in a case where no assembler code is needed. */
3229 memset (opoutput
, 0, sizeof opoutput
);
3231 putc ('\t', asm_out_file
);
3233 #ifdef ASM_OUTPUT_OPCODE
3234 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3241 if (flag_verbose_asm
)
3242 output_asm_operand_names (operands
, oporder
, ops
);
3243 if (flag_print_asm_name
)
3247 memset (opoutput
, 0, sizeof opoutput
);
3249 putc (c
, asm_out_file
);
3250 #ifdef ASM_OUTPUT_OPCODE
3251 while ((c
= *p
) == '\t')
3253 putc (c
, asm_out_file
);
3256 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3260 #ifdef ASSEMBLER_DIALECT
3266 output_operand_lossage ("nested assembly dialect alternatives");
3270 /* If we want the first dialect, do nothing. Otherwise, skip
3271 DIALECT_NUMBER of strings ending with '|'. */
3272 for (i
= 0; i
< dialect_number
; i
++)
3274 while (*p
&& *p
!= '}' && *p
++ != '|')
3283 output_operand_lossage ("unterminated assembly dialect alternative");
3290 /* Skip to close brace. */
3295 output_operand_lossage ("unterminated assembly dialect alternative");
3299 while (*p
++ != '}');
3303 putc (c
, asm_out_file
);
3308 putc (c
, asm_out_file
);
3314 /* %% outputs a single %. */
3318 putc (c
, asm_out_file
);
3320 /* %= outputs a number which is unique to each insn in the entire
3321 compilation. This is useful for making local labels that are
3322 referred to more than once in a given insn. */
3326 fprintf (asm_out_file
, "%d", insn_counter
);
3328 /* % followed by a letter and some digits
3329 outputs an operand in a special way depending on the letter.
3330 Letters `acln' are implemented directly.
3331 Other letters are passed to `output_operand' so that
3332 the TARGET_PRINT_OPERAND hook can define them. */
3333 else if (ISALPHA (*p
))
3336 unsigned long opnum
;
3339 opnum
= strtoul (p
, &endptr
, 10);
3342 output_operand_lossage ("operand number missing "
3344 else if (this_is_asm_operands
&& opnum
>= insn_noperands
)
3345 output_operand_lossage ("operand number out of range");
3346 else if (letter
== 'l')
3347 output_asm_label (operands
[opnum
]);
3348 else if (letter
== 'a')
3349 output_address (operands
[opnum
]);
3350 else if (letter
== 'c')
3352 if (CONSTANT_ADDRESS_P (operands
[opnum
]))
3353 output_addr_const (asm_out_file
, operands
[opnum
]);
3355 output_operand (operands
[opnum
], 'c');
3357 else if (letter
== 'n')
3359 if (CONST_INT_P (operands
[opnum
]))
3360 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
,
3361 - INTVAL (operands
[opnum
]));
3364 putc ('-', asm_out_file
);
3365 output_addr_const (asm_out_file
, operands
[opnum
]);
3369 output_operand (operands
[opnum
], letter
);
3371 if (!opoutput
[opnum
])
3372 oporder
[ops
++] = opnum
;
3373 opoutput
[opnum
] = 1;
3378 /* % followed by a digit outputs an operand the default way. */
3379 else if (ISDIGIT (*p
))
3381 unsigned long opnum
;
3384 opnum
= strtoul (p
, &endptr
, 10);
3385 if (this_is_asm_operands
&& opnum
>= insn_noperands
)
3386 output_operand_lossage ("operand number out of range");
3388 output_operand (operands
[opnum
], 0);
3390 if (!opoutput
[opnum
])
3391 oporder
[ops
++] = opnum
;
3392 opoutput
[opnum
] = 1;
3397 /* % followed by punctuation: output something for that
3398 punctuation character alone, with no operand. The
3399 TARGET_PRINT_OPERAND hook decides what is actually done. */
3400 else if (targetm
.asm_out
.print_operand_punct_valid_p ((unsigned char) *p
))
3401 output_operand (NULL_RTX
, *p
++);
3403 output_operand_lossage ("invalid %%-code");
3407 putc (c
, asm_out_file
);
3410 /* Write out the variable names for operands, if we know them. */
3411 if (flag_verbose_asm
)
3412 output_asm_operand_names (operands
, oporder
, ops
);
3413 if (flag_print_asm_name
)
3416 putc ('\n', asm_out_file
);
3419 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3422 output_asm_label (rtx x
)
3426 if (GET_CODE (x
) == LABEL_REF
)
3430 && NOTE_KIND (x
) == NOTE_INSN_DELETED_LABEL
))
3431 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3433 output_operand_lossage ("'%%l' operand isn't a label");
3435 assemble_name (asm_out_file
, buf
);
3438 /* Helper rtx-iteration-function for mark_symbol_refs_as_used and
3439 output_operand. Marks SYMBOL_REFs as referenced through use of
3440 assemble_external. */
3443 mark_symbol_ref_as_used (rtx
*xp
, void *dummy ATTRIBUTE_UNUSED
)
3447 /* If we have a used symbol, we may have to emit assembly
3448 annotations corresponding to whether the symbol is external, weak
3449 or has non-default visibility. */
3450 if (GET_CODE (x
) == SYMBOL_REF
)
3454 t
= SYMBOL_REF_DECL (x
);
3456 assemble_external (t
);
3464 /* Marks SYMBOL_REFs in x as referenced through use of assemble_external. */
3467 mark_symbol_refs_as_used (rtx x
)
3469 for_each_rtx (&x
, mark_symbol_ref_as_used
, NULL
);
3472 /* Print operand X using machine-dependent assembler syntax.
3473 CODE is a non-digit that preceded the operand-number in the % spec,
3474 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3475 between the % and the digits.
3476 When CODE is a non-letter, X is 0.
3478 The meanings of the letters are machine-dependent and controlled
3479 by TARGET_PRINT_OPERAND. */
3482 output_operand (rtx x
, int code ATTRIBUTE_UNUSED
)
3484 if (x
&& GET_CODE (x
) == SUBREG
)
3485 x
= alter_subreg (&x
);
3487 /* X must not be a pseudo reg. */
3488 gcc_assert (!x
|| !REG_P (x
) || REGNO (x
) < FIRST_PSEUDO_REGISTER
);
3490 targetm
.asm_out
.print_operand (asm_out_file
, x
, code
);
3495 for_each_rtx (&x
, mark_symbol_ref_as_used
, NULL
);
3498 /* Print a memory reference operand for address X using
3499 machine-dependent assembler syntax. */
3502 output_address (rtx x
)
3504 bool changed
= false;
3505 walk_alter_subreg (&x
, &changed
);
3506 targetm
.asm_out
.print_operand_address (asm_out_file
, x
);
3509 /* Print an integer constant expression in assembler syntax.
3510 Addition and subtraction are the only arithmetic
3511 that may appear in these expressions. */
3514 output_addr_const (FILE *file
, rtx x
)
3519 switch (GET_CODE (x
))
3526 if (SYMBOL_REF_DECL (x
))
3527 assemble_external (SYMBOL_REF_DECL (x
));
3528 #ifdef ASM_OUTPUT_SYMBOL_REF
3529 ASM_OUTPUT_SYMBOL_REF (file
, x
);
3531 assemble_name (file
, XSTR (x
, 0));
3539 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3540 #ifdef ASM_OUTPUT_LABEL_REF
3541 ASM_OUTPUT_LABEL_REF (file
, buf
);
3543 assemble_name (file
, buf
);
3548 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, INTVAL (x
));
3552 /* This used to output parentheses around the expression,
3553 but that does not work on the 386 (either ATT or BSD assembler). */
3554 output_addr_const (file
, XEXP (x
, 0));
3558 if (GET_MODE (x
) == VOIDmode
)
3560 /* We can use %d if the number is one word and positive. */
3561 if (CONST_DOUBLE_HIGH (x
))
3562 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
3563 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_HIGH (x
),
3564 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_LOW (x
));
3565 else if (CONST_DOUBLE_LOW (x
) < 0)
3566 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
,
3567 (unsigned HOST_WIDE_INT
) CONST_DOUBLE_LOW (x
));
3569 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_DOUBLE_LOW (x
));
3572 /* We can't handle floating point constants;
3573 PRINT_OPERAND must handle them. */
3574 output_operand_lossage ("floating constant misused");
3578 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
,
3579 (unsigned HOST_WIDE_INT
) CONST_FIXED_VALUE_LOW (x
));
3583 /* Some assemblers need integer constants to appear last (eg masm). */
3584 if (CONST_INT_P (XEXP (x
, 0)))
3586 output_addr_const (file
, XEXP (x
, 1));
3587 if (INTVAL (XEXP (x
, 0)) >= 0)
3588 fprintf (file
, "+");
3589 output_addr_const (file
, XEXP (x
, 0));
3593 output_addr_const (file
, XEXP (x
, 0));
3594 if (!CONST_INT_P (XEXP (x
, 1))
3595 || INTVAL (XEXP (x
, 1)) >= 0)
3596 fprintf (file
, "+");
3597 output_addr_const (file
, XEXP (x
, 1));
3602 /* Avoid outputting things like x-x or x+5-x,
3603 since some assemblers can't handle that. */
3604 x
= simplify_subtraction (x
);
3605 if (GET_CODE (x
) != MINUS
)
3608 output_addr_const (file
, XEXP (x
, 0));
3609 fprintf (file
, "-");
3610 if ((CONST_INT_P (XEXP (x
, 1)) && INTVAL (XEXP (x
, 1)) >= 0)
3611 || GET_CODE (XEXP (x
, 1)) == PC
3612 || GET_CODE (XEXP (x
, 1)) == SYMBOL_REF
)
3613 output_addr_const (file
, XEXP (x
, 1));
3616 fputs (targetm
.asm_out
.open_paren
, file
);
3617 output_addr_const (file
, XEXP (x
, 1));
3618 fputs (targetm
.asm_out
.close_paren
, file
);
3626 output_addr_const (file
, XEXP (x
, 0));
3630 #ifdef OUTPUT_ADDR_CONST_EXTRA
3631 OUTPUT_ADDR_CONST_EXTRA (file
, x
, fail
);
3636 output_operand_lossage ("invalid expression as operand");
3640 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3641 %R prints the value of REGISTER_PREFIX.
3642 %L prints the value of LOCAL_LABEL_PREFIX.
3643 %U prints the value of USER_LABEL_PREFIX.
3644 %I prints the value of IMMEDIATE_PREFIX.
3645 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3646 Also supported are %d, %i, %u, %x, %X, %o, %c, %s and %%.
3648 We handle alternate assembler dialects here, just like output_asm_insn. */
3651 asm_fprintf (FILE *file
, const char *p
, ...)
3657 va_start (argptr
, p
);
3664 #ifdef ASSEMBLER_DIALECT
3669 /* If we want the first dialect, do nothing. Otherwise, skip
3670 DIALECT_NUMBER of strings ending with '|'. */
3671 for (i
= 0; i
< dialect_number
; i
++)
3673 while (*p
&& *p
++ != '|')
3683 /* Skip to close brace. */
3684 while (*p
&& *p
++ != '}')
3695 while (strchr ("-+ #0", c
))
3700 while (ISDIGIT (c
) || c
== '.')
3711 case 'd': case 'i': case 'u':
3712 case 'x': case 'X': case 'o':
3716 fprintf (file
, buf
, va_arg (argptr
, int));
3720 /* This is a prefix to the 'd', 'i', 'u', 'x', 'X', and
3721 'o' cases, but we do not check for those cases. It
3722 means that the value is a HOST_WIDE_INT, which may be
3723 either `long' or `long long'. */
3724 memcpy (q
, HOST_WIDE_INT_PRINT
, strlen (HOST_WIDE_INT_PRINT
));
3725 q
+= strlen (HOST_WIDE_INT_PRINT
);
3728 fprintf (file
, buf
, va_arg (argptr
, HOST_WIDE_INT
));
3733 #ifdef HAVE_LONG_LONG
3739 fprintf (file
, buf
, va_arg (argptr
, long long));
3746 fprintf (file
, buf
, va_arg (argptr
, long));
3754 fprintf (file
, buf
, va_arg (argptr
, char *));
3758 #ifdef ASM_OUTPUT_OPCODE
3759 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3764 #ifdef REGISTER_PREFIX
3765 fprintf (file
, "%s", REGISTER_PREFIX
);
3770 #ifdef IMMEDIATE_PREFIX
3771 fprintf (file
, "%s", IMMEDIATE_PREFIX
);
3776 #ifdef LOCAL_LABEL_PREFIX
3777 fprintf (file
, "%s", LOCAL_LABEL_PREFIX
);
3782 fputs (user_label_prefix
, file
);
3785 #ifdef ASM_FPRINTF_EXTENSIONS
3786 /* Uppercase letters are reserved for general use by asm_fprintf
3787 and so are not available to target specific code. In order to
3788 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
3789 they are defined here. As they get turned into real extensions
3790 to asm_fprintf they should be removed from this list. */
3791 case 'A': case 'B': case 'C': case 'D': case 'E':
3792 case 'F': case 'G': case 'H': case 'J': case 'K':
3793 case 'M': case 'N': case 'P': case 'Q': case 'S':
3794 case 'T': case 'V': case 'W': case 'Y': case 'Z':
3797 ASM_FPRINTF_EXTENSIONS (file
, argptr
, p
)
3810 /* Split up a CONST_DOUBLE or integer constant rtx
3811 into two rtx's for single words,
3812 storing in *FIRST the word that comes first in memory in the target
3813 and in *SECOND the other. */
3816 split_double (rtx value
, rtx
*first
, rtx
*second
)
3818 if (CONST_INT_P (value
))
3820 if (HOST_BITS_PER_WIDE_INT
>= (2 * BITS_PER_WORD
))
3822 /* In this case the CONST_INT holds both target words.
3823 Extract the bits from it into two word-sized pieces.
3824 Sign extend each half to HOST_WIDE_INT. */
3825 unsigned HOST_WIDE_INT low
, high
;
3826 unsigned HOST_WIDE_INT mask
, sign_bit
, sign_extend
;
3828 /* Set sign_bit to the most significant bit of a word. */
3830 sign_bit
<<= BITS_PER_WORD
- 1;
3832 /* Set mask so that all bits of the word are set. We could
3833 have used 1 << BITS_PER_WORD instead of basing the
3834 calculation on sign_bit. However, on machines where
3835 HOST_BITS_PER_WIDE_INT == BITS_PER_WORD, it could cause a
3836 compiler warning, even though the code would never be
3838 mask
= sign_bit
<< 1;
3841 /* Set sign_extend as any remaining bits. */
3842 sign_extend
= ~mask
;
3844 /* Pick the lower word and sign-extend it. */
3845 low
= INTVAL (value
);
3850 /* Pick the higher word, shifted to the least significant
3851 bits, and sign-extend it. */
3852 high
= INTVAL (value
);
3853 high
>>= BITS_PER_WORD
- 1;
3856 if (high
& sign_bit
)
3857 high
|= sign_extend
;
3859 /* Store the words in the target machine order. */
3860 if (WORDS_BIG_ENDIAN
)
3862 *first
= GEN_INT (high
);
3863 *second
= GEN_INT (low
);
3867 *first
= GEN_INT (low
);
3868 *second
= GEN_INT (high
);
3873 /* The rule for using CONST_INT for a wider mode
3874 is that we regard the value as signed.
3875 So sign-extend it. */
3876 rtx high
= (INTVAL (value
) < 0 ? constm1_rtx
: const0_rtx
);
3877 if (WORDS_BIG_ENDIAN
)
3889 else if (GET_CODE (value
) != CONST_DOUBLE
)
3891 if (WORDS_BIG_ENDIAN
)
3893 *first
= const0_rtx
;
3899 *second
= const0_rtx
;
3902 else if (GET_MODE (value
) == VOIDmode
3903 /* This is the old way we did CONST_DOUBLE integers. */
3904 || GET_MODE_CLASS (GET_MODE (value
)) == MODE_INT
)
3906 /* In an integer, the words are defined as most and least significant.
3907 So order them by the target's convention. */
3908 if (WORDS_BIG_ENDIAN
)
3910 *first
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3911 *second
= GEN_INT (CONST_DOUBLE_LOW (value
));
3915 *first
= GEN_INT (CONST_DOUBLE_LOW (value
));
3916 *second
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3923 REAL_VALUE_FROM_CONST_DOUBLE (r
, value
);
3925 /* Note, this converts the REAL_VALUE_TYPE to the target's
3926 format, splits up the floating point double and outputs
3927 exactly 32 bits of it into each of l[0] and l[1] --
3928 not necessarily BITS_PER_WORD bits. */
3929 REAL_VALUE_TO_TARGET_DOUBLE (r
, l
);
3931 /* If 32 bits is an entire word for the target, but not for the host,
3932 then sign-extend on the host so that the number will look the same
3933 way on the host that it would on the target. See for instance
3934 simplify_unary_operation. The #if is needed to avoid compiler
3937 #if HOST_BITS_PER_LONG > 32
3938 if (BITS_PER_WORD
< HOST_BITS_PER_LONG
&& BITS_PER_WORD
== 32)
3940 if (l
[0] & ((long) 1 << 31))
3941 l
[0] |= ((long) (-1) << 32);
3942 if (l
[1] & ((long) 1 << 31))
3943 l
[1] |= ((long) (-1) << 32);
3947 *first
= GEN_INT (l
[0]);
3948 *second
= GEN_INT (l
[1]);
3952 /* Return nonzero if this function has no function calls. */
3955 leaf_function_p (void)
3960 if (crtl
->profile
|| profile_arc_flag
)
3963 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3966 && ! SIBLING_CALL_P (insn
))
3968 if (NONJUMP_INSN_P (insn
)
3969 && GET_CODE (PATTERN (insn
)) == SEQUENCE
3970 && CALL_P (XVECEXP (PATTERN (insn
), 0, 0))
3971 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn
), 0, 0)))
3974 for (link
= crtl
->epilogue_delay_list
;
3976 link
= XEXP (link
, 1))
3978 insn
= XEXP (link
, 0);
3981 && ! SIBLING_CALL_P (insn
))
3983 if (NONJUMP_INSN_P (insn
)
3984 && GET_CODE (PATTERN (insn
)) == SEQUENCE
3985 && CALL_P (XVECEXP (PATTERN (insn
), 0, 0))
3986 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn
), 0, 0)))
3993 /* Return 1 if branch is a forward branch.
3994 Uses insn_shuid array, so it works only in the final pass. May be used by
3995 output templates to customary add branch prediction hints.
3998 final_forward_branch_p (rtx insn
)
4000 int insn_id
, label_id
;
4002 gcc_assert (uid_shuid
);
4003 insn_id
= INSN_SHUID (insn
);
4004 label_id
= INSN_SHUID (JUMP_LABEL (insn
));
4005 /* We've hit some insns that does not have id information available. */
4006 gcc_assert (insn_id
&& label_id
);
4007 return insn_id
< label_id
;
4010 /* On some machines, a function with no call insns
4011 can run faster if it doesn't create its own register window.
4012 When output, the leaf function should use only the "output"
4013 registers. Ordinarily, the function would be compiled to use
4014 the "input" registers to find its arguments; it is a candidate
4015 for leaf treatment if it uses only the "input" registers.
4016 Leaf function treatment means renumbering so the function
4017 uses the "output" registers instead. */
4019 #ifdef LEAF_REGISTERS
4021 /* Return 1 if this function uses only the registers that can be
4022 safely renumbered. */
4025 only_leaf_regs_used (void)
4028 const char *const permitted_reg_in_leaf_functions
= LEAF_REGISTERS
;
4030 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4031 if ((df_regs_ever_live_p (i
) || global_regs
[i
])
4032 && ! permitted_reg_in_leaf_functions
[i
])
4035 if (crtl
->uses_pic_offset_table
4036 && pic_offset_table_rtx
!= 0
4037 && REG_P (pic_offset_table_rtx
)
4038 && ! permitted_reg_in_leaf_functions
[REGNO (pic_offset_table_rtx
)])
4044 /* Scan all instructions and renumber all registers into those
4045 available in leaf functions. */
4048 leaf_renumber_regs (rtx first
)
4052 /* Renumber only the actual patterns.
4053 The reg-notes can contain frame pointer refs,
4054 and renumbering them could crash, and should not be needed. */
4055 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
4057 leaf_renumber_regs_insn (PATTERN (insn
));
4058 for (insn
= crtl
->epilogue_delay_list
;
4060 insn
= XEXP (insn
, 1))
4061 if (INSN_P (XEXP (insn
, 0)))
4062 leaf_renumber_regs_insn (PATTERN (XEXP (insn
, 0)));
4065 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4066 available in leaf functions. */
4069 leaf_renumber_regs_insn (rtx in_rtx
)
4072 const char *format_ptr
;
4077 /* Renumber all input-registers into output-registers.
4078 renumbered_regs would be 1 for an output-register;
4085 /* Don't renumber the same reg twice. */
4089 newreg
= REGNO (in_rtx
);
4090 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4091 to reach here as part of a REG_NOTE. */
4092 if (newreg
>= FIRST_PSEUDO_REGISTER
)
4097 newreg
= LEAF_REG_REMAP (newreg
);
4098 gcc_assert (newreg
>= 0);
4099 df_set_regs_ever_live (REGNO (in_rtx
), false);
4100 df_set_regs_ever_live (newreg
, true);
4101 SET_REGNO (in_rtx
, newreg
);
4105 if (INSN_P (in_rtx
))
4107 /* Inside a SEQUENCE, we find insns.
4108 Renumber just the patterns of these insns,
4109 just as we do for the top-level insns. */
4110 leaf_renumber_regs_insn (PATTERN (in_rtx
));
4114 format_ptr
= GET_RTX_FORMAT (GET_CODE (in_rtx
));
4116 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (in_rtx
)); i
++)
4117 switch (*format_ptr
++)
4120 leaf_renumber_regs_insn (XEXP (in_rtx
, i
));
4124 if (NULL
!= XVEC (in_rtx
, i
))
4126 for (j
= 0; j
< XVECLEN (in_rtx
, i
); j
++)
4127 leaf_renumber_regs_insn (XVECEXP (in_rtx
, i
, j
));
4147 /* When -gused is used, emit debug info for only used symbols. But in
4148 addition to the standard intercepted debug_hooks there are some direct
4149 calls into this file, i.e., dbxout_symbol, dbxout_parms, and dbxout_reg_params.
4150 Those routines may also be called from a higher level intercepted routine. So
4151 to prevent recording data for an inner call to one of these for an intercept,
4152 we maintain an intercept nesting counter (debug_nesting). We only save the
4153 intercepted arguments if the nesting is 1. */
4154 int debug_nesting
= 0;
4156 static tree
*symbol_queue
;
4157 int symbol_queue_index
= 0;
4158 static int symbol_queue_size
= 0;
4160 /* Generate the symbols for any queued up type symbols we encountered
4161 while generating the type info for some originally used symbol.
4162 This might generate additional entries in the queue. Only when
4163 the nesting depth goes to 0 is this routine called. */
4166 debug_flush_symbol_queue (void)
4170 /* Make sure that additionally queued items are not flushed
4175 for (i
= 0; i
< symbol_queue_index
; ++i
)
4177 /* If we pushed queued symbols then such symbols must be
4178 output no matter what anyone else says. Specifically,
4179 we need to make sure dbxout_symbol() thinks the symbol was
4180 used and also we need to override TYPE_DECL_SUPPRESS_DEBUG
4181 which may be set for outside reasons. */
4182 int saved_tree_used
= TREE_USED (symbol_queue
[i
]);
4183 int saved_suppress_debug
= TYPE_DECL_SUPPRESS_DEBUG (symbol_queue
[i
]);
4184 TREE_USED (symbol_queue
[i
]) = 1;
4185 TYPE_DECL_SUPPRESS_DEBUG (symbol_queue
[i
]) = 0;
4187 #ifdef DBX_DEBUGGING_INFO
4188 dbxout_symbol (symbol_queue
[i
], 0);
4191 TREE_USED (symbol_queue
[i
]) = saved_tree_used
;
4192 TYPE_DECL_SUPPRESS_DEBUG (symbol_queue
[i
]) = saved_suppress_debug
;
4195 symbol_queue_index
= 0;
4199 /* Queue a type symbol needed as part of the definition of a decl
4200 symbol. These symbols are generated when debug_flush_symbol_queue()
4204 debug_queue_symbol (tree decl
)
4206 if (symbol_queue_index
>= symbol_queue_size
)
4208 symbol_queue_size
+= 10;
4209 symbol_queue
= XRESIZEVEC (tree
, symbol_queue
, symbol_queue_size
);
4212 symbol_queue
[symbol_queue_index
++] = decl
;
4215 /* Free symbol queue. */
4217 debug_free_queue (void)
4221 free (symbol_queue
);
4222 symbol_queue
= NULL
;
4223 symbol_queue_size
= 0;
4227 /* Turn the RTL into assembly. */
4229 rest_of_handle_final (void)
4234 /* Get the function's name, as described by its RTL. This may be
4235 different from the DECL_NAME name used in the source file. */
4237 x
= DECL_RTL (current_function_decl
);
4238 gcc_assert (MEM_P (x
));
4240 gcc_assert (GET_CODE (x
) == SYMBOL_REF
);
4241 fnname
= XSTR (x
, 0);
4243 assemble_start_function (current_function_decl
, fnname
);
4244 final_start_function (get_insns (), asm_out_file
, optimize
);
4245 final (get_insns (), asm_out_file
, optimize
);
4246 final_end_function ();
4248 #ifdef TARGET_UNWIND_INFO
4249 /* ??? The IA-64 ".handlerdata" directive must be issued before
4250 the ".endp" directive that closes the procedure descriptor. */
4251 output_function_exception_table (fnname
);
4254 assemble_end_function (current_function_decl
, fnname
);
4256 #ifndef TARGET_UNWIND_INFO
4257 /* Otherwise, it feels unclean to switch sections in the middle. */
4258 output_function_exception_table (fnname
);
4261 user_defined_section_attribute
= false;
4263 /* Free up reg info memory. */
4267 fflush (asm_out_file
);
4269 /* Write DBX symbols if requested. */
4271 /* Note that for those inline functions where we don't initially
4272 know for certain that we will be generating an out-of-line copy,
4273 the first invocation of this routine (rest_of_compilation) will
4274 skip over this code by doing a `goto exit_rest_of_compilation;'.
4275 Later on, wrapup_global_declarations will (indirectly) call
4276 rest_of_compilation again for those inline functions that need
4277 to have out-of-line copies generated. During that call, we
4278 *will* be routed past here. */
4280 timevar_push (TV_SYMOUT
);
4281 if (!DECL_IGNORED_P (current_function_decl
))
4282 debug_hooks
->function_decl (current_function_decl
);
4283 timevar_pop (TV_SYMOUT
);
4285 /* Release the blocks that are linked to DECL_INITIAL() to free the memory. */
4286 DECL_INITIAL (current_function_decl
) = error_mark_node
;
4288 if (DECL_STATIC_CONSTRUCTOR (current_function_decl
)
4289 && targetm
.have_ctors_dtors
)
4290 targetm
.asm_out
.constructor (XEXP (DECL_RTL (current_function_decl
), 0),
4291 decl_init_priority_lookup
4292 (current_function_decl
));
4293 if (DECL_STATIC_DESTRUCTOR (current_function_decl
)
4294 && targetm
.have_ctors_dtors
)
4295 targetm
.asm_out
.destructor (XEXP (DECL_RTL (current_function_decl
), 0),
4296 decl_fini_priority_lookup
4297 (current_function_decl
));
4301 struct rtl_opt_pass pass_final
=
4307 rest_of_handle_final
, /* execute */
4310 0, /* static_pass_number */
4311 TV_FINAL
, /* tv_id */
4312 0, /* properties_required */
4313 0, /* properties_provided */
4314 0, /* properties_destroyed */
4315 0, /* todo_flags_start */
4316 TODO_ggc_collect
/* todo_flags_finish */
4322 rest_of_handle_shorten_branches (void)
4324 /* Shorten branches. */
4325 shorten_branches (get_insns ());
4329 struct rtl_opt_pass pass_shorten_branches
=
4333 "shorten", /* name */
4335 rest_of_handle_shorten_branches
, /* execute */
4338 0, /* static_pass_number */
4339 TV_FINAL
, /* tv_id */
4340 0, /* properties_required */
4341 0, /* properties_provided */
4342 0, /* properties_destroyed */
4343 0, /* todo_flags_start */
4344 TODO_dump_func
/* todo_flags_finish */
4350 rest_of_clean_state (void)
4353 FILE *final_output
= NULL
;
4354 int save_unnumbered
= flag_dump_unnumbered
;
4355 int save_noaddr
= flag_dump_noaddr
;
4357 if (flag_dump_final_insns
)
4359 final_output
= fopen (flag_dump_final_insns
, "a");
4362 error ("could not open final insn dump file %qs: %m",
4363 flag_dump_final_insns
);
4364 flag_dump_final_insns
= NULL
;
4369 struct cgraph_node
*node
= cgraph_node (current_function_decl
);
4371 aname
= (IDENTIFIER_POINTER
4372 (DECL_ASSEMBLER_NAME (current_function_decl
)));
4373 fprintf (final_output
, "\n;; Function (%s) %s\n\n", aname
,
4374 node
->frequency
== NODE_FREQUENCY_HOT
4376 : node
->frequency
== NODE_FREQUENCY_UNLIKELY_EXECUTED
4377 ? " (unlikely executed)"
4378 : node
->frequency
== NODE_FREQUENCY_EXECUTED_ONCE
4379 ? " (executed once)"
4382 flag_dump_noaddr
= flag_dump_unnumbered
= 1;
4383 if (flag_compare_debug_opt
|| flag_compare_debug
)
4384 dump_flags
|= TDF_NOUID
;
4385 final_insns_dump_p
= true;
4387 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4389 INSN_UID (insn
) = CODE_LABEL_NUMBER (insn
);
4391 INSN_UID (insn
) = 0;
4395 /* It is very important to decompose the RTL instruction chain here:
4396 debug information keeps pointing into CODE_LABEL insns inside the function
4397 body. If these remain pointing to the other insns, we end up preserving
4398 whole RTL chain and attached detailed debug info in memory. */
4399 for (insn
= get_insns (); insn
; insn
= next
)
4401 next
= NEXT_INSN (insn
);
4402 NEXT_INSN (insn
) = NULL
;
4403 PREV_INSN (insn
) = NULL
;
4406 && (!NOTE_P (insn
) ||
4407 (NOTE_KIND (insn
) != NOTE_INSN_VAR_LOCATION
4408 && NOTE_KIND (insn
) != NOTE_INSN_BLOCK_BEG
4409 && NOTE_KIND (insn
) != NOTE_INSN_BLOCK_END
4410 && NOTE_KIND (insn
) != NOTE_INSN_CFA_RESTORE_STATE
)))
4411 print_rtl_single (final_output
, insn
);
4417 flag_dump_noaddr
= save_noaddr
;
4418 flag_dump_unnumbered
= save_unnumbered
;
4419 final_insns_dump_p
= false;
4421 if (fclose (final_output
))
4423 error ("could not close final insn dump file %qs: %m",
4424 flag_dump_final_insns
);
4425 flag_dump_final_insns
= NULL
;
4429 /* In case the function was not output,
4430 don't leave any temporary anonymous types
4431 queued up for sdb output. */
4432 #ifdef SDB_DEBUGGING_INFO
4433 if (write_symbols
== SDB_DEBUG
)
4434 sdbout_types (NULL_TREE
);
4437 flag_rerun_cse_after_global_opts
= 0;
4438 reload_completed
= 0;
4439 epilogue_completed
= 0;
4441 regstack_completed
= 0;
4444 /* Clear out the insn_length contents now that they are no
4446 init_insn_lengths ();
4448 /* Show no temporary slots allocated. */
4451 free_bb_for_insn ();
4455 if (targetm
.binds_local_p (current_function_decl
))
4457 unsigned int pref
= crtl
->preferred_stack_boundary
;
4458 if (crtl
->stack_alignment_needed
> crtl
->preferred_stack_boundary
)
4459 pref
= crtl
->stack_alignment_needed
;
4460 cgraph_rtl_info (current_function_decl
)->preferred_incoming_stack_boundary
4464 /* Make sure volatile mem refs aren't considered valid operands for
4465 arithmetic insns. We must call this here if this is a nested inline
4466 function, since the above code leaves us in the init_recog state,
4467 and the function context push/pop code does not save/restore volatile_ok.
4469 ??? Maybe it isn't necessary for expand_start_function to call this
4470 anymore if we do it here? */
4472 init_recog_no_volatile ();
4474 /* We're done with this function. Free up memory if we can. */
4475 free_after_parsing (cfun
);
4476 free_after_compilation (cfun
);
4480 struct rtl_opt_pass pass_clean_state
=
4484 "*clean_state", /* name */
4486 rest_of_clean_state
, /* execute */
4489 0, /* static_pass_number */
4490 TV_FINAL
, /* tv_id */
4491 0, /* properties_required */
4492 0, /* properties_provided */
4493 PROP_rtl
, /* properties_destroyed */
4494 0, /* todo_flags_start */
4495 0 /* todo_flags_finish */