1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-98, 1999 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
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 as assembler code by the macros FUNCTION_PROLOGUE and
45 FUNCTION_EPILOGUE. Those instructions never exist as rtl. */
53 #include "insn-config.h"
54 #include "insn-flags.h"
55 #include "insn-attr.h"
56 #include "insn-codes.h"
58 #include "conditions.h"
61 #include "hard-reg-set.h"
70 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
71 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
73 #if defined (USG) || !defined (HAVE_STAB_H)
74 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
79 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
81 #ifdef XCOFF_DEBUGGING_INFO
85 #ifdef DWARF_DEBUGGING_INFO
89 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
90 #include "dwarf2out.h"
93 #ifdef SDB_DEBUGGING_INFO
97 /* .stabd code for line number. */
102 /* .stabs code for included file name. */
107 #ifndef INT_TYPE_SIZE
108 #define INT_TYPE_SIZE BITS_PER_WORD
111 #ifndef LONG_TYPE_SIZE
112 #define LONG_TYPE_SIZE BITS_PER_WORD
115 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
116 null default for it to save conditionalization later. */
117 #ifndef CC_STATUS_INIT
118 #define CC_STATUS_INIT
121 /* How to start an assembler comment. */
122 #ifndef ASM_COMMENT_START
123 #define ASM_COMMENT_START ";#"
126 /* Is the given character a logical line separator for the assembler? */
127 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
128 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
131 #ifndef JUMP_TABLES_IN_TEXT_SECTION
132 #define JUMP_TABLES_IN_TEXT_SECTION 0
135 /* Last insn processed by final_scan_insn. */
136 static rtx debug_insn
= 0;
138 /* Line number of last NOTE. */
139 static int last_linenum
;
141 /* Highest line number in current block. */
142 static int high_block_linenum
;
144 /* Likewise for function. */
145 static int high_function_linenum
;
147 /* Filename of last NOTE. */
148 static char *last_filename
;
150 /* Number of basic blocks seen so far;
151 used if profile_block_flag is set. */
152 static int count_basic_blocks
;
154 /* Number of instrumented arcs when profile_arc_flag is set. */
155 extern int count_instrumented_arcs
;
157 extern int length_unit_log
; /* This is defined in insn-attrtab.c. */
159 /* Nonzero while outputting an `asm' with operands.
160 This means that inconsistencies are the user's fault, so don't abort.
161 The precise value is the insn being output, to pass to error_for_asm. */
162 static rtx this_is_asm_operands
;
164 /* Number of operands of this insn, for an `asm' with operands. */
165 static unsigned int insn_noperands
;
167 /* Compare optimization flag. */
169 static rtx last_ignored_compare
= 0;
171 /* Flag indicating this insn is the start of a new basic block. */
173 static int new_block
= 1;
175 /* All the symbol-blocks (levels of scoping) in the compilation
176 are assigned sequence numbers in order of appearance of the
177 beginnings of the symbol-blocks. Both final and dbxout do this,
178 and assume that they will both give the same number to each block.
179 Final uses these sequence numbers to generate assembler label names
180 LBBnnn and LBEnnn for the beginning and end of the symbol-block.
181 Dbxout uses the sequence numbers to generate references to the same labels
182 from the dbx debugging information.
184 Sdb records this level at the beginning of each function,
185 in order to find the current level when recursing down declarations.
186 It outputs the block beginning and endings
187 at the point in the asm file where the blocks would begin and end. */
189 int next_block_index
;
191 /* Assign a unique number to each insn that is output.
192 This can be used to generate unique local labels. */
194 static int insn_counter
= 0;
197 /* This variable contains machine-dependent flags (defined in tm.h)
198 set and examined by output routines
199 that describe how to interpret the condition codes properly. */
203 /* During output of an insn, this contains a copy of cc_status
204 from before the insn. */
206 CC_STATUS cc_prev_status
;
209 /* Indexed by hardware reg number, is 1 if that register is ever
210 used in the current function.
212 In life_analysis, or in stupid_life_analysis, this is set
213 up to record the hard regs used explicitly. Reload adds
214 in the hard regs used for holding pseudo regs. Final uses
215 it to generate the code in the function prologue and epilogue
216 to save and restore registers as needed. */
218 char regs_ever_live
[FIRST_PSEUDO_REGISTER
];
220 /* Nonzero means current function must be given a frame pointer.
221 Set in stmt.c if anything is allocated on the stack there.
222 Set in reload1.c if anything is allocated on the stack there. */
224 int frame_pointer_needed
;
226 /* Assign unique numbers to labels generated for profiling. */
228 int profile_label_no
;
230 /* Length so far allocated in PENDING_BLOCKS. */
232 static int max_block_depth
;
234 /* Stack of sequence numbers of symbol-blocks of which we have seen the
235 beginning but not yet the end. Sequence numbers are assigned at
236 the beginning; this stack allows us to find the sequence number
237 of a block that is ending. */
239 static int *pending_blocks
;
241 /* Number of elements currently in use in PENDING_BLOCKS. */
243 static int block_depth
;
245 /* Nonzero if have enabled APP processing of our assembler output. */
249 /* If we are outputting an insn sequence, this contains the sequence rtx.
254 #ifdef ASSEMBLER_DIALECT
256 /* Number of the assembler dialect to use, starting at 0. */
257 static int dialect_number
;
260 /* Indexed by line number, nonzero if there is a note for that line. */
262 static char *line_note_exists
;
264 /* Linked list to hold line numbers for each basic block. */
267 struct bb_list
*next
; /* pointer to next basic block */
268 int line_num
; /* line number */
269 int file_label_num
; /* LPBC<n> label # for stored filename */
270 int func_label_num
; /* LPBC<n> label # for stored function name */
273 static struct bb_list
*bb_head
= 0; /* Head of basic block list */
274 static struct bb_list
**bb_tail
= &bb_head
; /* Ptr to store next bb ptr */
275 static int bb_file_label_num
= -1; /* Current label # for file */
276 static int bb_func_label_num
= -1; /* Current label # for func */
278 /* Linked list to hold the strings for each file and function name output. */
281 struct bb_str
*next
; /* pointer to next string */
282 const char *string
; /* string */
283 int label_num
; /* label number */
284 int length
; /* string length */
288 extern rtx peephole
PROTO((rtx
));
291 static struct bb_str
*sbb_head
= 0; /* Head of string list. */
292 static struct bb_str
**sbb_tail
= &sbb_head
; /* Ptr to store next bb str */
293 static int sbb_label_num
= 0; /* Last label used */
295 #ifdef HAVE_ATTR_length
296 static int asm_insn_count
PROTO((rtx
));
298 static void profile_function
PROTO((FILE *));
299 static void profile_after_prologue
PROTO((FILE *));
300 static void add_bb
PROTO((FILE *));
301 static int add_bb_string
PROTO((const char *, int));
302 static void output_source_line
PROTO((FILE *, rtx
));
303 static rtx walk_alter_subreg
PROTO((rtx
));
304 static void output_asm_name
PROTO((void));
305 static void output_operand
PROTO((rtx
, int));
306 #ifdef LEAF_REGISTERS
307 static void leaf_renumber_regs
PROTO((rtx
));
310 static int alter_cond
PROTO((rtx
));
313 /* Initialize data in final at the beginning of a compilation. */
316 init_final (filename
)
317 const char *filename ATTRIBUTE_UNUSED
;
319 next_block_index
= 2;
321 max_block_depth
= 20;
322 pending_blocks
= (int *) xmalloc (20 * sizeof *pending_blocks
);
325 #ifdef ASSEMBLER_DIALECT
326 dialect_number
= ASSEMBLER_DIALECT
;
330 /* Called at end of source file,
331 to output the block-profiling table for this entire compilation. */
335 const char *filename
;
339 if (profile_block_flag
|| profile_arc_flag
)
342 int align
= exact_log2 (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
);
346 int long_bytes
= LONG_TYPE_SIZE
/ BITS_PER_UNIT
;
347 int pointer_bytes
= POINTER_SIZE
/ BITS_PER_UNIT
;
349 if (profile_block_flag
)
350 size
= long_bytes
* count_basic_blocks
;
352 size
= long_bytes
* count_instrumented_arcs
;
355 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
356 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
357 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
361 /* Output the main header, of 11 words:
362 0: 1 if this file is initialized, else 0.
363 1: address of file name (LPBX1).
364 2: address of table of counts (LPBX2).
365 3: number of counts in the table.
366 4: always 0, for compatibility with Sun.
368 The following are GNU extensions:
370 5: address of table of start addrs of basic blocks (LPBX3).
371 6: Number of bytes in this header.
372 7: address of table of function names (LPBX4).
373 8: address of table of line numbers (LPBX5) or 0.
374 9: address of table of file names (LPBX6) or 0.
375 10: space reserved for basic block profiling. */
377 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
379 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 0);
381 assemble_integer (const0_rtx
, long_bytes
, 1);
383 /* address of filename */
384 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 1);
385 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
, 1);
387 /* address of count table */
388 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 2);
389 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
, 1);
391 /* count of the # of basic blocks or # of instrumented arcs */
392 if (profile_block_flag
)
393 assemble_integer (GEN_INT (count_basic_blocks
), long_bytes
, 1);
395 assemble_integer (GEN_INT (count_instrumented_arcs
), long_bytes
,
398 /* zero word (link field) */
399 assemble_integer (const0_rtx
, pointer_bytes
, 1);
401 /* address of basic block start address table */
402 if (profile_block_flag
)
404 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 3);
405 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
,
409 assemble_integer (const0_rtx
, pointer_bytes
, 1);
411 /* byte count for extended structure. */
412 assemble_integer (GEN_INT (11 * UNITS_PER_WORD
), long_bytes
, 1);
414 /* address of function name table */
415 if (profile_block_flag
)
417 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 4);
418 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
,
422 assemble_integer (const0_rtx
, pointer_bytes
, 1);
424 /* address of line number and filename tables if debugging. */
425 if (write_symbols
!= NO_DEBUG
&& profile_block_flag
)
427 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 5);
428 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
, 1);
429 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 6);
430 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
, 1);
434 assemble_integer (const0_rtx
, pointer_bytes
, 1);
435 assemble_integer (const0_rtx
, pointer_bytes
, 1);
438 /* space for extension ptr (link field) */
439 assemble_integer (const0_rtx
, UNITS_PER_WORD
, 1);
441 /* Output the file name changing the suffix to .d for Sun tcov
443 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 1);
445 char *cwd
= getpwd ();
446 int len
= strlen (filename
) + strlen (cwd
) + 1;
447 char *data_file
= (char *) alloca (len
+ 4);
449 strcpy (data_file
, cwd
);
450 strcat (data_file
, "/");
451 strcat (data_file
, filename
);
452 strip_off_ending (data_file
, len
);
453 if (profile_block_flag
)
454 strcat (data_file
, ".d");
456 strcat (data_file
, ".da");
457 assemble_string (data_file
, strlen (data_file
) + 1);
460 /* Make space for the table of counts. */
463 /* Realign data section. */
464 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
465 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 2);
467 assemble_zeros (size
);
471 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 2);
472 #ifdef ASM_OUTPUT_SHARED_LOCAL
473 if (flag_shared_data
)
474 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
477 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
478 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
481 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
482 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
,
485 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
490 /* Output any basic block strings */
491 if (profile_block_flag
)
493 readonly_data_section ();
496 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
497 for (sptr
= sbb_head
; sptr
!= 0; sptr
= sptr
->next
)
499 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBC",
501 assemble_string (sptr
->string
, sptr
->length
);
506 /* Output the table of addresses. */
507 if (profile_block_flag
)
509 /* Realign in new section */
510 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
511 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 3);
512 for (i
= 0; i
< count_basic_blocks
; i
++)
514 ASM_GENERATE_INTERNAL_LABEL (name
, "LPB", i
);
515 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
),
520 /* Output the table of function names. */
521 if (profile_block_flag
)
523 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 4);
524 for ((ptr
= bb_head
), (i
= 0); ptr
!= 0; (ptr
= ptr
->next
), i
++)
526 if (ptr
->func_label_num
>= 0)
528 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBC",
529 ptr
->func_label_num
);
530 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
),
534 assemble_integer (const0_rtx
, pointer_bytes
, 1);
537 for ( ; i
< count_basic_blocks
; i
++)
538 assemble_integer (const0_rtx
, pointer_bytes
, 1);
541 if (write_symbols
!= NO_DEBUG
&& profile_block_flag
)
543 /* Output the table of line numbers. */
544 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 5);
545 for ((ptr
= bb_head
), (i
= 0); ptr
!= 0; (ptr
= ptr
->next
), i
++)
546 assemble_integer (GEN_INT (ptr
->line_num
), long_bytes
, 1);
548 for ( ; i
< count_basic_blocks
; i
++)
549 assemble_integer (const0_rtx
, long_bytes
, 1);
551 /* Output the table of file names. */
552 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 6);
553 for ((ptr
= bb_head
), (i
= 0); ptr
!= 0; (ptr
= ptr
->next
), i
++)
555 if (ptr
->file_label_num
>= 0)
557 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBC",
558 ptr
->file_label_num
);
559 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
),
563 assemble_integer (const0_rtx
, pointer_bytes
, 1);
566 for ( ; i
< count_basic_blocks
; i
++)
567 assemble_integer (const0_rtx
, pointer_bytes
, 1);
570 /* End with the address of the table of addresses,
571 so we can find it easily, as the last word in the file's text. */
572 if (profile_block_flag
)
574 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 3);
575 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
,
581 /* Enable APP processing of subsequent output.
582 Used before the output from an `asm' statement. */
589 fputs (ASM_APP_ON
, asm_out_file
);
594 /* Disable APP processing of subsequent output.
595 Called from varasm.c before most kinds of output. */
602 fputs (ASM_APP_OFF
, asm_out_file
);
607 /* Return the number of slots filled in the current
608 delayed branch sequence (we don't count the insn needing the
609 delay slot). Zero if not in a delayed branch sequence. */
613 dbr_sequence_length ()
615 if (final_sequence
!= 0)
616 return XVECLEN (final_sequence
, 0) - 1;
622 /* The next two pages contain routines used to compute the length of an insn
623 and to shorten branches. */
625 /* Arrays for insn lengths, and addresses. The latter is referenced by
626 `insn_current_length'. */
628 static short *insn_lengths
;
631 /* Max uid for which the above arrays are valid. */
632 static int insn_lengths_max_uid
;
634 /* Address of insn being processed. Used by `insn_current_length'. */
635 int insn_current_address
;
637 /* Address of insn being processed in previous iteration. */
638 int insn_last_address
;
640 /* konwn invariant alignment of insn being processed. */
641 int insn_current_align
;
643 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
644 gives the next following alignment insn that increases the known
645 alignment, or NULL_RTX if there is no such insn.
646 For any alignment obtained this way, we can again index uid_align with
647 its uid to obtain the next following align that in turn increases the
648 alignment, till we reach NULL_RTX; the sequence obtained this way
649 for each insn we'll call the alignment chain of this insn in the following
652 struct label_alignment
{
657 static rtx
*uid_align
;
658 static int *uid_shuid
;
659 static struct label_alignment
*label_align
;
661 /* Indicate that branch shortening hasn't yet been done. */
680 insn_lengths_max_uid
= 0;
684 free (insn_addresses
);
694 /* Obtain the current length of an insn. If branch shortening has been done,
695 get its actual length. Otherwise, get its maximum length. */
698 get_attr_length (insn
)
701 #ifdef HAVE_ATTR_length
706 if (insn_lengths_max_uid
> INSN_UID (insn
))
707 return insn_lengths
[INSN_UID (insn
)];
709 switch (GET_CODE (insn
))
717 length
= insn_default_length (insn
);
721 body
= PATTERN (insn
);
722 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
724 /* Alignment is machine-dependent and should be handled by
728 length
= insn_default_length (insn
);
732 body
= PATTERN (insn
);
733 if (GET_CODE (body
) == USE
|| GET_CODE (body
) == CLOBBER
)
736 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
737 length
= asm_insn_count (body
) * insn_default_length (insn
);
738 else if (GET_CODE (body
) == SEQUENCE
)
739 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
740 length
+= get_attr_length (XVECEXP (body
, 0, i
));
742 length
= insn_default_length (insn
);
749 #ifdef ADJUST_INSN_LENGTH
750 ADJUST_INSN_LENGTH (insn
, length
);
753 #else /* not HAVE_ATTR_length */
755 #endif /* not HAVE_ATTR_length */
758 /* Code to handle alignment inside shorten_branches. */
760 /* Here is an explanation how the algorithm in align_fuzz can give
763 Call a sequence of instructions beginning with alignment point X
764 and continuing until the next alignment point `block X'. When `X'
765 is used in an expression, it means the alignment value of the
768 Call the distance between the start of the first insn of block X, and
769 the end of the last insn of block X `IX', for the `inner size of X'.
770 This is clearly the sum of the instruction lengths.
772 Likewise with the next alignment-delimited block following X, which we
775 Call the distance between the start of the first insn of block X, and
776 the start of the first insn of block Y `OX', for the `outer size of X'.
778 The estimated padding is then OX - IX.
780 OX can be safely estimated as
785 OX = round_up(IX, X) + Y - X
787 Clearly est(IX) >= real(IX), because that only depends on the
788 instruction lengths, and those being overestimated is a given.
790 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
791 we needn't worry about that when thinking about OX.
793 When X >= Y, the alignment provided by Y adds no uncertainty factor
794 for branch ranges starting before X, so we can just round what we have.
795 But when X < Y, we don't know anything about the, so to speak,
796 `middle bits', so we have to assume the worst when aligning up from an
797 address mod X to one mod Y, which is Y - X. */
800 #define LABEL_ALIGN(LABEL) 0
803 #ifndef LABEL_ALIGN_MAX_SKIP
804 #define LABEL_ALIGN_MAX_SKIP 0
808 #define LOOP_ALIGN(LABEL) 0
811 #ifndef LOOP_ALIGN_MAX_SKIP
812 #define LOOP_ALIGN_MAX_SKIP 0
815 #ifndef LABEL_ALIGN_AFTER_BARRIER
816 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
819 #ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
820 #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP 0
823 #ifndef ADDR_VEC_ALIGN
825 final_addr_vec_align (addr_vec
)
828 int align
= exact_log2 (GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec
))));
830 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
831 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
835 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
838 #ifndef INSN_LENGTH_ALIGNMENT
839 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
842 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
844 static int min_labelno
, max_labelno
;
846 #define LABEL_TO_ALIGNMENT(LABEL) \
847 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
849 #define LABEL_TO_MAX_SKIP(LABEL) \
850 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
852 /* For the benefit of port specific code do this also as a function. */
854 label_to_alignment (label
)
857 return LABEL_TO_ALIGNMENT (label
);
860 #ifdef HAVE_ATTR_length
861 /* The differences in addresses
862 between a branch and its target might grow or shrink depending on
863 the alignment the start insn of the range (the branch for a forward
864 branch or the label for a backward branch) starts out on; if these
865 differences are used naively, they can even oscillate infinitely.
866 We therefore want to compute a 'worst case' address difference that
867 is independent of the alignment the start insn of the range end
868 up on, and that is at least as large as the actual difference.
869 The function align_fuzz calculates the amount we have to add to the
870 naively computed difference, by traversing the part of the alignment
871 chain of the start insn of the range that is in front of the end insn
872 of the range, and considering for each alignment the maximum amount
873 that it might contribute to a size increase.
875 For casesi tables, we also want to know worst case minimum amounts of
876 address difference, in case a machine description wants to introduce
877 some common offset that is added to all offsets in a table.
878 For this purpose, align_fuzz with a growth argument of 0 comuptes the
879 appropriate adjustment. */
882 /* Compute the maximum delta by which the difference of the addresses of
883 START and END might grow / shrink due to a different address for start
884 which changes the size of alignment insns between START and END.
885 KNOWN_ALIGN_LOG is the alignment known for START.
886 GROWTH should be ~0 if the objective is to compute potential code size
887 increase, and 0 if the objective is to compute potential shrink.
888 The return value is undefined for any other value of GROWTH. */
890 align_fuzz (start
, end
, known_align_log
, growth
)
895 int uid
= INSN_UID (start
);
897 int known_align
= 1 << known_align_log
;
898 int end_shuid
= INSN_SHUID (end
);
901 for (align_label
= uid_align
[uid
]; align_label
; align_label
= uid_align
[uid
])
903 int align_addr
, new_align
;
905 uid
= INSN_UID (align_label
);
906 align_addr
= insn_addresses
[uid
] - insn_lengths
[uid
];
907 if (uid_shuid
[uid
] > end_shuid
)
909 known_align_log
= LABEL_TO_ALIGNMENT (align_label
);
910 new_align
= 1 << known_align_log
;
911 if (new_align
< known_align
)
913 fuzz
+= (-align_addr
^ growth
) & (new_align
- known_align
);
914 known_align
= new_align
;
919 /* Compute a worst-case reference address of a branch so that it
920 can be safely used in the presence of aligned labels. Since the
921 size of the branch itself is unknown, the size of the branch is
922 not included in the range. I.e. for a forward branch, the reference
923 address is the end address of the branch as known from the previous
924 branch shortening pass, minus a value to account for possible size
925 increase due to alignment. For a backward branch, it is the start
926 address of the branch as known from the current pass, plus a value
927 to account for possible size increase due to alignment.
928 NB.: Therefore, the maximum offset allowed for backward branches needs
929 to exclude the branch size. */
931 insn_current_reference_address (branch
)
935 rtx seq
= NEXT_INSN (PREV_INSN (branch
));
936 int seq_uid
= INSN_UID (seq
);
937 if (GET_CODE (branch
) != JUMP_INSN
)
938 /* This can happen for example on the PA; the objective is to know the
939 offset to address something in front of the start of the function.
940 Thus, we can treat it like a backward branch.
941 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
942 any alignment we'd encounter, so we skip the call to align_fuzz. */
943 return insn_current_address
;
944 dest
= JUMP_LABEL (branch
);
945 /* BRANCH has no proper alignment chain set, so use SEQ. */
946 if (INSN_SHUID (branch
) < INSN_SHUID (dest
))
948 /* Forward branch. */
949 return (insn_last_address
+ insn_lengths
[seq_uid
]
950 - align_fuzz (seq
, dest
, length_unit_log
, ~0));
954 /* Backward branch. */
955 return (insn_current_address
956 + align_fuzz (dest
, seq
, length_unit_log
, ~0));
959 #endif /* HAVE_ATTR_length */
961 /* Make a pass over all insns and compute their actual lengths by shortening
962 any branches of variable length if possible. */
964 /* Give a default value for the lowest address in a function. */
966 #ifndef FIRST_INSN_ADDRESS
967 #define FIRST_INSN_ADDRESS 0
970 /* shorten_branches might be called multiple times: for example, the SH
971 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
972 In order to do this, it needs proper length information, which it obtains
973 by calling shorten_branches. This cannot be collapsed with
974 shorten_branches itself into a single pass unless we also want to intergate
975 reorg.c, since the branch splitting exposes new instructions with delay
979 shorten_branches (first
)
987 #ifdef HAVE_ATTR_length
988 #define MAX_CODE_ALIGN 16
990 int something_changed
= 1;
991 char *varying_length
;
994 rtx align_tab
[MAX_CODE_ALIGN
];
996 /* In order to make sure that all instructions have valid length info,
997 we must split them before we compute the address/length info. */
999 for (insn
= NEXT_INSN (first
); insn
; insn
= NEXT_INSN (insn
))
1000 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
1003 /* Don't split the insn if it has been deleted. */
1004 if (! INSN_DELETED_P (old
))
1005 insn
= try_split (PATTERN (old
), old
, 1);
1006 /* When not optimizing, the old insn will be still left around
1007 with only the 'deleted' bit set. Transform it into a note
1008 to avoid confusion of subsequent processing. */
1009 if (INSN_DELETED_P (old
))
1011 PUT_CODE (old
, NOTE
);
1012 NOTE_LINE_NUMBER (old
) = NOTE_INSN_DELETED
;
1013 NOTE_SOURCE_FILE (old
) = 0;
1018 /* We must do some computations even when not actually shortening, in
1019 order to get the alignment information for the labels. */
1021 init_insn_lengths ();
1023 /* Compute maximum UID and allocate label_align / uid_shuid. */
1024 max_uid
= get_max_uid ();
1026 max_labelno
= max_label_num ();
1027 min_labelno
= get_first_label_num ();
1028 label_align
= (struct label_alignment
*) xmalloc (
1029 (max_labelno
- min_labelno
+ 1) * sizeof (struct label_alignment
));
1030 bzero ((char *) label_align
,
1031 (max_labelno
- min_labelno
+ 1) * sizeof (struct label_alignment
));
1033 uid_shuid
= (int *) xmalloc (max_uid
* sizeof *uid_shuid
);
1035 /* Initialize label_align and set up uid_shuid to be strictly
1036 monotonically rising with insn order. */
1037 /* We use max_log here to keep track of the maximum alignment we want to
1038 impose on the next CODE_LABEL (or the current one if we are processing
1039 the CODE_LABEL itself). */
1044 for (insn
= get_insns (), i
= 1; insn
; insn
= NEXT_INSN (insn
))
1048 INSN_SHUID (insn
) = i
++;
1049 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
1051 /* reorg might make the first insn of a loop being run once only,
1052 and delete the label in front of it. Then we want to apply
1053 the loop alignment to the new label created by reorg, which
1054 is separated by the former loop start insn from the
1055 NOTE_INSN_LOOP_BEG. */
1057 else if (GET_CODE (insn
) == CODE_LABEL
)
1061 log
= LABEL_ALIGN (insn
);
1065 max_skip
= LABEL_ALIGN_MAX_SKIP
;
1067 next
= NEXT_INSN (insn
);
1068 /* ADDR_VECs only take room if read-only data goes into the text
1070 if (JUMP_TABLES_IN_TEXT_SECTION
1071 #if !defined(READONLY_DATA_SECTION)
1075 if (next
&& GET_CODE (next
) == JUMP_INSN
)
1077 rtx nextbody
= PATTERN (next
);
1078 if (GET_CODE (nextbody
) == ADDR_VEC
1079 || GET_CODE (nextbody
) == ADDR_DIFF_VEC
)
1081 log
= ADDR_VEC_ALIGN (next
);
1085 max_skip
= LABEL_ALIGN_MAX_SKIP
;
1089 LABEL_TO_ALIGNMENT (insn
) = max_log
;
1090 LABEL_TO_MAX_SKIP (insn
) = max_skip
;
1094 else if (GET_CODE (insn
) == BARRIER
)
1098 for (label
= insn
; label
&& GET_RTX_CLASS (GET_CODE (label
)) != 'i';
1099 label
= NEXT_INSN (label
))
1100 if (GET_CODE (label
) == CODE_LABEL
)
1102 log
= LABEL_ALIGN_AFTER_BARRIER (insn
);
1106 max_skip
= LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
;
1111 /* Again, we allow NOTE_INSN_LOOP_BEG - INSN - CODE_LABEL
1112 sequences in order to handle reorg output efficiently. */
1113 else if (GET_CODE (insn
) == NOTE
1114 && NOTE_LINE_NUMBER (insn
) == NOTE_INSN_LOOP_BEG
)
1119 /* Search for the label that starts the loop.
1120 Don't skip past the end of the loop, since that could
1121 lead to putting an alignment where it does not belong.
1122 However, a label after a nested (non-)loop would be OK. */
1123 for (label
= insn
; label
; label
= NEXT_INSN (label
))
1125 if (GET_CODE (label
) == NOTE
1126 && NOTE_LINE_NUMBER (label
) == NOTE_INSN_LOOP_BEG
)
1128 else if (GET_CODE (label
) == NOTE
1129 && NOTE_LINE_NUMBER (label
) == NOTE_INSN_LOOP_END
1132 else if (GET_CODE (label
) == CODE_LABEL
)
1134 log
= LOOP_ALIGN (insn
);
1138 max_skip
= LOOP_ALIGN_MAX_SKIP
;
1147 #ifdef HAVE_ATTR_length
1149 /* Allocate the rest of the arrays. */
1150 insn_lengths
= (short *) xmalloc (max_uid
* sizeof (short));
1151 insn_addresses
= (int *) xmalloc (max_uid
* sizeof (int));
1152 insn_lengths_max_uid
= max_uid
;
1153 /* Syntax errors can lead to labels being outside of the main insn stream.
1154 Initialize insn_addresses, so that we get reproducible results. */
1155 bzero ((char *)insn_addresses
, max_uid
* sizeof *insn_addresses
);
1156 uid_align
= (rtx
*) xmalloc (max_uid
* sizeof *uid_align
);
1158 varying_length
= (char *) xmalloc (max_uid
* sizeof (char));
1160 bzero (varying_length
, max_uid
);
1162 /* Initialize uid_align. We scan instructions
1163 from end to start, and keep in align_tab[n] the last seen insn
1164 that does an alignment of at least n+1, i.e. the successor
1165 in the alignment chain for an insn that does / has a known
1168 bzero ((char *) uid_align
, max_uid
* sizeof *uid_align
);
1170 for (i
= MAX_CODE_ALIGN
; --i
>= 0; )
1171 align_tab
[i
] = NULL_RTX
;
1172 seq
= get_last_insn ();
1173 for (; seq
; seq
= PREV_INSN (seq
))
1175 int uid
= INSN_UID (seq
);
1177 log
= (GET_CODE (seq
) == CODE_LABEL
? LABEL_TO_ALIGNMENT (seq
) : 0);
1178 uid_align
[uid
] = align_tab
[0];
1181 /* Found an alignment label. */
1182 uid_align
[uid
] = align_tab
[log
];
1183 for (i
= log
- 1; i
>= 0; i
--)
1187 #ifdef CASE_VECTOR_SHORTEN_MODE
1190 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1193 int min_shuid
= INSN_SHUID (get_insns ()) - 1;
1194 int max_shuid
= INSN_SHUID (get_last_insn ()) + 1;
1197 for (insn
= first
; insn
!= 0; insn
= NEXT_INSN (insn
))
1199 rtx min_lab
= NULL_RTX
, max_lab
= NULL_RTX
, pat
;
1200 int len
, i
, min
, max
, insn_shuid
;
1202 addr_diff_vec_flags flags
;
1204 if (GET_CODE (insn
) != JUMP_INSN
1205 || GET_CODE (PATTERN (insn
)) != ADDR_DIFF_VEC
)
1207 pat
= PATTERN (insn
);
1208 len
= XVECLEN (pat
, 1);
1211 min_align
= MAX_CODE_ALIGN
;
1212 for (min
= max_shuid
, max
= min_shuid
, i
= len
- 1; i
>= 0; i
--)
1214 rtx lab
= XEXP (XVECEXP (pat
, 1, i
), 0);
1215 int shuid
= INSN_SHUID (lab
);
1226 if (min_align
> LABEL_TO_ALIGNMENT (lab
))
1227 min_align
= LABEL_TO_ALIGNMENT (lab
);
1229 XEXP (pat
, 2) = gen_rtx_LABEL_REF (VOIDmode
, min_lab
);
1230 XEXP (pat
, 3) = gen_rtx_LABEL_REF (VOIDmode
, max_lab
);
1231 insn_shuid
= INSN_SHUID (insn
);
1232 rel
= INSN_SHUID (XEXP (XEXP (pat
, 0), 0));
1233 flags
.min_align
= min_align
;
1234 flags
.base_after_vec
= rel
> insn_shuid
;
1235 flags
.min_after_vec
= min
> insn_shuid
;
1236 flags
.max_after_vec
= max
> insn_shuid
;
1237 flags
.min_after_base
= min
> rel
;
1238 flags
.max_after_base
= max
> rel
;
1239 ADDR_DIFF_VEC_FLAGS (pat
) = flags
;
1242 #endif /* CASE_VECTOR_SHORTEN_MODE */
1245 /* Compute initial lengths, addresses, and varying flags for each insn. */
1246 for (insn_current_address
= FIRST_INSN_ADDRESS
, insn
= first
;
1248 insn_current_address
+= insn_lengths
[uid
], insn
= NEXT_INSN (insn
))
1250 uid
= INSN_UID (insn
);
1252 insn_lengths
[uid
] = 0;
1254 if (GET_CODE (insn
) == CODE_LABEL
)
1256 int log
= LABEL_TO_ALIGNMENT (insn
);
1259 int align
= 1 << log
;
1260 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1261 insn_lengths
[uid
] = new_address
- insn_current_address
;
1262 insn_current_address
= new_address
;
1266 insn_addresses
[uid
] = insn_current_address
;
1268 if (GET_CODE (insn
) == NOTE
|| GET_CODE (insn
) == BARRIER
1269 || GET_CODE (insn
) == CODE_LABEL
)
1271 if (INSN_DELETED_P (insn
))
1274 body
= PATTERN (insn
);
1275 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
1277 /* This only takes room if read-only data goes into the text
1279 if (JUMP_TABLES_IN_TEXT_SECTION
1280 #if !defined(READONLY_DATA_SECTION)
1284 insn_lengths
[uid
] = (XVECLEN (body
,
1285 GET_CODE (body
) == ADDR_DIFF_VEC
)
1286 * GET_MODE_SIZE (GET_MODE (body
)));
1287 /* Alignment is handled by ADDR_VEC_ALIGN. */
1289 else if (asm_noperands (body
) >= 0)
1290 insn_lengths
[uid
] = asm_insn_count (body
) * insn_default_length (insn
);
1291 else if (GET_CODE (body
) == SEQUENCE
)
1294 int const_delay_slots
;
1296 const_delay_slots
= const_num_delay_slots (XVECEXP (body
, 0, 0));
1298 const_delay_slots
= 0;
1300 /* Inside a delay slot sequence, we do not do any branch shortening
1301 if the shortening could change the number of delay slots
1303 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1305 rtx inner_insn
= XVECEXP (body
, 0, i
);
1306 int inner_uid
= INSN_UID (inner_insn
);
1309 if (asm_noperands (PATTERN (XVECEXP (body
, 0, i
))) >= 0)
1310 inner_length
= (asm_insn_count (PATTERN (inner_insn
))
1311 * insn_default_length (inner_insn
));
1313 inner_length
= insn_default_length (inner_insn
);
1315 insn_lengths
[inner_uid
] = inner_length
;
1316 if (const_delay_slots
)
1318 if ((varying_length
[inner_uid
]
1319 = insn_variable_length_p (inner_insn
)) != 0)
1320 varying_length
[uid
] = 1;
1321 insn_addresses
[inner_uid
] = (insn_current_address
+
1325 varying_length
[inner_uid
] = 0;
1326 insn_lengths
[uid
] += inner_length
;
1329 else if (GET_CODE (body
) != USE
&& GET_CODE (body
) != CLOBBER
)
1331 insn_lengths
[uid
] = insn_default_length (insn
);
1332 varying_length
[uid
] = insn_variable_length_p (insn
);
1335 /* If needed, do any adjustment. */
1336 #ifdef ADJUST_INSN_LENGTH
1337 ADJUST_INSN_LENGTH (insn
, insn_lengths
[uid
]);
1338 if (insn_lengths
[uid
] < 0)
1339 fatal_insn ("Negative insn length", insn
);
1343 /* Now loop over all the insns finding varying length insns. For each,
1344 get the current insn length. If it has changed, reflect the change.
1345 When nothing changes for a full pass, we are done. */
1347 while (something_changed
)
1349 something_changed
= 0;
1350 insn_current_align
= MAX_CODE_ALIGN
- 1;
1351 for (insn_current_address
= FIRST_INSN_ADDRESS
, insn
= first
;
1353 insn
= NEXT_INSN (insn
))
1356 #ifdef ADJUST_INSN_LENGTH
1361 uid
= INSN_UID (insn
);
1363 if (GET_CODE (insn
) == CODE_LABEL
)
1365 int log
= LABEL_TO_ALIGNMENT (insn
);
1366 if (log
> insn_current_align
)
1368 int align
= 1 << log
;
1369 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1370 insn_lengths
[uid
] = new_address
- insn_current_address
;
1371 insn_current_align
= log
;
1372 insn_current_address
= new_address
;
1375 insn_lengths
[uid
] = 0;
1376 insn_addresses
[uid
] = insn_current_address
;
1380 length_align
= INSN_LENGTH_ALIGNMENT (insn
);
1381 if (length_align
< insn_current_align
)
1382 insn_current_align
= length_align
;
1384 insn_last_address
= insn_addresses
[uid
];
1385 insn_addresses
[uid
] = insn_current_address
;
1387 #ifdef CASE_VECTOR_SHORTEN_MODE
1388 if (optimize
&& GET_CODE (insn
) == JUMP_INSN
1389 && GET_CODE (PATTERN (insn
)) == ADDR_DIFF_VEC
)
1391 rtx body
= PATTERN (insn
);
1392 int old_length
= insn_lengths
[uid
];
1393 rtx rel_lab
= XEXP (XEXP (body
, 0), 0);
1394 rtx min_lab
= XEXP (XEXP (body
, 2), 0);
1395 rtx max_lab
= XEXP (XEXP (body
, 3), 0);
1396 addr_diff_vec_flags flags
= ADDR_DIFF_VEC_FLAGS (body
);
1397 int rel_addr
= insn_addresses
[INSN_UID (rel_lab
)];
1398 int min_addr
= insn_addresses
[INSN_UID (min_lab
)];
1399 int max_addr
= insn_addresses
[INSN_UID (max_lab
)];
1403 /* Try to find a known alignment for rel_lab. */
1404 for (prev
= rel_lab
;
1406 && ! insn_lengths
[INSN_UID (prev
)]
1407 && ! (varying_length
[INSN_UID (prev
)] & 1);
1408 prev
= PREV_INSN (prev
))
1409 if (varying_length
[INSN_UID (prev
)] & 2)
1411 rel_align
= LABEL_TO_ALIGNMENT (prev
);
1415 /* See the comment on addr_diff_vec_flags in rtl.h for the
1416 meaning of the flags values. base: REL_LAB vec: INSN */
1417 /* Anything after INSN has still addresses from the last
1418 pass; adjust these so that they reflect our current
1419 estimate for this pass. */
1420 if (flags
.base_after_vec
)
1421 rel_addr
+= insn_current_address
- insn_last_address
;
1422 if (flags
.min_after_vec
)
1423 min_addr
+= insn_current_address
- insn_last_address
;
1424 if (flags
.max_after_vec
)
1425 max_addr
+= insn_current_address
- insn_last_address
;
1426 /* We want to know the worst case, i.e. lowest possible value
1427 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1428 its offset is positive, and we have to be wary of code shrink;
1429 otherwise, it is negative, and we have to be vary of code
1431 if (flags
.min_after_base
)
1433 /* If INSN is between REL_LAB and MIN_LAB, the size
1434 changes we are about to make can change the alignment
1435 within the observed offset, therefore we have to break
1436 it up into two parts that are independent. */
1437 if (! flags
.base_after_vec
&& flags
.min_after_vec
)
1439 min_addr
-= align_fuzz (rel_lab
, insn
, rel_align
, 0);
1440 min_addr
-= align_fuzz (insn
, min_lab
, 0, 0);
1443 min_addr
-= align_fuzz (rel_lab
, min_lab
, rel_align
, 0);
1447 if (flags
.base_after_vec
&& ! flags
.min_after_vec
)
1449 min_addr
-= align_fuzz (min_lab
, insn
, 0, ~0);
1450 min_addr
-= align_fuzz (insn
, rel_lab
, 0, ~0);
1453 min_addr
-= align_fuzz (min_lab
, rel_lab
, 0, ~0);
1455 /* Likewise, determine the highest lowest possible value
1456 for the offset of MAX_LAB. */
1457 if (flags
.max_after_base
)
1459 if (! flags
.base_after_vec
&& flags
.max_after_vec
)
1461 max_addr
+= align_fuzz (rel_lab
, insn
, rel_align
, ~0);
1462 max_addr
+= align_fuzz (insn
, max_lab
, 0, ~0);
1465 max_addr
+= align_fuzz (rel_lab
, max_lab
, rel_align
, ~0);
1469 if (flags
.base_after_vec
&& ! flags
.max_after_vec
)
1471 max_addr
+= align_fuzz (max_lab
, insn
, 0, 0);
1472 max_addr
+= align_fuzz (insn
, rel_lab
, 0, 0);
1475 max_addr
+= align_fuzz (max_lab
, rel_lab
, 0, 0);
1477 PUT_MODE (body
, CASE_VECTOR_SHORTEN_MODE (min_addr
- rel_addr
,
1478 max_addr
- rel_addr
,
1480 if (JUMP_TABLES_IN_TEXT_SECTION
1481 #if !defined(READONLY_DATA_SECTION)
1487 = (XVECLEN (body
, 1) * GET_MODE_SIZE (GET_MODE (body
)));
1488 insn_current_address
+= insn_lengths
[uid
];
1489 if (insn_lengths
[uid
] != old_length
)
1490 something_changed
= 1;
1495 #endif /* CASE_VECTOR_SHORTEN_MODE */
1497 if (! (varying_length
[uid
]))
1499 insn_current_address
+= insn_lengths
[uid
];
1502 if (GET_CODE (insn
) == INSN
&& GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1506 body
= PATTERN (insn
);
1508 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1510 rtx inner_insn
= XVECEXP (body
, 0, i
);
1511 int inner_uid
= INSN_UID (inner_insn
);
1514 insn_addresses
[inner_uid
] = insn_current_address
;
1516 /* insn_current_length returns 0 for insns with a
1517 non-varying length. */
1518 if (! varying_length
[inner_uid
])
1519 inner_length
= insn_lengths
[inner_uid
];
1521 inner_length
= insn_current_length (inner_insn
);
1523 if (inner_length
!= insn_lengths
[inner_uid
])
1525 insn_lengths
[inner_uid
] = inner_length
;
1526 something_changed
= 1;
1528 insn_current_address
+= insn_lengths
[inner_uid
];
1529 new_length
+= inner_length
;
1534 new_length
= insn_current_length (insn
);
1535 insn_current_address
+= new_length
;
1538 #ifdef ADJUST_INSN_LENGTH
1539 /* If needed, do any adjustment. */
1540 tmp_length
= new_length
;
1541 ADJUST_INSN_LENGTH (insn
, new_length
);
1542 insn_current_address
+= (new_length
- tmp_length
);
1545 if (new_length
!= insn_lengths
[uid
])
1547 insn_lengths
[uid
] = new_length
;
1548 something_changed
= 1;
1551 /* For a non-optimizing compile, do only a single pass. */
1556 free (varying_length
);
1558 #endif /* HAVE_ATTR_length */
1561 #ifdef HAVE_ATTR_length
1562 /* Given the body of an INSN known to be generated by an ASM statement, return
1563 the number of machine instructions likely to be generated for this insn.
1564 This is used to compute its length. */
1567 asm_insn_count (body
)
1573 if (GET_CODE (body
) == ASM_INPUT
)
1574 template = XSTR (body
, 0);
1576 template = decode_asm_operands (body
, NULL_PTR
, NULL_PTR
,
1577 NULL_PTR
, NULL_PTR
);
1579 for ( ; *template; template++)
1580 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
1587 /* Output assembler code for the start of a function,
1588 and initialize some of the variables in this file
1589 for the new function. The label for the function and associated
1590 assembler pseudo-ops have already been output in `assemble_start_function'.
1592 FIRST is the first insn of the rtl for the function being compiled.
1593 FILE is the file to write assembler code to.
1594 OPTIMIZE is nonzero if we should eliminate redundant
1595 test and compare insns. */
1598 final_start_function (first
, file
, optimize
)
1601 int optimize ATTRIBUTE_UNUSED
;
1605 this_is_asm_operands
= 0;
1607 #ifdef NON_SAVING_SETJMP
1608 /* A function that calls setjmp should save and restore all the
1609 call-saved registers on a system where longjmp clobbers them. */
1610 if (NON_SAVING_SETJMP
&& current_function_calls_setjmp
)
1614 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
1615 if (!call_used_regs
[i
])
1616 regs_ever_live
[i
] = 1;
1620 /* Initial line number is supposed to be output
1621 before the function's prologue and label
1622 so that the function's address will not appear to be
1623 in the last statement of the preceding function. */
1624 if (NOTE_LINE_NUMBER (first
) != NOTE_INSN_DELETED
)
1625 last_linenum
= high_block_linenum
= high_function_linenum
1626 = NOTE_LINE_NUMBER (first
);
1628 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1629 /* Output DWARF definition of the function. */
1630 if (dwarf2out_do_frame ())
1631 dwarf2out_begin_prologue ();
1634 /* For SDB and XCOFF, the function beginning must be marked between
1635 the function label and the prologue. We always need this, even when
1636 -g1 was used. Defer on MIPS systems so that parameter descriptions
1637 follow function entry. */
1638 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
1639 if (write_symbols
== SDB_DEBUG
)
1640 sdbout_begin_function (last_linenum
);
1643 #ifdef XCOFF_DEBUGGING_INFO
1644 if (write_symbols
== XCOFF_DEBUG
)
1645 xcoffout_begin_function (file
, last_linenum
);
1648 /* But only output line number for other debug info types if -g2
1650 if (NOTE_LINE_NUMBER (first
) != NOTE_INSN_DELETED
)
1651 output_source_line (file
, first
);
1653 #ifdef LEAF_REG_REMAP
1654 if (current_function_uses_only_leaf_regs
)
1655 leaf_renumber_regs (first
);
1658 /* The Sun386i and perhaps other machines don't work right
1659 if the profiling code comes after the prologue. */
1660 #ifdef PROFILE_BEFORE_PROLOGUE
1662 profile_function (file
);
1663 #endif /* PROFILE_BEFORE_PROLOGUE */
1665 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1666 if (dwarf2out_do_frame ())
1667 dwarf2out_frame_debug (NULL_RTX
);
1670 #ifdef FUNCTION_PROLOGUE
1671 /* First output the function prologue: code to set up the stack frame. */
1672 FUNCTION_PROLOGUE (file
, get_frame_size ());
1675 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1676 if (write_symbols
== SDB_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1677 next_block_index
= 1;
1680 /* If the machine represents the prologue as RTL, the profiling code must
1681 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1682 #ifdef HAVE_prologue
1683 if (! HAVE_prologue
)
1685 profile_after_prologue (file
);
1689 /* If we are doing basic block profiling, remember a printable version
1690 of the function name. */
1691 if (profile_block_flag
)
1694 = add_bb_string ((*decl_printable_name
) (current_function_decl
, 2), FALSE
);
1699 profile_after_prologue (file
)
1702 #ifdef FUNCTION_BLOCK_PROFILER
1703 if (profile_block_flag
)
1705 FUNCTION_BLOCK_PROFILER (file
, count_basic_blocks
);
1707 #endif /* FUNCTION_BLOCK_PROFILER */
1709 #ifndef PROFILE_BEFORE_PROLOGUE
1711 profile_function (file
);
1712 #endif /* not PROFILE_BEFORE_PROLOGUE */
1716 profile_function (file
)
1719 int align
= MIN (BIGGEST_ALIGNMENT
, LONG_TYPE_SIZE
);
1720 #if defined(ASM_OUTPUT_REG_PUSH)
1721 #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1722 int sval
= current_function_returns_struct
;
1724 #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1725 int cxt
= current_function_needs_context
;
1727 #endif /* ASM_OUTPUT_REG_PUSH */
1730 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
1731 ASM_OUTPUT_INTERNAL_LABEL (file
, "LP", profile_label_no
);
1732 assemble_integer (const0_rtx
, LONG_TYPE_SIZE
/ BITS_PER_UNIT
, 1);
1734 function_section (current_function_decl
);
1736 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1738 ASM_OUTPUT_REG_PUSH (file
, STRUCT_VALUE_INCOMING_REGNUM
);
1740 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1743 ASM_OUTPUT_REG_PUSH (file
, STRUCT_VALUE_REGNUM
);
1748 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1750 ASM_OUTPUT_REG_PUSH (file
, STATIC_CHAIN_INCOMING_REGNUM
);
1752 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1755 ASM_OUTPUT_REG_PUSH (file
, STATIC_CHAIN_REGNUM
);
1760 FUNCTION_PROFILER (file
, profile_label_no
);
1762 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1764 ASM_OUTPUT_REG_POP (file
, STATIC_CHAIN_INCOMING_REGNUM
);
1766 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1769 ASM_OUTPUT_REG_POP (file
, STATIC_CHAIN_REGNUM
);
1774 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1776 ASM_OUTPUT_REG_POP (file
, STRUCT_VALUE_INCOMING_REGNUM
);
1778 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1781 ASM_OUTPUT_REG_POP (file
, STRUCT_VALUE_REGNUM
);
1787 /* Output assembler code for the end of a function.
1788 For clarity, args are same as those of `final_start_function'
1789 even though not all of them are needed. */
1792 final_end_function (first
, file
, optimize
)
1793 rtx first ATTRIBUTE_UNUSED
;
1795 int optimize ATTRIBUTE_UNUSED
;
1799 fputs (ASM_APP_OFF
, file
);
1803 #ifdef SDB_DEBUGGING_INFO
1804 if (write_symbols
== SDB_DEBUG
)
1805 sdbout_end_function (high_function_linenum
);
1808 #ifdef DWARF_DEBUGGING_INFO
1809 if (write_symbols
== DWARF_DEBUG
)
1810 dwarfout_end_function ();
1813 #ifdef XCOFF_DEBUGGING_INFO
1814 if (write_symbols
== XCOFF_DEBUG
)
1815 xcoffout_end_function (file
, high_function_linenum
);
1818 #ifdef FUNCTION_EPILOGUE
1819 /* Finally, output the function epilogue:
1820 code to restore the stack frame and return to the caller. */
1821 FUNCTION_EPILOGUE (file
, get_frame_size ());
1824 #ifdef SDB_DEBUGGING_INFO
1825 if (write_symbols
== SDB_DEBUG
)
1826 sdbout_end_epilogue ();
1829 #ifdef DWARF_DEBUGGING_INFO
1830 if (write_symbols
== DWARF_DEBUG
)
1831 dwarfout_end_epilogue ();
1834 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1835 if (dwarf2out_do_frame ())
1836 dwarf2out_end_epilogue ();
1839 #ifdef XCOFF_DEBUGGING_INFO
1840 if (write_symbols
== XCOFF_DEBUG
)
1841 xcoffout_end_epilogue (file
);
1844 bb_func_label_num
= -1; /* not in function, nuke label # */
1846 /* If FUNCTION_EPILOGUE is not defined, then the function body
1847 itself contains return instructions wherever needed. */
1850 /* Add a block to the linked list that remembers the current line/file/function
1851 for basic block profiling. Emit the label in front of the basic block and
1852 the instructions that increment the count field. */
1858 struct bb_list
*ptr
= (struct bb_list
*) permalloc (sizeof (struct bb_list
));
1860 /* Add basic block to linked list. */
1862 ptr
->line_num
= last_linenum
;
1863 ptr
->file_label_num
= bb_file_label_num
;
1864 ptr
->func_label_num
= bb_func_label_num
;
1866 bb_tail
= &ptr
->next
;
1868 /* Enable the table of basic-block use counts
1869 to point at the code it applies to. */
1870 ASM_OUTPUT_INTERNAL_LABEL (file
, "LPB", count_basic_blocks
);
1872 /* Before first insn of this basic block, increment the
1873 count of times it was entered. */
1874 #ifdef BLOCK_PROFILER
1875 BLOCK_PROFILER (file
, count_basic_blocks
);
1882 count_basic_blocks
++;
1885 /* Add a string to be used for basic block profiling. */
1888 add_bb_string (string
, perm_p
)
1893 struct bb_str
*ptr
= 0;
1897 string
= "<unknown>";
1901 /* Allocate a new string if the current string isn't permanent. If
1902 the string is permanent search for the same string in other
1905 len
= strlen (string
) + 1;
1908 char *p
= (char *) permalloc (len
);
1909 bcopy (string
, p
, len
);
1913 for (ptr
= sbb_head
; ptr
!= (struct bb_str
*) 0; ptr
= ptr
->next
)
1914 if (ptr
->string
== string
)
1917 /* Allocate a new string block if we need to. */
1920 ptr
= (struct bb_str
*) permalloc (sizeof (*ptr
));
1923 ptr
->label_num
= sbb_label_num
++;
1924 ptr
->string
= string
;
1926 sbb_tail
= &ptr
->next
;
1929 return ptr
->label_num
;
1933 /* Output assembler code for some insns: all or part of a function.
1934 For description of args, see `final_start_function', above.
1936 PRESCAN is 1 if we are not really outputting,
1937 just scanning as if we were outputting.
1938 Prescanning deletes and rearranges insns just like ordinary output.
1939 PRESCAN is -2 if we are outputting after having prescanned.
1940 In this case, don't try to delete or rearrange insns
1941 because that has already been done.
1942 Prescanning is done only on certain machines. */
1945 final (first
, file
, optimize
, prescan
)
1955 last_ignored_compare
= 0;
1958 check_exception_handler_labels ();
1960 /* Make a map indicating which line numbers appear in this function.
1961 When producing SDB debugging info, delete troublesome line number
1962 notes from inlined functions in other files as well as duplicate
1963 line number notes. */
1964 #ifdef SDB_DEBUGGING_INFO
1965 if (write_symbols
== SDB_DEBUG
)
1968 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1969 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
1971 if ((RTX_INTEGRATED_P (insn
)
1972 && strcmp (NOTE_SOURCE_FILE (insn
), main_input_filename
) != 0)
1974 && NOTE_LINE_NUMBER (insn
) == NOTE_LINE_NUMBER (last
)
1975 && NOTE_SOURCE_FILE (insn
) == NOTE_SOURCE_FILE (last
)))
1977 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
1978 NOTE_SOURCE_FILE (insn
) = 0;
1982 if (NOTE_LINE_NUMBER (insn
) > max_line
)
1983 max_line
= NOTE_LINE_NUMBER (insn
);
1989 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1990 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > max_line
)
1991 max_line
= NOTE_LINE_NUMBER (insn
);
1994 line_note_exists
= (char *) oballoc (max_line
+ 1);
1995 bzero (line_note_exists
, max_line
+ 1);
1997 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1999 if (INSN_UID (insn
) > max_uid
) /* find largest UID */
2000 max_uid
= INSN_UID (insn
);
2001 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
2002 line_note_exists
[NOTE_LINE_NUMBER (insn
)] = 1;
2004 /* If CC tracking across branches is enabled, record the insn which
2005 jumps to each branch only reached from one place. */
2006 if (optimize
&& GET_CODE (insn
) == JUMP_INSN
)
2008 rtx lab
= JUMP_LABEL (insn
);
2009 if (lab
&& LABEL_NUSES (lab
) == 1)
2011 LABEL_REFS (lab
) = insn
;
2017 /* Initialize insn_eh_region table if eh is being used. */
2019 init_insn_eh_region (first
, max_uid
);
2025 /* Output the insns. */
2026 for (insn
= NEXT_INSN (first
); insn
;)
2028 #ifdef HAVE_ATTR_length
2029 insn_current_address
= insn_addresses
[INSN_UID (insn
)];
2031 insn
= final_scan_insn (insn
, file
, optimize
, prescan
, 0);
2034 /* Do basic-block profiling here
2035 if the last insn was a conditional branch. */
2036 if (profile_block_flag
&& new_block
)
2039 free_insn_eh_region ();
2042 /* The final scan for one insn, INSN.
2043 Args are same as in `final', except that INSN
2044 is the insn being scanned.
2045 Value returned is the next insn to be scanned.
2047 NOPEEPHOLES is the flag to disallow peephole processing (currently
2048 used for within delayed branch sequence output). */
2051 final_scan_insn (insn
, file
, optimize
, prescan
, nopeepholes
)
2064 /* Ignore deleted insns. These can occur when we split insns (due to a
2065 template of "#") while not optimizing. */
2066 if (INSN_DELETED_P (insn
))
2067 return NEXT_INSN (insn
);
2069 switch (GET_CODE (insn
))
2075 /* Align the beginning of a loop, for higher speed
2076 on certain machines. */
2078 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_LOOP_BEG
)
2079 break; /* This used to depend on optimize, but that was bogus. */
2080 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_LOOP_END
)
2083 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EH_REGION_BEG
2084 && ! exceptions_via_longjmp
)
2086 ASM_OUTPUT_INTERNAL_LABEL (file
, "LEHB", NOTE_BLOCK_NUMBER (insn
));
2087 if (! flag_new_exceptions
)
2088 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn
));
2089 #ifdef ASM_OUTPUT_EH_REGION_BEG
2090 ASM_OUTPUT_EH_REGION_BEG (file
, NOTE_BLOCK_NUMBER (insn
));
2095 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EH_REGION_END
2096 && ! exceptions_via_longjmp
)
2098 ASM_OUTPUT_INTERNAL_LABEL (file
, "LEHE", NOTE_BLOCK_NUMBER (insn
));
2099 if (flag_new_exceptions
)
2100 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn
));
2101 #ifdef ASM_OUTPUT_EH_REGION_END
2102 ASM_OUTPUT_EH_REGION_END (file
, NOTE_BLOCK_NUMBER (insn
));
2107 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_PROLOGUE_END
)
2109 #ifdef FUNCTION_END_PROLOGUE
2110 FUNCTION_END_PROLOGUE (file
);
2112 profile_after_prologue (file
);
2116 #ifdef FUNCTION_BEGIN_EPILOGUE
2117 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EPILOGUE_BEG
)
2119 FUNCTION_BEGIN_EPILOGUE (file
);
2124 if (write_symbols
== NO_DEBUG
)
2126 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_FUNCTION_BEG
)
2128 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
2129 /* MIPS stabs require the parameter descriptions to be after the
2130 function entry point rather than before. */
2131 if (write_symbols
== SDB_DEBUG
)
2132 sdbout_begin_function (last_linenum
);
2135 #ifdef DWARF_DEBUGGING_INFO
2136 /* This outputs a marker where the function body starts, so it
2137 must be after the prologue. */
2138 if (write_symbols
== DWARF_DEBUG
)
2139 dwarfout_begin_function ();
2143 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_DELETED
)
2144 break; /* An insn that was "deleted" */
2147 fputs (ASM_APP_OFF
, file
);
2150 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_BEG
2151 && (debug_info_level
== DINFO_LEVEL_NORMAL
2152 || debug_info_level
== DINFO_LEVEL_VERBOSE
2153 || write_symbols
== DWARF_DEBUG
2154 || write_symbols
== DWARF2_DEBUG
))
2156 /* Beginning of a symbol-block. Assign it a sequence number
2157 and push the number onto the stack PENDING_BLOCKS. */
2159 if (block_depth
== max_block_depth
)
2161 /* PENDING_BLOCKS is full; make it longer. */
2162 max_block_depth
*= 2;
2164 = (int *) xrealloc (pending_blocks
,
2165 max_block_depth
* sizeof (int));
2167 pending_blocks
[block_depth
++] = next_block_index
;
2169 high_block_linenum
= last_linenum
;
2171 /* Output debugging info about the symbol-block beginning. */
2173 #ifdef SDB_DEBUGGING_INFO
2174 if (write_symbols
== SDB_DEBUG
)
2175 sdbout_begin_block (file
, last_linenum
, next_block_index
);
2177 #ifdef XCOFF_DEBUGGING_INFO
2178 if (write_symbols
== XCOFF_DEBUG
)
2179 xcoffout_begin_block (file
, last_linenum
, next_block_index
);
2181 #ifdef DBX_DEBUGGING_INFO
2182 if (write_symbols
== DBX_DEBUG
)
2183 ASM_OUTPUT_INTERNAL_LABEL (file
, "LBB", next_block_index
);
2185 #ifdef DWARF_DEBUGGING_INFO
2186 if (write_symbols
== DWARF_DEBUG
)
2187 dwarfout_begin_block (next_block_index
);
2189 #ifdef DWARF2_DEBUGGING_INFO
2190 if (write_symbols
== DWARF2_DEBUG
)
2191 dwarf2out_begin_block (next_block_index
);
2196 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_END
2197 && (debug_info_level
== DINFO_LEVEL_NORMAL
2198 || debug_info_level
== DINFO_LEVEL_VERBOSE
2199 || write_symbols
== DWARF_DEBUG
2200 || write_symbols
== DWARF2_DEBUG
))
2202 /* End of a symbol-block. Pop its sequence number off
2203 PENDING_BLOCKS and output debugging info based on that. */
2206 if (block_depth
< 0)
2209 #ifdef XCOFF_DEBUGGING_INFO
2210 if (write_symbols
== XCOFF_DEBUG
)
2211 xcoffout_end_block (file
, high_block_linenum
,
2212 pending_blocks
[block_depth
]);
2214 #ifdef DBX_DEBUGGING_INFO
2215 if (write_symbols
== DBX_DEBUG
)
2216 ASM_OUTPUT_INTERNAL_LABEL (file
, "LBE",
2217 pending_blocks
[block_depth
]);
2219 #ifdef SDB_DEBUGGING_INFO
2220 if (write_symbols
== SDB_DEBUG
)
2221 sdbout_end_block (file
, high_block_linenum
,
2222 pending_blocks
[block_depth
]);
2224 #ifdef DWARF_DEBUGGING_INFO
2225 if (write_symbols
== DWARF_DEBUG
)
2226 dwarfout_end_block (pending_blocks
[block_depth
]);
2228 #ifdef DWARF2_DEBUGGING_INFO
2229 if (write_symbols
== DWARF2_DEBUG
)
2230 dwarf2out_end_block (pending_blocks
[block_depth
]);
2233 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_DELETED_LABEL
2234 && (debug_info_level
== DINFO_LEVEL_NORMAL
2235 || debug_info_level
== DINFO_LEVEL_VERBOSE
))
2237 #ifdef DWARF_DEBUGGING_INFO
2238 if (write_symbols
== DWARF_DEBUG
)
2239 dwarfout_label (insn
);
2241 #ifdef DWARF2_DEBUGGING_INFO
2242 if (write_symbols
== DWARF2_DEBUG
)
2243 dwarf2out_label (insn
);
2246 else if (NOTE_LINE_NUMBER (insn
) > 0)
2247 /* This note is a line-number. */
2251 #if 0 /* This is what we used to do. */
2252 output_source_line (file
, insn
);
2256 /* If there is anything real after this note,
2257 output it. If another line note follows, omit this one. */
2258 for (note
= NEXT_INSN (insn
); note
; note
= NEXT_INSN (note
))
2260 if (GET_CODE (note
) != NOTE
&& GET_CODE (note
) != CODE_LABEL
)
2262 /* These types of notes can be significant
2263 so make sure the preceding line number stays. */
2264 else if (GET_CODE (note
) == NOTE
2265 && (NOTE_LINE_NUMBER (note
) == NOTE_INSN_BLOCK_BEG
2266 || NOTE_LINE_NUMBER (note
) == NOTE_INSN_BLOCK_END
2267 || NOTE_LINE_NUMBER (note
) == NOTE_INSN_FUNCTION_BEG
))
2269 else if (GET_CODE (note
) == NOTE
&& NOTE_LINE_NUMBER (note
) > 0)
2271 /* Another line note follows; we can delete this note
2272 if no intervening line numbers have notes elsewhere. */
2274 for (num
= NOTE_LINE_NUMBER (insn
) + 1;
2275 num
< NOTE_LINE_NUMBER (note
);
2277 if (line_note_exists
[num
])
2280 if (num
>= NOTE_LINE_NUMBER (note
))
2286 /* Output this line note
2287 if it is the first or the last line note in a row. */
2289 output_source_line (file
, insn
);
2294 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2295 /* If we push arguments, we need to check all insns for stack
2297 if (dwarf2out_do_frame ())
2298 dwarf2out_frame_debug (insn
);
2303 /* The target port might emit labels in the output function for
2304 some insn, e.g. sh.c output_branchy_insn. */
2305 if (CODE_LABEL_NUMBER (insn
) <= max_labelno
)
2307 int align
= LABEL_TO_ALIGNMENT (insn
);
2308 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2309 int max_skip
= LABEL_TO_MAX_SKIP (insn
);
2312 if (align
&& NEXT_INSN (insn
))
2313 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2314 ASM_OUTPUT_MAX_SKIP_ALIGN (file
, align
, max_skip
);
2316 ASM_OUTPUT_ALIGN (file
, align
);
2321 /* If this label is reached from only one place, set the condition
2322 codes from the instruction just before the branch. */
2324 /* Disabled because some insns set cc_status in the C output code
2325 and NOTICE_UPDATE_CC alone can set incorrect status. */
2326 if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
2328 rtx jump
= LABEL_REFS (insn
);
2329 rtx barrier
= prev_nonnote_insn (insn
);
2331 /* If the LABEL_REFS field of this label has been set to point
2332 at a branch, the predecessor of the branch is a regular
2333 insn, and that branch is the only way to reach this label,
2334 set the condition codes based on the branch and its
2336 if (barrier
&& GET_CODE (barrier
) == BARRIER
2337 && jump
&& GET_CODE (jump
) == JUMP_INSN
2338 && (prev
= prev_nonnote_insn (jump
))
2339 && GET_CODE (prev
) == INSN
)
2341 NOTICE_UPDATE_CC (PATTERN (prev
), prev
);
2342 NOTICE_UPDATE_CC (PATTERN (jump
), jump
);
2350 #ifdef FINAL_PRESCAN_LABEL
2351 FINAL_PRESCAN_INSN (insn
, NULL_PTR
, 0);
2354 #ifdef SDB_DEBUGGING_INFO
2355 if (write_symbols
== SDB_DEBUG
&& LABEL_NAME (insn
))
2356 sdbout_label (insn
);
2358 #ifdef DWARF_DEBUGGING_INFO
2359 if (write_symbols
== DWARF_DEBUG
&& LABEL_NAME (insn
))
2360 dwarfout_label (insn
);
2362 #ifdef DWARF2_DEBUGGING_INFO
2363 if (write_symbols
== DWARF2_DEBUG
&& LABEL_NAME (insn
))
2364 dwarf2out_label (insn
);
2368 fputs (ASM_APP_OFF
, file
);
2371 if (NEXT_INSN (insn
) != 0
2372 && GET_CODE (NEXT_INSN (insn
)) == JUMP_INSN
)
2374 rtx nextbody
= PATTERN (NEXT_INSN (insn
));
2376 /* If this label is followed by a jump-table,
2377 make sure we put the label in the read-only section. Also
2378 possibly write the label and jump table together. */
2380 if (GET_CODE (nextbody
) == ADDR_VEC
2381 || GET_CODE (nextbody
) == ADDR_DIFF_VEC
)
2383 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2384 /* In this case, the case vector is being moved by the
2385 target, so don't output the label at all. Leave that
2386 to the back end macros. */
2388 if (! JUMP_TABLES_IN_TEXT_SECTION
)
2390 readonly_data_section ();
2391 #ifdef READONLY_DATA_SECTION
2392 ASM_OUTPUT_ALIGN (file
,
2393 exact_log2 (BIGGEST_ALIGNMENT
2395 #endif /* READONLY_DATA_SECTION */
2398 function_section (current_function_decl
);
2400 #ifdef ASM_OUTPUT_CASE_LABEL
2401 ASM_OUTPUT_CASE_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
),
2404 ASM_OUTPUT_INTERNAL_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
2411 ASM_OUTPUT_INTERNAL_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
2416 register rtx body
= PATTERN (insn
);
2417 int insn_code_number
;
2418 const char *template;
2423 /* An INSN, JUMP_INSN or CALL_INSN.
2424 First check for special kinds that recog doesn't recognize. */
2426 if (GET_CODE (body
) == USE
/* These are just declarations */
2427 || GET_CODE (body
) == CLOBBER
)
2431 /* If there is a REG_CC_SETTER note on this insn, it means that
2432 the setting of the condition code was done in the delay slot
2433 of the insn that branched here. So recover the cc status
2434 from the insn that set it. */
2436 note
= find_reg_note (insn
, REG_CC_SETTER
, NULL_RTX
);
2439 NOTICE_UPDATE_CC (PATTERN (XEXP (note
, 0)), XEXP (note
, 0));
2440 cc_prev_status
= cc_status
;
2444 /* Detect insns that are really jump-tables
2445 and output them as such. */
2447 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
2449 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2450 register int vlen
, idx
;
2458 fputs (ASM_APP_OFF
, file
);
2462 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2463 if (GET_CODE (body
) == ADDR_VEC
)
2465 #ifdef ASM_OUTPUT_ADDR_VEC
2466 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn
), body
);
2473 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2474 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn
), body
);
2480 vlen
= XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
);
2481 for (idx
= 0; idx
< vlen
; idx
++)
2483 if (GET_CODE (body
) == ADDR_VEC
)
2485 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2486 ASM_OUTPUT_ADDR_VEC_ELT
2487 (file
, CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 0, idx
), 0)));
2494 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2495 ASM_OUTPUT_ADDR_DIFF_ELT
2498 CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 1, idx
), 0)),
2499 CODE_LABEL_NUMBER (XEXP (XEXP (body
, 0), 0)));
2505 #ifdef ASM_OUTPUT_CASE_END
2506 ASM_OUTPUT_CASE_END (file
,
2507 CODE_LABEL_NUMBER (PREV_INSN (insn
)),
2512 function_section (current_function_decl
);
2517 /* Do basic-block profiling when we reach a new block.
2518 Done here to avoid jump tables. */
2519 if (profile_block_flag
&& new_block
)
2522 if (GET_CODE (body
) == ASM_INPUT
)
2524 /* There's no telling what that did to the condition codes. */
2530 fputs (ASM_APP_ON
, file
);
2533 fprintf (asm_out_file
, "\t%s\n", XSTR (body
, 0));
2537 /* Detect `asm' construct with operands. */
2538 if (asm_noperands (body
) >= 0)
2540 unsigned int noperands
= asm_noperands (body
);
2541 rtx
*ops
= (rtx
*) alloca (noperands
* sizeof (rtx
));
2544 /* There's no telling what that did to the condition codes. */
2551 fputs (ASM_APP_ON
, file
);
2555 /* Get out the operand values. */
2556 string
= decode_asm_operands (body
, ops
, NULL_PTR
,
2557 NULL_PTR
, NULL_PTR
);
2558 /* Inhibit aborts on what would otherwise be compiler bugs. */
2559 insn_noperands
= noperands
;
2560 this_is_asm_operands
= insn
;
2562 /* Output the insn using them. */
2563 output_asm_insn (string
, ops
);
2564 this_is_asm_operands
= 0;
2568 if (prescan
<= 0 && app_on
)
2570 fputs (ASM_APP_OFF
, file
);
2574 if (GET_CODE (body
) == SEQUENCE
)
2576 /* A delayed-branch sequence */
2582 final_sequence
= body
;
2584 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2585 force the restoration of a comparison that was previously
2586 thought unnecessary. If that happens, cancel this sequence
2587 and cause that insn to be restored. */
2589 next
= final_scan_insn (XVECEXP (body
, 0, 0), file
, 0, prescan
, 1);
2590 if (next
!= XVECEXP (body
, 0, 1))
2596 for (i
= 1; i
< XVECLEN (body
, 0); i
++)
2598 rtx insn
= XVECEXP (body
, 0, i
);
2599 rtx next
= NEXT_INSN (insn
);
2600 /* We loop in case any instruction in a delay slot gets
2603 insn
= final_scan_insn (insn
, file
, 0, prescan
, 1);
2604 while (insn
!= next
);
2606 #ifdef DBR_OUTPUT_SEQEND
2607 DBR_OUTPUT_SEQEND (file
);
2611 /* If the insn requiring the delay slot was a CALL_INSN, the
2612 insns in the delay slot are actually executed before the
2613 called function. Hence we don't preserve any CC-setting
2614 actions in these insns and the CC must be marked as being
2615 clobbered by the function. */
2616 if (GET_CODE (XVECEXP (body
, 0, 0)) == CALL_INSN
)
2621 /* Following a conditional branch sequence, we have a new basic
2623 if (profile_block_flag
)
2625 rtx insn
= XVECEXP (body
, 0, 0);
2626 rtx body
= PATTERN (insn
);
2628 if ((GET_CODE (insn
) == JUMP_INSN
&& GET_CODE (body
) == SET
2629 && GET_CODE (SET_SRC (body
)) != LABEL_REF
)
2630 || (GET_CODE (insn
) == JUMP_INSN
2631 && GET_CODE (body
) == PARALLEL
2632 && GET_CODE (XVECEXP (body
, 0, 0)) == SET
2633 && GET_CODE (SET_SRC (XVECEXP (body
, 0, 0))) != LABEL_REF
))
2639 /* We have a real machine instruction as rtl. */
2641 body
= PATTERN (insn
);
2644 set
= single_set(insn
);
2646 /* Check for redundant test and compare instructions
2647 (when the condition codes are already set up as desired).
2648 This is done only when optimizing; if not optimizing,
2649 it should be possible for the user to alter a variable
2650 with the debugger in between statements
2651 and the next statement should reexamine the variable
2652 to compute the condition codes. */
2657 rtx set
= single_set(insn
);
2661 && GET_CODE (SET_DEST (set
)) == CC0
2662 && insn
!= last_ignored_compare
)
2664 if (GET_CODE (SET_SRC (set
)) == SUBREG
)
2665 SET_SRC (set
) = alter_subreg (SET_SRC (set
));
2666 else if (GET_CODE (SET_SRC (set
)) == COMPARE
)
2668 if (GET_CODE (XEXP (SET_SRC (set
), 0)) == SUBREG
)
2669 XEXP (SET_SRC (set
), 0)
2670 = alter_subreg (XEXP (SET_SRC (set
), 0));
2671 if (GET_CODE (XEXP (SET_SRC (set
), 1)) == SUBREG
)
2672 XEXP (SET_SRC (set
), 1)
2673 = alter_subreg (XEXP (SET_SRC (set
), 1));
2675 if ((cc_status
.value1
!= 0
2676 && rtx_equal_p (SET_SRC (set
), cc_status
.value1
))
2677 || (cc_status
.value2
!= 0
2678 && rtx_equal_p (SET_SRC (set
), cc_status
.value2
)))
2680 /* Don't delete insn if it has an addressing side-effect. */
2681 if (! FIND_REG_INC_NOTE (insn
, 0)
2682 /* or if anything in it is volatile. */
2683 && ! volatile_refs_p (PATTERN (insn
)))
2685 /* We don't really delete the insn; just ignore it. */
2686 last_ignored_compare
= insn
;
2694 /* Following a conditional branch, we have a new basic block.
2695 But if we are inside a sequence, the new block starts after the
2696 last insn of the sequence. */
2697 if (profile_block_flag
&& final_sequence
== 0
2698 && ((GET_CODE (insn
) == JUMP_INSN
&& GET_CODE (body
) == SET
2699 && GET_CODE (SET_SRC (body
)) != LABEL_REF
)
2700 || (GET_CODE (insn
) == JUMP_INSN
&& GET_CODE (body
) == PARALLEL
2701 && GET_CODE (XVECEXP (body
, 0, 0)) == SET
2702 && GET_CODE (SET_SRC (XVECEXP (body
, 0, 0))) != LABEL_REF
)))
2706 /* Don't bother outputting obvious no-ops, even without -O.
2707 This optimization is fast and doesn't interfere with debugging.
2708 Don't do this if the insn is in a delay slot, since this
2709 will cause an improper number of delay insns to be written. */
2710 if (final_sequence
== 0
2712 && GET_CODE (insn
) == INSN
&& GET_CODE (body
) == SET
2713 && GET_CODE (SET_SRC (body
)) == REG
2714 && GET_CODE (SET_DEST (body
)) == REG
2715 && REGNO (SET_SRC (body
)) == REGNO (SET_DEST (body
)))
2720 /* If this is a conditional branch, maybe modify it
2721 if the cc's are in a nonstandard state
2722 so that it accomplishes the same thing that it would
2723 do straightforwardly if the cc's were set up normally. */
2725 if (cc_status
.flags
!= 0
2726 && GET_CODE (insn
) == JUMP_INSN
2727 && GET_CODE (body
) == SET
2728 && SET_DEST (body
) == pc_rtx
2729 && GET_CODE (SET_SRC (body
)) == IF_THEN_ELSE
2730 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body
), 0))) == '<'
2731 && XEXP (XEXP (SET_SRC (body
), 0), 0) == cc0_rtx
2732 /* This is done during prescan; it is not done again
2733 in final scan when prescan has been done. */
2736 /* This function may alter the contents of its argument
2737 and clear some of the cc_status.flags bits.
2738 It may also return 1 meaning condition now always true
2739 or -1 meaning condition now always false
2740 or 2 meaning condition nontrivial but altered. */
2741 register int result
= alter_cond (XEXP (SET_SRC (body
), 0));
2742 /* If condition now has fixed value, replace the IF_THEN_ELSE
2743 with its then-operand or its else-operand. */
2745 SET_SRC (body
) = XEXP (SET_SRC (body
), 1);
2747 SET_SRC (body
) = XEXP (SET_SRC (body
), 2);
2749 /* The jump is now either unconditional or a no-op.
2750 If it has become a no-op, don't try to output it.
2751 (It would not be recognized.) */
2752 if (SET_SRC (body
) == pc_rtx
)
2754 PUT_CODE (insn
, NOTE
);
2755 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
2756 NOTE_SOURCE_FILE (insn
) = 0;
2759 else if (GET_CODE (SET_SRC (body
)) == RETURN
)
2760 /* Replace (set (pc) (return)) with (return). */
2761 PATTERN (insn
) = body
= SET_SRC (body
);
2763 /* Rerecognize the instruction if it has changed. */
2765 INSN_CODE (insn
) = -1;
2768 /* Make same adjustments to instructions that examine the
2769 condition codes without jumping and instructions that
2770 handle conditional moves (if this machine has either one). */
2772 if (cc_status
.flags
!= 0
2775 rtx cond_rtx
, then_rtx
, else_rtx
;
2777 if (GET_CODE (insn
) != JUMP_INSN
2778 && GET_CODE (SET_SRC (set
)) == IF_THEN_ELSE
)
2780 cond_rtx
= XEXP (SET_SRC (set
), 0);
2781 then_rtx
= XEXP (SET_SRC (set
), 1);
2782 else_rtx
= XEXP (SET_SRC (set
), 2);
2786 cond_rtx
= SET_SRC (set
);
2787 then_rtx
= const_true_rtx
;
2788 else_rtx
= const0_rtx
;
2791 switch (GET_CODE (cond_rtx
))
2804 register int result
;
2805 if (XEXP (cond_rtx
, 0) != cc0_rtx
)
2807 result
= alter_cond (cond_rtx
);
2809 validate_change (insn
, &SET_SRC (set
), then_rtx
, 0);
2810 else if (result
== -1)
2811 validate_change (insn
, &SET_SRC (set
), else_rtx
, 0);
2812 else if (result
== 2)
2813 INSN_CODE (insn
) = -1;
2814 if (SET_DEST (set
) == SET_SRC (set
))
2816 PUT_CODE (insn
, NOTE
);
2817 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
2818 NOTE_SOURCE_FILE (insn
) = 0;
2830 #ifdef HAVE_peephole
2831 /* Do machine-specific peephole optimizations if desired. */
2833 if (optimize
&& !flag_no_peephole
&& !nopeepholes
)
2835 rtx next
= peephole (insn
);
2836 /* When peepholing, if there were notes within the peephole,
2837 emit them before the peephole. */
2838 if (next
!= 0 && next
!= NEXT_INSN (insn
))
2840 rtx prev
= PREV_INSN (insn
);
2843 for (note
= NEXT_INSN (insn
); note
!= next
;
2844 note
= NEXT_INSN (note
))
2845 final_scan_insn (note
, file
, optimize
, prescan
, nopeepholes
);
2847 /* In case this is prescan, put the notes
2848 in proper position for later rescan. */
2849 note
= NEXT_INSN (insn
);
2850 PREV_INSN (note
) = prev
;
2851 NEXT_INSN (prev
) = note
;
2852 NEXT_INSN (PREV_INSN (next
)) = insn
;
2853 PREV_INSN (insn
) = PREV_INSN (next
);
2854 NEXT_INSN (insn
) = next
;
2855 PREV_INSN (next
) = insn
;
2858 /* PEEPHOLE might have changed this. */
2859 body
= PATTERN (insn
);
2863 /* Try to recognize the instruction.
2864 If successful, verify that the operands satisfy the
2865 constraints for the instruction. Crash if they don't,
2866 since `reload' should have changed them so that they do. */
2868 insn_code_number
= recog_memoized (insn
);
2869 extract_insn (insn
);
2870 cleanup_subreg_operands (insn
);
2872 #ifdef REGISTER_CONSTRAINTS
2873 if (! constrain_operands (1))
2874 fatal_insn_not_found (insn
);
2877 /* Some target machines need to prescan each insn before
2880 #ifdef FINAL_PRESCAN_INSN
2881 FINAL_PRESCAN_INSN (insn
, recog_operand
, recog_n_operands
);
2885 cc_prev_status
= cc_status
;
2887 /* Update `cc_status' for this instruction.
2888 The instruction's output routine may change it further.
2889 If the output routine for a jump insn needs to depend
2890 on the cc status, it should look at cc_prev_status. */
2892 NOTICE_UPDATE_CC (body
, insn
);
2897 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2898 /* If we push arguments, we want to know where the calls are. */
2899 if (GET_CODE (insn
) == CALL_INSN
&& dwarf2out_do_frame ())
2900 dwarf2out_frame_debug (insn
);
2903 /* If the proper template needs to be chosen by some C code,
2904 run that code and get the real template. */
2906 template = insn_template
[insn_code_number
];
2909 template = (*insn_outfun
[insn_code_number
]) (recog_operand
, insn
);
2911 /* If the C code returns 0, it means that it is a jump insn
2912 which follows a deleted test insn, and that test insn
2913 needs to be reinserted. */
2916 if (prev_nonnote_insn (insn
) != last_ignored_compare
)
2919 return prev_nonnote_insn (insn
);
2923 /* If the template is the string "#", it means that this insn must
2925 if (template[0] == '#' && template[1] == '\0')
2927 rtx
new = try_split (body
, insn
, 0);
2929 /* If we didn't split the insn, go away. */
2930 if (new == insn
&& PATTERN (new) == body
)
2931 fatal_insn ("Could not split insn", insn
);
2933 #ifdef HAVE_ATTR_length
2934 /* This instruction should have been split in shorten_branches,
2935 to ensure that we would have valid length info for the
2947 /* Output assembler code from the template. */
2949 output_asm_insn (template, recog_operand
);
2951 #if defined (DWARF2_UNWIND_INFO)
2952 #if !defined (ACCUMULATE_OUTGOING_ARGS)
2953 /* If we push arguments, we need to check all insns for stack
2955 if (GET_CODE (insn
) == INSN
&& dwarf2out_do_frame ())
2956 dwarf2out_frame_debug (insn
);
2958 #if defined (HAVE_prologue)
2959 /* If this insn is part of the prologue, emit DWARF v2
2961 if (RTX_FRAME_RELATED_P (insn
) && dwarf2out_do_frame ())
2962 dwarf2out_frame_debug (insn
);
2968 /* It's not at all clear why we did this and doing so interferes
2969 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2972 /* Mark this insn as having been output. */
2973 INSN_DELETED_P (insn
) = 1;
2979 return NEXT_INSN (insn
);
2982 /* Output debugging info to the assembler file FILE
2983 based on the NOTE-insn INSN, assumed to be a line number. */
2986 output_source_line (file
, insn
)
2987 FILE *file ATTRIBUTE_UNUSED
;
2990 register char *filename
= NOTE_SOURCE_FILE (insn
);
2992 /* Remember filename for basic block profiling.
2993 Filenames are allocated on the permanent obstack
2994 or are passed in ARGV, so we don't have to save
2997 if (profile_block_flag
&& last_filename
!= filename
)
2998 bb_file_label_num
= add_bb_string (filename
, TRUE
);
3000 last_filename
= filename
;
3001 last_linenum
= NOTE_LINE_NUMBER (insn
);
3002 high_block_linenum
= MAX (last_linenum
, high_block_linenum
);
3003 high_function_linenum
= MAX (last_linenum
, high_function_linenum
);
3005 if (write_symbols
!= NO_DEBUG
)
3007 #ifdef SDB_DEBUGGING_INFO
3008 if (write_symbols
== SDB_DEBUG
3009 #if 0 /* People like having line numbers even in wrong file! */
3010 /* COFF can't handle multiple source files--lose, lose. */
3011 && !strcmp (filename
, main_input_filename
)
3013 /* COFF relative line numbers must be positive. */
3014 && last_linenum
> sdb_begin_function_line
)
3016 #ifdef ASM_OUTPUT_SOURCE_LINE
3017 ASM_OUTPUT_SOURCE_LINE (file
, last_linenum
);
3019 fprintf (file
, "\t.ln\t%d\n",
3020 ((sdb_begin_function_line
> -1)
3021 ? last_linenum
- sdb_begin_function_line
: 1));
3026 #if defined (DBX_DEBUGGING_INFO)
3027 if (write_symbols
== DBX_DEBUG
)
3028 dbxout_source_line (file
, filename
, NOTE_LINE_NUMBER (insn
));
3031 #if defined (XCOFF_DEBUGGING_INFO)
3032 if (write_symbols
== XCOFF_DEBUG
)
3033 xcoffout_source_line (file
, filename
, insn
);
3036 #ifdef DWARF_DEBUGGING_INFO
3037 if (write_symbols
== DWARF_DEBUG
)
3038 dwarfout_line (filename
, NOTE_LINE_NUMBER (insn
));
3041 #ifdef DWARF2_DEBUGGING_INFO
3042 if (write_symbols
== DWARF2_DEBUG
)
3043 dwarf2out_line (filename
, NOTE_LINE_NUMBER (insn
));
3049 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3050 directly to the desired hard register. */
3052 cleanup_subreg_operands (insn
)
3057 extract_insn (insn
);
3058 for (i
= 0; i
< recog_n_operands
; i
++)
3060 if (GET_CODE (recog_operand
[i
]) == SUBREG
)
3061 recog_operand
[i
] = alter_subreg (recog_operand
[i
]);
3062 else if (GET_CODE (recog_operand
[i
]) == PLUS
3063 || GET_CODE (recog_operand
[i
]) == MULT
)
3064 recog_operand
[i
] = walk_alter_subreg (recog_operand
[i
]);
3067 for (i
= 0; i
< recog_n_dups
; i
++)
3069 if (GET_CODE (*recog_dup_loc
[i
]) == SUBREG
)
3070 *recog_dup_loc
[i
] = alter_subreg (*recog_dup_loc
[i
]);
3071 else if (GET_CODE (*recog_dup_loc
[i
]) == PLUS
3072 || GET_CODE (*recog_dup_loc
[i
]) == MULT
)
3073 *recog_dup_loc
[i
] = walk_alter_subreg (*recog_dup_loc
[i
]);
3077 /* If X is a SUBREG, replace it with a REG or a MEM,
3078 based on the thing it is a subreg of. */
3084 register rtx y
= SUBREG_REG (x
);
3086 if (GET_CODE (y
) == SUBREG
)
3087 y
= alter_subreg (y
);
3089 /* If reload is operating, we may be replacing inside this SUBREG.
3090 Check for that and make a new one if so. */
3091 if (reload_in_progress
&& find_replacement (&SUBREG_REG (x
)) != 0)
3094 if (GET_CODE (y
) == REG
)
3097 /* If the word size is larger than the size of this register,
3098 adjust the register number to compensate. */
3099 /* ??? Note that this just catches stragglers created by/for
3100 integrate. It would be better if we either caught these
3101 earlier, or kept _all_ subregs until now and eliminate
3102 gen_lowpart and friends. */
3104 #ifdef ALTER_HARD_SUBREG
3105 regno
= ALTER_HARD_SUBREG(GET_MODE (x
), SUBREG_WORD (x
),
3106 GET_MODE (y
), REGNO (y
));
3108 regno
= REGNO (y
) + SUBREG_WORD (x
);
3112 /* This field has a different meaning for REGs and SUBREGs. Make sure
3116 else if (GET_CODE (y
) == MEM
)
3118 register int offset
= SUBREG_WORD (x
) * UNITS_PER_WORD
;
3119 if (BYTES_BIG_ENDIAN
)
3120 offset
-= (MIN (UNITS_PER_WORD
, GET_MODE_SIZE (GET_MODE (x
)))
3121 - MIN (UNITS_PER_WORD
, GET_MODE_SIZE (GET_MODE (y
))));
3123 MEM_COPY_ATTRIBUTES (x
, y
);
3124 MEM_ALIAS_SET (x
) = MEM_ALIAS_SET (y
);
3125 XEXP (x
, 0) = plus_constant (XEXP (y
, 0), offset
);
3131 /* Do alter_subreg on all the SUBREGs contained in X. */
3134 walk_alter_subreg (x
)
3137 switch (GET_CODE (x
))
3141 XEXP (x
, 0) = walk_alter_subreg (XEXP (x
, 0));
3142 XEXP (x
, 1) = walk_alter_subreg (XEXP (x
, 1));
3146 XEXP (x
, 0) = walk_alter_subreg (XEXP (x
, 0));
3150 return alter_subreg (x
);
3161 /* Given BODY, the body of a jump instruction, alter the jump condition
3162 as required by the bits that are set in cc_status.flags.
3163 Not all of the bits there can be handled at this level in all cases.
3165 The value is normally 0.
3166 1 means that the condition has become always true.
3167 -1 means that the condition has become always false.
3168 2 means that COND has been altered. */
3176 if (cc_status
.flags
& CC_REVERSED
)
3179 PUT_CODE (cond
, swap_condition (GET_CODE (cond
)));
3182 if (cc_status
.flags
& CC_INVERTED
)
3185 PUT_CODE (cond
, reverse_condition (GET_CODE (cond
)));
3188 if (cc_status
.flags
& CC_NOT_POSITIVE
)
3189 switch (GET_CODE (cond
))
3194 /* Jump becomes unconditional. */
3200 /* Jump becomes no-op. */
3204 PUT_CODE (cond
, EQ
);
3209 PUT_CODE (cond
, NE
);
3217 if (cc_status
.flags
& CC_NOT_NEGATIVE
)
3218 switch (GET_CODE (cond
))
3222 /* Jump becomes unconditional. */
3227 /* Jump becomes no-op. */
3232 PUT_CODE (cond
, EQ
);
3238 PUT_CODE (cond
, NE
);
3246 if (cc_status
.flags
& CC_NO_OVERFLOW
)
3247 switch (GET_CODE (cond
))
3250 /* Jump becomes unconditional. */
3254 PUT_CODE (cond
, EQ
);
3259 PUT_CODE (cond
, NE
);
3264 /* Jump becomes no-op. */
3271 if (cc_status
.flags
& (CC_Z_IN_NOT_N
| CC_Z_IN_N
))
3272 switch (GET_CODE (cond
))
3278 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? GE
: LT
);
3283 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? LT
: GE
);
3288 if (cc_status
.flags
& CC_NOT_SIGNED
)
3289 /* The flags are valid if signed condition operators are converted
3291 switch (GET_CODE (cond
))
3294 PUT_CODE (cond
, LEU
);
3299 PUT_CODE (cond
, LTU
);
3304 PUT_CODE (cond
, GTU
);
3309 PUT_CODE (cond
, GEU
);
3321 /* Report inconsistency between the assembler template and the operands.
3322 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3325 output_operand_lossage (msgid
)
3328 if (this_is_asm_operands
)
3329 error_for_asm (this_is_asm_operands
, "invalid `asm': %s", _(msgid
));
3332 error ("output_operand: %s", _(msgid
));
3337 /* Output of assembler code from a template, and its subroutines. */
3339 /* Output text from TEMPLATE to the assembler output file,
3340 obeying %-directions to substitute operands taken from
3341 the vector OPERANDS.
3343 %N (for N a digit) means print operand N in usual manner.
3344 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3345 and print the label name with no punctuation.
3346 %cN means require operand N to be a constant
3347 and print the constant expression with no punctuation.
3348 %aN means expect operand N to be a memory address
3349 (not a memory reference!) and print a reference
3351 %nN means expect operand N to be a constant
3352 and print a constant expression for minus the value
3353 of the operand, with no other punctuation. */
3358 if (flag_print_asm_name
)
3360 /* Annotate the assembly with a comment describing the pattern and
3361 alternative used. */
3364 register int num
= INSN_CODE (debug_insn
);
3365 fprintf (asm_out_file
, "\t%s %d\t%s",
3366 ASM_COMMENT_START
, INSN_UID (debug_insn
), insn_name
[num
]);
3367 if (insn_n_alternatives
[num
] > 1)
3368 fprintf (asm_out_file
, "/%d", which_alternative
+ 1);
3369 #ifdef HAVE_ATTR_length
3370 fprintf (asm_out_file
, "\t[length = %d]", get_attr_length (debug_insn
));
3372 /* Clear this so only the first assembler insn
3373 of any rtl insn will get the special comment for -dp. */
3380 output_asm_insn (template, operands
)
3381 const char *template;
3384 register const char *p
;
3387 /* An insn may return a null string template
3388 in a case where no assembler code is needed. */
3393 putc ('\t', asm_out_file
);
3395 #ifdef ASM_OUTPUT_OPCODE
3396 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3404 putc (c
, asm_out_file
);
3405 #ifdef ASM_OUTPUT_OPCODE
3406 while ((c
= *p
) == '\t')
3408 putc (c
, asm_out_file
);
3411 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3415 #ifdef ASSEMBLER_DIALECT
3420 /* If we want the first dialect, do nothing. Otherwise, skip
3421 DIALECT_NUMBER of strings ending with '|'. */
3422 for (i
= 0; i
< dialect_number
; i
++)
3424 while (*p
&& *p
!= '}' && *p
++ != '|')
3435 /* Skip to close brace. */
3436 while (*p
&& *p
++ != '}')
3445 /* %% outputs a single %. */
3449 putc (c
, asm_out_file
);
3451 /* %= outputs a number which is unique to each insn in the entire
3452 compilation. This is useful for making local labels that are
3453 referred to more than once in a given insn. */
3457 fprintf (asm_out_file
, "%d", insn_counter
);
3459 /* % followed by a letter and some digits
3460 outputs an operand in a special way depending on the letter.
3461 Letters `acln' are implemented directly.
3462 Other letters are passed to `output_operand' so that
3463 the PRINT_OPERAND macro can define them. */
3464 else if ((*p
>= 'a' && *p
<= 'z')
3465 || (*p
>= 'A' && *p
<= 'Z'))
3470 if (! (*p
>= '0' && *p
<= '9'))
3471 output_operand_lossage ("operand number missing after %-letter");
3472 else if (this_is_asm_operands
&& (c
< 0 || (unsigned int) c
>= insn_noperands
))
3473 output_operand_lossage ("operand number out of range");
3474 else if (letter
== 'l')
3475 output_asm_label (operands
[c
]);
3476 else if (letter
== 'a')
3477 output_address (operands
[c
]);
3478 else if (letter
== 'c')
3480 if (CONSTANT_ADDRESS_P (operands
[c
]))
3481 output_addr_const (asm_out_file
, operands
[c
]);
3483 output_operand (operands
[c
], 'c');
3485 else if (letter
== 'n')
3487 if (GET_CODE (operands
[c
]) == CONST_INT
)
3488 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
,
3489 - INTVAL (operands
[c
]));
3492 putc ('-', asm_out_file
);
3493 output_addr_const (asm_out_file
, operands
[c
]);
3497 output_operand (operands
[c
], letter
);
3499 while ((c
= *p
) >= '0' && c
<= '9') p
++;
3501 /* % followed by a digit outputs an operand the default way. */
3502 else if (*p
>= '0' && *p
<= '9')
3505 if (this_is_asm_operands
&& (c
< 0 || (unsigned int) c
>= insn_noperands
))
3506 output_operand_lossage ("operand number out of range");
3508 output_operand (operands
[c
], 0);
3509 while ((c
= *p
) >= '0' && c
<= '9') p
++;
3511 /* % followed by punctuation: output something for that
3512 punctuation character alone, with no operand.
3513 The PRINT_OPERAND macro decides what is actually done. */
3514 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3515 else if (PRINT_OPERAND_PUNCT_VALID_P ((unsigned char)*p
))
3516 output_operand (NULL_RTX
, *p
++);
3519 output_operand_lossage ("invalid %%-code");
3523 putc (c
, asm_out_file
);
3528 putc ('\n', asm_out_file
);
3531 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3534 output_asm_label (x
)
3539 if (GET_CODE (x
) == LABEL_REF
)
3540 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (XEXP (x
, 0)));
3541 else if (GET_CODE (x
) == CODE_LABEL
)
3542 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3544 output_operand_lossage ("`%l' operand isn't a label");
3546 assemble_name (asm_out_file
, buf
);
3549 /* Print operand X using machine-dependent assembler syntax.
3550 The macro PRINT_OPERAND is defined just to control this function.
3551 CODE is a non-digit that preceded the operand-number in the % spec,
3552 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3553 between the % and the digits.
3554 When CODE is a non-letter, X is 0.
3556 The meanings of the letters are machine-dependent and controlled
3557 by PRINT_OPERAND. */
3560 output_operand (x
, code
)
3564 if (x
&& GET_CODE (x
) == SUBREG
)
3565 x
= alter_subreg (x
);
3567 /* If X is a pseudo-register, abort now rather than writing trash to the
3570 if (x
&& GET_CODE (x
) == REG
&& REGNO (x
) >= FIRST_PSEUDO_REGISTER
)
3573 PRINT_OPERAND (asm_out_file
, x
, code
);
3576 /* Print a memory reference operand for address X
3577 using machine-dependent assembler syntax.
3578 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3584 walk_alter_subreg (x
);
3585 PRINT_OPERAND_ADDRESS (asm_out_file
, x
);
3588 /* Print an integer constant expression in assembler syntax.
3589 Addition and subtraction are the only arithmetic
3590 that may appear in these expressions. */
3593 output_addr_const (file
, x
)
3600 switch (GET_CODE (x
))
3610 assemble_name (file
, XSTR (x
, 0));
3614 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (XEXP (x
, 0)));
3615 assemble_name (file
, buf
);
3619 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3620 assemble_name (file
, buf
);
3624 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, INTVAL (x
));
3628 /* This used to output parentheses around the expression,
3629 but that does not work on the 386 (either ATT or BSD assembler). */
3630 output_addr_const (file
, XEXP (x
, 0));
3634 if (GET_MODE (x
) == VOIDmode
)
3636 /* We can use %d if the number is one word and positive. */
3637 if (CONST_DOUBLE_HIGH (x
))
3638 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
3639 CONST_DOUBLE_HIGH (x
), CONST_DOUBLE_LOW (x
));
3640 else if (CONST_DOUBLE_LOW (x
) < 0)
3641 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
, CONST_DOUBLE_LOW (x
));
3643 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_DOUBLE_LOW (x
));
3646 /* We can't handle floating point constants;
3647 PRINT_OPERAND must handle them. */
3648 output_operand_lossage ("floating constant misused");
3652 /* Some assemblers need integer constants to appear last (eg masm). */
3653 if (GET_CODE (XEXP (x
, 0)) == CONST_INT
)
3655 output_addr_const (file
, XEXP (x
, 1));
3656 if (INTVAL (XEXP (x
, 0)) >= 0)
3657 fprintf (file
, "+");
3658 output_addr_const (file
, XEXP (x
, 0));
3662 output_addr_const (file
, XEXP (x
, 0));
3663 if (INTVAL (XEXP (x
, 1)) >= 0)
3664 fprintf (file
, "+");
3665 output_addr_const (file
, XEXP (x
, 1));
3670 /* Avoid outputting things like x-x or x+5-x,
3671 since some assemblers can't handle that. */
3672 x
= simplify_subtraction (x
);
3673 if (GET_CODE (x
) != MINUS
)
3676 output_addr_const (file
, XEXP (x
, 0));
3677 fprintf (file
, "-");
3678 if (GET_CODE (XEXP (x
, 1)) == CONST_INT
3679 && INTVAL (XEXP (x
, 1)) < 0)
3681 fprintf (file
, "%s", ASM_OPEN_PAREN
);
3682 output_addr_const (file
, XEXP (x
, 1));
3683 fprintf (file
, "%s", ASM_CLOSE_PAREN
);
3686 output_addr_const (file
, XEXP (x
, 1));
3691 output_addr_const (file
, XEXP (x
, 0));
3695 output_operand_lossage ("invalid expression as operand");
3699 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3700 %R prints the value of REGISTER_PREFIX.
3701 %L prints the value of LOCAL_LABEL_PREFIX.
3702 %U prints the value of USER_LABEL_PREFIX.
3703 %I prints the value of IMMEDIATE_PREFIX.
3704 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3705 Also supported are %d, %x, %s, %e, %f, %g and %%.
3707 We handle alternate assembler dialects here, just like output_asm_insn. */
3710 asm_fprintf
VPROTO((FILE *file
, const char *p
, ...))
3712 #ifndef ANSI_PROTOTYPES
3720 VA_START (argptr
, p
);
3722 #ifndef ANSI_PROTOTYPES
3723 file
= va_arg (argptr
, FILE *);
3724 p
= va_arg (argptr
, const char *);
3732 #ifdef ASSEMBLER_DIALECT
3737 /* If we want the first dialect, do nothing. Otherwise, skip
3738 DIALECT_NUMBER of strings ending with '|'. */
3739 for (i
= 0; i
< dialect_number
; i
++)
3741 while (*p
&& *p
++ != '|')
3751 /* Skip to close brace. */
3752 while (*p
&& *p
++ != '}')
3763 while ((c
>= '0' && c
<= '9') || c
== '.')
3771 fprintf (file
, "%%");
3774 case 'd': case 'i': case 'u':
3775 case 'x': case 'p': case 'X':
3779 fprintf (file
, buf
, va_arg (argptr
, int));
3783 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3784 but we do not check for those cases. It means that the value
3785 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3787 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3789 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3799 fprintf (file
, buf
, va_arg (argptr
, HOST_WIDE_INT
));
3806 fprintf (file
, buf
, va_arg (argptr
, long));
3814 fprintf (file
, buf
, va_arg (argptr
, double));
3820 fprintf (file
, buf
, va_arg (argptr
, char *));
3824 #ifdef ASM_OUTPUT_OPCODE
3825 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3830 #ifdef REGISTER_PREFIX
3831 fprintf (file
, "%s", REGISTER_PREFIX
);
3836 #ifdef IMMEDIATE_PREFIX
3837 fprintf (file
, "%s", IMMEDIATE_PREFIX
);
3842 #ifdef LOCAL_LABEL_PREFIX
3843 fprintf (file
, "%s", LOCAL_LABEL_PREFIX
);
3848 fputs (user_label_prefix
, file
);
3851 #ifdef ASM_FPRINTF_EXTENSIONS
3852 /* Upper case letters are reserved for general use by asm_fprintf
3853 and so are not available to target specific code. In order to
3854 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
3855 they are defined here. As they get turned into real extensions
3856 to asm_fprintf they should be removed from this list. */
3857 case 'A': case 'B': case 'C': case 'D': case 'E':
3858 case 'F': case 'G': case 'H': case 'J': case 'K':
3859 case 'M': case 'N': case 'P': case 'Q': case 'S':
3860 case 'T': case 'V': case 'W': case 'Y': case 'Z':
3863 ASM_FPRINTF_EXTENSIONS (file
, argptr
, p
)
3875 /* Split up a CONST_DOUBLE or integer constant rtx
3876 into two rtx's for single words,
3877 storing in *FIRST the word that comes first in memory in the target
3878 and in *SECOND the other. */
3881 split_double (value
, first
, second
)
3883 rtx
*first
, *second
;
3885 if (GET_CODE (value
) == CONST_INT
)
3887 if (HOST_BITS_PER_WIDE_INT
>= (2 * BITS_PER_WORD
))
3889 /* In this case the CONST_INT holds both target words.
3890 Extract the bits from it into two word-sized pieces.
3891 Sign extend each half to HOST_WIDE_INT. */
3893 /* On machines where HOST_BITS_PER_WIDE_INT == BITS_PER_WORD
3894 the shift below will cause a compiler warning, even though
3895 this code won't be executed. So put the shift amounts in
3896 variables to avoid the warning. */
3897 int rshift
= HOST_BITS_PER_WIDE_INT
- BITS_PER_WORD
;
3898 int lshift
= HOST_BITS_PER_WIDE_INT
- 2 * BITS_PER_WORD
;
3900 low
= GEN_INT ((INTVAL (value
) << rshift
) >> rshift
);
3901 high
= GEN_INT ((INTVAL (value
) << lshift
) >> rshift
);
3902 if (WORDS_BIG_ENDIAN
)
3915 /* The rule for using CONST_INT for a wider mode
3916 is that we regard the value as signed.
3917 So sign-extend it. */
3918 rtx high
= (INTVAL (value
) < 0 ? constm1_rtx
: const0_rtx
);
3919 if (WORDS_BIG_ENDIAN
)
3931 else if (GET_CODE (value
) != CONST_DOUBLE
)
3933 if (WORDS_BIG_ENDIAN
)
3935 *first
= const0_rtx
;
3941 *second
= const0_rtx
;
3944 else if (GET_MODE (value
) == VOIDmode
3945 /* This is the old way we did CONST_DOUBLE integers. */
3946 || GET_MODE_CLASS (GET_MODE (value
)) == MODE_INT
)
3948 /* In an integer, the words are defined as most and least significant.
3949 So order them by the target's convention. */
3950 if (WORDS_BIG_ENDIAN
)
3952 *first
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3953 *second
= GEN_INT (CONST_DOUBLE_LOW (value
));
3957 *first
= GEN_INT (CONST_DOUBLE_LOW (value
));
3958 *second
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3963 #ifdef REAL_ARITHMETIC
3964 REAL_VALUE_TYPE r
; long l
[2];
3965 REAL_VALUE_FROM_CONST_DOUBLE (r
, value
);
3967 /* Note, this converts the REAL_VALUE_TYPE to the target's
3968 format, splits up the floating point double and outputs
3969 exactly 32 bits of it into each of l[0] and l[1] --
3970 not necessarily BITS_PER_WORD bits. */
3971 REAL_VALUE_TO_TARGET_DOUBLE (r
, l
);
3973 /* If 32 bits is an entire word for the target, but not for the host,
3974 then sign-extend on the host so that the number will look the same
3975 way on the host that it would on the target. See for instance
3976 simplify_unary_operation. The #if is needed to avoid compiler
3979 #if HOST_BITS_PER_LONG > 32
3980 if (BITS_PER_WORD
< HOST_BITS_PER_LONG
&& BITS_PER_WORD
== 32)
3982 if (l
[0] & ((long) 1 << 31))
3983 l
[0] |= ((long) (-1) << 32);
3984 if (l
[1] & ((long) 1 << 31))
3985 l
[1] |= ((long) (-1) << 32);
3989 *first
= GEN_INT ((HOST_WIDE_INT
) l
[0]);
3990 *second
= GEN_INT ((HOST_WIDE_INT
) l
[1]);
3992 if ((HOST_FLOAT_FORMAT
!= TARGET_FLOAT_FORMAT
3993 || HOST_BITS_PER_WIDE_INT
!= BITS_PER_WORD
)
3994 && ! flag_pretend_float
)
3998 #ifdef HOST_WORDS_BIG_ENDIAN
4005 /* Host and target agree => no need to swap. */
4006 *first
= GEN_INT (CONST_DOUBLE_LOW (value
));
4007 *second
= GEN_INT (CONST_DOUBLE_HIGH (value
));
4011 *second
= GEN_INT (CONST_DOUBLE_LOW (value
));
4012 *first
= GEN_INT (CONST_DOUBLE_HIGH (value
));
4014 #endif /* no REAL_ARITHMETIC */
4018 /* Return nonzero if this function has no function calls. */
4025 if (profile_flag
|| profile_block_flag
|| profile_arc_flag
)
4028 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
4030 if (GET_CODE (insn
) == CALL_INSN
)
4032 if (GET_CODE (insn
) == INSN
4033 && GET_CODE (PATTERN (insn
)) == SEQUENCE
4034 && GET_CODE (XVECEXP (PATTERN (insn
), 0, 0)) == CALL_INSN
)
4037 for (insn
= current_function_epilogue_delay_list
; insn
; insn
= XEXP (insn
, 1))
4039 if (GET_CODE (XEXP (insn
, 0)) == CALL_INSN
)
4041 if (GET_CODE (XEXP (insn
, 0)) == INSN
4042 && GET_CODE (PATTERN (XEXP (insn
, 0))) == SEQUENCE
4043 && GET_CODE (XVECEXP (PATTERN (XEXP (insn
, 0)), 0, 0)) == CALL_INSN
)
4050 /* On some machines, a function with no call insns
4051 can run faster if it doesn't create its own register window.
4052 When output, the leaf function should use only the "output"
4053 registers. Ordinarily, the function would be compiled to use
4054 the "input" registers to find its arguments; it is a candidate
4055 for leaf treatment if it uses only the "input" registers.
4056 Leaf function treatment means renumbering so the function
4057 uses the "output" registers instead. */
4059 #ifdef LEAF_REGISTERS
4061 static char permitted_reg_in_leaf_functions
[] = LEAF_REGISTERS
;
4063 /* Return 1 if this function uses only the registers that can be
4064 safely renumbered. */
4067 only_leaf_regs_used ()
4071 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4072 if ((regs_ever_live
[i
] || global_regs
[i
])
4073 && ! permitted_reg_in_leaf_functions
[i
])
4076 if (current_function_uses_pic_offset_table
4077 && pic_offset_table_rtx
!= 0
4078 && GET_CODE (pic_offset_table_rtx
) == REG
4079 && ! permitted_reg_in_leaf_functions
[REGNO (pic_offset_table_rtx
)])
4085 /* Scan all instructions and renumber all registers into those
4086 available in leaf functions. */
4089 leaf_renumber_regs (first
)
4094 /* Renumber only the actual patterns.
4095 The reg-notes can contain frame pointer refs,
4096 and renumbering them could crash, and should not be needed. */
4097 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
4098 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
4099 leaf_renumber_regs_insn (PATTERN (insn
));
4100 for (insn
= current_function_epilogue_delay_list
; insn
; insn
= XEXP (insn
, 1))
4101 if (GET_RTX_CLASS (GET_CODE (XEXP (insn
, 0))) == 'i')
4102 leaf_renumber_regs_insn (PATTERN (XEXP (insn
, 0)));
4105 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4106 available in leaf functions. */
4109 leaf_renumber_regs_insn (in_rtx
)
4110 register rtx in_rtx
;
4113 register const char *format_ptr
;
4118 /* Renumber all input-registers into output-registers.
4119 renumbered_regs would be 1 for an output-register;
4122 if (GET_CODE (in_rtx
) == REG
)
4126 /* Don't renumber the same reg twice. */
4130 newreg
= REGNO (in_rtx
);
4131 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4132 to reach here as part of a REG_NOTE. */
4133 if (newreg
>= FIRST_PSEUDO_REGISTER
)
4138 newreg
= LEAF_REG_REMAP (newreg
);
4141 regs_ever_live
[REGNO (in_rtx
)] = 0;
4142 regs_ever_live
[newreg
] = 1;
4143 REGNO (in_rtx
) = newreg
;
4147 if (GET_RTX_CLASS (GET_CODE (in_rtx
)) == 'i')
4149 /* Inside a SEQUENCE, we find insns.
4150 Renumber just the patterns of these insns,
4151 just as we do for the top-level insns. */
4152 leaf_renumber_regs_insn (PATTERN (in_rtx
));
4156 format_ptr
= GET_RTX_FORMAT (GET_CODE (in_rtx
));
4158 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (in_rtx
)); i
++)
4159 switch (*format_ptr
++)
4162 leaf_renumber_regs_insn (XEXP (in_rtx
, i
));
4166 if (NULL
!= XVEC (in_rtx
, i
))
4168 for (j
= 0; j
< XVECLEN (in_rtx
, i
); j
++)
4169 leaf_renumber_regs_insn (XVECEXP (in_rtx
, i
, j
));