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-flags.h"
56 #include "insn-attr.h"
57 #include "insn-codes.h"
59 #include "conditions.h"
62 #include "hard-reg-set.h"
69 #include "basic-block.h"
71 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
72 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
74 #if defined (USG) || !defined (HAVE_STAB_H)
75 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
80 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
82 #ifndef ACCUMULATE_OUTGOING_ARGS
83 #define ACCUMULATE_OUTGOING_ARGS 0
86 #ifdef XCOFF_DEBUGGING_INFO
90 #ifdef DWARF_DEBUGGING_INFO
94 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
95 #include "dwarf2out.h"
98 #ifdef SDB_DEBUGGING_INFO
102 /* .stabd code for line number. */
107 /* .stabs code for included file name. */
112 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
113 null default for it to save conditionalization later. */
114 #ifndef CC_STATUS_INIT
115 #define CC_STATUS_INIT
118 /* How to start an assembler comment. */
119 #ifndef ASM_COMMENT_START
120 #define ASM_COMMENT_START ";#"
123 /* Is the given character a logical line separator for the assembler? */
124 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
125 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
128 #ifndef JUMP_TABLES_IN_TEXT_SECTION
129 #define JUMP_TABLES_IN_TEXT_SECTION 0
132 /* Last insn processed by final_scan_insn. */
133 static rtx debug_insn;
134 rtx current_output_insn;
136 /* Line number of last NOTE. */
137 static int last_linenum;
139 /* Highest line number in current block. */
140 static int high_block_linenum;
142 /* Likewise for function. */
143 static int high_function_linenum;
145 /* Filename of last NOTE. */
146 static const char *last_filename;
148 /* Number of basic blocks seen so far;
149 used if profile_block_flag is set. */
150 static int count_basic_blocks;
152 /* Number of instrumented arcs when profile_arc_flag is set. */
153 extern int count_instrumented_edges;
155 extern int length_unit_log; /* This is defined in insn-attrtab.c. */
157 /* Nonzero while outputting an `asm' with operands.
158 This means that inconsistencies are the user's fault, so don't abort.
159 The precise value is the insn being output, to pass to error_for_asm. */
160 static rtx this_is_asm_operands;
162 /* Number of operands of this insn, for an `asm' with operands. */
163 static unsigned int insn_noperands;
165 /* Compare optimization flag. */
167 static rtx last_ignored_compare = 0;
169 /* Flag indicating this insn is the start of a new basic block. */
171 static int new_block = 1;
173 /* Assign a unique number to each insn that is output.
174 This can be used to generate unique local labels. */
176 static int insn_counter = 0;
179 /* This variable contains machine-dependent flags (defined in tm.h)
180 set and examined by output routines
181 that describe how to interpret the condition codes properly. */
185 /* During output of an insn, this contains a copy of cc_status
186 from before the insn. */
188 CC_STATUS cc_prev_status;
191 /* Indexed by hardware reg number, is 1 if that register is ever
192 used in the current function.
194 In life_analysis, or in stupid_life_analysis, this is set
195 up to record the hard regs used explicitly. Reload adds
196 in the hard regs used for holding pseudo regs. Final uses
197 it to generate the code in the function prologue and epilogue
198 to save and restore registers as needed. */
200 char regs_ever_live[FIRST_PSEUDO_REGISTER];
202 /* Nonzero means current function must be given a frame pointer.
203 Set in stmt.c if anything is allocated on the stack there.
204 Set in reload1.c if anything is allocated on the stack there. */
206 int frame_pointer_needed;
208 /* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen. */
210 static int block_depth;
212 /* Nonzero if have enabled APP processing of our assembler output. */
216 /* If we are outputting an insn sequence, this contains the sequence rtx.
221 #ifdef ASSEMBLER_DIALECT
223 /* Number of the assembler dialect to use, starting at 0. */
224 static int dialect_number;
227 /* Indexed by line number, nonzero if there is a note for that line. */
229 static char *line_note_exists;
231 #ifdef HAVE_conditional_execution
232 /* Nonnull if the insn currently being emitted was a COND_EXEC pattern. */
233 rtx current_insn_predicate;
236 /* Linked list to hold line numbers for each basic block. */
240 struct bb_list *next; /* pointer to next basic block */
241 int line_num; /* line number */
242 int file_label_num; /* LPBC<n> label # for stored filename */
243 int func_label_num; /* LPBC<n> label # for stored function name */
246 static struct bb_list *bb_head = 0; /* Head of basic block list */
247 static struct bb_list **bb_tail = &bb_head; /* Ptr to store next bb ptr */
248 static int bb_file_label_num = -1; /* Current label # for file */
249 static int bb_func_label_num = -1; /* Current label # for func */
251 /* Linked list to hold the strings for each file and function name output. */
255 struct bb_str *next; /* pointer to next string */
256 const char *string; /* string */
257 int label_num; /* label number */
258 int length; /* string length */
261 static struct bb_str *sbb_head = 0; /* Head of string list. */
262 static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */
263 static int sbb_label_num = 0; /* Last label used */
265 #ifdef HAVE_ATTR_length
266 static int asm_insn_count PARAMS ((rtx));
268 static void profile_function PARAMS ((FILE *));
269 static void profile_after_prologue PARAMS ((FILE *));
270 static void add_bb PARAMS ((FILE *));
271 static int add_bb_string PARAMS ((const char *, int));
272 static void output_source_line PARAMS ((FILE *, rtx));
273 static rtx walk_alter_subreg PARAMS ((rtx));
274 static void output_asm_name PARAMS ((void));
275 static void output_operand PARAMS ((rtx, int));
276 #ifdef LEAF_REGISTERS
277 static void leaf_renumber_regs PARAMS ((rtx));
280 static int alter_cond PARAMS ((rtx));
282 #ifndef ADDR_VEC_ALIGN
283 static int final_addr_vec_align PARAMS ((rtx));
285 #ifdef HAVE_ATTR_length
286 static int align_fuzz PARAMS ((rtx, rtx, int, unsigned));
289 /* Initialize data in final at the beginning of a compilation. */
292 init_final (filename)
293 const char *filename ATTRIBUTE_UNUSED;
298 #ifdef ASSEMBLER_DIALECT
299 dialect_number = ASSEMBLER_DIALECT;
303 /* Called at end of source file,
304 to output the block-profiling table for this entire compilation. */
308 const char *filename;
312 if (profile_block_flag || profile_arc_flag)
315 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
319 int long_bytes = LONG_TYPE_SIZE / BITS_PER_UNIT;
320 int pointer_bytes = POINTER_SIZE / BITS_PER_UNIT;
322 if (profile_block_flag)
323 size = long_bytes * count_basic_blocks;
325 size = long_bytes * count_instrumented_edges;
328 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
329 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
330 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
334 /* Output the main header, of 11 words:
335 0: 1 if this file is initialized, else 0.
336 1: address of file name (LPBX1).
337 2: address of table of counts (LPBX2).
338 3: number of counts in the table.
339 4: always 0, for compatibility with Sun.
341 The following are GNU extensions:
343 5: address of table of start addrs of basic blocks (LPBX3).
344 6: Number of bytes in this header.
345 7: address of table of function names (LPBX4).
346 8: address of table of line numbers (LPBX5) or 0.
347 9: address of table of file names (LPBX6) or 0.
348 10: space reserved for basic block profiling. */
350 ASM_OUTPUT_ALIGN (asm_out_file, align);
352 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
354 assemble_integer (const0_rtx, long_bytes, 1);
356 /* address of filename */
357 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
358 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
360 /* address of count table */
361 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
362 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
364 /* count of the # of basic blocks or # of instrumented arcs */
365 if (profile_block_flag)
366 assemble_integer (GEN_INT (count_basic_blocks), long_bytes, 1);
368 assemble_integer (GEN_INT (count_instrumented_edges), long_bytes, 1);
370 /* zero word (link field) */
371 assemble_integer (const0_rtx, pointer_bytes, 1);
373 /* address of basic block start address table */
374 if (profile_block_flag)
376 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
377 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
381 assemble_integer (const0_rtx, pointer_bytes, 1);
383 /* byte count for extended structure. */
384 assemble_integer (GEN_INT (11 * UNITS_PER_WORD), long_bytes, 1);
386 /* address of function name table */
387 if (profile_block_flag)
389 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
390 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
394 assemble_integer (const0_rtx, pointer_bytes, 1);
396 /* address of line number and filename tables if debugging. */
397 if (write_symbols != NO_DEBUG && profile_block_flag)
399 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
400 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
402 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
403 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
408 assemble_integer (const0_rtx, pointer_bytes, 1);
409 assemble_integer (const0_rtx, pointer_bytes, 1);
412 /* space for extension ptr (link field) */
413 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
415 /* Output the file name changing the suffix to .d for Sun tcov
417 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
419 char *cwd = getpwd ();
420 int len = strlen (filename) + strlen (cwd) + 1;
421 char *data_file = (char *) alloca (len + 4);
423 strcpy (data_file, cwd);
424 strcat (data_file, "/");
425 strcat (data_file, filename);
426 strip_off_ending (data_file, len);
427 if (profile_block_flag)
428 strcat (data_file, ".d");
430 strcat (data_file, ".da");
431 assemble_string (data_file, strlen (data_file) + 1);
434 /* Make space for the table of counts. */
437 /* Realign data section. */
438 ASM_OUTPUT_ALIGN (asm_out_file, align);
439 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
441 assemble_zeros (size);
445 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
446 #ifdef ASM_OUTPUT_SHARED_LOCAL
447 if (flag_shared_data)
448 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
451 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
452 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name,
453 size, BIGGEST_ALIGNMENT);
455 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
456 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
459 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
464 /* Output any basic block strings */
465 if (profile_block_flag)
467 readonly_data_section ();
470 ASM_OUTPUT_ALIGN (asm_out_file, align);
471 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
473 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC",
475 assemble_string (sptr->string, sptr->length);
480 /* Output the table of addresses. */
481 if (profile_block_flag)
483 /* Realign in new section */
484 ASM_OUTPUT_ALIGN (asm_out_file, align);
485 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
486 for (i = 0; i < count_basic_blocks; i++)
488 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
489 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
494 /* Output the table of function names. */
495 if (profile_block_flag)
497 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
498 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
500 if (ptr->func_label_num >= 0)
502 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
503 ptr->func_label_num);
504 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
508 assemble_integer (const0_rtx, pointer_bytes, 1);
511 for (; i < count_basic_blocks; i++)
512 assemble_integer (const0_rtx, pointer_bytes, 1);
515 if (write_symbols != NO_DEBUG && profile_block_flag)
517 /* Output the table of line numbers. */
518 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
519 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
520 assemble_integer (GEN_INT (ptr->line_num), long_bytes, 1);
522 for (; i < count_basic_blocks; i++)
523 assemble_integer (const0_rtx, long_bytes, 1);
525 /* Output the table of file names. */
526 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
527 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
529 if (ptr->file_label_num >= 0)
531 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
532 ptr->file_label_num);
533 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
537 assemble_integer (const0_rtx, pointer_bytes, 1);
540 for (; i < count_basic_blocks; i++)
541 assemble_integer (const0_rtx, pointer_bytes, 1);
544 /* End with the address of the table of addresses,
545 so we can find it easily, as the last word in the file's text. */
546 if (profile_block_flag)
548 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
549 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
555 /* Enable APP processing of subsequent output.
556 Used before the output from an `asm' statement. */
563 fputs (ASM_APP_ON, asm_out_file);
568 /* Disable APP processing of subsequent output.
569 Called from varasm.c before most kinds of output. */
576 fputs (ASM_APP_OFF, asm_out_file);
581 /* Return the number of slots filled in the current
582 delayed branch sequence (we don't count the insn needing the
583 delay slot). Zero if not in a delayed branch sequence. */
587 dbr_sequence_length ()
589 if (final_sequence != 0)
590 return XVECLEN (final_sequence, 0) - 1;
596 /* The next two pages contain routines used to compute the length of an insn
597 and to shorten branches. */
599 /* Arrays for insn lengths, and addresses. The latter is referenced by
600 `insn_current_length'. */
602 static short *insn_lengths;
604 #ifdef HAVE_ATTR_length
605 varray_type insn_addresses_;
608 /* Max uid for which the above arrays are valid. */
609 static int insn_lengths_max_uid;
611 /* Address of insn being processed. Used by `insn_current_length'. */
612 int insn_current_address;
614 /* Address of insn being processed in previous iteration. */
615 int insn_last_address;
617 /* konwn invariant alignment of insn being processed. */
618 int insn_current_align;
620 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
621 gives the next following alignment insn that increases the known
622 alignment, or NULL_RTX if there is no such insn.
623 For any alignment obtained this way, we can again index uid_align with
624 its uid to obtain the next following align that in turn increases the
625 alignment, till we reach NULL_RTX; the sequence obtained this way
626 for each insn we'll call the alignment chain of this insn in the following
629 struct label_alignment
635 static rtx *uid_align;
636 static int *uid_shuid;
637 static struct label_alignment *label_align;
639 /* Indicate that branch shortening hasn't yet been done. */
658 insn_lengths_max_uid = 0;
660 #ifdef HAVE_ATTR_length
661 INSN_ADDRESSES_FREE ();
670 /* Obtain the current length of an insn. If branch shortening has been done,
671 get its actual length. Otherwise, get its maximum length. */
674 get_attr_length (insn)
675 rtx insn ATTRIBUTE_UNUSED;
677 #ifdef HAVE_ATTR_length
682 if (insn_lengths_max_uid > INSN_UID (insn))
683 return insn_lengths[INSN_UID (insn)];
685 switch (GET_CODE (insn))
693 length = insn_default_length (insn);
697 body = PATTERN (insn);
698 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
700 /* Alignment is machine-dependent and should be handled by
704 length = insn_default_length (insn);
708 body = PATTERN (insn);
709 if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
712 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
713 length = asm_insn_count (body) * insn_default_length (insn);
714 else if (GET_CODE (body) == SEQUENCE)
715 for (i = 0; i < XVECLEN (body, 0); i++)
716 length += get_attr_length (XVECEXP (body, 0, i));
718 length = insn_default_length (insn);
725 #ifdef ADJUST_INSN_LENGTH
726 ADJUST_INSN_LENGTH (insn, length);
729 #else /* not HAVE_ATTR_length */
731 #endif /* not HAVE_ATTR_length */
734 /* Code to handle alignment inside shorten_branches. */
736 /* Here is an explanation how the algorithm in align_fuzz can give
739 Call a sequence of instructions beginning with alignment point X
740 and continuing until the next alignment point `block X'. When `X'
741 is used in an expression, it means the alignment value of the
744 Call the distance between the start of the first insn of block X, and
745 the end of the last insn of block X `IX', for the `inner size of X'.
746 This is clearly the sum of the instruction lengths.
748 Likewise with the next alignment-delimited block following X, which we
751 Call the distance between the start of the first insn of block X, and
752 the start of the first insn of block Y `OX', for the `outer size of X'.
754 The estimated padding is then OX - IX.
756 OX can be safely estimated as
761 OX = round_up(IX, X) + Y - X
763 Clearly est(IX) >= real(IX), because that only depends on the
764 instruction lengths, and those being overestimated is a given.
766 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
767 we needn't worry about that when thinking about OX.
769 When X >= Y, the alignment provided by Y adds no uncertainty factor
770 for branch ranges starting before X, so we can just round what we have.
771 But when X < Y, we don't know anything about the, so to speak,
772 `middle bits', so we have to assume the worst when aligning up from an
773 address mod X to one mod Y, which is Y - X. */
776 #define LABEL_ALIGN(LABEL) align_labels_log
779 #ifndef LABEL_ALIGN_MAX_SKIP
780 #define LABEL_ALIGN_MAX_SKIP (align_labels-1)
784 #define LOOP_ALIGN(LABEL) align_loops_log
787 #ifndef LOOP_ALIGN_MAX_SKIP
788 #define LOOP_ALIGN_MAX_SKIP (align_loops-1)
791 #ifndef LABEL_ALIGN_AFTER_BARRIER
792 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) align_jumps_log
795 #ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
796 #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP (align_jumps-1)
799 #ifndef ADDR_VEC_ALIGN
801 final_addr_vec_align (addr_vec)
804 int align = GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec)));
806 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
807 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
808 return exact_log2 (align);
812 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
815 #ifndef INSN_LENGTH_ALIGNMENT
816 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
819 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
821 static int min_labelno, max_labelno;
823 #define LABEL_TO_ALIGNMENT(LABEL) \
824 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
826 #define LABEL_TO_MAX_SKIP(LABEL) \
827 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
829 /* For the benefit of port specific code do this also as a function. */
832 label_to_alignment (label)
835 return LABEL_TO_ALIGNMENT (label);
838 #ifdef HAVE_ATTR_length
839 /* The differences in addresses
840 between a branch and its target might grow or shrink depending on
841 the alignment the start insn of the range (the branch for a forward
842 branch or the label for a backward branch) starts out on; if these
843 differences are used naively, they can even oscillate infinitely.
844 We therefore want to compute a 'worst case' address difference that
845 is independent of the alignment the start insn of the range end
846 up on, and that is at least as large as the actual difference.
847 The function align_fuzz calculates the amount we have to add to the
848 naively computed difference, by traversing the part of the alignment
849 chain of the start insn of the range that is in front of the end insn
850 of the range, and considering for each alignment the maximum amount
851 that it might contribute to a size increase.
853 For casesi tables, we also want to know worst case minimum amounts of
854 address difference, in case a machine description wants to introduce
855 some common offset that is added to all offsets in a table.
856 For this purpose, align_fuzz with a growth argument of 0 comuptes the
857 appropriate adjustment. */
859 /* Compute the maximum delta by which the difference of the addresses of
860 START and END might grow / shrink due to a different address for start
861 which changes the size of alignment insns between START and END.
862 KNOWN_ALIGN_LOG is the alignment known for START.
863 GROWTH should be ~0 if the objective is to compute potential code size
864 increase, and 0 if the objective is to compute potential shrink.
865 The return value is undefined for any other value of GROWTH. */
868 align_fuzz (start, end, known_align_log, growth)
873 int uid = INSN_UID (start);
875 int known_align = 1 << known_align_log;
876 int end_shuid = INSN_SHUID (end);
879 for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
881 int align_addr, new_align;
883 uid = INSN_UID (align_label);
884 align_addr = INSN_ADDRESSES (uid) - insn_lengths[uid];
885 if (uid_shuid[uid] > end_shuid)
887 known_align_log = LABEL_TO_ALIGNMENT (align_label);
888 new_align = 1 << known_align_log;
889 if (new_align < known_align)
891 fuzz += (-align_addr ^ growth) & (new_align - known_align);
892 known_align = new_align;
897 /* Compute a worst-case reference address of a branch so that it
898 can be safely used in the presence of aligned labels. Since the
899 size of the branch itself is unknown, the size of the branch is
900 not included in the range. I.e. for a forward branch, the reference
901 address is the end address of the branch as known from the previous
902 branch shortening pass, minus a value to account for possible size
903 increase due to alignment. For a backward branch, it is the start
904 address of the branch as known from the current pass, plus a value
905 to account for possible size increase due to alignment.
906 NB.: Therefore, the maximum offset allowed for backward branches needs
907 to exclude the branch size. */
910 insn_current_reference_address (branch)
916 if (! INSN_ADDRESSES_SET_P ())
919 seq = NEXT_INSN (PREV_INSN (branch));
920 seq_uid = INSN_UID (seq);
921 if (GET_CODE (branch) != JUMP_INSN)
922 /* This can happen for example on the PA; the objective is to know the
923 offset to address something in front of the start of the function.
924 Thus, we can treat it like a backward branch.
925 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
926 any alignment we'd encounter, so we skip the call to align_fuzz. */
927 return insn_current_address;
928 dest = JUMP_LABEL (branch);
930 /* BRANCH has no proper alignment chain set, so use SEQ.
931 BRANCH also has no INSN_SHUID. */
932 if (INSN_SHUID (seq) < INSN_SHUID (dest))
934 /* Forward branch. */
935 return (insn_last_address + insn_lengths[seq_uid]
936 - align_fuzz (seq, dest, length_unit_log, ~0));
940 /* Backward branch. */
941 return (insn_current_address
942 + align_fuzz (dest, seq, length_unit_log, ~0));
945 #endif /* HAVE_ATTR_length */
947 /* Make a pass over all insns and compute their actual lengths by shortening
948 any branches of variable length if possible. */
950 /* Give a default value for the lowest address in a function. */
952 #ifndef FIRST_INSN_ADDRESS
953 #define FIRST_INSN_ADDRESS 0
956 /* shorten_branches might be called multiple times: for example, the SH
957 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
958 In order to do this, it needs proper length information, which it obtains
959 by calling shorten_branches. This cannot be collapsed with
960 shorten_branches itself into a single pass unless we also want to intergate
961 reorg.c, since the branch splitting exposes new instructions with delay
965 shorten_branches (first)
966 rtx first ATTRIBUTE_UNUSED;
973 #ifdef HAVE_ATTR_length
974 #define MAX_CODE_ALIGN 16
976 int something_changed = 1;
977 char *varying_length;
980 rtx align_tab[MAX_CODE_ALIGN];
982 /* In order to make sure that all instructions have valid length info,
983 we must split them before we compute the address/length info. */
985 for (insn = NEXT_INSN (first); insn; insn = NEXT_INSN (insn))
989 /* Don't split the insn if it has been deleted. */
990 if (! INSN_DELETED_P (old))
991 insn = try_split (PATTERN (old), old, 1);
992 /* When not optimizing, the old insn will be still left around
993 with only the 'deleted' bit set. Transform it into a note
994 to avoid confusion of subsequent processing. */
995 if (INSN_DELETED_P (old))
997 PUT_CODE (old, NOTE);
998 NOTE_LINE_NUMBER (old) = NOTE_INSN_DELETED;
999 NOTE_SOURCE_FILE (old) = 0;
1004 /* We must do some computations even when not actually shortening, in
1005 order to get the alignment information for the labels. */
1007 init_insn_lengths ();
1009 /* Compute maximum UID and allocate label_align / uid_shuid. */
1010 max_uid = get_max_uid ();
1012 max_labelno = max_label_num ();
1013 min_labelno = get_first_label_num ();
1014 label_align = (struct label_alignment *)
1015 xcalloc ((max_labelno - min_labelno + 1), sizeof (struct label_alignment));
1017 uid_shuid = (int *) xmalloc (max_uid * sizeof *uid_shuid);
1019 /* Initialize label_align and set up uid_shuid to be strictly
1020 monotonically rising with insn order. */
1021 /* We use max_log here to keep track of the maximum alignment we want to
1022 impose on the next CODE_LABEL (or the current one if we are processing
1023 the CODE_LABEL itself). */
1028 for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
1032 INSN_SHUID (insn) = i++;
1035 /* reorg might make the first insn of a loop being run once only,
1036 and delete the label in front of it. Then we want to apply
1037 the loop alignment to the new label created by reorg, which
1038 is separated by the former loop start insn from the
1039 NOTE_INSN_LOOP_BEG. */
1041 else if (GET_CODE (insn) == CODE_LABEL)
1045 log = LABEL_ALIGN (insn);
1049 max_skip = LABEL_ALIGN_MAX_SKIP;
1051 next = NEXT_INSN (insn);
1052 /* ADDR_VECs only take room if read-only data goes into the text
1054 if (JUMP_TABLES_IN_TEXT_SECTION
1055 #if !defined(READONLY_DATA_SECTION)
1059 if (next && GET_CODE (next) == JUMP_INSN)
1061 rtx nextbody = PATTERN (next);
1062 if (GET_CODE (nextbody) == ADDR_VEC
1063 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1065 log = ADDR_VEC_ALIGN (next);
1069 max_skip = LABEL_ALIGN_MAX_SKIP;
1073 LABEL_TO_ALIGNMENT (insn) = max_log;
1074 LABEL_TO_MAX_SKIP (insn) = max_skip;
1078 else if (GET_CODE (insn) == BARRIER)
1082 for (label = insn; label && ! INSN_P (label);
1083 label = NEXT_INSN (label))
1084 if (GET_CODE (label) == CODE_LABEL)
1086 log = LABEL_ALIGN_AFTER_BARRIER (insn);
1090 max_skip = LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP;
1095 /* Again, we allow NOTE_INSN_LOOP_BEG - INSN - CODE_LABEL
1096 sequences in order to handle reorg output efficiently. */
1097 else if (GET_CODE (insn) == NOTE
1098 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
1103 /* Search for the label that starts the loop.
1104 Don't skip past the end of the loop, since that could
1105 lead to putting an alignment where it does not belong.
1106 However, a label after a nested (non-)loop would be OK. */
1107 for (label = insn; label; label = NEXT_INSN (label))
1109 if (GET_CODE (label) == NOTE
1110 && NOTE_LINE_NUMBER (label) == NOTE_INSN_LOOP_BEG)
1112 else if (GET_CODE (label) == NOTE
1113 && NOTE_LINE_NUMBER (label) == NOTE_INSN_LOOP_END
1116 else if (GET_CODE (label) == CODE_LABEL)
1118 log = LOOP_ALIGN (label);
1122 max_skip = LOOP_ALIGN_MAX_SKIP;
1131 #ifdef HAVE_ATTR_length
1133 /* Allocate the rest of the arrays. */
1134 insn_lengths = (short *) xmalloc (max_uid * sizeof (short));
1135 insn_lengths_max_uid = max_uid;
1136 /* Syntax errors can lead to labels being outside of the main insn stream.
1137 Initialize insn_addresses, so that we get reproducible results. */
1138 INSN_ADDRESSES_ALLOC (max_uid);
1140 varying_length = (char *) xcalloc (max_uid, sizeof (char));
1142 /* Initialize uid_align. We scan instructions
1143 from end to start, and keep in align_tab[n] the last seen insn
1144 that does an alignment of at least n+1, i.e. the successor
1145 in the alignment chain for an insn that does / has a known
1147 uid_align = (rtx *) xcalloc (max_uid, sizeof *uid_align);
1149 for (i = MAX_CODE_ALIGN; --i >= 0;)
1150 align_tab[i] = NULL_RTX;
1151 seq = get_last_insn ();
1152 for (; seq; seq = PREV_INSN (seq))
1154 int uid = INSN_UID (seq);
1156 log = (GET_CODE (seq) == CODE_LABEL ? LABEL_TO_ALIGNMENT (seq) : 0);
1157 uid_align[uid] = align_tab[0];
1160 /* Found an alignment label. */
1161 uid_align[uid] = align_tab[log];
1162 for (i = log - 1; i >= 0; i--)
1166 #ifdef CASE_VECTOR_SHORTEN_MODE
1169 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1172 int min_shuid = INSN_SHUID (get_insns ()) - 1;
1173 int max_shuid = INSN_SHUID (get_last_insn ()) + 1;
1176 for (insn = first; insn != 0; insn = NEXT_INSN (insn))
1178 rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat;
1179 int len, i, min, max, insn_shuid;
1181 addr_diff_vec_flags flags;
1183 if (GET_CODE (insn) != JUMP_INSN
1184 || GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)
1186 pat = PATTERN (insn);
1187 len = XVECLEN (pat, 1);
1190 min_align = MAX_CODE_ALIGN;
1191 for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
1193 rtx lab = XEXP (XVECEXP (pat, 1, i), 0);
1194 int shuid = INSN_SHUID (lab);
1205 if (min_align > LABEL_TO_ALIGNMENT (lab))
1206 min_align = LABEL_TO_ALIGNMENT (lab);
1208 XEXP (pat, 2) = gen_rtx_LABEL_REF (VOIDmode, min_lab);
1209 XEXP (pat, 3) = gen_rtx_LABEL_REF (VOIDmode, max_lab);
1210 insn_shuid = INSN_SHUID (insn);
1211 rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0));
1212 flags.min_align = min_align;
1213 flags.base_after_vec = rel > insn_shuid;
1214 flags.min_after_vec = min > insn_shuid;
1215 flags.max_after_vec = max > insn_shuid;
1216 flags.min_after_base = min > rel;
1217 flags.max_after_base = max > rel;
1218 ADDR_DIFF_VEC_FLAGS (pat) = flags;
1221 #endif /* CASE_VECTOR_SHORTEN_MODE */
1223 /* Compute initial lengths, addresses, and varying flags for each insn. */
1224 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1226 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1228 uid = INSN_UID (insn);
1230 insn_lengths[uid] = 0;
1232 if (GET_CODE (insn) == CODE_LABEL)
1234 int log = LABEL_TO_ALIGNMENT (insn);
1237 int align = 1 << log;
1238 int new_address = (insn_current_address + align - 1) & -align;
1239 insn_lengths[uid] = new_address - insn_current_address;
1243 INSN_ADDRESSES (uid) = insn_current_address;
1245 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
1246 || GET_CODE (insn) == CODE_LABEL)
1248 if (INSN_DELETED_P (insn))
1251 body = PATTERN (insn);
1252 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1254 /* This only takes room if read-only data goes into the text
1256 if (JUMP_TABLES_IN_TEXT_SECTION
1257 #if !defined(READONLY_DATA_SECTION)
1261 insn_lengths[uid] = (XVECLEN (body,
1262 GET_CODE (body) == ADDR_DIFF_VEC)
1263 * GET_MODE_SIZE (GET_MODE (body)));
1264 /* Alignment is handled by ADDR_VEC_ALIGN. */
1266 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
1267 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
1268 else if (GET_CODE (body) == SEQUENCE)
1271 int const_delay_slots;
1273 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
1275 const_delay_slots = 0;
1277 /* Inside a delay slot sequence, we do not do any branch shortening
1278 if the shortening could change the number of delay slots
1280 for (i = 0; i < XVECLEN (body, 0); i++)
1282 rtx inner_insn = XVECEXP (body, 0, i);
1283 int inner_uid = INSN_UID (inner_insn);
1286 if (GET_CODE (body) == ASM_INPUT
1287 || asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
1288 inner_length = (asm_insn_count (PATTERN (inner_insn))
1289 * insn_default_length (inner_insn));
1291 inner_length = insn_default_length (inner_insn);
1293 insn_lengths[inner_uid] = inner_length;
1294 if (const_delay_slots)
1296 if ((varying_length[inner_uid]
1297 = insn_variable_length_p (inner_insn)) != 0)
1298 varying_length[uid] = 1;
1299 INSN_ADDRESSES (inner_uid) = (insn_current_address
1300 + insn_lengths[uid]);
1303 varying_length[inner_uid] = 0;
1304 insn_lengths[uid] += inner_length;
1307 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
1309 insn_lengths[uid] = insn_default_length (insn);
1310 varying_length[uid] = insn_variable_length_p (insn);
1313 /* If needed, do any adjustment. */
1314 #ifdef ADJUST_INSN_LENGTH
1315 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
1316 if (insn_lengths[uid] < 0)
1317 fatal_insn ("Negative insn length", insn);
1321 /* Now loop over all the insns finding varying length insns. For each,
1322 get the current insn length. If it has changed, reflect the change.
1323 When nothing changes for a full pass, we are done. */
1325 while (something_changed)
1327 something_changed = 0;
1328 insn_current_align = MAX_CODE_ALIGN - 1;
1329 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1331 insn = NEXT_INSN (insn))
1334 #ifdef ADJUST_INSN_LENGTH
1339 uid = INSN_UID (insn);
1341 if (GET_CODE (insn) == CODE_LABEL)
1343 int log = LABEL_TO_ALIGNMENT (insn);
1344 if (log > insn_current_align)
1346 int align = 1 << log;
1347 int new_address= (insn_current_address + align - 1) & -align;
1348 insn_lengths[uid] = new_address - insn_current_address;
1349 insn_current_align = log;
1350 insn_current_address = new_address;
1353 insn_lengths[uid] = 0;
1354 INSN_ADDRESSES (uid) = insn_current_address;
1358 length_align = INSN_LENGTH_ALIGNMENT (insn);
1359 if (length_align < insn_current_align)
1360 insn_current_align = length_align;
1362 insn_last_address = INSN_ADDRESSES (uid);
1363 INSN_ADDRESSES (uid) = insn_current_address;
1365 #ifdef CASE_VECTOR_SHORTEN_MODE
1366 if (optimize && GET_CODE (insn) == JUMP_INSN
1367 && GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
1369 rtx body = PATTERN (insn);
1370 int old_length = insn_lengths[uid];
1371 rtx rel_lab = XEXP (XEXP (body, 0), 0);
1372 rtx min_lab = XEXP (XEXP (body, 2), 0);
1373 rtx max_lab = XEXP (XEXP (body, 3), 0);
1374 addr_diff_vec_flags flags = ADDR_DIFF_VEC_FLAGS (body);
1375 int rel_addr = INSN_ADDRESSES (INSN_UID (rel_lab));
1376 int min_addr = INSN_ADDRESSES (INSN_UID (min_lab));
1377 int max_addr = INSN_ADDRESSES (INSN_UID (max_lab));
1381 /* Try to find a known alignment for rel_lab. */
1382 for (prev = rel_lab;
1384 && ! insn_lengths[INSN_UID (prev)]
1385 && ! (varying_length[INSN_UID (prev)] & 1);
1386 prev = PREV_INSN (prev))
1387 if (varying_length[INSN_UID (prev)] & 2)
1389 rel_align = LABEL_TO_ALIGNMENT (prev);
1393 /* See the comment on addr_diff_vec_flags in rtl.h for the
1394 meaning of the flags values. base: REL_LAB vec: INSN */
1395 /* Anything after INSN has still addresses from the last
1396 pass; adjust these so that they reflect our current
1397 estimate for this pass. */
1398 if (flags.base_after_vec)
1399 rel_addr += insn_current_address - insn_last_address;
1400 if (flags.min_after_vec)
1401 min_addr += insn_current_address - insn_last_address;
1402 if (flags.max_after_vec)
1403 max_addr += insn_current_address - insn_last_address;
1404 /* We want to know the worst case, i.e. lowest possible value
1405 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1406 its offset is positive, and we have to be wary of code shrink;
1407 otherwise, it is negative, and we have to be vary of code
1409 if (flags.min_after_base)
1411 /* If INSN is between REL_LAB and MIN_LAB, the size
1412 changes we are about to make can change the alignment
1413 within the observed offset, therefore we have to break
1414 it up into two parts that are independent. */
1415 if (! flags.base_after_vec && flags.min_after_vec)
1417 min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
1418 min_addr -= align_fuzz (insn, min_lab, 0, 0);
1421 min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
1425 if (flags.base_after_vec && ! flags.min_after_vec)
1427 min_addr -= align_fuzz (min_lab, insn, 0, ~0);
1428 min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
1431 min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
1433 /* Likewise, determine the highest lowest possible value
1434 for the offset of MAX_LAB. */
1435 if (flags.max_after_base)
1437 if (! flags.base_after_vec && flags.max_after_vec)
1439 max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
1440 max_addr += align_fuzz (insn, max_lab, 0, ~0);
1443 max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
1447 if (flags.base_after_vec && ! flags.max_after_vec)
1449 max_addr += align_fuzz (max_lab, insn, 0, 0);
1450 max_addr += align_fuzz (insn, rel_lab, 0, 0);
1453 max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
1455 PUT_MODE (body, CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
1456 max_addr - rel_addr,
1458 if (JUMP_TABLES_IN_TEXT_SECTION
1459 #if !defined(READONLY_DATA_SECTION)
1465 = (XVECLEN (body, 1) * GET_MODE_SIZE (GET_MODE (body)));
1466 insn_current_address += insn_lengths[uid];
1467 if (insn_lengths[uid] != old_length)
1468 something_changed = 1;
1473 #endif /* CASE_VECTOR_SHORTEN_MODE */
1475 if (! (varying_length[uid]))
1477 insn_current_address += insn_lengths[uid];
1480 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
1484 body = PATTERN (insn);
1486 for (i = 0; i < XVECLEN (body, 0); i++)
1488 rtx inner_insn = XVECEXP (body, 0, i);
1489 int inner_uid = INSN_UID (inner_insn);
1492 INSN_ADDRESSES (inner_uid) = insn_current_address;
1494 /* insn_current_length returns 0 for insns with a
1495 non-varying length. */
1496 if (! varying_length[inner_uid])
1497 inner_length = insn_lengths[inner_uid];
1499 inner_length = insn_current_length (inner_insn);
1501 if (inner_length != insn_lengths[inner_uid])
1503 insn_lengths[inner_uid] = inner_length;
1504 something_changed = 1;
1506 insn_current_address += insn_lengths[inner_uid];
1507 new_length += inner_length;
1512 new_length = insn_current_length (insn);
1513 insn_current_address += new_length;
1516 #ifdef ADJUST_INSN_LENGTH
1517 /* If needed, do any adjustment. */
1518 tmp_length = new_length;
1519 ADJUST_INSN_LENGTH (insn, new_length);
1520 insn_current_address += (new_length - tmp_length);
1523 if (new_length != insn_lengths[uid])
1525 insn_lengths[uid] = new_length;
1526 something_changed = 1;
1529 /* For a non-optimizing compile, do only a single pass. */
1534 free (varying_length);
1536 #endif /* HAVE_ATTR_length */
1539 #ifdef HAVE_ATTR_length
1540 /* Given the body of an INSN known to be generated by an ASM statement, return
1541 the number of machine instructions likely to be generated for this insn.
1542 This is used to compute its length. */
1545 asm_insn_count (body)
1548 const char *template;
1551 if (GET_CODE (body) == ASM_INPUT)
1552 template = XSTR (body, 0);
1554 template = decode_asm_operands (body, NULL_PTR, NULL_PTR,
1555 NULL_PTR, NULL_PTR);
1557 for (; *template; template++)
1558 if (IS_ASM_LOGICAL_LINE_SEPARATOR (*template) || *template == '\n')
1565 /* Output assembler code for the start of a function,
1566 and initialize some of the variables in this file
1567 for the new function. The label for the function and associated
1568 assembler pseudo-ops have already been output in `assemble_start_function'.
1570 FIRST is the first insn of the rtl for the function being compiled.
1571 FILE is the file to write assembler code to.
1572 OPTIMIZE is nonzero if we should eliminate redundant
1573 test and compare insns. */
1576 final_start_function (first, file, optimize)
1579 int optimize ATTRIBUTE_UNUSED;
1583 this_is_asm_operands = 0;
1585 #ifdef NON_SAVING_SETJMP
1586 /* A function that calls setjmp should save and restore all the
1587 call-saved registers on a system where longjmp clobbers them. */
1588 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
1592 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1593 if (!call_used_regs[i])
1594 regs_ever_live[i] = 1;
1598 /* Initial line number is supposed to be output
1599 before the function's prologue and label
1600 so that the function's address will not appear to be
1601 in the last statement of the preceding function. */
1602 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1603 last_linenum = high_block_linenum = high_function_linenum
1604 = NOTE_LINE_NUMBER (first);
1606 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1607 /* Output DWARF definition of the function. */
1608 if (dwarf2out_do_frame ())
1609 dwarf2out_begin_prologue ();
1611 current_function_func_begin_label = 0;
1614 /* For SDB and XCOFF, the function beginning must be marked between
1615 the function label and the prologue. We always need this, even when
1616 -g1 was used. Defer on MIPS systems so that parameter descriptions
1617 follow function entry. */
1618 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
1619 if (write_symbols == SDB_DEBUG)
1620 sdbout_begin_function (last_linenum);
1623 #ifdef XCOFF_DEBUGGING_INFO
1624 if (write_symbols == XCOFF_DEBUG)
1625 xcoffout_begin_function (file, last_linenum);
1628 /* But only output line number for other debug info types if -g2
1630 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1631 output_source_line (file, first);
1633 #ifdef LEAF_REG_REMAP
1634 if (current_function_uses_only_leaf_regs)
1635 leaf_renumber_regs (first);
1638 /* The Sun386i and perhaps other machines don't work right
1639 if the profiling code comes after the prologue. */
1640 #ifdef PROFILE_BEFORE_PROLOGUE
1642 profile_function (file);
1643 #endif /* PROFILE_BEFORE_PROLOGUE */
1645 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1646 if (dwarf2out_do_frame ())
1647 dwarf2out_frame_debug (NULL_RTX);
1650 /* If debugging, assign block numbers to all of the blocks in this
1654 number_blocks (current_function_decl);
1655 remove_unnecessary_notes ();
1656 /* We never actually put out begin/end notes for the top-level
1657 block in the function. But, conceptually, that block is
1659 TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl)) = 1;
1662 #ifdef FUNCTION_PROLOGUE
1663 /* First output the function prologue: code to set up the stack frame. */
1664 FUNCTION_PROLOGUE (file, get_frame_size ());
1667 /* If the machine represents the prologue as RTL, the profiling code must
1668 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1669 #ifdef HAVE_prologue
1670 if (! HAVE_prologue)
1672 profile_after_prologue (file);
1676 /* If we are doing basic block profiling, remember a printable version
1677 of the function name. */
1678 if (profile_block_flag)
1681 add_bb_string ((*decl_printable_name) (current_function_decl, 2),
1687 profile_after_prologue (file)
1688 FILE *file ATTRIBUTE_UNUSED;
1690 #ifdef FUNCTION_BLOCK_PROFILER
1691 if (profile_block_flag)
1693 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
1695 #endif /* FUNCTION_BLOCK_PROFILER */
1697 #ifndef PROFILE_BEFORE_PROLOGUE
1699 profile_function (file);
1700 #endif /* not PROFILE_BEFORE_PROLOGUE */
1704 profile_function (file)
1707 #ifndef NO_PROFILE_COUNTERS
1708 int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1710 #if defined(ASM_OUTPUT_REG_PUSH)
1711 #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1712 int sval = current_function_returns_struct;
1714 #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1715 int cxt = current_function_needs_context;
1717 #endif /* ASM_OUTPUT_REG_PUSH */
1719 #ifndef NO_PROFILE_COUNTERS
1721 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1722 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
1723 assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, 1);
1726 function_section (current_function_decl);
1728 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1730 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
1732 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1735 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1740 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1742 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1744 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1747 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1752 FUNCTION_PROFILER (file, profile_label_no);
1754 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1756 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1758 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1761 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1766 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1768 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1770 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1773 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1779 /* Output assembler code for the end of a function.
1780 For clarity, args are same as those of `final_start_function'
1781 even though not all of them are needed. */
1784 final_end_function (first, file, optimize)
1785 rtx first ATTRIBUTE_UNUSED;
1786 FILE *file ATTRIBUTE_UNUSED;
1787 int optimize ATTRIBUTE_UNUSED;
1791 #ifdef SDB_DEBUGGING_INFO
1792 if (write_symbols == SDB_DEBUG)
1793 sdbout_end_function (high_function_linenum);
1796 #ifdef DWARF_DEBUGGING_INFO
1797 if (write_symbols == DWARF_DEBUG)
1798 dwarfout_end_function ();
1801 #ifdef XCOFF_DEBUGGING_INFO
1802 if (write_symbols == XCOFF_DEBUG)
1803 xcoffout_end_function (file, high_function_linenum);
1806 #ifdef FUNCTION_EPILOGUE
1807 /* Finally, output the function epilogue:
1808 code to restore the stack frame and return to the caller. */
1809 FUNCTION_EPILOGUE (file, get_frame_size ());
1812 #ifdef SDB_DEBUGGING_INFO
1813 if (write_symbols == SDB_DEBUG)
1814 sdbout_end_epilogue ();
1817 #ifdef DWARF_DEBUGGING_INFO
1818 if (write_symbols == DWARF_DEBUG)
1819 dwarfout_end_epilogue ();
1822 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1823 if (dwarf2out_do_frame ())
1824 dwarf2out_end_epilogue ();
1827 #ifdef XCOFF_DEBUGGING_INFO
1828 if (write_symbols == XCOFF_DEBUG)
1829 xcoffout_end_epilogue (file);
1832 bb_func_label_num = -1; /* not in function, nuke label # */
1834 #ifdef IA64_UNWIND_INFO
1835 output_function_exception_table ();
1838 /* If FUNCTION_EPILOGUE is not defined, then the function body
1839 itself contains return instructions wherever needed. */
1842 /* Add a block to the linked list that remembers the current line/file/function
1843 for basic block profiling. Emit the label in front of the basic block and
1844 the instructions that increment the count field. */
1850 struct bb_list *ptr =
1851 (struct bb_list *) permalloc (sizeof (struct bb_list));
1853 /* Add basic block to linked list. */
1855 ptr->line_num = last_linenum;
1856 ptr->file_label_num = bb_file_label_num;
1857 ptr->func_label_num = bb_func_label_num;
1859 bb_tail = &ptr->next;
1861 /* Enable the table of basic-block use counts
1862 to point at the code it applies to. */
1863 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1865 /* Before first insn of this basic block, increment the
1866 count of times it was entered. */
1867 #ifdef BLOCK_PROFILER
1868 BLOCK_PROFILER (file, count_basic_blocks);
1875 count_basic_blocks++;
1878 /* Add a string to be used for basic block profiling. */
1881 add_bb_string (string, perm_p)
1886 struct bb_str *ptr = 0;
1890 string = "<unknown>";
1894 /* Allocate a new string if the current string isn't permanent. If
1895 the string is permanent search for the same string in other
1898 len = strlen (string) + 1;
1901 char *p = (char *) permalloc (len);
1902 memcpy (p, string, len);
1906 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1907 if (ptr->string == string)
1910 /* Allocate a new string block if we need to. */
1913 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1916 ptr->label_num = sbb_label_num++;
1917 ptr->string = string;
1919 sbb_tail = &ptr->next;
1922 return ptr->label_num;
1925 /* Output assembler code for some insns: all or part of a function.
1926 For description of args, see `final_start_function', above.
1928 PRESCAN is 1 if we are not really outputting,
1929 just scanning as if we were outputting.
1930 Prescanning deletes and rearranges insns just like ordinary output.
1931 PRESCAN is -2 if we are outputting after having prescanned.
1932 In this case, don't try to delete or rearrange insns
1933 because that has already been done.
1934 Prescanning is done only on certain machines. */
1937 final (first, file, optimize, prescan)
1947 last_ignored_compare = 0;
1950 check_exception_handler_labels ();
1952 /* Make a map indicating which line numbers appear in this function.
1953 When producing SDB debugging info, delete troublesome line number
1954 notes from inlined functions in other files as well as duplicate
1955 line number notes. */
1956 #ifdef SDB_DEBUGGING_INFO
1957 if (write_symbols == SDB_DEBUG)
1960 for (insn = first; insn; insn = NEXT_INSN (insn))
1961 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1963 if ((RTX_INTEGRATED_P (insn)
1964 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1966 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1967 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1969 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1970 NOTE_SOURCE_FILE (insn) = 0;
1974 if (NOTE_LINE_NUMBER (insn) > max_line)
1975 max_line = NOTE_LINE_NUMBER (insn);
1981 for (insn = first; insn; insn = NEXT_INSN (insn))
1982 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1983 max_line = NOTE_LINE_NUMBER (insn);
1986 line_note_exists = (char *) xcalloc (max_line + 1, sizeof (char));
1988 for (insn = first; insn; insn = NEXT_INSN (insn))
1990 if (INSN_UID (insn) > max_uid) /* find largest UID */
1991 max_uid = INSN_UID (insn);
1992 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1993 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
1995 /* If CC tracking across branches is enabled, record the insn which
1996 jumps to each branch only reached from one place. */
1997 if (optimize && GET_CODE (insn) == JUMP_INSN)
1999 rtx lab = JUMP_LABEL (insn);
2000 if (lab && LABEL_NUSES (lab) == 1)
2002 LABEL_REFS (lab) = insn;
2008 /* Initialize insn_eh_region table if eh is being used. */
2010 init_insn_eh_region (first, max_uid);
2016 /* Output the insns. */
2017 for (insn = NEXT_INSN (first); insn;)
2019 #ifdef HAVE_ATTR_length
2020 if (INSN_UID (insn) >= INSN_ADDRESSES_SIZE ())
2023 /* Irritatingly, the reg-stack pass is creating new instructions
2024 and because of REG_DEAD note abuse it has to run after
2025 shorten_branches. Fake address of -1 then. */
2026 insn_current_address = -1;
2028 /* This can be triggered by bugs elsewhere in the compiler if
2029 new insns are created after init_insn_lengths is called. */
2034 insn_current_address = INSN_ADDRESSES (INSN_UID (insn));
2035 #endif /* HAVE_ATTR_length */
2037 insn = final_scan_insn (insn, file, optimize, prescan, 0);
2040 /* Do basic-block profiling here
2041 if the last insn was a conditional branch. */
2042 if (profile_block_flag && new_block)
2045 free_insn_eh_region ();
2046 free (line_note_exists);
2047 line_note_exists = NULL;
2051 get_insn_template (code, insn)
2055 const void *output = insn_data[code].output;
2056 switch (insn_data[code].output_format)
2058 case INSN_OUTPUT_FORMAT_SINGLE:
2059 return (const char *) output;
2060 case INSN_OUTPUT_FORMAT_MULTI:
2061 return ((const char *const *) output)[which_alternative];
2062 case INSN_OUTPUT_FORMAT_FUNCTION:
2065 return (*(insn_output_fn) output) (recog_data.operand, insn);
2072 /* The final scan for one insn, INSN.
2073 Args are same as in `final', except that INSN
2074 is the insn being scanned.
2075 Value returned is the next insn to be scanned.
2077 NOPEEPHOLES is the flag to disallow peephole processing (currently
2078 used for within delayed branch sequence output). */
2081 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
2084 int optimize ATTRIBUTE_UNUSED;
2086 int nopeepholes ATTRIBUTE_UNUSED;
2094 /* Ignore deleted insns. These can occur when we split insns (due to a
2095 template of "#") while not optimizing. */
2096 if (INSN_DELETED_P (insn))
2097 return NEXT_INSN (insn);
2099 switch (GET_CODE (insn))
2105 switch (NOTE_LINE_NUMBER (insn))
2107 case NOTE_INSN_DELETED:
2108 case NOTE_INSN_LOOP_BEG:
2109 case NOTE_INSN_LOOP_END:
2110 case NOTE_INSN_LOOP_CONT:
2111 case NOTE_INSN_LOOP_VTOP:
2112 case NOTE_INSN_FUNCTION_END:
2113 case NOTE_INSN_SETJMP:
2114 case NOTE_INSN_REPEATED_LINE_NUMBER:
2115 case NOTE_INSN_RANGE_BEG:
2116 case NOTE_INSN_RANGE_END:
2117 case NOTE_INSN_LIVE:
2118 case NOTE_INSN_EXPECTED_VALUE:
2121 case NOTE_INSN_BASIC_BLOCK:
2123 fprintf (asm_out_file, "\t%s basic block %d\n",
2124 ASM_COMMENT_START, NOTE_BASIC_BLOCK (insn)->index);
2127 case NOTE_INSN_EH_REGION_BEG:
2128 if (! exceptions_via_longjmp)
2130 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHB", NOTE_EH_HANDLER (insn));
2131 if (! flag_new_exceptions)
2132 add_eh_table_entry (NOTE_EH_HANDLER (insn));
2133 #ifdef ASM_OUTPUT_EH_REGION_BEG
2134 ASM_OUTPUT_EH_REGION_BEG (file, NOTE_EH_HANDLER (insn));
2139 case NOTE_INSN_EH_REGION_END:
2140 if (! exceptions_via_longjmp)
2142 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHE", NOTE_EH_HANDLER (insn));
2143 if (flag_new_exceptions)
2144 add_eh_table_entry (NOTE_EH_HANDLER (insn));
2145 #ifdef ASM_OUTPUT_EH_REGION_END
2146 ASM_OUTPUT_EH_REGION_END (file, NOTE_EH_HANDLER (insn));
2151 case NOTE_INSN_PROLOGUE_END:
2152 #ifdef FUNCTION_END_PROLOGUE
2153 FUNCTION_END_PROLOGUE (file);
2155 profile_after_prologue (file);
2158 case NOTE_INSN_EPILOGUE_BEG:
2159 #ifdef FUNCTION_BEGIN_EPILOGUE
2160 FUNCTION_BEGIN_EPILOGUE (file);
2164 case NOTE_INSN_FUNCTION_BEG:
2165 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
2166 /* MIPS stabs require the parameter descriptions to be after the
2167 function entry point rather than before. */
2168 if (write_symbols == SDB_DEBUG)
2171 sdbout_begin_function (last_linenum);
2174 #ifdef DWARF_DEBUGGING_INFO
2175 /* This outputs a marker where the function body starts, so it
2176 must be after the prologue. */
2177 if (write_symbols == DWARF_DEBUG)
2180 dwarfout_begin_function ();
2185 case NOTE_INSN_BLOCK_BEG:
2186 if (debug_info_level == DINFO_LEVEL_NORMAL
2187 || debug_info_level == DINFO_LEVEL_VERBOSE
2188 || write_symbols == DWARF_DEBUG
2189 || write_symbols == DWARF2_DEBUG)
2191 int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
2195 high_block_linenum = last_linenum;
2197 /* Output debugging info about the symbol-block beginning. */
2198 #ifdef SDB_DEBUGGING_INFO
2199 if (write_symbols == SDB_DEBUG)
2200 sdbout_begin_block (file, last_linenum, n);
2202 #ifdef XCOFF_DEBUGGING_INFO
2203 if (write_symbols == XCOFF_DEBUG)
2204 xcoffout_begin_block (file, last_linenum, n);
2206 #ifdef DBX_DEBUGGING_INFO
2207 if (write_symbols == DBX_DEBUG)
2208 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", n);
2210 #ifdef DWARF_DEBUGGING_INFO
2211 if (write_symbols == DWARF_DEBUG)
2212 dwarfout_begin_block (n);
2214 #ifdef DWARF2_DEBUGGING_INFO
2215 if (write_symbols == DWARF2_DEBUG)
2216 dwarf2out_begin_block (n);
2219 /* Mark this block as output. */
2220 TREE_ASM_WRITTEN (NOTE_BLOCK (insn)) = 1;
2224 case NOTE_INSN_BLOCK_END:
2225 if (debug_info_level == DINFO_LEVEL_NORMAL
2226 || debug_info_level == DINFO_LEVEL_VERBOSE
2227 || write_symbols == DWARF_DEBUG
2228 || write_symbols == DWARF2_DEBUG)
2230 int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
2234 /* End of a symbol-block. */
2236 if (block_depth < 0)
2239 #ifdef XCOFF_DEBUGGING_INFO
2240 if (write_symbols == XCOFF_DEBUG)
2241 xcoffout_end_block (file, high_block_linenum, n);
2243 #ifdef DBX_DEBUGGING_INFO
2244 if (write_symbols == DBX_DEBUG)
2245 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE", n);
2247 #ifdef SDB_DEBUGGING_INFO
2248 if (write_symbols == SDB_DEBUG)
2249 sdbout_end_block (file, high_block_linenum, n);
2251 #ifdef DWARF_DEBUGGING_INFO
2252 if (write_symbols == DWARF_DEBUG)
2253 dwarfout_end_block (n);
2255 #ifdef DWARF2_DEBUGGING_INFO
2256 if (write_symbols == DWARF2_DEBUG)
2257 dwarf2out_end_block (n);
2262 case NOTE_INSN_DELETED_LABEL:
2263 /* Emit the label. We may have deleted the CODE_LABEL because
2264 the label could be proved to be unreachable, though still
2265 referenced (in the form of having its address taken. */
2266 ASM_OUTPUT_DEBUG_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2273 if (NOTE_LINE_NUMBER (insn) <= 0)
2276 /* This note is a line-number. */
2281 /* If there is anything real after this note, output it.
2282 If another line note follows, omit this one. */
2283 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
2285 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
2288 /* These types of notes can be significant
2289 so make sure the preceding line number stays. */
2290 else if (GET_CODE (note) == NOTE
2291 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
2292 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
2293 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
2295 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
2297 /* Another line note follows; we can delete this note
2298 if no intervening line numbers have notes elsewhere. */
2300 for (num = NOTE_LINE_NUMBER (insn) + 1;
2301 num < NOTE_LINE_NUMBER (note);
2303 if (line_note_exists[num])
2306 if (num >= NOTE_LINE_NUMBER (note))
2312 /* Output this line note if it is the first or the last line
2315 output_source_line (file, insn);
2322 #if defined (DWARF2_UNWIND_INFO)
2323 /* If we push arguments, we need to check all insns for stack
2325 if (!ACCUMULATE_OUTGOING_ARGS && dwarf2out_do_frame ())
2326 dwarf2out_frame_debug (insn);
2331 /* The target port might emit labels in the output function for
2332 some insn, e.g. sh.c output_branchy_insn. */
2333 if (CODE_LABEL_NUMBER (insn) <= max_labelno)
2335 int align = LABEL_TO_ALIGNMENT (insn);
2336 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2337 int max_skip = LABEL_TO_MAX_SKIP (insn);
2340 if (align && NEXT_INSN (insn))
2341 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2342 ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip);
2344 ASM_OUTPUT_ALIGN (file, align);
2349 /* If this label is reached from only one place, set the condition
2350 codes from the instruction just before the branch. */
2352 /* Disabled because some insns set cc_status in the C output code
2353 and NOTICE_UPDATE_CC alone can set incorrect status. */
2354 if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
2356 rtx jump = LABEL_REFS (insn);
2357 rtx barrier = prev_nonnote_insn (insn);
2359 /* If the LABEL_REFS field of this label has been set to point
2360 at a branch, the predecessor of the branch is a regular
2361 insn, and that branch is the only way to reach this label,
2362 set the condition codes based on the branch and its
2364 if (barrier && GET_CODE (barrier) == BARRIER
2365 && jump && GET_CODE (jump) == JUMP_INSN
2366 && (prev = prev_nonnote_insn (jump))
2367 && GET_CODE (prev) == INSN)
2369 NOTICE_UPDATE_CC (PATTERN (prev), prev);
2370 NOTICE_UPDATE_CC (PATTERN (jump), jump);
2378 #ifdef FINAL_PRESCAN_LABEL
2379 FINAL_PRESCAN_INSN (insn, NULL_PTR, 0);
2382 #ifdef SDB_DEBUGGING_INFO
2383 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
2384 sdbout_label (insn);
2388 fputs (ASM_APP_OFF, file);
2391 if (NEXT_INSN (insn) != 0
2392 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
2394 rtx nextbody = PATTERN (NEXT_INSN (insn));
2396 /* If this label is followed by a jump-table,
2397 make sure we put the label in the read-only section. Also
2398 possibly write the label and jump table together. */
2400 if (GET_CODE (nextbody) == ADDR_VEC
2401 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
2403 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2404 /* In this case, the case vector is being moved by the
2405 target, so don't output the label at all. Leave that
2406 to the back end macros. */
2408 if (! JUMP_TABLES_IN_TEXT_SECTION)
2410 readonly_data_section ();
2411 #ifdef READONLY_DATA_SECTION
2412 ASM_OUTPUT_ALIGN (file,
2413 exact_log2 (BIGGEST_ALIGNMENT
2415 #endif /* READONLY_DATA_SECTION */
2418 function_section (current_function_decl);
2420 #ifdef ASM_OUTPUT_CASE_LABEL
2421 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
2424 if (LABEL_ALTERNATE_NAME (insn))
2425 ASM_OUTPUT_ALTERNATE_LABEL_NAME (file, insn);
2427 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2433 if (LABEL_ALTERNATE_NAME (insn))
2434 ASM_OUTPUT_ALTERNATE_LABEL_NAME (file, insn);
2436 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2441 register rtx body = PATTERN (insn);
2442 int insn_code_number;
2443 const char *template;
2448 /* An INSN, JUMP_INSN or CALL_INSN.
2449 First check for special kinds that recog doesn't recognize. */
2451 if (GET_CODE (body) == USE /* These are just declarations */
2452 || GET_CODE (body) == CLOBBER)
2456 /* If there is a REG_CC_SETTER note on this insn, it means that
2457 the setting of the condition code was done in the delay slot
2458 of the insn that branched here. So recover the cc status
2459 from the insn that set it. */
2461 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
2464 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
2465 cc_prev_status = cc_status;
2469 /* Detect insns that are really jump-tables
2470 and output them as such. */
2472 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
2474 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2475 register int vlen, idx;
2483 fputs (ASM_APP_OFF, file);
2487 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2488 if (GET_CODE (body) == ADDR_VEC)
2490 #ifdef ASM_OUTPUT_ADDR_VEC
2491 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2498 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2499 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2505 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
2506 for (idx = 0; idx < vlen; idx++)
2508 if (GET_CODE (body) == ADDR_VEC)
2510 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2511 ASM_OUTPUT_ADDR_VEC_ELT
2512 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
2519 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2520 ASM_OUTPUT_ADDR_DIFF_ELT
2523 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
2524 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
2530 #ifdef ASM_OUTPUT_CASE_END
2531 ASM_OUTPUT_CASE_END (file,
2532 CODE_LABEL_NUMBER (PREV_INSN (insn)),
2537 function_section (current_function_decl);
2542 /* Do basic-block profiling when we reach a new block.
2543 Done here to avoid jump tables. */
2544 if (profile_block_flag && new_block)
2547 if (GET_CODE (body) == ASM_INPUT)
2549 /* There's no telling what that did to the condition codes. */
2555 fputs (ASM_APP_ON, file);
2558 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
2562 /* Detect `asm' construct with operands. */
2563 if (asm_noperands (body) >= 0)
2565 unsigned int noperands = asm_noperands (body);
2566 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
2569 /* There's no telling what that did to the condition codes. */
2576 fputs (ASM_APP_ON, file);
2580 /* Get out the operand values. */
2581 string = decode_asm_operands (body, ops, NULL_PTR,
2582 NULL_PTR, NULL_PTR);
2583 /* Inhibit aborts on what would otherwise be compiler bugs. */
2584 insn_noperands = noperands;
2585 this_is_asm_operands = insn;
2587 /* Output the insn using them. */
2588 output_asm_insn (string, ops);
2589 this_is_asm_operands = 0;
2593 if (prescan <= 0 && app_on)
2595 fputs (ASM_APP_OFF, file);
2599 if (GET_CODE (body) == SEQUENCE)
2601 /* A delayed-branch sequence */
2607 final_sequence = body;
2609 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2610 force the restoration of a comparison that was previously
2611 thought unnecessary. If that happens, cancel this sequence
2612 and cause that insn to be restored. */
2614 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
2615 if (next != XVECEXP (body, 0, 1))
2621 for (i = 1; i < XVECLEN (body, 0); i++)
2623 rtx insn = XVECEXP (body, 0, i);
2624 rtx next = NEXT_INSN (insn);
2625 /* We loop in case any instruction in a delay slot gets
2628 insn = final_scan_insn (insn, file, 0, prescan, 1);
2629 while (insn != next);
2631 #ifdef DBR_OUTPUT_SEQEND
2632 DBR_OUTPUT_SEQEND (file);
2636 /* If the insn requiring the delay slot was a CALL_INSN, the
2637 insns in the delay slot are actually executed before the
2638 called function. Hence we don't preserve any CC-setting
2639 actions in these insns and the CC must be marked as being
2640 clobbered by the function. */
2641 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
2646 /* Following a conditional branch sequence, we have a new basic
2648 if (profile_block_flag)
2650 rtx insn = XVECEXP (body, 0, 0);
2651 rtx body = PATTERN (insn);
2653 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2654 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2655 || (GET_CODE (insn) == JUMP_INSN
2656 && GET_CODE (body) == PARALLEL
2657 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2658 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
2664 /* We have a real machine instruction as rtl. */
2666 body = PATTERN (insn);
2669 set = single_set (insn);
2671 /* Check for redundant test and compare instructions
2672 (when the condition codes are already set up as desired).
2673 This is done only when optimizing; if not optimizing,
2674 it should be possible for the user to alter a variable
2675 with the debugger in between statements
2676 and the next statement should reexamine the variable
2677 to compute the condition codes. */
2682 rtx set = single_set (insn);
2686 && GET_CODE (SET_DEST (set)) == CC0
2687 && insn != last_ignored_compare)
2689 if (GET_CODE (SET_SRC (set)) == SUBREG)
2690 SET_SRC (set) = alter_subreg (SET_SRC (set));
2691 else if (GET_CODE (SET_SRC (set)) == COMPARE)
2693 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
2694 XEXP (SET_SRC (set), 0)
2695 = alter_subreg (XEXP (SET_SRC (set), 0));
2696 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
2697 XEXP (SET_SRC (set), 1)
2698 = alter_subreg (XEXP (SET_SRC (set), 1));
2700 if ((cc_status.value1 != 0
2701 && rtx_equal_p (SET_SRC (set), cc_status.value1))
2702 || (cc_status.value2 != 0
2703 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
2705 /* Don't delete insn if it has an addressing side-effect. */
2706 if (! FIND_REG_INC_NOTE (insn, 0)
2707 /* or if anything in it is volatile. */
2708 && ! volatile_refs_p (PATTERN (insn)))
2710 /* We don't really delete the insn; just ignore it. */
2711 last_ignored_compare = insn;
2719 /* Following a conditional branch, we have a new basic block.
2720 But if we are inside a sequence, the new block starts after the
2721 last insn of the sequence. */
2722 if (profile_block_flag && final_sequence == 0
2723 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2724 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2725 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
2726 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2727 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
2731 /* Don't bother outputting obvious no-ops, even without -O.
2732 This optimization is fast and doesn't interfere with debugging.
2733 Don't do this if the insn is in a delay slot, since this
2734 will cause an improper number of delay insns to be written. */
2735 if (final_sequence == 0
2737 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
2738 && GET_CODE (SET_SRC (body)) == REG
2739 && GET_CODE (SET_DEST (body)) == REG
2740 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
2745 /* If this is a conditional branch, maybe modify it
2746 if the cc's are in a nonstandard state
2747 so that it accomplishes the same thing that it would
2748 do straightforwardly if the cc's were set up normally. */
2750 if (cc_status.flags != 0
2751 && GET_CODE (insn) == JUMP_INSN
2752 && GET_CODE (body) == SET
2753 && SET_DEST (body) == pc_rtx
2754 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
2755 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
2756 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
2757 /* This is done during prescan; it is not done again
2758 in final scan when prescan has been done. */
2761 /* This function may alter the contents of its argument
2762 and clear some of the cc_status.flags bits.
2763 It may also return 1 meaning condition now always true
2764 or -1 meaning condition now always false
2765 or 2 meaning condition nontrivial but altered. */
2766 register int result = alter_cond (XEXP (SET_SRC (body), 0));
2767 /* If condition now has fixed value, replace the IF_THEN_ELSE
2768 with its then-operand or its else-operand. */
2770 SET_SRC (body) = XEXP (SET_SRC (body), 1);
2772 SET_SRC (body) = XEXP (SET_SRC (body), 2);
2774 /* The jump is now either unconditional or a no-op.
2775 If it has become a no-op, don't try to output it.
2776 (It would not be recognized.) */
2777 if (SET_SRC (body) == pc_rtx)
2779 PUT_CODE (insn, NOTE);
2780 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2781 NOTE_SOURCE_FILE (insn) = 0;
2784 else if (GET_CODE (SET_SRC (body)) == RETURN)
2785 /* Replace (set (pc) (return)) with (return). */
2786 PATTERN (insn) = body = SET_SRC (body);
2788 /* Rerecognize the instruction if it has changed. */
2790 INSN_CODE (insn) = -1;
2793 /* Make same adjustments to instructions that examine the
2794 condition codes without jumping and instructions that
2795 handle conditional moves (if this machine has either one). */
2797 if (cc_status.flags != 0
2800 rtx cond_rtx, then_rtx, else_rtx;
2802 if (GET_CODE (insn) != JUMP_INSN
2803 && GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
2805 cond_rtx = XEXP (SET_SRC (set), 0);
2806 then_rtx = XEXP (SET_SRC (set), 1);
2807 else_rtx = XEXP (SET_SRC (set), 2);
2811 cond_rtx = SET_SRC (set);
2812 then_rtx = const_true_rtx;
2813 else_rtx = const0_rtx;
2816 switch (GET_CODE (cond_rtx))
2829 register int result;
2830 if (XEXP (cond_rtx, 0) != cc0_rtx)
2832 result = alter_cond (cond_rtx);
2834 validate_change (insn, &SET_SRC (set), then_rtx, 0);
2835 else if (result == -1)
2836 validate_change (insn, &SET_SRC (set), else_rtx, 0);
2837 else if (result == 2)
2838 INSN_CODE (insn) = -1;
2839 if (SET_DEST (set) == SET_SRC (set))
2841 PUT_CODE (insn, NOTE);
2842 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2843 NOTE_SOURCE_FILE (insn) = 0;
2855 #ifdef HAVE_peephole
2856 /* Do machine-specific peephole optimizations if desired. */
2858 if (optimize && !flag_no_peephole && !nopeepholes)
2860 rtx next = peephole (insn);
2861 /* When peepholing, if there were notes within the peephole,
2862 emit them before the peephole. */
2863 if (next != 0 && next != NEXT_INSN (insn))
2865 rtx prev = PREV_INSN (insn);
2868 for (note = NEXT_INSN (insn); note != next;
2869 note = NEXT_INSN (note))
2870 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2872 /* In case this is prescan, put the notes
2873 in proper position for later rescan. */
2874 note = NEXT_INSN (insn);
2875 PREV_INSN (note) = prev;
2876 NEXT_INSN (prev) = note;
2877 NEXT_INSN (PREV_INSN (next)) = insn;
2878 PREV_INSN (insn) = PREV_INSN (next);
2879 NEXT_INSN (insn) = next;
2880 PREV_INSN (next) = insn;
2883 /* PEEPHOLE might have changed this. */
2884 body = PATTERN (insn);
2888 /* Try to recognize the instruction.
2889 If successful, verify that the operands satisfy the
2890 constraints for the instruction. Crash if they don't,
2891 since `reload' should have changed them so that they do. */
2893 insn_code_number = recog_memoized (insn);
2894 cleanup_subreg_operands (insn);
2896 /* Dump the insn in the assembly for debugging. */
2897 if (flag_dump_rtl_in_asm)
2899 print_rtx_head = ASM_COMMENT_START;
2900 print_rtl_single (asm_out_file, insn);
2901 print_rtx_head = "";
2904 if (! constrain_operands_cached (1))
2905 fatal_insn_not_found (insn);
2907 /* Some target machines need to prescan each insn before
2910 #ifdef FINAL_PRESCAN_INSN
2911 FINAL_PRESCAN_INSN (insn, recog_data.operand, recog_data.n_operands);
2914 #ifdef HAVE_conditional_execution
2915 if (GET_CODE (PATTERN (insn)) == COND_EXEC)
2916 current_insn_predicate = COND_EXEC_TEST (PATTERN (insn));
2918 current_insn_predicate = NULL_RTX;
2922 cc_prev_status = cc_status;
2924 /* Update `cc_status' for this instruction.
2925 The instruction's output routine may change it further.
2926 If the output routine for a jump insn needs to depend
2927 on the cc status, it should look at cc_prev_status. */
2929 NOTICE_UPDATE_CC (body, insn);
2932 current_output_insn = debug_insn = insn;
2934 #if defined (DWARF2_UNWIND_INFO)
2935 /* If we push arguments, we want to know where the calls are. */
2936 if (!ACCUMULATE_OUTGOING_ARGS && GET_CODE (insn) == CALL_INSN
2937 && dwarf2out_do_frame ())
2938 dwarf2out_frame_debug (insn);
2941 /* Find the proper template for this insn. */
2942 template = get_insn_template (insn_code_number, insn);
2944 /* If the C code returns 0, it means that it is a jump insn
2945 which follows a deleted test insn, and that test insn
2946 needs to be reinserted. */
2951 if (prev_nonnote_insn (insn) != last_ignored_compare)
2955 /* We have already processed the notes between the setter and
2956 the user. Make sure we don't process them again, this is
2957 particularly important if one of the notes is a block
2958 scope note or an EH note. */
2960 prev != last_ignored_compare;
2961 prev = PREV_INSN (prev))
2963 if (GET_CODE (prev) == NOTE)
2965 NOTE_LINE_NUMBER (prev) = NOTE_INSN_DELETED;
2966 NOTE_SOURCE_FILE (prev) = 0;
2973 /* If the template is the string "#", it means that this insn must
2975 if (template[0] == '#' && template[1] == '\0')
2977 rtx new = try_split (body, insn, 0);
2979 /* If we didn't split the insn, go away. */
2980 if (new == insn && PATTERN (new) == body)
2981 fatal_insn ("Could not split insn", insn);
2983 #ifdef HAVE_ATTR_length
2984 /* This instruction should have been split in shorten_branches,
2985 to ensure that we would have valid length info for the
2997 #ifdef IA64_UNWIND_INFO
2998 IA64_UNWIND_EMIT (asm_out_file, insn);
3000 /* Output assembler code from the template. */
3002 output_asm_insn (template, recog_data.operand);
3004 #if defined (DWARF2_UNWIND_INFO)
3005 /* If we push arguments, we need to check all insns for stack
3007 if (!ACCUMULATE_OUTGOING_ARGS)
3009 if (GET_CODE (insn) == INSN && dwarf2out_do_frame ())
3010 dwarf2out_frame_debug (insn);
3014 #if defined (HAVE_prologue)
3015 /* If this insn is part of the prologue, emit DWARF v2
3017 if (RTX_FRAME_RELATED_P (insn) && dwarf2out_do_frame ())
3018 dwarf2out_frame_debug (insn);
3024 /* It's not at all clear why we did this and doing so interferes
3025 with tests we'd like to do to use REG_WAS_0 notes, so let's try
3028 /* Mark this insn as having been output. */
3029 INSN_DELETED_P (insn) = 1;
3032 current_output_insn = debug_insn = 0;
3035 return NEXT_INSN (insn);
3038 /* Output debugging info to the assembler file FILE
3039 based on the NOTE-insn INSN, assumed to be a line number. */
3042 output_source_line (file, insn)
3043 FILE *file ATTRIBUTE_UNUSED;
3046 register const char *filename = NOTE_SOURCE_FILE (insn);
3048 /* Remember filename for basic block profiling.
3049 Filenames are allocated on the permanent obstack
3050 or are passed in ARGV, so we don't have to save
3053 if (profile_block_flag && last_filename != filename)
3054 bb_file_label_num = add_bb_string (filename, TRUE);
3056 last_filename = filename;
3057 last_linenum = NOTE_LINE_NUMBER (insn);
3058 high_block_linenum = MAX (last_linenum, high_block_linenum);
3059 high_function_linenum = MAX (last_linenum, high_function_linenum);
3061 if (write_symbols != NO_DEBUG)
3063 #ifdef SDB_DEBUGGING_INFO
3064 if (write_symbols == SDB_DEBUG
3065 #if 0 /* People like having line numbers even in wrong file! */
3066 /* COFF can't handle multiple source files--lose, lose. */
3067 && !strcmp (filename, main_input_filename)
3069 /* COFF relative line numbers must be positive. */
3070 && last_linenum > sdb_begin_function_line)
3072 #ifdef ASM_OUTPUT_SOURCE_LINE
3073 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
3075 fprintf (file, "\t.ln\t%d\n",
3076 ((sdb_begin_function_line > -1)
3077 ? last_linenum - sdb_begin_function_line : 1));
3082 #if defined (DBX_DEBUGGING_INFO)
3083 if (write_symbols == DBX_DEBUG)
3084 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
3087 #if defined (XCOFF_DEBUGGING_INFO)
3088 if (write_symbols == XCOFF_DEBUG)
3089 xcoffout_source_line (file, filename, insn);
3092 #ifdef DWARF_DEBUGGING_INFO
3093 if (write_symbols == DWARF_DEBUG)
3094 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
3097 #ifdef DWARF2_DEBUGGING_INFO
3098 if (write_symbols == DWARF2_DEBUG)
3099 dwarf2out_line (filename, NOTE_LINE_NUMBER (insn));
3104 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3105 directly to the desired hard register. */
3108 cleanup_subreg_operands (insn)
3112 extract_insn_cached (insn);
3113 for (i = 0; i < recog_data.n_operands; i++)
3115 if (GET_CODE (recog_data.operand[i]) == SUBREG)
3116 recog_data.operand[i] = alter_subreg (recog_data.operand[i]);
3117 else if (GET_CODE (recog_data.operand[i]) == PLUS
3118 || GET_CODE (recog_data.operand[i]) == MULT)
3119 recog_data.operand[i] = walk_alter_subreg (recog_data.operand[i]);
3122 for (i = 0; i < recog_data.n_dups; i++)
3124 if (GET_CODE (*recog_data.dup_loc[i]) == SUBREG)
3125 *recog_data.dup_loc[i] = alter_subreg (*recog_data.dup_loc[i]);
3126 else if (GET_CODE (*recog_data.dup_loc[i]) == PLUS
3127 || GET_CODE (*recog_data.dup_loc[i]) == MULT)
3128 *recog_data.dup_loc[i] = walk_alter_subreg (*recog_data.dup_loc[i]);
3132 /* If X is a SUBREG, replace it with a REG or a MEM,
3133 based on the thing it is a subreg of. */
3139 register rtx y = SUBREG_REG (x);
3141 if (GET_CODE (y) == SUBREG)
3142 y = alter_subreg (y);
3144 /* If reload is operating, we may be replacing inside this SUBREG.
3145 Check for that and make a new one if so. */
3146 if (reload_in_progress && find_replacement (&SUBREG_REG (x)) != 0)
3149 if (GET_CODE (y) == REG)
3152 /* If the word size is larger than the size of this register,
3153 adjust the register number to compensate. */
3154 /* ??? Note that this just catches stragglers created by/for
3155 integrate. It would be better if we either caught these
3156 earlier, or kept _all_ subregs until now and eliminate
3157 gen_lowpart and friends. */
3159 #ifdef ALTER_HARD_SUBREG
3160 regno = ALTER_HARD_SUBREG (GET_MODE (x), SUBREG_WORD (x),
3161 GET_MODE (y), REGNO (y));
3163 regno = REGNO (y) + SUBREG_WORD (x);
3167 ORIGINAL_REGNO (x) = ORIGINAL_REGNO (y);
3168 /* This field has a different meaning for REGs and SUBREGs. Make sure
3172 else if (GET_CODE (y) == MEM)
3174 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
3176 if (BYTES_BIG_ENDIAN)
3177 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
3178 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
3180 MEM_COPY_ATTRIBUTES (x, y);
3181 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
3187 /* Do alter_subreg on all the SUBREGs contained in X. */
3190 walk_alter_subreg (x)
3193 switch (GET_CODE (x))
3197 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3198 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
3202 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3206 return alter_subreg (x);
3217 /* Given BODY, the body of a jump instruction, alter the jump condition
3218 as required by the bits that are set in cc_status.flags.
3219 Not all of the bits there can be handled at this level in all cases.
3221 The value is normally 0.
3222 1 means that the condition has become always true.
3223 -1 means that the condition has become always false.
3224 2 means that COND has been altered. */
3232 if (cc_status.flags & CC_REVERSED)
3235 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
3238 if (cc_status.flags & CC_INVERTED)
3241 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
3244 if (cc_status.flags & CC_NOT_POSITIVE)
3245 switch (GET_CODE (cond))
3250 /* Jump becomes unconditional. */
3256 /* Jump becomes no-op. */
3260 PUT_CODE (cond, EQ);
3265 PUT_CODE (cond, NE);
3273 if (cc_status.flags & CC_NOT_NEGATIVE)
3274 switch (GET_CODE (cond))
3278 /* Jump becomes unconditional. */
3283 /* Jump becomes no-op. */
3288 PUT_CODE (cond, EQ);
3294 PUT_CODE (cond, NE);
3302 if (cc_status.flags & CC_NO_OVERFLOW)
3303 switch (GET_CODE (cond))
3306 /* Jump becomes unconditional. */
3310 PUT_CODE (cond, EQ);
3315 PUT_CODE (cond, NE);
3320 /* Jump becomes no-op. */
3327 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
3328 switch (GET_CODE (cond))
3334 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
3339 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
3344 if (cc_status.flags & CC_NOT_SIGNED)
3345 /* The flags are valid if signed condition operators are converted
3347 switch (GET_CODE (cond))
3350 PUT_CODE (cond, LEU);
3355 PUT_CODE (cond, LTU);
3360 PUT_CODE (cond, GTU);
3365 PUT_CODE (cond, GEU);
3377 /* Report inconsistency between the assembler template and the operands.
3378 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3381 output_operand_lossage (msgid)
3384 if (this_is_asm_operands)
3385 error_for_asm (this_is_asm_operands, "invalid `asm': %s", _(msgid));
3388 error ("output_operand: %s", _(msgid));
3393 /* Output of assembler code from a template, and its subroutines. */
3395 /* Output text from TEMPLATE to the assembler output file,
3396 obeying %-directions to substitute operands taken from
3397 the vector OPERANDS.
3399 %N (for N a digit) means print operand N in usual manner.
3400 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3401 and print the label name with no punctuation.
3402 %cN means require operand N to be a constant
3403 and print the constant expression with no punctuation.
3404 %aN means expect operand N to be a memory address
3405 (not a memory reference!) and print a reference
3407 %nN means expect operand N to be a constant
3408 and print a constant expression for minus the value
3409 of the operand, with no other punctuation. */
3414 if (flag_print_asm_name)
3416 /* Annotate the assembly with a comment describing the pattern and
3417 alternative used. */
3420 register int num = INSN_CODE (debug_insn);
3421 fprintf (asm_out_file, "\t%s %d\t%s",
3422 ASM_COMMENT_START, INSN_UID (debug_insn),
3423 insn_data[num].name);
3424 if (insn_data[num].n_alternatives > 1)
3425 fprintf (asm_out_file, "/%d", which_alternative + 1);
3426 #ifdef HAVE_ATTR_length
3427 fprintf (asm_out_file, "\t[length = %d]",
3428 get_attr_length (debug_insn));
3430 /* Clear this so only the first assembler insn
3431 of any rtl insn will get the special comment for -dp. */
3438 output_asm_insn (template, operands)
3439 const char *template;
3442 register const char *p;
3445 /* An insn may return a null string template
3446 in a case where no assembler code is needed. */
3451 putc ('\t', asm_out_file);
3453 #ifdef ASM_OUTPUT_OPCODE
3454 ASM_OUTPUT_OPCODE (asm_out_file, p);
3462 putc (c, asm_out_file);
3463 #ifdef ASM_OUTPUT_OPCODE
3464 while ((c = *p) == '\t')
3466 putc (c, asm_out_file);
3469 ASM_OUTPUT_OPCODE (asm_out_file, p);
3473 #ifdef ASSEMBLER_DIALECT
3478 /* If we want the first dialect, do nothing. Otherwise, skip
3479 DIALECT_NUMBER of strings ending with '|'. */
3480 for (i = 0; i < dialect_number; i++)
3482 while (*p && *p != '}' && *p++ != '|')
3493 /* Skip to close brace. */
3494 while (*p && *p++ != '}')
3503 /* %% outputs a single %. */
3507 putc (c, asm_out_file);
3509 /* %= outputs a number which is unique to each insn in the entire
3510 compilation. This is useful for making local labels that are
3511 referred to more than once in a given insn. */
3515 fprintf (asm_out_file, "%d", insn_counter);
3517 /* % followed by a letter and some digits
3518 outputs an operand in a special way depending on the letter.
3519 Letters `acln' are implemented directly.
3520 Other letters are passed to `output_operand' so that
3521 the PRINT_OPERAND macro can define them. */
3522 else if (ISLOWER (*p) || ISUPPER (*p))
3527 if (! (*p >= '0' && *p <= '9'))
3528 output_operand_lossage ("operand number missing after %-letter");
3529 else if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3530 output_operand_lossage ("operand number out of range");
3531 else if (letter == 'l')
3532 output_asm_label (operands[c]);
3533 else if (letter == 'a')
3534 output_address (operands[c]);
3535 else if (letter == 'c')
3537 if (CONSTANT_ADDRESS_P (operands[c]))
3538 output_addr_const (asm_out_file, operands[c]);
3540 output_operand (operands[c], 'c');
3542 else if (letter == 'n')
3544 if (GET_CODE (operands[c]) == CONST_INT)
3545 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
3546 - INTVAL (operands[c]));
3549 putc ('-', asm_out_file);
3550 output_addr_const (asm_out_file, operands[c]);
3554 output_operand (operands[c], letter);
3556 while ((c = *p) >= '0' && c <= '9')
3559 /* % followed by a digit outputs an operand the default way. */
3560 else if (*p >= '0' && *p <= '9')
3563 if (this_is_asm_operands
3564 && (c < 0 || (unsigned int) c >= insn_noperands))
3565 output_operand_lossage ("operand number out of range");
3567 output_operand (operands[c], 0);
3568 while ((c = *p) >= '0' && c <= '9')
3571 /* % followed by punctuation: output something for that
3572 punctuation character alone, with no operand.
3573 The PRINT_OPERAND macro decides what is actually done. */
3574 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3575 else if (PRINT_OPERAND_PUNCT_VALID_P ((unsigned char) *p))
3576 output_operand (NULL_RTX, *p++);
3579 output_operand_lossage ("invalid %%-code");
3583 putc (c, asm_out_file);
3588 putc ('\n', asm_out_file);
3591 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3594 output_asm_label (x)
3599 if (GET_CODE (x) == LABEL_REF)
3601 if (GET_CODE (x) == CODE_LABEL
3602 || (GET_CODE (x) == NOTE
3603 && NOTE_LINE_NUMBER (x) == NOTE_INSN_DELETED_LABEL))
3604 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3606 output_operand_lossage ("`%l' operand isn't a label");
3608 assemble_name (asm_out_file, buf);
3611 /* Print operand X using machine-dependent assembler syntax.
3612 The macro PRINT_OPERAND is defined just to control this function.
3613 CODE is a non-digit that preceded the operand-number in the % spec,
3614 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3615 between the % and the digits.
3616 When CODE is a non-letter, X is 0.
3618 The meanings of the letters are machine-dependent and controlled
3619 by PRINT_OPERAND. */
3622 output_operand (x, code)
3624 int code ATTRIBUTE_UNUSED;
3626 if (x && GET_CODE (x) == SUBREG)
3627 x = alter_subreg (x);
3629 /* If X is a pseudo-register, abort now rather than writing trash to the
3632 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
3635 PRINT_OPERAND (asm_out_file, x, code);
3638 /* Print a memory reference operand for address X
3639 using machine-dependent assembler syntax.
3640 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3646 walk_alter_subreg (x);
3647 PRINT_OPERAND_ADDRESS (asm_out_file, x);
3650 /* Print an integer constant expression in assembler syntax.
3651 Addition and subtraction are the only arithmetic
3652 that may appear in these expressions. */
3655 output_addr_const (file, x)
3662 switch (GET_CODE (x))
3672 #ifdef ASM_OUTPUT_SYMBOL_REF
3673 ASM_OUTPUT_SYMBOL_REF (file, x);
3675 assemble_name (file, XSTR (x, 0));
3683 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3684 assemble_name (file, buf);
3688 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
3692 /* This used to output parentheses around the expression,
3693 but that does not work on the 386 (either ATT or BSD assembler). */
3694 output_addr_const (file, XEXP (x, 0));
3698 if (GET_MODE (x) == VOIDmode)
3700 /* We can use %d if the number is one word and positive. */
3701 if (CONST_DOUBLE_HIGH (x))
3702 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3703 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
3704 else if (CONST_DOUBLE_LOW (x) < 0)
3705 fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
3707 fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
3710 /* We can't handle floating point constants;
3711 PRINT_OPERAND must handle them. */
3712 output_operand_lossage ("floating constant misused");
3716 /* Some assemblers need integer constants to appear last (eg masm). */
3717 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
3719 output_addr_const (file, XEXP (x, 1));
3720 if (INTVAL (XEXP (x, 0)) >= 0)
3721 fprintf (file, "+");
3722 output_addr_const (file, XEXP (x, 0));
3726 output_addr_const (file, XEXP (x, 0));
3727 if (GET_CODE (XEXP (x, 1)) != CONST_INT
3728 || INTVAL (XEXP (x, 1)) >= 0)
3729 fprintf (file, "+");
3730 output_addr_const (file, XEXP (x, 1));
3735 /* Avoid outputting things like x-x or x+5-x,
3736 since some assemblers can't handle that. */
3737 x = simplify_subtraction (x);
3738 if (GET_CODE (x) != MINUS)
3741 output_addr_const (file, XEXP (x, 0));
3742 fprintf (file, "-");
3743 if ((GET_CODE (XEXP (x, 1)) == CONST_INT
3744 && INTVAL (XEXP (x, 1)) < 0)
3745 || GET_CODE (XEXP (x, 1)) != CONST_INT)
3747 fprintf (file, "%s", ASM_OPEN_PAREN);
3748 output_addr_const (file, XEXP (x, 1));
3749 fprintf (file, "%s", ASM_CLOSE_PAREN);
3752 output_addr_const (file, XEXP (x, 1));
3757 output_addr_const (file, XEXP (x, 0));
3761 #ifdef OUTPUT_ADDR_CONST_EXTRA
3762 OUTPUT_ADDR_CONST_EXTRA (file, x, fail);
3767 output_operand_lossage ("invalid expression as operand");
3771 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3772 %R prints the value of REGISTER_PREFIX.
3773 %L prints the value of LOCAL_LABEL_PREFIX.
3774 %U prints the value of USER_LABEL_PREFIX.
3775 %I prints the value of IMMEDIATE_PREFIX.
3776 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3777 Also supported are %d, %x, %s, %e, %f, %g and %%.
3779 We handle alternate assembler dialects here, just like output_asm_insn. */
3782 asm_fprintf VPARAMS ((FILE *file, const char *p, ...))
3784 #ifndef ANSI_PROTOTYPES
3792 VA_START (argptr, p);
3794 #ifndef ANSI_PROTOTYPES
3795 file = va_arg (argptr, FILE *);
3796 p = va_arg (argptr, const char *);
3804 #ifdef ASSEMBLER_DIALECT
3809 /* If we want the first dialect, do nothing. Otherwise, skip
3810 DIALECT_NUMBER of strings ending with '|'. */
3811 for (i = 0; i < dialect_number; i++)
3813 while (*p && *p++ != '|')
3823 /* Skip to close brace. */
3824 while (*p && *p++ != '}')
3835 while ((c >= '0' && c <= '9') || c == '.')
3843 fprintf (file, "%%");
3846 case 'd': case 'i': case 'u':
3847 case 'x': case 'p': case 'X':
3851 fprintf (file, buf, va_arg (argptr, int));
3855 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3856 but we do not check for those cases. It means that the value
3857 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3859 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3861 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3871 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3878 fprintf (file, buf, va_arg (argptr, long));
3886 fprintf (file, buf, va_arg (argptr, double));
3892 fprintf (file, buf, va_arg (argptr, char *));
3896 #ifdef ASM_OUTPUT_OPCODE
3897 ASM_OUTPUT_OPCODE (asm_out_file, p);
3902 #ifdef REGISTER_PREFIX
3903 fprintf (file, "%s", REGISTER_PREFIX);
3908 #ifdef IMMEDIATE_PREFIX
3909 fprintf (file, "%s", IMMEDIATE_PREFIX);
3914 #ifdef LOCAL_LABEL_PREFIX
3915 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
3920 fputs (user_label_prefix, file);
3923 #ifdef ASM_FPRINTF_EXTENSIONS
3924 /* Upper case letters are reserved for general use by asm_fprintf
3925 and so are not available to target specific code. In order to
3926 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
3927 they are defined here. As they get turned into real extensions
3928 to asm_fprintf they should be removed from this list. */
3929 case 'A': case 'B': case 'C': case 'D': case 'E':
3930 case 'F': case 'G': case 'H': case 'J': case 'K':
3931 case 'M': case 'N': case 'P': case 'Q': case 'S':
3932 case 'T': case 'V': case 'W': case 'Y': case 'Z':
3935 ASM_FPRINTF_EXTENSIONS (file, argptr, p)
3948 /* Split up a CONST_DOUBLE or integer constant rtx
3949 into two rtx's for single words,
3950 storing in *FIRST the word that comes first in memory in the target
3951 and in *SECOND the other. */
3954 split_double (value, first, second)
3956 rtx *first, *second;
3958 if (GET_CODE (value) == CONST_INT)
3960 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3962 /* In this case the CONST_INT holds both target words.
3963 Extract the bits from it into two word-sized pieces.
3964 Sign extend each half to HOST_WIDE_INT. */
3965 unsigned HOST_WIDE_INT low, high;
3966 unsigned HOST_WIDE_INT mask, sign_bit, sign_extend;
3968 /* Set sign_bit to the most significant bit of a word. */
3970 sign_bit <<= BITS_PER_WORD - 1;
3972 /* Set mask so that all bits of the word are set. We could
3973 have used 1 << BITS_PER_WORD instead of basing the
3974 calculation on sign_bit. However, on machines where
3975 HOST_BITS_PER_WIDE_INT == BITS_PER_WORD, it could cause a
3976 compiler warning, even though the code would never be
3978 mask = sign_bit << 1;
3981 /* Set sign_extend as any remaining bits. */
3982 sign_extend = ~mask;
3984 /* Pick the lower word and sign-extend it. */
3985 low = INTVAL (value);
3990 /* Pick the higher word, shifted to the least significant
3991 bits, and sign-extend it. */
3992 high = INTVAL (value);
3993 high >>= BITS_PER_WORD - 1;
3996 if (high & sign_bit)
3997 high |= sign_extend;
3999 /* Store the words in the target machine order. */
4000 if (WORDS_BIG_ENDIAN)
4002 *first = GEN_INT (high);
4003 *second = GEN_INT (low);
4007 *first = GEN_INT (low);
4008 *second = GEN_INT (high);
4013 /* The rule for using CONST_INT for a wider mode
4014 is that we regard the value as signed.
4015 So sign-extend it. */
4016 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
4017 if (WORDS_BIG_ENDIAN)
4029 else if (GET_CODE (value) != CONST_DOUBLE)
4031 if (WORDS_BIG_ENDIAN)
4033 *first = const0_rtx;
4039 *second = const0_rtx;
4042 else if (GET_MODE (value) == VOIDmode
4043 /* This is the old way we did CONST_DOUBLE integers. */
4044 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
4046 /* In an integer, the words are defined as most and least significant.
4047 So order them by the target's convention. */
4048 if (WORDS_BIG_ENDIAN)
4050 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
4051 *second = GEN_INT (CONST_DOUBLE_LOW (value));
4055 *first = GEN_INT (CONST_DOUBLE_LOW (value));
4056 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
4061 #ifdef REAL_ARITHMETIC
4064 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
4066 /* Note, this converts the REAL_VALUE_TYPE to the target's
4067 format, splits up the floating point double and outputs
4068 exactly 32 bits of it into each of l[0] and l[1] --
4069 not necessarily BITS_PER_WORD bits. */
4070 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
4072 /* If 32 bits is an entire word for the target, but not for the host,
4073 then sign-extend on the host so that the number will look the same
4074 way on the host that it would on the target. See for instance
4075 simplify_unary_operation. The #if is needed to avoid compiler
4078 #if HOST_BITS_PER_LONG > 32
4079 if (BITS_PER_WORD < HOST_BITS_PER_LONG && BITS_PER_WORD == 32)
4081 if (l[0] & ((long) 1 << 31))
4082 l[0] |= ((long) (-1) << 32);
4083 if (l[1] & ((long) 1 << 31))
4084 l[1] |= ((long) (-1) << 32);
4088 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
4089 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
4091 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
4092 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
4093 && ! flag_pretend_float)
4097 #ifdef HOST_WORDS_BIG_ENDIAN
4104 /* Host and target agree => no need to swap. */
4105 *first = GEN_INT (CONST_DOUBLE_LOW (value));
4106 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
4110 *second = GEN_INT (CONST_DOUBLE_LOW (value));
4111 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
4113 #endif /* no REAL_ARITHMETIC */
4117 /* Return nonzero if this function has no function calls. */
4125 if (profile_flag || profile_block_flag || profile_arc_flag)
4128 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4130 if (GET_CODE (insn) == CALL_INSN
4131 && ! SIBLING_CALL_P (insn))
4133 if (GET_CODE (insn) == INSN
4134 && GET_CODE (PATTERN (insn)) == SEQUENCE
4135 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN
4136 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn), 0, 0)))
4139 for (link = current_function_epilogue_delay_list;
4141 link = XEXP (link, 1))
4143 insn = XEXP (link, 0);
4145 if (GET_CODE (insn) == CALL_INSN
4146 && ! SIBLING_CALL_P (insn))
4148 if (GET_CODE (insn) == INSN
4149 && GET_CODE (PATTERN (insn)) == SEQUENCE
4150 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN
4151 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn), 0, 0)))
4158 /* On some machines, a function with no call insns
4159 can run faster if it doesn't create its own register window.
4160 When output, the leaf function should use only the "output"
4161 registers. Ordinarily, the function would be compiled to use
4162 the "input" registers to find its arguments; it is a candidate
4163 for leaf treatment if it uses only the "input" registers.
4164 Leaf function treatment means renumbering so the function
4165 uses the "output" registers instead. */
4167 #ifdef LEAF_REGISTERS
4169 /* Return 1 if this function uses only the registers that can be
4170 safely renumbered. */
4173 only_leaf_regs_used ()
4176 char *permitted_reg_in_leaf_functions = LEAF_REGISTERS;
4178 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4179 if ((regs_ever_live[i] || global_regs[i])
4180 && ! permitted_reg_in_leaf_functions[i])
4183 if (current_function_uses_pic_offset_table
4184 && pic_offset_table_rtx != 0
4185 && GET_CODE (pic_offset_table_rtx) == REG
4186 && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4192 /* Scan all instructions and renumber all registers into those
4193 available in leaf functions. */
4196 leaf_renumber_regs (first)
4201 /* Renumber only the actual patterns.
4202 The reg-notes can contain frame pointer refs,
4203 and renumbering them could crash, and should not be needed. */
4204 for (insn = first; insn; insn = NEXT_INSN (insn))
4206 leaf_renumber_regs_insn (PATTERN (insn));
4207 for (insn = current_function_epilogue_delay_list;
4209 insn = XEXP (insn, 1))
4210 if (INSN_P (XEXP (insn, 0)))
4211 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
4214 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4215 available in leaf functions. */
4218 leaf_renumber_regs_insn (in_rtx)
4219 register rtx in_rtx;
4222 register const char *format_ptr;
4227 /* Renumber all input-registers into output-registers.
4228 renumbered_regs would be 1 for an output-register;
4231 if (GET_CODE (in_rtx) == REG)
4235 /* Don't renumber the same reg twice. */
4239 newreg = REGNO (in_rtx);
4240 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4241 to reach here as part of a REG_NOTE. */
4242 if (newreg >= FIRST_PSEUDO_REGISTER)
4247 newreg = LEAF_REG_REMAP (newreg);
4250 regs_ever_live[REGNO (in_rtx)] = 0;
4251 regs_ever_live[newreg] = 1;
4252 REGNO (in_rtx) = newreg;
4256 if (INSN_P (in_rtx))
4258 /* Inside a SEQUENCE, we find insns.
4259 Renumber just the patterns of these insns,
4260 just as we do for the top-level insns. */
4261 leaf_renumber_regs_insn (PATTERN (in_rtx));
4265 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
4267 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
4268 switch (*format_ptr++)
4271 leaf_renumber_regs_insn (XEXP (in_rtx, i));
4275 if (NULL != XVEC (in_rtx, i))
4277 for (j = 0; j < XVECLEN (in_rtx, i); j++)
4278 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));