1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992 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, 675 Mass Ave, Cambridge, MA 02139, USA. */
21 /* This is the final pass of the compiler.
22 It looks at the rtl code for a function and outputs assembler code.
24 Call `final_start_function' to output the assembler code for function entry,
25 `final' to output assembler code for some RTL code,
26 `final_end_function' to output assembler code for function exit.
27 If a function is compiled in several pieces, each piece is
28 output separately with `final'.
30 Some optimizations are also done at this level.
31 Move instructions that were made unnecessary by good register allocation
32 are detected and omitted from the output. (Though most of these
33 are removed by the last jump pass.)
35 Instructions to set the condition codes are omitted when it can be
36 seen that the condition codes already had the desired values.
38 In some cases it is sufficient if the inherited condition codes
39 have related values, but this may require the following insn
40 (the one that tests the condition codes) to be modified.
42 The code for the function prologue and epilogue are generated
43 directly as assembler code by the macros FUNCTION_PROLOGUE and
44 FUNCTION_EPILOGUE. Those instructions never exist as rtl. */
51 #include "insn-config.h"
52 #include "insn-flags.h"
53 #include "insn-attr.h"
54 #include "insn-codes.h"
56 #include "conditions.h"
59 #include "hard-reg-set.h"
67 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
68 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
69 #if defined (USG) || defined (NO_STAB_H)
70 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
72 #include <stab.h> /* On BSD, use the system's stab.h. */
74 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
76 #ifdef XCOFF_DEBUGGING_INFO
80 /* .stabd code for line number. */
85 /* .stabs code for included file name. */
91 #define INT_TYPE_SIZE BITS_PER_WORD
94 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
95 null default for it to save conditionalization later. */
96 #ifndef CC_STATUS_INIT
97 #define CC_STATUS_INIT
100 /* How to start an assembler comment. */
101 #ifndef ASM_COMMENT_START
102 #define ASM_COMMENT_START ";#"
106 void output_asm_insn ();
108 static rtx walk_alter_subreg ();
109 static int alter_cond ();
110 void output_asm_label ();
111 static void output_operand ();
112 void output_address ();
113 void output_addr_const ();
114 static void output_source_line ();
115 rtx final_scan_insn ();
116 void profile_function ();
117 static void profile_after_prologue ();
119 #ifdef HAVE_ATTR_length
120 static int asm_insn_count ();
123 /* Nonzero means this function is a leaf function, with no function calls.
124 This variable exists to be examined in FUNCTION_PROLOGUE
125 and FUNCTION_EPILOGUE. Always zero, unless set by some action. */
128 int leaf_function_p ();
130 #ifdef LEAF_REGISTERS
131 int only_leaf_regs_used ();
132 static void leaf_renumber_regs ();
133 void leaf_renumber_regs_insn ();
136 /* Last insn processed by final_scan_insn. */
137 static rtx debug_insn = 0;
139 /* Line number of last NOTE. */
140 static int last_linenum;
142 /* Filename of last NOTE. */
143 static char *last_filename;
145 /* Number of basic blocks seen so far;
146 used if profile_block_flag is set. */
147 static int count_basic_blocks;
149 /* Nonzero while outputting an `asm' with operands.
150 This means that inconsistencies are the user's fault, so don't abort.
151 The precise value is the insn being output, to pass to error_for_asm. */
152 static rtx this_is_asm_operands;
154 /* Number of operands of this insn, for an `asm' with operands. */
155 static int insn_noperands;
157 /* Compare optimization flag. */
159 static rtx last_ignored_compare = 0;
161 /* Flag indicating this insn is the start of a new basic block. */
163 static int new_block = 1;
165 /* All the symbol-blocks (levels of scoping) in the compilation
166 are assigned sequence numbers in order of appearance of the
167 beginnings of the symbol-blocks. Both final and dbxout do this,
168 and assume that they will both give the same number to each block.
169 Final uses these sequence numbers to generate assembler label names
170 LBBnnn and LBEnnn for the beginning and end of the symbol-block.
171 Dbxout uses the sequence numbers to generate references to the same labels
172 from the dbx debugging information.
174 Sdb records this level at the beginning of each function,
175 in order to find the current level when recursing down declarations.
176 It outputs the block beginning and endings
177 at the point in the asm file where the blocks would begin and end. */
179 int next_block_index;
181 /* Assign a unique number to each insn that is output.
182 This can be used to generate unique local labels. */
184 static int insn_counter = 0;
187 /* This variable contains machine-dependent flags (defined in tm.h)
188 set and examined by output routines
189 that describe how to interpret the condition codes properly. */
193 /* During output of an insn, this contains a copy of cc_status
194 from before the insn. */
196 CC_STATUS cc_prev_status;
199 /* Indexed by hardware reg number, is 1 if that register is ever
200 used in the current function.
202 In life_analysis, or in stupid_life_analysis, this is set
203 up to record the hard regs used explicitly. Reload adds
204 in the hard regs used for holding pseudo regs. Final uses
205 it to generate the code in the function prologue and epilogue
206 to save and restore registers as needed. */
208 char regs_ever_live[FIRST_PSEUDO_REGISTER];
210 /* Nonzero means current function must be given a frame pointer.
211 Set in stmt.c if anything is allocated on the stack there.
212 Set in reload1.c if anything is allocated on the stack there. */
214 int frame_pointer_needed;
216 /* Assign unique numbers to labels generated for profiling. */
218 int profile_label_no;
220 /* Length so far allocated in PENDING_BLOCKS. */
222 static int max_block_depth;
224 /* Stack of sequence numbers of symbol-blocks of which we have seen the
225 beginning but not yet the end. Sequence numbers are assigned at
226 the beginning; this stack allows us to find the sequence number
227 of a block that is ending. */
229 static int *pending_blocks;
231 /* Number of elements currently in use in PENDING_BLOCKS. */
233 static int block_depth;
235 /* Nonzero if have enabled APP processing of our assembler output. */
239 /* If we are outputting an insn sequence, this contains the sequence rtx.
244 /* Indexed by line number, nonzero if there is a note for that line. */
246 static char *line_note_exists;
248 /* Linked list to hold line numbers for each basic block. */
251 struct bb_list *next; /* pointer to next basic block */
252 int line_num; /* line number */
253 int file_label_num; /* LPBC<n> label # for stored filename */
254 int func_label_num; /* LPBC<n> label # for stored function name */
257 static struct bb_list *bb_head = 0; /* Head of basic block list */
258 static struct bb_list **bb_tail = &bb_head; /* Ptr to store next bb ptr */
259 static int bb_file_label_num = -1; /* Current label # for file */
260 static int bb_func_label_num = -1; /* Current label # for func */
262 /* Linked list to hold the strings for each file and function name output. */
265 struct bb_str *next; /* pointer to next string */
266 char *string; /* string */
267 int label_num; /* label number */
268 int length; /* string length */
271 static struct bb_str *sbb_head = 0; /* Head of string list. */
272 static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */
273 static int sbb_label_num = 0; /* Last label used */
275 static int add_bb_string PROTO((char *, int));
276 static void add_bb PROTO((FILE *));
279 /* Initialize data in final at the beginning of a compilation. */
282 init_final (filename)
285 next_block_index = 2;
287 max_block_depth = 20;
288 pending_blocks = (int *) xmalloc (20 * sizeof *pending_blocks);
292 /* Called at end of source file,
293 to output the block-profiling table for this entire compilation. */
301 if (profile_block_flag)
304 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
305 int size = (INT_TYPE_SIZE / BITS_PER_UNIT) * count_basic_blocks;
310 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
311 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
312 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
316 /* Output the main header, of 10 words:
317 0: 1 if this file's initialized, else 0.
318 1: address of file name (LPBX1).
319 2: address of table of counts (LPBX2).
320 3: number of counts in the table.
321 4: always 0, for compatibility with Sun.
323 The following are GNU extensions:
325 5: address of table of start addrs of basic blocks (LPBX3).
326 6: Number of bytes in this header.
327 7: address of table of function names (LPBX4).
328 8: address of table of line numbers (LPBX5) or 0.
329 9: address of table of file names (LPBX6) or 0. */
331 ASM_OUTPUT_ALIGN (asm_out_file, align);
333 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
335 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
337 /* address of filename */
338 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
339 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
341 /* address of count table */
342 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
343 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
345 /* count of the # of basic blocks */
346 assemble_integer (GEN_INT (count_basic_blocks), UNITS_PER_WORD, 1);
348 /* zero word (link field) */
349 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
351 /* address of basic block start address table */
352 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
353 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
355 /* byte count for extended structure. */
356 assemble_integer (GEN_INT (10 * UNITS_PER_WORD), UNITS_PER_WORD, 1);
358 /* address of function name table */
359 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
360 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
362 /* address of line number and filename tables if debugging. */
363 if (write_symbols != NO_DEBUG)
365 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
366 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
367 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
368 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
372 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
373 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
376 /* Output the file name changing the suffix to .d for Sun tcov
378 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
380 int len = strlen (filename);
381 char *data_file = (char *) alloca (len + 3);
382 strcpy (data_file, filename);
383 strip_off_ending (data_file, len);
384 strcat (data_file, ".d");
385 assemble_string (data_file, strlen (data_file) + 1);
388 /* Make space for the table of counts. */
389 if (flag_no_common || size == 0)
391 /* Realign data section. */
392 ASM_OUTPUT_ALIGN (asm_out_file, align);
393 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
395 assemble_zeros (size);
399 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
400 #ifdef ASM_OUTPUT_SHARED_LOCAL
401 if (flag_shared_data)
402 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
405 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
406 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, align);
408 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
412 /* Output any basic block strings */
413 readonly_data_section ();
416 ASM_OUTPUT_ALIGN (asm_out_file, align);
417 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
419 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC", sptr->label_num);
420 assemble_string (sptr->string, sptr->length);
424 /* Output the table of addresses. */
425 /* Realign in new section */
426 ASM_OUTPUT_ALIGN (asm_out_file, align);
427 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
428 for (i = 0; i < count_basic_blocks; i++)
430 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
431 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name),
435 /* Output the table of function names. */
436 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
437 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
439 if (ptr->func_label_num >= 0)
441 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC", ptr->func_label_num);
442 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name),
446 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
449 for ( ; i < count_basic_blocks; i++)
450 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
452 if (write_symbols != NO_DEBUG)
454 /* Output the table of line numbers. */
455 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
456 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
457 assemble_integer (GEN_INT (ptr->line_num), UNITS_PER_WORD, 1);
459 for ( ; i < count_basic_blocks; i++)
460 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
462 /* Output the table of file names. */
463 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
464 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
466 if (ptr->file_label_num >= 0)
468 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC", ptr->file_label_num);
469 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name),
473 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
476 for ( ; i < count_basic_blocks; i++)
477 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
480 /* End with the address of the table of addresses,
481 so we can find it easily, as the last word in the file's text. */
482 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
483 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
487 /* Enable APP processing of subsequent output.
488 Used before the output from an `asm' statement. */
495 fprintf (asm_out_file, ASM_APP_ON);
500 /* Enable APP processing of subsequent output.
501 Called from varasm.c before most kinds of output. */
508 fprintf (asm_out_file, ASM_APP_OFF);
513 /* Return the number of slots filled in the current
514 delayed branch sequence (we don't count the insn needing the
515 delay slot). Zero if not in a delayed branch sequence. */
519 dbr_sequence_length ()
521 if (final_sequence != 0)
522 return XVECLEN (final_sequence, 0) - 1;
528 /* The next two pages contain routines used to compute the length of an insn
529 and to shorten branches. */
531 /* Arrays for insn lengths, and addresses. The latter is referenced by
532 `insn_current_length'. */
534 static short *insn_lengths;
537 /* Address of insn being processed. Used by `insn_current_length'. */
538 int insn_current_address;
540 /* Indicate the branch shortening hasn't yet been done. */
548 /* Obtain the current length of an insn. If branch shortening has been done,
549 get its actual length. Otherwise, get its maximum length. */
552 get_attr_length (insn)
555 #ifdef HAVE_ATTR_length
561 return insn_lengths[INSN_UID (insn)];
563 switch (GET_CODE (insn))
571 length = insn_default_length (insn);
575 body = PATTERN (insn);
576 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
578 /* This only takes room if jump tables go into the text section. */
579 #if !defined(READONLY_DATA_SECTION) || defined(JUMP_TABLES_IN_TEXT_SECTION)
580 length = (XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC)
581 * GET_MODE_SIZE (GET_MODE (body)));
583 /* Be pessimistic and assume worst-case alignment. */
584 length += (GET_MODE_SIZE (GET_MODE (body)) - 1);
590 length = insn_default_length (insn);
594 body = PATTERN (insn);
595 if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
598 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
599 length = asm_insn_count (insn) * insn_default_length (insn);
600 else if (GET_CODE (body) == SEQUENCE)
601 for (i = 0; i < XVECLEN (body, 0); i++)
602 length += get_attr_length (XVECEXP (body, 0, i));
604 length = insn_default_length (insn);
607 #ifdef ADJUST_INSN_LENGTH
608 ADJUST_INSN_LENGTH (insn, length);
611 #else /* not HAVE_ATTR_length */
613 #endif /* not HAVE_ATTR_length */
616 /* Make a pass over all insns and compute their actual lengths by shortening
617 any branches of variable length if possible. */
619 /* Give a default value for the lowest address in a function. */
621 #ifndef FIRST_INSN_ADDRESS
622 #define FIRST_INSN_ADDRESS 0
626 shorten_branches (first)
629 #ifdef HAVE_ATTR_length
631 int something_changed = 1;
633 char *varying_length;
637 /* Compute maximum UID and allocate arrays. */
638 for (insn = first; insn; insn = NEXT_INSN (insn))
639 if (INSN_UID (insn) > max_uid)
640 max_uid = INSN_UID (insn);
643 insn_lengths = (short *) oballoc (max_uid * sizeof (short));
644 insn_addresses = (int *) oballoc (max_uid * sizeof (int));
645 varying_length = (char *) oballoc (max_uid * sizeof (char));
647 /* Compute initial lengths, addresses, and varying flags for each insn. */
648 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
650 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
652 uid = INSN_UID (insn);
653 insn_addresses[uid] = insn_current_address;
654 insn_lengths[uid] = 0;
655 varying_length[uid] = 0;
657 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
658 || GET_CODE (insn) == CODE_LABEL)
661 body = PATTERN (insn);
662 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
664 /* This only takes room if read-only data goes into the text
666 #if !defined(READONLY_DATA_SECTION) || defined(JUMP_TABLES_IN_TEXT_SECTION)
667 int unitsize = GET_MODE_SIZE (GET_MODE (body));
669 insn_lengths[uid] = (XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC)
670 * GET_MODE_SIZE (GET_MODE (body)));
672 /* Account for possible alignment. */
674 += unitsize - (insn_current_address & (unitsize - 1));
679 else if (asm_noperands (body) >= 0)
680 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
681 else if (GET_CODE (body) == SEQUENCE)
684 int const_delay_slots;
686 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
688 const_delay_slots = 0;
690 /* Inside a delay slot sequence, we do not do any branch shortening
691 if the shortening could change the number of delay slots
693 for (i = 0; i < XVECLEN (body, 0); i++)
695 rtx inner_insn = XVECEXP (body, 0, i);
696 int inner_uid = INSN_UID (inner_insn);
699 if (asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
700 inner_length = (asm_insn_count (PATTERN (inner_insn))
701 * insn_default_length (inner_insn));
703 inner_length = insn_default_length (inner_insn);
705 insn_lengths[inner_uid] = inner_length;
706 if (const_delay_slots)
708 if ((varying_length[inner_uid]
709 = insn_variable_length_p (inner_insn)) != 0)
710 varying_length[uid] = 1;
711 insn_addresses[inner_uid] = (insn_current_address +
715 varying_length[inner_uid] = 0;
716 insn_lengths[uid] += inner_length;
719 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
721 insn_lengths[uid] = insn_default_length (insn);
722 varying_length[uid] = insn_variable_length_p (insn);
725 /* If needed, do any adjustment. */
726 #ifdef ADJUST_INSN_LENGTH
727 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
731 /* Now loop over all the insns finding varying length insns. For each,
732 get the current insn length. If it has changed, reflect the change.
733 When nothing changes for a full pass, we are done. */
735 while (something_changed)
737 something_changed = 0;
738 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
740 insn = NEXT_INSN (insn))
745 uid = INSN_UID (insn);
746 insn_addresses[uid] = insn_current_address;
747 if (! varying_length[uid])
749 insn_current_address += insn_lengths[uid];
752 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
756 body = PATTERN (insn);
758 for (i = 0; i < XVECLEN (body, 0); i++)
760 rtx inner_insn = XVECEXP (body, 0, i);
761 int inner_uid = INSN_UID (inner_insn);
764 insn_addresses[inner_uid] = insn_current_address;
766 /* insn_current_length returns 0 for insns with a
767 non-varying length. */
768 if (! varying_length[inner_uid])
769 inner_length = insn_lengths[inner_uid];
771 inner_length = insn_current_length (inner_insn);
773 if (inner_length != insn_lengths[inner_uid])
775 insn_lengths[inner_uid] = inner_length;
776 something_changed = 1;
778 insn_current_address += insn_lengths[inner_uid];
779 new_length += inner_length;
784 new_length = insn_current_length (insn);
785 insn_current_address += new_length;
788 #ifdef SHORTEN_WITH_ADJUST_INSN_LENGTH
789 #ifdef ADJUST_INSN_LENGTH
790 /* If needed, do any adjustment. */
791 tmp_length = new_length;
792 ADJUST_INSN_LENGTH (insn, new_length);
793 insn_current_address += (new_length - tmp_length);
797 if (new_length != insn_lengths[uid])
799 insn_lengths[uid] = new_length;
800 something_changed = 1;
804 #endif /* HAVE_ATTR_length */
807 #ifdef HAVE_ATTR_length
808 /* Given the body of an INSN known to be generated by an ASM statement, return
809 the number of machine instructions likely to be generated for this insn.
810 This is used to compute its length. */
813 asm_insn_count (body)
819 for (template = decode_asm_operands (body, NULL_PTR, NULL_PTR,
821 *template; template++)
822 if (*template == ';' || *template == '\n')
829 /* Output assembler code for the start of a function,
830 and initialize some of the variables in this file
831 for the new function. The label for the function and associated
832 assembler pseudo-ops have already been output in `assemble_start_function'.
834 FIRST is the first insn of the rtl for the function being compiled.
835 FILE is the file to write assembler code to.
836 OPTIMIZE is nonzero if we should eliminate redundant
837 test and compare insns. */
840 final_start_function (first, file, optimize)
847 this_is_asm_operands = 0;
849 #ifdef NON_SAVING_SETJMP
850 /* A function that calls setjmp should save and restore all the
851 call-saved registers on a system where longjmp clobbers them. */
852 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
856 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
857 if (!call_used_regs[i] && !call_fixed_regs[i])
858 regs_ever_live[i] = 1;
862 /* Initial line number is supposed to be output
863 before the function's prologue and label
864 so that the function's address will not appear to be
865 in the last statement of the preceding function. */
866 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
868 if (write_symbols == SDB_DEBUG)
869 /* For sdb, let's not, but say we did.
870 We need to set last_linenum for sdbout_function_begin,
871 but we can't have an actual line number before the .bf symbol.
872 (sdb_begin_function_line is not set,
873 and other compilers don't do it.) */
874 last_linenum = NOTE_LINE_NUMBER (first);
875 #ifdef XCOFF_DEBUGGING_INFO
876 else if (write_symbols == XCOFF_DEBUG)
878 last_linenum = NOTE_LINE_NUMBER (first);
879 xcoffout_output_first_source_line (file, last_linenum);
883 output_source_line (file, first);
886 #ifdef LEAF_REG_REMAP
888 leaf_renumber_regs (first);
891 /* The Sun386i and perhaps other machines don't work right
892 if the profiling code comes after the prologue. */
893 #ifdef PROFILE_BEFORE_PROLOGUE
895 profile_function (file);
896 #endif /* PROFILE_BEFORE_PROLOGUE */
898 #ifdef FUNCTION_PROLOGUE
899 /* First output the function prologue: code to set up the stack frame. */
900 FUNCTION_PROLOGUE (file, get_frame_size ());
903 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
904 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
905 next_block_index = 1;
908 /* If the machine represents the prologue as RTL, the profiling code must
909 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
913 profile_after_prologue (file);
917 /* If we are doing basic block profiling, remember a printable version
918 of the function name. */
919 if (profile_block_flag)
921 char *junk = "function";
923 add_bb_string ((*decl_printable_name) (current_function_decl, &junk), FALSE);
928 profile_after_prologue (file)
931 #ifdef FUNCTION_BLOCK_PROFILER
932 if (profile_block_flag)
934 FUNCTION_BLOCK_PROFILER (file, profile_label_no);
936 #endif /* FUNCTION_BLOCK_PROFILER */
938 #ifndef PROFILE_BEFORE_PROLOGUE
940 profile_function (file);
941 #endif /* not PROFILE_BEFORE_PROLOGUE */
945 profile_function (file)
948 int align = MIN (BIGGEST_ALIGNMENT, INT_TYPE_SIZE);
949 int sval = current_function_returns_struct;
950 int cxt = current_function_needs_context;
953 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
954 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
955 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
959 #ifdef STRUCT_VALUE_INCOMING_REGNUM
961 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
963 #ifdef STRUCT_VALUE_REGNUM
965 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
970 #ifdef STATIC_CHAIN_INCOMING_REGNUM
972 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
974 #ifdef STATIC_CHAIN_REGNUM
976 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
981 FUNCTION_PROFILER (file, profile_label_no);
984 #ifdef STATIC_CHAIN_INCOMING_REGNUM
986 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
988 #ifdef STATIC_CHAIN_REGNUM
990 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
995 #ifdef STRUCT_VALUE_INCOMING_REGNUM
997 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
999 #ifdef STRUCT_VALUE_REGNUM
1001 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1006 /* Output assembler code for the end of a function.
1007 For clarity, args are same as those of `final_start_function'
1008 even though not all of them are needed. */
1011 final_end_function (first, file, optimize)
1018 fprintf (file, ASM_APP_OFF);
1022 #ifdef SDB_DEBUGGING_INFO
1023 if (write_symbols == SDB_DEBUG)
1024 sdbout_end_function (last_linenum);
1027 #ifdef DWARF_DEBUGGING_INFO
1028 if (write_symbols == DWARF_DEBUG)
1029 dwarfout_end_function ();
1032 #ifdef XCOFF_DEBUGGING_INFO
1033 if (write_symbols == XCOFF_DEBUG)
1034 xcoffout_end_function (file, last_linenum);
1037 #ifdef FUNCTION_EPILOGUE
1038 /* Finally, output the function epilogue:
1039 code to restore the stack frame and return to the caller. */
1040 FUNCTION_EPILOGUE (file, get_frame_size ());
1043 #ifdef SDB_DEBUGGING_INFO
1044 if (write_symbols == SDB_DEBUG)
1045 sdbout_end_epilogue ();
1048 #ifdef DWARF_DEBUGGING_INFO
1049 if (write_symbols == DWARF_DEBUG)
1050 dwarfout_end_epilogue ();
1053 #ifdef XCOFF_DEBUGGING_INFO
1054 if (write_symbols == XCOFF_DEBUG)
1055 xcoffout_end_epilogue (file);
1058 bb_func_label_num = -1; /* not in function, nuke label # */
1060 /* If FUNCTION_EPILOGUE is not defined, then the function body
1061 itself contains return instructions wherever needed. */
1064 /* Add a block to the linked list that remembers the current line/file/function
1065 for basic block profiling. Emit the label in front of the basic block and
1066 the instructions that increment the count field. */
1072 struct bb_list *ptr = (struct bb_list *) permalloc (sizeof (struct bb_list));
1074 /* Add basic block to linked list. */
1076 ptr->line_num = last_linenum;
1077 ptr->file_label_num = bb_file_label_num;
1078 ptr->func_label_num = bb_func_label_num;
1080 bb_tail = &ptr->next;
1082 /* Enable the table of basic-block use counts
1083 to point at the code it applies to. */
1084 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1086 /* Before first insn of this basic block, increment the
1087 count of times it was entered. */
1088 #ifdef BLOCK_PROFILER
1089 BLOCK_PROFILER (file, count_basic_blocks);
1094 count_basic_blocks++;
1097 /* Add a string to be used for basic block profiling. */
1100 add_bb_string (string, perm_p)
1105 struct bb_str *ptr = 0;
1109 string = "<unknown>";
1113 /* Allocate a new string if the current string isn't permanent. If
1114 the string is permanent search for the same string in other
1117 len = strlen (string) + 1;
1120 char *p = (char *) permalloc (len);
1121 bcopy (string, p, len);
1125 for (ptr = sbb_head; ptr != (struct bb_str *)0; ptr = ptr->next)
1126 if (ptr->string == string)
1129 /* Allocate a new string block if we need to. */
1132 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1135 ptr->label_num = sbb_label_num++;
1136 ptr->string = string;
1138 sbb_tail = &ptr->next;
1141 return ptr->label_num;
1145 /* Output assembler code for some insns: all or part of a function.
1146 For description of args, see `final_start_function', above.
1148 PRESCAN is 1 if we are not really outputting,
1149 just scanning as if we were outputting.
1150 Prescanning deletes and rearranges insns just like ordinary output.
1151 PRESCAN is -2 if we are outputting after having prescanned.
1152 In this case, don't try to delete or rearrange insns
1153 because that has already been done.
1154 Prescanning is done only on certain machines. */
1157 final (first, file, optimize, prescan)
1166 last_ignored_compare = 0;
1169 /* Make a map indicating which line numbers appear in this function.
1170 When producing SDB debugging info, delete troublesome line number
1171 notes from inlined functions in other files as well as duplicate
1172 line number notes. */
1173 #ifdef SDB_DEBUGGING_INFO
1174 if (write_symbols == SDB_DEBUG)
1177 for (insn = first; insn; insn = NEXT_INSN (insn))
1178 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1180 if ((RTX_INTEGRATED_P (insn)
1181 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1183 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1184 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1186 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1187 NOTE_SOURCE_FILE (insn) = 0;
1191 if (NOTE_LINE_NUMBER (insn) > max_line)
1192 max_line = NOTE_LINE_NUMBER (insn);
1198 for (insn = first; insn; insn = NEXT_INSN (insn))
1199 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1200 max_line = NOTE_LINE_NUMBER (insn);
1203 line_note_exists = (char *) oballoc (max_line + 1);
1204 bzero (line_note_exists, max_line + 1);
1206 for (insn = first; insn; insn = NEXT_INSN (insn))
1207 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1208 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
1214 /* Output the insns. */
1215 for (insn = NEXT_INSN (first); insn;)
1216 insn = final_scan_insn (insn, file, optimize, prescan, 0);
1218 /* Do basic-block profiling here
1219 if the last insn was a conditional branch. */
1220 if (profile_block_flag && new_block)
1224 /* The final scan for one insn, INSN.
1225 Args are same as in `final', except that INSN
1226 is the insn being scanned.
1227 Value returned is the next insn to be scanned.
1229 NOPEEPHOLES is the flag to disallow peephole processing (currently
1230 used for within delayed branch sequence output). */
1233 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
1243 /* Ignore deleted insns. These can occur when we split insns (due to a
1244 template of "#") while not optimizing. */
1245 if (INSN_DELETED_P (insn))
1246 return NEXT_INSN (insn);
1248 switch (GET_CODE (insn))
1254 /* Align the beginning of a loop, for higher speed
1255 on certain machines. */
1257 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG && optimize > 0)
1259 #ifdef ASM_OUTPUT_LOOP_ALIGN
1260 rtx next = next_nonnote_insn (insn);
1261 if (next && GET_CODE (next) == CODE_LABEL)
1263 ASM_OUTPUT_LOOP_ALIGN (asm_out_file);
1268 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END)
1271 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
1273 #ifdef FUNCTION_END_PROLOGUE
1274 FUNCTION_END_PROLOGUE (file);
1276 profile_after_prologue (file);
1280 #ifdef FUNCTION_BEGIN_EPILOGUE
1281 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
1283 FUNCTION_BEGIN_EPILOGUE (file);
1288 if (write_symbols == NO_DEBUG)
1290 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
1292 #ifdef SDB_DEBUGGING_INFO
1293 if (write_symbols == SDB_DEBUG)
1294 sdbout_begin_function (last_linenum);
1296 #ifdef XCOFF_DEBUGGING_INFO
1297 if (write_symbols == XCOFF_DEBUG)
1298 xcoffout_begin_function (file, last_linenum);
1300 #ifdef DWARF_DEBUGGING_INFO
1301 if (write_symbols == DWARF_DEBUG)
1302 dwarfout_begin_function ();
1306 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED)
1307 break; /* An insn that was "deleted" */
1310 fprintf (file, ASM_APP_OFF);
1313 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG
1314 && (debug_info_level == DINFO_LEVEL_NORMAL
1315 || debug_info_level == DINFO_LEVEL_VERBOSE
1316 #ifdef DWARF_DEBUGGING_INFO
1317 || write_symbols == DWARF_DEBUG
1322 /* Beginning of a symbol-block. Assign it a sequence number
1323 and push the number onto the stack PENDING_BLOCKS. */
1325 if (block_depth == max_block_depth)
1327 /* PENDING_BLOCKS is full; make it longer. */
1328 max_block_depth *= 2;
1330 = (int *) xrealloc (pending_blocks,
1331 max_block_depth * sizeof (int));
1333 pending_blocks[block_depth++] = next_block_index;
1335 /* Output debugging info about the symbol-block beginning. */
1337 #ifdef SDB_DEBUGGING_INFO
1338 if (write_symbols == SDB_DEBUG)
1339 sdbout_begin_block (file, last_linenum, next_block_index);
1341 #ifdef XCOFF_DEBUGGING_INFO
1342 if (write_symbols == XCOFF_DEBUG)
1343 xcoffout_begin_block (file, last_linenum, next_block_index);
1345 #ifdef DBX_DEBUGGING_INFO
1346 if (write_symbols == DBX_DEBUG)
1347 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", next_block_index);
1349 #ifdef DWARF_DEBUGGING_INFO
1350 if (write_symbols == DWARF_DEBUG && block_depth > 1)
1351 dwarfout_begin_block (next_block_index);
1356 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END
1357 && (debug_info_level == DINFO_LEVEL_NORMAL
1358 || debug_info_level == DINFO_LEVEL_VERBOSE
1359 #ifdef DWARF_DEBUGGING_INFO
1360 || write_symbols == DWARF_DEBUG
1365 /* End of a symbol-block. Pop its sequence number off
1366 PENDING_BLOCKS and output debugging info based on that. */
1370 #ifdef XCOFF_DEBUGGING_INFO
1371 if (write_symbols == XCOFF_DEBUG && block_depth >= 0)
1372 xcoffout_end_block (file, last_linenum, pending_blocks[block_depth]);
1374 #ifdef DBX_DEBUGGING_INFO
1375 if (write_symbols == DBX_DEBUG && block_depth >= 0)
1376 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE",
1377 pending_blocks[block_depth]);
1379 #ifdef SDB_DEBUGGING_INFO
1380 if (write_symbols == SDB_DEBUG && block_depth >= 0)
1381 sdbout_end_block (file, last_linenum);
1383 #ifdef DWARF_DEBUGGING_INFO
1384 if (write_symbols == DWARF_DEBUG && block_depth >= 1)
1385 dwarfout_end_block (pending_blocks[block_depth]);
1388 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL
1389 && (debug_info_level == DINFO_LEVEL_NORMAL
1390 || debug_info_level == DINFO_LEVEL_VERBOSE))
1392 #ifdef DWARF_DEBUGGING_INFO
1393 if (write_symbols == DWARF_DEBUG)
1394 dwarfout_label (insn);
1397 else if (NOTE_LINE_NUMBER (insn) > 0)
1398 /* This note is a line-number. */
1402 #if 0 /* This is what we used to do. */
1403 output_source_line (file, insn);
1407 /* If there is anything real after this note,
1408 output it. If another line note follows, omit this one. */
1409 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
1411 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
1413 /* These types of notes can be significant
1414 so make sure the preceding line number stays. */
1415 else if (GET_CODE (note) == NOTE
1416 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
1417 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
1418 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
1420 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
1422 /* Another line note follows; we can delete this note
1423 if no intervening line numbers have notes elsewhere. */
1425 for (num = NOTE_LINE_NUMBER (insn) + 1;
1426 num < NOTE_LINE_NUMBER (note);
1428 if (line_note_exists[num])
1431 if (num >= NOTE_LINE_NUMBER (note))
1437 /* Output this line note
1438 if it is the first or the last line note in a row. */
1440 output_source_line (file, insn);
1445 #ifdef ASM_OUTPUT_ALIGN_CODE
1446 /* Don't litter the assembler output with needless alignments. A
1447 BARRIER will be placed at the end of every function if HAVE_epilogue
1449 if (NEXT_INSN (insn))
1450 ASM_OUTPUT_ALIGN_CODE (file);
1459 #ifdef SDB_DEBUGGING_INFO
1460 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
1461 sdbout_label (insn);
1463 #ifdef DWARF_DEBUGGING_INFO
1464 if (write_symbols == DWARF_DEBUG && LABEL_NAME (insn))
1465 dwarfout_label (insn);
1469 fprintf (file, ASM_APP_OFF);
1472 if (NEXT_INSN (insn) != 0
1473 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
1475 rtx nextbody = PATTERN (NEXT_INSN (insn));
1477 /* If this label is followed by a jump-table,
1478 make sure we put the label in the read-only section. Also
1479 possibly write the label and jump table together. */
1481 if (GET_CODE (nextbody) == ADDR_VEC
1482 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1484 #ifndef JUMP_TABLES_IN_TEXT_SECTION
1485 readonly_data_section ();
1486 #ifdef READONLY_DATA_SECTION
1487 ASM_OUTPUT_ALIGN (file,
1488 exact_log2 (BIGGEST_ALIGNMENT
1490 #endif /* READONLY_DATA_SECTION */
1491 #else /* JUMP_TABLES_IN_TEXT_SECTION */
1493 #endif /* JUMP_TABLES_IN_TEXT_SECTION */
1494 #ifdef ASM_OUTPUT_CASE_LABEL
1495 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
1498 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
1504 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
1509 register rtx body = PATTERN (insn);
1510 int insn_code_number;
1514 /* An INSN, JUMP_INSN or CALL_INSN.
1515 First check for special kinds that recog doesn't recognize. */
1517 if (GET_CODE (body) == USE /* These are just declarations */
1518 || GET_CODE (body) == CLOBBER)
1522 /* If there is a REG_CC_SETTER note on this insn, it means that
1523 the setting of the condition code was done in the delay slot
1524 of the insn that branched here. So recover the cc status
1525 from the insn that set it. */
1527 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
1530 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
1531 cc_prev_status = cc_status;
1535 /* Detect insns that are really jump-tables
1536 and output them as such. */
1538 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1540 register int vlen, idx;
1547 fprintf (file, ASM_APP_OFF);
1551 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
1552 for (idx = 0; idx < vlen; idx++)
1554 if (GET_CODE (body) == ADDR_VEC)
1556 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
1557 ASM_OUTPUT_ADDR_VEC_ELT
1558 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
1565 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
1566 ASM_OUTPUT_ADDR_DIFF_ELT
1568 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
1569 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
1575 #ifdef ASM_OUTPUT_CASE_END
1576 ASM_OUTPUT_CASE_END (file,
1577 CODE_LABEL_NUMBER (PREV_INSN (insn)),
1586 /* Do basic-block profiling when we reach a new block.
1587 Done here to avoid jump tables. */
1588 if (profile_block_flag && new_block)
1591 if (GET_CODE (body) == ASM_INPUT)
1593 /* There's no telling what that did to the condition codes. */
1599 fprintf (file, ASM_APP_ON);
1602 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
1606 /* Detect `asm' construct with operands. */
1607 if (asm_noperands (body) >= 0)
1609 int noperands = asm_noperands (body);
1613 /* There's no telling what that did to the condition codes. */
1618 /* alloca won't do here, since only return from `final'
1621 ops = (rtx *) xmalloc (noperands * sizeof (rtx));
1625 fprintf (file, ASM_APP_ON);
1629 /* Get out the operand values. */
1630 string = decode_asm_operands (body, ops, NULL_PTR,
1631 NULL_PTR, NULL_PTR);
1632 /* Inhibit aborts on what would otherwise be compiler bugs. */
1633 insn_noperands = noperands;
1634 this_is_asm_operands = insn;
1635 /* Output the insn using them. */
1636 output_asm_insn (string, ops);
1637 this_is_asm_operands = 0;
1643 if (prescan <= 0 && app_on)
1645 fprintf (file, ASM_APP_OFF);
1649 if (GET_CODE (body) == SEQUENCE)
1651 /* A delayed-branch sequence */
1657 final_sequence = body;
1659 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
1660 force the restoration of a comparison that was previously
1661 thought unnecessary. If that happens, cancel this sequence
1662 and cause that insn to be restored. */
1664 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
1665 if (next != XVECEXP (body, 0, 1))
1671 for (i = 1; i < XVECLEN (body, 0); i++)
1672 final_scan_insn (XVECEXP (body, 0, i), file, 0, prescan, 1);
1673 #ifdef DBR_OUTPUT_SEQEND
1674 DBR_OUTPUT_SEQEND (file);
1678 /* If the insn requiring the delay slot was a CALL_INSN, the
1679 insns in the delay slot are actually executed before the
1680 called function. Hence we don't preserve any CC-setting
1681 actions in these insns and the CC must be marked as being
1682 clobbered by the function. */
1683 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
1686 /* Following a conditional branch sequence, we have a new basic
1688 if (profile_block_flag)
1690 rtx insn = XVECEXP (body, 0, 0);
1691 rtx body = PATTERN (insn);
1693 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
1694 && GET_CODE (SET_SRC (body)) != LABEL_REF)
1695 || (GET_CODE (insn) == JUMP_INSN
1696 && GET_CODE (body) == PARALLEL
1697 && GET_CODE (XVECEXP (body, 0, 0)) == SET
1698 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
1704 /* We have a real machine instruction as rtl. */
1706 body = PATTERN (insn);
1709 /* Check for redundant test and compare instructions
1710 (when the condition codes are already set up as desired).
1711 This is done only when optimizing; if not optimizing,
1712 it should be possible for the user to alter a variable
1713 with the debugger in between statements
1714 and the next statement should reexamine the variable
1715 to compute the condition codes. */
1718 && GET_CODE (body) == SET
1719 && GET_CODE (SET_DEST (body)) == CC0
1720 && insn != last_ignored_compare)
1722 if (GET_CODE (SET_SRC (body)) == SUBREG)
1723 SET_SRC (body) = alter_subreg (SET_SRC (body));
1724 else if (GET_CODE (SET_SRC (body)) == COMPARE)
1726 if (GET_CODE (XEXP (SET_SRC (body), 0)) == SUBREG)
1727 XEXP (SET_SRC (body), 0)
1728 = alter_subreg (XEXP (SET_SRC (body), 0));
1729 if (GET_CODE (XEXP (SET_SRC (body), 1)) == SUBREG)
1730 XEXP (SET_SRC (body), 1)
1731 = alter_subreg (XEXP (SET_SRC (body), 1));
1733 if ((cc_status.value1 != 0
1734 && rtx_equal_p (SET_SRC (body), cc_status.value1))
1735 || (cc_status.value2 != 0
1736 && rtx_equal_p (SET_SRC (body), cc_status.value2)))
1738 /* Don't delete insn if it has an addressing side-effect. */
1739 if (! FIND_REG_INC_NOTE (insn, 0)
1740 /* or if anything in it is volatile. */
1741 && ! volatile_refs_p (PATTERN (insn)))
1743 /* We don't really delete the insn; just ignore it. */
1744 last_ignored_compare = insn;
1751 /* Following a conditional branch, we have a new basic block.
1752 But if we are inside a sequence, the new block starts after the
1753 last insn of the sequence. */
1754 if (profile_block_flag && final_sequence == 0
1755 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
1756 && GET_CODE (SET_SRC (body)) != LABEL_REF)
1757 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
1758 && GET_CODE (XVECEXP (body, 0, 0)) == SET
1759 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
1763 /* Don't bother outputting obvious no-ops, even without -O.
1764 This optimization is fast and doesn't interfere with debugging.
1765 Don't do this if the insn is in a delay slot, since this
1766 will cause an improper number of delay insns to be written. */
1767 if (final_sequence == 0
1769 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
1770 && GET_CODE (SET_SRC (body)) == REG
1771 && GET_CODE (SET_DEST (body)) == REG
1772 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
1777 /* If this is a conditional branch, maybe modify it
1778 if the cc's are in a nonstandard state
1779 so that it accomplishes the same thing that it would
1780 do straightforwardly if the cc's were set up normally. */
1782 if (cc_status.flags != 0
1783 && GET_CODE (insn) == JUMP_INSN
1784 && GET_CODE (body) == SET
1785 && SET_DEST (body) == pc_rtx
1786 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
1787 /* This is done during prescan; it is not done again
1788 in final scan when prescan has been done. */
1791 /* This function may alter the contents of its argument
1792 and clear some of the cc_status.flags bits.
1793 It may also return 1 meaning condition now always true
1794 or -1 meaning condition now always false
1795 or 2 meaning condition nontrivial but altered. */
1796 register int result = alter_cond (XEXP (SET_SRC (body), 0));
1797 /* If condition now has fixed value, replace the IF_THEN_ELSE
1798 with its then-operand or its else-operand. */
1800 SET_SRC (body) = XEXP (SET_SRC (body), 1);
1802 SET_SRC (body) = XEXP (SET_SRC (body), 2);
1804 /* The jump is now either unconditional or a no-op.
1805 If it has become a no-op, don't try to output it.
1806 (It would not be recognized.) */
1807 if (SET_SRC (body) == pc_rtx)
1809 PUT_CODE (insn, NOTE);
1810 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1811 NOTE_SOURCE_FILE (insn) = 0;
1814 else if (GET_CODE (SET_SRC (body)) == RETURN)
1815 /* Replace (set (pc) (return)) with (return). */
1816 PATTERN (insn) = body = SET_SRC (body);
1818 /* Rerecognize the instruction if it has changed. */
1820 INSN_CODE (insn) = -1;
1823 /* Make same adjustments to instructions that examine the
1824 condition codes without jumping (if this machine has them). */
1826 if (cc_status.flags != 0
1827 && GET_CODE (body) == SET)
1829 switch (GET_CODE (SET_SRC (body)))
1842 register int result;
1843 if (XEXP (SET_SRC (body), 0) != cc0_rtx)
1845 result = alter_cond (SET_SRC (body));
1847 validate_change (insn, &SET_SRC (body), const_true_rtx, 0);
1848 else if (result == -1)
1849 validate_change (insn, &SET_SRC (body), const0_rtx, 0);
1850 else if (result == 2)
1851 INSN_CODE (insn) = -1;
1857 /* Do machine-specific peephole optimizations if desired. */
1859 if (optimize && !flag_no_peephole && !nopeepholes)
1861 rtx next = peephole (insn);
1862 /* When peepholing, if there were notes within the peephole,
1863 emit them before the peephole. */
1864 if (next != 0 && next != NEXT_INSN (insn))
1866 rtx prev = PREV_INSN (insn);
1869 for (note = NEXT_INSN (insn); note != next;
1870 note = NEXT_INSN (note))
1871 final_scan_insn (note, file, optimize, prescan, nopeepholes);
1873 /* In case this is prescan, put the notes
1874 in proper position for later rescan. */
1875 note = NEXT_INSN (insn);
1876 PREV_INSN (note) = prev;
1877 NEXT_INSN (prev) = note;
1878 NEXT_INSN (PREV_INSN (next)) = insn;
1879 PREV_INSN (insn) = PREV_INSN (next);
1880 NEXT_INSN (insn) = next;
1881 PREV_INSN (next) = insn;
1884 /* PEEPHOLE might have changed this. */
1885 body = PATTERN (insn);
1888 /* Try to recognize the instruction.
1889 If successful, verify that the operands satisfy the
1890 constraints for the instruction. Crash if they don't,
1891 since `reload' should have changed them so that they do. */
1893 insn_code_number = recog_memoized (insn);
1894 insn_extract (insn);
1895 for (i = 0; i < insn_n_operands[insn_code_number]; i++)
1897 if (GET_CODE (recog_operand[i]) == SUBREG)
1898 recog_operand[i] = alter_subreg (recog_operand[i]);
1899 else if (GET_CODE (recog_operand[i]) == PLUS
1900 || GET_CODE (recog_operand[i]) == MULT)
1901 recog_operand[i] = walk_alter_subreg (recog_operand[i]);
1904 for (i = 0; i < insn_n_dups[insn_code_number]; i++)
1906 if (GET_CODE (*recog_dup_loc[i]) == SUBREG)
1907 *recog_dup_loc[i] = alter_subreg (*recog_dup_loc[i]);
1908 else if (GET_CODE (*recog_dup_loc[i]) == PLUS
1909 || GET_CODE (*recog_dup_loc[i]) == MULT)
1910 *recog_dup_loc[i] = walk_alter_subreg (*recog_dup_loc[i]);
1913 #ifdef REGISTER_CONSTRAINTS
1914 if (! constrain_operands (insn_code_number, 1))
1915 fatal_insn_not_found (insn);
1918 /* Some target machines need to prescan each insn before
1921 #ifdef FINAL_PRESCAN_INSN
1922 FINAL_PRESCAN_INSN (insn, recog_operand,
1923 insn_n_operands[insn_code_number]);
1927 cc_prev_status = cc_status;
1929 /* Update `cc_status' for this instruction.
1930 The instruction's output routine may change it further.
1931 If the output routine for a jump insn needs to depend
1932 on the cc status, it should look at cc_prev_status. */
1934 NOTICE_UPDATE_CC (body, insn);
1939 /* If the proper template needs to be chosen by some C code,
1940 run that code and get the real template. */
1942 template = insn_template[insn_code_number];
1945 template = (*insn_outfun[insn_code_number]) (recog_operand, insn);
1947 /* If the C code returns 0, it means that it is a jump insn
1948 which follows a deleted test insn, and that test insn
1949 needs to be reinserted. */
1952 if (prev_nonnote_insn (insn) != last_ignored_compare)
1955 return prev_nonnote_insn (insn);
1959 /* If the template is the string "#", it means that this insn must
1961 if (template[0] == '#' && template[1] == '\0')
1963 rtx new = try_split (body, insn, 0);
1965 /* If we didn't split the insn, go away. */
1966 if (new == insn && PATTERN (new) == body)
1976 /* Output assembler code from the template. */
1978 output_asm_insn (template, recog_operand);
1981 /* It's not at all clear why we did this and doing so interferes
1982 with tests we'd like to do to use REG_WAS_0 notes, so let's try
1985 /* Mark this insn as having been output. */
1986 INSN_DELETED_P (insn) = 1;
1992 return NEXT_INSN (insn);
1995 /* Output debugging info to the assembler file FILE
1996 based on the NOTE-insn INSN, assumed to be a line number. */
1999 output_source_line (file, insn)
2003 char ltext_label_name[100];
2004 register char *filename = NOTE_SOURCE_FILE (insn);
2006 /* Remember filename for basic block profiling.
2007 Filenames are allocated on the permanent obstack
2008 or are passed in ARGV, so we don't have to save
2011 if (profile_block_flag && last_filename != filename)
2012 bb_file_label_num = add_bb_string (filename, TRUE);
2014 last_filename = filename;
2015 last_linenum = NOTE_LINE_NUMBER (insn);
2017 if (write_symbols != NO_DEBUG)
2019 #ifdef SDB_DEBUGGING_INFO
2020 if (write_symbols == SDB_DEBUG
2021 #if 0 /* People like having line numbers even in wrong file! */
2022 /* COFF can't handle multiple source files--lose, lose. */
2023 && !strcmp (filename, main_input_filename)
2025 /* COFF relative line numbers must be positive. */
2026 && last_linenum > sdb_begin_function_line)
2028 #ifdef ASM_OUTPUT_SOURCE_LINE
2029 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
2031 fprintf (file, "\t.ln\t%d\n",
2032 ((sdb_begin_function_line > -1)
2033 ? last_linenum - sdb_begin_function_line : 1));
2038 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
2039 if (write_symbols == DBX_DEBUG || write_symbols == XCOFF_DEBUG)
2040 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
2041 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
2043 #ifdef DWARF_DEBUGGING_INFO
2044 if (write_symbols == DWARF_DEBUG)
2045 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
2050 /* If X is a SUBREG, replace it with a REG or a MEM,
2051 based on the thing it is a subreg of. */
2057 register rtx y = SUBREG_REG (x);
2058 if (GET_CODE (y) == SUBREG)
2059 y = alter_subreg (y);
2061 if (GET_CODE (y) == REG)
2063 /* If the containing reg really gets a hard reg, so do we. */
2065 REGNO (x) = REGNO (y) + SUBREG_WORD (x);
2067 else if (GET_CODE (y) == MEM)
2069 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
2070 #if BYTES_BIG_ENDIAN
2071 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
2072 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
2075 MEM_VOLATILE_P (x) = MEM_VOLATILE_P (y);
2076 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
2082 /* Do alter_subreg on all the SUBREGs contained in X. */
2085 walk_alter_subreg (x)
2088 switch (GET_CODE (x))
2092 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
2093 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
2097 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
2101 return alter_subreg (x);
2109 /* Given BODY, the body of a jump instruction, alter the jump condition
2110 as required by the bits that are set in cc_status.flags.
2111 Not all of the bits there can be handled at this level in all cases.
2113 The value is normally 0.
2114 1 means that the condition has become always true.
2115 -1 means that the condition has become always false.
2116 2 means that COND has been altered. */
2124 if (cc_status.flags & CC_REVERSED)
2127 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
2130 if (cc_status.flags & CC_INVERTED)
2133 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
2136 if (cc_status.flags & CC_NOT_POSITIVE)
2137 switch (GET_CODE (cond))
2142 /* Jump becomes unconditional. */
2148 /* Jump becomes no-op. */
2152 PUT_CODE (cond, EQ);
2157 PUT_CODE (cond, NE);
2162 if (cc_status.flags & CC_NOT_NEGATIVE)
2163 switch (GET_CODE (cond))
2167 /* Jump becomes unconditional. */
2172 /* Jump becomes no-op. */
2177 PUT_CODE (cond, EQ);
2183 PUT_CODE (cond, NE);
2188 if (cc_status.flags & CC_NO_OVERFLOW)
2189 switch (GET_CODE (cond))
2192 /* Jump becomes unconditional. */
2196 PUT_CODE (cond, EQ);
2201 PUT_CODE (cond, NE);
2206 /* Jump becomes no-op. */
2210 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
2211 switch (GET_CODE (cond))
2224 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
2229 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
2234 if (cc_status.flags & CC_NOT_SIGNED)
2235 /* The flags are valid if signed condition operators are converted
2237 switch (GET_CODE (cond))
2240 PUT_CODE (cond, LEU);
2245 PUT_CODE (cond, LTU);
2250 PUT_CODE (cond, GTU);
2255 PUT_CODE (cond, GEU);
2264 /* Report inconsistency between the assembler template and the operands.
2265 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
2268 output_operand_lossage (str)
2271 if (this_is_asm_operands)
2272 error_for_asm (this_is_asm_operands, "invalid `asm': %s", str);
2277 /* Output of assembler code from a template, and its subroutines. */
2279 /* Output text from TEMPLATE to the assembler output file,
2280 obeying %-directions to substitute operands taken from
2281 the vector OPERANDS.
2283 %N (for N a digit) means print operand N in usual manner.
2284 %lN means require operand N to be a CODE_LABEL or LABEL_REF
2285 and print the label name with no punctuation.
2286 %cN means require operand N to be a constant
2287 and print the constant expression with no punctuation.
2288 %aN means expect operand N to be a memory address
2289 (not a memory reference!) and print a reference
2291 %nN means expect operand N to be a constant
2292 and print a constant expression for minus the value
2293 of the operand, with no other punctuation. */
2296 output_asm_insn (template, operands)
2303 /* An insn may return a null string template
2304 in a case where no assembler code is needed. */
2309 putc ('\t', asm_out_file);
2311 #ifdef ASM_OUTPUT_OPCODE
2312 ASM_OUTPUT_OPCODE (asm_out_file, p);
2317 #ifdef ASM_OUTPUT_OPCODE
2320 putc (c, asm_out_file);
2321 while ((c = *p) == '\t')
2323 putc (c, asm_out_file);
2326 ASM_OUTPUT_OPCODE (asm_out_file, p);
2331 putc (c, asm_out_file);
2334 /* %% outputs a single %. */
2338 putc (c, asm_out_file);
2340 /* %= outputs a number which is unique to each insn in the entire
2341 compilation. This is useful for making local labels that are
2342 referred to more than once in a given insn. */
2346 fprintf (asm_out_file, "%d", insn_counter);
2348 /* % followed by a letter and some digits
2349 outputs an operand in a special way depending on the letter.
2350 Letters `acln' are implemented directly.
2351 Other letters are passed to `output_operand' so that
2352 the PRINT_OPERAND macro can define them. */
2353 else if ((*p >= 'a' && *p <= 'z')
2354 || (*p >= 'A' && *p <= 'Z'))
2359 if (! (*p >= '0' && *p <= '9'))
2360 output_operand_lossage ("operand number missing after %-letter");
2361 else if (this_is_asm_operands && c >= (unsigned) insn_noperands)
2362 output_operand_lossage ("operand number out of range");
2363 else if (letter == 'l')
2364 output_asm_label (operands[c]);
2365 else if (letter == 'a')
2366 output_address (operands[c]);
2367 else if (letter == 'c')
2369 if (CONSTANT_ADDRESS_P (operands[c]))
2370 output_addr_const (asm_out_file, operands[c]);
2372 output_operand (operands[c], 'c');
2374 else if (letter == 'n')
2376 if (GET_CODE (operands[c]) == CONST_INT)
2377 fprintf (asm_out_file,
2378 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2383 - INTVAL (operands[c]));
2386 putc ('-', asm_out_file);
2387 output_addr_const (asm_out_file, operands[c]);
2391 output_operand (operands[c], letter);
2393 while ((c = *p) >= '0' && c <= '9') p++;
2395 /* % followed by a digit outputs an operand the default way. */
2396 else if (*p >= '0' && *p <= '9')
2399 if (this_is_asm_operands && c >= (unsigned) insn_noperands)
2400 output_operand_lossage ("operand number out of range");
2402 output_operand (operands[c], 0);
2403 while ((c = *p) >= '0' && c <= '9') p++;
2405 /* % followed by punctuation: output something for that
2406 punctuation character alone, with no operand.
2407 The PRINT_OPERAND macro decides what is actually done. */
2408 #ifdef PRINT_OPERAND_PUNCT_VALID_P
2409 else if (PRINT_OPERAND_PUNCT_VALID_P (*p))
2410 output_operand (NULL_RTX, *p++);
2413 output_operand_lossage ("invalid %%-code");
2417 if (flag_print_asm_name)
2419 /* Annotate the assembly with a comment describing the pattern and
2420 alternative used. */
2423 register int num = INSN_CODE (debug_insn);
2424 fprintf (asm_out_file, " %s %d %s",
2425 ASM_COMMENT_START, INSN_UID (debug_insn), insn_name[num]);
2426 if (insn_n_alternatives[num] > 1)
2427 fprintf (asm_out_file, "/%d", which_alternative + 1);
2429 /* Clear this so only the first assembler insn
2430 of any rtl insn will get the special comment for -dp. */
2435 putc ('\n', asm_out_file);
2438 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
2441 output_asm_label (x)
2446 if (GET_CODE (x) == LABEL_REF)
2447 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
2448 else if (GET_CODE (x) == CODE_LABEL)
2449 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
2451 output_operand_lossage ("`%l' operand isn't a label");
2453 assemble_name (asm_out_file, buf);
2456 /* Print operand X using machine-dependent assembler syntax.
2457 The macro PRINT_OPERAND is defined just to control this function.
2458 CODE is a non-digit that preceded the operand-number in the % spec,
2459 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
2460 between the % and the digits.
2461 When CODE is a non-letter, X is 0.
2463 The meanings of the letters are machine-dependent and controlled
2464 by PRINT_OPERAND. */
2467 output_operand (x, code)
2471 if (x && GET_CODE (x) == SUBREG)
2472 x = alter_subreg (x);
2474 /* If X is a pseudo-register, abort now rather than writing trash to the
2477 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
2480 PRINT_OPERAND (asm_out_file, x, code);
2483 /* Print a memory reference operand for address X
2484 using machine-dependent assembler syntax.
2485 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
2491 walk_alter_subreg (x);
2492 PRINT_OPERAND_ADDRESS (asm_out_file, x);
2495 /* Print an integer constant expression in assembler syntax.
2496 Addition and subtraction are the only arithmetic
2497 that may appear in these expressions. */
2500 output_addr_const (file, x)
2507 switch (GET_CODE (x))
2517 assemble_name (file, XSTR (x, 0));
2521 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
2522 assemble_name (file, buf);
2526 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
2527 assemble_name (file, buf);
2532 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2541 /* This used to output parentheses around the expression,
2542 but that does not work on the 386 (either ATT or BSD assembler). */
2543 output_addr_const (file, XEXP (x, 0));
2547 if (GET_MODE (x) == VOIDmode)
2549 /* We can use %d if the number is one word and positive. */
2550 if (CONST_DOUBLE_HIGH (x))
2552 #if HOST_BITS_PER_WIDE_INT == 64
2553 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
2559 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
2565 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
2566 else if (CONST_DOUBLE_LOW (x) < 0)
2568 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2573 CONST_DOUBLE_LOW (x));
2576 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2581 CONST_DOUBLE_LOW (x));
2584 /* We can't handle floating point constants;
2585 PRINT_OPERAND must handle them. */
2586 output_operand_lossage ("floating constant misused");
2590 /* Some assemblers need integer constants to appear last (eg masm). */
2591 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
2593 output_addr_const (file, XEXP (x, 1));
2594 if (INTVAL (XEXP (x, 0)) >= 0)
2595 fprintf (file, "+");
2596 output_addr_const (file, XEXP (x, 0));
2600 output_addr_const (file, XEXP (x, 0));
2601 if (INTVAL (XEXP (x, 1)) >= 0)
2602 fprintf (file, "+");
2603 output_addr_const (file, XEXP (x, 1));
2608 /* Avoid outputting things like x-x or x+5-x,
2609 since some assemblers can't handle that. */
2610 x = simplify_subtraction (x);
2611 if (GET_CODE (x) != MINUS)
2614 output_addr_const (file, XEXP (x, 0));
2615 fprintf (file, "-");
2616 if (GET_CODE (XEXP (x, 1)) == CONST_INT
2617 && INTVAL (XEXP (x, 1)) < 0)
2619 fprintf (file, ASM_OPEN_PAREN);
2620 output_addr_const (file, XEXP (x, 1));
2621 fprintf (file, ASM_CLOSE_PAREN);
2624 output_addr_const (file, XEXP (x, 1));
2629 output_addr_const (file, XEXP (x, 0));
2633 output_operand_lossage ("invalid expression as operand");
2637 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
2638 %R prints the value of REGISTER_PREFIX.
2639 %L prints the value of LOCAL_LABEL_PREFIX.
2640 %U prints the value of USER_LABEL_PREFIX.
2641 %I prints the value of IMMEDIATE_PREFIX.
2642 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
2643 Also supported are %d, %x, %s, %e, %f, %g and %%. */
2646 asm_fprintf (va_alist)
2656 file = va_arg (argptr, FILE *);
2657 p = va_arg (argptr, char *);
2666 while ((c >= '0' && c <= '9') || c == '.')
2674 fprintf (file, "%%");
2677 case 'd': case 'i': case 'u':
2678 case 'x': case 'p': case 'X':
2682 fprintf (file, buf, va_arg (argptr, int));
2686 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
2687 but we do not check for those cases. It means that the value
2688 is a HOST_WIDE_INT, which may be either `int' or `long'. */
2690 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
2696 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
2703 fprintf (file, buf, va_arg (argptr, long));
2711 fprintf (file, buf, va_arg (argptr, double));
2717 fprintf (file, buf, va_arg (argptr, char *));
2721 #ifdef ASM_OUTPUT_OPCODE
2722 ASM_OUTPUT_OPCODE (asm_out_file, p);
2727 #ifdef REGISTER_PREFIX
2728 fprintf (file, "%s", REGISTER_PREFIX);
2733 #ifdef IMMEDIATE_PREFIX
2734 fprintf (file, "%s", IMMEDIATE_PREFIX);
2739 #ifdef LOCAL_LABEL_PREFIX
2740 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
2745 #ifdef USER_LABEL_PREFIX
2746 fprintf (file, "%s", USER_LABEL_PREFIX);
2760 /* Split up a CONST_DOUBLE or integer constant rtx
2761 into two rtx's for single words,
2762 storing in *FIRST the word that comes first in memory in the target
2763 and in *SECOND the other. */
2766 split_double (value, first, second)
2768 rtx *first, *second;
2770 if (GET_CODE (value) == CONST_INT)
2772 /* The rule for using CONST_INT for a wider mode
2773 is that we regard the value as signed.
2774 So sign-extend it. */
2775 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
2776 #if WORDS_BIG_ENDIAN
2784 else if (GET_CODE (value) != CONST_DOUBLE)
2786 #if WORDS_BIG_ENDIAN
2787 *first = const0_rtx;
2791 *second = const0_rtx;
2794 else if (GET_MODE (value) == VOIDmode
2795 /* This is the old way we did CONST_DOUBLE integers. */
2796 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
2798 /* In an integer, the words are defined as most and least significant.
2799 So order them by the target's convention. */
2800 #if WORDS_BIG_ENDIAN
2801 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
2802 *second = GEN_INT (CONST_DOUBLE_LOW (value));
2804 *first = GEN_INT (CONST_DOUBLE_LOW (value));
2805 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
2810 #ifdef REAL_ARITHMETIC
2811 REAL_VALUE_TYPE r; HOST_WIDE_INT l[2];
2812 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
2813 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
2814 *first = GEN_INT (l[0]);
2815 *second = GEN_INT (l[1]);
2817 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
2818 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
2819 && ! flag_pretend_float)
2822 #if defined (HOST_WORDS_BIG_ENDIAN) == WORDS_BIG_ENDIAN
2823 /* Host and target agree => no need to swap. */
2824 *first = GEN_INT (CONST_DOUBLE_LOW (value));
2825 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
2827 *second = GEN_INT (CONST_DOUBLE_LOW (value));
2828 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
2830 #endif /* no REAL_ARITHMETIC */
2834 /* Return nonzero if this function has no function calls. */
2841 if (profile_flag || profile_block_flag)
2844 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
2846 if (GET_CODE (insn) == CALL_INSN)
2848 if (GET_CODE (insn) == INSN
2849 && GET_CODE (PATTERN (insn)) == SEQUENCE
2850 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN)
2853 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
2855 if (GET_CODE (XEXP (insn, 0)) == CALL_INSN)
2857 if (GET_CODE (XEXP (insn, 0)) == INSN
2858 && GET_CODE (PATTERN (XEXP (insn, 0))) == SEQUENCE
2859 && GET_CODE (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)) == CALL_INSN)
2866 /* On some machines, a function with no call insns
2867 can run faster if it doesn't create its own register window.
2868 When output, the leaf function should use only the "output"
2869 registers. Ordinarily, the function would be compiled to use
2870 the "input" registers to find its arguments; it is a candidate
2871 for leaf treatment if it uses only the "input" registers.
2872 Leaf function treatment means renumbering so the function
2873 uses the "output" registers instead. */
2875 #ifdef LEAF_REGISTERS
2877 static char permitted_reg_in_leaf_functions[] = LEAF_REGISTERS;
2879 /* Return 1 if this function uses only the registers that can be
2880 safely renumbered. */
2883 only_leaf_regs_used ()
2887 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
2889 if ((regs_ever_live[i] || global_regs[i])
2890 && ! permitted_reg_in_leaf_functions[i])
2896 /* Scan all instructions and renumber all registers into those
2897 available in leaf functions. */
2900 leaf_renumber_regs (first)
2905 /* Renumber only the actual patterns.
2906 The reg-notes can contain frame pointer refs,
2907 and renumbering them could crash, and should not be needed. */
2908 for (insn = first; insn; insn = NEXT_INSN (insn))
2909 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
2910 leaf_renumber_regs_insn (PATTERN (insn));
2911 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
2912 if (GET_RTX_CLASS (GET_CODE (XEXP (insn, 0))) == 'i')
2913 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
2916 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
2917 available in leaf functions. */
2920 leaf_renumber_regs_insn (in_rtx)
2921 register rtx in_rtx;
2924 register char *format_ptr;
2929 /* Renumber all input-registers into output-registers.
2930 renumbered_regs would be 1 for an output-register;
2933 if (GET_CODE (in_rtx) == REG)
2937 /* Don't renumber the same reg twice. */
2941 newreg = REGNO (in_rtx);
2942 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
2943 to reach here as part of a REG_NOTE. */
2944 if (newreg >= FIRST_PSEUDO_REGISTER)
2949 newreg = LEAF_REG_REMAP (newreg);
2952 regs_ever_live[REGNO (in_rtx)] = 0;
2953 regs_ever_live[newreg] = 1;
2954 REGNO (in_rtx) = newreg;
2958 if (GET_RTX_CLASS (GET_CODE (in_rtx)) == 'i')
2960 /* Inside a SEQUENCE, we find insns.
2961 Renumber just the patterns of these insns,
2962 just as we do for the top-level insns. */
2963 leaf_renumber_regs_insn (PATTERN (in_rtx));
2967 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
2969 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
2970 switch (*format_ptr++)
2973 leaf_renumber_regs_insn (XEXP (in_rtx, i));
2977 if (NULL != XVEC (in_rtx, i))
2979 for (j = 0; j < XVECLEN (in_rtx, i); j++)
2980 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));