1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-99, 2000 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This is the final pass of the compiler.
23 It looks at the rtl code for a function and outputs assembler code.
25 Call `final_start_function' to output the assembler code for function entry,
26 `final' to output assembler code for some RTL code,
27 `final_end_function' to output assembler code for function exit.
28 If a function is compiled in several pieces, each piece is
29 output separately with `final'.
31 Some optimizations are also done at this level.
32 Move instructions that were made unnecessary by good register allocation
33 are detected and omitted from the output. (Though most of these
34 are removed by the last jump pass.)
36 Instructions to set the condition codes are omitted when it can be
37 seen that the condition codes already had the desired values.
39 In some cases it is sufficient if the inherited condition codes
40 have related values, but this may require the following insn
41 (the one that tests the condition codes) to be modified.
43 The code for the function prologue and epilogue are generated
44 directly as assembler code by the macros FUNCTION_PROLOGUE and
45 FUNCTION_EPILOGUE. Those instructions never exist as rtl. */
54 #include "insn-config.h"
55 #include "insn-flags.h"
56 #include "insn-attr.h"
57 #include "insn-codes.h"
59 #include "conditions.h"
62 #include "hard-reg-set.h"
71 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
72 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
74 #if defined (USG) || !defined (HAVE_STAB_H)
75 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
80 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
82 #ifdef XCOFF_DEBUGGING_INFO
86 #ifdef DWARF_DEBUGGING_INFO
90 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
91 #include "dwarf2out.h"
94 #ifdef SDB_DEBUGGING_INFO
98 /* .stabd code for line number. */
103 /* .stabs code for included file name. */
108 #ifndef INT_TYPE_SIZE
109 #define INT_TYPE_SIZE BITS_PER_WORD
112 #ifndef LONG_TYPE_SIZE
113 #define LONG_TYPE_SIZE BITS_PER_WORD
116 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
117 null default for it to save conditionalization later. */
118 #ifndef CC_STATUS_INIT
119 #define CC_STATUS_INIT
122 /* How to start an assembler comment. */
123 #ifndef ASM_COMMENT_START
124 #define ASM_COMMENT_START ";#"
127 /* Is the given character a logical line separator for the assembler? */
128 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
129 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
132 #ifndef JUMP_TABLES_IN_TEXT_SECTION
133 #define JUMP_TABLES_IN_TEXT_SECTION 0
136 /* Last insn processed by final_scan_insn. */
137 static rtx debug_insn = 0;
139 /* Line number of last NOTE. */
140 static int last_linenum;
142 /* Highest line number in current block. */
143 static int high_block_linenum;
145 /* Likewise for function. */
146 static int high_function_linenum;
148 /* Filename of last NOTE. */
149 static char *last_filename;
151 /* Number of basic blocks seen so far;
152 used if profile_block_flag is set. */
153 static int count_basic_blocks;
155 /* Number of instrumented arcs when profile_arc_flag is set. */
156 extern int count_instrumented_arcs;
158 extern int length_unit_log; /* This is defined in insn-attrtab.c. */
160 /* Nonzero while outputting an `asm' with operands.
161 This means that inconsistencies are the user's fault, so don't abort.
162 The precise value is the insn being output, to pass to error_for_asm. */
163 static rtx this_is_asm_operands;
165 /* Number of operands of this insn, for an `asm' with operands. */
166 static unsigned int insn_noperands;
168 /* Compare optimization flag. */
170 static rtx last_ignored_compare = 0;
172 /* Flag indicating this insn is the start of a new basic block. */
174 static int new_block = 1;
176 /* All the symbol-blocks (levels of scoping) in the compilation
177 are assigned sequence numbers in order of appearance of the
178 beginnings of the symbol-blocks. Both final and dbxout do this,
179 and assume that they will both give the same number to each block.
180 Final uses these sequence numbers to generate assembler label names
181 LBBnnn and LBEnnn for the beginning and end of the symbol-block.
182 Dbxout uses the sequence numbers to generate references to the same labels
183 from the dbx debugging information.
185 Sdb records this level at the beginning of each function,
186 in order to find the current level when recursing down declarations.
187 It outputs the block beginning and endings
188 at the point in the asm file where the blocks would begin and end. */
190 int next_block_index;
192 /* Assign a unique number to each insn that is output.
193 This can be used to generate unique local labels. */
195 static int insn_counter = 0;
198 /* This variable contains machine-dependent flags (defined in tm.h)
199 set and examined by output routines
200 that describe how to interpret the condition codes properly. */
204 /* During output of an insn, this contains a copy of cc_status
205 from before the insn. */
207 CC_STATUS cc_prev_status;
210 /* Indexed by hardware reg number, is 1 if that register is ever
211 used in the current function.
213 In life_analysis, or in stupid_life_analysis, this is set
214 up to record the hard regs used explicitly. Reload adds
215 in the hard regs used for holding pseudo regs. Final uses
216 it to generate the code in the function prologue and epilogue
217 to save and restore registers as needed. */
219 char regs_ever_live[FIRST_PSEUDO_REGISTER];
221 /* Nonzero means current function must be given a frame pointer.
222 Set in stmt.c if anything is allocated on the stack there.
223 Set in reload1.c if anything is allocated on the stack there. */
225 int frame_pointer_needed;
227 /* Assign unique numbers to labels generated for profiling. */
229 int profile_label_no;
231 /* Length so far allocated in PENDING_BLOCKS. */
233 static int max_block_depth;
235 /* Stack of sequence numbers of symbol-blocks of which we have seen the
236 beginning but not yet the end. Sequence numbers are assigned at
237 the beginning; this stack allows us to find the sequence number
238 of a block that is ending. */
240 static int *pending_blocks;
242 /* Number of elements currently in use in PENDING_BLOCKS. */
244 static int block_depth;
246 /* Nonzero if have enabled APP processing of our assembler output. */
250 /* If we are outputting an insn sequence, this contains the sequence rtx.
255 #ifdef ASSEMBLER_DIALECT
257 /* Number of the assembler dialect to use, starting at 0. */
258 static int dialect_number;
261 /* Indexed by line number, nonzero if there is a note for that line. */
263 static char *line_note_exists;
265 /* Linked list to hold line numbers for each basic block. */
268 struct bb_list *next; /* pointer to next basic block */
269 int line_num; /* line number */
270 int file_label_num; /* LPBC<n> label # for stored filename */
271 int func_label_num; /* LPBC<n> label # for stored function name */
274 static struct bb_list *bb_head = 0; /* Head of basic block list */
275 static struct bb_list **bb_tail = &bb_head; /* Ptr to store next bb ptr */
276 static int bb_file_label_num = -1; /* Current label # for file */
277 static int bb_func_label_num = -1; /* Current label # for func */
279 /* Linked list to hold the strings for each file and function name output. */
282 struct bb_str *next; /* pointer to next string */
283 const char *string; /* string */
284 int label_num; /* label number */
285 int length; /* string length */
288 static struct bb_str *sbb_head = 0; /* Head of string list. */
289 static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */
290 static int sbb_label_num = 0; /* Last label used */
292 #ifdef HAVE_ATTR_length
293 static int asm_insn_count PROTO((rtx));
295 static void profile_function PROTO((FILE *));
296 static void profile_after_prologue PROTO((FILE *));
297 static void add_bb PROTO((FILE *));
298 static int add_bb_string PROTO((const char *, int));
299 static void output_source_line PROTO((FILE *, rtx));
300 static rtx walk_alter_subreg PROTO((rtx));
301 static void output_asm_name PROTO((void));
302 static void output_operand PROTO((rtx, int));
303 #ifdef LEAF_REGISTERS
304 static void leaf_renumber_regs PROTO((rtx));
307 static int alter_cond PROTO((rtx));
309 #ifndef ADDR_VEC_ALIGN
310 static int final_addr_vec_align PROTO ((rtx));
312 static int align_fuzz PROTO ((rtx, rtx, int, unsigned));
314 /* Initialize data in final at the beginning of a compilation. */
317 init_final (filename)
318 const char *filename ATTRIBUTE_UNUSED;
320 next_block_index = 2;
322 max_block_depth = 20;
323 pending_blocks = (int *) xmalloc (20 * sizeof *pending_blocks);
326 #ifdef ASSEMBLER_DIALECT
327 dialect_number = ASSEMBLER_DIALECT;
331 /* Called at end of source file,
332 to output the block-profiling table for this entire compilation. */
336 const char *filename;
340 if (profile_block_flag || profile_arc_flag)
343 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
347 int long_bytes = LONG_TYPE_SIZE / BITS_PER_UNIT;
348 int pointer_bytes = POINTER_SIZE / BITS_PER_UNIT;
350 if (profile_block_flag)
351 size = long_bytes * count_basic_blocks;
353 size = long_bytes * count_instrumented_arcs;
356 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
357 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
358 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
362 /* Output the main header, of 11 words:
363 0: 1 if this file is initialized, else 0.
364 1: address of file name (LPBX1).
365 2: address of table of counts (LPBX2).
366 3: number of counts in the table.
367 4: always 0, for compatibility with Sun.
369 The following are GNU extensions:
371 5: address of table of start addrs of basic blocks (LPBX3).
372 6: Number of bytes in this header.
373 7: address of table of function names (LPBX4).
374 8: address of table of line numbers (LPBX5) or 0.
375 9: address of table of file names (LPBX6) or 0.
376 10: space reserved for basic block profiling. */
378 ASM_OUTPUT_ALIGN (asm_out_file, align);
380 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
382 assemble_integer (const0_rtx, long_bytes, 1);
384 /* address of filename */
385 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
386 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
388 /* address of count table */
389 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
390 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
392 /* count of the # of basic blocks or # of instrumented arcs */
393 if (profile_block_flag)
394 assemble_integer (GEN_INT (count_basic_blocks), long_bytes, 1);
396 assemble_integer (GEN_INT (count_instrumented_arcs), long_bytes,
399 /* zero word (link field) */
400 assemble_integer (const0_rtx, pointer_bytes, 1);
402 /* address of basic block start address table */
403 if (profile_block_flag)
405 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
406 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
410 assemble_integer (const0_rtx, pointer_bytes, 1);
412 /* byte count for extended structure. */
413 assemble_integer (GEN_INT (11 * UNITS_PER_WORD), long_bytes, 1);
415 /* address of function name table */
416 if (profile_block_flag)
418 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
419 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
423 assemble_integer (const0_rtx, pointer_bytes, 1);
425 /* address of line number and filename tables if debugging. */
426 if (write_symbols != NO_DEBUG && profile_block_flag)
428 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
429 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
431 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
432 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
437 assemble_integer (const0_rtx, pointer_bytes, 1);
438 assemble_integer (const0_rtx, pointer_bytes, 1);
441 /* space for extension ptr (link field) */
442 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
444 /* Output the file name changing the suffix to .d for Sun tcov
446 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
448 char *cwd = getpwd ();
449 int len = strlen (filename) + strlen (cwd) + 1;
450 char *data_file = (char *) alloca (len + 4);
452 strcpy (data_file, cwd);
453 strcat (data_file, "/");
454 strcat (data_file, filename);
455 strip_off_ending (data_file, len);
456 if (profile_block_flag)
457 strcat (data_file, ".d");
459 strcat (data_file, ".da");
460 assemble_string (data_file, strlen (data_file) + 1);
463 /* Make space for the table of counts. */
466 /* Realign data section. */
467 ASM_OUTPUT_ALIGN (asm_out_file, align);
468 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
470 assemble_zeros (size);
474 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
475 #ifdef ASM_OUTPUT_SHARED_LOCAL
476 if (flag_shared_data)
477 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
480 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
481 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
484 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
485 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
488 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
493 /* Output any basic block strings */
494 if (profile_block_flag)
496 readonly_data_section ();
499 ASM_OUTPUT_ALIGN (asm_out_file, align);
500 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
502 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC",
504 assemble_string (sptr->string, sptr->length);
509 /* Output the table of addresses. */
510 if (profile_block_flag)
512 /* Realign in new section */
513 ASM_OUTPUT_ALIGN (asm_out_file, align);
514 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
515 for (i = 0; i < count_basic_blocks; i++)
517 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
518 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
523 /* Output the table of function names. */
524 if (profile_block_flag)
526 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
527 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
529 if (ptr->func_label_num >= 0)
531 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
532 ptr->func_label_num);
533 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
537 assemble_integer (const0_rtx, pointer_bytes, 1);
540 for ( ; i < count_basic_blocks; i++)
541 assemble_integer (const0_rtx, pointer_bytes, 1);
544 if (write_symbols != NO_DEBUG && profile_block_flag)
546 /* Output the table of line numbers. */
547 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
548 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
549 assemble_integer (GEN_INT (ptr->line_num), long_bytes, 1);
551 for ( ; i < count_basic_blocks; i++)
552 assemble_integer (const0_rtx, long_bytes, 1);
554 /* Output the table of file names. */
555 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
556 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
558 if (ptr->file_label_num >= 0)
560 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
561 ptr->file_label_num);
562 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
566 assemble_integer (const0_rtx, pointer_bytes, 1);
569 for ( ; i < count_basic_blocks; i++)
570 assemble_integer (const0_rtx, pointer_bytes, 1);
573 /* End with the address of the table of addresses,
574 so we can find it easily, as the last word in the file's text. */
575 if (profile_block_flag)
577 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
578 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
584 /* Enable APP processing of subsequent output.
585 Used before the output from an `asm' statement. */
592 fputs (ASM_APP_ON, asm_out_file);
597 /* Disable APP processing of subsequent output.
598 Called from varasm.c before most kinds of output. */
605 fputs (ASM_APP_OFF, asm_out_file);
610 /* Return the number of slots filled in the current
611 delayed branch sequence (we don't count the insn needing the
612 delay slot). Zero if not in a delayed branch sequence. */
616 dbr_sequence_length ()
618 if (final_sequence != 0)
619 return XVECLEN (final_sequence, 0) - 1;
625 /* The next two pages contain routines used to compute the length of an insn
626 and to shorten branches. */
628 /* Arrays for insn lengths, and addresses. The latter is referenced by
629 `insn_current_length'. */
631 static short *insn_lengths;
634 /* Max uid for which the above arrays are valid. */
635 static int insn_lengths_max_uid;
637 /* Address of insn being processed. Used by `insn_current_length'. */
638 int insn_current_address;
640 /* Address of insn being processed in previous iteration. */
641 int insn_last_address;
643 /* konwn invariant alignment of insn being processed. */
644 int insn_current_align;
646 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
647 gives the next following alignment insn that increases the known
648 alignment, or NULL_RTX if there is no such insn.
649 For any alignment obtained this way, we can again index uid_align with
650 its uid to obtain the next following align that in turn increases the
651 alignment, till we reach NULL_RTX; the sequence obtained this way
652 for each insn we'll call the alignment chain of this insn in the following
655 struct label_alignment {
660 static rtx *uid_align;
661 static int *uid_shuid;
662 static struct label_alignment *label_align;
664 /* Indicate that branch shortening hasn't yet been done. */
683 insn_lengths_max_uid = 0;
687 free (insn_addresses);
697 /* Obtain the current length of an insn. If branch shortening has been done,
698 get its actual length. Otherwise, get its maximum length. */
701 get_attr_length (insn)
704 #ifdef HAVE_ATTR_length
709 if (insn_lengths_max_uid > INSN_UID (insn))
710 return insn_lengths[INSN_UID (insn)];
712 switch (GET_CODE (insn))
720 length = insn_default_length (insn);
724 body = PATTERN (insn);
725 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
727 /* Alignment is machine-dependent and should be handled by
731 length = insn_default_length (insn);
735 body = PATTERN (insn);
736 if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
739 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
740 length = asm_insn_count (body) * insn_default_length (insn);
741 else if (GET_CODE (body) == SEQUENCE)
742 for (i = 0; i < XVECLEN (body, 0); i++)
743 length += get_attr_length (XVECEXP (body, 0, i));
745 length = insn_default_length (insn);
752 #ifdef ADJUST_INSN_LENGTH
753 ADJUST_INSN_LENGTH (insn, length);
756 #else /* not HAVE_ATTR_length */
758 #endif /* not HAVE_ATTR_length */
761 /* Code to handle alignment inside shorten_branches. */
763 /* Here is an explanation how the algorithm in align_fuzz can give
766 Call a sequence of instructions beginning with alignment point X
767 and continuing until the next alignment point `block X'. When `X'
768 is used in an expression, it means the alignment value of the
771 Call the distance between the start of the first insn of block X, and
772 the end of the last insn of block X `IX', for the `inner size of X'.
773 This is clearly the sum of the instruction lengths.
775 Likewise with the next alignment-delimited block following X, which we
778 Call the distance between the start of the first insn of block X, and
779 the start of the first insn of block Y `OX', for the `outer size of X'.
781 The estimated padding is then OX - IX.
783 OX can be safely estimated as
788 OX = round_up(IX, X) + Y - X
790 Clearly est(IX) >= real(IX), because that only depends on the
791 instruction lengths, and those being overestimated is a given.
793 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
794 we needn't worry about that when thinking about OX.
796 When X >= Y, the alignment provided by Y adds no uncertainty factor
797 for branch ranges starting before X, so we can just round what we have.
798 But when X < Y, we don't know anything about the, so to speak,
799 `middle bits', so we have to assume the worst when aligning up from an
800 address mod X to one mod Y, which is Y - X. */
803 #define LABEL_ALIGN(LABEL) align_labels_log
806 #ifndef LABEL_ALIGN_MAX_SKIP
807 #define LABEL_ALIGN_MAX_SKIP (align_labels-1)
811 #define LOOP_ALIGN(LABEL) align_loops_log
814 #ifndef LOOP_ALIGN_MAX_SKIP
815 #define LOOP_ALIGN_MAX_SKIP (align_loops-1)
818 #ifndef LABEL_ALIGN_AFTER_BARRIER
819 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) align_jumps_log
822 #ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
823 #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP (align_jumps-1)
826 #ifndef ADDR_VEC_ALIGN
828 final_addr_vec_align (addr_vec)
831 int align = exact_log2 (GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec))));
833 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
834 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
838 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
841 #ifndef INSN_LENGTH_ALIGNMENT
842 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
845 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
847 static int min_labelno, max_labelno;
849 #define LABEL_TO_ALIGNMENT(LABEL) \
850 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
852 #define LABEL_TO_MAX_SKIP(LABEL) \
853 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
855 /* For the benefit of port specific code do this also as a function. */
857 label_to_alignment (label)
860 return LABEL_TO_ALIGNMENT (label);
863 #ifdef HAVE_ATTR_length
864 /* The differences in addresses
865 between a branch and its target might grow or shrink depending on
866 the alignment the start insn of the range (the branch for a forward
867 branch or the label for a backward branch) starts out on; if these
868 differences are used naively, they can even oscillate infinitely.
869 We therefore want to compute a 'worst case' address difference that
870 is independent of the alignment the start insn of the range end
871 up on, and that is at least as large as the actual difference.
872 The function align_fuzz calculates the amount we have to add to the
873 naively computed difference, by traversing the part of the alignment
874 chain of the start insn of the range that is in front of the end insn
875 of the range, and considering for each alignment the maximum amount
876 that it might contribute to a size increase.
878 For casesi tables, we also want to know worst case minimum amounts of
879 address difference, in case a machine description wants to introduce
880 some common offset that is added to all offsets in a table.
881 For this purpose, align_fuzz with a growth argument of 0 comuptes the
882 appropriate adjustment. */
885 /* Compute the maximum delta by which the difference of the addresses of
886 START and END might grow / shrink due to a different address for start
887 which changes the size of alignment insns between START and END.
888 KNOWN_ALIGN_LOG is the alignment known for START.
889 GROWTH should be ~0 if the objective is to compute potential code size
890 increase, and 0 if the objective is to compute potential shrink.
891 The return value is undefined for any other value of GROWTH. */
893 align_fuzz (start, end, known_align_log, growth)
898 int uid = INSN_UID (start);
900 int known_align = 1 << known_align_log;
901 int end_shuid = INSN_SHUID (end);
904 for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
906 int align_addr, new_align;
908 uid = INSN_UID (align_label);
909 align_addr = insn_addresses[uid] - insn_lengths[uid];
910 if (uid_shuid[uid] > end_shuid)
912 known_align_log = LABEL_TO_ALIGNMENT (align_label);
913 new_align = 1 << known_align_log;
914 if (new_align < known_align)
916 fuzz += (-align_addr ^ growth) & (new_align - known_align);
917 known_align = new_align;
922 /* Compute a worst-case reference address of a branch so that it
923 can be safely used in the presence of aligned labels. Since the
924 size of the branch itself is unknown, the size of the branch is
925 not included in the range. I.e. for a forward branch, the reference
926 address is the end address of the branch as known from the previous
927 branch shortening pass, minus a value to account for possible size
928 increase due to alignment. For a backward branch, it is the start
929 address of the branch as known from the current pass, plus a value
930 to account for possible size increase due to alignment.
931 NB.: Therefore, the maximum offset allowed for backward branches needs
932 to exclude the branch size. */
934 insn_current_reference_address (branch)
938 rtx seq = NEXT_INSN (PREV_INSN (branch));
939 int seq_uid = INSN_UID (seq);
940 if (GET_CODE (branch) != JUMP_INSN)
941 /* This can happen for example on the PA; the objective is to know the
942 offset to address something in front of the start of the function.
943 Thus, we can treat it like a backward branch.
944 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
945 any alignment we'd encounter, so we skip the call to align_fuzz. */
946 return insn_current_address;
947 dest = JUMP_LABEL (branch);
948 /* BRANCH has no proper alignment chain set, so use SEQ. */
949 if (INSN_SHUID (branch) < INSN_SHUID (dest))
951 /* Forward branch. */
952 return (insn_last_address + insn_lengths[seq_uid]
953 - align_fuzz (seq, dest, length_unit_log, ~0));
957 /* Backward branch. */
958 return (insn_current_address
959 + align_fuzz (dest, seq, length_unit_log, ~0));
962 #endif /* HAVE_ATTR_length */
964 /* Make a pass over all insns and compute their actual lengths by shortening
965 any branches of variable length if possible. */
967 /* Give a default value for the lowest address in a function. */
969 #ifndef FIRST_INSN_ADDRESS
970 #define FIRST_INSN_ADDRESS 0
973 /* shorten_branches might be called multiple times: for example, the SH
974 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
975 In order to do this, it needs proper length information, which it obtains
976 by calling shorten_branches. This cannot be collapsed with
977 shorten_branches itself into a single pass unless we also want to intergate
978 reorg.c, since the branch splitting exposes new instructions with delay
982 shorten_branches (first)
990 #ifdef HAVE_ATTR_length
991 #define MAX_CODE_ALIGN 16
993 int something_changed = 1;
994 char *varying_length;
997 rtx align_tab[MAX_CODE_ALIGN];
999 /* In order to make sure that all instructions have valid length info,
1000 we must split them before we compute the address/length info. */
1002 for (insn = NEXT_INSN (first); insn; insn = NEXT_INSN (insn))
1003 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1006 /* Don't split the insn if it has been deleted. */
1007 if (! INSN_DELETED_P (old))
1008 insn = try_split (PATTERN (old), old, 1);
1009 /* When not optimizing, the old insn will be still left around
1010 with only the 'deleted' bit set. Transform it into a note
1011 to avoid confusion of subsequent processing. */
1012 if (INSN_DELETED_P (old))
1014 PUT_CODE (old , NOTE);
1015 NOTE_LINE_NUMBER (old) = NOTE_INSN_DELETED;
1016 NOTE_SOURCE_FILE (old) = 0;
1021 /* We must do some computations even when not actually shortening, in
1022 order to get the alignment information for the labels. */
1024 init_insn_lengths ();
1026 /* Compute maximum UID and allocate label_align / uid_shuid. */
1027 max_uid = get_max_uid ();
1029 max_labelno = max_label_num ();
1030 min_labelno = get_first_label_num ();
1031 label_align = (struct label_alignment *)
1032 xcalloc ((max_labelno - min_labelno + 1), sizeof (struct label_alignment));
1034 uid_shuid = (int *) xmalloc (max_uid * sizeof *uid_shuid);
1036 /* Initialize label_align and set up uid_shuid to be strictly
1037 monotonically rising with insn order. */
1038 /* We use max_log here to keep track of the maximum alignment we want to
1039 impose on the next CODE_LABEL (or the current one if we are processing
1040 the CODE_LABEL itself). */
1045 for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
1049 INSN_SHUID (insn) = i++;
1050 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1052 /* reorg might make the first insn of a loop being run once only,
1053 and delete the label in front of it. Then we want to apply
1054 the loop alignment to the new label created by reorg, which
1055 is separated by the former loop start insn from the
1056 NOTE_INSN_LOOP_BEG. */
1058 else if (GET_CODE (insn) == CODE_LABEL)
1062 log = LABEL_ALIGN (insn);
1066 max_skip = LABEL_ALIGN_MAX_SKIP;
1068 next = NEXT_INSN (insn);
1069 /* ADDR_VECs only take room if read-only data goes into the text
1071 if (JUMP_TABLES_IN_TEXT_SECTION
1072 #if !defined(READONLY_DATA_SECTION)
1076 if (next && GET_CODE (next) == JUMP_INSN)
1078 rtx nextbody = PATTERN (next);
1079 if (GET_CODE (nextbody) == ADDR_VEC
1080 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1082 log = ADDR_VEC_ALIGN (next);
1086 max_skip = LABEL_ALIGN_MAX_SKIP;
1090 LABEL_TO_ALIGNMENT (insn) = max_log;
1091 LABEL_TO_MAX_SKIP (insn) = max_skip;
1095 else if (GET_CODE (insn) == BARRIER)
1099 for (label = insn; label && GET_RTX_CLASS (GET_CODE (label)) != 'i';
1100 label = NEXT_INSN (label))
1101 if (GET_CODE (label) == CODE_LABEL)
1103 log = LABEL_ALIGN_AFTER_BARRIER (insn);
1107 max_skip = LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP;
1112 /* Again, we allow NOTE_INSN_LOOP_BEG - INSN - CODE_LABEL
1113 sequences in order to handle reorg output efficiently. */
1114 else if (GET_CODE (insn) == NOTE
1115 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
1120 /* Search for the label that starts the loop.
1121 Don't skip past the end of the loop, since that could
1122 lead to putting an alignment where it does not belong.
1123 However, a label after a nested (non-)loop would be OK. */
1124 for (label = insn; label; label = NEXT_INSN (label))
1126 if (GET_CODE (label) == NOTE
1127 && NOTE_LINE_NUMBER (label) == NOTE_INSN_LOOP_BEG)
1129 else if (GET_CODE (label) == NOTE
1130 && NOTE_LINE_NUMBER (label) == NOTE_INSN_LOOP_END
1133 else if (GET_CODE (label) == CODE_LABEL)
1135 log = LOOP_ALIGN (insn);
1139 max_skip = LOOP_ALIGN_MAX_SKIP;
1148 #ifdef HAVE_ATTR_length
1150 /* Allocate the rest of the arrays. */
1151 insn_lengths = (short *) xmalloc (max_uid * sizeof (short));
1152 insn_lengths_max_uid = max_uid;
1153 /* Syntax errors can lead to labels being outside of the main insn stream.
1154 Initialize insn_addresses, so that we get reproducible results. */
1155 insn_addresses = (int *) xcalloc (max_uid, sizeof (int));
1157 varying_length = (char *) xcalloc (max_uid, sizeof (char));
1159 /* Initialize uid_align. We scan instructions
1160 from end to start, and keep in align_tab[n] the last seen insn
1161 that does an alignment of at least n+1, i.e. the successor
1162 in the alignment chain for an insn that does / has a known
1164 uid_align = (rtx *) xcalloc (max_uid, sizeof *uid_align);
1166 for (i = MAX_CODE_ALIGN; --i >= 0; )
1167 align_tab[i] = NULL_RTX;
1168 seq = get_last_insn ();
1169 for (; seq; seq = PREV_INSN (seq))
1171 int uid = INSN_UID (seq);
1173 log = (GET_CODE (seq) == CODE_LABEL ? LABEL_TO_ALIGNMENT (seq) : 0);
1174 uid_align[uid] = align_tab[0];
1177 /* Found an alignment label. */
1178 uid_align[uid] = align_tab[log];
1179 for (i = log - 1; i >= 0; i--)
1183 #ifdef CASE_VECTOR_SHORTEN_MODE
1186 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1189 int min_shuid = INSN_SHUID (get_insns ()) - 1;
1190 int max_shuid = INSN_SHUID (get_last_insn ()) + 1;
1193 for (insn = first; insn != 0; insn = NEXT_INSN (insn))
1195 rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat;
1196 int len, i, min, max, insn_shuid;
1198 addr_diff_vec_flags flags;
1200 if (GET_CODE (insn) != JUMP_INSN
1201 || GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)
1203 pat = PATTERN (insn);
1204 len = XVECLEN (pat, 1);
1207 min_align = MAX_CODE_ALIGN;
1208 for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
1210 rtx lab = XEXP (XVECEXP (pat, 1, i), 0);
1211 int shuid = INSN_SHUID (lab);
1222 if (min_align > LABEL_TO_ALIGNMENT (lab))
1223 min_align = LABEL_TO_ALIGNMENT (lab);
1225 XEXP (pat, 2) = gen_rtx_LABEL_REF (VOIDmode, min_lab);
1226 XEXP (pat, 3) = gen_rtx_LABEL_REF (VOIDmode, max_lab);
1227 insn_shuid = INSN_SHUID (insn);
1228 rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0));
1229 flags.min_align = min_align;
1230 flags.base_after_vec = rel > insn_shuid;
1231 flags.min_after_vec = min > insn_shuid;
1232 flags.max_after_vec = max > insn_shuid;
1233 flags.min_after_base = min > rel;
1234 flags.max_after_base = max > rel;
1235 ADDR_DIFF_VEC_FLAGS (pat) = flags;
1238 #endif /* CASE_VECTOR_SHORTEN_MODE */
1241 /* Compute initial lengths, addresses, and varying flags for each insn. */
1242 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1244 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1246 uid = INSN_UID (insn);
1248 insn_lengths[uid] = 0;
1250 if (GET_CODE (insn) == CODE_LABEL)
1252 int log = LABEL_TO_ALIGNMENT (insn);
1255 int align = 1 << log;
1256 int new_address = (insn_current_address + align - 1) & -align;
1257 insn_lengths[uid] = new_address - insn_current_address;
1258 insn_current_address = new_address;
1262 insn_addresses[uid] = insn_current_address;
1264 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
1265 || GET_CODE (insn) == CODE_LABEL)
1267 if (INSN_DELETED_P (insn))
1270 body = PATTERN (insn);
1271 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1273 /* This only takes room if read-only data goes into the text
1275 if (JUMP_TABLES_IN_TEXT_SECTION
1276 #if !defined(READONLY_DATA_SECTION)
1280 insn_lengths[uid] = (XVECLEN (body,
1281 GET_CODE (body) == ADDR_DIFF_VEC)
1282 * GET_MODE_SIZE (GET_MODE (body)));
1283 /* Alignment is handled by ADDR_VEC_ALIGN. */
1285 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
1286 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
1287 else if (GET_CODE (body) == SEQUENCE)
1290 int const_delay_slots;
1292 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
1294 const_delay_slots = 0;
1296 /* Inside a delay slot sequence, we do not do any branch shortening
1297 if the shortening could change the number of delay slots
1299 for (i = 0; i < XVECLEN (body, 0); i++)
1301 rtx inner_insn = XVECEXP (body, 0, i);
1302 int inner_uid = INSN_UID (inner_insn);
1305 if (GET_CODE (body) == ASM_INPUT
1306 || asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
1307 inner_length = (asm_insn_count (PATTERN (inner_insn))
1308 * insn_default_length (inner_insn));
1310 inner_length = insn_default_length (inner_insn);
1312 insn_lengths[inner_uid] = inner_length;
1313 if (const_delay_slots)
1315 if ((varying_length[inner_uid]
1316 = insn_variable_length_p (inner_insn)) != 0)
1317 varying_length[uid] = 1;
1318 insn_addresses[inner_uid] = (insn_current_address +
1322 varying_length[inner_uid] = 0;
1323 insn_lengths[uid] += inner_length;
1326 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
1328 insn_lengths[uid] = insn_default_length (insn);
1329 varying_length[uid] = insn_variable_length_p (insn);
1332 /* If needed, do any adjustment. */
1333 #ifdef ADJUST_INSN_LENGTH
1334 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
1335 if (insn_lengths[uid] < 0)
1336 fatal_insn ("Negative insn length", insn);
1340 /* Now loop over all the insns finding varying length insns. For each,
1341 get the current insn length. If it has changed, reflect the change.
1342 When nothing changes for a full pass, we are done. */
1344 while (something_changed)
1346 something_changed = 0;
1347 insn_current_align = MAX_CODE_ALIGN - 1;
1348 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1350 insn = NEXT_INSN (insn))
1353 #ifdef ADJUST_INSN_LENGTH
1358 uid = INSN_UID (insn);
1360 if (GET_CODE (insn) == CODE_LABEL)
1362 int log = LABEL_TO_ALIGNMENT (insn);
1363 if (log > insn_current_align)
1365 int align = 1 << log;
1366 int new_address= (insn_current_address + align - 1) & -align;
1367 insn_lengths[uid] = new_address - insn_current_address;
1368 insn_current_align = log;
1369 insn_current_address = new_address;
1372 insn_lengths[uid] = 0;
1373 insn_addresses[uid] = insn_current_address;
1377 length_align = INSN_LENGTH_ALIGNMENT (insn);
1378 if (length_align < insn_current_align)
1379 insn_current_align = length_align;
1381 insn_last_address = insn_addresses[uid];
1382 insn_addresses[uid] = insn_current_address;
1384 #ifdef CASE_VECTOR_SHORTEN_MODE
1385 if (optimize && GET_CODE (insn) == JUMP_INSN
1386 && GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
1388 rtx body = PATTERN (insn);
1389 int old_length = insn_lengths[uid];
1390 rtx rel_lab = XEXP (XEXP (body, 0), 0);
1391 rtx min_lab = XEXP (XEXP (body, 2), 0);
1392 rtx max_lab = XEXP (XEXP (body, 3), 0);
1393 addr_diff_vec_flags flags = ADDR_DIFF_VEC_FLAGS (body);
1394 int rel_addr = insn_addresses[INSN_UID (rel_lab)];
1395 int min_addr = insn_addresses[INSN_UID (min_lab)];
1396 int max_addr = insn_addresses[INSN_UID (max_lab)];
1400 /* Try to find a known alignment for rel_lab. */
1401 for (prev = rel_lab;
1403 && ! insn_lengths[INSN_UID (prev)]
1404 && ! (varying_length[INSN_UID (prev)] & 1);
1405 prev = PREV_INSN (prev))
1406 if (varying_length[INSN_UID (prev)] & 2)
1408 rel_align = LABEL_TO_ALIGNMENT (prev);
1412 /* See the comment on addr_diff_vec_flags in rtl.h for the
1413 meaning of the flags values. base: REL_LAB vec: INSN */
1414 /* Anything after INSN has still addresses from the last
1415 pass; adjust these so that they reflect our current
1416 estimate for this pass. */
1417 if (flags.base_after_vec)
1418 rel_addr += insn_current_address - insn_last_address;
1419 if (flags.min_after_vec)
1420 min_addr += insn_current_address - insn_last_address;
1421 if (flags.max_after_vec)
1422 max_addr += insn_current_address - insn_last_address;
1423 /* We want to know the worst case, i.e. lowest possible value
1424 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1425 its offset is positive, and we have to be wary of code shrink;
1426 otherwise, it is negative, and we have to be vary of code
1428 if (flags.min_after_base)
1430 /* If INSN is between REL_LAB and MIN_LAB, the size
1431 changes we are about to make can change the alignment
1432 within the observed offset, therefore we have to break
1433 it up into two parts that are independent. */
1434 if (! flags.base_after_vec && flags.min_after_vec)
1436 min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
1437 min_addr -= align_fuzz (insn, min_lab, 0, 0);
1440 min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
1444 if (flags.base_after_vec && ! flags.min_after_vec)
1446 min_addr -= align_fuzz (min_lab, insn, 0, ~0);
1447 min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
1450 min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
1452 /* Likewise, determine the highest lowest possible value
1453 for the offset of MAX_LAB. */
1454 if (flags.max_after_base)
1456 if (! flags.base_after_vec && flags.max_after_vec)
1458 max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
1459 max_addr += align_fuzz (insn, max_lab, 0, ~0);
1462 max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
1466 if (flags.base_after_vec && ! flags.max_after_vec)
1468 max_addr += align_fuzz (max_lab, insn, 0, 0);
1469 max_addr += align_fuzz (insn, rel_lab, 0, 0);
1472 max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
1474 PUT_MODE (body, CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
1475 max_addr - rel_addr,
1477 if (JUMP_TABLES_IN_TEXT_SECTION
1478 #if !defined(READONLY_DATA_SECTION)
1484 = (XVECLEN (body, 1) * GET_MODE_SIZE (GET_MODE (body)));
1485 insn_current_address += insn_lengths[uid];
1486 if (insn_lengths[uid] != old_length)
1487 something_changed = 1;
1492 #endif /* CASE_VECTOR_SHORTEN_MODE */
1494 if (! (varying_length[uid]))
1496 insn_current_address += insn_lengths[uid];
1499 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
1503 body = PATTERN (insn);
1505 for (i = 0; i < XVECLEN (body, 0); i++)
1507 rtx inner_insn = XVECEXP (body, 0, i);
1508 int inner_uid = INSN_UID (inner_insn);
1511 insn_addresses[inner_uid] = insn_current_address;
1513 /* insn_current_length returns 0 for insns with a
1514 non-varying length. */
1515 if (! varying_length[inner_uid])
1516 inner_length = insn_lengths[inner_uid];
1518 inner_length = insn_current_length (inner_insn);
1520 if (inner_length != insn_lengths[inner_uid])
1522 insn_lengths[inner_uid] = inner_length;
1523 something_changed = 1;
1525 insn_current_address += insn_lengths[inner_uid];
1526 new_length += inner_length;
1531 new_length = insn_current_length (insn);
1532 insn_current_address += new_length;
1535 #ifdef ADJUST_INSN_LENGTH
1536 /* If needed, do any adjustment. */
1537 tmp_length = new_length;
1538 ADJUST_INSN_LENGTH (insn, new_length);
1539 insn_current_address += (new_length - tmp_length);
1542 if (new_length != insn_lengths[uid])
1544 insn_lengths[uid] = new_length;
1545 something_changed = 1;
1548 /* For a non-optimizing compile, do only a single pass. */
1553 free (varying_length);
1555 #endif /* HAVE_ATTR_length */
1558 #ifdef HAVE_ATTR_length
1559 /* Given the body of an INSN known to be generated by an ASM statement, return
1560 the number of machine instructions likely to be generated for this insn.
1561 This is used to compute its length. */
1564 asm_insn_count (body)
1570 if (GET_CODE (body) == ASM_INPUT)
1571 template = XSTR (body, 0);
1573 template = decode_asm_operands (body, NULL_PTR, NULL_PTR,
1574 NULL_PTR, NULL_PTR);
1576 for ( ; *template; template++)
1577 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
1584 /* Output assembler code for the start of a function,
1585 and initialize some of the variables in this file
1586 for the new function. The label for the function and associated
1587 assembler pseudo-ops have already been output in `assemble_start_function'.
1589 FIRST is the first insn of the rtl for the function being compiled.
1590 FILE is the file to write assembler code to.
1591 OPTIMIZE is nonzero if we should eliminate redundant
1592 test and compare insns. */
1595 final_start_function (first, file, optimize)
1598 int optimize ATTRIBUTE_UNUSED;
1602 this_is_asm_operands = 0;
1604 #ifdef NON_SAVING_SETJMP
1605 /* A function that calls setjmp should save and restore all the
1606 call-saved registers on a system where longjmp clobbers them. */
1607 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
1611 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1612 if (!call_used_regs[i])
1613 regs_ever_live[i] = 1;
1617 /* Initial line number is supposed to be output
1618 before the function's prologue and label
1619 so that the function's address will not appear to be
1620 in the last statement of the preceding function. */
1621 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1622 last_linenum = high_block_linenum = high_function_linenum
1623 = NOTE_LINE_NUMBER (first);
1625 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1626 /* Output DWARF definition of the function. */
1627 if (dwarf2out_do_frame ())
1628 dwarf2out_begin_prologue ();
1631 /* For SDB and XCOFF, the function beginning must be marked between
1632 the function label and the prologue. We always need this, even when
1633 -g1 was used. Defer on MIPS systems so that parameter descriptions
1634 follow function entry. */
1635 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
1636 if (write_symbols == SDB_DEBUG)
1637 sdbout_begin_function (last_linenum);
1640 #ifdef XCOFF_DEBUGGING_INFO
1641 if (write_symbols == XCOFF_DEBUG)
1642 xcoffout_begin_function (file, last_linenum);
1645 /* But only output line number for other debug info types if -g2
1647 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1648 output_source_line (file, first);
1650 #ifdef LEAF_REG_REMAP
1651 if (current_function_uses_only_leaf_regs)
1652 leaf_renumber_regs (first);
1655 /* The Sun386i and perhaps other machines don't work right
1656 if the profiling code comes after the prologue. */
1657 #ifdef PROFILE_BEFORE_PROLOGUE
1659 profile_function (file);
1660 #endif /* PROFILE_BEFORE_PROLOGUE */
1662 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1663 if (dwarf2out_do_frame ())
1664 dwarf2out_frame_debug (NULL_RTX);
1667 #ifdef FUNCTION_PROLOGUE
1668 /* First output the function prologue: code to set up the stack frame. */
1669 FUNCTION_PROLOGUE (file, get_frame_size ());
1672 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1673 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
1674 next_block_index = 1;
1677 /* If the machine represents the prologue as RTL, the profiling code must
1678 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1679 #ifdef HAVE_prologue
1680 if (! HAVE_prologue)
1682 profile_after_prologue (file);
1686 /* If we are doing basic block profiling, remember a printable version
1687 of the function name. */
1688 if (profile_block_flag)
1691 = add_bb_string ((*decl_printable_name) (current_function_decl, 2), FALSE);
1696 profile_after_prologue (file)
1699 #ifdef FUNCTION_BLOCK_PROFILER
1700 if (profile_block_flag)
1702 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
1704 #endif /* FUNCTION_BLOCK_PROFILER */
1706 #ifndef PROFILE_BEFORE_PROLOGUE
1708 profile_function (file);
1709 #endif /* not PROFILE_BEFORE_PROLOGUE */
1713 profile_function (file)
1716 int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1717 #if defined(ASM_OUTPUT_REG_PUSH)
1718 #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1719 int sval = current_function_returns_struct;
1721 #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1722 int cxt = current_function_needs_context;
1724 #endif /* ASM_OUTPUT_REG_PUSH */
1727 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1728 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
1729 assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, 1);
1731 function_section (current_function_decl);
1733 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1735 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
1737 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1740 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1745 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1747 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1749 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1752 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1757 FUNCTION_PROFILER (file, profile_label_no);
1759 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1761 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1763 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1766 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1771 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1773 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1775 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1778 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1784 /* Output assembler code for the end of a function.
1785 For clarity, args are same as those of `final_start_function'
1786 even though not all of them are needed. */
1789 final_end_function (first, file, optimize)
1790 rtx first ATTRIBUTE_UNUSED;
1792 int optimize ATTRIBUTE_UNUSED;
1796 fputs (ASM_APP_OFF, file);
1800 #ifdef SDB_DEBUGGING_INFO
1801 if (write_symbols == SDB_DEBUG)
1802 sdbout_end_function (high_function_linenum);
1805 #ifdef DWARF_DEBUGGING_INFO
1806 if (write_symbols == DWARF_DEBUG)
1807 dwarfout_end_function ();
1810 #ifdef XCOFF_DEBUGGING_INFO
1811 if (write_symbols == XCOFF_DEBUG)
1812 xcoffout_end_function (file, high_function_linenum);
1815 #ifdef FUNCTION_EPILOGUE
1816 /* Finally, output the function epilogue:
1817 code to restore the stack frame and return to the caller. */
1818 FUNCTION_EPILOGUE (file, get_frame_size ());
1821 #ifdef SDB_DEBUGGING_INFO
1822 if (write_symbols == SDB_DEBUG)
1823 sdbout_end_epilogue ();
1826 #ifdef DWARF_DEBUGGING_INFO
1827 if (write_symbols == DWARF_DEBUG)
1828 dwarfout_end_epilogue ();
1831 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1832 if (dwarf2out_do_frame ())
1833 dwarf2out_end_epilogue ();
1836 #ifdef XCOFF_DEBUGGING_INFO
1837 if (write_symbols == XCOFF_DEBUG)
1838 xcoffout_end_epilogue (file);
1841 bb_func_label_num = -1; /* not in function, nuke label # */
1843 /* If FUNCTION_EPILOGUE is not defined, then the function body
1844 itself contains return instructions wherever needed. */
1847 /* Add a block to the linked list that remembers the current line/file/function
1848 for basic block profiling. Emit the label in front of the basic block and
1849 the instructions that increment the count field. */
1855 struct bb_list *ptr = (struct bb_list *) permalloc (sizeof (struct bb_list));
1857 /* Add basic block to linked list. */
1859 ptr->line_num = last_linenum;
1860 ptr->file_label_num = bb_file_label_num;
1861 ptr->func_label_num = bb_func_label_num;
1863 bb_tail = &ptr->next;
1865 /* Enable the table of basic-block use counts
1866 to point at the code it applies to. */
1867 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1869 /* Before first insn of this basic block, increment the
1870 count of times it was entered. */
1871 #ifdef BLOCK_PROFILER
1872 BLOCK_PROFILER (file, count_basic_blocks);
1879 count_basic_blocks++;
1882 /* Add a string to be used for basic block profiling. */
1885 add_bb_string (string, perm_p)
1890 struct bb_str *ptr = 0;
1894 string = "<unknown>";
1898 /* Allocate a new string if the current string isn't permanent. If
1899 the string is permanent search for the same string in other
1902 len = strlen (string) + 1;
1905 char *p = (char *) permalloc (len);
1906 bcopy (string, p, len);
1910 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1911 if (ptr->string == string)
1914 /* Allocate a new string block if we need to. */
1917 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1920 ptr->label_num = sbb_label_num++;
1921 ptr->string = string;
1923 sbb_tail = &ptr->next;
1926 return ptr->label_num;
1930 /* Output assembler code for some insns: all or part of a function.
1931 For description of args, see `final_start_function', above.
1933 PRESCAN is 1 if we are not really outputting,
1934 just scanning as if we were outputting.
1935 Prescanning deletes and rearranges insns just like ordinary output.
1936 PRESCAN is -2 if we are outputting after having prescanned.
1937 In this case, don't try to delete or rearrange insns
1938 because that has already been done.
1939 Prescanning is done only on certain machines. */
1942 final (first, file, optimize, prescan)
1952 last_ignored_compare = 0;
1955 check_exception_handler_labels ();
1957 /* Make a map indicating which line numbers appear in this function.
1958 When producing SDB debugging info, delete troublesome line number
1959 notes from inlined functions in other files as well as duplicate
1960 line number notes. */
1961 #ifdef SDB_DEBUGGING_INFO
1962 if (write_symbols == SDB_DEBUG)
1965 for (insn = first; insn; insn = NEXT_INSN (insn))
1966 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1968 if ((RTX_INTEGRATED_P (insn)
1969 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1971 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1972 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1974 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1975 NOTE_SOURCE_FILE (insn) = 0;
1979 if (NOTE_LINE_NUMBER (insn) > max_line)
1980 max_line = NOTE_LINE_NUMBER (insn);
1986 for (insn = first; insn; insn = NEXT_INSN (insn))
1987 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1988 max_line = NOTE_LINE_NUMBER (insn);
1991 line_note_exists = (char *) oballoc (max_line + 1);
1992 bzero (line_note_exists, max_line + 1);
1994 for (insn = first; insn; insn = NEXT_INSN (insn))
1996 if (INSN_UID (insn) > max_uid) /* find largest UID */
1997 max_uid = INSN_UID (insn);
1998 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1999 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
2001 /* If CC tracking across branches is enabled, record the insn which
2002 jumps to each branch only reached from one place. */
2003 if (optimize && GET_CODE (insn) == JUMP_INSN)
2005 rtx lab = JUMP_LABEL (insn);
2006 if (lab && LABEL_NUSES (lab) == 1)
2008 LABEL_REFS (lab) = insn;
2014 /* Initialize insn_eh_region table if eh is being used. */
2016 init_insn_eh_region (first, max_uid);
2022 /* Output the insns. */
2023 for (insn = NEXT_INSN (first); insn;)
2025 #ifdef HAVE_ATTR_length
2026 insn_current_address = insn_addresses[INSN_UID (insn)];
2028 insn = final_scan_insn (insn, file, optimize, prescan, 0);
2031 /* Do basic-block profiling here
2032 if the last insn was a conditional branch. */
2033 if (profile_block_flag && new_block)
2036 free_insn_eh_region ();
2040 get_insn_template (code, insn)
2044 const void *output = insn_data[code].output;
2045 switch (insn_data[code].output_format)
2047 case INSN_OUTPUT_FORMAT_SINGLE:
2048 return (const char *) output;
2049 case INSN_OUTPUT_FORMAT_MULTI:
2050 return ((const char * const *) output)[which_alternative];
2051 case INSN_OUTPUT_FORMAT_FUNCTION:
2054 return (* (insn_output_fn) output) (recog_data.operand, insn);
2060 /* The final scan for one insn, INSN.
2061 Args are same as in `final', except that INSN
2062 is the insn being scanned.
2063 Value returned is the next insn to be scanned.
2065 NOPEEPHOLES is the flag to disallow peephole processing (currently
2066 used for within delayed branch sequence output). */
2069 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
2072 int optimize ATTRIBUTE_UNUSED;
2074 int nopeepholes ATTRIBUTE_UNUSED;
2082 /* Ignore deleted insns. These can occur when we split insns (due to a
2083 template of "#") while not optimizing. */
2084 if (INSN_DELETED_P (insn))
2085 return NEXT_INSN (insn);
2087 switch (GET_CODE (insn))
2093 /* Align the beginning of a loop, for higher speed
2094 on certain machines. */
2096 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
2097 break; /* This used to depend on optimize, but that was bogus. */
2098 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END)
2101 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG
2102 && ! exceptions_via_longjmp)
2104 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHB", NOTE_EH_HANDLER (insn));
2105 if (! flag_new_exceptions)
2106 add_eh_table_entry (NOTE_EH_HANDLER (insn));
2107 #ifdef ASM_OUTPUT_EH_REGION_BEG
2108 ASM_OUTPUT_EH_REGION_BEG (file, NOTE_EH_HANDLER (insn));
2113 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END
2114 && ! exceptions_via_longjmp)
2116 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHE", NOTE_EH_HANDLER (insn));
2117 if (flag_new_exceptions)
2118 add_eh_table_entry (NOTE_EH_HANDLER (insn));
2119 #ifdef ASM_OUTPUT_EH_REGION_END
2120 ASM_OUTPUT_EH_REGION_END (file, NOTE_EH_HANDLER (insn));
2125 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
2127 #ifdef FUNCTION_END_PROLOGUE
2128 FUNCTION_END_PROLOGUE (file);
2130 profile_after_prologue (file);
2134 #ifdef FUNCTION_BEGIN_EPILOGUE
2135 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
2137 FUNCTION_BEGIN_EPILOGUE (file);
2142 if (write_symbols == NO_DEBUG)
2144 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
2146 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
2147 /* MIPS stabs require the parameter descriptions to be after the
2148 function entry point rather than before. */
2149 if (write_symbols == SDB_DEBUG)
2150 sdbout_begin_function (last_linenum);
2153 #ifdef DWARF_DEBUGGING_INFO
2154 /* This outputs a marker where the function body starts, so it
2155 must be after the prologue. */
2156 if (write_symbols == DWARF_DEBUG)
2157 dwarfout_begin_function ();
2161 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED)
2162 break; /* An insn that was "deleted" */
2165 fputs (ASM_APP_OFF, file);
2168 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG
2169 && (debug_info_level == DINFO_LEVEL_NORMAL
2170 || debug_info_level == DINFO_LEVEL_VERBOSE
2171 || write_symbols == DWARF_DEBUG
2172 || write_symbols == DWARF2_DEBUG))
2174 /* Beginning of a symbol-block. Assign it a sequence number
2175 and push the number onto the stack PENDING_BLOCKS. */
2177 if (block_depth == max_block_depth)
2179 /* PENDING_BLOCKS is full; make it longer. */
2180 max_block_depth *= 2;
2182 = (int *) xrealloc (pending_blocks,
2183 max_block_depth * sizeof (int));
2185 pending_blocks[block_depth++] = next_block_index;
2187 high_block_linenum = last_linenum;
2189 /* Output debugging info about the symbol-block beginning. */
2191 #ifdef SDB_DEBUGGING_INFO
2192 if (write_symbols == SDB_DEBUG)
2193 sdbout_begin_block (file, last_linenum, next_block_index);
2195 #ifdef XCOFF_DEBUGGING_INFO
2196 if (write_symbols == XCOFF_DEBUG)
2197 xcoffout_begin_block (file, last_linenum, next_block_index);
2199 #ifdef DBX_DEBUGGING_INFO
2200 if (write_symbols == DBX_DEBUG)
2201 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", next_block_index);
2203 #ifdef DWARF_DEBUGGING_INFO
2204 if (write_symbols == DWARF_DEBUG)
2205 dwarfout_begin_block (next_block_index);
2207 #ifdef DWARF2_DEBUGGING_INFO
2208 if (write_symbols == DWARF2_DEBUG)
2209 dwarf2out_begin_block (next_block_index);
2214 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END
2215 && (debug_info_level == DINFO_LEVEL_NORMAL
2216 || debug_info_level == DINFO_LEVEL_VERBOSE
2217 || write_symbols == DWARF_DEBUG
2218 || write_symbols == DWARF2_DEBUG))
2220 /* End of a symbol-block. Pop its sequence number off
2221 PENDING_BLOCKS and output debugging info based on that. */
2224 if (block_depth < 0)
2227 #ifdef XCOFF_DEBUGGING_INFO
2228 if (write_symbols == XCOFF_DEBUG)
2229 xcoffout_end_block (file, high_block_linenum,
2230 pending_blocks[block_depth]);
2232 #ifdef DBX_DEBUGGING_INFO
2233 if (write_symbols == DBX_DEBUG)
2234 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE",
2235 pending_blocks[block_depth]);
2237 #ifdef SDB_DEBUGGING_INFO
2238 if (write_symbols == SDB_DEBUG)
2239 sdbout_end_block (file, high_block_linenum,
2240 pending_blocks[block_depth]);
2242 #ifdef DWARF_DEBUGGING_INFO
2243 if (write_symbols == DWARF_DEBUG)
2244 dwarfout_end_block (pending_blocks[block_depth]);
2246 #ifdef DWARF2_DEBUGGING_INFO
2247 if (write_symbols == DWARF2_DEBUG)
2248 dwarf2out_end_block (pending_blocks[block_depth]);
2251 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL
2252 && (debug_info_level == DINFO_LEVEL_NORMAL
2253 || debug_info_level == DINFO_LEVEL_VERBOSE))
2255 #ifdef DWARF_DEBUGGING_INFO
2256 if (write_symbols == DWARF_DEBUG)
2257 dwarfout_label (insn);
2259 #ifdef DWARF2_DEBUGGING_INFO
2260 if (write_symbols == DWARF2_DEBUG)
2261 dwarf2out_label (insn);
2264 else if (NOTE_LINE_NUMBER (insn) > 0)
2265 /* This note is a line-number. */
2269 #if 0 /* This is what we used to do. */
2270 output_source_line (file, insn);
2274 /* If there is anything real after this note,
2275 output it. If another line note follows, omit this one. */
2276 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
2278 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
2280 /* These types of notes can be significant
2281 so make sure the preceding line number stays. */
2282 else if (GET_CODE (note) == NOTE
2283 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
2284 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
2285 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
2287 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
2289 /* Another line note follows; we can delete this note
2290 if no intervening line numbers have notes elsewhere. */
2292 for (num = NOTE_LINE_NUMBER (insn) + 1;
2293 num < NOTE_LINE_NUMBER (note);
2295 if (line_note_exists[num])
2298 if (num >= NOTE_LINE_NUMBER (note))
2304 /* Output this line note
2305 if it is the first or the last line note in a row. */
2307 output_source_line (file, insn);
2312 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2313 /* If we push arguments, we need to check all insns for stack
2315 if (dwarf2out_do_frame ())
2316 dwarf2out_frame_debug (insn);
2321 /* The target port might emit labels in the output function for
2322 some insn, e.g. sh.c output_branchy_insn. */
2323 if (CODE_LABEL_NUMBER (insn) <= max_labelno)
2325 int align = LABEL_TO_ALIGNMENT (insn);
2326 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2327 int max_skip = LABEL_TO_MAX_SKIP (insn);
2330 if (align && NEXT_INSN (insn))
2331 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2332 ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip);
2334 ASM_OUTPUT_ALIGN (file, align);
2339 /* If this label is reached from only one place, set the condition
2340 codes from the instruction just before the branch. */
2342 /* Disabled because some insns set cc_status in the C output code
2343 and NOTICE_UPDATE_CC alone can set incorrect status. */
2344 if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
2346 rtx jump = LABEL_REFS (insn);
2347 rtx barrier = prev_nonnote_insn (insn);
2349 /* If the LABEL_REFS field of this label has been set to point
2350 at a branch, the predecessor of the branch is a regular
2351 insn, and that branch is the only way to reach this label,
2352 set the condition codes based on the branch and its
2354 if (barrier && GET_CODE (barrier) == BARRIER
2355 && jump && GET_CODE (jump) == JUMP_INSN
2356 && (prev = prev_nonnote_insn (jump))
2357 && GET_CODE (prev) == INSN)
2359 NOTICE_UPDATE_CC (PATTERN (prev), prev);
2360 NOTICE_UPDATE_CC (PATTERN (jump), jump);
2368 #ifdef FINAL_PRESCAN_LABEL
2369 FINAL_PRESCAN_INSN (insn, NULL_PTR, 0);
2372 #ifdef SDB_DEBUGGING_INFO
2373 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
2374 sdbout_label (insn);
2376 #ifdef DWARF_DEBUGGING_INFO
2377 if (write_symbols == DWARF_DEBUG && LABEL_NAME (insn))
2378 dwarfout_label (insn);
2380 #ifdef DWARF2_DEBUGGING_INFO
2381 if (write_symbols == DWARF2_DEBUG && LABEL_NAME (insn))
2382 dwarf2out_label (insn);
2386 fputs (ASM_APP_OFF, file);
2389 if (NEXT_INSN (insn) != 0
2390 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
2392 rtx nextbody = PATTERN (NEXT_INSN (insn));
2394 /* If this label is followed by a jump-table,
2395 make sure we put the label in the read-only section. Also
2396 possibly write the label and jump table together. */
2398 if (GET_CODE (nextbody) == ADDR_VEC
2399 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
2401 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2402 /* In this case, the case vector is being moved by the
2403 target, so don't output the label at all. Leave that
2404 to the back end macros. */
2406 if (! JUMP_TABLES_IN_TEXT_SECTION)
2408 readonly_data_section ();
2409 #ifdef READONLY_DATA_SECTION
2410 ASM_OUTPUT_ALIGN (file,
2411 exact_log2 (BIGGEST_ALIGNMENT
2413 #endif /* READONLY_DATA_SECTION */
2416 function_section (current_function_decl);
2418 #ifdef ASM_OUTPUT_CASE_LABEL
2419 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
2422 if (LABEL_ALTERNATE_NAME (insn))
2423 ASM_OUTPUT_ALTERNATE_LABEL_NAME (file, insn);
2425 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2431 if (LABEL_ALTERNATE_NAME (insn))
2432 ASM_OUTPUT_ALTERNATE_LABEL_NAME (file, insn);
2434 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2439 register rtx body = PATTERN (insn);
2440 int insn_code_number;
2441 const char *template;
2446 /* An INSN, JUMP_INSN or CALL_INSN.
2447 First check for special kinds that recog doesn't recognize. */
2449 if (GET_CODE (body) == USE /* These are just declarations */
2450 || GET_CODE (body) == CLOBBER)
2454 /* If there is a REG_CC_SETTER note on this insn, it means that
2455 the setting of the condition code was done in the delay slot
2456 of the insn that branched here. So recover the cc status
2457 from the insn that set it. */
2459 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
2462 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
2463 cc_prev_status = cc_status;
2467 /* Detect insns that are really jump-tables
2468 and output them as such. */
2470 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
2472 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2473 register int vlen, idx;
2481 fputs (ASM_APP_OFF, file);
2485 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2486 if (GET_CODE (body) == ADDR_VEC)
2488 #ifdef ASM_OUTPUT_ADDR_VEC
2489 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2496 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2497 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2503 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
2504 for (idx = 0; idx < vlen; idx++)
2506 if (GET_CODE (body) == ADDR_VEC)
2508 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2509 ASM_OUTPUT_ADDR_VEC_ELT
2510 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
2517 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2518 ASM_OUTPUT_ADDR_DIFF_ELT
2521 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
2522 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
2528 #ifdef ASM_OUTPUT_CASE_END
2529 ASM_OUTPUT_CASE_END (file,
2530 CODE_LABEL_NUMBER (PREV_INSN (insn)),
2535 function_section (current_function_decl);
2540 /* Do basic-block profiling when we reach a new block.
2541 Done here to avoid jump tables. */
2542 if (profile_block_flag && new_block)
2545 if (GET_CODE (body) == ASM_INPUT)
2547 /* There's no telling what that did to the condition codes. */
2553 fputs (ASM_APP_ON, file);
2556 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
2560 /* Detect `asm' construct with operands. */
2561 if (asm_noperands (body) >= 0)
2563 unsigned int noperands = asm_noperands (body);
2564 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
2567 /* There's no telling what that did to the condition codes. */
2574 fputs (ASM_APP_ON, file);
2578 /* Get out the operand values. */
2579 string = decode_asm_operands (body, ops, NULL_PTR,
2580 NULL_PTR, NULL_PTR);
2581 /* Inhibit aborts on what would otherwise be compiler bugs. */
2582 insn_noperands = noperands;
2583 this_is_asm_operands = insn;
2585 /* Output the insn using them. */
2586 output_asm_insn (string, ops);
2587 this_is_asm_operands = 0;
2591 if (prescan <= 0 && app_on)
2593 fputs (ASM_APP_OFF, file);
2597 if (GET_CODE (body) == SEQUENCE)
2599 /* A delayed-branch sequence */
2605 final_sequence = body;
2607 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2608 force the restoration of a comparison that was previously
2609 thought unnecessary. If that happens, cancel this sequence
2610 and cause that insn to be restored. */
2612 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
2613 if (next != XVECEXP (body, 0, 1))
2619 for (i = 1; i < XVECLEN (body, 0); i++)
2621 rtx insn = XVECEXP (body, 0, i);
2622 rtx next = NEXT_INSN (insn);
2623 /* We loop in case any instruction in a delay slot gets
2626 insn = final_scan_insn (insn, file, 0, prescan, 1);
2627 while (insn != next);
2629 #ifdef DBR_OUTPUT_SEQEND
2630 DBR_OUTPUT_SEQEND (file);
2634 /* If the insn requiring the delay slot was a CALL_INSN, the
2635 insns in the delay slot are actually executed before the
2636 called function. Hence we don't preserve any CC-setting
2637 actions in these insns and the CC must be marked as being
2638 clobbered by the function. */
2639 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
2644 /* Following a conditional branch sequence, we have a new basic
2646 if (profile_block_flag)
2648 rtx insn = XVECEXP (body, 0, 0);
2649 rtx body = PATTERN (insn);
2651 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2652 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2653 || (GET_CODE (insn) == JUMP_INSN
2654 && GET_CODE (body) == PARALLEL
2655 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2656 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
2662 /* We have a real machine instruction as rtl. */
2664 body = PATTERN (insn);
2667 set = single_set(insn);
2669 /* Check for redundant test and compare instructions
2670 (when the condition codes are already set up as desired).
2671 This is done only when optimizing; if not optimizing,
2672 it should be possible for the user to alter a variable
2673 with the debugger in between statements
2674 and the next statement should reexamine the variable
2675 to compute the condition codes. */
2680 rtx set = single_set(insn);
2684 && GET_CODE (SET_DEST (set)) == CC0
2685 && insn != last_ignored_compare)
2687 if (GET_CODE (SET_SRC (set)) == SUBREG)
2688 SET_SRC (set) = alter_subreg (SET_SRC (set));
2689 else if (GET_CODE (SET_SRC (set)) == COMPARE)
2691 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
2692 XEXP (SET_SRC (set), 0)
2693 = alter_subreg (XEXP (SET_SRC (set), 0));
2694 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
2695 XEXP (SET_SRC (set), 1)
2696 = alter_subreg (XEXP (SET_SRC (set), 1));
2698 if ((cc_status.value1 != 0
2699 && rtx_equal_p (SET_SRC (set), cc_status.value1))
2700 || (cc_status.value2 != 0
2701 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
2703 /* Don't delete insn if it has an addressing side-effect. */
2704 if (! FIND_REG_INC_NOTE (insn, 0)
2705 /* or if anything in it is volatile. */
2706 && ! volatile_refs_p (PATTERN (insn)))
2708 /* We don't really delete the insn; just ignore it. */
2709 last_ignored_compare = insn;
2717 /* Following a conditional branch, we have a new basic block.
2718 But if we are inside a sequence, the new block starts after the
2719 last insn of the sequence. */
2720 if (profile_block_flag && final_sequence == 0
2721 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2722 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2723 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
2724 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2725 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
2729 /* Don't bother outputting obvious no-ops, even without -O.
2730 This optimization is fast and doesn't interfere with debugging.
2731 Don't do this if the insn is in a delay slot, since this
2732 will cause an improper number of delay insns to be written. */
2733 if (final_sequence == 0
2735 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
2736 && GET_CODE (SET_SRC (body)) == REG
2737 && GET_CODE (SET_DEST (body)) == REG
2738 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
2743 /* If this is a conditional branch, maybe modify it
2744 if the cc's are in a nonstandard state
2745 so that it accomplishes the same thing that it would
2746 do straightforwardly if the cc's were set up normally. */
2748 if (cc_status.flags != 0
2749 && GET_CODE (insn) == JUMP_INSN
2750 && GET_CODE (body) == SET
2751 && SET_DEST (body) == pc_rtx
2752 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
2753 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
2754 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
2755 /* This is done during prescan; it is not done again
2756 in final scan when prescan has been done. */
2759 /* This function may alter the contents of its argument
2760 and clear some of the cc_status.flags bits.
2761 It may also return 1 meaning condition now always true
2762 or -1 meaning condition now always false
2763 or 2 meaning condition nontrivial but altered. */
2764 register int result = alter_cond (XEXP (SET_SRC (body), 0));
2765 /* If condition now has fixed value, replace the IF_THEN_ELSE
2766 with its then-operand or its else-operand. */
2768 SET_SRC (body) = XEXP (SET_SRC (body), 1);
2770 SET_SRC (body) = XEXP (SET_SRC (body), 2);
2772 /* The jump is now either unconditional or a no-op.
2773 If it has become a no-op, don't try to output it.
2774 (It would not be recognized.) */
2775 if (SET_SRC (body) == pc_rtx)
2777 PUT_CODE (insn, NOTE);
2778 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2779 NOTE_SOURCE_FILE (insn) = 0;
2782 else if (GET_CODE (SET_SRC (body)) == RETURN)
2783 /* Replace (set (pc) (return)) with (return). */
2784 PATTERN (insn) = body = SET_SRC (body);
2786 /* Rerecognize the instruction if it has changed. */
2788 INSN_CODE (insn) = -1;
2791 /* Make same adjustments to instructions that examine the
2792 condition codes without jumping and instructions that
2793 handle conditional moves (if this machine has either one). */
2795 if (cc_status.flags != 0
2798 rtx cond_rtx, then_rtx, else_rtx;
2800 if (GET_CODE (insn) != JUMP_INSN
2801 && GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
2803 cond_rtx = XEXP (SET_SRC (set), 0);
2804 then_rtx = XEXP (SET_SRC (set), 1);
2805 else_rtx = XEXP (SET_SRC (set), 2);
2809 cond_rtx = SET_SRC (set);
2810 then_rtx = const_true_rtx;
2811 else_rtx = const0_rtx;
2814 switch (GET_CODE (cond_rtx))
2827 register int result;
2828 if (XEXP (cond_rtx, 0) != cc0_rtx)
2830 result = alter_cond (cond_rtx);
2832 validate_change (insn, &SET_SRC (set), then_rtx, 0);
2833 else if (result == -1)
2834 validate_change (insn, &SET_SRC (set), else_rtx, 0);
2835 else if (result == 2)
2836 INSN_CODE (insn) = -1;
2837 if (SET_DEST (set) == SET_SRC (set))
2839 PUT_CODE (insn, NOTE);
2840 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2841 NOTE_SOURCE_FILE (insn) = 0;
2853 #ifdef HAVE_peephole
2854 /* Do machine-specific peephole optimizations if desired. */
2856 if (optimize && !flag_no_peephole && !nopeepholes)
2858 rtx next = peephole (insn);
2859 /* When peepholing, if there were notes within the peephole,
2860 emit them before the peephole. */
2861 if (next != 0 && next != NEXT_INSN (insn))
2863 rtx prev = PREV_INSN (insn);
2866 for (note = NEXT_INSN (insn); note != next;
2867 note = NEXT_INSN (note))
2868 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2870 /* In case this is prescan, put the notes
2871 in proper position for later rescan. */
2872 note = NEXT_INSN (insn);
2873 PREV_INSN (note) = prev;
2874 NEXT_INSN (prev) = note;
2875 NEXT_INSN (PREV_INSN (next)) = insn;
2876 PREV_INSN (insn) = PREV_INSN (next);
2877 NEXT_INSN (insn) = next;
2878 PREV_INSN (next) = insn;
2881 /* PEEPHOLE might have changed this. */
2882 body = PATTERN (insn);
2886 /* Try to recognize the instruction.
2887 If successful, verify that the operands satisfy the
2888 constraints for the instruction. Crash if they don't,
2889 since `reload' should have changed them so that they do. */
2891 insn_code_number = recog_memoized (insn);
2892 extract_insn (insn);
2893 cleanup_subreg_operands (insn);
2895 if (! constrain_operands (1))
2896 fatal_insn_not_found (insn);
2898 /* Some target machines need to prescan each insn before
2901 #ifdef FINAL_PRESCAN_INSN
2902 FINAL_PRESCAN_INSN (insn, recog_data.operand, recog_data.n_operands);
2906 cc_prev_status = cc_status;
2908 /* Update `cc_status' for this instruction.
2909 The instruction's output routine may change it further.
2910 If the output routine for a jump insn needs to depend
2911 on the cc status, it should look at cc_prev_status. */
2913 NOTICE_UPDATE_CC (body, insn);
2918 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2919 /* If we push arguments, we want to know where the calls are. */
2920 if (GET_CODE (insn) == CALL_INSN && dwarf2out_do_frame ())
2921 dwarf2out_frame_debug (insn);
2924 /* Find the proper template for this insn. */
2925 template = get_insn_template (insn_code_number, insn);
2927 /* If the C code returns 0, it means that it is a jump insn
2928 which follows a deleted test insn, and that test insn
2929 needs to be reinserted. */
2932 if (prev_nonnote_insn (insn) != last_ignored_compare)
2935 return prev_nonnote_insn (insn);
2938 /* If the template is the string "#", it means that this insn must
2940 if (template[0] == '#' && template[1] == '\0')
2942 rtx new = try_split (body, insn, 0);
2944 /* If we didn't split the insn, go away. */
2945 if (new == insn && PATTERN (new) == body)
2946 fatal_insn ("Could not split insn", insn);
2948 #ifdef HAVE_ATTR_length
2949 /* This instruction should have been split in shorten_branches,
2950 to ensure that we would have valid length info for the
2962 /* Output assembler code from the template. */
2964 output_asm_insn (template, recog_data.operand);
2966 #if defined (DWARF2_UNWIND_INFO)
2967 #if !defined (ACCUMULATE_OUTGOING_ARGS)
2968 /* If we push arguments, we need to check all insns for stack
2970 if (GET_CODE (insn) == INSN && dwarf2out_do_frame ())
2971 dwarf2out_frame_debug (insn);
2973 #if defined (HAVE_prologue)
2974 /* If this insn is part of the prologue, emit DWARF v2
2976 if (RTX_FRAME_RELATED_P (insn) && dwarf2out_do_frame ())
2977 dwarf2out_frame_debug (insn);
2983 /* It's not at all clear why we did this and doing so interferes
2984 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2987 /* Mark this insn as having been output. */
2988 INSN_DELETED_P (insn) = 1;
2994 return NEXT_INSN (insn);
2997 /* Output debugging info to the assembler file FILE
2998 based on the NOTE-insn INSN, assumed to be a line number. */
3001 output_source_line (file, insn)
3002 FILE *file ATTRIBUTE_UNUSED;
3005 register char *filename = NOTE_SOURCE_FILE (insn);
3007 /* Remember filename for basic block profiling.
3008 Filenames are allocated on the permanent obstack
3009 or are passed in ARGV, so we don't have to save
3012 if (profile_block_flag && last_filename != filename)
3013 bb_file_label_num = add_bb_string (filename, TRUE);
3015 last_filename = filename;
3016 last_linenum = NOTE_LINE_NUMBER (insn);
3017 high_block_linenum = MAX (last_linenum, high_block_linenum);
3018 high_function_linenum = MAX (last_linenum, high_function_linenum);
3020 if (write_symbols != NO_DEBUG)
3022 #ifdef SDB_DEBUGGING_INFO
3023 if (write_symbols == SDB_DEBUG
3024 #if 0 /* People like having line numbers even in wrong file! */
3025 /* COFF can't handle multiple source files--lose, lose. */
3026 && !strcmp (filename, main_input_filename)
3028 /* COFF relative line numbers must be positive. */
3029 && last_linenum > sdb_begin_function_line)
3031 #ifdef ASM_OUTPUT_SOURCE_LINE
3032 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
3034 fprintf (file, "\t.ln\t%d\n",
3035 ((sdb_begin_function_line > -1)
3036 ? last_linenum - sdb_begin_function_line : 1));
3041 #if defined (DBX_DEBUGGING_INFO)
3042 if (write_symbols == DBX_DEBUG)
3043 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
3046 #if defined (XCOFF_DEBUGGING_INFO)
3047 if (write_symbols == XCOFF_DEBUG)
3048 xcoffout_source_line (file, filename, insn);
3051 #ifdef DWARF_DEBUGGING_INFO
3052 if (write_symbols == DWARF_DEBUG)
3053 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
3056 #ifdef DWARF2_DEBUGGING_INFO
3057 if (write_symbols == DWARF2_DEBUG)
3058 dwarf2out_line (filename, NOTE_LINE_NUMBER (insn));
3064 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3065 directly to the desired hard register. */
3067 cleanup_subreg_operands (insn)
3072 extract_insn (insn);
3073 for (i = 0; i < recog_data.n_operands; i++)
3075 if (GET_CODE (recog_data.operand[i]) == SUBREG)
3076 recog_data.operand[i] = alter_subreg (recog_data.operand[i]);
3077 else if (GET_CODE (recog_data.operand[i]) == PLUS
3078 || GET_CODE (recog_data.operand[i]) == MULT)
3079 recog_data.operand[i] = walk_alter_subreg (recog_data.operand[i]);
3082 for (i = 0; i < recog_data.n_dups; i++)
3084 if (GET_CODE (*recog_data.dup_loc[i]) == SUBREG)
3085 *recog_data.dup_loc[i] = alter_subreg (*recog_data.dup_loc[i]);
3086 else if (GET_CODE (*recog_data.dup_loc[i]) == PLUS
3087 || GET_CODE (*recog_data.dup_loc[i]) == MULT)
3088 *recog_data.dup_loc[i] = walk_alter_subreg (*recog_data.dup_loc[i]);
3092 /* If X is a SUBREG, replace it with a REG or a MEM,
3093 based on the thing it is a subreg of. */
3099 register rtx y = SUBREG_REG (x);
3101 if (GET_CODE (y) == SUBREG)
3102 y = alter_subreg (y);
3104 /* If reload is operating, we may be replacing inside this SUBREG.
3105 Check for that and make a new one if so. */
3106 if (reload_in_progress && find_replacement (&SUBREG_REG (x)) != 0)
3109 if (GET_CODE (y) == REG)
3112 /* If the word size is larger than the size of this register,
3113 adjust the register number to compensate. */
3114 /* ??? Note that this just catches stragglers created by/for
3115 integrate. It would be better if we either caught these
3116 earlier, or kept _all_ subregs until now and eliminate
3117 gen_lowpart and friends. */
3119 #ifdef ALTER_HARD_SUBREG
3120 regno = ALTER_HARD_SUBREG(GET_MODE (x), SUBREG_WORD (x),
3121 GET_MODE (y), REGNO (y));
3123 regno = REGNO (y) + SUBREG_WORD (x);
3127 /* This field has a different meaning for REGs and SUBREGs. Make sure
3131 else if (GET_CODE (y) == MEM)
3133 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
3134 if (BYTES_BIG_ENDIAN)
3135 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
3136 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
3138 MEM_COPY_ATTRIBUTES (x, y);
3139 MEM_ALIAS_SET (x) = MEM_ALIAS_SET (y);
3140 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
3146 /* Do alter_subreg on all the SUBREGs contained in X. */
3149 walk_alter_subreg (x)
3152 switch (GET_CODE (x))
3156 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3157 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
3161 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3165 return alter_subreg (x);
3176 /* Given BODY, the body of a jump instruction, alter the jump condition
3177 as required by the bits that are set in cc_status.flags.
3178 Not all of the bits there can be handled at this level in all cases.
3180 The value is normally 0.
3181 1 means that the condition has become always true.
3182 -1 means that the condition has become always false.
3183 2 means that COND has been altered. */
3191 if (cc_status.flags & CC_REVERSED)
3194 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
3197 if (cc_status.flags & CC_INVERTED)
3200 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
3203 if (cc_status.flags & CC_NOT_POSITIVE)
3204 switch (GET_CODE (cond))
3209 /* Jump becomes unconditional. */
3215 /* Jump becomes no-op. */
3219 PUT_CODE (cond, EQ);
3224 PUT_CODE (cond, NE);
3232 if (cc_status.flags & CC_NOT_NEGATIVE)
3233 switch (GET_CODE (cond))
3237 /* Jump becomes unconditional. */
3242 /* Jump becomes no-op. */
3247 PUT_CODE (cond, EQ);
3253 PUT_CODE (cond, NE);
3261 if (cc_status.flags & CC_NO_OVERFLOW)
3262 switch (GET_CODE (cond))
3265 /* Jump becomes unconditional. */
3269 PUT_CODE (cond, EQ);
3274 PUT_CODE (cond, NE);
3279 /* Jump becomes no-op. */
3286 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
3287 switch (GET_CODE (cond))
3293 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
3298 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
3303 if (cc_status.flags & CC_NOT_SIGNED)
3304 /* The flags are valid if signed condition operators are converted
3306 switch (GET_CODE (cond))
3309 PUT_CODE (cond, LEU);
3314 PUT_CODE (cond, LTU);
3319 PUT_CODE (cond, GTU);
3324 PUT_CODE (cond, GEU);
3336 /* Report inconsistency between the assembler template and the operands.
3337 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3340 output_operand_lossage (msgid)
3343 if (this_is_asm_operands)
3344 error_for_asm (this_is_asm_operands, "invalid `asm': %s", _(msgid));
3347 error ("output_operand: %s", _(msgid));
3352 /* Output of assembler code from a template, and its subroutines. */
3354 /* Output text from TEMPLATE to the assembler output file,
3355 obeying %-directions to substitute operands taken from
3356 the vector OPERANDS.
3358 %N (for N a digit) means print operand N in usual manner.
3359 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3360 and print the label name with no punctuation.
3361 %cN means require operand N to be a constant
3362 and print the constant expression with no punctuation.
3363 %aN means expect operand N to be a memory address
3364 (not a memory reference!) and print a reference
3366 %nN means expect operand N to be a constant
3367 and print a constant expression for minus the value
3368 of the operand, with no other punctuation. */
3373 if (flag_print_asm_name)
3375 /* Annotate the assembly with a comment describing the pattern and
3376 alternative used. */
3379 register int num = INSN_CODE (debug_insn);
3380 fprintf (asm_out_file, "\t%s %d\t%s",
3381 ASM_COMMENT_START, INSN_UID (debug_insn),
3382 insn_data[num].name);
3383 if (insn_data[num].n_alternatives > 1)
3384 fprintf (asm_out_file, "/%d", which_alternative + 1);
3385 #ifdef HAVE_ATTR_length
3386 fprintf (asm_out_file, "\t[length = %d]",
3387 get_attr_length (debug_insn));
3389 /* Clear this so only the first assembler insn
3390 of any rtl insn will get the special comment for -dp. */
3397 output_asm_insn (template, operands)
3398 const char *template;
3401 register const char *p;
3404 /* An insn may return a null string template
3405 in a case where no assembler code is needed. */
3410 putc ('\t', asm_out_file);
3412 #ifdef ASM_OUTPUT_OPCODE
3413 ASM_OUTPUT_OPCODE (asm_out_file, p);
3421 putc (c, asm_out_file);
3422 #ifdef ASM_OUTPUT_OPCODE
3423 while ((c = *p) == '\t')
3425 putc (c, asm_out_file);
3428 ASM_OUTPUT_OPCODE (asm_out_file, p);
3432 #ifdef ASSEMBLER_DIALECT
3437 /* If we want the first dialect, do nothing. Otherwise, skip
3438 DIALECT_NUMBER of strings ending with '|'. */
3439 for (i = 0; i < dialect_number; i++)
3441 while (*p && *p != '}' && *p++ != '|')
3452 /* Skip to close brace. */
3453 while (*p && *p++ != '}')
3462 /* %% outputs a single %. */
3466 putc (c, asm_out_file);
3468 /* %= outputs a number which is unique to each insn in the entire
3469 compilation. This is useful for making local labels that are
3470 referred to more than once in a given insn. */
3474 fprintf (asm_out_file, "%d", insn_counter);
3476 /* % followed by a letter and some digits
3477 outputs an operand in a special way depending on the letter.
3478 Letters `acln' are implemented directly.
3479 Other letters are passed to `output_operand' so that
3480 the PRINT_OPERAND macro can define them. */
3481 else if ((*p >= 'a' && *p <= 'z')
3482 || (*p >= 'A' && *p <= 'Z'))
3487 if (! (*p >= '0' && *p <= '9'))
3488 output_operand_lossage ("operand number missing after %-letter");
3489 else if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3490 output_operand_lossage ("operand number out of range");
3491 else if (letter == 'l')
3492 output_asm_label (operands[c]);
3493 else if (letter == 'a')
3494 output_address (operands[c]);
3495 else if (letter == 'c')
3497 if (CONSTANT_ADDRESS_P (operands[c]))
3498 output_addr_const (asm_out_file, operands[c]);
3500 output_operand (operands[c], 'c');
3502 else if (letter == 'n')
3504 if (GET_CODE (operands[c]) == CONST_INT)
3505 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
3506 - INTVAL (operands[c]));
3509 putc ('-', asm_out_file);
3510 output_addr_const (asm_out_file, operands[c]);
3514 output_operand (operands[c], letter);
3516 while ((c = *p) >= '0' && c <= '9') p++;
3518 /* % followed by a digit outputs an operand the default way. */
3519 else if (*p >= '0' && *p <= '9')
3522 if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3523 output_operand_lossage ("operand number out of range");
3525 output_operand (operands[c], 0);
3526 while ((c = *p) >= '0' && c <= '9') p++;
3528 /* % followed by punctuation: output something for that
3529 punctuation character alone, with no operand.
3530 The PRINT_OPERAND macro decides what is actually done. */
3531 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3532 else if (PRINT_OPERAND_PUNCT_VALID_P ((unsigned char)*p))
3533 output_operand (NULL_RTX, *p++);
3536 output_operand_lossage ("invalid %%-code");
3540 putc (c, asm_out_file);
3545 putc ('\n', asm_out_file);
3548 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3551 output_asm_label (x)
3556 if (GET_CODE (x) == LABEL_REF)
3557 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3558 else if (GET_CODE (x) == CODE_LABEL)
3559 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3561 output_operand_lossage ("`%l' operand isn't a label");
3563 assemble_name (asm_out_file, buf);
3566 /* Print operand X using machine-dependent assembler syntax.
3567 The macro PRINT_OPERAND is defined just to control this function.
3568 CODE is a non-digit that preceded the operand-number in the % spec,
3569 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3570 between the % and the digits.
3571 When CODE is a non-letter, X is 0.
3573 The meanings of the letters are machine-dependent and controlled
3574 by PRINT_OPERAND. */
3577 output_operand (x, code)
3581 if (x && GET_CODE (x) == SUBREG)
3582 x = alter_subreg (x);
3584 /* If X is a pseudo-register, abort now rather than writing trash to the
3587 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
3590 PRINT_OPERAND (asm_out_file, x, code);
3593 /* Print a memory reference operand for address X
3594 using machine-dependent assembler syntax.
3595 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3601 walk_alter_subreg (x);
3602 PRINT_OPERAND_ADDRESS (asm_out_file, x);
3605 /* Print an integer constant expression in assembler syntax.
3606 Addition and subtraction are the only arithmetic
3607 that may appear in these expressions. */
3610 output_addr_const (file, x)
3617 switch (GET_CODE (x))
3627 assemble_name (file, XSTR (x, 0));
3631 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3632 assemble_name (file, buf);
3636 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3637 assemble_name (file, buf);
3641 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
3645 /* This used to output parentheses around the expression,
3646 but that does not work on the 386 (either ATT or BSD assembler). */
3647 output_addr_const (file, XEXP (x, 0));
3651 if (GET_MODE (x) == VOIDmode)
3653 /* We can use %d if the number is one word and positive. */
3654 if (CONST_DOUBLE_HIGH (x))
3655 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3656 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
3657 else if (CONST_DOUBLE_LOW (x) < 0)
3658 fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
3660 fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
3663 /* We can't handle floating point constants;
3664 PRINT_OPERAND must handle them. */
3665 output_operand_lossage ("floating constant misused");
3669 /* Some assemblers need integer constants to appear last (eg masm). */
3670 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
3672 output_addr_const (file, XEXP (x, 1));
3673 if (INTVAL (XEXP (x, 0)) >= 0)
3674 fprintf (file, "+");
3675 output_addr_const (file, XEXP (x, 0));
3679 output_addr_const (file, XEXP (x, 0));
3680 if (INTVAL (XEXP (x, 1)) >= 0)
3681 fprintf (file, "+");
3682 output_addr_const (file, XEXP (x, 1));
3687 /* Avoid outputting things like x-x or x+5-x,
3688 since some assemblers can't handle that. */
3689 x = simplify_subtraction (x);
3690 if (GET_CODE (x) != MINUS)
3693 output_addr_const (file, XEXP (x, 0));
3694 fprintf (file, "-");
3695 if (GET_CODE (XEXP (x, 1)) == CONST_INT
3696 && INTVAL (XEXP (x, 1)) < 0)
3698 fprintf (file, "%s", ASM_OPEN_PAREN);
3699 output_addr_const (file, XEXP (x, 1));
3700 fprintf (file, "%s", ASM_CLOSE_PAREN);
3703 output_addr_const (file, XEXP (x, 1));
3708 output_addr_const (file, XEXP (x, 0));
3712 output_operand_lossage ("invalid expression as operand");
3716 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3717 %R prints the value of REGISTER_PREFIX.
3718 %L prints the value of LOCAL_LABEL_PREFIX.
3719 %U prints the value of USER_LABEL_PREFIX.
3720 %I prints the value of IMMEDIATE_PREFIX.
3721 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3722 Also supported are %d, %x, %s, %e, %f, %g and %%.
3724 We handle alternate assembler dialects here, just like output_asm_insn. */
3727 asm_fprintf VPROTO((FILE *file, const char *p, ...))
3729 #ifndef ANSI_PROTOTYPES
3737 VA_START (argptr, p);
3739 #ifndef ANSI_PROTOTYPES
3740 file = va_arg (argptr, FILE *);
3741 p = va_arg (argptr, const char *);
3749 #ifdef ASSEMBLER_DIALECT
3754 /* If we want the first dialect, do nothing. Otherwise, skip
3755 DIALECT_NUMBER of strings ending with '|'. */
3756 for (i = 0; i < dialect_number; i++)
3758 while (*p && *p++ != '|')
3768 /* Skip to close brace. */
3769 while (*p && *p++ != '}')
3780 while ((c >= '0' && c <= '9') || c == '.')
3788 fprintf (file, "%%");
3791 case 'd': case 'i': case 'u':
3792 case 'x': case 'p': case 'X':
3796 fprintf (file, buf, va_arg (argptr, int));
3800 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3801 but we do not check for those cases. It means that the value
3802 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3804 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3806 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3816 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3823 fprintf (file, buf, va_arg (argptr, long));
3831 fprintf (file, buf, va_arg (argptr, double));
3837 fprintf (file, buf, va_arg (argptr, char *));
3841 #ifdef ASM_OUTPUT_OPCODE
3842 ASM_OUTPUT_OPCODE (asm_out_file, p);
3847 #ifdef REGISTER_PREFIX
3848 fprintf (file, "%s", REGISTER_PREFIX);
3853 #ifdef IMMEDIATE_PREFIX
3854 fprintf (file, "%s", IMMEDIATE_PREFIX);
3859 #ifdef LOCAL_LABEL_PREFIX
3860 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
3865 fputs (user_label_prefix, file);
3868 #ifdef ASM_FPRINTF_EXTENSIONS
3869 /* Upper case letters are reserved for general use by asm_fprintf
3870 and so are not available to target specific code. In order to
3871 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
3872 they are defined here. As they get turned into real extensions
3873 to asm_fprintf they should be removed from this list. */
3874 case 'A': case 'B': case 'C': case 'D': case 'E':
3875 case 'F': case 'G': case 'H': case 'J': case 'K':
3876 case 'M': case 'N': case 'P': case 'Q': case 'S':
3877 case 'T': case 'V': case 'W': case 'Y': case 'Z':
3880 ASM_FPRINTF_EXTENSIONS (file, argptr, p)
3893 /* Split up a CONST_DOUBLE or integer constant rtx
3894 into two rtx's for single words,
3895 storing in *FIRST the word that comes first in memory in the target
3896 and in *SECOND the other. */
3899 split_double (value, first, second)
3901 rtx *first, *second;
3903 if (GET_CODE (value) == CONST_INT)
3905 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3907 /* In this case the CONST_INT holds both target words.
3908 Extract the bits from it into two word-sized pieces.
3909 Sign extend each half to HOST_WIDE_INT. */
3911 /* On machines where HOST_BITS_PER_WIDE_INT == BITS_PER_WORD
3912 the shift below will cause a compiler warning, even though
3913 this code won't be executed. So put the shift amounts in
3914 variables to avoid the warning. */
3915 int rshift = HOST_BITS_PER_WIDE_INT - BITS_PER_WORD;
3916 int lshift = HOST_BITS_PER_WIDE_INT - 2 * BITS_PER_WORD;
3918 low = GEN_INT ((INTVAL (value) << rshift) >> rshift);
3919 high = GEN_INT ((INTVAL (value) << lshift) >> rshift);
3920 if (WORDS_BIG_ENDIAN)
3933 /* The rule for using CONST_INT for a wider mode
3934 is that we regard the value as signed.
3935 So sign-extend it. */
3936 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
3937 if (WORDS_BIG_ENDIAN)
3949 else if (GET_CODE (value) != CONST_DOUBLE)
3951 if (WORDS_BIG_ENDIAN)
3953 *first = const0_rtx;
3959 *second = const0_rtx;
3962 else if (GET_MODE (value) == VOIDmode
3963 /* This is the old way we did CONST_DOUBLE integers. */
3964 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
3966 /* In an integer, the words are defined as most and least significant.
3967 So order them by the target's convention. */
3968 if (WORDS_BIG_ENDIAN)
3970 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3971 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3975 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3976 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3981 #ifdef REAL_ARITHMETIC
3982 REAL_VALUE_TYPE r; long l[2];
3983 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
3985 /* Note, this converts the REAL_VALUE_TYPE to the target's
3986 format, splits up the floating point double and outputs
3987 exactly 32 bits of it into each of l[0] and l[1] --
3988 not necessarily BITS_PER_WORD bits. */
3989 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
3991 /* If 32 bits is an entire word for the target, but not for the host,
3992 then sign-extend on the host so that the number will look the same
3993 way on the host that it would on the target. See for instance
3994 simplify_unary_operation. The #if is needed to avoid compiler
3997 #if HOST_BITS_PER_LONG > 32
3998 if (BITS_PER_WORD < HOST_BITS_PER_LONG && BITS_PER_WORD == 32)
4000 if (l[0] & ((long) 1 << 31))
4001 l[0] |= ((long) (-1) << 32);
4002 if (l[1] & ((long) 1 << 31))
4003 l[1] |= ((long) (-1) << 32);
4007 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
4008 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
4010 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
4011 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
4012 && ! flag_pretend_float)
4016 #ifdef HOST_WORDS_BIG_ENDIAN
4023 /* Host and target agree => no need to swap. */
4024 *first = GEN_INT (CONST_DOUBLE_LOW (value));
4025 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
4029 *second = GEN_INT (CONST_DOUBLE_LOW (value));
4030 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
4032 #endif /* no REAL_ARITHMETIC */
4036 /* Return nonzero if this function has no function calls. */
4043 if (profile_flag || profile_block_flag || profile_arc_flag)
4046 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4048 if (GET_CODE (insn) == CALL_INSN)
4050 if (GET_CODE (insn) == INSN
4051 && GET_CODE (PATTERN (insn)) == SEQUENCE
4052 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN)
4055 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4057 if (GET_CODE (XEXP (insn, 0)) == CALL_INSN)
4059 if (GET_CODE (XEXP (insn, 0)) == INSN
4060 && GET_CODE (PATTERN (XEXP (insn, 0))) == SEQUENCE
4061 && GET_CODE (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)) == CALL_INSN)
4068 /* On some machines, a function with no call insns
4069 can run faster if it doesn't create its own register window.
4070 When output, the leaf function should use only the "output"
4071 registers. Ordinarily, the function would be compiled to use
4072 the "input" registers to find its arguments; it is a candidate
4073 for leaf treatment if it uses only the "input" registers.
4074 Leaf function treatment means renumbering so the function
4075 uses the "output" registers instead. */
4077 #ifdef LEAF_REGISTERS
4079 static char permitted_reg_in_leaf_functions[] = LEAF_REGISTERS;
4081 /* Return 1 if this function uses only the registers that can be
4082 safely renumbered. */
4085 only_leaf_regs_used ()
4089 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4090 if ((regs_ever_live[i] || global_regs[i])
4091 && ! permitted_reg_in_leaf_functions[i])
4094 if (current_function_uses_pic_offset_table
4095 && pic_offset_table_rtx != 0
4096 && GET_CODE (pic_offset_table_rtx) == REG
4097 && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4103 /* Scan all instructions and renumber all registers into those
4104 available in leaf functions. */
4107 leaf_renumber_regs (first)
4112 /* Renumber only the actual patterns.
4113 The reg-notes can contain frame pointer refs,
4114 and renumbering them could crash, and should not be needed. */
4115 for (insn = first; insn; insn = NEXT_INSN (insn))
4116 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
4117 leaf_renumber_regs_insn (PATTERN (insn));
4118 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4119 if (GET_RTX_CLASS (GET_CODE (XEXP (insn, 0))) == 'i')
4120 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
4123 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4124 available in leaf functions. */
4127 leaf_renumber_regs_insn (in_rtx)
4128 register rtx in_rtx;
4131 register const char *format_ptr;
4136 /* Renumber all input-registers into output-registers.
4137 renumbered_regs would be 1 for an output-register;
4140 if (GET_CODE (in_rtx) == REG)
4144 /* Don't renumber the same reg twice. */
4148 newreg = REGNO (in_rtx);
4149 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4150 to reach here as part of a REG_NOTE. */
4151 if (newreg >= FIRST_PSEUDO_REGISTER)
4156 newreg = LEAF_REG_REMAP (newreg);
4159 regs_ever_live[REGNO (in_rtx)] = 0;
4160 regs_ever_live[newreg] = 1;
4161 REGNO (in_rtx) = newreg;
4165 if (GET_RTX_CLASS (GET_CODE (in_rtx)) == 'i')
4167 /* Inside a SEQUENCE, we find insns.
4168 Renumber just the patterns of these insns,
4169 just as we do for the top-level insns. */
4170 leaf_renumber_regs_insn (PATTERN (in_rtx));
4174 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
4176 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
4177 switch (*format_ptr++)
4180 leaf_renumber_regs_insn (XEXP (in_rtx, i));
4184 if (NULL != XVEC (in_rtx, i))
4186 for (j = 0; j < XVECLEN (in_rtx, i); j++)
4187 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));