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"
71 #include "basic-block.h"
73 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
74 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
76 #if defined (USG) || !defined (HAVE_STAB_H)
77 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
82 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
84 #ifndef ACCUMULATE_OUTGOING_ARGS
85 #define ACCUMULATE_OUTGOING_ARGS 0
88 #ifdef XCOFF_DEBUGGING_INFO
92 #ifdef DWARF_DEBUGGING_INFO
96 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
97 #include "dwarf2out.h"
100 #ifdef SDB_DEBUGGING_INFO
104 /* .stabd code for line number. */
109 /* .stabs code for included file name. */
114 #ifndef INT_TYPE_SIZE
115 #define INT_TYPE_SIZE BITS_PER_WORD
118 #ifndef LONG_TYPE_SIZE
119 #define LONG_TYPE_SIZE BITS_PER_WORD
122 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
123 null default for it to save conditionalization later. */
124 #ifndef CC_STATUS_INIT
125 #define CC_STATUS_INIT
128 /* How to start an assembler comment. */
129 #ifndef ASM_COMMENT_START
130 #define ASM_COMMENT_START ";#"
133 /* Is the given character a logical line separator for the assembler? */
134 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
135 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
138 #ifndef JUMP_TABLES_IN_TEXT_SECTION
139 #define JUMP_TABLES_IN_TEXT_SECTION 0
142 /* Last insn processed by final_scan_insn. */
143 static rtx debug_insn = 0;
145 /* Line number of last NOTE. */
146 static int last_linenum;
148 /* Highest line number in current block. */
149 static int high_block_linenum;
151 /* Likewise for function. */
152 static int high_function_linenum;
154 /* Filename of last NOTE. */
155 static const char *last_filename;
157 /* Number of basic blocks seen so far;
158 used if profile_block_flag is set. */
159 static int count_basic_blocks;
161 /* Number of instrumented arcs when profile_arc_flag is set. */
162 extern int count_instrumented_edges;
164 extern int length_unit_log; /* This is defined in insn-attrtab.c. */
166 /* Nonzero while outputting an `asm' with operands.
167 This means that inconsistencies are the user's fault, so don't abort.
168 The precise value is the insn being output, to pass to error_for_asm. */
169 static rtx this_is_asm_operands;
171 /* Number of operands of this insn, for an `asm' with operands. */
172 static unsigned int insn_noperands;
174 /* Compare optimization flag. */
176 static rtx last_ignored_compare = 0;
178 /* Flag indicating this insn is the start of a new basic block. */
180 static int new_block = 1;
182 /* Assign a unique number to each insn that is output.
183 This can be used to generate unique local labels. */
185 static int insn_counter = 0;
188 /* This variable contains machine-dependent flags (defined in tm.h)
189 set and examined by output routines
190 that describe how to interpret the condition codes properly. */
194 /* During output of an insn, this contains a copy of cc_status
195 from before the insn. */
197 CC_STATUS cc_prev_status;
200 /* Indexed by hardware reg number, is 1 if that register is ever
201 used in the current function.
203 In life_analysis, or in stupid_life_analysis, this is set
204 up to record the hard regs used explicitly. Reload adds
205 in the hard regs used for holding pseudo regs. Final uses
206 it to generate the code in the function prologue and epilogue
207 to save and restore registers as needed. */
209 char regs_ever_live[FIRST_PSEUDO_REGISTER];
211 /* Nonzero means current function must be given a frame pointer.
212 Set in stmt.c if anything is allocated on the stack there.
213 Set in reload1.c if anything is allocated on the stack there. */
215 int frame_pointer_needed;
217 /* Assign unique numbers to labels generated for profiling. */
219 int profile_label_no;
221 /* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen. */
223 static int block_depth;
225 /* Nonzero if have enabled APP processing of our assembler output. */
229 /* If we are outputting an insn sequence, this contains the sequence rtx.
234 #ifdef ASSEMBLER_DIALECT
236 /* Number of the assembler dialect to use, starting at 0. */
237 static int dialect_number;
240 /* Indexed by line number, nonzero if there is a note for that line. */
242 static char *line_note_exists;
244 #ifdef HAVE_conditional_execution
245 /* Nonnull if the insn currently being emitted was a COND_EXEC pattern. */
246 rtx current_insn_predicate;
249 /* Linked list to hold line numbers for each basic block. */
252 struct bb_list *next; /* pointer to next basic block */
253 int line_num; /* line number */
254 int file_label_num; /* LPBC<n> label # for stored filename */
255 int func_label_num; /* LPBC<n> label # for stored function name */
258 static struct bb_list *bb_head = 0; /* Head of basic block list */
259 static struct bb_list **bb_tail = &bb_head; /* Ptr to store next bb ptr */
260 static int bb_file_label_num = -1; /* Current label # for file */
261 static int bb_func_label_num = -1; /* Current label # for func */
263 /* Linked list to hold the strings for each file and function name output. */
266 struct bb_str *next; /* pointer to next string */
267 const char *string; /* string */
268 int label_num; /* label number */
269 int length; /* string length */
272 static struct bb_str *sbb_head = 0; /* Head of string list. */
273 static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */
274 static int sbb_label_num = 0; /* Last label used */
276 #ifdef HAVE_ATTR_length
277 static int asm_insn_count PARAMS ((rtx));
279 static void profile_function PARAMS ((FILE *));
280 static void profile_after_prologue PARAMS ((FILE *));
281 static void add_bb PARAMS ((FILE *));
282 static int add_bb_string PARAMS ((const char *, int));
283 static void output_source_line PARAMS ((FILE *, rtx));
284 static rtx walk_alter_subreg PARAMS ((rtx));
285 static void output_asm_name PARAMS ((void));
286 static void output_operand PARAMS ((rtx, int));
287 #ifdef LEAF_REGISTERS
288 static void leaf_renumber_regs PARAMS ((rtx));
291 static int alter_cond PARAMS ((rtx));
293 #ifndef ADDR_VEC_ALIGN
294 static int final_addr_vec_align PARAMS ((rtx));
296 #ifdef HAVE_ATTR_length
297 static int align_fuzz PARAMS ((rtx, rtx, int, unsigned));
300 /* Initialize data in final at the beginning of a compilation. */
303 init_final (filename)
304 const char *filename ATTRIBUTE_UNUSED;
309 #ifdef ASSEMBLER_DIALECT
310 dialect_number = ASSEMBLER_DIALECT;
314 /* Called at end of source file,
315 to output the block-profiling table for this entire compilation. */
319 const char *filename;
323 if (profile_block_flag || profile_arc_flag)
326 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
330 int long_bytes = LONG_TYPE_SIZE / BITS_PER_UNIT;
331 int pointer_bytes = POINTER_SIZE / BITS_PER_UNIT;
333 if (profile_block_flag)
334 size = long_bytes * count_basic_blocks;
336 size = long_bytes * count_instrumented_edges;
339 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
340 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
341 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
345 /* Output the main header, of 11 words:
346 0: 1 if this file is initialized, else 0.
347 1: address of file name (LPBX1).
348 2: address of table of counts (LPBX2).
349 3: number of counts in the table.
350 4: always 0, for compatibility with Sun.
352 The following are GNU extensions:
354 5: address of table of start addrs of basic blocks (LPBX3).
355 6: Number of bytes in this header.
356 7: address of table of function names (LPBX4).
357 8: address of table of line numbers (LPBX5) or 0.
358 9: address of table of file names (LPBX6) or 0.
359 10: space reserved for basic block profiling. */
361 ASM_OUTPUT_ALIGN (asm_out_file, align);
363 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
365 assemble_integer (const0_rtx, long_bytes, 1);
367 /* address of filename */
368 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
369 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
371 /* address of count table */
372 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
373 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
375 /* count of the # of basic blocks or # of instrumented arcs */
376 if (profile_block_flag)
377 assemble_integer (GEN_INT (count_basic_blocks), long_bytes, 1);
379 assemble_integer (GEN_INT (count_instrumented_edges), long_bytes, 1);
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;
1782 FILE *file ATTRIBUTE_UNUSED;
1783 int optimize ATTRIBUTE_UNUSED;
1787 #ifdef SDB_DEBUGGING_INFO
1788 if (write_symbols == SDB_DEBUG)
1789 sdbout_end_function (high_function_linenum);
1792 #ifdef DWARF_DEBUGGING_INFO
1793 if (write_symbols == DWARF_DEBUG)
1794 dwarfout_end_function ();
1797 #ifdef XCOFF_DEBUGGING_INFO
1798 if (write_symbols == XCOFF_DEBUG)
1799 xcoffout_end_function (file, high_function_linenum);
1802 #ifdef FUNCTION_EPILOGUE
1803 /* Finally, output the function epilogue:
1804 code to restore the stack frame and return to the caller. */
1805 FUNCTION_EPILOGUE (file, get_frame_size ());
1808 #ifdef SDB_DEBUGGING_INFO
1809 if (write_symbols == SDB_DEBUG)
1810 sdbout_end_epilogue ();
1813 #ifdef DWARF_DEBUGGING_INFO
1814 if (write_symbols == DWARF_DEBUG)
1815 dwarfout_end_epilogue ();
1818 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1819 if (dwarf2out_do_frame ())
1820 dwarf2out_end_epilogue ();
1823 #ifdef XCOFF_DEBUGGING_INFO
1824 if (write_symbols == XCOFF_DEBUG)
1825 xcoffout_end_epilogue (file);
1828 bb_func_label_num = -1; /* not in function, nuke label # */
1830 /* If FUNCTION_EPILOGUE is not defined, then the function body
1831 itself contains return instructions wherever needed. */
1834 /* Add a block to the linked list that remembers the current line/file/function
1835 for basic block profiling. Emit the label in front of the basic block and
1836 the instructions that increment the count field. */
1842 struct bb_list *ptr = (struct bb_list *) permalloc (sizeof (struct bb_list));
1844 /* Add basic block to linked list. */
1846 ptr->line_num = last_linenum;
1847 ptr->file_label_num = bb_file_label_num;
1848 ptr->func_label_num = bb_func_label_num;
1850 bb_tail = &ptr->next;
1852 /* Enable the table of basic-block use counts
1853 to point at the code it applies to. */
1854 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1856 /* Before first insn of this basic block, increment the
1857 count of times it was entered. */
1858 #ifdef BLOCK_PROFILER
1859 BLOCK_PROFILER (file, count_basic_blocks);
1866 count_basic_blocks++;
1869 /* Add a string to be used for basic block profiling. */
1872 add_bb_string (string, perm_p)
1877 struct bb_str *ptr = 0;
1881 string = "<unknown>";
1885 /* Allocate a new string if the current string isn't permanent. If
1886 the string is permanent search for the same string in other
1889 len = strlen (string) + 1;
1892 char *p = (char *) permalloc (len);
1893 bcopy (string, p, len);
1897 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1898 if (ptr->string == string)
1901 /* Allocate a new string block if we need to. */
1904 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1907 ptr->label_num = sbb_label_num++;
1908 ptr->string = string;
1910 sbb_tail = &ptr->next;
1913 return ptr->label_num;
1917 /* Output assembler code for some insns: all or part of a function.
1918 For description of args, see `final_start_function', above.
1920 PRESCAN is 1 if we are not really outputting,
1921 just scanning as if we were outputting.
1922 Prescanning deletes and rearranges insns just like ordinary output.
1923 PRESCAN is -2 if we are outputting after having prescanned.
1924 In this case, don't try to delete or rearrange insns
1925 because that has already been done.
1926 Prescanning is done only on certain machines. */
1929 final (first, file, optimize, prescan)
1939 last_ignored_compare = 0;
1942 check_exception_handler_labels ();
1944 /* Make a map indicating which line numbers appear in this function.
1945 When producing SDB debugging info, delete troublesome line number
1946 notes from inlined functions in other files as well as duplicate
1947 line number notes. */
1948 #ifdef SDB_DEBUGGING_INFO
1949 if (write_symbols == SDB_DEBUG)
1952 for (insn = first; insn; insn = NEXT_INSN (insn))
1953 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1955 if ((RTX_INTEGRATED_P (insn)
1956 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1958 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1959 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1961 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1962 NOTE_SOURCE_FILE (insn) = 0;
1966 if (NOTE_LINE_NUMBER (insn) > max_line)
1967 max_line = NOTE_LINE_NUMBER (insn);
1973 for (insn = first; insn; insn = NEXT_INSN (insn))
1974 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1975 max_line = NOTE_LINE_NUMBER (insn);
1978 line_note_exists = (char *) xcalloc (max_line + 1, sizeof (char));
1980 for (insn = first; insn; insn = NEXT_INSN (insn))
1982 if (INSN_UID (insn) > max_uid) /* find largest UID */
1983 max_uid = INSN_UID (insn);
1984 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1985 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
1987 /* If CC tracking across branches is enabled, record the insn which
1988 jumps to each branch only reached from one place. */
1989 if (optimize && GET_CODE (insn) == JUMP_INSN)
1991 rtx lab = JUMP_LABEL (insn);
1992 if (lab && LABEL_NUSES (lab) == 1)
1994 LABEL_REFS (lab) = insn;
2000 /* Initialize insn_eh_region table if eh is being used. */
2002 init_insn_eh_region (first, max_uid);
2008 /* Output the insns. */
2009 for (insn = NEXT_INSN (first); insn;)
2011 #ifdef HAVE_ATTR_length
2012 insn_current_address = insn_addresses[INSN_UID (insn)];
2014 insn = final_scan_insn (insn, file, optimize, prescan, 0);
2017 /* Do basic-block profiling here
2018 if the last insn was a conditional branch. */
2019 if (profile_block_flag && new_block)
2022 free_insn_eh_region ();
2023 free (line_note_exists);
2024 line_note_exists = NULL;
2028 get_insn_template (code, insn)
2032 const void *output = insn_data[code].output;
2033 switch (insn_data[code].output_format)
2035 case INSN_OUTPUT_FORMAT_SINGLE:
2036 return (const char *) output;
2037 case INSN_OUTPUT_FORMAT_MULTI:
2038 return ((const char * const *) output)[which_alternative];
2039 case INSN_OUTPUT_FORMAT_FUNCTION:
2042 return (* (insn_output_fn) output) (recog_data.operand, insn);
2048 /* The final scan for one insn, INSN.
2049 Args are same as in `final', except that INSN
2050 is the insn being scanned.
2051 Value returned is the next insn to be scanned.
2053 NOPEEPHOLES is the flag to disallow peephole processing (currently
2054 used for within delayed branch sequence output). */
2057 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
2060 int optimize ATTRIBUTE_UNUSED;
2062 int nopeepholes ATTRIBUTE_UNUSED;
2070 /* Ignore deleted insns. These can occur when we split insns (due to a
2071 template of "#") while not optimizing. */
2072 if (INSN_DELETED_P (insn))
2073 return NEXT_INSN (insn);
2075 switch (GET_CODE (insn))
2081 switch (NOTE_LINE_NUMBER (insn))
2083 case NOTE_INSN_DELETED:
2084 case NOTE_INSN_LOOP_BEG:
2085 case NOTE_INSN_LOOP_END:
2086 case NOTE_INSN_LOOP_CONT:
2087 case NOTE_INSN_LOOP_VTOP:
2088 case NOTE_INSN_FUNCTION_END:
2089 case NOTE_INSN_SETJMP:
2090 case NOTE_INSN_REPEATED_LINE_NUMBER:
2091 case NOTE_INSN_RANGE_BEG:
2092 case NOTE_INSN_RANGE_END:
2093 case NOTE_INSN_LIVE:
2094 case NOTE_INSN_EXPECTED_VALUE:
2097 case NOTE_INSN_BASIC_BLOCK:
2099 fprintf (asm_out_file, "\t%s basic block %d\n",
2100 ASM_COMMENT_START, NOTE_BASIC_BLOCK (insn)->index);
2103 case NOTE_INSN_EH_REGION_BEG:
2104 if (! exceptions_via_longjmp)
2106 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHB", NOTE_EH_HANDLER (insn));
2107 if (! flag_new_exceptions)
2108 add_eh_table_entry (NOTE_EH_HANDLER (insn));
2109 #ifdef ASM_OUTPUT_EH_REGION_BEG
2110 ASM_OUTPUT_EH_REGION_BEG (file, NOTE_EH_HANDLER (insn));
2115 case NOTE_INSN_EH_REGION_END:
2116 if (! exceptions_via_longjmp)
2118 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHE", NOTE_EH_HANDLER (insn));
2119 if (flag_new_exceptions)
2120 add_eh_table_entry (NOTE_EH_HANDLER (insn));
2121 #ifdef ASM_OUTPUT_EH_REGION_END
2122 ASM_OUTPUT_EH_REGION_END (file, NOTE_EH_HANDLER (insn));
2127 case NOTE_INSN_PROLOGUE_END:
2128 #ifdef FUNCTION_END_PROLOGUE
2129 FUNCTION_END_PROLOGUE (file);
2131 profile_after_prologue (file);
2134 case NOTE_INSN_EPILOGUE_BEG:
2135 #ifdef FUNCTION_BEGIN_EPILOGUE
2136 FUNCTION_BEGIN_EPILOGUE (file);
2140 case NOTE_INSN_FUNCTION_BEG:
2141 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
2142 /* MIPS stabs require the parameter descriptions to be after the
2143 function entry point rather than before. */
2144 if (write_symbols == SDB_DEBUG)
2147 sdbout_begin_function (last_linenum);
2150 #ifdef DWARF_DEBUGGING_INFO
2151 /* This outputs a marker where the function body starts, so it
2152 must be after the prologue. */
2153 if (write_symbols == DWARF_DEBUG)
2156 dwarfout_begin_function ();
2161 case NOTE_INSN_BLOCK_BEG:
2162 if (debug_info_level == DINFO_LEVEL_NORMAL
2163 || debug_info_level == DINFO_LEVEL_VERBOSE
2164 || write_symbols == DWARF_DEBUG
2165 || write_symbols == DWARF2_DEBUG)
2167 int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
2171 high_block_linenum = last_linenum;
2173 /* Output debugging info about the symbol-block beginning. */
2174 #ifdef SDB_DEBUGGING_INFO
2175 if (write_symbols == SDB_DEBUG)
2176 sdbout_begin_block (file, last_linenum, n);
2178 #ifdef XCOFF_DEBUGGING_INFO
2179 if (write_symbols == XCOFF_DEBUG)
2180 xcoffout_begin_block (file, last_linenum, n);
2182 #ifdef DBX_DEBUGGING_INFO
2183 if (write_symbols == DBX_DEBUG)
2184 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", n);
2186 #ifdef DWARF_DEBUGGING_INFO
2187 if (write_symbols == DWARF_DEBUG)
2188 dwarfout_begin_block (n);
2190 #ifdef DWARF2_DEBUGGING_INFO
2191 if (write_symbols == DWARF2_DEBUG)
2192 dwarf2out_begin_block (n);
2195 /* Mark this block as output. */
2196 TREE_ASM_WRITTEN (NOTE_BLOCK (insn)) = 1;
2200 case NOTE_INSN_BLOCK_END:
2201 if (debug_info_level == DINFO_LEVEL_NORMAL
2202 || debug_info_level == DINFO_LEVEL_VERBOSE
2203 || write_symbols == DWARF_DEBUG
2204 || write_symbols == DWARF2_DEBUG)
2206 int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
2210 /* End of a symbol-block. */
2212 if (block_depth < 0)
2215 #ifdef XCOFF_DEBUGGING_INFO
2216 if (write_symbols == XCOFF_DEBUG)
2217 xcoffout_end_block (file, high_block_linenum, n);
2219 #ifdef DBX_DEBUGGING_INFO
2220 if (write_symbols == DBX_DEBUG)
2221 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE", n);
2223 #ifdef SDB_DEBUGGING_INFO
2224 if (write_symbols == SDB_DEBUG)
2225 sdbout_end_block (file, high_block_linenum, n);
2227 #ifdef DWARF_DEBUGGING_INFO
2228 if (write_symbols == DWARF_DEBUG)
2229 dwarfout_end_block (n);
2231 #ifdef DWARF2_DEBUGGING_INFO
2232 if (write_symbols == DWARF2_DEBUG)
2233 dwarf2out_end_block (n);
2238 case NOTE_INSN_DELETED_LABEL:
2239 /* Emit the label. We may have deleted the CODE_LABEL because
2240 the label could be proved to be unreachable, though still
2241 referenced (in the form of having its address taken. */
2242 /* ??? Figure out how not to do this unconditionally. This
2243 interferes with bundling on LIW targets. */
2244 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2246 if (debug_info_level == DINFO_LEVEL_NORMAL
2247 || debug_info_level == DINFO_LEVEL_VERBOSE)
2249 #ifdef DWARF_DEBUGGING_INFO
2250 if (write_symbols == DWARF_DEBUG)
2251 dwarfout_label (insn);
2253 #ifdef DWARF2_DEBUGGING_INFO
2254 if (write_symbols == DWARF2_DEBUG)
2255 dwarf2out_label (insn);
2264 if (NOTE_LINE_NUMBER (insn) <= 0)
2267 /* This note is a line-number. */
2272 /* If there is anything real after this note, output it.
2273 If another line note follows, omit this one. */
2274 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
2276 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
2279 /* These types of notes can be significant
2280 so make sure the preceding line number stays. */
2281 else if (GET_CODE (note) == NOTE
2282 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
2283 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
2284 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
2286 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
2288 /* Another line note follows; we can delete this note
2289 if no intervening line numbers have notes elsewhere. */
2291 for (num = NOTE_LINE_NUMBER (insn) + 1;
2292 num < NOTE_LINE_NUMBER (note);
2294 if (line_note_exists[num])
2297 if (num >= NOTE_LINE_NUMBER (note))
2303 /* Output this line note if it is the first or the last line
2306 output_source_line (file, insn);
2313 #if defined (DWARF2_UNWIND_INFO)
2314 /* If we push arguments, we need to check all insns for stack
2316 if (!ACCUMULATE_OUTGOING_ARGS && dwarf2out_do_frame ())
2317 dwarf2out_frame_debug (insn);
2322 /* The target port might emit labels in the output function for
2323 some insn, e.g. sh.c output_branchy_insn. */
2324 if (CODE_LABEL_NUMBER (insn) <= max_labelno)
2326 int align = LABEL_TO_ALIGNMENT (insn);
2327 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2328 int max_skip = LABEL_TO_MAX_SKIP (insn);
2331 if (align && NEXT_INSN (insn))
2332 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2333 ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip);
2335 ASM_OUTPUT_ALIGN (file, align);
2340 /* If this label is reached from only one place, set the condition
2341 codes from the instruction just before the branch. */
2343 /* Disabled because some insns set cc_status in the C output code
2344 and NOTICE_UPDATE_CC alone can set incorrect status. */
2345 if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
2347 rtx jump = LABEL_REFS (insn);
2348 rtx barrier = prev_nonnote_insn (insn);
2350 /* If the LABEL_REFS field of this label has been set to point
2351 at a branch, the predecessor of the branch is a regular
2352 insn, and that branch is the only way to reach this label,
2353 set the condition codes based on the branch and its
2355 if (barrier && GET_CODE (barrier) == BARRIER
2356 && jump && GET_CODE (jump) == JUMP_INSN
2357 && (prev = prev_nonnote_insn (jump))
2358 && GET_CODE (prev) == INSN)
2360 NOTICE_UPDATE_CC (PATTERN (prev), prev);
2361 NOTICE_UPDATE_CC (PATTERN (jump), jump);
2369 #ifdef FINAL_PRESCAN_LABEL
2370 FINAL_PRESCAN_INSN (insn, NULL_PTR, 0);
2373 #ifdef SDB_DEBUGGING_INFO
2374 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
2375 sdbout_label (insn);
2377 #ifdef DWARF_DEBUGGING_INFO
2378 if (write_symbols == DWARF_DEBUG && LABEL_NAME (insn))
2379 dwarfout_label (insn);
2381 #ifdef DWARF2_DEBUGGING_INFO
2382 if (write_symbols == DWARF2_DEBUG && LABEL_NAME (insn))
2383 dwarf2out_label (insn);
2387 fputs (ASM_APP_OFF, file);
2390 if (NEXT_INSN (insn) != 0
2391 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
2393 rtx nextbody = PATTERN (NEXT_INSN (insn));
2395 /* If this label is followed by a jump-table,
2396 make sure we put the label in the read-only section. Also
2397 possibly write the label and jump table together. */
2399 if (GET_CODE (nextbody) == ADDR_VEC
2400 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
2402 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2403 /* In this case, the case vector is being moved by the
2404 target, so don't output the label at all. Leave that
2405 to the back end macros. */
2407 if (! JUMP_TABLES_IN_TEXT_SECTION)
2409 readonly_data_section ();
2410 #ifdef READONLY_DATA_SECTION
2411 ASM_OUTPUT_ALIGN (file,
2412 exact_log2 (BIGGEST_ALIGNMENT
2414 #endif /* READONLY_DATA_SECTION */
2417 function_section (current_function_decl);
2419 #ifdef ASM_OUTPUT_CASE_LABEL
2420 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
2423 if (LABEL_ALTERNATE_NAME (insn))
2424 ASM_OUTPUT_ALTERNATE_LABEL_NAME (file, insn);
2426 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2432 if (LABEL_ALTERNATE_NAME (insn))
2433 ASM_OUTPUT_ALTERNATE_LABEL_NAME (file, insn);
2435 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2440 register rtx body = PATTERN (insn);
2441 int insn_code_number;
2442 const char *template;
2447 /* An INSN, JUMP_INSN or CALL_INSN.
2448 First check for special kinds that recog doesn't recognize. */
2450 if (GET_CODE (body) == USE /* These are just declarations */
2451 || GET_CODE (body) == CLOBBER)
2455 /* If there is a REG_CC_SETTER note on this insn, it means that
2456 the setting of the condition code was done in the delay slot
2457 of the insn that branched here. So recover the cc status
2458 from the insn that set it. */
2460 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
2463 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
2464 cc_prev_status = cc_status;
2468 /* Detect insns that are really jump-tables
2469 and output them as such. */
2471 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
2473 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2474 register int vlen, idx;
2482 fputs (ASM_APP_OFF, file);
2486 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2487 if (GET_CODE (body) == ADDR_VEC)
2489 #ifdef ASM_OUTPUT_ADDR_VEC
2490 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2497 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2498 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2504 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
2505 for (idx = 0; idx < vlen; idx++)
2507 if (GET_CODE (body) == ADDR_VEC)
2509 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2510 ASM_OUTPUT_ADDR_VEC_ELT
2511 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
2518 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2519 ASM_OUTPUT_ADDR_DIFF_ELT
2522 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
2523 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
2529 #ifdef ASM_OUTPUT_CASE_END
2530 ASM_OUTPUT_CASE_END (file,
2531 CODE_LABEL_NUMBER (PREV_INSN (insn)),
2536 function_section (current_function_decl);
2541 /* Do basic-block profiling when we reach a new block.
2542 Done here to avoid jump tables. */
2543 if (profile_block_flag && new_block)
2546 if (GET_CODE (body) == ASM_INPUT)
2548 /* There's no telling what that did to the condition codes. */
2554 fputs (ASM_APP_ON, file);
2557 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
2561 /* Detect `asm' construct with operands. */
2562 if (asm_noperands (body) >= 0)
2564 unsigned int noperands = asm_noperands (body);
2565 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
2568 /* There's no telling what that did to the condition codes. */
2575 fputs (ASM_APP_ON, file);
2579 /* Get out the operand values. */
2580 string = decode_asm_operands (body, ops, NULL_PTR,
2581 NULL_PTR, NULL_PTR);
2582 /* Inhibit aborts on what would otherwise be compiler bugs. */
2583 insn_noperands = noperands;
2584 this_is_asm_operands = insn;
2586 /* Output the insn using them. */
2587 output_asm_insn (string, ops);
2588 this_is_asm_operands = 0;
2592 if (prescan <= 0 && app_on)
2594 fputs (ASM_APP_OFF, file);
2598 if (GET_CODE (body) == SEQUENCE)
2600 /* A delayed-branch sequence */
2606 final_sequence = body;
2608 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2609 force the restoration of a comparison that was previously
2610 thought unnecessary. If that happens, cancel this sequence
2611 and cause that insn to be restored. */
2613 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
2614 if (next != XVECEXP (body, 0, 1))
2620 for (i = 1; i < XVECLEN (body, 0); i++)
2622 rtx insn = XVECEXP (body, 0, i);
2623 rtx next = NEXT_INSN (insn);
2624 /* We loop in case any instruction in a delay slot gets
2627 insn = final_scan_insn (insn, file, 0, prescan, 1);
2628 while (insn != next);
2630 #ifdef DBR_OUTPUT_SEQEND
2631 DBR_OUTPUT_SEQEND (file);
2635 /* If the insn requiring the delay slot was a CALL_INSN, the
2636 insns in the delay slot are actually executed before the
2637 called function. Hence we don't preserve any CC-setting
2638 actions in these insns and the CC must be marked as being
2639 clobbered by the function. */
2640 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
2645 /* Following a conditional branch sequence, we have a new basic
2647 if (profile_block_flag)
2649 rtx insn = XVECEXP (body, 0, 0);
2650 rtx body = PATTERN (insn);
2652 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2653 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2654 || (GET_CODE (insn) == JUMP_INSN
2655 && GET_CODE (body) == PARALLEL
2656 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2657 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
2663 /* We have a real machine instruction as rtl. */
2665 body = PATTERN (insn);
2668 set = single_set(insn);
2670 /* Check for redundant test and compare instructions
2671 (when the condition codes are already set up as desired).
2672 This is done only when optimizing; if not optimizing,
2673 it should be possible for the user to alter a variable
2674 with the debugger in between statements
2675 and the next statement should reexamine the variable
2676 to compute the condition codes. */
2681 rtx set = single_set(insn);
2685 && GET_CODE (SET_DEST (set)) == CC0
2686 && insn != last_ignored_compare)
2688 if (GET_CODE (SET_SRC (set)) == SUBREG)
2689 SET_SRC (set) = alter_subreg (SET_SRC (set));
2690 else if (GET_CODE (SET_SRC (set)) == COMPARE)
2692 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
2693 XEXP (SET_SRC (set), 0)
2694 = alter_subreg (XEXP (SET_SRC (set), 0));
2695 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
2696 XEXP (SET_SRC (set), 1)
2697 = alter_subreg (XEXP (SET_SRC (set), 1));
2699 if ((cc_status.value1 != 0
2700 && rtx_equal_p (SET_SRC (set), cc_status.value1))
2701 || (cc_status.value2 != 0
2702 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
2704 /* Don't delete insn if it has an addressing side-effect. */
2705 if (! FIND_REG_INC_NOTE (insn, 0)
2706 /* or if anything in it is volatile. */
2707 && ! volatile_refs_p (PATTERN (insn)))
2709 /* We don't really delete the insn; just ignore it. */
2710 last_ignored_compare = insn;
2718 /* Following a conditional branch, we have a new basic block.
2719 But if we are inside a sequence, the new block starts after the
2720 last insn of the sequence. */
2721 if (profile_block_flag && final_sequence == 0
2722 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2723 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2724 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
2725 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2726 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
2730 /* Don't bother outputting obvious no-ops, even without -O.
2731 This optimization is fast and doesn't interfere with debugging.
2732 Don't do this if the insn is in a delay slot, since this
2733 will cause an improper number of delay insns to be written. */
2734 if (final_sequence == 0
2736 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
2737 && GET_CODE (SET_SRC (body)) == REG
2738 && GET_CODE (SET_DEST (body)) == REG
2739 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
2744 /* If this is a conditional branch, maybe modify it
2745 if the cc's are in a nonstandard state
2746 so that it accomplishes the same thing that it would
2747 do straightforwardly if the cc's were set up normally. */
2749 if (cc_status.flags != 0
2750 && GET_CODE (insn) == JUMP_INSN
2751 && GET_CODE (body) == SET
2752 && SET_DEST (body) == pc_rtx
2753 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
2754 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
2755 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
2756 /* This is done during prescan; it is not done again
2757 in final scan when prescan has been done. */
2760 /* This function may alter the contents of its argument
2761 and clear some of the cc_status.flags bits.
2762 It may also return 1 meaning condition now always true
2763 or -1 meaning condition now always false
2764 or 2 meaning condition nontrivial but altered. */
2765 register int result = alter_cond (XEXP (SET_SRC (body), 0));
2766 /* If condition now has fixed value, replace the IF_THEN_ELSE
2767 with its then-operand or its else-operand. */
2769 SET_SRC (body) = XEXP (SET_SRC (body), 1);
2771 SET_SRC (body) = XEXP (SET_SRC (body), 2);
2773 /* The jump is now either unconditional or a no-op.
2774 If it has become a no-op, don't try to output it.
2775 (It would not be recognized.) */
2776 if (SET_SRC (body) == pc_rtx)
2778 PUT_CODE (insn, NOTE);
2779 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2780 NOTE_SOURCE_FILE (insn) = 0;
2783 else if (GET_CODE (SET_SRC (body)) == RETURN)
2784 /* Replace (set (pc) (return)) with (return). */
2785 PATTERN (insn) = body = SET_SRC (body);
2787 /* Rerecognize the instruction if it has changed. */
2789 INSN_CODE (insn) = -1;
2792 /* Make same adjustments to instructions that examine the
2793 condition codes without jumping and instructions that
2794 handle conditional moves (if this machine has either one). */
2796 if (cc_status.flags != 0
2799 rtx cond_rtx, then_rtx, else_rtx;
2801 if (GET_CODE (insn) != JUMP_INSN
2802 && GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
2804 cond_rtx = XEXP (SET_SRC (set), 0);
2805 then_rtx = XEXP (SET_SRC (set), 1);
2806 else_rtx = XEXP (SET_SRC (set), 2);
2810 cond_rtx = SET_SRC (set);
2811 then_rtx = const_true_rtx;
2812 else_rtx = const0_rtx;
2815 switch (GET_CODE (cond_rtx))
2828 register int result;
2829 if (XEXP (cond_rtx, 0) != cc0_rtx)
2831 result = alter_cond (cond_rtx);
2833 validate_change (insn, &SET_SRC (set), then_rtx, 0);
2834 else if (result == -1)
2835 validate_change (insn, &SET_SRC (set), else_rtx, 0);
2836 else if (result == 2)
2837 INSN_CODE (insn) = -1;
2838 if (SET_DEST (set) == SET_SRC (set))
2840 PUT_CODE (insn, NOTE);
2841 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2842 NOTE_SOURCE_FILE (insn) = 0;
2854 #ifdef HAVE_peephole
2855 /* Do machine-specific peephole optimizations if desired. */
2857 if (optimize && !flag_no_peephole && !nopeepholes)
2859 rtx next = peephole (insn);
2860 /* When peepholing, if there were notes within the peephole,
2861 emit them before the peephole. */
2862 if (next != 0 && next != NEXT_INSN (insn))
2864 rtx prev = PREV_INSN (insn);
2867 for (note = NEXT_INSN (insn); note != next;
2868 note = NEXT_INSN (note))
2869 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2871 /* In case this is prescan, put the notes
2872 in proper position for later rescan. */
2873 note = NEXT_INSN (insn);
2874 PREV_INSN (note) = prev;
2875 NEXT_INSN (prev) = note;
2876 NEXT_INSN (PREV_INSN (next)) = insn;
2877 PREV_INSN (insn) = PREV_INSN (next);
2878 NEXT_INSN (insn) = next;
2879 PREV_INSN (next) = insn;
2882 /* PEEPHOLE might have changed this. */
2883 body = PATTERN (insn);
2887 /* Try to recognize the instruction.
2888 If successful, verify that the operands satisfy the
2889 constraints for the instruction. Crash if they don't,
2890 since `reload' should have changed them so that they do. */
2892 insn_code_number = recog_memoized (insn);
2893 extract_insn (insn);
2894 cleanup_subreg_operands (insn);
2896 if (! constrain_operands (1))
2897 fatal_insn_not_found (insn);
2899 /* Some target machines need to prescan each insn before
2902 #ifdef FINAL_PRESCAN_INSN
2903 FINAL_PRESCAN_INSN (insn, recog_data.operand, recog_data.n_operands);
2906 #ifdef HAVE_conditional_execution
2907 if (GET_CODE (PATTERN (insn)) == COND_EXEC)
2908 current_insn_predicate = COND_EXEC_TEST (PATTERN (insn));
2910 current_insn_predicate = NULL_RTX;
2914 cc_prev_status = cc_status;
2916 /* Update `cc_status' for this instruction.
2917 The instruction's output routine may change it further.
2918 If the output routine for a jump insn needs to depend
2919 on the cc status, it should look at cc_prev_status. */
2921 NOTICE_UPDATE_CC (body, insn);
2926 #if defined (DWARF2_UNWIND_INFO)
2927 /* If we push arguments, we want to know where the calls are. */
2928 if (!ACCUMULATE_OUTGOING_ARGS && GET_CODE (insn) == CALL_INSN
2929 && dwarf2out_do_frame ())
2930 dwarf2out_frame_debug (insn);
2933 /* Find the proper template for this insn. */
2934 template = get_insn_template (insn_code_number, insn);
2936 /* If the C code returns 0, it means that it is a jump insn
2937 which follows a deleted test insn, and that test insn
2938 needs to be reinserted. */
2941 if (prev_nonnote_insn (insn) != last_ignored_compare)
2944 return prev_nonnote_insn (insn);
2947 /* If the template is the string "#", it means that this insn must
2949 if (template[0] == '#' && template[1] == '\0')
2951 rtx new = try_split (body, insn, 0);
2953 /* If we didn't split the insn, go away. */
2954 if (new == insn && PATTERN (new) == body)
2955 fatal_insn ("Could not split insn", insn);
2957 #ifdef HAVE_ATTR_length
2958 /* This instruction should have been split in shorten_branches,
2959 to ensure that we would have valid length info for the
2971 /* Output assembler code from the template. */
2973 output_asm_insn (template, recog_data.operand);
2975 #if defined (DWARF2_UNWIND_INFO)
2976 /* If we push arguments, we need to check all insns for stack
2978 if (!ACCUMULATE_OUTGOING_ARGS)
2980 if (GET_CODE (insn) == INSN && dwarf2out_do_frame ())
2981 dwarf2out_frame_debug (insn);
2985 #if defined (HAVE_prologue)
2986 /* If this insn is part of the prologue, emit DWARF v2
2988 if (RTX_FRAME_RELATED_P (insn) && dwarf2out_do_frame ())
2989 dwarf2out_frame_debug (insn);
2995 /* It's not at all clear why we did this and doing so interferes
2996 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2999 /* Mark this insn as having been output. */
3000 INSN_DELETED_P (insn) = 1;
3006 return NEXT_INSN (insn);
3009 /* Output debugging info to the assembler file FILE
3010 based on the NOTE-insn INSN, assumed to be a line number. */
3013 output_source_line (file, insn)
3014 FILE *file ATTRIBUTE_UNUSED;
3017 register const char *filename = NOTE_SOURCE_FILE (insn);
3019 /* Remember filename for basic block profiling.
3020 Filenames are allocated on the permanent obstack
3021 or are passed in ARGV, so we don't have to save
3024 if (profile_block_flag && last_filename != filename)
3025 bb_file_label_num = add_bb_string (filename, TRUE);
3027 last_filename = filename;
3028 last_linenum = NOTE_LINE_NUMBER (insn);
3029 high_block_linenum = MAX (last_linenum, high_block_linenum);
3030 high_function_linenum = MAX (last_linenum, high_function_linenum);
3032 if (write_symbols != NO_DEBUG)
3034 #ifdef SDB_DEBUGGING_INFO
3035 if (write_symbols == SDB_DEBUG
3036 #if 0 /* People like having line numbers even in wrong file! */
3037 /* COFF can't handle multiple source files--lose, lose. */
3038 && !strcmp (filename, main_input_filename)
3040 /* COFF relative line numbers must be positive. */
3041 && last_linenum > sdb_begin_function_line)
3043 #ifdef ASM_OUTPUT_SOURCE_LINE
3044 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
3046 fprintf (file, "\t.ln\t%d\n",
3047 ((sdb_begin_function_line > -1)
3048 ? last_linenum - sdb_begin_function_line : 1));
3053 #if defined (DBX_DEBUGGING_INFO)
3054 if (write_symbols == DBX_DEBUG)
3055 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
3058 #if defined (XCOFF_DEBUGGING_INFO)
3059 if (write_symbols == XCOFF_DEBUG)
3060 xcoffout_source_line (file, filename, insn);
3063 #ifdef DWARF_DEBUGGING_INFO
3064 if (write_symbols == DWARF_DEBUG)
3065 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
3068 #ifdef DWARF2_DEBUGGING_INFO
3069 if (write_symbols == DWARF2_DEBUG)
3070 dwarf2out_line (filename, NOTE_LINE_NUMBER (insn));
3076 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3077 directly to the desired hard register. */
3079 cleanup_subreg_operands (insn)
3084 extract_insn (insn);
3085 for (i = 0; i < recog_data.n_operands; i++)
3087 if (GET_CODE (recog_data.operand[i]) == SUBREG)
3088 recog_data.operand[i] = alter_subreg (recog_data.operand[i]);
3089 else if (GET_CODE (recog_data.operand[i]) == PLUS
3090 || GET_CODE (recog_data.operand[i]) == MULT)
3091 recog_data.operand[i] = walk_alter_subreg (recog_data.operand[i]);
3094 for (i = 0; i < recog_data.n_dups; i++)
3096 if (GET_CODE (*recog_data.dup_loc[i]) == SUBREG)
3097 *recog_data.dup_loc[i] = alter_subreg (*recog_data.dup_loc[i]);
3098 else if (GET_CODE (*recog_data.dup_loc[i]) == PLUS
3099 || GET_CODE (*recog_data.dup_loc[i]) == MULT)
3100 *recog_data.dup_loc[i] = walk_alter_subreg (*recog_data.dup_loc[i]);
3104 /* If X is a SUBREG, replace it with a REG or a MEM,
3105 based on the thing it is a subreg of. */
3111 register rtx y = SUBREG_REG (x);
3113 if (GET_CODE (y) == SUBREG)
3114 y = alter_subreg (y);
3116 /* If reload is operating, we may be replacing inside this SUBREG.
3117 Check for that and make a new one if so. */
3118 if (reload_in_progress && find_replacement (&SUBREG_REG (x)) != 0)
3121 if (GET_CODE (y) == REG)
3124 /* If the word size is larger than the size of this register,
3125 adjust the register number to compensate. */
3126 /* ??? Note that this just catches stragglers created by/for
3127 integrate. It would be better if we either caught these
3128 earlier, or kept _all_ subregs until now and eliminate
3129 gen_lowpart and friends. */
3131 #ifdef ALTER_HARD_SUBREG
3132 regno = ALTER_HARD_SUBREG(GET_MODE (x), SUBREG_WORD (x),
3133 GET_MODE (y), REGNO (y));
3135 regno = REGNO (y) + SUBREG_WORD (x);
3139 /* This field has a different meaning for REGs and SUBREGs. Make sure
3143 else if (GET_CODE (y) == MEM)
3145 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
3147 if (BYTES_BIG_ENDIAN)
3148 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
3149 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
3151 MEM_COPY_ATTRIBUTES (x, y);
3152 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
3158 /* Do alter_subreg on all the SUBREGs contained in X. */
3161 walk_alter_subreg (x)
3164 switch (GET_CODE (x))
3168 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3169 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
3173 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3177 return alter_subreg (x);
3188 /* Given BODY, the body of a jump instruction, alter the jump condition
3189 as required by the bits that are set in cc_status.flags.
3190 Not all of the bits there can be handled at this level in all cases.
3192 The value is normally 0.
3193 1 means that the condition has become always true.
3194 -1 means that the condition has become always false.
3195 2 means that COND has been altered. */
3203 if (cc_status.flags & CC_REVERSED)
3206 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
3209 if (cc_status.flags & CC_INVERTED)
3212 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
3215 if (cc_status.flags & CC_NOT_POSITIVE)
3216 switch (GET_CODE (cond))
3221 /* Jump becomes unconditional. */
3227 /* Jump becomes no-op. */
3231 PUT_CODE (cond, EQ);
3236 PUT_CODE (cond, NE);
3244 if (cc_status.flags & CC_NOT_NEGATIVE)
3245 switch (GET_CODE (cond))
3249 /* Jump becomes unconditional. */
3254 /* Jump becomes no-op. */
3259 PUT_CODE (cond, EQ);
3265 PUT_CODE (cond, NE);
3273 if (cc_status.flags & CC_NO_OVERFLOW)
3274 switch (GET_CODE (cond))
3277 /* Jump becomes unconditional. */
3281 PUT_CODE (cond, EQ);
3286 PUT_CODE (cond, NE);
3291 /* Jump becomes no-op. */
3298 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
3299 switch (GET_CODE (cond))
3305 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
3310 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
3315 if (cc_status.flags & CC_NOT_SIGNED)
3316 /* The flags are valid if signed condition operators are converted
3318 switch (GET_CODE (cond))
3321 PUT_CODE (cond, LEU);
3326 PUT_CODE (cond, LTU);
3331 PUT_CODE (cond, GTU);
3336 PUT_CODE (cond, GEU);
3348 /* Report inconsistency between the assembler template and the operands.
3349 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3352 output_operand_lossage (msgid)
3355 if (this_is_asm_operands)
3356 error_for_asm (this_is_asm_operands, "invalid `asm': %s", _(msgid));
3359 error ("output_operand: %s", _(msgid));
3364 /* Output of assembler code from a template, and its subroutines. */
3366 /* Output text from TEMPLATE to the assembler output file,
3367 obeying %-directions to substitute operands taken from
3368 the vector OPERANDS.
3370 %N (for N a digit) means print operand N in usual manner.
3371 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3372 and print the label name with no punctuation.
3373 %cN means require operand N to be a constant
3374 and print the constant expression with no punctuation.
3375 %aN means expect operand N to be a memory address
3376 (not a memory reference!) and print a reference
3378 %nN means expect operand N to be a constant
3379 and print a constant expression for minus the value
3380 of the operand, with no other punctuation. */
3385 if (flag_print_asm_name)
3387 /* Annotate the assembly with a comment describing the pattern and
3388 alternative used. */
3391 register int num = INSN_CODE (debug_insn);
3392 fprintf (asm_out_file, "\t%s %d\t%s",
3393 ASM_COMMENT_START, INSN_UID (debug_insn),
3394 insn_data[num].name);
3395 if (insn_data[num].n_alternatives > 1)
3396 fprintf (asm_out_file, "/%d", which_alternative + 1);
3397 #ifdef HAVE_ATTR_length
3398 fprintf (asm_out_file, "\t[length = %d]",
3399 get_attr_length (debug_insn));
3401 /* Clear this so only the first assembler insn
3402 of any rtl insn will get the special comment for -dp. */
3409 output_asm_insn (template, operands)
3410 const char *template;
3413 register const char *p;
3416 /* An insn may return a null string template
3417 in a case where no assembler code is needed. */
3422 putc ('\t', asm_out_file);
3424 #ifdef ASM_OUTPUT_OPCODE
3425 ASM_OUTPUT_OPCODE (asm_out_file, p);
3433 putc (c, asm_out_file);
3434 #ifdef ASM_OUTPUT_OPCODE
3435 while ((c = *p) == '\t')
3437 putc (c, asm_out_file);
3440 ASM_OUTPUT_OPCODE (asm_out_file, p);
3444 #ifdef ASSEMBLER_DIALECT
3449 /* If we want the first dialect, do nothing. Otherwise, skip
3450 DIALECT_NUMBER of strings ending with '|'. */
3451 for (i = 0; i < dialect_number; i++)
3453 while (*p && *p != '}' && *p++ != '|')
3464 /* Skip to close brace. */
3465 while (*p && *p++ != '}')
3474 /* %% outputs a single %. */
3478 putc (c, asm_out_file);
3480 /* %= outputs a number which is unique to each insn in the entire
3481 compilation. This is useful for making local labels that are
3482 referred to more than once in a given insn. */
3486 fprintf (asm_out_file, "%d", insn_counter);
3488 /* % followed by a letter and some digits
3489 outputs an operand in a special way depending on the letter.
3490 Letters `acln' are implemented directly.
3491 Other letters are passed to `output_operand' so that
3492 the PRINT_OPERAND macro can define them. */
3493 else if (ISLOWER(*p) || ISUPPER(*p))
3498 if (! (*p >= '0' && *p <= '9'))
3499 output_operand_lossage ("operand number missing after %-letter");
3500 else if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3501 output_operand_lossage ("operand number out of range");
3502 else if (letter == 'l')
3503 output_asm_label (operands[c]);
3504 else if (letter == 'a')
3505 output_address (operands[c]);
3506 else if (letter == 'c')
3508 if (CONSTANT_ADDRESS_P (operands[c]))
3509 output_addr_const (asm_out_file, operands[c]);
3511 output_operand (operands[c], 'c');
3513 else if (letter == 'n')
3515 if (GET_CODE (operands[c]) == CONST_INT)
3516 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
3517 - INTVAL (operands[c]));
3520 putc ('-', asm_out_file);
3521 output_addr_const (asm_out_file, operands[c]);
3525 output_operand (operands[c], letter);
3527 while ((c = *p) >= '0' && c <= '9') p++;
3529 /* % followed by a digit outputs an operand the default way. */
3530 else if (*p >= '0' && *p <= '9')
3533 if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3534 output_operand_lossage ("operand number out of range");
3536 output_operand (operands[c], 0);
3537 while ((c = *p) >= '0' && c <= '9') p++;
3539 /* % followed by punctuation: output something for that
3540 punctuation character alone, with no operand.
3541 The PRINT_OPERAND macro decides what is actually done. */
3542 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3543 else if (PRINT_OPERAND_PUNCT_VALID_P ((unsigned char)*p))
3544 output_operand (NULL_RTX, *p++);
3547 output_operand_lossage ("invalid %%-code");
3551 putc (c, asm_out_file);
3556 putc ('\n', asm_out_file);
3559 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3562 output_asm_label (x)
3567 if (GET_CODE (x) == LABEL_REF)
3569 if (GET_CODE (x) == CODE_LABEL
3570 || (GET_CODE (x) == NOTE
3571 && NOTE_LINE_NUMBER (x) == NOTE_INSN_DELETED_LABEL))
3572 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3574 output_operand_lossage ("`%l' operand isn't a label");
3576 assemble_name (asm_out_file, buf);
3579 /* Print operand X using machine-dependent assembler syntax.
3580 The macro PRINT_OPERAND is defined just to control this function.
3581 CODE is a non-digit that preceded the operand-number in the % spec,
3582 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3583 between the % and the digits.
3584 When CODE is a non-letter, X is 0.
3586 The meanings of the letters are machine-dependent and controlled
3587 by PRINT_OPERAND. */
3590 output_operand (x, code)
3592 int code ATTRIBUTE_UNUSED;
3594 if (x && GET_CODE (x) == SUBREG)
3595 x = alter_subreg (x);
3597 /* If X is a pseudo-register, abort now rather than writing trash to the
3600 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
3603 PRINT_OPERAND (asm_out_file, x, code);
3606 /* Print a memory reference operand for address X
3607 using machine-dependent assembler syntax.
3608 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3614 walk_alter_subreg (x);
3615 PRINT_OPERAND_ADDRESS (asm_out_file, x);
3618 /* Print an integer constant expression in assembler syntax.
3619 Addition and subtraction are the only arithmetic
3620 that may appear in these expressions. */
3623 output_addr_const (file, x)
3630 switch (GET_CODE (x))
3640 assemble_name (file, XSTR (x, 0));
3644 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3645 assemble_name (file, buf);
3649 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3650 assemble_name (file, buf);
3654 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
3658 /* This used to output parentheses around the expression,
3659 but that does not work on the 386 (either ATT or BSD assembler). */
3660 output_addr_const (file, XEXP (x, 0));
3664 if (GET_MODE (x) == VOIDmode)
3666 /* We can use %d if the number is one word and positive. */
3667 if (CONST_DOUBLE_HIGH (x))
3668 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3669 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
3670 else if (CONST_DOUBLE_LOW (x) < 0)
3671 fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
3673 fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
3676 /* We can't handle floating point constants;
3677 PRINT_OPERAND must handle them. */
3678 output_operand_lossage ("floating constant misused");
3682 /* Some assemblers need integer constants to appear last (eg masm). */
3683 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
3685 output_addr_const (file, XEXP (x, 1));
3686 if (INTVAL (XEXP (x, 0)) >= 0)
3687 fprintf (file, "+");
3688 output_addr_const (file, XEXP (x, 0));
3692 output_addr_const (file, XEXP (x, 0));
3693 if (INTVAL (XEXP (x, 1)) >= 0)
3694 fprintf (file, "+");
3695 output_addr_const (file, XEXP (x, 1));
3700 /* Avoid outputting things like x-x or x+5-x,
3701 since some assemblers can't handle that. */
3702 x = simplify_subtraction (x);
3703 if (GET_CODE (x) != MINUS)
3706 output_addr_const (file, XEXP (x, 0));
3707 fprintf (file, "-");
3708 if (GET_CODE (XEXP (x, 1)) == CONST_INT
3709 && INTVAL (XEXP (x, 1)) < 0)
3711 fprintf (file, "%s", ASM_OPEN_PAREN);
3712 output_addr_const (file, XEXP (x, 1));
3713 fprintf (file, "%s", ASM_CLOSE_PAREN);
3716 output_addr_const (file, XEXP (x, 1));
3721 output_addr_const (file, XEXP (x, 0));
3725 output_operand_lossage ("invalid expression as operand");
3729 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3730 %R prints the value of REGISTER_PREFIX.
3731 %L prints the value of LOCAL_LABEL_PREFIX.
3732 %U prints the value of USER_LABEL_PREFIX.
3733 %I prints the value of IMMEDIATE_PREFIX.
3734 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3735 Also supported are %d, %x, %s, %e, %f, %g and %%.
3737 We handle alternate assembler dialects here, just like output_asm_insn. */
3740 asm_fprintf VPARAMS ((FILE *file, const char *p, ...))
3742 #ifndef ANSI_PROTOTYPES
3750 VA_START (argptr, p);
3752 #ifndef ANSI_PROTOTYPES
3753 file = va_arg (argptr, FILE *);
3754 p = va_arg (argptr, const char *);
3762 #ifdef ASSEMBLER_DIALECT
3767 /* If we want the first dialect, do nothing. Otherwise, skip
3768 DIALECT_NUMBER of strings ending with '|'. */
3769 for (i = 0; i < dialect_number; i++)
3771 while (*p && *p++ != '|')
3781 /* Skip to close brace. */
3782 while (*p && *p++ != '}')
3793 while ((c >= '0' && c <= '9') || c == '.')
3801 fprintf (file, "%%");
3804 case 'd': case 'i': case 'u':
3805 case 'x': case 'p': case 'X':
3809 fprintf (file, buf, va_arg (argptr, int));
3813 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3814 but we do not check for those cases. It means that the value
3815 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3817 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3819 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3829 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3836 fprintf (file, buf, va_arg (argptr, long));
3844 fprintf (file, buf, va_arg (argptr, double));
3850 fprintf (file, buf, va_arg (argptr, char *));
3854 #ifdef ASM_OUTPUT_OPCODE
3855 ASM_OUTPUT_OPCODE (asm_out_file, p);
3860 #ifdef REGISTER_PREFIX
3861 fprintf (file, "%s", REGISTER_PREFIX);
3866 #ifdef IMMEDIATE_PREFIX
3867 fprintf (file, "%s", IMMEDIATE_PREFIX);
3872 #ifdef LOCAL_LABEL_PREFIX
3873 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
3878 fputs (user_label_prefix, file);
3881 #ifdef ASM_FPRINTF_EXTENSIONS
3882 /* Upper case letters are reserved for general use by asm_fprintf
3883 and so are not available to target specific code. In order to
3884 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
3885 they are defined here. As they get turned into real extensions
3886 to asm_fprintf they should be removed from this list. */
3887 case 'A': case 'B': case 'C': case 'D': case 'E':
3888 case 'F': case 'G': case 'H': case 'J': case 'K':
3889 case 'M': case 'N': case 'P': case 'Q': case 'S':
3890 case 'T': case 'V': case 'W': case 'Y': case 'Z':
3893 ASM_FPRINTF_EXTENSIONS (file, argptr, p)
3906 /* Split up a CONST_DOUBLE or integer constant rtx
3907 into two rtx's for single words,
3908 storing in *FIRST the word that comes first in memory in the target
3909 and in *SECOND the other. */
3912 split_double (value, first, second)
3914 rtx *first, *second;
3916 if (GET_CODE (value) == CONST_INT)
3918 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3920 /* In this case the CONST_INT holds both target words.
3921 Extract the bits from it into two word-sized pieces.
3922 Sign extend each half to HOST_WIDE_INT. */
3923 unsigned HOST_WIDE_INT low, high;
3924 unsigned HOST_WIDE_INT mask, sign_bit, sign_extend;
3926 /* Set sign_bit to the most significant bit of a word. */
3928 sign_bit <<= BITS_PER_WORD - 1;
3930 /* Set mask so that all bits of the word are set. We could
3931 have used 1 << BITS_PER_WORD instead of basing the
3932 calculation on sign_bit. However, on machines where
3933 HOST_BITS_PER_WIDE_INT == BITS_PER_WORD, it could cause a
3934 compiler warning, even though the code would never be
3936 mask = sign_bit << 1;
3939 /* Set sign_extend as any remaining bits. */
3940 sign_extend = ~mask;
3942 /* Pick the lower word and sign-extend it. */
3943 low = INTVAL (value);
3948 /* Pick the higher word, shifted to the least significant
3949 bits, and sign-extend it. */
3950 high = INTVAL (value);
3951 high >>= BITS_PER_WORD - 1;
3954 if (high & sign_bit)
3955 high |= sign_extend;
3957 /* Store the words in the target machine order. */
3958 if (WORDS_BIG_ENDIAN)
3960 *first = GEN_INT (high);
3961 *second = GEN_INT (low);
3965 *first = GEN_INT (low);
3966 *second = GEN_INT (high);
3971 /* The rule for using CONST_INT for a wider mode
3972 is that we regard the value as signed.
3973 So sign-extend it. */
3974 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
3975 if (WORDS_BIG_ENDIAN)
3987 else if (GET_CODE (value) != CONST_DOUBLE)
3989 if (WORDS_BIG_ENDIAN)
3991 *first = const0_rtx;
3997 *second = const0_rtx;
4000 else if (GET_MODE (value) == VOIDmode
4001 /* This is the old way we did CONST_DOUBLE integers. */
4002 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
4004 /* In an integer, the words are defined as most and least significant.
4005 So order them by the target's convention. */
4006 if (WORDS_BIG_ENDIAN)
4008 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
4009 *second = GEN_INT (CONST_DOUBLE_LOW (value));
4013 *first = GEN_INT (CONST_DOUBLE_LOW (value));
4014 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
4019 #ifdef REAL_ARITHMETIC
4020 REAL_VALUE_TYPE r; long l[2];
4021 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
4023 /* Note, this converts the REAL_VALUE_TYPE to the target's
4024 format, splits up the floating point double and outputs
4025 exactly 32 bits of it into each of l[0] and l[1] --
4026 not necessarily BITS_PER_WORD bits. */
4027 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
4029 /* If 32 bits is an entire word for the target, but not for the host,
4030 then sign-extend on the host so that the number will look the same
4031 way on the host that it would on the target. See for instance
4032 simplify_unary_operation. The #if is needed to avoid compiler
4035 #if HOST_BITS_PER_LONG > 32
4036 if (BITS_PER_WORD < HOST_BITS_PER_LONG && BITS_PER_WORD == 32)
4038 if (l[0] & ((long) 1 << 31))
4039 l[0] |= ((long) (-1) << 32);
4040 if (l[1] & ((long) 1 << 31))
4041 l[1] |= ((long) (-1) << 32);
4045 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
4046 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
4048 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
4049 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
4050 && ! flag_pretend_float)
4054 #ifdef HOST_WORDS_BIG_ENDIAN
4061 /* Host and target agree => no need to swap. */
4062 *first = GEN_INT (CONST_DOUBLE_LOW (value));
4063 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
4067 *second = GEN_INT (CONST_DOUBLE_LOW (value));
4068 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
4070 #endif /* no REAL_ARITHMETIC */
4074 /* Return nonzero if this function has no function calls. */
4081 if (profile_flag || profile_block_flag || profile_arc_flag)
4084 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4086 if (GET_CODE (insn) == CALL_INSN
4087 && ! SIBLING_CALL_P (insn))
4089 if (GET_CODE (insn) == INSN
4090 && GET_CODE (PATTERN (insn)) == SEQUENCE
4091 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN
4092 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn), 0, 0)))
4095 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4097 if (GET_CODE (XEXP (insn, 0)) == CALL_INSN
4098 && ! SIBLING_CALL_P (insn))
4100 if (GET_CODE (XEXP (insn, 0)) == INSN
4101 && GET_CODE (PATTERN (XEXP (insn, 0))) == SEQUENCE
4102 && GET_CODE (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)) == CALL_INSN
4103 && ! SIBLING_CALL_P (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)))
4110 /* On some machines, a function with no call insns
4111 can run faster if it doesn't create its own register window.
4112 When output, the leaf function should use only the "output"
4113 registers. Ordinarily, the function would be compiled to use
4114 the "input" registers to find its arguments; it is a candidate
4115 for leaf treatment if it uses only the "input" registers.
4116 Leaf function treatment means renumbering so the function
4117 uses the "output" registers instead. */
4119 #ifdef LEAF_REGISTERS
4121 /* Return 1 if this function uses only the registers that can be
4122 safely renumbered. */
4125 only_leaf_regs_used ()
4128 char *permitted_reg_in_leaf_functions = LEAF_REGISTERS;
4130 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4131 if ((regs_ever_live[i] || global_regs[i])
4132 && ! permitted_reg_in_leaf_functions[i])
4135 if (current_function_uses_pic_offset_table
4136 && pic_offset_table_rtx != 0
4137 && GET_CODE (pic_offset_table_rtx) == REG
4138 && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4144 /* Scan all instructions and renumber all registers into those
4145 available in leaf functions. */
4148 leaf_renumber_regs (first)
4153 /* Renumber only the actual patterns.
4154 The reg-notes can contain frame pointer refs,
4155 and renumbering them could crash, and should not be needed. */
4156 for (insn = first; insn; insn = NEXT_INSN (insn))
4157 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
4158 leaf_renumber_regs_insn (PATTERN (insn));
4159 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4160 if (GET_RTX_CLASS (GET_CODE (XEXP (insn, 0))) == 'i')
4161 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
4164 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4165 available in leaf functions. */
4168 leaf_renumber_regs_insn (in_rtx)
4169 register rtx in_rtx;
4172 register const char *format_ptr;
4177 /* Renumber all input-registers into output-registers.
4178 renumbered_regs would be 1 for an output-register;
4181 if (GET_CODE (in_rtx) == REG)
4185 /* Don't renumber the same reg twice. */
4189 newreg = REGNO (in_rtx);
4190 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4191 to reach here as part of a REG_NOTE. */
4192 if (newreg >= FIRST_PSEUDO_REGISTER)
4197 newreg = LEAF_REG_REMAP (newreg);
4200 regs_ever_live[REGNO (in_rtx)] = 0;
4201 regs_ever_live[newreg] = 1;
4202 REGNO (in_rtx) = newreg;
4206 if (GET_RTX_CLASS (GET_CODE (in_rtx)) == 'i')
4208 /* Inside a SEQUENCE, we find insns.
4209 Renumber just the patterns of these insns,
4210 just as we do for the top-level insns. */
4211 leaf_renumber_regs_insn (PATTERN (in_rtx));
4215 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
4217 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
4218 switch (*format_ptr++)
4221 leaf_renumber_regs_insn (XEXP (in_rtx, i));
4225 if (NULL != XVEC (in_rtx, i))
4227 for (j = 0; j < XVECLEN (in_rtx, i); j++)
4228 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));