1 /* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92-6, 1997 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This is the final pass of the compiler.
23 It looks at the rtl code for a function and outputs assembler code.
25 Call `final_start_function' to output the assembler code for function entry,
26 `final' to output assembler code for some RTL code,
27 `final_end_function' to output assembler code for function exit.
28 If a function is compiled in several pieces, each piece is
29 output separately with `final'.
31 Some optimizations are also done at this level.
32 Move instructions that were made unnecessary by good register allocation
33 are detected and omitted from the output. (Though most of these
34 are removed by the last jump pass.)
36 Instructions to set the condition codes are omitted when it can be
37 seen that the condition codes already had the desired values.
39 In some cases it is sufficient if the inherited condition codes
40 have related values, but this may require the following insn
41 (the one that tests the condition codes) to be modified.
43 The code for the function prologue and epilogue are generated
44 directly as assembler code by the macros FUNCTION_PROLOGUE and
45 FUNCTION_EPILOGUE. Those instructions never exist as rtl. */
59 #include "insn-config.h"
60 #include "insn-flags.h"
61 #include "insn-attr.h"
62 #include "insn-codes.h"
64 #include "conditions.h"
67 #include "hard-reg-set.h"
72 /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */
73 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
74 #if defined (USG) || defined (NO_STAB_H)
75 #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */
77 #include <stab.h> /* On BSD, use the system's stab.h. */
79 #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */
81 #ifdef XCOFF_DEBUGGING_INFO
85 /* .stabd code for line number. */
90 /* .stabs code for included file name. */
96 #define INT_TYPE_SIZE BITS_PER_WORD
99 #ifndef LONG_TYPE_SIZE
100 #define LONG_TYPE_SIZE BITS_PER_WORD
103 /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
104 null default for it to save conditionalization later. */
105 #ifndef CC_STATUS_INIT
106 #define CC_STATUS_INIT
109 /* How to start an assembler comment. */
110 #ifndef ASM_COMMENT_START
111 #define ASM_COMMENT_START ";#"
114 /* Is the given character a logical line separator for the assembler? */
115 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
116 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';')
119 /* Nonzero means this function is a leaf function, with no function calls.
120 This variable exists to be examined in FUNCTION_PROLOGUE
121 and FUNCTION_EPILOGUE. Always zero, unless set by some action. */
124 /* Last insn processed by final_scan_insn. */
125 static rtx debug_insn
= 0;
127 /* Line number of last NOTE. */
128 static int last_linenum
;
130 /* Highest line number in current block. */
131 static int high_block_linenum
;
133 /* Likewise for function. */
134 static int high_function_linenum
;
136 /* Filename of last NOTE. */
137 static char *last_filename
;
139 /* Number of basic blocks seen so far;
140 used if profile_block_flag is set. */
141 static int count_basic_blocks
;
143 /* Number of instrumented arcs when profile_arc_flag is set. */
144 extern int count_instrumented_arcs
;
146 /* Nonzero while outputting an `asm' with operands.
147 This means that inconsistencies are the user's fault, so don't abort.
148 The precise value is the insn being output, to pass to error_for_asm. */
149 static rtx this_is_asm_operands
;
151 /* Number of operands of this insn, for an `asm' with operands. */
152 static int insn_noperands
;
154 /* Compare optimization flag. */
156 static rtx last_ignored_compare
= 0;
158 /* Flag indicating this insn is the start of a new basic block. */
160 static int new_block
= 1;
162 /* All the symbol-blocks (levels of scoping) in the compilation
163 are assigned sequence numbers in order of appearance of the
164 beginnings of the symbol-blocks. Both final and dbxout do this,
165 and assume that they will both give the same number to each block.
166 Final uses these sequence numbers to generate assembler label names
167 LBBnnn and LBEnnn for the beginning and end of the symbol-block.
168 Dbxout uses the sequence numbers to generate references to the same labels
169 from the dbx debugging information.
171 Sdb records this level at the beginning of each function,
172 in order to find the current level when recursing down declarations.
173 It outputs the block beginning and endings
174 at the point in the asm file where the blocks would begin and end. */
176 int next_block_index
;
178 /* Assign a unique number to each insn that is output.
179 This can be used to generate unique local labels. */
181 static int insn_counter
= 0;
184 /* This variable contains machine-dependent flags (defined in tm.h)
185 set and examined by output routines
186 that describe how to interpret the condition codes properly. */
190 /* During output of an insn, this contains a copy of cc_status
191 from before the insn. */
193 CC_STATUS cc_prev_status
;
196 /* Indexed by hardware reg number, is 1 if that register is ever
197 used in the current function.
199 In life_analysis, or in stupid_life_analysis, this is set
200 up to record the hard regs used explicitly. Reload adds
201 in the hard regs used for holding pseudo regs. Final uses
202 it to generate the code in the function prologue and epilogue
203 to save and restore registers as needed. */
205 char regs_ever_live
[FIRST_PSEUDO_REGISTER
];
207 /* Nonzero means current function must be given a frame pointer.
208 Set in stmt.c if anything is allocated on the stack there.
209 Set in reload1.c if anything is allocated on the stack there. */
211 int frame_pointer_needed
;
213 /* Assign unique numbers to labels generated for profiling. */
215 int profile_label_no
;
217 /* Length so far allocated in PENDING_BLOCKS. */
219 static int max_block_depth
;
221 /* Stack of sequence numbers of symbol-blocks of which we have seen the
222 beginning but not yet the end. Sequence numbers are assigned at
223 the beginning; this stack allows us to find the sequence number
224 of a block that is ending. */
226 static int *pending_blocks
;
228 /* Number of elements currently in use in PENDING_BLOCKS. */
230 static int block_depth
;
232 /* Nonzero if have enabled APP processing of our assembler output. */
236 /* If we are outputting an insn sequence, this contains the sequence rtx.
241 #ifdef ASSEMBLER_DIALECT
243 /* Number of the assembler dialect to use, starting at 0. */
244 static int dialect_number
;
247 /* Indexed by line number, nonzero if there is a note for that line. */
249 static char *line_note_exists
;
251 /* Linked list to hold line numbers for each basic block. */
254 struct bb_list
*next
; /* pointer to next basic block */
255 int line_num
; /* line number */
256 int file_label_num
; /* LPBC<n> label # for stored filename */
257 int func_label_num
; /* LPBC<n> label # for stored function name */
260 static struct bb_list
*bb_head
= 0; /* Head of basic block list */
261 static struct bb_list
**bb_tail
= &bb_head
; /* Ptr to store next bb ptr */
262 static int bb_file_label_num
= -1; /* Current label # for file */
263 static int bb_func_label_num
= -1; /* Current label # for func */
265 /* Linked list to hold the strings for each file and function name output. */
268 struct bb_str
*next
; /* pointer to next string */
269 char *string
; /* string */
270 int label_num
; /* label number */
271 int length
; /* string length */
274 extern rtx peephole
PROTO((rtx
));
276 static struct bb_str
*sbb_head
= 0; /* Head of string list. */
277 static struct bb_str
**sbb_tail
= &sbb_head
; /* Ptr to store next bb str */
278 static int sbb_label_num
= 0; /* Last label used */
280 static int asm_insn_count
PROTO((rtx
));
281 static void profile_function
PROTO((FILE *));
282 static void profile_after_prologue
PROTO((FILE *));
283 static void add_bb
PROTO((FILE *));
284 static int add_bb_string
PROTO((char *, int));
285 static void output_source_line
PROTO((FILE *, rtx
));
286 static rtx walk_alter_subreg
PROTO((rtx
));
287 static void output_asm_name
PROTO((void));
288 static void output_operand
PROTO((rtx
, int));
289 #ifdef LEAF_REGISTERS
290 static void leaf_renumber_regs
PROTO((rtx
));
293 static int alter_cond
PROTO((rtx
));
296 extern char *getpwd ();
298 /* Initialize data in final at the beginning of a compilation. */
301 init_final (filename
)
304 next_block_index
= 2;
306 max_block_depth
= 20;
307 pending_blocks
= (int *) xmalloc (20 * sizeof *pending_blocks
);
310 #ifdef ASSEMBLER_DIALECT
311 dialect_number
= ASSEMBLER_DIALECT
;
315 /* Called at end of source file,
316 to output the block-profiling table for this entire compilation. */
324 if (profile_block_flag
|| profile_arc_flag
)
327 int align
= exact_log2 (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
);
331 int long_bytes
= LONG_TYPE_SIZE
/ BITS_PER_UNIT
;
332 int pointer_bytes
= POINTER_SIZE
/ BITS_PER_UNIT
;
334 if (profile_block_flag
)
335 size
= long_bytes
* count_basic_blocks
;
337 size
= long_bytes
* count_instrumented_arcs
;
340 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
341 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
342 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
346 /* Output the main header, of 11 words:
347 0: 1 if this file is initialized, else 0.
348 1: address of file name (LPBX1).
349 2: address of table of counts (LPBX2).
350 3: number of counts in the table.
351 4: always 0, for compatibility with Sun.
353 The following are GNU extensions:
355 5: address of table of start addrs of basic blocks (LPBX3).
356 6: Number of bytes in this header.
357 7: address of table of function names (LPBX4).
358 8: address of table of line numbers (LPBX5) or 0.
359 9: address of table of file names (LPBX6) or 0.
360 10: space reserved for basic block profiling. */
362 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
364 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 0);
366 assemble_integer (const0_rtx
, long_bytes
, 1);
368 /* address of filename */
369 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 1);
370 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), pointer_bytes
, 1);
372 /* address of count table */
373 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 2);
374 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), pointer_bytes
, 1);
376 /* count of the # of basic blocks or # of instrumented arcs */
377 if (profile_block_flag
)
378 assemble_integer (GEN_INT (count_basic_blocks
), long_bytes
, 1);
380 assemble_integer (GEN_INT (count_instrumented_arcs
), long_bytes
,
383 /* zero word (link field) */
384 assemble_integer (const0_rtx
, pointer_bytes
, 1);
386 /* address of basic block start address table */
387 if (profile_block_flag
)
389 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 3);
390 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), pointer_bytes
,
394 assemble_integer (const0_rtx
, pointer_bytes
, 1);
396 /* byte count for extended structure. */
397 assemble_integer (GEN_INT (10 * UNITS_PER_WORD
), long_bytes
, 1);
399 /* address of function name table */
400 if (profile_block_flag
)
402 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 4);
403 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), pointer_bytes
,
407 assemble_integer (const0_rtx
, pointer_bytes
, 1);
409 /* address of line number and filename tables if debugging. */
410 if (write_symbols
!= NO_DEBUG
&& profile_block_flag
)
412 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 5);
413 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), pointer_bytes
, 1);
414 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 6);
415 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), pointer_bytes
, 1);
419 assemble_integer (const0_rtx
, pointer_bytes
, 1);
420 assemble_integer (const0_rtx
, pointer_bytes
, 1);
423 /* space for extension ptr (link field) */
424 assemble_integer (const0_rtx
, UNITS_PER_WORD
, 1);
426 /* Output the file name changing the suffix to .d for Sun tcov
428 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 1);
430 char *cwd
= getpwd ();
431 int len
= strlen (filename
) + strlen (cwd
) + 1;
432 char *data_file
= (char *) alloca (len
+ 4);
434 strcpy (data_file
, cwd
);
435 strcat (data_file
, "/");
436 strcat (data_file
, filename
);
437 strip_off_ending (data_file
, len
);
438 if (profile_block_flag
)
439 strcat (data_file
, ".d");
441 strcat (data_file
, ".da");
442 assemble_string (data_file
, strlen (data_file
) + 1);
445 /* Make space for the table of counts. */
448 /* Realign data section. */
449 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
450 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 2);
452 assemble_zeros (size
);
456 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 2);
457 #ifdef ASM_OUTPUT_SHARED_LOCAL
458 if (flag_shared_data
)
459 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
462 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
463 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
466 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
467 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
,
470 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
475 /* Output any basic block strings */
476 if (profile_block_flag
)
478 readonly_data_section ();
481 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
482 for (sptr
= sbb_head
; sptr
!= 0; sptr
= sptr
->next
)
484 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBC",
486 assemble_string (sptr
->string
, sptr
->length
);
491 /* Output the table of addresses. */
492 if (profile_block_flag
)
494 /* Realign in new section */
495 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
496 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 3);
497 for (i
= 0; i
< count_basic_blocks
; i
++)
499 ASM_GENERATE_INTERNAL_LABEL (name
, "LPB", i
);
500 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
),
505 /* Output the table of function names. */
506 if (profile_block_flag
)
508 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 4);
509 for ((ptr
= bb_head
), (i
= 0); ptr
!= 0; (ptr
= ptr
->next
), i
++)
511 if (ptr
->func_label_num
>= 0)
513 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBC",
514 ptr
->func_label_num
);
515 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
),
519 assemble_integer (const0_rtx
, pointer_bytes
, 1);
522 for ( ; i
< count_basic_blocks
; i
++)
523 assemble_integer (const0_rtx
, pointer_bytes
, 1);
526 if (write_symbols
!= NO_DEBUG
&& profile_block_flag
)
528 /* Output the table of line numbers. */
529 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 5);
530 for ((ptr
= bb_head
), (i
= 0); ptr
!= 0; (ptr
= ptr
->next
), i
++)
531 assemble_integer (GEN_INT (ptr
->line_num
), long_bytes
, 1);
533 for ( ; i
< count_basic_blocks
; i
++)
534 assemble_integer (const0_rtx
, long_bytes
, 1);
536 /* Output the table of file names. */
537 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LPBX", 6);
538 for ((ptr
= bb_head
), (i
= 0); ptr
!= 0; (ptr
= ptr
->next
), i
++)
540 if (ptr
->file_label_num
>= 0)
542 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBC",
543 ptr
->file_label_num
);
544 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
),
548 assemble_integer (const0_rtx
, pointer_bytes
, 1);
551 for ( ; i
< count_basic_blocks
; i
++)
552 assemble_integer (const0_rtx
, pointer_bytes
, 1);
555 /* End with the address of the table of addresses,
556 so we can find it easily, as the last word in the file's text. */
557 if (profile_block_flag
)
559 ASM_GENERATE_INTERNAL_LABEL (name
, "LPBX", 3);
560 assemble_integer (gen_rtx (SYMBOL_REF
, Pmode
, name
), pointer_bytes
,
566 /* Enable APP processing of subsequent output.
567 Used before the output from an `asm' statement. */
574 fprintf (asm_out_file
, ASM_APP_ON
);
579 /* Disable APP processing of subsequent output.
580 Called from varasm.c before most kinds of output. */
587 fprintf (asm_out_file
, ASM_APP_OFF
);
592 /* Return the number of slots filled in the current
593 delayed branch sequence (we don't count the insn needing the
594 delay slot). Zero if not in a delayed branch sequence. */
598 dbr_sequence_length ()
600 if (final_sequence
!= 0)
601 return XVECLEN (final_sequence
, 0) - 1;
607 /* The next two pages contain routines used to compute the length of an insn
608 and to shorten branches. */
610 /* Arrays for insn lengths, and addresses. The latter is referenced by
611 `insn_current_length'. */
613 static short *insn_lengths
;
616 /* Address of insn being processed. Used by `insn_current_length'. */
617 int insn_current_address
;
619 /* Indicate that branch shortening hasn't yet been done. */
627 /* Obtain the current length of an insn. If branch shortening has been done,
628 get its actual length. Otherwise, get its maximum length. */
631 get_attr_length (insn
)
634 #ifdef HAVE_ATTR_length
640 return insn_lengths
[INSN_UID (insn
)];
642 switch (GET_CODE (insn
))
650 length
= insn_default_length (insn
);
654 body
= PATTERN (insn
);
655 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
657 /* This only takes room if jump tables go into the text section. */
658 #if !defined(READONLY_DATA_SECTION) || defined(JUMP_TABLES_IN_TEXT_SECTION)
659 length
= (XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
)
660 * GET_MODE_SIZE (GET_MODE (body
)));
662 /* Be pessimistic and assume worst-case alignment. */
663 length
+= (GET_MODE_SIZE (GET_MODE (body
)) - 1);
669 length
= insn_default_length (insn
);
673 body
= PATTERN (insn
);
674 if (GET_CODE (body
) == USE
|| GET_CODE (body
) == CLOBBER
)
677 else if (GET_CODE (body
) == ASM_INPUT
|| asm_noperands (body
) >= 0)
678 length
= asm_insn_count (body
) * insn_default_length (insn
);
679 else if (GET_CODE (body
) == SEQUENCE
)
680 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
681 length
+= get_attr_length (XVECEXP (body
, 0, i
));
683 length
= insn_default_length (insn
);
690 #ifdef ADJUST_INSN_LENGTH
691 ADJUST_INSN_LENGTH (insn
, length
);
694 #else /* not HAVE_ATTR_length */
696 #endif /* not HAVE_ATTR_length */
699 /* Make a pass over all insns and compute their actual lengths by shortening
700 any branches of variable length if possible. */
702 /* Give a default value for the lowest address in a function. */
704 #ifndef FIRST_INSN_ADDRESS
705 #define FIRST_INSN_ADDRESS 0
709 shorten_branches (first
)
712 #ifdef HAVE_ATTR_length
714 int something_changed
= 1;
716 char *varying_length
;
720 /* In order to make sure that all instructions have valid length info,
721 we must split them before we compute the address/length info. */
723 for (insn
= NEXT_INSN (first
); insn
; insn
= NEXT_INSN (insn
))
724 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
725 insn
= try_split (PATTERN (insn
), insn
, 1);
727 /* Compute maximum UID and allocate arrays. */
728 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
729 if (INSN_UID (insn
) > max_uid
)
730 max_uid
= INSN_UID (insn
);
733 insn_lengths
= (short *) oballoc (max_uid
* sizeof (short));
734 insn_addresses
= (int *) oballoc (max_uid
* sizeof (int));
735 varying_length
= (char *) oballoc (max_uid
* sizeof (char));
737 /* Compute initial lengths, addresses, and varying flags for each insn. */
738 for (insn_current_address
= FIRST_INSN_ADDRESS
, insn
= first
;
740 insn_current_address
+= insn_lengths
[uid
], insn
= NEXT_INSN (insn
))
742 uid
= INSN_UID (insn
);
743 insn_addresses
[uid
] = insn_current_address
;
744 insn_lengths
[uid
] = 0;
745 varying_length
[uid
] = 0;
747 if (GET_CODE (insn
) == NOTE
|| GET_CODE (insn
) == BARRIER
748 || GET_CODE (insn
) == CODE_LABEL
)
750 if (INSN_DELETED_P (insn
))
753 body
= PATTERN (insn
);
754 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
756 /* This only takes room if read-only data goes into the text
758 #if !defined(READONLY_DATA_SECTION) || defined(JUMP_TABLES_IN_TEXT_SECTION)
759 int unitsize
= GET_MODE_SIZE (GET_MODE (body
));
761 insn_lengths
[uid
] = (XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
)
762 * GET_MODE_SIZE (GET_MODE (body
)));
764 /* We don't know what address the ADDR_VEC/ADDR_DIFF_VEC will end
765 up at after branch shortening. As a result, it is impossible
766 to determine how much padding we need at this point. Therefore,
767 assume worst possible alignment. */
768 insn_lengths
[uid
] += unitsize
- 1;
774 else if (asm_noperands (body
) >= 0)
775 insn_lengths
[uid
] = asm_insn_count (body
) * insn_default_length (insn
);
776 else if (GET_CODE (body
) == SEQUENCE
)
779 int const_delay_slots
;
781 const_delay_slots
= const_num_delay_slots (XVECEXP (body
, 0, 0));
783 const_delay_slots
= 0;
785 /* Inside a delay slot sequence, we do not do any branch shortening
786 if the shortening could change the number of delay slots
788 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
790 rtx inner_insn
= XVECEXP (body
, 0, i
);
791 int inner_uid
= INSN_UID (inner_insn
);
794 if (asm_noperands (PATTERN (XVECEXP (body
, 0, i
))) >= 0)
795 inner_length
= (asm_insn_count (PATTERN (inner_insn
))
796 * insn_default_length (inner_insn
));
798 inner_length
= insn_default_length (inner_insn
);
800 insn_lengths
[inner_uid
] = inner_length
;
801 if (const_delay_slots
)
803 if ((varying_length
[inner_uid
]
804 = insn_variable_length_p (inner_insn
)) != 0)
805 varying_length
[uid
] = 1;
806 insn_addresses
[inner_uid
] = (insn_current_address
+
810 varying_length
[inner_uid
] = 0;
811 insn_lengths
[uid
] += inner_length
;
814 else if (GET_CODE (body
) != USE
&& GET_CODE (body
) != CLOBBER
)
816 insn_lengths
[uid
] = insn_default_length (insn
);
817 varying_length
[uid
] = insn_variable_length_p (insn
);
820 /* If needed, do any adjustment. */
821 #ifdef ADJUST_INSN_LENGTH
822 ADJUST_INSN_LENGTH (insn
, insn_lengths
[uid
]);
826 /* Now loop over all the insns finding varying length insns. For each,
827 get the current insn length. If it has changed, reflect the change.
828 When nothing changes for a full pass, we are done. */
830 while (something_changed
)
832 something_changed
= 0;
833 for (insn_current_address
= FIRST_INSN_ADDRESS
, insn
= first
;
835 insn
= NEXT_INSN (insn
))
840 uid
= INSN_UID (insn
);
841 insn_addresses
[uid
] = insn_current_address
;
842 if (! varying_length
[uid
])
844 insn_current_address
+= insn_lengths
[uid
];
847 if (GET_CODE (insn
) == INSN
&& GET_CODE (PATTERN (insn
)) == SEQUENCE
)
851 body
= PATTERN (insn
);
853 for (i
= 0; i
< XVECLEN (body
, 0); i
++)
855 rtx inner_insn
= XVECEXP (body
, 0, i
);
856 int inner_uid
= INSN_UID (inner_insn
);
859 insn_addresses
[inner_uid
] = insn_current_address
;
861 /* insn_current_length returns 0 for insns with a
862 non-varying length. */
863 if (! varying_length
[inner_uid
])
864 inner_length
= insn_lengths
[inner_uid
];
866 inner_length
= insn_current_length (inner_insn
);
868 if (inner_length
!= insn_lengths
[inner_uid
])
870 insn_lengths
[inner_uid
] = inner_length
;
871 something_changed
= 1;
873 insn_current_address
+= insn_lengths
[inner_uid
];
874 new_length
+= inner_length
;
879 new_length
= insn_current_length (insn
);
880 insn_current_address
+= new_length
;
883 #ifdef SHORTEN_WITH_ADJUST_INSN_LENGTH
884 #ifdef ADJUST_INSN_LENGTH
885 /* If needed, do any adjustment. */
886 tmp_length
= new_length
;
887 ADJUST_INSN_LENGTH (insn
, new_length
);
888 insn_current_address
+= (new_length
- tmp_length
);
892 if (new_length
!= insn_lengths
[uid
])
894 insn_lengths
[uid
] = new_length
;
895 something_changed
= 1;
898 /* For a non-optimizing compile, do only a single pass. */
902 #endif /* HAVE_ATTR_length */
905 #ifdef HAVE_ATTR_length
906 /* Given the body of an INSN known to be generated by an ASM statement, return
907 the number of machine instructions likely to be generated for this insn.
908 This is used to compute its length. */
911 asm_insn_count (body
)
917 if (GET_CODE (body
) == ASM_INPUT
)
918 template = XSTR (body
, 0);
920 template = decode_asm_operands (body
, NULL_PTR
, NULL_PTR
,
923 for ( ; *template; template++)
924 if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n')
931 /* Output assembler code for the start of a function,
932 and initialize some of the variables in this file
933 for the new function. The label for the function and associated
934 assembler pseudo-ops have already been output in `assemble_start_function'.
936 FIRST is the first insn of the rtl for the function being compiled.
937 FILE is the file to write assembler code to.
938 OPTIMIZE is nonzero if we should eliminate redundant
939 test and compare insns. */
942 final_start_function (first
, file
, optimize
)
949 this_is_asm_operands
= 0;
951 #ifdef NON_SAVING_SETJMP
952 /* A function that calls setjmp should save and restore all the
953 call-saved registers on a system where longjmp clobbers them. */
954 if (NON_SAVING_SETJMP
&& current_function_calls_setjmp
)
958 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
959 if (!call_used_regs
[i
] && !call_fixed_regs
[i
])
960 regs_ever_live
[i
] = 1;
964 /* Initial line number is supposed to be output
965 before the function's prologue and label
966 so that the function's address will not appear to be
967 in the last statement of the preceding function. */
968 if (NOTE_LINE_NUMBER (first
) != NOTE_INSN_DELETED
)
969 last_linenum
= high_block_linenum
= high_function_linenum
970 = NOTE_LINE_NUMBER (first
);
972 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
973 /* Output DWARF definition of the function. */
974 if (dwarf2out_do_frame ())
975 dwarf2out_begin_prologue ();
978 /* For SDB and XCOFF, the function beginning must be marked between
979 the function label and the prologue. We always need this, even when
980 -g1 was used. Defer on MIPS systems so that parameter descriptions
981 follow function entry. */
982 #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO)
983 if (write_symbols
== SDB_DEBUG
)
984 sdbout_begin_function (last_linenum
);
987 #ifdef XCOFF_DEBUGGING_INFO
988 if (write_symbols
== XCOFF_DEBUG
)
989 xcoffout_begin_function (file
, last_linenum
);
992 /* But only output line number for other debug info types if -g2
994 if (NOTE_LINE_NUMBER (first
) != NOTE_INSN_DELETED
)
995 output_source_line (file
, first
);
997 #ifdef LEAF_REG_REMAP
999 leaf_renumber_regs (first
);
1002 /* The Sun386i and perhaps other machines don't work right
1003 if the profiling code comes after the prologue. */
1004 #ifdef PROFILE_BEFORE_PROLOGUE
1006 profile_function (file
);
1007 #endif /* PROFILE_BEFORE_PROLOGUE */
1009 #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue)
1010 if (dwarf2out_do_frame ())
1011 dwarf2out_frame_debug (NULL_RTX
);
1014 #ifdef FUNCTION_PROLOGUE
1015 /* First output the function prologue: code to set up the stack frame. */
1016 FUNCTION_PROLOGUE (file
, get_frame_size ());
1019 #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
1020 if (write_symbols
== SDB_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1021 next_block_index
= 1;
1024 /* If the machine represents the prologue as RTL, the profiling code must
1025 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1026 #ifdef HAVE_prologue
1027 if (! HAVE_prologue
)
1029 profile_after_prologue (file
);
1033 /* If we are doing basic block profiling, remember a printable version
1034 of the function name. */
1035 if (profile_block_flag
)
1038 = add_bb_string ((*decl_printable_name
) (current_function_decl
, 2), FALSE
);
1043 profile_after_prologue (file
)
1046 #ifdef FUNCTION_BLOCK_PROFILER
1047 if (profile_block_flag
)
1049 FUNCTION_BLOCK_PROFILER (file
, count_basic_blocks
);
1051 #endif /* FUNCTION_BLOCK_PROFILER */
1053 #ifndef PROFILE_BEFORE_PROLOGUE
1055 profile_function (file
);
1056 #endif /* not PROFILE_BEFORE_PROLOGUE */
1060 profile_function (file
)
1063 int align
= MIN (BIGGEST_ALIGNMENT
, LONG_TYPE_SIZE
);
1064 int sval
= current_function_returns_struct
;
1065 int cxt
= current_function_needs_context
;
1068 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
1069 ASM_OUTPUT_INTERNAL_LABEL (file
, "LP", profile_label_no
);
1070 assemble_integer (const0_rtx
, LONG_TYPE_SIZE
/ BITS_PER_UNIT
, 1);
1072 function_section (current_function_decl
);
1074 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1076 ASM_OUTPUT_REG_PUSH (file
, STRUCT_VALUE_INCOMING_REGNUM
);
1078 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1080 ASM_OUTPUT_REG_PUSH (file
, STRUCT_VALUE_REGNUM
);
1084 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1086 ASM_OUTPUT_REG_PUSH (file
, STATIC_CHAIN_INCOMING_REGNUM
);
1088 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1090 ASM_OUTPUT_REG_PUSH (file
, STATIC_CHAIN_REGNUM
);
1094 FUNCTION_PROFILER (file
, profile_label_no
);
1096 #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1098 ASM_OUTPUT_REG_POP (file
, STATIC_CHAIN_INCOMING_REGNUM
);
1100 #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1102 ASM_OUTPUT_REG_POP (file
, STATIC_CHAIN_REGNUM
);
1106 #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1108 ASM_OUTPUT_REG_POP (file
, STRUCT_VALUE_INCOMING_REGNUM
);
1110 #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1112 ASM_OUTPUT_REG_POP (file
, STRUCT_VALUE_REGNUM
);
1117 /* Output assembler code for the end of a function.
1118 For clarity, args are same as those of `final_start_function'
1119 even though not all of them are needed. */
1122 final_end_function (first
, file
, optimize
)
1129 fprintf (file
, ASM_APP_OFF
);
1133 #ifdef SDB_DEBUGGING_INFO
1134 if (write_symbols
== SDB_DEBUG
)
1135 sdbout_end_function (high_function_linenum
);
1138 #ifdef DWARF_DEBUGGING_INFO
1139 if (write_symbols
== DWARF_DEBUG
)
1140 dwarfout_end_function ();
1143 #ifdef XCOFF_DEBUGGING_INFO
1144 if (write_symbols
== XCOFF_DEBUG
)
1145 xcoffout_end_function (file
, high_function_linenum
);
1148 #ifdef FUNCTION_EPILOGUE
1149 /* Finally, output the function epilogue:
1150 code to restore the stack frame and return to the caller. */
1151 FUNCTION_EPILOGUE (file
, get_frame_size ());
1154 #ifdef SDB_DEBUGGING_INFO
1155 if (write_symbols
== SDB_DEBUG
)
1156 sdbout_end_epilogue ();
1159 #ifdef DWARF_DEBUGGING_INFO
1160 if (write_symbols
== DWARF_DEBUG
)
1161 dwarfout_end_epilogue ();
1164 #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
1165 if (dwarf2out_do_frame ())
1166 dwarf2out_end_epilogue ();
1169 #ifdef XCOFF_DEBUGGING_INFO
1170 if (write_symbols
== XCOFF_DEBUG
)
1171 xcoffout_end_epilogue (file
);
1174 bb_func_label_num
= -1; /* not in function, nuke label # */
1176 /* If FUNCTION_EPILOGUE is not defined, then the function body
1177 itself contains return instructions wherever needed. */
1180 /* Add a block to the linked list that remembers the current line/file/function
1181 for basic block profiling. Emit the label in front of the basic block and
1182 the instructions that increment the count field. */
1188 struct bb_list
*ptr
= (struct bb_list
*) permalloc (sizeof (struct bb_list
));
1190 /* Add basic block to linked list. */
1192 ptr
->line_num
= last_linenum
;
1193 ptr
->file_label_num
= bb_file_label_num
;
1194 ptr
->func_label_num
= bb_func_label_num
;
1196 bb_tail
= &ptr
->next
;
1198 /* Enable the table of basic-block use counts
1199 to point at the code it applies to. */
1200 ASM_OUTPUT_INTERNAL_LABEL (file
, "LPB", count_basic_blocks
);
1202 /* Before first insn of this basic block, increment the
1203 count of times it was entered. */
1204 #ifdef BLOCK_PROFILER
1205 BLOCK_PROFILER (file
, count_basic_blocks
);
1212 count_basic_blocks
++;
1215 /* Add a string to be used for basic block profiling. */
1218 add_bb_string (string
, perm_p
)
1223 struct bb_str
*ptr
= 0;
1227 string
= "<unknown>";
1231 /* Allocate a new string if the current string isn't permanent. If
1232 the string is permanent search for the same string in other
1235 len
= strlen (string
) + 1;
1238 char *p
= (char *) permalloc (len
);
1239 bcopy (string
, p
, len
);
1243 for (ptr
= sbb_head
; ptr
!= (struct bb_str
*) 0; ptr
= ptr
->next
)
1244 if (ptr
->string
== string
)
1247 /* Allocate a new string block if we need to. */
1250 ptr
= (struct bb_str
*) permalloc (sizeof (*ptr
));
1253 ptr
->label_num
= sbb_label_num
++;
1254 ptr
->string
= string
;
1256 sbb_tail
= &ptr
->next
;
1259 return ptr
->label_num
;
1263 /* Output assembler code for some insns: all or part of a function.
1264 For description of args, see `final_start_function', above.
1266 PRESCAN is 1 if we are not really outputting,
1267 just scanning as if we were outputting.
1268 Prescanning deletes and rearranges insns just like ordinary output.
1269 PRESCAN is -2 if we are outputting after having prescanned.
1270 In this case, don't try to delete or rearrange insns
1271 because that has already been done.
1272 Prescanning is done only on certain machines. */
1275 final (first
, file
, optimize
, prescan
)
1284 last_ignored_compare
= 0;
1287 check_exception_handler_labels ();
1289 /* Make a map indicating which line numbers appear in this function.
1290 When producing SDB debugging info, delete troublesome line number
1291 notes from inlined functions in other files as well as duplicate
1292 line number notes. */
1293 #ifdef SDB_DEBUGGING_INFO
1294 if (write_symbols
== SDB_DEBUG
)
1297 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1298 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
1300 if ((RTX_INTEGRATED_P (insn
)
1301 && strcmp (NOTE_SOURCE_FILE (insn
), main_input_filename
) != 0)
1303 && NOTE_LINE_NUMBER (insn
) == NOTE_LINE_NUMBER (last
)
1304 && NOTE_SOURCE_FILE (insn
) == NOTE_SOURCE_FILE (last
)))
1306 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
1307 NOTE_SOURCE_FILE (insn
) = 0;
1311 if (NOTE_LINE_NUMBER (insn
) > max_line
)
1312 max_line
= NOTE_LINE_NUMBER (insn
);
1318 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1319 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > max_line
)
1320 max_line
= NOTE_LINE_NUMBER (insn
);
1323 line_note_exists
= (char *) oballoc (max_line
+ 1);
1324 bzero (line_note_exists
, max_line
+ 1);
1326 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
1327 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) > 0)
1328 line_note_exists
[NOTE_LINE_NUMBER (insn
)] = 1;
1334 /* Output the insns. */
1335 for (insn
= NEXT_INSN (first
); insn
;)
1337 #ifdef HAVE_ATTR_length
1338 insn_current_address
= insn_addresses
[INSN_UID (insn
)];
1340 insn
= final_scan_insn (insn
, file
, optimize
, prescan
, 0);
1343 /* Do basic-block profiling here
1344 if the last insn was a conditional branch. */
1345 if (profile_block_flag
&& new_block
)
1349 /* The final scan for one insn, INSN.
1350 Args are same as in `final', except that INSN
1351 is the insn being scanned.
1352 Value returned is the next insn to be scanned.
1354 NOPEEPHOLES is the flag to disallow peephole processing (currently
1355 used for within delayed branch sequence output). */
1358 final_scan_insn (insn
, file
, optimize
, prescan
, nopeepholes
)
1368 /* Ignore deleted insns. These can occur when we split insns (due to a
1369 template of "#") while not optimizing. */
1370 if (INSN_DELETED_P (insn
))
1371 return NEXT_INSN (insn
);
1373 switch (GET_CODE (insn
))
1379 /* Align the beginning of a loop, for higher speed
1380 on certain machines. */
1382 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_LOOP_BEG
&& optimize
> 0)
1384 #ifdef ASM_OUTPUT_LOOP_ALIGN
1385 rtx next
= next_nonnote_insn (insn
);
1386 if (next
&& GET_CODE (next
) == CODE_LABEL
)
1388 ASM_OUTPUT_LOOP_ALIGN (asm_out_file
);
1393 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_LOOP_END
)
1396 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EH_REGION_BEG
1397 && ! exceptions_via_longjmp
)
1399 ASM_OUTPUT_INTERNAL_LABEL (file
, "LEHB", NOTE_BLOCK_NUMBER (insn
));
1400 add_eh_table_entry (NOTE_BLOCK_NUMBER (insn
));
1401 #ifdef ASM_OUTPUT_EH_REGION_BEG
1402 ASM_OUTPUT_EH_REGION_BEG (file
, NOTE_BLOCK_NUMBER (insn
));
1407 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EH_REGION_END
1408 && ! exceptions_via_longjmp
)
1410 ASM_OUTPUT_INTERNAL_LABEL (file
, "LEHE", NOTE_BLOCK_NUMBER (insn
));
1411 #ifdef ASM_OUTPUT_EH_REGION_END
1412 ASM_OUTPUT_EH_REGION_END (file
, NOTE_BLOCK_NUMBER (insn
));
1417 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_PROLOGUE_END
)
1419 #ifdef FUNCTION_END_PROLOGUE
1420 FUNCTION_END_PROLOGUE (file
);
1422 profile_after_prologue (file
);
1426 #ifdef FUNCTION_BEGIN_EPILOGUE
1427 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EPILOGUE_BEG
)
1429 FUNCTION_BEGIN_EPILOGUE (file
);
1434 if (write_symbols
== NO_DEBUG
)
1436 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_FUNCTION_BEG
)
1438 #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO)
1439 /* MIPS stabs require the parameter descriptions to be after the
1440 function entry point rather than before. */
1441 if (write_symbols
== SDB_DEBUG
)
1442 sdbout_begin_function (last_linenum
);
1445 #ifdef DWARF_DEBUGGING_INFO
1446 /* This outputs a marker where the function body starts, so it
1447 must be after the prologue. */
1448 if (write_symbols
== DWARF_DEBUG
)
1449 dwarfout_begin_function ();
1453 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_DELETED
)
1454 break; /* An insn that was "deleted" */
1457 fprintf (file
, ASM_APP_OFF
);
1460 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_BEG
1461 && (debug_info_level
== DINFO_LEVEL_NORMAL
1462 || debug_info_level
== DINFO_LEVEL_VERBOSE
1463 || write_symbols
== DWARF_DEBUG
1464 || write_symbols
== DWARF2_DEBUG
))
1466 /* Beginning of a symbol-block. Assign it a sequence number
1467 and push the number onto the stack PENDING_BLOCKS. */
1469 if (block_depth
== max_block_depth
)
1471 /* PENDING_BLOCKS is full; make it longer. */
1472 max_block_depth
*= 2;
1474 = (int *) xrealloc (pending_blocks
,
1475 max_block_depth
* sizeof (int));
1477 pending_blocks
[block_depth
++] = next_block_index
;
1479 high_block_linenum
= last_linenum
;
1481 /* Output debugging info about the symbol-block beginning. */
1483 #ifdef SDB_DEBUGGING_INFO
1484 if (write_symbols
== SDB_DEBUG
)
1485 sdbout_begin_block (file
, last_linenum
, next_block_index
);
1487 #ifdef XCOFF_DEBUGGING_INFO
1488 if (write_symbols
== XCOFF_DEBUG
)
1489 xcoffout_begin_block (file
, last_linenum
, next_block_index
);
1491 #ifdef DBX_DEBUGGING_INFO
1492 if (write_symbols
== DBX_DEBUG
)
1493 ASM_OUTPUT_INTERNAL_LABEL (file
, "LBB", next_block_index
);
1495 #ifdef DWARF_DEBUGGING_INFO
1496 if (write_symbols
== DWARF_DEBUG
)
1497 dwarfout_begin_block (next_block_index
);
1499 #ifdef DWARF2_DEBUGGING_INFO
1500 if (write_symbols
== DWARF2_DEBUG
)
1501 dwarf2out_begin_block (next_block_index
);
1506 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BLOCK_END
1507 && (debug_info_level
== DINFO_LEVEL_NORMAL
1508 || debug_info_level
== DINFO_LEVEL_VERBOSE
1509 || write_symbols
== DWARF_DEBUG
1510 || write_symbols
== DWARF2_DEBUG
))
1512 /* End of a symbol-block. Pop its sequence number off
1513 PENDING_BLOCKS and output debugging info based on that. */
1517 #ifdef XCOFF_DEBUGGING_INFO
1518 if (write_symbols
== XCOFF_DEBUG
&& block_depth
>= 0)
1519 xcoffout_end_block (file
, high_block_linenum
,
1520 pending_blocks
[block_depth
]);
1522 #ifdef DBX_DEBUGGING_INFO
1523 if (write_symbols
== DBX_DEBUG
&& block_depth
>= 0)
1524 ASM_OUTPUT_INTERNAL_LABEL (file
, "LBE",
1525 pending_blocks
[block_depth
]);
1527 #ifdef SDB_DEBUGGING_INFO
1528 if (write_symbols
== SDB_DEBUG
&& block_depth
>= 0)
1529 sdbout_end_block (file
, high_block_linenum
,
1530 pending_blocks
[block_depth
]);
1532 #ifdef DWARF_DEBUGGING_INFO
1533 if (write_symbols
== DWARF_DEBUG
&& block_depth
>= 0)
1534 dwarfout_end_block (pending_blocks
[block_depth
]);
1536 #ifdef DWARF2_DEBUGGING_INFO
1537 if (write_symbols
== DWARF2_DEBUG
&& block_depth
>= 0)
1538 dwarf2out_end_block (pending_blocks
[block_depth
]);
1541 else if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_DELETED_LABEL
1542 && (debug_info_level
== DINFO_LEVEL_NORMAL
1543 || debug_info_level
== DINFO_LEVEL_VERBOSE
))
1545 #ifdef DWARF_DEBUGGING_INFO
1546 if (write_symbols
== DWARF_DEBUG
)
1547 dwarfout_label (insn
);
1549 #ifdef DWARF2_DEBUGGING_INFO
1550 if (write_symbols
== DWARF2_DEBUG
)
1551 dwarf2out_label (insn
);
1554 else if (NOTE_LINE_NUMBER (insn
) > 0)
1555 /* This note is a line-number. */
1559 #if 0 /* This is what we used to do. */
1560 output_source_line (file
, insn
);
1564 /* If there is anything real after this note,
1565 output it. If another line note follows, omit this one. */
1566 for (note
= NEXT_INSN (insn
); note
; note
= NEXT_INSN (note
))
1568 if (GET_CODE (note
) != NOTE
&& GET_CODE (note
) != CODE_LABEL
)
1570 /* These types of notes can be significant
1571 so make sure the preceding line number stays. */
1572 else if (GET_CODE (note
) == NOTE
1573 && (NOTE_LINE_NUMBER (note
) == NOTE_INSN_BLOCK_BEG
1574 || NOTE_LINE_NUMBER (note
) == NOTE_INSN_BLOCK_END
1575 || NOTE_LINE_NUMBER (note
) == NOTE_INSN_FUNCTION_BEG
))
1577 else if (GET_CODE (note
) == NOTE
&& NOTE_LINE_NUMBER (note
) > 0)
1579 /* Another line note follows; we can delete this note
1580 if no intervening line numbers have notes elsewhere. */
1582 for (num
= NOTE_LINE_NUMBER (insn
) + 1;
1583 num
< NOTE_LINE_NUMBER (note
);
1585 if (line_note_exists
[num
])
1588 if (num
>= NOTE_LINE_NUMBER (note
))
1594 /* Output this line note
1595 if it is the first or the last line note in a row. */
1597 output_source_line (file
, insn
);
1602 #ifdef ASM_OUTPUT_ALIGN_CODE
1603 /* Don't litter the assembler output with needless alignments. A
1604 BARRIER will be placed at the end of every function if HAVE_epilogue
1606 if (NEXT_INSN (insn
))
1607 ASM_OUTPUT_ALIGN_CODE (file
);
1609 #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS)
1610 /* If we push arguments, we need to check all insns for stack
1612 if (dwarf2out_do_frame ())
1613 dwarf2out_frame_debug (insn
);
1623 #ifdef FINAL_PRESCAN_LABEL
1624 FINAL_PRESCAN_INSN (insn
, NULL_PTR
, 0);
1627 #ifdef SDB_DEBUGGING_INFO
1628 if (write_symbols
== SDB_DEBUG
&& LABEL_NAME (insn
))
1629 sdbout_label (insn
);
1631 #ifdef DWARF_DEBUGGING_INFO
1632 if (write_symbols
== DWARF_DEBUG
&& LABEL_NAME (insn
))
1633 dwarfout_label (insn
);
1635 #ifdef DWARF2_DEBUGGING_INFO
1636 if (write_symbols
== DWARF2_DEBUG
&& LABEL_NAME (insn
))
1637 dwarf2out_label (insn
);
1641 fprintf (file
, ASM_APP_OFF
);
1644 if (NEXT_INSN (insn
) != 0
1645 && GET_CODE (NEXT_INSN (insn
)) == JUMP_INSN
)
1647 rtx nextbody
= PATTERN (NEXT_INSN (insn
));
1649 /* If this label is followed by a jump-table,
1650 make sure we put the label in the read-only section. Also
1651 possibly write the label and jump table together. */
1653 if (GET_CODE (nextbody
) == ADDR_VEC
1654 || GET_CODE (nextbody
) == ADDR_DIFF_VEC
)
1656 #ifndef JUMP_TABLES_IN_TEXT_SECTION
1657 readonly_data_section ();
1658 #ifdef READONLY_DATA_SECTION
1659 ASM_OUTPUT_ALIGN (file
,
1660 exact_log2 (BIGGEST_ALIGNMENT
1662 #endif /* READONLY_DATA_SECTION */
1663 #else /* JUMP_TABLES_IN_TEXT_SECTION */
1664 function_section (current_function_decl
);
1665 #endif /* JUMP_TABLES_IN_TEXT_SECTION */
1666 #ifdef ASM_OUTPUT_CASE_LABEL
1667 ASM_OUTPUT_CASE_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
),
1670 ASM_OUTPUT_INTERNAL_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
1676 ASM_OUTPUT_INTERNAL_LABEL (file
, "L", CODE_LABEL_NUMBER (insn
));
1681 register rtx body
= PATTERN (insn
), set
;
1682 int insn_code_number
;
1686 /* An INSN, JUMP_INSN or CALL_INSN.
1687 First check for special kinds that recog doesn't recognize. */
1689 if (GET_CODE (body
) == USE
/* These are just declarations */
1690 || GET_CODE (body
) == CLOBBER
)
1694 /* If there is a REG_CC_SETTER note on this insn, it means that
1695 the setting of the condition code was done in the delay slot
1696 of the insn that branched here. So recover the cc status
1697 from the insn that set it. */
1699 note
= find_reg_note (insn
, REG_CC_SETTER
, NULL_RTX
);
1702 NOTICE_UPDATE_CC (PATTERN (XEXP (note
, 0)), XEXP (note
, 0));
1703 cc_prev_status
= cc_status
;
1707 /* Detect insns that are really jump-tables
1708 and output them as such. */
1710 if (GET_CODE (body
) == ADDR_VEC
|| GET_CODE (body
) == ADDR_DIFF_VEC
)
1712 register int vlen
, idx
;
1719 fprintf (file
, ASM_APP_OFF
);
1723 vlen
= XVECLEN (body
, GET_CODE (body
) == ADDR_DIFF_VEC
);
1724 for (idx
= 0; idx
< vlen
; idx
++)
1726 if (GET_CODE (body
) == ADDR_VEC
)
1728 #ifdef ASM_OUTPUT_ADDR_VEC_ELT
1729 ASM_OUTPUT_ADDR_VEC_ELT
1730 (file
, CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 0, idx
), 0)));
1737 #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
1738 ASM_OUTPUT_ADDR_DIFF_ELT
1740 CODE_LABEL_NUMBER (XEXP (XVECEXP (body
, 1, idx
), 0)),
1741 CODE_LABEL_NUMBER (XEXP (XEXP (body
, 0), 0)));
1747 #ifdef ASM_OUTPUT_CASE_END
1748 ASM_OUTPUT_CASE_END (file
,
1749 CODE_LABEL_NUMBER (PREV_INSN (insn
)),
1753 function_section (current_function_decl
);
1758 /* Do basic-block profiling when we reach a new block.
1759 Done here to avoid jump tables. */
1760 if (profile_block_flag
&& new_block
)
1763 if (GET_CODE (body
) == ASM_INPUT
)
1765 /* There's no telling what that did to the condition codes. */
1771 fprintf (file
, ASM_APP_ON
);
1774 fprintf (asm_out_file
, "\t%s\n", XSTR (body
, 0));
1778 /* Detect `asm' construct with operands. */
1779 if (asm_noperands (body
) >= 0)
1781 int noperands
= asm_noperands (body
);
1782 rtx
*ops
= (rtx
*) alloca (noperands
* sizeof (rtx
));
1785 /* There's no telling what that did to the condition codes. */
1792 fprintf (file
, ASM_APP_ON
);
1796 /* Get out the operand values. */
1797 string
= decode_asm_operands (body
, ops
, NULL_PTR
,
1798 NULL_PTR
, NULL_PTR
);
1799 /* Inhibit aborts on what would otherwise be compiler bugs. */
1800 insn_noperands
= noperands
;
1801 this_is_asm_operands
= insn
;
1803 /* Output the insn using them. */
1804 output_asm_insn (string
, ops
);
1805 this_is_asm_operands
= 0;
1809 if (prescan
<= 0 && app_on
)
1811 fprintf (file
, ASM_APP_OFF
);
1815 if (GET_CODE (body
) == SEQUENCE
)
1817 /* A delayed-branch sequence */
1823 final_sequence
= body
;
1825 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
1826 force the restoration of a comparison that was previously
1827 thought unnecessary. If that happens, cancel this sequence
1828 and cause that insn to be restored. */
1830 next
= final_scan_insn (XVECEXP (body
, 0, 0), file
, 0, prescan
, 1);
1831 if (next
!= XVECEXP (body
, 0, 1))
1837 for (i
= 1; i
< XVECLEN (body
, 0); i
++)
1839 rtx insn
= XVECEXP (body
, 0, i
);
1840 rtx next
= NEXT_INSN (insn
);
1841 /* We loop in case any instruction in a delay slot gets
1844 insn
= final_scan_insn (insn
, file
, 0, prescan
, 1);
1845 while (insn
!= next
);
1847 #ifdef DBR_OUTPUT_SEQEND
1848 DBR_OUTPUT_SEQEND (file
);
1852 /* If the insn requiring the delay slot was a CALL_INSN, the
1853 insns in the delay slot are actually executed before the
1854 called function. Hence we don't preserve any CC-setting
1855 actions in these insns and the CC must be marked as being
1856 clobbered by the function. */
1857 if (GET_CODE (XVECEXP (body
, 0, 0)) == CALL_INSN
)
1860 /* Following a conditional branch sequence, we have a new basic
1862 if (profile_block_flag
)
1864 rtx insn
= XVECEXP (body
, 0, 0);
1865 rtx body
= PATTERN (insn
);
1867 if ((GET_CODE (insn
) == JUMP_INSN
&& GET_CODE (body
) == SET
1868 && GET_CODE (SET_SRC (body
)) != LABEL_REF
)
1869 || (GET_CODE (insn
) == JUMP_INSN
1870 && GET_CODE (body
) == PARALLEL
1871 && GET_CODE (XVECEXP (body
, 0, 0)) == SET
1872 && GET_CODE (SET_SRC (XVECEXP (body
, 0, 0))) != LABEL_REF
))
1878 /* We have a real machine instruction as rtl. */
1880 body
= PATTERN (insn
);
1883 set
= single_set(insn
);
1885 /* Check for redundant test and compare instructions
1886 (when the condition codes are already set up as desired).
1887 This is done only when optimizing; if not optimizing,
1888 it should be possible for the user to alter a variable
1889 with the debugger in between statements
1890 and the next statement should reexamine the variable
1891 to compute the condition codes. */
1896 rtx set
= single_set(insn
);
1900 && GET_CODE (SET_DEST (set
)) == CC0
1901 && insn
!= last_ignored_compare
)
1903 if (GET_CODE (SET_SRC (set
)) == SUBREG
)
1904 SET_SRC (set
) = alter_subreg (SET_SRC (set
));
1905 else if (GET_CODE (SET_SRC (set
)) == COMPARE
)
1907 if (GET_CODE (XEXP (SET_SRC (set
), 0)) == SUBREG
)
1908 XEXP (SET_SRC (set
), 0)
1909 = alter_subreg (XEXP (SET_SRC (set
), 0));
1910 if (GET_CODE (XEXP (SET_SRC (set
), 1)) == SUBREG
)
1911 XEXP (SET_SRC (set
), 1)
1912 = alter_subreg (XEXP (SET_SRC (set
), 1));
1914 if ((cc_status
.value1
!= 0
1915 && rtx_equal_p (SET_SRC (set
), cc_status
.value1
))
1916 || (cc_status
.value2
!= 0
1917 && rtx_equal_p (SET_SRC (set
), cc_status
.value2
)))
1919 /* Don't delete insn if it has an addressing side-effect. */
1920 if (! FIND_REG_INC_NOTE (insn
, 0)
1921 /* or if anything in it is volatile. */
1922 && ! volatile_refs_p (PATTERN (insn
)))
1924 /* We don't really delete the insn; just ignore it. */
1925 last_ignored_compare
= insn
;
1933 /* Following a conditional branch, we have a new basic block.
1934 But if we are inside a sequence, the new block starts after the
1935 last insn of the sequence. */
1936 if (profile_block_flag
&& final_sequence
== 0
1937 && ((GET_CODE (insn
) == JUMP_INSN
&& GET_CODE (body
) == SET
1938 && GET_CODE (SET_SRC (body
)) != LABEL_REF
)
1939 || (GET_CODE (insn
) == JUMP_INSN
&& GET_CODE (body
) == PARALLEL
1940 && GET_CODE (XVECEXP (body
, 0, 0)) == SET
1941 && GET_CODE (SET_SRC (XVECEXP (body
, 0, 0))) != LABEL_REF
)))
1945 /* Don't bother outputting obvious no-ops, even without -O.
1946 This optimization is fast and doesn't interfere with debugging.
1947 Don't do this if the insn is in a delay slot, since this
1948 will cause an improper number of delay insns to be written. */
1949 if (final_sequence
== 0
1951 && GET_CODE (insn
) == INSN
&& GET_CODE (body
) == SET
1952 && GET_CODE (SET_SRC (body
)) == REG
1953 && GET_CODE (SET_DEST (body
)) == REG
1954 && REGNO (SET_SRC (body
)) == REGNO (SET_DEST (body
)))
1959 /* If this is a conditional branch, maybe modify it
1960 if the cc's are in a nonstandard state
1961 so that it accomplishes the same thing that it would
1962 do straightforwardly if the cc's were set up normally. */
1964 if (cc_status
.flags
!= 0
1965 && GET_CODE (insn
) == JUMP_INSN
1966 && GET_CODE (body
) == SET
1967 && SET_DEST (body
) == pc_rtx
1968 && GET_CODE (SET_SRC (body
)) == IF_THEN_ELSE
1969 && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body
), 0))) == '<'
1970 && XEXP (XEXP (SET_SRC (body
), 0), 0) == cc0_rtx
1971 /* This is done during prescan; it is not done again
1972 in final scan when prescan has been done. */
1975 /* This function may alter the contents of its argument
1976 and clear some of the cc_status.flags bits.
1977 It may also return 1 meaning condition now always true
1978 or -1 meaning condition now always false
1979 or 2 meaning condition nontrivial but altered. */
1980 register int result
= alter_cond (XEXP (SET_SRC (body
), 0));
1981 /* If condition now has fixed value, replace the IF_THEN_ELSE
1982 with its then-operand or its else-operand. */
1984 SET_SRC (body
) = XEXP (SET_SRC (body
), 1);
1986 SET_SRC (body
) = XEXP (SET_SRC (body
), 2);
1988 /* The jump is now either unconditional or a no-op.
1989 If it has become a no-op, don't try to output it.
1990 (It would not be recognized.) */
1991 if (SET_SRC (body
) == pc_rtx
)
1993 PUT_CODE (insn
, NOTE
);
1994 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
1995 NOTE_SOURCE_FILE (insn
) = 0;
1998 else if (GET_CODE (SET_SRC (body
)) == RETURN
)
1999 /* Replace (set (pc) (return)) with (return). */
2000 PATTERN (insn
) = body
= SET_SRC (body
);
2002 /* Rerecognize the instruction if it has changed. */
2004 INSN_CODE (insn
) = -1;
2007 /* Make same adjustments to instructions that examine the
2008 condition codes without jumping and instructions that
2009 handle conditional moves (if this machine has either one). */
2011 if (cc_status
.flags
!= 0
2014 rtx cond_rtx
, then_rtx
, else_rtx
;
2016 if (GET_CODE (insn
) != JUMP_INSN
2017 && GET_CODE (SET_SRC (set
)) == IF_THEN_ELSE
)
2019 cond_rtx
= XEXP (SET_SRC (set
), 0);
2020 then_rtx
= XEXP (SET_SRC (set
), 1);
2021 else_rtx
= XEXP (SET_SRC (set
), 2);
2025 cond_rtx
= SET_SRC (set
);
2026 then_rtx
= const_true_rtx
;
2027 else_rtx
= const0_rtx
;
2030 switch (GET_CODE (cond_rtx
))
2043 register int result
;
2044 if (XEXP (cond_rtx
, 0) != cc0_rtx
)
2046 result
= alter_cond (cond_rtx
);
2048 validate_change (insn
, &SET_SRC (set
), then_rtx
, 0);
2049 else if (result
== -1)
2050 validate_change (insn
, &SET_SRC (set
), else_rtx
, 0);
2051 else if (result
== 2)
2052 INSN_CODE (insn
) = -1;
2053 if (SET_DEST (set
) == SET_SRC (set
))
2055 PUT_CODE (insn
, NOTE
);
2056 NOTE_LINE_NUMBER (insn
) = NOTE_INSN_DELETED
;
2057 NOTE_SOURCE_FILE (insn
) = 0;
2069 /* Do machine-specific peephole optimizations if desired. */
2071 if (optimize
&& !flag_no_peephole
&& !nopeepholes
)
2073 rtx next
= peephole (insn
);
2074 /* When peepholing, if there were notes within the peephole,
2075 emit them before the peephole. */
2076 if (next
!= 0 && next
!= NEXT_INSN (insn
))
2078 rtx prev
= PREV_INSN (insn
);
2081 for (note
= NEXT_INSN (insn
); note
!= next
;
2082 note
= NEXT_INSN (note
))
2083 final_scan_insn (note
, file
, optimize
, prescan
, nopeepholes
);
2085 /* In case this is prescan, put the notes
2086 in proper position for later rescan. */
2087 note
= NEXT_INSN (insn
);
2088 PREV_INSN (note
) = prev
;
2089 NEXT_INSN (prev
) = note
;
2090 NEXT_INSN (PREV_INSN (next
)) = insn
;
2091 PREV_INSN (insn
) = PREV_INSN (next
);
2092 NEXT_INSN (insn
) = next
;
2093 PREV_INSN (next
) = insn
;
2096 /* PEEPHOLE might have changed this. */
2097 body
= PATTERN (insn
);
2100 /* Try to recognize the instruction.
2101 If successful, verify that the operands satisfy the
2102 constraints for the instruction. Crash if they don't,
2103 since `reload' should have changed them so that they do. */
2105 insn_code_number
= recog_memoized (insn
);
2106 insn_extract (insn
);
2107 for (i
= 0; i
< insn_n_operands
[insn_code_number
]; i
++)
2109 if (GET_CODE (recog_operand
[i
]) == SUBREG
)
2110 recog_operand
[i
] = alter_subreg (recog_operand
[i
]);
2111 else if (GET_CODE (recog_operand
[i
]) == PLUS
2112 || GET_CODE (recog_operand
[i
]) == MULT
)
2113 recog_operand
[i
] = walk_alter_subreg (recog_operand
[i
]);
2116 for (i
= 0; i
< insn_n_dups
[insn_code_number
]; i
++)
2118 if (GET_CODE (*recog_dup_loc
[i
]) == SUBREG
)
2119 *recog_dup_loc
[i
] = alter_subreg (*recog_dup_loc
[i
]);
2120 else if (GET_CODE (*recog_dup_loc
[i
]) == PLUS
2121 || GET_CODE (*recog_dup_loc
[i
]) == MULT
)
2122 *recog_dup_loc
[i
] = walk_alter_subreg (*recog_dup_loc
[i
]);
2125 #ifdef REGISTER_CONSTRAINTS
2126 if (! constrain_operands (insn_code_number
, 1))
2127 fatal_insn_not_found (insn
);
2130 /* Some target machines need to prescan each insn before
2133 #ifdef FINAL_PRESCAN_INSN
2134 FINAL_PRESCAN_INSN (insn
, recog_operand
,
2135 insn_n_operands
[insn_code_number
]);
2139 cc_prev_status
= cc_status
;
2141 /* Update `cc_status' for this instruction.
2142 The instruction's output routine may change it further.
2143 If the output routine for a jump insn needs to depend
2144 on the cc status, it should look at cc_prev_status. */
2146 NOTICE_UPDATE_CC (body
, insn
);
2151 /* If the proper template needs to be chosen by some C code,
2152 run that code and get the real template. */
2154 template = insn_template
[insn_code_number
];
2157 template = (*insn_outfun
[insn_code_number
]) (recog_operand
, insn
);
2159 /* If the C code returns 0, it means that it is a jump insn
2160 which follows a deleted test insn, and that test insn
2161 needs to be reinserted. */
2164 if (prev_nonnote_insn (insn
) != last_ignored_compare
)
2167 return prev_nonnote_insn (insn
);
2171 /* If the template is the string "#", it means that this insn must
2173 if (template[0] == '#' && template[1] == '\0')
2175 rtx
new = try_split (body
, insn
, 0);
2177 /* If we didn't split the insn, go away. */
2178 if (new == insn
&& PATTERN (new) == body
)
2181 #ifdef HAVE_ATTR_length
2182 /* This instruction should have been split in shorten_branches,
2183 to ensure that we would have valid length info for the
2195 /* Output assembler code from the template. */
2197 output_asm_insn (template, recog_operand
);
2199 #if defined (DWARF2_UNWIND_INFO)
2200 #if !defined (ACCUMULATE_OUTGOING_ARGS)
2201 /* If we push arguments, we need to check all insns for stack
2203 if (dwarf2out_do_frame ())
2204 dwarf2out_frame_debug (insn
);
2206 #if defined (HAVE_prologue)
2207 /* If this insn is part of the prologue, emit DWARF v2
2209 if (RTX_FRAME_RELATED_P (insn
) && dwarf2out_do_frame ())
2210 dwarf2out_frame_debug (insn
);
2216 /* It's not at all clear why we did this and doing so interferes
2217 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2220 /* Mark this insn as having been output. */
2221 INSN_DELETED_P (insn
) = 1;
2227 return NEXT_INSN (insn
);
2230 /* Output debugging info to the assembler file FILE
2231 based on the NOTE-insn INSN, assumed to be a line number. */
2234 output_source_line (file
, insn
)
2238 register char *filename
= NOTE_SOURCE_FILE (insn
);
2240 /* Remember filename for basic block profiling.
2241 Filenames are allocated on the permanent obstack
2242 or are passed in ARGV, so we don't have to save
2245 if (profile_block_flag
&& last_filename
!= filename
)
2246 bb_file_label_num
= add_bb_string (filename
, TRUE
);
2248 last_filename
= filename
;
2249 last_linenum
= NOTE_LINE_NUMBER (insn
);
2250 high_block_linenum
= MAX (last_linenum
, high_block_linenum
);
2251 high_function_linenum
= MAX (last_linenum
, high_function_linenum
);
2253 if (write_symbols
!= NO_DEBUG
)
2255 #ifdef SDB_DEBUGGING_INFO
2256 if (write_symbols
== SDB_DEBUG
2257 #if 0 /* People like having line numbers even in wrong file! */
2258 /* COFF can't handle multiple source files--lose, lose. */
2259 && !strcmp (filename
, main_input_filename
)
2261 /* COFF relative line numbers must be positive. */
2262 && last_linenum
> sdb_begin_function_line
)
2264 #ifdef ASM_OUTPUT_SOURCE_LINE
2265 ASM_OUTPUT_SOURCE_LINE (file
, last_linenum
);
2267 fprintf (file
, "\t.ln\t%d\n",
2268 ((sdb_begin_function_line
> -1)
2269 ? last_linenum
- sdb_begin_function_line
: 1));
2274 #if defined (DBX_DEBUGGING_INFO)
2275 if (write_symbols
== DBX_DEBUG
)
2276 dbxout_source_line (file
, filename
, NOTE_LINE_NUMBER (insn
));
2279 #if defined (XCOFF_DEBUGGING_INFO)
2280 if (write_symbols
== XCOFF_DEBUG
)
2281 xcoffout_source_line (file
, filename
, insn
);
2284 #ifdef DWARF_DEBUGGING_INFO
2285 if (write_symbols
== DWARF_DEBUG
)
2286 dwarfout_line (filename
, NOTE_LINE_NUMBER (insn
));
2289 #ifdef DWARF2_DEBUGGING_INFO
2290 if (write_symbols
== DWARF2_DEBUG
)
2291 dwarf2out_line (filename
, NOTE_LINE_NUMBER (insn
));
2296 /* If X is a SUBREG, replace it with a REG or a MEM,
2297 based on the thing it is a subreg of. */
2303 register rtx y
= SUBREG_REG (x
);
2304 if (GET_CODE (y
) == SUBREG
)
2305 y
= alter_subreg (y
);
2307 if (GET_CODE (y
) == REG
)
2309 /* If the containing reg really gets a hard reg, so do we. */
2311 REGNO (x
) = REGNO (y
) + SUBREG_WORD (x
);
2313 else if (GET_CODE (y
) == MEM
)
2315 register int offset
= SUBREG_WORD (x
) * UNITS_PER_WORD
;
2316 if (BYTES_BIG_ENDIAN
)
2317 offset
-= (MIN (UNITS_PER_WORD
, GET_MODE_SIZE (GET_MODE (x
)))
2318 - MIN (UNITS_PER_WORD
, GET_MODE_SIZE (GET_MODE (y
))));
2320 MEM_VOLATILE_P (x
) = MEM_VOLATILE_P (y
);
2321 XEXP (x
, 0) = plus_constant (XEXP (y
, 0), offset
);
2327 /* Do alter_subreg on all the SUBREGs contained in X. */
2330 walk_alter_subreg (x
)
2333 switch (GET_CODE (x
))
2337 XEXP (x
, 0) = walk_alter_subreg (XEXP (x
, 0));
2338 XEXP (x
, 1) = walk_alter_subreg (XEXP (x
, 1));
2342 XEXP (x
, 0) = walk_alter_subreg (XEXP (x
, 0));
2346 return alter_subreg (x
);
2357 /* Given BODY, the body of a jump instruction, alter the jump condition
2358 as required by the bits that are set in cc_status.flags.
2359 Not all of the bits there can be handled at this level in all cases.
2361 The value is normally 0.
2362 1 means that the condition has become always true.
2363 -1 means that the condition has become always false.
2364 2 means that COND has been altered. */
2372 if (cc_status
.flags
& CC_REVERSED
)
2375 PUT_CODE (cond
, swap_condition (GET_CODE (cond
)));
2378 if (cc_status
.flags
& CC_INVERTED
)
2381 PUT_CODE (cond
, reverse_condition (GET_CODE (cond
)));
2384 if (cc_status
.flags
& CC_NOT_POSITIVE
)
2385 switch (GET_CODE (cond
))
2390 /* Jump becomes unconditional. */
2396 /* Jump becomes no-op. */
2400 PUT_CODE (cond
, EQ
);
2405 PUT_CODE (cond
, NE
);
2413 if (cc_status
.flags
& CC_NOT_NEGATIVE
)
2414 switch (GET_CODE (cond
))
2418 /* Jump becomes unconditional. */
2423 /* Jump becomes no-op. */
2428 PUT_CODE (cond
, EQ
);
2434 PUT_CODE (cond
, NE
);
2442 if (cc_status
.flags
& CC_NO_OVERFLOW
)
2443 switch (GET_CODE (cond
))
2446 /* Jump becomes unconditional. */
2450 PUT_CODE (cond
, EQ
);
2455 PUT_CODE (cond
, NE
);
2460 /* Jump becomes no-op. */
2467 if (cc_status
.flags
& (CC_Z_IN_NOT_N
| CC_Z_IN_N
))
2468 switch (GET_CODE (cond
))
2474 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? GE
: LT
);
2479 PUT_CODE (cond
, cc_status
.flags
& CC_Z_IN_N
? LT
: GE
);
2484 if (cc_status
.flags
& CC_NOT_SIGNED
)
2485 /* The flags are valid if signed condition operators are converted
2487 switch (GET_CODE (cond
))
2490 PUT_CODE (cond
, LEU
);
2495 PUT_CODE (cond
, LTU
);
2500 PUT_CODE (cond
, GTU
);
2505 PUT_CODE (cond
, GEU
);
2517 /* Report inconsistency between the assembler template and the operands.
2518 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
2521 output_operand_lossage (str
)
2524 if (this_is_asm_operands
)
2525 error_for_asm (this_is_asm_operands
, "invalid `asm': %s", str
);
2530 /* Output of assembler code from a template, and its subroutines. */
2532 /* Output text from TEMPLATE to the assembler output file,
2533 obeying %-directions to substitute operands taken from
2534 the vector OPERANDS.
2536 %N (for N a digit) means print operand N in usual manner.
2537 %lN means require operand N to be a CODE_LABEL or LABEL_REF
2538 and print the label name with no punctuation.
2539 %cN means require operand N to be a constant
2540 and print the constant expression with no punctuation.
2541 %aN means expect operand N to be a memory address
2542 (not a memory reference!) and print a reference
2544 %nN means expect operand N to be a constant
2545 and print a constant expression for minus the value
2546 of the operand, with no other punctuation. */
2551 if (flag_print_asm_name
)
2553 /* Annotate the assembly with a comment describing the pattern and
2554 alternative used. */
2557 register int num
= INSN_CODE (debug_insn
);
2558 fprintf (asm_out_file
, " %s %d %s",
2559 ASM_COMMENT_START
, INSN_UID (debug_insn
), insn_name
[num
]);
2560 if (insn_n_alternatives
[num
] > 1)
2561 fprintf (asm_out_file
, "/%d", which_alternative
+ 1);
2563 /* Clear this so only the first assembler insn
2564 of any rtl insn will get the special comment for -dp. */
2571 output_asm_insn (template, operands
)
2578 /* An insn may return a null string template
2579 in a case where no assembler code is needed. */
2584 putc ('\t', asm_out_file
);
2586 #ifdef ASM_OUTPUT_OPCODE
2587 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
2595 putc (c
, asm_out_file
);
2596 #ifdef ASM_OUTPUT_OPCODE
2597 while ((c
= *p
) == '\t')
2599 putc (c
, asm_out_file
);
2602 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
2606 #ifdef ASSEMBLER_DIALECT
2608 /* If we want the first dialect, do nothing. Otherwise, skip
2609 DIALECT_NUMBER of strings ending with '|'. */
2610 for (i
= 0; i
< dialect_number
; i
++)
2612 while (*p
&& *p
++ != '|')
2621 /* Skip to close brace. */
2622 while (*p
&& *p
++ != '}')
2631 /* %% outputs a single %. */
2635 putc (c
, asm_out_file
);
2637 /* %= outputs a number which is unique to each insn in the entire
2638 compilation. This is useful for making local labels that are
2639 referred to more than once in a given insn. */
2643 fprintf (asm_out_file
, "%d", insn_counter
);
2645 /* % followed by a letter and some digits
2646 outputs an operand in a special way depending on the letter.
2647 Letters `acln' are implemented directly.
2648 Other letters are passed to `output_operand' so that
2649 the PRINT_OPERAND macro can define them. */
2650 else if ((*p
>= 'a' && *p
<= 'z')
2651 || (*p
>= 'A' && *p
<= 'Z'))
2656 if (! (*p
>= '0' && *p
<= '9'))
2657 output_operand_lossage ("operand number missing after %-letter");
2658 else if (this_is_asm_operands
&& c
>= (unsigned) insn_noperands
)
2659 output_operand_lossage ("operand number out of range");
2660 else if (letter
== 'l')
2661 output_asm_label (operands
[c
]);
2662 else if (letter
== 'a')
2663 output_address (operands
[c
]);
2664 else if (letter
== 'c')
2666 if (CONSTANT_ADDRESS_P (operands
[c
]))
2667 output_addr_const (asm_out_file
, operands
[c
]);
2669 output_operand (operands
[c
], 'c');
2671 else if (letter
== 'n')
2673 if (GET_CODE (operands
[c
]) == CONST_INT
)
2674 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
,
2675 - INTVAL (operands
[c
]));
2678 putc ('-', asm_out_file
);
2679 output_addr_const (asm_out_file
, operands
[c
]);
2683 output_operand (operands
[c
], letter
);
2685 while ((c
= *p
) >= '0' && c
<= '9') p
++;
2687 /* % followed by a digit outputs an operand the default way. */
2688 else if (*p
>= '0' && *p
<= '9')
2691 if (this_is_asm_operands
&& c
>= (unsigned) insn_noperands
)
2692 output_operand_lossage ("operand number out of range");
2694 output_operand (operands
[c
], 0);
2695 while ((c
= *p
) >= '0' && c
<= '9') p
++;
2697 /* % followed by punctuation: output something for that
2698 punctuation character alone, with no operand.
2699 The PRINT_OPERAND macro decides what is actually done. */
2700 #ifdef PRINT_OPERAND_PUNCT_VALID_P
2701 else if (PRINT_OPERAND_PUNCT_VALID_P (*p
))
2702 output_operand (NULL_RTX
, *p
++);
2705 output_operand_lossage ("invalid %%-code");
2709 putc (c
, asm_out_file
);
2714 putc ('\n', asm_out_file
);
2717 /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
2720 output_asm_label (x
)
2725 if (GET_CODE (x
) == LABEL_REF
)
2726 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (XEXP (x
, 0)));
2727 else if (GET_CODE (x
) == CODE_LABEL
)
2728 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
2730 output_operand_lossage ("`%l' operand isn't a label");
2732 assemble_name (asm_out_file
, buf
);
2735 /* Print operand X using machine-dependent assembler syntax.
2736 The macro PRINT_OPERAND is defined just to control this function.
2737 CODE is a non-digit that preceded the operand-number in the % spec,
2738 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
2739 between the % and the digits.
2740 When CODE is a non-letter, X is 0.
2742 The meanings of the letters are machine-dependent and controlled
2743 by PRINT_OPERAND. */
2746 output_operand (x
, code
)
2750 if (x
&& GET_CODE (x
) == SUBREG
)
2751 x
= alter_subreg (x
);
2753 /* If X is a pseudo-register, abort now rather than writing trash to the
2756 if (x
&& GET_CODE (x
) == REG
&& REGNO (x
) >= FIRST_PSEUDO_REGISTER
)
2759 PRINT_OPERAND (asm_out_file
, x
, code
);
2762 /* Print a memory reference operand for address X
2763 using machine-dependent assembler syntax.
2764 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
2770 walk_alter_subreg (x
);
2771 PRINT_OPERAND_ADDRESS (asm_out_file
, x
);
2774 /* Print an integer constant expression in assembler syntax.
2775 Addition and subtraction are the only arithmetic
2776 that may appear in these expressions. */
2779 output_addr_const (file
, x
)
2786 switch (GET_CODE (x
))
2796 assemble_name (file
, XSTR (x
, 0));
2800 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (XEXP (x
, 0)));
2801 assemble_name (file
, buf
);
2805 ASM_GENERATE_INTERNAL_LABEL (buf
, "L", CODE_LABEL_NUMBER (x
));
2806 assemble_name (file
, buf
);
2810 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, INTVAL (x
));
2814 /* This used to output parentheses around the expression,
2815 but that does not work on the 386 (either ATT or BSD assembler). */
2816 output_addr_const (file
, XEXP (x
, 0));
2820 if (GET_MODE (x
) == VOIDmode
)
2822 /* We can use %d if the number is one word and positive. */
2823 if (CONST_DOUBLE_HIGH (x
))
2824 fprintf (file
, HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
2825 CONST_DOUBLE_HIGH (x
), CONST_DOUBLE_LOW (x
));
2826 else if (CONST_DOUBLE_LOW (x
) < 0)
2827 fprintf (file
, HOST_WIDE_INT_PRINT_HEX
, CONST_DOUBLE_LOW (x
));
2829 fprintf (file
, HOST_WIDE_INT_PRINT_DEC
, CONST_DOUBLE_LOW (x
));
2832 /* We can't handle floating point constants;
2833 PRINT_OPERAND must handle them. */
2834 output_operand_lossage ("floating constant misused");
2838 /* Some assemblers need integer constants to appear last (eg masm). */
2839 if (GET_CODE (XEXP (x
, 0)) == CONST_INT
)
2841 output_addr_const (file
, XEXP (x
, 1));
2842 if (INTVAL (XEXP (x
, 0)) >= 0)
2843 fprintf (file
, "+");
2844 output_addr_const (file
, XEXP (x
, 0));
2848 output_addr_const (file
, XEXP (x
, 0));
2849 if (INTVAL (XEXP (x
, 1)) >= 0)
2850 fprintf (file
, "+");
2851 output_addr_const (file
, XEXP (x
, 1));
2856 /* Avoid outputting things like x-x or x+5-x,
2857 since some assemblers can't handle that. */
2858 x
= simplify_subtraction (x
);
2859 if (GET_CODE (x
) != MINUS
)
2862 output_addr_const (file
, XEXP (x
, 0));
2863 fprintf (file
, "-");
2864 if (GET_CODE (XEXP (x
, 1)) == CONST_INT
2865 && INTVAL (XEXP (x
, 1)) < 0)
2867 fprintf (file
, ASM_OPEN_PAREN
);
2868 output_addr_const (file
, XEXP (x
, 1));
2869 fprintf (file
, ASM_CLOSE_PAREN
);
2872 output_addr_const (file
, XEXP (x
, 1));
2877 output_addr_const (file
, XEXP (x
, 0));
2881 output_operand_lossage ("invalid expression as operand");
2885 /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
2886 %R prints the value of REGISTER_PREFIX.
2887 %L prints the value of LOCAL_LABEL_PREFIX.
2888 %U prints the value of USER_LABEL_PREFIX.
2889 %I prints the value of IMMEDIATE_PREFIX.
2890 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
2891 Also supported are %d, %x, %s, %e, %f, %g and %%.
2893 We handle alternate assembler dialects here, just like output_asm_insn. */
2896 asm_fprintf
VPROTO((FILE *file
, char *p
, ...))
2907 VA_START (argptr
, p
);
2910 file
= va_arg (argptr
, FILE *);
2911 p
= va_arg (argptr
, char *);
2919 #ifdef ASSEMBLER_DIALECT
2921 /* If we want the first dialect, do nothing. Otherwise, skip
2922 DIALECT_NUMBER of strings ending with '|'. */
2923 for (i
= 0; i
< dialect_number
; i
++)
2925 while (*p
&& *p
++ != '|')
2934 /* Skip to close brace. */
2935 while (*p
&& *p
++ != '}')
2946 while ((c
>= '0' && c
<= '9') || c
== '.')
2954 fprintf (file
, "%%");
2957 case 'd': case 'i': case 'u':
2958 case 'x': case 'p': case 'X':
2962 fprintf (file
, buf
, va_arg (argptr
, int));
2966 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
2967 but we do not check for those cases. It means that the value
2968 is a HOST_WIDE_INT, which may be either `int' or `long'. */
2970 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
2972 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
2982 fprintf (file
, buf
, va_arg (argptr
, HOST_WIDE_INT
));
2989 fprintf (file
, buf
, va_arg (argptr
, long));
2997 fprintf (file
, buf
, va_arg (argptr
, double));
3003 fprintf (file
, buf
, va_arg (argptr
, char *));
3007 #ifdef ASM_OUTPUT_OPCODE
3008 ASM_OUTPUT_OPCODE (asm_out_file
, p
);
3013 #ifdef REGISTER_PREFIX
3014 fprintf (file
, "%s", REGISTER_PREFIX
);
3019 #ifdef IMMEDIATE_PREFIX
3020 fprintf (file
, "%s", IMMEDIATE_PREFIX
);
3025 #ifdef LOCAL_LABEL_PREFIX
3026 fprintf (file
, "%s", LOCAL_LABEL_PREFIX
);
3031 #ifdef USER_LABEL_PREFIX
3032 fprintf (file
, "%s", USER_LABEL_PREFIX
);
3046 /* Split up a CONST_DOUBLE or integer constant rtx
3047 into two rtx's for single words,
3048 storing in *FIRST the word that comes first in memory in the target
3049 and in *SECOND the other. */
3052 split_double (value
, first
, second
)
3054 rtx
*first
, *second
;
3056 if (GET_CODE (value
) == CONST_INT
)
3058 if (HOST_BITS_PER_WIDE_INT
>= (2 * BITS_PER_WORD
))
3060 /* In this case the CONST_INT holds both target words.
3061 Extract the bits from it into two word-sized pieces. */
3063 HOST_WIDE_INT word_mask
;
3064 /* Avoid warnings for shift count >= BITS_PER_WORD. */
3065 int shift_count
= BITS_PER_WORD
- 1;
3067 word_mask
= (HOST_WIDE_INT
) 1 << shift_count
;
3068 word_mask
|= word_mask
- 1;
3069 low
= GEN_INT (INTVAL (value
) & word_mask
);
3070 high
= GEN_INT ((INTVAL (value
) >> (shift_count
+ 1)) & word_mask
);
3071 if (WORDS_BIG_ENDIAN
)
3084 /* The rule for using CONST_INT for a wider mode
3085 is that we regard the value as signed.
3086 So sign-extend it. */
3087 rtx high
= (INTVAL (value
) < 0 ? constm1_rtx
: const0_rtx
);
3088 if (WORDS_BIG_ENDIAN
)
3100 else if (GET_CODE (value
) != CONST_DOUBLE
)
3102 if (WORDS_BIG_ENDIAN
)
3104 *first
= const0_rtx
;
3110 *second
= const0_rtx
;
3113 else if (GET_MODE (value
) == VOIDmode
3114 /* This is the old way we did CONST_DOUBLE integers. */
3115 || GET_MODE_CLASS (GET_MODE (value
)) == MODE_INT
)
3117 /* In an integer, the words are defined as most and least significant.
3118 So order them by the target's convention. */
3119 if (WORDS_BIG_ENDIAN
)
3121 *first
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3122 *second
= GEN_INT (CONST_DOUBLE_LOW (value
));
3126 *first
= GEN_INT (CONST_DOUBLE_LOW (value
));
3127 *second
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3132 #ifdef REAL_ARITHMETIC
3133 REAL_VALUE_TYPE r
; long l
[2];
3134 REAL_VALUE_FROM_CONST_DOUBLE (r
, value
);
3136 /* Note, this converts the REAL_VALUE_TYPE to the target's
3137 format, splits up the floating point double and outputs
3138 exactly 32 bits of it into each of l[0] and l[1] --
3139 not necessarily BITS_PER_WORD bits. */
3140 REAL_VALUE_TO_TARGET_DOUBLE (r
, l
);
3142 *first
= GEN_INT ((HOST_WIDE_INT
) l
[0]);
3143 *second
= GEN_INT ((HOST_WIDE_INT
) l
[1]);
3145 if ((HOST_FLOAT_FORMAT
!= TARGET_FLOAT_FORMAT
3146 || HOST_BITS_PER_WIDE_INT
!= BITS_PER_WORD
)
3147 && ! flag_pretend_float
)
3151 #ifdef HOST_WORDS_BIG_ENDIAN
3158 /* Host and target agree => no need to swap. */
3159 *first
= GEN_INT (CONST_DOUBLE_LOW (value
));
3160 *second
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3164 *second
= GEN_INT (CONST_DOUBLE_LOW (value
));
3165 *first
= GEN_INT (CONST_DOUBLE_HIGH (value
));
3167 #endif /* no REAL_ARITHMETIC */
3171 /* Return nonzero if this function has no function calls. */
3178 if (profile_flag
|| profile_block_flag
|| profile_arc_flag
)
3181 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3183 if (GET_CODE (insn
) == CALL_INSN
)
3185 if (GET_CODE (insn
) == INSN
3186 && GET_CODE (PATTERN (insn
)) == SEQUENCE
3187 && GET_CODE (XVECEXP (PATTERN (insn
), 0, 0)) == CALL_INSN
)
3190 for (insn
= current_function_epilogue_delay_list
; insn
; insn
= XEXP (insn
, 1))
3192 if (GET_CODE (XEXP (insn
, 0)) == CALL_INSN
)
3194 if (GET_CODE (XEXP (insn
, 0)) == INSN
3195 && GET_CODE (PATTERN (XEXP (insn
, 0))) == SEQUENCE
3196 && GET_CODE (XVECEXP (PATTERN (XEXP (insn
, 0)), 0, 0)) == CALL_INSN
)
3203 /* On some machines, a function with no call insns
3204 can run faster if it doesn't create its own register window.
3205 When output, the leaf function should use only the "output"
3206 registers. Ordinarily, the function would be compiled to use
3207 the "input" registers to find its arguments; it is a candidate
3208 for leaf treatment if it uses only the "input" registers.
3209 Leaf function treatment means renumbering so the function
3210 uses the "output" registers instead. */
3212 #ifdef LEAF_REGISTERS
3214 static char permitted_reg_in_leaf_functions
[] = LEAF_REGISTERS
;
3216 /* Return 1 if this function uses only the registers that can be
3217 safely renumbered. */
3220 only_leaf_regs_used ()
3224 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
3226 if ((regs_ever_live
[i
] || global_regs
[i
])
3227 && ! permitted_reg_in_leaf_functions
[i
])
3233 /* Scan all instructions and renumber all registers into those
3234 available in leaf functions. */
3237 leaf_renumber_regs (first
)
3242 /* Renumber only the actual patterns.
3243 The reg-notes can contain frame pointer refs,
3244 and renumbering them could crash, and should not be needed. */
3245 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
3246 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
3247 leaf_renumber_regs_insn (PATTERN (insn
));
3248 for (insn
= current_function_epilogue_delay_list
; insn
; insn
= XEXP (insn
, 1))
3249 if (GET_RTX_CLASS (GET_CODE (XEXP (insn
, 0))) == 'i')
3250 leaf_renumber_regs_insn (PATTERN (XEXP (insn
, 0)));
3253 /* Scan IN_RTX and its subexpressions, and renumber all regs into those
3254 available in leaf functions. */
3257 leaf_renumber_regs_insn (in_rtx
)
3258 register rtx in_rtx
;
3261 register char *format_ptr
;
3266 /* Renumber all input-registers into output-registers.
3267 renumbered_regs would be 1 for an output-register;
3270 if (GET_CODE (in_rtx
) == REG
)
3274 /* Don't renumber the same reg twice. */
3278 newreg
= REGNO (in_rtx
);
3279 /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
3280 to reach here as part of a REG_NOTE. */
3281 if (newreg
>= FIRST_PSEUDO_REGISTER
)
3286 newreg
= LEAF_REG_REMAP (newreg
);
3289 regs_ever_live
[REGNO (in_rtx
)] = 0;
3290 regs_ever_live
[newreg
] = 1;
3291 REGNO (in_rtx
) = newreg
;
3295 if (GET_RTX_CLASS (GET_CODE (in_rtx
)) == 'i')
3297 /* Inside a SEQUENCE, we find insns.
3298 Renumber just the patterns of these insns,
3299 just as we do for the top-level insns. */
3300 leaf_renumber_regs_insn (PATTERN (in_rtx
));
3304 format_ptr
= GET_RTX_FORMAT (GET_CODE (in_rtx
));
3306 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (in_rtx
)); i
++)
3307 switch (*format_ptr
++)
3310 leaf_renumber_regs_insn (XEXP (in_rtx
, i
));
3314 if (NULL
!= XVEC (in_rtx
, i
))
3316 for (j
= 0; j
< XVECLEN (in_rtx
, i
); j
++)
3317 leaf_renumber_regs_insn (XVECEXP (in_rtx
, i
, j
));