1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-98, 1999 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This is the final pass of the compiler.
23 It looks at the rtl code for a function and outputs assembler code.
25 Call `final_start_function' to output the assembler code for function entry,
26 `final' to output assembler code for some RTL code,
27 `final_end_function' to output assembler code for function exit.
28 If a function is compiled in several pieces, each piece is
29 output separately with `final'.
31 Some optimizations are also done at this level.
32 Move instructions that were made unnecessary by good register allocation
33 are detected and omitted from the output. (Though most of these
34 are removed by the last jump pass.)
36 Instructions to set the condition codes are omitted when it can be
37 seen that the condition codes already had the desired values.
39 In some cases it is sufficient if the inherited condition codes
40 have related values, but this may require the following insn
41 (the one that tests the condition codes) to be modified.
43 The code for the function prologue and epilogue are generated
44 directly as assembler code by the macros FUNCTION_PROLOGUE and
45 FUNCTION_EPILOGUE. Those instructions never exist as rtl. */
53 #include "insn-config.h"
54 #include "insn-flags.h"
55 #include "insn-attr.h"
56 #include "insn-codes.h"
58 #include "conditions.h"
61 #include "hard-reg-set.h"
69 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
70 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
72 #if defined (USG) || !defined (HAVE_STAB_H)
73 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
78 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
80 #ifdef XCOFF_DEBUGGING_INFO
84 #ifdef DWARF_DEBUGGING_INFO
88 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
89 #include "dwarf2out.h"
92 #ifdef SDB_DEBUGGING_INFO
96 /* .stabd code for line number. */
101 /* .stabs code for included file name. */
106 #ifndef INT_TYPE_SIZE
107 #define INT_TYPE_SIZE BITS_PER_WORD
110 #ifndef LONG_TYPE_SIZE
111 #define LONG_TYPE_SIZE BITS_PER_WORD
114 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
115 null default for it to save conditionalization later. */
116 #ifndef CC_STATUS_INIT
117 #define CC_STATUS_INIT
120 /* How to start an assembler comment. */
121 #ifndef ASM_COMMENT_START
122 #define ASM_COMMENT_START ";#"
125 /* Is the given character a logical line separator for the assembler? */
126 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
127 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
130 #ifndef JUMP_TABLES_IN_TEXT_SECTION
131 #define JUMP_TABLES_IN_TEXT_SECTION 0
134 /* Last insn processed by final_scan_insn. */
135 static rtx debug_insn = 0;
137 /* Line number of last NOTE. */
138 static int last_linenum;
140 /* Highest line number in current block. */
141 static int high_block_linenum;
143 /* Likewise for function. */
144 static int high_function_linenum;
146 /* Filename of last NOTE. */
147 static char *last_filename;
149 /* Number of basic blocks seen so far;
150 used if profile_block_flag is set. */
151 static int count_basic_blocks;
153 /* Number of instrumented arcs when profile_arc_flag is set. */
154 extern int count_instrumented_arcs;
156 extern int length_unit_log; /* This is defined in insn-attrtab.c. */
158 /* Nonzero while outputting an `asm' with operands.
159 This means that inconsistencies are the user's fault, so don't abort.
160 The precise value is the insn being output, to pass to error_for_asm. */
161 static rtx this_is_asm_operands;
163 /* Number of operands of this insn, for an `asm' with operands. */
164 static unsigned int insn_noperands;
166 /* Compare optimization flag. */
168 static rtx last_ignored_compare = 0;
170 /* Flag indicating this insn is the start of a new basic block. */
172 static int new_block = 1;
174 /* All the symbol-blocks (levels of scoping) in the compilation
175 are assigned sequence numbers in order of appearance of the
176 beginnings of the symbol-blocks. Both final and dbxout do this,
177 and assume that they will both give the same number to each block.
178 Final uses these sequence numbers to generate assembler label names
179 LBBnnn and LBEnnn for the beginning and end of the symbol-block.
180 Dbxout uses the sequence numbers to generate references to the same labels
181 from the dbx debugging information.
183 Sdb records this level at the beginning of each function,
184 in order to find the current level when recursing down declarations.
185 It outputs the block beginning and endings
186 at the point in the asm file where the blocks would begin and end. */
188 int next_block_index;
190 /* Assign a unique number to each insn that is output.
191 This can be used to generate unique local labels. */
193 static int insn_counter = 0;
196 /* This variable contains machine-dependent flags (defined in tm.h)
197 set and examined by output routines
198 that describe how to interpret the condition codes properly. */
202 /* During output of an insn, this contains a copy of cc_status
203 from before the insn. */
205 CC_STATUS cc_prev_status;
208 /* Indexed by hardware reg number, is 1 if that register is ever
209 used in the current function.
211 In life_analysis, or in stupid_life_analysis, this is set
212 up to record the hard regs used explicitly. Reload adds
213 in the hard regs used for holding pseudo regs. Final uses
214 it to generate the code in the function prologue and epilogue
215 to save and restore registers as needed. */
217 char regs_ever_live[FIRST_PSEUDO_REGISTER];
219 /* Nonzero means current function must be given a frame pointer.
220 Set in stmt.c if anything is allocated on the stack there.
221 Set in reload1.c if anything is allocated on the stack there. */
223 int frame_pointer_needed;
225 /* Assign unique numbers to labels generated for profiling. */
227 int profile_label_no;
229 /* Length so far allocated in PENDING_BLOCKS. */
231 static int max_block_depth;
233 /* Stack of sequence numbers of symbol-blocks of which we have seen the
234 beginning but not yet the end. Sequence numbers are assigned at
235 the beginning; this stack allows us to find the sequence number
236 of a block that is ending. */
238 static int *pending_blocks;
240 /* Number of elements currently in use in PENDING_BLOCKS. */
242 static int block_depth;
244 /* Nonzero if have enabled APP processing of our assembler output. */
248 /* If we are outputting an insn sequence, this contains the sequence rtx.
253 #ifdef ASSEMBLER_DIALECT
255 /* Number of the assembler dialect to use, starting at 0. */
256 static int dialect_number;
259 /* Indexed by line number, nonzero if there is a note for that line. */
261 static char *line_note_exists;
263 /* Linked list to hold line numbers for each basic block. */
266 struct bb_list *next; /* pointer to next basic block */
267 int line_num; /* line number */
268 int file_label_num; /* LPBC<n> label # for stored filename */
269 int func_label_num; /* LPBC<n> label # for stored function name */
272 static struct bb_list *bb_head = 0; /* Head of basic block list */
273 static struct bb_list **bb_tail = &bb_head; /* Ptr to store next bb ptr */
274 static int bb_file_label_num = -1; /* Current label # for file */
275 static int bb_func_label_num = -1; /* Current label # for func */
277 /* Linked list to hold the strings for each file and function name output. */
280 struct bb_str *next; /* pointer to next string */
281 const char *string; /* string */
282 int label_num; /* label number */
283 int length; /* string length */
286 extern rtx peephole PROTO((rtx));
288 static struct bb_str *sbb_head = 0; /* Head of string list. */
289 static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */
290 static int sbb_label_num = 0; /* Last label used */
292 #ifdef HAVE_ATTR_length
293 static int asm_insn_count PROTO((rtx));
295 static void profile_function PROTO((FILE *));
296 static void profile_after_prologue PROTO((FILE *));
297 static void add_bb PROTO((FILE *));
298 static int add_bb_string PROTO((const char *, int));
299 static void output_source_line PROTO((FILE *, rtx));
300 static rtx walk_alter_subreg PROTO((rtx));
301 static void output_asm_name PROTO((void));
302 static void output_operand PROTO((rtx, int));
303 #ifdef LEAF_REGISTERS
304 static void leaf_renumber_regs PROTO((rtx));
307 static int alter_cond PROTO((rtx));
310 extern char *getpwd ();
312 /* Initialize data in final at the beginning of a compilation. */
315 init_final (filename)
318 next_block_index = 2;
320 max_block_depth = 20;
321 pending_blocks = (int *) xmalloc (20 * sizeof *pending_blocks);
324 #ifdef ASSEMBLER_DIALECT
325 dialect_number = ASSEMBLER_DIALECT;
329 /* Called at end of source file,
330 to output the block-profiling table for this entire compilation. */
334 const char *filename;
338 if (profile_block_flag || profile_arc_flag)
341 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
345 int long_bytes = LONG_TYPE_SIZE / BITS_PER_UNIT;
346 int pointer_bytes = POINTER_SIZE / BITS_PER_UNIT;
348 if (profile_block_flag)
349 size = long_bytes * count_basic_blocks;
351 size = long_bytes * count_instrumented_arcs;
354 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
355 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
356 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
360 /* Output the main header, of 11 words:
361 0: 1 if this file is initialized, else 0.
362 1: address of file name (LPBX1).
363 2: address of table of counts (LPBX2).
364 3: number of counts in the table.
365 4: always 0, for compatibility with Sun.
367 The following are GNU extensions:
369 5: address of table of start addrs of basic blocks (LPBX3).
370 6: Number of bytes in this header.
371 7: address of table of function names (LPBX4).
372 8: address of table of line numbers (LPBX5) or 0.
373 9: address of table of file names (LPBX6) or 0.
374 10: space reserved for basic block profiling. */
376 ASM_OUTPUT_ALIGN (asm_out_file, align);
378 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
380 assemble_integer (const0_rtx, long_bytes, 1);
382 /* address of filename */
383 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
384 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
386 /* address of count table */
387 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
388 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
390 /* count of the # of basic blocks or # of instrumented arcs */
391 if (profile_block_flag)
392 assemble_integer (GEN_INT (count_basic_blocks), long_bytes, 1);
394 assemble_integer (GEN_INT (count_instrumented_arcs), long_bytes,
397 /* zero word (link field) */
398 assemble_integer (const0_rtx, pointer_bytes, 1);
400 /* address of basic block start address table */
401 if (profile_block_flag)
403 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
404 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
408 assemble_integer (const0_rtx, pointer_bytes, 1);
410 /* byte count for extended structure. */
411 assemble_integer (GEN_INT (11 * UNITS_PER_WORD), long_bytes, 1);
413 /* address of function name table */
414 if (profile_block_flag)
416 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
417 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
421 assemble_integer (const0_rtx, pointer_bytes, 1);
423 /* address of line number and filename tables if debugging. */
424 if (write_symbols != NO_DEBUG && profile_block_flag)
426 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
427 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
428 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
429 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
433 assemble_integer (const0_rtx, pointer_bytes, 1);
434 assemble_integer (const0_rtx, pointer_bytes, 1);
437 /* space for extension ptr (link field) */
438 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
440 /* Output the file name changing the suffix to .d for Sun tcov
442 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
444 char *cwd = getpwd ();
445 int len = strlen (filename) + strlen (cwd) + 1;
446 char *data_file = (char *) alloca (len + 4);
448 strcpy (data_file, cwd);
449 strcat (data_file, "/");
450 strcat (data_file, filename);
451 strip_off_ending (data_file, len);
452 if (profile_block_flag)
453 strcat (data_file, ".d");
455 strcat (data_file, ".da");
456 assemble_string (data_file, strlen (data_file) + 1);
459 /* Make space for the table of counts. */
462 /* Realign data section. */
463 ASM_OUTPUT_ALIGN (asm_out_file, align);
464 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
466 assemble_zeros (size);
470 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
471 #ifdef ASM_OUTPUT_SHARED_LOCAL
472 if (flag_shared_data)
473 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
476 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
477 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
480 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
481 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
484 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
489 /* Output any basic block strings */
490 if (profile_block_flag)
492 readonly_data_section ();
495 ASM_OUTPUT_ALIGN (asm_out_file, align);
496 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
498 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC",
500 assemble_string (sptr->string, sptr->length);
505 /* Output the table of addresses. */
506 if (profile_block_flag)
508 /* Realign in new section */
509 ASM_OUTPUT_ALIGN (asm_out_file, align);
510 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
511 for (i = 0; i < count_basic_blocks; i++)
513 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
514 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
519 /* Output the table of function names. */
520 if (profile_block_flag)
522 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
523 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
525 if (ptr->func_label_num >= 0)
527 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
528 ptr->func_label_num);
529 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
533 assemble_integer (const0_rtx, pointer_bytes, 1);
536 for ( ; i < count_basic_blocks; i++)
537 assemble_integer (const0_rtx, pointer_bytes, 1);
540 if (write_symbols != NO_DEBUG && profile_block_flag)
542 /* Output the table of line numbers. */
543 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
544 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
545 assemble_integer (GEN_INT (ptr->line_num), long_bytes, 1);
547 for ( ; i < count_basic_blocks; i++)
548 assemble_integer (const0_rtx, long_bytes, 1);
550 /* Output the table of file names. */
551 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
552 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
554 if (ptr->file_label_num >= 0)
556 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
557 ptr->file_label_num);
558 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
562 assemble_integer (const0_rtx, pointer_bytes, 1);
565 for ( ; i < count_basic_blocks; i++)
566 assemble_integer (const0_rtx, pointer_bytes, 1);
569 /* End with the address of the table of addresses,
570 so we can find it easily, as the last word in the file's text. */
571 if (profile_block_flag)
573 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
574 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
580 /* Enable APP processing of subsequent output.
581 Used before the output from an `asm' statement. */
588 fputs (ASM_APP_ON, asm_out_file);
593 /* Disable APP processing of subsequent output.
594 Called from varasm.c before most kinds of output. */
601 fputs (ASM_APP_OFF, asm_out_file);
606 /* Return the number of slots filled in the current
607 delayed branch sequence (we don't count the insn needing the
608 delay slot). Zero if not in a delayed branch sequence. */
612 dbr_sequence_length ()
614 if (final_sequence != 0)
615 return XVECLEN (final_sequence, 0) - 1;
621 /* The next two pages contain routines used to compute the length of an insn
622 and to shorten branches. */
624 /* Arrays for insn lengths, and addresses. The latter is referenced by
625 `insn_current_length'. */
627 static short *insn_lengths;
630 /* Max uid for which the above arrays are valid. */
631 static int insn_lengths_max_uid;
633 /* Address of insn being processed. Used by `insn_current_length'. */
634 int insn_current_address;
636 /* Address of insn being processed in previous iteration. */
637 int insn_last_address;
639 /* konwn invariant alignment of insn being processed. */
640 int insn_current_align;
642 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
643 gives the next following alignment insn that increases the known
644 alignment, or NULL_RTX if there is no such insn.
645 For any alignment obtained this way, we can again index uid_align with
646 its uid to obtain the next following align that in turn increases the
647 alignment, till we reach NULL_RTX; the sequence obtained this way
648 for each insn we'll call the alignment chain of this insn in the following
651 struct label_alignment {
656 static rtx *uid_align;
657 static int *uid_shuid;
658 static struct label_alignment *label_align;
660 /* Indicate that branch shortening hasn't yet been done. */
679 insn_lengths_max_uid = 0;
683 free (insn_addresses);
693 /* Obtain the current length of an insn. If branch shortening has been done,
694 get its actual length. Otherwise, get its maximum length. */
697 get_attr_length (insn)
700 #ifdef HAVE_ATTR_length
705 if (insn_lengths_max_uid > INSN_UID (insn))
706 return insn_lengths[INSN_UID (insn)];
708 switch (GET_CODE (insn))
716 length = insn_default_length (insn);
720 body = PATTERN (insn);
721 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
723 /* Alignment is machine-dependent and should be handled by
727 length = insn_default_length (insn);
731 body = PATTERN (insn);
732 if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
735 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
736 length = asm_insn_count (body) * insn_default_length (insn);
737 else if (GET_CODE (body) == SEQUENCE)
738 for (i = 0; i < XVECLEN (body, 0); i++)
739 length += get_attr_length (XVECEXP (body, 0, i));
741 length = insn_default_length (insn);
748 #ifdef ADJUST_INSN_LENGTH
749 ADJUST_INSN_LENGTH (insn, length);
752 #else /* not HAVE_ATTR_length */
754 #endif /* not HAVE_ATTR_length */
757 /* Code to handle alignment inside shorten_branches. */
759 /* Here is an explanation how the algorithm in align_fuzz can give
762 Call a sequence of instructions beginning with alignment point X
763 and continuing until the next alignment point `block X'. When `X'
764 is used in an expression, it means the alignment value of the
767 Call the distance between the start of the first insn of block X, and
768 the end of the last insn of block X `IX', for the `inner size of X'.
769 This is clearly the sum of the instruction lengths.
771 Likewise with the next alignment-delimited block following X, which we
774 Call the distance between the start of the first insn of block X, and
775 the start of the first insn of block Y `OX', for the `outer size of X'.
777 The estimated padding is then OX - IX.
779 OX can be safely estimated as
784 OX = round_up(IX, X) + Y - X
786 Clearly est(IX) >= real(IX), because that only depends on the
787 instruction lengths, and those being overestimated is a given.
789 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
790 we needn't worry about that when thinking about OX.
792 When X >= Y, the alignment provided by Y adds no uncertainty factor
793 for branch ranges starting before X, so we can just round what we have.
794 But when X < Y, we don't know anything about the, so to speak,
795 `middle bits', so we have to assume the worst when aligning up from an
796 address mod X to one mod Y, which is Y - X. */
799 #define LABEL_ALIGN(LABEL) 0
802 #ifndef LABEL_ALIGN_MAX_SKIP
803 #define LABEL_ALIGN_MAX_SKIP 0
807 #define LOOP_ALIGN(LABEL) 0
810 #ifndef LOOP_ALIGN_MAX_SKIP
811 #define LOOP_ALIGN_MAX_SKIP 0
814 #ifndef LABEL_ALIGN_AFTER_BARRIER
815 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
818 #ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
819 #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP 0
822 #ifndef ADDR_VEC_ALIGN
824 final_addr_vec_align (addr_vec)
827 int align = exact_log2 (GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec))));
829 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
830 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
834 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
837 #ifndef INSN_LENGTH_ALIGNMENT
838 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
841 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
843 static int min_labelno, max_labelno;
845 #define LABEL_TO_ALIGNMENT(LABEL) \
846 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
848 #define LABEL_TO_MAX_SKIP(LABEL) \
849 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
851 /* For the benefit of port specific code do this also as a function. */
853 label_to_alignment (label)
856 return LABEL_TO_ALIGNMENT (label);
859 #ifdef HAVE_ATTR_length
860 /* The differences in addresses
861 between a branch and its target might grow or shrink depending on
862 the alignment the start insn of the range (the branch for a forward
863 branch or the label for a backward branch) starts out on; if these
864 differences are used naively, they can even oscillate infinitely.
865 We therefore want to compute a 'worst case' address difference that
866 is independent of the alignment the start insn of the range end
867 up on, and that is at least as large as the actual difference.
868 The function align_fuzz calculates the amount we have to add to the
869 naively computed difference, by traversing the part of the alignment
870 chain of the start insn of the range that is in front of the end insn
871 of the range, and considering for each alignment the maximum amount
872 that it might contribute to a size increase.
874 For casesi tables, we also want to know worst case minimum amounts of
875 address difference, in case a machine description wants to introduce
876 some common offset that is added to all offsets in a table.
877 For this purpose, align_fuzz with a growth argument of 0 comuptes the
878 appropriate adjustment. */
881 /* Compute the maximum delta by which the difference of the addresses of
882 START and END might grow / shrink due to a different address for start
883 which changes the size of alignment insns between START and END.
884 KNOWN_ALIGN_LOG is the alignment known for START.
885 GROWTH should be ~0 if the objective is to compute potential code size
886 increase, and 0 if the objective is to compute potential shrink.
887 The return value is undefined for any other value of GROWTH. */
889 align_fuzz (start, end, known_align_log, growth)
894 int uid = INSN_UID (start);
896 int known_align = 1 << known_align_log;
897 int end_shuid = INSN_SHUID (end);
900 for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
902 int align_addr, new_align;
904 uid = INSN_UID (align_label);
905 align_addr = insn_addresses[uid] - insn_lengths[uid];
906 if (uid_shuid[uid] > end_shuid)
908 known_align_log = LABEL_TO_ALIGNMENT (align_label);
909 new_align = 1 << known_align_log;
910 if (new_align < known_align)
912 fuzz += (-align_addr ^ growth) & (new_align - known_align);
913 known_align = new_align;
918 /* Compute a worst-case reference address of a branch so that it
919 can be safely used in the presence of aligned labels. Since the
920 size of the branch itself is unknown, the size of the branch is
921 not included in the range. I.e. for a forward branch, the reference
922 address is the end address of the branch as known from the previous
923 branch shortening pass, minus a value to account for possible size
924 increase due to alignment. For a backward branch, it is the start
925 address of the branch as known from the current pass, plus a value
926 to account for possible size increase due to alignment.
927 NB.: Therefore, the maximum offset allowed for backward branches needs
928 to exclude the branch size. */
930 insn_current_reference_address (branch)
934 rtx seq = NEXT_INSN (PREV_INSN (branch));
935 int seq_uid = INSN_UID (seq);
936 if (GET_CODE (branch) != JUMP_INSN)
937 /* This can happen for example on the PA; the objective is to know the
938 offset to address something in front of the start of the function.
939 Thus, we can treat it like a backward branch.
940 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
941 any alignment we'd encounter, so we skip the call to align_fuzz. */
942 return insn_current_address;
943 dest = JUMP_LABEL (branch);
944 /* BRANCH has no proper alignment chain set, so use SEQ. */
945 if (INSN_SHUID (branch) < INSN_SHUID (dest))
947 /* Forward branch. */
948 return (insn_last_address + insn_lengths[seq_uid]
949 - align_fuzz (seq, dest, length_unit_log, ~0));
953 /* Backward branch. */
954 return (insn_current_address
955 + align_fuzz (dest, seq, length_unit_log, ~0));
958 #endif /* HAVE_ATTR_length */
960 /* Make a pass over all insns and compute their actual lengths by shortening
961 any branches of variable length if possible. */
963 /* Give a default value for the lowest address in a function. */
965 #ifndef FIRST_INSN_ADDRESS
966 #define FIRST_INSN_ADDRESS 0
969 /* shorten_branches might be called multiple times: for example, the SH
970 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
971 In order to do this, it needs proper length information, which it obtains
972 by calling shorten_branches. This cannot be collapsed with
973 shorten_branches itself into a single pass unless we also want to intergate
974 reorg.c, since the branch splitting exposes new instructions with delay
978 shorten_branches (first)
986 #ifdef HAVE_ATTR_length
987 #define MAX_CODE_ALIGN 16
989 int something_changed = 1;
990 char *varying_length;
993 rtx align_tab[MAX_CODE_ALIGN];
995 /* In order to make sure that all instructions have valid length info,
996 we must split them before we compute the address/length info. */
998 for (insn = NEXT_INSN (first); insn; insn = NEXT_INSN (insn))
999 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1002 insn = try_split (PATTERN (old), old, 1);
1003 /* When not optimizing, the old insn will be still left around
1004 with only the 'deleted' bit set. Transform it into a note
1005 to avoid confusion of subsequent processing. */
1006 if (INSN_DELETED_P (old))
1008 PUT_CODE (old , NOTE);
1009 NOTE_LINE_NUMBER (old) = NOTE_INSN_DELETED;
1010 NOTE_SOURCE_FILE (old) = 0;
1015 /* We must do some computations even when not actually shortening, in
1016 order to get the alignment information for the labels. */
1018 init_insn_lengths ();
1020 /* Compute maximum UID and allocate label_align / uid_shuid. */
1021 max_uid = get_max_uid ();
1023 max_labelno = max_label_num ();
1024 min_labelno = get_first_label_num ();
1025 label_align = (struct label_alignment *) xmalloc (
1026 (max_labelno - min_labelno + 1) * sizeof (struct label_alignment));
1027 bzero ((char *) label_align,
1028 (max_labelno - min_labelno + 1) * sizeof (struct label_alignment));
1030 uid_shuid = (int *) xmalloc (max_uid * sizeof *uid_shuid);
1032 /* Initialize label_align and set up uid_shuid to be strictly
1033 monotonically rising with insn order. */
1034 /* We use max_log here to keep track of the maximum alignment we want to
1035 impose on the next CODE_LABEL (or the current one if we are processing
1036 the CODE_LABEL itself). */
1041 for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
1045 INSN_SHUID (insn) = i++;
1046 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1048 /* reorg might make the first insn of a loop being run once only,
1049 and delete the label in front of it. Then we want to apply
1050 the loop alignment to the new label created by reorg, which
1051 is separated by the former loop start insn from the
1052 NOTE_INSN_LOOP_BEG. */
1054 else if (GET_CODE (insn) == CODE_LABEL)
1058 log = LABEL_ALIGN (insn);
1062 max_skip = LABEL_ALIGN_MAX_SKIP;
1064 next = NEXT_INSN (insn);
1065 /* ADDR_VECs only take room if read-only data goes into the text
1067 if (JUMP_TABLES_IN_TEXT_SECTION
1068 #if !defined(READONLY_DATA_SECTION)
1072 if (next && GET_CODE (next) == JUMP_INSN)
1074 rtx nextbody = PATTERN (next);
1075 if (GET_CODE (nextbody) == ADDR_VEC
1076 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1078 log = ADDR_VEC_ALIGN (next);
1082 max_skip = LABEL_ALIGN_MAX_SKIP;
1086 LABEL_TO_ALIGNMENT (insn) = max_log;
1087 LABEL_TO_MAX_SKIP (insn) = max_skip;
1091 else if (GET_CODE (insn) == BARRIER)
1095 for (label = insn; label && GET_RTX_CLASS (GET_CODE (label)) != 'i';
1096 label = NEXT_INSN (label))
1097 if (GET_CODE (label) == CODE_LABEL)
1099 log = LABEL_ALIGN_AFTER_BARRIER (insn);
1103 max_skip = LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP;
1108 /* Again, we allow NOTE_INSN_LOOP_BEG - INSN - CODE_LABEL
1109 sequences in order to handle reorg output efficiently. */
1110 else if (GET_CODE (insn) == NOTE
1111 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
1115 for (label = insn; label; label = NEXT_INSN (label))
1116 if (GET_CODE (label) == CODE_LABEL)
1118 log = LOOP_ALIGN (insn);
1122 max_skip = LOOP_ALIGN_MAX_SKIP;
1130 #ifdef HAVE_ATTR_length
1132 /* Allocate the rest of the arrays. */
1133 insn_lengths = (short *) xmalloc (max_uid * sizeof (short));
1134 insn_addresses = (int *) xmalloc (max_uid * sizeof (int));
1135 insn_lengths_max_uid = max_uid;
1136 /* Syntax errors can lead to labels being outside of the main insn stream.
1137 Initialize insn_addresses, so that we get reproducible results. */
1138 bzero ((char *)insn_addresses, max_uid * sizeof *insn_addresses);
1139 uid_align = (rtx *) xmalloc (max_uid * sizeof *uid_align);
1141 varying_length = (char *) xmalloc (max_uid * sizeof (char));
1143 bzero (varying_length, max_uid);
1145 /* Initialize uid_align. We scan instructions
1146 from end to start, and keep in align_tab[n] the last seen insn
1147 that does an alignment of at least n+1, i.e. the successor
1148 in the alignment chain for an insn that does / has a known
1151 bzero ((char *) uid_align, max_uid * sizeof *uid_align);
1153 for (i = MAX_CODE_ALIGN; --i >= 0; )
1154 align_tab[i] = NULL_RTX;
1155 seq = get_last_insn ();
1156 for (; seq; seq = PREV_INSN (seq))
1158 int uid = INSN_UID (seq);
1160 log = (GET_CODE (seq) == CODE_LABEL ? LABEL_TO_ALIGNMENT (seq) : 0);
1161 uid_align[uid] = align_tab[0];
1164 /* Found an alignment label. */
1165 uid_align[uid] = align_tab[log];
1166 for (i = log - 1; i >= 0; i--)
1170 #ifdef CASE_VECTOR_SHORTEN_MODE
1173 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1176 int min_shuid = INSN_SHUID (get_insns ()) - 1;
1177 int max_shuid = INSN_SHUID (get_last_insn ()) + 1;
1180 for (insn = first; insn != 0; insn = NEXT_INSN (insn))
1182 rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat;
1183 int len, i, min, max, insn_shuid;
1185 addr_diff_vec_flags flags;
1187 if (GET_CODE (insn) != JUMP_INSN
1188 || GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)
1190 pat = PATTERN (insn);
1191 len = XVECLEN (pat, 1);
1194 min_align = MAX_CODE_ALIGN;
1195 for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
1197 rtx lab = XEXP (XVECEXP (pat, 1, i), 0);
1198 int shuid = INSN_SHUID (lab);
1209 if (min_align > LABEL_TO_ALIGNMENT (lab))
1210 min_align = LABEL_TO_ALIGNMENT (lab);
1212 XEXP (pat, 2) = gen_rtx_LABEL_REF (VOIDmode, min_lab);
1213 XEXP (pat, 3) = gen_rtx_LABEL_REF (VOIDmode, max_lab);
1214 insn_shuid = INSN_SHUID (insn);
1215 rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0));
1216 flags.min_align = min_align;
1217 flags.base_after_vec = rel > insn_shuid;
1218 flags.min_after_vec = min > insn_shuid;
1219 flags.max_after_vec = max > insn_shuid;
1220 flags.min_after_base = min > rel;
1221 flags.max_after_base = max > rel;
1222 ADDR_DIFF_VEC_FLAGS (pat) = flags;
1225 #endif /* CASE_VECTOR_SHORTEN_MODE */
1228 /* Compute initial lengths, addresses, and varying flags for each insn. */
1229 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1231 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1233 uid = INSN_UID (insn);
1235 insn_lengths[uid] = 0;
1237 if (GET_CODE (insn) == CODE_LABEL)
1239 int log = LABEL_TO_ALIGNMENT (insn);
1242 int align = 1 << log;
1243 int new_address = (insn_current_address + align - 1) & -align;
1244 insn_lengths[uid] = new_address - insn_current_address;
1245 insn_current_address = new_address;
1249 insn_addresses[uid] = insn_current_address;
1251 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
1252 || GET_CODE (insn) == CODE_LABEL)
1254 if (INSN_DELETED_P (insn))
1257 body = PATTERN (insn);
1258 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1260 /* This only takes room if read-only data goes into the text
1262 if (JUMP_TABLES_IN_TEXT_SECTION
1263 #if !defined(READONLY_DATA_SECTION)
1267 insn_lengths[uid] = (XVECLEN (body,
1268 GET_CODE (body) == ADDR_DIFF_VEC)
1269 * GET_MODE_SIZE (GET_MODE (body)));
1270 /* Alignment is handled by ADDR_VEC_ALIGN. */
1272 else if (asm_noperands (body) >= 0)
1273 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
1274 else if (GET_CODE (body) == SEQUENCE)
1277 int const_delay_slots;
1279 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
1281 const_delay_slots = 0;
1283 /* Inside a delay slot sequence, we do not do any branch shortening
1284 if the shortening could change the number of delay slots
1286 for (i = 0; i < XVECLEN (body, 0); i++)
1288 rtx inner_insn = XVECEXP (body, 0, i);
1289 int inner_uid = INSN_UID (inner_insn);
1292 if (asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
1293 inner_length = (asm_insn_count (PATTERN (inner_insn))
1294 * insn_default_length (inner_insn));
1296 inner_length = insn_default_length (inner_insn);
1298 insn_lengths[inner_uid] = inner_length;
1299 if (const_delay_slots)
1301 if ((varying_length[inner_uid]
1302 = insn_variable_length_p (inner_insn)) != 0)
1303 varying_length[uid] = 1;
1304 insn_addresses[inner_uid] = (insn_current_address +
1308 varying_length[inner_uid] = 0;
1309 insn_lengths[uid] += inner_length;
1312 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
1314 insn_lengths[uid] = insn_default_length (insn);
1315 varying_length[uid] = insn_variable_length_p (insn);
1318 /* If needed, do any adjustment. */
1319 #ifdef ADJUST_INSN_LENGTH
1320 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
1321 if (insn_lengths[uid] < 0)
1322 fatal_insn ("Negative insn length", insn);
1326 /* Now loop over all the insns finding varying length insns. For each,
1327 get the current insn length. If it has changed, reflect the change.
1328 When nothing changes for a full pass, we are done. */
1330 while (something_changed)
1332 something_changed = 0;
1333 insn_current_align = MAX_CODE_ALIGN - 1;
1334 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1336 insn = NEXT_INSN (insn))
1339 #ifdef ADJUST_INSN_LENGTH
1344 uid = INSN_UID (insn);
1346 if (GET_CODE (insn) == CODE_LABEL)
1348 int log = LABEL_TO_ALIGNMENT (insn);
1349 if (log > insn_current_align)
1351 int align = 1 << log;
1352 int new_address= (insn_current_address + align - 1) & -align;
1353 insn_lengths[uid] = new_address - insn_current_address;
1354 insn_current_align = log;
1355 insn_current_address = new_address;
1358 insn_lengths[uid] = 0;
1359 insn_addresses[uid] = insn_current_address;
1363 length_align = INSN_LENGTH_ALIGNMENT (insn);
1364 if (length_align < insn_current_align)
1365 insn_current_align = length_align;
1367 insn_last_address = insn_addresses[uid];
1368 insn_addresses[uid] = insn_current_address;
1370 #ifdef CASE_VECTOR_SHORTEN_MODE
1371 if (optimize && GET_CODE (insn) == JUMP_INSN
1372 && GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
1374 rtx body = PATTERN (insn);
1375 int old_length = insn_lengths[uid];
1376 rtx rel_lab = XEXP (XEXP (body, 0), 0);
1377 rtx min_lab = XEXP (XEXP (body, 2), 0);
1378 rtx max_lab = XEXP (XEXP (body, 3), 0);
1379 addr_diff_vec_flags flags = ADDR_DIFF_VEC_FLAGS (body);
1380 int rel_addr = insn_addresses[INSN_UID (rel_lab)];
1381 int min_addr = insn_addresses[INSN_UID (min_lab)];
1382 int max_addr = insn_addresses[INSN_UID (max_lab)];
1386 /* Try to find a known alignment for rel_lab. */
1387 for (prev = rel_lab;
1389 && ! insn_lengths[INSN_UID (prev)]
1390 && ! (varying_length[INSN_UID (prev)] & 1);
1391 prev = PREV_INSN (prev))
1392 if (varying_length[INSN_UID (prev)] & 2)
1394 rel_align = LABEL_TO_ALIGNMENT (prev);
1398 /* See the comment on addr_diff_vec_flags in rtl.h for the
1399 meaning of the flags values. base: REL_LAB vec: INSN */
1400 /* Anything after INSN has still addresses from the last
1401 pass; adjust these so that they reflect our current
1402 estimate for this pass. */
1403 if (flags.base_after_vec)
1404 rel_addr += insn_current_address - insn_last_address;
1405 if (flags.min_after_vec)
1406 min_addr += insn_current_address - insn_last_address;
1407 if (flags.max_after_vec)
1408 max_addr += insn_current_address - insn_last_address;
1409 /* We want to know the worst case, i.e. lowest possible value
1410 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1411 its offset is positive, and we have to be wary of code shrink;
1412 otherwise, it is negative, and we have to be vary of code
1414 if (flags.min_after_base)
1416 /* If INSN is between REL_LAB and MIN_LAB, the size
1417 changes we are about to make can change the alignment
1418 within the observed offset, therefore we have to break
1419 it up into two parts that are independent. */
1420 if (! flags.base_after_vec && flags.min_after_vec)
1422 min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
1423 min_addr -= align_fuzz (insn, min_lab, 0, 0);
1426 min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
1430 if (flags.base_after_vec && ! flags.min_after_vec)
1432 min_addr -= align_fuzz (min_lab, insn, 0, ~0);
1433 min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
1436 min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
1438 /* Likewise, determine the highest lowest possible value
1439 for the offset of MAX_LAB. */
1440 if (flags.max_after_base)
1442 if (! flags.base_after_vec && flags.max_after_vec)
1444 max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
1445 max_addr += align_fuzz (insn, max_lab, 0, ~0);
1448 max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
1452 if (flags.base_after_vec && ! flags.max_after_vec)
1454 max_addr += align_fuzz (max_lab, insn, 0, 0);
1455 max_addr += align_fuzz (insn, rel_lab, 0, 0);
1458 max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
1460 PUT_MODE (body, CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
1461 max_addr - rel_addr,
1463 if (JUMP_TABLES_IN_TEXT_SECTION
1464 #if !defined(READONLY_DATA_SECTION)
1470 = (XVECLEN (body, 1) * GET_MODE_SIZE (GET_MODE (body)));
1471 insn_current_address += insn_lengths[uid];
1472 if (insn_lengths[uid] != old_length)
1473 something_changed = 1;
1478 #endif /* CASE_VECTOR_SHORTEN_MODE */
1480 if (! (varying_length[uid]))
1482 insn_current_address += insn_lengths[uid];
1485 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
1489 body = PATTERN (insn);
1491 for (i = 0; i < XVECLEN (body, 0); i++)
1493 rtx inner_insn = XVECEXP (body, 0, i);
1494 int inner_uid = INSN_UID (inner_insn);
1497 insn_addresses[inner_uid] = insn_current_address;
1499 /* insn_current_length returns 0 for insns with a
1500 non-varying length. */
1501 if (! varying_length[inner_uid])
1502 inner_length = insn_lengths[inner_uid];
1504 inner_length = insn_current_length (inner_insn);
1506 if (inner_length != insn_lengths[inner_uid])
1508 insn_lengths[inner_uid] = inner_length;
1509 something_changed = 1;
1511 insn_current_address += insn_lengths[inner_uid];
1512 new_length += inner_length;
1517 new_length = insn_current_length (insn);
1518 insn_current_address += new_length;
1521 #ifdef ADJUST_INSN_LENGTH
1522 /* If needed, do any adjustment. */
1523 tmp_length = new_length;
1524 ADJUST_INSN_LENGTH (insn, new_length);
1525 insn_current_address += (new_length - tmp_length);
1528 if (new_length != insn_lengths[uid])
1530 insn_lengths[uid] = new_length;
1531 something_changed = 1;
1534 /* For a non-optimizing compile, do only a single pass. */
1539 free (varying_length);
1541 #endif /* HAVE_ATTR_length */
1544 #ifdef HAVE_ATTR_length
1545 /* Given the body of an INSN known to be generated by an ASM statement, return
1546 the number of machine instructions likely to be generated for this insn.
1547 This is used to compute its length. */
1550 asm_insn_count (body)
1556 if (GET_CODE (body) == ASM_INPUT)
1557 template = XSTR (body, 0);
1559 template = decode_asm_operands (body, NULL_PTR, NULL_PTR,
1560 NULL_PTR, NULL_PTR);
1562 for ( ; *template; template++)
1563 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
1570 /* Output assembler code for the start of a function,
1571 and initialize some of the variables in this file
1572 for the new function. The label for the function and associated
1573 assembler pseudo-ops have already been output in `assemble_start_function'.
1575 FIRST is the first insn of the rtl for the function being compiled.
1576 FILE is the file to write assembler code to.
1577 OPTIMIZE is nonzero if we should eliminate redundant
1578 test and compare insns. */
1581 final_start_function (first, file, optimize)
1588 this_is_asm_operands = 0;
1590 #ifdef NON_SAVING_SETJMP
1591 /* A function that calls setjmp should save and restore all the
1592 call-saved registers on a system where longjmp clobbers them. */
1593 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
1597 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1598 if (!call_used_regs[i])
1599 regs_ever_live[i] = 1;
1603 /* Initial line number is supposed to be output
1604 before the function's prologue and label
1605 so that the function's address will not appear to be
1606 in the last statement of the preceding function. */
1607 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1608 last_linenum = high_block_linenum = high_function_linenum
1609 = NOTE_LINE_NUMBER (first);
1611 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1612 /* Output DWARF definition of the function. */
1613 if (dwarf2out_do_frame ())
1614 dwarf2out_begin_prologue ();
1617 /* For SDB and XCOFF, the function beginning must be marked between
1618 the function label and the prologue. We always need this, even when
1619 -g1 was used. Defer on MIPS systems so that parameter descriptions
1620 follow function entry. */
1621 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
1622 if (write_symbols == SDB_DEBUG)
1623 sdbout_begin_function (last_linenum);
1626 #ifdef XCOFF_DEBUGGING_INFO
1627 if (write_symbols == XCOFF_DEBUG)
1628 xcoffout_begin_function (file, last_linenum);
1631 /* But only output line number for other debug info types if -g2
1633 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1634 output_source_line (file, first);
1636 #ifdef LEAF_REG_REMAP
1637 if (current_function_uses_only_leaf_regs)
1638 leaf_renumber_regs (first);
1641 /* The Sun386i and perhaps other machines don't work right
1642 if the profiling code comes after the prologue. */
1643 #ifdef PROFILE_BEFORE_PROLOGUE
1645 profile_function (file);
1646 #endif /* PROFILE_BEFORE_PROLOGUE */
1648 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1649 if (dwarf2out_do_frame ())
1650 dwarf2out_frame_debug (NULL_RTX);
1653 #ifdef FUNCTION_PROLOGUE
1654 /* First output the function prologue: code to set up the stack frame. */
1655 FUNCTION_PROLOGUE (file, get_frame_size ());
1658 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1659 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
1660 next_block_index = 1;
1663 /* If the machine represents the prologue as RTL, the profiling code must
1664 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1665 #ifdef HAVE_prologue
1666 if (! HAVE_prologue)
1668 profile_after_prologue (file);
1672 /* If we are doing basic block profiling, remember a printable version
1673 of the function name. */
1674 if (profile_block_flag)
1677 = add_bb_string ((*decl_printable_name) (current_function_decl, 2), FALSE);
1682 profile_after_prologue (file)
1685 #ifdef FUNCTION_BLOCK_PROFILER
1686 if (profile_block_flag)
1688 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
1690 #endif /* FUNCTION_BLOCK_PROFILER */
1692 #ifndef PROFILE_BEFORE_PROLOGUE
1694 profile_function (file);
1695 #endif /* not PROFILE_BEFORE_PROLOGUE */
1699 profile_function (file)
1702 int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1703 #if defined(ASM_OUTPUT_REG_PUSH)
1704 #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1705 int sval = current_function_returns_struct;
1707 #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1708 int cxt = current_function_needs_context;
1710 #endif /* ASM_OUTPUT_REG_PUSH */
1713 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1714 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
1715 assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, 1);
1717 function_section (current_function_decl);
1719 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1721 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
1723 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1726 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1731 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1733 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1735 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1738 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1743 FUNCTION_PROFILER (file, profile_label_no);
1745 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1747 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1749 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1752 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1757 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1759 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1761 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1764 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1770 /* Output assembler code for the end of a function.
1771 For clarity, args are same as those of `final_start_function'
1772 even though not all of them are needed. */
1775 final_end_function (first, file, optimize)
1782 fputs (ASM_APP_OFF, file);
1786 #ifdef SDB_DEBUGGING_INFO
1787 if (write_symbols == SDB_DEBUG)
1788 sdbout_end_function (high_function_linenum);
1791 #ifdef DWARF_DEBUGGING_INFO
1792 if (write_symbols == DWARF_DEBUG)
1793 dwarfout_end_function ();
1796 #ifdef XCOFF_DEBUGGING_INFO
1797 if (write_symbols == XCOFF_DEBUG)
1798 xcoffout_end_function (file, high_function_linenum);
1801 #ifdef FUNCTION_EPILOGUE
1802 /* Finally, output the function epilogue:
1803 code to restore the stack frame and return to the caller. */
1804 FUNCTION_EPILOGUE (file, get_frame_size ());
1807 #ifdef SDB_DEBUGGING_INFO
1808 if (write_symbols == SDB_DEBUG)
1809 sdbout_end_epilogue ();
1812 #ifdef DWARF_DEBUGGING_INFO
1813 if (write_symbols == DWARF_DEBUG)
1814 dwarfout_end_epilogue ();
1817 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1818 if (dwarf2out_do_frame ())
1819 dwarf2out_end_epilogue ();
1822 #ifdef XCOFF_DEBUGGING_INFO
1823 if (write_symbols == XCOFF_DEBUG)
1824 xcoffout_end_epilogue (file);
1827 bb_func_label_num = -1; /* not in function, nuke label # */
1829 /* If FUNCTION_EPILOGUE is not defined, then the function body
1830 itself contains return instructions wherever needed. */
1833 /* Add a block to the linked list that remembers the current line/file/function
1834 for basic block profiling. Emit the label in front of the basic block and
1835 the instructions that increment the count field. */
1841 struct bb_list *ptr = (struct bb_list *) permalloc (sizeof (struct bb_list));
1843 /* Add basic block to linked list. */
1845 ptr->line_num = last_linenum;
1846 ptr->file_label_num = bb_file_label_num;
1847 ptr->func_label_num = bb_func_label_num;
1849 bb_tail = &ptr->next;
1851 /* Enable the table of basic-block use counts
1852 to point at the code it applies to. */
1853 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1855 /* Before first insn of this basic block, increment the
1856 count of times it was entered. */
1857 #ifdef BLOCK_PROFILER
1858 BLOCK_PROFILER (file, count_basic_blocks);
1865 count_basic_blocks++;
1868 /* Add a string to be used for basic block profiling. */
1871 add_bb_string (string, perm_p)
1876 struct bb_str *ptr = 0;
1880 string = "<unknown>";
1884 /* Allocate a new string if the current string isn't permanent. If
1885 the string is permanent search for the same string in other
1888 len = strlen (string) + 1;
1891 char *p = (char *) permalloc (len);
1892 bcopy (string, p, len);
1896 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1897 if (ptr->string == string)
1900 /* Allocate a new string block if we need to. */
1903 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1906 ptr->label_num = sbb_label_num++;
1907 ptr->string = string;
1909 sbb_tail = &ptr->next;
1912 return ptr->label_num;
1916 /* Output assembler code for some insns: all or part of a function.
1917 For description of args, see `final_start_function', above.
1919 PRESCAN is 1 if we are not really outputting,
1920 just scanning as if we were outputting.
1921 Prescanning deletes and rearranges insns just like ordinary output.
1922 PRESCAN is -2 if we are outputting after having prescanned.
1923 In this case, don't try to delete or rearrange insns
1924 because that has already been done.
1925 Prescanning is done only on certain machines. */
1928 final (first, file, optimize, prescan)
1938 last_ignored_compare = 0;
1941 check_exception_handler_labels ();
1943 /* Make a map indicating which line numbers appear in this function.
1944 When producing SDB debugging info, delete troublesome line number
1945 notes from inlined functions in other files as well as duplicate
1946 line number notes. */
1947 #ifdef SDB_DEBUGGING_INFO
1948 if (write_symbols == SDB_DEBUG)
1951 for (insn = first; insn; insn = NEXT_INSN (insn))
1952 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1954 if ((RTX_INTEGRATED_P (insn)
1955 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1957 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1958 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1960 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1961 NOTE_SOURCE_FILE (insn) = 0;
1965 if (NOTE_LINE_NUMBER (insn) > max_line)
1966 max_line = NOTE_LINE_NUMBER (insn);
1972 for (insn = first; insn; insn = NEXT_INSN (insn))
1973 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1974 max_line = NOTE_LINE_NUMBER (insn);
1977 line_note_exists = (char *) oballoc (max_line + 1);
1978 bzero (line_note_exists, max_line + 1);
1980 for (insn = first; insn; insn = NEXT_INSN (insn))
1982 if (INSN_UID (insn) > max_uid) /* find largest UID */
1983 max_uid = INSN_UID (insn);
1984 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1985 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
1987 /* If CC tracking across branches is enabled, record the insn which
1988 jumps to each branch only reached from one place. */
1989 if (optimize && GET_CODE (insn) == JUMP_INSN)
1991 rtx lab = JUMP_LABEL (insn);
1992 if (lab && LABEL_NUSES (lab) == 1)
1994 LABEL_REFS (lab) = insn;
2000 /* Initialize insn_eh_region table if eh is being used. */
2002 init_insn_eh_region (first, max_uid);
2008 /* Output the insns. */
2009 for (insn = NEXT_INSN (first); insn;)
2011 #ifdef HAVE_ATTR_length
2012 insn_current_address = insn_addresses[INSN_UID (insn)];
2014 insn = final_scan_insn (insn, file, optimize, prescan, 0);
2017 /* Do basic-block profiling here
2018 if the last insn was a conditional branch. */
2019 if (profile_block_flag && new_block)
2022 free_insn_eh_region ();
2025 /* The final scan for one insn, INSN.
2026 Args are same as in `final', except that INSN
2027 is the insn being scanned.
2028 Value returned is the next insn to be scanned.
2030 NOPEEPHOLES is the flag to disallow peephole processing (currently
2031 used for within delayed branch sequence output). */
2034 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
2047 /* Ignore deleted insns. These can occur when we split insns (due to a
2048 template of "#") while not optimizing. */
2049 if (INSN_DELETED_P (insn))
2050 return NEXT_INSN (insn);
2052 switch (GET_CODE (insn))
2058 /* Align the beginning of a loop, for higher speed
2059 on certain machines. */
2061 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
2062 break; /* This used to depend on optimize, but that was bogus. */
2063 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END)
2066 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG
2067 && ! exceptions_via_longjmp)
2069 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHB", NOTE_BLOCK_NUMBER (insn));
2070 if (! flag_new_exceptions)
2071 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn));
2072 #ifdef ASM_OUTPUT_EH_REGION_BEG
2073 ASM_OUTPUT_EH_REGION_BEG (file, NOTE_BLOCK_NUMBER (insn));
2078 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END
2079 && ! exceptions_via_longjmp)
2081 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHE", NOTE_BLOCK_NUMBER (insn));
2082 if (flag_new_exceptions)
2083 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn));
2084 #ifdef ASM_OUTPUT_EH_REGION_END
2085 ASM_OUTPUT_EH_REGION_END (file, NOTE_BLOCK_NUMBER (insn));
2090 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
2092 #ifdef FUNCTION_END_PROLOGUE
2093 FUNCTION_END_PROLOGUE (file);
2095 profile_after_prologue (file);
2099 #ifdef FUNCTION_BEGIN_EPILOGUE
2100 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
2102 FUNCTION_BEGIN_EPILOGUE (file);
2107 if (write_symbols == NO_DEBUG)
2109 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
2111 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
2112 /* MIPS stabs require the parameter descriptions to be after the
2113 function entry point rather than before. */
2114 if (write_symbols == SDB_DEBUG)
2115 sdbout_begin_function (last_linenum);
2118 #ifdef DWARF_DEBUGGING_INFO
2119 /* This outputs a marker where the function body starts, so it
2120 must be after the prologue. */
2121 if (write_symbols == DWARF_DEBUG)
2122 dwarfout_begin_function ();
2126 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED)
2127 break; /* An insn that was "deleted" */
2130 fputs (ASM_APP_OFF, file);
2133 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG
2134 && (debug_info_level == DINFO_LEVEL_NORMAL
2135 || debug_info_level == DINFO_LEVEL_VERBOSE
2136 || write_symbols == DWARF_DEBUG
2137 || write_symbols == DWARF2_DEBUG))
2139 /* Beginning of a symbol-block. Assign it a sequence number
2140 and push the number onto the stack PENDING_BLOCKS. */
2142 if (block_depth == max_block_depth)
2144 /* PENDING_BLOCKS is full; make it longer. */
2145 max_block_depth *= 2;
2147 = (int *) xrealloc (pending_blocks,
2148 max_block_depth * sizeof (int));
2150 pending_blocks[block_depth++] = next_block_index;
2152 high_block_linenum = last_linenum;
2154 /* Output debugging info about the symbol-block beginning. */
2156 #ifdef SDB_DEBUGGING_INFO
2157 if (write_symbols == SDB_DEBUG)
2158 sdbout_begin_block (file, last_linenum, next_block_index);
2160 #ifdef XCOFF_DEBUGGING_INFO
2161 if (write_symbols == XCOFF_DEBUG)
2162 xcoffout_begin_block (file, last_linenum, next_block_index);
2164 #ifdef DBX_DEBUGGING_INFO
2165 if (write_symbols == DBX_DEBUG)
2166 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", next_block_index);
2168 #ifdef DWARF_DEBUGGING_INFO
2169 if (write_symbols == DWARF_DEBUG)
2170 dwarfout_begin_block (next_block_index);
2172 #ifdef DWARF2_DEBUGGING_INFO
2173 if (write_symbols == DWARF2_DEBUG)
2174 dwarf2out_begin_block (next_block_index);
2179 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END
2180 && (debug_info_level == DINFO_LEVEL_NORMAL
2181 || debug_info_level == DINFO_LEVEL_VERBOSE
2182 || write_symbols == DWARF_DEBUG
2183 || write_symbols == DWARF2_DEBUG))
2185 /* End of a symbol-block. Pop its sequence number off
2186 PENDING_BLOCKS and output debugging info based on that. */
2189 if (block_depth < 0)
2192 #ifdef XCOFF_DEBUGGING_INFO
2193 if (write_symbols == XCOFF_DEBUG)
2194 xcoffout_end_block (file, high_block_linenum,
2195 pending_blocks[block_depth]);
2197 #ifdef DBX_DEBUGGING_INFO
2198 if (write_symbols == DBX_DEBUG)
2199 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE",
2200 pending_blocks[block_depth]);
2202 #ifdef SDB_DEBUGGING_INFO
2203 if (write_symbols == SDB_DEBUG)
2204 sdbout_end_block (file, high_block_linenum,
2205 pending_blocks[block_depth]);
2207 #ifdef DWARF_DEBUGGING_INFO
2208 if (write_symbols == DWARF_DEBUG)
2209 dwarfout_end_block (pending_blocks[block_depth]);
2211 #ifdef DWARF2_DEBUGGING_INFO
2212 if (write_symbols == DWARF2_DEBUG)
2213 dwarf2out_end_block (pending_blocks[block_depth]);
2216 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL
2217 && (debug_info_level == DINFO_LEVEL_NORMAL
2218 || debug_info_level == DINFO_LEVEL_VERBOSE))
2220 #ifdef DWARF_DEBUGGING_INFO
2221 if (write_symbols == DWARF_DEBUG)
2222 dwarfout_label (insn);
2224 #ifdef DWARF2_DEBUGGING_INFO
2225 if (write_symbols == DWARF2_DEBUG)
2226 dwarf2out_label (insn);
2229 else if (NOTE_LINE_NUMBER (insn) > 0)
2230 /* This note is a line-number. */
2234 #if 0 /* This is what we used to do. */
2235 output_source_line (file, insn);
2239 /* If there is anything real after this note,
2240 output it. If another line note follows, omit this one. */
2241 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
2243 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
2245 /* These types of notes can be significant
2246 so make sure the preceding line number stays. */
2247 else if (GET_CODE (note) == NOTE
2248 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
2249 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
2250 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
2252 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
2254 /* Another line note follows; we can delete this note
2255 if no intervening line numbers have notes elsewhere. */
2257 for (num = NOTE_LINE_NUMBER (insn) + 1;
2258 num < NOTE_LINE_NUMBER (note);
2260 if (line_note_exists[num])
2263 if (num >= NOTE_LINE_NUMBER (note))
2269 /* Output this line note
2270 if it is the first or the last line note in a row. */
2272 output_source_line (file, insn);
2277 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2278 /* If we push arguments, we need to check all insns for stack
2280 if (dwarf2out_do_frame ())
2281 dwarf2out_frame_debug (insn);
2286 /* The target port might emit labels in the output function for
2287 some insn, e.g. sh.c output_branchy_insn. */
2288 if (CODE_LABEL_NUMBER (insn) <= max_labelno)
2290 int align = LABEL_TO_ALIGNMENT (insn);
2291 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2292 int max_skip = LABEL_TO_MAX_SKIP (insn);
2295 if (align && NEXT_INSN (insn))
2296 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2297 ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip);
2299 ASM_OUTPUT_ALIGN (file, align);
2304 /* If this label is reached from only one place, set the condition
2305 codes from the instruction just before the branch. */
2307 /* Disabled because some insns set cc_status in the C output code
2308 and NOTICE_UPDATE_CC alone can set incorrect status. */
2309 if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
2311 rtx jump = LABEL_REFS (insn);
2312 rtx barrier = prev_nonnote_insn (insn);
2314 /* If the LABEL_REFS field of this label has been set to point
2315 at a branch, the predecessor of the branch is a regular
2316 insn, and that branch is the only way to reach this label,
2317 set the condition codes based on the branch and its
2319 if (barrier && GET_CODE (barrier) == BARRIER
2320 && jump && GET_CODE (jump) == JUMP_INSN
2321 && (prev = prev_nonnote_insn (jump))
2322 && GET_CODE (prev) == INSN)
2324 NOTICE_UPDATE_CC (PATTERN (prev), prev);
2325 NOTICE_UPDATE_CC (PATTERN (jump), jump);
2333 #ifdef FINAL_PRESCAN_LABEL
2334 FINAL_PRESCAN_INSN (insn, NULL_PTR, 0);
2337 #ifdef SDB_DEBUGGING_INFO
2338 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
2339 sdbout_label (insn);
2341 #ifdef DWARF_DEBUGGING_INFO
2342 if (write_symbols == DWARF_DEBUG && LABEL_NAME (insn))
2343 dwarfout_label (insn);
2345 #ifdef DWARF2_DEBUGGING_INFO
2346 if (write_symbols == DWARF2_DEBUG && LABEL_NAME (insn))
2347 dwarf2out_label (insn);
2351 fputs (ASM_APP_OFF, file);
2354 if (NEXT_INSN (insn) != 0
2355 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
2357 rtx nextbody = PATTERN (NEXT_INSN (insn));
2359 /* If this label is followed by a jump-table,
2360 make sure we put the label in the read-only section. Also
2361 possibly write the label and jump table together. */
2363 if (GET_CODE (nextbody) == ADDR_VEC
2364 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
2366 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2367 /* In this case, the case vector is being moved by the
2368 target, so don't output the label at all. Leave that
2369 to the back end macros. */
2371 if (! JUMP_TABLES_IN_TEXT_SECTION)
2373 readonly_data_section ();
2374 #ifdef READONLY_DATA_SECTION
2375 ASM_OUTPUT_ALIGN (file,
2376 exact_log2 (BIGGEST_ALIGNMENT
2378 #endif /* READONLY_DATA_SECTION */
2381 function_section (current_function_decl);
2383 #ifdef ASM_OUTPUT_CASE_LABEL
2384 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
2387 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2394 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2399 register rtx body = PATTERN (insn);
2400 int insn_code_number;
2401 const char *template;
2406 /* An INSN, JUMP_INSN or CALL_INSN.
2407 First check for special kinds that recog doesn't recognize. */
2409 if (GET_CODE (body) == USE /* These are just declarations */
2410 || GET_CODE (body) == CLOBBER)
2414 /* If there is a REG_CC_SETTER note on this insn, it means that
2415 the setting of the condition code was done in the delay slot
2416 of the insn that branched here. So recover the cc status
2417 from the insn that set it. */
2419 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
2422 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
2423 cc_prev_status = cc_status;
2427 /* Detect insns that are really jump-tables
2428 and output them as such. */
2430 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
2432 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2433 register int vlen, idx;
2441 fputs (ASM_APP_OFF, file);
2445 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2446 if (GET_CODE (body) == ADDR_VEC)
2448 #ifdef ASM_OUTPUT_ADDR_VEC
2449 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2456 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2457 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2463 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
2464 for (idx = 0; idx < vlen; idx++)
2466 if (GET_CODE (body) == ADDR_VEC)
2468 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2469 ASM_OUTPUT_ADDR_VEC_ELT
2470 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
2477 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2478 ASM_OUTPUT_ADDR_DIFF_ELT
2481 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
2482 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
2488 #ifdef ASM_OUTPUT_CASE_END
2489 ASM_OUTPUT_CASE_END (file,
2490 CODE_LABEL_NUMBER (PREV_INSN (insn)),
2495 function_section (current_function_decl);
2500 /* Do basic-block profiling when we reach a new block.
2501 Done here to avoid jump tables. */
2502 if (profile_block_flag && new_block)
2505 if (GET_CODE (body) == ASM_INPUT)
2507 /* There's no telling what that did to the condition codes. */
2513 fputs (ASM_APP_ON, file);
2516 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
2520 /* Detect `asm' construct with operands. */
2521 if (asm_noperands (body) >= 0)
2523 unsigned int noperands = asm_noperands (body);
2524 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
2527 /* There's no telling what that did to the condition codes. */
2534 fputs (ASM_APP_ON, file);
2538 /* Get out the operand values. */
2539 string = decode_asm_operands (body, ops, NULL_PTR,
2540 NULL_PTR, NULL_PTR);
2541 /* Inhibit aborts on what would otherwise be compiler bugs. */
2542 insn_noperands = noperands;
2543 this_is_asm_operands = insn;
2545 /* Output the insn using them. */
2546 output_asm_insn (string, ops);
2547 this_is_asm_operands = 0;
2551 if (prescan <= 0 && app_on)
2553 fputs (ASM_APP_OFF, file);
2557 if (GET_CODE (body) == SEQUENCE)
2559 /* A delayed-branch sequence */
2565 final_sequence = body;
2567 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2568 force the restoration of a comparison that was previously
2569 thought unnecessary. If that happens, cancel this sequence
2570 and cause that insn to be restored. */
2572 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
2573 if (next != XVECEXP (body, 0, 1))
2579 for (i = 1; i < XVECLEN (body, 0); i++)
2581 rtx insn = XVECEXP (body, 0, i);
2582 rtx next = NEXT_INSN (insn);
2583 /* We loop in case any instruction in a delay slot gets
2586 insn = final_scan_insn (insn, file, 0, prescan, 1);
2587 while (insn != next);
2589 #ifdef DBR_OUTPUT_SEQEND
2590 DBR_OUTPUT_SEQEND (file);
2594 /* If the insn requiring the delay slot was a CALL_INSN, the
2595 insns in the delay slot are actually executed before the
2596 called function. Hence we don't preserve any CC-setting
2597 actions in these insns and the CC must be marked as being
2598 clobbered by the function. */
2599 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
2604 /* Following a conditional branch sequence, we have a new basic
2606 if (profile_block_flag)
2608 rtx insn = XVECEXP (body, 0, 0);
2609 rtx body = PATTERN (insn);
2611 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2612 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2613 || (GET_CODE (insn) == JUMP_INSN
2614 && GET_CODE (body) == PARALLEL
2615 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2616 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
2622 /* We have a real machine instruction as rtl. */
2624 body = PATTERN (insn);
2627 set = single_set(insn);
2629 /* Check for redundant test and compare instructions
2630 (when the condition codes are already set up as desired).
2631 This is done only when optimizing; if not optimizing,
2632 it should be possible for the user to alter a variable
2633 with the debugger in between statements
2634 and the next statement should reexamine the variable
2635 to compute the condition codes. */
2640 rtx set = single_set(insn);
2644 && GET_CODE (SET_DEST (set)) == CC0
2645 && insn != last_ignored_compare)
2647 if (GET_CODE (SET_SRC (set)) == SUBREG)
2648 SET_SRC (set) = alter_subreg (SET_SRC (set));
2649 else if (GET_CODE (SET_SRC (set)) == COMPARE)
2651 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
2652 XEXP (SET_SRC (set), 0)
2653 = alter_subreg (XEXP (SET_SRC (set), 0));
2654 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
2655 XEXP (SET_SRC (set), 1)
2656 = alter_subreg (XEXP (SET_SRC (set), 1));
2658 if ((cc_status.value1 != 0
2659 && rtx_equal_p (SET_SRC (set), cc_status.value1))
2660 || (cc_status.value2 != 0
2661 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
2663 /* Don't delete insn if it has an addressing side-effect. */
2664 if (! FIND_REG_INC_NOTE (insn, 0)
2665 /* or if anything in it is volatile. */
2666 && ! volatile_refs_p (PATTERN (insn)))
2668 /* We don't really delete the insn; just ignore it. */
2669 last_ignored_compare = insn;
2677 /* Following a conditional branch, we have a new basic block.
2678 But if we are inside a sequence, the new block starts after the
2679 last insn of the sequence. */
2680 if (profile_block_flag && final_sequence == 0
2681 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2682 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2683 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
2684 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2685 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
2689 /* Don't bother outputting obvious no-ops, even without -O.
2690 This optimization is fast and doesn't interfere with debugging.
2691 Don't do this if the insn is in a delay slot, since this
2692 will cause an improper number of delay insns to be written. */
2693 if (final_sequence == 0
2695 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
2696 && GET_CODE (SET_SRC (body)) == REG
2697 && GET_CODE (SET_DEST (body)) == REG
2698 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
2703 /* If this is a conditional branch, maybe modify it
2704 if the cc's are in a nonstandard state
2705 so that it accomplishes the same thing that it would
2706 do straightforwardly if the cc's were set up normally. */
2708 if (cc_status.flags != 0
2709 && GET_CODE (insn) == JUMP_INSN
2710 && GET_CODE (body) == SET
2711 && SET_DEST (body) == pc_rtx
2712 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
2713 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
2714 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
2715 /* This is done during prescan; it is not done again
2716 in final scan when prescan has been done. */
2719 /* This function may alter the contents of its argument
2720 and clear some of the cc_status.flags bits.
2721 It may also return 1 meaning condition now always true
2722 or -1 meaning condition now always false
2723 or 2 meaning condition nontrivial but altered. */
2724 register int result = alter_cond (XEXP (SET_SRC (body), 0));
2725 /* If condition now has fixed value, replace the IF_THEN_ELSE
2726 with its then-operand or its else-operand. */
2728 SET_SRC (body) = XEXP (SET_SRC (body), 1);
2730 SET_SRC (body) = XEXP (SET_SRC (body), 2);
2732 /* The jump is now either unconditional or a no-op.
2733 If it has become a no-op, don't try to output it.
2734 (It would not be recognized.) */
2735 if (SET_SRC (body) == pc_rtx)
2737 PUT_CODE (insn, NOTE);
2738 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2739 NOTE_SOURCE_FILE (insn) = 0;
2742 else if (GET_CODE (SET_SRC (body)) == RETURN)
2743 /* Replace (set (pc) (return)) with (return). */
2744 PATTERN (insn) = body = SET_SRC (body);
2746 /* Rerecognize the instruction if it has changed. */
2748 INSN_CODE (insn) = -1;
2751 /* Make same adjustments to instructions that examine the
2752 condition codes without jumping and instructions that
2753 handle conditional moves (if this machine has either one). */
2755 if (cc_status.flags != 0
2758 rtx cond_rtx, then_rtx, else_rtx;
2760 if (GET_CODE (insn) != JUMP_INSN
2761 && GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
2763 cond_rtx = XEXP (SET_SRC (set), 0);
2764 then_rtx = XEXP (SET_SRC (set), 1);
2765 else_rtx = XEXP (SET_SRC (set), 2);
2769 cond_rtx = SET_SRC (set);
2770 then_rtx = const_true_rtx;
2771 else_rtx = const0_rtx;
2774 switch (GET_CODE (cond_rtx))
2787 register int result;
2788 if (XEXP (cond_rtx, 0) != cc0_rtx)
2790 result = alter_cond (cond_rtx);
2792 validate_change (insn, &SET_SRC (set), then_rtx, 0);
2793 else if (result == -1)
2794 validate_change (insn, &SET_SRC (set), else_rtx, 0);
2795 else if (result == 2)
2796 INSN_CODE (insn) = -1;
2797 if (SET_DEST (set) == SET_SRC (set))
2799 PUT_CODE (insn, NOTE);
2800 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2801 NOTE_SOURCE_FILE (insn) = 0;
2813 /* Do machine-specific peephole optimizations if desired. */
2815 if (optimize && !flag_no_peephole && !nopeepholes)
2817 rtx next = peephole (insn);
2818 /* When peepholing, if there were notes within the peephole,
2819 emit them before the peephole. */
2820 if (next != 0 && next != NEXT_INSN (insn))
2822 rtx prev = PREV_INSN (insn);
2825 for (note = NEXT_INSN (insn); note != next;
2826 note = NEXT_INSN (note))
2827 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2829 /* In case this is prescan, put the notes
2830 in proper position for later rescan. */
2831 note = NEXT_INSN (insn);
2832 PREV_INSN (note) = prev;
2833 NEXT_INSN (prev) = note;
2834 NEXT_INSN (PREV_INSN (next)) = insn;
2835 PREV_INSN (insn) = PREV_INSN (next);
2836 NEXT_INSN (insn) = next;
2837 PREV_INSN (next) = insn;
2840 /* PEEPHOLE might have changed this. */
2841 body = PATTERN (insn);
2844 /* Try to recognize the instruction.
2845 If successful, verify that the operands satisfy the
2846 constraints for the instruction. Crash if they don't,
2847 since `reload' should have changed them so that they do. */
2849 insn_code_number = recog_memoized (insn);
2850 extract_insn (insn);
2851 cleanup_subreg_operands (insn);
2853 #ifdef REGISTER_CONSTRAINTS
2854 if (! constrain_operands (1))
2855 fatal_insn_not_found (insn);
2858 /* Some target machines need to prescan each insn before
2861 #ifdef FINAL_PRESCAN_INSN
2862 FINAL_PRESCAN_INSN (insn, recog_operand, recog_n_operands);
2866 cc_prev_status = cc_status;
2868 /* Update `cc_status' for this instruction.
2869 The instruction's output routine may change it further.
2870 If the output routine for a jump insn needs to depend
2871 on the cc status, it should look at cc_prev_status. */
2873 NOTICE_UPDATE_CC (body, insn);
2878 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2879 /* If we push arguments, we want to know where the calls are. */
2880 if (GET_CODE (insn) == CALL_INSN && dwarf2out_do_frame ())
2881 dwarf2out_frame_debug (insn);
2884 /* If the proper template needs to be chosen by some C code,
2885 run that code and get the real template. */
2887 template = insn_template[insn_code_number];
2890 template = (*insn_outfun[insn_code_number]) (recog_operand, insn);
2892 /* If the C code returns 0, it means that it is a jump insn
2893 which follows a deleted test insn, and that test insn
2894 needs to be reinserted. */
2897 if (prev_nonnote_insn (insn) != last_ignored_compare)
2900 return prev_nonnote_insn (insn);
2904 /* If the template is the string "#", it means that this insn must
2906 if (template[0] == '#' && template[1] == '\0')
2908 rtx new = try_split (body, insn, 0);
2910 /* If we didn't split the insn, go away. */
2911 if (new == insn && PATTERN (new) == body)
2912 fatal_insn ("Could not split insn", insn);
2914 #ifdef HAVE_ATTR_length
2915 /* This instruction should have been split in shorten_branches,
2916 to ensure that we would have valid length info for the
2928 /* Output assembler code from the template. */
2930 output_asm_insn (template, recog_operand);
2932 #if defined (DWARF2_UNWIND_INFO)
2933 #if !defined (ACCUMULATE_OUTGOING_ARGS)
2934 /* If we push arguments, we need to check all insns for stack
2936 if (GET_CODE (insn) == INSN && dwarf2out_do_frame ())
2937 dwarf2out_frame_debug (insn);
2939 #if defined (HAVE_prologue)
2940 /* If this insn is part of the prologue, emit DWARF v2
2942 if (RTX_FRAME_RELATED_P (insn) && dwarf2out_do_frame ())
2943 dwarf2out_frame_debug (insn);
2949 /* It's not at all clear why we did this and doing so interferes
2950 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2953 /* Mark this insn as having been output. */
2954 INSN_DELETED_P (insn) = 1;
2960 return NEXT_INSN (insn);
2963 /* Output debugging info to the assembler file FILE
2964 based on the NOTE-insn INSN, assumed to be a line number. */
2967 output_source_line (file, insn)
2971 register char *filename = NOTE_SOURCE_FILE (insn);
2973 /* Remember filename for basic block profiling.
2974 Filenames are allocated on the permanent obstack
2975 or are passed in ARGV, so we don't have to save
2978 if (profile_block_flag && last_filename != filename)
2979 bb_file_label_num = add_bb_string (filename, TRUE);
2981 last_filename = filename;
2982 last_linenum = NOTE_LINE_NUMBER (insn);
2983 high_block_linenum = MAX (last_linenum, high_block_linenum);
2984 high_function_linenum = MAX (last_linenum, high_function_linenum);
2986 if (write_symbols != NO_DEBUG)
2988 #ifdef SDB_DEBUGGING_INFO
2989 if (write_symbols == SDB_DEBUG
2990 #if 0 /* People like having line numbers even in wrong file! */
2991 /* COFF can't handle multiple source files--lose, lose. */
2992 && !strcmp (filename, main_input_filename)
2994 /* COFF relative line numbers must be positive. */
2995 && last_linenum > sdb_begin_function_line)
2997 #ifdef ASM_OUTPUT_SOURCE_LINE
2998 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
3000 fprintf (file, "\t.ln\t%d\n",
3001 ((sdb_begin_function_line > -1)
3002 ? last_linenum - sdb_begin_function_line : 1));
3007 #if defined (DBX_DEBUGGING_INFO)
3008 if (write_symbols == DBX_DEBUG)
3009 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
3012 #if defined (XCOFF_DEBUGGING_INFO)
3013 if (write_symbols == XCOFF_DEBUG)
3014 xcoffout_source_line (file, filename, insn);
3017 #ifdef DWARF_DEBUGGING_INFO
3018 if (write_symbols == DWARF_DEBUG)
3019 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
3022 #ifdef DWARF2_DEBUGGING_INFO
3023 if (write_symbols == DWARF2_DEBUG)
3024 dwarf2out_line (filename, NOTE_LINE_NUMBER (insn));
3030 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3031 directly to the desired hard register. */
3033 cleanup_subreg_operands (insn)
3038 extract_insn (insn);
3039 for (i = 0; i < recog_n_operands; i++)
3041 if (GET_CODE (recog_operand[i]) == SUBREG)
3042 recog_operand[i] = alter_subreg (recog_operand[i]);
3043 else if (GET_CODE (recog_operand[i]) == PLUS
3044 || GET_CODE (recog_operand[i]) == MULT)
3045 recog_operand[i] = walk_alter_subreg (recog_operand[i]);
3048 for (i = 0; i < recog_n_dups; i++)
3050 if (GET_CODE (*recog_dup_loc[i]) == SUBREG)
3051 *recog_dup_loc[i] = alter_subreg (*recog_dup_loc[i]);
3052 else if (GET_CODE (*recog_dup_loc[i]) == PLUS
3053 || GET_CODE (*recog_dup_loc[i]) == MULT)
3054 *recog_dup_loc[i] = walk_alter_subreg (*recog_dup_loc[i]);
3058 /* If X is a SUBREG, replace it with a REG or a MEM,
3059 based on the thing it is a subreg of. */
3065 register rtx y = SUBREG_REG (x);
3067 if (GET_CODE (y) == SUBREG)
3068 y = alter_subreg (y);
3070 /* If reload is operating, we may be replacing inside this SUBREG.
3071 Check for that and make a new one if so. */
3072 if (reload_in_progress && find_replacement (&SUBREG_REG (x)) != 0)
3075 if (GET_CODE (y) == REG)
3077 /* If the word size is larger than the size of this register,
3078 adjust the register number to compensate. */
3079 /* ??? Note that this just catches stragglers created by/for
3080 integrate. It would be better if we either caught these
3081 earlier, or kept _all_ subregs until now and eliminate
3082 gen_lowpart and friends. */
3085 #ifdef ALTER_HARD_SUBREG
3086 REGNO (x) = ALTER_HARD_SUBREG(GET_MODE (x), SUBREG_WORD (x),
3087 GET_MODE (y), REGNO (y));
3089 REGNO (x) = REGNO (y) + SUBREG_WORD (x);
3091 /* This field has a different meaning for REGs and SUBREGs. Make sure
3095 else if (GET_CODE (y) == MEM)
3097 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
3098 if (BYTES_BIG_ENDIAN)
3099 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
3100 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
3102 MEM_COPY_ATTRIBUTES (x, y);
3103 MEM_ALIAS_SET (x) = MEM_ALIAS_SET (y);
3104 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
3110 /* Do alter_subreg on all the SUBREGs contained in X. */
3113 walk_alter_subreg (x)
3116 switch (GET_CODE (x))
3120 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3121 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
3125 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3129 return alter_subreg (x);
3140 /* Given BODY, the body of a jump instruction, alter the jump condition
3141 as required by the bits that are set in cc_status.flags.
3142 Not all of the bits there can be handled at this level in all cases.
3144 The value is normally 0.
3145 1 means that the condition has become always true.
3146 -1 means that the condition has become always false.
3147 2 means that COND has been altered. */
3155 if (cc_status.flags & CC_REVERSED)
3158 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
3161 if (cc_status.flags & CC_INVERTED)
3164 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
3167 if (cc_status.flags & CC_NOT_POSITIVE)
3168 switch (GET_CODE (cond))
3173 /* Jump becomes unconditional. */
3179 /* Jump becomes no-op. */
3183 PUT_CODE (cond, EQ);
3188 PUT_CODE (cond, NE);
3196 if (cc_status.flags & CC_NOT_NEGATIVE)
3197 switch (GET_CODE (cond))
3201 /* Jump becomes unconditional. */
3206 /* Jump becomes no-op. */
3211 PUT_CODE (cond, EQ);
3217 PUT_CODE (cond, NE);
3225 if (cc_status.flags & CC_NO_OVERFLOW)
3226 switch (GET_CODE (cond))
3229 /* Jump becomes unconditional. */
3233 PUT_CODE (cond, EQ);
3238 PUT_CODE (cond, NE);
3243 /* Jump becomes no-op. */
3250 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
3251 switch (GET_CODE (cond))
3257 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
3262 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
3267 if (cc_status.flags & CC_NOT_SIGNED)
3268 /* The flags are valid if signed condition operators are converted
3270 switch (GET_CODE (cond))
3273 PUT_CODE (cond, LEU);
3278 PUT_CODE (cond, LTU);
3283 PUT_CODE (cond, GTU);
3288 PUT_CODE (cond, GEU);
3300 /* Report inconsistency between the assembler template and the operands.
3301 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3304 output_operand_lossage (msgid)
3307 if (this_is_asm_operands)
3308 error_for_asm (this_is_asm_operands, "invalid `asm': %s", _(msgid));
3310 fatal ("Internal compiler error, output_operand_lossage `%s'", _(msgid));
3313 /* Output of assembler code from a template, and its subroutines. */
3315 /* Output text from TEMPLATE to the assembler output file,
3316 obeying %-directions to substitute operands taken from
3317 the vector OPERANDS.
3319 %N (for N a digit) means print operand N in usual manner.
3320 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3321 and print the label name with no punctuation.
3322 %cN means require operand N to be a constant
3323 and print the constant expression with no punctuation.
3324 %aN means expect operand N to be a memory address
3325 (not a memory reference!) and print a reference
3327 %nN means expect operand N to be a constant
3328 and print a constant expression for minus the value
3329 of the operand, with no other punctuation. */
3334 if (flag_print_asm_name)
3336 /* Annotate the assembly with a comment describing the pattern and
3337 alternative used. */
3340 register int num = INSN_CODE (debug_insn);
3341 fprintf (asm_out_file, "\t%s %d\t%s",
3342 ASM_COMMENT_START, INSN_UID (debug_insn), insn_name[num]);
3343 if (insn_n_alternatives[num] > 1)
3344 fprintf (asm_out_file, "/%d", which_alternative + 1);
3345 #ifdef HAVE_ATTR_length
3346 fprintf (asm_out_file, "\t[length = %d]", get_attr_length (debug_insn));
3348 /* Clear this so only the first assembler insn
3349 of any rtl insn will get the special comment for -dp. */
3356 output_asm_insn (template, operands)
3357 const char *template;
3360 register const char *p;
3363 /* An insn may return a null string template
3364 in a case where no assembler code is needed. */
3369 putc ('\t', asm_out_file);
3371 #ifdef ASM_OUTPUT_OPCODE
3372 ASM_OUTPUT_OPCODE (asm_out_file, p);
3380 putc (c, asm_out_file);
3381 #ifdef ASM_OUTPUT_OPCODE
3382 while ((c = *p) == '\t')
3384 putc (c, asm_out_file);
3387 ASM_OUTPUT_OPCODE (asm_out_file, p);
3391 #ifdef ASSEMBLER_DIALECT
3396 /* If we want the first dialect, do nothing. Otherwise, skip
3397 DIALECT_NUMBER of strings ending with '|'. */
3398 for (i = 0; i < dialect_number; i++)
3400 while (*p && *p++ != '|')
3410 /* Skip to close brace. */
3411 while (*p && *p++ != '}')
3420 /* %% outputs a single %. */
3424 putc (c, asm_out_file);
3426 /* %= outputs a number which is unique to each insn in the entire
3427 compilation. This is useful for making local labels that are
3428 referred to more than once in a given insn. */
3432 fprintf (asm_out_file, "%d", insn_counter);
3434 /* % followed by a letter and some digits
3435 outputs an operand in a special way depending on the letter.
3436 Letters `acln' are implemented directly.
3437 Other letters are passed to `output_operand' so that
3438 the PRINT_OPERAND macro can define them. */
3439 else if ((*p >= 'a' && *p <= 'z')
3440 || (*p >= 'A' && *p <= 'Z'))
3445 if (! (*p >= '0' && *p <= '9'))
3446 output_operand_lossage ("operand number missing after %-letter");
3447 else if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3448 output_operand_lossage ("operand number out of range");
3449 else if (letter == 'l')
3450 output_asm_label (operands[c]);
3451 else if (letter == 'a')
3452 output_address (operands[c]);
3453 else if (letter == 'c')
3455 if (CONSTANT_ADDRESS_P (operands[c]))
3456 output_addr_const (asm_out_file, operands[c]);
3458 output_operand (operands[c], 'c');
3460 else if (letter == 'n')
3462 if (GET_CODE (operands[c]) == CONST_INT)
3463 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
3464 - INTVAL (operands[c]));
3467 putc ('-', asm_out_file);
3468 output_addr_const (asm_out_file, operands[c]);
3472 output_operand (operands[c], letter);
3474 while ((c = *p) >= '0' && c <= '9') p++;
3476 /* % followed by a digit outputs an operand the default way. */
3477 else if (*p >= '0' && *p <= '9')
3480 if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3481 output_operand_lossage ("operand number out of range");
3483 output_operand (operands[c], 0);
3484 while ((c = *p) >= '0' && c <= '9') p++;
3486 /* % followed by punctuation: output something for that
3487 punctuation character alone, with no operand.
3488 The PRINT_OPERAND macro decides what is actually done. */
3489 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3490 else if (PRINT_OPERAND_PUNCT_VALID_P ((unsigned char)*p))
3491 output_operand (NULL_RTX, *p++);
3494 output_operand_lossage ("invalid %%-code");
3498 putc (c, asm_out_file);
3503 putc ('\n', asm_out_file);
3506 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3509 output_asm_label (x)
3514 if (GET_CODE (x) == LABEL_REF)
3515 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3516 else if (GET_CODE (x) == CODE_LABEL)
3517 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3519 output_operand_lossage ("`%l' operand isn't a label");
3521 assemble_name (asm_out_file, buf);
3524 /* Print operand X using machine-dependent assembler syntax.
3525 The macro PRINT_OPERAND is defined just to control this function.
3526 CODE is a non-digit that preceded the operand-number in the % spec,
3527 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3528 between the % and the digits.
3529 When CODE is a non-letter, X is 0.
3531 The meanings of the letters are machine-dependent and controlled
3532 by PRINT_OPERAND. */
3535 output_operand (x, code)
3539 if (x && GET_CODE (x) == SUBREG)
3540 x = alter_subreg (x);
3542 /* If X is a pseudo-register, abort now rather than writing trash to the
3545 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
3548 PRINT_OPERAND (asm_out_file, x, code);
3551 /* Print a memory reference operand for address X
3552 using machine-dependent assembler syntax.
3553 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3559 walk_alter_subreg (x);
3560 PRINT_OPERAND_ADDRESS (asm_out_file, x);
3563 /* Print an integer constant expression in assembler syntax.
3564 Addition and subtraction are the only arithmetic
3565 that may appear in these expressions. */
3568 output_addr_const (file, x)
3575 switch (GET_CODE (x))
3585 assemble_name (file, XSTR (x, 0));
3589 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
3590 assemble_name (file, buf);
3594 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3595 assemble_name (file, buf);
3599 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
3603 /* This used to output parentheses around the expression,
3604 but that does not work on the 386 (either ATT or BSD assembler). */
3605 output_addr_const (file, XEXP (x, 0));
3609 if (GET_MODE (x) == VOIDmode)
3611 /* We can use %d if the number is one word and positive. */
3612 if (CONST_DOUBLE_HIGH (x))
3613 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3614 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
3615 else if (CONST_DOUBLE_LOW (x) < 0)
3616 fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
3618 fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
3621 /* We can't handle floating point constants;
3622 PRINT_OPERAND must handle them. */
3623 output_operand_lossage ("floating constant misused");
3627 /* Some assemblers need integer constants to appear last (eg masm). */
3628 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
3630 output_addr_const (file, XEXP (x, 1));
3631 if (INTVAL (XEXP (x, 0)) >= 0)
3632 fprintf (file, "+");
3633 output_addr_const (file, XEXP (x, 0));
3637 output_addr_const (file, XEXP (x, 0));
3638 if (INTVAL (XEXP (x, 1)) >= 0)
3639 fprintf (file, "+");
3640 output_addr_const (file, XEXP (x, 1));
3645 /* Avoid outputting things like x-x or x+5-x,
3646 since some assemblers can't handle that. */
3647 x = simplify_subtraction (x);
3648 if (GET_CODE (x) != MINUS)
3651 output_addr_const (file, XEXP (x, 0));
3652 fprintf (file, "-");
3653 if (GET_CODE (XEXP (x, 1)) == CONST_INT
3654 && INTVAL (XEXP (x, 1)) < 0)
3656 fprintf (file, ASM_OPEN_PAREN);
3657 output_addr_const (file, XEXP (x, 1));
3658 fprintf (file, ASM_CLOSE_PAREN);
3661 output_addr_const (file, XEXP (x, 1));
3666 output_addr_const (file, XEXP (x, 0));
3670 output_operand_lossage ("invalid expression as operand");
3674 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3675 %R prints the value of REGISTER_PREFIX.
3676 %L prints the value of LOCAL_LABEL_PREFIX.
3677 %U prints the value of USER_LABEL_PREFIX.
3678 %I prints the value of IMMEDIATE_PREFIX.
3679 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3680 Also supported are %d, %x, %s, %e, %f, %g and %%.
3682 We handle alternate assembler dialects here, just like output_asm_insn. */
3685 asm_fprintf VPROTO((FILE *file, const char *p, ...))
3687 #ifndef ANSI_PROTOTYPES
3695 VA_START (argptr, p);
3697 #ifndef ANSI_PROTOTYPES
3698 file = va_arg (argptr, FILE *);
3699 p = va_arg (argptr, const char *);
3707 #ifdef ASSEMBLER_DIALECT
3712 /* If we want the first dialect, do nothing. Otherwise, skip
3713 DIALECT_NUMBER of strings ending with '|'. */
3714 for (i = 0; i < dialect_number; i++)
3716 while (*p && *p++ != '|')
3726 /* Skip to close brace. */
3727 while (*p && *p++ != '}')
3738 while ((c >= '0' && c <= '9') || c == '.')
3746 fprintf (file, "%%");
3749 case 'd': case 'i': case 'u':
3750 case 'x': case 'p': case 'X':
3754 fprintf (file, buf, va_arg (argptr, int));
3758 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3759 but we do not check for those cases. It means that the value
3760 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3762 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3764 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3774 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3781 fprintf (file, buf, va_arg (argptr, long));
3789 fprintf (file, buf, va_arg (argptr, double));
3795 fprintf (file, buf, va_arg (argptr, char *));
3799 #ifdef ASM_OUTPUT_OPCODE
3800 ASM_OUTPUT_OPCODE (asm_out_file, p);
3805 #ifdef REGISTER_PREFIX
3806 fprintf (file, "%s", REGISTER_PREFIX);
3811 #ifdef IMMEDIATE_PREFIX
3812 fprintf (file, "%s", IMMEDIATE_PREFIX);
3817 #ifdef LOCAL_LABEL_PREFIX
3818 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
3823 fputs (user_label_prefix, file);
3836 /* Split up a CONST_DOUBLE or integer constant rtx
3837 into two rtx's for single words,
3838 storing in *FIRST the word that comes first in memory in the target
3839 and in *SECOND the other. */
3842 split_double (value, first, second)
3844 rtx *first, *second;
3846 if (GET_CODE (value) == CONST_INT)
3848 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3850 /* In this case the CONST_INT holds both target words.
3851 Extract the bits from it into two word-sized pieces.
3852 Sign extend each half to HOST_WIDE_INT. */
3854 /* On machines where HOST_BITS_PER_WIDE_INT == BITS_PER_WORD
3855 the shift below will cause a compiler warning, even though
3856 this code won't be executed. So put the shift amounts in
3857 variables to avoid the warning. */
3858 int rshift = HOST_BITS_PER_WIDE_INT - BITS_PER_WORD;
3859 int lshift = HOST_BITS_PER_WIDE_INT - 2 * BITS_PER_WORD;
3861 low = GEN_INT ((INTVAL (value) << rshift) >> rshift);
3862 high = GEN_INT ((INTVAL (value) << lshift) >> rshift);
3863 if (WORDS_BIG_ENDIAN)
3876 /* The rule for using CONST_INT for a wider mode
3877 is that we regard the value as signed.
3878 So sign-extend it. */
3879 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
3880 if (WORDS_BIG_ENDIAN)
3892 else if (GET_CODE (value) != CONST_DOUBLE)
3894 if (WORDS_BIG_ENDIAN)
3896 *first = const0_rtx;
3902 *second = const0_rtx;
3905 else if (GET_MODE (value) == VOIDmode
3906 /* This is the old way we did CONST_DOUBLE integers. */
3907 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
3909 /* In an integer, the words are defined as most and least significant.
3910 So order them by the target's convention. */
3911 if (WORDS_BIG_ENDIAN)
3913 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3914 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3918 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3919 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3924 #ifdef REAL_ARITHMETIC
3925 REAL_VALUE_TYPE r; long l[2];
3926 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
3928 /* Note, this converts the REAL_VALUE_TYPE to the target's
3929 format, splits up the floating point double and outputs
3930 exactly 32 bits of it into each of l[0] and l[1] --
3931 not necessarily BITS_PER_WORD bits. */
3932 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
3934 /* If 32 bits is an entire word for the target, but not for the host,
3935 then sign-extend on the host so that the number will look the same
3936 way on the host that it would on the target. See for instance
3937 simplify_unary_operation. The #if is needed to avoid compiler
3940 #if HOST_BITS_PER_LONG > 32
3941 if (BITS_PER_WORD < HOST_BITS_PER_LONG && BITS_PER_WORD == 32)
3943 if (l[0] & ((long) 1 << 31))
3944 l[0] |= ((long) (-1) << 32);
3945 if (l[1] & ((long) 1 << 31))
3946 l[1] |= ((long) (-1) << 32);
3950 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
3951 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
3953 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
3954 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
3955 && ! flag_pretend_float)
3959 #ifdef HOST_WORDS_BIG_ENDIAN
3966 /* Host and target agree => no need to swap. */
3967 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3968 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3972 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3973 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3975 #endif /* no REAL_ARITHMETIC */
3979 /* Return nonzero if this function has no function calls. */
3986 if (profile_flag || profile_block_flag || profile_arc_flag)
3989 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3991 if (GET_CODE (insn) == CALL_INSN)
3993 if (GET_CODE (insn) == INSN
3994 && GET_CODE (PATTERN (insn)) == SEQUENCE
3995 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN)
3998 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4000 if (GET_CODE (XEXP (insn, 0)) == CALL_INSN)
4002 if (GET_CODE (XEXP (insn, 0)) == INSN
4003 && GET_CODE (PATTERN (XEXP (insn, 0))) == SEQUENCE
4004 && GET_CODE (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)) == CALL_INSN)
4011 /* On some machines, a function with no call insns
4012 can run faster if it doesn't create its own register window.
4013 When output, the leaf function should use only the "output"
4014 registers. Ordinarily, the function would be compiled to use
4015 the "input" registers to find its arguments; it is a candidate
4016 for leaf treatment if it uses only the "input" registers.
4017 Leaf function treatment means renumbering so the function
4018 uses the "output" registers instead. */
4020 #ifdef LEAF_REGISTERS
4022 static char permitted_reg_in_leaf_functions[] = LEAF_REGISTERS;
4024 /* Return 1 if this function uses only the registers that can be
4025 safely renumbered. */
4028 only_leaf_regs_used ()
4032 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4033 if ((regs_ever_live[i] || global_regs[i])
4034 && ! permitted_reg_in_leaf_functions[i])
4037 if (current_function_uses_pic_offset_table
4038 && pic_offset_table_rtx != 0
4039 && GET_CODE (pic_offset_table_rtx) == REG
4040 && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4046 /* Scan all instructions and renumber all registers into those
4047 available in leaf functions. */
4050 leaf_renumber_regs (first)
4055 /* Renumber only the actual patterns.
4056 The reg-notes can contain frame pointer refs,
4057 and renumbering them could crash, and should not be needed. */
4058 for (insn = first; insn; insn = NEXT_INSN (insn))
4059 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
4060 leaf_renumber_regs_insn (PATTERN (insn));
4061 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
4062 if (GET_RTX_CLASS (GET_CODE (XEXP (insn, 0))) == 'i')
4063 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
4066 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4067 available in leaf functions. */
4070 leaf_renumber_regs_insn (in_rtx)
4071 register rtx in_rtx;
4074 register char *format_ptr;
4079 /* Renumber all input-registers into output-registers.
4080 renumbered_regs would be 1 for an output-register;
4083 if (GET_CODE (in_rtx) == REG)
4087 /* Don't renumber the same reg twice. */
4091 newreg = REGNO (in_rtx);
4092 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4093 to reach here as part of a REG_NOTE. */
4094 if (newreg >= FIRST_PSEUDO_REGISTER)
4099 newreg = LEAF_REG_REMAP (newreg);
4102 regs_ever_live[REGNO (in_rtx)] = 0;
4103 regs_ever_live[newreg] = 1;
4104 REGNO (in_rtx) = newreg;
4108 if (GET_RTX_CLASS (GET_CODE (in_rtx)) == 'i')
4110 /* Inside a SEQUENCE, we find insns.
4111 Renumber just the patterns of these insns,
4112 just as we do for the top-level insns. */
4113 leaf_renumber_regs_insn (PATTERN (in_rtx));
4117 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
4119 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
4120 switch (*format_ptr++)
4123 leaf_renumber_regs_insn (XEXP (in_rtx, i));
4127 if (NULL != XVEC (in_rtx, i))
4129 for (j = 0; j < XVECLEN (in_rtx, i); j++)
4130 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));