1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 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. */
54 #include "insn-config.h"
55 #include "insn-attr.h"
57 #include "conditions.h"
60 #include "hard-reg-set.h"
67 #include "basic-block.h"
69 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
70 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
72 #if defined (USG) || !defined (HAVE_STAB_H)
73 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
78 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
80 #ifdef XCOFF_DEBUGGING_INFO
84 #ifdef DWARF_DEBUGGING_INFO
88 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
89 #include "dwarf2out.h"
92 #ifdef SDB_DEBUGGING_INFO
96 /* .stabd code for line number. */
101 /* .stabs code for included file name. */
106 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
107 null default for it to save conditionalization later. */
108 #ifndef CC_STATUS_INIT
109 #define CC_STATUS_INIT
112 /* How to start an assembler comment. */
113 #ifndef ASM_COMMENT_START
114 #define ASM_COMMENT_START ";#"
117 /* Is the given character a logical line separator for the assembler? */
118 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
119 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
122 #ifndef JUMP_TABLES_IN_TEXT_SECTION
123 #define JUMP_TABLES_IN_TEXT_SECTION 0
126 /* Last insn processed by final_scan_insn. */
127 static rtx debug_insn;
128 rtx current_output_insn;
130 /* Line number of last NOTE. */
131 static int last_linenum;
133 /* Highest line number in current block. */
134 static int high_block_linenum;
136 /* Likewise for function. */
137 static int high_function_linenum;
139 /* Filename of last NOTE. */
140 static const char *last_filename;
142 /* Number of basic blocks seen so far;
143 used if profile_block_flag is set. */
144 static int count_basic_blocks;
146 /* Number of instrumented arcs when profile_arc_flag is set. */
147 extern int count_instrumented_edges;
149 extern int length_unit_log; /* This is defined in insn-attrtab.c. */
151 /* Nonzero while outputting an `asm' with operands.
152 This means that inconsistencies are the user's fault, so don't abort.
153 The precise value is the insn being output, to pass to error_for_asm. */
154 static rtx this_is_asm_operands;
156 /* Number of operands of this insn, for an `asm' with operands. */
157 static unsigned int insn_noperands;
159 /* Compare optimization flag. */
161 static rtx last_ignored_compare = 0;
163 /* Flag indicating this insn is the start of a new basic block. */
165 static int new_block = 1;
167 /* Assign a unique number to each insn that is output.
168 This can be used to generate unique local labels. */
170 static int insn_counter = 0;
173 /* This variable contains machine-dependent flags (defined in tm.h)
174 set and examined by output routines
175 that describe how to interpret the condition codes properly. */
179 /* During output of an insn, this contains a copy of cc_status
180 from before the insn. */
182 CC_STATUS cc_prev_status;
185 /* Indexed by hardware reg number, is 1 if that register is ever
186 used in the current function.
188 In life_analysis, or in stupid_life_analysis, this is set
189 up to record the hard regs used explicitly. Reload adds
190 in the hard regs used for holding pseudo regs. Final uses
191 it to generate the code in the function prologue and epilogue
192 to save and restore registers as needed. */
194 char regs_ever_live[FIRST_PSEUDO_REGISTER];
196 /* Nonzero means current function must be given a frame pointer.
197 Set in stmt.c if anything is allocated on the stack there.
198 Set in reload1.c if anything is allocated on the stack there. */
200 int frame_pointer_needed;
202 /* Assign unique numbers to labels generated for profiling. */
204 int profile_label_no;
206 /* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen. */
208 static int block_depth;
210 /* Nonzero if have enabled APP processing of our assembler output. */
214 /* If we are outputting an insn sequence, this contains the sequence rtx.
219 #ifdef ASSEMBLER_DIALECT
221 /* Number of the assembler dialect to use, starting at 0. */
222 static int dialect_number;
225 /* Indexed by line number, nonzero if there is a note for that line. */
227 static char *line_note_exists;
229 #ifdef HAVE_conditional_execution
230 /* Nonnull if the insn currently being emitted was a COND_EXEC pattern. */
231 rtx current_insn_predicate;
234 /* Linked list to hold line numbers for each basic block. */
238 struct bb_list *next; /* pointer to next basic block */
239 int line_num; /* line number */
240 int file_label_num; /* LPBC<n> label # for stored filename */
241 int func_label_num; /* LPBC<n> label # for stored function name */
244 static struct bb_list *bb_head = 0; /* Head of basic block list */
245 static struct bb_list **bb_tail = &bb_head; /* Ptr to store next bb ptr */
246 static int bb_file_label_num = -1; /* Current label # for file */
247 static int bb_func_label_num = -1; /* Current label # for func */
249 /* Linked list to hold the strings for each file and function name output. */
253 struct bb_str *next; /* pointer to next string */
254 const char *string; /* string */
255 int label_num; /* label number */
256 int length; /* string length */
259 static struct bb_str *sbb_head = 0; /* Head of string list. */
260 static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */
261 static int sbb_label_num = 0; /* Last label used */
263 #ifdef HAVE_ATTR_length
264 static int asm_insn_count PARAMS ((rtx));
266 static void profile_function PARAMS ((FILE *));
267 static void profile_after_prologue PARAMS ((FILE *));
268 static void add_bb PARAMS ((FILE *));
269 static int add_bb_string PARAMS ((const char *, int));
270 static void output_source_line PARAMS ((FILE *, rtx));
271 static rtx walk_alter_subreg PARAMS ((rtx));
272 static void output_asm_name PARAMS ((void));
273 static void output_operand PARAMS ((rtx, int));
274 #ifdef LEAF_REGISTERS
275 static void leaf_renumber_regs PARAMS ((rtx));
278 static int alter_cond PARAMS ((rtx));
280 #ifndef ADDR_VEC_ALIGN
281 static int final_addr_vec_align PARAMS ((rtx));
283 #ifdef HAVE_ATTR_length
284 static int align_fuzz PARAMS ((rtx, rtx, int, unsigned));
287 /* Initialize data in final at the beginning of a compilation. */
290 init_final (filename)
291 const char *filename ATTRIBUTE_UNUSED;
296 #ifdef ASSEMBLER_DIALECT
297 dialect_number = ASSEMBLER_DIALECT;
301 /* Called at end of source file,
302 to output the block-profiling table for this entire compilation. */
306 const char *filename;
310 if (profile_block_flag || profile_arc_flag)
313 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
317 int long_bytes = LONG_TYPE_SIZE / BITS_PER_UNIT;
318 int pointer_bytes = POINTER_SIZE / BITS_PER_UNIT;
320 if (profile_block_flag)
321 size = long_bytes * count_basic_blocks;
323 size = long_bytes * count_instrumented_edges;
326 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
327 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
328 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
332 /* Output the main header, of 11 words:
333 0: 1 if this file is initialized, else 0.
334 1: address of file name (LPBX1).
335 2: address of table of counts (LPBX2).
336 3: number of counts in the table.
337 4: always 0, for compatibility with Sun.
339 The following are GNU extensions:
341 5: address of table of start addrs of basic blocks (LPBX3).
342 6: Number of bytes in this header.
343 7: address of table of function names (LPBX4).
344 8: address of table of line numbers (LPBX5) or 0.
345 9: address of table of file names (LPBX6) or 0.
346 10: space reserved for basic block profiling. */
348 ASM_OUTPUT_ALIGN (asm_out_file, align);
350 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
352 assemble_integer (const0_rtx, long_bytes, 1);
354 /* address of filename */
355 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
356 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
358 /* address of count table */
359 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
360 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
362 /* count of the # of basic blocks or # of instrumented arcs */
363 if (profile_block_flag)
364 assemble_integer (GEN_INT (count_basic_blocks), long_bytes, 1);
366 assemble_integer (GEN_INT (count_instrumented_edges), long_bytes, 1);
368 /* zero word (link field) */
369 assemble_integer (const0_rtx, pointer_bytes, 1);
371 /* address of basic block start address table */
372 if (profile_block_flag)
374 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
375 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
379 assemble_integer (const0_rtx, pointer_bytes, 1);
381 /* byte count for extended structure. */
382 assemble_integer (GEN_INT (11 * UNITS_PER_WORD), long_bytes, 1);
384 /* address of function name table */
385 if (profile_block_flag)
387 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
388 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
392 assemble_integer (const0_rtx, pointer_bytes, 1);
394 /* address of line number and filename tables if debugging. */
395 if (write_symbols != NO_DEBUG && profile_block_flag)
397 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
398 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
400 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
401 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
406 assemble_integer (const0_rtx, pointer_bytes, 1);
407 assemble_integer (const0_rtx, pointer_bytes, 1);
410 /* space for extension ptr (link field) */
411 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
413 /* Output the file name changing the suffix to .d for Sun tcov
415 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
417 char *cwd = getpwd ();
418 int len = strlen (filename) + strlen (cwd) + 1;
419 char *data_file = (char *) alloca (len + 4);
421 strcpy (data_file, cwd);
422 strcat (data_file, "/");
423 strcat (data_file, filename);
424 strip_off_ending (data_file, len);
425 if (profile_block_flag)
426 strcat (data_file, ".d");
428 strcat (data_file, ".da");
429 assemble_string (data_file, strlen (data_file) + 1);
432 /* Make space for the table of counts. */
435 /* Realign data section. */
436 ASM_OUTPUT_ALIGN (asm_out_file, align);
437 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
439 assemble_zeros (size);
443 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
444 #ifdef ASM_OUTPUT_SHARED_LOCAL
445 if (flag_shared_data)
446 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
449 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
450 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name,
451 size, BIGGEST_ALIGNMENT);
453 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
454 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
457 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
462 /* Output any basic block strings */
463 if (profile_block_flag)
465 readonly_data_section ();
468 ASM_OUTPUT_ALIGN (asm_out_file, align);
469 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
471 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC",
473 assemble_string (sptr->string, sptr->length);
478 /* Output the table of addresses. */
479 if (profile_block_flag)
481 /* Realign in new section */
482 ASM_OUTPUT_ALIGN (asm_out_file, align);
483 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
484 for (i = 0; i < count_basic_blocks; i++)
486 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
487 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
492 /* Output the table of function names. */
493 if (profile_block_flag)
495 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
496 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
498 if (ptr->func_label_num >= 0)
500 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
501 ptr->func_label_num);
502 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
506 assemble_integer (const0_rtx, pointer_bytes, 1);
509 for (; i < count_basic_blocks; i++)
510 assemble_integer (const0_rtx, pointer_bytes, 1);
513 if (write_symbols != NO_DEBUG && profile_block_flag)
515 /* Output the table of line numbers. */
516 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
517 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
518 assemble_integer (GEN_INT (ptr->line_num), long_bytes, 1);
520 for (; i < count_basic_blocks; i++)
521 assemble_integer (const0_rtx, long_bytes, 1);
523 /* Output the table of file names. */
524 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
525 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
527 if (ptr->file_label_num >= 0)
529 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
530 ptr->file_label_num);
531 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
535 assemble_integer (const0_rtx, pointer_bytes, 1);
538 for (; i < count_basic_blocks; i++)
539 assemble_integer (const0_rtx, pointer_bytes, 1);
542 /* End with the address of the table of addresses,
543 so we can find it easily, as the last word in the file's text. */
544 if (profile_block_flag)
546 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
547 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
553 /* Enable APP processing of subsequent output.
554 Used before the output from an `asm' statement. */
561 fputs (ASM_APP_ON, asm_out_file);
566 /* Disable APP processing of subsequent output.
567 Called from varasm.c before most kinds of output. */
574 fputs (ASM_APP_OFF, asm_out_file);
579 /* Return the number of slots filled in the current
580 delayed branch sequence (we don't count the insn needing the
581 delay slot). Zero if not in a delayed branch sequence. */
585 dbr_sequence_length ()
587 if (final_sequence != 0)
588 return XVECLEN (final_sequence, 0) - 1;
594 /* The next two pages contain routines used to compute the length of an insn
595 and to shorten branches. */
597 /* Arrays for insn lengths, and addresses. The latter is referenced by
598 `insn_current_length'. */
600 static short *insn_lengths;
602 #ifdef HAVE_ATTR_length
603 varray_type insn_addresses_;
606 /* Max uid for which the above arrays are valid. */
607 static int insn_lengths_max_uid;
609 /* Address of insn being processed. Used by `insn_current_length'. */
610 int insn_current_address;
612 /* Address of insn being processed in previous iteration. */
613 int insn_last_address;
615 /* konwn invariant alignment of insn being processed. */
616 int insn_current_align;
618 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
619 gives the next following alignment insn that increases the known
620 alignment, or NULL_RTX if there is no such insn.
621 For any alignment obtained this way, we can again index uid_align with
622 its uid to obtain the next following align that in turn increases the
623 alignment, till we reach NULL_RTX; the sequence obtained this way
624 for each insn we'll call the alignment chain of this insn in the following
627 struct label_alignment
633 static rtx *uid_align;
634 static int *uid_shuid;
635 static struct label_alignment *label_align;
637 /* Indicate that branch shortening hasn't yet been done. */
656 insn_lengths_max_uid = 0;
658 #ifdef HAVE_ATTR_length
659 INSN_ADDRESSES_FREE ();
668 /* Obtain the current length of an insn. If branch shortening has been done,
669 get its actual length. Otherwise, get its maximum length. */
672 get_attr_length (insn)
673 rtx insn ATTRIBUTE_UNUSED;
675 #ifdef HAVE_ATTR_length
680 if (insn_lengths_max_uid > INSN_UID (insn))
681 return insn_lengths[INSN_UID (insn)];
683 switch (GET_CODE (insn))
691 length = insn_default_length (insn);
695 body = PATTERN (insn);
696 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
698 /* Alignment is machine-dependent and should be handled by
702 length = insn_default_length (insn);
706 body = PATTERN (insn);
707 if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
710 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
711 length = asm_insn_count (body) * insn_default_length (insn);
712 else if (GET_CODE (body) == SEQUENCE)
713 for (i = 0; i < XVECLEN (body, 0); i++)
714 length += get_attr_length (XVECEXP (body, 0, i));
716 length = insn_default_length (insn);
723 #ifdef ADJUST_INSN_LENGTH
724 ADJUST_INSN_LENGTH (insn, length);
727 #else /* not HAVE_ATTR_length */
729 #endif /* not HAVE_ATTR_length */
732 /* Code to handle alignment inside shorten_branches. */
734 /* Here is an explanation how the algorithm in align_fuzz can give
737 Call a sequence of instructions beginning with alignment point X
738 and continuing until the next alignment point `block X'. When `X'
739 is used in an expression, it means the alignment value of the
742 Call the distance between the start of the first insn of block X, and
743 the end of the last insn of block X `IX', for the `inner size of X'.
744 This is clearly the sum of the instruction lengths.
746 Likewise with the next alignment-delimited block following X, which we
749 Call the distance between the start of the first insn of block X, and
750 the start of the first insn of block Y `OX', for the `outer size of X'.
752 The estimated padding is then OX - IX.
754 OX can be safely estimated as
759 OX = round_up(IX, X) + Y - X
761 Clearly est(IX) >= real(IX), because that only depends on the
762 instruction lengths, and those being overestimated is a given.
764 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
765 we needn't worry about that when thinking about OX.
767 When X >= Y, the alignment provided by Y adds no uncertainty factor
768 for branch ranges starting before X, so we can just round what we have.
769 But when X < Y, we don't know anything about the, so to speak,
770 `middle bits', so we have to assume the worst when aligning up from an
771 address mod X to one mod Y, which is Y - X. */
774 #define LABEL_ALIGN(LABEL) align_labels_log
777 #ifndef LABEL_ALIGN_MAX_SKIP
778 #define LABEL_ALIGN_MAX_SKIP (align_labels-1)
782 #define LOOP_ALIGN(LABEL) align_loops_log
785 #ifndef LOOP_ALIGN_MAX_SKIP
786 #define LOOP_ALIGN_MAX_SKIP (align_loops-1)
789 #ifndef LABEL_ALIGN_AFTER_BARRIER
790 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) align_jumps_log
793 #ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
794 #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP (align_jumps-1)
797 #ifndef ADDR_VEC_ALIGN
799 final_addr_vec_align (addr_vec)
802 int align = GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec)));
804 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
805 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
806 return exact_log2 (align);
810 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
813 #ifndef INSN_LENGTH_ALIGNMENT
814 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
817 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
819 static int min_labelno, max_labelno;
821 #define LABEL_TO_ALIGNMENT(LABEL) \
822 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
824 #define LABEL_TO_MAX_SKIP(LABEL) \
825 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
827 /* For the benefit of port specific code do this also as a function. */
830 label_to_alignment (label)
833 return LABEL_TO_ALIGNMENT (label);
836 #ifdef HAVE_ATTR_length
837 /* The differences in addresses
838 between a branch and its target might grow or shrink depending on
839 the alignment the start insn of the range (the branch for a forward
840 branch or the label for a backward branch) starts out on; if these
841 differences are used naively, they can even oscillate infinitely.
842 We therefore want to compute a 'worst case' address difference that
843 is independent of the alignment the start insn of the range end
844 up on, and that is at least as large as the actual difference.
845 The function align_fuzz calculates the amount we have to add to the
846 naively computed difference, by traversing the part of the alignment
847 chain of the start insn of the range that is in front of the end insn
848 of the range, and considering for each alignment the maximum amount
849 that it might contribute to a size increase.
851 For casesi tables, we also want to know worst case minimum amounts of
852 address difference, in case a machine description wants to introduce
853 some common offset that is added to all offsets in a table.
854 For this purpose, align_fuzz with a growth argument of 0 comuptes the
855 appropriate adjustment. */
857 /* Compute the maximum delta by which the difference of the addresses of
858 START and END might grow / shrink due to a different address for start
859 which changes the size of alignment insns between START and END.
860 KNOWN_ALIGN_LOG is the alignment known for START.
861 GROWTH should be ~0 if the objective is to compute potential code size
862 increase, and 0 if the objective is to compute potential shrink.
863 The return value is undefined for any other value of GROWTH. */
866 align_fuzz (start, end, known_align_log, growth)
871 int uid = INSN_UID (start);
873 int known_align = 1 << known_align_log;
874 int end_shuid = INSN_SHUID (end);
877 for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
879 int align_addr, new_align;
881 uid = INSN_UID (align_label);
882 align_addr = INSN_ADDRESSES (uid) - insn_lengths[uid];
883 if (uid_shuid[uid] > end_shuid)
885 known_align_log = LABEL_TO_ALIGNMENT (align_label);
886 new_align = 1 << known_align_log;
887 if (new_align < known_align)
889 fuzz += (-align_addr ^ growth) & (new_align - known_align);
890 known_align = new_align;
895 /* Compute a worst-case reference address of a branch so that it
896 can be safely used in the presence of aligned labels. Since the
897 size of the branch itself is unknown, the size of the branch is
898 not included in the range. I.e. for a forward branch, the reference
899 address is the end address of the branch as known from the previous
900 branch shortening pass, minus a value to account for possible size
901 increase due to alignment. For a backward branch, it is the start
902 address of the branch as known from the current pass, plus a value
903 to account for possible size increase due to alignment.
904 NB.: Therefore, the maximum offset allowed for backward branches needs
905 to exclude the branch size. */
908 insn_current_reference_address (branch)
914 if (! INSN_ADDRESSES_SET_P ())
917 seq = NEXT_INSN (PREV_INSN (branch));
918 seq_uid = INSN_UID (seq);
919 if (GET_CODE (branch) != JUMP_INSN)
920 /* This can happen for example on the PA; the objective is to know the
921 offset to address something in front of the start of the function.
922 Thus, we can treat it like a backward branch.
923 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
924 any alignment we'd encounter, so we skip the call to align_fuzz. */
925 return insn_current_address;
926 dest = JUMP_LABEL (branch);
928 /* BRANCH has no proper alignment chain set, so use SEQ.
929 BRANCH also has no INSN_SHUID. */
930 if (INSN_SHUID (seq) < INSN_SHUID (dest))
932 /* Forward branch. */
933 return (insn_last_address + insn_lengths[seq_uid]
934 - align_fuzz (seq, dest, length_unit_log, ~0));
938 /* Backward branch. */
939 return (insn_current_address
940 + align_fuzz (dest, seq, length_unit_log, ~0));
943 #endif /* HAVE_ATTR_length */
945 /* Make a pass over all insns and compute their actual lengths by shortening
946 any branches of variable length if possible. */
948 /* Give a default value for the lowest address in a function. */
950 #ifndef FIRST_INSN_ADDRESS
951 #define FIRST_INSN_ADDRESS 0
954 /* shorten_branches might be called multiple times: for example, the SH
955 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
956 In order to do this, it needs proper length information, which it obtains
957 by calling shorten_branches. This cannot be collapsed with
958 shorten_branches itself into a single pass unless we also want to intergate
959 reorg.c, since the branch splitting exposes new instructions with delay
963 shorten_branches (first)
964 rtx first ATTRIBUTE_UNUSED;
971 #ifdef HAVE_ATTR_length
972 #define MAX_CODE_ALIGN 16
974 int something_changed = 1;
975 char *varying_length;
978 rtx align_tab[MAX_CODE_ALIGN];
980 /* In order to make sure that all instructions have valid length info,
981 we must split them before we compute the address/length info. */
983 for (insn = NEXT_INSN (first); insn; insn = NEXT_INSN (insn))
987 /* Don't split the insn if it has been deleted. */
988 if (! INSN_DELETED_P (old))
989 insn = try_split (PATTERN (old), old, 1);
990 /* When not optimizing, the old insn will be still left around
991 with only the 'deleted' bit set. Transform it into a note
992 to avoid confusion of subsequent processing. */
993 if (INSN_DELETED_P (old))
995 PUT_CODE (old, NOTE);
996 NOTE_LINE_NUMBER (old) = NOTE_INSN_DELETED;
997 NOTE_SOURCE_FILE (old) = 0;
1002 /* We must do some computations even when not actually shortening, in
1003 order to get the alignment information for the labels. */
1005 init_insn_lengths ();
1007 /* Compute maximum UID and allocate label_align / uid_shuid. */
1008 max_uid = get_max_uid ();
1010 max_labelno = max_label_num ();
1011 min_labelno = get_first_label_num ();
1012 label_align = (struct label_alignment *)
1013 xcalloc ((max_labelno - min_labelno + 1), sizeof (struct label_alignment));
1015 uid_shuid = (int *) xmalloc (max_uid * sizeof *uid_shuid);
1017 /* Initialize label_align and set up uid_shuid to be strictly
1018 monotonically rising with insn order. */
1019 /* We use max_log here to keep track of the maximum alignment we want to
1020 impose on the next CODE_LABEL (or the current one if we are processing
1021 the CODE_LABEL itself). */
1026 for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
1030 INSN_SHUID (insn) = i++;
1033 /* reorg might make the first insn of a loop being run once only,
1034 and delete the label in front of it. Then we want to apply
1035 the loop alignment to the new label created by reorg, which
1036 is separated by the former loop start insn from the
1037 NOTE_INSN_LOOP_BEG. */
1039 else if (GET_CODE (insn) == CODE_LABEL)
1043 log = LABEL_ALIGN (insn);
1047 max_skip = LABEL_ALIGN_MAX_SKIP;
1049 next = NEXT_INSN (insn);
1050 /* ADDR_VECs only take room if read-only data goes into the text
1052 if (JUMP_TABLES_IN_TEXT_SECTION
1053 #if !defined(READONLY_DATA_SECTION)
1057 if (next && GET_CODE (next) == JUMP_INSN)
1059 rtx nextbody = PATTERN (next);
1060 if (GET_CODE (nextbody) == ADDR_VEC
1061 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1063 log = ADDR_VEC_ALIGN (next);
1067 max_skip = LABEL_ALIGN_MAX_SKIP;
1071 LABEL_TO_ALIGNMENT (insn) = max_log;
1072 LABEL_TO_MAX_SKIP (insn) = max_skip;
1076 else if (GET_CODE (insn) == BARRIER)
1080 for (label = insn; label && ! INSN_P (label);
1081 label = NEXT_INSN (label))
1082 if (GET_CODE (label) == CODE_LABEL)
1084 log = LABEL_ALIGN_AFTER_BARRIER (insn);
1088 max_skip = LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP;
1093 /* Again, we allow NOTE_INSN_LOOP_BEG - INSN - CODE_LABEL
1094 sequences in order to handle reorg output efficiently. */
1095 else if (GET_CODE (insn) == NOTE
1096 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
1101 /* Search for the label that starts the loop.
1102 Don't skip past the end of the loop, since that could
1103 lead to putting an alignment where it does not belong.
1104 However, a label after a nested (non-)loop would be OK. */
1105 for (label = insn; label; label = NEXT_INSN (label))
1107 if (GET_CODE (label) == NOTE
1108 && NOTE_LINE_NUMBER (label) == NOTE_INSN_LOOP_BEG)
1110 else if (GET_CODE (label) == NOTE
1111 && NOTE_LINE_NUMBER (label) == NOTE_INSN_LOOP_END
1114 else if (GET_CODE (label) == CODE_LABEL)
1116 log = LOOP_ALIGN (label);
1120 max_skip = LOOP_ALIGN_MAX_SKIP;
1129 #ifdef HAVE_ATTR_length
1131 /* Allocate the rest of the arrays. */
1132 insn_lengths = (short *) xmalloc (max_uid * sizeof (short));
1133 insn_lengths_max_uid = max_uid;
1134 /* Syntax errors can lead to labels being outside of the main insn stream.
1135 Initialize insn_addresses, so that we get reproducible results. */
1136 INSN_ADDRESSES_ALLOC (max_uid);
1138 varying_length = (char *) xcalloc (max_uid, sizeof (char));
1140 /* Initialize uid_align. We scan instructions
1141 from end to start, and keep in align_tab[n] the last seen insn
1142 that does an alignment of at least n+1, i.e. the successor
1143 in the alignment chain for an insn that does / has a known
1145 uid_align = (rtx *) xcalloc (max_uid, sizeof *uid_align);
1147 for (i = MAX_CODE_ALIGN; --i >= 0;)
1148 align_tab[i] = NULL_RTX;
1149 seq = get_last_insn ();
1150 for (; seq; seq = PREV_INSN (seq))
1152 int uid = INSN_UID (seq);
1154 log = (GET_CODE (seq) == CODE_LABEL ? LABEL_TO_ALIGNMENT (seq) : 0);
1155 uid_align[uid] = align_tab[0];
1158 /* Found an alignment label. */
1159 uid_align[uid] = align_tab[log];
1160 for (i = log - 1; i >= 0; i--)
1164 #ifdef CASE_VECTOR_SHORTEN_MODE
1167 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1170 int min_shuid = INSN_SHUID (get_insns ()) - 1;
1171 int max_shuid = INSN_SHUID (get_last_insn ()) + 1;
1174 for (insn = first; insn != 0; insn = NEXT_INSN (insn))
1176 rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat;
1177 int len, i, min, max, insn_shuid;
1179 addr_diff_vec_flags flags;
1181 if (GET_CODE (insn) != JUMP_INSN
1182 || GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)
1184 pat = PATTERN (insn);
1185 len = XVECLEN (pat, 1);
1188 min_align = MAX_CODE_ALIGN;
1189 for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
1191 rtx lab = XEXP (XVECEXP (pat, 1, i), 0);
1192 int shuid = INSN_SHUID (lab);
1203 if (min_align > LABEL_TO_ALIGNMENT (lab))
1204 min_align = LABEL_TO_ALIGNMENT (lab);
1206 XEXP (pat, 2) = gen_rtx_LABEL_REF (VOIDmode, min_lab);
1207 XEXP (pat, 3) = gen_rtx_LABEL_REF (VOIDmode, max_lab);
1208 insn_shuid = INSN_SHUID (insn);
1209 rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0));
1210 flags.min_align = min_align;
1211 flags.base_after_vec = rel > insn_shuid;
1212 flags.min_after_vec = min > insn_shuid;
1213 flags.max_after_vec = max > insn_shuid;
1214 flags.min_after_base = min > rel;
1215 flags.max_after_base = max > rel;
1216 ADDR_DIFF_VEC_FLAGS (pat) = flags;
1219 #endif /* CASE_VECTOR_SHORTEN_MODE */
1221 /* Compute initial lengths, addresses, and varying flags for each insn. */
1222 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1224 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1226 uid = INSN_UID (insn);
1228 insn_lengths[uid] = 0;
1230 if (GET_CODE (insn) == CODE_LABEL)
1232 int log = LABEL_TO_ALIGNMENT (insn);
1235 int align = 1 << log;
1236 int new_address = (insn_current_address + align - 1) & -align;
1237 insn_lengths[uid] = new_address - insn_current_address;
1241 INSN_ADDRESSES (uid) = insn_current_address;
1243 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
1244 || GET_CODE (insn) == CODE_LABEL)
1246 if (INSN_DELETED_P (insn))
1249 body = PATTERN (insn);
1250 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1252 /* This only takes room if read-only data goes into the text
1254 if (JUMP_TABLES_IN_TEXT_SECTION
1255 #if !defined(READONLY_DATA_SECTION)
1259 insn_lengths[uid] = (XVECLEN (body,
1260 GET_CODE (body) == ADDR_DIFF_VEC)
1261 * GET_MODE_SIZE (GET_MODE (body)));
1262 /* Alignment is handled by ADDR_VEC_ALIGN. */
1264 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
1265 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
1266 else if (GET_CODE (body) == SEQUENCE)
1269 int const_delay_slots;
1271 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
1273 const_delay_slots = 0;
1275 /* Inside a delay slot sequence, we do not do any branch shortening
1276 if the shortening could change the number of delay slots
1278 for (i = 0; i < XVECLEN (body, 0); i++)
1280 rtx inner_insn = XVECEXP (body, 0, i);
1281 int inner_uid = INSN_UID (inner_insn);
1284 if (GET_CODE (body) == ASM_INPUT
1285 || asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
1286 inner_length = (asm_insn_count (PATTERN (inner_insn))
1287 * insn_default_length (inner_insn));
1289 inner_length = insn_default_length (inner_insn);
1291 insn_lengths[inner_uid] = inner_length;
1292 if (const_delay_slots)
1294 if ((varying_length[inner_uid]
1295 = insn_variable_length_p (inner_insn)) != 0)
1296 varying_length[uid] = 1;
1297 INSN_ADDRESSES (inner_uid) = (insn_current_address
1298 + insn_lengths[uid]);
1301 varying_length[inner_uid] = 0;
1302 insn_lengths[uid] += inner_length;
1305 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
1307 insn_lengths[uid] = insn_default_length (insn);
1308 varying_length[uid] = insn_variable_length_p (insn);
1311 /* If needed, do any adjustment. */
1312 #ifdef ADJUST_INSN_LENGTH
1313 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
1314 if (insn_lengths[uid] < 0)
1315 fatal_insn ("Negative insn length", insn);
1319 /* Now loop over all the insns finding varying length insns. For each,
1320 get the current insn length. If it has changed, reflect the change.
1321 When nothing changes for a full pass, we are done. */
1323 while (something_changed)
1325 something_changed = 0;
1326 insn_current_align = MAX_CODE_ALIGN - 1;
1327 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1329 insn = NEXT_INSN (insn))
1332 #ifdef ADJUST_INSN_LENGTH
1337 uid = INSN_UID (insn);
1339 if (GET_CODE (insn) == CODE_LABEL)
1341 int log = LABEL_TO_ALIGNMENT (insn);
1342 if (log > insn_current_align)
1344 int align = 1 << log;
1345 int new_address= (insn_current_address + align - 1) & -align;
1346 insn_lengths[uid] = new_address - insn_current_address;
1347 insn_current_align = log;
1348 insn_current_address = new_address;
1351 insn_lengths[uid] = 0;
1352 INSN_ADDRESSES (uid) = insn_current_address;
1356 length_align = INSN_LENGTH_ALIGNMENT (insn);
1357 if (length_align < insn_current_align)
1358 insn_current_align = length_align;
1360 insn_last_address = INSN_ADDRESSES (uid);
1361 INSN_ADDRESSES (uid) = insn_current_address;
1363 #ifdef CASE_VECTOR_SHORTEN_MODE
1364 if (optimize && GET_CODE (insn) == JUMP_INSN
1365 && GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
1367 rtx body = PATTERN (insn);
1368 int old_length = insn_lengths[uid];
1369 rtx rel_lab = XEXP (XEXP (body, 0), 0);
1370 rtx min_lab = XEXP (XEXP (body, 2), 0);
1371 rtx max_lab = XEXP (XEXP (body, 3), 0);
1372 addr_diff_vec_flags flags = ADDR_DIFF_VEC_FLAGS (body);
1373 int rel_addr = INSN_ADDRESSES (INSN_UID (rel_lab));
1374 int min_addr = INSN_ADDRESSES (INSN_UID (min_lab));
1375 int max_addr = INSN_ADDRESSES (INSN_UID (max_lab));
1379 /* Try to find a known alignment for rel_lab. */
1380 for (prev = rel_lab;
1382 && ! insn_lengths[INSN_UID (prev)]
1383 && ! (varying_length[INSN_UID (prev)] & 1);
1384 prev = PREV_INSN (prev))
1385 if (varying_length[INSN_UID (prev)] & 2)
1387 rel_align = LABEL_TO_ALIGNMENT (prev);
1391 /* See the comment on addr_diff_vec_flags in rtl.h for the
1392 meaning of the flags values. base: REL_LAB vec: INSN */
1393 /* Anything after INSN has still addresses from the last
1394 pass; adjust these so that they reflect our current
1395 estimate for this pass. */
1396 if (flags.base_after_vec)
1397 rel_addr += insn_current_address - insn_last_address;
1398 if (flags.min_after_vec)
1399 min_addr += insn_current_address - insn_last_address;
1400 if (flags.max_after_vec)
1401 max_addr += insn_current_address - insn_last_address;
1402 /* We want to know the worst case, i.e. lowest possible value
1403 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1404 its offset is positive, and we have to be wary of code shrink;
1405 otherwise, it is negative, and we have to be vary of code
1407 if (flags.min_after_base)
1409 /* If INSN is between REL_LAB and MIN_LAB, the size
1410 changes we are about to make can change the alignment
1411 within the observed offset, therefore we have to break
1412 it up into two parts that are independent. */
1413 if (! flags.base_after_vec && flags.min_after_vec)
1415 min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
1416 min_addr -= align_fuzz (insn, min_lab, 0, 0);
1419 min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
1423 if (flags.base_after_vec && ! flags.min_after_vec)
1425 min_addr -= align_fuzz (min_lab, insn, 0, ~0);
1426 min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
1429 min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
1431 /* Likewise, determine the highest lowest possible value
1432 for the offset of MAX_LAB. */
1433 if (flags.max_after_base)
1435 if (! flags.base_after_vec && flags.max_after_vec)
1437 max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
1438 max_addr += align_fuzz (insn, max_lab, 0, ~0);
1441 max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
1445 if (flags.base_after_vec && ! flags.max_after_vec)
1447 max_addr += align_fuzz (max_lab, insn, 0, 0);
1448 max_addr += align_fuzz (insn, rel_lab, 0, 0);
1451 max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
1453 PUT_MODE (body, CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
1454 max_addr - rel_addr,
1456 if (JUMP_TABLES_IN_TEXT_SECTION
1457 #if !defined(READONLY_DATA_SECTION)
1463 = (XVECLEN (body, 1) * GET_MODE_SIZE (GET_MODE (body)));
1464 insn_current_address += insn_lengths[uid];
1465 if (insn_lengths[uid] != old_length)
1466 something_changed = 1;
1471 #endif /* CASE_VECTOR_SHORTEN_MODE */
1473 if (! (varying_length[uid]))
1475 insn_current_address += insn_lengths[uid];
1478 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
1482 body = PATTERN (insn);
1484 for (i = 0; i < XVECLEN (body, 0); i++)
1486 rtx inner_insn = XVECEXP (body, 0, i);
1487 int inner_uid = INSN_UID (inner_insn);
1490 INSN_ADDRESSES (inner_uid) = insn_current_address;
1492 /* insn_current_length returns 0 for insns with a
1493 non-varying length. */
1494 if (! varying_length[inner_uid])
1495 inner_length = insn_lengths[inner_uid];
1497 inner_length = insn_current_length (inner_insn);
1499 if (inner_length != insn_lengths[inner_uid])
1501 insn_lengths[inner_uid] = inner_length;
1502 something_changed = 1;
1504 insn_current_address += insn_lengths[inner_uid];
1505 new_length += inner_length;
1510 new_length = insn_current_length (insn);
1511 insn_current_address += new_length;
1514 #ifdef ADJUST_INSN_LENGTH
1515 /* If needed, do any adjustment. */
1516 tmp_length = new_length;
1517 ADJUST_INSN_LENGTH (insn, new_length);
1518 insn_current_address += (new_length - tmp_length);
1521 if (new_length != insn_lengths[uid])
1523 insn_lengths[uid] = new_length;
1524 something_changed = 1;
1527 /* For a non-optimizing compile, do only a single pass. */
1532 free (varying_length);
1534 #endif /* HAVE_ATTR_length */
1537 #ifdef HAVE_ATTR_length
1538 /* Given the body of an INSN known to be generated by an ASM statement, return
1539 the number of machine instructions likely to be generated for this insn.
1540 This is used to compute its length. */
1543 asm_insn_count (body)
1546 const char *template;
1549 if (GET_CODE (body) == ASM_INPUT)
1550 template = XSTR (body, 0);
1552 template = decode_asm_operands (body, NULL_PTR, NULL_PTR,
1553 NULL_PTR, NULL_PTR);
1555 for (; *template; template++)
1556 if (IS_ASM_LOGICAL_LINE_SEPARATOR (*template) || *template == '\n')
1563 /* Output assembler code for the start of a function,
1564 and initialize some of the variables in this file
1565 for the new function. The label for the function and associated
1566 assembler pseudo-ops have already been output in `assemble_start_function'.
1568 FIRST is the first insn of the rtl for the function being compiled.
1569 FILE is the file to write assembler code to.
1570 OPTIMIZE is nonzero if we should eliminate redundant
1571 test and compare insns. */
1574 final_start_function (first, file, optimize)
1577 int optimize ATTRIBUTE_UNUSED;
1581 this_is_asm_operands = 0;
1583 #ifdef NON_SAVING_SETJMP
1584 /* A function that calls setjmp should save and restore all the
1585 call-saved registers on a system where longjmp clobbers them. */
1586 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
1590 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1591 if (!call_used_regs[i])
1592 regs_ever_live[i] = 1;
1596 /* Initial line number is supposed to be output
1597 before the function's prologue and label
1598 so that the function's address will not appear to be
1599 in the last statement of the preceding function. */
1600 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1601 last_linenum = high_block_linenum = high_function_linenum
1602 = NOTE_LINE_NUMBER (first);
1604 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1605 /* Output DWARF definition of the function. */
1606 if (dwarf2out_do_frame ())
1607 dwarf2out_begin_prologue ();
1609 current_function_func_begin_label = 0;
1612 /* For SDB and XCOFF, the function beginning must be marked between
1613 the function label and the prologue. We always need this, even when
1614 -g1 was used. Defer on MIPS systems so that parameter descriptions
1615 follow function entry. */
1616 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
1617 if (write_symbols == SDB_DEBUG)
1618 sdbout_begin_function (last_linenum);
1621 #ifdef XCOFF_DEBUGGING_INFO
1622 if (write_symbols == XCOFF_DEBUG)
1623 xcoffout_begin_function (file, last_linenum);
1626 /* But only output line number for other debug info types if -g2
1628 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1629 output_source_line (file, first);
1631 #ifdef LEAF_REG_REMAP
1632 if (current_function_uses_only_leaf_regs)
1633 leaf_renumber_regs (first);
1636 /* The Sun386i and perhaps other machines don't work right
1637 if the profiling code comes after the prologue. */
1638 #ifdef PROFILE_BEFORE_PROLOGUE
1640 profile_function (file);
1641 #endif /* PROFILE_BEFORE_PROLOGUE */
1643 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1644 if (dwarf2out_do_frame ())
1645 dwarf2out_frame_debug (NULL_RTX);
1648 /* If debugging, assign block numbers to all of the blocks in this
1652 number_blocks (current_function_decl);
1653 remove_unnecessary_notes ();
1654 /* We never actually put out begin/end notes for the top-level
1655 block in the function. But, conceptually, that block is
1657 TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl)) = 1;
1660 #ifdef FUNCTION_PROLOGUE
1661 /* First output the function prologue: code to set up the stack frame. */
1662 FUNCTION_PROLOGUE (file, get_frame_size ());
1665 /* If the machine represents the prologue as RTL, the profiling code must
1666 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1667 #ifdef HAVE_prologue
1668 if (! HAVE_prologue)
1670 profile_after_prologue (file);
1674 /* If we are doing basic block profiling, remember a printable version
1675 of the function name. */
1676 if (profile_block_flag)
1679 add_bb_string ((*decl_printable_name) (current_function_decl, 2),
1685 profile_after_prologue (file)
1686 FILE *file ATTRIBUTE_UNUSED;
1688 #ifdef FUNCTION_BLOCK_PROFILER
1689 if (profile_block_flag)
1691 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
1693 #endif /* FUNCTION_BLOCK_PROFILER */
1695 #ifndef PROFILE_BEFORE_PROLOGUE
1697 profile_function (file);
1698 #endif /* not PROFILE_BEFORE_PROLOGUE */
1702 profile_function (file)
1705 #ifndef NO_PROFILE_COUNTERS
1706 int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1708 #if defined(ASM_OUTPUT_REG_PUSH)
1709 #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1710 int sval = current_function_returns_struct;
1712 #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1713 int cxt = current_function_needs_context;
1715 #endif /* ASM_OUTPUT_REG_PUSH */
1717 #ifndef NO_PROFILE_COUNTERS
1719 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1720 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
1721 assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, 1);
1724 function_section (current_function_decl);
1726 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1728 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
1730 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1733 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1738 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1740 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1742 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1745 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1750 FUNCTION_PROFILER (file, profile_label_no);
1752 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1754 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1756 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1759 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1764 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1766 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1768 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1771 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1777 /* Output assembler code for the end of a function.
1778 For clarity, args are same as those of `final_start_function'
1779 even though not all of them are needed. */
1782 final_end_function (first, file, optimize)
1783 rtx first ATTRIBUTE_UNUSED;
1784 FILE *file ATTRIBUTE_UNUSED;
1785 int optimize ATTRIBUTE_UNUSED;
1789 #ifdef SDB_DEBUGGING_INFO
1790 if (write_symbols == SDB_DEBUG)
1791 sdbout_end_function (high_function_linenum);
1794 #ifdef DWARF_DEBUGGING_INFO
1795 if (write_symbols == DWARF_DEBUG)
1796 dwarfout_end_function ();
1799 #ifdef XCOFF_DEBUGGING_INFO
1800 if (write_symbols == XCOFF_DEBUG)
1801 xcoffout_end_function (file, high_function_linenum);
1804 #ifdef FUNCTION_EPILOGUE
1805 /* Finally, output the function epilogue:
1806 code to restore the stack frame and return to the caller. */
1807 FUNCTION_EPILOGUE (file, get_frame_size ());
1810 #ifdef SDB_DEBUGGING_INFO
1811 if (write_symbols == SDB_DEBUG)
1812 sdbout_end_epilogue ();
1815 #ifdef DWARF_DEBUGGING_INFO
1816 if (write_symbols == DWARF_DEBUG)
1817 dwarfout_end_epilogue ();
1820 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1821 if (dwarf2out_do_frame ())
1822 dwarf2out_end_epilogue ();
1825 #ifdef XCOFF_DEBUGGING_INFO
1826 if (write_symbols == XCOFF_DEBUG)
1827 xcoffout_end_epilogue (file);
1830 bb_func_label_num = -1; /* not in function, nuke label # */
1832 #ifdef IA64_UNWIND_INFO
1833 output_function_exception_table ();
1836 /* If FUNCTION_EPILOGUE is not defined, then the function body
1837 itself contains return instructions wherever needed. */
1840 /* Add a block to the linked list that remembers the current line/file/function
1841 for basic block profiling. Emit the label in front of the basic block and
1842 the instructions that increment the count field. */
1848 struct bb_list *ptr =
1849 (struct bb_list *) permalloc (sizeof (struct bb_list));
1851 /* Add basic block to linked list. */
1853 ptr->line_num = last_linenum;
1854 ptr->file_label_num = bb_file_label_num;
1855 ptr->func_label_num = bb_func_label_num;
1857 bb_tail = &ptr->next;
1859 /* Enable the table of basic-block use counts
1860 to point at the code it applies to. */
1861 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1863 /* Before first insn of this basic block, increment the
1864 count of times it was entered. */
1865 #ifdef BLOCK_PROFILER
1866 BLOCK_PROFILER (file, count_basic_blocks);
1873 count_basic_blocks++;
1876 /* Add a string to be used for basic block profiling. */
1879 add_bb_string (string, perm_p)
1884 struct bb_str *ptr = 0;
1888 string = "<unknown>";
1892 /* Allocate a new string if the current string isn't permanent. If
1893 the string is permanent search for the same string in other
1896 len = strlen (string) + 1;
1899 char *p = (char *) permalloc (len);
1900 memcpy (p, string, len);
1904 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1905 if (ptr->string == string)
1908 /* Allocate a new string block if we need to. */
1911 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1914 ptr->label_num = sbb_label_num++;
1915 ptr->string = string;
1917 sbb_tail = &ptr->next;
1920 return ptr->label_num;
1923 /* Output assembler code for some insns: all or part of a function.
1924 For description of args, see `final_start_function', above.
1926 PRESCAN is 1 if we are not really outputting,
1927 just scanning as if we were outputting.
1928 Prescanning deletes and rearranges insns just like ordinary output.
1929 PRESCAN is -2 if we are outputting after having prescanned.
1930 In this case, don't try to delete or rearrange insns
1931 because that has already been done.
1932 Prescanning is done only on certain machines. */
1935 final (first, file, optimize, prescan)
1945 last_ignored_compare = 0;
1948 check_exception_handler_labels ();
1950 /* Make a map indicating which line numbers appear in this function.
1951 When producing SDB debugging info, delete troublesome line number
1952 notes from inlined functions in other files as well as duplicate
1953 line number notes. */
1954 #ifdef SDB_DEBUGGING_INFO
1955 if (write_symbols == SDB_DEBUG)
1958 for (insn = first; insn; insn = NEXT_INSN (insn))
1959 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1961 if ((RTX_INTEGRATED_P (insn)
1962 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1964 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1965 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1967 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1968 NOTE_SOURCE_FILE (insn) = 0;
1972 if (NOTE_LINE_NUMBER (insn) > max_line)
1973 max_line = NOTE_LINE_NUMBER (insn);
1979 for (insn = first; insn; insn = NEXT_INSN (insn))
1980 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1981 max_line = NOTE_LINE_NUMBER (insn);
1984 line_note_exists = (char *) xcalloc (max_line + 1, sizeof (char));
1986 for (insn = first; insn; insn = NEXT_INSN (insn))
1988 if (INSN_UID (insn) > max_uid) /* find largest UID */
1989 max_uid = INSN_UID (insn);
1990 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1991 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
1993 /* If CC tracking across branches is enabled, record the insn which
1994 jumps to each branch only reached from one place. */
1995 if (optimize && GET_CODE (insn) == JUMP_INSN)
1997 rtx lab = JUMP_LABEL (insn);
1998 if (lab && LABEL_NUSES (lab) == 1)
2000 LABEL_REFS (lab) = insn;
2006 /* Initialize insn_eh_region table if eh is being used. */
2008 init_insn_eh_region (first, max_uid);
2014 /* Output the insns. */
2015 for (insn = NEXT_INSN (first); insn;)
2017 #ifdef HAVE_ATTR_length
2018 if (INSN_UID (insn) >= INSN_ADDRESSES_SIZE ())
2021 /* Irritatingly, the reg-stack pass is creating new instructions
2022 and because of REG_DEAD note abuse it has to run after
2023 shorten_branches. Fake address of -1 then. */
2024 insn_current_address = -1;
2026 /* This can be triggered by bugs elsewhere in the compiler if
2027 new insns are created after init_insn_lengths is called. */
2032 insn_current_address = INSN_ADDRESSES (INSN_UID (insn));
2033 #endif /* HAVE_ATTR_length */
2035 insn = final_scan_insn (insn, file, optimize, prescan, 0);
2038 /* Do basic-block profiling here
2039 if the last insn was a conditional branch. */
2040 if (profile_block_flag && new_block)
2043 free_insn_eh_region ();
2044 free (line_note_exists);
2045 line_note_exists = NULL;
2049 get_insn_template (code, insn)
2053 const void *output = insn_data[code].output;
2054 switch (insn_data[code].output_format)
2056 case INSN_OUTPUT_FORMAT_SINGLE:
2057 return (const char *) output;
2058 case INSN_OUTPUT_FORMAT_MULTI:
2059 return ((const char *const *) output)[which_alternative];
2060 case INSN_OUTPUT_FORMAT_FUNCTION:
2063 return (*(insn_output_fn) output) (recog_data.operand, insn);
2070 /* The final scan for one insn, INSN.
2071 Args are same as in `final', except that INSN
2072 is the insn being scanned.
2073 Value returned is the next insn to be scanned.
2075 NOPEEPHOLES is the flag to disallow peephole processing (currently
2076 used for within delayed branch sequence output). */
2079 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
2082 int optimize ATTRIBUTE_UNUSED;
2084 int nopeepholes ATTRIBUTE_UNUSED;
2092 /* Ignore deleted insns. These can occur when we split insns (due to a
2093 template of "#") while not optimizing. */
2094 if (INSN_DELETED_P (insn))
2095 return NEXT_INSN (insn);
2097 switch (GET_CODE (insn))
2103 switch (NOTE_LINE_NUMBER (insn))
2105 case NOTE_INSN_DELETED:
2106 case NOTE_INSN_LOOP_BEG:
2107 case NOTE_INSN_LOOP_END:
2108 case NOTE_INSN_LOOP_CONT:
2109 case NOTE_INSN_LOOP_VTOP:
2110 case NOTE_INSN_FUNCTION_END:
2111 case NOTE_INSN_SETJMP:
2112 case NOTE_INSN_REPEATED_LINE_NUMBER:
2113 case NOTE_INSN_RANGE_BEG:
2114 case NOTE_INSN_RANGE_END:
2115 case NOTE_INSN_LIVE:
2116 case NOTE_INSN_EXPECTED_VALUE:
2119 case NOTE_INSN_BASIC_BLOCK:
2120 #ifdef IA64_UNWIND_INFO
2121 IA64_UNWIND_EMIT (asm_out_file, insn);
2124 fprintf (asm_out_file, "\t%s basic block %d\n",
2125 ASM_COMMENT_START, NOTE_BASIC_BLOCK (insn)->index);
2128 case NOTE_INSN_EH_REGION_BEG:
2129 if (! exceptions_via_longjmp)
2131 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHB", NOTE_EH_HANDLER (insn));
2132 if (! flag_new_exceptions)
2133 add_eh_table_entry (NOTE_EH_HANDLER (insn));
2134 #ifdef ASM_OUTPUT_EH_REGION_BEG
2135 ASM_OUTPUT_EH_REGION_BEG (file, NOTE_EH_HANDLER (insn));
2140 case NOTE_INSN_EH_REGION_END:
2141 if (! exceptions_via_longjmp)
2143 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHE", NOTE_EH_HANDLER (insn));
2144 if (flag_new_exceptions)
2145 add_eh_table_entry (NOTE_EH_HANDLER (insn));
2146 #ifdef ASM_OUTPUT_EH_REGION_END
2147 ASM_OUTPUT_EH_REGION_END (file, NOTE_EH_HANDLER (insn));
2152 case NOTE_INSN_PROLOGUE_END:
2153 #ifdef FUNCTION_END_PROLOGUE
2154 FUNCTION_END_PROLOGUE (file);
2156 profile_after_prologue (file);
2159 case NOTE_INSN_EPILOGUE_BEG:
2160 #ifdef FUNCTION_BEGIN_EPILOGUE
2161 FUNCTION_BEGIN_EPILOGUE (file);
2165 case NOTE_INSN_FUNCTION_BEG:
2166 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
2167 /* MIPS stabs require the parameter descriptions to be after the
2168 function entry point rather than before. */
2169 if (write_symbols == SDB_DEBUG)
2172 sdbout_begin_function (last_linenum);
2175 #ifdef DWARF_DEBUGGING_INFO
2176 /* This outputs a marker where the function body starts, so it
2177 must be after the prologue. */
2178 if (write_symbols == DWARF_DEBUG)
2181 dwarfout_begin_function ();
2186 case NOTE_INSN_BLOCK_BEG:
2187 if (debug_info_level == DINFO_LEVEL_NORMAL
2188 || debug_info_level == DINFO_LEVEL_VERBOSE
2189 || write_symbols == DWARF_DEBUG
2190 || write_symbols == DWARF2_DEBUG)
2192 int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
2196 high_block_linenum = last_linenum;
2198 /* Output debugging info about the symbol-block beginning. */
2199 #ifdef SDB_DEBUGGING_INFO
2200 if (write_symbols == SDB_DEBUG)
2201 sdbout_begin_block (file, last_linenum, n);
2203 #ifdef XCOFF_DEBUGGING_INFO
2204 if (write_symbols == XCOFF_DEBUG)
2205 xcoffout_begin_block (file, last_linenum, n);
2207 #ifdef DBX_DEBUGGING_INFO
2208 if (write_symbols == DBX_DEBUG)
2209 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", n);
2211 #ifdef DWARF_DEBUGGING_INFO
2212 if (write_symbols == DWARF_DEBUG)
2213 dwarfout_begin_block (n);
2215 #ifdef DWARF2_DEBUGGING_INFO
2216 if (write_symbols == DWARF2_DEBUG)
2217 dwarf2out_begin_block (n);
2220 /* Mark this block as output. */
2221 TREE_ASM_WRITTEN (NOTE_BLOCK (insn)) = 1;
2225 case NOTE_INSN_BLOCK_END:
2226 if (debug_info_level == DINFO_LEVEL_NORMAL
2227 || debug_info_level == DINFO_LEVEL_VERBOSE
2228 || write_symbols == DWARF_DEBUG
2229 || write_symbols == DWARF2_DEBUG)
2231 int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
2235 /* End of a symbol-block. */
2237 if (block_depth < 0)
2240 #ifdef XCOFF_DEBUGGING_INFO
2241 if (write_symbols == XCOFF_DEBUG)
2242 xcoffout_end_block (file, high_block_linenum, n);
2244 #ifdef DBX_DEBUGGING_INFO
2245 if (write_symbols == DBX_DEBUG)
2246 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE", n);
2248 #ifdef SDB_DEBUGGING_INFO
2249 if (write_symbols == SDB_DEBUG)
2250 sdbout_end_block (file, high_block_linenum, n);
2252 #ifdef DWARF_DEBUGGING_INFO
2253 if (write_symbols == DWARF_DEBUG)
2254 dwarfout_end_block (n);
2256 #ifdef DWARF2_DEBUGGING_INFO
2257 if (write_symbols == DWARF2_DEBUG)
2258 dwarf2out_end_block (n);
2263 case NOTE_INSN_DELETED_LABEL:
2264 /* Emit the label. We may have deleted the CODE_LABEL because
2265 the label could be proved to be unreachable, though still
2266 referenced (in the form of having its address taken. */
2267 ASM_OUTPUT_DEBUG_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2274 if (NOTE_LINE_NUMBER (insn) <= 0)
2277 /* This note is a line-number. */
2282 /* If there is anything real after this note, output it.
2283 If another line note follows, omit this one. */
2284 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
2286 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
2289 /* These types of notes can be significant
2290 so make sure the preceding line number stays. */
2291 else if (GET_CODE (note) == NOTE
2292 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
2293 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
2294 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
2296 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
2298 /* Another line note follows; we can delete this note
2299 if no intervening line numbers have notes elsewhere. */
2301 for (num = NOTE_LINE_NUMBER (insn) + 1;
2302 num < NOTE_LINE_NUMBER (note);
2304 if (line_note_exists[num])
2307 if (num >= NOTE_LINE_NUMBER (note))
2313 /* Output this line note if it is the first or the last line
2316 output_source_line (file, insn);
2323 #if defined (DWARF2_UNWIND_INFO)
2324 if (dwarf2out_do_frame ())
2325 dwarf2out_frame_debug (insn);
2330 /* The target port might emit labels in the output function for
2331 some insn, e.g. sh.c output_branchy_insn. */
2332 if (CODE_LABEL_NUMBER (insn) <= max_labelno)
2334 int align = LABEL_TO_ALIGNMENT (insn);
2335 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2336 int max_skip = LABEL_TO_MAX_SKIP (insn);
2339 if (align && NEXT_INSN (insn))
2340 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2341 ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip);
2343 ASM_OUTPUT_ALIGN (file, align);
2348 /* If this label is reached from only one place, set the condition
2349 codes from the instruction just before the branch. */
2351 /* Disabled because some insns set cc_status in the C output code
2352 and NOTICE_UPDATE_CC alone can set incorrect status. */
2353 if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
2355 rtx jump = LABEL_REFS (insn);
2356 rtx barrier = prev_nonnote_insn (insn);
2358 /* If the LABEL_REFS field of this label has been set to point
2359 at a branch, the predecessor of the branch is a regular
2360 insn, and that branch is the only way to reach this label,
2361 set the condition codes based on the branch and its
2363 if (barrier && GET_CODE (barrier) == BARRIER
2364 && jump && GET_CODE (jump) == JUMP_INSN
2365 && (prev = prev_nonnote_insn (jump))
2366 && GET_CODE (prev) == INSN)
2368 NOTICE_UPDATE_CC (PATTERN (prev), prev);
2369 NOTICE_UPDATE_CC (PATTERN (jump), jump);
2377 #ifdef FINAL_PRESCAN_LABEL
2378 FINAL_PRESCAN_INSN (insn, NULL_PTR, 0);
2381 #ifdef SDB_DEBUGGING_INFO
2382 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
2383 sdbout_label (insn);
2387 fputs (ASM_APP_OFF, file);
2390 if (NEXT_INSN (insn) != 0
2391 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
2393 rtx nextbody = PATTERN (NEXT_INSN (insn));
2395 /* If this label is followed by a jump-table,
2396 make sure we put the label in the read-only section. Also
2397 possibly write the label and jump table together. */
2399 if (GET_CODE (nextbody) == ADDR_VEC
2400 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
2402 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2403 /* In this case, the case vector is being moved by the
2404 target, so don't output the label at all. Leave that
2405 to the back end macros. */
2407 if (! JUMP_TABLES_IN_TEXT_SECTION)
2409 readonly_data_section ();
2410 #ifdef READONLY_DATA_SECTION
2411 ASM_OUTPUT_ALIGN (file,
2412 exact_log2 (BIGGEST_ALIGNMENT
2414 #endif /* READONLY_DATA_SECTION */
2417 function_section (current_function_decl);
2419 #ifdef ASM_OUTPUT_CASE_LABEL
2420 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
2423 if (LABEL_ALTERNATE_NAME (insn))
2424 ASM_OUTPUT_ALTERNATE_LABEL_NAME (file, insn);
2426 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2432 if (LABEL_ALTERNATE_NAME (insn))
2433 ASM_OUTPUT_ALTERNATE_LABEL_NAME (file, insn);
2435 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2440 register rtx body = PATTERN (insn);
2441 int insn_code_number;
2442 const char *template;
2447 /* An INSN, JUMP_INSN or CALL_INSN.
2448 First check for special kinds that recog doesn't recognize. */
2450 if (GET_CODE (body) == USE /* These are just declarations */
2451 || GET_CODE (body) == CLOBBER)
2455 /* If there is a REG_CC_SETTER note on this insn, it means that
2456 the setting of the condition code was done in the delay slot
2457 of the insn that branched here. So recover the cc status
2458 from the insn that set it. */
2460 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
2463 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
2464 cc_prev_status = cc_status;
2468 /* Detect insns that are really jump-tables
2469 and output them as such. */
2471 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
2473 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2474 register int vlen, idx;
2482 fputs (ASM_APP_OFF, file);
2486 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2487 if (GET_CODE (body) == ADDR_VEC)
2489 #ifdef ASM_OUTPUT_ADDR_VEC
2490 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2497 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2498 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2504 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
2505 for (idx = 0; idx < vlen; idx++)
2507 if (GET_CODE (body) == ADDR_VEC)
2509 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2510 ASM_OUTPUT_ADDR_VEC_ELT
2511 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
2518 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2519 ASM_OUTPUT_ADDR_DIFF_ELT
2522 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
2523 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
2529 #ifdef ASM_OUTPUT_CASE_END
2530 ASM_OUTPUT_CASE_END (file,
2531 CODE_LABEL_NUMBER (PREV_INSN (insn)),
2536 function_section (current_function_decl);
2541 /* Do basic-block profiling when we reach a new block.
2542 Done here to avoid jump tables. */
2543 if (profile_block_flag && new_block)
2546 if (GET_CODE (body) == ASM_INPUT)
2548 /* There's no telling what that did to the condition codes. */
2554 fputs (ASM_APP_ON, file);
2557 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
2561 /* Detect `asm' construct with operands. */
2562 if (asm_noperands (body) >= 0)
2564 unsigned int noperands = asm_noperands (body);
2565 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
2568 /* There's no telling what that did to the condition codes. */
2575 fputs (ASM_APP_ON, file);
2579 /* Get out the operand values. */
2580 string = decode_asm_operands (body, ops, NULL_PTR,
2581 NULL_PTR, NULL_PTR);
2582 /* Inhibit aborts on what would otherwise be compiler bugs. */
2583 insn_noperands = noperands;
2584 this_is_asm_operands = insn;
2586 /* Output the insn using them. */
2587 output_asm_insn (string, ops);
2588 this_is_asm_operands = 0;
2592 if (prescan <= 0 && app_on)
2594 fputs (ASM_APP_OFF, file);
2598 if (GET_CODE (body) == SEQUENCE)
2600 /* A delayed-branch sequence */
2606 final_sequence = body;
2608 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2609 force the restoration of a comparison that was previously
2610 thought unnecessary. If that happens, cancel this sequence
2611 and cause that insn to be restored. */
2613 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
2614 if (next != XVECEXP (body, 0, 1))
2620 for (i = 1; i < XVECLEN (body, 0); i++)
2622 rtx insn = XVECEXP (body, 0, i);
2623 rtx next = NEXT_INSN (insn);
2624 /* We loop in case any instruction in a delay slot gets
2627 insn = final_scan_insn (insn, file, 0, prescan, 1);
2628 while (insn != next);
2630 #ifdef DBR_OUTPUT_SEQEND
2631 DBR_OUTPUT_SEQEND (file);
2635 /* If the insn requiring the delay slot was a CALL_INSN, the
2636 insns in the delay slot are actually executed before the
2637 called function. Hence we don't preserve any CC-setting
2638 actions in these insns and the CC must be marked as being
2639 clobbered by the function. */
2640 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
2645 /* Following a conditional branch sequence, we have a new basic
2647 if (profile_block_flag)
2649 rtx insn = XVECEXP (body, 0, 0);
2650 rtx body = PATTERN (insn);
2652 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2653 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2654 || (GET_CODE (insn) == JUMP_INSN
2655 && GET_CODE (body) == PARALLEL
2656 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2657 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
2663 /* We have a real machine instruction as rtl. */
2665 body = PATTERN (insn);
2668 set = single_set (insn);
2670 /* Check for redundant test and compare instructions
2671 (when the condition codes are already set up as desired).
2672 This is done only when optimizing; if not optimizing,
2673 it should be possible for the user to alter a variable
2674 with the debugger in between statements
2675 and the next statement should reexamine the variable
2676 to compute the condition codes. */
2681 rtx set = single_set (insn);
2685 && GET_CODE (SET_DEST (set)) == CC0
2686 && insn != last_ignored_compare)
2688 if (GET_CODE (SET_SRC (set)) == SUBREG)
2689 SET_SRC (set) = alter_subreg (SET_SRC (set));
2690 else if (GET_CODE (SET_SRC (set)) == COMPARE)
2692 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
2693 XEXP (SET_SRC (set), 0)
2694 = alter_subreg (XEXP (SET_SRC (set), 0));
2695 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
2696 XEXP (SET_SRC (set), 1)
2697 = alter_subreg (XEXP (SET_SRC (set), 1));
2699 if ((cc_status.value1 != 0
2700 && rtx_equal_p (SET_SRC (set), cc_status.value1))
2701 || (cc_status.value2 != 0
2702 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
2704 /* Don't delete insn if it has an addressing side-effect. */
2705 if (! FIND_REG_INC_NOTE (insn, 0)
2706 /* or if anything in it is volatile. */
2707 && ! volatile_refs_p (PATTERN (insn)))
2709 /* We don't really delete the insn; just ignore it. */
2710 last_ignored_compare = insn;
2718 /* Following a conditional branch, we have a new basic block.
2719 But if we are inside a sequence, the new block starts after the
2720 last insn of the sequence. */
2721 if (profile_block_flag && final_sequence == 0
2722 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2723 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2724 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
2725 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2726 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
2730 /* Don't bother outputting obvious no-ops, even without -O.
2731 This optimization is fast and doesn't interfere with debugging.
2732 Don't do this if the insn is in a delay slot, since this
2733 will cause an improper number of delay insns to be written. */
2734 if (final_sequence == 0
2736 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
2737 && GET_CODE (SET_SRC (body)) == REG
2738 && GET_CODE (SET_DEST (body)) == REG
2739 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
2744 /* If this is a conditional branch, maybe modify it
2745 if the cc's are in a nonstandard state
2746 so that it accomplishes the same thing that it would
2747 do straightforwardly if the cc's were set up normally. */
2749 if (cc_status.flags != 0
2750 && GET_CODE (insn) == JUMP_INSN
2751 && GET_CODE (body) == SET
2752 && SET_DEST (body) == pc_rtx
2753 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
2754 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
2755 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
2756 /* This is done during prescan; it is not done again
2757 in final scan when prescan has been done. */
2760 /* This function may alter the contents of its argument
2761 and clear some of the cc_status.flags bits.
2762 It may also return 1 meaning condition now always true
2763 or -1 meaning condition now always false
2764 or 2 meaning condition nontrivial but altered. */
2765 register int result = alter_cond (XEXP (SET_SRC (body), 0));
2766 /* If condition now has fixed value, replace the IF_THEN_ELSE
2767 with its then-operand or its else-operand. */
2769 SET_SRC (body) = XEXP (SET_SRC (body), 1);
2771 SET_SRC (body) = XEXP (SET_SRC (body), 2);
2773 /* The jump is now either unconditional or a no-op.
2774 If it has become a no-op, don't try to output it.
2775 (It would not be recognized.) */
2776 if (SET_SRC (body) == pc_rtx)
2778 PUT_CODE (insn, NOTE);
2779 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2780 NOTE_SOURCE_FILE (insn) = 0;
2783 else if (GET_CODE (SET_SRC (body)) == RETURN)
2784 /* Replace (set (pc) (return)) with (return). */
2785 PATTERN (insn) = body = SET_SRC (body);
2787 /* Rerecognize the instruction if it has changed. */
2789 INSN_CODE (insn) = -1;
2792 /* Make same adjustments to instructions that examine the
2793 condition codes without jumping and instructions that
2794 handle conditional moves (if this machine has either one). */
2796 if (cc_status.flags != 0
2799 rtx cond_rtx, then_rtx, else_rtx;
2801 if (GET_CODE (insn) != JUMP_INSN
2802 && GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
2804 cond_rtx = XEXP (SET_SRC (set), 0);
2805 then_rtx = XEXP (SET_SRC (set), 1);
2806 else_rtx = XEXP (SET_SRC (set), 2);
2810 cond_rtx = SET_SRC (set);
2811 then_rtx = const_true_rtx;
2812 else_rtx = const0_rtx;
2815 switch (GET_CODE (cond_rtx))
2828 register int result;
2829 if (XEXP (cond_rtx, 0) != cc0_rtx)
2831 result = alter_cond (cond_rtx);
2833 validate_change (insn, &SET_SRC (set), then_rtx, 0);
2834 else if (result == -1)
2835 validate_change (insn, &SET_SRC (set), else_rtx, 0);
2836 else if (result == 2)
2837 INSN_CODE (insn) = -1;
2838 if (SET_DEST (set) == SET_SRC (set))
2840 PUT_CODE (insn, NOTE);
2841 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2842 NOTE_SOURCE_FILE (insn) = 0;
2854 #ifdef HAVE_peephole
2855 /* Do machine-specific peephole optimizations if desired. */
2857 if (optimize && !flag_no_peephole && !nopeepholes)
2859 rtx next = peephole (insn);
2860 /* When peepholing, if there were notes within the peephole,
2861 emit them before the peephole. */
2862 if (next != 0 && next != NEXT_INSN (insn))
2864 rtx prev = PREV_INSN (insn);
2867 for (note = NEXT_INSN (insn); note != next;
2868 note = NEXT_INSN (note))
2869 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2871 /* In case this is prescan, put the notes
2872 in proper position for later rescan. */
2873 note = NEXT_INSN (insn);
2874 PREV_INSN (note) = prev;
2875 NEXT_INSN (prev) = note;
2876 NEXT_INSN (PREV_INSN (next)) = insn;
2877 PREV_INSN (insn) = PREV_INSN (next);
2878 NEXT_INSN (insn) = next;
2879 PREV_INSN (next) = insn;
2882 /* PEEPHOLE might have changed this. */
2883 body = PATTERN (insn);
2887 /* Try to recognize the instruction.
2888 If successful, verify that the operands satisfy the
2889 constraints for the instruction. Crash if they don't,
2890 since `reload' should have changed them so that they do. */
2892 insn_code_number = recog_memoized (insn);
2893 cleanup_subreg_operands (insn);
2895 /* Dump the insn in the assembly for debugging. */
2896 if (flag_dump_rtl_in_asm)
2898 print_rtx_head = ASM_COMMENT_START;
2899 print_rtl_single (asm_out_file, insn);
2900 print_rtx_head = "";
2903 if (! constrain_operands_cached (1))
2904 fatal_insn_not_found (insn);
2906 /* Some target machines need to prescan each insn before
2909 #ifdef FINAL_PRESCAN_INSN
2910 FINAL_PRESCAN_INSN (insn, recog_data.operand, recog_data.n_operands);
2913 #ifdef HAVE_conditional_execution
2914 if (GET_CODE (PATTERN (insn)) == COND_EXEC)
2915 current_insn_predicate = COND_EXEC_TEST (PATTERN (insn));
2917 current_insn_predicate = NULL_RTX;
2921 cc_prev_status = cc_status;
2923 /* Update `cc_status' for this instruction.
2924 The instruction's output routine may change it further.
2925 If the output routine for a jump insn needs to depend
2926 on the cc status, it should look at cc_prev_status. */
2928 NOTICE_UPDATE_CC (body, insn);
2931 current_output_insn = debug_insn = insn;
2933 #if defined (DWARF2_UNWIND_INFO)
2934 if (GET_CODE (insn) == CALL_INSN && dwarf2out_do_frame ())
2935 dwarf2out_frame_debug (insn);
2938 /* Find the proper template for this insn. */
2939 template = get_insn_template (insn_code_number, insn);
2941 /* If the C code returns 0, it means that it is a jump insn
2942 which follows a deleted test insn, and that test insn
2943 needs to be reinserted. */
2948 if (prev_nonnote_insn (insn) != last_ignored_compare)
2952 /* We have already processed the notes between the setter and
2953 the user. Make sure we don't process them again, this is
2954 particularly important if one of the notes is a block
2955 scope note or an EH note. */
2957 prev != last_ignored_compare;
2958 prev = PREV_INSN (prev))
2960 if (GET_CODE (prev) == NOTE)
2962 NOTE_LINE_NUMBER (prev) = NOTE_INSN_DELETED;
2963 NOTE_SOURCE_FILE (prev) = 0;
2970 /* If the template is the string "#", it means that this insn must
2972 if (template[0] == '#' && template[1] == '\0')
2974 rtx new = try_split (body, insn, 0);
2976 /* If we didn't split the insn, go away. */
2977 if (new == insn && PATTERN (new) == body)
2978 fatal_insn ("Could not split insn", insn);
2980 #ifdef HAVE_ATTR_length
2981 /* This instruction should have been split in shorten_branches,
2982 to ensure that we would have valid length info for the
2994 #ifdef IA64_UNWIND_INFO
2995 IA64_UNWIND_EMIT (asm_out_file, insn);
2997 /* Output assembler code from the template. */
2999 output_asm_insn (template, recog_data.operand);
3001 #if defined (DWARF2_UNWIND_INFO)
3002 #if defined (HAVE_prologue)
3003 if (GET_CODE (insn) == INSN && dwarf2out_do_frame ())
3004 dwarf2out_frame_debug (insn);
3006 if (!ACCUMULATE_OUTGOING_ARGS
3007 && GET_CODE (insn) == INSN
3008 && dwarf2out_do_frame ())
3009 dwarf2out_frame_debug (insn);
3014 /* It's not at all clear why we did this and doing so interferes
3015 with tests we'd like to do to use REG_WAS_0 notes, so let's try
3018 /* Mark this insn as having been output. */
3019 INSN_DELETED_P (insn) = 1;
3022 current_output_insn = debug_insn = 0;
3025 return NEXT_INSN (insn);
3028 /* Output debugging info to the assembler file FILE
3029 based on the NOTE-insn INSN, assumed to be a line number. */
3032 output_source_line (file, insn)
3033 FILE *file ATTRIBUTE_UNUSED;
3036 register const char *filename = NOTE_SOURCE_FILE (insn);
3038 /* Remember filename for basic block profiling.
3039 Filenames are allocated on the permanent obstack
3040 or are passed in ARGV, so we don't have to save
3043 if (profile_block_flag && last_filename != filename)
3044 bb_file_label_num = add_bb_string (filename, TRUE);
3046 last_filename = filename;
3047 last_linenum = NOTE_LINE_NUMBER (insn);
3048 high_block_linenum = MAX (last_linenum, high_block_linenum);
3049 high_function_linenum = MAX (last_linenum, high_function_linenum);
3051 if (write_symbols != NO_DEBUG)
3053 #ifdef SDB_DEBUGGING_INFO
3054 if (write_symbols == SDB_DEBUG
3055 #if 0 /* People like having line numbers even in wrong file! */
3056 /* COFF can't handle multiple source files--lose, lose. */
3057 && !strcmp (filename, main_input_filename)
3059 /* COFF relative line numbers must be positive. */
3060 && last_linenum > sdb_begin_function_line)
3062 #ifdef ASM_OUTPUT_SOURCE_LINE
3063 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
3065 fprintf (file, "\t.ln\t%d\n",
3066 ((sdb_begin_function_line > -1)
3067 ? last_linenum - sdb_begin_function_line : 1));
3072 #if defined (DBX_DEBUGGING_INFO)
3073 if (write_symbols == DBX_DEBUG)
3074 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
3077 #if defined (XCOFF_DEBUGGING_INFO)
3078 if (write_symbols == XCOFF_DEBUG)
3079 xcoffout_source_line (file, filename, insn);
3082 #ifdef DWARF_DEBUGGING_INFO
3083 if (write_symbols == DWARF_DEBUG)
3084 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
3087 #ifdef DWARF2_DEBUGGING_INFO
3088 if (write_symbols == DWARF2_DEBUG)
3089 dwarf2out_line (filename, NOTE_LINE_NUMBER (insn));
3094 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3095 directly to the desired hard register. */
3098 cleanup_subreg_operands (insn)
3102 extract_insn_cached (insn);
3103 for (i = 0; i < recog_data.n_operands; i++)
3105 if (GET_CODE (recog_data.operand[i]) == SUBREG)
3106 recog_data.operand[i] = alter_subreg (recog_data.operand[i]);
3107 else if (GET_CODE (recog_data.operand[i]) == PLUS
3108 || GET_CODE (recog_data.operand[i]) == MULT
3109 || GET_CODE (recog_data.operand[i]) == MEM)
3110 recog_data.operand[i] = walk_alter_subreg (recog_data.operand[i]);
3113 for (i = 0; i < recog_data.n_dups; i++)
3115 if (GET_CODE (*recog_data.dup_loc[i]) == SUBREG)
3116 *recog_data.dup_loc[i] = alter_subreg (*recog_data.dup_loc[i]);
3117 else if (GET_CODE (*recog_data.dup_loc[i]) == PLUS
3118 || GET_CODE (*recog_data.dup_loc[i]) == MULT
3119 || GET_CODE (*recog_data.dup_loc[i]) == MEM)
3120 *recog_data.dup_loc[i] = walk_alter_subreg (*recog_data.dup_loc[i]);
3124 /* If X is a SUBREG, replace it with a REG or a MEM,
3125 based on the thing it is a subreg of. */
3131 register rtx y = SUBREG_REG (x);
3133 if (GET_CODE (y) == SUBREG)
3134 y = alter_subreg (y);
3136 /* If reload is operating, we may be replacing inside this SUBREG.
3137 Check for that and make a new one if so. */
3138 if (reload_in_progress && find_replacement (&SUBREG_REG (x)) != 0)
3141 if (GET_CODE (y) == REG)
3144 /* If the word size is larger than the size of this register,
3145 adjust the register number to compensate. */
3146 /* ??? Note that this just catches stragglers created by/for
3147 integrate. It would be better if we either caught these
3148 earlier, or kept _all_ subregs until now and eliminate
3149 gen_lowpart and friends. */
3151 #ifdef ALTER_HARD_SUBREG
3152 regno = ALTER_HARD_SUBREG (GET_MODE (x), SUBREG_WORD (x),
3153 GET_MODE (y), REGNO (y));
3155 regno = REGNO (y) + SUBREG_WORD (x);
3159 ORIGINAL_REGNO (x) = ORIGINAL_REGNO (y);
3160 /* This field has a different meaning for REGs and SUBREGs. Make sure
3164 else if (GET_CODE (y) == MEM)
3166 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
3168 if (BYTES_BIG_ENDIAN)
3169 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
3170 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
3172 MEM_COPY_ATTRIBUTES (x, y);
3173 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
3179 /* Do alter_subreg on all the SUBREGs contained in X. */
3182 walk_alter_subreg (x)
3185 switch (GET_CODE (x))
3189 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3190 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
3194 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3198 return alter_subreg (x);
3209 /* Given BODY, the body of a jump instruction, alter the jump condition
3210 as required by the bits that are set in cc_status.flags.
3211 Not all of the bits there can be handled at this level in all cases.
3213 The value is normally 0.
3214 1 means that the condition has become always true.
3215 -1 means that the condition has become always false.
3216 2 means that COND has been altered. */
3224 if (cc_status.flags & CC_REVERSED)
3227 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
3230 if (cc_status.flags & CC_INVERTED)
3233 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
3236 if (cc_status.flags & CC_NOT_POSITIVE)
3237 switch (GET_CODE (cond))
3242 /* Jump becomes unconditional. */
3248 /* Jump becomes no-op. */
3252 PUT_CODE (cond, EQ);
3257 PUT_CODE (cond, NE);
3265 if (cc_status.flags & CC_NOT_NEGATIVE)
3266 switch (GET_CODE (cond))
3270 /* Jump becomes unconditional. */
3275 /* Jump becomes no-op. */
3280 PUT_CODE (cond, EQ);
3286 PUT_CODE (cond, NE);
3294 if (cc_status.flags & CC_NO_OVERFLOW)
3295 switch (GET_CODE (cond))
3298 /* Jump becomes unconditional. */
3302 PUT_CODE (cond, EQ);
3307 PUT_CODE (cond, NE);
3312 /* Jump becomes no-op. */
3319 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
3320 switch (GET_CODE (cond))
3326 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
3331 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
3336 if (cc_status.flags & CC_NOT_SIGNED)
3337 /* The flags are valid if signed condition operators are converted
3339 switch (GET_CODE (cond))
3342 PUT_CODE (cond, LEU);
3347 PUT_CODE (cond, LTU);
3352 PUT_CODE (cond, GTU);
3357 PUT_CODE (cond, GEU);
3369 /* Report inconsistency between the assembler template and the operands.
3370 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3373 output_operand_lossage (msgid)
3376 if (this_is_asm_operands)
3377 error_for_asm (this_is_asm_operands, "invalid `asm': %s", _(msgid));
3379 internal_error ("output_operand: %s", _(msgid));
3382 /* Output of assembler code from a template, and its subroutines. */
3384 /* Output text from TEMPLATE to the assembler output file,
3385 obeying %-directions to substitute operands taken from
3386 the vector OPERANDS.
3388 %N (for N a digit) means print operand N in usual manner.
3389 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3390 and print the label name with no punctuation.
3391 %cN means require operand N to be a constant
3392 and print the constant expression with no punctuation.
3393 %aN means expect operand N to be a memory address
3394 (not a memory reference!) and print a reference
3396 %nN means expect operand N to be a constant
3397 and print a constant expression for minus the value
3398 of the operand, with no other punctuation. */
3403 if (flag_print_asm_name)
3405 /* Annotate the assembly with a comment describing the pattern and
3406 alternative used. */
3409 register int num = INSN_CODE (debug_insn);
3410 fprintf (asm_out_file, "\t%s %d\t%s",
3411 ASM_COMMENT_START, INSN_UID (debug_insn),
3412 insn_data[num].name);
3413 if (insn_data[num].n_alternatives > 1)
3414 fprintf (asm_out_file, "/%d", which_alternative + 1);
3415 #ifdef HAVE_ATTR_length
3416 fprintf (asm_out_file, "\t[length = %d]",
3417 get_attr_length (debug_insn));
3419 /* Clear this so only the first assembler insn
3420 of any rtl insn will get the special comment for -dp. */
3427 output_asm_insn (template, operands)
3428 const char *template;
3431 register const char *p;
3434 /* An insn may return a null string template
3435 in a case where no assembler code is needed. */
3440 putc ('\t', asm_out_file);
3442 #ifdef ASM_OUTPUT_OPCODE
3443 ASM_OUTPUT_OPCODE (asm_out_file, p);
3451 putc (c, asm_out_file);
3452 #ifdef ASM_OUTPUT_OPCODE
3453 while ((c = *p) == '\t')
3455 putc (c, asm_out_file);
3458 ASM_OUTPUT_OPCODE (asm_out_file, p);
3462 #ifdef ASSEMBLER_DIALECT
3467 /* If we want the first dialect, do nothing. Otherwise, skip
3468 DIALECT_NUMBER of strings ending with '|'. */
3469 for (i = 0; i < dialect_number; i++)
3471 while (*p && *p != '}' && *p++ != '|')
3482 /* Skip to close brace. */
3483 while (*p && *p++ != '}')
3492 /* %% outputs a single %. */
3496 putc (c, asm_out_file);
3498 /* %= outputs a number which is unique to each insn in the entire
3499 compilation. This is useful for making local labels that are
3500 referred to more than once in a given insn. */
3504 fprintf (asm_out_file, "%d", insn_counter);
3506 /* % followed by a letter and some digits
3507 outputs an operand in a special way depending on the letter.
3508 Letters `acln' are implemented directly.
3509 Other letters are passed to `output_operand' so that
3510 the PRINT_OPERAND macro can define them. */
3511 else if (ISLOWER (*p) || ISUPPER (*p))
3516 if (! (*p >= '0' && *p <= '9'))
3517 output_operand_lossage ("operand number missing after %-letter");
3518 else if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3519 output_operand_lossage ("operand number out of range");
3520 else if (letter == 'l')
3521 output_asm_label (operands[c]);
3522 else if (letter == 'a')
3523 output_address (operands[c]);
3524 else if (letter == 'c')
3526 if (CONSTANT_ADDRESS_P (operands[c]))
3527 output_addr_const (asm_out_file, operands[c]);
3529 output_operand (operands[c], 'c');
3531 else if (letter == 'n')
3533 if (GET_CODE (operands[c]) == CONST_INT)
3534 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
3535 - INTVAL (operands[c]));
3538 putc ('-', asm_out_file);
3539 output_addr_const (asm_out_file, operands[c]);
3543 output_operand (operands[c], letter);
3545 while ((c = *p) >= '0' && c <= '9')
3548 /* % followed by a digit outputs an operand the default way. */
3549 else if (*p >= '0' && *p <= '9')
3552 if (this_is_asm_operands
3553 && (c < 0 || (unsigned int) c >= insn_noperands))
3554 output_operand_lossage ("operand number out of range");
3556 output_operand (operands[c], 0);
3557 while ((c = *p) >= '0' && c <= '9')
3560 /* % followed by punctuation: output something for that
3561 punctuation character alone, with no operand.
3562 The PRINT_OPERAND macro decides what is actually done. */
3563 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3564 else if (PRINT_OPERAND_PUNCT_VALID_P ((unsigned char) *p))
3565 output_operand (NULL_RTX, *p++);
3568 output_operand_lossage ("invalid %%-code");
3572 putc (c, asm_out_file);
3577 putc ('\n', asm_out_file);
3580 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3583 output_asm_label (x)
3588 if (GET_CODE (x) == LABEL_REF)
3590 if (GET_CODE (x) == CODE_LABEL
3591 || (GET_CODE (x) == NOTE
3592 && NOTE_LINE_NUMBER (x) == NOTE_INSN_DELETED_LABEL))
3593 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3595 output_operand_lossage ("`%l' operand isn't a label");
3597 assemble_name (asm_out_file, buf);
3600 /* Print operand X using machine-dependent assembler syntax.
3601 The macro PRINT_OPERAND is defined just to control this function.
3602 CODE is a non-digit that preceded the operand-number in the % spec,
3603 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3604 between the % and the digits.
3605 When CODE is a non-letter, X is 0.
3607 The meanings of the letters are machine-dependent and controlled
3608 by PRINT_OPERAND. */
3611 output_operand (x, code)
3613 int code ATTRIBUTE_UNUSED;
3615 if (x && GET_CODE (x) == SUBREG)
3616 x = alter_subreg (x);
3618 /* If X is a pseudo-register, abort now rather than writing trash to the
3621 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
3624 PRINT_OPERAND (asm_out_file, x, code);
3627 /* Print a memory reference operand for address X
3628 using machine-dependent assembler syntax.
3629 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3635 walk_alter_subreg (x);
3636 PRINT_OPERAND_ADDRESS (asm_out_file, x);
3639 /* Print an integer constant expression in assembler syntax.
3640 Addition and subtraction are the only arithmetic
3641 that may appear in these expressions. */
3644 output_addr_const (file, x)
3651 switch (GET_CODE (x))
3661 #ifdef ASM_OUTPUT_SYMBOL_REF
3662 ASM_OUTPUT_SYMBOL_REF (file, x);
3664 assemble_name (file, XSTR (x, 0));
3672 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3673 assemble_name (file, buf);
3677 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
3681 /* This used to output parentheses around the expression,
3682 but that does not work on the 386 (either ATT or BSD assembler). */
3683 output_addr_const (file, XEXP (x, 0));
3687 if (GET_MODE (x) == VOIDmode)
3689 /* We can use %d if the number is one word and positive. */
3690 if (CONST_DOUBLE_HIGH (x))
3691 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3692 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
3693 else if (CONST_DOUBLE_LOW (x) < 0)
3694 fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
3696 fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
3699 /* We can't handle floating point constants;
3700 PRINT_OPERAND must handle them. */
3701 output_operand_lossage ("floating constant misused");
3705 /* Some assemblers need integer constants to appear last (eg masm). */
3706 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
3708 output_addr_const (file, XEXP (x, 1));
3709 if (INTVAL (XEXP (x, 0)) >= 0)
3710 fprintf (file, "+");
3711 output_addr_const (file, XEXP (x, 0));
3715 output_addr_const (file, XEXP (x, 0));
3716 if (GET_CODE (XEXP (x, 1)) != CONST_INT
3717 || INTVAL (XEXP (x, 1)) >= 0)
3718 fprintf (file, "+");
3719 output_addr_const (file, XEXP (x, 1));
3724 /* Avoid outputting things like x-x or x+5-x,
3725 since some assemblers can't handle that. */
3726 x = simplify_subtraction (x);
3727 if (GET_CODE (x) != MINUS)
3730 output_addr_const (file, XEXP (x, 0));
3731 fprintf (file, "-");
3732 if ((GET_CODE (XEXP (x, 1)) == CONST_INT
3733 && INTVAL (XEXP (x, 1)) < 0)
3734 || GET_CODE (XEXP (x, 1)) != CONST_INT)
3736 fprintf (file, "%s", ASM_OPEN_PAREN);
3737 output_addr_const (file, XEXP (x, 1));
3738 fprintf (file, "%s", ASM_CLOSE_PAREN);
3741 output_addr_const (file, XEXP (x, 1));
3746 output_addr_const (file, XEXP (x, 0));
3750 #ifdef OUTPUT_ADDR_CONST_EXTRA
3751 OUTPUT_ADDR_CONST_EXTRA (file, x, fail);
3756 output_operand_lossage ("invalid expression as operand");
3760 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3761 %R prints the value of REGISTER_PREFIX.
3762 %L prints the value of LOCAL_LABEL_PREFIX.
3763 %U prints the value of USER_LABEL_PREFIX.
3764 %I prints the value of IMMEDIATE_PREFIX.
3765 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3766 Also supported are %d, %x, %s, %e, %f, %g and %%.
3768 We handle alternate assembler dialects here, just like output_asm_insn. */
3771 asm_fprintf VPARAMS ((FILE *file, const char *p, ...))
3773 #ifndef ANSI_PROTOTYPES
3781 VA_START (argptr, p);
3783 #ifndef ANSI_PROTOTYPES
3784 file = va_arg (argptr, FILE *);
3785 p = va_arg (argptr, const char *);
3793 #ifdef ASSEMBLER_DIALECT
3798 /* If we want the first dialect, do nothing. Otherwise, skip
3799 DIALECT_NUMBER of strings ending with '|'. */
3800 for (i = 0; i < dialect_number; i++)
3802 while (*p && *p++ != '|')
3812 /* Skip to close brace. */
3813 while (*p && *p++ != '}')
3824 while ((c >= '0' && c <= '9') || c == '.')
3832 fprintf (file, "%%");
3835 case 'd': case 'i': case 'u':
3836 case 'x': case 'p': case 'X':
3840 fprintf (file, buf, va_arg (argptr, int));
3844 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3845 but we do not check for those cases. It means that the value
3846 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3848 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3850 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3860 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3867 fprintf (file, buf, va_arg (argptr, long));
3875 fprintf (file, buf, va_arg (argptr, double));
3881 fprintf (file, buf, va_arg (argptr, char *));
3885 #ifdef ASM_OUTPUT_OPCODE
3886 ASM_OUTPUT_OPCODE (asm_out_file, p);
3891 #ifdef REGISTER_PREFIX
3892 fprintf (file, "%s", REGISTER_PREFIX);
3897 #ifdef IMMEDIATE_PREFIX
3898 fprintf (file, "%s", IMMEDIATE_PREFIX);
3903 #ifdef LOCAL_LABEL_PREFIX
3904 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
3909 fputs (user_label_prefix, file);
3912 #ifdef ASM_FPRINTF_EXTENSIONS
3913 /* Upper case letters are reserved for general use by asm_fprintf
3914 and so are not available to target specific code. In order to
3915 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
3916 they are defined here. As they get turned into real extensions
3917 to asm_fprintf they should be removed from this list. */
3918 case 'A': case 'B': case 'C': case 'D': case 'E':
3919 case 'F': case 'G': case 'H': case 'J': case 'K':
3920 case 'M': case 'N': case 'P': case 'Q': case 'S':
3921 case 'T': case 'V': case 'W': case 'Y': case 'Z':
3924 ASM_FPRINTF_EXTENSIONS (file, argptr, p)
3937 /* Split up a CONST_DOUBLE or integer constant rtx
3938 into two rtx's for single words,
3939 storing in *FIRST the word that comes first in memory in the target
3940 and in *SECOND the other. */
3943 split_double (value, first, second)
3945 rtx *first, *second;
3947 if (GET_CODE (value) == CONST_INT)
3949 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3951 /* In this case the CONST_INT holds both target words.
3952 Extract the bits from it into two word-sized pieces.
3953 Sign extend each half to HOST_WIDE_INT. */
3954 unsigned HOST_WIDE_INT low, high;
3955 unsigned HOST_WIDE_INT mask, sign_bit, sign_extend;
3957 /* Set sign_bit to the most significant bit of a word. */
3959 sign_bit <<= BITS_PER_WORD - 1;
3961 /* Set mask so that all bits of the word are set. We could
3962 have used 1 << BITS_PER_WORD instead of basing the
3963 calculation on sign_bit. However, on machines where
3964 HOST_BITS_PER_WIDE_INT == BITS_PER_WORD, it could cause a
3965 compiler warning, even though the code would never be
3967 mask = sign_bit << 1;
3970 /* Set sign_extend as any remaining bits. */
3971 sign_extend = ~mask;
3973 /* Pick the lower word and sign-extend it. */
3974 low = INTVAL (value);
3979 /* Pick the higher word, shifted to the least significant
3980 bits, and sign-extend it. */
3981 high = INTVAL (value);
3982 high >>= BITS_PER_WORD - 1;
3985 if (high & sign_bit)
3986 high |= sign_extend;
3988 /* Store the words in the target machine order. */
3989 if (WORDS_BIG_ENDIAN)
3991 *first = GEN_INT (high);
3992 *second = GEN_INT (low);
3996 *first = GEN_INT (low);
3997 *second = GEN_INT (high);
4002 /* The rule for using CONST_INT for a wider mode
4003 is that we regard the value as signed.
4004 So sign-extend it. */
4005 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
4006 if (WORDS_BIG_ENDIAN)
4018 else if (GET_CODE (value) != CONST_DOUBLE)
4020 if (WORDS_BIG_ENDIAN)
4022 *first = const0_rtx;
4028 *second = const0_rtx;
4031 else if (GET_MODE (value) == VOIDmode
4032 /* This is the old way we did CONST_DOUBLE integers. */
4033 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
4035 /* In an integer, the words are defined as most and least significant.
4036 So order them by the target's convention. */
4037 if (WORDS_BIG_ENDIAN)
4039 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
4040 *second = GEN_INT (CONST_DOUBLE_LOW (value));
4044 *first = GEN_INT (CONST_DOUBLE_LOW (value));
4045 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
4050 #ifdef REAL_ARITHMETIC
4053 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
4055 /* Note, this converts the REAL_VALUE_TYPE to the target's
4056 format, splits up the floating point double and outputs
4057 exactly 32 bits of it into each of l[0] and l[1] --
4058 not necessarily BITS_PER_WORD bits. */
4059 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
4061 /* If 32 bits is an entire word for the target, but not for the host,
4062 then sign-extend on the host so that the number will look the same
4063 way on the host that it would on the target. See for instance
4064 simplify_unary_operation. The #if is needed to avoid compiler
4067 #if HOST_BITS_PER_LONG > 32
4068 if (BITS_PER_WORD < HOST_BITS_PER_LONG && BITS_PER_WORD == 32)
4070 if (l[0] & ((long) 1 << 31))
4071 l[0] |= ((long) (-1) << 32);
4072 if (l[1] & ((long) 1 << 31))
4073 l[1] |= ((long) (-1) << 32);
4077 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
4078 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
4080 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
4081 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
4082 && ! flag_pretend_float)
4086 #ifdef HOST_WORDS_BIG_ENDIAN
4093 /* Host and target agree => no need to swap. */
4094 *first = GEN_INT (CONST_DOUBLE_LOW (value));
4095 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
4099 *second = GEN_INT (CONST_DOUBLE_LOW (value));
4100 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
4102 #endif /* no REAL_ARITHMETIC */
4106 /* Return nonzero if this function has no function calls. */
4114 if (profile_flag || profile_block_flag || profile_arc_flag)
4117 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4119 if (GET_CODE (insn) == CALL_INSN
4120 && ! SIBLING_CALL_P (insn))
4122 if (GET_CODE (insn) == INSN
4123 && GET_CODE (PATTERN (insn)) == SEQUENCE
4124 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN
4125 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn), 0, 0)))
4128 for (link = current_function_epilogue_delay_list;
4130 link = XEXP (link, 1))
4132 insn = XEXP (link, 0);
4134 if (GET_CODE (insn) == CALL_INSN
4135 && ! SIBLING_CALL_P (insn))
4137 if (GET_CODE (insn) == INSN
4138 && GET_CODE (PATTERN (insn)) == SEQUENCE
4139 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN
4140 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn), 0, 0)))
4147 /* On some machines, a function with no call insns
4148 can run faster if it doesn't create its own register window.
4149 When output, the leaf function should use only the "output"
4150 registers. Ordinarily, the function would be compiled to use
4151 the "input" registers to find its arguments; it is a candidate
4152 for leaf treatment if it uses only the "input" registers.
4153 Leaf function treatment means renumbering so the function
4154 uses the "output" registers instead. */
4156 #ifdef LEAF_REGISTERS
4158 /* Return 1 if this function uses only the registers that can be
4159 safely renumbered. */
4162 only_leaf_regs_used ()
4165 char *permitted_reg_in_leaf_functions = LEAF_REGISTERS;
4167 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4168 if ((regs_ever_live[i] || global_regs[i])
4169 && ! permitted_reg_in_leaf_functions[i])
4172 if (current_function_uses_pic_offset_table
4173 && pic_offset_table_rtx != 0
4174 && GET_CODE (pic_offset_table_rtx) == REG
4175 && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4181 /* Scan all instructions and renumber all registers into those
4182 available in leaf functions. */
4185 leaf_renumber_regs (first)
4190 /* Renumber only the actual patterns.
4191 The reg-notes can contain frame pointer refs,
4192 and renumbering them could crash, and should not be needed. */
4193 for (insn = first; insn; insn = NEXT_INSN (insn))
4195 leaf_renumber_regs_insn (PATTERN (insn));
4196 for (insn = current_function_epilogue_delay_list;
4198 insn = XEXP (insn, 1))
4199 if (INSN_P (XEXP (insn, 0)))
4200 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
4203 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4204 available in leaf functions. */
4207 leaf_renumber_regs_insn (in_rtx)
4208 register rtx in_rtx;
4211 register const char *format_ptr;
4216 /* Renumber all input-registers into output-registers.
4217 renumbered_regs would be 1 for an output-register;
4220 if (GET_CODE (in_rtx) == REG)
4224 /* Don't renumber the same reg twice. */
4228 newreg = REGNO (in_rtx);
4229 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4230 to reach here as part of a REG_NOTE. */
4231 if (newreg >= FIRST_PSEUDO_REGISTER)
4236 newreg = LEAF_REG_REMAP (newreg);
4239 regs_ever_live[REGNO (in_rtx)] = 0;
4240 regs_ever_live[newreg] = 1;
4241 REGNO (in_rtx) = newreg;
4245 if (INSN_P (in_rtx))
4247 /* Inside a SEQUENCE, we find insns.
4248 Renumber just the patterns of these insns,
4249 just as we do for the top-level insns. */
4250 leaf_renumber_regs_insn (PATTERN (in_rtx));
4254 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
4256 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
4257 switch (*format_ptr++)
4260 leaf_renumber_regs_insn (XEXP (in_rtx, i));
4264 if (NULL != XVEC (in_rtx, i))
4266 for (j = 0; j < XVECLEN (in_rtx, i); j++)
4267 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));