]>
Commit | Line | Data |
---|---|---|
3cf2715d | 1 | /* Convert RTL to assembler code and output it, for GNU compiler. |
e5e809f4 | 2 | Copyright (C) 1987, 88, 89, 92-97, 1998 Free Software Foundation, Inc. |
3cf2715d DE |
3 | |
4 | This file is part of GNU CC. | |
5 | ||
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) | |
9 | any later version. | |
10 | ||
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. | |
15 | ||
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 | |
940d9d63 RK |
18 | the Free Software Foundation, 59 Temple Place - Suite 330, |
19 | Boston, MA 02111-1307, USA. */ | |
3cf2715d DE |
20 | |
21 | ||
22 | /* This is the final pass of the compiler. | |
23 | It looks at the rtl code for a function and outputs assembler code. | |
24 | ||
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'. | |
30 | ||
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.) | |
35 | ||
36 | Instructions to set the condition codes are omitted when it can be | |
37 | seen that the condition codes already had the desired values. | |
38 | ||
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. | |
42 | ||
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. */ | |
46 | ||
47 | #include "config.h" | |
670ee920 | 48 | #include "system.h" |
3cf2715d DE |
49 | |
50 | #include "tree.h" | |
51 | #include "rtl.h" | |
52 | #include "regs.h" | |
53 | #include "insn-config.h" | |
54 | #include "insn-flags.h" | |
55 | #include "insn-attr.h" | |
56 | #include "insn-codes.h" | |
57 | #include "recog.h" | |
58 | #include "conditions.h" | |
59 | #include "flags.h" | |
60 | #include "real.h" | |
61 | #include "hard-reg-set.h" | |
62 | #include "defaults.h" | |
63 | #include "output.h" | |
3d195391 | 64 | #include "except.h" |
10f0ad3d | 65 | #include "toplev.h" |
d6f4ec51 | 66 | #include "reload.h" |
3cf2715d DE |
67 | |
68 | /* Get N_SLINE and N_SOL from stab.h if we can expect the file to exist. */ | |
69 | #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO) | |
76ead72b | 70 | #include "dbxout.h" |
c7391272 | 71 | #if defined (USG) || !defined (HAVE_STAB_H) |
3cf2715d DE |
72 | #include "gstab.h" /* If doing DBX on sysV, use our own stab.h. */ |
73 | #else | |
9ec36da5 JL |
74 | #include <stab.h> |
75 | #endif | |
76 | ||
3cf2715d DE |
77 | #endif /* DBX_DEBUGGING_INFO || XCOFF_DEBUGGING_INFO */ |
78 | ||
79 | #ifdef XCOFF_DEBUGGING_INFO | |
80 | #include "xcoffout.h" | |
81 | #endif | |
82 | ||
76ead72b RL |
83 | #ifdef DWARF_DEBUGGING_INFO |
84 | #include "dwarfout.h" | |
85 | #endif | |
86 | ||
87 | #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO) | |
88 | #include "dwarf2out.h" | |
89 | #endif | |
90 | ||
91 | #ifdef SDB_DEBUGGING_INFO | |
92 | #include "sdbout.h" | |
93 | #endif | |
94 | ||
3cf2715d DE |
95 | /* .stabd code for line number. */ |
96 | #ifndef N_SLINE | |
97 | #define N_SLINE 0x44 | |
98 | #endif | |
99 | ||
100 | /* .stabs code for included file name. */ | |
101 | #ifndef N_SOL | |
102 | #define N_SOL 0x84 | |
103 | #endif | |
104 | ||
105 | #ifndef INT_TYPE_SIZE | |
106 | #define INT_TYPE_SIZE BITS_PER_WORD | |
107 | #endif | |
108 | ||
9e2f9a7f DE |
109 | #ifndef LONG_TYPE_SIZE |
110 | #define LONG_TYPE_SIZE BITS_PER_WORD | |
111 | #endif | |
112 | ||
3cf2715d DE |
113 | /* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a |
114 | null default for it to save conditionalization later. */ | |
115 | #ifndef CC_STATUS_INIT | |
116 | #define CC_STATUS_INIT | |
117 | #endif | |
118 | ||
119 | /* How to start an assembler comment. */ | |
120 | #ifndef ASM_COMMENT_START | |
121 | #define ASM_COMMENT_START ";#" | |
122 | #endif | |
123 | ||
124 | /* Is the given character a logical line separator for the assembler? */ | |
125 | #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR | |
126 | #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == ';') | |
127 | #endif | |
128 | ||
75197b37 BS |
129 | #ifndef JUMP_TABLES_IN_TEXT_SECTION |
130 | #define JUMP_TABLES_IN_TEXT_SECTION 0 | |
131 | #endif | |
132 | ||
3cf2715d DE |
133 | /* Nonzero means this function is a leaf function, with no function calls. |
134 | This variable exists to be examined in FUNCTION_PROLOGUE | |
135 | and FUNCTION_EPILOGUE. Always zero, unless set by some action. */ | |
136 | int leaf_function; | |
137 | ||
138 | /* Last insn processed by final_scan_insn. */ | |
139 | static rtx debug_insn = 0; | |
140 | ||
141 | /* Line number of last NOTE. */ | |
142 | static int last_linenum; | |
143 | ||
eac40081 RK |
144 | /* Highest line number in current block. */ |
145 | static int high_block_linenum; | |
146 | ||
147 | /* Likewise for function. */ | |
148 | static int high_function_linenum; | |
149 | ||
3cf2715d DE |
150 | /* Filename of last NOTE. */ |
151 | static char *last_filename; | |
152 | ||
153 | /* Number of basic blocks seen so far; | |
154 | used if profile_block_flag is set. */ | |
155 | static int count_basic_blocks; | |
156 | ||
9e2f9a7f DE |
157 | /* Number of instrumented arcs when profile_arc_flag is set. */ |
158 | extern int count_instrumented_arcs; | |
159 | ||
fc470718 R |
160 | extern int length_unit_log; /* This is defined in insn-attrtab.c. */ |
161 | ||
3cf2715d DE |
162 | /* Nonzero while outputting an `asm' with operands. |
163 | This means that inconsistencies are the user's fault, so don't abort. | |
164 | The precise value is the insn being output, to pass to error_for_asm. */ | |
165 | static rtx this_is_asm_operands; | |
166 | ||
167 | /* Number of operands of this insn, for an `asm' with operands. */ | |
22bf4422 | 168 | static unsigned int insn_noperands; |
3cf2715d DE |
169 | |
170 | /* Compare optimization flag. */ | |
171 | ||
172 | static rtx last_ignored_compare = 0; | |
173 | ||
174 | /* Flag indicating this insn is the start of a new basic block. */ | |
175 | ||
176 | static int new_block = 1; | |
177 | ||
178 | /* All the symbol-blocks (levels of scoping) in the compilation | |
179 | are assigned sequence numbers in order of appearance of the | |
180 | beginnings of the symbol-blocks. Both final and dbxout do this, | |
181 | and assume that they will both give the same number to each block. | |
182 | Final uses these sequence numbers to generate assembler label names | |
183 | LBBnnn and LBEnnn for the beginning and end of the symbol-block. | |
184 | Dbxout uses the sequence numbers to generate references to the same labels | |
185 | from the dbx debugging information. | |
186 | ||
187 | Sdb records this level at the beginning of each function, | |
188 | in order to find the current level when recursing down declarations. | |
189 | It outputs the block beginning and endings | |
190 | at the point in the asm file where the blocks would begin and end. */ | |
191 | ||
192 | int next_block_index; | |
193 | ||
194 | /* Assign a unique number to each insn that is output. | |
195 | This can be used to generate unique local labels. */ | |
196 | ||
197 | static int insn_counter = 0; | |
198 | ||
199 | #ifdef HAVE_cc0 | |
200 | /* This variable contains machine-dependent flags (defined in tm.h) | |
201 | set and examined by output routines | |
202 | that describe how to interpret the condition codes properly. */ | |
203 | ||
204 | CC_STATUS cc_status; | |
205 | ||
206 | /* During output of an insn, this contains a copy of cc_status | |
207 | from before the insn. */ | |
208 | ||
209 | CC_STATUS cc_prev_status; | |
210 | #endif | |
211 | ||
212 | /* Indexed by hardware reg number, is 1 if that register is ever | |
213 | used in the current function. | |
214 | ||
215 | In life_analysis, or in stupid_life_analysis, this is set | |
216 | up to record the hard regs used explicitly. Reload adds | |
217 | in the hard regs used for holding pseudo regs. Final uses | |
218 | it to generate the code in the function prologue and epilogue | |
219 | to save and restore registers as needed. */ | |
220 | ||
221 | char regs_ever_live[FIRST_PSEUDO_REGISTER]; | |
222 | ||
223 | /* Nonzero means current function must be given a frame pointer. | |
224 | Set in stmt.c if anything is allocated on the stack there. | |
225 | Set in reload1.c if anything is allocated on the stack there. */ | |
226 | ||
227 | int frame_pointer_needed; | |
228 | ||
229 | /* Assign unique numbers to labels generated for profiling. */ | |
230 | ||
231 | int profile_label_no; | |
232 | ||
233 | /* Length so far allocated in PENDING_BLOCKS. */ | |
234 | ||
235 | static int max_block_depth; | |
236 | ||
237 | /* Stack of sequence numbers of symbol-blocks of which we have seen the | |
238 | beginning but not yet the end. Sequence numbers are assigned at | |
239 | the beginning; this stack allows us to find the sequence number | |
240 | of a block that is ending. */ | |
241 | ||
242 | static int *pending_blocks; | |
243 | ||
244 | /* Number of elements currently in use in PENDING_BLOCKS. */ | |
245 | ||
246 | static int block_depth; | |
247 | ||
248 | /* Nonzero if have enabled APP processing of our assembler output. */ | |
249 | ||
250 | static int app_on; | |
251 | ||
252 | /* If we are outputting an insn sequence, this contains the sequence rtx. | |
253 | Zero otherwise. */ | |
254 | ||
255 | rtx final_sequence; | |
256 | ||
257 | #ifdef ASSEMBLER_DIALECT | |
258 | ||
259 | /* Number of the assembler dialect to use, starting at 0. */ | |
260 | static int dialect_number; | |
261 | #endif | |
262 | ||
263 | /* Indexed by line number, nonzero if there is a note for that line. */ | |
264 | ||
265 | static char *line_note_exists; | |
266 | ||
267 | /* Linked list to hold line numbers for each basic block. */ | |
268 | ||
269 | struct bb_list { | |
270 | struct bb_list *next; /* pointer to next basic block */ | |
271 | int line_num; /* line number */ | |
272 | int file_label_num; /* LPBC<n> label # for stored filename */ | |
273 | int func_label_num; /* LPBC<n> label # for stored function name */ | |
274 | }; | |
275 | ||
276 | static struct bb_list *bb_head = 0; /* Head of basic block list */ | |
277 | static struct bb_list **bb_tail = &bb_head; /* Ptr to store next bb ptr */ | |
278 | static int bb_file_label_num = -1; /* Current label # for file */ | |
279 | static int bb_func_label_num = -1; /* Current label # for func */ | |
280 | ||
281 | /* Linked list to hold the strings for each file and function name output. */ | |
282 | ||
283 | struct bb_str { | |
284 | struct bb_str *next; /* pointer to next string */ | |
285 | char *string; /* string */ | |
286 | int label_num; /* label number */ | |
287 | int length; /* string length */ | |
288 | }; | |
289 | ||
290 | extern rtx peephole PROTO((rtx)); | |
291 | ||
292 | static struct bb_str *sbb_head = 0; /* Head of string list. */ | |
293 | static struct bb_str **sbb_tail = &sbb_head; /* Ptr to store next bb str */ | |
294 | static int sbb_label_num = 0; /* Last label used */ | |
295 | ||
1d300e19 | 296 | #ifdef HAVE_ATTR_length |
3cf2715d | 297 | static int asm_insn_count PROTO((rtx)); |
1d300e19 | 298 | #endif |
3cf2715d DE |
299 | static void profile_function PROTO((FILE *)); |
300 | static void profile_after_prologue PROTO((FILE *)); | |
301 | static void add_bb PROTO((FILE *)); | |
302 | static int add_bb_string PROTO((char *, int)); | |
303 | static void output_source_line PROTO((FILE *, rtx)); | |
304 | static rtx walk_alter_subreg PROTO((rtx)); | |
cb649530 | 305 | static void output_asm_name PROTO((void)); |
3cf2715d | 306 | static void output_operand PROTO((rtx, int)); |
e9a25f70 | 307 | #ifdef LEAF_REGISTERS |
3cf2715d | 308 | static void leaf_renumber_regs PROTO((rtx)); |
e9a25f70 JL |
309 | #endif |
310 | #ifdef HAVE_cc0 | |
311 | static int alter_cond PROTO((rtx)); | |
312 | #endif | |
1ba298e5 JW |
313 | |
314 | extern char *getpwd (); | |
3cf2715d DE |
315 | \f |
316 | /* Initialize data in final at the beginning of a compilation. */ | |
317 | ||
318 | void | |
319 | init_final (filename) | |
320 | char *filename; | |
321 | { | |
322 | next_block_index = 2; | |
323 | app_on = 0; | |
324 | max_block_depth = 20; | |
325 | pending_blocks = (int *) xmalloc (20 * sizeof *pending_blocks); | |
326 | final_sequence = 0; | |
327 | ||
328 | #ifdef ASSEMBLER_DIALECT | |
329 | dialect_number = ASSEMBLER_DIALECT; | |
330 | #endif | |
331 | } | |
332 | ||
333 | /* Called at end of source file, | |
334 | to output the block-profiling table for this entire compilation. */ | |
335 | ||
336 | void | |
337 | end_final (filename) | |
338 | char *filename; | |
339 | { | |
340 | int i; | |
341 | ||
9e2f9a7f | 342 | if (profile_block_flag || profile_arc_flag) |
3cf2715d DE |
343 | { |
344 | char name[20]; | |
345 | int align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT); | |
9e2f9a7f | 346 | int size, rounded; |
3cf2715d DE |
347 | struct bb_list *ptr; |
348 | struct bb_str *sptr; | |
9e2f9a7f DE |
349 | int long_bytes = LONG_TYPE_SIZE / BITS_PER_UNIT; |
350 | int pointer_bytes = POINTER_SIZE / BITS_PER_UNIT; | |
351 | ||
352 | if (profile_block_flag) | |
353 | size = long_bytes * count_basic_blocks; | |
354 | else | |
355 | size = long_bytes * count_instrumented_arcs; | |
356 | rounded = size; | |
3cf2715d DE |
357 | |
358 | rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1; | |
359 | rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT) | |
360 | * (BIGGEST_ALIGNMENT / BITS_PER_UNIT)); | |
361 | ||
362 | data_section (); | |
363 | ||
47431dff RK |
364 | /* Output the main header, of 11 words: |
365 | 0: 1 if this file is initialized, else 0. | |
3cf2715d DE |
366 | 1: address of file name (LPBX1). |
367 | 2: address of table of counts (LPBX2). | |
368 | 3: number of counts in the table. | |
369 | 4: always 0, for compatibility with Sun. | |
370 | ||
371 | The following are GNU extensions: | |
372 | ||
373 | 5: address of table of start addrs of basic blocks (LPBX3). | |
374 | 6: Number of bytes in this header. | |
375 | 7: address of table of function names (LPBX4). | |
376 | 8: address of table of line numbers (LPBX5) or 0. | |
47431dff | 377 | 9: address of table of file names (LPBX6) or 0. |
0f41302f | 378 | 10: space reserved for basic block profiling. */ |
3cf2715d DE |
379 | |
380 | ASM_OUTPUT_ALIGN (asm_out_file, align); | |
381 | ||
382 | ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 0); | |
383 | /* zero word */ | |
9e2f9a7f | 384 | assemble_integer (const0_rtx, long_bytes, 1); |
3cf2715d DE |
385 | |
386 | /* address of filename */ | |
387 | ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 1); | |
38a448ca | 388 | assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1); |
3cf2715d DE |
389 | |
390 | /* address of count table */ | |
391 | ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2); | |
38a448ca | 392 | assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1); |
3cf2715d | 393 | |
9e2f9a7f DE |
394 | /* count of the # of basic blocks or # of instrumented arcs */ |
395 | if (profile_block_flag) | |
396 | assemble_integer (GEN_INT (count_basic_blocks), long_bytes, 1); | |
397 | else | |
398 | assemble_integer (GEN_INT (count_instrumented_arcs), long_bytes, | |
399 | 1); | |
3cf2715d DE |
400 | |
401 | /* zero word (link field) */ | |
9e2f9a7f | 402 | assemble_integer (const0_rtx, pointer_bytes, 1); |
3cf2715d DE |
403 | |
404 | /* address of basic block start address table */ | |
9e2f9a7f DE |
405 | if (profile_block_flag) |
406 | { | |
407 | ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3); | |
38a448ca | 408 | assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, |
9e2f9a7f DE |
409 | 1); |
410 | } | |
411 | else | |
412 | assemble_integer (const0_rtx, pointer_bytes, 1); | |
3cf2715d DE |
413 | |
414 | /* byte count for extended structure. */ | |
9e2f9a7f | 415 | assemble_integer (GEN_INT (10 * UNITS_PER_WORD), long_bytes, 1); |
3cf2715d DE |
416 | |
417 | /* address of function name table */ | |
9e2f9a7f DE |
418 | if (profile_block_flag) |
419 | { | |
420 | ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 4); | |
38a448ca | 421 | assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, |
9e2f9a7f DE |
422 | 1); |
423 | } | |
424 | else | |
425 | assemble_integer (const0_rtx, pointer_bytes, 1); | |
3cf2715d DE |
426 | |
427 | /* address of line number and filename tables if debugging. */ | |
9e2f9a7f | 428 | if (write_symbols != NO_DEBUG && profile_block_flag) |
3cf2715d DE |
429 | { |
430 | ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 5); | |
38a448ca | 431 | assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1); |
3cf2715d | 432 | ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 6); |
38a448ca | 433 | assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, 1); |
3cf2715d DE |
434 | } |
435 | else | |
436 | { | |
9e2f9a7f DE |
437 | assemble_integer (const0_rtx, pointer_bytes, 1); |
438 | assemble_integer (const0_rtx, pointer_bytes, 1); | |
3cf2715d DE |
439 | } |
440 | ||
47431dff RK |
441 | /* space for extension ptr (link field) */ |
442 | assemble_integer (const0_rtx, UNITS_PER_WORD, 1); | |
443 | ||
3cf2715d DE |
444 | /* Output the file name changing the suffix to .d for Sun tcov |
445 | compatibility. */ | |
446 | ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 1); | |
447 | { | |
67e23d2f JW |
448 | char *cwd = getpwd (); |
449 | int len = strlen (filename) + strlen (cwd) + 1; | |
450 | char *data_file = (char *) alloca (len + 4); | |
451 | ||
452 | strcpy (data_file, cwd); | |
453 | strcat (data_file, "/"); | |
454 | strcat (data_file, filename); | |
3cf2715d | 455 | strip_off_ending (data_file, len); |
9e2f9a7f DE |
456 | if (profile_block_flag) |
457 | strcat (data_file, ".d"); | |
458 | else | |
459 | strcat (data_file, ".da"); | |
3cf2715d DE |
460 | assemble_string (data_file, strlen (data_file) + 1); |
461 | } | |
462 | ||
463 | /* Make space for the table of counts. */ | |
2786cbad | 464 | if (size == 0) |
3cf2715d DE |
465 | { |
466 | /* Realign data section. */ | |
467 | ASM_OUTPUT_ALIGN (asm_out_file, align); | |
468 | ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 2); | |
469 | if (size != 0) | |
470 | assemble_zeros (size); | |
471 | } | |
472 | else | |
473 | { | |
474 | ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2); | |
475 | #ifdef ASM_OUTPUT_SHARED_LOCAL | |
476 | if (flag_shared_data) | |
477 | ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded); | |
478 | else | |
479 | #endif | |
e9a25f70 JL |
480 | #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL |
481 | ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size, | |
482 | BIGGEST_ALIGNMENT); | |
483 | #else | |
3cf2715d DE |
484 | #ifdef ASM_OUTPUT_ALIGNED_LOCAL |
485 | ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, | |
486 | BIGGEST_ALIGNMENT); | |
487 | #else | |
488 | ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded); | |
e9a25f70 | 489 | #endif |
3cf2715d DE |
490 | #endif |
491 | } | |
492 | ||
493 | /* Output any basic block strings */ | |
9e2f9a7f | 494 | if (profile_block_flag) |
3cf2715d | 495 | { |
9e2f9a7f DE |
496 | readonly_data_section (); |
497 | if (sbb_head) | |
3cf2715d | 498 | { |
9e2f9a7f DE |
499 | ASM_OUTPUT_ALIGN (asm_out_file, align); |
500 | for (sptr = sbb_head; sptr != 0; sptr = sptr->next) | |
501 | { | |
502 | ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBC", | |
503 | sptr->label_num); | |
504 | assemble_string (sptr->string, sptr->length); | |
505 | } | |
3cf2715d DE |
506 | } |
507 | } | |
508 | ||
509 | /* Output the table of addresses. */ | |
9e2f9a7f | 510 | if (profile_block_flag) |
3cf2715d | 511 | { |
9e2f9a7f DE |
512 | /* Realign in new section */ |
513 | ASM_OUTPUT_ALIGN (asm_out_file, align); | |
514 | ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 3); | |
515 | for (i = 0; i < count_basic_blocks; i++) | |
516 | { | |
517 | ASM_GENERATE_INTERNAL_LABEL (name, "LPB", i); | |
38a448ca | 518 | assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), |
9e2f9a7f DE |
519 | pointer_bytes, 1); |
520 | } | |
3cf2715d DE |
521 | } |
522 | ||
523 | /* Output the table of function names. */ | |
9e2f9a7f | 524 | if (profile_block_flag) |
3cf2715d | 525 | { |
9e2f9a7f DE |
526 | ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 4); |
527 | for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++) | |
3cf2715d | 528 | { |
9e2f9a7f DE |
529 | if (ptr->func_label_num >= 0) |
530 | { | |
531 | ASM_GENERATE_INTERNAL_LABEL (name, "LPBC", | |
532 | ptr->func_label_num); | |
38a448ca | 533 | assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), |
9e2f9a7f DE |
534 | pointer_bytes, 1); |
535 | } | |
536 | else | |
537 | assemble_integer (const0_rtx, pointer_bytes, 1); | |
3cf2715d | 538 | } |
3cf2715d | 539 | |
9e2f9a7f DE |
540 | for ( ; i < count_basic_blocks; i++) |
541 | assemble_integer (const0_rtx, pointer_bytes, 1); | |
542 | } | |
3cf2715d | 543 | |
9e2f9a7f | 544 | if (write_symbols != NO_DEBUG && profile_block_flag) |
3cf2715d DE |
545 | { |
546 | /* Output the table of line numbers. */ | |
547 | ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 5); | |
548 | for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++) | |
9e2f9a7f | 549 | assemble_integer (GEN_INT (ptr->line_num), long_bytes, 1); |
3cf2715d DE |
550 | |
551 | for ( ; i < count_basic_blocks; i++) | |
9e2f9a7f | 552 | assemble_integer (const0_rtx, long_bytes, 1); |
3cf2715d DE |
553 | |
554 | /* Output the table of file names. */ | |
555 | ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LPBX", 6); | |
556 | for ((ptr = bb_head), (i = 0); ptr != 0; (ptr = ptr->next), i++) | |
557 | { | |
558 | if (ptr->file_label_num >= 0) | |
559 | { | |
9e2f9a7f DE |
560 | ASM_GENERATE_INTERNAL_LABEL (name, "LPBC", |
561 | ptr->file_label_num); | |
38a448ca | 562 | assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), |
9e2f9a7f | 563 | pointer_bytes, 1); |
3cf2715d DE |
564 | } |
565 | else | |
9e2f9a7f | 566 | assemble_integer (const0_rtx, pointer_bytes, 1); |
3cf2715d DE |
567 | } |
568 | ||
569 | for ( ; i < count_basic_blocks; i++) | |
9e2f9a7f | 570 | assemble_integer (const0_rtx, pointer_bytes, 1); |
3cf2715d DE |
571 | } |
572 | ||
573 | /* End with the address of the table of addresses, | |
574 | so we can find it easily, as the last word in the file's text. */ | |
9e2f9a7f DE |
575 | if (profile_block_flag) |
576 | { | |
577 | ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 3); | |
38a448ca | 578 | assemble_integer (gen_rtx_SYMBOL_REF (Pmode, name), pointer_bytes, |
9e2f9a7f DE |
579 | 1); |
580 | } | |
3cf2715d DE |
581 | } |
582 | } | |
583 | ||
584 | /* Enable APP processing of subsequent output. | |
585 | Used before the output from an `asm' statement. */ | |
586 | ||
587 | void | |
588 | app_enable () | |
589 | { | |
590 | if (! app_on) | |
591 | { | |
51723711 | 592 | fputs (ASM_APP_ON, asm_out_file); |
3cf2715d DE |
593 | app_on = 1; |
594 | } | |
595 | } | |
596 | ||
597 | /* Disable APP processing of subsequent output. | |
598 | Called from varasm.c before most kinds of output. */ | |
599 | ||
600 | void | |
601 | app_disable () | |
602 | { | |
603 | if (app_on) | |
604 | { | |
51723711 | 605 | fputs (ASM_APP_OFF, asm_out_file); |
3cf2715d DE |
606 | app_on = 0; |
607 | } | |
608 | } | |
609 | \f | |
610 | /* Return the number of slots filled in the current | |
611 | delayed branch sequence (we don't count the insn needing the | |
612 | delay slot). Zero if not in a delayed branch sequence. */ | |
613 | ||
614 | #ifdef DELAY_SLOTS | |
615 | int | |
616 | dbr_sequence_length () | |
617 | { | |
618 | if (final_sequence != 0) | |
619 | return XVECLEN (final_sequence, 0) - 1; | |
620 | else | |
621 | return 0; | |
622 | } | |
623 | #endif | |
624 | \f | |
625 | /* The next two pages contain routines used to compute the length of an insn | |
626 | and to shorten branches. */ | |
627 | ||
628 | /* Arrays for insn lengths, and addresses. The latter is referenced by | |
629 | `insn_current_length'. */ | |
630 | ||
631 | static short *insn_lengths; | |
632 | int *insn_addresses; | |
633 | ||
634 | /* Address of insn being processed. Used by `insn_current_length'. */ | |
635 | int insn_current_address; | |
636 | ||
fc470718 R |
637 | /* Address of insn being processed in previous iteration. */ |
638 | int insn_last_address; | |
639 | ||
640 | /* konwn invariant alignment of insn being processed. */ | |
641 | int insn_current_align; | |
642 | ||
95707627 R |
643 | /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)] |
644 | gives the next following alignment insn that increases the known | |
645 | alignment, or NULL_RTX if there is no such insn. | |
646 | For any alignment obtained this way, we can again index uid_align with | |
647 | its uid to obtain the next following align that in turn increases the | |
648 | alignment, till we reach NULL_RTX; the sequence obtained this way | |
649 | for each insn we'll call the alignment chain of this insn in the following | |
650 | comments. */ | |
651 | ||
9e423e6d JW |
652 | struct label_alignment { |
653 | short alignment; | |
654 | short max_skip; | |
655 | }; | |
656 | ||
657 | static rtx *uid_align; | |
658 | static int *uid_shuid; | |
659 | static struct label_alignment *label_align; | |
95707627 | 660 | |
3cf2715d DE |
661 | /* Indicate that branch shortening hasn't yet been done. */ |
662 | ||
663 | void | |
664 | init_insn_lengths () | |
665 | { | |
95707627 R |
666 | if (label_align) |
667 | { | |
668 | free (label_align); | |
669 | label_align = 0; | |
670 | } | |
671 | if (uid_shuid) | |
672 | { | |
673 | free (uid_shuid); | |
674 | uid_shuid = 0; | |
675 | } | |
676 | if (insn_lengths) | |
677 | { | |
678 | free (insn_lengths); | |
679 | insn_lengths = 0; | |
680 | } | |
681 | if (insn_addresses) | |
682 | { | |
683 | free (insn_addresses); | |
684 | insn_addresses = 0; | |
685 | } | |
686 | if (uid_align) | |
687 | { | |
688 | free (uid_align); | |
689 | uid_align = 0; | |
690 | } | |
3cf2715d DE |
691 | } |
692 | ||
693 | /* Obtain the current length of an insn. If branch shortening has been done, | |
694 | get its actual length. Otherwise, get its maximum length. */ | |
695 | ||
696 | int | |
697 | get_attr_length (insn) | |
698 | rtx insn; | |
699 | { | |
700 | #ifdef HAVE_ATTR_length | |
701 | rtx body; | |
702 | int i; | |
703 | int length = 0; | |
704 | ||
705 | if (insn_lengths) | |
706 | return insn_lengths[INSN_UID (insn)]; | |
707 | else | |
708 | switch (GET_CODE (insn)) | |
709 | { | |
710 | case NOTE: | |
711 | case BARRIER: | |
712 | case CODE_LABEL: | |
713 | return 0; | |
714 | ||
715 | case CALL_INSN: | |
716 | length = insn_default_length (insn); | |
717 | break; | |
718 | ||
719 | case JUMP_INSN: | |
720 | body = PATTERN (insn); | |
721 | if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC) | |
722 | { | |
fc470718 R |
723 | /* Alignment is machine-dependent and should be handled by |
724 | ADDR_VEC_ALIGN. */ | |
3cf2715d DE |
725 | } |
726 | else | |
727 | length = insn_default_length (insn); | |
728 | break; | |
729 | ||
730 | case INSN: | |
731 | body = PATTERN (insn); | |
732 | if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER) | |
733 | return 0; | |
734 | ||
735 | else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0) | |
736 | length = asm_insn_count (body) * insn_default_length (insn); | |
737 | else if (GET_CODE (body) == SEQUENCE) | |
738 | for (i = 0; i < XVECLEN (body, 0); i++) | |
739 | length += get_attr_length (XVECEXP (body, 0, i)); | |
740 | else | |
741 | length = insn_default_length (insn); | |
e9a25f70 JL |
742 | break; |
743 | ||
744 | default: | |
745 | break; | |
3cf2715d DE |
746 | } |
747 | ||
748 | #ifdef ADJUST_INSN_LENGTH | |
749 | ADJUST_INSN_LENGTH (insn, length); | |
750 | #endif | |
751 | return length; | |
752 | #else /* not HAVE_ATTR_length */ | |
753 | return 0; | |
754 | #endif /* not HAVE_ATTR_length */ | |
755 | } | |
756 | \f | |
fc470718 R |
757 | /* Code to handle alignment inside shorten_branches. */ |
758 | ||
759 | /* Here is an explanation how the algorithm in align_fuzz can give | |
760 | proper results: | |
761 | ||
762 | Call a sequence of instructions beginning with alignment point X | |
763 | and continuing until the next alignment point `block X'. When `X' | |
764 | is used in an expression, it means the alignment value of the | |
765 | alignment point. | |
766 | ||
767 | Call the distance between the start of the first insn of block X, and | |
768 | the end of the last insn of block X `IX', for the `inner size of X'. | |
769 | This is clearly the sum of the instruction lengths. | |
770 | ||
771 | Likewise with the next alignment-delimited block following X, which we | |
772 | shall call block Y. | |
773 | ||
774 | Call the distance between the start of the first insn of block X, and | |
775 | the start of the first insn of block Y `OX', for the `outer size of X'. | |
776 | ||
777 | The estimated padding is then OX - IX. | |
778 | ||
779 | OX can be safely estimated as | |
780 | ||
781 | if (X >= Y) | |
782 | OX = round_up(IX, Y) | |
783 | else | |
784 | OX = round_up(IX, X) + Y - X | |
785 | ||
786 | Clearly est(IX) >= real(IX), because that only depends on the | |
787 | instruction lengths, and those being overestimated is a given. | |
788 | ||
789 | Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so | |
790 | we needn't worry about that when thinking about OX. | |
791 | ||
792 | When X >= Y, the alignment provided by Y adds no uncertainty factor | |
793 | for branch ranges starting before X, so we can just round what we have. | |
794 | But when X < Y, we don't know anything about the, so to speak, | |
795 | `middle bits', so we have to assume the worst when aligning up from an | |
796 | address mod X to one mod Y, which is Y - X. */ | |
797 | ||
798 | #ifndef LABEL_ALIGN | |
799 | #define LABEL_ALIGN(LABEL) 0 | |
800 | #endif | |
801 | ||
9e423e6d JW |
802 | #ifndef LABEL_ALIGN_MAX_SKIP |
803 | #define LABEL_ALIGN_MAX_SKIP 0 | |
804 | #endif | |
805 | ||
fc470718 R |
806 | #ifndef LOOP_ALIGN |
807 | #define LOOP_ALIGN(LABEL) 0 | |
808 | #endif | |
809 | ||
9e423e6d JW |
810 | #ifndef LOOP_ALIGN_MAX_SKIP |
811 | #define LOOP_ALIGN_MAX_SKIP 0 | |
812 | #endif | |
813 | ||
fc470718 R |
814 | #ifndef LABEL_ALIGN_AFTER_BARRIER |
815 | #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0 | |
816 | #endif | |
817 | ||
9e423e6d JW |
818 | #ifndef LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP |
819 | #define LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP 0 | |
820 | #endif | |
821 | ||
fc470718 R |
822 | #ifndef ADDR_VEC_ALIGN |
823 | int | |
824 | final_addr_vec_align (addr_vec) | |
825 | rtx addr_vec; | |
826 | { | |
827 | int align = exact_log2 (GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec)))); | |
828 | ||
829 | if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT) | |
830 | align = BIGGEST_ALIGNMENT / BITS_PER_UNIT; | |
831 | return align; | |
832 | ||
833 | } | |
834 | #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC) | |
835 | #endif | |
836 | ||
837 | #ifndef INSN_LENGTH_ALIGNMENT | |
838 | #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log | |
839 | #endif | |
840 | ||
fc470718 R |
841 | #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)]) |
842 | ||
de7987a6 | 843 | static int min_labelno, max_labelno; |
fc470718 R |
844 | |
845 | #define LABEL_TO_ALIGNMENT(LABEL) \ | |
9e423e6d JW |
846 | (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment) |
847 | ||
848 | #define LABEL_TO_MAX_SKIP(LABEL) \ | |
849 | (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip) | |
fc470718 R |
850 | |
851 | /* For the benefit of port specific code do this also as a function. */ | |
852 | int | |
853 | label_to_alignment (label) | |
854 | rtx label; | |
855 | { | |
856 | return LABEL_TO_ALIGNMENT (label); | |
857 | } | |
858 | ||
859 | #ifdef HAVE_ATTR_length | |
860 | /* The differences in addresses | |
861 | between a branch and its target might grow or shrink depending on | |
862 | the alignment the start insn of the range (the branch for a forward | |
863 | branch or the label for a backward branch) starts out on; if these | |
864 | differences are used naively, they can even oscillate infinitely. | |
865 | We therefore want to compute a 'worst case' address difference that | |
866 | is independent of the alignment the start insn of the range end | |
867 | up on, and that is at least as large as the actual difference. | |
868 | The function align_fuzz calculates the amount we have to add to the | |
869 | naively computed difference, by traversing the part of the alignment | |
870 | chain of the start insn of the range that is in front of the end insn | |
871 | of the range, and considering for each alignment the maximum amount | |
872 | that it might contribute to a size increase. | |
873 | ||
874 | For casesi tables, we also want to know worst case minimum amounts of | |
875 | address difference, in case a machine description wants to introduce | |
876 | some common offset that is added to all offsets in a table. | |
877 | For this purpose, align_fuzz with a growth argument of 0 comuptes the | |
878 | appropriate adjustment. */ | |
879 | ||
880 | ||
881 | /* Compute the maximum delta by which the difference of the addresses of | |
882 | START and END might grow / shrink due to a different address for start | |
883 | which changes the size of alignment insns between START and END. | |
884 | KNOWN_ALIGN_LOG is the alignment known for START. | |
885 | GROWTH should be ~0 if the objective is to compute potential code size | |
886 | increase, and 0 if the objective is to compute potential shrink. | |
887 | The return value is undefined for any other value of GROWTH. */ | |
687d0ab6 R |
888 | int |
889 | align_fuzz (start, end, known_align_log, growth) | |
fc470718 R |
890 | rtx start, end; |
891 | int known_align_log; | |
892 | unsigned growth; | |
893 | { | |
894 | int uid = INSN_UID (start); | |
895 | rtx align_label; | |
896 | int known_align = 1 << known_align_log; | |
897 | int end_shuid = INSN_SHUID (end); | |
898 | int fuzz = 0; | |
899 | ||
900 | for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid]) | |
901 | { | |
902 | int align_addr, new_align; | |
903 | ||
904 | uid = INSN_UID (align_label); | |
905 | align_addr = insn_addresses[uid] - insn_lengths[uid]; | |
906 | if (uid_shuid[uid] > end_shuid) | |
907 | break; | |
908 | known_align_log = LABEL_TO_ALIGNMENT (align_label); | |
909 | new_align = 1 << known_align_log; | |
910 | if (new_align < known_align) | |
911 | continue; | |
912 | fuzz += (-align_addr ^ growth) & (new_align - known_align); | |
913 | known_align = new_align; | |
914 | } | |
915 | return fuzz; | |
916 | } | |
917 | ||
918 | /* Compute a worst-case reference address of a branch so that it | |
919 | can be safely used in the presence of aligned labels. Since the | |
920 | size of the branch itself is unknown, the size of the branch is | |
921 | not included in the range. I.e. for a forward branch, the reference | |
922 | address is the end address of the branch as known from the previous | |
923 | branch shortening pass, minus a value to account for possible size | |
924 | increase due to alignment. For a backward branch, it is the start | |
925 | address of the branch as known from the current pass, plus a value | |
926 | to account for possible size increase due to alignment. | |
927 | NB.: Therefore, the maximum offset allowed for backward branches needs | |
928 | to exclude the branch size. */ | |
929 | int | |
930 | insn_current_reference_address (branch) | |
931 | rtx branch; | |
932 | { | |
933 | rtx dest; | |
934 | rtx seq = NEXT_INSN (PREV_INSN (branch)); | |
935 | int seq_uid = INSN_UID (seq); | |
936 | if (GET_CODE (branch) != JUMP_INSN) | |
937 | /* This can happen for example on the PA; the objective is to know the | |
938 | offset to address something in front of the start of the function. | |
939 | Thus, we can treat it like a backward branch. | |
940 | We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than | |
941 | any alignment we'd encounter, so we skip the call to align_fuzz. */ | |
942 | return insn_current_address; | |
943 | dest = JUMP_LABEL (branch); | |
33f7f353 | 944 | /* BRANCH has no proper alignment chain set, so use SEQ. */ |
fc470718 R |
945 | if (INSN_SHUID (branch) < INSN_SHUID (dest)) |
946 | { | |
947 | /* Forward branch. */ | |
948 | return (insn_last_address + insn_lengths[seq_uid] | |
26024475 | 949 | - align_fuzz (seq, dest, length_unit_log, ~0)); |
fc470718 R |
950 | } |
951 | else | |
952 | { | |
953 | /* Backward branch. */ | |
954 | return (insn_current_address | |
923f7cf9 | 955 | + align_fuzz (dest, seq, length_unit_log, ~0)); |
fc470718 R |
956 | } |
957 | } | |
958 | #endif /* HAVE_ATTR_length */ | |
959 | \f | |
3cf2715d DE |
960 | /* Make a pass over all insns and compute their actual lengths by shortening |
961 | any branches of variable length if possible. */ | |
962 | ||
963 | /* Give a default value for the lowest address in a function. */ | |
964 | ||
965 | #ifndef FIRST_INSN_ADDRESS | |
966 | #define FIRST_INSN_ADDRESS 0 | |
967 | #endif | |
968 | ||
fc470718 R |
969 | /* shorten_branches might be called multiple times: for example, the SH |
970 | port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG. | |
971 | In order to do this, it needs proper length information, which it obtains | |
972 | by calling shorten_branches. This cannot be collapsed with | |
973 | shorten_branches itself into a single pass unless we also want to intergate | |
974 | reorg.c, since the branch splitting exposes new instructions with delay | |
975 | slots. */ | |
976 | ||
3cf2715d DE |
977 | void |
978 | shorten_branches (first) | |
979 | rtx first; | |
980 | { | |
3cf2715d | 981 | rtx insn; |
fc470718 R |
982 | int max_uid; |
983 | int i; | |
fc470718 | 984 | int max_log; |
9e423e6d | 985 | int max_skip; |
fc470718 R |
986 | #ifdef HAVE_ATTR_length |
987 | #define MAX_CODE_ALIGN 16 | |
988 | rtx seq; | |
3cf2715d | 989 | int something_changed = 1; |
3cf2715d DE |
990 | char *varying_length; |
991 | rtx body; | |
992 | int uid; | |
fc470718 | 993 | rtx align_tab[MAX_CODE_ALIGN]; |
3cf2715d | 994 | |
3d14e82f JW |
995 | /* In order to make sure that all instructions have valid length info, |
996 | we must split them before we compute the address/length info. */ | |
997 | ||
998 | for (insn = NEXT_INSN (first); insn; insn = NEXT_INSN (insn)) | |
999 | if (GET_RTX_CLASS (GET_CODE (insn)) == 'i') | |
fc470718 R |
1000 | { |
1001 | rtx old = insn; | |
1002 | insn = try_split (PATTERN (old), old, 1); | |
1003 | /* When not optimizing, the old insn will be still left around | |
1004 | with only the 'deleted' bit set. Transform it into a note | |
1005 | to avoid confusion of subsequent processing. */ | |
1006 | if (INSN_DELETED_P (old)) | |
1007 | { | |
1008 | PUT_CODE (old , NOTE); | |
1009 | NOTE_LINE_NUMBER (old) = NOTE_INSN_DELETED; | |
1010 | NOTE_SOURCE_FILE (old) = 0; | |
1011 | } | |
1012 | } | |
1013 | #endif | |
3d14e82f | 1014 | |
fc470718 R |
1015 | /* We must do some computations even when not actually shortening, in |
1016 | order to get the alignment information for the labels. */ | |
1017 | ||
95707627 R |
1018 | init_insn_lengths (); |
1019 | ||
fc470718 R |
1020 | /* Compute maximum UID and allocate label_align / uid_shuid. */ |
1021 | max_uid = get_max_uid (); | |
1022 | ||
1023 | max_labelno = max_label_num (); | |
1024 | min_labelno = get_first_label_num (); | |
9e423e6d JW |
1025 | label_align = (struct label_alignment *) xmalloc ( |
1026 | (max_labelno - min_labelno + 1) * sizeof (struct label_alignment)); | |
296433e1 | 1027 | bzero ((char *) label_align, |
9e423e6d | 1028 | (max_labelno - min_labelno + 1) * sizeof (struct label_alignment)); |
fc470718 | 1029 | |
fc470718 R |
1030 | uid_shuid = (int *) xmalloc (max_uid * sizeof *uid_shuid); |
1031 | ||
1032 | /* Initialize label_align and set up uid_shuid to be strictly | |
1033 | monotonically rising with insn order. */ | |
e2faec75 R |
1034 | /* We use max_log here to keep track of the maximum alignment we want to |
1035 | impose on the next CODE_LABEL (or the current one if we are processing | |
1036 | the CODE_LABEL itself). */ | |
1037 | ||
9e423e6d JW |
1038 | max_log = 0; |
1039 | max_skip = 0; | |
1040 | ||
1041 | for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn)) | |
fc470718 R |
1042 | { |
1043 | int log; | |
1044 | ||
1045 | INSN_SHUID (insn) = i++; | |
1046 | if (GET_RTX_CLASS (GET_CODE (insn)) == 'i') | |
e2faec75 R |
1047 | { |
1048 | /* reorg might make the first insn of a loop being run once only, | |
1049 | and delete the label in front of it. Then we want to apply | |
1050 | the loop alignment to the new label created by reorg, which | |
1051 | is separated by the former loop start insn from the | |
1052 | NOTE_INSN_LOOP_BEG. */ | |
1053 | } | |
fc470718 R |
1054 | else if (GET_CODE (insn) == CODE_LABEL) |
1055 | { | |
1056 | rtx next; | |
1057 | ||
1058 | log = LABEL_ALIGN (insn); | |
1059 | if (max_log < log) | |
9e423e6d JW |
1060 | { |
1061 | max_log = log; | |
1062 | max_skip = LABEL_ALIGN_MAX_SKIP; | |
1063 | } | |
fc470718 | 1064 | next = NEXT_INSN (insn); |
75197b37 BS |
1065 | /* ADDR_VECs only take room if read-only data goes into the text |
1066 | section. */ | |
1067 | if (JUMP_TABLES_IN_TEXT_SECTION | |
1068 | #if !defined(READONLY_DATA_SECTION) | |
1069 | || 1 | |
fc470718 | 1070 | #endif |
75197b37 BS |
1071 | ) |
1072 | if (next && GET_CODE (next) == JUMP_INSN) | |
1073 | { | |
1074 | rtx nextbody = PATTERN (next); | |
1075 | if (GET_CODE (nextbody) == ADDR_VEC | |
1076 | || GET_CODE (nextbody) == ADDR_DIFF_VEC) | |
1077 | { | |
1078 | log = ADDR_VEC_ALIGN (next); | |
1079 | if (max_log < log) | |
1080 | { | |
1081 | max_log = log; | |
1082 | max_skip = LABEL_ALIGN_MAX_SKIP; | |
1083 | } | |
1084 | } | |
1085 | } | |
fc470718 | 1086 | LABEL_TO_ALIGNMENT (insn) = max_log; |
9e423e6d | 1087 | LABEL_TO_MAX_SKIP (insn) = max_skip; |
fc470718 | 1088 | max_log = 0; |
9e423e6d | 1089 | max_skip = 0; |
fc470718 R |
1090 | } |
1091 | else if (GET_CODE (insn) == BARRIER) | |
1092 | { | |
1093 | rtx label; | |
1094 | ||
1095 | for (label = insn; label && GET_RTX_CLASS (GET_CODE (label)) != 'i'; | |
1096 | label = NEXT_INSN (label)) | |
1097 | if (GET_CODE (label) == CODE_LABEL) | |
1098 | { | |
1099 | log = LABEL_ALIGN_AFTER_BARRIER (insn); | |
1100 | if (max_log < log) | |
9e423e6d JW |
1101 | { |
1102 | max_log = log; | |
1103 | max_skip = LABEL_ALIGN_AFTER_BARRIER_MAX_SKIP; | |
1104 | } | |
fc470718 R |
1105 | break; |
1106 | } | |
1107 | } | |
e2faec75 R |
1108 | /* Again, we allow NOTE_INSN_LOOP_BEG - INSN - CODE_LABEL |
1109 | sequences in order to handle reorg output efficiently. */ | |
fc470718 R |
1110 | else if (GET_CODE (insn) == NOTE |
1111 | && NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG) | |
1112 | { | |
1113 | rtx label; | |
1114 | ||
e2faec75 | 1115 | for (label = insn; label; label = NEXT_INSN (label)) |
fc470718 R |
1116 | if (GET_CODE (label) == CODE_LABEL) |
1117 | { | |
1118 | log = LOOP_ALIGN (insn); | |
1119 | if (max_log < log) | |
9e423e6d JW |
1120 | { |
1121 | max_log = log; | |
1122 | max_skip = LOOP_ALIGN_MAX_SKIP; | |
1123 | } | |
fc470718 R |
1124 | break; |
1125 | } | |
1126 | } | |
1127 | else | |
1128 | continue; | |
1129 | } | |
1130 | #ifdef HAVE_ATTR_length | |
1131 | ||
1132 | /* Allocate the rest of the arrays. */ | |
fc470718 | 1133 | insn_lengths = (short *) xmalloc (max_uid * sizeof (short)); |
fc470718 | 1134 | insn_addresses = (int *) xmalloc (max_uid * sizeof (int)); |
af035616 R |
1135 | /* Syntax errors can lead to labels being outside of the main insn stream. |
1136 | Initialize insn_addresses, so that we get reproducible results. */ | |
1137 | bzero ((char *)insn_addresses, max_uid * sizeof *insn_addresses); | |
fc470718 R |
1138 | uid_align = (rtx *) xmalloc (max_uid * sizeof *uid_align); |
1139 | ||
1140 | varying_length = (char *) xmalloc (max_uid * sizeof (char)); | |
1141 | ||
1142 | bzero (varying_length, max_uid); | |
1143 | ||
1144 | /* Initialize uid_align. We scan instructions | |
1145 | from end to start, and keep in align_tab[n] the last seen insn | |
1146 | that does an alignment of at least n+1, i.e. the successor | |
1147 | in the alignment chain for an insn that does / has a known | |
1148 | alignment of n. */ | |
1149 | ||
1150 | bzero ((char *) uid_align, max_uid * sizeof *uid_align); | |
1151 | ||
1152 | for (i = MAX_CODE_ALIGN; --i >= 0; ) | |
1153 | align_tab[i] = NULL_RTX; | |
1154 | seq = get_last_insn (); | |
33f7f353 | 1155 | for (; seq; seq = PREV_INSN (seq)) |
fc470718 R |
1156 | { |
1157 | int uid = INSN_UID (seq); | |
1158 | int log; | |
fc470718 R |
1159 | log = (GET_CODE (seq) == CODE_LABEL ? LABEL_TO_ALIGNMENT (seq) : 0); |
1160 | uid_align[uid] = align_tab[0]; | |
fc470718 R |
1161 | if (log) |
1162 | { | |
1163 | /* Found an alignment label. */ | |
1164 | uid_align[uid] = align_tab[log]; | |
1165 | for (i = log - 1; i >= 0; i--) | |
1166 | align_tab[i] = seq; | |
1167 | } | |
33f7f353 JR |
1168 | } |
1169 | #ifdef CASE_VECTOR_SHORTEN_MODE | |
1170 | if (optimize) | |
1171 | { | |
1172 | /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum | |
1173 | label fields. */ | |
1174 | ||
1175 | int min_shuid = INSN_SHUID (get_insns ()) - 1; | |
1176 | int max_shuid = INSN_SHUID (get_last_insn ()) + 1; | |
1177 | int rel; | |
1178 | ||
1179 | for (insn = first; insn != 0; insn = NEXT_INSN (insn)) | |
fc470718 | 1180 | { |
33f7f353 JR |
1181 | rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat; |
1182 | int len, i, min, max, insn_shuid; | |
1183 | int min_align; | |
1184 | addr_diff_vec_flags flags; | |
1185 | ||
1186 | if (GET_CODE (insn) != JUMP_INSN | |
1187 | || GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC) | |
1188 | continue; | |
1189 | pat = PATTERN (insn); | |
1190 | len = XVECLEN (pat, 1); | |
1191 | if (len <= 0) | |
1192 | abort (); | |
1193 | min_align = MAX_CODE_ALIGN; | |
1194 | for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--) | |
1195 | { | |
1196 | rtx lab = XEXP (XVECEXP (pat, 1, i), 0); | |
1197 | int shuid = INSN_SHUID (lab); | |
1198 | if (shuid < min) | |
1199 | { | |
1200 | min = shuid; | |
1201 | min_lab = lab; | |
1202 | } | |
1203 | if (shuid > max) | |
1204 | { | |
1205 | max = shuid; | |
1206 | max_lab = lab; | |
1207 | } | |
1208 | if (min_align > LABEL_TO_ALIGNMENT (lab)) | |
1209 | min_align = LABEL_TO_ALIGNMENT (lab); | |
1210 | } | |
1211 | XEXP (pat, 2) = gen_rtx_LABEL_REF (VOIDmode, min_lab); | |
1212 | XEXP (pat, 3) = gen_rtx_LABEL_REF (VOIDmode, max_lab); | |
1213 | insn_shuid = INSN_SHUID (insn); | |
1214 | rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0)); | |
1215 | flags.min_align = min_align; | |
1216 | flags.base_after_vec = rel > insn_shuid; | |
1217 | flags.min_after_vec = min > insn_shuid; | |
1218 | flags.max_after_vec = max > insn_shuid; | |
1219 | flags.min_after_base = min > rel; | |
1220 | flags.max_after_base = max > rel; | |
1221 | ADDR_DIFF_VEC_FLAGS (pat) = flags; | |
fc470718 R |
1222 | } |
1223 | } | |
33f7f353 | 1224 | #endif /* CASE_VECTOR_SHORTEN_MODE */ |
3cf2715d | 1225 | |
3cf2715d DE |
1226 | |
1227 | /* Compute initial lengths, addresses, and varying flags for each insn. */ | |
1228 | for (insn_current_address = FIRST_INSN_ADDRESS, insn = first; | |
1229 | insn != 0; | |
1230 | insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn)) | |
1231 | { | |
1232 | uid = INSN_UID (insn); | |
fc470718 | 1233 | |
3cf2715d | 1234 | insn_lengths[uid] = 0; |
fc470718 R |
1235 | |
1236 | if (GET_CODE (insn) == CODE_LABEL) | |
1237 | { | |
1238 | int log = LABEL_TO_ALIGNMENT (insn); | |
1239 | if (log) | |
1240 | { | |
1241 | int align = 1 << log; | |
ecb06768 | 1242 | int new_address = (insn_current_address + align - 1) & -align; |
fc470718 R |
1243 | insn_lengths[uid] = new_address - insn_current_address; |
1244 | insn_current_address = new_address; | |
1245 | } | |
1246 | } | |
1247 | ||
1248 | insn_addresses[uid] = insn_current_address; | |
3cf2715d DE |
1249 | |
1250 | if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER | |
1251 | || GET_CODE (insn) == CODE_LABEL) | |
1252 | continue; | |
04da53bd R |
1253 | if (INSN_DELETED_P (insn)) |
1254 | continue; | |
3cf2715d DE |
1255 | |
1256 | body = PATTERN (insn); | |
1257 | if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC) | |
5a32a90c JR |
1258 | { |
1259 | /* This only takes room if read-only data goes into the text | |
1260 | section. */ | |
75197b37 BS |
1261 | if (JUMP_TABLES_IN_TEXT_SECTION |
1262 | #if !defined(READONLY_DATA_SECTION) | |
1263 | || 1 | |
1264 | #endif | |
1265 | ) | |
1266 | insn_lengths[uid] = (XVECLEN (body, | |
1267 | GET_CODE (body) == ADDR_DIFF_VEC) | |
1268 | * GET_MODE_SIZE (GET_MODE (body))); | |
5a32a90c | 1269 | /* Alignment is handled by ADDR_VEC_ALIGN. */ |
5a32a90c | 1270 | } |
3cf2715d DE |
1271 | else if (asm_noperands (body) >= 0) |
1272 | insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn); | |
1273 | else if (GET_CODE (body) == SEQUENCE) | |
1274 | { | |
1275 | int i; | |
1276 | int const_delay_slots; | |
1277 | #ifdef DELAY_SLOTS | |
1278 | const_delay_slots = const_num_delay_slots (XVECEXP (body, 0, 0)); | |
1279 | #else | |
1280 | const_delay_slots = 0; | |
1281 | #endif | |
1282 | /* Inside a delay slot sequence, we do not do any branch shortening | |
1283 | if the shortening could change the number of delay slots | |
0f41302f | 1284 | of the branch. */ |
3cf2715d DE |
1285 | for (i = 0; i < XVECLEN (body, 0); i++) |
1286 | { | |
1287 | rtx inner_insn = XVECEXP (body, 0, i); | |
1288 | int inner_uid = INSN_UID (inner_insn); | |
1289 | int inner_length; | |
1290 | ||
1291 | if (asm_noperands (PATTERN (XVECEXP (body, 0, i))) >= 0) | |
1292 | inner_length = (asm_insn_count (PATTERN (inner_insn)) | |
1293 | * insn_default_length (inner_insn)); | |
1294 | else | |
1295 | inner_length = insn_default_length (inner_insn); | |
1296 | ||
1297 | insn_lengths[inner_uid] = inner_length; | |
1298 | if (const_delay_slots) | |
1299 | { | |
1300 | if ((varying_length[inner_uid] | |
1301 | = insn_variable_length_p (inner_insn)) != 0) | |
1302 | varying_length[uid] = 1; | |
1303 | insn_addresses[inner_uid] = (insn_current_address + | |
1304 | insn_lengths[uid]); | |
1305 | } | |
1306 | else | |
1307 | varying_length[inner_uid] = 0; | |
1308 | insn_lengths[uid] += inner_length; | |
1309 | } | |
1310 | } | |
1311 | else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER) | |
1312 | { | |
1313 | insn_lengths[uid] = insn_default_length (insn); | |
1314 | varying_length[uid] = insn_variable_length_p (insn); | |
1315 | } | |
1316 | ||
1317 | /* If needed, do any adjustment. */ | |
1318 | #ifdef ADJUST_INSN_LENGTH | |
1319 | ADJUST_INSN_LENGTH (insn, insn_lengths[uid]); | |
1320 | #endif | |
1321 | } | |
1322 | ||
1323 | /* Now loop over all the insns finding varying length insns. For each, | |
1324 | get the current insn length. If it has changed, reflect the change. | |
1325 | When nothing changes for a full pass, we are done. */ | |
1326 | ||
1327 | while (something_changed) | |
1328 | { | |
1329 | something_changed = 0; | |
fc470718 | 1330 | insn_current_align = MAX_CODE_ALIGN - 1; |
3cf2715d DE |
1331 | for (insn_current_address = FIRST_INSN_ADDRESS, insn = first; |
1332 | insn != 0; | |
1333 | insn = NEXT_INSN (insn)) | |
1334 | { | |
1335 | int new_length; | |
b729186a | 1336 | #ifdef ADJUST_INSN_LENGTH |
3cf2715d | 1337 | int tmp_length; |
b729186a | 1338 | #endif |
fc470718 | 1339 | int length_align; |
3cf2715d DE |
1340 | |
1341 | uid = INSN_UID (insn); | |
fc470718 R |
1342 | |
1343 | if (GET_CODE (insn) == CODE_LABEL) | |
1344 | { | |
1345 | int log = LABEL_TO_ALIGNMENT (insn); | |
1346 | if (log > insn_current_align) | |
1347 | { | |
1348 | int align = 1 << log; | |
ecb06768 | 1349 | int new_address= (insn_current_address + align - 1) & -align; |
fc470718 R |
1350 | insn_lengths[uid] = new_address - insn_current_address; |
1351 | insn_current_align = log; | |
1352 | insn_current_address = new_address; | |
1353 | } | |
1354 | else | |
1355 | insn_lengths[uid] = 0; | |
1356 | insn_addresses[uid] = insn_current_address; | |
1357 | continue; | |
1358 | } | |
1359 | ||
1360 | length_align = INSN_LENGTH_ALIGNMENT (insn); | |
1361 | if (length_align < insn_current_align) | |
1362 | insn_current_align = length_align; | |
1363 | ||
1364 | insn_last_address = insn_addresses[uid]; | |
3cf2715d | 1365 | insn_addresses[uid] = insn_current_address; |
fc470718 | 1366 | |
5e75ef4a | 1367 | #ifdef CASE_VECTOR_SHORTEN_MODE |
33f7f353 JR |
1368 | if (optimize && GET_CODE (insn) == JUMP_INSN |
1369 | && GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC) | |
1370 | { | |
33f7f353 JR |
1371 | rtx body = PATTERN (insn); |
1372 | int old_length = insn_lengths[uid]; | |
1373 | rtx rel_lab = XEXP (XEXP (body, 0), 0); | |
1374 | rtx min_lab = XEXP (XEXP (body, 2), 0); | |
1375 | rtx max_lab = XEXP (XEXP (body, 3), 0); | |
1376 | addr_diff_vec_flags flags = ADDR_DIFF_VEC_FLAGS (body); | |
1377 | int rel_addr = insn_addresses[INSN_UID (rel_lab)]; | |
1378 | int min_addr = insn_addresses[INSN_UID (min_lab)]; | |
1379 | int max_addr = insn_addresses[INSN_UID (max_lab)]; | |
1380 | rtx prev; | |
1381 | int rel_align = 0; | |
1382 | ||
1383 | /* Try to find a known alignment for rel_lab. */ | |
1384 | for (prev = rel_lab; | |
1385 | prev | |
1386 | && ! insn_lengths[INSN_UID (prev)] | |
1387 | && ! (varying_length[INSN_UID (prev)] & 1); | |
1388 | prev = PREV_INSN (prev)) | |
1389 | if (varying_length[INSN_UID (prev)] & 2) | |
1390 | { | |
1391 | rel_align = LABEL_TO_ALIGNMENT (prev); | |
1392 | break; | |
1393 | } | |
1394 | ||
1395 | /* See the comment on addr_diff_vec_flags in rtl.h for the | |
1396 | meaning of the flags values. base: REL_LAB vec: INSN */ | |
1397 | /* Anything after INSN has still addresses from the last | |
1398 | pass; adjust these so that they reflect our current | |
1399 | estimate for this pass. */ | |
1400 | if (flags.base_after_vec) | |
1401 | rel_addr += insn_current_address - insn_last_address; | |
1402 | if (flags.min_after_vec) | |
1403 | min_addr += insn_current_address - insn_last_address; | |
1404 | if (flags.max_after_vec) | |
1405 | max_addr += insn_current_address - insn_last_address; | |
1406 | /* We want to know the worst case, i.e. lowest possible value | |
1407 | for the offset of MIN_LAB. If MIN_LAB is after REL_LAB, | |
1408 | its offset is positive, and we have to be wary of code shrink; | |
1409 | otherwise, it is negative, and we have to be vary of code | |
1410 | size increase. */ | |
1411 | if (flags.min_after_base) | |
1412 | { | |
1413 | /* If INSN is between REL_LAB and MIN_LAB, the size | |
1414 | changes we are about to make can change the alignment | |
1415 | within the observed offset, therefore we have to break | |
1416 | it up into two parts that are independent. */ | |
1417 | if (! flags.base_after_vec && flags.min_after_vec) | |
1418 | { | |
1419 | min_addr -= align_fuzz (rel_lab, insn, rel_align, 0); | |
1420 | min_addr -= align_fuzz (insn, min_lab, 0, 0); | |
1421 | } | |
1422 | else | |
1423 | min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0); | |
1424 | } | |
1425 | else | |
1426 | { | |
1427 | if (flags.base_after_vec && ! flags.min_after_vec) | |
1428 | { | |
1429 | min_addr -= align_fuzz (min_lab, insn, 0, ~0); | |
1430 | min_addr -= align_fuzz (insn, rel_lab, 0, ~0); | |
1431 | } | |
1432 | else | |
1433 | min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0); | |
1434 | } | |
1435 | /* Likewise, determine the highest lowest possible value | |
1436 | for the offset of MAX_LAB. */ | |
1437 | if (flags.max_after_base) | |
1438 | { | |
1439 | if (! flags.base_after_vec && flags.max_after_vec) | |
1440 | { | |
1441 | max_addr += align_fuzz (rel_lab, insn, rel_align, ~0); | |
1442 | max_addr += align_fuzz (insn, max_lab, 0, ~0); | |
1443 | } | |
1444 | else | |
1445 | max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0); | |
1446 | } | |
1447 | else | |
1448 | { | |
1449 | if (flags.base_after_vec && ! flags.max_after_vec) | |
1450 | { | |
1451 | max_addr += align_fuzz (max_lab, insn, 0, 0); | |
1452 | max_addr += align_fuzz (insn, rel_lab, 0, 0); | |
1453 | } | |
1454 | else | |
1455 | max_addr += align_fuzz (max_lab, rel_lab, 0, 0); | |
1456 | } | |
1457 | PUT_MODE (body, CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr, | |
1458 | max_addr - rel_addr, | |
1459 | body)); | |
75197b37 BS |
1460 | if (JUMP_TABLES_IN_TEXT_SECTION |
1461 | #if !defined(READONLY_DATA_SECTION) | |
1462 | || 1 | |
33f7f353 | 1463 | #endif |
75197b37 BS |
1464 | ) |
1465 | { | |
1466 | insn_lengths[uid] | |
1467 | = (XVECLEN (body, 1) * GET_MODE_SIZE (GET_MODE (body))); | |
1468 | insn_current_address += insn_lengths[uid]; | |
1469 | if (insn_lengths[uid] != old_length) | |
1470 | something_changed = 1; | |
1471 | } | |
1472 | ||
33f7f353 | 1473 | continue; |
33f7f353 | 1474 | } |
5e75ef4a JL |
1475 | #endif /* CASE_VECTOR_SHORTEN_MODE */ |
1476 | ||
1477 | if (! (varying_length[uid])) | |
3cf2715d DE |
1478 | { |
1479 | insn_current_address += insn_lengths[uid]; | |
1480 | continue; | |
1481 | } | |
1482 | if (GET_CODE (insn) == INSN && GET_CODE (PATTERN (insn)) == SEQUENCE) | |
1483 | { | |
1484 | int i; | |
1485 | ||
1486 | body = PATTERN (insn); | |
1487 | new_length = 0; | |
1488 | for (i = 0; i < XVECLEN (body, 0); i++) | |
1489 | { | |
1490 | rtx inner_insn = XVECEXP (body, 0, i); | |
1491 | int inner_uid = INSN_UID (inner_insn); | |
1492 | int inner_length; | |
1493 | ||
1494 | insn_addresses[inner_uid] = insn_current_address; | |
1495 | ||
1496 | /* insn_current_length returns 0 for insns with a | |
1497 | non-varying length. */ | |
1498 | if (! varying_length[inner_uid]) | |
1499 | inner_length = insn_lengths[inner_uid]; | |
1500 | else | |
1501 | inner_length = insn_current_length (inner_insn); | |
1502 | ||
1503 | if (inner_length != insn_lengths[inner_uid]) | |
1504 | { | |
1505 | insn_lengths[inner_uid] = inner_length; | |
1506 | something_changed = 1; | |
1507 | } | |
1508 | insn_current_address += insn_lengths[inner_uid]; | |
1509 | new_length += inner_length; | |
1510 | } | |
1511 | } | |
1512 | else | |
1513 | { | |
1514 | new_length = insn_current_length (insn); | |
1515 | insn_current_address += new_length; | |
1516 | } | |
1517 | ||
3cf2715d DE |
1518 | #ifdef ADJUST_INSN_LENGTH |
1519 | /* If needed, do any adjustment. */ | |
1520 | tmp_length = new_length; | |
1521 | ADJUST_INSN_LENGTH (insn, new_length); | |
1522 | insn_current_address += (new_length - tmp_length); | |
3cf2715d DE |
1523 | #endif |
1524 | ||
1525 | if (new_length != insn_lengths[uid]) | |
1526 | { | |
1527 | insn_lengths[uid] = new_length; | |
1528 | something_changed = 1; | |
1529 | } | |
1530 | } | |
bb4aaf18 TG |
1531 | /* For a non-optimizing compile, do only a single pass. */ |
1532 | if (!optimize) | |
1533 | break; | |
3cf2715d | 1534 | } |
fc470718 R |
1535 | |
1536 | free (varying_length); | |
1537 | ||
3cf2715d DE |
1538 | #endif /* HAVE_ATTR_length */ |
1539 | } | |
1540 | ||
1541 | #ifdef HAVE_ATTR_length | |
1542 | /* Given the body of an INSN known to be generated by an ASM statement, return | |
1543 | the number of machine instructions likely to be generated for this insn. | |
1544 | This is used to compute its length. */ | |
1545 | ||
1546 | static int | |
1547 | asm_insn_count (body) | |
1548 | rtx body; | |
1549 | { | |
1550 | char *template; | |
1551 | int count = 1; | |
1552 | ||
5d0930ea DE |
1553 | if (GET_CODE (body) == ASM_INPUT) |
1554 | template = XSTR (body, 0); | |
1555 | else | |
1556 | template = decode_asm_operands (body, NULL_PTR, NULL_PTR, | |
1557 | NULL_PTR, NULL_PTR); | |
1558 | ||
1559 | for ( ; *template; template++) | |
3cf2715d DE |
1560 | if (IS_ASM_LOGICAL_LINE_SEPARATOR(*template) || *template == '\n') |
1561 | count++; | |
1562 | ||
1563 | return count; | |
1564 | } | |
1565 | #endif | |
1566 | \f | |
1567 | /* Output assembler code for the start of a function, | |
1568 | and initialize some of the variables in this file | |
1569 | for the new function. The label for the function and associated | |
1570 | assembler pseudo-ops have already been output in `assemble_start_function'. | |
1571 | ||
1572 | FIRST is the first insn of the rtl for the function being compiled. | |
1573 | FILE is the file to write assembler code to. | |
1574 | OPTIMIZE is nonzero if we should eliminate redundant | |
1575 | test and compare insns. */ | |
1576 | ||
1577 | void | |
1578 | final_start_function (first, file, optimize) | |
1579 | rtx first; | |
1580 | FILE *file; | |
1581 | int optimize; | |
1582 | { | |
1583 | block_depth = 0; | |
1584 | ||
1585 | this_is_asm_operands = 0; | |
1586 | ||
1587 | #ifdef NON_SAVING_SETJMP | |
1588 | /* A function that calls setjmp should save and restore all the | |
1589 | call-saved registers on a system where longjmp clobbers them. */ | |
1590 | if (NON_SAVING_SETJMP && current_function_calls_setjmp) | |
1591 | { | |
1592 | int i; | |
1593 | ||
1594 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
252f342a | 1595 | if (!call_used_regs[i]) |
3cf2715d DE |
1596 | regs_ever_live[i] = 1; |
1597 | } | |
1598 | #endif | |
1599 | ||
1600 | /* Initial line number is supposed to be output | |
1601 | before the function's prologue and label | |
1602 | so that the function's address will not appear to be | |
1603 | in the last statement of the preceding function. */ | |
1604 | if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED) | |
5fad6898 RK |
1605 | last_linenum = high_block_linenum = high_function_linenum |
1606 | = NOTE_LINE_NUMBER (first); | |
eac40081 | 1607 | |
c5cec899 | 1608 | #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO) |
d291dd49 | 1609 | /* Output DWARF definition of the function. */ |
0021b564 | 1610 | if (dwarf2out_do_frame ()) |
9a666dda | 1611 | dwarf2out_begin_prologue (); |
d291dd49 JM |
1612 | #endif |
1613 | ||
5fad6898 RK |
1614 | /* For SDB and XCOFF, the function beginning must be marked between |
1615 | the function label and the prologue. We always need this, even when | |
3c734272 | 1616 | -g1 was used. Defer on MIPS systems so that parameter descriptions |
0f41302f | 1617 | follow function entry. */ |
3c734272 | 1618 | #if defined(SDB_DEBUGGING_INFO) && !defined(MIPS_DEBUGGING_INFO) |
5fad6898 RK |
1619 | if (write_symbols == SDB_DEBUG) |
1620 | sdbout_begin_function (last_linenum); | |
1621 | else | |
2e2bbce2 | 1622 | #endif |
3cf2715d | 1623 | #ifdef XCOFF_DEBUGGING_INFO |
5fad6898 RK |
1624 | if (write_symbols == XCOFF_DEBUG) |
1625 | xcoffout_begin_function (file, last_linenum); | |
1626 | else | |
3cf2715d | 1627 | #endif |
5fad6898 RK |
1628 | /* But only output line number for other debug info types if -g2 |
1629 | or better. */ | |
1630 | if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED) | |
1631 | output_source_line (file, first); | |
3cf2715d DE |
1632 | |
1633 | #ifdef LEAF_REG_REMAP | |
1634 | if (leaf_function) | |
1635 | leaf_renumber_regs (first); | |
1636 | #endif | |
1637 | ||
1638 | /* The Sun386i and perhaps other machines don't work right | |
1639 | if the profiling code comes after the prologue. */ | |
1640 | #ifdef PROFILE_BEFORE_PROLOGUE | |
1641 | if (profile_flag) | |
1642 | profile_function (file); | |
1643 | #endif /* PROFILE_BEFORE_PROLOGUE */ | |
1644 | ||
0021b564 JM |
1645 | #if defined (DWARF2_UNWIND_INFO) && defined (HAVE_prologue) |
1646 | if (dwarf2out_do_frame ()) | |
1647 | dwarf2out_frame_debug (NULL_RTX); | |
1648 | #endif | |
1649 | ||
3cf2715d DE |
1650 | #ifdef FUNCTION_PROLOGUE |
1651 | /* First output the function prologue: code to set up the stack frame. */ | |
1652 | FUNCTION_PROLOGUE (file, get_frame_size ()); | |
1653 | #endif | |
1654 | ||
1655 | #if defined (SDB_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO) | |
1656 | if (write_symbols == SDB_DEBUG || write_symbols == XCOFF_DEBUG) | |
1657 | next_block_index = 1; | |
1658 | #endif | |
1659 | ||
1660 | /* If the machine represents the prologue as RTL, the profiling code must | |
1661 | be emitted when NOTE_INSN_PROLOGUE_END is scanned. */ | |
1662 | #ifdef HAVE_prologue | |
1663 | if (! HAVE_prologue) | |
1664 | #endif | |
1665 | profile_after_prologue (file); | |
1666 | ||
1667 | profile_label_no++; | |
1668 | ||
1669 | /* If we are doing basic block profiling, remember a printable version | |
1670 | of the function name. */ | |
1671 | if (profile_block_flag) | |
1672 | { | |
db3cf6fb MS |
1673 | bb_func_label_num |
1674 | = add_bb_string ((*decl_printable_name) (current_function_decl, 2), FALSE); | |
3cf2715d DE |
1675 | } |
1676 | } | |
1677 | ||
1678 | static void | |
1679 | profile_after_prologue (file) | |
1680 | FILE *file; | |
1681 | { | |
1682 | #ifdef FUNCTION_BLOCK_PROFILER | |
1683 | if (profile_block_flag) | |
1684 | { | |
47431dff | 1685 | FUNCTION_BLOCK_PROFILER (file, count_basic_blocks); |
3cf2715d DE |
1686 | } |
1687 | #endif /* FUNCTION_BLOCK_PROFILER */ | |
1688 | ||
1689 | #ifndef PROFILE_BEFORE_PROLOGUE | |
1690 | if (profile_flag) | |
1691 | profile_function (file); | |
1692 | #endif /* not PROFILE_BEFORE_PROLOGUE */ | |
1693 | } | |
1694 | ||
1695 | static void | |
1696 | profile_function (file) | |
1697 | FILE *file; | |
1698 | { | |
9e2f9a7f | 1699 | int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE); |
b729186a JL |
1700 | #if defined(ASM_OUTPUT_REG_PUSH) |
1701 | #if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM) | |
3cf2715d | 1702 | int sval = current_function_returns_struct; |
b729186a JL |
1703 | #endif |
1704 | #if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM) | |
3cf2715d | 1705 | int cxt = current_function_needs_context; |
b729186a JL |
1706 | #endif |
1707 | #endif /* ASM_OUTPUT_REG_PUSH */ | |
3cf2715d DE |
1708 | |
1709 | data_section (); | |
1710 | ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT)); | |
1711 | ASM_OUTPUT_INTERNAL_LABEL (file, "LP", profile_label_no); | |
9e2f9a7f | 1712 | assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, 1); |
3cf2715d | 1713 | |
499df339 | 1714 | function_section (current_function_decl); |
3cf2715d | 1715 | |
65ed39df | 1716 | #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH) |
3cf2715d DE |
1717 | if (sval) |
1718 | ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM); | |
1719 | #else | |
65ed39df | 1720 | #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH) |
3cf2715d | 1721 | if (sval) |
51723711 KG |
1722 | { |
1723 | ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM); | |
1724 | } | |
3cf2715d DE |
1725 | #endif |
1726 | #endif | |
1727 | ||
65ed39df | 1728 | #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH) |
3cf2715d DE |
1729 | if (cxt) |
1730 | ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM); | |
1731 | #else | |
65ed39df | 1732 | #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH) |
3cf2715d | 1733 | if (cxt) |
51723711 KG |
1734 | { |
1735 | ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_REGNUM); | |
1736 | } | |
3cf2715d DE |
1737 | #endif |
1738 | #endif | |
3cf2715d DE |
1739 | |
1740 | FUNCTION_PROFILER (file, profile_label_no); | |
1741 | ||
65ed39df | 1742 | #if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH) |
3cf2715d DE |
1743 | if (cxt) |
1744 | ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_INCOMING_REGNUM); | |
1745 | #else | |
65ed39df | 1746 | #if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH) |
3cf2715d | 1747 | if (cxt) |
51723711 KG |
1748 | { |
1749 | ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM); | |
1750 | } | |
3cf2715d DE |
1751 | #endif |
1752 | #endif | |
3cf2715d | 1753 | |
65ed39df | 1754 | #if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH) |
3cf2715d DE |
1755 | if (sval) |
1756 | ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM); | |
1757 | #else | |
65ed39df | 1758 | #if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH) |
3cf2715d | 1759 | if (sval) |
51723711 KG |
1760 | { |
1761 | ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM); | |
1762 | } | |
3cf2715d DE |
1763 | #endif |
1764 | #endif | |
1765 | } | |
1766 | ||
1767 | /* Output assembler code for the end of a function. | |
1768 | For clarity, args are same as those of `final_start_function' | |
1769 | even though not all of them are needed. */ | |
1770 | ||
1771 | void | |
1772 | final_end_function (first, file, optimize) | |
1773 | rtx first; | |
1774 | FILE *file; | |
1775 | int optimize; | |
1776 | { | |
1777 | if (app_on) | |
1778 | { | |
51723711 | 1779 | fputs (ASM_APP_OFF, file); |
3cf2715d DE |
1780 | app_on = 0; |
1781 | } | |
1782 | ||
1783 | #ifdef SDB_DEBUGGING_INFO | |
1784 | if (write_symbols == SDB_DEBUG) | |
eac40081 | 1785 | sdbout_end_function (high_function_linenum); |
3cf2715d DE |
1786 | #endif |
1787 | ||
1788 | #ifdef DWARF_DEBUGGING_INFO | |
1789 | if (write_symbols == DWARF_DEBUG) | |
1790 | dwarfout_end_function (); | |
1791 | #endif | |
1792 | ||
1793 | #ifdef XCOFF_DEBUGGING_INFO | |
1794 | if (write_symbols == XCOFF_DEBUG) | |
eac40081 | 1795 | xcoffout_end_function (file, high_function_linenum); |
3cf2715d DE |
1796 | #endif |
1797 | ||
1798 | #ifdef FUNCTION_EPILOGUE | |
1799 | /* Finally, output the function epilogue: | |
1800 | code to restore the stack frame and return to the caller. */ | |
1801 | FUNCTION_EPILOGUE (file, get_frame_size ()); | |
1802 | #endif | |
1803 | ||
1804 | #ifdef SDB_DEBUGGING_INFO | |
1805 | if (write_symbols == SDB_DEBUG) | |
1806 | sdbout_end_epilogue (); | |
1807 | #endif | |
1808 | ||
1809 | #ifdef DWARF_DEBUGGING_INFO | |
1810 | if (write_symbols == DWARF_DEBUG) | |
1811 | dwarfout_end_epilogue (); | |
1812 | #endif | |
1813 | ||
c5cec899 | 1814 | #if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO) |
0021b564 | 1815 | if (dwarf2out_do_frame ()) |
9a666dda JM |
1816 | dwarf2out_end_epilogue (); |
1817 | #endif | |
1818 | ||
3cf2715d DE |
1819 | #ifdef XCOFF_DEBUGGING_INFO |
1820 | if (write_symbols == XCOFF_DEBUG) | |
1821 | xcoffout_end_epilogue (file); | |
1822 | #endif | |
1823 | ||
1824 | bb_func_label_num = -1; /* not in function, nuke label # */ | |
1825 | ||
1826 | /* If FUNCTION_EPILOGUE is not defined, then the function body | |
1827 | itself contains return instructions wherever needed. */ | |
1828 | } | |
1829 | \f | |
1830 | /* Add a block to the linked list that remembers the current line/file/function | |
1831 | for basic block profiling. Emit the label in front of the basic block and | |
1832 | the instructions that increment the count field. */ | |
1833 | ||
1834 | static void | |
1835 | add_bb (file) | |
1836 | FILE *file; | |
1837 | { | |
1838 | struct bb_list *ptr = (struct bb_list *) permalloc (sizeof (struct bb_list)); | |
1839 | ||
1840 | /* Add basic block to linked list. */ | |
1841 | ptr->next = 0; | |
1842 | ptr->line_num = last_linenum; | |
1843 | ptr->file_label_num = bb_file_label_num; | |
1844 | ptr->func_label_num = bb_func_label_num; | |
1845 | *bb_tail = ptr; | |
1846 | bb_tail = &ptr->next; | |
1847 | ||
1848 | /* Enable the table of basic-block use counts | |
1849 | to point at the code it applies to. */ | |
1850 | ASM_OUTPUT_INTERNAL_LABEL (file, "LPB", count_basic_blocks); | |
1851 | ||
1852 | /* Before first insn of this basic block, increment the | |
1853 | count of times it was entered. */ | |
1854 | #ifdef BLOCK_PROFILER | |
1855 | BLOCK_PROFILER (file, count_basic_blocks); | |
9e2f9a7f DE |
1856 | #endif |
1857 | #ifdef HAVE_cc0 | |
3cf2715d DE |
1858 | CC_STATUS_INIT; |
1859 | #endif | |
1860 | ||
1861 | new_block = 0; | |
1862 | count_basic_blocks++; | |
1863 | } | |
1864 | ||
1865 | /* Add a string to be used for basic block profiling. */ | |
1866 | ||
1867 | static int | |
1868 | add_bb_string (string, perm_p) | |
1869 | char *string; | |
1870 | int perm_p; | |
1871 | { | |
1872 | int len; | |
1873 | struct bb_str *ptr = 0; | |
1874 | ||
1875 | if (!string) | |
1876 | { | |
1877 | string = "<unknown>"; | |
1878 | perm_p = TRUE; | |
1879 | } | |
1880 | ||
1881 | /* Allocate a new string if the current string isn't permanent. If | |
1882 | the string is permanent search for the same string in other | |
1883 | allocations. */ | |
1884 | ||
1885 | len = strlen (string) + 1; | |
1886 | if (!perm_p) | |
1887 | { | |
1888 | char *p = (char *) permalloc (len); | |
1889 | bcopy (string, p, len); | |
1890 | string = p; | |
1891 | } | |
1892 | else | |
0f41302f | 1893 | for (ptr = sbb_head; ptr != (struct bb_str *) 0; ptr = ptr->next) |
3cf2715d DE |
1894 | if (ptr->string == string) |
1895 | break; | |
1896 | ||
1897 | /* Allocate a new string block if we need to. */ | |
1898 | if (!ptr) | |
1899 | { | |
1900 | ptr = (struct bb_str *) permalloc (sizeof (*ptr)); | |
1901 | ptr->next = 0; | |
1902 | ptr->length = len; | |
1903 | ptr->label_num = sbb_label_num++; | |
1904 | ptr->string = string; | |
1905 | *sbb_tail = ptr; | |
1906 | sbb_tail = &ptr->next; | |
1907 | } | |
1908 | ||
1909 | return ptr->label_num; | |
1910 | } | |
1911 | ||
1912 | \f | |
1913 | /* Output assembler code for some insns: all or part of a function. | |
1914 | For description of args, see `final_start_function', above. | |
1915 | ||
1916 | PRESCAN is 1 if we are not really outputting, | |
1917 | just scanning as if we were outputting. | |
1918 | Prescanning deletes and rearranges insns just like ordinary output. | |
1919 | PRESCAN is -2 if we are outputting after having prescanned. | |
1920 | In this case, don't try to delete or rearrange insns | |
1921 | because that has already been done. | |
1922 | Prescanning is done only on certain machines. */ | |
1923 | ||
1924 | void | |
1925 | final (first, file, optimize, prescan) | |
1926 | rtx first; | |
1927 | FILE *file; | |
1928 | int optimize; | |
1929 | int prescan; | |
1930 | { | |
1931 | register rtx insn; | |
1932 | int max_line = 0; | |
a8c3510c | 1933 | int max_uid = 0; |
3cf2715d DE |
1934 | |
1935 | last_ignored_compare = 0; | |
1936 | new_block = 1; | |
1937 | ||
3d195391 MS |
1938 | check_exception_handler_labels (); |
1939 | ||
3cf2715d DE |
1940 | /* Make a map indicating which line numbers appear in this function. |
1941 | When producing SDB debugging info, delete troublesome line number | |
1942 | notes from inlined functions in other files as well as duplicate | |
1943 | line number notes. */ | |
1944 | #ifdef SDB_DEBUGGING_INFO | |
1945 | if (write_symbols == SDB_DEBUG) | |
1946 | { | |
1947 | rtx last = 0; | |
1948 | for (insn = first; insn; insn = NEXT_INSN (insn)) | |
1949 | if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0) | |
1950 | { | |
1951 | if ((RTX_INTEGRATED_P (insn) | |
1952 | && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0) | |
1953 | || (last != 0 | |
1954 | && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last) | |
1955 | && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last))) | |
1956 | { | |
1957 | NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED; | |
1958 | NOTE_SOURCE_FILE (insn) = 0; | |
1959 | continue; | |
1960 | } | |
1961 | last = insn; | |
1962 | if (NOTE_LINE_NUMBER (insn) > max_line) | |
1963 | max_line = NOTE_LINE_NUMBER (insn); | |
1964 | } | |
1965 | } | |
1966 | else | |
1967 | #endif | |
1968 | { | |
1969 | for (insn = first; insn; insn = NEXT_INSN (insn)) | |
1970 | if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line) | |
1971 | max_line = NOTE_LINE_NUMBER (insn); | |
1972 | } | |
1973 | ||
1974 | line_note_exists = (char *) oballoc (max_line + 1); | |
1975 | bzero (line_note_exists, max_line + 1); | |
1976 | ||
1977 | for (insn = first; insn; insn = NEXT_INSN (insn)) | |
a8c3510c AM |
1978 | { |
1979 | if (INSN_UID (insn) > max_uid) /* find largest UID */ | |
1980 | max_uid = INSN_UID (insn); | |
1981 | if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0) | |
1982 | line_note_exists[NOTE_LINE_NUMBER (insn)] = 1; | |
9ef4c6ef JC |
1983 | #ifdef HAVE_cc0 |
1984 | /* If CC tracking across branches is enabled, record the insn which | |
1985 | jumps to each branch only reached from one place. */ | |
7ad7f828 | 1986 | if (optimize && GET_CODE (insn) == JUMP_INSN) |
9ef4c6ef JC |
1987 | { |
1988 | rtx lab = JUMP_LABEL (insn); | |
1989 | if (lab && LABEL_NUSES (lab) == 1) | |
1990 | { | |
1991 | LABEL_REFS (lab) = insn; | |
1992 | } | |
1993 | } | |
1994 | #endif | |
a8c3510c AM |
1995 | } |
1996 | ||
1997 | /* Initialize insn_eh_region table if eh is being used. */ | |
1998 | ||
1999 | init_insn_eh_region (first, max_uid); | |
3cf2715d DE |
2000 | |
2001 | init_recog (); | |
2002 | ||
2003 | CC_STATUS_INIT; | |
2004 | ||
2005 | /* Output the insns. */ | |
2006 | for (insn = NEXT_INSN (first); insn;) | |
2f16edb1 TG |
2007 | { |
2008 | #ifdef HAVE_ATTR_length | |
2009 | insn_current_address = insn_addresses[INSN_UID (insn)]; | |
2010 | #endif | |
2011 | insn = final_scan_insn (insn, file, optimize, prescan, 0); | |
2012 | } | |
3cf2715d DE |
2013 | |
2014 | /* Do basic-block profiling here | |
2015 | if the last insn was a conditional branch. */ | |
2016 | if (profile_block_flag && new_block) | |
2017 | add_bb (file); | |
a8c3510c AM |
2018 | |
2019 | free_insn_eh_region (); | |
3cf2715d DE |
2020 | } |
2021 | \f | |
2022 | /* The final scan for one insn, INSN. | |
2023 | Args are same as in `final', except that INSN | |
2024 | is the insn being scanned. | |
2025 | Value returned is the next insn to be scanned. | |
2026 | ||
2027 | NOPEEPHOLES is the flag to disallow peephole processing (currently | |
2028 | used for within delayed branch sequence output). */ | |
2029 | ||
2030 | rtx | |
2031 | final_scan_insn (insn, file, optimize, prescan, nopeepholes) | |
2032 | rtx insn; | |
2033 | FILE *file; | |
2034 | int optimize; | |
2035 | int prescan; | |
2036 | int nopeepholes; | |
2037 | { | |
2038 | register int i; | |
90ca38bb MM |
2039 | #ifdef HAVE_cc0 |
2040 | rtx set; | |
2041 | #endif | |
2042 | ||
3cf2715d DE |
2043 | insn_counter++; |
2044 | ||
2045 | /* Ignore deleted insns. These can occur when we split insns (due to a | |
2046 | template of "#") while not optimizing. */ | |
2047 | if (INSN_DELETED_P (insn)) | |
2048 | return NEXT_INSN (insn); | |
2049 | ||
2050 | switch (GET_CODE (insn)) | |
2051 | { | |
2052 | case NOTE: | |
2053 | if (prescan > 0) | |
2054 | break; | |
2055 | ||
2056 | /* Align the beginning of a loop, for higher speed | |
2057 | on certain machines. */ | |
2058 | ||
fc470718 R |
2059 | if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG) |
2060 | break; /* This used to depend on optimize, but that was bogus. */ | |
3cf2715d DE |
2061 | if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END) |
2062 | break; | |
2063 | ||
9ad8a5f0 MS |
2064 | if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG |
2065 | && ! exceptions_via_longjmp) | |
3d195391 MS |
2066 | { |
2067 | ASM_OUTPUT_INTERNAL_LABEL (file, "LEHB", NOTE_BLOCK_NUMBER (insn)); | |
a1622f83 AM |
2068 | if (! flag_new_exceptions) |
2069 | add_eh_table_entry (NOTE_BLOCK_NUMBER (insn)); | |
3d195391 MS |
2070 | #ifdef ASM_OUTPUT_EH_REGION_BEG |
2071 | ASM_OUTPUT_EH_REGION_BEG (file, NOTE_BLOCK_NUMBER (insn)); | |
2072 | #endif | |
2073 | break; | |
2074 | } | |
2075 | ||
9ad8a5f0 MS |
2076 | if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END |
2077 | && ! exceptions_via_longjmp) | |
3d195391 MS |
2078 | { |
2079 | ASM_OUTPUT_INTERNAL_LABEL (file, "LEHE", NOTE_BLOCK_NUMBER (insn)); | |
a1622f83 AM |
2080 | if (flag_new_exceptions) |
2081 | add_eh_table_entry (NOTE_BLOCK_NUMBER (insn)); | |
3d195391 MS |
2082 | #ifdef ASM_OUTPUT_EH_REGION_END |
2083 | ASM_OUTPUT_EH_REGION_END (file, NOTE_BLOCK_NUMBER (insn)); | |
2084 | #endif | |
2085 | break; | |
2086 | } | |
2087 | ||
3cf2715d DE |
2088 | if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END) |
2089 | { | |
2090 | #ifdef FUNCTION_END_PROLOGUE | |
2091 | FUNCTION_END_PROLOGUE (file); | |
2092 | #endif | |
2093 | profile_after_prologue (file); | |
2094 | break; | |
2095 | } | |
2096 | ||
2097 | #ifdef FUNCTION_BEGIN_EPILOGUE | |
2098 | if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG) | |
2099 | { | |
2100 | FUNCTION_BEGIN_EPILOGUE (file); | |
2101 | break; | |
2102 | } | |
2103 | #endif | |
2104 | ||
2105 | if (write_symbols == NO_DEBUG) | |
2106 | break; | |
2107 | if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG) | |
2108 | { | |
3c734272 RK |
2109 | #if defined(SDB_DEBUGGING_INFO) && defined(MIPS_DEBUGGING_INFO) |
2110 | /* MIPS stabs require the parameter descriptions to be after the | |
0f41302f | 2111 | function entry point rather than before. */ |
3c734272 RK |
2112 | if (write_symbols == SDB_DEBUG) |
2113 | sdbout_begin_function (last_linenum); | |
2114 | else | |
2115 | #endif | |
3cf2715d | 2116 | #ifdef DWARF_DEBUGGING_INFO |
2e2bbce2 RK |
2117 | /* This outputs a marker where the function body starts, so it |
2118 | must be after the prologue. */ | |
3cf2715d DE |
2119 | if (write_symbols == DWARF_DEBUG) |
2120 | dwarfout_begin_function (); | |
2121 | #endif | |
2122 | break; | |
2123 | } | |
2124 | if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED) | |
2125 | break; /* An insn that was "deleted" */ | |
2126 | if (app_on) | |
2127 | { | |
51723711 | 2128 | fputs (ASM_APP_OFF, file); |
3cf2715d DE |
2129 | app_on = 0; |
2130 | } | |
2131 | if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG | |
2132 | && (debug_info_level == DINFO_LEVEL_NORMAL | |
2133 | || debug_info_level == DINFO_LEVEL_VERBOSE | |
3cf2715d | 2134 | || write_symbols == DWARF_DEBUG |
9a666dda | 2135 | || write_symbols == DWARF2_DEBUG)) |
3cf2715d DE |
2136 | { |
2137 | /* Beginning of a symbol-block. Assign it a sequence number | |
2138 | and push the number onto the stack PENDING_BLOCKS. */ | |
2139 | ||
2140 | if (block_depth == max_block_depth) | |
2141 | { | |
2142 | /* PENDING_BLOCKS is full; make it longer. */ | |
2143 | max_block_depth *= 2; | |
2144 | pending_blocks | |
2145 | = (int *) xrealloc (pending_blocks, | |
2146 | max_block_depth * sizeof (int)); | |
2147 | } | |
2148 | pending_blocks[block_depth++] = next_block_index; | |
2149 | ||
eac40081 RK |
2150 | high_block_linenum = last_linenum; |
2151 | ||
3cf2715d DE |
2152 | /* Output debugging info about the symbol-block beginning. */ |
2153 | ||
2154 | #ifdef SDB_DEBUGGING_INFO | |
2155 | if (write_symbols == SDB_DEBUG) | |
2156 | sdbout_begin_block (file, last_linenum, next_block_index); | |
2157 | #endif | |
2158 | #ifdef XCOFF_DEBUGGING_INFO | |
2159 | if (write_symbols == XCOFF_DEBUG) | |
2160 | xcoffout_begin_block (file, last_linenum, next_block_index); | |
2161 | #endif | |
2162 | #ifdef DBX_DEBUGGING_INFO | |
2163 | if (write_symbols == DBX_DEBUG) | |
2164 | ASM_OUTPUT_INTERNAL_LABEL (file, "LBB", next_block_index); | |
2165 | #endif | |
2166 | #ifdef DWARF_DEBUGGING_INFO | |
7aecea25 | 2167 | if (write_symbols == DWARF_DEBUG) |
3cf2715d DE |
2168 | dwarfout_begin_block (next_block_index); |
2169 | #endif | |
9a666dda JM |
2170 | #ifdef DWARF2_DEBUGGING_INFO |
2171 | if (write_symbols == DWARF2_DEBUG) | |
2172 | dwarf2out_begin_block (next_block_index); | |
2173 | #endif | |
3cf2715d DE |
2174 | |
2175 | next_block_index++; | |
2176 | } | |
2177 | else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END | |
2178 | && (debug_info_level == DINFO_LEVEL_NORMAL | |
2179 | || debug_info_level == DINFO_LEVEL_VERBOSE | |
3cf2715d | 2180 | || write_symbols == DWARF_DEBUG |
9a666dda | 2181 | || write_symbols == DWARF2_DEBUG)) |
3cf2715d DE |
2182 | { |
2183 | /* End of a symbol-block. Pop its sequence number off | |
2184 | PENDING_BLOCKS and output debugging info based on that. */ | |
2185 | ||
2186 | --block_depth; | |
2187 | ||
2188 | #ifdef XCOFF_DEBUGGING_INFO | |
2189 | if (write_symbols == XCOFF_DEBUG && block_depth >= 0) | |
eac40081 RK |
2190 | xcoffout_end_block (file, high_block_linenum, |
2191 | pending_blocks[block_depth]); | |
3cf2715d DE |
2192 | #endif |
2193 | #ifdef DBX_DEBUGGING_INFO | |
2194 | if (write_symbols == DBX_DEBUG && block_depth >= 0) | |
2195 | ASM_OUTPUT_INTERNAL_LABEL (file, "LBE", | |
2196 | pending_blocks[block_depth]); | |
2197 | #endif | |
2198 | #ifdef SDB_DEBUGGING_INFO | |
2199 | if (write_symbols == SDB_DEBUG && block_depth >= 0) | |
eac40081 RK |
2200 | sdbout_end_block (file, high_block_linenum, |
2201 | pending_blocks[block_depth]); | |
3cf2715d DE |
2202 | #endif |
2203 | #ifdef DWARF_DEBUGGING_INFO | |
7aecea25 | 2204 | if (write_symbols == DWARF_DEBUG && block_depth >= 0) |
3cf2715d | 2205 | dwarfout_end_block (pending_blocks[block_depth]); |
9a666dda JM |
2206 | #endif |
2207 | #ifdef DWARF2_DEBUGGING_INFO | |
2208 | if (write_symbols == DWARF2_DEBUG && block_depth >= 0) | |
2209 | dwarf2out_end_block (pending_blocks[block_depth]); | |
3cf2715d DE |
2210 | #endif |
2211 | } | |
2212 | else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL | |
2213 | && (debug_info_level == DINFO_LEVEL_NORMAL | |
2214 | || debug_info_level == DINFO_LEVEL_VERBOSE)) | |
2215 | { | |
2216 | #ifdef DWARF_DEBUGGING_INFO | |
2217 | if (write_symbols == DWARF_DEBUG) | |
2218 | dwarfout_label (insn); | |
9a666dda JM |
2219 | #endif |
2220 | #ifdef DWARF2_DEBUGGING_INFO | |
2221 | if (write_symbols == DWARF2_DEBUG) | |
2222 | dwarf2out_label (insn); | |
3cf2715d DE |
2223 | #endif |
2224 | } | |
2225 | else if (NOTE_LINE_NUMBER (insn) > 0) | |
2226 | /* This note is a line-number. */ | |
2227 | { | |
2228 | register rtx note; | |
2229 | ||
2230 | #if 0 /* This is what we used to do. */ | |
2231 | output_source_line (file, insn); | |
2232 | #endif | |
2233 | int note_after = 0; | |
2234 | ||
2235 | /* If there is anything real after this note, | |
2236 | output it. If another line note follows, omit this one. */ | |
2237 | for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note)) | |
2238 | { | |
2239 | if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL) | |
2240 | break; | |
2241 | /* These types of notes can be significant | |
2242 | so make sure the preceding line number stays. */ | |
2243 | else if (GET_CODE (note) == NOTE | |
2244 | && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG | |
2245 | || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END | |
2246 | || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG)) | |
2247 | break; | |
2248 | else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0) | |
2249 | { | |
2250 | /* Another line note follows; we can delete this note | |
2251 | if no intervening line numbers have notes elsewhere. */ | |
2252 | int num; | |
2253 | for (num = NOTE_LINE_NUMBER (insn) + 1; | |
2254 | num < NOTE_LINE_NUMBER (note); | |
2255 | num++) | |
2256 | if (line_note_exists[num]) | |
2257 | break; | |
2258 | ||
2259 | if (num >= NOTE_LINE_NUMBER (note)) | |
2260 | note_after = 1; | |
2261 | break; | |
2262 | } | |
2263 | } | |
2264 | ||
2265 | /* Output this line note | |
2266 | if it is the first or the last line note in a row. */ | |
2267 | if (!note_after) | |
2268 | output_source_line (file, insn); | |
2269 | } | |
2270 | break; | |
2271 | ||
2272 | case BARRIER: | |
6020d360 JM |
2273 | #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS) |
2274 | /* If we push arguments, we need to check all insns for stack | |
2275 | adjustments. */ | |
2276 | if (dwarf2out_do_frame ()) | |
2277 | dwarf2out_frame_debug (insn); | |
3cf2715d DE |
2278 | #endif |
2279 | break; | |
2280 | ||
2281 | case CODE_LABEL: | |
1dd8faa8 R |
2282 | /* The target port might emit labels in the output function for |
2283 | some insn, e.g. sh.c output_branchy_insn. */ | |
de7987a6 R |
2284 | if (CODE_LABEL_NUMBER (insn) <= max_labelno) |
2285 | { | |
2286 | int align = LABEL_TO_ALIGNMENT (insn); | |
50b2596f | 2287 | #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN |
9e423e6d | 2288 | int max_skip = LABEL_TO_MAX_SKIP (insn); |
50b2596f | 2289 | #endif |
fc470718 | 2290 | |
1dd8faa8 | 2291 | if (align && NEXT_INSN (insn)) |
9e423e6d JW |
2292 | #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN |
2293 | ASM_OUTPUT_MAX_SKIP_ALIGN (file, align, max_skip); | |
2294 | #else | |
de7987a6 | 2295 | ASM_OUTPUT_ALIGN (file, align); |
9e423e6d | 2296 | #endif |
de7987a6 | 2297 | } |
9ef4c6ef | 2298 | #ifdef HAVE_cc0 |
3cf2715d | 2299 | CC_STATUS_INIT; |
9ef4c6ef JC |
2300 | /* If this label is reached from only one place, set the condition |
2301 | codes from the instruction just before the branch. */ | |
7ad7f828 JC |
2302 | |
2303 | /* Disabled because some insns set cc_status in the C output code | |
2304 | and NOTICE_UPDATE_CC alone can set incorrect status. */ | |
2305 | if (0 /* optimize && LABEL_NUSES (insn) == 1*/) | |
9ef4c6ef JC |
2306 | { |
2307 | rtx jump = LABEL_REFS (insn); | |
2308 | rtx barrier = prev_nonnote_insn (insn); | |
2309 | rtx prev; | |
2310 | /* If the LABEL_REFS field of this label has been set to point | |
2311 | at a branch, the predecessor of the branch is a regular | |
2312 | insn, and that branch is the only way to reach this label, | |
2313 | set the condition codes based on the branch and its | |
2314 | predecessor. */ | |
2315 | if (barrier && GET_CODE (barrier) == BARRIER | |
2316 | && jump && GET_CODE (jump) == JUMP_INSN | |
2317 | && (prev = prev_nonnote_insn (jump)) | |
2318 | && GET_CODE (prev) == INSN) | |
2319 | { | |
2320 | NOTICE_UPDATE_CC (PATTERN (prev), prev); | |
2321 | NOTICE_UPDATE_CC (PATTERN (jump), jump); | |
2322 | } | |
2323 | } | |
2324 | #endif | |
3cf2715d DE |
2325 | if (prescan > 0) |
2326 | break; | |
2327 | new_block = 1; | |
03ffa171 RK |
2328 | |
2329 | #ifdef FINAL_PRESCAN_LABEL | |
2330 | FINAL_PRESCAN_INSN (insn, NULL_PTR, 0); | |
2331 | #endif | |
2332 | ||
3cf2715d DE |
2333 | #ifdef SDB_DEBUGGING_INFO |
2334 | if (write_symbols == SDB_DEBUG && LABEL_NAME (insn)) | |
2335 | sdbout_label (insn); | |
2336 | #endif | |
2337 | #ifdef DWARF_DEBUGGING_INFO | |
2338 | if (write_symbols == DWARF_DEBUG && LABEL_NAME (insn)) | |
2339 | dwarfout_label (insn); | |
9a666dda JM |
2340 | #endif |
2341 | #ifdef DWARF2_DEBUGGING_INFO | |
2342 | if (write_symbols == DWARF2_DEBUG && LABEL_NAME (insn)) | |
2343 | dwarf2out_label (insn); | |
3cf2715d DE |
2344 | #endif |
2345 | if (app_on) | |
2346 | { | |
51723711 | 2347 | fputs (ASM_APP_OFF, file); |
3cf2715d DE |
2348 | app_on = 0; |
2349 | } | |
2350 | if (NEXT_INSN (insn) != 0 | |
2351 | && GET_CODE (NEXT_INSN (insn)) == JUMP_INSN) | |
2352 | { | |
2353 | rtx nextbody = PATTERN (NEXT_INSN (insn)); | |
2354 | ||
2355 | /* If this label is followed by a jump-table, | |
2356 | make sure we put the label in the read-only section. Also | |
2357 | possibly write the label and jump table together. */ | |
2358 | ||
2359 | if (GET_CODE (nextbody) == ADDR_VEC | |
2360 | || GET_CODE (nextbody) == ADDR_DIFF_VEC) | |
2361 | { | |
e0d80184 DM |
2362 | #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC) |
2363 | /* In this case, the case vector is being moved by the | |
2364 | target, so don't output the label at all. Leave that | |
2365 | to the back end macros. */ | |
2366 | #else | |
75197b37 BS |
2367 | if (! JUMP_TABLES_IN_TEXT_SECTION) |
2368 | { | |
2369 | readonly_data_section (); | |
3cf2715d | 2370 | #ifdef READONLY_DATA_SECTION |
75197b37 BS |
2371 | ASM_OUTPUT_ALIGN (file, |
2372 | exact_log2 (BIGGEST_ALIGNMENT | |
2373 | / BITS_PER_UNIT)); | |
3cf2715d | 2374 | #endif /* READONLY_DATA_SECTION */ |
75197b37 BS |
2375 | } |
2376 | else | |
2377 | function_section (current_function_decl); | |
2378 | ||
3cf2715d DE |
2379 | #ifdef ASM_OUTPUT_CASE_LABEL |
2380 | ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn), | |
2381 | NEXT_INSN (insn)); | |
2382 | #else | |
2383 | ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn)); | |
e0d80184 | 2384 | #endif |
3cf2715d DE |
2385 | #endif |
2386 | break; | |
2387 | } | |
2388 | } | |
2389 | ||
2390 | ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn)); | |
2391 | break; | |
2392 | ||
2393 | default: | |
2394 | { | |
51723711 | 2395 | register rtx body = PATTERN (insn); |
3cf2715d DE |
2396 | int insn_code_number; |
2397 | char *template; | |
b729186a | 2398 | #ifdef HAVE_cc0 |
3cf2715d | 2399 | rtx note; |
b729186a | 2400 | #endif |
3cf2715d DE |
2401 | |
2402 | /* An INSN, JUMP_INSN or CALL_INSN. | |
2403 | First check for special kinds that recog doesn't recognize. */ | |
2404 | ||
2405 | if (GET_CODE (body) == USE /* These are just declarations */ | |
2406 | || GET_CODE (body) == CLOBBER) | |
2407 | break; | |
2408 | ||
2409 | #ifdef HAVE_cc0 | |
2410 | /* If there is a REG_CC_SETTER note on this insn, it means that | |
2411 | the setting of the condition code was done in the delay slot | |
2412 | of the insn that branched here. So recover the cc status | |
2413 | from the insn that set it. */ | |
2414 | ||
2415 | note = find_reg_note (insn, REG_CC_SETTER, NULL_RTX); | |
2416 | if (note) | |
2417 | { | |
2418 | NOTICE_UPDATE_CC (PATTERN (XEXP (note, 0)), XEXP (note, 0)); | |
2419 | cc_prev_status = cc_status; | |
2420 | } | |
2421 | #endif | |
2422 | ||
2423 | /* Detect insns that are really jump-tables | |
2424 | and output them as such. */ | |
2425 | ||
2426 | if (GET_CODE (body) == ADDR_VEC || GET_CODE (body) == ADDR_DIFF_VEC) | |
2427 | { | |
7f7f8214 | 2428 | #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)) |
3cf2715d | 2429 | register int vlen, idx; |
7f7f8214 | 2430 | #endif |
3cf2715d DE |
2431 | |
2432 | if (prescan > 0) | |
2433 | break; | |
2434 | ||
2435 | if (app_on) | |
2436 | { | |
51723711 | 2437 | fputs (ASM_APP_OFF, file); |
3cf2715d DE |
2438 | app_on = 0; |
2439 | } | |
2440 | ||
e0d80184 DM |
2441 | #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC) |
2442 | if (GET_CODE (body) == ADDR_VEC) | |
2443 | { | |
2444 | #ifdef ASM_OUTPUT_ADDR_VEC | |
2445 | ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body); | |
2446 | #else | |
2447 | abort(); | |
2448 | #endif | |
2449 | } | |
2450 | else | |
2451 | { | |
2452 | #ifdef ASM_OUTPUT_ADDR_DIFF_VEC | |
2453 | ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body); | |
2454 | #else | |
2455 | abort(); | |
2456 | #endif | |
2457 | } | |
2458 | #else | |
3cf2715d DE |
2459 | vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC); |
2460 | for (idx = 0; idx < vlen; idx++) | |
2461 | { | |
2462 | if (GET_CODE (body) == ADDR_VEC) | |
2463 | { | |
2464 | #ifdef ASM_OUTPUT_ADDR_VEC_ELT | |
2465 | ASM_OUTPUT_ADDR_VEC_ELT | |
2466 | (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0))); | |
2467 | #else | |
2468 | abort (); | |
2469 | #endif | |
2470 | } | |
2471 | else | |
2472 | { | |
2473 | #ifdef ASM_OUTPUT_ADDR_DIFF_ELT | |
2474 | ASM_OUTPUT_ADDR_DIFF_ELT | |
2475 | (file, | |
33f7f353 | 2476 | body, |
3cf2715d DE |
2477 | CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)), |
2478 | CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0))); | |
2479 | #else | |
2480 | abort (); | |
2481 | #endif | |
2482 | } | |
2483 | } | |
2484 | #ifdef ASM_OUTPUT_CASE_END | |
2485 | ASM_OUTPUT_CASE_END (file, | |
2486 | CODE_LABEL_NUMBER (PREV_INSN (insn)), | |
2487 | insn); | |
e0d80184 | 2488 | #endif |
3cf2715d DE |
2489 | #endif |
2490 | ||
4d1065ed | 2491 | function_section (current_function_decl); |
3cf2715d DE |
2492 | |
2493 | break; | |
2494 | } | |
2495 | ||
2496 | /* Do basic-block profiling when we reach a new block. | |
2497 | Done here to avoid jump tables. */ | |
2498 | if (profile_block_flag && new_block) | |
2499 | add_bb (file); | |
2500 | ||
2501 | if (GET_CODE (body) == ASM_INPUT) | |
2502 | { | |
2503 | /* There's no telling what that did to the condition codes. */ | |
2504 | CC_STATUS_INIT; | |
2505 | if (prescan > 0) | |
2506 | break; | |
2507 | if (! app_on) | |
2508 | { | |
51723711 | 2509 | fputs (ASM_APP_ON, file); |
3cf2715d DE |
2510 | app_on = 1; |
2511 | } | |
2512 | fprintf (asm_out_file, "\t%s\n", XSTR (body, 0)); | |
2513 | break; | |
2514 | } | |
2515 | ||
2516 | /* Detect `asm' construct with operands. */ | |
2517 | if (asm_noperands (body) >= 0) | |
2518 | { | |
22bf4422 | 2519 | unsigned int noperands = asm_noperands (body); |
3cf2715d DE |
2520 | rtx *ops = (rtx *) alloca (noperands * sizeof (rtx)); |
2521 | char *string; | |
2522 | ||
2523 | /* There's no telling what that did to the condition codes. */ | |
2524 | CC_STATUS_INIT; | |
2525 | if (prescan > 0) | |
2526 | break; | |
2527 | ||
2528 | if (! app_on) | |
2529 | { | |
51723711 | 2530 | fputs (ASM_APP_ON, file); |
3cf2715d DE |
2531 | app_on = 1; |
2532 | } | |
2533 | ||
2534 | /* Get out the operand values. */ | |
2535 | string = decode_asm_operands (body, ops, NULL_PTR, | |
2536 | NULL_PTR, NULL_PTR); | |
2537 | /* Inhibit aborts on what would otherwise be compiler bugs. */ | |
2538 | insn_noperands = noperands; | |
2539 | this_is_asm_operands = insn; | |
2540 | ||
2541 | /* Output the insn using them. */ | |
2542 | output_asm_insn (string, ops); | |
2543 | this_is_asm_operands = 0; | |
2544 | break; | |
2545 | } | |
2546 | ||
2547 | if (prescan <= 0 && app_on) | |
2548 | { | |
51723711 | 2549 | fputs (ASM_APP_OFF, file); |
3cf2715d DE |
2550 | app_on = 0; |
2551 | } | |
2552 | ||
2553 | if (GET_CODE (body) == SEQUENCE) | |
2554 | { | |
2555 | /* A delayed-branch sequence */ | |
2556 | register int i; | |
2557 | rtx next; | |
2558 | ||
2559 | if (prescan > 0) | |
2560 | break; | |
2561 | final_sequence = body; | |
2562 | ||
2563 | /* The first insn in this SEQUENCE might be a JUMP_INSN that will | |
2564 | force the restoration of a comparison that was previously | |
2565 | thought unnecessary. If that happens, cancel this sequence | |
2566 | and cause that insn to be restored. */ | |
2567 | ||
2568 | next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1); | |
2569 | if (next != XVECEXP (body, 0, 1)) | |
2570 | { | |
2571 | final_sequence = 0; | |
2572 | return next; | |
2573 | } | |
2574 | ||
2575 | for (i = 1; i < XVECLEN (body, 0); i++) | |
c7eee2df RK |
2576 | { |
2577 | rtx insn = XVECEXP (body, 0, i); | |
2578 | rtx next = NEXT_INSN (insn); | |
2579 | /* We loop in case any instruction in a delay slot gets | |
2580 | split. */ | |
2581 | do | |
2582 | insn = final_scan_insn (insn, file, 0, prescan, 1); | |
2583 | while (insn != next); | |
2584 | } | |
3cf2715d DE |
2585 | #ifdef DBR_OUTPUT_SEQEND |
2586 | DBR_OUTPUT_SEQEND (file); | |
2587 | #endif | |
2588 | final_sequence = 0; | |
2589 | ||
2590 | /* If the insn requiring the delay slot was a CALL_INSN, the | |
2591 | insns in the delay slot are actually executed before the | |
2592 | called function. Hence we don't preserve any CC-setting | |
2593 | actions in these insns and the CC must be marked as being | |
2594 | clobbered by the function. */ | |
2595 | if (GET_CODE (XVECEXP (body, 0, 0)) == CALL_INSN) | |
b729186a JL |
2596 | { |
2597 | CC_STATUS_INIT; | |
2598 | } | |
3cf2715d DE |
2599 | |
2600 | /* Following a conditional branch sequence, we have a new basic | |
2601 | block. */ | |
2602 | if (profile_block_flag) | |
2603 | { | |
2604 | rtx insn = XVECEXP (body, 0, 0); | |
2605 | rtx body = PATTERN (insn); | |
2606 | ||
2607 | if ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET | |
2608 | && GET_CODE (SET_SRC (body)) != LABEL_REF) | |
2609 | || (GET_CODE (insn) == JUMP_INSN | |
2610 | && GET_CODE (body) == PARALLEL | |
2611 | && GET_CODE (XVECEXP (body, 0, 0)) == SET | |
2612 | && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF)) | |
2613 | new_block = 1; | |
2614 | } | |
2615 | break; | |
2616 | } | |
2617 | ||
2618 | /* We have a real machine instruction as rtl. */ | |
2619 | ||
2620 | body = PATTERN (insn); | |
2621 | ||
2622 | #ifdef HAVE_cc0 | |
b88c92cc RK |
2623 | set = single_set(insn); |
2624 | ||
3cf2715d DE |
2625 | /* Check for redundant test and compare instructions |
2626 | (when the condition codes are already set up as desired). | |
2627 | This is done only when optimizing; if not optimizing, | |
2628 | it should be possible for the user to alter a variable | |
2629 | with the debugger in between statements | |
2630 | and the next statement should reexamine the variable | |
2631 | to compute the condition codes. */ | |
2632 | ||
30f5e9f5 | 2633 | if (optimize) |
3cf2715d | 2634 | { |
b88c92cc | 2635 | #if 0 |
30f5e9f5 | 2636 | rtx set = single_set(insn); |
b88c92cc | 2637 | #endif |
30f5e9f5 RK |
2638 | |
2639 | if (set | |
2640 | && GET_CODE (SET_DEST (set)) == CC0 | |
2641 | && insn != last_ignored_compare) | |
3cf2715d | 2642 | { |
30f5e9f5 RK |
2643 | if (GET_CODE (SET_SRC (set)) == SUBREG) |
2644 | SET_SRC (set) = alter_subreg (SET_SRC (set)); | |
2645 | else if (GET_CODE (SET_SRC (set)) == COMPARE) | |
2646 | { | |
2647 | if (GET_CODE (XEXP (SET_SRC (set), 0)) == SUBREG) | |
2648 | XEXP (SET_SRC (set), 0) | |
2649 | = alter_subreg (XEXP (SET_SRC (set), 0)); | |
2650 | if (GET_CODE (XEXP (SET_SRC (set), 1)) == SUBREG) | |
2651 | XEXP (SET_SRC (set), 1) | |
2652 | = alter_subreg (XEXP (SET_SRC (set), 1)); | |
2653 | } | |
2654 | if ((cc_status.value1 != 0 | |
2655 | && rtx_equal_p (SET_SRC (set), cc_status.value1)) | |
2656 | || (cc_status.value2 != 0 | |
2657 | && rtx_equal_p (SET_SRC (set), cc_status.value2))) | |
3cf2715d | 2658 | { |
30f5e9f5 RK |
2659 | /* Don't delete insn if it has an addressing side-effect. */ |
2660 | if (! FIND_REG_INC_NOTE (insn, 0) | |
2661 | /* or if anything in it is volatile. */ | |
2662 | && ! volatile_refs_p (PATTERN (insn))) | |
2663 | { | |
2664 | /* We don't really delete the insn; just ignore it. */ | |
2665 | last_ignored_compare = insn; | |
2666 | break; | |
2667 | } | |
3cf2715d DE |
2668 | } |
2669 | } | |
2670 | } | |
2671 | #endif | |
2672 | ||
2673 | /* Following a conditional branch, we have a new basic block. | |
2674 | But if we are inside a sequence, the new block starts after the | |
2675 | last insn of the sequence. */ | |
2676 | if (profile_block_flag && final_sequence == 0 | |
2677 | && ((GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == SET | |
2678 | && GET_CODE (SET_SRC (body)) != LABEL_REF) | |
2679 | || (GET_CODE (insn) == JUMP_INSN && GET_CODE (body) == PARALLEL | |
2680 | && GET_CODE (XVECEXP (body, 0, 0)) == SET | |
2681 | && GET_CODE (SET_SRC (XVECEXP (body, 0, 0))) != LABEL_REF))) | |
2682 | new_block = 1; | |
2683 | ||
2684 | #ifndef STACK_REGS | |
2685 | /* Don't bother outputting obvious no-ops, even without -O. | |
2686 | This optimization is fast and doesn't interfere with debugging. | |
2687 | Don't do this if the insn is in a delay slot, since this | |
2688 | will cause an improper number of delay insns to be written. */ | |
2689 | if (final_sequence == 0 | |
2690 | && prescan >= 0 | |
2691 | && GET_CODE (insn) == INSN && GET_CODE (body) == SET | |
2692 | && GET_CODE (SET_SRC (body)) == REG | |
2693 | && GET_CODE (SET_DEST (body)) == REG | |
2694 | && REGNO (SET_SRC (body)) == REGNO (SET_DEST (body))) | |
2695 | break; | |
2696 | #endif | |
2697 | ||
2698 | #ifdef HAVE_cc0 | |
2699 | /* If this is a conditional branch, maybe modify it | |
2700 | if the cc's are in a nonstandard state | |
2701 | so that it accomplishes the same thing that it would | |
2702 | do straightforwardly if the cc's were set up normally. */ | |
2703 | ||
2704 | if (cc_status.flags != 0 | |
2705 | && GET_CODE (insn) == JUMP_INSN | |
2706 | && GET_CODE (body) == SET | |
2707 | && SET_DEST (body) == pc_rtx | |
2708 | && GET_CODE (SET_SRC (body)) == IF_THEN_ELSE | |
de2b56f9 | 2709 | && GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (body), 0))) == '<' |
fff752ad | 2710 | && XEXP (XEXP (SET_SRC (body), 0), 0) == cc0_rtx |
3cf2715d DE |
2711 | /* This is done during prescan; it is not done again |
2712 | in final scan when prescan has been done. */ | |
2713 | && prescan >= 0) | |
2714 | { | |
2715 | /* This function may alter the contents of its argument | |
2716 | and clear some of the cc_status.flags bits. | |
2717 | It may also return 1 meaning condition now always true | |
2718 | or -1 meaning condition now always false | |
2719 | or 2 meaning condition nontrivial but altered. */ | |
2720 | register int result = alter_cond (XEXP (SET_SRC (body), 0)); | |
2721 | /* If condition now has fixed value, replace the IF_THEN_ELSE | |
2722 | with its then-operand or its else-operand. */ | |
2723 | if (result == 1) | |
2724 | SET_SRC (body) = XEXP (SET_SRC (body), 1); | |
2725 | if (result == -1) | |
2726 | SET_SRC (body) = XEXP (SET_SRC (body), 2); | |
2727 | ||
2728 | /* The jump is now either unconditional or a no-op. | |
2729 | If it has become a no-op, don't try to output it. | |
2730 | (It would not be recognized.) */ | |
2731 | if (SET_SRC (body) == pc_rtx) | |
2732 | { | |
2733 | PUT_CODE (insn, NOTE); | |
2734 | NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED; | |
2735 | NOTE_SOURCE_FILE (insn) = 0; | |
2736 | break; | |
2737 | } | |
2738 | else if (GET_CODE (SET_SRC (body)) == RETURN) | |
2739 | /* Replace (set (pc) (return)) with (return). */ | |
2740 | PATTERN (insn) = body = SET_SRC (body); | |
2741 | ||
2742 | /* Rerecognize the instruction if it has changed. */ | |
2743 | if (result != 0) | |
2744 | INSN_CODE (insn) = -1; | |
2745 | } | |
2746 | ||
2747 | /* Make same adjustments to instructions that examine the | |
462da2af SC |
2748 | condition codes without jumping and instructions that |
2749 | handle conditional moves (if this machine has either one). */ | |
3cf2715d DE |
2750 | |
2751 | if (cc_status.flags != 0 | |
b88c92cc | 2752 | && set != 0) |
3cf2715d | 2753 | { |
462da2af SC |
2754 | rtx cond_rtx, then_rtx, else_rtx; |
2755 | ||
2756 | if (GET_CODE (insn) != JUMP_INSN | |
b88c92cc | 2757 | && GET_CODE (SET_SRC (set)) == IF_THEN_ELSE) |
462da2af | 2758 | { |
b88c92cc RK |
2759 | cond_rtx = XEXP (SET_SRC (set), 0); |
2760 | then_rtx = XEXP (SET_SRC (set), 1); | |
2761 | else_rtx = XEXP (SET_SRC (set), 2); | |
462da2af SC |
2762 | } |
2763 | else | |
2764 | { | |
b88c92cc | 2765 | cond_rtx = SET_SRC (set); |
462da2af SC |
2766 | then_rtx = const_true_rtx; |
2767 | else_rtx = const0_rtx; | |
2768 | } | |
2769 | ||
2770 | switch (GET_CODE (cond_rtx)) | |
3cf2715d DE |
2771 | { |
2772 | case GTU: | |
2773 | case GT: | |
2774 | case LTU: | |
2775 | case LT: | |
2776 | case GEU: | |
2777 | case GE: | |
2778 | case LEU: | |
2779 | case LE: | |
2780 | case EQ: | |
2781 | case NE: | |
2782 | { | |
2783 | register int result; | |
462da2af | 2784 | if (XEXP (cond_rtx, 0) != cc0_rtx) |
3cf2715d | 2785 | break; |
462da2af | 2786 | result = alter_cond (cond_rtx); |
3cf2715d | 2787 | if (result == 1) |
b88c92cc | 2788 | validate_change (insn, &SET_SRC (set), then_rtx, 0); |
3cf2715d | 2789 | else if (result == -1) |
b88c92cc | 2790 | validate_change (insn, &SET_SRC (set), else_rtx, 0); |
3cf2715d DE |
2791 | else if (result == 2) |
2792 | INSN_CODE (insn) = -1; | |
b88c92cc | 2793 | if (SET_DEST (set) == SET_SRC (set)) |
462da2af SC |
2794 | { |
2795 | PUT_CODE (insn, NOTE); | |
2796 | NOTE_LINE_NUMBER (insn) = NOTE_INSN_DELETED; | |
2797 | NOTE_SOURCE_FILE (insn) = 0; | |
462da2af | 2798 | } |
3cf2715d | 2799 | } |
e9a25f70 JL |
2800 | break; |
2801 | ||
2802 | default: | |
2803 | break; | |
3cf2715d DE |
2804 | } |
2805 | } | |
462da2af | 2806 | |
3cf2715d DE |
2807 | #endif |
2808 | ||
2809 | /* Do machine-specific peephole optimizations if desired. */ | |
2810 | ||
2811 | if (optimize && !flag_no_peephole && !nopeepholes) | |
2812 | { | |
2813 | rtx next = peephole (insn); | |
2814 | /* When peepholing, if there were notes within the peephole, | |
2815 | emit them before the peephole. */ | |
2816 | if (next != 0 && next != NEXT_INSN (insn)) | |
2817 | { | |
2818 | rtx prev = PREV_INSN (insn); | |
2819 | rtx note; | |
2820 | ||
2821 | for (note = NEXT_INSN (insn); note != next; | |
2822 | note = NEXT_INSN (note)) | |
2823 | final_scan_insn (note, file, optimize, prescan, nopeepholes); | |
2824 | ||
2825 | /* In case this is prescan, put the notes | |
2826 | in proper position for later rescan. */ | |
2827 | note = NEXT_INSN (insn); | |
2828 | PREV_INSN (note) = prev; | |
2829 | NEXT_INSN (prev) = note; | |
2830 | NEXT_INSN (PREV_INSN (next)) = insn; | |
2831 | PREV_INSN (insn) = PREV_INSN (next); | |
2832 | NEXT_INSN (insn) = next; | |
2833 | PREV_INSN (next) = insn; | |
2834 | } | |
2835 | ||
2836 | /* PEEPHOLE might have changed this. */ | |
2837 | body = PATTERN (insn); | |
2838 | } | |
2839 | ||
2840 | /* Try to recognize the instruction. | |
2841 | If successful, verify that the operands satisfy the | |
2842 | constraints for the instruction. Crash if they don't, | |
2843 | since `reload' should have changed them so that they do. */ | |
2844 | ||
2845 | insn_code_number = recog_memoized (insn); | |
2846 | insn_extract (insn); | |
0304f787 | 2847 | cleanup_subreg_operands (insn); |
3cf2715d DE |
2848 | |
2849 | #ifdef REGISTER_CONSTRAINTS | |
2850 | if (! constrain_operands (insn_code_number, 1)) | |
2851 | fatal_insn_not_found (insn); | |
2852 | #endif | |
2853 | ||
2854 | /* Some target machines need to prescan each insn before | |
2855 | it is output. */ | |
2856 | ||
2857 | #ifdef FINAL_PRESCAN_INSN | |
2858 | FINAL_PRESCAN_INSN (insn, recog_operand, | |
2859 | insn_n_operands[insn_code_number]); | |
2860 | #endif | |
2861 | ||
2862 | #ifdef HAVE_cc0 | |
2863 | cc_prev_status = cc_status; | |
2864 | ||
2865 | /* Update `cc_status' for this instruction. | |
2866 | The instruction's output routine may change it further. | |
2867 | If the output routine for a jump insn needs to depend | |
2868 | on the cc status, it should look at cc_prev_status. */ | |
2869 | ||
2870 | NOTICE_UPDATE_CC (body, insn); | |
2871 | #endif | |
2872 | ||
2873 | debug_insn = insn; | |
2874 | ||
b57d9225 JM |
2875 | #if defined (DWARF2_UNWIND_INFO) && !defined (ACCUMULATE_OUTGOING_ARGS) |
2876 | /* If we push arguments, we want to know where the calls are. */ | |
2877 | if (GET_CODE (insn) == CALL_INSN && dwarf2out_do_frame ()) | |
2878 | dwarf2out_frame_debug (insn); | |
2879 | #endif | |
2880 | ||
3cf2715d DE |
2881 | /* If the proper template needs to be chosen by some C code, |
2882 | run that code and get the real template. */ | |
2883 | ||
2884 | template = insn_template[insn_code_number]; | |
2885 | if (template == 0) | |
2886 | { | |
2887 | template = (*insn_outfun[insn_code_number]) (recog_operand, insn); | |
2888 | ||
2889 | /* If the C code returns 0, it means that it is a jump insn | |
2890 | which follows a deleted test insn, and that test insn | |
2891 | needs to be reinserted. */ | |
2892 | if (template == 0) | |
2893 | { | |
2894 | if (prev_nonnote_insn (insn) != last_ignored_compare) | |
2895 | abort (); | |
2896 | new_block = 0; | |
2897 | return prev_nonnote_insn (insn); | |
2898 | } | |
2899 | } | |
2900 | ||
2901 | /* If the template is the string "#", it means that this insn must | |
2902 | be split. */ | |
2903 | if (template[0] == '#' && template[1] == '\0') | |
2904 | { | |
2905 | rtx new = try_split (body, insn, 0); | |
2906 | ||
2907 | /* If we didn't split the insn, go away. */ | |
2908 | if (new == insn && PATTERN (new) == body) | |
cf879efa | 2909 | fatal_insn ("Could not split insn", insn); |
3cf2715d | 2910 | |
3d14e82f JW |
2911 | #ifdef HAVE_ATTR_length |
2912 | /* This instruction should have been split in shorten_branches, | |
2913 | to ensure that we would have valid length info for the | |
2914 | splitees. */ | |
2915 | abort (); | |
2916 | #endif | |
2917 | ||
3cf2715d DE |
2918 | new_block = 0; |
2919 | return new; | |
2920 | } | |
2921 | ||
2922 | if (prescan > 0) | |
2923 | break; | |
2924 | ||
2925 | /* Output assembler code from the template. */ | |
2926 | ||
2927 | output_asm_insn (template, recog_operand); | |
2928 | ||
0021b564 JM |
2929 | #if defined (DWARF2_UNWIND_INFO) |
2930 | #if !defined (ACCUMULATE_OUTGOING_ARGS) | |
2931 | /* If we push arguments, we need to check all insns for stack | |
2932 | adjustments. */ | |
b57d9225 | 2933 | if (GET_CODE (insn) == INSN && dwarf2out_do_frame ()) |
0021b564 JM |
2934 | dwarf2out_frame_debug (insn); |
2935 | #else | |
2936 | #if defined (HAVE_prologue) | |
469ac993 JM |
2937 | /* If this insn is part of the prologue, emit DWARF v2 |
2938 | call frame info. */ | |
0021b564 | 2939 | if (RTX_FRAME_RELATED_P (insn) && dwarf2out_do_frame ()) |
469ac993 JM |
2940 | dwarf2out_frame_debug (insn); |
2941 | #endif | |
0021b564 JM |
2942 | #endif |
2943 | #endif | |
469ac993 | 2944 | |
3cf2715d DE |
2945 | #if 0 |
2946 | /* It's not at all clear why we did this and doing so interferes | |
2947 | with tests we'd like to do to use REG_WAS_0 notes, so let's try | |
2948 | with this out. */ | |
2949 | ||
2950 | /* Mark this insn as having been output. */ | |
2951 | INSN_DELETED_P (insn) = 1; | |
2952 | #endif | |
2953 | ||
2954 | debug_insn = 0; | |
2955 | } | |
2956 | } | |
2957 | return NEXT_INSN (insn); | |
2958 | } | |
2959 | \f | |
2960 | /* Output debugging info to the assembler file FILE | |
2961 | based on the NOTE-insn INSN, assumed to be a line number. */ | |
2962 | ||
2963 | static void | |
2964 | output_source_line (file, insn) | |
2965 | FILE *file; | |
2966 | rtx insn; | |
2967 | { | |
2968 | register char *filename = NOTE_SOURCE_FILE (insn); | |
2969 | ||
2970 | /* Remember filename for basic block profiling. | |
2971 | Filenames are allocated on the permanent obstack | |
2972 | or are passed in ARGV, so we don't have to save | |
2973 | the string. */ | |
2974 | ||
2975 | if (profile_block_flag && last_filename != filename) | |
2976 | bb_file_label_num = add_bb_string (filename, TRUE); | |
2977 | ||
2978 | last_filename = filename; | |
2979 | last_linenum = NOTE_LINE_NUMBER (insn); | |
eac40081 RK |
2980 | high_block_linenum = MAX (last_linenum, high_block_linenum); |
2981 | high_function_linenum = MAX (last_linenum, high_function_linenum); | |
3cf2715d DE |
2982 | |
2983 | if (write_symbols != NO_DEBUG) | |
2984 | { | |
2985 | #ifdef SDB_DEBUGGING_INFO | |
2986 | if (write_symbols == SDB_DEBUG | |
2987 | #if 0 /* People like having line numbers even in wrong file! */ | |
2988 | /* COFF can't handle multiple source files--lose, lose. */ | |
2989 | && !strcmp (filename, main_input_filename) | |
2990 | #endif | |
2991 | /* COFF relative line numbers must be positive. */ | |
2992 | && last_linenum > sdb_begin_function_line) | |
2993 | { | |
2994 | #ifdef ASM_OUTPUT_SOURCE_LINE | |
2995 | ASM_OUTPUT_SOURCE_LINE (file, last_linenum); | |
2996 | #else | |
2997 | fprintf (file, "\t.ln\t%d\n", | |
2998 | ((sdb_begin_function_line > -1) | |
2999 | ? last_linenum - sdb_begin_function_line : 1)); | |
3000 | #endif | |
3001 | } | |
3002 | #endif | |
3003 | ||
3004 | #if defined (DBX_DEBUGGING_INFO) | |
3005 | if (write_symbols == DBX_DEBUG) | |
3006 | dbxout_source_line (file, filename, NOTE_LINE_NUMBER (insn)); | |
3007 | #endif | |
3008 | ||
3009 | #if defined (XCOFF_DEBUGGING_INFO) | |
3010 | if (write_symbols == XCOFF_DEBUG) | |
3011 | xcoffout_source_line (file, filename, insn); | |
3012 | #endif | |
3013 | ||
3014 | #ifdef DWARF_DEBUGGING_INFO | |
3015 | if (write_symbols == DWARF_DEBUG) | |
3016 | dwarfout_line (filename, NOTE_LINE_NUMBER (insn)); | |
3017 | #endif | |
9a666dda JM |
3018 | |
3019 | #ifdef DWARF2_DEBUGGING_INFO | |
3020 | if (write_symbols == DWARF2_DEBUG) | |
3021 | dwarf2out_line (filename, NOTE_LINE_NUMBER (insn)); | |
3022 | #endif | |
3cf2715d DE |
3023 | } |
3024 | } | |
3025 | \f | |
0304f787 JL |
3026 | |
3027 | /* For each operand in INSN, simplify (subreg (reg)) so that it refers | |
3028 | directly to the desired hard register. */ | |
3029 | void | |
3030 | cleanup_subreg_operands (insn) | |
3031 | rtx insn; | |
3032 | { | |
3033 | int insn_code_number, i; | |
3034 | ||
3035 | /* Ignore things we can not handle. */ | |
3036 | if (GET_RTX_CLASS (GET_CODE (insn)) != 'i' | |
3037 | || GET_CODE (PATTERN (insn)) == USE | |
3038 | || GET_CODE (PATTERN (insn)) == ADDR_VEC | |
3039 | || GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC | |
8f142c0b | 3040 | || GET_CODE (PATTERN (insn)) == ASM_INPUT |
0304f787 JL |
3041 | || asm_noperands (PATTERN (insn)) >= 0) |
3042 | return; | |
3043 | ||
3044 | /* Try to recognize the instruction. | |
3045 | If successful, verify that the operands satisfy the | |
3046 | constraints for the instruction. Crash if they don't, | |
3047 | since `reload' should have changed them so that they do. */ | |
3048 | ||
3049 | insn_code_number = recog_memoized (insn); | |
3050 | insn_extract (insn); | |
3051 | for (i = 0; i < insn_n_operands[insn_code_number]; i++) | |
3052 | { | |
3053 | if (GET_CODE (recog_operand[i]) == SUBREG) | |
3054 | recog_operand[i] = alter_subreg (recog_operand[i]); | |
3055 | else if (GET_CODE (recog_operand[i]) == PLUS | |
3056 | || GET_CODE (recog_operand[i]) == MULT) | |
3057 | recog_operand[i] = walk_alter_subreg (recog_operand[i]); | |
3058 | } | |
3059 | ||
3060 | for (i = 0; i < insn_n_dups[insn_code_number]; i++) | |
3061 | { | |
3062 | if (GET_CODE (*recog_dup_loc[i]) == SUBREG) | |
3063 | *recog_dup_loc[i] = alter_subreg (*recog_dup_loc[i]); | |
3064 | else if (GET_CODE (*recog_dup_loc[i]) == PLUS | |
3065 | || GET_CODE (*recog_dup_loc[i]) == MULT) | |
3066 | *recog_dup_loc[i] = walk_alter_subreg (*recog_dup_loc[i]); | |
3067 | } | |
3068 | } | |
3069 | ||
3cf2715d DE |
3070 | /* If X is a SUBREG, replace it with a REG or a MEM, |
3071 | based on the thing it is a subreg of. */ | |
3072 | ||
3073 | rtx | |
3074 | alter_subreg (x) | |
3075 | register rtx x; | |
3076 | { | |
3077 | register rtx y = SUBREG_REG (x); | |
f5963e61 | 3078 | |
3cf2715d DE |
3079 | if (GET_CODE (y) == SUBREG) |
3080 | y = alter_subreg (y); | |
3081 | ||
f5963e61 JL |
3082 | /* If reload is operating, we may be replacing inside this SUBREG. |
3083 | Check for that and make a new one if so. */ | |
3084 | if (reload_in_progress && find_replacement (&SUBREG_REG (x)) != 0) | |
3085 | x = copy_rtx (x); | |
3086 | ||
3cf2715d DE |
3087 | if (GET_CODE (y) == REG) |
3088 | { | |
ce4d78eb RH |
3089 | /* If the word size is larger than the size of this register, |
3090 | adjust the register number to compensate. */ | |
3091 | /* ??? Note that this just catches stragglers created by/for | |
3092 | integrate. It would be better if we either caught these | |
3093 | earlier, or kept _all_ subregs until now and eliminate | |
3094 | gen_lowpart and friends. */ | |
3095 | ||
3cf2715d | 3096 | PUT_CODE (x, REG); |
ce4d78eb RH |
3097 | #ifdef ALTER_HARD_SUBREG |
3098 | REGNO (x) = ALTER_HARD_SUBREG(GET_MODE (x), SUBREG_WORD (x), | |
3099 | GET_MODE (y), REGNO (y)); | |
3100 | #else | |
3cf2715d | 3101 | REGNO (x) = REGNO (y) + SUBREG_WORD (x); |
ce4d78eb | 3102 | #endif |
0304f787 JL |
3103 | /* This field has a different meaning for REGs and SUBREGs. Make sure |
3104 | to clear it! */ | |
3105 | x->used = 0; | |
3cf2715d DE |
3106 | } |
3107 | else if (GET_CODE (y) == MEM) | |
3108 | { | |
3109 | register int offset = SUBREG_WORD (x) * UNITS_PER_WORD; | |
f76b9db2 ILT |
3110 | if (BYTES_BIG_ENDIAN) |
3111 | offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x))) | |
3112 | - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (y)))); | |
3cf2715d DE |
3113 | PUT_CODE (x, MEM); |
3114 | MEM_VOLATILE_P (x) = MEM_VOLATILE_P (y); | |
41472af8 MM |
3115 | MEM_IN_STRUCT_P (x) = MEM_IN_STRUCT_P (y); |
3116 | MEM_ALIAS_SET (x) = MEM_ALIAS_SET (y); | |
3cf2715d DE |
3117 | XEXP (x, 0) = plus_constant (XEXP (y, 0), offset); |
3118 | } | |
3119 | ||
3120 | return x; | |
3121 | } | |
3122 | ||
3123 | /* Do alter_subreg on all the SUBREGs contained in X. */ | |
3124 | ||
3125 | static rtx | |
3126 | walk_alter_subreg (x) | |
3127 | rtx x; | |
3128 | { | |
3129 | switch (GET_CODE (x)) | |
3130 | { | |
3131 | case PLUS: | |
3132 | case MULT: | |
3133 | XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0)); | |
3134 | XEXP (x, 1) = walk_alter_subreg (XEXP (x, 1)); | |
3135 | break; | |
3136 | ||
3137 | case MEM: | |
3138 | XEXP (x, 0) = walk_alter_subreg (XEXP (x, 0)); | |
3139 | break; | |
3140 | ||
3141 | case SUBREG: | |
3142 | return alter_subreg (x); | |
e9a25f70 JL |
3143 | |
3144 | default: | |
3145 | break; | |
3cf2715d DE |
3146 | } |
3147 | ||
3148 | return x; | |
3149 | } | |
3150 | \f | |
3151 | #ifdef HAVE_cc0 | |
3152 | ||
3153 | /* Given BODY, the body of a jump instruction, alter the jump condition | |
3154 | as required by the bits that are set in cc_status.flags. | |
3155 | Not all of the bits there can be handled at this level in all cases. | |
3156 | ||
3157 | The value is normally 0. | |
3158 | 1 means that the condition has become always true. | |
3159 | -1 means that the condition has become always false. | |
3160 | 2 means that COND has been altered. */ | |
3161 | ||
3162 | static int | |
3163 | alter_cond (cond) | |
3164 | register rtx cond; | |
3165 | { | |
3166 | int value = 0; | |
3167 | ||
3168 | if (cc_status.flags & CC_REVERSED) | |
3169 | { | |
3170 | value = 2; | |
3171 | PUT_CODE (cond, swap_condition (GET_CODE (cond))); | |
3172 | } | |
3173 | ||
3174 | if (cc_status.flags & CC_INVERTED) | |
3175 | { | |
3176 | value = 2; | |
3177 | PUT_CODE (cond, reverse_condition (GET_CODE (cond))); | |
3178 | } | |
3179 | ||
3180 | if (cc_status.flags & CC_NOT_POSITIVE) | |
3181 | switch (GET_CODE (cond)) | |
3182 | { | |
3183 | case LE: | |
3184 | case LEU: | |
3185 | case GEU: | |
3186 | /* Jump becomes unconditional. */ | |
3187 | return 1; | |
3188 | ||
3189 | case GT: | |
3190 | case GTU: | |
3191 | case LTU: | |
3192 | /* Jump becomes no-op. */ | |
3193 | return -1; | |
3194 | ||
3195 | case GE: | |
3196 | PUT_CODE (cond, EQ); | |
3197 | value = 2; | |
3198 | break; | |
3199 | ||
3200 | case LT: | |
3201 | PUT_CODE (cond, NE); | |
3202 | value = 2; | |
3203 | break; | |
e9a25f70 JL |
3204 | |
3205 | default: | |
3206 | break; | |
3cf2715d DE |
3207 | } |
3208 | ||
3209 | if (cc_status.flags & CC_NOT_NEGATIVE) | |
3210 | switch (GET_CODE (cond)) | |
3211 | { | |
3212 | case GE: | |
3213 | case GEU: | |
3214 | /* Jump becomes unconditional. */ | |
3215 | return 1; | |
3216 | ||
3217 | case LT: | |
3218 | case LTU: | |
3219 | /* Jump becomes no-op. */ | |
3220 | return -1; | |
3221 | ||
3222 | case LE: | |
3223 | case LEU: | |
3224 | PUT_CODE (cond, EQ); | |
3225 | value = 2; | |
3226 | break; | |
3227 | ||
3228 | case GT: | |
3229 | case GTU: | |
3230 | PUT_CODE (cond, NE); | |
3231 | value = 2; | |
3232 | break; | |
e9a25f70 JL |
3233 | |
3234 | default: | |
3235 | break; | |
3cf2715d DE |
3236 | } |
3237 | ||
3238 | if (cc_status.flags & CC_NO_OVERFLOW) | |
3239 | switch (GET_CODE (cond)) | |
3240 | { | |
3241 | case GEU: | |
3242 | /* Jump becomes unconditional. */ | |
3243 | return 1; | |
3244 | ||
3245 | case LEU: | |
3246 | PUT_CODE (cond, EQ); | |
3247 | value = 2; | |
3248 | break; | |
3249 | ||
3250 | case GTU: | |
3251 | PUT_CODE (cond, NE); | |
3252 | value = 2; | |
3253 | break; | |
3254 | ||
3255 | case LTU: | |
3256 | /* Jump becomes no-op. */ | |
3257 | return -1; | |
e9a25f70 JL |
3258 | |
3259 | default: | |
3260 | break; | |
3cf2715d DE |
3261 | } |
3262 | ||
3263 | if (cc_status.flags & (CC_Z_IN_NOT_N | CC_Z_IN_N)) | |
3264 | switch (GET_CODE (cond)) | |
3265 | { | |
e9a25f70 | 3266 | default: |
3cf2715d DE |
3267 | abort (); |
3268 | ||
3269 | case NE: | |
3270 | PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? GE : LT); | |
3271 | value = 2; | |
3272 | break; | |
3273 | ||
3274 | case EQ: | |
3275 | PUT_CODE (cond, cc_status.flags & CC_Z_IN_N ? LT : GE); | |
3276 | value = 2; | |
3277 | break; | |
3278 | } | |
3279 | ||
3280 | if (cc_status.flags & CC_NOT_SIGNED) | |
3281 | /* The flags are valid if signed condition operators are converted | |
3282 | to unsigned. */ | |
3283 | switch (GET_CODE (cond)) | |
3284 | { | |
3285 | case LE: | |
3286 | PUT_CODE (cond, LEU); | |
3287 | value = 2; | |
3288 | break; | |
3289 | ||
3290 | case LT: | |
3291 | PUT_CODE (cond, LTU); | |
3292 | value = 2; | |
3293 | break; | |
3294 | ||
3295 | case GT: | |
3296 | PUT_CODE (cond, GTU); | |
3297 | value = 2; | |
3298 | break; | |
3299 | ||
3300 | case GE: | |
3301 | PUT_CODE (cond, GEU); | |
3302 | value = 2; | |
3303 | break; | |
e9a25f70 JL |
3304 | |
3305 | default: | |
3306 | break; | |
3cf2715d DE |
3307 | } |
3308 | ||
3309 | return value; | |
3310 | } | |
3311 | #endif | |
3312 | \f | |
3313 | /* Report inconsistency between the assembler template and the operands. | |
3314 | In an `asm', it's the user's fault; otherwise, the compiler's fault. */ | |
3315 | ||
3316 | void | |
3317 | output_operand_lossage (str) | |
3318 | char *str; | |
3319 | { | |
3320 | if (this_is_asm_operands) | |
3321 | error_for_asm (this_is_asm_operands, "invalid `asm': %s", str); | |
3322 | else | |
31bfbf1f | 3323 | fatal ("Internal compiler error, output_operand_lossage `%s'", str); |
3cf2715d DE |
3324 | } |
3325 | \f | |
3326 | /* Output of assembler code from a template, and its subroutines. */ | |
3327 | ||
3328 | /* Output text from TEMPLATE to the assembler output file, | |
3329 | obeying %-directions to substitute operands taken from | |
3330 | the vector OPERANDS. | |
3331 | ||
3332 | %N (for N a digit) means print operand N in usual manner. | |
3333 | %lN means require operand N to be a CODE_LABEL or LABEL_REF | |
3334 | and print the label name with no punctuation. | |
3335 | %cN means require operand N to be a constant | |
3336 | and print the constant expression with no punctuation. | |
3337 | %aN means expect operand N to be a memory address | |
3338 | (not a memory reference!) and print a reference | |
3339 | to that address. | |
3340 | %nN means expect operand N to be a constant | |
3341 | and print a constant expression for minus the value | |
3342 | of the operand, with no other punctuation. */ | |
3343 | ||
cb649530 RK |
3344 | static void |
3345 | output_asm_name () | |
3346 | { | |
3347 | if (flag_print_asm_name) | |
3348 | { | |
3349 | /* Annotate the assembly with a comment describing the pattern and | |
3350 | alternative used. */ | |
3351 | if (debug_insn) | |
3352 | { | |
3353 | register int num = INSN_CODE (debug_insn); | |
3354 | fprintf (asm_out_file, " %s %d %s", | |
3355 | ASM_COMMENT_START, INSN_UID (debug_insn), insn_name[num]); | |
3356 | if (insn_n_alternatives[num] > 1) | |
3357 | fprintf (asm_out_file, "/%d", which_alternative + 1); | |
3358 | ||
3359 | /* Clear this so only the first assembler insn | |
3360 | of any rtl insn will get the special comment for -dp. */ | |
3361 | debug_insn = 0; | |
3362 | } | |
3363 | } | |
3364 | } | |
3365 | ||
3cf2715d DE |
3366 | void |
3367 | output_asm_insn (template, operands) | |
3368 | char *template; | |
3369 | rtx *operands; | |
3370 | { | |
3371 | register char *p; | |
b729186a | 3372 | register int c; |
3cf2715d DE |
3373 | |
3374 | /* An insn may return a null string template | |
3375 | in a case where no assembler code is needed. */ | |
3376 | if (*template == 0) | |
3377 | return; | |
3378 | ||
3379 | p = template; | |
3380 | putc ('\t', asm_out_file); | |
3381 | ||
3382 | #ifdef ASM_OUTPUT_OPCODE | |
3383 | ASM_OUTPUT_OPCODE (asm_out_file, p); | |
3384 | #endif | |
3385 | ||
b729186a | 3386 | while ((c = *p++)) |
3cf2715d DE |
3387 | switch (c) |
3388 | { | |
3cf2715d | 3389 | case '\n': |
cb649530 | 3390 | output_asm_name (); |
3cf2715d | 3391 | putc (c, asm_out_file); |
cb649530 | 3392 | #ifdef ASM_OUTPUT_OPCODE |
3cf2715d DE |
3393 | while ((c = *p) == '\t') |
3394 | { | |
3395 | putc (c, asm_out_file); | |
3396 | p++; | |
3397 | } | |
3398 | ASM_OUTPUT_OPCODE (asm_out_file, p); | |
3cf2715d | 3399 | #endif |
cb649530 | 3400 | break; |
3cf2715d DE |
3401 | |
3402 | #ifdef ASSEMBLER_DIALECT | |
3403 | case '{': | |
b729186a JL |
3404 | { |
3405 | register int i; | |
3406 | ||
3407 | /* If we want the first dialect, do nothing. Otherwise, skip | |
3408 | DIALECT_NUMBER of strings ending with '|'. */ | |
3409 | for (i = 0; i < dialect_number; i++) | |
3410 | { | |
3411 | while (*p && *p++ != '|') | |
3412 | ; | |
3cf2715d | 3413 | |
b729186a JL |
3414 | if (*p == '|') |
3415 | p++; | |
3416 | } | |
3417 | } | |
3cf2715d DE |
3418 | break; |
3419 | ||
3420 | case '|': | |
3421 | /* Skip to close brace. */ | |
3422 | while (*p && *p++ != '}') | |
3423 | ; | |
3424 | break; | |
3425 | ||
3426 | case '}': | |
3427 | break; | |
3428 | #endif | |
3429 | ||
3430 | case '%': | |
3431 | /* %% outputs a single %. */ | |
3432 | if (*p == '%') | |
3433 | { | |
3434 | p++; | |
3435 | putc (c, asm_out_file); | |
3436 | } | |
3437 | /* %= outputs a number which is unique to each insn in the entire | |
3438 | compilation. This is useful for making local labels that are | |
3439 | referred to more than once in a given insn. */ | |
3440 | else if (*p == '=') | |
3441 | { | |
3442 | p++; | |
3443 | fprintf (asm_out_file, "%d", insn_counter); | |
3444 | } | |
3445 | /* % followed by a letter and some digits | |
3446 | outputs an operand in a special way depending on the letter. | |
3447 | Letters `acln' are implemented directly. | |
3448 | Other letters are passed to `output_operand' so that | |
3449 | the PRINT_OPERAND macro can define them. */ | |
3450 | else if ((*p >= 'a' && *p <= 'z') | |
3451 | || (*p >= 'A' && *p <= 'Z')) | |
3452 | { | |
3453 | int letter = *p++; | |
3454 | c = atoi (p); | |
3455 | ||
3456 | if (! (*p >= '0' && *p <= '9')) | |
3457 | output_operand_lossage ("operand number missing after %-letter"); | |
22bf4422 | 3458 | else if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands)) |
3cf2715d DE |
3459 | output_operand_lossage ("operand number out of range"); |
3460 | else if (letter == 'l') | |
3461 | output_asm_label (operands[c]); | |
3462 | else if (letter == 'a') | |
3463 | output_address (operands[c]); | |
3464 | else if (letter == 'c') | |
3465 | { | |
3466 | if (CONSTANT_ADDRESS_P (operands[c])) | |
3467 | output_addr_const (asm_out_file, operands[c]); | |
3468 | else | |
3469 | output_operand (operands[c], 'c'); | |
3470 | } | |
3471 | else if (letter == 'n') | |
3472 | { | |
3473 | if (GET_CODE (operands[c]) == CONST_INT) | |
21e3a81b | 3474 | fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC, |
3cf2715d DE |
3475 | - INTVAL (operands[c])); |
3476 | else | |
3477 | { | |
3478 | putc ('-', asm_out_file); | |
3479 | output_addr_const (asm_out_file, operands[c]); | |
3480 | } | |
3481 | } | |
3482 | else | |
3483 | output_operand (operands[c], letter); | |
3484 | ||
3485 | while ((c = *p) >= '0' && c <= '9') p++; | |
3486 | } | |
3487 | /* % followed by a digit outputs an operand the default way. */ | |
3488 | else if (*p >= '0' && *p <= '9') | |
3489 | { | |
3490 | c = atoi (p); | |
22bf4422 | 3491 | if (this_is_asm_operands && (c < 0 || (unsigned int) c >= insn_noperands)) |
3cf2715d DE |
3492 | output_operand_lossage ("operand number out of range"); |
3493 | else | |
3494 | output_operand (operands[c], 0); | |
3495 | while ((c = *p) >= '0' && c <= '9') p++; | |
3496 | } | |
3497 | /* % followed by punctuation: output something for that | |
3498 | punctuation character alone, with no operand. | |
3499 | The PRINT_OPERAND macro decides what is actually done. */ | |
3500 | #ifdef PRINT_OPERAND_PUNCT_VALID_P | |
3501 | else if (PRINT_OPERAND_PUNCT_VALID_P (*p)) | |
3502 | output_operand (NULL_RTX, *p++); | |
3503 | #endif | |
3504 | else | |
3505 | output_operand_lossage ("invalid %%-code"); | |
3506 | break; | |
3507 | ||
3508 | default: | |
3509 | putc (c, asm_out_file); | |
3510 | } | |
3511 | ||
cb649530 | 3512 | output_asm_name (); |
3cf2715d DE |
3513 | |
3514 | putc ('\n', asm_out_file); | |
3515 | } | |
3516 | \f | |
3517 | /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */ | |
3518 | ||
3519 | void | |
3520 | output_asm_label (x) | |
3521 | rtx x; | |
3522 | { | |
3523 | char buf[256]; | |
3524 | ||
3525 | if (GET_CODE (x) == LABEL_REF) | |
3526 | ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0))); | |
3527 | else if (GET_CODE (x) == CODE_LABEL) | |
3528 | ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x)); | |
3529 | else | |
3530 | output_operand_lossage ("`%l' operand isn't a label"); | |
3531 | ||
3532 | assemble_name (asm_out_file, buf); | |
3533 | } | |
3534 | ||
3535 | /* Print operand X using machine-dependent assembler syntax. | |
3536 | The macro PRINT_OPERAND is defined just to control this function. | |
3537 | CODE is a non-digit that preceded the operand-number in the % spec, | |
3538 | such as 'z' if the spec was `%z3'. CODE is 0 if there was no char | |
3539 | between the % and the digits. | |
3540 | When CODE is a non-letter, X is 0. | |
3541 | ||
3542 | The meanings of the letters are machine-dependent and controlled | |
3543 | by PRINT_OPERAND. */ | |
3544 | ||
3545 | static void | |
3546 | output_operand (x, code) | |
3547 | rtx x; | |
3548 | int code; | |
3549 | { | |
3550 | if (x && GET_CODE (x) == SUBREG) | |
3551 | x = alter_subreg (x); | |
3552 | ||
3553 | /* If X is a pseudo-register, abort now rather than writing trash to the | |
3554 | assembler file. */ | |
3555 | ||
3556 | if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER) | |
3557 | abort (); | |
3558 | ||
3559 | PRINT_OPERAND (asm_out_file, x, code); | |
3560 | } | |
3561 | ||
3562 | /* Print a memory reference operand for address X | |
3563 | using machine-dependent assembler syntax. | |
3564 | The macro PRINT_OPERAND_ADDRESS exists just to control this function. */ | |
3565 | ||
3566 | void | |
3567 | output_address (x) | |
3568 | rtx x; | |
3569 | { | |
3570 | walk_alter_subreg (x); | |
3571 | PRINT_OPERAND_ADDRESS (asm_out_file, x); | |
3572 | } | |
3573 | \f | |
3574 | /* Print an integer constant expression in assembler syntax. | |
3575 | Addition and subtraction are the only arithmetic | |
3576 | that may appear in these expressions. */ | |
3577 | ||
3578 | void | |
3579 | output_addr_const (file, x) | |
3580 | FILE *file; | |
3581 | rtx x; | |
3582 | { | |
3583 | char buf[256]; | |
3584 | ||
3585 | restart: | |
3586 | switch (GET_CODE (x)) | |
3587 | { | |
3588 | case PC: | |
3589 | if (flag_pic) | |
3590 | putc ('.', file); | |
3591 | else | |
3592 | abort (); | |
3593 | break; | |
3594 | ||
3595 | case SYMBOL_REF: | |
3596 | assemble_name (file, XSTR (x, 0)); | |
3597 | break; | |
3598 | ||
3599 | case LABEL_REF: | |
3600 | ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (XEXP (x, 0))); | |
3601 | assemble_name (file, buf); | |
3602 | break; | |
3603 | ||
3604 | case CODE_LABEL: | |
3605 | ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x)); | |
3606 | assemble_name (file, buf); | |
3607 | break; | |
3608 | ||
3609 | case CONST_INT: | |
21e3a81b | 3610 | fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x)); |
3cf2715d DE |
3611 | break; |
3612 | ||
3613 | case CONST: | |
3614 | /* This used to output parentheses around the expression, | |
3615 | but that does not work on the 386 (either ATT or BSD assembler). */ | |
3616 | output_addr_const (file, XEXP (x, 0)); | |
3617 | break; | |
3618 | ||
3619 | case CONST_DOUBLE: | |
3620 | if (GET_MODE (x) == VOIDmode) | |
3621 | { | |
3622 | /* We can use %d if the number is one word and positive. */ | |
3623 | if (CONST_DOUBLE_HIGH (x)) | |
21e3a81b | 3624 | fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX, |
3cf2715d DE |
3625 | CONST_DOUBLE_HIGH (x), CONST_DOUBLE_LOW (x)); |
3626 | else if (CONST_DOUBLE_LOW (x) < 0) | |
21e3a81b | 3627 | fprintf (file, HOST_WIDE_INT_PRINT_HEX, CONST_DOUBLE_LOW (x)); |
3cf2715d | 3628 | else |
21e3a81b | 3629 | fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x)); |
3cf2715d DE |
3630 | } |
3631 | else | |
3632 | /* We can't handle floating point constants; | |
3633 | PRINT_OPERAND must handle them. */ | |
3634 | output_operand_lossage ("floating constant misused"); | |
3635 | break; | |
3636 | ||
3637 | case PLUS: | |
3638 | /* Some assemblers need integer constants to appear last (eg masm). */ | |
3639 | if (GET_CODE (XEXP (x, 0)) == CONST_INT) | |
3640 | { | |
3641 | output_addr_const (file, XEXP (x, 1)); | |
3642 | if (INTVAL (XEXP (x, 0)) >= 0) | |
3643 | fprintf (file, "+"); | |
3644 | output_addr_const (file, XEXP (x, 0)); | |
3645 | } | |
3646 | else | |
3647 | { | |
3648 | output_addr_const (file, XEXP (x, 0)); | |
3649 | if (INTVAL (XEXP (x, 1)) >= 0) | |
3650 | fprintf (file, "+"); | |
3651 | output_addr_const (file, XEXP (x, 1)); | |
3652 | } | |
3653 | break; | |
3654 | ||
3655 | case MINUS: | |
3656 | /* Avoid outputting things like x-x or x+5-x, | |
3657 | since some assemblers can't handle that. */ | |
3658 | x = simplify_subtraction (x); | |
3659 | if (GET_CODE (x) != MINUS) | |
3660 | goto restart; | |
3661 | ||
3662 | output_addr_const (file, XEXP (x, 0)); | |
3663 | fprintf (file, "-"); | |
3664 | if (GET_CODE (XEXP (x, 1)) == CONST_INT | |
3665 | && INTVAL (XEXP (x, 1)) < 0) | |
3666 | { | |
3667 | fprintf (file, ASM_OPEN_PAREN); | |
3668 | output_addr_const (file, XEXP (x, 1)); | |
3669 | fprintf (file, ASM_CLOSE_PAREN); | |
3670 | } | |
3671 | else | |
3672 | output_addr_const (file, XEXP (x, 1)); | |
3673 | break; | |
3674 | ||
3675 | case ZERO_EXTEND: | |
3676 | case SIGN_EXTEND: | |
3677 | output_addr_const (file, XEXP (x, 0)); | |
3678 | break; | |
3679 | ||
3680 | default: | |
3681 | output_operand_lossage ("invalid expression as operand"); | |
3682 | } | |
3683 | } | |
3684 | \f | |
3685 | /* A poor man's fprintf, with the added features of %I, %R, %L, and %U. | |
3686 | %R prints the value of REGISTER_PREFIX. | |
3687 | %L prints the value of LOCAL_LABEL_PREFIX. | |
3688 | %U prints the value of USER_LABEL_PREFIX. | |
3689 | %I prints the value of IMMEDIATE_PREFIX. | |
3690 | %O runs ASM_OUTPUT_OPCODE to transform what follows in the string. | |
3691 | Also supported are %d, %x, %s, %e, %f, %g and %%. | |
3692 | ||
3693 | We handle alternate assembler dialects here, just like output_asm_insn. */ | |
3694 | ||
3695 | void | |
3696 | asm_fprintf VPROTO((FILE *file, char *p, ...)) | |
3697 | { | |
3698 | #ifndef __STDC__ | |
3699 | FILE *file; | |
3700 | char *p; | |
3701 | #endif | |
3702 | va_list argptr; | |
3703 | char buf[10]; | |
3704 | char *q, c; | |
3cf2715d DE |
3705 | |
3706 | VA_START (argptr, p); | |
3707 | ||
3708 | #ifndef __STDC__ | |
0f41302f MS |
3709 | file = va_arg (argptr, FILE *); |
3710 | p = va_arg (argptr, char *); | |
3cf2715d DE |
3711 | #endif |
3712 | ||
3713 | buf[0] = '%'; | |
3714 | ||
b729186a | 3715 | while ((c = *p++)) |
3cf2715d DE |
3716 | switch (c) |
3717 | { | |
3718 | #ifdef ASSEMBLER_DIALECT | |
3719 | case '{': | |
b729186a JL |
3720 | { |
3721 | int i; | |
3cf2715d | 3722 | |
b729186a JL |
3723 | /* If we want the first dialect, do nothing. Otherwise, skip |
3724 | DIALECT_NUMBER of strings ending with '|'. */ | |
3725 | for (i = 0; i < dialect_number; i++) | |
3726 | { | |
3727 | while (*p && *p++ != '|') | |
3728 | ; | |
3729 | ||
3730 | if (*p == '|') | |
3731 | p++; | |
3cf2715d | 3732 | } |
b729186a | 3733 | } |
3cf2715d DE |
3734 | break; |
3735 | ||
3736 | case '|': | |
3737 | /* Skip to close brace. */ | |
3738 | while (*p && *p++ != '}') | |
3739 | ; | |
3740 | break; | |
3741 | ||
3742 | case '}': | |
3743 | break; | |
3744 | #endif | |
3745 | ||
3746 | case '%': | |
3747 | c = *p++; | |
3748 | q = &buf[1]; | |
3749 | while ((c >= '0' && c <= '9') || c == '.') | |
3750 | { | |
3751 | *q++ = c; | |
3752 | c = *p++; | |
3753 | } | |
3754 | switch (c) | |
3755 | { | |
3756 | case '%': | |
3757 | fprintf (file, "%%"); | |
3758 | break; | |
3759 | ||
3760 | case 'd': case 'i': case 'u': | |
3761 | case 'x': case 'p': case 'X': | |
3762 | case 'o': | |
3763 | *q++ = c; | |
3764 | *q = 0; | |
3765 | fprintf (file, buf, va_arg (argptr, int)); | |
3766 | break; | |
3767 | ||
3768 | case 'w': | |
3769 | /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases, | |
3770 | but we do not check for those cases. It means that the value | |
3771 | is a HOST_WIDE_INT, which may be either `int' or `long'. */ | |
3772 | ||
21e3a81b RK |
3773 | #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT |
3774 | #else | |
3775 | #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG | |
3776 | *q++ = 'l'; | |
3777 | #else | |
3778 | *q++ = 'l'; | |
3cf2715d | 3779 | *q++ = 'l'; |
21e3a81b | 3780 | #endif |
3cf2715d DE |
3781 | #endif |
3782 | ||
3783 | *q++ = *p++; | |
3784 | *q = 0; | |
3785 | fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT)); | |
3786 | break; | |
3787 | ||
3788 | case 'l': | |
3789 | *q++ = c; | |
3790 | *q++ = *p++; | |
3791 | *q = 0; | |
3792 | fprintf (file, buf, va_arg (argptr, long)); | |
3793 | break; | |
3794 | ||
3795 | case 'e': | |
3796 | case 'f': | |
3797 | case 'g': | |
3798 | *q++ = c; | |
3799 | *q = 0; | |
3800 | fprintf (file, buf, va_arg (argptr, double)); | |
3801 | break; | |
3802 | ||
3803 | case 's': | |
3804 | *q++ = c; | |
3805 | *q = 0; | |
3806 | fprintf (file, buf, va_arg (argptr, char *)); | |
3807 | break; | |
3808 | ||
3809 | case 'O': | |
3810 | #ifdef ASM_OUTPUT_OPCODE | |
3811 | ASM_OUTPUT_OPCODE (asm_out_file, p); | |
3812 | #endif | |
3813 | break; | |
3814 | ||
3815 | case 'R': | |
3816 | #ifdef REGISTER_PREFIX | |
3817 | fprintf (file, "%s", REGISTER_PREFIX); | |
3818 | #endif | |
3819 | break; | |
3820 | ||
3821 | case 'I': | |
3822 | #ifdef IMMEDIATE_PREFIX | |
3823 | fprintf (file, "%s", IMMEDIATE_PREFIX); | |
3824 | #endif | |
3825 | break; | |
3826 | ||
3827 | case 'L': | |
3828 | #ifdef LOCAL_LABEL_PREFIX | |
3829 | fprintf (file, "%s", LOCAL_LABEL_PREFIX); | |
3830 | #endif | |
3831 | break; | |
3832 | ||
3833 | case 'U': | |
19283265 | 3834 | fputs (user_label_prefix, file); |
3cf2715d DE |
3835 | break; |
3836 | ||
3837 | default: | |
3838 | abort (); | |
3839 | } | |
3840 | break; | |
3841 | ||
3842 | default: | |
3843 | fputc (c, file); | |
3844 | } | |
3845 | } | |
3846 | \f | |
3847 | /* Split up a CONST_DOUBLE or integer constant rtx | |
3848 | into two rtx's for single words, | |
3849 | storing in *FIRST the word that comes first in memory in the target | |
3850 | and in *SECOND the other. */ | |
3851 | ||
3852 | void | |
3853 | split_double (value, first, second) | |
3854 | rtx value; | |
3855 | rtx *first, *second; | |
3856 | { | |
3857 | if (GET_CODE (value) == CONST_INT) | |
3858 | { | |
5a1a6efd | 3859 | if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD)) |
f76b9db2 | 3860 | { |
5a1a6efd | 3861 | /* In this case the CONST_INT holds both target words. |
27eef9ce JC |
3862 | Extract the bits from it into two word-sized pieces. |
3863 | Sign extend each half to HOST_WIDE_INT. */ | |
5a1a6efd | 3864 | rtx low, high; |
563c063f MM |
3865 | /* On machines where HOST_BITS_PER_WIDE_INT == BITS_PER_WORD |
3866 | the shift below will cause a compiler warning, even though | |
3867 | this code won't be executed. So put the shift amounts in | |
3868 | variables to avoid the warning. */ | |
3869 | int rshift = HOST_BITS_PER_WIDE_INT - BITS_PER_WORD; | |
3870 | int lshift = HOST_BITS_PER_WIDE_INT - 2 * BITS_PER_WORD; | |
3871 | ||
3872 | low = GEN_INT ((INTVAL (value) << rshift) >> rshift); | |
3873 | high = GEN_INT ((INTVAL (value) << lshift) >> rshift); | |
5a1a6efd RK |
3874 | if (WORDS_BIG_ENDIAN) |
3875 | { | |
3876 | *first = high; | |
3877 | *second = low; | |
3878 | } | |
3879 | else | |
3880 | { | |
3881 | *first = low; | |
3882 | *second = high; | |
3883 | } | |
f76b9db2 ILT |
3884 | } |
3885 | else | |
3886 | { | |
5a1a6efd RK |
3887 | /* The rule for using CONST_INT for a wider mode |
3888 | is that we regard the value as signed. | |
3889 | So sign-extend it. */ | |
3890 | rtx high = (INTVAL (value) < 0 ? constm1_rtx : const0_rtx); | |
3891 | if (WORDS_BIG_ENDIAN) | |
3892 | { | |
3893 | *first = high; | |
3894 | *second = value; | |
3895 | } | |
3896 | else | |
3897 | { | |
3898 | *first = value; | |
3899 | *second = high; | |
3900 | } | |
f76b9db2 | 3901 | } |
3cf2715d DE |
3902 | } |
3903 | else if (GET_CODE (value) != CONST_DOUBLE) | |
3904 | { | |
f76b9db2 ILT |
3905 | if (WORDS_BIG_ENDIAN) |
3906 | { | |
3907 | *first = const0_rtx; | |
3908 | *second = value; | |
3909 | } | |
3910 | else | |
3911 | { | |
3912 | *first = value; | |
3913 | *second = const0_rtx; | |
3914 | } | |
3cf2715d DE |
3915 | } |
3916 | else if (GET_MODE (value) == VOIDmode | |
3917 | /* This is the old way we did CONST_DOUBLE integers. */ | |
3918 | || GET_MODE_CLASS (GET_MODE (value)) == MODE_INT) | |
3919 | { | |
3920 | /* In an integer, the words are defined as most and least significant. | |
3921 | So order them by the target's convention. */ | |
f76b9db2 ILT |
3922 | if (WORDS_BIG_ENDIAN) |
3923 | { | |
3924 | *first = GEN_INT (CONST_DOUBLE_HIGH (value)); | |
3925 | *second = GEN_INT (CONST_DOUBLE_LOW (value)); | |
3926 | } | |
3927 | else | |
3928 | { | |
3929 | *first = GEN_INT (CONST_DOUBLE_LOW (value)); | |
3930 | *second = GEN_INT (CONST_DOUBLE_HIGH (value)); | |
3931 | } | |
3cf2715d DE |
3932 | } |
3933 | else | |
3934 | { | |
3935 | #ifdef REAL_ARITHMETIC | |
3936 | REAL_VALUE_TYPE r; long l[2]; | |
3937 | REAL_VALUE_FROM_CONST_DOUBLE (r, value); | |
3938 | ||
3939 | /* Note, this converts the REAL_VALUE_TYPE to the target's | |
3940 | format, splits up the floating point double and outputs | |
3941 | exactly 32 bits of it into each of l[0] and l[1] -- | |
0f41302f | 3942 | not necessarily BITS_PER_WORD bits. */ |
3cf2715d DE |
3943 | REAL_VALUE_TO_TARGET_DOUBLE (r, l); |
3944 | ||
3945 | *first = GEN_INT ((HOST_WIDE_INT) l[0]); | |
3946 | *second = GEN_INT ((HOST_WIDE_INT) l[1]); | |
3947 | #else | |
3948 | if ((HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT | |
3949 | || HOST_BITS_PER_WIDE_INT != BITS_PER_WORD) | |
3950 | && ! flag_pretend_float) | |
3951 | abort (); | |
3952 | ||
f76b9db2 ILT |
3953 | if ( |
3954 | #ifdef HOST_WORDS_BIG_ENDIAN | |
3955 | WORDS_BIG_ENDIAN | |
3cf2715d | 3956 | #else |
f76b9db2 | 3957 | ! WORDS_BIG_ENDIAN |
3cf2715d | 3958 | #endif |
f76b9db2 ILT |
3959 | ) |
3960 | { | |
3961 | /* Host and target agree => no need to swap. */ | |
3962 | *first = GEN_INT (CONST_DOUBLE_LOW (value)); | |
3963 | *second = GEN_INT (CONST_DOUBLE_HIGH (value)); | |
3964 | } | |
3965 | else | |
3966 | { | |
3967 | *second = GEN_INT (CONST_DOUBLE_LOW (value)); | |
3968 | *first = GEN_INT (CONST_DOUBLE_HIGH (value)); | |
3969 | } | |
3cf2715d DE |
3970 | #endif /* no REAL_ARITHMETIC */ |
3971 | } | |
3972 | } | |
3973 | \f | |
3974 | /* Return nonzero if this function has no function calls. */ | |
3975 | ||
3976 | int | |
3977 | leaf_function_p () | |
3978 | { | |
3979 | rtx insn; | |
3980 | ||
9e2f9a7f | 3981 | if (profile_flag || profile_block_flag || profile_arc_flag) |
3cf2715d DE |
3982 | return 0; |
3983 | ||
3984 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) | |
3985 | { | |
3986 | if (GET_CODE (insn) == CALL_INSN) | |
3987 | return 0; | |
3988 | if (GET_CODE (insn) == INSN | |
3989 | && GET_CODE (PATTERN (insn)) == SEQUENCE | |
3990 | && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == CALL_INSN) | |
3991 | return 0; | |
3992 | } | |
3993 | for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1)) | |
3994 | { | |
3995 | if (GET_CODE (XEXP (insn, 0)) == CALL_INSN) | |
3996 | return 0; | |
3997 | if (GET_CODE (XEXP (insn, 0)) == INSN | |
3998 | && GET_CODE (PATTERN (XEXP (insn, 0))) == SEQUENCE | |
3999 | && GET_CODE (XVECEXP (PATTERN (XEXP (insn, 0)), 0, 0)) == CALL_INSN) | |
4000 | return 0; | |
4001 | } | |
4002 | ||
4003 | return 1; | |
4004 | } | |
4005 | ||
4006 | /* On some machines, a function with no call insns | |
4007 | can run faster if it doesn't create its own register window. | |
4008 | When output, the leaf function should use only the "output" | |
4009 | registers. Ordinarily, the function would be compiled to use | |
4010 | the "input" registers to find its arguments; it is a candidate | |
4011 | for leaf treatment if it uses only the "input" registers. | |
4012 | Leaf function treatment means renumbering so the function | |
4013 | uses the "output" registers instead. */ | |
4014 | ||
4015 | #ifdef LEAF_REGISTERS | |
4016 | ||
4017 | static char permitted_reg_in_leaf_functions[] = LEAF_REGISTERS; | |
4018 | ||
4019 | /* Return 1 if this function uses only the registers that can be | |
4020 | safely renumbered. */ | |
4021 | ||
4022 | int | |
4023 | only_leaf_regs_used () | |
4024 | { | |
4025 | int i; | |
4026 | ||
4027 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
e5e809f4 JL |
4028 | if ((regs_ever_live[i] || global_regs[i]) |
4029 | && ! permitted_reg_in_leaf_functions[i]) | |
4030 | return 0; | |
4031 | ||
4032 | if (current_function_uses_pic_offset_table | |
4033 | && pic_offset_table_rtx != 0 | |
4034 | && GET_CODE (pic_offset_table_rtx) == REG | |
4035 | && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)]) | |
4036 | return 0; | |
4037 | ||
3cf2715d DE |
4038 | return 1; |
4039 | } | |
4040 | ||
4041 | /* Scan all instructions and renumber all registers into those | |
4042 | available in leaf functions. */ | |
4043 | ||
4044 | static void | |
4045 | leaf_renumber_regs (first) | |
4046 | rtx first; | |
4047 | { | |
4048 | rtx insn; | |
4049 | ||
4050 | /* Renumber only the actual patterns. | |
4051 | The reg-notes can contain frame pointer refs, | |
4052 | and renumbering them could crash, and should not be needed. */ | |
4053 | for (insn = first; insn; insn = NEXT_INSN (insn)) | |
4054 | if (GET_RTX_CLASS (GET_CODE (insn)) == 'i') | |
4055 | leaf_renumber_regs_insn (PATTERN (insn)); | |
4056 | for (insn = current_function_epilogue_delay_list; insn; insn = XEXP (insn, 1)) | |
4057 | if (GET_RTX_CLASS (GET_CODE (XEXP (insn, 0))) == 'i') | |
4058 | leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0))); | |
4059 | } | |
4060 | ||
4061 | /* Scan IN_RTX and its subexpressions, and renumber all regs into those | |
4062 | available in leaf functions. */ | |
4063 | ||
4064 | void | |
4065 | leaf_renumber_regs_insn (in_rtx) | |
4066 | register rtx in_rtx; | |
4067 | { | |
4068 | register int i, j; | |
4069 | register char *format_ptr; | |
4070 | ||
4071 | if (in_rtx == 0) | |
4072 | return; | |
4073 | ||
4074 | /* Renumber all input-registers into output-registers. | |
4075 | renumbered_regs would be 1 for an output-register; | |
4076 | they */ | |
4077 | ||
4078 | if (GET_CODE (in_rtx) == REG) | |
4079 | { | |
4080 | int newreg; | |
4081 | ||
4082 | /* Don't renumber the same reg twice. */ | |
4083 | if (in_rtx->used) | |
4084 | return; | |
4085 | ||
4086 | newreg = REGNO (in_rtx); | |
4087 | /* Don't try to renumber pseudo regs. It is possible for a pseudo reg | |
4088 | to reach here as part of a REG_NOTE. */ | |
4089 | if (newreg >= FIRST_PSEUDO_REGISTER) | |
4090 | { | |
4091 | in_rtx->used = 1; | |
4092 | return; | |
4093 | } | |
4094 | newreg = LEAF_REG_REMAP (newreg); | |
4095 | if (newreg < 0) | |
4096 | abort (); | |
4097 | regs_ever_live[REGNO (in_rtx)] = 0; | |
4098 | regs_ever_live[newreg] = 1; | |
4099 | REGNO (in_rtx) = newreg; | |
4100 | in_rtx->used = 1; | |
4101 | } | |
4102 | ||
4103 | if (GET_RTX_CLASS (GET_CODE (in_rtx)) == 'i') | |
4104 | { | |
4105 | /* Inside a SEQUENCE, we find insns. | |
4106 | Renumber just the patterns of these insns, | |
4107 | just as we do for the top-level insns. */ | |
4108 | leaf_renumber_regs_insn (PATTERN (in_rtx)); | |
4109 | return; | |
4110 | } | |
4111 | ||
4112 | format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx)); | |
4113 | ||
4114 | for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++) | |
4115 | switch (*format_ptr++) | |
4116 | { | |
4117 | case 'e': | |
4118 | leaf_renumber_regs_insn (XEXP (in_rtx, i)); | |
4119 | break; | |
4120 | ||
4121 | case 'E': | |
4122 | if (NULL != XVEC (in_rtx, i)) | |
4123 | { | |
4124 | for (j = 0; j < XVECLEN (in_rtx, i); j++) | |
4125 | leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j)); | |
4126 | } | |
4127 | break; | |
4128 | ||
4129 | case 'S': | |
4130 | case 's': | |
4131 | case '0': | |
4132 | case 'i': | |
4133 | case 'w': | |
4134 | case 'n': | |
4135 | case 'u': | |
4136 | break; | |
4137 | ||
4138 | default: | |
4139 | abort (); | |
4140 | } | |
4141 | } | |
4142 | #endif |