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