1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-98, 1999 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This is the final pass of the compiler.
23 It looks at the rtl code for a function and outputs assembler code.
25 Call `final_start_function' to output the assembler code for function entry,
26 `final' to output assembler code for some RTL code,
27 `final_end_function' to output assembler code for function exit.
28 If a function is compiled in several pieces, each piece is
29 output separately with `final'.
31 Some optimizations are also done at this level.
32 Move instructions that were made unnecessary by good register allocation
33 are detected and omitted from the output. (Though most of these
34 are removed by the last jump pass.)
36 Instructions to set the condition codes are omitted when it can be
37 seen that the condition codes already had the desired values.
39 In some cases it is sufficient if the inherited condition codes
40 have related values, but this may require the following insn
41 (the one that tests the condition codes) to be modified.
43 The code for the function prologue and epilogue are generated
44 directly as assembler code by the macros FUNCTION_PROLOGUE and
45 FUNCTION_EPILOGUE. Those instructions never exist as rtl. */
53 #include "insn-config.h"
54 #include "insn-flags.h"
55 #include "insn-attr.h"
56 #include "insn-codes.h"
58 #include "conditions.h"
61 #include "hard-reg-set.h"
69 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
70 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
72 #if defined (USG) || !defined (HAVE_STAB_H)
73 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
78 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
80 #ifdef XCOFF_DEBUGGING_INFO
84 #ifdef DWARF_DEBUGGING_INFO
88 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
89 #include "dwarf2out.h"
92 #ifdef SDB_DEBUGGING_INFO
96 /* .stabd code for line number. */
101 /* .stabs code for included file name. */
106 #ifndef INT_TYPE_SIZE
107 #define INT_TYPE_SIZE BITS_PER_WORD
110 #ifndef LONG_TYPE_SIZE
111 #define LONG_TYPE_SIZE BITS_PER_WORD
114 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
115 null default for it to save conditionalization later. */
116 #ifndef CC_STATUS_INIT
117 #define CC_STATUS_INIT
120 /* How to start an assembler comment. */
121 #ifndef ASM_COMMENT_START
122 #define ASM_COMMENT_START ";#"
125 /* Is the given character a logical line separator for the assembler? */
126 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
127 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
130 #ifndef JUMP_TABLES_IN_TEXT_SECTION
131 #define JUMP_TABLES_IN_TEXT_SECTION 0
134 /* Nonzero means this function is a leaf function, with no function calls.
135 This variable exists to be examined in FUNCTION_PROLOGUE
136 and FUNCTION_EPILOGUE. Always zero, unless set by some action. */
139 /* Last insn processed by final_scan_insn. */
140 static rtx debug_insn = 0;
142 /* Line number of last NOTE. */
143 static int last_linenum;
145 /* Highest line number in current block. */
146 static int high_block_linenum;
148 /* Likewise for function. */
149 static int high_function_linenum;
151 /* Filename of last NOTE. */
152 static char *last_filename;
154 /* Number of basic blocks seen so far;
155 used if profile_block_flag is set. */
156 static int count_basic_blocks;
158 /* Number of instrumented arcs when profile_arc_flag is set. */
159 extern int count_instrumented_arcs;
161 extern int length_unit_log; /* This is defined in insn-attrtab.c. */
163 /* Nonzero while outputting an `asm' with operands.
164 This means that inconsistencies are the user's fault, so don't abort.
165 The precise value is the insn being output, to pass to error_for_asm. */
166 static rtx this_is_asm_operands;
168 /* Number of operands of this insn, for an `asm' with operands. */
169 static unsigned int insn_noperands;
171 /* Compare optimization flag. */
173 static rtx last_ignored_compare = 0;
175 /* Flag indicating this insn is the start of a new basic block. */
177 static int new_block = 1;
179 /* All the symbol-blocks (levels of scoping) in the compilation
180 are assigned sequence numbers in order of appearance of the
181 beginnings of the symbol-blocks. Both final and dbxout do this,
182 and assume that they will both give the same number to each block.
183 Final uses these sequence numbers to generate assembler label names
184 LBBnnn and LBEnnn for the beginning and end of the symbol-block.
185 Dbxout uses the sequence numbers to generate references to the same labels
186 from the dbx debugging information.
188 Sdb records this level at the beginning of each function,
189 in order to find the current level when recursing down declarations.
190 It outputs the block beginning and endings
191 at the point in the asm file where the blocks would begin and end. */
193 int next_block_index;
195 /* Assign a unique number to each insn that is output.
196 This can be used to generate unique local labels. */
198 static int insn_counter = 0;
201 /* This variable contains machine-dependent flags (defined in tm.h)
202 set and examined by output routines
203 that describe how to interpret the condition codes properly. */
207 /* During output of an insn, this contains a copy of cc_status
208 from before the insn. */
210 CC_STATUS cc_prev_status;
213 /* Indexed by hardware reg number, is 1 if that register is ever
214 used in the current function.
216 In life_analysis, or in stupid_life_analysis, this is set
217 up to record the hard regs used explicitly. Reload adds
218 in the hard regs used for holding pseudo regs. Final uses
219 it to generate the code in the function prologue and epilogue
220 to save and restore registers as needed. */
222 char regs_ever_live[FIRST_PSEUDO_REGISTER];
224 /* Nonzero means current function must be given a frame pointer.
225 Set in stmt.c if anything is allocated on the stack there.
226 Set in reload1.c if anything is allocated on the stack there. */
228 int frame_pointer_needed;
230 /* Assign unique numbers to labels generated for profiling. */
232 int profile_label_no;
234 /* Length so far allocated in PENDING_BLOCKS. */
236 static int max_block_depth;
238 /* Stack of sequence numbers of symbol-blocks of which we have seen the
239 beginning but not yet the end. Sequence numbers are assigned at
240 the beginning; this stack allows us to find the sequence number
241 of a block that is ending. */
243 static int *pending_blocks;
245 /* Number of elements currently in use in PENDING_BLOCKS. */
247 static int block_depth;
249 /* Nonzero if have enabled APP processing of our assembler output. */
253 /* If we are outputting an insn sequence, this contains the sequence rtx.
258 #ifdef ASSEMBLER_DIALECT
260 /* Number of the assembler dialect to use, starting at 0. */
261 static int dialect_number;
264 /* Indexed by line number, nonzero if there is a note for that line. */
266 static char *line_note_exists;
268 /* Linked list to hold line numbers for each basic block. */
271 struct bb_list *next; /* pointer to next basic block */
272 int line_num; /* line number */
273 int file_label_num; /* LPBC<n> label # for stored filename */
274 int func_label_num; /* LPBC<n> label # for stored function name */
277 static struct bb_list *bb_head = 0; /* Head of basic block list */
278 static struct bb_list **bb_tail = &bb_head; /* Ptr to store next bb ptr */
279 static int bb_file_label_num = -1; /* Current label # for file */
280 static int bb_func_label_num = -1; /* Current label # for func */
282 /* Linked list to hold the strings for each file and function name output. */
285 struct bb_str *next; /* pointer to next string */
286 const char *string; /* string */
287 int label_num; /* label number */
288 int length; /* string length */
291 extern rtx peephole PROTO((rtx));
293 static struct bb_str *sbb_head = 0; /* Head of string list. */
294 static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */
295 static int sbb_label_num = 0; /* Last label used */
297 #ifdef HAVE_ATTR_length
298 static int asm_insn_count PROTO((rtx));
300 static void profile_function PROTO((FILE *));
301 static void profile_after_prologue PROTO((FILE *));
302 static void add_bb PROTO((FILE *));
303 static int add_bb_string PROTO((const char *, int));
304 static void output_source_line PROTO((FILE *, rtx));
305 static rtx walk_alter_subreg PROTO((rtx));
306 static void output_asm_name PROTO((void));
307 static void output_operand PROTO((rtx, int));
308 #ifdef LEAF_REGISTERS
309 static void leaf_renumber_regs PROTO((rtx));
312 static int alter_cond PROTO((rtx));
315 extern char *getpwd ();
317 /* Initialize data in final at the beginning of a compilation. */
320 init_final (filename)
323 next_block_index = 2;
325 max_block_depth = 20;
326 pending_blocks = (int *) xmalloc (20 * sizeof *pending_blocks);
329 #ifdef ASSEMBLER_DIALECT
330 dialect_number = ASSEMBLER_DIALECT;
334 /* Called at end of source file,
335 to output the block-profiling table for this entire compilation. */
339 const char *filename;
343 if (profile_block_flag || profile_arc_flag)
346 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
350 int long_bytes = LONG_TYPE_SIZE / BITS_PER_UNIT;
351 int pointer_bytes = POINTER_SIZE / BITS_PER_UNIT;
353 if (profile_block_flag)
354 size = long_bytes * count_basic_blocks;
356 size = long_bytes * count_instrumented_arcs;
359 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
360 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
361 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
365 /* Output the main header, of 11 words:
366 0: 1 if this file is initialized, else 0.
367 1: address of file name (LPBX1).
368 2: address of table of counts (LPBX2).
369 3: number of counts in the table.
370 4: always 0, for compatibility with Sun.
372 The following are GNU extensions:
374 5: address of table of start addrs of basic blocks (LPBX3).
375 6: Number of bytes in this header.
376 7: address of table of function names (LPBX4).
377 8: address of table of line numbers (LPBX5) or 0.
378 9: address of table of file names (LPBX6) or 0.
379 10: space reserved for basic block profiling. */
381 ASM_OUTPUT_ALIGN (asm_out_file, align);
383 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
385 assemble_integer (const0_rtx, long_bytes, 1);
387 /* address of filename */
388 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
389 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
391 /* address of count table */
392 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
393 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
395 /* count of the # of basic blocks or # of instrumented arcs */
396 if (profile_block_flag)
397 assemble_integer (GEN_INT (count_basic_blocks), long_bytes, 1);
399 assemble_integer (GEN_INT (count_instrumented_arcs), long_bytes,
402 /* zero word (link field) */
403 assemble_integer (const0_rtx, pointer_bytes, 1);
405 /* address of basic block start address table */
406 if (profile_block_flag)
408 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
409 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
413 assemble_integer (const0_rtx, pointer_bytes, 1);
415 /* byte count for extended structure. */
416 assemble_integer (GEN_INT (11 * UNITS_PER_WORD), long_bytes, 1);
418 /* address of function name table */
419 if (profile_block_flag)
421 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
422 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
426 assemble_integer (const0_rtx, pointer_bytes, 1);
428 /* address of line number and filename tables if debugging. */
429 if (write_symbols != NO_DEBUG && profile_block_flag)
431 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
432 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
433 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
434 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
438 assemble_integer (const0_rtx, pointer_bytes, 1);
439 assemble_integer (const0_rtx, pointer_bytes, 1);
442 /* space for extension ptr (link field) */
443 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
445 /* Output the file name changing the suffix to .d for Sun tcov
447 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
449 char *cwd = getpwd ();
450 int len = strlen (filename) + strlen (cwd) + 1;
451 char *data_file = (char *) alloca (len + 4);
453 strcpy (data_file, cwd);
454 strcat (data_file, "/");
455 strcat (data_file, filename);
456 strip_off_ending (data_file, len);
457 if (profile_block_flag)
458 strcat (data_file, ".d");
460 strcat (data_file, ".da");
461 assemble_string (data_file, strlen (data_file) + 1);
464 /* Make space for the table of counts. */
467 /* Realign data section. */
468 ASM_OUTPUT_ALIGN (asm_out_file, align);
469 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
471 assemble_zeros (size);
475 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
476 #ifdef ASM_OUTPUT_SHARED_LOCAL
477 if (flag_shared_data)
478 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
481 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
482 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
485 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
486 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
489 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
494 /* Output any basic block strings */
495 if (profile_block_flag)
497 readonly_data_section ();
500 ASM_OUTPUT_ALIGN (asm_out_file, align);
501 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
503 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC",
505 assemble_string (sptr->string, sptr->length);
510 /* Output the table of addresses. */
511 if (profile_block_flag)
513 /* Realign in new section */
514 ASM_OUTPUT_ALIGN (asm_out_file, align);
515 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
516 for (i = 0; i < count_basic_blocks; i++)
518 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
519 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
524 /* Output the table of function names. */
525 if (profile_block_flag)
527 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
528 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
530 if (ptr->func_label_num >= 0)
532 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
533 ptr->func_label_num);
534 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
538 assemble_integer (const0_rtx, pointer_bytes, 1);
541 for ( ; i < count_basic_blocks; i++)
542 assemble_integer (const0_rtx, pointer_bytes, 1);
545 if (write_symbols != NO_DEBUG && profile_block_flag)
547 /* Output the table of line numbers. */
548 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
549 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
550 assemble_integer (GEN_INT (ptr->line_num), long_bytes, 1);
552 for ( ; i < count_basic_blocks; i++)
553 assemble_integer (const0_rtx, long_bytes, 1);
555 /* Output the table of file names. */
556 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
557 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
559 if (ptr->file_label_num >= 0)
561 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
562 ptr->file_label_num);
563 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
567 assemble_integer (const0_rtx, pointer_bytes, 1);
570 for ( ; i < count_basic_blocks; i++)
571 assemble_integer (const0_rtx, pointer_bytes, 1);
574 /* End with the address of the table of addresses,
575 so we can find it easily, as the last word in the file's text. */
576 if (profile_block_flag)
578 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
579 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
585 /* Enable APP processing of subsequent output.
586 Used before the output from an `asm' statement. */
593 fputs (ASM_APP_ON, asm_out_file);
598 /* Disable APP processing of subsequent output.
599 Called from varasm.c before most kinds of output. */
606 fputs (ASM_APP_OFF, asm_out_file);
611 /* Return the number of slots filled in the current
612 delayed branch sequence (we don't count the insn needing the
613 delay slot). Zero if not in a delayed branch sequence. */
617 dbr_sequence_length ()
619 if (final_sequence != 0)
620 return XVECLEN (final_sequence, 0) - 1;
626 /* The next two pages contain routines used to compute the length of an insn
627 and to shorten branches. */
629 /* Arrays for insn lengths, and addresses. The latter is referenced by
630 `insn_current_length'. */
632 static short *insn_lengths;
635 /* Address of insn being processed. Used by `insn_current_length'. */
636 int insn_current_address;
638 /* Address of insn being processed in previous iteration. */
639 int insn_last_address;
641 /* konwn invariant alignment of insn being processed. */
642 int insn_current_align;
644 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
645 gives the next following alignment insn that increases the known
646 alignment, or NULL_RTX if there is no such insn.
647 For any alignment obtained this way, we can again index uid_align with
648 its uid to obtain the next following align that in turn increases the
649 alignment, till we reach NULL_RTX; the sequence obtained this way
650 for each insn we'll call the alignment chain of this insn in the following
653 struct label_alignment {
658 static rtx *uid_align;
659 static int *uid_shuid;
660 static struct label_alignment *label_align;
662 /* Indicate that branch shortening hasn't yet been done. */
684 free (insn_addresses);
694 /* Obtain the current length of an insn. If branch shortening has been done,
695 get its actual length. Otherwise, get its maximum length. */
698 get_attr_length (insn)
701 #ifdef HAVE_ATTR_length
707 return insn_lengths[INSN_UID (insn)];
709 switch (GET_CODE (insn))
717 length = insn_default_length (insn);
721 body = PATTERN (insn);
722 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
724 /* Alignment is machine-dependent and should be handled by
728 length = insn_default_length (insn);
732 body = PATTERN (insn);
733 if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
736 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
737 length = asm_insn_count (body) * insn_default_length (insn);
738 else if (GET_CODE (body) == SEQUENCE)
739 for (i = 0; i < XVECLEN (body, 0); i++)
740 length += get_attr_length (XVECEXP (body, 0, i));
742 length = insn_default_length (insn);
749 #ifdef ADJUST_INSN_LENGTH
750 ADJUST_INSN_LENGTH (insn, length);
753 #else /* not HAVE_ATTR_length */
755 #endif /* not HAVE_ATTR_length */
758 /* Code to handle alignment inside shorten_branches. */
760 /* Here is an explanation how the algorithm in align_fuzz can give
763 Call a sequence of instructions beginning with alignment point X
764 and continuing until the next alignment point `block X'. When `X'
765 is used in an expression, it means the alignment value of the
768 Call the distance between the start of the first insn of block X, and
769 the end of the last insn of block X `IX', for the `inner size of X'.
770 This is clearly the sum of the instruction lengths.
772 Likewise with the next alignment-delimited block following X, which we
775 Call the distance between the start of the first insn of block X, and
776 the start of the first insn of block Y `OX', for the `outer size of X'.
778 The estimated padding is then OX - IX.
780 OX can be safely estimated as
785 OX = round_up(IX, X) + Y - X
787 Clearly est(IX) >= real(IX), because that only depends on the
788 instruction lengths, and those being overestimated is a given.
790 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
791 we needn't worry about that when thinking about OX.
793 When X >= Y, the alignment provided by Y adds no uncertainty factor
794 for branch ranges starting before X, so we can just round what we have.
795 But when X < Y, we don't know anything about the, so to speak,
796 `middle bits', so we have to assume the worst when aligning up from an
797 address mod X to one mod Y, which is Y - X. */
800 #define LABEL_ALIGN(LABEL) 0
803 #ifndef LABEL_ALIGN_MAX_SKIP
804 #define LABEL_ALIGN_MAX_SKIP 0
808 #define LOOP_ALIGN(LABEL) 0
811 #ifndef LOOP_ALIGN_MAX_SKIP
812 #define LOOP_ALIGN_MAX_SKIP 0
815 #ifndef LABEL_ALIGN_AFTER_BARRIER
816 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
819 #ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
820 #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP 0
823 #ifndef ADDR_VEC_ALIGN
825 final_addr_vec_align (addr_vec)
828 int align = exact_log2 (GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec))));
830 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
831 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
835 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
838 #ifndef INSN_LENGTH_ALIGNMENT
839 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
842 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
844 static int min_labelno, max_labelno;
846 #define LABEL_TO_ALIGNMENT(LABEL) \
847 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
849 #define LABEL_TO_MAX_SKIP(LABEL) \
850 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
852 /* For the benefit of port specific code do this also as a function. */
854 label_to_alignment (label)
857 return LABEL_TO_ALIGNMENT (label);
860 #ifdef HAVE_ATTR_length
861 /* The differences in addresses
862 between a branch and its target might grow or shrink depending on
863 the alignment the start insn of the range (the branch for a forward
864 branch or the label for a backward branch) starts out on; if these
865 differences are used naively, they can even oscillate infinitely.
866 We therefore want to compute a 'worst case' address difference that
867 is independent of the alignment the start insn of the range end
868 up on, and that is at least as large as the actual difference.
869 The function align_fuzz calculates the amount we have to add to the
870 naively computed difference, by traversing the part of the alignment
871 chain of the start insn of the range that is in front of the end insn
872 of the range, and considering for each alignment the maximum amount
873 that it might contribute to a size increase.
875 For casesi tables, we also want to know worst case minimum amounts of
876 address difference, in case a machine description wants to introduce
877 some common offset that is added to all offsets in a table.
878 For this purpose, align_fuzz with a growth argument of 0 comuptes the
879 appropriate adjustment. */
882 /* Compute the maximum delta by which the difference of the addresses of
883 START and END might grow / shrink due to a different address for start
884 which changes the size of alignment insns between START and END.
885 KNOWN_ALIGN_LOG is the alignment known for START.
886 GROWTH should be ~0 if the objective is to compute potential code size
887 increase, and 0 if the objective is to compute potential shrink.
888 The return value is undefined for any other value of GROWTH. */
890 align_fuzz (start, end, known_align_log, growth)
895 int uid = INSN_UID (start);
897 int known_align = 1 << known_align_log;
898 int end_shuid = INSN_SHUID (end);
901 for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
903 int align_addr, new_align;
905 uid = INSN_UID (align_label);
906 align_addr = insn_addresses[uid] - insn_lengths[uid];
907 if (uid_shuid[uid] > end_shuid)
909 known_align_log = LABEL_TO_ALIGNMENT (align_label);
910 new_align = 1 << known_align_log;
911 if (new_align < known_align)
913 fuzz += (-align_addr ^ growth) & (new_align - known_align);
914 known_align = new_align;
919 /* Compute a worst-case reference address of a branch so that it
920 can be safely used in the presence of aligned labels. Since the
921 size of the branch itself is unknown, the size of the branch is
922 not included in the range. I.e. for a forward branch, the reference
923 address is the end address of the branch as known from the previous
924 branch shortening pass, minus a value to account for possible size
925 increase due to alignment. For a backward branch, it is the start
926 address of the branch as known from the current pass, plus a value
927 to account for possible size increase due to alignment.
928 NB.: Therefore, the maximum offset allowed for backward branches needs
929 to exclude the branch size. */
931 insn_current_reference_address (branch)
935 rtx seq = NEXT_INSN (PREV_INSN (branch));
936 int seq_uid = INSN_UID (seq);
937 if (GET_CODE (branch) != JUMP_INSN)
938 /* This can happen for example on the PA; the objective is to know the
939 offset to address something in front of the start of the function.
940 Thus, we can treat it like a backward branch.
941 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
942 any alignment we'd encounter, so we skip the call to align_fuzz. */
943 return insn_current_address;
944 dest = JUMP_LABEL (branch);
945 /* BRANCH has no proper alignment chain set, so use SEQ. */
946 if (INSN_SHUID (branch) < INSN_SHUID (dest))
948 /* Forward branch. */
949 return (insn_last_address + insn_lengths[seq_uid]
950 - align_fuzz (seq, dest, length_unit_log, ~0));
954 /* Backward branch. */
955 return (insn_current_address
956 + align_fuzz (dest, seq, length_unit_log, ~0));
959 #endif /* HAVE_ATTR_length */
961 /* Make a pass over all insns and compute their actual lengths by shortening
962 any branches of variable length if possible. */
964 /* Give a default value for the lowest address in a function. */
966 #ifndef FIRST_INSN_ADDRESS
967 #define FIRST_INSN_ADDRESS 0
970 /* shorten_branches might be called multiple times: for example, the SH
971 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
972 In order to do this, it needs proper length information, which it obtains
973 by calling shorten_branches. This cannot be collapsed with
974 shorten_branches itself into a single pass unless we also want to intergate
975 reorg.c, since the branch splitting exposes new instructions with delay
979 shorten_branches (first)
987 #ifdef HAVE_ATTR_length
988 #define MAX_CODE_ALIGN 16
990 int something_changed = 1;
991 char *varying_length;
994 rtx align_tab[MAX_CODE_ALIGN];
996 /* In order to make sure that all instructions have valid length info,
997 we must split them before we compute the address/length info. */
999 for (insn = NEXT_INSN (first); insn; insn = NEXT_INSN (insn))
1000 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1003 insn = try_split (PATTERN (old), old, 1);
1004 /* When not optimizing, the old insn will be still left around
1005 with only the 'deleted' bit set. Transform it into a note
1006 to avoid confusion of subsequent processing. */
1007 if (INSN_DELETED_P (old))
1009 PUT_CODE (old , NOTE);
1010 NOTE_LINE_NUMBER (old) = NOTE_INSN_DELETED;
1011 NOTE_SOURCE_FILE (old) = 0;
1016 /* We must do some computations even when not actually shortening, in
1017 order to get the alignment information for the labels. */
1019 init_insn_lengths ();
1021 /* Compute maximum UID and allocate label_align / uid_shuid. */
1022 max_uid = get_max_uid ();
1024 max_labelno = max_label_num ();
1025 min_labelno = get_first_label_num ();
1026 label_align = (struct label_alignment *) xmalloc (
1027 (max_labelno - min_labelno + 1) * sizeof (struct label_alignment));
1028 bzero ((char *) label_align,
1029 (max_labelno - min_labelno + 1) * sizeof (struct label_alignment));
1031 uid_shuid = (int *) xmalloc (max_uid * sizeof *uid_shuid);
1033 /* Initialize label_align and set up uid_shuid to be strictly
1034 monotonically rising with insn order. */
1035 /* We use max_log here to keep track of the maximum alignment we want to
1036 impose on the next CODE_LABEL (or the current one if we are processing
1037 the CODE_LABEL itself). */
1042 for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
1046 INSN_SHUID (insn) = i++;
1047 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1049 /* reorg might make the first insn of a loop being run once only,
1050 and delete the label in front of it. Then we want to apply
1051 the loop alignment to the new label created by reorg, which
1052 is separated by the former loop start insn from the
1053 NOTE_INSN_LOOP_BEG. */
1055 else if (GET_CODE (insn) == CODE_LABEL)
1059 log = LABEL_ALIGN (insn);
1063 max_skip = LABEL_ALIGN_MAX_SKIP;
1065 next = NEXT_INSN (insn);
1066 /* ADDR_VECs only take room if read-only data goes into the text
1068 if (JUMP_TABLES_IN_TEXT_SECTION
1069 #if !defined(READONLY_DATA_SECTION)
1073 if (next && GET_CODE (next) == JUMP_INSN)
1075 rtx nextbody = PATTERN (next);
1076 if (GET_CODE (nextbody) == ADDR_VEC
1077 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1079 log = ADDR_VEC_ALIGN (next);
1083 max_skip = LABEL_ALIGN_MAX_SKIP;
1087 LABEL_TO_ALIGNMENT (insn) = max_log;
1088 LABEL_TO_MAX_SKIP (insn) = max_skip;
1092 else if (GET_CODE (insn) == BARRIER)
1096 for (label = insn; label && GET_RTX_CLASS (GET_CODE (label)) != 'i';
1097 label = NEXT_INSN (label))
1098 if (GET_CODE (label) == CODE_LABEL)
1100 log = LABEL_ALIGN_AFTER_BARRIER (insn);
1104 max_skip = LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP;
1109 /* Again, we allow NOTE_INSN_LOOP_BEG - INSN - CODE_LABEL
1110 sequences in order to handle reorg output efficiently. */
1111 else if (GET_CODE (insn) == NOTE
1112 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
1116 for (label = insn; label; label = NEXT_INSN (label))
1117 if (GET_CODE (label) == CODE_LABEL)
1119 log = LOOP_ALIGN (insn);
1123 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_addresses = (int *) xmalloc (max_uid * sizeof (int));
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 bzero ((char *)insn_addresses, max_uid * sizeof *insn_addresses);
1139 uid_align = (rtx *) xmalloc (max_uid * sizeof *uid_align);
1141 varying_length = (char *) xmalloc (max_uid * sizeof (char));
1143 bzero (varying_length, max_uid);
1145 /* Initialize uid_align. We scan instructions
1146 from end to start, and keep in align_tab[n] the last seen insn
1147 that does an alignment of at least n+1, i.e. the successor
1148 in the alignment chain for an insn that does / has a known
1151 bzero ((char *) uid_align, max_uid * sizeof *uid_align);
1153 for (i = MAX_CODE_ALIGN; --i >= 0; )
1154 align_tab[i] = NULL_RTX;
1155 seq = get_last_insn ();
1156 for (; seq; seq = PREV_INSN (seq))
1158 int uid = INSN_UID (seq);
1160 log = (GET_CODE (seq) == CODE_LABEL ? LABEL_TO_ALIGNMENT (seq) : 0);
1161 uid_align[uid] = align_tab[0];
1164 /* Found an alignment label. */
1165 uid_align[uid] = align_tab[log];
1166 for (i = log - 1; i >= 0; i--)
1170 #ifdef CASE_VECTOR_SHORTEN_MODE
1173 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1176 int min_shuid = INSN_SHUID (get_insns ()) - 1;
1177 int max_shuid = INSN_SHUID (get_last_insn ()) + 1;
1180 for (insn = first; insn != 0; insn = NEXT_INSN (insn))
1182 rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat;
1183 int len, i, min, max, insn_shuid;
1185 addr_diff_vec_flags flags;
1187 if (GET_CODE (insn) != JUMP_INSN
1188 || GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)
1190 pat = PATTERN (insn);
1191 len = XVECLEN (pat, 1);
1194 min_align = MAX_CODE_ALIGN;
1195 for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
1197 rtx lab = XEXP (XVECEXP (pat, 1, i), 0);
1198 int shuid = INSN_SHUID (lab);
1209 if (min_align > LABEL_TO_ALIGNMENT (lab))
1210 min_align = LABEL_TO_ALIGNMENT (lab);
1212 XEXP (pat, 2) = gen_rtx_LABEL_REF (VOIDmode, min_lab);
1213 XEXP (pat, 3) = gen_rtx_LABEL_REF (VOIDmode, max_lab);
1214 insn_shuid = INSN_SHUID (insn);
1215 rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0));
1216 flags.min_align = min_align;
1217 flags.base_after_vec = rel > insn_shuid;
1218 flags.min_after_vec = min > insn_shuid;
1219 flags.max_after_vec = max > insn_shuid;
1220 flags.min_after_base = min > rel;
1221 flags.max_after_base = max > rel;
1222 ADDR_DIFF_VEC_FLAGS (pat) = flags;
1225 #endif /* CASE_VECTOR_SHORTEN_MODE */
1228 /* Compute initial lengths, addresses, and varying flags for each insn. */
1229 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1231 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1233 uid = INSN_UID (insn);
1235 insn_lengths[uid] = 0;
1237 if (GET_CODE (insn) == CODE_LABEL)
1239 int log = LABEL_TO_ALIGNMENT (insn);
1242 int align = 1 << log;
1243 int new_address = (insn_current_address + align - 1) & -align;
1244 insn_lengths[uid] = new_address - insn_current_address;
1245 insn_current_address = new_address;
1249 insn_addresses[uid] = insn_current_address;
1251 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
1252 || GET_CODE (insn) == CODE_LABEL)
1254 if (INSN_DELETED_P (insn))
1257 body = PATTERN (insn);
1258 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1260 /* This only takes room if read-only data goes into the text
1262 if (JUMP_TABLES_IN_TEXT_SECTION
1263 #if !defined(READONLY_DATA_SECTION)
1267 insn_lengths[uid] = (XVECLEN (body,
1268 GET_CODE (body) == ADDR_DIFF_VEC)
1269 * GET_MODE_SIZE (GET_MODE (body)));
1270 /* Alignment is handled by ADDR_VEC_ALIGN. */
1272 else if (asm_noperands (body) >= 0)
1273 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
1274 else if (GET_CODE (body) == SEQUENCE)
1277 int const_delay_slots;
1279 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
1281 const_delay_slots = 0;
1283 /* Inside a delay slot sequence, we do not do any branch shortening
1284 if the shortening could change the number of delay slots
1286 for (i = 0; i < XVECLEN (body, 0); i++)
1288 rtx inner_insn = XVECEXP (body, 0, i);
1289 int inner_uid = INSN_UID (inner_insn);
1292 if (asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
1293 inner_length = (asm_insn_count (PATTERN (inner_insn))
1294 * insn_default_length (inner_insn));
1296 inner_length = insn_default_length (inner_insn);
1298 insn_lengths[inner_uid] = inner_length;
1299 if (const_delay_slots)
1301 if ((varying_length[inner_uid]
1302 = insn_variable_length_p (inner_insn)) != 0)
1303 varying_length[uid] = 1;
1304 insn_addresses[inner_uid] = (insn_current_address +
1308 varying_length[inner_uid] = 0;
1309 insn_lengths[uid] += inner_length;
1312 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
1314 insn_lengths[uid] = insn_default_length (insn);
1315 varying_length[uid] = insn_variable_length_p (insn);
1318 /* If needed, do any adjustment. */
1319 #ifdef ADJUST_INSN_LENGTH
1320 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
1324 /* Now loop over all the insns finding varying length insns. For each,
1325 get the current insn length. If it has changed, reflect the change.
1326 When nothing changes for a full pass, we are done. */
1328 while (something_changed)
1330 something_changed = 0;
1331 insn_current_align = MAX_CODE_ALIGN - 1;
1332 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1334 insn = NEXT_INSN (insn))
1337 #ifdef ADJUST_INSN_LENGTH
1342 uid = INSN_UID (insn);
1344 if (GET_CODE (insn) == CODE_LABEL)
1346 int log = LABEL_TO_ALIGNMENT (insn);
1347 if (log > insn_current_align)
1349 int align = 1 << log;
1350 int new_address= (insn_current_address + align - 1) & -align;
1351 insn_lengths[uid] = new_address - insn_current_address;
1352 insn_current_align = log;
1353 insn_current_address = new_address;
1356 insn_lengths[uid] = 0;
1357 insn_addresses[uid] = insn_current_address;
1361 length_align = INSN_LENGTH_ALIGNMENT (insn);
1362 if (length_align < insn_current_align)
1363 insn_current_align = length_align;
1365 insn_last_address = insn_addresses[uid];
1366 insn_addresses[uid] = insn_current_address;
1368 #ifdef CASE_VECTOR_SHORTEN_MODE
1369 if (optimize && GET_CODE (insn) == JUMP_INSN
1370 && GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
1372 rtx body = PATTERN (insn);
1373 int old_length = insn_lengths[uid];
1374 rtx rel_lab = XEXP (XEXP (body, 0), 0);
1375 rtx min_lab = XEXP (XEXP (body, 2), 0);
1376 rtx max_lab = XEXP (XEXP (body, 3), 0);
1377 addr_diff_vec_flags flags = ADDR_DIFF_VEC_FLAGS (body);
1378 int rel_addr = insn_addresses[INSN_UID (rel_lab)];
1379 int min_addr = insn_addresses[INSN_UID (min_lab)];
1380 int max_addr = insn_addresses[INSN_UID (max_lab)];
1384 /* Try to find a known alignment for rel_lab. */
1385 for (prev = rel_lab;
1387 && ! insn_lengths[INSN_UID (prev)]
1388 && ! (varying_length[INSN_UID (prev)] & 1);
1389 prev = PREV_INSN (prev))
1390 if (varying_length[INSN_UID (prev)] & 2)
1392 rel_align = LABEL_TO_ALIGNMENT (prev);
1396 /* See the comment on addr_diff_vec_flags in rtl.h for the
1397 meaning of the flags values. base: REL_LAB vec: INSN */
1398 /* Anything after INSN has still addresses from the last
1399 pass; adjust these so that they reflect our current
1400 estimate for this pass. */
1401 if (flags.base_after_vec)
1402 rel_addr += insn_current_address - insn_last_address;
1403 if (flags.min_after_vec)
1404 min_addr += insn_current_address - insn_last_address;
1405 if (flags.max_after_vec)
1406 max_addr += insn_current_address - insn_last_address;
1407 /* We want to know the worst case, i.e. lowest possible value
1408 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1409 its offset is positive, and we have to be wary of code shrink;
1410 otherwise, it is negative, and we have to be vary of code
1412 if (flags.min_after_base)
1414 /* If INSN is between REL_LAB and MIN_LAB, the size
1415 changes we are about to make can change the alignment
1416 within the observed offset, therefore we have to break
1417 it up into two parts that are independent. */
1418 if (! flags.base_after_vec && flags.min_after_vec)
1420 min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
1421 min_addr -= align_fuzz (insn, min_lab, 0, 0);
1424 min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
1428 if (flags.base_after_vec && ! flags.min_after_vec)
1430 min_addr -= align_fuzz (min_lab, insn, 0, ~0);
1431 min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
1434 min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
1436 /* Likewise, determine the highest lowest possible value
1437 for the offset of MAX_LAB. */
1438 if (flags.max_after_base)
1440 if (! flags.base_after_vec && flags.max_after_vec)
1442 max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
1443 max_addr += align_fuzz (insn, max_lab, 0, ~0);
1446 max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
1450 if (flags.base_after_vec && ! flags.max_after_vec)
1452 max_addr += align_fuzz (max_lab, insn, 0, 0);
1453 max_addr += align_fuzz (insn, rel_lab, 0, 0);
1456 max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
1458 PUT_MODE (body, CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
1459 max_addr - rel_addr,
1461 if (JUMP_TABLES_IN_TEXT_SECTION
1462 #if !defined(READONLY_DATA_SECTION)
1468 = (XVECLEN (body, 1) * GET_MODE_SIZE (GET_MODE (body)));
1469 insn_current_address += insn_lengths[uid];
1470 if (insn_lengths[uid] != old_length)
1471 something_changed = 1;
1476 #endif /* CASE_VECTOR_SHORTEN_MODE */
1478 if (! (varying_length[uid]))
1480 insn_current_address += insn_lengths[uid];
1483 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
1487 body = PATTERN (insn);
1489 for (i = 0; i < XVECLEN (body, 0); i++)
1491 rtx inner_insn = XVECEXP (body, 0, i);
1492 int inner_uid = INSN_UID (inner_insn);
1495 insn_addresses[inner_uid] = insn_current_address;
1497 /* insn_current_length returns 0 for insns with a
1498 non-varying length. */
1499 if (! varying_length[inner_uid])
1500 inner_length = insn_lengths[inner_uid];
1502 inner_length = insn_current_length (inner_insn);
1504 if (inner_length != insn_lengths[inner_uid])
1506 insn_lengths[inner_uid] = inner_length;
1507 something_changed = 1;
1509 insn_current_address += insn_lengths[inner_uid];
1510 new_length += inner_length;
1515 new_length = insn_current_length (insn);
1516 insn_current_address += new_length;
1519 #ifdef ADJUST_INSN_LENGTH
1520 /* If needed, do any adjustment. */
1521 tmp_length = new_length;
1522 ADJUST_INSN_LENGTH (insn, new_length);
1523 insn_current_address += (new_length - tmp_length);
1526 if (new_length != insn_lengths[uid])
1528 insn_lengths[uid] = new_length;
1529 something_changed = 1;
1532 /* For a non-optimizing compile, do only a single pass. */
1537 free (varying_length);
1539 #endif /* HAVE_ATTR_length */
1542 #ifdef HAVE_ATTR_length
1543 /* Given the body of an INSN known to be generated by an ASM statement, return
1544 the number of machine instructions likely to be generated for this insn.
1545 This is used to compute its length. */
1548 asm_insn_count (body)
1554 if (GET_CODE (body) == ASM_INPUT)
1555 template = XSTR (body, 0);
1557 template = decode_asm_operands (body, NULL_PTR, NULL_PTR,
1558 NULL_PTR, NULL_PTR);
1560 for ( ; *template; template++)
1561 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
1568 /* Output assembler code for the start of a function,
1569 and initialize some of the variables in this file
1570 for the new function. The label for the function and associated
1571 assembler pseudo-ops have already been output in `assemble_start_function'.
1573 FIRST is the first insn of the rtl for the function being compiled.
1574 FILE is the file to write assembler code to.
1575 OPTIMIZE is nonzero if we should eliminate redundant
1576 test and compare insns. */
1579 final_start_function (first, file, optimize)
1586 this_is_asm_operands = 0;
1588 #ifdef NON_SAVING_SETJMP
1589 /* A function that calls setjmp should save and restore all the
1590 call-saved registers on a system where longjmp clobbers them. */
1591 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
1595 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1596 if (!call_used_regs[i])
1597 regs_ever_live[i] = 1;
1601 /* Initial line number is supposed to be output
1602 before the function's prologue and label
1603 so that the function's address will not appear to be
1604 in the last statement of the preceding function. */
1605 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1606 last_linenum = high_block_linenum = high_function_linenum
1607 = NOTE_LINE_NUMBER (first);
1609 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1610 /* Output DWARF definition of the function. */
1611 if (dwarf2out_do_frame ())
1612 dwarf2out_begin_prologue ();
1615 /* For SDB and XCOFF, the function beginning must be marked between
1616 the function label and the prologue. We always need this, even when
1617 -g1 was used. Defer on MIPS systems so that parameter descriptions
1618 follow function entry. */
1619 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
1620 if (write_symbols == SDB_DEBUG)
1621 sdbout_begin_function (last_linenum);
1624 #ifdef XCOFF_DEBUGGING_INFO
1625 if (write_symbols == XCOFF_DEBUG)
1626 xcoffout_begin_function (file, last_linenum);
1629 /* But only output line number for other debug info types if -g2
1631 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1632 output_source_line (file, first);
1634 #ifdef LEAF_REG_REMAP
1636 leaf_renumber_regs (first);
1639 /* The Sun386i and perhaps other machines don't work right
1640 if the profiling code comes after the prologue. */
1641 #ifdef PROFILE_BEFORE_PROLOGUE
1643 profile_function (file);
1644 #endif /* PROFILE_BEFORE_PROLOGUE */
1646 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1647 if (dwarf2out_do_frame ())
1648 dwarf2out_frame_debug (NULL_RTX);
1651 #ifdef FUNCTION_PROLOGUE
1652 /* First output the function prologue: code to set up the stack frame. */
1653 FUNCTION_PROLOGUE (file, get_frame_size ());
1656 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1657 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
1658 next_block_index = 1;
1661 /* If the machine represents the prologue as RTL, the profiling code must
1662 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1663 #ifdef HAVE_prologue
1664 if (! HAVE_prologue)
1666 profile_after_prologue (file);
1670 /* If we are doing basic block profiling, remember a printable version
1671 of the function name. */
1672 if (profile_block_flag)
1675 = add_bb_string ((*decl_printable_name) (current_function_decl, 2), FALSE);
1680 profile_after_prologue (file)
1683 #ifdef FUNCTION_BLOCK_PROFILER
1684 if (profile_block_flag)
1686 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
1688 #endif /* FUNCTION_BLOCK_PROFILER */
1690 #ifndef PROFILE_BEFORE_PROLOGUE
1692 profile_function (file);
1693 #endif /* not PROFILE_BEFORE_PROLOGUE */
1697 profile_function (file)
1700 int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1701 #if defined(ASM_OUTPUT_REG_PUSH)
1702 #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1703 int sval = current_function_returns_struct;
1705 #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1706 int cxt = current_function_needs_context;
1708 #endif /* ASM_OUTPUT_REG_PUSH */
1711 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1712 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
1713 assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, 1);
1715 function_section (current_function_decl);
1717 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1719 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
1721 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1724 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1729 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1731 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1733 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1736 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1741 FUNCTION_PROFILER (file, profile_label_no);
1743 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1745 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1747 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1750 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1755 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1757 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1759 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1762 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1768 /* Output assembler code for the end of a function.
1769 For clarity, args are same as those of `final_start_function'
1770 even though not all of them are needed. */
1773 final_end_function (first, file, optimize)
1780 fputs (ASM_APP_OFF, file);
1784 #ifdef SDB_DEBUGGING_INFO
1785 if (write_symbols == SDB_DEBUG)
1786 sdbout_end_function (high_function_linenum);
1789 #ifdef DWARF_DEBUGGING_INFO
1790 if (write_symbols == DWARF_DEBUG)
1791 dwarfout_end_function ();
1794 #ifdef XCOFF_DEBUGGING_INFO
1795 if (write_symbols == XCOFF_DEBUG)
1796 xcoffout_end_function (file, high_function_linenum);
1799 #ifdef FUNCTION_EPILOGUE
1800 /* Finally, output the function epilogue:
1801 code to restore the stack frame and return to the caller. */
1802 FUNCTION_EPILOGUE (file, get_frame_size ());
1805 #ifdef SDB_DEBUGGING_INFO
1806 if (write_symbols == SDB_DEBUG)
1807 sdbout_end_epilogue ();
1810 #ifdef DWARF_DEBUGGING_INFO
1811 if (write_symbols == DWARF_DEBUG)
1812 dwarfout_end_epilogue ();
1815 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1816 if (dwarf2out_do_frame ())
1817 dwarf2out_end_epilogue ();
1820 #ifdef XCOFF_DEBUGGING_INFO
1821 if (write_symbols == XCOFF_DEBUG)
1822 xcoffout_end_epilogue (file);
1825 bb_func_label_num = -1; /* not in function, nuke label # */
1827 /* If FUNCTION_EPILOGUE is not defined, then the function body
1828 itself contains return instructions wherever needed. */
1831 /* Add a block to the linked list that remembers the current line/file/function
1832 for basic block profiling. Emit the label in front of the basic block and
1833 the instructions that increment the count field. */
1839 struct bb_list *ptr = (struct bb_list *) permalloc (sizeof (struct bb_list));
1841 /* Add basic block to linked list. */
1843 ptr->line_num = last_linenum;
1844 ptr->file_label_num = bb_file_label_num;
1845 ptr->func_label_num = bb_func_label_num;
1847 bb_tail = &ptr->next;
1849 /* Enable the table of basic-block use counts
1850 to point at the code it applies to. */
1851 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1853 /* Before first insn of this basic block, increment the
1854 count of times it was entered. */
1855 #ifdef BLOCK_PROFILER
1856 BLOCK_PROFILER (file, count_basic_blocks);
1863 count_basic_blocks++;
1866 /* Add a string to be used for basic block profiling. */
1869 add_bb_string (string, perm_p)
1874 struct bb_str *ptr = 0;
1878 string = "<unknown>";
1882 /* Allocate a new string if the current string isn't permanent. If
1883 the string is permanent search for the same string in other
1886 len = strlen (string) + 1;
1889 char *p = (char *) permalloc (len);
1890 bcopy (string, p, len);
1894 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1895 if (ptr->string == string)
1898 /* Allocate a new string block if we need to. */
1901 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1904 ptr->label_num = sbb_label_num++;
1905 ptr->string = string;
1907 sbb_tail = &ptr->next;
1910 return ptr->label_num;
1914 /* Output assembler code for some insns: all or part of a function.
1915 For description of args, see `final_start_function', above.
1917 PRESCAN is 1 if we are not really outputting,
1918 just scanning as if we were outputting.
1919 Prescanning deletes and rearranges insns just like ordinary output.
1920 PRESCAN is -2 if we are outputting after having prescanned.
1921 In this case, don't try to delete or rearrange insns
1922 because that has already been done.
1923 Prescanning is done only on certain machines. */
1926 final (first, file, optimize, prescan)
1936 last_ignored_compare = 0;
1939 check_exception_handler_labels ();
1941 /* Make a map indicating which line numbers appear in this function.
1942 When producing SDB debugging info, delete troublesome line number
1943 notes from inlined functions in other files as well as duplicate
1944 line number notes. */
1945 #ifdef SDB_DEBUGGING_INFO
1946 if (write_symbols == SDB_DEBUG)
1949 for (insn = first; insn; insn = NEXT_INSN (insn))
1950 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1952 if ((RTX_INTEGRATED_P (insn)
1953 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1955 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1956 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1958 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1959 NOTE_SOURCE_FILE (insn) = 0;
1963 if (NOTE_LINE_NUMBER (insn) > max_line)
1964 max_line = NOTE_LINE_NUMBER (insn);
1970 for (insn = first; insn; insn = NEXT_INSN (insn))
1971 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1972 max_line = NOTE_LINE_NUMBER (insn);
1975 line_note_exists = (char *) oballoc (max_line + 1);
1976 bzero (line_note_exists, max_line + 1);
1978 for (insn = first; insn; insn = NEXT_INSN (insn))
1980 if (INSN_UID (insn) > max_uid) /* find largest UID */
1981 max_uid = INSN_UID (insn);
1982 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1983 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
1985 /* If CC tracking across branches is enabled, record the insn which
1986 jumps to each branch only reached from one place. */
1987 if (optimize && GET_CODE (insn) == JUMP_INSN)
1989 rtx lab = JUMP_LABEL (insn);
1990 if (lab && LABEL_NUSES (lab) == 1)
1992 LABEL_REFS (lab) = insn;
1998 /* Initialize insn_eh_region table if eh is being used. */
2000 init_insn_eh_region (first, max_uid);
2006 /* Output the insns. */
2007 for (insn = NEXT_INSN (first); insn;)
2009 #ifdef HAVE_ATTR_length
2010 insn_current_address = insn_addresses[INSN_UID (insn)];
2012 insn = final_scan_insn (insn, file, optimize, prescan, 0);
2015 /* Do basic-block profiling here
2016 if the last insn was a conditional branch. */
2017 if (profile_block_flag && new_block)
2020 free_insn_eh_region ();
2023 /* The final scan for one insn, INSN.
2024 Args are same as in `final', except that INSN
2025 is the insn being scanned.
2026 Value returned is the next insn to be scanned.
2028 NOPEEPHOLES is the flag to disallow peephole processing (currently
2029 used for within delayed branch sequence output). */
2032 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
2045 /* Ignore deleted insns. These can occur when we split insns (due to a
2046 template of "#") while not optimizing. */
2047 if (INSN_DELETED_P (insn))
2048 return NEXT_INSN (insn);
2050 switch (GET_CODE (insn))
2056 /* Align the beginning of a loop, for higher speed
2057 on certain machines. */
2059 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
2060 break; /* This used to depend on optimize, but that was bogus. */
2061 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END)
2064 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG
2065 && ! exceptions_via_longjmp)
2067 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHB", NOTE_BLOCK_NUMBER (insn));
2068 if (! flag_new_exceptions)
2069 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn));
2070 #ifdef ASM_OUTPUT_EH_REGION_BEG
2071 ASM_OUTPUT_EH_REGION_BEG (file, NOTE_BLOCK_NUMBER (insn));
2076 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END
2077 && ! exceptions_via_longjmp)
2079 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHE", NOTE_BLOCK_NUMBER (insn));
2080 if (flag_new_exceptions)
2081 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn));
2082 #ifdef ASM_OUTPUT_EH_REGION_END
2083 ASM_OUTPUT_EH_REGION_END (file, NOTE_BLOCK_NUMBER (insn));
2088 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
2090 #ifdef FUNCTION_END_PROLOGUE
2091 FUNCTION_END_PROLOGUE (file);
2093 profile_after_prologue (file);
2097 #ifdef FUNCTION_BEGIN_EPILOGUE
2098 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
2100 FUNCTION_BEGIN_EPILOGUE (file);
2105 if (write_symbols == NO_DEBUG)
2107 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
2109 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
2110 /* MIPS stabs require the parameter descriptions to be after the
2111 function entry point rather than before. */
2112 if (write_symbols == SDB_DEBUG)
2113 sdbout_begin_function (last_linenum);
2116 #ifdef DWARF_DEBUGGING_INFO
2117 /* This outputs a marker where the function body starts, so it
2118 must be after the prologue. */
2119 if (write_symbols == DWARF_DEBUG)
2120 dwarfout_begin_function ();
2124 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED)
2125 break; /* An insn that was "deleted" */
2128 fputs (ASM_APP_OFF, file);
2131 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG
2132 && (debug_info_level == DINFO_LEVEL_NORMAL
2133 || debug_info_level == DINFO_LEVEL_VERBOSE
2134 || write_symbols == DWARF_DEBUG
2135 || write_symbols == DWARF2_DEBUG))
2137 /* Beginning of a symbol-block. Assign it a sequence number
2138 and push the number onto the stack PENDING_BLOCKS. */
2140 if (block_depth == max_block_depth)
2142 /* PENDING_BLOCKS is full; make it longer. */
2143 max_block_depth *= 2;
2145 = (int *) xrealloc (pending_blocks,
2146 max_block_depth * sizeof (int));
2148 pending_blocks[block_depth++] = next_block_index;
2150 high_block_linenum = last_linenum;
2152 /* Output debugging info about the symbol-block beginning. */
2154 #ifdef SDB_DEBUGGING_INFO
2155 if (write_symbols == SDB_DEBUG)
2156 sdbout_begin_block (file, last_linenum, next_block_index);
2158 #ifdef XCOFF_DEBUGGING_INFO
2159 if (write_symbols == XCOFF_DEBUG)
2160 xcoffout_begin_block (file, last_linenum, next_block_index);
2162 #ifdef DBX_DEBUGGING_INFO
2163 if (write_symbols == DBX_DEBUG)
2164 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", next_block_index);
2166 #ifdef DWARF_DEBUGGING_INFO
2167 if (write_symbols == DWARF_DEBUG)
2168 dwarfout_begin_block (next_block_index);
2170 #ifdef DWARF2_DEBUGGING_INFO
2171 if (write_symbols == DWARF2_DEBUG)
2172 dwarf2out_begin_block (next_block_index);
2177 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END
2178 && (debug_info_level == DINFO_LEVEL_NORMAL
2179 || debug_info_level == DINFO_LEVEL_VERBOSE
2180 || write_symbols == DWARF_DEBUG
2181 || write_symbols == DWARF2_DEBUG))
2183 /* End of a symbol-block. Pop its sequence number off
2184 PENDING_BLOCKS and output debugging info based on that. */
2187 if (block_depth < 0)
2190 #ifdef XCOFF_DEBUGGING_INFO
2191 if (write_symbols == XCOFF_DEBUG)
2192 xcoffout_end_block (file, high_block_linenum,
2193 pending_blocks[block_depth]);
2195 #ifdef DBX_DEBUGGING_INFO
2196 if (write_symbols == DBX_DEBUG)
2197 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE",
2198 pending_blocks[block_depth]);
2200 #ifdef SDB_DEBUGGING_INFO
2201 if (write_symbols == SDB_DEBUG)
2202 sdbout_end_block (file, high_block_linenum,
2203 pending_blocks[block_depth]);
2205 #ifdef DWARF_DEBUGGING_INFO
2206 if (write_symbols == DWARF_DEBUG)
2207 dwarfout_end_block (pending_blocks[block_depth]);
2209 #ifdef DWARF2_DEBUGGING_INFO
2210 if (write_symbols == DWARF2_DEBUG)
2211 dwarf2out_end_block (pending_blocks[block_depth]);
2214 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL
2215 && (debug_info_level == DINFO_LEVEL_NORMAL
2216 || debug_info_level == DINFO_LEVEL_VERBOSE))
2218 #ifdef DWARF_DEBUGGING_INFO
2219 if (write_symbols == DWARF_DEBUG)
2220 dwarfout_label (insn);
2222 #ifdef DWARF2_DEBUGGING_INFO
2223 if (write_symbols == DWARF2_DEBUG)
2224 dwarf2out_label (insn);
2227 else if (NOTE_LINE_NUMBER (insn) > 0)
2228 /* This note is a line-number. */
2232 #if 0 /* This is what we used to do. */
2233 output_source_line (file, insn);
2237 /* If there is anything real after this note,
2238 output it. If another line note follows, omit this one. */
2239 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
2241 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
2243 /* These types of notes can be significant
2244 so make sure the preceding line number stays. */
2245 else if (GET_CODE (note) == NOTE
2246 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
2247 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
2248 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
2250 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
2252 /* Another line note follows; we can delete this note
2253 if no intervening line numbers have notes elsewhere. */
2255 for (num = NOTE_LINE_NUMBER (insn) + 1;
2256 num < NOTE_LINE_NUMBER (note);
2258 if (line_note_exists[num])
2261 if (num >= NOTE_LINE_NUMBER (note))
2267 /* Output this line note
2268 if it is the first or the last line note in a row. */
2270 output_source_line (file, insn);
2275 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2276 /* If we push arguments, we need to check all insns for stack
2278 if (dwarf2out_do_frame ())
2279 dwarf2out_frame_debug (insn);
2284 /* The target port might emit labels in the output function for
2285 some insn, e.g. sh.c output_branchy_insn. */
2286 if (CODE_LABEL_NUMBER (insn) <= max_labelno)
2288 int align = LABEL_TO_ALIGNMENT (insn);
2289 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2290 int max_skip = LABEL_TO_MAX_SKIP (insn);
2293 if (align && NEXT_INSN (insn))
2294 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2295 ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip);
2297 ASM_OUTPUT_ALIGN (file, align);
2302 /* If this label is reached from only one place, set the condition
2303 codes from the instruction just before the branch. */
2305 /* Disabled because some insns set cc_status in the C output code
2306 and NOTICE_UPDATE_CC alone can set incorrect status. */
2307 if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
2309 rtx jump = LABEL_REFS (insn);
2310 rtx barrier = prev_nonnote_insn (insn);
2312 /* If the LABEL_REFS field of this label has been set to point
2313 at a branch, the predecessor of the branch is a regular
2314 insn, and that branch is the only way to reach this label,
2315 set the condition codes based on the branch and its
2317 if (barrier && GET_CODE (barrier) == BARRIER
2318 && jump && GET_CODE (jump) == JUMP_INSN
2319 && (prev = prev_nonnote_insn (jump))
2320 && GET_CODE (prev) == INSN)
2322 NOTICE_UPDATE_CC (PATTERN (prev), prev);
2323 NOTICE_UPDATE_CC (PATTERN (jump), jump);
2331 #ifdef FINAL_PRESCAN_LABEL
2332 FINAL_PRESCAN_INSN (insn, NULL_PTR, 0);
2335 #ifdef SDB_DEBUGGING_INFO
2336 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
2337 sdbout_label (insn);
2339 #ifdef DWARF_DEBUGGING_INFO
2340 if (write_symbols == DWARF_DEBUG && LABEL_NAME (insn))
2341 dwarfout_label (insn);
2343 #ifdef DWARF2_DEBUGGING_INFO
2344 if (write_symbols == DWARF2_DEBUG && LABEL_NAME (insn))
2345 dwarf2out_label (insn);
2349 fputs (ASM_APP_OFF, file);
2352 if (NEXT_INSN (insn) != 0
2353 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
2355 rtx nextbody = PATTERN (NEXT_INSN (insn));
2357 /* If this label is followed by a jump-table,
2358 make sure we put the label in the read-only section. Also
2359 possibly write the label and jump table together. */
2361 if (GET_CODE (nextbody) == ADDR_VEC
2362 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
2364 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2365 /* In this case, the case vector is being moved by the
2366 target, so don't output the label at all. Leave that
2367 to the back end macros. */
2369 if (! JUMP_TABLES_IN_TEXT_SECTION)
2371 readonly_data_section ();
2372 #ifdef READONLY_DATA_SECTION
2373 ASM_OUTPUT_ALIGN (file,
2374 exact_log2 (BIGGEST_ALIGNMENT
2376 #endif /* READONLY_DATA_SECTION */
2379 function_section (current_function_decl);
2381 #ifdef ASM_OUTPUT_CASE_LABEL
2382 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
2385 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2392 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2397 register rtx body = PATTERN (insn);
2398 int insn_code_number;
2399 const char *template;
2404 /* An INSN, JUMP_INSN or CALL_INSN.
2405 First check for special kinds that recog doesn't recognize. */
2407 if (GET_CODE (body) == USE /* These are just declarations */
2408 || GET_CODE (body) == CLOBBER)
2412 /* If there is a REG_CC_SETTER note on this insn, it means that
2413 the setting of the condition code was done in the delay slot
2414 of the insn that branched here. So recover the cc status
2415 from the insn that set it. */
2417 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
2420 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
2421 cc_prev_status = cc_status;
2425 /* Detect insns that are really jump-tables
2426 and output them as such. */
2428 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
2430 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2431 register int vlen, idx;
2439 fputs (ASM_APP_OFF, file);
2443 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2444 if (GET_CODE (body) == ADDR_VEC)
2446 #ifdef ASM_OUTPUT_ADDR_VEC
2447 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2454 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2455 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2461 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
2462 for (idx = 0; idx < vlen; idx++)
2464 if (GET_CODE (body) == ADDR_VEC)
2466 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2467 ASM_OUTPUT_ADDR_VEC_ELT
2468 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
2475 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2476 ASM_OUTPUT_ADDR_DIFF_ELT
2479 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
2480 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
2486 #ifdef ASM_OUTPUT_CASE_END
2487 ASM_OUTPUT_CASE_END (file,
2488 CODE_LABEL_NUMBER (PREV_INSN (insn)),
2493 function_section (current_function_decl);
2498 /* Do basic-block profiling when we reach a new block.
2499 Done here to avoid jump tables. */
2500 if (profile_block_flag && new_block)
2503 if (GET_CODE (body) == ASM_INPUT)
2505 /* There's no telling what that did to the condition codes. */
2511 fputs (ASM_APP_ON, file);
2514 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
2518 /* Detect `asm' construct with operands. */
2519 if (asm_noperands (body) >= 0)
2521 unsigned int noperands = asm_noperands (body);
2522 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
2525 /* There's no telling what that did to the condition codes. */
2532 fputs (ASM_APP_ON, file);
2536 /* Get out the operand values. */
2537 string = decode_asm_operands (body, ops, NULL_PTR,
2538 NULL_PTR, NULL_PTR);
2539 /* Inhibit aborts on what would otherwise be compiler bugs. */
2540 insn_noperands = noperands;
2541 this_is_asm_operands = insn;
2543 /* Output the insn using them. */
2544 output_asm_insn (string, ops);
2545 this_is_asm_operands = 0;
2549 if (prescan <= 0 && app_on)
2551 fputs (ASM_APP_OFF, file);
2555 if (GET_CODE (body) == SEQUENCE)
2557 /* A delayed-branch sequence */
2563 final_sequence = body;
2565 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2566 force the restoration of a comparison that was previously
2567 thought unnecessary. If that happens, cancel this sequence
2568 and cause that insn to be restored. */
2570 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
2571 if (next != XVECEXP (body, 0, 1))
2577 for (i = 1; i < XVECLEN (body, 0); i++)
2579 rtx insn = XVECEXP (body, 0, i);
2580 rtx next = NEXT_INSN (insn);
2581 /* We loop in case any instruction in a delay slot gets
2584 insn = final_scan_insn (insn, file, 0, prescan, 1);
2585 while (insn != next);
2587 #ifdef DBR_OUTPUT_SEQEND
2588 DBR_OUTPUT_SEQEND (file);
2592 /* If the insn requiring the delay slot was a CALL_INSN, the
2593 insns in the delay slot are actually executed before the
2594 called function. Hence we don't preserve any CC-setting
2595 actions in these insns and the CC must be marked as being
2596 clobbered by the function. */
2597 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
2602 /* Following a conditional branch sequence, we have a new basic
2604 if (profile_block_flag)
2606 rtx insn = XVECEXP (body, 0, 0);
2607 rtx body = PATTERN (insn);
2609 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2610 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2611 || (GET_CODE (insn) == JUMP_INSN
2612 && GET_CODE (body) == PARALLEL
2613 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2614 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
2620 /* We have a real machine instruction as rtl. */
2622 body = PATTERN (insn);
2625 set = single_set(insn);
2627 /* Check for redundant test and compare instructions
2628 (when the condition codes are already set up as desired).
2629 This is done only when optimizing; if not optimizing,
2630 it should be possible for the user to alter a variable
2631 with the debugger in between statements
2632 and the next statement should reexamine the variable
2633 to compute the condition codes. */
2638 rtx set = single_set(insn);
2642 && GET_CODE (SET_DEST (set)) == CC0
2643 && insn != last_ignored_compare)
2645 if (GET_CODE (SET_SRC (set)) == SUBREG)
2646 SET_SRC (set) = alter_subreg (SET_SRC (set));
2647 else if (GET_CODE (SET_SRC (set)) == COMPARE)
2649 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
2650 XEXP (SET_SRC (set), 0)
2651 = alter_subreg (XEXP (SET_SRC (set), 0));
2652 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
2653 XEXP (SET_SRC (set), 1)
2654 = alter_subreg (XEXP (SET_SRC (set), 1));
2656 if ((cc_status.value1 != 0
2657 && rtx_equal_p (SET_SRC (set), cc_status.value1))
2658 || (cc_status.value2 != 0
2659 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
2661 /* Don't delete insn if it has an addressing side-effect. */
2662 if (! FIND_REG_INC_NOTE (insn, 0)
2663 /* or if anything in it is volatile. */
2664 && ! volatile_refs_p (PATTERN (insn)))
2666 /* We don't really delete the insn; just ignore it. */
2667 last_ignored_compare = insn;
2675 /* Following a conditional branch, we have a new basic block.
2676 But if we are inside a sequence, the new block starts after the
2677 last insn of the sequence. */
2678 if (profile_block_flag && final_sequence == 0
2679 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2680 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2681 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
2682 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2683 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
2687 /* Don't bother outputting obvious no-ops, even without -O.
2688 This optimization is fast and doesn't interfere with debugging.
2689 Don't do this if the insn is in a delay slot, since this
2690 will cause an improper number of delay insns to be written. */
2691 if (final_sequence == 0
2693 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
2694 && GET_CODE (SET_SRC (body)) == REG
2695 && GET_CODE (SET_DEST (body)) == REG
2696 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
2701 /* If this is a conditional branch, maybe modify it
2702 if the cc's are in a nonstandard state
2703 so that it accomplishes the same thing that it would
2704 do straightforwardly if the cc's were set up normally. */
2706 if (cc_status.flags != 0
2707 && GET_CODE (insn) == JUMP_INSN
2708 && GET_CODE (body) == SET
2709 && SET_DEST (body) == pc_rtx
2710 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
2711 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
2712 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
2713 /* This is done during prescan; it is not done again
2714 in final scan when prescan has been done. */
2717 /* This function may alter the contents of its argument
2718 and clear some of the cc_status.flags bits.
2719 It may also return 1 meaning condition now always true
2720 or -1 meaning condition now always false
2721 or 2 meaning condition nontrivial but altered. */
2722 register int result = alter_cond (XEXP (SET_SRC (body), 0));
2723 /* If condition now has fixed value, replace the IF_THEN_ELSE
2724 with its then-operand or its else-operand. */
2726 SET_SRC (body) = XEXP (SET_SRC (body), 1);
2728 SET_SRC (body) = XEXP (SET_SRC (body), 2);
2730 /* The jump is now either unconditional or a no-op.
2731 If it has become a no-op, don't try to output it.
2732 (It would not be recognized.) */
2733 if (SET_SRC (body) == pc_rtx)
2735 PUT_CODE (insn, NOTE);
2736 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2737 NOTE_SOURCE_FILE (insn) = 0;
2740 else if (GET_CODE (SET_SRC (body)) == RETURN)
2741 /* Replace (set (pc) (return)) with (return). */
2742 PATTERN (insn) = body = SET_SRC (body);
2744 /* Rerecognize the instruction if it has changed. */
2746 INSN_CODE (insn) = -1;
2749 /* Make same adjustments to instructions that examine the
2750 condition codes without jumping and instructions that
2751 handle conditional moves (if this machine has either one). */
2753 if (cc_status.flags != 0
2756 rtx cond_rtx, then_rtx, else_rtx;
2758 if (GET_CODE (insn) != JUMP_INSN
2759 && GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
2761 cond_rtx = XEXP (SET_SRC (set), 0);
2762 then_rtx = XEXP (SET_SRC (set), 1);
2763 else_rtx = XEXP (SET_SRC (set), 2);
2767 cond_rtx = SET_SRC (set);
2768 then_rtx = const_true_rtx;
2769 else_rtx = const0_rtx;
2772 switch (GET_CODE (cond_rtx))
2785 register int result;
2786 if (XEXP (cond_rtx, 0) != cc0_rtx)
2788 result = alter_cond (cond_rtx);
2790 validate_change (insn, &SET_SRC (set), then_rtx, 0);
2791 else if (result == -1)
2792 validate_change (insn, &SET_SRC (set), else_rtx, 0);
2793 else if (result == 2)
2794 INSN_CODE (insn) = -1;
2795 if (SET_DEST (set) == SET_SRC (set))
2797 PUT_CODE (insn, NOTE);
2798 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2799 NOTE_SOURCE_FILE (insn) = 0;
2811 /* Do machine-specific peephole optimizations if desired. */
2813 if (optimize && !flag_no_peephole && !nopeepholes)
2815 rtx next = peephole (insn);
2816 /* When peepholing, if there were notes within the peephole,
2817 emit them before the peephole. */
2818 if (next != 0 && next != NEXT_INSN (insn))
2820 rtx prev = PREV_INSN (insn);
2823 for (note = NEXT_INSN (insn); note != next;
2824 note = NEXT_INSN (note))
2825 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2827 /* In case this is prescan, put the notes
2828 in proper position for later rescan. */
2829 note = NEXT_INSN (insn);
2830 PREV_INSN (note) = prev;
2831 NEXT_INSN (prev) = note;
2832 NEXT_INSN (PREV_INSN (next)) = insn;
2833 PREV_INSN (insn) = PREV_INSN (next);
2834 NEXT_INSN (insn) = next;
2835 PREV_INSN (next) = insn;
2838 /* PEEPHOLE might have changed this. */
2839 body = PATTERN (insn);
2842 /* Try to recognize the instruction.
2843 If successful, verify that the operands satisfy the
2844 constraints for the instruction. Crash if they don't,
2845 since `reload' should have changed them so that they do. */
2847 insn_code_number = recog_memoized (insn);
2848 extract_insn (insn);
2849 cleanup_subreg_operands (insn);
2851 #ifdef REGISTER_CONSTRAINTS
2852 if (! constrain_operands (1))
2853 fatal_insn_not_found (insn);
2856 /* Some target machines need to prescan each insn before
2859 #ifdef FINAL_PRESCAN_INSN
2860 FINAL_PRESCAN_INSN (insn, recog_operand, recog_n_operands);
2864 cc_prev_status = cc_status;
2866 /* Update `cc_status' for this instruction.
2867 The instruction's output routine may change it further.
2868 If the output routine for a jump insn needs to depend
2869 on the cc status, it should look at cc_prev_status. */
2871 NOTICE_UPDATE_CC (body, insn);
2876 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2877 /* If we push arguments, we want to know where the calls are. */
2878 if (GET_CODE (insn) == CALL_INSN && dwarf2out_do_frame ())
2879 dwarf2out_frame_debug (insn);
2882 /* If the proper template needs to be chosen by some C code,
2883 run that code and get the real template. */
2885 template = insn_template[insn_code_number];
2888 template = (*insn_outfun[insn_code_number]) (recog_operand, insn);
2890 /* If the C code returns 0, it means that it is a jump insn
2891 which follows a deleted test insn, and that test insn
2892 needs to be reinserted. */
2895 if (prev_nonnote_insn (insn) != last_ignored_compare)
2898 return prev_nonnote_insn (insn);
2902 /* If the template is the string "#", it means that this insn must
2904 if (template[0] == '#' && template[1] == '\0')
2906 rtx new = try_split (body, insn, 0);
2908 /* If we didn't split the insn, go away. */
2909 if (new == insn && PATTERN (new) == body)
2910 fatal_insn ("Could not split insn", insn);
2912 #ifdef HAVE_ATTR_length
2913 /* This instruction should have been split in shorten_branches,
2914 to ensure that we would have valid length info for the
2926 /* Output assembler code from the template. */
2928 output_asm_insn (template, recog_operand);
2930 #if defined (DWARF2_UNWIND_INFO)
2931 #if !defined (ACCUMULATE_OUTGOING_ARGS)
2932 /* If we push arguments, we need to check all insns for stack
2934 if (GET_CODE (insn) == INSN && dwarf2out_do_frame ())
2935 dwarf2out_frame_debug (insn);
2937 #if defined (HAVE_prologue)
2938 /* If this insn is part of the prologue, emit DWARF v2
2940 if (RTX_FRAME_RELATED_P (insn) && dwarf2out_do_frame ())
2941 dwarf2out_frame_debug (insn);
2947 /* It's not at all clear why we did this and doing so interferes
2948 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2951 /* Mark this insn as having been output. */
2952 INSN_DELETED_P (insn) = 1;
2958 return NEXT_INSN (insn);
2961 /* Output debugging info to the assembler file FILE
2962 based on the NOTE-insn INSN, assumed to be a line number. */
2965 output_source_line (file, insn)
2969 register char *filename = NOTE_SOURCE_FILE (insn);
2971 /* Remember filename for basic block profiling.
2972 Filenames are allocated on the permanent obstack
2973 or are passed in ARGV, so we don't have to save
2976 if (profile_block_flag && last_filename != filename)
2977 bb_file_label_num = add_bb_string (filename, TRUE);
2979 last_filename = filename;
2980 last_linenum = NOTE_LINE_NUMBER (insn);
2981 high_block_linenum = MAX (last_linenum, high_block_linenum);
2982 high_function_linenum = MAX (last_linenum, high_function_linenum);
2984 if (write_symbols != NO_DEBUG)
2986 #ifdef SDB_DEBUGGING_INFO
2987 if (write_symbols == SDB_DEBUG
2988 #if 0 /* People like having line numbers even in wrong file! */
2989 /* COFF can't handle multiple source files--lose, lose. */
2990 && !strcmp (filename, main_input_filename)
2992 /* COFF relative line numbers must be positive. */
2993 && last_linenum > sdb_begin_function_line)
2995 #ifdef ASM_OUTPUT_SOURCE_LINE
2996 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
2998 fprintf (file, "\t.ln\t%d\n",
2999 ((sdb_begin_function_line > -1)
3000 ? last_linenum - sdb_begin_function_line : 1));
3005 #if defined (DBX_DEBUGGING_INFO)
3006 if (write_symbols == DBX_DEBUG)
3007 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
3010 #if defined (XCOFF_DEBUGGING_INFO)
3011 if (write_symbols == XCOFF_DEBUG)
3012 xcoffout_source_line (file, filename, insn);
3015 #ifdef DWARF_DEBUGGING_INFO
3016 if (write_symbols == DWARF_DEBUG)
3017 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
3020 #ifdef DWARF2_DEBUGGING_INFO
3021 if (write_symbols == DWARF2_DEBUG)
3022 dwarf2out_line (filename, NOTE_LINE_NUMBER (insn));
3028 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3029 directly to the desired hard register. */
3031 cleanup_subreg_operands (insn)
3036 extract_insn (insn);
3037 for (i = 0; i < recog_n_operands; i++)
3039 if (GET_CODE (recog_operand[i]) == SUBREG)
3040 recog_operand[i] = alter_subreg (recog_operand[i]);
3041 else if (GET_CODE (recog_operand[i]) == PLUS
3042 || GET_CODE (recog_operand[i]) == MULT)
3043 recog_operand[i] = walk_alter_subreg (recog_operand[i]);
3046 for (i = 0; i < recog_n_dups; i++)
3048 if (GET_CODE (*recog_dup_loc[i]) == SUBREG)
3049 *recog_dup_loc[i] = alter_subreg (*recog_dup_loc[i]);
3050 else if (GET_CODE (*recog_dup_loc[i]) == PLUS
3051 || GET_CODE (*recog_dup_loc[i]) == MULT)
3052 *recog_dup_loc[i] = walk_alter_subreg (*recog_dup_loc[i]);
3056 /* If X is a SUBREG, replace it with a REG or a MEM,
3057 based on the thing it is a subreg of. */
3063 register rtx y = SUBREG_REG (x);
3065 if (GET_CODE (y) == SUBREG)
3066 y = alter_subreg (y);
3068 /* If reload is operating, we may be replacing inside this SUBREG.
3069 Check for that and make a new one if so. */
3070 if (reload_in_progress && find_replacement (&SUBREG_REG (x)) != 0)
3073 if (GET_CODE (y) == REG)
3075 /* If the word size is larger than the size of this register,
3076 adjust the register number to compensate. */
3077 /* ??? Note that this just catches stragglers created by/for
3078 integrate. It would be better if we either caught these
3079 earlier, or kept _all_ subregs until now and eliminate
3080 gen_lowpart and friends. */
3083 #ifdef ALTER_HARD_SUBREG
3084 REGNO (x) = ALTER_HARD_SUBREG(GET_MODE (x), SUBREG_WORD (x),
3085 GET_MODE (y), REGNO (y));
3087 REGNO (x) = REGNO (y) + SUBREG_WORD (x);
3089 /* This field has a different meaning for REGs and SUBREGs. Make sure
3093 else if (GET_CODE (y) == MEM)
3095 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
3096 if (BYTES_BIG_ENDIAN)
3097 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
3098 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
3100 MEM_COPY_ATTRIBUTES (x, y);
3101 MEM_ALIAS_SET (x) = MEM_ALIAS_SET (y);
3102 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
3108 /* Do alter_subreg on all the SUBREGs contained in X. */
3111 walk_alter_subreg (x)
3114 switch (GET_CODE (x))
3118 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3119 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
3123 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3127 return alter_subreg (x);
3138 /* Given BODY, the body of a jump instruction, alter the jump condition
3139 as required by the bits that are set in cc_status.flags.
3140 Not all of the bits there can be handled at this level in all cases.
3142 The value is normally 0.
3143 1 means that the condition has become always true.
3144 -1 means that the condition has become always false.
3145 2 means that COND has been altered. */
3153 if (cc_status.flags & CC_REVERSED)
3156 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
3159 if (cc_status.flags & CC_INVERTED)
3162 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
3165 if (cc_status.flags & CC_NOT_POSITIVE)
3166 switch (GET_CODE (cond))
3171 /* Jump becomes unconditional. */
3177 /* Jump becomes no-op. */
3181 PUT_CODE (cond, EQ);
3186 PUT_CODE (cond, NE);
3194 if (cc_status.flags & CC_NOT_NEGATIVE)
3195 switch (GET_CODE (cond))
3199 /* Jump becomes unconditional. */
3204 /* Jump becomes no-op. */
3209 PUT_CODE (cond, EQ);
3215 PUT_CODE (cond, NE);
3223 if (cc_status.flags & CC_NO_OVERFLOW)
3224 switch (GET_CODE (cond))
3227 /* Jump becomes unconditional. */
3231 PUT_CODE (cond, EQ);
3236 PUT_CODE (cond, NE);
3241 /* Jump becomes no-op. */
3248 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
3249 switch (GET_CODE (cond))
3255 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
3260 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
3265 if (cc_status.flags & CC_NOT_SIGNED)
3266 /* The flags are valid if signed condition operators are converted
3268 switch (GET_CODE (cond))
3271 PUT_CODE (cond, LEU);
3276 PUT_CODE (cond, LTU);
3281 PUT_CODE (cond, GTU);
3286 PUT_CODE (cond, GEU);
3298 /* Report inconsistency between the assembler template and the operands.
3299 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3302 output_operand_lossage (msgid)
3305 if (this_is_asm_operands)
3306 error_for_asm (this_is_asm_operands, "invalid `asm': %s", _(msgid));
3308 fatal ("Internal compiler error, output_operand_lossage `%s'", _(msgid));
3311 /* Output of assembler code from a template, and its subroutines. */
3313 /* Output text from TEMPLATE to the assembler output file,
3314 obeying %-directions to substitute operands taken from
3315 the vector OPERANDS.
3317 %N (for N a digit) means print operand N in usual manner.
3318 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3319 and print the label name with no punctuation.
3320 %cN means require operand N to be a constant
3321 and print the constant expression with no punctuation.
3322 %aN means expect operand N to be a memory address
3323 (not a memory reference!) and print a reference
3325 %nN means expect operand N to be a constant
3326 and print a constant expression for minus the value
3327 of the operand, with no other punctuation. */
3332 if (flag_print_asm_name)
3334 /* Annotate the assembly with a comment describing the pattern and
3335 alternative used. */
3338 register int num = INSN_CODE (debug_insn);
3339 fprintf (asm_out_file, "\t%s %d\t%s",
3340 ASM_COMMENT_START, INSN_UID (debug_insn), insn_name[num]);
3341 if (insn_n_alternatives[num] > 1)
3342 fprintf (asm_out_file, "/%d", which_alternative + 1);
3343 #ifdef HAVE_ATTR_length
3344 fprintf (asm_out_file, "\t[length = %d]", get_attr_length (debug_insn));
3346 /* Clear this so only the first assembler insn
3347 of any rtl insn will get the special comment for -dp. */
3354 output_asm_insn (template, operands)
3355 const char *template;
3358 register const char *p;
3361 /* An insn may return a null string template
3362 in a case where no assembler code is needed. */
3367 putc ('\t', asm_out_file);
3369 #ifdef ASM_OUTPUT_OPCODE
3370 ASM_OUTPUT_OPCODE (asm_out_file, p);
3378 putc (c, asm_out_file);
3379 #ifdef ASM_OUTPUT_OPCODE
3380 while ((c = *p) == '\t')
3382 putc (c, asm_out_file);
3385 ASM_OUTPUT_OPCODE (asm_out_file, p);
3389 #ifdef ASSEMBLER_DIALECT
3394 /* If we want the first dialect, do nothing. Otherwise, skip
3395 DIALECT_NUMBER of strings ending with '|'. */
3396 for (i = 0; i < dialect_number; i++)
3398 while (*p && *p++ != '|')
3408 /* Skip to close brace. */
3409 while (*p && *p++ != '}')
3418 /* %% outputs a single %. */
3422 putc (c, asm_out_file);
3424 /* %= outputs a number which is unique to each insn in the entire
3425 compilation. This is useful for making local labels that are
3426 referred to more than once in a given insn. */
3430 fprintf (asm_out_file, "%d", insn_counter);
3432 /* % followed by a letter and some digits
3433 outputs an operand in a special way depending on the letter.
3434 Letters `acln' are implemented directly.
3435 Other letters are passed to `output_operand' so that
3436 the PRINT_OPERAND macro can define them. */
3437 else if ((*p >= 'a' && *p <= 'z')
3438 || (*p >= 'A' && *p <= 'Z'))
3443 if (! (*p >= '0' && *p <= '9'))
3444 output_operand_lossage ("operand number missing after %-letter");
3445 else if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3446 output_operand_lossage ("operand number out of range");
3447 else if (letter == 'l')
3448 output_asm_label (operands[c]);
3449 else if (letter == 'a')
3450 output_address (operands[c]);
3451 else if (letter == 'c')
3453 if (CONSTANT_ADDRESS_P (operands[c]))
3454 output_addr_const (asm_out_file, operands[c]);
3456 output_operand (operands[c], 'c');
3458 else if (letter == 'n')
3460 if (GET_CODE (operands[c]) == CONST_INT)
3461 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
3462 - INTVAL (operands[c]));
3465 putc ('-', asm_out_file);
3466 output_addr_const (asm_out_file, operands[c]);
3470 output_operand (operands[c], letter);
3472 while ((c = *p) >= '0' && c <= '9') p++;
3474 /* % followed by a digit outputs an operand the default way. */
3475 else if (*p >= '0' && *p <= '9')
3478 if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3479 output_operand_lossage ("operand number out of range");
3481 output_operand (operands[c], 0);
3482 while ((c = *p) >= '0' && c <= '9') p++;
3484 /* % followed by punctuation: output something for that
3485 punctuation character alone, with no operand.
3486 The PRINT_OPERAND macro decides what is actually done. */
3487 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3488 else if (PRINT_OPERAND_PUNCT_VALID_P ((unsigned char)*p))
3489 output_operand (NULL_RTX, *p++);
3492 output_operand_lossage ("invalid %%-code");
3496 putc (c, asm_out_file);
3501 putc ('\n', asm_out_file);
3504 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3507 output_asm_label (x)
3512 if (GET_CODE (x) == LABEL_REF)
3513 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3514 else if (GET_CODE (x) == CODE_LABEL)
3515 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3517 output_operand_lossage ("`%l' operand isn't a label");
3519 assemble_name (asm_out_file, buf);
3522 /* Print operand X using machine-dependent assembler syntax.
3523 The macro PRINT_OPERAND is defined just to control this function.
3524 CODE is a non-digit that preceded the operand-number in the % spec,
3525 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3526 between the % and the digits.
3527 When CODE is a non-letter, X is 0.
3529 The meanings of the letters are machine-dependent and controlled
3530 by PRINT_OPERAND. */
3533 output_operand (x, code)
3537 if (x && GET_CODE (x) == SUBREG)
3538 x = alter_subreg (x);
3540 /* If X is a pseudo-register, abort now rather than writing trash to the
3543 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
3546 PRINT_OPERAND (asm_out_file, x, code);
3549 /* Print a memory reference operand for address X
3550 using machine-dependent assembler syntax.
3551 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3557 walk_alter_subreg (x);
3558 PRINT_OPERAND_ADDRESS (asm_out_file, x);
3561 /* Print an integer constant expression in assembler syntax.
3562 Addition and subtraction are the only arithmetic
3563 that may appear in these expressions. */
3566 output_addr_const (file, x)
3573 switch (GET_CODE (x))
3583 assemble_name (file, XSTR (x, 0));
3587 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3588 assemble_name (file, buf);
3592 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3593 assemble_name (file, buf);
3597 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
3601 /* This used to output parentheses around the expression,
3602 but that does not work on the 386 (either ATT or BSD assembler). */
3603 output_addr_const (file, XEXP (x, 0));
3607 if (GET_MODE (x) == VOIDmode)
3609 /* We can use %d if the number is one word and positive. */
3610 if (CONST_DOUBLE_HIGH (x))
3611 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3612 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
3613 else if (CONST_DOUBLE_LOW (x) < 0)
3614 fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
3616 fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
3619 /* We can't handle floating point constants;
3620 PRINT_OPERAND must handle them. */
3621 output_operand_lossage ("floating constant misused");
3625 /* Some assemblers need integer constants to appear last (eg masm). */
3626 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
3628 output_addr_const (file, XEXP (x, 1));
3629 if (INTVAL (XEXP (x, 0)) >= 0)
3630 fprintf (file, "+");
3631 output_addr_const (file, XEXP (x, 0));
3635 output_addr_const (file, XEXP (x, 0));
3636 if (INTVAL (XEXP (x, 1)) >= 0)
3637 fprintf (file, "+");
3638 output_addr_const (file, XEXP (x, 1));
3643 /* Avoid outputting things like x-x or x+5-x,
3644 since some assemblers can't handle that. */
3645 x = simplify_subtraction (x);
3646 if (GET_CODE (x) != MINUS)
3649 output_addr_const (file, XEXP (x, 0));
3650 fprintf (file, "-");
3651 if (GET_CODE (XEXP (x, 1)) == CONST_INT
3652 && INTVAL (XEXP (x, 1)) < 0)
3654 fprintf (file, ASM_OPEN_PAREN);
3655 output_addr_const (file, XEXP (x, 1));
3656 fprintf (file, ASM_CLOSE_PAREN);
3659 output_addr_const (file, XEXP (x, 1));
3664 output_addr_const (file, XEXP (x, 0));
3668 output_operand_lossage ("invalid expression as operand");
3672 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3673 %R prints the value of REGISTER_PREFIX.
3674 %L prints the value of LOCAL_LABEL_PREFIX.
3675 %U prints the value of USER_LABEL_PREFIX.
3676 %I prints the value of IMMEDIATE_PREFIX.
3677 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3678 Also supported are %d, %x, %s, %e, %f, %g and %%.
3680 We handle alternate assembler dialects here, just like output_asm_insn. */
3683 asm_fprintf VPROTO((FILE *file, const char *p, ...))
3685 #ifndef ANSI_PROTOTYPES
3693 VA_START (argptr, p);
3695 #ifndef ANSI_PROTOTYPES
3696 file = va_arg (argptr, FILE *);
3697 p = va_arg (argptr, const char *);
3705 #ifdef ASSEMBLER_DIALECT
3710 /* If we want the first dialect, do nothing. Otherwise, skip
3711 DIALECT_NUMBER of strings ending with '|'. */
3712 for (i = 0; i < dialect_number; i++)
3714 while (*p && *p++ != '|')
3724 /* Skip to close brace. */
3725 while (*p && *p++ != '}')
3736 while ((c >= '0' && c <= '9') || c == '.')
3744 fprintf (file, "%%");
3747 case 'd': case 'i': case 'u':
3748 case 'x': case 'p': case 'X':
3752 fprintf (file, buf, va_arg (argptr, int));
3756 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3757 but we do not check for those cases. It means that the value
3758 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3760 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3762 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3772 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3779 fprintf (file, buf, va_arg (argptr, long));
3787 fprintf (file, buf, va_arg (argptr, double));
3793 fprintf (file, buf, va_arg (argptr, char *));
3797 #ifdef ASM_OUTPUT_OPCODE
3798 ASM_OUTPUT_OPCODE (asm_out_file, p);
3803 #ifdef REGISTER_PREFIX
3804 fprintf (file, "%s", REGISTER_PREFIX);
3809 #ifdef IMMEDIATE_PREFIX
3810 fprintf (file, "%s", IMMEDIATE_PREFIX);
3815 #ifdef LOCAL_LABEL_PREFIX
3816 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
3821 fputs (user_label_prefix, file);
3834 /* Split up a CONST_DOUBLE or integer constant rtx
3835 into two rtx's for single words,
3836 storing in *FIRST the word that comes first in memory in the target
3837 and in *SECOND the other. */
3840 split_double (value, first, second)
3842 rtx *first, *second;
3844 if (GET_CODE (value) == CONST_INT)
3846 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3848 /* In this case the CONST_INT holds both target words.
3849 Extract the bits from it into two word-sized pieces.
3850 Sign extend each half to HOST_WIDE_INT. */
3852 /* On machines where HOST_BITS_PER_WIDE_INT == BITS_PER_WORD
3853 the shift below will cause a compiler warning, even though
3854 this code won't be executed. So put the shift amounts in
3855 variables to avoid the warning. */
3856 int rshift = HOST_BITS_PER_WIDE_INT - BITS_PER_WORD;
3857 int lshift = HOST_BITS_PER_WIDE_INT - 2 * BITS_PER_WORD;
3859 low = GEN_INT ((INTVAL (value) << rshift) >> rshift);
3860 high = GEN_INT ((INTVAL (value) << lshift) >> rshift);
3861 if (WORDS_BIG_ENDIAN)
3874 /* The rule for using CONST_INT for a wider mode
3875 is that we regard the value as signed.
3876 So sign-extend it. */
3877 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
3878 if (WORDS_BIG_ENDIAN)
3890 else if (GET_CODE (value) != CONST_DOUBLE)
3892 if (WORDS_BIG_ENDIAN)
3894 *first = const0_rtx;
3900 *second = const0_rtx;
3903 else if (GET_MODE (value) == VOIDmode
3904 /* This is the old way we did CONST_DOUBLE integers. */
3905 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
3907 /* In an integer, the words are defined as most and least significant.
3908 So order them by the target's convention. */
3909 if (WORDS_BIG_ENDIAN)
3911 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3912 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3916 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3917 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3922 #ifdef REAL_ARITHMETIC
3923 REAL_VALUE_TYPE r; long l[2];
3924 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
3926 /* Note, this converts the REAL_VALUE_TYPE to the target's
3927 format, splits up the floating point double and outputs
3928 exactly 32 bits of it into each of l[0] and l[1] --
3929 not necessarily BITS_PER_WORD bits. */
3930 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
3932 /* If 32 bits is an entire word for the target, but not for the host,
3933 then sign-extend on the host so that the number will look the same
3934 way on the host that it would on the target. See for instance
3935 simplify_unary_operation. The #if is needed to avoid compiler
3938 #if HOST_BITS_PER_LONG > 32
3939 if (BITS_PER_WORD < HOST_BITS_PER_LONG && BITS_PER_WORD == 32)
3941 if (l[0] & ((long) 1 << 31))
3942 l[0] |= ((long) (-1) << 32);
3943 if (l[1] & ((long) 1 << 31))
3944 l[1] |= ((long) (-1) << 32);
3948 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
3949 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
3951 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
3952 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
3953 && ! flag_pretend_float)
3957 #ifdef HOST_WORDS_BIG_ENDIAN
3964 /* Host and target agree => no need to swap. */
3965 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3966 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3970 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3971 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3973 #endif /* no REAL_ARITHMETIC */
3977 /* Return nonzero if this function has no function calls. */
3984 if (profile_flag || profile_block_flag || profile_arc_flag)
3987 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3989 if (GET_CODE (insn) == CALL_INSN)
3991 if (GET_CODE (insn) == INSN
3992 && GET_CODE (PATTERN (insn)) == SEQUENCE
3993 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN)
3996 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
3998 if (GET_CODE (XEXP (insn, 0)) == CALL_INSN)
4000 if (GET_CODE (XEXP (insn, 0)) == INSN
4001 && GET_CODE (PATTERN (XEXP (insn, 0))) == SEQUENCE
4002 && GET_CODE (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)) == CALL_INSN)
4009 /* On some machines, a function with no call insns
4010 can run faster if it doesn't create its own register window.
4011 When output, the leaf function should use only the "output"
4012 registers. Ordinarily, the function would be compiled to use
4013 the "input" registers to find its arguments; it is a candidate
4014 for leaf treatment if it uses only the "input" registers.
4015 Leaf function treatment means renumbering so the function
4016 uses the "output" registers instead. */
4018 #ifdef LEAF_REGISTERS
4020 static char permitted_reg_in_leaf_functions[] = LEAF_REGISTERS;
4022 /* Return 1 if this function uses only the registers that can be
4023 safely renumbered. */
4026 only_leaf_regs_used ()
4030 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4031 if ((regs_ever_live[i] || global_regs[i])
4032 && ! permitted_reg_in_leaf_functions[i])
4035 if (current_function_uses_pic_offset_table
4036 && pic_offset_table_rtx != 0
4037 && GET_CODE (pic_offset_table_rtx) == REG
4038 && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4044 /* Scan all instructions and renumber all registers into those
4045 available in leaf functions. */
4048 leaf_renumber_regs (first)
4053 /* Renumber only the actual patterns.
4054 The reg-notes can contain frame pointer refs,
4055 and renumbering them could crash, and should not be needed. */
4056 for (insn = first; insn; insn = NEXT_INSN (insn))
4057 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
4058 leaf_renumber_regs_insn (PATTERN (insn));
4059 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4060 if (GET_RTX_CLASS (GET_CODE (XEXP (insn, 0))) == 'i')
4061 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
4064 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4065 available in leaf functions. */
4068 leaf_renumber_regs_insn (in_rtx)
4069 register rtx in_rtx;
4072 register char *format_ptr;
4077 /* Renumber all input-registers into output-registers.
4078 renumbered_regs would be 1 for an output-register;
4081 if (GET_CODE (in_rtx) == REG)
4085 /* Don't renumber the same reg twice. */
4089 newreg = REGNO (in_rtx);
4090 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4091 to reach here as part of a REG_NOTE. */
4092 if (newreg >= FIRST_PSEUDO_REGISTER)
4097 newreg = LEAF_REG_REMAP (newreg);
4100 regs_ever_live[REGNO (in_rtx)] = 0;
4101 regs_ever_live[newreg] = 1;
4102 REGNO (in_rtx) = newreg;
4106 if (GET_RTX_CLASS (GET_CODE (in_rtx)) == 'i')
4108 /* Inside a SEQUENCE, we find insns.
4109 Renumber just the patterns of these insns,
4110 just as we do for the top-level insns. */
4111 leaf_renumber_regs_insn (PATTERN (in_rtx));
4115 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
4117 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
4118 switch (*format_ptr++)
4121 leaf_renumber_regs_insn (XEXP (in_rtx, i));
4125 if (NULL != XVEC (in_rtx, i))
4127 for (j = 0; j < XVECLEN (in_rtx, i); j++)
4128 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));