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. */
54 #include "insn-config.h"
55 #include "insn-flags.h"
56 #include "insn-attr.h"
57 #include "insn-codes.h"
59 #include "conditions.h"
62 #include "hard-reg-set.h"
71 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
72 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
74 #if defined (USG) || !defined (HAVE_STAB_H)
75 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
80 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
82 #ifdef XCOFF_DEBUGGING_INFO
86 #ifdef DWARF_DEBUGGING_INFO
90 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
91 #include "dwarf2out.h"
94 #ifdef SDB_DEBUGGING_INFO
98 /* .stabd code for line number. */
103 /* .stabs code for included file name. */
108 #ifndef INT_TYPE_SIZE
109 #define INT_TYPE_SIZE BITS_PER_WORD
112 #ifndef LONG_TYPE_SIZE
113 #define LONG_TYPE_SIZE BITS_PER_WORD
116 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
117 null default for it to save conditionalization later. */
118 #ifndef CC_STATUS_INIT
119 #define CC_STATUS_INIT
122 /* How to start an assembler comment. */
123 #ifndef ASM_COMMENT_START
124 #define ASM_COMMENT_START ";#"
127 /* Is the given character a logical line separator for the assembler? */
128 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
129 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
132 #ifndef JUMP_TABLES_IN_TEXT_SECTION
133 #define JUMP_TABLES_IN_TEXT_SECTION 0
136 /* Last insn processed by final_scan_insn. */
137 static rtx debug_insn = 0;
139 /* Line number of last NOTE. */
140 static int last_linenum;
142 /* Highest line number in current block. */
143 static int high_block_linenum;
145 /* Likewise for function. */
146 static int high_function_linenum;
148 /* Filename of last NOTE. */
149 static char *last_filename;
151 /* Number of basic blocks seen so far;
152 used if profile_block_flag is set. */
153 static int count_basic_blocks;
155 /* Number of instrumented arcs when profile_arc_flag is set. */
156 extern int count_instrumented_arcs;
158 extern int length_unit_log; /* This is defined in insn-attrtab.c. */
160 /* Nonzero while outputting an `asm' with operands.
161 This means that inconsistencies are the user's fault, so don't abort.
162 The precise value is the insn being output, to pass to error_for_asm. */
163 static rtx this_is_asm_operands;
165 /* Number of operands of this insn, for an `asm' with operands. */
166 static unsigned int insn_noperands;
168 /* Compare optimization flag. */
170 static rtx last_ignored_compare = 0;
172 /* Flag indicating this insn is the start of a new basic block. */
174 static int new_block = 1;
176 /* All the symbol-blocks (levels of scoping) in the compilation
177 are assigned sequence numbers in order of appearance of the
178 beginnings of the symbol-blocks. Both final and dbxout do this,
179 and assume that they will both give the same number to each block.
180 Final uses these sequence numbers to generate assembler label names
181 LBBnnn and LBEnnn for the beginning and end of the symbol-block.
182 Dbxout uses the sequence numbers to generate references to the same labels
183 from the dbx debugging information.
185 Sdb records this level at the beginning of each function,
186 in order to find the current level when recursing down declarations.
187 It outputs the block beginning and endings
188 at the point in the asm file where the blocks would begin and end. */
190 int next_block_index;
192 /* Assign a unique number to each insn that is output.
193 This can be used to generate unique local labels. */
195 static int insn_counter = 0;
198 /* This variable contains machine-dependent flags (defined in tm.h)
199 set and examined by output routines
200 that describe how to interpret the condition codes properly. */
204 /* During output of an insn, this contains a copy of cc_status
205 from before the insn. */
207 CC_STATUS cc_prev_status;
210 /* Indexed by hardware reg number, is 1 if that register is ever
211 used in the current function.
213 In life_analysis, or in stupid_life_analysis, this is set
214 up to record the hard regs used explicitly. Reload adds
215 in the hard regs used for holding pseudo regs. Final uses
216 it to generate the code in the function prologue and epilogue
217 to save and restore registers as needed. */
219 char regs_ever_live[FIRST_PSEUDO_REGISTER];
221 /* Nonzero means current function must be given a frame pointer.
222 Set in stmt.c if anything is allocated on the stack there.
223 Set in reload1.c if anything is allocated on the stack there. */
225 int frame_pointer_needed;
227 /* Assign unique numbers to labels generated for profiling. */
229 int profile_label_no;
231 /* Length so far allocated in PENDING_BLOCKS. */
233 static int max_block_depth;
235 /* Stack of sequence numbers of symbol-blocks of which we have seen the
236 beginning but not yet the end. Sequence numbers are assigned at
237 the beginning; this stack allows us to find the sequence number
238 of a block that is ending. */
240 static int *pending_blocks;
242 /* Number of elements currently in use in PENDING_BLOCKS. */
244 static int block_depth;
246 /* Nonzero if have enabled APP processing of our assembler output. */
250 /* If we are outputting an insn sequence, this contains the sequence rtx.
255 #ifdef ASSEMBLER_DIALECT
257 /* Number of the assembler dialect to use, starting at 0. */
258 static int dialect_number;
261 /* Indexed by line number, nonzero if there is a note for that line. */
263 static char *line_note_exists;
265 /* Linked list to hold line numbers for each basic block. */
268 struct bb_list *next; /* pointer to next basic block */
269 int line_num; /* line number */
270 int file_label_num; /* LPBC<n> label # for stored filename */
271 int func_label_num; /* LPBC<n> label # for stored function name */
274 static struct bb_list *bb_head = 0; /* Head of basic block list */
275 static struct bb_list **bb_tail = &bb_head; /* Ptr to store next bb ptr */
276 static int bb_file_label_num = -1; /* Current label # for file */
277 static int bb_func_label_num = -1; /* Current label # for func */
279 /* Linked list to hold the strings for each file and function name output. */
282 struct bb_str *next; /* pointer to next string */
283 const char *string; /* string */
284 int label_num; /* label number */
285 int length; /* string length */
289 extern rtx peephole PROTO((rtx));
292 static struct bb_str *sbb_head = 0; /* Head of string list. */
293 static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */
294 static int sbb_label_num = 0; /* Last label used */
296 #ifdef HAVE_ATTR_length
297 static int asm_insn_count PROTO((rtx));
299 static void profile_function PROTO((FILE *));
300 static void profile_after_prologue PROTO((FILE *));
301 static void add_bb PROTO((FILE *));
302 static int add_bb_string PROTO((const char *, int));
303 static void output_source_line PROTO((FILE *, rtx));
304 static rtx walk_alter_subreg PROTO((rtx));
305 static void output_asm_name PROTO((void));
306 static void output_operand PROTO((rtx, int));
307 #ifdef LEAF_REGISTERS
308 static void leaf_renumber_regs PROTO((rtx));
311 static int alter_cond PROTO((rtx));
314 /* Initialize data in final at the beginning of a compilation. */
317 init_final (filename)
318 const char *filename ATTRIBUTE_UNUSED;
320 next_block_index = 2;
322 max_block_depth = 20;
323 pending_blocks = (int *) xmalloc (20 * sizeof *pending_blocks);
326 #ifdef ASSEMBLER_DIALECT
327 dialect_number = ASSEMBLER_DIALECT;
331 /* Called at end of source file,
332 to output the block-profiling table for this entire compilation. */
336 const char *filename;
340 if (profile_block_flag || profile_arc_flag)
343 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
347 int long_bytes = LONG_TYPE_SIZE / BITS_PER_UNIT;
348 int pointer_bytes = POINTER_SIZE / BITS_PER_UNIT;
350 if (profile_block_flag)
351 size = long_bytes * count_basic_blocks;
353 size = long_bytes * count_instrumented_arcs;
356 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
357 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
358 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
362 /* Output the main header, of 11 words:
363 0: 1 if this file is initialized, else 0.
364 1: address of file name (LPBX1).
365 2: address of table of counts (LPBX2).
366 3: number of counts in the table.
367 4: always 0, for compatibility with Sun.
369 The following are GNU extensions:
371 5: address of table of start addrs of basic blocks (LPBX3).
372 6: Number of bytes in this header.
373 7: address of table of function names (LPBX4).
374 8: address of table of line numbers (LPBX5) or 0.
375 9: address of table of file names (LPBX6) or 0.
376 10: space reserved for basic block profiling. */
378 ASM_OUTPUT_ALIGN (asm_out_file, align);
380 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
382 assemble_integer (const0_rtx, long_bytes, 1);
384 /* address of filename */
385 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
386 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
388 /* address of count table */
389 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
390 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
392 /* count of the # of basic blocks or # of instrumented arcs */
393 if (profile_block_flag)
394 assemble_integer (GEN_INT (count_basic_blocks), long_bytes, 1);
396 assemble_integer (GEN_INT (count_instrumented_arcs), long_bytes,
399 /* zero word (link field) */
400 assemble_integer (const0_rtx, pointer_bytes, 1);
402 /* address of basic block start address table */
403 if (profile_block_flag)
405 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
406 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
410 assemble_integer (const0_rtx, pointer_bytes, 1);
412 /* byte count for extended structure. */
413 assemble_integer (GEN_INT (11 * UNITS_PER_WORD), long_bytes, 1);
415 /* address of function name table */
416 if (profile_block_flag)
418 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
419 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
423 assemble_integer (const0_rtx, pointer_bytes, 1);
425 /* address of line number and filename tables if debugging. */
426 if (write_symbols != NO_DEBUG && profile_block_flag)
428 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
429 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
431 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
432 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
437 assemble_integer (const0_rtx, pointer_bytes, 1);
438 assemble_integer (const0_rtx, pointer_bytes, 1);
441 /* space for extension ptr (link field) */
442 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
444 /* Output the file name changing the suffix to .d for Sun tcov
446 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
448 char *cwd = getpwd ();
449 int len = strlen (filename) + strlen (cwd) + 1;
450 char *data_file = (char *) alloca (len + 4);
452 strcpy (data_file, cwd);
453 strcat (data_file, "/");
454 strcat (data_file, filename);
455 strip_off_ending (data_file, len);
456 if (profile_block_flag)
457 strcat (data_file, ".d");
459 strcat (data_file, ".da");
460 assemble_string (data_file, strlen (data_file) + 1);
463 /* Make space for the table of counts. */
466 /* Realign data section. */
467 ASM_OUTPUT_ALIGN (asm_out_file, align);
468 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
470 assemble_zeros (size);
474 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
475 #ifdef ASM_OUTPUT_SHARED_LOCAL
476 if (flag_shared_data)
477 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
480 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
481 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
484 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
485 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
488 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
493 /* Output any basic block strings */
494 if (profile_block_flag)
496 readonly_data_section ();
499 ASM_OUTPUT_ALIGN (asm_out_file, align);
500 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
502 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC",
504 assemble_string (sptr->string, sptr->length);
509 /* Output the table of addresses. */
510 if (profile_block_flag)
512 /* Realign in new section */
513 ASM_OUTPUT_ALIGN (asm_out_file, align);
514 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
515 for (i = 0; i < count_basic_blocks; i++)
517 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
518 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
523 /* Output the table of function names. */
524 if (profile_block_flag)
526 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
527 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
529 if (ptr->func_label_num >= 0)
531 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
532 ptr->func_label_num);
533 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
537 assemble_integer (const0_rtx, pointer_bytes, 1);
540 for ( ; i < count_basic_blocks; i++)
541 assemble_integer (const0_rtx, pointer_bytes, 1);
544 if (write_symbols != NO_DEBUG && profile_block_flag)
546 /* Output the table of line numbers. */
547 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
548 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
549 assemble_integer (GEN_INT (ptr->line_num), long_bytes, 1);
551 for ( ; i < count_basic_blocks; i++)
552 assemble_integer (const0_rtx, long_bytes, 1);
554 /* Output the table of file names. */
555 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
556 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
558 if (ptr->file_label_num >= 0)
560 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
561 ptr->file_label_num);
562 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
566 assemble_integer (const0_rtx, pointer_bytes, 1);
569 for ( ; i < count_basic_blocks; i++)
570 assemble_integer (const0_rtx, pointer_bytes, 1);
573 /* End with the address of the table of addresses,
574 so we can find it easily, as the last word in the file's text. */
575 if (profile_block_flag)
577 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
578 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
584 /* Enable APP processing of subsequent output.
585 Used before the output from an `asm' statement. */
592 fputs (ASM_APP_ON, asm_out_file);
597 /* Disable APP processing of subsequent output.
598 Called from varasm.c before most kinds of output. */
605 fputs (ASM_APP_OFF, asm_out_file);
610 /* Return the number of slots filled in the current
611 delayed branch sequence (we don't count the insn needing the
612 delay slot). Zero if not in a delayed branch sequence. */
616 dbr_sequence_length ()
618 if (final_sequence != 0)
619 return XVECLEN (final_sequence, 0) - 1;
625 /* The next two pages contain routines used to compute the length of an insn
626 and to shorten branches. */
628 /* Arrays for insn lengths, and addresses. The latter is referenced by
629 `insn_current_length'. */
631 static short *insn_lengths;
634 /* Max uid for which the above arrays are valid. */
635 static int insn_lengths_max_uid;
637 /* Address of insn being processed. Used by `insn_current_length'. */
638 int insn_current_address;
640 /* Address of insn being processed in previous iteration. */
641 int insn_last_address;
643 /* konwn invariant alignment of insn being processed. */
644 int insn_current_align;
646 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
647 gives the next following alignment insn that increases the known
648 alignment, or NULL_RTX if there is no such insn.
649 For any alignment obtained this way, we can again index uid_align with
650 its uid to obtain the next following align that in turn increases the
651 alignment, till we reach NULL_RTX; the sequence obtained this way
652 for each insn we'll call the alignment chain of this insn in the following
655 struct label_alignment {
660 static rtx *uid_align;
661 static int *uid_shuid;
662 static struct label_alignment *label_align;
664 /* Indicate that branch shortening hasn't yet been done. */
683 insn_lengths_max_uid = 0;
687 free (insn_addresses);
697 /* Obtain the current length of an insn. If branch shortening has been done,
698 get its actual length. Otherwise, get its maximum length. */
701 get_attr_length (insn)
704 #ifdef HAVE_ATTR_length
709 if (insn_lengths_max_uid > INSN_UID (insn))
710 return insn_lengths[INSN_UID (insn)];
712 switch (GET_CODE (insn))
720 length = insn_default_length (insn);
724 body = PATTERN (insn);
725 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
727 /* Alignment is machine-dependent and should be handled by
731 length = insn_default_length (insn);
735 body = PATTERN (insn);
736 if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
739 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
740 length = asm_insn_count (body) * insn_default_length (insn);
741 else if (GET_CODE (body) == SEQUENCE)
742 for (i = 0; i < XVECLEN (body, 0); i++)
743 length += get_attr_length (XVECEXP (body, 0, i));
745 length = insn_default_length (insn);
752 #ifdef ADJUST_INSN_LENGTH
753 ADJUST_INSN_LENGTH (insn, length);
756 #else /* not HAVE_ATTR_length */
758 #endif /* not HAVE_ATTR_length */
761 /* Code to handle alignment inside shorten_branches. */
763 /* Here is an explanation how the algorithm in align_fuzz can give
766 Call a sequence of instructions beginning with alignment point X
767 and continuing until the next alignment point `block X'. When `X'
768 is used in an expression, it means the alignment value of the
771 Call the distance between the start of the first insn of block X, and
772 the end of the last insn of block X `IX', for the `inner size of X'.
773 This is clearly the sum of the instruction lengths.
775 Likewise with the next alignment-delimited block following X, which we
778 Call the distance between the start of the first insn of block X, and
779 the start of the first insn of block Y `OX', for the `outer size of X'.
781 The estimated padding is then OX - IX.
783 OX can be safely estimated as
788 OX = round_up(IX, X) + Y - X
790 Clearly est(IX) >= real(IX), because that only depends on the
791 instruction lengths, and those being overestimated is a given.
793 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
794 we needn't worry about that when thinking about OX.
796 When X >= Y, the alignment provided by Y adds no uncertainty factor
797 for branch ranges starting before X, so we can just round what we have.
798 But when X < Y, we don't know anything about the, so to speak,
799 `middle bits', so we have to assume the worst when aligning up from an
800 address mod X to one mod Y, which is Y - X. */
803 #define LABEL_ALIGN(LABEL) align_labels_log
806 #ifndef LABEL_ALIGN_MAX_SKIP
807 #define LABEL_ALIGN_MAX_SKIP (align_labels-1)
811 #define LOOP_ALIGN(LABEL) align_loops_log
814 #ifndef LOOP_ALIGN_MAX_SKIP
815 #define LOOP_ALIGN_MAX_SKIP (align_loops-1)
818 #ifndef LABEL_ALIGN_AFTER_BARRIER
819 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) align_jumps_log
822 #ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
823 #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP (align_jumps-1)
826 #ifndef ADDR_VEC_ALIGN
828 final_addr_vec_align (addr_vec)
831 int align = exact_log2 (GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec))));
833 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
834 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
838 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
841 #ifndef INSN_LENGTH_ALIGNMENT
842 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
845 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
847 static int min_labelno, max_labelno;
849 #define LABEL_TO_ALIGNMENT(LABEL) \
850 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
852 #define LABEL_TO_MAX_SKIP(LABEL) \
853 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
855 /* For the benefit of port specific code do this also as a function. */
857 label_to_alignment (label)
860 return LABEL_TO_ALIGNMENT (label);
863 #ifdef HAVE_ATTR_length
864 /* The differences in addresses
865 between a branch and its target might grow or shrink depending on
866 the alignment the start insn of the range (the branch for a forward
867 branch or the label for a backward branch) starts out on; if these
868 differences are used naively, they can even oscillate infinitely.
869 We therefore want to compute a 'worst case' address difference that
870 is independent of the alignment the start insn of the range end
871 up on, and that is at least as large as the actual difference.
872 The function align_fuzz calculates the amount we have to add to the
873 naively computed difference, by traversing the part of the alignment
874 chain of the start insn of the range that is in front of the end insn
875 of the range, and considering for each alignment the maximum amount
876 that it might contribute to a size increase.
878 For casesi tables, we also want to know worst case minimum amounts of
879 address difference, in case a machine description wants to introduce
880 some common offset that is added to all offsets in a table.
881 For this purpose, align_fuzz with a growth argument of 0 comuptes the
882 appropriate adjustment. */
885 /* Compute the maximum delta by which the difference of the addresses of
886 START and END might grow / shrink due to a different address for start
887 which changes the size of alignment insns between START and END.
888 KNOWN_ALIGN_LOG is the alignment known for START.
889 GROWTH should be ~0 if the objective is to compute potential code size
890 increase, and 0 if the objective is to compute potential shrink.
891 The return value is undefined for any other value of GROWTH. */
893 align_fuzz (start, end, known_align_log, growth)
898 int uid = INSN_UID (start);
900 int known_align = 1 << known_align_log;
901 int end_shuid = INSN_SHUID (end);
904 for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
906 int align_addr, new_align;
908 uid = INSN_UID (align_label);
909 align_addr = insn_addresses[uid] - insn_lengths[uid];
910 if (uid_shuid[uid] > end_shuid)
912 known_align_log = LABEL_TO_ALIGNMENT (align_label);
913 new_align = 1 << known_align_log;
914 if (new_align < known_align)
916 fuzz += (-align_addr ^ growth) & (new_align - known_align);
917 known_align = new_align;
922 /* Compute a worst-case reference address of a branch so that it
923 can be safely used in the presence of aligned labels. Since the
924 size of the branch itself is unknown, the size of the branch is
925 not included in the range. I.e. for a forward branch, the reference
926 address is the end address of the branch as known from the previous
927 branch shortening pass, minus a value to account for possible size
928 increase due to alignment. For a backward branch, it is the start
929 address of the branch as known from the current pass, plus a value
930 to account for possible size increase due to alignment.
931 NB.: Therefore, the maximum offset allowed for backward branches needs
932 to exclude the branch size. */
934 insn_current_reference_address (branch)
938 rtx seq = NEXT_INSN (PREV_INSN (branch));
939 int seq_uid = INSN_UID (seq);
940 if (GET_CODE (branch) != JUMP_INSN)
941 /* This can happen for example on the PA; the objective is to know the
942 offset to address something in front of the start of the function.
943 Thus, we can treat it like a backward branch.
944 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
945 any alignment we'd encounter, so we skip the call to align_fuzz. */
946 return insn_current_address;
947 dest = JUMP_LABEL (branch);
948 /* BRANCH has no proper alignment chain set, so use SEQ. */
949 if (INSN_SHUID (branch) < INSN_SHUID (dest))
951 /* Forward branch. */
952 return (insn_last_address + insn_lengths[seq_uid]
953 - align_fuzz (seq, dest, length_unit_log, ~0));
957 /* Backward branch. */
958 return (insn_current_address
959 + align_fuzz (dest, seq, length_unit_log, ~0));
962 #endif /* HAVE_ATTR_length */
964 /* Make a pass over all insns and compute their actual lengths by shortening
965 any branches of variable length if possible. */
967 /* Give a default value for the lowest address in a function. */
969 #ifndef FIRST_INSN_ADDRESS
970 #define FIRST_INSN_ADDRESS 0
973 /* shorten_branches might be called multiple times: for example, the SH
974 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
975 In order to do this, it needs proper length information, which it obtains
976 by calling shorten_branches. This cannot be collapsed with
977 shorten_branches itself into a single pass unless we also want to intergate
978 reorg.c, since the branch splitting exposes new instructions with delay
982 shorten_branches (first)
990 #ifdef HAVE_ATTR_length
991 #define MAX_CODE_ALIGN 16
993 int something_changed = 1;
994 char *varying_length;
997 rtx align_tab[MAX_CODE_ALIGN];
999 /* In order to make sure that all instructions have valid length info,
1000 we must split them before we compute the address/length info. */
1002 for (insn = NEXT_INSN (first); insn; insn = NEXT_INSN (insn))
1003 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1006 /* Don't split the insn if it has been deleted. */
1007 if (! INSN_DELETED_P (old))
1008 insn = try_split (PATTERN (old), old, 1);
1009 /* When not optimizing, the old insn will be still left around
1010 with only the 'deleted' bit set. Transform it into a note
1011 to avoid confusion of subsequent processing. */
1012 if (INSN_DELETED_P (old))
1014 PUT_CODE (old , NOTE);
1015 NOTE_LINE_NUMBER (old) = NOTE_INSN_DELETED;
1016 NOTE_SOURCE_FILE (old) = 0;
1021 /* We must do some computations even when not actually shortening, in
1022 order to get the alignment information for the labels. */
1024 init_insn_lengths ();
1026 /* Compute maximum UID and allocate label_align / uid_shuid. */
1027 max_uid = get_max_uid ();
1029 max_labelno = max_label_num ();
1030 min_labelno = get_first_label_num ();
1031 label_align = (struct label_alignment *)
1032 xcalloc ((max_labelno - min_labelno + 1), sizeof (struct label_alignment));
1034 uid_shuid = (int *) xmalloc (max_uid * sizeof *uid_shuid);
1036 /* Initialize label_align and set up uid_shuid to be strictly
1037 monotonically rising with insn order. */
1038 /* We use max_log here to keep track of the maximum alignment we want to
1039 impose on the next CODE_LABEL (or the current one if we are processing
1040 the CODE_LABEL itself). */
1045 for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
1049 INSN_SHUID (insn) = i++;
1050 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1052 /* reorg might make the first insn of a loop being run once only,
1053 and delete the label in front of it. Then we want to apply
1054 the loop alignment to the new label created by reorg, which
1055 is separated by the former loop start insn from the
1056 NOTE_INSN_LOOP_BEG. */
1058 else if (GET_CODE (insn) == CODE_LABEL)
1062 log = LABEL_ALIGN (insn);
1066 max_skip = LABEL_ALIGN_MAX_SKIP;
1068 next = NEXT_INSN (insn);
1069 /* ADDR_VECs only take room if read-only data goes into the text
1071 if (JUMP_TABLES_IN_TEXT_SECTION
1072 #if !defined(READONLY_DATA_SECTION)
1076 if (next && GET_CODE (next) == JUMP_INSN)
1078 rtx nextbody = PATTERN (next);
1079 if (GET_CODE (nextbody) == ADDR_VEC
1080 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1082 log = ADDR_VEC_ALIGN (next);
1086 max_skip = LABEL_ALIGN_MAX_SKIP;
1090 LABEL_TO_ALIGNMENT (insn) = max_log;
1091 LABEL_TO_MAX_SKIP (insn) = max_skip;
1095 else if (GET_CODE (insn) == BARRIER)
1099 for (label = insn; label && GET_RTX_CLASS (GET_CODE (label)) != 'i';
1100 label = NEXT_INSN (label))
1101 if (GET_CODE (label) == CODE_LABEL)
1103 log = LABEL_ALIGN_AFTER_BARRIER (insn);
1107 max_skip = LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP;
1112 /* Again, we allow NOTE_INSN_LOOP_BEG - INSN - CODE_LABEL
1113 sequences in order to handle reorg output efficiently. */
1114 else if (GET_CODE (insn) == NOTE
1115 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
1120 /* Search for the label that starts the loop.
1121 Don't skip past the end of the loop, since that could
1122 lead to putting an alignment where it does not belong.
1123 However, a label after a nested (non-)loop would be OK. */
1124 for (label = insn; label; label = NEXT_INSN (label))
1126 if (GET_CODE (label) == NOTE
1127 && NOTE_LINE_NUMBER (label) == NOTE_INSN_LOOP_BEG)
1129 else if (GET_CODE (label) == NOTE
1130 && NOTE_LINE_NUMBER (label) == NOTE_INSN_LOOP_END
1133 else if (GET_CODE (label) == CODE_LABEL)
1135 log = LOOP_ALIGN (insn);
1139 max_skip = LOOP_ALIGN_MAX_SKIP;
1148 #ifdef HAVE_ATTR_length
1150 /* Allocate the rest of the arrays. */
1151 insn_lengths = (short *) xmalloc (max_uid * sizeof (short));
1152 insn_lengths_max_uid = max_uid;
1153 /* Syntax errors can lead to labels being outside of the main insn stream.
1154 Initialize insn_addresses, so that we get reproducible results. */
1155 insn_addresses = (int *) xcalloc (max_uid, sizeof (int));
1157 varying_length = (char *) xcalloc (max_uid, sizeof (char));
1159 /* Initialize uid_align. We scan instructions
1160 from end to start, and keep in align_tab[n] the last seen insn
1161 that does an alignment of at least n+1, i.e. the successor
1162 in the alignment chain for an insn that does / has a known
1164 uid_align = (rtx *) xcalloc (max_uid, sizeof *uid_align);
1166 for (i = MAX_CODE_ALIGN; --i >= 0; )
1167 align_tab[i] = NULL_RTX;
1168 seq = get_last_insn ();
1169 for (; seq; seq = PREV_INSN (seq))
1171 int uid = INSN_UID (seq);
1173 log = (GET_CODE (seq) == CODE_LABEL ? LABEL_TO_ALIGNMENT (seq) : 0);
1174 uid_align[uid] = align_tab[0];
1177 /* Found an alignment label. */
1178 uid_align[uid] = align_tab[log];
1179 for (i = log - 1; i >= 0; i--)
1183 #ifdef CASE_VECTOR_SHORTEN_MODE
1186 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1189 int min_shuid = INSN_SHUID (get_insns ()) - 1;
1190 int max_shuid = INSN_SHUID (get_last_insn ()) + 1;
1193 for (insn = first; insn != 0; insn = NEXT_INSN (insn))
1195 rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat;
1196 int len, i, min, max, insn_shuid;
1198 addr_diff_vec_flags flags;
1200 if (GET_CODE (insn) != JUMP_INSN
1201 || GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)
1203 pat = PATTERN (insn);
1204 len = XVECLEN (pat, 1);
1207 min_align = MAX_CODE_ALIGN;
1208 for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
1210 rtx lab = XEXP (XVECEXP (pat, 1, i), 0);
1211 int shuid = INSN_SHUID (lab);
1222 if (min_align > LABEL_TO_ALIGNMENT (lab))
1223 min_align = LABEL_TO_ALIGNMENT (lab);
1225 XEXP (pat, 2) = gen_rtx_LABEL_REF (VOIDmode, min_lab);
1226 XEXP (pat, 3) = gen_rtx_LABEL_REF (VOIDmode, max_lab);
1227 insn_shuid = INSN_SHUID (insn);
1228 rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0));
1229 flags.min_align = min_align;
1230 flags.base_after_vec = rel > insn_shuid;
1231 flags.min_after_vec = min > insn_shuid;
1232 flags.max_after_vec = max > insn_shuid;
1233 flags.min_after_base = min > rel;
1234 flags.max_after_base = max > rel;
1235 ADDR_DIFF_VEC_FLAGS (pat) = flags;
1238 #endif /* CASE_VECTOR_SHORTEN_MODE */
1241 /* Compute initial lengths, addresses, and varying flags for each insn. */
1242 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1244 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1246 uid = INSN_UID (insn);
1248 insn_lengths[uid] = 0;
1250 if (GET_CODE (insn) == CODE_LABEL)
1252 int log = LABEL_TO_ALIGNMENT (insn);
1255 int align = 1 << log;
1256 int new_address = (insn_current_address + align - 1) & -align;
1257 insn_lengths[uid] = new_address - insn_current_address;
1258 insn_current_address = new_address;
1262 insn_addresses[uid] = insn_current_address;
1264 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
1265 || GET_CODE (insn) == CODE_LABEL)
1267 if (INSN_DELETED_P (insn))
1270 body = PATTERN (insn);
1271 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1273 /* This only takes room if read-only data goes into the text
1275 if (JUMP_TABLES_IN_TEXT_SECTION
1276 #if !defined(READONLY_DATA_SECTION)
1280 insn_lengths[uid] = (XVECLEN (body,
1281 GET_CODE (body) == ADDR_DIFF_VEC)
1282 * GET_MODE_SIZE (GET_MODE (body)));
1283 /* Alignment is handled by ADDR_VEC_ALIGN. */
1285 else if (asm_noperands (body) >= 0)
1286 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
1287 else if (GET_CODE (body) == SEQUENCE)
1290 int const_delay_slots;
1292 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
1294 const_delay_slots = 0;
1296 /* Inside a delay slot sequence, we do not do any branch shortening
1297 if the shortening could change the number of delay slots
1299 for (i = 0; i < XVECLEN (body, 0); i++)
1301 rtx inner_insn = XVECEXP (body, 0, i);
1302 int inner_uid = INSN_UID (inner_insn);
1305 if (asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
1306 inner_length = (asm_insn_count (PATTERN (inner_insn))
1307 * insn_default_length (inner_insn));
1309 inner_length = insn_default_length (inner_insn);
1311 insn_lengths[inner_uid] = inner_length;
1312 if (const_delay_slots)
1314 if ((varying_length[inner_uid]
1315 = insn_variable_length_p (inner_insn)) != 0)
1316 varying_length[uid] = 1;
1317 insn_addresses[inner_uid] = (insn_current_address +
1321 varying_length[inner_uid] = 0;
1322 insn_lengths[uid] += inner_length;
1325 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
1327 insn_lengths[uid] = insn_default_length (insn);
1328 varying_length[uid] = insn_variable_length_p (insn);
1331 /* If needed, do any adjustment. */
1332 #ifdef ADJUST_INSN_LENGTH
1333 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
1334 if (insn_lengths[uid] < 0)
1335 fatal_insn ("Negative insn length", insn);
1339 /* Now loop over all the insns finding varying length insns. For each,
1340 get the current insn length. If it has changed, reflect the change.
1341 When nothing changes for a full pass, we are done. */
1343 while (something_changed)
1345 something_changed = 0;
1346 insn_current_align = MAX_CODE_ALIGN - 1;
1347 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1349 insn = NEXT_INSN (insn))
1352 #ifdef ADJUST_INSN_LENGTH
1357 uid = INSN_UID (insn);
1359 if (GET_CODE (insn) == CODE_LABEL)
1361 int log = LABEL_TO_ALIGNMENT (insn);
1362 if (log > insn_current_align)
1364 int align = 1 << log;
1365 int new_address= (insn_current_address + align - 1) & -align;
1366 insn_lengths[uid] = new_address - insn_current_address;
1367 insn_current_align = log;
1368 insn_current_address = new_address;
1371 insn_lengths[uid] = 0;
1372 insn_addresses[uid] = insn_current_address;
1376 length_align = INSN_LENGTH_ALIGNMENT (insn);
1377 if (length_align < insn_current_align)
1378 insn_current_align = length_align;
1380 insn_last_address = insn_addresses[uid];
1381 insn_addresses[uid] = insn_current_address;
1383 #ifdef CASE_VECTOR_SHORTEN_MODE
1384 if (optimize && GET_CODE (insn) == JUMP_INSN
1385 && GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
1387 rtx body = PATTERN (insn);
1388 int old_length = insn_lengths[uid];
1389 rtx rel_lab = XEXP (XEXP (body, 0), 0);
1390 rtx min_lab = XEXP (XEXP (body, 2), 0);
1391 rtx max_lab = XEXP (XEXP (body, 3), 0);
1392 addr_diff_vec_flags flags = ADDR_DIFF_VEC_FLAGS (body);
1393 int rel_addr = insn_addresses[INSN_UID (rel_lab)];
1394 int min_addr = insn_addresses[INSN_UID (min_lab)];
1395 int max_addr = insn_addresses[INSN_UID (max_lab)];
1399 /* Try to find a known alignment for rel_lab. */
1400 for (prev = rel_lab;
1402 && ! insn_lengths[INSN_UID (prev)]
1403 && ! (varying_length[INSN_UID (prev)] & 1);
1404 prev = PREV_INSN (prev))
1405 if (varying_length[INSN_UID (prev)] & 2)
1407 rel_align = LABEL_TO_ALIGNMENT (prev);
1411 /* See the comment on addr_diff_vec_flags in rtl.h for the
1412 meaning of the flags values. base: REL_LAB vec: INSN */
1413 /* Anything after INSN has still addresses from the last
1414 pass; adjust these so that they reflect our current
1415 estimate for this pass. */
1416 if (flags.base_after_vec)
1417 rel_addr += insn_current_address - insn_last_address;
1418 if (flags.min_after_vec)
1419 min_addr += insn_current_address - insn_last_address;
1420 if (flags.max_after_vec)
1421 max_addr += insn_current_address - insn_last_address;
1422 /* We want to know the worst case, i.e. lowest possible value
1423 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1424 its offset is positive, and we have to be wary of code shrink;
1425 otherwise, it is negative, and we have to be vary of code
1427 if (flags.min_after_base)
1429 /* If INSN is between REL_LAB and MIN_LAB, the size
1430 changes we are about to make can change the alignment
1431 within the observed offset, therefore we have to break
1432 it up into two parts that are independent. */
1433 if (! flags.base_after_vec && flags.min_after_vec)
1435 min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
1436 min_addr -= align_fuzz (insn, min_lab, 0, 0);
1439 min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
1443 if (flags.base_after_vec && ! flags.min_after_vec)
1445 min_addr -= align_fuzz (min_lab, insn, 0, ~0);
1446 min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
1449 min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
1451 /* Likewise, determine the highest lowest possible value
1452 for the offset of MAX_LAB. */
1453 if (flags.max_after_base)
1455 if (! flags.base_after_vec && flags.max_after_vec)
1457 max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
1458 max_addr += align_fuzz (insn, max_lab, 0, ~0);
1461 max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
1465 if (flags.base_after_vec && ! flags.max_after_vec)
1467 max_addr += align_fuzz (max_lab, insn, 0, 0);
1468 max_addr += align_fuzz (insn, rel_lab, 0, 0);
1471 max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
1473 PUT_MODE (body, CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
1474 max_addr - rel_addr,
1476 if (JUMP_TABLES_IN_TEXT_SECTION
1477 #if !defined(READONLY_DATA_SECTION)
1483 = (XVECLEN (body, 1) * GET_MODE_SIZE (GET_MODE (body)));
1484 insn_current_address += insn_lengths[uid];
1485 if (insn_lengths[uid] != old_length)
1486 something_changed = 1;
1491 #endif /* CASE_VECTOR_SHORTEN_MODE */
1493 if (! (varying_length[uid]))
1495 insn_current_address += insn_lengths[uid];
1498 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
1502 body = PATTERN (insn);
1504 for (i = 0; i < XVECLEN (body, 0); i++)
1506 rtx inner_insn = XVECEXP (body, 0, i);
1507 int inner_uid = INSN_UID (inner_insn);
1510 insn_addresses[inner_uid] = insn_current_address;
1512 /* insn_current_length returns 0 for insns with a
1513 non-varying length. */
1514 if (! varying_length[inner_uid])
1515 inner_length = insn_lengths[inner_uid];
1517 inner_length = insn_current_length (inner_insn);
1519 if (inner_length != insn_lengths[inner_uid])
1521 insn_lengths[inner_uid] = inner_length;
1522 something_changed = 1;
1524 insn_current_address += insn_lengths[inner_uid];
1525 new_length += inner_length;
1530 new_length = insn_current_length (insn);
1531 insn_current_address += new_length;
1534 #ifdef ADJUST_INSN_LENGTH
1535 /* If needed, do any adjustment. */
1536 tmp_length = new_length;
1537 ADJUST_INSN_LENGTH (insn, new_length);
1538 insn_current_address += (new_length - tmp_length);
1541 if (new_length != insn_lengths[uid])
1543 insn_lengths[uid] = new_length;
1544 something_changed = 1;
1547 /* For a non-optimizing compile, do only a single pass. */
1552 free (varying_length);
1554 #endif /* HAVE_ATTR_length */
1557 #ifdef HAVE_ATTR_length
1558 /* Given the body of an INSN known to be generated by an ASM statement, return
1559 the number of machine instructions likely to be generated for this insn.
1560 This is used to compute its length. */
1563 asm_insn_count (body)
1569 if (GET_CODE (body) == ASM_INPUT)
1570 template = XSTR (body, 0);
1572 template = decode_asm_operands (body, NULL_PTR, NULL_PTR,
1573 NULL_PTR, NULL_PTR);
1575 for ( ; *template; template++)
1576 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
1583 /* Output assembler code for the start of a function,
1584 and initialize some of the variables in this file
1585 for the new function. The label for the function and associated
1586 assembler pseudo-ops have already been output in `assemble_start_function'.
1588 FIRST is the first insn of the rtl for the function being compiled.
1589 FILE is the file to write assembler code to.
1590 OPTIMIZE is nonzero if we should eliminate redundant
1591 test and compare insns. */
1594 final_start_function (first, file, optimize)
1597 int optimize ATTRIBUTE_UNUSED;
1601 this_is_asm_operands = 0;
1603 #ifdef NON_SAVING_SETJMP
1604 /* A function that calls setjmp should save and restore all the
1605 call-saved registers on a system where longjmp clobbers them. */
1606 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
1610 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1611 if (!call_used_regs[i])
1612 regs_ever_live[i] = 1;
1616 /* Initial line number is supposed to be output
1617 before the function's prologue and label
1618 so that the function's address will not appear to be
1619 in the last statement of the preceding function. */
1620 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1621 last_linenum = high_block_linenum = high_function_linenum
1622 = NOTE_LINE_NUMBER (first);
1624 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1625 /* Output DWARF definition of the function. */
1626 if (dwarf2out_do_frame ())
1627 dwarf2out_begin_prologue ();
1630 /* For SDB and XCOFF, the function beginning must be marked between
1631 the function label and the prologue. We always need this, even when
1632 -g1 was used. Defer on MIPS systems so that parameter descriptions
1633 follow function entry. */
1634 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
1635 if (write_symbols == SDB_DEBUG)
1636 sdbout_begin_function (last_linenum);
1639 #ifdef XCOFF_DEBUGGING_INFO
1640 if (write_symbols == XCOFF_DEBUG)
1641 xcoffout_begin_function (file, last_linenum);
1644 /* But only output line number for other debug info types if -g2
1646 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1647 output_source_line (file, first);
1649 #ifdef LEAF_REG_REMAP
1650 if (current_function_uses_only_leaf_regs)
1651 leaf_renumber_regs (first);
1654 /* The Sun386i and perhaps other machines don't work right
1655 if the profiling code comes after the prologue. */
1656 #ifdef PROFILE_BEFORE_PROLOGUE
1658 profile_function (file);
1659 #endif /* PROFILE_BEFORE_PROLOGUE */
1661 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1662 if (dwarf2out_do_frame ())
1663 dwarf2out_frame_debug (NULL_RTX);
1666 #ifdef FUNCTION_PROLOGUE
1667 /* First output the function prologue: code to set up the stack frame. */
1668 FUNCTION_PROLOGUE (file, get_frame_size ());
1671 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1672 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
1673 next_block_index = 1;
1676 /* If the machine represents the prologue as RTL, the profiling code must
1677 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1678 #ifdef HAVE_prologue
1679 if (! HAVE_prologue)
1681 profile_after_prologue (file);
1685 /* If we are doing basic block profiling, remember a printable version
1686 of the function name. */
1687 if (profile_block_flag)
1690 = add_bb_string ((*decl_printable_name) (current_function_decl, 2), FALSE);
1695 profile_after_prologue (file)
1698 #ifdef FUNCTION_BLOCK_PROFILER
1699 if (profile_block_flag)
1701 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
1703 #endif /* FUNCTION_BLOCK_PROFILER */
1705 #ifndef PROFILE_BEFORE_PROLOGUE
1707 profile_function (file);
1708 #endif /* not PROFILE_BEFORE_PROLOGUE */
1712 profile_function (file)
1715 int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1716 #if defined(ASM_OUTPUT_REG_PUSH)
1717 #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1718 int sval = current_function_returns_struct;
1720 #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1721 int cxt = current_function_needs_context;
1723 #endif /* ASM_OUTPUT_REG_PUSH */
1726 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1727 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
1728 assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, 1);
1730 function_section (current_function_decl);
1732 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1734 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
1736 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1739 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1744 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1746 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1748 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1751 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1756 FUNCTION_PROFILER (file, profile_label_no);
1758 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1760 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1762 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1765 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1770 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1772 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1774 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1777 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1783 /* Output assembler code for the end of a function.
1784 For clarity, args are same as those of `final_start_function'
1785 even though not all of them are needed. */
1788 final_end_function (first, file, optimize)
1789 rtx first ATTRIBUTE_UNUSED;
1791 int optimize ATTRIBUTE_UNUSED;
1795 fputs (ASM_APP_OFF, file);
1799 #ifdef SDB_DEBUGGING_INFO
1800 if (write_symbols == SDB_DEBUG)
1801 sdbout_end_function (high_function_linenum);
1804 #ifdef DWARF_DEBUGGING_INFO
1805 if (write_symbols == DWARF_DEBUG)
1806 dwarfout_end_function ();
1809 #ifdef XCOFF_DEBUGGING_INFO
1810 if (write_symbols == XCOFF_DEBUG)
1811 xcoffout_end_function (file, high_function_linenum);
1814 #ifdef FUNCTION_EPILOGUE
1815 /* Finally, output the function epilogue:
1816 code to restore the stack frame and return to the caller. */
1817 FUNCTION_EPILOGUE (file, get_frame_size ());
1820 #ifdef SDB_DEBUGGING_INFO
1821 if (write_symbols == SDB_DEBUG)
1822 sdbout_end_epilogue ();
1825 #ifdef DWARF_DEBUGGING_INFO
1826 if (write_symbols == DWARF_DEBUG)
1827 dwarfout_end_epilogue ();
1830 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1831 if (dwarf2out_do_frame ())
1832 dwarf2out_end_epilogue ();
1835 #ifdef XCOFF_DEBUGGING_INFO
1836 if (write_symbols == XCOFF_DEBUG)
1837 xcoffout_end_epilogue (file);
1840 bb_func_label_num = -1; /* not in function, nuke label # */
1842 /* If FUNCTION_EPILOGUE is not defined, then the function body
1843 itself contains return instructions wherever needed. */
1846 /* Add a block to the linked list that remembers the current line/file/function
1847 for basic block profiling. Emit the label in front of the basic block and
1848 the instructions that increment the count field. */
1854 struct bb_list *ptr = (struct bb_list *) permalloc (sizeof (struct bb_list));
1856 /* Add basic block to linked list. */
1858 ptr->line_num = last_linenum;
1859 ptr->file_label_num = bb_file_label_num;
1860 ptr->func_label_num = bb_func_label_num;
1862 bb_tail = &ptr->next;
1864 /* Enable the table of basic-block use counts
1865 to point at the code it applies to. */
1866 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1868 /* Before first insn of this basic block, increment the
1869 count of times it was entered. */
1870 #ifdef BLOCK_PROFILER
1871 BLOCK_PROFILER (file, count_basic_blocks);
1878 count_basic_blocks++;
1881 /* Add a string to be used for basic block profiling. */
1884 add_bb_string (string, perm_p)
1889 struct bb_str *ptr = 0;
1893 string = "<unknown>";
1897 /* Allocate a new string if the current string isn't permanent. If
1898 the string is permanent search for the same string in other
1901 len = strlen (string) + 1;
1904 char *p = (char *) permalloc (len);
1905 bcopy (string, p, len);
1909 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1910 if (ptr->string == string)
1913 /* Allocate a new string block if we need to. */
1916 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1919 ptr->label_num = sbb_label_num++;
1920 ptr->string = string;
1922 sbb_tail = &ptr->next;
1925 return ptr->label_num;
1929 /* Output assembler code for some insns: all or part of a function.
1930 For description of args, see `final_start_function', above.
1932 PRESCAN is 1 if we are not really outputting,
1933 just scanning as if we were outputting.
1934 Prescanning deletes and rearranges insns just like ordinary output.
1935 PRESCAN is -2 if we are outputting after having prescanned.
1936 In this case, don't try to delete or rearrange insns
1937 because that has already been done.
1938 Prescanning is done only on certain machines. */
1941 final (first, file, optimize, prescan)
1951 last_ignored_compare = 0;
1954 check_exception_handler_labels ();
1956 /* Make a map indicating which line numbers appear in this function.
1957 When producing SDB debugging info, delete troublesome line number
1958 notes from inlined functions in other files as well as duplicate
1959 line number notes. */
1960 #ifdef SDB_DEBUGGING_INFO
1961 if (write_symbols == SDB_DEBUG)
1964 for (insn = first; insn; insn = NEXT_INSN (insn))
1965 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1967 if ((RTX_INTEGRATED_P (insn)
1968 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1970 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1971 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1973 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1974 NOTE_SOURCE_FILE (insn) = 0;
1978 if (NOTE_LINE_NUMBER (insn) > max_line)
1979 max_line = NOTE_LINE_NUMBER (insn);
1985 for (insn = first; insn; insn = NEXT_INSN (insn))
1986 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1987 max_line = NOTE_LINE_NUMBER (insn);
1990 line_note_exists = (char *) oballoc (max_line + 1);
1991 bzero (line_note_exists, max_line + 1);
1993 for (insn = first; insn; insn = NEXT_INSN (insn))
1995 if (INSN_UID (insn) > max_uid) /* find largest UID */
1996 max_uid = INSN_UID (insn);
1997 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1998 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
2000 /* If CC tracking across branches is enabled, record the insn which
2001 jumps to each branch only reached from one place. */
2002 if (optimize && GET_CODE (insn) == JUMP_INSN)
2004 rtx lab = JUMP_LABEL (insn);
2005 if (lab && LABEL_NUSES (lab) == 1)
2007 LABEL_REFS (lab) = insn;
2013 /* Initialize insn_eh_region table if eh is being used. */
2015 init_insn_eh_region (first, max_uid);
2021 /* Output the insns. */
2022 for (insn = NEXT_INSN (first); insn;)
2024 #ifdef HAVE_ATTR_length
2025 insn_current_address = insn_addresses[INSN_UID (insn)];
2027 insn = final_scan_insn (insn, file, optimize, prescan, 0);
2030 /* Do basic-block profiling here
2031 if the last insn was a conditional branch. */
2032 if (profile_block_flag && new_block)
2035 free_insn_eh_region ();
2039 get_insn_template (code, insn)
2043 const void *output = insn_data[code].output;
2044 switch (insn_data[code].output_format)
2046 case INSN_OUTPUT_FORMAT_SINGLE:
2047 return (const char *) output;
2048 case INSN_OUTPUT_FORMAT_MULTI:
2049 return ((const char * const *) output)[which_alternative];
2050 case INSN_OUTPUT_FORMAT_FUNCTION:
2053 return (* (insn_output_fn) output) (recog_data.operand, insn);
2059 /* The final scan for one insn, INSN.
2060 Args are same as in `final', except that INSN
2061 is the insn being scanned.
2062 Value returned is the next insn to be scanned.
2064 NOPEEPHOLES is the flag to disallow peephole processing (currently
2065 used for within delayed branch sequence output). */
2068 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
2081 /* Ignore deleted insns. These can occur when we split insns (due to a
2082 template of "#") while not optimizing. */
2083 if (INSN_DELETED_P (insn))
2084 return NEXT_INSN (insn);
2086 switch (GET_CODE (insn))
2092 /* Align the beginning of a loop, for higher speed
2093 on certain machines. */
2095 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
2096 break; /* This used to depend on optimize, but that was bogus. */
2097 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END)
2100 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG
2101 && ! exceptions_via_longjmp)
2103 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHB", NOTE_EH_HANDLER (insn));
2104 if (! flag_new_exceptions)
2105 add_eh_table_entry (NOTE_EH_HANDLER (insn));
2106 #ifdef ASM_OUTPUT_EH_REGION_BEG
2107 ASM_OUTPUT_EH_REGION_BEG (file, NOTE_EH_HANDLER (insn));
2112 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END
2113 && ! exceptions_via_longjmp)
2115 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHE", NOTE_EH_HANDLER (insn));
2116 if (flag_new_exceptions)
2117 add_eh_table_entry (NOTE_EH_HANDLER (insn));
2118 #ifdef ASM_OUTPUT_EH_REGION_END
2119 ASM_OUTPUT_EH_REGION_END (file, NOTE_EH_HANDLER (insn));
2124 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
2126 #ifdef FUNCTION_END_PROLOGUE
2127 FUNCTION_END_PROLOGUE (file);
2129 profile_after_prologue (file);
2133 #ifdef FUNCTION_BEGIN_EPILOGUE
2134 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
2136 FUNCTION_BEGIN_EPILOGUE (file);
2141 if (write_symbols == NO_DEBUG)
2143 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
2145 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
2146 /* MIPS stabs require the parameter descriptions to be after the
2147 function entry point rather than before. */
2148 if (write_symbols == SDB_DEBUG)
2149 sdbout_begin_function (last_linenum);
2152 #ifdef DWARF_DEBUGGING_INFO
2153 /* This outputs a marker where the function body starts, so it
2154 must be after the prologue. */
2155 if (write_symbols == DWARF_DEBUG)
2156 dwarfout_begin_function ();
2160 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED)
2161 break; /* An insn that was "deleted" */
2164 fputs (ASM_APP_OFF, file);
2167 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG
2168 && (debug_info_level == DINFO_LEVEL_NORMAL
2169 || debug_info_level == DINFO_LEVEL_VERBOSE
2170 || write_symbols == DWARF_DEBUG
2171 || write_symbols == DWARF2_DEBUG))
2173 /* Beginning of a symbol-block. Assign it a sequence number
2174 and push the number onto the stack PENDING_BLOCKS. */
2176 if (block_depth == max_block_depth)
2178 /* PENDING_BLOCKS is full; make it longer. */
2179 max_block_depth *= 2;
2181 = (int *) xrealloc (pending_blocks,
2182 max_block_depth * sizeof (int));
2184 pending_blocks[block_depth++] = next_block_index;
2186 high_block_linenum = last_linenum;
2188 /* Output debugging info about the symbol-block beginning. */
2190 #ifdef SDB_DEBUGGING_INFO
2191 if (write_symbols == SDB_DEBUG)
2192 sdbout_begin_block (file, last_linenum, next_block_index);
2194 #ifdef XCOFF_DEBUGGING_INFO
2195 if (write_symbols == XCOFF_DEBUG)
2196 xcoffout_begin_block (file, last_linenum, next_block_index);
2198 #ifdef DBX_DEBUGGING_INFO
2199 if (write_symbols == DBX_DEBUG)
2200 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", next_block_index);
2202 #ifdef DWARF_DEBUGGING_INFO
2203 if (write_symbols == DWARF_DEBUG)
2204 dwarfout_begin_block (next_block_index);
2206 #ifdef DWARF2_DEBUGGING_INFO
2207 if (write_symbols == DWARF2_DEBUG)
2208 dwarf2out_begin_block (next_block_index);
2213 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END
2214 && (debug_info_level == DINFO_LEVEL_NORMAL
2215 || debug_info_level == DINFO_LEVEL_VERBOSE
2216 || write_symbols == DWARF_DEBUG
2217 || write_symbols == DWARF2_DEBUG))
2219 /* End of a symbol-block. Pop its sequence number off
2220 PENDING_BLOCKS and output debugging info based on that. */
2223 if (block_depth < 0)
2226 #ifdef XCOFF_DEBUGGING_INFO
2227 if (write_symbols == XCOFF_DEBUG)
2228 xcoffout_end_block (file, high_block_linenum,
2229 pending_blocks[block_depth]);
2231 #ifdef DBX_DEBUGGING_INFO
2232 if (write_symbols == DBX_DEBUG)
2233 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE",
2234 pending_blocks[block_depth]);
2236 #ifdef SDB_DEBUGGING_INFO
2237 if (write_symbols == SDB_DEBUG)
2238 sdbout_end_block (file, high_block_linenum,
2239 pending_blocks[block_depth]);
2241 #ifdef DWARF_DEBUGGING_INFO
2242 if (write_symbols == DWARF_DEBUG)
2243 dwarfout_end_block (pending_blocks[block_depth]);
2245 #ifdef DWARF2_DEBUGGING_INFO
2246 if (write_symbols == DWARF2_DEBUG)
2247 dwarf2out_end_block (pending_blocks[block_depth]);
2250 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL
2251 && (debug_info_level == DINFO_LEVEL_NORMAL
2252 || debug_info_level == DINFO_LEVEL_VERBOSE))
2254 #ifdef DWARF_DEBUGGING_INFO
2255 if (write_symbols == DWARF_DEBUG)
2256 dwarfout_label (insn);
2258 #ifdef DWARF2_DEBUGGING_INFO
2259 if (write_symbols == DWARF2_DEBUG)
2260 dwarf2out_label (insn);
2263 else if (NOTE_LINE_NUMBER (insn) > 0)
2264 /* This note is a line-number. */
2268 #if 0 /* This is what we used to do. */
2269 output_source_line (file, insn);
2273 /* If there is anything real after this note,
2274 output it. If another line note follows, omit this one. */
2275 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
2277 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
2279 /* These types of notes can be significant
2280 so make sure the preceding line number stays. */
2281 else if (GET_CODE (note) == NOTE
2282 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
2283 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
2284 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
2286 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
2288 /* Another line note follows; we can delete this note
2289 if no intervening line numbers have notes elsewhere. */
2291 for (num = NOTE_LINE_NUMBER (insn) + 1;
2292 num < NOTE_LINE_NUMBER (note);
2294 if (line_note_exists[num])
2297 if (num >= NOTE_LINE_NUMBER (note))
2303 /* Output this line note
2304 if it is the first or the last line note in a row. */
2306 output_source_line (file, insn);
2311 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2312 /* If we push arguments, we need to check all insns for stack
2314 if (dwarf2out_do_frame ())
2315 dwarf2out_frame_debug (insn);
2320 /* The target port might emit labels in the output function for
2321 some insn, e.g. sh.c output_branchy_insn. */
2322 if (CODE_LABEL_NUMBER (insn) <= max_labelno)
2324 int align = LABEL_TO_ALIGNMENT (insn);
2325 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2326 int max_skip = LABEL_TO_MAX_SKIP (insn);
2329 if (align && NEXT_INSN (insn))
2330 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2331 ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip);
2333 ASM_OUTPUT_ALIGN (file, align);
2338 /* If this label is reached from only one place, set the condition
2339 codes from the instruction just before the branch. */
2341 /* Disabled because some insns set cc_status in the C output code
2342 and NOTICE_UPDATE_CC alone can set incorrect status. */
2343 if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
2345 rtx jump = LABEL_REFS (insn);
2346 rtx barrier = prev_nonnote_insn (insn);
2348 /* If the LABEL_REFS field of this label has been set to point
2349 at a branch, the predecessor of the branch is a regular
2350 insn, and that branch is the only way to reach this label,
2351 set the condition codes based on the branch and its
2353 if (barrier && GET_CODE (barrier) == BARRIER
2354 && jump && GET_CODE (jump) == JUMP_INSN
2355 && (prev = prev_nonnote_insn (jump))
2356 && GET_CODE (prev) == INSN)
2358 NOTICE_UPDATE_CC (PATTERN (prev), prev);
2359 NOTICE_UPDATE_CC (PATTERN (jump), jump);
2367 #ifdef FINAL_PRESCAN_LABEL
2368 FINAL_PRESCAN_INSN (insn, NULL_PTR, 0);
2371 #ifdef SDB_DEBUGGING_INFO
2372 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
2373 sdbout_label (insn);
2375 #ifdef DWARF_DEBUGGING_INFO
2376 if (write_symbols == DWARF_DEBUG && LABEL_NAME (insn))
2377 dwarfout_label (insn);
2379 #ifdef DWARF2_DEBUGGING_INFO
2380 if (write_symbols == DWARF2_DEBUG && LABEL_NAME (insn))
2381 dwarf2out_label (insn);
2385 fputs (ASM_APP_OFF, file);
2388 if (NEXT_INSN (insn) != 0
2389 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
2391 rtx nextbody = PATTERN (NEXT_INSN (insn));
2393 /* If this label is followed by a jump-table,
2394 make sure we put the label in the read-only section. Also
2395 possibly write the label and jump table together. */
2397 if (GET_CODE (nextbody) == ADDR_VEC
2398 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
2400 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2401 /* In this case, the case vector is being moved by the
2402 target, so don't output the label at all. Leave that
2403 to the back end macros. */
2405 if (! JUMP_TABLES_IN_TEXT_SECTION)
2407 readonly_data_section ();
2408 #ifdef READONLY_DATA_SECTION
2409 ASM_OUTPUT_ALIGN (file,
2410 exact_log2 (BIGGEST_ALIGNMENT
2412 #endif /* READONLY_DATA_SECTION */
2415 function_section (current_function_decl);
2417 #ifdef ASM_OUTPUT_CASE_LABEL
2418 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
2421 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2428 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2433 register rtx body = PATTERN (insn);
2434 int insn_code_number;
2435 const char *template;
2440 /* An INSN, JUMP_INSN or CALL_INSN.
2441 First check for special kinds that recog doesn't recognize. */
2443 if (GET_CODE (body) == USE /* These are just declarations */
2444 || GET_CODE (body) == CLOBBER)
2448 /* If there is a REG_CC_SETTER note on this insn, it means that
2449 the setting of the condition code was done in the delay slot
2450 of the insn that branched here. So recover the cc status
2451 from the insn that set it. */
2453 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
2456 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
2457 cc_prev_status = cc_status;
2461 /* Detect insns that are really jump-tables
2462 and output them as such. */
2464 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
2466 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2467 register int vlen, idx;
2475 fputs (ASM_APP_OFF, file);
2479 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2480 if (GET_CODE (body) == ADDR_VEC)
2482 #ifdef ASM_OUTPUT_ADDR_VEC
2483 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2490 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2491 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2497 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
2498 for (idx = 0; idx < vlen; idx++)
2500 if (GET_CODE (body) == ADDR_VEC)
2502 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2503 ASM_OUTPUT_ADDR_VEC_ELT
2504 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
2511 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2512 ASM_OUTPUT_ADDR_DIFF_ELT
2515 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
2516 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
2522 #ifdef ASM_OUTPUT_CASE_END
2523 ASM_OUTPUT_CASE_END (file,
2524 CODE_LABEL_NUMBER (PREV_INSN (insn)),
2529 function_section (current_function_decl);
2534 /* Do basic-block profiling when we reach a new block.
2535 Done here to avoid jump tables. */
2536 if (profile_block_flag && new_block)
2539 if (GET_CODE (body) == ASM_INPUT)
2541 /* There's no telling what that did to the condition codes. */
2547 fputs (ASM_APP_ON, file);
2550 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
2554 /* Detect `asm' construct with operands. */
2555 if (asm_noperands (body) >= 0)
2557 unsigned int noperands = asm_noperands (body);
2558 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
2561 /* There's no telling what that did to the condition codes. */
2568 fputs (ASM_APP_ON, file);
2572 /* Get out the operand values. */
2573 string = decode_asm_operands (body, ops, NULL_PTR,
2574 NULL_PTR, NULL_PTR);
2575 /* Inhibit aborts on what would otherwise be compiler bugs. */
2576 insn_noperands = noperands;
2577 this_is_asm_operands = insn;
2579 /* Output the insn using them. */
2580 output_asm_insn (string, ops);
2581 this_is_asm_operands = 0;
2585 if (prescan <= 0 && app_on)
2587 fputs (ASM_APP_OFF, file);
2591 if (GET_CODE (body) == SEQUENCE)
2593 /* A delayed-branch sequence */
2599 final_sequence = body;
2601 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2602 force the restoration of a comparison that was previously
2603 thought unnecessary. If that happens, cancel this sequence
2604 and cause that insn to be restored. */
2606 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
2607 if (next != XVECEXP (body, 0, 1))
2613 for (i = 1; i < XVECLEN (body, 0); i++)
2615 rtx insn = XVECEXP (body, 0, i);
2616 rtx next = NEXT_INSN (insn);
2617 /* We loop in case any instruction in a delay slot gets
2620 insn = final_scan_insn (insn, file, 0, prescan, 1);
2621 while (insn != next);
2623 #ifdef DBR_OUTPUT_SEQEND
2624 DBR_OUTPUT_SEQEND (file);
2628 /* If the insn requiring the delay slot was a CALL_INSN, the
2629 insns in the delay slot are actually executed before the
2630 called function. Hence we don't preserve any CC-setting
2631 actions in these insns and the CC must be marked as being
2632 clobbered by the function. */
2633 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
2638 /* Following a conditional branch sequence, we have a new basic
2640 if (profile_block_flag)
2642 rtx insn = XVECEXP (body, 0, 0);
2643 rtx body = PATTERN (insn);
2645 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2646 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2647 || (GET_CODE (insn) == JUMP_INSN
2648 && GET_CODE (body) == PARALLEL
2649 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2650 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
2656 /* We have a real machine instruction as rtl. */
2658 body = PATTERN (insn);
2661 set = single_set(insn);
2663 /* Check for redundant test and compare instructions
2664 (when the condition codes are already set up as desired).
2665 This is done only when optimizing; if not optimizing,
2666 it should be possible for the user to alter a variable
2667 with the debugger in between statements
2668 and the next statement should reexamine the variable
2669 to compute the condition codes. */
2674 rtx set = single_set(insn);
2678 && GET_CODE (SET_DEST (set)) == CC0
2679 && insn != last_ignored_compare)
2681 if (GET_CODE (SET_SRC (set)) == SUBREG)
2682 SET_SRC (set) = alter_subreg (SET_SRC (set));
2683 else if (GET_CODE (SET_SRC (set)) == COMPARE)
2685 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
2686 XEXP (SET_SRC (set), 0)
2687 = alter_subreg (XEXP (SET_SRC (set), 0));
2688 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
2689 XEXP (SET_SRC (set), 1)
2690 = alter_subreg (XEXP (SET_SRC (set), 1));
2692 if ((cc_status.value1 != 0
2693 && rtx_equal_p (SET_SRC (set), cc_status.value1))
2694 || (cc_status.value2 != 0
2695 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
2697 /* Don't delete insn if it has an addressing side-effect. */
2698 if (! FIND_REG_INC_NOTE (insn, 0)
2699 /* or if anything in it is volatile. */
2700 && ! volatile_refs_p (PATTERN (insn)))
2702 /* We don't really delete the insn; just ignore it. */
2703 last_ignored_compare = insn;
2711 /* Following a conditional branch, we have a new basic block.
2712 But if we are inside a sequence, the new block starts after the
2713 last insn of the sequence. */
2714 if (profile_block_flag && final_sequence == 0
2715 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2716 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2717 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
2718 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2719 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
2723 /* Don't bother outputting obvious no-ops, even without -O.
2724 This optimization is fast and doesn't interfere with debugging.
2725 Don't do this if the insn is in a delay slot, since this
2726 will cause an improper number of delay insns to be written. */
2727 if (final_sequence == 0
2729 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
2730 && GET_CODE (SET_SRC (body)) == REG
2731 && GET_CODE (SET_DEST (body)) == REG
2732 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
2737 /* If this is a conditional branch, maybe modify it
2738 if the cc's are in a nonstandard state
2739 so that it accomplishes the same thing that it would
2740 do straightforwardly if the cc's were set up normally. */
2742 if (cc_status.flags != 0
2743 && GET_CODE (insn) == JUMP_INSN
2744 && GET_CODE (body) == SET
2745 && SET_DEST (body) == pc_rtx
2746 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
2747 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
2748 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
2749 /* This is done during prescan; it is not done again
2750 in final scan when prescan has been done. */
2753 /* This function may alter the contents of its argument
2754 and clear some of the cc_status.flags bits.
2755 It may also return 1 meaning condition now always true
2756 or -1 meaning condition now always false
2757 or 2 meaning condition nontrivial but altered. */
2758 register int result = alter_cond (XEXP (SET_SRC (body), 0));
2759 /* If condition now has fixed value, replace the IF_THEN_ELSE
2760 with its then-operand or its else-operand. */
2762 SET_SRC (body) = XEXP (SET_SRC (body), 1);
2764 SET_SRC (body) = XEXP (SET_SRC (body), 2);
2766 /* The jump is now either unconditional or a no-op.
2767 If it has become a no-op, don't try to output it.
2768 (It would not be recognized.) */
2769 if (SET_SRC (body) == pc_rtx)
2771 PUT_CODE (insn, NOTE);
2772 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2773 NOTE_SOURCE_FILE (insn) = 0;
2776 else if (GET_CODE (SET_SRC (body)) == RETURN)
2777 /* Replace (set (pc) (return)) with (return). */
2778 PATTERN (insn) = body = SET_SRC (body);
2780 /* Rerecognize the instruction if it has changed. */
2782 INSN_CODE (insn) = -1;
2785 /* Make same adjustments to instructions that examine the
2786 condition codes without jumping and instructions that
2787 handle conditional moves (if this machine has either one). */
2789 if (cc_status.flags != 0
2792 rtx cond_rtx, then_rtx, else_rtx;
2794 if (GET_CODE (insn) != JUMP_INSN
2795 && GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
2797 cond_rtx = XEXP (SET_SRC (set), 0);
2798 then_rtx = XEXP (SET_SRC (set), 1);
2799 else_rtx = XEXP (SET_SRC (set), 2);
2803 cond_rtx = SET_SRC (set);
2804 then_rtx = const_true_rtx;
2805 else_rtx = const0_rtx;
2808 switch (GET_CODE (cond_rtx))
2821 register int result;
2822 if (XEXP (cond_rtx, 0) != cc0_rtx)
2824 result = alter_cond (cond_rtx);
2826 validate_change (insn, &SET_SRC (set), then_rtx, 0);
2827 else if (result == -1)
2828 validate_change (insn, &SET_SRC (set), else_rtx, 0);
2829 else if (result == 2)
2830 INSN_CODE (insn) = -1;
2831 if (SET_DEST (set) == SET_SRC (set))
2833 PUT_CODE (insn, NOTE);
2834 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2835 NOTE_SOURCE_FILE (insn) = 0;
2847 #ifdef HAVE_peephole
2848 /* Do machine-specific peephole optimizations if desired. */
2850 if (optimize && !flag_no_peephole && !nopeepholes)
2852 rtx next = peephole (insn);
2853 /* When peepholing, if there were notes within the peephole,
2854 emit them before the peephole. */
2855 if (next != 0 && next != NEXT_INSN (insn))
2857 rtx prev = PREV_INSN (insn);
2860 for (note = NEXT_INSN (insn); note != next;
2861 note = NEXT_INSN (note))
2862 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2864 /* In case this is prescan, put the notes
2865 in proper position for later rescan. */
2866 note = NEXT_INSN (insn);
2867 PREV_INSN (note) = prev;
2868 NEXT_INSN (prev) = note;
2869 NEXT_INSN (PREV_INSN (next)) = insn;
2870 PREV_INSN (insn) = PREV_INSN (next);
2871 NEXT_INSN (insn) = next;
2872 PREV_INSN (next) = insn;
2875 /* PEEPHOLE might have changed this. */
2876 body = PATTERN (insn);
2880 /* Try to recognize the instruction.
2881 If successful, verify that the operands satisfy the
2882 constraints for the instruction. Crash if they don't,
2883 since `reload' should have changed them so that they do. */
2885 insn_code_number = recog_memoized (insn);
2886 extract_insn (insn);
2887 cleanup_subreg_operands (insn);
2889 #ifdef REGISTER_CONSTRAINTS
2890 if (! constrain_operands (1))
2891 fatal_insn_not_found (insn);
2894 /* Some target machines need to prescan each insn before
2897 #ifdef FINAL_PRESCAN_INSN
2898 FINAL_PRESCAN_INSN (insn, recog_data.operand, recog_data.n_operands);
2902 cc_prev_status = cc_status;
2904 /* Update `cc_status' for this instruction.
2905 The instruction's output routine may change it further.
2906 If the output routine for a jump insn needs to depend
2907 on the cc status, it should look at cc_prev_status. */
2909 NOTICE_UPDATE_CC (body, insn);
2914 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2915 /* If we push arguments, we want to know where the calls are. */
2916 if (GET_CODE (insn) == CALL_INSN && dwarf2out_do_frame ())
2917 dwarf2out_frame_debug (insn);
2920 /* Find the proper template for this insn. */
2921 template = get_insn_template (insn_code_number, insn);
2923 /* If the C code returns 0, it means that it is a jump insn
2924 which follows a deleted test insn, and that test insn
2925 needs to be reinserted. */
2928 if (prev_nonnote_insn (insn) != last_ignored_compare)
2931 return prev_nonnote_insn (insn);
2934 /* If the template is the string "#", it means that this insn must
2936 if (template[0] == '#' && template[1] == '\0')
2938 rtx new = try_split (body, insn, 0);
2940 /* If we didn't split the insn, go away. */
2941 if (new == insn && PATTERN (new) == body)
2942 fatal_insn ("Could not split insn", insn);
2944 #ifdef HAVE_ATTR_length
2945 /* This instruction should have been split in shorten_branches,
2946 to ensure that we would have valid length info for the
2958 /* Output assembler code from the template. */
2960 output_asm_insn (template, recog_data.operand);
2962 #if defined (DWARF2_UNWIND_INFO)
2963 #if !defined (ACCUMULATE_OUTGOING_ARGS)
2964 /* If we push arguments, we need to check all insns for stack
2966 if (GET_CODE (insn) == INSN && dwarf2out_do_frame ())
2967 dwarf2out_frame_debug (insn);
2969 #if defined (HAVE_prologue)
2970 /* If this insn is part of the prologue, emit DWARF v2
2972 if (RTX_FRAME_RELATED_P (insn) && dwarf2out_do_frame ())
2973 dwarf2out_frame_debug (insn);
2979 /* It's not at all clear why we did this and doing so interferes
2980 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2983 /* Mark this insn as having been output. */
2984 INSN_DELETED_P (insn) = 1;
2990 return NEXT_INSN (insn);
2993 /* Output debugging info to the assembler file FILE
2994 based on the NOTE-insn INSN, assumed to be a line number. */
2997 output_source_line (file, insn)
2998 FILE *file ATTRIBUTE_UNUSED;
3001 register char *filename = NOTE_SOURCE_FILE (insn);
3003 /* Remember filename for basic block profiling.
3004 Filenames are allocated on the permanent obstack
3005 or are passed in ARGV, so we don't have to save
3008 if (profile_block_flag && last_filename != filename)
3009 bb_file_label_num = add_bb_string (filename, TRUE);
3011 last_filename = filename;
3012 last_linenum = NOTE_LINE_NUMBER (insn);
3013 high_block_linenum = MAX (last_linenum, high_block_linenum);
3014 high_function_linenum = MAX (last_linenum, high_function_linenum);
3016 if (write_symbols != NO_DEBUG)
3018 #ifdef SDB_DEBUGGING_INFO
3019 if (write_symbols == SDB_DEBUG
3020 #if 0 /* People like having line numbers even in wrong file! */
3021 /* COFF can't handle multiple source files--lose, lose. */
3022 && !strcmp (filename, main_input_filename)
3024 /* COFF relative line numbers must be positive. */
3025 && last_linenum > sdb_begin_function_line)
3027 #ifdef ASM_OUTPUT_SOURCE_LINE
3028 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
3030 fprintf (file, "\t.ln\t%d\n",
3031 ((sdb_begin_function_line > -1)
3032 ? last_linenum - sdb_begin_function_line : 1));
3037 #if defined (DBX_DEBUGGING_INFO)
3038 if (write_symbols == DBX_DEBUG)
3039 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
3042 #if defined (XCOFF_DEBUGGING_INFO)
3043 if (write_symbols == XCOFF_DEBUG)
3044 xcoffout_source_line (file, filename, insn);
3047 #ifdef DWARF_DEBUGGING_INFO
3048 if (write_symbols == DWARF_DEBUG)
3049 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
3052 #ifdef DWARF2_DEBUGGING_INFO
3053 if (write_symbols == DWARF2_DEBUG)
3054 dwarf2out_line (filename, NOTE_LINE_NUMBER (insn));
3060 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3061 directly to the desired hard register. */
3063 cleanup_subreg_operands (insn)
3068 extract_insn (insn);
3069 for (i = 0; i < recog_data.n_operands; i++)
3071 if (GET_CODE (recog_data.operand[i]) == SUBREG)
3072 recog_data.operand[i] = alter_subreg (recog_data.operand[i]);
3073 else if (GET_CODE (recog_data.operand[i]) == PLUS
3074 || GET_CODE (recog_data.operand[i]) == MULT)
3075 recog_data.operand[i] = walk_alter_subreg (recog_data.operand[i]);
3078 for (i = 0; i < recog_data.n_dups; i++)
3080 if (GET_CODE (*recog_data.dup_loc[i]) == SUBREG)
3081 *recog_data.dup_loc[i] = alter_subreg (*recog_data.dup_loc[i]);
3082 else if (GET_CODE (*recog_data.dup_loc[i]) == PLUS
3083 || GET_CODE (*recog_data.dup_loc[i]) == MULT)
3084 *recog_data.dup_loc[i] = walk_alter_subreg (*recog_data.dup_loc[i]);
3088 /* If X is a SUBREG, replace it with a REG or a MEM,
3089 based on the thing it is a subreg of. */
3095 register rtx y = SUBREG_REG (x);
3097 if (GET_CODE (y) == SUBREG)
3098 y = alter_subreg (y);
3100 /* If reload is operating, we may be replacing inside this SUBREG.
3101 Check for that and make a new one if so. */
3102 if (reload_in_progress && find_replacement (&SUBREG_REG (x)) != 0)
3105 if (GET_CODE (y) == REG)
3108 /* If the word size is larger than the size of this register,
3109 adjust the register number to compensate. */
3110 /* ??? Note that this just catches stragglers created by/for
3111 integrate. It would be better if we either caught these
3112 earlier, or kept _all_ subregs until now and eliminate
3113 gen_lowpart and friends. */
3115 #ifdef ALTER_HARD_SUBREG
3116 regno = ALTER_HARD_SUBREG(GET_MODE (x), SUBREG_WORD (x),
3117 GET_MODE (y), REGNO (y));
3119 regno = REGNO (y) + SUBREG_WORD (x);
3123 /* This field has a different meaning for REGs and SUBREGs. Make sure
3127 else if (GET_CODE (y) == MEM)
3129 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
3130 if (BYTES_BIG_ENDIAN)
3131 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
3132 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
3134 MEM_COPY_ATTRIBUTES (x, y);
3135 MEM_ALIAS_SET (x) = MEM_ALIAS_SET (y);
3136 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
3142 /* Do alter_subreg on all the SUBREGs contained in X. */
3145 walk_alter_subreg (x)
3148 switch (GET_CODE (x))
3152 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3153 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
3157 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3161 return alter_subreg (x);
3172 /* Given BODY, the body of a jump instruction, alter the jump condition
3173 as required by the bits that are set in cc_status.flags.
3174 Not all of the bits there can be handled at this level in all cases.
3176 The value is normally 0.
3177 1 means that the condition has become always true.
3178 -1 means that the condition has become always false.
3179 2 means that COND has been altered. */
3187 if (cc_status.flags & CC_REVERSED)
3190 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
3193 if (cc_status.flags & CC_INVERTED)
3196 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
3199 if (cc_status.flags & CC_NOT_POSITIVE)
3200 switch (GET_CODE (cond))
3205 /* Jump becomes unconditional. */
3211 /* Jump becomes no-op. */
3215 PUT_CODE (cond, EQ);
3220 PUT_CODE (cond, NE);
3228 if (cc_status.flags & CC_NOT_NEGATIVE)
3229 switch (GET_CODE (cond))
3233 /* Jump becomes unconditional. */
3238 /* Jump becomes no-op. */
3243 PUT_CODE (cond, EQ);
3249 PUT_CODE (cond, NE);
3257 if (cc_status.flags & CC_NO_OVERFLOW)
3258 switch (GET_CODE (cond))
3261 /* Jump becomes unconditional. */
3265 PUT_CODE (cond, EQ);
3270 PUT_CODE (cond, NE);
3275 /* Jump becomes no-op. */
3282 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
3283 switch (GET_CODE (cond))
3289 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
3294 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
3299 if (cc_status.flags & CC_NOT_SIGNED)
3300 /* The flags are valid if signed condition operators are converted
3302 switch (GET_CODE (cond))
3305 PUT_CODE (cond, LEU);
3310 PUT_CODE (cond, LTU);
3315 PUT_CODE (cond, GTU);
3320 PUT_CODE (cond, GEU);
3332 /* Report inconsistency between the assembler template and the operands.
3333 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3336 output_operand_lossage (msgid)
3339 if (this_is_asm_operands)
3340 error_for_asm (this_is_asm_operands, "invalid `asm': %s", _(msgid));
3343 error ("output_operand: %s", _(msgid));
3348 /* Output of assembler code from a template, and its subroutines. */
3350 /* Output text from TEMPLATE to the assembler output file,
3351 obeying %-directions to substitute operands taken from
3352 the vector OPERANDS.
3354 %N (for N a digit) means print operand N in usual manner.
3355 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3356 and print the label name with no punctuation.
3357 %cN means require operand N to be a constant
3358 and print the constant expression with no punctuation.
3359 %aN means expect operand N to be a memory address
3360 (not a memory reference!) and print a reference
3362 %nN means expect operand N to be a constant
3363 and print a constant expression for minus the value
3364 of the operand, with no other punctuation. */
3369 if (flag_print_asm_name)
3371 /* Annotate the assembly with a comment describing the pattern and
3372 alternative used. */
3375 register int num = INSN_CODE (debug_insn);
3376 fprintf (asm_out_file, "\t%s %d\t%s",
3377 ASM_COMMENT_START, INSN_UID (debug_insn),
3378 insn_data[num].name);
3379 if (insn_data[num].n_alternatives > 1)
3380 fprintf (asm_out_file, "/%d", which_alternative + 1);
3381 #ifdef HAVE_ATTR_length
3382 fprintf (asm_out_file, "\t[length = %d]",
3383 get_attr_length (debug_insn));
3385 /* Clear this so only the first assembler insn
3386 of any rtl insn will get the special comment for -dp. */
3393 output_asm_insn (template, operands)
3394 const char *template;
3397 register const char *p;
3400 /* An insn may return a null string template
3401 in a case where no assembler code is needed. */
3406 putc ('\t', asm_out_file);
3408 #ifdef ASM_OUTPUT_OPCODE
3409 ASM_OUTPUT_OPCODE (asm_out_file, p);
3417 putc (c, asm_out_file);
3418 #ifdef ASM_OUTPUT_OPCODE
3419 while ((c = *p) == '\t')
3421 putc (c, asm_out_file);
3424 ASM_OUTPUT_OPCODE (asm_out_file, p);
3428 #ifdef ASSEMBLER_DIALECT
3433 /* If we want the first dialect, do nothing. Otherwise, skip
3434 DIALECT_NUMBER of strings ending with '|'. */
3435 for (i = 0; i < dialect_number; i++)
3437 while (*p && *p != '}' && *p++ != '|')
3448 /* Skip to close brace. */
3449 while (*p && *p++ != '}')
3458 /* %% outputs a single %. */
3462 putc (c, asm_out_file);
3464 /* %= outputs a number which is unique to each insn in the entire
3465 compilation. This is useful for making local labels that are
3466 referred to more than once in a given insn. */
3470 fprintf (asm_out_file, "%d", insn_counter);
3472 /* % followed by a letter and some digits
3473 outputs an operand in a special way depending on the letter.
3474 Letters `acln' are implemented directly.
3475 Other letters are passed to `output_operand' so that
3476 the PRINT_OPERAND macro can define them. */
3477 else if ((*p >= 'a' && *p <= 'z')
3478 || (*p >= 'A' && *p <= 'Z'))
3483 if (! (*p >= '0' && *p <= '9'))
3484 output_operand_lossage ("operand number missing after %-letter");
3485 else if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3486 output_operand_lossage ("operand number out of range");
3487 else if (letter == 'l')
3488 output_asm_label (operands[c]);
3489 else if (letter == 'a')
3490 output_address (operands[c]);
3491 else if (letter == 'c')
3493 if (CONSTANT_ADDRESS_P (operands[c]))
3494 output_addr_const (asm_out_file, operands[c]);
3496 output_operand (operands[c], 'c');
3498 else if (letter == 'n')
3500 if (GET_CODE (operands[c]) == CONST_INT)
3501 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
3502 - INTVAL (operands[c]));
3505 putc ('-', asm_out_file);
3506 output_addr_const (asm_out_file, operands[c]);
3510 output_operand (operands[c], letter);
3512 while ((c = *p) >= '0' && c <= '9') p++;
3514 /* % followed by a digit outputs an operand the default way. */
3515 else if (*p >= '0' && *p <= '9')
3518 if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3519 output_operand_lossage ("operand number out of range");
3521 output_operand (operands[c], 0);
3522 while ((c = *p) >= '0' && c <= '9') p++;
3524 /* % followed by punctuation: output something for that
3525 punctuation character alone, with no operand.
3526 The PRINT_OPERAND macro decides what is actually done. */
3527 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3528 else if (PRINT_OPERAND_PUNCT_VALID_P ((unsigned char)*p))
3529 output_operand (NULL_RTX, *p++);
3532 output_operand_lossage ("invalid %%-code");
3536 putc (c, asm_out_file);
3541 putc ('\n', asm_out_file);
3544 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3547 output_asm_label (x)
3552 if (GET_CODE (x) == LABEL_REF)
3553 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3554 else if (GET_CODE (x) == CODE_LABEL)
3555 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3557 output_operand_lossage ("`%l' operand isn't a label");
3559 assemble_name (asm_out_file, buf);
3562 /* Print operand X using machine-dependent assembler syntax.
3563 The macro PRINT_OPERAND is defined just to control this function.
3564 CODE is a non-digit that preceded the operand-number in the % spec,
3565 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3566 between the % and the digits.
3567 When CODE is a non-letter, X is 0.
3569 The meanings of the letters are machine-dependent and controlled
3570 by PRINT_OPERAND. */
3573 output_operand (x, code)
3577 if (x && GET_CODE (x) == SUBREG)
3578 x = alter_subreg (x);
3580 /* If X is a pseudo-register, abort now rather than writing trash to the
3583 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
3586 PRINT_OPERAND (asm_out_file, x, code);
3589 /* Print a memory reference operand for address X
3590 using machine-dependent assembler syntax.
3591 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3597 walk_alter_subreg (x);
3598 PRINT_OPERAND_ADDRESS (asm_out_file, x);
3601 /* Print an integer constant expression in assembler syntax.
3602 Addition and subtraction are the only arithmetic
3603 that may appear in these expressions. */
3606 output_addr_const (file, x)
3613 switch (GET_CODE (x))
3623 assemble_name (file, XSTR (x, 0));
3627 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3628 assemble_name (file, buf);
3632 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3633 assemble_name (file, buf);
3637 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
3641 /* This used to output parentheses around the expression,
3642 but that does not work on the 386 (either ATT or BSD assembler). */
3643 output_addr_const (file, XEXP (x, 0));
3647 if (GET_MODE (x) == VOIDmode)
3649 /* We can use %d if the number is one word and positive. */
3650 if (CONST_DOUBLE_HIGH (x))
3651 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3652 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
3653 else if (CONST_DOUBLE_LOW (x) < 0)
3654 fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
3656 fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
3659 /* We can't handle floating point constants;
3660 PRINT_OPERAND must handle them. */
3661 output_operand_lossage ("floating constant misused");
3665 /* Some assemblers need integer constants to appear last (eg masm). */
3666 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
3668 output_addr_const (file, XEXP (x, 1));
3669 if (INTVAL (XEXP (x, 0)) >= 0)
3670 fprintf (file, "+");
3671 output_addr_const (file, XEXP (x, 0));
3675 output_addr_const (file, XEXP (x, 0));
3676 if (INTVAL (XEXP (x, 1)) >= 0)
3677 fprintf (file, "+");
3678 output_addr_const (file, XEXP (x, 1));
3683 /* Avoid outputting things like x-x or x+5-x,
3684 since some assemblers can't handle that. */
3685 x = simplify_subtraction (x);
3686 if (GET_CODE (x) != MINUS)
3689 output_addr_const (file, XEXP (x, 0));
3690 fprintf (file, "-");
3691 if (GET_CODE (XEXP (x, 1)) == CONST_INT
3692 && INTVAL (XEXP (x, 1)) < 0)
3694 fprintf (file, "%s", ASM_OPEN_PAREN);
3695 output_addr_const (file, XEXP (x, 1));
3696 fprintf (file, "%s", ASM_CLOSE_PAREN);
3699 output_addr_const (file, XEXP (x, 1));
3704 output_addr_const (file, XEXP (x, 0));
3708 output_operand_lossage ("invalid expression as operand");
3712 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3713 %R prints the value of REGISTER_PREFIX.
3714 %L prints the value of LOCAL_LABEL_PREFIX.
3715 %U prints the value of USER_LABEL_PREFIX.
3716 %I prints the value of IMMEDIATE_PREFIX.
3717 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3718 Also supported are %d, %x, %s, %e, %f, %g and %%.
3720 We handle alternate assembler dialects here, just like output_asm_insn. */
3723 asm_fprintf VPROTO((FILE *file, const char *p, ...))
3725 #ifndef ANSI_PROTOTYPES
3733 VA_START (argptr, p);
3735 #ifndef ANSI_PROTOTYPES
3736 file = va_arg (argptr, FILE *);
3737 p = va_arg (argptr, const char *);
3745 #ifdef ASSEMBLER_DIALECT
3750 /* If we want the first dialect, do nothing. Otherwise, skip
3751 DIALECT_NUMBER of strings ending with '|'. */
3752 for (i = 0; i < dialect_number; i++)
3754 while (*p && *p++ != '|')
3764 /* Skip to close brace. */
3765 while (*p && *p++ != '}')
3776 while ((c >= '0' && c <= '9') || c == '.')
3784 fprintf (file, "%%");
3787 case 'd': case 'i': case 'u':
3788 case 'x': case 'p': case 'X':
3792 fprintf (file, buf, va_arg (argptr, int));
3796 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3797 but we do not check for those cases. It means that the value
3798 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3800 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3802 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3812 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3819 fprintf (file, buf, va_arg (argptr, long));
3827 fprintf (file, buf, va_arg (argptr, double));
3833 fprintf (file, buf, va_arg (argptr, char *));
3837 #ifdef ASM_OUTPUT_OPCODE
3838 ASM_OUTPUT_OPCODE (asm_out_file, p);
3843 #ifdef REGISTER_PREFIX
3844 fprintf (file, "%s", REGISTER_PREFIX);
3849 #ifdef IMMEDIATE_PREFIX
3850 fprintf (file, "%s", IMMEDIATE_PREFIX);
3855 #ifdef LOCAL_LABEL_PREFIX
3856 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
3861 fputs (user_label_prefix, file);
3864 #ifdef ASM_FPRINTF_EXTENSIONS
3865 /* Upper case letters are reserved for general use by asm_fprintf
3866 and so are not available to target specific code. In order to
3867 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
3868 they are defined here. As they get turned into real extensions
3869 to asm_fprintf they should be removed from this list. */
3870 case 'A': case 'B': case 'C': case 'D': case 'E':
3871 case 'F': case 'G': case 'H': case 'J': case 'K':
3872 case 'M': case 'N': case 'P': case 'Q': case 'S':
3873 case 'T': case 'V': case 'W': case 'Y': case 'Z':
3876 ASM_FPRINTF_EXTENSIONS (file, argptr, p)
3889 /* Split up a CONST_DOUBLE or integer constant rtx
3890 into two rtx's for single words,
3891 storing in *FIRST the word that comes first in memory in the target
3892 and in *SECOND the other. */
3895 split_double (value, first, second)
3897 rtx *first, *second;
3899 if (GET_CODE (value) == CONST_INT)
3901 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3903 /* In this case the CONST_INT holds both target words.
3904 Extract the bits from it into two word-sized pieces.
3905 Sign extend each half to HOST_WIDE_INT. */
3907 /* On machines where HOST_BITS_PER_WIDE_INT == BITS_PER_WORD
3908 the shift below will cause a compiler warning, even though
3909 this code won't be executed. So put the shift amounts in
3910 variables to avoid the warning. */
3911 int rshift = HOST_BITS_PER_WIDE_INT - BITS_PER_WORD;
3912 int lshift = HOST_BITS_PER_WIDE_INT - 2 * BITS_PER_WORD;
3914 low = GEN_INT ((INTVAL (value) << rshift) >> rshift);
3915 high = GEN_INT ((INTVAL (value) << lshift) >> rshift);
3916 if (WORDS_BIG_ENDIAN)
3929 /* The rule for using CONST_INT for a wider mode
3930 is that we regard the value as signed.
3931 So sign-extend it. */
3932 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
3933 if (WORDS_BIG_ENDIAN)
3945 else if (GET_CODE (value) != CONST_DOUBLE)
3947 if (WORDS_BIG_ENDIAN)
3949 *first = const0_rtx;
3955 *second = const0_rtx;
3958 else if (GET_MODE (value) == VOIDmode
3959 /* This is the old way we did CONST_DOUBLE integers. */
3960 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
3962 /* In an integer, the words are defined as most and least significant.
3963 So order them by the target's convention. */
3964 if (WORDS_BIG_ENDIAN)
3966 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3967 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3971 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3972 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3977 #ifdef REAL_ARITHMETIC
3978 REAL_VALUE_TYPE r; long l[2];
3979 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
3981 /* Note, this converts the REAL_VALUE_TYPE to the target's
3982 format, splits up the floating point double and outputs
3983 exactly 32 bits of it into each of l[0] and l[1] --
3984 not necessarily BITS_PER_WORD bits. */
3985 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
3987 /* If 32 bits is an entire word for the target, but not for the host,
3988 then sign-extend on the host so that the number will look the same
3989 way on the host that it would on the target. See for instance
3990 simplify_unary_operation. The #if is needed to avoid compiler
3993 #if HOST_BITS_PER_LONG > 32
3994 if (BITS_PER_WORD < HOST_BITS_PER_LONG && BITS_PER_WORD == 32)
3996 if (l[0] & ((long) 1 << 31))
3997 l[0] |= ((long) (-1) << 32);
3998 if (l[1] & ((long) 1 << 31))
3999 l[1] |= ((long) (-1) << 32);
4003 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
4004 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
4006 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
4007 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
4008 && ! flag_pretend_float)
4012 #ifdef HOST_WORDS_BIG_ENDIAN
4019 /* Host and target agree => no need to swap. */
4020 *first = GEN_INT (CONST_DOUBLE_LOW (value));
4021 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
4025 *second = GEN_INT (CONST_DOUBLE_LOW (value));
4026 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
4028 #endif /* no REAL_ARITHMETIC */
4032 /* Return nonzero if this function has no function calls. */
4039 if (profile_flag || profile_block_flag || profile_arc_flag)
4042 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4044 if (GET_CODE (insn) == CALL_INSN)
4046 if (GET_CODE (insn) == INSN
4047 && GET_CODE (PATTERN (insn)) == SEQUENCE
4048 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN)
4051 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4053 if (GET_CODE (XEXP (insn, 0)) == CALL_INSN)
4055 if (GET_CODE (XEXP (insn, 0)) == INSN
4056 && GET_CODE (PATTERN (XEXP (insn, 0))) == SEQUENCE
4057 && GET_CODE (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)) == CALL_INSN)
4064 /* On some machines, a function with no call insns
4065 can run faster if it doesn't create its own register window.
4066 When output, the leaf function should use only the "output"
4067 registers. Ordinarily, the function would be compiled to use
4068 the "input" registers to find its arguments; it is a candidate
4069 for leaf treatment if it uses only the "input" registers.
4070 Leaf function treatment means renumbering so the function
4071 uses the "output" registers instead. */
4073 #ifdef LEAF_REGISTERS
4075 static char permitted_reg_in_leaf_functions[] = LEAF_REGISTERS;
4077 /* Return 1 if this function uses only the registers that can be
4078 safely renumbered. */
4081 only_leaf_regs_used ()
4085 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4086 if ((regs_ever_live[i] || global_regs[i])
4087 && ! permitted_reg_in_leaf_functions[i])
4090 if (current_function_uses_pic_offset_table
4091 && pic_offset_table_rtx != 0
4092 && GET_CODE (pic_offset_table_rtx) == REG
4093 && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4099 /* Scan all instructions and renumber all registers into those
4100 available in leaf functions. */
4103 leaf_renumber_regs (first)
4108 /* Renumber only the actual patterns.
4109 The reg-notes can contain frame pointer refs,
4110 and renumbering them could crash, and should not be needed. */
4111 for (insn = first; insn; insn = NEXT_INSN (insn))
4112 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
4113 leaf_renumber_regs_insn (PATTERN (insn));
4114 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4115 if (GET_RTX_CLASS (GET_CODE (XEXP (insn, 0))) == 'i')
4116 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
4119 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4120 available in leaf functions. */
4123 leaf_renumber_regs_insn (in_rtx)
4124 register rtx in_rtx;
4127 register const char *format_ptr;
4132 /* Renumber all input-registers into output-registers.
4133 renumbered_regs would be 1 for an output-register;
4136 if (GET_CODE (in_rtx) == REG)
4140 /* Don't renumber the same reg twice. */
4144 newreg = REGNO (in_rtx);
4145 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4146 to reach here as part of a REG_NOTE. */
4147 if (newreg >= FIRST_PSEUDO_REGISTER)
4152 newreg = LEAF_REG_REMAP (newreg);
4155 regs_ever_live[REGNO (in_rtx)] = 0;
4156 regs_ever_live[newreg] = 1;
4157 REGNO (in_rtx) = newreg;
4161 if (GET_RTX_CLASS (GET_CODE (in_rtx)) == 'i')
4163 /* Inside a SEQUENCE, we find insns.
4164 Renumber just the patterns of these insns,
4165 just as we do for the top-level insns. */
4166 leaf_renumber_regs_insn (PATTERN (in_rtx));
4170 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
4172 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
4173 switch (*format_ptr++)
4176 leaf_renumber_regs_insn (XEXP (in_rtx, i));
4180 if (NULL != XVEC (in_rtx, i))
4182 for (j = 0; j < XVECLEN (in_rtx, i); j++)
4183 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));