1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-97, 1998 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"
68 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
69 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
71 #if defined (USG) || !defined (HAVE_STAB_H)
72 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
77 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
79 #ifdef XCOFF_DEBUGGING_INFO
83 #ifdef DWARF_DEBUGGING_INFO
87 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
88 #include "dwarf2out.h"
91 #ifdef SDB_DEBUGGING_INFO
95 /* .stabd code for line number. */
100 /* .stabs code for included file name. */
105 #ifndef INT_TYPE_SIZE
106 #define INT_TYPE_SIZE BITS_PER_WORD
109 #ifndef LONG_TYPE_SIZE
110 #define LONG_TYPE_SIZE BITS_PER_WORD
113 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
114 null default for it to save conditionalization later. */
115 #ifndef CC_STATUS_INIT
116 #define CC_STATUS_INIT
119 /* How to start an assembler comment. */
120 #ifndef ASM_COMMENT_START
121 #define ASM_COMMENT_START ";#"
124 /* Is the given character a logical line separator for the assembler? */
125 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
126 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
129 #ifndef JUMP_TABLES_IN_TEXT_SECTION
130 #define JUMP_TABLES_IN_TEXT_SECTION 0
133 /* Nonzero means this function is a leaf function, with no function calls.
134 This variable exists to be examined in FUNCTION_PROLOGUE
135 and FUNCTION_EPILOGUE. Always zero, unless set by some action. */
138 /* Last insn processed by final_scan_insn. */
139 static rtx debug_insn = 0;
141 /* Line number of last NOTE. */
142 static int last_linenum;
144 /* Highest line number in current block. */
145 static int high_block_linenum;
147 /* Likewise for function. */
148 static int high_function_linenum;
150 /* Filename of last NOTE. */
151 static char *last_filename;
153 /* Number of basic blocks seen so far;
154 used if profile_block_flag is set. */
155 static int count_basic_blocks;
157 /* Number of instrumented arcs when profile_arc_flag is set. */
158 extern int count_instrumented_arcs;
160 extern int length_unit_log; /* This is defined in insn-attrtab.c. */
162 /* Nonzero while outputting an `asm' with operands.
163 This means that inconsistencies are the user's fault, so don't abort.
164 The precise value is the insn being output, to pass to error_for_asm. */
165 static rtx this_is_asm_operands;
167 /* Number of operands of this insn, for an `asm' with operands. */
168 static unsigned int insn_noperands;
170 /* Compare optimization flag. */
172 static rtx last_ignored_compare = 0;
174 /* Flag indicating this insn is the start of a new basic block. */
176 static int new_block = 1;
178 /* All the symbol-blocks (levels of scoping) in the compilation
179 are assigned sequence numbers in order of appearance of the
180 beginnings of the symbol-blocks. Both final and dbxout do this,
181 and assume that they will both give the same number to each block.
182 Final uses these sequence numbers to generate assembler label names
183 LBBnnn and LBEnnn for the beginning and end of the symbol-block.
184 Dbxout uses the sequence numbers to generate references to the same labels
185 from the dbx debugging information.
187 Sdb records this level at the beginning of each function,
188 in order to find the current level when recursing down declarations.
189 It outputs the block beginning and endings
190 at the point in the asm file where the blocks would begin and end. */
192 int next_block_index;
194 /* Assign a unique number to each insn that is output.
195 This can be used to generate unique local labels. */
197 static int insn_counter = 0;
200 /* This variable contains machine-dependent flags (defined in tm.h)
201 set and examined by output routines
202 that describe how to interpret the condition codes properly. */
206 /* During output of an insn, this contains a copy of cc_status
207 from before the insn. */
209 CC_STATUS cc_prev_status;
212 /* Indexed by hardware reg number, is 1 if that register is ever
213 used in the current function.
215 In life_analysis, or in stupid_life_analysis, this is set
216 up to record the hard regs used explicitly. Reload adds
217 in the hard regs used for holding pseudo regs. Final uses
218 it to generate the code in the function prologue and epilogue
219 to save and restore registers as needed. */
221 char regs_ever_live[FIRST_PSEUDO_REGISTER];
223 /* Nonzero means current function must be given a frame pointer.
224 Set in stmt.c if anything is allocated on the stack there.
225 Set in reload1.c if anything is allocated on the stack there. */
227 int frame_pointer_needed;
229 /* Assign unique numbers to labels generated for profiling. */
231 int profile_label_no;
233 /* Length so far allocated in PENDING_BLOCKS. */
235 static int max_block_depth;
237 /* Stack of sequence numbers of symbol-blocks of which we have seen the
238 beginning but not yet the end. Sequence numbers are assigned at
239 the beginning; this stack allows us to find the sequence number
240 of a block that is ending. */
242 static int *pending_blocks;
244 /* Number of elements currently in use in PENDING_BLOCKS. */
246 static int block_depth;
248 /* Nonzero if have enabled APP processing of our assembler output. */
252 /* If we are outputting an insn sequence, this contains the sequence rtx.
257 #ifdef ASSEMBLER_DIALECT
259 /* Number of the assembler dialect to use, starting at 0. */
260 static int dialect_number;
263 /* Indexed by line number, nonzero if there is a note for that line. */
265 static char *line_note_exists;
267 /* Linked list to hold line numbers for each basic block. */
270 struct bb_list *next; /* pointer to next basic block */
271 int line_num; /* line number */
272 int file_label_num; /* LPBC<n> label # for stored filename */
273 int func_label_num; /* LPBC<n> label # for stored function name */
276 static struct bb_list *bb_head = 0; /* Head of basic block list */
277 static struct bb_list **bb_tail = &bb_head; /* Ptr to store next bb ptr */
278 static int bb_file_label_num = -1; /* Current label # for file */
279 static int bb_func_label_num = -1; /* Current label # for func */
281 /* Linked list to hold the strings for each file and function name output. */
284 struct bb_str *next; /* pointer to next string */
285 char *string; /* string */
286 int label_num; /* label number */
287 int length; /* string length */
290 extern rtx peephole PROTO((rtx));
292 static struct bb_str *sbb_head = 0; /* Head of string list. */
293 static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */
294 static int sbb_label_num = 0; /* Last label used */
296 #ifdef HAVE_ATTR_length
297 static int asm_insn_count PROTO((rtx));
299 static void profile_function PROTO((FILE *));
300 static void profile_after_prologue PROTO((FILE *));
301 static void add_bb PROTO((FILE *));
302 static int add_bb_string PROTO((char *, int));
303 static void output_source_line PROTO((FILE *, rtx));
304 static rtx walk_alter_subreg PROTO((rtx));
305 static void output_asm_name PROTO((void));
306 static void output_operand PROTO((rtx, int));
307 #ifdef LEAF_REGISTERS
308 static void leaf_renumber_regs PROTO((rtx));
311 static int alter_cond PROTO((rtx));
314 extern char *getpwd ();
316 /* Initialize data in final at the beginning of a compilation. */
319 init_final (filename)
322 next_block_index = 2;
324 max_block_depth = 20;
325 pending_blocks = (int *) xmalloc (20 * sizeof *pending_blocks);
328 #ifdef ASSEMBLER_DIALECT
329 dialect_number = ASSEMBLER_DIALECT;
333 /* Called at end of source file,
334 to output the block-profiling table for this entire compilation. */
342 if (profile_block_flag || profile_arc_flag)
345 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
349 int long_bytes = LONG_TYPE_SIZE / BITS_PER_UNIT;
350 int pointer_bytes = POINTER_SIZE / BITS_PER_UNIT;
352 if (profile_block_flag)
353 size = long_bytes * count_basic_blocks;
355 size = long_bytes * count_instrumented_arcs;
358 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
359 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
360 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
364 /* Output the main header, of 11 words:
365 0: 1 if this file is initialized, else 0.
366 1: address of file name (LPBX1).
367 2: address of table of counts (LPBX2).
368 3: number of counts in the table.
369 4: always 0, for compatibility with Sun.
371 The following are GNU extensions:
373 5: address of table of start addrs of basic blocks (LPBX3).
374 6: Number of bytes in this header.
375 7: address of table of function names (LPBX4).
376 8: address of table of line numbers (LPBX5) or 0.
377 9: address of table of file names (LPBX6) or 0.
378 10: space reserved for basic block profiling. */
380 ASM_OUTPUT_ALIGN (asm_out_file, align);
382 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
384 assemble_integer (const0_rtx, long_bytes, 1);
386 /* address of filename */
387 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
388 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
390 /* address of count table */
391 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
392 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
394 /* count of the # of basic blocks or # of instrumented arcs */
395 if (profile_block_flag)
396 assemble_integer (GEN_INT (count_basic_blocks), long_bytes, 1);
398 assemble_integer (GEN_INT (count_instrumented_arcs), long_bytes,
401 /* zero word (link field) */
402 assemble_integer (const0_rtx, pointer_bytes, 1);
404 /* address of basic block start address table */
405 if (profile_block_flag)
407 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
408 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
412 assemble_integer (const0_rtx, pointer_bytes, 1);
414 /* byte count for extended structure. */
415 assemble_integer (GEN_INT (10 * UNITS_PER_WORD), long_bytes, 1);
417 /* address of function name table */
418 if (profile_block_flag)
420 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
421 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
425 assemble_integer (const0_rtx, pointer_bytes, 1);
427 /* address of line number and filename tables if debugging. */
428 if (write_symbols != NO_DEBUG && profile_block_flag)
430 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
431 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
432 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
433 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
437 assemble_integer (const0_rtx, pointer_bytes, 1);
438 assemble_integer (const0_rtx, pointer_bytes, 1);
441 /* space for extension ptr (link field) */
442 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
444 /* Output the file name changing the suffix to .d for Sun tcov
446 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
448 char *cwd = getpwd ();
449 int len = strlen (filename) + strlen (cwd) + 1;
450 char *data_file = (char *) alloca (len + 4);
452 strcpy (data_file, cwd);
453 strcat (data_file, "/");
454 strcat (data_file, filename);
455 strip_off_ending (data_file, len);
456 if (profile_block_flag)
457 strcat (data_file, ".d");
459 strcat (data_file, ".da");
460 assemble_string (data_file, strlen (data_file) + 1);
463 /* Make space for the table of counts. */
466 /* Realign data section. */
467 ASM_OUTPUT_ALIGN (asm_out_file, align);
468 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
470 assemble_zeros (size);
474 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
475 #ifdef ASM_OUTPUT_SHARED_LOCAL
476 if (flag_shared_data)
477 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
480 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
481 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
484 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
485 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
488 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
493 /* Output any basic block strings */
494 if (profile_block_flag)
496 readonly_data_section ();
499 ASM_OUTPUT_ALIGN (asm_out_file, align);
500 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
502 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC",
504 assemble_string (sptr->string, sptr->length);
509 /* Output the table of addresses. */
510 if (profile_block_flag)
512 /* Realign in new section */
513 ASM_OUTPUT_ALIGN (asm_out_file, align);
514 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
515 for (i = 0; i < count_basic_blocks; i++)
517 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
518 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
523 /* Output the table of function names. */
524 if (profile_block_flag)
526 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
527 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
529 if (ptr->func_label_num >= 0)
531 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
532 ptr->func_label_num);
533 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
537 assemble_integer (const0_rtx, pointer_bytes, 1);
540 for ( ; i < count_basic_blocks; i++)
541 assemble_integer (const0_rtx, pointer_bytes, 1);
544 if (write_symbols != NO_DEBUG && profile_block_flag)
546 /* Output the table of line numbers. */
547 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
548 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
549 assemble_integer (GEN_INT (ptr->line_num), long_bytes, 1);
551 for ( ; i < count_basic_blocks; i++)
552 assemble_integer (const0_rtx, long_bytes, 1);
554 /* Output the table of file names. */
555 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
556 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
558 if (ptr->file_label_num >= 0)
560 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
561 ptr->file_label_num);
562 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
566 assemble_integer (const0_rtx, pointer_bytes, 1);
569 for ( ; i < count_basic_blocks; i++)
570 assemble_integer (const0_rtx, pointer_bytes, 1);
573 /* End with the address of the table of addresses,
574 so we can find it easily, as the last word in the file's text. */
575 if (profile_block_flag)
577 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
578 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
584 /* Enable APP processing of subsequent output.
585 Used before the output from an `asm' statement. */
592 fputs (ASM_APP_ON, asm_out_file);
597 /* Disable APP processing of subsequent output.
598 Called from varasm.c before most kinds of output. */
605 fputs (ASM_APP_OFF, asm_out_file);
610 /* Return the number of slots filled in the current
611 delayed branch sequence (we don't count the insn needing the
612 delay slot). Zero if not in a delayed branch sequence. */
616 dbr_sequence_length ()
618 if (final_sequence != 0)
619 return XVECLEN (final_sequence, 0) - 1;
625 /* The next two pages contain routines used to compute the length of an insn
626 and to shorten branches. */
628 /* Arrays for insn lengths, and addresses. The latter is referenced by
629 `insn_current_length'. */
631 static short *insn_lengths;
634 /* Address of insn being processed. Used by `insn_current_length'. */
635 int insn_current_address;
637 /* Address of insn being processed in previous iteration. */
638 int insn_last_address;
640 /* konwn invariant alignment of insn being processed. */
641 int insn_current_align;
643 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
644 gives the next following alignment insn that increases the known
645 alignment, or NULL_RTX if there is no such insn.
646 For any alignment obtained this way, we can again index uid_align with
647 its uid to obtain the next following align that in turn increases the
648 alignment, till we reach NULL_RTX; the sequence obtained this way
649 for each insn we'll call the alignment chain of this insn in the following
652 struct label_alignment {
657 static rtx *uid_align;
658 static int *uid_shuid;
659 static struct label_alignment *label_align;
661 /* Indicate that branch shortening hasn't yet been done. */
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
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 insn = try_split (PATTERN (old), old, 1);
1003 /* When not optimizing, the old insn will be still left around
1004 with only the 'deleted' bit set. Transform it into a note
1005 to avoid confusion of subsequent processing. */
1006 if (INSN_DELETED_P (old))
1008 PUT_CODE (old , NOTE);
1009 NOTE_LINE_NUMBER (old) = NOTE_INSN_DELETED;
1010 NOTE_SOURCE_FILE (old) = 0;
1015 /* We must do some computations even when not actually shortening, in
1016 order to get the alignment information for the labels. */
1018 init_insn_lengths ();
1020 /* Compute maximum UID and allocate label_align / uid_shuid. */
1021 max_uid = get_max_uid ();
1023 max_labelno = max_label_num ();
1024 min_labelno = get_first_label_num ();
1025 label_align = (struct label_alignment *) xmalloc (
1026 (max_labelno - min_labelno + 1) * sizeof (struct label_alignment));
1027 bzero ((char *) label_align,
1028 (max_labelno - min_labelno + 1) * sizeof (struct label_alignment));
1030 uid_shuid = (int *) xmalloc (max_uid * sizeof *uid_shuid);
1032 /* Initialize label_align and set up uid_shuid to be strictly
1033 monotonically rising with insn order. */
1034 /* We use max_log here to keep track of the maximum alignment we want to
1035 impose on the next CODE_LABEL (or the current one if we are processing
1036 the CODE_LABEL itself). */
1041 for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
1045 INSN_SHUID (insn) = i++;
1046 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1048 /* reorg might make the first insn of a loop being run once only,
1049 and delete the label in front of it. Then we want to apply
1050 the loop alignment to the new label created by reorg, which
1051 is separated by the former loop start insn from the
1052 NOTE_INSN_LOOP_BEG. */
1054 else if (GET_CODE (insn) == CODE_LABEL)
1058 log = LABEL_ALIGN (insn);
1062 max_skip = LABEL_ALIGN_MAX_SKIP;
1064 next = NEXT_INSN (insn);
1065 /* ADDR_VECs only take room if read-only data goes into the text
1067 if (JUMP_TABLES_IN_TEXT_SECTION
1068 #if !defined(READONLY_DATA_SECTION)
1072 if (next && GET_CODE (next) == JUMP_INSN)
1074 rtx nextbody = PATTERN (next);
1075 if (GET_CODE (nextbody) == ADDR_VEC
1076 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1078 log = ADDR_VEC_ALIGN (next);
1082 max_skip = LABEL_ALIGN_MAX_SKIP;
1086 LABEL_TO_ALIGNMENT (insn) = max_log;
1087 LABEL_TO_MAX_SKIP (insn) = max_skip;
1091 else if (GET_CODE (insn) == BARRIER)
1095 for (label = insn; label && GET_RTX_CLASS (GET_CODE (label)) != 'i';
1096 label = NEXT_INSN (label))
1097 if (GET_CODE (label) == CODE_LABEL)
1099 log = LABEL_ALIGN_AFTER_BARRIER (insn);
1103 max_skip = LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP;
1108 /* Again, we allow NOTE_INSN_LOOP_BEG - INSN - CODE_LABEL
1109 sequences in order to handle reorg output efficiently. */
1110 else if (GET_CODE (insn) == NOTE
1111 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
1115 for (label = insn; label; label = NEXT_INSN (label))
1116 if (GET_CODE (label) == CODE_LABEL)
1118 log = LOOP_ALIGN (insn);
1122 max_skip = LOOP_ALIGN_MAX_SKIP;
1130 #ifdef HAVE_ATTR_length
1132 /* Allocate the rest of the arrays. */
1133 insn_lengths = (short *) xmalloc (max_uid * sizeof (short));
1134 insn_addresses = (int *) xmalloc (max_uid * sizeof (int));
1135 /* Syntax errors can lead to labels being outside of the main insn stream.
1136 Initialize insn_addresses, so that we get reproducible results. */
1137 bzero ((char *)insn_addresses, max_uid * sizeof *insn_addresses);
1138 uid_align = (rtx *) xmalloc (max_uid * sizeof *uid_align);
1140 varying_length = (char *) xmalloc (max_uid * sizeof (char));
1142 bzero (varying_length, max_uid);
1144 /* Initialize uid_align. We scan instructions
1145 from end to start, and keep in align_tab[n] the last seen insn
1146 that does an alignment of at least n+1, i.e. the successor
1147 in the alignment chain for an insn that does / has a known
1150 bzero ((char *) uid_align, max_uid * sizeof *uid_align);
1152 for (i = MAX_CODE_ALIGN; --i >= 0; )
1153 align_tab[i] = NULL_RTX;
1154 seq = get_last_insn ();
1155 for (; seq; seq = PREV_INSN (seq))
1157 int uid = INSN_UID (seq);
1159 log = (GET_CODE (seq) == CODE_LABEL ? LABEL_TO_ALIGNMENT (seq) : 0);
1160 uid_align[uid] = align_tab[0];
1163 /* Found an alignment label. */
1164 uid_align[uid] = align_tab[log];
1165 for (i = log - 1; i >= 0; i--)
1169 #ifdef CASE_VECTOR_SHORTEN_MODE
1172 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1175 int min_shuid = INSN_SHUID (get_insns ()) - 1;
1176 int max_shuid = INSN_SHUID (get_last_insn ()) + 1;
1179 for (insn = first; insn != 0; insn = NEXT_INSN (insn))
1181 rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat;
1182 int len, i, min, max, insn_shuid;
1184 addr_diff_vec_flags flags;
1186 if (GET_CODE (insn) != JUMP_INSN
1187 || GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)
1189 pat = PATTERN (insn);
1190 len = XVECLEN (pat, 1);
1193 min_align = MAX_CODE_ALIGN;
1194 for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
1196 rtx lab = XEXP (XVECEXP (pat, 1, i), 0);
1197 int shuid = INSN_SHUID (lab);
1208 if (min_align > LABEL_TO_ALIGNMENT (lab))
1209 min_align = LABEL_TO_ALIGNMENT (lab);
1211 XEXP (pat, 2) = gen_rtx_LABEL_REF (VOIDmode, min_lab);
1212 XEXP (pat, 3) = gen_rtx_LABEL_REF (VOIDmode, max_lab);
1213 insn_shuid = INSN_SHUID (insn);
1214 rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0));
1215 flags.min_align = min_align;
1216 flags.base_after_vec = rel > insn_shuid;
1217 flags.min_after_vec = min > insn_shuid;
1218 flags.max_after_vec = max > insn_shuid;
1219 flags.min_after_base = min > rel;
1220 flags.max_after_base = max > rel;
1221 ADDR_DIFF_VEC_FLAGS (pat) = flags;
1224 #endif /* CASE_VECTOR_SHORTEN_MODE */
1227 /* Compute initial lengths, addresses, and varying flags for each insn. */
1228 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1230 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1232 uid = INSN_UID (insn);
1234 insn_lengths[uid] = 0;
1236 if (GET_CODE (insn) == CODE_LABEL)
1238 int log = LABEL_TO_ALIGNMENT (insn);
1241 int align = 1 << log;
1242 int new_address = (insn_current_address + align - 1) & -align;
1243 insn_lengths[uid] = new_address - insn_current_address;
1244 insn_current_address = new_address;
1248 insn_addresses[uid] = insn_current_address;
1250 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
1251 || GET_CODE (insn) == CODE_LABEL)
1253 if (INSN_DELETED_P (insn))
1256 body = PATTERN (insn);
1257 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1259 /* This only takes room if read-only data goes into the text
1261 if (JUMP_TABLES_IN_TEXT_SECTION
1262 #if !defined(READONLY_DATA_SECTION)
1266 insn_lengths[uid] = (XVECLEN (body,
1267 GET_CODE (body) == ADDR_DIFF_VEC)
1268 * GET_MODE_SIZE (GET_MODE (body)));
1269 /* Alignment is handled by ADDR_VEC_ALIGN. */
1271 else if (asm_noperands (body) >= 0)
1272 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
1273 else if (GET_CODE (body) == SEQUENCE)
1276 int const_delay_slots;
1278 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
1280 const_delay_slots = 0;
1282 /* Inside a delay slot sequence, we do not do any branch shortening
1283 if the shortening could change the number of delay slots
1285 for (i = 0; i < XVECLEN (body, 0); i++)
1287 rtx inner_insn = XVECEXP (body, 0, i);
1288 int inner_uid = INSN_UID (inner_insn);
1291 if (asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
1292 inner_length = (asm_insn_count (PATTERN (inner_insn))
1293 * insn_default_length (inner_insn));
1295 inner_length = insn_default_length (inner_insn);
1297 insn_lengths[inner_uid] = inner_length;
1298 if (const_delay_slots)
1300 if ((varying_length[inner_uid]
1301 = insn_variable_length_p (inner_insn)) != 0)
1302 varying_length[uid] = 1;
1303 insn_addresses[inner_uid] = (insn_current_address +
1307 varying_length[inner_uid] = 0;
1308 insn_lengths[uid] += inner_length;
1311 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
1313 insn_lengths[uid] = insn_default_length (insn);
1314 varying_length[uid] = insn_variable_length_p (insn);
1317 /* If needed, do any adjustment. */
1318 #ifdef ADJUST_INSN_LENGTH
1319 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
1323 /* Now loop over all the insns finding varying length insns. For each,
1324 get the current insn length. If it has changed, reflect the change.
1325 When nothing changes for a full pass, we are done. */
1327 while (something_changed)
1329 something_changed = 0;
1330 insn_current_align = MAX_CODE_ALIGN - 1;
1331 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1333 insn = NEXT_INSN (insn))
1336 #ifdef ADJUST_INSN_LENGTH
1341 uid = INSN_UID (insn);
1343 if (GET_CODE (insn) == CODE_LABEL)
1345 int log = LABEL_TO_ALIGNMENT (insn);
1346 if (log > insn_current_align)
1348 int align = 1 << log;
1349 int new_address= (insn_current_address + align - 1) & -align;
1350 insn_lengths[uid] = new_address - insn_current_address;
1351 insn_current_align = log;
1352 insn_current_address = new_address;
1355 insn_lengths[uid] = 0;
1356 insn_addresses[uid] = insn_current_address;
1360 length_align = INSN_LENGTH_ALIGNMENT (insn);
1361 if (length_align < insn_current_align)
1362 insn_current_align = length_align;
1364 insn_last_address = insn_addresses[uid];
1365 insn_addresses[uid] = insn_current_address;
1367 #ifdef CASE_VECTOR_SHORTEN_MODE
1368 if (optimize && GET_CODE (insn) == JUMP_INSN
1369 && GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
1371 rtx body = PATTERN (insn);
1372 int old_length = insn_lengths[uid];
1373 rtx rel_lab = XEXP (XEXP (body, 0), 0);
1374 rtx min_lab = XEXP (XEXP (body, 2), 0);
1375 rtx max_lab = XEXP (XEXP (body, 3), 0);
1376 addr_diff_vec_flags flags = ADDR_DIFF_VEC_FLAGS (body);
1377 int rel_addr = insn_addresses[INSN_UID (rel_lab)];
1378 int min_addr = insn_addresses[INSN_UID (min_lab)];
1379 int max_addr = insn_addresses[INSN_UID (max_lab)];
1383 /* Try to find a known alignment for rel_lab. */
1384 for (prev = rel_lab;
1386 && ! insn_lengths[INSN_UID (prev)]
1387 && ! (varying_length[INSN_UID (prev)] & 1);
1388 prev = PREV_INSN (prev))
1389 if (varying_length[INSN_UID (prev)] & 2)
1391 rel_align = LABEL_TO_ALIGNMENT (prev);
1395 /* See the comment on addr_diff_vec_flags in rtl.h for the
1396 meaning of the flags values. base: REL_LAB vec: INSN */
1397 /* Anything after INSN has still addresses from the last
1398 pass; adjust these so that they reflect our current
1399 estimate for this pass. */
1400 if (flags.base_after_vec)
1401 rel_addr += insn_current_address - insn_last_address;
1402 if (flags.min_after_vec)
1403 min_addr += insn_current_address - insn_last_address;
1404 if (flags.max_after_vec)
1405 max_addr += insn_current_address - insn_last_address;
1406 /* We want to know the worst case, i.e. lowest possible value
1407 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1408 its offset is positive, and we have to be wary of code shrink;
1409 otherwise, it is negative, and we have to be vary of code
1411 if (flags.min_after_base)
1413 /* If INSN is between REL_LAB and MIN_LAB, the size
1414 changes we are about to make can change the alignment
1415 within the observed offset, therefore we have to break
1416 it up into two parts that are independent. */
1417 if (! flags.base_after_vec && flags.min_after_vec)
1419 min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
1420 min_addr -= align_fuzz (insn, min_lab, 0, 0);
1423 min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
1427 if (flags.base_after_vec && ! flags.min_after_vec)
1429 min_addr -= align_fuzz (min_lab, insn, 0, ~0);
1430 min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
1433 min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
1435 /* Likewise, determine the highest lowest possible value
1436 for the offset of MAX_LAB. */
1437 if (flags.max_after_base)
1439 if (! flags.base_after_vec && flags.max_after_vec)
1441 max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
1442 max_addr += align_fuzz (insn, max_lab, 0, ~0);
1445 max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
1449 if (flags.base_after_vec && ! flags.max_after_vec)
1451 max_addr += align_fuzz (max_lab, insn, 0, 0);
1452 max_addr += align_fuzz (insn, rel_lab, 0, 0);
1455 max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
1457 PUT_MODE (body, CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
1458 max_addr - rel_addr,
1460 if (JUMP_TABLES_IN_TEXT_SECTION
1461 #if !defined(READONLY_DATA_SECTION)
1467 = (XVECLEN (body, 1) * GET_MODE_SIZE (GET_MODE (body)));
1468 insn_current_address += insn_lengths[uid];
1469 if (insn_lengths[uid] != old_length)
1470 something_changed = 1;
1475 #endif /* CASE_VECTOR_SHORTEN_MODE */
1477 if (! (varying_length[uid]))
1479 insn_current_address += insn_lengths[uid];
1482 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
1486 body = PATTERN (insn);
1488 for (i = 0; i < XVECLEN (body, 0); i++)
1490 rtx inner_insn = XVECEXP (body, 0, i);
1491 int inner_uid = INSN_UID (inner_insn);
1494 insn_addresses[inner_uid] = insn_current_address;
1496 /* insn_current_length returns 0 for insns with a
1497 non-varying length. */
1498 if (! varying_length[inner_uid])
1499 inner_length = insn_lengths[inner_uid];
1501 inner_length = insn_current_length (inner_insn);
1503 if (inner_length != insn_lengths[inner_uid])
1505 insn_lengths[inner_uid] = inner_length;
1506 something_changed = 1;
1508 insn_current_address += insn_lengths[inner_uid];
1509 new_length += inner_length;
1514 new_length = insn_current_length (insn);
1515 insn_current_address += new_length;
1518 #ifdef ADJUST_INSN_LENGTH
1519 /* If needed, do any adjustment. */
1520 tmp_length = new_length;
1521 ADJUST_INSN_LENGTH (insn, new_length);
1522 insn_current_address += (new_length - tmp_length);
1525 if (new_length != insn_lengths[uid])
1527 insn_lengths[uid] = new_length;
1528 something_changed = 1;
1531 /* For a non-optimizing compile, do only a single pass. */
1536 free (varying_length);
1538 #endif /* HAVE_ATTR_length */
1541 #ifdef HAVE_ATTR_length
1542 /* Given the body of an INSN known to be generated by an ASM statement, return
1543 the number of machine instructions likely to be generated for this insn.
1544 This is used to compute its length. */
1547 asm_insn_count (body)
1553 if (GET_CODE (body) == ASM_INPUT)
1554 template = XSTR (body, 0);
1556 template = decode_asm_operands (body, NULL_PTR, NULL_PTR,
1557 NULL_PTR, NULL_PTR);
1559 for ( ; *template; template++)
1560 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
1567 /* Output assembler code for the start of a function,
1568 and initialize some of the variables in this file
1569 for the new function. The label for the function and associated
1570 assembler pseudo-ops have already been output in `assemble_start_function'.
1572 FIRST is the first insn of the rtl for the function being compiled.
1573 FILE is the file to write assembler code to.
1574 OPTIMIZE is nonzero if we should eliminate redundant
1575 test and compare insns. */
1578 final_start_function (first, file, optimize)
1585 this_is_asm_operands = 0;
1587 #ifdef NON_SAVING_SETJMP
1588 /* A function that calls setjmp should save and restore all the
1589 call-saved registers on a system where longjmp clobbers them. */
1590 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
1594 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1595 if (!call_used_regs[i])
1596 regs_ever_live[i] = 1;
1600 /* Initial line number is supposed to be output
1601 before the function's prologue and label
1602 so that the function's address will not appear to be
1603 in the last statement of the preceding function. */
1604 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1605 last_linenum = high_block_linenum = high_function_linenum
1606 = NOTE_LINE_NUMBER (first);
1608 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1609 /* Output DWARF definition of the function. */
1610 if (dwarf2out_do_frame ())
1611 dwarf2out_begin_prologue ();
1614 /* For SDB and XCOFF, the function beginning must be marked between
1615 the function label and the prologue. We always need this, even when
1616 -g1 was used. Defer on MIPS systems so that parameter descriptions
1617 follow function entry. */
1618 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
1619 if (write_symbols == SDB_DEBUG)
1620 sdbout_begin_function (last_linenum);
1623 #ifdef XCOFF_DEBUGGING_INFO
1624 if (write_symbols == XCOFF_DEBUG)
1625 xcoffout_begin_function (file, last_linenum);
1628 /* But only output line number for other debug info types if -g2
1630 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1631 output_source_line (file, first);
1633 #ifdef LEAF_REG_REMAP
1635 leaf_renumber_regs (first);
1638 /* The Sun386i and perhaps other machines don't work right
1639 if the profiling code comes after the prologue. */
1640 #ifdef PROFILE_BEFORE_PROLOGUE
1642 profile_function (file);
1643 #endif /* PROFILE_BEFORE_PROLOGUE */
1645 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1646 if (dwarf2out_do_frame ())
1647 dwarf2out_frame_debug (NULL_RTX);
1650 #ifdef FUNCTION_PROLOGUE
1651 /* First output the function prologue: code to set up the stack frame. */
1652 FUNCTION_PROLOGUE (file, get_frame_size ());
1655 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1656 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
1657 next_block_index = 1;
1660 /* If the machine represents the prologue as RTL, the profiling code must
1661 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1662 #ifdef HAVE_prologue
1663 if (! HAVE_prologue)
1665 profile_after_prologue (file);
1669 /* If we are doing basic block profiling, remember a printable version
1670 of the function name. */
1671 if (profile_block_flag)
1674 = add_bb_string ((*decl_printable_name) (current_function_decl, 2), FALSE);
1679 profile_after_prologue (file)
1682 #ifdef FUNCTION_BLOCK_PROFILER
1683 if (profile_block_flag)
1685 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
1687 #endif /* FUNCTION_BLOCK_PROFILER */
1689 #ifndef PROFILE_BEFORE_PROLOGUE
1691 profile_function (file);
1692 #endif /* not PROFILE_BEFORE_PROLOGUE */
1696 profile_function (file)
1699 int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1700 #if defined(ASM_OUTPUT_REG_PUSH)
1701 #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1702 int sval = current_function_returns_struct;
1704 #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1705 int cxt = current_function_needs_context;
1707 #endif /* ASM_OUTPUT_REG_PUSH */
1710 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1711 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
1712 assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, 1);
1714 function_section (current_function_decl);
1716 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1718 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
1720 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1723 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1728 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1730 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1732 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1735 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1740 FUNCTION_PROFILER (file, profile_label_no);
1742 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1744 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1746 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1749 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1754 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1756 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1758 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1761 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1767 /* Output assembler code for the end of a function.
1768 For clarity, args are same as those of `final_start_function'
1769 even though not all of them are needed. */
1772 final_end_function (first, file, optimize)
1779 fputs (ASM_APP_OFF, file);
1783 #ifdef SDB_DEBUGGING_INFO
1784 if (write_symbols == SDB_DEBUG)
1785 sdbout_end_function (high_function_linenum);
1788 #ifdef DWARF_DEBUGGING_INFO
1789 if (write_symbols == DWARF_DEBUG)
1790 dwarfout_end_function ();
1793 #ifdef XCOFF_DEBUGGING_INFO
1794 if (write_symbols == XCOFF_DEBUG)
1795 xcoffout_end_function (file, high_function_linenum);
1798 #ifdef FUNCTION_EPILOGUE
1799 /* Finally, output the function epilogue:
1800 code to restore the stack frame and return to the caller. */
1801 FUNCTION_EPILOGUE (file, get_frame_size ());
1804 #ifdef SDB_DEBUGGING_INFO
1805 if (write_symbols == SDB_DEBUG)
1806 sdbout_end_epilogue ();
1809 #ifdef DWARF_DEBUGGING_INFO
1810 if (write_symbols == DWARF_DEBUG)
1811 dwarfout_end_epilogue ();
1814 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1815 if (dwarf2out_do_frame ())
1816 dwarf2out_end_epilogue ();
1819 #ifdef XCOFF_DEBUGGING_INFO
1820 if (write_symbols == XCOFF_DEBUG)
1821 xcoffout_end_epilogue (file);
1824 bb_func_label_num = -1; /* not in function, nuke label # */
1826 /* If FUNCTION_EPILOGUE is not defined, then the function body
1827 itself contains return instructions wherever needed. */
1830 /* Add a block to the linked list that remembers the current line/file/function
1831 for basic block profiling. Emit the label in front of the basic block and
1832 the instructions that increment the count field. */
1838 struct bb_list *ptr = (struct bb_list *) permalloc (sizeof (struct bb_list));
1840 /* Add basic block to linked list. */
1842 ptr->line_num = last_linenum;
1843 ptr->file_label_num = bb_file_label_num;
1844 ptr->func_label_num = bb_func_label_num;
1846 bb_tail = &ptr->next;
1848 /* Enable the table of basic-block use counts
1849 to point at the code it applies to. */
1850 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1852 /* Before first insn of this basic block, increment the
1853 count of times it was entered. */
1854 #ifdef BLOCK_PROFILER
1855 BLOCK_PROFILER (file, count_basic_blocks);
1862 count_basic_blocks++;
1865 /* Add a string to be used for basic block profiling. */
1868 add_bb_string (string, perm_p)
1873 struct bb_str *ptr = 0;
1877 string = "<unknown>";
1881 /* Allocate a new string if the current string isn't permanent. If
1882 the string is permanent search for the same string in other
1885 len = strlen (string) + 1;
1888 char *p = (char *) permalloc (len);
1889 bcopy (string, p, len);
1893 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1894 if (ptr->string == string)
1897 /* Allocate a new string block if we need to. */
1900 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1903 ptr->label_num = sbb_label_num++;
1904 ptr->string = string;
1906 sbb_tail = &ptr->next;
1909 return ptr->label_num;
1913 /* Output assembler code for some insns: all or part of a function.
1914 For description of args, see `final_start_function', above.
1916 PRESCAN is 1 if we are not really outputting,
1917 just scanning as if we were outputting.
1918 Prescanning deletes and rearranges insns just like ordinary output.
1919 PRESCAN is -2 if we are outputting after having prescanned.
1920 In this case, don't try to delete or rearrange insns
1921 because that has already been done.
1922 Prescanning is done only on certain machines. */
1925 final (first, file, optimize, prescan)
1935 last_ignored_compare = 0;
1938 check_exception_handler_labels ();
1940 /* Make a map indicating which line numbers appear in this function.
1941 When producing SDB debugging info, delete troublesome line number
1942 notes from inlined functions in other files as well as duplicate
1943 line number notes. */
1944 #ifdef SDB_DEBUGGING_INFO
1945 if (write_symbols == SDB_DEBUG)
1948 for (insn = first; insn; insn = NEXT_INSN (insn))
1949 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1951 if ((RTX_INTEGRATED_P (insn)
1952 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1954 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1955 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1957 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1958 NOTE_SOURCE_FILE (insn) = 0;
1962 if (NOTE_LINE_NUMBER (insn) > max_line)
1963 max_line = NOTE_LINE_NUMBER (insn);
1969 for (insn = first; insn; insn = NEXT_INSN (insn))
1970 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1971 max_line = NOTE_LINE_NUMBER (insn);
1974 line_note_exists = (char *) oballoc (max_line + 1);
1975 bzero (line_note_exists, max_line + 1);
1977 for (insn = first; insn; insn = NEXT_INSN (insn))
1979 if (INSN_UID (insn) > max_uid) /* find largest UID */
1980 max_uid = INSN_UID (insn);
1981 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1982 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
1984 /* If CC tracking across branches is enabled, record the insn which
1985 jumps to each branch only reached from one place. */
1986 if (optimize && GET_CODE (insn) == JUMP_INSN)
1988 rtx lab = JUMP_LABEL (insn);
1989 if (lab && LABEL_NUSES (lab) == 1)
1991 LABEL_REFS (lab) = insn;
1997 /* Initialize insn_eh_region table if eh is being used. */
1999 init_insn_eh_region (first, max_uid);
2005 /* Output the insns. */
2006 for (insn = NEXT_INSN (first); insn;)
2008 #ifdef HAVE_ATTR_length
2009 insn_current_address = insn_addresses[INSN_UID (insn)];
2011 insn = final_scan_insn (insn, file, optimize, prescan, 0);
2014 /* Do basic-block profiling here
2015 if the last insn was a conditional branch. */
2016 if (profile_block_flag && new_block)
2019 free_insn_eh_region ();
2022 /* The final scan for one insn, INSN.
2023 Args are same as in `final', except that INSN
2024 is the insn being scanned.
2025 Value returned is the next insn to be scanned.
2027 NOPEEPHOLES is the flag to disallow peephole processing (currently
2028 used for within delayed branch sequence output). */
2031 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
2045 /* Ignore deleted insns. These can occur when we split insns (due to a
2046 template of "#") while not optimizing. */
2047 if (INSN_DELETED_P (insn))
2048 return NEXT_INSN (insn);
2050 switch (GET_CODE (insn))
2056 /* Align the beginning of a loop, for higher speed
2057 on certain machines. */
2059 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
2060 break; /* This used to depend on optimize, but that was bogus. */
2061 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END)
2064 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG
2065 && ! exceptions_via_longjmp)
2067 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHB", NOTE_BLOCK_NUMBER (insn));
2068 if (! flag_new_exceptions)
2069 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn));
2070 #ifdef ASM_OUTPUT_EH_REGION_BEG
2071 ASM_OUTPUT_EH_REGION_BEG (file, NOTE_BLOCK_NUMBER (insn));
2076 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END
2077 && ! exceptions_via_longjmp)
2079 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHE", NOTE_BLOCK_NUMBER (insn));
2080 if (flag_new_exceptions)
2081 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn));
2082 #ifdef ASM_OUTPUT_EH_REGION_END
2083 ASM_OUTPUT_EH_REGION_END (file, NOTE_BLOCK_NUMBER (insn));
2088 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
2090 #ifdef FUNCTION_END_PROLOGUE
2091 FUNCTION_END_PROLOGUE (file);
2093 profile_after_prologue (file);
2097 #ifdef FUNCTION_BEGIN_EPILOGUE
2098 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
2100 FUNCTION_BEGIN_EPILOGUE (file);
2105 if (write_symbols == NO_DEBUG)
2107 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
2109 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
2110 /* MIPS stabs require the parameter descriptions to be after the
2111 function entry point rather than before. */
2112 if (write_symbols == SDB_DEBUG)
2113 sdbout_begin_function (last_linenum);
2116 #ifdef DWARF_DEBUGGING_INFO
2117 /* This outputs a marker where the function body starts, so it
2118 must be after the prologue. */
2119 if (write_symbols == DWARF_DEBUG)
2120 dwarfout_begin_function ();
2124 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED)
2125 break; /* An insn that was "deleted" */
2128 fputs (ASM_APP_OFF, file);
2131 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG
2132 && (debug_info_level == DINFO_LEVEL_NORMAL
2133 || debug_info_level == DINFO_LEVEL_VERBOSE
2134 || write_symbols == DWARF_DEBUG
2135 || write_symbols == DWARF2_DEBUG))
2137 /* Beginning of a symbol-block. Assign it a sequence number
2138 and push the number onto the stack PENDING_BLOCKS. */
2140 if (block_depth == max_block_depth)
2142 /* PENDING_BLOCKS is full; make it longer. */
2143 max_block_depth *= 2;
2145 = (int *) xrealloc (pending_blocks,
2146 max_block_depth * sizeof (int));
2148 pending_blocks[block_depth++] = next_block_index;
2150 high_block_linenum = last_linenum;
2152 /* Output debugging info about the symbol-block beginning. */
2154 #ifdef SDB_DEBUGGING_INFO
2155 if (write_symbols == SDB_DEBUG)
2156 sdbout_begin_block (file, last_linenum, next_block_index);
2158 #ifdef XCOFF_DEBUGGING_INFO
2159 if (write_symbols == XCOFF_DEBUG)
2160 xcoffout_begin_block (file, last_linenum, next_block_index);
2162 #ifdef DBX_DEBUGGING_INFO
2163 if (write_symbols == DBX_DEBUG)
2164 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", next_block_index);
2166 #ifdef DWARF_DEBUGGING_INFO
2167 if (write_symbols == DWARF_DEBUG)
2168 dwarfout_begin_block (next_block_index);
2170 #ifdef DWARF2_DEBUGGING_INFO
2171 if (write_symbols == DWARF2_DEBUG)
2172 dwarf2out_begin_block (next_block_index);
2177 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END
2178 && (debug_info_level == DINFO_LEVEL_NORMAL
2179 || debug_info_level == DINFO_LEVEL_VERBOSE
2180 || write_symbols == DWARF_DEBUG
2181 || write_symbols == DWARF2_DEBUG))
2183 /* End of a symbol-block. Pop its sequence number off
2184 PENDING_BLOCKS and output debugging info based on that. */
2188 #ifdef XCOFF_DEBUGGING_INFO
2189 if (write_symbols == XCOFF_DEBUG && block_depth >= 0)
2190 xcoffout_end_block (file, high_block_linenum,
2191 pending_blocks[block_depth]);
2193 #ifdef DBX_DEBUGGING_INFO
2194 if (write_symbols == DBX_DEBUG && block_depth >= 0)
2195 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE",
2196 pending_blocks[block_depth]);
2198 #ifdef SDB_DEBUGGING_INFO
2199 if (write_symbols == SDB_DEBUG && block_depth >= 0)
2200 sdbout_end_block (file, high_block_linenum,
2201 pending_blocks[block_depth]);
2203 #ifdef DWARF_DEBUGGING_INFO
2204 if (write_symbols == DWARF_DEBUG && block_depth >= 0)
2205 dwarfout_end_block (pending_blocks[block_depth]);
2207 #ifdef DWARF2_DEBUGGING_INFO
2208 if (write_symbols == DWARF2_DEBUG && block_depth >= 0)
2209 dwarf2out_end_block (pending_blocks[block_depth]);
2212 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL
2213 && (debug_info_level == DINFO_LEVEL_NORMAL
2214 || debug_info_level == DINFO_LEVEL_VERBOSE))
2216 #ifdef DWARF_DEBUGGING_INFO
2217 if (write_symbols == DWARF_DEBUG)
2218 dwarfout_label (insn);
2220 #ifdef DWARF2_DEBUGGING_INFO
2221 if (write_symbols == DWARF2_DEBUG)
2222 dwarf2out_label (insn);
2225 else if (NOTE_LINE_NUMBER (insn) > 0)
2226 /* This note is a line-number. */
2230 #if 0 /* This is what we used to do. */
2231 output_source_line (file, insn);
2235 /* If there is anything real after this note,
2236 output it. If another line note follows, omit this one. */
2237 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
2239 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
2241 /* These types of notes can be significant
2242 so make sure the preceding line number stays. */
2243 else if (GET_CODE (note) == NOTE
2244 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
2245 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
2246 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
2248 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
2250 /* Another line note follows; we can delete this note
2251 if no intervening line numbers have notes elsewhere. */
2253 for (num = NOTE_LINE_NUMBER (insn) + 1;
2254 num < NOTE_LINE_NUMBER (note);
2256 if (line_note_exists[num])
2259 if (num >= NOTE_LINE_NUMBER (note))
2265 /* Output this line note
2266 if it is the first or the last line note in a row. */
2268 output_source_line (file, insn);
2273 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2274 /* If we push arguments, we need to check all insns for stack
2276 if (dwarf2out_do_frame ())
2277 dwarf2out_frame_debug (insn);
2282 /* The target port might emit labels in the output function for
2283 some insn, e.g. sh.c output_branchy_insn. */
2284 if (CODE_LABEL_NUMBER (insn) <= max_labelno)
2286 int align = LABEL_TO_ALIGNMENT (insn);
2287 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2288 int max_skip = LABEL_TO_MAX_SKIP (insn);
2291 if (align && NEXT_INSN (insn))
2292 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2293 ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip);
2295 ASM_OUTPUT_ALIGN (file, align);
2300 /* If this label is reached from only one place, set the condition
2301 codes from the instruction just before the branch. */
2303 /* Disabled because some insns set cc_status in the C output code
2304 and NOTICE_UPDATE_CC alone can set incorrect status. */
2305 if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
2307 rtx jump = LABEL_REFS (insn);
2308 rtx barrier = prev_nonnote_insn (insn);
2310 /* If the LABEL_REFS field of this label has been set to point
2311 at a branch, the predecessor of the branch is a regular
2312 insn, and that branch is the only way to reach this label,
2313 set the condition codes based on the branch and its
2315 if (barrier && GET_CODE (barrier) == BARRIER
2316 && jump && GET_CODE (jump) == JUMP_INSN
2317 && (prev = prev_nonnote_insn (jump))
2318 && GET_CODE (prev) == INSN)
2320 NOTICE_UPDATE_CC (PATTERN (prev), prev);
2321 NOTICE_UPDATE_CC (PATTERN (jump), jump);
2329 #ifdef FINAL_PRESCAN_LABEL
2330 FINAL_PRESCAN_INSN (insn, NULL_PTR, 0);
2333 #ifdef SDB_DEBUGGING_INFO
2334 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
2335 sdbout_label (insn);
2337 #ifdef DWARF_DEBUGGING_INFO
2338 if (write_symbols == DWARF_DEBUG && LABEL_NAME (insn))
2339 dwarfout_label (insn);
2341 #ifdef DWARF2_DEBUGGING_INFO
2342 if (write_symbols == DWARF2_DEBUG && LABEL_NAME (insn))
2343 dwarf2out_label (insn);
2347 fputs (ASM_APP_OFF, file);
2350 if (NEXT_INSN (insn) != 0
2351 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
2353 rtx nextbody = PATTERN (NEXT_INSN (insn));
2355 /* If this label is followed by a jump-table,
2356 make sure we put the label in the read-only section. Also
2357 possibly write the label and jump table together. */
2359 if (GET_CODE (nextbody) == ADDR_VEC
2360 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
2362 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2363 /* In this case, the case vector is being moved by the
2364 target, so don't output the label at all. Leave that
2365 to the back end macros. */
2367 if (! JUMP_TABLES_IN_TEXT_SECTION)
2369 readonly_data_section ();
2370 #ifdef READONLY_DATA_SECTION
2371 ASM_OUTPUT_ALIGN (file,
2372 exact_log2 (BIGGEST_ALIGNMENT
2374 #endif /* READONLY_DATA_SECTION */
2377 function_section (current_function_decl);
2379 #ifdef ASM_OUTPUT_CASE_LABEL
2380 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
2383 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2390 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2395 register rtx body = PATTERN (insn);
2396 int insn_code_number;
2402 /* An INSN, JUMP_INSN or CALL_INSN.
2403 First check for special kinds that recog doesn't recognize. */
2405 if (GET_CODE (body) == USE /* These are just declarations */
2406 || GET_CODE (body) == CLOBBER)
2410 /* If there is a REG_CC_SETTER note on this insn, it means that
2411 the setting of the condition code was done in the delay slot
2412 of the insn that branched here. So recover the cc status
2413 from the insn that set it. */
2415 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
2418 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
2419 cc_prev_status = cc_status;
2423 /* Detect insns that are really jump-tables
2424 and output them as such. */
2426 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
2428 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2429 register int vlen, idx;
2437 fputs (ASM_APP_OFF, file);
2441 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2442 if (GET_CODE (body) == ADDR_VEC)
2444 #ifdef ASM_OUTPUT_ADDR_VEC
2445 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2452 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2453 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2459 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
2460 for (idx = 0; idx < vlen; idx++)
2462 if (GET_CODE (body) == ADDR_VEC)
2464 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2465 ASM_OUTPUT_ADDR_VEC_ELT
2466 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
2473 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2474 ASM_OUTPUT_ADDR_DIFF_ELT
2477 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
2478 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
2484 #ifdef ASM_OUTPUT_CASE_END
2485 ASM_OUTPUT_CASE_END (file,
2486 CODE_LABEL_NUMBER (PREV_INSN (insn)),
2491 function_section (current_function_decl);
2496 /* Do basic-block profiling when we reach a new block.
2497 Done here to avoid jump tables. */
2498 if (profile_block_flag && new_block)
2501 if (GET_CODE (body) == ASM_INPUT)
2503 /* There's no telling what that did to the condition codes. */
2509 fputs (ASM_APP_ON, file);
2512 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
2516 /* Detect `asm' construct with operands. */
2517 if (asm_noperands (body) >= 0)
2519 unsigned int noperands = asm_noperands (body);
2520 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
2523 /* There's no telling what that did to the condition codes. */
2530 fputs (ASM_APP_ON, file);
2534 /* Get out the operand values. */
2535 string = decode_asm_operands (body, ops, NULL_PTR,
2536 NULL_PTR, NULL_PTR);
2537 /* Inhibit aborts on what would otherwise be compiler bugs. */
2538 insn_noperands = noperands;
2539 this_is_asm_operands = insn;
2541 /* Output the insn using them. */
2542 output_asm_insn (string, ops);
2543 this_is_asm_operands = 0;
2547 if (prescan <= 0 && app_on)
2549 fputs (ASM_APP_OFF, file);
2553 if (GET_CODE (body) == SEQUENCE)
2555 /* A delayed-branch sequence */
2561 final_sequence = body;
2563 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2564 force the restoration of a comparison that was previously
2565 thought unnecessary. If that happens, cancel this sequence
2566 and cause that insn to be restored. */
2568 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
2569 if (next != XVECEXP (body, 0, 1))
2575 for (i = 1; i < XVECLEN (body, 0); i++)
2577 rtx insn = XVECEXP (body, 0, i);
2578 rtx next = NEXT_INSN (insn);
2579 /* We loop in case any instruction in a delay slot gets
2582 insn = final_scan_insn (insn, file, 0, prescan, 1);
2583 while (insn != next);
2585 #ifdef DBR_OUTPUT_SEQEND
2586 DBR_OUTPUT_SEQEND (file);
2590 /* If the insn requiring the delay slot was a CALL_INSN, the
2591 insns in the delay slot are actually executed before the
2592 called function. Hence we don't preserve any CC-setting
2593 actions in these insns and the CC must be marked as being
2594 clobbered by the function. */
2595 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
2600 /* Following a conditional branch sequence, we have a new basic
2602 if (profile_block_flag)
2604 rtx insn = XVECEXP (body, 0, 0);
2605 rtx body = PATTERN (insn);
2607 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2608 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2609 || (GET_CODE (insn) == JUMP_INSN
2610 && GET_CODE (body) == PARALLEL
2611 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2612 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
2618 /* We have a real machine instruction as rtl. */
2620 body = PATTERN (insn);
2623 set = single_set(insn);
2625 /* Check for redundant test and compare instructions
2626 (when the condition codes are already set up as desired).
2627 This is done only when optimizing; if not optimizing,
2628 it should be possible for the user to alter a variable
2629 with the debugger in between statements
2630 and the next statement should reexamine the variable
2631 to compute the condition codes. */
2636 rtx set = single_set(insn);
2640 && GET_CODE (SET_DEST (set)) == CC0
2641 && insn != last_ignored_compare)
2643 if (GET_CODE (SET_SRC (set)) == SUBREG)
2644 SET_SRC (set) = alter_subreg (SET_SRC (set));
2645 else if (GET_CODE (SET_SRC (set)) == COMPARE)
2647 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
2648 XEXP (SET_SRC (set), 0)
2649 = alter_subreg (XEXP (SET_SRC (set), 0));
2650 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
2651 XEXP (SET_SRC (set), 1)
2652 = alter_subreg (XEXP (SET_SRC (set), 1));
2654 if ((cc_status.value1 != 0
2655 && rtx_equal_p (SET_SRC (set), cc_status.value1))
2656 || (cc_status.value2 != 0
2657 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
2659 /* Don't delete insn if it has an addressing side-effect. */
2660 if (! FIND_REG_INC_NOTE (insn, 0)
2661 /* or if anything in it is volatile. */
2662 && ! volatile_refs_p (PATTERN (insn)))
2664 /* We don't really delete the insn; just ignore it. */
2665 last_ignored_compare = insn;
2673 /* Following a conditional branch, we have a new basic block.
2674 But if we are inside a sequence, the new block starts after the
2675 last insn of the sequence. */
2676 if (profile_block_flag && final_sequence == 0
2677 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2678 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2679 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
2680 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2681 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
2685 /* Don't bother outputting obvious no-ops, even without -O.
2686 This optimization is fast and doesn't interfere with debugging.
2687 Don't do this if the insn is in a delay slot, since this
2688 will cause an improper number of delay insns to be written. */
2689 if (final_sequence == 0
2691 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
2692 && GET_CODE (SET_SRC (body)) == REG
2693 && GET_CODE (SET_DEST (body)) == REG
2694 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
2699 /* If this is a conditional branch, maybe modify it
2700 if the cc's are in a nonstandard state
2701 so that it accomplishes the same thing that it would
2702 do straightforwardly if the cc's were set up normally. */
2704 if (cc_status.flags != 0
2705 && GET_CODE (insn) == JUMP_INSN
2706 && GET_CODE (body) == SET
2707 && SET_DEST (body) == pc_rtx
2708 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
2709 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
2710 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
2711 /* This is done during prescan; it is not done again
2712 in final scan when prescan has been done. */
2715 /* This function may alter the contents of its argument
2716 and clear some of the cc_status.flags bits.
2717 It may also return 1 meaning condition now always true
2718 or -1 meaning condition now always false
2719 or 2 meaning condition nontrivial but altered. */
2720 register int result = alter_cond (XEXP (SET_SRC (body), 0));
2721 /* If condition now has fixed value, replace the IF_THEN_ELSE
2722 with its then-operand or its else-operand. */
2724 SET_SRC (body) = XEXP (SET_SRC (body), 1);
2726 SET_SRC (body) = XEXP (SET_SRC (body), 2);
2728 /* The jump is now either unconditional or a no-op.
2729 If it has become a no-op, don't try to output it.
2730 (It would not be recognized.) */
2731 if (SET_SRC (body) == pc_rtx)
2733 PUT_CODE (insn, NOTE);
2734 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2735 NOTE_SOURCE_FILE (insn) = 0;
2738 else if (GET_CODE (SET_SRC (body)) == RETURN)
2739 /* Replace (set (pc) (return)) with (return). */
2740 PATTERN (insn) = body = SET_SRC (body);
2742 /* Rerecognize the instruction if it has changed. */
2744 INSN_CODE (insn) = -1;
2747 /* Make same adjustments to instructions that examine the
2748 condition codes without jumping and instructions that
2749 handle conditional moves (if this machine has either one). */
2751 if (cc_status.flags != 0
2754 rtx cond_rtx, then_rtx, else_rtx;
2756 if (GET_CODE (insn) != JUMP_INSN
2757 && GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
2759 cond_rtx = XEXP (SET_SRC (set), 0);
2760 then_rtx = XEXP (SET_SRC (set), 1);
2761 else_rtx = XEXP (SET_SRC (set), 2);
2765 cond_rtx = SET_SRC (set);
2766 then_rtx = const_true_rtx;
2767 else_rtx = const0_rtx;
2770 switch (GET_CODE (cond_rtx))
2783 register int result;
2784 if (XEXP (cond_rtx, 0) != cc0_rtx)
2786 result = alter_cond (cond_rtx);
2788 validate_change (insn, &SET_SRC (set), then_rtx, 0);
2789 else if (result == -1)
2790 validate_change (insn, &SET_SRC (set), else_rtx, 0);
2791 else if (result == 2)
2792 INSN_CODE (insn) = -1;
2793 if (SET_DEST (set) == SET_SRC (set))
2795 PUT_CODE (insn, NOTE);
2796 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2797 NOTE_SOURCE_FILE (insn) = 0;
2809 /* Do machine-specific peephole optimizations if desired. */
2811 if (optimize && !flag_no_peephole && !nopeepholes)
2813 rtx next = peephole (insn);
2814 /* When peepholing, if there were notes within the peephole,
2815 emit them before the peephole. */
2816 if (next != 0 && next != NEXT_INSN (insn))
2818 rtx prev = PREV_INSN (insn);
2821 for (note = NEXT_INSN (insn); note != next;
2822 note = NEXT_INSN (note))
2823 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2825 /* In case this is prescan, put the notes
2826 in proper position for later rescan. */
2827 note = NEXT_INSN (insn);
2828 PREV_INSN (note) = prev;
2829 NEXT_INSN (prev) = note;
2830 NEXT_INSN (PREV_INSN (next)) = insn;
2831 PREV_INSN (insn) = PREV_INSN (next);
2832 NEXT_INSN (insn) = next;
2833 PREV_INSN (next) = insn;
2836 /* PEEPHOLE might have changed this. */
2837 body = PATTERN (insn);
2840 /* Try to recognize the instruction.
2841 If successful, verify that the operands satisfy the
2842 constraints for the instruction. Crash if they don't,
2843 since `reload' should have changed them so that they do. */
2845 insn_code_number = recog_memoized (insn);
2846 extract_insn (insn);
2847 cleanup_subreg_operands (insn);
2849 #ifdef REGISTER_CONSTRAINTS
2850 if (! constrain_operands (1))
2851 fatal_insn_not_found (insn);
2854 /* Some target machines need to prescan each insn before
2857 #ifdef FINAL_PRESCAN_INSN
2858 FINAL_PRESCAN_INSN (insn, recog_operand, recog_n_operands);
2862 cc_prev_status = cc_status;
2864 /* Update `cc_status' for this instruction.
2865 The instruction's output routine may change it further.
2866 If the output routine for a jump insn needs to depend
2867 on the cc status, it should look at cc_prev_status. */
2869 NOTICE_UPDATE_CC (body, insn);
2874 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2875 /* If we push arguments, we want to know where the calls are. */
2876 if (GET_CODE (insn) == CALL_INSN && dwarf2out_do_frame ())
2877 dwarf2out_frame_debug (insn);
2880 /* If the proper template needs to be chosen by some C code,
2881 run that code and get the real template. */
2883 template = insn_template[insn_code_number];
2886 template = (*insn_outfun[insn_code_number]) (recog_operand, insn);
2888 /* If the C code returns 0, it means that it is a jump insn
2889 which follows a deleted test insn, and that test insn
2890 needs to be reinserted. */
2893 if (prev_nonnote_insn (insn) != last_ignored_compare)
2896 return prev_nonnote_insn (insn);
2900 /* If the template is the string "#", it means that this insn must
2902 if (template[0] == '#' && template[1] == '\0')
2904 rtx new = try_split (body, insn, 0);
2906 /* If we didn't split the insn, go away. */
2907 if (new == insn && PATTERN (new) == body)
2908 fatal_insn ("Could not split insn", insn);
2910 #ifdef HAVE_ATTR_length
2911 /* This instruction should have been split in shorten_branches,
2912 to ensure that we would have valid length info for the
2924 /* Output assembler code from the template. */
2926 output_asm_insn (template, recog_operand);
2928 #if defined (DWARF2_UNWIND_INFO)
2929 #if !defined (ACCUMULATE_OUTGOING_ARGS)
2930 /* If we push arguments, we need to check all insns for stack
2932 if (GET_CODE (insn) == INSN && dwarf2out_do_frame ())
2933 dwarf2out_frame_debug (insn);
2935 #if defined (HAVE_prologue)
2936 /* If this insn is part of the prologue, emit DWARF v2
2938 if (RTX_FRAME_RELATED_P (insn) && dwarf2out_do_frame ())
2939 dwarf2out_frame_debug (insn);
2945 /* It's not at all clear why we did this and doing so interferes
2946 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2949 /* Mark this insn as having been output. */
2950 INSN_DELETED_P (insn) = 1;
2956 return NEXT_INSN (insn);
2959 /* Output debugging info to the assembler file FILE
2960 based on the NOTE-insn INSN, assumed to be a line number. */
2963 output_source_line (file, insn)
2967 register char *filename = NOTE_SOURCE_FILE (insn);
2969 /* Remember filename for basic block profiling.
2970 Filenames are allocated on the permanent obstack
2971 or are passed in ARGV, so we don't have to save
2974 if (profile_block_flag && last_filename != filename)
2975 bb_file_label_num = add_bb_string (filename, TRUE);
2977 last_filename = filename;
2978 last_linenum = NOTE_LINE_NUMBER (insn);
2979 high_block_linenum = MAX (last_linenum, high_block_linenum);
2980 high_function_linenum = MAX (last_linenum, high_function_linenum);
2982 if (write_symbols != NO_DEBUG)
2984 #ifdef SDB_DEBUGGING_INFO
2985 if (write_symbols == SDB_DEBUG
2986 #if 0 /* People like having line numbers even in wrong file! */
2987 /* COFF can't handle multiple source files--lose, lose. */
2988 && !strcmp (filename, main_input_filename)
2990 /* COFF relative line numbers must be positive. */
2991 && last_linenum > sdb_begin_function_line)
2993 #ifdef ASM_OUTPUT_SOURCE_LINE
2994 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
2996 fprintf (file, "\t.ln\t%d\n",
2997 ((sdb_begin_function_line > -1)
2998 ? last_linenum - sdb_begin_function_line : 1));
3003 #if defined (DBX_DEBUGGING_INFO)
3004 if (write_symbols == DBX_DEBUG)
3005 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
3008 #if defined (XCOFF_DEBUGGING_INFO)
3009 if (write_symbols == XCOFF_DEBUG)
3010 xcoffout_source_line (file, filename, insn);
3013 #ifdef DWARF_DEBUGGING_INFO
3014 if (write_symbols == DWARF_DEBUG)
3015 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
3018 #ifdef DWARF2_DEBUGGING_INFO
3019 if (write_symbols == DWARF2_DEBUG)
3020 dwarf2out_line (filename, NOTE_LINE_NUMBER (insn));
3026 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3027 directly to the desired hard register. */
3029 cleanup_subreg_operands (insn)
3032 int insn_code_number, i;
3034 /* Ignore things we can not handle. */
3035 if (GET_RTX_CLASS (GET_CODE (insn)) != 'i'
3036 || GET_CODE (PATTERN (insn)) == USE
3037 || GET_CODE (PATTERN (insn)) == ADDR_VEC
3038 || GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC
3039 || GET_CODE (PATTERN (insn)) == ASM_INPUT
3040 || asm_noperands (PATTERN (insn)) >= 0)
3043 /* Try to recognize the instruction.
3044 If successful, verify that the operands satisfy the
3045 constraints for the instruction. Crash if they don't,
3046 since `reload' should have changed them so that they do. */
3048 insn_code_number = recog_memoized (insn);
3049 extract_insn (insn);
3050 for (i = 0; i < recog_n_operands; i++)
3052 if (GET_CODE (recog_operand[i]) == SUBREG)
3053 recog_operand[i] = alter_subreg (recog_operand[i]);
3054 else if (GET_CODE (recog_operand[i]) == PLUS
3055 || GET_CODE (recog_operand[i]) == MULT)
3056 recog_operand[i] = walk_alter_subreg (recog_operand[i]);
3059 for (i = 0; i < recog_n_dups; i++)
3061 if (GET_CODE (*recog_dup_loc[i]) == SUBREG)
3062 *recog_dup_loc[i] = alter_subreg (*recog_dup_loc[i]);
3063 else if (GET_CODE (*recog_dup_loc[i]) == PLUS
3064 || GET_CODE (*recog_dup_loc[i]) == MULT)
3065 *recog_dup_loc[i] = walk_alter_subreg (*recog_dup_loc[i]);
3069 /* If X is a SUBREG, replace it with a REG or a MEM,
3070 based on the thing it is a subreg of. */
3076 register rtx y = SUBREG_REG (x);
3078 if (GET_CODE (y) == SUBREG)
3079 y = alter_subreg (y);
3081 /* If reload is operating, we may be replacing inside this SUBREG.
3082 Check for that and make a new one if so. */
3083 if (reload_in_progress && find_replacement (&SUBREG_REG (x)) != 0)
3086 if (GET_CODE (y) == REG)
3088 /* If the word size is larger than the size of this register,
3089 adjust the register number to compensate. */
3090 /* ??? Note that this just catches stragglers created by/for
3091 integrate. It would be better if we either caught these
3092 earlier, or kept _all_ subregs until now and eliminate
3093 gen_lowpart and friends. */
3096 #ifdef ALTER_HARD_SUBREG
3097 REGNO (x) = ALTER_HARD_SUBREG(GET_MODE (x), SUBREG_WORD (x),
3098 GET_MODE (y), REGNO (y));
3100 REGNO (x) = REGNO (y) + SUBREG_WORD (x);
3102 /* This field has a different meaning for REGs and SUBREGs. Make sure
3106 else if (GET_CODE (y) == MEM)
3108 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
3109 if (BYTES_BIG_ENDIAN)
3110 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
3111 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
3113 MEM_VOLATILE_P (x) = MEM_VOLATILE_P (y);
3114 MEM_IN_STRUCT_P (x) = MEM_IN_STRUCT_P (y);
3115 MEM_ALIAS_SET (x) = MEM_ALIAS_SET (y);
3116 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
3122 /* Do alter_subreg on all the SUBREGs contained in X. */
3125 walk_alter_subreg (x)
3128 switch (GET_CODE (x))
3132 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3133 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
3137 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3141 return alter_subreg (x);
3152 /* Given BODY, the body of a jump instruction, alter the jump condition
3153 as required by the bits that are set in cc_status.flags.
3154 Not all of the bits there can be handled at this level in all cases.
3156 The value is normally 0.
3157 1 means that the condition has become always true.
3158 -1 means that the condition has become always false.
3159 2 means that COND has been altered. */
3167 if (cc_status.flags & CC_REVERSED)
3170 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
3173 if (cc_status.flags & CC_INVERTED)
3176 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
3179 if (cc_status.flags & CC_NOT_POSITIVE)
3180 switch (GET_CODE (cond))
3185 /* Jump becomes unconditional. */
3191 /* Jump becomes no-op. */
3195 PUT_CODE (cond, EQ);
3200 PUT_CODE (cond, NE);
3208 if (cc_status.flags & CC_NOT_NEGATIVE)
3209 switch (GET_CODE (cond))
3213 /* Jump becomes unconditional. */
3218 /* Jump becomes no-op. */
3223 PUT_CODE (cond, EQ);
3229 PUT_CODE (cond, NE);
3237 if (cc_status.flags & CC_NO_OVERFLOW)
3238 switch (GET_CODE (cond))
3241 /* Jump becomes unconditional. */
3245 PUT_CODE (cond, EQ);
3250 PUT_CODE (cond, NE);
3255 /* Jump becomes no-op. */
3262 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
3263 switch (GET_CODE (cond))
3269 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
3274 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
3279 if (cc_status.flags & CC_NOT_SIGNED)
3280 /* The flags are valid if signed condition operators are converted
3282 switch (GET_CODE (cond))
3285 PUT_CODE (cond, LEU);
3290 PUT_CODE (cond, LTU);
3295 PUT_CODE (cond, GTU);
3300 PUT_CODE (cond, GEU);
3312 /* Report inconsistency between the assembler template and the operands.
3313 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3316 output_operand_lossage (str)
3319 if (this_is_asm_operands)
3320 error_for_asm (this_is_asm_operands, "invalid `asm': %s", str);
3322 fatal ("Internal compiler error, output_operand_lossage `%s'", str);
3325 /* Output of assembler code from a template, and its subroutines. */
3327 /* Output text from TEMPLATE to the assembler output file,
3328 obeying %-directions to substitute operands taken from
3329 the vector OPERANDS.
3331 %N (for N a digit) means print operand N in usual manner.
3332 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3333 and print the label name with no punctuation.
3334 %cN means require operand N to be a constant
3335 and print the constant expression with no punctuation.
3336 %aN means expect operand N to be a memory address
3337 (not a memory reference!) and print a reference
3339 %nN means expect operand N to be a constant
3340 and print a constant expression for minus the value
3341 of the operand, with no other punctuation. */
3346 if (flag_print_asm_name)
3348 /* Annotate the assembly with a comment describing the pattern and
3349 alternative used. */
3352 register int num = INSN_CODE (debug_insn);
3353 fprintf (asm_out_file, " %s %d %s",
3354 ASM_COMMENT_START, INSN_UID (debug_insn), insn_name[num]);
3355 if (insn_n_alternatives[num] > 1)
3356 fprintf (asm_out_file, "/%d", which_alternative + 1);
3358 /* Clear this so only the first assembler insn
3359 of any rtl insn will get the special comment for -dp. */
3366 output_asm_insn (template, operands)
3373 /* An insn may return a null string template
3374 in a case where no assembler code is needed. */
3379 putc ('\t', asm_out_file);
3381 #ifdef ASM_OUTPUT_OPCODE
3382 ASM_OUTPUT_OPCODE (asm_out_file, p);
3390 putc (c, asm_out_file);
3391 #ifdef ASM_OUTPUT_OPCODE
3392 while ((c = *p) == '\t')
3394 putc (c, asm_out_file);
3397 ASM_OUTPUT_OPCODE (asm_out_file, p);
3401 #ifdef ASSEMBLER_DIALECT
3406 /* If we want the first dialect, do nothing. Otherwise, skip
3407 DIALECT_NUMBER of strings ending with '|'. */
3408 for (i = 0; i < dialect_number; i++)
3410 while (*p && *p++ != '|')
3420 /* Skip to close brace. */
3421 while (*p && *p++ != '}')
3430 /* %% outputs a single %. */
3434 putc (c, asm_out_file);
3436 /* %= outputs a number which is unique to each insn in the entire
3437 compilation. This is useful for making local labels that are
3438 referred to more than once in a given insn. */
3442 fprintf (asm_out_file, "%d", insn_counter);
3444 /* % followed by a letter and some digits
3445 outputs an operand in a special way depending on the letter.
3446 Letters `acln' are implemented directly.
3447 Other letters are passed to `output_operand' so that
3448 the PRINT_OPERAND macro can define them. */
3449 else if ((*p >= 'a' && *p <= 'z')
3450 || (*p >= 'A' && *p <= 'Z'))
3455 if (! (*p >= '0' && *p <= '9'))
3456 output_operand_lossage ("operand number missing after %-letter");
3457 else if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3458 output_operand_lossage ("operand number out of range");
3459 else if (letter == 'l')
3460 output_asm_label (operands[c]);
3461 else if (letter == 'a')
3462 output_address (operands[c]);
3463 else if (letter == 'c')
3465 if (CONSTANT_ADDRESS_P (operands[c]))
3466 output_addr_const (asm_out_file, operands[c]);
3468 output_operand (operands[c], 'c');
3470 else if (letter == 'n')
3472 if (GET_CODE (operands[c]) == CONST_INT)
3473 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
3474 - INTVAL (operands[c]));
3477 putc ('-', asm_out_file);
3478 output_addr_const (asm_out_file, operands[c]);
3482 output_operand (operands[c], letter);
3484 while ((c = *p) >= '0' && c <= '9') p++;
3486 /* % followed by a digit outputs an operand the default way. */
3487 else if (*p >= '0' && *p <= '9')
3490 if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3491 output_operand_lossage ("operand number out of range");
3493 output_operand (operands[c], 0);
3494 while ((c = *p) >= '0' && c <= '9') p++;
3496 /* % followed by punctuation: output something for that
3497 punctuation character alone, with no operand.
3498 The PRINT_OPERAND macro decides what is actually done. */
3499 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3500 else if (PRINT_OPERAND_PUNCT_VALID_P (*p))
3501 output_operand (NULL_RTX, *p++);
3504 output_operand_lossage ("invalid %%-code");
3508 putc (c, asm_out_file);
3513 putc ('\n', asm_out_file);
3516 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3519 output_asm_label (x)
3524 if (GET_CODE (x) == LABEL_REF)
3525 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3526 else if (GET_CODE (x) == CODE_LABEL)
3527 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3529 output_operand_lossage ("`%l' operand isn't a label");
3531 assemble_name (asm_out_file, buf);
3534 /* Print operand X using machine-dependent assembler syntax.
3535 The macro PRINT_OPERAND is defined just to control this function.
3536 CODE is a non-digit that preceded the operand-number in the % spec,
3537 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3538 between the % and the digits.
3539 When CODE is a non-letter, X is 0.
3541 The meanings of the letters are machine-dependent and controlled
3542 by PRINT_OPERAND. */
3545 output_operand (x, code)
3549 if (x && GET_CODE (x) == SUBREG)
3550 x = alter_subreg (x);
3552 /* If X is a pseudo-register, abort now rather than writing trash to the
3555 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
3558 PRINT_OPERAND (asm_out_file, x, code);
3561 /* Print a memory reference operand for address X
3562 using machine-dependent assembler syntax.
3563 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3569 walk_alter_subreg (x);
3570 PRINT_OPERAND_ADDRESS (asm_out_file, x);
3573 /* Print an integer constant expression in assembler syntax.
3574 Addition and subtraction are the only arithmetic
3575 that may appear in these expressions. */
3578 output_addr_const (file, x)
3585 switch (GET_CODE (x))
3595 assemble_name (file, XSTR (x, 0));
3599 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3600 assemble_name (file, buf);
3604 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3605 assemble_name (file, buf);
3609 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
3613 /* This used to output parentheses around the expression,
3614 but that does not work on the 386 (either ATT or BSD assembler). */
3615 output_addr_const (file, XEXP (x, 0));
3619 if (GET_MODE (x) == VOIDmode)
3621 /* We can use %d if the number is one word and positive. */
3622 if (CONST_DOUBLE_HIGH (x))
3623 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3624 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
3625 else if (CONST_DOUBLE_LOW (x) < 0)
3626 fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
3628 fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
3631 /* We can't handle floating point constants;
3632 PRINT_OPERAND must handle them. */
3633 output_operand_lossage ("floating constant misused");
3637 /* Some assemblers need integer constants to appear last (eg masm). */
3638 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
3640 output_addr_const (file, XEXP (x, 1));
3641 if (INTVAL (XEXP (x, 0)) >= 0)
3642 fprintf (file, "+");
3643 output_addr_const (file, XEXP (x, 0));
3647 output_addr_const (file, XEXP (x, 0));
3648 if (INTVAL (XEXP (x, 1)) >= 0)
3649 fprintf (file, "+");
3650 output_addr_const (file, XEXP (x, 1));
3655 /* Avoid outputting things like x-x or x+5-x,
3656 since some assemblers can't handle that. */
3657 x = simplify_subtraction (x);
3658 if (GET_CODE (x) != MINUS)
3661 output_addr_const (file, XEXP (x, 0));
3662 fprintf (file, "-");
3663 if (GET_CODE (XEXP (x, 1)) == CONST_INT
3664 && INTVAL (XEXP (x, 1)) < 0)
3666 fprintf (file, ASM_OPEN_PAREN);
3667 output_addr_const (file, XEXP (x, 1));
3668 fprintf (file, ASM_CLOSE_PAREN);
3671 output_addr_const (file, XEXP (x, 1));
3676 output_addr_const (file, XEXP (x, 0));
3680 output_operand_lossage ("invalid expression as operand");
3684 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3685 %R prints the value of REGISTER_PREFIX.
3686 %L prints the value of LOCAL_LABEL_PREFIX.
3687 %U prints the value of USER_LABEL_PREFIX.
3688 %I prints the value of IMMEDIATE_PREFIX.
3689 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3690 Also supported are %d, %x, %s, %e, %f, %g and %%.
3692 We handle alternate assembler dialects here, just like output_asm_insn. */
3695 asm_fprintf VPROTO((FILE *file, char *p, ...))
3697 #ifndef ANSI_PROTOTYPES
3705 VA_START (argptr, p);
3707 #ifndef ANSI_PROTOTYPES
3708 file = va_arg (argptr, FILE *);
3709 p = va_arg (argptr, char *);
3717 #ifdef ASSEMBLER_DIALECT
3722 /* If we want the first dialect, do nothing. Otherwise, skip
3723 DIALECT_NUMBER of strings ending with '|'. */
3724 for (i = 0; i < dialect_number; i++)
3726 while (*p && *p++ != '|')
3736 /* Skip to close brace. */
3737 while (*p && *p++ != '}')
3748 while ((c >= '0' && c <= '9') || c == '.')
3756 fprintf (file, "%%");
3759 case 'd': case 'i': case 'u':
3760 case 'x': case 'p': case 'X':
3764 fprintf (file, buf, va_arg (argptr, int));
3768 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3769 but we do not check for those cases. It means that the value
3770 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3772 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3774 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3784 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3791 fprintf (file, buf, va_arg (argptr, long));
3799 fprintf (file, buf, va_arg (argptr, double));
3805 fprintf (file, buf, va_arg (argptr, char *));
3809 #ifdef ASM_OUTPUT_OPCODE
3810 ASM_OUTPUT_OPCODE (asm_out_file, p);
3815 #ifdef REGISTER_PREFIX
3816 fprintf (file, "%s", REGISTER_PREFIX);
3821 #ifdef IMMEDIATE_PREFIX
3822 fprintf (file, "%s", IMMEDIATE_PREFIX);
3827 #ifdef LOCAL_LABEL_PREFIX
3828 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
3833 fputs (user_label_prefix, file);
3846 /* Split up a CONST_DOUBLE or integer constant rtx
3847 into two rtx's for single words,
3848 storing in *FIRST the word that comes first in memory in the target
3849 and in *SECOND the other. */
3852 split_double (value, first, second)
3854 rtx *first, *second;
3856 if (GET_CODE (value) == CONST_INT)
3858 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3860 /* In this case the CONST_INT holds both target words.
3861 Extract the bits from it into two word-sized pieces.
3862 Sign extend each half to HOST_WIDE_INT. */
3864 /* On machines where HOST_BITS_PER_WIDE_INT == BITS_PER_WORD
3865 the shift below will cause a compiler warning, even though
3866 this code won't be executed. So put the shift amounts in
3867 variables to avoid the warning. */
3868 int rshift = HOST_BITS_PER_WIDE_INT - BITS_PER_WORD;
3869 int lshift = HOST_BITS_PER_WIDE_INT - 2 * BITS_PER_WORD;
3871 low = GEN_INT ((INTVAL (value) << rshift) >> rshift);
3872 high = GEN_INT ((INTVAL (value) << lshift) >> rshift);
3873 if (WORDS_BIG_ENDIAN)
3886 /* The rule for using CONST_INT for a wider mode
3887 is that we regard the value as signed.
3888 So sign-extend it. */
3889 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
3890 if (WORDS_BIG_ENDIAN)
3902 else if (GET_CODE (value) != CONST_DOUBLE)
3904 if (WORDS_BIG_ENDIAN)
3906 *first = const0_rtx;
3912 *second = const0_rtx;
3915 else if (GET_MODE (value) == VOIDmode
3916 /* This is the old way we did CONST_DOUBLE integers. */
3917 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
3919 /* In an integer, the words are defined as most and least significant.
3920 So order them by the target's convention. */
3921 if (WORDS_BIG_ENDIAN)
3923 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3924 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3928 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3929 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3934 #ifdef REAL_ARITHMETIC
3935 REAL_VALUE_TYPE r; long l[2];
3936 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
3938 /* Note, this converts the REAL_VALUE_TYPE to the target's
3939 format, splits up the floating point double and outputs
3940 exactly 32 bits of it into each of l[0] and l[1] --
3941 not necessarily BITS_PER_WORD bits. */
3942 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
3944 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
3945 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
3947 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
3948 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
3949 && ! flag_pretend_float)
3953 #ifdef HOST_WORDS_BIG_ENDIAN
3960 /* Host and target agree => no need to swap. */
3961 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3962 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3966 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3967 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3969 #endif /* no REAL_ARITHMETIC */
3973 /* Return nonzero if this function has no function calls. */
3980 if (profile_flag || profile_block_flag || profile_arc_flag)
3983 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3985 if (GET_CODE (insn) == CALL_INSN)
3987 if (GET_CODE (insn) == INSN
3988 && GET_CODE (PATTERN (insn)) == SEQUENCE
3989 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN)
3992 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
3994 if (GET_CODE (XEXP (insn, 0)) == CALL_INSN)
3996 if (GET_CODE (XEXP (insn, 0)) == INSN
3997 && GET_CODE (PATTERN (XEXP (insn, 0))) == SEQUENCE
3998 && GET_CODE (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)) == CALL_INSN)
4005 /* On some machines, a function with no call insns
4006 can run faster if it doesn't create its own register window.
4007 When output, the leaf function should use only the "output"
4008 registers. Ordinarily, the function would be compiled to use
4009 the "input" registers to find its arguments; it is a candidate
4010 for leaf treatment if it uses only the "input" registers.
4011 Leaf function treatment means renumbering so the function
4012 uses the "output" registers instead. */
4014 #ifdef LEAF_REGISTERS
4016 static char permitted_reg_in_leaf_functions[] = LEAF_REGISTERS;
4018 /* Return 1 if this function uses only the registers that can be
4019 safely renumbered. */
4022 only_leaf_regs_used ()
4026 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4027 if ((regs_ever_live[i] || global_regs[i])
4028 && ! permitted_reg_in_leaf_functions[i])
4031 if (current_function_uses_pic_offset_table
4032 && pic_offset_table_rtx != 0
4033 && GET_CODE (pic_offset_table_rtx) == REG
4034 && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4040 /* Scan all instructions and renumber all registers into those
4041 available in leaf functions. */
4044 leaf_renumber_regs (first)
4049 /* Renumber only the actual patterns.
4050 The reg-notes can contain frame pointer refs,
4051 and renumbering them could crash, and should not be needed. */
4052 for (insn = first; insn; insn = NEXT_INSN (insn))
4053 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
4054 leaf_renumber_regs_insn (PATTERN (insn));
4055 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4056 if (GET_RTX_CLASS (GET_CODE (XEXP (insn, 0))) == 'i')
4057 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
4060 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4061 available in leaf functions. */
4064 leaf_renumber_regs_insn (in_rtx)
4065 register rtx in_rtx;
4068 register char *format_ptr;
4073 /* Renumber all input-registers into output-registers.
4074 renumbered_regs would be 1 for an output-register;
4077 if (GET_CODE (in_rtx) == REG)
4081 /* Don't renumber the same reg twice. */
4085 newreg = REGNO (in_rtx);
4086 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4087 to reach here as part of a REG_NOTE. */
4088 if (newreg >= FIRST_PSEUDO_REGISTER)
4093 newreg = LEAF_REG_REMAP (newreg);
4096 regs_ever_live[REGNO (in_rtx)] = 0;
4097 regs_ever_live[newreg] = 1;
4098 REGNO (in_rtx) = newreg;
4102 if (GET_RTX_CLASS (GET_CODE (in_rtx)) == 'i')
4104 /* Inside a SEQUENCE, we find insns.
4105 Renumber just the patterns of these insns,
4106 just as we do for the top-level insns. */
4107 leaf_renumber_regs_insn (PATTERN (in_rtx));
4111 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
4113 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
4114 switch (*format_ptr++)
4117 leaf_renumber_regs_insn (XEXP (in_rtx, i));
4121 if (NULL != XVEC (in_rtx, i))
4123 for (j = 0; j < XVECLEN (in_rtx, i); j++)
4124 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));