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 GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
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 tree get_decl_from_op PARAMS ((rtx, int *));
248 static void output_asm_operand_names PARAMS ((rtx *, int *, int));
249 static void output_operand PARAMS ((rtx, int));
250 #ifdef LEAF_REGISTERS
251 static void leaf_renumber_regs PARAMS ((rtx));
254 static int alter_cond PARAMS ((rtx));
256 #ifndef ADDR_VEC_ALIGN
257 static int final_addr_vec_align PARAMS ((rtx));
259 #ifdef HAVE_ATTR_length
260 static int align_fuzz PARAMS ((rtx, rtx, int, unsigned));
263 /* Initialize data in final at the beginning of a compilation. */
266 init_final (filename)
267 const char *filename ATTRIBUTE_UNUSED;
272 #ifdef ASSEMBLER_DIALECT
273 dialect_number = ASSEMBLER_DIALECT;
277 /* Called at end of source file,
278 to output the block-profiling table for this entire compilation. */
282 const char *filename;
286 if (profile_block_flag || profile_arc_flag)
289 int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
293 int long_bytes = LONG_TYPE_SIZE / BITS_PER_UNIT;
294 int gcov_type_bytes = GCOV_TYPE_SIZE / BITS_PER_UNIT;
295 int pointer_bytes = POINTER_SIZE / BITS_PER_UNIT;
296 unsigned int align2 = LONG_TYPE_SIZE;
298 if (profile_block_flag)
299 size = long_bytes * count_basic_blocks;
301 size = gcov_type_bytes * count_instrumented_edges;
304 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
305 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
306 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
308 /* ??? This _really_ ought to be done with a structure layout
309 and with assemble_constructor. If long_bytes != pointer_bytes
310 we'll be emitting unaligned data at some point. */
311 if (long_bytes != pointer_bytes)
316 /* Output the main header, of 11 words:
317 0: 1 if this file is initialized, else 0.
318 1: address of file name (LPBX1).
319 2: address of table of counts (LPBX2).
320 3: number of counts in the table.
321 4: always 0, for compatibility with Sun.
323 The following are GNU extensions:
325 5: address of table of start addrs of basic blocks (LPBX3).
326 6: Number of bytes in this header.
327 7: address of table of function names (LPBX4).
328 8: address of table of line numbers (LPBX5) or 0.
329 9: address of table of file names (LPBX6) or 0.
330 10: space reserved for basic block profiling. */
332 ASM_OUTPUT_ALIGN (asm_out_file, align);
334 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0);
337 assemble_integer (const0_rtx, long_bytes, align2, 1);
339 /* Address of filename. */
340 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1);
341 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
344 /* Address of count table. */
345 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
346 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes,
349 /* Count of the # of basic blocks or # of instrumented arcs. */
350 assemble_integer (GEN_INT (profile_block_flag
352 : count_instrumented_edges),
353 long_bytes, align2, 1);
355 /* Zero word (link field). */
356 assemble_integer (const0_rtx, pointer_bytes, align2, 1);
358 /* address of basic block start address table */
359 if (profile_block_flag)
361 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
362 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
363 pointer_bytes, align2, 1);
366 assemble_integer (const0_rtx, pointer_bytes, align2, 1);
368 /* Byte count for extended structure. */
369 assemble_integer (GEN_INT (11 * UNITS_PER_WORD), long_bytes, align2, 1);
371 /* Address of function name table. */
372 if (profile_block_flag)
374 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4);
375 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
376 pointer_bytes, align2, 1);
379 assemble_integer (const0_rtx, pointer_bytes, align2, 1);
381 /* Address of line number and filename tables if debugging. */
382 if (write_symbols != NO_DEBUG && profile_block_flag)
384 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5);
385 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
386 pointer_bytes, align2, 1);
387 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6);
388 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
389 pointer_bytes, align2, 1);
393 assemble_integer (const0_rtx, pointer_bytes, align2, 1);
394 assemble_integer (const0_rtx, pointer_bytes, align2, 1);
397 /* Space for extension ptr (link field). */
398 assemble_integer (const0_rtx, UNITS_PER_WORD, align2, 1);
400 /* Output the file name changing the suffix to .d for
401 Sun tcov compatibility. */
402 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1);
404 char *cwd = getpwd ();
405 int len = strlen (filename) + strlen (cwd) + 1;
406 char *data_file = (char *) alloca (len + 4);
408 strcpy (data_file, cwd);
409 strcat (data_file, "/");
410 strcat (data_file, filename);
411 strip_off_ending (data_file, len);
412 if (profile_block_flag)
413 strcat (data_file, ".d");
415 strcat (data_file, ".da");
416 assemble_string (data_file, strlen (data_file) + 1);
419 /* Make space for the table of counts. */
422 /* Realign data section. */
423 ASM_OUTPUT_ALIGN (asm_out_file, align);
424 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2);
426 assemble_zeros (size);
430 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
431 #ifdef ASM_OUTPUT_SHARED_LOCAL
432 if (flag_shared_data)
433 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
436 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
437 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name,
438 size, BIGGEST_ALIGNMENT);
440 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
441 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
444 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
449 /* Output any basic block strings */
450 if (profile_block_flag)
452 readonly_data_section ();
455 ASM_OUTPUT_ALIGN (asm_out_file, align);
456 for (sptr = sbb_head; sptr != 0; sptr = sptr->next)
458 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC",
460 assemble_string (sptr->string, sptr->length);
465 /* Output the table of addresses. */
466 if (profile_block_flag)
468 /* Realign in new section */
469 ASM_OUTPUT_ALIGN (asm_out_file, align);
470 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3);
471 for (i = 0; i < count_basic_blocks; i++)
473 ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i);
474 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
475 pointer_bytes, align2, 1);
479 /* Output the table of function names. */
480 if (profile_block_flag)
482 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4);
483 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
485 if (ptr->func_label_num >= 0)
487 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
488 ptr->func_label_num);
489 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
490 pointer_bytes, align2, 1);
493 assemble_integer (const0_rtx, pointer_bytes, align2, 1);
496 for (; i < count_basic_blocks; i++)
497 assemble_integer (const0_rtx, pointer_bytes, align2, 1);
500 if (write_symbols != NO_DEBUG && profile_block_flag)
502 /* Output the table of line numbers. */
503 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5);
504 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
505 assemble_integer (GEN_INT (ptr->line_num), long_bytes, align2, 1);
507 for (; i < count_basic_blocks; i++)
508 assemble_integer (const0_rtx, long_bytes, align2, 1);
510 /* Output the table of file names. */
511 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6);
512 for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++)
514 if (ptr->file_label_num >= 0)
516 ASM_GENERATE_INTERNAL_LABEL (name, "LPBC",
517 ptr->file_label_num);
518 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
519 pointer_bytes, align2, 1);
522 assemble_integer (const0_rtx, pointer_bytes, align2, 1);
525 for (; i < count_basic_blocks; i++)
526 assemble_integer (const0_rtx, pointer_bytes, align2, 1);
529 /* End with the address of the table of addresses,
530 so we can find it easily, as the last word in the file's text. */
531 if (profile_block_flag)
533 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3);
534 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name),
535 pointer_bytes, align2, 1);
540 /* Default target function prologue and epilogue assembler output.
542 If not overridden for epilogue code, then the function body itself
543 contains return instructions wherever needed. */
545 default_function_pro_epilogue (file, size)
546 FILE *file ATTRIBUTE_UNUSED;
547 HOST_WIDE_INT size ATTRIBUTE_UNUSED;
551 /* Default target hook that outputs nothing to a stream. */
553 no_asm_to_stream (file)
554 FILE *file ATTRIBUTE_UNUSED;
558 /* Enable APP processing of subsequent output.
559 Used before the output from an `asm' statement. */
566 fputs (ASM_APP_ON, asm_out_file);
571 /* Disable APP processing of subsequent output.
572 Called from varasm.c before most kinds of output. */
579 fputs (ASM_APP_OFF, asm_out_file);
584 /* Return the number of slots filled in the current
585 delayed branch sequence (we don't count the insn needing the
586 delay slot). Zero if not in a delayed branch sequence. */
590 dbr_sequence_length ()
592 if (final_sequence != 0)
593 return XVECLEN (final_sequence, 0) - 1;
599 /* The next two pages contain routines used to compute the length of an insn
600 and to shorten branches. */
602 /* Arrays for insn lengths, and addresses. The latter is referenced by
603 `insn_current_length'. */
605 static short *insn_lengths;
607 #ifdef HAVE_ATTR_length
608 varray_type insn_addresses_;
611 /* Max uid for which the above arrays are valid. */
612 static int insn_lengths_max_uid;
614 /* Address of insn being processed. Used by `insn_current_length'. */
615 int insn_current_address;
617 /* Address of insn being processed in previous iteration. */
618 int insn_last_address;
620 /* konwn invariant alignment of insn being processed. */
621 int insn_current_align;
623 /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
624 gives the next following alignment insn that increases the known
625 alignment, or NULL_RTX if there is no such insn.
626 For any alignment obtained this way, we can again index uid_align with
627 its uid to obtain the next following align that in turn increases the
628 alignment, till we reach NULL_RTX; the sequence obtained this way
629 for each insn we'll call the alignment chain of this insn in the following
632 struct label_alignment
638 static rtx *uid_align;
639 static int *uid_shuid;
640 static struct label_alignment *label_align;
642 /* Indicate that branch shortening hasn't yet been done. */
656 insn_lengths_max_uid = 0;
658 #ifdef HAVE_ATTR_length
659 INSN_ADDRESSES_FREE ();
668 /* Obtain the current length of an insn. If branch shortening has been done,
669 get its actual length. Otherwise, get its maximum length. */
672 get_attr_length (insn)
673 rtx insn ATTRIBUTE_UNUSED;
675 #ifdef HAVE_ATTR_length
680 if (insn_lengths_max_uid > INSN_UID (insn))
681 return insn_lengths[INSN_UID (insn)];
683 switch (GET_CODE (insn))
691 length = insn_default_length (insn);
695 body = PATTERN (insn);
696 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
698 /* Alignment is machine-dependent and should be handled by
702 length = insn_default_length (insn);
706 body = PATTERN (insn);
707 if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
710 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
711 length = asm_insn_count (body) * insn_default_length (insn);
712 else if (GET_CODE (body) == SEQUENCE)
713 for (i = 0; i < XVECLEN (body, 0); i++)
714 length += get_attr_length (XVECEXP (body, 0, i));
716 length = insn_default_length (insn);
723 #ifdef ADJUST_INSN_LENGTH
724 ADJUST_INSN_LENGTH (insn, length);
727 #else /* not HAVE_ATTR_length */
729 #endif /* not HAVE_ATTR_length */
732 /* Code to handle alignment inside shorten_branches. */
734 /* Here is an explanation how the algorithm in align_fuzz can give
737 Call a sequence of instructions beginning with alignment point X
738 and continuing until the next alignment point `block X'. When `X'
739 is used in an expression, it means the alignment value of the
742 Call the distance between the start of the first insn of block X, and
743 the end of the last insn of block X `IX', for the `inner size of X'.
744 This is clearly the sum of the instruction lengths.
746 Likewise with the next alignment-delimited block following X, which we
749 Call the distance between the start of the first insn of block X, and
750 the start of the first insn of block Y `OX', for the `outer size of X'.
752 The estimated padding is then OX - IX.
754 OX can be safely estimated as
759 OX = round_up(IX, X) + Y - X
761 Clearly est(IX) >= real(IX), because that only depends on the
762 instruction lengths, and those being overestimated is a given.
764 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
765 we needn't worry about that when thinking about OX.
767 When X >= Y, the alignment provided by Y adds no uncertainty factor
768 for branch ranges starting before X, so we can just round what we have.
769 But when X < Y, we don't know anything about the, so to speak,
770 `middle bits', so we have to assume the worst when aligning up from an
771 address mod X to one mod Y, which is Y - X. */
774 #define LABEL_ALIGN(LABEL) align_labels_log
777 #ifndef LABEL_ALIGN_MAX_SKIP
778 #define LABEL_ALIGN_MAX_SKIP (align_labels-1)
782 #define LOOP_ALIGN(LABEL) align_loops_log
785 #ifndef LOOP_ALIGN_MAX_SKIP
786 #define LOOP_ALIGN_MAX_SKIP (align_loops-1)
789 #ifndef LABEL_ALIGN_AFTER_BARRIER
790 #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
793 #ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP
794 #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP 0
798 #define JUMP_ALIGN(LABEL) align_jumps_log
801 #ifndef JUMP_ALIGN_MAX_SKIP
802 #define JUMP_ALIGN_MAX_SKIP (align_jumps-1)
805 #ifndef ADDR_VEC_ALIGN
807 final_addr_vec_align (addr_vec)
810 int align = GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec)));
812 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
813 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
814 return exact_log2 (align);
818 #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
821 #ifndef INSN_LENGTH_ALIGNMENT
822 #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
825 #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
827 static int min_labelno, max_labelno;
829 #define LABEL_TO_ALIGNMENT(LABEL) \
830 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
832 #define LABEL_TO_MAX_SKIP(LABEL) \
833 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
835 /* For the benefit of port specific code do this also as a function. */
838 label_to_alignment (label)
841 return LABEL_TO_ALIGNMENT (label);
844 #ifdef HAVE_ATTR_length
845 /* The differences in addresses
846 between a branch and its target might grow or shrink depending on
847 the alignment the start insn of the range (the branch for a forward
848 branch or the label for a backward branch) starts out on; if these
849 differences are used naively, they can even oscillate infinitely.
850 We therefore want to compute a 'worst case' address difference that
851 is independent of the alignment the start insn of the range end
852 up on, and that is at least as large as the actual difference.
853 The function align_fuzz calculates the amount we have to add to the
854 naively computed difference, by traversing the part of the alignment
855 chain of the start insn of the range that is in front of the end insn
856 of the range, and considering for each alignment the maximum amount
857 that it might contribute to a size increase.
859 For casesi tables, we also want to know worst case minimum amounts of
860 address difference, in case a machine description wants to introduce
861 some common offset that is added to all offsets in a table.
862 For this purpose, align_fuzz with a growth argument of 0 comuptes the
863 appropriate adjustment. */
865 /* Compute the maximum delta by which the difference of the addresses of
866 START and END might grow / shrink due to a different address for start
867 which changes the size of alignment insns between START and END.
868 KNOWN_ALIGN_LOG is the alignment known for START.
869 GROWTH should be ~0 if the objective is to compute potential code size
870 increase, and 0 if the objective is to compute potential shrink.
871 The return value is undefined for any other value of GROWTH. */
874 align_fuzz (start, end, known_align_log, growth)
879 int uid = INSN_UID (start);
881 int known_align = 1 << known_align_log;
882 int end_shuid = INSN_SHUID (end);
885 for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
887 int align_addr, new_align;
889 uid = INSN_UID (align_label);
890 align_addr = INSN_ADDRESSES (uid) - insn_lengths[uid];
891 if (uid_shuid[uid] > end_shuid)
893 known_align_log = LABEL_TO_ALIGNMENT (align_label);
894 new_align = 1 << known_align_log;
895 if (new_align < known_align)
897 fuzz += (-align_addr ^ growth) & (new_align - known_align);
898 known_align = new_align;
903 /* Compute a worst-case reference address of a branch so that it
904 can be safely used in the presence of aligned labels. Since the
905 size of the branch itself is unknown, the size of the branch is
906 not included in the range. I.e. for a forward branch, the reference
907 address is the end address of the branch as known from the previous
908 branch shortening pass, minus a value to account for possible size
909 increase due to alignment. For a backward branch, it is the start
910 address of the branch as known from the current pass, plus a value
911 to account for possible size increase due to alignment.
912 NB.: Therefore, the maximum offset allowed for backward branches needs
913 to exclude the branch size. */
916 insn_current_reference_address (branch)
922 if (! INSN_ADDRESSES_SET_P ())
925 seq = NEXT_INSN (PREV_INSN (branch));
926 seq_uid = INSN_UID (seq);
927 if (GET_CODE (branch) != JUMP_INSN)
928 /* This can happen for example on the PA; the objective is to know the
929 offset to address something in front of the start of the function.
930 Thus, we can treat it like a backward branch.
931 We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
932 any alignment we'd encounter, so we skip the call to align_fuzz. */
933 return insn_current_address;
934 dest = JUMP_LABEL (branch);
936 /* BRANCH has no proper alignment chain set, so use SEQ.
937 BRANCH also has no INSN_SHUID. */
938 if (INSN_SHUID (seq) < INSN_SHUID (dest))
940 /* Forward branch. */
941 return (insn_last_address + insn_lengths[seq_uid]
942 - align_fuzz (seq, dest, length_unit_log, ~0));
946 /* Backward branch. */
947 return (insn_current_address
948 + align_fuzz (dest, seq, length_unit_log, ~0));
951 #endif /* HAVE_ATTR_length */
954 compute_alignments ()
957 int log, max_skip, max_log;
965 max_labelno = max_label_num ();
966 min_labelno = get_first_label_num ();
967 label_align = (struct label_alignment *)
968 xcalloc (max_labelno - min_labelno + 1, sizeof (struct label_alignment));
970 /* If not optimizing or optimizing for size, don't assign any alignments. */
971 if (! optimize || optimize_size)
974 for (i = 0; i < n_basic_blocks; i++)
976 basic_block bb = BASIC_BLOCK (i);
977 rtx label = bb->head;
978 int fallthru_frequency = 0, branch_frequency = 0, has_fallthru = 0;
981 if (GET_CODE (label) != CODE_LABEL)
983 max_log = LABEL_ALIGN (label);
984 max_skip = LABEL_ALIGN_MAX_SKIP;
986 for (e = bb->pred; e; e = e->pred_next)
988 if (e->flags & EDGE_FALLTHRU)
989 has_fallthru = 1, fallthru_frequency += EDGE_FREQUENCY (e);
991 branch_frequency += EDGE_FREQUENCY (e);
994 /* There are two purposes to align block with no fallthru incoming edge:
995 1) to avoid fetch stalls when branch destination is near cache boundary
996 2) to improve cache effciency in case the previous block is not executed
997 (so it does not need to be in the cache).
999 We to catch first case, we align frequently executed blocks.
1000 To catch the second, we align blocks that are executed more frequently
1001 than the predecesor and the predecesor is likely to not be executed
1002 when function is called. */
1005 && (branch_frequency > BB_FREQ_MAX / 10
1006 || (bb->frequency > BASIC_BLOCK (i - 1)->frequency * 10
1007 && (BASIC_BLOCK (i - 1)->frequency
1008 <= ENTRY_BLOCK_PTR->frequency / 2))))
1010 log = JUMP_ALIGN (label);
1014 max_skip = JUMP_ALIGN_MAX_SKIP;
1017 /* In case block is frequent and reached mostly by non-fallthru edge,
1018 align it. It is most likely an first block of loop. */
1020 && branch_frequency + fallthru_frequency > BB_FREQ_MAX / 10
1021 && branch_frequency > fallthru_frequency * 5)
1023 log = LOOP_ALIGN (label);
1027 max_skip = LOOP_ALIGN_MAX_SKIP;
1030 LABEL_TO_ALIGNMENT (label) = max_log;
1031 LABEL_TO_MAX_SKIP (label) = max_skip;
1035 /* Make a pass over all insns and compute their actual lengths by shortening
1036 any branches of variable length if possible. */
1038 /* Give a default value for the lowest address in a function. */
1040 #ifndef FIRST_INSN_ADDRESS
1041 #define FIRST_INSN_ADDRESS 0
1044 /* shorten_branches might be called multiple times: for example, the SH
1045 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
1046 In order to do this, it needs proper length information, which it obtains
1047 by calling shorten_branches. This cannot be collapsed with
1048 shorten_branches itself into a single pass unless we also want to intergate
1049 reorg.c, since the branch splitting exposes new instructions with delay
1053 shorten_branches (first)
1054 rtx first ATTRIBUTE_UNUSED;
1061 #ifdef HAVE_ATTR_length
1062 #define MAX_CODE_ALIGN 16
1064 int something_changed = 1;
1065 char *varying_length;
1068 rtx align_tab[MAX_CODE_ALIGN];
1072 /* Compute maximum UID and allocate label_align / uid_shuid. */
1073 max_uid = get_max_uid ();
1075 uid_shuid = (int *) xmalloc (max_uid * sizeof *uid_shuid);
1077 if (max_labelno != max_label_num ())
1079 int old = max_labelno;
1083 max_labelno = max_label_num ();
1085 n_labels = max_labelno - min_labelno + 1;
1086 n_old_labels = old - min_labelno + 1;
1088 label_align = (struct label_alignment *) xrealloc
1089 (label_align, n_labels * sizeof (struct label_alignment));
1091 /* Range of labels grows monotonically in the function. Abort here
1092 means that the initialization of array got lost. */
1093 if (n_old_labels > n_labels)
1096 memset (label_align + n_old_labels, 0,
1097 (n_labels - n_old_labels) * sizeof (struct label_alignment));
1100 /* Initialize label_align and set up uid_shuid to be strictly
1101 monotonically rising with insn order. */
1102 /* We use max_log here to keep track of the maximum alignment we want to
1103 impose on the next CODE_LABEL (or the current one if we are processing
1104 the CODE_LABEL itself). */
1109 for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
1113 INSN_SHUID (insn) = i++;
1116 /* reorg might make the first insn of a loop being run once only,
1117 and delete the label in front of it. Then we want to apply
1118 the loop alignment to the new label created by reorg, which
1119 is separated by the former loop start insn from the
1120 NOTE_INSN_LOOP_BEG. */
1122 else if (GET_CODE (insn) == CODE_LABEL)
1126 /* Merge in alignments computed by compute_alignments. */
1127 log = LABEL_TO_ALIGNMENT (insn);
1131 max_skip = LABEL_TO_MAX_SKIP (insn);
1134 log = LABEL_ALIGN (insn);
1138 max_skip = LABEL_ALIGN_MAX_SKIP;
1140 next = NEXT_INSN (insn);
1141 /* ADDR_VECs only take room if read-only data goes into the text
1143 if (JUMP_TABLES_IN_TEXT_SECTION
1144 #if !defined(READONLY_DATA_SECTION)
1148 if (next && GET_CODE (next) == JUMP_INSN)
1150 rtx nextbody = PATTERN (next);
1151 if (GET_CODE (nextbody) == ADDR_VEC
1152 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
1154 log = ADDR_VEC_ALIGN (next);
1158 max_skip = LABEL_ALIGN_MAX_SKIP;
1162 LABEL_TO_ALIGNMENT (insn) = max_log;
1163 LABEL_TO_MAX_SKIP (insn) = max_skip;
1167 else if (GET_CODE (insn) == BARRIER)
1171 for (label = insn; label && ! INSN_P (label);
1172 label = NEXT_INSN (label))
1173 if (GET_CODE (label) == CODE_LABEL)
1175 log = LABEL_ALIGN_AFTER_BARRIER (insn);
1179 max_skip = LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP;
1185 #ifdef HAVE_ATTR_length
1187 /* Allocate the rest of the arrays. */
1188 insn_lengths = (short *) xmalloc (max_uid * sizeof (short));
1189 insn_lengths_max_uid = max_uid;
1190 /* Syntax errors can lead to labels being outside of the main insn stream.
1191 Initialize insn_addresses, so that we get reproducible results. */
1192 INSN_ADDRESSES_ALLOC (max_uid);
1194 varying_length = (char *) xcalloc (max_uid, sizeof (char));
1196 /* Initialize uid_align. We scan instructions
1197 from end to start, and keep in align_tab[n] the last seen insn
1198 that does an alignment of at least n+1, i.e. the successor
1199 in the alignment chain for an insn that does / has a known
1201 uid_align = (rtx *) xcalloc (max_uid, sizeof *uid_align);
1203 for (i = MAX_CODE_ALIGN; --i >= 0;)
1204 align_tab[i] = NULL_RTX;
1205 seq = get_last_insn ();
1206 for (; seq; seq = PREV_INSN (seq))
1208 int uid = INSN_UID (seq);
1210 log = (GET_CODE (seq) == CODE_LABEL ? LABEL_TO_ALIGNMENT (seq) : 0);
1211 uid_align[uid] = align_tab[0];
1214 /* Found an alignment label. */
1215 uid_align[uid] = align_tab[log];
1216 for (i = log - 1; i >= 0; i--)
1220 #ifdef CASE_VECTOR_SHORTEN_MODE
1223 /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
1226 int min_shuid = INSN_SHUID (get_insns ()) - 1;
1227 int max_shuid = INSN_SHUID (get_last_insn ()) + 1;
1230 for (insn = first; insn != 0; insn = NEXT_INSN (insn))
1232 rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat;
1233 int len, i, min, max, insn_shuid;
1235 addr_diff_vec_flags flags;
1237 if (GET_CODE (insn) != JUMP_INSN
1238 || GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)
1240 pat = PATTERN (insn);
1241 len = XVECLEN (pat, 1);
1244 min_align = MAX_CODE_ALIGN;
1245 for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
1247 rtx lab = XEXP (XVECEXP (pat, 1, i), 0);
1248 int shuid = INSN_SHUID (lab);
1259 if (min_align > LABEL_TO_ALIGNMENT (lab))
1260 min_align = LABEL_TO_ALIGNMENT (lab);
1262 XEXP (pat, 2) = gen_rtx_LABEL_REF (VOIDmode, min_lab);
1263 XEXP (pat, 3) = gen_rtx_LABEL_REF (VOIDmode, max_lab);
1264 insn_shuid = INSN_SHUID (insn);
1265 rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0));
1266 flags.min_align = min_align;
1267 flags.base_after_vec = rel > insn_shuid;
1268 flags.min_after_vec = min > insn_shuid;
1269 flags.max_after_vec = max > insn_shuid;
1270 flags.min_after_base = min > rel;
1271 flags.max_after_base = max > rel;
1272 ADDR_DIFF_VEC_FLAGS (pat) = flags;
1275 #endif /* CASE_VECTOR_SHORTEN_MODE */
1277 /* Compute initial lengths, addresses, and varying flags for each insn. */
1278 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1280 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1282 uid = INSN_UID (insn);
1284 insn_lengths[uid] = 0;
1286 if (GET_CODE (insn) == CODE_LABEL)
1288 int log = LABEL_TO_ALIGNMENT (insn);
1291 int align = 1 << log;
1292 int new_address = (insn_current_address + align - 1) & -align;
1293 insn_lengths[uid] = new_address - insn_current_address;
1297 INSN_ADDRESSES (uid) = insn_current_address;
1299 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
1300 || GET_CODE (insn) == CODE_LABEL)
1302 if (INSN_DELETED_P (insn))
1305 body = PATTERN (insn);
1306 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
1308 /* This only takes room if read-only data goes into the text
1310 if (JUMP_TABLES_IN_TEXT_SECTION
1311 #if !defined(READONLY_DATA_SECTION)
1315 insn_lengths[uid] = (XVECLEN (body,
1316 GET_CODE (body) == ADDR_DIFF_VEC)
1317 * GET_MODE_SIZE (GET_MODE (body)));
1318 /* Alignment is handled by ADDR_VEC_ALIGN. */
1320 else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
1321 insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
1322 else if (GET_CODE (body) == SEQUENCE)
1325 int const_delay_slots;
1327 const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0));
1329 const_delay_slots = 0;
1331 /* Inside a delay slot sequence, we do not do any branch shortening
1332 if the shortening could change the number of delay slots
1334 for (i = 0; i < XVECLEN (body, 0); i++)
1336 rtx inner_insn = XVECEXP (body, 0, i);
1337 int inner_uid = INSN_UID (inner_insn);
1340 if (GET_CODE (body) == ASM_INPUT
1341 || asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0)
1342 inner_length = (asm_insn_count (PATTERN (inner_insn))
1343 * insn_default_length (inner_insn));
1345 inner_length = insn_default_length (inner_insn);
1347 insn_lengths[inner_uid] = inner_length;
1348 if (const_delay_slots)
1350 if ((varying_length[inner_uid]
1351 = insn_variable_length_p (inner_insn)) != 0)
1352 varying_length[uid] = 1;
1353 INSN_ADDRESSES (inner_uid) = (insn_current_address
1354 + insn_lengths[uid]);
1357 varying_length[inner_uid] = 0;
1358 insn_lengths[uid] += inner_length;
1361 else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
1363 insn_lengths[uid] = insn_default_length (insn);
1364 varying_length[uid] = insn_variable_length_p (insn);
1367 /* If needed, do any adjustment. */
1368 #ifdef ADJUST_INSN_LENGTH
1369 ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
1370 if (insn_lengths[uid] < 0)
1371 fatal_insn ("Negative insn length", insn);
1375 /* Now loop over all the insns finding varying length insns. For each,
1376 get the current insn length. If it has changed, reflect the change.
1377 When nothing changes for a full pass, we are done. */
1379 while (something_changed)
1381 something_changed = 0;
1382 insn_current_align = MAX_CODE_ALIGN - 1;
1383 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1385 insn = NEXT_INSN (insn))
1388 #ifdef ADJUST_INSN_LENGTH
1393 uid = INSN_UID (insn);
1395 if (GET_CODE (insn) == CODE_LABEL)
1397 int log = LABEL_TO_ALIGNMENT (insn);
1398 if (log > insn_current_align)
1400 int align = 1 << log;
1401 int new_address= (insn_current_address + align - 1) & -align;
1402 insn_lengths[uid] = new_address - insn_current_address;
1403 insn_current_align = log;
1404 insn_current_address = new_address;
1407 insn_lengths[uid] = 0;
1408 INSN_ADDRESSES (uid) = insn_current_address;
1412 length_align = INSN_LENGTH_ALIGNMENT (insn);
1413 if (length_align < insn_current_align)
1414 insn_current_align = length_align;
1416 insn_last_address = INSN_ADDRESSES (uid);
1417 INSN_ADDRESSES (uid) = insn_current_address;
1419 #ifdef CASE_VECTOR_SHORTEN_MODE
1420 if (optimize && GET_CODE (insn) == JUMP_INSN
1421 && GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
1423 rtx body = PATTERN (insn);
1424 int old_length = insn_lengths[uid];
1425 rtx rel_lab = XEXP (XEXP (body, 0), 0);
1426 rtx min_lab = XEXP (XEXP (body, 2), 0);
1427 rtx max_lab = XEXP (XEXP (body, 3), 0);
1428 addr_diff_vec_flags flags = ADDR_DIFF_VEC_FLAGS (body);
1429 int rel_addr = INSN_ADDRESSES (INSN_UID (rel_lab));
1430 int min_addr = INSN_ADDRESSES (INSN_UID (min_lab));
1431 int max_addr = INSN_ADDRESSES (INSN_UID (max_lab));
1435 /* Try to find a known alignment for rel_lab. */
1436 for (prev = rel_lab;
1438 && ! insn_lengths[INSN_UID (prev)]
1439 && ! (varying_length[INSN_UID (prev)] & 1);
1440 prev = PREV_INSN (prev))
1441 if (varying_length[INSN_UID (prev)] & 2)
1443 rel_align = LABEL_TO_ALIGNMENT (prev);
1447 /* See the comment on addr_diff_vec_flags in rtl.h for the
1448 meaning of the flags values. base: REL_LAB vec: INSN */
1449 /* Anything after INSN has still addresses from the last
1450 pass; adjust these so that they reflect our current
1451 estimate for this pass. */
1452 if (flags.base_after_vec)
1453 rel_addr += insn_current_address - insn_last_address;
1454 if (flags.min_after_vec)
1455 min_addr += insn_current_address - insn_last_address;
1456 if (flags.max_after_vec)
1457 max_addr += insn_current_address - insn_last_address;
1458 /* We want to know the worst case, i.e. lowest possible value
1459 for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1460 its offset is positive, and we have to be wary of code shrink;
1461 otherwise, it is negative, and we have to be vary of code
1463 if (flags.min_after_base)
1465 /* If INSN is between REL_LAB and MIN_LAB, the size
1466 changes we are about to make can change the alignment
1467 within the observed offset, therefore we have to break
1468 it up into two parts that are independent. */
1469 if (! flags.base_after_vec && flags.min_after_vec)
1471 min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
1472 min_addr -= align_fuzz (insn, min_lab, 0, 0);
1475 min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
1479 if (flags.base_after_vec && ! flags.min_after_vec)
1481 min_addr -= align_fuzz (min_lab, insn, 0, ~0);
1482 min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
1485 min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
1487 /* Likewise, determine the highest lowest possible value
1488 for the offset of MAX_LAB. */
1489 if (flags.max_after_base)
1491 if (! flags.base_after_vec && flags.max_after_vec)
1493 max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
1494 max_addr += align_fuzz (insn, max_lab, 0, ~0);
1497 max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
1501 if (flags.base_after_vec && ! flags.max_after_vec)
1503 max_addr += align_fuzz (max_lab, insn, 0, 0);
1504 max_addr += align_fuzz (insn, rel_lab, 0, 0);
1507 max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
1509 PUT_MODE (body, CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
1510 max_addr - rel_addr,
1512 if (JUMP_TABLES_IN_TEXT_SECTION
1513 #if !defined(READONLY_DATA_SECTION)
1519 = (XVECLEN (body, 1) * GET_MODE_SIZE (GET_MODE (body)));
1520 insn_current_address += insn_lengths[uid];
1521 if (insn_lengths[uid] != old_length)
1522 something_changed = 1;
1527 #endif /* CASE_VECTOR_SHORTEN_MODE */
1529 if (! (varying_length[uid]))
1531 if (GET_CODE (insn) == INSN
1532 && GET_CODE (PATTERN (insn)) == SEQUENCE)
1536 body = PATTERN (insn);
1537 for (i = 0; i < XVECLEN (body, 0); i++)
1539 rtx inner_insn = XVECEXP (body, 0, i);
1540 int inner_uid = INSN_UID (inner_insn);
1542 INSN_ADDRESSES (inner_uid) = insn_current_address;
1544 insn_current_address += insn_lengths[inner_uid];
1548 insn_current_address += insn_lengths[uid];
1553 if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE)
1557 body = PATTERN (insn);
1559 for (i = 0; i < XVECLEN (body, 0); i++)
1561 rtx inner_insn = XVECEXP (body, 0, i);
1562 int inner_uid = INSN_UID (inner_insn);
1565 INSN_ADDRESSES (inner_uid) = insn_current_address;
1567 /* insn_current_length returns 0 for insns with a
1568 non-varying length. */
1569 if (! varying_length[inner_uid])
1570 inner_length = insn_lengths[inner_uid];
1572 inner_length = insn_current_length (inner_insn);
1574 if (inner_length != insn_lengths[inner_uid])
1576 insn_lengths[inner_uid] = inner_length;
1577 something_changed = 1;
1579 insn_current_address += insn_lengths[inner_uid];
1580 new_length += inner_length;
1585 new_length = insn_current_length (insn);
1586 insn_current_address += new_length;
1589 #ifdef ADJUST_INSN_LENGTH
1590 /* If needed, do any adjustment. */
1591 tmp_length = new_length;
1592 ADJUST_INSN_LENGTH (insn, new_length);
1593 insn_current_address += (new_length - tmp_length);
1596 if (new_length != insn_lengths[uid])
1598 insn_lengths[uid] = new_length;
1599 something_changed = 1;
1602 /* For a non-optimizing compile, do only a single pass. */
1607 free (varying_length);
1609 #endif /* HAVE_ATTR_length */
1612 #ifdef HAVE_ATTR_length
1613 /* Given the body of an INSN known to be generated by an ASM statement, return
1614 the number of machine instructions likely to be generated for this insn.
1615 This is used to compute its length. */
1618 asm_insn_count (body)
1621 const char *template;
1624 if (GET_CODE (body) == ASM_INPUT)
1625 template = XSTR (body, 0);
1627 template = decode_asm_operands (body, NULL, NULL, NULL, NULL);
1629 for (; *template; template++)
1630 if (IS_ASM_LOGICAL_LINE_SEPARATOR (*template) || *template == '\n')
1637 /* Output assembler code for the start of a function,
1638 and initialize some of the variables in this file
1639 for the new function. The label for the function and associated
1640 assembler pseudo-ops have already been output in `assemble_start_function'.
1642 FIRST is the first insn of the rtl for the function being compiled.
1643 FILE is the file to write assembler code to.
1644 OPTIMIZE is nonzero if we should eliminate redundant
1645 test and compare insns. */
1648 final_start_function (first, file, optimize)
1651 int optimize ATTRIBUTE_UNUSED;
1655 this_is_asm_operands = 0;
1657 #ifdef NON_SAVING_SETJMP
1658 /* A function that calls setjmp should save and restore all the
1659 call-saved registers on a system where longjmp clobbers them. */
1660 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
1664 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1665 if (!call_used_regs[i])
1666 regs_ever_live[i] = 1;
1670 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1671 notice_source_line (first);
1672 high_block_linenum = high_function_linenum = last_linenum;
1674 (*debug_hooks->begin_prologue) (last_linenum, last_filename);
1676 #if defined (DWARF2_UNWIND_INFO) || defined (IA64_UNWIND_INFO)
1677 if (write_symbols != DWARF2_DEBUG)
1678 dwarf2out_begin_prologue (0, NULL);
1681 #ifdef LEAF_REG_REMAP
1682 if (current_function_uses_only_leaf_regs)
1683 leaf_renumber_regs (first);
1686 /* The Sun386i and perhaps other machines don't work right
1687 if the profiling code comes after the prologue. */
1688 #ifdef PROFILE_BEFORE_PROLOGUE
1690 profile_function (file);
1691 #endif /* PROFILE_BEFORE_PROLOGUE */
1693 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1694 if (dwarf2out_do_frame ())
1695 dwarf2out_frame_debug (NULL_RTX);
1698 /* If debugging, assign block numbers to all of the blocks in this
1702 remove_unnecessary_notes ();
1704 number_blocks (current_function_decl);
1705 /* We never actually put out begin/end notes for the top-level
1706 block in the function. But, conceptually, that block is
1708 TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl)) = 1;
1711 /* First output the function prologue: code to set up the stack frame. */
1712 (*targetm.asm_out.function_prologue) (file, get_frame_size ());
1714 /* If the machine represents the prologue as RTL, the profiling code must
1715 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1716 #ifdef HAVE_prologue
1717 if (! HAVE_prologue)
1719 profile_after_prologue (file);
1723 /* If we are doing basic block profiling, remember a printable version
1724 of the function name. */
1725 if (profile_block_flag)
1728 add_bb_string ((*decl_printable_name) (current_function_decl, 2),
1734 profile_after_prologue (file)
1735 FILE *file ATTRIBUTE_UNUSED;
1737 #ifdef FUNCTION_BLOCK_PROFILER
1738 if (profile_block_flag)
1740 FUNCTION_BLOCK_PROFILER (file, count_basic_blocks);
1742 #endif /* FUNCTION_BLOCK_PROFILER */
1744 #ifndef PROFILE_BEFORE_PROLOGUE
1746 profile_function (file);
1747 #endif /* not PROFILE_BEFORE_PROLOGUE */
1751 profile_function (file)
1754 #ifndef NO_PROFILE_COUNTERS
1755 int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1757 #if defined(ASM_OUTPUT_REG_PUSH)
1758 #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1759 int sval = current_function_returns_struct;
1761 #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1762 int cxt = current_function_needs_context;
1764 #endif /* ASM_OUTPUT_REG_PUSH */
1766 #ifndef NO_PROFILE_COUNTERS
1768 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1769 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no);
1770 assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, align, 1);
1773 function_section (current_function_decl);
1775 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1777 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
1779 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1782 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1787 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1789 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1791 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1794 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM);
1799 FUNCTION_PROFILER (file, profile_label_no);
1801 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1803 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM);
1805 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1808 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1813 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1815 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1817 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1820 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1826 /* Output assembler code for the end of a function.
1827 For clarity, args are same as those of `final_start_function'
1828 even though not all of them are needed. */
1831 final_end_function ()
1835 (*debug_hooks->end_function) (high_function_linenum);
1837 /* Finally, output the function epilogue:
1838 code to restore the stack frame and return to the caller. */
1839 (*targetm.asm_out.function_epilogue) (asm_out_file, get_frame_size ());
1841 /* And debug output. */
1842 (*debug_hooks->end_epilogue) ();
1844 #if defined (DWARF2_UNWIND_INFO)
1845 if (write_symbols != DWARF2_DEBUG && dwarf2out_do_frame ())
1846 dwarf2out_end_epilogue ();
1849 bb_func_label_num = -1; /* not in function, nuke label # */
1852 /* Add a block to the linked list that remembers the current line/file/function
1853 for basic block profiling. Emit the label in front of the basic block and
1854 the instructions that increment the count field. */
1860 struct bb_list *ptr =
1861 (struct bb_list *) permalloc (sizeof (struct bb_list));
1863 /* Add basic block to linked list. */
1865 ptr->line_num = last_linenum;
1866 ptr->file_label_num = bb_file_label_num;
1867 ptr->func_label_num = bb_func_label_num;
1869 bb_tail = &ptr->next;
1871 /* Enable the table of basic-block use counts
1872 to point at the code it applies to. */
1873 ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks);
1875 /* Before first insn of this basic block, increment the
1876 count of times it was entered. */
1877 #ifdef BLOCK_PROFILER
1878 BLOCK_PROFILER (file, count_basic_blocks);
1885 count_basic_blocks++;
1888 /* Add a string to be used for basic block profiling. */
1891 add_bb_string (string, perm_p)
1896 struct bb_str *ptr = 0;
1900 string = "<unknown>";
1904 /* Allocate a new string if the current string isn't permanent. If
1905 the string is permanent search for the same string in other
1908 len = strlen (string) + 1;
1911 char *p = (char *) permalloc (len);
1912 memcpy (p, string, len);
1916 for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next)
1917 if (ptr->string == string)
1920 /* Allocate a new string block if we need to. */
1923 ptr = (struct bb_str *) permalloc (sizeof (*ptr));
1926 ptr->label_num = sbb_label_num++;
1927 ptr->string = string;
1929 sbb_tail = &ptr->next;
1932 return ptr->label_num;
1935 /* Output assembler code for some insns: all or part of a function.
1936 For description of args, see `final_start_function', above.
1938 PRESCAN is 1 if we are not really outputting,
1939 just scanning as if we were outputting.
1940 Prescanning deletes and rearranges insns just like ordinary output.
1941 PRESCAN is -2 if we are outputting after having prescanned.
1942 In this case, don't try to delete or rearrange insns
1943 because that has already been done.
1944 Prescanning is done only on certain machines. */
1947 final (first, file, optimize, prescan)
1957 last_ignored_compare = 0;
1960 /* Make a map indicating which line numbers appear in this function.
1961 When producing SDB debugging info, delete troublesome line number
1962 notes from inlined functions in other files as well as duplicate
1963 line number notes. */
1964 #ifdef SDB_DEBUGGING_INFO
1965 if (write_symbols == SDB_DEBUG)
1968 for (insn = first; insn; insn = NEXT_INSN (insn))
1969 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1971 if ((RTX_INTEGRATED_P (insn)
1972 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1974 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1975 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1977 delete_insn (insn); /* Use delete_note. */
1981 if (NOTE_LINE_NUMBER (insn) > max_line)
1982 max_line = NOTE_LINE_NUMBER (insn);
1988 for (insn = first; insn; insn = NEXT_INSN (insn))
1989 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1990 max_line = NOTE_LINE_NUMBER (insn);
1993 line_note_exists = (char *) xcalloc (max_line + 1, sizeof (char));
1995 for (insn = first; insn; insn = NEXT_INSN (insn))
1997 if (INSN_UID (insn) > max_uid) /* find largest UID */
1998 max_uid = INSN_UID (insn);
1999 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
2000 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
2002 /* If CC tracking across branches is enabled, record the insn which
2003 jumps to each branch only reached from one place. */
2004 if (optimize && GET_CODE (insn) == JUMP_INSN)
2006 rtx lab = JUMP_LABEL (insn);
2007 if (lab && LABEL_NUSES (lab) == 1)
2009 LABEL_REFS (lab) = insn;
2019 /* Output the insns. */
2020 for (insn = NEXT_INSN (first); insn;)
2022 #ifdef HAVE_ATTR_length
2023 if ((unsigned) INSN_UID (insn) >= INSN_ADDRESSES_SIZE ())
2026 /* Irritatingly, the reg-stack pass is creating new instructions
2027 and because of REG_DEAD note abuse it has to run after
2028 shorten_branches. Fake address of -1 then. */
2029 insn_current_address = -1;
2031 /* This can be triggered by bugs elsewhere in the compiler if
2032 new insns are created after init_insn_lengths is called. */
2037 insn_current_address = INSN_ADDRESSES (INSN_UID (insn));
2038 #endif /* HAVE_ATTR_length */
2040 insn = final_scan_insn (insn, file, optimize, prescan, 0);
2043 /* Do basic-block profiling here
2044 if the last insn was a conditional branch. */
2045 if (profile_block_flag && new_block)
2048 free (line_note_exists);
2049 line_note_exists = NULL;
2053 get_insn_template (code, insn)
2057 const void *output = insn_data[code].output;
2058 switch (insn_data[code].output_format)
2060 case INSN_OUTPUT_FORMAT_SINGLE:
2061 return (const char *) output;
2062 case INSN_OUTPUT_FORMAT_MULTI:
2063 return ((const char *const *) output)[which_alternative];
2064 case INSN_OUTPUT_FORMAT_FUNCTION:
2067 return (*(insn_output_fn) output) (recog_data.operand, insn);
2074 /* The final scan for one insn, INSN.
2075 Args are same as in `final', except that INSN
2076 is the insn being scanned.
2077 Value returned is the next insn to be scanned.
2079 NOPEEPHOLES is the flag to disallow peephole processing (currently
2080 used for within delayed branch sequence output). */
2083 final_scan_insn (insn, file, optimize, prescan, nopeepholes)
2086 int optimize ATTRIBUTE_UNUSED;
2088 int nopeepholes ATTRIBUTE_UNUSED;
2096 /* Ignore deleted insns. These can occur when we split insns (due to a
2097 template of "#") while not optimizing. */
2098 if (INSN_DELETED_P (insn))
2099 return NEXT_INSN (insn);
2101 switch (GET_CODE (insn))
2107 switch (NOTE_LINE_NUMBER (insn))
2109 case NOTE_INSN_DELETED:
2110 case NOTE_INSN_LOOP_BEG:
2111 case NOTE_INSN_LOOP_END:
2112 case NOTE_INSN_LOOP_CONT:
2113 case NOTE_INSN_LOOP_VTOP:
2114 case NOTE_INSN_FUNCTION_END:
2115 case NOTE_INSN_REPEATED_LINE_NUMBER:
2116 case NOTE_INSN_RANGE_BEG:
2117 case NOTE_INSN_RANGE_END:
2118 case NOTE_INSN_LIVE:
2119 case NOTE_INSN_EXPECTED_VALUE:
2122 case NOTE_INSN_BASIC_BLOCK:
2123 #ifdef IA64_UNWIND_INFO
2124 IA64_UNWIND_EMIT (asm_out_file, insn);
2127 fprintf (asm_out_file, "\t%s basic block %d\n",
2128 ASM_COMMENT_START, NOTE_BASIC_BLOCK (insn)->index);
2131 case NOTE_INSN_EH_REGION_BEG:
2132 ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LEHB",
2133 NOTE_EH_HANDLER (insn));
2136 case NOTE_INSN_EH_REGION_END:
2137 ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LEHE",
2138 NOTE_EH_HANDLER (insn));
2141 case NOTE_INSN_PROLOGUE_END:
2142 (*targetm.asm_out.function_end_prologue) (file);
2143 profile_after_prologue (file);
2146 case NOTE_INSN_EPILOGUE_BEG:
2147 (*targetm.asm_out.function_begin_epilogue) (file);
2150 case NOTE_INSN_FUNCTION_BEG:
2152 (*debug_hooks->end_prologue) (last_linenum);
2155 case NOTE_INSN_BLOCK_BEG:
2156 if (debug_info_level == DINFO_LEVEL_NORMAL
2157 || debug_info_level == DINFO_LEVEL_VERBOSE
2158 || write_symbols == DWARF_DEBUG
2159 || write_symbols == DWARF2_DEBUG)
2161 int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
2165 high_block_linenum = last_linenum;
2167 /* Output debugging info about the symbol-block beginning. */
2168 (*debug_hooks->begin_block) (last_linenum, n);
2170 /* Mark this block as output. */
2171 TREE_ASM_WRITTEN (NOTE_BLOCK (insn)) = 1;
2175 case NOTE_INSN_BLOCK_END:
2176 if (debug_info_level == DINFO_LEVEL_NORMAL
2177 || debug_info_level == DINFO_LEVEL_VERBOSE
2178 || write_symbols == DWARF_DEBUG
2179 || write_symbols == DWARF2_DEBUG)
2181 int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
2185 /* End of a symbol-block. */
2187 if (block_depth < 0)
2190 (*debug_hooks->end_block) (high_block_linenum, n);
2194 case NOTE_INSN_DELETED_LABEL:
2195 /* Emit the label. We may have deleted the CODE_LABEL because
2196 the label could be proved to be unreachable, though still
2197 referenced (in the form of having its address taken. */
2198 ASM_OUTPUT_DEBUG_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2205 if (NOTE_LINE_NUMBER (insn) <= 0)
2208 /* This note is a line-number. */
2213 /* If there is anything real after this note, output it.
2214 If another line note follows, omit this one. */
2215 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
2217 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
2220 /* These types of notes can be significant
2221 so make sure the preceding line number stays. */
2222 else if (GET_CODE (note) == NOTE
2223 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
2224 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
2225 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
2227 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
2229 /* Another line note follows; we can delete this note
2230 if no intervening line numbers have notes elsewhere. */
2232 for (num = NOTE_LINE_NUMBER (insn) + 1;
2233 num < NOTE_LINE_NUMBER (note);
2235 if (line_note_exists[num])
2238 if (num >= NOTE_LINE_NUMBER (note))
2244 /* Output this line note if it is the first or the last line
2248 notice_source_line (insn);
2249 (*debug_hooks->source_line) (last_linenum, last_filename);
2257 #if defined (DWARF2_UNWIND_INFO)
2258 if (dwarf2out_do_frame ())
2259 dwarf2out_frame_debug (insn);
2264 /* The target port might emit labels in the output function for
2265 some insn, e.g. sh.c output_branchy_insn. */
2266 if (CODE_LABEL_NUMBER (insn) <= max_labelno)
2268 int align = LABEL_TO_ALIGNMENT (insn);
2269 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2270 int max_skip = LABEL_TO_MAX_SKIP (insn);
2273 if (align && NEXT_INSN (insn))
2274 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2275 ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip);
2277 ASM_OUTPUT_ALIGN (file, align);
2282 /* If this label is reached from only one place, set the condition
2283 codes from the instruction just before the branch. */
2285 /* Disabled because some insns set cc_status in the C output code
2286 and NOTICE_UPDATE_CC alone can set incorrect status. */
2287 if (0 /* optimize && LABEL_NUSES (insn) == 1*/)
2289 rtx jump = LABEL_REFS (insn);
2290 rtx barrier = prev_nonnote_insn (insn);
2292 /* If the LABEL_REFS field of this label has been set to point
2293 at a branch, the predecessor of the branch is a regular
2294 insn, and that branch is the only way to reach this label,
2295 set the condition codes based on the branch and its
2297 if (barrier && GET_CODE (barrier) == BARRIER
2298 && jump && GET_CODE (jump) == JUMP_INSN
2299 && (prev = prev_nonnote_insn (jump))
2300 && GET_CODE (prev) == INSN)
2302 NOTICE_UPDATE_CC (PATTERN (prev), prev);
2303 NOTICE_UPDATE_CC (PATTERN (jump), jump);
2311 #ifdef FINAL_PRESCAN_LABEL
2312 FINAL_PRESCAN_INSN (insn, NULL, 0);
2315 if (LABEL_NAME (insn))
2316 (*debug_hooks->label) (insn);
2320 fputs (ASM_APP_OFF, file);
2323 if (NEXT_INSN (insn) != 0
2324 && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN)
2326 rtx nextbody = PATTERN (NEXT_INSN (insn));
2328 /* If this label is followed by a jump-table,
2329 make sure we put the label in the read-only section. Also
2330 possibly write the label and jump table together. */
2332 if (GET_CODE (nextbody) == ADDR_VEC
2333 || GET_CODE (nextbody) == ADDR_DIFF_VEC)
2335 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2336 /* In this case, the case vector is being moved by the
2337 target, so don't output the label at all. Leave that
2338 to the back end macros. */
2340 if (! JUMP_TABLES_IN_TEXT_SECTION)
2344 readonly_data_section ();
2346 #ifdef ADDR_VEC_ALIGN
2347 log_align = ADDR_VEC_ALIGN (NEXT_INSN (insn));
2349 log_align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
2351 ASM_OUTPUT_ALIGN (file, log_align);
2354 function_section (current_function_decl);
2356 #ifdef ASM_OUTPUT_CASE_LABEL
2357 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
2360 if (LABEL_ALTERNATE_NAME (insn))
2361 ASM_OUTPUT_ALTERNATE_LABEL_NAME (file, insn);
2363 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2369 if (LABEL_ALTERNATE_NAME (insn))
2370 ASM_OUTPUT_ALTERNATE_LABEL_NAME (file, insn);
2372 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2377 rtx body = PATTERN (insn);
2378 int insn_code_number;
2379 const char *template;
2382 /* An INSN, JUMP_INSN or CALL_INSN.
2383 First check for special kinds that recog doesn't recognize. */
2385 if (GET_CODE (body) == USE /* These are just declarations */
2386 || GET_CODE (body) == CLOBBER)
2390 /* If there is a REG_CC_SETTER note on this insn, it means that
2391 the setting of the condition code was done in the delay slot
2392 of the insn that branched here. So recover the cc status
2393 from the insn that set it. */
2395 note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX);
2398 NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0));
2399 cc_prev_status = cc_status;
2403 /* Detect insns that are really jump-tables
2404 and output them as such. */
2406 if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC)
2408 #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2417 fputs (ASM_APP_OFF, file);
2421 #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2422 if (GET_CODE (body) == ADDR_VEC)
2424 #ifdef ASM_OUTPUT_ADDR_VEC
2425 ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2432 #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2433 ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2439 vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
2440 for (idx = 0; idx < vlen; idx++)
2442 if (GET_CODE (body) == ADDR_VEC)
2444 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2445 ASM_OUTPUT_ADDR_VEC_ELT
2446 (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
2453 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2454 ASM_OUTPUT_ADDR_DIFF_ELT
2457 CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
2458 CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
2464 #ifdef ASM_OUTPUT_CASE_END
2465 ASM_OUTPUT_CASE_END (file,
2466 CODE_LABEL_NUMBER (PREV_INSN (insn)),
2471 function_section (current_function_decl);
2476 /* Do basic-block profiling when we reach a new block.
2477 Done here to avoid jump tables. */
2478 if (profile_block_flag && new_block)
2481 if (GET_CODE (body) == ASM_INPUT)
2483 const char *string = XSTR (body, 0);
2485 /* There's no telling what that did to the condition codes. */
2494 fputs (ASM_APP_ON, file);
2497 fprintf (asm_out_file, "\t%s\n", string);
2502 /* Detect `asm' construct with operands. */
2503 if (asm_noperands (body) >= 0)
2505 unsigned int noperands = asm_noperands (body);
2506 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
2509 /* There's no telling what that did to the condition codes. */
2514 /* Get out the operand values. */
2515 string = decode_asm_operands (body, ops, NULL, NULL, NULL);
2516 /* Inhibit aborts on what would otherwise be compiler bugs. */
2517 insn_noperands = noperands;
2518 this_is_asm_operands = insn;
2520 /* Output the insn using them. */
2525 fputs (ASM_APP_ON, file);
2528 output_asm_insn (string, ops);
2531 this_is_asm_operands = 0;
2535 if (prescan <= 0 && app_on)
2537 fputs (ASM_APP_OFF, file);
2541 if (GET_CODE (body) == SEQUENCE)
2543 /* A delayed-branch sequence */
2549 final_sequence = body;
2551 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2552 force the restoration of a comparison that was previously
2553 thought unnecessary. If that happens, cancel this sequence
2554 and cause that insn to be restored. */
2556 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
2557 if (next != XVECEXP (body, 0, 1))
2563 for (i = 1; i < XVECLEN (body, 0); i++)
2565 rtx insn = XVECEXP (body, 0, i);
2566 rtx next = NEXT_INSN (insn);
2567 /* We loop in case any instruction in a delay slot gets
2570 insn = final_scan_insn (insn, file, 0, prescan, 1);
2571 while (insn != next);
2573 #ifdef DBR_OUTPUT_SEQEND
2574 DBR_OUTPUT_SEQEND (file);
2578 /* If the insn requiring the delay slot was a CALL_INSN, the
2579 insns in the delay slot are actually executed before the
2580 called function. Hence we don't preserve any CC-setting
2581 actions in these insns and the CC must be marked as being
2582 clobbered by the function. */
2583 if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN)
2588 /* Following a conditional branch sequence, we have a new basic
2590 if (profile_block_flag)
2592 rtx insn = XVECEXP (body, 0, 0);
2593 rtx body = PATTERN (insn);
2595 if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2596 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2597 || (GET_CODE (insn) == JUMP_INSN
2598 && GET_CODE (body) == PARALLEL
2599 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2600 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))
2606 /* We have a real machine instruction as rtl. */
2608 body = PATTERN (insn);
2611 set = single_set (insn);
2613 /* Check for redundant test and compare instructions
2614 (when the condition codes are already set up as desired).
2615 This is done only when optimizing; if not optimizing,
2616 it should be possible for the user to alter a variable
2617 with the debugger in between statements
2618 and the next statement should reexamine the variable
2619 to compute the condition codes. */
2624 rtx set = single_set (insn);
2628 && GET_CODE (SET_DEST (set)) == CC0
2629 && insn != last_ignored_compare)
2631 if (GET_CODE (SET_SRC (set)) == SUBREG)
2632 SET_SRC (set) = alter_subreg (SET_SRC (set));
2633 else if (GET_CODE (SET_SRC (set)) == COMPARE)
2635 if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG)
2636 XEXP (SET_SRC (set), 0)
2637 = alter_subreg (XEXP (SET_SRC (set), 0));
2638 if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG)
2639 XEXP (SET_SRC (set), 1)
2640 = alter_subreg (XEXP (SET_SRC (set), 1));
2642 if ((cc_status.value1 != 0
2643 && rtx_equal_p (SET_SRC (set), cc_status.value1))
2644 || (cc_status.value2 != 0
2645 && rtx_equal_p (SET_SRC (set), cc_status.value2)))
2647 /* Don't delete insn if it has an addressing side-effect. */
2648 if (! FIND_REG_INC_NOTE (insn, 0)
2649 /* or if anything in it is volatile. */
2650 && ! volatile_refs_p (PATTERN (insn)))
2652 /* We don't really delete the insn; just ignore it. */
2653 last_ignored_compare = insn;
2661 /* Following a conditional branch, we have a new basic block.
2662 But if we are inside a sequence, the new block starts after the
2663 last insn of the sequence. */
2664 if (profile_block_flag && final_sequence == 0
2665 && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET
2666 && GET_CODE (SET_SRC (body)) != LABEL_REF)
2667 || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL
2668 && GET_CODE (XVECEXP (body, 0, 0)) == SET
2669 && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)))
2673 /* Don't bother outputting obvious no-ops, even without -O.
2674 This optimization is fast and doesn't interfere with debugging.
2675 Don't do this if the insn is in a delay slot, since this
2676 will cause an improper number of delay insns to be written. */
2677 if (final_sequence == 0
2679 && GET_CODE (insn) == INSN && GET_CODE (body) == SET
2680 && GET_CODE (SET_SRC (body)) == REG
2681 && GET_CODE (SET_DEST (body)) == REG
2682 && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body)))
2687 /* If this is a conditional branch, maybe modify it
2688 if the cc's are in a nonstandard state
2689 so that it accomplishes the same thing that it would
2690 do straightforwardly if the cc's were set up normally. */
2692 if (cc_status.flags != 0
2693 && GET_CODE (insn) == JUMP_INSN
2694 && GET_CODE (body) == SET
2695 && SET_DEST (body) == pc_rtx
2696 && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE
2697 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<'
2698 && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx
2699 /* This is done during prescan; it is not done again
2700 in final scan when prescan has been done. */
2703 /* This function may alter the contents of its argument
2704 and clear some of the cc_status.flags bits.
2705 It may also return 1 meaning condition now always true
2706 or -1 meaning condition now always false
2707 or 2 meaning condition nontrivial but altered. */
2708 int result = alter_cond (XEXP (SET_SRC (body), 0));
2709 /* If condition now has fixed value, replace the IF_THEN_ELSE
2710 with its then-operand or its else-operand. */
2712 SET_SRC (body) = XEXP (SET_SRC (body), 1);
2714 SET_SRC (body) = XEXP (SET_SRC (body), 2);
2716 /* The jump is now either unconditional or a no-op.
2717 If it has become a no-op, don't try to output it.
2718 (It would not be recognized.) */
2719 if (SET_SRC (body) == pc_rtx)
2724 else if (GET_CODE (SET_SRC (body)) == RETURN)
2725 /* Replace (set (pc) (return)) with (return). */
2726 PATTERN (insn) = body = SET_SRC (body);
2728 /* Rerecognize the instruction if it has changed. */
2730 INSN_CODE (insn) = -1;
2733 /* Make same adjustments to instructions that examine the
2734 condition codes without jumping and instructions that
2735 handle conditional moves (if this machine has either one). */
2737 if (cc_status.flags != 0
2740 rtx cond_rtx, then_rtx, else_rtx;
2742 if (GET_CODE (insn) != JUMP_INSN
2743 && GET_CODE (SET_SRC (set)) == IF_THEN_ELSE)
2745 cond_rtx = XEXP (SET_SRC (set), 0);
2746 then_rtx = XEXP (SET_SRC (set), 1);
2747 else_rtx = XEXP (SET_SRC (set), 2);
2751 cond_rtx = SET_SRC (set);
2752 then_rtx = const_true_rtx;
2753 else_rtx = const0_rtx;
2756 switch (GET_CODE (cond_rtx))
2770 if (XEXP (cond_rtx, 0) != cc0_rtx)
2772 result = alter_cond (cond_rtx);
2774 validate_change (insn, &SET_SRC (set), then_rtx, 0);
2775 else if (result == -1)
2776 validate_change (insn, &SET_SRC (set), else_rtx, 0);
2777 else if (result == 2)
2778 INSN_CODE (insn) = -1;
2779 if (SET_DEST (set) == SET_SRC (set))
2791 #ifdef HAVE_peephole
2792 /* Do machine-specific peephole optimizations if desired. */
2794 if (optimize && !flag_no_peephole && !nopeepholes)
2796 rtx next = peephole (insn);
2797 /* When peepholing, if there were notes within the peephole,
2798 emit them before the peephole. */
2799 if (next != 0 && next != NEXT_INSN (insn))
2801 rtx prev = PREV_INSN (insn);
2803 for (note = NEXT_INSN (insn); note != next;
2804 note = NEXT_INSN (note))
2805 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2807 /* In case this is prescan, put the notes
2808 in proper position for later rescan. */
2809 note = NEXT_INSN (insn);
2810 PREV_INSN (note) = prev;
2811 NEXT_INSN (prev) = note;
2812 NEXT_INSN (PREV_INSN (next)) = insn;
2813 PREV_INSN (insn) = PREV_INSN (next);
2814 NEXT_INSN (insn) = next;
2815 PREV_INSN (next) = insn;
2818 /* PEEPHOLE might have changed this. */
2819 body = PATTERN (insn);
2823 /* Try to recognize the instruction.
2824 If successful, verify that the operands satisfy the
2825 constraints for the instruction. Crash if they don't,
2826 since `reload' should have changed them so that they do. */
2828 insn_code_number = recog_memoized (insn);
2829 cleanup_subreg_operands (insn);
2831 /* Dump the insn in the assembly for debugging. */
2832 if (flag_dump_rtl_in_asm)
2834 print_rtx_head = ASM_COMMENT_START;
2835 print_rtl_single (asm_out_file, insn);
2836 print_rtx_head = "";
2839 if (! constrain_operands_cached (1))
2840 fatal_insn_not_found (insn);
2842 /* Some target machines need to prescan each insn before
2845 #ifdef FINAL_PRESCAN_INSN
2846 FINAL_PRESCAN_INSN (insn, recog_data.operand, recog_data.n_operands);
2849 #ifdef HAVE_conditional_execution
2850 if (GET_CODE (PATTERN (insn)) == COND_EXEC)
2851 current_insn_predicate = COND_EXEC_TEST (PATTERN (insn));
2853 current_insn_predicate = NULL_RTX;
2857 cc_prev_status = cc_status;
2859 /* Update `cc_status' for this instruction.
2860 The instruction's output routine may change it further.
2861 If the output routine for a jump insn needs to depend
2862 on the cc status, it should look at cc_prev_status. */
2864 NOTICE_UPDATE_CC (body, insn);
2867 current_output_insn = debug_insn = insn;
2869 #if defined (DWARF2_UNWIND_INFO)
2870 if (GET_CODE (insn) == CALL_INSN && dwarf2out_do_frame ())
2871 dwarf2out_frame_debug (insn);
2874 /* Find the proper template for this insn. */
2875 template = get_insn_template (insn_code_number, insn);
2877 /* If the C code returns 0, it means that it is a jump insn
2878 which follows a deleted test insn, and that test insn
2879 needs to be reinserted. */
2884 if (prev_nonnote_insn (insn) != last_ignored_compare)
2888 /* We have already processed the notes between the setter and
2889 the user. Make sure we don't process them again, this is
2890 particularly important if one of the notes is a block
2891 scope note or an EH note. */
2893 prev != last_ignored_compare;
2894 prev = PREV_INSN (prev))
2896 if (GET_CODE (prev) == NOTE)
2897 delete_insn (prev); /* Use delete_note. */
2903 /* If the template is the string "#", it means that this insn must
2905 if (template[0] == '#' && template[1] == '\0')
2907 rtx new = try_split (body, insn, 0);
2909 /* If we didn't split the insn, go away. */
2910 if (new == insn && PATTERN (new) == body)
2911 fatal_insn ("Could not split insn", insn);
2913 #ifdef HAVE_ATTR_length
2914 /* This instruction should have been split in shorten_branches,
2915 to ensure that we would have valid length info for the
2927 #ifdef IA64_UNWIND_INFO
2928 IA64_UNWIND_EMIT (asm_out_file, insn);
2930 /* Output assembler code from the template. */
2932 output_asm_insn (template, recog_data.operand);
2934 #if defined (DWARF2_UNWIND_INFO)
2935 #if defined (HAVE_prologue)
2936 if (GET_CODE (insn) == INSN && dwarf2out_do_frame ())
2937 dwarf2out_frame_debug (insn);
2939 if (!ACCUMULATE_OUTGOING_ARGS
2940 && GET_CODE (insn) == INSN
2941 && dwarf2out_do_frame ())
2942 dwarf2out_frame_debug (insn);
2947 /* It's not at all clear why we did this and doing so interferes
2948 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2951 /* Mark this insn as having been output. */
2952 INSN_DELETED_P (insn) = 1;
2955 /* Emit information for vtable gc. */
2956 note = find_reg_note (insn, REG_VTABLE_REF, NULL_RTX);
2958 assemble_vtable_entry (XEXP (XEXP (note, 0), 0),
2959 INTVAL (XEXP (XEXP (note, 0), 1)));
2961 current_output_insn = debug_insn = 0;
2964 return NEXT_INSN (insn);
2967 /* Output debugging info to the assembler file FILE
2968 based on the NOTE-insn INSN, assumed to be a line number. */
2971 notice_source_line (insn)
2974 const char *filename = NOTE_SOURCE_FILE (insn);
2976 /* Remember filename for basic block profiling.
2977 Filenames are allocated on the permanent obstack
2978 or are passed in ARGV, so we don't have to save
2981 if (profile_block_flag && last_filename != filename)
2982 bb_file_label_num = add_bb_string (filename, TRUE);
2984 last_filename = filename;
2985 last_linenum = NOTE_LINE_NUMBER (insn);
2986 high_block_linenum = MAX (last_linenum, high_block_linenum);
2987 high_function_linenum = MAX (last_linenum, high_function_linenum);
2990 /* For each operand in INSN, simplify (subreg (reg)) so that it refers
2991 directly to the desired hard register. */
2994 cleanup_subreg_operands (insn)
2998 extract_insn_cached (insn);
2999 for (i = 0; i < recog_data.n_operands; i++)
3001 if (GET_CODE (recog_data.operand[i]) == SUBREG)
3002 recog_data.operand[i] = alter_subreg (recog_data.operand[i]);
3003 else if (GET_CODE (recog_data.operand[i]) == PLUS
3004 || GET_CODE (recog_data.operand[i]) == MULT
3005 || GET_CODE (recog_data.operand[i]) == MEM)
3006 recog_data.operand[i] = walk_alter_subreg (recog_data.operand[i]);
3009 for (i = 0; i < recog_data.n_dups; i++)
3011 if (GET_CODE (*recog_data.dup_loc[i]) == SUBREG)
3012 *recog_data.dup_loc[i] = alter_subreg (*recog_data.dup_loc[i]);
3013 else if (GET_CODE (*recog_data.dup_loc[i]) == PLUS
3014 || GET_CODE (*recog_data.dup_loc[i]) == MULT
3015 || GET_CODE (*recog_data.dup_loc[i]) == MEM)
3016 *recog_data.dup_loc[i] = walk_alter_subreg (*recog_data.dup_loc[i]);
3020 /* If X is a SUBREG, replace it with a REG or a MEM,
3021 based on the thing it is a subreg of. */
3027 rtx y = SUBREG_REG (x);
3029 if (GET_CODE (y) == SUBREG)
3030 y = alter_subreg (y);
3032 /* If reload is operating, we may be replacing inside this SUBREG.
3033 Check for that and make a new one if so. */
3034 if (reload_in_progress && find_replacement (&SUBREG_REG (x)) != 0)
3037 if (GET_CODE (y) == REG)
3039 int regno = subreg_hard_regno (x, 1);
3043 ORIGINAL_REGNO (x) = ORIGINAL_REGNO (y);
3044 /* This field has a different meaning for REGs and SUBREGs. Make sure
3048 else if (GET_CODE (y) == MEM)
3050 HOST_WIDE_INT offset = SUBREG_BYTE (x);
3052 /* Catch these instead of generating incorrect code. */
3053 if ((offset % GET_MODE_SIZE (GET_MODE (x))) != 0)
3057 MEM_COPY_ATTRIBUTES (x, y);
3058 XEXP (x, 0) = plus_constant (XEXP (y, 0), offset);
3064 /* Do alter_subreg on all the SUBREGs contained in X. */
3067 walk_alter_subreg (x)
3070 switch (GET_CODE (x))
3074 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3075 XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1));
3079 XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0));
3083 return alter_subreg (x);
3094 /* Given BODY, the body of a jump instruction, alter the jump condition
3095 as required by the bits that are set in cc_status.flags.
3096 Not all of the bits there can be handled at this level in all cases.
3098 The value is normally 0.
3099 1 means that the condition has become always true.
3100 -1 means that the condition has become always false.
3101 2 means that COND has been altered. */
3109 if (cc_status.flags & CC_REVERSED)
3112 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
3115 if (cc_status.flags & CC_INVERTED)
3118 PUT_CODE (cond, reverse_condition (GET_CODE (cond)));
3121 if (cc_status.flags & CC_NOT_POSITIVE)
3122 switch (GET_CODE (cond))
3127 /* Jump becomes unconditional. */
3133 /* Jump becomes no-op. */
3137 PUT_CODE (cond, EQ);
3142 PUT_CODE (cond, NE);
3150 if (cc_status.flags & CC_NOT_NEGATIVE)
3151 switch (GET_CODE (cond))
3155 /* Jump becomes unconditional. */
3160 /* Jump becomes no-op. */
3165 PUT_CODE (cond, EQ);
3171 PUT_CODE (cond, NE);
3179 if (cc_status.flags & CC_NO_OVERFLOW)
3180 switch (GET_CODE (cond))
3183 /* Jump becomes unconditional. */
3187 PUT_CODE (cond, EQ);
3192 PUT_CODE (cond, NE);
3197 /* Jump becomes no-op. */
3204 if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N))
3205 switch (GET_CODE (cond))
3211 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT);
3216 PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE);
3221 if (cc_status.flags & CC_NOT_SIGNED)
3222 /* The flags are valid if signed condition operators are converted
3224 switch (GET_CODE (cond))
3227 PUT_CODE (cond, LEU);
3232 PUT_CODE (cond, LTU);
3237 PUT_CODE (cond, GTU);
3242 PUT_CODE (cond, GEU);
3254 /* Report inconsistency between the assembler template and the operands.
3255 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3258 output_operand_lossage (msgid)
3261 if (this_is_asm_operands)
3262 error_for_asm (this_is_asm_operands, "invalid `asm': %s", _(msgid));
3264 internal_error ("output_operand: %s", _(msgid));
3267 /* Output of assembler code from a template, and its subroutines. */
3269 /* Annotate the assembly with a comment describing the pattern and
3270 alternative used. */
3277 int num = INSN_CODE (debug_insn);
3278 fprintf (asm_out_file, "\t%s %d\t%s",
3279 ASM_COMMENT_START, INSN_UID (debug_insn),
3280 insn_data[num].name);
3281 if (insn_data[num].n_alternatives > 1)
3282 fprintf (asm_out_file, "/%d", which_alternative + 1);
3283 #ifdef HAVE_ATTR_length
3284 fprintf (asm_out_file, "\t[length = %d]",
3285 get_attr_length (debug_insn));
3287 /* Clear this so only the first assembler insn
3288 of any rtl insn will get the special comment for -dp. */
3293 /* If OP is a REG or MEM and we can find a decl corresponding to it or
3294 its address, return that decl. Set *PADDRESSP to 1 if the decl
3295 corresponds to the address of the object and 0 if to the object. */
3298 get_decl_from_op (op, paddressp)
3307 if (GET_CODE (op) == REG)
3308 return REGNO_DECL (ORIGINAL_REGNO (op));
3309 else if (GET_CODE (op) != MEM)
3312 if (MEM_DECL (op) != 0)
3313 return MEM_DECL (op);
3315 /* Otherwise we have an address, so indicate it and look at the address. */
3319 /* First check if we have a decl for the address, then look at the right side
3320 if it is a PLUS. Otherwise, strip off arithmetic and keep looking.
3321 But don't allow the address to itself be indirect. */
3322 if ((decl = get_decl_from_op (op, &inner_addressp)) && ! inner_addressp)
3324 else if (GET_CODE (op) == PLUS
3325 && (decl = get_decl_from_op (XEXP (op, 1), &inner_addressp)))
3328 while (GET_RTX_CLASS (GET_CODE (op)) == '1'
3329 || GET_RTX_CLASS (GET_CODE (op)) == '2')
3332 decl = get_decl_from_op (op, &inner_addressp);
3333 return inner_addressp ? 0 : decl;
3336 /* Output operand names for assembler instructions. OPERANDS is the
3337 operand vector, OPORDER is the order to write the operands, and NOPS
3338 is the number of operands to write. */
3341 output_asm_operand_names (operands, oporder, nops)
3349 for (i = 0; i < nops; i++)
3352 tree decl = get_decl_from_op (operands[oporder[i]], &addressp);
3354 if (decl && DECL_NAME (decl))
3356 fprintf (asm_out_file, "%s %s%s",
3357 wrote ? "," : ASM_COMMENT_START, addressp ? "*" : "",
3358 IDENTIFIER_POINTER (DECL_NAME (decl)));
3364 /* Output text from TEMPLATE to the assembler output file,
3365 obeying %-directions to substitute operands taken from
3366 the vector OPERANDS.
3368 %N (for N a digit) means print operand N in usual manner.
3369 %lN means require operand N to be a CODE_LABEL or LABEL_REF
3370 and print the label name with no punctuation.
3371 %cN means require operand N to be a constant
3372 and print the constant expression with no punctuation.
3373 %aN means expect operand N to be a memory address
3374 (not a memory reference!) and print a reference
3376 %nN means expect operand N to be a constant
3377 and print a constant expression for minus the value
3378 of the operand, with no other punctuation. */
3381 output_asm_insn (template, operands)
3382 const char *template;
3387 #ifdef ASSEMBLER_DIALECT
3390 int oporder[MAX_RECOG_OPERANDS];
3391 char opoutput[MAX_RECOG_OPERANDS];
3394 /* An insn may return a null string template
3395 in a case where no assembler code is needed. */
3399 memset (opoutput, 0, sizeof opoutput);
3401 putc ('\t', asm_out_file);
3403 #ifdef ASM_OUTPUT_OPCODE
3404 ASM_OUTPUT_OPCODE (asm_out_file, p);
3411 if (flag_verbose_asm)
3412 output_asm_operand_names (operands, oporder, ops);
3413 if (flag_print_asm_name)
3417 memset (opoutput, 0, sizeof opoutput);
3419 putc (c, asm_out_file);
3420 #ifdef ASM_OUTPUT_OPCODE
3421 while ((c = *p) == '\t')
3423 putc (c, asm_out_file);
3426 ASM_OUTPUT_OPCODE (asm_out_file, p);
3430 #ifdef ASSEMBLER_DIALECT
3436 output_operand_lossage ("nested assembly dialect alternatives");
3440 /* If we want the first dialect, do nothing. Otherwise, skip
3441 DIALECT_NUMBER of strings ending with '|'. */
3442 for (i = 0; i < dialect_number; i++)
3444 while (*p && *p != '}' && *p++ != '|')
3453 output_operand_lossage ("unterminated assembly dialect alternative");
3460 /* Skip to close brace. */
3465 output_operand_lossage ("unterminated assembly dialect alternative");
3469 while (*p++ != '}');
3473 putc (c, asm_out_file);
3478 putc (c, asm_out_file);
3484 /* %% outputs a single %. */
3488 putc (c, asm_out_file);
3490 /* %= outputs a number which is unique to each insn in the entire
3491 compilation. This is useful for making local labels that are
3492 referred to more than once in a given insn. */
3496 fprintf (asm_out_file, "%d", insn_counter);
3498 /* % followed by a letter and some digits
3499 outputs an operand in a special way depending on the letter.
3500 Letters `acln' are implemented directly.
3501 Other letters are passed to `output_operand' so that
3502 the PRINT_OPERAND macro can define them. */
3503 else if (ISALPHA (*p))
3509 output_operand_lossage ("operand number missing after %-letter");
3510 else if (this_is_asm_operands
3511 && (c < 0 || (unsigned int) c >= insn_noperands))
3512 output_operand_lossage ("operand number out of range");
3513 else if (letter == 'l')
3514 output_asm_label (operands[c]);
3515 else if (letter == 'a')
3516 output_address (operands[c]);
3517 else if (letter == 'c')
3519 if (CONSTANT_ADDRESS_P (operands[c]))
3520 output_addr_const (asm_out_file, operands[c]);
3522 output_operand (operands[c], 'c');
3524 else if (letter == 'n')
3526 if (GET_CODE (operands[c]) == CONST_INT)
3527 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
3528 - INTVAL (operands[c]));
3531 putc ('-', asm_out_file);
3532 output_addr_const (asm_out_file, operands[c]);
3536 output_operand (operands[c], letter);
3542 while (ISDIGIT (c = *p))
3545 /* % followed by a digit outputs an operand the default way. */
3546 else if (ISDIGIT (*p))
3549 if (this_is_asm_operands
3550 && (c < 0 || (unsigned int) c >= insn_noperands))
3551 output_operand_lossage ("operand number out of range");
3553 output_operand (operands[c], 0);
3559 while (ISDIGIT (c = *p))
3562 /* % followed by punctuation: output something for that
3563 punctuation character alone, with no operand.
3564 The PRINT_OPERAND macro decides what is actually done. */
3565 #ifdef PRINT_OPERAND_PUNCT_VALID_P
3566 else if (PRINT_OPERAND_PUNCT_VALID_P ((unsigned char) *p))
3567 output_operand (NULL_RTX, *p++);
3570 output_operand_lossage ("invalid %%-code");
3574 putc (c, asm_out_file);
3577 /* Write out the variable names for operands, if we know them. */
3578 if (flag_verbose_asm)
3579 output_asm_operand_names (operands, oporder, ops);
3580 if (flag_print_asm_name)
3583 putc ('\n', asm_out_file);
3586 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3589 output_asm_label (x)
3594 if (GET_CODE (x) == LABEL_REF)
3596 if (GET_CODE (x) == CODE_LABEL
3597 || (GET_CODE (x) == NOTE
3598 && NOTE_LINE_NUMBER (x) == NOTE_INSN_DELETED_LABEL))
3599 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3601 output_operand_lossage ("`%l' operand isn't a label");
3603 assemble_name (asm_out_file, buf);
3606 /* Print operand X using machine-dependent assembler syntax.
3607 The macro PRINT_OPERAND is defined just to control this function.
3608 CODE is a non-digit that preceded the operand-number in the % spec,
3609 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3610 between the % and the digits.
3611 When CODE is a non-letter, X is 0.
3613 The meanings of the letters are machine-dependent and controlled
3614 by PRINT_OPERAND. */
3617 output_operand (x, code)
3619 int code ATTRIBUTE_UNUSED;
3621 if (x && GET_CODE (x) == SUBREG)
3622 x = alter_subreg (x);
3624 /* If X is a pseudo-register, abort now rather than writing trash to the
3627 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
3630 PRINT_OPERAND (asm_out_file, x, code);
3633 /* Print a memory reference operand for address X
3634 using machine-dependent assembler syntax.
3635 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3641 walk_alter_subreg (x);
3642 PRINT_OPERAND_ADDRESS (asm_out_file, x);
3645 /* Print an integer constant expression in assembler syntax.
3646 Addition and subtraction are the only arithmetic
3647 that may appear in these expressions. */
3650 output_addr_const (file, x)
3657 switch (GET_CODE (x))
3667 #ifdef ASM_OUTPUT_SYMBOL_REF
3668 ASM_OUTPUT_SYMBOL_REF (file, x);
3670 assemble_name (file, XSTR (x, 0));
3678 ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3679 assemble_name (file, buf);
3683 fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
3687 /* This used to output parentheses around the expression,
3688 but that does not work on the 386 (either ATT or BSD assembler). */
3689 output_addr_const (file, XEXP (x, 0));
3693 if (GET_MODE (x) == VOIDmode)
3695 /* We can use %d if the number is one word and positive. */
3696 if (CONST_DOUBLE_HIGH (x))
3697 fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3698 CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x));
3699 else if (CONST_DOUBLE_LOW (x) < 0)
3700 fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x));
3702 fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
3705 /* We can't handle floating point constants;
3706 PRINT_OPERAND must handle them. */
3707 output_operand_lossage ("floating constant misused");
3711 /* Some assemblers need integer constants to appear last (eg masm). */
3712 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
3714 output_addr_const (file, XEXP (x, 1));
3715 if (INTVAL (XEXP (x, 0)) >= 0)
3716 fprintf (file, "+");
3717 output_addr_const (file, XEXP (x, 0));
3721 output_addr_const (file, XEXP (x, 0));
3722 if (GET_CODE (XEXP (x, 1)) != CONST_INT
3723 || INTVAL (XEXP (x, 1)) >= 0)
3724 fprintf (file, "+");
3725 output_addr_const (file, XEXP (x, 1));
3730 /* Avoid outputting things like x-x or x+5-x,
3731 since some assemblers can't handle that. */
3732 x = simplify_subtraction (x);
3733 if (GET_CODE (x) != MINUS)
3736 output_addr_const (file, XEXP (x, 0));
3737 fprintf (file, "-");
3738 if ((GET_CODE (XEXP (x, 1)) == CONST_INT
3739 && INTVAL (XEXP (x, 1)) < 0)
3740 || GET_CODE (XEXP (x, 1)) != CONST_INT)
3742 fputs (targetm.asm_out.open_paren, file);
3743 output_addr_const (file, XEXP (x, 1));
3744 fputs (targetm.asm_out.close_paren, file);
3747 output_addr_const (file, XEXP (x, 1));
3752 output_addr_const (file, XEXP (x, 0));
3756 #ifdef OUTPUT_ADDR_CONST_EXTRA
3757 OUTPUT_ADDR_CONST_EXTRA (file, x, fail);
3762 output_operand_lossage ("invalid expression as operand");
3766 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3767 %R prints the value of REGISTER_PREFIX.
3768 %L prints the value of LOCAL_LABEL_PREFIX.
3769 %U prints the value of USER_LABEL_PREFIX.
3770 %I prints the value of IMMEDIATE_PREFIX.
3771 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3772 Also supported are %d, %x, %s, %e, %f, %g and %%.
3774 We handle alternate assembler dialects here, just like output_asm_insn. */
3777 asm_fprintf VPARAMS ((FILE *file, const char *p, ...))
3782 VA_OPEN (argptr, p);
3783 VA_FIXEDARG (argptr, FILE *, file);
3784 VA_FIXEDARG (argptr, const char *, p);
3791 #ifdef ASSEMBLER_DIALECT
3796 /* If we want the first dialect, do nothing. Otherwise, skip
3797 DIALECT_NUMBER of strings ending with '|'. */
3798 for (i = 0; i < dialect_number; i++)
3800 while (*p && *p++ != '|')
3810 /* Skip to close brace. */
3811 while (*p && *p++ != '}')
3822 while (ISDIGIT (c) || c == '.')
3830 fprintf (file, "%%");
3833 case 'd': case 'i': case 'u':
3834 case 'x': case 'p': case 'X':
3838 fprintf (file, buf, va_arg (argptr, int));
3842 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3843 but we do not check for those cases. It means that the value
3844 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3846 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3848 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3858 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3865 fprintf (file, buf, va_arg (argptr, long));
3873 fprintf (file, buf, va_arg (argptr, double));
3879 fprintf (file, buf, va_arg (argptr, char *));
3883 #ifdef ASM_OUTPUT_OPCODE
3884 ASM_OUTPUT_OPCODE (asm_out_file, p);
3889 #ifdef REGISTER_PREFIX
3890 fprintf (file, "%s", REGISTER_PREFIX);
3895 #ifdef IMMEDIATE_PREFIX
3896 fprintf (file, "%s", IMMEDIATE_PREFIX);
3901 #ifdef LOCAL_LABEL_PREFIX
3902 fprintf (file, "%s", LOCAL_LABEL_PREFIX);
3907 fputs (user_label_prefix, file);
3910 #ifdef ASM_FPRINTF_EXTENSIONS
3911 /* Upper case letters are reserved for general use by asm_fprintf
3912 and so are not available to target specific code. In order to
3913 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
3914 they are defined here. As they get turned into real extensions
3915 to asm_fprintf they should be removed from this list. */
3916 case 'A': case 'B': case 'C': case 'D': case 'E':
3917 case 'F': case 'G': case 'H': case 'J': case 'K':
3918 case 'M': case 'N': case 'P': case 'Q': case 'S':
3919 case 'T': case 'V': case 'W': case 'Y': case 'Z':
3922 ASM_FPRINTF_EXTENSIONS (file, argptr, p)
3935 /* Split up a CONST_DOUBLE or integer constant rtx
3936 into two rtx's for single words,
3937 storing in *FIRST the word that comes first in memory in the target
3938 and in *SECOND the other. */
3941 split_double (value, first, second)
3943 rtx *first, *second;
3945 if (GET_CODE (value) == CONST_INT)
3947 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3949 /* In this case the CONST_INT holds both target words.
3950 Extract the bits from it into two word-sized pieces.
3951 Sign extend each half to HOST_WIDE_INT. */
3952 unsigned HOST_WIDE_INT low, high;
3953 unsigned HOST_WIDE_INT mask, sign_bit, sign_extend;
3955 /* Set sign_bit to the most significant bit of a word. */
3957 sign_bit <<= BITS_PER_WORD - 1;
3959 /* Set mask so that all bits of the word are set. We could
3960 have used 1 << BITS_PER_WORD instead of basing the
3961 calculation on sign_bit. However, on machines where
3962 HOST_BITS_PER_WIDE_INT == BITS_PER_WORD, it could cause a
3963 compiler warning, even though the code would never be
3965 mask = sign_bit << 1;
3968 /* Set sign_extend as any remaining bits. */
3969 sign_extend = ~mask;
3971 /* Pick the lower word and sign-extend it. */
3972 low = INTVAL (value);
3977 /* Pick the higher word, shifted to the least significant
3978 bits, and sign-extend it. */
3979 high = INTVAL (value);
3980 high >>= BITS_PER_WORD - 1;
3983 if (high & sign_bit)
3984 high |= sign_extend;
3986 /* Store the words in the target machine order. */
3987 if (WORDS_BIG_ENDIAN)
3989 *first = GEN_INT (high);
3990 *second = GEN_INT (low);
3994 *first = GEN_INT (low);
3995 *second = GEN_INT (high);
4000 /* The rule for using CONST_INT for a wider mode
4001 is that we regard the value as signed.
4002 So sign-extend it. */
4003 rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx);
4004 if (WORDS_BIG_ENDIAN)
4016 else if (GET_CODE (value) != CONST_DOUBLE)
4018 if (WORDS_BIG_ENDIAN)
4020 *first = const0_rtx;
4026 *second = const0_rtx;
4029 else if (GET_MODE (value) == VOIDmode
4030 /* This is the old way we did CONST_DOUBLE integers. */
4031 || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT)
4033 /* In an integer, the words are defined as most and least significant.
4034 So order them by the target's convention. */
4035 if (WORDS_BIG_ENDIAN)
4037 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
4038 *second = GEN_INT (CONST_DOUBLE_LOW (value));
4042 *first = GEN_INT (CONST_DOUBLE_LOW (value));
4043 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
4048 #ifdef REAL_ARITHMETIC
4051 REAL_VALUE_FROM_CONST_DOUBLE (r, value);
4053 /* Note, this converts the REAL_VALUE_TYPE to the target's
4054 format, splits up the floating point double and outputs
4055 exactly 32 bits of it into each of l[0] and l[1] --
4056 not necessarily BITS_PER_WORD bits. */
4057 REAL_VALUE_TO_TARGET_DOUBLE (r, l);
4059 /* If 32 bits is an entire word for the target, but not for the host,
4060 then sign-extend on the host so that the number will look the same
4061 way on the host that it would on the target. See for instance
4062 simplify_unary_operation. The #if is needed to avoid compiler
4065 #if HOST_BITS_PER_LONG > 32
4066 if (BITS_PER_WORD < HOST_BITS_PER_LONG && BITS_PER_WORD == 32)
4068 if (l[0] & ((long) 1 << 31))
4069 l[0] |= ((long) (-1) << 32);
4070 if (l[1] & ((long) 1 << 31))
4071 l[1] |= ((long) (-1) << 32);
4075 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
4076 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
4078 if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
4079 || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD)
4080 && ! flag_pretend_float)
4084 #ifdef HOST_WORDS_BIG_ENDIAN
4091 /* Host and target agree => no need to swap. */
4092 *first = GEN_INT (CONST_DOUBLE_LOW (value));
4093 *second = GEN_INT (CONST_DOUBLE_HIGH (value));
4097 *second = GEN_INT (CONST_DOUBLE_LOW (value));
4098 *first = GEN_INT (CONST_DOUBLE_HIGH (value));
4100 #endif /* no REAL_ARITHMETIC */
4104 /* Return nonzero if this function has no function calls. */
4112 if (profile_flag || profile_block_flag || profile_arc_flag)
4115 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4117 if (GET_CODE (insn) == CALL_INSN
4118 && ! SIBLING_CALL_P (insn))
4120 if (GET_CODE (insn) == INSN
4121 && GET_CODE (PATTERN (insn)) == SEQUENCE
4122 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN
4123 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn), 0, 0)))
4126 for (link = current_function_epilogue_delay_list;
4128 link = XEXP (link, 1))
4130 insn = XEXP (link, 0);
4132 if (GET_CODE (insn) == CALL_INSN
4133 && ! SIBLING_CALL_P (insn))
4135 if (GET_CODE (insn) == INSN
4136 && GET_CODE (PATTERN (insn)) == SEQUENCE
4137 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN
4138 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn), 0, 0)))
4145 /* Return 1 if branch is an forward branch.
4146 Uses insn_shuid array, so it works only in the final pass. May be used by
4147 output templates to customary add branch prediction hints.
4150 final_forward_branch_p (insn)
4153 int insn_id, label_id;
4156 insn_id = INSN_SHUID (insn);
4157 label_id = INSN_SHUID (JUMP_LABEL (insn));
4158 /* We've hit some insns that does not have id information available. */
4159 if (!insn_id || !label_id)
4161 return insn_id < label_id;
4164 /* On some machines, a function with no call insns
4165 can run faster if it doesn't create its own register window.
4166 When output, the leaf function should use only the "output"
4167 registers. Ordinarily, the function would be compiled to use
4168 the "input" registers to find its arguments; it is a candidate
4169 for leaf treatment if it uses only the "input" registers.
4170 Leaf function treatment means renumbering so the function
4171 uses the "output" registers instead. */
4173 #ifdef LEAF_REGISTERS
4175 /* Return 1 if this function uses only the registers that can be
4176 safely renumbered. */
4179 only_leaf_regs_used ()
4182 char *permitted_reg_in_leaf_functions = LEAF_REGISTERS;
4184 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4185 if ((regs_ever_live[i] || global_regs[i])
4186 && ! permitted_reg_in_leaf_functions[i])
4189 if (current_function_uses_pic_offset_table
4190 && pic_offset_table_rtx != 0
4191 && GET_CODE (pic_offset_table_rtx) == REG
4192 && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4198 /* Scan all instructions and renumber all registers into those
4199 available in leaf functions. */
4202 leaf_renumber_regs (first)
4207 /* Renumber only the actual patterns.
4208 The reg-notes can contain frame pointer refs,
4209 and renumbering them could crash, and should not be needed. */
4210 for (insn = first; insn; insn = NEXT_INSN (insn))
4212 leaf_renumber_regs_insn (PATTERN (insn));
4213 for (insn = current_function_epilogue_delay_list;
4215 insn = XEXP (insn, 1))
4216 if (INSN_P (XEXP (insn, 0)))
4217 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
4220 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4221 available in leaf functions. */
4224 leaf_renumber_regs_insn (in_rtx)
4228 const char *format_ptr;
4233 /* Renumber all input-registers into output-registers.
4234 renumbered_regs would be 1 for an output-register;
4237 if (GET_CODE (in_rtx) == REG)
4241 /* Don't renumber the same reg twice. */
4245 newreg = REGNO (in_rtx);
4246 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4247 to reach here as part of a REG_NOTE. */
4248 if (newreg >= FIRST_PSEUDO_REGISTER)
4253 newreg = LEAF_REG_REMAP (newreg);
4256 regs_ever_live[REGNO (in_rtx)] = 0;
4257 regs_ever_live[newreg] = 1;
4258 REGNO (in_rtx) = newreg;
4262 if (INSN_P (in_rtx))
4264 /* Inside a SEQUENCE, we find insns.
4265 Renumber just the patterns of these insns,
4266 just as we do for the top-level insns. */
4267 leaf_renumber_regs_insn (PATTERN (in_rtx));
4271 format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
4273 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
4274 switch (*format_ptr++)
4277 leaf_renumber_regs_insn (XEXP (in_rtx, i));
4281 if (NULL != XVEC (in_rtx, i))
4283 for (j = 0; j < XVECLEN (in_rtx, i); j++)
4284 leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));