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 */
288 extern rtx peephole PROTO((rtx));
291 static struct bb_str *sbb_head = 0; /* Head of string list. */
292 static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */
293 static int sbb_label_num = 0; /* Last label used */
295 #ifdef HAVE_ATTR_length
296 static int asm_insn_count PROTO((rtx));
298 static void profile_function PROTO((FILE *));
299 static void profile_after_prologue PROTO((FILE *));
300 static void add_bb PROTO((FILE *));
301 static int add_bb_string PROTO((const char *, int));
302 static void output_source_line PROTO((FILE *, rtx));
303 static rtx walk_alter_subreg PROTO((rtx));
304 static void output_asm_name PROTO((void));
305 static void output_operand PROTO((rtx, int));
306 #ifdef LEAF_REGISTERS
307 static void leaf_renumber_regs PROTO((rtx));
310 static int alter_cond PROTO((rtx));
313 /* Initialize data in final at the beginning of a compilation. */
316 init_final (filename)
317 const char *filename ATTRIBUTE_UNUSED;
319 next_block_index = 2;
321 max_block_depth = 20;
322 pending_blocks = (int *) xmalloc (20 * sizeof *pending_blocks);
325 #ifdef ASSEMBLER_DIALECT
326 dialect_number = ASSEMBLER_DIALECT;
330 /* Called at end of source file,
331 to output the block-profiling table for this entire compilation. */
335 const char *filename;
339 if (profile_block_flag || profile_arc_flag)
342 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
346 int long_bytes = LONG_TYPE_SIZE / BITS_PER_UNIT;
347 int pointer_bytes = POINTER_SIZE / BITS_PER_UNIT;
349 if (profile_block_flag)
350 size = long_bytes * count_basic_blocks;
352 size = long_bytes * count_instrumented_arcs;
355 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
356 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
357 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
361 /* Output the main header, of 11 words:
362 0: 1 if this file is initialized, else 0.
363 1: address of file name (LPBX1).
364 2: address of table of counts (LPBX2).
365 3: number of counts in the table.
366 4: always 0, for compatibility with Sun.
368 The following are GNU extensions:
370 5: address of table of start addrs of basic blocks (LPBX3).
371 6: Number of bytes in this header.
372 7: address of table of function names (LPBX4).
373 8: address of table of line numbers (LPBX5) or 0.
374 9: address of table of file names (LPBX6) or 0.
375 10: space reserved for basic block profiling. */
377 ASM_OUTPUT_ALIGN (asm_out_file, align);
379 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
381 assemble_integer (const0_rtx, long_bytes, 1);
383 /* address of filename */
384 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
385 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
387 /* address of count table */
388 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
389 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
391 /* count of the # of basic blocks or # of instrumented arcs */
392 if (profile_block_flag)
393 assemble_integer (GEN_INT (count_basic_blocks), long_bytes, 1);
395 assemble_integer (GEN_INT (count_instrumented_arcs), long_bytes,
398 /* zero word (link field) */
399 assemble_integer (const0_rtx, pointer_bytes, 1);
401 /* address of basic block start address table */
402 if (profile_block_flag)
404 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
405 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
409 assemble_integer (const0_rtx, pointer_bytes, 1);
411 /* byte count for extended structure. */
412 assemble_integer (GEN_INT (11 * UNITS_PER_WORD), long_bytes, 1);
414 /* address of function name table */
415 if (profile_block_flag)
417 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
418 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
422 assemble_integer (const0_rtx, pointer_bytes, 1);
424 /* address of line number and filename tables if debugging. */
425 if (write_symbols != NO_DEBUG && profile_block_flag)
427 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
428 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
430 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
431 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
436 assemble_integer (const0_rtx, pointer_bytes, 1);
437 assemble_integer (const0_rtx, pointer_bytes, 1);
440 /* space for extension ptr (link field) */
441 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
443 /* Output the file name changing the suffix to .d for Sun tcov
445 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
447 char *cwd = getpwd ();
448 int len = strlen (filename) + strlen (cwd) + 1;
449 char *data_file = (char *) alloca (len + 4);
451 strcpy (data_file, cwd);
452 strcat (data_file, "/");
453 strcat (data_file, filename);
454 strip_off_ending (data_file, len);
455 if (profile_block_flag)
456 strcat (data_file, ".d");
458 strcat (data_file, ".da");
459 assemble_string (data_file, strlen (data_file) + 1);
462 /* Make space for the table of counts. */
465 /* Realign data section. */
466 ASM_OUTPUT_ALIGN (asm_out_file, align);
467 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
469 assemble_zeros (size);
473 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
474 #ifdef ASM_OUTPUT_SHARED_LOCAL
475 if (flag_shared_data)
476 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
479 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
480 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
483 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
484 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
487 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
492 /* Output any basic block strings */
493 if (profile_block_flag)
495 readonly_data_section ();
498 ASM_OUTPUT_ALIGN (asm_out_file, align);
499 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
501 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC",
503 assemble_string (sptr->string, sptr->length);
508 /* Output the table of addresses. */
509 if (profile_block_flag)
511 /* Realign in new section */
512 ASM_OUTPUT_ALIGN (asm_out_file, align);
513 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
514 for (i = 0; i < count_basic_blocks; i++)
516 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
517 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
522 /* Output the table of function names. */
523 if (profile_block_flag)
525 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
526 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
528 if (ptr->func_label_num >= 0)
530 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
531 ptr->func_label_num);
532 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
536 assemble_integer (const0_rtx, pointer_bytes, 1);
539 for ( ; i < count_basic_blocks; i++)
540 assemble_integer (const0_rtx, pointer_bytes, 1);
543 if (write_symbols != NO_DEBUG && profile_block_flag)
545 /* Output the table of line numbers. */
546 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
547 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
548 assemble_integer (GEN_INT (ptr->line_num), long_bytes, 1);
550 for ( ; i < count_basic_blocks; i++)
551 assemble_integer (const0_rtx, long_bytes, 1);
553 /* Output the table of file names. */
554 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
555 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
557 if (ptr->file_label_num >= 0)
559 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
560 ptr->file_label_num);
561 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
565 assemble_integer (const0_rtx, pointer_bytes, 1);
568 for ( ; i < count_basic_blocks; i++)
569 assemble_integer (const0_rtx, pointer_bytes, 1);
572 /* End with the address of the table of addresses,
573 so we can find it easily, as the last word in the file's text. */
574 if (profile_block_flag)
576 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
577 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
583 /* Enable APP processing of subsequent output.
584 Used before the output from an `asm' statement. */
591 fputs (ASM_APP_ON, asm_out_file);
596 /* Disable APP processing of subsequent output.
597 Called from varasm.c before most kinds of output. */
604 fputs (ASM_APP_OFF, asm_out_file);
609 /* Return the number of slots filled in the current
610 delayed branch sequence (we don't count the insn needing the
611 delay slot). Zero if not in a delayed branch sequence. */
615 dbr_sequence_length ()
617 if (final_sequence != 0)
618 return XVECLEN (final_sequence, 0) - 1;
624 /* The next two pages contain routines used to compute the length of an insn
625 and to shorten branches. */
627 /* Arrays for insn lengths, and addresses. The latter is referenced by
628 `insn_current_length'. */
630 static short *insn_lengths;
633 /* Max uid for which the above arrays are valid. */
634 static int insn_lengths_max_uid;
636 /* Address of insn being processed. Used by `insn_current_length'. */
637 int insn_current_address;
639 /* Address of insn being processed in previous iteration. */
640 int insn_last_address;
642 /* konwn invariant alignment of insn being processed. */
643 int insn_current_align;
645 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
646 gives the next following alignment insn that increases the known
647 alignment, or NULL_RTX if there is no such insn.
648 For any alignment obtained this way, we can again index uid_align with
649 its uid to obtain the next following align that in turn increases the
650 alignment, till we reach NULL_RTX; the sequence obtained this way
651 for each insn we'll call the alignment chain of this insn in the following
654 struct label_alignment {
659 static rtx *uid_align;
660 static int *uid_shuid;
661 static struct label_alignment *label_align;
663 /* Indicate that branch shortening hasn't yet been done. */
682 insn_lengths_max_uid = 0;
686 free (insn_addresses);
696 /* Obtain the current length of an insn. If branch shortening has been done,
697 get its actual length. Otherwise, get its maximum length. */
700 get_attr_length (insn)
703 #ifdef HAVE_ATTR_length
708 if (insn_lengths_max_uid > INSN_UID (insn))
709 return insn_lengths[INSN_UID (insn)];
711 switch (GET_CODE (insn))
719 length = insn_default_length (insn);
723 body = PATTERN (insn);
724 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
726 /* Alignment is machine-dependent and should be handled by
730 length = insn_default_length (insn);
734 body = PATTERN (insn);
735 if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
738 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
739 length = asm_insn_count (body) * insn_default_length (insn);
740 else if (GET_CODE (body) == SEQUENCE)
741 for (i = 0; i < XVECLEN (body, 0); i++)
742 length += get_attr_length (XVECEXP (body, 0, i));
744 length = insn_default_length (insn);
751 #ifdef ADJUST_INSN_LENGTH
752 ADJUST_INSN_LENGTH (insn, length);
755 #else /* not HAVE_ATTR_length */
757 #endif /* not HAVE_ATTR_length */
760 /* Code to handle alignment inside shorten_branches. */
762 /* Here is an explanation how the algorithm in align_fuzz can give
765 Call a sequence of instructions beginning with alignment point X
766 and continuing until the next alignment point `block X'. When `X'
767 is used in an expression, it means the alignment value of the
770 Call the distance between the start of the first insn of block X, and
771 the end of the last insn of block X `IX', for the `inner size of X'.
772 This is clearly the sum of the instruction lengths.
774 Likewise with the next alignment-delimited block following X, which we
777 Call the distance between the start of the first insn of block X, and
778 the start of the first insn of block Y `OX', for the `outer size of X'.
780 The estimated padding is then OX - IX.
782 OX can be safely estimated as
787 OX = round_up(IX, X) + Y - X
789 Clearly est(IX) >= real(IX), because that only depends on the
790 instruction lengths, and those being overestimated is a given.
792 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
793 we needn't worry about that when thinking about OX.
795 When X >= Y, the alignment provided by Y adds no uncertainty factor
796 for branch ranges starting before X, so we can just round what we have.
797 But when X < Y, we don't know anything about the, so to speak,
798 `middle bits', so we have to assume the worst when aligning up from an
799 address mod X to one mod Y, which is Y - X. */
802 #define LABEL_ALIGN(LABEL) align_labels_log
805 #ifndef LABEL_ALIGN_MAX_SKIP
806 #define LABEL_ALIGN_MAX_SKIP (align_labels-1)
810 #define LOOP_ALIGN(LABEL) align_loops_log
813 #ifndef LOOP_ALIGN_MAX_SKIP
814 #define LOOP_ALIGN_MAX_SKIP (align_loops-1)
817 #ifndef LABEL_ALIGN_AFTER_BARRIER
818 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) align_jumps_log
821 #ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
822 #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP (align_jumps-1)
825 #ifndef ADDR_VEC_ALIGN
827 final_addr_vec_align (addr_vec)
830 int align = exact_log2 (GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec))));
832 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
833 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
837 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
840 #ifndef INSN_LENGTH_ALIGNMENT
841 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
844 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
846 static int min_labelno, max_labelno;
848 #define LABEL_TO_ALIGNMENT(LABEL) \
849 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
851 #define LABEL_TO_MAX_SKIP(LABEL) \
852 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
854 /* For the benefit of port specific code do this also as a function. */
856 label_to_alignment (label)
859 return LABEL_TO_ALIGNMENT (label);
862 #ifdef HAVE_ATTR_length
863 /* The differences in addresses
864 between a branch and its target might grow or shrink depending on
865 the alignment the start insn of the range (the branch for a forward
866 branch or the label for a backward branch) starts out on; if these
867 differences are used naively, they can even oscillate infinitely.
868 We therefore want to compute a 'worst case' address difference that
869 is independent of the alignment the start insn of the range end
870 up on, and that is at least as large as the actual difference.
871 The function align_fuzz calculates the amount we have to add to the
872 naively computed difference, by traversing the part of the alignment
873 chain of the start insn of the range that is in front of the end insn
874 of the range, and considering for each alignment the maximum amount
875 that it might contribute to a size increase.
877 For casesi tables, we also want to know worst case minimum amounts of
878 address difference, in case a machine description wants to introduce
879 some common offset that is added to all offsets in a table.
880 For this purpose, align_fuzz with a growth argument of 0 comuptes the
881 appropriate adjustment. */
884 /* Compute the maximum delta by which the difference of the addresses of
885 START and END might grow / shrink due to a different address for start
886 which changes the size of alignment insns between START and END.
887 KNOWN_ALIGN_LOG is the alignment known for START.
888 GROWTH should be ~0 if the objective is to compute potential code size
889 increase, and 0 if the objective is to compute potential shrink.
890 The return value is undefined for any other value of GROWTH. */
892 align_fuzz (start, end, known_align_log, growth)
897 int uid = INSN_UID (start);
899 int known_align = 1 << known_align_log;
900 int end_shuid = INSN_SHUID (end);
903 for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
905 int align_addr, new_align;
907 uid = INSN_UID (align_label);
908 align_addr = insn_addresses[uid] - insn_lengths[uid];
909 if (uid_shuid[uid] > end_shuid)
911 known_align_log = LABEL_TO_ALIGNMENT (align_label);
912 new_align = 1 << known_align_log;
913 if (new_align < known_align)
915 fuzz += (-align_addr ^ growth) & (new_align - known_align);
916 known_align = new_align;
921 /* Compute a worst-case reference address of a branch so that it
922 can be safely used in the presence of aligned labels. Since the
923 size of the branch itself is unknown, the size of the branch is
924 not included in the range. I.e. for a forward branch, the reference
925 address is the end address of the branch as known from the previous
926 branch shortening pass, minus a value to account for possible size
927 increase due to alignment. For a backward branch, it is the start
928 address of the branch as known from the current pass, plus a value
929 to account for possible size increase due to alignment.
930 NB.: Therefore, the maximum offset allowed for backward branches needs
931 to exclude the branch size. */
933 insn_current_reference_address (branch)
937 rtx seq = NEXT_INSN (PREV_INSN (branch));
938 int seq_uid = INSN_UID (seq);
939 if (GET_CODE (branch) != JUMP_INSN)
940 /* This can happen for example on the PA; the objective is to know the
941 offset to address something in front of the start of the function.
942 Thus, we can treat it like a backward branch.
943 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
944 any alignment we'd encounter, so we skip the call to align_fuzz. */
945 return insn_current_address;
946 dest = JUMP_LABEL (branch);
947 /* BRANCH has no proper alignment chain set, so use SEQ. */
948 if (INSN_SHUID (branch) < INSN_SHUID (dest))
950 /* Forward branch. */
951 return (insn_last_address + insn_lengths[seq_uid]
952 - align_fuzz (seq, dest, length_unit_log, ~0));
956 /* Backward branch. */
957 return (insn_current_address
958 + align_fuzz (dest, seq, length_unit_log, ~0));
961 #endif /* HAVE_ATTR_length */
963 /* Make a pass over all insns and compute their actual lengths by shortening
964 any branches of variable length if possible. */
966 /* Give a default value for the lowest address in a function. */
968 #ifndef FIRST_INSN_ADDRESS
969 #define FIRST_INSN_ADDRESS 0
972 /* shorten_branches might be called multiple times: for example, the SH
973 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
974 In order to do this, it needs proper length information, which it obtains
975 by calling shorten_branches. This cannot be collapsed with
976 shorten_branches itself into a single pass unless we also want to intergate
977 reorg.c, since the branch splitting exposes new instructions with delay
981 shorten_branches (first)
989 #ifdef HAVE_ATTR_length
990 #define MAX_CODE_ALIGN 16
992 int something_changed = 1;
993 char *varying_length;
996 rtx align_tab[MAX_CODE_ALIGN];
998 /* In order to make sure that all instructions have valid length info,
999 we must split them before we compute the address/length info. */
1001 for (insn = NEXT_INSN (first); insn; insn = NEXT_INSN (insn))
1002 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1005 /* Don't split the insn if it has been deleted. */
1006 if (! INSN_DELETED_P (old))
1007 insn = try_split (PATTERN (old), old, 1);
1008 /* When not optimizing, the old insn will be still left around
1009 with only the 'deleted' bit set. Transform it into a note
1010 to avoid confusion of subsequent processing. */
1011 if (INSN_DELETED_P (old))
1013 PUT_CODE (old , NOTE);
1014 NOTE_LINE_NUMBER (old) = NOTE_INSN_DELETED;
1015 NOTE_SOURCE_FILE (old) = 0;
1020 /* We must do some computations even when not actually shortening, in
1021 order to get the alignment information for the labels. */
1023 init_insn_lengths ();
1025 /* Compute maximum UID and allocate label_align / uid_shuid. */
1026 max_uid = get_max_uid ();
1028 max_labelno = max_label_num ();
1029 min_labelno = get_first_label_num ();
1030 label_align = (struct label_alignment *)
1031 xcalloc ((max_labelno - min_labelno + 1), sizeof (struct label_alignment));
1033 uid_shuid = (int *) xmalloc (max_uid * sizeof *uid_shuid);
1035 /* Initialize label_align and set up uid_shuid to be strictly
1036 monotonically rising with insn order. */
1037 /* We use max_log here to keep track of the maximum alignment we want to
1038 impose on the next CODE_LABEL (or the current one if we are processing
1039 the CODE_LABEL itself). */
1044 for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
1048 INSN_SHUID (insn) = i++;
1049 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1051 /* reorg might make the first insn of a loop being run once only,
1052 and delete the label in front of it. Then we want to apply
1053 the loop alignment to the new label created by reorg, which
1054 is separated by the former loop start insn from the
1055 NOTE_INSN_LOOP_BEG. */
1057 else if (GET_CODE (insn) == CODE_LABEL)
1061 log = LABEL_ALIGN (insn);
1065 max_skip = LABEL_ALIGN_MAX_SKIP;
1067 next = NEXT_INSN (insn);
1068 /* ADDR_VECs only take room if read-only data goes into the text
1070 if (JUMP_TABLES_IN_TEXT_SECTION
1071 #if !defined(READONLY_DATA_SECTION)
1075 if (next && GET_CODE (next) == JUMP_INSN)
1077 rtx nextbody = PATTERN (next);
1078 if (GET_CODE (nextbody) == ADDR_VEC
1079 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1081 log = ADDR_VEC_ALIGN (next);
1085 max_skip = LABEL_ALIGN_MAX_SKIP;
1089 LABEL_TO_ALIGNMENT (insn) = max_log;
1090 LABEL_TO_MAX_SKIP (insn) = max_skip;
1094 else if (GET_CODE (insn) == BARRIER)
1098 for (label = insn; label && GET_RTX_CLASS (GET_CODE (label)) != 'i';
1099 label = NEXT_INSN (label))
1100 if (GET_CODE (label) == CODE_LABEL)
1102 log = LABEL_ALIGN_AFTER_BARRIER (insn);
1106 max_skip = LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP;
1111 /* Again, we allow NOTE_INSN_LOOP_BEG - INSN - CODE_LABEL
1112 sequences in order to handle reorg output efficiently. */
1113 else if (GET_CODE (insn) == NOTE
1114 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
1119 /* Search for the label that starts the loop.
1120 Don't skip past the end of the loop, since that could
1121 lead to putting an alignment where it does not belong.
1122 However, a label after a nested (non-)loop would be OK. */
1123 for (label = insn; label; label = NEXT_INSN (label))
1125 if (GET_CODE (label) == NOTE
1126 && NOTE_LINE_NUMBER (label) == NOTE_INSN_LOOP_BEG)
1128 else if (GET_CODE (label) == NOTE
1129 && NOTE_LINE_NUMBER (label) == NOTE_INSN_LOOP_END
1132 else if (GET_CODE (label) == CODE_LABEL)
1134 log = LOOP_ALIGN (insn);
1138 max_skip = LOOP_ALIGN_MAX_SKIP;
1147 #ifdef HAVE_ATTR_length
1149 /* Allocate the rest of the arrays. */
1150 insn_lengths = (short *) xmalloc (max_uid * sizeof (short));
1151 insn_lengths_max_uid = max_uid;
1152 /* Syntax errors can lead to labels being outside of the main insn stream.
1153 Initialize insn_addresses, so that we get reproducible results. */
1154 insn_addresses = (int *) xcalloc (max_uid, sizeof (int));
1156 varying_length = (char *) xcalloc (max_uid, sizeof (char));
1158 /* Initialize uid_align. We scan instructions
1159 from end to start, and keep in align_tab[n] the last seen insn
1160 that does an alignment of at least n+1, i.e. the successor
1161 in the alignment chain for an insn that does / has a known
1163 uid_align = (rtx *) xcalloc (max_uid, sizeof *uid_align);
1165 for (i = MAX_CODE_ALIGN; --i >= 0; )
1166 align_tab[i] = NULL_RTX;
1167 seq = get_last_insn ();
1168 for (; seq; seq = PREV_INSN (seq))
1170 int uid = INSN_UID (seq);
1172 log = (GET_CODE (seq) == CODE_LABEL ? LABEL_TO_ALIGNMENT (seq) : 0);
1173 uid_align[uid] = align_tab[0];
1176 /* Found an alignment label. */
1177 uid_align[uid] = align_tab[log];
1178 for (i = log - 1; i >= 0; i--)
1182 #ifdef CASE_VECTOR_SHORTEN_MODE
1185 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1188 int min_shuid = INSN_SHUID (get_insns ()) - 1;
1189 int max_shuid = INSN_SHUID (get_last_insn ()) + 1;
1192 for (insn = first; insn != 0; insn = NEXT_INSN (insn))
1194 rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat;
1195 int len, i, min, max, insn_shuid;
1197 addr_diff_vec_flags flags;
1199 if (GET_CODE (insn) != JUMP_INSN
1200 || GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)
1202 pat = PATTERN (insn);
1203 len = XVECLEN (pat, 1);
1206 min_align = MAX_CODE_ALIGN;
1207 for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
1209 rtx lab = XEXP (XVECEXP (pat, 1, i), 0);
1210 int shuid = INSN_SHUID (lab);
1221 if (min_align > LABEL_TO_ALIGNMENT (lab))
1222 min_align = LABEL_TO_ALIGNMENT (lab);
1224 XEXP (pat, 2) = gen_rtx_LABEL_REF (VOIDmode, min_lab);
1225 XEXP (pat, 3) = gen_rtx_LABEL_REF (VOIDmode, max_lab);
1226 insn_shuid = INSN_SHUID (insn);
1227 rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0));
1228 flags.min_align = min_align;
1229 flags.base_after_vec = rel > insn_shuid;
1230 flags.min_after_vec = min > insn_shuid;
1231 flags.max_after_vec = max > insn_shuid;
1232 flags.min_after_base = min > rel;
1233 flags.max_after_base = max > rel;
1234 ADDR_DIFF_VEC_FLAGS (pat) = flags;
1237 #endif /* CASE_VECTOR_SHORTEN_MODE */
1240 /* Compute initial lengths, addresses, and varying flags for each insn. */
1241 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1243 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1245 uid = INSN_UID (insn);
1247 insn_lengths[uid] = 0;
1249 if (GET_CODE (insn) == CODE_LABEL)
1251 int log = LABEL_TO_ALIGNMENT (insn);
1254 int align = 1 << log;
1255 int new_address = (insn_current_address + align - 1) & -align;
1256 insn_lengths[uid] = new_address - insn_current_address;
1257 insn_current_address = new_address;
1261 insn_addresses[uid] = insn_current_address;
1263 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
1264 || GET_CODE (insn) == CODE_LABEL)
1266 if (INSN_DELETED_P (insn))
1269 body = PATTERN (insn);
1270 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1272 /* This only takes room if read-only data goes into the text
1274 if (JUMP_TABLES_IN_TEXT_SECTION
1275 #if !defined(READONLY_DATA_SECTION)
1279 insn_lengths[uid] = (XVECLEN (body,
1280 GET_CODE (body) == ADDR_DIFF_VEC)
1281 * GET_MODE_SIZE (GET_MODE (body)));
1282 /* Alignment is handled by ADDR_VEC_ALIGN. */
1284 else if (asm_noperands (body) >= 0)
1285 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
1286 else if (GET_CODE (body) == SEQUENCE)
1289 int const_delay_slots;
1291 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
1293 const_delay_slots = 0;
1295 /* Inside a delay slot sequence, we do not do any branch shortening
1296 if the shortening could change the number of delay slots
1298 for (i = 0; i < XVECLEN (body, 0); i++)
1300 rtx inner_insn = XVECEXP (body, 0, i);
1301 int inner_uid = INSN_UID (inner_insn);
1304 if (asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
1305 inner_length = (asm_insn_count (PATTERN (inner_insn))
1306 * insn_default_length (inner_insn));
1308 inner_length = insn_default_length (inner_insn);
1310 insn_lengths[inner_uid] = inner_length;
1311 if (const_delay_slots)
1313 if ((varying_length[inner_uid]
1314 = insn_variable_length_p (inner_insn)) != 0)
1315 varying_length[uid] = 1;
1316 insn_addresses[inner_uid] = (insn_current_address +
1320 varying_length[inner_uid] = 0;
1321 insn_lengths[uid] += inner_length;
1324 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
1326 insn_lengths[uid] = insn_default_length (insn);
1327 varying_length[uid] = insn_variable_length_p (insn);
1330 /* If needed, do any adjustment. */
1331 #ifdef ADJUST_INSN_LENGTH
1332 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
1333 if (insn_lengths[uid] < 0)
1334 fatal_insn ("Negative insn length", insn);
1338 /* Now loop over all the insns finding varying length insns. For each,
1339 get the current insn length. If it has changed, reflect the change.
1340 When nothing changes for a full pass, we are done. */
1342 while (something_changed)
1344 something_changed = 0;
1345 insn_current_align = MAX_CODE_ALIGN - 1;
1346 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1348 insn = NEXT_INSN (insn))
1351 #ifdef ADJUST_INSN_LENGTH
1356 uid = INSN_UID (insn);
1358 if (GET_CODE (insn) == CODE_LABEL)
1360 int log = LABEL_TO_ALIGNMENT (insn);
1361 if (log > insn_current_align)
1363 int align = 1 << log;
1364 int new_address= (insn_current_address + align - 1) & -align;
1365 insn_lengths[uid] = new_address - insn_current_address;
1366 insn_current_align = log;
1367 insn_current_address = new_address;
1370 insn_lengths[uid] = 0;
1371 insn_addresses[uid] = insn_current_address;
1375 length_align = INSN_LENGTH_ALIGNMENT (insn);
1376 if (length_align < insn_current_align)
1377 insn_current_align = length_align;
1379 insn_last_address = insn_addresses[uid];
1380 insn_addresses[uid] = insn_current_address;
1382 #ifdef CASE_VECTOR_SHORTEN_MODE
1383 if (optimize && GET_CODE (insn) == JUMP_INSN
1384 && GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
1386 rtx body = PATTERN (insn);
1387 int old_length = insn_lengths[uid];
1388 rtx rel_lab = XEXP (XEXP (body, 0), 0);
1389 rtx min_lab = XEXP (XEXP (body, 2), 0);
1390 rtx max_lab = XEXP (XEXP (body, 3), 0);
1391 addr_diff_vec_flags flags = ADDR_DIFF_VEC_FLAGS (body);
1392 int rel_addr = insn_addresses[INSN_UID (rel_lab)];
1393 int min_addr = insn_addresses[INSN_UID (min_lab)];
1394 int max_addr = insn_addresses[INSN_UID (max_lab)];
1398 /* Try to find a known alignment for rel_lab. */
1399 for (prev = rel_lab;
1401 && ! insn_lengths[INSN_UID (prev)]
1402 && ! (varying_length[INSN_UID (prev)] & 1);
1403 prev = PREV_INSN (prev))
1404 if (varying_length[INSN_UID (prev)] & 2)
1406 rel_align = LABEL_TO_ALIGNMENT (prev);
1410 /* See the comment on addr_diff_vec_flags in rtl.h for the
1411 meaning of the flags values. base: REL_LAB vec: INSN */
1412 /* Anything after INSN has still addresses from the last
1413 pass; adjust these so that they reflect our current
1414 estimate for this pass. */
1415 if (flags.base_after_vec)
1416 rel_addr += insn_current_address - insn_last_address;
1417 if (flags.min_after_vec)
1418 min_addr += insn_current_address - insn_last_address;
1419 if (flags.max_after_vec)
1420 max_addr += insn_current_address - insn_last_address;
1421 /* We want to know the worst case, i.e. lowest possible value
1422 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1423 its offset is positive, and we have to be wary of code shrink;
1424 otherwise, it is negative, and we have to be vary of code
1426 if (flags.min_after_base)
1428 /* If INSN is between REL_LAB and MIN_LAB, the size
1429 changes we are about to make can change the alignment
1430 within the observed offset, therefore we have to break
1431 it up into two parts that are independent. */
1432 if (! flags.base_after_vec && flags.min_after_vec)
1434 min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
1435 min_addr -= align_fuzz (insn, min_lab, 0, 0);
1438 min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
1442 if (flags.base_after_vec && ! flags.min_after_vec)
1444 min_addr -= align_fuzz (min_lab, insn, 0, ~0);
1445 min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
1448 min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
1450 /* Likewise, determine the highest lowest possible value
1451 for the offset of MAX_LAB. */
1452 if (flags.max_after_base)
1454 if (! flags.base_after_vec && flags.max_after_vec)
1456 max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
1457 max_addr += align_fuzz (insn, max_lab, 0, ~0);
1460 max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
1464 if (flags.base_after_vec && ! flags.max_after_vec)
1466 max_addr += align_fuzz (max_lab, insn, 0, 0);
1467 max_addr += align_fuzz (insn, rel_lab, 0, 0);
1470 max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
1472 PUT_MODE (body, CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
1473 max_addr - rel_addr,
1475 if (JUMP_TABLES_IN_TEXT_SECTION
1476 #if !defined(READONLY_DATA_SECTION)
1482 = (XVECLEN (body, 1) * GET_MODE_SIZE (GET_MODE (body)));
1483 insn_current_address += insn_lengths[uid];
1484 if (insn_lengths[uid] != old_length)
1485 something_changed = 1;
1490 #endif /* CASE_VECTOR_SHORTEN_MODE */
1492 if (! (varying_length[uid]))
1494 insn_current_address += insn_lengths[uid];
1497 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
1501 body = PATTERN (insn);
1503 for (i = 0; i < XVECLEN (body, 0); i++)
1505 rtx inner_insn = XVECEXP (body, 0, i);
1506 int inner_uid = INSN_UID (inner_insn);
1509 insn_addresses[inner_uid] = insn_current_address;
1511 /* insn_current_length returns 0 for insns with a
1512 non-varying length. */
1513 if (! varying_length[inner_uid])
1514 inner_length = insn_lengths[inner_uid];
1516 inner_length = insn_current_length (inner_insn);
1518 if (inner_length != insn_lengths[inner_uid])
1520 insn_lengths[inner_uid] = inner_length;
1521 something_changed = 1;
1523 insn_current_address += insn_lengths[inner_uid];
1524 new_length += inner_length;
1529 new_length = insn_current_length (insn);
1530 insn_current_address += new_length;
1533 #ifdef ADJUST_INSN_LENGTH
1534 /* If needed, do any adjustment. */
1535 tmp_length = new_length;
1536 ADJUST_INSN_LENGTH (insn, new_length);
1537 insn_current_address += (new_length - tmp_length);
1540 if (new_length != insn_lengths[uid])
1542 insn_lengths[uid] = new_length;
1543 something_changed = 1;
1546 /* For a non-optimizing compile, do only a single pass. */
1551 free (varying_length);
1553 #endif /* HAVE_ATTR_length */
1556 #ifdef HAVE_ATTR_length
1557 /* Given the body of an INSN known to be generated by an ASM statement, return
1558 the number of machine instructions likely to be generated for this insn.
1559 This is used to compute its length. */
1562 asm_insn_count (body)
1568 if (GET_CODE (body) == ASM_INPUT)
1569 template = XSTR (body, 0);
1571 template = decode_asm_operands (body, NULL_PTR, NULL_PTR,
1572 NULL_PTR, NULL_PTR);
1574 for ( ; *template; template++)
1575 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
1582 /* Output assembler code for the start of a function,
1583 and initialize some of the variables in this file
1584 for the new function. The label for the function and associated
1585 assembler pseudo-ops have already been output in `assemble_start_function'.
1587 FIRST is the first insn of the rtl for the function being compiled.
1588 FILE is the file to write assembler code to.
1589 OPTIMIZE is nonzero if we should eliminate redundant
1590 test and compare insns. */
1593 final_start_function (first, file, optimize)
1596 int optimize ATTRIBUTE_UNUSED;
1600 this_is_asm_operands = 0;
1602 #ifdef NON_SAVING_SETJMP
1603 /* A function that calls setjmp should save and restore all the
1604 call-saved registers on a system where longjmp clobbers them. */
1605 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
1609 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1610 if (!call_used_regs[i])
1611 regs_ever_live[i] = 1;
1615 /* Initial line number is supposed to be output
1616 before the function's prologue and label
1617 so that the function's address will not appear to be
1618 in the last statement of the preceding function. */
1619 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1620 last_linenum = high_block_linenum = high_function_linenum
1621 = NOTE_LINE_NUMBER (first);
1623 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1624 /* Output DWARF definition of the function. */
1625 if (dwarf2out_do_frame ())
1626 dwarf2out_begin_prologue ();
1629 /* For SDB and XCOFF, the function beginning must be marked between
1630 the function label and the prologue. We always need this, even when
1631 -g1 was used. Defer on MIPS systems so that parameter descriptions
1632 follow function entry. */
1633 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
1634 if (write_symbols == SDB_DEBUG)
1635 sdbout_begin_function (last_linenum);
1638 #ifdef XCOFF_DEBUGGING_INFO
1639 if (write_symbols == XCOFF_DEBUG)
1640 xcoffout_begin_function (file, last_linenum);
1643 /* But only output line number for other debug info types if -g2
1645 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1646 output_source_line (file, first);
1648 #ifdef LEAF_REG_REMAP
1649 if (current_function_uses_only_leaf_regs)
1650 leaf_renumber_regs (first);
1653 /* The Sun386i and perhaps other machines don't work right
1654 if the profiling code comes after the prologue. */
1655 #ifdef PROFILE_BEFORE_PROLOGUE
1657 profile_function (file);
1658 #endif /* PROFILE_BEFORE_PROLOGUE */
1660 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1661 if (dwarf2out_do_frame ())
1662 dwarf2out_frame_debug (NULL_RTX);
1665 #ifdef FUNCTION_PROLOGUE
1666 /* First output the function prologue: code to set up the stack frame. */
1667 FUNCTION_PROLOGUE (file, get_frame_size ());
1670 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1671 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
1672 next_block_index = 1;
1675 /* If the machine represents the prologue as RTL, the profiling code must
1676 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1677 #ifdef HAVE_prologue
1678 if (! HAVE_prologue)
1680 profile_after_prologue (file);
1684 /* If we are doing basic block profiling, remember a printable version
1685 of the function name. */
1686 if (profile_block_flag)
1689 = add_bb_string ((*decl_printable_name) (current_function_decl, 2), FALSE);
1694 profile_after_prologue (file)
1697 #ifdef FUNCTION_BLOCK_PROFILER
1698 if (profile_block_flag)
1700 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
1702 #endif /* FUNCTION_BLOCK_PROFILER */
1704 #ifndef PROFILE_BEFORE_PROLOGUE
1706 profile_function (file);
1707 #endif /* not PROFILE_BEFORE_PROLOGUE */
1711 profile_function (file)
1714 int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1715 #if defined(ASM_OUTPUT_REG_PUSH)
1716 #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1717 int sval = current_function_returns_struct;
1719 #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1720 int cxt = current_function_needs_context;
1722 #endif /* ASM_OUTPUT_REG_PUSH */
1725 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1726 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
1727 assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, 1);
1729 function_section (current_function_decl);
1731 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1733 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
1735 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1738 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1743 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1745 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1747 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1750 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1755 FUNCTION_PROFILER (file, profile_label_no);
1757 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1759 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1761 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1764 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1769 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1771 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1773 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1776 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1782 /* Output assembler code for the end of a function.
1783 For clarity, args are same as those of `final_start_function'
1784 even though not all of them are needed. */
1787 final_end_function (first, file, optimize)
1788 rtx first ATTRIBUTE_UNUSED;
1790 int optimize ATTRIBUTE_UNUSED;
1794 fputs (ASM_APP_OFF, file);
1798 #ifdef SDB_DEBUGGING_INFO
1799 if (write_symbols == SDB_DEBUG)
1800 sdbout_end_function (high_function_linenum);
1803 #ifdef DWARF_DEBUGGING_INFO
1804 if (write_symbols == DWARF_DEBUG)
1805 dwarfout_end_function ();
1808 #ifdef XCOFF_DEBUGGING_INFO
1809 if (write_symbols == XCOFF_DEBUG)
1810 xcoffout_end_function (file, high_function_linenum);
1813 #ifdef FUNCTION_EPILOGUE
1814 /* Finally, output the function epilogue:
1815 code to restore the stack frame and return to the caller. */
1816 FUNCTION_EPILOGUE (file, get_frame_size ());
1819 #ifdef SDB_DEBUGGING_INFO
1820 if (write_symbols == SDB_DEBUG)
1821 sdbout_end_epilogue ();
1824 #ifdef DWARF_DEBUGGING_INFO
1825 if (write_symbols == DWARF_DEBUG)
1826 dwarfout_end_epilogue ();
1829 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1830 if (dwarf2out_do_frame ())
1831 dwarf2out_end_epilogue ();
1834 #ifdef XCOFF_DEBUGGING_INFO
1835 if (write_symbols == XCOFF_DEBUG)
1836 xcoffout_end_epilogue (file);
1839 bb_func_label_num = -1; /* not in function, nuke label # */
1841 /* If FUNCTION_EPILOGUE is not defined, then the function body
1842 itself contains return instructions wherever needed. */
1845 /* Add a block to the linked list that remembers the current line/file/function
1846 for basic block profiling. Emit the label in front of the basic block and
1847 the instructions that increment the count field. */
1853 struct bb_list *ptr = (struct bb_list *) permalloc (sizeof (struct bb_list));
1855 /* Add basic block to linked list. */
1857 ptr->line_num = last_linenum;
1858 ptr->file_label_num = bb_file_label_num;
1859 ptr->func_label_num = bb_func_label_num;
1861 bb_tail = &ptr->next;
1863 /* Enable the table of basic-block use counts
1864 to point at the code it applies to. */
1865 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1867 /* Before first insn of this basic block, increment the
1868 count of times it was entered. */
1869 #ifdef BLOCK_PROFILER
1870 BLOCK_PROFILER (file, count_basic_blocks);
1877 count_basic_blocks++;
1880 /* Add a string to be used for basic block profiling. */
1883 add_bb_string (string, perm_p)
1888 struct bb_str *ptr = 0;
1892 string = "<unknown>";
1896 /* Allocate a new string if the current string isn't permanent. If
1897 the string is permanent search for the same string in other
1900 len = strlen (string) + 1;
1903 char *p = (char *) permalloc (len);
1904 bcopy (string, p, len);
1908 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1909 if (ptr->string == string)
1912 /* Allocate a new string block if we need to. */
1915 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1918 ptr->label_num = sbb_label_num++;
1919 ptr->string = string;
1921 sbb_tail = &ptr->next;
1924 return ptr->label_num;
1928 /* Output assembler code for some insns: all or part of a function.
1929 For description of args, see `final_start_function', above.
1931 PRESCAN is 1 if we are not really outputting,
1932 just scanning as if we were outputting.
1933 Prescanning deletes and rearranges insns just like ordinary output.
1934 PRESCAN is -2 if we are outputting after having prescanned.
1935 In this case, don't try to delete or rearrange insns
1936 because that has already been done.
1937 Prescanning is done only on certain machines. */
1940 final (first, file, optimize, prescan)
1950 last_ignored_compare = 0;
1953 check_exception_handler_labels ();
1955 /* Make a map indicating which line numbers appear in this function.
1956 When producing SDB debugging info, delete troublesome line number
1957 notes from inlined functions in other files as well as duplicate
1958 line number notes. */
1959 #ifdef SDB_DEBUGGING_INFO
1960 if (write_symbols == SDB_DEBUG)
1963 for (insn = first; insn; insn = NEXT_INSN (insn))
1964 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1966 if ((RTX_INTEGRATED_P (insn)
1967 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1969 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1970 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1972 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1973 NOTE_SOURCE_FILE (insn) = 0;
1977 if (NOTE_LINE_NUMBER (insn) > max_line)
1978 max_line = NOTE_LINE_NUMBER (insn);
1984 for (insn = first; insn; insn = NEXT_INSN (insn))
1985 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1986 max_line = NOTE_LINE_NUMBER (insn);
1989 line_note_exists = (char *) oballoc (max_line + 1);
1990 bzero (line_note_exists, max_line + 1);
1992 for (insn = first; insn; insn = NEXT_INSN (insn))
1994 if (INSN_UID (insn) > max_uid) /* find largest UID */
1995 max_uid = INSN_UID (insn);
1996 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1997 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
1999 /* If CC tracking across branches is enabled, record the insn which
2000 jumps to each branch only reached from one place. */
2001 if (optimize && GET_CODE (insn) == JUMP_INSN)
2003 rtx lab = JUMP_LABEL (insn);
2004 if (lab && LABEL_NUSES (lab) == 1)
2006 LABEL_REFS (lab) = insn;
2012 /* Initialize insn_eh_region table if eh is being used. */
2014 init_insn_eh_region (first, max_uid);
2020 /* Output the insns. */
2021 for (insn = NEXT_INSN (first); insn;)
2023 #ifdef HAVE_ATTR_length
2024 insn_current_address = insn_addresses[INSN_UID (insn)];
2026 insn = final_scan_insn (insn, file, optimize, prescan, 0);
2029 /* Do basic-block profiling here
2030 if the last insn was a conditional branch. */
2031 if (profile_block_flag && new_block)
2034 free_insn_eh_region ();
2038 get_insn_template (code, insn)
2042 const void *output = insn_data[code].output;
2043 switch (insn_data[code].output_format)
2045 case INSN_OUTPUT_FORMAT_SINGLE:
2046 return (const char *) output;
2047 case INSN_OUTPUT_FORMAT_MULTI:
2048 return ((const char * const *) output)[which_alternative];
2049 case INSN_OUTPUT_FORMAT_FUNCTION:
2052 return (* (insn_output_fn) output) (recog_data.operand, insn);
2058 /* The final scan for one insn, INSN.
2059 Args are same as in `final', except that INSN
2060 is the insn being scanned.
2061 Value returned is the next insn to be scanned.
2063 NOPEEPHOLES is the flag to disallow peephole processing (currently
2064 used for within delayed branch sequence output). */
2067 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
2080 /* Ignore deleted insns. These can occur when we split insns (due to a
2081 template of "#") while not optimizing. */
2082 if (INSN_DELETED_P (insn))
2083 return NEXT_INSN (insn);
2085 switch (GET_CODE (insn))
2091 /* Align the beginning of a loop, for higher speed
2092 on certain machines. */
2094 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
2095 break; /* This used to depend on optimize, but that was bogus. */
2096 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END)
2099 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG
2100 && ! exceptions_via_longjmp)
2102 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHB", NOTE_BLOCK_NUMBER (insn));
2103 if (! flag_new_exceptions)
2104 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn));
2105 #ifdef ASM_OUTPUT_EH_REGION_BEG
2106 ASM_OUTPUT_EH_REGION_BEG (file, NOTE_BLOCK_NUMBER (insn));
2111 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END
2112 && ! exceptions_via_longjmp)
2114 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHE", NOTE_BLOCK_NUMBER (insn));
2115 if (flag_new_exceptions)
2116 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn));
2117 #ifdef ASM_OUTPUT_EH_REGION_END
2118 ASM_OUTPUT_EH_REGION_END (file, NOTE_BLOCK_NUMBER (insn));
2123 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
2125 #ifdef FUNCTION_END_PROLOGUE
2126 FUNCTION_END_PROLOGUE (file);
2128 profile_after_prologue (file);
2132 #ifdef FUNCTION_BEGIN_EPILOGUE
2133 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
2135 FUNCTION_BEGIN_EPILOGUE (file);
2140 if (write_symbols == NO_DEBUG)
2142 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
2144 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
2145 /* MIPS stabs require the parameter descriptions to be after the
2146 function entry point rather than before. */
2147 if (write_symbols == SDB_DEBUG)
2148 sdbout_begin_function (last_linenum);
2151 #ifdef DWARF_DEBUGGING_INFO
2152 /* This outputs a marker where the function body starts, so it
2153 must be after the prologue. */
2154 if (write_symbols == DWARF_DEBUG)
2155 dwarfout_begin_function ();
2159 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED)
2160 break; /* An insn that was "deleted" */
2163 fputs (ASM_APP_OFF, file);
2166 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG
2167 && (debug_info_level == DINFO_LEVEL_NORMAL
2168 || debug_info_level == DINFO_LEVEL_VERBOSE
2169 || write_symbols == DWARF_DEBUG
2170 || write_symbols == DWARF2_DEBUG))
2172 /* Beginning of a symbol-block. Assign it a sequence number
2173 and push the number onto the stack PENDING_BLOCKS. */
2175 if (block_depth == max_block_depth)
2177 /* PENDING_BLOCKS is full; make it longer. */
2178 max_block_depth *= 2;
2180 = (int *) xrealloc (pending_blocks,
2181 max_block_depth * sizeof (int));
2183 pending_blocks[block_depth++] = next_block_index;
2185 high_block_linenum = last_linenum;
2187 /* Output debugging info about the symbol-block beginning. */
2189 #ifdef SDB_DEBUGGING_INFO
2190 if (write_symbols == SDB_DEBUG)
2191 sdbout_begin_block (file, last_linenum, next_block_index);
2193 #ifdef XCOFF_DEBUGGING_INFO
2194 if (write_symbols == XCOFF_DEBUG)
2195 xcoffout_begin_block (file, last_linenum, next_block_index);
2197 #ifdef DBX_DEBUGGING_INFO
2198 if (write_symbols == DBX_DEBUG)
2199 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", next_block_index);
2201 #ifdef DWARF_DEBUGGING_INFO
2202 if (write_symbols == DWARF_DEBUG)
2203 dwarfout_begin_block (next_block_index);
2205 #ifdef DWARF2_DEBUGGING_INFO
2206 if (write_symbols == DWARF2_DEBUG)
2207 dwarf2out_begin_block (next_block_index);
2212 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END
2213 && (debug_info_level == DINFO_LEVEL_NORMAL
2214 || debug_info_level == DINFO_LEVEL_VERBOSE
2215 || write_symbols == DWARF_DEBUG
2216 || write_symbols == DWARF2_DEBUG))
2218 /* End of a symbol-block. Pop its sequence number off
2219 PENDING_BLOCKS and output debugging info based on that. */
2222 if (block_depth < 0)
2225 #ifdef XCOFF_DEBUGGING_INFO
2226 if (write_symbols == XCOFF_DEBUG)
2227 xcoffout_end_block (file, high_block_linenum,
2228 pending_blocks[block_depth]);
2230 #ifdef DBX_DEBUGGING_INFO
2231 if (write_symbols == DBX_DEBUG)
2232 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE",
2233 pending_blocks[block_depth]);
2235 #ifdef SDB_DEBUGGING_INFO
2236 if (write_symbols == SDB_DEBUG)
2237 sdbout_end_block (file, high_block_linenum,
2238 pending_blocks[block_depth]);
2240 #ifdef DWARF_DEBUGGING_INFO
2241 if (write_symbols == DWARF_DEBUG)
2242 dwarfout_end_block (pending_blocks[block_depth]);
2244 #ifdef DWARF2_DEBUGGING_INFO
2245 if (write_symbols == DWARF2_DEBUG)
2246 dwarf2out_end_block (pending_blocks[block_depth]);
2249 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL
2250 && (debug_info_level == DINFO_LEVEL_NORMAL
2251 || debug_info_level == DINFO_LEVEL_VERBOSE))
2253 #ifdef DWARF_DEBUGGING_INFO
2254 if (write_symbols == DWARF_DEBUG)
2255 dwarfout_label (insn);
2257 #ifdef DWARF2_DEBUGGING_INFO
2258 if (write_symbols == DWARF2_DEBUG)
2259 dwarf2out_label (insn);
2262 else if (NOTE_LINE_NUMBER (insn) > 0)
2263 /* This note is a line-number. */
2267 #if 0 /* This is what we used to do. */
2268 output_source_line (file, insn);
2272 /* If there is anything real after this note,
2273 output it. If another line note follows, omit this one. */
2274 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
2276 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
2278 /* These types of notes can be significant
2279 so make sure the preceding line number stays. */
2280 else if (GET_CODE (note) == NOTE
2281 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
2282 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
2283 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
2285 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
2287 /* Another line note follows; we can delete this note
2288 if no intervening line numbers have notes elsewhere. */
2290 for (num = NOTE_LINE_NUMBER (insn) + 1;
2291 num < NOTE_LINE_NUMBER (note);
2293 if (line_note_exists[num])
2296 if (num >= NOTE_LINE_NUMBER (note))
2302 /* Output this line note
2303 if it is the first or the last line note in a row. */
2305 output_source_line (file, insn);
2310 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2311 /* If we push arguments, we need to check all insns for stack
2313 if (dwarf2out_do_frame ())
2314 dwarf2out_frame_debug (insn);
2319 /* The target port might emit labels in the output function for
2320 some insn, e.g. sh.c output_branchy_insn. */
2321 if (CODE_LABEL_NUMBER (insn) <= max_labelno)
2323 int align = LABEL_TO_ALIGNMENT (insn);
2324 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2325 int max_skip = LABEL_TO_MAX_SKIP (insn);
2328 if (align && NEXT_INSN (insn))
2329 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2330 ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip);
2332 ASM_OUTPUT_ALIGN (file, align);
2337 /* If this label is reached from only one place, set the condition
2338 codes from the instruction just before the branch. */
2340 /* Disabled because some insns set cc_status in the C output code
2341 and NOTICE_UPDATE_CC alone can set incorrect status. */
2342 if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
2344 rtx jump = LABEL_REFS (insn);
2345 rtx barrier = prev_nonnote_insn (insn);
2347 /* If the LABEL_REFS field of this label has been set to point
2348 at a branch, the predecessor of the branch is a regular
2349 insn, and that branch is the only way to reach this label,
2350 set the condition codes based on the branch and its
2352 if (barrier && GET_CODE (barrier) == BARRIER
2353 && jump && GET_CODE (jump) == JUMP_INSN
2354 && (prev = prev_nonnote_insn (jump))
2355 && GET_CODE (prev) == INSN)
2357 NOTICE_UPDATE_CC (PATTERN (prev), prev);
2358 NOTICE_UPDATE_CC (PATTERN (jump), jump);
2366 #ifdef FINAL_PRESCAN_LABEL
2367 FINAL_PRESCAN_INSN (insn, NULL_PTR, 0);
2370 #ifdef SDB_DEBUGGING_INFO
2371 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
2372 sdbout_label (insn);
2374 #ifdef DWARF_DEBUGGING_INFO
2375 if (write_symbols == DWARF_DEBUG && LABEL_NAME (insn))
2376 dwarfout_label (insn);
2378 #ifdef DWARF2_DEBUGGING_INFO
2379 if (write_symbols == DWARF2_DEBUG && LABEL_NAME (insn))
2380 dwarf2out_label (insn);
2384 fputs (ASM_APP_OFF, file);
2387 if (NEXT_INSN (insn) != 0
2388 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
2390 rtx nextbody = PATTERN (NEXT_INSN (insn));
2392 /* If this label is followed by a jump-table,
2393 make sure we put the label in the read-only section. Also
2394 possibly write the label and jump table together. */
2396 if (GET_CODE (nextbody) == ADDR_VEC
2397 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
2399 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2400 /* In this case, the case vector is being moved by the
2401 target, so don't output the label at all. Leave that
2402 to the back end macros. */
2404 if (! JUMP_TABLES_IN_TEXT_SECTION)
2406 readonly_data_section ();
2407 #ifdef READONLY_DATA_SECTION
2408 ASM_OUTPUT_ALIGN (file,
2409 exact_log2 (BIGGEST_ALIGNMENT
2411 #endif /* READONLY_DATA_SECTION */
2414 function_section (current_function_decl);
2416 #ifdef ASM_OUTPUT_CASE_LABEL
2417 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
2420 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2427 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2432 register rtx body = PATTERN (insn);
2433 int insn_code_number;
2434 const char *template;
2439 /* An INSN, JUMP_INSN or CALL_INSN.
2440 First check for special kinds that recog doesn't recognize. */
2442 if (GET_CODE (body) == USE /* These are just declarations */
2443 || GET_CODE (body) == CLOBBER)
2447 /* If there is a REG_CC_SETTER note on this insn, it means that
2448 the setting of the condition code was done in the delay slot
2449 of the insn that branched here. So recover the cc status
2450 from the insn that set it. */
2452 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
2455 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
2456 cc_prev_status = cc_status;
2460 /* Detect insns that are really jump-tables
2461 and output them as such. */
2463 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
2465 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2466 register int vlen, idx;
2474 fputs (ASM_APP_OFF, file);
2478 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2479 if (GET_CODE (body) == ADDR_VEC)
2481 #ifdef ASM_OUTPUT_ADDR_VEC
2482 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2489 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2490 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2496 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
2497 for (idx = 0; idx < vlen; idx++)
2499 if (GET_CODE (body) == ADDR_VEC)
2501 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2502 ASM_OUTPUT_ADDR_VEC_ELT
2503 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
2510 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2511 ASM_OUTPUT_ADDR_DIFF_ELT
2514 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
2515 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
2521 #ifdef ASM_OUTPUT_CASE_END
2522 ASM_OUTPUT_CASE_END (file,
2523 CODE_LABEL_NUMBER (PREV_INSN (insn)),
2528 function_section (current_function_decl);
2533 /* Do basic-block profiling when we reach a new block.
2534 Done here to avoid jump tables. */
2535 if (profile_block_flag && new_block)
2538 if (GET_CODE (body) == ASM_INPUT)
2540 /* There's no telling what that did to the condition codes. */
2546 fputs (ASM_APP_ON, file);
2549 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
2553 /* Detect `asm' construct with operands. */
2554 if (asm_noperands (body) >= 0)
2556 unsigned int noperands = asm_noperands (body);
2557 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
2560 /* There's no telling what that did to the condition codes. */
2567 fputs (ASM_APP_ON, file);
2571 /* Get out the operand values. */
2572 string = decode_asm_operands (body, ops, NULL_PTR,
2573 NULL_PTR, NULL_PTR);
2574 /* Inhibit aborts on what would otherwise be compiler bugs. */
2575 insn_noperands = noperands;
2576 this_is_asm_operands = insn;
2578 /* Output the insn using them. */
2579 output_asm_insn (string, ops);
2580 this_is_asm_operands = 0;
2584 if (prescan <= 0 && app_on)
2586 fputs (ASM_APP_OFF, file);
2590 if (GET_CODE (body) == SEQUENCE)
2592 /* A delayed-branch sequence */
2598 final_sequence = body;
2600 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2601 force the restoration of a comparison that was previously
2602 thought unnecessary. If that happens, cancel this sequence
2603 and cause that insn to be restored. */
2605 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
2606 if (next != XVECEXP (body, 0, 1))
2612 for (i = 1; i < XVECLEN (body, 0); i++)
2614 rtx insn = XVECEXP (body, 0, i);
2615 rtx next = NEXT_INSN (insn);
2616 /* We loop in case any instruction in a delay slot gets
2619 insn = final_scan_insn (insn, file, 0, prescan, 1);
2620 while (insn != next);
2622 #ifdef DBR_OUTPUT_SEQEND
2623 DBR_OUTPUT_SEQEND (file);
2627 /* If the insn requiring the delay slot was a CALL_INSN, the
2628 insns in the delay slot are actually executed before the
2629 called function. Hence we don't preserve any CC-setting
2630 actions in these insns and the CC must be marked as being
2631 clobbered by the function. */
2632 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
2637 /* Following a conditional branch sequence, we have a new basic
2639 if (profile_block_flag)
2641 rtx insn = XVECEXP (body, 0, 0);
2642 rtx body = PATTERN (insn);
2644 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2645 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2646 || (GET_CODE (insn) == JUMP_INSN
2647 && GET_CODE (body) == PARALLEL
2648 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2649 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
2655 /* We have a real machine instruction as rtl. */
2657 body = PATTERN (insn);
2660 set = single_set(insn);
2662 /* Check for redundant test and compare instructions
2663 (when the condition codes are already set up as desired).
2664 This is done only when optimizing; if not optimizing,
2665 it should be possible for the user to alter a variable
2666 with the debugger in between statements
2667 and the next statement should reexamine the variable
2668 to compute the condition codes. */
2673 rtx set = single_set(insn);
2677 && GET_CODE (SET_DEST (set)) == CC0
2678 && insn != last_ignored_compare)
2680 if (GET_CODE (SET_SRC (set)) == SUBREG)
2681 SET_SRC (set) = alter_subreg (SET_SRC (set));
2682 else if (GET_CODE (SET_SRC (set)) == COMPARE)
2684 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
2685 XEXP (SET_SRC (set), 0)
2686 = alter_subreg (XEXP (SET_SRC (set), 0));
2687 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
2688 XEXP (SET_SRC (set), 1)
2689 = alter_subreg (XEXP (SET_SRC (set), 1));
2691 if ((cc_status.value1 != 0
2692 && rtx_equal_p (SET_SRC (set), cc_status.value1))
2693 || (cc_status.value2 != 0
2694 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
2696 /* Don't delete insn if it has an addressing side-effect. */
2697 if (! FIND_REG_INC_NOTE (insn, 0)
2698 /* or if anything in it is volatile. */
2699 && ! volatile_refs_p (PATTERN (insn)))
2701 /* We don't really delete the insn; just ignore it. */
2702 last_ignored_compare = insn;
2710 /* Following a conditional branch, we have a new basic block.
2711 But if we are inside a sequence, the new block starts after the
2712 last insn of the sequence. */
2713 if (profile_block_flag && final_sequence == 0
2714 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2715 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2716 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
2717 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2718 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
2722 /* Don't bother outputting obvious no-ops, even without -O.
2723 This optimization is fast and doesn't interfere with debugging.
2724 Don't do this if the insn is in a delay slot, since this
2725 will cause an improper number of delay insns to be written. */
2726 if (final_sequence == 0
2728 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
2729 && GET_CODE (SET_SRC (body)) == REG
2730 && GET_CODE (SET_DEST (body)) == REG
2731 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
2736 /* If this is a conditional branch, maybe modify it
2737 if the cc's are in a nonstandard state
2738 so that it accomplishes the same thing that it would
2739 do straightforwardly if the cc's were set up normally. */
2741 if (cc_status.flags != 0
2742 && GET_CODE (insn) == JUMP_INSN
2743 && GET_CODE (body) == SET
2744 && SET_DEST (body) == pc_rtx
2745 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
2746 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
2747 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
2748 /* This is done during prescan; it is not done again
2749 in final scan when prescan has been done. */
2752 /* This function may alter the contents of its argument
2753 and clear some of the cc_status.flags bits.
2754 It may also return 1 meaning condition now always true
2755 or -1 meaning condition now always false
2756 or 2 meaning condition nontrivial but altered. */
2757 register int result = alter_cond (XEXP (SET_SRC (body), 0));
2758 /* If condition now has fixed value, replace the IF_THEN_ELSE
2759 with its then-operand or its else-operand. */
2761 SET_SRC (body) = XEXP (SET_SRC (body), 1);
2763 SET_SRC (body) = XEXP (SET_SRC (body), 2);
2765 /* The jump is now either unconditional or a no-op.
2766 If it has become a no-op, don't try to output it.
2767 (It would not be recognized.) */
2768 if (SET_SRC (body) == pc_rtx)
2770 PUT_CODE (insn, NOTE);
2771 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2772 NOTE_SOURCE_FILE (insn) = 0;
2775 else if (GET_CODE (SET_SRC (body)) == RETURN)
2776 /* Replace (set (pc) (return)) with (return). */
2777 PATTERN (insn) = body = SET_SRC (body);
2779 /* Rerecognize the instruction if it has changed. */
2781 INSN_CODE (insn) = -1;
2784 /* Make same adjustments to instructions that examine the
2785 condition codes without jumping and instructions that
2786 handle conditional moves (if this machine has either one). */
2788 if (cc_status.flags != 0
2791 rtx cond_rtx, then_rtx, else_rtx;
2793 if (GET_CODE (insn) != JUMP_INSN
2794 && GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
2796 cond_rtx = XEXP (SET_SRC (set), 0);
2797 then_rtx = XEXP (SET_SRC (set), 1);
2798 else_rtx = XEXP (SET_SRC (set), 2);
2802 cond_rtx = SET_SRC (set);
2803 then_rtx = const_true_rtx;
2804 else_rtx = const0_rtx;
2807 switch (GET_CODE (cond_rtx))
2820 register int result;
2821 if (XEXP (cond_rtx, 0) != cc0_rtx)
2823 result = alter_cond (cond_rtx);
2825 validate_change (insn, &SET_SRC (set), then_rtx, 0);
2826 else if (result == -1)
2827 validate_change (insn, &SET_SRC (set), else_rtx, 0);
2828 else if (result == 2)
2829 INSN_CODE (insn) = -1;
2830 if (SET_DEST (set) == SET_SRC (set))
2832 PUT_CODE (insn, NOTE);
2833 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2834 NOTE_SOURCE_FILE (insn) = 0;
2846 #ifdef HAVE_peephole
2847 /* Do machine-specific peephole optimizations if desired. */
2849 if (optimize && !flag_no_peephole && !nopeepholes)
2851 rtx next = peephole (insn);
2852 /* When peepholing, if there were notes within the peephole,
2853 emit them before the peephole. */
2854 if (next != 0 && next != NEXT_INSN (insn))
2856 rtx prev = PREV_INSN (insn);
2859 for (note = NEXT_INSN (insn); note != next;
2860 note = NEXT_INSN (note))
2861 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2863 /* In case this is prescan, put the notes
2864 in proper position for later rescan. */
2865 note = NEXT_INSN (insn);
2866 PREV_INSN (note) = prev;
2867 NEXT_INSN (prev) = note;
2868 NEXT_INSN (PREV_INSN (next)) = insn;
2869 PREV_INSN (insn) = PREV_INSN (next);
2870 NEXT_INSN (insn) = next;
2871 PREV_INSN (next) = insn;
2874 /* PEEPHOLE might have changed this. */
2875 body = PATTERN (insn);
2879 /* Try to recognize the instruction.
2880 If successful, verify that the operands satisfy the
2881 constraints for the instruction. Crash if they don't,
2882 since `reload' should have changed them so that they do. */
2884 insn_code_number = recog_memoized (insn);
2885 extract_insn (insn);
2886 cleanup_subreg_operands (insn);
2888 #ifdef REGISTER_CONSTRAINTS
2889 if (! constrain_operands (1))
2890 fatal_insn_not_found (insn);
2893 /* Some target machines need to prescan each insn before
2896 #ifdef FINAL_PRESCAN_INSN
2897 FINAL_PRESCAN_INSN (insn, recog_data.operand, recog_data.n_operands);
2901 cc_prev_status = cc_status;
2903 /* Update `cc_status' for this instruction.
2904 The instruction's output routine may change it further.
2905 If the output routine for a jump insn needs to depend
2906 on the cc status, it should look at cc_prev_status. */
2908 NOTICE_UPDATE_CC (body, insn);
2913 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2914 /* If we push arguments, we want to know where the calls are. */
2915 if (GET_CODE (insn) == CALL_INSN && dwarf2out_do_frame ())
2916 dwarf2out_frame_debug (insn);
2919 /* Find the proper template for this insn. */
2920 template = get_insn_template (insn_code_number, insn);
2922 /* If the C code returns 0, it means that it is a jump insn
2923 which follows a deleted test insn, and that test insn
2924 needs to be reinserted. */
2927 if (prev_nonnote_insn (insn) != last_ignored_compare)
2930 return prev_nonnote_insn (insn);
2933 /* If the template is the string "#", it means that this insn must
2935 if (template[0] == '#' && template[1] == '\0')
2937 rtx new = try_split (body, insn, 0);
2939 /* If we didn't split the insn, go away. */
2940 if (new == insn && PATTERN (new) == body)
2941 fatal_insn ("Could not split insn", insn);
2943 #ifdef HAVE_ATTR_length
2944 /* This instruction should have been split in shorten_branches,
2945 to ensure that we would have valid length info for the
2957 /* Output assembler code from the template. */
2959 output_asm_insn (template, recog_data.operand);
2961 #if defined (DWARF2_UNWIND_INFO)
2962 #if !defined (ACCUMULATE_OUTGOING_ARGS)
2963 /* If we push arguments, we need to check all insns for stack
2965 if (GET_CODE (insn) == INSN && dwarf2out_do_frame ())
2966 dwarf2out_frame_debug (insn);
2968 #if defined (HAVE_prologue)
2969 /* If this insn is part of the prologue, emit DWARF v2
2971 if (RTX_FRAME_RELATED_P (insn) && dwarf2out_do_frame ())
2972 dwarf2out_frame_debug (insn);
2978 /* It's not at all clear why we did this and doing so interferes
2979 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2982 /* Mark this insn as having been output. */
2983 INSN_DELETED_P (insn) = 1;
2989 return NEXT_INSN (insn);
2992 /* Output debugging info to the assembler file FILE
2993 based on the NOTE-insn INSN, assumed to be a line number. */
2996 output_source_line (file, insn)
2997 FILE *file ATTRIBUTE_UNUSED;
3000 register char *filename = NOTE_SOURCE_FILE (insn);
3002 /* Remember filename for basic block profiling.
3003 Filenames are allocated on the permanent obstack
3004 or are passed in ARGV, so we don't have to save
3007 if (profile_block_flag && last_filename != filename)
3008 bb_file_label_num = add_bb_string (filename, TRUE);
3010 last_filename = filename;
3011 last_linenum = NOTE_LINE_NUMBER (insn);
3012 high_block_linenum = MAX (last_linenum, high_block_linenum);
3013 high_function_linenum = MAX (last_linenum, high_function_linenum);
3015 if (write_symbols != NO_DEBUG)
3017 #ifdef SDB_DEBUGGING_INFO
3018 if (write_symbols == SDB_DEBUG
3019 #if 0 /* People like having line numbers even in wrong file! */
3020 /* COFF can't handle multiple source files--lose, lose. */
3021 && !strcmp (filename, main_input_filename)
3023 /* COFF relative line numbers must be positive. */
3024 && last_linenum > sdb_begin_function_line)
3026 #ifdef ASM_OUTPUT_SOURCE_LINE
3027 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
3029 fprintf (file, "\t.ln\t%d\n",
3030 ((sdb_begin_function_line > -1)
3031 ? last_linenum - sdb_begin_function_line : 1));
3036 #if defined (DBX_DEBUGGING_INFO)
3037 if (write_symbols == DBX_DEBUG)
3038 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
3041 #if defined (XCOFF_DEBUGGING_INFO)
3042 if (write_symbols == XCOFF_DEBUG)
3043 xcoffout_source_line (file, filename, insn);
3046 #ifdef DWARF_DEBUGGING_INFO
3047 if (write_symbols == DWARF_DEBUG)
3048 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
3051 #ifdef DWARF2_DEBUGGING_INFO
3052 if (write_symbols == DWARF2_DEBUG)
3053 dwarf2out_line (filename, NOTE_LINE_NUMBER (insn));
3059 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3060 directly to the desired hard register. */
3062 cleanup_subreg_operands (insn)
3067 extract_insn (insn);
3068 for (i = 0; i < recog_data.n_operands; i++)
3070 if (GET_CODE (recog_data.operand[i]) == SUBREG)
3071 recog_data.operand[i] = alter_subreg (recog_data.operand[i]);
3072 else if (GET_CODE (recog_data.operand[i]) == PLUS
3073 || GET_CODE (recog_data.operand[i]) == MULT)
3074 recog_data.operand[i] = walk_alter_subreg (recog_data.operand[i]);
3077 for (i = 0; i < recog_data.n_dups; i++)
3079 if (GET_CODE (*recog_data.dup_loc[i]) == SUBREG)
3080 *recog_data.dup_loc[i] = alter_subreg (*recog_data.dup_loc[i]);
3081 else if (GET_CODE (*recog_data.dup_loc[i]) == PLUS
3082 || GET_CODE (*recog_data.dup_loc[i]) == MULT)
3083 *recog_data.dup_loc[i] = walk_alter_subreg (*recog_data.dup_loc[i]);
3087 /* If X is a SUBREG, replace it with a REG or a MEM,
3088 based on the thing it is a subreg of. */
3094 register rtx y = SUBREG_REG (x);
3096 if (GET_CODE (y) == SUBREG)
3097 y = alter_subreg (y);
3099 /* If reload is operating, we may be replacing inside this SUBREG.
3100 Check for that and make a new one if so. */
3101 if (reload_in_progress && find_replacement (&SUBREG_REG (x)) != 0)
3104 if (GET_CODE (y) == REG)
3107 /* If the word size is larger than the size of this register,
3108 adjust the register number to compensate. */
3109 /* ??? Note that this just catches stragglers created by/for
3110 integrate. It would be better if we either caught these
3111 earlier, or kept _all_ subregs until now and eliminate
3112 gen_lowpart and friends. */
3114 #ifdef ALTER_HARD_SUBREG
3115 regno = ALTER_HARD_SUBREG(GET_MODE (x), SUBREG_WORD (x),
3116 GET_MODE (y), REGNO (y));
3118 regno = REGNO (y) + SUBREG_WORD (x);
3122 /* This field has a different meaning for REGs and SUBREGs. Make sure
3126 else if (GET_CODE (y) == MEM)
3128 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
3129 if (BYTES_BIG_ENDIAN)
3130 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
3131 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
3133 MEM_COPY_ATTRIBUTES (x, y);
3134 MEM_ALIAS_SET (x) = MEM_ALIAS_SET (y);
3135 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
3141 /* Do alter_subreg on all the SUBREGs contained in X. */
3144 walk_alter_subreg (x)
3147 switch (GET_CODE (x))
3151 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3152 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
3156 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3160 return alter_subreg (x);
3171 /* Given BODY, the body of a jump instruction, alter the jump condition
3172 as required by the bits that are set in cc_status.flags.
3173 Not all of the bits there can be handled at this level in all cases.
3175 The value is normally 0.
3176 1 means that the condition has become always true.
3177 -1 means that the condition has become always false.
3178 2 means that COND has been altered. */
3186 if (cc_status.flags & CC_REVERSED)
3189 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
3192 if (cc_status.flags & CC_INVERTED)
3195 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
3198 if (cc_status.flags & CC_NOT_POSITIVE)
3199 switch (GET_CODE (cond))
3204 /* Jump becomes unconditional. */
3210 /* Jump becomes no-op. */
3214 PUT_CODE (cond, EQ);
3219 PUT_CODE (cond, NE);
3227 if (cc_status.flags & CC_NOT_NEGATIVE)
3228 switch (GET_CODE (cond))
3232 /* Jump becomes unconditional. */
3237 /* Jump becomes no-op. */
3242 PUT_CODE (cond, EQ);
3248 PUT_CODE (cond, NE);
3256 if (cc_status.flags & CC_NO_OVERFLOW)
3257 switch (GET_CODE (cond))
3260 /* Jump becomes unconditional. */
3264 PUT_CODE (cond, EQ);
3269 PUT_CODE (cond, NE);
3274 /* Jump becomes no-op. */
3281 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
3282 switch (GET_CODE (cond))
3288 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
3293 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
3298 if (cc_status.flags & CC_NOT_SIGNED)
3299 /* The flags are valid if signed condition operators are converted
3301 switch (GET_CODE (cond))
3304 PUT_CODE (cond, LEU);
3309 PUT_CODE (cond, LTU);
3314 PUT_CODE (cond, GTU);
3319 PUT_CODE (cond, GEU);
3331 /* Report inconsistency between the assembler template and the operands.
3332 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3335 output_operand_lossage (msgid)
3338 if (this_is_asm_operands)
3339 error_for_asm (this_is_asm_operands, "invalid `asm': %s", _(msgid));
3342 error ("output_operand: %s", _(msgid));
3347 /* Output of assembler code from a template, and its subroutines. */
3349 /* Output text from TEMPLATE to the assembler output file,
3350 obeying %-directions to substitute operands taken from
3351 the vector OPERANDS.
3353 %N (for N a digit) means print operand N in usual manner.
3354 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3355 and print the label name with no punctuation.
3356 %cN means require operand N to be a constant
3357 and print the constant expression with no punctuation.
3358 %aN means expect operand N to be a memory address
3359 (not a memory reference!) and print a reference
3361 %nN means expect operand N to be a constant
3362 and print a constant expression for minus the value
3363 of the operand, with no other punctuation. */
3368 if (flag_print_asm_name)
3370 /* Annotate the assembly with a comment describing the pattern and
3371 alternative used. */
3374 register int num = INSN_CODE (debug_insn);
3375 fprintf (asm_out_file, "\t%s %d\t%s",
3376 ASM_COMMENT_START, INSN_UID (debug_insn),
3377 insn_data[num].name);
3378 if (insn_data[num].n_alternatives > 1)
3379 fprintf (asm_out_file, "/%d", which_alternative + 1);
3380 #ifdef HAVE_ATTR_length
3381 fprintf (asm_out_file, "\t[length = %d]",
3382 get_attr_length (debug_insn));
3384 /* Clear this so only the first assembler insn
3385 of any rtl insn will get the special comment for -dp. */
3392 output_asm_insn (template, operands)
3393 const char *template;
3396 register const char *p;
3399 /* An insn may return a null string template
3400 in a case where no assembler code is needed. */
3405 putc ('\t', asm_out_file);
3407 #ifdef ASM_OUTPUT_OPCODE
3408 ASM_OUTPUT_OPCODE (asm_out_file, p);
3416 putc (c, asm_out_file);
3417 #ifdef ASM_OUTPUT_OPCODE
3418 while ((c = *p) == '\t')
3420 putc (c, asm_out_file);
3423 ASM_OUTPUT_OPCODE (asm_out_file, p);
3427 #ifdef ASSEMBLER_DIALECT
3432 /* If we want the first dialect, do nothing. Otherwise, skip
3433 DIALECT_NUMBER of strings ending with '|'. */
3434 for (i = 0; i < dialect_number; i++)
3436 while (*p && *p != '}' && *p++ != '|')
3447 /* Skip to close brace. */
3448 while (*p && *p++ != '}')
3457 /* %% outputs a single %. */
3461 putc (c, asm_out_file);
3463 /* %= outputs a number which is unique to each insn in the entire
3464 compilation. This is useful for making local labels that are
3465 referred to more than once in a given insn. */
3469 fprintf (asm_out_file, "%d", insn_counter);
3471 /* % followed by a letter and some digits
3472 outputs an operand in a special way depending on the letter.
3473 Letters `acln' are implemented directly.
3474 Other letters are passed to `output_operand' so that
3475 the PRINT_OPERAND macro can define them. */
3476 else if ((*p >= 'a' && *p <= 'z')
3477 || (*p >= 'A' && *p <= 'Z'))
3482 if (! (*p >= '0' && *p <= '9'))
3483 output_operand_lossage ("operand number missing after %-letter");
3484 else if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3485 output_operand_lossage ("operand number out of range");
3486 else if (letter == 'l')
3487 output_asm_label (operands[c]);
3488 else if (letter == 'a')
3489 output_address (operands[c]);
3490 else if (letter == 'c')
3492 if (CONSTANT_ADDRESS_P (operands[c]))
3493 output_addr_const (asm_out_file, operands[c]);
3495 output_operand (operands[c], 'c');
3497 else if (letter == 'n')
3499 if (GET_CODE (operands[c]) == CONST_INT)
3500 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
3501 - INTVAL (operands[c]));
3504 putc ('-', asm_out_file);
3505 output_addr_const (asm_out_file, operands[c]);
3509 output_operand (operands[c], letter);
3511 while ((c = *p) >= '0' && c <= '9') p++;
3513 /* % followed by a digit outputs an operand the default way. */
3514 else if (*p >= '0' && *p <= '9')
3517 if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3518 output_operand_lossage ("operand number out of range");
3520 output_operand (operands[c], 0);
3521 while ((c = *p) >= '0' && c <= '9') p++;
3523 /* % followed by punctuation: output something for that
3524 punctuation character alone, with no operand.
3525 The PRINT_OPERAND macro decides what is actually done. */
3526 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3527 else if (PRINT_OPERAND_PUNCT_VALID_P ((unsigned char)*p))
3528 output_operand (NULL_RTX, *p++);
3531 output_operand_lossage ("invalid %%-code");
3535 putc (c, asm_out_file);
3540 putc ('\n', asm_out_file);
3543 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3546 output_asm_label (x)
3551 if (GET_CODE (x) == LABEL_REF)
3552 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3553 else if (GET_CODE (x) == CODE_LABEL)
3554 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3556 output_operand_lossage ("`%l' operand isn't a label");
3558 assemble_name (asm_out_file, buf);
3561 /* Print operand X using machine-dependent assembler syntax.
3562 The macro PRINT_OPERAND is defined just to control this function.
3563 CODE is a non-digit that preceded the operand-number in the % spec,
3564 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3565 between the % and the digits.
3566 When CODE is a non-letter, X is 0.
3568 The meanings of the letters are machine-dependent and controlled
3569 by PRINT_OPERAND. */
3572 output_operand (x, code)
3576 if (x && GET_CODE (x) == SUBREG)
3577 x = alter_subreg (x);
3579 /* If X is a pseudo-register, abort now rather than writing trash to the
3582 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
3585 PRINT_OPERAND (asm_out_file, x, code);
3588 /* Print a memory reference operand for address X
3589 using machine-dependent assembler syntax.
3590 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3596 walk_alter_subreg (x);
3597 PRINT_OPERAND_ADDRESS (asm_out_file, x);
3600 /* Print an integer constant expression in assembler syntax.
3601 Addition and subtraction are the only arithmetic
3602 that may appear in these expressions. */
3605 output_addr_const (file, x)
3612 switch (GET_CODE (x))
3622 assemble_name (file, XSTR (x, 0));
3626 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3627 assemble_name (file, buf);
3631 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3632 assemble_name (file, buf);
3636 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
3640 /* This used to output parentheses around the expression,
3641 but that does not work on the 386 (either ATT or BSD assembler). */
3642 output_addr_const (file, XEXP (x, 0));
3646 if (GET_MODE (x) == VOIDmode)
3648 /* We can use %d if the number is one word and positive. */
3649 if (CONST_DOUBLE_HIGH (x))
3650 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3651 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
3652 else if (CONST_DOUBLE_LOW (x) < 0)
3653 fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
3655 fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
3658 /* We can't handle floating point constants;
3659 PRINT_OPERAND must handle them. */
3660 output_operand_lossage ("floating constant misused");
3664 /* Some assemblers need integer constants to appear last (eg masm). */
3665 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
3667 output_addr_const (file, XEXP (x, 1));
3668 if (INTVAL (XEXP (x, 0)) >= 0)
3669 fprintf (file, "+");
3670 output_addr_const (file, XEXP (x, 0));
3674 output_addr_const (file, XEXP (x, 0));
3675 if (INTVAL (XEXP (x, 1)) >= 0)
3676 fprintf (file, "+");
3677 output_addr_const (file, XEXP (x, 1));
3682 /* Avoid outputting things like x-x or x+5-x,
3683 since some assemblers can't handle that. */
3684 x = simplify_subtraction (x);
3685 if (GET_CODE (x) != MINUS)
3688 output_addr_const (file, XEXP (x, 0));
3689 fprintf (file, "-");
3690 if (GET_CODE (XEXP (x, 1)) == CONST_INT
3691 && INTVAL (XEXP (x, 1)) < 0)
3693 fprintf (file, "%s", ASM_OPEN_PAREN);
3694 output_addr_const (file, XEXP (x, 1));
3695 fprintf (file, "%s", ASM_CLOSE_PAREN);
3698 output_addr_const (file, XEXP (x, 1));
3703 output_addr_const (file, XEXP (x, 0));
3707 output_operand_lossage ("invalid expression as operand");
3711 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3712 %R prints the value of REGISTER_PREFIX.
3713 %L prints the value of LOCAL_LABEL_PREFIX.
3714 %U prints the value of USER_LABEL_PREFIX.
3715 %I prints the value of IMMEDIATE_PREFIX.
3716 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3717 Also supported are %d, %x, %s, %e, %f, %g and %%.
3719 We handle alternate assembler dialects here, just like output_asm_insn. */
3722 asm_fprintf VPROTO((FILE *file, const char *p, ...))
3724 #ifndef ANSI_PROTOTYPES
3732 VA_START (argptr, p);
3734 #ifndef ANSI_PROTOTYPES
3735 file = va_arg (argptr, FILE *);
3736 p = va_arg (argptr, const char *);
3744 #ifdef ASSEMBLER_DIALECT
3749 /* If we want the first dialect, do nothing. Otherwise, skip
3750 DIALECT_NUMBER of strings ending with '|'. */
3751 for (i = 0; i < dialect_number; i++)
3753 while (*p && *p++ != '|')
3763 /* Skip to close brace. */
3764 while (*p && *p++ != '}')
3775 while ((c >= '0' && c <= '9') || c == '.')
3783 fprintf (file, "%%");
3786 case 'd': case 'i': case 'u':
3787 case 'x': case 'p': case 'X':
3791 fprintf (file, buf, va_arg (argptr, int));
3795 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3796 but we do not check for those cases. It means that the value
3797 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3799 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3801 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3811 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3818 fprintf (file, buf, va_arg (argptr, long));
3826 fprintf (file, buf, va_arg (argptr, double));
3832 fprintf (file, buf, va_arg (argptr, char *));
3836 #ifdef ASM_OUTPUT_OPCODE
3837 ASM_OUTPUT_OPCODE (asm_out_file, p);
3842 #ifdef REGISTER_PREFIX
3843 fprintf (file, "%s", REGISTER_PREFIX);
3848 #ifdef IMMEDIATE_PREFIX
3849 fprintf (file, "%s", IMMEDIATE_PREFIX);
3854 #ifdef LOCAL_LABEL_PREFIX
3855 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
3860 fputs (user_label_prefix, file);
3863 #ifdef ASM_FPRINTF_EXTENSIONS
3864 /* Upper case letters are reserved for general use by asm_fprintf
3865 and so are not available to target specific code. In order to
3866 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
3867 they are defined here. As they get turned into real extensions
3868 to asm_fprintf they should be removed from this list. */
3869 case 'A': case 'B': case 'C': case 'D': case 'E':
3870 case 'F': case 'G': case 'H': case 'J': case 'K':
3871 case 'M': case 'N': case 'P': case 'Q': case 'S':
3872 case 'T': case 'V': case 'W': case 'Y': case 'Z':
3875 ASM_FPRINTF_EXTENSIONS (file, argptr, p)
3887 /* Split up a CONST_DOUBLE or integer constant rtx
3888 into two rtx's for single words,
3889 storing in *FIRST the word that comes first in memory in the target
3890 and in *SECOND the other. */
3893 split_double (value, first, second)
3895 rtx *first, *second;
3897 if (GET_CODE (value) == CONST_INT)
3899 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3901 /* In this case the CONST_INT holds both target words.
3902 Extract the bits from it into two word-sized pieces.
3903 Sign extend each half to HOST_WIDE_INT. */
3905 /* On machines where HOST_BITS_PER_WIDE_INT == BITS_PER_WORD
3906 the shift below will cause a compiler warning, even though
3907 this code won't be executed. So put the shift amounts in
3908 variables to avoid the warning. */
3909 int rshift = HOST_BITS_PER_WIDE_INT - BITS_PER_WORD;
3910 int lshift = HOST_BITS_PER_WIDE_INT - 2 * BITS_PER_WORD;
3912 low = GEN_INT ((INTVAL (value) << rshift) >> rshift);
3913 high = GEN_INT ((INTVAL (value) << lshift) >> rshift);
3914 if (WORDS_BIG_ENDIAN)
3927 /* The rule for using CONST_INT for a wider mode
3928 is that we regard the value as signed.
3929 So sign-extend it. */
3930 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
3931 if (WORDS_BIG_ENDIAN)
3943 else if (GET_CODE (value) != CONST_DOUBLE)
3945 if (WORDS_BIG_ENDIAN)
3947 *first = const0_rtx;
3953 *second = const0_rtx;
3956 else if (GET_MODE (value) == VOIDmode
3957 /* This is the old way we did CONST_DOUBLE integers. */
3958 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
3960 /* In an integer, the words are defined as most and least significant.
3961 So order them by the target's convention. */
3962 if (WORDS_BIG_ENDIAN)
3964 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3965 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3969 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3970 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3975 #ifdef REAL_ARITHMETIC
3976 REAL_VALUE_TYPE r; long l[2];
3977 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
3979 /* Note, this converts the REAL_VALUE_TYPE to the target's
3980 format, splits up the floating point double and outputs
3981 exactly 32 bits of it into each of l[0] and l[1] --
3982 not necessarily BITS_PER_WORD bits. */
3983 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
3985 /* If 32 bits is an entire word for the target, but not for the host,
3986 then sign-extend on the host so that the number will look the same
3987 way on the host that it would on the target. See for instance
3988 simplify_unary_operation. The #if is needed to avoid compiler
3991 #if HOST_BITS_PER_LONG > 32
3992 if (BITS_PER_WORD < HOST_BITS_PER_LONG && BITS_PER_WORD == 32)
3994 if (l[0] & ((long) 1 << 31))
3995 l[0] |= ((long) (-1) << 32);
3996 if (l[1] & ((long) 1 << 31))
3997 l[1] |= ((long) (-1) << 32);
4001 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
4002 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
4004 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
4005 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
4006 && ! flag_pretend_float)
4010 #ifdef HOST_WORDS_BIG_ENDIAN
4017 /* Host and target agree => no need to swap. */
4018 *first = GEN_INT (CONST_DOUBLE_LOW (value));
4019 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
4023 *second = GEN_INT (CONST_DOUBLE_LOW (value));
4024 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
4026 #endif /* no REAL_ARITHMETIC */
4030 /* Return nonzero if this function has no function calls. */
4037 if (profile_flag || profile_block_flag || profile_arc_flag)
4040 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4042 if (GET_CODE (insn) == CALL_INSN)
4044 if (GET_CODE (insn) == INSN
4045 && GET_CODE (PATTERN (insn)) == SEQUENCE
4046 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN)
4049 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4051 if (GET_CODE (XEXP (insn, 0)) == CALL_INSN)
4053 if (GET_CODE (XEXP (insn, 0)) == INSN
4054 && GET_CODE (PATTERN (XEXP (insn, 0))) == SEQUENCE
4055 && GET_CODE (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)) == CALL_INSN)
4062 /* On some machines, a function with no call insns
4063 can run faster if it doesn't create its own register window.
4064 When output, the leaf function should use only the "output"
4065 registers. Ordinarily, the function would be compiled to use
4066 the "input" registers to find its arguments; it is a candidate
4067 for leaf treatment if it uses only the "input" registers.
4068 Leaf function treatment means renumbering so the function
4069 uses the "output" registers instead. */
4071 #ifdef LEAF_REGISTERS
4073 static char permitted_reg_in_leaf_functions[] = LEAF_REGISTERS;
4075 /* Return 1 if this function uses only the registers that can be
4076 safely renumbered. */
4079 only_leaf_regs_used ()
4083 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4084 if ((regs_ever_live[i] || global_regs[i])
4085 && ! permitted_reg_in_leaf_functions[i])
4088 if (current_function_uses_pic_offset_table
4089 && pic_offset_table_rtx != 0
4090 && GET_CODE (pic_offset_table_rtx) == REG
4091 && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4097 /* Scan all instructions and renumber all registers into those
4098 available in leaf functions. */
4101 leaf_renumber_regs (first)
4106 /* Renumber only the actual patterns.
4107 The reg-notes can contain frame pointer refs,
4108 and renumbering them could crash, and should not be needed. */
4109 for (insn = first; insn; insn = NEXT_INSN (insn))
4110 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
4111 leaf_renumber_regs_insn (PATTERN (insn));
4112 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4113 if (GET_RTX_CLASS (GET_CODE (XEXP (insn, 0))) == 'i')
4114 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
4117 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4118 available in leaf functions. */
4121 leaf_renumber_regs_insn (in_rtx)
4122 register rtx in_rtx;
4125 register const char *format_ptr;
4130 /* Renumber all input-registers into output-registers.
4131 renumbered_regs would be 1 for an output-register;
4134 if (GET_CODE (in_rtx) == REG)
4138 /* Don't renumber the same reg twice. */
4142 newreg = REGNO (in_rtx);
4143 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4144 to reach here as part of a REG_NOTE. */
4145 if (newreg >= FIRST_PSEUDO_REGISTER)
4150 newreg = LEAF_REG_REMAP (newreg);
4153 regs_ever_live[REGNO (in_rtx)] = 0;
4154 regs_ever_live[newreg] = 1;
4155 REGNO (in_rtx) = newreg;
4159 if (GET_RTX_CLASS (GET_CODE (in_rtx)) == 'i')
4161 /* Inside a SEQUENCE, we find insns.
4162 Renumber just the patterns of these insns,
4163 just as we do for the top-level insns. */
4164 leaf_renumber_regs_insn (PATTERN (in_rtx));
4168 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
4170 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
4171 switch (*format_ptr++)
4174 leaf_renumber_regs_insn (XEXP (in_rtx, i));
4178 if (NULL != XVEC (in_rtx, i))
4180 for (j = 0; j < XVECLEN (in_rtx, i); j++)
4181 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));