1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 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 in assembler by the target functions function_prologue and
45 function_epilogue. Those instructions never exist as rtl. */
54 #include "insn-config.h"
55 #include "insn-attr.h"
57 #include "conditions.h"
60 #include "hard-reg-set.h"
67 #include "basic-block.h"
71 #ifdef XCOFF_DEBUGGING_INFO
72 #include "xcoffout.h" /* Needed for external data
73 declarations for e.g. AIX 4.x. */
76 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
77 #include "dwarf2out.h"
80 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
81 null default for it to save conditionalization later. */
82 #ifndef CC_STATUS_INIT
83 #define CC_STATUS_INIT
86 /* How to start an assembler comment. */
87 #ifndef ASM_COMMENT_START
88 #define ASM_COMMENT_START ";#"
91 /* Is the given character a logical line separator for the assembler? */
92 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
93 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
96 #ifndef JUMP_TABLES_IN_TEXT_SECTION
97 #define JUMP_TABLES_IN_TEXT_SECTION 0
100 /* Last insn processed by final_scan_insn. */
101 static rtx debug_insn;
102 rtx current_output_insn;
104 /* Line number of last NOTE. */
105 static int last_linenum;
107 /* Highest line number in current block. */
108 static int high_block_linenum;
110 /* Likewise for function. */
111 static int high_function_linenum;
113 /* Filename of last NOTE. */
114 static const char *last_filename;
116 /* Number of basic blocks seen so far;
117 used if profile_block_flag is set. */
118 static int count_basic_blocks;
120 /* Number of instrumented arcs when profile_arc_flag is set. */
121 extern int count_instrumented_edges;
123 extern int length_unit_log; /* This is defined in insn-attrtab.c. */
125 /* Nonzero while outputting an `asm' with operands.
126 This means that inconsistencies are the user's fault, so don't abort.
127 The precise value is the insn being output, to pass to error_for_asm. */
128 static rtx this_is_asm_operands;
130 /* Number of operands of this insn, for an `asm' with operands. */
131 static unsigned int insn_noperands;
133 /* Compare optimization flag. */
135 static rtx last_ignored_compare = 0;
137 /* Flag indicating this insn is the start of a new basic block. */
139 static int new_block = 1;
141 /* Assign a unique number to each insn that is output.
142 This can be used to generate unique local labels. */
144 static int insn_counter = 0;
147 /* This variable contains machine-dependent flags (defined in tm.h)
148 set and examined by output routines
149 that describe how to interpret the condition codes properly. */
153 /* During output of an insn, this contains a copy of cc_status
154 from before the insn. */
156 CC_STATUS cc_prev_status;
159 /* Indexed by hardware reg number, is 1 if that register is ever
160 used in the current function.
162 In life_analysis, or in stupid_life_analysis, this is set
163 up to record the hard regs used explicitly. Reload adds
164 in the hard regs used for holding pseudo regs. Final uses
165 it to generate the code in the function prologue and epilogue
166 to save and restore registers as needed. */
168 char regs_ever_live[FIRST_PSEUDO_REGISTER];
170 /* Nonzero means current function must be given a frame pointer.
171 Set in stmt.c if anything is allocated on the stack there.
172 Set in reload1.c if anything is allocated on the stack there. */
174 int frame_pointer_needed;
176 /* Assign unique numbers to labels generated for profiling. */
178 int profile_label_no;
180 /* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen. */
182 static int block_depth;
184 /* Nonzero if have enabled APP processing of our assembler output. */
188 /* If we are outputting an insn sequence, this contains the sequence rtx.
193 #ifdef ASSEMBLER_DIALECT
195 /* Number of the assembler dialect to use, starting at 0. */
196 static int dialect_number;
199 /* Indexed by line number, nonzero if there is a note for that line. */
201 static char *line_note_exists;
203 #ifdef HAVE_conditional_execution
204 /* Nonnull if the insn currently being emitted was a COND_EXEC pattern. */
205 rtx current_insn_predicate;
208 /* Linked list to hold line numbers for each basic block. */
212 struct bb_list *next; /* pointer to next basic block */
213 int line_num; /* line number */
214 int file_label_num; /* LPBC<n> label # for stored filename */
215 int func_label_num; /* LPBC<n> label # for stored function name */
218 static struct bb_list *bb_head = 0; /* Head of basic block list */
219 static struct bb_list **bb_tail = &bb_head; /* Ptr to store next bb ptr */
220 static int bb_file_label_num = -1; /* Current label # for file */
221 static int bb_func_label_num = -1; /* Current label # for func */
223 /* Linked list to hold the strings for each file and function name output. */
227 struct bb_str *next; /* pointer to next string */
228 const char *string; /* string */
229 int label_num; /* label number */
230 int length; /* string length */
233 static struct bb_str *sbb_head = 0; /* Head of string list. */
234 static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */
235 static int sbb_label_num = 0; /* Last label used */
237 #ifdef HAVE_ATTR_length
238 static int asm_insn_count PARAMS ((rtx));
240 static void profile_function PARAMS ((FILE *));
241 static void profile_after_prologue PARAMS ((FILE *));
242 static void add_bb PARAMS ((FILE *));
243 static int add_bb_string PARAMS ((const char *, int));
244 static void notice_source_line PARAMS ((rtx));
245 static rtx walk_alter_subreg PARAMS ((rtx));
246 static void output_asm_name PARAMS ((void));
247 static void output_operand PARAMS ((rtx, int));
248 #ifdef LEAF_REGISTERS
249 static void leaf_renumber_regs PARAMS ((rtx));
252 static int alter_cond PARAMS ((rtx));
254 #ifndef ADDR_VEC_ALIGN
255 static int final_addr_vec_align PARAMS ((rtx));
257 #ifdef HAVE_ATTR_length
258 static int align_fuzz PARAMS ((rtx, rtx, int, unsigned));
261 /* Initialize data in final at the beginning of a compilation. */
264 init_final (filename)
265 const char *filename ATTRIBUTE_UNUSED;
270 #ifdef ASSEMBLER_DIALECT
271 dialect_number = ASSEMBLER_DIALECT;
275 /* Called at end of source file,
276 to output the block-profiling table for this entire compilation. */
280 const char *filename;
284 if (profile_block_flag || profile_arc_flag)
287 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
291 int long_bytes = LONG_TYPE_SIZE / BITS_PER_UNIT;
292 int gcov_type_bytes = GCOV_TYPE_SIZE / BITS_PER_UNIT;
293 int pointer_bytes = POINTER_SIZE / BITS_PER_UNIT;
294 unsigned int align2 = LONG_TYPE_SIZE;
296 if (profile_block_flag)
297 size = long_bytes * count_basic_blocks;
299 size = gcov_type_bytes * count_instrumented_edges;
302 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
303 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
304 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
306 /* ??? This _really_ ought to be done with a structure layout
307 and with assemble_constructor. If long_bytes != pointer_bytes
308 we'll be emitting unaligned data at some point. */
309 if (long_bytes != pointer_bytes)
314 /* Output the main header, of 11 words:
315 0: 1 if this file is initialized, else 0.
316 1: address of file name (LPBX1).
317 2: address of table of counts (LPBX2).
318 3: number of counts in the table.
319 4: always 0, for compatibility with Sun.
321 The following are GNU extensions:
323 5: address of table of start addrs of basic blocks (LPBX3).
324 6: Number of bytes in this header.
325 7: address of table of function names (LPBX4).
326 8: address of table of line numbers (LPBX5) or 0.
327 9: address of table of file names (LPBX6) or 0.
328 10: space reserved for basic block profiling. */
330 ASM_OUTPUT_ALIGN (asm_out_file, align);
332 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
335 assemble_integer (const0_rtx, long_bytes, align2, 1);
337 /* Address of filename. */
338 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
339 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
342 /* Address of count table. */
343 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
344 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
347 /* Count of the # of basic blocks or # of instrumented arcs. */
348 assemble_integer (GEN_INT (profile_block_flag
350 : count_instrumented_edges),
351 long_bytes, align2, 1);
353 /* Zero word (link field). */
354 assemble_integer (const0_rtx, pointer_bytes, align2, 1);
356 /* address of basic block start address table */
357 if (profile_block_flag)
359 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
360 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
361 pointer_bytes, align2, 1);
364 assemble_integer (const0_rtx, pointer_bytes, align2, 1);
366 /* Byte count for extended structure. */
367 assemble_integer (GEN_INT (11 * UNITS_PER_WORD), long_bytes, align2, 1);
369 /* Address of function name table. */
370 if (profile_block_flag)
372 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
373 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
374 pointer_bytes, align2, 1);
377 assemble_integer (const0_rtx, pointer_bytes, align2, 1);
379 /* Address of line number and filename tables if debugging. */
380 if (write_symbols != NO_DEBUG && profile_block_flag)
382 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
383 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
384 pointer_bytes, align2, 1);
385 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
386 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
387 pointer_bytes, align2, 1);
391 assemble_integer (const0_rtx, pointer_bytes, align2, 1);
392 assemble_integer (const0_rtx, pointer_bytes, align2, 1);
395 /* Space for extension ptr (link field). */
396 assemble_integer (const0_rtx, UNITS_PER_WORD, align2, 1);
398 /* Output the file name changing the suffix to .d for
399 Sun tcov compatibility. */
400 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
402 char *cwd = getpwd ();
403 int len = strlen (filename) + strlen (cwd) + 1;
404 char *data_file = (char *) alloca (len + 4);
406 strcpy (data_file, cwd);
407 strcat (data_file, "/");
408 strcat (data_file, filename);
409 strip_off_ending (data_file, len);
410 if (profile_block_flag)
411 strcat (data_file, ".d");
413 strcat (data_file, ".da");
414 assemble_string (data_file, strlen (data_file) + 1);
417 /* Make space for the table of counts. */
420 /* Realign data section. */
421 ASM_OUTPUT_ALIGN (asm_out_file, align);
422 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
424 assemble_zeros (size);
428 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
429 #ifdef ASM_OUTPUT_SHARED_LOCAL
430 if (flag_shared_data)
431 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
434 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
435 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name,
436 size, BIGGEST_ALIGNMENT);
438 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
439 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
442 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
447 /* Output any basic block strings */
448 if (profile_block_flag)
450 readonly_data_section ();
453 ASM_OUTPUT_ALIGN (asm_out_file, align);
454 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
456 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC",
458 assemble_string (sptr->string, sptr->length);
463 /* Output the table of addresses. */
464 if (profile_block_flag)
466 /* Realign in new section */
467 ASM_OUTPUT_ALIGN (asm_out_file, align);
468 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
469 for (i = 0; i < count_basic_blocks; i++)
471 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
472 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
473 pointer_bytes, align2, 1);
477 /* Output the table of function names. */
478 if (profile_block_flag)
480 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
481 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
483 if (ptr->func_label_num >= 0)
485 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
486 ptr->func_label_num);
487 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
488 pointer_bytes, align2, 1);
491 assemble_integer (const0_rtx, pointer_bytes, align2, 1);
494 for (; i < count_basic_blocks; i++)
495 assemble_integer (const0_rtx, pointer_bytes, align2, 1);
498 if (write_symbols != NO_DEBUG && profile_block_flag)
500 /* Output the table of line numbers. */
501 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
502 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
503 assemble_integer (GEN_INT (ptr->line_num), long_bytes, align2, 1);
505 for (; i < count_basic_blocks; i++)
506 assemble_integer (const0_rtx, long_bytes, align2, 1);
508 /* Output the table of file names. */
509 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
510 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
512 if (ptr->file_label_num >= 0)
514 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
515 ptr->file_label_num);
516 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
517 pointer_bytes, align2, 1);
520 assemble_integer (const0_rtx, pointer_bytes, align2, 1);
523 for (; i < count_basic_blocks; i++)
524 assemble_integer (const0_rtx, pointer_bytes, align2, 1);
527 /* End with the address of the table of addresses,
528 so we can find it easily, as the last word in the file's text. */
529 if (profile_block_flag)
531 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
532 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
533 pointer_bytes, align2, 1);
538 /* Default target function prologue and epilogue assembler output.
540 If not overridden for epilogue code, then the function body itself
541 contains return instructions wherever needed. */
543 default_function_pro_epilogue (file, size)
544 FILE *file ATTRIBUTE_UNUSED;
545 HOST_WIDE_INT size ATTRIBUTE_UNUSED;
549 /* Default target hook that outputs nothing to a stream. */
551 no_asm_to_stream (file)
552 FILE *file ATTRIBUTE_UNUSED;
556 /* Enable APP processing of subsequent output.
557 Used before the output from an `asm' statement. */
564 fputs (ASM_APP_ON, asm_out_file);
569 /* Disable APP processing of subsequent output.
570 Called from varasm.c before most kinds of output. */
577 fputs (ASM_APP_OFF, asm_out_file);
582 /* Return the number of slots filled in the current
583 delayed branch sequence (we don't count the insn needing the
584 delay slot). Zero if not in a delayed branch sequence. */
588 dbr_sequence_length ()
590 if (final_sequence != 0)
591 return XVECLEN (final_sequence, 0) - 1;
597 /* The next two pages contain routines used to compute the length of an insn
598 and to shorten branches. */
600 /* Arrays for insn lengths, and addresses. The latter is referenced by
601 `insn_current_length'. */
603 static short *insn_lengths;
605 #ifdef HAVE_ATTR_length
606 varray_type insn_addresses_;
609 /* Max uid for which the above arrays are valid. */
610 static int insn_lengths_max_uid;
612 /* Address of insn being processed. Used by `insn_current_length'. */
613 int insn_current_address;
615 /* Address of insn being processed in previous iteration. */
616 int insn_last_address;
618 /* konwn invariant alignment of insn being processed. */
619 int insn_current_align;
621 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
622 gives the next following alignment insn that increases the known
623 alignment, or NULL_RTX if there is no such insn.
624 For any alignment obtained this way, we can again index uid_align with
625 its uid to obtain the next following align that in turn increases the
626 alignment, till we reach NULL_RTX; the sequence obtained this way
627 for each insn we'll call the alignment chain of this insn in the following
630 struct label_alignment
636 static rtx *uid_align;
637 static int *uid_shuid;
638 static struct label_alignment *label_align;
640 /* Indicate that branch shortening hasn't yet been done. */
654 insn_lengths_max_uid = 0;
656 #ifdef HAVE_ATTR_length
657 INSN_ADDRESSES_FREE ();
666 /* Obtain the current length of an insn. If branch shortening has been done,
667 get its actual length. Otherwise, get its maximum length. */
670 get_attr_length (insn)
671 rtx insn ATTRIBUTE_UNUSED;
673 #ifdef HAVE_ATTR_length
678 if (insn_lengths_max_uid > INSN_UID (insn))
679 return insn_lengths[INSN_UID (insn)];
681 switch (GET_CODE (insn))
689 length = insn_default_length (insn);
693 body = PATTERN (insn);
694 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
696 /* Alignment is machine-dependent and should be handled by
700 length = insn_default_length (insn);
704 body = PATTERN (insn);
705 if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
708 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
709 length = asm_insn_count (body) * insn_default_length (insn);
710 else if (GET_CODE (body) == SEQUENCE)
711 for (i = 0; i < XVECLEN (body, 0); i++)
712 length += get_attr_length (XVECEXP (body, 0, i));
714 length = insn_default_length (insn);
721 #ifdef ADJUST_INSN_LENGTH
722 ADJUST_INSN_LENGTH (insn, length);
725 #else /* not HAVE_ATTR_length */
727 #endif /* not HAVE_ATTR_length */
730 /* Code to handle alignment inside shorten_branches. */
732 /* Here is an explanation how the algorithm in align_fuzz can give
735 Call a sequence of instructions beginning with alignment point X
736 and continuing until the next alignment point `block X'. When `X'
737 is used in an expression, it means the alignment value of the
740 Call the distance between the start of the first insn of block X, and
741 the end of the last insn of block X `IX', for the `inner size of X'.
742 This is clearly the sum of the instruction lengths.
744 Likewise with the next alignment-delimited block following X, which we
747 Call the distance between the start of the first insn of block X, and
748 the start of the first insn of block Y `OX', for the `outer size of X'.
750 The estimated padding is then OX - IX.
752 OX can be safely estimated as
757 OX = round_up(IX, X) + Y - X
759 Clearly est(IX) >= real(IX), because that only depends on the
760 instruction lengths, and those being overestimated is a given.
762 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
763 we needn't worry about that when thinking about OX.
765 When X >= Y, the alignment provided by Y adds no uncertainty factor
766 for branch ranges starting before X, so we can just round what we have.
767 But when X < Y, we don't know anything about the, so to speak,
768 `middle bits', so we have to assume the worst when aligning up from an
769 address mod X to one mod Y, which is Y - X. */
772 #define LABEL_ALIGN(LABEL) align_labels_log
775 #ifndef LABEL_ALIGN_MAX_SKIP
776 #define LABEL_ALIGN_MAX_SKIP (align_labels-1)
780 #define LOOP_ALIGN(LABEL) align_loops_log
783 #ifndef LOOP_ALIGN_MAX_SKIP
784 #define LOOP_ALIGN_MAX_SKIP (align_loops-1)
787 #ifndef LABEL_ALIGN_AFTER_BARRIER
788 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 1
791 #ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
792 #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP 0
796 #define JUMP_ALIGN(LABEL) align_jumps_log
799 #ifndef JUMP_ALIGN_MAX_SKIP
800 #define JUMP_ALIGN_MAX_SKIP (align_jumps-1)
803 #ifndef ADDR_VEC_ALIGN
805 final_addr_vec_align (addr_vec)
808 int align = GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec)));
810 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
811 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
812 return exact_log2 (align);
816 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
819 #ifndef INSN_LENGTH_ALIGNMENT
820 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
823 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
825 static int min_labelno, max_labelno;
827 #define LABEL_TO_ALIGNMENT(LABEL) \
828 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
830 #define LABEL_TO_MAX_SKIP(LABEL) \
831 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
833 /* For the benefit of port specific code do this also as a function. */
836 label_to_alignment (label)
839 return LABEL_TO_ALIGNMENT (label);
842 #ifdef HAVE_ATTR_length
843 /* The differences in addresses
844 between a branch and its target might grow or shrink depending on
845 the alignment the start insn of the range (the branch for a forward
846 branch or the label for a backward branch) starts out on; if these
847 differences are used naively, they can even oscillate infinitely.
848 We therefore want to compute a 'worst case' address difference that
849 is independent of the alignment the start insn of the range end
850 up on, and that is at least as large as the actual difference.
851 The function align_fuzz calculates the amount we have to add to the
852 naively computed difference, by traversing the part of the alignment
853 chain of the start insn of the range that is in front of the end insn
854 of the range, and considering for each alignment the maximum amount
855 that it might contribute to a size increase.
857 For casesi tables, we also want to know worst case minimum amounts of
858 address difference, in case a machine description wants to introduce
859 some common offset that is added to all offsets in a table.
860 For this purpose, align_fuzz with a growth argument of 0 comuptes the
861 appropriate adjustment. */
863 /* Compute the maximum delta by which the difference of the addresses of
864 START and END might grow / shrink due to a different address for start
865 which changes the size of alignment insns between START and END.
866 KNOWN_ALIGN_LOG is the alignment known for START.
867 GROWTH should be ~0 if the objective is to compute potential code size
868 increase, and 0 if the objective is to compute potential shrink.
869 The return value is undefined for any other value of GROWTH. */
872 align_fuzz (start, end, known_align_log, growth)
877 int uid = INSN_UID (start);
879 int known_align = 1 << known_align_log;
880 int end_shuid = INSN_SHUID (end);
883 for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
885 int align_addr, new_align;
887 uid = INSN_UID (align_label);
888 align_addr = INSN_ADDRESSES (uid) - insn_lengths[uid];
889 if (uid_shuid[uid] > end_shuid)
891 known_align_log = LABEL_TO_ALIGNMENT (align_label);
892 new_align = 1 << known_align_log;
893 if (new_align < known_align)
895 fuzz += (-align_addr ^ growth) & (new_align - known_align);
896 known_align = new_align;
901 /* Compute a worst-case reference address of a branch so that it
902 can be safely used in the presence of aligned labels. Since the
903 size of the branch itself is unknown, the size of the branch is
904 not included in the range. I.e. for a forward branch, the reference
905 address is the end address of the branch as known from the previous
906 branch shortening pass, minus a value to account for possible size
907 increase due to alignment. For a backward branch, it is the start
908 address of the branch as known from the current pass, plus a value
909 to account for possible size increase due to alignment.
910 NB.: Therefore, the maximum offset allowed for backward branches needs
911 to exclude the branch size. */
914 insn_current_reference_address (branch)
920 if (! INSN_ADDRESSES_SET_P ())
923 seq = NEXT_INSN (PREV_INSN (branch));
924 seq_uid = INSN_UID (seq);
925 if (GET_CODE (branch) != JUMP_INSN)
926 /* This can happen for example on the PA; the objective is to know the
927 offset to address something in front of the start of the function.
928 Thus, we can treat it like a backward branch.
929 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
930 any alignment we'd encounter, so we skip the call to align_fuzz. */
931 return insn_current_address;
932 dest = JUMP_LABEL (branch);
934 /* BRANCH has no proper alignment chain set, so use SEQ.
935 BRANCH also has no INSN_SHUID. */
936 if (INSN_SHUID (seq) < INSN_SHUID (dest))
938 /* Forward branch. */
939 return (insn_last_address + insn_lengths[seq_uid]
940 - align_fuzz (seq, dest, length_unit_log, ~0));
944 /* Backward branch. */
945 return (insn_current_address
946 + align_fuzz (dest, seq, length_unit_log, ~0));
949 #endif /* HAVE_ATTR_length */
952 compute_alignments ()
955 int log, max_skip, max_log;
963 max_labelno = max_label_num ();
964 min_labelno = get_first_label_num ();
965 label_align = (struct label_alignment *)
966 xcalloc (max_labelno - min_labelno + 1, sizeof (struct label_alignment));
968 /* If not optimizing or optimizing for size, don't assign any alignments. */
969 if (optimize || optimize_size)
972 for (i = 0; i < n_basic_blocks; i++)
974 basic_block bb = BASIC_BLOCK (i);
975 rtx label = bb->head;
976 int fallthru_frequency = 0, branch_frequency = 0, has_fallthru = 0;
979 if (GET_CODE (label) != CODE_LABEL)
981 max_log = LABEL_ALIGN (label);
982 max_skip = LABEL_ALIGN_MAX_SKIP;
984 for (e = bb->pred; e; e = e->pred_next)
986 if (e->flags & EDGE_FALLTHRU)
987 has_fallthru = 1, fallthru_frequency += EDGE_FREQUENCY (e);
989 branch_frequency += EDGE_FREQUENCY (e);
992 /* There are two purposes to align block with no fallthru incomming edge:
993 1) to avoid fetch stalls when branch destination is near cache boundary
994 2) to improve cache effciency in case the previous block is not executed
995 (so it does not need to be in the cache).
997 We to catch first case, we align frequently executed blocks.
998 To catch the second, we align blocks that are executed more frequently
999 than the predecesor and the predecesor is likely to not be executed
1000 when function is called. */
1003 && (branch_frequency > BB_FREQ_MAX / 10
1004 || (bb->frequency > BASIC_BLOCK (i - 1)->frequency * 10
1005 && (BASIC_BLOCK (i - 1)->frequency
1006 <= ENTRY_BLOCK_PTR->frequency / 2))))
1008 log = JUMP_ALIGN (label);
1012 max_skip = JUMP_ALIGN_MAX_SKIP;
1015 /* In case block is frequent and reached mostly by non-fallthru edge,
1016 align it. It is most likely an first block of loop. */
1018 && branch_frequency + fallthru_frequency > BB_FREQ_MAX / 10
1019 && branch_frequency > fallthru_frequency * 5)
1021 log = LOOP_ALIGN (label);
1025 max_skip = LOOP_ALIGN_MAX_SKIP;
1028 LABEL_TO_ALIGNMENT (label) = max_log;
1029 LABEL_TO_MAX_SKIP (label) = max_skip;
1033 /* Make a pass over all insns and compute their actual lengths by shortening
1034 any branches of variable length if possible. */
1036 /* Give a default value for the lowest address in a function. */
1038 #ifndef FIRST_INSN_ADDRESS
1039 #define FIRST_INSN_ADDRESS 0
1042 /* shorten_branches might be called multiple times: for example, the SH
1043 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
1044 In order to do this, it needs proper length information, which it obtains
1045 by calling shorten_branches. This cannot be collapsed with
1046 shorten_branches itself into a single pass unless we also want to intergate
1047 reorg.c, since the branch splitting exposes new instructions with delay
1051 shorten_branches (first)
1052 rtx first ATTRIBUTE_UNUSED;
1059 #ifdef HAVE_ATTR_length
1060 #define MAX_CODE_ALIGN 16
1062 int something_changed = 1;
1063 char *varying_length;
1066 rtx align_tab[MAX_CODE_ALIGN];
1070 /* Compute maximum UID and allocate label_align / uid_shuid. */
1071 max_uid = get_max_uid ();
1073 uid_shuid = (int *) xmalloc (max_uid * sizeof *uid_shuid);
1075 if (max_labelno != max_label_num ())
1077 int old = max_labelno;
1081 max_labelno = max_label_num ();
1083 n_labels = max_labelno - min_labelno + 1;
1084 n_old_labels = old - min_labelno + 1;
1086 label_align = (struct label_alignment *) xrealloc
1087 (label_align, n_labels * sizeof (struct label_alignment));
1089 /* Range of labels grows monotonically in the function. Abort here
1090 means that the initialization of array got lost. */
1091 if (n_old_labels > n_labels)
1094 memset (label_align + n_old_labels, 0,
1095 (n_labels - n_old_labels) * sizeof (struct label_alignment));
1098 /* Initialize label_align and set up uid_shuid to be strictly
1099 monotonically rising with insn order. */
1100 /* We use max_log here to keep track of the maximum alignment we want to
1101 impose on the next CODE_LABEL (or the current one if we are processing
1102 the CODE_LABEL itself). */
1107 for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
1111 INSN_SHUID (insn) = i++;
1114 /* reorg might make the first insn of a loop being run once only,
1115 and delete the label in front of it. Then we want to apply
1116 the loop alignment to the new label created by reorg, which
1117 is separated by the former loop start insn from the
1118 NOTE_INSN_LOOP_BEG. */
1120 else if (GET_CODE (insn) == CODE_LABEL)
1124 /* Merge in alignments computed by compute_alignments. */
1125 log = LABEL_TO_ALIGNMENT (insn);
1129 max_skip = LABEL_TO_MAX_SKIP (insn);
1132 log = LABEL_ALIGN (insn);
1136 max_skip = LABEL_ALIGN_MAX_SKIP;
1138 next = NEXT_INSN (insn);
1139 /* ADDR_VECs only take room if read-only data goes into the text
1141 if (JUMP_TABLES_IN_TEXT_SECTION
1142 #if !defined(READONLY_DATA_SECTION)
1146 if (next && GET_CODE (next) == JUMP_INSN)
1148 rtx nextbody = PATTERN (next);
1149 if (GET_CODE (nextbody) == ADDR_VEC
1150 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1152 log = ADDR_VEC_ALIGN (next);
1156 max_skip = LABEL_ALIGN_MAX_SKIP;
1160 LABEL_TO_ALIGNMENT (insn) = max_log;
1161 LABEL_TO_MAX_SKIP (insn) = max_skip;
1165 else if (GET_CODE (insn) == BARRIER)
1169 for (label = insn; label && ! INSN_P (label);
1170 label = NEXT_INSN (label))
1171 if (GET_CODE (label) == CODE_LABEL)
1173 log = LABEL_ALIGN_AFTER_BARRIER (insn);
1177 max_skip = LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP;
1183 #ifdef HAVE_ATTR_length
1185 /* Allocate the rest of the arrays. */
1186 insn_lengths = (short *) xmalloc (max_uid * sizeof (short));
1187 insn_lengths_max_uid = max_uid;
1188 /* Syntax errors can lead to labels being outside of the main insn stream.
1189 Initialize insn_addresses, so that we get reproducible results. */
1190 INSN_ADDRESSES_ALLOC (max_uid);
1192 varying_length = (char *) xcalloc (max_uid, sizeof (char));
1194 /* Initialize uid_align. We scan instructions
1195 from end to start, and keep in align_tab[n] the last seen insn
1196 that does an alignment of at least n+1, i.e. the successor
1197 in the alignment chain for an insn that does / has a known
1199 uid_align = (rtx *) xcalloc (max_uid, sizeof *uid_align);
1201 for (i = MAX_CODE_ALIGN; --i >= 0;)
1202 align_tab[i] = NULL_RTX;
1203 seq = get_last_insn ();
1204 for (; seq; seq = PREV_INSN (seq))
1206 int uid = INSN_UID (seq);
1208 log = (GET_CODE (seq) == CODE_LABEL ? LABEL_TO_ALIGNMENT (seq) : 0);
1209 uid_align[uid] = align_tab[0];
1212 /* Found an alignment label. */
1213 uid_align[uid] = align_tab[log];
1214 for (i = log - 1; i >= 0; i--)
1218 #ifdef CASE_VECTOR_SHORTEN_MODE
1221 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1224 int min_shuid = INSN_SHUID (get_insns ()) - 1;
1225 int max_shuid = INSN_SHUID (get_last_insn ()) + 1;
1228 for (insn = first; insn != 0; insn = NEXT_INSN (insn))
1230 rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat;
1231 int len, i, min, max, insn_shuid;
1233 addr_diff_vec_flags flags;
1235 if (GET_CODE (insn) != JUMP_INSN
1236 || GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)
1238 pat = PATTERN (insn);
1239 len = XVECLEN (pat, 1);
1242 min_align = MAX_CODE_ALIGN;
1243 for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
1245 rtx lab = XEXP (XVECEXP (pat, 1, i), 0);
1246 int shuid = INSN_SHUID (lab);
1257 if (min_align > LABEL_TO_ALIGNMENT (lab))
1258 min_align = LABEL_TO_ALIGNMENT (lab);
1260 XEXP (pat, 2) = gen_rtx_LABEL_REF (VOIDmode, min_lab);
1261 XEXP (pat, 3) = gen_rtx_LABEL_REF (VOIDmode, max_lab);
1262 insn_shuid = INSN_SHUID (insn);
1263 rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0));
1264 flags.min_align = min_align;
1265 flags.base_after_vec = rel > insn_shuid;
1266 flags.min_after_vec = min > insn_shuid;
1267 flags.max_after_vec = max > insn_shuid;
1268 flags.min_after_base = min > rel;
1269 flags.max_after_base = max > rel;
1270 ADDR_DIFF_VEC_FLAGS (pat) = flags;
1273 #endif /* CASE_VECTOR_SHORTEN_MODE */
1275 /* Compute initial lengths, addresses, and varying flags for each insn. */
1276 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1278 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1280 uid = INSN_UID (insn);
1282 insn_lengths[uid] = 0;
1284 if (GET_CODE (insn) == CODE_LABEL)
1286 int log = LABEL_TO_ALIGNMENT (insn);
1289 int align = 1 << log;
1290 int new_address = (insn_current_address + align - 1) & -align;
1291 insn_lengths[uid] = new_address - insn_current_address;
1295 INSN_ADDRESSES (uid) = insn_current_address;
1297 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
1298 || GET_CODE (insn) == CODE_LABEL)
1300 if (INSN_DELETED_P (insn))
1303 body = PATTERN (insn);
1304 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1306 /* This only takes room if read-only data goes into the text
1308 if (JUMP_TABLES_IN_TEXT_SECTION
1309 #if !defined(READONLY_DATA_SECTION)
1313 insn_lengths[uid] = (XVECLEN (body,
1314 GET_CODE (body) == ADDR_DIFF_VEC)
1315 * GET_MODE_SIZE (GET_MODE (body)));
1316 /* Alignment is handled by ADDR_VEC_ALIGN. */
1318 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
1319 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
1320 else if (GET_CODE (body) == SEQUENCE)
1323 int const_delay_slots;
1325 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
1327 const_delay_slots = 0;
1329 /* Inside a delay slot sequence, we do not do any branch shortening
1330 if the shortening could change the number of delay slots
1332 for (i = 0; i < XVECLEN (body, 0); i++)
1334 rtx inner_insn = XVECEXP (body, 0, i);
1335 int inner_uid = INSN_UID (inner_insn);
1338 if (GET_CODE (body) == ASM_INPUT
1339 || asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
1340 inner_length = (asm_insn_count (PATTERN (inner_insn))
1341 * insn_default_length (inner_insn));
1343 inner_length = insn_default_length (inner_insn);
1345 insn_lengths[inner_uid] = inner_length;
1346 if (const_delay_slots)
1348 if ((varying_length[inner_uid]
1349 = insn_variable_length_p (inner_insn)) != 0)
1350 varying_length[uid] = 1;
1351 INSN_ADDRESSES (inner_uid) = (insn_current_address
1352 + insn_lengths[uid]);
1355 varying_length[inner_uid] = 0;
1356 insn_lengths[uid] += inner_length;
1359 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
1361 insn_lengths[uid] = insn_default_length (insn);
1362 varying_length[uid] = insn_variable_length_p (insn);
1365 /* If needed, do any adjustment. */
1366 #ifdef ADJUST_INSN_LENGTH
1367 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
1368 if (insn_lengths[uid] < 0)
1369 fatal_insn ("Negative insn length", insn);
1373 /* Now loop over all the insns finding varying length insns. For each,
1374 get the current insn length. If it has changed, reflect the change.
1375 When nothing changes for a full pass, we are done. */
1377 while (something_changed)
1379 something_changed = 0;
1380 insn_current_align = MAX_CODE_ALIGN - 1;
1381 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1383 insn = NEXT_INSN (insn))
1386 #ifdef ADJUST_INSN_LENGTH
1391 uid = INSN_UID (insn);
1393 if (GET_CODE (insn) == CODE_LABEL)
1395 int log = LABEL_TO_ALIGNMENT (insn);
1396 if (log > insn_current_align)
1398 int align = 1 << log;
1399 int new_address= (insn_current_address + align - 1) & -align;
1400 insn_lengths[uid] = new_address - insn_current_address;
1401 insn_current_align = log;
1402 insn_current_address = new_address;
1405 insn_lengths[uid] = 0;
1406 INSN_ADDRESSES (uid) = insn_current_address;
1410 length_align = INSN_LENGTH_ALIGNMENT (insn);
1411 if (length_align < insn_current_align)
1412 insn_current_align = length_align;
1414 insn_last_address = INSN_ADDRESSES (uid);
1415 INSN_ADDRESSES (uid) = insn_current_address;
1417 #ifdef CASE_VECTOR_SHORTEN_MODE
1418 if (optimize && GET_CODE (insn) == JUMP_INSN
1419 && GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
1421 rtx body = PATTERN (insn);
1422 int old_length = insn_lengths[uid];
1423 rtx rel_lab = XEXP (XEXP (body, 0), 0);
1424 rtx min_lab = XEXP (XEXP (body, 2), 0);
1425 rtx max_lab = XEXP (XEXP (body, 3), 0);
1426 addr_diff_vec_flags flags = ADDR_DIFF_VEC_FLAGS (body);
1427 int rel_addr = INSN_ADDRESSES (INSN_UID (rel_lab));
1428 int min_addr = INSN_ADDRESSES (INSN_UID (min_lab));
1429 int max_addr = INSN_ADDRESSES (INSN_UID (max_lab));
1433 /* Try to find a known alignment for rel_lab. */
1434 for (prev = rel_lab;
1436 && ! insn_lengths[INSN_UID (prev)]
1437 && ! (varying_length[INSN_UID (prev)] & 1);
1438 prev = PREV_INSN (prev))
1439 if (varying_length[INSN_UID (prev)] & 2)
1441 rel_align = LABEL_TO_ALIGNMENT (prev);
1445 /* See the comment on addr_diff_vec_flags in rtl.h for the
1446 meaning of the flags values. base: REL_LAB vec: INSN */
1447 /* Anything after INSN has still addresses from the last
1448 pass; adjust these so that they reflect our current
1449 estimate for this pass. */
1450 if (flags.base_after_vec)
1451 rel_addr += insn_current_address - insn_last_address;
1452 if (flags.min_after_vec)
1453 min_addr += insn_current_address - insn_last_address;
1454 if (flags.max_after_vec)
1455 max_addr += insn_current_address - insn_last_address;
1456 /* We want to know the worst case, i.e. lowest possible value
1457 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1458 its offset is positive, and we have to be wary of code shrink;
1459 otherwise, it is negative, and we have to be vary of code
1461 if (flags.min_after_base)
1463 /* If INSN is between REL_LAB and MIN_LAB, the size
1464 changes we are about to make can change the alignment
1465 within the observed offset, therefore we have to break
1466 it up into two parts that are independent. */
1467 if (! flags.base_after_vec && flags.min_after_vec)
1469 min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
1470 min_addr -= align_fuzz (insn, min_lab, 0, 0);
1473 min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
1477 if (flags.base_after_vec && ! flags.min_after_vec)
1479 min_addr -= align_fuzz (min_lab, insn, 0, ~0);
1480 min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
1483 min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
1485 /* Likewise, determine the highest lowest possible value
1486 for the offset of MAX_LAB. */
1487 if (flags.max_after_base)
1489 if (! flags.base_after_vec && flags.max_after_vec)
1491 max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
1492 max_addr += align_fuzz (insn, max_lab, 0, ~0);
1495 max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
1499 if (flags.base_after_vec && ! flags.max_after_vec)
1501 max_addr += align_fuzz (max_lab, insn, 0, 0);
1502 max_addr += align_fuzz (insn, rel_lab, 0, 0);
1505 max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
1507 PUT_MODE (body, CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
1508 max_addr - rel_addr,
1510 if (JUMP_TABLES_IN_TEXT_SECTION
1511 #if !defined(READONLY_DATA_SECTION)
1517 = (XVECLEN (body, 1) * GET_MODE_SIZE (GET_MODE (body)));
1518 insn_current_address += insn_lengths[uid];
1519 if (insn_lengths[uid] != old_length)
1520 something_changed = 1;
1525 #endif /* CASE_VECTOR_SHORTEN_MODE */
1527 if (! (varying_length[uid]))
1529 if (GET_CODE (insn) == INSN
1530 && GET_CODE (PATTERN (insn)) == SEQUENCE)
1534 body = PATTERN (insn);
1535 for (i = 0; i < XVECLEN (body, 0); i++)
1537 rtx inner_insn = XVECEXP (body, 0, i);
1538 int inner_uid = INSN_UID (inner_insn);
1540 INSN_ADDRESSES (inner_uid) = insn_current_address;
1542 insn_current_address += insn_lengths[inner_uid];
1546 insn_current_address += insn_lengths[uid];
1551 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
1555 body = PATTERN (insn);
1557 for (i = 0; i < XVECLEN (body, 0); i++)
1559 rtx inner_insn = XVECEXP (body, 0, i);
1560 int inner_uid = INSN_UID (inner_insn);
1563 INSN_ADDRESSES (inner_uid) = insn_current_address;
1565 /* insn_current_length returns 0 for insns with a
1566 non-varying length. */
1567 if (! varying_length[inner_uid])
1568 inner_length = insn_lengths[inner_uid];
1570 inner_length = insn_current_length (inner_insn);
1572 if (inner_length != insn_lengths[inner_uid])
1574 insn_lengths[inner_uid] = inner_length;
1575 something_changed = 1;
1577 insn_current_address += insn_lengths[inner_uid];
1578 new_length += inner_length;
1583 new_length = insn_current_length (insn);
1584 insn_current_address += new_length;
1587 #ifdef ADJUST_INSN_LENGTH
1588 /* If needed, do any adjustment. */
1589 tmp_length = new_length;
1590 ADJUST_INSN_LENGTH (insn, new_length);
1591 insn_current_address += (new_length - tmp_length);
1594 if (new_length != insn_lengths[uid])
1596 insn_lengths[uid] = new_length;
1597 something_changed = 1;
1600 /* For a non-optimizing compile, do only a single pass. */
1605 free (varying_length);
1607 #endif /* HAVE_ATTR_length */
1610 #ifdef HAVE_ATTR_length
1611 /* Given the body of an INSN known to be generated by an ASM statement, return
1612 the number of machine instructions likely to be generated for this insn.
1613 This is used to compute its length. */
1616 asm_insn_count (body)
1619 const char *template;
1622 if (GET_CODE (body) == ASM_INPUT)
1623 template = XSTR (body, 0);
1625 template = decode_asm_operands (body, NULL, NULL, NULL, NULL);
1627 for (; *template; template++)
1628 if (IS_ASM_LOGICAL_LINE_SEPARATOR (*template) || *template == '\n')
1635 /* Output assembler code for the start of a function,
1636 and initialize some of the variables in this file
1637 for the new function. The label for the function and associated
1638 assembler pseudo-ops have already been output in `assemble_start_function'.
1640 FIRST is the first insn of the rtl for the function being compiled.
1641 FILE is the file to write assembler code to.
1642 OPTIMIZE is nonzero if we should eliminate redundant
1643 test and compare insns. */
1646 final_start_function (first, file, optimize)
1649 int optimize ATTRIBUTE_UNUSED;
1653 this_is_asm_operands = 0;
1655 #ifdef NON_SAVING_SETJMP
1656 /* A function that calls setjmp should save and restore all the
1657 call-saved registers on a system where longjmp clobbers them. */
1658 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
1662 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1663 if (!call_used_regs[i])
1664 regs_ever_live[i] = 1;
1668 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1669 notice_source_line (first);
1670 high_block_linenum = high_function_linenum = last_linenum;
1672 (*debug_hooks->begin_prologue) (last_linenum, last_filename);
1674 #if defined (DWARF2_UNWIND_INFO) || defined (IA64_UNWIND_INFO)
1675 if (write_symbols != DWARF2_DEBUG)
1676 dwarf2out_begin_prologue (0, NULL);
1679 #ifdef LEAF_REG_REMAP
1680 if (current_function_uses_only_leaf_regs)
1681 leaf_renumber_regs (first);
1684 /* The Sun386i and perhaps other machines don't work right
1685 if the profiling code comes after the prologue. */
1686 #ifdef PROFILE_BEFORE_PROLOGUE
1688 profile_function (file);
1689 #endif /* PROFILE_BEFORE_PROLOGUE */
1691 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1692 if (dwarf2out_do_frame ())
1693 dwarf2out_frame_debug (NULL_RTX);
1696 /* If debugging, assign block numbers to all of the blocks in this
1700 remove_unnecessary_notes ();
1702 number_blocks (current_function_decl);
1703 /* We never actually put out begin/end notes for the top-level
1704 block in the function. But, conceptually, that block is
1706 TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl)) = 1;
1709 /* First output the function prologue: code to set up the stack frame. */
1710 (*targetm.asm_out.function_prologue) (file, get_frame_size ());
1712 /* If the machine represents the prologue as RTL, the profiling code must
1713 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1714 #ifdef HAVE_prologue
1715 if (! HAVE_prologue)
1717 profile_after_prologue (file);
1721 /* If we are doing basic block profiling, remember a printable version
1722 of the function name. */
1723 if (profile_block_flag)
1726 add_bb_string ((*decl_printable_name) (current_function_decl, 2),
1732 profile_after_prologue (file)
1733 FILE *file ATTRIBUTE_UNUSED;
1735 #ifdef FUNCTION_BLOCK_PROFILER
1736 if (profile_block_flag)
1738 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
1740 #endif /* FUNCTION_BLOCK_PROFILER */
1742 #ifndef PROFILE_BEFORE_PROLOGUE
1744 profile_function (file);
1745 #endif /* not PROFILE_BEFORE_PROLOGUE */
1749 profile_function (file)
1752 #ifndef NO_PROFILE_COUNTERS
1753 int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1755 #if defined(ASM_OUTPUT_REG_PUSH)
1756 #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1757 int sval = current_function_returns_struct;
1759 #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1760 int cxt = current_function_needs_context;
1762 #endif /* ASM_OUTPUT_REG_PUSH */
1764 #ifndef NO_PROFILE_COUNTERS
1766 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1767 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
1768 assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, align, 1);
1771 function_section (current_function_decl);
1773 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1775 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
1777 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1780 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1785 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1787 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1789 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1792 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1797 FUNCTION_PROFILER (file, profile_label_no);
1799 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1801 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1803 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1806 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1811 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1813 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1815 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1818 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1824 /* Output assembler code for the end of a function.
1825 For clarity, args are same as those of `final_start_function'
1826 even though not all of them are needed. */
1829 final_end_function ()
1833 (*debug_hooks->end_function) (high_function_linenum);
1835 /* Finally, output the function epilogue:
1836 code to restore the stack frame and return to the caller. */
1837 (*targetm.asm_out.function_epilogue) (asm_out_file, get_frame_size ());
1839 /* And debug output. */
1840 (*debug_hooks->end_epilogue) ();
1842 #if defined (DWARF2_UNWIND_INFO)
1843 if (write_symbols != DWARF2_DEBUG && dwarf2out_do_frame ())
1844 dwarf2out_end_epilogue ();
1847 bb_func_label_num = -1; /* not in function, nuke label # */
1850 /* Add a block to the linked list that remembers the current line/file/function
1851 for basic block profiling. Emit the label in front of the basic block and
1852 the instructions that increment the count field. */
1858 struct bb_list *ptr =
1859 (struct bb_list *) permalloc (sizeof (struct bb_list));
1861 /* Add basic block to linked list. */
1863 ptr->line_num = last_linenum;
1864 ptr->file_label_num = bb_file_label_num;
1865 ptr->func_label_num = bb_func_label_num;
1867 bb_tail = &ptr->next;
1869 /* Enable the table of basic-block use counts
1870 to point at the code it applies to. */
1871 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1873 /* Before first insn of this basic block, increment the
1874 count of times it was entered. */
1875 #ifdef BLOCK_PROFILER
1876 BLOCK_PROFILER (file, count_basic_blocks);
1883 count_basic_blocks++;
1886 /* Add a string to be used for basic block profiling. */
1889 add_bb_string (string, perm_p)
1894 struct bb_str *ptr = 0;
1898 string = "<unknown>";
1902 /* Allocate a new string if the current string isn't permanent. If
1903 the string is permanent search for the same string in other
1906 len = strlen (string) + 1;
1909 char *p = (char *) permalloc (len);
1910 memcpy (p, string, len);
1914 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1915 if (ptr->string == string)
1918 /* Allocate a new string block if we need to. */
1921 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1924 ptr->label_num = sbb_label_num++;
1925 ptr->string = string;
1927 sbb_tail = &ptr->next;
1930 return ptr->label_num;
1933 /* Output assembler code for some insns: all or part of a function.
1934 For description of args, see `final_start_function', above.
1936 PRESCAN is 1 if we are not really outputting,
1937 just scanning as if we were outputting.
1938 Prescanning deletes and rearranges insns just like ordinary output.
1939 PRESCAN is -2 if we are outputting after having prescanned.
1940 In this case, don't try to delete or rearrange insns
1941 because that has already been done.
1942 Prescanning is done only on certain machines. */
1945 final (first, file, optimize, prescan)
1955 last_ignored_compare = 0;
1958 /* Make a map indicating which line numbers appear in this function.
1959 When producing SDB debugging info, delete troublesome line number
1960 notes from inlined functions in other files as well as duplicate
1961 line number notes. */
1962 #ifdef SDB_DEBUGGING_INFO
1963 if (write_symbols == SDB_DEBUG)
1966 for (insn = first; insn; insn = NEXT_INSN (insn))
1967 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1969 if ((RTX_INTEGRATED_P (insn)
1970 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1972 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1973 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1975 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
1976 NOTE_SOURCE_FILE (insn) = 0;
1980 if (NOTE_LINE_NUMBER (insn) > max_line)
1981 max_line = NOTE_LINE_NUMBER (insn);
1987 for (insn = first; insn; insn = NEXT_INSN (insn))
1988 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1989 max_line = NOTE_LINE_NUMBER (insn);
1992 line_note_exists = (char *) xcalloc (max_line + 1, sizeof (char));
1994 for (insn = first; insn; insn = NEXT_INSN (insn))
1996 if (INSN_UID (insn) > max_uid) /* find largest UID */
1997 max_uid = INSN_UID (insn);
1998 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1999 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
2001 /* If CC tracking across branches is enabled, record the insn which
2002 jumps to each branch only reached from one place. */
2003 if (optimize && GET_CODE (insn) == JUMP_INSN)
2005 rtx lab = JUMP_LABEL (insn);
2006 if (lab && LABEL_NUSES (lab) == 1)
2008 LABEL_REFS (lab) = insn;
2018 /* Output the insns. */
2019 for (insn = NEXT_INSN (first); insn;)
2021 #ifdef HAVE_ATTR_length
2022 if ((unsigned) INSN_UID (insn) >= INSN_ADDRESSES_SIZE ())
2025 /* Irritatingly, the reg-stack pass is creating new instructions
2026 and because of REG_DEAD note abuse it has to run after
2027 shorten_branches. Fake address of -1 then. */
2028 insn_current_address = -1;
2030 /* This can be triggered by bugs elsewhere in the compiler if
2031 new insns are created after init_insn_lengths is called. */
2036 insn_current_address = INSN_ADDRESSES (INSN_UID (insn));
2037 #endif /* HAVE_ATTR_length */
2039 insn = final_scan_insn (insn, file, optimize, prescan, 0);
2042 /* Do basic-block profiling here
2043 if the last insn was a conditional branch. */
2044 if (profile_block_flag && new_block)
2047 free (line_note_exists);
2048 line_note_exists = NULL;
2052 get_insn_template (code, insn)
2056 const void *output = insn_data[code].output;
2057 switch (insn_data[code].output_format)
2059 case INSN_OUTPUT_FORMAT_SINGLE:
2060 return (const char *) output;
2061 case INSN_OUTPUT_FORMAT_MULTI:
2062 return ((const char *const *) output)[which_alternative];
2063 case INSN_OUTPUT_FORMAT_FUNCTION:
2066 return (*(insn_output_fn) output) (recog_data.operand, insn);
2073 /* The final scan for one insn, INSN.
2074 Args are same as in `final', except that INSN
2075 is the insn being scanned.
2076 Value returned is the next insn to be scanned.
2078 NOPEEPHOLES is the flag to disallow peephole processing (currently
2079 used for within delayed branch sequence output). */
2082 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
2085 int optimize ATTRIBUTE_UNUSED;
2087 int nopeepholes ATTRIBUTE_UNUSED;
2095 /* Ignore deleted insns. These can occur when we split insns (due to a
2096 template of "#") while not optimizing. */
2097 if (INSN_DELETED_P (insn))
2098 return NEXT_INSN (insn);
2100 switch (GET_CODE (insn))
2106 switch (NOTE_LINE_NUMBER (insn))
2108 case NOTE_INSN_DELETED:
2109 case NOTE_INSN_LOOP_BEG:
2110 case NOTE_INSN_LOOP_END:
2111 case NOTE_INSN_LOOP_CONT:
2112 case NOTE_INSN_LOOP_VTOP:
2113 case NOTE_INSN_FUNCTION_END:
2114 case NOTE_INSN_REPEATED_LINE_NUMBER:
2115 case NOTE_INSN_RANGE_BEG:
2116 case NOTE_INSN_RANGE_END:
2117 case NOTE_INSN_LIVE:
2118 case NOTE_INSN_EXPECTED_VALUE:
2121 case NOTE_INSN_BASIC_BLOCK:
2122 #ifdef IA64_UNWIND_INFO
2123 IA64_UNWIND_EMIT (asm_out_file, insn);
2126 fprintf (asm_out_file, "\t%s basic block %d\n",
2127 ASM_COMMENT_START, NOTE_BASIC_BLOCK (insn)->index);
2130 case NOTE_INSN_EH_REGION_BEG:
2131 ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LEHB",
2132 NOTE_EH_HANDLER (insn));
2135 case NOTE_INSN_EH_REGION_END:
2136 ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LEHE",
2137 NOTE_EH_HANDLER (insn));
2140 case NOTE_INSN_PROLOGUE_END:
2141 (*targetm.asm_out.function_end_prologue) (file);
2142 profile_after_prologue (file);
2145 case NOTE_INSN_EPILOGUE_BEG:
2146 (*targetm.asm_out.function_begin_epilogue) (file);
2149 case NOTE_INSN_FUNCTION_BEG:
2151 (*debug_hooks->end_prologue) (last_linenum);
2154 case NOTE_INSN_BLOCK_BEG:
2155 if (debug_info_level == DINFO_LEVEL_NORMAL
2156 || debug_info_level == DINFO_LEVEL_VERBOSE
2157 || write_symbols == DWARF_DEBUG
2158 || write_symbols == DWARF2_DEBUG)
2160 int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
2164 high_block_linenum = last_linenum;
2166 /* Output debugging info about the symbol-block beginning. */
2167 (*debug_hooks->begin_block) (last_linenum, n);
2169 /* Mark this block as output. */
2170 TREE_ASM_WRITTEN (NOTE_BLOCK (insn)) = 1;
2174 case NOTE_INSN_BLOCK_END:
2175 if (debug_info_level == DINFO_LEVEL_NORMAL
2176 || debug_info_level == DINFO_LEVEL_VERBOSE
2177 || write_symbols == DWARF_DEBUG
2178 || write_symbols == DWARF2_DEBUG)
2180 int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
2184 /* End of a symbol-block. */
2186 if (block_depth < 0)
2189 (*debug_hooks->end_block) (high_block_linenum, n);
2193 case NOTE_INSN_DELETED_LABEL:
2194 /* Emit the label. We may have deleted the CODE_LABEL because
2195 the label could be proved to be unreachable, though still
2196 referenced (in the form of having its address taken. */
2197 ASM_OUTPUT_DEBUG_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2204 if (NOTE_LINE_NUMBER (insn) <= 0)
2207 /* This note is a line-number. */
2212 /* If there is anything real after this note, output it.
2213 If another line note follows, omit this one. */
2214 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
2216 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
2219 /* These types of notes can be significant
2220 so make sure the preceding line number stays. */
2221 else if (GET_CODE (note) == NOTE
2222 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
2223 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
2224 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
2226 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
2228 /* Another line note follows; we can delete this note
2229 if no intervening line numbers have notes elsewhere. */
2231 for (num = NOTE_LINE_NUMBER (insn) + 1;
2232 num < NOTE_LINE_NUMBER (note);
2234 if (line_note_exists[num])
2237 if (num >= NOTE_LINE_NUMBER (note))
2243 /* Output this line note if it is the first or the last line
2247 notice_source_line (insn);
2248 (*debug_hooks->source_line) (last_linenum, last_filename);
2256 #if defined (DWARF2_UNWIND_INFO)
2257 if (dwarf2out_do_frame ())
2258 dwarf2out_frame_debug (insn);
2263 /* The target port might emit labels in the output function for
2264 some insn, e.g. sh.c output_branchy_insn. */
2265 if (CODE_LABEL_NUMBER (insn) <= max_labelno)
2267 int align = LABEL_TO_ALIGNMENT (insn);
2268 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2269 int max_skip = LABEL_TO_MAX_SKIP (insn);
2272 if (align && NEXT_INSN (insn))
2273 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2274 ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip);
2276 ASM_OUTPUT_ALIGN (file, align);
2281 /* If this label is reached from only one place, set the condition
2282 codes from the instruction just before the branch. */
2284 /* Disabled because some insns set cc_status in the C output code
2285 and NOTICE_UPDATE_CC alone can set incorrect status. */
2286 if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
2288 rtx jump = LABEL_REFS (insn);
2289 rtx barrier = prev_nonnote_insn (insn);
2291 /* If the LABEL_REFS field of this label has been set to point
2292 at a branch, the predecessor of the branch is a regular
2293 insn, and that branch is the only way to reach this label,
2294 set the condition codes based on the branch and its
2296 if (barrier && GET_CODE (barrier) == BARRIER
2297 && jump && GET_CODE (jump) == JUMP_INSN
2298 && (prev = prev_nonnote_insn (jump))
2299 && GET_CODE (prev) == INSN)
2301 NOTICE_UPDATE_CC (PATTERN (prev), prev);
2302 NOTICE_UPDATE_CC (PATTERN (jump), jump);
2310 #ifdef FINAL_PRESCAN_LABEL
2311 FINAL_PRESCAN_INSN (insn, NULL, 0);
2314 if (LABEL_NAME (insn))
2315 (*debug_hooks->label) (insn);
2319 fputs (ASM_APP_OFF, file);
2322 if (NEXT_INSN (insn) != 0
2323 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
2325 rtx nextbody = PATTERN (NEXT_INSN (insn));
2327 /* If this label is followed by a jump-table,
2328 make sure we put the label in the read-only section. Also
2329 possibly write the label and jump table together. */
2331 if (GET_CODE (nextbody) == ADDR_VEC
2332 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
2334 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2335 /* In this case, the case vector is being moved by the
2336 target, so don't output the label at all. Leave that
2337 to the back end macros. */
2339 if (! JUMP_TABLES_IN_TEXT_SECTION)
2341 readonly_data_section ();
2342 #ifdef READONLY_DATA_SECTION
2343 ASM_OUTPUT_ALIGN (file,
2344 exact_log2 (BIGGEST_ALIGNMENT
2346 #endif /* READONLY_DATA_SECTION */
2349 function_section (current_function_decl);
2351 #ifdef ASM_OUTPUT_CASE_LABEL
2352 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
2355 if (LABEL_ALTERNATE_NAME (insn))
2356 ASM_OUTPUT_ALTERNATE_LABEL_NAME (file, insn);
2358 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2364 if (LABEL_ALTERNATE_NAME (insn))
2365 ASM_OUTPUT_ALTERNATE_LABEL_NAME (file, insn);
2367 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2372 register rtx body = PATTERN (insn);
2373 int insn_code_number;
2374 const char *template;
2379 /* An INSN, JUMP_INSN or CALL_INSN.
2380 First check for special kinds that recog doesn't recognize. */
2382 if (GET_CODE (body) == USE /* These are just declarations */
2383 || GET_CODE (body) == CLOBBER)
2387 /* If there is a REG_CC_SETTER note on this insn, it means that
2388 the setting of the condition code was done in the delay slot
2389 of the insn that branched here. So recover the cc status
2390 from the insn that set it. */
2392 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
2395 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
2396 cc_prev_status = cc_status;
2400 /* Detect insns that are really jump-tables
2401 and output them as such. */
2403 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
2405 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2406 register int vlen, idx;
2414 fputs (ASM_APP_OFF, file);
2418 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2419 if (GET_CODE (body) == ADDR_VEC)
2421 #ifdef ASM_OUTPUT_ADDR_VEC
2422 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2429 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2430 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2436 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
2437 for (idx = 0; idx < vlen; idx++)
2439 if (GET_CODE (body) == ADDR_VEC)
2441 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2442 ASM_OUTPUT_ADDR_VEC_ELT
2443 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
2450 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2451 ASM_OUTPUT_ADDR_DIFF_ELT
2454 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
2455 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
2461 #ifdef ASM_OUTPUT_CASE_END
2462 ASM_OUTPUT_CASE_END (file,
2463 CODE_LABEL_NUMBER (PREV_INSN (insn)),
2468 function_section (current_function_decl);
2473 /* Do basic-block profiling when we reach a new block.
2474 Done here to avoid jump tables. */
2475 if (profile_block_flag && new_block)
2478 if (GET_CODE (body) == ASM_INPUT)
2480 /* There's no telling what that did to the condition codes. */
2486 fputs (ASM_APP_ON, file);
2489 fprintf (asm_out_file, "\t%s\n", XSTR (body, 0));
2493 /* Detect `asm' construct with operands. */
2494 if (asm_noperands (body) >= 0)
2496 unsigned int noperands = asm_noperands (body);
2497 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
2500 /* There's no telling what that did to the condition codes. */
2507 fputs (ASM_APP_ON, file);
2511 /* Get out the operand values. */
2512 string = decode_asm_operands (body, ops, NULL, NULL, NULL);
2513 /* Inhibit aborts on what would otherwise be compiler bugs. */
2514 insn_noperands = noperands;
2515 this_is_asm_operands = insn;
2517 /* Output the insn using them. */
2518 output_asm_insn (string, ops);
2519 this_is_asm_operands = 0;
2523 if (prescan <= 0 && app_on)
2525 fputs (ASM_APP_OFF, file);
2529 if (GET_CODE (body) == SEQUENCE)
2531 /* A delayed-branch sequence */
2537 final_sequence = body;
2539 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2540 force the restoration of a comparison that was previously
2541 thought unnecessary. If that happens, cancel this sequence
2542 and cause that insn to be restored. */
2544 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
2545 if (next != XVECEXP (body, 0, 1))
2551 for (i = 1; i < XVECLEN (body, 0); i++)
2553 rtx insn = XVECEXP (body, 0, i);
2554 rtx next = NEXT_INSN (insn);
2555 /* We loop in case any instruction in a delay slot gets
2558 insn = final_scan_insn (insn, file, 0, prescan, 1);
2559 while (insn != next);
2561 #ifdef DBR_OUTPUT_SEQEND
2562 DBR_OUTPUT_SEQEND (file);
2566 /* If the insn requiring the delay slot was a CALL_INSN, the
2567 insns in the delay slot are actually executed before the
2568 called function. Hence we don't preserve any CC-setting
2569 actions in these insns and the CC must be marked as being
2570 clobbered by the function. */
2571 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
2576 /* Following a conditional branch sequence, we have a new basic
2578 if (profile_block_flag)
2580 rtx insn = XVECEXP (body, 0, 0);
2581 rtx body = PATTERN (insn);
2583 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2584 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2585 || (GET_CODE (insn) == JUMP_INSN
2586 && GET_CODE (body) == PARALLEL
2587 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2588 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
2594 /* We have a real machine instruction as rtl. */
2596 body = PATTERN (insn);
2599 set = single_set (insn);
2601 /* Check for redundant test and compare instructions
2602 (when the condition codes are already set up as desired).
2603 This is done only when optimizing; if not optimizing,
2604 it should be possible for the user to alter a variable
2605 with the debugger in between statements
2606 and the next statement should reexamine the variable
2607 to compute the condition codes. */
2612 rtx set = single_set (insn);
2616 && GET_CODE (SET_DEST (set)) == CC0
2617 && insn != last_ignored_compare)
2619 if (GET_CODE (SET_SRC (set)) == SUBREG)
2620 SET_SRC (set) = alter_subreg (SET_SRC (set));
2621 else if (GET_CODE (SET_SRC (set)) == COMPARE)
2623 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
2624 XEXP (SET_SRC (set), 0)
2625 = alter_subreg (XEXP (SET_SRC (set), 0));
2626 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
2627 XEXP (SET_SRC (set), 1)
2628 = alter_subreg (XEXP (SET_SRC (set), 1));
2630 if ((cc_status.value1 != 0
2631 && rtx_equal_p (SET_SRC (set), cc_status.value1))
2632 || (cc_status.value2 != 0
2633 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
2635 /* Don't delete insn if it has an addressing side-effect. */
2636 if (! FIND_REG_INC_NOTE (insn, 0)
2637 /* or if anything in it is volatile. */
2638 && ! volatile_refs_p (PATTERN (insn)))
2640 /* We don't really delete the insn; just ignore it. */
2641 last_ignored_compare = insn;
2649 /* Following a conditional branch, we have a new basic block.
2650 But if we are inside a sequence, the new block starts after the
2651 last insn of the sequence. */
2652 if (profile_block_flag && final_sequence == 0
2653 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2654 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2655 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
2656 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2657 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
2661 /* Don't bother outputting obvious no-ops, even without -O.
2662 This optimization is fast and doesn't interfere with debugging.
2663 Don't do this if the insn is in a delay slot, since this
2664 will cause an improper number of delay insns to be written. */
2665 if (final_sequence == 0
2667 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
2668 && GET_CODE (SET_SRC (body)) == REG
2669 && GET_CODE (SET_DEST (body)) == REG
2670 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
2675 /* If this is a conditional branch, maybe modify it
2676 if the cc's are in a nonstandard state
2677 so that it accomplishes the same thing that it would
2678 do straightforwardly if the cc's were set up normally. */
2680 if (cc_status.flags != 0
2681 && GET_CODE (insn) == JUMP_INSN
2682 && GET_CODE (body) == SET
2683 && SET_DEST (body) == pc_rtx
2684 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
2685 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
2686 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
2687 /* This is done during prescan; it is not done again
2688 in final scan when prescan has been done. */
2691 /* This function may alter the contents of its argument
2692 and clear some of the cc_status.flags bits.
2693 It may also return 1 meaning condition now always true
2694 or -1 meaning condition now always false
2695 or 2 meaning condition nontrivial but altered. */
2696 register int result = alter_cond (XEXP (SET_SRC (body), 0));
2697 /* If condition now has fixed value, replace the IF_THEN_ELSE
2698 with its then-operand or its else-operand. */
2700 SET_SRC (body) = XEXP (SET_SRC (body), 1);
2702 SET_SRC (body) = XEXP (SET_SRC (body), 2);
2704 /* The jump is now either unconditional or a no-op.
2705 If it has become a no-op, don't try to output it.
2706 (It would not be recognized.) */
2707 if (SET_SRC (body) == pc_rtx)
2709 PUT_CODE (insn, NOTE);
2710 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2711 NOTE_SOURCE_FILE (insn) = 0;
2714 else if (GET_CODE (SET_SRC (body)) == RETURN)
2715 /* Replace (set (pc) (return)) with (return). */
2716 PATTERN (insn) = body = SET_SRC (body);
2718 /* Rerecognize the instruction if it has changed. */
2720 INSN_CODE (insn) = -1;
2723 /* Make same adjustments to instructions that examine the
2724 condition codes without jumping and instructions that
2725 handle conditional moves (if this machine has either one). */
2727 if (cc_status.flags != 0
2730 rtx cond_rtx, then_rtx, else_rtx;
2732 if (GET_CODE (insn) != JUMP_INSN
2733 && GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
2735 cond_rtx = XEXP (SET_SRC (set), 0);
2736 then_rtx = XEXP (SET_SRC (set), 1);
2737 else_rtx = XEXP (SET_SRC (set), 2);
2741 cond_rtx = SET_SRC (set);
2742 then_rtx = const_true_rtx;
2743 else_rtx = const0_rtx;
2746 switch (GET_CODE (cond_rtx))
2759 register int result;
2760 if (XEXP (cond_rtx, 0) != cc0_rtx)
2762 result = alter_cond (cond_rtx);
2764 validate_change (insn, &SET_SRC (set), then_rtx, 0);
2765 else if (result == -1)
2766 validate_change (insn, &SET_SRC (set), else_rtx, 0);
2767 else if (result == 2)
2768 INSN_CODE (insn) = -1;
2769 if (SET_DEST (set) == SET_SRC (set))
2771 PUT_CODE (insn, NOTE);
2772 NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED;
2773 NOTE_SOURCE_FILE (insn) = 0;
2785 #ifdef HAVE_peephole
2786 /* Do machine-specific peephole optimizations if desired. */
2788 if (optimize && !flag_no_peephole && !nopeepholes)
2790 rtx next = peephole (insn);
2791 /* When peepholing, if there were notes within the peephole,
2792 emit them before the peephole. */
2793 if (next != 0 && next != NEXT_INSN (insn))
2795 rtx prev = PREV_INSN (insn);
2798 for (note = NEXT_INSN (insn); note != next;
2799 note = NEXT_INSN (note))
2800 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2802 /* In case this is prescan, put the notes
2803 in proper position for later rescan. */
2804 note = NEXT_INSN (insn);
2805 PREV_INSN (note) = prev;
2806 NEXT_INSN (prev) = note;
2807 NEXT_INSN (PREV_INSN (next)) = insn;
2808 PREV_INSN (insn) = PREV_INSN (next);
2809 NEXT_INSN (insn) = next;
2810 PREV_INSN (next) = insn;
2813 /* PEEPHOLE might have changed this. */
2814 body = PATTERN (insn);
2818 /* Try to recognize the instruction.
2819 If successful, verify that the operands satisfy the
2820 constraints for the instruction. Crash if they don't,
2821 since `reload' should have changed them so that they do. */
2823 insn_code_number = recog_memoized (insn);
2824 cleanup_subreg_operands (insn);
2826 /* Dump the insn in the assembly for debugging. */
2827 if (flag_dump_rtl_in_asm)
2829 print_rtx_head = ASM_COMMENT_START;
2830 print_rtl_single (asm_out_file, insn);
2831 print_rtx_head = "";
2834 if (! constrain_operands_cached (1))
2835 fatal_insn_not_found (insn);
2837 /* Some target machines need to prescan each insn before
2840 #ifdef FINAL_PRESCAN_INSN
2841 FINAL_PRESCAN_INSN (insn, recog_data.operand, recog_data.n_operands);
2844 #ifdef HAVE_conditional_execution
2845 if (GET_CODE (PATTERN (insn)) == COND_EXEC)
2846 current_insn_predicate = COND_EXEC_TEST (PATTERN (insn));
2848 current_insn_predicate = NULL_RTX;
2852 cc_prev_status = cc_status;
2854 /* Update `cc_status' for this instruction.
2855 The instruction's output routine may change it further.
2856 If the output routine for a jump insn needs to depend
2857 on the cc status, it should look at cc_prev_status. */
2859 NOTICE_UPDATE_CC (body, insn);
2862 current_output_insn = debug_insn = insn;
2864 #if defined (DWARF2_UNWIND_INFO)
2865 if (GET_CODE (insn) == CALL_INSN && dwarf2out_do_frame ())
2866 dwarf2out_frame_debug (insn);
2869 /* Find the proper template for this insn. */
2870 template = get_insn_template (insn_code_number, insn);
2872 /* If the C code returns 0, it means that it is a jump insn
2873 which follows a deleted test insn, and that test insn
2874 needs to be reinserted. */
2879 if (prev_nonnote_insn (insn) != last_ignored_compare)
2883 /* We have already processed the notes between the setter and
2884 the user. Make sure we don't process them again, this is
2885 particularly important if one of the notes is a block
2886 scope note or an EH note. */
2888 prev != last_ignored_compare;
2889 prev = PREV_INSN (prev))
2891 if (GET_CODE (prev) == NOTE)
2893 NOTE_LINE_NUMBER (prev) = NOTE_INSN_DELETED;
2894 NOTE_SOURCE_FILE (prev) = 0;
2901 /* If the template is the string "#", it means that this insn must
2903 if (template[0] == '#' && template[1] == '\0')
2905 rtx new = try_split (body, insn, 0);
2907 /* If we didn't split the insn, go away. */
2908 if (new == insn && PATTERN (new) == body)
2909 fatal_insn ("Could not split insn", insn);
2911 #ifdef HAVE_ATTR_length
2912 /* This instruction should have been split in shorten_branches,
2913 to ensure that we would have valid length info for the
2925 #ifdef IA64_UNWIND_INFO
2926 IA64_UNWIND_EMIT (asm_out_file, insn);
2928 /* Output assembler code from the template. */
2930 output_asm_insn (template, recog_data.operand);
2932 #if defined (DWARF2_UNWIND_INFO)
2933 #if defined (HAVE_prologue)
2934 if (GET_CODE (insn) == INSN && dwarf2out_do_frame ())
2935 dwarf2out_frame_debug (insn);
2937 if (!ACCUMULATE_OUTGOING_ARGS
2938 && GET_CODE (insn) == INSN
2939 && dwarf2out_do_frame ())
2940 dwarf2out_frame_debug (insn);
2945 /* It's not at all clear why we did this and doing so interferes
2946 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2949 /* Mark this insn as having been output. */
2950 INSN_DELETED_P (insn) = 1;
2953 current_output_insn = debug_insn = 0;
2956 return NEXT_INSN (insn);
2959 /* Output debugging info to the assembler file FILE
2960 based on the NOTE-insn INSN, assumed to be a line number. */
2963 notice_source_line (insn)
2966 register const char *filename = NOTE_SOURCE_FILE (insn);
2968 /* Remember filename for basic block profiling.
2969 Filenames are allocated on the permanent obstack
2970 or are passed in ARGV, so we don't have to save
2973 if (profile_block_flag && last_filename != filename)
2974 bb_file_label_num = add_bb_string (filename, TRUE);
2976 last_filename = filename;
2977 last_linenum = NOTE_LINE_NUMBER (insn);
2978 high_block_linenum = MAX (last_linenum, high_block_linenum);
2979 high_function_linenum = MAX (last_linenum, high_function_linenum);
2982 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
2983 directly to the desired hard register. */
2986 cleanup_subreg_operands (insn)
2990 extract_insn_cached (insn);
2991 for (i = 0; i < recog_data.n_operands; i++)
2993 if (GET_CODE (recog_data.operand[i]) == SUBREG)
2994 recog_data.operand[i] = alter_subreg (recog_data.operand[i]);
2995 else if (GET_CODE (recog_data.operand[i]) == PLUS
2996 || GET_CODE (recog_data.operand[i]) == MULT
2997 || GET_CODE (recog_data.operand[i]) == MEM)
2998 recog_data.operand[i] = walk_alter_subreg (recog_data.operand[i]);
3001 for (i = 0; i < recog_data.n_dups; i++)
3003 if (GET_CODE (*recog_data.dup_loc[i]) == SUBREG)
3004 *recog_data.dup_loc[i] = alter_subreg (*recog_data.dup_loc[i]);
3005 else if (GET_CODE (*recog_data.dup_loc[i]) == PLUS
3006 || GET_CODE (*recog_data.dup_loc[i]) == MULT
3007 || GET_CODE (*recog_data.dup_loc[i]) == MEM)
3008 *recog_data.dup_loc[i] = walk_alter_subreg (*recog_data.dup_loc[i]);
3012 /* If X is a SUBREG, replace it with a REG or a MEM,
3013 based on the thing it is a subreg of. */
3019 register rtx y = SUBREG_REG (x);
3021 if (GET_CODE (y) == SUBREG)
3022 y = alter_subreg (y);
3024 /* If reload is operating, we may be replacing inside this SUBREG.
3025 Check for that and make a new one if so. */
3026 if (reload_in_progress && find_replacement (&SUBREG_REG (x)) != 0)
3029 if (GET_CODE (y) == REG)
3031 int regno = subreg_hard_regno (x, 1);
3035 ORIGINAL_REGNO (x) = ORIGINAL_REGNO (y);
3036 /* This field has a different meaning for REGs and SUBREGs. Make sure
3040 else if (GET_CODE (y) == MEM)
3042 HOST_WIDE_INT offset = SUBREG_BYTE (x);
3044 /* Catch these instead of generating incorrect code. */
3045 if ((offset % GET_MODE_SIZE (GET_MODE (x))) != 0)
3049 MEM_COPY_ATTRIBUTES (x, y);
3050 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
3056 /* Do alter_subreg on all the SUBREGs contained in X. */
3059 walk_alter_subreg (x)
3062 switch (GET_CODE (x))
3066 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3067 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
3071 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3075 return alter_subreg (x);
3086 /* Given BODY, the body of a jump instruction, alter the jump condition
3087 as required by the bits that are set in cc_status.flags.
3088 Not all of the bits there can be handled at this level in all cases.
3090 The value is normally 0.
3091 1 means that the condition has become always true.
3092 -1 means that the condition has become always false.
3093 2 means that COND has been altered. */
3101 if (cc_status.flags & CC_REVERSED)
3104 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
3107 if (cc_status.flags & CC_INVERTED)
3110 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
3113 if (cc_status.flags & CC_NOT_POSITIVE)
3114 switch (GET_CODE (cond))
3119 /* Jump becomes unconditional. */
3125 /* Jump becomes no-op. */
3129 PUT_CODE (cond, EQ);
3134 PUT_CODE (cond, NE);
3142 if (cc_status.flags & CC_NOT_NEGATIVE)
3143 switch (GET_CODE (cond))
3147 /* Jump becomes unconditional. */
3152 /* Jump becomes no-op. */
3157 PUT_CODE (cond, EQ);
3163 PUT_CODE (cond, NE);
3171 if (cc_status.flags & CC_NO_OVERFLOW)
3172 switch (GET_CODE (cond))
3175 /* Jump becomes unconditional. */
3179 PUT_CODE (cond, EQ);
3184 PUT_CODE (cond, NE);
3189 /* Jump becomes no-op. */
3196 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
3197 switch (GET_CODE (cond))
3203 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
3208 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
3213 if (cc_status.flags & CC_NOT_SIGNED)
3214 /* The flags are valid if signed condition operators are converted
3216 switch (GET_CODE (cond))
3219 PUT_CODE (cond, LEU);
3224 PUT_CODE (cond, LTU);
3229 PUT_CODE (cond, GTU);
3234 PUT_CODE (cond, GEU);
3246 /* Report inconsistency between the assembler template and the operands.
3247 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3250 output_operand_lossage (msgid)
3253 if (this_is_asm_operands)
3254 error_for_asm (this_is_asm_operands, "invalid `asm': %s", _(msgid));
3256 internal_error ("output_operand: %s", _(msgid));
3259 /* Output of assembler code from a template, and its subroutines. */
3261 /* Output text from TEMPLATE to the assembler output file,
3262 obeying %-directions to substitute operands taken from
3263 the vector OPERANDS.
3265 %N (for N a digit) means print operand N in usual manner.
3266 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3267 and print the label name with no punctuation.
3268 %cN means require operand N to be a constant
3269 and print the constant expression with no punctuation.
3270 %aN means expect operand N to be a memory address
3271 (not a memory reference!) and print a reference
3273 %nN means expect operand N to be a constant
3274 and print a constant expression for minus the value
3275 of the operand, with no other punctuation. */
3280 if (flag_print_asm_name)
3282 /* Annotate the assembly with a comment describing the pattern and
3283 alternative used. */
3286 register int num = INSN_CODE (debug_insn);
3287 fprintf (asm_out_file, "\t%s %d\t%s",
3288 ASM_COMMENT_START, INSN_UID (debug_insn),
3289 insn_data[num].name);
3290 if (insn_data[num].n_alternatives > 1)
3291 fprintf (asm_out_file, "/%d", which_alternative + 1);
3292 #ifdef HAVE_ATTR_length
3293 fprintf (asm_out_file, "\t[length = %d]",
3294 get_attr_length (debug_insn));
3296 /* Clear this so only the first assembler insn
3297 of any rtl insn will get the special comment for -dp. */
3304 output_asm_insn (template, operands)
3305 const char *template;
3308 register const char *p;
3311 /* An insn may return a null string template
3312 in a case where no assembler code is needed. */
3317 putc ('\t', asm_out_file);
3319 #ifdef ASM_OUTPUT_OPCODE
3320 ASM_OUTPUT_OPCODE (asm_out_file, p);
3328 putc (c, asm_out_file);
3329 #ifdef ASM_OUTPUT_OPCODE
3330 while ((c = *p) == '\t')
3332 putc (c, asm_out_file);
3335 ASM_OUTPUT_OPCODE (asm_out_file, p);
3339 #ifdef ASSEMBLER_DIALECT
3344 /* If we want the first dialect, do nothing. Otherwise, skip
3345 DIALECT_NUMBER of strings ending with '|'. */
3346 for (i = 0; i < dialect_number; i++)
3348 while (*p && *p != '}' && *p++ != '|')
3359 /* Skip to close brace. */
3360 while (*p && *p++ != '}')
3369 /* %% outputs a single %. */
3373 putc (c, asm_out_file);
3375 /* %= outputs a number which is unique to each insn in the entire
3376 compilation. This is useful for making local labels that are
3377 referred to more than once in a given insn. */
3381 fprintf (asm_out_file, "%d", insn_counter);
3383 /* % followed by a letter and some digits
3384 outputs an operand in a special way depending on the letter.
3385 Letters `acln' are implemented directly.
3386 Other letters are passed to `output_operand' so that
3387 the PRINT_OPERAND macro can define them. */
3388 else if (ISLOWER (*p) || ISUPPER (*p))
3393 if (! (*p >= '0' && *p <= '9'))
3394 output_operand_lossage ("operand number missing after %-letter");
3395 else if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands))
3396 output_operand_lossage ("operand number out of range");
3397 else if (letter == 'l')
3398 output_asm_label (operands[c]);
3399 else if (letter == 'a')
3400 output_address (operands[c]);
3401 else if (letter == 'c')
3403 if (CONSTANT_ADDRESS_P (operands[c]))
3404 output_addr_const (asm_out_file, operands[c]);
3406 output_operand (operands[c], 'c');
3408 else if (letter == 'n')
3410 if (GET_CODE (operands[c]) == CONST_INT)
3411 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
3412 - INTVAL (operands[c]));
3415 putc ('-', asm_out_file);
3416 output_addr_const (asm_out_file, operands[c]);
3420 output_operand (operands[c], letter);
3422 while ((c = *p) >= '0' && c <= '9')
3425 /* % followed by a digit outputs an operand the default way. */
3426 else if (*p >= '0' && *p <= '9')
3429 if (this_is_asm_operands
3430 && (c < 0 || (unsigned int) c >= insn_noperands))
3431 output_operand_lossage ("operand number out of range");
3433 output_operand (operands[c], 0);
3434 while ((c = *p) >= '0' && c <= '9')
3437 /* % followed by punctuation: output something for that
3438 punctuation character alone, with no operand.
3439 The PRINT_OPERAND macro decides what is actually done. */
3440 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3441 else if (PRINT_OPERAND_PUNCT_VALID_P ((unsigned char) *p))
3442 output_operand (NULL_RTX, *p++);
3445 output_operand_lossage ("invalid %%-code");
3449 putc (c, asm_out_file);
3454 putc ('\n', asm_out_file);
3457 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3460 output_asm_label (x)
3465 if (GET_CODE (x) == LABEL_REF)
3467 if (GET_CODE (x) == CODE_LABEL
3468 || (GET_CODE (x) == NOTE
3469 && NOTE_LINE_NUMBER (x) == NOTE_INSN_DELETED_LABEL))
3470 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3472 output_operand_lossage ("`%l' operand isn't a label");
3474 assemble_name (asm_out_file, buf);
3477 /* Print operand X using machine-dependent assembler syntax.
3478 The macro PRINT_OPERAND is defined just to control this function.
3479 CODE is a non-digit that preceded the operand-number in the % spec,
3480 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3481 between the % and the digits.
3482 When CODE is a non-letter, X is 0.
3484 The meanings of the letters are machine-dependent and controlled
3485 by PRINT_OPERAND. */
3488 output_operand (x, code)
3490 int code ATTRIBUTE_UNUSED;
3492 if (x && GET_CODE (x) == SUBREG)
3493 x = alter_subreg (x);
3495 /* If X is a pseudo-register, abort now rather than writing trash to the
3498 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
3501 PRINT_OPERAND (asm_out_file, x, code);
3504 /* Print a memory reference operand for address X
3505 using machine-dependent assembler syntax.
3506 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3512 walk_alter_subreg (x);
3513 PRINT_OPERAND_ADDRESS (asm_out_file, x);
3516 /* Print an integer constant expression in assembler syntax.
3517 Addition and subtraction are the only arithmetic
3518 that may appear in these expressions. */
3521 output_addr_const (file, x)
3528 switch (GET_CODE (x))
3538 #ifdef ASM_OUTPUT_SYMBOL_REF
3539 ASM_OUTPUT_SYMBOL_REF (file, x);
3541 assemble_name (file, XSTR (x, 0));
3549 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3550 assemble_name (file, buf);
3554 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
3558 /* This used to output parentheses around the expression,
3559 but that does not work on the 386 (either ATT or BSD assembler). */
3560 output_addr_const (file, XEXP (x, 0));
3564 if (GET_MODE (x) == VOIDmode)
3566 /* We can use %d if the number is one word and positive. */
3567 if (CONST_DOUBLE_HIGH (x))
3568 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3569 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
3570 else if (CONST_DOUBLE_LOW (x) < 0)
3571 fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
3573 fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
3576 /* We can't handle floating point constants;
3577 PRINT_OPERAND must handle them. */
3578 output_operand_lossage ("floating constant misused");
3582 /* Some assemblers need integer constants to appear last (eg masm). */
3583 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
3585 output_addr_const (file, XEXP (x, 1));
3586 if (INTVAL (XEXP (x, 0)) >= 0)
3587 fprintf (file, "+");
3588 output_addr_const (file, XEXP (x, 0));
3592 output_addr_const (file, XEXP (x, 0));
3593 if (GET_CODE (XEXP (x, 1)) != CONST_INT
3594 || INTVAL (XEXP (x, 1)) >= 0)
3595 fprintf (file, "+");
3596 output_addr_const (file, XEXP (x, 1));
3601 /* Avoid outputting things like x-x or x+5-x,
3602 since some assemblers can't handle that. */
3603 x = simplify_subtraction (x);
3604 if (GET_CODE (x) != MINUS)
3607 output_addr_const (file, XEXP (x, 0));
3608 fprintf (file, "-");
3609 if ((GET_CODE (XEXP (x, 1)) == CONST_INT
3610 && INTVAL (XEXP (x, 1)) < 0)
3611 || GET_CODE (XEXP (x, 1)) != CONST_INT)
3613 fputs (targetm.asm_out.open_paren, file);
3614 output_addr_const (file, XEXP (x, 1));
3615 fputs (targetm.asm_out.close_paren, file);
3618 output_addr_const (file, XEXP (x, 1));
3623 output_addr_const (file, XEXP (x, 0));
3627 #ifdef OUTPUT_ADDR_CONST_EXTRA
3628 OUTPUT_ADDR_CONST_EXTRA (file, x, fail);
3633 output_operand_lossage ("invalid expression as operand");
3637 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3638 %R prints the value of REGISTER_PREFIX.
3639 %L prints the value of LOCAL_LABEL_PREFIX.
3640 %U prints the value of USER_LABEL_PREFIX.
3641 %I prints the value of IMMEDIATE_PREFIX.
3642 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3643 Also supported are %d, %x, %s, %e, %f, %g and %%.
3645 We handle alternate assembler dialects here, just like output_asm_insn. */
3648 asm_fprintf VPARAMS ((FILE *file, const char *p, ...))
3650 #ifndef ANSI_PROTOTYPES
3658 VA_START (argptr, p);
3660 #ifndef ANSI_PROTOTYPES
3661 file = va_arg (argptr, FILE *);
3662 p = va_arg (argptr, const char *);
3670 #ifdef ASSEMBLER_DIALECT
3675 /* If we want the first dialect, do nothing. Otherwise, skip
3676 DIALECT_NUMBER of strings ending with '|'. */
3677 for (i = 0; i < dialect_number; i++)
3679 while (*p && *p++ != '|')
3689 /* Skip to close brace. */
3690 while (*p && *p++ != '}')
3701 while ((c >= '0' && c <= '9') || c == '.')
3709 fprintf (file, "%%");
3712 case 'd': case 'i': case 'u':
3713 case 'x': case 'p': case 'X':
3717 fprintf (file, buf, va_arg (argptr, int));
3721 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3722 but we do not check for those cases. It means that the value
3723 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3725 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3727 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3737 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3744 fprintf (file, buf, va_arg (argptr, long));
3752 fprintf (file, buf, va_arg (argptr, double));
3758 fprintf (file, buf, va_arg (argptr, char *));
3762 #ifdef ASM_OUTPUT_OPCODE
3763 ASM_OUTPUT_OPCODE (asm_out_file, p);
3768 #ifdef REGISTER_PREFIX
3769 fprintf (file, "%s", REGISTER_PREFIX);
3774 #ifdef IMMEDIATE_PREFIX
3775 fprintf (file, "%s", IMMEDIATE_PREFIX);
3780 #ifdef LOCAL_LABEL_PREFIX
3781 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
3786 fputs (user_label_prefix, file);
3789 #ifdef ASM_FPRINTF_EXTENSIONS
3790 /* Upper case letters are reserved for general use by asm_fprintf
3791 and so are not available to target specific code. In order to
3792 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
3793 they are defined here. As they get turned into real extensions
3794 to asm_fprintf they should be removed from this list. */
3795 case 'A': case 'B': case 'C': case 'D': case 'E':
3796 case 'F': case 'G': case 'H': case 'J': case 'K':
3797 case 'M': case 'N': case 'P': case 'Q': case 'S':
3798 case 'T': case 'V': case 'W': case 'Y': case 'Z':
3801 ASM_FPRINTF_EXTENSIONS (file, argptr, p)
3814 /* Split up a CONST_DOUBLE or integer constant rtx
3815 into two rtx's for single words,
3816 storing in *FIRST the word that comes first in memory in the target
3817 and in *SECOND the other. */
3820 split_double (value, first, second)
3822 rtx *first, *second;
3824 if (GET_CODE (value) == CONST_INT)
3826 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3828 /* In this case the CONST_INT holds both target words.
3829 Extract the bits from it into two word-sized pieces.
3830 Sign extend each half to HOST_WIDE_INT. */
3831 unsigned HOST_WIDE_INT low, high;
3832 unsigned HOST_WIDE_INT mask, sign_bit, sign_extend;
3834 /* Set sign_bit to the most significant bit of a word. */
3836 sign_bit <<= BITS_PER_WORD - 1;
3838 /* Set mask so that all bits of the word are set. We could
3839 have used 1 << BITS_PER_WORD instead of basing the
3840 calculation on sign_bit. However, on machines where
3841 HOST_BITS_PER_WIDE_INT == BITS_PER_WORD, it could cause a
3842 compiler warning, even though the code would never be
3844 mask = sign_bit << 1;
3847 /* Set sign_extend as any remaining bits. */
3848 sign_extend = ~mask;
3850 /* Pick the lower word and sign-extend it. */
3851 low = INTVAL (value);
3856 /* Pick the higher word, shifted to the least significant
3857 bits, and sign-extend it. */
3858 high = INTVAL (value);
3859 high >>= BITS_PER_WORD - 1;
3862 if (high & sign_bit)
3863 high |= sign_extend;
3865 /* Store the words in the target machine order. */
3866 if (WORDS_BIG_ENDIAN)
3868 *first = GEN_INT (high);
3869 *second = GEN_INT (low);
3873 *first = GEN_INT (low);
3874 *second = GEN_INT (high);
3879 /* The rule for using CONST_INT for a wider mode
3880 is that we regard the value as signed.
3881 So sign-extend it. */
3882 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
3883 if (WORDS_BIG_ENDIAN)
3895 else if (GET_CODE (value) != CONST_DOUBLE)
3897 if (WORDS_BIG_ENDIAN)
3899 *first = const0_rtx;
3905 *second = const0_rtx;
3908 else if (GET_MODE (value) == VOIDmode
3909 /* This is the old way we did CONST_DOUBLE integers. */
3910 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
3912 /* In an integer, the words are defined as most and least significant.
3913 So order them by the target's convention. */
3914 if (WORDS_BIG_ENDIAN)
3916 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3917 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3921 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3922 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3927 #ifdef REAL_ARITHMETIC
3930 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
3932 /* Note, this converts the REAL_VALUE_TYPE to the target's
3933 format, splits up the floating point double and outputs
3934 exactly 32 bits of it into each of l[0] and l[1] --
3935 not necessarily BITS_PER_WORD bits. */
3936 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
3938 /* If 32 bits is an entire word for the target, but not for the host,
3939 then sign-extend on the host so that the number will look the same
3940 way on the host that it would on the target. See for instance
3941 simplify_unary_operation. The #if is needed to avoid compiler
3944 #if HOST_BITS_PER_LONG > 32
3945 if (BITS_PER_WORD < HOST_BITS_PER_LONG && BITS_PER_WORD == 32)
3947 if (l[0] & ((long) 1 << 31))
3948 l[0] |= ((long) (-1) << 32);
3949 if (l[1] & ((long) 1 << 31))
3950 l[1] |= ((long) (-1) << 32);
3954 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
3955 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
3957 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
3958 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
3959 && ! flag_pretend_float)
3963 #ifdef HOST_WORDS_BIG_ENDIAN
3970 /* Host and target agree => no need to swap. */
3971 *first = GEN_INT (CONST_DOUBLE_LOW (value));
3972 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
3976 *second = GEN_INT (CONST_DOUBLE_LOW (value));
3977 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
3979 #endif /* no REAL_ARITHMETIC */
3983 /* Return nonzero if this function has no function calls. */
3991 if (profile_flag || profile_block_flag || profile_arc_flag)
3994 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3996 if (GET_CODE (insn) == CALL_INSN
3997 && ! SIBLING_CALL_P (insn))
3999 if (GET_CODE (insn) == INSN
4000 && GET_CODE (PATTERN (insn)) == SEQUENCE
4001 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN
4002 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn), 0, 0)))
4005 for (link = current_function_epilogue_delay_list;
4007 link = XEXP (link, 1))
4009 insn = XEXP (link, 0);
4011 if (GET_CODE (insn) == CALL_INSN
4012 && ! SIBLING_CALL_P (insn))
4014 if (GET_CODE (insn) == INSN
4015 && GET_CODE (PATTERN (insn)) == SEQUENCE
4016 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN
4017 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn), 0, 0)))
4024 /* Return 1 if branch is an forward branch.
4025 Uses insn_shuid array, so it works only in the final pass. May be used by
4026 output templates to customary add branch prediction hints.
4029 final_forward_branch_p (insn)
4032 int insn_id, label_id;
4035 insn_id = INSN_SHUID (insn);
4036 label_id = INSN_SHUID (JUMP_LABEL (insn));
4037 /* We've hit some insns that does not have id information available. */
4038 if (!insn_id || !label_id)
4040 return insn_id < label_id;
4043 /* On some machines, a function with no call insns
4044 can run faster if it doesn't create its own register window.
4045 When output, the leaf function should use only the "output"
4046 registers. Ordinarily, the function would be compiled to use
4047 the "input" registers to find its arguments; it is a candidate
4048 for leaf treatment if it uses only the "input" registers.
4049 Leaf function treatment means renumbering so the function
4050 uses the "output" registers instead. */
4052 #ifdef LEAF_REGISTERS
4054 /* Return 1 if this function uses only the registers that can be
4055 safely renumbered. */
4058 only_leaf_regs_used ()
4061 char *permitted_reg_in_leaf_functions = LEAF_REGISTERS;
4063 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4064 if ((regs_ever_live[i] || global_regs[i])
4065 && ! permitted_reg_in_leaf_functions[i])
4068 if (current_function_uses_pic_offset_table
4069 && pic_offset_table_rtx != 0
4070 && GET_CODE (pic_offset_table_rtx) == REG
4071 && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4077 /* Scan all instructions and renumber all registers into those
4078 available in leaf functions. */
4081 leaf_renumber_regs (first)
4086 /* Renumber only the actual patterns.
4087 The reg-notes can contain frame pointer refs,
4088 and renumbering them could crash, and should not be needed. */
4089 for (insn = first; insn; insn = NEXT_INSN (insn))
4091 leaf_renumber_regs_insn (PATTERN (insn));
4092 for (insn = current_function_epilogue_delay_list;
4094 insn = XEXP (insn, 1))
4095 if (INSN_P (XEXP (insn, 0)))
4096 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
4099 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4100 available in leaf functions. */
4103 leaf_renumber_regs_insn (in_rtx)
4104 register rtx in_rtx;
4107 register const char *format_ptr;
4112 /* Renumber all input-registers into output-registers.
4113 renumbered_regs would be 1 for an output-register;
4116 if (GET_CODE (in_rtx) == REG)
4120 /* Don't renumber the same reg twice. */
4124 newreg = REGNO (in_rtx);
4125 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4126 to reach here as part of a REG_NOTE. */
4127 if (newreg >= FIRST_PSEUDO_REGISTER)
4132 newreg = LEAF_REG_REMAP (newreg);
4135 regs_ever_live[REGNO (in_rtx)] = 0;
4136 regs_ever_live[newreg] = 1;
4137 REGNO (in_rtx) = newreg;
4141 if (INSN_P (in_rtx))
4143 /* Inside a SEQUENCE, we find insns.
4144 Renumber just the patterns of these insns,
4145 just as we do for the top-level insns. */
4146 leaf_renumber_regs_insn (PATTERN (in_rtx));
4150 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
4152 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
4153 switch (*format_ptr++)
4156 leaf_renumber_regs_insn (XEXP (in_rtx, i));
4160 if (NULL != XVEC (in_rtx, i))
4162 for (j = 0; j < XVECLEN (in_rtx, i); j++)
4163 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));