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 /* For SDB and XCOFF, the function beginning must be marked between
899 the function label and the prologue. We always need this, even when
900 -g1 was used. Defer on MIPS systems so that parameter descriptions
901 follow function entry. */
902 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
903 if (write_symbols == SDB_DEBUG)
904 sdbout_begin_function (last_linenum);
907 #ifdef XCOFF_DEBUGGING_INFO
908 if (write_symbols == XCOFF_DEBUG)
909 xcoffout_begin_function (file, last_linenum);
912 /* But only output line number for other debug info types if -g2
914 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
915 output_source_line (file, first);
917 #ifdef LEAF_REG_REMAP
919 leaf_renumber_regs (first);
922 /* The Sun386i and perhaps other machines don't work right
923 if the profiling code comes after the prologue. */
924 #ifdef PROFILE_BEFORE_PROLOGUE
926 profile_function (file);
927 #endif /* PROFILE_BEFORE_PROLOGUE */
929 #ifdef FUNCTION_PROLOGUE
930 /* First output the function prologue: code to set up the stack frame. */
931 FUNCTION_PROLOGUE (file, get_frame_size ());
934 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
935 if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG)
936 next_block_index = 1;
939 /* If the machine represents the prologue as RTL, the profiling code must
940 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
944 profile_after_prologue (file);
948 /* If we are doing basic block profiling, remember a printable version
949 of the function name. */
950 if (profile_block_flag)
952 char *junk = "function";
954 add_bb_string ((*decl_printable_name) (current_function_decl, &junk), FALSE);
959 profile_after_prologue (file)
962 #ifdef FUNCTION_BLOCK_PROFILER
963 if (profile_block_flag)
965 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
967 #endif /* FUNCTION_BLOCK_PROFILER */
969 #ifndef PROFILE_BEFORE_PROLOGUE
971 profile_function (file);
972 #endif /* not PROFILE_BEFORE_PROLOGUE */
976 profile_function (file)
979 int align = MIN (BIGGEST_ALIGNMENT, POINTER_SIZE);
980 int sval = current_function_returns_struct;
981 int cxt = current_function_needs_context;
984 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
985 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
986 assemble_integer (const0_rtx, POINTER_SIZE / BITS_PER_UNIT, 1);
990 #ifdef STRUCT_VALUE_INCOMING_REGNUM
992 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
994 #ifdef STRUCT_VALUE_REGNUM
996 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1001 #ifdef STATIC_CHAIN_INCOMING_REGNUM
1003 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1005 #ifdef STATIC_CHAIN_REGNUM
1007 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1012 FUNCTION_PROFILER (file, profile_label_no);
1015 #ifdef STATIC_CHAIN_INCOMING_REGNUM
1017 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1019 #ifdef STATIC_CHAIN_REGNUM
1021 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1026 #ifdef STRUCT_VALUE_INCOMING_REGNUM
1028 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1030 #ifdef STRUCT_VALUE_REGNUM
1032 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1037 /* Output assembler code for the end of a function.
1038 For clarity, args are same as those of `final_start_function'
1039 even though not all of them are needed. */
1042 final_end_function (first, file, optimize)
1049 fprintf (file, ASM_APP_OFF);
1053 #ifdef SDB_DEBUGGING_INFO
1054 if (write_symbols == SDB_DEBUG)
1055 sdbout_end_function (high_function_linenum);
1058 #ifdef DWARF_DEBUGGING_INFO
1059 if (write_symbols == DWARF_DEBUG)
1060 dwarfout_end_function ();
1063 #ifdef XCOFF_DEBUGGING_INFO
1064 if (write_symbols == XCOFF_DEBUG)
1065 xcoffout_end_function (file, high_function_linenum);
1068 #ifdef FUNCTION_EPILOGUE
1069 /* Finally, output the function epilogue:
1070 code to restore the stack frame and return to the caller. */
1071 FUNCTION_EPILOGUE (file, get_frame_size ());
1074 #ifdef SDB_DEBUGGING_INFO
1075 if (write_symbols == SDB_DEBUG)
1076 sdbout_end_epilogue ();
1079 #ifdef DWARF_DEBUGGING_INFO
1080 if (write_symbols == DWARF_DEBUG)
1081 dwarfout_end_epilogue ();
1084 #ifdef XCOFF_DEBUGGING_INFO
1085 if (write_symbols == XCOFF_DEBUG)
1086 xcoffout_end_epilogue (file);
1089 bb_func_label_num = -1; /* not in function, nuke label # */
1091 /* If FUNCTION_EPILOGUE is not defined, then the function body
1092 itself contains return instructions wherever needed. */
1095 /* Add a block to the linked list that remembers the current line/file/function
1096 for basic block profiling. Emit the label in front of the basic block and
1097 the instructions that increment the count field. */
1103 struct bb_list *ptr = (struct bb_list *) permalloc (sizeof (struct bb_list));
1105 /* Add basic block to linked list. */
1107 ptr->line_num = last_linenum;
1108 ptr->file_label_num = bb_file_label_num;
1109 ptr->func_label_num = bb_func_label_num;
1111 bb_tail = &ptr->next;
1113 /* Enable the table of basic-block use counts
1114 to point at the code it applies to. */
1115 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1117 /* Before first insn of this basic block, increment the
1118 count of times it was entered. */
1119 #ifdef BLOCK_PROFILER
1120 BLOCK_PROFILER (file, count_basic_blocks);
1125 count_basic_blocks++;
1128 /* Add a string to be used for basic block profiling. */
1131 add_bb_string (string, perm_p)
1136 struct bb_str *ptr = 0;
1140 string = "<unknown>";
1144 /* Allocate a new string if the current string isn't permanent. If
1145 the string is permanent search for the same string in other
1148 len = strlen (string) + 1;
1151 char *p = (char *) permalloc (len);
1152 bcopy (string, p, len);
1156 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1157 if (ptr->string == string)
1160 /* Allocate a new string block if we need to. */
1163 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1166 ptr->label_num = sbb_label_num++;
1167 ptr->string = string;
1169 sbb_tail = &ptr->next;
1172 return ptr->label_num;
1176 /* Output assembler code for some insns: all or part of a function.
1177 For description of args, see `final_start_function', above.
1179 PRESCAN is 1 if we are not really outputting,
1180 just scanning as if we were outputting.
1181 Prescanning deletes and rearranges insns just like ordinary output.
1182 PRESCAN is -2 if we are outputting after having prescanned.
1183 In this case, don't try to delete or rearrange insns
1184 because that has already been done.
1185 Prescanning is done only on certain machines. */
1188 final (first, file, optimize, prescan)
1197 last_ignored_compare = 0;
1200 check_exception_handler_labels ();
1202 /* Make a map indicating which line numbers appear in this function.
1203 When producing SDB debugging info, delete troublesome line number
1204 notes from inlined functions in other files as well as duplicate
1205 line number notes. */
1206 #ifdef SDB_DEBUGGING_INFO
1207 if (write_symbols == SDB_DEBUG)
1210 for (insn = first; insn; insn = NEXT_INSN (insn))
1211 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1213 if ((RTX_INTEGRATED_P (insn)
1214 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1216 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1217 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1219 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1220 NOTE_SOURCE_FILE (insn) = 0;
1224 if (NOTE_LINE_NUMBER (insn) > max_line)
1225 max_line = NOTE_LINE_NUMBER (insn);
1231 for (insn = first; insn; insn = NEXT_INSN (insn))
1232 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1233 max_line = NOTE_LINE_NUMBER (insn);
1236 line_note_exists = (char *) oballoc (max_line + 1);
1237 bzero (line_note_exists, max_line + 1);
1239 for (insn = first; insn; insn = NEXT_INSN (insn))
1240 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1241 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
1247 /* Output the insns. */
1248 for (insn = NEXT_INSN (first); insn;)
1249 insn = final_scan_insn (insn, file, optimize, prescan, 0);
1251 /* Do basic-block profiling here
1252 if the last insn was a conditional branch. */
1253 if (profile_block_flag && new_block)
1257 /* The final scan for one insn, INSN.
1258 Args are same as in `final', except that INSN
1259 is the insn being scanned.
1260 Value returned is the next insn to be scanned.
1262 NOPEEPHOLES is the flag to disallow peephole processing (currently
1263 used for within delayed branch sequence output). */
1266 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
1276 /* Ignore deleted insns. These can occur when we split insns (due to a
1277 template of "#") while not optimizing. */
1278 if (INSN_DELETED_P (insn))
1279 return NEXT_INSN (insn);
1281 switch (GET_CODE (insn))
1287 /* Align the beginning of a loop, for higher speed
1288 on certain machines. */
1290 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG && optimize > 0)
1292 #ifdef ASM_OUTPUT_LOOP_ALIGN
1293 rtx next = next_nonnote_insn (insn);
1294 if (next && GET_CODE (next) == CODE_LABEL)
1296 ASM_OUTPUT_LOOP_ALIGN (asm_out_file);
1301 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END)
1304 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG)
1306 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHB", NOTE_BLOCK_NUMBER (insn));
1307 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn));
1308 #ifdef ASM_OUTPUT_EH_REGION_BEG
1309 ASM_OUTPUT_EH_REGION_BEG (file, NOTE_BLOCK_NUMBER (insn));
1314 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END)
1316 ASM_OUTPUT_INTERNAL_LABEL (file, "LEHE", NOTE_BLOCK_NUMBER (insn));
1317 #ifdef ASM_OUTPUT_EH_REGION_END
1318 ASM_OUTPUT_EH_REGION_END (file, NOTE_BLOCK_NUMBER (insn));
1323 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
1325 #ifdef FUNCTION_END_PROLOGUE
1326 FUNCTION_END_PROLOGUE (file);
1328 profile_after_prologue (file);
1332 #ifdef FUNCTION_BEGIN_EPILOGUE
1333 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
1335 FUNCTION_BEGIN_EPILOGUE (file);
1340 if (write_symbols == NO_DEBUG)
1342 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG)
1344 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
1345 /* MIPS stabs require the parameter descriptions to be after the
1346 function entry point rather than before. */
1347 if (write_symbols == SDB_DEBUG)
1348 sdbout_begin_function (last_linenum);
1351 #ifdef DWARF_DEBUGGING_INFO
1352 /* This outputs a marker where the function body starts, so it
1353 must be after the prologue. */
1354 if (write_symbols == DWARF_DEBUG)
1355 dwarfout_begin_function ();
1359 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED)
1360 break; /* An insn that was "deleted" */
1363 fprintf (file, ASM_APP_OFF);
1366 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG
1367 && (debug_info_level == DINFO_LEVEL_NORMAL
1368 || debug_info_level == DINFO_LEVEL_VERBOSE
1369 #ifdef DWARF_DEBUGGING_INFO
1370 || write_symbols == DWARF_DEBUG
1375 /* Beginning of a symbol-block. Assign it a sequence number
1376 and push the number onto the stack PENDING_BLOCKS. */
1378 if (block_depth == max_block_depth)
1380 /* PENDING_BLOCKS is full; make it longer. */
1381 max_block_depth *= 2;
1383 = (int *) xrealloc (pending_blocks,
1384 max_block_depth * sizeof (int));
1386 pending_blocks[block_depth++] = next_block_index;
1388 high_block_linenum = last_linenum;
1390 /* Output debugging info about the symbol-block beginning. */
1392 #ifdef SDB_DEBUGGING_INFO
1393 if (write_symbols == SDB_DEBUG)
1394 sdbout_begin_block (file, last_linenum, next_block_index);
1396 #ifdef XCOFF_DEBUGGING_INFO
1397 if (write_symbols == XCOFF_DEBUG)
1398 xcoffout_begin_block (file, last_linenum, next_block_index);
1400 #ifdef DBX_DEBUGGING_INFO
1401 if (write_symbols == DBX_DEBUG)
1402 ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", next_block_index);
1404 #ifdef DWARF_DEBUGGING_INFO
1405 if (write_symbols == DWARF_DEBUG && block_depth > 1)
1406 dwarfout_begin_block (next_block_index);
1411 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END
1412 && (debug_info_level == DINFO_LEVEL_NORMAL
1413 || debug_info_level == DINFO_LEVEL_VERBOSE
1414 #ifdef DWARF_DEBUGGING_INFO
1415 || write_symbols == DWARF_DEBUG
1420 /* End of a symbol-block. Pop its sequence number off
1421 PENDING_BLOCKS and output debugging info based on that. */
1425 #ifdef XCOFF_DEBUGGING_INFO
1426 if (write_symbols == XCOFF_DEBUG && block_depth >= 0)
1427 xcoffout_end_block (file, high_block_linenum,
1428 pending_blocks[block_depth]);
1430 #ifdef DBX_DEBUGGING_INFO
1431 if (write_symbols == DBX_DEBUG && block_depth >= 0)
1432 ASM_OUTPUT_INTERNAL_LABEL (file, "LBE",
1433 pending_blocks[block_depth]);
1435 #ifdef SDB_DEBUGGING_INFO
1436 if (write_symbols == SDB_DEBUG && block_depth >= 0)
1437 sdbout_end_block (file, high_block_linenum,
1438 pending_blocks[block_depth]);
1440 #ifdef DWARF_DEBUGGING_INFO
1441 if (write_symbols == DWARF_DEBUG && block_depth >= 1)
1442 dwarfout_end_block (pending_blocks[block_depth]);
1445 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL
1446 && (debug_info_level == DINFO_LEVEL_NORMAL
1447 || debug_info_level == DINFO_LEVEL_VERBOSE))
1449 #ifdef DWARF_DEBUGGING_INFO
1450 if (write_symbols == DWARF_DEBUG)
1451 dwarfout_label (insn);
1454 else if (NOTE_LINE_NUMBER (insn) > 0)
1455 /* This note is a line-number. */
1459 #if 0 /* This is what we used to do. */
1460 output_source_line (file, insn);
1464 /* If there is anything real after this note,
1465 output it. If another line note follows, omit this one. */
1466 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
1468 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
1470 /* These types of notes can be significant
1471 so make sure the preceding line number stays. */
1472 else if (GET_CODE (note) == NOTE
1473 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
1474 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
1475 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
1477 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
1479 /* Another line note follows; we can delete this note
1480 if no intervening line numbers have notes elsewhere. */
1482 for (num = NOTE_LINE_NUMBER (insn) + 1;
1483 num < NOTE_LINE_NUMBER (note);
1485 if (line_note_exists[num])
1488 if (num >= NOTE_LINE_NUMBER (note))
1494 /* Output this line note
1495 if it is the first or the last line note in a row. */
1497 output_source_line (file, insn);
1502 #ifdef ASM_OUTPUT_ALIGN_CODE
1503 /* Don't litter the assembler output with needless alignments. A
1504 BARRIER will be placed at the end of every function if HAVE_epilogue
1506 if (NEXT_INSN (insn))
1507 ASM_OUTPUT_ALIGN_CODE (file);
1517 #ifdef FINAL_PRESCAN_LABEL
1518 FINAL_PRESCAN_INSN (insn, NULL_PTR, 0);
1521 #ifdef SDB_DEBUGGING_INFO
1522 if (write_symbols == SDB_DEBUG && LABEL_NAME (insn))
1523 sdbout_label (insn);
1525 #ifdef DWARF_DEBUGGING_INFO
1526 if (write_symbols == DWARF_DEBUG && LABEL_NAME (insn))
1527 dwarfout_label (insn);
1531 fprintf (file, ASM_APP_OFF);
1534 if (NEXT_INSN (insn) != 0
1535 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
1537 rtx nextbody = PATTERN (NEXT_INSN (insn));
1539 /* If this label is followed by a jump-table,
1540 make sure we put the label in the read-only section. Also
1541 possibly write the label and jump table together. */
1543 if (GET_CODE (nextbody) == ADDR_VEC
1544 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1546 #ifndef JUMP_TABLES_IN_TEXT_SECTION
1547 readonly_data_section ();
1548 #ifdef READONLY_DATA_SECTION
1549 ASM_OUTPUT_ALIGN (file,
1550 exact_log2 (BIGGEST_ALIGNMENT
1552 #endif /* READONLY_DATA_SECTION */
1553 #else /* JUMP_TABLES_IN_TEXT_SECTION */
1554 function_section (current_function_decl);
1555 #endif /* JUMP_TABLES_IN_TEXT_SECTION */
1556 #ifdef ASM_OUTPUT_CASE_LABEL
1557 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
1560 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
1566 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
1571 register rtx body = PATTERN (insn);
1572 int insn_code_number;
1576 /* An INSN, JUMP_INSN or CALL_INSN.
1577 First check for special kinds that recog doesn't recognize. */
1579 if (GET_CODE (body) == USE /* These are just declarations */
1580 || GET_CODE (body) == CLOBBER)
1584 /* If there is a REG_CC_SETTER note on this insn, it means that
1585 the setting of the condition code was done in the delay slot
1586 of the insn that branched here. So recover the cc status
1587 from the insn that set it. */
1589 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
1592 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
1593 cc_prev_status = cc_status;
1597 /* Detect insns that are really jump-tables
1598 and output them as such. */
1600 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1602 register int vlen, idx;
1609 fprintf (file, ASM_APP_OFF);
1613 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
1614 for (idx = 0; idx < vlen; idx++)
1616 if (GET_CODE (body) == ADDR_VEC)
1618 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
1619 ASM_OUTPUT_ADDR_VEC_ELT
1620 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
1627 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
1628 ASM_OUTPUT_ADDR_DIFF_ELT
1630 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
1631 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
1637 #ifdef ASM_OUTPUT_CASE_END
1638 ASM_OUTPUT_CASE_END (file,
1639 CODE_LABEL_NUMBER (PREV_INSN (insn)),
1643 function_section (current_function_decl);
1648 /* Do basic-block profiling when we reach a new block.
1649 Done here to avoid jump tables. */
1650 if (profile_block_flag && new_block)
1653 if (GET_CODE (body) == ASM_INPUT)
1655 /* There's no telling what that did to the condition codes. */
1661 fprintf (file, ASM_APP_ON);
1664 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
1668 /* Detect `asm' construct with operands. */
1669 if (asm_noperands (body) >= 0)
1671 int noperands = asm_noperands (body);
1672 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
1675 /* There's no telling what that did to the condition codes. */
1682 fprintf (file, ASM_APP_ON);
1686 /* Get out the operand values. */
1687 string = decode_asm_operands (body, ops, NULL_PTR,
1688 NULL_PTR, NULL_PTR);
1689 /* Inhibit aborts on what would otherwise be compiler bugs. */
1690 insn_noperands = noperands;
1691 this_is_asm_operands = insn;
1693 /* Output the insn using them. */
1694 output_asm_insn (string, ops);
1695 this_is_asm_operands = 0;
1699 if (prescan <= 0 && app_on)
1701 fprintf (file, ASM_APP_OFF);
1705 if (GET_CODE (body) == SEQUENCE)
1707 /* A delayed-branch sequence */
1713 final_sequence = body;
1715 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
1716 force the restoration of a comparison that was previously
1717 thought unnecessary. If that happens, cancel this sequence
1718 and cause that insn to be restored. */
1720 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
1721 if (next != XVECEXP (body, 0, 1))
1727 for (i = 1; i < XVECLEN (body, 0); i++)
1729 rtx insn = XVECEXP (body, 0, i);
1730 rtx next = NEXT_INSN (insn);
1731 /* We loop in case any instruction in a delay slot gets
1734 insn = final_scan_insn (insn, file, 0, prescan, 1);
1735 while (insn != next);
1737 #ifdef DBR_OUTPUT_SEQEND
1738 DBR_OUTPUT_SEQEND (file);
1742 /* If the insn requiring the delay slot was a CALL_INSN, the
1743 insns in the delay slot are actually executed before the
1744 called function. Hence we don't preserve any CC-setting
1745 actions in these insns and the CC must be marked as being
1746 clobbered by the function. */
1747 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
1750 /* Following a conditional branch sequence, we have a new basic
1752 if (profile_block_flag)
1754 rtx insn = XVECEXP (body, 0, 0);
1755 rtx body = PATTERN (insn);
1757 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
1758 && GET_CODE (SET_SRC (body)) != LABEL_REF)
1759 || (GET_CODE (insn) == JUMP_INSN
1760 && GET_CODE (body) == PARALLEL
1761 && GET_CODE (XVECEXP (body, 0, 0)) == SET
1762 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
1768 /* We have a real machine instruction as rtl. */
1770 body = PATTERN (insn);
1773 /* Check for redundant test and compare instructions
1774 (when the condition codes are already set up as desired).
1775 This is done only when optimizing; if not optimizing,
1776 it should be possible for the user to alter a variable
1777 with the debugger in between statements
1778 and the next statement should reexamine the variable
1779 to compute the condition codes. */
1783 rtx set = single_set(insn);
1786 && GET_CODE (SET_DEST (set)) == CC0
1787 && insn != last_ignored_compare)
1789 if (GET_CODE (SET_SRC (set)) == SUBREG)
1790 SET_SRC (set) = alter_subreg (SET_SRC (set));
1791 else if (GET_CODE (SET_SRC (set)) == COMPARE)
1793 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
1794 XEXP (SET_SRC (set), 0)
1795 = alter_subreg (XEXP (SET_SRC (set), 0));
1796 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
1797 XEXP (SET_SRC (set), 1)
1798 = alter_subreg (XEXP (SET_SRC (set), 1));
1800 if ((cc_status.value1 != 0
1801 && rtx_equal_p (SET_SRC (set), cc_status.value1))
1802 || (cc_status.value2 != 0
1803 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
1805 /* Don't delete insn if it has an addressing side-effect. */
1806 if (! FIND_REG_INC_NOTE (insn, 0)
1807 /* or if anything in it is volatile. */
1808 && ! volatile_refs_p (PATTERN (insn)))
1810 /* We don't really delete the insn; just ignore it. */
1811 last_ignored_compare = insn;
1819 /* Following a conditional branch, we have a new basic block.
1820 But if we are inside a sequence, the new block starts after the
1821 last insn of the sequence. */
1822 if (profile_block_flag && final_sequence == 0
1823 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
1824 && GET_CODE (SET_SRC (body)) != LABEL_REF)
1825 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
1826 && GET_CODE (XVECEXP (body, 0, 0)) == SET
1827 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
1831 /* Don't bother outputting obvious no-ops, even without -O.
1832 This optimization is fast and doesn't interfere with debugging.
1833 Don't do this if the insn is in a delay slot, since this
1834 will cause an improper number of delay insns to be written. */
1835 if (final_sequence == 0
1837 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
1838 && GET_CODE (SET_SRC (body)) == REG
1839 && GET_CODE (SET_DEST (body)) == REG
1840 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
1845 /* If this is a conditional branch, maybe modify it
1846 if the cc's are in a nonstandard state
1847 so that it accomplishes the same thing that it would
1848 do straightforwardly if the cc's were set up normally. */
1850 if (cc_status.flags != 0
1851 && GET_CODE (insn) == JUMP_INSN
1852 && GET_CODE (body) == SET
1853 && SET_DEST (body) == pc_rtx
1854 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
1855 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
1856 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
1857 /* This is done during prescan; it is not done again
1858 in final scan when prescan has been done. */
1861 /* This function may alter the contents of its argument
1862 and clear some of the cc_status.flags bits.
1863 It may also return 1 meaning condition now always true
1864 or -1 meaning condition now always false
1865 or 2 meaning condition nontrivial but altered. */
1866 register int result = alter_cond (XEXP (SET_SRC (body), 0));
1867 /* If condition now has fixed value, replace the IF_THEN_ELSE
1868 with its then-operand or its else-operand. */
1870 SET_SRC (body) = XEXP (SET_SRC (body), 1);
1872 SET_SRC (body) = XEXP (SET_SRC (body), 2);
1874 /* The jump is now either unconditional or a no-op.
1875 If it has become a no-op, don't try to output it.
1876 (It would not be recognized.) */
1877 if (SET_SRC (body) == pc_rtx)
1879 PUT_CODE (insn, NOTE);
1880 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1881 NOTE_SOURCE_FILE (insn) = 0;
1884 else if (GET_CODE (SET_SRC (body)) == RETURN)
1885 /* Replace (set (pc) (return)) with (return). */
1886 PATTERN (insn) = body = SET_SRC (body);
1888 /* Rerecognize the instruction if it has changed. */
1890 INSN_CODE (insn) = -1;
1893 /* Make same adjustments to instructions that examine the
1894 condition codes without jumping and instructions that
1895 handle conditional moves (if this machine has either one). */
1897 if (cc_status.flags != 0
1898 && GET_CODE (body) == SET)
1900 rtx cond_rtx, then_rtx, else_rtx;
1902 if (GET_CODE (insn) != JUMP_INSN
1903 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE)
1905 cond_rtx = XEXP (SET_SRC (body), 0);
1906 then_rtx = XEXP (SET_SRC (body), 1);
1907 else_rtx = XEXP (SET_SRC (body), 2);
1911 cond_rtx = SET_SRC (body);
1912 then_rtx = const_true_rtx;
1913 else_rtx = const0_rtx;
1916 switch (GET_CODE (cond_rtx))
1929 register int result;
1930 if (XEXP (cond_rtx, 0) != cc0_rtx)
1932 result = alter_cond (cond_rtx);
1934 validate_change (insn, &SET_SRC (body), then_rtx, 0);
1935 else if (result == -1)
1936 validate_change (insn, &SET_SRC (body), else_rtx, 0);
1937 else if (result == 2)
1938 INSN_CODE (insn) = -1;
1939 if (SET_DEST (body) == SET_SRC (body))
1941 PUT_CODE (insn, NOTE);
1942 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1943 NOTE_SOURCE_FILE (insn) = 0;
1952 /* Do machine-specific peephole optimizations if desired. */
1954 if (optimize && !flag_no_peephole && !nopeepholes)
1956 rtx next = peephole (insn);
1957 /* When peepholing, if there were notes within the peephole,
1958 emit them before the peephole. */
1959 if (next != 0 && next != NEXT_INSN (insn))
1961 rtx prev = PREV_INSN (insn);
1964 for (note = NEXT_INSN (insn); note != next;
1965 note = NEXT_INSN (note))
1966 final_scan_insn (note, file, optimize, prescan, nopeepholes);
1968 /* In case this is prescan, put the notes
1969 in proper position for later rescan. */
1970 note = NEXT_INSN (insn);
1971 PREV_INSN (note) = prev;
1972 NEXT_INSN (prev) = note;
1973 NEXT_INSN (PREV_INSN (next)) = insn;
1974 PREV_INSN (insn) = PREV_INSN (next);
1975 NEXT_INSN (insn) = next;
1976 PREV_INSN (next) = insn;
1979 /* PEEPHOLE might have changed this. */
1980 body = PATTERN (insn);
1983 /* Try to recognize the instruction.
1984 If successful, verify that the operands satisfy the
1985 constraints for the instruction. Crash if they don't,
1986 since `reload' should have changed them so that they do. */
1988 insn_code_number = recog_memoized (insn);
1989 insn_extract (insn);
1990 for (i = 0; i < insn_n_operands[insn_code_number]; i++)
1992 if (GET_CODE (recog_operand[i]) == SUBREG)
1993 recog_operand[i] = alter_subreg (recog_operand[i]);
1994 else if (GET_CODE (recog_operand[i]) == PLUS
1995 || GET_CODE (recog_operand[i]) == MULT)
1996 recog_operand[i] = walk_alter_subreg (recog_operand[i]);
1999 for (i = 0; i < insn_n_dups[insn_code_number]; i++)
2001 if (GET_CODE (*recog_dup_loc[i]) == SUBREG)
2002 *recog_dup_loc[i] = alter_subreg (*recog_dup_loc[i]);
2003 else if (GET_CODE (*recog_dup_loc[i]) == PLUS
2004 || GET_CODE (*recog_dup_loc[i]) == MULT)
2005 *recog_dup_loc[i] = walk_alter_subreg (*recog_dup_loc[i]);
2008 #ifdef REGISTER_CONSTRAINTS
2009 if (! constrain_operands (insn_code_number, 1))
2010 fatal_insn_not_found (insn);
2013 /* Some target machines need to prescan each insn before
2016 #ifdef FINAL_PRESCAN_INSN
2017 FINAL_PRESCAN_INSN (insn, recog_operand,
2018 insn_n_operands[insn_code_number]);
2022 cc_prev_status = cc_status;
2024 /* Update `cc_status' for this instruction.
2025 The instruction's output routine may change it further.
2026 If the output routine for a jump insn needs to depend
2027 on the cc status, it should look at cc_prev_status. */
2029 NOTICE_UPDATE_CC (body, insn);
2034 /* If the proper template needs to be chosen by some C code,
2035 run that code and get the real template. */
2037 template = insn_template[insn_code_number];
2040 template = (*insn_outfun[insn_code_number]) (recog_operand, insn);
2042 /* If the C code returns 0, it means that it is a jump insn
2043 which follows a deleted test insn, and that test insn
2044 needs to be reinserted. */
2047 if (prev_nonnote_insn (insn) != last_ignored_compare)
2050 return prev_nonnote_insn (insn);
2054 /* If the template is the string "#", it means that this insn must
2056 if (template[0] == '#' && template[1] == '\0')
2058 rtx new = try_split (body, insn, 0);
2060 /* If we didn't split the insn, go away. */
2061 if (new == insn && PATTERN (new) == body)
2071 /* Output assembler code from the template. */
2073 output_asm_insn (template, recog_operand);
2076 /* It's not at all clear why we did this and doing so interferes
2077 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2080 /* Mark this insn as having been output. */
2081 INSN_DELETED_P (insn) = 1;
2087 return NEXT_INSN (insn);
2090 /* Output debugging info to the assembler file FILE
2091 based on the NOTE-insn INSN, assumed to be a line number. */
2094 output_source_line (file, insn)
2098 register char *filename = NOTE_SOURCE_FILE (insn);
2100 /* Remember filename for basic block profiling.
2101 Filenames are allocated on the permanent obstack
2102 or are passed in ARGV, so we don't have to save
2105 if (profile_block_flag && last_filename != filename)
2106 bb_file_label_num = add_bb_string (filename, TRUE);
2108 last_filename = filename;
2109 last_linenum = NOTE_LINE_NUMBER (insn);
2110 high_block_linenum = MAX (last_linenum, high_block_linenum);
2111 high_function_linenum = MAX (last_linenum, high_function_linenum);
2113 if (write_symbols != NO_DEBUG)
2115 #ifdef SDB_DEBUGGING_INFO
2116 if (write_symbols == SDB_DEBUG
2117 #if 0 /* People like having line numbers even in wrong file! */
2118 /* COFF can't handle multiple source files--lose, lose. */
2119 && !strcmp (filename, main_input_filename)
2121 /* COFF relative line numbers must be positive. */
2122 && last_linenum > sdb_begin_function_line)
2124 #ifdef ASM_OUTPUT_SOURCE_LINE
2125 ASM_OUTPUT_SOURCE_LINE (file, last_linenum);
2127 fprintf (file, "\t.ln\t%d\n",
2128 ((sdb_begin_function_line > -1)
2129 ? last_linenum - sdb_begin_function_line : 1));
2134 #if defined (DBX_DEBUGGING_INFO)
2135 if (write_symbols == DBX_DEBUG)
2136 dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn));
2139 #if defined (XCOFF_DEBUGGING_INFO)
2140 if (write_symbols == XCOFF_DEBUG)
2141 xcoffout_source_line (file, filename, insn);
2144 #ifdef DWARF_DEBUGGING_INFO
2145 if (write_symbols == DWARF_DEBUG)
2146 dwarfout_line (filename, NOTE_LINE_NUMBER (insn));
2151 /* If X is a SUBREG, replace it with a REG or a MEM,
2152 based on the thing it is a subreg of. */
2158 register rtx y = SUBREG_REG (x);
2159 if (GET_CODE (y) == SUBREG)
2160 y = alter_subreg (y);
2162 if (GET_CODE (y) == REG)
2164 /* If the containing reg really gets a hard reg, so do we. */
2166 REGNO (x) = REGNO (y) + SUBREG_WORD (x);
2168 else if (GET_CODE (y) == MEM)
2170 register int offset = SUBREG_WORD (x) * UNITS_PER_WORD;
2171 if (BYTES_BIG_ENDIAN)
2172 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x)))
2173 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y))));
2175 MEM_VOLATILE_P (x) = MEM_VOLATILE_P (y);
2176 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
2182 /* Do alter_subreg on all the SUBREGs contained in X. */
2185 walk_alter_subreg (x)
2188 switch (GET_CODE (x))
2192 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
2193 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
2197 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
2201 return alter_subreg (x);
2209 /* Given BODY, the body of a jump instruction, alter the jump condition
2210 as required by the bits that are set in cc_status.flags.
2211 Not all of the bits there can be handled at this level in all cases.
2213 The value is normally 0.
2214 1 means that the condition has become always true.
2215 -1 means that the condition has become always false.
2216 2 means that COND has been altered. */
2224 if (cc_status.flags & CC_REVERSED)
2227 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
2230 if (cc_status.flags & CC_INVERTED)
2233 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
2236 if (cc_status.flags & CC_NOT_POSITIVE)
2237 switch (GET_CODE (cond))
2242 /* Jump becomes unconditional. */
2248 /* Jump becomes no-op. */
2252 PUT_CODE (cond, EQ);
2257 PUT_CODE (cond, NE);
2262 if (cc_status.flags & CC_NOT_NEGATIVE)
2263 switch (GET_CODE (cond))
2267 /* Jump becomes unconditional. */
2272 /* Jump becomes no-op. */
2277 PUT_CODE (cond, EQ);
2283 PUT_CODE (cond, NE);
2288 if (cc_status.flags & CC_NO_OVERFLOW)
2289 switch (GET_CODE (cond))
2292 /* Jump becomes unconditional. */
2296 PUT_CODE (cond, EQ);
2301 PUT_CODE (cond, NE);
2306 /* Jump becomes no-op. */
2310 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
2311 switch (GET_CODE (cond))
2324 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
2329 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
2334 if (cc_status.flags & CC_NOT_SIGNED)
2335 /* The flags are valid if signed condition operators are converted
2337 switch (GET_CODE (cond))
2340 PUT_CODE (cond, LEU);
2345 PUT_CODE (cond, LTU);
2350 PUT_CODE (cond, GTU);
2355 PUT_CODE (cond, GEU);
2364 /* Report inconsistency between the assembler template and the operands.
2365 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
2368 output_operand_lossage (str)
2371 if (this_is_asm_operands)
2372 error_for_asm (this_is_asm_operands, "invalid `asm': %s", str);
2377 /* Output of assembler code from a template, and its subroutines. */
2379 /* Output text from TEMPLATE to the assembler output file,
2380 obeying %-directions to substitute operands taken from
2381 the vector OPERANDS.
2383 %N (for N a digit) means print operand N in usual manner.
2384 %lN means require operand N to be a CODE_LABEL or LABEL_REF
2385 and print the label name with no punctuation.
2386 %cN means require operand N to be a constant
2387 and print the constant expression with no punctuation.
2388 %aN means expect operand N to be a memory address
2389 (not a memory reference!) and print a reference
2391 %nN means expect operand N to be a constant
2392 and print a constant expression for minus the value
2393 of the operand, with no other punctuation. */
2398 if (flag_print_asm_name)
2400 /* Annotate the assembly with a comment describing the pattern and
2401 alternative used. */
2404 register int num = INSN_CODE (debug_insn);
2405 fprintf (asm_out_file, " %s %d %s",
2406 ASM_COMMENT_START, INSN_UID (debug_insn), insn_name[num]);
2407 if (insn_n_alternatives[num] > 1)
2408 fprintf (asm_out_file, "/%d", which_alternative + 1);
2410 /* Clear this so only the first assembler insn
2411 of any rtl insn will get the special comment for -dp. */
2418 output_asm_insn (template, operands)
2425 /* An insn may return a null string template
2426 in a case where no assembler code is needed. */
2431 putc ('\t', asm_out_file);
2433 #ifdef ASM_OUTPUT_OPCODE
2434 ASM_OUTPUT_OPCODE (asm_out_file, p);
2442 putc (c, asm_out_file);
2443 #ifdef ASM_OUTPUT_OPCODE
2444 while ((c = *p) == '\t')
2446 putc (c, asm_out_file);
2449 ASM_OUTPUT_OPCODE (asm_out_file, p);
2453 #ifdef ASSEMBLER_DIALECT
2455 /* If we want the first dialect, do nothing. Otherwise, skip
2456 DIALECT_NUMBER of strings ending with '|'. */
2457 for (i = 0; i < dialect_number; i++)
2459 while (*p && *p++ != '|')
2468 /* Skip to close brace. */
2469 while (*p && *p++ != '}')
2478 /* %% outputs a single %. */
2482 putc (c, asm_out_file);
2484 /* %= outputs a number which is unique to each insn in the entire
2485 compilation. This is useful for making local labels that are
2486 referred to more than once in a given insn. */
2490 fprintf (asm_out_file, "%d", insn_counter);
2492 /* % followed by a letter and some digits
2493 outputs an operand in a special way depending on the letter.
2494 Letters `acln' are implemented directly.
2495 Other letters are passed to `output_operand' so that
2496 the PRINT_OPERAND macro can define them. */
2497 else if ((*p >= 'a' && *p <= 'z')
2498 || (*p >= 'A' && *p <= 'Z'))
2503 if (! (*p >= '0' && *p <= '9'))
2504 output_operand_lossage ("operand number missing after %-letter");
2505 else if (this_is_asm_operands && c >= (unsigned) insn_noperands)
2506 output_operand_lossage ("operand number out of range");
2507 else if (letter == 'l')
2508 output_asm_label (operands[c]);
2509 else if (letter == 'a')
2510 output_address (operands[c]);
2511 else if (letter == 'c')
2513 if (CONSTANT_ADDRESS_P (operands[c]))
2514 output_addr_const (asm_out_file, operands[c]);
2516 output_operand (operands[c], 'c');
2518 else if (letter == 'n')
2520 if (GET_CODE (operands[c]) == CONST_INT)
2521 fprintf (asm_out_file,
2522 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2527 - INTVAL (operands[c]));
2530 putc ('-', asm_out_file);
2531 output_addr_const (asm_out_file, operands[c]);
2535 output_operand (operands[c], letter);
2537 while ((c = *p) >= '0' && c <= '9') p++;
2539 /* % followed by a digit outputs an operand the default way. */
2540 else if (*p >= '0' && *p <= '9')
2543 if (this_is_asm_operands && c >= (unsigned) insn_noperands)
2544 output_operand_lossage ("operand number out of range");
2546 output_operand (operands[c], 0);
2547 while ((c = *p) >= '0' && c <= '9') p++;
2549 /* % followed by punctuation: output something for that
2550 punctuation character alone, with no operand.
2551 The PRINT_OPERAND macro decides what is actually done. */
2552 #ifdef PRINT_OPERAND_PUNCT_VALID_P
2553 else if (PRINT_OPERAND_PUNCT_VALID_P (*p))
2554 output_operand (NULL_RTX, *p++);
2557 output_operand_lossage ("invalid %%-code");
2561 putc (c, asm_out_file);
2566 putc ('\n', asm_out_file);
2569 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
2572 output_asm_label (x)
2577 if (GET_CODE (x) == LABEL_REF)
2578 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
2579 else if (GET_CODE (x) == CODE_LABEL)
2580 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
2582 output_operand_lossage ("`%l' operand isn't a label");
2584 assemble_name (asm_out_file, buf);
2587 /* Print operand X using machine-dependent assembler syntax.
2588 The macro PRINT_OPERAND is defined just to control this function.
2589 CODE is a non-digit that preceded the operand-number in the % spec,
2590 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
2591 between the % and the digits.
2592 When CODE is a non-letter, X is 0.
2594 The meanings of the letters are machine-dependent and controlled
2595 by PRINT_OPERAND. */
2598 output_operand (x, code)
2602 if (x && GET_CODE (x) == SUBREG)
2603 x = alter_subreg (x);
2605 /* If X is a pseudo-register, abort now rather than writing trash to the
2608 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
2611 PRINT_OPERAND (asm_out_file, x, code);
2614 /* Print a memory reference operand for address X
2615 using machine-dependent assembler syntax.
2616 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
2622 walk_alter_subreg (x);
2623 PRINT_OPERAND_ADDRESS (asm_out_file, x);
2626 /* Print an integer constant expression in assembler syntax.
2627 Addition and subtraction are the only arithmetic
2628 that may appear in these expressions. */
2631 output_addr_const (file, x)
2638 switch (GET_CODE (x))
2648 assemble_name (file, XSTR (x, 0));
2652 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0)));
2653 assemble_name (file, buf);
2657 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
2658 assemble_name (file, buf);
2663 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2672 /* This used to output parentheses around the expression,
2673 but that does not work on the 386 (either ATT or BSD assembler). */
2674 output_addr_const (file, XEXP (x, 0));
2678 if (GET_MODE (x) == VOIDmode)
2680 /* We can use %d if the number is one word and positive. */
2681 if (CONST_DOUBLE_HIGH (x))
2683 #if HOST_BITS_PER_WIDE_INT == 64
2684 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
2690 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
2696 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
2697 else if (CONST_DOUBLE_LOW (x) < 0)
2699 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2704 CONST_DOUBLE_LOW (x));
2707 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2712 CONST_DOUBLE_LOW (x));
2715 /* We can't handle floating point constants;
2716 PRINT_OPERAND must handle them. */
2717 output_operand_lossage ("floating constant misused");
2721 /* Some assemblers need integer constants to appear last (eg masm). */
2722 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
2724 output_addr_const (file, XEXP (x, 1));
2725 if (INTVAL (XEXP (x, 0)) >= 0)
2726 fprintf (file, "+");
2727 output_addr_const (file, XEXP (x, 0));
2731 output_addr_const (file, XEXP (x, 0));
2732 if (INTVAL (XEXP (x, 1)) >= 0)
2733 fprintf (file, "+");
2734 output_addr_const (file, XEXP (x, 1));
2739 /* Avoid outputting things like x-x or x+5-x,
2740 since some assemblers can't handle that. */
2741 x = simplify_subtraction (x);
2742 if (GET_CODE (x) != MINUS)
2745 output_addr_const (file, XEXP (x, 0));
2746 fprintf (file, "-");
2747 if (GET_CODE (XEXP (x, 1)) == CONST_INT
2748 && INTVAL (XEXP (x, 1)) < 0)
2750 fprintf (file, ASM_OPEN_PAREN);
2751 output_addr_const (file, XEXP (x, 1));
2752 fprintf (file, ASM_CLOSE_PAREN);
2755 output_addr_const (file, XEXP (x, 1));
2760 output_addr_const (file, XEXP (x, 0));
2764 output_operand_lossage ("invalid expression as operand");
2768 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
2769 %R prints the value of REGISTER_PREFIX.
2770 %L prints the value of LOCAL_LABEL_PREFIX.
2771 %U prints the value of USER_LABEL_PREFIX.
2772 %I prints the value of IMMEDIATE_PREFIX.
2773 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
2774 Also supported are %d, %x, %s, %e, %f, %g and %%.
2776 We handle alternate assembler dialects here, just like output_asm_insn. */
2779 asm_fprintf VPROTO((FILE *file, char *p, ...))
2790 VA_START (argptr, p);
2793 file = va_arg (argptr, FILE *);
2794 p = va_arg (argptr, char *);
2802 #ifdef ASSEMBLER_DIALECT
2804 /* If we want the first dialect, do nothing. Otherwise, skip
2805 DIALECT_NUMBER of strings ending with '|'. */
2806 for (i = 0; i < dialect_number; i++)
2808 while (*p && *p++ != '|')
2817 /* Skip to close brace. */
2818 while (*p && *p++ != '}')
2829 while ((c >= '0' && c <= '9') || c == '.')
2837 fprintf (file, "%%");
2840 case 'd': case 'i': case 'u':
2841 case 'x': case 'p': case 'X':
2845 fprintf (file, buf, va_arg (argptr, int));
2849 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
2850 but we do not check for those cases. It means that the value
2851 is a HOST_WIDE_INT, which may be either `int' or `long'. */
2853 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
2859 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
2866 fprintf (file, buf, va_arg (argptr, long));
2874 fprintf (file, buf, va_arg (argptr, double));
2880 fprintf (file, buf, va_arg (argptr, char *));
2884 #ifdef ASM_OUTPUT_OPCODE
2885 ASM_OUTPUT_OPCODE (asm_out_file, p);
2890 #ifdef REGISTER_PREFIX
2891 fprintf (file, "%s", REGISTER_PREFIX);
2896 #ifdef IMMEDIATE_PREFIX
2897 fprintf (file, "%s", IMMEDIATE_PREFIX);
2902 #ifdef LOCAL_LABEL_PREFIX
2903 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
2908 #ifdef USER_LABEL_PREFIX
2909 fprintf (file, "%s", USER_LABEL_PREFIX);
2923 /* Split up a CONST_DOUBLE or integer constant rtx
2924 into two rtx's for single words,
2925 storing in *FIRST the word that comes first in memory in the target
2926 and in *SECOND the other. */
2929 split_double (value, first, second)
2931 rtx *first, *second;
2933 if (GET_CODE (value) == CONST_INT)
2935 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
2937 /* In this case the CONST_INT holds both target words.
2938 Extract the bits from it into two word-sized pieces. */
2940 HOST_WIDE_INT word_mask;
2941 /* Avoid warnings for shift count >= BITS_PER_WORD. */
2942 int shift_count = BITS_PER_WORD - 1;
2944 word_mask = (HOST_WIDE_INT) 1 << shift_count;
2945 word_mask |= word_mask - 1;
2946 low = GEN_INT (INTVAL (value) & word_mask);
2947 high = GEN_INT ((INTVAL (value) >> (shift_count + 1)) & word_mask);
2948 if (WORDS_BIG_ENDIAN)
2961 /* The rule for using CONST_INT for a wider mode
2962 is that we regard the value as signed.
2963 So sign-extend it. */
2964 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
2965 if (WORDS_BIG_ENDIAN)
2977 else if (GET_CODE (value) != CONST_DOUBLE)
2979 if (WORDS_BIG_ENDIAN)
2981 *first = const0_rtx;
2987 *second = const0_rtx;
2990 else if (GET_MODE (value) == VOIDmode
2991 /* This is the old way we did CONST_DOUBLE integers. */
2992 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
2994 /* In an integer, the words are defined as most and least significant.
2995 So order them by the target's convention. */
2996 if (WORDS_BIG_ENDIAN)
2998 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
2999 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3003 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3004 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3009 #ifdef REAL_ARITHMETIC
3010 REAL_VALUE_TYPE r; long l[2];
3011 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
3013 /* Note, this converts the REAL_VALUE_TYPE to the target's
3014 format, splits up the floating point double and outputs
3015 exactly 32 bits of it into each of l[0] and l[1] --
3016 not necessarily BITS_PER_WORD bits. */
3017 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
3019 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
3020 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
3022 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
3023 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
3024 && ! flag_pretend_float)
3028 #ifdef HOST_WORDS_BIG_ENDIAN
3035 /* Host and target agree => no need to swap. */
3036 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3037 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3041 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3042 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3044 #endif /* no REAL_ARITHMETIC */
3048 /* Return nonzero if this function has no function calls. */
3055 if (profile_flag || profile_block_flag)
3058 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3060 if (GET_CODE (insn) == CALL_INSN)
3062 if (GET_CODE (insn) == INSN
3063 && GET_CODE (PATTERN (insn)) == SEQUENCE
3064 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN)
3067 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
3069 if (GET_CODE (XEXP (insn, 0)) == CALL_INSN)
3071 if (GET_CODE (XEXP (insn, 0)) == INSN
3072 && GET_CODE (PATTERN (XEXP (insn, 0))) == SEQUENCE
3073 && GET_CODE (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)) == CALL_INSN)
3080 /* On some machines, a function with no call insns
3081 can run faster if it doesn't create its own register window.
3082 When output, the leaf function should use only the "output"
3083 registers. Ordinarily, the function would be compiled to use
3084 the "input" registers to find its arguments; it is a candidate
3085 for leaf treatment if it uses only the "input" registers.
3086 Leaf function treatment means renumbering so the function
3087 uses the "output" registers instead. */
3089 #ifdef LEAF_REGISTERS
3091 static char permitted_reg_in_leaf_functions[] = LEAF_REGISTERS;
3093 /* Return 1 if this function uses only the registers that can be
3094 safely renumbered. */
3097 only_leaf_regs_used ()
3101 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
3103 if ((regs_ever_live[i] || global_regs[i])
3104 && ! permitted_reg_in_leaf_functions[i])
3110 /* Scan all instructions and renumber all registers into those
3111 available in leaf functions. */
3114 leaf_renumber_regs (first)
3119 /* Renumber only the actual patterns.
3120 The reg-notes can contain frame pointer refs,
3121 and renumbering them could crash, and should not be needed. */
3122 for (insn = first; insn; insn = NEXT_INSN (insn))
3123 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
3124 leaf_renumber_regs_insn (PATTERN (insn));
3125 for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1))
3126 if (GET_RTX_CLASS (GET_CODE (XEXP (insn, 0))) == 'i')
3127 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
3130 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
3131 available in leaf functions. */
3134 leaf_renumber_regs_insn (in_rtx)
3135 register rtx in_rtx;
3138 register char *format_ptr;
3143 /* Renumber all input-registers into output-registers.
3144 renumbered_regs would be 1 for an output-register;
3147 if (GET_CODE (in_rtx) == REG)
3151 /* Don't renumber the same reg twice. */
3155 newreg = REGNO (in_rtx);
3156 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
3157 to reach here as part of a REG_NOTE. */
3158 if (newreg >= FIRST_PSEUDO_REGISTER)
3163 newreg = LEAF_REG_REMAP (newreg);
3166 regs_ever_live[REGNO (in_rtx)] = 0;
3167 regs_ever_live[newreg] = 1;
3168 REGNO (in_rtx) = newreg;
3172 if (GET_RTX_CLASS (GET_CODE (in_rtx)) == 'i')
3174 /* Inside a SEQUENCE, we find insns.
3175 Renumber just the patterns of these insns,
3176 just as we do for the top-level insns. */
3177 leaf_renumber_regs_insn (PATTERN (in_rtx));
3181 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
3183 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
3184 switch (*format_ptr++)
3187 leaf_renumber_regs_insn (XEXP (in_rtx, i));
3191 if (NULL != XVEC (in_rtx, i))
3193 for (j = 0; j < XVECLEN (in_rtx, i); j++)
3194 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));