1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-5, 1996 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"
71 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
72 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
73 #if defined (USG) || defined (NO_STAB_H)
74 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
76 #include <stab.h> /* On BSD, use the system's stab.h. */
78 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
80 #ifdef XCOFF_DEBUGGING_INFO
84 /* .stabd code for line number. */
89 /* .stabs code for included file name. */
95 #define INT_TYPE_SIZE BITS_PER_WORD
98 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
99 null default for it to save conditionalization later. */
100 #ifndef CC_STATUS_INIT
101 #define CC_STATUS_INIT
104 /* How to start an assembler comment. */
105 #ifndef ASM_COMMENT_START
106 #define ASM_COMMENT_START ";#"
109 /* Is the given character a logical line separator for the assembler? */
110 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
111 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
114 /* Nonzero means this function is a leaf function, with no function calls.
115 This variable exists to be examined in FUNCTION_PROLOGUE
116 and FUNCTION_EPILOGUE. Always zero, unless set by some action. */
119 /* Last insn processed by final_scan_insn. */
120 static rtx debug_insn = 0;
122 /* Line number of last NOTE. */
123 static int last_linenum;
125 /* Highest line number in current block. */
126 static int high_block_linenum;
128 /* Likewise for function. */
129 static int high_function_linenum;
131 /* Filename of last NOTE. */
132 static char *last_filename;
134 /* Number of basic blocks seen so far;
135 used if profile_block_flag is set. */
136 static int count_basic_blocks;
138 /* Nonzero while outputting an `asm' with operands.
139 This means that inconsistencies are the user's fault, so don't abort.
140 The precise value is the insn being output, to pass to error_for_asm. */
141 static rtx this_is_asm_operands;
143 /* Number of operands of this insn, for an `asm' with operands. */
144 static int insn_noperands;
146 /* Compare optimization flag. */
148 static rtx last_ignored_compare = 0;
150 /* Flag indicating this insn is the start of a new basic block. */
152 static int new_block = 1;
154 /* All the symbol-blocks (levels of scoping) in the compilation
155 are assigned sequence numbers in order of appearance of the
156 beginnings of the symbol-blocks. Both final and dbxout do this,
157 and assume that they will both give the same number to each block.
158 Final uses these sequence numbers to generate assembler label names
159 LBBnnn and LBEnnn for the beginning and end of the symbol-block.
160 Dbxout uses the sequence numbers to generate references to the same labels
161 from the dbx debugging information.
163 Sdb records this level at the beginning of each function,
164 in order to find the current level when recursing down declarations.
165 It outputs the block beginning and endings
166 at the point in the asm file where the blocks would begin and end. */
168 int next_block_index;
170 /* Assign a unique number to each insn that is output.
171 This can be used to generate unique local labels. */
173 static int insn_counter = 0;
176 /* This variable contains machine-dependent flags (defined in tm.h)
177 set and examined by output routines
178 that describe how to interpret the condition codes properly. */
182 /* During output of an insn, this contains a copy of cc_status
183 from before the insn. */
185 CC_STATUS cc_prev_status;
188 /* Indexed by hardware reg number, is 1 if that register is ever
189 used in the current function.
191 In life_analysis, or in stupid_life_analysis, this is set
192 up to record the hard regs used explicitly. Reload adds
193 in the hard regs used for holding pseudo regs. Final uses
194 it to generate the code in the function prologue and epilogue
195 to save and restore registers as needed. */
197 char regs_ever_live[FIRST_PSEUDO_REGISTER];
199 /* Nonzero means current function must be given a frame pointer.
200 Set in stmt.c if anything is allocated on the stack there.
201 Set in reload1.c if anything is allocated on the stack there. */
203 int frame_pointer_needed;
205 /* Assign unique numbers to labels generated for profiling. */
207 int profile_label_no;
209 /* Length so far allocated in PENDING_BLOCKS. */
211 static int max_block_depth;
213 /* Stack of sequence numbers of symbol-blocks of which we have seen the
214 beginning but not yet the end. Sequence numbers are assigned at
215 the beginning; this stack allows us to find the sequence number
216 of a block that is ending. */
218 static int *pending_blocks;
220 /* Number of elements currently in use in PENDING_BLOCKS. */
222 static int block_depth;
224 /* Nonzero if have enabled APP processing of our assembler output. */
228 /* If we are outputting an insn sequence, this contains the sequence rtx.
233 #ifdef ASSEMBLER_DIALECT
235 /* Number of the assembler dialect to use, starting at 0. */
236 static int dialect_number;
239 /* Indexed by line number, nonzero if there is a note for that line. */
241 static char *line_note_exists;
243 /* Linked list to hold line numbers for each basic block. */
246 struct bb_list *next; /* pointer to next basic block */
247 int line_num; /* line number */
248 int file_label_num; /* LPBC<n> label # for stored filename */
249 int func_label_num; /* LPBC<n> label # for stored function name */
252 static struct bb_list *bb_head = 0; /* Head of basic block list */
253 static struct bb_list **bb_tail = &bb_head; /* Ptr to store next bb ptr */
254 static int bb_file_label_num = -1; /* Current label # for file */
255 static int bb_func_label_num = -1; /* Current label # for func */
257 /* Linked list to hold the strings for each file and function name output. */
260 struct bb_str *next; /* pointer to next string */
261 char *string; /* string */
262 int label_num; /* label number */
263 int length; /* string length */
266 extern rtx peephole PROTO((rtx));
268 static struct bb_str *sbb_head = 0; /* Head of string list. */
269 static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */
270 static int sbb_label_num = 0; /* Last label used */
272 static int asm_insn_count PROTO((rtx));
273 static void profile_function PROTO((FILE *));
274 static void profile_after_prologue PROTO((FILE *));
275 static void add_bb PROTO((FILE *));
276 static int add_bb_string PROTO((char *, int));
277 static void output_source_line PROTO((FILE *, rtx));
278 static rtx walk_alter_subreg PROTO((rtx));
279 static int alter_cond PROTO((rtx));
280 static void output_asm_name PROTO((void));
281 static void output_operand PROTO((rtx, int));
282 static void leaf_renumber_regs PROTO((rtx));
284 extern char *getpwd ();
286 /* Initialize data in final at the beginning of a compilation. */
289 init_final (filename)
292 next_block_index = 2;
294 max_block_depth = 20;
295 pending_blocks = (int *) xmalloc (20 * sizeof *pending_blocks);
298 #ifdef ASSEMBLER_DIALECT
299 dialect_number = ASSEMBLER_DIALECT;
303 /* Called at end of source file,
304 to output the block-profiling table for this entire compilation. */
312 if (profile_block_flag)
315 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
316 int size = (POINTER_SIZE / BITS_PER_UNIT) * count_basic_blocks;
321 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
322 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
323 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
327 /* Output the main header, of 11 words:
328 0: 1 if this file is initialized, else 0.
329 1: address of file name (LPBX1).
330 2: address of table of counts (LPBX2).
331 3: number of counts in the table.
332 4: always 0, for compatibility with Sun.
334 The following are GNU extensions:
336 5: address of table of start addrs of basic blocks (LPBX3).
337 6: Number of bytes in this header.
338 7: address of table of function names (LPBX4).
339 8: address of table of line numbers (LPBX5) or 0.
340 9: address of table of file names (LPBX6) or 0.
341 10: space reserved for basic block profiling. */
343 ASM_OUTPUT_ALIGN (asm_out_file, align);
345 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
347 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
349 /* address of filename */
350 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
351 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
353 /* address of count table */
354 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
355 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
357 /* count of the # of basic blocks */
358 assemble_integer (GEN_INT (count_basic_blocks), UNITS_PER_WORD, 1);
360 /* zero word (link field) */
361 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
363 /* address of basic block start address table */
364 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
365 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
367 /* byte count for extended structure. */
368 assemble_integer (GEN_INT (11 * UNITS_PER_WORD), UNITS_PER_WORD, 1);
370 /* address of function name table */
371 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
372 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
374 /* address of line number and filename tables if debugging. */
375 if (write_symbols != NO_DEBUG)
377 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
378 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
379 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
380 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
384 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
385 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
388 /* space for extension ptr (link field) */
389 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
391 /* Output the file name changing the suffix to .d for Sun tcov
393 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
395 char *cwd = getpwd ();
396 int len = strlen (filename) + strlen (cwd) + 1;
397 char *data_file = (char *) alloca (len + 4);
399 strcpy (data_file, cwd);
400 strcat (data_file, "/");
401 strcat (data_file, filename);
402 strip_off_ending (data_file, len);
403 strcat (data_file, ".d");
404 assemble_string (data_file, strlen (data_file) + 1);
407 /* Make space for the table of counts. */
410 /* Realign data section. */
411 ASM_OUTPUT_ALIGN (asm_out_file, align);
412 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
414 assemble_zeros (size);
418 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
419 #ifdef ASM_OUTPUT_SHARED_LOCAL
420 if (flag_shared_data)
421 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
424 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
425 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
428 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
432 /* Output any basic block strings */
433 readonly_data_section ();
436 ASM_OUTPUT_ALIGN (asm_out_file, align);
437 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
439 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC", sptr->label_num);
440 assemble_string (sptr->string, sptr->length);
444 /* Output the table of addresses. */
445 /* Realign in new section */
446 ASM_OUTPUT_ALIGN (asm_out_file, align);
447 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
448 for (i = 0; i < count_basic_blocks; i++)
450 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
451 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name),
455 /* Output the table of function names. */
456 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
457 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
459 if (ptr->func_label_num >= 0)
461 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC", ptr->func_label_num);
462 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name),
466 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
469 for ( ; i < count_basic_blocks; i++)
470 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
472 if (write_symbols != NO_DEBUG)
474 /* Output the table of line numbers. */
475 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
476 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
477 assemble_integer (GEN_INT (ptr->line_num), UNITS_PER_WORD, 1);
479 for ( ; i < count_basic_blocks; i++)
480 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
482 /* Output the table of file names. */
483 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
484 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
486 if (ptr->file_label_num >= 0)
488 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC", ptr->file_label_num);
489 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name),
493 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
496 for ( ; i < count_basic_blocks; i++)
497 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
500 /* End with the address of the table of addresses,
501 so we can find it easily, as the last word in the file's text. */
502 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
503 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
507 /* Enable APP processing of subsequent output.
508 Used before the output from an `asm' statement. */
515 fprintf (asm_out_file, ASM_APP_ON);
520 /* Disable APP processing of subsequent output.
521 Called from varasm.c before most kinds of output. */
528 fprintf (asm_out_file, ASM_APP_OFF);
533 /* Return the number of slots filled in the current
534 delayed branch sequence (we don't count the insn needing the
535 delay slot). Zero if not in a delayed branch sequence. */
539 dbr_sequence_length ()
541 if (final_sequence != 0)
542 return XVECLEN (final_sequence, 0) - 1;
548 /* The next two pages contain routines used to compute the length of an insn
549 and to shorten branches. */
551 /* Arrays for insn lengths, and addresses. The latter is referenced by
552 `insn_current_length'. */
554 static short *insn_lengths;
557 /* Address of insn being processed. Used by `insn_current_length'. */
558 int insn_current_address;
560 /* Indicate that branch shortening hasn't yet been done. */
568 /* Obtain the current length of an insn. If branch shortening has been done,
569 get its actual length. Otherwise, get its maximum length. */
572 get_attr_length (insn)
575 #ifdef HAVE_ATTR_length
581 return insn_lengths[INSN_UID (insn)];
583 switch (GET_CODE (insn))
591 length = insn_default_length (insn);
595 body = PATTERN (insn);
596 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
598 /* This only takes room if jump tables go into the text section. */
599 #if !defined(READONLY_DATA_SECTION) || defined(JUMP_TABLES_IN_TEXT_SECTION)
600 length = (XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC)
601 * GET_MODE_SIZE (GET_MODE (body)));
603 /* Be pessimistic and assume worst-case alignment. */
604 length += (GET_MODE_SIZE (GET_MODE (body)) - 1);
610 length = insn_default_length (insn);
614 body = PATTERN (insn);
615 if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
618 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
619 length = asm_insn_count (body) * insn_default_length (insn);
620 else if (GET_CODE (body) == SEQUENCE)
621 for (i = 0; i < XVECLEN (body, 0); i++)
622 length += get_attr_length (XVECEXP (body, 0, i));
624 length = insn_default_length (insn);
627 #ifdef ADJUST_INSN_LENGTH
628 ADJUST_INSN_LENGTH (insn, length);
631 #else /* not HAVE_ATTR_length */
633 #endif /* not HAVE_ATTR_length */
636 /* Make a pass over all insns and compute their actual lengths by shortening
637 any branches of variable length if possible. */
639 /* Give a default value for the lowest address in a function. */
641 #ifndef FIRST_INSN_ADDRESS
642 #define FIRST_INSN_ADDRESS 0
646 shorten_branches (first)
649 #ifdef HAVE_ATTR_length
651 int something_changed = 1;
653 char *varying_length;
657 /* Compute maximum UID and allocate arrays. */
658 for (insn = first; insn; insn = NEXT_INSN (insn))
659 if (INSN_UID (insn) > max_uid)
660 max_uid = INSN_UID (insn);
663 insn_lengths = (short *) oballoc (max_uid * sizeof (short));
664 insn_addresses = (int *) oballoc (max_uid * sizeof (int));
665 varying_length = (char *) oballoc (max_uid * sizeof (char));
667 /* Compute initial lengths, addresses, and varying flags for each insn. */
668 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
670 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
672 uid = INSN_UID (insn);
673 insn_addresses[uid] = insn_current_address;
674 insn_lengths[uid] = 0;
675 varying_length[uid] = 0;
677 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
678 || GET_CODE (insn) == CODE_LABEL)
681 body = PATTERN (insn);
682 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
684 /* This only takes room if read-only data goes into the text
686 #if !defined(READONLY_DATA_SECTION) || defined(JUMP_TABLES_IN_TEXT_SECTION)
687 int unitsize = GET_MODE_SIZE (GET_MODE (body));
689 insn_lengths[uid] = (XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC)
690 * GET_MODE_SIZE (GET_MODE (body)));
692 /* Account for possible alignment. */
694 += unitsize - (insn_current_address & (unitsize - 1));
699 else if (asm_noperands (body) >= 0)
700 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
701 else if (GET_CODE (body) == SEQUENCE)
704 int const_delay_slots;
706 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
708 const_delay_slots = 0;
710 /* Inside a delay slot sequence, we do not do any branch shortening
711 if the shortening could change the number of delay slots
713 for (i = 0; i < XVECLEN (body, 0); i++)
715 rtx inner_insn = XVECEXP (body, 0, i);
716 int inner_uid = INSN_UID (inner_insn);
719 if (asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
720 inner_length = (asm_insn_count (PATTERN (inner_insn))
721 * insn_default_length (inner_insn));
723 inner_length = insn_default_length (inner_insn);
725 insn_lengths[inner_uid] = inner_length;
726 if (const_delay_slots)
728 if ((varying_length[inner_uid]
729 = insn_variable_length_p (inner_insn)) != 0)
730 varying_length[uid] = 1;
731 insn_addresses[inner_uid] = (insn_current_address +
735 varying_length[inner_uid] = 0;
736 insn_lengths[uid] += inner_length;
739 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
741 insn_lengths[uid] = insn_default_length (insn);
742 varying_length[uid] = insn_variable_length_p (insn);
745 /* If needed, do any adjustment. */
746 #ifdef ADJUST_INSN_LENGTH
747 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
751 /* Now loop over all the insns finding varying length insns. For each,
752 get the current insn length. If it has changed, reflect the change.
753 When nothing changes for a full pass, we are done. */
755 while (something_changed)
757 something_changed = 0;
758 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
760 insn = NEXT_INSN (insn))
765 uid = INSN_UID (insn);
766 insn_addresses[uid] = insn_current_address;
767 if (! varying_length[uid])
769 insn_current_address += insn_lengths[uid];
772 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
776 body = PATTERN (insn);
778 for (i = 0; i < XVECLEN (body, 0); i++)
780 rtx inner_insn = XVECEXP (body, 0, i);
781 int inner_uid = INSN_UID (inner_insn);
784 insn_addresses[inner_uid] = insn_current_address;
786 /* insn_current_length returns 0 for insns with a
787 non-varying length. */
788 if (! varying_length[inner_uid])
789 inner_length = insn_lengths[inner_uid];
791 inner_length = insn_current_length (inner_insn);
793 if (inner_length != insn_lengths[inner_uid])
795 insn_lengths[inner_uid] = inner_length;
796 something_changed = 1;
798 insn_current_address += insn_lengths[inner_uid];
799 new_length += inner_length;
804 new_length = insn_current_length (insn);
805 insn_current_address += new_length;
808 #ifdef SHORTEN_WITH_ADJUST_INSN_LENGTH
809 #ifdef ADJUST_INSN_LENGTH
810 /* If needed, do any adjustment. */
811 tmp_length = new_length;
812 ADJUST_INSN_LENGTH (insn, new_length);
813 insn_current_address += (new_length - tmp_length);
817 if (new_length != insn_lengths[uid])
819 insn_lengths[uid] = new_length;
820 something_changed = 1;
823 /* For a non-optimizing compile, do only a single pass. */
827 #endif /* HAVE_ATTR_length */
830 #ifdef HAVE_ATTR_length
831 /* Given the body of an INSN known to be generated by an ASM statement, return
832 the number of machine instructions likely to be generated for this insn.
833 This is used to compute its length. */
836 asm_insn_count (body)
842 if (GET_CODE (body) == ASM_INPUT)
843 template = XSTR (body, 0);
845 template = decode_asm_operands (body, NULL_PTR, NULL_PTR,
848 for ( ; *template; template++)
849 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
856 /* Output assembler code for the start of a function,
857 and initialize some of the variables in this file
858 for the new function. The label for the function and associated
859 assembler pseudo-ops have already been output in `assemble_start_function'.
861 FIRST is the first insn of the rtl for the function being compiled.
862 FILE is the file to write assembler code to.
863 OPTIMIZE is nonzero if we should eliminate redundant
864 test and compare insns. */
867 final_start_function (first, file, optimize)
874 this_is_asm_operands = 0;
876 #ifdef NON_SAVING_SETJMP
877 /* A function that calls setjmp should save and restore all the
878 call-saved registers on a system where longjmp clobbers them. */
879 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
883 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
884 if (!call_used_regs[i] && !call_fixed_regs[i])
885 regs_ever_live[i] = 1;
889 /* Initial line number is supposed to be output
890 before the function's prologue and label
891 so that the function's address will not appear to be
892 in the last statement of the preceding function. */
893 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
894 last_linenum = high_block_linenum = high_function_linenum
895 = NOTE_LINE_NUMBER (first);
897 /* For SDB and XCOFF, the function beginning must be marked between
898 the function label and the prologue. We always need this, even when
899 -g1 was used. Defer on MIPS systems so that parameter descriptions
900 follow function entry. */
901 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
902 if (write_symbols == SDB_DEBUG)
903 sdbout_begin_function (last_linenum);
906 #ifdef XCOFF_DEBUGGING_INFO
907 if (write_symbols == XCOFF_DEBUG)
908 xcoffout_begin_function (file, last_linenum);
911 /* But only output line number for other debug info types if -g2
913 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
914 output_source_line (file, first);
916 #ifdef LEAF_REG_REMAP
918 leaf_renumber_regs (first);
921 /* The Sun386i and perhaps other machines don't work right
922 if the profiling code comes after the prologue. */
923 #ifdef PROFILE_BEFORE_PROLOGUE
925 profile_function (file);
926 #endif /* PROFILE_BEFORE_PROLOGUE */
928 #ifdef FUNCTION_PROLOGUE
929 /* First output the function prologue: code to set up the stack frame. */
930 FUNCTION_PROLOGUE (file, get_frame_size ());
933 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
934 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
935 next_block_index = 1;
938 /* If the machine represents the prologue as RTL, the profiling code must
939 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
943 profile_after_prologue (file);
947 /* If we are doing basic block profiling, remember a printable version
948 of the function name. */
949 if (profile_block_flag)
951 char *junk = "function";
953 add_bb_string ((*decl_printable_name) (current_function_decl, &junk), FALSE);
958 profile_after_prologue (file)
961 #ifdef FUNCTION_BLOCK_PROFILER
962 if (profile_block_flag)
964 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
966 #endif /* FUNCTION_BLOCK_PROFILER */
968 #ifndef PROFILE_BEFORE_PROLOGUE
970 profile_function (file);
971 #endif /* not PROFILE_BEFORE_PROLOGUE */
975 profile_function (file)
978 int align = MIN (BIGGEST_ALIGNMENT, POINTER_SIZE);
979 int sval = current_function_returns_struct;
980 int cxt = current_function_needs_context;
983 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
984 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
985 assemble_integer (const0_rtx, POINTER_SIZE / BITS_PER_UNIT, 1);
989 #ifdef STRUCT_VALUE_INCOMING_REGNUM
991 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
993 #ifdef STRUCT_VALUE_REGNUM
995 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1000 #ifdef STATIC_CHAIN_INCOMING_REGNUM
1002 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1004 #ifdef STATIC_CHAIN_REGNUM
1006 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1011 FUNCTION_PROFILER (file, profile_label_no);
1014 #ifdef STATIC_CHAIN_INCOMING_REGNUM
1016 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1018 #ifdef STATIC_CHAIN_REGNUM
1020 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1025 #ifdef STRUCT_VALUE_INCOMING_REGNUM
1027 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1029 #ifdef STRUCT_VALUE_REGNUM
1031 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1036 /* Output assembler code for the end of a function.
1037 For clarity, args are same as those of `final_start_function'
1038 even though not all of them are needed. */
1041 final_end_function (first, file, optimize)
1048 fprintf (file, ASM_APP_OFF);
1052 #ifdef SDB_DEBUGGING_INFO
1053 if (write_symbols == SDB_DEBUG)
1054 sdbout_end_function (high_function_linenum);
1057 #ifdef DWARF_DEBUGGING_INFO
1058 if (write_symbols == DWARF_DEBUG)
1059 dwarfout_end_function ();
1062 #ifdef XCOFF_DEBUGGING_INFO
1063 if (write_symbols == XCOFF_DEBUG)
1064 xcoffout_end_function (file, high_function_linenum);
1067 #ifdef FUNCTION_EPILOGUE
1068 /* Finally, output the function epilogue:
1069 code to restore the stack frame and return to the caller. */
1070 FUNCTION_EPILOGUE (file, get_frame_size ());
1073 #ifdef SDB_DEBUGGING_INFO
1074 if (write_symbols == SDB_DEBUG)
1075 sdbout_end_epilogue ();
1078 #ifdef DWARF_DEBUGGING_INFO
1079 if (write_symbols == DWARF_DEBUG)
1080 dwarfout_end_epilogue ();
1083 #ifdef XCOFF_DEBUGGING_INFO
1084 if (write_symbols == XCOFF_DEBUG)
1085 xcoffout_end_epilogue (file);
1088 bb_func_label_num = -1; /* not in function, nuke label # */
1090 /* If FUNCTION_EPILOGUE is not defined, then the function body
1091 itself contains return instructions wherever needed. */
1094 /* Add a block to the linked list that remembers the current line/file/function
1095 for basic block profiling. Emit the label in front of the basic block and
1096 the instructions that increment the count field. */
1102 struct bb_list *ptr = (struct bb_list *) permalloc (sizeof (struct bb_list));
1104 /* Add basic block to linked list. */
1106 ptr->line_num = last_linenum;
1107 ptr->file_label_num = bb_file_label_num;
1108 ptr->func_label_num = bb_func_label_num;
1110 bb_tail = &ptr->next;
1112 /* Enable the table of basic-block use counts
1113 to point at the code it applies to. */
1114 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1116 /* Before first insn of this basic block, increment the
1117 count of times it was entered. */
1118 #ifdef BLOCK_PROFILER
1119 BLOCK_PROFILER (file, count_basic_blocks);
1124 count_basic_blocks++;
1127 /* Add a string to be used for basic block profiling. */
1130 add_bb_string (string, perm_p)
1135 struct bb_str *ptr = 0;
1139 string = "<unknown>";
1143 /* Allocate a new string if the current string isn't permanent. If
1144 the string is permanent search for the same string in other
1147 len = strlen (string) + 1;
1150 char *p = (char *) permalloc (len);
1151 bcopy (string, p, len);
1155 for (ptr = sbb_head; ptr != (struct bb_str *)0; ptr = ptr->next)
1156 if (ptr->string == string)
1159 /* Allocate a new string block if we need to. */
1162 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1165 ptr->label_num = sbb_label_num++;
1166 ptr->string = string;
1168 sbb_tail = &ptr->next;
1171 return ptr->label_num;
1175 /* Output assembler code for some insns: all or part of a function.
1176 For description of args, see `final_start_function', above.
1178 PRESCAN is 1 if we are not really outputting,
1179 just scanning as if we were outputting.
1180 Prescanning deletes and rearranges insns just like ordinary output.
1181 PRESCAN is -2 if we are outputting after having prescanned.
1182 In this case, don't try to delete or rearrange insns
1183 because that has already been done.
1184 Prescanning is done only on certain machines. */
1187 final (first, file, optimize, prescan)
1196 last_ignored_compare = 0;
1199 /* Make a map indicating which line numbers appear in this function.
1200 When producing SDB debugging info, delete troublesome line number
1201 notes from inlined functions in other files as well as duplicate
1202 line number notes. */
1203 #ifdef SDB_DEBUGGING_INFO
1204 if (write_symbols == SDB_DEBUG)
1207 for (insn = first; insn; insn = NEXT_INSN (insn))
1208 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1210 if ((RTX_INTEGRATED_P (insn)
1211 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1213 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1214 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1216 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1217 NOTE_SOURCE_FILE (insn) = 0;
1221 if (NOTE_LINE_NUMBER (insn) > max_line)
1222 max_line = NOTE_LINE_NUMBER (insn);
1228 for (insn = first; insn; insn = NEXT_INSN (insn))
1229 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1230 max_line = NOTE_LINE_NUMBER (insn);
1233 line_note_exists = (char *) oballoc (max_line + 1);
1234 bzero (line_note_exists, max_line + 1);
1236 for (insn = first; insn; insn = NEXT_INSN (insn))
1237 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1238 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
1244 /* Output the insns. */
1245 for (insn = NEXT_INSN (first); insn;)
1246 insn = final_scan_insn (insn, file, optimize, prescan, 0);
1248 /* Do basic-block profiling here
1249 if the last insn was a conditional branch. */
1250 if (profile_block_flag && new_block)
1254 /* The final scan for one insn, INSN.
1255 Args are same as in `final', except that INSN
1256 is the insn being scanned.
1257 Value returned is the next insn to be scanned.
1259 NOPEEPHOLES is the flag to disallow peephole processing (currently
1260 used for within delayed branch sequence output). */
1263 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
1273 /* Ignore deleted insns. These can occur when we split insns (due to a
1274 template of "#") while not optimizing. */
1275 if (INSN_DELETED_P (insn))
1276 return NEXT_INSN (insn);
1278 switch (GET_CODE (insn))
1284 /* Align the beginning of a loop, for higher speed
1285 on certain machines. */
1287 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG && optimize > 0)
1289 #ifdef ASM_OUTPUT_LOOP_ALIGN
1290 rtx next = next_nonnote_insn (insn);
1291 if (next && GET_CODE (next) == CODE_LABEL)
1293 ASM_OUTPUT_LOOP_ALIGN (asm_out_file);
1298 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END)
1301 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
1303 #ifdef FUNCTION_END_PROLOGUE
1304 FUNCTION_END_PROLOGUE (file);
1306 profile_after_prologue (file);
1310 #ifdef FUNCTION_BEGIN_EPILOGUE
1311 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
1313 FUNCTION_BEGIN_EPILOGUE (file);
1318 if (write_symbols == NO_DEBUG)
1320 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
1322 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
1323 /* MIPS stabs require the parameter descriptions to be after the
1324 function entry point rather than before. */
1325 if (write_symbols == SDB_DEBUG)
1326 sdbout_begin_function (last_linenum);
1329 #ifdef DWARF_DEBUGGING_INFO
1330 /* This outputs a marker where the function body starts, so it
1331 must be after the prologue. */
1332 if (write_symbols == DWARF_DEBUG)
1333 dwarfout_begin_function ();
1337 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED)
1338 break; /* An insn that was "deleted" */
1341 fprintf (file, ASM_APP_OFF);
1344 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG
1345 && (debug_info_level == DINFO_LEVEL_NORMAL
1346 || debug_info_level == DINFO_LEVEL_VERBOSE
1347 #ifdef DWARF_DEBUGGING_INFO
1348 || write_symbols == DWARF_DEBUG
1353 /* Beginning of a symbol-block. Assign it a sequence number
1354 and push the number onto the stack PENDING_BLOCKS. */
1356 if (block_depth == max_block_depth)
1358 /* PENDING_BLOCKS is full; make it longer. */
1359 max_block_depth *= 2;
1361 = (int *) xrealloc (pending_blocks,
1362 max_block_depth * sizeof (int));
1364 pending_blocks[block_depth++] = next_block_index;
1366 high_block_linenum = last_linenum;
1368 /* Output debugging info about the symbol-block beginning. */
1370 #ifdef SDB_DEBUGGING_INFO
1371 if (write_symbols == SDB_DEBUG)
1372 sdbout_begin_block (file, last_linenum, next_block_index);
1374 #ifdef XCOFF_DEBUGGING_INFO
1375 if (write_symbols == XCOFF_DEBUG)
1376 xcoffout_begin_block (file, last_linenum, next_block_index);
1378 #ifdef DBX_DEBUGGING_INFO
1379 if (write_symbols == DBX_DEBUG)
1380 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", next_block_index);
1382 #ifdef DWARF_DEBUGGING_INFO
1383 if (write_symbols == DWARF_DEBUG && block_depth > 1)
1384 dwarfout_begin_block (next_block_index);
1389 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END
1390 && (debug_info_level == DINFO_LEVEL_NORMAL
1391 || debug_info_level == DINFO_LEVEL_VERBOSE
1392 #ifdef DWARF_DEBUGGING_INFO
1393 || write_symbols == DWARF_DEBUG
1398 /* End of a symbol-block. Pop its sequence number off
1399 PENDING_BLOCKS and output debugging info based on that. */
1403 #ifdef XCOFF_DEBUGGING_INFO
1404 if (write_symbols == XCOFF_DEBUG && block_depth >= 0)
1405 xcoffout_end_block (file, high_block_linenum,
1406 pending_blocks[block_depth]);
1408 #ifdef DBX_DEBUGGING_INFO
1409 if (write_symbols == DBX_DEBUG && block_depth >= 0)
1410 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE",
1411 pending_blocks[block_depth]);
1413 #ifdef SDB_DEBUGGING_INFO
1414 if (write_symbols == SDB_DEBUG && block_depth >= 0)
1415 sdbout_end_block (file, high_block_linenum,
1416 pending_blocks[block_depth]);
1418 #ifdef DWARF_DEBUGGING_INFO
1419 if (write_symbols == DWARF_DEBUG && block_depth >= 1)
1420 dwarfout_end_block (pending_blocks[block_depth]);
1423 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL
1424 && (debug_info_level == DINFO_LEVEL_NORMAL
1425 || debug_info_level == DINFO_LEVEL_VERBOSE))
1427 #ifdef DWARF_DEBUGGING_INFO
1428 if (write_symbols == DWARF_DEBUG)
1429 dwarfout_label (insn);
1432 else if (NOTE_LINE_NUMBER (insn) > 0)
1433 /* This note is a line-number. */
1437 #if 0 /* This is what we used to do. */
1438 output_source_line (file, insn);
1442 /* If there is anything real after this note,
1443 output it. If another line note follows, omit this one. */
1444 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
1446 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
1448 /* These types of notes can be significant
1449 so make sure the preceding line number stays. */
1450 else if (GET_CODE (note) == NOTE
1451 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
1452 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
1453 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
1455 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
1457 /* Another line note follows; we can delete this note
1458 if no intervening line numbers have notes elsewhere. */
1460 for (num = NOTE_LINE_NUMBER (insn) + 1;
1461 num < NOTE_LINE_NUMBER (note);
1463 if (line_note_exists[num])
1466 if (num >= NOTE_LINE_NUMBER (note))
1472 /* Output this line note
1473 if it is the first or the last line note in a row. */
1475 output_source_line (file, insn);
1480 #ifdef ASM_OUTPUT_ALIGN_CODE
1481 /* Don't litter the assembler output with needless alignments. A
1482 BARRIER will be placed at the end of every function if HAVE_epilogue
1484 if (NEXT_INSN (insn))
1485 ASM_OUTPUT_ALIGN_CODE (file);
1495 #ifdef FINAL_PRESCAN_LABEL
1496 FINAL_PRESCAN_INSN (insn, NULL_PTR, 0);
1499 #ifdef SDB_DEBUGGING_INFO
1500 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
1501 sdbout_label (insn);
1503 #ifdef DWARF_DEBUGGING_INFO
1504 if (write_symbols == DWARF_DEBUG && LABEL_NAME (insn))
1505 dwarfout_label (insn);
1509 fprintf (file, ASM_APP_OFF);
1512 if (NEXT_INSN (insn) != 0
1513 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
1515 rtx nextbody = PATTERN (NEXT_INSN (insn));
1517 /* If this label is followed by a jump-table,
1518 make sure we put the label in the read-only section. Also
1519 possibly write the label and jump table together. */
1521 if (GET_CODE (nextbody) == ADDR_VEC
1522 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1524 #ifndef JUMP_TABLES_IN_TEXT_SECTION
1525 readonly_data_section ();
1526 #ifdef READONLY_DATA_SECTION
1527 ASM_OUTPUT_ALIGN (file,
1528 exact_log2 (BIGGEST_ALIGNMENT
1530 #endif /* READONLY_DATA_SECTION */
1531 #else /* JUMP_TABLES_IN_TEXT_SECTION */
1532 function_section (current_function_decl);
1533 #endif /* JUMP_TABLES_IN_TEXT_SECTION */
1534 #ifdef ASM_OUTPUT_CASE_LABEL
1535 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
1538 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
1544 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
1549 register rtx body = PATTERN (insn);
1550 int insn_code_number;
1554 /* An INSN, JUMP_INSN or CALL_INSN.
1555 First check for special kinds that recog doesn't recognize. */
1557 if (GET_CODE (body) == USE /* These are just declarations */
1558 || GET_CODE (body) == CLOBBER)
1562 /* If there is a REG_CC_SETTER note on this insn, it means that
1563 the setting of the condition code was done in the delay slot
1564 of the insn that branched here. So recover the cc status
1565 from the insn that set it. */
1567 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
1570 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
1571 cc_prev_status = cc_status;
1575 /* Detect insns that are really jump-tables
1576 and output them as such. */
1578 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1580 register int vlen, idx;
1587 fprintf (file, ASM_APP_OFF);
1591 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
1592 for (idx = 0; idx < vlen; idx++)
1594 if (GET_CODE (body) == ADDR_VEC)
1596 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
1597 ASM_OUTPUT_ADDR_VEC_ELT
1598 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
1605 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
1606 ASM_OUTPUT_ADDR_DIFF_ELT
1608 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
1609 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
1615 #ifdef ASM_OUTPUT_CASE_END
1616 ASM_OUTPUT_CASE_END (file,
1617 CODE_LABEL_NUMBER (PREV_INSN (insn)),
1621 function_section (current_function_decl);
1626 /* Do basic-block profiling when we reach a new block.
1627 Done here to avoid jump tables. */
1628 if (profile_block_flag && new_block)
1631 if (GET_CODE (body) == ASM_INPUT)
1633 /* There's no telling what that did to the condition codes. */
1639 fprintf (file, ASM_APP_ON);
1642 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
1646 /* Detect `asm' construct with operands. */
1647 if (asm_noperands (body) >= 0)
1649 int noperands = asm_noperands (body);
1650 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
1653 /* There's no telling what that did to the condition codes. */
1660 fprintf (file, ASM_APP_ON);
1664 /* Get out the operand values. */
1665 string = decode_asm_operands (body, ops, NULL_PTR,
1666 NULL_PTR, NULL_PTR);
1667 /* Inhibit aborts on what would otherwise be compiler bugs. */
1668 insn_noperands = noperands;
1669 this_is_asm_operands = insn;
1671 /* Output the insn using them. */
1672 output_asm_insn (string, ops);
1673 this_is_asm_operands = 0;
1677 if (prescan <= 0 && app_on)
1679 fprintf (file, ASM_APP_OFF);
1683 if (GET_CODE (body) == SEQUENCE)
1685 /* A delayed-branch sequence */
1691 final_sequence = body;
1693 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
1694 force the restoration of a comparison that was previously
1695 thought unnecessary. If that happens, cancel this sequence
1696 and cause that insn to be restored. */
1698 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
1699 if (next != XVECEXP (body, 0, 1))
1705 for (i = 1; i < XVECLEN (body, 0); i++)
1707 rtx insn = XVECEXP (body, 0, i);
1708 rtx next = NEXT_INSN (insn);
1709 /* We loop in case any instruction in a delay slot gets
1712 insn = final_scan_insn (insn, file, 0, prescan, 1);
1713 while (insn != next);
1715 #ifdef DBR_OUTPUT_SEQEND
1716 DBR_OUTPUT_SEQEND (file);
1720 /* If the insn requiring the delay slot was a CALL_INSN, the
1721 insns in the delay slot are actually executed before the
1722 called function. Hence we don't preserve any CC-setting
1723 actions in these insns and the CC must be marked as being
1724 clobbered by the function. */
1725 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
1728 /* Following a conditional branch sequence, we have a new basic
1730 if (profile_block_flag)
1732 rtx insn = XVECEXP (body, 0, 0);
1733 rtx body = PATTERN (insn);
1735 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
1736 && GET_CODE (SET_SRC (body)) != LABEL_REF)
1737 || (GET_CODE (insn) == JUMP_INSN
1738 && GET_CODE (body) == PARALLEL
1739 && GET_CODE (XVECEXP (body, 0, 0)) == SET
1740 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
1746 /* We have a real machine instruction as rtl. */
1748 body = PATTERN (insn);
1751 /* Check for redundant test and compare instructions
1752 (when the condition codes are already set up as desired).
1753 This is done only when optimizing; if not optimizing,
1754 it should be possible for the user to alter a variable
1755 with the debugger in between statements
1756 and the next statement should reexamine the variable
1757 to compute the condition codes. */
1761 rtx set = single_set(insn);
1764 && GET_CODE (SET_DEST (set)) == CC0
1765 && insn != last_ignored_compare)
1767 if (GET_CODE (SET_SRC (set)) == SUBREG)
1768 SET_SRC (set) = alter_subreg (SET_SRC (set));
1769 else if (GET_CODE (SET_SRC (set)) == COMPARE)
1771 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
1772 XEXP (SET_SRC (set), 0)
1773 = alter_subreg (XEXP (SET_SRC (set), 0));
1774 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
1775 XEXP (SET_SRC (set), 1)
1776 = alter_subreg (XEXP (SET_SRC (set), 1));
1778 if ((cc_status.value1 != 0
1779 && rtx_equal_p (SET_SRC (set), cc_status.value1))
1780 || (cc_status.value2 != 0
1781 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
1783 /* Don't delete insn if it has an addressing side-effect. */
1784 if (! FIND_REG_INC_NOTE (insn, 0)
1785 /* or if anything in it is volatile. */
1786 && ! volatile_refs_p (PATTERN (insn)))
1788 /* We don't really delete the insn; just ignore it. */
1789 last_ignored_compare = insn;
1797 /* Following a conditional branch, we have a new basic block.
1798 But if we are inside a sequence, the new block starts after the
1799 last insn of the sequence. */
1800 if (profile_block_flag && final_sequence == 0
1801 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
1802 && GET_CODE (SET_SRC (body)) != LABEL_REF)
1803 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
1804 && GET_CODE (XVECEXP (body, 0, 0)) == SET
1805 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
1809 /* Don't bother outputting obvious no-ops, even without -O.
1810 This optimization is fast and doesn't interfere with debugging.
1811 Don't do this if the insn is in a delay slot, since this
1812 will cause an improper number of delay insns to be written. */
1813 if (final_sequence == 0
1815 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
1816 && GET_CODE (SET_SRC (body)) == REG
1817 && GET_CODE (SET_DEST (body)) == REG
1818 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
1823 /* If this is a conditional branch, maybe modify it
1824 if the cc's are in a nonstandard state
1825 so that it accomplishes the same thing that it would
1826 do straightforwardly if the cc's were set up normally. */
1828 if (cc_status.flags != 0
1829 && GET_CODE (insn) == JUMP_INSN
1830 && GET_CODE (body) == SET
1831 && SET_DEST (body) == pc_rtx
1832 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
1833 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
1834 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
1835 /* This is done during prescan; it is not done again
1836 in final scan when prescan has been done. */
1839 /* This function may alter the contents of its argument
1840 and clear some of the cc_status.flags bits.
1841 It may also return 1 meaning condition now always true
1842 or -1 meaning condition now always false
1843 or 2 meaning condition nontrivial but altered. */
1844 register int result = alter_cond (XEXP (SET_SRC (body), 0));
1845 /* If condition now has fixed value, replace the IF_THEN_ELSE
1846 with its then-operand or its else-operand. */
1848 SET_SRC (body) = XEXP (SET_SRC (body), 1);
1850 SET_SRC (body) = XEXP (SET_SRC (body), 2);
1852 /* The jump is now either unconditional or a no-op.
1853 If it has become a no-op, don't try to output it.
1854 (It would not be recognized.) */
1855 if (SET_SRC (body) == pc_rtx)
1857 PUT_CODE (insn, NOTE);
1858 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1859 NOTE_SOURCE_FILE (insn) = 0;
1862 else if (GET_CODE (SET_SRC (body)) == RETURN)
1863 /* Replace (set (pc) (return)) with (return). */
1864 PATTERN (insn) = body = SET_SRC (body);
1866 /* Rerecognize the instruction if it has changed. */
1868 INSN_CODE (insn) = -1;
1871 /* Make same adjustments to instructions that examine the
1872 condition codes without jumping and instructions that
1873 handle conditional moves (if this machine has either one). */
1875 if (cc_status.flags != 0
1876 && GET_CODE (body) == SET)
1878 rtx cond_rtx, then_rtx, else_rtx;
1880 if (GET_CODE (insn) != JUMP_INSN
1881 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE)
1883 cond_rtx = XEXP (SET_SRC (body), 0);
1884 then_rtx = XEXP (SET_SRC (body), 1);
1885 else_rtx = XEXP (SET_SRC (body), 2);
1889 cond_rtx = SET_SRC (body);
1890 then_rtx = const_true_rtx;
1891 else_rtx = const0_rtx;
1894 switch (GET_CODE (cond_rtx))
1907 register int result;
1908 if (XEXP (cond_rtx, 0) != cc0_rtx)
1910 result = alter_cond (cond_rtx);
1912 validate_change (insn, &SET_SRC (body), then_rtx, 0);
1913 else if (result == -1)
1914 validate_change (insn, &SET_SRC (body), else_rtx, 0);
1915 else if (result == 2)
1916 INSN_CODE (insn) = -1;
1917 if (SET_DEST (body) == SET_SRC (body))
1919 PUT_CODE (insn, NOTE);
1920 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1921 NOTE_SOURCE_FILE (insn) = 0;
1930 /* Do machine-specific peephole optimizations if desired. */
1932 if (optimize && !flag_no_peephole && !nopeepholes)
1934 rtx next = peephole (insn);
1935 /* When peepholing, if there were notes within the peephole,
1936 emit them before the peephole. */
1937 if (next != 0 && next != NEXT_INSN (insn))
1939 rtx prev = PREV_INSN (insn);
1942 for (note = NEXT_INSN (insn); note != next;
1943 note = NEXT_INSN (note))
1944 final_scan_insn (note, file, optimize, prescan, nopeepholes);
1946 /* In case this is prescan, put the notes
1947 in proper position for later rescan. */
1948 note = NEXT_INSN (insn);
1949 PREV_INSN (note) = prev;
1950 NEXT_INSN (prev) = note;
1951 NEXT_INSN (PREV_INSN (next)) = insn;
1952 PREV_INSN (insn) = PREV_INSN (next);
1953 NEXT_INSN (insn) = next;
1954 PREV_INSN (next) = insn;
1957 /* PEEPHOLE might have changed this. */
1958 body = PATTERN (insn);
1961 /* Try to recognize the instruction.
1962 If successful, verify that the operands satisfy the
1963 constraints for the instruction. Crash if they don't,
1964 since `reload' should have changed them so that they do. */
1966 insn_code_number = recog_memoized (insn);
1967 insn_extract (insn);
1968 for (i = 0; i < insn_n_operands[insn_code_number]; i++)
1970 if (GET_CODE (recog_operand[i]) == SUBREG)
1971 recog_operand[i] = alter_subreg (recog_operand[i]);
1972 else if (GET_CODE (recog_operand[i]) == PLUS
1973 || GET_CODE (recog_operand[i]) == MULT)
1974 recog_operand[i] = walk_alter_subreg (recog_operand[i]);
1977 for (i = 0; i < insn_n_dups[insn_code_number]; i++)
1979 if (GET_CODE (*recog_dup_loc[i]) == SUBREG)
1980 *recog_dup_loc[i] = alter_subreg (*recog_dup_loc[i]);
1981 else if (GET_CODE (*recog_dup_loc[i]) == PLUS
1982 || GET_CODE (*recog_dup_loc[i]) == MULT)
1983 *recog_dup_loc[i] = walk_alter_subreg (*recog_dup_loc[i]);
1986 #ifdef REGISTER_CONSTRAINTS
1987 if (! constrain_operands (insn_code_number, 1))
1988 fatal_insn_not_found (insn);
1991 /* Some target machines need to prescan each insn before
1994 #ifdef FINAL_PRESCAN_INSN
1995 FINAL_PRESCAN_INSN (insn, recog_operand,
1996 insn_n_operands[insn_code_number]);
2000 cc_prev_status = cc_status;
2002 /* Update `cc_status' for this instruction.
2003 The instruction's output routine may change it further.
2004 If the output routine for a jump insn needs to depend
2005 on the cc status, it should look at cc_prev_status. */
2007 NOTICE_UPDATE_CC (body, insn);
2012 /* If the proper template needs to be chosen by some C code,
2013 run that code and get the real template. */
2015 template = insn_template[insn_code_number];
2018 template = (*insn_outfun[insn_code_number]) (recog_operand, insn);
2020 /* If the C code returns 0, it means that it is a jump insn
2021 which follows a deleted test insn, and that test insn
2022 needs to be reinserted. */
2025 if (prev_nonnote_insn (insn) != last_ignored_compare)
2028 return prev_nonnote_insn (insn);
2032 /* If the template is the string "#", it means that this insn must
2034 if (template[0] == '#' && template[1] == '\0')
2036 rtx new = try_split (body, insn, 0);
2038 /* If we didn't split the insn, go away. */
2039 if (new == insn && PATTERN (new) == body)
2049 /* Output assembler code from the template. */
2051 output_asm_insn (template, recog_operand);
2054 /* It's not at all clear why we did this and doing so interferes
2055 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2058 /* Mark this insn as having been output. */
2059 INSN_DELETED_P (insn) = 1;
2065 return NEXT_INSN (insn);
2068 /* Output debugging info to the assembler file FILE
2069 based on the NOTE-insn INSN, assumed to be a line number. */
2072 output_source_line (file, insn)
2076 register char *filename = NOTE_SOURCE_FILE (insn);
2078 /* Remember filename for basic block profiling.
2079 Filenames are allocated on the permanent obstack
2080 or are passed in ARGV, so we don't have to save
2083 if (profile_block_flag && last_filename != filename)
2084 bb_file_label_num = add_bb_string (filename, TRUE);
2086 last_filename = filename;
2087 last_linenum = NOTE_LINE_NUMBER (insn);
2088 high_block_linenum = MAX (last_linenum, high_block_linenum);
2089 high_function_linenum = MAX (last_linenum, high_function_linenum);
2091 if (write_symbols != NO_DEBUG)
2093 #ifdef SDB_DEBUGGING_INFO
2094 if (write_symbols == SDB_DEBUG
2095 #if 0 /* People like having line numbers even in wrong file! */
2096 /* COFF can't handle multiple source files--lose, lose. */
2097 && !strcmp (filename, main_input_filename)
2099 /* COFF relative line numbers must be positive. */
2100 && last_linenum > sdb_begin_function_line)
2102 #ifdef ASM_OUTPUT_SOURCE_LINE
2103 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
2105 fprintf (file, "\t.ln\t%d\n",
2106 ((sdb_begin_function_line > -1)
2107 ? last_linenum - sdb_begin_function_line : 1));
2112 #if defined (DBX_DEBUGGING_INFO)
2113 if (write_symbols == DBX_DEBUG)
2114 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
2117 #if defined (XCOFF_DEBUGGING_INFO)
2118 if (write_symbols == XCOFF_DEBUG)
2119 xcoffout_source_line (file, filename, insn);
2122 #ifdef DWARF_DEBUGGING_INFO
2123 if (write_symbols == DWARF_DEBUG)
2124 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
2129 /* If X is a SUBREG, replace it with a REG or a MEM,
2130 based on the thing it is a subreg of. */
2136 register rtx y = SUBREG_REG (x);
2137 if (GET_CODE (y) == SUBREG)
2138 y = alter_subreg (y);
2140 if (GET_CODE (y) == REG)
2142 /* If the containing reg really gets a hard reg, so do we. */
2144 REGNO (x) = REGNO (y) + SUBREG_WORD (x);
2146 else if (GET_CODE (y) == MEM)
2148 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
2149 if (BYTES_BIG_ENDIAN)
2150 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
2151 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
2153 MEM_VOLATILE_P (x) = MEM_VOLATILE_P (y);
2154 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
2160 /* Do alter_subreg on all the SUBREGs contained in X. */
2163 walk_alter_subreg (x)
2166 switch (GET_CODE (x))
2170 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
2171 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
2175 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
2179 return alter_subreg (x);
2187 /* Given BODY, the body of a jump instruction, alter the jump condition
2188 as required by the bits that are set in cc_status.flags.
2189 Not all of the bits there can be handled at this level in all cases.
2191 The value is normally 0.
2192 1 means that the condition has become always true.
2193 -1 means that the condition has become always false.
2194 2 means that COND has been altered. */
2202 if (cc_status.flags & CC_REVERSED)
2205 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
2208 if (cc_status.flags & CC_INVERTED)
2211 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
2214 if (cc_status.flags & CC_NOT_POSITIVE)
2215 switch (GET_CODE (cond))
2220 /* Jump becomes unconditional. */
2226 /* Jump becomes no-op. */
2230 PUT_CODE (cond, EQ);
2235 PUT_CODE (cond, NE);
2240 if (cc_status.flags & CC_NOT_NEGATIVE)
2241 switch (GET_CODE (cond))
2245 /* Jump becomes unconditional. */
2250 /* Jump becomes no-op. */
2255 PUT_CODE (cond, EQ);
2261 PUT_CODE (cond, NE);
2266 if (cc_status.flags & CC_NO_OVERFLOW)
2267 switch (GET_CODE (cond))
2270 /* Jump becomes unconditional. */
2274 PUT_CODE (cond, EQ);
2279 PUT_CODE (cond, NE);
2284 /* Jump becomes no-op. */
2288 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
2289 switch (GET_CODE (cond))
2302 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
2307 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
2312 if (cc_status.flags & CC_NOT_SIGNED)
2313 /* The flags are valid if signed condition operators are converted
2315 switch (GET_CODE (cond))
2318 PUT_CODE (cond, LEU);
2323 PUT_CODE (cond, LTU);
2328 PUT_CODE (cond, GTU);
2333 PUT_CODE (cond, GEU);
2342 /* Report inconsistency between the assembler template and the operands.
2343 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
2346 output_operand_lossage (str)
2349 if (this_is_asm_operands)
2350 error_for_asm (this_is_asm_operands, "invalid `asm': %s", str);
2355 /* Output of assembler code from a template, and its subroutines. */
2357 /* Output text from TEMPLATE to the assembler output file,
2358 obeying %-directions to substitute operands taken from
2359 the vector OPERANDS.
2361 %N (for N a digit) means print operand N in usual manner.
2362 %lN means require operand N to be a CODE_LABEL or LABEL_REF
2363 and print the label name with no punctuation.
2364 %cN means require operand N to be a constant
2365 and print the constant expression with no punctuation.
2366 %aN means expect operand N to be a memory address
2367 (not a memory reference!) and print a reference
2369 %nN means expect operand N to be a constant
2370 and print a constant expression for minus the value
2371 of the operand, with no other punctuation. */
2376 if (flag_print_asm_name)
2378 /* Annotate the assembly with a comment describing the pattern and
2379 alternative used. */
2382 register int num = INSN_CODE (debug_insn);
2383 fprintf (asm_out_file, " %s %d %s",
2384 ASM_COMMENT_START, INSN_UID (debug_insn), insn_name[num]);
2385 if (insn_n_alternatives[num] > 1)
2386 fprintf (asm_out_file, "/%d", which_alternative + 1);
2388 /* Clear this so only the first assembler insn
2389 of any rtl insn will get the special comment for -dp. */
2396 output_asm_insn (template, operands)
2403 /* An insn may return a null string template
2404 in a case where no assembler code is needed. */
2409 putc ('\t', asm_out_file);
2411 #ifdef ASM_OUTPUT_OPCODE
2412 ASM_OUTPUT_OPCODE (asm_out_file, p);
2420 putc (c, asm_out_file);
2421 #ifdef ASM_OUTPUT_OPCODE
2422 while ((c = *p) == '\t')
2424 putc (c, asm_out_file);
2427 ASM_OUTPUT_OPCODE (asm_out_file, p);
2431 #ifdef ASSEMBLER_DIALECT
2433 /* If we want the first dialect, do nothing. Otherwise, skip
2434 DIALECT_NUMBER of strings ending with '|'. */
2435 for (i = 0; i < dialect_number; i++)
2437 while (*p && *p++ != '|')
2446 /* Skip to close brace. */
2447 while (*p && *p++ != '}')
2456 /* %% outputs a single %. */
2460 putc (c, asm_out_file);
2462 /* %= outputs a number which is unique to each insn in the entire
2463 compilation. This is useful for making local labels that are
2464 referred to more than once in a given insn. */
2468 fprintf (asm_out_file, "%d", insn_counter);
2470 /* % followed by a letter and some digits
2471 outputs an operand in a special way depending on the letter.
2472 Letters `acln' are implemented directly.
2473 Other letters are passed to `output_operand' so that
2474 the PRINT_OPERAND macro can define them. */
2475 else if ((*p >= 'a' && *p <= 'z')
2476 || (*p >= 'A' && *p <= 'Z'))
2481 if (! (*p >= '0' && *p <= '9'))
2482 output_operand_lossage ("operand number missing after %-letter");
2483 else if (this_is_asm_operands && c >= (unsigned) insn_noperands)
2484 output_operand_lossage ("operand number out of range");
2485 else if (letter == 'l')
2486 output_asm_label (operands[c]);
2487 else if (letter == 'a')
2488 output_address (operands[c]);
2489 else if (letter == 'c')
2491 if (CONSTANT_ADDRESS_P (operands[c]))
2492 output_addr_const (asm_out_file, operands[c]);
2494 output_operand (operands[c], 'c');
2496 else if (letter == 'n')
2498 if (GET_CODE (operands[c]) == CONST_INT)
2499 fprintf (asm_out_file,
2500 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2505 - INTVAL (operands[c]));
2508 putc ('-', asm_out_file);
2509 output_addr_const (asm_out_file, operands[c]);
2513 output_operand (operands[c], letter);
2515 while ((c = *p) >= '0' && c <= '9') p++;
2517 /* % followed by a digit outputs an operand the default way. */
2518 else if (*p >= '0' && *p <= '9')
2521 if (this_is_asm_operands && c >= (unsigned) insn_noperands)
2522 output_operand_lossage ("operand number out of range");
2524 output_operand (operands[c], 0);
2525 while ((c = *p) >= '0' && c <= '9') p++;
2527 /* % followed by punctuation: output something for that
2528 punctuation character alone, with no operand.
2529 The PRINT_OPERAND macro decides what is actually done. */
2530 #ifdef PRINT_OPERAND_PUNCT_VALID_P
2531 else if (PRINT_OPERAND_PUNCT_VALID_P (*p))
2532 output_operand (NULL_RTX, *p++);
2535 output_operand_lossage ("invalid %%-code");
2539 putc (c, asm_out_file);
2544 putc ('\n', asm_out_file);
2547 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
2550 output_asm_label (x)
2555 if (GET_CODE (x) == LABEL_REF)
2556 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
2557 else if (GET_CODE (x) == CODE_LABEL)
2558 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
2560 output_operand_lossage ("`%l' operand isn't a label");
2562 assemble_name (asm_out_file, buf);
2565 /* Print operand X using machine-dependent assembler syntax.
2566 The macro PRINT_OPERAND is defined just to control this function.
2567 CODE is a non-digit that preceded the operand-number in the % spec,
2568 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
2569 between the % and the digits.
2570 When CODE is a non-letter, X is 0.
2572 The meanings of the letters are machine-dependent and controlled
2573 by PRINT_OPERAND. */
2576 output_operand (x, code)
2580 if (x && GET_CODE (x) == SUBREG)
2581 x = alter_subreg (x);
2583 /* If X is a pseudo-register, abort now rather than writing trash to the
2586 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
2589 PRINT_OPERAND (asm_out_file, x, code);
2592 /* Print a memory reference operand for address X
2593 using machine-dependent assembler syntax.
2594 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
2600 walk_alter_subreg (x);
2601 PRINT_OPERAND_ADDRESS (asm_out_file, x);
2604 /* Print an integer constant expression in assembler syntax.
2605 Addition and subtraction are the only arithmetic
2606 that may appear in these expressions. */
2609 output_addr_const (file, x)
2616 switch (GET_CODE (x))
2626 assemble_name (file, XSTR (x, 0));
2630 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
2631 assemble_name (file, buf);
2635 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
2636 assemble_name (file, buf);
2641 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2650 /* This used to output parentheses around the expression,
2651 but that does not work on the 386 (either ATT or BSD assembler). */
2652 output_addr_const (file, XEXP (x, 0));
2656 if (GET_MODE (x) == VOIDmode)
2658 /* We can use %d if the number is one word and positive. */
2659 if (CONST_DOUBLE_HIGH (x))
2661 #if HOST_BITS_PER_WIDE_INT == 64
2662 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
2668 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
2674 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
2675 else if (CONST_DOUBLE_LOW (x) < 0)
2677 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2682 CONST_DOUBLE_LOW (x));
2685 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2690 CONST_DOUBLE_LOW (x));
2693 /* We can't handle floating point constants;
2694 PRINT_OPERAND must handle them. */
2695 output_operand_lossage ("floating constant misused");
2699 /* Some assemblers need integer constants to appear last (eg masm). */
2700 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
2702 output_addr_const (file, XEXP (x, 1));
2703 if (INTVAL (XEXP (x, 0)) >= 0)
2704 fprintf (file, "+");
2705 output_addr_const (file, XEXP (x, 0));
2709 output_addr_const (file, XEXP (x, 0));
2710 if (INTVAL (XEXP (x, 1)) >= 0)
2711 fprintf (file, "+");
2712 output_addr_const (file, XEXP (x, 1));
2717 /* Avoid outputting things like x-x or x+5-x,
2718 since some assemblers can't handle that. */
2719 x = simplify_subtraction (x);
2720 if (GET_CODE (x) != MINUS)
2723 output_addr_const (file, XEXP (x, 0));
2724 fprintf (file, "-");
2725 if (GET_CODE (XEXP (x, 1)) == CONST_INT
2726 && INTVAL (XEXP (x, 1)) < 0)
2728 fprintf (file, ASM_OPEN_PAREN);
2729 output_addr_const (file, XEXP (x, 1));
2730 fprintf (file, ASM_CLOSE_PAREN);
2733 output_addr_const (file, XEXP (x, 1));
2738 output_addr_const (file, XEXP (x, 0));
2742 output_operand_lossage ("invalid expression as operand");
2746 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
2747 %R prints the value of REGISTER_PREFIX.
2748 %L prints the value of LOCAL_LABEL_PREFIX.
2749 %U prints the value of USER_LABEL_PREFIX.
2750 %I prints the value of IMMEDIATE_PREFIX.
2751 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
2752 Also supported are %d, %x, %s, %e, %f, %g and %%.
2754 We handle alternate assembler dialects here, just like output_asm_insn. */
2757 asm_fprintf VPROTO((FILE *file, char *p, ...))
2768 VA_START (argptr, p);
2771 file = va_arg (argptr, FILE*);
2772 p = va_arg (argptr, char*);
2780 #ifdef ASSEMBLER_DIALECT
2782 /* If we want the first dialect, do nothing. Otherwise, skip
2783 DIALECT_NUMBER of strings ending with '|'. */
2784 for (i = 0; i < dialect_number; i++)
2786 while (*p && *p++ != '|')
2795 /* Skip to close brace. */
2796 while (*p && *p++ != '}')
2807 while ((c >= '0' && c <= '9') || c == '.')
2815 fprintf (file, "%%");
2818 case 'd': case 'i': case 'u':
2819 case 'x': case 'p': case 'X':
2823 fprintf (file, buf, va_arg (argptr, int));
2827 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
2828 but we do not check for those cases. It means that the value
2829 is a HOST_WIDE_INT, which may be either `int' or `long'. */
2831 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
2837 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
2844 fprintf (file, buf, va_arg (argptr, long));
2852 fprintf (file, buf, va_arg (argptr, double));
2858 fprintf (file, buf, va_arg (argptr, char *));
2862 #ifdef ASM_OUTPUT_OPCODE
2863 ASM_OUTPUT_OPCODE (asm_out_file, p);
2868 #ifdef REGISTER_PREFIX
2869 fprintf (file, "%s", REGISTER_PREFIX);
2874 #ifdef IMMEDIATE_PREFIX
2875 fprintf (file, "%s", IMMEDIATE_PREFIX);
2880 #ifdef LOCAL_LABEL_PREFIX
2881 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
2886 #ifdef USER_LABEL_PREFIX
2887 fprintf (file, "%s", USER_LABEL_PREFIX);
2901 /* Split up a CONST_DOUBLE or integer constant rtx
2902 into two rtx's for single words,
2903 storing in *FIRST the word that comes first in memory in the target
2904 and in *SECOND the other. */
2907 split_double (value, first, second)
2909 rtx *first, *second;
2911 if (GET_CODE (value) == CONST_INT)
2913 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
2915 /* In this case the CONST_INT holds both target words.
2916 Extract the bits from it into two word-sized pieces. */
2918 HOST_WIDE_INT word_mask;
2919 /* Avoid warnings for shift count >= BITS_PER_WORD. */
2920 int shift_count = BITS_PER_WORD - 1;
2922 word_mask = (HOST_WIDE_INT) 1 << shift_count;
2923 word_mask |= word_mask - 1;
2924 low = GEN_INT (INTVAL (value) & word_mask);
2925 high = GEN_INT ((INTVAL (value) >> (shift_count + 1)) & word_mask);
2926 if (WORDS_BIG_ENDIAN)
2939 /* The rule for using CONST_INT for a wider mode
2940 is that we regard the value as signed.
2941 So sign-extend it. */
2942 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
2943 if (WORDS_BIG_ENDIAN)
2955 else if (GET_CODE (value) != CONST_DOUBLE)
2957 if (WORDS_BIG_ENDIAN)
2959 *first = const0_rtx;
2965 *second = const0_rtx;
2968 else if (GET_MODE (value) == VOIDmode
2969 /* This is the old way we did CONST_DOUBLE integers. */
2970 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
2972 /* In an integer, the words are defined as most and least significant.
2973 So order them by the target's convention. */
2974 if (WORDS_BIG_ENDIAN)
2976 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
2977 *second = GEN_INT (CONST_DOUBLE_LOW (value));
2981 *first = GEN_INT (CONST_DOUBLE_LOW (value));
2982 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
2987 #ifdef REAL_ARITHMETIC
2988 REAL_VALUE_TYPE r; long l[2];
2989 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
2991 /* Note, this converts the REAL_VALUE_TYPE to the target's
2992 format, splits up the floating point double and outputs
2993 exactly 32 bits of it into each of l[0] and l[1] --
2994 not necessarily BITS_PER_WORD bits. */
2995 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
2997 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
2998 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
3000 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
3001 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
3002 && ! flag_pretend_float)
3006 #ifdef HOST_WORDS_BIG_ENDIAN
3013 /* Host and target agree => no need to swap. */
3014 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3015 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3019 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3020 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3022 #endif /* no REAL_ARITHMETIC */
3026 /* Return nonzero if this function has no function calls. */
3033 if (profile_flag || profile_block_flag)
3036 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3038 if (GET_CODE (insn) == CALL_INSN)
3040 if (GET_CODE (insn) == INSN
3041 && GET_CODE (PATTERN (insn)) == SEQUENCE
3042 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN)
3045 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
3047 if (GET_CODE (XEXP (insn, 0)) == CALL_INSN)
3049 if (GET_CODE (XEXP (insn, 0)) == INSN
3050 && GET_CODE (PATTERN (XEXP (insn, 0))) == SEQUENCE
3051 && GET_CODE (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)) == CALL_INSN)
3058 /* On some machines, a function with no call insns
3059 can run faster if it doesn't create its own register window.
3060 When output, the leaf function should use only the "output"
3061 registers. Ordinarily, the function would be compiled to use
3062 the "input" registers to find its arguments; it is a candidate
3063 for leaf treatment if it uses only the "input" registers.
3064 Leaf function treatment means renumbering so the function
3065 uses the "output" registers instead. */
3067 #ifdef LEAF_REGISTERS
3069 static char permitted_reg_in_leaf_functions[] = LEAF_REGISTERS;
3071 /* Return 1 if this function uses only the registers that can be
3072 safely renumbered. */
3075 only_leaf_regs_used ()
3079 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
3081 if ((regs_ever_live[i] || global_regs[i])
3082 && ! permitted_reg_in_leaf_functions[i])
3088 /* Scan all instructions and renumber all registers into those
3089 available in leaf functions. */
3092 leaf_renumber_regs (first)
3097 /* Renumber only the actual patterns.
3098 The reg-notes can contain frame pointer refs,
3099 and renumbering them could crash, and should not be needed. */
3100 for (insn = first; insn; insn = NEXT_INSN (insn))
3101 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
3102 leaf_renumber_regs_insn (PATTERN (insn));
3103 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
3104 if (GET_RTX_CLASS (GET_CODE (XEXP (insn, 0))) == 'i')
3105 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
3108 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
3109 available in leaf functions. */
3112 leaf_renumber_regs_insn (in_rtx)
3113 register rtx in_rtx;
3116 register char *format_ptr;
3121 /* Renumber all input-registers into output-registers.
3122 renumbered_regs would be 1 for an output-register;
3125 if (GET_CODE (in_rtx) == REG)
3129 /* Don't renumber the same reg twice. */
3133 newreg = REGNO (in_rtx);
3134 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
3135 to reach here as part of a REG_NOTE. */
3136 if (newreg >= FIRST_PSEUDO_REGISTER)
3141 newreg = LEAF_REG_REMAP (newreg);
3144 regs_ever_live[REGNO (in_rtx)] = 0;
3145 regs_ever_live[newreg] = 1;
3146 REGNO (in_rtx) = newreg;
3150 if (GET_RTX_CLASS (GET_CODE (in_rtx)) == 'i')
3152 /* Inside a SEQUENCE, we find insns.
3153 Renumber just the patterns of these insns,
3154 just as we do for the top-level insns. */
3155 leaf_renumber_regs_insn (PATTERN (in_rtx));
3159 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
3161 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
3162 switch (*format_ptr++)
3165 leaf_renumber_regs_insn (XEXP (in_rtx, i));
3169 if (NULL != XVEC (in_rtx, i))
3171 for (j = 0; j < XVECLEN (in_rtx, i); j++)
3172 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));