1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92, 93, 94, 1995 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This is the final pass of the compiler.
23 It looks at the rtl code for a function and outputs assembler code.
25 Call `final_start_function' to output the assembler code for function entry,
26 `final' to output assembler code for some RTL code,
27 `final_end_function' to output assembler code for function exit.
28 If a function is compiled in several pieces, each piece is
29 output separately with `final'.
31 Some optimizations are also done at this level.
32 Move instructions that were made unnecessary by good register allocation
33 are detected and omitted from the output. (Though most of these
34 are removed by the last jump pass.)
36 Instructions to set the condition codes are omitted when it can be
37 seen that the condition codes already had the desired values.
39 In some cases it is sufficient if the inherited condition codes
40 have related values, but this may require the following insn
41 (the one that tests the condition codes) to be modified.
43 The code for the function prologue and epilogue are generated
44 directly as assembler code by the macros FUNCTION_PROLOGUE and
45 FUNCTION_EPILOGUE. Those instructions never exist as rtl. */
59 #include "insn-config.h"
60 #include "insn-flags.h"
61 #include "insn-attr.h"
62 #include "insn-codes.h"
64 #include "conditions.h"
67 #include "hard-reg-set.h"
71 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
72 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
73 #if defined (USG) || defined (NO_STAB_H)
74 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
76 #include <stab.h> /* On BSD, use the system's stab.h. */
78 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
80 #ifdef XCOFF_DEBUGGING_INFO
84 /* .stabd code for line number. */
89 /* .stabs code for included file name. */
95 #define INT_TYPE_SIZE BITS_PER_WORD
98 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
99 null default for it to save conditionalization later. */
100 #ifndef CC_STATUS_INIT
101 #define CC_STATUS_INIT
104 /* How to start an assembler comment. */
105 #ifndef ASM_COMMENT_START
106 #define ASM_COMMENT_START ";#"
109 /* Is the given character a logical line separator for the assembler? */
110 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
111 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
114 /* Nonzero means this function is a leaf function, with no function calls.
115 This variable exists to be examined in FUNCTION_PROLOGUE
116 and FUNCTION_EPILOGUE. Always zero, unless set by some action. */
119 /* Last insn processed by final_scan_insn. */
120 static rtx debug_insn
= 0;
122 /* Line number of last NOTE. */
123 static int last_linenum
;
125 /* Highest line number in current block. */
126 static int high_block_linenum
;
128 /* Likewise for function. */
129 static int high_function_linenum
;
131 /* Filename of last NOTE. */
132 static char *last_filename
;
134 /* Number of basic blocks seen so far;
135 used if profile_block_flag is set. */
136 static int count_basic_blocks
;
138 /* Nonzero while outputting an `asm' with operands.
139 This means that inconsistencies are the user's fault, so don't abort.
140 The precise value is the insn being output, to pass to error_for_asm. */
141 static rtx this_is_asm_operands
;
143 /* Number of operands of this insn, for an `asm' with operands. */
144 static int insn_noperands
;
146 /* Compare optimization flag. */
148 static rtx last_ignored_compare
= 0;
150 /* Flag indicating this insn is the start of a new basic block. */
152 static int new_block
= 1;
154 /* All the symbol-blocks (levels of scoping) in the compilation
155 are assigned sequence numbers in order of appearance of the
156 beginnings of the symbol-blocks. Both final and dbxout do this,
157 and assume that they will both give the same number to each block.
158 Final uses these sequence numbers to generate assembler label names
159 LBBnnn and LBEnnn for the beginning and end of the symbol-block.
160 Dbxout uses the sequence numbers to generate references to the same labels
161 from the dbx debugging information.
163 Sdb records this level at the beginning of each function,
164 in order to find the current level when recursing down declarations.
165 It outputs the block beginning and endings
166 at the point in the asm file where the blocks would begin and end. */
168 int next_block_index
;
170 /* Assign a unique number to each insn that is output.
171 This can be used to generate unique local labels. */
173 static int insn_counter
= 0;
176 /* This variable contains machine-dependent flags (defined in tm.h)
177 set and examined by output routines
178 that describe how to interpret the condition codes properly. */
182 /* During output of an insn, this contains a copy of cc_status
183 from before the insn. */
185 CC_STATUS cc_prev_status
;
188 /* Indexed by hardware reg number, is 1 if that register is ever
189 used in the current function.
191 In life_analysis, or in stupid_life_analysis, this is set
192 up to record the hard regs used explicitly. Reload adds
193 in the hard regs used for holding pseudo regs. Final uses
194 it to generate the code in the function prologue and epilogue
195 to save and restore registers as needed. */
197 char regs_ever_live
[FIRST_PSEUDO_REGISTER
];
199 /* Nonzero means current function must be given a frame pointer.
200 Set in stmt.c if anything is allocated on the stack there.
201 Set in reload1.c if anything is allocated on the stack there. */
203 int frame_pointer_needed
;
205 /* Assign unique numbers to labels generated for profiling. */
207 int profile_label_no
;
209 /* Length so far allocated in PENDING_BLOCKS. */
211 static int max_block_depth
;
213 /* Stack of sequence numbers of symbol-blocks of which we have seen the
214 beginning but not yet the end. Sequence numbers are assigned at
215 the beginning; this stack allows us to find the sequence number
216 of a block that is ending. */
218 static int *pending_blocks
;
220 /* Number of elements currently in use in PENDING_BLOCKS. */
222 static int block_depth
;
224 /* Nonzero if have enabled APP processing of our assembler output. */
228 /* If we are outputting an insn sequence, this contains the sequence rtx.
233 #ifdef ASSEMBLER_DIALECT
235 /* Number of the assembler dialect to use, starting at 0. */
236 static int dialect_number
;
239 /* Indexed by line number, nonzero if there is a note for that line. */
241 static char *line_note_exists
;
243 /* Linked list to hold line numbers for each basic block. */
246 struct bb_list
*next
; /* pointer to next basic block */
247 int line_num
; /* line number */
248 int file_label_num
; /* LPBC<n> label # for stored filename */
249 int func_label_num
; /* LPBC<n> label # for stored function name */
252 static struct bb_list
*bb_head
= 0; /* Head of basic block list */
253 static struct bb_list
**bb_tail
= &bb_head
; /* Ptr to store next bb ptr */
254 static int bb_file_label_num
= -1; /* Current label # for file */
255 static int bb_func_label_num
= -1; /* Current label # for func */
257 /* Linked list to hold the strings for each file and function name output. */
260 struct bb_str
*next
; /* pointer to next string */
261 char *string
; /* string */
262 int label_num
; /* label number */
263 int length
; /* string length */
266 extern rtx peephole
PROTO((rtx
));
268 static struct bb_str
*sbb_head
= 0; /* Head of string list. */
269 static struct bb_str
**sbb_tail
= &sbb_head
; /* Ptr to store next bb str */
270 static int sbb_label_num
= 0; /* Last label used */
272 static int asm_insn_count
PROTO((rtx
));
273 static void profile_function
PROTO((FILE *));
274 static void profile_after_prologue
PROTO((FILE *));
275 static void add_bb
PROTO((FILE *));
276 static int add_bb_string
PROTO((char *, int));
277 static void output_source_line
PROTO((FILE *, rtx
));
278 static rtx walk_alter_subreg
PROTO((rtx
));
279 static int alter_cond
PROTO((rtx
));
280 static void output_asm_name
PROTO((void));
281 static void output_operand
PROTO((rtx
, int));
282 static void leaf_renumber_regs
PROTO((rtx
));
284 extern char *getpwd ();
286 /* Initialize data in final at the beginning of a compilation. */
289 init_final (filename
)
292 next_block_index
= 2;
294 max_block_depth
= 20;
295 pending_blocks
= (int *) xmalloc (20 * sizeof *pending_blocks
);
298 #ifdef ASSEMBLER_DIALECT
299 dialect_number
= ASSEMBLER_DIALECT
;
303 /* Called at end of source file,
304 to output the block-profiling table for this entire compilation. */
312 if (profile_block_flag
)
315 int align
= exact_log2 (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
);
316 int size
= (POINTER_SIZE
/ BITS_PER_UNIT
) * count_basic_blocks
;
321 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
322 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
323 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
327 /* Output the main header, of 10 words:
328 0: 1 if this file's initialized, else 0.
329 1: address of file name (LPBX1).
330 2: address of table of counts (LPBX2).
331 3: number of counts in the table.
332 4: always 0, for compatibility with Sun.
334 The following are GNU extensions:
336 5: address of table of start addrs of basic blocks (LPBX3).
337 6: Number of bytes in this header.
338 7: address of table of function names (LPBX4).
339 8: address of table of line numbers (LPBX5) or 0.
340 9: address of table of file names (LPBX6) or 0. */
342 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
344 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 0);
346 assemble_integer (const0_rtx
, UNITS_PER_WORD
, 1);
348 /* address of filename */
349 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 1);
350 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), UNITS_PER_WORD
, 1);
352 /* address of count table */
353 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 2);
354 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), UNITS_PER_WORD
, 1);
356 /* count of the # of basic blocks */
357 assemble_integer (GEN_INT (count_basic_blocks
), UNITS_PER_WORD
, 1);
359 /* zero word (link field) */
360 assemble_integer (const0_rtx
, UNITS_PER_WORD
, 1);
362 /* address of basic block start address table */
363 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 3);
364 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), UNITS_PER_WORD
, 1);
366 /* byte count for extended structure. */
367 assemble_integer (GEN_INT (10 * UNITS_PER_WORD
), UNITS_PER_WORD
, 1);
369 /* address of function name table */
370 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 4);
371 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), UNITS_PER_WORD
, 1);
373 /* address of line number and filename tables if debugging. */
374 if (write_symbols
!= NO_DEBUG
)
376 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 5);
377 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), UNITS_PER_WORD
, 1);
378 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 6);
379 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), UNITS_PER_WORD
, 1);
383 assemble_integer (const0_rtx
, UNITS_PER_WORD
, 1);
384 assemble_integer (const0_rtx
, UNITS_PER_WORD
, 1);
387 /* Output the file name changing the suffix to .d for Sun tcov
389 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 1);
391 char *cwd
= getpwd ();
392 int len
= strlen (filename
) + strlen (cwd
) + 1;
393 char *data_file
= (char *) alloca (len
+ 4);
395 strcpy (data_file
, cwd
);
396 strcat (data_file
, "/");
397 strcat (data_file
, filename
);
398 strip_off_ending (data_file
, len
);
399 strcat (data_file
, ".d");
400 assemble_string (data_file
, strlen (data_file
) + 1);
403 /* Make space for the table of counts. */
404 if (flag_no_common
|| size
== 0)
406 /* Realign data section. */
407 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
408 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 2);
410 assemble_zeros (size
);
414 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 2);
415 #ifdef ASM_OUTPUT_SHARED_LOCAL
416 if (flag_shared_data
)
417 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
420 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
421 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
,
424 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
428 /* Output any basic block strings */
429 readonly_data_section ();
432 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
433 for (sptr
= sbb_head
; sptr
!= 0; sptr
= sptr
->next
)
435 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBC", sptr
->label_num
);
436 assemble_string (sptr
->string
, sptr
->length
);
440 /* Output the table of addresses. */
441 /* Realign in new section */
442 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
443 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 3);
444 for (i
= 0; i
< count_basic_blocks
; i
++)
446 ASM_GENERATE_INTERNAL_LABEL (name
, "LPB", i
);
447 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
),
451 /* Output the table of function names. */
452 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 4);
453 for ((ptr
= bb_head
), (i
= 0); ptr
!= 0; (ptr
= ptr
->next
), i
++)
455 if (ptr
->func_label_num
>= 0)
457 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBC", ptr
->func_label_num
);
458 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
),
462 assemble_integer (const0_rtx
, UNITS_PER_WORD
, 1);
465 for ( ; i
< count_basic_blocks
; i
++)
466 assemble_integer (const0_rtx
, UNITS_PER_WORD
, 1);
468 if (write_symbols
!= NO_DEBUG
)
470 /* Output the table of line numbers. */
471 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 5);
472 for ((ptr
= bb_head
), (i
= 0); ptr
!= 0; (ptr
= ptr
->next
), i
++)
473 assemble_integer (GEN_INT (ptr
->line_num
), UNITS_PER_WORD
, 1);
475 for ( ; i
< count_basic_blocks
; i
++)
476 assemble_integer (const0_rtx
, UNITS_PER_WORD
, 1);
478 /* Output the table of file names. */
479 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 6);
480 for ((ptr
= bb_head
), (i
= 0); ptr
!= 0; (ptr
= ptr
->next
), i
++)
482 if (ptr
->file_label_num
>= 0)
484 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBC", ptr
->file_label_num
);
485 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
),
489 assemble_integer (const0_rtx
, UNITS_PER_WORD
, 1);
492 for ( ; i
< count_basic_blocks
; i
++)
493 assemble_integer (const0_rtx
, UNITS_PER_WORD
, 1);
496 /* End with the address of the table of addresses,
497 so we can find it easily, as the last word in the file's text. */
498 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 3);
499 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), UNITS_PER_WORD
, 1);
503 /* Enable APP processing of subsequent output.
504 Used before the output from an `asm' statement. */
511 fprintf (asm_out_file
, ASM_APP_ON
);
516 /* Disable APP processing of subsequent output.
517 Called from varasm.c before most kinds of output. */
524 fprintf (asm_out_file
, ASM_APP_OFF
);
529 /* Return the number of slots filled in the current
530 delayed branch sequence (we don't count the insn needing the
531 delay slot). Zero if not in a delayed branch sequence. */
535 dbr_sequence_length ()
537 if (final_sequence
!= 0)
538 return XVECLEN (final_sequence
, 0) - 1;
544 /* The next two pages contain routines used to compute the length of an insn
545 and to shorten branches. */
547 /* Arrays for insn lengths, and addresses. The latter is referenced by
548 `insn_current_length'. */
550 static short *insn_lengths
;
553 /* Address of insn being processed. Used by `insn_current_length'. */
554 int insn_current_address
;
556 /* Indicate that branch shortening hasn't yet been done. */
564 /* Obtain the current length of an insn. If branch shortening has been done,
565 get its actual length. Otherwise, get its maximum length. */
568 get_attr_length (insn
)
571 #ifdef HAVE_ATTR_length
577 return insn_lengths
[INSN_UID (insn
)];
579 switch (GET_CODE (insn
))
587 length
= insn_default_length (insn
);
591 body
= PATTERN (insn
);
592 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
594 /* This only takes room if jump tables go into the text section. */
595 #if !defined(READONLY_DATA_SECTION) || defined(JUMP_TABLES_IN_TEXT_SECTION)
596 length
= (XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
)
597 * GET_MODE_SIZE (GET_MODE (body
)));
599 /* Be pessimistic and assume worst-case alignment. */
600 length
+= (GET_MODE_SIZE (GET_MODE (body
)) - 1);
606 length
= insn_default_length (insn
);
610 body
= PATTERN (insn
);
611 if (GET_CODE (body
) == USE
|| GET_CODE (body
) == CLOBBER
)
614 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
615 length
= asm_insn_count (body
) * insn_default_length (insn
);
616 else if (GET_CODE (body
) == SEQUENCE
)
617 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
618 length
+= get_attr_length (XVECEXP (body
, 0, i
));
620 length
= insn_default_length (insn
);
623 #ifdef ADJUST_INSN_LENGTH
624 ADJUST_INSN_LENGTH (insn
, length
);
627 #else /* not HAVE_ATTR_length */
629 #endif /* not HAVE_ATTR_length */
632 /* Make a pass over all insns and compute their actual lengths by shortening
633 any branches of variable length if possible. */
635 /* Give a default value for the lowest address in a function. */
637 #ifndef FIRST_INSN_ADDRESS
638 #define FIRST_INSN_ADDRESS 0
642 shorten_branches (first
)
645 #ifdef HAVE_ATTR_length
647 int something_changed
= 1;
649 char *varying_length
;
653 /* Compute maximum UID and allocate arrays. */
654 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
655 if (INSN_UID (insn
) > max_uid
)
656 max_uid
= INSN_UID (insn
);
659 insn_lengths
= (short *) oballoc (max_uid
* sizeof (short));
660 insn_addresses
= (int *) oballoc (max_uid
* sizeof (int));
661 varying_length
= (char *) oballoc (max_uid
* sizeof (char));
663 /* Compute initial lengths, addresses, and varying flags for each insn. */
664 for (insn_current_address
= FIRST_INSN_ADDRESS
, insn
= first
;
666 insn_current_address
+= insn_lengths
[uid
], insn
= NEXT_INSN (insn
))
668 uid
= INSN_UID (insn
);
669 insn_addresses
[uid
] = insn_current_address
;
670 insn_lengths
[uid
] = 0;
671 varying_length
[uid
] = 0;
673 if (GET_CODE (insn
) == NOTE
|| GET_CODE (insn
) == BARRIER
674 || GET_CODE (insn
) == CODE_LABEL
)
677 body
= PATTERN (insn
);
678 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
680 /* This only takes room if read-only data goes into the text
682 #if !defined(READONLY_DATA_SECTION) || defined(JUMP_TABLES_IN_TEXT_SECTION)
683 int unitsize
= GET_MODE_SIZE (GET_MODE (body
));
685 insn_lengths
[uid
] = (XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
)
686 * GET_MODE_SIZE (GET_MODE (body
)));
688 /* Account for possible alignment. */
690 += unitsize
- (insn_current_address
& (unitsize
- 1));
695 else if (asm_noperands (body
) >= 0)
696 insn_lengths
[uid
] = asm_insn_count (body
) * insn_default_length (insn
);
697 else if (GET_CODE (body
) == SEQUENCE
)
700 int const_delay_slots
;
702 const_delay_slots
= const_num_delay_slots (XVECEXP (body
, 0, 0));
704 const_delay_slots
= 0;
706 /* Inside a delay slot sequence, we do not do any branch shortening
707 if the shortening could change the number of delay slots
709 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
711 rtx inner_insn
= XVECEXP (body
, 0, i
);
712 int inner_uid
= INSN_UID (inner_insn
);
715 if (asm_noperands (PATTERN (XVECEXP (body
, 0, i
))) >= 0)
716 inner_length
= (asm_insn_count (PATTERN (inner_insn
))
717 * insn_default_length (inner_insn
));
719 inner_length
= insn_default_length (inner_insn
);
721 insn_lengths
[inner_uid
] = inner_length
;
722 if (const_delay_slots
)
724 if ((varying_length
[inner_uid
]
725 = insn_variable_length_p (inner_insn
)) != 0)
726 varying_length
[uid
] = 1;
727 insn_addresses
[inner_uid
] = (insn_current_address
+
731 varying_length
[inner_uid
] = 0;
732 insn_lengths
[uid
] += inner_length
;
735 else if (GET_CODE (body
) != USE
&& GET_CODE (body
) != CLOBBER
)
737 insn_lengths
[uid
] = insn_default_length (insn
);
738 varying_length
[uid
] = insn_variable_length_p (insn
);
741 /* If needed, do any adjustment. */
742 #ifdef ADJUST_INSN_LENGTH
743 ADJUST_INSN_LENGTH (insn
, insn_lengths
[uid
]);
747 /* Now loop over all the insns finding varying length insns. For each,
748 get the current insn length. If it has changed, reflect the change.
749 When nothing changes for a full pass, we are done. */
751 while (something_changed
)
753 something_changed
= 0;
754 for (insn_current_address
= FIRST_INSN_ADDRESS
, insn
= first
;
756 insn
= NEXT_INSN (insn
))
761 uid
= INSN_UID (insn
);
762 insn_addresses
[uid
] = insn_current_address
;
763 if (! varying_length
[uid
])
765 insn_current_address
+= insn_lengths
[uid
];
768 if (GET_CODE (insn
) == INSN
&& GET_CODE (PATTERN (insn
)) == SEQUENCE
)
772 body
= PATTERN (insn
);
774 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
776 rtx inner_insn
= XVECEXP (body
, 0, i
);
777 int inner_uid
= INSN_UID (inner_insn
);
780 insn_addresses
[inner_uid
] = insn_current_address
;
782 /* insn_current_length returns 0 for insns with a
783 non-varying length. */
784 if (! varying_length
[inner_uid
])
785 inner_length
= insn_lengths
[inner_uid
];
787 inner_length
= insn_current_length (inner_insn
);
789 if (inner_length
!= insn_lengths
[inner_uid
])
791 insn_lengths
[inner_uid
] = inner_length
;
792 something_changed
= 1;
794 insn_current_address
+= insn_lengths
[inner_uid
];
795 new_length
+= inner_length
;
800 new_length
= insn_current_length (insn
);
801 insn_current_address
+= new_length
;
804 #ifdef SHORTEN_WITH_ADJUST_INSN_LENGTH
805 #ifdef ADJUST_INSN_LENGTH
806 /* If needed, do any adjustment. */
807 tmp_length
= new_length
;
808 ADJUST_INSN_LENGTH (insn
, new_length
);
809 insn_current_address
+= (new_length
- tmp_length
);
813 if (new_length
!= insn_lengths
[uid
])
815 insn_lengths
[uid
] = new_length
;
816 something_changed
= 1;
819 /* For a non-optimizing compile, do only a single pass. */
823 #endif /* HAVE_ATTR_length */
826 #ifdef HAVE_ATTR_length
827 /* Given the body of an INSN known to be generated by an ASM statement, return
828 the number of machine instructions likely to be generated for this insn.
829 This is used to compute its length. */
832 asm_insn_count (body
)
838 if (GET_CODE (body
) == ASM_INPUT
)
839 template = XSTR (body
, 0);
841 template = decode_asm_operands (body
, NULL_PTR
, NULL_PTR
,
844 for ( ; *template; template++)
845 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
852 /* Output assembler code for the start of a function,
853 and initialize some of the variables in this file
854 for the new function. The label for the function and associated
855 assembler pseudo-ops have already been output in `assemble_start_function'.
857 FIRST is the first insn of the rtl for the function being compiled.
858 FILE is the file to write assembler code to.
859 OPTIMIZE is nonzero if we should eliminate redundant
860 test and compare insns. */
863 final_start_function (first
, file
, optimize
)
870 this_is_asm_operands
= 0;
872 #ifdef NON_SAVING_SETJMP
873 /* A function that calls setjmp should save and restore all the
874 call-saved registers on a system where longjmp clobbers them. */
875 if (NON_SAVING_SETJMP
&& current_function_calls_setjmp
)
879 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
880 if (!call_used_regs
[i
] && !call_fixed_regs
[i
])
881 regs_ever_live
[i
] = 1;
885 /* Initial line number is supposed to be output
886 before the function's prologue and label
887 so that the function's address will not appear to be
888 in the last statement of the preceding function. */
889 if (NOTE_LINE_NUMBER (first
) != NOTE_INSN_DELETED
)
891 last_linenum
= high_block_linenum
= high_function_linenum
892 = NOTE_LINE_NUMBER (first
);
894 if (write_symbols
== SDB_DEBUG
)
895 /* For sdb, let's not, but say we did.
896 We need to set last_linenum for sdbout_function_begin,
897 but we can't have an actual line number before the .bf symbol.
898 (sdb_begin_function_line is not set,
899 and other compilers don't do it.) */
901 #ifdef XCOFF_DEBUGGING_INFO
902 else if (write_symbols
== XCOFF_DEBUG
)
903 xcoffout_output_first_source_line (file
, last_linenum
);
906 output_source_line (file
, first
);
909 #ifdef LEAF_REG_REMAP
911 leaf_renumber_regs (first
);
914 /* The Sun386i and perhaps other machines don't work right
915 if the profiling code comes after the prologue. */
916 #ifdef PROFILE_BEFORE_PROLOGUE
918 profile_function (file
);
919 #endif /* PROFILE_BEFORE_PROLOGUE */
921 #ifdef FUNCTION_PROLOGUE
922 /* First output the function prologue: code to set up the stack frame. */
923 FUNCTION_PROLOGUE (file
, get_frame_size ());
926 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
927 if (write_symbols
== SDB_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
928 next_block_index
= 1;
931 /* If the machine represents the prologue as RTL, the profiling code must
932 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
936 profile_after_prologue (file
);
940 /* If we are doing basic block profiling, remember a printable version
941 of the function name. */
942 if (profile_block_flag
)
944 char *junk
= "function";
946 add_bb_string ((*decl_printable_name
) (current_function_decl
, &junk
), FALSE
);
951 profile_after_prologue (file
)
954 #ifdef FUNCTION_BLOCK_PROFILER
955 if (profile_block_flag
)
957 FUNCTION_BLOCK_PROFILER (file
, profile_label_no
);
959 #endif /* FUNCTION_BLOCK_PROFILER */
961 #ifndef PROFILE_BEFORE_PROLOGUE
963 profile_function (file
);
964 #endif /* not PROFILE_BEFORE_PROLOGUE */
968 profile_function (file
)
971 int align
= MIN (BIGGEST_ALIGNMENT
, POINTER_SIZE
);
972 int sval
= current_function_returns_struct
;
973 int cxt
= current_function_needs_context
;
976 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
977 ASM_OUTPUT_INTERNAL_LABEL (file
, "LP", profile_label_no
);
978 assemble_integer (const0_rtx
, POINTER_SIZE
/ BITS_PER_UNIT
, 1);
982 #ifdef STRUCT_VALUE_INCOMING_REGNUM
984 ASM_OUTPUT_REG_PUSH (file
, STRUCT_VALUE_INCOMING_REGNUM
);
986 #ifdef STRUCT_VALUE_REGNUM
988 ASM_OUTPUT_REG_PUSH (file
, STRUCT_VALUE_REGNUM
);
993 #ifdef STATIC_CHAIN_INCOMING_REGNUM
995 ASM_OUTPUT_REG_PUSH (file
, STATIC_CHAIN_INCOMING_REGNUM
);
997 #ifdef STATIC_CHAIN_REGNUM
999 ASM_OUTPUT_REG_PUSH (file
, STATIC_CHAIN_REGNUM
);
1004 FUNCTION_PROFILER (file
, profile_label_no
);
1007 #ifdef STATIC_CHAIN_INCOMING_REGNUM
1009 ASM_OUTPUT_REG_POP (file
, STATIC_CHAIN_INCOMING_REGNUM
);
1011 #ifdef STATIC_CHAIN_REGNUM
1013 ASM_OUTPUT_REG_POP (file
, STATIC_CHAIN_REGNUM
);
1018 #ifdef STRUCT_VALUE_INCOMING_REGNUM
1020 ASM_OUTPUT_REG_POP (file
, STRUCT_VALUE_INCOMING_REGNUM
);
1022 #ifdef STRUCT_VALUE_REGNUM
1024 ASM_OUTPUT_REG_POP (file
, STRUCT_VALUE_REGNUM
);
1029 /* Output assembler code for the end of a function.
1030 For clarity, args are same as those of `final_start_function'
1031 even though not all of them are needed. */
1034 final_end_function (first
, file
, optimize
)
1041 fprintf (file
, ASM_APP_OFF
);
1045 #ifdef SDB_DEBUGGING_INFO
1046 if (write_symbols
== SDB_DEBUG
)
1047 sdbout_end_function (high_function_linenum
);
1050 #ifdef DWARF_DEBUGGING_INFO
1051 if (write_symbols
== DWARF_DEBUG
)
1052 dwarfout_end_function ();
1055 #ifdef XCOFF_DEBUGGING_INFO
1056 if (write_symbols
== XCOFF_DEBUG
)
1057 xcoffout_end_function (file
, high_function_linenum
);
1060 #ifdef FUNCTION_EPILOGUE
1061 /* Finally, output the function epilogue:
1062 code to restore the stack frame and return to the caller. */
1063 FUNCTION_EPILOGUE (file
, get_frame_size ());
1066 #ifdef SDB_DEBUGGING_INFO
1067 if (write_symbols
== SDB_DEBUG
)
1068 sdbout_end_epilogue ();
1071 #ifdef DWARF_DEBUGGING_INFO
1072 if (write_symbols
== DWARF_DEBUG
)
1073 dwarfout_end_epilogue ();
1076 #ifdef XCOFF_DEBUGGING_INFO
1077 if (write_symbols
== XCOFF_DEBUG
)
1078 xcoffout_end_epilogue (file
);
1081 bb_func_label_num
= -1; /* not in function, nuke label # */
1083 /* If FUNCTION_EPILOGUE is not defined, then the function body
1084 itself contains return instructions wherever needed. */
1087 /* Add a block to the linked list that remembers the current line/file/function
1088 for basic block profiling. Emit the label in front of the basic block and
1089 the instructions that increment the count field. */
1095 struct bb_list
*ptr
= (struct bb_list
*) permalloc (sizeof (struct bb_list
));
1097 /* Add basic block to linked list. */
1099 ptr
->line_num
= last_linenum
;
1100 ptr
->file_label_num
= bb_file_label_num
;
1101 ptr
->func_label_num
= bb_func_label_num
;
1103 bb_tail
= &ptr
->next
;
1105 /* Enable the table of basic-block use counts
1106 to point at the code it applies to. */
1107 ASM_OUTPUT_INTERNAL_LABEL (file
, "LPB", count_basic_blocks
);
1109 /* Before first insn of this basic block, increment the
1110 count of times it was entered. */
1111 #ifdef BLOCK_PROFILER
1112 BLOCK_PROFILER (file
, count_basic_blocks
);
1117 count_basic_blocks
++;
1120 /* Add a string to be used for basic block profiling. */
1123 add_bb_string (string
, perm_p
)
1128 struct bb_str
*ptr
= 0;
1132 string
= "<unknown>";
1136 /* Allocate a new string if the current string isn't permanent. If
1137 the string is permanent search for the same string in other
1140 len
= strlen (string
) + 1;
1143 char *p
= (char *) permalloc (len
);
1144 bcopy (string
, p
, len
);
1148 for (ptr
= sbb_head
; ptr
!= (struct bb_str
*)0; ptr
= ptr
->next
)
1149 if (ptr
->string
== string
)
1152 /* Allocate a new string block if we need to. */
1155 ptr
= (struct bb_str
*) permalloc (sizeof (*ptr
));
1158 ptr
->label_num
= sbb_label_num
++;
1159 ptr
->string
= string
;
1161 sbb_tail
= &ptr
->next
;
1164 return ptr
->label_num
;
1168 /* Output assembler code for some insns: all or part of a function.
1169 For description of args, see `final_start_function', above.
1171 PRESCAN is 1 if we are not really outputting,
1172 just scanning as if we were outputting.
1173 Prescanning deletes and rearranges insns just like ordinary output.
1174 PRESCAN is -2 if we are outputting after having prescanned.
1175 In this case, don't try to delete or rearrange insns
1176 because that has already been done.
1177 Prescanning is done only on certain machines. */
1180 final (first
, file
, optimize
, prescan
)
1189 last_ignored_compare
= 0;
1192 /* Make a map indicating which line numbers appear in this function.
1193 When producing SDB debugging info, delete troublesome line number
1194 notes from inlined functions in other files as well as duplicate
1195 line number notes. */
1196 #ifdef SDB_DEBUGGING_INFO
1197 if (write_symbols
== SDB_DEBUG
)
1200 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1201 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
1203 if ((RTX_INTEGRATED_P (insn
)
1204 && strcmp (NOTE_SOURCE_FILE (insn
), main_input_filename
) != 0)
1206 && NOTE_LINE_NUMBER (insn
) == NOTE_LINE_NUMBER (last
)
1207 && NOTE_SOURCE_FILE (insn
) == NOTE_SOURCE_FILE (last
)))
1209 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
1210 NOTE_SOURCE_FILE (insn
) = 0;
1214 if (NOTE_LINE_NUMBER (insn
) > max_line
)
1215 max_line
= NOTE_LINE_NUMBER (insn
);
1221 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1222 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > max_line
)
1223 max_line
= NOTE_LINE_NUMBER (insn
);
1226 line_note_exists
= (char *) oballoc (max_line
+ 1);
1227 bzero (line_note_exists
, max_line
+ 1);
1229 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1230 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
1231 line_note_exists
[NOTE_LINE_NUMBER (insn
)] = 1;
1237 /* Output the insns. */
1238 for (insn
= NEXT_INSN (first
); insn
;)
1239 insn
= final_scan_insn (insn
, file
, optimize
, prescan
, 0);
1241 /* Do basic-block profiling here
1242 if the last insn was a conditional branch. */
1243 if (profile_block_flag
&& new_block
)
1247 /* The final scan for one insn, INSN.
1248 Args are same as in `final', except that INSN
1249 is the insn being scanned.
1250 Value returned is the next insn to be scanned.
1252 NOPEEPHOLES is the flag to disallow peephole processing (currently
1253 used for within delayed branch sequence output). */
1256 final_scan_insn (insn
, file
, optimize
, prescan
, nopeepholes
)
1266 /* Ignore deleted insns. These can occur when we split insns (due to a
1267 template of "#") while not optimizing. */
1268 if (INSN_DELETED_P (insn
))
1269 return NEXT_INSN (insn
);
1271 switch (GET_CODE (insn
))
1277 /* Align the beginning of a loop, for higher speed
1278 on certain machines. */
1280 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_LOOP_BEG
&& optimize
> 0)
1282 #ifdef ASM_OUTPUT_LOOP_ALIGN
1283 rtx next
= next_nonnote_insn (insn
);
1284 if (next
&& GET_CODE (next
) == CODE_LABEL
)
1286 ASM_OUTPUT_LOOP_ALIGN (asm_out_file
);
1291 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_LOOP_END
)
1294 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_PROLOGUE_END
)
1296 #ifdef FUNCTION_END_PROLOGUE
1297 FUNCTION_END_PROLOGUE (file
);
1299 profile_after_prologue (file
);
1303 #ifdef FUNCTION_BEGIN_EPILOGUE
1304 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EPILOGUE_BEG
)
1306 FUNCTION_BEGIN_EPILOGUE (file
);
1311 if (write_symbols
== NO_DEBUG
)
1313 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_FUNCTION_BEG
)
1315 #ifdef SDB_DEBUGGING_INFO
1316 if (write_symbols
== SDB_DEBUG
)
1317 sdbout_begin_function (last_linenum
);
1319 #ifdef XCOFF_DEBUGGING_INFO
1320 if (write_symbols
== XCOFF_DEBUG
)
1321 xcoffout_begin_function (file
, last_linenum
);
1323 #ifdef DWARF_DEBUGGING_INFO
1324 if (write_symbols
== DWARF_DEBUG
)
1325 dwarfout_begin_function ();
1329 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_DELETED
)
1330 break; /* An insn that was "deleted" */
1333 fprintf (file
, ASM_APP_OFF
);
1336 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_BEG
1337 && (debug_info_level
== DINFO_LEVEL_NORMAL
1338 || debug_info_level
== DINFO_LEVEL_VERBOSE
1339 #ifdef DWARF_DEBUGGING_INFO
1340 || write_symbols
== DWARF_DEBUG
1345 /* Beginning of a symbol-block. Assign it a sequence number
1346 and push the number onto the stack PENDING_BLOCKS. */
1348 if (block_depth
== max_block_depth
)
1350 /* PENDING_BLOCKS is full; make it longer. */
1351 max_block_depth
*= 2;
1353 = (int *) xrealloc (pending_blocks
,
1354 max_block_depth
* sizeof (int));
1356 pending_blocks
[block_depth
++] = next_block_index
;
1358 high_block_linenum
= last_linenum
;
1360 /* Output debugging info about the symbol-block beginning. */
1362 #ifdef SDB_DEBUGGING_INFO
1363 if (write_symbols
== SDB_DEBUG
)
1364 sdbout_begin_block (file
, last_linenum
, next_block_index
);
1366 #ifdef XCOFF_DEBUGGING_INFO
1367 if (write_symbols
== XCOFF_DEBUG
)
1368 xcoffout_begin_block (file
, last_linenum
, next_block_index
);
1370 #ifdef DBX_DEBUGGING_INFO
1371 if (write_symbols
== DBX_DEBUG
)
1372 ASM_OUTPUT_INTERNAL_LABEL (file
, "LBB", next_block_index
);
1374 #ifdef DWARF_DEBUGGING_INFO
1375 if (write_symbols
== DWARF_DEBUG
&& block_depth
> 1)
1376 dwarfout_begin_block (next_block_index
);
1381 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_END
1382 && (debug_info_level
== DINFO_LEVEL_NORMAL
1383 || debug_info_level
== DINFO_LEVEL_VERBOSE
1384 #ifdef DWARF_DEBUGGING_INFO
1385 || write_symbols
== DWARF_DEBUG
1390 /* End of a symbol-block. Pop its sequence number off
1391 PENDING_BLOCKS and output debugging info based on that. */
1395 #ifdef XCOFF_DEBUGGING_INFO
1396 if (write_symbols
== XCOFF_DEBUG
&& block_depth
>= 0)
1397 xcoffout_end_block (file
, high_block_linenum
,
1398 pending_blocks
[block_depth
]);
1400 #ifdef DBX_DEBUGGING_INFO
1401 if (write_symbols
== DBX_DEBUG
&& block_depth
>= 0)
1402 ASM_OUTPUT_INTERNAL_LABEL (file
, "LBE",
1403 pending_blocks
[block_depth
]);
1405 #ifdef SDB_DEBUGGING_INFO
1406 if (write_symbols
== SDB_DEBUG
&& block_depth
>= 0)
1407 sdbout_end_block (file
, high_block_linenum
,
1408 pending_blocks
[block_depth
]);
1410 #ifdef DWARF_DEBUGGING_INFO
1411 if (write_symbols
== DWARF_DEBUG
&& block_depth
>= 1)
1412 dwarfout_end_block (pending_blocks
[block_depth
]);
1415 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_DELETED_LABEL
1416 && (debug_info_level
== DINFO_LEVEL_NORMAL
1417 || debug_info_level
== DINFO_LEVEL_VERBOSE
))
1419 #ifdef DWARF_DEBUGGING_INFO
1420 if (write_symbols
== DWARF_DEBUG
)
1421 dwarfout_label (insn
);
1424 else if (NOTE_LINE_NUMBER (insn
) > 0)
1425 /* This note is a line-number. */
1429 #if 0 /* This is what we used to do. */
1430 output_source_line (file
, insn
);
1434 /* If there is anything real after this note,
1435 output it. If another line note follows, omit this one. */
1436 for (note
= NEXT_INSN (insn
); note
; note
= NEXT_INSN (note
))
1438 if (GET_CODE (note
) != NOTE
&& GET_CODE (note
) != CODE_LABEL
)
1440 /* These types of notes can be significant
1441 so make sure the preceding line number stays. */
1442 else if (GET_CODE (note
) == NOTE
1443 && (NOTE_LINE_NUMBER (note
) == NOTE_INSN_BLOCK_BEG
1444 || NOTE_LINE_NUMBER (note
) == NOTE_INSN_BLOCK_END
1445 || NOTE_LINE_NUMBER (note
) == NOTE_INSN_FUNCTION_BEG
))
1447 else if (GET_CODE (note
) == NOTE
&& NOTE_LINE_NUMBER (note
) > 0)
1449 /* Another line note follows; we can delete this note
1450 if no intervening line numbers have notes elsewhere. */
1452 for (num
= NOTE_LINE_NUMBER (insn
) + 1;
1453 num
< NOTE_LINE_NUMBER (note
);
1455 if (line_note_exists
[num
])
1458 if (num
>= NOTE_LINE_NUMBER (note
))
1464 /* Output this line note
1465 if it is the first or the last line note in a row. */
1467 output_source_line (file
, insn
);
1472 #ifdef ASM_OUTPUT_ALIGN_CODE
1473 /* Don't litter the assembler output with needless alignments. A
1474 BARRIER will be placed at the end of every function if HAVE_epilogue
1476 if (NEXT_INSN (insn
))
1477 ASM_OUTPUT_ALIGN_CODE (file
);
1486 #ifdef SDB_DEBUGGING_INFO
1487 if (write_symbols
== SDB_DEBUG
&& LABEL_NAME (insn
))
1488 sdbout_label (insn
);
1490 #ifdef DWARF_DEBUGGING_INFO
1491 if (write_symbols
== DWARF_DEBUG
&& LABEL_NAME (insn
))
1492 dwarfout_label (insn
);
1496 fprintf (file
, ASM_APP_OFF
);
1499 if (NEXT_INSN (insn
) != 0
1500 && GET_CODE (NEXT_INSN (insn
)) == JUMP_INSN
)
1502 rtx nextbody
= PATTERN (NEXT_INSN (insn
));
1504 /* If this label is followed by a jump-table,
1505 make sure we put the label in the read-only section. Also
1506 possibly write the label and jump table together. */
1508 if (GET_CODE (nextbody
) == ADDR_VEC
1509 || GET_CODE (nextbody
) == ADDR_DIFF_VEC
)
1511 #ifndef JUMP_TABLES_IN_TEXT_SECTION
1512 readonly_data_section ();
1513 #ifdef READONLY_DATA_SECTION
1514 ASM_OUTPUT_ALIGN (file
,
1515 exact_log2 (BIGGEST_ALIGNMENT
1517 #endif /* READONLY_DATA_SECTION */
1518 #else /* JUMP_TABLES_IN_TEXT_SECTION */
1519 function_section (current_function_decl
);
1520 #endif /* JUMP_TABLES_IN_TEXT_SECTION */
1521 #ifdef ASM_OUTPUT_CASE_LABEL
1522 ASM_OUTPUT_CASE_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
),
1525 ASM_OUTPUT_INTERNAL_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
1531 ASM_OUTPUT_INTERNAL_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
1536 register rtx body
= PATTERN (insn
);
1537 int insn_code_number
;
1541 /* An INSN, JUMP_INSN or CALL_INSN.
1542 First check for special kinds that recog doesn't recognize. */
1544 if (GET_CODE (body
) == USE
/* These are just declarations */
1545 || GET_CODE (body
) == CLOBBER
)
1549 /* If there is a REG_CC_SETTER note on this insn, it means that
1550 the setting of the condition code was done in the delay slot
1551 of the insn that branched here. So recover the cc status
1552 from the insn that set it. */
1554 note
= find_reg_note (insn
, REG_CC_SETTER
, NULL_RTX
);
1557 NOTICE_UPDATE_CC (PATTERN (XEXP (note
, 0)), XEXP (note
, 0));
1558 cc_prev_status
= cc_status
;
1562 /* Detect insns that are really jump-tables
1563 and output them as such. */
1565 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
1567 register int vlen
, idx
;
1574 fprintf (file
, ASM_APP_OFF
);
1578 vlen
= XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
);
1579 for (idx
= 0; idx
< vlen
; idx
++)
1581 if (GET_CODE (body
) == ADDR_VEC
)
1583 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
1584 ASM_OUTPUT_ADDR_VEC_ELT
1585 (file
, CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 0, idx
), 0)));
1592 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
1593 ASM_OUTPUT_ADDR_DIFF_ELT
1595 CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 1, idx
), 0)),
1596 CODE_LABEL_NUMBER (XEXP (XEXP (body
, 0), 0)));
1602 #ifdef ASM_OUTPUT_CASE_END
1603 ASM_OUTPUT_CASE_END (file
,
1604 CODE_LABEL_NUMBER (PREV_INSN (insn
)),
1608 function_section (current_function_decl
);
1613 /* Do basic-block profiling when we reach a new block.
1614 Done here to avoid jump tables. */
1615 if (profile_block_flag
&& new_block
)
1618 if (GET_CODE (body
) == ASM_INPUT
)
1620 /* There's no telling what that did to the condition codes. */
1626 fprintf (file
, ASM_APP_ON
);
1629 fprintf (asm_out_file
, "\t%s\n", XSTR (body
, 0));
1633 /* Detect `asm' construct with operands. */
1634 if (asm_noperands (body
) >= 0)
1636 int noperands
= asm_noperands (body
);
1637 rtx
*ops
= (rtx
*) alloca (noperands
* sizeof (rtx
));
1640 /* There's no telling what that did to the condition codes. */
1647 fprintf (file
, ASM_APP_ON
);
1651 /* Get out the operand values. */
1652 string
= decode_asm_operands (body
, ops
, NULL_PTR
,
1653 NULL_PTR
, NULL_PTR
);
1654 /* Inhibit aborts on what would otherwise be compiler bugs. */
1655 insn_noperands
= noperands
;
1656 this_is_asm_operands
= insn
;
1658 /* Output the insn using them. */
1659 output_asm_insn (string
, ops
);
1660 this_is_asm_operands
= 0;
1664 if (prescan
<= 0 && app_on
)
1666 fprintf (file
, ASM_APP_OFF
);
1670 if (GET_CODE (body
) == SEQUENCE
)
1672 /* A delayed-branch sequence */
1678 final_sequence
= body
;
1680 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
1681 force the restoration of a comparison that was previously
1682 thought unnecessary. If that happens, cancel this sequence
1683 and cause that insn to be restored. */
1685 next
= final_scan_insn (XVECEXP (body
, 0, 0), file
, 0, prescan
, 1);
1686 if (next
!= XVECEXP (body
, 0, 1))
1692 for (i
= 1; i
< XVECLEN (body
, 0); i
++)
1693 final_scan_insn (XVECEXP (body
, 0, i
), file
, 0, prescan
, 1);
1694 #ifdef DBR_OUTPUT_SEQEND
1695 DBR_OUTPUT_SEQEND (file
);
1699 /* If the insn requiring the delay slot was a CALL_INSN, the
1700 insns in the delay slot are actually executed before the
1701 called function. Hence we don't preserve any CC-setting
1702 actions in these insns and the CC must be marked as being
1703 clobbered by the function. */
1704 if (GET_CODE (XVECEXP (body
, 0, 0)) == CALL_INSN
)
1707 /* Following a conditional branch sequence, we have a new basic
1709 if (profile_block_flag
)
1711 rtx insn
= XVECEXP (body
, 0, 0);
1712 rtx body
= PATTERN (insn
);
1714 if ((GET_CODE (insn
) == JUMP_INSN
&& GET_CODE (body
) == SET
1715 && GET_CODE (SET_SRC (body
)) != LABEL_REF
)
1716 || (GET_CODE (insn
) == JUMP_INSN
1717 && GET_CODE (body
) == PARALLEL
1718 && GET_CODE (XVECEXP (body
, 0, 0)) == SET
1719 && GET_CODE (SET_SRC (XVECEXP (body
, 0, 0))) != LABEL_REF
))
1725 /* We have a real machine instruction as rtl. */
1727 body
= PATTERN (insn
);
1730 /* Check for redundant test and compare instructions
1731 (when the condition codes are already set up as desired).
1732 This is done only when optimizing; if not optimizing,
1733 it should be possible for the user to alter a variable
1734 with the debugger in between statements
1735 and the next statement should reexamine the variable
1736 to compute the condition codes. */
1739 && GET_CODE (body
) == SET
1740 && GET_CODE (SET_DEST (body
)) == CC0
1741 && insn
!= last_ignored_compare
)
1743 if (GET_CODE (SET_SRC (body
)) == SUBREG
)
1744 SET_SRC (body
) = alter_subreg (SET_SRC (body
));
1745 else if (GET_CODE (SET_SRC (body
)) == COMPARE
)
1747 if (GET_CODE (XEXP (SET_SRC (body
), 0)) == SUBREG
)
1748 XEXP (SET_SRC (body
), 0)
1749 = alter_subreg (XEXP (SET_SRC (body
), 0));
1750 if (GET_CODE (XEXP (SET_SRC (body
), 1)) == SUBREG
)
1751 XEXP (SET_SRC (body
), 1)
1752 = alter_subreg (XEXP (SET_SRC (body
), 1));
1754 if ((cc_status
.value1
!= 0
1755 && rtx_equal_p (SET_SRC (body
), cc_status
.value1
))
1756 || (cc_status
.value2
!= 0
1757 && rtx_equal_p (SET_SRC (body
), cc_status
.value2
)))
1759 /* Don't delete insn if it has an addressing side-effect. */
1760 if (! FIND_REG_INC_NOTE (insn
, 0)
1761 /* or if anything in it is volatile. */
1762 && ! volatile_refs_p (PATTERN (insn
)))
1764 /* We don't really delete the insn; just ignore it. */
1765 last_ignored_compare
= insn
;
1772 /* Following a conditional branch, we have a new basic block.
1773 But if we are inside a sequence, the new block starts after the
1774 last insn of the sequence. */
1775 if (profile_block_flag
&& final_sequence
== 0
1776 && ((GET_CODE (insn
) == JUMP_INSN
&& GET_CODE (body
) == SET
1777 && GET_CODE (SET_SRC (body
)) != LABEL_REF
)
1778 || (GET_CODE (insn
) == JUMP_INSN
&& GET_CODE (body
) == PARALLEL
1779 && GET_CODE (XVECEXP (body
, 0, 0)) == SET
1780 && GET_CODE (SET_SRC (XVECEXP (body
, 0, 0))) != LABEL_REF
)))
1784 /* Don't bother outputting obvious no-ops, even without -O.
1785 This optimization is fast and doesn't interfere with debugging.
1786 Don't do this if the insn is in a delay slot, since this
1787 will cause an improper number of delay insns to be written. */
1788 if (final_sequence
== 0
1790 && GET_CODE (insn
) == INSN
&& GET_CODE (body
) == SET
1791 && GET_CODE (SET_SRC (body
)) == REG
1792 && GET_CODE (SET_DEST (body
)) == REG
1793 && REGNO (SET_SRC (body
)) == REGNO (SET_DEST (body
)))
1798 /* If this is a conditional branch, maybe modify it
1799 if the cc's are in a nonstandard state
1800 so that it accomplishes the same thing that it would
1801 do straightforwardly if the cc's were set up normally. */
1803 if (cc_status
.flags
!= 0
1804 && GET_CODE (insn
) == JUMP_INSN
1805 && GET_CODE (body
) == SET
1806 && SET_DEST (body
) == pc_rtx
1807 && GET_CODE (SET_SRC (body
)) == IF_THEN_ELSE
1808 /* This is done during prescan; it is not done again
1809 in final scan when prescan has been done. */
1812 /* This function may alter the contents of its argument
1813 and clear some of the cc_status.flags bits.
1814 It may also return 1 meaning condition now always true
1815 or -1 meaning condition now always false
1816 or 2 meaning condition nontrivial but altered. */
1817 register int result
= alter_cond (XEXP (SET_SRC (body
), 0));
1818 /* If condition now has fixed value, replace the IF_THEN_ELSE
1819 with its then-operand or its else-operand. */
1821 SET_SRC (body
) = XEXP (SET_SRC (body
), 1);
1823 SET_SRC (body
) = XEXP (SET_SRC (body
), 2);
1825 /* The jump is now either unconditional or a no-op.
1826 If it has become a no-op, don't try to output it.
1827 (It would not be recognized.) */
1828 if (SET_SRC (body
) == pc_rtx
)
1830 PUT_CODE (insn
, NOTE
);
1831 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
1832 NOTE_SOURCE_FILE (insn
) = 0;
1835 else if (GET_CODE (SET_SRC (body
)) == RETURN
)
1836 /* Replace (set (pc) (return)) with (return). */
1837 PATTERN (insn
) = body
= SET_SRC (body
);
1839 /* Rerecognize the instruction if it has changed. */
1841 INSN_CODE (insn
) = -1;
1844 /* Make same adjustments to instructions that examine the
1845 condition codes without jumping (if this machine has them). */
1847 if (cc_status
.flags
!= 0
1848 && GET_CODE (body
) == SET
)
1850 switch (GET_CODE (SET_SRC (body
)))
1863 register int result
;
1864 if (XEXP (SET_SRC (body
), 0) != cc0_rtx
)
1866 result
= alter_cond (SET_SRC (body
));
1868 validate_change (insn
, &SET_SRC (body
), const_true_rtx
, 0);
1869 else if (result
== -1)
1870 validate_change (insn
, &SET_SRC (body
), const0_rtx
, 0);
1871 else if (result
== 2)
1872 INSN_CODE (insn
) = -1;
1878 /* Do machine-specific peephole optimizations if desired. */
1880 if (optimize
&& !flag_no_peephole
&& !nopeepholes
)
1882 rtx next
= peephole (insn
);
1883 /* When peepholing, if there were notes within the peephole,
1884 emit them before the peephole. */
1885 if (next
!= 0 && next
!= NEXT_INSN (insn
))
1887 rtx prev
= PREV_INSN (insn
);
1890 for (note
= NEXT_INSN (insn
); note
!= next
;
1891 note
= NEXT_INSN (note
))
1892 final_scan_insn (note
, file
, optimize
, prescan
, nopeepholes
);
1894 /* In case this is prescan, put the notes
1895 in proper position for later rescan. */
1896 note
= NEXT_INSN (insn
);
1897 PREV_INSN (note
) = prev
;
1898 NEXT_INSN (prev
) = note
;
1899 NEXT_INSN (PREV_INSN (next
)) = insn
;
1900 PREV_INSN (insn
) = PREV_INSN (next
);
1901 NEXT_INSN (insn
) = next
;
1902 PREV_INSN (next
) = insn
;
1905 /* PEEPHOLE might have changed this. */
1906 body
= PATTERN (insn
);
1909 /* Try to recognize the instruction.
1910 If successful, verify that the operands satisfy the
1911 constraints for the instruction. Crash if they don't,
1912 since `reload' should have changed them so that they do. */
1914 insn_code_number
= recog_memoized (insn
);
1915 insn_extract (insn
);
1916 for (i
= 0; i
< insn_n_operands
[insn_code_number
]; i
++)
1918 if (GET_CODE (recog_operand
[i
]) == SUBREG
)
1919 recog_operand
[i
] = alter_subreg (recog_operand
[i
]);
1920 else if (GET_CODE (recog_operand
[i
]) == PLUS
1921 || GET_CODE (recog_operand
[i
]) == MULT
)
1922 recog_operand
[i
] = walk_alter_subreg (recog_operand
[i
]);
1925 for (i
= 0; i
< insn_n_dups
[insn_code_number
]; i
++)
1927 if (GET_CODE (*recog_dup_loc
[i
]) == SUBREG
)
1928 *recog_dup_loc
[i
] = alter_subreg (*recog_dup_loc
[i
]);
1929 else if (GET_CODE (*recog_dup_loc
[i
]) == PLUS
1930 || GET_CODE (*recog_dup_loc
[i
]) == MULT
)
1931 *recog_dup_loc
[i
] = walk_alter_subreg (*recog_dup_loc
[i
]);
1934 #ifdef REGISTER_CONSTRAINTS
1935 if (! constrain_operands (insn_code_number
, 1))
1936 fatal_insn_not_found (insn
);
1939 /* Some target machines need to prescan each insn before
1942 #ifdef FINAL_PRESCAN_INSN
1943 FINAL_PRESCAN_INSN (insn
, recog_operand
,
1944 insn_n_operands
[insn_code_number
]);
1948 cc_prev_status
= cc_status
;
1950 /* Update `cc_status' for this instruction.
1951 The instruction's output routine may change it further.
1952 If the output routine for a jump insn needs to depend
1953 on the cc status, it should look at cc_prev_status. */
1955 NOTICE_UPDATE_CC (body
, insn
);
1960 /* If the proper template needs to be chosen by some C code,
1961 run that code and get the real template. */
1963 template = insn_template
[insn_code_number
];
1966 template = (*insn_outfun
[insn_code_number
]) (recog_operand
, insn
);
1968 /* If the C code returns 0, it means that it is a jump insn
1969 which follows a deleted test insn, and that test insn
1970 needs to be reinserted. */
1973 if (prev_nonnote_insn (insn
) != last_ignored_compare
)
1976 return prev_nonnote_insn (insn
);
1980 /* If the template is the string "#", it means that this insn must
1982 if (template[0] == '#' && template[1] == '\0')
1984 rtx
new = try_split (body
, insn
, 0);
1986 /* If we didn't split the insn, go away. */
1987 if (new == insn
&& PATTERN (new) == body
)
1997 /* Output assembler code from the template. */
1999 output_asm_insn (template, recog_operand
);
2002 /* It's not at all clear why we did this and doing so interferes
2003 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2006 /* Mark this insn as having been output. */
2007 INSN_DELETED_P (insn
) = 1;
2013 return NEXT_INSN (insn
);
2016 /* Output debugging info to the assembler file FILE
2017 based on the NOTE-insn INSN, assumed to be a line number. */
2020 output_source_line (file
, insn
)
2024 register char *filename
= NOTE_SOURCE_FILE (insn
);
2026 /* Remember filename for basic block profiling.
2027 Filenames are allocated on the permanent obstack
2028 or are passed in ARGV, so we don't have to save
2031 if (profile_block_flag
&& last_filename
!= filename
)
2032 bb_file_label_num
= add_bb_string (filename
, TRUE
);
2034 last_filename
= filename
;
2035 last_linenum
= NOTE_LINE_NUMBER (insn
);
2036 high_block_linenum
= MAX (last_linenum
, high_block_linenum
);
2037 high_function_linenum
= MAX (last_linenum
, high_function_linenum
);
2039 if (write_symbols
!= NO_DEBUG
)
2041 #ifdef SDB_DEBUGGING_INFO
2042 if (write_symbols
== SDB_DEBUG
2043 #if 0 /* People like having line numbers even in wrong file! */
2044 /* COFF can't handle multiple source files--lose, lose. */
2045 && !strcmp (filename
, main_input_filename
)
2047 /* COFF relative line numbers must be positive. */
2048 && last_linenum
> sdb_begin_function_line
)
2050 #ifdef ASM_OUTPUT_SOURCE_LINE
2051 ASM_OUTPUT_SOURCE_LINE (file
, last_linenum
);
2053 fprintf (file
, "\t.ln\t%d\n",
2054 ((sdb_begin_function_line
> -1)
2055 ? last_linenum
- sdb_begin_function_line
: 1));
2060 #if defined (DBX_DEBUGGING_INFO)
2061 if (write_symbols
== DBX_DEBUG
)
2062 dbxout_source_line (file
, filename
, NOTE_LINE_NUMBER (insn
));
2065 #if defined (XCOFF_DEBUGGING_INFO)
2066 if (write_symbols
== XCOFF_DEBUG
)
2067 xcoffout_source_line (file
, filename
, insn
);
2070 #ifdef DWARF_DEBUGGING_INFO
2071 if (write_symbols
== DWARF_DEBUG
)
2072 dwarfout_line (filename
, NOTE_LINE_NUMBER (insn
));
2077 /* If X is a SUBREG, replace it with a REG or a MEM,
2078 based on the thing it is a subreg of. */
2084 register rtx y
= SUBREG_REG (x
);
2085 if (GET_CODE (y
) == SUBREG
)
2086 y
= alter_subreg (y
);
2088 if (GET_CODE (y
) == REG
)
2090 /* If the containing reg really gets a hard reg, so do we. */
2092 REGNO (x
) = REGNO (y
) + SUBREG_WORD (x
);
2094 else if (GET_CODE (y
) == MEM
)
2096 register int offset
= SUBREG_WORD (x
) * UNITS_PER_WORD
;
2097 if (BYTES_BIG_ENDIAN
)
2098 offset
-= (MIN (UNITS_PER_WORD
, GET_MODE_SIZE (GET_MODE (x
)))
2099 - MIN (UNITS_PER_WORD
, GET_MODE_SIZE (GET_MODE (y
))));
2101 MEM_VOLATILE_P (x
) = MEM_VOLATILE_P (y
);
2102 XEXP (x
, 0) = plus_constant (XEXP (y
, 0), offset
);
2108 /* Do alter_subreg on all the SUBREGs contained in X. */
2111 walk_alter_subreg (x
)
2114 switch (GET_CODE (x
))
2118 XEXP (x
, 0) = walk_alter_subreg (XEXP (x
, 0));
2119 XEXP (x
, 1) = walk_alter_subreg (XEXP (x
, 1));
2123 XEXP (x
, 0) = walk_alter_subreg (XEXP (x
, 0));
2127 return alter_subreg (x
);
2135 /* Given BODY, the body of a jump instruction, alter the jump condition
2136 as required by the bits that are set in cc_status.flags.
2137 Not all of the bits there can be handled at this level in all cases.
2139 The value is normally 0.
2140 1 means that the condition has become always true.
2141 -1 means that the condition has become always false.
2142 2 means that COND has been altered. */
2150 if (cc_status
.flags
& CC_REVERSED
)
2153 PUT_CODE (cond
, swap_condition (GET_CODE (cond
)));
2156 if (cc_status
.flags
& CC_INVERTED
)
2159 PUT_CODE (cond
, reverse_condition (GET_CODE (cond
)));
2162 if (cc_status
.flags
& CC_NOT_POSITIVE
)
2163 switch (GET_CODE (cond
))
2168 /* Jump becomes unconditional. */
2174 /* Jump becomes no-op. */
2178 PUT_CODE (cond
, EQ
);
2183 PUT_CODE (cond
, NE
);
2188 if (cc_status
.flags
& CC_NOT_NEGATIVE
)
2189 switch (GET_CODE (cond
))
2193 /* Jump becomes unconditional. */
2198 /* Jump becomes no-op. */
2203 PUT_CODE (cond
, EQ
);
2209 PUT_CODE (cond
, NE
);
2214 if (cc_status
.flags
& CC_NO_OVERFLOW
)
2215 switch (GET_CODE (cond
))
2218 /* Jump becomes unconditional. */
2222 PUT_CODE (cond
, EQ
);
2227 PUT_CODE (cond
, NE
);
2232 /* Jump becomes no-op. */
2236 if (cc_status
.flags
& (CC_Z_IN_NOT_N
| CC_Z_IN_N
))
2237 switch (GET_CODE (cond
))
2250 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? GE
: LT
);
2255 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? LT
: GE
);
2260 if (cc_status
.flags
& CC_NOT_SIGNED
)
2261 /* The flags are valid if signed condition operators are converted
2263 switch (GET_CODE (cond
))
2266 PUT_CODE (cond
, LEU
);
2271 PUT_CODE (cond
, LTU
);
2276 PUT_CODE (cond
, GTU
);
2281 PUT_CODE (cond
, GEU
);
2290 /* Report inconsistency between the assembler template and the operands.
2291 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
2294 output_operand_lossage (str
)
2297 if (this_is_asm_operands
)
2298 error_for_asm (this_is_asm_operands
, "invalid `asm': %s", str
);
2303 /* Output of assembler code from a template, and its subroutines. */
2305 /* Output text from TEMPLATE to the assembler output file,
2306 obeying %-directions to substitute operands taken from
2307 the vector OPERANDS.
2309 %N (for N a digit) means print operand N in usual manner.
2310 %lN means require operand N to be a CODE_LABEL or LABEL_REF
2311 and print the label name with no punctuation.
2312 %cN means require operand N to be a constant
2313 and print the constant expression with no punctuation.
2314 %aN means expect operand N to be a memory address
2315 (not a memory reference!) and print a reference
2317 %nN means expect operand N to be a constant
2318 and print a constant expression for minus the value
2319 of the operand, with no other punctuation. */
2324 if (flag_print_asm_name
)
2326 /* Annotate the assembly with a comment describing the pattern and
2327 alternative used. */
2330 register int num
= INSN_CODE (debug_insn
);
2331 fprintf (asm_out_file
, " %s %d %s",
2332 ASM_COMMENT_START
, INSN_UID (debug_insn
), insn_name
[num
]);
2333 if (insn_n_alternatives
[num
] > 1)
2334 fprintf (asm_out_file
, "/%d", which_alternative
+ 1);
2336 /* Clear this so only the first assembler insn
2337 of any rtl insn will get the special comment for -dp. */
2344 output_asm_insn (template, operands
)
2351 /* An insn may return a null string template
2352 in a case where no assembler code is needed. */
2357 putc ('\t', asm_out_file
);
2359 #ifdef ASM_OUTPUT_OPCODE
2360 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
2368 putc (c
, asm_out_file
);
2369 #ifdef ASM_OUTPUT_OPCODE
2370 while ((c
= *p
) == '\t')
2372 putc (c
, asm_out_file
);
2375 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
2379 #ifdef ASSEMBLER_DIALECT
2381 /* If we want the first dialect, do nothing. Otherwise, skip
2382 DIALECT_NUMBER of strings ending with '|'. */
2383 for (i
= 0; i
< dialect_number
; i
++)
2385 while (*p
&& *p
++ != '|')
2394 /* Skip to close brace. */
2395 while (*p
&& *p
++ != '}')
2404 /* %% outputs a single %. */
2408 putc (c
, asm_out_file
);
2410 /* %= outputs a number which is unique to each insn in the entire
2411 compilation. This is useful for making local labels that are
2412 referred to more than once in a given insn. */
2416 fprintf (asm_out_file
, "%d", insn_counter
);
2418 /* % followed by a letter and some digits
2419 outputs an operand in a special way depending on the letter.
2420 Letters `acln' are implemented directly.
2421 Other letters are passed to `output_operand' so that
2422 the PRINT_OPERAND macro can define them. */
2423 else if ((*p
>= 'a' && *p
<= 'z')
2424 || (*p
>= 'A' && *p
<= 'Z'))
2429 if (! (*p
>= '0' && *p
<= '9'))
2430 output_operand_lossage ("operand number missing after %-letter");
2431 else if (this_is_asm_operands
&& c
>= (unsigned) insn_noperands
)
2432 output_operand_lossage ("operand number out of range");
2433 else if (letter
== 'l')
2434 output_asm_label (operands
[c
]);
2435 else if (letter
== 'a')
2436 output_address (operands
[c
]);
2437 else if (letter
== 'c')
2439 if (CONSTANT_ADDRESS_P (operands
[c
]))
2440 output_addr_const (asm_out_file
, operands
[c
]);
2442 output_operand (operands
[c
], 'c');
2444 else if (letter
== 'n')
2446 if (GET_CODE (operands
[c
]) == CONST_INT
)
2447 fprintf (asm_out_file
,
2448 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2453 - INTVAL (operands
[c
]));
2456 putc ('-', asm_out_file
);
2457 output_addr_const (asm_out_file
, operands
[c
]);
2461 output_operand (operands
[c
], letter
);
2463 while ((c
= *p
) >= '0' && c
<= '9') p
++;
2465 /* % followed by a digit outputs an operand the default way. */
2466 else if (*p
>= '0' && *p
<= '9')
2469 if (this_is_asm_operands
&& c
>= (unsigned) insn_noperands
)
2470 output_operand_lossage ("operand number out of range");
2472 output_operand (operands
[c
], 0);
2473 while ((c
= *p
) >= '0' && c
<= '9') p
++;
2475 /* % followed by punctuation: output something for that
2476 punctuation character alone, with no operand.
2477 The PRINT_OPERAND macro decides what is actually done. */
2478 #ifdef PRINT_OPERAND_PUNCT_VALID_P
2479 else if (PRINT_OPERAND_PUNCT_VALID_P (*p
))
2480 output_operand (NULL_RTX
, *p
++);
2483 output_operand_lossage ("invalid %%-code");
2487 putc (c
, asm_out_file
);
2492 putc ('\n', asm_out_file
);
2495 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
2498 output_asm_label (x
)
2503 if (GET_CODE (x
) == LABEL_REF
)
2504 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (XEXP (x
, 0)));
2505 else if (GET_CODE (x
) == CODE_LABEL
)
2506 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
2508 output_operand_lossage ("`%l' operand isn't a label");
2510 assemble_name (asm_out_file
, buf
);
2513 /* Print operand X using machine-dependent assembler syntax.
2514 The macro PRINT_OPERAND is defined just to control this function.
2515 CODE is a non-digit that preceded the operand-number in the % spec,
2516 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
2517 between the % and the digits.
2518 When CODE is a non-letter, X is 0.
2520 The meanings of the letters are machine-dependent and controlled
2521 by PRINT_OPERAND. */
2524 output_operand (x
, code
)
2528 if (x
&& GET_CODE (x
) == SUBREG
)
2529 x
= alter_subreg (x
);
2531 /* If X is a pseudo-register, abort now rather than writing trash to the
2534 if (x
&& GET_CODE (x
) == REG
&& REGNO (x
) >= FIRST_PSEUDO_REGISTER
)
2537 PRINT_OPERAND (asm_out_file
, x
, code
);
2540 /* Print a memory reference operand for address X
2541 using machine-dependent assembler syntax.
2542 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
2548 walk_alter_subreg (x
);
2549 PRINT_OPERAND_ADDRESS (asm_out_file
, x
);
2552 /* Print an integer constant expression in assembler syntax.
2553 Addition and subtraction are the only arithmetic
2554 that may appear in these expressions. */
2557 output_addr_const (file
, x
)
2564 switch (GET_CODE (x
))
2574 assemble_name (file
, XSTR (x
, 0));
2578 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (XEXP (x
, 0)));
2579 assemble_name (file
, buf
);
2583 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
2584 assemble_name (file
, buf
);
2589 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2598 /* This used to output parentheses around the expression,
2599 but that does not work on the 386 (either ATT or BSD assembler). */
2600 output_addr_const (file
, XEXP (x
, 0));
2604 if (GET_MODE (x
) == VOIDmode
)
2606 /* We can use %d if the number is one word and positive. */
2607 if (CONST_DOUBLE_HIGH (x
))
2609 #if HOST_BITS_PER_WIDE_INT == 64
2610 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
2616 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
2622 CONST_DOUBLE_HIGH (x
), CONST_DOUBLE_LOW (x
));
2623 else if (CONST_DOUBLE_LOW (x
) < 0)
2625 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2630 CONST_DOUBLE_LOW (x
));
2633 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2638 CONST_DOUBLE_LOW (x
));
2641 /* We can't handle floating point constants;
2642 PRINT_OPERAND must handle them. */
2643 output_operand_lossage ("floating constant misused");
2647 /* Some assemblers need integer constants to appear last (eg masm). */
2648 if (GET_CODE (XEXP (x
, 0)) == CONST_INT
)
2650 output_addr_const (file
, XEXP (x
, 1));
2651 if (INTVAL (XEXP (x
, 0)) >= 0)
2652 fprintf (file
, "+");
2653 output_addr_const (file
, XEXP (x
, 0));
2657 output_addr_const (file
, XEXP (x
, 0));
2658 if (INTVAL (XEXP (x
, 1)) >= 0)
2659 fprintf (file
, "+");
2660 output_addr_const (file
, XEXP (x
, 1));
2665 /* Avoid outputting things like x-x or x+5-x,
2666 since some assemblers can't handle that. */
2667 x
= simplify_subtraction (x
);
2668 if (GET_CODE (x
) != MINUS
)
2671 output_addr_const (file
, XEXP (x
, 0));
2672 fprintf (file
, "-");
2673 if (GET_CODE (XEXP (x
, 1)) == CONST_INT
2674 && INTVAL (XEXP (x
, 1)) < 0)
2676 fprintf (file
, ASM_OPEN_PAREN
);
2677 output_addr_const (file
, XEXP (x
, 1));
2678 fprintf (file
, ASM_CLOSE_PAREN
);
2681 output_addr_const (file
, XEXP (x
, 1));
2686 output_addr_const (file
, XEXP (x
, 0));
2690 output_operand_lossage ("invalid expression as operand");
2694 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
2695 %R prints the value of REGISTER_PREFIX.
2696 %L prints the value of LOCAL_LABEL_PREFIX.
2697 %U prints the value of USER_LABEL_PREFIX.
2698 %I prints the value of IMMEDIATE_PREFIX.
2699 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
2700 Also supported are %d, %x, %s, %e, %f, %g and %%.
2702 We handle alternate assembler dialects here, just like output_asm_insn. */
2705 asm_fprintf
VPROTO((FILE *file
, char *p
, ...))
2716 VA_START (argptr
, p
);
2719 file
= va_arg (argptr
, FILE*);
2720 p
= va_arg (argptr
, char*);
2728 #ifdef ASSEMBLER_DIALECT
2730 /* If we want the first dialect, do nothing. Otherwise, skip
2731 DIALECT_NUMBER of strings ending with '|'. */
2732 for (i
= 0; i
< dialect_number
; i
++)
2734 while (*p
&& *p
++ != '|')
2743 /* Skip to close brace. */
2744 while (*p
&& *p
++ != '}')
2755 while ((c
>= '0' && c
<= '9') || c
== '.')
2763 fprintf (file
, "%%");
2766 case 'd': case 'i': case 'u':
2767 case 'x': case 'p': case 'X':
2771 fprintf (file
, buf
, va_arg (argptr
, int));
2775 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
2776 but we do not check for those cases. It means that the value
2777 is a HOST_WIDE_INT, which may be either `int' or `long'. */
2779 #if HOST_BITS_PER_WIDE_INT != HOST_BITS_PER_INT
2785 fprintf (file
, buf
, va_arg (argptr
, HOST_WIDE_INT
));
2792 fprintf (file
, buf
, va_arg (argptr
, long));
2800 fprintf (file
, buf
, va_arg (argptr
, double));
2806 fprintf (file
, buf
, va_arg (argptr
, char *));
2810 #ifdef ASM_OUTPUT_OPCODE
2811 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
2816 #ifdef REGISTER_PREFIX
2817 fprintf (file
, "%s", REGISTER_PREFIX
);
2822 #ifdef IMMEDIATE_PREFIX
2823 fprintf (file
, "%s", IMMEDIATE_PREFIX
);
2828 #ifdef LOCAL_LABEL_PREFIX
2829 fprintf (file
, "%s", LOCAL_LABEL_PREFIX
);
2834 #ifdef USER_LABEL_PREFIX
2835 fprintf (file
, "%s", USER_LABEL_PREFIX
);
2849 /* Split up a CONST_DOUBLE or integer constant rtx
2850 into two rtx's for single words,
2851 storing in *FIRST the word that comes first in memory in the target
2852 and in *SECOND the other. */
2855 split_double (value
, first
, second
)
2857 rtx
*first
, *second
;
2859 if (GET_CODE (value
) == CONST_INT
)
2861 if (HOST_BITS_PER_WIDE_INT
>= (2 * BITS_PER_WORD
))
2863 /* In this case the CONST_INT holds both target words.
2864 Extract the bits from it into two word-sized pieces. */
2866 HOST_WIDE_INT word_mask
;
2867 /* Avoid warnings for shift count >= BITS_PER_WORD. */
2868 int shift_count
= BITS_PER_WORD
- 1;
2870 word_mask
= (HOST_WIDE_INT
) 1 << shift_count
;
2871 word_mask
|= word_mask
- 1;
2872 low
= GEN_INT (INTVAL (value
) & word_mask
);
2873 high
= GEN_INT ((INTVAL (value
) >> (shift_count
+ 1)) & word_mask
);
2874 if (WORDS_BIG_ENDIAN
)
2887 /* The rule for using CONST_INT for a wider mode
2888 is that we regard the value as signed.
2889 So sign-extend it. */
2890 rtx high
= (INTVAL (value
) < 0 ? constm1_rtx
: const0_rtx
);
2891 if (WORDS_BIG_ENDIAN
)
2903 else if (GET_CODE (value
) != CONST_DOUBLE
)
2905 if (WORDS_BIG_ENDIAN
)
2907 *first
= const0_rtx
;
2913 *second
= const0_rtx
;
2916 else if (GET_MODE (value
) == VOIDmode
2917 /* This is the old way we did CONST_DOUBLE integers. */
2918 || GET_MODE_CLASS (GET_MODE (value
)) == MODE_INT
)
2920 /* In an integer, the words are defined as most and least significant.
2921 So order them by the target's convention. */
2922 if (WORDS_BIG_ENDIAN
)
2924 *first
= GEN_INT (CONST_DOUBLE_HIGH (value
));
2925 *second
= GEN_INT (CONST_DOUBLE_LOW (value
));
2929 *first
= GEN_INT (CONST_DOUBLE_LOW (value
));
2930 *second
= GEN_INT (CONST_DOUBLE_HIGH (value
));
2935 #ifdef REAL_ARITHMETIC
2936 REAL_VALUE_TYPE r
; long l
[2];
2937 REAL_VALUE_FROM_CONST_DOUBLE (r
, value
);
2939 /* Note, this converts the REAL_VALUE_TYPE to the target's
2940 format, splits up the floating point double and outputs
2941 exactly 32 bits of it into each of l[0] and l[1] --
2942 not necessarily BITS_PER_WORD bits. */
2943 REAL_VALUE_TO_TARGET_DOUBLE (r
, l
);
2945 *first
= GEN_INT ((HOST_WIDE_INT
) l
[0]);
2946 *second
= GEN_INT ((HOST_WIDE_INT
) l
[1]);
2948 if ((HOST_FLOAT_FORMAT
!= TARGET_FLOAT_FORMAT
2949 || HOST_BITS_PER_WIDE_INT
!= BITS_PER_WORD
)
2950 && ! flag_pretend_float
)
2954 #ifdef HOST_WORDS_BIG_ENDIAN
2961 /* Host and target agree => no need to swap. */
2962 *first
= GEN_INT (CONST_DOUBLE_LOW (value
));
2963 *second
= GEN_INT (CONST_DOUBLE_HIGH (value
));
2967 *second
= GEN_INT (CONST_DOUBLE_LOW (value
));
2968 *first
= GEN_INT (CONST_DOUBLE_HIGH (value
));
2970 #endif /* no REAL_ARITHMETIC */
2974 /* Return nonzero if this function has no function calls. */
2981 if (profile_flag
|| profile_block_flag
)
2984 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
2986 if (GET_CODE (insn
) == CALL_INSN
)
2988 if (GET_CODE (insn
) == INSN
2989 && GET_CODE (PATTERN (insn
)) == SEQUENCE
2990 && GET_CODE (XVECEXP (PATTERN (insn
), 0, 0)) == CALL_INSN
)
2993 for (insn
= current_function_epilogue_delay_list
; insn
; insn
= XEXP (insn
, 1))
2995 if (GET_CODE (XEXP (insn
, 0)) == CALL_INSN
)
2997 if (GET_CODE (XEXP (insn
, 0)) == INSN
2998 && GET_CODE (PATTERN (XEXP (insn
, 0))) == SEQUENCE
2999 && GET_CODE (XVECEXP (PATTERN (XEXP (insn
, 0)), 0, 0)) == CALL_INSN
)
3006 /* On some machines, a function with no call insns
3007 can run faster if it doesn't create its own register window.
3008 When output, the leaf function should use only the "output"
3009 registers. Ordinarily, the function would be compiled to use
3010 the "input" registers to find its arguments; it is a candidate
3011 for leaf treatment if it uses only the "input" registers.
3012 Leaf function treatment means renumbering so the function
3013 uses the "output" registers instead. */
3015 #ifdef LEAF_REGISTERS
3017 static char permitted_reg_in_leaf_functions
[] = LEAF_REGISTERS
;
3019 /* Return 1 if this function uses only the registers that can be
3020 safely renumbered. */
3023 only_leaf_regs_used ()
3027 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
3029 if ((regs_ever_live
[i
] || global_regs
[i
])
3030 && ! permitted_reg_in_leaf_functions
[i
])
3036 /* Scan all instructions and renumber all registers into those
3037 available in leaf functions. */
3040 leaf_renumber_regs (first
)
3045 /* Renumber only the actual patterns.
3046 The reg-notes can contain frame pointer refs,
3047 and renumbering them could crash, and should not be needed. */
3048 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
3049 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3050 leaf_renumber_regs_insn (PATTERN (insn
));
3051 for (insn
= current_function_epilogue_delay_list
; insn
; insn
= XEXP (insn
, 1))
3052 if (GET_RTX_CLASS (GET_CODE (XEXP (insn
, 0))) == 'i')
3053 leaf_renumber_regs_insn (PATTERN (XEXP (insn
, 0)));
3056 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
3057 available in leaf functions. */
3060 leaf_renumber_regs_insn (in_rtx
)
3061 register rtx in_rtx
;
3064 register char *format_ptr
;
3069 /* Renumber all input-registers into output-registers.
3070 renumbered_regs would be 1 for an output-register;
3073 if (GET_CODE (in_rtx
) == REG
)
3077 /* Don't renumber the same reg twice. */
3081 newreg
= REGNO (in_rtx
);
3082 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
3083 to reach here as part of a REG_NOTE. */
3084 if (newreg
>= FIRST_PSEUDO_REGISTER
)
3089 newreg
= LEAF_REG_REMAP (newreg
);
3092 regs_ever_live
[REGNO (in_rtx
)] = 0;
3093 regs_ever_live
[newreg
] = 1;
3094 REGNO (in_rtx
) = newreg
;
3098 if (GET_RTX_CLASS (GET_CODE (in_rtx
)) == 'i')
3100 /* Inside a SEQUENCE, we find insns.
3101 Renumber just the patterns of these insns,
3102 just as we do for the top-level insns. */
3103 leaf_renumber_regs_insn (PATTERN (in_rtx
));
3107 format_ptr
= GET_RTX_FORMAT (GET_CODE (in_rtx
));
3109 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (in_rtx
)); i
++)
3110 switch (*format_ptr
++)
3113 leaf_renumber_regs_insn (XEXP (in_rtx
, i
));
3117 if (NULL
!= XVEC (in_rtx
, i
))
3119 for (j
= 0; j
< XVECLEN (in_rtx
, i
); j
++)
3120 leaf_renumber_regs_insn (XVECEXP (in_rtx
, i
, j
));