1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-99, 2000 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 */
288 static struct bb_str *sbb_head = 0; /* Head of string list. */
289 static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */
290 static int sbb_label_num = 0; /* Last label used */
292 #ifdef HAVE_ATTR_length
293 static int asm_insn_count PARAMS ((rtx));
295 static void profile_function PARAMS ((FILE *));
296 static void profile_after_prologue PARAMS ((FILE *));
297 static void add_bb PARAMS ((FILE *));
298 static int add_bb_string PARAMS ((const char *, int));
299 static void output_source_line PARAMS ((FILE *, rtx));
300 static rtx walk_alter_subreg PARAMS ((rtx));
301 static void output_asm_name PARAMS ((void));
302 static void output_operand PARAMS ((rtx, int));
303 #ifdef LEAF_REGISTERS
304 static void leaf_renumber_regs PARAMS ((rtx));
307 static int alter_cond PARAMS ((rtx));
309 #ifndef ADDR_VEC_ALIGN
310 static int final_addr_vec_align PARAMS ((rtx));
312 #ifdef HAVE_ATTR_length
313 static int align_fuzz PARAMS ((rtx, rtx, int, unsigned));
316 /* Initialize data in final at the beginning of a compilation. */
319 init_final (filename)
320 const char *filename ATTRIBUTE_UNUSED;
322 next_block_index = 2;
324 max_block_depth = 20;
325 pending_blocks = (int *) xmalloc (20 * sizeof *pending_blocks);
328 #ifdef ASSEMBLER_DIALECT
329 dialect_number = ASSEMBLER_DIALECT;
333 /* Called at end of source file,
334 to output the block-profiling table for this entire compilation. */
338 const char *filename;
342 if (profile_block_flag || profile_arc_flag)
345 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
349 int long_bytes = LONG_TYPE_SIZE / BITS_PER_UNIT;
350 int pointer_bytes = POINTER_SIZE / BITS_PER_UNIT;
352 if (profile_block_flag)
353 size = long_bytes * count_basic_blocks;
355 size = long_bytes * count_instrumented_arcs;
358 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
359 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
360 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
364 /* Output the main header, of 11 words:
365 0: 1 if this file is initialized, else 0.
366 1: address of file name (LPBX1).
367 2: address of table of counts (LPBX2).
368 3: number of counts in the table.
369 4: always 0, for compatibility with Sun.
371 The following are GNU extensions:
373 5: address of table of start addrs of basic blocks (LPBX3).
374 6: Number of bytes in this header.
375 7: address of table of function names (LPBX4).
376 8: address of table of line numbers (LPBX5) or 0.
377 9: address of table of file names (LPBX6) or 0.
378 10: space reserved for basic block profiling. */
380 ASM_OUTPUT_ALIGN (asm_out_file, align);
382 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
384 assemble_integer (const0_rtx, long_bytes, 1);
386 /* address of filename */
387 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
388 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
390 /* address of count table */
391 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
392 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
394 /* count of the # of basic blocks or # of instrumented arcs */
395 if (profile_block_flag)
396 assemble_integer (GEN_INT (count_basic_blocks), long_bytes, 1);
398 assemble_integer (GEN_INT (count_instrumented_arcs), long_bytes,
401 /* zero word (link field) */
402 assemble_integer (const0_rtx, pointer_bytes, 1);
404 /* address of basic block start address table */
405 if (profile_block_flag)
407 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
408 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
412 assemble_integer (const0_rtx, pointer_bytes, 1);
414 /* byte count for extended structure. */
415 assemble_integer (GEN_INT (11 * UNITS_PER_WORD), long_bytes, 1);
417 /* address of function name table */
418 if (profile_block_flag)
420 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
421 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
425 assemble_integer (const0_rtx, pointer_bytes, 1);
427 /* address of line number and filename tables if debugging. */
428 if (write_symbols != NO_DEBUG && profile_block_flag)
430 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
431 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
433 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
434 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
439 assemble_integer (const0_rtx, pointer_bytes, 1);
440 assemble_integer (const0_rtx, pointer_bytes, 1);
443 /* space for extension ptr (link field) */
444 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
446 /* Output the file name changing the suffix to .d for Sun tcov
448 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
450 char *cwd = getpwd ();
451 int len = strlen (filename) + strlen (cwd) + 1;
452 char *data_file = (char *) alloca (len + 4);
454 strcpy (data_file, cwd);
455 strcat (data_file, "/");
456 strcat (data_file, filename);
457 strip_off_ending (data_file, len);
458 if (profile_block_flag)
459 strcat (data_file, ".d");
461 strcat (data_file, ".da");
462 assemble_string (data_file, strlen (data_file) + 1);
465 /* Make space for the table of counts. */
468 /* Realign data section. */
469 ASM_OUTPUT_ALIGN (asm_out_file, align);
470 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
472 assemble_zeros (size);
476 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
477 #ifdef ASM_OUTPUT_SHARED_LOCAL
478 if (flag_shared_data)
479 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
482 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
483 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
486 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
487 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
490 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
495 /* Output any basic block strings */
496 if (profile_block_flag)
498 readonly_data_section ();
501 ASM_OUTPUT_ALIGN (asm_out_file, align);
502 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
504 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC",
506 assemble_string (sptr->string, sptr->length);
511 /* Output the table of addresses. */
512 if (profile_block_flag)
514 /* Realign in new section */
515 ASM_OUTPUT_ALIGN (asm_out_file, align);
516 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
517 for (i = 0; i < count_basic_blocks; i++)
519 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
520 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
525 /* Output the table of function names. */
526 if (profile_block_flag)
528 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
529 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
531 if (ptr->func_label_num >= 0)
533 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
534 ptr->func_label_num);
535 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
539 assemble_integer (const0_rtx, pointer_bytes, 1);
542 for ( ; i < count_basic_blocks; i++)
543 assemble_integer (const0_rtx, pointer_bytes, 1);
546 if (write_symbols != NO_DEBUG && profile_block_flag)
548 /* Output the table of line numbers. */
549 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
550 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
551 assemble_integer (GEN_INT (ptr->line_num), long_bytes, 1);
553 for ( ; i < count_basic_blocks; i++)
554 assemble_integer (const0_rtx, long_bytes, 1);
556 /* Output the table of file names. */
557 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
558 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
560 if (ptr->file_label_num >= 0)
562 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
563 ptr->file_label_num);
564 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
568 assemble_integer (const0_rtx, pointer_bytes, 1);
571 for ( ; i < count_basic_blocks; i++)
572 assemble_integer (const0_rtx, pointer_bytes, 1);
575 /* End with the address of the table of addresses,
576 so we can find it easily, as the last word in the file's text. */
577 if (profile_block_flag)
579 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
580 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
586 /* Enable APP processing of subsequent output.
587 Used before the output from an `asm' statement. */
594 fputs (ASM_APP_ON, asm_out_file);
599 /* Disable APP processing of subsequent output.
600 Called from varasm.c before most kinds of output. */
607 fputs (ASM_APP_OFF, asm_out_file);
612 /* Return the number of slots filled in the current
613 delayed branch sequence (we don't count the insn needing the
614 delay slot). Zero if not in a delayed branch sequence. */
618 dbr_sequence_length ()
620 if (final_sequence != 0)
621 return XVECLEN (final_sequence, 0) - 1;
627 /* The next two pages contain routines used to compute the length of an insn
628 and to shorten branches. */
630 /* Arrays for insn lengths, and addresses. The latter is referenced by
631 `insn_current_length'. */
633 static short *insn_lengths;
636 /* Max uid for which the above arrays are valid. */
637 static int insn_lengths_max_uid;
639 /* Address of insn being processed. Used by `insn_current_length'. */
640 int insn_current_address;
642 /* Address of insn being processed in previous iteration. */
643 int insn_last_address;
645 /* konwn invariant alignment of insn being processed. */
646 int insn_current_align;
648 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
649 gives the next following alignment insn that increases the known
650 alignment, or NULL_RTX if there is no such insn.
651 For any alignment obtained this way, we can again index uid_align with
652 its uid to obtain the next following align that in turn increases the
653 alignment, till we reach NULL_RTX; the sequence obtained this way
654 for each insn we'll call the alignment chain of this insn in the following
657 struct label_alignment {
662 static rtx *uid_align;
663 static int *uid_shuid;
664 static struct label_alignment *label_align;
666 /* Indicate that branch shortening hasn't yet been done. */
685 insn_lengths_max_uid = 0;
689 free (insn_addresses);
699 /* Obtain the current length of an insn. If branch shortening has been done,
700 get its actual length. Otherwise, get its maximum length. */
703 get_attr_length (insn)
704 rtx insn ATTRIBUTE_UNUSED;
706 #ifdef HAVE_ATTR_length
711 if (insn_lengths_max_uid > INSN_UID (insn))
712 return insn_lengths[INSN_UID (insn)];
714 switch (GET_CODE (insn))
722 length = insn_default_length (insn);
726 body = PATTERN (insn);
727 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
729 /* Alignment is machine-dependent and should be handled by
733 length = insn_default_length (insn);
737 body = PATTERN (insn);
738 if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
741 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
742 length = asm_insn_count (body) * insn_default_length (insn);
743 else if (GET_CODE (body) == SEQUENCE)
744 for (i = 0; i < XVECLEN (body, 0); i++)
745 length += get_attr_length (XVECEXP (body, 0, i));
747 length = insn_default_length (insn);
754 #ifdef ADJUST_INSN_LENGTH
755 ADJUST_INSN_LENGTH (insn, length);
758 #else /* not HAVE_ATTR_length */
760 #endif /* not HAVE_ATTR_length */
763 /* Code to handle alignment inside shorten_branches. */
765 /* Here is an explanation how the algorithm in align_fuzz can give
768 Call a sequence of instructions beginning with alignment point X
769 and continuing until the next alignment point `block X'. When `X'
770 is used in an expression, it means the alignment value of the
773 Call the distance between the start of the first insn of block X, and
774 the end of the last insn of block X `IX', for the `inner size of X'.
775 This is clearly the sum of the instruction lengths.
777 Likewise with the next alignment-delimited block following X, which we
780 Call the distance between the start of the first insn of block X, and
781 the start of the first insn of block Y `OX', for the `outer size of X'.
783 The estimated padding is then OX - IX.
785 OX can be safely estimated as
790 OX = round_up(IX, X) + Y - X
792 Clearly est(IX) >= real(IX), because that only depends on the
793 instruction lengths, and those being overestimated is a given.
795 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
796 we needn't worry about that when thinking about OX.
798 When X >= Y, the alignment provided by Y adds no uncertainty factor
799 for branch ranges starting before X, so we can just round what we have.
800 But when X < Y, we don't know anything about the, so to speak,
801 `middle bits', so we have to assume the worst when aligning up from an
802 address mod X to one mod Y, which is Y - X. */
805 #define LABEL_ALIGN(LABEL) align_labels_log
808 #ifndef LABEL_ALIGN_MAX_SKIP
809 #define LABEL_ALIGN_MAX_SKIP (align_labels-1)
813 #define LOOP_ALIGN(LABEL) align_loops_log
816 #ifndef LOOP_ALIGN_MAX_SKIP
817 #define LOOP_ALIGN_MAX_SKIP (align_loops-1)
820 #ifndef LABEL_ALIGN_AFTER_BARRIER
821 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) align_jumps_log
824 #ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
825 #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP (align_jumps-1)
828 #ifndef ADDR_VEC_ALIGN
830 final_addr_vec_align (addr_vec)
833 int align = exact_log2 (GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec))));
835 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
836 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
840 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
843 #ifndef INSN_LENGTH_ALIGNMENT
844 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
847 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
849 static int min_labelno, max_labelno;
851 #define LABEL_TO_ALIGNMENT(LABEL) \
852 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
854 #define LABEL_TO_MAX_SKIP(LABEL) \
855 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
857 /* For the benefit of port specific code do this also as a function. */
859 label_to_alignment (label)
862 return LABEL_TO_ALIGNMENT (label);
865 #ifdef HAVE_ATTR_length
866 /* The differences in addresses
867 between a branch and its target might grow or shrink depending on
868 the alignment the start insn of the range (the branch for a forward
869 branch or the label for a backward branch) starts out on; if these
870 differences are used naively, they can even oscillate infinitely.
871 We therefore want to compute a 'worst case' address difference that
872 is independent of the alignment the start insn of the range end
873 up on, and that is at least as large as the actual difference.
874 The function align_fuzz calculates the amount we have to add to the
875 naively computed difference, by traversing the part of the alignment
876 chain of the start insn of the range that is in front of the end insn
877 of the range, and considering for each alignment the maximum amount
878 that it might contribute to a size increase.
880 For casesi tables, we also want to know worst case minimum amounts of
881 address difference, in case a machine description wants to introduce
882 some common offset that is added to all offsets in a table.
883 For this purpose, align_fuzz with a growth argument of 0 comuptes the
884 appropriate adjustment. */
887 /* Compute the maximum delta by which the difference of the addresses of
888 START and END might grow / shrink due to a different address for start
889 which changes the size of alignment insns between START and END.
890 KNOWN_ALIGN_LOG is the alignment known for START.
891 GROWTH should be ~0 if the objective is to compute potential code size
892 increase, and 0 if the objective is to compute potential shrink.
893 The return value is undefined for any other value of GROWTH. */
895 align_fuzz (start, end, known_align_log, growth)
900 int uid = INSN_UID (start);
902 int known_align = 1 << known_align_log;
903 int end_shuid = INSN_SHUID (end);
906 for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
908 int align_addr, new_align;
910 uid = INSN_UID (align_label);
911 align_addr = insn_addresses[uid] - insn_lengths[uid];
912 if (uid_shuid[uid] > end_shuid)
914 known_align_log = LABEL_TO_ALIGNMENT (align_label);
915 new_align = 1 << known_align_log;
916 if (new_align < known_align)
918 fuzz += (-align_addr ^ growth) & (new_align - known_align);
919 known_align = new_align;
924 /* Compute a worst-case reference address of a branch so that it
925 can be safely used in the presence of aligned labels. Since the
926 size of the branch itself is unknown, the size of the branch is
927 not included in the range. I.e. for a forward branch, the reference
928 address is the end address of the branch as known from the previous
929 branch shortening pass, minus a value to account for possible size
930 increase due to alignment. For a backward branch, it is the start
931 address of the branch as known from the current pass, plus a value
932 to account for possible size increase due to alignment.
933 NB.: Therefore, the maximum offset allowed for backward branches needs
934 to exclude the branch size. */
936 insn_current_reference_address (branch)
940 rtx seq = NEXT_INSN (PREV_INSN (branch));
941 int seq_uid = INSN_UID (seq);
942 if (GET_CODE (branch) != JUMP_INSN)
943 /* This can happen for example on the PA; the objective is to know the
944 offset to address something in front of the start of the function.
945 Thus, we can treat it like a backward branch.
946 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
947 any alignment we'd encounter, so we skip the call to align_fuzz. */
948 return insn_current_address;
949 dest = JUMP_LABEL (branch);
950 /* BRANCH has no proper alignment chain set, so use SEQ. */
951 if (INSN_SHUID (branch) < INSN_SHUID (dest))
953 /* Forward branch. */
954 return (insn_last_address + insn_lengths[seq_uid]
955 - align_fuzz (seq, dest, length_unit_log, ~0));
959 /* Backward branch. */
960 return (insn_current_address
961 + align_fuzz (dest, seq, length_unit_log, ~0));
964 #endif /* HAVE_ATTR_length */
966 /* Make a pass over all insns and compute their actual lengths by shortening
967 any branches of variable length if possible. */
969 /* Give a default value for the lowest address in a function. */
971 #ifndef FIRST_INSN_ADDRESS
972 #define FIRST_INSN_ADDRESS 0
975 /* shorten_branches might be called multiple times: for example, the SH
976 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
977 In order to do this, it needs proper length information, which it obtains
978 by calling shorten_branches. This cannot be collapsed with
979 shorten_branches itself into a single pass unless we also want to intergate
980 reorg.c, since the branch splitting exposes new instructions with delay
984 shorten_branches (first)
985 rtx first ATTRIBUTE_UNUSED;
992 #ifdef HAVE_ATTR_length
993 #define MAX_CODE_ALIGN 16
995 int something_changed = 1;
996 char *varying_length;
999 rtx align_tab[MAX_CODE_ALIGN];
1001 /* In order to make sure that all instructions have valid length info,
1002 we must split them before we compute the address/length info. */
1004 for (insn = NEXT_INSN (first); insn; insn = NEXT_INSN (insn))
1005 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1008 /* Don't split the insn if it has been deleted. */
1009 if (! INSN_DELETED_P (old))
1010 insn = try_split (PATTERN (old), old, 1);
1011 /* When not optimizing, the old insn will be still left around
1012 with only the 'deleted' bit set. Transform it into a note
1013 to avoid confusion of subsequent processing. */
1014 if (INSN_DELETED_P (old))
1016 PUT_CODE (old , NOTE);
1017 NOTE_LINE_NUMBER (old) = NOTE_INSN_DELETED;
1018 NOTE_SOURCE_FILE (old) = 0;
1023 /* We must do some computations even when not actually shortening, in
1024 order to get the alignment information for the labels. */
1026 init_insn_lengths ();
1028 /* Compute maximum UID and allocate label_align / uid_shuid. */
1029 max_uid = get_max_uid ();
1031 max_labelno = max_label_num ();
1032 min_labelno = get_first_label_num ();
1033 label_align = (struct label_alignment *)
1034 xcalloc ((max_labelno - min_labelno + 1), sizeof (struct label_alignment));
1036 uid_shuid = (int *) xmalloc (max_uid * sizeof *uid_shuid);
1038 /* Initialize label_align and set up uid_shuid to be strictly
1039 monotonically rising with insn order. */
1040 /* We use max_log here to keep track of the maximum alignment we want to
1041 impose on the next CODE_LABEL (or the current one if we are processing
1042 the CODE_LABEL itself). */
1047 for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
1051 INSN_SHUID (insn) = i++;
1052 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1054 /* reorg might make the first insn of a loop being run once only,
1055 and delete the label in front of it. Then we want to apply
1056 the loop alignment to the new label created by reorg, which
1057 is separated by the former loop start insn from the
1058 NOTE_INSN_LOOP_BEG. */
1060 else if (GET_CODE (insn) == CODE_LABEL)
1064 log = LABEL_ALIGN (insn);
1068 max_skip = LABEL_ALIGN_MAX_SKIP;
1070 next = NEXT_INSN (insn);
1071 /* ADDR_VECs only take room if read-only data goes into the text
1073 if (JUMP_TABLES_IN_TEXT_SECTION
1074 #if !defined(READONLY_DATA_SECTION)
1078 if (next && GET_CODE (next) == JUMP_INSN)
1080 rtx nextbody = PATTERN (next);
1081 if (GET_CODE (nextbody) == ADDR_VEC
1082 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1084 log = ADDR_VEC_ALIGN (next);
1088 max_skip = LABEL_ALIGN_MAX_SKIP;
1092 LABEL_TO_ALIGNMENT (insn) = max_log;
1093 LABEL_TO_MAX_SKIP (insn) = max_skip;
1097 else if (GET_CODE (insn) == BARRIER)
1101 for (label = insn; label && GET_RTX_CLASS (GET_CODE (label)) != 'i';
1102 label = NEXT_INSN (label))
1103 if (GET_CODE (label) == CODE_LABEL)
1105 log = LABEL_ALIGN_AFTER_BARRIER (insn);
1109 max_skip = LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP;
1114 /* Again, we allow NOTE_INSN_LOOP_BEG - INSN - CODE_LABEL
1115 sequences in order to handle reorg output efficiently. */
1116 else if (GET_CODE (insn) == NOTE
1117 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
1122 /* Search for the label that starts the loop.
1123 Don't skip past the end of the loop, since that could
1124 lead to putting an alignment where it does not belong.
1125 However, a label after a nested (non-)loop would be OK. */
1126 for (label = insn; label; label = NEXT_INSN (label))
1128 if (GET_CODE (label) == NOTE
1129 && NOTE_LINE_NUMBER (label) == NOTE_INSN_LOOP_BEG)
1131 else if (GET_CODE (label) == NOTE
1132 && NOTE_LINE_NUMBER (label) == NOTE_INSN_LOOP_END
1135 else if (GET_CODE (label) == CODE_LABEL)
1137 log = LOOP_ALIGN (label);
1141 max_skip = LOOP_ALIGN_MAX_SKIP;
1150 #ifdef HAVE_ATTR_length
1152 /* Allocate the rest of the arrays. */
1153 insn_lengths = (short *) xmalloc (max_uid * sizeof (short));
1154 insn_lengths_max_uid = max_uid;
1155 /* Syntax errors can lead to labels being outside of the main insn stream.
1156 Initialize insn_addresses, so that we get reproducible results. */
1157 insn_addresses = (int *) xcalloc (max_uid, sizeof (int));
1159 varying_length = (char *) xcalloc (max_uid, sizeof (char));
1161 /* Initialize uid_align. We scan instructions
1162 from end to start, and keep in align_tab[n] the last seen insn
1163 that does an alignment of at least n+1, i.e. the successor
1164 in the alignment chain for an insn that does / has a known
1166 uid_align = (rtx *) xcalloc (max_uid, sizeof *uid_align);
1168 for (i = MAX_CODE_ALIGN; --i >= 0; )
1169 align_tab[i] = NULL_RTX;
1170 seq = get_last_insn ();
1171 for (; seq; seq = PREV_INSN (seq))
1173 int uid = INSN_UID (seq);
1175 log = (GET_CODE (seq) == CODE_LABEL ? LABEL_TO_ALIGNMENT (seq) : 0);
1176 uid_align[uid] = align_tab[0];
1179 /* Found an alignment label. */
1180 uid_align[uid] = align_tab[log];
1181 for (i = log - 1; i >= 0; i--)
1185 #ifdef CASE_VECTOR_SHORTEN_MODE
1188 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1191 int min_shuid = INSN_SHUID (get_insns ()) - 1;
1192 int max_shuid = INSN_SHUID (get_last_insn ()) + 1;
1195 for (insn = first; insn != 0; insn = NEXT_INSN (insn))
1197 rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat;
1198 int len, i, min, max, insn_shuid;
1200 addr_diff_vec_flags flags;
1202 if (GET_CODE (insn) != JUMP_INSN
1203 || GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)
1205 pat = PATTERN (insn);
1206 len = XVECLEN (pat, 1);
1209 min_align = MAX_CODE_ALIGN;
1210 for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
1212 rtx lab = XEXP (XVECEXP (pat, 1, i), 0);
1213 int shuid = INSN_SHUID (lab);
1224 if (min_align > LABEL_TO_ALIGNMENT (lab))
1225 min_align = LABEL_TO_ALIGNMENT (lab);
1227 XEXP (pat, 2) = gen_rtx_LABEL_REF (VOIDmode, min_lab);
1228 XEXP (pat, 3) = gen_rtx_LABEL_REF (VOIDmode, max_lab);
1229 insn_shuid = INSN_SHUID (insn);
1230 rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0));
1231 flags.min_align = min_align;
1232 flags.base_after_vec = rel > insn_shuid;
1233 flags.min_after_vec = min > insn_shuid;
1234 flags.max_after_vec = max > insn_shuid;
1235 flags.min_after_base = min > rel;
1236 flags.max_after_base = max > rel;
1237 ADDR_DIFF_VEC_FLAGS (pat) = flags;
1240 #endif /* CASE_VECTOR_SHORTEN_MODE */
1243 /* Compute initial lengths, addresses, and varying flags for each insn. */
1244 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1246 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1248 uid = INSN_UID (insn);
1250 insn_lengths[uid] = 0;
1252 if (GET_CODE (insn) == CODE_LABEL)
1254 int log = LABEL_TO_ALIGNMENT (insn);
1257 int align = 1 << log;
1258 int new_address = (insn_current_address + align - 1) & -align;
1259 insn_lengths[uid] = new_address - insn_current_address;
1260 insn_current_address = new_address;
1264 insn_addresses[uid] = insn_current_address;
1266 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
1267 || GET_CODE (insn) == CODE_LABEL)
1269 if (INSN_DELETED_P (insn))
1272 body = PATTERN (insn);
1273 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1275 /* This only takes room if read-only data goes into the text
1277 if (JUMP_TABLES_IN_TEXT_SECTION
1278 #if !defined(READONLY_DATA_SECTION)
1282 insn_lengths[uid] = (XVECLEN (body,
1283 GET_CODE (body) == ADDR_DIFF_VEC)
1284 * GET_MODE_SIZE (GET_MODE (body)));
1285 /* Alignment is handled by ADDR_VEC_ALIGN. */
1287 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
1288 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
1289 else if (GET_CODE (body) == SEQUENCE)
1292 int const_delay_slots;
1294 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
1296 const_delay_slots = 0;
1298 /* Inside a delay slot sequence, we do not do any branch shortening
1299 if the shortening could change the number of delay slots
1301 for (i = 0; i < XVECLEN (body, 0); i++)
1303 rtx inner_insn = XVECEXP (body, 0, i);
1304 int inner_uid = INSN_UID (inner_insn);
1307 if (GET_CODE (body) == ASM_INPUT
1308 || asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
1309 inner_length = (asm_insn_count (PATTERN (inner_insn))
1310 * insn_default_length (inner_insn));
1312 inner_length = insn_default_length (inner_insn);
1314 insn_lengths[inner_uid] = inner_length;
1315 if (const_delay_slots)
1317 if ((varying_length[inner_uid]
1318 = insn_variable_length_p (inner_insn)) != 0)
1319 varying_length[uid] = 1;
1320 insn_addresses[inner_uid] = (insn_current_address +
1324 varying_length[inner_uid] = 0;
1325 insn_lengths[uid] += inner_length;
1328 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
1330 insn_lengths[uid] = insn_default_length (insn);
1331 varying_length[uid] = insn_variable_length_p (insn);
1334 /* If needed, do any adjustment. */
1335 #ifdef ADJUST_INSN_LENGTH
1336 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
1337 if (insn_lengths[uid] < 0)
1338 fatal_insn ("Negative insn length", insn);
1342 /* Now loop over all the insns finding varying length insns. For each,
1343 get the current insn length. If it has changed, reflect the change.
1344 When nothing changes for a full pass, we are done. */
1346 while (something_changed)
1348 something_changed = 0;
1349 insn_current_align = MAX_CODE_ALIGN - 1;
1350 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1352 insn = NEXT_INSN (insn))
1355 #ifdef ADJUST_INSN_LENGTH
1360 uid = INSN_UID (insn);
1362 if (GET_CODE (insn) == CODE_LABEL)
1364 int log = LABEL_TO_ALIGNMENT (insn);
1365 if (log > insn_current_align)
1367 int align = 1 << log;
1368 int new_address= (insn_current_address + align - 1) & -align;
1369 insn_lengths[uid] = new_address - insn_current_address;
1370 insn_current_align = log;
1371 insn_current_address = new_address;
1374 insn_lengths[uid] = 0;
1375 insn_addresses[uid] = insn_current_address;
1379 length_align = INSN_LENGTH_ALIGNMENT (insn);
1380 if (length_align < insn_current_align)
1381 insn_current_align = length_align;
1383 insn_last_address = insn_addresses[uid];
1384 insn_addresses[uid] = insn_current_address;
1386 #ifdef CASE_VECTOR_SHORTEN_MODE
1387 if (optimize && GET_CODE (insn) == JUMP_INSN
1388 && GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
1390 rtx body = PATTERN (insn);
1391 int old_length = insn_lengths[uid];
1392 rtx rel_lab = XEXP (XEXP (body, 0), 0);
1393 rtx min_lab = XEXP (XEXP (body, 2), 0);
1394 rtx max_lab = XEXP (XEXP (body, 3), 0);
1395 addr_diff_vec_flags flags = ADDR_DIFF_VEC_FLAGS (body);
1396 int rel_addr = insn_addresses[INSN_UID (rel_lab)];
1397 int min_addr = insn_addresses[INSN_UID (min_lab)];
1398 int max_addr = insn_addresses[INSN_UID (max_lab)];
1402 /* Try to find a known alignment for rel_lab. */
1403 for (prev = rel_lab;
1405 && ! insn_lengths[INSN_UID (prev)]
1406 && ! (varying_length[INSN_UID (prev)] & 1);
1407 prev = PREV_INSN (prev))
1408 if (varying_length[INSN_UID (prev)] & 2)
1410 rel_align = LABEL_TO_ALIGNMENT (prev);
1414 /* See the comment on addr_diff_vec_flags in rtl.h for the
1415 meaning of the flags values. base: REL_LAB vec: INSN */
1416 /* Anything after INSN has still addresses from the last
1417 pass; adjust these so that they reflect our current
1418 estimate for this pass. */
1419 if (flags.base_after_vec)
1420 rel_addr += insn_current_address - insn_last_address;
1421 if (flags.min_after_vec)
1422 min_addr += insn_current_address - insn_last_address;
1423 if (flags.max_after_vec)
1424 max_addr += insn_current_address - insn_last_address;
1425 /* We want to know the worst case, i.e. lowest possible value
1426 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1427 its offset is positive, and we have to be wary of code shrink;
1428 otherwise, it is negative, and we have to be vary of code
1430 if (flags.min_after_base)
1432 /* If INSN is between REL_LAB and MIN_LAB, the size
1433 changes we are about to make can change the alignment
1434 within the observed offset, therefore we have to break
1435 it up into two parts that are independent. */
1436 if (! flags.base_after_vec && flags.min_after_vec)
1438 min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
1439 min_addr -= align_fuzz (insn, min_lab, 0, 0);
1442 min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
1446 if (flags.base_after_vec && ! flags.min_after_vec)
1448 min_addr -= align_fuzz (min_lab, insn, 0, ~0);
1449 min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
1452 min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
1454 /* Likewise, determine the highest lowest possible value
1455 for the offset of MAX_LAB. */
1456 if (flags.max_after_base)
1458 if (! flags.base_after_vec && flags.max_after_vec)
1460 max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
1461 max_addr += align_fuzz (insn, max_lab, 0, ~0);
1464 max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
1468 if (flags.base_after_vec && ! flags.max_after_vec)
1470 max_addr += align_fuzz (max_lab, insn, 0, 0);
1471 max_addr += align_fuzz (insn, rel_lab, 0, 0);
1474 max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
1476 PUT_MODE (body, CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
1477 max_addr - rel_addr,
1479 if (JUMP_TABLES_IN_TEXT_SECTION
1480 #if !defined(READONLY_DATA_SECTION)
1486 = (XVECLEN (body, 1) * GET_MODE_SIZE (GET_MODE (body)));
1487 insn_current_address += insn_lengths[uid];
1488 if (insn_lengths[uid] != old_length)
1489 something_changed = 1;
1494 #endif /* CASE_VECTOR_SHORTEN_MODE */
1496 if (! (varying_length[uid]))
1498 insn_current_address += insn_lengths[uid];
1501 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
1505 body = PATTERN (insn);
1507 for (i = 0; i < XVECLEN (body, 0); i++)
1509 rtx inner_insn = XVECEXP (body, 0, i);
1510 int inner_uid = INSN_UID (inner_insn);
1513 insn_addresses[inner_uid] = insn_current_address;
1515 /* insn_current_length returns 0 for insns with a
1516 non-varying length. */
1517 if (! varying_length[inner_uid])
1518 inner_length = insn_lengths[inner_uid];
1520 inner_length = insn_current_length (inner_insn);
1522 if (inner_length != insn_lengths[inner_uid])
1524 insn_lengths[inner_uid] = inner_length;
1525 something_changed = 1;
1527 insn_current_address += insn_lengths[inner_uid];
1528 new_length += inner_length;
1533 new_length = insn_current_length (insn);
1534 insn_current_address += new_length;
1537 #ifdef ADJUST_INSN_LENGTH
1538 /* If needed, do any adjustment. */
1539 tmp_length = new_length;
1540 ADJUST_INSN_LENGTH (insn, new_length);
1541 insn_current_address += (new_length - tmp_length);
1544 if (new_length != insn_lengths[uid])
1546 insn_lengths[uid] = new_length;
1547 something_changed = 1;
1550 /* For a non-optimizing compile, do only a single pass. */
1555 free (varying_length);
1557 #endif /* HAVE_ATTR_length */
1560 #ifdef HAVE_ATTR_length
1561 /* Given the body of an INSN known to be generated by an ASM statement, return
1562 the number of machine instructions likely to be generated for this insn.
1563 This is used to compute its length. */
1566 asm_insn_count (body)
1572 if (GET_CODE (body) == ASM_INPUT)
1573 template = XSTR (body, 0);
1575 template = decode_asm_operands (body, NULL_PTR, NULL_PTR,
1576 NULL_PTR, NULL_PTR);
1578 for ( ; *template; template++)
1579 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
1586 /* Output assembler code for the start of a function,
1587 and initialize some of the variables in this file
1588 for the new function. The label for the function and associated
1589 assembler pseudo-ops have already been output in `assemble_start_function'.
1591 FIRST is the first insn of the rtl for the function being compiled.
1592 FILE is the file to write assembler code to.
1593 OPTIMIZE is nonzero if we should eliminate redundant
1594 test and compare insns. */
1597 final_start_function (first, file, optimize)
1600 int optimize ATTRIBUTE_UNUSED;
1604 this_is_asm_operands = 0;
1606 #ifdef NON_SAVING_SETJMP
1607 /* A function that calls setjmp should save and restore all the
1608 call-saved registers on a system where longjmp clobbers them. */
1609 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
1613 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1614 if (!call_used_regs[i])
1615 regs_ever_live[i] = 1;
1619 /* Initial line number is supposed to be output
1620 before the function's prologue and label
1621 so that the function's address will not appear to be
1622 in the last statement of the preceding function. */
1623 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1624 last_linenum = high_block_linenum = high_function_linenum
1625 = NOTE_LINE_NUMBER (first);
1627 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1628 /* Output DWARF definition of the function. */
1629 if (dwarf2out_do_frame ())
1630 dwarf2out_begin_prologue ();
1633 /* For SDB and XCOFF, the function beginning must be marked between
1634 the function label and the prologue. We always need this, even when
1635 -g1 was used. Defer on MIPS systems so that parameter descriptions
1636 follow function entry. */
1637 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
1638 if (write_symbols == SDB_DEBUG)
1639 sdbout_begin_function (last_linenum);
1642 #ifdef XCOFF_DEBUGGING_INFO
1643 if (write_symbols == XCOFF_DEBUG)
1644 xcoffout_begin_function (file, last_linenum);
1647 /* But only output line number for other debug info types if -g2
1649 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1650 output_source_line (file, first);
1652 #ifdef LEAF_REG_REMAP
1653 if (current_function_uses_only_leaf_regs)
1654 leaf_renumber_regs (first);
1657 /* The Sun386i and perhaps other machines don't work right
1658 if the profiling code comes after the prologue. */
1659 #ifdef PROFILE_BEFORE_PROLOGUE
1661 profile_function (file);
1662 #endif /* PROFILE_BEFORE_PROLOGUE */
1664 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1665 if (dwarf2out_do_frame ())
1666 dwarf2out_frame_debug (NULL_RTX);
1669 #ifdef FUNCTION_PROLOGUE
1670 /* First output the function prologue: code to set up the stack frame. */
1671 FUNCTION_PROLOGUE (file, get_frame_size ());
1674 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1675 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
1676 next_block_index = 1;
1679 /* If the machine represents the prologue as RTL, the profiling code must
1680 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1681 #ifdef HAVE_prologue
1682 if (! HAVE_prologue)
1684 profile_after_prologue (file);
1688 /* If we are doing basic block profiling, remember a printable version
1689 of the function name. */
1690 if (profile_block_flag)
1693 = add_bb_string ((*decl_printable_name) (current_function_decl, 2), FALSE);
1698 profile_after_prologue (file)
1699 FILE *file ATTRIBUTE_UNUSED;
1701 #ifdef FUNCTION_BLOCK_PROFILER
1702 if (profile_block_flag)
1704 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
1706 #endif /* FUNCTION_BLOCK_PROFILER */
1708 #ifndef PROFILE_BEFORE_PROLOGUE
1710 profile_function (file);
1711 #endif /* not PROFILE_BEFORE_PROLOGUE */
1715 profile_function (file)
1718 int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1719 #if defined(ASM_OUTPUT_REG_PUSH)
1720 #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1721 int sval = current_function_returns_struct;
1723 #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1724 int cxt = current_function_needs_context;
1726 #endif /* ASM_OUTPUT_REG_PUSH */
1729 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1730 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
1731 assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, 1);
1733 function_section (current_function_decl);
1735 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1737 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
1739 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1742 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1747 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1749 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1751 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1754 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1759 FUNCTION_PROFILER (file, profile_label_no);
1761 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1763 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1765 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1768 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1773 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1775 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1777 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1780 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1786 /* Output assembler code for the end of a function.
1787 For clarity, args are same as those of `final_start_function'
1788 even though not all of them are needed. */
1791 final_end_function (first, file, optimize)
1792 rtx first ATTRIBUTE_UNUSED;
1794 int optimize ATTRIBUTE_UNUSED;
1798 fputs (ASM_APP_OFF, file);
1802 #ifdef SDB_DEBUGGING_INFO
1803 if (write_symbols == SDB_DEBUG)
1804 sdbout_end_function (high_function_linenum);
1807 #ifdef DWARF_DEBUGGING_INFO
1808 if (write_symbols == DWARF_DEBUG)
1809 dwarfout_end_function ();
1812 #ifdef XCOFF_DEBUGGING_INFO
1813 if (write_symbols == XCOFF_DEBUG)
1814 xcoffout_end_function (file, high_function_linenum);
1817 #ifdef FUNCTION_EPILOGUE
1818 /* Finally, output the function epilogue:
1819 code to restore the stack frame and return to the caller. */
1820 FUNCTION_EPILOGUE (file, get_frame_size ());
1823 #ifdef SDB_DEBUGGING_INFO
1824 if (write_symbols == SDB_DEBUG)
1825 sdbout_end_epilogue ();
1828 #ifdef DWARF_DEBUGGING_INFO
1829 if (write_symbols == DWARF_DEBUG)
1830 dwarfout_end_epilogue ();
1833 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1834 if (dwarf2out_do_frame ())
1835 dwarf2out_end_epilogue ();
1838 #ifdef XCOFF_DEBUGGING_INFO
1839 if (write_symbols == XCOFF_DEBUG)
1840 xcoffout_end_epilogue (file);
1843 bb_func_label_num = -1; /* not in function, nuke label # */
1845 /* If FUNCTION_EPILOGUE is not defined, then the function body
1846 itself contains return instructions wherever needed. */
1849 /* Add a block to the linked list that remembers the current line/file/function
1850 for basic block profiling. Emit the label in front of the basic block and
1851 the instructions that increment the count field. */
1857 struct bb_list *ptr = (struct bb_list *) permalloc (sizeof (struct bb_list));
1859 /* Add basic block to linked list. */
1861 ptr->line_num = last_linenum;
1862 ptr->file_label_num = bb_file_label_num;
1863 ptr->func_label_num = bb_func_label_num;
1865 bb_tail = &ptr->next;
1867 /* Enable the table of basic-block use counts
1868 to point at the code it applies to. */
1869 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1871 /* Before first insn of this basic block, increment the
1872 count of times it was entered. */
1873 #ifdef BLOCK_PROFILER
1874 BLOCK_PROFILER (file, count_basic_blocks);
1881 count_basic_blocks++;
1884 /* Add a string to be used for basic block profiling. */
1887 add_bb_string (string, perm_p)
1892 struct bb_str *ptr = 0;
1896 string = "<unknown>";
1900 /* Allocate a new string if the current string isn't permanent. If
1901 the string is permanent search for the same string in other
1904 len = strlen (string) + 1;
1907 char *p = (char *) permalloc (len);
1908 bcopy (string, p, len);
1912 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1913 if (ptr->string == string)
1916 /* Allocate a new string block if we need to. */
1919 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1922 ptr->label_num = sbb_label_num++;
1923 ptr->string = string;
1925 sbb_tail = &ptr->next;
1928 return ptr->label_num;
1932 /* Output assembler code for some insns: all or part of a function.
1933 For description of args, see `final_start_function', above.
1935 PRESCAN is 1 if we are not really outputting,
1936 just scanning as if we were outputting.
1937 Prescanning deletes and rearranges insns just like ordinary output.
1938 PRESCAN is -2 if we are outputting after having prescanned.
1939 In this case, don't try to delete or rearrange insns
1940 because that has already been done.
1941 Prescanning is done only on certain machines. */
1944 final (first, file, optimize, prescan)
1954 last_ignored_compare = 0;
1957 check_exception_handler_labels ();
1959 /* Make a map indicating which line numbers appear in this function.
1960 When producing SDB debugging info, delete troublesome line number
1961 notes from inlined functions in other files as well as duplicate
1962 line number notes. */
1963 #ifdef SDB_DEBUGGING_INFO
1964 if (write_symbols == SDB_DEBUG)
1967 for (insn = first; insn; insn = NEXT_INSN (insn))
1968 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1970 if ((RTX_INTEGRATED_P (insn)
1971 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1973 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1974 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1976 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1977 NOTE_SOURCE_FILE (insn) = 0;
1981 if (NOTE_LINE_NUMBER (insn) > max_line)
1982 max_line = NOTE_LINE_NUMBER (insn);
1988 for (insn = first; insn; insn = NEXT_INSN (insn))
1989 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1990 max_line = NOTE_LINE_NUMBER (insn);
1993 line_note_exists = (char *) oballoc (max_line + 1);
1994 bzero (line_note_exists, max_line + 1);
1996 for (insn = first; insn; insn = NEXT_INSN (insn))
1998 if (INSN_UID (insn) > max_uid) /* find largest UID */
1999 max_uid = INSN_UID (insn);
2000 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
2001 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
2003 /* If CC tracking across branches is enabled, record the insn which
2004 jumps to each branch only reached from one place. */
2005 if (optimize && GET_CODE (insn) == JUMP_INSN)
2007 rtx lab = JUMP_LABEL (insn);
2008 if (lab && LABEL_NUSES (lab) == 1)
2010 LABEL_REFS (lab) = insn;
2016 /* Initialize insn_eh_region table if eh is being used. */
2018 init_insn_eh_region (first, max_uid);
2024 /* Output the insns. */
2025 for (insn = NEXT_INSN (first); insn;)
2027 #ifdef HAVE_ATTR_length
2028 insn_current_address = insn_addresses[INSN_UID (insn)];
2030 insn = final_scan_insn (insn, file, optimize, prescan, 0);
2033 /* Do basic-block profiling here
2034 if the last insn was a conditional branch. */
2035 if (profile_block_flag && new_block)
2038 free_insn_eh_region ();
2042 get_insn_template (code, insn)
2046 const void *output = insn_data[code].output;
2047 switch (insn_data[code].output_format)
2049 case INSN_OUTPUT_FORMAT_SINGLE:
2050 return (const char *) output;
2051 case INSN_OUTPUT_FORMAT_MULTI:
2052 return ((const char * const *) output)[which_alternative];
2053 case INSN_OUTPUT_FORMAT_FUNCTION:
2056 return (* (insn_output_fn) output) (recog_data.operand, insn);
2062 /* The final scan for one insn, INSN.
2063 Args are same as in `final', except that INSN
2064 is the insn being scanned.
2065 Value returned is the next insn to be scanned.
2067 NOPEEPHOLES is the flag to disallow peephole processing (currently
2068 used for within delayed branch sequence output). */
2071 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
2074 int optimize ATTRIBUTE_UNUSED;
2076 int nopeepholes ATTRIBUTE_UNUSED;
2084 /* Ignore deleted insns. These can occur when we split insns (due to a
2085 template of "#") while not optimizing. */
2086 if (INSN_DELETED_P (insn))
2087 return NEXT_INSN (insn);
2089 switch (GET_CODE (insn))
2095 /* Align the beginning of a loop, for higher speed
2096 on certain machines. */
2098 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
2099 break; /* This used to depend on optimize, but that was bogus. */
2100 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END)
2103 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG
2104 && ! exceptions_via_longjmp)
2106 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHB", NOTE_EH_HANDLER (insn));
2107 if (! flag_new_exceptions)
2108 add_eh_table_entry (NOTE_EH_HANDLER (insn));
2109 #ifdef ASM_OUTPUT_EH_REGION_BEG
2110 ASM_OUTPUT_EH_REGION_BEG (file, NOTE_EH_HANDLER (insn));
2115 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END
2116 && ! exceptions_via_longjmp)
2118 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHE", NOTE_EH_HANDLER (insn));
2119 if (flag_new_exceptions)
2120 add_eh_table_entry (NOTE_EH_HANDLER (insn));
2121 #ifdef ASM_OUTPUT_EH_REGION_END
2122 ASM_OUTPUT_EH_REGION_END (file, NOTE_EH_HANDLER (insn));
2127 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
2129 #ifdef FUNCTION_END_PROLOGUE
2130 FUNCTION_END_PROLOGUE (file);
2132 profile_after_prologue (file);
2136 #ifdef FUNCTION_BEGIN_EPILOGUE
2137 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
2139 FUNCTION_BEGIN_EPILOGUE (file);
2144 if (write_symbols == NO_DEBUG)
2146 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
2148 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
2149 /* MIPS stabs require the parameter descriptions to be after the
2150 function entry point rather than before. */
2151 if (write_symbols == SDB_DEBUG)
2152 sdbout_begin_function (last_linenum);
2155 #ifdef DWARF_DEBUGGING_INFO
2156 /* This outputs a marker where the function body starts, so it
2157 must be after the prologue. */
2158 if (write_symbols == DWARF_DEBUG)
2159 dwarfout_begin_function ();
2163 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED)
2164 break; /* An insn that was "deleted" */
2167 fputs (ASM_APP_OFF, file);
2170 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG
2171 && (debug_info_level == DINFO_LEVEL_NORMAL
2172 || debug_info_level == DINFO_LEVEL_VERBOSE
2173 || write_symbols == DWARF_DEBUG
2174 || write_symbols == DWARF2_DEBUG))
2176 /* Beginning of a symbol-block. Assign it a sequence number
2177 and push the number onto the stack PENDING_BLOCKS. */
2179 if (block_depth == max_block_depth)
2181 /* PENDING_BLOCKS is full; make it longer. */
2182 max_block_depth *= 2;
2184 = (int *) xrealloc (pending_blocks,
2185 max_block_depth * sizeof (int));
2187 pending_blocks[block_depth++] = next_block_index;
2189 high_block_linenum = last_linenum;
2191 /* Output debugging info about the symbol-block beginning. */
2193 #ifdef SDB_DEBUGGING_INFO
2194 if (write_symbols == SDB_DEBUG)
2195 sdbout_begin_block (file, last_linenum, next_block_index);
2197 #ifdef XCOFF_DEBUGGING_INFO
2198 if (write_symbols == XCOFF_DEBUG)
2199 xcoffout_begin_block (file, last_linenum, next_block_index);
2201 #ifdef DBX_DEBUGGING_INFO
2202 if (write_symbols == DBX_DEBUG)
2203 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", next_block_index);
2205 #ifdef DWARF_DEBUGGING_INFO
2206 if (write_symbols == DWARF_DEBUG)
2207 dwarfout_begin_block (next_block_index);
2209 #ifdef DWARF2_DEBUGGING_INFO
2210 if (write_symbols == DWARF2_DEBUG)
2211 dwarf2out_begin_block (next_block_index);
2216 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END
2217 && (debug_info_level == DINFO_LEVEL_NORMAL
2218 || debug_info_level == DINFO_LEVEL_VERBOSE
2219 || write_symbols == DWARF_DEBUG
2220 || write_symbols == DWARF2_DEBUG))
2222 /* End of a symbol-block. Pop its sequence number off
2223 PENDING_BLOCKS and output debugging info based on that. */
2226 if (block_depth < 0)
2229 #ifdef XCOFF_DEBUGGING_INFO
2230 if (write_symbols == XCOFF_DEBUG)
2231 xcoffout_end_block (file, high_block_linenum,
2232 pending_blocks[block_depth]);
2234 #ifdef DBX_DEBUGGING_INFO
2235 if (write_symbols == DBX_DEBUG)
2236 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE",
2237 pending_blocks[block_depth]);
2239 #ifdef SDB_DEBUGGING_INFO
2240 if (write_symbols == SDB_DEBUG)
2241 sdbout_end_block (file, high_block_linenum,
2242 pending_blocks[block_depth]);
2244 #ifdef DWARF_DEBUGGING_INFO
2245 if (write_symbols == DWARF_DEBUG)
2246 dwarfout_end_block (pending_blocks[block_depth]);
2248 #ifdef DWARF2_DEBUGGING_INFO
2249 if (write_symbols == DWARF2_DEBUG)
2250 dwarf2out_end_block (pending_blocks[block_depth]);
2253 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL
2254 && (debug_info_level == DINFO_LEVEL_NORMAL
2255 || debug_info_level == DINFO_LEVEL_VERBOSE))
2257 #ifdef DWARF_DEBUGGING_INFO
2258 if (write_symbols == DWARF_DEBUG)
2259 dwarfout_label (insn);
2261 #ifdef DWARF2_DEBUGGING_INFO
2262 if (write_symbols == DWARF2_DEBUG)
2263 dwarf2out_label (insn);
2266 else if (NOTE_LINE_NUMBER (insn) > 0)
2267 /* This note is a line-number. */
2271 #if 0 /* This is what we used to do. */
2272 output_source_line (file, insn);
2276 /* If there is anything real after this note,
2277 output it. If another line note follows, omit this one. */
2278 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
2280 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
2282 /* These types of notes can be significant
2283 so make sure the preceding line number stays. */
2284 else if (GET_CODE (note) == NOTE
2285 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
2286 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
2287 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
2289 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
2291 /* Another line note follows; we can delete this note
2292 if no intervening line numbers have notes elsewhere. */
2294 for (num = NOTE_LINE_NUMBER (insn) + 1;
2295 num < NOTE_LINE_NUMBER (note);
2297 if (line_note_exists[num])
2300 if (num >= NOTE_LINE_NUMBER (note))
2306 /* Output this line note
2307 if it is the first or the last line note in a row. */
2309 output_source_line (file, insn);
2314 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2315 /* If we push arguments, we need to check all insns for stack
2317 if (dwarf2out_do_frame ())
2318 dwarf2out_frame_debug (insn);
2323 /* The target port might emit labels in the output function for
2324 some insn, e.g. sh.c output_branchy_insn. */
2325 if (CODE_LABEL_NUMBER (insn) <= max_labelno)
2327 int align = LABEL_TO_ALIGNMENT (insn);
2328 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2329 int max_skip = LABEL_TO_MAX_SKIP (insn);
2332 if (align && NEXT_INSN (insn))
2333 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2334 ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip);
2336 ASM_OUTPUT_ALIGN (file, align);
2341 /* If this label is reached from only one place, set the condition
2342 codes from the instruction just before the branch. */
2344 /* Disabled because some insns set cc_status in the C output code
2345 and NOTICE_UPDATE_CC alone can set incorrect status. */
2346 if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
2348 rtx jump = LABEL_REFS (insn);
2349 rtx barrier = prev_nonnote_insn (insn);
2351 /* If the LABEL_REFS field of this label has been set to point
2352 at a branch, the predecessor of the branch is a regular
2353 insn, and that branch is the only way to reach this label,
2354 set the condition codes based on the branch and its
2356 if (barrier && GET_CODE (barrier) == BARRIER
2357 && jump && GET_CODE (jump) == JUMP_INSN
2358 && (prev = prev_nonnote_insn (jump))
2359 && GET_CODE (prev) == INSN)
2361 NOTICE_UPDATE_CC (PATTERN (prev), prev);
2362 NOTICE_UPDATE_CC (PATTERN (jump), jump);
2370 #ifdef FINAL_PRESCAN_LABEL
2371 FINAL_PRESCAN_INSN (insn, NULL_PTR, 0);
2374 #ifdef SDB_DEBUGGING_INFO
2375 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
2376 sdbout_label (insn);
2378 #ifdef DWARF_DEBUGGING_INFO
2379 if (write_symbols == DWARF_DEBUG && LABEL_NAME (insn))
2380 dwarfout_label (insn);
2382 #ifdef DWARF2_DEBUGGING_INFO
2383 if (write_symbols == DWARF2_DEBUG && LABEL_NAME (insn))
2384 dwarf2out_label (insn);
2388 fputs (ASM_APP_OFF, file);
2391 if (NEXT_INSN (insn) != 0
2392 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
2394 rtx nextbody = PATTERN (NEXT_INSN (insn));
2396 /* If this label is followed by a jump-table,
2397 make sure we put the label in the read-only section. Also
2398 possibly write the label and jump table together. */
2400 if (GET_CODE (nextbody) == ADDR_VEC
2401 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
2403 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2404 /* In this case, the case vector is being moved by the
2405 target, so don't output the label at all. Leave that
2406 to the back end macros. */
2408 if (! JUMP_TABLES_IN_TEXT_SECTION)
2410 readonly_data_section ();
2411 #ifdef READONLY_DATA_SECTION
2412 ASM_OUTPUT_ALIGN (file,
2413 exact_log2 (BIGGEST_ALIGNMENT
2415 #endif /* READONLY_DATA_SECTION */
2418 function_section (current_function_decl);
2420 #ifdef ASM_OUTPUT_CASE_LABEL
2421 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
2424 if (LABEL_ALTERNATE_NAME (insn))
2425 ASM_OUTPUT_ALTERNATE_LABEL_NAME (file, insn);
2427 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2433 if (LABEL_ALTERNATE_NAME (insn))
2434 ASM_OUTPUT_ALTERNATE_LABEL_NAME (file, insn);
2436 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2441 register rtx body = PATTERN (insn);
2442 int insn_code_number;
2443 const char *template;
2448 /* An INSN, JUMP_INSN or CALL_INSN.
2449 First check for special kinds that recog doesn't recognize. */
2451 if (GET_CODE (body) == USE /* These are just declarations */
2452 || GET_CODE (body) == CLOBBER)
2456 /* If there is a REG_CC_SETTER note on this insn, it means that
2457 the setting of the condition code was done in the delay slot
2458 of the insn that branched here. So recover the cc status
2459 from the insn that set it. */
2461 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
2464 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
2465 cc_prev_status = cc_status;
2469 /* Detect insns that are really jump-tables
2470 and output them as such. */
2472 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
2474 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2475 register int vlen, idx;
2483 fputs (ASM_APP_OFF, file);
2487 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2488 if (GET_CODE (body) == ADDR_VEC)
2490 #ifdef ASM_OUTPUT_ADDR_VEC
2491 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2498 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2499 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2505 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
2506 for (idx = 0; idx < vlen; idx++)
2508 if (GET_CODE (body) == ADDR_VEC)
2510 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2511 ASM_OUTPUT_ADDR_VEC_ELT
2512 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
2519 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2520 ASM_OUTPUT_ADDR_DIFF_ELT
2523 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
2524 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
2530 #ifdef ASM_OUTPUT_CASE_END
2531 ASM_OUTPUT_CASE_END (file,
2532 CODE_LABEL_NUMBER (PREV_INSN (insn)),
2537 function_section (current_function_decl);
2542 /* Do basic-block profiling when we reach a new block.
2543 Done here to avoid jump tables. */
2544 if (profile_block_flag && new_block)
2547 if (GET_CODE (body) == ASM_INPUT)
2549 /* There's no telling what that did to the condition codes. */
2555 fputs (ASM_APP_ON, file);
2558 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
2562 /* Detect `asm' construct with operands. */
2563 if (asm_noperands (body) >= 0)
2565 unsigned int noperands = asm_noperands (body);
2566 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
2569 /* There's no telling what that did to the condition codes. */
2576 fputs (ASM_APP_ON, file);
2580 /* Get out the operand values. */
2581 string = decode_asm_operands (body, ops, NULL_PTR,
2582 NULL_PTR, NULL_PTR);
2583 /* Inhibit aborts on what would otherwise be compiler bugs. */
2584 insn_noperands = noperands;
2585 this_is_asm_operands = insn;
2587 /* Output the insn using them. */
2588 output_asm_insn (string, ops);
2589 this_is_asm_operands = 0;
2593 if (prescan <= 0 && app_on)
2595 fputs (ASM_APP_OFF, file);
2599 if (GET_CODE (body) == SEQUENCE)
2601 /* A delayed-branch sequence */
2607 final_sequence = body;
2609 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2610 force the restoration of a comparison that was previously
2611 thought unnecessary. If that happens, cancel this sequence
2612 and cause that insn to be restored. */
2614 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
2615 if (next != XVECEXP (body, 0, 1))
2621 for (i = 1; i < XVECLEN (body, 0); i++)
2623 rtx insn = XVECEXP (body, 0, i);
2624 rtx next = NEXT_INSN (insn);
2625 /* We loop in case any instruction in a delay slot gets
2628 insn = final_scan_insn (insn, file, 0, prescan, 1);
2629 while (insn != next);
2631 #ifdef DBR_OUTPUT_SEQEND
2632 DBR_OUTPUT_SEQEND (file);
2636 /* If the insn requiring the delay slot was a CALL_INSN, the
2637 insns in the delay slot are actually executed before the
2638 called function. Hence we don't preserve any CC-setting
2639 actions in these insns and the CC must be marked as being
2640 clobbered by the function. */
2641 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
2646 /* Following a conditional branch sequence, we have a new basic
2648 if (profile_block_flag)
2650 rtx insn = XVECEXP (body, 0, 0);
2651 rtx body = PATTERN (insn);
2653 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2654 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2655 || (GET_CODE (insn) == JUMP_INSN
2656 && GET_CODE (body) == PARALLEL
2657 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2658 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
2664 /* We have a real machine instruction as rtl. */
2666 body = PATTERN (insn);
2669 set = single_set(insn);
2671 /* Check for redundant test and compare instructions
2672 (when the condition codes are already set up as desired).
2673 This is done only when optimizing; if not optimizing,
2674 it should be possible for the user to alter a variable
2675 with the debugger in between statements
2676 and the next statement should reexamine the variable
2677 to compute the condition codes. */
2682 rtx set = single_set(insn);
2686 && GET_CODE (SET_DEST (set)) == CC0
2687 && insn != last_ignored_compare)
2689 if (GET_CODE (SET_SRC (set)) == SUBREG)
2690 SET_SRC (set) = alter_subreg (SET_SRC (set));
2691 else if (GET_CODE (SET_SRC (set)) == COMPARE)
2693 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
2694 XEXP (SET_SRC (set), 0)
2695 = alter_subreg (XEXP (SET_SRC (set), 0));
2696 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
2697 XEXP (SET_SRC (set), 1)
2698 = alter_subreg (XEXP (SET_SRC (set), 1));
2700 if ((cc_status.value1 != 0
2701 && rtx_equal_p (SET_SRC (set), cc_status.value1))
2702 || (cc_status.value2 != 0
2703 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
2705 /* Don't delete insn if it has an addressing side-effect. */
2706 if (! FIND_REG_INC_NOTE (insn, 0)
2707 /* or if anything in it is volatile. */
2708 && ! volatile_refs_p (PATTERN (insn)))
2710 /* We don't really delete the insn; just ignore it. */
2711 last_ignored_compare = insn;
2719 /* Following a conditional branch, we have a new basic block.
2720 But if we are inside a sequence, the new block starts after the
2721 last insn of the sequence. */
2722 if (profile_block_flag && final_sequence == 0
2723 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2724 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2725 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
2726 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2727 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
2731 /* Don't bother outputting obvious no-ops, even without -O.
2732 This optimization is fast and doesn't interfere with debugging.
2733 Don't do this if the insn is in a delay slot, since this
2734 will cause an improper number of delay insns to be written. */
2735 if (final_sequence == 0
2737 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
2738 && GET_CODE (SET_SRC (body)) == REG
2739 && GET_CODE (SET_DEST (body)) == REG
2740 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
2745 /* If this is a conditional branch, maybe modify it
2746 if the cc's are in a nonstandard state
2747 so that it accomplishes the same thing that it would
2748 do straightforwardly if the cc's were set up normally. */
2750 if (cc_status.flags != 0
2751 && GET_CODE (insn) == JUMP_INSN
2752 && GET_CODE (body) == SET
2753 && SET_DEST (body) == pc_rtx
2754 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
2755 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
2756 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
2757 /* This is done during prescan; it is not done again
2758 in final scan when prescan has been done. */
2761 /* This function may alter the contents of its argument
2762 and clear some of the cc_status.flags bits.
2763 It may also return 1 meaning condition now always true
2764 or -1 meaning condition now always false
2765 or 2 meaning condition nontrivial but altered. */
2766 register int result = alter_cond (XEXP (SET_SRC (body), 0));
2767 /* If condition now has fixed value, replace the IF_THEN_ELSE
2768 with its then-operand or its else-operand. */
2770 SET_SRC (body) = XEXP (SET_SRC (body), 1);
2772 SET_SRC (body) = XEXP (SET_SRC (body), 2);
2774 /* The jump is now either unconditional or a no-op.
2775 If it has become a no-op, don't try to output it.
2776 (It would not be recognized.) */
2777 if (SET_SRC (body) == pc_rtx)
2779 PUT_CODE (insn, NOTE);
2780 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2781 NOTE_SOURCE_FILE (insn) = 0;
2784 else if (GET_CODE (SET_SRC (body)) == RETURN)
2785 /* Replace (set (pc) (return)) with (return). */
2786 PATTERN (insn) = body = SET_SRC (body);
2788 /* Rerecognize the instruction if it has changed. */
2790 INSN_CODE (insn) = -1;
2793 /* Make same adjustments to instructions that examine the
2794 condition codes without jumping and instructions that
2795 handle conditional moves (if this machine has either one). */
2797 if (cc_status.flags != 0
2800 rtx cond_rtx, then_rtx, else_rtx;
2802 if (GET_CODE (insn) != JUMP_INSN
2803 && GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
2805 cond_rtx = XEXP (SET_SRC (set), 0);
2806 then_rtx = XEXP (SET_SRC (set), 1);
2807 else_rtx = XEXP (SET_SRC (set), 2);
2811 cond_rtx = SET_SRC (set);
2812 then_rtx = const_true_rtx;
2813 else_rtx = const0_rtx;
2816 switch (GET_CODE (cond_rtx))
2829 register int result;
2830 if (XEXP (cond_rtx, 0) != cc0_rtx)
2832 result = alter_cond (cond_rtx);
2834 validate_change (insn, &SET_SRC (set), then_rtx, 0);
2835 else if (result == -1)
2836 validate_change (insn, &SET_SRC (set), else_rtx, 0);
2837 else if (result == 2)
2838 INSN_CODE (insn) = -1;
2839 if (SET_DEST (set) == SET_SRC (set))
2841 PUT_CODE (insn, NOTE);
2842 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2843 NOTE_SOURCE_FILE (insn) = 0;
2855 #ifdef HAVE_peephole
2856 /* Do machine-specific peephole optimizations if desired. */
2858 if (optimize && !flag_no_peephole && !nopeepholes)
2860 rtx next = peephole (insn);
2861 /* When peepholing, if there were notes within the peephole,
2862 emit them before the peephole. */
2863 if (next != 0 && next != NEXT_INSN (insn))
2865 rtx prev = PREV_INSN (insn);
2868 for (note = NEXT_INSN (insn); note != next;
2869 note = NEXT_INSN (note))
2870 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2872 /* In case this is prescan, put the notes
2873 in proper position for later rescan. */
2874 note = NEXT_INSN (insn);
2875 PREV_INSN (note) = prev;
2876 NEXT_INSN (prev) = note;
2877 NEXT_INSN (PREV_INSN (next)) = insn;
2878 PREV_INSN (insn) = PREV_INSN (next);
2879 NEXT_INSN (insn) = next;
2880 PREV_INSN (next) = insn;
2883 /* PEEPHOLE might have changed this. */
2884 body = PATTERN (insn);
2888 /* Try to recognize the instruction.
2889 If successful, verify that the operands satisfy the
2890 constraints for the instruction. Crash if they don't,
2891 since `reload' should have changed them so that they do. */
2893 insn_code_number = recog_memoized (insn);
2894 extract_insn (insn);
2895 cleanup_subreg_operands (insn);
2897 if (! constrain_operands (1))
2898 fatal_insn_not_found (insn);
2900 /* Some target machines need to prescan each insn before
2903 #ifdef FINAL_PRESCAN_INSN
2904 FINAL_PRESCAN_INSN (insn, recog_data.operand, recog_data.n_operands);
2908 cc_prev_status = cc_status;
2910 /* Update `cc_status' for this instruction.
2911 The instruction's output routine may change it further.
2912 If the output routine for a jump insn needs to depend
2913 on the cc status, it should look at cc_prev_status. */
2915 NOTICE_UPDATE_CC (body, insn);
2920 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2921 /* If we push arguments, we want to know where the calls are. */
2922 if (GET_CODE (insn) == CALL_INSN && dwarf2out_do_frame ())
2923 dwarf2out_frame_debug (insn);
2926 /* Find the proper template for this insn. */
2927 template = get_insn_template (insn_code_number, insn);
2929 /* If the C code returns 0, it means that it is a jump insn
2930 which follows a deleted test insn, and that test insn
2931 needs to be reinserted. */
2934 if (prev_nonnote_insn (insn) != last_ignored_compare)
2937 return prev_nonnote_insn (insn);
2940 /* If the template is the string "#", it means that this insn must
2942 if (template[0] == '#' && template[1] == '\0')
2944 rtx new = try_split (body, insn, 0);
2946 /* If we didn't split the insn, go away. */
2947 if (new == insn && PATTERN (new) == body)
2948 fatal_insn ("Could not split insn", insn);
2950 #ifdef HAVE_ATTR_length
2951 /* This instruction should have been split in shorten_branches,
2952 to ensure that we would have valid length info for the
2964 /* Output assembler code from the template. */
2966 output_asm_insn (template, recog_data.operand);
2968 #if defined (DWARF2_UNWIND_INFO)
2969 #if !defined (ACCUMULATE_OUTGOING_ARGS)
2970 /* If we push arguments, we need to check all insns for stack
2972 if (GET_CODE (insn) == INSN && dwarf2out_do_frame ())
2973 dwarf2out_frame_debug (insn);
2975 #if defined (HAVE_prologue)
2976 /* If this insn is part of the prologue, emit DWARF v2
2978 if (RTX_FRAME_RELATED_P (insn) && dwarf2out_do_frame ())
2979 dwarf2out_frame_debug (insn);
2985 /* It's not at all clear why we did this and doing so interferes
2986 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2989 /* Mark this insn as having been output. */
2990 INSN_DELETED_P (insn) = 1;
2996 return NEXT_INSN (insn);
2999 /* Output debugging info to the assembler file FILE
3000 based on the NOTE-insn INSN, assumed to be a line number. */
3003 output_source_line (file, insn)
3004 FILE *file ATTRIBUTE_UNUSED;
3007 register char *filename = NOTE_SOURCE_FILE (insn);
3009 /* Remember filename for basic block profiling.
3010 Filenames are allocated on the permanent obstack
3011 or are passed in ARGV, so we don't have to save
3014 if (profile_block_flag && last_filename != filename)
3015 bb_file_label_num = add_bb_string (filename, TRUE);
3017 last_filename = filename;
3018 last_linenum = NOTE_LINE_NUMBER (insn);
3019 high_block_linenum = MAX (last_linenum, high_block_linenum);
3020 high_function_linenum = MAX (last_linenum, high_function_linenum);
3022 if (write_symbols != NO_DEBUG)
3024 #ifdef SDB_DEBUGGING_INFO
3025 if (write_symbols == SDB_DEBUG
3026 #if 0 /* People like having line numbers even in wrong file! */
3027 /* COFF can't handle multiple source files--lose, lose. */
3028 && !strcmp (filename, main_input_filename)
3030 /* COFF relative line numbers must be positive. */
3031 && last_linenum > sdb_begin_function_line)
3033 #ifdef ASM_OUTPUT_SOURCE_LINE
3034 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
3036 fprintf (file, "\t.ln\t%d\n",
3037 ((sdb_begin_function_line > -1)
3038 ? last_linenum - sdb_begin_function_line : 1));
3043 #if defined (DBX_DEBUGGING_INFO)
3044 if (write_symbols == DBX_DEBUG)
3045 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
3048 #if defined (XCOFF_DEBUGGING_INFO)
3049 if (write_symbols == XCOFF_DEBUG)
3050 xcoffout_source_line (file, filename, insn);
3053 #ifdef DWARF_DEBUGGING_INFO
3054 if (write_symbols == DWARF_DEBUG)
3055 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
3058 #ifdef DWARF2_DEBUGGING_INFO
3059 if (write_symbols == DWARF2_DEBUG)
3060 dwarf2out_line (filename, NOTE_LINE_NUMBER (insn));
3066 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3067 directly to the desired hard register. */
3069 cleanup_subreg_operands (insn)
3074 extract_insn (insn);
3075 for (i = 0; i < recog_data.n_operands; i++)
3077 if (GET_CODE (recog_data.operand[i]) == SUBREG)
3078 recog_data.operand[i] = alter_subreg (recog_data.operand[i]);
3079 else if (GET_CODE (recog_data.operand[i]) == PLUS
3080 || GET_CODE (recog_data.operand[i]) == MULT)
3081 recog_data.operand[i] = walk_alter_subreg (recog_data.operand[i]);
3084 for (i = 0; i < recog_data.n_dups; i++)
3086 if (GET_CODE (*recog_data.dup_loc[i]) == SUBREG)
3087 *recog_data.dup_loc[i] = alter_subreg (*recog_data.dup_loc[i]);
3088 else if (GET_CODE (*recog_data.dup_loc[i]) == PLUS
3089 || GET_CODE (*recog_data.dup_loc[i]) == MULT)
3090 *recog_data.dup_loc[i] = walk_alter_subreg (*recog_data.dup_loc[i]);
3094 /* If X is a SUBREG, replace it with a REG or a MEM,
3095 based on the thing it is a subreg of. */
3101 register rtx y = SUBREG_REG (x);
3103 if (GET_CODE (y) == SUBREG)
3104 y = alter_subreg (y);
3106 /* If reload is operating, we may be replacing inside this SUBREG.
3107 Check for that and make a new one if so. */
3108 if (reload_in_progress && find_replacement (&SUBREG_REG (x)) != 0)
3111 if (GET_CODE (y) == REG)
3114 /* If the word size is larger than the size of this register,
3115 adjust the register number to compensate. */
3116 /* ??? Note that this just catches stragglers created by/for
3117 integrate. It would be better if we either caught these
3118 earlier, or kept _all_ subregs until now and eliminate
3119 gen_lowpart and friends. */
3121 #ifdef ALTER_HARD_SUBREG
3122 regno = ALTER_HARD_SUBREG(GET_MODE (x), SUBREG_WORD (x),
3123 GET_MODE (y), REGNO (y));
3125 regno = REGNO (y) + SUBREG_WORD (x);
3129 /* This field has a different meaning for REGs and SUBREGs. Make sure
3133 else if (GET_CODE (y) == MEM)
3135 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
3136 if (BYTES_BIG_ENDIAN)
3137 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
3138 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
3140 MEM_COPY_ATTRIBUTES (x, y);
3141 MEM_ALIAS_SET (x) = MEM_ALIAS_SET (y);
3142 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
3148 /* Do alter_subreg on all the SUBREGs contained in X. */
3151 walk_alter_subreg (x)
3154 switch (GET_CODE (x))
3158 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3159 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
3163 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3167 return alter_subreg (x);
3178 /* Given BODY, the body of a jump instruction, alter the jump condition
3179 as required by the bits that are set in cc_status.flags.
3180 Not all of the bits there can be handled at this level in all cases.
3182 The value is normally 0.
3183 1 means that the condition has become always true.
3184 -1 means that the condition has become always false.
3185 2 means that COND has been altered. */
3193 if (cc_status.flags & CC_REVERSED)
3196 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
3199 if (cc_status.flags & CC_INVERTED)
3202 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
3205 if (cc_status.flags & CC_NOT_POSITIVE)
3206 switch (GET_CODE (cond))
3211 /* Jump becomes unconditional. */
3217 /* Jump becomes no-op. */
3221 PUT_CODE (cond, EQ);
3226 PUT_CODE (cond, NE);
3234 if (cc_status.flags & CC_NOT_NEGATIVE)
3235 switch (GET_CODE (cond))
3239 /* Jump becomes unconditional. */
3244 /* Jump becomes no-op. */
3249 PUT_CODE (cond, EQ);
3255 PUT_CODE (cond, NE);
3263 if (cc_status.flags & CC_NO_OVERFLOW)
3264 switch (GET_CODE (cond))
3267 /* Jump becomes unconditional. */
3271 PUT_CODE (cond, EQ);
3276 PUT_CODE (cond, NE);
3281 /* Jump becomes no-op. */
3288 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
3289 switch (GET_CODE (cond))
3295 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
3300 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
3305 if (cc_status.flags & CC_NOT_SIGNED)
3306 /* The flags are valid if signed condition operators are converted
3308 switch (GET_CODE (cond))
3311 PUT_CODE (cond, LEU);
3316 PUT_CODE (cond, LTU);
3321 PUT_CODE (cond, GTU);
3326 PUT_CODE (cond, GEU);
3338 /* Report inconsistency between the assembler template and the operands.
3339 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3342 output_operand_lossage (msgid)
3345 if (this_is_asm_operands)
3346 error_for_asm (this_is_asm_operands, "invalid `asm': %s", _(msgid));
3349 error ("output_operand: %s", _(msgid));
3354 /* Output of assembler code from a template, and its subroutines. */
3356 /* Output text from TEMPLATE to the assembler output file,
3357 obeying %-directions to substitute operands taken from
3358 the vector OPERANDS.
3360 %N (for N a digit) means print operand N in usual manner.
3361 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3362 and print the label name with no punctuation.
3363 %cN means require operand N to be a constant
3364 and print the constant expression with no punctuation.
3365 %aN means expect operand N to be a memory address
3366 (not a memory reference!) and print a reference
3368 %nN means expect operand N to be a constant
3369 and print a constant expression for minus the value
3370 of the operand, with no other punctuation. */
3375 if (flag_print_asm_name)
3377 /* Annotate the assembly with a comment describing the pattern and
3378 alternative used. */
3381 register int num = INSN_CODE (debug_insn);
3382 fprintf (asm_out_file, "\t%s %d\t%s",
3383 ASM_COMMENT_START, INSN_UID (debug_insn),
3384 insn_data[num].name);
3385 if (insn_data[num].n_alternatives > 1)
3386 fprintf (asm_out_file, "/%d", which_alternative + 1);
3387 #ifdef HAVE_ATTR_length
3388 fprintf (asm_out_file, "\t[length = %d]",
3389 get_attr_length (debug_insn));
3391 /* Clear this so only the first assembler insn
3392 of any rtl insn will get the special comment for -dp. */
3399 output_asm_insn (template, operands)
3400 const char *template;
3403 register const char *p;
3406 /* An insn may return a null string template
3407 in a case where no assembler code is needed. */
3412 putc ('\t', asm_out_file);
3414 #ifdef ASM_OUTPUT_OPCODE
3415 ASM_OUTPUT_OPCODE (asm_out_file, p);
3423 putc (c, asm_out_file);
3424 #ifdef ASM_OUTPUT_OPCODE
3425 while ((c = *p) == '\t')
3427 putc (c, asm_out_file);
3430 ASM_OUTPUT_OPCODE (asm_out_file, p);
3434 #ifdef ASSEMBLER_DIALECT
3439 /* If we want the first dialect, do nothing. Otherwise, skip
3440 DIALECT_NUMBER of strings ending with '|'. */
3441 for (i = 0; i < dialect_number; i++)
3443 while (*p && *p != '}' && *p++ != '|')
3454 /* Skip to close brace. */
3455 while (*p && *p++ != '}')
3464 /* %% outputs a single %. */
3468 putc (c, asm_out_file);
3470 /* %= outputs a number which is unique to each insn in the entire
3471 compilation. This is useful for making local labels that are
3472 referred to more than once in a given insn. */
3476 fprintf (asm_out_file, "%d", insn_counter);
3478 /* % followed by a letter and some digits
3479 outputs an operand in a special way depending on the letter.
3480 Letters `acln' are implemented directly.
3481 Other letters are passed to `output_operand' so that
3482 the PRINT_OPERAND macro can define them. */
3483 else if ((*p >= 'a' && *p <= 'z')
3484 || (*p >= 'A' && *p <= 'Z'))
3489 if (! (*p >= '0' && *p <= '9'))
3490 output_operand_lossage ("operand number missing after %-letter");
3491 else if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3492 output_operand_lossage ("operand number out of range");
3493 else if (letter == 'l')
3494 output_asm_label (operands[c]);
3495 else if (letter == 'a')
3496 output_address (operands[c]);
3497 else if (letter == 'c')
3499 if (CONSTANT_ADDRESS_P (operands[c]))
3500 output_addr_const (asm_out_file, operands[c]);
3502 output_operand (operands[c], 'c');
3504 else if (letter == 'n')
3506 if (GET_CODE (operands[c]) == CONST_INT)
3507 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
3508 - INTVAL (operands[c]));
3511 putc ('-', asm_out_file);
3512 output_addr_const (asm_out_file, operands[c]);
3516 output_operand (operands[c], letter);
3518 while ((c = *p) >= '0' && c <= '9') p++;
3520 /* % followed by a digit outputs an operand the default way. */
3521 else if (*p >= '0' && *p <= '9')
3524 if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3525 output_operand_lossage ("operand number out of range");
3527 output_operand (operands[c], 0);
3528 while ((c = *p) >= '0' && c <= '9') p++;
3530 /* % followed by punctuation: output something for that
3531 punctuation character alone, with no operand.
3532 The PRINT_OPERAND macro decides what is actually done. */
3533 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3534 else if (PRINT_OPERAND_PUNCT_VALID_P ((unsigned char)*p))
3535 output_operand (NULL_RTX, *p++);
3538 output_operand_lossage ("invalid %%-code");
3542 putc (c, asm_out_file);
3547 putc ('\n', asm_out_file);
3550 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3553 output_asm_label (x)
3558 if (GET_CODE (x) == LABEL_REF)
3559 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3560 else if (GET_CODE (x) == CODE_LABEL)
3561 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3563 output_operand_lossage ("`%l' operand isn't a label");
3565 assemble_name (asm_out_file, buf);
3568 /* Print operand X using machine-dependent assembler syntax.
3569 The macro PRINT_OPERAND is defined just to control this function.
3570 CODE is a non-digit that preceded the operand-number in the % spec,
3571 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3572 between the % and the digits.
3573 When CODE is a non-letter, X is 0.
3575 The meanings of the letters are machine-dependent and controlled
3576 by PRINT_OPERAND. */
3579 output_operand (x, code)
3581 int code ATTRIBUTE_UNUSED;
3583 if (x && GET_CODE (x) == SUBREG)
3584 x = alter_subreg (x);
3586 /* If X is a pseudo-register, abort now rather than writing trash to the
3589 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
3592 PRINT_OPERAND (asm_out_file, x, code);
3595 /* Print a memory reference operand for address X
3596 using machine-dependent assembler syntax.
3597 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3603 walk_alter_subreg (x);
3604 PRINT_OPERAND_ADDRESS (asm_out_file, x);
3607 /* Print an integer constant expression in assembler syntax.
3608 Addition and subtraction are the only arithmetic
3609 that may appear in these expressions. */
3612 output_addr_const (file, x)
3619 switch (GET_CODE (x))
3629 assemble_name (file, XSTR (x, 0));
3633 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3634 assemble_name (file, buf);
3638 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3639 assemble_name (file, buf);
3643 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
3647 /* This used to output parentheses around the expression,
3648 but that does not work on the 386 (either ATT or BSD assembler). */
3649 output_addr_const (file, XEXP (x, 0));
3653 if (GET_MODE (x) == VOIDmode)
3655 /* We can use %d if the number is one word and positive. */
3656 if (CONST_DOUBLE_HIGH (x))
3657 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3658 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
3659 else if (CONST_DOUBLE_LOW (x) < 0)
3660 fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
3662 fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
3665 /* We can't handle floating point constants;
3666 PRINT_OPERAND must handle them. */
3667 output_operand_lossage ("floating constant misused");
3671 /* Some assemblers need integer constants to appear last (eg masm). */
3672 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
3674 output_addr_const (file, XEXP (x, 1));
3675 if (INTVAL (XEXP (x, 0)) >= 0)
3676 fprintf (file, "+");
3677 output_addr_const (file, XEXP (x, 0));
3681 output_addr_const (file, XEXP (x, 0));
3682 if (INTVAL (XEXP (x, 1)) >= 0)
3683 fprintf (file, "+");
3684 output_addr_const (file, XEXP (x, 1));
3689 /* Avoid outputting things like x-x or x+5-x,
3690 since some assemblers can't handle that. */
3691 x = simplify_subtraction (x);
3692 if (GET_CODE (x) != MINUS)
3695 output_addr_const (file, XEXP (x, 0));
3696 fprintf (file, "-");
3697 if (GET_CODE (XEXP (x, 1)) == CONST_INT
3698 && INTVAL (XEXP (x, 1)) < 0)
3700 fprintf (file, "%s", ASM_OPEN_PAREN);
3701 output_addr_const (file, XEXP (x, 1));
3702 fprintf (file, "%s", ASM_CLOSE_PAREN);
3705 output_addr_const (file, XEXP (x, 1));
3710 output_addr_const (file, XEXP (x, 0));
3714 output_operand_lossage ("invalid expression as operand");
3718 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3719 %R prints the value of REGISTER_PREFIX.
3720 %L prints the value of LOCAL_LABEL_PREFIX.
3721 %U prints the value of USER_LABEL_PREFIX.
3722 %I prints the value of IMMEDIATE_PREFIX.
3723 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3724 Also supported are %d, %x, %s, %e, %f, %g and %%.
3726 We handle alternate assembler dialects here, just like output_asm_insn. */
3729 asm_fprintf VPARAMS ((FILE *file, const char *p, ...))
3731 #ifndef ANSI_PROTOTYPES
3739 VA_START (argptr, p);
3741 #ifndef ANSI_PROTOTYPES
3742 file = va_arg (argptr, FILE *);
3743 p = va_arg (argptr, const char *);
3751 #ifdef ASSEMBLER_DIALECT
3756 /* If we want the first dialect, do nothing. Otherwise, skip
3757 DIALECT_NUMBER of strings ending with '|'. */
3758 for (i = 0; i < dialect_number; i++)
3760 while (*p && *p++ != '|')
3770 /* Skip to close brace. */
3771 while (*p && *p++ != '}')
3782 while ((c >= '0' && c <= '9') || c == '.')
3790 fprintf (file, "%%");
3793 case 'd': case 'i': case 'u':
3794 case 'x': case 'p': case 'X':
3798 fprintf (file, buf, va_arg (argptr, int));
3802 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3803 but we do not check for those cases. It means that the value
3804 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3806 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3808 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3818 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3825 fprintf (file, buf, va_arg (argptr, long));
3833 fprintf (file, buf, va_arg (argptr, double));
3839 fprintf (file, buf, va_arg (argptr, char *));
3843 #ifdef ASM_OUTPUT_OPCODE
3844 ASM_OUTPUT_OPCODE (asm_out_file, p);
3849 #ifdef REGISTER_PREFIX
3850 fprintf (file, "%s", REGISTER_PREFIX);
3855 #ifdef IMMEDIATE_PREFIX
3856 fprintf (file, "%s", IMMEDIATE_PREFIX);
3861 #ifdef LOCAL_LABEL_PREFIX
3862 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
3867 fputs (user_label_prefix, file);
3870 #ifdef ASM_FPRINTF_EXTENSIONS
3871 /* Upper case letters are reserved for general use by asm_fprintf
3872 and so are not available to target specific code. In order to
3873 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
3874 they are defined here. As they get turned into real extensions
3875 to asm_fprintf they should be removed from this list. */
3876 case 'A': case 'B': case 'C': case 'D': case 'E':
3877 case 'F': case 'G': case 'H': case 'J': case 'K':
3878 case 'M': case 'N': case 'P': case 'Q': case 'S':
3879 case 'T': case 'V': case 'W': case 'Y': case 'Z':
3882 ASM_FPRINTF_EXTENSIONS (file, argptr, p)
3895 /* Split up a CONST_DOUBLE or integer constant rtx
3896 into two rtx's for single words,
3897 storing in *FIRST the word that comes first in memory in the target
3898 and in *SECOND the other. */
3901 split_double (value, first, second)
3903 rtx *first, *second;
3905 if (GET_CODE (value) == CONST_INT)
3907 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3909 /* In this case the CONST_INT holds both target words.
3910 Extract the bits from it into two word-sized pieces.
3911 Sign extend each half to HOST_WIDE_INT. */
3913 /* On machines where HOST_BITS_PER_WIDE_INT == BITS_PER_WORD
3914 the shift below will cause a compiler warning, even though
3915 this code won't be executed. So put the shift amounts in
3916 variables to avoid the warning. */
3917 int rshift = HOST_BITS_PER_WIDE_INT - BITS_PER_WORD;
3918 int lshift = HOST_BITS_PER_WIDE_INT - 2 * BITS_PER_WORD;
3920 low = GEN_INT ((INTVAL (value) << rshift) >> rshift);
3921 high = GEN_INT ((INTVAL (value) << lshift) >> rshift);
3922 if (WORDS_BIG_ENDIAN)
3935 /* The rule for using CONST_INT for a wider mode
3936 is that we regard the value as signed.
3937 So sign-extend it. */
3938 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
3939 if (WORDS_BIG_ENDIAN)
3951 else if (GET_CODE (value) != CONST_DOUBLE)
3953 if (WORDS_BIG_ENDIAN)
3955 *first = const0_rtx;
3961 *second = const0_rtx;
3964 else if (GET_MODE (value) == VOIDmode
3965 /* This is the old way we did CONST_DOUBLE integers. */
3966 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
3968 /* In an integer, the words are defined as most and least significant.
3969 So order them by the target's convention. */
3970 if (WORDS_BIG_ENDIAN)
3972 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3973 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3977 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3978 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3983 #ifdef REAL_ARITHMETIC
3984 REAL_VALUE_TYPE r; long l[2];
3985 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
3987 /* Note, this converts the REAL_VALUE_TYPE to the target's
3988 format, splits up the floating point double and outputs
3989 exactly 32 bits of it into each of l[0] and l[1] --
3990 not necessarily BITS_PER_WORD bits. */
3991 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
3993 /* If 32 bits is an entire word for the target, but not for the host,
3994 then sign-extend on the host so that the number will look the same
3995 way on the host that it would on the target. See for instance
3996 simplify_unary_operation. The #if is needed to avoid compiler
3999 #if HOST_BITS_PER_LONG > 32
4000 if (BITS_PER_WORD < HOST_BITS_PER_LONG && BITS_PER_WORD == 32)
4002 if (l[0] & ((long) 1 << 31))
4003 l[0] |= ((long) (-1) << 32);
4004 if (l[1] & ((long) 1 << 31))
4005 l[1] |= ((long) (-1) << 32);
4009 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
4010 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
4012 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
4013 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
4014 && ! flag_pretend_float)
4018 #ifdef HOST_WORDS_BIG_ENDIAN
4025 /* Host and target agree => no need to swap. */
4026 *first = GEN_INT (CONST_DOUBLE_LOW (value));
4027 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
4031 *second = GEN_INT (CONST_DOUBLE_LOW (value));
4032 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
4034 #endif /* no REAL_ARITHMETIC */
4038 /* Return nonzero if this function has no function calls. */
4045 if (profile_flag || profile_block_flag || profile_arc_flag)
4048 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4050 if (GET_CODE (insn) == CALL_INSN)
4052 if (GET_CODE (insn) == INSN
4053 && GET_CODE (PATTERN (insn)) == SEQUENCE
4054 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN)
4057 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4059 if (GET_CODE (XEXP (insn, 0)) == CALL_INSN)
4061 if (GET_CODE (XEXP (insn, 0)) == INSN
4062 && GET_CODE (PATTERN (XEXP (insn, 0))) == SEQUENCE
4063 && GET_CODE (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)) == CALL_INSN)
4070 /* On some machines, a function with no call insns
4071 can run faster if it doesn't create its own register window.
4072 When output, the leaf function should use only the "output"
4073 registers. Ordinarily, the function would be compiled to use
4074 the "input" registers to find its arguments; it is a candidate
4075 for leaf treatment if it uses only the "input" registers.
4076 Leaf function treatment means renumbering so the function
4077 uses the "output" registers instead. */
4079 #ifdef LEAF_REGISTERS
4081 static char permitted_reg_in_leaf_functions[] = LEAF_REGISTERS;
4083 /* Return 1 if this function uses only the registers that can be
4084 safely renumbered. */
4087 only_leaf_regs_used ()
4091 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4092 if ((regs_ever_live[i] || global_regs[i])
4093 && ! permitted_reg_in_leaf_functions[i])
4096 if (current_function_uses_pic_offset_table
4097 && pic_offset_table_rtx != 0
4098 && GET_CODE (pic_offset_table_rtx) == REG
4099 && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4105 /* Scan all instructions and renumber all registers into those
4106 available in leaf functions. */
4109 leaf_renumber_regs (first)
4114 /* Renumber only the actual patterns.
4115 The reg-notes can contain frame pointer refs,
4116 and renumbering them could crash, and should not be needed. */
4117 for (insn = first; insn; insn = NEXT_INSN (insn))
4118 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
4119 leaf_renumber_regs_insn (PATTERN (insn));
4120 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4121 if (GET_RTX_CLASS (GET_CODE (XEXP (insn, 0))) == 'i')
4122 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
4125 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4126 available in leaf functions. */
4129 leaf_renumber_regs_insn (in_rtx)
4130 register rtx in_rtx;
4133 register const char *format_ptr;
4138 /* Renumber all input-registers into output-registers.
4139 renumbered_regs would be 1 for an output-register;
4142 if (GET_CODE (in_rtx) == REG)
4146 /* Don't renumber the same reg twice. */
4150 newreg = REGNO (in_rtx);
4151 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4152 to reach here as part of a REG_NOTE. */
4153 if (newreg >= FIRST_PSEUDO_REGISTER)
4158 newreg = LEAF_REG_REMAP (newreg);
4161 regs_ever_live[REGNO (in_rtx)] = 0;
4162 regs_ever_live[newreg] = 1;
4163 REGNO (in_rtx) = newreg;
4167 if (GET_RTX_CLASS (GET_CODE (in_rtx)) == 'i')
4169 /* Inside a SEQUENCE, we find insns.
4170 Renumber just the patterns of these insns,
4171 just as we do for the top-level insns. */
4172 leaf_renumber_regs_insn (PATTERN (in_rtx));
4176 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
4178 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
4179 switch (*format_ptr++)
4182 leaf_renumber_regs_insn (XEXP (in_rtx, i));
4186 if (NULL != XVEC (in_rtx, i))
4188 for (j = 0; j < XVECLEN (in_rtx, i); j++)
4189 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));