1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-98, 1999 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This is the final pass of the compiler.
23 It looks at the rtl code for a function and outputs assembler code.
25 Call `final_start_function' to output the assembler code for function entry,
26 `final' to output assembler code for some RTL code,
27 `final_end_function' to output assembler code for function exit.
28 If a function is compiled in several pieces, each piece is
29 output separately with `final'.
31 Some optimizations are also done at this level.
32 Move instructions that were made unnecessary by good register allocation
33 are detected and omitted from the output. (Though most of these
34 are removed by the last jump pass.)
36 Instructions to set the condition codes are omitted when it can be
37 seen that the condition codes already had the desired values.
39 In some cases it is sufficient if the inherited condition codes
40 have related values, but this may require the following insn
41 (the one that tests the condition codes) to be modified.
43 The code for the function prologue and epilogue are generated
44 directly as assembler code by the macros FUNCTION_PROLOGUE and
45 FUNCTION_EPILOGUE. Those instructions never exist as rtl. */
53 #include "insn-config.h"
54 #include "insn-flags.h"
55 #include "insn-attr.h"
56 #include "insn-codes.h"
58 #include "conditions.h"
61 #include "hard-reg-set.h"
70 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
71 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
73 #if defined (USG) || !defined (HAVE_STAB_H)
74 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
79 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
81 #ifdef XCOFF_DEBUGGING_INFO
85 #ifdef DWARF_DEBUGGING_INFO
89 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
90 #include "dwarf2out.h"
93 #ifdef SDB_DEBUGGING_INFO
97 /* .stabd code for line number. */
102 /* .stabs code for included file name. */
107 #ifndef INT_TYPE_SIZE
108 #define INT_TYPE_SIZE BITS_PER_WORD
111 #ifndef LONG_TYPE_SIZE
112 #define LONG_TYPE_SIZE BITS_PER_WORD
115 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
116 null default for it to save conditionalization later. */
117 #ifndef CC_STATUS_INIT
118 #define CC_STATUS_INIT
121 /* How to start an assembler comment. */
122 #ifndef ASM_COMMENT_START
123 #define ASM_COMMENT_START ";#"
126 /* Is the given character a logical line separator for the assembler? */
127 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
128 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
131 #ifndef JUMP_TABLES_IN_TEXT_SECTION
132 #define JUMP_TABLES_IN_TEXT_SECTION 0
135 /* Last insn processed by final_scan_insn. */
136 static rtx debug_insn = 0;
138 /* Line number of last NOTE. */
139 static int last_linenum;
141 /* Highest line number in current block. */
142 static int high_block_linenum;
144 /* Likewise for function. */
145 static int high_function_linenum;
147 /* Filename of last NOTE. */
148 static char *last_filename;
150 /* Number of basic blocks seen so far;
151 used if profile_block_flag is set. */
152 static int count_basic_blocks;
154 /* Number of instrumented arcs when profile_arc_flag is set. */
155 extern int count_instrumented_arcs;
157 extern int length_unit_log; /* This is defined in insn-attrtab.c. */
159 /* Nonzero while outputting an `asm' with operands.
160 This means that inconsistencies are the user's fault, so don't abort.
161 The precise value is the insn being output, to pass to error_for_asm. */
162 static rtx this_is_asm_operands;
164 /* Number of operands of this insn, for an `asm' with operands. */
165 static unsigned int insn_noperands;
167 /* Compare optimization flag. */
169 static rtx last_ignored_compare = 0;
171 /* Flag indicating this insn is the start of a new basic block. */
173 static int new_block = 1;
175 /* All the symbol-blocks (levels of scoping) in the compilation
176 are assigned sequence numbers in order of appearance of the
177 beginnings of the symbol-blocks. Both final and dbxout do this,
178 and assume that they will both give the same number to each block.
179 Final uses these sequence numbers to generate assembler label names
180 LBBnnn and LBEnnn for the beginning and end of the symbol-block.
181 Dbxout uses the sequence numbers to generate references to the same labels
182 from the dbx debugging information.
184 Sdb records this level at the beginning of each function,
185 in order to find the current level when recursing down declarations.
186 It outputs the block beginning and endings
187 at the point in the asm file where the blocks would begin and end. */
189 int next_block_index;
191 /* Assign a unique number to each insn that is output.
192 This can be used to generate unique local labels. */
194 static int insn_counter = 0;
197 /* This variable contains machine-dependent flags (defined in tm.h)
198 set and examined by output routines
199 that describe how to interpret the condition codes properly. */
203 /* During output of an insn, this contains a copy of cc_status
204 from before the insn. */
206 CC_STATUS cc_prev_status;
209 /* Indexed by hardware reg number, is 1 if that register is ever
210 used in the current function.
212 In life_analysis, or in stupid_life_analysis, this is set
213 up to record the hard regs used explicitly. Reload adds
214 in the hard regs used for holding pseudo regs. Final uses
215 it to generate the code in the function prologue and epilogue
216 to save and restore registers as needed. */
218 char regs_ever_live[FIRST_PSEUDO_REGISTER];
220 /* Nonzero means current function must be given a frame pointer.
221 Set in stmt.c if anything is allocated on the stack there.
222 Set in reload1.c if anything is allocated on the stack there. */
224 int frame_pointer_needed;
226 /* Assign unique numbers to labels generated for profiling. */
228 int profile_label_no;
230 /* Length so far allocated in PENDING_BLOCKS. */
232 static int max_block_depth;
234 /* Stack of sequence numbers of symbol-blocks of which we have seen the
235 beginning but not yet the end. Sequence numbers are assigned at
236 the beginning; this stack allows us to find the sequence number
237 of a block that is ending. */
239 static int *pending_blocks;
241 /* Number of elements currently in use in PENDING_BLOCKS. */
243 static int block_depth;
245 /* Nonzero if have enabled APP processing of our assembler output. */
249 /* If we are outputting an insn sequence, this contains the sequence rtx.
254 #ifdef ASSEMBLER_DIALECT
256 /* Number of the assembler dialect to use, starting at 0. */
257 static int dialect_number;
260 /* Indexed by line number, nonzero if there is a note for that line. */
262 static char *line_note_exists;
264 /* Linked list to hold line numbers for each basic block. */
267 struct bb_list *next; /* pointer to next basic block */
268 int line_num; /* line number */
269 int file_label_num; /* LPBC<n> label # for stored filename */
270 int func_label_num; /* LPBC<n> label # for stored function name */
273 static struct bb_list *bb_head = 0; /* Head of basic block list */
274 static struct bb_list **bb_tail = &bb_head; /* Ptr to store next bb ptr */
275 static int bb_file_label_num = -1; /* Current label # for file */
276 static int bb_func_label_num = -1; /* Current label # for func */
278 /* Linked list to hold the strings for each file and function name output. */
281 struct bb_str *next; /* pointer to next string */
282 const char *string; /* string */
283 int label_num; /* label number */
284 int length; /* string length */
287 extern rtx peephole PROTO((rtx));
289 static struct bb_str *sbb_head = 0; /* Head of string list. */
290 static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */
291 static int sbb_label_num = 0; /* Last label used */
293 #ifdef HAVE_ATTR_length
294 static int asm_insn_count PROTO((rtx));
296 static void profile_function PROTO((FILE *));
297 static void profile_after_prologue PROTO((FILE *));
298 static void add_bb PROTO((FILE *));
299 static int add_bb_string PROTO((const char *, int));
300 static void output_source_line PROTO((FILE *, rtx));
301 static rtx walk_alter_subreg PROTO((rtx));
302 static void output_asm_name PROTO((void));
303 static void output_operand PROTO((rtx, int));
304 #ifdef LEAF_REGISTERS
305 static void leaf_renumber_regs PROTO((rtx));
308 static int alter_cond PROTO((rtx));
311 /* Initialize data in final at the beginning of a compilation. */
314 init_final (filename)
315 const char *filename ATTRIBUTE_UNUSED;
317 next_block_index = 2;
319 max_block_depth = 20;
320 pending_blocks = (int *) xmalloc (20 * sizeof *pending_blocks);
323 #ifdef ASSEMBLER_DIALECT
324 dialect_number = ASSEMBLER_DIALECT;
328 /* Called at end of source file,
329 to output the block-profiling table for this entire compilation. */
333 const char *filename;
337 if (profile_block_flag || profile_arc_flag)
340 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
344 int long_bytes = LONG_TYPE_SIZE / BITS_PER_UNIT;
345 int pointer_bytes = POINTER_SIZE / BITS_PER_UNIT;
347 if (profile_block_flag)
348 size = long_bytes * count_basic_blocks;
350 size = long_bytes * count_instrumented_arcs;
353 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
354 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
355 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
359 /* Output the main header, of 11 words:
360 0: 1 if this file is initialized, else 0.
361 1: address of file name (LPBX1).
362 2: address of table of counts (LPBX2).
363 3: number of counts in the table.
364 4: always 0, for compatibility with Sun.
366 The following are GNU extensions:
368 5: address of table of start addrs of basic blocks (LPBX3).
369 6: Number of bytes in this header.
370 7: address of table of function names (LPBX4).
371 8: address of table of line numbers (LPBX5) or 0.
372 9: address of table of file names (LPBX6) or 0.
373 10: space reserved for basic block profiling. */
375 ASM_OUTPUT_ALIGN (asm_out_file, align);
377 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
379 assemble_integer (const0_rtx, long_bytes, 1);
381 /* address of filename */
382 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
383 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
385 /* address of count table */
386 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
387 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
389 /* count of the # of basic blocks or # of instrumented arcs */
390 if (profile_block_flag)
391 assemble_integer (GEN_INT (count_basic_blocks), long_bytes, 1);
393 assemble_integer (GEN_INT (count_instrumented_arcs), long_bytes,
396 /* zero word (link field) */
397 assemble_integer (const0_rtx, pointer_bytes, 1);
399 /* address of basic block start address table */
400 if (profile_block_flag)
402 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
403 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
407 assemble_integer (const0_rtx, pointer_bytes, 1);
409 /* byte count for extended structure. */
410 assemble_integer (GEN_INT (11 * UNITS_PER_WORD), long_bytes, 1);
412 /* address of function name table */
413 if (profile_block_flag)
415 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
416 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
420 assemble_integer (const0_rtx, pointer_bytes, 1);
422 /* address of line number and filename tables if debugging. */
423 if (write_symbols != NO_DEBUG && profile_block_flag)
425 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
426 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
427 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
428 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
432 assemble_integer (const0_rtx, pointer_bytes, 1);
433 assemble_integer (const0_rtx, pointer_bytes, 1);
436 /* space for extension ptr (link field) */
437 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
439 /* Output the file name changing the suffix to .d for Sun tcov
441 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
443 char *cwd = getpwd ();
444 int len = strlen (filename) + strlen (cwd) + 1;
445 char *data_file = (char *) alloca (len + 4);
447 strcpy (data_file, cwd);
448 strcat (data_file, "/");
449 strcat (data_file, filename);
450 strip_off_ending (data_file, len);
451 if (profile_block_flag)
452 strcat (data_file, ".d");
454 strcat (data_file, ".da");
455 assemble_string (data_file, strlen (data_file) + 1);
458 /* Make space for the table of counts. */
461 /* Realign data section. */
462 ASM_OUTPUT_ALIGN (asm_out_file, align);
463 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
465 assemble_zeros (size);
469 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
470 #ifdef ASM_OUTPUT_SHARED_LOCAL
471 if (flag_shared_data)
472 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
475 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
476 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
479 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
480 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
483 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
488 /* Output any basic block strings */
489 if (profile_block_flag)
491 readonly_data_section ();
494 ASM_OUTPUT_ALIGN (asm_out_file, align);
495 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
497 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC",
499 assemble_string (sptr->string, sptr->length);
504 /* Output the table of addresses. */
505 if (profile_block_flag)
507 /* Realign in new section */
508 ASM_OUTPUT_ALIGN (asm_out_file, align);
509 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
510 for (i = 0; i < count_basic_blocks; i++)
512 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
513 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
518 /* Output the table of function names. */
519 if (profile_block_flag)
521 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
522 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
524 if (ptr->func_label_num >= 0)
526 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
527 ptr->func_label_num);
528 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
532 assemble_integer (const0_rtx, pointer_bytes, 1);
535 for ( ; i < count_basic_blocks; i++)
536 assemble_integer (const0_rtx, pointer_bytes, 1);
539 if (write_symbols != NO_DEBUG && profile_block_flag)
541 /* Output the table of line numbers. */
542 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
543 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
544 assemble_integer (GEN_INT (ptr->line_num), long_bytes, 1);
546 for ( ; i < count_basic_blocks; i++)
547 assemble_integer (const0_rtx, long_bytes, 1);
549 /* Output the table of file names. */
550 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
551 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
553 if (ptr->file_label_num >= 0)
555 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
556 ptr->file_label_num);
557 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
561 assemble_integer (const0_rtx, pointer_bytes, 1);
564 for ( ; i < count_basic_blocks; i++)
565 assemble_integer (const0_rtx, pointer_bytes, 1);
568 /* End with the address of the table of addresses,
569 so we can find it easily, as the last word in the file's text. */
570 if (profile_block_flag)
572 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
573 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
579 /* Enable APP processing of subsequent output.
580 Used before the output from an `asm' statement. */
587 fputs (ASM_APP_ON, asm_out_file);
592 /* Disable APP processing of subsequent output.
593 Called from varasm.c before most kinds of output. */
600 fputs (ASM_APP_OFF, asm_out_file);
605 /* Return the number of slots filled in the current
606 delayed branch sequence (we don't count the insn needing the
607 delay slot). Zero if not in a delayed branch sequence. */
611 dbr_sequence_length ()
613 if (final_sequence != 0)
614 return XVECLEN (final_sequence, 0) - 1;
620 /* The next two pages contain routines used to compute the length of an insn
621 and to shorten branches. */
623 /* Arrays for insn lengths, and addresses. The latter is referenced by
624 `insn_current_length'. */
626 static short *insn_lengths;
629 /* Max uid for which the above arrays are valid. */
630 static int insn_lengths_max_uid;
632 /* Address of insn being processed. Used by `insn_current_length'. */
633 int insn_current_address;
635 /* Address of insn being processed in previous iteration. */
636 int insn_last_address;
638 /* konwn invariant alignment of insn being processed. */
639 int insn_current_align;
641 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
642 gives the next following alignment insn that increases the known
643 alignment, or NULL_RTX if there is no such insn.
644 For any alignment obtained this way, we can again index uid_align with
645 its uid to obtain the next following align that in turn increases the
646 alignment, till we reach NULL_RTX; the sequence obtained this way
647 for each insn we'll call the alignment chain of this insn in the following
650 struct label_alignment {
655 static rtx *uid_align;
656 static int *uid_shuid;
657 static struct label_alignment *label_align;
659 /* Indicate that branch shortening hasn't yet been done. */
678 insn_lengths_max_uid = 0;
682 free (insn_addresses);
692 /* Obtain the current length of an insn. If branch shortening has been done,
693 get its actual length. Otherwise, get its maximum length. */
696 get_attr_length (insn)
699 #ifdef HAVE_ATTR_length
704 if (insn_lengths_max_uid > INSN_UID (insn))
705 return insn_lengths[INSN_UID (insn)];
707 switch (GET_CODE (insn))
715 length = insn_default_length (insn);
719 body = PATTERN (insn);
720 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
722 /* Alignment is machine-dependent and should be handled by
726 length = insn_default_length (insn);
730 body = PATTERN (insn);
731 if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
734 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
735 length = asm_insn_count (body) * insn_default_length (insn);
736 else if (GET_CODE (body) == SEQUENCE)
737 for (i = 0; i < XVECLEN (body, 0); i++)
738 length += get_attr_length (XVECEXP (body, 0, i));
740 length = insn_default_length (insn);
747 #ifdef ADJUST_INSN_LENGTH
748 ADJUST_INSN_LENGTH (insn, length);
751 #else /* not HAVE_ATTR_length */
753 #endif /* not HAVE_ATTR_length */
756 /* Code to handle alignment inside shorten_branches. */
758 /* Here is an explanation how the algorithm in align_fuzz can give
761 Call a sequence of instructions beginning with alignment point X
762 and continuing until the next alignment point `block X'. When `X'
763 is used in an expression, it means the alignment value of the
766 Call the distance between the start of the first insn of block X, and
767 the end of the last insn of block X `IX', for the `inner size of X'.
768 This is clearly the sum of the instruction lengths.
770 Likewise with the next alignment-delimited block following X, which we
773 Call the distance between the start of the first insn of block X, and
774 the start of the first insn of block Y `OX', for the `outer size of X'.
776 The estimated padding is then OX - IX.
778 OX can be safely estimated as
783 OX = round_up(IX, X) + Y - X
785 Clearly est(IX) >= real(IX), because that only depends on the
786 instruction lengths, and those being overestimated is a given.
788 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
789 we needn't worry about that when thinking about OX.
791 When X >= Y, the alignment provided by Y adds no uncertainty factor
792 for branch ranges starting before X, so we can just round what we have.
793 But when X < Y, we don't know anything about the, so to speak,
794 `middle bits', so we have to assume the worst when aligning up from an
795 address mod X to one mod Y, which is Y - X. */
798 #define LABEL_ALIGN(LABEL) 0
801 #ifndef LABEL_ALIGN_MAX_SKIP
802 #define LABEL_ALIGN_MAX_SKIP 0
806 #define LOOP_ALIGN(LABEL) 0
809 #ifndef LOOP_ALIGN_MAX_SKIP
810 #define LOOP_ALIGN_MAX_SKIP 0
813 #ifndef LABEL_ALIGN_AFTER_BARRIER
814 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
817 #ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
818 #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP 0
821 #ifndef ADDR_VEC_ALIGN
823 final_addr_vec_align (addr_vec)
826 int align = exact_log2 (GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec))));
828 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
829 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
833 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
836 #ifndef INSN_LENGTH_ALIGNMENT
837 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
840 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
842 static int min_labelno, max_labelno;
844 #define LABEL_TO_ALIGNMENT(LABEL) \
845 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
847 #define LABEL_TO_MAX_SKIP(LABEL) \
848 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
850 /* For the benefit of port specific code do this also as a function. */
852 label_to_alignment (label)
855 return LABEL_TO_ALIGNMENT (label);
858 #ifdef HAVE_ATTR_length
859 /* The differences in addresses
860 between a branch and its target might grow or shrink depending on
861 the alignment the start insn of the range (the branch for a forward
862 branch or the label for a backward branch) starts out on; if these
863 differences are used naively, they can even oscillate infinitely.
864 We therefore want to compute a 'worst case' address difference that
865 is independent of the alignment the start insn of the range end
866 up on, and that is at least as large as the actual difference.
867 The function align_fuzz calculates the amount we have to add to the
868 naively computed difference, by traversing the part of the alignment
869 chain of the start insn of the range that is in front of the end insn
870 of the range, and considering for each alignment the maximum amount
871 that it might contribute to a size increase.
873 For casesi tables, we also want to know worst case minimum amounts of
874 address difference, in case a machine description wants to introduce
875 some common offset that is added to all offsets in a table.
876 For this purpose, align_fuzz with a growth argument of 0 comuptes the
877 appropriate adjustment. */
880 /* Compute the maximum delta by which the difference of the addresses of
881 START and END might grow / shrink due to a different address for start
882 which changes the size of alignment insns between START and END.
883 KNOWN_ALIGN_LOG is the alignment known for START.
884 GROWTH should be ~0 if the objective is to compute potential code size
885 increase, and 0 if the objective is to compute potential shrink.
886 The return value is undefined for any other value of GROWTH. */
888 align_fuzz (start, end, known_align_log, growth)
893 int uid = INSN_UID (start);
895 int known_align = 1 << known_align_log;
896 int end_shuid = INSN_SHUID (end);
899 for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
901 int align_addr, new_align;
903 uid = INSN_UID (align_label);
904 align_addr = insn_addresses[uid] - insn_lengths[uid];
905 if (uid_shuid[uid] > end_shuid)
907 known_align_log = LABEL_TO_ALIGNMENT (align_label);
908 new_align = 1 << known_align_log;
909 if (new_align < known_align)
911 fuzz += (-align_addr ^ growth) & (new_align - known_align);
912 known_align = new_align;
917 /* Compute a worst-case reference address of a branch so that it
918 can be safely used in the presence of aligned labels. Since the
919 size of the branch itself is unknown, the size of the branch is
920 not included in the range. I.e. for a forward branch, the reference
921 address is the end address of the branch as known from the previous
922 branch shortening pass, minus a value to account for possible size
923 increase due to alignment. For a backward branch, it is the start
924 address of the branch as known from the current pass, plus a value
925 to account for possible size increase due to alignment.
926 NB.: Therefore, the maximum offset allowed for backward branches needs
927 to exclude the branch size. */
929 insn_current_reference_address (branch)
933 rtx seq = NEXT_INSN (PREV_INSN (branch));
934 int seq_uid = INSN_UID (seq);
935 if (GET_CODE (branch) != JUMP_INSN)
936 /* This can happen for example on the PA; the objective is to know the
937 offset to address something in front of the start of the function.
938 Thus, we can treat it like a backward branch.
939 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
940 any alignment we'd encounter, so we skip the call to align_fuzz. */
941 return insn_current_address;
942 dest = JUMP_LABEL (branch);
943 /* BRANCH has no proper alignment chain set, so use SEQ. */
944 if (INSN_SHUID (branch) < INSN_SHUID (dest))
946 /* Forward branch. */
947 return (insn_last_address + insn_lengths[seq_uid]
948 - align_fuzz (seq, dest, length_unit_log, ~0));
952 /* Backward branch. */
953 return (insn_current_address
954 + align_fuzz (dest, seq, length_unit_log, ~0));
957 #endif /* HAVE_ATTR_length */
959 /* Make a pass over all insns and compute their actual lengths by shortening
960 any branches of variable length if possible. */
962 /* Give a default value for the lowest address in a function. */
964 #ifndef FIRST_INSN_ADDRESS
965 #define FIRST_INSN_ADDRESS 0
968 /* shorten_branches might be called multiple times: for example, the SH
969 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
970 In order to do this, it needs proper length information, which it obtains
971 by calling shorten_branches. This cannot be collapsed with
972 shorten_branches itself into a single pass unless we also want to intergate
973 reorg.c, since the branch splitting exposes new instructions with delay
977 shorten_branches (first)
985 #ifdef HAVE_ATTR_length
986 #define MAX_CODE_ALIGN 16
988 int something_changed = 1;
989 char *varying_length;
992 rtx align_tab[MAX_CODE_ALIGN];
994 /* In order to make sure that all instructions have valid length info,
995 we must split them before we compute the address/length info. */
997 for (insn = NEXT_INSN (first); insn; insn = NEXT_INSN (insn))
998 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1001 /* Don't split the insn if it has been deleted. */
1002 if (! INSN_DELETED_P (old))
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)
1117 /* Search for the label that starts the loop.
1118 Don't skip past the end of the loop, since that could
1119 lead to putting an alignment where it does not belong.
1120 However, a label after a nested (non-)loop would be OK. */
1121 for (label = insn; label; label = NEXT_INSN (label))
1123 if (GET_CODE (label) == NOTE
1124 && NOTE_LINE_NUMBER (label) == NOTE_INSN_LOOP_BEG)
1126 else if (GET_CODE (label) == NOTE
1127 && NOTE_LINE_NUMBER (label) == NOTE_INSN_LOOP_END
1130 else if (GET_CODE (label) == CODE_LABEL)
1132 log = LOOP_ALIGN (insn);
1136 max_skip = LOOP_ALIGN_MAX_SKIP;
1145 #ifdef HAVE_ATTR_length
1147 /* Allocate the rest of the arrays. */
1148 insn_lengths = (short *) xmalloc (max_uid * sizeof (short));
1149 insn_addresses = (int *) xmalloc (max_uid * sizeof (int));
1150 insn_lengths_max_uid = max_uid;
1151 /* Syntax errors can lead to labels being outside of the main insn stream.
1152 Initialize insn_addresses, so that we get reproducible results. */
1153 bzero ((char *)insn_addresses, max_uid * sizeof *insn_addresses);
1154 uid_align = (rtx *) xmalloc (max_uid * sizeof *uid_align);
1156 varying_length = (char *) xmalloc (max_uid * sizeof (char));
1158 bzero (varying_length, max_uid);
1160 /* Initialize uid_align. We scan instructions
1161 from end to start, and keep in align_tab[n] the last seen insn
1162 that does an alignment of at least n+1, i.e. the successor
1163 in the alignment chain for an insn that does / has a known
1166 bzero ((char *) uid_align, max_uid * sizeof *uid_align);
1168 for (i = MAX_CODE_ALIGN; --i >= 0; )
1169 align_tab[i] = NULL_RTX;
1170 seq = get_last_insn ();
1171 for (; seq; seq = PREV_INSN (seq))
1173 int uid = INSN_UID (seq);
1175 log = (GET_CODE (seq) == CODE_LABEL ? LABEL_TO_ALIGNMENT (seq) : 0);
1176 uid_align[uid] = align_tab[0];
1179 /* Found an alignment label. */
1180 uid_align[uid] = align_tab[log];
1181 for (i = log - 1; i >= 0; i--)
1185 #ifdef CASE_VECTOR_SHORTEN_MODE
1188 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1191 int min_shuid = INSN_SHUID (get_insns ()) - 1;
1192 int max_shuid = INSN_SHUID (get_last_insn ()) + 1;
1195 for (insn = first; insn != 0; insn = NEXT_INSN (insn))
1197 rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat;
1198 int len, i, min, max, insn_shuid;
1200 addr_diff_vec_flags flags;
1202 if (GET_CODE (insn) != JUMP_INSN
1203 || GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)
1205 pat = PATTERN (insn);
1206 len = XVECLEN (pat, 1);
1209 min_align = MAX_CODE_ALIGN;
1210 for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
1212 rtx lab = XEXP (XVECEXP (pat, 1, i), 0);
1213 int shuid = INSN_SHUID (lab);
1224 if (min_align > LABEL_TO_ALIGNMENT (lab))
1225 min_align = LABEL_TO_ALIGNMENT (lab);
1227 XEXP (pat, 2) = gen_rtx_LABEL_REF (VOIDmode, min_lab);
1228 XEXP (pat, 3) = gen_rtx_LABEL_REF (VOIDmode, max_lab);
1229 insn_shuid = INSN_SHUID (insn);
1230 rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0));
1231 flags.min_align = min_align;
1232 flags.base_after_vec = rel > insn_shuid;
1233 flags.min_after_vec = min > insn_shuid;
1234 flags.max_after_vec = max > insn_shuid;
1235 flags.min_after_base = min > rel;
1236 flags.max_after_base = max > rel;
1237 ADDR_DIFF_VEC_FLAGS (pat) = flags;
1240 #endif /* CASE_VECTOR_SHORTEN_MODE */
1243 /* Compute initial lengths, addresses, and varying flags for each insn. */
1244 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1246 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1248 uid = INSN_UID (insn);
1250 insn_lengths[uid] = 0;
1252 if (GET_CODE (insn) == CODE_LABEL)
1254 int log = LABEL_TO_ALIGNMENT (insn);
1257 int align = 1 << log;
1258 int new_address = (insn_current_address + align - 1) & -align;
1259 insn_lengths[uid] = new_address - insn_current_address;
1260 insn_current_address = new_address;
1264 insn_addresses[uid] = insn_current_address;
1266 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
1267 || GET_CODE (insn) == CODE_LABEL)
1269 if (INSN_DELETED_P (insn))
1272 body = PATTERN (insn);
1273 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1275 /* This only takes room if read-only data goes into the text
1277 if (JUMP_TABLES_IN_TEXT_SECTION
1278 #if !defined(READONLY_DATA_SECTION)
1282 insn_lengths[uid] = (XVECLEN (body,
1283 GET_CODE (body) == ADDR_DIFF_VEC)
1284 * GET_MODE_SIZE (GET_MODE (body)));
1285 /* Alignment is handled by ADDR_VEC_ALIGN. */
1287 else if (asm_noperands (body) >= 0)
1288 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
1289 else if (GET_CODE (body) == SEQUENCE)
1292 int const_delay_slots;
1294 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
1296 const_delay_slots = 0;
1298 /* Inside a delay slot sequence, we do not do any branch shortening
1299 if the shortening could change the number of delay slots
1301 for (i = 0; i < XVECLEN (body, 0); i++)
1303 rtx inner_insn = XVECEXP (body, 0, i);
1304 int inner_uid = INSN_UID (inner_insn);
1307 if (asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
1308 inner_length = (asm_insn_count (PATTERN (inner_insn))
1309 * insn_default_length (inner_insn));
1311 inner_length = insn_default_length (inner_insn);
1313 insn_lengths[inner_uid] = inner_length;
1314 if (const_delay_slots)
1316 if ((varying_length[inner_uid]
1317 = insn_variable_length_p (inner_insn)) != 0)
1318 varying_length[uid] = 1;
1319 insn_addresses[inner_uid] = (insn_current_address +
1323 varying_length[inner_uid] = 0;
1324 insn_lengths[uid] += inner_length;
1327 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
1329 insn_lengths[uid] = insn_default_length (insn);
1330 varying_length[uid] = insn_variable_length_p (insn);
1333 /* If needed, do any adjustment. */
1334 #ifdef ADJUST_INSN_LENGTH
1335 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
1336 if (insn_lengths[uid] < 0)
1337 fatal_insn ("Negative insn length", insn);
1341 /* Now loop over all the insns finding varying length insns. For each,
1342 get the current insn length. If it has changed, reflect the change.
1343 When nothing changes for a full pass, we are done. */
1345 while (something_changed)
1347 something_changed = 0;
1348 insn_current_align = MAX_CODE_ALIGN - 1;
1349 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1351 insn = NEXT_INSN (insn))
1354 #ifdef ADJUST_INSN_LENGTH
1359 uid = INSN_UID (insn);
1361 if (GET_CODE (insn) == CODE_LABEL)
1363 int log = LABEL_TO_ALIGNMENT (insn);
1364 if (log > insn_current_align)
1366 int align = 1 << log;
1367 int new_address= (insn_current_address + align - 1) & -align;
1368 insn_lengths[uid] = new_address - insn_current_address;
1369 insn_current_align = log;
1370 insn_current_address = new_address;
1373 insn_lengths[uid] = 0;
1374 insn_addresses[uid] = insn_current_address;
1378 length_align = INSN_LENGTH_ALIGNMENT (insn);
1379 if (length_align < insn_current_align)
1380 insn_current_align = length_align;
1382 insn_last_address = insn_addresses[uid];
1383 insn_addresses[uid] = insn_current_address;
1385 #ifdef CASE_VECTOR_SHORTEN_MODE
1386 if (optimize && GET_CODE (insn) == JUMP_INSN
1387 && GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
1389 rtx body = PATTERN (insn);
1390 int old_length = insn_lengths[uid];
1391 rtx rel_lab = XEXP (XEXP (body, 0), 0);
1392 rtx min_lab = XEXP (XEXP (body, 2), 0);
1393 rtx max_lab = XEXP (XEXP (body, 3), 0);
1394 addr_diff_vec_flags flags = ADDR_DIFF_VEC_FLAGS (body);
1395 int rel_addr = insn_addresses[INSN_UID (rel_lab)];
1396 int min_addr = insn_addresses[INSN_UID (min_lab)];
1397 int max_addr = insn_addresses[INSN_UID (max_lab)];
1401 /* Try to find a known alignment for rel_lab. */
1402 for (prev = rel_lab;
1404 && ! insn_lengths[INSN_UID (prev)]
1405 && ! (varying_length[INSN_UID (prev)] & 1);
1406 prev = PREV_INSN (prev))
1407 if (varying_length[INSN_UID (prev)] & 2)
1409 rel_align = LABEL_TO_ALIGNMENT (prev);
1413 /* See the comment on addr_diff_vec_flags in rtl.h for the
1414 meaning of the flags values. base: REL_LAB vec: INSN */
1415 /* Anything after INSN has still addresses from the last
1416 pass; adjust these so that they reflect our current
1417 estimate for this pass. */
1418 if (flags.base_after_vec)
1419 rel_addr += insn_current_address - insn_last_address;
1420 if (flags.min_after_vec)
1421 min_addr += insn_current_address - insn_last_address;
1422 if (flags.max_after_vec)
1423 max_addr += insn_current_address - insn_last_address;
1424 /* We want to know the worst case, i.e. lowest possible value
1425 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1426 its offset is positive, and we have to be wary of code shrink;
1427 otherwise, it is negative, and we have to be vary of code
1429 if (flags.min_after_base)
1431 /* If INSN is between REL_LAB and MIN_LAB, the size
1432 changes we are about to make can change the alignment
1433 within the observed offset, therefore we have to break
1434 it up into two parts that are independent. */
1435 if (! flags.base_after_vec && flags.min_after_vec)
1437 min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
1438 min_addr -= align_fuzz (insn, min_lab, 0, 0);
1441 min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
1445 if (flags.base_after_vec && ! flags.min_after_vec)
1447 min_addr -= align_fuzz (min_lab, insn, 0, ~0);
1448 min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
1451 min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
1453 /* Likewise, determine the highest lowest possible value
1454 for the offset of MAX_LAB. */
1455 if (flags.max_after_base)
1457 if (! flags.base_after_vec && flags.max_after_vec)
1459 max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
1460 max_addr += align_fuzz (insn, max_lab, 0, ~0);
1463 max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
1467 if (flags.base_after_vec && ! flags.max_after_vec)
1469 max_addr += align_fuzz (max_lab, insn, 0, 0);
1470 max_addr += align_fuzz (insn, rel_lab, 0, 0);
1473 max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
1475 PUT_MODE (body, CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
1476 max_addr - rel_addr,
1478 if (JUMP_TABLES_IN_TEXT_SECTION
1479 #if !defined(READONLY_DATA_SECTION)
1485 = (XVECLEN (body, 1) * GET_MODE_SIZE (GET_MODE (body)));
1486 insn_current_address += insn_lengths[uid];
1487 if (insn_lengths[uid] != old_length)
1488 something_changed = 1;
1493 #endif /* CASE_VECTOR_SHORTEN_MODE */
1495 if (! (varying_length[uid]))
1497 insn_current_address += insn_lengths[uid];
1500 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
1504 body = PATTERN (insn);
1506 for (i = 0; i < XVECLEN (body, 0); i++)
1508 rtx inner_insn = XVECEXP (body, 0, i);
1509 int inner_uid = INSN_UID (inner_insn);
1512 insn_addresses[inner_uid] = insn_current_address;
1514 /* insn_current_length returns 0 for insns with a
1515 non-varying length. */
1516 if (! varying_length[inner_uid])
1517 inner_length = insn_lengths[inner_uid];
1519 inner_length = insn_current_length (inner_insn);
1521 if (inner_length != insn_lengths[inner_uid])
1523 insn_lengths[inner_uid] = inner_length;
1524 something_changed = 1;
1526 insn_current_address += insn_lengths[inner_uid];
1527 new_length += inner_length;
1532 new_length = insn_current_length (insn);
1533 insn_current_address += new_length;
1536 #ifdef ADJUST_INSN_LENGTH
1537 /* If needed, do any adjustment. */
1538 tmp_length = new_length;
1539 ADJUST_INSN_LENGTH (insn, new_length);
1540 insn_current_address += (new_length - tmp_length);
1543 if (new_length != insn_lengths[uid])
1545 insn_lengths[uid] = new_length;
1546 something_changed = 1;
1549 /* For a non-optimizing compile, do only a single pass. */
1554 free (varying_length);
1556 #endif /* HAVE_ATTR_length */
1559 #ifdef HAVE_ATTR_length
1560 /* Given the body of an INSN known to be generated by an ASM statement, return
1561 the number of machine instructions likely to be generated for this insn.
1562 This is used to compute its length. */
1565 asm_insn_count (body)
1571 if (GET_CODE (body) == ASM_INPUT)
1572 template = XSTR (body, 0);
1574 template = decode_asm_operands (body, NULL_PTR, NULL_PTR,
1575 NULL_PTR, NULL_PTR);
1577 for ( ; *template; template++)
1578 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
1585 /* Output assembler code for the start of a function,
1586 and initialize some of the variables in this file
1587 for the new function. The label for the function and associated
1588 assembler pseudo-ops have already been output in `assemble_start_function'.
1590 FIRST is the first insn of the rtl for the function being compiled.
1591 FILE is the file to write assembler code to.
1592 OPTIMIZE is nonzero if we should eliminate redundant
1593 test and compare insns. */
1596 final_start_function (first, file, optimize)
1599 int optimize ATTRIBUTE_UNUSED;
1603 this_is_asm_operands = 0;
1605 #ifdef NON_SAVING_SETJMP
1606 /* A function that calls setjmp should save and restore all the
1607 call-saved registers on a system where longjmp clobbers them. */
1608 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
1612 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1613 if (!call_used_regs[i])
1614 regs_ever_live[i] = 1;
1618 /* Initial line number is supposed to be output
1619 before the function's prologue and label
1620 so that the function's address will not appear to be
1621 in the last statement of the preceding function. */
1622 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1623 last_linenum = high_block_linenum = high_function_linenum
1624 = NOTE_LINE_NUMBER (first);
1626 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1627 /* Output DWARF definition of the function. */
1628 if (dwarf2out_do_frame ())
1629 dwarf2out_begin_prologue ();
1632 /* For SDB and XCOFF, the function beginning must be marked between
1633 the function label and the prologue. We always need this, even when
1634 -g1 was used. Defer on MIPS systems so that parameter descriptions
1635 follow function entry. */
1636 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
1637 if (write_symbols == SDB_DEBUG)
1638 sdbout_begin_function (last_linenum);
1641 #ifdef XCOFF_DEBUGGING_INFO
1642 if (write_symbols == XCOFF_DEBUG)
1643 xcoffout_begin_function (file, last_linenum);
1646 /* But only output line number for other debug info types if -g2
1648 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1649 output_source_line (file, first);
1651 #ifdef LEAF_REG_REMAP
1652 if (current_function_uses_only_leaf_regs)
1653 leaf_renumber_regs (first);
1656 /* The Sun386i and perhaps other machines don't work right
1657 if the profiling code comes after the prologue. */
1658 #ifdef PROFILE_BEFORE_PROLOGUE
1660 profile_function (file);
1661 #endif /* PROFILE_BEFORE_PROLOGUE */
1663 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1664 if (dwarf2out_do_frame ())
1665 dwarf2out_frame_debug (NULL_RTX);
1668 #ifdef FUNCTION_PROLOGUE
1669 /* First output the function prologue: code to set up the stack frame. */
1670 FUNCTION_PROLOGUE (file, get_frame_size ());
1673 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1674 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
1675 next_block_index = 1;
1678 /* If the machine represents the prologue as RTL, the profiling code must
1679 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1680 #ifdef HAVE_prologue
1681 if (! HAVE_prologue)
1683 profile_after_prologue (file);
1687 /* If we are doing basic block profiling, remember a printable version
1688 of the function name. */
1689 if (profile_block_flag)
1692 = add_bb_string ((*decl_printable_name) (current_function_decl, 2), FALSE);
1697 profile_after_prologue (file)
1700 #ifdef FUNCTION_BLOCK_PROFILER
1701 if (profile_block_flag)
1703 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
1705 #endif /* FUNCTION_BLOCK_PROFILER */
1707 #ifndef PROFILE_BEFORE_PROLOGUE
1709 profile_function (file);
1710 #endif /* not PROFILE_BEFORE_PROLOGUE */
1714 profile_function (file)
1717 int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1718 #if defined(ASM_OUTPUT_REG_PUSH)
1719 #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1720 int sval = current_function_returns_struct;
1722 #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1723 int cxt = current_function_needs_context;
1725 #endif /* ASM_OUTPUT_REG_PUSH */
1728 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1729 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
1730 assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, 1);
1732 function_section (current_function_decl);
1734 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1736 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
1738 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1741 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1746 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1748 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1750 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1753 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1758 FUNCTION_PROFILER (file, profile_label_no);
1760 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1762 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1764 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1767 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1772 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1774 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1776 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1779 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1785 /* Output assembler code for the end of a function.
1786 For clarity, args are same as those of `final_start_function'
1787 even though not all of them are needed. */
1790 final_end_function (first, file, optimize)
1791 rtx first ATTRIBUTE_UNUSED;
1793 int optimize ATTRIBUTE_UNUSED;
1797 fputs (ASM_APP_OFF, file);
1801 #ifdef SDB_DEBUGGING_INFO
1802 if (write_symbols == SDB_DEBUG)
1803 sdbout_end_function (high_function_linenum);
1806 #ifdef DWARF_DEBUGGING_INFO
1807 if (write_symbols == DWARF_DEBUG)
1808 dwarfout_end_function ();
1811 #ifdef XCOFF_DEBUGGING_INFO
1812 if (write_symbols == XCOFF_DEBUG)
1813 xcoffout_end_function (file, high_function_linenum);
1816 #ifdef FUNCTION_EPILOGUE
1817 /* Finally, output the function epilogue:
1818 code to restore the stack frame and return to the caller. */
1819 FUNCTION_EPILOGUE (file, get_frame_size ());
1822 #ifdef SDB_DEBUGGING_INFO
1823 if (write_symbols == SDB_DEBUG)
1824 sdbout_end_epilogue ();
1827 #ifdef DWARF_DEBUGGING_INFO
1828 if (write_symbols == DWARF_DEBUG)
1829 dwarfout_end_epilogue ();
1832 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1833 if (dwarf2out_do_frame ())
1834 dwarf2out_end_epilogue ();
1837 #ifdef XCOFF_DEBUGGING_INFO
1838 if (write_symbols == XCOFF_DEBUG)
1839 xcoffout_end_epilogue (file);
1842 bb_func_label_num = -1; /* not in function, nuke label # */
1844 /* If FUNCTION_EPILOGUE is not defined, then the function body
1845 itself contains return instructions wherever needed. */
1848 /* Add a block to the linked list that remembers the current line/file/function
1849 for basic block profiling. Emit the label in front of the basic block and
1850 the instructions that increment the count field. */
1856 struct bb_list *ptr = (struct bb_list *) permalloc (sizeof (struct bb_list));
1858 /* Add basic block to linked list. */
1860 ptr->line_num = last_linenum;
1861 ptr->file_label_num = bb_file_label_num;
1862 ptr->func_label_num = bb_func_label_num;
1864 bb_tail = &ptr->next;
1866 /* Enable the table of basic-block use counts
1867 to point at the code it applies to. */
1868 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1870 /* Before first insn of this basic block, increment the
1871 count of times it was entered. */
1872 #ifdef BLOCK_PROFILER
1873 BLOCK_PROFILER (file, count_basic_blocks);
1880 count_basic_blocks++;
1883 /* Add a string to be used for basic block profiling. */
1886 add_bb_string (string, perm_p)
1891 struct bb_str *ptr = 0;
1895 string = "<unknown>";
1899 /* Allocate a new string if the current string isn't permanent. If
1900 the string is permanent search for the same string in other
1903 len = strlen (string) + 1;
1906 char *p = (char *) permalloc (len);
1907 bcopy (string, p, len);
1911 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1912 if (ptr->string == string)
1915 /* Allocate a new string block if we need to. */
1918 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1921 ptr->label_num = sbb_label_num++;
1922 ptr->string = string;
1924 sbb_tail = &ptr->next;
1927 return ptr->label_num;
1931 /* Output assembler code for some insns: all or part of a function.
1932 For description of args, see `final_start_function', above.
1934 PRESCAN is 1 if we are not really outputting,
1935 just scanning as if we were outputting.
1936 Prescanning deletes and rearranges insns just like ordinary output.
1937 PRESCAN is -2 if we are outputting after having prescanned.
1938 In this case, don't try to delete or rearrange insns
1939 because that has already been done.
1940 Prescanning is done only on certain machines. */
1943 final (first, file, optimize, prescan)
1953 last_ignored_compare = 0;
1956 check_exception_handler_labels ();
1958 /* Make a map indicating which line numbers appear in this function.
1959 When producing SDB debugging info, delete troublesome line number
1960 notes from inlined functions in other files as well as duplicate
1961 line number notes. */
1962 #ifdef SDB_DEBUGGING_INFO
1963 if (write_symbols == SDB_DEBUG)
1966 for (insn = first; insn; insn = NEXT_INSN (insn))
1967 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1969 if ((RTX_INTEGRATED_P (insn)
1970 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1972 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1973 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1975 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1976 NOTE_SOURCE_FILE (insn) = 0;
1980 if (NOTE_LINE_NUMBER (insn) > max_line)
1981 max_line = NOTE_LINE_NUMBER (insn);
1987 for (insn = first; insn; insn = NEXT_INSN (insn))
1988 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1989 max_line = NOTE_LINE_NUMBER (insn);
1992 line_note_exists = (char *) oballoc (max_line + 1);
1993 bzero (line_note_exists, max_line + 1);
1995 for (insn = first; insn; insn = NEXT_INSN (insn))
1997 if (INSN_UID (insn) > max_uid) /* find largest UID */
1998 max_uid = INSN_UID (insn);
1999 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
2000 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
2002 /* If CC tracking across branches is enabled, record the insn which
2003 jumps to each branch only reached from one place. */
2004 if (optimize && GET_CODE (insn) == JUMP_INSN)
2006 rtx lab = JUMP_LABEL (insn);
2007 if (lab && LABEL_NUSES (lab) == 1)
2009 LABEL_REFS (lab) = insn;
2015 /* Initialize insn_eh_region table if eh is being used. */
2017 init_insn_eh_region (first, max_uid);
2023 /* Output the insns. */
2024 for (insn = NEXT_INSN (first); insn;)
2026 #ifdef HAVE_ATTR_length
2027 insn_current_address = insn_addresses[INSN_UID (insn)];
2029 insn = final_scan_insn (insn, file, optimize, prescan, 0);
2032 /* Do basic-block profiling here
2033 if the last insn was a conditional branch. */
2034 if (profile_block_flag && new_block)
2037 free_insn_eh_region ();
2040 /* The final scan for one insn, INSN.
2041 Args are same as in `final', except that INSN
2042 is the insn being scanned.
2043 Value returned is the next insn to be scanned.
2045 NOPEEPHOLES is the flag to disallow peephole processing (currently
2046 used for within delayed branch sequence output). */
2049 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
2062 /* Ignore deleted insns. These can occur when we split insns (due to a
2063 template of "#") while not optimizing. */
2064 if (INSN_DELETED_P (insn))
2065 return NEXT_INSN (insn);
2067 switch (GET_CODE (insn))
2073 /* Align the beginning of a loop, for higher speed
2074 on certain machines. */
2076 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
2077 break; /* This used to depend on optimize, but that was bogus. */
2078 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END)
2081 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG
2082 && ! exceptions_via_longjmp)
2084 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHB", NOTE_BLOCK_NUMBER (insn));
2085 if (! flag_new_exceptions)
2086 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn));
2087 #ifdef ASM_OUTPUT_EH_REGION_BEG
2088 ASM_OUTPUT_EH_REGION_BEG (file, NOTE_BLOCK_NUMBER (insn));
2093 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END
2094 && ! exceptions_via_longjmp)
2096 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHE", NOTE_BLOCK_NUMBER (insn));
2097 if (flag_new_exceptions)
2098 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn));
2099 #ifdef ASM_OUTPUT_EH_REGION_END
2100 ASM_OUTPUT_EH_REGION_END (file, NOTE_BLOCK_NUMBER (insn));
2105 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
2107 #ifdef FUNCTION_END_PROLOGUE
2108 FUNCTION_END_PROLOGUE (file);
2110 profile_after_prologue (file);
2114 #ifdef FUNCTION_BEGIN_EPILOGUE
2115 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
2117 FUNCTION_BEGIN_EPILOGUE (file);
2122 if (write_symbols == NO_DEBUG)
2124 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
2126 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
2127 /* MIPS stabs require the parameter descriptions to be after the
2128 function entry point rather than before. */
2129 if (write_symbols == SDB_DEBUG)
2130 sdbout_begin_function (last_linenum);
2133 #ifdef DWARF_DEBUGGING_INFO
2134 /* This outputs a marker where the function body starts, so it
2135 must be after the prologue. */
2136 if (write_symbols == DWARF_DEBUG)
2137 dwarfout_begin_function ();
2141 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED)
2142 break; /* An insn that was "deleted" */
2145 fputs (ASM_APP_OFF, file);
2148 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG
2149 && (debug_info_level == DINFO_LEVEL_NORMAL
2150 || debug_info_level == DINFO_LEVEL_VERBOSE
2151 || write_symbols == DWARF_DEBUG
2152 || write_symbols == DWARF2_DEBUG))
2154 /* Beginning of a symbol-block. Assign it a sequence number
2155 and push the number onto the stack PENDING_BLOCKS. */
2157 if (block_depth == max_block_depth)
2159 /* PENDING_BLOCKS is full; make it longer. */
2160 max_block_depth *= 2;
2162 = (int *) xrealloc (pending_blocks,
2163 max_block_depth * sizeof (int));
2165 pending_blocks[block_depth++] = next_block_index;
2167 high_block_linenum = last_linenum;
2169 /* Output debugging info about the symbol-block beginning. */
2171 #ifdef SDB_DEBUGGING_INFO
2172 if (write_symbols == SDB_DEBUG)
2173 sdbout_begin_block (file, last_linenum, next_block_index);
2175 #ifdef XCOFF_DEBUGGING_INFO
2176 if (write_symbols == XCOFF_DEBUG)
2177 xcoffout_begin_block (file, last_linenum, next_block_index);
2179 #ifdef DBX_DEBUGGING_INFO
2180 if (write_symbols == DBX_DEBUG)
2181 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", next_block_index);
2183 #ifdef DWARF_DEBUGGING_INFO
2184 if (write_symbols == DWARF_DEBUG)
2185 dwarfout_begin_block (next_block_index);
2187 #ifdef DWARF2_DEBUGGING_INFO
2188 if (write_symbols == DWARF2_DEBUG)
2189 dwarf2out_begin_block (next_block_index);
2194 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END
2195 && (debug_info_level == DINFO_LEVEL_NORMAL
2196 || debug_info_level == DINFO_LEVEL_VERBOSE
2197 || write_symbols == DWARF_DEBUG
2198 || write_symbols == DWARF2_DEBUG))
2200 /* End of a symbol-block. Pop its sequence number off
2201 PENDING_BLOCKS and output debugging info based on that. */
2204 if (block_depth < 0)
2207 #ifdef XCOFF_DEBUGGING_INFO
2208 if (write_symbols == XCOFF_DEBUG)
2209 xcoffout_end_block (file, high_block_linenum,
2210 pending_blocks[block_depth]);
2212 #ifdef DBX_DEBUGGING_INFO
2213 if (write_symbols == DBX_DEBUG)
2214 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE",
2215 pending_blocks[block_depth]);
2217 #ifdef SDB_DEBUGGING_INFO
2218 if (write_symbols == SDB_DEBUG)
2219 sdbout_end_block (file, high_block_linenum,
2220 pending_blocks[block_depth]);
2222 #ifdef DWARF_DEBUGGING_INFO
2223 if (write_symbols == DWARF_DEBUG)
2224 dwarfout_end_block (pending_blocks[block_depth]);
2226 #ifdef DWARF2_DEBUGGING_INFO
2227 if (write_symbols == DWARF2_DEBUG)
2228 dwarf2out_end_block (pending_blocks[block_depth]);
2231 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL
2232 && (debug_info_level == DINFO_LEVEL_NORMAL
2233 || debug_info_level == DINFO_LEVEL_VERBOSE))
2235 #ifdef DWARF_DEBUGGING_INFO
2236 if (write_symbols == DWARF_DEBUG)
2237 dwarfout_label (insn);
2239 #ifdef DWARF2_DEBUGGING_INFO
2240 if (write_symbols == DWARF2_DEBUG)
2241 dwarf2out_label (insn);
2244 else if (NOTE_LINE_NUMBER (insn) > 0)
2245 /* This note is a line-number. */
2249 #if 0 /* This is what we used to do. */
2250 output_source_line (file, insn);
2254 /* If there is anything real after this note,
2255 output it. If another line note follows, omit this one. */
2256 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
2258 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
2260 /* These types of notes can be significant
2261 so make sure the preceding line number stays. */
2262 else if (GET_CODE (note) == NOTE
2263 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
2264 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
2265 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
2267 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
2269 /* Another line note follows; we can delete this note
2270 if no intervening line numbers have notes elsewhere. */
2272 for (num = NOTE_LINE_NUMBER (insn) + 1;
2273 num < NOTE_LINE_NUMBER (note);
2275 if (line_note_exists[num])
2278 if (num >= NOTE_LINE_NUMBER (note))
2284 /* Output this line note
2285 if it is the first or the last line note in a row. */
2287 output_source_line (file, insn);
2292 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2293 /* If we push arguments, we need to check all insns for stack
2295 if (dwarf2out_do_frame ())
2296 dwarf2out_frame_debug (insn);
2301 /* The target port might emit labels in the output function for
2302 some insn, e.g. sh.c output_branchy_insn. */
2303 if (CODE_LABEL_NUMBER (insn) <= max_labelno)
2305 int align = LABEL_TO_ALIGNMENT (insn);
2306 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2307 int max_skip = LABEL_TO_MAX_SKIP (insn);
2310 if (align && NEXT_INSN (insn))
2311 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2312 ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip);
2314 ASM_OUTPUT_ALIGN (file, align);
2319 /* If this label is reached from only one place, set the condition
2320 codes from the instruction just before the branch. */
2322 /* Disabled because some insns set cc_status in the C output code
2323 and NOTICE_UPDATE_CC alone can set incorrect status. */
2324 if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
2326 rtx jump = LABEL_REFS (insn);
2327 rtx barrier = prev_nonnote_insn (insn);
2329 /* If the LABEL_REFS field of this label has been set to point
2330 at a branch, the predecessor of the branch is a regular
2331 insn, and that branch is the only way to reach this label,
2332 set the condition codes based on the branch and its
2334 if (barrier && GET_CODE (barrier) == BARRIER
2335 && jump && GET_CODE (jump) == JUMP_INSN
2336 && (prev = prev_nonnote_insn (jump))
2337 && GET_CODE (prev) == INSN)
2339 NOTICE_UPDATE_CC (PATTERN (prev), prev);
2340 NOTICE_UPDATE_CC (PATTERN (jump), jump);
2348 #ifdef FINAL_PRESCAN_LABEL
2349 FINAL_PRESCAN_INSN (insn, NULL_PTR, 0);
2352 #ifdef SDB_DEBUGGING_INFO
2353 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
2354 sdbout_label (insn);
2356 #ifdef DWARF_DEBUGGING_INFO
2357 if (write_symbols == DWARF_DEBUG && LABEL_NAME (insn))
2358 dwarfout_label (insn);
2360 #ifdef DWARF2_DEBUGGING_INFO
2361 if (write_symbols == DWARF2_DEBUG && LABEL_NAME (insn))
2362 dwarf2out_label (insn);
2366 fputs (ASM_APP_OFF, file);
2369 if (NEXT_INSN (insn) != 0
2370 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
2372 rtx nextbody = PATTERN (NEXT_INSN (insn));
2374 /* If this label is followed by a jump-table,
2375 make sure we put the label in the read-only section. Also
2376 possibly write the label and jump table together. */
2378 if (GET_CODE (nextbody) == ADDR_VEC
2379 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
2381 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2382 /* In this case, the case vector is being moved by the
2383 target, so don't output the label at all. Leave that
2384 to the back end macros. */
2386 if (! JUMP_TABLES_IN_TEXT_SECTION)
2388 readonly_data_section ();
2389 #ifdef READONLY_DATA_SECTION
2390 ASM_OUTPUT_ALIGN (file,
2391 exact_log2 (BIGGEST_ALIGNMENT
2393 #endif /* READONLY_DATA_SECTION */
2396 function_section (current_function_decl);
2398 #ifdef ASM_OUTPUT_CASE_LABEL
2399 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
2402 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2409 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2414 register rtx body = PATTERN (insn);
2415 int insn_code_number;
2416 const char *template;
2421 /* An INSN, JUMP_INSN or CALL_INSN.
2422 First check for special kinds that recog doesn't recognize. */
2424 if (GET_CODE (body) == USE /* These are just declarations */
2425 || GET_CODE (body) == CLOBBER)
2429 /* If there is a REG_CC_SETTER note on this insn, it means that
2430 the setting of the condition code was done in the delay slot
2431 of the insn that branched here. So recover the cc status
2432 from the insn that set it. */
2434 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
2437 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
2438 cc_prev_status = cc_status;
2442 /* Detect insns that are really jump-tables
2443 and output them as such. */
2445 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
2447 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2448 register int vlen, idx;
2456 fputs (ASM_APP_OFF, file);
2460 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2461 if (GET_CODE (body) == ADDR_VEC)
2463 #ifdef ASM_OUTPUT_ADDR_VEC
2464 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2471 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2472 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2478 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
2479 for (idx = 0; idx < vlen; idx++)
2481 if (GET_CODE (body) == ADDR_VEC)
2483 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2484 ASM_OUTPUT_ADDR_VEC_ELT
2485 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
2492 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2493 ASM_OUTPUT_ADDR_DIFF_ELT
2496 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
2497 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
2503 #ifdef ASM_OUTPUT_CASE_END
2504 ASM_OUTPUT_CASE_END (file,
2505 CODE_LABEL_NUMBER (PREV_INSN (insn)),
2510 function_section (current_function_decl);
2515 /* Do basic-block profiling when we reach a new block.
2516 Done here to avoid jump tables. */
2517 if (profile_block_flag && new_block)
2520 if (GET_CODE (body) == ASM_INPUT)
2522 /* There's no telling what that did to the condition codes. */
2528 fputs (ASM_APP_ON, file);
2531 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
2535 /* Detect `asm' construct with operands. */
2536 if (asm_noperands (body) >= 0)
2538 unsigned int noperands = asm_noperands (body);
2539 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
2542 /* There's no telling what that did to the condition codes. */
2549 fputs (ASM_APP_ON, file);
2553 /* Get out the operand values. */
2554 string = decode_asm_operands (body, ops, NULL_PTR,
2555 NULL_PTR, NULL_PTR);
2556 /* Inhibit aborts on what would otherwise be compiler bugs. */
2557 insn_noperands = noperands;
2558 this_is_asm_operands = insn;
2560 /* Output the insn using them. */
2561 output_asm_insn (string, ops);
2562 this_is_asm_operands = 0;
2566 if (prescan <= 0 && app_on)
2568 fputs (ASM_APP_OFF, file);
2572 if (GET_CODE (body) == SEQUENCE)
2574 /* A delayed-branch sequence */
2580 final_sequence = body;
2582 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2583 force the restoration of a comparison that was previously
2584 thought unnecessary. If that happens, cancel this sequence
2585 and cause that insn to be restored. */
2587 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
2588 if (next != XVECEXP (body, 0, 1))
2594 for (i = 1; i < XVECLEN (body, 0); i++)
2596 rtx insn = XVECEXP (body, 0, i);
2597 rtx next = NEXT_INSN (insn);
2598 /* We loop in case any instruction in a delay slot gets
2601 insn = final_scan_insn (insn, file, 0, prescan, 1);
2602 while (insn != next);
2604 #ifdef DBR_OUTPUT_SEQEND
2605 DBR_OUTPUT_SEQEND (file);
2609 /* If the insn requiring the delay slot was a CALL_INSN, the
2610 insns in the delay slot are actually executed before the
2611 called function. Hence we don't preserve any CC-setting
2612 actions in these insns and the CC must be marked as being
2613 clobbered by the function. */
2614 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
2619 /* Following a conditional branch sequence, we have a new basic
2621 if (profile_block_flag)
2623 rtx insn = XVECEXP (body, 0, 0);
2624 rtx body = PATTERN (insn);
2626 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2627 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2628 || (GET_CODE (insn) == JUMP_INSN
2629 && GET_CODE (body) == PARALLEL
2630 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2631 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
2637 /* We have a real machine instruction as rtl. */
2639 body = PATTERN (insn);
2642 set = single_set(insn);
2644 /* Check for redundant test and compare instructions
2645 (when the condition codes are already set up as desired).
2646 This is done only when optimizing; if not optimizing,
2647 it should be possible for the user to alter a variable
2648 with the debugger in between statements
2649 and the next statement should reexamine the variable
2650 to compute the condition codes. */
2655 rtx set = single_set(insn);
2659 && GET_CODE (SET_DEST (set)) == CC0
2660 && insn != last_ignored_compare)
2662 if (GET_CODE (SET_SRC (set)) == SUBREG)
2663 SET_SRC (set) = alter_subreg (SET_SRC (set));
2664 else if (GET_CODE (SET_SRC (set)) == COMPARE)
2666 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
2667 XEXP (SET_SRC (set), 0)
2668 = alter_subreg (XEXP (SET_SRC (set), 0));
2669 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
2670 XEXP (SET_SRC (set), 1)
2671 = alter_subreg (XEXP (SET_SRC (set), 1));
2673 if ((cc_status.value1 != 0
2674 && rtx_equal_p (SET_SRC (set), cc_status.value1))
2675 || (cc_status.value2 != 0
2676 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
2678 /* Don't delete insn if it has an addressing side-effect. */
2679 if (! FIND_REG_INC_NOTE (insn, 0)
2680 /* or if anything in it is volatile. */
2681 && ! volatile_refs_p (PATTERN (insn)))
2683 /* We don't really delete the insn; just ignore it. */
2684 last_ignored_compare = insn;
2692 /* Following a conditional branch, we have a new basic block.
2693 But if we are inside a sequence, the new block starts after the
2694 last insn of the sequence. */
2695 if (profile_block_flag && final_sequence == 0
2696 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2697 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2698 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
2699 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2700 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
2704 /* Don't bother outputting obvious no-ops, even without -O.
2705 This optimization is fast and doesn't interfere with debugging.
2706 Don't do this if the insn is in a delay slot, since this
2707 will cause an improper number of delay insns to be written. */
2708 if (final_sequence == 0
2710 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
2711 && GET_CODE (SET_SRC (body)) == REG
2712 && GET_CODE (SET_DEST (body)) == REG
2713 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
2718 /* If this is a conditional branch, maybe modify it
2719 if the cc's are in a nonstandard state
2720 so that it accomplishes the same thing that it would
2721 do straightforwardly if the cc's were set up normally. */
2723 if (cc_status.flags != 0
2724 && GET_CODE (insn) == JUMP_INSN
2725 && GET_CODE (body) == SET
2726 && SET_DEST (body) == pc_rtx
2727 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
2728 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
2729 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
2730 /* This is done during prescan; it is not done again
2731 in final scan when prescan has been done. */
2734 /* This function may alter the contents of its argument
2735 and clear some of the cc_status.flags bits.
2736 It may also return 1 meaning condition now always true
2737 or -1 meaning condition now always false
2738 or 2 meaning condition nontrivial but altered. */
2739 register int result = alter_cond (XEXP (SET_SRC (body), 0));
2740 /* If condition now has fixed value, replace the IF_THEN_ELSE
2741 with its then-operand or its else-operand. */
2743 SET_SRC (body) = XEXP (SET_SRC (body), 1);
2745 SET_SRC (body) = XEXP (SET_SRC (body), 2);
2747 /* The jump is now either unconditional or a no-op.
2748 If it has become a no-op, don't try to output it.
2749 (It would not be recognized.) */
2750 if (SET_SRC (body) == pc_rtx)
2752 PUT_CODE (insn, NOTE);
2753 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2754 NOTE_SOURCE_FILE (insn) = 0;
2757 else if (GET_CODE (SET_SRC (body)) == RETURN)
2758 /* Replace (set (pc) (return)) with (return). */
2759 PATTERN (insn) = body = SET_SRC (body);
2761 /* Rerecognize the instruction if it has changed. */
2763 INSN_CODE (insn) = -1;
2766 /* Make same adjustments to instructions that examine the
2767 condition codes without jumping and instructions that
2768 handle conditional moves (if this machine has either one). */
2770 if (cc_status.flags != 0
2773 rtx cond_rtx, then_rtx, else_rtx;
2775 if (GET_CODE (insn) != JUMP_INSN
2776 && GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
2778 cond_rtx = XEXP (SET_SRC (set), 0);
2779 then_rtx = XEXP (SET_SRC (set), 1);
2780 else_rtx = XEXP (SET_SRC (set), 2);
2784 cond_rtx = SET_SRC (set);
2785 then_rtx = const_true_rtx;
2786 else_rtx = const0_rtx;
2789 switch (GET_CODE (cond_rtx))
2802 register int result;
2803 if (XEXP (cond_rtx, 0) != cc0_rtx)
2805 result = alter_cond (cond_rtx);
2807 validate_change (insn, &SET_SRC (set), then_rtx, 0);
2808 else if (result == -1)
2809 validate_change (insn, &SET_SRC (set), else_rtx, 0);
2810 else if (result == 2)
2811 INSN_CODE (insn) = -1;
2812 if (SET_DEST (set) == SET_SRC (set))
2814 PUT_CODE (insn, NOTE);
2815 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2816 NOTE_SOURCE_FILE (insn) = 0;
2828 /* Do machine-specific peephole optimizations if desired. */
2830 if (optimize && !flag_no_peephole && !nopeepholes)
2832 rtx next = peephole (insn);
2833 /* When peepholing, if there were notes within the peephole,
2834 emit them before the peephole. */
2835 if (next != 0 && next != NEXT_INSN (insn))
2837 rtx prev = PREV_INSN (insn);
2840 for (note = NEXT_INSN (insn); note != next;
2841 note = NEXT_INSN (note))
2842 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2844 /* In case this is prescan, put the notes
2845 in proper position for later rescan. */
2846 note = NEXT_INSN (insn);
2847 PREV_INSN (note) = prev;
2848 NEXT_INSN (prev) = note;
2849 NEXT_INSN (PREV_INSN (next)) = insn;
2850 PREV_INSN (insn) = PREV_INSN (next);
2851 NEXT_INSN (insn) = next;
2852 PREV_INSN (next) = insn;
2855 /* PEEPHOLE might have changed this. */
2856 body = PATTERN (insn);
2859 /* Try to recognize the instruction.
2860 If successful, verify that the operands satisfy the
2861 constraints for the instruction. Crash if they don't,
2862 since `reload' should have changed them so that they do. */
2864 insn_code_number = recog_memoized (insn);
2865 extract_insn (insn);
2866 cleanup_subreg_operands (insn);
2868 #ifdef REGISTER_CONSTRAINTS
2869 if (! constrain_operands (1))
2870 fatal_insn_not_found (insn);
2873 /* Some target machines need to prescan each insn before
2876 #ifdef FINAL_PRESCAN_INSN
2877 FINAL_PRESCAN_INSN (insn, recog_operand, recog_n_operands);
2881 cc_prev_status = cc_status;
2883 /* Update `cc_status' for this instruction.
2884 The instruction's output routine may change it further.
2885 If the output routine for a jump insn needs to depend
2886 on the cc status, it should look at cc_prev_status. */
2888 NOTICE_UPDATE_CC (body, insn);
2893 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2894 /* If we push arguments, we want to know where the calls are. */
2895 if (GET_CODE (insn) == CALL_INSN && dwarf2out_do_frame ())
2896 dwarf2out_frame_debug (insn);
2899 /* If the proper template needs to be chosen by some C code,
2900 run that code and get the real template. */
2902 template = insn_template[insn_code_number];
2905 template = (*insn_outfun[insn_code_number]) (recog_operand, insn);
2907 /* If the C code returns 0, it means that it is a jump insn
2908 which follows a deleted test insn, and that test insn
2909 needs to be reinserted. */
2912 if (prev_nonnote_insn (insn) != last_ignored_compare)
2915 return prev_nonnote_insn (insn);
2919 /* If the template is the string "#", it means that this insn must
2921 if (template[0] == '#' && template[1] == '\0')
2923 rtx new = try_split (body, insn, 0);
2925 /* If we didn't split the insn, go away. */
2926 if (new == insn && PATTERN (new) == body)
2927 fatal_insn ("Could not split insn", insn);
2929 #ifdef HAVE_ATTR_length
2930 /* This instruction should have been split in shorten_branches,
2931 to ensure that we would have valid length info for the
2943 /* Output assembler code from the template. */
2945 output_asm_insn (template, recog_operand);
2947 #if defined (DWARF2_UNWIND_INFO)
2948 #if !defined (ACCUMULATE_OUTGOING_ARGS)
2949 /* If we push arguments, we need to check all insns for stack
2951 if (GET_CODE (insn) == INSN && dwarf2out_do_frame ())
2952 dwarf2out_frame_debug (insn);
2954 #if defined (HAVE_prologue)
2955 /* If this insn is part of the prologue, emit DWARF v2
2957 if (RTX_FRAME_RELATED_P (insn) && dwarf2out_do_frame ())
2958 dwarf2out_frame_debug (insn);
2964 /* It's not at all clear why we did this and doing so interferes
2965 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2968 /* Mark this insn as having been output. */
2969 INSN_DELETED_P (insn) = 1;
2975 return NEXT_INSN (insn);
2978 /* Output debugging info to the assembler file FILE
2979 based on the NOTE-insn INSN, assumed to be a line number. */
2982 output_source_line (file, insn)
2983 FILE *file ATTRIBUTE_UNUSED;
2986 register char *filename = NOTE_SOURCE_FILE (insn);
2988 /* Remember filename for basic block profiling.
2989 Filenames are allocated on the permanent obstack
2990 or are passed in ARGV, so we don't have to save
2993 if (profile_block_flag && last_filename != filename)
2994 bb_file_label_num = add_bb_string (filename, TRUE);
2996 last_filename = filename;
2997 last_linenum = NOTE_LINE_NUMBER (insn);
2998 high_block_linenum = MAX (last_linenum, high_block_linenum);
2999 high_function_linenum = MAX (last_linenum, high_function_linenum);
3001 if (write_symbols != NO_DEBUG)
3003 #ifdef SDB_DEBUGGING_INFO
3004 if (write_symbols == SDB_DEBUG
3005 #if 0 /* People like having line numbers even in wrong file! */
3006 /* COFF can't handle multiple source files--lose, lose. */
3007 && !strcmp (filename, main_input_filename)
3009 /* COFF relative line numbers must be positive. */
3010 && last_linenum > sdb_begin_function_line)
3012 #ifdef ASM_OUTPUT_SOURCE_LINE
3013 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
3015 fprintf (file, "\t.ln\t%d\n",
3016 ((sdb_begin_function_line > -1)
3017 ? last_linenum - sdb_begin_function_line : 1));
3022 #if defined (DBX_DEBUGGING_INFO)
3023 if (write_symbols == DBX_DEBUG)
3024 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
3027 #if defined (XCOFF_DEBUGGING_INFO)
3028 if (write_symbols == XCOFF_DEBUG)
3029 xcoffout_source_line (file, filename, insn);
3032 #ifdef DWARF_DEBUGGING_INFO
3033 if (write_symbols == DWARF_DEBUG)
3034 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
3037 #ifdef DWARF2_DEBUGGING_INFO
3038 if (write_symbols == DWARF2_DEBUG)
3039 dwarf2out_line (filename, NOTE_LINE_NUMBER (insn));
3045 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3046 directly to the desired hard register. */
3048 cleanup_subreg_operands (insn)
3053 extract_insn (insn);
3054 for (i = 0; i < recog_n_operands; i++)
3056 if (GET_CODE (recog_operand[i]) == SUBREG)
3057 recog_operand[i] = alter_subreg (recog_operand[i]);
3058 else if (GET_CODE (recog_operand[i]) == PLUS
3059 || GET_CODE (recog_operand[i]) == MULT)
3060 recog_operand[i] = walk_alter_subreg (recog_operand[i]);
3063 for (i = 0; i < recog_n_dups; i++)
3065 if (GET_CODE (*recog_dup_loc[i]) == SUBREG)
3066 *recog_dup_loc[i] = alter_subreg (*recog_dup_loc[i]);
3067 else if (GET_CODE (*recog_dup_loc[i]) == PLUS
3068 || GET_CODE (*recog_dup_loc[i]) == MULT)
3069 *recog_dup_loc[i] = walk_alter_subreg (*recog_dup_loc[i]);
3073 /* If X is a SUBREG, replace it with a REG or a MEM,
3074 based on the thing it is a subreg of. */
3080 register rtx y = SUBREG_REG (x);
3082 if (GET_CODE (y) == SUBREG)
3083 y = alter_subreg (y);
3085 /* If reload is operating, we may be replacing inside this SUBREG.
3086 Check for that and make a new one if so. */
3087 if (reload_in_progress && find_replacement (&SUBREG_REG (x)) != 0)
3090 if (GET_CODE (y) == REG)
3092 /* If the word size is larger than the size of this register,
3093 adjust the register number to compensate. */
3094 /* ??? Note that this just catches stragglers created by/for
3095 integrate. It would be better if we either caught these
3096 earlier, or kept _all_ subregs until now and eliminate
3097 gen_lowpart and friends. */
3100 #ifdef ALTER_HARD_SUBREG
3101 REGNO (x) = ALTER_HARD_SUBREG(GET_MODE (x), SUBREG_WORD (x),
3102 GET_MODE (y), REGNO (y));
3104 REGNO (x) = REGNO (y) + SUBREG_WORD (x);
3106 /* This field has a different meaning for REGs and SUBREGs. Make sure
3110 else if (GET_CODE (y) == MEM)
3112 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
3113 if (BYTES_BIG_ENDIAN)
3114 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
3115 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
3117 MEM_COPY_ATTRIBUTES (x, y);
3118 MEM_ALIAS_SET (x) = MEM_ALIAS_SET (y);
3119 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
3125 /* Do alter_subreg on all the SUBREGs contained in X. */
3128 walk_alter_subreg (x)
3131 switch (GET_CODE (x))
3135 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3136 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
3140 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3144 return alter_subreg (x);
3155 /* Given BODY, the body of a jump instruction, alter the jump condition
3156 as required by the bits that are set in cc_status.flags.
3157 Not all of the bits there can be handled at this level in all cases.
3159 The value is normally 0.
3160 1 means that the condition has become always true.
3161 -1 means that the condition has become always false.
3162 2 means that COND has been altered. */
3170 if (cc_status.flags & CC_REVERSED)
3173 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
3176 if (cc_status.flags & CC_INVERTED)
3179 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
3182 if (cc_status.flags & CC_NOT_POSITIVE)
3183 switch (GET_CODE (cond))
3188 /* Jump becomes unconditional. */
3194 /* Jump becomes no-op. */
3198 PUT_CODE (cond, EQ);
3203 PUT_CODE (cond, NE);
3211 if (cc_status.flags & CC_NOT_NEGATIVE)
3212 switch (GET_CODE (cond))
3216 /* Jump becomes unconditional. */
3221 /* Jump becomes no-op. */
3226 PUT_CODE (cond, EQ);
3232 PUT_CODE (cond, NE);
3240 if (cc_status.flags & CC_NO_OVERFLOW)
3241 switch (GET_CODE (cond))
3244 /* Jump becomes unconditional. */
3248 PUT_CODE (cond, EQ);
3253 PUT_CODE (cond, NE);
3258 /* Jump becomes no-op. */
3265 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
3266 switch (GET_CODE (cond))
3272 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
3277 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
3282 if (cc_status.flags & CC_NOT_SIGNED)
3283 /* The flags are valid if signed condition operators are converted
3285 switch (GET_CODE (cond))
3288 PUT_CODE (cond, LEU);
3293 PUT_CODE (cond, LTU);
3298 PUT_CODE (cond, GTU);
3303 PUT_CODE (cond, GEU);
3315 /* Report inconsistency between the assembler template and the operands.
3316 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3319 output_operand_lossage (msgid)
3322 if (this_is_asm_operands)
3323 error_for_asm (this_is_asm_operands, "invalid `asm': %s", _(msgid));
3326 error ("output_operand: %s", _(msgid));
3331 /* Output of assembler code from a template, and its subroutines. */
3333 /* Output text from TEMPLATE to the assembler output file,
3334 obeying %-directions to substitute operands taken from
3335 the vector OPERANDS.
3337 %N (for N a digit) means print operand N in usual manner.
3338 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3339 and print the label name with no punctuation.
3340 %cN means require operand N to be a constant
3341 and print the constant expression with no punctuation.
3342 %aN means expect operand N to be a memory address
3343 (not a memory reference!) and print a reference
3345 %nN means expect operand N to be a constant
3346 and print a constant expression for minus the value
3347 of the operand, with no other punctuation. */
3352 if (flag_print_asm_name)
3354 /* Annotate the assembly with a comment describing the pattern and
3355 alternative used. */
3358 register int num = INSN_CODE (debug_insn);
3359 fprintf (asm_out_file, "\t%s %d\t%s",
3360 ASM_COMMENT_START, INSN_UID (debug_insn), insn_name[num]);
3361 if (insn_n_alternatives[num] > 1)
3362 fprintf (asm_out_file, "/%d", which_alternative + 1);
3363 #ifdef HAVE_ATTR_length
3364 fprintf (asm_out_file, "\t[length = %d]", get_attr_length (debug_insn));
3366 /* Clear this so only the first assembler insn
3367 of any rtl insn will get the special comment for -dp. */
3374 output_asm_insn (template, operands)
3375 const char *template;
3378 register const char *p;
3381 /* An insn may return a null string template
3382 in a case where no assembler code is needed. */
3387 putc ('\t', asm_out_file);
3389 #ifdef ASM_OUTPUT_OPCODE
3390 ASM_OUTPUT_OPCODE (asm_out_file, p);
3398 putc (c, asm_out_file);
3399 #ifdef ASM_OUTPUT_OPCODE
3400 while ((c = *p) == '\t')
3402 putc (c, asm_out_file);
3405 ASM_OUTPUT_OPCODE (asm_out_file, p);
3409 #ifdef ASSEMBLER_DIALECT
3414 /* If we want the first dialect, do nothing. Otherwise, skip
3415 DIALECT_NUMBER of strings ending with '|'. */
3416 for (i = 0; i < dialect_number; i++)
3418 while (*p && *p != '}' && *p++ != '|')
3429 /* Skip to close brace. */
3430 while (*p && *p++ != '}')
3439 /* %% outputs a single %. */
3443 putc (c, asm_out_file);
3445 /* %= outputs a number which is unique to each insn in the entire
3446 compilation. This is useful for making local labels that are
3447 referred to more than once in a given insn. */
3451 fprintf (asm_out_file, "%d", insn_counter);
3453 /* % followed by a letter and some digits
3454 outputs an operand in a special way depending on the letter.
3455 Letters `acln' are implemented directly.
3456 Other letters are passed to `output_operand' so that
3457 the PRINT_OPERAND macro can define them. */
3458 else if ((*p >= 'a' && *p <= 'z')
3459 || (*p >= 'A' && *p <= 'Z'))
3464 if (! (*p >= '0' && *p <= '9'))
3465 output_operand_lossage ("operand number missing after %-letter");
3466 else if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3467 output_operand_lossage ("operand number out of range");
3468 else if (letter == 'l')
3469 output_asm_label (operands[c]);
3470 else if (letter == 'a')
3471 output_address (operands[c]);
3472 else if (letter == 'c')
3474 if (CONSTANT_ADDRESS_P (operands[c]))
3475 output_addr_const (asm_out_file, operands[c]);
3477 output_operand (operands[c], 'c');
3479 else if (letter == 'n')
3481 if (GET_CODE (operands[c]) == CONST_INT)
3482 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
3483 - INTVAL (operands[c]));
3486 putc ('-', asm_out_file);
3487 output_addr_const (asm_out_file, operands[c]);
3491 output_operand (operands[c], letter);
3493 while ((c = *p) >= '0' && c <= '9') p++;
3495 /* % followed by a digit outputs an operand the default way. */
3496 else if (*p >= '0' && *p <= '9')
3499 if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3500 output_operand_lossage ("operand number out of range");
3502 output_operand (operands[c], 0);
3503 while ((c = *p) >= '0' && c <= '9') p++;
3505 /* % followed by punctuation: output something for that
3506 punctuation character alone, with no operand.
3507 The PRINT_OPERAND macro decides what is actually done. */
3508 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3509 else if (PRINT_OPERAND_PUNCT_VALID_P ((unsigned char)*p))
3510 output_operand (NULL_RTX, *p++);
3513 output_operand_lossage ("invalid %%-code");
3517 putc (c, asm_out_file);
3522 putc ('\n', asm_out_file);
3525 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3528 output_asm_label (x)
3533 if (GET_CODE (x) == LABEL_REF)
3534 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3535 else if (GET_CODE (x) == CODE_LABEL)
3536 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3538 output_operand_lossage ("`%l' operand isn't a label");
3540 assemble_name (asm_out_file, buf);
3543 /* Print operand X using machine-dependent assembler syntax.
3544 The macro PRINT_OPERAND is defined just to control this function.
3545 CODE is a non-digit that preceded the operand-number in the % spec,
3546 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3547 between the % and the digits.
3548 When CODE is a non-letter, X is 0.
3550 The meanings of the letters are machine-dependent and controlled
3551 by PRINT_OPERAND. */
3554 output_operand (x, code)
3558 if (x && GET_CODE (x) == SUBREG)
3559 x = alter_subreg (x);
3561 /* If X is a pseudo-register, abort now rather than writing trash to the
3564 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
3567 PRINT_OPERAND (asm_out_file, x, code);
3570 /* Print a memory reference operand for address X
3571 using machine-dependent assembler syntax.
3572 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3578 walk_alter_subreg (x);
3579 PRINT_OPERAND_ADDRESS (asm_out_file, x);
3582 /* Print an integer constant expression in assembler syntax.
3583 Addition and subtraction are the only arithmetic
3584 that may appear in these expressions. */
3587 output_addr_const (file, x)
3594 switch (GET_CODE (x))
3604 assemble_name (file, XSTR (x, 0));
3608 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3609 assemble_name (file, buf);
3613 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3614 assemble_name (file, buf);
3618 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
3622 /* This used to output parentheses around the expression,
3623 but that does not work on the 386 (either ATT or BSD assembler). */
3624 output_addr_const (file, XEXP (x, 0));
3628 if (GET_MODE (x) == VOIDmode)
3630 /* We can use %d if the number is one word and positive. */
3631 if (CONST_DOUBLE_HIGH (x))
3632 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3633 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
3634 else if (CONST_DOUBLE_LOW (x) < 0)
3635 fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
3637 fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
3640 /* We can't handle floating point constants;
3641 PRINT_OPERAND must handle them. */
3642 output_operand_lossage ("floating constant misused");
3646 /* Some assemblers need integer constants to appear last (eg masm). */
3647 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
3649 output_addr_const (file, XEXP (x, 1));
3650 if (INTVAL (XEXP (x, 0)) >= 0)
3651 fprintf (file, "+");
3652 output_addr_const (file, XEXP (x, 0));
3656 output_addr_const (file, XEXP (x, 0));
3657 if (INTVAL (XEXP (x, 1)) >= 0)
3658 fprintf (file, "+");
3659 output_addr_const (file, XEXP (x, 1));
3664 /* Avoid outputting things like x-x or x+5-x,
3665 since some assemblers can't handle that. */
3666 x = simplify_subtraction (x);
3667 if (GET_CODE (x) != MINUS)
3670 output_addr_const (file, XEXP (x, 0));
3671 fprintf (file, "-");
3672 if (GET_CODE (XEXP (x, 1)) == CONST_INT
3673 && INTVAL (XEXP (x, 1)) < 0)
3675 fprintf (file, "%s", ASM_OPEN_PAREN);
3676 output_addr_const (file, XEXP (x, 1));
3677 fprintf (file, "%s", ASM_CLOSE_PAREN);
3680 output_addr_const (file, XEXP (x, 1));
3685 output_addr_const (file, XEXP (x, 0));
3689 output_operand_lossage ("invalid expression as operand");
3693 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3694 %R prints the value of REGISTER_PREFIX.
3695 %L prints the value of LOCAL_LABEL_PREFIX.
3696 %U prints the value of USER_LABEL_PREFIX.
3697 %I prints the value of IMMEDIATE_PREFIX.
3698 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3699 Also supported are %d, %x, %s, %e, %f, %g and %%.
3701 We handle alternate assembler dialects here, just like output_asm_insn. */
3704 asm_fprintf VPROTO((FILE *file, const char *p, ...))
3706 #ifndef ANSI_PROTOTYPES
3714 VA_START (argptr, p);
3716 #ifndef ANSI_PROTOTYPES
3717 file = va_arg (argptr, FILE *);
3718 p = va_arg (argptr, const char *);
3726 #ifdef ASSEMBLER_DIALECT
3731 /* If we want the first dialect, do nothing. Otherwise, skip
3732 DIALECT_NUMBER of strings ending with '|'. */
3733 for (i = 0; i < dialect_number; i++)
3735 while (*p && *p++ != '|')
3745 /* Skip to close brace. */
3746 while (*p && *p++ != '}')
3757 while ((c >= '0' && c <= '9') || c == '.')
3765 fprintf (file, "%%");
3768 case 'd': case 'i': case 'u':
3769 case 'x': case 'p': case 'X':
3773 fprintf (file, buf, va_arg (argptr, int));
3777 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3778 but we do not check for those cases. It means that the value
3779 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3781 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3783 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3793 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3800 fprintf (file, buf, va_arg (argptr, long));
3808 fprintf (file, buf, va_arg (argptr, double));
3814 fprintf (file, buf, va_arg (argptr, char *));
3818 #ifdef ASM_OUTPUT_OPCODE
3819 ASM_OUTPUT_OPCODE (asm_out_file, p);
3824 #ifdef REGISTER_PREFIX
3825 fprintf (file, "%s", REGISTER_PREFIX);
3830 #ifdef IMMEDIATE_PREFIX
3831 fprintf (file, "%s", IMMEDIATE_PREFIX);
3836 #ifdef LOCAL_LABEL_PREFIX
3837 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
3842 fputs (user_label_prefix, file);
3845 #ifdef ASM_FPRINTF_EXTENSIONS
3846 /* Upper case letters are reserved for general use by asm_fprintf
3847 and so are not available to target specific code. In order to
3848 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
3849 they are defined here. As they get turned into real extensions
3850 to asm_fprintf they should be removed from this list. */
3851 case 'A': case 'B': case 'C': case 'D': case 'E':
3852 case 'F': case 'G': case 'H': case 'J': case 'K':
3853 case 'M': case 'N': case 'P': case 'Q': case 'S':
3854 case 'T': case 'V': case 'W': case 'Y': case 'Z':
3857 ASM_FPRINTF_EXTENSIONS (file, argptr, p)
3869 /* Split up a CONST_DOUBLE or integer constant rtx
3870 into two rtx's for single words,
3871 storing in *FIRST the word that comes first in memory in the target
3872 and in *SECOND the other. */
3875 split_double (value, first, second)
3877 rtx *first, *second;
3879 if (GET_CODE (value) == CONST_INT)
3881 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3883 /* In this case the CONST_INT holds both target words.
3884 Extract the bits from it into two word-sized pieces.
3885 Sign extend each half to HOST_WIDE_INT. */
3887 /* On machines where HOST_BITS_PER_WIDE_INT == BITS_PER_WORD
3888 the shift below will cause a compiler warning, even though
3889 this code won't be executed. So put the shift amounts in
3890 variables to avoid the warning. */
3891 int rshift = HOST_BITS_PER_WIDE_INT - BITS_PER_WORD;
3892 int lshift = HOST_BITS_PER_WIDE_INT - 2 * BITS_PER_WORD;
3894 low = GEN_INT ((INTVAL (value) << rshift) >> rshift);
3895 high = GEN_INT ((INTVAL (value) << lshift) >> rshift);
3896 if (WORDS_BIG_ENDIAN)
3909 /* The rule for using CONST_INT for a wider mode
3910 is that we regard the value as signed.
3911 So sign-extend it. */
3912 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
3913 if (WORDS_BIG_ENDIAN)
3925 else if (GET_CODE (value) != CONST_DOUBLE)
3927 if (WORDS_BIG_ENDIAN)
3929 *first = const0_rtx;
3935 *second = const0_rtx;
3938 else if (GET_MODE (value) == VOIDmode
3939 /* This is the old way we did CONST_DOUBLE integers. */
3940 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
3942 /* In an integer, the words are defined as most and least significant.
3943 So order them by the target's convention. */
3944 if (WORDS_BIG_ENDIAN)
3946 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3947 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3951 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3952 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3957 #ifdef REAL_ARITHMETIC
3958 REAL_VALUE_TYPE r; long l[2];
3959 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
3961 /* Note, this converts the REAL_VALUE_TYPE to the target's
3962 format, splits up the floating point double and outputs
3963 exactly 32 bits of it into each of l[0] and l[1] --
3964 not necessarily BITS_PER_WORD bits. */
3965 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
3967 /* If 32 bits is an entire word for the target, but not for the host,
3968 then sign-extend on the host so that the number will look the same
3969 way on the host that it would on the target. See for instance
3970 simplify_unary_operation. The #if is needed to avoid compiler
3973 #if HOST_BITS_PER_LONG > 32
3974 if (BITS_PER_WORD < HOST_BITS_PER_LONG && BITS_PER_WORD == 32)
3976 if (l[0] & ((long) 1 << 31))
3977 l[0] |= ((long) (-1) << 32);
3978 if (l[1] & ((long) 1 << 31))
3979 l[1] |= ((long) (-1) << 32);
3983 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
3984 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
3986 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
3987 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
3988 && ! flag_pretend_float)
3992 #ifdef HOST_WORDS_BIG_ENDIAN
3999 /* Host and target agree => no need to swap. */
4000 *first = GEN_INT (CONST_DOUBLE_LOW (value));
4001 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
4005 *second = GEN_INT (CONST_DOUBLE_LOW (value));
4006 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
4008 #endif /* no REAL_ARITHMETIC */
4012 /* Return nonzero if this function has no function calls. */
4019 if (profile_flag || profile_block_flag || profile_arc_flag)
4022 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4024 if (GET_CODE (insn) == CALL_INSN)
4026 if (GET_CODE (insn) == INSN
4027 && GET_CODE (PATTERN (insn)) == SEQUENCE
4028 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN)
4031 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4033 if (GET_CODE (XEXP (insn, 0)) == CALL_INSN)
4035 if (GET_CODE (XEXP (insn, 0)) == INSN
4036 && GET_CODE (PATTERN (XEXP (insn, 0))) == SEQUENCE
4037 && GET_CODE (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)) == CALL_INSN)
4044 /* On some machines, a function with no call insns
4045 can run faster if it doesn't create its own register window.
4046 When output, the leaf function should use only the "output"
4047 registers. Ordinarily, the function would be compiled to use
4048 the "input" registers to find its arguments; it is a candidate
4049 for leaf treatment if it uses only the "input" registers.
4050 Leaf function treatment means renumbering so the function
4051 uses the "output" registers instead. */
4053 #ifdef LEAF_REGISTERS
4055 static char permitted_reg_in_leaf_functions[] = LEAF_REGISTERS;
4057 /* Return 1 if this function uses only the registers that can be
4058 safely renumbered. */
4061 only_leaf_regs_used ()
4065 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4066 if ((regs_ever_live[i] || global_regs[i])
4067 && ! permitted_reg_in_leaf_functions[i])
4070 if (current_function_uses_pic_offset_table
4071 && pic_offset_table_rtx != 0
4072 && GET_CODE (pic_offset_table_rtx) == REG
4073 && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4079 /* Scan all instructions and renumber all registers into those
4080 available in leaf functions. */
4083 leaf_renumber_regs (first)
4088 /* Renumber only the actual patterns.
4089 The reg-notes can contain frame pointer refs,
4090 and renumbering them could crash, and should not be needed. */
4091 for (insn = first; insn; insn = NEXT_INSN (insn))
4092 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
4093 leaf_renumber_regs_insn (PATTERN (insn));
4094 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4095 if (GET_RTX_CLASS (GET_CODE (XEXP (insn, 0))) == 'i')
4096 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
4099 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4100 available in leaf functions. */
4103 leaf_renumber_regs_insn (in_rtx)
4104 register rtx in_rtx;
4107 register const char *format_ptr;
4112 /* Renumber all input-registers into output-registers.
4113 renumbered_regs would be 1 for an output-register;
4116 if (GET_CODE (in_rtx) == REG)
4120 /* Don't renumber the same reg twice. */
4124 newreg = REGNO (in_rtx);
4125 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4126 to reach here as part of a REG_NOTE. */
4127 if (newreg >= FIRST_PSEUDO_REGISTER)
4132 newreg = LEAF_REG_REMAP (newreg);
4135 regs_ever_live[REGNO (in_rtx)] = 0;
4136 regs_ever_live[newreg] = 1;
4137 REGNO (in_rtx) = newreg;
4141 if (GET_RTX_CLASS (GET_CODE (in_rtx)) == 'i')
4143 /* Inside a SEQUENCE, we find insns.
4144 Renumber just the patterns of these insns,
4145 just as we do for the top-level insns. */
4146 leaf_renumber_regs_insn (PATTERN (in_rtx));
4150 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
4152 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
4153 switch (*format_ptr++)
4156 leaf_renumber_regs_insn (XEXP (in_rtx, i));
4160 if (NULL != XVEC (in_rtx, i))
4162 for (j = 0; j < XVECLEN (in_rtx, i); j++)
4163 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));