1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-98, 1999 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
21 /* $FreeBSD: src/contrib/gcc/final.c,v 1.7.2.3 2002/06/20 23:12:26 obrien Exp $ */
22 /* $DragonFly: src/contrib/gcc/Attic/final.c,v 1.2 2003/06/17 04:23:59 dillon Exp $ */
25 /* This is the final pass of the compiler.
26 It looks at the rtl code for a function and outputs assembler code.
28 Call `final_start_function' to output the assembler code for function entry,
29 `final' to output assembler code for some RTL code,
30 `final_end_function' to output assembler code for function exit.
31 If a function is compiled in several pieces, each piece is
32 output separately with `final'.
34 Some optimizations are also done at this level.
35 Move instructions that were made unnecessary by good register allocation
36 are detected and omitted from the output. (Though most of these
37 are removed by the last jump pass.)
39 Instructions to set the condition codes are omitted when it can be
40 seen that the condition codes already had the desired values.
42 In some cases it is sufficient if the inherited condition codes
43 have related values, but this may require the following insn
44 (the one that tests the condition codes) to be modified.
46 The code for the function prologue and epilogue are generated
47 directly as assembler code by the macros FUNCTION_PROLOGUE and
48 FUNCTION_EPILOGUE. Those instructions never exist as rtl. */
56 #include "insn-config.h"
57 #include "insn-flags.h"
58 #include "insn-attr.h"
59 #include "insn-codes.h"
61 #include "conditions.h"
64 #include "hard-reg-set.h"
72 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
73 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
75 #if defined (USG) || !defined (HAVE_STAB_H)
76 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
81 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
83 #ifdef XCOFF_DEBUGGING_INFO
87 #ifdef DWARF_DEBUGGING_INFO
91 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
92 #include "dwarf2out.h"
95 #ifdef SDB_DEBUGGING_INFO
99 /* .stabd code for line number. */
104 /* .stabs code for included file name. */
109 #ifndef INT_TYPE_SIZE
110 #define INT_TYPE_SIZE BITS_PER_WORD
113 #ifndef LONG_TYPE_SIZE
114 #define LONG_TYPE_SIZE BITS_PER_WORD
117 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
118 null default for it to save conditionalization later. */
119 #ifndef CC_STATUS_INIT
120 #define CC_STATUS_INIT
123 /* How to start an assembler comment. */
124 #ifndef ASM_COMMENT_START
125 #define ASM_COMMENT_START ";#"
128 /* Is the given character a logical line separator for the assembler? */
129 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
130 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
133 #ifndef JUMP_TABLES_IN_TEXT_SECTION
134 #define JUMP_TABLES_IN_TEXT_SECTION 0
137 /* Last insn processed by final_scan_insn. */
138 static rtx debug_insn = 0;
140 /* Line number of last NOTE. */
141 static int last_linenum;
143 /* Highest line number in current block. */
144 static int high_block_linenum;
146 /* Likewise for function. */
147 static int high_function_linenum;
149 /* Filename of last NOTE. */
150 static char *last_filename;
152 /* Number of basic blocks seen so far;
153 used if profile_block_flag is set. */
154 static int count_basic_blocks;
156 /* Number of instrumented arcs when profile_arc_flag is set. */
157 extern int count_instrumented_arcs;
159 extern int length_unit_log; /* This is defined in insn-attrtab.c. */
161 /* Nonzero while outputting an `asm' with operands.
162 This means that inconsistencies are the user's fault, so don't abort.
163 The precise value is the insn being output, to pass to error_for_asm. */
164 static rtx this_is_asm_operands;
166 /* Number of operands of this insn, for an `asm' with operands. */
167 static unsigned int insn_noperands;
169 /* Compare optimization flag. */
171 static rtx last_ignored_compare = 0;
173 /* Flag indicating this insn is the start of a new basic block. */
175 static int new_block = 1;
177 /* All the symbol-blocks (levels of scoping) in the compilation
178 are assigned sequence numbers in order of appearance of the
179 beginnings of the symbol-blocks. Both final and dbxout do this,
180 and assume that they will both give the same number to each block.
181 Final uses these sequence numbers to generate assembler label names
182 LBBnnn and LBEnnn for the beginning and end of the symbol-block.
183 Dbxout uses the sequence numbers to generate references to the same labels
184 from the dbx debugging information.
186 Sdb records this level at the beginning of each function,
187 in order to find the current level when recursing down declarations.
188 It outputs the block beginning and endings
189 at the point in the asm file where the blocks would begin and end. */
191 int next_block_index;
193 /* Assign a unique number to each insn that is output.
194 This can be used to generate unique local labels. */
196 static int insn_counter = 0;
199 /* This variable contains machine-dependent flags (defined in tm.h)
200 set and examined by output routines
201 that describe how to interpret the condition codes properly. */
205 /* During output of an insn, this contains a copy of cc_status
206 from before the insn. */
208 CC_STATUS cc_prev_status;
211 /* Indexed by hardware reg number, is 1 if that register is ever
212 used in the current function.
214 In life_analysis, or in stupid_life_analysis, this is set
215 up to record the hard regs used explicitly. Reload adds
216 in the hard regs used for holding pseudo regs. Final uses
217 it to generate the code in the function prologue and epilogue
218 to save and restore registers as needed. */
220 char regs_ever_live[FIRST_PSEUDO_REGISTER];
222 /* Nonzero means current function must be given a frame pointer.
223 Set in stmt.c if anything is allocated on the stack there.
224 Set in reload1.c if anything is allocated on the stack there. */
226 int frame_pointer_needed;
228 /* Assign unique numbers to labels generated for profiling. */
230 int profile_label_no;
232 /* Length so far allocated in PENDING_BLOCKS. */
234 static int max_block_depth;
236 /* Stack of sequence numbers of symbol-blocks of which we have seen the
237 beginning but not yet the end. Sequence numbers are assigned at
238 the beginning; this stack allows us to find the sequence number
239 of a block that is ending. */
241 static int *pending_blocks;
243 /* Number of elements currently in use in PENDING_BLOCKS. */
245 static int block_depth;
247 /* Nonzero if have enabled APP processing of our assembler output. */
251 /* If we are outputting an insn sequence, this contains the sequence rtx.
256 #ifdef ASSEMBLER_DIALECT
258 /* Number of the assembler dialect to use, starting at 0. */
259 static int dialect_number;
262 /* Indexed by line number, nonzero if there is a note for that line. */
264 static char *line_note_exists;
266 /* Linked list to hold line numbers for each basic block. */
269 struct bb_list *next; /* pointer to next basic block */
270 int line_num; /* line number */
271 int file_label_num; /* LPBC<n> label # for stored filename */
272 int func_label_num; /* LPBC<n> label # for stored function name */
275 static struct bb_list *bb_head = 0; /* Head of basic block list */
276 static struct bb_list **bb_tail = &bb_head; /* Ptr to store next bb ptr */
277 static int bb_file_label_num = -1; /* Current label # for file */
278 static int bb_func_label_num = -1; /* Current label # for func */
280 /* Linked list to hold the strings for each file and function name output. */
283 struct bb_str *next; /* pointer to next string */
284 const char *string; /* string */
285 int label_num; /* label number */
286 int length; /* string length */
289 extern rtx peephole PROTO((rtx));
291 static struct bb_str *sbb_head = 0; /* Head of string list. */
292 static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */
293 static int sbb_label_num = 0; /* Last label used */
295 #ifdef HAVE_ATTR_length
296 static int asm_insn_count PROTO((rtx));
298 static void profile_function PROTO((FILE *));
299 static void profile_after_prologue PROTO((FILE *));
300 static void add_bb PROTO((FILE *));
301 static int add_bb_string PROTO((const char *, int));
302 static void output_source_line PROTO((FILE *, rtx));
303 static rtx walk_alter_subreg PROTO((rtx));
304 static void output_asm_name PROTO((void));
305 static void output_operand PROTO((rtx, int));
306 #ifdef LEAF_REGISTERS
307 static void leaf_renumber_regs PROTO((rtx));
310 static int alter_cond PROTO((rtx));
313 extern char *getpwd ();
315 /* Initialize data in final at the beginning of a compilation. */
318 init_final (filename)
321 next_block_index = 2;
323 max_block_depth = 20;
324 pending_blocks = (int *) xmalloc (20 * sizeof *pending_blocks);
327 #ifdef ASSEMBLER_DIALECT
328 dialect_number = ASSEMBLER_DIALECT;
332 /* Called at end of source file,
333 to output the block-profiling table for this entire compilation. */
337 const char *filename;
341 if (profile_block_flag || profile_arc_flag)
344 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
348 int long_bytes = LONG_TYPE_SIZE / BITS_PER_UNIT;
349 int pointer_bytes = POINTER_SIZE / BITS_PER_UNIT;
351 if (profile_block_flag)
352 size = long_bytes * count_basic_blocks;
354 size = long_bytes * count_instrumented_arcs;
357 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
358 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
359 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
363 /* Output the main header, of 11 words:
364 0: 1 if this file is initialized, else 0.
365 1: address of file name (LPBX1).
366 2: address of table of counts (LPBX2).
367 3: number of counts in the table.
368 4: always 0, for compatibility with Sun.
370 The following are GNU extensions:
372 5: address of table of start addrs of basic blocks (LPBX3).
373 6: Number of bytes in this header.
374 7: address of table of function names (LPBX4).
375 8: address of table of line numbers (LPBX5) or 0.
376 9: address of table of file names (LPBX6) or 0.
377 10: space reserved for basic block profiling. */
379 ASM_OUTPUT_ALIGN (asm_out_file, align);
381 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
383 assemble_integer (const0_rtx, long_bytes, 1);
385 /* address of filename */
386 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
387 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
389 /* address of count table */
390 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
391 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
393 /* count of the # of basic blocks or # of instrumented arcs */
394 if (profile_block_flag)
395 assemble_integer (GEN_INT (count_basic_blocks), long_bytes, 1);
397 assemble_integer (GEN_INT (count_instrumented_arcs), long_bytes,
400 /* zero word (link field) */
401 assemble_integer (const0_rtx, pointer_bytes, 1);
403 /* address of basic block start address table */
404 if (profile_block_flag)
406 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
407 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
411 assemble_integer (const0_rtx, pointer_bytes, 1);
413 /* byte count for extended structure. */
414 assemble_integer (GEN_INT (11 * UNITS_PER_WORD), long_bytes, 1);
416 /* address of function name table */
417 if (profile_block_flag)
419 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
420 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
424 assemble_integer (const0_rtx, pointer_bytes, 1);
426 /* address of line number and filename tables if debugging. */
427 if (write_symbols != NO_DEBUG && profile_block_flag)
429 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
430 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
431 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
432 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
436 assemble_integer (const0_rtx, pointer_bytes, 1);
437 assemble_integer (const0_rtx, pointer_bytes, 1);
440 /* space for extension ptr (link field) */
441 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
443 /* Output the file name changing the suffix to .d for Sun tcov
445 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
447 char *cwd = getpwd ();
448 int len = strlen (filename) + strlen (cwd) + 1;
449 char *data_file = (char *) alloca (len + 4);
451 strcpy (data_file, cwd);
452 strcat (data_file, "/");
453 strcat (data_file, filename);
454 strip_off_ending (data_file, len);
455 if (profile_block_flag)
456 strcat (data_file, ".d");
458 strcat (data_file, ".da");
459 assemble_string (data_file, strlen (data_file) + 1);
462 /* Make space for the table of counts. */
465 /* Realign data section. */
466 ASM_OUTPUT_ALIGN (asm_out_file, align);
467 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
469 assemble_zeros (size);
473 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
474 #ifdef ASM_OUTPUT_SHARED_LOCAL
475 if (flag_shared_data)
476 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
479 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
480 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
483 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
484 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
487 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
492 /* Output any basic block strings */
493 if (profile_block_flag)
495 readonly_data_section ();
498 ASM_OUTPUT_ALIGN (asm_out_file, align);
499 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
501 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC",
503 assemble_string (sptr->string, sptr->length);
508 /* Output the table of addresses. */
509 if (profile_block_flag)
511 /* Realign in new section */
512 ASM_OUTPUT_ALIGN (asm_out_file, align);
513 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
514 for (i = 0; i < count_basic_blocks; i++)
516 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
517 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
522 /* Output the table of function names. */
523 if (profile_block_flag)
525 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
526 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
528 if (ptr->func_label_num >= 0)
530 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
531 ptr->func_label_num);
532 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
536 assemble_integer (const0_rtx, pointer_bytes, 1);
539 for ( ; i < count_basic_blocks; i++)
540 assemble_integer (const0_rtx, pointer_bytes, 1);
543 if (write_symbols != NO_DEBUG && profile_block_flag)
545 /* Output the table of line numbers. */
546 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
547 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
548 assemble_integer (GEN_INT (ptr->line_num), long_bytes, 1);
550 for ( ; i < count_basic_blocks; i++)
551 assemble_integer (const0_rtx, long_bytes, 1);
553 /* Output the table of file names. */
554 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
555 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
557 if (ptr->file_label_num >= 0)
559 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
560 ptr->file_label_num);
561 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
565 assemble_integer (const0_rtx, pointer_bytes, 1);
568 for ( ; i < count_basic_blocks; i++)
569 assemble_integer (const0_rtx, pointer_bytes, 1);
572 /* End with the address of the table of addresses,
573 so we can find it easily, as the last word in the file's text. */
574 if (profile_block_flag)
576 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
577 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
583 /* Enable APP processing of subsequent output.
584 Used before the output from an `asm' statement. */
591 fputs (ASM_APP_ON, asm_out_file);
596 /* Disable APP processing of subsequent output.
597 Called from varasm.c before most kinds of output. */
604 fputs (ASM_APP_OFF, asm_out_file);
609 /* Return the number of slots filled in the current
610 delayed branch sequence (we don't count the insn needing the
611 delay slot). Zero if not in a delayed branch sequence. */
615 dbr_sequence_length ()
617 if (final_sequence != 0)
618 return XVECLEN (final_sequence, 0) - 1;
624 /* The next two pages contain routines used to compute the length of an insn
625 and to shorten branches. */
627 /* Arrays for insn lengths, and addresses. The latter is referenced by
628 `insn_current_length'. */
630 static short *insn_lengths;
633 /* Max uid for which the above arrays are valid. */
634 static int insn_lengths_max_uid;
636 /* Address of insn being processed. Used by `insn_current_length'. */
637 int insn_current_address;
639 /* Address of insn being processed in previous iteration. */
640 int insn_last_address;
642 /* konwn invariant alignment of insn being processed. */
643 int insn_current_align;
645 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
646 gives the next following alignment insn that increases the known
647 alignment, or NULL_RTX if there is no such insn.
648 For any alignment obtained this way, we can again index uid_align with
649 its uid to obtain the next following align that in turn increases the
650 alignment, till we reach NULL_RTX; the sequence obtained this way
651 for each insn we'll call the alignment chain of this insn in the following
654 struct label_alignment {
659 static rtx *uid_align;
660 static int *uid_shuid;
661 static struct label_alignment *label_align;
663 /* Indicate that branch shortening hasn't yet been done. */
682 insn_lengths_max_uid = 0;
686 free (insn_addresses);
696 /* Obtain the current length of an insn. If branch shortening has been done,
697 get its actual length. Otherwise, get its maximum length. */
700 get_attr_length (insn)
703 #ifdef HAVE_ATTR_length
708 if (insn_lengths_max_uid > INSN_UID (insn))
709 return insn_lengths[INSN_UID (insn)];
711 switch (GET_CODE (insn))
719 length = insn_default_length (insn);
723 body = PATTERN (insn);
724 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
726 /* Alignment is machine-dependent and should be handled by
730 length = insn_default_length (insn);
734 body = PATTERN (insn);
735 if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
738 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
739 length = asm_insn_count (body) * insn_default_length (insn);
740 else if (GET_CODE (body) == SEQUENCE)
741 for (i = 0; i < XVECLEN (body, 0); i++)
742 length += get_attr_length (XVECEXP (body, 0, i));
744 length = insn_default_length (insn);
751 #ifdef ADJUST_INSN_LENGTH
752 ADJUST_INSN_LENGTH (insn, length);
755 #else /* not HAVE_ATTR_length */
757 #endif /* not HAVE_ATTR_length */
760 /* Code to handle alignment inside shorten_branches. */
762 /* Here is an explanation how the algorithm in align_fuzz can give
765 Call a sequence of instructions beginning with alignment point X
766 and continuing until the next alignment point `block X'. When `X'
767 is used in an expression, it means the alignment value of the
770 Call the distance between the start of the first insn of block X, and
771 the end of the last insn of block X `IX', for the `inner size of X'.
772 This is clearly the sum of the instruction lengths.
774 Likewise with the next alignment-delimited block following X, which we
777 Call the distance between the start of the first insn of block X, and
778 the start of the first insn of block Y `OX', for the `outer size of X'.
780 The estimated padding is then OX - IX.
782 OX can be safely estimated as
787 OX = round_up(IX, X) + Y - X
789 Clearly est(IX) >= real(IX), because that only depends on the
790 instruction lengths, and those being overestimated is a given.
792 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
793 we needn't worry about that when thinking about OX.
795 When X >= Y, the alignment provided by Y adds no uncertainty factor
796 for branch ranges starting before X, so we can just round what we have.
797 But when X < Y, we don't know anything about the, so to speak,
798 `middle bits', so we have to assume the worst when aligning up from an
799 address mod X to one mod Y, which is Y - X. */
802 #define LABEL_ALIGN(LABEL) 0
805 #ifndef LABEL_ALIGN_MAX_SKIP
806 #define LABEL_ALIGN_MAX_SKIP 0
810 #define LOOP_ALIGN(LABEL) 0
813 #ifndef LOOP_ALIGN_MAX_SKIP
814 #define LOOP_ALIGN_MAX_SKIP 0
817 #ifndef LABEL_ALIGN_AFTER_BARRIER
818 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
821 #ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
822 #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP 0
825 #ifndef ADDR_VEC_ALIGN
827 final_addr_vec_align (addr_vec)
830 int align = exact_log2 (GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec))));
832 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
833 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
837 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
840 #ifndef INSN_LENGTH_ALIGNMENT
841 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
844 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
846 static int min_labelno, max_labelno;
848 #define LABEL_TO_ALIGNMENT(LABEL) \
849 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
851 #define LABEL_TO_MAX_SKIP(LABEL) \
852 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
854 /* For the benefit of port specific code do this also as a function. */
856 label_to_alignment (label)
859 return LABEL_TO_ALIGNMENT (label);
862 #ifdef HAVE_ATTR_length
863 /* The differences in addresses
864 between a branch and its target might grow or shrink depending on
865 the alignment the start insn of the range (the branch for a forward
866 branch or the label for a backward branch) starts out on; if these
867 differences are used naively, they can even oscillate infinitely.
868 We therefore want to compute a 'worst case' address difference that
869 is independent of the alignment the start insn of the range end
870 up on, and that is at least as large as the actual difference.
871 The function align_fuzz calculates the amount we have to add to the
872 naively computed difference, by traversing the part of the alignment
873 chain of the start insn of the range that is in front of the end insn
874 of the range, and considering for each alignment the maximum amount
875 that it might contribute to a size increase.
877 For casesi tables, we also want to know worst case minimum amounts of
878 address difference, in case a machine description wants to introduce
879 some common offset that is added to all offsets in a table.
880 For this purpose, align_fuzz with a growth argument of 0 comuptes the
881 appropriate adjustment. */
884 /* Compute the maximum delta by which the difference of the addresses of
885 START and END might grow / shrink due to a different address for start
886 which changes the size of alignment insns between START and END.
887 KNOWN_ALIGN_LOG is the alignment known for START.
888 GROWTH should be ~0 if the objective is to compute potential code size
889 increase, and 0 if the objective is to compute potential shrink.
890 The return value is undefined for any other value of GROWTH. */
892 align_fuzz (start, end, known_align_log, growth)
897 int uid = INSN_UID (start);
899 int known_align = 1 << known_align_log;
900 int end_shuid = INSN_SHUID (end);
903 for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
905 int align_addr, new_align;
907 uid = INSN_UID (align_label);
908 align_addr = insn_addresses[uid] - insn_lengths[uid];
909 if (uid_shuid[uid] > end_shuid)
911 known_align_log = LABEL_TO_ALIGNMENT (align_label);
912 new_align = 1 << known_align_log;
913 if (new_align < known_align)
915 fuzz += (-align_addr ^ growth) & (new_align - known_align);
916 known_align = new_align;
921 /* Compute a worst-case reference address of a branch so that it
922 can be safely used in the presence of aligned labels. Since the
923 size of the branch itself is unknown, the size of the branch is
924 not included in the range. I.e. for a forward branch, the reference
925 address is the end address of the branch as known from the previous
926 branch shortening pass, minus a value to account for possible size
927 increase due to alignment. For a backward branch, it is the start
928 address of the branch as known from the current pass, plus a value
929 to account for possible size increase due to alignment.
930 NB.: Therefore, the maximum offset allowed for backward branches needs
931 to exclude the branch size. */
933 insn_current_reference_address (branch)
937 rtx seq = NEXT_INSN (PREV_INSN (branch));
938 int seq_uid = INSN_UID (seq);
939 if (GET_CODE (branch) != JUMP_INSN)
940 /* This can happen for example on the PA; the objective is to know the
941 offset to address something in front of the start of the function.
942 Thus, we can treat it like a backward branch.
943 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
944 any alignment we'd encounter, so we skip the call to align_fuzz. */
945 return insn_current_address;
946 dest = JUMP_LABEL (branch);
947 /* BRANCH has no proper alignment chain set, so use SEQ. */
948 if (INSN_SHUID (branch) < INSN_SHUID (dest))
950 /* Forward branch. */
951 return (insn_last_address + insn_lengths[seq_uid]
952 - align_fuzz (seq, dest, length_unit_log, ~0));
956 /* Backward branch. */
957 return (insn_current_address
958 + align_fuzz (dest, seq, length_unit_log, ~0));
961 #endif /* HAVE_ATTR_length */
963 /* Make a pass over all insns and compute their actual lengths by shortening
964 any branches of variable length if possible. */
966 /* Give a default value for the lowest address in a function. */
968 #ifndef FIRST_INSN_ADDRESS
969 #define FIRST_INSN_ADDRESS 0
972 /* shorten_branches might be called multiple times: for example, the SH
973 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
974 In order to do this, it needs proper length information, which it obtains
975 by calling shorten_branches. This cannot be collapsed with
976 shorten_branches itself into a single pass unless we also want to intergate
977 reorg.c, since the branch splitting exposes new instructions with delay
981 shorten_branches (first)
989 #ifdef HAVE_ATTR_length
990 #define MAX_CODE_ALIGN 16
992 int something_changed = 1;
993 char *varying_length;
996 rtx align_tab[MAX_CODE_ALIGN];
998 /* In order to make sure that all instructions have valid length info,
999 we must split them before we compute the address/length info. */
1001 for (insn = NEXT_INSN (first); insn; insn = NEXT_INSN (insn))
1002 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1005 /* Don't split the insn if it has been deleted. */
1006 if (! INSN_DELETED_P (old))
1007 insn = try_split (PATTERN (old), old, 1);
1008 /* When not optimizing, the old insn will be still left around
1009 with only the 'deleted' bit set. Transform it into a note
1010 to avoid confusion of subsequent processing. */
1011 if (INSN_DELETED_P (old))
1013 PUT_CODE (old , NOTE);
1014 NOTE_LINE_NUMBER (old) = NOTE_INSN_DELETED;
1015 NOTE_SOURCE_FILE (old) = 0;
1020 /* We must do some computations even when not actually shortening, in
1021 order to get the alignment information for the labels. */
1023 init_insn_lengths ();
1025 /* Compute maximum UID and allocate label_align / uid_shuid. */
1026 max_uid = get_max_uid ();
1028 max_labelno = max_label_num ();
1029 min_labelno = get_first_label_num ();
1030 label_align = (struct label_alignment *) xmalloc (
1031 (max_labelno - min_labelno + 1) * sizeof (struct label_alignment));
1032 bzero ((char *) label_align,
1033 (max_labelno - min_labelno + 1) * sizeof (struct label_alignment));
1035 uid_shuid = (int *) xmalloc (max_uid * sizeof *uid_shuid);
1037 /* Initialize label_align and set up uid_shuid to be strictly
1038 monotonically rising with insn order. */
1039 /* We use max_log here to keep track of the maximum alignment we want to
1040 impose on the next CODE_LABEL (or the current one if we are processing
1041 the CODE_LABEL itself). */
1046 for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
1050 INSN_SHUID (insn) = i++;
1051 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1053 /* reorg might make the first insn of a loop being run once only,
1054 and delete the label in front of it. Then we want to apply
1055 the loop alignment to the new label created by reorg, which
1056 is separated by the former loop start insn from the
1057 NOTE_INSN_LOOP_BEG. */
1059 else if (GET_CODE (insn) == CODE_LABEL)
1063 log = LABEL_ALIGN (insn);
1067 max_skip = LABEL_ALIGN_MAX_SKIP;
1069 next = NEXT_INSN (insn);
1070 /* ADDR_VECs only take room if read-only data goes into the text
1072 if (JUMP_TABLES_IN_TEXT_SECTION
1073 #if !defined(READONLY_DATA_SECTION)
1077 if (next && GET_CODE (next) == JUMP_INSN)
1079 rtx nextbody = PATTERN (next);
1080 if (GET_CODE (nextbody) == ADDR_VEC
1081 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1083 log = ADDR_VEC_ALIGN (next);
1087 max_skip = LABEL_ALIGN_MAX_SKIP;
1091 LABEL_TO_ALIGNMENT (insn) = max_log;
1092 LABEL_TO_MAX_SKIP (insn) = max_skip;
1096 else if (GET_CODE (insn) == BARRIER)
1100 for (label = insn; label && GET_RTX_CLASS (GET_CODE (label)) != 'i';
1101 label = NEXT_INSN (label))
1102 if (GET_CODE (label) == CODE_LABEL)
1104 log = LABEL_ALIGN_AFTER_BARRIER (insn);
1108 max_skip = LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP;
1113 /* Again, we allow NOTE_INSN_LOOP_BEG - INSN - CODE_LABEL
1114 sequences in order to handle reorg output efficiently. */
1115 else if (GET_CODE (insn) == NOTE
1116 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
1120 for (label = insn; label; label = NEXT_INSN (label))
1121 if (GET_CODE (label) == CODE_LABEL)
1123 log = LOOP_ALIGN (insn);
1127 max_skip = LOOP_ALIGN_MAX_SKIP;
1135 #ifdef HAVE_ATTR_length
1137 /* Allocate the rest of the arrays. */
1138 insn_lengths = (short *) xmalloc (max_uid * sizeof (short));
1139 insn_addresses = (int *) xmalloc (max_uid * sizeof (int));
1140 insn_lengths_max_uid = max_uid;
1141 /* Syntax errors can lead to labels being outside of the main insn stream.
1142 Initialize insn_addresses, so that we get reproducible results. */
1143 bzero ((char *)insn_addresses, max_uid * sizeof *insn_addresses);
1144 uid_align = (rtx *) xmalloc (max_uid * sizeof *uid_align);
1146 varying_length = (char *) xmalloc (max_uid * sizeof (char));
1148 bzero (varying_length, max_uid);
1150 /* Initialize uid_align. We scan instructions
1151 from end to start, and keep in align_tab[n] the last seen insn
1152 that does an alignment of at least n+1, i.e. the successor
1153 in the alignment chain for an insn that does / has a known
1156 bzero ((char *) uid_align, max_uid * sizeof *uid_align);
1158 for (i = MAX_CODE_ALIGN; --i >= 0; )
1159 align_tab[i] = NULL_RTX;
1160 seq = get_last_insn ();
1161 for (; seq; seq = PREV_INSN (seq))
1163 int uid = INSN_UID (seq);
1165 log = (GET_CODE (seq) == CODE_LABEL ? LABEL_TO_ALIGNMENT (seq) : 0);
1166 uid_align[uid] = align_tab[0];
1169 /* Found an alignment label. */
1170 uid_align[uid] = align_tab[log];
1171 for (i = log - 1; i >= 0; i--)
1175 #ifdef CASE_VECTOR_SHORTEN_MODE
1178 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1181 int min_shuid = INSN_SHUID (get_insns ()) - 1;
1182 int max_shuid = INSN_SHUID (get_last_insn ()) + 1;
1185 for (insn = first; insn != 0; insn = NEXT_INSN (insn))
1187 rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat;
1188 int len, i, min, max, insn_shuid;
1190 addr_diff_vec_flags flags;
1192 if (GET_CODE (insn) != JUMP_INSN
1193 || GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)
1195 pat = PATTERN (insn);
1196 len = XVECLEN (pat, 1);
1199 min_align = MAX_CODE_ALIGN;
1200 for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
1202 rtx lab = XEXP (XVECEXP (pat, 1, i), 0);
1203 int shuid = INSN_SHUID (lab);
1214 if (min_align > LABEL_TO_ALIGNMENT (lab))
1215 min_align = LABEL_TO_ALIGNMENT (lab);
1217 XEXP (pat, 2) = gen_rtx_LABEL_REF (VOIDmode, min_lab);
1218 XEXP (pat, 3) = gen_rtx_LABEL_REF (VOIDmode, max_lab);
1219 insn_shuid = INSN_SHUID (insn);
1220 rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0));
1221 flags.min_align = min_align;
1222 flags.base_after_vec = rel > insn_shuid;
1223 flags.min_after_vec = min > insn_shuid;
1224 flags.max_after_vec = max > insn_shuid;
1225 flags.min_after_base = min > rel;
1226 flags.max_after_base = max > rel;
1227 ADDR_DIFF_VEC_FLAGS (pat) = flags;
1230 #endif /* CASE_VECTOR_SHORTEN_MODE */
1233 /* Compute initial lengths, addresses, and varying flags for each insn. */
1234 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1236 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1238 uid = INSN_UID (insn);
1240 insn_lengths[uid] = 0;
1242 if (GET_CODE (insn) == CODE_LABEL)
1244 int log = LABEL_TO_ALIGNMENT (insn);
1247 int align = 1 << log;
1248 int new_address = (insn_current_address + align - 1) & -align;
1249 insn_lengths[uid] = new_address - insn_current_address;
1250 insn_current_address = new_address;
1254 insn_addresses[uid] = insn_current_address;
1256 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
1257 || GET_CODE (insn) == CODE_LABEL)
1259 if (INSN_DELETED_P (insn))
1262 body = PATTERN (insn);
1263 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1265 /* This only takes room if read-only data goes into the text
1267 if (JUMP_TABLES_IN_TEXT_SECTION
1268 #if !defined(READONLY_DATA_SECTION)
1272 insn_lengths[uid] = (XVECLEN (body,
1273 GET_CODE (body) == ADDR_DIFF_VEC)
1274 * GET_MODE_SIZE (GET_MODE (body)));
1275 /* Alignment is handled by ADDR_VEC_ALIGN. */
1277 else if (asm_noperands (body) >= 0)
1278 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
1279 else if (GET_CODE (body) == SEQUENCE)
1282 int const_delay_slots;
1284 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
1286 const_delay_slots = 0;
1288 /* Inside a delay slot sequence, we do not do any branch shortening
1289 if the shortening could change the number of delay slots
1291 for (i = 0; i < XVECLEN (body, 0); i++)
1293 rtx inner_insn = XVECEXP (body, 0, i);
1294 int inner_uid = INSN_UID (inner_insn);
1297 if (asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
1298 inner_length = (asm_insn_count (PATTERN (inner_insn))
1299 * insn_default_length (inner_insn));
1301 inner_length = insn_default_length (inner_insn);
1303 insn_lengths[inner_uid] = inner_length;
1304 if (const_delay_slots)
1306 if ((varying_length[inner_uid]
1307 = insn_variable_length_p (inner_insn)) != 0)
1308 varying_length[uid] = 1;
1309 insn_addresses[inner_uid] = (insn_current_address +
1313 varying_length[inner_uid] = 0;
1314 insn_lengths[uid] += inner_length;
1317 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
1319 insn_lengths[uid] = insn_default_length (insn);
1320 varying_length[uid] = insn_variable_length_p (insn);
1323 /* If needed, do any adjustment. */
1324 #ifdef ADJUST_INSN_LENGTH
1325 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
1326 if (insn_lengths[uid] < 0)
1327 fatal_insn ("Negative insn length", insn);
1331 /* Now loop over all the insns finding varying length insns. For each,
1332 get the current insn length. If it has changed, reflect the change.
1333 When nothing changes for a full pass, we are done. */
1335 while (something_changed)
1337 something_changed = 0;
1338 insn_current_align = MAX_CODE_ALIGN - 1;
1339 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1341 insn = NEXT_INSN (insn))
1344 #ifdef ADJUST_INSN_LENGTH
1349 uid = INSN_UID (insn);
1351 if (GET_CODE (insn) == CODE_LABEL)
1353 int log = LABEL_TO_ALIGNMENT (insn);
1354 if (log > insn_current_align)
1356 int align = 1 << log;
1357 int new_address= (insn_current_address + align - 1) & -align;
1358 insn_lengths[uid] = new_address - insn_current_address;
1359 insn_current_align = log;
1360 insn_current_address = new_address;
1363 insn_lengths[uid] = 0;
1364 insn_addresses[uid] = insn_current_address;
1368 length_align = INSN_LENGTH_ALIGNMENT (insn);
1369 if (length_align < insn_current_align)
1370 insn_current_align = length_align;
1372 insn_last_address = insn_addresses[uid];
1373 insn_addresses[uid] = insn_current_address;
1375 #ifdef CASE_VECTOR_SHORTEN_MODE
1376 if (optimize && GET_CODE (insn) == JUMP_INSN
1377 && GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
1379 rtx body = PATTERN (insn);
1380 int old_length = insn_lengths[uid];
1381 rtx rel_lab = XEXP (XEXP (body, 0), 0);
1382 rtx min_lab = XEXP (XEXP (body, 2), 0);
1383 rtx max_lab = XEXP (XEXP (body, 3), 0);
1384 addr_diff_vec_flags flags = ADDR_DIFF_VEC_FLAGS (body);
1385 int rel_addr = insn_addresses[INSN_UID (rel_lab)];
1386 int min_addr = insn_addresses[INSN_UID (min_lab)];
1387 int max_addr = insn_addresses[INSN_UID (max_lab)];
1391 /* Try to find a known alignment for rel_lab. */
1392 for (prev = rel_lab;
1394 && ! insn_lengths[INSN_UID (prev)]
1395 && ! (varying_length[INSN_UID (prev)] & 1);
1396 prev = PREV_INSN (prev))
1397 if (varying_length[INSN_UID (prev)] & 2)
1399 rel_align = LABEL_TO_ALIGNMENT (prev);
1403 /* See the comment on addr_diff_vec_flags in rtl.h for the
1404 meaning of the flags values. base: REL_LAB vec: INSN */
1405 /* Anything after INSN has still addresses from the last
1406 pass; adjust these so that they reflect our current
1407 estimate for this pass. */
1408 if (flags.base_after_vec)
1409 rel_addr += insn_current_address - insn_last_address;
1410 if (flags.min_after_vec)
1411 min_addr += insn_current_address - insn_last_address;
1412 if (flags.max_after_vec)
1413 max_addr += insn_current_address - insn_last_address;
1414 /* We want to know the worst case, i.e. lowest possible value
1415 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1416 its offset is positive, and we have to be wary of code shrink;
1417 otherwise, it is negative, and we have to be vary of code
1419 if (flags.min_after_base)
1421 /* If INSN is between REL_LAB and MIN_LAB, the size
1422 changes we are about to make can change the alignment
1423 within the observed offset, therefore we have to break
1424 it up into two parts that are independent. */
1425 if (! flags.base_after_vec && flags.min_after_vec)
1427 min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
1428 min_addr -= align_fuzz (insn, min_lab, 0, 0);
1431 min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
1435 if (flags.base_after_vec && ! flags.min_after_vec)
1437 min_addr -= align_fuzz (min_lab, insn, 0, ~0);
1438 min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
1441 min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
1443 /* Likewise, determine the highest lowest possible value
1444 for the offset of MAX_LAB. */
1445 if (flags.max_after_base)
1447 if (! flags.base_after_vec && flags.max_after_vec)
1449 max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
1450 max_addr += align_fuzz (insn, max_lab, 0, ~0);
1453 max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
1457 if (flags.base_after_vec && ! flags.max_after_vec)
1459 max_addr += align_fuzz (max_lab, insn, 0, 0);
1460 max_addr += align_fuzz (insn, rel_lab, 0, 0);
1463 max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
1465 PUT_MODE (body, CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
1466 max_addr - rel_addr,
1468 if (JUMP_TABLES_IN_TEXT_SECTION
1469 #if !defined(READONLY_DATA_SECTION)
1475 = (XVECLEN (body, 1) * GET_MODE_SIZE (GET_MODE (body)));
1476 insn_current_address += insn_lengths[uid];
1477 if (insn_lengths[uid] != old_length)
1478 something_changed = 1;
1483 #endif /* CASE_VECTOR_SHORTEN_MODE */
1485 if (! (varying_length[uid]))
1487 insn_current_address += insn_lengths[uid];
1490 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
1494 body = PATTERN (insn);
1496 for (i = 0; i < XVECLEN (body, 0); i++)
1498 rtx inner_insn = XVECEXP (body, 0, i);
1499 int inner_uid = INSN_UID (inner_insn);
1502 insn_addresses[inner_uid] = insn_current_address;
1504 /* insn_current_length returns 0 for insns with a
1505 non-varying length. */
1506 if (! varying_length[inner_uid])
1507 inner_length = insn_lengths[inner_uid];
1509 inner_length = insn_current_length (inner_insn);
1511 if (inner_length != insn_lengths[inner_uid])
1513 insn_lengths[inner_uid] = inner_length;
1514 something_changed = 1;
1516 insn_current_address += insn_lengths[inner_uid];
1517 new_length += inner_length;
1522 new_length = insn_current_length (insn);
1523 insn_current_address += new_length;
1526 #ifdef ADJUST_INSN_LENGTH
1527 /* If needed, do any adjustment. */
1528 tmp_length = new_length;
1529 ADJUST_INSN_LENGTH (insn, new_length);
1530 insn_current_address += (new_length - tmp_length);
1533 if (new_length != insn_lengths[uid])
1535 insn_lengths[uid] = new_length;
1536 something_changed = 1;
1539 /* For a non-optimizing compile, do only a single pass. */
1544 free (varying_length);
1546 #endif /* HAVE_ATTR_length */
1549 #ifdef HAVE_ATTR_length
1550 /* Given the body of an INSN known to be generated by an ASM statement, return
1551 the number of machine instructions likely to be generated for this insn.
1552 This is used to compute its length. */
1555 asm_insn_count (body)
1561 if (GET_CODE (body) == ASM_INPUT)
1562 template = XSTR (body, 0);
1564 template = decode_asm_operands (body, NULL_PTR, NULL_PTR,
1565 NULL_PTR, NULL_PTR);
1567 for ( ; *template; template++)
1568 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
1575 /* Output assembler code for the start of a function,
1576 and initialize some of the variables in this file
1577 for the new function. The label for the function and associated
1578 assembler pseudo-ops have already been output in `assemble_start_function'.
1580 FIRST is the first insn of the rtl for the function being compiled.
1581 FILE is the file to write assembler code to.
1582 OPTIMIZE is nonzero if we should eliminate redundant
1583 test and compare insns. */
1586 final_start_function (first, file, optimize)
1593 this_is_asm_operands = 0;
1595 #ifdef NON_SAVING_SETJMP
1596 /* A function that calls setjmp should save and restore all the
1597 call-saved registers on a system where longjmp clobbers them. */
1598 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
1602 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1603 if (!call_used_regs[i])
1604 regs_ever_live[i] = 1;
1608 /* Initial line number is supposed to be output
1609 before the function's prologue and label
1610 so that the function's address will not appear to be
1611 in the last statement of the preceding function. */
1612 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1613 last_linenum = high_block_linenum = high_function_linenum
1614 = NOTE_LINE_NUMBER (first);
1616 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1617 /* Output DWARF definition of the function. */
1618 if (dwarf2out_do_frame ())
1619 dwarf2out_begin_prologue ();
1622 /* For SDB and XCOFF, the function beginning must be marked between
1623 the function label and the prologue. We always need this, even when
1624 -g1 was used. Defer on MIPS systems so that parameter descriptions
1625 follow function entry. */
1626 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
1627 if (write_symbols == SDB_DEBUG)
1628 sdbout_begin_function (last_linenum);
1631 #ifdef XCOFF_DEBUGGING_INFO
1632 if (write_symbols == XCOFF_DEBUG)
1633 xcoffout_begin_function (file, last_linenum);
1636 /* But only output line number for other debug info types if -g2
1638 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1639 output_source_line (file, first);
1641 #ifdef LEAF_REG_REMAP
1642 if (current_function_uses_only_leaf_regs)
1643 leaf_renumber_regs (first);
1646 if (profile_block_flag)
1649 /* The Sun386i and perhaps other machines don't work right
1650 if the profiling code comes after the prologue. */
1651 #ifdef PROFILE_BEFORE_PROLOGUE
1653 profile_function (file);
1654 #endif /* PROFILE_BEFORE_PROLOGUE */
1656 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1657 if (dwarf2out_do_frame ())
1658 dwarf2out_frame_debug (NULL_RTX);
1661 #ifdef FUNCTION_PROLOGUE
1662 /* First output the function prologue: code to set up the stack frame. */
1663 FUNCTION_PROLOGUE (file, get_frame_size ());
1666 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1667 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
1668 next_block_index = 1;
1671 /* If the machine represents the prologue as RTL, the profiling code must
1672 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1673 #ifdef HAVE_prologue
1674 if (! HAVE_prologue)
1676 profile_after_prologue (file);
1680 /* If we are doing basic block profiling, remember a printable version
1681 of the function name. */
1682 if (profile_block_flag)
1685 = add_bb_string ((*decl_printable_name) (current_function_decl, 2), FALSE);
1690 profile_after_prologue (file)
1693 #ifdef FUNCTION_BLOCK_PROFILER
1694 if (profile_block_flag)
1696 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
1698 #endif /* FUNCTION_BLOCK_PROFILER */
1700 #ifndef PROFILE_BEFORE_PROLOGUE
1702 profile_function (file);
1703 #endif /* not PROFILE_BEFORE_PROLOGUE */
1707 profile_function (file)
1710 #ifndef NO_PROFILE_COUNTERS
1711 int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1713 #if defined(ASM_OUTPUT_REG_PUSH)
1714 #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1715 int sval = current_function_returns_struct;
1717 #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1718 int cxt = current_function_needs_context;
1720 #endif /* ASM_OUTPUT_REG_PUSH */
1722 #ifndef NO_PROFILE_COUNTERS
1724 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1725 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
1726 assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, 1);
1729 function_section (current_function_decl);
1731 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1733 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
1735 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1738 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1743 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1745 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1747 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1750 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1755 FUNCTION_PROFILER (file, profile_label_no);
1757 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1759 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1761 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1764 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1769 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1771 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1773 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1776 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1782 /* Output assembler code for the end of a function.
1783 For clarity, args are same as those of `final_start_function'
1784 even though not all of them are needed. */
1787 final_end_function (first, file, optimize)
1794 fputs (ASM_APP_OFF, file);
1798 #ifdef SDB_DEBUGGING_INFO
1799 if (write_symbols == SDB_DEBUG)
1800 sdbout_end_function (high_function_linenum);
1803 #ifdef DWARF_DEBUGGING_INFO
1804 if (write_symbols == DWARF_DEBUG)
1805 dwarfout_end_function ();
1808 #ifdef XCOFF_DEBUGGING_INFO
1809 if (write_symbols == XCOFF_DEBUG)
1810 xcoffout_end_function (file, high_function_linenum);
1813 #ifdef FUNCTION_EPILOGUE
1814 /* Finally, output the function epilogue:
1815 code to restore the stack frame and return to the caller. */
1816 FUNCTION_EPILOGUE (file, get_frame_size ());
1819 if (profile_block_flag)
1822 #ifdef SDB_DEBUGGING_INFO
1823 if (write_symbols == SDB_DEBUG)
1824 sdbout_end_epilogue ();
1827 #ifdef DWARF_DEBUGGING_INFO
1828 if (write_symbols == DWARF_DEBUG)
1829 dwarfout_end_epilogue ();
1832 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1833 if (dwarf2out_do_frame ())
1834 dwarf2out_end_epilogue ();
1837 #ifdef XCOFF_DEBUGGING_INFO
1838 if (write_symbols == XCOFF_DEBUG)
1839 xcoffout_end_epilogue (file);
1842 bb_func_label_num = -1; /* not in function, nuke label # */
1844 /* If FUNCTION_EPILOGUE is not defined, then the function body
1845 itself contains return instructions wherever needed. */
1848 /* Add a block to the linked list that remembers the current line/file/function
1849 for basic block profiling. Emit the label in front of the basic block and
1850 the instructions that increment the count field. */
1856 struct bb_list *ptr = (struct bb_list *) permalloc (sizeof (struct bb_list));
1858 /* Add basic block to linked list. */
1860 ptr->line_num = last_linenum;
1861 ptr->file_label_num = bb_file_label_num;
1862 ptr->func_label_num = bb_func_label_num;
1864 bb_tail = &ptr->next;
1866 /* Enable the table of basic-block use counts
1867 to point at the code it applies to. */
1868 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1870 /* Before first insn of this basic block, increment the
1871 count of times it was entered. */
1872 #ifdef BLOCK_PROFILER
1873 BLOCK_PROFILER (file, count_basic_blocks);
1880 count_basic_blocks++;
1883 /* Add a string to be used for basic block profiling. */
1886 add_bb_string (string, perm_p)
1891 struct bb_str *ptr = 0;
1895 string = "<unknown>";
1899 /* Allocate a new string if the current string isn't permanent. If
1900 the string is permanent search for the same string in other
1903 len = strlen (string) + 1;
1906 char *p = (char *) permalloc (len);
1907 bcopy (string, p, len);
1911 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1912 if (ptr->string == string)
1915 /* Allocate a new string block if we need to. */
1918 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1921 ptr->label_num = sbb_label_num++;
1922 ptr->string = string;
1924 sbb_tail = &ptr->next;
1927 return ptr->label_num;
1931 /* Output assembler code for some insns: all or part of a function.
1932 For description of args, see `final_start_function', above.
1934 PRESCAN is 1 if we are not really outputting,
1935 just scanning as if we were outputting.
1936 Prescanning deletes and rearranges insns just like ordinary output.
1937 PRESCAN is -2 if we are outputting after having prescanned.
1938 In this case, don't try to delete or rearrange insns
1939 because that has already been done.
1940 Prescanning is done only on certain machines. */
1943 final (first, file, optimize, prescan)
1953 last_ignored_compare = 0;
1956 check_exception_handler_labels ();
1958 /* Make a map indicating which line numbers appear in this function.
1959 When producing SDB debugging info, delete troublesome line number
1960 notes from inlined functions in other files as well as duplicate
1961 line number notes. */
1962 #ifdef SDB_DEBUGGING_INFO
1963 if (write_symbols == SDB_DEBUG)
1966 for (insn = first; insn; insn = NEXT_INSN (insn))
1967 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1969 if ((RTX_INTEGRATED_P (insn)
1970 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1972 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1973 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1975 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1976 NOTE_SOURCE_FILE (insn) = 0;
1980 if (NOTE_LINE_NUMBER (insn) > max_line)
1981 max_line = NOTE_LINE_NUMBER (insn);
1987 for (insn = first; insn; insn = NEXT_INSN (insn))
1988 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1989 max_line = NOTE_LINE_NUMBER (insn);
1992 line_note_exists = (char *) oballoc (max_line + 1);
1993 bzero (line_note_exists, max_line + 1);
1995 for (insn = first; insn; insn = NEXT_INSN (insn))
1997 if (INSN_UID (insn) > max_uid) /* find largest UID */
1998 max_uid = INSN_UID (insn);
1999 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
2000 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
2002 /* If CC tracking across branches is enabled, record the insn which
2003 jumps to each branch only reached from one place. */
2004 if (optimize && GET_CODE (insn) == JUMP_INSN)
2006 rtx lab = JUMP_LABEL (insn);
2007 if (lab && LABEL_NUSES (lab) == 1)
2009 LABEL_REFS (lab) = insn;
2015 /* Initialize insn_eh_region table if eh is being used. */
2017 init_insn_eh_region (first, max_uid);
2023 /* Output the insns. */
2024 for (insn = NEXT_INSN (first); insn;)
2026 #ifdef HAVE_ATTR_length
2027 insn_current_address = insn_addresses[INSN_UID (insn)];
2029 insn = final_scan_insn (insn, file, optimize, prescan, 0);
2032 /* Do basic-block profiling here
2033 if the last insn was a conditional branch. */
2034 if (profile_block_flag && new_block)
2037 free_insn_eh_region ();
2040 /* The final scan for one insn, INSN.
2041 Args are same as in `final', except that INSN
2042 is the insn being scanned.
2043 Value returned is the next insn to be scanned.
2045 NOPEEPHOLES is the flag to disallow peephole processing (currently
2046 used for within delayed branch sequence output). */
2049 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
2062 /* Ignore deleted insns. These can occur when we split insns (due to a
2063 template of "#") while not optimizing. */
2064 if (INSN_DELETED_P (insn))
2065 return NEXT_INSN (insn);
2067 switch (GET_CODE (insn))
2073 /* Align the beginning of a loop, for higher speed
2074 on certain machines. */
2076 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
2077 break; /* This used to depend on optimize, but that was bogus. */
2078 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END)
2081 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG
2082 && ! exceptions_via_longjmp)
2084 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHB", NOTE_BLOCK_NUMBER (insn));
2085 if (! flag_new_exceptions)
2086 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn));
2087 #ifdef ASM_OUTPUT_EH_REGION_BEG
2088 ASM_OUTPUT_EH_REGION_BEG (file, NOTE_BLOCK_NUMBER (insn));
2093 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END
2094 && ! exceptions_via_longjmp)
2096 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHE", NOTE_BLOCK_NUMBER (insn));
2097 if (flag_new_exceptions)
2098 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn));
2099 #ifdef ASM_OUTPUT_EH_REGION_END
2100 ASM_OUTPUT_EH_REGION_END (file, NOTE_BLOCK_NUMBER (insn));
2105 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
2107 #ifdef FUNCTION_END_PROLOGUE
2108 FUNCTION_END_PROLOGUE (file);
2110 profile_after_prologue (file);
2114 #ifdef FUNCTION_BEGIN_EPILOGUE
2115 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
2117 FUNCTION_BEGIN_EPILOGUE (file);
2122 if (write_symbols == NO_DEBUG)
2124 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
2126 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
2127 /* MIPS stabs require the parameter descriptions to be after the
2128 function entry point rather than before. */
2129 if (write_symbols == SDB_DEBUG)
2130 sdbout_begin_function (last_linenum);
2133 #ifdef DWARF_DEBUGGING_INFO
2134 /* This outputs a marker where the function body starts, so it
2135 must be after the prologue. */
2136 if (write_symbols == DWARF_DEBUG)
2137 dwarfout_begin_function ();
2141 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED)
2142 break; /* An insn that was "deleted" */
2145 fputs (ASM_APP_OFF, file);
2148 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG
2149 && (debug_info_level == DINFO_LEVEL_NORMAL
2150 || debug_info_level == DINFO_LEVEL_VERBOSE
2151 || write_symbols == DWARF_DEBUG
2152 || write_symbols == DWARF2_DEBUG))
2154 /* Beginning of a symbol-block. Assign it a sequence number
2155 and push the number onto the stack PENDING_BLOCKS. */
2157 if (block_depth == max_block_depth)
2159 /* PENDING_BLOCKS is full; make it longer. */
2160 max_block_depth *= 2;
2162 = (int *) xrealloc (pending_blocks,
2163 max_block_depth * sizeof (int));
2165 pending_blocks[block_depth++] = next_block_index;
2167 high_block_linenum = last_linenum;
2169 /* Output debugging info about the symbol-block beginning. */
2171 #ifdef SDB_DEBUGGING_INFO
2172 if (write_symbols == SDB_DEBUG)
2173 sdbout_begin_block (file, last_linenum, next_block_index);
2175 #ifdef XCOFF_DEBUGGING_INFO
2176 if (write_symbols == XCOFF_DEBUG)
2177 xcoffout_begin_block (file, last_linenum, next_block_index);
2179 #ifdef DBX_DEBUGGING_INFO
2180 if (write_symbols == DBX_DEBUG)
2181 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", next_block_index);
2183 #ifdef DWARF_DEBUGGING_INFO
2184 if (write_symbols == DWARF_DEBUG)
2185 dwarfout_begin_block (next_block_index);
2187 #ifdef DWARF2_DEBUGGING_INFO
2188 if (write_symbols == DWARF2_DEBUG)
2189 dwarf2out_begin_block (next_block_index);
2194 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END
2195 && (debug_info_level == DINFO_LEVEL_NORMAL
2196 || debug_info_level == DINFO_LEVEL_VERBOSE
2197 || write_symbols == DWARF_DEBUG
2198 || write_symbols == DWARF2_DEBUG))
2200 /* End of a symbol-block. Pop its sequence number off
2201 PENDING_BLOCKS and output debugging info based on that. */
2204 if (block_depth < 0)
2207 #ifdef XCOFF_DEBUGGING_INFO
2208 if (write_symbols == XCOFF_DEBUG)
2209 xcoffout_end_block (file, high_block_linenum,
2210 pending_blocks[block_depth]);
2212 #ifdef DBX_DEBUGGING_INFO
2213 if (write_symbols == DBX_DEBUG)
2214 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE",
2215 pending_blocks[block_depth]);
2217 #ifdef SDB_DEBUGGING_INFO
2218 if (write_symbols == SDB_DEBUG)
2219 sdbout_end_block (file, high_block_linenum,
2220 pending_blocks[block_depth]);
2222 #ifdef DWARF_DEBUGGING_INFO
2223 if (write_symbols == DWARF_DEBUG)
2224 dwarfout_end_block (pending_blocks[block_depth]);
2226 #ifdef DWARF2_DEBUGGING_INFO
2227 if (write_symbols == DWARF2_DEBUG)
2228 dwarf2out_end_block (pending_blocks[block_depth]);
2231 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL
2232 && (debug_info_level == DINFO_LEVEL_NORMAL
2233 || debug_info_level == DINFO_LEVEL_VERBOSE))
2235 #ifdef DWARF_DEBUGGING_INFO
2236 if (write_symbols == DWARF_DEBUG)
2237 dwarfout_label (insn);
2239 #ifdef DWARF2_DEBUGGING_INFO
2240 if (write_symbols == DWARF2_DEBUG)
2241 dwarf2out_label (insn);
2244 else if (NOTE_LINE_NUMBER (insn) > 0)
2245 /* This note is a line-number. */
2249 #if 0 /* This is what we used to do. */
2250 output_source_line (file, insn);
2254 /* If there is anything real after this note,
2255 output it. If another line note follows, omit this one. */
2256 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
2258 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
2260 /* These types of notes can be significant
2261 so make sure the preceding line number stays. */
2262 else if (GET_CODE (note) == NOTE
2263 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
2264 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
2265 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
2267 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
2269 /* Another line note follows; we can delete this note
2270 if no intervening line numbers have notes elsewhere. */
2272 for (num = NOTE_LINE_NUMBER (insn) + 1;
2273 num < NOTE_LINE_NUMBER (note);
2275 if (line_note_exists[num])
2278 if (num >= NOTE_LINE_NUMBER (note))
2284 /* Output this line note
2285 if it is the first or the last line note in a row. */
2287 output_source_line (file, insn);
2292 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2293 /* If we push arguments, we need to check all insns for stack
2295 if (dwarf2out_do_frame ())
2296 dwarf2out_frame_debug (insn);
2301 /* The target port might emit labels in the output function for
2302 some insn, e.g. sh.c output_branchy_insn. */
2303 if (CODE_LABEL_NUMBER (insn) <= max_labelno)
2305 int align = LABEL_TO_ALIGNMENT (insn);
2306 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2307 int max_skip = LABEL_TO_MAX_SKIP (insn);
2310 if (align && NEXT_INSN (insn))
2311 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2312 ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip);
2314 ASM_OUTPUT_ALIGN (file, align);
2319 /* If this label is reached from only one place, set the condition
2320 codes from the instruction just before the branch. */
2322 /* Disabled because some insns set cc_status in the C output code
2323 and NOTICE_UPDATE_CC alone can set incorrect status. */
2324 if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
2326 rtx jump = LABEL_REFS (insn);
2327 rtx barrier = prev_nonnote_insn (insn);
2329 /* If the LABEL_REFS field of this label has been set to point
2330 at a branch, the predecessor of the branch is a regular
2331 insn, and that branch is the only way to reach this label,
2332 set the condition codes based on the branch and its
2334 if (barrier && GET_CODE (barrier) == BARRIER
2335 && jump && GET_CODE (jump) == JUMP_INSN
2336 && (prev = prev_nonnote_insn (jump))
2337 && GET_CODE (prev) == INSN)
2339 NOTICE_UPDATE_CC (PATTERN (prev), prev);
2340 NOTICE_UPDATE_CC (PATTERN (jump), jump);
2348 #ifdef FINAL_PRESCAN_LABEL
2349 FINAL_PRESCAN_INSN (insn, NULL_PTR, 0);
2352 #ifdef SDB_DEBUGGING_INFO
2353 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
2354 sdbout_label (insn);
2356 #ifdef DWARF_DEBUGGING_INFO
2357 if (write_symbols == DWARF_DEBUG && LABEL_NAME (insn))
2358 dwarfout_label (insn);
2360 #ifdef DWARF2_DEBUGGING_INFO
2361 if (write_symbols == DWARF2_DEBUG && LABEL_NAME (insn))
2362 dwarf2out_label (insn);
2366 fputs (ASM_APP_OFF, file);
2369 if (NEXT_INSN (insn) != 0
2370 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
2372 rtx nextbody = PATTERN (NEXT_INSN (insn));
2374 /* If this label is followed by a jump-table,
2375 make sure we put the label in the read-only section. Also
2376 possibly write the label and jump table together. */
2378 if (GET_CODE (nextbody) == ADDR_VEC
2379 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
2381 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2382 /* In this case, the case vector is being moved by the
2383 target, so don't output the label at all. Leave that
2384 to the back end macros. */
2386 if (! JUMP_TABLES_IN_TEXT_SECTION)
2388 readonly_data_section ();
2389 #ifdef READONLY_DATA_SECTION
2390 ASM_OUTPUT_ALIGN (file,
2391 exact_log2 (BIGGEST_ALIGNMENT
2393 #endif /* READONLY_DATA_SECTION */
2396 function_section (current_function_decl);
2398 #ifdef ASM_OUTPUT_CASE_LABEL
2399 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
2402 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2409 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2414 register rtx body = PATTERN (insn);
2415 int insn_code_number;
2416 const char *template;
2421 /* An INSN, JUMP_INSN or CALL_INSN.
2422 First check for special kinds that recog doesn't recognize. */
2424 if (GET_CODE (body) == USE /* These are just declarations */
2425 || GET_CODE (body) == CLOBBER)
2429 /* If there is a REG_CC_SETTER note on this insn, it means that
2430 the setting of the condition code was done in the delay slot
2431 of the insn that branched here. So recover the cc status
2432 from the insn that set it. */
2434 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
2437 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
2438 cc_prev_status = cc_status;
2442 /* Detect insns that are really jump-tables
2443 and output them as such. */
2445 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
2447 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2448 register int vlen, idx;
2456 fputs (ASM_APP_OFF, file);
2460 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2461 if (GET_CODE (body) == ADDR_VEC)
2463 #ifdef ASM_OUTPUT_ADDR_VEC
2464 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2471 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2472 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2478 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
2479 for (idx = 0; idx < vlen; idx++)
2481 if (GET_CODE (body) == ADDR_VEC)
2483 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2484 ASM_OUTPUT_ADDR_VEC_ELT
2485 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
2492 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2493 ASM_OUTPUT_ADDR_DIFF_ELT
2496 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
2497 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
2503 #ifdef ASM_OUTPUT_CASE_END
2504 ASM_OUTPUT_CASE_END (file,
2505 CODE_LABEL_NUMBER (PREV_INSN (insn)),
2510 function_section (current_function_decl);
2515 /* Do basic-block profiling when we reach a new block.
2516 Done here to avoid jump tables. */
2517 if (profile_block_flag && new_block)
2520 if (GET_CODE (body) == ASM_INPUT)
2522 /* There's no telling what that did to the condition codes. */
2528 fputs (ASM_APP_ON, file);
2531 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
2535 /* Detect `asm' construct with operands. */
2536 if (asm_noperands (body) >= 0)
2538 unsigned int noperands = asm_noperands (body);
2539 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
2542 /* There's no telling what that did to the condition codes. */
2549 fputs (ASM_APP_ON, file);
2553 /* Get out the operand values. */
2554 string = decode_asm_operands (body, ops, NULL_PTR,
2555 NULL_PTR, NULL_PTR);
2556 /* Inhibit aborts on what would otherwise be compiler bugs. */
2557 insn_noperands = noperands;
2558 this_is_asm_operands = insn;
2560 /* Output the insn using them. */
2561 output_asm_insn (string, ops);
2562 this_is_asm_operands = 0;
2566 if (prescan <= 0 && app_on)
2568 fputs (ASM_APP_OFF, file);
2572 if (GET_CODE (body) == SEQUENCE)
2574 /* A delayed-branch sequence */
2580 final_sequence = body;
2582 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2583 force the restoration of a comparison that was previously
2584 thought unnecessary. If that happens, cancel this sequence
2585 and cause that insn to be restored. */
2587 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
2588 if (next != XVECEXP (body, 0, 1))
2594 for (i = 1; i < XVECLEN (body, 0); i++)
2596 rtx insn = XVECEXP (body, 0, i);
2597 rtx next = NEXT_INSN (insn);
2598 /* We loop in case any instruction in a delay slot gets
2601 insn = final_scan_insn (insn, file, 0, prescan, 1);
2602 while (insn != next);
2604 #ifdef DBR_OUTPUT_SEQEND
2605 DBR_OUTPUT_SEQEND (file);
2609 /* If the insn requiring the delay slot was a CALL_INSN, the
2610 insns in the delay slot are actually executed before the
2611 called function. Hence we don't preserve any CC-setting
2612 actions in these insns and the CC must be marked as being
2613 clobbered by the function. */
2614 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
2619 /* Following a conditional branch sequence, we have a new basic
2621 if (profile_block_flag)
2623 rtx insn = XVECEXP (body, 0, 0);
2624 rtx body = PATTERN (insn);
2626 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2627 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2628 || (GET_CODE (insn) == JUMP_INSN
2629 && GET_CODE (body) == PARALLEL
2630 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2631 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
2637 /* We have a real machine instruction as rtl. */
2639 body = PATTERN (insn);
2642 set = single_set(insn);
2644 /* Check for redundant test and compare instructions
2645 (when the condition codes are already set up as desired).
2646 This is done only when optimizing; if not optimizing,
2647 it should be possible for the user to alter a variable
2648 with the debugger in between statements
2649 and the next statement should reexamine the variable
2650 to compute the condition codes. */
2655 rtx set = single_set(insn);
2659 && GET_CODE (SET_DEST (set)) == CC0
2660 && insn != last_ignored_compare)
2662 if (GET_CODE (SET_SRC (set)) == SUBREG)
2663 SET_SRC (set) = alter_subreg (SET_SRC (set));
2664 else if (GET_CODE (SET_SRC (set)) == COMPARE)
2666 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
2667 XEXP (SET_SRC (set), 0)
2668 = alter_subreg (XEXP (SET_SRC (set), 0));
2669 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
2670 XEXP (SET_SRC (set), 1)
2671 = alter_subreg (XEXP (SET_SRC (set), 1));
2673 if ((cc_status.value1 != 0
2674 && rtx_equal_p (SET_SRC (set), cc_status.value1))
2675 || (cc_status.value2 != 0
2676 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
2678 /* Don't delete insn if it has an addressing side-effect. */
2679 if (! FIND_REG_INC_NOTE (insn, 0)
2680 /* or if anything in it is volatile. */
2681 && ! volatile_refs_p (PATTERN (insn)))
2683 /* We don't really delete the insn; just ignore it. */
2684 last_ignored_compare = insn;
2692 /* Following a conditional branch, we have a new basic block.
2693 But if we are inside a sequence, the new block starts after the
2694 last insn of the sequence. */
2695 if (profile_block_flag && final_sequence == 0
2696 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2697 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2698 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
2699 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2700 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
2704 /* Don't bother outputting obvious no-ops, even without -O.
2705 This optimization is fast and doesn't interfere with debugging.
2706 Don't do this if the insn is in a delay slot, since this
2707 will cause an improper number of delay insns to be written. */
2708 if (final_sequence == 0
2710 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
2711 && GET_CODE (SET_SRC (body)) == REG
2712 && GET_CODE (SET_DEST (body)) == REG
2713 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
2718 /* If this is a conditional branch, maybe modify it
2719 if the cc's are in a nonstandard state
2720 so that it accomplishes the same thing that it would
2721 do straightforwardly if the cc's were set up normally. */
2723 if (cc_status.flags != 0
2724 && GET_CODE (insn) == JUMP_INSN
2725 && GET_CODE (body) == SET
2726 && SET_DEST (body) == pc_rtx
2727 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
2728 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
2729 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
2730 /* This is done during prescan; it is not done again
2731 in final scan when prescan has been done. */
2734 /* This function may alter the contents of its argument
2735 and clear some of the cc_status.flags bits.
2736 It may also return 1 meaning condition now always true
2737 or -1 meaning condition now always false
2738 or 2 meaning condition nontrivial but altered. */
2739 register int result = alter_cond (XEXP (SET_SRC (body), 0));
2740 /* If condition now has fixed value, replace the IF_THEN_ELSE
2741 with its then-operand or its else-operand. */
2743 SET_SRC (body) = XEXP (SET_SRC (body), 1);
2745 SET_SRC (body) = XEXP (SET_SRC (body), 2);
2747 /* The jump is now either unconditional or a no-op.
2748 If it has become a no-op, don't try to output it.
2749 (It would not be recognized.) */
2750 if (SET_SRC (body) == pc_rtx)
2752 PUT_CODE (insn, NOTE);
2753 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2754 NOTE_SOURCE_FILE (insn) = 0;
2757 else if (GET_CODE (SET_SRC (body)) == RETURN)
2758 /* Replace (set (pc) (return)) with (return). */
2759 PATTERN (insn) = body = SET_SRC (body);
2761 /* Rerecognize the instruction if it has changed. */
2763 INSN_CODE (insn) = -1;
2766 /* Make same adjustments to instructions that examine the
2767 condition codes without jumping and instructions that
2768 handle conditional moves (if this machine has either one). */
2770 if (cc_status.flags != 0
2773 rtx cond_rtx, then_rtx, else_rtx;
2775 if (GET_CODE (insn) != JUMP_INSN
2776 && GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
2778 cond_rtx = XEXP (SET_SRC (set), 0);
2779 then_rtx = XEXP (SET_SRC (set), 1);
2780 else_rtx = XEXP (SET_SRC (set), 2);
2784 cond_rtx = SET_SRC (set);
2785 then_rtx = const_true_rtx;
2786 else_rtx = const0_rtx;
2789 switch (GET_CODE (cond_rtx))
2802 register int result;
2803 if (XEXP (cond_rtx, 0) != cc0_rtx)
2805 result = alter_cond (cond_rtx);
2807 validate_change (insn, &SET_SRC (set), then_rtx, 0);
2808 else if (result == -1)
2809 validate_change (insn, &SET_SRC (set), else_rtx, 0);
2810 else if (result == 2)
2811 INSN_CODE (insn) = -1;
2812 if (SET_DEST (set) == SET_SRC (set))
2814 PUT_CODE (insn, NOTE);
2815 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2816 NOTE_SOURCE_FILE (insn) = 0;
2828 /* Do machine-specific peephole optimizations if desired. */
2830 if (optimize && !flag_no_peephole && !nopeepholes)
2832 rtx next = peephole (insn);
2833 /* When peepholing, if there were notes within the peephole,
2834 emit them before the peephole. */
2835 if (next != 0 && next != NEXT_INSN (insn))
2837 rtx prev = PREV_INSN (insn);
2840 for (note = NEXT_INSN (insn); note != next;
2841 note = NEXT_INSN (note))
2842 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2844 /* In case this is prescan, put the notes
2845 in proper position for later rescan. */
2846 note = NEXT_INSN (insn);
2847 PREV_INSN (note) = prev;
2848 NEXT_INSN (prev) = note;
2849 NEXT_INSN (PREV_INSN (next)) = insn;
2850 PREV_INSN (insn) = PREV_INSN (next);
2851 NEXT_INSN (insn) = next;
2852 PREV_INSN (next) = insn;
2855 /* PEEPHOLE might have changed this. */
2856 body = PATTERN (insn);
2859 /* Try to recognize the instruction.
2860 If successful, verify that the operands satisfy the
2861 constraints for the instruction. Crash if they don't,
2862 since `reload' should have changed them so that they do. */
2864 insn_code_number = recog_memoized (insn);
2865 extract_insn (insn);
2866 cleanup_subreg_operands (insn);
2868 #ifdef REGISTER_CONSTRAINTS
2869 if (! constrain_operands (1))
2870 fatal_insn_not_found (insn);
2873 /* Some target machines need to prescan each insn before
2876 #ifdef FINAL_PRESCAN_INSN
2877 FINAL_PRESCAN_INSN (insn, recog_operand, recog_n_operands);
2881 cc_prev_status = cc_status;
2883 /* Update `cc_status' for this instruction.
2884 The instruction's output routine may change it further.
2885 If the output routine for a jump insn needs to depend
2886 on the cc status, it should look at cc_prev_status. */
2888 NOTICE_UPDATE_CC (body, insn);
2893 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2894 /* If we push arguments, we want to know where the calls are. */
2895 if (GET_CODE (insn) == CALL_INSN && dwarf2out_do_frame ())
2896 dwarf2out_frame_debug (insn);
2899 /* If the proper template needs to be chosen by some C code,
2900 run that code and get the real template. */
2902 template = insn_template[insn_code_number];
2905 template = (*insn_outfun[insn_code_number]) (recog_operand, insn);
2907 /* If the C code returns 0, it means that it is a jump insn
2908 which follows a deleted test insn, and that test insn
2909 needs to be reinserted. */
2912 if (prev_nonnote_insn (insn) != last_ignored_compare)
2915 return prev_nonnote_insn (insn);
2919 /* If the template is the string "#", it means that this insn must
2921 if (template[0] == '#' && template[1] == '\0')
2923 rtx new = try_split (body, insn, 0);
2925 /* If we didn't split the insn, go away. */
2926 if (new == insn && PATTERN (new) == body)
2927 fatal_insn ("Could not split insn", insn);
2929 #ifdef HAVE_ATTR_length
2930 /* This instruction should have been split in shorten_branches,
2931 to ensure that we would have valid length info for the
2943 /* Output assembler code from the template. */
2945 output_asm_insn (template, recog_operand);
2947 #if defined (DWARF2_UNWIND_INFO)
2948 #if !defined (ACCUMULATE_OUTGOING_ARGS)
2949 /* If we push arguments, we need to check all insns for stack
2951 if (GET_CODE (insn) == INSN && dwarf2out_do_frame ())
2952 dwarf2out_frame_debug (insn);
2954 #if defined (HAVE_prologue)
2955 /* If this insn is part of the prologue, emit DWARF v2
2957 if (RTX_FRAME_RELATED_P (insn) && dwarf2out_do_frame ())
2958 dwarf2out_frame_debug (insn);
2964 /* It's not at all clear why we did this and doing so interferes
2965 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2968 /* Mark this insn as having been output. */
2969 INSN_DELETED_P (insn) = 1;
2975 return NEXT_INSN (insn);
2978 /* Output debugging info to the assembler file FILE
2979 based on the NOTE-insn INSN, assumed to be a line number. */
2982 output_source_line (file, insn)
2986 register char *filename = NOTE_SOURCE_FILE (insn);
2988 /* Remember filename for basic block profiling.
2989 Filenames are allocated on the permanent obstack
2990 or are passed in ARGV, so we don't have to save
2993 if (profile_block_flag && last_filename != filename)
2994 bb_file_label_num = add_bb_string (filename, TRUE);
2996 last_filename = filename;
2997 last_linenum = NOTE_LINE_NUMBER (insn);
2998 high_block_linenum = MAX (last_linenum, high_block_linenum);
2999 high_function_linenum = MAX (last_linenum, high_function_linenum);
3001 if (write_symbols != NO_DEBUG)
3003 #ifdef SDB_DEBUGGING_INFO
3004 if (write_symbols == SDB_DEBUG
3005 #if 0 /* People like having line numbers even in wrong file! */
3006 /* COFF can't handle multiple source files--lose, lose. */
3007 && !strcmp (filename, main_input_filename)
3009 /* COFF relative line numbers must be positive. */
3010 && last_linenum > sdb_begin_function_line)
3012 #ifdef ASM_OUTPUT_SOURCE_LINE
3013 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
3015 fprintf (file, "\t.ln\t%d\n",
3016 ((sdb_begin_function_line > -1)
3017 ? last_linenum - sdb_begin_function_line : 1));
3022 #if defined (DBX_DEBUGGING_INFO)
3023 if (write_symbols == DBX_DEBUG)
3024 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
3027 #if defined (XCOFF_DEBUGGING_INFO)
3028 if (write_symbols == XCOFF_DEBUG)
3029 xcoffout_source_line (file, filename, insn);
3032 #ifdef DWARF_DEBUGGING_INFO
3033 if (write_symbols == DWARF_DEBUG)
3034 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
3037 #ifdef DWARF2_DEBUGGING_INFO
3038 if (write_symbols == DWARF2_DEBUG)
3039 dwarf2out_line (filename, NOTE_LINE_NUMBER (insn));
3045 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3046 directly to the desired hard register. */
3048 cleanup_subreg_operands (insn)
3053 extract_insn (insn);
3054 for (i = 0; i < recog_n_operands; i++)
3056 if (GET_CODE (recog_operand[i]) == SUBREG)
3057 recog_operand[i] = alter_subreg (recog_operand[i]);
3058 else if (GET_CODE (recog_operand[i]) == PLUS
3059 || GET_CODE (recog_operand[i]) == MULT
3060 || GET_CODE (recog_operand[i]) == MEM)
3061 recog_operand[i] = walk_alter_subreg (recog_operand[i]);
3064 for (i = 0; i < recog_n_dups; i++)
3066 if (GET_CODE (*recog_dup_loc[i]) == SUBREG)
3067 *recog_dup_loc[i] = alter_subreg (*recog_dup_loc[i]);
3068 else if (GET_CODE (*recog_dup_loc[i]) == PLUS
3069 || GET_CODE (*recog_dup_loc[i]) == MULT
3070 || GET_CODE (*recog_dup_loc[i]) == MEM)
3071 *recog_dup_loc[i] = walk_alter_subreg (*recog_dup_loc[i]);
3075 /* If X is a SUBREG, replace it with a REG or a MEM,
3076 based on the thing it is a subreg of. */
3082 register rtx y = SUBREG_REG (x);
3084 if (GET_CODE (y) == SUBREG)
3085 y = alter_subreg (y);
3087 /* If reload is operating, we may be replacing inside this SUBREG.
3088 Check for that and make a new one if so. */
3089 if (reload_in_progress && find_replacement (&SUBREG_REG (x)) != 0)
3092 if (GET_CODE (y) == REG)
3094 /* If the word size is larger than the size of this register,
3095 adjust the register number to compensate. */
3096 /* ??? Note that this just catches stragglers created by/for
3097 integrate. It would be better if we either caught these
3098 earlier, or kept _all_ subregs until now and eliminate
3099 gen_lowpart and friends. */
3102 #ifdef ALTER_HARD_SUBREG
3103 REGNO (x) = ALTER_HARD_SUBREG(GET_MODE (x), SUBREG_WORD (x),
3104 GET_MODE (y), REGNO (y));
3106 REGNO (x) = REGNO (y) + SUBREG_WORD (x);
3108 /* This field has a different meaning for REGs and SUBREGs. Make sure
3112 else if (GET_CODE (y) == MEM)
3114 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
3115 if (BYTES_BIG_ENDIAN)
3116 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
3117 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
3119 MEM_COPY_ATTRIBUTES (x, y);
3120 MEM_ALIAS_SET (x) = MEM_ALIAS_SET (y);
3121 XEXP (x, 0) = plus_constant_for_output (XEXP (y, 0), offset);
3127 /* Do alter_subreg on all the SUBREGs contained in X. */
3130 walk_alter_subreg (x)
3133 switch (GET_CODE (x))
3137 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3138 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
3142 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3146 return alter_subreg (x);
3157 /* Given BODY, the body of a jump instruction, alter the jump condition
3158 as required by the bits that are set in cc_status.flags.
3159 Not all of the bits there can be handled at this level in all cases.
3161 The value is normally 0.
3162 1 means that the condition has become always true.
3163 -1 means that the condition has become always false.
3164 2 means that COND has been altered. */
3172 if (cc_status.flags & CC_REVERSED)
3175 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
3178 if (cc_status.flags & CC_INVERTED)
3181 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
3184 if (cc_status.flags & CC_NOT_POSITIVE)
3185 switch (GET_CODE (cond))
3190 /* Jump becomes unconditional. */
3196 /* Jump becomes no-op. */
3200 PUT_CODE (cond, EQ);
3205 PUT_CODE (cond, NE);
3213 if (cc_status.flags & CC_NOT_NEGATIVE)
3214 switch (GET_CODE (cond))
3218 /* Jump becomes unconditional. */
3223 /* Jump becomes no-op. */
3228 PUT_CODE (cond, EQ);
3234 PUT_CODE (cond, NE);
3242 if (cc_status.flags & CC_NO_OVERFLOW)
3243 switch (GET_CODE (cond))
3246 /* Jump becomes unconditional. */
3250 PUT_CODE (cond, EQ);
3255 PUT_CODE (cond, NE);
3260 /* Jump becomes no-op. */
3267 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
3268 switch (GET_CODE (cond))
3274 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
3279 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
3284 if (cc_status.flags & CC_NOT_SIGNED)
3285 /* The flags are valid if signed condition operators are converted
3287 switch (GET_CODE (cond))
3290 PUT_CODE (cond, LEU);
3295 PUT_CODE (cond, LTU);
3300 PUT_CODE (cond, GTU);
3305 PUT_CODE (cond, GEU);
3317 /* Report inconsistency between the assembler template and the operands.
3318 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3321 output_operand_lossage (msgid)
3324 if (this_is_asm_operands)
3325 error_for_asm (this_is_asm_operands, "invalid `asm': %s", _(msgid));
3327 fatal ("Internal compiler error, output_operand_lossage `%s'", _(msgid));
3330 /* Output of assembler code from a template, and its subroutines. */
3332 /* Output text from TEMPLATE to the assembler output file,
3333 obeying %-directions to substitute operands taken from
3334 the vector OPERANDS.
3336 %N (for N a digit) means print operand N in usual manner.
3337 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3338 and print the label name with no punctuation.
3339 %cN means require operand N to be a constant
3340 and print the constant expression with no punctuation.
3341 %aN means expect operand N to be a memory address
3342 (not a memory reference!) and print a reference
3344 %nN means expect operand N to be a constant
3345 and print a constant expression for minus the value
3346 of the operand, with no other punctuation. */
3351 if (flag_print_asm_name)
3353 /* Annotate the assembly with a comment describing the pattern and
3354 alternative used. */
3357 register int num = INSN_CODE (debug_insn);
3358 fprintf (asm_out_file, "\t%s %d\t%s",
3359 ASM_COMMENT_START, INSN_UID (debug_insn), insn_name[num]);
3360 if (insn_n_alternatives[num] > 1)
3361 fprintf (asm_out_file, "/%d", which_alternative + 1);
3362 #ifdef HAVE_ATTR_length
3363 fprintf (asm_out_file, "\t[length = %d]", get_attr_length (debug_insn));
3365 /* Clear this so only the first assembler insn
3366 of any rtl insn will get the special comment for -dp. */
3373 output_asm_insn (template, operands)
3374 const char *template;
3377 register const char *p;
3380 /* An insn may return a null string template
3381 in a case where no assembler code is needed. */
3386 putc ('\t', asm_out_file);
3388 #ifdef ASM_OUTPUT_OPCODE
3389 ASM_OUTPUT_OPCODE (asm_out_file, p);
3397 putc (c, asm_out_file);
3398 #ifdef ASM_OUTPUT_OPCODE
3399 while ((c = *p) == '\t')
3401 putc (c, asm_out_file);
3404 ASM_OUTPUT_OPCODE (asm_out_file, p);
3408 #ifdef ASSEMBLER_DIALECT
3413 /* If we want the first dialect, do nothing. Otherwise, skip
3414 DIALECT_NUMBER of strings ending with '|'. */
3415 for (i = 0; i < dialect_number; i++)
3417 while (*p && *p++ != '|')
3427 /* Skip to close brace. */
3428 while (*p && *p++ != '}')
3437 /* %% outputs a single %. */
3441 putc (c, asm_out_file);
3443 /* %= outputs a number which is unique to each insn in the entire
3444 compilation. This is useful for making local labels that are
3445 referred to more than once in a given insn. */
3449 fprintf (asm_out_file, "%d", insn_counter);
3451 /* % followed by a letter and some digits
3452 outputs an operand in a special way depending on the letter.
3453 Letters `acln' are implemented directly.
3454 Other letters are passed to `output_operand' so that
3455 the PRINT_OPERAND macro can define them. */
3456 else if ((*p >= 'a' && *p <= 'z')
3457 || (*p >= 'A' && *p <= 'Z'))
3462 if (! (*p >= '0' && *p <= '9'))
3463 output_operand_lossage ("operand number missing after %-letter");
3464 else if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3465 output_operand_lossage ("operand number out of range");
3466 else if (letter == 'l')
3467 output_asm_label (operands[c]);
3468 else if (letter == 'a')
3469 output_address (operands[c]);
3470 else if (letter == 'c')
3472 if (CONSTANT_ADDRESS_P (operands[c]))
3473 output_addr_const (asm_out_file, operands[c]);
3475 output_operand (operands[c], 'c');
3477 else if (letter == 'n')
3479 if (GET_CODE (operands[c]) == CONST_INT)
3480 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
3481 - INTVAL (operands[c]));
3484 putc ('-', asm_out_file);
3485 output_addr_const (asm_out_file, operands[c]);
3489 output_operand (operands[c], letter);
3491 while ((c = *p) >= '0' && c <= '9') p++;
3493 /* % followed by a digit outputs an operand the default way. */
3494 else if (*p >= '0' && *p <= '9')
3497 if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3498 output_operand_lossage ("operand number out of range");
3500 output_operand (operands[c], 0);
3501 while ((c = *p) >= '0' && c <= '9') p++;
3503 /* % followed by punctuation: output something for that
3504 punctuation character alone, with no operand.
3505 The PRINT_OPERAND macro decides what is actually done. */
3506 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3507 else if (PRINT_OPERAND_PUNCT_VALID_P ((unsigned char)*p))
3508 output_operand (NULL_RTX, *p++);
3511 output_operand_lossage ("invalid %%-code");
3515 putc (c, asm_out_file);
3520 putc ('\n', asm_out_file);
3523 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3526 output_asm_label (x)
3531 if (GET_CODE (x) == LABEL_REF)
3532 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3533 else if (GET_CODE (x) == CODE_LABEL)
3534 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3536 output_operand_lossage ("`%l' operand isn't a label");
3538 assemble_name (asm_out_file, buf);
3541 /* Print operand X using machine-dependent assembler syntax.
3542 The macro PRINT_OPERAND is defined just to control this function.
3543 CODE is a non-digit that preceded the operand-number in the % spec,
3544 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3545 between the % and the digits.
3546 When CODE is a non-letter, X is 0.
3548 The meanings of the letters are machine-dependent and controlled
3549 by PRINT_OPERAND. */
3552 output_operand (x, code)
3556 if (x && GET_CODE (x) == SUBREG)
3557 x = alter_subreg (x);
3559 /* If X is a pseudo-register, abort now rather than writing trash to the
3562 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
3565 PRINT_OPERAND (asm_out_file, x, code);
3568 /* Print a memory reference operand for address X
3569 using machine-dependent assembler syntax.
3570 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3576 walk_alter_subreg (x);
3577 PRINT_OPERAND_ADDRESS (asm_out_file, x);
3580 /* Print an integer constant expression in assembler syntax.
3581 Addition and subtraction are the only arithmetic
3582 that may appear in these expressions. */
3585 output_addr_const (file, x)
3592 switch (GET_CODE (x))
3602 assemble_name (file, XSTR (x, 0));
3606 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3607 assemble_name (file, buf);
3611 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3612 assemble_name (file, buf);
3616 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
3620 /* This used to output parentheses around the expression,
3621 but that does not work on the 386 (either ATT or BSD assembler). */
3622 output_addr_const (file, XEXP (x, 0));
3626 if (GET_MODE (x) == VOIDmode)
3628 /* We can use %d if the number is one word and positive. */
3629 if (CONST_DOUBLE_HIGH (x))
3630 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3631 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
3632 else if (CONST_DOUBLE_LOW (x) < 0)
3633 fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
3635 fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
3638 /* We can't handle floating point constants;
3639 PRINT_OPERAND must handle them. */
3640 output_operand_lossage ("floating constant misused");
3644 /* Some assemblers need integer constants to appear last (eg masm). */
3645 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
3647 output_addr_const (file, XEXP (x, 1));
3648 if (INTVAL (XEXP (x, 0)) >= 0)
3649 fprintf (file, "+");
3650 output_addr_const (file, XEXP (x, 0));
3654 output_addr_const (file, XEXP (x, 0));
3655 if (INTVAL (XEXP (x, 1)) >= 0)
3656 fprintf (file, "+");
3657 output_addr_const (file, XEXP (x, 1));
3662 /* Avoid outputting things like x-x or x+5-x,
3663 since some assemblers can't handle that. */
3664 x = simplify_subtraction (x);
3665 if (GET_CODE (x) != MINUS)
3668 output_addr_const (file, XEXP (x, 0));
3669 fprintf (file, "-");
3670 if (GET_CODE (XEXP (x, 1)) == CONST_INT
3671 && INTVAL (XEXP (x, 1)) < 0)
3673 fprintf (file, ASM_OPEN_PAREN);
3674 output_addr_const (file, XEXP (x, 1));
3675 fprintf (file, ASM_CLOSE_PAREN);
3678 output_addr_const (file, XEXP (x, 1));
3683 output_addr_const (file, XEXP (x, 0));
3687 output_operand_lossage ("invalid expression as operand");
3691 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3692 %R prints the value of REGISTER_PREFIX.
3693 %L prints the value of LOCAL_LABEL_PREFIX.
3694 %U prints the value of USER_LABEL_PREFIX.
3695 %I prints the value of IMMEDIATE_PREFIX.
3696 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3697 Also supported are %d, %x, %s, %e, %f, %g and %%.
3699 We handle alternate assembler dialects here, just like output_asm_insn. */
3702 asm_fprintf VPROTO((FILE *file, const char *p, ...))
3704 #ifndef ANSI_PROTOTYPES
3712 VA_START (argptr, p);
3714 #ifndef ANSI_PROTOTYPES
3715 file = va_arg (argptr, FILE *);
3716 p = va_arg (argptr, const char *);
3724 #ifdef ASSEMBLER_DIALECT
3729 /* If we want the first dialect, do nothing. Otherwise, skip
3730 DIALECT_NUMBER of strings ending with '|'. */
3731 for (i = 0; i < dialect_number; i++)
3733 while (*p && *p++ != '|')
3743 /* Skip to close brace. */
3744 while (*p && *p++ != '}')
3755 while ((c >= '0' && c <= '9') || c == '.')
3763 fprintf (file, "%%");
3766 case 'd': case 'i': case 'u':
3767 case 'x': case 'p': case 'X':
3771 fprintf (file, buf, va_arg (argptr, int));
3775 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3776 but we do not check for those cases. It means that the value
3777 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3779 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3781 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3791 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3798 fprintf (file, buf, va_arg (argptr, long));
3806 fprintf (file, buf, va_arg (argptr, double));
3812 fprintf (file, buf, va_arg (argptr, char *));
3816 #ifdef ASM_OUTPUT_OPCODE
3817 ASM_OUTPUT_OPCODE (asm_out_file, p);
3822 #ifdef REGISTER_PREFIX
3823 fprintf (file, "%s", REGISTER_PREFIX);
3828 #ifdef IMMEDIATE_PREFIX
3829 fprintf (file, "%s", IMMEDIATE_PREFIX);
3834 #ifdef LOCAL_LABEL_PREFIX
3835 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
3840 fputs (user_label_prefix, file);
3853 /* Split up a CONST_DOUBLE or integer constant rtx
3854 into two rtx's for single words,
3855 storing in *FIRST the word that comes first in memory in the target
3856 and in *SECOND the other. */
3859 split_double (value, first, second)
3861 rtx *first, *second;
3863 if (GET_CODE (value) == CONST_INT)
3865 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3867 /* In this case the CONST_INT holds both target words.
3868 Extract the bits from it into two word-sized pieces.
3869 Sign extend each half to HOST_WIDE_INT. */
3871 /* On machines where HOST_BITS_PER_WIDE_INT == BITS_PER_WORD
3872 the shift below will cause a compiler warning, even though
3873 this code won't be executed. So put the shift amounts in
3874 variables to avoid the warning. */
3875 int rshift = HOST_BITS_PER_WIDE_INT - BITS_PER_WORD;
3876 int lshift = HOST_BITS_PER_WIDE_INT - 2 * BITS_PER_WORD;
3878 low = GEN_INT ((INTVAL (value) << rshift) >> rshift);
3879 high = GEN_INT ((INTVAL (value) << lshift) >> rshift);
3880 if (WORDS_BIG_ENDIAN)
3893 /* The rule for using CONST_INT for a wider mode
3894 is that we regard the value as signed.
3895 So sign-extend it. */
3896 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
3897 if (WORDS_BIG_ENDIAN)
3909 else if (GET_CODE (value) != CONST_DOUBLE)
3911 if (WORDS_BIG_ENDIAN)
3913 *first = const0_rtx;
3919 *second = const0_rtx;
3922 else if (GET_MODE (value) == VOIDmode
3923 /* This is the old way we did CONST_DOUBLE integers. */
3924 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
3926 /* In an integer, the words are defined as most and least significant.
3927 So order them by the target's convention. */
3928 if (WORDS_BIG_ENDIAN)
3930 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3931 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3935 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3936 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3941 #ifdef REAL_ARITHMETIC
3942 REAL_VALUE_TYPE r; long l[2];
3943 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
3945 /* Note, this converts the REAL_VALUE_TYPE to the target's
3946 format, splits up the floating point double and outputs
3947 exactly 32 bits of it into each of l[0] and l[1] --
3948 not necessarily BITS_PER_WORD bits. */
3949 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
3951 /* If 32 bits is an entire word for the target, but not for the host,
3952 then sign-extend on the host so that the number will look the same
3953 way on the host that it would on the target. See for instance
3954 simplify_unary_operation. The #if is needed to avoid compiler
3957 #if HOST_BITS_PER_LONG > 32
3958 if (BITS_PER_WORD < HOST_BITS_PER_LONG && BITS_PER_WORD == 32)
3960 if (l[0] & ((long) 1 << 31))
3961 l[0] |= ((long) (-1) << 32);
3962 if (l[1] & ((long) 1 << 31))
3963 l[1] |= ((long) (-1) << 32);
3967 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
3968 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
3970 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
3971 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
3972 && ! flag_pretend_float)
3976 #ifdef HOST_WORDS_BIG_ENDIAN
3983 /* Host and target agree => no need to swap. */
3984 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3985 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3989 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3990 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3992 #endif /* no REAL_ARITHMETIC */
3996 /* Return nonzero if this function has no function calls. */
4003 if (profile_flag || profile_block_flag || profile_arc_flag)
4006 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4008 if (GET_CODE (insn) == CALL_INSN)
4010 if (GET_CODE (insn) == INSN
4011 && GET_CODE (PATTERN (insn)) == SEQUENCE
4012 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN)
4015 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4017 if (GET_CODE (XEXP (insn, 0)) == CALL_INSN)
4019 if (GET_CODE (XEXP (insn, 0)) == INSN
4020 && GET_CODE (PATTERN (XEXP (insn, 0))) == SEQUENCE
4021 && GET_CODE (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)) == CALL_INSN)
4028 /* On some machines, a function with no call insns
4029 can run faster if it doesn't create its own register window.
4030 When output, the leaf function should use only the "output"
4031 registers. Ordinarily, the function would be compiled to use
4032 the "input" registers to find its arguments; it is a candidate
4033 for leaf treatment if it uses only the "input" registers.
4034 Leaf function treatment means renumbering so the function
4035 uses the "output" registers instead. */
4037 #ifdef LEAF_REGISTERS
4039 static char permitted_reg_in_leaf_functions[] = LEAF_REGISTERS;
4041 /* Return 1 if this function uses only the registers that can be
4042 safely renumbered. */
4045 only_leaf_regs_used ()
4049 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4050 if ((regs_ever_live[i] || global_regs[i])
4051 && ! permitted_reg_in_leaf_functions[i])
4054 if (current_function_uses_pic_offset_table
4055 && pic_offset_table_rtx != 0
4056 && GET_CODE (pic_offset_table_rtx) == REG
4057 && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4063 /* Scan all instructions and renumber all registers into those
4064 available in leaf functions. */
4067 leaf_renumber_regs (first)
4072 /* Renumber only the actual patterns.
4073 The reg-notes can contain frame pointer refs,
4074 and renumbering them could crash, and should not be needed. */
4075 for (insn = first; insn; insn = NEXT_INSN (insn))
4076 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
4077 leaf_renumber_regs_insn (PATTERN (insn));
4078 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4079 if (GET_RTX_CLASS (GET_CODE (XEXP (insn, 0))) == 'i')
4080 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
4083 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4084 available in leaf functions. */
4087 leaf_renumber_regs_insn (in_rtx)
4088 register rtx in_rtx;
4091 register char *format_ptr;
4096 /* Renumber all input-registers into output-registers.
4097 renumbered_regs would be 1 for an output-register;
4100 if (GET_CODE (in_rtx) == REG)
4104 /* Don't renumber the same reg twice. */
4108 newreg = REGNO (in_rtx);
4109 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4110 to reach here as part of a REG_NOTE. */
4111 if (newreg >= FIRST_PSEUDO_REGISTER)
4116 newreg = LEAF_REG_REMAP (newreg);
4119 regs_ever_live[REGNO (in_rtx)] = 0;
4120 regs_ever_live[newreg] = 1;
4121 REGNO (in_rtx) = newreg;
4125 if (GET_RTX_CLASS (GET_CODE (in_rtx)) == 'i')
4127 /* Inside a SEQUENCE, we find insns.
4128 Renumber just the patterns of these insns,
4129 just as we do for the top-level insns. */
4130 leaf_renumber_regs_insn (PATTERN (in_rtx));
4134 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
4136 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
4137 switch (*format_ptr++)
4140 leaf_renumber_regs_insn (XEXP (in_rtx, i));
4144 if (NULL != XVEC (in_rtx, i))
4146 for (j = 0; j < XVECLEN (in_rtx, i); j++)
4147 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));