1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* This is the final pass of the compiler.
24 It looks at the rtl code for a function and outputs assembler code.
26 Call `final_start_function' to output the assembler code for function entry,
27 `final' to output assembler code for some RTL code,
28 `final_end_function' to output assembler code for function exit.
29 If a function is compiled in several pieces, each piece is
30 output separately with `final'.
32 Some optimizations are also done at this level.
33 Move instructions that were made unnecessary by good register allocation
34 are detected and omitted from the output. (Though most of these
35 are removed by the last jump pass.)
37 Instructions to set the condition codes are omitted when it can be
38 seen that the condition codes already had the desired values.
40 In some cases it is sufficient if the inherited condition codes
41 have related values, but this may require the following insn
42 (the one that tests the condition codes) to be modified.
44 The code for the function prologue and epilogue are generated
45 directly as assembler code by the macros FUNCTION_PROLOGUE and
46 FUNCTION_EPILOGUE. Those instructions never exist as rtl. */
55 #include "insn-config.h"
56 #include "insn-flags.h"
57 #include "insn-attr.h"
58 #include "insn-codes.h"
60 #include "conditions.h"
63 #include "hard-reg-set.h"
72 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
73 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
75 #if defined (USG) || !defined (HAVE_STAB_H)
76 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
81 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
83 #ifndef ACCUMULATE_OUTGOING_ARGS
84 #define ACCUMULATE_OUTGOING_ARGS 0
87 #ifdef XCOFF_DEBUGGING_INFO
91 #ifdef DWARF_DEBUGGING_INFO
95 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
96 #include "dwarf2out.h"
99 #ifdef SDB_DEBUGGING_INFO
103 /* .stabd code for line number. */
108 /* .stabs code for included file name. */
113 #ifndef INT_TYPE_SIZE
114 #define INT_TYPE_SIZE BITS_PER_WORD
117 #ifndef LONG_TYPE_SIZE
118 #define LONG_TYPE_SIZE BITS_PER_WORD
121 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
122 null default for it to save conditionalization later. */
123 #ifndef CC_STATUS_INIT
124 #define CC_STATUS_INIT
127 /* How to start an assembler comment. */
128 #ifndef ASM_COMMENT_START
129 #define ASM_COMMENT_START ";#"
132 /* Is the given character a logical line separator for the assembler? */
133 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
134 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
137 #ifndef JUMP_TABLES_IN_TEXT_SECTION
138 #define JUMP_TABLES_IN_TEXT_SECTION 0
141 /* Last insn processed by final_scan_insn. */
142 static rtx debug_insn = 0;
144 /* Line number of last NOTE. */
145 static int last_linenum;
147 /* Highest line number in current block. */
148 static int high_block_linenum;
150 /* Likewise for function. */
151 static int high_function_linenum;
153 /* Filename of last NOTE. */
154 static const char *last_filename;
156 /* Number of basic blocks seen so far;
157 used if profile_block_flag is set. */
158 static int count_basic_blocks;
160 /* Number of instrumented arcs when profile_arc_flag is set. */
161 extern int count_instrumented_arcs;
163 extern int length_unit_log; /* This is defined in insn-attrtab.c. */
165 /* Nonzero while outputting an `asm' with operands.
166 This means that inconsistencies are the user's fault, so don't abort.
167 The precise value is the insn being output, to pass to error_for_asm. */
168 static rtx this_is_asm_operands;
170 /* Number of operands of this insn, for an `asm' with operands. */
171 static unsigned int insn_noperands;
173 /* Compare optimization flag. */
175 static rtx last_ignored_compare = 0;
177 /* Flag indicating this insn is the start of a new basic block. */
179 static int new_block = 1;
181 /* Assign a unique number to each insn that is output.
182 This can be used to generate unique local labels. */
184 static int insn_counter = 0;
187 /* This variable contains machine-dependent flags (defined in tm.h)
188 set and examined by output routines
189 that describe how to interpret the condition codes properly. */
193 /* During output of an insn, this contains a copy of cc_status
194 from before the insn. */
196 CC_STATUS cc_prev_status;
199 /* Indexed by hardware reg number, is 1 if that register is ever
200 used in the current function.
202 In life_analysis, or in stupid_life_analysis, this is set
203 up to record the hard regs used explicitly. Reload adds
204 in the hard regs used for holding pseudo regs. Final uses
205 it to generate the code in the function prologue and epilogue
206 to save and restore registers as needed. */
208 char regs_ever_live[FIRST_PSEUDO_REGISTER];
210 /* Nonzero means current function must be given a frame pointer.
211 Set in stmt.c if anything is allocated on the stack there.
212 Set in reload1.c if anything is allocated on the stack there. */
214 int frame_pointer_needed;
216 /* Assign unique numbers to labels generated for profiling. */
218 int profile_label_no;
220 /* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen. */
222 static int block_depth;
224 /* Nonzero if have enabled APP processing of our assembler output. */
228 /* If we are outputting an insn sequence, this contains the sequence rtx.
233 #ifdef ASSEMBLER_DIALECT
235 /* Number of the assembler dialect to use, starting at 0. */
236 static int dialect_number;
239 /* Indexed by line number, nonzero if there is a note for that line. */
241 static char *line_note_exists;
243 #ifdef HAVE_conditional_execution
244 /* Nonnull if the insn currently being emitted was a COND_EXEC pattern. */
245 rtx current_insn_predicate;
248 /* Linked list to hold line numbers for each basic block. */
251 struct bb_list *next; /* pointer to next basic block */
252 int line_num; /* line number */
253 int file_label_num; /* LPBC<n> label # for stored filename */
254 int func_label_num; /* LPBC<n> label # for stored function name */
257 static struct bb_list *bb_head = 0; /* Head of basic block list */
258 static struct bb_list **bb_tail = &bb_head; /* Ptr to store next bb ptr */
259 static int bb_file_label_num = -1; /* Current label # for file */
260 static int bb_func_label_num = -1; /* Current label # for func */
262 /* Linked list to hold the strings for each file and function name output. */
265 struct bb_str *next; /* pointer to next string */
266 const char *string; /* string */
267 int label_num; /* label number */
268 int length; /* string length */
271 static struct bb_str *sbb_head = 0; /* Head of string list. */
272 static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */
273 static int sbb_label_num = 0; /* Last label used */
275 #ifdef HAVE_ATTR_length
276 static int asm_insn_count PARAMS ((rtx));
278 static void profile_function PARAMS ((FILE *));
279 static void profile_after_prologue PARAMS ((FILE *));
280 static void add_bb PARAMS ((FILE *));
281 static int add_bb_string PARAMS ((const char *, int));
282 static void output_source_line PARAMS ((FILE *, rtx));
283 static rtx walk_alter_subreg PARAMS ((rtx));
284 static void output_asm_name PARAMS ((void));
285 static void output_operand PARAMS ((rtx, int));
286 #ifdef LEAF_REGISTERS
287 static void leaf_renumber_regs PARAMS ((rtx));
290 static int alter_cond PARAMS ((rtx));
292 #ifndef ADDR_VEC_ALIGN
293 static int final_addr_vec_align PARAMS ((rtx));
295 #ifdef HAVE_ATTR_length
296 static int align_fuzz PARAMS ((rtx, rtx, int, unsigned));
299 /* Initialize data in final at the beginning of a compilation. */
302 init_final (filename)
303 const char *filename ATTRIBUTE_UNUSED;
308 #ifdef ASSEMBLER_DIALECT
309 dialect_number = ASSEMBLER_DIALECT;
313 /* Called at end of source file,
314 to output the block-profiling table for this entire compilation. */
318 const char *filename;
322 if (profile_block_flag || profile_arc_flag)
325 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
329 int long_bytes = LONG_TYPE_SIZE / BITS_PER_UNIT;
330 int pointer_bytes = POINTER_SIZE / BITS_PER_UNIT;
332 if (profile_block_flag)
333 size = long_bytes * count_basic_blocks;
335 size = long_bytes * count_instrumented_arcs;
338 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
339 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
340 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
344 /* Output the main header, of 11 words:
345 0: 1 if this file is initialized, else 0.
346 1: address of file name (LPBX1).
347 2: address of table of counts (LPBX2).
348 3: number of counts in the table.
349 4: always 0, for compatibility with Sun.
351 The following are GNU extensions:
353 5: address of table of start addrs of basic blocks (LPBX3).
354 6: Number of bytes in this header.
355 7: address of table of function names (LPBX4).
356 8: address of table of line numbers (LPBX5) or 0.
357 9: address of table of file names (LPBX6) or 0.
358 10: space reserved for basic block profiling. */
360 ASM_OUTPUT_ALIGN (asm_out_file, align);
362 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
364 assemble_integer (const0_rtx, long_bytes, 1);
366 /* address of filename */
367 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
368 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
370 /* address of count table */
371 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
372 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
374 /* count of the # of basic blocks or # of instrumented arcs */
375 if (profile_block_flag)
376 assemble_integer (GEN_INT (count_basic_blocks), long_bytes, 1);
378 assemble_integer (GEN_INT (count_instrumented_arcs), long_bytes,
381 /* zero word (link field) */
382 assemble_integer (const0_rtx, pointer_bytes, 1);
384 /* address of basic block start address table */
385 if (profile_block_flag)
387 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
388 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
392 assemble_integer (const0_rtx, pointer_bytes, 1);
394 /* byte count for extended structure. */
395 assemble_integer (GEN_INT (11 * UNITS_PER_WORD), long_bytes, 1);
397 /* address of function name table */
398 if (profile_block_flag)
400 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
401 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
405 assemble_integer (const0_rtx, pointer_bytes, 1);
407 /* address of line number and filename tables if debugging. */
408 if (write_symbols != NO_DEBUG && profile_block_flag)
410 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
411 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
413 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
414 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
419 assemble_integer (const0_rtx, pointer_bytes, 1);
420 assemble_integer (const0_rtx, pointer_bytes, 1);
423 /* space for extension ptr (link field) */
424 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
426 /* Output the file name changing the suffix to .d for Sun tcov
428 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
430 char *cwd = getpwd ();
431 int len = strlen (filename) + strlen (cwd) + 1;
432 char *data_file = (char *) alloca (len + 4);
434 strcpy (data_file, cwd);
435 strcat (data_file, "/");
436 strcat (data_file, filename);
437 strip_off_ending (data_file, len);
438 if (profile_block_flag)
439 strcat (data_file, ".d");
441 strcat (data_file, ".da");
442 assemble_string (data_file, strlen (data_file) + 1);
445 /* Make space for the table of counts. */
448 /* Realign data section. */
449 ASM_OUTPUT_ALIGN (asm_out_file, align);
450 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
452 assemble_zeros (size);
456 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
457 #ifdef ASM_OUTPUT_SHARED_LOCAL
458 if (flag_shared_data)
459 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
462 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
463 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
466 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
467 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
470 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
475 /* Output any basic block strings */
476 if (profile_block_flag)
478 readonly_data_section ();
481 ASM_OUTPUT_ALIGN (asm_out_file, align);
482 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
484 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC",
486 assemble_string (sptr->string, sptr->length);
491 /* Output the table of addresses. */
492 if (profile_block_flag)
494 /* Realign in new section */
495 ASM_OUTPUT_ALIGN (asm_out_file, align);
496 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
497 for (i = 0; i < count_basic_blocks; i++)
499 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
500 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
505 /* Output the table of function names. */
506 if (profile_block_flag)
508 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
509 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
511 if (ptr->func_label_num >= 0)
513 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
514 ptr->func_label_num);
515 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
519 assemble_integer (const0_rtx, pointer_bytes, 1);
522 for ( ; i < count_basic_blocks; i++)
523 assemble_integer (const0_rtx, pointer_bytes, 1);
526 if (write_symbols != NO_DEBUG && profile_block_flag)
528 /* Output the table of line numbers. */
529 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
530 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
531 assemble_integer (GEN_INT (ptr->line_num), long_bytes, 1);
533 for ( ; i < count_basic_blocks; i++)
534 assemble_integer (const0_rtx, long_bytes, 1);
536 /* Output the table of file names. */
537 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
538 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
540 if (ptr->file_label_num >= 0)
542 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
543 ptr->file_label_num);
544 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
548 assemble_integer (const0_rtx, pointer_bytes, 1);
551 for ( ; i < count_basic_blocks; i++)
552 assemble_integer (const0_rtx, pointer_bytes, 1);
555 /* End with the address of the table of addresses,
556 so we can find it easily, as the last word in the file's text. */
557 if (profile_block_flag)
559 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
560 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
566 /* Enable APP processing of subsequent output.
567 Used before the output from an `asm' statement. */
574 fputs (ASM_APP_ON, asm_out_file);
579 /* Disable APP processing of subsequent output.
580 Called from varasm.c before most kinds of output. */
587 fputs (ASM_APP_OFF, asm_out_file);
592 /* Return the number of slots filled in the current
593 delayed branch sequence (we don't count the insn needing the
594 delay slot). Zero if not in a delayed branch sequence. */
598 dbr_sequence_length ()
600 if (final_sequence != 0)
601 return XVECLEN (final_sequence, 0) - 1;
607 /* The next two pages contain routines used to compute the length of an insn
608 and to shorten branches. */
610 /* Arrays for insn lengths, and addresses. The latter is referenced by
611 `insn_current_length'. */
613 static short *insn_lengths;
616 /* Max uid for which the above arrays are valid. */
617 static int insn_lengths_max_uid;
619 /* Address of insn being processed. Used by `insn_current_length'. */
620 int insn_current_address;
622 /* Address of insn being processed in previous iteration. */
623 int insn_last_address;
625 /* konwn invariant alignment of insn being processed. */
626 int insn_current_align;
628 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
629 gives the next following alignment insn that increases the known
630 alignment, or NULL_RTX if there is no such insn.
631 For any alignment obtained this way, we can again index uid_align with
632 its uid to obtain the next following align that in turn increases the
633 alignment, till we reach NULL_RTX; the sequence obtained this way
634 for each insn we'll call the alignment chain of this insn in the following
637 struct label_alignment {
642 static rtx *uid_align;
643 static int *uid_shuid;
644 static struct label_alignment *label_align;
646 /* Indicate that branch shortening hasn't yet been done. */
665 insn_lengths_max_uid = 0;
669 free (insn_addresses);
679 /* Obtain the current length of an insn. If branch shortening has been done,
680 get its actual length. Otherwise, get its maximum length. */
683 get_attr_length (insn)
684 rtx insn ATTRIBUTE_UNUSED;
686 #ifdef HAVE_ATTR_length
691 if (insn_lengths_max_uid > INSN_UID (insn))
692 return insn_lengths[INSN_UID (insn)];
694 switch (GET_CODE (insn))
702 length = insn_default_length (insn);
706 body = PATTERN (insn);
707 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
709 /* Alignment is machine-dependent and should be handled by
713 length = insn_default_length (insn);
717 body = PATTERN (insn);
718 if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
721 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
722 length = asm_insn_count (body) * insn_default_length (insn);
723 else if (GET_CODE (body) == SEQUENCE)
724 for (i = 0; i < XVECLEN (body, 0); i++)
725 length += get_attr_length (XVECEXP (body, 0, i));
727 length = insn_default_length (insn);
734 #ifdef ADJUST_INSN_LENGTH
735 ADJUST_INSN_LENGTH (insn, length);
738 #else /* not HAVE_ATTR_length */
740 #endif /* not HAVE_ATTR_length */
743 /* Code to handle alignment inside shorten_branches. */
745 /* Here is an explanation how the algorithm in align_fuzz can give
748 Call a sequence of instructions beginning with alignment point X
749 and continuing until the next alignment point `block X'. When `X'
750 is used in an expression, it means the alignment value of the
753 Call the distance between the start of the first insn of block X, and
754 the end of the last insn of block X `IX', for the `inner size of X'.
755 This is clearly the sum of the instruction lengths.
757 Likewise with the next alignment-delimited block following X, which we
760 Call the distance between the start of the first insn of block X, and
761 the start of the first insn of block Y `OX', for the `outer size of X'.
763 The estimated padding is then OX - IX.
765 OX can be safely estimated as
770 OX = round_up(IX, X) + Y - X
772 Clearly est(IX) >= real(IX), because that only depends on the
773 instruction lengths, and those being overestimated is a given.
775 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
776 we needn't worry about that when thinking about OX.
778 When X >= Y, the alignment provided by Y adds no uncertainty factor
779 for branch ranges starting before X, so we can just round what we have.
780 But when X < Y, we don't know anything about the, so to speak,
781 `middle bits', so we have to assume the worst when aligning up from an
782 address mod X to one mod Y, which is Y - X. */
785 #define LABEL_ALIGN(LABEL) align_labels_log
788 #ifndef LABEL_ALIGN_MAX_SKIP
789 #define LABEL_ALIGN_MAX_SKIP (align_labels-1)
793 #define LOOP_ALIGN(LABEL) align_loops_log
796 #ifndef LOOP_ALIGN_MAX_SKIP
797 #define LOOP_ALIGN_MAX_SKIP (align_loops-1)
800 #ifndef LABEL_ALIGN_AFTER_BARRIER
801 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) align_jumps_log
804 #ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
805 #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP (align_jumps-1)
808 #ifndef ADDR_VEC_ALIGN
810 final_addr_vec_align (addr_vec)
813 int align = exact_log2 (GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec))));
815 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
816 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
820 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
823 #ifndef INSN_LENGTH_ALIGNMENT
824 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
827 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
829 static int min_labelno, max_labelno;
831 #define LABEL_TO_ALIGNMENT(LABEL) \
832 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
834 #define LABEL_TO_MAX_SKIP(LABEL) \
835 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
837 /* For the benefit of port specific code do this also as a function. */
839 label_to_alignment (label)
842 return LABEL_TO_ALIGNMENT (label);
845 #ifdef HAVE_ATTR_length
846 /* The differences in addresses
847 between a branch and its target might grow or shrink depending on
848 the alignment the start insn of the range (the branch for a forward
849 branch or the label for a backward branch) starts out on; if these
850 differences are used naively, they can even oscillate infinitely.
851 We therefore want to compute a 'worst case' address difference that
852 is independent of the alignment the start insn of the range end
853 up on, and that is at least as large as the actual difference.
854 The function align_fuzz calculates the amount we have to add to the
855 naively computed difference, by traversing the part of the alignment
856 chain of the start insn of the range that is in front of the end insn
857 of the range, and considering for each alignment the maximum amount
858 that it might contribute to a size increase.
860 For casesi tables, we also want to know worst case minimum amounts of
861 address difference, in case a machine description wants to introduce
862 some common offset that is added to all offsets in a table.
863 For this purpose, align_fuzz with a growth argument of 0 comuptes the
864 appropriate adjustment. */
867 /* Compute the maximum delta by which the difference of the addresses of
868 START and END might grow / shrink due to a different address for start
869 which changes the size of alignment insns between START and END.
870 KNOWN_ALIGN_LOG is the alignment known for START.
871 GROWTH should be ~0 if the objective is to compute potential code size
872 increase, and 0 if the objective is to compute potential shrink.
873 The return value is undefined for any other value of GROWTH. */
875 align_fuzz (start, end, known_align_log, growth)
880 int uid = INSN_UID (start);
882 int known_align = 1 << known_align_log;
883 int end_shuid = INSN_SHUID (end);
886 for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
888 int align_addr, new_align;
890 uid = INSN_UID (align_label);
891 align_addr = insn_addresses[uid] - insn_lengths[uid];
892 if (uid_shuid[uid] > end_shuid)
894 known_align_log = LABEL_TO_ALIGNMENT (align_label);
895 new_align = 1 << known_align_log;
896 if (new_align < known_align)
898 fuzz += (-align_addr ^ growth) & (new_align - known_align);
899 known_align = new_align;
904 /* Compute a worst-case reference address of a branch so that it
905 can be safely used in the presence of aligned labels. Since the
906 size of the branch itself is unknown, the size of the branch is
907 not included in the range. I.e. for a forward branch, the reference
908 address is the end address of the branch as known from the previous
909 branch shortening pass, minus a value to account for possible size
910 increase due to alignment. For a backward branch, it is the start
911 address of the branch as known from the current pass, plus a value
912 to account for possible size increase due to alignment.
913 NB.: Therefore, the maximum offset allowed for backward branches needs
914 to exclude the branch size. */
916 insn_current_reference_address (branch)
920 rtx seq = NEXT_INSN (PREV_INSN (branch));
921 int seq_uid = INSN_UID (seq);
922 if (GET_CODE (branch) != JUMP_INSN)
923 /* This can happen for example on the PA; the objective is to know the
924 offset to address something in front of the start of the function.
925 Thus, we can treat it like a backward branch.
926 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
927 any alignment we'd encounter, so we skip the call to align_fuzz. */
928 return insn_current_address;
929 dest = JUMP_LABEL (branch);
930 /* BRANCH has no proper alignment chain set, so use SEQ. */
931 if (INSN_SHUID (branch) < INSN_SHUID (dest))
933 /* Forward branch. */
934 return (insn_last_address + insn_lengths[seq_uid]
935 - align_fuzz (seq, dest, length_unit_log, ~0));
939 /* Backward branch. */
940 return (insn_current_address
941 + align_fuzz (dest, seq, length_unit_log, ~0));
944 #endif /* HAVE_ATTR_length */
946 /* Make a pass over all insns and compute their actual lengths by shortening
947 any branches of variable length if possible. */
949 /* Give a default value for the lowest address in a function. */
951 #ifndef FIRST_INSN_ADDRESS
952 #define FIRST_INSN_ADDRESS 0
955 /* shorten_branches might be called multiple times: for example, the SH
956 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
957 In order to do this, it needs proper length information, which it obtains
958 by calling shorten_branches. This cannot be collapsed with
959 shorten_branches itself into a single pass unless we also want to intergate
960 reorg.c, since the branch splitting exposes new instructions with delay
964 shorten_branches (first)
965 rtx first ATTRIBUTE_UNUSED;
972 #ifdef HAVE_ATTR_length
973 #define MAX_CODE_ALIGN 16
975 int something_changed = 1;
976 char *varying_length;
979 rtx align_tab[MAX_CODE_ALIGN];
981 /* In order to make sure that all instructions have valid length info,
982 we must split them before we compute the address/length info. */
984 for (insn = NEXT_INSN (first); insn; insn = NEXT_INSN (insn))
985 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
988 /* Don't split the insn if it has been deleted. */
989 if (! INSN_DELETED_P (old))
990 insn = try_split (PATTERN (old), old, 1);
991 /* When not optimizing, the old insn will be still left around
992 with only the 'deleted' bit set. Transform it into a note
993 to avoid confusion of subsequent processing. */
994 if (INSN_DELETED_P (old))
996 PUT_CODE (old , NOTE);
997 NOTE_LINE_NUMBER (old) = NOTE_INSN_DELETED;
998 NOTE_SOURCE_FILE (old) = 0;
1003 /* We must do some computations even when not actually shortening, in
1004 order to get the alignment information for the labels. */
1006 init_insn_lengths ();
1008 /* Compute maximum UID and allocate label_align / uid_shuid. */
1009 max_uid = get_max_uid ();
1011 max_labelno = max_label_num ();
1012 min_labelno = get_first_label_num ();
1013 label_align = (struct label_alignment *)
1014 xcalloc ((max_labelno - min_labelno + 1), sizeof (struct label_alignment));
1016 uid_shuid = (int *) xmalloc (max_uid * sizeof *uid_shuid);
1018 /* Initialize label_align and set up uid_shuid to be strictly
1019 monotonically rising with insn order. */
1020 /* We use max_log here to keep track of the maximum alignment we want to
1021 impose on the next CODE_LABEL (or the current one if we are processing
1022 the CODE_LABEL itself). */
1027 for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
1031 INSN_SHUID (insn) = i++;
1032 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1034 /* reorg might make the first insn of a loop being run once only,
1035 and delete the label in front of it. Then we want to apply
1036 the loop alignment to the new label created by reorg, which
1037 is separated by the former loop start insn from the
1038 NOTE_INSN_LOOP_BEG. */
1040 else if (GET_CODE (insn) == CODE_LABEL)
1044 log = LABEL_ALIGN (insn);
1048 max_skip = LABEL_ALIGN_MAX_SKIP;
1050 next = NEXT_INSN (insn);
1051 /* ADDR_VECs only take room if read-only data goes into the text
1053 if (JUMP_TABLES_IN_TEXT_SECTION
1054 #if !defined(READONLY_DATA_SECTION)
1058 if (next && GET_CODE (next) == JUMP_INSN)
1060 rtx nextbody = PATTERN (next);
1061 if (GET_CODE (nextbody) == ADDR_VEC
1062 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1064 log = ADDR_VEC_ALIGN (next);
1068 max_skip = LABEL_ALIGN_MAX_SKIP;
1072 LABEL_TO_ALIGNMENT (insn) = max_log;
1073 LABEL_TO_MAX_SKIP (insn) = max_skip;
1077 else if (GET_CODE (insn) == BARRIER)
1081 for (label = insn; label && GET_RTX_CLASS (GET_CODE (label)) != 'i';
1082 label = NEXT_INSN (label))
1083 if (GET_CODE (label) == CODE_LABEL)
1085 log = LABEL_ALIGN_AFTER_BARRIER (insn);
1089 max_skip = LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP;
1094 /* Again, we allow NOTE_INSN_LOOP_BEG - INSN - CODE_LABEL
1095 sequences in order to handle reorg output efficiently. */
1096 else if (GET_CODE (insn) == NOTE
1097 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
1102 /* Search for the label that starts the loop.
1103 Don't skip past the end of the loop, since that could
1104 lead to putting an alignment where it does not belong.
1105 However, a label after a nested (non-)loop would be OK. */
1106 for (label = insn; label; label = NEXT_INSN (label))
1108 if (GET_CODE (label) == NOTE
1109 && NOTE_LINE_NUMBER (label) == NOTE_INSN_LOOP_BEG)
1111 else if (GET_CODE (label) == NOTE
1112 && NOTE_LINE_NUMBER (label) == NOTE_INSN_LOOP_END
1115 else if (GET_CODE (label) == CODE_LABEL)
1117 log = LOOP_ALIGN (label);
1121 max_skip = LOOP_ALIGN_MAX_SKIP;
1130 #ifdef HAVE_ATTR_length
1132 /* Allocate the rest of the arrays. */
1133 insn_lengths = (short *) xmalloc (max_uid * sizeof (short));
1134 insn_lengths_max_uid = max_uid;
1135 /* Syntax errors can lead to labels being outside of the main insn stream.
1136 Initialize insn_addresses, so that we get reproducible results. */
1137 insn_addresses = (int *) xcalloc (max_uid, sizeof (int));
1139 varying_length = (char *) xcalloc (max_uid, sizeof (char));
1141 /* Initialize uid_align. We scan instructions
1142 from end to start, and keep in align_tab[n] the last seen insn
1143 that does an alignment of at least n+1, i.e. the successor
1144 in the alignment chain for an insn that does / has a known
1146 uid_align = (rtx *) xcalloc (max_uid, sizeof *uid_align);
1148 for (i = MAX_CODE_ALIGN; --i >= 0; )
1149 align_tab[i] = NULL_RTX;
1150 seq = get_last_insn ();
1151 for (; seq; seq = PREV_INSN (seq))
1153 int uid = INSN_UID (seq);
1155 log = (GET_CODE (seq) == CODE_LABEL ? LABEL_TO_ALIGNMENT (seq) : 0);
1156 uid_align[uid] = align_tab[0];
1159 /* Found an alignment label. */
1160 uid_align[uid] = align_tab[log];
1161 for (i = log - 1; i >= 0; i--)
1165 #ifdef CASE_VECTOR_SHORTEN_MODE
1168 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1171 int min_shuid = INSN_SHUID (get_insns ()) - 1;
1172 int max_shuid = INSN_SHUID (get_last_insn ()) + 1;
1175 for (insn = first; insn != 0; insn = NEXT_INSN (insn))
1177 rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat;
1178 int len, i, min, max, insn_shuid;
1180 addr_diff_vec_flags flags;
1182 if (GET_CODE (insn) != JUMP_INSN
1183 || GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)
1185 pat = PATTERN (insn);
1186 len = XVECLEN (pat, 1);
1189 min_align = MAX_CODE_ALIGN;
1190 for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
1192 rtx lab = XEXP (XVECEXP (pat, 1, i), 0);
1193 int shuid = INSN_SHUID (lab);
1204 if (min_align > LABEL_TO_ALIGNMENT (lab))
1205 min_align = LABEL_TO_ALIGNMENT (lab);
1207 XEXP (pat, 2) = gen_rtx_LABEL_REF (VOIDmode, min_lab);
1208 XEXP (pat, 3) = gen_rtx_LABEL_REF (VOIDmode, max_lab);
1209 insn_shuid = INSN_SHUID (insn);
1210 rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0));
1211 flags.min_align = min_align;
1212 flags.base_after_vec = rel > insn_shuid;
1213 flags.min_after_vec = min > insn_shuid;
1214 flags.max_after_vec = max > insn_shuid;
1215 flags.min_after_base = min > rel;
1216 flags.max_after_base = max > rel;
1217 ADDR_DIFF_VEC_FLAGS (pat) = flags;
1220 #endif /* CASE_VECTOR_SHORTEN_MODE */
1223 /* Compute initial lengths, addresses, and varying flags for each insn. */
1224 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1226 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1228 uid = INSN_UID (insn);
1230 insn_lengths[uid] = 0;
1232 if (GET_CODE (insn) == CODE_LABEL)
1234 int log = LABEL_TO_ALIGNMENT (insn);
1237 int align = 1 << log;
1238 int new_address = (insn_current_address + align - 1) & -align;
1239 insn_lengths[uid] = new_address - insn_current_address;
1240 insn_current_address = new_address;
1244 insn_addresses[uid] = insn_current_address;
1246 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
1247 || GET_CODE (insn) == CODE_LABEL)
1249 if (INSN_DELETED_P (insn))
1252 body = PATTERN (insn);
1253 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1255 /* This only takes room if read-only data goes into the text
1257 if (JUMP_TABLES_IN_TEXT_SECTION
1258 #if !defined(READONLY_DATA_SECTION)
1262 insn_lengths[uid] = (XVECLEN (body,
1263 GET_CODE (body) == ADDR_DIFF_VEC)
1264 * GET_MODE_SIZE (GET_MODE (body)));
1265 /* Alignment is handled by ADDR_VEC_ALIGN. */
1267 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
1268 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
1269 else if (GET_CODE (body) == SEQUENCE)
1272 int const_delay_slots;
1274 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
1276 const_delay_slots = 0;
1278 /* Inside a delay slot sequence, we do not do any branch shortening
1279 if the shortening could change the number of delay slots
1281 for (i = 0; i < XVECLEN (body, 0); i++)
1283 rtx inner_insn = XVECEXP (body, 0, i);
1284 int inner_uid = INSN_UID (inner_insn);
1287 if (GET_CODE (body) == ASM_INPUT
1288 || asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
1289 inner_length = (asm_insn_count (PATTERN (inner_insn))
1290 * insn_default_length (inner_insn));
1292 inner_length = insn_default_length (inner_insn);
1294 insn_lengths[inner_uid] = inner_length;
1295 if (const_delay_slots)
1297 if ((varying_length[inner_uid]
1298 = insn_variable_length_p (inner_insn)) != 0)
1299 varying_length[uid] = 1;
1300 insn_addresses[inner_uid] = (insn_current_address +
1304 varying_length[inner_uid] = 0;
1305 insn_lengths[uid] += inner_length;
1308 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
1310 insn_lengths[uid] = insn_default_length (insn);
1311 varying_length[uid] = insn_variable_length_p (insn);
1314 /* If needed, do any adjustment. */
1315 #ifdef ADJUST_INSN_LENGTH
1316 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
1317 if (insn_lengths[uid] < 0)
1318 fatal_insn ("Negative insn length", insn);
1322 /* Now loop over all the insns finding varying length insns. For each,
1323 get the current insn length. If it has changed, reflect the change.
1324 When nothing changes for a full pass, we are done. */
1326 while (something_changed)
1328 something_changed = 0;
1329 insn_current_align = MAX_CODE_ALIGN - 1;
1330 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1332 insn = NEXT_INSN (insn))
1335 #ifdef ADJUST_INSN_LENGTH
1340 uid = INSN_UID (insn);
1342 if (GET_CODE (insn) == CODE_LABEL)
1344 int log = LABEL_TO_ALIGNMENT (insn);
1345 if (log > insn_current_align)
1347 int align = 1 << log;
1348 int new_address= (insn_current_address + align - 1) & -align;
1349 insn_lengths[uid] = new_address - insn_current_address;
1350 insn_current_align = log;
1351 insn_current_address = new_address;
1354 insn_lengths[uid] = 0;
1355 insn_addresses[uid] = insn_current_address;
1359 length_align = INSN_LENGTH_ALIGNMENT (insn);
1360 if (length_align < insn_current_align)
1361 insn_current_align = length_align;
1363 insn_last_address = insn_addresses[uid];
1364 insn_addresses[uid] = insn_current_address;
1366 #ifdef CASE_VECTOR_SHORTEN_MODE
1367 if (optimize && GET_CODE (insn) == JUMP_INSN
1368 && GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
1370 rtx body = PATTERN (insn);
1371 int old_length = insn_lengths[uid];
1372 rtx rel_lab = XEXP (XEXP (body, 0), 0);
1373 rtx min_lab = XEXP (XEXP (body, 2), 0);
1374 rtx max_lab = XEXP (XEXP (body, 3), 0);
1375 addr_diff_vec_flags flags = ADDR_DIFF_VEC_FLAGS (body);
1376 int rel_addr = insn_addresses[INSN_UID (rel_lab)];
1377 int min_addr = insn_addresses[INSN_UID (min_lab)];
1378 int max_addr = insn_addresses[INSN_UID (max_lab)];
1382 /* Try to find a known alignment for rel_lab. */
1383 for (prev = rel_lab;
1385 && ! insn_lengths[INSN_UID (prev)]
1386 && ! (varying_length[INSN_UID (prev)] & 1);
1387 prev = PREV_INSN (prev))
1388 if (varying_length[INSN_UID (prev)] & 2)
1390 rel_align = LABEL_TO_ALIGNMENT (prev);
1394 /* See the comment on addr_diff_vec_flags in rtl.h for the
1395 meaning of the flags values. base: REL_LAB vec: INSN */
1396 /* Anything after INSN has still addresses from the last
1397 pass; adjust these so that they reflect our current
1398 estimate for this pass. */
1399 if (flags.base_after_vec)
1400 rel_addr += insn_current_address - insn_last_address;
1401 if (flags.min_after_vec)
1402 min_addr += insn_current_address - insn_last_address;
1403 if (flags.max_after_vec)
1404 max_addr += insn_current_address - insn_last_address;
1405 /* We want to know the worst case, i.e. lowest possible value
1406 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1407 its offset is positive, and we have to be wary of code shrink;
1408 otherwise, it is negative, and we have to be vary of code
1410 if (flags.min_after_base)
1412 /* If INSN is between REL_LAB and MIN_LAB, the size
1413 changes we are about to make can change the alignment
1414 within the observed offset, therefore we have to break
1415 it up into two parts that are independent. */
1416 if (! flags.base_after_vec && flags.min_after_vec)
1418 min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
1419 min_addr -= align_fuzz (insn, min_lab, 0, 0);
1422 min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
1426 if (flags.base_after_vec && ! flags.min_after_vec)
1428 min_addr -= align_fuzz (min_lab, insn, 0, ~0);
1429 min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
1432 min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
1434 /* Likewise, determine the highest lowest possible value
1435 for the offset of MAX_LAB. */
1436 if (flags.max_after_base)
1438 if (! flags.base_after_vec && flags.max_after_vec)
1440 max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
1441 max_addr += align_fuzz (insn, max_lab, 0, ~0);
1444 max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
1448 if (flags.base_after_vec && ! flags.max_after_vec)
1450 max_addr += align_fuzz (max_lab, insn, 0, 0);
1451 max_addr += align_fuzz (insn, rel_lab, 0, 0);
1454 max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
1456 PUT_MODE (body, CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
1457 max_addr - rel_addr,
1459 if (JUMP_TABLES_IN_TEXT_SECTION
1460 #if !defined(READONLY_DATA_SECTION)
1466 = (XVECLEN (body, 1) * GET_MODE_SIZE (GET_MODE (body)));
1467 insn_current_address += insn_lengths[uid];
1468 if (insn_lengths[uid] != old_length)
1469 something_changed = 1;
1474 #endif /* CASE_VECTOR_SHORTEN_MODE */
1476 if (! (varying_length[uid]))
1478 insn_current_address += insn_lengths[uid];
1481 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
1485 body = PATTERN (insn);
1487 for (i = 0; i < XVECLEN (body, 0); i++)
1489 rtx inner_insn = XVECEXP (body, 0, i);
1490 int inner_uid = INSN_UID (inner_insn);
1493 insn_addresses[inner_uid] = insn_current_address;
1495 /* insn_current_length returns 0 for insns with a
1496 non-varying length. */
1497 if (! varying_length[inner_uid])
1498 inner_length = insn_lengths[inner_uid];
1500 inner_length = insn_current_length (inner_insn);
1502 if (inner_length != insn_lengths[inner_uid])
1504 insn_lengths[inner_uid] = inner_length;
1505 something_changed = 1;
1507 insn_current_address += insn_lengths[inner_uid];
1508 new_length += inner_length;
1513 new_length = insn_current_length (insn);
1514 insn_current_address += new_length;
1517 #ifdef ADJUST_INSN_LENGTH
1518 /* If needed, do any adjustment. */
1519 tmp_length = new_length;
1520 ADJUST_INSN_LENGTH (insn, new_length);
1521 insn_current_address += (new_length - tmp_length);
1524 if (new_length != insn_lengths[uid])
1526 insn_lengths[uid] = new_length;
1527 something_changed = 1;
1530 /* For a non-optimizing compile, do only a single pass. */
1535 free (varying_length);
1537 #endif /* HAVE_ATTR_length */
1540 #ifdef HAVE_ATTR_length
1541 /* Given the body of an INSN known to be generated by an ASM statement, return
1542 the number of machine instructions likely to be generated for this insn.
1543 This is used to compute its length. */
1546 asm_insn_count (body)
1549 const char *template;
1552 if (GET_CODE (body) == ASM_INPUT)
1553 template = XSTR (body, 0);
1555 template = decode_asm_operands (body, NULL_PTR, NULL_PTR,
1556 NULL_PTR, NULL_PTR);
1558 for ( ; *template; template++)
1559 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
1566 /* Output assembler code for the start of a function,
1567 and initialize some of the variables in this file
1568 for the new function. The label for the function and associated
1569 assembler pseudo-ops have already been output in `assemble_start_function'.
1571 FIRST is the first insn of the rtl for the function being compiled.
1572 FILE is the file to write assembler code to.
1573 OPTIMIZE is nonzero if we should eliminate redundant
1574 test and compare insns. */
1577 final_start_function (first, file, optimize)
1580 int optimize ATTRIBUTE_UNUSED;
1584 this_is_asm_operands = 0;
1586 #ifdef NON_SAVING_SETJMP
1587 /* A function that calls setjmp should save and restore all the
1588 call-saved registers on a system where longjmp clobbers them. */
1589 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
1593 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1594 if (!call_used_regs[i])
1595 regs_ever_live[i] = 1;
1599 /* Initial line number is supposed to be output
1600 before the function's prologue and label
1601 so that the function's address will not appear to be
1602 in the last statement of the preceding function. */
1603 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1604 last_linenum = high_block_linenum = high_function_linenum
1605 = NOTE_LINE_NUMBER (first);
1607 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1608 /* Output DWARF definition of the function. */
1609 if (dwarf2out_do_frame ())
1610 dwarf2out_begin_prologue ();
1612 current_function_func_begin_label = 0;
1615 /* For SDB and XCOFF, the function beginning must be marked between
1616 the function label and the prologue. We always need this, even when
1617 -g1 was used. Defer on MIPS systems so that parameter descriptions
1618 follow function entry. */
1619 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
1620 if (write_symbols == SDB_DEBUG)
1621 sdbout_begin_function (last_linenum);
1624 #ifdef XCOFF_DEBUGGING_INFO
1625 if (write_symbols == XCOFF_DEBUG)
1626 xcoffout_begin_function (file, last_linenum);
1629 /* But only output line number for other debug info types if -g2
1631 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1632 output_source_line (file, first);
1634 #ifdef LEAF_REG_REMAP
1635 if (current_function_uses_only_leaf_regs)
1636 leaf_renumber_regs (first);
1639 /* The Sun386i and perhaps other machines don't work right
1640 if the profiling code comes after the prologue. */
1641 #ifdef PROFILE_BEFORE_PROLOGUE
1643 profile_function (file);
1644 #endif /* PROFILE_BEFORE_PROLOGUE */
1646 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1647 if (dwarf2out_do_frame ())
1648 dwarf2out_frame_debug (NULL_RTX);
1651 /* If debugging, assign block numbers to all of the blocks in this
1655 number_blocks (current_function_decl);
1656 remove_unnecessary_notes ();
1657 /* We never actually put out begin/end notes for the top-level
1658 block in the function. But, conceptually, that block is
1660 TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl)) = 1;
1663 #ifdef FUNCTION_PROLOGUE
1664 /* First output the function prologue: code to set up the stack frame. */
1665 FUNCTION_PROLOGUE (file, get_frame_size ());
1668 /* If the machine represents the prologue as RTL, the profiling code must
1669 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1670 #ifdef HAVE_prologue
1671 if (! HAVE_prologue)
1673 profile_after_prologue (file);
1677 /* If we are doing basic block profiling, remember a printable version
1678 of the function name. */
1679 if (profile_block_flag)
1682 = add_bb_string ((*decl_printable_name) (current_function_decl, 2), FALSE);
1687 profile_after_prologue (file)
1688 FILE *file ATTRIBUTE_UNUSED;
1690 #ifdef FUNCTION_BLOCK_PROFILER
1691 if (profile_block_flag)
1693 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
1695 #endif /* FUNCTION_BLOCK_PROFILER */
1697 #ifndef PROFILE_BEFORE_PROLOGUE
1699 profile_function (file);
1700 #endif /* not PROFILE_BEFORE_PROLOGUE */
1704 profile_function (file)
1707 int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1708 #if defined(ASM_OUTPUT_REG_PUSH)
1709 #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1710 int sval = current_function_returns_struct;
1712 #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1713 int cxt = current_function_needs_context;
1715 #endif /* ASM_OUTPUT_REG_PUSH */
1718 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1719 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
1720 assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, 1);
1722 function_section (current_function_decl);
1724 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1726 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
1728 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1731 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1736 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1738 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1740 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1743 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1748 FUNCTION_PROFILER (file, profile_label_no);
1750 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1752 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1754 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1757 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1762 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1764 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1766 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1769 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1775 /* Output assembler code for the end of a function.
1776 For clarity, args are same as those of `final_start_function'
1777 even though not all of them are needed. */
1780 final_end_function (first, file, optimize)
1781 rtx first ATTRIBUTE_UNUSED;
1783 int optimize ATTRIBUTE_UNUSED;
1787 fputs (ASM_APP_OFF, file);
1791 #ifdef SDB_DEBUGGING_INFO
1792 if (write_symbols == SDB_DEBUG)
1793 sdbout_end_function (high_function_linenum);
1796 #ifdef DWARF_DEBUGGING_INFO
1797 if (write_symbols == DWARF_DEBUG)
1798 dwarfout_end_function ();
1801 #ifdef XCOFF_DEBUGGING_INFO
1802 if (write_symbols == XCOFF_DEBUG)
1803 xcoffout_end_function (file, high_function_linenum);
1806 #ifdef FUNCTION_EPILOGUE
1807 /* Finally, output the function epilogue:
1808 code to restore the stack frame and return to the caller. */
1809 FUNCTION_EPILOGUE (file, get_frame_size ());
1812 #ifdef SDB_DEBUGGING_INFO
1813 if (write_symbols == SDB_DEBUG)
1814 sdbout_end_epilogue ();
1817 #ifdef DWARF_DEBUGGING_INFO
1818 if (write_symbols == DWARF_DEBUG)
1819 dwarfout_end_epilogue ();
1822 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1823 if (dwarf2out_do_frame ())
1824 dwarf2out_end_epilogue ();
1827 #ifdef XCOFF_DEBUGGING_INFO
1828 if (write_symbols == XCOFF_DEBUG)
1829 xcoffout_end_epilogue (file);
1832 bb_func_label_num = -1; /* not in function, nuke label # */
1834 /* If FUNCTION_EPILOGUE is not defined, then the function body
1835 itself contains return instructions wherever needed. */
1838 /* Add a block to the linked list that remembers the current line/file/function
1839 for basic block profiling. Emit the label in front of the basic block and
1840 the instructions that increment the count field. */
1846 struct bb_list *ptr = (struct bb_list *) permalloc (sizeof (struct bb_list));
1848 /* Add basic block to linked list. */
1850 ptr->line_num = last_linenum;
1851 ptr->file_label_num = bb_file_label_num;
1852 ptr->func_label_num = bb_func_label_num;
1854 bb_tail = &ptr->next;
1856 /* Enable the table of basic-block use counts
1857 to point at the code it applies to. */
1858 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1860 /* Before first insn of this basic block, increment the
1861 count of times it was entered. */
1862 #ifdef BLOCK_PROFILER
1863 BLOCK_PROFILER (file, count_basic_blocks);
1870 count_basic_blocks++;
1873 /* Add a string to be used for basic block profiling. */
1876 add_bb_string (string, perm_p)
1881 struct bb_str *ptr = 0;
1885 string = "<unknown>";
1889 /* Allocate a new string if the current string isn't permanent. If
1890 the string is permanent search for the same string in other
1893 len = strlen (string) + 1;
1896 char *p = (char *) permalloc (len);
1897 bcopy (string, p, len);
1901 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1902 if (ptr->string == string)
1905 /* Allocate a new string block if we need to. */
1908 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1911 ptr->label_num = sbb_label_num++;
1912 ptr->string = string;
1914 sbb_tail = &ptr->next;
1917 return ptr->label_num;
1921 /* Output assembler code for some insns: all or part of a function.
1922 For description of args, see `final_start_function', above.
1924 PRESCAN is 1 if we are not really outputting,
1925 just scanning as if we were outputting.
1926 Prescanning deletes and rearranges insns just like ordinary output.
1927 PRESCAN is -2 if we are outputting after having prescanned.
1928 In this case, don't try to delete or rearrange insns
1929 because that has already been done.
1930 Prescanning is done only on certain machines. */
1933 final (first, file, optimize, prescan)
1943 last_ignored_compare = 0;
1946 check_exception_handler_labels ();
1948 /* Make a map indicating which line numbers appear in this function.
1949 When producing SDB debugging info, delete troublesome line number
1950 notes from inlined functions in other files as well as duplicate
1951 line number notes. */
1952 #ifdef SDB_DEBUGGING_INFO
1953 if (write_symbols == SDB_DEBUG)
1956 for (insn = first; insn; insn = NEXT_INSN (insn))
1957 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1959 if ((RTX_INTEGRATED_P (insn)
1960 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1962 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1963 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1965 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1966 NOTE_SOURCE_FILE (insn) = 0;
1970 if (NOTE_LINE_NUMBER (insn) > max_line)
1971 max_line = NOTE_LINE_NUMBER (insn);
1977 for (insn = first; insn; insn = NEXT_INSN (insn))
1978 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1979 max_line = NOTE_LINE_NUMBER (insn);
1982 line_note_exists = (char *) xcalloc (max_line + 1, sizeof (char));
1984 for (insn = first; insn; insn = NEXT_INSN (insn))
1986 if (INSN_UID (insn) > max_uid) /* find largest UID */
1987 max_uid = INSN_UID (insn);
1988 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1989 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
1991 /* If CC tracking across branches is enabled, record the insn which
1992 jumps to each branch only reached from one place. */
1993 if (optimize && GET_CODE (insn) == JUMP_INSN)
1995 rtx lab = JUMP_LABEL (insn);
1996 if (lab && LABEL_NUSES (lab) == 1)
1998 LABEL_REFS (lab) = insn;
2004 /* Initialize insn_eh_region table if eh is being used. */
2006 init_insn_eh_region (first, max_uid);
2012 /* Output the insns. */
2013 for (insn = NEXT_INSN (first); insn;)
2015 #ifdef HAVE_ATTR_length
2016 insn_current_address = insn_addresses[INSN_UID (insn)];
2018 insn = final_scan_insn (insn, file, optimize, prescan, 0);
2021 /* Do basic-block profiling here
2022 if the last insn was a conditional branch. */
2023 if (profile_block_flag && new_block)
2026 free_insn_eh_region ();
2027 free (line_note_exists);
2028 line_note_exists = NULL;
2032 get_insn_template (code, insn)
2036 const void *output = insn_data[code].output;
2037 switch (insn_data[code].output_format)
2039 case INSN_OUTPUT_FORMAT_SINGLE:
2040 return (const char *) output;
2041 case INSN_OUTPUT_FORMAT_MULTI:
2042 return ((const char * const *) output)[which_alternative];
2043 case INSN_OUTPUT_FORMAT_FUNCTION:
2046 return (* (insn_output_fn) output) (recog_data.operand, insn);
2052 /* The final scan for one insn, INSN.
2053 Args are same as in `final', except that INSN
2054 is the insn being scanned.
2055 Value returned is the next insn to be scanned.
2057 NOPEEPHOLES is the flag to disallow peephole processing (currently
2058 used for within delayed branch sequence output). */
2061 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
2064 int optimize ATTRIBUTE_UNUSED;
2066 int nopeepholes ATTRIBUTE_UNUSED;
2074 /* Ignore deleted insns. These can occur when we split insns (due to a
2075 template of "#") while not optimizing. */
2076 if (INSN_DELETED_P (insn))
2077 return NEXT_INSN (insn);
2079 switch (GET_CODE (insn))
2085 /* Align the beginning of a loop, for higher speed
2086 on certain machines. */
2088 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
2089 break; /* This used to depend on optimize, but that was bogus. */
2090 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END)
2093 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG
2094 && ! exceptions_via_longjmp)
2096 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHB", NOTE_EH_HANDLER (insn));
2097 if (! flag_new_exceptions)
2098 add_eh_table_entry (NOTE_EH_HANDLER (insn));
2099 #ifdef ASM_OUTPUT_EH_REGION_BEG
2100 ASM_OUTPUT_EH_REGION_BEG (file, NOTE_EH_HANDLER (insn));
2105 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END
2106 && ! exceptions_via_longjmp)
2108 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHE", NOTE_EH_HANDLER (insn));
2109 if (flag_new_exceptions)
2110 add_eh_table_entry (NOTE_EH_HANDLER (insn));
2111 #ifdef ASM_OUTPUT_EH_REGION_END
2112 ASM_OUTPUT_EH_REGION_END (file, NOTE_EH_HANDLER (insn));
2117 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
2119 #ifdef FUNCTION_END_PROLOGUE
2120 FUNCTION_END_PROLOGUE (file);
2122 profile_after_prologue (file);
2126 #ifdef FUNCTION_BEGIN_EPILOGUE
2127 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
2129 FUNCTION_BEGIN_EPILOGUE (file);
2134 if (write_symbols == NO_DEBUG)
2136 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
2138 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
2139 /* MIPS stabs require the parameter descriptions to be after the
2140 function entry point rather than before. */
2141 if (write_symbols == SDB_DEBUG)
2142 sdbout_begin_function (last_linenum);
2145 #ifdef DWARF_DEBUGGING_INFO
2146 /* This outputs a marker where the function body starts, so it
2147 must be after the prologue. */
2148 if (write_symbols == DWARF_DEBUG)
2149 dwarfout_begin_function ();
2153 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED)
2154 break; /* An insn that was "deleted" */
2157 fputs (ASM_APP_OFF, file);
2160 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG
2161 && (debug_info_level == DINFO_LEVEL_NORMAL
2162 || debug_info_level == DINFO_LEVEL_VERBOSE
2163 || write_symbols == DWARF_DEBUG
2164 || write_symbols == DWARF2_DEBUG))
2166 int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
2169 high_block_linenum = last_linenum;
2171 /* Output debugging info about the symbol-block beginning. */
2172 #ifdef SDB_DEBUGGING_INFO
2173 if (write_symbols == SDB_DEBUG)
2174 sdbout_begin_block (file, last_linenum, n);
2176 #ifdef XCOFF_DEBUGGING_INFO
2177 if (write_symbols == XCOFF_DEBUG)
2178 xcoffout_begin_block (file, last_linenum, n);
2180 #ifdef DBX_DEBUGGING_INFO
2181 if (write_symbols == DBX_DEBUG)
2182 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", n);
2184 #ifdef DWARF_DEBUGGING_INFO
2185 if (write_symbols == DWARF_DEBUG)
2186 dwarfout_begin_block (n);
2188 #ifdef DWARF2_DEBUGGING_INFO
2189 if (write_symbols == DWARF2_DEBUG)
2190 dwarf2out_begin_block (n);
2193 /* Mark this block as output. */
2194 TREE_ASM_WRITTEN (NOTE_BLOCK (insn)) = 1;
2196 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END
2197 && (debug_info_level == DINFO_LEVEL_NORMAL
2198 || debug_info_level == DINFO_LEVEL_VERBOSE
2199 || write_symbols == DWARF_DEBUG
2200 || write_symbols == DWARF2_DEBUG))
2202 int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
2204 /* End of a symbol-block. */
2207 if (block_depth < 0)
2210 #ifdef XCOFF_DEBUGGING_INFO
2211 if (write_symbols == XCOFF_DEBUG)
2212 xcoffout_end_block (file, high_block_linenum, n);
2214 #ifdef DBX_DEBUGGING_INFO
2215 if (write_symbols == DBX_DEBUG)
2216 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE", n);
2218 #ifdef SDB_DEBUGGING_INFO
2219 if (write_symbols == SDB_DEBUG)
2220 sdbout_end_block (file, high_block_linenum, n);
2222 #ifdef DWARF_DEBUGGING_INFO
2223 if (write_symbols == DWARF_DEBUG)
2224 dwarfout_end_block (n);
2226 #ifdef DWARF2_DEBUGGING_INFO
2227 if (write_symbols == DWARF2_DEBUG)
2228 dwarf2out_end_block (n);
2231 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL
2232 && (debug_info_level == DINFO_LEVEL_NORMAL
2233 || debug_info_level == DINFO_LEVEL_VERBOSE))
2235 #ifdef DWARF_DEBUGGING_INFO
2236 if (write_symbols == DWARF_DEBUG)
2237 dwarfout_label (insn);
2239 #ifdef DWARF2_DEBUGGING_INFO
2240 if (write_symbols == DWARF2_DEBUG)
2241 dwarf2out_label (insn);
2244 else if (NOTE_LINE_NUMBER (insn) > 0)
2245 /* This note is a line-number. */
2249 #if 0 /* This is what we used to do. */
2250 output_source_line (file, insn);
2254 /* If there is anything real after this note,
2255 output it. If another line note follows, omit this one. */
2256 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
2258 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
2260 /* These types of notes can be significant
2261 so make sure the preceding line number stays. */
2262 else if (GET_CODE (note) == NOTE
2263 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
2264 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
2265 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
2267 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
2269 /* Another line note follows; we can delete this note
2270 if no intervening line numbers have notes elsewhere. */
2272 for (num = NOTE_LINE_NUMBER (insn) + 1;
2273 num < NOTE_LINE_NUMBER (note);
2275 if (line_note_exists[num])
2278 if (num >= NOTE_LINE_NUMBER (note))
2284 /* Output this line note
2285 if it is the first or the last line note in a row. */
2287 output_source_line (file, insn);
2292 #if defined (DWARF2_UNWIND_INFO)
2293 /* If we push arguments, we need to check all insns for stack
2295 if (!ACCUMULATE_OUTGOING_ARGS && dwarf2out_do_frame ())
2296 dwarf2out_frame_debug (insn);
2301 /* The target port might emit labels in the output function for
2302 some insn, e.g. sh.c output_branchy_insn. */
2303 if (CODE_LABEL_NUMBER (insn) <= max_labelno)
2305 int align = LABEL_TO_ALIGNMENT (insn);
2306 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2307 int max_skip = LABEL_TO_MAX_SKIP (insn);
2310 if (align && NEXT_INSN (insn))
2311 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2312 ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip);
2314 ASM_OUTPUT_ALIGN (file, align);
2319 /* If this label is reached from only one place, set the condition
2320 codes from the instruction just before the branch. */
2322 /* Disabled because some insns set cc_status in the C output code
2323 and NOTICE_UPDATE_CC alone can set incorrect status. */
2324 if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
2326 rtx jump = LABEL_REFS (insn);
2327 rtx barrier = prev_nonnote_insn (insn);
2329 /* If the LABEL_REFS field of this label has been set to point
2330 at a branch, the predecessor of the branch is a regular
2331 insn, and that branch is the only way to reach this label,
2332 set the condition codes based on the branch and its
2334 if (barrier && GET_CODE (barrier) == BARRIER
2335 && jump && GET_CODE (jump) == JUMP_INSN
2336 && (prev = prev_nonnote_insn (jump))
2337 && GET_CODE (prev) == INSN)
2339 NOTICE_UPDATE_CC (PATTERN (prev), prev);
2340 NOTICE_UPDATE_CC (PATTERN (jump), jump);
2348 #ifdef FINAL_PRESCAN_LABEL
2349 FINAL_PRESCAN_INSN (insn, NULL_PTR, 0);
2352 #ifdef SDB_DEBUGGING_INFO
2353 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
2354 sdbout_label (insn);
2356 #ifdef DWARF_DEBUGGING_INFO
2357 if (write_symbols == DWARF_DEBUG && LABEL_NAME (insn))
2358 dwarfout_label (insn);
2360 #ifdef DWARF2_DEBUGGING_INFO
2361 if (write_symbols == DWARF2_DEBUG && LABEL_NAME (insn))
2362 dwarf2out_label (insn);
2366 fputs (ASM_APP_OFF, file);
2369 if (NEXT_INSN (insn) != 0
2370 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
2372 rtx nextbody = PATTERN (NEXT_INSN (insn));
2374 /* If this label is followed by a jump-table,
2375 make sure we put the label in the read-only section. Also
2376 possibly write the label and jump table together. */
2378 if (GET_CODE (nextbody) == ADDR_VEC
2379 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
2381 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2382 /* In this case, the case vector is being moved by the
2383 target, so don't output the label at all. Leave that
2384 to the back end macros. */
2386 if (! JUMP_TABLES_IN_TEXT_SECTION)
2388 readonly_data_section ();
2389 #ifdef READONLY_DATA_SECTION
2390 ASM_OUTPUT_ALIGN (file,
2391 exact_log2 (BIGGEST_ALIGNMENT
2393 #endif /* READONLY_DATA_SECTION */
2396 function_section (current_function_decl);
2398 #ifdef ASM_OUTPUT_CASE_LABEL
2399 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
2402 if (LABEL_ALTERNATE_NAME (insn))
2403 ASM_OUTPUT_ALTERNATE_LABEL_NAME (file, insn);
2405 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2411 if (LABEL_ALTERNATE_NAME (insn))
2412 ASM_OUTPUT_ALTERNATE_LABEL_NAME (file, insn);
2414 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2419 register rtx body = PATTERN (insn);
2420 int insn_code_number;
2421 const char *template;
2426 /* An INSN, JUMP_INSN or CALL_INSN.
2427 First check for special kinds that recog doesn't recognize. */
2429 if (GET_CODE (body) == USE /* These are just declarations */
2430 || GET_CODE (body) == CLOBBER)
2434 /* If there is a REG_CC_SETTER note on this insn, it means that
2435 the setting of the condition code was done in the delay slot
2436 of the insn that branched here. So recover the cc status
2437 from the insn that set it. */
2439 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
2442 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
2443 cc_prev_status = cc_status;
2447 /* Detect insns that are really jump-tables
2448 and output them as such. */
2450 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
2452 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2453 register int vlen, idx;
2461 fputs (ASM_APP_OFF, file);
2465 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2466 if (GET_CODE (body) == ADDR_VEC)
2468 #ifdef ASM_OUTPUT_ADDR_VEC
2469 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2476 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2477 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2483 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
2484 for (idx = 0; idx < vlen; idx++)
2486 if (GET_CODE (body) == ADDR_VEC)
2488 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2489 ASM_OUTPUT_ADDR_VEC_ELT
2490 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
2497 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2498 ASM_OUTPUT_ADDR_DIFF_ELT
2501 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
2502 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
2508 #ifdef ASM_OUTPUT_CASE_END
2509 ASM_OUTPUT_CASE_END (file,
2510 CODE_LABEL_NUMBER (PREV_INSN (insn)),
2515 function_section (current_function_decl);
2520 /* Do basic-block profiling when we reach a new block.
2521 Done here to avoid jump tables. */
2522 if (profile_block_flag && new_block)
2525 if (GET_CODE (body) == ASM_INPUT)
2527 /* There's no telling what that did to the condition codes. */
2533 fputs (ASM_APP_ON, file);
2536 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
2540 /* Detect `asm' construct with operands. */
2541 if (asm_noperands (body) >= 0)
2543 unsigned int noperands = asm_noperands (body);
2544 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
2547 /* There's no telling what that did to the condition codes. */
2554 fputs (ASM_APP_ON, file);
2558 /* Get out the operand values. */
2559 string = decode_asm_operands (body, ops, NULL_PTR,
2560 NULL_PTR, NULL_PTR);
2561 /* Inhibit aborts on what would otherwise be compiler bugs. */
2562 insn_noperands = noperands;
2563 this_is_asm_operands = insn;
2565 /* Output the insn using them. */
2566 output_asm_insn (string, ops);
2567 this_is_asm_operands = 0;
2571 if (prescan <= 0 && app_on)
2573 fputs (ASM_APP_OFF, file);
2577 if (GET_CODE (body) == SEQUENCE)
2579 /* A delayed-branch sequence */
2585 final_sequence = body;
2587 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2588 force the restoration of a comparison that was previously
2589 thought unnecessary. If that happens, cancel this sequence
2590 and cause that insn to be restored. */
2592 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
2593 if (next != XVECEXP (body, 0, 1))
2599 for (i = 1; i < XVECLEN (body, 0); i++)
2601 rtx insn = XVECEXP (body, 0, i);
2602 rtx next = NEXT_INSN (insn);
2603 /* We loop in case any instruction in a delay slot gets
2606 insn = final_scan_insn (insn, file, 0, prescan, 1);
2607 while (insn != next);
2609 #ifdef DBR_OUTPUT_SEQEND
2610 DBR_OUTPUT_SEQEND (file);
2614 /* If the insn requiring the delay slot was a CALL_INSN, the
2615 insns in the delay slot are actually executed before the
2616 called function. Hence we don't preserve any CC-setting
2617 actions in these insns and the CC must be marked as being
2618 clobbered by the function. */
2619 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
2624 /* Following a conditional branch sequence, we have a new basic
2626 if (profile_block_flag)
2628 rtx insn = XVECEXP (body, 0, 0);
2629 rtx body = PATTERN (insn);
2631 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2632 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2633 || (GET_CODE (insn) == JUMP_INSN
2634 && GET_CODE (body) == PARALLEL
2635 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2636 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
2642 /* We have a real machine instruction as rtl. */
2644 body = PATTERN (insn);
2647 set = single_set(insn);
2649 /* Check for redundant test and compare instructions
2650 (when the condition codes are already set up as desired).
2651 This is done only when optimizing; if not optimizing,
2652 it should be possible for the user to alter a variable
2653 with the debugger in between statements
2654 and the next statement should reexamine the variable
2655 to compute the condition codes. */
2660 rtx set = single_set(insn);
2664 && GET_CODE (SET_DEST (set)) == CC0
2665 && insn != last_ignored_compare)
2667 if (GET_CODE (SET_SRC (set)) == SUBREG)
2668 SET_SRC (set) = alter_subreg (SET_SRC (set));
2669 else if (GET_CODE (SET_SRC (set)) == COMPARE)
2671 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
2672 XEXP (SET_SRC (set), 0)
2673 = alter_subreg (XEXP (SET_SRC (set), 0));
2674 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
2675 XEXP (SET_SRC (set), 1)
2676 = alter_subreg (XEXP (SET_SRC (set), 1));
2678 if ((cc_status.value1 != 0
2679 && rtx_equal_p (SET_SRC (set), cc_status.value1))
2680 || (cc_status.value2 != 0
2681 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
2683 /* Don't delete insn if it has an addressing side-effect. */
2684 if (! FIND_REG_INC_NOTE (insn, 0)
2685 /* or if anything in it is volatile. */
2686 && ! volatile_refs_p (PATTERN (insn)))
2688 /* We don't really delete the insn; just ignore it. */
2689 last_ignored_compare = insn;
2697 /* Following a conditional branch, we have a new basic block.
2698 But if we are inside a sequence, the new block starts after the
2699 last insn of the sequence. */
2700 if (profile_block_flag && final_sequence == 0
2701 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2702 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2703 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
2704 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2705 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
2709 /* Don't bother outputting obvious no-ops, even without -O.
2710 This optimization is fast and doesn't interfere with debugging.
2711 Don't do this if the insn is in a delay slot, since this
2712 will cause an improper number of delay insns to be written. */
2713 if (final_sequence == 0
2715 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
2716 && GET_CODE (SET_SRC (body)) == REG
2717 && GET_CODE (SET_DEST (body)) == REG
2718 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
2723 /* If this is a conditional branch, maybe modify it
2724 if the cc's are in a nonstandard state
2725 so that it accomplishes the same thing that it would
2726 do straightforwardly if the cc's were set up normally. */
2728 if (cc_status.flags != 0
2729 && GET_CODE (insn) == JUMP_INSN
2730 && GET_CODE (body) == SET
2731 && SET_DEST (body) == pc_rtx
2732 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
2733 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
2734 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
2735 /* This is done during prescan; it is not done again
2736 in final scan when prescan has been done. */
2739 /* This function may alter the contents of its argument
2740 and clear some of the cc_status.flags bits.
2741 It may also return 1 meaning condition now always true
2742 or -1 meaning condition now always false
2743 or 2 meaning condition nontrivial but altered. */
2744 register int result = alter_cond (XEXP (SET_SRC (body), 0));
2745 /* If condition now has fixed value, replace the IF_THEN_ELSE
2746 with its then-operand or its else-operand. */
2748 SET_SRC (body) = XEXP (SET_SRC (body), 1);
2750 SET_SRC (body) = XEXP (SET_SRC (body), 2);
2752 /* The jump is now either unconditional or a no-op.
2753 If it has become a no-op, don't try to output it.
2754 (It would not be recognized.) */
2755 if (SET_SRC (body) == pc_rtx)
2757 PUT_CODE (insn, NOTE);
2758 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2759 NOTE_SOURCE_FILE (insn) = 0;
2762 else if (GET_CODE (SET_SRC (body)) == RETURN)
2763 /* Replace (set (pc) (return)) with (return). */
2764 PATTERN (insn) = body = SET_SRC (body);
2766 /* Rerecognize the instruction if it has changed. */
2768 INSN_CODE (insn) = -1;
2771 /* Make same adjustments to instructions that examine the
2772 condition codes without jumping and instructions that
2773 handle conditional moves (if this machine has either one). */
2775 if (cc_status.flags != 0
2778 rtx cond_rtx, then_rtx, else_rtx;
2780 if (GET_CODE (insn) != JUMP_INSN
2781 && GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
2783 cond_rtx = XEXP (SET_SRC (set), 0);
2784 then_rtx = XEXP (SET_SRC (set), 1);
2785 else_rtx = XEXP (SET_SRC (set), 2);
2789 cond_rtx = SET_SRC (set);
2790 then_rtx = const_true_rtx;
2791 else_rtx = const0_rtx;
2794 switch (GET_CODE (cond_rtx))
2807 register int result;
2808 if (XEXP (cond_rtx, 0) != cc0_rtx)
2810 result = alter_cond (cond_rtx);
2812 validate_change (insn, &SET_SRC (set), then_rtx, 0);
2813 else if (result == -1)
2814 validate_change (insn, &SET_SRC (set), else_rtx, 0);
2815 else if (result == 2)
2816 INSN_CODE (insn) = -1;
2817 if (SET_DEST (set) == SET_SRC (set))
2819 PUT_CODE (insn, NOTE);
2820 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2821 NOTE_SOURCE_FILE (insn) = 0;
2833 #ifdef HAVE_peephole
2834 /* Do machine-specific peephole optimizations if desired. */
2836 if (optimize && !flag_no_peephole && !nopeepholes)
2838 rtx next = peephole (insn);
2839 /* When peepholing, if there were notes within the peephole,
2840 emit them before the peephole. */
2841 if (next != 0 && next != NEXT_INSN (insn))
2843 rtx prev = PREV_INSN (insn);
2846 for (note = NEXT_INSN (insn); note != next;
2847 note = NEXT_INSN (note))
2848 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2850 /* In case this is prescan, put the notes
2851 in proper position for later rescan. */
2852 note = NEXT_INSN (insn);
2853 PREV_INSN (note) = prev;
2854 NEXT_INSN (prev) = note;
2855 NEXT_INSN (PREV_INSN (next)) = insn;
2856 PREV_INSN (insn) = PREV_INSN (next);
2857 NEXT_INSN (insn) = next;
2858 PREV_INSN (next) = insn;
2861 /* PEEPHOLE might have changed this. */
2862 body = PATTERN (insn);
2866 /* Try to recognize the instruction.
2867 If successful, verify that the operands satisfy the
2868 constraints for the instruction. Crash if they don't,
2869 since `reload' should have changed them so that they do. */
2871 insn_code_number = recog_memoized (insn);
2872 extract_insn (insn);
2873 cleanup_subreg_operands (insn);
2875 if (! constrain_operands (1))
2876 fatal_insn_not_found (insn);
2878 /* Some target machines need to prescan each insn before
2881 #ifdef FINAL_PRESCAN_INSN
2882 FINAL_PRESCAN_INSN (insn, recog_data.operand, recog_data.n_operands);
2885 #ifdef HAVE_conditional_execution
2886 if (GET_CODE (PATTERN (insn)) == COND_EXEC)
2887 current_insn_predicate = COND_EXEC_TEST (PATTERN (insn));
2889 current_insn_predicate = NULL_RTX;
2893 cc_prev_status = cc_status;
2895 /* Update `cc_status' for this instruction.
2896 The instruction's output routine may change it further.
2897 If the output routine for a jump insn needs to depend
2898 on the cc status, it should look at cc_prev_status. */
2900 NOTICE_UPDATE_CC (body, insn);
2905 #if defined (DWARF2_UNWIND_INFO)
2906 /* If we push arguments, we want to know where the calls are. */
2907 if (!ACCUMULATE_OUTGOING_ARGS && GET_CODE (insn) == CALL_INSN
2908 && dwarf2out_do_frame ())
2909 dwarf2out_frame_debug (insn);
2912 /* Find the proper template for this insn. */
2913 template = get_insn_template (insn_code_number, insn);
2915 /* If the C code returns 0, it means that it is a jump insn
2916 which follows a deleted test insn, and that test insn
2917 needs to be reinserted. */
2920 if (prev_nonnote_insn (insn) != last_ignored_compare)
2923 return prev_nonnote_insn (insn);
2926 /* If the template is the string "#", it means that this insn must
2928 if (template[0] == '#' && template[1] == '\0')
2930 rtx new = try_split (body, insn, 0);
2932 /* If we didn't split the insn, go away. */
2933 if (new == insn && PATTERN (new) == body)
2934 fatal_insn ("Could not split insn", insn);
2936 #ifdef HAVE_ATTR_length
2937 /* This instruction should have been split in shorten_branches,
2938 to ensure that we would have valid length info for the
2950 /* Output assembler code from the template. */
2952 output_asm_insn (template, recog_data.operand);
2954 #if defined (DWARF2_UNWIND_INFO)
2955 /* If we push arguments, we need to check all insns for stack
2957 if (!ACCUMULATE_OUTGOING_ARGS)
2959 if (GET_CODE (insn) == INSN && dwarf2out_do_frame ())
2960 dwarf2out_frame_debug (insn);
2964 #if defined (HAVE_prologue)
2965 /* If this insn is part of the prologue, emit DWARF v2
2967 if (RTX_FRAME_RELATED_P (insn) && dwarf2out_do_frame ())
2968 dwarf2out_frame_debug (insn);
2974 /* It's not at all clear why we did this and doing so interferes
2975 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2978 /* Mark this insn as having been output. */
2979 INSN_DELETED_P (insn) = 1;
2985 return NEXT_INSN (insn);
2988 /* Output debugging info to the assembler file FILE
2989 based on the NOTE-insn INSN, assumed to be a line number. */
2992 output_source_line (file, insn)
2993 FILE *file ATTRIBUTE_UNUSED;
2996 register const char *filename = NOTE_SOURCE_FILE (insn);
2998 /* Remember filename for basic block profiling.
2999 Filenames are allocated on the permanent obstack
3000 or are passed in ARGV, so we don't have to save
3003 if (profile_block_flag && last_filename != filename)
3004 bb_file_label_num = add_bb_string (filename, TRUE);
3006 last_filename = filename;
3007 last_linenum = NOTE_LINE_NUMBER (insn);
3008 high_block_linenum = MAX (last_linenum, high_block_linenum);
3009 high_function_linenum = MAX (last_linenum, high_function_linenum);
3011 if (write_symbols != NO_DEBUG)
3013 #ifdef SDB_DEBUGGING_INFO
3014 if (write_symbols == SDB_DEBUG
3015 #if 0 /* People like having line numbers even in wrong file! */
3016 /* COFF can't handle multiple source files--lose, lose. */
3017 && !strcmp (filename, main_input_filename)
3019 /* COFF relative line numbers must be positive. */
3020 && last_linenum > sdb_begin_function_line)
3022 #ifdef ASM_OUTPUT_SOURCE_LINE
3023 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
3025 fprintf (file, "\t.ln\t%d\n",
3026 ((sdb_begin_function_line > -1)
3027 ? last_linenum - sdb_begin_function_line : 1));
3032 #if defined (DBX_DEBUGGING_INFO)
3033 if (write_symbols == DBX_DEBUG)
3034 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
3037 #if defined (XCOFF_DEBUGGING_INFO)
3038 if (write_symbols == XCOFF_DEBUG)
3039 xcoffout_source_line (file, filename, insn);
3042 #ifdef DWARF_DEBUGGING_INFO
3043 if (write_symbols == DWARF_DEBUG)
3044 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
3047 #ifdef DWARF2_DEBUGGING_INFO
3048 if (write_symbols == DWARF2_DEBUG)
3049 dwarf2out_line (filename, NOTE_LINE_NUMBER (insn));
3055 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3056 directly to the desired hard register. */
3058 cleanup_subreg_operands (insn)
3063 extract_insn (insn);
3064 for (i = 0; i < recog_data.n_operands; i++)
3066 if (GET_CODE (recog_data.operand[i]) == SUBREG)
3067 recog_data.operand[i] = alter_subreg (recog_data.operand[i]);
3068 else if (GET_CODE (recog_data.operand[i]) == PLUS
3069 || GET_CODE (recog_data.operand[i]) == MULT)
3070 recog_data.operand[i] = walk_alter_subreg (recog_data.operand[i]);
3073 for (i = 0; i < recog_data.n_dups; i++)
3075 if (GET_CODE (*recog_data.dup_loc[i]) == SUBREG)
3076 *recog_data.dup_loc[i] = alter_subreg (*recog_data.dup_loc[i]);
3077 else if (GET_CODE (*recog_data.dup_loc[i]) == PLUS
3078 || GET_CODE (*recog_data.dup_loc[i]) == MULT)
3079 *recog_data.dup_loc[i] = walk_alter_subreg (*recog_data.dup_loc[i]);
3083 /* If X is a SUBREG, replace it with a REG or a MEM,
3084 based on the thing it is a subreg of. */
3090 register rtx y = SUBREG_REG (x);
3092 if (GET_CODE (y) == SUBREG)
3093 y = alter_subreg (y);
3095 /* If reload is operating, we may be replacing inside this SUBREG.
3096 Check for that and make a new one if so. */
3097 if (reload_in_progress && find_replacement (&SUBREG_REG (x)) != 0)
3100 if (GET_CODE (y) == REG)
3103 /* If the word size is larger than the size of this register,
3104 adjust the register number to compensate. */
3105 /* ??? Note that this just catches stragglers created by/for
3106 integrate. It would be better if we either caught these
3107 earlier, or kept _all_ subregs until now and eliminate
3108 gen_lowpart and friends. */
3110 #ifdef ALTER_HARD_SUBREG
3111 regno = ALTER_HARD_SUBREG(GET_MODE (x), SUBREG_WORD (x),
3112 GET_MODE (y), REGNO (y));
3114 regno = REGNO (y) + SUBREG_WORD (x);
3118 /* This field has a different meaning for REGs and SUBREGs. Make sure
3122 else if (GET_CODE (y) == MEM)
3124 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
3126 if (BYTES_BIG_ENDIAN)
3127 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
3128 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
3130 MEM_COPY_ATTRIBUTES (x, y);
3131 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
3137 /* Do alter_subreg on all the SUBREGs contained in X. */
3140 walk_alter_subreg (x)
3143 switch (GET_CODE (x))
3147 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3148 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
3152 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3156 return alter_subreg (x);
3167 /* Given BODY, the body of a jump instruction, alter the jump condition
3168 as required by the bits that are set in cc_status.flags.
3169 Not all of the bits there can be handled at this level in all cases.
3171 The value is normally 0.
3172 1 means that the condition has become always true.
3173 -1 means that the condition has become always false.
3174 2 means that COND has been altered. */
3182 if (cc_status.flags & CC_REVERSED)
3185 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
3188 if (cc_status.flags & CC_INVERTED)
3191 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
3194 if (cc_status.flags & CC_NOT_POSITIVE)
3195 switch (GET_CODE (cond))
3200 /* Jump becomes unconditional. */
3206 /* Jump becomes no-op. */
3210 PUT_CODE (cond, EQ);
3215 PUT_CODE (cond, NE);
3223 if (cc_status.flags & CC_NOT_NEGATIVE)
3224 switch (GET_CODE (cond))
3228 /* Jump becomes unconditional. */
3233 /* Jump becomes no-op. */
3238 PUT_CODE (cond, EQ);
3244 PUT_CODE (cond, NE);
3252 if (cc_status.flags & CC_NO_OVERFLOW)
3253 switch (GET_CODE (cond))
3256 /* Jump becomes unconditional. */
3260 PUT_CODE (cond, EQ);
3265 PUT_CODE (cond, NE);
3270 /* Jump becomes no-op. */
3277 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
3278 switch (GET_CODE (cond))
3284 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
3289 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
3294 if (cc_status.flags & CC_NOT_SIGNED)
3295 /* The flags are valid if signed condition operators are converted
3297 switch (GET_CODE (cond))
3300 PUT_CODE (cond, LEU);
3305 PUT_CODE (cond, LTU);
3310 PUT_CODE (cond, GTU);
3315 PUT_CODE (cond, GEU);
3327 /* Report inconsistency between the assembler template and the operands.
3328 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3331 output_operand_lossage (msgid)
3334 if (this_is_asm_operands)
3335 error_for_asm (this_is_asm_operands, "invalid `asm': %s", _(msgid));
3338 error ("output_operand: %s", _(msgid));
3343 /* Output of assembler code from a template, and its subroutines. */
3345 /* Output text from TEMPLATE to the assembler output file,
3346 obeying %-directions to substitute operands taken from
3347 the vector OPERANDS.
3349 %N (for N a digit) means print operand N in usual manner.
3350 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3351 and print the label name with no punctuation.
3352 %cN means require operand N to be a constant
3353 and print the constant expression with no punctuation.
3354 %aN means expect operand N to be a memory address
3355 (not a memory reference!) and print a reference
3357 %nN means expect operand N to be a constant
3358 and print a constant expression for minus the value
3359 of the operand, with no other punctuation. */
3364 if (flag_print_asm_name)
3366 /* Annotate the assembly with a comment describing the pattern and
3367 alternative used. */
3370 register int num = INSN_CODE (debug_insn);
3371 fprintf (asm_out_file, "\t%s %d\t%s",
3372 ASM_COMMENT_START, INSN_UID (debug_insn),
3373 insn_data[num].name);
3374 if (insn_data[num].n_alternatives > 1)
3375 fprintf (asm_out_file, "/%d", which_alternative + 1);
3376 #ifdef HAVE_ATTR_length
3377 fprintf (asm_out_file, "\t[length = %d]",
3378 get_attr_length (debug_insn));
3380 /* Clear this so only the first assembler insn
3381 of any rtl insn will get the special comment for -dp. */
3388 output_asm_insn (template, operands)
3389 const char *template;
3392 register const char *p;
3395 /* An insn may return a null string template
3396 in a case where no assembler code is needed. */
3401 putc ('\t', asm_out_file);
3403 #ifdef ASM_OUTPUT_OPCODE
3404 ASM_OUTPUT_OPCODE (asm_out_file, p);
3412 putc (c, asm_out_file);
3413 #ifdef ASM_OUTPUT_OPCODE
3414 while ((c = *p) == '\t')
3416 putc (c, asm_out_file);
3419 ASM_OUTPUT_OPCODE (asm_out_file, p);
3423 #ifdef ASSEMBLER_DIALECT
3428 /* If we want the first dialect, do nothing. Otherwise, skip
3429 DIALECT_NUMBER of strings ending with '|'. */
3430 for (i = 0; i < dialect_number; i++)
3432 while (*p && *p != '}' && *p++ != '|')
3443 /* Skip to close brace. */
3444 while (*p && *p++ != '}')
3453 /* %% outputs a single %. */
3457 putc (c, asm_out_file);
3459 /* %= outputs a number which is unique to each insn in the entire
3460 compilation. This is useful for making local labels that are
3461 referred to more than once in a given insn. */
3465 fprintf (asm_out_file, "%d", insn_counter);
3467 /* % followed by a letter and some digits
3468 outputs an operand in a special way depending on the letter.
3469 Letters `acln' are implemented directly.
3470 Other letters are passed to `output_operand' so that
3471 the PRINT_OPERAND macro can define them. */
3472 else if (ISLOWER(*p) || ISUPPER(*p))
3477 if (! (*p >= '0' && *p <= '9'))
3478 output_operand_lossage ("operand number missing after %-letter");
3479 else if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3480 output_operand_lossage ("operand number out of range");
3481 else if (letter == 'l')
3482 output_asm_label (operands[c]);
3483 else if (letter == 'a')
3484 output_address (operands[c]);
3485 else if (letter == 'c')
3487 if (CONSTANT_ADDRESS_P (operands[c]))
3488 output_addr_const (asm_out_file, operands[c]);
3490 output_operand (operands[c], 'c');
3492 else if (letter == 'n')
3494 if (GET_CODE (operands[c]) == CONST_INT)
3495 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
3496 - INTVAL (operands[c]));
3499 putc ('-', asm_out_file);
3500 output_addr_const (asm_out_file, operands[c]);
3504 output_operand (operands[c], letter);
3506 while ((c = *p) >= '0' && c <= '9') p++;
3508 /* % followed by a digit outputs an operand the default way. */
3509 else if (*p >= '0' && *p <= '9')
3512 if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3513 output_operand_lossage ("operand number out of range");
3515 output_operand (operands[c], 0);
3516 while ((c = *p) >= '0' && c <= '9') p++;
3518 /* % followed by punctuation: output something for that
3519 punctuation character alone, with no operand.
3520 The PRINT_OPERAND macro decides what is actually done. */
3521 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3522 else if (PRINT_OPERAND_PUNCT_VALID_P ((unsigned char)*p))
3523 output_operand (NULL_RTX, *p++);
3526 output_operand_lossage ("invalid %%-code");
3530 putc (c, asm_out_file);
3535 putc ('\n', asm_out_file);
3538 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3541 output_asm_label (x)
3546 if (GET_CODE (x) == LABEL_REF)
3547 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3548 else if (GET_CODE (x) == CODE_LABEL)
3549 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3551 output_operand_lossage ("`%l' operand isn't a label");
3553 assemble_name (asm_out_file, buf);
3556 /* Print operand X using machine-dependent assembler syntax.
3557 The macro PRINT_OPERAND is defined just to control this function.
3558 CODE is a non-digit that preceded the operand-number in the % spec,
3559 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3560 between the % and the digits.
3561 When CODE is a non-letter, X is 0.
3563 The meanings of the letters are machine-dependent and controlled
3564 by PRINT_OPERAND. */
3567 output_operand (x, code)
3569 int code ATTRIBUTE_UNUSED;
3571 if (x && GET_CODE (x) == SUBREG)
3572 x = alter_subreg (x);
3574 /* If X is a pseudo-register, abort now rather than writing trash to the
3577 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
3580 PRINT_OPERAND (asm_out_file, x, code);
3583 /* Print a memory reference operand for address X
3584 using machine-dependent assembler syntax.
3585 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3591 walk_alter_subreg (x);
3592 PRINT_OPERAND_ADDRESS (asm_out_file, x);
3595 /* Print an integer constant expression in assembler syntax.
3596 Addition and subtraction are the only arithmetic
3597 that may appear in these expressions. */
3600 output_addr_const (file, x)
3607 switch (GET_CODE (x))
3617 assemble_name (file, XSTR (x, 0));
3621 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3622 assemble_name (file, buf);
3626 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3627 assemble_name (file, buf);
3631 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
3635 /* This used to output parentheses around the expression,
3636 but that does not work on the 386 (either ATT or BSD assembler). */
3637 output_addr_const (file, XEXP (x, 0));
3641 if (GET_MODE (x) == VOIDmode)
3643 /* We can use %d if the number is one word and positive. */
3644 if (CONST_DOUBLE_HIGH (x))
3645 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3646 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
3647 else if (CONST_DOUBLE_LOW (x) < 0)
3648 fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
3650 fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
3653 /* We can't handle floating point constants;
3654 PRINT_OPERAND must handle them. */
3655 output_operand_lossage ("floating constant misused");
3659 /* Some assemblers need integer constants to appear last (eg masm). */
3660 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
3662 output_addr_const (file, XEXP (x, 1));
3663 if (INTVAL (XEXP (x, 0)) >= 0)
3664 fprintf (file, "+");
3665 output_addr_const (file, XEXP (x, 0));
3669 output_addr_const (file, XEXP (x, 0));
3670 if (INTVAL (XEXP (x, 1)) >= 0)
3671 fprintf (file, "+");
3672 output_addr_const (file, XEXP (x, 1));
3677 /* Avoid outputting things like x-x or x+5-x,
3678 since some assemblers can't handle that. */
3679 x = simplify_subtraction (x);
3680 if (GET_CODE (x) != MINUS)
3683 output_addr_const (file, XEXP (x, 0));
3684 fprintf (file, "-");
3685 if (GET_CODE (XEXP (x, 1)) == CONST_INT
3686 && INTVAL (XEXP (x, 1)) < 0)
3688 fprintf (file, "%s", ASM_OPEN_PAREN);
3689 output_addr_const (file, XEXP (x, 1));
3690 fprintf (file, "%s", ASM_CLOSE_PAREN);
3693 output_addr_const (file, XEXP (x, 1));
3698 output_addr_const (file, XEXP (x, 0));
3702 output_operand_lossage ("invalid expression as operand");
3706 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3707 %R prints the value of REGISTER_PREFIX.
3708 %L prints the value of LOCAL_LABEL_PREFIX.
3709 %U prints the value of USER_LABEL_PREFIX.
3710 %I prints the value of IMMEDIATE_PREFIX.
3711 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3712 Also supported are %d, %x, %s, %e, %f, %g and %%.
3714 We handle alternate assembler dialects here, just like output_asm_insn. */
3717 asm_fprintf VPARAMS ((FILE *file, const char *p, ...))
3719 #ifndef ANSI_PROTOTYPES
3727 VA_START (argptr, p);
3729 #ifndef ANSI_PROTOTYPES
3730 file = va_arg (argptr, FILE *);
3731 p = va_arg (argptr, const char *);
3739 #ifdef ASSEMBLER_DIALECT
3744 /* If we want the first dialect, do nothing. Otherwise, skip
3745 DIALECT_NUMBER of strings ending with '|'. */
3746 for (i = 0; i < dialect_number; i++)
3748 while (*p && *p++ != '|')
3758 /* Skip to close brace. */
3759 while (*p && *p++ != '}')
3770 while ((c >= '0' && c <= '9') || c == '.')
3778 fprintf (file, "%%");
3781 case 'd': case 'i': case 'u':
3782 case 'x': case 'p': case 'X':
3786 fprintf (file, buf, va_arg (argptr, int));
3790 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3791 but we do not check for those cases. It means that the value
3792 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3794 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3796 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3806 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3813 fprintf (file, buf, va_arg (argptr, long));
3821 fprintf (file, buf, va_arg (argptr, double));
3827 fprintf (file, buf, va_arg (argptr, char *));
3831 #ifdef ASM_OUTPUT_OPCODE
3832 ASM_OUTPUT_OPCODE (asm_out_file, p);
3837 #ifdef REGISTER_PREFIX
3838 fprintf (file, "%s", REGISTER_PREFIX);
3843 #ifdef IMMEDIATE_PREFIX
3844 fprintf (file, "%s", IMMEDIATE_PREFIX);
3849 #ifdef LOCAL_LABEL_PREFIX
3850 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
3855 fputs (user_label_prefix, file);
3858 #ifdef ASM_FPRINTF_EXTENSIONS
3859 /* Upper case letters are reserved for general use by asm_fprintf
3860 and so are not available to target specific code. In order to
3861 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
3862 they are defined here. As they get turned into real extensions
3863 to asm_fprintf they should be removed from this list. */
3864 case 'A': case 'B': case 'C': case 'D': case 'E':
3865 case 'F': case 'G': case 'H': case 'J': case 'K':
3866 case 'M': case 'N': case 'P': case 'Q': case 'S':
3867 case 'T': case 'V': case 'W': case 'Y': case 'Z':
3870 ASM_FPRINTF_EXTENSIONS (file, argptr, p)
3883 /* Split up a CONST_DOUBLE or integer constant rtx
3884 into two rtx's for single words,
3885 storing in *FIRST the word that comes first in memory in the target
3886 and in *SECOND the other. */
3889 split_double (value, first, second)
3891 rtx *first, *second;
3893 if (GET_CODE (value) == CONST_INT)
3895 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3897 /* In this case the CONST_INT holds both target words.
3898 Extract the bits from it into two word-sized pieces.
3899 Sign extend each half to HOST_WIDE_INT. */
3901 /* On machines where HOST_BITS_PER_WIDE_INT == BITS_PER_WORD
3902 the shift below will cause a compiler warning, even though
3903 this code won't be executed. So put the shift amounts in
3904 variables to avoid the warning. */
3905 int rshift = HOST_BITS_PER_WIDE_INT - BITS_PER_WORD;
3906 int lshift = HOST_BITS_PER_WIDE_INT - 2 * BITS_PER_WORD;
3908 low = GEN_INT ((INTVAL (value) << rshift) >> rshift);
3909 high = GEN_INT ((INTVAL (value) << lshift) >> rshift);
3910 if (WORDS_BIG_ENDIAN)
3923 /* The rule for using CONST_INT for a wider mode
3924 is that we regard the value as signed.
3925 So sign-extend it. */
3926 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
3927 if (WORDS_BIG_ENDIAN)
3939 else if (GET_CODE (value) != CONST_DOUBLE)
3941 if (WORDS_BIG_ENDIAN)
3943 *first = const0_rtx;
3949 *second = const0_rtx;
3952 else if (GET_MODE (value) == VOIDmode
3953 /* This is the old way we did CONST_DOUBLE integers. */
3954 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
3956 /* In an integer, the words are defined as most and least significant.
3957 So order them by the target's convention. */
3958 if (WORDS_BIG_ENDIAN)
3960 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3961 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3965 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3966 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3971 #ifdef REAL_ARITHMETIC
3972 REAL_VALUE_TYPE r; long l[2];
3973 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
3975 /* Note, this converts the REAL_VALUE_TYPE to the target's
3976 format, splits up the floating point double and outputs
3977 exactly 32 bits of it into each of l[0] and l[1] --
3978 not necessarily BITS_PER_WORD bits. */
3979 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
3981 /* If 32 bits is an entire word for the target, but not for the host,
3982 then sign-extend on the host so that the number will look the same
3983 way on the host that it would on the target. See for instance
3984 simplify_unary_operation. The #if is needed to avoid compiler
3987 #if HOST_BITS_PER_LONG > 32
3988 if (BITS_PER_WORD < HOST_BITS_PER_LONG && BITS_PER_WORD == 32)
3990 if (l[0] & ((long) 1 << 31))
3991 l[0] |= ((long) (-1) << 32);
3992 if (l[1] & ((long) 1 << 31))
3993 l[1] |= ((long) (-1) << 32);
3997 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
3998 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
4000 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
4001 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
4002 && ! flag_pretend_float)
4006 #ifdef HOST_WORDS_BIG_ENDIAN
4013 /* Host and target agree => no need to swap. */
4014 *first = GEN_INT (CONST_DOUBLE_LOW (value));
4015 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
4019 *second = GEN_INT (CONST_DOUBLE_LOW (value));
4020 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
4022 #endif /* no REAL_ARITHMETIC */
4026 /* Return nonzero if this function has no function calls. */
4033 if (profile_flag || profile_block_flag || profile_arc_flag)
4036 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4038 if (GET_CODE (insn) == CALL_INSN
4039 && ! SIBLING_CALL_P (insn))
4041 if (GET_CODE (insn) == INSN
4042 && GET_CODE (PATTERN (insn)) == SEQUENCE
4043 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN
4044 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn), 0, 0)))
4047 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4049 if (GET_CODE (XEXP (insn, 0)) == CALL_INSN
4050 && ! SIBLING_CALL_P (insn))
4052 if (GET_CODE (XEXP (insn, 0)) == INSN
4053 && GET_CODE (PATTERN (XEXP (insn, 0))) == SEQUENCE
4054 && GET_CODE (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)) == CALL_INSN
4055 && ! SIBLING_CALL_P (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)))
4062 /* On some machines, a function with no call insns
4063 can run faster if it doesn't create its own register window.
4064 When output, the leaf function should use only the "output"
4065 registers. Ordinarily, the function would be compiled to use
4066 the "input" registers to find its arguments; it is a candidate
4067 for leaf treatment if it uses only the "input" registers.
4068 Leaf function treatment means renumbering so the function
4069 uses the "output" registers instead. */
4071 #ifdef LEAF_REGISTERS
4073 /* Return 1 if this function uses only the registers that can be
4074 safely renumbered. */
4077 only_leaf_regs_used ()
4080 char *permitted_reg_in_leaf_functions = LEAF_REGISTERS;
4082 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4083 if ((regs_ever_live[i] || global_regs[i])
4084 && ! permitted_reg_in_leaf_functions[i])
4087 if (current_function_uses_pic_offset_table
4088 && pic_offset_table_rtx != 0
4089 && GET_CODE (pic_offset_table_rtx) == REG
4090 && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4096 /* Scan all instructions and renumber all registers into those
4097 available in leaf functions. */
4100 leaf_renumber_regs (first)
4105 /* Renumber only the actual patterns.
4106 The reg-notes can contain frame pointer refs,
4107 and renumbering them could crash, and should not be needed. */
4108 for (insn = first; insn; insn = NEXT_INSN (insn))
4109 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
4110 leaf_renumber_regs_insn (PATTERN (insn));
4111 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4112 if (GET_RTX_CLASS (GET_CODE (XEXP (insn, 0))) == 'i')
4113 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
4116 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4117 available in leaf functions. */
4120 leaf_renumber_regs_insn (in_rtx)
4121 register rtx in_rtx;
4124 register const char *format_ptr;
4129 /* Renumber all input-registers into output-registers.
4130 renumbered_regs would be 1 for an output-register;
4133 if (GET_CODE (in_rtx) == REG)
4137 /* Don't renumber the same reg twice. */
4141 newreg = REGNO (in_rtx);
4142 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4143 to reach here as part of a REG_NOTE. */
4144 if (newreg >= FIRST_PSEUDO_REGISTER)
4149 newreg = LEAF_REG_REMAP (newreg);
4152 regs_ever_live[REGNO (in_rtx)] = 0;
4153 regs_ever_live[newreg] = 1;
4154 REGNO (in_rtx) = newreg;
4158 if (GET_RTX_CLASS (GET_CODE (in_rtx)) == 'i')
4160 /* Inside a SEQUENCE, we find insns.
4161 Renumber just the patterns of these insns,
4162 just as we do for the top-level insns. */
4163 leaf_renumber_regs_insn (PATTERN (in_rtx));
4167 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
4169 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
4170 switch (*format_ptr++)
4173 leaf_renumber_regs_insn (XEXP (in_rtx, i));
4177 if (NULL != XVEC (in_rtx, i))
4179 for (j = 0; j < XVECLEN (in_rtx, i); j++)
4180 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));