1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-98, 1999 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This is the final pass of the compiler.
23 It looks at the rtl code for a function and outputs assembler code.
25 Call `final_start_function' to output the assembler code for function entry,
26 `final' to output assembler code for some RTL code,
27 `final_end_function' to output assembler code for function exit.
28 If a function is compiled in several pieces, each piece is
29 output separately with `final'.
31 Some optimizations are also done at this level.
32 Move instructions that were made unnecessary by good register allocation
33 are detected and omitted from the output. (Though most of these
34 are removed by the last jump pass.)
36 Instructions to set the condition codes are omitted when it can be
37 seen that the condition codes already had the desired values.
39 In some cases it is sufficient if the inherited condition codes
40 have related values, but this may require the following insn
41 (the one that tests the condition codes) to be modified.
43 The code for the function prologue and epilogue are generated
44 directly as assembler code by the macros FUNCTION_PROLOGUE and
45 FUNCTION_EPILOGUE. Those instructions never exist as rtl. */
53 #include "insn-config.h"
54 #include "insn-flags.h"
55 #include "insn-attr.h"
56 #include "insn-codes.h"
58 #include "conditions.h"
61 #include "hard-reg-set.h"
69 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
70 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
72 #if defined (USG) || !defined (HAVE_STAB_H)
73 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
78 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
80 #ifdef XCOFF_DEBUGGING_INFO
84 #ifdef DWARF_DEBUGGING_INFO
88 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
89 #include "dwarf2out.h"
92 #ifdef SDB_DEBUGGING_INFO
96 /* .stabd code for line number. */
101 /* .stabs code for included file name. */
106 #ifndef INT_TYPE_SIZE
107 #define INT_TYPE_SIZE BITS_PER_WORD
110 #ifndef LONG_TYPE_SIZE
111 #define LONG_TYPE_SIZE BITS_PER_WORD
114 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
115 null default for it to save conditionalization later. */
116 #ifndef CC_STATUS_INIT
117 #define CC_STATUS_INIT
120 /* How to start an assembler comment. */
121 #ifndef ASM_COMMENT_START
122 #define ASM_COMMENT_START ";#"
125 /* Is the given character a logical line separator for the assembler? */
126 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
127 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
130 #ifndef JUMP_TABLES_IN_TEXT_SECTION
131 #define JUMP_TABLES_IN_TEXT_SECTION 0
134 /* Last insn processed by final_scan_insn. */
135 static rtx debug_insn = 0;
137 /* Line number of last NOTE. */
138 static int last_linenum;
140 /* Highest line number in current block. */
141 static int high_block_linenum;
143 /* Likewise for function. */
144 static int high_function_linenum;
146 /* Filename of last NOTE. */
147 static char *last_filename;
149 /* Number of basic blocks seen so far;
150 used if profile_block_flag is set. */
151 static int count_basic_blocks;
153 /* Number of instrumented arcs when profile_arc_flag is set. */
154 extern int count_instrumented_arcs;
156 extern int length_unit_log; /* This is defined in insn-attrtab.c. */
158 /* Nonzero while outputting an `asm' with operands.
159 This means that inconsistencies are the user's fault, so don't abort.
160 The precise value is the insn being output, to pass to error_for_asm. */
161 static rtx this_is_asm_operands;
163 /* Number of operands of this insn, for an `asm' with operands. */
164 static unsigned int insn_noperands;
166 /* Compare optimization flag. */
168 static rtx last_ignored_compare = 0;
170 /* Flag indicating this insn is the start of a new basic block. */
172 static int new_block = 1;
174 /* All the symbol-blocks (levels of scoping) in the compilation
175 are assigned sequence numbers in order of appearance of the
176 beginnings of the symbol-blocks. Both final and dbxout do this,
177 and assume that they will both give the same number to each block.
178 Final uses these sequence numbers to generate assembler label names
179 LBBnnn and LBEnnn for the beginning and end of the symbol-block.
180 Dbxout uses the sequence numbers to generate references to the same labels
181 from the dbx debugging information.
183 Sdb records this level at the beginning of each function,
184 in order to find the current level when recursing down declarations.
185 It outputs the block beginning and endings
186 at the point in the asm file where the blocks would begin and end. */
188 int next_block_index;
190 /* Assign a unique number to each insn that is output.
191 This can be used to generate unique local labels. */
193 static int insn_counter = 0;
196 /* This variable contains machine-dependent flags (defined in tm.h)
197 set and examined by output routines
198 that describe how to interpret the condition codes properly. */
202 /* During output of an insn, this contains a copy of cc_status
203 from before the insn. */
205 CC_STATUS cc_prev_status;
208 /* Indexed by hardware reg number, is 1 if that register is ever
209 used in the current function.
211 In life_analysis, or in stupid_life_analysis, this is set
212 up to record the hard regs used explicitly. Reload adds
213 in the hard regs used for holding pseudo regs. Final uses
214 it to generate the code in the function prologue and epilogue
215 to save and restore registers as needed. */
217 char regs_ever_live[FIRST_PSEUDO_REGISTER];
219 /* Nonzero means current function must be given a frame pointer.
220 Set in stmt.c if anything is allocated on the stack there.
221 Set in reload1.c if anything is allocated on the stack there. */
223 int frame_pointer_needed;
225 /* Assign unique numbers to labels generated for profiling. */
227 int profile_label_no;
229 /* Length so far allocated in PENDING_BLOCKS. */
231 static int max_block_depth;
233 /* Stack of sequence numbers of symbol-blocks of which we have seen the
234 beginning but not yet the end. Sequence numbers are assigned at
235 the beginning; this stack allows us to find the sequence number
236 of a block that is ending. */
238 static int *pending_blocks;
240 /* Number of elements currently in use in PENDING_BLOCKS. */
242 static int block_depth;
244 /* Nonzero if have enabled APP processing of our assembler output. */
248 /* If we are outputting an insn sequence, this contains the sequence rtx.
253 #ifdef ASSEMBLER_DIALECT
255 /* Number of the assembler dialect to use, starting at 0. */
256 static int dialect_number;
259 /* Indexed by line number, nonzero if there is a note for that line. */
261 static char *line_note_exists;
263 /* Linked list to hold line numbers for each basic block. */
266 struct bb_list *next; /* pointer to next basic block */
267 int line_num; /* line number */
268 int file_label_num; /* LPBC<n> label # for stored filename */
269 int func_label_num; /* LPBC<n> label # for stored function name */
272 static struct bb_list *bb_head = 0; /* Head of basic block list */
273 static struct bb_list **bb_tail = &bb_head; /* Ptr to store next bb ptr */
274 static int bb_file_label_num = -1; /* Current label # for file */
275 static int bb_func_label_num = -1; /* Current label # for func */
277 /* Linked list to hold the strings for each file and function name output. */
280 struct bb_str *next; /* pointer to next string */
281 const char *string; /* string */
282 int label_num; /* label number */
283 int length; /* string length */
286 extern rtx peephole PROTO((rtx));
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));
310 extern char *getpwd ();
312 /* Initialize data in final at the beginning of a compilation. */
315 init_final (filename)
318 next_block_index = 2;
320 max_block_depth = 20;
321 pending_blocks = (int *) xmalloc (20 * sizeof *pending_blocks);
324 #ifdef ASSEMBLER_DIALECT
325 dialect_number = ASSEMBLER_DIALECT;
329 /* Called at end of source file,
330 to output the block-profiling table for this entire compilation. */
334 const char *filename;
338 if (profile_block_flag || profile_arc_flag)
341 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
345 int long_bytes = LONG_TYPE_SIZE / BITS_PER_UNIT;
346 int pointer_bytes = POINTER_SIZE / BITS_PER_UNIT;
348 if (profile_block_flag)
349 size = long_bytes * count_basic_blocks;
351 size = long_bytes * count_instrumented_arcs;
354 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
355 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
356 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
360 /* Output the main header, of 11 words:
361 0: 1 if this file is initialized, else 0.
362 1: address of file name (LPBX1).
363 2: address of table of counts (LPBX2).
364 3: number of counts in the table.
365 4: always 0, for compatibility with Sun.
367 The following are GNU extensions:
369 5: address of table of start addrs of basic blocks (LPBX3).
370 6: Number of bytes in this header.
371 7: address of table of function names (LPBX4).
372 8: address of table of line numbers (LPBX5) or 0.
373 9: address of table of file names (LPBX6) or 0.
374 10: space reserved for basic block profiling. */
376 ASM_OUTPUT_ALIGN (asm_out_file, align);
378 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
380 assemble_integer (const0_rtx, long_bytes, 1);
382 /* address of filename */
383 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
384 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
386 /* address of count table */
387 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
388 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
390 /* count of the # of basic blocks or # of instrumented arcs */
391 if (profile_block_flag)
392 assemble_integer (GEN_INT (count_basic_blocks), long_bytes, 1);
394 assemble_integer (GEN_INT (count_instrumented_arcs), long_bytes,
397 /* zero word (link field) */
398 assemble_integer (const0_rtx, pointer_bytes, 1);
400 /* address of basic block start address table */
401 if (profile_block_flag)
403 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
404 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
408 assemble_integer (const0_rtx, pointer_bytes, 1);
410 /* byte count for extended structure. */
411 assemble_integer (GEN_INT (11 * UNITS_PER_WORD), long_bytes, 1);
413 /* address of function name table */
414 if (profile_block_flag)
416 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
417 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
421 assemble_integer (const0_rtx, pointer_bytes, 1);
423 /* address of line number and filename tables if debugging. */
424 if (write_symbols != NO_DEBUG && profile_block_flag)
426 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
427 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
428 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
429 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
433 assemble_integer (const0_rtx, pointer_bytes, 1);
434 assemble_integer (const0_rtx, pointer_bytes, 1);
437 /* space for extension ptr (link field) */
438 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
440 /* Output the file name changing the suffix to .d for Sun tcov
442 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
444 char *cwd = getpwd ();
445 int len = strlen (filename) + strlen (cwd) + 1;
446 char *data_file = (char *) alloca (len + 4);
448 strcpy (data_file, cwd);
449 strcat (data_file, "/");
450 strcat (data_file, filename);
451 strip_off_ending (data_file, len);
452 if (profile_block_flag)
453 strcat (data_file, ".d");
455 strcat (data_file, ".da");
456 assemble_string (data_file, strlen (data_file) + 1);
459 /* Make space for the table of counts. */
462 /* Realign data section. */
463 ASM_OUTPUT_ALIGN (asm_out_file, align);
464 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
466 assemble_zeros (size);
470 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
471 #ifdef ASM_OUTPUT_SHARED_LOCAL
472 if (flag_shared_data)
473 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
476 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
477 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
480 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
481 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
484 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
489 /* Output any basic block strings */
490 if (profile_block_flag)
492 readonly_data_section ();
495 ASM_OUTPUT_ALIGN (asm_out_file, align);
496 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
498 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC",
500 assemble_string (sptr->string, sptr->length);
505 /* Output the table of addresses. */
506 if (profile_block_flag)
508 /* Realign in new section */
509 ASM_OUTPUT_ALIGN (asm_out_file, align);
510 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
511 for (i = 0; i < count_basic_blocks; i++)
513 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
514 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
519 /* Output the table of function names. */
520 if (profile_block_flag)
522 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
523 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
525 if (ptr->func_label_num >= 0)
527 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
528 ptr->func_label_num);
529 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
533 assemble_integer (const0_rtx, pointer_bytes, 1);
536 for ( ; i < count_basic_blocks; i++)
537 assemble_integer (const0_rtx, pointer_bytes, 1);
540 if (write_symbols != NO_DEBUG && profile_block_flag)
542 /* Output the table of line numbers. */
543 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
544 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
545 assemble_integer (GEN_INT (ptr->line_num), long_bytes, 1);
547 for ( ; i < count_basic_blocks; i++)
548 assemble_integer (const0_rtx, long_bytes, 1);
550 /* Output the table of file names. */
551 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
552 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
554 if (ptr->file_label_num >= 0)
556 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
557 ptr->file_label_num);
558 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
562 assemble_integer (const0_rtx, pointer_bytes, 1);
565 for ( ; i < count_basic_blocks; i++)
566 assemble_integer (const0_rtx, pointer_bytes, 1);
569 /* End with the address of the table of addresses,
570 so we can find it easily, as the last word in the file's text. */
571 if (profile_block_flag)
573 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
574 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
580 /* Enable APP processing of subsequent output.
581 Used before the output from an `asm' statement. */
588 fputs (ASM_APP_ON, asm_out_file);
593 /* Disable APP processing of subsequent output.
594 Called from varasm.c before most kinds of output. */
601 fputs (ASM_APP_OFF, asm_out_file);
606 /* Return the number of slots filled in the current
607 delayed branch sequence (we don't count the insn needing the
608 delay slot). Zero if not in a delayed branch sequence. */
612 dbr_sequence_length ()
614 if (final_sequence != 0)
615 return XVECLEN (final_sequence, 0) - 1;
621 /* The next two pages contain routines used to compute the length of an insn
622 and to shorten branches. */
624 /* Arrays for insn lengths, and addresses. The latter is referenced by
625 `insn_current_length'. */
627 static short *insn_lengths;
630 /* Max uid for which the above arrays are valid. */
631 static int insn_lengths_max_uid;
633 /* Address of insn being processed. Used by `insn_current_length'. */
634 int insn_current_address;
636 /* Address of insn being processed in previous iteration. */
637 int insn_last_address;
639 /* konwn invariant alignment of insn being processed. */
640 int insn_current_align;
642 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
643 gives the next following alignment insn that increases the known
644 alignment, or NULL_RTX if there is no such insn.
645 For any alignment obtained this way, we can again index uid_align with
646 its uid to obtain the next following align that in turn increases the
647 alignment, till we reach NULL_RTX; the sequence obtained this way
648 for each insn we'll call the alignment chain of this insn in the following
651 struct label_alignment {
656 static rtx *uid_align;
657 static int *uid_shuid;
658 static struct label_alignment *label_align;
660 /* Indicate that branch shortening hasn't yet been done. */
679 insn_lengths_max_uid = 0;
683 free (insn_addresses);
693 /* Obtain the current length of an insn. If branch shortening has been done,
694 get its actual length. Otherwise, get its maximum length. */
697 get_attr_length (insn)
700 #ifdef HAVE_ATTR_length
705 if (insn_lengths_max_uid > INSN_UID (insn))
706 return insn_lengths[INSN_UID (insn)];
708 switch (GET_CODE (insn))
716 length = insn_default_length (insn);
720 body = PATTERN (insn);
721 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
723 /* Alignment is machine-dependent and should be handled by
727 length = insn_default_length (insn);
731 body = PATTERN (insn);
732 if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
735 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
736 length = asm_insn_count (body) * insn_default_length (insn);
737 else if (GET_CODE (body) == SEQUENCE)
738 for (i = 0; i < XVECLEN (body, 0); i++)
739 length += get_attr_length (XVECEXP (body, 0, i));
741 length = insn_default_length (insn);
748 #ifdef ADJUST_INSN_LENGTH
749 ADJUST_INSN_LENGTH (insn, length);
752 #else /* not HAVE_ATTR_length */
754 #endif /* not HAVE_ATTR_length */
757 /* Code to handle alignment inside shorten_branches. */
759 /* Here is an explanation how the algorithm in align_fuzz can give
762 Call a sequence of instructions beginning with alignment point X
763 and continuing until the next alignment point `block X'. When `X'
764 is used in an expression, it means the alignment value of the
767 Call the distance between the start of the first insn of block X, and
768 the end of the last insn of block X `IX', for the `inner size of X'.
769 This is clearly the sum of the instruction lengths.
771 Likewise with the next alignment-delimited block following X, which we
774 Call the distance between the start of the first insn of block X, and
775 the start of the first insn of block Y `OX', for the `outer size of X'.
777 The estimated padding is then OX - IX.
779 OX can be safely estimated as
784 OX = round_up(IX, X) + Y - X
786 Clearly est(IX) >= real(IX), because that only depends on the
787 instruction lengths, and those being overestimated is a given.
789 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
790 we needn't worry about that when thinking about OX.
792 When X >= Y, the alignment provided by Y adds no uncertainty factor
793 for branch ranges starting before X, so we can just round what we have.
794 But when X < Y, we don't know anything about the, so to speak,
795 `middle bits', so we have to assume the worst when aligning up from an
796 address mod X to one mod Y, which is Y - X. */
799 #define LABEL_ALIGN(LABEL) 0
802 #ifndef LABEL_ALIGN_MAX_SKIP
803 #define LABEL_ALIGN_MAX_SKIP 0
807 #define LOOP_ALIGN(LABEL) 0
810 #ifndef LOOP_ALIGN_MAX_SKIP
811 #define LOOP_ALIGN_MAX_SKIP 0
814 #ifndef LABEL_ALIGN_AFTER_BARRIER
815 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
818 #ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
819 #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP 0
822 #ifndef ADDR_VEC_ALIGN
824 final_addr_vec_align (addr_vec)
827 int align = exact_log2 (GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec))));
829 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
830 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
834 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
837 #ifndef INSN_LENGTH_ALIGNMENT
838 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
841 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
843 static int min_labelno, max_labelno;
845 #define LABEL_TO_ALIGNMENT(LABEL) \
846 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
848 #define LABEL_TO_MAX_SKIP(LABEL) \
849 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
851 /* For the benefit of port specific code do this also as a function. */
853 label_to_alignment (label)
856 return LABEL_TO_ALIGNMENT (label);
859 #ifdef HAVE_ATTR_length
860 /* The differences in addresses
861 between a branch and its target might grow or shrink depending on
862 the alignment the start insn of the range (the branch for a forward
863 branch or the label for a backward branch) starts out on; if these
864 differences are used naively, they can even oscillate infinitely.
865 We therefore want to compute a 'worst case' address difference that
866 is independent of the alignment the start insn of the range end
867 up on, and that is at least as large as the actual difference.
868 The function align_fuzz calculates the amount we have to add to the
869 naively computed difference, by traversing the part of the alignment
870 chain of the start insn of the range that is in front of the end insn
871 of the range, and considering for each alignment the maximum amount
872 that it might contribute to a size increase.
874 For casesi tables, we also want to know worst case minimum amounts of
875 address difference, in case a machine description wants to introduce
876 some common offset that is added to all offsets in a table.
877 For this purpose, align_fuzz with a growth argument of 0 comuptes the
878 appropriate adjustment. */
881 /* Compute the maximum delta by which the difference of the addresses of
882 START and END might grow / shrink due to a different address for start
883 which changes the size of alignment insns between START and END.
884 KNOWN_ALIGN_LOG is the alignment known for START.
885 GROWTH should be ~0 if the objective is to compute potential code size
886 increase, and 0 if the objective is to compute potential shrink.
887 The return value is undefined for any other value of GROWTH. */
889 align_fuzz (start, end, known_align_log, growth)
894 int uid = INSN_UID (start);
896 int known_align = 1 << known_align_log;
897 int end_shuid = INSN_SHUID (end);
900 for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
902 int align_addr, new_align;
904 uid = INSN_UID (align_label);
905 align_addr = insn_addresses[uid] - insn_lengths[uid];
906 if (uid_shuid[uid] > end_shuid)
908 known_align_log = LABEL_TO_ALIGNMENT (align_label);
909 new_align = 1 << known_align_log;
910 if (new_align < known_align)
912 fuzz += (-align_addr ^ growth) & (new_align - known_align);
913 known_align = new_align;
918 /* Compute a worst-case reference address of a branch so that it
919 can be safely used in the presence of aligned labels. Since the
920 size of the branch itself is unknown, the size of the branch is
921 not included in the range. I.e. for a forward branch, the reference
922 address is the end address of the branch as known from the previous
923 branch shortening pass, minus a value to account for possible size
924 increase due to alignment. For a backward branch, it is the start
925 address of the branch as known from the current pass, plus a value
926 to account for possible size increase due to alignment.
927 NB.: Therefore, the maximum offset allowed for backward branches needs
928 to exclude the branch size. */
930 insn_current_reference_address (branch)
934 rtx seq = NEXT_INSN (PREV_INSN (branch));
935 int seq_uid = INSN_UID (seq);
936 if (GET_CODE (branch) != JUMP_INSN)
937 /* This can happen for example on the PA; the objective is to know the
938 offset to address something in front of the start of the function.
939 Thus, we can treat it like a backward branch.
940 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
941 any alignment we'd encounter, so we skip the call to align_fuzz. */
942 return insn_current_address;
943 dest = JUMP_LABEL (branch);
944 /* BRANCH has no proper alignment chain set, so use SEQ. */
945 if (INSN_SHUID (branch) < INSN_SHUID (dest))
947 /* Forward branch. */
948 return (insn_last_address + insn_lengths[seq_uid]
949 - align_fuzz (seq, dest, length_unit_log, ~0));
953 /* Backward branch. */
954 return (insn_current_address
955 + align_fuzz (dest, seq, length_unit_log, ~0));
958 #endif /* HAVE_ATTR_length */
960 /* Make a pass over all insns and compute their actual lengths by shortening
961 any branches of variable length if possible. */
963 /* Give a default value for the lowest address in a function. */
965 #ifndef FIRST_INSN_ADDRESS
966 #define FIRST_INSN_ADDRESS 0
969 /* shorten_branches might be called multiple times: for example, the SH
970 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
971 In order to do this, it needs proper length information, which it obtains
972 by calling shorten_branches. This cannot be collapsed with
973 shorten_branches itself into a single pass unless we also want to intergate
974 reorg.c, since the branch splitting exposes new instructions with delay
978 shorten_branches (first)
986 #ifdef HAVE_ATTR_length
987 #define MAX_CODE_ALIGN 16
989 int something_changed = 1;
990 char *varying_length;
993 rtx align_tab[MAX_CODE_ALIGN];
995 /* In order to make sure that all instructions have valid length info,
996 we must split them before we compute the address/length info. */
998 for (insn = NEXT_INSN (first); insn; insn = NEXT_INSN (insn))
999 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1002 /* Don't split the insn if it has been deleted. */
1003 if (! INSN_DELETED_P (old))
1004 insn = try_split (PATTERN (old), old, 1);
1005 /* When not optimizing, the old insn will be still left around
1006 with only the 'deleted' bit set. Transform it into a note
1007 to avoid confusion of subsequent processing. */
1008 if (INSN_DELETED_P (old))
1010 PUT_CODE (old , NOTE);
1011 NOTE_LINE_NUMBER (old) = NOTE_INSN_DELETED;
1012 NOTE_SOURCE_FILE (old) = 0;
1017 /* We must do some computations even when not actually shortening, in
1018 order to get the alignment information for the labels. */
1020 init_insn_lengths ();
1022 /* Compute maximum UID and allocate label_align / uid_shuid. */
1023 max_uid = get_max_uid ();
1025 max_labelno = max_label_num ();
1026 min_labelno = get_first_label_num ();
1027 label_align = (struct label_alignment *) xmalloc (
1028 (max_labelno - min_labelno + 1) * sizeof (struct label_alignment));
1029 bzero ((char *) label_align,
1030 (max_labelno - min_labelno + 1) * sizeof (struct label_alignment));
1032 uid_shuid = (int *) xmalloc (max_uid * sizeof *uid_shuid);
1034 /* Initialize label_align and set up uid_shuid to be strictly
1035 monotonically rising with insn order. */
1036 /* We use max_log here to keep track of the maximum alignment we want to
1037 impose on the next CODE_LABEL (or the current one if we are processing
1038 the CODE_LABEL itself). */
1043 for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
1047 INSN_SHUID (insn) = i++;
1048 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1050 /* reorg might make the first insn of a loop being run once only,
1051 and delete the label in front of it. Then we want to apply
1052 the loop alignment to the new label created by reorg, which
1053 is separated by the former loop start insn from the
1054 NOTE_INSN_LOOP_BEG. */
1056 else if (GET_CODE (insn) == CODE_LABEL)
1060 log = LABEL_ALIGN (insn);
1064 max_skip = LABEL_ALIGN_MAX_SKIP;
1066 next = NEXT_INSN (insn);
1067 /* ADDR_VECs only take room if read-only data goes into the text
1069 if (JUMP_TABLES_IN_TEXT_SECTION
1070 #if !defined(READONLY_DATA_SECTION)
1074 if (next && GET_CODE (next) == JUMP_INSN)
1076 rtx nextbody = PATTERN (next);
1077 if (GET_CODE (nextbody) == ADDR_VEC
1078 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1080 log = ADDR_VEC_ALIGN (next);
1084 max_skip = LABEL_ALIGN_MAX_SKIP;
1088 LABEL_TO_ALIGNMENT (insn) = max_log;
1089 LABEL_TO_MAX_SKIP (insn) = max_skip;
1093 else if (GET_CODE (insn) == BARRIER)
1097 for (label = insn; label && GET_RTX_CLASS (GET_CODE (label)) != 'i';
1098 label = NEXT_INSN (label))
1099 if (GET_CODE (label) == CODE_LABEL)
1101 log = LABEL_ALIGN_AFTER_BARRIER (insn);
1105 max_skip = LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP;
1110 /* Again, we allow NOTE_INSN_LOOP_BEG - INSN - CODE_LABEL
1111 sequences in order to handle reorg output efficiently. */
1112 else if (GET_CODE (insn) == NOTE
1113 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
1118 /* Search for the label that starts the loop.
1119 Don't skip past the end of the loop, since that could
1120 lead to putting an alignment where it does not belong.
1121 However, a label after a nested (non-)loop would be OK. */
1122 for (label = insn; label; label = NEXT_INSN (label))
1124 if (GET_CODE (label) == NOTE
1125 && NOTE_LINE_NUMBER (label) == NOTE_INSN_LOOP_BEG)
1127 else if (GET_CODE (label) == NOTE
1128 && NOTE_LINE_NUMBER (label) == NOTE_INSN_LOOP_END
1131 else if (GET_CODE (label) == CODE_LABEL)
1133 log = LOOP_ALIGN (insn);
1137 max_skip = LOOP_ALIGN_MAX_SKIP;
1146 #ifdef HAVE_ATTR_length
1148 /* Allocate the rest of the arrays. */
1149 insn_lengths = (short *) xmalloc (max_uid * sizeof (short));
1150 insn_addresses = (int *) xmalloc (max_uid * sizeof (int));
1151 insn_lengths_max_uid = max_uid;
1152 /* Syntax errors can lead to labels being outside of the main insn stream.
1153 Initialize insn_addresses, so that we get reproducible results. */
1154 bzero ((char *)insn_addresses, max_uid * sizeof *insn_addresses);
1155 uid_align = (rtx *) xmalloc (max_uid * sizeof *uid_align);
1157 varying_length = (char *) xmalloc (max_uid * sizeof (char));
1159 bzero (varying_length, max_uid);
1161 /* Initialize uid_align. We scan instructions
1162 from end to start, and keep in align_tab[n] the last seen insn
1163 that does an alignment of at least n+1, i.e. the successor
1164 in the alignment chain for an insn that does / has a known
1167 bzero ((char *) uid_align, max_uid * sizeof *uid_align);
1169 for (i = MAX_CODE_ALIGN; --i >= 0; )
1170 align_tab[i] = NULL_RTX;
1171 seq = get_last_insn ();
1172 for (; seq; seq = PREV_INSN (seq))
1174 int uid = INSN_UID (seq);
1176 log = (GET_CODE (seq) == CODE_LABEL ? LABEL_TO_ALIGNMENT (seq) : 0);
1177 uid_align[uid] = align_tab[0];
1180 /* Found an alignment label. */
1181 uid_align[uid] = align_tab[log];
1182 for (i = log - 1; i >= 0; i--)
1186 #ifdef CASE_VECTOR_SHORTEN_MODE
1189 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1192 int min_shuid = INSN_SHUID (get_insns ()) - 1;
1193 int max_shuid = INSN_SHUID (get_last_insn ()) + 1;
1196 for (insn = first; insn != 0; insn = NEXT_INSN (insn))
1198 rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat;
1199 int len, i, min, max, insn_shuid;
1201 addr_diff_vec_flags flags;
1203 if (GET_CODE (insn) != JUMP_INSN
1204 || GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)
1206 pat = PATTERN (insn);
1207 len = XVECLEN (pat, 1);
1210 min_align = MAX_CODE_ALIGN;
1211 for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
1213 rtx lab = XEXP (XVECEXP (pat, 1, i), 0);
1214 int shuid = INSN_SHUID (lab);
1225 if (min_align > LABEL_TO_ALIGNMENT (lab))
1226 min_align = LABEL_TO_ALIGNMENT (lab);
1228 XEXP (pat, 2) = gen_rtx_LABEL_REF (VOIDmode, min_lab);
1229 XEXP (pat, 3) = gen_rtx_LABEL_REF (VOIDmode, max_lab);
1230 insn_shuid = INSN_SHUID (insn);
1231 rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0));
1232 flags.min_align = min_align;
1233 flags.base_after_vec = rel > insn_shuid;
1234 flags.min_after_vec = min > insn_shuid;
1235 flags.max_after_vec = max > insn_shuid;
1236 flags.min_after_base = min > rel;
1237 flags.max_after_base = max > rel;
1238 ADDR_DIFF_VEC_FLAGS (pat) = flags;
1241 #endif /* CASE_VECTOR_SHORTEN_MODE */
1244 /* Compute initial lengths, addresses, and varying flags for each insn. */
1245 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1247 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1249 uid = INSN_UID (insn);
1251 insn_lengths[uid] = 0;
1253 if (GET_CODE (insn) == CODE_LABEL)
1255 int log = LABEL_TO_ALIGNMENT (insn);
1258 int align = 1 << log;
1259 int new_address = (insn_current_address + align - 1) & -align;
1260 insn_lengths[uid] = new_address - insn_current_address;
1261 insn_current_address = new_address;
1265 insn_addresses[uid] = insn_current_address;
1267 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
1268 || GET_CODE (insn) == CODE_LABEL)
1270 if (INSN_DELETED_P (insn))
1273 body = PATTERN (insn);
1274 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1276 /* This only takes room if read-only data goes into the text
1278 if (JUMP_TABLES_IN_TEXT_SECTION
1279 #if !defined(READONLY_DATA_SECTION)
1283 insn_lengths[uid] = (XVECLEN (body,
1284 GET_CODE (body) == ADDR_DIFF_VEC)
1285 * GET_MODE_SIZE (GET_MODE (body)));
1286 /* Alignment is handled by ADDR_VEC_ALIGN. */
1288 else if (asm_noperands (body) >= 0)
1289 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
1290 else if (GET_CODE (body) == SEQUENCE)
1293 int const_delay_slots;
1295 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
1297 const_delay_slots = 0;
1299 /* Inside a delay slot sequence, we do not do any branch shortening
1300 if the shortening could change the number of delay slots
1302 for (i = 0; i < XVECLEN (body, 0); i++)
1304 rtx inner_insn = XVECEXP (body, 0, i);
1305 int inner_uid = INSN_UID (inner_insn);
1308 if (asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
1309 inner_length = (asm_insn_count (PATTERN (inner_insn))
1310 * insn_default_length (inner_insn));
1312 inner_length = insn_default_length (inner_insn);
1314 insn_lengths[inner_uid] = inner_length;
1315 if (const_delay_slots)
1317 if ((varying_length[inner_uid]
1318 = insn_variable_length_p (inner_insn)) != 0)
1319 varying_length[uid] = 1;
1320 insn_addresses[inner_uid] = (insn_current_address +
1324 varying_length[inner_uid] = 0;
1325 insn_lengths[uid] += inner_length;
1328 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
1330 insn_lengths[uid] = insn_default_length (insn);
1331 varying_length[uid] = insn_variable_length_p (insn);
1334 /* If needed, do any adjustment. */
1335 #ifdef ADJUST_INSN_LENGTH
1336 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
1337 if (insn_lengths[uid] < 0)
1338 fatal_insn ("Negative insn length", insn);
1342 /* Now loop over all the insns finding varying length insns. For each,
1343 get the current insn length. If it has changed, reflect the change.
1344 When nothing changes for a full pass, we are done. */
1346 while (something_changed)
1348 something_changed = 0;
1349 insn_current_align = MAX_CODE_ALIGN - 1;
1350 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1352 insn = NEXT_INSN (insn))
1355 #ifdef ADJUST_INSN_LENGTH
1360 uid = INSN_UID (insn);
1362 if (GET_CODE (insn) == CODE_LABEL)
1364 int log = LABEL_TO_ALIGNMENT (insn);
1365 if (log > insn_current_align)
1367 int align = 1 << log;
1368 int new_address= (insn_current_address + align - 1) & -align;
1369 insn_lengths[uid] = new_address - insn_current_address;
1370 insn_current_align = log;
1371 insn_current_address = new_address;
1374 insn_lengths[uid] = 0;
1375 insn_addresses[uid] = insn_current_address;
1379 length_align = INSN_LENGTH_ALIGNMENT (insn);
1380 if (length_align < insn_current_align)
1381 insn_current_align = length_align;
1383 insn_last_address = insn_addresses[uid];
1384 insn_addresses[uid] = insn_current_address;
1386 #ifdef CASE_VECTOR_SHORTEN_MODE
1387 if (optimize && GET_CODE (insn) == JUMP_INSN
1388 && GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
1390 rtx body = PATTERN (insn);
1391 int old_length = insn_lengths[uid];
1392 rtx rel_lab = XEXP (XEXP (body, 0), 0);
1393 rtx min_lab = XEXP (XEXP (body, 2), 0);
1394 rtx max_lab = XEXP (XEXP (body, 3), 0);
1395 addr_diff_vec_flags flags = ADDR_DIFF_VEC_FLAGS (body);
1396 int rel_addr = insn_addresses[INSN_UID (rel_lab)];
1397 int min_addr = insn_addresses[INSN_UID (min_lab)];
1398 int max_addr = insn_addresses[INSN_UID (max_lab)];
1402 /* Try to find a known alignment for rel_lab. */
1403 for (prev = rel_lab;
1405 && ! insn_lengths[INSN_UID (prev)]
1406 && ! (varying_length[INSN_UID (prev)] & 1);
1407 prev = PREV_INSN (prev))
1408 if (varying_length[INSN_UID (prev)] & 2)
1410 rel_align = LABEL_TO_ALIGNMENT (prev);
1414 /* See the comment on addr_diff_vec_flags in rtl.h for the
1415 meaning of the flags values. base: REL_LAB vec: INSN */
1416 /* Anything after INSN has still addresses from the last
1417 pass; adjust these so that they reflect our current
1418 estimate for this pass. */
1419 if (flags.base_after_vec)
1420 rel_addr += insn_current_address - insn_last_address;
1421 if (flags.min_after_vec)
1422 min_addr += insn_current_address - insn_last_address;
1423 if (flags.max_after_vec)
1424 max_addr += insn_current_address - insn_last_address;
1425 /* We want to know the worst case, i.e. lowest possible value
1426 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1427 its offset is positive, and we have to be wary of code shrink;
1428 otherwise, it is negative, and we have to be vary of code
1430 if (flags.min_after_base)
1432 /* If INSN is between REL_LAB and MIN_LAB, the size
1433 changes we are about to make can change the alignment
1434 within the observed offset, therefore we have to break
1435 it up into two parts that are independent. */
1436 if (! flags.base_after_vec && flags.min_after_vec)
1438 min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
1439 min_addr -= align_fuzz (insn, min_lab, 0, 0);
1442 min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
1446 if (flags.base_after_vec && ! flags.min_after_vec)
1448 min_addr -= align_fuzz (min_lab, insn, 0, ~0);
1449 min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
1452 min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
1454 /* Likewise, determine the highest lowest possible value
1455 for the offset of MAX_LAB. */
1456 if (flags.max_after_base)
1458 if (! flags.base_after_vec && flags.max_after_vec)
1460 max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
1461 max_addr += align_fuzz (insn, max_lab, 0, ~0);
1464 max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
1468 if (flags.base_after_vec && ! flags.max_after_vec)
1470 max_addr += align_fuzz (max_lab, insn, 0, 0);
1471 max_addr += align_fuzz (insn, rel_lab, 0, 0);
1474 max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
1476 PUT_MODE (body, CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
1477 max_addr - rel_addr,
1479 if (JUMP_TABLES_IN_TEXT_SECTION
1480 #if !defined(READONLY_DATA_SECTION)
1486 = (XVECLEN (body, 1) * GET_MODE_SIZE (GET_MODE (body)));
1487 insn_current_address += insn_lengths[uid];
1488 if (insn_lengths[uid] != old_length)
1489 something_changed = 1;
1494 #endif /* CASE_VECTOR_SHORTEN_MODE */
1496 if (! (varying_length[uid]))
1498 insn_current_address += insn_lengths[uid];
1501 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
1505 body = PATTERN (insn);
1507 for (i = 0; i < XVECLEN (body, 0); i++)
1509 rtx inner_insn = XVECEXP (body, 0, i);
1510 int inner_uid = INSN_UID (inner_insn);
1513 insn_addresses[inner_uid] = insn_current_address;
1515 /* insn_current_length returns 0 for insns with a
1516 non-varying length. */
1517 if (! varying_length[inner_uid])
1518 inner_length = insn_lengths[inner_uid];
1520 inner_length = insn_current_length (inner_insn);
1522 if (inner_length != insn_lengths[inner_uid])
1524 insn_lengths[inner_uid] = inner_length;
1525 something_changed = 1;
1527 insn_current_address += insn_lengths[inner_uid];
1528 new_length += inner_length;
1533 new_length = insn_current_length (insn);
1534 insn_current_address += new_length;
1537 #ifdef ADJUST_INSN_LENGTH
1538 /* If needed, do any adjustment. */
1539 tmp_length = new_length;
1540 ADJUST_INSN_LENGTH (insn, new_length);
1541 insn_current_address += (new_length - tmp_length);
1544 if (new_length != insn_lengths[uid])
1546 insn_lengths[uid] = new_length;
1547 something_changed = 1;
1550 /* For a non-optimizing compile, do only a single pass. */
1555 free (varying_length);
1557 #endif /* HAVE_ATTR_length */
1560 #ifdef HAVE_ATTR_length
1561 /* Given the body of an INSN known to be generated by an ASM statement, return
1562 the number of machine instructions likely to be generated for this insn.
1563 This is used to compute its length. */
1566 asm_insn_count (body)
1572 if (GET_CODE (body) == ASM_INPUT)
1573 template = XSTR (body, 0);
1575 template = decode_asm_operands (body, NULL_PTR, NULL_PTR,
1576 NULL_PTR, NULL_PTR);
1578 for ( ; *template; template++)
1579 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
1586 /* Output assembler code for the start of a function,
1587 and initialize some of the variables in this file
1588 for the new function. The label for the function and associated
1589 assembler pseudo-ops have already been output in `assemble_start_function'.
1591 FIRST is the first insn of the rtl for the function being compiled.
1592 FILE is the file to write assembler code to.
1593 OPTIMIZE is nonzero if we should eliminate redundant
1594 test and compare insns. */
1597 final_start_function (first, file, optimize)
1604 this_is_asm_operands = 0;
1606 #ifdef NON_SAVING_SETJMP
1607 /* A function that calls setjmp should save and restore all the
1608 call-saved registers on a system where longjmp clobbers them. */
1609 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
1613 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1614 if (!call_used_regs[i])
1615 regs_ever_live[i] = 1;
1619 /* Initial line number is supposed to be output
1620 before the function's prologue and label
1621 so that the function's address will not appear to be
1622 in the last statement of the preceding function. */
1623 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1624 last_linenum = high_block_linenum = high_function_linenum
1625 = NOTE_LINE_NUMBER (first);
1627 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1628 /* Output DWARF definition of the function. */
1629 if (dwarf2out_do_frame ())
1630 dwarf2out_begin_prologue ();
1633 /* For SDB and XCOFF, the function beginning must be marked between
1634 the function label and the prologue. We always need this, even when
1635 -g1 was used. Defer on MIPS systems so that parameter descriptions
1636 follow function entry. */
1637 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
1638 if (write_symbols == SDB_DEBUG)
1639 sdbout_begin_function (last_linenum);
1642 #ifdef XCOFF_DEBUGGING_INFO
1643 if (write_symbols == XCOFF_DEBUG)
1644 xcoffout_begin_function (file, last_linenum);
1647 /* But only output line number for other debug info types if -g2
1649 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1650 output_source_line (file, first);
1652 #ifdef LEAF_REG_REMAP
1653 if (current_function_uses_only_leaf_regs)
1654 leaf_renumber_regs (first);
1657 /* The Sun386i and perhaps other machines don't work right
1658 if the profiling code comes after the prologue. */
1659 #ifdef PROFILE_BEFORE_PROLOGUE
1661 profile_function (file);
1662 #endif /* PROFILE_BEFORE_PROLOGUE */
1664 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1665 if (dwarf2out_do_frame ())
1666 dwarf2out_frame_debug (NULL_RTX);
1669 #ifdef FUNCTION_PROLOGUE
1670 /* First output the function prologue: code to set up the stack frame. */
1671 FUNCTION_PROLOGUE (file, get_frame_size ());
1674 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1675 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
1676 next_block_index = 1;
1679 /* If the machine represents the prologue as RTL, the profiling code must
1680 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1681 #ifdef HAVE_prologue
1682 if (! HAVE_prologue)
1684 profile_after_prologue (file);
1688 /* If we are doing basic block profiling, remember a printable version
1689 of the function name. */
1690 if (profile_block_flag)
1693 = add_bb_string ((*decl_printable_name) (current_function_decl, 2), FALSE);
1698 profile_after_prologue (file)
1701 #ifdef FUNCTION_BLOCK_PROFILER
1702 if (profile_block_flag)
1704 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
1706 #endif /* FUNCTION_BLOCK_PROFILER */
1708 #ifndef PROFILE_BEFORE_PROLOGUE
1710 profile_function (file);
1711 #endif /* not PROFILE_BEFORE_PROLOGUE */
1715 profile_function (file)
1718 int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1719 #if defined(ASM_OUTPUT_REG_PUSH)
1720 #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1721 int sval = current_function_returns_struct;
1723 #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1724 int cxt = current_function_needs_context;
1726 #endif /* ASM_OUTPUT_REG_PUSH */
1729 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1730 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
1731 assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, 1);
1733 function_section (current_function_decl);
1735 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1737 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
1739 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1742 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1747 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1749 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1751 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1754 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1759 FUNCTION_PROFILER (file, profile_label_no);
1761 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1763 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1765 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1768 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1773 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1775 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1777 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1780 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1786 /* Output assembler code for the end of a function.
1787 For clarity, args are same as those of `final_start_function'
1788 even though not all of them are needed. */
1791 final_end_function (first, file, optimize)
1798 fputs (ASM_APP_OFF, file);
1802 #ifdef SDB_DEBUGGING_INFO
1803 if (write_symbols == SDB_DEBUG)
1804 sdbout_end_function (high_function_linenum);
1807 #ifdef DWARF_DEBUGGING_INFO
1808 if (write_symbols == DWARF_DEBUG)
1809 dwarfout_end_function ();
1812 #ifdef XCOFF_DEBUGGING_INFO
1813 if (write_symbols == XCOFF_DEBUG)
1814 xcoffout_end_function (file, high_function_linenum);
1817 #ifdef FUNCTION_EPILOGUE
1818 /* Finally, output the function epilogue:
1819 code to restore the stack frame and return to the caller. */
1820 FUNCTION_EPILOGUE (file, get_frame_size ());
1823 #ifdef SDB_DEBUGGING_INFO
1824 if (write_symbols == SDB_DEBUG)
1825 sdbout_end_epilogue ();
1828 #ifdef DWARF_DEBUGGING_INFO
1829 if (write_symbols == DWARF_DEBUG)
1830 dwarfout_end_epilogue ();
1833 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1834 if (dwarf2out_do_frame ())
1835 dwarf2out_end_epilogue ();
1838 #ifdef XCOFF_DEBUGGING_INFO
1839 if (write_symbols == XCOFF_DEBUG)
1840 xcoffout_end_epilogue (file);
1843 bb_func_label_num = -1; /* not in function, nuke label # */
1845 /* If FUNCTION_EPILOGUE is not defined, then the function body
1846 itself contains return instructions wherever needed. */
1849 /* Add a block to the linked list that remembers the current line/file/function
1850 for basic block profiling. Emit the label in front of the basic block and
1851 the instructions that increment the count field. */
1857 struct bb_list *ptr = (struct bb_list *) permalloc (sizeof (struct bb_list));
1859 /* Add basic block to linked list. */
1861 ptr->line_num = last_linenum;
1862 ptr->file_label_num = bb_file_label_num;
1863 ptr->func_label_num = bb_func_label_num;
1865 bb_tail = &ptr->next;
1867 /* Enable the table of basic-block use counts
1868 to point at the code it applies to. */
1869 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1871 /* Before first insn of this basic block, increment the
1872 count of times it was entered. */
1873 #ifdef BLOCK_PROFILER
1874 BLOCK_PROFILER (file, count_basic_blocks);
1881 count_basic_blocks++;
1884 /* Add a string to be used for basic block profiling. */
1887 add_bb_string (string, perm_p)
1892 struct bb_str *ptr = 0;
1896 string = "<unknown>";
1900 /* Allocate a new string if the current string isn't permanent. If
1901 the string is permanent search for the same string in other
1904 len = strlen (string) + 1;
1907 char *p = (char *) permalloc (len);
1908 bcopy (string, p, len);
1912 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1913 if (ptr->string == string)
1916 /* Allocate a new string block if we need to. */
1919 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1922 ptr->label_num = sbb_label_num++;
1923 ptr->string = string;
1925 sbb_tail = &ptr->next;
1928 return ptr->label_num;
1932 /* Output assembler code for some insns: all or part of a function.
1933 For description of args, see `final_start_function', above.
1935 PRESCAN is 1 if we are not really outputting,
1936 just scanning as if we were outputting.
1937 Prescanning deletes and rearranges insns just like ordinary output.
1938 PRESCAN is -2 if we are outputting after having prescanned.
1939 In this case, don't try to delete or rearrange insns
1940 because that has already been done.
1941 Prescanning is done only on certain machines. */
1944 final (first, file, optimize, prescan)
1954 last_ignored_compare = 0;
1957 check_exception_handler_labels ();
1959 /* Make a map indicating which line numbers appear in this function.
1960 When producing SDB debugging info, delete troublesome line number
1961 notes from inlined functions in other files as well as duplicate
1962 line number notes. */
1963 #ifdef SDB_DEBUGGING_INFO
1964 if (write_symbols == SDB_DEBUG)
1967 for (insn = first; insn; insn = NEXT_INSN (insn))
1968 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1970 if ((RTX_INTEGRATED_P (insn)
1971 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1973 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1974 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1976 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1977 NOTE_SOURCE_FILE (insn) = 0;
1981 if (NOTE_LINE_NUMBER (insn) > max_line)
1982 max_line = NOTE_LINE_NUMBER (insn);
1988 for (insn = first; insn; insn = NEXT_INSN (insn))
1989 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1990 max_line = NOTE_LINE_NUMBER (insn);
1993 line_note_exists = (char *) oballoc (max_line + 1);
1994 bzero (line_note_exists, max_line + 1);
1996 for (insn = first; insn; insn = NEXT_INSN (insn))
1998 if (INSN_UID (insn) > max_uid) /* find largest UID */
1999 max_uid = INSN_UID (insn);
2000 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
2001 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
2003 /* If CC tracking across branches is enabled, record the insn which
2004 jumps to each branch only reached from one place. */
2005 if (optimize && GET_CODE (insn) == JUMP_INSN)
2007 rtx lab = JUMP_LABEL (insn);
2008 if (lab && LABEL_NUSES (lab) == 1)
2010 LABEL_REFS (lab) = insn;
2016 /* Initialize insn_eh_region table if eh is being used. */
2018 init_insn_eh_region (first, max_uid);
2024 /* Output the insns. */
2025 for (insn = NEXT_INSN (first); insn;)
2027 #ifdef HAVE_ATTR_length
2028 insn_current_address = insn_addresses[INSN_UID (insn)];
2030 insn = final_scan_insn (insn, file, optimize, prescan, 0);
2033 /* Do basic-block profiling here
2034 if the last insn was a conditional branch. */
2035 if (profile_block_flag && new_block)
2038 free_insn_eh_region ();
2041 /* The final scan for one insn, INSN.
2042 Args are same as in `final', except that INSN
2043 is the insn being scanned.
2044 Value returned is the next insn to be scanned.
2046 NOPEEPHOLES is the flag to disallow peephole processing (currently
2047 used for within delayed branch sequence output). */
2050 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
2063 /* Ignore deleted insns. These can occur when we split insns (due to a
2064 template of "#") while not optimizing. */
2065 if (INSN_DELETED_P (insn))
2066 return NEXT_INSN (insn);
2068 switch (GET_CODE (insn))
2074 /* Align the beginning of a loop, for higher speed
2075 on certain machines. */
2077 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
2078 break; /* This used to depend on optimize, but that was bogus. */
2079 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END)
2082 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG
2083 && ! exceptions_via_longjmp)
2085 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHB", NOTE_BLOCK_NUMBER (insn));
2086 if (! flag_new_exceptions)
2087 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn));
2088 #ifdef ASM_OUTPUT_EH_REGION_BEG
2089 ASM_OUTPUT_EH_REGION_BEG (file, NOTE_BLOCK_NUMBER (insn));
2094 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END
2095 && ! exceptions_via_longjmp)
2097 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHE", NOTE_BLOCK_NUMBER (insn));
2098 if (flag_new_exceptions)
2099 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn));
2100 #ifdef ASM_OUTPUT_EH_REGION_END
2101 ASM_OUTPUT_EH_REGION_END (file, NOTE_BLOCK_NUMBER (insn));
2106 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
2108 #ifdef FUNCTION_END_PROLOGUE
2109 FUNCTION_END_PROLOGUE (file);
2111 profile_after_prologue (file);
2115 #ifdef FUNCTION_BEGIN_EPILOGUE
2116 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
2118 FUNCTION_BEGIN_EPILOGUE (file);
2123 if (write_symbols == NO_DEBUG)
2125 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
2127 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
2128 /* MIPS stabs require the parameter descriptions to be after the
2129 function entry point rather than before. */
2130 if (write_symbols == SDB_DEBUG)
2131 sdbout_begin_function (last_linenum);
2134 #ifdef DWARF_DEBUGGING_INFO
2135 /* This outputs a marker where the function body starts, so it
2136 must be after the prologue. */
2137 if (write_symbols == DWARF_DEBUG)
2138 dwarfout_begin_function ();
2142 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED)
2143 break; /* An insn that was "deleted" */
2146 fputs (ASM_APP_OFF, file);
2149 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG
2150 && (debug_info_level == DINFO_LEVEL_NORMAL
2151 || debug_info_level == DINFO_LEVEL_VERBOSE
2152 || write_symbols == DWARF_DEBUG
2153 || write_symbols == DWARF2_DEBUG))
2155 /* Beginning of a symbol-block. Assign it a sequence number
2156 and push the number onto the stack PENDING_BLOCKS. */
2158 if (block_depth == max_block_depth)
2160 /* PENDING_BLOCKS is full; make it longer. */
2161 max_block_depth *= 2;
2163 = (int *) xrealloc (pending_blocks,
2164 max_block_depth * sizeof (int));
2166 pending_blocks[block_depth++] = next_block_index;
2168 high_block_linenum = last_linenum;
2170 /* Output debugging info about the symbol-block beginning. */
2172 #ifdef SDB_DEBUGGING_INFO
2173 if (write_symbols == SDB_DEBUG)
2174 sdbout_begin_block (file, last_linenum, next_block_index);
2176 #ifdef XCOFF_DEBUGGING_INFO
2177 if (write_symbols == XCOFF_DEBUG)
2178 xcoffout_begin_block (file, last_linenum, next_block_index);
2180 #ifdef DBX_DEBUGGING_INFO
2181 if (write_symbols == DBX_DEBUG)
2182 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", next_block_index);
2184 #ifdef DWARF_DEBUGGING_INFO
2185 if (write_symbols == DWARF_DEBUG)
2186 dwarfout_begin_block (next_block_index);
2188 #ifdef DWARF2_DEBUGGING_INFO
2189 if (write_symbols == DWARF2_DEBUG)
2190 dwarf2out_begin_block (next_block_index);
2195 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END
2196 && (debug_info_level == DINFO_LEVEL_NORMAL
2197 || debug_info_level == DINFO_LEVEL_VERBOSE
2198 || write_symbols == DWARF_DEBUG
2199 || write_symbols == DWARF2_DEBUG))
2201 /* End of a symbol-block. Pop its sequence number off
2202 PENDING_BLOCKS and output debugging info based on that. */
2205 if (block_depth < 0)
2208 #ifdef XCOFF_DEBUGGING_INFO
2209 if (write_symbols == XCOFF_DEBUG)
2210 xcoffout_end_block (file, high_block_linenum,
2211 pending_blocks[block_depth]);
2213 #ifdef DBX_DEBUGGING_INFO
2214 if (write_symbols == DBX_DEBUG)
2215 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE",
2216 pending_blocks[block_depth]);
2218 #ifdef SDB_DEBUGGING_INFO
2219 if (write_symbols == SDB_DEBUG)
2220 sdbout_end_block (file, high_block_linenum,
2221 pending_blocks[block_depth]);
2223 #ifdef DWARF_DEBUGGING_INFO
2224 if (write_symbols == DWARF_DEBUG)
2225 dwarfout_end_block (pending_blocks[block_depth]);
2227 #ifdef DWARF2_DEBUGGING_INFO
2228 if (write_symbols == DWARF2_DEBUG)
2229 dwarf2out_end_block (pending_blocks[block_depth]);
2232 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL
2233 && (debug_info_level == DINFO_LEVEL_NORMAL
2234 || debug_info_level == DINFO_LEVEL_VERBOSE))
2236 #ifdef DWARF_DEBUGGING_INFO
2237 if (write_symbols == DWARF_DEBUG)
2238 dwarfout_label (insn);
2240 #ifdef DWARF2_DEBUGGING_INFO
2241 if (write_symbols == DWARF2_DEBUG)
2242 dwarf2out_label (insn);
2245 else if (NOTE_LINE_NUMBER (insn) > 0)
2246 /* This note is a line-number. */
2250 #if 0 /* This is what we used to do. */
2251 output_source_line (file, insn);
2255 /* If there is anything real after this note,
2256 output it. If another line note follows, omit this one. */
2257 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
2259 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
2261 /* These types of notes can be significant
2262 so make sure the preceding line number stays. */
2263 else if (GET_CODE (note) == NOTE
2264 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
2265 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
2266 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
2268 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
2270 /* Another line note follows; we can delete this note
2271 if no intervening line numbers have notes elsewhere. */
2273 for (num = NOTE_LINE_NUMBER (insn) + 1;
2274 num < NOTE_LINE_NUMBER (note);
2276 if (line_note_exists[num])
2279 if (num >= NOTE_LINE_NUMBER (note))
2285 /* Output this line note
2286 if it is the first or the last line note in a row. */
2288 output_source_line (file, insn);
2293 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2294 /* If we push arguments, we need to check all insns for stack
2296 if (dwarf2out_do_frame ())
2297 dwarf2out_frame_debug (insn);
2302 /* The target port might emit labels in the output function for
2303 some insn, e.g. sh.c output_branchy_insn. */
2304 if (CODE_LABEL_NUMBER (insn) <= max_labelno)
2306 int align = LABEL_TO_ALIGNMENT (insn);
2307 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2308 int max_skip = LABEL_TO_MAX_SKIP (insn);
2311 if (align && NEXT_INSN (insn))
2312 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2313 ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip);
2315 ASM_OUTPUT_ALIGN (file, align);
2320 /* If this label is reached from only one place, set the condition
2321 codes from the instruction just before the branch. */
2323 /* Disabled because some insns set cc_status in the C output code
2324 and NOTICE_UPDATE_CC alone can set incorrect status. */
2325 if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
2327 rtx jump = LABEL_REFS (insn);
2328 rtx barrier = prev_nonnote_insn (insn);
2330 /* If the LABEL_REFS field of this label has been set to point
2331 at a branch, the predecessor of the branch is a regular
2332 insn, and that branch is the only way to reach this label,
2333 set the condition codes based on the branch and its
2335 if (barrier && GET_CODE (barrier) == BARRIER
2336 && jump && GET_CODE (jump) == JUMP_INSN
2337 && (prev = prev_nonnote_insn (jump))
2338 && GET_CODE (prev) == INSN)
2340 NOTICE_UPDATE_CC (PATTERN (prev), prev);
2341 NOTICE_UPDATE_CC (PATTERN (jump), jump);
2349 #ifdef FINAL_PRESCAN_LABEL
2350 FINAL_PRESCAN_INSN (insn, NULL_PTR, 0);
2353 #ifdef SDB_DEBUGGING_INFO
2354 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
2355 sdbout_label (insn);
2357 #ifdef DWARF_DEBUGGING_INFO
2358 if (write_symbols == DWARF_DEBUG && LABEL_NAME (insn))
2359 dwarfout_label (insn);
2361 #ifdef DWARF2_DEBUGGING_INFO
2362 if (write_symbols == DWARF2_DEBUG && LABEL_NAME (insn))
2363 dwarf2out_label (insn);
2367 fputs (ASM_APP_OFF, file);
2370 if (NEXT_INSN (insn) != 0
2371 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
2373 rtx nextbody = PATTERN (NEXT_INSN (insn));
2375 /* If this label is followed by a jump-table,
2376 make sure we put the label in the read-only section. Also
2377 possibly write the label and jump table together. */
2379 if (GET_CODE (nextbody) == ADDR_VEC
2380 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
2382 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2383 /* In this case, the case vector is being moved by the
2384 target, so don't output the label at all. Leave that
2385 to the back end macros. */
2387 if (! JUMP_TABLES_IN_TEXT_SECTION)
2389 readonly_data_section ();
2390 #ifdef READONLY_DATA_SECTION
2391 ASM_OUTPUT_ALIGN (file,
2392 exact_log2 (BIGGEST_ALIGNMENT
2394 #endif /* READONLY_DATA_SECTION */
2397 function_section (current_function_decl);
2399 #ifdef ASM_OUTPUT_CASE_LABEL
2400 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
2403 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2410 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2415 register rtx body = PATTERN (insn);
2416 int insn_code_number;
2417 const char *template;
2422 /* An INSN, JUMP_INSN or CALL_INSN.
2423 First check for special kinds that recog doesn't recognize. */
2425 if (GET_CODE (body) == USE /* These are just declarations */
2426 || GET_CODE (body) == CLOBBER)
2430 /* If there is a REG_CC_SETTER note on this insn, it means that
2431 the setting of the condition code was done in the delay slot
2432 of the insn that branched here. So recover the cc status
2433 from the insn that set it. */
2435 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
2438 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
2439 cc_prev_status = cc_status;
2443 /* Detect insns that are really jump-tables
2444 and output them as such. */
2446 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
2448 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2449 register int vlen, idx;
2457 fputs (ASM_APP_OFF, file);
2461 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2462 if (GET_CODE (body) == ADDR_VEC)
2464 #ifdef ASM_OUTPUT_ADDR_VEC
2465 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2472 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2473 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2479 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
2480 for (idx = 0; idx < vlen; idx++)
2482 if (GET_CODE (body) == ADDR_VEC)
2484 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2485 ASM_OUTPUT_ADDR_VEC_ELT
2486 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
2493 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2494 ASM_OUTPUT_ADDR_DIFF_ELT
2497 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
2498 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
2504 #ifdef ASM_OUTPUT_CASE_END
2505 ASM_OUTPUT_CASE_END (file,
2506 CODE_LABEL_NUMBER (PREV_INSN (insn)),
2511 function_section (current_function_decl);
2516 /* Do basic-block profiling when we reach a new block.
2517 Done here to avoid jump tables. */
2518 if (profile_block_flag && new_block)
2521 if (GET_CODE (body) == ASM_INPUT)
2523 /* There's no telling what that did to the condition codes. */
2529 fputs (ASM_APP_ON, file);
2532 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
2536 /* Detect `asm' construct with operands. */
2537 if (asm_noperands (body) >= 0)
2539 unsigned int noperands = asm_noperands (body);
2540 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
2543 /* There's no telling what that did to the condition codes. */
2550 fputs (ASM_APP_ON, file);
2554 /* Get out the operand values. */
2555 string = decode_asm_operands (body, ops, NULL_PTR,
2556 NULL_PTR, NULL_PTR);
2557 /* Inhibit aborts on what would otherwise be compiler bugs. */
2558 insn_noperands = noperands;
2559 this_is_asm_operands = insn;
2561 /* Output the insn using them. */
2562 output_asm_insn (string, ops);
2563 this_is_asm_operands = 0;
2567 if (prescan <= 0 && app_on)
2569 fputs (ASM_APP_OFF, file);
2573 if (GET_CODE (body) == SEQUENCE)
2575 /* A delayed-branch sequence */
2581 final_sequence = body;
2583 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2584 force the restoration of a comparison that was previously
2585 thought unnecessary. If that happens, cancel this sequence
2586 and cause that insn to be restored. */
2588 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
2589 if (next != XVECEXP (body, 0, 1))
2595 for (i = 1; i < XVECLEN (body, 0); i++)
2597 rtx insn = XVECEXP (body, 0, i);
2598 rtx next = NEXT_INSN (insn);
2599 /* We loop in case any instruction in a delay slot gets
2602 insn = final_scan_insn (insn, file, 0, prescan, 1);
2603 while (insn != next);
2605 #ifdef DBR_OUTPUT_SEQEND
2606 DBR_OUTPUT_SEQEND (file);
2610 /* If the insn requiring the delay slot was a CALL_INSN, the
2611 insns in the delay slot are actually executed before the
2612 called function. Hence we don't preserve any CC-setting
2613 actions in these insns and the CC must be marked as being
2614 clobbered by the function. */
2615 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
2620 /* Following a conditional branch sequence, we have a new basic
2622 if (profile_block_flag)
2624 rtx insn = XVECEXP (body, 0, 0);
2625 rtx body = PATTERN (insn);
2627 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2628 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2629 || (GET_CODE (insn) == JUMP_INSN
2630 && GET_CODE (body) == PARALLEL
2631 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2632 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
2638 /* We have a real machine instruction as rtl. */
2640 body = PATTERN (insn);
2643 set = single_set(insn);
2645 /* Check for redundant test and compare instructions
2646 (when the condition codes are already set up as desired).
2647 This is done only when optimizing; if not optimizing,
2648 it should be possible for the user to alter a variable
2649 with the debugger in between statements
2650 and the next statement should reexamine the variable
2651 to compute the condition codes. */
2656 rtx set = single_set(insn);
2660 && GET_CODE (SET_DEST (set)) == CC0
2661 && insn != last_ignored_compare)
2663 if (GET_CODE (SET_SRC (set)) == SUBREG)
2664 SET_SRC (set) = alter_subreg (SET_SRC (set));
2665 else if (GET_CODE (SET_SRC (set)) == COMPARE)
2667 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
2668 XEXP (SET_SRC (set), 0)
2669 = alter_subreg (XEXP (SET_SRC (set), 0));
2670 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
2671 XEXP (SET_SRC (set), 1)
2672 = alter_subreg (XEXP (SET_SRC (set), 1));
2674 if ((cc_status.value1 != 0
2675 && rtx_equal_p (SET_SRC (set), cc_status.value1))
2676 || (cc_status.value2 != 0
2677 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
2679 /* Don't delete insn if it has an addressing side-effect. */
2680 if (! FIND_REG_INC_NOTE (insn, 0)
2681 /* or if anything in it is volatile. */
2682 && ! volatile_refs_p (PATTERN (insn)))
2684 /* We don't really delete the insn; just ignore it. */
2685 last_ignored_compare = insn;
2693 /* Following a conditional branch, we have a new basic block.
2694 But if we are inside a sequence, the new block starts after the
2695 last insn of the sequence. */
2696 if (profile_block_flag && final_sequence == 0
2697 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2698 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2699 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
2700 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2701 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
2705 /* Don't bother outputting obvious no-ops, even without -O.
2706 This optimization is fast and doesn't interfere with debugging.
2707 Don't do this if the insn is in a delay slot, since this
2708 will cause an improper number of delay insns to be written. */
2709 if (final_sequence == 0
2711 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
2712 && GET_CODE (SET_SRC (body)) == REG
2713 && GET_CODE (SET_DEST (body)) == REG
2714 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
2719 /* If this is a conditional branch, maybe modify it
2720 if the cc's are in a nonstandard state
2721 so that it accomplishes the same thing that it would
2722 do straightforwardly if the cc's were set up normally. */
2724 if (cc_status.flags != 0
2725 && GET_CODE (insn) == JUMP_INSN
2726 && GET_CODE (body) == SET
2727 && SET_DEST (body) == pc_rtx
2728 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
2729 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
2730 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
2731 /* This is done during prescan; it is not done again
2732 in final scan when prescan has been done. */
2735 /* This function may alter the contents of its argument
2736 and clear some of the cc_status.flags bits.
2737 It may also return 1 meaning condition now always true
2738 or -1 meaning condition now always false
2739 or 2 meaning condition nontrivial but altered. */
2740 register int result = alter_cond (XEXP (SET_SRC (body), 0));
2741 /* If condition now has fixed value, replace the IF_THEN_ELSE
2742 with its then-operand or its else-operand. */
2744 SET_SRC (body) = XEXP (SET_SRC (body), 1);
2746 SET_SRC (body) = XEXP (SET_SRC (body), 2);
2748 /* The jump is now either unconditional or a no-op.
2749 If it has become a no-op, don't try to output it.
2750 (It would not be recognized.) */
2751 if (SET_SRC (body) == pc_rtx)
2753 PUT_CODE (insn, NOTE);
2754 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2755 NOTE_SOURCE_FILE (insn) = 0;
2758 else if (GET_CODE (SET_SRC (body)) == RETURN)
2759 /* Replace (set (pc) (return)) with (return). */
2760 PATTERN (insn) = body = SET_SRC (body);
2762 /* Rerecognize the instruction if it has changed. */
2764 INSN_CODE (insn) = -1;
2767 /* Make same adjustments to instructions that examine the
2768 condition codes without jumping and instructions that
2769 handle conditional moves (if this machine has either one). */
2771 if (cc_status.flags != 0
2774 rtx cond_rtx, then_rtx, else_rtx;
2776 if (GET_CODE (insn) != JUMP_INSN
2777 && GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
2779 cond_rtx = XEXP (SET_SRC (set), 0);
2780 then_rtx = XEXP (SET_SRC (set), 1);
2781 else_rtx = XEXP (SET_SRC (set), 2);
2785 cond_rtx = SET_SRC (set);
2786 then_rtx = const_true_rtx;
2787 else_rtx = const0_rtx;
2790 switch (GET_CODE (cond_rtx))
2803 register int result;
2804 if (XEXP (cond_rtx, 0) != cc0_rtx)
2806 result = alter_cond (cond_rtx);
2808 validate_change (insn, &SET_SRC (set), then_rtx, 0);
2809 else if (result == -1)
2810 validate_change (insn, &SET_SRC (set), else_rtx, 0);
2811 else if (result == 2)
2812 INSN_CODE (insn) = -1;
2813 if (SET_DEST (set) == SET_SRC (set))
2815 PUT_CODE (insn, NOTE);
2816 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2817 NOTE_SOURCE_FILE (insn) = 0;
2829 /* Do machine-specific peephole optimizations if desired. */
2831 if (optimize && !flag_no_peephole && !nopeepholes)
2833 rtx next = peephole (insn);
2834 /* When peepholing, if there were notes within the peephole,
2835 emit them before the peephole. */
2836 if (next != 0 && next != NEXT_INSN (insn))
2838 rtx prev = PREV_INSN (insn);
2841 for (note = NEXT_INSN (insn); note != next;
2842 note = NEXT_INSN (note))
2843 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2845 /* In case this is prescan, put the notes
2846 in proper position for later rescan. */
2847 note = NEXT_INSN (insn);
2848 PREV_INSN (note) = prev;
2849 NEXT_INSN (prev) = note;
2850 NEXT_INSN (PREV_INSN (next)) = insn;
2851 PREV_INSN (insn) = PREV_INSN (next);
2852 NEXT_INSN (insn) = next;
2853 PREV_INSN (next) = insn;
2856 /* PEEPHOLE might have changed this. */
2857 body = PATTERN (insn);
2860 /* Try to recognize the instruction.
2861 If successful, verify that the operands satisfy the
2862 constraints for the instruction. Crash if they don't,
2863 since `reload' should have changed them so that they do. */
2865 insn_code_number = recog_memoized (insn);
2866 extract_insn (insn);
2867 cleanup_subreg_operands (insn);
2869 #ifdef REGISTER_CONSTRAINTS
2870 if (! constrain_operands (1))
2871 fatal_insn_not_found (insn);
2874 /* Some target machines need to prescan each insn before
2877 #ifdef FINAL_PRESCAN_INSN
2878 FINAL_PRESCAN_INSN (insn, recog_operand, recog_n_operands);
2882 cc_prev_status = cc_status;
2884 /* Update `cc_status' for this instruction.
2885 The instruction's output routine may change it further.
2886 If the output routine for a jump insn needs to depend
2887 on the cc status, it should look at cc_prev_status. */
2889 NOTICE_UPDATE_CC (body, insn);
2894 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2895 /* If we push arguments, we want to know where the calls are. */
2896 if (GET_CODE (insn) == CALL_INSN && dwarf2out_do_frame ())
2897 dwarf2out_frame_debug (insn);
2900 /* If the proper template needs to be chosen by some C code,
2901 run that code and get the real template. */
2903 template = insn_template[insn_code_number];
2906 template = (*insn_outfun[insn_code_number]) (recog_operand, insn);
2908 /* If the C code returns 0, it means that it is a jump insn
2909 which follows a deleted test insn, and that test insn
2910 needs to be reinserted. */
2913 if (prev_nonnote_insn (insn) != last_ignored_compare)
2916 return prev_nonnote_insn (insn);
2920 /* If the template is the string "#", it means that this insn must
2922 if (template[0] == '#' && template[1] == '\0')
2924 rtx new = try_split (body, insn, 0);
2926 /* If we didn't split the insn, go away. */
2927 if (new == insn && PATTERN (new) == body)
2928 fatal_insn ("Could not split insn", insn);
2930 #ifdef HAVE_ATTR_length
2931 /* This instruction should have been split in shorten_branches,
2932 to ensure that we would have valid length info for the
2944 /* Output assembler code from the template. */
2946 output_asm_insn (template, recog_operand);
2948 #if defined (DWARF2_UNWIND_INFO)
2949 #if !defined (ACCUMULATE_OUTGOING_ARGS)
2950 /* If we push arguments, we need to check all insns for stack
2952 if (GET_CODE (insn) == INSN && dwarf2out_do_frame ())
2953 dwarf2out_frame_debug (insn);
2955 #if defined (HAVE_prologue)
2956 /* If this insn is part of the prologue, emit DWARF v2
2958 if (RTX_FRAME_RELATED_P (insn) && dwarf2out_do_frame ())
2959 dwarf2out_frame_debug (insn);
2965 /* It's not at all clear why we did this and doing so interferes
2966 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2969 /* Mark this insn as having been output. */
2970 INSN_DELETED_P (insn) = 1;
2976 return NEXT_INSN (insn);
2979 /* Output debugging info to the assembler file FILE
2980 based on the NOTE-insn INSN, assumed to be a line number. */
2983 output_source_line (file, insn)
2987 register char *filename = NOTE_SOURCE_FILE (insn);
2989 /* Remember filename for basic block profiling.
2990 Filenames are allocated on the permanent obstack
2991 or are passed in ARGV, so we don't have to save
2994 if (profile_block_flag && last_filename != filename)
2995 bb_file_label_num = add_bb_string (filename, TRUE);
2997 last_filename = filename;
2998 last_linenum = NOTE_LINE_NUMBER (insn);
2999 high_block_linenum = MAX (last_linenum, high_block_linenum);
3000 high_function_linenum = MAX (last_linenum, high_function_linenum);
3002 if (write_symbols != NO_DEBUG)
3004 #ifdef SDB_DEBUGGING_INFO
3005 if (write_symbols == SDB_DEBUG
3006 #if 0 /* People like having line numbers even in wrong file! */
3007 /* COFF can't handle multiple source files--lose, lose. */
3008 && !strcmp (filename, main_input_filename)
3010 /* COFF relative line numbers must be positive. */
3011 && last_linenum > sdb_begin_function_line)
3013 #ifdef ASM_OUTPUT_SOURCE_LINE
3014 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
3016 fprintf (file, "\t.ln\t%d\n",
3017 ((sdb_begin_function_line > -1)
3018 ? last_linenum - sdb_begin_function_line : 1));
3023 #if defined (DBX_DEBUGGING_INFO)
3024 if (write_symbols == DBX_DEBUG)
3025 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
3028 #if defined (XCOFF_DEBUGGING_INFO)
3029 if (write_symbols == XCOFF_DEBUG)
3030 xcoffout_source_line (file, filename, insn);
3033 #ifdef DWARF_DEBUGGING_INFO
3034 if (write_symbols == DWARF_DEBUG)
3035 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
3038 #ifdef DWARF2_DEBUGGING_INFO
3039 if (write_symbols == DWARF2_DEBUG)
3040 dwarf2out_line (filename, NOTE_LINE_NUMBER (insn));
3046 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3047 directly to the desired hard register. */
3049 cleanup_subreg_operands (insn)
3054 extract_insn (insn);
3055 for (i = 0; i < recog_n_operands; i++)
3057 if (GET_CODE (recog_operand[i]) == SUBREG)
3058 recog_operand[i] = alter_subreg (recog_operand[i]);
3059 else if (GET_CODE (recog_operand[i]) == PLUS
3060 || GET_CODE (recog_operand[i]) == MULT)
3061 recog_operand[i] = walk_alter_subreg (recog_operand[i]);
3064 for (i = 0; i < recog_n_dups; i++)
3066 if (GET_CODE (*recog_dup_loc[i]) == SUBREG)
3067 *recog_dup_loc[i] = alter_subreg (*recog_dup_loc[i]);
3068 else if (GET_CODE (*recog_dup_loc[i]) == PLUS
3069 || GET_CODE (*recog_dup_loc[i]) == MULT)
3070 *recog_dup_loc[i] = walk_alter_subreg (*recog_dup_loc[i]);
3074 /* If X is a SUBREG, replace it with a REG or a MEM,
3075 based on the thing it is a subreg of. */
3081 register rtx y = SUBREG_REG (x);
3083 if (GET_CODE (y) == SUBREG)
3084 y = alter_subreg (y);
3086 /* If reload is operating, we may be replacing inside this SUBREG.
3087 Check for that and make a new one if so. */
3088 if (reload_in_progress && find_replacement (&SUBREG_REG (x)) != 0)
3091 if (GET_CODE (y) == REG)
3093 /* If the word size is larger than the size of this register,
3094 adjust the register number to compensate. */
3095 /* ??? Note that this just catches stragglers created by/for
3096 integrate. It would be better if we either caught these
3097 earlier, or kept _all_ subregs until now and eliminate
3098 gen_lowpart and friends. */
3101 #ifdef ALTER_HARD_SUBREG
3102 REGNO (x) = ALTER_HARD_SUBREG(GET_MODE (x), SUBREG_WORD (x),
3103 GET_MODE (y), REGNO (y));
3105 REGNO (x) = REGNO (y) + SUBREG_WORD (x);
3107 /* This field has a different meaning for REGs and SUBREGs. Make sure
3111 else if (GET_CODE (y) == MEM)
3113 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
3114 if (BYTES_BIG_ENDIAN)
3115 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
3116 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
3118 MEM_COPY_ATTRIBUTES (x, y);
3119 MEM_ALIAS_SET (x) = MEM_ALIAS_SET (y);
3120 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
3126 /* Do alter_subreg on all the SUBREGs contained in X. */
3129 walk_alter_subreg (x)
3132 switch (GET_CODE (x))
3136 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3137 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
3141 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3145 return alter_subreg (x);
3156 /* Given BODY, the body of a jump instruction, alter the jump condition
3157 as required by the bits that are set in cc_status.flags.
3158 Not all of the bits there can be handled at this level in all cases.
3160 The value is normally 0.
3161 1 means that the condition has become always true.
3162 -1 means that the condition has become always false.
3163 2 means that COND has been altered. */
3171 if (cc_status.flags & CC_REVERSED)
3174 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
3177 if (cc_status.flags & CC_INVERTED)
3180 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
3183 if (cc_status.flags & CC_NOT_POSITIVE)
3184 switch (GET_CODE (cond))
3189 /* Jump becomes unconditional. */
3195 /* Jump becomes no-op. */
3199 PUT_CODE (cond, EQ);
3204 PUT_CODE (cond, NE);
3212 if (cc_status.flags & CC_NOT_NEGATIVE)
3213 switch (GET_CODE (cond))
3217 /* Jump becomes unconditional. */
3222 /* Jump becomes no-op. */
3227 PUT_CODE (cond, EQ);
3233 PUT_CODE (cond, NE);
3241 if (cc_status.flags & CC_NO_OVERFLOW)
3242 switch (GET_CODE (cond))
3245 /* Jump becomes unconditional. */
3249 PUT_CODE (cond, EQ);
3254 PUT_CODE (cond, NE);
3259 /* Jump becomes no-op. */
3266 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
3267 switch (GET_CODE (cond))
3273 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
3278 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
3283 if (cc_status.flags & CC_NOT_SIGNED)
3284 /* The flags are valid if signed condition operators are converted
3286 switch (GET_CODE (cond))
3289 PUT_CODE (cond, LEU);
3294 PUT_CODE (cond, LTU);
3299 PUT_CODE (cond, GTU);
3304 PUT_CODE (cond, GEU);
3316 /* Report inconsistency between the assembler template and the operands.
3317 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3320 output_operand_lossage (msgid)
3323 if (this_is_asm_operands)
3324 error_for_asm (this_is_asm_operands, "invalid `asm': %s", _(msgid));
3326 fatal ("Internal compiler error, output_operand_lossage `%s'", _(msgid));
3329 /* Output of assembler code from a template, and its subroutines. */
3331 /* Output text from TEMPLATE to the assembler output file,
3332 obeying %-directions to substitute operands taken from
3333 the vector OPERANDS.
3335 %N (for N a digit) means print operand N in usual manner.
3336 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3337 and print the label name with no punctuation.
3338 %cN means require operand N to be a constant
3339 and print the constant expression with no punctuation.
3340 %aN means expect operand N to be a memory address
3341 (not a memory reference!) and print a reference
3343 %nN means expect operand N to be a constant
3344 and print a constant expression for minus the value
3345 of the operand, with no other punctuation. */
3350 if (flag_print_asm_name)
3352 /* Annotate the assembly with a comment describing the pattern and
3353 alternative used. */
3356 register int num = INSN_CODE (debug_insn);
3357 fprintf (asm_out_file, "\t%s %d\t%s",
3358 ASM_COMMENT_START, INSN_UID (debug_insn), insn_name[num]);
3359 if (insn_n_alternatives[num] > 1)
3360 fprintf (asm_out_file, "/%d", which_alternative + 1);
3361 #ifdef HAVE_ATTR_length
3362 fprintf (asm_out_file, "\t[length = %d]", get_attr_length (debug_insn));
3364 /* Clear this so only the first assembler insn
3365 of any rtl insn will get the special comment for -dp. */
3372 output_asm_insn (template, operands)
3373 const char *template;
3376 register const char *p;
3379 /* An insn may return a null string template
3380 in a case where no assembler code is needed. */
3385 putc ('\t', asm_out_file);
3387 #ifdef ASM_OUTPUT_OPCODE
3388 ASM_OUTPUT_OPCODE (asm_out_file, p);
3396 putc (c, asm_out_file);
3397 #ifdef ASM_OUTPUT_OPCODE
3398 while ((c = *p) == '\t')
3400 putc (c, asm_out_file);
3403 ASM_OUTPUT_OPCODE (asm_out_file, p);
3407 #ifdef ASSEMBLER_DIALECT
3412 /* If we want the first dialect, do nothing. Otherwise, skip
3413 DIALECT_NUMBER of strings ending with '|'. */
3414 for (i = 0; i < dialect_number; i++)
3416 while (*p && *p != '}' && *p++ != '|')
3427 /* Skip to close brace. */
3428 while (*p && *p++ != '}')
3437 /* %% outputs a single %. */
3441 putc (c, asm_out_file);
3443 /* %= outputs a number which is unique to each insn in the entire
3444 compilation. This is useful for making local labels that are
3445 referred to more than once in a given insn. */
3449 fprintf (asm_out_file, "%d", insn_counter);
3451 /* % followed by a letter and some digits
3452 outputs an operand in a special way depending on the letter.
3453 Letters `acln' are implemented directly.
3454 Other letters are passed to `output_operand' so that
3455 the PRINT_OPERAND macro can define them. */
3456 else if ((*p >= 'a' && *p <= 'z')
3457 || (*p >= 'A' && *p <= 'Z'))
3462 if (! (*p >= '0' && *p <= '9'))
3463 output_operand_lossage ("operand number missing after %-letter");
3464 else if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3465 output_operand_lossage ("operand number out of range");
3466 else if (letter == 'l')
3467 output_asm_label (operands[c]);
3468 else if (letter == 'a')
3469 output_address (operands[c]);
3470 else if (letter == 'c')
3472 if (CONSTANT_ADDRESS_P (operands[c]))
3473 output_addr_const (asm_out_file, operands[c]);
3475 output_operand (operands[c], 'c');
3477 else if (letter == 'n')
3479 if (GET_CODE (operands[c]) == CONST_INT)
3480 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
3481 - INTVAL (operands[c]));
3484 putc ('-', asm_out_file);
3485 output_addr_const (asm_out_file, operands[c]);
3489 output_operand (operands[c], letter);
3491 while ((c = *p) >= '0' && c <= '9') p++;
3493 /* % followed by a digit outputs an operand the default way. */
3494 else if (*p >= '0' && *p <= '9')
3497 if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3498 output_operand_lossage ("operand number out of range");
3500 output_operand (operands[c], 0);
3501 while ((c = *p) >= '0' && c <= '9') p++;
3503 /* % followed by punctuation: output something for that
3504 punctuation character alone, with no operand.
3505 The PRINT_OPERAND macro decides what is actually done. */
3506 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3507 else if (PRINT_OPERAND_PUNCT_VALID_P ((unsigned char)*p))
3508 output_operand (NULL_RTX, *p++);
3511 output_operand_lossage ("invalid %%-code");
3515 putc (c, asm_out_file);
3520 putc ('\n', asm_out_file);
3523 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3526 output_asm_label (x)
3531 if (GET_CODE (x) == LABEL_REF)
3532 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3533 else if (GET_CODE (x) == CODE_LABEL)
3534 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3536 output_operand_lossage ("`%l' operand isn't a label");
3538 assemble_name (asm_out_file, buf);
3541 /* Print operand X using machine-dependent assembler syntax.
3542 The macro PRINT_OPERAND is defined just to control this function.
3543 CODE is a non-digit that preceded the operand-number in the % spec,
3544 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3545 between the % and the digits.
3546 When CODE is a non-letter, X is 0.
3548 The meanings of the letters are machine-dependent and controlled
3549 by PRINT_OPERAND. */
3552 output_operand (x, code)
3556 if (x && GET_CODE (x) == SUBREG)
3557 x = alter_subreg (x);
3559 /* If X is a pseudo-register, abort now rather than writing trash to the
3562 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
3565 PRINT_OPERAND (asm_out_file, x, code);
3568 /* Print a memory reference operand for address X
3569 using machine-dependent assembler syntax.
3570 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3576 walk_alter_subreg (x);
3577 PRINT_OPERAND_ADDRESS (asm_out_file, x);
3580 /* Print an integer constant expression in assembler syntax.
3581 Addition and subtraction are the only arithmetic
3582 that may appear in these expressions. */
3585 output_addr_const (file, x)
3592 switch (GET_CODE (x))
3602 assemble_name (file, XSTR (x, 0));
3606 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3607 assemble_name (file, buf);
3611 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3612 assemble_name (file, buf);
3616 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
3620 /* This used to output parentheses around the expression,
3621 but that does not work on the 386 (either ATT or BSD assembler). */
3622 output_addr_const (file, XEXP (x, 0));
3626 if (GET_MODE (x) == VOIDmode)
3628 /* We can use %d if the number is one word and positive. */
3629 if (CONST_DOUBLE_HIGH (x))
3630 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3631 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
3632 else if (CONST_DOUBLE_LOW (x) < 0)
3633 fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
3635 fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
3638 /* We can't handle floating point constants;
3639 PRINT_OPERAND must handle them. */
3640 output_operand_lossage ("floating constant misused");
3644 /* Some assemblers need integer constants to appear last (eg masm). */
3645 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
3647 output_addr_const (file, XEXP (x, 1));
3648 if (INTVAL (XEXP (x, 0)) >= 0)
3649 fprintf (file, "+");
3650 output_addr_const (file, XEXP (x, 0));
3654 output_addr_const (file, XEXP (x, 0));
3655 if (INTVAL (XEXP (x, 1)) >= 0)
3656 fprintf (file, "+");
3657 output_addr_const (file, XEXP (x, 1));
3662 /* Avoid outputting things like x-x or x+5-x,
3663 since some assemblers can't handle that. */
3664 x = simplify_subtraction (x);
3665 if (GET_CODE (x) != MINUS)
3668 output_addr_const (file, XEXP (x, 0));
3669 fprintf (file, "-");
3670 if (GET_CODE (XEXP (x, 1)) == CONST_INT
3671 && INTVAL (XEXP (x, 1)) < 0)
3673 fprintf (file, ASM_OPEN_PAREN);
3674 output_addr_const (file, XEXP (x, 1));
3675 fprintf (file, ASM_CLOSE_PAREN);
3678 output_addr_const (file, XEXP (x, 1));
3683 output_addr_const (file, XEXP (x, 0));
3687 output_operand_lossage ("invalid expression as operand");
3691 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3692 %R prints the value of REGISTER_PREFIX.
3693 %L prints the value of LOCAL_LABEL_PREFIX.
3694 %U prints the value of USER_LABEL_PREFIX.
3695 %I prints the value of IMMEDIATE_PREFIX.
3696 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3697 Also supported are %d, %x, %s, %e, %f, %g and %%.
3699 We handle alternate assembler dialects here, just like output_asm_insn. */
3702 asm_fprintf VPROTO((FILE *file, const char *p, ...))
3704 #ifndef ANSI_PROTOTYPES
3712 VA_START (argptr, p);
3714 #ifndef ANSI_PROTOTYPES
3715 file = va_arg (argptr, FILE *);
3716 p = va_arg (argptr, const char *);
3724 #ifdef ASSEMBLER_DIALECT
3729 /* If we want the first dialect, do nothing. Otherwise, skip
3730 DIALECT_NUMBER of strings ending with '|'. */
3731 for (i = 0; i < dialect_number; i++)
3733 while (*p && *p++ != '|')
3743 /* Skip to close brace. */
3744 while (*p && *p++ != '}')
3755 while ((c >= '0' && c <= '9') || c == '.')
3763 fprintf (file, "%%");
3766 case 'd': case 'i': case 'u':
3767 case 'x': case 'p': case 'X':
3771 fprintf (file, buf, va_arg (argptr, int));
3775 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3776 but we do not check for those cases. It means that the value
3777 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3779 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3781 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3791 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3798 fprintf (file, buf, va_arg (argptr, long));
3806 fprintf (file, buf, va_arg (argptr, double));
3812 fprintf (file, buf, va_arg (argptr, char *));
3816 #ifdef ASM_OUTPUT_OPCODE
3817 ASM_OUTPUT_OPCODE (asm_out_file, p);
3822 #ifdef REGISTER_PREFIX
3823 fprintf (file, "%s", REGISTER_PREFIX);
3828 #ifdef IMMEDIATE_PREFIX
3829 fprintf (file, "%s", IMMEDIATE_PREFIX);
3834 #ifdef LOCAL_LABEL_PREFIX
3835 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
3840 fputs (user_label_prefix, file);
3843 #ifdef ASM_FPRINTF_EXTENSIONS
3844 /* Upper case letters are reserved for general use by asm_fprintf
3845 and so are not available to target specific code. In order to
3846 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
3847 they are defined here. As they get turned into real extensions
3848 to asm_fprintf they should be removed from this list. */
3849 case 'A': case 'B': case 'C': case 'D': case 'E':
3850 case 'F': case 'G': case 'H': case 'J': case 'K':
3851 case 'M': case 'N': case 'P': case 'Q': case 'S':
3852 case 'T': case 'V': case 'W': case 'Y': case 'Z':
3855 ASM_FPRINTF_EXTENSIONS (file, argptr, p)
3867 /* Split up a CONST_DOUBLE or integer constant rtx
3868 into two rtx's for single words,
3869 storing in *FIRST the word that comes first in memory in the target
3870 and in *SECOND the other. */
3873 split_double (value, first, second)
3875 rtx *first, *second;
3877 if (GET_CODE (value) == CONST_INT)
3879 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3881 /* In this case the CONST_INT holds both target words.
3882 Extract the bits from it into two word-sized pieces.
3883 Sign extend each half to HOST_WIDE_INT. */
3885 /* On machines where HOST_BITS_PER_WIDE_INT == BITS_PER_WORD
3886 the shift below will cause a compiler warning, even though
3887 this code won't be executed. So put the shift amounts in
3888 variables to avoid the warning. */
3889 int rshift = HOST_BITS_PER_WIDE_INT - BITS_PER_WORD;
3890 int lshift = HOST_BITS_PER_WIDE_INT - 2 * BITS_PER_WORD;
3892 low = GEN_INT ((INTVAL (value) << rshift) >> rshift);
3893 high = GEN_INT ((INTVAL (value) << lshift) >> rshift);
3894 if (WORDS_BIG_ENDIAN)
3907 /* The rule for using CONST_INT for a wider mode
3908 is that we regard the value as signed.
3909 So sign-extend it. */
3910 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
3911 if (WORDS_BIG_ENDIAN)
3923 else if (GET_CODE (value) != CONST_DOUBLE)
3925 if (WORDS_BIG_ENDIAN)
3927 *first = const0_rtx;
3933 *second = const0_rtx;
3936 else if (GET_MODE (value) == VOIDmode
3937 /* This is the old way we did CONST_DOUBLE integers. */
3938 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
3940 /* In an integer, the words are defined as most and least significant.
3941 So order them by the target's convention. */
3942 if (WORDS_BIG_ENDIAN)
3944 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3945 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3949 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3950 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3955 #ifdef REAL_ARITHMETIC
3956 REAL_VALUE_TYPE r; long l[2];
3957 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
3959 /* Note, this converts the REAL_VALUE_TYPE to the target's
3960 format, splits up the floating point double and outputs
3961 exactly 32 bits of it into each of l[0] and l[1] --
3962 not necessarily BITS_PER_WORD bits. */
3963 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
3965 /* If 32 bits is an entire word for the target, but not for the host,
3966 then sign-extend on the host so that the number will look the same
3967 way on the host that it would on the target. See for instance
3968 simplify_unary_operation. The #if is needed to avoid compiler
3971 #if HOST_BITS_PER_LONG > 32
3972 if (BITS_PER_WORD < HOST_BITS_PER_LONG && BITS_PER_WORD == 32)
3974 if (l[0] & ((long) 1 << 31))
3975 l[0] |= ((long) (-1) << 32);
3976 if (l[1] & ((long) 1 << 31))
3977 l[1] |= ((long) (-1) << 32);
3981 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
3982 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
3984 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
3985 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
3986 && ! flag_pretend_float)
3990 #ifdef HOST_WORDS_BIG_ENDIAN
3997 /* Host and target agree => no need to swap. */
3998 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3999 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
4003 *second = GEN_INT (CONST_DOUBLE_LOW (value));
4004 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
4006 #endif /* no REAL_ARITHMETIC */
4010 /* Return nonzero if this function has no function calls. */
4017 if (profile_flag || profile_block_flag || profile_arc_flag)
4020 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4022 if (GET_CODE (insn) == CALL_INSN)
4024 if (GET_CODE (insn) == INSN
4025 && GET_CODE (PATTERN (insn)) == SEQUENCE
4026 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN)
4029 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4031 if (GET_CODE (XEXP (insn, 0)) == CALL_INSN)
4033 if (GET_CODE (XEXP (insn, 0)) == INSN
4034 && GET_CODE (PATTERN (XEXP (insn, 0))) == SEQUENCE
4035 && GET_CODE (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)) == CALL_INSN)
4042 /* On some machines, a function with no call insns
4043 can run faster if it doesn't create its own register window.
4044 When output, the leaf function should use only the "output"
4045 registers. Ordinarily, the function would be compiled to use
4046 the "input" registers to find its arguments; it is a candidate
4047 for leaf treatment if it uses only the "input" registers.
4048 Leaf function treatment means renumbering so the function
4049 uses the "output" registers instead. */
4051 #ifdef LEAF_REGISTERS
4053 static char permitted_reg_in_leaf_functions[] = LEAF_REGISTERS;
4055 /* Return 1 if this function uses only the registers that can be
4056 safely renumbered. */
4059 only_leaf_regs_used ()
4063 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4064 if ((regs_ever_live[i] || global_regs[i])
4065 && ! permitted_reg_in_leaf_functions[i])
4068 if (current_function_uses_pic_offset_table
4069 && pic_offset_table_rtx != 0
4070 && GET_CODE (pic_offset_table_rtx) == REG
4071 && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4077 /* Scan all instructions and renumber all registers into those
4078 available in leaf functions. */
4081 leaf_renumber_regs (first)
4086 /* Renumber only the actual patterns.
4087 The reg-notes can contain frame pointer refs,
4088 and renumbering them could crash, and should not be needed. */
4089 for (insn = first; insn; insn = NEXT_INSN (insn))
4090 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
4091 leaf_renumber_regs_insn (PATTERN (insn));
4092 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4093 if (GET_RTX_CLASS (GET_CODE (XEXP (insn, 0))) == 'i')
4094 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
4097 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4098 available in leaf functions. */
4101 leaf_renumber_regs_insn (in_rtx)
4102 register rtx in_rtx;
4105 register char *format_ptr;
4110 /* Renumber all input-registers into output-registers.
4111 renumbered_regs would be 1 for an output-register;
4114 if (GET_CODE (in_rtx) == REG)
4118 /* Don't renumber the same reg twice. */
4122 newreg = REGNO (in_rtx);
4123 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4124 to reach here as part of a REG_NOTE. */
4125 if (newreg >= FIRST_PSEUDO_REGISTER)
4130 newreg = LEAF_REG_REMAP (newreg);
4133 regs_ever_live[REGNO (in_rtx)] = 0;
4134 regs_ever_live[newreg] = 1;
4135 REGNO (in_rtx) = newreg;
4139 if (GET_RTX_CLASS (GET_CODE (in_rtx)) == 'i')
4141 /* Inside a SEQUENCE, we find insns.
4142 Renumber just the patterns of these insns,
4143 just as we do for the top-level insns. */
4144 leaf_renumber_regs_insn (PATTERN (in_rtx));
4148 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
4150 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
4151 switch (*format_ptr++)
4154 leaf_renumber_regs_insn (XEXP (in_rtx, i));
4158 if (NULL != XVEC (in_rtx, i))
4160 for (j = 0; j < XVECLEN (in_rtx, i); j++)
4161 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));