1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-6, 1997 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. */
59 #include "insn-config.h"
60 #include "insn-flags.h"
61 #include "insn-attr.h"
62 #include "insn-codes.h"
64 #include "conditions.h"
67 #include "hard-reg-set.h"
72 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
73 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
74 #if defined (USG) || defined (NO_STAB_H)
75 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
77 #include <stab.h> /* On BSD, use the system's stab.h. */
79 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
81 #ifdef XCOFF_DEBUGGING_INFO
85 /* .stabd code for line number. */
90 /* .stabs code for included file name. */
96 #define INT_TYPE_SIZE BITS_PER_WORD
99 #ifndef LONG_TYPE_SIZE
100 #define LONG_TYPE_SIZE BITS_PER_WORD
103 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
104 null default for it to save conditionalization later. */
105 #ifndef CC_STATUS_INIT
106 #define CC_STATUS_INIT
109 /* How to start an assembler comment. */
110 #ifndef ASM_COMMENT_START
111 #define ASM_COMMENT_START ";#"
114 /* Is the given character a logical line separator for the assembler? */
115 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
116 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
119 /* Nonzero means this function is a leaf function, with no function calls.
120 This variable exists to be examined in FUNCTION_PROLOGUE
121 and FUNCTION_EPILOGUE. Always zero, unless set by some action. */
124 /* Last insn processed by final_scan_insn. */
125 static rtx debug_insn = 0;
127 /* Line number of last NOTE. */
128 static int last_linenum;
130 /* Highest line number in current block. */
131 static int high_block_linenum;
133 /* Likewise for function. */
134 static int high_function_linenum;
136 /* Filename of last NOTE. */
137 static char *last_filename;
139 /* Number of basic blocks seen so far;
140 used if profile_block_flag is set. */
141 static int count_basic_blocks;
143 /* Number of instrumented arcs when profile_arc_flag is set. */
144 extern int count_instrumented_arcs;
146 /* Nonzero while outputting an `asm' with operands.
147 This means that inconsistencies are the user's fault, so don't abort.
148 The precise value is the insn being output, to pass to error_for_asm. */
149 static rtx this_is_asm_operands;
151 /* Number of operands of this insn, for an `asm' with operands. */
152 static int insn_noperands;
154 /* Compare optimization flag. */
156 static rtx last_ignored_compare = 0;
158 /* Flag indicating this insn is the start of a new basic block. */
160 static int new_block = 1;
162 /* All the symbol-blocks (levels of scoping) in the compilation
163 are assigned sequence numbers in order of appearance of the
164 beginnings of the symbol-blocks. Both final and dbxout do this,
165 and assume that they will both give the same number to each block.
166 Final uses these sequence numbers to generate assembler label names
167 LBBnnn and LBEnnn for the beginning and end of the symbol-block.
168 Dbxout uses the sequence numbers to generate references to the same labels
169 from the dbx debugging information.
171 Sdb records this level at the beginning of each function,
172 in order to find the current level when recursing down declarations.
173 It outputs the block beginning and endings
174 at the point in the asm file where the blocks would begin and end. */
176 int next_block_index;
178 /* Assign a unique number to each insn that is output.
179 This can be used to generate unique local labels. */
181 static int insn_counter = 0;
184 /* This variable contains machine-dependent flags (defined in tm.h)
185 set and examined by output routines
186 that describe how to interpret the condition codes properly. */
190 /* During output of an insn, this contains a copy of cc_status
191 from before the insn. */
193 CC_STATUS cc_prev_status;
196 /* Indexed by hardware reg number, is 1 if that register is ever
197 used in the current function.
199 In life_analysis, or in stupid_life_analysis, this is set
200 up to record the hard regs used explicitly. Reload adds
201 in the hard regs used for holding pseudo regs. Final uses
202 it to generate the code in the function prologue and epilogue
203 to save and restore registers as needed. */
205 char regs_ever_live[FIRST_PSEUDO_REGISTER];
207 /* Nonzero means current function must be given a frame pointer.
208 Set in stmt.c if anything is allocated on the stack there.
209 Set in reload1.c if anything is allocated on the stack there. */
211 int frame_pointer_needed;
213 /* Assign unique numbers to labels generated for profiling. */
215 int profile_label_no;
217 /* Length so far allocated in PENDING_BLOCKS. */
219 static int max_block_depth;
221 /* Stack of sequence numbers of symbol-blocks of which we have seen the
222 beginning but not yet the end. Sequence numbers are assigned at
223 the beginning; this stack allows us to find the sequence number
224 of a block that is ending. */
226 static int *pending_blocks;
228 /* Number of elements currently in use in PENDING_BLOCKS. */
230 static int block_depth;
232 /* Nonzero if have enabled APP processing of our assembler output. */
236 /* If we are outputting an insn sequence, this contains the sequence rtx.
241 #ifdef ASSEMBLER_DIALECT
243 /* Number of the assembler dialect to use, starting at 0. */
244 static int dialect_number;
247 /* Indexed by line number, nonzero if there is a note for that line. */
249 static char *line_note_exists;
251 /* Linked list to hold line numbers for each basic block. */
254 struct bb_list *next; /* pointer to next basic block */
255 int line_num; /* line number */
256 int file_label_num; /* LPBC<n> label # for stored filename */
257 int func_label_num; /* LPBC<n> label # for stored function name */
260 static struct bb_list *bb_head = 0; /* Head of basic block list */
261 static struct bb_list **bb_tail = &bb_head; /* Ptr to store next bb ptr */
262 static int bb_file_label_num = -1; /* Current label # for file */
263 static int bb_func_label_num = -1; /* Current label # for func */
265 /* Linked list to hold the strings for each file and function name output. */
268 struct bb_str *next; /* pointer to next string */
269 char *string; /* string */
270 int label_num; /* label number */
271 int length; /* string length */
274 extern rtx peephole PROTO((rtx));
276 static struct bb_str *sbb_head = 0; /* Head of string list. */
277 static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */
278 static int sbb_label_num = 0; /* Last label used */
280 #ifdef HAVE_ATTR_length
281 static int asm_insn_count PROTO((rtx));
283 static void profile_function PROTO((FILE *));
284 static void profile_after_prologue PROTO((FILE *));
285 static void add_bb PROTO((FILE *));
286 static int add_bb_string PROTO((char *, int));
287 static void output_source_line PROTO((FILE *, rtx));
288 static rtx walk_alter_subreg PROTO((rtx));
289 static void output_asm_name PROTO((void));
290 static void output_operand PROTO((rtx, int));
291 #ifdef LEAF_REGISTERS
292 static void leaf_renumber_regs PROTO((rtx));
295 static int alter_cond PROTO((rtx));
298 extern char *getpwd ();
300 /* Initialize data in final at the beginning of a compilation. */
303 init_final (filename)
306 next_block_index = 2;
308 max_block_depth = 20;
309 pending_blocks = (int *) xmalloc (20 * sizeof *pending_blocks);
312 #ifdef ASSEMBLER_DIALECT
313 dialect_number = ASSEMBLER_DIALECT;
317 /* Called at end of source file,
318 to output the block-profiling table for this entire compilation. */
326 if (profile_block_flag || profile_arc_flag)
329 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
333 int long_bytes = LONG_TYPE_SIZE / BITS_PER_UNIT;
334 int pointer_bytes = POINTER_SIZE / BITS_PER_UNIT;
336 if (profile_block_flag)
337 size = long_bytes * count_basic_blocks;
339 size = long_bytes * count_instrumented_arcs;
342 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
343 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
344 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
348 /* Output the main header, of 11 words:
349 0: 1 if this file is initialized, else 0.
350 1: address of file name (LPBX1).
351 2: address of table of counts (LPBX2).
352 3: number of counts in the table.
353 4: always 0, for compatibility with Sun.
355 The following are GNU extensions:
357 5: address of table of start addrs of basic blocks (LPBX3).
358 6: Number of bytes in this header.
359 7: address of table of function names (LPBX4).
360 8: address of table of line numbers (LPBX5) or 0.
361 9: address of table of file names (LPBX6) or 0.
362 10: space reserved for basic block profiling. */
364 ASM_OUTPUT_ALIGN (asm_out_file, align);
366 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
368 assemble_integer (const0_rtx, long_bytes, 1);
370 /* address of filename */
371 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
372 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
374 /* address of count table */
375 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
376 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
378 /* count of the # of basic blocks or # of instrumented arcs */
379 if (profile_block_flag)
380 assemble_integer (GEN_INT (count_basic_blocks), long_bytes, 1);
382 assemble_integer (GEN_INT (count_instrumented_arcs), long_bytes,
385 /* zero word (link field) */
386 assemble_integer (const0_rtx, pointer_bytes, 1);
388 /* address of basic block start address table */
389 if (profile_block_flag)
391 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
392 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
396 assemble_integer (const0_rtx, pointer_bytes, 1);
398 /* byte count for extended structure. */
399 assemble_integer (GEN_INT (10 * UNITS_PER_WORD), long_bytes, 1);
401 /* address of function name table */
402 if (profile_block_flag)
404 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
405 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
409 assemble_integer (const0_rtx, pointer_bytes, 1);
411 /* address of line number and filename tables if debugging. */
412 if (write_symbols != NO_DEBUG && profile_block_flag)
414 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
415 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
416 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
417 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1);
421 assemble_integer (const0_rtx, pointer_bytes, 1);
422 assemble_integer (const0_rtx, pointer_bytes, 1);
425 /* space for extension ptr (link field) */
426 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
428 /* Output the file name changing the suffix to .d for Sun tcov
430 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
432 char *cwd = getpwd ();
433 int len = strlen (filename) + strlen (cwd) + 1;
434 char *data_file = (char *) alloca (len + 4);
436 strcpy (data_file, cwd);
437 strcat (data_file, "/");
438 strcat (data_file, filename);
439 strip_off_ending (data_file, len);
440 if (profile_block_flag)
441 strcat (data_file, ".d");
443 strcat (data_file, ".da");
444 assemble_string (data_file, strlen (data_file) + 1);
447 /* Make space for the table of counts. */
450 /* Realign data section. */
451 ASM_OUTPUT_ALIGN (asm_out_file, align);
452 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
454 assemble_zeros (size);
458 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
459 #ifdef ASM_OUTPUT_SHARED_LOCAL
460 if (flag_shared_data)
461 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
464 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
465 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
468 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
469 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
472 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
477 /* Output any basic block strings */
478 if (profile_block_flag)
480 readonly_data_section ();
483 ASM_OUTPUT_ALIGN (asm_out_file, align);
484 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
486 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC",
488 assemble_string (sptr->string, sptr->length);
493 /* Output the table of addresses. */
494 if (profile_block_flag)
496 /* Realign in new section */
497 ASM_OUTPUT_ALIGN (asm_out_file, align);
498 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
499 for (i = 0; i < count_basic_blocks; i++)
501 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
502 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
507 /* Output the table of function names. */
508 if (profile_block_flag)
510 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
511 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
513 if (ptr->func_label_num >= 0)
515 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
516 ptr->func_label_num);
517 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
521 assemble_integer (const0_rtx, pointer_bytes, 1);
524 for ( ; i < count_basic_blocks; i++)
525 assemble_integer (const0_rtx, pointer_bytes, 1);
528 if (write_symbols != NO_DEBUG && profile_block_flag)
530 /* Output the table of line numbers. */
531 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
532 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
533 assemble_integer (GEN_INT (ptr->line_num), long_bytes, 1);
535 for ( ; i < count_basic_blocks; i++)
536 assemble_integer (const0_rtx, long_bytes, 1);
538 /* Output the table of file names. */
539 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
540 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
542 if (ptr->file_label_num >= 0)
544 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
545 ptr->file_label_num);
546 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
550 assemble_integer (const0_rtx, pointer_bytes, 1);
553 for ( ; i < count_basic_blocks; i++)
554 assemble_integer (const0_rtx, pointer_bytes, 1);
557 /* End with the address of the table of addresses,
558 so we can find it easily, as the last word in the file's text. */
559 if (profile_block_flag)
561 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
562 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
568 /* Enable APP processing of subsequent output.
569 Used before the output from an `asm' statement. */
576 fprintf (asm_out_file, ASM_APP_ON);
581 /* Disable APP processing of subsequent output.
582 Called from varasm.c before most kinds of output. */
589 fprintf (asm_out_file, ASM_APP_OFF);
594 /* Return the number of slots filled in the current
595 delayed branch sequence (we don't count the insn needing the
596 delay slot). Zero if not in a delayed branch sequence. */
600 dbr_sequence_length ()
602 if (final_sequence != 0)
603 return XVECLEN (final_sequence, 0) - 1;
609 /* The next two pages contain routines used to compute the length of an insn
610 and to shorten branches. */
612 /* Arrays for insn lengths, and addresses. The latter is referenced by
613 `insn_current_length'. */
615 static short *insn_lengths;
618 /* Address of insn being processed. Used by `insn_current_length'. */
619 int insn_current_address;
621 /* Indicate that branch shortening hasn't yet been done. */
629 /* Obtain the current length of an insn. If branch shortening has been done,
630 get its actual length. Otherwise, get its maximum length. */
633 get_attr_length (insn)
636 #ifdef HAVE_ATTR_length
642 return insn_lengths[INSN_UID (insn)];
644 switch (GET_CODE (insn))
652 length = insn_default_length (insn);
656 body = PATTERN (insn);
657 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
659 /* This only takes room if jump tables go into the text section. */
660 #if !defined(READONLY_DATA_SECTION) || defined(JUMP_TABLES_IN_TEXT_SECTION)
661 length = (XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC)
662 * GET_MODE_SIZE (GET_MODE (body)));
664 /* Be pessimistic and assume worst-case alignment. */
665 length += (GET_MODE_SIZE (GET_MODE (body)) - 1);
671 length = insn_default_length (insn);
675 body = PATTERN (insn);
676 if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
679 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
680 length = asm_insn_count (body) * insn_default_length (insn);
681 else if (GET_CODE (body) == SEQUENCE)
682 for (i = 0; i < XVECLEN (body, 0); i++)
683 length += get_attr_length (XVECEXP (body, 0, i));
685 length = insn_default_length (insn);
692 #ifdef ADJUST_INSN_LENGTH
693 ADJUST_INSN_LENGTH (insn, length);
696 #else /* not HAVE_ATTR_length */
698 #endif /* not HAVE_ATTR_length */
701 /* Make a pass over all insns and compute their actual lengths by shortening
702 any branches of variable length if possible. */
704 /* Give a default value for the lowest address in a function. */
706 #ifndef FIRST_INSN_ADDRESS
707 #define FIRST_INSN_ADDRESS 0
711 shorten_branches (first)
714 #ifdef HAVE_ATTR_length
716 int something_changed = 1;
718 char *varying_length;
722 /* In order to make sure that all instructions have valid length info,
723 we must split them before we compute the address/length info. */
725 for (insn = NEXT_INSN (first); insn; insn = NEXT_INSN (insn))
726 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
727 insn = try_split (PATTERN (insn), insn, 1);
729 /* Compute maximum UID and allocate arrays. */
730 for (insn = first; insn; insn = NEXT_INSN (insn))
731 if (INSN_UID (insn) > max_uid)
732 max_uid = INSN_UID (insn);
735 insn_lengths = (short *) oballoc (max_uid * sizeof (short));
736 insn_addresses = (int *) oballoc (max_uid * sizeof (int));
737 varying_length = (char *) oballoc (max_uid * sizeof (char));
739 /* Compute initial lengths, addresses, and varying flags for each insn. */
740 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
742 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
744 uid = INSN_UID (insn);
745 insn_addresses[uid] = insn_current_address;
746 insn_lengths[uid] = 0;
747 varying_length[uid] = 0;
749 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
750 || GET_CODE (insn) == CODE_LABEL)
752 if (INSN_DELETED_P (insn))
755 body = PATTERN (insn);
756 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
758 /* This only takes room if read-only data goes into the text
760 #if !defined(READONLY_DATA_SECTION) || defined(JUMP_TABLES_IN_TEXT_SECTION)
761 int unitsize = GET_MODE_SIZE (GET_MODE (body));
763 insn_lengths[uid] = (XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC)
764 * GET_MODE_SIZE (GET_MODE (body)));
766 /* We don't know what address the ADDR_VEC/ADDR_DIFF_VEC will end
767 up at after branch shortening. As a result, it is impossible
768 to determine how much padding we need at this point. Therefore,
769 assume worst possible alignment. */
770 insn_lengths[uid] += unitsize - 1;
776 else if (asm_noperands (body) >= 0)
777 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
778 else if (GET_CODE (body) == SEQUENCE)
781 int const_delay_slots;
783 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
785 const_delay_slots = 0;
787 /* Inside a delay slot sequence, we do not do any branch shortening
788 if the shortening could change the number of delay slots
790 for (i = 0; i < XVECLEN (body, 0); i++)
792 rtx inner_insn = XVECEXP (body, 0, i);
793 int inner_uid = INSN_UID (inner_insn);
796 if (asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
797 inner_length = (asm_insn_count (PATTERN (inner_insn))
798 * insn_default_length (inner_insn));
800 inner_length = insn_default_length (inner_insn);
802 insn_lengths[inner_uid] = inner_length;
803 if (const_delay_slots)
805 if ((varying_length[inner_uid]
806 = insn_variable_length_p (inner_insn)) != 0)
807 varying_length[uid] = 1;
808 insn_addresses[inner_uid] = (insn_current_address +
812 varying_length[inner_uid] = 0;
813 insn_lengths[uid] += inner_length;
816 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
818 insn_lengths[uid] = insn_default_length (insn);
819 varying_length[uid] = insn_variable_length_p (insn);
822 /* If needed, do any adjustment. */
823 #ifdef ADJUST_INSN_LENGTH
824 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
828 /* Now loop over all the insns finding varying length insns. For each,
829 get the current insn length. If it has changed, reflect the change.
830 When nothing changes for a full pass, we are done. */
832 while (something_changed)
834 something_changed = 0;
835 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
837 insn = NEXT_INSN (insn))
842 uid = INSN_UID (insn);
843 insn_addresses[uid] = insn_current_address;
844 if (! varying_length[uid])
846 insn_current_address += insn_lengths[uid];
849 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
853 body = PATTERN (insn);
855 for (i = 0; i < XVECLEN (body, 0); i++)
857 rtx inner_insn = XVECEXP (body, 0, i);
858 int inner_uid = INSN_UID (inner_insn);
861 insn_addresses[inner_uid] = insn_current_address;
863 /* insn_current_length returns 0 for insns with a
864 non-varying length. */
865 if (! varying_length[inner_uid])
866 inner_length = insn_lengths[inner_uid];
868 inner_length = insn_current_length (inner_insn);
870 if (inner_length != insn_lengths[inner_uid])
872 insn_lengths[inner_uid] = inner_length;
873 something_changed = 1;
875 insn_current_address += insn_lengths[inner_uid];
876 new_length += inner_length;
881 new_length = insn_current_length (insn);
882 insn_current_address += new_length;
885 #ifdef SHORTEN_WITH_ADJUST_INSN_LENGTH
886 #ifdef ADJUST_INSN_LENGTH
887 /* If needed, do any adjustment. */
888 tmp_length = new_length;
889 ADJUST_INSN_LENGTH (insn, new_length);
890 insn_current_address += (new_length - tmp_length);
894 if (new_length != insn_lengths[uid])
896 insn_lengths[uid] = new_length;
897 something_changed = 1;
900 /* For a non-optimizing compile, do only a single pass. */
904 #endif /* HAVE_ATTR_length */
907 #ifdef HAVE_ATTR_length
908 /* Given the body of an INSN known to be generated by an ASM statement, return
909 the number of machine instructions likely to be generated for this insn.
910 This is used to compute its length. */
913 asm_insn_count (body)
919 if (GET_CODE (body) == ASM_INPUT)
920 template = XSTR (body, 0);
922 template = decode_asm_operands (body, NULL_PTR, NULL_PTR,
925 for ( ; *template; template++)
926 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
933 /* Output assembler code for the start of a function,
934 and initialize some of the variables in this file
935 for the new function. The label for the function and associated
936 assembler pseudo-ops have already been output in `assemble_start_function'.
938 FIRST is the first insn of the rtl for the function being compiled.
939 FILE is the file to write assembler code to.
940 OPTIMIZE is nonzero if we should eliminate redundant
941 test and compare insns. */
944 final_start_function (first, file, optimize)
951 this_is_asm_operands = 0;
953 #ifdef NON_SAVING_SETJMP
954 /* A function that calls setjmp should save and restore all the
955 call-saved registers on a system where longjmp clobbers them. */
956 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
960 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
961 if (!call_used_regs[i] && !call_fixed_regs[i])
962 regs_ever_live[i] = 1;
966 /* Initial line number is supposed to be output
967 before the function's prologue and label
968 so that the function's address will not appear to be
969 in the last statement of the preceding function. */
970 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
971 last_linenum = high_block_linenum = high_function_linenum
972 = NOTE_LINE_NUMBER (first);
974 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
975 /* Output DWARF definition of the function. */
976 if (dwarf2out_do_frame ())
977 dwarf2out_begin_prologue ();
980 /* For SDB and XCOFF, the function beginning must be marked between
981 the function label and the prologue. We always need this, even when
982 -g1 was used. Defer on MIPS systems so that parameter descriptions
983 follow function entry. */
984 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
985 if (write_symbols == SDB_DEBUG)
986 sdbout_begin_function (last_linenum);
989 #ifdef XCOFF_DEBUGGING_INFO
990 if (write_symbols == XCOFF_DEBUG)
991 xcoffout_begin_function (file, last_linenum);
994 /* But only output line number for other debug info types if -g2
996 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
997 output_source_line (file, first);
999 #ifdef LEAF_REG_REMAP
1001 leaf_renumber_regs (first);
1004 /* The Sun386i and perhaps other machines don't work right
1005 if the profiling code comes after the prologue. */
1006 #ifdef PROFILE_BEFORE_PROLOGUE
1008 profile_function (file);
1009 #endif /* PROFILE_BEFORE_PROLOGUE */
1011 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1012 if (dwarf2out_do_frame ())
1013 dwarf2out_frame_debug (NULL_RTX);
1016 #ifdef FUNCTION_PROLOGUE
1017 /* First output the function prologue: code to set up the stack frame. */
1018 FUNCTION_PROLOGUE (file, get_frame_size ());
1021 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1022 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
1023 next_block_index = 1;
1026 /* If the machine represents the prologue as RTL, the profiling code must
1027 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1028 #ifdef HAVE_prologue
1029 if (! HAVE_prologue)
1031 profile_after_prologue (file);
1035 /* If we are doing basic block profiling, remember a printable version
1036 of the function name. */
1037 if (profile_block_flag)
1040 = add_bb_string ((*decl_printable_name) (current_function_decl, 2), FALSE);
1045 profile_after_prologue (file)
1048 #ifdef FUNCTION_BLOCK_PROFILER
1049 if (profile_block_flag)
1051 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
1053 #endif /* FUNCTION_BLOCK_PROFILER */
1055 #ifndef PROFILE_BEFORE_PROLOGUE
1057 profile_function (file);
1058 #endif /* not PROFILE_BEFORE_PROLOGUE */
1062 profile_function (file)
1065 int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1066 int sval = current_function_returns_struct;
1067 int cxt = current_function_needs_context;
1070 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1071 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
1072 assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, 1);
1074 function_section (current_function_decl);
1076 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1078 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
1080 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1082 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1086 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1088 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1090 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1092 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1096 FUNCTION_PROFILER (file, profile_label_no);
1098 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1100 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1102 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1104 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1108 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1110 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1112 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1114 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1119 /* Output assembler code for the end of a function.
1120 For clarity, args are same as those of `final_start_function'
1121 even though not all of them are needed. */
1124 final_end_function (first, file, optimize)
1131 fprintf (file, ASM_APP_OFF);
1135 #ifdef SDB_DEBUGGING_INFO
1136 if (write_symbols == SDB_DEBUG)
1137 sdbout_end_function (high_function_linenum);
1140 #ifdef DWARF_DEBUGGING_INFO
1141 if (write_symbols == DWARF_DEBUG)
1142 dwarfout_end_function ();
1145 #ifdef XCOFF_DEBUGGING_INFO
1146 if (write_symbols == XCOFF_DEBUG)
1147 xcoffout_end_function (file, high_function_linenum);
1150 #ifdef FUNCTION_EPILOGUE
1151 /* Finally, output the function epilogue:
1152 code to restore the stack frame and return to the caller. */
1153 FUNCTION_EPILOGUE (file, get_frame_size ());
1156 #ifdef SDB_DEBUGGING_INFO
1157 if (write_symbols == SDB_DEBUG)
1158 sdbout_end_epilogue ();
1161 #ifdef DWARF_DEBUGGING_INFO
1162 if (write_symbols == DWARF_DEBUG)
1163 dwarfout_end_epilogue ();
1166 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1167 if (dwarf2out_do_frame ())
1168 dwarf2out_end_epilogue ();
1171 #ifdef XCOFF_DEBUGGING_INFO
1172 if (write_symbols == XCOFF_DEBUG)
1173 xcoffout_end_epilogue (file);
1176 bb_func_label_num = -1; /* not in function, nuke label # */
1178 /* If FUNCTION_EPILOGUE is not defined, then the function body
1179 itself contains return instructions wherever needed. */
1182 /* Add a block to the linked list that remembers the current line/file/function
1183 for basic block profiling. Emit the label in front of the basic block and
1184 the instructions that increment the count field. */
1190 struct bb_list *ptr = (struct bb_list *) permalloc (sizeof (struct bb_list));
1192 /* Add basic block to linked list. */
1194 ptr->line_num = last_linenum;
1195 ptr->file_label_num = bb_file_label_num;
1196 ptr->func_label_num = bb_func_label_num;
1198 bb_tail = &ptr->next;
1200 /* Enable the table of basic-block use counts
1201 to point at the code it applies to. */
1202 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1204 /* Before first insn of this basic block, increment the
1205 count of times it was entered. */
1206 #ifdef BLOCK_PROFILER
1207 BLOCK_PROFILER (file, count_basic_blocks);
1214 count_basic_blocks++;
1217 /* Add a string to be used for basic block profiling. */
1220 add_bb_string (string, perm_p)
1225 struct bb_str *ptr = 0;
1229 string = "<unknown>";
1233 /* Allocate a new string if the current string isn't permanent. If
1234 the string is permanent search for the same string in other
1237 len = strlen (string) + 1;
1240 char *p = (char *) permalloc (len);
1241 bcopy (string, p, len);
1245 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1246 if (ptr->string == string)
1249 /* Allocate a new string block if we need to. */
1252 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1255 ptr->label_num = sbb_label_num++;
1256 ptr->string = string;
1258 sbb_tail = &ptr->next;
1261 return ptr->label_num;
1265 /* Output assembler code for some insns: all or part of a function.
1266 For description of args, see `final_start_function', above.
1268 PRESCAN is 1 if we are not really outputting,
1269 just scanning as if we were outputting.
1270 Prescanning deletes and rearranges insns just like ordinary output.
1271 PRESCAN is -2 if we are outputting after having prescanned.
1272 In this case, don't try to delete or rearrange insns
1273 because that has already been done.
1274 Prescanning is done only on certain machines. */
1277 final (first, file, optimize, prescan)
1286 last_ignored_compare = 0;
1289 check_exception_handler_labels ();
1291 /* Make a map indicating which line numbers appear in this function.
1292 When producing SDB debugging info, delete troublesome line number
1293 notes from inlined functions in other files as well as duplicate
1294 line number notes. */
1295 #ifdef SDB_DEBUGGING_INFO
1296 if (write_symbols == SDB_DEBUG)
1299 for (insn = first; insn; insn = NEXT_INSN (insn))
1300 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1302 if ((RTX_INTEGRATED_P (insn)
1303 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1305 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1306 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1308 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1309 NOTE_SOURCE_FILE (insn) = 0;
1313 if (NOTE_LINE_NUMBER (insn) > max_line)
1314 max_line = NOTE_LINE_NUMBER (insn);
1320 for (insn = first; insn; insn = NEXT_INSN (insn))
1321 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1322 max_line = NOTE_LINE_NUMBER (insn);
1325 line_note_exists = (char *) oballoc (max_line + 1);
1326 bzero (line_note_exists, max_line + 1);
1328 for (insn = first; insn; insn = NEXT_INSN (insn))
1329 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1330 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
1336 /* Output the insns. */
1337 for (insn = NEXT_INSN (first); insn;)
1339 #ifdef HAVE_ATTR_length
1340 insn_current_address = insn_addresses[INSN_UID (insn)];
1342 insn = final_scan_insn (insn, file, optimize, prescan, 0);
1345 /* Do basic-block profiling here
1346 if the last insn was a conditional branch. */
1347 if (profile_block_flag && new_block)
1351 /* The final scan for one insn, INSN.
1352 Args are same as in `final', except that INSN
1353 is the insn being scanned.
1354 Value returned is the next insn to be scanned.
1356 NOPEEPHOLES is the flag to disallow peephole processing (currently
1357 used for within delayed branch sequence output). */
1360 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
1370 /* Ignore deleted insns. These can occur when we split insns (due to a
1371 template of "#") while not optimizing. */
1372 if (INSN_DELETED_P (insn))
1373 return NEXT_INSN (insn);
1375 switch (GET_CODE (insn))
1381 /* Align the beginning of a loop, for higher speed
1382 on certain machines. */
1384 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG && optimize > 0)
1386 #ifdef ASM_OUTPUT_LOOP_ALIGN
1387 rtx next = next_nonnote_insn (insn);
1388 if (next && GET_CODE (next) == CODE_LABEL)
1390 ASM_OUTPUT_LOOP_ALIGN (asm_out_file);
1395 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END)
1398 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG
1399 && ! exceptions_via_longjmp)
1401 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHB", NOTE_BLOCK_NUMBER (insn));
1402 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn));
1403 #ifdef ASM_OUTPUT_EH_REGION_BEG
1404 ASM_OUTPUT_EH_REGION_BEG (file, NOTE_BLOCK_NUMBER (insn));
1409 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END
1410 && ! exceptions_via_longjmp)
1412 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHE", NOTE_BLOCK_NUMBER (insn));
1413 #ifdef ASM_OUTPUT_EH_REGION_END
1414 ASM_OUTPUT_EH_REGION_END (file, NOTE_BLOCK_NUMBER (insn));
1419 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
1421 #ifdef FUNCTION_END_PROLOGUE
1422 FUNCTION_END_PROLOGUE (file);
1424 profile_after_prologue (file);
1428 #ifdef FUNCTION_BEGIN_EPILOGUE
1429 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
1431 FUNCTION_BEGIN_EPILOGUE (file);
1436 if (write_symbols == NO_DEBUG)
1438 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
1440 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
1441 /* MIPS stabs require the parameter descriptions to be after the
1442 function entry point rather than before. */
1443 if (write_symbols == SDB_DEBUG)
1444 sdbout_begin_function (last_linenum);
1447 #ifdef DWARF_DEBUGGING_INFO
1448 /* This outputs a marker where the function body starts, so it
1449 must be after the prologue. */
1450 if (write_symbols == DWARF_DEBUG)
1451 dwarfout_begin_function ();
1455 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED)
1456 break; /* An insn that was "deleted" */
1459 fprintf (file, ASM_APP_OFF);
1462 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG
1463 && (debug_info_level == DINFO_LEVEL_NORMAL
1464 || debug_info_level == DINFO_LEVEL_VERBOSE
1465 || write_symbols == DWARF_DEBUG
1466 || write_symbols == DWARF2_DEBUG))
1468 /* Beginning of a symbol-block. Assign it a sequence number
1469 and push the number onto the stack PENDING_BLOCKS. */
1471 if (block_depth == max_block_depth)
1473 /* PENDING_BLOCKS is full; make it longer. */
1474 max_block_depth *= 2;
1476 = (int *) xrealloc (pending_blocks,
1477 max_block_depth * sizeof (int));
1479 pending_blocks[block_depth++] = next_block_index;
1481 high_block_linenum = last_linenum;
1483 /* Output debugging info about the symbol-block beginning. */
1485 #ifdef SDB_DEBUGGING_INFO
1486 if (write_symbols == SDB_DEBUG)
1487 sdbout_begin_block (file, last_linenum, next_block_index);
1489 #ifdef XCOFF_DEBUGGING_INFO
1490 if (write_symbols == XCOFF_DEBUG)
1491 xcoffout_begin_block (file, last_linenum, next_block_index);
1493 #ifdef DBX_DEBUGGING_INFO
1494 if (write_symbols == DBX_DEBUG)
1495 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", next_block_index);
1497 #ifdef DWARF_DEBUGGING_INFO
1498 if (write_symbols == DWARF_DEBUG)
1499 dwarfout_begin_block (next_block_index);
1501 #ifdef DWARF2_DEBUGGING_INFO
1502 if (write_symbols == DWARF2_DEBUG)
1503 dwarf2out_begin_block (next_block_index);
1508 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END
1509 && (debug_info_level == DINFO_LEVEL_NORMAL
1510 || debug_info_level == DINFO_LEVEL_VERBOSE
1511 || write_symbols == DWARF_DEBUG
1512 || write_symbols == DWARF2_DEBUG))
1514 /* End of a symbol-block. Pop its sequence number off
1515 PENDING_BLOCKS and output debugging info based on that. */
1519 #ifdef XCOFF_DEBUGGING_INFO
1520 if (write_symbols == XCOFF_DEBUG && block_depth >= 0)
1521 xcoffout_end_block (file, high_block_linenum,
1522 pending_blocks[block_depth]);
1524 #ifdef DBX_DEBUGGING_INFO
1525 if (write_symbols == DBX_DEBUG && block_depth >= 0)
1526 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE",
1527 pending_blocks[block_depth]);
1529 #ifdef SDB_DEBUGGING_INFO
1530 if (write_symbols == SDB_DEBUG && block_depth >= 0)
1531 sdbout_end_block (file, high_block_linenum,
1532 pending_blocks[block_depth]);
1534 #ifdef DWARF_DEBUGGING_INFO
1535 if (write_symbols == DWARF_DEBUG && block_depth >= 0)
1536 dwarfout_end_block (pending_blocks[block_depth]);
1538 #ifdef DWARF2_DEBUGGING_INFO
1539 if (write_symbols == DWARF2_DEBUG && block_depth >= 0)
1540 dwarf2out_end_block (pending_blocks[block_depth]);
1543 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL
1544 && (debug_info_level == DINFO_LEVEL_NORMAL
1545 || debug_info_level == DINFO_LEVEL_VERBOSE))
1547 #ifdef DWARF_DEBUGGING_INFO
1548 if (write_symbols == DWARF_DEBUG)
1549 dwarfout_label (insn);
1551 #ifdef DWARF2_DEBUGGING_INFO
1552 if (write_symbols == DWARF2_DEBUG)
1553 dwarf2out_label (insn);
1556 else if (NOTE_LINE_NUMBER (insn) > 0)
1557 /* This note is a line-number. */
1561 #if 0 /* This is what we used to do. */
1562 output_source_line (file, insn);
1566 /* If there is anything real after this note,
1567 output it. If another line note follows, omit this one. */
1568 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
1570 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
1572 /* These types of notes can be significant
1573 so make sure the preceding line number stays. */
1574 else if (GET_CODE (note) == NOTE
1575 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
1576 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
1577 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
1579 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
1581 /* Another line note follows; we can delete this note
1582 if no intervening line numbers have notes elsewhere. */
1584 for (num = NOTE_LINE_NUMBER (insn) + 1;
1585 num < NOTE_LINE_NUMBER (note);
1587 if (line_note_exists[num])
1590 if (num >= NOTE_LINE_NUMBER (note))
1596 /* Output this line note
1597 if it is the first or the last line note in a row. */
1599 output_source_line (file, insn);
1604 #ifdef ASM_OUTPUT_ALIGN_CODE
1605 /* Don't litter the assembler output with needless alignments. A
1606 BARRIER will be placed at the end of every function if HAVE_epilogue
1608 if (NEXT_INSN (insn))
1609 ASM_OUTPUT_ALIGN_CODE (file);
1611 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
1612 /* If we push arguments, we need to check all insns for stack
1614 if (dwarf2out_do_frame ())
1615 dwarf2out_frame_debug (insn);
1625 #ifdef FINAL_PRESCAN_LABEL
1626 FINAL_PRESCAN_INSN (insn, NULL_PTR, 0);
1629 #ifdef SDB_DEBUGGING_INFO
1630 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
1631 sdbout_label (insn);
1633 #ifdef DWARF_DEBUGGING_INFO
1634 if (write_symbols == DWARF_DEBUG && LABEL_NAME (insn))
1635 dwarfout_label (insn);
1637 #ifdef DWARF2_DEBUGGING_INFO
1638 if (write_symbols == DWARF2_DEBUG && LABEL_NAME (insn))
1639 dwarf2out_label (insn);
1643 fprintf (file, ASM_APP_OFF);
1646 if (NEXT_INSN (insn) != 0
1647 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
1649 rtx nextbody = PATTERN (NEXT_INSN (insn));
1651 /* If this label is followed by a jump-table,
1652 make sure we put the label in the read-only section. Also
1653 possibly write the label and jump table together. */
1655 if (GET_CODE (nextbody) == ADDR_VEC
1656 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1658 #ifndef JUMP_TABLES_IN_TEXT_SECTION
1659 readonly_data_section ();
1660 #ifdef READONLY_DATA_SECTION
1661 ASM_OUTPUT_ALIGN (file,
1662 exact_log2 (BIGGEST_ALIGNMENT
1664 #endif /* READONLY_DATA_SECTION */
1665 #else /* JUMP_TABLES_IN_TEXT_SECTION */
1666 function_section (current_function_decl);
1667 #endif /* JUMP_TABLES_IN_TEXT_SECTION */
1668 #ifdef ASM_OUTPUT_CASE_LABEL
1669 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
1672 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
1678 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
1683 register rtx body = PATTERN (insn), set;
1684 int insn_code_number;
1688 /* An INSN, JUMP_INSN or CALL_INSN.
1689 First check for special kinds that recog doesn't recognize. */
1691 if (GET_CODE (body) == USE /* These are just declarations */
1692 || GET_CODE (body) == CLOBBER)
1696 /* If there is a REG_CC_SETTER note on this insn, it means that
1697 the setting of the condition code was done in the delay slot
1698 of the insn that branched here. So recover the cc status
1699 from the insn that set it. */
1701 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
1704 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
1705 cc_prev_status = cc_status;
1709 /* Detect insns that are really jump-tables
1710 and output them as such. */
1712 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1714 register int vlen, idx;
1721 fprintf (file, ASM_APP_OFF);
1725 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
1726 for (idx = 0; idx < vlen; idx++)
1728 if (GET_CODE (body) == ADDR_VEC)
1730 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
1731 ASM_OUTPUT_ADDR_VEC_ELT
1732 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
1739 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
1740 ASM_OUTPUT_ADDR_DIFF_ELT
1742 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
1743 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
1749 #ifdef ASM_OUTPUT_CASE_END
1750 ASM_OUTPUT_CASE_END (file,
1751 CODE_LABEL_NUMBER (PREV_INSN (insn)),
1755 function_section (current_function_decl);
1760 /* Do basic-block profiling when we reach a new block.
1761 Done here to avoid jump tables. */
1762 if (profile_block_flag && new_block)
1765 if (GET_CODE (body) == ASM_INPUT)
1767 /* There's no telling what that did to the condition codes. */
1773 fprintf (file, ASM_APP_ON);
1776 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
1780 /* Detect `asm' construct with operands. */
1781 if (asm_noperands (body) >= 0)
1783 int noperands = asm_noperands (body);
1784 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
1787 /* There's no telling what that did to the condition codes. */
1794 fprintf (file, ASM_APP_ON);
1798 /* Get out the operand values. */
1799 string = decode_asm_operands (body, ops, NULL_PTR,
1800 NULL_PTR, NULL_PTR);
1801 /* Inhibit aborts on what would otherwise be compiler bugs. */
1802 insn_noperands = noperands;
1803 this_is_asm_operands = insn;
1805 /* Output the insn using them. */
1806 output_asm_insn (string, ops);
1807 this_is_asm_operands = 0;
1811 if (prescan <= 0 && app_on)
1813 fprintf (file, ASM_APP_OFF);
1817 if (GET_CODE (body) == SEQUENCE)
1819 /* A delayed-branch sequence */
1825 final_sequence = body;
1827 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
1828 force the restoration of a comparison that was previously
1829 thought unnecessary. If that happens, cancel this sequence
1830 and cause that insn to be restored. */
1832 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
1833 if (next != XVECEXP (body, 0, 1))
1839 for (i = 1; i < XVECLEN (body, 0); i++)
1841 rtx insn = XVECEXP (body, 0, i);
1842 rtx next = NEXT_INSN (insn);
1843 /* We loop in case any instruction in a delay slot gets
1846 insn = final_scan_insn (insn, file, 0, prescan, 1);
1847 while (insn != next);
1849 #ifdef DBR_OUTPUT_SEQEND
1850 DBR_OUTPUT_SEQEND (file);
1854 /* If the insn requiring the delay slot was a CALL_INSN, the
1855 insns in the delay slot are actually executed before the
1856 called function. Hence we don't preserve any CC-setting
1857 actions in these insns and the CC must be marked as being
1858 clobbered by the function. */
1859 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
1862 /* Following a conditional branch sequence, we have a new basic
1864 if (profile_block_flag)
1866 rtx insn = XVECEXP (body, 0, 0);
1867 rtx body = PATTERN (insn);
1869 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
1870 && GET_CODE (SET_SRC (body)) != LABEL_REF)
1871 || (GET_CODE (insn) == JUMP_INSN
1872 && GET_CODE (body) == PARALLEL
1873 && GET_CODE (XVECEXP (body, 0, 0)) == SET
1874 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
1880 /* We have a real machine instruction as rtl. */
1882 body = PATTERN (insn);
1885 set = single_set(insn);
1887 /* Check for redundant test and compare instructions
1888 (when the condition codes are already set up as desired).
1889 This is done only when optimizing; if not optimizing,
1890 it should be possible for the user to alter a variable
1891 with the debugger in between statements
1892 and the next statement should reexamine the variable
1893 to compute the condition codes. */
1898 rtx set = single_set(insn);
1902 && GET_CODE (SET_DEST (set)) == CC0
1903 && insn != last_ignored_compare)
1905 if (GET_CODE (SET_SRC (set)) == SUBREG)
1906 SET_SRC (set) = alter_subreg (SET_SRC (set));
1907 else if (GET_CODE (SET_SRC (set)) == COMPARE)
1909 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
1910 XEXP (SET_SRC (set), 0)
1911 = alter_subreg (XEXP (SET_SRC (set), 0));
1912 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
1913 XEXP (SET_SRC (set), 1)
1914 = alter_subreg (XEXP (SET_SRC (set), 1));
1916 if ((cc_status.value1 != 0
1917 && rtx_equal_p (SET_SRC (set), cc_status.value1))
1918 || (cc_status.value2 != 0
1919 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
1921 /* Don't delete insn if it has an addressing side-effect. */
1922 if (! FIND_REG_INC_NOTE (insn, 0)
1923 /* or if anything in it is volatile. */
1924 && ! volatile_refs_p (PATTERN (insn)))
1926 /* We don't really delete the insn; just ignore it. */
1927 last_ignored_compare = insn;
1935 /* Following a conditional branch, we have a new basic block.
1936 But if we are inside a sequence, the new block starts after the
1937 last insn of the sequence. */
1938 if (profile_block_flag && final_sequence == 0
1939 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
1940 && GET_CODE (SET_SRC (body)) != LABEL_REF)
1941 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
1942 && GET_CODE (XVECEXP (body, 0, 0)) == SET
1943 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
1947 /* Don't bother outputting obvious no-ops, even without -O.
1948 This optimization is fast and doesn't interfere with debugging.
1949 Don't do this if the insn is in a delay slot, since this
1950 will cause an improper number of delay insns to be written. */
1951 if (final_sequence == 0
1953 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
1954 && GET_CODE (SET_SRC (body)) == REG
1955 && GET_CODE (SET_DEST (body)) == REG
1956 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
1961 /* If this is a conditional branch, maybe modify it
1962 if the cc's are in a nonstandard state
1963 so that it accomplishes the same thing that it would
1964 do straightforwardly if the cc's were set up normally. */
1966 if (cc_status.flags != 0
1967 && GET_CODE (insn) == JUMP_INSN
1968 && GET_CODE (body) == SET
1969 && SET_DEST (body) == pc_rtx
1970 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
1971 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
1972 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
1973 /* This is done during prescan; it is not done again
1974 in final scan when prescan has been done. */
1977 /* This function may alter the contents of its argument
1978 and clear some of the cc_status.flags bits.
1979 It may also return 1 meaning condition now always true
1980 or -1 meaning condition now always false
1981 or 2 meaning condition nontrivial but altered. */
1982 register int result = alter_cond (XEXP (SET_SRC (body), 0));
1983 /* If condition now has fixed value, replace the IF_THEN_ELSE
1984 with its then-operand or its else-operand. */
1986 SET_SRC (body) = XEXP (SET_SRC (body), 1);
1988 SET_SRC (body) = XEXP (SET_SRC (body), 2);
1990 /* The jump is now either unconditional or a no-op.
1991 If it has become a no-op, don't try to output it.
1992 (It would not be recognized.) */
1993 if (SET_SRC (body) == pc_rtx)
1995 PUT_CODE (insn, NOTE);
1996 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1997 NOTE_SOURCE_FILE (insn) = 0;
2000 else if (GET_CODE (SET_SRC (body)) == RETURN)
2001 /* Replace (set (pc) (return)) with (return). */
2002 PATTERN (insn) = body = SET_SRC (body);
2004 /* Rerecognize the instruction if it has changed. */
2006 INSN_CODE (insn) = -1;
2009 /* Make same adjustments to instructions that examine the
2010 condition codes without jumping and instructions that
2011 handle conditional moves (if this machine has either one). */
2013 if (cc_status.flags != 0
2016 rtx cond_rtx, then_rtx, else_rtx;
2018 if (GET_CODE (insn) != JUMP_INSN
2019 && GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
2021 cond_rtx = XEXP (SET_SRC (set), 0);
2022 then_rtx = XEXP (SET_SRC (set), 1);
2023 else_rtx = XEXP (SET_SRC (set), 2);
2027 cond_rtx = SET_SRC (set);
2028 then_rtx = const_true_rtx;
2029 else_rtx = const0_rtx;
2032 switch (GET_CODE (cond_rtx))
2045 register int result;
2046 if (XEXP (cond_rtx, 0) != cc0_rtx)
2048 result = alter_cond (cond_rtx);
2050 validate_change (insn, &SET_SRC (set), then_rtx, 0);
2051 else if (result == -1)
2052 validate_change (insn, &SET_SRC (set), else_rtx, 0);
2053 else if (result == 2)
2054 INSN_CODE (insn) = -1;
2055 if (SET_DEST (set) == SET_SRC (set))
2057 PUT_CODE (insn, NOTE);
2058 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2059 NOTE_SOURCE_FILE (insn) = 0;
2071 /* Do machine-specific peephole optimizations if desired. */
2073 if (optimize && !flag_no_peephole && !nopeepholes)
2075 rtx next = peephole (insn);
2076 /* When peepholing, if there were notes within the peephole,
2077 emit them before the peephole. */
2078 if (next != 0 && next != NEXT_INSN (insn))
2080 rtx prev = PREV_INSN (insn);
2083 for (note = NEXT_INSN (insn); note != next;
2084 note = NEXT_INSN (note))
2085 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2087 /* In case this is prescan, put the notes
2088 in proper position for later rescan. */
2089 note = NEXT_INSN (insn);
2090 PREV_INSN (note) = prev;
2091 NEXT_INSN (prev) = note;
2092 NEXT_INSN (PREV_INSN (next)) = insn;
2093 PREV_INSN (insn) = PREV_INSN (next);
2094 NEXT_INSN (insn) = next;
2095 PREV_INSN (next) = insn;
2098 /* PEEPHOLE might have changed this. */
2099 body = PATTERN (insn);
2102 /* Try to recognize the instruction.
2103 If successful, verify that the operands satisfy the
2104 constraints for the instruction. Crash if they don't,
2105 since `reload' should have changed them so that they do. */
2107 insn_code_number = recog_memoized (insn);
2108 insn_extract (insn);
2109 for (i = 0; i < insn_n_operands[insn_code_number]; i++)
2111 if (GET_CODE (recog_operand[i]) == SUBREG)
2112 recog_operand[i] = alter_subreg (recog_operand[i]);
2113 else if (GET_CODE (recog_operand[i]) == PLUS
2114 || GET_CODE (recog_operand[i]) == MULT)
2115 recog_operand[i] = walk_alter_subreg (recog_operand[i]);
2118 for (i = 0; i < insn_n_dups[insn_code_number]; i++)
2120 if (GET_CODE (*recog_dup_loc[i]) == SUBREG)
2121 *recog_dup_loc[i] = alter_subreg (*recog_dup_loc[i]);
2122 else if (GET_CODE (*recog_dup_loc[i]) == PLUS
2123 || GET_CODE (*recog_dup_loc[i]) == MULT)
2124 *recog_dup_loc[i] = walk_alter_subreg (*recog_dup_loc[i]);
2127 #ifdef REGISTER_CONSTRAINTS
2128 if (! constrain_operands (insn_code_number, 1))
2129 fatal_insn_not_found (insn);
2132 /* Some target machines need to prescan each insn before
2135 #ifdef FINAL_PRESCAN_INSN
2136 FINAL_PRESCAN_INSN (insn, recog_operand,
2137 insn_n_operands[insn_code_number]);
2141 cc_prev_status = cc_status;
2143 /* Update `cc_status' for this instruction.
2144 The instruction's output routine may change it further.
2145 If the output routine for a jump insn needs to depend
2146 on the cc status, it should look at cc_prev_status. */
2148 NOTICE_UPDATE_CC (body, insn);
2153 /* If the proper template needs to be chosen by some C code,
2154 run that code and get the real template. */
2156 template = insn_template[insn_code_number];
2159 template = (*insn_outfun[insn_code_number]) (recog_operand, insn);
2161 /* If the C code returns 0, it means that it is a jump insn
2162 which follows a deleted test insn, and that test insn
2163 needs to be reinserted. */
2166 if (prev_nonnote_insn (insn) != last_ignored_compare)
2169 return prev_nonnote_insn (insn);
2173 /* If the template is the string "#", it means that this insn must
2175 if (template[0] == '#' && template[1] == '\0')
2177 rtx new = try_split (body, insn, 0);
2179 /* If we didn't split the insn, go away. */
2180 if (new == insn && PATTERN (new) == body)
2183 #ifdef HAVE_ATTR_length
2184 /* This instruction should have been split in shorten_branches,
2185 to ensure that we would have valid length info for the
2197 /* Output assembler code from the template. */
2199 output_asm_insn (template, recog_operand);
2201 #if defined (DWARF2_UNWIND_INFO)
2202 #if !defined (ACCUMULATE_OUTGOING_ARGS)
2203 /* If we push arguments, we need to check all insns for stack
2205 if (dwarf2out_do_frame ())
2206 dwarf2out_frame_debug (insn);
2208 #if defined (HAVE_prologue)
2209 /* If this insn is part of the prologue, emit DWARF v2
2211 if (RTX_FRAME_RELATED_P (insn) && dwarf2out_do_frame ())
2212 dwarf2out_frame_debug (insn);
2218 /* It's not at all clear why we did this and doing so interferes
2219 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2222 /* Mark this insn as having been output. */
2223 INSN_DELETED_P (insn) = 1;
2229 return NEXT_INSN (insn);
2232 /* Output debugging info to the assembler file FILE
2233 based on the NOTE-insn INSN, assumed to be a line number. */
2236 output_source_line (file, insn)
2240 register char *filename = NOTE_SOURCE_FILE (insn);
2242 /* Remember filename for basic block profiling.
2243 Filenames are allocated on the permanent obstack
2244 or are passed in ARGV, so we don't have to save
2247 if (profile_block_flag && last_filename != filename)
2248 bb_file_label_num = add_bb_string (filename, TRUE);
2250 last_filename = filename;
2251 last_linenum = NOTE_LINE_NUMBER (insn);
2252 high_block_linenum = MAX (last_linenum, high_block_linenum);
2253 high_function_linenum = MAX (last_linenum, high_function_linenum);
2255 if (write_symbols != NO_DEBUG)
2257 #ifdef SDB_DEBUGGING_INFO
2258 if (write_symbols == SDB_DEBUG
2259 #if 0 /* People like having line numbers even in wrong file! */
2260 /* COFF can't handle multiple source files--lose, lose. */
2261 && !strcmp (filename, main_input_filename)
2263 /* COFF relative line numbers must be positive. */
2264 && last_linenum > sdb_begin_function_line)
2266 #ifdef ASM_OUTPUT_SOURCE_LINE
2267 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
2269 fprintf (file, "\t.ln\t%d\n",
2270 ((sdb_begin_function_line > -1)
2271 ? last_linenum - sdb_begin_function_line : 1));
2276 #if defined (DBX_DEBUGGING_INFO)
2277 if (write_symbols == DBX_DEBUG)
2278 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
2281 #if defined (XCOFF_DEBUGGING_INFO)
2282 if (write_symbols == XCOFF_DEBUG)
2283 xcoffout_source_line (file, filename, insn);
2286 #ifdef DWARF_DEBUGGING_INFO
2287 if (write_symbols == DWARF_DEBUG)
2288 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
2291 #ifdef DWARF2_DEBUGGING_INFO
2292 if (write_symbols == DWARF2_DEBUG)
2293 dwarf2out_line (filename, NOTE_LINE_NUMBER (insn));
2298 /* If X is a SUBREG, replace it with a REG or a MEM,
2299 based on the thing it is a subreg of. */
2305 register rtx y = SUBREG_REG (x);
2306 if (GET_CODE (y) == SUBREG)
2307 y = alter_subreg (y);
2309 if (GET_CODE (y) == REG)
2311 /* If the containing reg really gets a hard reg, so do we. */
2313 REGNO (x) = REGNO (y) + SUBREG_WORD (x);
2315 else if (GET_CODE (y) == MEM)
2317 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
2318 if (BYTES_BIG_ENDIAN)
2319 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
2320 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
2322 MEM_VOLATILE_P (x) = MEM_VOLATILE_P (y);
2323 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
2329 /* Do alter_subreg on all the SUBREGs contained in X. */
2332 walk_alter_subreg (x)
2335 switch (GET_CODE (x))
2339 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
2340 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
2344 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
2348 return alter_subreg (x);
2359 /* Given BODY, the body of a jump instruction, alter the jump condition
2360 as required by the bits that are set in cc_status.flags.
2361 Not all of the bits there can be handled at this level in all cases.
2363 The value is normally 0.
2364 1 means that the condition has become always true.
2365 -1 means that the condition has become always false.
2366 2 means that COND has been altered. */
2374 if (cc_status.flags & CC_REVERSED)
2377 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
2380 if (cc_status.flags & CC_INVERTED)
2383 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
2386 if (cc_status.flags & CC_NOT_POSITIVE)
2387 switch (GET_CODE (cond))
2392 /* Jump becomes unconditional. */
2398 /* Jump becomes no-op. */
2402 PUT_CODE (cond, EQ);
2407 PUT_CODE (cond, NE);
2415 if (cc_status.flags & CC_NOT_NEGATIVE)
2416 switch (GET_CODE (cond))
2420 /* Jump becomes unconditional. */
2425 /* Jump becomes no-op. */
2430 PUT_CODE (cond, EQ);
2436 PUT_CODE (cond, NE);
2444 if (cc_status.flags & CC_NO_OVERFLOW)
2445 switch (GET_CODE (cond))
2448 /* Jump becomes unconditional. */
2452 PUT_CODE (cond, EQ);
2457 PUT_CODE (cond, NE);
2462 /* Jump becomes no-op. */
2469 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
2470 switch (GET_CODE (cond))
2476 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
2481 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
2486 if (cc_status.flags & CC_NOT_SIGNED)
2487 /* The flags are valid if signed condition operators are converted
2489 switch (GET_CODE (cond))
2492 PUT_CODE (cond, LEU);
2497 PUT_CODE (cond, LTU);
2502 PUT_CODE (cond, GTU);
2507 PUT_CODE (cond, GEU);
2519 /* Report inconsistency between the assembler template and the operands.
2520 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
2523 output_operand_lossage (str)
2526 if (this_is_asm_operands)
2527 error_for_asm (this_is_asm_operands, "invalid `asm': %s", str);
2532 /* Output of assembler code from a template, and its subroutines. */
2534 /* Output text from TEMPLATE to the assembler output file,
2535 obeying %-directions to substitute operands taken from
2536 the vector OPERANDS.
2538 %N (for N a digit) means print operand N in usual manner.
2539 %lN means require operand N to be a CODE_LABEL or LABEL_REF
2540 and print the label name with no punctuation.
2541 %cN means require operand N to be a constant
2542 and print the constant expression with no punctuation.
2543 %aN means expect operand N to be a memory address
2544 (not a memory reference!) and print a reference
2546 %nN means expect operand N to be a constant
2547 and print a constant expression for minus the value
2548 of the operand, with no other punctuation. */
2553 if (flag_print_asm_name)
2555 /* Annotate the assembly with a comment describing the pattern and
2556 alternative used. */
2559 register int num = INSN_CODE (debug_insn);
2560 fprintf (asm_out_file, " %s %d %s",
2561 ASM_COMMENT_START, INSN_UID (debug_insn), insn_name[num]);
2562 if (insn_n_alternatives[num] > 1)
2563 fprintf (asm_out_file, "/%d", which_alternative + 1);
2565 /* Clear this so only the first assembler insn
2566 of any rtl insn will get the special comment for -dp. */
2573 output_asm_insn (template, operands)
2580 /* An insn may return a null string template
2581 in a case where no assembler code is needed. */
2586 putc ('\t', asm_out_file);
2588 #ifdef ASM_OUTPUT_OPCODE
2589 ASM_OUTPUT_OPCODE (asm_out_file, p);
2597 putc (c, asm_out_file);
2598 #ifdef ASM_OUTPUT_OPCODE
2599 while ((c = *p) == '\t')
2601 putc (c, asm_out_file);
2604 ASM_OUTPUT_OPCODE (asm_out_file, p);
2608 #ifdef ASSEMBLER_DIALECT
2610 /* If we want the first dialect, do nothing. Otherwise, skip
2611 DIALECT_NUMBER of strings ending with '|'. */
2612 for (i = 0; i < dialect_number; i++)
2614 while (*p && *p++ != '|')
2623 /* Skip to close brace. */
2624 while (*p && *p++ != '}')
2633 /* %% outputs a single %. */
2637 putc (c, asm_out_file);
2639 /* %= outputs a number which is unique to each insn in the entire
2640 compilation. This is useful for making local labels that are
2641 referred to more than once in a given insn. */
2645 fprintf (asm_out_file, "%d", insn_counter);
2647 /* % followed by a letter and some digits
2648 outputs an operand in a special way depending on the letter.
2649 Letters `acln' are implemented directly.
2650 Other letters are passed to `output_operand' so that
2651 the PRINT_OPERAND macro can define them. */
2652 else if ((*p >= 'a' && *p <= 'z')
2653 || (*p >= 'A' && *p <= 'Z'))
2658 if (! (*p >= '0' && *p <= '9'))
2659 output_operand_lossage ("operand number missing after %-letter");
2660 else if (this_is_asm_operands && c >= (unsigned) insn_noperands)
2661 output_operand_lossage ("operand number out of range");
2662 else if (letter == 'l')
2663 output_asm_label (operands[c]);
2664 else if (letter == 'a')
2665 output_address (operands[c]);
2666 else if (letter == 'c')
2668 if (CONSTANT_ADDRESS_P (operands[c]))
2669 output_addr_const (asm_out_file, operands[c]);
2671 output_operand (operands[c], 'c');
2673 else if (letter == 'n')
2675 if (GET_CODE (operands[c]) == CONST_INT)
2676 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
2677 - INTVAL (operands[c]));
2680 putc ('-', asm_out_file);
2681 output_addr_const (asm_out_file, operands[c]);
2685 output_operand (operands[c], letter);
2687 while ((c = *p) >= '0' && c <= '9') p++;
2689 /* % followed by a digit outputs an operand the default way. */
2690 else if (*p >= '0' && *p <= '9')
2693 if (this_is_asm_operands && c >= (unsigned) insn_noperands)
2694 output_operand_lossage ("operand number out of range");
2696 output_operand (operands[c], 0);
2697 while ((c = *p) >= '0' && c <= '9') p++;
2699 /* % followed by punctuation: output something for that
2700 punctuation character alone, with no operand.
2701 The PRINT_OPERAND macro decides what is actually done. */
2702 #ifdef PRINT_OPERAND_PUNCT_VALID_P
2703 else if (PRINT_OPERAND_PUNCT_VALID_P (*p))
2704 output_operand (NULL_RTX, *p++);
2707 output_operand_lossage ("invalid %%-code");
2711 putc (c, asm_out_file);
2716 putc ('\n', asm_out_file);
2719 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
2722 output_asm_label (x)
2727 if (GET_CODE (x) == LABEL_REF)
2728 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
2729 else if (GET_CODE (x) == CODE_LABEL)
2730 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
2732 output_operand_lossage ("`%l' operand isn't a label");
2734 assemble_name (asm_out_file, buf);
2737 /* Print operand X using machine-dependent assembler syntax.
2738 The macro PRINT_OPERAND is defined just to control this function.
2739 CODE is a non-digit that preceded the operand-number in the % spec,
2740 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
2741 between the % and the digits.
2742 When CODE is a non-letter, X is 0.
2744 The meanings of the letters are machine-dependent and controlled
2745 by PRINT_OPERAND. */
2748 output_operand (x, code)
2752 if (x && GET_CODE (x) == SUBREG)
2753 x = alter_subreg (x);
2755 /* If X is a pseudo-register, abort now rather than writing trash to the
2758 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
2761 PRINT_OPERAND (asm_out_file, x, code);
2764 /* Print a memory reference operand for address X
2765 using machine-dependent assembler syntax.
2766 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
2772 walk_alter_subreg (x);
2773 PRINT_OPERAND_ADDRESS (asm_out_file, x);
2776 /* Print an integer constant expression in assembler syntax.
2777 Addition and subtraction are the only arithmetic
2778 that may appear in these expressions. */
2781 output_addr_const (file, x)
2788 switch (GET_CODE (x))
2798 assemble_name (file, XSTR (x, 0));
2802 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
2803 assemble_name (file, buf);
2807 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
2808 assemble_name (file, buf);
2812 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
2816 /* This used to output parentheses around the expression,
2817 but that does not work on the 386 (either ATT or BSD assembler). */
2818 output_addr_const (file, XEXP (x, 0));
2822 if (GET_MODE (x) == VOIDmode)
2824 /* We can use %d if the number is one word and positive. */
2825 if (CONST_DOUBLE_HIGH (x))
2826 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
2827 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
2828 else if (CONST_DOUBLE_LOW (x) < 0)
2829 fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
2831 fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
2834 /* We can't handle floating point constants;
2835 PRINT_OPERAND must handle them. */
2836 output_operand_lossage ("floating constant misused");
2840 /* Some assemblers need integer constants to appear last (eg masm). */
2841 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
2843 output_addr_const (file, XEXP (x, 1));
2844 if (INTVAL (XEXP (x, 0)) >= 0)
2845 fprintf (file, "+");
2846 output_addr_const (file, XEXP (x, 0));
2850 output_addr_const (file, XEXP (x, 0));
2851 if (INTVAL (XEXP (x, 1)) >= 0)
2852 fprintf (file, "+");
2853 output_addr_const (file, XEXP (x, 1));
2858 /* Avoid outputting things like x-x or x+5-x,
2859 since some assemblers can't handle that. */
2860 x = simplify_subtraction (x);
2861 if (GET_CODE (x) != MINUS)
2864 output_addr_const (file, XEXP (x, 0));
2865 fprintf (file, "-");
2866 if (GET_CODE (XEXP (x, 1)) == CONST_INT
2867 && INTVAL (XEXP (x, 1)) < 0)
2869 fprintf (file, ASM_OPEN_PAREN);
2870 output_addr_const (file, XEXP (x, 1));
2871 fprintf (file, ASM_CLOSE_PAREN);
2874 output_addr_const (file, XEXP (x, 1));
2879 output_addr_const (file, XEXP (x, 0));
2883 output_operand_lossage ("invalid expression as operand");
2887 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
2888 %R prints the value of REGISTER_PREFIX.
2889 %L prints the value of LOCAL_LABEL_PREFIX.
2890 %U prints the value of USER_LABEL_PREFIX.
2891 %I prints the value of IMMEDIATE_PREFIX.
2892 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
2893 Also supported are %d, %x, %s, %e, %f, %g and %%.
2895 We handle alternate assembler dialects here, just like output_asm_insn. */
2898 asm_fprintf VPROTO((FILE *file, char *p, ...))
2909 VA_START (argptr, p);
2912 file = va_arg (argptr, FILE *);
2913 p = va_arg (argptr, char *);
2921 #ifdef ASSEMBLER_DIALECT
2923 /* If we want the first dialect, do nothing. Otherwise, skip
2924 DIALECT_NUMBER of strings ending with '|'. */
2925 for (i = 0; i < dialect_number; i++)
2927 while (*p && *p++ != '|')
2936 /* Skip to close brace. */
2937 while (*p && *p++ != '}')
2948 while ((c >= '0' && c <= '9') || c == '.')
2956 fprintf (file, "%%");
2959 case 'd': case 'i': case 'u':
2960 case 'x': case 'p': case 'X':
2964 fprintf (file, buf, va_arg (argptr, int));
2968 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
2969 but we do not check for those cases. It means that the value
2970 is a HOST_WIDE_INT, which may be either `int' or `long'. */
2972 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2974 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
2984 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
2991 fprintf (file, buf, va_arg (argptr, long));
2999 fprintf (file, buf, va_arg (argptr, double));
3005 fprintf (file, buf, va_arg (argptr, char *));
3009 #ifdef ASM_OUTPUT_OPCODE
3010 ASM_OUTPUT_OPCODE (asm_out_file, p);
3015 #ifdef REGISTER_PREFIX
3016 fprintf (file, "%s", REGISTER_PREFIX);
3021 #ifdef IMMEDIATE_PREFIX
3022 fprintf (file, "%s", IMMEDIATE_PREFIX);
3027 #ifdef LOCAL_LABEL_PREFIX
3028 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
3033 #ifdef USER_LABEL_PREFIX
3034 fprintf (file, "%s", USER_LABEL_PREFIX);
3048 /* Split up a CONST_DOUBLE or integer constant rtx
3049 into two rtx's for single words,
3050 storing in *FIRST the word that comes first in memory in the target
3051 and in *SECOND the other. */
3054 split_double (value, first, second)
3056 rtx *first, *second;
3058 if (GET_CODE (value) == CONST_INT)
3060 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3062 /* In this case the CONST_INT holds both target words.
3063 Extract the bits from it into two word-sized pieces. */
3065 HOST_WIDE_INT word_mask;
3066 /* Avoid warnings for shift count >= BITS_PER_WORD. */
3067 int shift_count = BITS_PER_WORD - 1;
3069 word_mask = (HOST_WIDE_INT) 1 << shift_count;
3070 word_mask |= word_mask - 1;
3071 low = GEN_INT (INTVAL (value) & word_mask);
3072 high = GEN_INT ((INTVAL (value) >> (shift_count + 1)) & word_mask);
3073 if (WORDS_BIG_ENDIAN)
3086 /* The rule for using CONST_INT for a wider mode
3087 is that we regard the value as signed.
3088 So sign-extend it. */
3089 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
3090 if (WORDS_BIG_ENDIAN)
3102 else if (GET_CODE (value) != CONST_DOUBLE)
3104 if (WORDS_BIG_ENDIAN)
3106 *first = const0_rtx;
3112 *second = const0_rtx;
3115 else if (GET_MODE (value) == VOIDmode
3116 /* This is the old way we did CONST_DOUBLE integers. */
3117 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
3119 /* In an integer, the words are defined as most and least significant.
3120 So order them by the target's convention. */
3121 if (WORDS_BIG_ENDIAN)
3123 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3124 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3128 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3129 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3134 #ifdef REAL_ARITHMETIC
3135 REAL_VALUE_TYPE r; long l[2];
3136 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
3138 /* Note, this converts the REAL_VALUE_TYPE to the target's
3139 format, splits up the floating point double and outputs
3140 exactly 32 bits of it into each of l[0] and l[1] --
3141 not necessarily BITS_PER_WORD bits. */
3142 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
3144 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
3145 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
3147 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
3148 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
3149 && ! flag_pretend_float)
3153 #ifdef HOST_WORDS_BIG_ENDIAN
3160 /* Host and target agree => no need to swap. */
3161 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3162 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3166 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3167 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3169 #endif /* no REAL_ARITHMETIC */
3173 /* Return nonzero if this function has no function calls. */
3180 if (profile_flag || profile_block_flag || profile_arc_flag)
3183 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3185 if (GET_CODE (insn) == CALL_INSN)
3187 if (GET_CODE (insn) == INSN
3188 && GET_CODE (PATTERN (insn)) == SEQUENCE
3189 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN)
3192 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
3194 if (GET_CODE (XEXP (insn, 0)) == CALL_INSN)
3196 if (GET_CODE (XEXP (insn, 0)) == INSN
3197 && GET_CODE (PATTERN (XEXP (insn, 0))) == SEQUENCE
3198 && GET_CODE (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)) == CALL_INSN)
3205 /* On some machines, a function with no call insns
3206 can run faster if it doesn't create its own register window.
3207 When output, the leaf function should use only the "output"
3208 registers. Ordinarily, the function would be compiled to use
3209 the "input" registers to find its arguments; it is a candidate
3210 for leaf treatment if it uses only the "input" registers.
3211 Leaf function treatment means renumbering so the function
3212 uses the "output" registers instead. */
3214 #ifdef LEAF_REGISTERS
3216 static char permitted_reg_in_leaf_functions[] = LEAF_REGISTERS;
3218 /* Return 1 if this function uses only the registers that can be
3219 safely renumbered. */
3222 only_leaf_regs_used ()
3226 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
3228 if ((regs_ever_live[i] || global_regs[i])
3229 && ! permitted_reg_in_leaf_functions[i])
3235 /* Scan all instructions and renumber all registers into those
3236 available in leaf functions. */
3239 leaf_renumber_regs (first)
3244 /* Renumber only the actual patterns.
3245 The reg-notes can contain frame pointer refs,
3246 and renumbering them could crash, and should not be needed. */
3247 for (insn = first; insn; insn = NEXT_INSN (insn))
3248 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
3249 leaf_renumber_regs_insn (PATTERN (insn));
3250 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
3251 if (GET_RTX_CLASS (GET_CODE (XEXP (insn, 0))) == 'i')
3252 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
3255 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
3256 available in leaf functions. */
3259 leaf_renumber_regs_insn (in_rtx)
3260 register rtx in_rtx;
3263 register char *format_ptr;
3268 /* Renumber all input-registers into output-registers.
3269 renumbered_regs would be 1 for an output-register;
3272 if (GET_CODE (in_rtx) == REG)
3276 /* Don't renumber the same reg twice. */
3280 newreg = REGNO (in_rtx);
3281 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
3282 to reach here as part of a REG_NOTE. */
3283 if (newreg >= FIRST_PSEUDO_REGISTER)
3288 newreg = LEAF_REG_REMAP (newreg);
3291 regs_ever_live[REGNO (in_rtx)] = 0;
3292 regs_ever_live[newreg] = 1;
3293 REGNO (in_rtx) = newreg;
3297 if (GET_RTX_CLASS (GET_CODE (in_rtx)) == 'i')
3299 /* Inside a SEQUENCE, we find insns.
3300 Renumber just the patterns of these insns,
3301 just as we do for the top-level insns. */
3302 leaf_renumber_regs_insn (PATTERN (in_rtx));
3306 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
3308 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
3309 switch (*format_ptr++)
3312 leaf_renumber_regs_insn (XEXP (in_rtx, i));
3316 if (NULL != XVEC (in_rtx, i))
3318 for (j = 0; j < XVECLEN (in_rtx, i); j++)
3319 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));