1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-97, 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. */
58 #include "insn-config.h"
59 #include "insn-flags.h"
60 #include "insn-attr.h"
61 #include "insn-codes.h"
63 #include "conditions.h"
66 #include "hard-reg-set.h"
73 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
74 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
76 #if defined (USG) || defined (NO_STAB_H)
77 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
79 #include <stab.h> /* On BSD, use the system's stab.h. */
81 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
83 #ifdef XCOFF_DEBUGGING_INFO
87 #ifdef DWARF_DEBUGGING_INFO
91 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
92 #include "dwarf2out.h"
95 #ifdef SDB_DEBUGGING_INFO
99 /* .stabd code for line number. */
104 /* .stabs code for included file name. */
109 #ifndef INT_TYPE_SIZE
110 #define INT_TYPE_SIZE BITS_PER_WORD
113 #ifndef LONG_TYPE_SIZE
114 #define LONG_TYPE_SIZE BITS_PER_WORD
117 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
118 null default for it to save conditionalization later. */
119 #ifndef CC_STATUS_INIT
120 #define CC_STATUS_INIT
123 /* How to start an assembler comment. */
124 #ifndef ASM_COMMENT_START
125 #define ASM_COMMENT_START ";#"
128 /* Is the given character a logical line separator for the assembler? */
129 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
130 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
133 /* Nonzero means this function is a leaf function, with no function calls.
134 This variable exists to be examined in FUNCTION_PROLOGUE
135 and FUNCTION_EPILOGUE. Always zero, unless set by some action. */
138 /* Last insn processed by final_scan_insn. */
139 static rtx debug_insn
= 0;
141 /* Line number of last NOTE. */
142 static int last_linenum
;
144 /* Highest line number in current block. */
145 static int high_block_linenum
;
147 /* Likewise for function. */
148 static int high_function_linenum
;
150 /* Filename of last NOTE. */
151 static char *last_filename
;
153 /* Number of basic blocks seen so far;
154 used if profile_block_flag is set. */
155 static int count_basic_blocks
;
157 /* Number of instrumented arcs when profile_arc_flag is set. */
158 extern int count_instrumented_arcs
;
160 extern int length_unit_log
; /* This is defined in insn-attrtab.c. */
162 /* Nonzero while outputting an `asm' with operands.
163 This means that inconsistencies are the user's fault, so don't abort.
164 The precise value is the insn being output, to pass to error_for_asm. */
165 static rtx this_is_asm_operands
;
167 /* Number of operands of this insn, for an `asm' with operands. */
168 static unsigned int insn_noperands
;
170 /* Compare optimization flag. */
172 static rtx last_ignored_compare
= 0;
174 /* Flag indicating this insn is the start of a new basic block. */
176 static int new_block
= 1;
178 /* All the symbol-blocks (levels of scoping) in the compilation
179 are assigned sequence numbers in order of appearance of the
180 beginnings of the symbol-blocks. Both final and dbxout do this,
181 and assume that they will both give the same number to each block.
182 Final uses these sequence numbers to generate assembler label names
183 LBBnnn and LBEnnn for the beginning and end of the symbol-block.
184 Dbxout uses the sequence numbers to generate references to the same labels
185 from the dbx debugging information.
187 Sdb records this level at the beginning of each function,
188 in order to find the current level when recursing down declarations.
189 It outputs the block beginning and endings
190 at the point in the asm file where the blocks would begin and end. */
192 int next_block_index
;
194 /* Assign a unique number to each insn that is output.
195 This can be used to generate unique local labels. */
197 static int insn_counter
= 0;
200 /* This variable contains machine-dependent flags (defined in tm.h)
201 set and examined by output routines
202 that describe how to interpret the condition codes properly. */
206 /* During output of an insn, this contains a copy of cc_status
207 from before the insn. */
209 CC_STATUS cc_prev_status
;
212 /* Indexed by hardware reg number, is 1 if that register is ever
213 used in the current function.
215 In life_analysis, or in stupid_life_analysis, this is set
216 up to record the hard regs used explicitly. Reload adds
217 in the hard regs used for holding pseudo regs. Final uses
218 it to generate the code in the function prologue and epilogue
219 to save and restore registers as needed. */
221 char regs_ever_live
[FIRST_PSEUDO_REGISTER
];
223 /* Nonzero means current function must be given a frame pointer.
224 Set in stmt.c if anything is allocated on the stack there.
225 Set in reload1.c if anything is allocated on the stack there. */
227 int frame_pointer_needed
;
229 /* Assign unique numbers to labels generated for profiling. */
231 int profile_label_no
;
233 /* Length so far allocated in PENDING_BLOCKS. */
235 static int max_block_depth
;
237 /* Stack of sequence numbers of symbol-blocks of which we have seen the
238 beginning but not yet the end. Sequence numbers are assigned at
239 the beginning; this stack allows us to find the sequence number
240 of a block that is ending. */
242 static int *pending_blocks
;
244 /* Number of elements currently in use in PENDING_BLOCKS. */
246 static int block_depth
;
248 /* Nonzero if have enabled APP processing of our assembler output. */
252 /* If we are outputting an insn sequence, this contains the sequence rtx.
257 #ifdef ASSEMBLER_DIALECT
259 /* Number of the assembler dialect to use, starting at 0. */
260 static int dialect_number
;
263 /* Indexed by line number, nonzero if there is a note for that line. */
265 static char *line_note_exists
;
267 /* Linked list to hold line numbers for each basic block. */
270 struct bb_list
*next
; /* pointer to next basic block */
271 int line_num
; /* line number */
272 int file_label_num
; /* LPBC<n> label # for stored filename */
273 int func_label_num
; /* LPBC<n> label # for stored function name */
276 static struct bb_list
*bb_head
= 0; /* Head of basic block list */
277 static struct bb_list
**bb_tail
= &bb_head
; /* Ptr to store next bb ptr */
278 static int bb_file_label_num
= -1; /* Current label # for file */
279 static int bb_func_label_num
= -1; /* Current label # for func */
281 /* Linked list to hold the strings for each file and function name output. */
284 struct bb_str
*next
; /* pointer to next string */
285 char *string
; /* string */
286 int label_num
; /* label number */
287 int length
; /* string length */
290 extern rtx peephole
PROTO((rtx
));
292 static struct bb_str
*sbb_head
= 0; /* Head of string list. */
293 static struct bb_str
**sbb_tail
= &sbb_head
; /* Ptr to store next bb str */
294 static int sbb_label_num
= 0; /* Last label used */
296 #ifdef HAVE_ATTR_length
297 static int asm_insn_count
PROTO((rtx
));
299 static void profile_function
PROTO((FILE *));
300 static void profile_after_prologue
PROTO((FILE *));
301 static void add_bb
PROTO((FILE *));
302 static int add_bb_string
PROTO((char *, int));
303 static void output_source_line
PROTO((FILE *, rtx
));
304 static rtx walk_alter_subreg
PROTO((rtx
));
305 static void output_asm_name
PROTO((void));
306 static void output_operand
PROTO((rtx
, int));
307 #ifdef LEAF_REGISTERS
308 static void leaf_renumber_regs
PROTO((rtx
));
311 static int alter_cond
PROTO((rtx
));
314 extern char *getpwd ();
316 /* Initialize data in final at the beginning of a compilation. */
319 init_final (filename
)
322 next_block_index
= 2;
324 max_block_depth
= 20;
325 pending_blocks
= (int *) xmalloc (20 * sizeof *pending_blocks
);
328 #ifdef ASSEMBLER_DIALECT
329 dialect_number
= ASSEMBLER_DIALECT
;
333 /* Called at end of source file,
334 to output the block-profiling table for this entire compilation. */
342 if (profile_block_flag
|| profile_arc_flag
)
345 int align
= exact_log2 (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
);
349 int long_bytes
= LONG_TYPE_SIZE
/ BITS_PER_UNIT
;
350 int pointer_bytes
= POINTER_SIZE
/ BITS_PER_UNIT
;
352 if (profile_block_flag
)
353 size
= long_bytes
* count_basic_blocks
;
355 size
= long_bytes
* count_instrumented_arcs
;
358 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
359 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
360 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
364 /* Output the main header, of 11 words:
365 0: 1 if this file is initialized, else 0.
366 1: address of file name (LPBX1).
367 2: address of table of counts (LPBX2).
368 3: number of counts in the table.
369 4: always 0, for compatibility with Sun.
371 The following are GNU extensions:
373 5: address of table of start addrs of basic blocks (LPBX3).
374 6: Number of bytes in this header.
375 7: address of table of function names (LPBX4).
376 8: address of table of line numbers (LPBX5) or 0.
377 9: address of table of file names (LPBX6) or 0.
378 10: space reserved for basic block profiling. */
380 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
382 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 0);
384 assemble_integer (const0_rtx
, long_bytes
, 1);
386 /* address of filename */
387 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 1);
388 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
, 1);
390 /* address of count table */
391 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 2);
392 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
, 1);
394 /* count of the # of basic blocks or # of instrumented arcs */
395 if (profile_block_flag
)
396 assemble_integer (GEN_INT (count_basic_blocks
), long_bytes
, 1);
398 assemble_integer (GEN_INT (count_instrumented_arcs
), long_bytes
,
401 /* zero word (link field) */
402 assemble_integer (const0_rtx
, pointer_bytes
, 1);
404 /* address of basic block start address table */
405 if (profile_block_flag
)
407 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 3);
408 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
,
412 assemble_integer (const0_rtx
, pointer_bytes
, 1);
414 /* byte count for extended structure. */
415 assemble_integer (GEN_INT (10 * UNITS_PER_WORD
), long_bytes
, 1);
417 /* address of function name table */
418 if (profile_block_flag
)
420 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 4);
421 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
,
425 assemble_integer (const0_rtx
, pointer_bytes
, 1);
427 /* address of line number and filename tables if debugging. */
428 if (write_symbols
!= NO_DEBUG
&& profile_block_flag
)
430 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 5);
431 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
, 1);
432 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 6);
433 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
, 1);
437 assemble_integer (const0_rtx
, pointer_bytes
, 1);
438 assemble_integer (const0_rtx
, pointer_bytes
, 1);
441 /* space for extension ptr (link field) */
442 assemble_integer (const0_rtx
, UNITS_PER_WORD
, 1);
444 /* Output the file name changing the suffix to .d for Sun tcov
446 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 1);
448 char *cwd
= getpwd ();
449 int len
= strlen (filename
) + strlen (cwd
) + 1;
450 char *data_file
= (char *) alloca (len
+ 4);
452 strcpy (data_file
, cwd
);
453 strcat (data_file
, "/");
454 strcat (data_file
, filename
);
455 strip_off_ending (data_file
, len
);
456 if (profile_block_flag
)
457 strcat (data_file
, ".d");
459 strcat (data_file
, ".da");
460 assemble_string (data_file
, strlen (data_file
) + 1);
463 /* Make space for the table of counts. */
466 /* Realign data section. */
467 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
468 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 2);
470 assemble_zeros (size
);
474 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 2);
475 #ifdef ASM_OUTPUT_SHARED_LOCAL
476 if (flag_shared_data
)
477 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
480 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
481 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
484 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
485 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
,
488 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
493 /* Output any basic block strings */
494 if (profile_block_flag
)
496 readonly_data_section ();
499 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
500 for (sptr
= sbb_head
; sptr
!= 0; sptr
= sptr
->next
)
502 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBC",
504 assemble_string (sptr
->string
, sptr
->length
);
509 /* Output the table of addresses. */
510 if (profile_block_flag
)
512 /* Realign in new section */
513 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
514 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 3);
515 for (i
= 0; i
< count_basic_blocks
; i
++)
517 ASM_GENERATE_INTERNAL_LABEL (name
, "LPB", i
);
518 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
),
523 /* Output the table of function names. */
524 if (profile_block_flag
)
526 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 4);
527 for ((ptr
= bb_head
), (i
= 0); ptr
!= 0; (ptr
= ptr
->next
), i
++)
529 if (ptr
->func_label_num
>= 0)
531 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBC",
532 ptr
->func_label_num
);
533 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
),
537 assemble_integer (const0_rtx
, pointer_bytes
, 1);
540 for ( ; i
< count_basic_blocks
; i
++)
541 assemble_integer (const0_rtx
, pointer_bytes
, 1);
544 if (write_symbols
!= NO_DEBUG
&& profile_block_flag
)
546 /* Output the table of line numbers. */
547 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 5);
548 for ((ptr
= bb_head
), (i
= 0); ptr
!= 0; (ptr
= ptr
->next
), i
++)
549 assemble_integer (GEN_INT (ptr
->line_num
), long_bytes
, 1);
551 for ( ; i
< count_basic_blocks
; i
++)
552 assemble_integer (const0_rtx
, long_bytes
, 1);
554 /* Output the table of file names. */
555 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 6);
556 for ((ptr
= bb_head
), (i
= 0); ptr
!= 0; (ptr
= ptr
->next
), i
++)
558 if (ptr
->file_label_num
>= 0)
560 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBC",
561 ptr
->file_label_num
);
562 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
),
566 assemble_integer (const0_rtx
, pointer_bytes
, 1);
569 for ( ; i
< count_basic_blocks
; i
++)
570 assemble_integer (const0_rtx
, pointer_bytes
, 1);
573 /* End with the address of the table of addresses,
574 so we can find it easily, as the last word in the file's text. */
575 if (profile_block_flag
)
577 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 3);
578 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, name
), pointer_bytes
,
584 /* Enable APP processing of subsequent output.
585 Used before the output from an `asm' statement. */
592 fputs (ASM_APP_ON
, asm_out_file
);
597 /* Disable APP processing of subsequent output.
598 Called from varasm.c before most kinds of output. */
605 fputs (ASM_APP_OFF
, asm_out_file
);
610 /* Return the number of slots filled in the current
611 delayed branch sequence (we don't count the insn needing the
612 delay slot). Zero if not in a delayed branch sequence. */
616 dbr_sequence_length ()
618 if (final_sequence
!= 0)
619 return XVECLEN (final_sequence
, 0) - 1;
625 /* The next two pages contain routines used to compute the length of an insn
626 and to shorten branches. */
628 /* Arrays for insn lengths, and addresses. The latter is referenced by
629 `insn_current_length'. */
631 static short *insn_lengths
;
634 /* Address of insn being processed. Used by `insn_current_length'. */
635 int insn_current_address
;
637 /* Address of insn being processed in previous iteration. */
638 int insn_last_address
;
640 /* konwn invariant alignment of insn being processed. */
641 int insn_current_align
;
643 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
644 gives the next following alignment insn that increases the known
645 alignment, or NULL_RTX if there is no such insn.
646 For any alignment obtained this way, we can again index uid_align with
647 its uid to obtain the next following align that in turn increases the
648 alignment, till we reach NULL_RTX; the sequence obtained this way
649 for each insn we'll call the alignment chain of this insn in the following
656 /* Indicate that branch shortening hasn't yet been done. */
678 free (insn_addresses
);
688 /* Obtain the current length of an insn. If branch shortening has been done,
689 get its actual length. Otherwise, get its maximum length. */
692 get_attr_length (insn
)
695 #ifdef HAVE_ATTR_length
701 return insn_lengths
[INSN_UID (insn
)];
703 switch (GET_CODE (insn
))
711 length
= insn_default_length (insn
);
715 body
= PATTERN (insn
);
716 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
718 /* Alignment is machine-dependent and should be handled by
722 length
= insn_default_length (insn
);
726 body
= PATTERN (insn
);
727 if (GET_CODE (body
) == USE
|| GET_CODE (body
) == CLOBBER
)
730 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
731 length
= asm_insn_count (body
) * insn_default_length (insn
);
732 else if (GET_CODE (body
) == SEQUENCE
)
733 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
734 length
+= get_attr_length (XVECEXP (body
, 0, i
));
736 length
= insn_default_length (insn
);
743 #ifdef ADJUST_INSN_LENGTH
744 ADJUST_INSN_LENGTH (insn
, length
);
747 #else /* not HAVE_ATTR_length */
749 #endif /* not HAVE_ATTR_length */
752 /* Code to handle alignment inside shorten_branches. */
754 /* Here is an explanation how the algorithm in align_fuzz can give
757 Call a sequence of instructions beginning with alignment point X
758 and continuing until the next alignment point `block X'. When `X'
759 is used in an expression, it means the alignment value of the
762 Call the distance between the start of the first insn of block X, and
763 the end of the last insn of block X `IX', for the `inner size of X'.
764 This is clearly the sum of the instruction lengths.
766 Likewise with the next alignment-delimited block following X, which we
769 Call the distance between the start of the first insn of block X, and
770 the start of the first insn of block Y `OX', for the `outer size of X'.
772 The estimated padding is then OX - IX.
774 OX can be safely estimated as
779 OX = round_up(IX, X) + Y - X
781 Clearly est(IX) >= real(IX), because that only depends on the
782 instruction lengths, and those being overestimated is a given.
784 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
785 we needn't worry about that when thinking about OX.
787 When X >= Y, the alignment provided by Y adds no uncertainty factor
788 for branch ranges starting before X, so we can just round what we have.
789 But when X < Y, we don't know anything about the, so to speak,
790 `middle bits', so we have to assume the worst when aligning up from an
791 address mod X to one mod Y, which is Y - X. */
794 #define LABEL_ALIGN(LABEL) 0
798 #define LOOP_ALIGN(LABEL) 0
801 #ifndef LABEL_ALIGN_AFTER_BARRIER
802 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
805 #ifndef ADDR_VEC_ALIGN
807 final_addr_vec_align (addr_vec
)
810 int align
= exact_log2 (GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec
))));
812 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
813 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
817 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
820 #ifndef INSN_LENGTH_ALIGNMENT
821 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
824 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
826 static int min_labelno
, max_labelno
;
828 #define LABEL_TO_ALIGNMENT(LABEL) \
829 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno])
831 /* For the benefit of port specific code do this also as a function. */
833 label_to_alignment (label
)
836 return LABEL_TO_ALIGNMENT (label
);
839 #ifdef HAVE_ATTR_length
840 /* The differences in addresses
841 between a branch and its target might grow or shrink depending on
842 the alignment the start insn of the range (the branch for a forward
843 branch or the label for a backward branch) starts out on; if these
844 differences are used naively, they can even oscillate infinitely.
845 We therefore want to compute a 'worst case' address difference that
846 is independent of the alignment the start insn of the range end
847 up on, and that is at least as large as the actual difference.
848 The function align_fuzz calculates the amount we have to add to the
849 naively computed difference, by traversing the part of the alignment
850 chain of the start insn of the range that is in front of the end insn
851 of the range, and considering for each alignment the maximum amount
852 that it might contribute to a size increase.
854 For casesi tables, we also want to know worst case minimum amounts of
855 address difference, in case a machine description wants to introduce
856 some common offset that is added to all offsets in a table.
857 For this purpose, align_fuzz with a growth argument of 0 comuptes the
858 appropriate adjustment. */
861 /* Compute the maximum delta by which the difference of the addresses of
862 START and END might grow / shrink due to a different address for start
863 which changes the size of alignment insns between START and END.
864 KNOWN_ALIGN_LOG is the alignment known for START.
865 GROWTH should be ~0 if the objective is to compute potential code size
866 increase, and 0 if the objective is to compute potential shrink.
867 The return value is undefined for any other value of GROWTH. */
869 align_fuzz (start
, end
, known_align_log
, growth
)
874 int uid
= INSN_UID (start
);
876 int known_align
= 1 << known_align_log
;
877 int end_shuid
= INSN_SHUID (end
);
880 for (align_label
= uid_align
[uid
]; align_label
; align_label
= uid_align
[uid
])
882 int align_addr
, new_align
;
884 uid
= INSN_UID (align_label
);
885 align_addr
= insn_addresses
[uid
] - insn_lengths
[uid
];
886 if (uid_shuid
[uid
] > end_shuid
)
888 known_align_log
= LABEL_TO_ALIGNMENT (align_label
);
889 new_align
= 1 << known_align_log
;
890 if (new_align
< known_align
)
892 fuzz
+= (-align_addr
^ growth
) & (new_align
- known_align
);
893 known_align
= new_align
;
898 /* Compute a worst-case reference address of a branch so that it
899 can be safely used in the presence of aligned labels. Since the
900 size of the branch itself is unknown, the size of the branch is
901 not included in the range. I.e. for a forward branch, the reference
902 address is the end address of the branch as known from the previous
903 branch shortening pass, minus a value to account for possible size
904 increase due to alignment. For a backward branch, it is the start
905 address of the branch as known from the current pass, plus a value
906 to account for possible size increase due to alignment.
907 NB.: Therefore, the maximum offset allowed for backward branches needs
908 to exclude the branch size. */
910 insn_current_reference_address (branch
)
914 rtx seq
= NEXT_INSN (PREV_INSN (branch
));
915 int seq_uid
= INSN_UID (seq
);
916 if (GET_CODE (branch
) != JUMP_INSN
)
917 /* This can happen for example on the PA; the objective is to know the
918 offset to address something in front of the start of the function.
919 Thus, we can treat it like a backward branch.
920 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
921 any alignment we'd encounter, so we skip the call to align_fuzz. */
922 return insn_current_address
;
923 dest
= JUMP_LABEL (branch
);
924 /* BRANCH has no proper alignment chain set, so use SEQ. */
925 if (INSN_SHUID (branch
) < INSN_SHUID (dest
))
927 /* Forward branch. */
928 return (insn_last_address
+ insn_lengths
[seq_uid
]
929 - align_fuzz (seq
, dest
, length_unit_log
, ~0));
933 /* Backward branch. */
934 return (insn_current_address
935 + align_fuzz (dest
, seq
, length_unit_log
, ~0));
938 #endif /* HAVE_ATTR_length */
940 /* Make a pass over all insns and compute their actual lengths by shortening
941 any branches of variable length if possible. */
943 /* Give a default value for the lowest address in a function. */
945 #ifndef FIRST_INSN_ADDRESS
946 #define FIRST_INSN_ADDRESS 0
949 /* shorten_branches might be called multiple times: for example, the SH
950 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
951 In order to do this, it needs proper length information, which it obtains
952 by calling shorten_branches. This cannot be collapsed with
953 shorten_branches itself into a single pass unless we also want to intergate
954 reorg.c, since the branch splitting exposes new instructions with delay
958 shorten_branches (first
)
965 #ifdef HAVE_ATTR_length
966 #define MAX_CODE_ALIGN 16
968 int something_changed
= 1;
969 char *varying_length
;
972 rtx align_tab
[MAX_CODE_ALIGN
];
974 /* In order to make sure that all instructions have valid length info,
975 we must split them before we compute the address/length info. */
977 for (insn
= NEXT_INSN (first
); insn
; insn
= NEXT_INSN (insn
))
978 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
981 insn
= try_split (PATTERN (old
), old
, 1);
982 /* When not optimizing, the old insn will be still left around
983 with only the 'deleted' bit set. Transform it into a note
984 to avoid confusion of subsequent processing. */
985 if (INSN_DELETED_P (old
))
987 PUT_CODE (old
, NOTE
);
988 NOTE_LINE_NUMBER (old
) = NOTE_INSN_DELETED
;
989 NOTE_SOURCE_FILE (old
) = 0;
994 /* We must do some computations even when not actually shortening, in
995 order to get the alignment information for the labels. */
997 init_insn_lengths ();
999 /* Compute maximum UID and allocate label_align / uid_shuid. */
1000 max_uid
= get_max_uid ();
1002 max_labelno
= max_label_num ();
1003 min_labelno
= get_first_label_num ();
1005 = (short*) xmalloc ((max_labelno
- min_labelno
+ 1) * sizeof (short));
1006 bzero ((char *) label_align
,
1007 (max_labelno
- min_labelno
+ 1) * sizeof (short));
1009 uid_shuid
= (int *) xmalloc (max_uid
* sizeof *uid_shuid
);
1011 /* Initialize label_align and set up uid_shuid to be strictly
1012 monotonically rising with insn order. */
1013 /* We use max_log here to keep track of the maximum alignment we want to
1014 impose on the next CODE_LABEL (or the current one if we are processing
1015 the CODE_LABEL itself). */
1017 for (max_log
= 0, insn
= get_insns (), i
= 1; insn
; insn
= NEXT_INSN (insn
))
1021 INSN_SHUID (insn
) = i
++;
1022 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
1024 /* reorg might make the first insn of a loop being run once only,
1025 and delete the label in front of it. Then we want to apply
1026 the loop alignment to the new label created by reorg, which
1027 is separated by the former loop start insn from the
1028 NOTE_INSN_LOOP_BEG. */
1030 else if (GET_CODE (insn
) == CODE_LABEL
)
1034 log
= LABEL_ALIGN (insn
);
1037 next
= NEXT_INSN (insn
);
1038 /* ADDR_VECs only take room if read-only data goes into the text section. */
1039 #if !defined(READONLY_DATA_SECTION) || defined(JUMP_TABLES_IN_TEXT_SECTION)
1040 if (next
&& GET_CODE (next
) == JUMP_INSN
)
1042 rtx nextbody
= PATTERN (next
);
1043 if (GET_CODE (nextbody
) == ADDR_VEC
1044 || GET_CODE (nextbody
) == ADDR_DIFF_VEC
)
1046 log
= ADDR_VEC_ALIGN (next
);
1052 LABEL_TO_ALIGNMENT (insn
) = max_log
;
1055 else if (GET_CODE (insn
) == BARRIER
)
1059 for (label
= insn
; label
&& GET_RTX_CLASS (GET_CODE (label
)) != 'i';
1060 label
= NEXT_INSN (label
))
1061 if (GET_CODE (label
) == CODE_LABEL
)
1063 log
= LABEL_ALIGN_AFTER_BARRIER (insn
);
1069 /* Again, we allow NOTE_INSN_LOOP_BEG - INSN - CODE_LABEL
1070 sequences in order to handle reorg output efficiently. */
1071 else if (GET_CODE (insn
) == NOTE
1072 && NOTE_LINE_NUMBER (insn
) == NOTE_INSN_LOOP_BEG
)
1076 for (label
= insn
; label
; label
= NEXT_INSN (label
))
1077 if (GET_CODE (label
) == CODE_LABEL
)
1079 log
= LOOP_ALIGN (insn
);
1088 #ifdef HAVE_ATTR_length
1090 /* Allocate the rest of the arrays. */
1091 insn_lengths
= (short *) xmalloc (max_uid
* sizeof (short));
1092 insn_addresses
= (int *) xmalloc (max_uid
* sizeof (int));
1093 /* Syntax errors can lead to labels being outside of the main insn stream.
1094 Initialize insn_addresses, so that we get reproducible results. */
1095 bzero ((char *)insn_addresses
, max_uid
* sizeof *insn_addresses
);
1096 uid_align
= (rtx
*) xmalloc (max_uid
* sizeof *uid_align
);
1098 varying_length
= (char *) xmalloc (max_uid
* sizeof (char));
1100 bzero (varying_length
, max_uid
);
1102 /* Initialize uid_align. We scan instructions
1103 from end to start, and keep in align_tab[n] the last seen insn
1104 that does an alignment of at least n+1, i.e. the successor
1105 in the alignment chain for an insn that does / has a known
1108 bzero ((char *) uid_align
, max_uid
* sizeof *uid_align
);
1110 for (i
= MAX_CODE_ALIGN
; --i
>= 0; )
1111 align_tab
[i
] = NULL_RTX
;
1112 seq
= get_last_insn ();
1113 for (; seq
; seq
= PREV_INSN (seq
))
1115 int uid
= INSN_UID (seq
);
1117 log
= (GET_CODE (seq
) == CODE_LABEL
? LABEL_TO_ALIGNMENT (seq
) : 0);
1118 uid_align
[uid
] = align_tab
[0];
1121 /* Found an alignment label. */
1122 uid_align
[uid
] = align_tab
[log
];
1123 for (i
= log
- 1; i
>= 0; i
--)
1127 #ifdef CASE_VECTOR_SHORTEN_MODE
1130 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1133 int min_shuid
= INSN_SHUID (get_insns ()) - 1;
1134 int max_shuid
= INSN_SHUID (get_last_insn ()) + 1;
1137 for (insn
= first
; insn
!= 0; insn
= NEXT_INSN (insn
))
1139 rtx min_lab
= NULL_RTX
, max_lab
= NULL_RTX
, pat
;
1140 int len
, i
, min
, max
, insn_shuid
;
1142 addr_diff_vec_flags flags
;
1144 if (GET_CODE (insn
) != JUMP_INSN
1145 || GET_CODE (PATTERN (insn
)) != ADDR_DIFF_VEC
)
1147 pat
= PATTERN (insn
);
1148 len
= XVECLEN (pat
, 1);
1151 min_align
= MAX_CODE_ALIGN
;
1152 for (min
= max_shuid
, max
= min_shuid
, i
= len
- 1; i
>= 0; i
--)
1154 rtx lab
= XEXP (XVECEXP (pat
, 1, i
), 0);
1155 int shuid
= INSN_SHUID (lab
);
1166 if (min_align
> LABEL_TO_ALIGNMENT (lab
))
1167 min_align
= LABEL_TO_ALIGNMENT (lab
);
1169 XEXP (pat
, 2) = gen_rtx_LABEL_REF (VOIDmode
, min_lab
);
1170 XEXP (pat
, 3) = gen_rtx_LABEL_REF (VOIDmode
, max_lab
);
1171 insn_shuid
= INSN_SHUID (insn
);
1172 rel
= INSN_SHUID (XEXP (XEXP (pat
, 0), 0));
1173 flags
.min_align
= min_align
;
1174 flags
.base_after_vec
= rel
> insn_shuid
;
1175 flags
.min_after_vec
= min
> insn_shuid
;
1176 flags
.max_after_vec
= max
> insn_shuid
;
1177 flags
.min_after_base
= min
> rel
;
1178 flags
.max_after_base
= max
> rel
;
1179 ADDR_DIFF_VEC_FLAGS (pat
) = flags
;
1182 #endif /* CASE_VECTOR_SHORTEN_MODE */
1185 /* Compute initial lengths, addresses, and varying flags for each insn. */
1186 for (insn_current_address
= FIRST_INSN_ADDRESS
, insn
= first
;
1188 insn_current_address
+= insn_lengths
[uid
], insn
= NEXT_INSN (insn
))
1190 uid
= INSN_UID (insn
);
1192 insn_lengths
[uid
] = 0;
1194 if (GET_CODE (insn
) == CODE_LABEL
)
1196 int log
= LABEL_TO_ALIGNMENT (insn
);
1199 int align
= 1 << log
;
1200 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1201 insn_lengths
[uid
] = new_address
- insn_current_address
;
1202 insn_current_address
= new_address
;
1206 insn_addresses
[uid
] = insn_current_address
;
1208 if (GET_CODE (insn
) == NOTE
|| GET_CODE (insn
) == BARRIER
1209 || GET_CODE (insn
) == CODE_LABEL
)
1211 if (INSN_DELETED_P (insn
))
1214 body
= PATTERN (insn
);
1215 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
1217 /* This only takes room if read-only data goes into the text
1219 #if !defined(READONLY_DATA_SECTION) || defined(JUMP_TABLES_IN_TEXT_SECTION)
1220 insn_lengths
[uid
] = (XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
)
1221 * GET_MODE_SIZE (GET_MODE (body
)));
1222 /* Alignment is handled by ADDR_VEC_ALIGN. */
1225 else if (asm_noperands (body
) >= 0)
1226 insn_lengths
[uid
] = asm_insn_count (body
) * insn_default_length (insn
);
1227 else if (GET_CODE (body
) == SEQUENCE
)
1230 int const_delay_slots
;
1232 const_delay_slots
= const_num_delay_slots (XVECEXP (body
, 0, 0));
1234 const_delay_slots
= 0;
1236 /* Inside a delay slot sequence, we do not do any branch shortening
1237 if the shortening could change the number of delay slots
1239 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1241 rtx inner_insn
= XVECEXP (body
, 0, i
);
1242 int inner_uid
= INSN_UID (inner_insn
);
1245 if (asm_noperands (PATTERN (XVECEXP (body
, 0, i
))) >= 0)
1246 inner_length
= (asm_insn_count (PATTERN (inner_insn
))
1247 * insn_default_length (inner_insn
));
1249 inner_length
= insn_default_length (inner_insn
);
1251 insn_lengths
[inner_uid
] = inner_length
;
1252 if (const_delay_slots
)
1254 if ((varying_length
[inner_uid
]
1255 = insn_variable_length_p (inner_insn
)) != 0)
1256 varying_length
[uid
] = 1;
1257 insn_addresses
[inner_uid
] = (insn_current_address
+
1261 varying_length
[inner_uid
] = 0;
1262 insn_lengths
[uid
] += inner_length
;
1265 else if (GET_CODE (body
) != USE
&& GET_CODE (body
) != CLOBBER
)
1267 insn_lengths
[uid
] = insn_default_length (insn
);
1268 varying_length
[uid
] = insn_variable_length_p (insn
);
1271 /* If needed, do any adjustment. */
1272 #ifdef ADJUST_INSN_LENGTH
1273 ADJUST_INSN_LENGTH (insn
, insn_lengths
[uid
]);
1277 /* Now loop over all the insns finding varying length insns. For each,
1278 get the current insn length. If it has changed, reflect the change.
1279 When nothing changes for a full pass, we are done. */
1281 while (something_changed
)
1283 something_changed
= 0;
1284 insn_current_align
= MAX_CODE_ALIGN
- 1;
1285 for (insn_current_address
= FIRST_INSN_ADDRESS
, insn
= first
;
1287 insn
= NEXT_INSN (insn
))
1290 #ifdef ADJUST_INSN_LENGTH
1295 uid
= INSN_UID (insn
);
1297 if (GET_CODE (insn
) == CODE_LABEL
)
1299 int log
= LABEL_TO_ALIGNMENT (insn
);
1300 if (log
> insn_current_align
)
1302 int align
= 1 << log
;
1303 int new_address
= (insn_current_address
+ align
- 1) & -align
;
1304 insn_lengths
[uid
] = new_address
- insn_current_address
;
1305 insn_current_align
= log
;
1306 insn_current_address
= new_address
;
1309 insn_lengths
[uid
] = 0;
1310 insn_addresses
[uid
] = insn_current_address
;
1314 length_align
= INSN_LENGTH_ALIGNMENT (insn
);
1315 if (length_align
< insn_current_align
)
1316 insn_current_align
= length_align
;
1318 insn_last_address
= insn_addresses
[uid
];
1319 insn_addresses
[uid
] = insn_current_address
;
1321 #ifdef CASE_VECTOR_SHORTEN_MODE
1322 if (optimize
&& GET_CODE (insn
) == JUMP_INSN
1323 && GET_CODE (PATTERN (insn
)) == ADDR_DIFF_VEC
)
1325 rtx body
= PATTERN (insn
);
1326 int old_length
= insn_lengths
[uid
];
1327 rtx rel_lab
= XEXP (XEXP (body
, 0), 0);
1328 rtx min_lab
= XEXP (XEXP (body
, 2), 0);
1329 rtx max_lab
= XEXP (XEXP (body
, 3), 0);
1330 addr_diff_vec_flags flags
= ADDR_DIFF_VEC_FLAGS (body
);
1331 int rel_addr
= insn_addresses
[INSN_UID (rel_lab
)];
1332 int min_addr
= insn_addresses
[INSN_UID (min_lab
)];
1333 int max_addr
= insn_addresses
[INSN_UID (max_lab
)];
1337 /* Try to find a known alignment for rel_lab. */
1338 for (prev
= rel_lab
;
1340 && ! insn_lengths
[INSN_UID (prev
)]
1341 && ! (varying_length
[INSN_UID (prev
)] & 1);
1342 prev
= PREV_INSN (prev
))
1343 if (varying_length
[INSN_UID (prev
)] & 2)
1345 rel_align
= LABEL_TO_ALIGNMENT (prev
);
1349 /* See the comment on addr_diff_vec_flags in rtl.h for the
1350 meaning of the flags values. base: REL_LAB vec: INSN */
1351 /* Anything after INSN has still addresses from the last
1352 pass; adjust these so that they reflect our current
1353 estimate for this pass. */
1354 if (flags
.base_after_vec
)
1355 rel_addr
+= insn_current_address
- insn_last_address
;
1356 if (flags
.min_after_vec
)
1357 min_addr
+= insn_current_address
- insn_last_address
;
1358 if (flags
.max_after_vec
)
1359 max_addr
+= insn_current_address
- insn_last_address
;
1360 /* We want to know the worst case, i.e. lowest possible value
1361 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1362 its offset is positive, and we have to be wary of code shrink;
1363 otherwise, it is negative, and we have to be vary of code
1365 if (flags
.min_after_base
)
1367 /* If INSN is between REL_LAB and MIN_LAB, the size
1368 changes we are about to make can change the alignment
1369 within the observed offset, therefore we have to break
1370 it up into two parts that are independent. */
1371 if (! flags
.base_after_vec
&& flags
.min_after_vec
)
1373 min_addr
-= align_fuzz (rel_lab
, insn
, rel_align
, 0);
1374 min_addr
-= align_fuzz (insn
, min_lab
, 0, 0);
1377 min_addr
-= align_fuzz (rel_lab
, min_lab
, rel_align
, 0);
1381 if (flags
.base_after_vec
&& ! flags
.min_after_vec
)
1383 min_addr
-= align_fuzz (min_lab
, insn
, 0, ~0);
1384 min_addr
-= align_fuzz (insn
, rel_lab
, 0, ~0);
1387 min_addr
-= align_fuzz (min_lab
, rel_lab
, 0, ~0);
1389 /* Likewise, determine the highest lowest possible value
1390 for the offset of MAX_LAB. */
1391 if (flags
.max_after_base
)
1393 if (! flags
.base_after_vec
&& flags
.max_after_vec
)
1395 max_addr
+= align_fuzz (rel_lab
, insn
, rel_align
, ~0);
1396 max_addr
+= align_fuzz (insn
, max_lab
, 0, ~0);
1399 max_addr
+= align_fuzz (rel_lab
, max_lab
, rel_align
, ~0);
1403 if (flags
.base_after_vec
&& ! flags
.max_after_vec
)
1405 max_addr
+= align_fuzz (max_lab
, insn
, 0, 0);
1406 max_addr
+= align_fuzz (insn
, rel_lab
, 0, 0);
1409 max_addr
+= align_fuzz (max_lab
, rel_lab
, 0, 0);
1411 PUT_MODE (body
, CASE_VECTOR_SHORTEN_MODE (min_addr
- rel_addr
,
1412 max_addr
- rel_addr
,
1414 #if !defined(READONLY_DATA_SECTION) || defined(JUMP_TABLES_IN_TEXT_SECTION)
1416 = (XVECLEN (body
, 1) * GET_MODE_SIZE (GET_MODE (body
)));
1417 insn_current_address
+= insn_lengths
[uid
];
1418 if (insn_lengths
[uid
] != old_length
)
1419 something_changed
= 1;
1423 #endif /* CASE_VECTOR_SHORTEN_MODE */
1425 if (! (varying_length
[uid
]))
1427 insn_current_address
+= insn_lengths
[uid
];
1430 if (GET_CODE (insn
) == INSN
&& GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1434 body
= PATTERN (insn
);
1436 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
1438 rtx inner_insn
= XVECEXP (body
, 0, i
);
1439 int inner_uid
= INSN_UID (inner_insn
);
1442 insn_addresses
[inner_uid
] = insn_current_address
;
1444 /* insn_current_length returns 0 for insns with a
1445 non-varying length. */
1446 if (! varying_length
[inner_uid
])
1447 inner_length
= insn_lengths
[inner_uid
];
1449 inner_length
= insn_current_length (inner_insn
);
1451 if (inner_length
!= insn_lengths
[inner_uid
])
1453 insn_lengths
[inner_uid
] = inner_length
;
1454 something_changed
= 1;
1456 insn_current_address
+= insn_lengths
[inner_uid
];
1457 new_length
+= inner_length
;
1462 new_length
= insn_current_length (insn
);
1463 insn_current_address
+= new_length
;
1466 #ifdef ADJUST_INSN_LENGTH
1467 /* If needed, do any adjustment. */
1468 tmp_length
= new_length
;
1469 ADJUST_INSN_LENGTH (insn
, new_length
);
1470 insn_current_address
+= (new_length
- tmp_length
);
1473 if (new_length
!= insn_lengths
[uid
])
1475 insn_lengths
[uid
] = new_length
;
1476 something_changed
= 1;
1479 /* For a non-optimizing compile, do only a single pass. */
1484 free (varying_length
);
1486 #endif /* HAVE_ATTR_length */
1489 #ifdef HAVE_ATTR_length
1490 /* Given the body of an INSN known to be generated by an ASM statement, return
1491 the number of machine instructions likely to be generated for this insn.
1492 This is used to compute its length. */
1495 asm_insn_count (body
)
1501 if (GET_CODE (body
) == ASM_INPUT
)
1502 template = XSTR (body
, 0);
1504 template = decode_asm_operands (body
, NULL_PTR
, NULL_PTR
,
1505 NULL_PTR
, NULL_PTR
);
1507 for ( ; *template; template++)
1508 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
1515 /* Output assembler code for the start of a function,
1516 and initialize some of the variables in this file
1517 for the new function. The label for the function and associated
1518 assembler pseudo-ops have already been output in `assemble_start_function'.
1520 FIRST is the first insn of the rtl for the function being compiled.
1521 FILE is the file to write assembler code to.
1522 OPTIMIZE is nonzero if we should eliminate redundant
1523 test and compare insns. */
1526 final_start_function (first
, file
, optimize
)
1533 this_is_asm_operands
= 0;
1535 #ifdef NON_SAVING_SETJMP
1536 /* A function that calls setjmp should save and restore all the
1537 call-saved registers on a system where longjmp clobbers them. */
1538 if (NON_SAVING_SETJMP
&& current_function_calls_setjmp
)
1542 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
1543 if (!call_used_regs
[i
] && !call_fixed_regs
[i
])
1544 regs_ever_live
[i
] = 1;
1548 /* Initial line number is supposed to be output
1549 before the function's prologue and label
1550 so that the function's address will not appear to be
1551 in the last statement of the preceding function. */
1552 if (NOTE_LINE_NUMBER (first
) != NOTE_INSN_DELETED
)
1553 last_linenum
= high_block_linenum
= high_function_linenum
1554 = NOTE_LINE_NUMBER (first
);
1556 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1557 /* Output DWARF definition of the function. */
1558 if (dwarf2out_do_frame ())
1559 dwarf2out_begin_prologue ();
1562 /* For SDB and XCOFF, the function beginning must be marked between
1563 the function label and the prologue. We always need this, even when
1564 -g1 was used. Defer on MIPS systems so that parameter descriptions
1565 follow function entry. */
1566 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
1567 if (write_symbols
== SDB_DEBUG
)
1568 sdbout_begin_function (last_linenum
);
1571 #ifdef XCOFF_DEBUGGING_INFO
1572 if (write_symbols
== XCOFF_DEBUG
)
1573 xcoffout_begin_function (file
, last_linenum
);
1576 /* But only output line number for other debug info types if -g2
1578 if (NOTE_LINE_NUMBER (first
) != NOTE_INSN_DELETED
)
1579 output_source_line (file
, first
);
1581 #ifdef LEAF_REG_REMAP
1583 leaf_renumber_regs (first
);
1586 /* The Sun386i and perhaps other machines don't work right
1587 if the profiling code comes after the prologue. */
1588 #ifdef PROFILE_BEFORE_PROLOGUE
1590 profile_function (file
);
1591 #endif /* PROFILE_BEFORE_PROLOGUE */
1593 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1594 if (dwarf2out_do_frame ())
1595 dwarf2out_frame_debug (NULL_RTX
);
1598 #ifdef FUNCTION_PROLOGUE
1599 /* First output the function prologue: code to set up the stack frame. */
1600 FUNCTION_PROLOGUE (file
, get_frame_size ());
1603 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1604 if (write_symbols
== SDB_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1605 next_block_index
= 1;
1608 /* If the machine represents the prologue as RTL, the profiling code must
1609 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1610 #ifdef HAVE_prologue
1611 if (! HAVE_prologue
)
1613 profile_after_prologue (file
);
1617 /* If we are doing basic block profiling, remember a printable version
1618 of the function name. */
1619 if (profile_block_flag
)
1622 = add_bb_string ((*decl_printable_name
) (current_function_decl
, 2), FALSE
);
1627 profile_after_prologue (file
)
1630 #ifdef FUNCTION_BLOCK_PROFILER
1631 if (profile_block_flag
)
1633 FUNCTION_BLOCK_PROFILER (file
, count_basic_blocks
);
1635 #endif /* FUNCTION_BLOCK_PROFILER */
1637 #ifndef PROFILE_BEFORE_PROLOGUE
1639 profile_function (file
);
1640 #endif /* not PROFILE_BEFORE_PROLOGUE */
1644 profile_function (file
)
1647 int align
= MIN (BIGGEST_ALIGNMENT
, LONG_TYPE_SIZE
);
1648 #if defined(ASM_OUTPUT_REG_PUSH)
1649 #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1650 int sval
= current_function_returns_struct
;
1652 #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1653 int cxt
= current_function_needs_context
;
1655 #endif /* ASM_OUTPUT_REG_PUSH */
1658 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
1659 ASM_OUTPUT_INTERNAL_LABEL (file
, "LP", profile_label_no
);
1660 assemble_integer (const0_rtx
, LONG_TYPE_SIZE
/ BITS_PER_UNIT
, 1);
1662 function_section (current_function_decl
);
1664 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1666 ASM_OUTPUT_REG_PUSH (file
, STRUCT_VALUE_INCOMING_REGNUM
);
1668 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1671 ASM_OUTPUT_REG_PUSH (file
, STRUCT_VALUE_REGNUM
);
1676 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1678 ASM_OUTPUT_REG_PUSH (file
, STATIC_CHAIN_INCOMING_REGNUM
);
1680 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1683 ASM_OUTPUT_REG_PUSH (file
, STATIC_CHAIN_REGNUM
);
1688 FUNCTION_PROFILER (file
, profile_label_no
);
1690 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1692 ASM_OUTPUT_REG_POP (file
, STATIC_CHAIN_INCOMING_REGNUM
);
1694 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1697 ASM_OUTPUT_REG_POP (file
, STATIC_CHAIN_REGNUM
);
1702 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1704 ASM_OUTPUT_REG_POP (file
, STRUCT_VALUE_INCOMING_REGNUM
);
1706 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1709 ASM_OUTPUT_REG_POP (file
, STRUCT_VALUE_REGNUM
);
1715 /* Output assembler code for the end of a function.
1716 For clarity, args are same as those of `final_start_function'
1717 even though not all of them are needed. */
1720 final_end_function (first
, file
, optimize
)
1727 fputs (ASM_APP_OFF
, file
);
1731 #ifdef SDB_DEBUGGING_INFO
1732 if (write_symbols
== SDB_DEBUG
)
1733 sdbout_end_function (high_function_linenum
);
1736 #ifdef DWARF_DEBUGGING_INFO
1737 if (write_symbols
== DWARF_DEBUG
)
1738 dwarfout_end_function ();
1741 #ifdef XCOFF_DEBUGGING_INFO
1742 if (write_symbols
== XCOFF_DEBUG
)
1743 xcoffout_end_function (file
, high_function_linenum
);
1746 #ifdef FUNCTION_EPILOGUE
1747 /* Finally, output the function epilogue:
1748 code to restore the stack frame and return to the caller. */
1749 FUNCTION_EPILOGUE (file
, get_frame_size ());
1752 #ifdef SDB_DEBUGGING_INFO
1753 if (write_symbols
== SDB_DEBUG
)
1754 sdbout_end_epilogue ();
1757 #ifdef DWARF_DEBUGGING_INFO
1758 if (write_symbols
== DWARF_DEBUG
)
1759 dwarfout_end_epilogue ();
1762 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1763 if (dwarf2out_do_frame ())
1764 dwarf2out_end_epilogue ();
1767 #ifdef XCOFF_DEBUGGING_INFO
1768 if (write_symbols
== XCOFF_DEBUG
)
1769 xcoffout_end_epilogue (file
);
1772 bb_func_label_num
= -1; /* not in function, nuke label # */
1774 /* If FUNCTION_EPILOGUE is not defined, then the function body
1775 itself contains return instructions wherever needed. */
1778 /* Add a block to the linked list that remembers the current line/file/function
1779 for basic block profiling. Emit the label in front of the basic block and
1780 the instructions that increment the count field. */
1786 struct bb_list
*ptr
= (struct bb_list
*) permalloc (sizeof (struct bb_list
));
1788 /* Add basic block to linked list. */
1790 ptr
->line_num
= last_linenum
;
1791 ptr
->file_label_num
= bb_file_label_num
;
1792 ptr
->func_label_num
= bb_func_label_num
;
1794 bb_tail
= &ptr
->next
;
1796 /* Enable the table of basic-block use counts
1797 to point at the code it applies to. */
1798 ASM_OUTPUT_INTERNAL_LABEL (file
, "LPB", count_basic_blocks
);
1800 /* Before first insn of this basic block, increment the
1801 count of times it was entered. */
1802 #ifdef BLOCK_PROFILER
1803 BLOCK_PROFILER (file
, count_basic_blocks
);
1810 count_basic_blocks
++;
1813 /* Add a string to be used for basic block profiling. */
1816 add_bb_string (string
, perm_p
)
1821 struct bb_str
*ptr
= 0;
1825 string
= "<unknown>";
1829 /* Allocate a new string if the current string isn't permanent. If
1830 the string is permanent search for the same string in other
1833 len
= strlen (string
) + 1;
1836 char *p
= (char *) permalloc (len
);
1837 bcopy (string
, p
, len
);
1841 for (ptr
= sbb_head
; ptr
!= (struct bb_str
*) 0; ptr
= ptr
->next
)
1842 if (ptr
->string
== string
)
1845 /* Allocate a new string block if we need to. */
1848 ptr
= (struct bb_str
*) permalloc (sizeof (*ptr
));
1851 ptr
->label_num
= sbb_label_num
++;
1852 ptr
->string
= string
;
1854 sbb_tail
= &ptr
->next
;
1857 return ptr
->label_num
;
1861 /* Output assembler code for some insns: all or part of a function.
1862 For description of args, see `final_start_function', above.
1864 PRESCAN is 1 if we are not really outputting,
1865 just scanning as if we were outputting.
1866 Prescanning deletes and rearranges insns just like ordinary output.
1867 PRESCAN is -2 if we are outputting after having prescanned.
1868 In this case, don't try to delete or rearrange insns
1869 because that has already been done.
1870 Prescanning is done only on certain machines. */
1873 final (first
, file
, optimize
, prescan
)
1883 last_ignored_compare
= 0;
1886 check_exception_handler_labels ();
1888 /* Make a map indicating which line numbers appear in this function.
1889 When producing SDB debugging info, delete troublesome line number
1890 notes from inlined functions in other files as well as duplicate
1891 line number notes. */
1892 #ifdef SDB_DEBUGGING_INFO
1893 if (write_symbols
== SDB_DEBUG
)
1896 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1897 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
1899 if ((RTX_INTEGRATED_P (insn
)
1900 && strcmp (NOTE_SOURCE_FILE (insn
), main_input_filename
) != 0)
1902 && NOTE_LINE_NUMBER (insn
) == NOTE_LINE_NUMBER (last
)
1903 && NOTE_SOURCE_FILE (insn
) == NOTE_SOURCE_FILE (last
)))
1905 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
1906 NOTE_SOURCE_FILE (insn
) = 0;
1910 if (NOTE_LINE_NUMBER (insn
) > max_line
)
1911 max_line
= NOTE_LINE_NUMBER (insn
);
1917 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1918 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > max_line
)
1919 max_line
= NOTE_LINE_NUMBER (insn
);
1922 line_note_exists
= (char *) oballoc (max_line
+ 1);
1923 bzero (line_note_exists
, max_line
+ 1);
1925 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1927 if (INSN_UID (insn
) > max_uid
) /* find largest UID */
1928 max_uid
= INSN_UID (insn
);
1929 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
1930 line_note_exists
[NOTE_LINE_NUMBER (insn
)] = 1;
1933 /* Initialize insn_eh_region table if eh is being used. */
1935 init_insn_eh_region (first
, max_uid
);
1941 /* Output the insns. */
1942 for (insn
= NEXT_INSN (first
); insn
;)
1944 #ifdef HAVE_ATTR_length
1945 insn_current_address
= insn_addresses
[INSN_UID (insn
)];
1947 insn
= final_scan_insn (insn
, file
, optimize
, prescan
, 0);
1950 /* Do basic-block profiling here
1951 if the last insn was a conditional branch. */
1952 if (profile_block_flag
&& new_block
)
1955 free_insn_eh_region ();
1958 /* The final scan for one insn, INSN.
1959 Args are same as in `final', except that INSN
1960 is the insn being scanned.
1961 Value returned is the next insn to be scanned.
1963 NOPEEPHOLES is the flag to disallow peephole processing (currently
1964 used for within delayed branch sequence output). */
1967 final_scan_insn (insn
, file
, optimize
, prescan
, nopeepholes
)
1981 /* Ignore deleted insns. These can occur when we split insns (due to a
1982 template of "#") while not optimizing. */
1983 if (INSN_DELETED_P (insn
))
1984 return NEXT_INSN (insn
);
1986 switch (GET_CODE (insn
))
1992 /* Align the beginning of a loop, for higher speed
1993 on certain machines. */
1995 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_LOOP_BEG
)
1996 break; /* This used to depend on optimize, but that was bogus. */
1997 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_LOOP_END
)
2000 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EH_REGION_BEG
2001 && ! exceptions_via_longjmp
)
2003 ASM_OUTPUT_INTERNAL_LABEL (file
, "LEHB", NOTE_BLOCK_NUMBER (insn
));
2004 #ifndef NEW_EH_MODEL
2005 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn
));
2007 #ifdef ASM_OUTPUT_EH_REGION_BEG
2008 ASM_OUTPUT_EH_REGION_BEG (file
, NOTE_BLOCK_NUMBER (insn
));
2013 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EH_REGION_END
2014 && ! exceptions_via_longjmp
)
2016 ASM_OUTPUT_INTERNAL_LABEL (file
, "LEHE", NOTE_BLOCK_NUMBER (insn
));
2018 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn
));
2020 #ifdef ASM_OUTPUT_EH_REGION_END
2021 ASM_OUTPUT_EH_REGION_END (file
, NOTE_BLOCK_NUMBER (insn
));
2026 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_PROLOGUE_END
)
2028 #ifdef FUNCTION_END_PROLOGUE
2029 FUNCTION_END_PROLOGUE (file
);
2031 profile_after_prologue (file
);
2035 #ifdef FUNCTION_BEGIN_EPILOGUE
2036 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EPILOGUE_BEG
)
2038 FUNCTION_BEGIN_EPILOGUE (file
);
2043 if (write_symbols
== NO_DEBUG
)
2045 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_FUNCTION_BEG
)
2047 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
2048 /* MIPS stabs require the parameter descriptions to be after the
2049 function entry point rather than before. */
2050 if (write_symbols
== SDB_DEBUG
)
2051 sdbout_begin_function (last_linenum
);
2054 #ifdef DWARF_DEBUGGING_INFO
2055 /* This outputs a marker where the function body starts, so it
2056 must be after the prologue. */
2057 if (write_symbols
== DWARF_DEBUG
)
2058 dwarfout_begin_function ();
2062 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_DELETED
)
2063 break; /* An insn that was "deleted" */
2066 fputs (ASM_APP_OFF
, file
);
2069 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_BEG
2070 && (debug_info_level
== DINFO_LEVEL_NORMAL
2071 || debug_info_level
== DINFO_LEVEL_VERBOSE
2072 || write_symbols
== DWARF_DEBUG
2073 || write_symbols
== DWARF2_DEBUG
))
2075 /* Beginning of a symbol-block. Assign it a sequence number
2076 and push the number onto the stack PENDING_BLOCKS. */
2078 if (block_depth
== max_block_depth
)
2080 /* PENDING_BLOCKS is full; make it longer. */
2081 max_block_depth
*= 2;
2083 = (int *) xrealloc (pending_blocks
,
2084 max_block_depth
* sizeof (int));
2086 pending_blocks
[block_depth
++] = next_block_index
;
2088 high_block_linenum
= last_linenum
;
2090 /* Output debugging info about the symbol-block beginning. */
2092 #ifdef SDB_DEBUGGING_INFO
2093 if (write_symbols
== SDB_DEBUG
)
2094 sdbout_begin_block (file
, last_linenum
, next_block_index
);
2096 #ifdef XCOFF_DEBUGGING_INFO
2097 if (write_symbols
== XCOFF_DEBUG
)
2098 xcoffout_begin_block (file
, last_linenum
, next_block_index
);
2100 #ifdef DBX_DEBUGGING_INFO
2101 if (write_symbols
== DBX_DEBUG
)
2102 ASM_OUTPUT_INTERNAL_LABEL (file
, "LBB", next_block_index
);
2104 #ifdef DWARF_DEBUGGING_INFO
2105 if (write_symbols
== DWARF_DEBUG
)
2106 dwarfout_begin_block (next_block_index
);
2108 #ifdef DWARF2_DEBUGGING_INFO
2109 if (write_symbols
== DWARF2_DEBUG
)
2110 dwarf2out_begin_block (next_block_index
);
2115 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_END
2116 && (debug_info_level
== DINFO_LEVEL_NORMAL
2117 || debug_info_level
== DINFO_LEVEL_VERBOSE
2118 || write_symbols
== DWARF_DEBUG
2119 || write_symbols
== DWARF2_DEBUG
))
2121 /* End of a symbol-block. Pop its sequence number off
2122 PENDING_BLOCKS and output debugging info based on that. */
2126 #ifdef XCOFF_DEBUGGING_INFO
2127 if (write_symbols
== XCOFF_DEBUG
&& block_depth
>= 0)
2128 xcoffout_end_block (file
, high_block_linenum
,
2129 pending_blocks
[block_depth
]);
2131 #ifdef DBX_DEBUGGING_INFO
2132 if (write_symbols
== DBX_DEBUG
&& block_depth
>= 0)
2133 ASM_OUTPUT_INTERNAL_LABEL (file
, "LBE",
2134 pending_blocks
[block_depth
]);
2136 #ifdef SDB_DEBUGGING_INFO
2137 if (write_symbols
== SDB_DEBUG
&& block_depth
>= 0)
2138 sdbout_end_block (file
, high_block_linenum
,
2139 pending_blocks
[block_depth
]);
2141 #ifdef DWARF_DEBUGGING_INFO
2142 if (write_symbols
== DWARF_DEBUG
&& block_depth
>= 0)
2143 dwarfout_end_block (pending_blocks
[block_depth
]);
2145 #ifdef DWARF2_DEBUGGING_INFO
2146 if (write_symbols
== DWARF2_DEBUG
&& block_depth
>= 0)
2147 dwarf2out_end_block (pending_blocks
[block_depth
]);
2150 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_DELETED_LABEL
2151 && (debug_info_level
== DINFO_LEVEL_NORMAL
2152 || debug_info_level
== DINFO_LEVEL_VERBOSE
))
2154 #ifdef DWARF_DEBUGGING_INFO
2155 if (write_symbols
== DWARF_DEBUG
)
2156 dwarfout_label (insn
);
2158 #ifdef DWARF2_DEBUGGING_INFO
2159 if (write_symbols
== DWARF2_DEBUG
)
2160 dwarf2out_label (insn
);
2163 else if (NOTE_LINE_NUMBER (insn
) > 0)
2164 /* This note is a line-number. */
2168 #if 0 /* This is what we used to do. */
2169 output_source_line (file
, insn
);
2173 /* If there is anything real after this note,
2174 output it. If another line note follows, omit this one. */
2175 for (note
= NEXT_INSN (insn
); note
; note
= NEXT_INSN (note
))
2177 if (GET_CODE (note
) != NOTE
&& GET_CODE (note
) != CODE_LABEL
)
2179 /* These types of notes can be significant
2180 so make sure the preceding line number stays. */
2181 else if (GET_CODE (note
) == NOTE
2182 && (NOTE_LINE_NUMBER (note
) == NOTE_INSN_BLOCK_BEG
2183 || NOTE_LINE_NUMBER (note
) == NOTE_INSN_BLOCK_END
2184 || NOTE_LINE_NUMBER (note
) == NOTE_INSN_FUNCTION_BEG
))
2186 else if (GET_CODE (note
) == NOTE
&& NOTE_LINE_NUMBER (note
) > 0)
2188 /* Another line note follows; we can delete this note
2189 if no intervening line numbers have notes elsewhere. */
2191 for (num
= NOTE_LINE_NUMBER (insn
) + 1;
2192 num
< NOTE_LINE_NUMBER (note
);
2194 if (line_note_exists
[num
])
2197 if (num
>= NOTE_LINE_NUMBER (note
))
2203 /* Output this line note
2204 if it is the first or the last line note in a row. */
2206 output_source_line (file
, insn
);
2211 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2212 /* If we push arguments, we need to check all insns for stack
2214 if (dwarf2out_do_frame ())
2215 dwarf2out_frame_debug (insn
);
2220 /* The target port might emit labels in the output function for
2221 some insn, e.g. sh.c output_branchy_insn. */
2222 if (CODE_LABEL_NUMBER (insn
) <= max_labelno
)
2224 int align
= LABEL_TO_ALIGNMENT (insn
);
2226 if (align
&& NEXT_INSN (insn
))
2227 ASM_OUTPUT_ALIGN (file
, align
);
2234 #ifdef FINAL_PRESCAN_LABEL
2235 FINAL_PRESCAN_INSN (insn
, NULL_PTR
, 0);
2238 #ifdef SDB_DEBUGGING_INFO
2239 if (write_symbols
== SDB_DEBUG
&& LABEL_NAME (insn
))
2240 sdbout_label (insn
);
2242 #ifdef DWARF_DEBUGGING_INFO
2243 if (write_symbols
== DWARF_DEBUG
&& LABEL_NAME (insn
))
2244 dwarfout_label (insn
);
2246 #ifdef DWARF2_DEBUGGING_INFO
2247 if (write_symbols
== DWARF2_DEBUG
&& LABEL_NAME (insn
))
2248 dwarf2out_label (insn
);
2252 fputs (ASM_APP_OFF
, file
);
2255 if (NEXT_INSN (insn
) != 0
2256 && GET_CODE (NEXT_INSN (insn
)) == JUMP_INSN
)
2258 rtx nextbody
= PATTERN (NEXT_INSN (insn
));
2260 /* If this label is followed by a jump-table,
2261 make sure we put the label in the read-only section. Also
2262 possibly write the label and jump table together. */
2264 if (GET_CODE (nextbody
) == ADDR_VEC
2265 || GET_CODE (nextbody
) == ADDR_DIFF_VEC
)
2267 #ifndef JUMP_TABLES_IN_TEXT_SECTION
2268 readonly_data_section ();
2269 #ifdef READONLY_DATA_SECTION
2270 ASM_OUTPUT_ALIGN (file
,
2271 exact_log2 (BIGGEST_ALIGNMENT
2273 #endif /* READONLY_DATA_SECTION */
2274 #else /* JUMP_TABLES_IN_TEXT_SECTION */
2275 function_section (current_function_decl
);
2276 #endif /* JUMP_TABLES_IN_TEXT_SECTION */
2277 #ifdef ASM_OUTPUT_CASE_LABEL
2278 ASM_OUTPUT_CASE_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
),
2281 ASM_OUTPUT_INTERNAL_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
2287 ASM_OUTPUT_INTERNAL_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
2292 register rtx body
= PATTERN (insn
);
2293 int insn_code_number
;
2299 /* An INSN, JUMP_INSN or CALL_INSN.
2300 First check for special kinds that recog doesn't recognize. */
2302 if (GET_CODE (body
) == USE
/* These are just declarations */
2303 || GET_CODE (body
) == CLOBBER
)
2307 /* If there is a REG_CC_SETTER note on this insn, it means that
2308 the setting of the condition code was done in the delay slot
2309 of the insn that branched here. So recover the cc status
2310 from the insn that set it. */
2312 note
= find_reg_note (insn
, REG_CC_SETTER
, NULL_RTX
);
2315 NOTICE_UPDATE_CC (PATTERN (XEXP (note
, 0)), XEXP (note
, 0));
2316 cc_prev_status
= cc_status
;
2320 /* Detect insns that are really jump-tables
2321 and output them as such. */
2323 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
2325 register int vlen
, idx
;
2332 fputs (ASM_APP_OFF
, file
);
2336 vlen
= XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
);
2337 for (idx
= 0; idx
< vlen
; idx
++)
2339 if (GET_CODE (body
) == ADDR_VEC
)
2341 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2342 ASM_OUTPUT_ADDR_VEC_ELT
2343 (file
, CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 0, idx
), 0)));
2350 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2351 ASM_OUTPUT_ADDR_DIFF_ELT
2354 CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 1, idx
), 0)),
2355 CODE_LABEL_NUMBER (XEXP (XEXP (body
, 0), 0)));
2361 #ifdef ASM_OUTPUT_CASE_END
2362 ASM_OUTPUT_CASE_END (file
,
2363 CODE_LABEL_NUMBER (PREV_INSN (insn
)),
2367 function_section (current_function_decl
);
2372 /* Do basic-block profiling when we reach a new block.
2373 Done here to avoid jump tables. */
2374 if (profile_block_flag
&& new_block
)
2377 if (GET_CODE (body
) == ASM_INPUT
)
2379 /* There's no telling what that did to the condition codes. */
2385 fputs (ASM_APP_ON
, file
);
2388 fprintf (asm_out_file
, "\t%s\n", XSTR (body
, 0));
2392 /* Detect `asm' construct with operands. */
2393 if (asm_noperands (body
) >= 0)
2395 unsigned int noperands
= asm_noperands (body
);
2396 rtx
*ops
= (rtx
*) alloca (noperands
* sizeof (rtx
));
2399 /* There's no telling what that did to the condition codes. */
2406 fputs (ASM_APP_ON
, file
);
2410 /* Get out the operand values. */
2411 string
= decode_asm_operands (body
, ops
, NULL_PTR
,
2412 NULL_PTR
, NULL_PTR
);
2413 /* Inhibit aborts on what would otherwise be compiler bugs. */
2414 insn_noperands
= noperands
;
2415 this_is_asm_operands
= insn
;
2417 /* Output the insn using them. */
2418 output_asm_insn (string
, ops
);
2419 this_is_asm_operands
= 0;
2423 if (prescan
<= 0 && app_on
)
2425 fputs (ASM_APP_OFF
, file
);
2429 if (GET_CODE (body
) == SEQUENCE
)
2431 /* A delayed-branch sequence */
2437 final_sequence
= body
;
2439 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2440 force the restoration of a comparison that was previously
2441 thought unnecessary. If that happens, cancel this sequence
2442 and cause that insn to be restored. */
2444 next
= final_scan_insn (XVECEXP (body
, 0, 0), file
, 0, prescan
, 1);
2445 if (next
!= XVECEXP (body
, 0, 1))
2451 for (i
= 1; i
< XVECLEN (body
, 0); i
++)
2453 rtx insn
= XVECEXP (body
, 0, i
);
2454 rtx next
= NEXT_INSN (insn
);
2455 /* We loop in case any instruction in a delay slot gets
2458 insn
= final_scan_insn (insn
, file
, 0, prescan
, 1);
2459 while (insn
!= next
);
2461 #ifdef DBR_OUTPUT_SEQEND
2462 DBR_OUTPUT_SEQEND (file
);
2466 /* If the insn requiring the delay slot was a CALL_INSN, the
2467 insns in the delay slot are actually executed before the
2468 called function. Hence we don't preserve any CC-setting
2469 actions in these insns and the CC must be marked as being
2470 clobbered by the function. */
2471 if (GET_CODE (XVECEXP (body
, 0, 0)) == CALL_INSN
)
2476 /* Following a conditional branch sequence, we have a new basic
2478 if (profile_block_flag
)
2480 rtx insn
= XVECEXP (body
, 0, 0);
2481 rtx body
= PATTERN (insn
);
2483 if ((GET_CODE (insn
) == JUMP_INSN
&& GET_CODE (body
) == SET
2484 && GET_CODE (SET_SRC (body
)) != LABEL_REF
)
2485 || (GET_CODE (insn
) == JUMP_INSN
2486 && GET_CODE (body
) == PARALLEL
2487 && GET_CODE (XVECEXP (body
, 0, 0)) == SET
2488 && GET_CODE (SET_SRC (XVECEXP (body
, 0, 0))) != LABEL_REF
))
2494 /* We have a real machine instruction as rtl. */
2496 body
= PATTERN (insn
);
2499 set
= single_set(insn
);
2501 /* Check for redundant test and compare instructions
2502 (when the condition codes are already set up as desired).
2503 This is done only when optimizing; if not optimizing,
2504 it should be possible for the user to alter a variable
2505 with the debugger in between statements
2506 and the next statement should reexamine the variable
2507 to compute the condition codes. */
2512 rtx set
= single_set(insn
);
2516 && GET_CODE (SET_DEST (set
)) == CC0
2517 && insn
!= last_ignored_compare
)
2519 if (GET_CODE (SET_SRC (set
)) == SUBREG
)
2520 SET_SRC (set
) = alter_subreg (SET_SRC (set
));
2521 else if (GET_CODE (SET_SRC (set
)) == COMPARE
)
2523 if (GET_CODE (XEXP (SET_SRC (set
), 0)) == SUBREG
)
2524 XEXP (SET_SRC (set
), 0)
2525 = alter_subreg (XEXP (SET_SRC (set
), 0));
2526 if (GET_CODE (XEXP (SET_SRC (set
), 1)) == SUBREG
)
2527 XEXP (SET_SRC (set
), 1)
2528 = alter_subreg (XEXP (SET_SRC (set
), 1));
2530 if ((cc_status
.value1
!= 0
2531 && rtx_equal_p (SET_SRC (set
), cc_status
.value1
))
2532 || (cc_status
.value2
!= 0
2533 && rtx_equal_p (SET_SRC (set
), cc_status
.value2
)))
2535 /* Don't delete insn if it has an addressing side-effect. */
2536 if (! FIND_REG_INC_NOTE (insn
, 0)
2537 /* or if anything in it is volatile. */
2538 && ! volatile_refs_p (PATTERN (insn
)))
2540 /* We don't really delete the insn; just ignore it. */
2541 last_ignored_compare
= insn
;
2549 /* Following a conditional branch, we have a new basic block.
2550 But if we are inside a sequence, the new block starts after the
2551 last insn of the sequence. */
2552 if (profile_block_flag
&& final_sequence
== 0
2553 && ((GET_CODE (insn
) == JUMP_INSN
&& GET_CODE (body
) == SET
2554 && GET_CODE (SET_SRC (body
)) != LABEL_REF
)
2555 || (GET_CODE (insn
) == JUMP_INSN
&& GET_CODE (body
) == PARALLEL
2556 && GET_CODE (XVECEXP (body
, 0, 0)) == SET
2557 && GET_CODE (SET_SRC (XVECEXP (body
, 0, 0))) != LABEL_REF
)))
2561 /* Don't bother outputting obvious no-ops, even without -O.
2562 This optimization is fast and doesn't interfere with debugging.
2563 Don't do this if the insn is in a delay slot, since this
2564 will cause an improper number of delay insns to be written. */
2565 if (final_sequence
== 0
2567 && GET_CODE (insn
) == INSN
&& GET_CODE (body
) == SET
2568 && GET_CODE (SET_SRC (body
)) == REG
2569 && GET_CODE (SET_DEST (body
)) == REG
2570 && REGNO (SET_SRC (body
)) == REGNO (SET_DEST (body
)))
2575 /* If this is a conditional branch, maybe modify it
2576 if the cc's are in a nonstandard state
2577 so that it accomplishes the same thing that it would
2578 do straightforwardly if the cc's were set up normally. */
2580 if (cc_status
.flags
!= 0
2581 && GET_CODE (insn
) == JUMP_INSN
2582 && GET_CODE (body
) == SET
2583 && SET_DEST (body
) == pc_rtx
2584 && GET_CODE (SET_SRC (body
)) == IF_THEN_ELSE
2585 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body
), 0))) == '<'
2586 && XEXP (XEXP (SET_SRC (body
), 0), 0) == cc0_rtx
2587 /* This is done during prescan; it is not done again
2588 in final scan when prescan has been done. */
2591 /* This function may alter the contents of its argument
2592 and clear some of the cc_status.flags bits.
2593 It may also return 1 meaning condition now always true
2594 or -1 meaning condition now always false
2595 or 2 meaning condition nontrivial but altered. */
2596 register int result
= alter_cond (XEXP (SET_SRC (body
), 0));
2597 /* If condition now has fixed value, replace the IF_THEN_ELSE
2598 with its then-operand or its else-operand. */
2600 SET_SRC (body
) = XEXP (SET_SRC (body
), 1);
2602 SET_SRC (body
) = XEXP (SET_SRC (body
), 2);
2604 /* The jump is now either unconditional or a no-op.
2605 If it has become a no-op, don't try to output it.
2606 (It would not be recognized.) */
2607 if (SET_SRC (body
) == pc_rtx
)
2609 PUT_CODE (insn
, NOTE
);
2610 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
2611 NOTE_SOURCE_FILE (insn
) = 0;
2614 else if (GET_CODE (SET_SRC (body
)) == RETURN
)
2615 /* Replace (set (pc) (return)) with (return). */
2616 PATTERN (insn
) = body
= SET_SRC (body
);
2618 /* Rerecognize the instruction if it has changed. */
2620 INSN_CODE (insn
) = -1;
2623 /* Make same adjustments to instructions that examine the
2624 condition codes without jumping and instructions that
2625 handle conditional moves (if this machine has either one). */
2627 if (cc_status
.flags
!= 0
2630 rtx cond_rtx
, then_rtx
, else_rtx
;
2632 if (GET_CODE (insn
) != JUMP_INSN
2633 && GET_CODE (SET_SRC (set
)) == IF_THEN_ELSE
)
2635 cond_rtx
= XEXP (SET_SRC (set
), 0);
2636 then_rtx
= XEXP (SET_SRC (set
), 1);
2637 else_rtx
= XEXP (SET_SRC (set
), 2);
2641 cond_rtx
= SET_SRC (set
);
2642 then_rtx
= const_true_rtx
;
2643 else_rtx
= const0_rtx
;
2646 switch (GET_CODE (cond_rtx
))
2659 register int result
;
2660 if (XEXP (cond_rtx
, 0) != cc0_rtx
)
2662 result
= alter_cond (cond_rtx
);
2664 validate_change (insn
, &SET_SRC (set
), then_rtx
, 0);
2665 else if (result
== -1)
2666 validate_change (insn
, &SET_SRC (set
), else_rtx
, 0);
2667 else if (result
== 2)
2668 INSN_CODE (insn
) = -1;
2669 if (SET_DEST (set
) == SET_SRC (set
))
2671 PUT_CODE (insn
, NOTE
);
2672 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
2673 NOTE_SOURCE_FILE (insn
) = 0;
2685 /* Do machine-specific peephole optimizations if desired. */
2687 if (optimize
&& !flag_no_peephole
&& !nopeepholes
)
2689 rtx next
= peephole (insn
);
2690 /* When peepholing, if there were notes within the peephole,
2691 emit them before the peephole. */
2692 if (next
!= 0 && next
!= NEXT_INSN (insn
))
2694 rtx prev
= PREV_INSN (insn
);
2697 for (note
= NEXT_INSN (insn
); note
!= next
;
2698 note
= NEXT_INSN (note
))
2699 final_scan_insn (note
, file
, optimize
, prescan
, nopeepholes
);
2701 /* In case this is prescan, put the notes
2702 in proper position for later rescan. */
2703 note
= NEXT_INSN (insn
);
2704 PREV_INSN (note
) = prev
;
2705 NEXT_INSN (prev
) = note
;
2706 NEXT_INSN (PREV_INSN (next
)) = insn
;
2707 PREV_INSN (insn
) = PREV_INSN (next
);
2708 NEXT_INSN (insn
) = next
;
2709 PREV_INSN (next
) = insn
;
2712 /* PEEPHOLE might have changed this. */
2713 body
= PATTERN (insn
);
2716 /* Try to recognize the instruction.
2717 If successful, verify that the operands satisfy the
2718 constraints for the instruction. Crash if they don't,
2719 since `reload' should have changed them so that they do. */
2721 insn_code_number
= recog_memoized (insn
);
2722 insn_extract (insn
);
2723 for (i
= 0; i
< insn_n_operands
[insn_code_number
]; i
++)
2725 if (GET_CODE (recog_operand
[i
]) == SUBREG
)
2726 recog_operand
[i
] = alter_subreg (recog_operand
[i
]);
2727 else if (GET_CODE (recog_operand
[i
]) == PLUS
2728 || GET_CODE (recog_operand
[i
]) == MULT
)
2729 recog_operand
[i
] = walk_alter_subreg (recog_operand
[i
]);
2732 for (i
= 0; i
< insn_n_dups
[insn_code_number
]; i
++)
2734 if (GET_CODE (*recog_dup_loc
[i
]) == SUBREG
)
2735 *recog_dup_loc
[i
] = alter_subreg (*recog_dup_loc
[i
]);
2736 else if (GET_CODE (*recog_dup_loc
[i
]) == PLUS
2737 || GET_CODE (*recog_dup_loc
[i
]) == MULT
)
2738 *recog_dup_loc
[i
] = walk_alter_subreg (*recog_dup_loc
[i
]);
2741 #ifdef REGISTER_CONSTRAINTS
2742 if (! constrain_operands (insn_code_number
, 1))
2743 fatal_insn_not_found (insn
);
2746 /* Some target machines need to prescan each insn before
2749 #ifdef FINAL_PRESCAN_INSN
2750 FINAL_PRESCAN_INSN (insn
, recog_operand
,
2751 insn_n_operands
[insn_code_number
]);
2755 cc_prev_status
= cc_status
;
2757 /* Update `cc_status' for this instruction.
2758 The instruction's output routine may change it further.
2759 If the output routine for a jump insn needs to depend
2760 on the cc status, it should look at cc_prev_status. */
2762 NOTICE_UPDATE_CC (body
, insn
);
2767 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
2768 /* If we push arguments, we want to know where the calls are. */
2769 if (GET_CODE (insn
) == CALL_INSN
&& dwarf2out_do_frame ())
2770 dwarf2out_frame_debug (insn
);
2773 /* If the proper template needs to be chosen by some C code,
2774 run that code and get the real template. */
2776 template = insn_template
[insn_code_number
];
2779 template = (*insn_outfun
[insn_code_number
]) (recog_operand
, insn
);
2781 /* If the C code returns 0, it means that it is a jump insn
2782 which follows a deleted test insn, and that test insn
2783 needs to be reinserted. */
2786 if (prev_nonnote_insn (insn
) != last_ignored_compare
)
2789 return prev_nonnote_insn (insn
);
2793 /* If the template is the string "#", it means that this insn must
2795 if (template[0] == '#' && template[1] == '\0')
2797 rtx
new = try_split (body
, insn
, 0);
2799 /* If we didn't split the insn, go away. */
2800 if (new == insn
&& PATTERN (new) == body
)
2801 fatal_insn ("Could not split insn", insn
);
2803 #ifdef HAVE_ATTR_length
2804 /* This instruction should have been split in shorten_branches,
2805 to ensure that we would have valid length info for the
2817 /* Output assembler code from the template. */
2819 output_asm_insn (template, recog_operand
);
2821 #if defined (DWARF2_UNWIND_INFO)
2822 #if !defined (ACCUMULATE_OUTGOING_ARGS)
2823 /* If we push arguments, we need to check all insns for stack
2825 if (GET_CODE (insn
) == INSN
&& dwarf2out_do_frame ())
2826 dwarf2out_frame_debug (insn
);
2828 #if defined (HAVE_prologue)
2829 /* If this insn is part of the prologue, emit DWARF v2
2831 if (RTX_FRAME_RELATED_P (insn
) && dwarf2out_do_frame ())
2832 dwarf2out_frame_debug (insn
);
2838 /* It's not at all clear why we did this and doing so interferes
2839 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2842 /* Mark this insn as having been output. */
2843 INSN_DELETED_P (insn
) = 1;
2849 return NEXT_INSN (insn
);
2852 /* Output debugging info to the assembler file FILE
2853 based on the NOTE-insn INSN, assumed to be a line number. */
2856 output_source_line (file
, insn
)
2860 register char *filename
= NOTE_SOURCE_FILE (insn
);
2862 /* Remember filename for basic block profiling.
2863 Filenames are allocated on the permanent obstack
2864 or are passed in ARGV, so we don't have to save
2867 if (profile_block_flag
&& last_filename
!= filename
)
2868 bb_file_label_num
= add_bb_string (filename
, TRUE
);
2870 last_filename
= filename
;
2871 last_linenum
= NOTE_LINE_NUMBER (insn
);
2872 high_block_linenum
= MAX (last_linenum
, high_block_linenum
);
2873 high_function_linenum
= MAX (last_linenum
, high_function_linenum
);
2875 if (write_symbols
!= NO_DEBUG
)
2877 #ifdef SDB_DEBUGGING_INFO
2878 if (write_symbols
== SDB_DEBUG
2879 #if 0 /* People like having line numbers even in wrong file! */
2880 /* COFF can't handle multiple source files--lose, lose. */
2881 && !strcmp (filename
, main_input_filename
)
2883 /* COFF relative line numbers must be positive. */
2884 && last_linenum
> sdb_begin_function_line
)
2886 #ifdef ASM_OUTPUT_SOURCE_LINE
2887 ASM_OUTPUT_SOURCE_LINE (file
, last_linenum
);
2889 fprintf (file
, "\t.ln\t%d\n",
2890 ((sdb_begin_function_line
> -1)
2891 ? last_linenum
- sdb_begin_function_line
: 1));
2896 #if defined (DBX_DEBUGGING_INFO)
2897 if (write_symbols
== DBX_DEBUG
)
2898 dbxout_source_line (file
, filename
, NOTE_LINE_NUMBER (insn
));
2901 #if defined (XCOFF_DEBUGGING_INFO)
2902 if (write_symbols
== XCOFF_DEBUG
)
2903 xcoffout_source_line (file
, filename
, insn
);
2906 #ifdef DWARF_DEBUGGING_INFO
2907 if (write_symbols
== DWARF_DEBUG
)
2908 dwarfout_line (filename
, NOTE_LINE_NUMBER (insn
));
2911 #ifdef DWARF2_DEBUGGING_INFO
2912 if (write_symbols
== DWARF2_DEBUG
)
2913 dwarf2out_line (filename
, NOTE_LINE_NUMBER (insn
));
2918 /* If X is a SUBREG, replace it with a REG or a MEM,
2919 based on the thing it is a subreg of. */
2925 register rtx y
= SUBREG_REG (x
);
2927 if (GET_CODE (y
) == SUBREG
)
2928 y
= alter_subreg (y
);
2930 /* If reload is operating, we may be replacing inside this SUBREG.
2931 Check for that and make a new one if so. */
2932 if (reload_in_progress
&& find_replacement (&SUBREG_REG (x
)) != 0)
2935 if (GET_CODE (y
) == REG
)
2937 /* If the word size is larger than the size of this register,
2938 adjust the register number to compensate. */
2939 /* ??? Note that this just catches stragglers created by/for
2940 integrate. It would be better if we either caught these
2941 earlier, or kept _all_ subregs until now and eliminate
2942 gen_lowpart and friends. */
2945 #ifdef ALTER_HARD_SUBREG
2946 REGNO (x
) = ALTER_HARD_SUBREG(GET_MODE (x
), SUBREG_WORD (x
),
2947 GET_MODE (y
), REGNO (y
));
2949 REGNO (x
) = REGNO (y
) + SUBREG_WORD (x
);
2952 else if (GET_CODE (y
) == MEM
)
2954 register int offset
= SUBREG_WORD (x
) * UNITS_PER_WORD
;
2955 if (BYTES_BIG_ENDIAN
)
2956 offset
-= (MIN (UNITS_PER_WORD
, GET_MODE_SIZE (GET_MODE (x
)))
2957 - MIN (UNITS_PER_WORD
, GET_MODE_SIZE (GET_MODE (y
))));
2959 MEM_VOLATILE_P (x
) = MEM_VOLATILE_P (y
);
2960 XEXP (x
, 0) = plus_constant (XEXP (y
, 0), offset
);
2966 /* Do alter_subreg on all the SUBREGs contained in X. */
2969 walk_alter_subreg (x
)
2972 switch (GET_CODE (x
))
2976 XEXP (x
, 0) = walk_alter_subreg (XEXP (x
, 0));
2977 XEXP (x
, 1) = walk_alter_subreg (XEXP (x
, 1));
2981 XEXP (x
, 0) = walk_alter_subreg (XEXP (x
, 0));
2985 return alter_subreg (x
);
2996 /* Given BODY, the body of a jump instruction, alter the jump condition
2997 as required by the bits that are set in cc_status.flags.
2998 Not all of the bits there can be handled at this level in all cases.
3000 The value is normally 0.
3001 1 means that the condition has become always true.
3002 -1 means that the condition has become always false.
3003 2 means that COND has been altered. */
3011 if (cc_status
.flags
& CC_REVERSED
)
3014 PUT_CODE (cond
, swap_condition (GET_CODE (cond
)));
3017 if (cc_status
.flags
& CC_INVERTED
)
3020 PUT_CODE (cond
, reverse_condition (GET_CODE (cond
)));
3023 if (cc_status
.flags
& CC_NOT_POSITIVE
)
3024 switch (GET_CODE (cond
))
3029 /* Jump becomes unconditional. */
3035 /* Jump becomes no-op. */
3039 PUT_CODE (cond
, EQ
);
3044 PUT_CODE (cond
, NE
);
3052 if (cc_status
.flags
& CC_NOT_NEGATIVE
)
3053 switch (GET_CODE (cond
))
3057 /* Jump becomes unconditional. */
3062 /* Jump becomes no-op. */
3067 PUT_CODE (cond
, EQ
);
3073 PUT_CODE (cond
, NE
);
3081 if (cc_status
.flags
& CC_NO_OVERFLOW
)
3082 switch (GET_CODE (cond
))
3085 /* Jump becomes unconditional. */
3089 PUT_CODE (cond
, EQ
);
3094 PUT_CODE (cond
, NE
);
3099 /* Jump becomes no-op. */
3106 if (cc_status
.flags
& (CC_Z_IN_NOT_N
| CC_Z_IN_N
))
3107 switch (GET_CODE (cond
))
3113 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? GE
: LT
);
3118 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? LT
: GE
);
3123 if (cc_status
.flags
& CC_NOT_SIGNED
)
3124 /* The flags are valid if signed condition operators are converted
3126 switch (GET_CODE (cond
))
3129 PUT_CODE (cond
, LEU
);
3134 PUT_CODE (cond
, LTU
);
3139 PUT_CODE (cond
, GTU
);
3144 PUT_CODE (cond
, GEU
);
3156 /* Report inconsistency between the assembler template and the operands.
3157 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3160 output_operand_lossage (str
)
3163 if (this_is_asm_operands
)
3164 error_for_asm (this_is_asm_operands
, "invalid `asm': %s", str
);
3166 fatal ("Internal compiler error, output_operand_lossage `%s'", str
);
3169 /* Output of assembler code from a template, and its subroutines. */
3171 /* Output text from TEMPLATE to the assembler output file,
3172 obeying %-directions to substitute operands taken from
3173 the vector OPERANDS.
3175 %N (for N a digit) means print operand N in usual manner.
3176 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3177 and print the label name with no punctuation.
3178 %cN means require operand N to be a constant
3179 and print the constant expression with no punctuation.
3180 %aN means expect operand N to be a memory address
3181 (not a memory reference!) and print a reference
3183 %nN means expect operand N to be a constant
3184 and print a constant expression for minus the value
3185 of the operand, with no other punctuation. */
3190 if (flag_print_asm_name
)
3192 /* Annotate the assembly with a comment describing the pattern and
3193 alternative used. */
3196 register int num
= INSN_CODE (debug_insn
);
3197 fprintf (asm_out_file
, " %s %d %s",
3198 ASM_COMMENT_START
, INSN_UID (debug_insn
), insn_name
[num
]);
3199 if (insn_n_alternatives
[num
] > 1)
3200 fprintf (asm_out_file
, "/%d", which_alternative
+ 1);
3202 /* Clear this so only the first assembler insn
3203 of any rtl insn will get the special comment for -dp. */
3210 output_asm_insn (template, operands
)
3217 /* An insn may return a null string template
3218 in a case where no assembler code is needed. */
3223 putc ('\t', asm_out_file
);
3225 #ifdef ASM_OUTPUT_OPCODE
3226 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3234 putc (c
, asm_out_file
);
3235 #ifdef ASM_OUTPUT_OPCODE
3236 while ((c
= *p
) == '\t')
3238 putc (c
, asm_out_file
);
3241 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3245 #ifdef ASSEMBLER_DIALECT
3250 /* If we want the first dialect, do nothing. Otherwise, skip
3251 DIALECT_NUMBER of strings ending with '|'. */
3252 for (i
= 0; i
< dialect_number
; i
++)
3254 while (*p
&& *p
++ != '|')
3264 /* Skip to close brace. */
3265 while (*p
&& *p
++ != '}')
3274 /* %% outputs a single %. */
3278 putc (c
, asm_out_file
);
3280 /* %= outputs a number which is unique to each insn in the entire
3281 compilation. This is useful for making local labels that are
3282 referred to more than once in a given insn. */
3286 fprintf (asm_out_file
, "%d", insn_counter
);
3288 /* % followed by a letter and some digits
3289 outputs an operand in a special way depending on the letter.
3290 Letters `acln' are implemented directly.
3291 Other letters are passed to `output_operand' so that
3292 the PRINT_OPERAND macro can define them. */
3293 else if ((*p
>= 'a' && *p
<= 'z')
3294 || (*p
>= 'A' && *p
<= 'Z'))
3299 if (! (*p
>= '0' && *p
<= '9'))
3300 output_operand_lossage ("operand number missing after %-letter");
3301 else if (this_is_asm_operands
&& (c
< 0 || (unsigned int) c
>= insn_noperands
))
3302 output_operand_lossage ("operand number out of range");
3303 else if (letter
== 'l')
3304 output_asm_label (operands
[c
]);
3305 else if (letter
== 'a')
3306 output_address (operands
[c
]);
3307 else if (letter
== 'c')
3309 if (CONSTANT_ADDRESS_P (operands
[c
]))
3310 output_addr_const (asm_out_file
, operands
[c
]);
3312 output_operand (operands
[c
], 'c');
3314 else if (letter
== 'n')
3316 if (GET_CODE (operands
[c
]) == CONST_INT
)
3317 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
,
3318 - INTVAL (operands
[c
]));
3321 putc ('-', asm_out_file
);
3322 output_addr_const (asm_out_file
, operands
[c
]);
3326 output_operand (operands
[c
], letter
);
3328 while ((c
= *p
) >= '0' && c
<= '9') p
++;
3330 /* % followed by a digit outputs an operand the default way. */
3331 else if (*p
>= '0' && *p
<= '9')
3334 if (this_is_asm_operands
&& (c
< 0 || (unsigned int) c
>= insn_noperands
))
3335 output_operand_lossage ("operand number out of range");
3337 output_operand (operands
[c
], 0);
3338 while ((c
= *p
) >= '0' && c
<= '9') p
++;
3340 /* % followed by punctuation: output something for that
3341 punctuation character alone, with no operand.
3342 The PRINT_OPERAND macro decides what is actually done. */
3343 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3344 else if (PRINT_OPERAND_PUNCT_VALID_P (*p
))
3345 output_operand (NULL_RTX
, *p
++);
3348 output_operand_lossage ("invalid %%-code");
3352 putc (c
, asm_out_file
);
3357 putc ('\n', asm_out_file
);
3360 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3363 output_asm_label (x
)
3368 if (GET_CODE (x
) == LABEL_REF
)
3369 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (XEXP (x
, 0)));
3370 else if (GET_CODE (x
) == CODE_LABEL
)
3371 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3373 output_operand_lossage ("`%l' operand isn't a label");
3375 assemble_name (asm_out_file
, buf
);
3378 /* Print operand X using machine-dependent assembler syntax.
3379 The macro PRINT_OPERAND is defined just to control this function.
3380 CODE is a non-digit that preceded the operand-number in the % spec,
3381 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3382 between the % and the digits.
3383 When CODE is a non-letter, X is 0.
3385 The meanings of the letters are machine-dependent and controlled
3386 by PRINT_OPERAND. */
3389 output_operand (x
, code
)
3393 if (x
&& GET_CODE (x
) == SUBREG
)
3394 x
= alter_subreg (x
);
3396 /* If X is a pseudo-register, abort now rather than writing trash to the
3399 if (x
&& GET_CODE (x
) == REG
&& REGNO (x
) >= FIRST_PSEUDO_REGISTER
)
3402 PRINT_OPERAND (asm_out_file
, x
, code
);
3405 /* Print a memory reference operand for address X
3406 using machine-dependent assembler syntax.
3407 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3413 walk_alter_subreg (x
);
3414 PRINT_OPERAND_ADDRESS (asm_out_file
, x
);
3417 /* Print an integer constant expression in assembler syntax.
3418 Addition and subtraction are the only arithmetic
3419 that may appear in these expressions. */
3422 output_addr_const (file
, x
)
3429 switch (GET_CODE (x
))
3439 assemble_name (file
, XSTR (x
, 0));
3443 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (XEXP (x
, 0)));
3444 assemble_name (file
, buf
);
3448 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
3449 assemble_name (file
, buf
);
3453 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, INTVAL (x
));
3457 /* This used to output parentheses around the expression,
3458 but that does not work on the 386 (either ATT or BSD assembler). */
3459 output_addr_const (file
, XEXP (x
, 0));
3463 if (GET_MODE (x
) == VOIDmode
)
3465 /* We can use %d if the number is one word and positive. */
3466 if (CONST_DOUBLE_HIGH (x
))
3467 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
3468 CONST_DOUBLE_HIGH (x
), CONST_DOUBLE_LOW (x
));
3469 else if (CONST_DOUBLE_LOW (x
) < 0)
3470 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
, CONST_DOUBLE_LOW (x
));
3472 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_DOUBLE_LOW (x
));
3475 /* We can't handle floating point constants;
3476 PRINT_OPERAND must handle them. */
3477 output_operand_lossage ("floating constant misused");
3481 /* Some assemblers need integer constants to appear last (eg masm). */
3482 if (GET_CODE (XEXP (x
, 0)) == CONST_INT
)
3484 output_addr_const (file
, XEXP (x
, 1));
3485 if (INTVAL (XEXP (x
, 0)) >= 0)
3486 fprintf (file
, "+");
3487 output_addr_const (file
, XEXP (x
, 0));
3491 output_addr_const (file
, XEXP (x
, 0));
3492 if (INTVAL (XEXP (x
, 1)) >= 0)
3493 fprintf (file
, "+");
3494 output_addr_const (file
, XEXP (x
, 1));
3499 /* Avoid outputting things like x-x or x+5-x,
3500 since some assemblers can't handle that. */
3501 x
= simplify_subtraction (x
);
3502 if (GET_CODE (x
) != MINUS
)
3505 output_addr_const (file
, XEXP (x
, 0));
3506 fprintf (file
, "-");
3507 if (GET_CODE (XEXP (x
, 1)) == CONST_INT
3508 && INTVAL (XEXP (x
, 1)) < 0)
3510 fprintf (file
, ASM_OPEN_PAREN
);
3511 output_addr_const (file
, XEXP (x
, 1));
3512 fprintf (file
, ASM_CLOSE_PAREN
);
3515 output_addr_const (file
, XEXP (x
, 1));
3520 output_addr_const (file
, XEXP (x
, 0));
3524 output_operand_lossage ("invalid expression as operand");
3528 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3529 %R prints the value of REGISTER_PREFIX.
3530 %L prints the value of LOCAL_LABEL_PREFIX.
3531 %U prints the value of USER_LABEL_PREFIX.
3532 %I prints the value of IMMEDIATE_PREFIX.
3533 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3534 Also supported are %d, %x, %s, %e, %f, %g and %%.
3536 We handle alternate assembler dialects here, just like output_asm_insn. */
3539 asm_fprintf
VPROTO((FILE *file
, char *p
, ...))
3549 VA_START (argptr
, p
);
3552 file
= va_arg (argptr
, FILE *);
3553 p
= va_arg (argptr
, char *);
3561 #ifdef ASSEMBLER_DIALECT
3566 /* If we want the first dialect, do nothing. Otherwise, skip
3567 DIALECT_NUMBER of strings ending with '|'. */
3568 for (i
= 0; i
< dialect_number
; i
++)
3570 while (*p
&& *p
++ != '|')
3580 /* Skip to close brace. */
3581 while (*p
&& *p
++ != '}')
3592 while ((c
>= '0' && c
<= '9') || c
== '.')
3600 fprintf (file
, "%%");
3603 case 'd': case 'i': case 'u':
3604 case 'x': case 'p': case 'X':
3608 fprintf (file
, buf
, va_arg (argptr
, int));
3612 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3613 but we do not check for those cases. It means that the value
3614 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3616 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3618 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3628 fprintf (file
, buf
, va_arg (argptr
, HOST_WIDE_INT
));
3635 fprintf (file
, buf
, va_arg (argptr
, long));
3643 fprintf (file
, buf
, va_arg (argptr
, double));
3649 fprintf (file
, buf
, va_arg (argptr
, char *));
3653 #ifdef ASM_OUTPUT_OPCODE
3654 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3659 #ifdef REGISTER_PREFIX
3660 fprintf (file
, "%s", REGISTER_PREFIX
);
3665 #ifdef IMMEDIATE_PREFIX
3666 fprintf (file
, "%s", IMMEDIATE_PREFIX
);
3671 #ifdef LOCAL_LABEL_PREFIX
3672 fprintf (file
, "%s", LOCAL_LABEL_PREFIX
);
3677 #ifdef USER_LABEL_PREFIX
3678 fprintf (file
, "%s", USER_LABEL_PREFIX
);
3692 /* Split up a CONST_DOUBLE or integer constant rtx
3693 into two rtx's for single words,
3694 storing in *FIRST the word that comes first in memory in the target
3695 and in *SECOND the other. */
3698 split_double (value
, first
, second
)
3700 rtx
*first
, *second
;
3702 if (GET_CODE (value
) == CONST_INT
)
3704 if (HOST_BITS_PER_WIDE_INT
>= (2 * BITS_PER_WORD
))
3706 /* In this case the CONST_INT holds both target words.
3707 Extract the bits from it into two word-sized pieces.
3708 Sign extend each half to HOST_WIDE_INT. */
3710 /* On machines where HOST_BITS_PER_WIDE_INT == BITS_PER_WORD
3711 the shift below will cause a compiler warning, even though
3712 this code won't be executed. So put the shift amounts in
3713 variables to avoid the warning. */
3714 int rshift
= HOST_BITS_PER_WIDE_INT
- BITS_PER_WORD
;
3715 int lshift
= HOST_BITS_PER_WIDE_INT
- 2 * BITS_PER_WORD
;
3717 low
= GEN_INT ((INTVAL (value
) << rshift
) >> rshift
);
3718 high
= GEN_INT ((INTVAL (value
) << lshift
) >> rshift
);
3719 if (WORDS_BIG_ENDIAN
)
3732 /* The rule for using CONST_INT for a wider mode
3733 is that we regard the value as signed.
3734 So sign-extend it. */
3735 rtx high
= (INTVAL (value
) < 0 ? constm1_rtx
: const0_rtx
);
3736 if (WORDS_BIG_ENDIAN
)
3748 else if (GET_CODE (value
) != CONST_DOUBLE
)
3750 if (WORDS_BIG_ENDIAN
)
3752 *first
= const0_rtx
;
3758 *second
= const0_rtx
;
3761 else if (GET_MODE (value
) == VOIDmode
3762 /* This is the old way we did CONST_DOUBLE integers. */
3763 || GET_MODE_CLASS (GET_MODE (value
)) == MODE_INT
)
3765 /* In an integer, the words are defined as most and least significant.
3766 So order them by the target's convention. */
3767 if (WORDS_BIG_ENDIAN
)
3769 *first
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3770 *second
= GEN_INT (CONST_DOUBLE_LOW (value
));
3774 *first
= GEN_INT (CONST_DOUBLE_LOW (value
));
3775 *second
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3780 #ifdef REAL_ARITHMETIC
3781 REAL_VALUE_TYPE r
; long l
[2];
3782 REAL_VALUE_FROM_CONST_DOUBLE (r
, value
);
3784 /* Note, this converts the REAL_VALUE_TYPE to the target's
3785 format, splits up the floating point double and outputs
3786 exactly 32 bits of it into each of l[0] and l[1] --
3787 not necessarily BITS_PER_WORD bits. */
3788 REAL_VALUE_TO_TARGET_DOUBLE (r
, l
);
3790 *first
= GEN_INT ((HOST_WIDE_INT
) l
[0]);
3791 *second
= GEN_INT ((HOST_WIDE_INT
) l
[1]);
3793 if ((HOST_FLOAT_FORMAT
!= TARGET_FLOAT_FORMAT
3794 || HOST_BITS_PER_WIDE_INT
!= BITS_PER_WORD
)
3795 && ! flag_pretend_float
)
3799 #ifdef HOST_WORDS_BIG_ENDIAN
3806 /* Host and target agree => no need to swap. */
3807 *first
= GEN_INT (CONST_DOUBLE_LOW (value
));
3808 *second
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3812 *second
= GEN_INT (CONST_DOUBLE_LOW (value
));
3813 *first
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3815 #endif /* no REAL_ARITHMETIC */
3819 /* Return nonzero if this function has no function calls. */
3826 if (profile_flag
|| profile_block_flag
|| profile_arc_flag
)
3829 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3831 if (GET_CODE (insn
) == CALL_INSN
)
3833 if (GET_CODE (insn
) == INSN
3834 && GET_CODE (PATTERN (insn
)) == SEQUENCE
3835 && GET_CODE (XVECEXP (PATTERN (insn
), 0, 0)) == CALL_INSN
)
3838 for (insn
= current_function_epilogue_delay_list
; insn
; insn
= XEXP (insn
, 1))
3840 if (GET_CODE (XEXP (insn
, 0)) == CALL_INSN
)
3842 if (GET_CODE (XEXP (insn
, 0)) == INSN
3843 && GET_CODE (PATTERN (XEXP (insn
, 0))) == SEQUENCE
3844 && GET_CODE (XVECEXP (PATTERN (XEXP (insn
, 0)), 0, 0)) == CALL_INSN
)
3851 /* On some machines, a function with no call insns
3852 can run faster if it doesn't create its own register window.
3853 When output, the leaf function should use only the "output"
3854 registers. Ordinarily, the function would be compiled to use
3855 the "input" registers to find its arguments; it is a candidate
3856 for leaf treatment if it uses only the "input" registers.
3857 Leaf function treatment means renumbering so the function
3858 uses the "output" registers instead. */
3860 #ifdef LEAF_REGISTERS
3862 static char permitted_reg_in_leaf_functions
[] = LEAF_REGISTERS
;
3864 /* Return 1 if this function uses only the registers that can be
3865 safely renumbered. */
3868 only_leaf_regs_used ()
3872 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
3873 if ((regs_ever_live
[i
] || global_regs
[i
])
3874 && ! permitted_reg_in_leaf_functions
[i
])
3877 if (current_function_uses_pic_offset_table
3878 && pic_offset_table_rtx
!= 0
3879 && GET_CODE (pic_offset_table_rtx
) == REG
3880 && ! permitted_reg_in_leaf_functions
[REGNO (pic_offset_table_rtx
)])
3886 /* Scan all instructions and renumber all registers into those
3887 available in leaf functions. */
3890 leaf_renumber_regs (first
)
3895 /* Renumber only the actual patterns.
3896 The reg-notes can contain frame pointer refs,
3897 and renumbering them could crash, and should not be needed. */
3898 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
3899 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3900 leaf_renumber_regs_insn (PATTERN (insn
));
3901 for (insn
= current_function_epilogue_delay_list
; insn
; insn
= XEXP (insn
, 1))
3902 if (GET_RTX_CLASS (GET_CODE (XEXP (insn
, 0))) == 'i')
3903 leaf_renumber_regs_insn (PATTERN (XEXP (insn
, 0)));
3906 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
3907 available in leaf functions. */
3910 leaf_renumber_regs_insn (in_rtx
)
3911 register rtx in_rtx
;
3914 register char *format_ptr
;
3919 /* Renumber all input-registers into output-registers.
3920 renumbered_regs would be 1 for an output-register;
3923 if (GET_CODE (in_rtx
) == REG
)
3927 /* Don't renumber the same reg twice. */
3931 newreg
= REGNO (in_rtx
);
3932 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
3933 to reach here as part of a REG_NOTE. */
3934 if (newreg
>= FIRST_PSEUDO_REGISTER
)
3939 newreg
= LEAF_REG_REMAP (newreg
);
3942 regs_ever_live
[REGNO (in_rtx
)] = 0;
3943 regs_ever_live
[newreg
] = 1;
3944 REGNO (in_rtx
) = newreg
;
3948 if (GET_RTX_CLASS (GET_CODE (in_rtx
)) == 'i')
3950 /* Inside a SEQUENCE, we find insns.
3951 Renumber just the patterns of these insns,
3952 just as we do for the top-level insns. */
3953 leaf_renumber_regs_insn (PATTERN (in_rtx
));
3957 format_ptr
= GET_RTX_FORMAT (GET_CODE (in_rtx
));
3959 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (in_rtx
)); i
++)
3960 switch (*format_ptr
++)
3963 leaf_renumber_regs_insn (XEXP (in_rtx
, i
));
3967 if (NULL
!= XVEC (in_rtx
, i
))
3969 for (j
= 0; j
< XVECLEN (in_rtx
, i
); j
++)
3970 leaf_renumber_regs_insn (XVECEXP (in_rtx
, i
, j
));