1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-7, 1998 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. */
69 #include "insn-config.h"
70 #include "insn-flags.h"
71 #include "insn-attr.h"
72 #include "insn-codes.h"
74 #include "conditions.h"
77 #include "hard-reg-set.h"
82 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
83 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
84 #if defined (USG) || defined (NO_STAB_H)
85 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
87 #include <stab.h> /* On BSD, use the system's stab.h. */
89 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
91 #ifdef XCOFF_DEBUGGING_INFO
95 /* .stabd code for line number. */
100 /* .stabs code for included file name. */
105 #ifndef INT_TYPE_SIZE
106 #define INT_TYPE_SIZE BITS_PER_WORD
109 #ifndef LONG_TYPE_SIZE
110 #define LONG_TYPE_SIZE BITS_PER_WORD
113 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
114 null default for it to save conditionalization later. */
115 #ifndef CC_STATUS_INIT
116 #define CC_STATUS_INIT
119 /* How to start an assembler comment. */
120 #ifndef ASM_COMMENT_START
121 #define ASM_COMMENT_START ";#"
124 /* Is the given character a logical line separator for the assembler? */
125 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
126 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
129 /* Nonzero means this function is a leaf function, with no function calls.
130 This variable exists to be examined in FUNCTION_PROLOGUE
131 and FUNCTION_EPILOGUE. Always zero, unless set by some action. */
134 /* Last insn processed by final_scan_insn. */
135 static rtx debug_insn
= 0;
137 /* Line number of last NOTE. */
138 static int last_linenum
;
140 /* Highest line number in current block. */
141 static int high_block_linenum
;
143 /* Likewise for function. */
144 static int high_function_linenum
;
146 /* Filename of last NOTE. */
147 static char *last_filename
;
149 /* Number of basic blocks seen so far;
150 used if profile_block_flag is set. */
151 static int count_basic_blocks
;
153 /* Number of instrumented arcs when profile_arc_flag is set. */
154 extern int count_instrumented_arcs
;
156 extern int length_unit_log
; /* This is defined in insn-attrtab.c. */
158 /* Nonzero while outputting an `asm' with operands.
159 This means that inconsistencies are the user's fault, so don't abort.
160 The precise value is the insn being output, to pass to error_for_asm. */
161 static rtx this_is_asm_operands
;
163 /* Number of operands of this insn, for an `asm' with operands. */
164 static int insn_noperands
;
166 /* Compare optimization flag. */
168 static rtx last_ignored_compare
= 0;
170 /* Flag indicating this insn is the start of a new basic block. */
172 static int new_block
= 1;
174 /* All the symbol-blocks (levels of scoping) in the compilation
175 are assigned sequence numbers in order of appearance of the
176 beginnings of the symbol-blocks. Both final and dbxout do this,
177 and assume that they will both give the same number to each block.
178 Final uses these sequence numbers to generate assembler label names
179 LBBnnn and LBEnnn for the beginning and end of the symbol-block.
180 Dbxout uses the sequence numbers to generate references to the same labels
181 from the dbx debugging information.
183 Sdb records this level at the beginning of each function,
184 in order to find the current level when recursing down declarations.
185 It outputs the block beginning and endings
186 at the point in the asm file where the blocks would begin and end. */
188 int next_block_index
;
190 /* Assign a unique number to each insn that is output.
191 This can be used to generate unique local labels. */
193 static int insn_counter
= 0;
196 /* This variable contains machine-dependent flags (defined in tm.h)
197 set and examined by output routines
198 that describe how to interpret the condition codes properly. */
202 /* During output of an insn, this contains a copy of cc_status
203 from before the insn. */
205 CC_STATUS cc_prev_status
;
208 /* Indexed by hardware reg number, is 1 if that register is ever
209 used in the current function.
211 In life_analysis, or in stupid_life_analysis, this is set
212 up to record the hard regs used explicitly. Reload adds
213 in the hard regs used for holding pseudo regs. Final uses
214 it to generate the code in the function prologue and epilogue
215 to save and restore registers as needed. */
217 char regs_ever_live
[FIRST_PSEUDO_REGISTER
];
219 /* Nonzero means current function must be given a frame pointer.
220 Set in stmt.c if anything is allocated on the stack there.
221 Set in reload1.c if anything is allocated on the stack there. */
223 int frame_pointer_needed
;
225 /* Assign unique numbers to labels generated for profiling. */
227 int profile_label_no
;
229 /* Length so far allocated in PENDING_BLOCKS. */
231 static int max_block_depth
;
233 /* Stack of sequence numbers of symbol-blocks of which we have seen the
234 beginning but not yet the end. Sequence numbers are assigned at
235 the beginning; this stack allows us to find the sequence number
236 of a block that is ending. */
238 static int *pending_blocks
;
240 /* Number of elements currently in use in PENDING_BLOCKS. */
242 static int block_depth
;
244 /* Nonzero if have enabled APP processing of our assembler output. */
248 /* If we are outputting an insn sequence, this contains the sequence rtx.
253 #ifdef ASSEMBLER_DIALECT
255 /* Number of the assembler dialect to use, starting at 0. */
256 static int dialect_number
;
259 /* Indexed by line number, nonzero if there is a note for that line. */
261 static char *line_note_exists
;
263 /* Linked list to hold line numbers for each basic block. */
266 struct bb_list
*next
; /* pointer to next basic block */
267 int line_num
; /* line number */
268 int file_label_num
; /* LPBC<n> label # for stored filename */
269 int func_label_num
; /* LPBC<n> label # for stored function name */
272 static struct bb_list
*bb_head
= 0; /* Head of basic block list */
273 static struct bb_list
**bb_tail
= &bb_head
; /* Ptr to store next bb ptr */
274 static int bb_file_label_num
= -1; /* Current label # for file */
275 static int bb_func_label_num
= -1; /* Current label # for func */
277 /* Linked list to hold the strings for each file and function name output. */
280 struct bb_str
*next
; /* pointer to next string */
281 char *string
; /* string */
282 int label_num
; /* label number */
283 int length
; /* string length */
286 extern rtx peephole
PROTO((rtx
));
288 static struct bb_str
*sbb_head
= 0; /* Head of string list. */
289 static struct bb_str
**sbb_tail
= &sbb_head
; /* Ptr to store next bb str */
290 static int sbb_label_num
= 0; /* Last label used */
292 #ifdef HAVE_ATTR_length
293 static int asm_insn_count
PROTO((rtx
));
295 static void profile_function
PROTO((FILE *));
296 static void profile_after_prologue
PROTO((FILE *));
297 static void add_bb
PROTO((FILE *));
298 static int add_bb_string
PROTO((char *, int));
299 static void output_source_line
PROTO((FILE *, rtx
));
300 static rtx walk_alter_subreg
PROTO((rtx
));
301 static void output_asm_name
PROTO((void));
302 static void output_operand
PROTO((rtx
, int));
303 #ifdef LEAF_REGISTERS
304 static void leaf_renumber_regs
PROTO((rtx
));
307 static int alter_cond
PROTO((rtx
));
310 extern char *getpwd ();
312 /* Initialize data in final at the beginning of a compilation. */
315 init_final (filename
)
318 next_block_index
= 2;
320 max_block_depth
= 20;
321 pending_blocks
= (int *) xmalloc (20 * sizeof *pending_blocks
);
324 #ifdef ASSEMBLER_DIALECT
325 dialect_number
= ASSEMBLER_DIALECT
;
329 /* Called at end of source file,
330 to output the block-profiling table for this entire compilation. */
338 if (profile_block_flag
|| profile_arc_flag
)
341 int align
= exact_log2 (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
);
345 int long_bytes
= LONG_TYPE_SIZE
/ BITS_PER_UNIT
;
346 int pointer_bytes
= POINTER_SIZE
/ BITS_PER_UNIT
;
348 if (profile_block_flag
)
349 size
= long_bytes
* count_basic_blocks
;
351 size
= long_bytes
* count_instrumented_arcs
;
354 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
355 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
356 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
360 /* Output the main header, of 11 words:
361 0: 1 if this file is initialized, else 0.
362 1: address of file name (LPBX1).
363 2: address of table of counts (LPBX2).
364 3: number of counts in the table.
365 4: always 0, for compatibility with Sun.
367 The following are GNU extensions:
369 5: address of table of start addrs of basic blocks (LPBX3).
370 6: Number of bytes in this header.
371 7: address of table of function names (LPBX4).
372 8: address of table of line numbers (LPBX5) or 0.
373 9: address of table of file names (LPBX6) or 0.
374 10: space reserved for basic block profiling. */
376 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
378 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 0);
380 assemble_integer (const0_rtx
, long_bytes
, 1);
382 /* address of filename */
383 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 1);
384 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
, 1);
386 /* address of count table */
387 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 2);
388 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
, 1);
390 /* count of the # of basic blocks or # of instrumented arcs */
391 if (profile_block_flag
)
392 assemble_integer (GEN_INT (count_basic_blocks
), long_bytes
, 1);
394 assemble_integer (GEN_INT (count_instrumented_arcs
), long_bytes
,
397 /* zero word (link field) */
398 assemble_integer (const0_rtx
, pointer_bytes
, 1);
400 /* address of basic block start address table */
401 if (profile_block_flag
)
403 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 3);
404 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
,
408 assemble_integer (const0_rtx
, pointer_bytes
, 1);
410 /* byte count for extended structure. */
411 assemble_integer (GEN_INT (10 * UNITS_PER_WORD
), long_bytes
, 1);
413 /* address of function name table */
414 if (profile_block_flag
)
416 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 4);
417 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
,
421 assemble_integer (const0_rtx
, pointer_bytes
, 1);
423 /* address of line number and filename tables if debugging. */
424 if (write_symbols
!= NO_DEBUG
&& profile_block_flag
)
426 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 5);
427 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
, 1);
428 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 6);
429 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
, 1);
433 assemble_integer (const0_rtx
, pointer_bytes
, 1);
434 assemble_integer (const0_rtx
, pointer_bytes
, 1);
437 /* space for extension ptr (link field) */
438 assemble_integer (const0_rtx
, UNITS_PER_WORD
, 1);
440 /* Output the file name changing the suffix to .d for Sun tcov
442 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 1);
444 char *cwd
= getpwd ();
445 int len
= strlen (filename
) + strlen (cwd
) + 1;
446 char *data_file
= (char *) alloca (len
+ 4);
448 strcpy (data_file
, cwd
);
449 strcat (data_file
, "/");
450 strcat (data_file
, filename
);
451 strip_off_ending (data_file
, len
);
452 if (profile_block_flag
)
453 strcat (data_file
, ".d");
455 strcat (data_file
, ".da");
456 assemble_string (data_file
, strlen (data_file
) + 1);
459 /* Make space for the table of counts. */
462 /* Realign data section. */
463 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
464 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 2);
466 assemble_zeros (size
);
470 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 2);
471 #ifdef ASM_OUTPUT_SHARED_LOCAL
472 if (flag_shared_data
)
473 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
476 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
477 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
480 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
481 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
,
484 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
489 /* Output any basic block strings */
490 if (profile_block_flag
)
492 readonly_data_section ();
495 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
496 for (sptr
= sbb_head
; sptr
!= 0; sptr
= sptr
->next
)
498 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBC",
500 assemble_string (sptr
->string
, sptr
->length
);
505 /* Output the table of addresses. */
506 if (profile_block_flag
)
508 /* Realign in new section */
509 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
510 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 3);
511 for (i
= 0; i
< count_basic_blocks
; i
++)
513 ASM_GENERATE_INTERNAL_LABEL (name
, "LPB", i
);
514 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
),
519 /* Output the table of function names. */
520 if (profile_block_flag
)
522 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 4);
523 for ((ptr
= bb_head
), (i
= 0); ptr
!= 0; (ptr
= ptr
->next
), i
++)
525 if (ptr
->func_label_num
>= 0)
527 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBC",
528 ptr
->func_label_num
);
529 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
),
533 assemble_integer (const0_rtx
, pointer_bytes
, 1);
536 for ( ; i
< count_basic_blocks
; i
++)
537 assemble_integer (const0_rtx
, pointer_bytes
, 1);
540 if (write_symbols
!= NO_DEBUG
&& profile_block_flag
)
542 /* Output the table of line numbers. */
543 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 5);
544 for ((ptr
= bb_head
), (i
= 0); ptr
!= 0; (ptr
= ptr
->next
), i
++)
545 assemble_integer (GEN_INT (ptr
->line_num
), long_bytes
, 1);
547 for ( ; i
< count_basic_blocks
; i
++)
548 assemble_integer (const0_rtx
, long_bytes
, 1);
550 /* Output the table of file names. */
551 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 6);
552 for ((ptr
= bb_head
), (i
= 0); ptr
!= 0; (ptr
= ptr
->next
), i
++)
554 if (ptr
->file_label_num
>= 0)
556 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBC",
557 ptr
->file_label_num
);
558 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
),
562 assemble_integer (const0_rtx
, pointer_bytes
, 1);
565 for ( ; i
< count_basic_blocks
; i
++)
566 assemble_integer (const0_rtx
, pointer_bytes
, 1);
569 /* End with the address of the table of addresses,
570 so we can find it easily, as the last word in the file's text. */
571 if (profile_block_flag
)
573 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 3);
574 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
,
580 /* Enable APP processing of subsequent output.
581 Used before the output from an `asm' statement. */
588 fputs (ASM_APP_ON
, asm_out_file
);
593 /* Disable APP processing of subsequent output.
594 Called from varasm.c before most kinds of output. */
601 fputs (ASM_APP_OFF
, asm_out_file
);
606 /* Return the number of slots filled in the current
607 delayed branch sequence (we don't count the insn needing the
608 delay slot). Zero if not in a delayed branch sequence. */
612 dbr_sequence_length ()
614 if (final_sequence
!= 0)
615 return XVECLEN (final_sequence
, 0) - 1;
621 /* The next two pages contain routines used to compute the length of an insn
622 and to shorten branches. */
624 /* Arrays for insn lengths, and addresses. The latter is referenced by
625 `insn_current_length'. */
627 static short *insn_lengths
;
630 /* Address of insn being processed. Used by `insn_current_length'. */
631 int insn_current_address
;
633 /* Address of insn being processed in previous iteration. */
634 int insn_last_address
;
636 /* konwn invariant alignment of insn being processed. */
637 int insn_current_align
;
639 /* Indicate that branch shortening hasn't yet been done. */
647 /* Obtain the current length of an insn. If branch shortening has been done,
648 get its actual length. Otherwise, get its maximum length. */
651 get_attr_length (insn
)
654 #ifdef HAVE_ATTR_length
660 return insn_lengths
[INSN_UID (insn
)];
662 switch (GET_CODE (insn
))
670 length
= insn_default_length (insn
);
674 body
= PATTERN (insn
);
675 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
677 /* Alignment is machine-dependent and should be handled by
681 length
= insn_default_length (insn
);
685 body
= PATTERN (insn
);
686 if (GET_CODE (body
) == USE
|| GET_CODE (body
) == CLOBBER
)
689 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
690 length
= asm_insn_count (body
) * insn_default_length (insn
);
691 else if (GET_CODE (body
) == SEQUENCE
)
692 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
693 length
+= get_attr_length (XVECEXP (body
, 0, i
));
695 length
= insn_default_length (insn
);
702 #ifdef ADJUST_INSN_LENGTH
703 ADJUST_INSN_LENGTH (insn
, length
);
706 #else /* not HAVE_ATTR_length */
708 #endif /* not HAVE_ATTR_length */
711 /* Code to handle alignment inside shorten_branches. */
713 /* Here is an explanation how the algorithm in align_fuzz can give
716 Call a sequence of instructions beginning with alignment point X
717 and continuing until the next alignment point `block X'. When `X'
718 is used in an expression, it means the alignment value of the
721 Call the distance between the start of the first insn of block X, and
722 the end of the last insn of block X `IX', for the `inner size of X'.
723 This is clearly the sum of the instruction lengths.
725 Likewise with the next alignment-delimited block following X, which we
728 Call the distance between the start of the first insn of block X, and
729 the start of the first insn of block Y `OX', for the `outer size of X'.
731 The estimated padding is then OX - IX.
733 OX can be safely estimated as
738 OX = round_up(IX, X) + Y - X
740 Clearly est(IX) >= real(IX), because that only depends on the
741 instruction lengths, and those being overestimated is a given.
743 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
744 we needn't worry about that when thinking about OX.
746 When X >= Y, the alignment provided by Y adds no uncertainty factor
747 for branch ranges starting before X, so we can just round what we have.
748 But when X < Y, we don't know anything about the, so to speak,
749 `middle bits', so we have to assume the worst when aligning up from an
750 address mod X to one mod Y, which is Y - X. */
753 #define LABEL_ALIGN(LABEL) 0
757 #define LOOP_ALIGN(LABEL) 0
760 #ifndef LABEL_ALIGN_AFTER_BARRIER
761 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
764 #ifndef ADDR_VEC_ALIGN
766 final_addr_vec_align (addr_vec
)
769 int align
= exact_log2 (GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec
))));
771 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
772 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
776 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
779 #ifndef INSN_LENGTH_ALIGNMENT
780 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
783 /* For any insn, uid_align[INSN_UID (insn)] gives the next following
784 alignment insn that increases the known alignment, or NULL_RTX if
785 there is no such insn.
786 For any alignment obtained this way, we can again index uid_align with
787 its uid to obtain the next following align that in turn increases the
788 alignment, till we reach NULL_RTX; the sequence obtained this way
789 for each insn we'll call the alignment chain of this insn in the following
794 short *label_align
; /* sh.c needs this to calculate constant tables. */
796 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
798 static int min_labelno
, max_labelno
;
800 #define LABEL_TO_ALIGNMENT(LABEL) \
801 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno])
803 /* For the benefit of port specific code do this also as a function. */
805 label_to_alignment (label
)
808 return LABEL_TO_ALIGNMENT (label
);
811 #ifdef HAVE_ATTR_length
812 /* The differences in addresses
813 between a branch and its target might grow or shrink depending on
814 the alignment the start insn of the range (the branch for a forward
815 branch or the label for a backward branch) starts out on; if these
816 differences are used naively, they can even oscillate infinitely.
817 We therefore want to compute a 'worst case' address difference that
818 is independent of the alignment the start insn of the range end
819 up on, and that is at least as large as the actual difference.
820 The function align_fuzz calculates the amount we have to add to the
821 naively computed difference, by traversing the part of the alignment
822 chain of the start insn of the range that is in front of the end insn
823 of the range, and considering for each alignment the maximum amount
824 that it might contribute to a size increase.
826 For casesi tables, we also want to know worst case minimum amounts of
827 address difference, in case a machine description wants to introduce
828 some common offset that is added to all offsets in a table.
829 For this purpose, align_fuzz with a growth argument of 0 comuptes the
830 appropriate adjustment. */
833 /* Compute the maximum delta by which the difference of the addresses of
834 START and END might grow / shrink due to a different address for start
835 which changes the size of alignment insns between START and END.
836 KNOWN_ALIGN_LOG is the alignment known for START.
837 GROWTH should be ~0 if the objective is to compute potential code size
838 increase, and 0 if the objective is to compute potential shrink.
839 The return value is undefined for any other value of GROWTH. */
841 align_fuzz (start
, end
, known_align_log
, growth
)
846 int uid
= INSN_UID (start
);
848 int known_align
= 1 << known_align_log
;
849 int end_shuid
= INSN_SHUID (end
);
852 for (align_label
= uid_align
[uid
]; align_label
; align_label
= uid_align
[uid
])
854 int align_addr
, new_align
;
856 uid
= INSN_UID (align_label
);
857 align_addr
= insn_addresses
[uid
] - insn_lengths
[uid
];
858 if (uid_shuid
[uid
] > end_shuid
)
860 known_align_log
= LABEL_TO_ALIGNMENT (align_label
);
861 new_align
= 1 << known_align_log
;
862 if (new_align
< known_align
)
864 fuzz
+= (-align_addr
^ growth
) & (new_align
- known_align
);
865 known_align
= new_align
;
870 /* Compute a worst-case reference address of a branch so that it
871 can be safely used in the presence of aligned labels. Since the
872 size of the branch itself is unknown, the size of the branch is
873 not included in the range. I.e. for a forward branch, the reference
874 address is the end address of the branch as known from the previous
875 branch shortening pass, minus a value to account for possible size
876 increase due to alignment. For a backward branch, it is the start
877 address of the branch as known from the current pass, plus a value
878 to account for possible size increase due to alignment.
879 NB.: Therefore, the maximum offset allowed for backward branches needs
880 to exclude the branch size. */
882 insn_current_reference_address (branch
)
886 rtx seq
= NEXT_INSN (PREV_INSN (branch
));
887 int seq_uid
= INSN_UID (seq
);
888 if (GET_CODE (branch
) != JUMP_INSN
)
889 /* This can happen for example on the PA; the objective is to know the
890 offset to address something in front of the start of the function.
891 Thus, we can treat it like a backward branch.
892 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
893 any alignment we'd encounter, so we skip the call to align_fuzz. */
894 return insn_current_address
;
895 dest
= JUMP_LABEL (branch
);
896 if (INSN_SHUID (branch
) < INSN_SHUID (dest
))
898 /* Forward branch. */
899 return (insn_last_address
+ insn_lengths
[seq_uid
]
900 - align_fuzz (seq
, dest
, length_unit_log
, ~0));
904 /* Backward branch. */
905 return (insn_current_address
906 + align_fuzz (dest
, seq
, length_unit_log
, ~0));
909 #endif /* HAVE_ATTR_length */
911 /* Make a pass over all insns and compute their actual lengths by shortening
912 any branches of variable length if possible. */
914 /* Give a default value for the lowest address in a function. */
916 #ifndef FIRST_INSN_ADDRESS
917 #define FIRST_INSN_ADDRESS 0
920 /* shorten_branches might be called multiple times: for example, the SH
921 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
922 In order to do this, it needs proper length information, which it obtains
923 by calling shorten_branches. This cannot be collapsed with
924 shorten_branches itself into a single pass unless we also want to intergate
925 reorg.c, since the branch splitting exposes new instructions with delay
929 shorten_branches (first
)
936 #ifdef HAVE_ATTR_length
937 #define MAX_CODE_ALIGN 16
939 int something_changed
= 1;
940 char *varying_length
;
943 rtx align_tab
[MAX_CODE_ALIGN
];
945 /* In order to make sure that all instructions have valid length info,
946 we must split them before we compute the address/length info. */
948 for (insn
= NEXT_INSN (first
); insn
; insn
= NEXT_INSN (insn
))
949 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
952 insn
= try_split (PATTERN (old
), old
, 1);
953 /* When not optimizing, the old insn will be still left around
954 with only the 'deleted' bit set. Transform it into a note
955 to avoid confusion of subsequent processing. */
956 if (INSN_DELETED_P (old
))
958 PUT_CODE (old
, NOTE
);
959 NOTE_LINE_NUMBER (old
) = NOTE_INSN_DELETED
;
960 NOTE_SOURCE_FILE (old
) = 0;
965 /* We must do some computations even when not actually shortening, in
966 order to get the alignment information for the labels. */
968 /* Compute maximum UID and allocate label_align / uid_shuid. */
969 max_uid
= get_max_uid ();
971 max_labelno
= max_label_num ();
972 min_labelno
= get_first_label_num ();
976 = (short*) xmalloc ((max_labelno
- min_labelno
+ 1) * sizeof (short));
977 bzero (label_align
, (max_labelno
- min_labelno
+ 1) * sizeof (short));
981 uid_shuid
= (int *) xmalloc (max_uid
* sizeof *uid_shuid
);
983 /* Initialize label_align and set up uid_shuid to be strictly
984 monotonically rising with insn order. */
985 /* We use max_log here to keep track of the maximum alignment we want to
986 impose on the next CODE_LABEL (or the current one if we are processing
987 the CODE_LABEL itself). */
989 for (max_log
= 0, insn
= get_insns (), i
= 1; insn
; insn
= NEXT_INSN (insn
))
993 INSN_SHUID (insn
) = i
++;
994 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
996 /* reorg might make the first insn of a loop being run once only,
997 and delete the label in front of it. Then we want to apply
998 the loop alignment to the new label created by reorg, which
999 is separated by the former loop start insn from the
1000 NOTE_INSN_LOOP_BEG. */
1002 else if (GET_CODE (insn
) == CODE_LABEL
)
1006 log
= LABEL_ALIGN (insn
);
1009 next
= NEXT_INSN (insn
);
1010 /* ADDR_VECs only take room if read-only data goes into the text section. */
1011 #if !defined(READONLY_DATA_SECTION) || defined(JUMP_TABLES_IN_TEXT_SECTION)
1012 if (next
&& GET_CODE (next
) == JUMP_INSN
)
1014 rtx nextbody
= PATTERN (next
);
1015 if (GET_CODE (nextbody
) == ADDR_VEC
1016 || GET_CODE (nextbody
) == ADDR_DIFF_VEC
)
1018 log
= ADDR_VEC_ALIGN (next
);
1024 LABEL_TO_ALIGNMENT (insn
) = max_log
;
1027 else if (GET_CODE (insn
) == BARRIER
)
1031 for (label
= insn
; label
&& GET_RTX_CLASS (GET_CODE (label
)) != 'i';
1032 label
= NEXT_INSN (label
))
1033 if (GET_CODE (label
) == CODE_LABEL
)
1035 log
= LABEL_ALIGN_AFTER_BARRIER (insn
);
1041 /* Again, we allow NOTE_INSN_LOOP_BEG - INSN - CODE_LABEL
1042 sequences in order to handle reorg output efficiently. */
1043 else if (GET_CODE (insn
) == NOTE
1044 && NOTE_LINE_NUMBER (insn
) == NOTE_INSN_LOOP_BEG
)
1048 for (label
= insn
; label
; label
= NEXT_INSN (label
))
1049 if (GET_CODE (label
) == CODE_LABEL
)
1051 log
= LOOP_ALIGN (insn
);
1060 #ifdef HAVE_ATTR_length
1062 /* Allocate the rest of the arrays. */
1064 free (insn_lengths
);
1065 insn_lengths
= (short *) xmalloc (max_uid
* sizeof (short));
1067 free (insn_addresses
);
1068 insn_addresses
= (int *) xmalloc (max_uid
* sizeof (int));
1071 uid_align
= (rtx
*) xmalloc (max_uid
* sizeof *uid_align
);
1073 varying_length
= (char *) xmalloc (max_uid
* sizeof (char));
1075 bzero (varying_length
, max_uid
);
1077 /* Initialize uid_align. We scan instructions
1078 from end to start, and keep in align_tab[n] the last seen insn
1079 that does an alignment of at least n+1, i.e. the successor
1080 in the alignment chain for an insn that does / has a known
1083 bzero ((char *) uid_align
, max_uid
* sizeof *uid_align
);
1085 for (i
= MAX_CODE_ALIGN
; --i
>= 0; )
1086 align_tab
[i
] = NULL_RTX
;
1087 seq
= get_last_insn ();
1088 for (insn_current_address
= 0; seq
; seq
= PREV_INSN (seq
))
1090 int uid
= INSN_UID (seq
);
1092 log
= (GET_CODE (seq
) == CODE_LABEL
? LABEL_TO_ALIGNMENT (seq
) : 0);
1093 uid_align
[uid
] = align_tab
[0];
1094 insn_addresses
[uid
] = --insn_current_address
;
1097 /* Found an alignment label. */
1098 uid_align
[uid
] = align_tab
[log
];
1099 for (i
= log
- 1; i
>= 0; i
--)
1102 if (GET_CODE (seq
) != INSN
|| GET_CODE (PATTERN (seq
)) != SEQUENCE
)
1106 insn
= XVECEXP (PATTERN (seq
), 0, 0);
1107 uid
= INSN_UID (insn
);
1112 /* Compute initial lengths, addresses, and varying flags for each insn. */
1113 for (insn_current_address
= FIRST_INSN_ADDRESS
, insn
= first
;
1115 insn_current_address
+= insn_lengths
[uid
], insn
= NEXT_INSN (insn
))
1117 uid
= INSN_UID (insn
);
1119 insn_lengths
[uid
] = 0;
1121 if (GET_CODE (insn
) == CODE_LABEL
)
1123 int log
= LABEL_TO_ALIGNMENT (insn
);
1126 int align
= 1 << log
;
1127 int new_address
= insn_current_address
+ align
- 1 & -align
;
1128 insn_lengths
[uid
] = new_address
- insn_current_address
;
1129 insn_current_address
= new_address
;
1133 insn_addresses
[uid
] = insn_current_address
;
1135 if (GET_CODE (insn
) == NOTE
|| GET_CODE (insn
) == BARRIER
1136 || GET_CODE (insn
) == CODE_LABEL
)
1138 if (INSN_DELETED_P (insn
))
1141 body
= PATTERN (insn
);
1142 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
1143 ; /* This should be handled by LABEL_ALIGN. */
1144 else if (asm_noperands (body
) >= 0)
1145 insn_lengths
[uid
] = asm_insn_count (body
) * insn_default_length (insn
);
1146 else if (GET_CODE (body
) == SEQUENCE
)
1149 int const_delay_slots
;
1151 const_delay_slots
= const_num_delay_slots (XVECEXP (body
, 0, 0));
1153 const_delay_slots
= 0;
1155 /* Inside a delay slot sequence, we do not do any branch shortening
1156 if the shortening could change the number of delay slots
1158 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1160 rtx inner_insn
= XVECEXP (body
, 0, i
);
1161 int inner_uid
= INSN_UID (inner_insn
);
1164 if (asm_noperands (PATTERN (XVECEXP (body
, 0, i
))) >= 0)
1165 inner_length
= (asm_insn_count (PATTERN (inner_insn
))
1166 * insn_default_length (inner_insn
));
1168 inner_length
= insn_default_length (inner_insn
);
1170 insn_lengths
[inner_uid
] = inner_length
;
1171 if (const_delay_slots
)
1173 if ((varying_length
[inner_uid
]
1174 = insn_variable_length_p (inner_insn
)) != 0)
1175 varying_length
[uid
] = 1;
1176 insn_addresses
[inner_uid
] = (insn_current_address
+
1180 varying_length
[inner_uid
] = 0;
1181 insn_lengths
[uid
] += inner_length
;
1184 else if (GET_CODE (body
) != USE
&& GET_CODE (body
) != CLOBBER
)
1186 insn_lengths
[uid
] = insn_default_length (insn
);
1187 varying_length
[uid
] = insn_variable_length_p (insn
);
1190 /* If needed, do any adjustment. */
1191 #ifdef ADJUST_INSN_LENGTH
1192 ADJUST_INSN_LENGTH (insn
, insn_lengths
[uid
]);
1196 /* Now loop over all the insns finding varying length insns. For each,
1197 get the current insn length. If it has changed, reflect the change.
1198 When nothing changes for a full pass, we are done. */
1200 while (something_changed
)
1202 something_changed
= 0;
1203 insn_current_align
= MAX_CODE_ALIGN
- 1;
1204 for (insn_current_address
= FIRST_INSN_ADDRESS
, insn
= first
;
1206 insn
= NEXT_INSN (insn
))
1209 #ifdef SHORTEN_WITH_ADJUST_INSN_LENGTH
1210 #ifdef ADJUST_INSN_LENGTH
1216 uid
= INSN_UID (insn
);
1218 if (GET_CODE (insn
) == CODE_LABEL
)
1220 int log
= LABEL_TO_ALIGNMENT (insn
);
1221 if (log
> insn_current_align
)
1223 int align
= 1 << log
;
1224 int new_address
= insn_current_address
+ align
- 1 & -align
;
1225 insn_lengths
[uid
] = new_address
- insn_current_address
;
1226 insn_current_align
= log
;
1227 insn_current_address
= new_address
;
1230 insn_lengths
[uid
] = 0;
1231 insn_addresses
[uid
] = insn_current_address
;
1235 length_align
= INSN_LENGTH_ALIGNMENT (insn
);
1236 if (length_align
< insn_current_align
)
1237 insn_current_align
= length_align
;
1239 insn_last_address
= insn_addresses
[uid
];
1240 insn_addresses
[uid
] = insn_current_address
;
1242 if (! varying_length
[uid
])
1244 insn_current_address
+= insn_lengths
[uid
];
1247 if (GET_CODE (insn
) == INSN
&& GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1251 body
= PATTERN (insn
);
1253 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1255 rtx inner_insn
= XVECEXP (body
, 0, i
);
1256 int inner_uid
= INSN_UID (inner_insn
);
1259 insn_addresses
[inner_uid
] = insn_current_address
;
1261 /* insn_current_length returns 0 for insns with a
1262 non-varying length. */
1263 if (! varying_length
[inner_uid
])
1264 inner_length
= insn_lengths
[inner_uid
];
1266 inner_length
= insn_current_length (inner_insn
);
1268 if (inner_length
!= insn_lengths
[inner_uid
])
1270 insn_lengths
[inner_uid
] = inner_length
;
1271 something_changed
= 1;
1273 insn_current_address
+= insn_lengths
[inner_uid
];
1274 new_length
+= inner_length
;
1279 new_length
= insn_current_length (insn
);
1280 insn_current_address
+= new_length
;
1283 #ifdef SHORTEN_WITH_ADJUST_INSN_LENGTH
1284 #ifdef ADJUST_INSN_LENGTH
1285 /* If needed, do any adjustment. */
1286 tmp_length
= new_length
;
1287 ADJUST_INSN_LENGTH (insn
, new_length
);
1288 insn_current_address
+= (new_length
- tmp_length
);
1292 if (new_length
!= insn_lengths
[uid
])
1294 insn_lengths
[uid
] = new_length
;
1295 something_changed
= 1;
1298 /* For a non-optimizing compile, do only a single pass. */
1303 free (varying_length
);
1305 #endif /* HAVE_ATTR_length */
1308 #ifdef HAVE_ATTR_length
1309 /* Given the body of an INSN known to be generated by an ASM statement, return
1310 the number of machine instructions likely to be generated for this insn.
1311 This is used to compute its length. */
1314 asm_insn_count (body
)
1320 if (GET_CODE (body
) == ASM_INPUT
)
1321 template = XSTR (body
, 0);
1323 template = decode_asm_operands (body
, NULL_PTR
, NULL_PTR
,
1324 NULL_PTR
, NULL_PTR
);
1326 for ( ; *template; template++)
1327 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
1334 /* Output assembler code for the start of a function,
1335 and initialize some of the variables in this file
1336 for the new function. The label for the function and associated
1337 assembler pseudo-ops have already been output in `assemble_start_function'.
1339 FIRST is the first insn of the rtl for the function being compiled.
1340 FILE is the file to write assembler code to.
1341 OPTIMIZE is nonzero if we should eliminate redundant
1342 test and compare insns. */
1345 final_start_function (first
, file
, optimize
)
1352 this_is_asm_operands
= 0;
1354 #ifdef NON_SAVING_SETJMP
1355 /* A function that calls setjmp should save and restore all the
1356 call-saved registers on a system where longjmp clobbers them. */
1357 if (NON_SAVING_SETJMP
&& current_function_calls_setjmp
)
1361 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
1362 if (!call_used_regs
[i
] && !call_fixed_regs
[i
])
1363 regs_ever_live
[i
] = 1;
1367 /* Initial line number is supposed to be output
1368 before the function's prologue and label
1369 so that the function's address will not appear to be
1370 in the last statement of the preceding function. */
1371 if (NOTE_LINE_NUMBER (first
) != NOTE_INSN_DELETED
)
1372 last_linenum
= high_block_linenum
= high_function_linenum
1373 = NOTE_LINE_NUMBER (first
);
1375 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1376 /* Output DWARF definition of the function. */
1377 if (dwarf2out_do_frame ())
1378 dwarf2out_begin_prologue ();
1381 /* For SDB and XCOFF, the function beginning must be marked between
1382 the function label and the prologue. We always need this, even when
1383 -g1 was used. Defer on MIPS systems so that parameter descriptions
1384 follow function entry. */
1385 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
1386 if (write_symbols
== SDB_DEBUG
)
1387 sdbout_begin_function (last_linenum
);
1390 #ifdef XCOFF_DEBUGGING_INFO
1391 if (write_symbols
== XCOFF_DEBUG
)
1392 xcoffout_begin_function (file
, last_linenum
);
1395 /* But only output line number for other debug info types if -g2
1397 if (NOTE_LINE_NUMBER (first
) != NOTE_INSN_DELETED
)
1398 output_source_line (file
, first
);
1400 #ifdef LEAF_REG_REMAP
1402 leaf_renumber_regs (first
);
1405 /* The Sun386i and perhaps other machines don't work right
1406 if the profiling code comes after the prologue. */
1407 #ifdef PROFILE_BEFORE_PROLOGUE
1409 profile_function (file
);
1410 #endif /* PROFILE_BEFORE_PROLOGUE */
1412 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1413 if (dwarf2out_do_frame ())
1414 dwarf2out_frame_debug (NULL_RTX
);
1417 #ifdef FUNCTION_PROLOGUE
1418 /* First output the function prologue: code to set up the stack frame. */
1419 FUNCTION_PROLOGUE (file
, get_frame_size ());
1422 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1423 if (write_symbols
== SDB_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1424 next_block_index
= 1;
1427 /* If the machine represents the prologue as RTL, the profiling code must
1428 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1429 #ifdef HAVE_prologue
1430 if (! HAVE_prologue
)
1432 profile_after_prologue (file
);
1436 /* If we are doing basic block profiling, remember a printable version
1437 of the function name. */
1438 if (profile_block_flag
)
1441 = add_bb_string ((*decl_printable_name
) (current_function_decl
, 2), FALSE
);
1446 profile_after_prologue (file
)
1449 #ifdef FUNCTION_BLOCK_PROFILER
1450 if (profile_block_flag
)
1452 FUNCTION_BLOCK_PROFILER (file
, count_basic_blocks
);
1454 #endif /* FUNCTION_BLOCK_PROFILER */
1456 #ifndef PROFILE_BEFORE_PROLOGUE
1458 profile_function (file
);
1459 #endif /* not PROFILE_BEFORE_PROLOGUE */
1463 profile_function (file
)
1466 int align
= MIN (BIGGEST_ALIGNMENT
, LONG_TYPE_SIZE
);
1467 #if defined(ASM_OUTPUT_REG_PUSH)
1468 #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1469 int sval
= current_function_returns_struct
;
1471 #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1472 int cxt
= current_function_needs_context
;
1474 #endif /* ASM_OUTPUT_REG_PUSH */
1477 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
1478 ASM_OUTPUT_INTERNAL_LABEL (file
, "LP", profile_label_no
);
1479 assemble_integer (const0_rtx
, LONG_TYPE_SIZE
/ BITS_PER_UNIT
, 1);
1481 function_section (current_function_decl
);
1483 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1485 ASM_OUTPUT_REG_PUSH (file
, STRUCT_VALUE_INCOMING_REGNUM
);
1487 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1490 ASM_OUTPUT_REG_PUSH (file
, STRUCT_VALUE_REGNUM
);
1495 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1497 ASM_OUTPUT_REG_PUSH (file
, STATIC_CHAIN_INCOMING_REGNUM
);
1499 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1502 ASM_OUTPUT_REG_PUSH (file
, STATIC_CHAIN_REGNUM
);
1507 FUNCTION_PROFILER (file
, profile_label_no
);
1509 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1511 ASM_OUTPUT_REG_POP (file
, STATIC_CHAIN_INCOMING_REGNUM
);
1513 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1516 ASM_OUTPUT_REG_POP (file
, STATIC_CHAIN_REGNUM
);
1521 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1523 ASM_OUTPUT_REG_POP (file
, STRUCT_VALUE_INCOMING_REGNUM
);
1525 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1528 ASM_OUTPUT_REG_POP (file
, STRUCT_VALUE_REGNUM
);
1534 /* Output assembler code for the end of a function.
1535 For clarity, args are same as those of `final_start_function'
1536 even though not all of them are needed. */
1539 final_end_function (first
, file
, optimize
)
1546 fputs (ASM_APP_OFF
, file
);
1550 #ifdef SDB_DEBUGGING_INFO
1551 if (write_symbols
== SDB_DEBUG
)
1552 sdbout_end_function (high_function_linenum
);
1555 #ifdef DWARF_DEBUGGING_INFO
1556 if (write_symbols
== DWARF_DEBUG
)
1557 dwarfout_end_function ();
1560 #ifdef XCOFF_DEBUGGING_INFO
1561 if (write_symbols
== XCOFF_DEBUG
)
1562 xcoffout_end_function (file
, high_function_linenum
);
1565 #ifdef FUNCTION_EPILOGUE
1566 /* Finally, output the function epilogue:
1567 code to restore the stack frame and return to the caller. */
1568 FUNCTION_EPILOGUE (file
, get_frame_size ());
1571 #ifdef SDB_DEBUGGING_INFO
1572 if (write_symbols
== SDB_DEBUG
)
1573 sdbout_end_epilogue ();
1576 #ifdef DWARF_DEBUGGING_INFO
1577 if (write_symbols
== DWARF_DEBUG
)
1578 dwarfout_end_epilogue ();
1581 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1582 if (dwarf2out_do_frame ())
1583 dwarf2out_end_epilogue ();
1586 #ifdef XCOFF_DEBUGGING_INFO
1587 if (write_symbols
== XCOFF_DEBUG
)
1588 xcoffout_end_epilogue (file
);
1591 bb_func_label_num
= -1; /* not in function, nuke label # */
1593 /* If FUNCTION_EPILOGUE is not defined, then the function body
1594 itself contains return instructions wherever needed. */
1597 /* Add a block to the linked list that remembers the current line/file/function
1598 for basic block profiling. Emit the label in front of the basic block and
1599 the instructions that increment the count field. */
1605 struct bb_list
*ptr
= (struct bb_list
*) permalloc (sizeof (struct bb_list
));
1607 /* Add basic block to linked list. */
1609 ptr
->line_num
= last_linenum
;
1610 ptr
->file_label_num
= bb_file_label_num
;
1611 ptr
->func_label_num
= bb_func_label_num
;
1613 bb_tail
= &ptr
->next
;
1615 /* Enable the table of basic-block use counts
1616 to point at the code it applies to. */
1617 ASM_OUTPUT_INTERNAL_LABEL (file
, "LPB", count_basic_blocks
);
1619 /* Before first insn of this basic block, increment the
1620 count of times it was entered. */
1621 #ifdef BLOCK_PROFILER
1622 BLOCK_PROFILER (file
, count_basic_blocks
);
1629 count_basic_blocks
++;
1632 /* Add a string to be used for basic block profiling. */
1635 add_bb_string (string
, perm_p
)
1640 struct bb_str
*ptr
= 0;
1644 string
= "<unknown>";
1648 /* Allocate a new string if the current string isn't permanent. If
1649 the string is permanent search for the same string in other
1652 len
= strlen (string
) + 1;
1655 char *p
= (char *) permalloc (len
);
1656 bcopy (string
, p
, len
);
1660 for (ptr
= sbb_head
; ptr
!= (struct bb_str
*) 0; ptr
= ptr
->next
)
1661 if (ptr
->string
== string
)
1664 /* Allocate a new string block if we need to. */
1667 ptr
= (struct bb_str
*) permalloc (sizeof (*ptr
));
1670 ptr
->label_num
= sbb_label_num
++;
1671 ptr
->string
= string
;
1673 sbb_tail
= &ptr
->next
;
1676 return ptr
->label_num
;
1680 /* Output assembler code for some insns: all or part of a function.
1681 For description of args, see `final_start_function', above.
1683 PRESCAN is 1 if we are not really outputting,
1684 just scanning as if we were outputting.
1685 Prescanning deletes and rearranges insns just like ordinary output.
1686 PRESCAN is -2 if we are outputting after having prescanned.
1687 In this case, don't try to delete or rearrange insns
1688 because that has already been done.
1689 Prescanning is done only on certain machines. */
1692 final (first
, file
, optimize
, prescan
)
1701 last_ignored_compare
= 0;
1704 check_exception_handler_labels ();
1706 /* Make a map indicating which line numbers appear in this function.
1707 When producing SDB debugging info, delete troublesome line number
1708 notes from inlined functions in other files as well as duplicate
1709 line number notes. */
1710 #ifdef SDB_DEBUGGING_INFO
1711 if (write_symbols
== SDB_DEBUG
)
1714 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1715 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
1717 if ((RTX_INTEGRATED_P (insn
)
1718 && strcmp (NOTE_SOURCE_FILE (insn
), main_input_filename
) != 0)
1720 && NOTE_LINE_NUMBER (insn
) == NOTE_LINE_NUMBER (last
)
1721 && NOTE_SOURCE_FILE (insn
) == NOTE_SOURCE_FILE (last
)))
1723 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
1724 NOTE_SOURCE_FILE (insn
) = 0;
1728 if (NOTE_LINE_NUMBER (insn
) > max_line
)
1729 max_line
= NOTE_LINE_NUMBER (insn
);
1735 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1736 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > max_line
)
1737 max_line
= NOTE_LINE_NUMBER (insn
);
1740 line_note_exists
= (char *) oballoc (max_line
+ 1);
1741 bzero (line_note_exists
, max_line
+ 1);
1743 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1744 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
1745 line_note_exists
[NOTE_LINE_NUMBER (insn
)] = 1;
1751 /* Output the insns. */
1752 for (insn
= NEXT_INSN (first
); insn
;)
1754 #ifdef HAVE_ATTR_length
1755 insn_current_address
= insn_addresses
[INSN_UID (insn
)];
1757 insn
= final_scan_insn (insn
, file
, optimize
, prescan
, 0);
1760 /* Do basic-block profiling here
1761 if the last insn was a conditional branch. */
1762 if (profile_block_flag
&& new_block
)
1766 /* The final scan for one insn, INSN.
1767 Args are same as in `final', except that INSN
1768 is the insn being scanned.
1769 Value returned is the next insn to be scanned.
1771 NOPEEPHOLES is the flag to disallow peephole processing (currently
1772 used for within delayed branch sequence output). */
1775 final_scan_insn (insn
, file
, optimize
, prescan
, nopeepholes
)
1789 /* Ignore deleted insns. These can occur when we split insns (due to a
1790 template of "#") while not optimizing. */
1791 if (INSN_DELETED_P (insn
))
1792 return NEXT_INSN (insn
);
1794 switch (GET_CODE (insn
))
1800 /* Align the beginning of a loop, for higher speed
1801 on certain machines. */
1803 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_LOOP_BEG
)
1804 break; /* This used to depend on optimize, but that was bogus. */
1805 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_LOOP_END
)
1808 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EH_REGION_BEG
1809 && ! exceptions_via_longjmp
)
1811 ASM_OUTPUT_INTERNAL_LABEL (file
, "LEHB", NOTE_BLOCK_NUMBER (insn
));
1812 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn
));
1813 #ifdef ASM_OUTPUT_EH_REGION_BEG
1814 ASM_OUTPUT_EH_REGION_BEG (file
, NOTE_BLOCK_NUMBER (insn
));
1819 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EH_REGION_END
1820 && ! exceptions_via_longjmp
)
1822 ASM_OUTPUT_INTERNAL_LABEL (file
, "LEHE", NOTE_BLOCK_NUMBER (insn
));
1823 #ifdef ASM_OUTPUT_EH_REGION_END
1824 ASM_OUTPUT_EH_REGION_END (file
, NOTE_BLOCK_NUMBER (insn
));
1829 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_PROLOGUE_END
)
1831 #ifdef FUNCTION_END_PROLOGUE
1832 FUNCTION_END_PROLOGUE (file
);
1834 profile_after_prologue (file
);
1838 #ifdef FUNCTION_BEGIN_EPILOGUE
1839 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EPILOGUE_BEG
)
1841 FUNCTION_BEGIN_EPILOGUE (file
);
1846 if (write_symbols
== NO_DEBUG
)
1848 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_FUNCTION_BEG
)
1850 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
1851 /* MIPS stabs require the parameter descriptions to be after the
1852 function entry point rather than before. */
1853 if (write_symbols
== SDB_DEBUG
)
1854 sdbout_begin_function (last_linenum
);
1857 #ifdef DWARF_DEBUGGING_INFO
1858 /* This outputs a marker where the function body starts, so it
1859 must be after the prologue. */
1860 if (write_symbols
== DWARF_DEBUG
)
1861 dwarfout_begin_function ();
1865 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_DELETED
)
1866 break; /* An insn that was "deleted" */
1869 fputs (ASM_APP_OFF
, file
);
1872 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_BEG
1873 && (debug_info_level
== DINFO_LEVEL_NORMAL
1874 || debug_info_level
== DINFO_LEVEL_VERBOSE
1875 || write_symbols
== DWARF_DEBUG
1876 || write_symbols
== DWARF2_DEBUG
))
1878 /* Beginning of a symbol-block. Assign it a sequence number
1879 and push the number onto the stack PENDING_BLOCKS. */
1881 if (block_depth
== max_block_depth
)
1883 /* PENDING_BLOCKS is full; make it longer. */
1884 max_block_depth
*= 2;
1886 = (int *) xrealloc (pending_blocks
,
1887 max_block_depth
* sizeof (int));
1889 pending_blocks
[block_depth
++] = next_block_index
;
1891 high_block_linenum
= last_linenum
;
1893 /* Output debugging info about the symbol-block beginning. */
1895 #ifdef SDB_DEBUGGING_INFO
1896 if (write_symbols
== SDB_DEBUG
)
1897 sdbout_begin_block (file
, last_linenum
, next_block_index
);
1899 #ifdef XCOFF_DEBUGGING_INFO
1900 if (write_symbols
== XCOFF_DEBUG
)
1901 xcoffout_begin_block (file
, last_linenum
, next_block_index
);
1903 #ifdef DBX_DEBUGGING_INFO
1904 if (write_symbols
== DBX_DEBUG
)
1905 ASM_OUTPUT_INTERNAL_LABEL (file
, "LBB", next_block_index
);
1907 #ifdef DWARF_DEBUGGING_INFO
1908 if (write_symbols
== DWARF_DEBUG
)
1909 dwarfout_begin_block (next_block_index
);
1911 #ifdef DWARF2_DEBUGGING_INFO
1912 if (write_symbols
== DWARF2_DEBUG
)
1913 dwarf2out_begin_block (next_block_index
);
1918 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_END
1919 && (debug_info_level
== DINFO_LEVEL_NORMAL
1920 || debug_info_level
== DINFO_LEVEL_VERBOSE
1921 || write_symbols
== DWARF_DEBUG
1922 || write_symbols
== DWARF2_DEBUG
))
1924 /* End of a symbol-block. Pop its sequence number off
1925 PENDING_BLOCKS and output debugging info based on that. */
1929 #ifdef XCOFF_DEBUGGING_INFO
1930 if (write_symbols
== XCOFF_DEBUG
&& block_depth
>= 0)
1931 xcoffout_end_block (file
, high_block_linenum
,
1932 pending_blocks
[block_depth
]);
1934 #ifdef DBX_DEBUGGING_INFO
1935 if (write_symbols
== DBX_DEBUG
&& block_depth
>= 0)
1936 ASM_OUTPUT_INTERNAL_LABEL (file
, "LBE",
1937 pending_blocks
[block_depth
]);
1939 #ifdef SDB_DEBUGGING_INFO
1940 if (write_symbols
== SDB_DEBUG
&& block_depth
>= 0)
1941 sdbout_end_block (file
, high_block_linenum
,
1942 pending_blocks
[block_depth
]);
1944 #ifdef DWARF_DEBUGGING_INFO
1945 if (write_symbols
== DWARF_DEBUG
&& block_depth
>= 0)
1946 dwarfout_end_block (pending_blocks
[block_depth
]);
1948 #ifdef DWARF2_DEBUGGING_INFO
1949 if (write_symbols
== DWARF2_DEBUG
&& block_depth
>= 0)
1950 dwarf2out_end_block (pending_blocks
[block_depth
]);
1953 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_DELETED_LABEL
1954 && (debug_info_level
== DINFO_LEVEL_NORMAL
1955 || debug_info_level
== DINFO_LEVEL_VERBOSE
))
1957 #ifdef DWARF_DEBUGGING_INFO
1958 if (write_symbols
== DWARF_DEBUG
)
1959 dwarfout_label (insn
);
1961 #ifdef DWARF2_DEBUGGING_INFO
1962 if (write_symbols
== DWARF2_DEBUG
)
1963 dwarf2out_label (insn
);
1966 else if (NOTE_LINE_NUMBER (insn
) > 0)
1967 /* This note is a line-number. */
1971 #if 0 /* This is what we used to do. */
1972 output_source_line (file
, insn
);
1976 /* If there is anything real after this note,
1977 output it. If another line note follows, omit this one. */
1978 for (note
= NEXT_INSN (insn
); note
; note
= NEXT_INSN (note
))
1980 if (GET_CODE (note
) != NOTE
&& GET_CODE (note
) != CODE_LABEL
)
1982 /* These types of notes can be significant
1983 so make sure the preceding line number stays. */
1984 else if (GET_CODE (note
) == NOTE
1985 && (NOTE_LINE_NUMBER (note
) == NOTE_INSN_BLOCK_BEG
1986 || NOTE_LINE_NUMBER (note
) == NOTE_INSN_BLOCK_END
1987 || NOTE_LINE_NUMBER (note
) == NOTE_INSN_FUNCTION_BEG
))
1989 else if (GET_CODE (note
) == NOTE
&& NOTE_LINE_NUMBER (note
) > 0)
1991 /* Another line note follows; we can delete this note
1992 if no intervening line numbers have notes elsewhere. */
1994 for (num
= NOTE_LINE_NUMBER (insn
) + 1;
1995 num
< NOTE_LINE_NUMBER (note
);
1997 if (line_note_exists
[num
])
2000 if (num
>= NOTE_LINE_NUMBER (note
))
2006 /* Output this line note
2007 if it is the first or the last line note in a row. */
2009 output_source_line (file
, insn
);
2014 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2015 /* If we push arguments, we need to check all insns for stack
2017 if (dwarf2out_do_frame ())
2018 dwarf2out_frame_debug (insn
);
2023 if (CODE_LABEL_NUMBER (insn
) <= max_labelno
)
2025 int align
= LABEL_TO_ALIGNMENT (insn
);
2027 /* The target port might emit labels in the output function for
2028 some insn, e.g. sh.c output_branchy_insn. */
2029 if (align
&& NEXT_INSN (insn
)
2030 && CODE_LABEL_NUMBER (insn
) <= max_labelno
)
2031 ASM_OUTPUT_ALIGN (file
, align
);
2038 #ifdef FINAL_PRESCAN_LABEL
2039 FINAL_PRESCAN_INSN (insn
, NULL_PTR
, 0);
2042 #ifdef SDB_DEBUGGING_INFO
2043 if (write_symbols
== SDB_DEBUG
&& LABEL_NAME (insn
))
2044 sdbout_label (insn
);
2046 #ifdef DWARF_DEBUGGING_INFO
2047 if (write_symbols
== DWARF_DEBUG
&& LABEL_NAME (insn
))
2048 dwarfout_label (insn
);
2050 #ifdef DWARF2_DEBUGGING_INFO
2051 if (write_symbols
== DWARF2_DEBUG
&& LABEL_NAME (insn
))
2052 dwarf2out_label (insn
);
2056 fputs (ASM_APP_OFF
, file
);
2059 if (NEXT_INSN (insn
) != 0
2060 && GET_CODE (NEXT_INSN (insn
)) == JUMP_INSN
)
2062 rtx nextbody
= PATTERN (NEXT_INSN (insn
));
2064 /* If this label is followed by a jump-table,
2065 make sure we put the label in the read-only section. Also
2066 possibly write the label and jump table together. */
2068 if (GET_CODE (nextbody
) == ADDR_VEC
2069 || GET_CODE (nextbody
) == ADDR_DIFF_VEC
)
2071 #ifndef JUMP_TABLES_IN_TEXT_SECTION
2072 readonly_data_section ();
2073 #ifdef READONLY_DATA_SECTION
2074 ASM_OUTPUT_ALIGN (file
,
2075 exact_log2 (BIGGEST_ALIGNMENT
2077 #endif /* READONLY_DATA_SECTION */
2078 #else /* JUMP_TABLES_IN_TEXT_SECTION */
2079 function_section (current_function_decl
);
2080 #endif /* JUMP_TABLES_IN_TEXT_SECTION */
2081 #ifdef ASM_OUTPUT_CASE_LABEL
2082 ASM_OUTPUT_CASE_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
),
2085 ASM_OUTPUT_INTERNAL_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
2091 ASM_OUTPUT_INTERNAL_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
2096 register rtx body
= PATTERN (insn
);
2097 int insn_code_number
;
2103 /* An INSN, JUMP_INSN or CALL_INSN.
2104 First check for special kinds that recog doesn't recognize. */
2106 if (GET_CODE (body
) == USE
/* These are just declarations */
2107 || GET_CODE (body
) == CLOBBER
)
2111 /* If there is a REG_CC_SETTER note on this insn, it means that
2112 the setting of the condition code was done in the delay slot
2113 of the insn that branched here. So recover the cc status
2114 from the insn that set it. */
2116 note
= find_reg_note (insn
, REG_CC_SETTER
, NULL_RTX
);
2119 NOTICE_UPDATE_CC (PATTERN (XEXP (note
, 0)), XEXP (note
, 0));
2120 cc_prev_status
= cc_status
;
2124 /* Detect insns that are really jump-tables
2125 and output them as such. */
2127 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
2129 register int vlen
, idx
;
2136 fputs (ASM_APP_OFF
, file
);
2140 vlen
= XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
);
2141 for (idx
= 0; idx
< vlen
; idx
++)
2143 if (GET_CODE (body
) == ADDR_VEC
)
2145 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2146 ASM_OUTPUT_ADDR_VEC_ELT
2147 (file
, CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 0, idx
), 0)));
2154 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2155 ASM_OUTPUT_ADDR_DIFF_ELT
2157 CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 1, idx
), 0)),
2158 CODE_LABEL_NUMBER (XEXP (XEXP (body
, 0), 0)));
2164 #ifdef ASM_OUTPUT_CASE_END
2165 ASM_OUTPUT_CASE_END (file
,
2166 CODE_LABEL_NUMBER (PREV_INSN (insn
)),
2170 function_section (current_function_decl
);
2175 /* Do basic-block profiling when we reach a new block.
2176 Done here to avoid jump tables. */
2177 if (profile_block_flag
&& new_block
)
2180 if (GET_CODE (body
) == ASM_INPUT
)
2182 /* There's no telling what that did to the condition codes. */
2188 fputs (ASM_APP_ON
, file
);
2191 fprintf (asm_out_file
, "\t%s\n", XSTR (body
, 0));
2195 /* Detect `asm' construct with operands. */
2196 if (asm_noperands (body
) >= 0)
2198 int noperands
= asm_noperands (body
);
2199 rtx
*ops
= (rtx
*) alloca (noperands
* sizeof (rtx
));
2202 /* There's no telling what that did to the condition codes. */
2209 fputs (ASM_APP_ON
, file
);
2213 /* Get out the operand values. */
2214 string
= decode_asm_operands (body
, ops
, NULL_PTR
,
2215 NULL_PTR
, NULL_PTR
);
2216 /* Inhibit aborts on what would otherwise be compiler bugs. */
2217 insn_noperands
= noperands
;
2218 this_is_asm_operands
= insn
;
2220 /* Output the insn using them. */
2221 output_asm_insn (string
, ops
);
2222 this_is_asm_operands
= 0;
2226 if (prescan
<= 0 && app_on
)
2228 fputs (ASM_APP_OFF
, file
);
2232 if (GET_CODE (body
) == SEQUENCE
)
2234 /* A delayed-branch sequence */
2240 final_sequence
= body
;
2242 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2243 force the restoration of a comparison that was previously
2244 thought unnecessary. If that happens, cancel this sequence
2245 and cause that insn to be restored. */
2247 next
= final_scan_insn (XVECEXP (body
, 0, 0), file
, 0, prescan
, 1);
2248 if (next
!= XVECEXP (body
, 0, 1))
2254 for (i
= 1; i
< XVECLEN (body
, 0); i
++)
2256 rtx insn
= XVECEXP (body
, 0, i
);
2257 rtx next
= NEXT_INSN (insn
);
2258 /* We loop in case any instruction in a delay slot gets
2261 insn
= final_scan_insn (insn
, file
, 0, prescan
, 1);
2262 while (insn
!= next
);
2264 #ifdef DBR_OUTPUT_SEQEND
2265 DBR_OUTPUT_SEQEND (file
);
2269 /* If the insn requiring the delay slot was a CALL_INSN, the
2270 insns in the delay slot are actually executed before the
2271 called function. Hence we don't preserve any CC-setting
2272 actions in these insns and the CC must be marked as being
2273 clobbered by the function. */
2274 if (GET_CODE (XVECEXP (body
, 0, 0)) == CALL_INSN
)
2279 /* Following a conditional branch sequence, we have a new basic
2281 if (profile_block_flag
)
2283 rtx insn
= XVECEXP (body
, 0, 0);
2284 rtx body
= PATTERN (insn
);
2286 if ((GET_CODE (insn
) == JUMP_INSN
&& GET_CODE (body
) == SET
2287 && GET_CODE (SET_SRC (body
)) != LABEL_REF
)
2288 || (GET_CODE (insn
) == JUMP_INSN
2289 && GET_CODE (body
) == PARALLEL
2290 && GET_CODE (XVECEXP (body
, 0, 0)) == SET
2291 && GET_CODE (SET_SRC (XVECEXP (body
, 0, 0))) != LABEL_REF
))
2297 /* We have a real machine instruction as rtl. */
2299 body
= PATTERN (insn
);
2302 set
= single_set(insn
);
2304 /* Check for redundant test and compare instructions
2305 (when the condition codes are already set up as desired).
2306 This is done only when optimizing; if not optimizing,
2307 it should be possible for the user to alter a variable
2308 with the debugger in between statements
2309 and the next statement should reexamine the variable
2310 to compute the condition codes. */
2315 rtx set
= single_set(insn
);
2319 && GET_CODE (SET_DEST (set
)) == CC0
2320 && insn
!= last_ignored_compare
)
2322 if (GET_CODE (SET_SRC (set
)) == SUBREG
)
2323 SET_SRC (set
) = alter_subreg (SET_SRC (set
));
2324 else if (GET_CODE (SET_SRC (set
)) == COMPARE
)
2326 if (GET_CODE (XEXP (SET_SRC (set
), 0)) == SUBREG
)
2327 XEXP (SET_SRC (set
), 0)
2328 = alter_subreg (XEXP (SET_SRC (set
), 0));
2329 if (GET_CODE (XEXP (SET_SRC (set
), 1)) == SUBREG
)
2330 XEXP (SET_SRC (set
), 1)
2331 = alter_subreg (XEXP (SET_SRC (set
), 1));
2333 if ((cc_status
.value1
!= 0
2334 && rtx_equal_p (SET_SRC (set
), cc_status
.value1
))
2335 || (cc_status
.value2
!= 0
2336 && rtx_equal_p (SET_SRC (set
), cc_status
.value2
)))
2338 /* Don't delete insn if it has an addressing side-effect. */
2339 if (! FIND_REG_INC_NOTE (insn
, 0)
2340 /* or if anything in it is volatile. */
2341 && ! volatile_refs_p (PATTERN (insn
)))
2343 /* We don't really delete the insn; just ignore it. */
2344 last_ignored_compare
= insn
;
2352 /* Following a conditional branch, we have a new basic block.
2353 But if we are inside a sequence, the new block starts after the
2354 last insn of the sequence. */
2355 if (profile_block_flag
&& final_sequence
== 0
2356 && ((GET_CODE (insn
) == JUMP_INSN
&& GET_CODE (body
) == SET
2357 && GET_CODE (SET_SRC (body
)) != LABEL_REF
)
2358 || (GET_CODE (insn
) == JUMP_INSN
&& GET_CODE (body
) == PARALLEL
2359 && GET_CODE (XVECEXP (body
, 0, 0)) == SET
2360 && GET_CODE (SET_SRC (XVECEXP (body
, 0, 0))) != LABEL_REF
)))
2364 /* Don't bother outputting obvious no-ops, even without -O.
2365 This optimization is fast and doesn't interfere with debugging.
2366 Don't do this if the insn is in a delay slot, since this
2367 will cause an improper number of delay insns to be written. */
2368 if (final_sequence
== 0
2370 && GET_CODE (insn
) == INSN
&& GET_CODE (body
) == SET
2371 && GET_CODE (SET_SRC (body
)) == REG
2372 && GET_CODE (SET_DEST (body
)) == REG
2373 && REGNO (SET_SRC (body
)) == REGNO (SET_DEST (body
)))
2378 /* If this is a conditional branch, maybe modify it
2379 if the cc's are in a nonstandard state
2380 so that it accomplishes the same thing that it would
2381 do straightforwardly if the cc's were set up normally. */
2383 if (cc_status
.flags
!= 0
2384 && GET_CODE (insn
) == JUMP_INSN
2385 && GET_CODE (body
) == SET
2386 && SET_DEST (body
) == pc_rtx
2387 && GET_CODE (SET_SRC (body
)) == IF_THEN_ELSE
2388 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body
), 0))) == '<'
2389 && XEXP (XEXP (SET_SRC (body
), 0), 0) == cc0_rtx
2390 /* This is done during prescan; it is not done again
2391 in final scan when prescan has been done. */
2394 /* This function may alter the contents of its argument
2395 and clear some of the cc_status.flags bits.
2396 It may also return 1 meaning condition now always true
2397 or -1 meaning condition now always false
2398 or 2 meaning condition nontrivial but altered. */
2399 register int result
= alter_cond (XEXP (SET_SRC (body
), 0));
2400 /* If condition now has fixed value, replace the IF_THEN_ELSE
2401 with its then-operand or its else-operand. */
2403 SET_SRC (body
) = XEXP (SET_SRC (body
), 1);
2405 SET_SRC (body
) = XEXP (SET_SRC (body
), 2);
2407 /* The jump is now either unconditional or a no-op.
2408 If it has become a no-op, don't try to output it.
2409 (It would not be recognized.) */
2410 if (SET_SRC (body
) == pc_rtx
)
2412 PUT_CODE (insn
, NOTE
);
2413 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
2414 NOTE_SOURCE_FILE (insn
) = 0;
2417 else if (GET_CODE (SET_SRC (body
)) == RETURN
)
2418 /* Replace (set (pc) (return)) with (return). */
2419 PATTERN (insn
) = body
= SET_SRC (body
);
2421 /* Rerecognize the instruction if it has changed. */
2423 INSN_CODE (insn
) = -1;
2426 /* Make same adjustments to instructions that examine the
2427 condition codes without jumping and instructions that
2428 handle conditional moves (if this machine has either one). */
2430 if (cc_status
.flags
!= 0
2433 rtx cond_rtx
, then_rtx
, else_rtx
;
2435 if (GET_CODE (insn
) != JUMP_INSN
2436 && GET_CODE (SET_SRC (set
)) == IF_THEN_ELSE
)
2438 cond_rtx
= XEXP (SET_SRC (set
), 0);
2439 then_rtx
= XEXP (SET_SRC (set
), 1);
2440 else_rtx
= XEXP (SET_SRC (set
), 2);
2444 cond_rtx
= SET_SRC (set
);
2445 then_rtx
= const_true_rtx
;
2446 else_rtx
= const0_rtx
;
2449 switch (GET_CODE (cond_rtx
))
2462 register int result
;
2463 if (XEXP (cond_rtx
, 0) != cc0_rtx
)
2465 result
= alter_cond (cond_rtx
);
2467 validate_change (insn
, &SET_SRC (set
), then_rtx
, 0);
2468 else if (result
== -1)
2469 validate_change (insn
, &SET_SRC (set
), else_rtx
, 0);
2470 else if (result
== 2)
2471 INSN_CODE (insn
) = -1;
2472 if (SET_DEST (set
) == SET_SRC (set
))
2474 PUT_CODE (insn
, NOTE
);
2475 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
2476 NOTE_SOURCE_FILE (insn
) = 0;
2488 /* Do machine-specific peephole optimizations if desired. */
2490 if (optimize
&& !flag_no_peephole
&& !nopeepholes
)
2492 rtx next
= peephole (insn
);
2493 /* When peepholing, if there were notes within the peephole,
2494 emit them before the peephole. */
2495 if (next
!= 0 && next
!= NEXT_INSN (insn
))
2497 rtx prev
= PREV_INSN (insn
);
2500 for (note
= NEXT_INSN (insn
); note
!= next
;
2501 note
= NEXT_INSN (note
))
2502 final_scan_insn (note
, file
, optimize
, prescan
, nopeepholes
);
2504 /* In case this is prescan, put the notes
2505 in proper position for later rescan. */
2506 note
= NEXT_INSN (insn
);
2507 PREV_INSN (note
) = prev
;
2508 NEXT_INSN (prev
) = note
;
2509 NEXT_INSN (PREV_INSN (next
)) = insn
;
2510 PREV_INSN (insn
) = PREV_INSN (next
);
2511 NEXT_INSN (insn
) = next
;
2512 PREV_INSN (next
) = insn
;
2515 /* PEEPHOLE might have changed this. */
2516 body
= PATTERN (insn
);
2519 /* Try to recognize the instruction.
2520 If successful, verify that the operands satisfy the
2521 constraints for the instruction. Crash if they don't,
2522 since `reload' should have changed them so that they do. */
2524 insn_code_number
= recog_memoized (insn
);
2525 insn_extract (insn
);
2526 for (i
= 0; i
< insn_n_operands
[insn_code_number
]; i
++)
2528 if (GET_CODE (recog_operand
[i
]) == SUBREG
)
2529 recog_operand
[i
] = alter_subreg (recog_operand
[i
]);
2530 else if (GET_CODE (recog_operand
[i
]) == PLUS
2531 || GET_CODE (recog_operand
[i
]) == MULT
)
2532 recog_operand
[i
] = walk_alter_subreg (recog_operand
[i
]);
2535 for (i
= 0; i
< insn_n_dups
[insn_code_number
]; i
++)
2537 if (GET_CODE (*recog_dup_loc
[i
]) == SUBREG
)
2538 *recog_dup_loc
[i
] = alter_subreg (*recog_dup_loc
[i
]);
2539 else if (GET_CODE (*recog_dup_loc
[i
]) == PLUS
2540 || GET_CODE (*recog_dup_loc
[i
]) == MULT
)
2541 *recog_dup_loc
[i
] = walk_alter_subreg (*recog_dup_loc
[i
]);
2544 #ifdef REGISTER_CONSTRAINTS
2545 if (! constrain_operands (insn_code_number
, 1))
2546 fatal_insn_not_found (insn
);
2549 /* Some target machines need to prescan each insn before
2552 #ifdef FINAL_PRESCAN_INSN
2553 FINAL_PRESCAN_INSN (insn
, recog_operand
,
2554 insn_n_operands
[insn_code_number
]);
2558 cc_prev_status
= cc_status
;
2560 /* Update `cc_status' for this instruction.
2561 The instruction's output routine may change it further.
2562 If the output routine for a jump insn needs to depend
2563 on the cc status, it should look at cc_prev_status. */
2565 NOTICE_UPDATE_CC (body
, insn
);
2570 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2571 /* If we push arguments, we want to know where the calls are. */
2572 if (GET_CODE (insn
) == CALL_INSN
&& dwarf2out_do_frame ())
2573 dwarf2out_frame_debug (insn
);
2576 /* If the proper template needs to be chosen by some C code,
2577 run that code and get the real template. */
2579 template = insn_template
[insn_code_number
];
2582 template = (*insn_outfun
[insn_code_number
]) (recog_operand
, insn
);
2584 /* If the C code returns 0, it means that it is a jump insn
2585 which follows a deleted test insn, and that test insn
2586 needs to be reinserted. */
2589 if (prev_nonnote_insn (insn
) != last_ignored_compare
)
2592 return prev_nonnote_insn (insn
);
2596 /* If the template is the string "#", it means that this insn must
2598 if (template[0] == '#' && template[1] == '\0')
2600 rtx
new = try_split (body
, insn
, 0);
2602 /* If we didn't split the insn, go away. */
2603 if (new == insn
&& PATTERN (new) == body
)
2606 #ifdef HAVE_ATTR_length
2607 /* This instruction should have been split in shorten_branches,
2608 to ensure that we would have valid length info for the
2620 /* Output assembler code from the template. */
2622 output_asm_insn (template, recog_operand
);
2624 #if defined (DWARF2_UNWIND_INFO)
2625 #if !defined (ACCUMULATE_OUTGOING_ARGS)
2626 /* If we push arguments, we need to check all insns for stack
2628 if (GET_CODE (insn
) == INSN
&& dwarf2out_do_frame ())
2629 dwarf2out_frame_debug (insn
);
2631 #if defined (HAVE_prologue)
2632 /* If this insn is part of the prologue, emit DWARF v2
2634 if (RTX_FRAME_RELATED_P (insn
) && dwarf2out_do_frame ())
2635 dwarf2out_frame_debug (insn
);
2641 /* It's not at all clear why we did this and doing so interferes
2642 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2645 /* Mark this insn as having been output. */
2646 INSN_DELETED_P (insn
) = 1;
2652 return NEXT_INSN (insn
);
2655 /* Output debugging info to the assembler file FILE
2656 based on the NOTE-insn INSN, assumed to be a line number. */
2659 output_source_line (file
, insn
)
2663 register char *filename
= NOTE_SOURCE_FILE (insn
);
2665 /* Remember filename for basic block profiling.
2666 Filenames are allocated on the permanent obstack
2667 or are passed in ARGV, so we don't have to save
2670 if (profile_block_flag
&& last_filename
!= filename
)
2671 bb_file_label_num
= add_bb_string (filename
, TRUE
);
2673 last_filename
= filename
;
2674 last_linenum
= NOTE_LINE_NUMBER (insn
);
2675 high_block_linenum
= MAX (last_linenum
, high_block_linenum
);
2676 high_function_linenum
= MAX (last_linenum
, high_function_linenum
);
2678 if (write_symbols
!= NO_DEBUG
)
2680 #ifdef SDB_DEBUGGING_INFO
2681 if (write_symbols
== SDB_DEBUG
2682 #if 0 /* People like having line numbers even in wrong file! */
2683 /* COFF can't handle multiple source files--lose, lose. */
2684 && !strcmp (filename
, main_input_filename
)
2686 /* COFF relative line numbers must be positive. */
2687 && last_linenum
> sdb_begin_function_line
)
2689 #ifdef ASM_OUTPUT_SOURCE_LINE
2690 ASM_OUTPUT_SOURCE_LINE (file
, last_linenum
);
2692 fprintf (file
, "\t.ln\t%d\n",
2693 ((sdb_begin_function_line
> -1)
2694 ? last_linenum
- sdb_begin_function_line
: 1));
2699 #if defined (DBX_DEBUGGING_INFO)
2700 if (write_symbols
== DBX_DEBUG
)
2701 dbxout_source_line (file
, filename
, NOTE_LINE_NUMBER (insn
));
2704 #if defined (XCOFF_DEBUGGING_INFO)
2705 if (write_symbols
== XCOFF_DEBUG
)
2706 xcoffout_source_line (file
, filename
, insn
);
2709 #ifdef DWARF_DEBUGGING_INFO
2710 if (write_symbols
== DWARF_DEBUG
)
2711 dwarfout_line (filename
, NOTE_LINE_NUMBER (insn
));
2714 #ifdef DWARF2_DEBUGGING_INFO
2715 if (write_symbols
== DWARF2_DEBUG
)
2716 dwarf2out_line (filename
, NOTE_LINE_NUMBER (insn
));
2721 /* If X is a SUBREG, replace it with a REG or a MEM,
2722 based on the thing it is a subreg of. */
2728 register rtx y
= SUBREG_REG (x
);
2729 if (GET_CODE (y
) == SUBREG
)
2730 y
= alter_subreg (y
);
2732 if (GET_CODE (y
) == REG
)
2734 /* If the containing reg really gets a hard reg, so do we. */
2736 REGNO (x
) = REGNO (y
) + SUBREG_WORD (x
);
2738 else if (GET_CODE (y
) == MEM
)
2740 register int offset
= SUBREG_WORD (x
) * UNITS_PER_WORD
;
2741 if (BYTES_BIG_ENDIAN
)
2742 offset
-= (MIN (UNITS_PER_WORD
, GET_MODE_SIZE (GET_MODE (x
)))
2743 - MIN (UNITS_PER_WORD
, GET_MODE_SIZE (GET_MODE (y
))));
2745 MEM_VOLATILE_P (x
) = MEM_VOLATILE_P (y
);
2746 XEXP (x
, 0) = plus_constant (XEXP (y
, 0), offset
);
2752 /* Do alter_subreg on all the SUBREGs contained in X. */
2755 walk_alter_subreg (x
)
2758 switch (GET_CODE (x
))
2762 XEXP (x
, 0) = walk_alter_subreg (XEXP (x
, 0));
2763 XEXP (x
, 1) = walk_alter_subreg (XEXP (x
, 1));
2767 XEXP (x
, 0) = walk_alter_subreg (XEXP (x
, 0));
2771 return alter_subreg (x
);
2782 /* Given BODY, the body of a jump instruction, alter the jump condition
2783 as required by the bits that are set in cc_status.flags.
2784 Not all of the bits there can be handled at this level in all cases.
2786 The value is normally 0.
2787 1 means that the condition has become always true.
2788 -1 means that the condition has become always false.
2789 2 means that COND has been altered. */
2797 if (cc_status
.flags
& CC_REVERSED
)
2800 PUT_CODE (cond
, swap_condition (GET_CODE (cond
)));
2803 if (cc_status
.flags
& CC_INVERTED
)
2806 PUT_CODE (cond
, reverse_condition (GET_CODE (cond
)));
2809 if (cc_status
.flags
& CC_NOT_POSITIVE
)
2810 switch (GET_CODE (cond
))
2815 /* Jump becomes unconditional. */
2821 /* Jump becomes no-op. */
2825 PUT_CODE (cond
, EQ
);
2830 PUT_CODE (cond
, NE
);
2838 if (cc_status
.flags
& CC_NOT_NEGATIVE
)
2839 switch (GET_CODE (cond
))
2843 /* Jump becomes unconditional. */
2848 /* Jump becomes no-op. */
2853 PUT_CODE (cond
, EQ
);
2859 PUT_CODE (cond
, NE
);
2867 if (cc_status
.flags
& CC_NO_OVERFLOW
)
2868 switch (GET_CODE (cond
))
2871 /* Jump becomes unconditional. */
2875 PUT_CODE (cond
, EQ
);
2880 PUT_CODE (cond
, NE
);
2885 /* Jump becomes no-op. */
2892 if (cc_status
.flags
& (CC_Z_IN_NOT_N
| CC_Z_IN_N
))
2893 switch (GET_CODE (cond
))
2899 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? GE
: LT
);
2904 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? LT
: GE
);
2909 if (cc_status
.flags
& CC_NOT_SIGNED
)
2910 /* The flags are valid if signed condition operators are converted
2912 switch (GET_CODE (cond
))
2915 PUT_CODE (cond
, LEU
);
2920 PUT_CODE (cond
, LTU
);
2925 PUT_CODE (cond
, GTU
);
2930 PUT_CODE (cond
, GEU
);
2942 /* Report inconsistency between the assembler template and the operands.
2943 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
2946 output_operand_lossage (str
)
2949 if (this_is_asm_operands
)
2950 error_for_asm (this_is_asm_operands
, "invalid `asm': %s", str
);
2955 /* Output of assembler code from a template, and its subroutines. */
2957 /* Output text from TEMPLATE to the assembler output file,
2958 obeying %-directions to substitute operands taken from
2959 the vector OPERANDS.
2961 %N (for N a digit) means print operand N in usual manner.
2962 %lN means require operand N to be a CODE_LABEL or LABEL_REF
2963 and print the label name with no punctuation.
2964 %cN means require operand N to be a constant
2965 and print the constant expression with no punctuation.
2966 %aN means expect operand N to be a memory address
2967 (not a memory reference!) and print a reference
2969 %nN means expect operand N to be a constant
2970 and print a constant expression for minus the value
2971 of the operand, with no other punctuation. */
2976 if (flag_print_asm_name
)
2978 /* Annotate the assembly with a comment describing the pattern and
2979 alternative used. */
2982 register int num
= INSN_CODE (debug_insn
);
2983 fprintf (asm_out_file
, " %s %d %s",
2984 ASM_COMMENT_START
, INSN_UID (debug_insn
), insn_name
[num
]);
2985 if (insn_n_alternatives
[num
] > 1)
2986 fprintf (asm_out_file
, "/%d", which_alternative
+ 1);
2988 /* Clear this so only the first assembler insn
2989 of any rtl insn will get the special comment for -dp. */
2996 output_asm_insn (template, operands
)
3003 /* An insn may return a null string template
3004 in a case where no assembler code is needed. */
3009 putc ('\t', asm_out_file
);
3011 #ifdef ASM_OUTPUT_OPCODE
3012 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3020 putc (c
, asm_out_file
);
3021 #ifdef ASM_OUTPUT_OPCODE
3022 while ((c
= *p
) == '\t')
3024 putc (c
, asm_out_file
);
3027 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3031 #ifdef ASSEMBLER_DIALECT
3036 /* If we want the first dialect, do nothing. Otherwise, skip
3037 DIALECT_NUMBER of strings ending with '|'. */
3038 for (i
= 0; i
< dialect_number
; i
++)
3040 while (*p
&& *p
++ != '|')
3050 /* Skip to close brace. */
3051 while (*p
&& *p
++ != '}')
3060 /* %% outputs a single %. */
3064 putc (c
, asm_out_file
);
3066 /* %= outputs a number which is unique to each insn in the entire
3067 compilation. This is useful for making local labels that are
3068 referred to more than once in a given insn. */
3072 fprintf (asm_out_file
, "%d", insn_counter
);
3074 /* % followed by a letter and some digits
3075 outputs an operand in a special way depending on the letter.
3076 Letters `acln' are implemented directly.
3077 Other letters are passed to `output_operand' so that
3078 the PRINT_OPERAND macro can define them. */
3079 else if ((*p
>= 'a' && *p
<= 'z')
3080 || (*p
>= 'A' && *p
<= 'Z'))
3085 if (! (*p
>= '0' && *p
<= '9'))
3086 output_operand_lossage ("operand number missing after %-letter");
3087 else if (this_is_asm_operands
&& c
>= (unsigned) insn_noperands
)
3088 output_operand_lossage ("operand number out of range");
3089 else if (letter
== 'l')
3090 output_asm_label (operands
[c
]);
3091 else if (letter
== 'a')
3092 output_address (operands
[c
]);
3093 else if (letter
== 'c')
3095 if (CONSTANT_ADDRESS_P (operands
[c
]))
3096 output_addr_const (asm_out_file
, operands
[c
]);
3098 output_operand (operands
[c
], 'c');
3100 else if (letter
== 'n')
3102 if (GET_CODE (operands
[c
]) == CONST_INT
)
3103 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
,
3104 - INTVAL (operands
[c
]));
3107 putc ('-', asm_out_file
);
3108 output_addr_const (asm_out_file
, operands
[c
]);
3112 output_operand (operands
[c
], letter
);
3114 while ((c
= *p
) >= '0' && c
<= '9') p
++;
3116 /* % followed by a digit outputs an operand the default way. */
3117 else if (*p
>= '0' && *p
<= '9')
3120 if (this_is_asm_operands
&& c
>= (unsigned) insn_noperands
)
3121 output_operand_lossage ("operand number out of range");
3123 output_operand (operands
[c
], 0);
3124 while ((c
= *p
) >= '0' && c
<= '9') p
++;
3126 /* % followed by punctuation: output something for that
3127 punctuation character alone, with no operand.
3128 The PRINT_OPERAND macro decides what is actually done. */
3129 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3130 else if (PRINT_OPERAND_PUNCT_VALID_P (*p
))
3131 output_operand (NULL_RTX
, *p
++);
3134 output_operand_lossage ("invalid %%-code");
3138 putc (c
, asm_out_file
);
3143 putc ('\n', asm_out_file
);
3146 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3149 output_asm_label (x
)
3154 if (GET_CODE (x
) == LABEL_REF
)
3155 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (XEXP (x
, 0)));
3156 else if (GET_CODE (x
) == CODE_LABEL
)
3157 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3159 output_operand_lossage ("`%l' operand isn't a label");
3161 assemble_name (asm_out_file
, buf
);
3164 /* Print operand X using machine-dependent assembler syntax.
3165 The macro PRINT_OPERAND is defined just to control this function.
3166 CODE is a non-digit that preceded the operand-number in the % spec,
3167 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3168 between the % and the digits.
3169 When CODE is a non-letter, X is 0.
3171 The meanings of the letters are machine-dependent and controlled
3172 by PRINT_OPERAND. */
3175 output_operand (x
, code
)
3179 if (x
&& GET_CODE (x
) == SUBREG
)
3180 x
= alter_subreg (x
);
3182 /* If X is a pseudo-register, abort now rather than writing trash to the
3185 if (x
&& GET_CODE (x
) == REG
&& REGNO (x
) >= FIRST_PSEUDO_REGISTER
)
3188 PRINT_OPERAND (asm_out_file
, x
, code
);
3191 /* Print a memory reference operand for address X
3192 using machine-dependent assembler syntax.
3193 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3199 walk_alter_subreg (x
);
3200 PRINT_OPERAND_ADDRESS (asm_out_file
, x
);
3203 /* Print an integer constant expression in assembler syntax.
3204 Addition and subtraction are the only arithmetic
3205 that may appear in these expressions. */
3208 output_addr_const (file
, x
)
3215 switch (GET_CODE (x
))
3225 assemble_name (file
, XSTR (x
, 0));
3229 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (XEXP (x
, 0)));
3230 assemble_name (file
, buf
);
3234 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3235 assemble_name (file
, buf
);
3239 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, INTVAL (x
));
3243 /* This used to output parentheses around the expression,
3244 but that does not work on the 386 (either ATT or BSD assembler). */
3245 output_addr_const (file
, XEXP (x
, 0));
3249 if (GET_MODE (x
) == VOIDmode
)
3251 /* We can use %d if the number is one word and positive. */
3252 if (CONST_DOUBLE_HIGH (x
))
3253 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
3254 CONST_DOUBLE_HIGH (x
), CONST_DOUBLE_LOW (x
));
3255 else if (CONST_DOUBLE_LOW (x
) < 0)
3256 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
, CONST_DOUBLE_LOW (x
));
3258 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_DOUBLE_LOW (x
));
3261 /* We can't handle floating point constants;
3262 PRINT_OPERAND must handle them. */
3263 output_operand_lossage ("floating constant misused");
3267 /* Some assemblers need integer constants to appear last (eg masm). */
3268 if (GET_CODE (XEXP (x
, 0)) == CONST_INT
)
3270 output_addr_const (file
, XEXP (x
, 1));
3271 if (INTVAL (XEXP (x
, 0)) >= 0)
3272 fprintf (file
, "+");
3273 output_addr_const (file
, XEXP (x
, 0));
3277 output_addr_const (file
, XEXP (x
, 0));
3278 if (INTVAL (XEXP (x
, 1)) >= 0)
3279 fprintf (file
, "+");
3280 output_addr_const (file
, XEXP (x
, 1));
3285 /* Avoid outputting things like x-x or x+5-x,
3286 since some assemblers can't handle that. */
3287 x
= simplify_subtraction (x
);
3288 if (GET_CODE (x
) != MINUS
)
3291 output_addr_const (file
, XEXP (x
, 0));
3292 fprintf (file
, "-");
3293 if (GET_CODE (XEXP (x
, 1)) == CONST_INT
3294 && INTVAL (XEXP (x
, 1)) < 0)
3296 fprintf (file
, ASM_OPEN_PAREN
);
3297 output_addr_const (file
, XEXP (x
, 1));
3298 fprintf (file
, ASM_CLOSE_PAREN
);
3301 output_addr_const (file
, XEXP (x
, 1));
3306 output_addr_const (file
, XEXP (x
, 0));
3310 output_operand_lossage ("invalid expression as operand");
3314 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3315 %R prints the value of REGISTER_PREFIX.
3316 %L prints the value of LOCAL_LABEL_PREFIX.
3317 %U prints the value of USER_LABEL_PREFIX.
3318 %I prints the value of IMMEDIATE_PREFIX.
3319 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3320 Also supported are %d, %x, %s, %e, %f, %g and %%.
3322 We handle alternate assembler dialects here, just like output_asm_insn. */
3325 asm_fprintf
VPROTO((FILE *file
, char *p
, ...))
3335 VA_START (argptr
, p
);
3338 file
= va_arg (argptr
, FILE *);
3339 p
= va_arg (argptr
, char *);
3347 #ifdef ASSEMBLER_DIALECT
3352 /* If we want the first dialect, do nothing. Otherwise, skip
3353 DIALECT_NUMBER of strings ending with '|'. */
3354 for (i
= 0; i
< dialect_number
; i
++)
3356 while (*p
&& *p
++ != '|')
3366 /* Skip to close brace. */
3367 while (*p
&& *p
++ != '}')
3378 while ((c
>= '0' && c
<= '9') || c
== '.')
3386 fprintf (file
, "%%");
3389 case 'd': case 'i': case 'u':
3390 case 'x': case 'p': case 'X':
3394 fprintf (file
, buf
, va_arg (argptr
, int));
3398 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3399 but we do not check for those cases. It means that the value
3400 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3402 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3404 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3414 fprintf (file
, buf
, va_arg (argptr
, HOST_WIDE_INT
));
3421 fprintf (file
, buf
, va_arg (argptr
, long));
3429 fprintf (file
, buf
, va_arg (argptr
, double));
3435 fprintf (file
, buf
, va_arg (argptr
, char *));
3439 #ifdef ASM_OUTPUT_OPCODE
3440 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3445 #ifdef REGISTER_PREFIX
3446 fprintf (file
, "%s", REGISTER_PREFIX
);
3451 #ifdef IMMEDIATE_PREFIX
3452 fprintf (file
, "%s", IMMEDIATE_PREFIX
);
3457 #ifdef LOCAL_LABEL_PREFIX
3458 fprintf (file
, "%s", LOCAL_LABEL_PREFIX
);
3463 #ifdef USER_LABEL_PREFIX
3464 fprintf (file
, "%s", USER_LABEL_PREFIX
);
3478 /* Split up a CONST_DOUBLE or integer constant rtx
3479 into two rtx's for single words,
3480 storing in *FIRST the word that comes first in memory in the target
3481 and in *SECOND the other. */
3484 split_double (value
, first
, second
)
3486 rtx
*first
, *second
;
3488 if (GET_CODE (value
) == CONST_INT
)
3490 if (HOST_BITS_PER_WIDE_INT
>= (2 * BITS_PER_WORD
))
3492 /* In this case the CONST_INT holds both target words.
3493 Extract the bits from it into two word-sized pieces. */
3495 HOST_WIDE_INT word_mask
;
3496 /* Avoid warnings for shift count >= BITS_PER_WORD. */
3497 int shift_count
= BITS_PER_WORD
- 1;
3499 word_mask
= (HOST_WIDE_INT
) 1 << shift_count
;
3500 word_mask
|= word_mask
- 1;
3501 low
= GEN_INT (INTVAL (value
) & word_mask
);
3502 high
= GEN_INT ((INTVAL (value
) >> (shift_count
+ 1)) & word_mask
);
3503 if (WORDS_BIG_ENDIAN
)
3516 /* The rule for using CONST_INT for a wider mode
3517 is that we regard the value as signed.
3518 So sign-extend it. */
3519 rtx high
= (INTVAL (value
) < 0 ? constm1_rtx
: const0_rtx
);
3520 if (WORDS_BIG_ENDIAN
)
3532 else if (GET_CODE (value
) != CONST_DOUBLE
)
3534 if (WORDS_BIG_ENDIAN
)
3536 *first
= const0_rtx
;
3542 *second
= const0_rtx
;
3545 else if (GET_MODE (value
) == VOIDmode
3546 /* This is the old way we did CONST_DOUBLE integers. */
3547 || GET_MODE_CLASS (GET_MODE (value
)) == MODE_INT
)
3549 /* In an integer, the words are defined as most and least significant.
3550 So order them by the target's convention. */
3551 if (WORDS_BIG_ENDIAN
)
3553 *first
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3554 *second
= GEN_INT (CONST_DOUBLE_LOW (value
));
3558 *first
= GEN_INT (CONST_DOUBLE_LOW (value
));
3559 *second
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3564 #ifdef REAL_ARITHMETIC
3565 REAL_VALUE_TYPE r
; long l
[2];
3566 REAL_VALUE_FROM_CONST_DOUBLE (r
, value
);
3568 /* Note, this converts the REAL_VALUE_TYPE to the target's
3569 format, splits up the floating point double and outputs
3570 exactly 32 bits of it into each of l[0] and l[1] --
3571 not necessarily BITS_PER_WORD bits. */
3572 REAL_VALUE_TO_TARGET_DOUBLE (r
, l
);
3574 *first
= GEN_INT ((HOST_WIDE_INT
) l
[0]);
3575 *second
= GEN_INT ((HOST_WIDE_INT
) l
[1]);
3577 if ((HOST_FLOAT_FORMAT
!= TARGET_FLOAT_FORMAT
3578 || HOST_BITS_PER_WIDE_INT
!= BITS_PER_WORD
)
3579 && ! flag_pretend_float
)
3583 #ifdef HOST_WORDS_BIG_ENDIAN
3590 /* Host and target agree => no need to swap. */
3591 *first
= GEN_INT (CONST_DOUBLE_LOW (value
));
3592 *second
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3596 *second
= GEN_INT (CONST_DOUBLE_LOW (value
));
3597 *first
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3599 #endif /* no REAL_ARITHMETIC */
3603 /* Return nonzero if this function has no function calls. */
3610 if (profile_flag
|| profile_block_flag
|| profile_arc_flag
)
3613 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3615 if (GET_CODE (insn
) == CALL_INSN
)
3617 if (GET_CODE (insn
) == INSN
3618 && GET_CODE (PATTERN (insn
)) == SEQUENCE
3619 && GET_CODE (XVECEXP (PATTERN (insn
), 0, 0)) == CALL_INSN
)
3622 for (insn
= current_function_epilogue_delay_list
; insn
; insn
= XEXP (insn
, 1))
3624 if (GET_CODE (XEXP (insn
, 0)) == CALL_INSN
)
3626 if (GET_CODE (XEXP (insn
, 0)) == INSN
3627 && GET_CODE (PATTERN (XEXP (insn
, 0))) == SEQUENCE
3628 && GET_CODE (XVECEXP (PATTERN (XEXP (insn
, 0)), 0, 0)) == CALL_INSN
)
3635 /* On some machines, a function with no call insns
3636 can run faster if it doesn't create its own register window.
3637 When output, the leaf function should use only the "output"
3638 registers. Ordinarily, the function would be compiled to use
3639 the "input" registers to find its arguments; it is a candidate
3640 for leaf treatment if it uses only the "input" registers.
3641 Leaf function treatment means renumbering so the function
3642 uses the "output" registers instead. */
3644 #ifdef LEAF_REGISTERS
3646 static char permitted_reg_in_leaf_functions
[] = LEAF_REGISTERS
;
3648 /* Return 1 if this function uses only the registers that can be
3649 safely renumbered. */
3652 only_leaf_regs_used ()
3656 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
3658 if ((regs_ever_live
[i
] || global_regs
[i
])
3659 && ! permitted_reg_in_leaf_functions
[i
])
3665 /* Scan all instructions and renumber all registers into those
3666 available in leaf functions. */
3669 leaf_renumber_regs (first
)
3674 /* Renumber only the actual patterns.
3675 The reg-notes can contain frame pointer refs,
3676 and renumbering them could crash, and should not be needed. */
3677 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
3678 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3679 leaf_renumber_regs_insn (PATTERN (insn
));
3680 for (insn
= current_function_epilogue_delay_list
; insn
; insn
= XEXP (insn
, 1))
3681 if (GET_RTX_CLASS (GET_CODE (XEXP (insn
, 0))) == 'i')
3682 leaf_renumber_regs_insn (PATTERN (XEXP (insn
, 0)));
3685 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
3686 available in leaf functions. */
3689 leaf_renumber_regs_insn (in_rtx
)
3690 register rtx in_rtx
;
3693 register char *format_ptr
;
3698 /* Renumber all input-registers into output-registers.
3699 renumbered_regs would be 1 for an output-register;
3702 if (GET_CODE (in_rtx
) == REG
)
3706 /* Don't renumber the same reg twice. */
3710 newreg
= REGNO (in_rtx
);
3711 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
3712 to reach here as part of a REG_NOTE. */
3713 if (newreg
>= FIRST_PSEUDO_REGISTER
)
3718 newreg
= LEAF_REG_REMAP (newreg
);
3721 regs_ever_live
[REGNO (in_rtx
)] = 0;
3722 regs_ever_live
[newreg
] = 1;
3723 REGNO (in_rtx
) = newreg
;
3727 if (GET_RTX_CLASS (GET_CODE (in_rtx
)) == 'i')
3729 /* Inside a SEQUENCE, we find insns.
3730 Renumber just the patterns of these insns,
3731 just as we do for the top-level insns. */
3732 leaf_renumber_regs_insn (PATTERN (in_rtx
));
3736 format_ptr
= GET_RTX_FORMAT (GET_CODE (in_rtx
));
3738 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (in_rtx
)); i
++)
3739 switch (*format_ptr
++)
3742 leaf_renumber_regs_insn (XEXP (in_rtx
, i
));
3746 if (NULL
!= XVEC (in_rtx
, i
))
3748 for (j
= 0; j
< XVECLEN (in_rtx
, i
); j
++)
3749 leaf_renumber_regs_insn (XVECEXP (in_rtx
, i
, j
));