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