1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-97, 1998 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. */
59 #include "insn-config.h"
60 #include "insn-flags.h"
61 #include "insn-attr.h"
62 #include "insn-codes.h"
64 #include "conditions.h"
67 #include "hard-reg-set.h"
72 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
73 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
74 #if defined (USG) || defined (NO_STAB_H)
75 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
77 #include <stab.h> /* On BSD, use the system's stab.h. */
79 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
81 #ifdef XCOFF_DEBUGGING_INFO
85 /* .stabd code for line number. */
90 /* .stabs code for included file name. */
96 #define INT_TYPE_SIZE BITS_PER_WORD
99 #ifndef LONG_TYPE_SIZE
100 #define LONG_TYPE_SIZE BITS_PER_WORD
103 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
104 null default for it to save conditionalization later. */
105 #ifndef CC_STATUS_INIT
106 #define CC_STATUS_INIT
109 /* How to start an assembler comment. */
110 #ifndef ASM_COMMENT_START
111 #define ASM_COMMENT_START ";#"
114 /* Is the given character a logical line separator for the assembler? */
115 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
116 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
119 /* Nonzero means this function is a leaf function, with no function calls.
120 This variable exists to be examined in FUNCTION_PROLOGUE
121 and FUNCTION_EPILOGUE. Always zero, unless set by some action. */
124 /* Last insn processed by final_scan_insn. */
125 static rtx debug_insn
= 0;
127 /* Line number of last NOTE. */
128 static int last_linenum
;
130 /* Highest line number in current block. */
131 static int high_block_linenum
;
133 /* Likewise for function. */
134 static int high_function_linenum
;
136 /* Filename of last NOTE. */
137 static char *last_filename
;
139 /* Number of basic blocks seen so far;
140 used if profile_block_flag is set. */
141 static int count_basic_blocks
;
143 /* Number of instrumented arcs when profile_arc_flag is set. */
144 extern int count_instrumented_arcs
;
146 /* Nonzero while outputting an `asm' with operands.
147 This means that inconsistencies are the user's fault, so don't abort.
148 The precise value is the insn being output, to pass to error_for_asm. */
149 static rtx this_is_asm_operands
;
151 /* Number of operands of this insn, for an `asm' with operands. */
152 static int insn_noperands
;
154 /* Compare optimization flag. */
156 static rtx last_ignored_compare
= 0;
158 /* Flag indicating this insn is the start of a new basic block. */
160 static int new_block
= 1;
162 /* All the symbol-blocks (levels of scoping) in the compilation
163 are assigned sequence numbers in order of appearance of the
164 beginnings of the symbol-blocks. Both final and dbxout do this,
165 and assume that they will both give the same number to each block.
166 Final uses these sequence numbers to generate assembler label names
167 LBBnnn and LBEnnn for the beginning and end of the symbol-block.
168 Dbxout uses the sequence numbers to generate references to the same labels
169 from the dbx debugging information.
171 Sdb records this level at the beginning of each function,
172 in order to find the current level when recursing down declarations.
173 It outputs the block beginning and endings
174 at the point in the asm file where the blocks would begin and end. */
176 int next_block_index
;
178 /* Assign a unique number to each insn that is output.
179 This can be used to generate unique local labels. */
181 static int insn_counter
= 0;
184 /* This variable contains machine-dependent flags (defined in tm.h)
185 set and examined by output routines
186 that describe how to interpret the condition codes properly. */
190 /* During output of an insn, this contains a copy of cc_status
191 from before the insn. */
193 CC_STATUS cc_prev_status
;
196 /* Indexed by hardware reg number, is 1 if that register is ever
197 used in the current function.
199 In life_analysis, or in stupid_life_analysis, this is set
200 up to record the hard regs used explicitly. Reload adds
201 in the hard regs used for holding pseudo regs. Final uses
202 it to generate the code in the function prologue and epilogue
203 to save and restore registers as needed. */
205 char regs_ever_live
[FIRST_PSEUDO_REGISTER
];
207 /* Nonzero means current function must be given a frame pointer.
208 Set in stmt.c if anything is allocated on the stack there.
209 Set in reload1.c if anything is allocated on the stack there. */
211 int frame_pointer_needed
;
213 /* Assign unique numbers to labels generated for profiling. */
215 int profile_label_no
;
217 /* Length so far allocated in PENDING_BLOCKS. */
219 static int max_block_depth
;
221 /* Stack of sequence numbers of symbol-blocks of which we have seen the
222 beginning but not yet the end. Sequence numbers are assigned at
223 the beginning; this stack allows us to find the sequence number
224 of a block that is ending. */
226 static int *pending_blocks
;
228 /* Number of elements currently in use in PENDING_BLOCKS. */
230 static int block_depth
;
232 /* Nonzero if have enabled APP processing of our assembler output. */
236 /* If we are outputting an insn sequence, this contains the sequence rtx.
241 #ifdef ASSEMBLER_DIALECT
243 /* Number of the assembler dialect to use, starting at 0. */
244 static int dialect_number
;
247 /* Indexed by line number, nonzero if there is a note for that line. */
249 static char *line_note_exists
;
251 /* Linked list to hold line numbers for each basic block. */
254 struct bb_list
*next
; /* pointer to next basic block */
255 int line_num
; /* line number */
256 int file_label_num
; /* LPBC<n> label # for stored filename */
257 int func_label_num
; /* LPBC<n> label # for stored function name */
260 static struct bb_list
*bb_head
= 0; /* Head of basic block list */
261 static struct bb_list
**bb_tail
= &bb_head
; /* Ptr to store next bb ptr */
262 static int bb_file_label_num
= -1; /* Current label # for file */
263 static int bb_func_label_num
= -1; /* Current label # for func */
265 /* Linked list to hold the strings for each file and function name output. */
268 struct bb_str
*next
; /* pointer to next string */
269 char *string
; /* string */
270 int label_num
; /* label number */
271 int length
; /* string length */
274 extern rtx peephole
PROTO((rtx
));
276 static struct bb_str
*sbb_head
= 0; /* Head of string list. */
277 static struct bb_str
**sbb_tail
= &sbb_head
; /* Ptr to store next bb str */
278 static int sbb_label_num
= 0; /* Last label used */
280 static int asm_insn_count
PROTO((rtx
));
281 static void profile_function
PROTO((FILE *));
282 static void profile_after_prologue
PROTO((FILE *));
283 static void add_bb
PROTO((FILE *));
284 static int add_bb_string
PROTO((char *, int));
285 static void output_source_line
PROTO((FILE *, rtx
));
286 static rtx walk_alter_subreg
PROTO((rtx
));
287 static void output_asm_name
PROTO((void));
288 static void output_operand
PROTO((rtx
, int));
289 #ifdef LEAF_REGISTERS
290 static void leaf_renumber_regs
PROTO((rtx
));
293 static int alter_cond
PROTO((rtx
));
296 extern char *getpwd ();
298 /* Initialize data in final at the beginning of a compilation. */
301 init_final (filename
)
304 next_block_index
= 2;
306 max_block_depth
= 20;
307 pending_blocks
= (int *) xmalloc (20 * sizeof *pending_blocks
);
310 #ifdef ASSEMBLER_DIALECT
311 dialect_number
= ASSEMBLER_DIALECT
;
315 /* Called at end of source file,
316 to output the block-profiling table for this entire compilation. */
324 if (profile_block_flag
|| profile_arc_flag
)
327 int align
= exact_log2 (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
);
331 int long_bytes
= LONG_TYPE_SIZE
/ BITS_PER_UNIT
;
332 int pointer_bytes
= POINTER_SIZE
/ BITS_PER_UNIT
;
334 if (profile_block_flag
)
335 size
= long_bytes
* count_basic_blocks
;
337 size
= long_bytes
* count_instrumented_arcs
;
340 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
341 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
342 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
346 /* Output the main header, of 11 words:
347 0: 1 if this file is initialized, else 0.
348 1: address of file name (LPBX1).
349 2: address of table of counts (LPBX2).
350 3: number of counts in the table.
351 4: always 0, for compatibility with Sun.
353 The following are GNU extensions:
355 5: address of table of start addrs of basic blocks (LPBX3).
356 6: Number of bytes in this header.
357 7: address of table of function names (LPBX4).
358 8: address of table of line numbers (LPBX5) or 0.
359 9: address of table of file names (LPBX6) or 0.
360 10: space reserved for basic block profiling. */
362 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
364 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 0);
366 assemble_integer (const0_rtx
, long_bytes
, 1);
368 /* address of filename */
369 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 1);
370 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), pointer_bytes
, 1);
372 /* address of count table */
373 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 2);
374 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), pointer_bytes
, 1);
376 /* count of the # of basic blocks or # of instrumented arcs */
377 if (profile_block_flag
)
378 assemble_integer (GEN_INT (count_basic_blocks
), long_bytes
, 1);
380 assemble_integer (GEN_INT (count_instrumented_arcs
), long_bytes
,
383 /* zero word (link field) */
384 assemble_integer (const0_rtx
, pointer_bytes
, 1);
386 /* address of basic block start address table */
387 if (profile_block_flag
)
389 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 3);
390 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), pointer_bytes
,
394 assemble_integer (const0_rtx
, pointer_bytes
, 1);
396 /* byte count for extended structure. */
397 assemble_integer (GEN_INT (10 * UNITS_PER_WORD
), long_bytes
, 1);
399 /* address of function name table */
400 if (profile_block_flag
)
402 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 4);
403 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), pointer_bytes
,
407 assemble_integer (const0_rtx
, pointer_bytes
, 1);
409 /* address of line number and filename tables if debugging. */
410 if (write_symbols
!= NO_DEBUG
&& profile_block_flag
)
412 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 5);
413 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), pointer_bytes
, 1);
414 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 6);
415 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), pointer_bytes
, 1);
419 assemble_integer (const0_rtx
, pointer_bytes
, 1);
420 assemble_integer (const0_rtx
, pointer_bytes
, 1);
423 /* space for extension ptr (link field) */
424 assemble_integer (const0_rtx
, UNITS_PER_WORD
, 1);
426 /* Output the file name changing the suffix to .d for Sun tcov
428 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 1);
430 char *cwd
= getpwd ();
431 int len
= strlen (filename
) + strlen (cwd
) + 1;
432 char *data_file
= (char *) alloca (len
+ 4);
434 strcpy (data_file
, cwd
);
435 strcat (data_file
, "/");
436 strcat (data_file
, filename
);
437 strip_off_ending (data_file
, len
);
438 if (profile_block_flag
)
439 strcat (data_file
, ".d");
441 strcat (data_file
, ".da");
442 assemble_string (data_file
, strlen (data_file
) + 1);
445 /* Make space for the table of counts. */
448 /* Realign data section. */
449 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
450 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 2);
452 assemble_zeros (size
);
456 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 2);
457 #ifdef ASM_OUTPUT_SHARED_LOCAL
458 if (flag_shared_data
)
459 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
462 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
463 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
466 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
467 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
,
470 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
475 /* Output any basic block strings */
476 if (profile_block_flag
)
478 readonly_data_section ();
481 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
482 for (sptr
= sbb_head
; sptr
!= 0; sptr
= sptr
->next
)
484 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBC",
486 assemble_string (sptr
->string
, sptr
->length
);
491 /* Output the table of addresses. */
492 if (profile_block_flag
)
494 /* Realign in new section */
495 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
496 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 3);
497 for (i
= 0; i
< count_basic_blocks
; i
++)
499 ASM_GENERATE_INTERNAL_LABEL (name
, "LPB", i
);
500 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
),
505 /* Output the table of function names. */
506 if (profile_block_flag
)
508 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 4);
509 for ((ptr
= bb_head
), (i
= 0); ptr
!= 0; (ptr
= ptr
->next
), i
++)
511 if (ptr
->func_label_num
>= 0)
513 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBC",
514 ptr
->func_label_num
);
515 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
),
519 assemble_integer (const0_rtx
, pointer_bytes
, 1);
522 for ( ; i
< count_basic_blocks
; i
++)
523 assemble_integer (const0_rtx
, pointer_bytes
, 1);
526 if (write_symbols
!= NO_DEBUG
&& profile_block_flag
)
528 /* Output the table of line numbers. */
529 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 5);
530 for ((ptr
= bb_head
), (i
= 0); ptr
!= 0; (ptr
= ptr
->next
), i
++)
531 assemble_integer (GEN_INT (ptr
->line_num
), long_bytes
, 1);
533 for ( ; i
< count_basic_blocks
; i
++)
534 assemble_integer (const0_rtx
, long_bytes
, 1);
536 /* Output the table of file names. */
537 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 6);
538 for ((ptr
= bb_head
), (i
= 0); ptr
!= 0; (ptr
= ptr
->next
), i
++)
540 if (ptr
->file_label_num
>= 0)
542 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBC",
543 ptr
->file_label_num
);
544 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
),
548 assemble_integer (const0_rtx
, pointer_bytes
, 1);
551 for ( ; i
< count_basic_blocks
; i
++)
552 assemble_integer (const0_rtx
, pointer_bytes
, 1);
555 /* End with the address of the table of addresses,
556 so we can find it easily, as the last word in the file's text. */
557 if (profile_block_flag
)
559 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 3);
560 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), pointer_bytes
,
566 /* Enable APP processing of subsequent output.
567 Used before the output from an `asm' statement. */
574 fprintf (asm_out_file
, ASM_APP_ON
);
579 /* Disable APP processing of subsequent output.
580 Called from varasm.c before most kinds of output. */
587 fprintf (asm_out_file
, ASM_APP_OFF
);
592 /* Return the number of slots filled in the current
593 delayed branch sequence (we don't count the insn needing the
594 delay slot). Zero if not in a delayed branch sequence. */
598 dbr_sequence_length ()
600 if (final_sequence
!= 0)
601 return XVECLEN (final_sequence
, 0) - 1;
607 /* The next two pages contain routines used to compute the length of an insn
608 and to shorten branches. */
610 /* Arrays for insn lengths, and addresses. The latter is referenced by
611 `insn_current_length'. */
613 static short *insn_lengths
;
616 /* Address of insn being processed. Used by `insn_current_length'. */
617 int insn_current_address
;
619 /* Indicate that branch shortening hasn't yet been done. */
627 /* Obtain the current length of an insn. If branch shortening has been done,
628 get its actual length. Otherwise, get its maximum length. */
631 get_attr_length (insn
)
634 #ifdef HAVE_ATTR_length
640 return insn_lengths
[INSN_UID (insn
)];
642 switch (GET_CODE (insn
))
650 length
= insn_default_length (insn
);
654 body
= PATTERN (insn
);
655 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
657 /* This only takes room if jump tables go into the text section. */
658 #if !defined(READONLY_DATA_SECTION) || defined(JUMP_TABLES_IN_TEXT_SECTION)
659 length
= (XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
)
660 * GET_MODE_SIZE (GET_MODE (body
)));
662 /* Be pessimistic and assume worst-case alignment. */
663 length
+= (GET_MODE_SIZE (GET_MODE (body
)) - 1);
669 length
= insn_default_length (insn
);
673 body
= PATTERN (insn
);
674 if (GET_CODE (body
) == USE
|| GET_CODE (body
) == CLOBBER
)
677 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
678 length
= asm_insn_count (body
) * insn_default_length (insn
);
679 else if (GET_CODE (body
) == SEQUENCE
)
680 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
681 length
+= get_attr_length (XVECEXP (body
, 0, i
));
683 length
= insn_default_length (insn
);
690 #ifdef ADJUST_INSN_LENGTH
691 ADJUST_INSN_LENGTH (insn
, length
);
694 #else /* not HAVE_ATTR_length */
696 #endif /* not HAVE_ATTR_length */
699 /* Make a pass over all insns and compute their actual lengths by shortening
700 any branches of variable length if possible. */
702 /* Give a default value for the lowest address in a function. */
704 #ifndef FIRST_INSN_ADDRESS
705 #define FIRST_INSN_ADDRESS 0
709 shorten_branches (first
)
712 #ifdef HAVE_ATTR_length
714 int something_changed
= 1;
716 char *varying_length
;
720 /* In order to make sure that all instructions have valid length info,
721 we must split them before we compute the address/length info. */
723 for (insn
= NEXT_INSN (first
); insn
; insn
= NEXT_INSN (insn
))
724 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
725 insn
= try_split (PATTERN (insn
), insn
, 1);
727 /* Compute maximum UID and allocate arrays. */
728 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
729 if (INSN_UID (insn
) > max_uid
)
730 max_uid
= INSN_UID (insn
);
733 insn_lengths
= (short *) oballoc (max_uid
* sizeof (short));
734 insn_addresses
= (int *) oballoc (max_uid
* sizeof (int));
735 varying_length
= (char *) oballoc (max_uid
* sizeof (char));
737 /* Compute initial lengths, addresses, and varying flags for each insn. */
738 for (insn_current_address
= FIRST_INSN_ADDRESS
, insn
= first
;
740 insn_current_address
+= insn_lengths
[uid
], insn
= NEXT_INSN (insn
))
742 uid
= INSN_UID (insn
);
743 insn_addresses
[uid
] = insn_current_address
;
744 insn_lengths
[uid
] = 0;
745 varying_length
[uid
] = 0;
747 if (GET_CODE (insn
) == NOTE
|| GET_CODE (insn
) == BARRIER
748 || GET_CODE (insn
) == CODE_LABEL
)
750 if (INSN_DELETED_P (insn
))
753 body
= PATTERN (insn
);
754 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
756 /* This only takes room if read-only data goes into the text
758 #if !defined(READONLY_DATA_SECTION) || defined(JUMP_TABLES_IN_TEXT_SECTION)
759 int unitsize
= GET_MODE_SIZE (GET_MODE (body
));
761 insn_lengths
[uid
] = (XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
)
762 * GET_MODE_SIZE (GET_MODE (body
)));
764 /* We don't know what address the ADDR_VEC/ADDR_DIFF_VEC will end
765 up at after branch shortening. As a result, it is impossible
766 to determine how much padding we need at this point. Therefore,
767 assume worst possible alignment. */
768 insn_lengths
[uid
] += unitsize
- 1;
774 else if (asm_noperands (body
) >= 0)
775 insn_lengths
[uid
] = asm_insn_count (body
) * insn_default_length (insn
);
776 else if (GET_CODE (body
) == SEQUENCE
)
779 int const_delay_slots
;
781 const_delay_slots
= const_num_delay_slots (XVECEXP (body
, 0, 0));
783 const_delay_slots
= 0;
785 /* Inside a delay slot sequence, we do not do any branch shortening
786 if the shortening could change the number of delay slots
788 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
790 rtx inner_insn
= XVECEXP (body
, 0, i
);
791 int inner_uid
= INSN_UID (inner_insn
);
794 if (asm_noperands (PATTERN (XVECEXP (body
, 0, i
))) >= 0)
795 inner_length
= (asm_insn_count (PATTERN (inner_insn
))
796 * insn_default_length (inner_insn
));
798 inner_length
= insn_default_length (inner_insn
);
800 insn_lengths
[inner_uid
] = inner_length
;
801 if (const_delay_slots
)
803 if ((varying_length
[inner_uid
]
804 = insn_variable_length_p (inner_insn
)) != 0)
805 varying_length
[uid
] = 1;
806 insn_addresses
[inner_uid
] = (insn_current_address
+
810 varying_length
[inner_uid
] = 0;
811 insn_lengths
[uid
] += inner_length
;
814 else if (GET_CODE (body
) != USE
&& GET_CODE (body
) != CLOBBER
)
816 insn_lengths
[uid
] = insn_default_length (insn
);
817 varying_length
[uid
] = insn_variable_length_p (insn
);
820 /* If needed, do any adjustment. */
821 #ifdef ADJUST_INSN_LENGTH
822 ADJUST_INSN_LENGTH (insn
, insn_lengths
[uid
]);
826 /* Now loop over all the insns finding varying length insns. For each,
827 get the current insn length. If it has changed, reflect the change.
828 When nothing changes for a full pass, we are done. */
830 while (something_changed
)
832 something_changed
= 0;
833 for (insn_current_address
= FIRST_INSN_ADDRESS
, insn
= first
;
835 insn
= NEXT_INSN (insn
))
840 uid
= INSN_UID (insn
);
841 insn_addresses
[uid
] = insn_current_address
;
842 if (! varying_length
[uid
])
844 insn_current_address
+= insn_lengths
[uid
];
847 if (GET_CODE (insn
) == INSN
&& GET_CODE (PATTERN (insn
)) == SEQUENCE
)
851 body
= PATTERN (insn
);
853 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
855 rtx inner_insn
= XVECEXP (body
, 0, i
);
856 int inner_uid
= INSN_UID (inner_insn
);
859 insn_addresses
[inner_uid
] = insn_current_address
;
861 /* insn_current_length returns 0 for insns with a
862 non-varying length. */
863 if (! varying_length
[inner_uid
])
864 inner_length
= insn_lengths
[inner_uid
];
866 inner_length
= insn_current_length (inner_insn
);
868 if (inner_length
!= insn_lengths
[inner_uid
])
870 insn_lengths
[inner_uid
] = inner_length
;
871 something_changed
= 1;
873 insn_current_address
+= insn_lengths
[inner_uid
];
874 new_length
+= inner_length
;
879 new_length
= insn_current_length (insn
);
880 insn_current_address
+= new_length
;
883 #ifdef SHORTEN_WITH_ADJUST_INSN_LENGTH
884 #ifdef ADJUST_INSN_LENGTH
885 /* If needed, do any adjustment. */
886 tmp_length
= new_length
;
887 ADJUST_INSN_LENGTH (insn
, new_length
);
888 insn_current_address
+= (new_length
- tmp_length
);
892 if (new_length
!= insn_lengths
[uid
])
894 insn_lengths
[uid
] = new_length
;
895 something_changed
= 1;
898 /* For a non-optimizing compile, do only a single pass. */
902 #endif /* HAVE_ATTR_length */
905 #ifdef HAVE_ATTR_length
906 /* Given the body of an INSN known to be generated by an ASM statement, return
907 the number of machine instructions likely to be generated for this insn.
908 This is used to compute its length. */
911 asm_insn_count (body
)
917 if (GET_CODE (body
) == ASM_INPUT
)
918 template = XSTR (body
, 0);
920 template = decode_asm_operands (body
, NULL_PTR
, NULL_PTR
,
923 for ( ; *template; template++)
924 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
931 /* Output assembler code for the start of a function,
932 and initialize some of the variables in this file
933 for the new function. The label for the function and associated
934 assembler pseudo-ops have already been output in `assemble_start_function'.
936 FIRST is the first insn of the rtl for the function being compiled.
937 FILE is the file to write assembler code to.
938 OPTIMIZE is nonzero if we should eliminate redundant
939 test and compare insns. */
942 final_start_function (first
, file
, optimize
)
949 this_is_asm_operands
= 0;
951 #ifdef NON_SAVING_SETJMP
952 /* A function that calls setjmp should save and restore all the
953 call-saved registers on a system where longjmp clobbers them. */
954 if (NON_SAVING_SETJMP
&& current_function_calls_setjmp
)
958 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
959 if (!call_used_regs
[i
] && !call_fixed_regs
[i
])
960 regs_ever_live
[i
] = 1;
964 /* Initial line number is supposed to be output
965 before the function's prologue and label
966 so that the function's address will not appear to be
967 in the last statement of the preceding function. */
968 if (NOTE_LINE_NUMBER (first
) != NOTE_INSN_DELETED
)
969 last_linenum
= high_block_linenum
= high_function_linenum
970 = NOTE_LINE_NUMBER (first
);
972 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
973 /* Output DWARF definition of the function. */
974 if (dwarf2out_do_frame ())
975 dwarf2out_begin_prologue ();
978 /* For SDB and XCOFF, the function beginning must be marked between
979 the function label and the prologue. We always need this, even when
980 -g1 was used. Defer on MIPS systems so that parameter descriptions
981 follow function entry. */
982 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
983 if (write_symbols
== SDB_DEBUG
)
984 sdbout_begin_function (last_linenum
);
987 #ifdef XCOFF_DEBUGGING_INFO
988 if (write_symbols
== XCOFF_DEBUG
)
989 xcoffout_begin_function (file
, last_linenum
);
992 /* But only output line number for other debug info types if -g2
994 if (NOTE_LINE_NUMBER (first
) != NOTE_INSN_DELETED
)
995 output_source_line (file
, first
);
997 #ifdef LEAF_REG_REMAP
999 leaf_renumber_regs (first
);
1002 /* The Sun386i and perhaps other machines don't work right
1003 if the profiling code comes after the prologue. */
1004 #ifdef PROFILE_BEFORE_PROLOGUE
1006 profile_function (file
);
1007 #endif /* PROFILE_BEFORE_PROLOGUE */
1009 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1010 if (dwarf2out_do_frame ())
1011 dwarf2out_frame_debug (NULL_RTX
);
1014 #ifdef FUNCTION_PROLOGUE
1015 /* First output the function prologue: code to set up the stack frame. */
1016 FUNCTION_PROLOGUE (file
, get_frame_size ());
1019 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1020 if (write_symbols
== SDB_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1021 next_block_index
= 1;
1024 /* If the machine represents the prologue as RTL, the profiling code must
1025 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1026 #ifdef HAVE_prologue
1027 if (! HAVE_prologue
)
1029 profile_after_prologue (file
);
1033 /* If we are doing basic block profiling, remember a printable version
1034 of the function name. */
1035 if (profile_block_flag
)
1038 = add_bb_string ((*decl_printable_name
) (current_function_decl
, 2), FALSE
);
1043 profile_after_prologue (file
)
1046 #ifdef FUNCTION_BLOCK_PROFILER
1047 if (profile_block_flag
)
1049 FUNCTION_BLOCK_PROFILER (file
, count_basic_blocks
);
1051 #endif /* FUNCTION_BLOCK_PROFILER */
1053 #ifndef PROFILE_BEFORE_PROLOGUE
1055 profile_function (file
);
1056 #endif /* not PROFILE_BEFORE_PROLOGUE */
1060 profile_function (file
)
1063 int align
= MIN (BIGGEST_ALIGNMENT
, LONG_TYPE_SIZE
);
1064 int sval
= current_function_returns_struct
;
1065 int cxt
= current_function_needs_context
;
1068 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
1069 ASM_OUTPUT_INTERNAL_LABEL (file
, "LP", profile_label_no
);
1070 assemble_integer (const0_rtx
, LONG_TYPE_SIZE
/ BITS_PER_UNIT
, 1);
1072 function_section (current_function_decl
);
1074 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1076 ASM_OUTPUT_REG_PUSH (file
, STRUCT_VALUE_INCOMING_REGNUM
);
1078 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1080 ASM_OUTPUT_REG_PUSH (file
, STRUCT_VALUE_REGNUM
);
1084 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1086 ASM_OUTPUT_REG_PUSH (file
, STATIC_CHAIN_INCOMING_REGNUM
);
1088 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1090 ASM_OUTPUT_REG_PUSH (file
, STATIC_CHAIN_REGNUM
);
1094 FUNCTION_PROFILER (file
, profile_label_no
);
1096 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1098 ASM_OUTPUT_REG_POP (file
, STATIC_CHAIN_INCOMING_REGNUM
);
1100 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1102 ASM_OUTPUT_REG_POP (file
, STATIC_CHAIN_REGNUM
);
1106 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1108 ASM_OUTPUT_REG_POP (file
, STRUCT_VALUE_INCOMING_REGNUM
);
1110 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1112 ASM_OUTPUT_REG_POP (file
, STRUCT_VALUE_REGNUM
);
1117 /* Output assembler code for the end of a function.
1118 For clarity, args are same as those of `final_start_function'
1119 even though not all of them are needed. */
1122 final_end_function (first
, file
, optimize
)
1129 fprintf (file
, ASM_APP_OFF
);
1133 #ifdef SDB_DEBUGGING_INFO
1134 if (write_symbols
== SDB_DEBUG
)
1135 sdbout_end_function (high_function_linenum
);
1138 #ifdef DWARF_DEBUGGING_INFO
1139 if (write_symbols
== DWARF_DEBUG
)
1140 dwarfout_end_function ();
1143 #ifdef XCOFF_DEBUGGING_INFO
1144 if (write_symbols
== XCOFF_DEBUG
)
1145 xcoffout_end_function (file
, high_function_linenum
);
1148 #ifdef FUNCTION_EPILOGUE
1149 /* Finally, output the function epilogue:
1150 code to restore the stack frame and return to the caller. */
1151 FUNCTION_EPILOGUE (file
, get_frame_size ());
1154 #ifdef SDB_DEBUGGING_INFO
1155 if (write_symbols
== SDB_DEBUG
)
1156 sdbout_end_epilogue ();
1159 #ifdef DWARF_DEBUGGING_INFO
1160 if (write_symbols
== DWARF_DEBUG
)
1161 dwarfout_end_epilogue ();
1164 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1165 if (dwarf2out_do_frame ())
1166 dwarf2out_end_epilogue ();
1169 #ifdef XCOFF_DEBUGGING_INFO
1170 if (write_symbols
== XCOFF_DEBUG
)
1171 xcoffout_end_epilogue (file
);
1174 bb_func_label_num
= -1; /* not in function, nuke label # */
1176 /* If FUNCTION_EPILOGUE is not defined, then the function body
1177 itself contains return instructions wherever needed. */
1180 /* Add a block to the linked list that remembers the current line/file/function
1181 for basic block profiling. Emit the label in front of the basic block and
1182 the instructions that increment the count field. */
1188 struct bb_list
*ptr
= (struct bb_list
*) permalloc (sizeof (struct bb_list
));
1190 /* Add basic block to linked list. */
1192 ptr
->line_num
= last_linenum
;
1193 ptr
->file_label_num
= bb_file_label_num
;
1194 ptr
->func_label_num
= bb_func_label_num
;
1196 bb_tail
= &ptr
->next
;
1198 /* Enable the table of basic-block use counts
1199 to point at the code it applies to. */
1200 ASM_OUTPUT_INTERNAL_LABEL (file
, "LPB", count_basic_blocks
);
1202 /* Before first insn of this basic block, increment the
1203 count of times it was entered. */
1204 #ifdef BLOCK_PROFILER
1205 BLOCK_PROFILER (file
, count_basic_blocks
);
1212 count_basic_blocks
++;
1215 /* Add a string to be used for basic block profiling. */
1218 add_bb_string (string
, perm_p
)
1223 struct bb_str
*ptr
= 0;
1227 string
= "<unknown>";
1231 /* Allocate a new string if the current string isn't permanent. If
1232 the string is permanent search for the same string in other
1235 len
= strlen (string
) + 1;
1238 char *p
= (char *) permalloc (len
);
1239 bcopy (string
, p
, len
);
1243 for (ptr
= sbb_head
; ptr
!= (struct bb_str
*) 0; ptr
= ptr
->next
)
1244 if (ptr
->string
== string
)
1247 /* Allocate a new string block if we need to. */
1250 ptr
= (struct bb_str
*) permalloc (sizeof (*ptr
));
1253 ptr
->label_num
= sbb_label_num
++;
1254 ptr
->string
= string
;
1256 sbb_tail
= &ptr
->next
;
1259 return ptr
->label_num
;
1263 /* Output assembler code for some insns: all or part of a function.
1264 For description of args, see `final_start_function', above.
1266 PRESCAN is 1 if we are not really outputting,
1267 just scanning as if we were outputting.
1268 Prescanning deletes and rearranges insns just like ordinary output.
1269 PRESCAN is -2 if we are outputting after having prescanned.
1270 In this case, don't try to delete or rearrange insns
1271 because that has already been done.
1272 Prescanning is done only on certain machines. */
1275 final (first
, file
, optimize
, prescan
)
1284 last_ignored_compare
= 0;
1287 check_exception_handler_labels ();
1289 /* Make a map indicating which line numbers appear in this function.
1290 When producing SDB debugging info, delete troublesome line number
1291 notes from inlined functions in other files as well as duplicate
1292 line number notes. */
1293 #ifdef SDB_DEBUGGING_INFO
1294 if (write_symbols
== SDB_DEBUG
)
1297 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1298 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
1300 if ((RTX_INTEGRATED_P (insn
)
1301 && strcmp (NOTE_SOURCE_FILE (insn
), main_input_filename
) != 0)
1303 && NOTE_LINE_NUMBER (insn
) == NOTE_LINE_NUMBER (last
)
1304 && NOTE_SOURCE_FILE (insn
) == NOTE_SOURCE_FILE (last
)))
1306 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
1307 NOTE_SOURCE_FILE (insn
) = 0;
1311 if (NOTE_LINE_NUMBER (insn
) > max_line
)
1312 max_line
= NOTE_LINE_NUMBER (insn
);
1318 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1319 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > max_line
)
1320 max_line
= NOTE_LINE_NUMBER (insn
);
1323 line_note_exists
= (char *) oballoc (max_line
+ 1);
1324 bzero (line_note_exists
, max_line
+ 1);
1326 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1327 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
1328 line_note_exists
[NOTE_LINE_NUMBER (insn
)] = 1;
1334 /* Output the insns. */
1335 for (insn
= NEXT_INSN (first
); insn
;)
1337 #ifdef HAVE_ATTR_length
1338 insn_current_address
= insn_addresses
[INSN_UID (insn
)];
1340 insn
= final_scan_insn (insn
, file
, optimize
, prescan
, 0);
1343 /* Do basic-block profiling here
1344 if the last insn was a conditional branch. */
1345 if (profile_block_flag
&& new_block
)
1349 /* The final scan for one insn, INSN.
1350 Args are same as in `final', except that INSN
1351 is the insn being scanned.
1352 Value returned is the next insn to be scanned.
1354 NOPEEPHOLES is the flag to disallow peephole processing (currently
1355 used for within delayed branch sequence output). */
1358 final_scan_insn (insn
, file
, optimize
, prescan
, nopeepholes
)
1368 /* Ignore deleted insns. These can occur when we split insns (due to a
1369 template of "#") while not optimizing. */
1370 if (INSN_DELETED_P (insn
))
1371 return NEXT_INSN (insn
);
1373 switch (GET_CODE (insn
))
1379 /* Align the beginning of a loop, for higher speed
1380 on certain machines. */
1382 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_LOOP_BEG
&& optimize
> 0)
1384 #ifdef ASM_OUTPUT_LOOP_ALIGN
1385 rtx next
= next_nonnote_insn (insn
);
1386 if (next
&& GET_CODE (next
) == CODE_LABEL
)
1388 ASM_OUTPUT_LOOP_ALIGN (asm_out_file
);
1393 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_LOOP_END
)
1396 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EH_REGION_BEG
)
1398 ASM_OUTPUT_INTERNAL_LABEL (file
, "LEHB", NOTE_BLOCK_NUMBER (insn
));
1399 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn
));
1400 #ifdef ASM_OUTPUT_EH_REGION_BEG
1401 ASM_OUTPUT_EH_REGION_BEG (file
, NOTE_BLOCK_NUMBER (insn
));
1406 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EH_REGION_END
)
1408 ASM_OUTPUT_INTERNAL_LABEL (file
, "LEHE", NOTE_BLOCK_NUMBER (insn
));
1409 #ifdef ASM_OUTPUT_EH_REGION_END
1410 ASM_OUTPUT_EH_REGION_END (file
, NOTE_BLOCK_NUMBER (insn
));
1415 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_PROLOGUE_END
)
1417 #ifdef FUNCTION_END_PROLOGUE
1418 FUNCTION_END_PROLOGUE (file
);
1420 profile_after_prologue (file
);
1424 #ifdef FUNCTION_BEGIN_EPILOGUE
1425 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EPILOGUE_BEG
)
1427 FUNCTION_BEGIN_EPILOGUE (file
);
1432 if (write_symbols
== NO_DEBUG
)
1434 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_FUNCTION_BEG
)
1436 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
1437 /* MIPS stabs require the parameter descriptions to be after the
1438 function entry point rather than before. */
1439 if (write_symbols
== SDB_DEBUG
)
1440 sdbout_begin_function (last_linenum
);
1443 #ifdef DWARF_DEBUGGING_INFO
1444 /* This outputs a marker where the function body starts, so it
1445 must be after the prologue. */
1446 if (write_symbols
== DWARF_DEBUG
)
1447 dwarfout_begin_function ();
1451 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_DELETED
)
1452 break; /* An insn that was "deleted" */
1455 fprintf (file
, ASM_APP_OFF
);
1458 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_BEG
1459 && (debug_info_level
== DINFO_LEVEL_NORMAL
1460 || debug_info_level
== DINFO_LEVEL_VERBOSE
1461 || write_symbols
== DWARF_DEBUG
1462 || write_symbols
== DWARF2_DEBUG
))
1464 /* Beginning of a symbol-block. Assign it a sequence number
1465 and push the number onto the stack PENDING_BLOCKS. */
1467 if (block_depth
== max_block_depth
)
1469 /* PENDING_BLOCKS is full; make it longer. */
1470 max_block_depth
*= 2;
1472 = (int *) xrealloc (pending_blocks
,
1473 max_block_depth
* sizeof (int));
1475 pending_blocks
[block_depth
++] = next_block_index
;
1477 high_block_linenum
= last_linenum
;
1479 /* Output debugging info about the symbol-block beginning. */
1481 #ifdef SDB_DEBUGGING_INFO
1482 if (write_symbols
== SDB_DEBUG
)
1483 sdbout_begin_block (file
, last_linenum
, next_block_index
);
1485 #ifdef XCOFF_DEBUGGING_INFO
1486 if (write_symbols
== XCOFF_DEBUG
)
1487 xcoffout_begin_block (file
, last_linenum
, next_block_index
);
1489 #ifdef DBX_DEBUGGING_INFO
1490 if (write_symbols
== DBX_DEBUG
)
1491 ASM_OUTPUT_INTERNAL_LABEL (file
, "LBB", next_block_index
);
1493 #ifdef DWARF_DEBUGGING_INFO
1494 if (write_symbols
== DWARF_DEBUG
)
1495 dwarfout_begin_block (next_block_index
);
1497 #ifdef DWARF2_DEBUGGING_INFO
1498 if (write_symbols
== DWARF2_DEBUG
)
1499 dwarf2out_begin_block (next_block_index
);
1504 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_END
1505 && (debug_info_level
== DINFO_LEVEL_NORMAL
1506 || debug_info_level
== DINFO_LEVEL_VERBOSE
1507 || write_symbols
== DWARF_DEBUG
1508 || write_symbols
== DWARF2_DEBUG
))
1510 /* End of a symbol-block. Pop its sequence number off
1511 PENDING_BLOCKS and output debugging info based on that. */
1515 #ifdef XCOFF_DEBUGGING_INFO
1516 if (write_symbols
== XCOFF_DEBUG
&& block_depth
>= 0)
1517 xcoffout_end_block (file
, high_block_linenum
,
1518 pending_blocks
[block_depth
]);
1520 #ifdef DBX_DEBUGGING_INFO
1521 if (write_symbols
== DBX_DEBUG
&& block_depth
>= 0)
1522 ASM_OUTPUT_INTERNAL_LABEL (file
, "LBE",
1523 pending_blocks
[block_depth
]);
1525 #ifdef SDB_DEBUGGING_INFO
1526 if (write_symbols
== SDB_DEBUG
&& block_depth
>= 0)
1527 sdbout_end_block (file
, high_block_linenum
,
1528 pending_blocks
[block_depth
]);
1530 #ifdef DWARF_DEBUGGING_INFO
1531 if (write_symbols
== DWARF_DEBUG
&& block_depth
>= 0)
1532 dwarfout_end_block (pending_blocks
[block_depth
]);
1534 #ifdef DWARF2_DEBUGGING_INFO
1535 if (write_symbols
== DWARF2_DEBUG
&& block_depth
>= 0)
1536 dwarf2out_end_block (pending_blocks
[block_depth
]);
1539 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_DELETED_LABEL
1540 && (debug_info_level
== DINFO_LEVEL_NORMAL
1541 || debug_info_level
== DINFO_LEVEL_VERBOSE
))
1543 #ifdef DWARF_DEBUGGING_INFO
1544 if (write_symbols
== DWARF_DEBUG
)
1545 dwarfout_label (insn
);
1547 #ifdef DWARF2_DEBUGGING_INFO
1548 if (write_symbols
== DWARF2_DEBUG
)
1549 dwarf2out_label (insn
);
1552 else if (NOTE_LINE_NUMBER (insn
) > 0)
1553 /* This note is a line-number. */
1557 #if 0 /* This is what we used to do. */
1558 output_source_line (file
, insn
);
1562 /* If there is anything real after this note,
1563 output it. If another line note follows, omit this one. */
1564 for (note
= NEXT_INSN (insn
); note
; note
= NEXT_INSN (note
))
1566 if (GET_CODE (note
) != NOTE
&& GET_CODE (note
) != CODE_LABEL
)
1568 /* These types of notes can be significant
1569 so make sure the preceding line number stays. */
1570 else if (GET_CODE (note
) == NOTE
1571 && (NOTE_LINE_NUMBER (note
) == NOTE_INSN_BLOCK_BEG
1572 || NOTE_LINE_NUMBER (note
) == NOTE_INSN_BLOCK_END
1573 || NOTE_LINE_NUMBER (note
) == NOTE_INSN_FUNCTION_BEG
))
1575 else if (GET_CODE (note
) == NOTE
&& NOTE_LINE_NUMBER (note
) > 0)
1577 /* Another line note follows; we can delete this note
1578 if no intervening line numbers have notes elsewhere. */
1580 for (num
= NOTE_LINE_NUMBER (insn
) + 1;
1581 num
< NOTE_LINE_NUMBER (note
);
1583 if (line_note_exists
[num
])
1586 if (num
>= NOTE_LINE_NUMBER (note
))
1592 /* Output this line note
1593 if it is the first or the last line note in a row. */
1595 output_source_line (file
, insn
);
1600 #ifdef ASM_OUTPUT_ALIGN_CODE
1601 /* Don't litter the assembler output with needless alignments. A
1602 BARRIER will be placed at the end of every function if HAVE_epilogue
1604 if (NEXT_INSN (insn
))
1605 ASM_OUTPUT_ALIGN_CODE (file
);
1607 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
1608 /* If we push arguments, we need to check all insns for stack
1610 if (dwarf2out_do_frame ())
1611 dwarf2out_frame_debug (insn
);
1621 #ifdef FINAL_PRESCAN_LABEL
1622 FINAL_PRESCAN_INSN (insn
, NULL_PTR
, 0);
1625 #ifdef SDB_DEBUGGING_INFO
1626 if (write_symbols
== SDB_DEBUG
&& LABEL_NAME (insn
))
1627 sdbout_label (insn
);
1629 #ifdef DWARF_DEBUGGING_INFO
1630 if (write_symbols
== DWARF_DEBUG
&& LABEL_NAME (insn
))
1631 dwarfout_label (insn
);
1633 #ifdef DWARF2_DEBUGGING_INFO
1634 if (write_symbols
== DWARF2_DEBUG
&& LABEL_NAME (insn
))
1635 dwarf2out_label (insn
);
1639 fprintf (file
, ASM_APP_OFF
);
1642 if (NEXT_INSN (insn
) != 0
1643 && GET_CODE (NEXT_INSN (insn
)) == JUMP_INSN
)
1645 rtx nextbody
= PATTERN (NEXT_INSN (insn
));
1647 /* If this label is followed by a jump-table,
1648 make sure we put the label in the read-only section. Also
1649 possibly write the label and jump table together. */
1651 if (GET_CODE (nextbody
) == ADDR_VEC
1652 || GET_CODE (nextbody
) == ADDR_DIFF_VEC
)
1654 #ifndef JUMP_TABLES_IN_TEXT_SECTION
1655 readonly_data_section ();
1656 #ifdef READONLY_DATA_SECTION
1657 ASM_OUTPUT_ALIGN (file
,
1658 exact_log2 (BIGGEST_ALIGNMENT
1660 #endif /* READONLY_DATA_SECTION */
1661 #else /* JUMP_TABLES_IN_TEXT_SECTION */
1662 function_section (current_function_decl
);
1663 #endif /* JUMP_TABLES_IN_TEXT_SECTION */
1664 #ifdef ASM_OUTPUT_CASE_LABEL
1665 ASM_OUTPUT_CASE_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
),
1668 ASM_OUTPUT_INTERNAL_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
1674 ASM_OUTPUT_INTERNAL_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
1679 register rtx body
= PATTERN (insn
), set
;
1680 int insn_code_number
;
1684 /* An INSN, JUMP_INSN or CALL_INSN.
1685 First check for special kinds that recog doesn't recognize. */
1687 if (GET_CODE (body
) == USE
/* These are just declarations */
1688 || GET_CODE (body
) == CLOBBER
)
1692 /* If there is a REG_CC_SETTER note on this insn, it means that
1693 the setting of the condition code was done in the delay slot
1694 of the insn that branched here. So recover the cc status
1695 from the insn that set it. */
1697 note
= find_reg_note (insn
, REG_CC_SETTER
, NULL_RTX
);
1700 NOTICE_UPDATE_CC (PATTERN (XEXP (note
, 0)), XEXP (note
, 0));
1701 cc_prev_status
= cc_status
;
1705 /* Detect insns that are really jump-tables
1706 and output them as such. */
1708 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
1710 register int vlen
, idx
;
1717 fprintf (file
, ASM_APP_OFF
);
1721 vlen
= XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
);
1722 for (idx
= 0; idx
< vlen
; idx
++)
1724 if (GET_CODE (body
) == ADDR_VEC
)
1726 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
1727 ASM_OUTPUT_ADDR_VEC_ELT
1728 (file
, CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 0, idx
), 0)));
1735 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
1736 ASM_OUTPUT_ADDR_DIFF_ELT
1738 CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 1, idx
), 0)),
1739 CODE_LABEL_NUMBER (XEXP (XEXP (body
, 0), 0)));
1745 #ifdef ASM_OUTPUT_CASE_END
1746 ASM_OUTPUT_CASE_END (file
,
1747 CODE_LABEL_NUMBER (PREV_INSN (insn
)),
1751 function_section (current_function_decl
);
1756 /* Do basic-block profiling when we reach a new block.
1757 Done here to avoid jump tables. */
1758 if (profile_block_flag
&& new_block
)
1761 if (GET_CODE (body
) == ASM_INPUT
)
1763 /* There's no telling what that did to the condition codes. */
1769 fprintf (file
, ASM_APP_ON
);
1772 fprintf (asm_out_file
, "\t%s\n", XSTR (body
, 0));
1776 /* Detect `asm' construct with operands. */
1777 if (asm_noperands (body
) >= 0)
1779 int noperands
= asm_noperands (body
);
1780 rtx
*ops
= (rtx
*) alloca (noperands
* sizeof (rtx
));
1783 /* There's no telling what that did to the condition codes. */
1790 fprintf (file
, ASM_APP_ON
);
1794 /* Get out the operand values. */
1795 string
= decode_asm_operands (body
, ops
, NULL_PTR
,
1796 NULL_PTR
, NULL_PTR
);
1797 /* Inhibit aborts on what would otherwise be compiler bugs. */
1798 insn_noperands
= noperands
;
1799 this_is_asm_operands
= insn
;
1801 /* Output the insn using them. */
1802 output_asm_insn (string
, ops
);
1803 this_is_asm_operands
= 0;
1807 if (prescan
<= 0 && app_on
)
1809 fprintf (file
, ASM_APP_OFF
);
1813 if (GET_CODE (body
) == SEQUENCE
)
1815 /* A delayed-branch sequence */
1821 final_sequence
= body
;
1823 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
1824 force the restoration of a comparison that was previously
1825 thought unnecessary. If that happens, cancel this sequence
1826 and cause that insn to be restored. */
1828 next
= final_scan_insn (XVECEXP (body
, 0, 0), file
, 0, prescan
, 1);
1829 if (next
!= XVECEXP (body
, 0, 1))
1835 for (i
= 1; i
< XVECLEN (body
, 0); i
++)
1837 rtx insn
= XVECEXP (body
, 0, i
);
1838 rtx next
= NEXT_INSN (insn
);
1839 /* We loop in case any instruction in a delay slot gets
1842 insn
= final_scan_insn (insn
, file
, 0, prescan
, 1);
1843 while (insn
!= next
);
1845 #ifdef DBR_OUTPUT_SEQEND
1846 DBR_OUTPUT_SEQEND (file
);
1850 /* If the insn requiring the delay slot was a CALL_INSN, the
1851 insns in the delay slot are actually executed before the
1852 called function. Hence we don't preserve any CC-setting
1853 actions in these insns and the CC must be marked as being
1854 clobbered by the function. */
1855 if (GET_CODE (XVECEXP (body
, 0, 0)) == CALL_INSN
)
1858 /* Following a conditional branch sequence, we have a new basic
1860 if (profile_block_flag
)
1862 rtx insn
= XVECEXP (body
, 0, 0);
1863 rtx body
= PATTERN (insn
);
1865 if ((GET_CODE (insn
) == JUMP_INSN
&& GET_CODE (body
) == SET
1866 && GET_CODE (SET_SRC (body
)) != LABEL_REF
)
1867 || (GET_CODE (insn
) == JUMP_INSN
1868 && GET_CODE (body
) == PARALLEL
1869 && GET_CODE (XVECEXP (body
, 0, 0)) == SET
1870 && GET_CODE (SET_SRC (XVECEXP (body
, 0, 0))) != LABEL_REF
))
1876 /* We have a real machine instruction as rtl. */
1878 body
= PATTERN (insn
);
1881 set
= single_set(insn
);
1883 /* Check for redundant test and compare instructions
1884 (when the condition codes are already set up as desired).
1885 This is done only when optimizing; if not optimizing,
1886 it should be possible for the user to alter a variable
1887 with the debugger in between statements
1888 and the next statement should reexamine the variable
1889 to compute the condition codes. */
1894 rtx set
= single_set(insn
);
1898 && GET_CODE (SET_DEST (set
)) == CC0
1899 && insn
!= last_ignored_compare
)
1901 if (GET_CODE (SET_SRC (set
)) == SUBREG
)
1902 SET_SRC (set
) = alter_subreg (SET_SRC (set
));
1903 else if (GET_CODE (SET_SRC (set
)) == COMPARE
)
1905 if (GET_CODE (XEXP (SET_SRC (set
), 0)) == SUBREG
)
1906 XEXP (SET_SRC (set
), 0)
1907 = alter_subreg (XEXP (SET_SRC (set
), 0));
1908 if (GET_CODE (XEXP (SET_SRC (set
), 1)) == SUBREG
)
1909 XEXP (SET_SRC (set
), 1)
1910 = alter_subreg (XEXP (SET_SRC (set
), 1));
1912 if ((cc_status
.value1
!= 0
1913 && rtx_equal_p (SET_SRC (set
), cc_status
.value1
))
1914 || (cc_status
.value2
!= 0
1915 && rtx_equal_p (SET_SRC (set
), cc_status
.value2
)))
1917 /* Don't delete insn if it has an addressing side-effect. */
1918 if (! FIND_REG_INC_NOTE (insn
, 0)
1919 /* or if anything in it is volatile. */
1920 && ! volatile_refs_p (PATTERN (insn
)))
1922 /* We don't really delete the insn; just ignore it. */
1923 last_ignored_compare
= insn
;
1931 /* Following a conditional branch, we have a new basic block.
1932 But if we are inside a sequence, the new block starts after the
1933 last insn of the sequence. */
1934 if (profile_block_flag
&& final_sequence
== 0
1935 && ((GET_CODE (insn
) == JUMP_INSN
&& GET_CODE (body
) == SET
1936 && GET_CODE (SET_SRC (body
)) != LABEL_REF
)
1937 || (GET_CODE (insn
) == JUMP_INSN
&& GET_CODE (body
) == PARALLEL
1938 && GET_CODE (XVECEXP (body
, 0, 0)) == SET
1939 && GET_CODE (SET_SRC (XVECEXP (body
, 0, 0))) != LABEL_REF
)))
1943 /* Don't bother outputting obvious no-ops, even without -O.
1944 This optimization is fast and doesn't interfere with debugging.
1945 Don't do this if the insn is in a delay slot, since this
1946 will cause an improper number of delay insns to be written. */
1947 if (final_sequence
== 0
1949 && GET_CODE (insn
) == INSN
&& GET_CODE (body
) == SET
1950 && GET_CODE (SET_SRC (body
)) == REG
1951 && GET_CODE (SET_DEST (body
)) == REG
1952 && REGNO (SET_SRC (body
)) == REGNO (SET_DEST (body
)))
1957 /* If this is a conditional branch, maybe modify it
1958 if the cc's are in a nonstandard state
1959 so that it accomplishes the same thing that it would
1960 do straightforwardly if the cc's were set up normally. */
1962 if (cc_status
.flags
!= 0
1963 && GET_CODE (insn
) == JUMP_INSN
1964 && GET_CODE (body
) == SET
1965 && SET_DEST (body
) == pc_rtx
1966 && GET_CODE (SET_SRC (body
)) == IF_THEN_ELSE
1967 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body
), 0))) == '<'
1968 && XEXP (XEXP (SET_SRC (body
), 0), 0) == cc0_rtx
1969 /* This is done during prescan; it is not done again
1970 in final scan when prescan has been done. */
1973 /* This function may alter the contents of its argument
1974 and clear some of the cc_status.flags bits.
1975 It may also return 1 meaning condition now always true
1976 or -1 meaning condition now always false
1977 or 2 meaning condition nontrivial but altered. */
1978 register int result
= alter_cond (XEXP (SET_SRC (body
), 0));
1979 /* If condition now has fixed value, replace the IF_THEN_ELSE
1980 with its then-operand or its else-operand. */
1982 SET_SRC (body
) = XEXP (SET_SRC (body
), 1);
1984 SET_SRC (body
) = XEXP (SET_SRC (body
), 2);
1986 /* The jump is now either unconditional or a no-op.
1987 If it has become a no-op, don't try to output it.
1988 (It would not be recognized.) */
1989 if (SET_SRC (body
) == pc_rtx
)
1991 PUT_CODE (insn
, NOTE
);
1992 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
1993 NOTE_SOURCE_FILE (insn
) = 0;
1996 else if (GET_CODE (SET_SRC (body
)) == RETURN
)
1997 /* Replace (set (pc) (return)) with (return). */
1998 PATTERN (insn
) = body
= SET_SRC (body
);
2000 /* Rerecognize the instruction if it has changed. */
2002 INSN_CODE (insn
) = -1;
2005 /* Make same adjustments to instructions that examine the
2006 condition codes without jumping and instructions that
2007 handle conditional moves (if this machine has either one). */
2009 if (cc_status
.flags
!= 0
2012 rtx cond_rtx
, then_rtx
, else_rtx
;
2014 if (GET_CODE (insn
) != JUMP_INSN
2015 && GET_CODE (SET_SRC (set
)) == IF_THEN_ELSE
)
2017 cond_rtx
= XEXP (SET_SRC (set
), 0);
2018 then_rtx
= XEXP (SET_SRC (set
), 1);
2019 else_rtx
= XEXP (SET_SRC (set
), 2);
2023 cond_rtx
= SET_SRC (set
);
2024 then_rtx
= const_true_rtx
;
2025 else_rtx
= const0_rtx
;
2028 switch (GET_CODE (cond_rtx
))
2041 register int result
;
2042 if (XEXP (cond_rtx
, 0) != cc0_rtx
)
2044 result
= alter_cond (cond_rtx
);
2046 validate_change (insn
, &SET_SRC (set
), then_rtx
, 0);
2047 else if (result
== -1)
2048 validate_change (insn
, &SET_SRC (set
), else_rtx
, 0);
2049 else if (result
== 2)
2050 INSN_CODE (insn
) = -1;
2051 if (SET_DEST (set
) == SET_SRC (set
))
2053 PUT_CODE (insn
, NOTE
);
2054 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
2055 NOTE_SOURCE_FILE (insn
) = 0;
2067 /* Do machine-specific peephole optimizations if desired. */
2069 if (optimize
&& !flag_no_peephole
&& !nopeepholes
)
2071 rtx next
= peephole (insn
);
2072 /* When peepholing, if there were notes within the peephole,
2073 emit them before the peephole. */
2074 if (next
!= 0 && next
!= NEXT_INSN (insn
))
2076 rtx prev
= PREV_INSN (insn
);
2079 for (note
= NEXT_INSN (insn
); note
!= next
;
2080 note
= NEXT_INSN (note
))
2081 final_scan_insn (note
, file
, optimize
, prescan
, nopeepholes
);
2083 /* In case this is prescan, put the notes
2084 in proper position for later rescan. */
2085 note
= NEXT_INSN (insn
);
2086 PREV_INSN (note
) = prev
;
2087 NEXT_INSN (prev
) = note
;
2088 NEXT_INSN (PREV_INSN (next
)) = insn
;
2089 PREV_INSN (insn
) = PREV_INSN (next
);
2090 NEXT_INSN (insn
) = next
;
2091 PREV_INSN (next
) = insn
;
2094 /* PEEPHOLE might have changed this. */
2095 body
= PATTERN (insn
);
2098 /* Try to recognize the instruction.
2099 If successful, verify that the operands satisfy the
2100 constraints for the instruction. Crash if they don't,
2101 since `reload' should have changed them so that they do. */
2103 insn_code_number
= recog_memoized (insn
);
2104 insn_extract (insn
);
2105 for (i
= 0; i
< insn_n_operands
[insn_code_number
]; i
++)
2107 if (GET_CODE (recog_operand
[i
]) == SUBREG
)
2108 recog_operand
[i
] = alter_subreg (recog_operand
[i
]);
2109 else if (GET_CODE (recog_operand
[i
]) == PLUS
2110 || GET_CODE (recog_operand
[i
]) == MULT
)
2111 recog_operand
[i
] = walk_alter_subreg (recog_operand
[i
]);
2114 for (i
= 0; i
< insn_n_dups
[insn_code_number
]; i
++)
2116 if (GET_CODE (*recog_dup_loc
[i
]) == SUBREG
)
2117 *recog_dup_loc
[i
] = alter_subreg (*recog_dup_loc
[i
]);
2118 else if (GET_CODE (*recog_dup_loc
[i
]) == PLUS
2119 || GET_CODE (*recog_dup_loc
[i
]) == MULT
)
2120 *recog_dup_loc
[i
] = walk_alter_subreg (*recog_dup_loc
[i
]);
2123 #ifdef REGISTER_CONSTRAINTS
2124 if (! constrain_operands (insn_code_number
, 1))
2125 fatal_insn_not_found (insn
);
2128 /* Some target machines need to prescan each insn before
2131 #ifdef FINAL_PRESCAN_INSN
2132 FINAL_PRESCAN_INSN (insn
, recog_operand
,
2133 insn_n_operands
[insn_code_number
]);
2137 cc_prev_status
= cc_status
;
2139 /* Update `cc_status' for this instruction.
2140 The instruction's output routine may change it further.
2141 If the output routine for a jump insn needs to depend
2142 on the cc status, it should look at cc_prev_status. */
2144 NOTICE_UPDATE_CC (body
, insn
);
2149 /* If the proper template needs to be chosen by some C code,
2150 run that code and get the real template. */
2152 template = insn_template
[insn_code_number
];
2155 template = (*insn_outfun
[insn_code_number
]) (recog_operand
, insn
);
2157 /* If the C code returns 0, it means that it is a jump insn
2158 which follows a deleted test insn, and that test insn
2159 needs to be reinserted. */
2162 if (prev_nonnote_insn (insn
) != last_ignored_compare
)
2165 return prev_nonnote_insn (insn
);
2169 /* If the template is the string "#", it means that this insn must
2171 if (template[0] == '#' && template[1] == '\0')
2173 rtx
new = try_split (body
, insn
, 0);
2175 /* If we didn't split the insn, go away. */
2176 if (new == insn
&& PATTERN (new) == body
)
2179 #ifdef HAVE_ATTR_length
2180 /* This instruction should have been split in shorten_branches,
2181 to ensure that we would have valid length info for the
2193 /* Output assembler code from the template. */
2195 output_asm_insn (template, recog_operand
);
2197 #if defined (DWARF2_UNWIND_INFO)
2198 #if !defined (ACCUMULATE_OUTGOING_ARGS)
2199 /* If we push arguments, we need to check all insns for stack
2201 if (dwarf2out_do_frame ())
2202 dwarf2out_frame_debug (insn
);
2204 #if defined (HAVE_prologue)
2205 /* If this insn is part of the prologue, emit DWARF v2
2207 if (RTX_FRAME_RELATED_P (insn
) && dwarf2out_do_frame ())
2208 dwarf2out_frame_debug (insn
);
2214 /* It's not at all clear why we did this and doing so interferes
2215 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2218 /* Mark this insn as having been output. */
2219 INSN_DELETED_P (insn
) = 1;
2225 return NEXT_INSN (insn
);
2228 /* Output debugging info to the assembler file FILE
2229 based on the NOTE-insn INSN, assumed to be a line number. */
2232 output_source_line (file
, insn
)
2236 register char *filename
= NOTE_SOURCE_FILE (insn
);
2238 /* Remember filename for basic block profiling.
2239 Filenames are allocated on the permanent obstack
2240 or are passed in ARGV, so we don't have to save
2243 if (profile_block_flag
&& last_filename
!= filename
)
2244 bb_file_label_num
= add_bb_string (filename
, TRUE
);
2246 last_filename
= filename
;
2247 last_linenum
= NOTE_LINE_NUMBER (insn
);
2248 high_block_linenum
= MAX (last_linenum
, high_block_linenum
);
2249 high_function_linenum
= MAX (last_linenum
, high_function_linenum
);
2251 if (write_symbols
!= NO_DEBUG
)
2253 #ifdef SDB_DEBUGGING_INFO
2254 if (write_symbols
== SDB_DEBUG
2255 #if 0 /* People like having line numbers even in wrong file! */
2256 /* COFF can't handle multiple source files--lose, lose. */
2257 && !strcmp (filename
, main_input_filename
)
2259 /* COFF relative line numbers must be positive. */
2260 && last_linenum
> sdb_begin_function_line
)
2262 #ifdef ASM_OUTPUT_SOURCE_LINE
2263 ASM_OUTPUT_SOURCE_LINE (file
, last_linenum
);
2265 fprintf (file
, "\t.ln\t%d\n",
2266 ((sdb_begin_function_line
> -1)
2267 ? last_linenum
- sdb_begin_function_line
: 1));
2272 #if defined (DBX_DEBUGGING_INFO)
2273 if (write_symbols
== DBX_DEBUG
)
2274 dbxout_source_line (file
, filename
, NOTE_LINE_NUMBER (insn
));
2277 #if defined (XCOFF_DEBUGGING_INFO)
2278 if (write_symbols
== XCOFF_DEBUG
)
2279 xcoffout_source_line (file
, filename
, insn
);
2282 #ifdef DWARF_DEBUGGING_INFO
2283 if (write_symbols
== DWARF_DEBUG
)
2284 dwarfout_line (filename
, NOTE_LINE_NUMBER (insn
));
2287 #ifdef DWARF2_DEBUGGING_INFO
2288 if (write_symbols
== DWARF2_DEBUG
)
2289 dwarf2out_line (filename
, NOTE_LINE_NUMBER (insn
));
2294 /* If X is a SUBREG, replace it with a REG or a MEM,
2295 based on the thing it is a subreg of. */
2301 register rtx y
= SUBREG_REG (x
);
2302 if (GET_CODE (y
) == SUBREG
)
2303 y
= alter_subreg (y
);
2305 if (GET_CODE (y
) == REG
)
2307 /* If the containing reg really gets a hard reg, so do we. */
2309 REGNO (x
) = REGNO (y
) + SUBREG_WORD (x
);
2311 else if (GET_CODE (y
) == MEM
)
2313 register int offset
= SUBREG_WORD (x
) * UNITS_PER_WORD
;
2314 if (BYTES_BIG_ENDIAN
)
2315 offset
-= (MIN (UNITS_PER_WORD
, GET_MODE_SIZE (GET_MODE (x
)))
2316 - MIN (UNITS_PER_WORD
, GET_MODE_SIZE (GET_MODE (y
))));
2318 MEM_VOLATILE_P (x
) = MEM_VOLATILE_P (y
);
2319 XEXP (x
, 0) = plus_constant (XEXP (y
, 0), offset
);
2325 /* Do alter_subreg on all the SUBREGs contained in X. */
2328 walk_alter_subreg (x
)
2331 switch (GET_CODE (x
))
2335 XEXP (x
, 0) = walk_alter_subreg (XEXP (x
, 0));
2336 XEXP (x
, 1) = walk_alter_subreg (XEXP (x
, 1));
2340 XEXP (x
, 0) = walk_alter_subreg (XEXP (x
, 0));
2344 return alter_subreg (x
);
2355 /* Given BODY, the body of a jump instruction, alter the jump condition
2356 as required by the bits that are set in cc_status.flags.
2357 Not all of the bits there can be handled at this level in all cases.
2359 The value is normally 0.
2360 1 means that the condition has become always true.
2361 -1 means that the condition has become always false.
2362 2 means that COND has been altered. */
2370 if (cc_status
.flags
& CC_REVERSED
)
2373 PUT_CODE (cond
, swap_condition (GET_CODE (cond
)));
2376 if (cc_status
.flags
& CC_INVERTED
)
2379 PUT_CODE (cond
, reverse_condition (GET_CODE (cond
)));
2382 if (cc_status
.flags
& CC_NOT_POSITIVE
)
2383 switch (GET_CODE (cond
))
2388 /* Jump becomes unconditional. */
2394 /* Jump becomes no-op. */
2398 PUT_CODE (cond
, EQ
);
2403 PUT_CODE (cond
, NE
);
2411 if (cc_status
.flags
& CC_NOT_NEGATIVE
)
2412 switch (GET_CODE (cond
))
2416 /* Jump becomes unconditional. */
2421 /* Jump becomes no-op. */
2426 PUT_CODE (cond
, EQ
);
2432 PUT_CODE (cond
, NE
);
2440 if (cc_status
.flags
& CC_NO_OVERFLOW
)
2441 switch (GET_CODE (cond
))
2444 /* Jump becomes unconditional. */
2448 PUT_CODE (cond
, EQ
);
2453 PUT_CODE (cond
, NE
);
2458 /* Jump becomes no-op. */
2465 if (cc_status
.flags
& (CC_Z_IN_NOT_N
| CC_Z_IN_N
))
2466 switch (GET_CODE (cond
))
2472 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? GE
: LT
);
2477 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? LT
: GE
);
2482 if (cc_status
.flags
& CC_NOT_SIGNED
)
2483 /* The flags are valid if signed condition operators are converted
2485 switch (GET_CODE (cond
))
2488 PUT_CODE (cond
, LEU
);
2493 PUT_CODE (cond
, LTU
);
2498 PUT_CODE (cond
, GTU
);
2503 PUT_CODE (cond
, GEU
);
2515 /* Report inconsistency between the assembler template and the operands.
2516 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
2519 output_operand_lossage (str
)
2522 if (this_is_asm_operands
)
2523 error_for_asm (this_is_asm_operands
, "invalid `asm': %s", str
);
2528 /* Output of assembler code from a template, and its subroutines. */
2530 /* Output text from TEMPLATE to the assembler output file,
2531 obeying %-directions to substitute operands taken from
2532 the vector OPERANDS.
2534 %N (for N a digit) means print operand N in usual manner.
2535 %lN means require operand N to be a CODE_LABEL or LABEL_REF
2536 and print the label name with no punctuation.
2537 %cN means require operand N to be a constant
2538 and print the constant expression with no punctuation.
2539 %aN means expect operand N to be a memory address
2540 (not a memory reference!) and print a reference
2542 %nN means expect operand N to be a constant
2543 and print a constant expression for minus the value
2544 of the operand, with no other punctuation. */
2549 if (flag_print_asm_name
)
2551 /* Annotate the assembly with a comment describing the pattern and
2552 alternative used. */
2555 register int num
= INSN_CODE (debug_insn
);
2556 fprintf (asm_out_file
, " %s %d %s",
2557 ASM_COMMENT_START
, INSN_UID (debug_insn
), insn_name
[num
]);
2558 if (insn_n_alternatives
[num
] > 1)
2559 fprintf (asm_out_file
, "/%d", which_alternative
+ 1);
2561 /* Clear this so only the first assembler insn
2562 of any rtl insn will get the special comment for -dp. */
2569 output_asm_insn (template, operands
)
2576 /* An insn may return a null string template
2577 in a case where no assembler code is needed. */
2582 putc ('\t', asm_out_file
);
2584 #ifdef ASM_OUTPUT_OPCODE
2585 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
2593 putc (c
, asm_out_file
);
2594 #ifdef ASM_OUTPUT_OPCODE
2595 while ((c
= *p
) == '\t')
2597 putc (c
, asm_out_file
);
2600 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
2604 #ifdef ASSEMBLER_DIALECT
2606 /* If we want the first dialect, do nothing. Otherwise, skip
2607 DIALECT_NUMBER of strings ending with '|'. */
2608 for (i
= 0; i
< dialect_number
; i
++)
2610 while (*p
&& *p
++ != '|')
2619 /* Skip to close brace. */
2620 while (*p
&& *p
++ != '}')
2629 /* %% outputs a single %. */
2633 putc (c
, asm_out_file
);
2635 /* %= outputs a number which is unique to each insn in the entire
2636 compilation. This is useful for making local labels that are
2637 referred to more than once in a given insn. */
2641 fprintf (asm_out_file
, "%d", insn_counter
);
2643 /* % followed by a letter and some digits
2644 outputs an operand in a special way depending on the letter.
2645 Letters `acln' are implemented directly.
2646 Other letters are passed to `output_operand' so that
2647 the PRINT_OPERAND macro can define them. */
2648 else if ((*p
>= 'a' && *p
<= 'z')
2649 || (*p
>= 'A' && *p
<= 'Z'))
2654 if (! (*p
>= '0' && *p
<= '9'))
2655 output_operand_lossage ("operand number missing after %-letter");
2656 else if (this_is_asm_operands
&& c
>= (unsigned) insn_noperands
)
2657 output_operand_lossage ("operand number out of range");
2658 else if (letter
== 'l')
2659 output_asm_label (operands
[c
]);
2660 else if (letter
== 'a')
2661 output_address (operands
[c
]);
2662 else if (letter
== 'c')
2664 if (CONSTANT_ADDRESS_P (operands
[c
]))
2665 output_addr_const (asm_out_file
, operands
[c
]);
2667 output_operand (operands
[c
], 'c');
2669 else if (letter
== 'n')
2671 if (GET_CODE (operands
[c
]) == CONST_INT
)
2672 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
,
2673 - INTVAL (operands
[c
]));
2676 putc ('-', asm_out_file
);
2677 output_addr_const (asm_out_file
, operands
[c
]);
2681 output_operand (operands
[c
], letter
);
2683 while ((c
= *p
) >= '0' && c
<= '9') p
++;
2685 /* % followed by a digit outputs an operand the default way. */
2686 else if (*p
>= '0' && *p
<= '9')
2689 if (this_is_asm_operands
&& c
>= (unsigned) insn_noperands
)
2690 output_operand_lossage ("operand number out of range");
2692 output_operand (operands
[c
], 0);
2693 while ((c
= *p
) >= '0' && c
<= '9') p
++;
2695 /* % followed by punctuation: output something for that
2696 punctuation character alone, with no operand.
2697 The PRINT_OPERAND macro decides what is actually done. */
2698 #ifdef PRINT_OPERAND_PUNCT_VALID_P
2699 else if (PRINT_OPERAND_PUNCT_VALID_P (*p
))
2700 output_operand (NULL_RTX
, *p
++);
2703 output_operand_lossage ("invalid %%-code");
2707 putc (c
, asm_out_file
);
2712 putc ('\n', asm_out_file
);
2715 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
2718 output_asm_label (x
)
2723 if (GET_CODE (x
) == LABEL_REF
)
2724 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (XEXP (x
, 0)));
2725 else if (GET_CODE (x
) == CODE_LABEL
)
2726 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
2728 output_operand_lossage ("`%l' operand isn't a label");
2730 assemble_name (asm_out_file
, buf
);
2733 /* Print operand X using machine-dependent assembler syntax.
2734 The macro PRINT_OPERAND is defined just to control this function.
2735 CODE is a non-digit that preceded the operand-number in the % spec,
2736 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
2737 between the % and the digits.
2738 When CODE is a non-letter, X is 0.
2740 The meanings of the letters are machine-dependent and controlled
2741 by PRINT_OPERAND. */
2744 output_operand (x
, code
)
2748 if (x
&& GET_CODE (x
) == SUBREG
)
2749 x
= alter_subreg (x
);
2751 /* If X is a pseudo-register, abort now rather than writing trash to the
2754 if (x
&& GET_CODE (x
) == REG
&& REGNO (x
) >= FIRST_PSEUDO_REGISTER
)
2757 PRINT_OPERAND (asm_out_file
, x
, code
);
2760 /* Print a memory reference operand for address X
2761 using machine-dependent assembler syntax.
2762 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
2768 walk_alter_subreg (x
);
2769 PRINT_OPERAND_ADDRESS (asm_out_file
, x
);
2772 /* Print an integer constant expression in assembler syntax.
2773 Addition and subtraction are the only arithmetic
2774 that may appear in these expressions. */
2777 output_addr_const (file
, x
)
2784 switch (GET_CODE (x
))
2794 assemble_name (file
, XSTR (x
, 0));
2798 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (XEXP (x
, 0)));
2799 assemble_name (file
, buf
);
2803 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
2804 assemble_name (file
, buf
);
2808 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, INTVAL (x
));
2812 /* This used to output parentheses around the expression,
2813 but that does not work on the 386 (either ATT or BSD assembler). */
2814 output_addr_const (file
, XEXP (x
, 0));
2818 if (GET_MODE (x
) == VOIDmode
)
2820 /* We can use %d if the number is one word and positive. */
2821 if (CONST_DOUBLE_HIGH (x
))
2822 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
2823 CONST_DOUBLE_HIGH (x
), CONST_DOUBLE_LOW (x
));
2824 else if (CONST_DOUBLE_LOW (x
) < 0)
2825 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
, CONST_DOUBLE_LOW (x
));
2827 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_DOUBLE_LOW (x
));
2830 /* We can't handle floating point constants;
2831 PRINT_OPERAND must handle them. */
2832 output_operand_lossage ("floating constant misused");
2836 /* Some assemblers need integer constants to appear last (eg masm). */
2837 if (GET_CODE (XEXP (x
, 0)) == CONST_INT
)
2839 output_addr_const (file
, XEXP (x
, 1));
2840 if (INTVAL (XEXP (x
, 0)) >= 0)
2841 fprintf (file
, "+");
2842 output_addr_const (file
, XEXP (x
, 0));
2846 output_addr_const (file
, XEXP (x
, 0));
2847 if (INTVAL (XEXP (x
, 1)) >= 0)
2848 fprintf (file
, "+");
2849 output_addr_const (file
, XEXP (x
, 1));
2854 /* Avoid outputting things like x-x or x+5-x,
2855 since some assemblers can't handle that. */
2856 x
= simplify_subtraction (x
);
2857 if (GET_CODE (x
) != MINUS
)
2860 output_addr_const (file
, XEXP (x
, 0));
2861 fprintf (file
, "-");
2862 if (GET_CODE (XEXP (x
, 1)) == CONST_INT
2863 && INTVAL (XEXP (x
, 1)) < 0)
2865 fprintf (file
, ASM_OPEN_PAREN
);
2866 output_addr_const (file
, XEXP (x
, 1));
2867 fprintf (file
, ASM_CLOSE_PAREN
);
2870 output_addr_const (file
, XEXP (x
, 1));
2875 output_addr_const (file
, XEXP (x
, 0));
2879 output_operand_lossage ("invalid expression as operand");
2883 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
2884 %R prints the value of REGISTER_PREFIX.
2885 %L prints the value of LOCAL_LABEL_PREFIX.
2886 %U prints the value of USER_LABEL_PREFIX.
2887 %I prints the value of IMMEDIATE_PREFIX.
2888 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
2889 Also supported are %d, %x, %s, %e, %f, %g and %%.
2891 We handle alternate assembler dialects here, just like output_asm_insn. */
2894 asm_fprintf
VPROTO((FILE *file
, char *p
, ...))
2905 VA_START (argptr
, p
);
2908 file
= va_arg (argptr
, FILE *);
2909 p
= va_arg (argptr
, char *);
2917 #ifdef ASSEMBLER_DIALECT
2919 /* If we want the first dialect, do nothing. Otherwise, skip
2920 DIALECT_NUMBER of strings ending with '|'. */
2921 for (i
= 0; i
< dialect_number
; i
++)
2923 while (*p
&& *p
++ != '|')
2932 /* Skip to close brace. */
2933 while (*p
&& *p
++ != '}')
2944 while ((c
>= '0' && c
<= '9') || c
== '.')
2952 fprintf (file
, "%%");
2955 case 'd': case 'i': case 'u':
2956 case 'x': case 'p': case 'X':
2960 fprintf (file
, buf
, va_arg (argptr
, int));
2964 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
2965 but we do not check for those cases. It means that the value
2966 is a HOST_WIDE_INT, which may be either `int' or `long'. */
2968 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2970 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
2980 fprintf (file
, buf
, va_arg (argptr
, HOST_WIDE_INT
));
2987 fprintf (file
, buf
, va_arg (argptr
, long));
2995 fprintf (file
, buf
, va_arg (argptr
, double));
3001 fprintf (file
, buf
, va_arg (argptr
, char *));
3005 #ifdef ASM_OUTPUT_OPCODE
3006 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3011 #ifdef REGISTER_PREFIX
3012 fprintf (file
, "%s", REGISTER_PREFIX
);
3017 #ifdef IMMEDIATE_PREFIX
3018 fprintf (file
, "%s", IMMEDIATE_PREFIX
);
3023 #ifdef LOCAL_LABEL_PREFIX
3024 fprintf (file
, "%s", LOCAL_LABEL_PREFIX
);
3029 #ifdef USER_LABEL_PREFIX
3030 fprintf (file
, "%s", USER_LABEL_PREFIX
);
3044 /* Split up a CONST_DOUBLE or integer constant rtx
3045 into two rtx's for single words,
3046 storing in *FIRST the word that comes first in memory in the target
3047 and in *SECOND the other. */
3050 split_double (value
, first
, second
)
3052 rtx
*first
, *second
;
3054 if (GET_CODE (value
) == CONST_INT
)
3056 if (HOST_BITS_PER_WIDE_INT
>= (2 * BITS_PER_WORD
))
3058 /* In this case the CONST_INT holds both target words.
3059 Extract the bits from it into two word-sized pieces. */
3061 HOST_WIDE_INT word_mask
;
3062 /* Avoid warnings for shift count >= BITS_PER_WORD. */
3063 int shift_count
= BITS_PER_WORD
- 1;
3065 word_mask
= (HOST_WIDE_INT
) 1 << shift_count
;
3066 word_mask
|= word_mask
- 1;
3067 low
= GEN_INT (INTVAL (value
) & word_mask
);
3068 high
= GEN_INT ((INTVAL (value
) >> (shift_count
+ 1)) & word_mask
);
3069 if (WORDS_BIG_ENDIAN
)
3082 /* The rule for using CONST_INT for a wider mode
3083 is that we regard the value as signed.
3084 So sign-extend it. */
3085 rtx high
= (INTVAL (value
) < 0 ? constm1_rtx
: const0_rtx
);
3086 if (WORDS_BIG_ENDIAN
)
3098 else if (GET_CODE (value
) != CONST_DOUBLE
)
3100 if (WORDS_BIG_ENDIAN
)
3102 *first
= const0_rtx
;
3108 *second
= const0_rtx
;
3111 else if (GET_MODE (value
) == VOIDmode
3112 /* This is the old way we did CONST_DOUBLE integers. */
3113 || GET_MODE_CLASS (GET_MODE (value
)) == MODE_INT
)
3115 /* In an integer, the words are defined as most and least significant.
3116 So order them by the target's convention. */
3117 if (WORDS_BIG_ENDIAN
)
3119 *first
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3120 *second
= GEN_INT (CONST_DOUBLE_LOW (value
));
3124 *first
= GEN_INT (CONST_DOUBLE_LOW (value
));
3125 *second
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3130 #ifdef REAL_ARITHMETIC
3131 REAL_VALUE_TYPE r
; long l
[2];
3132 REAL_VALUE_FROM_CONST_DOUBLE (r
, value
);
3134 /* Note, this converts the REAL_VALUE_TYPE to the target's
3135 format, splits up the floating point double and outputs
3136 exactly 32 bits of it into each of l[0] and l[1] --
3137 not necessarily BITS_PER_WORD bits. */
3138 REAL_VALUE_TO_TARGET_DOUBLE (r
, l
);
3140 *first
= GEN_INT ((HOST_WIDE_INT
) l
[0]);
3141 *second
= GEN_INT ((HOST_WIDE_INT
) l
[1]);
3143 if ((HOST_FLOAT_FORMAT
!= TARGET_FLOAT_FORMAT
3144 || HOST_BITS_PER_WIDE_INT
!= BITS_PER_WORD
)
3145 && ! flag_pretend_float
)
3149 #ifdef HOST_WORDS_BIG_ENDIAN
3156 /* Host and target agree => no need to swap. */
3157 *first
= GEN_INT (CONST_DOUBLE_LOW (value
));
3158 *second
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3162 *second
= GEN_INT (CONST_DOUBLE_LOW (value
));
3163 *first
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3165 #endif /* no REAL_ARITHMETIC */
3169 /* Return nonzero if this function has no function calls. */
3176 if (profile_flag
|| profile_block_flag
|| profile_arc_flag
)
3179 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3181 if (GET_CODE (insn
) == CALL_INSN
)
3183 if (GET_CODE (insn
) == INSN
3184 && GET_CODE (PATTERN (insn
)) == SEQUENCE
3185 && GET_CODE (XVECEXP (PATTERN (insn
), 0, 0)) == CALL_INSN
)
3188 for (insn
= current_function_epilogue_delay_list
; insn
; insn
= XEXP (insn
, 1))
3190 if (GET_CODE (XEXP (insn
, 0)) == CALL_INSN
)
3192 if (GET_CODE (XEXP (insn
, 0)) == INSN
3193 && GET_CODE (PATTERN (XEXP (insn
, 0))) == SEQUENCE
3194 && GET_CODE (XVECEXP (PATTERN (XEXP (insn
, 0)), 0, 0)) == CALL_INSN
)
3201 /* On some machines, a function with no call insns
3202 can run faster if it doesn't create its own register window.
3203 When output, the leaf function should use only the "output"
3204 registers. Ordinarily, the function would be compiled to use
3205 the "input" registers to find its arguments; it is a candidate
3206 for leaf treatment if it uses only the "input" registers.
3207 Leaf function treatment means renumbering so the function
3208 uses the "output" registers instead. */
3210 #ifdef LEAF_REGISTERS
3212 static char permitted_reg_in_leaf_functions
[] = LEAF_REGISTERS
;
3214 /* Return 1 if this function uses only the registers that can be
3215 safely renumbered. */
3218 only_leaf_regs_used ()
3222 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
3223 if ((regs_ever_live
[i
] || global_regs
[i
])
3224 && ! permitted_reg_in_leaf_functions
[i
])
3227 if (current_function_uses_pic_offset_table
3228 && pic_offset_table_rtx
!= 0
3229 && GET_CODE (pic_offset_table_rtx
) == REG
3230 && ! permitted_reg_in_leaf_functions
[REGNO (pic_offset_table_rtx
)])
3236 /* Scan all instructions and renumber all registers into those
3237 available in leaf functions. */
3240 leaf_renumber_regs (first
)
3245 /* Renumber only the actual patterns.
3246 The reg-notes can contain frame pointer refs,
3247 and renumbering them could crash, and should not be needed. */
3248 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
3249 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3250 leaf_renumber_regs_insn (PATTERN (insn
));
3251 for (insn
= current_function_epilogue_delay_list
; insn
; insn
= XEXP (insn
, 1))
3252 if (GET_RTX_CLASS (GET_CODE (XEXP (insn
, 0))) == 'i')
3253 leaf_renumber_regs_insn (PATTERN (XEXP (insn
, 0)));
3256 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
3257 available in leaf functions. */
3260 leaf_renumber_regs_insn (in_rtx
)
3261 register rtx in_rtx
;
3264 register char *format_ptr
;
3269 /* Renumber all input-registers into output-registers.
3270 renumbered_regs would be 1 for an output-register;
3273 if (GET_CODE (in_rtx
) == REG
)
3277 /* Don't renumber the same reg twice. */
3281 newreg
= REGNO (in_rtx
);
3282 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
3283 to reach here as part of a REG_NOTE. */
3284 if (newreg
>= FIRST_PSEUDO_REGISTER
)
3289 newreg
= LEAF_REG_REMAP (newreg
);
3292 regs_ever_live
[REGNO (in_rtx
)] = 0;
3293 regs_ever_live
[newreg
] = 1;
3294 REGNO (in_rtx
) = newreg
;
3298 if (GET_RTX_CLASS (GET_CODE (in_rtx
)) == 'i')
3300 /* Inside a SEQUENCE, we find insns.
3301 Renumber just the patterns of these insns,
3302 just as we do for the top-level insns. */
3303 leaf_renumber_regs_insn (PATTERN (in_rtx
));
3307 format_ptr
= GET_RTX_FORMAT (GET_CODE (in_rtx
));
3309 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (in_rtx
)); i
++)
3310 switch (*format_ptr
++)
3313 leaf_renumber_regs_insn (XEXP (in_rtx
, i
));
3317 if (NULL
!= XVEC (in_rtx
, i
))
3319 for (j
= 0; j
< XVECLEN (in_rtx
, i
); j
++)
3320 leaf_renumber_regs_insn (XVECEXP (in_rtx
, i
, j
));