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"
72 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
73 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
74 #if defined (USG) || defined (NO_STAB_H)
75 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
77 #include <stab.h> /* On BSD, use the system's stab.h. */
79 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
81 #ifdef XCOFF_DEBUGGING_INFO
85 /* .stabd code for line number. */
90 /* .stabs code for included file name. */
96 #define INT_TYPE_SIZE BITS_PER_WORD
99 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
100 null default for it to save conditionalization later. */
101 #ifndef CC_STATUS_INIT
102 #define CC_STATUS_INIT
105 /* How to start an assembler comment. */
106 #ifndef ASM_COMMENT_START
107 #define ASM_COMMENT_START ";#"
110 /* Is the given character a logical line separator for the assembler? */
111 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
112 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
115 /* Nonzero means this function is a leaf function, with no function calls.
116 This variable exists to be examined in FUNCTION_PROLOGUE
117 and FUNCTION_EPILOGUE. Always zero, unless set by some action. */
120 /* Last insn processed by final_scan_insn. */
121 static rtx debug_insn = 0;
123 /* Line number of last NOTE. */
124 static int last_linenum;
126 /* Highest line number in current block. */
127 static int high_block_linenum;
129 /* Likewise for function. */
130 static int high_function_linenum;
132 /* Filename of last NOTE. */
133 static char *last_filename;
135 /* Number of basic blocks seen so far;
136 used if profile_block_flag is set. */
137 static int count_basic_blocks;
139 /* Nonzero while outputting an `asm' with operands.
140 This means that inconsistencies are the user's fault, so don't abort.
141 The precise value is the insn being output, to pass to error_for_asm. */
142 static rtx this_is_asm_operands;
144 /* Number of operands of this insn, for an `asm' with operands. */
145 static int insn_noperands;
147 /* Compare optimization flag. */
149 static rtx last_ignored_compare = 0;
151 /* Flag indicating this insn is the start of a new basic block. */
153 static int new_block = 1;
155 /* All the symbol-blocks (levels of scoping) in the compilation
156 are assigned sequence numbers in order of appearance of the
157 beginnings of the symbol-blocks. Both final and dbxout do this,
158 and assume that they will both give the same number to each block.
159 Final uses these sequence numbers to generate assembler label names
160 LBBnnn and LBEnnn for the beginning and end of the symbol-block.
161 Dbxout uses the sequence numbers to generate references to the same labels
162 from the dbx debugging information.
164 Sdb records this level at the beginning of each function,
165 in order to find the current level when recursing down declarations.
166 It outputs the block beginning and endings
167 at the point in the asm file where the blocks would begin and end. */
169 int next_block_index;
171 /* Assign a unique number to each insn that is output.
172 This can be used to generate unique local labels. */
174 static int insn_counter = 0;
177 /* This variable contains machine-dependent flags (defined in tm.h)
178 set and examined by output routines
179 that describe how to interpret the condition codes properly. */
183 /* During output of an insn, this contains a copy of cc_status
184 from before the insn. */
186 CC_STATUS cc_prev_status;
189 /* Indexed by hardware reg number, is 1 if that register is ever
190 used in the current function.
192 In life_analysis, or in stupid_life_analysis, this is set
193 up to record the hard regs used explicitly. Reload adds
194 in the hard regs used for holding pseudo regs. Final uses
195 it to generate the code in the function prologue and epilogue
196 to save and restore registers as needed. */
198 char regs_ever_live[FIRST_PSEUDO_REGISTER];
200 /* Nonzero means current function must be given a frame pointer.
201 Set in stmt.c if anything is allocated on the stack there.
202 Set in reload1.c if anything is allocated on the stack there. */
204 int frame_pointer_needed;
206 /* Assign unique numbers to labels generated for profiling. */
208 int profile_label_no;
210 /* Length so far allocated in PENDING_BLOCKS. */
212 static int max_block_depth;
214 /* Stack of sequence numbers of symbol-blocks of which we have seen the
215 beginning but not yet the end. Sequence numbers are assigned at
216 the beginning; this stack allows us to find the sequence number
217 of a block that is ending. */
219 static int *pending_blocks;
221 /* Number of elements currently in use in PENDING_BLOCKS. */
223 static int block_depth;
225 /* Nonzero if have enabled APP processing of our assembler output. */
229 /* If we are outputting an insn sequence, this contains the sequence rtx.
234 #ifdef ASSEMBLER_DIALECT
236 /* Number of the assembler dialect to use, starting at 0. */
237 static int dialect_number;
240 /* Indexed by line number, nonzero if there is a note for that line. */
242 static char *line_note_exists;
244 /* Linked list to hold line numbers for each basic block. */
247 struct bb_list *next; /* pointer to next basic block */
248 int line_num; /* line number */
249 int file_label_num; /* LPBC<n> label # for stored filename */
250 int func_label_num; /* LPBC<n> label # for stored function name */
253 static struct bb_list *bb_head = 0; /* Head of basic block list */
254 static struct bb_list **bb_tail = &bb_head; /* Ptr to store next bb ptr */
255 static int bb_file_label_num = -1; /* Current label # for file */
256 static int bb_func_label_num = -1; /* Current label # for func */
258 /* Linked list to hold the strings for each file and function name output. */
261 struct bb_str *next; /* pointer to next string */
262 char *string; /* string */
263 int label_num; /* label number */
264 int length; /* string length */
267 extern rtx peephole PROTO((rtx));
269 static struct bb_str *sbb_head = 0; /* Head of string list. */
270 static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */
271 static int sbb_label_num = 0; /* Last label used */
273 static int asm_insn_count PROTO((rtx));
274 static void profile_function PROTO((FILE *));
275 static void profile_after_prologue PROTO((FILE *));
276 static void add_bb PROTO((FILE *));
277 static int add_bb_string PROTO((char *, int));
278 static void output_source_line PROTO((FILE *, rtx));
279 static rtx walk_alter_subreg PROTO((rtx));
280 static int alter_cond PROTO((rtx));
281 static void output_asm_name PROTO((void));
282 static void output_operand PROTO((rtx, int));
283 static void leaf_renumber_regs PROTO((rtx));
285 extern char *getpwd ();
287 /* Initialize data in final at the beginning of a compilation. */
290 init_final (filename)
293 next_block_index = 2;
295 max_block_depth = 20;
296 pending_blocks = (int *) xmalloc (20 * sizeof *pending_blocks);
299 #ifdef ASSEMBLER_DIALECT
300 dialect_number = ASSEMBLER_DIALECT;
304 /* Called at end of source file,
305 to output the block-profiling table for this entire compilation. */
313 if (profile_block_flag)
316 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
317 int size = (POINTER_SIZE / BITS_PER_UNIT) * count_basic_blocks;
322 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
323 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
324 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
328 /* Output the main header, of 11 words:
329 0: 1 if this file is initialized, else 0.
330 1: address of file name (LPBX1).
331 2: address of table of counts (LPBX2).
332 3: number of counts in the table.
333 4: always 0, for compatibility with Sun.
335 The following are GNU extensions:
337 5: address of table of start addrs of basic blocks (LPBX3).
338 6: Number of bytes in this header.
339 7: address of table of function names (LPBX4).
340 8: address of table of line numbers (LPBX5) or 0.
341 9: address of table of file names (LPBX6) or 0.
342 10: space reserved for basic block profiling. */
344 ASM_OUTPUT_ALIGN (asm_out_file, align);
346 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
348 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
350 /* address of filename */
351 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
352 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
354 /* address of count table */
355 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
356 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
358 /* count of the # of basic blocks */
359 assemble_integer (GEN_INT (count_basic_blocks), UNITS_PER_WORD, 1);
361 /* zero word (link field) */
362 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
364 /* address of basic block start address table */
365 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
366 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
368 /* byte count for extended structure. */
369 assemble_integer (GEN_INT (11 * UNITS_PER_WORD), UNITS_PER_WORD, 1);
371 /* address of function name table */
372 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
373 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
375 /* address of line number and filename tables if debugging. */
376 if (write_symbols != NO_DEBUG)
378 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
379 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
380 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
381 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
385 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
386 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
389 /* space for extension ptr (link field) */
390 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
392 /* Output the file name changing the suffix to .d for Sun tcov
394 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
396 char *cwd = getpwd ();
397 int len = strlen (filename) + strlen (cwd) + 1;
398 char *data_file = (char *) alloca (len + 4);
400 strcpy (data_file, cwd);
401 strcat (data_file, "/");
402 strcat (data_file, filename);
403 strip_off_ending (data_file, len);
404 strcat (data_file, ".d");
405 assemble_string (data_file, strlen (data_file) + 1);
408 /* Make space for the table of counts. */
411 /* Realign data section. */
412 ASM_OUTPUT_ALIGN (asm_out_file, align);
413 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
415 assemble_zeros (size);
419 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
420 #ifdef ASM_OUTPUT_SHARED_LOCAL
421 if (flag_shared_data)
422 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
425 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
426 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
429 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
433 /* Output any basic block strings */
434 readonly_data_section ();
437 ASM_OUTPUT_ALIGN (asm_out_file, align);
438 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
440 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC", sptr->label_num);
441 assemble_string (sptr->string, sptr->length);
445 /* Output the table of addresses. */
446 /* Realign in new section */
447 ASM_OUTPUT_ALIGN (asm_out_file, align);
448 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
449 for (i = 0; i < count_basic_blocks; i++)
451 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
452 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name),
456 /* Output the table of function names. */
457 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
458 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
460 if (ptr->func_label_num >= 0)
462 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC", ptr->func_label_num);
463 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name),
467 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
470 for ( ; i < count_basic_blocks; i++)
471 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
473 if (write_symbols != NO_DEBUG)
475 /* Output the table of line numbers. */
476 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
477 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
478 assemble_integer (GEN_INT (ptr->line_num), UNITS_PER_WORD, 1);
480 for ( ; i < count_basic_blocks; i++)
481 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
483 /* Output the table of file names. */
484 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
485 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
487 if (ptr->file_label_num >= 0)
489 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC", ptr->file_label_num);
490 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name),
494 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
497 for ( ; i < count_basic_blocks; i++)
498 assemble_integer (const0_rtx, UNITS_PER_WORD, 1);
501 /* End with the address of the table of addresses,
502 so we can find it easily, as the last word in the file's text. */
503 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
504 assemble_integer (gen_rtx (SYMBOL_REF, Pmode, name), UNITS_PER_WORD, 1);
508 /* Enable APP processing of subsequent output.
509 Used before the output from an `asm' statement. */
516 fprintf (asm_out_file, ASM_APP_ON);
521 /* Disable APP processing of subsequent output.
522 Called from varasm.c before most kinds of output. */
529 fprintf (asm_out_file, ASM_APP_OFF);
534 /* Return the number of slots filled in the current
535 delayed branch sequence (we don't count the insn needing the
536 delay slot). Zero if not in a delayed branch sequence. */
540 dbr_sequence_length ()
542 if (final_sequence != 0)
543 return XVECLEN (final_sequence, 0) - 1;
549 /* The next two pages contain routines used to compute the length of an insn
550 and to shorten branches. */
552 /* Arrays for insn lengths, and addresses. The latter is referenced by
553 `insn_current_length'. */
555 static short *insn_lengths;
558 /* Address of insn being processed. Used by `insn_current_length'. */
559 int insn_current_address;
561 /* Indicate that branch shortening hasn't yet been done. */
569 /* Obtain the current length of an insn. If branch shortening has been done,
570 get its actual length. Otherwise, get its maximum length. */
573 get_attr_length (insn)
576 #ifdef HAVE_ATTR_length
582 return insn_lengths[INSN_UID (insn)];
584 switch (GET_CODE (insn))
592 length = insn_default_length (insn);
596 body = PATTERN (insn);
597 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
599 /* This only takes room if jump tables go into the text section. */
600 #if !defined(READONLY_DATA_SECTION) || defined(JUMP_TABLES_IN_TEXT_SECTION)
601 length = (XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC)
602 * GET_MODE_SIZE (GET_MODE (body)));
604 /* Be pessimistic and assume worst-case alignment. */
605 length += (GET_MODE_SIZE (GET_MODE (body)) - 1);
611 length = insn_default_length (insn);
615 body = PATTERN (insn);
616 if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
619 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
620 length = asm_insn_count (body) * insn_default_length (insn);
621 else if (GET_CODE (body) == SEQUENCE)
622 for (i = 0; i < XVECLEN (body, 0); i++)
623 length += get_attr_length (XVECEXP (body, 0, i));
625 length = insn_default_length (insn);
628 #ifdef ADJUST_INSN_LENGTH
629 ADJUST_INSN_LENGTH (insn, length);
632 #else /* not HAVE_ATTR_length */
634 #endif /* not HAVE_ATTR_length */
637 /* Make a pass over all insns and compute their actual lengths by shortening
638 any branches of variable length if possible. */
640 /* Give a default value for the lowest address in a function. */
642 #ifndef FIRST_INSN_ADDRESS
643 #define FIRST_INSN_ADDRESS 0
647 shorten_branches (first)
650 #ifdef HAVE_ATTR_length
652 int something_changed = 1;
654 char *varying_length;
658 /* Compute maximum UID and allocate arrays. */
659 for (insn = first; insn; insn = NEXT_INSN (insn))
660 if (INSN_UID (insn) > max_uid)
661 max_uid = INSN_UID (insn);
664 insn_lengths = (short *) oballoc (max_uid * sizeof (short));
665 insn_addresses = (int *) oballoc (max_uid * sizeof (int));
666 varying_length = (char *) oballoc (max_uid * sizeof (char));
668 /* Compute initial lengths, addresses, and varying flags for each insn. */
669 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
671 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
673 uid = INSN_UID (insn);
674 insn_addresses[uid] = insn_current_address;
675 insn_lengths[uid] = 0;
676 varying_length[uid] = 0;
678 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
679 || GET_CODE (insn) == CODE_LABEL)
682 body = PATTERN (insn);
683 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
685 /* This only takes room if read-only data goes into the text
687 #if !defined(READONLY_DATA_SECTION) || defined(JUMP_TABLES_IN_TEXT_SECTION)
688 int unitsize = GET_MODE_SIZE (GET_MODE (body));
690 insn_lengths[uid] = (XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC)
691 * GET_MODE_SIZE (GET_MODE (body)));
693 /* Account for possible alignment. */
695 += unitsize - (insn_current_address & (unitsize - 1));
700 else if (asm_noperands (body) >= 0)
701 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
702 else if (GET_CODE (body) == SEQUENCE)
705 int const_delay_slots;
707 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
709 const_delay_slots = 0;
711 /* Inside a delay slot sequence, we do not do any branch shortening
712 if the shortening could change the number of delay slots
714 for (i = 0; i < XVECLEN (body, 0); i++)
716 rtx inner_insn = XVECEXP (body, 0, i);
717 int inner_uid = INSN_UID (inner_insn);
720 if (asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
721 inner_length = (asm_insn_count (PATTERN (inner_insn))
722 * insn_default_length (inner_insn));
724 inner_length = insn_default_length (inner_insn);
726 insn_lengths[inner_uid] = inner_length;
727 if (const_delay_slots)
729 if ((varying_length[inner_uid]
730 = insn_variable_length_p (inner_insn)) != 0)
731 varying_length[uid] = 1;
732 insn_addresses[inner_uid] = (insn_current_address +
736 varying_length[inner_uid] = 0;
737 insn_lengths[uid] += inner_length;
740 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
742 insn_lengths[uid] = insn_default_length (insn);
743 varying_length[uid] = insn_variable_length_p (insn);
746 /* If needed, do any adjustment. */
747 #ifdef ADJUST_INSN_LENGTH
748 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
752 /* Now loop over all the insns finding varying length insns. For each,
753 get the current insn length. If it has changed, reflect the change.
754 When nothing changes for a full pass, we are done. */
756 while (something_changed)
758 something_changed = 0;
759 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
761 insn = NEXT_INSN (insn))
766 uid = INSN_UID (insn);
767 insn_addresses[uid] = insn_current_address;
768 if (! varying_length[uid])
770 insn_current_address += insn_lengths[uid];
773 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
777 body = PATTERN (insn);
779 for (i = 0; i < XVECLEN (body, 0); i++)
781 rtx inner_insn = XVECEXP (body, 0, i);
782 int inner_uid = INSN_UID (inner_insn);
785 insn_addresses[inner_uid] = insn_current_address;
787 /* insn_current_length returns 0 for insns with a
788 non-varying length. */
789 if (! varying_length[inner_uid])
790 inner_length = insn_lengths[inner_uid];
792 inner_length = insn_current_length (inner_insn);
794 if (inner_length != insn_lengths[inner_uid])
796 insn_lengths[inner_uid] = inner_length;
797 something_changed = 1;
799 insn_current_address += insn_lengths[inner_uid];
800 new_length += inner_length;
805 new_length = insn_current_length (insn);
806 insn_current_address += new_length;
809 #ifdef SHORTEN_WITH_ADJUST_INSN_LENGTH
810 #ifdef ADJUST_INSN_LENGTH
811 /* If needed, do any adjustment. */
812 tmp_length = new_length;
813 ADJUST_INSN_LENGTH (insn, new_length);
814 insn_current_address += (new_length - tmp_length);
818 if (new_length != insn_lengths[uid])
820 insn_lengths[uid] = new_length;
821 something_changed = 1;
824 /* For a non-optimizing compile, do only a single pass. */
828 #endif /* HAVE_ATTR_length */
831 #ifdef HAVE_ATTR_length
832 /* Given the body of an INSN known to be generated by an ASM statement, return
833 the number of machine instructions likely to be generated for this insn.
834 This is used to compute its length. */
837 asm_insn_count (body)
843 if (GET_CODE (body) == ASM_INPUT)
844 template = XSTR (body, 0);
846 template = decode_asm_operands (body, NULL_PTR, NULL_PTR,
849 for ( ; *template; template++)
850 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
857 /* Output assembler code for the start of a function,
858 and initialize some of the variables in this file
859 for the new function. The label for the function and associated
860 assembler pseudo-ops have already been output in `assemble_start_function'.
862 FIRST is the first insn of the rtl for the function being compiled.
863 FILE is the file to write assembler code to.
864 OPTIMIZE is nonzero if we should eliminate redundant
865 test and compare insns. */
868 final_start_function (first, file, optimize)
875 this_is_asm_operands = 0;
877 #ifdef NON_SAVING_SETJMP
878 /* A function that calls setjmp should save and restore all the
879 call-saved registers on a system where longjmp clobbers them. */
880 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
884 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
885 if (!call_used_regs[i] && !call_fixed_regs[i])
886 regs_ever_live[i] = 1;
890 /* Initial line number is supposed to be output
891 before the function's prologue and label
892 so that the function's address will not appear to be
893 in the last statement of the preceding function. */
894 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
895 last_linenum = high_block_linenum = high_function_linenum
896 = NOTE_LINE_NUMBER (first);
898 #ifdef DWARF2_DEBUGGING_INFO
899 /* Output DWARF definition of the function. */
900 if (write_symbols == DWARF2_DEBUG)
901 dwarf2out_begin_prologue ();
904 /* For SDB and XCOFF, the function beginning must be marked between
905 the function label and the prologue. We always need this, even when
906 -g1 was used. Defer on MIPS systems so that parameter descriptions
907 follow function entry. */
908 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
909 if (write_symbols == SDB_DEBUG)
910 sdbout_begin_function (last_linenum);
913 #ifdef XCOFF_DEBUGGING_INFO
914 if (write_symbols == XCOFF_DEBUG)
915 xcoffout_begin_function (file, last_linenum);
918 /* But only output line number for other debug info types if -g2
920 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
921 output_source_line (file, first);
923 #ifdef LEAF_REG_REMAP
925 leaf_renumber_regs (first);
928 /* The Sun386i and perhaps other machines don't work right
929 if the profiling code comes after the prologue. */
930 #ifdef PROFILE_BEFORE_PROLOGUE
932 profile_function (file);
933 #endif /* PROFILE_BEFORE_PROLOGUE */
935 #ifdef FUNCTION_PROLOGUE
936 /* First output the function prologue: code to set up the stack frame. */
937 FUNCTION_PROLOGUE (file, get_frame_size ());
940 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
941 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
942 next_block_index = 1;
945 /* If the machine represents the prologue as RTL, the profiling code must
946 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
950 profile_after_prologue (file);
954 /* If we are doing basic block profiling, remember a printable version
955 of the function name. */
956 if (profile_block_flag)
959 add_bb_string ((*decl_printable_name) (current_function_decl, 2), FALSE);
964 profile_after_prologue (file)
967 #ifdef FUNCTION_BLOCK_PROFILER
968 if (profile_block_flag)
970 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
972 #endif /* FUNCTION_BLOCK_PROFILER */
974 #ifndef PROFILE_BEFORE_PROLOGUE
976 profile_function (file);
977 #endif /* not PROFILE_BEFORE_PROLOGUE */
981 profile_function (file)
984 int align = MIN (BIGGEST_ALIGNMENT, POINTER_SIZE);
985 int sval = current_function_returns_struct;
986 int cxt = current_function_needs_context;
989 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
990 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
991 assemble_integer (const0_rtx, POINTER_SIZE / BITS_PER_UNIT, 1);
995 #ifdef STRUCT_VALUE_INCOMING_REGNUM
997 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
999 #ifdef STRUCT_VALUE_REGNUM
1001 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1006 #ifdef STATIC_CHAIN_INCOMING_REGNUM
1008 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1010 #ifdef STATIC_CHAIN_REGNUM
1012 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1017 FUNCTION_PROFILER (file, profile_label_no);
1020 #ifdef STATIC_CHAIN_INCOMING_REGNUM
1022 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1024 #ifdef STATIC_CHAIN_REGNUM
1026 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1031 #ifdef STRUCT_VALUE_INCOMING_REGNUM
1033 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1035 #ifdef STRUCT_VALUE_REGNUM
1037 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1042 /* Output assembler code for the end of a function.
1043 For clarity, args are same as those of `final_start_function'
1044 even though not all of them are needed. */
1047 final_end_function (first, file, optimize)
1054 fprintf (file, ASM_APP_OFF);
1058 #ifdef SDB_DEBUGGING_INFO
1059 if (write_symbols == SDB_DEBUG)
1060 sdbout_end_function (high_function_linenum);
1063 #ifdef DWARF_DEBUGGING_INFO
1064 if (write_symbols == DWARF_DEBUG)
1065 dwarfout_end_function ();
1068 #ifdef XCOFF_DEBUGGING_INFO
1069 if (write_symbols == XCOFF_DEBUG)
1070 xcoffout_end_function (file, high_function_linenum);
1073 #ifdef FUNCTION_EPILOGUE
1074 /* Finally, output the function epilogue:
1075 code to restore the stack frame and return to the caller. */
1076 FUNCTION_EPILOGUE (file, get_frame_size ());
1079 #ifdef SDB_DEBUGGING_INFO
1080 if (write_symbols == SDB_DEBUG)
1081 sdbout_end_epilogue ();
1084 #ifdef DWARF_DEBUGGING_INFO
1085 if (write_symbols == DWARF_DEBUG)
1086 dwarfout_end_epilogue ();
1089 #ifdef DWARF2_DEBUGGING_INFO
1090 if (write_symbols == DWARF2_DEBUG)
1091 dwarf2out_end_epilogue ();
1094 #ifdef XCOFF_DEBUGGING_INFO
1095 if (write_symbols == XCOFF_DEBUG)
1096 xcoffout_end_epilogue (file);
1099 bb_func_label_num = -1; /* not in function, nuke label # */
1101 /* If FUNCTION_EPILOGUE is not defined, then the function body
1102 itself contains return instructions wherever needed. */
1105 /* Add a block to the linked list that remembers the current line/file/function
1106 for basic block profiling. Emit the label in front of the basic block and
1107 the instructions that increment the count field. */
1113 struct bb_list *ptr = (struct bb_list *) permalloc (sizeof (struct bb_list));
1115 /* Add basic block to linked list. */
1117 ptr->line_num = last_linenum;
1118 ptr->file_label_num = bb_file_label_num;
1119 ptr->func_label_num = bb_func_label_num;
1121 bb_tail = &ptr->next;
1123 /* Enable the table of basic-block use counts
1124 to point at the code it applies to. */
1125 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1127 /* Before first insn of this basic block, increment the
1128 count of times it was entered. */
1129 #ifdef BLOCK_PROFILER
1130 BLOCK_PROFILER (file, count_basic_blocks);
1135 count_basic_blocks++;
1138 /* Add a string to be used for basic block profiling. */
1141 add_bb_string (string, perm_p)
1146 struct bb_str *ptr = 0;
1150 string = "<unknown>";
1154 /* Allocate a new string if the current string isn't permanent. If
1155 the string is permanent search for the same string in other
1158 len = strlen (string) + 1;
1161 char *p = (char *) permalloc (len);
1162 bcopy (string, p, len);
1166 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1167 if (ptr->string == string)
1170 /* Allocate a new string block if we need to. */
1173 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1176 ptr->label_num = sbb_label_num++;
1177 ptr->string = string;
1179 sbb_tail = &ptr->next;
1182 return ptr->label_num;
1186 /* Output assembler code for some insns: all or part of a function.
1187 For description of args, see `final_start_function', above.
1189 PRESCAN is 1 if we are not really outputting,
1190 just scanning as if we were outputting.
1191 Prescanning deletes and rearranges insns just like ordinary output.
1192 PRESCAN is -2 if we are outputting after having prescanned.
1193 In this case, don't try to delete or rearrange insns
1194 because that has already been done.
1195 Prescanning is done only on certain machines. */
1198 final (first, file, optimize, prescan)
1207 last_ignored_compare = 0;
1210 #if defined (DWARF2_DEBUGGING_INFO) && defined (HAVE_prologue)
1211 dwarf2out_frame_debug (NULL_RTX);
1214 check_exception_handler_labels ();
1216 /* Make a map indicating which line numbers appear in this function.
1217 When producing SDB debugging info, delete troublesome line number
1218 notes from inlined functions in other files as well as duplicate
1219 line number notes. */
1220 #ifdef SDB_DEBUGGING_INFO
1221 if (write_symbols == SDB_DEBUG)
1224 for (insn = first; insn; insn = NEXT_INSN (insn))
1225 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1227 if ((RTX_INTEGRATED_P (insn)
1228 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1230 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1231 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1233 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1234 NOTE_SOURCE_FILE (insn) = 0;
1238 if (NOTE_LINE_NUMBER (insn) > max_line)
1239 max_line = NOTE_LINE_NUMBER (insn);
1245 for (insn = first; insn; insn = NEXT_INSN (insn))
1246 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1247 max_line = NOTE_LINE_NUMBER (insn);
1250 line_note_exists = (char *) oballoc (max_line + 1);
1251 bzero (line_note_exists, max_line + 1);
1253 for (insn = first; insn; insn = NEXT_INSN (insn))
1254 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1255 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
1261 /* Output the insns. */
1262 for (insn = NEXT_INSN (first); insn;)
1264 #ifdef HAVE_ATTR_length
1265 insn_current_address = insn_addresses[INSN_UID (insn)];
1267 insn = final_scan_insn (insn, file, optimize, prescan, 0);
1270 /* Do basic-block profiling here
1271 if the last insn was a conditional branch. */
1272 if (profile_block_flag && new_block)
1276 /* The final scan for one insn, INSN.
1277 Args are same as in `final', except that INSN
1278 is the insn being scanned.
1279 Value returned is the next insn to be scanned.
1281 NOPEEPHOLES is the flag to disallow peephole processing (currently
1282 used for within delayed branch sequence output). */
1285 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
1295 /* Ignore deleted insns. These can occur when we split insns (due to a
1296 template of "#") while not optimizing. */
1297 if (INSN_DELETED_P (insn))
1298 return NEXT_INSN (insn);
1300 switch (GET_CODE (insn))
1306 /* Align the beginning of a loop, for higher speed
1307 on certain machines. */
1309 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG && optimize > 0)
1311 #ifdef ASM_OUTPUT_LOOP_ALIGN
1312 rtx next = next_nonnote_insn (insn);
1313 if (next && GET_CODE (next) == CODE_LABEL)
1315 ASM_OUTPUT_LOOP_ALIGN (asm_out_file);
1320 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END)
1323 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG)
1325 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHB", NOTE_BLOCK_NUMBER (insn));
1326 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn));
1327 #ifdef ASM_OUTPUT_EH_REGION_BEG
1328 ASM_OUTPUT_EH_REGION_BEG (file, NOTE_BLOCK_NUMBER (insn));
1333 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END)
1335 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHE", NOTE_BLOCK_NUMBER (insn));
1336 #ifdef ASM_OUTPUT_EH_REGION_END
1337 ASM_OUTPUT_EH_REGION_END (file, NOTE_BLOCK_NUMBER (insn));
1342 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
1344 #ifdef FUNCTION_END_PROLOGUE
1345 FUNCTION_END_PROLOGUE (file);
1347 profile_after_prologue (file);
1351 #ifdef FUNCTION_BEGIN_EPILOGUE
1352 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
1354 FUNCTION_BEGIN_EPILOGUE (file);
1359 if (write_symbols == NO_DEBUG)
1361 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
1363 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
1364 /* MIPS stabs require the parameter descriptions to be after the
1365 function entry point rather than before. */
1366 if (write_symbols == SDB_DEBUG)
1367 sdbout_begin_function (last_linenum);
1370 #ifdef DWARF_DEBUGGING_INFO
1371 /* This outputs a marker where the function body starts, so it
1372 must be after the prologue. */
1373 if (write_symbols == DWARF_DEBUG)
1374 dwarfout_begin_function ();
1378 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED)
1379 break; /* An insn that was "deleted" */
1382 fprintf (file, ASM_APP_OFF);
1385 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG
1386 && (debug_info_level == DINFO_LEVEL_NORMAL
1387 || debug_info_level == DINFO_LEVEL_VERBOSE
1388 || write_symbols == DWARF_DEBUG
1389 || write_symbols == DWARF2_DEBUG))
1391 /* Beginning of a symbol-block. Assign it a sequence number
1392 and push the number onto the stack PENDING_BLOCKS. */
1394 if (block_depth == max_block_depth)
1396 /* PENDING_BLOCKS is full; make it longer. */
1397 max_block_depth *= 2;
1399 = (int *) xrealloc (pending_blocks,
1400 max_block_depth * sizeof (int));
1402 pending_blocks[block_depth++] = next_block_index;
1404 high_block_linenum = last_linenum;
1406 /* Output debugging info about the symbol-block beginning. */
1408 #ifdef SDB_DEBUGGING_INFO
1409 if (write_symbols == SDB_DEBUG)
1410 sdbout_begin_block (file, last_linenum, next_block_index);
1412 #ifdef XCOFF_DEBUGGING_INFO
1413 if (write_symbols == XCOFF_DEBUG)
1414 xcoffout_begin_block (file, last_linenum, next_block_index);
1416 #ifdef DBX_DEBUGGING_INFO
1417 if (write_symbols == DBX_DEBUG)
1418 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", next_block_index);
1420 #ifdef DWARF_DEBUGGING_INFO
1421 if (write_symbols == DWARF_DEBUG)
1422 dwarfout_begin_block (next_block_index);
1424 #ifdef DWARF2_DEBUGGING_INFO
1425 if (write_symbols == DWARF2_DEBUG)
1426 dwarf2out_begin_block (next_block_index);
1431 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END
1432 && (debug_info_level == DINFO_LEVEL_NORMAL
1433 || debug_info_level == DINFO_LEVEL_VERBOSE
1434 || write_symbols == DWARF_DEBUG
1435 || write_symbols == DWARF2_DEBUG))
1437 /* End of a symbol-block. Pop its sequence number off
1438 PENDING_BLOCKS and output debugging info based on that. */
1442 #ifdef XCOFF_DEBUGGING_INFO
1443 if (write_symbols == XCOFF_DEBUG && block_depth >= 0)
1444 xcoffout_end_block (file, high_block_linenum,
1445 pending_blocks[block_depth]);
1447 #ifdef DBX_DEBUGGING_INFO
1448 if (write_symbols == DBX_DEBUG && block_depth >= 0)
1449 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE",
1450 pending_blocks[block_depth]);
1452 #ifdef SDB_DEBUGGING_INFO
1453 if (write_symbols == SDB_DEBUG && block_depth >= 0)
1454 sdbout_end_block (file, high_block_linenum,
1455 pending_blocks[block_depth]);
1457 #ifdef DWARF_DEBUGGING_INFO
1458 if (write_symbols == DWARF_DEBUG && block_depth >= 0)
1459 dwarfout_end_block (pending_blocks[block_depth]);
1461 #ifdef DWARF2_DEBUGGING_INFO
1462 if (write_symbols == DWARF2_DEBUG && block_depth >= 0)
1463 dwarf2out_end_block (pending_blocks[block_depth]);
1466 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL
1467 && (debug_info_level == DINFO_LEVEL_NORMAL
1468 || debug_info_level == DINFO_LEVEL_VERBOSE))
1470 #ifdef DWARF_DEBUGGING_INFO
1471 if (write_symbols == DWARF_DEBUG)
1472 dwarfout_label (insn);
1474 #ifdef DWARF2_DEBUGGING_INFO
1475 if (write_symbols == DWARF2_DEBUG)
1476 dwarf2out_label (insn);
1479 else if (NOTE_LINE_NUMBER (insn) > 0)
1480 /* This note is a line-number. */
1484 #if 0 /* This is what we used to do. */
1485 output_source_line (file, insn);
1489 /* If there is anything real after this note,
1490 output it. If another line note follows, omit this one. */
1491 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
1493 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
1495 /* These types of notes can be significant
1496 so make sure the preceding line number stays. */
1497 else if (GET_CODE (note) == NOTE
1498 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
1499 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
1500 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
1502 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
1504 /* Another line note follows; we can delete this note
1505 if no intervening line numbers have notes elsewhere. */
1507 for (num = NOTE_LINE_NUMBER (insn) + 1;
1508 num < NOTE_LINE_NUMBER (note);
1510 if (line_note_exists[num])
1513 if (num >= NOTE_LINE_NUMBER (note))
1519 /* Output this line note
1520 if it is the first or the last line note in a row. */
1522 output_source_line (file, insn);
1527 #ifdef ASM_OUTPUT_ALIGN_CODE
1528 /* Don't litter the assembler output with needless alignments. A
1529 BARRIER will be placed at the end of every function if HAVE_epilogue
1531 if (NEXT_INSN (insn))
1532 ASM_OUTPUT_ALIGN_CODE (file);
1542 #ifdef FINAL_PRESCAN_LABEL
1543 FINAL_PRESCAN_INSN (insn, NULL_PTR, 0);
1546 #ifdef SDB_DEBUGGING_INFO
1547 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
1548 sdbout_label (insn);
1550 #ifdef DWARF_DEBUGGING_INFO
1551 if (write_symbols == DWARF_DEBUG && LABEL_NAME (insn))
1552 dwarfout_label (insn);
1554 #ifdef DWARF2_DEBUGGING_INFO
1555 if (write_symbols == DWARF2_DEBUG && LABEL_NAME (insn))
1556 dwarf2out_label (insn);
1560 fprintf (file, ASM_APP_OFF);
1563 if (NEXT_INSN (insn) != 0
1564 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
1566 rtx nextbody = PATTERN (NEXT_INSN (insn));
1568 /* If this label is followed by a jump-table,
1569 make sure we put the label in the read-only section. Also
1570 possibly write the label and jump table together. */
1572 if (GET_CODE (nextbody) == ADDR_VEC
1573 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1575 #ifndef JUMP_TABLES_IN_TEXT_SECTION
1576 readonly_data_section ();
1577 #ifdef READONLY_DATA_SECTION
1578 ASM_OUTPUT_ALIGN (file,
1579 exact_log2 (BIGGEST_ALIGNMENT
1581 #endif /* READONLY_DATA_SECTION */
1582 #else /* JUMP_TABLES_IN_TEXT_SECTION */
1583 function_section (current_function_decl);
1584 #endif /* JUMP_TABLES_IN_TEXT_SECTION */
1585 #ifdef ASM_OUTPUT_CASE_LABEL
1586 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
1589 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
1595 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
1600 register rtx body = PATTERN (insn);
1601 int insn_code_number;
1605 /* An INSN, JUMP_INSN or CALL_INSN.
1606 First check for special kinds that recog doesn't recognize. */
1608 if (GET_CODE (body) == USE /* These are just declarations */
1609 || GET_CODE (body) == CLOBBER)
1613 /* If there is a REG_CC_SETTER note on this insn, it means that
1614 the setting of the condition code was done in the delay slot
1615 of the insn that branched here. So recover the cc status
1616 from the insn that set it. */
1618 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
1621 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
1622 cc_prev_status = cc_status;
1626 /* Detect insns that are really jump-tables
1627 and output them as such. */
1629 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1631 register int vlen, idx;
1638 fprintf (file, ASM_APP_OFF);
1642 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
1643 for (idx = 0; idx < vlen; idx++)
1645 if (GET_CODE (body) == ADDR_VEC)
1647 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
1648 ASM_OUTPUT_ADDR_VEC_ELT
1649 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
1656 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
1657 ASM_OUTPUT_ADDR_DIFF_ELT
1659 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
1660 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
1666 #ifdef ASM_OUTPUT_CASE_END
1667 ASM_OUTPUT_CASE_END (file,
1668 CODE_LABEL_NUMBER (PREV_INSN (insn)),
1672 function_section (current_function_decl);
1677 /* Do basic-block profiling when we reach a new block.
1678 Done here to avoid jump tables. */
1679 if (profile_block_flag && new_block)
1682 if (GET_CODE (body) == ASM_INPUT)
1684 /* There's no telling what that did to the condition codes. */
1690 fprintf (file, ASM_APP_ON);
1693 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
1697 /* Detect `asm' construct with operands. */
1698 if (asm_noperands (body) >= 0)
1700 int noperands = asm_noperands (body);
1701 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
1704 /* There's no telling what that did to the condition codes. */
1711 fprintf (file, ASM_APP_ON);
1715 /* Get out the operand values. */
1716 string = decode_asm_operands (body, ops, NULL_PTR,
1717 NULL_PTR, NULL_PTR);
1718 /* Inhibit aborts on what would otherwise be compiler bugs. */
1719 insn_noperands = noperands;
1720 this_is_asm_operands = insn;
1722 /* Output the insn using them. */
1723 output_asm_insn (string, ops);
1724 this_is_asm_operands = 0;
1728 if (prescan <= 0 && app_on)
1730 fprintf (file, ASM_APP_OFF);
1734 if (GET_CODE (body) == SEQUENCE)
1736 /* A delayed-branch sequence */
1742 final_sequence = body;
1744 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
1745 force the restoration of a comparison that was previously
1746 thought unnecessary. If that happens, cancel this sequence
1747 and cause that insn to be restored. */
1749 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
1750 if (next != XVECEXP (body, 0, 1))
1756 for (i = 1; i < XVECLEN (body, 0); i++)
1758 rtx insn = XVECEXP (body, 0, i);
1759 rtx next = NEXT_INSN (insn);
1760 /* We loop in case any instruction in a delay slot gets
1763 insn = final_scan_insn (insn, file, 0, prescan, 1);
1764 while (insn != next);
1766 #ifdef DBR_OUTPUT_SEQEND
1767 DBR_OUTPUT_SEQEND (file);
1771 /* If the insn requiring the delay slot was a CALL_INSN, the
1772 insns in the delay slot are actually executed before the
1773 called function. Hence we don't preserve any CC-setting
1774 actions in these insns and the CC must be marked as being
1775 clobbered by the function. */
1776 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
1779 /* Following a conditional branch sequence, we have a new basic
1781 if (profile_block_flag)
1783 rtx insn = XVECEXP (body, 0, 0);
1784 rtx body = PATTERN (insn);
1786 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
1787 && GET_CODE (SET_SRC (body)) != LABEL_REF)
1788 || (GET_CODE (insn) == JUMP_INSN
1789 && GET_CODE (body) == PARALLEL
1790 && GET_CODE (XVECEXP (body, 0, 0)) == SET
1791 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
1797 /* We have a real machine instruction as rtl. */
1799 body = PATTERN (insn);
1802 /* Check for redundant test and compare instructions
1803 (when the condition codes are already set up as desired).
1804 This is done only when optimizing; if not optimizing,
1805 it should be possible for the user to alter a variable
1806 with the debugger in between statements
1807 and the next statement should reexamine the variable
1808 to compute the condition codes. */
1812 rtx set = single_set(insn);
1815 && GET_CODE (SET_DEST (set)) == CC0
1816 && insn != last_ignored_compare)
1818 if (GET_CODE (SET_SRC (set)) == SUBREG)
1819 SET_SRC (set) = alter_subreg (SET_SRC (set));
1820 else if (GET_CODE (SET_SRC (set)) == COMPARE)
1822 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
1823 XEXP (SET_SRC (set), 0)
1824 = alter_subreg (XEXP (SET_SRC (set), 0));
1825 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
1826 XEXP (SET_SRC (set), 1)
1827 = alter_subreg (XEXP (SET_SRC (set), 1));
1829 if ((cc_status.value1 != 0
1830 && rtx_equal_p (SET_SRC (set), cc_status.value1))
1831 || (cc_status.value2 != 0
1832 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
1834 /* Don't delete insn if it has an addressing side-effect. */
1835 if (! FIND_REG_INC_NOTE (insn, 0)
1836 /* or if anything in it is volatile. */
1837 && ! volatile_refs_p (PATTERN (insn)))
1839 /* We don't really delete the insn; just ignore it. */
1840 last_ignored_compare = insn;
1848 /* Following a conditional branch, we have a new basic block.
1849 But if we are inside a sequence, the new block starts after the
1850 last insn of the sequence. */
1851 if (profile_block_flag && final_sequence == 0
1852 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
1853 && GET_CODE (SET_SRC (body)) != LABEL_REF)
1854 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
1855 && GET_CODE (XVECEXP (body, 0, 0)) == SET
1856 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
1860 /* Don't bother outputting obvious no-ops, even without -O.
1861 This optimization is fast and doesn't interfere with debugging.
1862 Don't do this if the insn is in a delay slot, since this
1863 will cause an improper number of delay insns to be written. */
1864 if (final_sequence == 0
1866 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
1867 && GET_CODE (SET_SRC (body)) == REG
1868 && GET_CODE (SET_DEST (body)) == REG
1869 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
1874 /* If this is a conditional branch, maybe modify it
1875 if the cc's are in a nonstandard state
1876 so that it accomplishes the same thing that it would
1877 do straightforwardly if the cc's were set up normally. */
1879 if (cc_status.flags != 0
1880 && GET_CODE (insn) == JUMP_INSN
1881 && GET_CODE (body) == SET
1882 && SET_DEST (body) == pc_rtx
1883 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
1884 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
1885 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
1886 /* This is done during prescan; it is not done again
1887 in final scan when prescan has been done. */
1890 /* This function may alter the contents of its argument
1891 and clear some of the cc_status.flags bits.
1892 It may also return 1 meaning condition now always true
1893 or -1 meaning condition now always false
1894 or 2 meaning condition nontrivial but altered. */
1895 register int result = alter_cond (XEXP (SET_SRC (body), 0));
1896 /* If condition now has fixed value, replace the IF_THEN_ELSE
1897 with its then-operand or its else-operand. */
1899 SET_SRC (body) = XEXP (SET_SRC (body), 1);
1901 SET_SRC (body) = XEXP (SET_SRC (body), 2);
1903 /* The jump is now either unconditional or a no-op.
1904 If it has become a no-op, don't try to output it.
1905 (It would not be recognized.) */
1906 if (SET_SRC (body) == pc_rtx)
1908 PUT_CODE (insn, NOTE);
1909 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1910 NOTE_SOURCE_FILE (insn) = 0;
1913 else if (GET_CODE (SET_SRC (body)) == RETURN)
1914 /* Replace (set (pc) (return)) with (return). */
1915 PATTERN (insn) = body = SET_SRC (body);
1917 /* Rerecognize the instruction if it has changed. */
1919 INSN_CODE (insn) = -1;
1922 /* Make same adjustments to instructions that examine the
1923 condition codes without jumping and instructions that
1924 handle conditional moves (if this machine has either one). */
1926 if (cc_status.flags != 0
1927 && GET_CODE (body) == SET)
1929 rtx cond_rtx, then_rtx, else_rtx;
1931 if (GET_CODE (insn) != JUMP_INSN
1932 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE)
1934 cond_rtx = XEXP (SET_SRC (body), 0);
1935 then_rtx = XEXP (SET_SRC (body), 1);
1936 else_rtx = XEXP (SET_SRC (body), 2);
1940 cond_rtx = SET_SRC (body);
1941 then_rtx = const_true_rtx;
1942 else_rtx = const0_rtx;
1945 switch (GET_CODE (cond_rtx))
1958 register int result;
1959 if (XEXP (cond_rtx, 0) != cc0_rtx)
1961 result = alter_cond (cond_rtx);
1963 validate_change (insn, &SET_SRC (body), then_rtx, 0);
1964 else if (result == -1)
1965 validate_change (insn, &SET_SRC (body), else_rtx, 0);
1966 else if (result == 2)
1967 INSN_CODE (insn) = -1;
1968 if (SET_DEST (body) == SET_SRC (body))
1970 PUT_CODE (insn, NOTE);
1971 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1972 NOTE_SOURCE_FILE (insn) = 0;
1981 /* Do machine-specific peephole optimizations if desired. */
1983 if (optimize && !flag_no_peephole && !nopeepholes)
1985 rtx next = peephole (insn);
1986 /* When peepholing, if there were notes within the peephole,
1987 emit them before the peephole. */
1988 if (next != 0 && next != NEXT_INSN (insn))
1990 rtx prev = PREV_INSN (insn);
1993 for (note = NEXT_INSN (insn); note != next;
1994 note = NEXT_INSN (note))
1995 final_scan_insn (note, file, optimize, prescan, nopeepholes);
1997 /* In case this is prescan, put the notes
1998 in proper position for later rescan. */
1999 note = NEXT_INSN (insn);
2000 PREV_INSN (note) = prev;
2001 NEXT_INSN (prev) = note;
2002 NEXT_INSN (PREV_INSN (next)) = insn;
2003 PREV_INSN (insn) = PREV_INSN (next);
2004 NEXT_INSN (insn) = next;
2005 PREV_INSN (next) = insn;
2008 /* PEEPHOLE might have changed this. */
2009 body = PATTERN (insn);
2012 /* Try to recognize the instruction.
2013 If successful, verify that the operands satisfy the
2014 constraints for the instruction. Crash if they don't,
2015 since `reload' should have changed them so that they do. */
2017 insn_code_number = recog_memoized (insn);
2018 insn_extract (insn);
2019 for (i = 0; i < insn_n_operands[insn_code_number]; i++)
2021 if (GET_CODE (recog_operand[i]) == SUBREG)
2022 recog_operand[i] = alter_subreg (recog_operand[i]);
2023 else if (GET_CODE (recog_operand[i]) == PLUS
2024 || GET_CODE (recog_operand[i]) == MULT)
2025 recog_operand[i] = walk_alter_subreg (recog_operand[i]);
2028 for (i = 0; i < insn_n_dups[insn_code_number]; i++)
2030 if (GET_CODE (*recog_dup_loc[i]) == SUBREG)
2031 *recog_dup_loc[i] = alter_subreg (*recog_dup_loc[i]);
2032 else if (GET_CODE (*recog_dup_loc[i]) == PLUS
2033 || GET_CODE (*recog_dup_loc[i]) == MULT)
2034 *recog_dup_loc[i] = walk_alter_subreg (*recog_dup_loc[i]);
2037 #ifdef REGISTER_CONSTRAINTS
2038 if (! constrain_operands (insn_code_number, 1))
2039 fatal_insn_not_found (insn);
2042 /* Some target machines need to prescan each insn before
2045 #ifdef FINAL_PRESCAN_INSN
2046 FINAL_PRESCAN_INSN (insn, recog_operand,
2047 insn_n_operands[insn_code_number]);
2051 cc_prev_status = cc_status;
2053 /* Update `cc_status' for this instruction.
2054 The instruction's output routine may change it further.
2055 If the output routine for a jump insn needs to depend
2056 on the cc status, it should look at cc_prev_status. */
2058 NOTICE_UPDATE_CC (body, insn);
2063 /* If the proper template needs to be chosen by some C code,
2064 run that code and get the real template. */
2066 template = insn_template[insn_code_number];
2069 template = (*insn_outfun[insn_code_number]) (recog_operand, insn);
2071 /* If the C code returns 0, it means that it is a jump insn
2072 which follows a deleted test insn, and that test insn
2073 needs to be reinserted. */
2076 if (prev_nonnote_insn (insn) != last_ignored_compare)
2079 return prev_nonnote_insn (insn);
2083 /* If the template is the string "#", it means that this insn must
2085 if (template[0] == '#' && template[1] == '\0')
2087 rtx new = try_split (body, insn, 0);
2089 /* If we didn't split the insn, go away. */
2090 if (new == insn && PATTERN (new) == body)
2100 /* Output assembler code from the template. */
2102 output_asm_insn (template, recog_operand);
2104 #if defined (DWARF2_DEBUGGING_INFO) && defined (HAVE_prologue)
2105 /* If this insn is part of the prologue, emit DWARF v2
2107 if (write_symbols == DWARF2_DEBUG && RTX_FRAME_RELATED_P (insn))
2108 dwarf2out_frame_debug (insn);
2112 /* It's not at all clear why we did this and doing so interferes
2113 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2116 /* Mark this insn as having been output. */
2117 INSN_DELETED_P (insn) = 1;
2123 return NEXT_INSN (insn);
2126 /* Output debugging info to the assembler file FILE
2127 based on the NOTE-insn INSN, assumed to be a line number. */
2130 output_source_line (file, insn)
2134 register char *filename = NOTE_SOURCE_FILE (insn);
2136 /* Remember filename for basic block profiling.
2137 Filenames are allocated on the permanent obstack
2138 or are passed in ARGV, so we don't have to save
2141 if (profile_block_flag && last_filename != filename)
2142 bb_file_label_num = add_bb_string (filename, TRUE);
2144 last_filename = filename;
2145 last_linenum = NOTE_LINE_NUMBER (insn);
2146 high_block_linenum = MAX (last_linenum, high_block_linenum);
2147 high_function_linenum = MAX (last_linenum, high_function_linenum);
2149 if (write_symbols != NO_DEBUG)
2151 #ifdef SDB_DEBUGGING_INFO
2152 if (write_symbols == SDB_DEBUG
2153 #if 0 /* People like having line numbers even in wrong file! */
2154 /* COFF can't handle multiple source files--lose, lose. */
2155 && !strcmp (filename, main_input_filename)
2157 /* COFF relative line numbers must be positive. */
2158 && last_linenum > sdb_begin_function_line)
2160 #ifdef ASM_OUTPUT_SOURCE_LINE
2161 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
2163 fprintf (file, "\t.ln\t%d\n",
2164 ((sdb_begin_function_line > -1)
2165 ? last_linenum - sdb_begin_function_line : 1));
2170 #if defined (DBX_DEBUGGING_INFO)
2171 if (write_symbols == DBX_DEBUG)
2172 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
2175 #if defined (XCOFF_DEBUGGING_INFO)
2176 if (write_symbols == XCOFF_DEBUG)
2177 xcoffout_source_line (file, filename, insn);
2180 #ifdef DWARF_DEBUGGING_INFO
2181 if (write_symbols == DWARF_DEBUG)
2182 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
2185 #ifdef DWARF2_DEBUGGING_INFO
2186 if (write_symbols == DWARF2_DEBUG)
2187 dwarf2out_line (filename, NOTE_LINE_NUMBER (insn));
2192 /* If X is a SUBREG, replace it with a REG or a MEM,
2193 based on the thing it is a subreg of. */
2199 register rtx y = SUBREG_REG (x);
2200 if (GET_CODE (y) == SUBREG)
2201 y = alter_subreg (y);
2203 if (GET_CODE (y) == REG)
2205 /* If the containing reg really gets a hard reg, so do we. */
2207 REGNO (x) = REGNO (y) + SUBREG_WORD (x);
2209 else if (GET_CODE (y) == MEM)
2211 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
2212 if (BYTES_BIG_ENDIAN)
2213 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
2214 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
2216 MEM_VOLATILE_P (x) = MEM_VOLATILE_P (y);
2217 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
2223 /* Do alter_subreg on all the SUBREGs contained in X. */
2226 walk_alter_subreg (x)
2229 switch (GET_CODE (x))
2233 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
2234 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
2238 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
2242 return alter_subreg (x);
2250 /* Given BODY, the body of a jump instruction, alter the jump condition
2251 as required by the bits that are set in cc_status.flags.
2252 Not all of the bits there can be handled at this level in all cases.
2254 The value is normally 0.
2255 1 means that the condition has become always true.
2256 -1 means that the condition has become always false.
2257 2 means that COND has been altered. */
2265 if (cc_status.flags & CC_REVERSED)
2268 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
2271 if (cc_status.flags & CC_INVERTED)
2274 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
2277 if (cc_status.flags & CC_NOT_POSITIVE)
2278 switch (GET_CODE (cond))
2283 /* Jump becomes unconditional. */
2289 /* Jump becomes no-op. */
2293 PUT_CODE (cond, EQ);
2298 PUT_CODE (cond, NE);
2303 if (cc_status.flags & CC_NOT_NEGATIVE)
2304 switch (GET_CODE (cond))
2308 /* Jump becomes unconditional. */
2313 /* Jump becomes no-op. */
2318 PUT_CODE (cond, EQ);
2324 PUT_CODE (cond, NE);
2329 if (cc_status.flags & CC_NO_OVERFLOW)
2330 switch (GET_CODE (cond))
2333 /* Jump becomes unconditional. */
2337 PUT_CODE (cond, EQ);
2342 PUT_CODE (cond, NE);
2347 /* Jump becomes no-op. */
2351 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
2352 switch (GET_CODE (cond))
2365 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
2370 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
2375 if (cc_status.flags & CC_NOT_SIGNED)
2376 /* The flags are valid if signed condition operators are converted
2378 switch (GET_CODE (cond))
2381 PUT_CODE (cond, LEU);
2386 PUT_CODE (cond, LTU);
2391 PUT_CODE (cond, GTU);
2396 PUT_CODE (cond, GEU);
2405 /* Report inconsistency between the assembler template and the operands.
2406 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
2409 output_operand_lossage (str)
2412 if (this_is_asm_operands)
2413 error_for_asm (this_is_asm_operands, "invalid `asm': %s", str);
2418 /* Output of assembler code from a template, and its subroutines. */
2420 /* Output text from TEMPLATE to the assembler output file,
2421 obeying %-directions to substitute operands taken from
2422 the vector OPERANDS.
2424 %N (for N a digit) means print operand N in usual manner.
2425 %lN means require operand N to be a CODE_LABEL or LABEL_REF
2426 and print the label name with no punctuation.
2427 %cN means require operand N to be a constant
2428 and print the constant expression with no punctuation.
2429 %aN means expect operand N to be a memory address
2430 (not a memory reference!) and print a reference
2432 %nN means expect operand N to be a constant
2433 and print a constant expression for minus the value
2434 of the operand, with no other punctuation. */
2439 if (flag_print_asm_name)
2441 /* Annotate the assembly with a comment describing the pattern and
2442 alternative used. */
2445 register int num = INSN_CODE (debug_insn);
2446 fprintf (asm_out_file, " %s %d %s",
2447 ASM_COMMENT_START, INSN_UID (debug_insn), insn_name[num]);
2448 if (insn_n_alternatives[num] > 1)
2449 fprintf (asm_out_file, "/%d", which_alternative + 1);
2451 /* Clear this so only the first assembler insn
2452 of any rtl insn will get the special comment for -dp. */
2459 output_asm_insn (template, operands)
2466 /* An insn may return a null string template
2467 in a case where no assembler code is needed. */
2472 putc ('\t', asm_out_file);
2474 #ifdef ASM_OUTPUT_OPCODE
2475 ASM_OUTPUT_OPCODE (asm_out_file, p);
2483 putc (c, asm_out_file);
2484 #ifdef ASM_OUTPUT_OPCODE
2485 while ((c = *p) == '\t')
2487 putc (c, asm_out_file);
2490 ASM_OUTPUT_OPCODE (asm_out_file, p);
2494 #ifdef ASSEMBLER_DIALECT
2496 /* If we want the first dialect, do nothing. Otherwise, skip
2497 DIALECT_NUMBER of strings ending with '|'. */
2498 for (i = 0; i < dialect_number; i++)
2500 while (*p && *p++ != '|')
2509 /* Skip to close brace. */
2510 while (*p && *p++ != '}')
2519 /* %% outputs a single %. */
2523 putc (c, asm_out_file);
2525 /* %= outputs a number which is unique to each insn in the entire
2526 compilation. This is useful for making local labels that are
2527 referred to more than once in a given insn. */
2531 fprintf (asm_out_file, "%d", insn_counter);
2533 /* % followed by a letter and some digits
2534 outputs an operand in a special way depending on the letter.
2535 Letters `acln' are implemented directly.
2536 Other letters are passed to `output_operand' so that
2537 the PRINT_OPERAND macro can define them. */
2538 else if ((*p >= 'a' && *p <= 'z')
2539 || (*p >= 'A' && *p <= 'Z'))
2544 if (! (*p >= '0' && *p <= '9'))
2545 output_operand_lossage ("operand number missing after %-letter");
2546 else if (this_is_asm_operands && c >= (unsigned) insn_noperands)
2547 output_operand_lossage ("operand number out of range");
2548 else if (letter == 'l')
2549 output_asm_label (operands[c]);
2550 else if (letter == 'a')
2551 output_address (operands[c]);
2552 else if (letter == 'c')
2554 if (CONSTANT_ADDRESS_P (operands[c]))
2555 output_addr_const (asm_out_file, operands[c]);
2557 output_operand (operands[c], 'c');
2559 else if (letter == 'n')
2561 if (GET_CODE (operands[c]) == CONST_INT)
2562 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
2563 - INTVAL (operands[c]));
2566 putc ('-', asm_out_file);
2567 output_addr_const (asm_out_file, operands[c]);
2571 output_operand (operands[c], letter);
2573 while ((c = *p) >= '0' && c <= '9') p++;
2575 /* % followed by a digit outputs an operand the default way. */
2576 else if (*p >= '0' && *p <= '9')
2579 if (this_is_asm_operands && c >= (unsigned) insn_noperands)
2580 output_operand_lossage ("operand number out of range");
2582 output_operand (operands[c], 0);
2583 while ((c = *p) >= '0' && c <= '9') p++;
2585 /* % followed by punctuation: output something for that
2586 punctuation character alone, with no operand.
2587 The PRINT_OPERAND macro decides what is actually done. */
2588 #ifdef PRINT_OPERAND_PUNCT_VALID_P
2589 else if (PRINT_OPERAND_PUNCT_VALID_P (*p))
2590 output_operand (NULL_RTX, *p++);
2593 output_operand_lossage ("invalid %%-code");
2597 putc (c, asm_out_file);
2602 putc ('\n', asm_out_file);
2605 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
2608 output_asm_label (x)
2613 if (GET_CODE (x) == LABEL_REF)
2614 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
2615 else if (GET_CODE (x) == CODE_LABEL)
2616 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
2618 output_operand_lossage ("`%l' operand isn't a label");
2620 assemble_name (asm_out_file, buf);
2623 /* Print operand X using machine-dependent assembler syntax.
2624 The macro PRINT_OPERAND is defined just to control this function.
2625 CODE is a non-digit that preceded the operand-number in the % spec,
2626 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
2627 between the % and the digits.
2628 When CODE is a non-letter, X is 0.
2630 The meanings of the letters are machine-dependent and controlled
2631 by PRINT_OPERAND. */
2634 output_operand (x, code)
2638 if (x && GET_CODE (x) == SUBREG)
2639 x = alter_subreg (x);
2641 /* If X is a pseudo-register, abort now rather than writing trash to the
2644 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
2647 PRINT_OPERAND (asm_out_file, x, code);
2650 /* Print a memory reference operand for address X
2651 using machine-dependent assembler syntax.
2652 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
2658 walk_alter_subreg (x);
2659 PRINT_OPERAND_ADDRESS (asm_out_file, x);
2662 /* Print an integer constant expression in assembler syntax.
2663 Addition and subtraction are the only arithmetic
2664 that may appear in these expressions. */
2667 output_addr_const (file, x)
2674 switch (GET_CODE (x))
2684 assemble_name (file, XSTR (x, 0));
2688 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
2689 assemble_name (file, buf);
2693 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
2694 assemble_name (file, buf);
2698 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
2702 /* This used to output parentheses around the expression,
2703 but that does not work on the 386 (either ATT or BSD assembler). */
2704 output_addr_const (file, XEXP (x, 0));
2708 if (GET_MODE (x) == VOIDmode)
2710 /* We can use %d if the number is one word and positive. */
2711 if (CONST_DOUBLE_HIGH (x))
2712 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
2713 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
2714 else if (CONST_DOUBLE_LOW (x) < 0)
2715 fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
2717 fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
2720 /* We can't handle floating point constants;
2721 PRINT_OPERAND must handle them. */
2722 output_operand_lossage ("floating constant misused");
2726 /* Some assemblers need integer constants to appear last (eg masm). */
2727 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
2729 output_addr_const (file, XEXP (x, 1));
2730 if (INTVAL (XEXP (x, 0)) >= 0)
2731 fprintf (file, "+");
2732 output_addr_const (file, XEXP (x, 0));
2736 output_addr_const (file, XEXP (x, 0));
2737 if (INTVAL (XEXP (x, 1)) >= 0)
2738 fprintf (file, "+");
2739 output_addr_const (file, XEXP (x, 1));
2744 /* Avoid outputting things like x-x or x+5-x,
2745 since some assemblers can't handle that. */
2746 x = simplify_subtraction (x);
2747 if (GET_CODE (x) != MINUS)
2750 output_addr_const (file, XEXP (x, 0));
2751 fprintf (file, "-");
2752 if (GET_CODE (XEXP (x, 1)) == CONST_INT
2753 && INTVAL (XEXP (x, 1)) < 0)
2755 fprintf (file, ASM_OPEN_PAREN);
2756 output_addr_const (file, XEXP (x, 1));
2757 fprintf (file, ASM_CLOSE_PAREN);
2760 output_addr_const (file, XEXP (x, 1));
2765 output_addr_const (file, XEXP (x, 0));
2769 output_operand_lossage ("invalid expression as operand");
2773 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
2774 %R prints the value of REGISTER_PREFIX.
2775 %L prints the value of LOCAL_LABEL_PREFIX.
2776 %U prints the value of USER_LABEL_PREFIX.
2777 %I prints the value of IMMEDIATE_PREFIX.
2778 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
2779 Also supported are %d, %x, %s, %e, %f, %g and %%.
2781 We handle alternate assembler dialects here, just like output_asm_insn. */
2784 asm_fprintf VPROTO((FILE *file, char *p, ...))
2795 VA_START (argptr, p);
2798 file = va_arg (argptr, FILE *);
2799 p = va_arg (argptr, char *);
2807 #ifdef ASSEMBLER_DIALECT
2809 /* If we want the first dialect, do nothing. Otherwise, skip
2810 DIALECT_NUMBER of strings ending with '|'. */
2811 for (i = 0; i < dialect_number; i++)
2813 while (*p && *p++ != '|')
2822 /* Skip to close brace. */
2823 while (*p && *p++ != '}')
2834 while ((c >= '0' && c <= '9') || c == '.')
2842 fprintf (file, "%%");
2845 case 'd': case 'i': case 'u':
2846 case 'x': case 'p': case 'X':
2850 fprintf (file, buf, va_arg (argptr, int));
2854 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
2855 but we do not check for those cases. It means that the value
2856 is a HOST_WIDE_INT, which may be either `int' or `long'. */
2858 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2860 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
2870 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
2877 fprintf (file, buf, va_arg (argptr, long));
2885 fprintf (file, buf, va_arg (argptr, double));
2891 fprintf (file, buf, va_arg (argptr, char *));
2895 #ifdef ASM_OUTPUT_OPCODE
2896 ASM_OUTPUT_OPCODE (asm_out_file, p);
2901 #ifdef REGISTER_PREFIX
2902 fprintf (file, "%s", REGISTER_PREFIX);
2907 #ifdef IMMEDIATE_PREFIX
2908 fprintf (file, "%s", IMMEDIATE_PREFIX);
2913 #ifdef LOCAL_LABEL_PREFIX
2914 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
2919 #ifdef USER_LABEL_PREFIX
2920 fprintf (file, "%s", USER_LABEL_PREFIX);
2934 /* Split up a CONST_DOUBLE or integer constant rtx
2935 into two rtx's for single words,
2936 storing in *FIRST the word that comes first in memory in the target
2937 and in *SECOND the other. */
2940 split_double (value, first, second)
2942 rtx *first, *second;
2944 if (GET_CODE (value) == CONST_INT)
2946 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
2948 /* In this case the CONST_INT holds both target words.
2949 Extract the bits from it into two word-sized pieces. */
2951 HOST_WIDE_INT word_mask;
2952 /* Avoid warnings for shift count >= BITS_PER_WORD. */
2953 int shift_count = BITS_PER_WORD - 1;
2955 word_mask = (HOST_WIDE_INT) 1 << shift_count;
2956 word_mask |= word_mask - 1;
2957 low = GEN_INT (INTVAL (value) & word_mask);
2958 high = GEN_INT ((INTVAL (value) >> (shift_count + 1)) & word_mask);
2959 if (WORDS_BIG_ENDIAN)
2972 /* The rule for using CONST_INT for a wider mode
2973 is that we regard the value as signed.
2974 So sign-extend it. */
2975 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
2976 if (WORDS_BIG_ENDIAN)
2988 else if (GET_CODE (value) != CONST_DOUBLE)
2990 if (WORDS_BIG_ENDIAN)
2992 *first = const0_rtx;
2998 *second = const0_rtx;
3001 else if (GET_MODE (value) == VOIDmode
3002 /* This is the old way we did CONST_DOUBLE integers. */
3003 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
3005 /* In an integer, the words are defined as most and least significant.
3006 So order them by the target's convention. */
3007 if (WORDS_BIG_ENDIAN)
3009 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3010 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3014 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3015 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3020 #ifdef REAL_ARITHMETIC
3021 REAL_VALUE_TYPE r; long l[2];
3022 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
3024 /* Note, this converts the REAL_VALUE_TYPE to the target's
3025 format, splits up the floating point double and outputs
3026 exactly 32 bits of it into each of l[0] and l[1] --
3027 not necessarily BITS_PER_WORD bits. */
3028 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
3030 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
3031 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
3033 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
3034 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
3035 && ! flag_pretend_float)
3039 #ifdef HOST_WORDS_BIG_ENDIAN
3046 /* Host and target agree => no need to swap. */
3047 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3048 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3052 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3053 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3055 #endif /* no REAL_ARITHMETIC */
3059 /* Return nonzero if this function has no function calls. */
3066 if (profile_flag || profile_block_flag)
3069 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3071 if (GET_CODE (insn) == CALL_INSN)
3073 if (GET_CODE (insn) == INSN
3074 && GET_CODE (PATTERN (insn)) == SEQUENCE
3075 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN)
3078 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
3080 if (GET_CODE (XEXP (insn, 0)) == CALL_INSN)
3082 if (GET_CODE (XEXP (insn, 0)) == INSN
3083 && GET_CODE (PATTERN (XEXP (insn, 0))) == SEQUENCE
3084 && GET_CODE (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)) == CALL_INSN)
3091 /* On some machines, a function with no call insns
3092 can run faster if it doesn't create its own register window.
3093 When output, the leaf function should use only the "output"
3094 registers. Ordinarily, the function would be compiled to use
3095 the "input" registers to find its arguments; it is a candidate
3096 for leaf treatment if it uses only the "input" registers.
3097 Leaf function treatment means renumbering so the function
3098 uses the "output" registers instead. */
3100 #ifdef LEAF_REGISTERS
3102 static char permitted_reg_in_leaf_functions[] = LEAF_REGISTERS;
3104 /* Return 1 if this function uses only the registers that can be
3105 safely renumbered. */
3108 only_leaf_regs_used ()
3112 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
3114 if ((regs_ever_live[i] || global_regs[i])
3115 && ! permitted_reg_in_leaf_functions[i])
3121 /* Scan all instructions and renumber all registers into those
3122 available in leaf functions. */
3125 leaf_renumber_regs (first)
3130 /* Renumber only the actual patterns.
3131 The reg-notes can contain frame pointer refs,
3132 and renumbering them could crash, and should not be needed. */
3133 for (insn = first; insn; insn = NEXT_INSN (insn))
3134 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
3135 leaf_renumber_regs_insn (PATTERN (insn));
3136 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
3137 if (GET_RTX_CLASS (GET_CODE (XEXP (insn, 0))) == 'i')
3138 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
3141 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
3142 available in leaf functions. */
3145 leaf_renumber_regs_insn (in_rtx)
3146 register rtx in_rtx;
3149 register char *format_ptr;
3154 /* Renumber all input-registers into output-registers.
3155 renumbered_regs would be 1 for an output-register;
3158 if (GET_CODE (in_rtx) == REG)
3162 /* Don't renumber the same reg twice. */
3166 newreg = REGNO (in_rtx);
3167 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
3168 to reach here as part of a REG_NOTE. */
3169 if (newreg >= FIRST_PSEUDO_REGISTER)
3174 newreg = LEAF_REG_REMAP (newreg);
3177 regs_ever_live[REGNO (in_rtx)] = 0;
3178 regs_ever_live[newreg] = 1;
3179 REGNO (in_rtx) = newreg;
3183 if (GET_RTX_CLASS (GET_CODE (in_rtx)) == 'i')
3185 /* Inside a SEQUENCE, we find insns.
3186 Renumber just the patterns of these insns,
3187 just as we do for the top-level insns. */
3188 leaf_renumber_regs_insn (PATTERN (in_rtx));
3192 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
3194 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
3195 switch (*format_ptr++)
3198 leaf_renumber_regs_insn (XEXP (in_rtx, i));
3202 if (NULL != XVEC (in_rtx, i))
3204 for (j = 0; j < XVECLEN (in_rtx, i); j++)
3205 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));