]>
Commit | Line | Data |
---|---|---|
79e68feb | 1 | /* Output variables, constants and external declarations, for GNU compiler. |
06ceef4e | 2 | Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, |
584ef5fe | 3 | 1998, 1999, 2000, 2001 Free Software Foundation, Inc. |
79e68feb RS |
4 | |
5 | This file is part of GNU CC. | |
6 | ||
7 | GNU CC is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 2, or (at your option) | |
10 | any later version. | |
11 | ||
12 | GNU CC is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GNU CC; see the file COPYING. If not, write to | |
e9fa0c7c RK |
19 | the Free Software Foundation, 59 Temple Place - Suite 330, |
20 | Boston, MA 02111-1307, USA. */ | |
79e68feb RS |
21 | |
22 | ||
23 | /* This file handles generation of all the assembler code | |
24 | *except* the instructions of a function. | |
25 | This includes declarations of variables and their initial values. | |
26 | ||
27 | We also output the assembler code for constants stored in memory | |
28 | and are responsible for combining constants with the same value. */ | |
29 | ||
e9a25f70 | 30 | #include "config.h" |
670ee920 | 31 | #include "system.h" |
79e68feb | 32 | #include <setjmp.h> |
79e68feb RS |
33 | #include "rtl.h" |
34 | #include "tree.h" | |
35 | #include "flags.h" | |
57632c51 | 36 | #include "function.h" |
79e68feb RS |
37 | #include "expr.h" |
38 | #include "hard-reg-set.h" | |
39 | #include "regs.h" | |
fbd40359 | 40 | #include "output.h" |
24b09b50 | 41 | #include "real.h" |
10f0ad3d | 42 | #include "toplev.h" |
50b2596f | 43 | #include "dbxout.h" |
e016950d | 44 | #include "sdbout.h" |
79e68feb | 45 | #include "obstack.h" |
bd7cf17e | 46 | #include "hashtab.h" |
3d6f7931 | 47 | #include "c-pragma.h" |
87ff9c8e | 48 | #include "ggc.h" |
aa388f29 | 49 | #include "tm_p.h" |
79e68feb | 50 | |
b4ac57ab | 51 | #ifdef XCOFF_DEBUGGING_INFO |
f246a305 | 52 | #include "xcoffout.h" |
b4ac57ab RS |
53 | #endif |
54 | ||
073b0524 RK |
55 | #ifndef TRAMPOLINE_ALIGNMENT |
56 | #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY | |
57 | #endif | |
58 | ||
79e68feb | 59 | #ifndef ASM_STABS_OP |
0a3e1f45 | 60 | #define ASM_STABS_OP "\t.stabs\t" |
79e68feb RS |
61 | #endif |
62 | ||
7c6d4120 | 63 | /* Define the prefix to use when check_memory_usage_flag is enable. */ |
64d9c3fe | 64 | #define CHKR_PREFIX "_CHKR_" |
7c6d4120 RK |
65 | #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1) |
66 | ||
79e68feb RS |
67 | /* File in which assembler code is being written. */ |
68 | ||
69 | extern FILE *asm_out_file; | |
70 | ||
71 | /* The (assembler) name of the first globally-visible object output. */ | |
3b304f5b ZW |
72 | const char *first_global_object_name; |
73 | const char *weak_global_object_name; | |
79e68feb | 74 | |
79e68feb RS |
75 | extern struct obstack permanent_obstack; |
76 | #define obstack_chunk_alloc xmalloc | |
79e68feb | 77 | |
36edd3cc BS |
78 | struct addr_const; |
79 | struct constant_descriptor; | |
80 | struct rtx_const; | |
81 | struct pool_constant; | |
82 | ||
83 | #define MAX_RTX_HASH_TABLE 61 | |
84 | ||
85 | struct varasm_status | |
86 | { | |
87 | /* Hash facility for making memory-constants | |
88 | from constant rtl-expressions. It is used on RISC machines | |
89 | where immediate integer arguments and constant addresses are restricted | |
90 | so that such constants must be stored in memory. | |
91 | ||
92 | This pool of constants is reinitialized for each function | |
93 | so each function gets its own constants-pool that comes right before | |
94 | it. */ | |
95 | struct constant_descriptor **x_const_rtx_hash_table; | |
94b01be3 | 96 | struct pool_constant **x_const_rtx_sym_hash_table; |
36edd3cc BS |
97 | |
98 | /* Pointers to first and last constant in pool. */ | |
99 | struct pool_constant *x_first_pool, *x_last_pool; | |
100 | ||
101 | /* Current offset in constant pool (does not include any machine-specific | |
ffc5c6a9 | 102 | header). */ |
36edd3cc BS |
103 | int x_pool_offset; |
104 | ||
105 | /* Chain of all CONST_DOUBLE rtx's constructed for the current function. | |
106 | They are chained through the CONST_DOUBLE_CHAIN. | |
107 | A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain. | |
108 | In that case, CONST_DOUBLE_MEM is either a MEM, | |
109 | or const0_rtx if no MEM has been made for this CONST_DOUBLE yet. */ | |
110 | rtx x_const_double_chain; | |
111 | }; | |
112 | ||
01d939e8 BS |
113 | #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table) |
114 | #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table) | |
115 | #define first_pool (cfun->varasm->x_first_pool) | |
116 | #define last_pool (cfun->varasm->x_last_pool) | |
117 | #define pool_offset (cfun->varasm->x_pool_offset) | |
118 | #define const_double_chain (cfun->varasm->x_const_double_chain) | |
36edd3cc | 119 | |
79e68feb RS |
120 | /* Number for making the label on the next |
121 | constant that is stored in memory. */ | |
122 | ||
123 | int const_labelno; | |
124 | ||
125 | /* Number for making the label on the next | |
126 | static variable internal to a function. */ | |
127 | ||
128 | int var_labelno; | |
129 | ||
dcc8e5e6 RS |
130 | /* Carry information from ASM_DECLARE_OBJECT_NAME |
131 | to ASM_FINISH_DECLARE_OBJECT. */ | |
132 | ||
133 | int size_directive_output; | |
134 | ||
cbed4565 RS |
135 | /* The last decl for which assemble_variable was called, |
136 | if it did ASM_DECLARE_OBJECT_NAME. | |
137 | If the last call to assemble_variable didn't do that, | |
138 | this holds 0. */ | |
139 | ||
140 | tree last_assemble_variable_decl; | |
141 | ||
58782098 KG |
142 | static const char *strip_reg_name PARAMS ((const char *)); |
143 | static int contains_pointers_p PARAMS ((tree)); | |
144 | static void decode_addr_const PARAMS ((tree, struct addr_const *)); | |
145 | static int const_hash PARAMS ((tree)); | |
146 | static int compare_constant PARAMS ((tree, | |
5a13eaa4 | 147 | struct constant_descriptor *)); |
990e8954 | 148 | static const unsigned char *compare_constant_1 PARAMS ((tree, const unsigned char *)); |
58782098 KG |
149 | static struct constant_descriptor *record_constant PARAMS ((tree)); |
150 | static void record_constant_1 PARAMS ((tree)); | |
151 | static tree copy_constant PARAMS ((tree)); | |
152 | static void output_constant_def_contents PARAMS ((tree, int, int)); | |
153 | static void decode_rtx_const PARAMS ((enum machine_mode, rtx, | |
5a13eaa4 | 154 | struct rtx_const *)); |
58782098 KG |
155 | static int const_hash_rtx PARAMS ((enum machine_mode, rtx)); |
156 | static int compare_constant_rtx PARAMS ((enum machine_mode, rtx, | |
5a13eaa4 | 157 | struct constant_descriptor *)); |
58782098 | 158 | static struct constant_descriptor *record_constant_rtx PARAMS ((enum machine_mode, |
5a13eaa4 | 159 | rtx)); |
58782098 KG |
160 | static struct pool_constant *find_pool_constant PARAMS ((struct function *, rtx)); |
161 | static void mark_constant_pool PARAMS ((void)); | |
162 | static void mark_constants PARAMS ((rtx)); | |
fcbd8ef2 | 163 | static int mark_constant PARAMS ((rtx *current_rtx, void *data)); |
58782098 KG |
164 | static int output_addressed_constants PARAMS ((tree)); |
165 | static void output_after_function_constants PARAMS ((void)); | |
ffc5c6a9 | 166 | static unsigned HOST_WIDE_INT array_size_for_constructor PARAMS ((tree)); |
58782098 | 167 | static void output_constructor PARAMS ((tree, int)); |
341a243e | 168 | #ifdef ASM_WEAKEN_LABEL |
63ad61ed | 169 | static void remove_from_pending_weak_list PARAMS ((const char *)); |
341a243e | 170 | #endif |
0e05e8ea | 171 | #ifdef ASM_OUTPUT_BSS |
3cce094d | 172 | static void asm_output_bss PARAMS ((FILE *, tree, const char *, int, int)); |
0e05e8ea | 173 | #endif |
cab634f2 | 174 | #ifdef BSS_SECTION_ASM_OP |
0e05e8ea | 175 | #ifdef ASM_OUTPUT_ALIGNED_BSS |
3cce094d KG |
176 | static void asm_output_aligned_bss PARAMS ((FILE *, tree, const char *, |
177 | int, int)); | |
0e05e8ea | 178 | #endif |
cab634f2 | 179 | #endif /* BSS_SECTION_ASM_OP */ |
58782098 | 180 | static void mark_pool_constant PARAMS ((struct pool_constant *)); |
58782098 | 181 | static void mark_const_hash_entry PARAMS ((void *)); |
bd7cf17e JJ |
182 | static int mark_const_str_htab_1 PARAMS ((void **, void *)); |
183 | static void mark_const_str_htab PARAMS ((void *)); | |
184 | static hashval_t const_str_htab_hash PARAMS ((const void *x)); | |
185 | static int const_str_htab_eq PARAMS ((const void *x, const void *y)); | |
186 | static void const_str_htab_del PARAMS ((void *)); | |
3cce094d | 187 | static void asm_emit_uninitialised PARAMS ((tree, const char*, int, int)); |
79e68feb | 188 | \f |
e5887033 DE |
189 | static enum in_section { no_section, in_text, in_data, in_named |
190 | #ifdef BSS_SECTION_ASM_OP | |
191 | , in_bss | |
192 | #endif | |
0021b564 JM |
193 | #ifdef EH_FRAME_SECTION_ASM_OP |
194 | , in_eh_frame | |
195 | #endif | |
79e68feb | 196 | #ifdef EXTRA_SECTIONS |
e5887033 | 197 | , EXTRA_SECTIONS |
79e68feb | 198 | #endif |
e5887033 | 199 | } in_section = no_section; |
79e68feb | 200 | |
8a425a05 | 201 | /* Return a non-zero value if DECL has a section attribute. */ |
a56e7c08 | 202 | #ifndef IN_NAMED_SECTION |
8a425a05 DE |
203 | #define IN_NAMED_SECTION(DECL) \ |
204 | ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \ | |
205 | && DECL_SECTION_NAME (DECL) != NULL_TREE) | |
a56e7c08 NC |
206 | #endif |
207 | ||
8a425a05 | 208 | /* Text of section name when in_section == in_named. */ |
520a57c8 | 209 | static const char *in_named_name; |
8a425a05 | 210 | |
79e68feb RS |
211 | /* Define functions like text_section for any extra sections. */ |
212 | #ifdef EXTRA_SECTION_FUNCTIONS | |
213 | EXTRA_SECTION_FUNCTIONS | |
214 | #endif | |
215 | ||
216 | /* Tell assembler to switch to text section. */ | |
217 | ||
218 | void | |
219 | text_section () | |
220 | { | |
221 | if (in_section != in_text) | |
222 | { | |
b93a436e | 223 | fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP); |
79e68feb RS |
224 | in_section = in_text; |
225 | } | |
226 | } | |
227 | ||
79e68feb RS |
228 | /* Tell assembler to switch to data section. */ |
229 | ||
230 | void | |
231 | data_section () | |
232 | { | |
233 | if (in_section != in_data) | |
234 | { | |
b93a436e | 235 | if (flag_shared_data) |
79e68feb RS |
236 | { |
237 | #ifdef SHARED_SECTION_ASM_OP | |
b93a436e | 238 | fprintf (asm_out_file, "%s\n", SHARED_SECTION_ASM_OP); |
79e68feb | 239 | #else |
b93a436e | 240 | fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP); |
79e68feb RS |
241 | #endif |
242 | } | |
b93a436e JL |
243 | else |
244 | fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP); | |
79e68feb RS |
245 | |
246 | in_section = in_data; | |
247 | } | |
248 | } | |
3167de5b AM |
249 | /* Tell assembler to ALWAYS switch to data section, in case |
250 | it's not sure where it it. */ | |
251 | ||
252 | void | |
253 | force_data_section () | |
254 | { | |
255 | in_section = no_section; | |
256 | data_section (); | |
257 | } | |
79e68feb | 258 | |
7c6d68c8 RS |
259 | /* Tell assembler to switch to read-only data section. This is normally |
260 | the text section. */ | |
261 | ||
262 | void | |
263 | readonly_data_section () | |
264 | { | |
265 | #ifdef READONLY_DATA_SECTION | |
266 | READONLY_DATA_SECTION (); /* Note this can call data_section. */ | |
267 | #else | |
268 | text_section (); | |
269 | #endif | |
270 | } | |
271 | ||
0f41302f | 272 | /* Determine if we're in the text section. */ |
79e68feb RS |
273 | |
274 | int | |
275 | in_text_section () | |
276 | { | |
277 | return in_section == in_text; | |
278 | } | |
8a425a05 | 279 | |
0f41302f | 280 | /* Determine if we're in the data section. */ |
6f2f3db7 | 281 | |
274351ba RK |
282 | int |
283 | in_data_section () | |
284 | { | |
285 | return in_section == in_data; | |
286 | } | |
6f2f3db7 | 287 | |
2ffe831c DE |
288 | /* Tell assembler to change to section NAME for DECL. |
289 | If DECL is NULL, just switch to section NAME. | |
ad4ff310 JM |
290 | If NAME is NULL, get the name from DECL. |
291 | If RELOC is 1, the initializer for DECL contains relocs. */ | |
8a425a05 DE |
292 | |
293 | void | |
ad4ff310 | 294 | named_section (decl, name, reloc) |
2ffe831c | 295 | tree decl; |
87e11268 | 296 | const char *name; |
91813b28 | 297 | int reloc ATTRIBUTE_UNUSED; |
8a425a05 | 298 | { |
2f939d94 | 299 | if (decl != NULL_TREE && !DECL_P (decl)) |
2ffe831c DE |
300 | abort (); |
301 | if (name == NULL) | |
302 | name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl)); | |
303 | ||
8a425a05 DE |
304 | if (in_section != in_named || strcmp (name, in_named_name)) |
305 | { | |
8a425a05 | 306 | #ifdef ASM_OUTPUT_SECTION_NAME |
ad4ff310 | 307 | ASM_OUTPUT_SECTION_NAME (asm_out_file, decl, name, reloc); |
8a425a05 DE |
308 | #else |
309 | /* Section attributes are not supported if this macro isn't provided - | |
310 | some host formats don't support them at all. The front-end should | |
311 | already have flagged this as an error. */ | |
312 | abort (); | |
313 | #endif | |
e9a25f70 | 314 | |
a8a05998 | 315 | in_named_name = ggc_strdup (name); |
e9a25f70 | 316 | in_section = in_named; |
8a425a05 DE |
317 | } |
318 | } | |
4d1065ed | 319 | |
e5887033 DE |
320 | #ifdef BSS_SECTION_ASM_OP |
321 | ||
322 | /* Tell the assembler to switch to the bss section. */ | |
323 | ||
324 | void | |
da2c5447 | 325 | bss_section () |
e5887033 DE |
326 | { |
327 | if (in_section != in_bss) | |
328 | { | |
e5887033 | 329 | #ifdef SHARED_BSS_SECTION_ASM_OP |
b93a436e JL |
330 | if (flag_shared_data) |
331 | fprintf (asm_out_file, "%s\n", SHARED_BSS_SECTION_ASM_OP); | |
332 | else | |
e5887033 | 333 | #endif |
b93a436e | 334 | fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP); |
e5887033 DE |
335 | |
336 | in_section = in_bss; | |
337 | } | |
338 | } | |
339 | ||
340 | #ifdef ASM_OUTPUT_BSS | |
341 | ||
342 | /* Utility function for ASM_OUTPUT_BSS for targets to use if | |
343 | they don't support alignments in .bss. | |
344 | ??? It is believed that this function will work in most cases so such | |
345 | support is localized here. */ | |
346 | ||
347 | static void | |
91fddd7c | 348 | asm_output_bss (file, decl, name, size, rounded) |
e5887033 | 349 | FILE *file; |
05b13f59 | 350 | tree decl ATTRIBUTE_UNUSED; |
3cce094d | 351 | const char *name; |
05b13f59 | 352 | int size ATTRIBUTE_UNUSED, rounded; |
e5887033 DE |
353 | { |
354 | ASM_GLOBALIZE_LABEL (file, name); | |
355 | bss_section (); | |
91fddd7c DE |
356 | #ifdef ASM_DECLARE_OBJECT_NAME |
357 | last_assemble_variable_decl = decl; | |
358 | ASM_DECLARE_OBJECT_NAME (file, name, decl); | |
359 | #else | |
360 | /* Standard thing is just output label for the object. */ | |
e5887033 | 361 | ASM_OUTPUT_LABEL (file, name); |
91fddd7c | 362 | #endif /* ASM_DECLARE_OBJECT_NAME */ |
e5887033 DE |
363 | ASM_OUTPUT_SKIP (file, rounded); |
364 | } | |
365 | ||
366 | #endif | |
367 | ||
368 | #ifdef ASM_OUTPUT_ALIGNED_BSS | |
369 | ||
370 | /* Utility function for targets to use in implementing | |
371 | ASM_OUTPUT_ALIGNED_BSS. | |
372 | ??? It is believed that this function will work in most cases so such | |
373 | support is localized here. */ | |
374 | ||
375 | static void | |
91fddd7c | 376 | asm_output_aligned_bss (file, decl, name, size, align) |
e5887033 | 377 | FILE *file; |
91fddd7c | 378 | tree decl; |
3cce094d | 379 | const char *name; |
e5887033 DE |
380 | int size, align; |
381 | { | |
382 | ASM_GLOBALIZE_LABEL (file, name); | |
383 | bss_section (); | |
384 | ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT)); | |
91fddd7c DE |
385 | #ifdef ASM_DECLARE_OBJECT_NAME |
386 | last_assemble_variable_decl = decl; | |
387 | ASM_DECLARE_OBJECT_NAME (file, name, decl); | |
388 | #else | |
389 | /* Standard thing is just output label for the object. */ | |
e5887033 | 390 | ASM_OUTPUT_LABEL (file, name); |
91fddd7c | 391 | #endif /* ASM_DECLARE_OBJECT_NAME */ |
f8bc3367 | 392 | ASM_OUTPUT_SKIP (file, size ? size : 1); |
e5887033 DE |
393 | } |
394 | ||
395 | #endif | |
396 | ||
397 | #endif /* BSS_SECTION_ASM_OP */ | |
398 | ||
0021b564 JM |
399 | #ifdef EH_FRAME_SECTION_ASM_OP |
400 | void | |
5dd33f4b | 401 | eh_frame_section () |
0021b564 JM |
402 | { |
403 | if (in_section != in_eh_frame) | |
404 | { | |
405 | fprintf (asm_out_file, "%s\n", EH_FRAME_SECTION_ASM_OP); | |
406 | in_section = in_eh_frame; | |
407 | } | |
408 | } | |
409 | #endif | |
410 | ||
4d1065ed DE |
411 | /* Switch to the section for function DECL. |
412 | ||
413 | If DECL is NULL_TREE, switch to the text section. | |
414 | ??? It's not clear that we will ever be passed NULL_TREE, but it's | |
415 | safer to handle it. */ | |
416 | ||
417 | void | |
418 | function_section (decl) | |
419 | tree decl; | |
420 | { | |
421 | if (decl != NULL_TREE | |
422 | && DECL_SECTION_NAME (decl) != NULL_TREE) | |
ad4ff310 | 423 | named_section (decl, (char *) 0, 0); |
8b43265c JL |
424 | else |
425 | text_section (); | |
4d1065ed | 426 | } |
f9da1f35 DE |
427 | |
428 | /* Switch to section for variable DECL. | |
429 | ||
430 | RELOC is the `reloc' argument to SELECT_SECTION. */ | |
431 | ||
432 | void | |
433 | variable_section (decl, reloc) | |
434 | tree decl; | |
435 | int reloc; | |
436 | { | |
437 | if (IN_NAMED_SECTION (decl)) | |
ad4ff310 | 438 | named_section (decl, NULL, reloc); |
f9da1f35 DE |
439 | else |
440 | { | |
441 | /* C++ can have const variables that get initialized from constructors, | |
442 | and thus can not be in a readonly section. We prevent this by | |
443 | verifying that the initial value is constant for objects put in a | |
444 | readonly section. | |
445 | ||
446 | error_mark_node is used by the C front end to indicate that the | |
447 | initializer has not been seen yet. In this case, we assume that | |
e5887033 DE |
448 | the initializer must be constant. |
449 | ||
450 | C++ uses error_mark_node for variables that have complicated | |
451 | initializers, but these variables go in BSS so we won't be called | |
452 | for them. */ | |
453 | ||
f9da1f35 DE |
454 | #ifdef SELECT_SECTION |
455 | SELECT_SECTION (decl, reloc); | |
456 | #else | |
ad4ff310 | 457 | if (DECL_READONLY_SECTION (decl, reloc)) |
f9da1f35 DE |
458 | readonly_data_section (); |
459 | else | |
460 | data_section (); | |
461 | #endif | |
462 | } | |
463 | } | |
6adb4e3a MS |
464 | |
465 | /* Tell assembler to switch to the section for the exception handling | |
466 | table. */ | |
467 | ||
468 | void | |
469 | exception_section () | |
470 | { | |
0021b564 JM |
471 | #if defined (EXCEPTION_SECTION) |
472 | EXCEPTION_SECTION (); | |
473 | #else | |
6adb4e3a | 474 | #ifdef ASM_OUTPUT_SECTION_NAME |
ad4ff310 | 475 | named_section (NULL_TREE, ".gcc_except_table", 0); |
6adb4e3a MS |
476 | #else |
477 | if (flag_pic) | |
478 | data_section (); | |
479 | else | |
6adb4e3a MS |
480 | readonly_data_section (); |
481 | #endif | |
482 | #endif | |
483 | } | |
79e68feb | 484 | \f |
b4ac57ab RS |
485 | /* Given NAME, a putative register name, discard any customary prefixes. */ |
486 | ||
87e11268 | 487 | static const char * |
b4ac57ab | 488 | strip_reg_name (name) |
87e11268 | 489 | const char *name; |
b4ac57ab RS |
490 | { |
491 | #ifdef REGISTER_PREFIX | |
492 | if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX))) | |
493 | name += strlen (REGISTER_PREFIX); | |
494 | #endif | |
495 | if (name[0] == '%' || name[0] == '#') | |
496 | name++; | |
497 | return name; | |
498 | } | |
dcfedcd0 | 499 | \f |
79e68feb RS |
500 | /* Decode an `asm' spec for a declaration as a register name. |
501 | Return the register number, or -1 if nothing specified, | |
c09e6498 RS |
502 | or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized, |
503 | or -3 if ASMSPEC is `cc' and is not recognized, | |
504 | or -4 if ASMSPEC is `memory' and is not recognized. | |
dcfedcd0 RK |
505 | Accept an exact spelling or a decimal number. |
506 | Prefixes such as % are optional. */ | |
79e68feb RS |
507 | |
508 | int | |
509 | decode_reg_name (asmspec) | |
87e11268 | 510 | const char *asmspec; |
79e68feb RS |
511 | { |
512 | if (asmspec != 0) | |
513 | { | |
514 | int i; | |
515 | ||
b4ac57ab RS |
516 | /* Get rid of confusing prefixes. */ |
517 | asmspec = strip_reg_name (asmspec); | |
518 | ||
fff9e713 MT |
519 | /* Allow a decimal number as a "register name". */ |
520 | for (i = strlen (asmspec) - 1; i >= 0; i--) | |
521 | if (! (asmspec[i] >= '0' && asmspec[i] <= '9')) | |
522 | break; | |
523 | if (asmspec[0] != 0 && i < 0) | |
524 | { | |
525 | i = atoi (asmspec); | |
526 | if (i < FIRST_PSEUDO_REGISTER && i >= 0) | |
527 | return i; | |
528 | else | |
529 | return -2; | |
530 | } | |
531 | ||
79e68feb | 532 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) |
b4ac57ab RS |
533 | if (reg_names[i][0] |
534 | && ! strcmp (asmspec, strip_reg_name (reg_names[i]))) | |
79e68feb RS |
535 | return i; |
536 | ||
79e68feb RS |
537 | #ifdef ADDITIONAL_REGISTER_NAMES |
538 | { | |
87e11268 | 539 | static struct { const char *name; int number; } table[] |
79e68feb RS |
540 | = ADDITIONAL_REGISTER_NAMES; |
541 | ||
b6a1cbae | 542 | for (i = 0; i < (int) ARRAY_SIZE (table); i++) |
79e68feb RS |
543 | if (! strcmp (asmspec, table[i].name)) |
544 | return table[i].number; | |
79e68feb RS |
545 | } |
546 | #endif /* ADDITIONAL_REGISTER_NAMES */ | |
547 | ||
c09e6498 RS |
548 | if (!strcmp (asmspec, "memory")) |
549 | return -4; | |
550 | ||
dcfedcd0 RK |
551 | if (!strcmp (asmspec, "cc")) |
552 | return -3; | |
553 | ||
79e68feb RS |
554 | return -2; |
555 | } | |
556 | ||
557 | return -1; | |
558 | } | |
559 | \f | |
19e7881c MM |
560 | /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should |
561 | have static storage duration. In other words, it should not be an | |
562 | automatic variable, including PARM_DECLs. | |
563 | ||
564 | There is, however, one exception: this function handles variables | |
565 | explicitly placed in a particular register by the user. | |
566 | ||
567 | ASMSPEC, if not 0, is the string which the user specified as the | |
568 | assembler symbol name. | |
79e68feb RS |
569 | |
570 | This is never called for PARM_DECL nodes. */ | |
571 | ||
572 | void | |
6c418184 | 573 | make_decl_rtl (decl, asmspec) |
79e68feb | 574 | tree decl; |
87e11268 | 575 | const char *asmspec; |
79e68feb | 576 | { |
6c418184 | 577 | int top_level = (DECL_CONTEXT (decl) == NULL_TREE); |
63ad61ed ZW |
578 | const char *name = 0; |
579 | const char *new_name = 0; | |
ca695ac9 JB |
580 | int reg_number; |
581 | ||
19e7881c | 582 | /* Check that we are not being given an automatic variable. */ |
9ea07fd0 | 583 | /* A weak alias has TREE_PUBLIC set but not the other bits. */ |
19e7881c MM |
584 | if (TREE_CODE (decl) == PARM_DECL |
585 | || TREE_CODE (decl) == RESULT_DECL | |
586 | || (TREE_CODE (decl) == VAR_DECL | |
587 | && !TREE_STATIC (decl) | |
9ea07fd0 | 588 | && !TREE_PUBLIC (decl) |
19e7881c MM |
589 | && !DECL_EXTERNAL (decl) |
590 | && !DECL_REGISTER (decl))) | |
591 | abort (); | |
592 | /* And that we were not given a type or a label. */ | |
593 | else if (TREE_CODE (decl) == TYPE_DECL | |
594 | || TREE_CODE (decl) == LABEL_DECL) | |
595 | abort (); | |
596 | ||
63ad61ed ZW |
597 | /* For a duplicate declaration, we can be called twice on the |
598 | same DECL node. Don't discard the RTL already made. */ | |
19e7881c | 599 | if (DECL_RTL_SET_P (decl)) |
79e68feb | 600 | { |
63ad61ed ZW |
601 | /* If the old RTL had the wrong mode, fix the mode. */ |
602 | if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl)) | |
603 | { | |
604 | rtx rtl = DECL_RTL (decl); | |
605 | PUT_MODE (rtl, DECL_MODE (decl)); | |
606 | } | |
76095e2f | 607 | |
63ad61ed ZW |
608 | /* ??? Another way to do this would be to do what halfpic.c does |
609 | and maintain a hashed table of such critters. */ | |
610 | /* ??? Another way to do this would be to pass a flag bit to | |
611 | ENCODE_SECTION_INFO saying whether this is a new decl or not. */ | |
612 | /* Let the target reassign the RTL if it wants. | |
613 | This is necessary, for example, when one machine specific | |
614 | decl attribute overrides another. */ | |
615 | #ifdef REDO_SECTION_INFO_P | |
616 | if (REDO_SECTION_INFO_P (decl)) | |
617 | ENCODE_SECTION_INFO (decl); | |
618 | #endif | |
619 | return; | |
79e68feb RS |
620 | } |
621 | ||
63ad61ed ZW |
622 | new_name = name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)); |
623 | ||
624 | reg_number = decode_reg_name (asmspec); | |
625 | if (reg_number == -2) | |
8f820299 ZW |
626 | { |
627 | /* ASMSPEC is given, and not the name of a register. Mark the | |
628 | name with a star so assemble_name won't munge it. */ | |
629 | char *starred = alloca (strlen (asmspec) + 2); | |
630 | starred[0] = '*'; | |
631 | strcpy (starred + 1, asmspec); | |
632 | new_name = starred; | |
633 | } | |
63ad61ed ZW |
634 | |
635 | if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl)) | |
79e68feb | 636 | { |
79e68feb | 637 | /* First detect errors in declaring global registers. */ |
63ad61ed ZW |
638 | if (reg_number == -1) |
639 | error_with_decl (decl, "register name not specified for `%s'"); | |
640 | else if (reg_number < 0) | |
641 | error_with_decl (decl, "invalid register name for `%s'"); | |
642 | else if (TYPE_MODE (TREE_TYPE (decl)) == BLKmode) | |
12266a61 RK |
643 | error_with_decl (decl, |
644 | "data type of `%s' isn't suitable for a register"); | |
63ad61ed | 645 | else if (! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl)))) |
12266a61 | 646 | error_with_decl (decl, |
63ad61ed | 647 | "register specified for `%s' isn't suitable for data type"); |
79e68feb | 648 | /* Now handle properly declared static register variables. */ |
63ad61ed | 649 | else |
79e68feb RS |
650 | { |
651 | int nregs; | |
12266a61 | 652 | |
e3406b2a | 653 | if (DECL_INITIAL (decl) != 0 && TREE_STATIC (decl)) |
79e68feb RS |
654 | { |
655 | DECL_INITIAL (decl) = 0; | |
656 | error ("global register variable has initial value"); | |
657 | } | |
79e68feb RS |
658 | if (TREE_THIS_VOLATILE (decl)) |
659 | warning ("volatile register variables don't work as you might wish"); | |
31e4b1c0 RK |
660 | |
661 | /* If the user specified one of the eliminables registers here, | |
662 | e.g., FRAME_POINTER_REGNUM, we don't want to get this variable | |
663 | confused with that register and be eliminated. Although this | |
664 | usage is somewhat suspect, we nevertheless use the following | |
665 | kludge to avoid setting DECL_RTL to frame_pointer_rtx. */ | |
666 | ||
19e7881c MM |
667 | SET_DECL_RTL (decl, |
668 | gen_rtx_REG (DECL_MODE (decl), | |
669 | FIRST_PSEUDO_REGISTER)); | |
31e4b1c0 | 670 | REGNO (DECL_RTL (decl)) = reg_number; |
79e68feb RS |
671 | REG_USERVAR_P (DECL_RTL (decl)) = 1; |
672 | ||
6c418184 | 673 | if (TREE_STATIC (decl)) |
79e68feb | 674 | { |
ad800eb1 RK |
675 | /* Make this register global, so not usable for anything |
676 | else. */ | |
1cb36a98 RH |
677 | #ifdef ASM_DECLARE_REGISTER_GLOBAL |
678 | ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name); | |
679 | #endif | |
79e68feb RS |
680 | nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl)); |
681 | while (nregs > 0) | |
ad800eb1 | 682 | globalize_reg (reg_number + --nregs); |
79e68feb | 683 | } |
79e68feb | 684 | |
63ad61ed ZW |
685 | /* As a register variable, it has no section. */ |
686 | return; | |
687 | } | |
688 | } | |
0a5152d0 | 689 | |
63ad61ed ZW |
690 | /* Now handle ordinary static variables and functions (in memory). |
691 | Also handle vars declared register invalidly. */ | |
692 | ||
693 | if (reg_number >= 0 || reg_number == -3) | |
694 | error_with_decl (decl, | |
695 | "register name given for non-register variable `%s'"); | |
696 | ||
697 | /* Specifying a section attribute on a variable forces it into a | |
698 | non-.bss section, and thus it cannot be common. */ | |
699 | if (TREE_CODE (decl) == VAR_DECL | |
700 | && DECL_SECTION_NAME (decl) != NULL_TREE | |
701 | && DECL_INITIAL (decl) == NULL_TREE | |
702 | && DECL_COMMON (decl)) | |
703 | DECL_COMMON (decl) = 0; | |
704 | ||
705 | /* Can't use just the variable's own name for a variable | |
706 | whose scope is less than the whole file, unless it's a member | |
707 | of a local class (which will already be unambiguous). | |
708 | Concatenate a distinguishing number. */ | |
709 | if (!top_level && !TREE_PUBLIC (decl) | |
710 | && ! (DECL_CONTEXT (decl) && TYPE_P (DECL_CONTEXT (decl))) | |
60080880 JJ |
711 | && asmspec == 0 |
712 | && name == IDENTIFIER_POINTER (DECL_NAME (decl))) | |
63ad61ed ZW |
713 | { |
714 | char *label; | |
715 | ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno); | |
716 | var_labelno++; | |
717 | new_name = label; | |
718 | } | |
76095e2f | 719 | |
63ad61ed ZW |
720 | /* When -fprefix-function-name is used, the functions |
721 | names are prefixed. Only nested function names are not | |
722 | prefixed. */ | |
723 | else if (flag_prefix_function_name && TREE_CODE (decl) == FUNCTION_DECL) | |
724 | { | |
725 | size_t name_len = IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl)); | |
726 | char *pname; | |
7c6d4120 | 727 | |
63ad61ed ZW |
728 | pname = alloca (name_len + CHKR_PREFIX_SIZE + 1); |
729 | memcpy (pname, CHKR_PREFIX, CHKR_PREFIX_SIZE); | |
730 | memcpy (pname + CHKR_PREFIX_SIZE, name, name_len + 1); | |
731 | new_name = pname; | |
79e68feb | 732 | } |
63ad61ed ZW |
733 | |
734 | if (name != new_name) | |
ff8f4401 | 735 | { |
92643fea | 736 | SET_DECL_ASSEMBLER_NAME (decl, get_identifier (new_name)); |
63ad61ed ZW |
737 | name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)); |
738 | } | |
d9525bec | 739 | |
63ad61ed ZW |
740 | /* If this variable is to be treated as volatile, show its |
741 | tree node has side effects. */ | |
742 | if ((flag_volatile_global && TREE_CODE (decl) == VAR_DECL | |
743 | && TREE_PUBLIC (decl)) | |
744 | || ((flag_volatile_static && TREE_CODE (decl) == VAR_DECL | |
745 | && (TREE_PUBLIC (decl) || TREE_STATIC (decl))))) | |
746 | TREE_SIDE_EFFECTS (decl) = 1; | |
747 | ||
19e7881c MM |
748 | SET_DECL_RTL (decl, gen_rtx_MEM (DECL_MODE (decl), |
749 | gen_rtx_SYMBOL_REF (Pmode, name))); | |
ff0b6b99 | 750 | SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl), 0)) = DECL_WEAK (decl); |
63ad61ed ZW |
751 | if (TREE_CODE (decl) != FUNCTION_DECL) |
752 | set_mem_attributes (DECL_RTL (decl), decl, 1); | |
753 | ||
754 | /* Optionally set flags or add text to the name to record information | |
755 | such as that it is a function name. | |
756 | If the name is changed, the macro ASM_OUTPUT_LABELREF | |
757 | will have to know how to strip this information. */ | |
758 | #ifdef ENCODE_SECTION_INFO | |
759 | ENCODE_SECTION_INFO (decl); | |
d9525bec | 760 | #endif |
79e68feb | 761 | } |
4724d87a RS |
762 | |
763 | /* Make the rtl for variable VAR be volatile. | |
764 | Use this only for static variables. */ | |
765 | ||
fcbaecc6 | 766 | void |
4724d87a RS |
767 | make_var_volatile (var) |
768 | tree var; | |
769 | { | |
770 | if (GET_CODE (DECL_RTL (var)) != MEM) | |
771 | abort (); | |
772 | ||
773 | MEM_VOLATILE_P (DECL_RTL (var)) = 1; | |
774 | } | |
79e68feb | 775 | \f |
d447ec6f RS |
776 | /* Output alignment directive to align for constant expression EXP. */ |
777 | ||
778 | void | |
779 | assemble_constant_align (exp) | |
780 | tree exp; | |
781 | { | |
782 | int align; | |
783 | ||
784 | /* Align the location counter as required by EXP's data type. */ | |
785 | align = TYPE_ALIGN (TREE_TYPE (exp)); | |
786 | #ifdef CONSTANT_ALIGNMENT | |
787 | align = CONSTANT_ALIGNMENT (exp, align); | |
788 | #endif | |
789 | ||
790 | if (align > BITS_PER_UNIT) | |
791 | ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT)); | |
792 | } | |
793 | ||
79e68feb RS |
794 | /* Output a string of literal assembler code |
795 | for an `asm' keyword used between functions. */ | |
796 | ||
797 | void | |
798 | assemble_asm (string) | |
799 | tree string; | |
800 | { | |
801 | app_enable (); | |
802 | ||
803 | if (TREE_CODE (string) == ADDR_EXPR) | |
804 | string = TREE_OPERAND (string, 0); | |
805 | ||
806 | fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string)); | |
807 | } | |
808 | ||
9bb2e4fe RS |
809 | #if 0 /* This should no longer be needed, because |
810 | flag_gnu_linker should be 0 on these systems, | |
811 | which should prevent any output | |
812 | if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */ | |
79e68feb RS |
813 | #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER)) |
814 | #ifndef ASM_OUTPUT_CONSTRUCTOR | |
815 | #define ASM_OUTPUT_CONSTRUCTOR(file, name) | |
816 | #endif | |
817 | #ifndef ASM_OUTPUT_DESTRUCTOR | |
818 | #define ASM_OUTPUT_DESTRUCTOR(file, name) | |
819 | #endif | |
820 | #endif | |
9bb2e4fe | 821 | #endif /* 0 */ |
79e68feb RS |
822 | |
823 | /* Record an element in the table of global destructors. | |
824 | How this is done depends on what sort of assembler and linker | |
825 | are in use. | |
826 | ||
827 | NAME should be the name of a global function to be called | |
828 | at exit time. This name is output using assemble_name. */ | |
829 | ||
830 | void | |
831 | assemble_destructor (name) | |
d9bba9c3 | 832 | const char *name; |
79e68feb RS |
833 | { |
834 | #ifdef ASM_OUTPUT_DESTRUCTOR | |
835 | ASM_OUTPUT_DESTRUCTOR (asm_out_file, name); | |
836 | #else | |
837 | if (flag_gnu_linker) | |
838 | { | |
839 | /* Now tell GNU LD that this is part of the static destructor set. */ | |
840 | /* This code works for any machine provided you use GNU as/ld. */ | |
e8638df0 | 841 | fprintf (asm_out_file, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP); |
79e68feb RS |
842 | assemble_name (asm_out_file, name); |
843 | fputc ('\n', asm_out_file); | |
844 | } | |
845 | #endif | |
846 | } | |
847 | ||
848 | /* Likewise for global constructors. */ | |
849 | ||
850 | void | |
851 | assemble_constructor (name) | |
d9bba9c3 | 852 | const char *name; |
79e68feb RS |
853 | { |
854 | #ifdef ASM_OUTPUT_CONSTRUCTOR | |
855 | ASM_OUTPUT_CONSTRUCTOR (asm_out_file, name); | |
856 | #else | |
857 | if (flag_gnu_linker) | |
858 | { | |
859 | /* Now tell GNU LD that this is part of the static constructor set. */ | |
860 | /* This code works for any machine provided you use GNU as/ld. */ | |
e8638df0 | 861 | fprintf (asm_out_file, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP); |
79e68feb RS |
862 | assemble_name (asm_out_file, name); |
863 | fputc ('\n', asm_out_file); | |
864 | } | |
865 | #endif | |
866 | } | |
867 | ||
868 | /* Likewise for entries we want to record for garbage collection. | |
869 | Garbage collection is still under development. */ | |
870 | ||
871 | void | |
872 | assemble_gc_entry (name) | |
d9bba9c3 | 873 | const char *name; |
79e68feb RS |
874 | { |
875 | #ifdef ASM_OUTPUT_GC_ENTRY | |
876 | ASM_OUTPUT_GC_ENTRY (asm_out_file, name); | |
877 | #else | |
878 | if (flag_gnu_linker) | |
879 | { | |
880 | /* Now tell GNU LD that this is part of the static constructor set. */ | |
e8638df0 | 881 | fprintf (asm_out_file, "%s\"___PTR_LIST__\",22,0,0,", ASM_STABS_OP); |
79e68feb RS |
882 | assemble_name (asm_out_file, name); |
883 | fputc ('\n', asm_out_file); | |
884 | } | |
885 | #endif | |
886 | } | |
887 | \f | |
97adc6ed ILT |
888 | /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with |
889 | a non-zero value if the constant pool should be output before the | |
890 | start of the function, or a zero value if the pool should output | |
891 | after the end of the function. The default is to put it before the | |
892 | start. */ | |
893 | ||
894 | #ifndef CONSTANT_POOL_BEFORE_FUNCTION | |
895 | #define CONSTANT_POOL_BEFORE_FUNCTION 1 | |
896 | #endif | |
897 | ||
79e68feb RS |
898 | /* Output assembler code for the constant pool of a function and associated |
899 | with defining the name of the function. DECL describes the function. | |
900 | NAME is the function's name. For the constant pool, we use the current | |
901 | constant pool data. */ | |
902 | ||
903 | void | |
904 | assemble_start_function (decl, fnname) | |
905 | tree decl; | |
3cce094d | 906 | const char *fnname; |
79e68feb RS |
907 | { |
908 | int align; | |
909 | ||
910 | /* The following code does not need preprocessing in the assembler. */ | |
911 | ||
912 | app_disable (); | |
913 | ||
97adc6ed ILT |
914 | if (CONSTANT_POOL_BEFORE_FUNCTION) |
915 | output_constant_pool (fnname, decl); | |
79e68feb | 916 | |
c30ac676 DE |
917 | #ifdef ASM_OUTPUT_SECTION_NAME |
918 | /* If the function is to be put in its own section and it's not in a section | |
919 | already, indicate so. */ | |
ad4ff310 JM |
920 | if ((flag_function_sections |
921 | && DECL_SECTION_NAME (decl) == NULL_TREE) | |
922 | || UNIQUE_SECTION_P (decl)) | |
923 | UNIQUE_SECTION (decl, 0); | |
c30ac676 DE |
924 | #endif |
925 | ||
4d1065ed | 926 | function_section (decl); |
79e68feb RS |
927 | |
928 | /* Tell assembler to move to target machine's alignment for functions. */ | |
929 | align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT); | |
930 | if (align > 0) | |
b93a436e | 931 | ASM_OUTPUT_ALIGN (asm_out_file, align); |
79e68feb | 932 | |
efa3896a GK |
933 | /* Handle a user-specified function alignment. |
934 | Note that we still need to align to FUNCTION_BOUNDARY, as above, | |
935 | because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */ | |
936 | if (align_functions_log > align) | |
937 | { | |
938 | #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN | |
939 | ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file, | |
940 | align_functions_log, align_functions-1); | |
941 | #else | |
942 | ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log); | |
943 | #endif | |
944 | } | |
945 | ||
79e68feb RS |
946 | #ifdef ASM_OUTPUT_FUNCTION_PREFIX |
947 | ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname); | |
948 | #endif | |
949 | ||
950 | #ifdef SDB_DEBUGGING_INFO | |
951 | /* Output SDB definition of the function. */ | |
952 | if (write_symbols == SDB_DEBUG) | |
953 | sdbout_mark_begin_function (); | |
954 | #endif | |
955 | ||
956 | #ifdef DBX_DEBUGGING_INFO | |
e5c90c23 | 957 | /* Output DBX definition of the function. */ |
79e68feb | 958 | if (write_symbols == DBX_DEBUG) |
e5c90c23 | 959 | dbxout_begin_function (decl); |
79e68feb RS |
960 | #endif |
961 | ||
962 | /* Make function name accessible from other files, if appropriate. */ | |
963 | ||
964 | if (TREE_PUBLIC (decl)) | |
965 | { | |
ee830309 | 966 | if (! first_global_object_name) |
06bb02f7 | 967 | { |
ec940faa | 968 | const char *p; |
3b304f5b ZW |
969 | char *name; |
970 | ||
971 | STRIP_NAME_ENCODING (p, fnname); | |
972 | name = permalloc (strlen (p) + 1); | |
973 | strcpy (name, p); | |
ee830309 JM |
974 | |
975 | if (! DECL_WEAK (decl) && ! DECL_ONE_ONLY (decl)) | |
3b304f5b | 976 | first_global_object_name = name; |
ee830309 | 977 | else |
3b304f5b | 978 | weak_global_object_name = name; |
06bb02f7 RK |
979 | } |
980 | ||
daefd78b JM |
981 | #ifdef ASM_WEAKEN_LABEL |
982 | if (DECL_WEAK (decl)) | |
ec99e58f RL |
983 | { |
984 | ASM_WEAKEN_LABEL (asm_out_file, fnname); | |
985 | /* Remove this function from the pending weak list so that | |
986 | we do not emit multiple .weak directives for it. */ | |
987 | remove_from_pending_weak_list | |
988 | (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl))); | |
989 | } | |
48ad5afd | 990 | else |
daefd78b | 991 | #endif |
48ad5afd | 992 | ASM_GLOBALIZE_LABEL (asm_out_file, fnname); |
79e68feb RS |
993 | } |
994 | ||
995 | /* Do any machine/system dependent processing of the function name */ | |
8bd16853 | 996 | #ifdef ASM_DECLARE_FUNCTION_NAME |
b93a436e | 997 | ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl); |
8bd16853 | 998 | #else |
b93a436e JL |
999 | /* Standard thing is just output label for the function. */ |
1000 | ASM_OUTPUT_LABEL (asm_out_file, fnname); | |
79e68feb RS |
1001 | #endif /* ASM_DECLARE_FUNCTION_NAME */ |
1002 | } | |
1003 | ||
1004 | /* Output assembler code associated with defining the size of the | |
1005 | function. DECL describes the function. NAME is the function's name. */ | |
1006 | ||
1007 | void | |
1008 | assemble_end_function (decl, fnname) | |
1009 | tree decl; | |
d9bba9c3 | 1010 | const char *fnname; |
79e68feb RS |
1011 | { |
1012 | #ifdef ASM_DECLARE_FUNCTION_SIZE | |
1013 | ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl); | |
1014 | #endif | |
97adc6ed | 1015 | if (! CONSTANT_POOL_BEFORE_FUNCTION) |
83488369 RK |
1016 | { |
1017 | output_constant_pool (fnname, decl); | |
1018 | function_section (decl); /* need to switch back */ | |
1019 | } | |
8839fca4 ILT |
1020 | |
1021 | /* Output any constants which should appear after the function. */ | |
1022 | output_after_function_constants (); | |
79e68feb RS |
1023 | } |
1024 | \f | |
1025 | /* Assemble code to leave SIZE bytes of zeros. */ | |
1026 | ||
1027 | void | |
1028 | assemble_zeros (size) | |
1029 | int size; | |
1030 | { | |
3c350eb3 CB |
1031 | /* Do no output if -fsyntax-only. */ |
1032 | if (flag_syntax_only) | |
1033 | return; | |
1034 | ||
79e68feb RS |
1035 | #ifdef ASM_NO_SKIP_IN_TEXT |
1036 | /* The `space' pseudo in the text section outputs nop insns rather than 0s, | |
1037 | so we must output 0s explicitly in the text section. */ | |
1038 | if (ASM_NO_SKIP_IN_TEXT && in_text_section ()) | |
1039 | { | |
1040 | int i; | |
1041 | ||
1042 | for (i = 0; i < size - 20; i += 20) | |
1043 | { | |
1044 | #ifdef ASM_BYTE_OP | |
1045 | fprintf (asm_out_file, | |
e8638df0 | 1046 | "%s0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n", ASM_BYTE_OP); |
79e68feb RS |
1047 | #else |
1048 | fprintf (asm_out_file, | |
1049 | "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n"); | |
1050 | #endif | |
1051 | } | |
1052 | if (i < size) | |
1053 | { | |
1054 | #ifdef ASM_BYTE_OP | |
e8638df0 | 1055 | fprintf (asm_out_file, "%s0", ASM_BYTE_OP); |
79e68feb RS |
1056 | #else |
1057 | fprintf (asm_out_file, "\tbyte 0"); | |
1058 | #endif | |
1059 | i++; | |
1060 | for (; i < size; i++) | |
1061 | fprintf (asm_out_file, ",0"); | |
1062 | fprintf (asm_out_file, "\n"); | |
1063 | } | |
1064 | } | |
1065 | else | |
1066 | #endif | |
41fe4d9e | 1067 | if (size > 0) |
b93a436e | 1068 | ASM_OUTPUT_SKIP (asm_out_file, size); |
79e68feb RS |
1069 | } |
1070 | ||
a785e67e RS |
1071 | /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */ |
1072 | ||
1073 | void | |
1074 | assemble_align (align) | |
1075 | int align; | |
1076 | { | |
1077 | if (align > BITS_PER_UNIT) | |
1078 | ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT)); | |
1079 | } | |
1080 | ||
79e68feb RS |
1081 | /* Assemble a string constant with the specified C string as contents. */ |
1082 | ||
1083 | void | |
1084 | assemble_string (p, size) | |
9b3142b3 | 1085 | const char *p; |
79e68feb RS |
1086 | int size; |
1087 | { | |
79e68feb RS |
1088 | int pos = 0; |
1089 | int maximum = 2000; | |
1090 | ||
1091 | /* If the string is very long, split it up. */ | |
1092 | ||
1093 | while (pos < size) | |
1094 | { | |
1095 | int thissize = size - pos; | |
1096 | if (thissize > maximum) | |
1097 | thissize = maximum; | |
1098 | ||
b93a436e | 1099 | ASM_OUTPUT_ASCII (asm_out_file, p, thissize); |
79e68feb RS |
1100 | |
1101 | pos += thissize; | |
1102 | p += thissize; | |
1103 | } | |
1104 | } | |
69249c1b | 1105 | |
79e68feb | 1106 | \f |
b8694195 NC |
1107 | #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL |
1108 | #define ASM_EMIT_LOCAL(decl, name, size, rounded) \ | |
1109 | ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl)) | |
1110 | #else | |
1111 | #if defined ASM_OUTPUT_ALIGNED_LOCAL | |
1112 | #define ASM_EMIT_LOCAL(decl, name, size, rounded) \ | |
1113 | ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl)) | |
1114 | #else | |
1115 | #define ASM_EMIT_LOCAL(decl, name, size, rounded) \ | |
1116 | ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded) | |
1117 | #endif | |
1118 | #endif | |
1119 | ||
1120 | #if defined ASM_OUTPUT_ALIGNED_BSS | |
1121 | #define ASM_EMIT_BSS(decl, name, size, rounded) \ | |
1122 | ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl)) | |
1123 | #else | |
1124 | #if defined ASM_OUTPUT_BSS | |
1125 | #define ASM_EMIT_BSS(decl, name, size, rounded) \ | |
1126 | ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded) | |
1127 | #else | |
1128 | #undef ASM_EMIT_BSS | |
1129 | #endif | |
1130 | #endif | |
1131 | ||
1132 | #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON | |
1133 | #define ASM_EMIT_COMMON(decl, name, size, rounded) \ | |
1134 | ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl)) | |
1135 | #else | |
1136 | #if defined ASM_OUTPUT_ALIGNED_COMMON | |
1137 | #define ASM_EMIT_COMMON(decl, name, size, rounded) \ | |
1138 | ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl)) | |
1139 | #else | |
1140 | #define ASM_EMIT_COMMON(decl, name, size, rounded) \ | |
1141 | ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded) | |
1142 | #endif | |
1143 | #endif | |
1144 | ||
1145 | static void | |
1146 | asm_emit_uninitialised (decl, name, size, rounded) | |
1147 | tree decl; | |
3cce094d | 1148 | const char * name; |
05b13f59 | 1149 | int size ATTRIBUTE_UNUSED; |
95d75019 | 1150 | int rounded ATTRIBUTE_UNUSED; |
b8694195 | 1151 | { |
a56e7c08 NC |
1152 | enum |
1153 | { | |
b8694195 NC |
1154 | asm_dest_common, |
1155 | asm_dest_bss, | |
1156 | asm_dest_local | |
1157 | } | |
1158 | destination = asm_dest_local; | |
1159 | ||
1160 | if (TREE_PUBLIC (decl)) | |
1161 | { | |
1162 | #if defined ASM_EMIT_BSS | |
1163 | if (! DECL_COMMON (decl)) | |
1164 | destination = asm_dest_bss; | |
1165 | else | |
1166 | #endif | |
1167 | destination = asm_dest_common; | |
1168 | } | |
1169 | ||
1170 | if (flag_shared_data) | |
1171 | { | |
1172 | switch (destination) | |
1173 | { | |
1174 | #ifdef ASM_OUTPUT_SHARED_BSS | |
1175 | case asm_dest_bss: | |
1176 | ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded); | |
1177 | return; | |
1178 | #endif | |
1179 | #ifdef ASM_OUTPUT_SHARED_COMMON | |
1180 | case asm_dest_common: | |
1181 | ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded); | |
1182 | return; | |
1183 | #endif | |
1184 | #ifdef ASM_OUTPUT_SHARED_LOCAL | |
1185 | case asm_dest_local: | |
1186 | ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded); | |
1187 | return; | |
1188 | #endif | |
1189 | default: | |
1190 | break; | |
1191 | } | |
1192 | } | |
1193 | ||
a56e7c08 NC |
1194 | #ifdef ASM_OUTPUT_SECTION_NAME |
1195 | /* We already know that DECL_SECTION_NAME() == NULL. */ | |
1196 | if (flag_data_sections != 0 || UNIQUE_SECTION_P (decl)) | |
4edee0e6 | 1197 | UNIQUE_SECTION (decl, 0); |
a56e7c08 NC |
1198 | #endif |
1199 | ||
b8694195 NC |
1200 | switch (destination) |
1201 | { | |
1202 | #ifdef ASM_EMIT_BSS | |
1203 | case asm_dest_bss: | |
1204 | ASM_EMIT_BSS (decl, name, size, rounded); | |
1205 | break; | |
1206 | #endif | |
1207 | case asm_dest_common: | |
1208 | ASM_EMIT_COMMON (decl, name, size, rounded); | |
1209 | break; | |
1210 | case asm_dest_local: | |
1211 | ASM_EMIT_LOCAL (decl, name, size, rounded); | |
1212 | break; | |
1213 | default: | |
1214 | abort (); | |
1215 | } | |
1216 | ||
1217 | return; | |
1218 | } | |
1219 | ||
79e68feb RS |
1220 | /* Assemble everything that is needed for a variable or function declaration. |
1221 | Not used for automatic variables, and not used for function definitions. | |
1222 | Should not be called for variables of incomplete structure type. | |
1223 | ||
1224 | TOP_LEVEL is nonzero if this variable has file scope. | |
1225 | AT_END is nonzero if this is the special handling, at end of compilation, | |
ff8f4401 RS |
1226 | to define things that have had only tentative definitions. |
1227 | DONT_OUTPUT_DATA if nonzero means don't actually output the | |
1228 | initial value (that will be done by the caller). */ | |
79e68feb RS |
1229 | |
1230 | void | |
ff8f4401 | 1231 | assemble_variable (decl, top_level, at_end, dont_output_data) |
79e68feb | 1232 | tree decl; |
c84e2712 | 1233 | int top_level ATTRIBUTE_UNUSED; |
95d75019 | 1234 | int at_end ATTRIBUTE_UNUSED; |
5a13eaa4 | 1235 | int dont_output_data; |
79e68feb | 1236 | { |
3cce094d | 1237 | register const char *name; |
f8344bea | 1238 | unsigned int align; |
79e68feb | 1239 | int reloc = 0; |
edbc355b | 1240 | enum in_section saved_in_section; |
79e68feb | 1241 | |
cbed4565 RS |
1242 | last_assemble_variable_decl = 0; |
1243 | ||
d1d61788 | 1244 | if (DECL_RTL_SET_P (decl) && GET_CODE (DECL_RTL (decl)) == REG) |
79e68feb RS |
1245 | { |
1246 | /* Do output symbol info for global register variables, but do nothing | |
1247 | else for them. */ | |
1248 | ||
1249 | if (TREE_ASM_WRITTEN (decl)) | |
1250 | return; | |
1251 | TREE_ASM_WRITTEN (decl) = 1; | |
1252 | ||
3c350eb3 CB |
1253 | /* Do no output if -fsyntax-only. */ |
1254 | if (flag_syntax_only) | |
1255 | return; | |
1256 | ||
b4ac57ab | 1257 | #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO) |
b93a436e JL |
1258 | /* File-scope global variables are output here. */ |
1259 | if ((write_symbols == DBX_DEBUG || write_symbols == XCOFF_DEBUG) | |
1260 | && top_level) | |
1261 | dbxout_symbol (decl, 0); | |
79e68feb RS |
1262 | #endif |
1263 | #ifdef SDB_DEBUGGING_INFO | |
b93a436e JL |
1264 | if (write_symbols == SDB_DEBUG && top_level |
1265 | /* Leave initialized global vars for end of compilation; | |
1266 | see comment in compile_file. */ | |
1267 | && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0)) | |
1268 | sdbout_symbol (decl, 0); | |
79e68feb RS |
1269 | #endif |
1270 | ||
a94dbf2c JM |
1271 | /* Don't output any DWARF debugging information for variables here. |
1272 | In the case of local variables, the information for them is output | |
1273 | when we do our recursive traversal of the tree representation for | |
1274 | the entire containing function. In the case of file-scope variables, | |
1275 | we output information for all of them at the very end of compilation | |
1276 | while we are doing our final traversal of the chain of file-scope | |
1277 | declarations. */ | |
79e68feb RS |
1278 | |
1279 | return; | |
1280 | } | |
1281 | ||
d36d70cc | 1282 | /* Normally no need to say anything here for external references, |
9faa82d8 | 1283 | since assemble_external is called by the language-specific code |
d36d70cc | 1284 | when a declaration is first seen. */ |
79e68feb | 1285 | |
44fe2e80 | 1286 | if (DECL_EXTERNAL (decl)) |
79e68feb RS |
1287 | return; |
1288 | ||
1289 | /* Output no assembler code for a function declaration. | |
1290 | Only definitions of functions output anything. */ | |
1291 | ||
1292 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
1293 | return; | |
1294 | ||
1295 | /* If type was incomplete when the variable was declared, | |
1296 | see if it is complete now. */ | |
1297 | ||
1298 | if (DECL_SIZE (decl) == 0) | |
1299 | layout_decl (decl, 0); | |
1300 | ||
1301 | /* Still incomplete => don't allocate it; treat the tentative defn | |
1302 | (which is what it must have been) as an `extern' reference. */ | |
1303 | ||
ff8f4401 | 1304 | if (!dont_output_data && DECL_SIZE (decl) == 0) |
79e68feb RS |
1305 | { |
1306 | error_with_file_and_line (DECL_SOURCE_FILE (decl), | |
1307 | DECL_SOURCE_LINE (decl), | |
ea80ee44 | 1308 | "storage size of `%s' isn't known", |
79e68feb | 1309 | IDENTIFIER_POINTER (DECL_NAME (decl))); |
1c1a7ba4 | 1310 | TREE_ASM_WRITTEN (decl) = 1; |
79e68feb RS |
1311 | return; |
1312 | } | |
1313 | ||
1314 | /* The first declaration of a variable that comes through this function | |
1315 | decides whether it is global (in C, has external linkage) | |
1316 | or local (in C, has internal linkage). So do nothing more | |
1317 | if this function has already run. */ | |
1318 | ||
1319 | if (TREE_ASM_WRITTEN (decl)) | |
1320 | return; | |
1321 | ||
1322 | TREE_ASM_WRITTEN (decl) = 1; | |
1323 | ||
3c350eb3 CB |
1324 | /* Do no output if -fsyntax-only. */ |
1325 | if (flag_syntax_only) | |
1326 | return; | |
1327 | ||
809d6575 | 1328 | app_disable (); |
79e68feb | 1329 | |
770ae6cc RK |
1330 | if (! dont_output_data |
1331 | && ! host_integerp (DECL_SIZE_UNIT (decl), 1)) | |
ff8f4401 | 1332 | { |
770ae6cc RK |
1333 | error_with_decl (decl, "size of variable `%s' is too large"); |
1334 | goto finish; | |
79e68feb RS |
1335 | } |
1336 | ||
1337 | name = XSTR (XEXP (DECL_RTL (decl), 0), 0); | |
f796d997 JM |
1338 | if (TREE_PUBLIC (decl) && DECL_NAME (decl) |
1339 | && ! first_global_object_name | |
1340 | && ! (DECL_COMMON (decl) && (DECL_INITIAL (decl) == 0 | |
1341 | || DECL_INITIAL (decl) == error_mark_node)) | |
1342 | && ! DECL_WEAK (decl) | |
1343 | && ! DECL_ONE_ONLY (decl)) | |
1344 | { | |
ec940faa | 1345 | const char *p; |
3b304f5b | 1346 | char *xname; |
f796d997 JM |
1347 | |
1348 | STRIP_NAME_ENCODING (p, name); | |
3b304f5b ZW |
1349 | xname = permalloc (strlen (p) + 1); |
1350 | strcpy (xname, p); | |
1351 | first_global_object_name = xname; | |
f796d997 JM |
1352 | } |
1353 | ||
8a198bd2 JW |
1354 | /* Compute the alignment of this data. */ |
1355 | ||
1356 | align = DECL_ALIGN (decl); | |
1357 | ||
1358 | /* In the case for initialing an array whose length isn't specified, | |
1359 | where we have not yet been able to do the layout, | |
1360 | figure out the proper alignment now. */ | |
1361 | if (dont_output_data && DECL_SIZE (decl) == 0 | |
1362 | && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE) | |
1363 | align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl)))); | |
1364 | ||
1365 | /* Some object file formats have a maximum alignment which they support. | |
1366 | In particular, a.out format supports a maximum alignment of 4. */ | |
1367 | #ifndef MAX_OFILE_ALIGNMENT | |
1368 | #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT | |
1369 | #endif | |
1370 | if (align > MAX_OFILE_ALIGNMENT) | |
1371 | { | |
1372 | warning_with_decl (decl, | |
44ec7e59 CM |
1373 | "alignment of `%s' is greater than maximum object file alignment. Using %d.", |
1374 | MAX_OFILE_ALIGNMENT/BITS_PER_UNIT); | |
8a198bd2 JW |
1375 | align = MAX_OFILE_ALIGNMENT; |
1376 | } | |
1377 | ||
1378 | /* On some machines, it is good to increase alignment sometimes. */ | |
1379 | #ifdef DATA_ALIGNMENT | |
1380 | align = DATA_ALIGNMENT (TREE_TYPE (decl), align); | |
1381 | #endif | |
1382 | #ifdef CONSTANT_ALIGNMENT | |
1383 | if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node) | |
1384 | align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align); | |
1385 | #endif | |
1386 | ||
1387 | /* Reset the alignment in case we have made it tighter, so we can benefit | |
1388 | from it in get_pointer_alignment. */ | |
1389 | DECL_ALIGN (decl) = align; | |
1390 | ||
79e68feb RS |
1391 | /* Handle uninitialized definitions. */ |
1392 | ||
e5887033 DE |
1393 | if ((DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node) |
1394 | /* If the target can't output uninitialized but not common global data | |
1395 | in .bss, then we have to use .data. */ | |
b8694195 | 1396 | #if ! defined ASM_EMIT_BSS |
cd98bf12 | 1397 | && DECL_COMMON (decl) |
e5887033 | 1398 | #endif |
a56e7c08 | 1399 | && DECL_SECTION_NAME (decl) == NULL_TREE |
e5887033 | 1400 | && ! dont_output_data) |
79e68feb | 1401 | { |
770ae6cc RK |
1402 | unsigned HOST_WIDE_INT size = tree_low_cst (DECL_SIZE_UNIT (decl), 1); |
1403 | unsigned HOST_WIDE_INT rounded = size; | |
79e68feb | 1404 | |
79e68feb RS |
1405 | /* Don't allocate zero bytes of common, |
1406 | since that means "undefined external" in the linker. */ | |
770ae6cc RK |
1407 | if (size == 0) |
1408 | rounded = 1; | |
1409 | ||
79e68feb RS |
1410 | /* Round size up to multiple of BIGGEST_ALIGNMENT bits |
1411 | so that each uninitialized object starts on such a boundary. */ | |
1412 | rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1; | |
1413 | rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT) | |
1414 | * (BIGGEST_ALIGNMENT / BITS_PER_UNIT)); | |
4bcfa7a8 | 1415 | |
ec1bff50 HPN |
1416 | /* Don't continue this line--convex cc version 4.1 would lose. */ |
1417 | #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS) | |
4cf7705a | 1418 | if ((unsigned HOST_WIDE_INT) DECL_ALIGN (decl) / BITS_PER_UNIT > rounded) |
4bcfa7a8 CM |
1419 | warning_with_decl |
1420 | (decl, "requested alignment for %s is greater than implemented alignment of %d.",rounded); | |
1421 | #endif | |
1422 | ||
edbc355b RS |
1423 | #ifdef DBX_DEBUGGING_INFO |
1424 | /* File-scope global variables are output here. */ | |
1425 | if (write_symbols == DBX_DEBUG && top_level) | |
1426 | dbxout_symbol (decl, 0); | |
1427 | #endif | |
1428 | #ifdef SDB_DEBUGGING_INFO | |
1429 | if (write_symbols == SDB_DEBUG && top_level | |
1430 | /* Leave initialized global vars for end of compilation; | |
1431 | see comment in compile_file. */ | |
1432 | && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0)) | |
1433 | sdbout_symbol (decl, 0); | |
1434 | #endif | |
1435 | ||
a94dbf2c JM |
1436 | /* Don't output any DWARF debugging information for variables here. |
1437 | In the case of local variables, the information for them is output | |
1438 | when we do our recursive traversal of the tree representation for | |
1439 | the entire containing function. In the case of file-scope variables, | |
1440 | we output information for all of them at the very end of compilation | |
1441 | while we are doing our final traversal of the chain of file-scope | |
1442 | declarations. */ | |
edbc355b | 1443 | |
e5887033 DE |
1444 | #if 0 /* ??? We should either delete this or add a comment describing what |
1445 | it was intended to do and why we shouldn't delete it. */ | |
79e68feb RS |
1446 | if (flag_shared_data) |
1447 | data_section (); | |
1448 | #endif | |
b8694195 | 1449 | asm_emit_uninitialised (decl, name, size, rounded); |
e5887033 | 1450 | |
b4ac57ab | 1451 | goto finish; |
79e68feb RS |
1452 | } |
1453 | ||
e5887033 DE |
1454 | /* Handle initialized definitions. |
1455 | Also handle uninitialized global definitions if -fno-common and the | |
1456 | target doesn't support ASM_OUTPUT_BSS. */ | |
79e68feb RS |
1457 | |
1458 | /* First make the assembler name(s) global if appropriate. */ | |
1459 | if (TREE_PUBLIC (decl) && DECL_NAME (decl)) | |
1460 | { | |
daefd78b | 1461 | #ifdef ASM_WEAKEN_LABEL |
ec99e58f RL |
1462 | if (DECL_WEAK (decl)) |
1463 | { | |
1464 | ASM_WEAKEN_LABEL (asm_out_file, name); | |
1465 | /* Remove this variable from the pending weak list so that | |
1466 | we do not emit multiple .weak directives for it. */ | |
1467 | remove_from_pending_weak_list | |
1468 | (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl))); | |
1469 | } | |
48ad5afd | 1470 | else |
daefd78b | 1471 | #endif |
48ad5afd | 1472 | ASM_GLOBALIZE_LABEL (asm_out_file, name); |
79e68feb RS |
1473 | } |
1474 | #if 0 | |
1475 | for (d = equivalents; d; d = TREE_CHAIN (d)) | |
1476 | { | |
1477 | tree e = TREE_VALUE (d); | |
1478 | if (TREE_PUBLIC (e) && DECL_NAME (e)) | |
1479 | ASM_GLOBALIZE_LABEL (asm_out_file, | |
1480 | XSTR (XEXP (DECL_RTL (e), 0), 0)); | |
1481 | } | |
1482 | #endif | |
1483 | ||
1484 | /* Output any data that we will need to use the address of. */ | |
2e9effae RS |
1485 | if (DECL_INITIAL (decl) == error_mark_node) |
1486 | reloc = contains_pointers_p (TREE_TYPE (decl)); | |
1487 | else if (DECL_INITIAL (decl)) | |
79e68feb RS |
1488 | reloc = output_addressed_constants (DECL_INITIAL (decl)); |
1489 | ||
ad4ff310 | 1490 | #ifdef ASM_OUTPUT_SECTION_NAME |
a56e7c08 | 1491 | if ((flag_data_sections != 0 && DECL_SECTION_NAME (decl) == NULL_TREE) |
7d0756fb | 1492 | || UNIQUE_SECTION_P (decl)) |
ad4ff310 JM |
1493 | UNIQUE_SECTION (decl, reloc); |
1494 | #endif | |
1495 | ||
f9da1f35 DE |
1496 | /* Switch to the appropriate section. */ |
1497 | variable_section (decl, reloc); | |
79e68feb | 1498 | |
a8e2f179 RS |
1499 | /* dbxout.c needs to know this. */ |
1500 | if (in_text_section ()) | |
1501 | DECL_IN_TEXT_SECTION (decl) = 1; | |
1502 | ||
edbc355b RS |
1503 | /* Record current section so we can restore it if dbxout.c clobbers it. */ |
1504 | saved_in_section = in_section; | |
1505 | ||
1506 | /* Output the dbx info now that we have chosen the section. */ | |
1507 | ||
1508 | #ifdef DBX_DEBUGGING_INFO | |
1509 | /* File-scope global variables are output here. */ | |
1510 | if (write_symbols == DBX_DEBUG && top_level) | |
1511 | dbxout_symbol (decl, 0); | |
1512 | #endif | |
1513 | #ifdef SDB_DEBUGGING_INFO | |
1514 | if (write_symbols == SDB_DEBUG && top_level | |
1515 | /* Leave initialized global vars for end of compilation; | |
1516 | see comment in compile_file. */ | |
1517 | && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0)) | |
1518 | sdbout_symbol (decl, 0); | |
1519 | #endif | |
1520 | ||
1521 | /* Don't output any DWARF debugging information for variables here. | |
1522 | In the case of local variables, the information for them is output | |
1523 | when we do our recursive traversal of the tree representation for | |
1524 | the entire containing function. In the case of file-scope variables, | |
1525 | we output information for all of them at the very end of compilation | |
1526 | while we are doing our final traversal of the chain of file-scope | |
1527 | declarations. */ | |
1528 | ||
a8e2f179 RS |
1529 | /* If the debugging output changed sections, reselect the section |
1530 | that's supposed to be selected. */ | |
edbc355b | 1531 | if (in_section != saved_in_section) |
f9da1f35 | 1532 | variable_section (decl, reloc); |
edbc355b | 1533 | |
8a198bd2 | 1534 | /* Output the alignment of this data. */ |
79e68feb | 1535 | if (align > BITS_PER_UNIT) |
8a198bd2 JW |
1536 | ASM_OUTPUT_ALIGN (asm_out_file, |
1537 | floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT)); | |
79e68feb RS |
1538 | |
1539 | /* Do any machine/system dependent processing of the object. */ | |
8bd16853 | 1540 | #ifdef ASM_DECLARE_OBJECT_NAME |
b93a436e JL |
1541 | last_assemble_variable_decl = decl; |
1542 | ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl); | |
8bd16853 | 1543 | #else |
b93a436e JL |
1544 | /* Standard thing is just output label for the object. */ |
1545 | ASM_OUTPUT_LABEL (asm_out_file, name); | |
79e68feb RS |
1546 | #endif /* ASM_DECLARE_OBJECT_NAME */ |
1547 | ||
ff8f4401 | 1548 | if (!dont_output_data) |
79e68feb | 1549 | { |
ff8f4401 RS |
1550 | if (DECL_INITIAL (decl)) |
1551 | /* Output the actual data. */ | |
770ae6cc RK |
1552 | output_constant (DECL_INITIAL (decl), |
1553 | tree_low_cst (DECL_SIZE_UNIT (decl), 1)); | |
ff8f4401 RS |
1554 | else |
1555 | /* Leave space for it. */ | |
770ae6cc | 1556 | assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl), 1)); |
79e68feb | 1557 | } |
b4ac57ab RS |
1558 | |
1559 | finish: | |
1560 | #ifdef XCOFF_DEBUGGING_INFO | |
1561 | /* Unfortunately, the IBM assembler cannot handle stabx before the actual | |
1562 | declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted | |
1563 | and `aa' hasn't been output yet, the assembler generates a stab entry with | |
1564 | a value of zero, in addition to creating an unnecessary external entry | |
6dc42e49 | 1565 | for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */ |
b4ac57ab RS |
1566 | |
1567 | /* File-scope global variables are output here. */ | |
1568 | if (write_symbols == XCOFF_DEBUG && top_level) | |
05be4cea JW |
1569 | { |
1570 | saved_in_section = in_section; | |
1571 | ||
1572 | dbxout_symbol (decl, 0); | |
1573 | ||
1574 | if (in_section != saved_in_section) | |
f9da1f35 | 1575 | variable_section (decl, reloc); |
05be4cea | 1576 | } |
b4ac57ab RS |
1577 | #else |
1578 | /* There must be a statement after a label. */ | |
1579 | ; | |
1580 | #endif | |
79e68feb RS |
1581 | } |
1582 | ||
2e9effae RS |
1583 | /* Return 1 if type TYPE contains any pointers. */ |
1584 | ||
1585 | static int | |
1586 | contains_pointers_p (type) | |
1587 | tree type; | |
1588 | { | |
1589 | switch (TREE_CODE (type)) | |
1590 | { | |
1591 | case POINTER_TYPE: | |
1592 | case REFERENCE_TYPE: | |
1593 | /* I'm not sure whether OFFSET_TYPE needs this treatment, | |
1594 | so I'll play safe and return 1. */ | |
1595 | case OFFSET_TYPE: | |
1596 | return 1; | |
1597 | ||
1598 | case RECORD_TYPE: | |
1599 | case UNION_TYPE: | |
1600 | case QUAL_UNION_TYPE: | |
1601 | { | |
1602 | tree fields; | |
1603 | /* For a type that has fields, see if the fields have pointers. */ | |
1604 | for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields)) | |
ce49ea8a JM |
1605 | if (TREE_CODE (fields) == FIELD_DECL |
1606 | && contains_pointers_p (TREE_TYPE (fields))) | |
2e9effae RS |
1607 | return 1; |
1608 | return 0; | |
1609 | } | |
1610 | ||
1611 | case ARRAY_TYPE: | |
1612 | /* An array type contains pointers if its element type does. */ | |
1613 | return contains_pointers_p (TREE_TYPE (type)); | |
1614 | ||
1615 | default: | |
1616 | return 0; | |
1617 | } | |
1618 | } | |
1619 | ||
79e68feb | 1620 | /* Output something to declare an external symbol to the assembler. |
fff9e713 MT |
1621 | (Most assemblers don't need this, so we normally output nothing.) |
1622 | Do nothing if DECL is not external. */ | |
79e68feb RS |
1623 | |
1624 | void | |
1625 | assemble_external (decl) | |
91813b28 | 1626 | tree decl ATTRIBUTE_UNUSED; |
79e68feb | 1627 | { |
e6855a2d MM |
1628 | /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the |
1629 | main body of this code is only rarely exercised. To provide some | |
1630 | testing, on all platforms, we make sure that the ASM_OUT_FILE is | |
1631 | open. If it's not, we should not be calling this function. */ | |
1632 | if (!asm_out_file) | |
1633 | abort (); | |
1634 | ||
79e68feb | 1635 | #ifdef ASM_OUTPUT_EXTERNAL |
2f939d94 | 1636 | if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl)) |
79e68feb | 1637 | { |
fff9e713 MT |
1638 | rtx rtl = DECL_RTL (decl); |
1639 | ||
1640 | if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF | |
1641 | && ! SYMBOL_REF_USED (XEXP (rtl, 0))) | |
1642 | { | |
1643 | /* Some systems do require some output. */ | |
1644 | SYMBOL_REF_USED (XEXP (rtl, 0)) = 1; | |
1645 | ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0)); | |
1646 | } | |
79e68feb RS |
1647 | } |
1648 | #endif | |
1649 | } | |
1650 | ||
1651 | /* Similar, for calling a library function FUN. */ | |
1652 | ||
1653 | void | |
1654 | assemble_external_libcall (fun) | |
c84e2712 | 1655 | rtx fun ATTRIBUTE_UNUSED; |
79e68feb RS |
1656 | { |
1657 | #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL | |
b93a436e JL |
1658 | /* Declare library function name external when first used, if nec. */ |
1659 | if (! SYMBOL_REF_USED (fun)) | |
79e68feb | 1660 | { |
b93a436e JL |
1661 | SYMBOL_REF_USED (fun) = 1; |
1662 | ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun); | |
79e68feb RS |
1663 | } |
1664 | #endif | |
1665 | } | |
1666 | ||
1667 | /* Declare the label NAME global. */ | |
1668 | ||
1669 | void | |
1670 | assemble_global (name) | |
d9bba9c3 | 1671 | const char *name; |
79e68feb RS |
1672 | { |
1673 | ASM_GLOBALIZE_LABEL (asm_out_file, name); | |
1674 | } | |
1675 | ||
1676 | /* Assemble a label named NAME. */ | |
1677 | ||
1678 | void | |
1679 | assemble_label (name) | |
d9bba9c3 | 1680 | const char *name; |
79e68feb | 1681 | { |
b93a436e | 1682 | ASM_OUTPUT_LABEL (asm_out_file, name); |
79e68feb RS |
1683 | } |
1684 | ||
1685 | /* Output to FILE a reference to the assembler name of a C-level name NAME. | |
1686 | If NAME starts with a *, the rest of NAME is output verbatim. | |
1687 | Otherwise NAME is transformed in an implementation-defined way | |
1688 | (usually by the addition of an underscore). | |
1689 | Many macros in the tm file are defined to call this function. */ | |
1690 | ||
1691 | void | |
1692 | assemble_name (file, name) | |
1693 | FILE *file; | |
ec940faa | 1694 | const char *name; |
79e68feb | 1695 | { |
ec940faa | 1696 | const char *real_name; |
a94dbf2c | 1697 | tree id; |
648fb7cf RK |
1698 | |
1699 | STRIP_NAME_ENCODING (real_name, name); | |
7c6d4120 | 1700 | if (flag_prefix_function_name |
da61dec9 | 1701 | && ! memcmp (real_name, CHKR_PREFIX, CHKR_PREFIX_SIZE)) |
7c6d4120 | 1702 | real_name = real_name + CHKR_PREFIX_SIZE; |
87907387 | 1703 | |
a94dbf2c JM |
1704 | id = maybe_get_identifier (real_name); |
1705 | if (id) | |
1706 | TREE_SYMBOL_REFERENCED (id) = 1; | |
03e42132 | 1707 | |
79e68feb | 1708 | if (name[0] == '*') |
b93a436e | 1709 | fputs (&name[1], file); |
79e68feb | 1710 | else |
86aff125 | 1711 | ASM_OUTPUT_LABELREF (file, name); |
79e68feb RS |
1712 | } |
1713 | ||
1714 | /* Allocate SIZE bytes writable static space with a gensym name | |
1715 | and return an RTX to refer to its address. */ | |
1716 | ||
1717 | rtx | |
1718 | assemble_static_space (size) | |
1719 | int size; | |
1720 | { | |
1721 | char name[12]; | |
520a57c8 | 1722 | const char *namestring; |
79e68feb | 1723 | rtx x; |
79e68feb RS |
1724 | |
1725 | #if 0 | |
1726 | if (flag_shared_data) | |
1727 | data_section (); | |
1728 | #endif | |
1729 | ||
1730 | ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno); | |
1731 | ++const_labelno; | |
a8a05998 | 1732 | namestring = ggc_strdup (name); |
79e68feb | 1733 | |
b93a436e | 1734 | x = gen_rtx_SYMBOL_REF (Pmode, namestring); |
ca695ac9 | 1735 | |
e9a25f70 | 1736 | #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL |
b93a436e JL |
1737 | ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size, |
1738 | BIGGEST_ALIGNMENT); | |
e9a25f70 | 1739 | #else |
79e68feb | 1740 | #ifdef ASM_OUTPUT_ALIGNED_LOCAL |
b93a436e | 1741 | ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT); |
79e68feb | 1742 | #else |
e016950d KG |
1743 | { |
1744 | /* Round size up to multiple of BIGGEST_ALIGNMENT bits | |
1745 | so that each uninitialized object starts on such a boundary. */ | |
47c3ed98 KG |
1746 | /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */ |
1747 | int rounded ATTRIBUTE_UNUSED | |
1748 | = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1) | |
1749 | / (BIGGEST_ALIGNMENT / BITS_PER_UNIT) | |
1750 | * (BIGGEST_ALIGNMENT / BITS_PER_UNIT)); | |
e016950d KG |
1751 | ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded); |
1752 | } | |
e9a25f70 | 1753 | #endif |
79e68feb RS |
1754 | #endif |
1755 | return x; | |
1756 | } | |
1757 | ||
1758 | /* Assemble the static constant template for function entry trampolines. | |
1759 | This is done at most once per compilation. | |
1760 | Returns an RTX for the address of the template. */ | |
1761 | ||
f0e969bd | 1762 | #ifdef TRAMPOLINE_TEMPLATE |
79e68feb RS |
1763 | rtx |
1764 | assemble_trampoline_template () | |
1765 | { | |
1766 | char label[256]; | |
fc608b03 | 1767 | const char *name; |
79e68feb RS |
1768 | int align; |
1769 | ||
37552631 | 1770 | /* By default, put trampoline templates in read-only data section. */ |
f49acdb4 | 1771 | |
37552631 RS |
1772 | #ifdef TRAMPOLINE_SECTION |
1773 | TRAMPOLINE_SECTION (); | |
1774 | #else | |
c8c29f85 | 1775 | readonly_data_section (); |
37552631 | 1776 | #endif |
f49acdb4 | 1777 | |
79e68feb | 1778 | /* Write the assembler code to define one. */ |
073b0524 | 1779 | align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT); |
79e68feb RS |
1780 | if (align > 0) |
1781 | ASM_OUTPUT_ALIGN (asm_out_file, align); | |
1782 | ||
1783 | ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LTRAMP", 0); | |
1784 | TRAMPOLINE_TEMPLATE (asm_out_file); | |
1785 | ||
1786 | /* Record the rtl to refer to it. */ | |
1787 | ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0); | |
a8a05998 | 1788 | name = ggc_strdup (label); |
38a448ca | 1789 | return gen_rtx_SYMBOL_REF (Pmode, name); |
79e68feb | 1790 | } |
f0e969bd | 1791 | #endif |
79e68feb RS |
1792 | \f |
1793 | /* Assemble the integer constant X into an object of SIZE bytes. | |
1794 | X must be either a CONST_INT or CONST_DOUBLE. | |
1795 | ||
1796 | Return 1 if we were able to output the constant, otherwise 0. If FORCE is | |
1797 | non-zero, abort if we can't output the constant. */ | |
1798 | ||
1799 | int | |
1800 | assemble_integer (x, size, force) | |
1801 | rtx x; | |
1802 | int size; | |
1803 | int force; | |
1804 | { | |
1805 | /* First try to use the standard 1, 2, 4, 8, and 16 byte | |
0f41302f | 1806 | ASM_OUTPUT... macros. */ |
79e68feb RS |
1807 | |
1808 | switch (size) | |
1809 | { | |
1810 | #ifdef ASM_OUTPUT_CHAR | |
1811 | case 1: | |
1812 | ASM_OUTPUT_CHAR (asm_out_file, x); | |
1813 | return 1; | |
1814 | #endif | |
1815 | ||
1816 | #ifdef ASM_OUTPUT_SHORT | |
1817 | case 2: | |
1818 | ASM_OUTPUT_SHORT (asm_out_file, x); | |
1819 | return 1; | |
1820 | #endif | |
1821 | ||
1822 | #ifdef ASM_OUTPUT_INT | |
1823 | case 4: | |
1824 | ASM_OUTPUT_INT (asm_out_file, x); | |
1825 | return 1; | |
1826 | #endif | |
1827 | ||
1828 | #ifdef ASM_OUTPUT_DOUBLE_INT | |
1829 | case 8: | |
1830 | ASM_OUTPUT_DOUBLE_INT (asm_out_file, x); | |
1831 | return 1; | |
1832 | #endif | |
1833 | ||
1834 | #ifdef ASM_OUTPUT_QUADRUPLE_INT | |
1835 | case 16: | |
1836 | ASM_OUTPUT_QUADRUPLE_INT (asm_out_file, x); | |
1837 | return 1; | |
1838 | #endif | |
1839 | } | |
1840 | ||
1841 | /* If we couldn't do it that way, there are two other possibilities: First, | |
1842 | if the machine can output an explicit byte and this is a 1 byte constant, | |
1843 | we can use ASM_OUTPUT_BYTE. */ | |
1844 | ||
1845 | #ifdef ASM_OUTPUT_BYTE | |
1846 | if (size == 1 && GET_CODE (x) == CONST_INT) | |
1847 | { | |
1848 | ASM_OUTPUT_BYTE (asm_out_file, INTVAL (x)); | |
1849 | return 1; | |
1850 | } | |
1851 | #endif | |
1852 | ||
1853 | /* Finally, if SIZE is larger than a single word, try to output the constant | |
1854 | one word at a time. */ | |
1855 | ||
1856 | if (size > UNITS_PER_WORD) | |
1857 | { | |
1858 | int i; | |
1859 | enum machine_mode mode | |
1860 | = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0); | |
1861 | rtx word; | |
1862 | ||
1863 | for (i = 0; i < size / UNITS_PER_WORD; i++) | |
1864 | { | |
1865 | word = operand_subword (x, i, 0, mode); | |
1866 | ||
1867 | if (word == 0) | |
1868 | break; | |
1869 | ||
fff9e713 MT |
1870 | if (! assemble_integer (word, UNITS_PER_WORD, 0)) |
1871 | break; | |
79e68feb RS |
1872 | } |
1873 | ||
1874 | if (i == size / UNITS_PER_WORD) | |
1875 | return 1; | |
fff9e713 MT |
1876 | /* If we output at least one word and then could not finish, |
1877 | there is no valid way to continue. */ | |
1878 | if (i > 0) | |
1879 | abort (); | |
79e68feb RS |
1880 | } |
1881 | ||
1882 | if (force) | |
1883 | abort (); | |
1884 | ||
1885 | return 0; | |
1886 | } | |
1887 | \f | |
1888 | /* Assemble the floating-point constant D into an object of size MODE. */ | |
1889 | ||
1890 | void | |
1891 | assemble_real (d, mode) | |
1892 | REAL_VALUE_TYPE d; | |
1893 | enum machine_mode mode; | |
1894 | { | |
1895 | jmp_buf output_constant_handler; | |
1896 | ||
1897 | if (setjmp (output_constant_handler)) | |
1898 | { | |
1899 | error ("floating point trap outputting a constant"); | |
1900 | #ifdef REAL_IS_NOT_DOUBLE | |
da61dec9 | 1901 | memset ((char *) &d, 0, sizeof d); |
79e68feb RS |
1902 | d = dconst0; |
1903 | #else | |
1904 | d = 0; | |
1905 | #endif | |
1906 | } | |
1907 | ||
1908 | set_float_handler (output_constant_handler); | |
1909 | ||
1910 | switch (mode) | |
1911 | { | |
b7526ea5 RS |
1912 | #ifdef ASM_OUTPUT_BYTE_FLOAT |
1913 | case QFmode: | |
1914 | ASM_OUTPUT_BYTE_FLOAT (asm_out_file, d); | |
1915 | break; | |
1916 | #endif | |
1917 | #ifdef ASM_OUTPUT_SHORT_FLOAT | |
1918 | case HFmode: | |
1919 | ASM_OUTPUT_SHORT_FLOAT (asm_out_file, d); | |
1920 | break; | |
1921 | #endif | |
32c03bfb RK |
1922 | #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT |
1923 | case TQFmode: | |
1924 | ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file, d); | |
1925 | break; | |
1926 | #endif | |
79e68feb RS |
1927 | #ifdef ASM_OUTPUT_FLOAT |
1928 | case SFmode: | |
1929 | ASM_OUTPUT_FLOAT (asm_out_file, d); | |
1930 | break; | |
1931 | #endif | |
1932 | ||
1933 | #ifdef ASM_OUTPUT_DOUBLE | |
1934 | case DFmode: | |
1935 | ASM_OUTPUT_DOUBLE (asm_out_file, d); | |
1936 | break; | |
1937 | #endif | |
1938 | ||
1939 | #ifdef ASM_OUTPUT_LONG_DOUBLE | |
2c7ff63c | 1940 | case XFmode: |
79e68feb RS |
1941 | case TFmode: |
1942 | ASM_OUTPUT_LONG_DOUBLE (asm_out_file, d); | |
1943 | break; | |
1944 | #endif | |
1945 | ||
1946 | default: | |
1947 | abort (); | |
1948 | } | |
1949 | ||
6496a589 | 1950 | set_float_handler (NULL); |
79e68feb RS |
1951 | } |
1952 | \f | |
1953 | /* Here we combine duplicate floating constants to make | |
1954 | CONST_DOUBLE rtx's, and force those out to memory when necessary. */ | |
1955 | ||
4db92e9a | 1956 | /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints. |
79e68feb RS |
1957 | For an integer, I0 is the low-order word and I1 is the high-order word. |
1958 | For a real number, I0 is the word with the low address | |
1959 | and I1 is the word with the high address. */ | |
1960 | ||
1961 | rtx | |
1962 | immed_double_const (i0, i1, mode) | |
37366632 | 1963 | HOST_WIDE_INT i0, i1; |
79e68feb RS |
1964 | enum machine_mode mode; |
1965 | { | |
1966 | register rtx r; | |
79e68feb | 1967 | |
ab8ab9d0 SC |
1968 | if (GET_MODE_CLASS (mode) == MODE_INT |
1969 | || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT) | |
79e68feb RS |
1970 | { |
1971 | /* We clear out all bits that don't belong in MODE, unless they and our | |
1972 | sign bit are all one. So we get either a reasonable negative value | |
1973 | or a reasonable unsigned value for this mode. */ | |
1974 | int width = GET_MODE_BITSIZE (mode); | |
37366632 RK |
1975 | if (width < HOST_BITS_PER_WIDE_INT |
1976 | && ((i0 & ((HOST_WIDE_INT) (-1) << (width - 1))) | |
1977 | != ((HOST_WIDE_INT) (-1) << (width - 1)))) | |
1978 | i0 &= ((HOST_WIDE_INT) 1 << width) - 1, i1 = 0; | |
1979 | else if (width == HOST_BITS_PER_WIDE_INT | |
79e68feb RS |
1980 | && ! (i1 == ~0 && i0 < 0)) |
1981 | i1 = 0; | |
37366632 | 1982 | else if (width > 2 * HOST_BITS_PER_WIDE_INT) |
79e68feb RS |
1983 | /* We cannot represent this value as a constant. */ |
1984 | abort (); | |
1985 | ||
2ba3a0ec JW |
1986 | /* If this would be an entire word for the target, but is not for |
1987 | the host, then sign-extend on the host so that the number will look | |
1988 | the same way on the host that it would on the target. | |
1989 | ||
1990 | For example, when building a 64 bit alpha hosted 32 bit sparc | |
1991 | targeted compiler, then we want the 32 bit unsigned value -1 to be | |
1992 | represented as a 64 bit value -1, and not as 0x00000000ffffffff. | |
1993 | The later confuses the sparc backend. */ | |
1994 | ||
69107307 | 1995 | if (width < HOST_BITS_PER_WIDE_INT |
2ba3a0ec JW |
1996 | && (i0 & ((HOST_WIDE_INT) 1 << (width - 1)))) |
1997 | i0 |= ((HOST_WIDE_INT) (-1) << width); | |
1998 | ||
37366632 | 1999 | /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT. |
79e68feb RS |
2000 | |
2001 | ??? Strictly speaking, this is wrong if we create a CONST_INT | |
2002 | for a large unsigned constant with the size of MODE being | |
37366632 RK |
2003 | HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a |
2004 | wider mode. In that case we will mis-interpret it as a negative | |
2005 | number. | |
79e68feb RS |
2006 | |
2007 | Unfortunately, the only alternative is to make a CONST_DOUBLE | |
2008 | for any constant in any mode if it is an unsigned constant larger | |
2009 | than the maximum signed integer in an int on the host. However, | |
2010 | doing this will break everyone that always expects to see a CONST_INT | |
2011 | for SImode and smaller. | |
2012 | ||
2013 | We have always been making CONST_INTs in this case, so nothing new | |
2014 | is being broken. */ | |
2015 | ||
37366632 | 2016 | if (width <= HOST_BITS_PER_WIDE_INT) |
7bcac048 | 2017 | i1 = (i0 < 0) ? ~(HOST_WIDE_INT) 0 : 0; |
79e68feb RS |
2018 | |
2019 | /* If this integer fits in one word, return a CONST_INT. */ | |
2020 | if ((i1 == 0 && i0 >= 0) | |
2021 | || (i1 == ~0 && i0 < 0)) | |
37366632 | 2022 | return GEN_INT (i0); |
79e68feb RS |
2023 | |
2024 | /* We use VOIDmode for integers. */ | |
2025 | mode = VOIDmode; | |
2026 | } | |
2027 | ||
2028 | /* Search the chain for an existing CONST_DOUBLE with the right value. | |
2029 | If one is found, return it. */ | |
01d939e8 | 2030 | if (cfun != 0) |
36edd3cc BS |
2031 | for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r)) |
2032 | if (CONST_DOUBLE_LOW (r) == i0 && CONST_DOUBLE_HIGH (r) == i1 | |
2033 | && GET_MODE (r) == mode) | |
2034 | return r; | |
79e68feb | 2035 | |
1f8f4a0b | 2036 | /* No; make a new one and add it to the chain. */ |
f8a83ee3 | 2037 | r = gen_rtx_CONST_DOUBLE (mode, const0_rtx, i0, i1); |
79e68feb | 2038 | |
36edd3cc BS |
2039 | /* Don't touch const_double_chain if not inside any function. */ |
2040 | if (current_function_decl != 0) | |
5145eda8 RS |
2041 | { |
2042 | CONST_DOUBLE_CHAIN (r) = const_double_chain; | |
2043 | const_double_chain = r; | |
2044 | } | |
79e68feb | 2045 | |
79e68feb RS |
2046 | return r; |
2047 | } | |
2048 | ||
2049 | /* Return a CONST_DOUBLE for a specified `double' value | |
2050 | and machine mode. */ | |
2051 | ||
2052 | rtx | |
2053 | immed_real_const_1 (d, mode) | |
2054 | REAL_VALUE_TYPE d; | |
2055 | enum machine_mode mode; | |
2056 | { | |
2057 | union real_extract u; | |
2058 | register rtx r; | |
79e68feb RS |
2059 | |
2060 | /* Get the desired `double' value as a sequence of ints | |
2061 | since that is how they are stored in a CONST_DOUBLE. */ | |
2062 | ||
2063 | u.d = d; | |
2064 | ||
4cf7705a RK |
2065 | /* Detect special cases. But be careful we don't use a CONST_DOUBLE |
2066 | that's from a parent function since it may be in its constant pool. */ | |
2067 | if (REAL_VALUES_IDENTICAL (dconst0, d) | |
2068 | && (cfun == 0 || decl_function_context (current_function_decl) == 0)) | |
79e68feb | 2069 | return CONST0_RTX (mode); |
4cf7705a | 2070 | |
12194c38 RS |
2071 | /* Check for NaN first, because some ports (specifically the i386) do not |
2072 | emit correct ieee-fp code by default, and thus will generate a core | |
2073 | dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL | |
2074 | does a floating point comparison. */ | |
4cf7705a RK |
2075 | else if ((! REAL_VALUE_ISNAN (d) && REAL_VALUES_EQUAL (dconst1, d)) |
2076 | && (cfun == 0 | |
2077 | || decl_function_context (current_function_decl) == 0)) | |
79e68feb RS |
2078 | return CONST1_RTX (mode); |
2079 | ||
800d5c9e RH |
2080 | if (sizeof u == sizeof (HOST_WIDE_INT)) |
2081 | return immed_double_const (u.i[0], 0, mode); | |
37366632 | 2082 | if (sizeof u == 2 * sizeof (HOST_WIDE_INT)) |
79e68feb RS |
2083 | return immed_double_const (u.i[0], u.i[1], mode); |
2084 | ||
2085 | /* The rest of this function handles the case where | |
2086 | a float value requires more than 2 ints of space. | |
2087 | It will be deleted as dead code on machines that don't need it. */ | |
2088 | ||
2089 | /* Search the chain for an existing CONST_DOUBLE with the right value. | |
2090 | If one is found, return it. */ | |
01d939e8 | 2091 | if (cfun != 0) |
36edd3cc | 2092 | for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r)) |
da61dec9 | 2093 | if (! memcmp ((char *) &CONST_DOUBLE_LOW (r), (char *) &u, sizeof u) |
36edd3cc BS |
2094 | && GET_MODE (r) == mode) |
2095 | return r; | |
79e68feb RS |
2096 | |
2097 | /* No; make a new one and add it to the chain. | |
2098 | ||
2099 | We may be called by an optimizer which may be discarding any memory | |
2100 | allocated during its processing (such as combine and loop). However, | |
2101 | we will be leaving this constant on the chain, so we cannot tolerate | |
1f8f4a0b | 2102 | freed memory. */ |
79e68feb RS |
2103 | r = rtx_alloc (CONST_DOUBLE); |
2104 | PUT_MODE (r, mode); | |
da61dec9 | 2105 | memcpy ((char *) &CONST_DOUBLE_LOW (r), (char *) &u, sizeof u); |
79e68feb | 2106 | |
f8a83ee3 ZW |
2107 | /* If we aren't inside a function, don't put r on the |
2108 | const_double_chain. */ | |
36edd3cc | 2109 | if (current_function_decl != 0) |
5145eda8 RS |
2110 | { |
2111 | CONST_DOUBLE_CHAIN (r) = const_double_chain; | |
2112 | const_double_chain = r; | |
2113 | } | |
f8a83ee3 ZW |
2114 | else |
2115 | CONST_DOUBLE_CHAIN (r) = NULL_RTX; | |
79e68feb RS |
2116 | |
2117 | /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the | |
2118 | chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM | |
2119 | is only through force_const_mem. */ | |
2120 | ||
2121 | CONST_DOUBLE_MEM (r) = const0_rtx; | |
2122 | ||
2123 | return r; | |
2124 | } | |
2125 | ||
2126 | /* Return a CONST_DOUBLE rtx for a value specified by EXP, | |
2127 | which must be a REAL_CST tree node. */ | |
2128 | ||
2129 | rtx | |
2130 | immed_real_const (exp) | |
2131 | tree exp; | |
2132 | { | |
2133 | return immed_real_const_1 (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp))); | |
2134 | } | |
2135 | ||
2136 | /* At the end of a function, forget the memory-constants | |
2137 | previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain. | |
2138 | Also clear out real_constant_chain and clear out all the chain-pointers. */ | |
2139 | ||
2140 | void | |
2141 | clear_const_double_mem () | |
2142 | { | |
2143 | register rtx r, next; | |
2144 | ||
2145 | for (r = const_double_chain; r; r = next) | |
2146 | { | |
2147 | next = CONST_DOUBLE_CHAIN (r); | |
2148 | CONST_DOUBLE_CHAIN (r) = 0; | |
2149 | CONST_DOUBLE_MEM (r) = cc0_rtx; | |
2150 | } | |
2151 | const_double_chain = 0; | |
2152 | } | |
2153 | \f | |
2154 | /* Given an expression EXP with a constant value, | |
2155 | reduce it to the sum of an assembler symbol and an integer. | |
2156 | Store them both in the structure *VALUE. | |
2157 | Abort if EXP does not reduce. */ | |
2158 | ||
2159 | struct addr_const | |
2160 | { | |
2161 | rtx base; | |
fb351073 | 2162 | HOST_WIDE_INT offset; |
79e68feb RS |
2163 | }; |
2164 | ||
2165 | static void | |
2166 | decode_addr_const (exp, value) | |
2167 | tree exp; | |
2168 | struct addr_const *value; | |
2169 | { | |
2170 | register tree target = TREE_OPERAND (exp, 0); | |
2171 | register int offset = 0; | |
2172 | register rtx x; | |
2173 | ||
2174 | while (1) | |
2175 | { | |
2176 | if (TREE_CODE (target) == COMPONENT_REF | |
770ae6cc | 2177 | && host_integerp (byte_position (TREE_OPERAND (target, 1)), 0)) |
665f2503 | 2178 | |
79e68feb | 2179 | { |
770ae6cc | 2180 | offset += int_byte_position (TREE_OPERAND (target, 1)); |
79e68feb RS |
2181 | target = TREE_OPERAND (target, 0); |
2182 | } | |
b4e3fabb RK |
2183 | else if (TREE_CODE (target) == ARRAY_REF |
2184 | || TREE_CODE (target) == ARRAY_RANGE_REF) | |
79e68feb | 2185 | { |
770ae6cc RK |
2186 | offset += (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target)), 1) |
2187 | * tree_low_cst (TREE_OPERAND (target, 1), 0)); | |
79e68feb RS |
2188 | target = TREE_OPERAND (target, 0); |
2189 | } | |
2190 | else | |
2191 | break; | |
2192 | } | |
2193 | ||
2194 | switch (TREE_CODE (target)) | |
2195 | { | |
2196 | case VAR_DECL: | |
2197 | case FUNCTION_DECL: | |
2198 | x = DECL_RTL (target); | |
2199 | break; | |
2200 | ||
2201 | case LABEL_DECL: | |
b93a436e JL |
2202 | x = gen_rtx_MEM (FUNCTION_MODE, |
2203 | gen_rtx_LABEL_REF (VOIDmode, | |
2204 | label_rtx (TREE_OPERAND (exp, 0)))); | |
79e68feb RS |
2205 | break; |
2206 | ||
2207 | case REAL_CST: | |
2208 | case STRING_CST: | |
2209 | case COMPLEX_CST: | |
2210 | case CONSTRUCTOR: | |
2cf55b55 | 2211 | case INTEGER_CST: |
79e68feb RS |
2212 | x = TREE_CST_RTL (target); |
2213 | break; | |
2214 | ||
2215 | default: | |
2216 | abort (); | |
2217 | } | |
2218 | ||
b93a436e JL |
2219 | if (GET_CODE (x) != MEM) |
2220 | abort (); | |
2221 | x = XEXP (x, 0); | |
79e68feb RS |
2222 | |
2223 | value->base = x; | |
2224 | value->offset = offset; | |
2225 | } | |
2226 | \f | |
9612ab65 | 2227 | enum kind { RTX_DOUBLE, RTX_INT }; |
1f8f4a0b MM |
2228 | struct rtx_const |
2229 | { | |
9612ab65 ZW |
2230 | ENUM_BITFIELD(kind) kind : 16; |
2231 | ENUM_BITFIELD(machine_mode) mode : 16; | |
1f8f4a0b MM |
2232 | union { |
2233 | union real_extract du; | |
2234 | struct addr_const addr; | |
2235 | struct {HOST_WIDE_INT high, low;} di; | |
2236 | } un; | |
2237 | }; | |
2238 | ||
79e68feb RS |
2239 | /* Uniquize all constants that appear in memory. |
2240 | Each constant in memory thus far output is recorded | |
2241 | in `const_hash_table' with a `struct constant_descriptor' | |
2242 | that contains a polish representation of the value of | |
2243 | the constant. | |
2244 | ||
2245 | We cannot store the trees in the hash table | |
2246 | because the trees may be temporary. */ | |
2247 | ||
2248 | struct constant_descriptor | |
2249 | { | |
2250 | struct constant_descriptor *next; | |
520a57c8 | 2251 | const char *label; |
14a774a9 | 2252 | rtx rtl; |
37357796 RE |
2253 | /* Make sure the data is reasonably aligned. */ |
2254 | union | |
2255 | { | |
2256 | unsigned char contents[1]; | |
2257 | #ifdef HAVE_LONG_DOUBLE | |
2258 | long double d; | |
2259 | #else | |
2260 | double d; | |
2261 | #endif | |
2262 | } u; | |
79e68feb RS |
2263 | }; |
2264 | ||
2265 | #define HASHBITS 30 | |
2266 | #define MAX_HASH_TABLE 1009 | |
2267 | static struct constant_descriptor *const_hash_table[MAX_HASH_TABLE]; | |
2268 | ||
bd7cf17e JJ |
2269 | #define STRHASH(x) ((hashval_t)((long)(x) >> 3)) |
2270 | ||
2271 | struct deferred_string | |
2272 | { | |
520a57c8 | 2273 | const char *label; |
bd7cf17e JJ |
2274 | tree exp; |
2275 | int labelno; | |
2276 | }; | |
2277 | ||
2278 | static htab_t const_str_htab; | |
2279 | ||
76095e2f RH |
2280 | /* Mark a const_hash_table descriptor for GC. */ |
2281 | ||
2282 | static void | |
2283 | mark_const_hash_entry (ptr) | |
2284 | void *ptr; | |
2285 | { | |
2286 | struct constant_descriptor *desc = * (struct constant_descriptor **) ptr; | |
2287 | ||
2288 | while (desc) | |
2289 | { | |
14a774a9 | 2290 | ggc_mark_rtx (desc->rtl); |
76095e2f RH |
2291 | desc = desc->next; |
2292 | } | |
2293 | } | |
2294 | ||
bd7cf17e JJ |
2295 | /* Mark the hash-table element X (which is really a pointer to an |
2296 | struct deferred_string *). */ | |
2297 | ||
2298 | static int | |
2299 | mark_const_str_htab_1 (x, data) | |
2300 | void **x; | |
2301 | void *data ATTRIBUTE_UNUSED; | |
2302 | { | |
2303 | ggc_mark_tree (((struct deferred_string *) *x)->exp); | |
2304 | return 1; | |
2305 | } | |
2306 | ||
2307 | /* Mark a const_str_htab for GC. */ | |
2308 | ||
2309 | static void | |
2310 | mark_const_str_htab (htab) | |
2311 | void *htab; | |
2312 | { | |
2313 | htab_traverse (*((htab_t *) htab), mark_const_str_htab_1, NULL); | |
2314 | } | |
2315 | ||
2316 | /* Returns a hash code for X (which is a really a | |
2317 | struct deferred_string *). */ | |
2318 | ||
2319 | static hashval_t | |
2320 | const_str_htab_hash (x) | |
2321 | const void *x; | |
2322 | { | |
ce1cc601 | 2323 | return STRHASH (((const struct deferred_string *) x)->label); |
bd7cf17e JJ |
2324 | } |
2325 | ||
2326 | /* Returns non-zero if the value represented by X (which is really a | |
2327 | struct deferred_string *) is the same as that given by Y | |
2328 | (which is really a char *). */ | |
2329 | ||
2330 | static int | |
2331 | const_str_htab_eq (x, y) | |
2332 | const void *x; | |
2333 | const void *y; | |
2334 | { | |
ce1cc601 | 2335 | return (((const struct deferred_string *) x)->label == (const char *) y); |
bd7cf17e JJ |
2336 | } |
2337 | ||
2338 | /* Delete the hash table entry dfsp. */ | |
2339 | ||
2340 | static void | |
2341 | const_str_htab_del (dfsp) | |
2342 | void *dfsp; | |
2343 | { | |
2344 | free (dfsp); | |
2345 | } | |
2346 | ||
79e68feb RS |
2347 | /* Compute a hash code for a constant expression. */ |
2348 | ||
5a13eaa4 | 2349 | static int |
79e68feb RS |
2350 | const_hash (exp) |
2351 | tree exp; | |
2352 | { | |
3cce094d | 2353 | register const char *p; |
79e68feb RS |
2354 | register int len, hi, i; |
2355 | register enum tree_code code = TREE_CODE (exp); | |
2356 | ||
a9d07d6e RK |
2357 | /* Either set P and LEN to the address and len of something to hash and |
2358 | exit the switch or return a value. */ | |
2359 | ||
2360 | switch (code) | |
79e68feb | 2361 | { |
a9d07d6e | 2362 | case INTEGER_CST: |
2afaa41c GM |
2363 | p = (char *) &TREE_INT_CST (exp); |
2364 | len = sizeof TREE_INT_CST (exp); | |
a9d07d6e RK |
2365 | break; |
2366 | ||
2367 | case REAL_CST: | |
79e68feb RS |
2368 | p = (char *) &TREE_REAL_CST (exp); |
2369 | len = sizeof TREE_REAL_CST (exp); | |
a9d07d6e | 2370 | break; |
79e68feb | 2371 | |
a9d07d6e RK |
2372 | case STRING_CST: |
2373 | p = TREE_STRING_POINTER (exp); | |
2374 | len = TREE_STRING_LENGTH (exp); | |
2375 | break; | |
79e68feb | 2376 | |
a9d07d6e RK |
2377 | case COMPLEX_CST: |
2378 | return (const_hash (TREE_REALPART (exp)) * 5 | |
2379 | + const_hash (TREE_IMAGPART (exp))); | |
2380 | ||
2381 | case CONSTRUCTOR: | |
2382 | if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE) | |
79e68feb | 2383 | { |
3cce094d KG |
2384 | char *tmp; |
2385 | ||
a9d07d6e | 2386 | len = int_size_in_bytes (TREE_TYPE (exp)); |
3cce094d KG |
2387 | tmp = (char *) alloca (len); |
2388 | get_set_constructor_bytes (exp, (unsigned char *) tmp, len); | |
2389 | p = tmp; | |
a9d07d6e RK |
2390 | break; |
2391 | } | |
2392 | else | |
2393 | { | |
2394 | register tree link; | |
2395 | ||
2396 | /* For record type, include the type in the hashing. | |
2397 | We do not do so for array types | |
2398 | because (1) the sizes of the elements are sufficient | |
2399 | and (2) distinct array types can have the same constructor. | |
2400 | Instead, we include the array size because the constructor could | |
2401 | be shorter. */ | |
2402 | if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE) | |
7bcac048 | 2403 | hi = ((unsigned long) TREE_TYPE (exp) & ((1 << HASHBITS) - 1)) |
a9d07d6e RK |
2404 | % MAX_HASH_TABLE; |
2405 | else | |
2406 | hi = ((5 + int_size_in_bytes (TREE_TYPE (exp))) | |
2407 | & ((1 << HASHBITS) - 1)) % MAX_HASH_TABLE; | |
2408 | ||
2409 | for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link)) | |
2410 | if (TREE_VALUE (link)) | |
2411 | hi | |
2412 | = (hi * 603 + const_hash (TREE_VALUE (link))) % MAX_HASH_TABLE; | |
2413 | ||
2414 | return hi; | |
79e68feb | 2415 | } |
79e68feb | 2416 | |
a9d07d6e RK |
2417 | case ADDR_EXPR: |
2418 | { | |
2419 | struct addr_const value; | |
2420 | ||
2421 | decode_addr_const (exp, &value); | |
2422 | if (GET_CODE (value.base) == SYMBOL_REF) | |
2423 | { | |
2424 | /* Don't hash the address of the SYMBOL_REF; | |
2425 | only use the offset and the symbol name. */ | |
2426 | hi = value.offset; | |
2427 | p = XSTR (value.base, 0); | |
2428 | for (i = 0; p[i] != 0; i++) | |
2429 | hi = ((hi * 613) + (unsigned) (p[i])); | |
2430 | } | |
2431 | else if (GET_CODE (value.base) == LABEL_REF) | |
2432 | hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13; | |
6a651371 KG |
2433 | else |
2434 | abort(); | |
a9d07d6e RK |
2435 | |
2436 | hi &= (1 << HASHBITS) - 1; | |
2437 | hi %= MAX_HASH_TABLE; | |
2438 | } | |
79e68feb | 2439 | return hi; |
a9d07d6e RK |
2440 | |
2441 | case PLUS_EXPR: | |
2442 | case MINUS_EXPR: | |
2443 | return (const_hash (TREE_OPERAND (exp, 0)) * 9 | |
2444 | + const_hash (TREE_OPERAND (exp, 1))); | |
2445 | ||
2446 | case NOP_EXPR: | |
2447 | case CONVERT_EXPR: | |
2448 | case NON_LVALUE_EXPR: | |
2449 | return const_hash (TREE_OPERAND (exp, 0)) * 7 + 2; | |
e9a25f70 JL |
2450 | |
2451 | default: | |
990e8954 | 2452 | /* A language specific constant. Just hash the code. */ |
dbbbbf3b | 2453 | return (int) code % MAX_HASH_TABLE; |
79e68feb | 2454 | } |
79e68feb RS |
2455 | |
2456 | /* Compute hashing function */ | |
2457 | hi = len; | |
2458 | for (i = 0; i < len; i++) | |
0f41302f | 2459 | hi = ((hi * 613) + (unsigned) (p[i])); |
79e68feb RS |
2460 | |
2461 | hi &= (1 << HASHBITS) - 1; | |
2462 | hi %= MAX_HASH_TABLE; | |
2463 | return hi; | |
2464 | } | |
2465 | \f | |
2466 | /* Compare a constant expression EXP with a constant-descriptor DESC. | |
2467 | Return 1 if DESC describes a constant with the same value as EXP. */ | |
2468 | ||
2469 | static int | |
2470 | compare_constant (exp, desc) | |
2471 | tree exp; | |
2472 | struct constant_descriptor *desc; | |
2473 | { | |
37357796 | 2474 | return 0 != compare_constant_1 (exp, desc->u.contents); |
79e68feb RS |
2475 | } |
2476 | ||
2477 | /* Compare constant expression EXP with a substring P of a constant descriptor. | |
2478 | If they match, return a pointer to the end of the substring matched. | |
2479 | If they do not match, return 0. | |
2480 | ||
2481 | Since descriptors are written in polish prefix notation, | |
2482 | this function can be used recursively to test one operand of EXP | |
2483 | against a subdescriptor, and if it succeeds it returns the | |
2484 | address of the subdescriptor for the next operand. */ | |
2485 | ||
990e8954 | 2486 | static const unsigned char * |
79e68feb RS |
2487 | compare_constant_1 (exp, p) |
2488 | tree exp; | |
990e8954 | 2489 | const unsigned char *p; |
79e68feb | 2490 | { |
990e8954 | 2491 | register const unsigned char *strp; |
79e68feb RS |
2492 | register int len; |
2493 | register enum tree_code code = TREE_CODE (exp); | |
2494 | ||
2495 | if (code != (enum tree_code) *p++) | |
2496 | return 0; | |
2497 | ||
a9d07d6e RK |
2498 | /* Either set STRP, P and LEN to pointers and length to compare and exit the |
2499 | switch, or return the result of the comparison. */ | |
2500 | ||
2501 | switch (code) | |
79e68feb | 2502 | { |
a9d07d6e | 2503 | case INTEGER_CST: |
79e68feb RS |
2504 | /* Integer constants are the same only if the same width of type. */ |
2505 | if (*p++ != TYPE_PRECISION (TREE_TYPE (exp))) | |
2506 | return 0; | |
a9d07d6e | 2507 | |
2afaa41c GM |
2508 | strp = (unsigned char *) &TREE_INT_CST (exp); |
2509 | len = sizeof TREE_INT_CST (exp); | |
a9d07d6e RK |
2510 | break; |
2511 | ||
2512 | case REAL_CST: | |
79e68feb RS |
2513 | /* Real constants are the same only if the same width of type. */ |
2514 | if (*p++ != TYPE_PRECISION (TREE_TYPE (exp))) | |
2515 | return 0; | |
a9d07d6e | 2516 | |
990e8954 | 2517 | strp = (unsigned char *) &TREE_REAL_CST (exp); |
79e68feb | 2518 | len = sizeof TREE_REAL_CST (exp); |
a9d07d6e RK |
2519 | break; |
2520 | ||
2521 | case STRING_CST: | |
79e68feb RS |
2522 | if (flag_writable_strings) |
2523 | return 0; | |
a9d07d6e | 2524 | |
c8d8ed65 | 2525 | if ((enum machine_mode) *p++ != TYPE_MODE (TREE_TYPE (exp))) |
f163668c RK |
2526 | return 0; |
2527 | ||
ce1cc601 | 2528 | strp = (const unsigned char *)TREE_STRING_POINTER (exp); |
79e68feb | 2529 | len = TREE_STRING_LENGTH (exp); |
da61dec9 | 2530 | if (memcmp ((char *) &TREE_STRING_LENGTH (exp), p, |
79e68feb RS |
2531 | sizeof TREE_STRING_LENGTH (exp))) |
2532 | return 0; | |
a9d07d6e | 2533 | |
79e68feb | 2534 | p += sizeof TREE_STRING_LENGTH (exp); |
a9d07d6e | 2535 | break; |
79e68feb | 2536 | |
a9d07d6e RK |
2537 | case COMPLEX_CST: |
2538 | p = compare_constant_1 (TREE_REALPART (exp), p); | |
2539 | if (p == 0) | |
79e68feb | 2540 | return 0; |
79e68feb | 2541 | |
a9d07d6e | 2542 | return compare_constant_1 (TREE_IMAGPART (exp), p); |
79e68feb | 2543 | |
a9d07d6e RK |
2544 | case CONSTRUCTOR: |
2545 | if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE) | |
eb528802 | 2546 | { |
a9d07d6e | 2547 | int xlen = len = int_size_in_bytes (TREE_TYPE (exp)); |
3cce094d | 2548 | unsigned char *tmp = (unsigned char *) alloca (len); |
a9d07d6e | 2549 | |
f9e158c3 | 2550 | get_set_constructor_bytes (exp, tmp, len); |
990e8954 | 2551 | strp = (unsigned char *) tmp; |
da61dec9 | 2552 | if (memcmp ((char *) &xlen, p, sizeof xlen)) |
eb528802 | 2553 | return 0; |
eb528802 | 2554 | |
a9d07d6e RK |
2555 | p += sizeof xlen; |
2556 | break; | |
2557 | } | |
2558 | else | |
77fa0940 | 2559 | { |
a9d07d6e RK |
2560 | register tree link; |
2561 | int length = list_length (CONSTRUCTOR_ELTS (exp)); | |
2562 | tree type; | |
14a774a9 | 2563 | enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp)); |
e5e809f4 JL |
2564 | int have_purpose = 0; |
2565 | ||
2566 | for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link)) | |
2567 | if (TREE_PURPOSE (link)) | |
2568 | have_purpose = 1; | |
a9d07d6e | 2569 | |
da61dec9 | 2570 | if (memcmp ((char *) &length, p, sizeof length)) |
a9d07d6e RK |
2571 | return 0; |
2572 | ||
2573 | p += sizeof length; | |
2574 | ||
2575 | /* For record constructors, insist that the types match. | |
e5e809f4 JL |
2576 | For arrays, just verify both constructors are for arrays. |
2577 | Then insist that either both or none have any TREE_PURPOSE | |
2578 | values. */ | |
a9d07d6e RK |
2579 | if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE) |
2580 | type = TREE_TYPE (exp); | |
2581 | else | |
2582 | type = 0; | |
2583 | ||
da61dec9 | 2584 | if (memcmp ((char *) &type, p, sizeof type)) |
a9d07d6e RK |
2585 | return 0; |
2586 | ||
14a774a9 RK |
2587 | if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE) |
2588 | { | |
da61dec9 | 2589 | if (memcmp ((char *) &mode, p, sizeof mode)) |
14a774a9 RK |
2590 | return 0; |
2591 | ||
2592 | p += sizeof mode; | |
2593 | } | |
2594 | ||
a9d07d6e RK |
2595 | p += sizeof type; |
2596 | ||
da61dec9 | 2597 | if (memcmp ((char *) &have_purpose, p, sizeof have_purpose)) |
e5e809f4 JL |
2598 | return 0; |
2599 | ||
2600 | p += sizeof have_purpose; | |
2601 | ||
a9d07d6e RK |
2602 | /* For arrays, insist that the size in bytes match. */ |
2603 | if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE) | |
77fa0940 | 2604 | { |
e5e809f4 JL |
2605 | HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (exp)); |
2606 | ||
da61dec9 | 2607 | if (memcmp ((char *) &size, p, sizeof size)) |
77fa0940 | 2608 | return 0; |
a9d07d6e RK |
2609 | |
2610 | p += sizeof size; | |
77fa0940 | 2611 | } |
a9d07d6e RK |
2612 | |
2613 | for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link)) | |
77fa0940 | 2614 | { |
a9d07d6e RK |
2615 | if (TREE_VALUE (link)) |
2616 | { | |
2617 | if ((p = compare_constant_1 (TREE_VALUE (link), p)) == 0) | |
2618 | return 0; | |
2619 | } | |
2620 | else | |
2621 | { | |
2622 | tree zero = 0; | |
77fa0940 | 2623 | |
da61dec9 | 2624 | if (memcmp ((char *) &zero, p, sizeof zero)) |
e5e809f4 JL |
2625 | return 0; |
2626 | ||
2627 | p += sizeof zero; | |
2628 | } | |
2629 | ||
2630 | if (TREE_PURPOSE (link) | |
2631 | && TREE_CODE (TREE_PURPOSE (link)) == FIELD_DECL) | |
2632 | { | |
da61dec9 | 2633 | if (memcmp ((char *) &TREE_PURPOSE (link), p, |
e5e809f4 JL |
2634 | sizeof TREE_PURPOSE (link))) |
2635 | return 0; | |
2636 | ||
2637 | p += sizeof TREE_PURPOSE (link); | |
2638 | } | |
2639 | else if (TREE_PURPOSE (link)) | |
2640 | { | |
2641 | if ((p = compare_constant_1 (TREE_PURPOSE (link), p)) == 0) | |
2642 | return 0; | |
2643 | } | |
2644 | else if (have_purpose) | |
2645 | { | |
2646 | int zero = 0; | |
2647 | ||
da61dec9 | 2648 | if (memcmp ((char *) &zero, p, sizeof zero)) |
a9d07d6e RK |
2649 | return 0; |
2650 | ||
2651 | p += sizeof zero; | |
2652 | } | |
77fa0940 | 2653 | } |
a9d07d6e RK |
2654 | |
2655 | return p; | |
77fa0940 RK |
2656 | } |
2657 | ||
a9d07d6e RK |
2658 | case ADDR_EXPR: |
2659 | { | |
2660 | struct addr_const value; | |
2661 | ||
2662 | decode_addr_const (exp, &value); | |
990e8954 | 2663 | strp = (unsigned char *) &value.offset; |
a9d07d6e RK |
2664 | len = sizeof value.offset; |
2665 | /* Compare the offset. */ | |
2666 | while (--len >= 0) | |
2667 | if (*p++ != *strp++) | |
2668 | return 0; | |
2669 | ||
2670 | /* Compare symbol name. */ | |
ce1cc601 KG |
2671 | strp = (const unsigned char *) XSTR (value.base, 0); |
2672 | len = strlen ((const char *) strp) + 1; | |
a9d07d6e RK |
2673 | } |
2674 | break; | |
2675 | ||
2676 | case PLUS_EXPR: | |
2677 | case MINUS_EXPR: | |
fa212801 | 2678 | case RANGE_EXPR: |
79e68feb | 2679 | p = compare_constant_1 (TREE_OPERAND (exp, 0), p); |
a9d07d6e RK |
2680 | if (p == 0) |
2681 | return 0; | |
2682 | ||
2683 | return compare_constant_1 (TREE_OPERAND (exp, 1), p); | |
2684 | ||
2685 | case NOP_EXPR: | |
2686 | case CONVERT_EXPR: | |
2687 | case NON_LVALUE_EXPR: | |
2688 | return compare_constant_1 (TREE_OPERAND (exp, 0), p); | |
e9a25f70 JL |
2689 | |
2690 | default: | |
990e8954 NS |
2691 | if (lang_expand_constant) |
2692 | { | |
2693 | exp = (*lang_expand_constant) (exp); | |
2694 | return compare_constant_1 (exp, p); | |
2695 | } | |
2696 | return 0; | |
79e68feb RS |
2697 | } |
2698 | ||
2699 | /* Compare constant contents. */ | |
2700 | while (--len >= 0) | |
2701 | if (*p++ != *strp++) | |
2702 | return 0; | |
2703 | ||
2704 | return p; | |
2705 | } | |
2706 | \f | |
2707 | /* Construct a constant descriptor for the expression EXP. | |
2708 | It is up to the caller to enter the descriptor in the hash table. */ | |
2709 | ||
2710 | static struct constant_descriptor * | |
2711 | record_constant (exp) | |
2712 | tree exp; | |
2713 | { | |
387e854a RK |
2714 | struct constant_descriptor *next = 0; |
2715 | char *label = 0; | |
14a774a9 | 2716 | rtx rtl = 0; |
cac16ef9 | 2717 | int pad; |
79e68feb | 2718 | |
14a774a9 | 2719 | /* Make a struct constant_descriptor. The first three pointers will |
387e854a RK |
2720 | be filled in later. Here we just leave space for them. */ |
2721 | ||
2722 | obstack_grow (&permanent_obstack, (char *) &next, sizeof next); | |
2723 | obstack_grow (&permanent_obstack, (char *) &label, sizeof label); | |
14a774a9 | 2724 | obstack_grow (&permanent_obstack, (char *) &rtl, sizeof rtl); |
cac16ef9 RH |
2725 | |
2726 | /* Align the descriptor for the data payload. */ | |
2727 | pad = (offsetof (struct constant_descriptor, u) | |
2728 | - offsetof(struct constant_descriptor, rtl) | |
2729 | - sizeof(next->rtl)); | |
2730 | if (pad > 0) | |
2731 | obstack_blank (&permanent_obstack, pad); | |
2732 | ||
79e68feb RS |
2733 | record_constant_1 (exp); |
2734 | return (struct constant_descriptor *) obstack_finish (&permanent_obstack); | |
2735 | } | |
2736 | ||
2737 | /* Add a description of constant expression EXP | |
2738 | to the object growing in `permanent_obstack'. | |
2739 | No need to return its address; the caller will get that | |
2740 | from the obstack when the object is complete. */ | |
2741 | ||
2742 | static void | |
2743 | record_constant_1 (exp) | |
2744 | tree exp; | |
2745 | { | |
ce1cc601 | 2746 | register const unsigned char *strp; |
79e68feb RS |
2747 | register int len; |
2748 | register enum tree_code code = TREE_CODE (exp); | |
2749 | ||
2750 | obstack_1grow (&permanent_obstack, (unsigned int) code); | |
2751 | ||
2871d24f | 2752 | switch (code) |
79e68feb | 2753 | { |
2871d24f | 2754 | case INTEGER_CST: |
79e68feb | 2755 | obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp))); |
2afaa41c GM |
2756 | strp = (unsigned char *) &TREE_INT_CST (exp); |
2757 | len = sizeof TREE_INT_CST (exp); | |
2871d24f RK |
2758 | break; |
2759 | ||
2760 | case REAL_CST: | |
79e68feb | 2761 | obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp))); |
990e8954 | 2762 | strp = (unsigned char *) &TREE_REAL_CST (exp); |
79e68feb | 2763 | len = sizeof TREE_REAL_CST (exp); |
2871d24f RK |
2764 | break; |
2765 | ||
2766 | case STRING_CST: | |
79e68feb RS |
2767 | if (flag_writable_strings) |
2768 | return; | |
2871d24f | 2769 | |
f163668c | 2770 | obstack_1grow (&permanent_obstack, TYPE_MODE (TREE_TYPE (exp))); |
ce1cc601 | 2771 | strp = (const unsigned char *) TREE_STRING_POINTER (exp); |
79e68feb RS |
2772 | len = TREE_STRING_LENGTH (exp); |
2773 | obstack_grow (&permanent_obstack, (char *) &TREE_STRING_LENGTH (exp), | |
2774 | sizeof TREE_STRING_LENGTH (exp)); | |
2871d24f RK |
2775 | break; |
2776 | ||
2777 | case COMPLEX_CST: | |
79e68feb RS |
2778 | record_constant_1 (TREE_REALPART (exp)); |
2779 | record_constant_1 (TREE_IMAGPART (exp)); | |
2780 | return; | |
79e68feb | 2781 | |
2871d24f RK |
2782 | case CONSTRUCTOR: |
2783 | if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE) | |
eb528802 | 2784 | { |
2871d24f RK |
2785 | int nbytes = int_size_in_bytes (TREE_TYPE (exp)); |
2786 | obstack_grow (&permanent_obstack, &nbytes, sizeof (nbytes)); | |
2787 | obstack_blank (&permanent_obstack, nbytes); | |
2788 | get_set_constructor_bytes | |
2491d239 PB |
2789 | (exp, (unsigned char *) permanent_obstack.next_free-nbytes, |
2790 | nbytes); | |
2871d24f | 2791 | return; |
eb528802 | 2792 | } |
2871d24f | 2793 | else |
77fa0940 | 2794 | { |
2871d24f RK |
2795 | register tree link; |
2796 | int length = list_length (CONSTRUCTOR_ELTS (exp)); | |
14a774a9 | 2797 | enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp)); |
2871d24f | 2798 | tree type; |
e5e809f4 JL |
2799 | int have_purpose = 0; |
2800 | ||
2801 | for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link)) | |
2802 | if (TREE_PURPOSE (link)) | |
2803 | have_purpose = 1; | |
2871d24f RK |
2804 | |
2805 | obstack_grow (&permanent_obstack, (char *) &length, sizeof length); | |
2806 | ||
2807 | /* For record constructors, insist that the types match. | |
14a774a9 RK |
2808 | For arrays, just verify both constructors are for arrays |
2809 | of the same mode. Then insist that either both or none | |
2810 | have any TREE_PURPOSE values. */ | |
2871d24f RK |
2811 | if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE) |
2812 | type = TREE_TYPE (exp); | |
77fa0940 | 2813 | else |
2871d24f | 2814 | type = 0; |
14a774a9 | 2815 | |
2871d24f | 2816 | obstack_grow (&permanent_obstack, (char *) &type, sizeof type); |
14a774a9 RK |
2817 | if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE) |
2818 | obstack_grow (&permanent_obstack, &mode, sizeof mode); | |
2819 | ||
e5e809f4 JL |
2820 | obstack_grow (&permanent_obstack, (char *) &have_purpose, |
2821 | sizeof have_purpose); | |
2871d24f RK |
2822 | |
2823 | /* For arrays, insist that the size in bytes match. */ | |
2824 | if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE) | |
77fa0940 | 2825 | { |
e5e809f4 | 2826 | HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (exp)); |
2871d24f RK |
2827 | obstack_grow (&permanent_obstack, (char *) &size, sizeof size); |
2828 | } | |
77fa0940 | 2829 | |
2871d24f RK |
2830 | for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link)) |
2831 | { | |
2832 | if (TREE_VALUE (link)) | |
2833 | record_constant_1 (TREE_VALUE (link)); | |
2834 | else | |
2835 | { | |
2836 | tree zero = 0; | |
2837 | ||
e5e809f4 JL |
2838 | obstack_grow (&permanent_obstack, |
2839 | (char *) &zero, sizeof zero); | |
2840 | } | |
2841 | ||
2842 | if (TREE_PURPOSE (link) | |
2843 | && TREE_CODE (TREE_PURPOSE (link)) == FIELD_DECL) | |
2844 | obstack_grow (&permanent_obstack, | |
2845 | (char *) &TREE_PURPOSE (link), | |
2846 | sizeof TREE_PURPOSE (link)); | |
2847 | else if (TREE_PURPOSE (link)) | |
2848 | record_constant_1 (TREE_PURPOSE (link)); | |
2849 | else if (have_purpose) | |
2850 | { | |
2851 | int zero = 0; | |
2852 | ||
2871d24f RK |
2853 | obstack_grow (&permanent_obstack, |
2854 | (char *) &zero, sizeof zero); | |
2855 | } | |
77fa0940 RK |
2856 | } |
2857 | } | |
79e68feb | 2858 | return; |
2871d24f RK |
2859 | |
2860 | case ADDR_EXPR: | |
2861 | { | |
2862 | struct addr_const value; | |
2863 | ||
2864 | decode_addr_const (exp, &value); | |
2865 | /* Record the offset. */ | |
2866 | obstack_grow (&permanent_obstack, | |
2867 | (char *) &value.offset, sizeof value.offset); | |
e67cd9f8 RH |
2868 | |
2869 | switch (GET_CODE (value.base)) | |
2870 | { | |
2871 | case SYMBOL_REF: | |
2872 | /* Record the symbol name. */ | |
2873 | obstack_grow (&permanent_obstack, XSTR (value.base, 0), | |
2874 | strlen (XSTR (value.base, 0)) + 1); | |
2875 | break; | |
2876 | case LABEL_REF: | |
2877 | /* Record the address of the CODE_LABEL. It may not have | |
2878 | been emitted yet, so it's UID may be zero. But pointer | |
2879 | identity is good enough. */ | |
2880 | obstack_grow (&permanent_obstack, &XEXP (value.base, 0), | |
2881 | sizeof (rtx)); | |
2882 | break; | |
2883 | default: | |
2884 | abort (); | |
2885 | } | |
2871d24f | 2886 | } |
79e68feb | 2887 | return; |
2871d24f RK |
2888 | |
2889 | case PLUS_EXPR: | |
2890 | case MINUS_EXPR: | |
fa212801 | 2891 | case RANGE_EXPR: |
79e68feb RS |
2892 | record_constant_1 (TREE_OPERAND (exp, 0)); |
2893 | record_constant_1 (TREE_OPERAND (exp, 1)); | |
2894 | return; | |
2871d24f RK |
2895 | |
2896 | case NOP_EXPR: | |
2897 | case CONVERT_EXPR: | |
2898 | case NON_LVALUE_EXPR: | |
79e68feb RS |
2899 | record_constant_1 (TREE_OPERAND (exp, 0)); |
2900 | return; | |
2871d24f RK |
2901 | |
2902 | default: | |
990e8954 NS |
2903 | if (lang_expand_constant) |
2904 | { | |
2905 | exp = (*lang_expand_constant) (exp); | |
2906 | record_constant_1 (exp); | |
2907 | } | |
2908 | return; | |
79e68feb RS |
2909 | } |
2910 | ||
2911 | /* Record constant contents. */ | |
2912 | obstack_grow (&permanent_obstack, strp, len); | |
2913 | } | |
2914 | \f | |
ff8f4401 RS |
2915 | /* Record a list of constant expressions that were passed to |
2916 | output_constant_def but that could not be output right away. */ | |
2917 | ||
2918 | struct deferred_constant | |
2919 | { | |
2920 | struct deferred_constant *next; | |
2921 | tree exp; | |
2922 | int reloc; | |
2923 | int labelno; | |
2924 | }; | |
2925 | ||
2926 | static struct deferred_constant *deferred_constants; | |
2927 | ||
8839fca4 ILT |
2928 | /* Another list of constants which should be output after the |
2929 | function. */ | |
2930 | static struct deferred_constant *after_function_constants; | |
2931 | ||
ff8f4401 RS |
2932 | /* Nonzero means defer output of addressed subconstants |
2933 | (i.e., those for which output_constant_def is called.) */ | |
2934 | static int defer_addressed_constants_flag; | |
2935 | ||
2936 | /* Start deferring output of subconstants. */ | |
2937 | ||
2938 | void | |
2939 | defer_addressed_constants () | |
2940 | { | |
2941 | defer_addressed_constants_flag++; | |
2942 | } | |
2943 | ||
2944 | /* Stop deferring output of subconstants, | |
2945 | and output now all those that have been deferred. */ | |
2946 | ||
2947 | void | |
2948 | output_deferred_addressed_constants () | |
2949 | { | |
2950 | struct deferred_constant *p, *next; | |
2951 | ||
2952 | defer_addressed_constants_flag--; | |
2953 | ||
2954 | if (defer_addressed_constants_flag > 0) | |
2955 | return; | |
2956 | ||
2957 | for (p = deferred_constants; p; p = next) | |
2958 | { | |
2959 | output_constant_def_contents (p->exp, p->reloc, p->labelno); | |
2960 | next = p->next; | |
2961 | free (p); | |
2962 | } | |
2963 | ||
2964 | deferred_constants = 0; | |
2965 | } | |
d12516f1 | 2966 | |
8839fca4 ILT |
2967 | /* Output any constants which should appear after a function. */ |
2968 | ||
2969 | static void | |
2970 | output_after_function_constants () | |
2971 | { | |
2972 | struct deferred_constant *p, *next; | |
2973 | ||
2974 | for (p = after_function_constants; p; p = next) | |
2975 | { | |
2976 | output_constant_def_contents (p->exp, p->reloc, p->labelno); | |
2977 | next = p->next; | |
2978 | free (p); | |
2979 | } | |
2980 | ||
2981 | after_function_constants = 0; | |
2982 | } | |
2983 | ||
d12516f1 RS |
2984 | /* Make a copy of the whole tree structure for a constant. |
2985 | This handles the same types of nodes that compare_constant | |
2986 | and record_constant handle. */ | |
2987 | ||
2988 | static tree | |
2989 | copy_constant (exp) | |
2990 | tree exp; | |
2991 | { | |
2992 | switch (TREE_CODE (exp)) | |
2993 | { | |
310bbbf4 JW |
2994 | case ADDR_EXPR: |
2995 | /* For ADDR_EXPR, we do not want to copy the decl whose address | |
2996 | is requested. We do want to copy constants though. */ | |
2997 | if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c') | |
2998 | return build1 (TREE_CODE (exp), TREE_TYPE (exp), | |
2999 | copy_constant (TREE_OPERAND (exp, 0))); | |
3000 | else | |
3001 | return copy_node (exp); | |
3002 | ||
d12516f1 RS |
3003 | case INTEGER_CST: |
3004 | case REAL_CST: | |
3005 | case STRING_CST: | |
d12516f1 RS |
3006 | return copy_node (exp); |
3007 | ||
3008 | case COMPLEX_CST: | |
28eb1cb8 RK |
3009 | return build_complex (TREE_TYPE (exp), |
3010 | copy_constant (TREE_REALPART (exp)), | |
d12516f1 RS |
3011 | copy_constant (TREE_IMAGPART (exp))); |
3012 | ||
3013 | case PLUS_EXPR: | |
3014 | case MINUS_EXPR: | |
3015 | return build (TREE_CODE (exp), TREE_TYPE (exp), | |
3016 | copy_constant (TREE_OPERAND (exp, 0)), | |
3017 | copy_constant (TREE_OPERAND (exp, 1))); | |
3018 | ||
3019 | case NOP_EXPR: | |
3020 | case CONVERT_EXPR: | |
a9d07d6e | 3021 | case NON_LVALUE_EXPR: |
d12516f1 RS |
3022 | return build1 (TREE_CODE (exp), TREE_TYPE (exp), |
3023 | copy_constant (TREE_OPERAND (exp, 0))); | |
3024 | ||
3025 | case CONSTRUCTOR: | |
3026 | { | |
3027 | tree copy = copy_node (exp); | |
3028 | tree list = copy_list (CONSTRUCTOR_ELTS (exp)); | |
3029 | tree tail; | |
3030 | ||
bb31ce0a | 3031 | CONSTRUCTOR_ELTS (copy) = list; |
d12516f1 RS |
3032 | for (tail = list; tail; tail = TREE_CHAIN (tail)) |
3033 | TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail)); | |
474bda6c PB |
3034 | if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE) |
3035 | for (tail = list; tail; tail = TREE_CHAIN (tail)) | |
3036 | TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail)); | |
d12516f1 RS |
3037 | |
3038 | return copy; | |
3039 | } | |
3040 | ||
3041 | default: | |
3042 | abort (); | |
3043 | } | |
3044 | } | |
ff8f4401 | 3045 | \f |
79e68feb RS |
3046 | /* Return an rtx representing a reference to constant data in memory |
3047 | for the constant expression EXP. | |
ff8f4401 | 3048 | |
79e68feb RS |
3049 | If assembler code for such a constant has already been output, |
3050 | return an rtx to refer to it. | |
ff8f4401 RS |
3051 | Otherwise, output such a constant in memory (or defer it for later) |
3052 | and generate an rtx for it. | |
3053 | ||
bd7cf17e JJ |
3054 | If DEFER is non-zero, the output of string constants can be deferred |
3055 | and output only if referenced in the function after all optimizations. | |
3056 | ||
ff8f4401 | 3057 | The TREE_CST_RTL of EXP is set up to point to that rtx. |
79e68feb RS |
3058 | The const_hash_table records which constants already have label strings. */ |
3059 | ||
3060 | rtx | |
bd7cf17e | 3061 | output_constant_def (exp, defer) |
79e68feb | 3062 | tree exp; |
bd7cf17e | 3063 | int defer; |
79e68feb | 3064 | { |
ff8f4401 | 3065 | register int hash; |
79e68feb | 3066 | register struct constant_descriptor *desc; |
bd7cf17e | 3067 | struct deferred_string **defstr; |
79e68feb | 3068 | char label[256]; |
79e68feb | 3069 | int reloc; |
14a774a9 | 3070 | int found = 1; |
bd7cf17e JJ |
3071 | int after_function = 0; |
3072 | int labelno = -1; | |
79e68feb | 3073 | |
79e68feb RS |
3074 | if (TREE_CST_RTL (exp)) |
3075 | return TREE_CST_RTL (exp); | |
3076 | ||
3077 | /* Make sure any other constants whose addresses appear in EXP | |
3078 | are assigned label numbers. */ | |
3079 | ||
3080 | reloc = output_addressed_constants (exp); | |
3081 | ||
3082 | /* Compute hash code of EXP. Search the descriptors for that hash code | |
3083 | to see if any of them describes EXP. If yes, the descriptor records | |
3084 | the label number already assigned. */ | |
3085 | ||
00f07fb9 | 3086 | hash = const_hash (exp) % MAX_HASH_TABLE; |
ca695ac9 | 3087 | |
00f07fb9 RK |
3088 | for (desc = const_hash_table[hash]; desc; desc = desc->next) |
3089 | if (compare_constant (exp, desc)) | |
14a774a9 | 3090 | break; |
ca695ac9 | 3091 | |
14a774a9 | 3092 | if (desc == 0) |
00f07fb9 RK |
3093 | { |
3094 | /* No constant equal to EXP is known to have been output. | |
3095 | Make a constant descriptor to enter EXP in the hash table. | |
3096 | Assign the label number and record it in the descriptor for | |
3097 | future calls to this function to find. */ | |
ca695ac9 | 3098 | |
00f07fb9 | 3099 | /* Create a string containing the label name, in LABEL. */ |
bd7cf17e JJ |
3100 | labelno = const_labelno++; |
3101 | ASM_GENERATE_INTERNAL_LABEL (label, "LC", labelno); | |
00f07fb9 RK |
3102 | |
3103 | desc = record_constant (exp); | |
3104 | desc->next = const_hash_table[hash]; | |
a8a05998 | 3105 | desc->label = ggc_strdup (label); |
00f07fb9 | 3106 | const_hash_table[hash] = desc; |
ca695ac9 | 3107 | |
1f8f4a0b | 3108 | /* We have a symbol name; construct the SYMBOL_REF and the MEM. */ |
14a774a9 RK |
3109 | desc->rtl |
3110 | = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)), | |
3111 | gen_rtx_SYMBOL_REF (Pmode, desc->label)); | |
00f07fb9 | 3112 | |
289c5b45 | 3113 | set_mem_attributes (desc->rtl, exp, 1); |
14a774a9 RK |
3114 | |
3115 | found = 0; | |
3116 | } | |
3117 | ||
3118 | TREE_CST_RTL (exp) = desc->rtl; | |
79e68feb RS |
3119 | |
3120 | /* Optionally set flags or add text to the name to record information | |
3121 | such as that it is a function name. If the name is changed, the macro | |
8a425a05 | 3122 | ASM_OUTPUT_LABELREF will have to know how to strip this information. */ |
79e68feb | 3123 | #ifdef ENCODE_SECTION_INFO |
e1b4533c AO |
3124 | /* A previously-processed constant would already have section info |
3125 | encoded in it. */ | |
3126 | if (! found) | |
3127 | { | |
3128 | ENCODE_SECTION_INFO (exp); | |
3129 | desc->rtl = TREE_CST_RTL (exp); | |
3130 | desc->label = XSTR (XEXP (desc->rtl, 0), 0); | |
3131 | } | |
79e68feb RS |
3132 | #endif |
3133 | ||
bd7cf17e JJ |
3134 | #ifdef CONSTANT_AFTER_FUNCTION_P |
3135 | if (current_function_decl != 0 | |
3136 | && CONSTANT_AFTER_FUNCTION_P (exp)) | |
3137 | after_function = 1; | |
3138 | #endif | |
3139 | ||
3140 | if (found | |
3141 | && STRING_POOL_ADDRESS_P (XEXP (desc->rtl, 0)) | |
3142 | && (!defer || defer_addressed_constants_flag || after_function)) | |
3143 | { | |
3144 | defstr = (struct deferred_string **) | |
3145 | htab_find_slot_with_hash (const_str_htab, desc->label, | |
3146 | STRHASH (desc->label), NO_INSERT); | |
3147 | if (defstr) | |
3148 | { | |
3149 | /* If the string is currently deferred but we need to output it now, | |
3150 | remove it from deferred string hash table. */ | |
3151 | found = 0; | |
3152 | labelno = (*defstr)->labelno; | |
3153 | STRING_POOL_ADDRESS_P (XEXP (desc->rtl, 0)) = 0; | |
3154 | htab_clear_slot (const_str_htab, (void **) defstr); | |
3155 | } | |
3156 | } | |
3157 | ||
ff8f4401 RS |
3158 | /* If this is the first time we've seen this particular constant, |
3159 | output it (or defer its output for later). */ | |
14a774a9 | 3160 | if (! found) |
79e68feb | 3161 | { |
8839fca4 | 3162 | if (defer_addressed_constants_flag || after_function) |
ff8f4401 RS |
3163 | { |
3164 | struct deferred_constant *p; | |
3165 | p = (struct deferred_constant *) xmalloc (sizeof (struct deferred_constant)); | |
3166 | ||
d12516f1 | 3167 | p->exp = copy_constant (exp); |
ff8f4401 | 3168 | p->reloc = reloc; |
bd7cf17e | 3169 | p->labelno = labelno; |
8839fca4 ILT |
3170 | if (after_function) |
3171 | { | |
3172 | p->next = after_function_constants; | |
3173 | after_function_constants = p; | |
3174 | } | |
3175 | else | |
3176 | { | |
3177 | p->next = deferred_constants; | |
3178 | deferred_constants = p; | |
3179 | } | |
ff8f4401 RS |
3180 | } |
3181 | else | |
3c350eb3 CB |
3182 | { |
3183 | /* Do no output if -fsyntax-only. */ | |
3184 | if (! flag_syntax_only) | |
bd7cf17e JJ |
3185 | { |
3186 | if (TREE_CODE (exp) != STRING_CST | |
3187 | || !defer | |
3188 | || flag_writable_strings | |
3189 | || (defstr = (struct deferred_string **) | |
3190 | htab_find_slot_with_hash (const_str_htab, | |
3191 | desc->label, | |
3192 | STRHASH (desc->label), | |
3193 | INSERT)) == NULL) | |
3194 | output_constant_def_contents (exp, reloc, labelno); | |
3195 | else | |
3196 | { | |
3197 | struct deferred_string *p; | |
3198 | ||
3199 | p = (struct deferred_string *) | |
3200 | xmalloc (sizeof (struct deferred_string)); | |
3201 | ||
3202 | p->exp = copy_constant (exp); | |
3203 | p->label = desc->label; | |
3204 | p->labelno = labelno; | |
3205 | *defstr = p; | |
3206 | STRING_POOL_ADDRESS_P (XEXP (desc->rtl, 0)) = 1; | |
3207 | } | |
3208 | } | |
3c350eb3 | 3209 | } |
ff8f4401 RS |
3210 | } |
3211 | ||
3212 | return TREE_CST_RTL (exp); | |
3213 | } | |
3214 | ||
3215 | /* Now output assembler code to define the label for EXP, | |
3216 | and follow it with the data of EXP. */ | |
79e68feb | 3217 | |
ff8f4401 RS |
3218 | static void |
3219 | output_constant_def_contents (exp, reloc, labelno) | |
3220 | tree exp; | |
3221 | int reloc; | |
3222 | int labelno; | |
3223 | { | |
3224 | int align; | |
3225 | ||
8a425a05 | 3226 | if (IN_NAMED_SECTION (exp)) |
ad4ff310 | 3227 | named_section (exp, NULL, reloc); |
8a425a05 DE |
3228 | else |
3229 | { | |
3230 | /* First switch to text section, except for writable strings. */ | |
79e68feb | 3231 | #ifdef SELECT_SECTION |
8a425a05 | 3232 | SELECT_SECTION (exp, reloc); |
79e68feb | 3233 | #else |
8a425a05 DE |
3234 | if (((TREE_CODE (exp) == STRING_CST) && flag_writable_strings) |
3235 | || (flag_pic && reloc)) | |
3236 | data_section (); | |
3237 | else | |
3238 | readonly_data_section (); | |
79e68feb | 3239 | #endif |
8a425a05 | 3240 | } |
79e68feb | 3241 | |
ff8f4401 RS |
3242 | /* Align the location counter as required by EXP's data type. */ |
3243 | align = TYPE_ALIGN (TREE_TYPE (exp)); | |
79e68feb | 3244 | #ifdef CONSTANT_ALIGNMENT |
ff8f4401 | 3245 | align = CONSTANT_ALIGNMENT (exp, align); |
79e68feb RS |
3246 | #endif |
3247 | ||
ff8f4401 | 3248 | if (align > BITS_PER_UNIT) |
b93a436e | 3249 | ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT)); |
79e68feb | 3250 | |
ff8f4401 RS |
3251 | /* Output the label itself. */ |
3252 | ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", labelno); | |
79e68feb | 3253 | |
ff8f4401 RS |
3254 | /* Output the value of EXP. */ |
3255 | output_constant (exp, | |
3256 | (TREE_CODE (exp) == STRING_CST | |
3257 | ? TREE_STRING_LENGTH (exp) | |
3258 | : int_size_in_bytes (TREE_TYPE (exp)))); | |
79e68feb | 3259 | |
79e68feb RS |
3260 | } |
3261 | \f | |
79e68feb RS |
3262 | /* Structure to represent sufficient information about a constant so that |
3263 | it can be output when the constant pool is output, so that function | |
3264 | integration can be done, and to simplify handling on machines that reference | |
3265 | constant pool as base+displacement. */ | |
3266 | ||
3267 | struct pool_constant | |
3268 | { | |
3269 | struct constant_descriptor *desc; | |
94b01be3 | 3270 | struct pool_constant *next, *next_sym; |
520a57c8 | 3271 | const char *label; |
79e68feb | 3272 | rtx constant; |
94b01be3 | 3273 | enum machine_mode mode; |
79e68feb RS |
3274 | int labelno; |
3275 | int align; | |
3276 | int offset; | |
91674c37 | 3277 | int mark; |
79e68feb RS |
3278 | }; |
3279 | ||
79e68feb RS |
3280 | /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true. |
3281 | The argument is XSTR (... , 0) */ | |
3282 | ||
3283 | #define SYMHASH(LABEL) \ | |
7bcac048 | 3284 | ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE) |
79e68feb | 3285 | \f |
36edd3cc | 3286 | /* Initialize constant pool hashing for a new function. */ |
79e68feb RS |
3287 | |
3288 | void | |
36edd3cc BS |
3289 | init_varasm_status (f) |
3290 | struct function *f; | |
79e68feb | 3291 | { |
36edd3cc BS |
3292 | struct varasm_status *p; |
3293 | p = (struct varasm_status *) xmalloc (sizeof (struct varasm_status)); | |
3294 | f->varasm = p; | |
3295 | p->x_const_rtx_hash_table | |
57632c51 | 3296 | = ((struct constant_descriptor **) |
1f8f4a0b | 3297 | xcalloc (MAX_RTX_HASH_TABLE, sizeof (struct constant_descriptor *))); |
36edd3cc | 3298 | p->x_const_rtx_sym_hash_table |
94b01be3 JJ |
3299 | = ((struct pool_constant **) |
3300 | xcalloc (MAX_RTX_HASH_TABLE, sizeof (struct pool_constant *))); | |
79e68feb | 3301 | |
36edd3cc BS |
3302 | p->x_first_pool = p->x_last_pool = 0; |
3303 | p->x_pool_offset = 0; | |
3304 | p->x_const_double_chain = 0; | |
57632c51 | 3305 | } |
e2ecd91c | 3306 | |
87ff9c8e RH |
3307 | /* Mark PC for GC. */ |
3308 | ||
3309 | static void | |
3310 | mark_pool_constant (pc) | |
3311 | struct pool_constant *pc; | |
3312 | { | |
3313 | while (pc) | |
3314 | { | |
1f8f4a0b | 3315 | ggc_mark (pc); |
87ff9c8e RH |
3316 | ggc_mark_rtx (pc->constant); |
3317 | pc = pc->next; | |
3318 | } | |
3319 | } | |
3320 | ||
3321 | /* Mark P for GC. */ | |
3322 | ||
3323 | void | |
fa51b01b RH |
3324 | mark_varasm_status (p) |
3325 | struct varasm_status *p; | |
87ff9c8e | 3326 | { |
fa51b01b RH |
3327 | if (p == NULL) |
3328 | return; | |
3329 | ||
87ff9c8e RH |
3330 | mark_pool_constant (p->x_first_pool); |
3331 | ggc_mark_rtx (p->x_const_double_chain); | |
3332 | } | |
3333 | ||
21cd906e MM |
3334 | /* Clear out all parts of the state in F that can safely be discarded |
3335 | after the function has been compiled, to let garbage collection | |
0a8a198c | 3336 | reclaim the memory. */ |
21cd906e | 3337 | |
e2ecd91c | 3338 | void |
0a8a198c | 3339 | free_varasm_status (f) |
e2ecd91c BS |
3340 | struct function *f; |
3341 | { | |
21cd906e | 3342 | struct varasm_status *p; |
1f8f4a0b | 3343 | int i; |
21cd906e | 3344 | |
21cd906e | 3345 | p = f->varasm; |
1f8f4a0b MM |
3346 | |
3347 | /* Clear out the hash tables. */ | |
3348 | for (i = 0; i < MAX_RTX_HASH_TABLE; ++i) | |
3349 | { | |
3350 | struct constant_descriptor* cd; | |
1f8f4a0b MM |
3351 | |
3352 | cd = p->x_const_rtx_hash_table[i]; | |
3353 | while (cd) { | |
3354 | struct constant_descriptor* next = cd->next; | |
3355 | free (cd); | |
3356 | cd = next; | |
3357 | } | |
1f8f4a0b MM |
3358 | } |
3359 | ||
e2ecd91c BS |
3360 | free (p->x_const_rtx_hash_table); |
3361 | free (p->x_const_rtx_sym_hash_table); | |
fa51b01b RH |
3362 | free (p); |
3363 | f->varasm = NULL; | |
e2ecd91c | 3364 | } |
57632c51 | 3365 | \f |
79e68feb | 3366 | |
79e68feb RS |
3367 | /* Express an rtx for a constant integer (perhaps symbolic) |
3368 | as the sum of a symbol or label plus an explicit integer. | |
3369 | They are stored into VALUE. */ | |
3370 | ||
3371 | static void | |
3372 | decode_rtx_const (mode, x, value) | |
3373 | enum machine_mode mode; | |
3374 | rtx x; | |
3375 | struct rtx_const *value; | |
3376 | { | |
3377 | /* Clear the whole structure, including any gaps. */ | |
da61dec9 | 3378 | memset (value, 0, sizeof (struct rtx_const)); |
79e68feb | 3379 | |
0f41302f | 3380 | value->kind = RTX_INT; /* Most usual kind. */ |
79e68feb RS |
3381 | value->mode = mode; |
3382 | ||
3383 | switch (GET_CODE (x)) | |
3384 | { | |
3385 | case CONST_DOUBLE: | |
3386 | value->kind = RTX_DOUBLE; | |
56e2d435 | 3387 | if (GET_MODE (x) != VOIDmode) |
0b19a5b9 RK |
3388 | { |
3389 | value->mode = GET_MODE (x); | |
da61dec9 JM |
3390 | memcpy ((char *) &value->un.du, |
3391 | (char *) &CONST_DOUBLE_LOW (x), sizeof value->un.du); | |
0b19a5b9 RK |
3392 | } |
3393 | else | |
3394 | { | |
3395 | value->un.di.low = CONST_DOUBLE_LOW (x); | |
3396 | value->un.di.high = CONST_DOUBLE_HIGH (x); | |
3397 | } | |
79e68feb RS |
3398 | break; |
3399 | ||
3400 | case CONST_INT: | |
3401 | value->un.addr.offset = INTVAL (x); | |
3402 | break; | |
3403 | ||
3404 | case SYMBOL_REF: | |
3405 | case LABEL_REF: | |
3d037392 | 3406 | case PC: |
79e68feb RS |
3407 | value->un.addr.base = x; |
3408 | break; | |
3409 | ||
3410 | case CONST: | |
3411 | x = XEXP (x, 0); | |
422be3c3 | 3412 | if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 1)) == CONST_INT) |
79e68feb RS |
3413 | { |
3414 | value->un.addr.base = XEXP (x, 0); | |
79e68feb RS |
3415 | value->un.addr.offset = INTVAL (XEXP (x, 1)); |
3416 | } | |
422be3c3 | 3417 | else if (GET_CODE (x) == MINUS && GET_CODE (XEXP (x, 1)) == CONST_INT) |
79e68feb RS |
3418 | { |
3419 | value->un.addr.base = XEXP (x, 0); | |
79e68feb RS |
3420 | value->un.addr.offset = - INTVAL (XEXP (x, 1)); |
3421 | } | |
3422 | else | |
422be3c3 AO |
3423 | { |
3424 | value->un.addr.base = x; | |
3425 | value->un.addr.offset = 0; | |
3426 | } | |
79e68feb RS |
3427 | break; |
3428 | ||
3429 | default: | |
3430 | abort (); | |
3431 | } | |
3432 | ||
3433 | if (value->kind == RTX_INT && value->un.addr.base != 0) | |
3434 | switch (GET_CODE (value->un.addr.base)) | |
3435 | { | |
3436 | case SYMBOL_REF: | |
79e68feb | 3437 | /* Use the string's address, not the SYMBOL_REF's address, |
241a1bcc | 3438 | for the sake of addresses of library routines. */ |
dd1bd863 | 3439 | value->un.addr.base = (rtx) XSTR (value->un.addr.base, 0); |
241a1bcc FS |
3440 | break; |
3441 | ||
3442 | case LABEL_REF: | |
3443 | /* For a LABEL_REF, compare labels. */ | |
79e68feb | 3444 | value->un.addr.base = XEXP (value->un.addr.base, 0); |
e9a25f70 JL |
3445 | |
3446 | default: | |
3447 | break; | |
79e68feb RS |
3448 | } |
3449 | } | |
3450 | ||
57632c51 RS |
3451 | /* Given a MINUS expression, simplify it if both sides |
3452 | include the same symbol. */ | |
3453 | ||
3454 | rtx | |
3455 | simplify_subtraction (x) | |
3456 | rtx x; | |
3457 | { | |
3458 | struct rtx_const val0, val1; | |
3459 | ||
3460 | decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0); | |
3461 | decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1); | |
3462 | ||
3463 | if (val0.un.addr.base == val1.un.addr.base) | |
3464 | return GEN_INT (val0.un.addr.offset - val1.un.addr.offset); | |
3465 | return x; | |
3466 | } | |
3467 | ||
79e68feb RS |
3468 | /* Compute a hash code for a constant RTL expression. */ |
3469 | ||
5a13eaa4 | 3470 | static int |
79e68feb RS |
3471 | const_hash_rtx (mode, x) |
3472 | enum machine_mode mode; | |
3473 | rtx x; | |
3474 | { | |
f8344bea MH |
3475 | register int hi; |
3476 | register size_t i; | |
79e68feb RS |
3477 | |
3478 | struct rtx_const value; | |
3479 | decode_rtx_const (mode, x, &value); | |
3480 | ||
3481 | /* Compute hashing function */ | |
3482 | hi = 0; | |
3483 | for (i = 0; i < sizeof value / sizeof (int); i++) | |
3484 | hi += ((int *) &value)[i]; | |
3485 | ||
3486 | hi &= (1 << HASHBITS) - 1; | |
3487 | hi %= MAX_RTX_HASH_TABLE; | |
3488 | return hi; | |
3489 | } | |
3490 | ||
3491 | /* Compare a constant rtl object X with a constant-descriptor DESC. | |
3492 | Return 1 if DESC describes a constant with the same value as X. */ | |
3493 | ||
3494 | static int | |
3495 | compare_constant_rtx (mode, x, desc) | |
3496 | enum machine_mode mode; | |
3497 | rtx x; | |
3498 | struct constant_descriptor *desc; | |
3499 | { | |
37357796 | 3500 | register int *p = (int *) desc->u.contents; |
79e68feb RS |
3501 | register int *strp; |
3502 | register int len; | |
3503 | struct rtx_const value; | |
3504 | ||
3505 | decode_rtx_const (mode, x, &value); | |
3506 | strp = (int *) &value; | |
3507 | len = sizeof value / sizeof (int); | |
3508 | ||
3509 | /* Compare constant contents. */ | |
3510 | while (--len >= 0) | |
3511 | if (*p++ != *strp++) | |
3512 | return 0; | |
3513 | ||
3514 | return 1; | |
3515 | } | |
3516 | ||
3517 | /* Construct a constant descriptor for the rtl-expression X. | |
3518 | It is up to the caller to enter the descriptor in the hash table. */ | |
3519 | ||
3520 | static struct constant_descriptor * | |
3521 | record_constant_rtx (mode, x) | |
3522 | enum machine_mode mode; | |
3523 | rtx x; | |
3524 | { | |
3525 | struct constant_descriptor *ptr; | |
79e68feb | 3526 | |
1f8f4a0b | 3527 | ptr = ((struct constant_descriptor *) |
37357796 RE |
3528 | xcalloc (1, (offsetof (struct constant_descriptor, u) |
3529 | + sizeof (struct rtx_const)))); | |
3530 | decode_rtx_const (mode, x, (struct rtx_const *) ptr->u.contents); | |
79e68feb | 3531 | |
1f8f4a0b | 3532 | return ptr; |
79e68feb RS |
3533 | } |
3534 | \f | |
3535 | /* Given a constant rtx X, make (or find) a memory constant for its value | |
3536 | and return a MEM rtx to refer to it in memory. */ | |
3537 | ||
3538 | rtx | |
3539 | force_const_mem (mode, x) | |
3540 | enum machine_mode mode; | |
3541 | rtx x; | |
3542 | { | |
3543 | register int hash; | |
3544 | register struct constant_descriptor *desc; | |
3545 | char label[256]; | |
520a57c8 | 3546 | const char *found = 0; |
79e68feb RS |
3547 | rtx def; |
3548 | ||
3549 | /* If we want this CONST_DOUBLE in the same mode as it is in memory | |
3550 | (this will always be true for floating CONST_DOUBLEs that have been | |
3551 | placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs), | |
3552 | use the previous copy. Otherwise, make a new one. Note that in | |
3553 | the unlikely event that this same CONST_DOUBLE is used in two different | |
3554 | modes in an alternating fashion, we will allocate a lot of different | |
3555 | memory locations, but this should be extremely rare. */ | |
3556 | ||
36edd3cc BS |
3557 | if (GET_CODE (x) == CONST_DOUBLE |
3558 | && GET_CODE (CONST_DOUBLE_MEM (x)) == MEM | |
3559 | && GET_MODE (CONST_DOUBLE_MEM (x)) == mode) | |
3560 | return CONST_DOUBLE_MEM (x); | |
79e68feb RS |
3561 | |
3562 | /* Compute hash code of X. Search the descriptors for that hash code | |
3563 | to see if any of them describes X. If yes, the descriptor records | |
3564 | the label number already assigned. */ | |
3565 | ||
3566 | hash = const_hash_rtx (mode, x); | |
3567 | ||
3568 | for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next) | |
3569 | if (compare_constant_rtx (mode, x, desc)) | |
3570 | { | |
3571 | found = desc->label; | |
3572 | break; | |
3573 | } | |
3574 | ||
3575 | if (found == 0) | |
3576 | { | |
3577 | register struct pool_constant *pool; | |
79e68feb RS |
3578 | int align; |
3579 | ||
3580 | /* No constant equal to X is known to have been output. | |
3581 | Make a constant descriptor to enter X in the hash table. | |
3582 | Assign the label number and record it in the descriptor for | |
3583 | future calls to this function to find. */ | |
3584 | ||
3585 | desc = record_constant_rtx (mode, x); | |
3586 | desc->next = const_rtx_hash_table[hash]; | |
3587 | const_rtx_hash_table[hash] = desc; | |
3588 | ||
3589 | /* Align the location counter as required by EXP's data type. */ | |
3590 | align = (mode == VOIDmode) ? UNITS_PER_WORD : GET_MODE_SIZE (mode); | |
3591 | if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT) | |
3592 | align = BIGGEST_ALIGNMENT / BITS_PER_UNIT; | |
e5e8a8bf JW |
3593 | #ifdef CONSTANT_ALIGNMENT |
3594 | align = CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode, 0), x), | |
3595 | align * BITS_PER_UNIT) / BITS_PER_UNIT; | |
3596 | #endif | |
79e68feb RS |
3597 | |
3598 | pool_offset += align - 1; | |
3599 | pool_offset &= ~ (align - 1); | |
3600 | ||
5bb86bf2 JL |
3601 | if (GET_CODE (x) == LABEL_REF) |
3602 | LABEL_PRESERVE_P (XEXP (x, 0)) = 1; | |
3603 | ||
79e68feb RS |
3604 | /* Allocate a pool constant descriptor, fill it in, and chain it in. */ |
3605 | ||
1f8f4a0b | 3606 | pool = (struct pool_constant *) ggc_alloc (sizeof (struct pool_constant)); |
79e68feb RS |
3607 | pool->desc = desc; |
3608 | pool->constant = x; | |
3609 | pool->mode = mode; | |
3610 | pool->labelno = const_labelno; | |
3611 | pool->align = align; | |
3612 | pool->offset = pool_offset; | |
d2ce9169 | 3613 | pool->mark = 1; |
79e68feb RS |
3614 | pool->next = 0; |
3615 | ||
3616 | if (last_pool == 0) | |
3617 | first_pool = pool; | |
3618 | else | |
3619 | last_pool->next = pool; | |
3620 | ||
3621 | last_pool = pool; | |
3622 | pool_offset += GET_MODE_SIZE (mode); | |
3623 | ||
3624 | /* Create a string containing the label name, in LABEL. */ | |
3625 | ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno); | |
3626 | ||
3627 | ++const_labelno; | |
3628 | ||
a8a05998 | 3629 | desc->label = found = ggc_strdup (label); |
79e68feb RS |
3630 | |
3631 | /* Add label to symbol hash table. */ | |
3632 | hash = SYMHASH (found); | |
94b01be3 JJ |
3633 | pool->label = found; |
3634 | pool->next_sym = const_rtx_sym_hash_table[hash]; | |
3635 | const_rtx_sym_hash_table[hash] = pool; | |
79e68feb RS |
3636 | } |
3637 | ||
3638 | /* We have a symbol name; construct the SYMBOL_REF and the MEM. */ | |
3639 | ||
38a448ca | 3640 | def = gen_rtx_MEM (mode, gen_rtx_SYMBOL_REF (Pmode, found)); |
289c5b45 | 3641 | set_mem_attributes (def, type_for_mode (mode, 0), 1); |
79e68feb | 3642 | RTX_UNCHANGING_P (def) = 1; |
289c5b45 | 3643 | |
79e68feb RS |
3644 | /* Mark the symbol_ref as belonging to this constants pool. */ |
3645 | CONSTANT_POOL_ADDRESS_P (XEXP (def, 0)) = 1; | |
3646 | current_function_uses_const_pool = 1; | |
3647 | ||
36edd3cc BS |
3648 | if (GET_CODE (x) == CONST_DOUBLE) |
3649 | { | |
3650 | if (CONST_DOUBLE_MEM (x) == cc0_rtx) | |
3651 | { | |
3652 | CONST_DOUBLE_CHAIN (x) = const_double_chain; | |
3653 | const_double_chain = x; | |
3654 | } | |
3655 | CONST_DOUBLE_MEM (x) = def; | |
3656 | } | |
79e68feb RS |
3657 | |
3658 | return def; | |
3659 | } | |
3660 | \f | |
3661 | /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to | |
3662 | the corresponding pool_constant structure. */ | |
3663 | ||
3664 | static struct pool_constant * | |
36edd3cc BS |
3665 | find_pool_constant (f, addr) |
3666 | struct function *f; | |
79e68feb RS |
3667 | rtx addr; |
3668 | { | |
94b01be3 | 3669 | struct pool_constant *pool; |
3cce094d | 3670 | const char *label = XSTR (addr, 0); |
79e68feb | 3671 | |
94b01be3 JJ |
3672 | for (pool = f->varasm->x_const_rtx_sym_hash_table[SYMHASH (label)]; pool; |
3673 | pool = pool->next_sym) | |
3674 | if (pool->label == label) | |
3675 | return pool; | |
79e68feb RS |
3676 | |
3677 | abort (); | |
3678 | } | |
3679 | ||
3680 | /* Given a constant pool SYMBOL_REF, return the corresponding constant. */ | |
3681 | ||
3682 | rtx | |
3683 | get_pool_constant (addr) | |
3684 | rtx addr; | |
3685 | { | |
01d939e8 | 3686 | return (find_pool_constant (cfun, addr))->constant; |
36edd3cc BS |
3687 | } |
3688 | ||
3689 | /* Likewise, but for the constant pool of a specific function. */ | |
3690 | ||
3691 | rtx | |
3692 | get_pool_constant_for_function (f, addr) | |
3693 | struct function *f; | |
3694 | rtx addr; | |
3695 | { | |
3696 | return (find_pool_constant (f, addr))->constant; | |
79e68feb RS |
3697 | } |
3698 | ||
3699 | /* Similar, return the mode. */ | |
3700 | ||
3701 | enum machine_mode | |
3702 | get_pool_mode (addr) | |
3703 | rtx addr; | |
3704 | { | |
01d939e8 | 3705 | return (find_pool_constant (cfun, addr))->mode; |
36edd3cc BS |
3706 | } |
3707 | ||
3708 | enum machine_mode | |
3709 | get_pool_mode_for_function (f, addr) | |
3710 | struct function *f; | |
3711 | rtx addr; | |
3712 | { | |
3713 | return (find_pool_constant (f, addr))->mode; | |
79e68feb RS |
3714 | } |
3715 | ||
3716 | /* Similar, return the offset in the constant pool. */ | |
3717 | ||
3718 | int | |
3719 | get_pool_offset (addr) | |
3720 | rtx addr; | |
3721 | { | |
01d939e8 | 3722 | return (find_pool_constant (cfun, addr))->offset; |
79e68feb RS |
3723 | } |
3724 | ||
3725 | /* Return the size of the constant pool. */ | |
3726 | ||
3727 | int | |
3728 | get_pool_size () | |
3729 | { | |
3730 | return pool_offset; | |
3731 | } | |
3732 | \f | |
3733 | /* Write all the constants in the constant pool. */ | |
3734 | ||
3735 | void | |
3736 | output_constant_pool (fnname, fndecl) | |
d9bba9c3 | 3737 | const char *fnname ATTRIBUTE_UNUSED; |
c84e2712 | 3738 | tree fndecl ATTRIBUTE_UNUSED; |
79e68feb RS |
3739 | { |
3740 | struct pool_constant *pool; | |
3741 | rtx x; | |
3742 | union real_extract u; | |
3743 | ||
91674c37 ILT |
3744 | /* It is possible for gcc to call force_const_mem and then to later |
3745 | discard the instructions which refer to the constant. In such a | |
3746 | case we do not need to output the constant. */ | |
8f0e7be4 | 3747 | mark_constant_pool (); |
91674c37 | 3748 | |
79e68feb RS |
3749 | #ifdef ASM_OUTPUT_POOL_PROLOGUE |
3750 | ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset); | |
3751 | #endif | |
3752 | ||
3753 | for (pool = first_pool; pool; pool = pool->next) | |
3754 | { | |
085ce8c6 RH |
3755 | rtx tmp; |
3756 | ||
79e68feb RS |
3757 | x = pool->constant; |
3758 | ||
d2ce9169 | 3759 | if (! pool->mark) |
91674c37 ILT |
3760 | continue; |
3761 | ||
79e68feb RS |
3762 | /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF) |
3763 | whose CODE_LABEL has been deleted. This can occur if a jump table | |
3764 | is eliminated by optimization. If so, write a constant of zero | |
7b2b3f1f RK |
3765 | instead. Note that this can also happen by turning the |
3766 | CODE_LABEL into a NOTE. */ | |
085ce8c6 RH |
3767 | /* ??? This seems completely and utterly wrong. Certainly it's |
3768 | not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper | |
3769 | functioning even with INSN_DELETED_P and friends. */ | |
3770 | ||
3771 | tmp = x; | |
3772 | switch (GET_CODE (x)) | |
3773 | { | |
3774 | case CONST: | |
3775 | if (GET_CODE (XEXP (x, 0)) != PLUS | |
3776 | || GET_CODE (XEXP (XEXP (x, 0), 0)) != LABEL_REF) | |
3777 | break; | |
3778 | tmp = XEXP (XEXP (x, 0), 0); | |
3779 | /* FALLTHRU */ | |
3780 | ||
3781 | case LABEL_REF: | |
3782 | tmp = XEXP (x, 0); | |
3783 | if (INSN_DELETED_P (tmp) | |
3784 | || (GET_CODE (tmp) == NOTE | |
3785 | && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_DELETED)) | |
3786 | { | |
3787 | abort (); | |
3788 | x = const0_rtx; | |
3789 | } | |
3790 | break; | |
3791 | ||
3792 | default: | |
3793 | break; | |
3794 | } | |
79e68feb RS |
3795 | |
3796 | /* First switch to correct section. */ | |
3797 | #ifdef SELECT_RTX_SECTION | |
3798 | SELECT_RTX_SECTION (pool->mode, x); | |
3799 | #else | |
3800 | readonly_data_section (); | |
3801 | #endif | |
3802 | ||
3803 | #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY | |
3804 | ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode, | |
3805 | pool->align, pool->labelno, done); | |
3806 | #endif | |
3807 | ||
3808 | if (pool->align > 1) | |
0003feb2 | 3809 | ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (pool->align)); |
79e68feb RS |
3810 | |
3811 | /* Output the label. */ | |
3812 | ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", pool->labelno); | |
3813 | ||
3814 | /* Output the value of the constant itself. */ | |
3815 | switch (GET_MODE_CLASS (pool->mode)) | |
3816 | { | |
3817 | case MODE_FLOAT: | |
3818 | if (GET_CODE (x) != CONST_DOUBLE) | |
3819 | abort (); | |
3820 | ||
da61dec9 | 3821 | memcpy ((char *) &u, (char *) &CONST_DOUBLE_LOW (x), sizeof u); |
79e68feb RS |
3822 | assemble_real (u.d, pool->mode); |
3823 | break; | |
3824 | ||
3825 | case MODE_INT: | |
ab8ab9d0 | 3826 | case MODE_PARTIAL_INT: |
79e68feb RS |
3827 | assemble_integer (x, GET_MODE_SIZE (pool->mode), 1); |
3828 | break; | |
3829 | ||
3830 | default: | |
3831 | abort (); | |
3832 | } | |
3833 | ||
29a82058 JL |
3834 | #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY |
3835 | done: ; | |
3836 | #endif | |
3837 | ||
7f83c0e7 JL |
3838 | } |
3839 | ||
5c8c0abd ILT |
3840 | #ifdef ASM_OUTPUT_POOL_EPILOGUE |
3841 | ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool_offset); | |
3842 | #endif | |
3843 | ||
79e68feb RS |
3844 | /* Done with this pool. */ |
3845 | first_pool = last_pool = 0; | |
3846 | } | |
91674c37 ILT |
3847 | |
3848 | /* Look through the instructions for this function, and mark all the | |
fcbd8ef2 JO |
3849 | entries in the constant pool which are actually being used. |
3850 | Emit used deferred strings. */ | |
91674c37 ILT |
3851 | |
3852 | static void | |
3853 | mark_constant_pool () | |
3854 | { | |
3855 | register rtx insn; | |
d2ce9169 | 3856 | struct pool_constant *pool; |
91674c37 | 3857 | |
bd7cf17e | 3858 | if (first_pool == 0 && htab_elements (const_str_htab) == 0) |
91674c37 ILT |
3859 | return; |
3860 | ||
d2ce9169 RK |
3861 | for (pool = first_pool; pool; pool = pool->next) |
3862 | pool->mark = 0; | |
3863 | ||
91674c37 | 3864 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) |
2c3c49de | 3865 | if (INSN_P (insn)) |
91674c37 ILT |
3866 | mark_constants (PATTERN (insn)); |
3867 | ||
3868 | for (insn = current_function_epilogue_delay_list; | |
3869 | insn; | |
3870 | insn = XEXP (insn, 1)) | |
2c3c49de | 3871 | if (INSN_P (insn)) |
91674c37 ILT |
3872 | mark_constants (PATTERN (insn)); |
3873 | } | |
3874 | ||
fcbd8ef2 JO |
3875 | /* Look through appropriate parts of X, marking all entries in the |
3876 | constant pool which are actually being used. Entries that are only | |
3877 | referenced by other constants are also marked as used. Emit | |
3878 | deferred strings that are used. */ | |
3879 | ||
91674c37 ILT |
3880 | static void |
3881 | mark_constants (x) | |
fcbd8ef2 | 3882 | rtx x; |
91674c37 ILT |
3883 | { |
3884 | register int i; | |
6f7d635c | 3885 | register const char *format_ptr; |
91674c37 ILT |
3886 | |
3887 | if (x == 0) | |
3888 | return; | |
3889 | ||
3890 | if (GET_CODE (x) == SYMBOL_REF) | |
3891 | { | |
fcbd8ef2 | 3892 | mark_constant (&x, NULL); |
91674c37 ILT |
3893 | return; |
3894 | } | |
eb7b11fd | 3895 | /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be |
36edd3cc | 3896 | a MEM, but does not constitute a use of that MEM. */ |
eb7b11fd JW |
3897 | else if (GET_CODE (x) == CONST_DOUBLE) |
3898 | return; | |
91674c37 ILT |
3899 | |
3900 | /* Insns may appear inside a SEQUENCE. Only check the patterns of | |
3901 | insns, not any notes that may be attached. We don't want to mark | |
3902 | a constant just because it happens to appear in a REG_EQUIV note. */ | |
2c3c49de | 3903 | if (INSN_P (x)) |
91674c37 ILT |
3904 | { |
3905 | mark_constants (PATTERN (x)); | |
3906 | return; | |
3907 | } | |
3908 | ||
3909 | format_ptr = GET_RTX_FORMAT (GET_CODE (x)); | |
3910 | ||
3911 | for (i = 0; i < GET_RTX_LENGTH (GET_CODE (x)); i++) | |
3912 | { | |
3913 | switch (*format_ptr++) | |
3914 | { | |
3915 | case 'e': | |
3916 | mark_constants (XEXP (x, i)); | |
3917 | break; | |
3918 | ||
3919 | case 'E': | |
3920 | if (XVEC (x, i) != 0) | |
3921 | { | |
3922 | register int j; | |
3923 | ||
3924 | for (j = 0; j < XVECLEN (x, i); j++) | |
3925 | mark_constants (XVECEXP (x, i, j)); | |
3926 | } | |
3927 | break; | |
3928 | ||
3929 | case 'S': | |
3930 | case 's': | |
3931 | case '0': | |
3932 | case 'i': | |
3933 | case 'w': | |
3934 | case 'n': | |
3935 | case 'u': | |
3936 | break; | |
3937 | ||
3938 | default: | |
3939 | abort (); | |
3940 | } | |
3941 | } | |
3942 | } | |
fcbd8ef2 JO |
3943 | |
3944 | /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers | |
3945 | to as used. Emit referenced deferred strings. This function can | |
3946 | be used with for_each_rtx () to mark all SYMBOL_REFs in an rtx. */ | |
3947 | ||
3948 | static int | |
3949 | mark_constant (current_rtx, data) | |
3950 | rtx *current_rtx; | |
3951 | void *data ATTRIBUTE_UNUSED; | |
3952 | { | |
3953 | rtx x = *current_rtx; | |
3954 | ||
3955 | if (x == NULL_RTX) | |
3956 | return 0; | |
3957 | else if (GET_CODE(x) == CONST_DOUBLE) | |
3958 | /* Never search inside a CONST_DOUBLE because CONST_DOUBLE_MEM may | |
3959 | be a MEM but does not constitute a use of that MEM. */ | |
3960 | return -1; | |
3961 | else if (GET_CODE (x) == SYMBOL_REF) | |
3962 | { | |
3963 | if (CONSTANT_POOL_ADDRESS_P (x)) | |
3964 | { | |
3965 | struct pool_constant *pool = find_pool_constant (cfun, x); | |
3966 | if (pool->mark == 0) { | |
3967 | pool->mark = 1; | |
3968 | for_each_rtx (&(pool->constant), &mark_constant, NULL); | |
3969 | } | |
3970 | else | |
3971 | return -1; | |
3972 | } | |
3973 | else if (STRING_POOL_ADDRESS_P (x)) | |
3974 | { | |
3975 | struct deferred_string **defstr; | |
3976 | ||
3977 | defstr = (struct deferred_string **) | |
3978 | htab_find_slot_with_hash (const_str_htab, XSTR (x, 0), | |
3979 | STRHASH (XSTR (x, 0)), NO_INSERT); | |
3980 | if (defstr) | |
3981 | { | |
3982 | struct deferred_string *p = *defstr; | |
3983 | ||
3984 | STRING_POOL_ADDRESS_P (x) = 0; | |
3985 | output_constant_def_contents (p->exp, 0, p->labelno); | |
3986 | htab_clear_slot (const_str_htab, (void **) defstr); | |
3987 | } | |
3988 | } | |
3989 | } | |
3990 | return 0; | |
3991 | } | |
79e68feb RS |
3992 | \f |
3993 | /* Find all the constants whose addresses are referenced inside of EXP, | |
3994 | and make sure assembler code with a label has been output for each one. | |
3995 | Indicate whether an ADDR_EXPR has been encountered. */ | |
3996 | ||
5a13eaa4 | 3997 | static int |
79e68feb RS |
3998 | output_addressed_constants (exp) |
3999 | tree exp; | |
4000 | { | |
4001 | int reloc = 0; | |
4002 | ||
c165f94f CC |
4003 | /* Give the front-end a chance to convert VALUE to something that |
4004 | looks more like a constant to the back-end. */ | |
4005 | if (lang_expand_constant) | |
4006 | exp = (*lang_expand_constant) (exp); | |
4007 | ||
79e68feb RS |
4008 | switch (TREE_CODE (exp)) |
4009 | { | |
4010 | case ADDR_EXPR: | |
4011 | { | |
4012 | register tree constant = TREE_OPERAND (exp, 0); | |
4013 | ||
4014 | while (TREE_CODE (constant) == COMPONENT_REF) | |
4015 | { | |
4016 | constant = TREE_OPERAND (constant, 0); | |
4017 | } | |
4018 | ||
4019 | if (TREE_CODE_CLASS (TREE_CODE (constant)) == 'c' | |
4020 | || TREE_CODE (constant) == CONSTRUCTOR) | |
4021 | /* No need to do anything here | |
4022 | for addresses of variables or functions. */ | |
bd7cf17e | 4023 | output_constant_def (constant, 0); |
79e68feb RS |
4024 | } |
4025 | reloc = 1; | |
4026 | break; | |
4027 | ||
4028 | case PLUS_EXPR: | |
4029 | case MINUS_EXPR: | |
4030 | reloc = output_addressed_constants (TREE_OPERAND (exp, 0)); | |
4031 | reloc |= output_addressed_constants (TREE_OPERAND (exp, 1)); | |
4032 | break; | |
4033 | ||
4034 | case NOP_EXPR: | |
4035 | case CONVERT_EXPR: | |
37a52112 | 4036 | case NON_LVALUE_EXPR: |
79e68feb RS |
4037 | reloc = output_addressed_constants (TREE_OPERAND (exp, 0)); |
4038 | break; | |
4039 | ||
4040 | case CONSTRUCTOR: | |
4041 | { | |
4042 | register tree link; | |
4043 | for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link)) | |
4044 | if (TREE_VALUE (link) != 0) | |
4045 | reloc |= output_addressed_constants (TREE_VALUE (link)); | |
4046 | } | |
4047 | break; | |
4048 | ||
e9a25f70 | 4049 | default: |
79e68feb RS |
4050 | break; |
4051 | } | |
4052 | return reloc; | |
4053 | } | |
4054 | \f | |
14a774a9 RK |
4055 | /* Return nonzero if VALUE is a valid constant-valued expression |
4056 | for use in initializing a static variable; one that can be an | |
4057 | element of a "constant" initializer. | |
4058 | ||
4059 | Return null_pointer_node if the value is absolute; | |
4060 | if it is relocatable, return the variable that determines the relocation. | |
4061 | We assume that VALUE has been folded as much as possible; | |
4062 | therefore, we do not need to check for such things as | |
4063 | arithmetic-combinations of integers. */ | |
4064 | ||
4065 | tree | |
4066 | initializer_constant_valid_p (value, endtype) | |
4067 | tree value; | |
4068 | tree endtype; | |
4069 | { | |
99740276 MM |
4070 | /* Give the front-end a chance to convert VALUE to something that |
4071 | looks more like a constant to the back-end. */ | |
4072 | if (lang_expand_constant) | |
4073 | value = (*lang_expand_constant) (value); | |
4074 | ||
14a774a9 RK |
4075 | switch (TREE_CODE (value)) |
4076 | { | |
4077 | case CONSTRUCTOR: | |
4078 | if ((TREE_CODE (TREE_TYPE (value)) == UNION_TYPE | |
4079 | || TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE) | |
4080 | && TREE_CONSTANT (value) | |
4081 | && CONSTRUCTOR_ELTS (value)) | |
4082 | return | |
4083 | initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value)), | |
4084 | endtype); | |
4085 | ||
4086 | return TREE_STATIC (value) ? null_pointer_node : 0; | |
4087 | ||
4088 | case INTEGER_CST: | |
4089 | case REAL_CST: | |
4090 | case STRING_CST: | |
4091 | case COMPLEX_CST: | |
4092 | return null_pointer_node; | |
4093 | ||
4094 | case ADDR_EXPR: | |
8c8de5fc | 4095 | return staticp (TREE_OPERAND (value, 0)) ? TREE_OPERAND (value, 0) : 0; |
14a774a9 RK |
4096 | |
4097 | case NON_LVALUE_EXPR: | |
4098 | return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype); | |
4099 | ||
4100 | case CONVERT_EXPR: | |
4101 | case NOP_EXPR: | |
4102 | /* Allow conversions between pointer types. */ | |
4103 | if (POINTER_TYPE_P (TREE_TYPE (value)) | |
4104 | && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))) | |
4105 | return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype); | |
4106 | ||
4107 | /* Allow conversions between real types. */ | |
4108 | if (FLOAT_TYPE_P (TREE_TYPE (value)) | |
4109 | && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))) | |
4110 | return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype); | |
4111 | ||
4112 | /* Allow length-preserving conversions between integer types. */ | |
4113 | if (INTEGRAL_TYPE_P (TREE_TYPE (value)) | |
4114 | && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))) | |
4115 | && (TYPE_PRECISION (TREE_TYPE (value)) | |
4116 | == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0))))) | |
4117 | return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype); | |
4118 | ||
4119 | /* Allow conversions between other integer types only if | |
4120 | explicit value. */ | |
4121 | if (INTEGRAL_TYPE_P (TREE_TYPE (value)) | |
4122 | && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))) | |
4123 | { | |
4124 | tree inner = initializer_constant_valid_p (TREE_OPERAND (value, 0), | |
4125 | endtype); | |
4126 | if (inner == null_pointer_node) | |
4127 | return null_pointer_node; | |
4128 | break; | |
4129 | } | |
4130 | ||
4131 | /* Allow (int) &foo provided int is as wide as a pointer. */ | |
4132 | if (INTEGRAL_TYPE_P (TREE_TYPE (value)) | |
4133 | && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))) | |
4134 | && (TYPE_PRECISION (TREE_TYPE (value)) | |
4135 | >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0))))) | |
4136 | return initializer_constant_valid_p (TREE_OPERAND (value, 0), | |
4137 | endtype); | |
4138 | ||
4139 | /* Likewise conversions from int to pointers, but also allow | |
4140 | conversions from 0. */ | |
4141 | if (POINTER_TYPE_P (TREE_TYPE (value)) | |
4142 | && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))) | |
4143 | { | |
4144 | if (integer_zerop (TREE_OPERAND (value, 0))) | |
4145 | return null_pointer_node; | |
4146 | else if (TYPE_PRECISION (TREE_TYPE (value)) | |
4147 | <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))) | |
4148 | return initializer_constant_valid_p (TREE_OPERAND (value, 0), | |
4149 | endtype); | |
4150 | } | |
4151 | ||
4152 | /* Allow conversions to union types if the value inside is okay. */ | |
4153 | if (TREE_CODE (TREE_TYPE (value)) == UNION_TYPE) | |
4154 | return initializer_constant_valid_p (TREE_OPERAND (value, 0), | |
4155 | endtype); | |
4156 | break; | |
4157 | ||
4158 | case PLUS_EXPR: | |
4159 | if (! INTEGRAL_TYPE_P (endtype) | |
4160 | || TYPE_PRECISION (endtype) >= POINTER_SIZE) | |
4161 | { | |
4162 | tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0), | |
4163 | endtype); | |
4164 | tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1), | |
4165 | endtype); | |
4166 | /* If either term is absolute, use the other terms relocation. */ | |
4167 | if (valid0 == null_pointer_node) | |
4168 | return valid1; | |
4169 | if (valid1 == null_pointer_node) | |
4170 | return valid0; | |
4171 | } | |
4172 | break; | |
4173 | ||
4174 | case MINUS_EXPR: | |
4175 | if (! INTEGRAL_TYPE_P (endtype) | |
4176 | || TYPE_PRECISION (endtype) >= POINTER_SIZE) | |
4177 | { | |
4178 | tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0), | |
4179 | endtype); | |
4180 | tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1), | |
4181 | endtype); | |
4182 | /* Win if second argument is absolute. */ | |
4183 | if (valid1 == null_pointer_node) | |
4184 | return valid0; | |
4185 | /* Win if both arguments have the same relocation. | |
4186 | Then the value is absolute. */ | |
4187 | if (valid0 == valid1 && valid0 != 0) | |
4188 | return null_pointer_node; | |
212addfa JO |
4189 | |
4190 | /* Since GCC guarantees that string constants are unique in the | |
4191 | generated code, a subtraction between two copies of the same | |
4192 | constant string is absolute. */ | |
4193 | if (valid0 && TREE_CODE (valid0) == STRING_CST && | |
4194 | valid1 && TREE_CODE (valid1) == STRING_CST && | |
4195 | TREE_STRING_POINTER (valid0) == TREE_STRING_POINTER (valid1)) | |
4196 | return null_pointer_node; | |
14a774a9 RK |
4197 | } |
4198 | ||
4199 | /* Support differences between labels. */ | |
4200 | if (INTEGRAL_TYPE_P (endtype)) | |
4201 | { | |
4202 | tree op0, op1; | |
4203 | op0 = TREE_OPERAND (value, 0); | |
4204 | op1 = TREE_OPERAND (value, 1); | |
4205 | STRIP_NOPS (op0); | |
4206 | STRIP_NOPS (op1); | |
4207 | ||
4208 | if (TREE_CODE (op0) == ADDR_EXPR | |
4209 | && TREE_CODE (TREE_OPERAND (op0, 0)) == LABEL_DECL | |
4210 | && TREE_CODE (op1) == ADDR_EXPR | |
4211 | && TREE_CODE (TREE_OPERAND (op1, 0)) == LABEL_DECL) | |
4212 | return null_pointer_node; | |
4213 | } | |
4214 | break; | |
4215 | ||
4216 | default: | |
4217 | break; | |
4218 | } | |
4219 | ||
4220 | return 0; | |
4221 | } | |
4222 | \f | |
79e68feb RS |
4223 | /* Output assembler code for constant EXP to FILE, with no label. |
4224 | This includes the pseudo-op such as ".int" or ".byte", and a newline. | |
4225 | Assumes output_addressed_constants has been done on EXP already. | |
4226 | ||
4227 | Generate exactly SIZE bytes of assembler data, padding at the end | |
4228 | with zeros if necessary. SIZE must always be specified. | |
4229 | ||
4230 | SIZE is important for structure constructors, | |
4231 | since trailing members may have been omitted from the constructor. | |
4232 | It is also important for initialization of arrays from string constants | |
4233 | since the full length of the string constant might not be wanted. | |
4234 | It is also needed for initialization of unions, where the initializer's | |
4235 | type is just one member, and that may not be as long as the union. | |
4236 | ||
4237 | There a case in which we would fail to output exactly SIZE bytes: | |
4238 | for a structure constructor that wants to produce more than SIZE bytes. | |
4239 | But such constructors will never be generated for any possible input. */ | |
4240 | ||
4241 | void | |
4242 | output_constant (exp, size) | |
4243 | register tree exp; | |
4244 | register int size; | |
4245 | { | |
4246 | register enum tree_code code = TREE_CODE (TREE_TYPE (exp)); | |
79e68feb | 4247 | |
e697e20a MM |
4248 | /* Some front-ends use constants other than the standard |
4249 | language-indepdent varieties, but which may still be output | |
4250 | directly. Give the front-end a chance to convert EXP to a | |
4251 | language-independent representation. */ | |
4252 | if (lang_expand_constant) | |
e82a84c4 RK |
4253 | { |
4254 | exp = (*lang_expand_constant) (exp); | |
4255 | code = TREE_CODE (TREE_TYPE (exp)); | |
4256 | } | |
e697e20a | 4257 | |
e9996db7 | 4258 | if (size == 0 || flag_syntax_only) |
79e68feb RS |
4259 | return; |
4260 | ||
be1ad04c | 4261 | /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue. |
b81cdf54 | 4262 | That way we get the constant (we hope) inside it. Also, strip off any |
16214ee3 RK |
4263 | NOP_EXPR that converts between two record, union, array, or set types |
4264 | or a CONVERT_EXPR that converts to a union TYPE. */ | |
be1ad04c RK |
4265 | while ((TREE_CODE (exp) == NOP_EXPR |
4266 | && (TREE_TYPE (exp) == TREE_TYPE (TREE_OPERAND (exp, 0)) | |
4e1bf5f5 | 4267 | || AGGREGATE_TYPE_P (TREE_TYPE (exp)))) |
16214ee3 RK |
4268 | || (TREE_CODE (exp) == CONVERT_EXPR |
4269 | && code == UNION_TYPE) | |
be1ad04c | 4270 | || TREE_CODE (exp) == NON_LVALUE_EXPR) |
16214ee3 RK |
4271 | { |
4272 | exp = TREE_OPERAND (exp, 0); | |
4273 | code = TREE_CODE (TREE_TYPE (exp)); | |
4274 | } | |
be1ad04c | 4275 | |
fff9e713 MT |
4276 | /* Allow a constructor with no elements for any data type. |
4277 | This means to fill the space with zeros. */ | |
77fa0940 | 4278 | if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0) |
fff9e713 | 4279 | { |
b93a436e | 4280 | assemble_zeros (size); |
fff9e713 MT |
4281 | return; |
4282 | } | |
4283 | ||
79e68feb RS |
4284 | switch (code) |
4285 | { | |
644ea577 RS |
4286 | case CHAR_TYPE: |
4287 | case BOOLEAN_TYPE: | |
79e68feb RS |
4288 | case INTEGER_TYPE: |
4289 | case ENUMERAL_TYPE: | |
4290 | case POINTER_TYPE: | |
4291 | case REFERENCE_TYPE: | |
4292 | /* ??? What about (int)((float)(int)&foo + 4) */ | |
4293 | while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR | |
4294 | || TREE_CODE (exp) == NON_LVALUE_EXPR) | |
4295 | exp = TREE_OPERAND (exp, 0); | |
4296 | ||
37366632 | 4297 | if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode, |
79e68feb RS |
4298 | EXPAND_INITIALIZER), |
4299 | size, 0)) | |
4300 | error ("initializer for integer value is too complicated"); | |
4301 | size = 0; | |
4302 | break; | |
4303 | ||
4304 | case REAL_TYPE: | |
4305 | if (TREE_CODE (exp) != REAL_CST) | |
4306 | error ("initializer for floating value is not a floating constant"); | |
4307 | ||
4308 | assemble_real (TREE_REAL_CST (exp), | |
4309 | mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0)); | |
4310 | size = 0; | |
4311 | break; | |
4312 | ||
4313 | case COMPLEX_TYPE: | |
4314 | output_constant (TREE_REALPART (exp), size / 2); | |
4315 | output_constant (TREE_IMAGPART (exp), size / 2); | |
4316 | size -= (size / 2) * 2; | |
4317 | break; | |
4318 | ||
4319 | case ARRAY_TYPE: | |
4320 | if (TREE_CODE (exp) == CONSTRUCTOR) | |
4321 | { | |
4322 | output_constructor (exp, size); | |
4323 | return; | |
4324 | } | |
4325 | else if (TREE_CODE (exp) == STRING_CST) | |
4326 | { | |
4327 | int excess = 0; | |
4328 | ||
4329 | if (size > TREE_STRING_LENGTH (exp)) | |
4330 | { | |
4331 | excess = size - TREE_STRING_LENGTH (exp); | |
4332 | size = TREE_STRING_LENGTH (exp); | |
4333 | } | |
4334 | ||
4335 | assemble_string (TREE_STRING_POINTER (exp), size); | |
4336 | size = excess; | |
4337 | } | |
4338 | else | |
4339 | abort (); | |
4340 | break; | |
4341 | ||
4342 | case RECORD_TYPE: | |
4343 | case UNION_TYPE: | |
4344 | if (TREE_CODE (exp) == CONSTRUCTOR) | |
4345 | output_constructor (exp, size); | |
4346 | else | |
4347 | abort (); | |
4348 | return; | |
474bda6c PB |
4349 | |
4350 | case SET_TYPE: | |
4351 | if (TREE_CODE (exp) == INTEGER_CST) | |
4352 | assemble_integer (expand_expr (exp, NULL_RTX, | |
4353 | VOIDmode, EXPAND_INITIALIZER), | |
af13b0fb | 4354 | size, 1); |
474bda6c PB |
4355 | else if (TREE_CODE (exp) == CONSTRUCTOR) |
4356 | { | |
af13b0fb DE |
4357 | unsigned char *buffer = (unsigned char *) alloca (size); |
4358 | if (get_set_constructor_bytes (exp, buffer, size)) | |
474bda6c | 4359 | abort (); |
b029f99a | 4360 | assemble_string ((char *) buffer, size); |
474bda6c PB |
4361 | } |
4362 | else | |
4363 | error ("unknown set constructor type"); | |
4364 | return; | |
e9a25f70 JL |
4365 | |
4366 | default: | |
4367 | break; /* ??? */ | |
79e68feb RS |
4368 | } |
4369 | ||
4370 | if (size > 0) | |
4371 | assemble_zeros (size); | |
4372 | } | |
ca695ac9 | 4373 | |
79e68feb | 4374 | \f |
a25f1211 RH |
4375 | /* Subroutine of output_constructor, used for computing the size of |
4376 | arrays of unspecified length. VAL must be a CONSTRUCTOR of an array | |
4377 | type with an unspecified upper bound. */ | |
4378 | ||
ffc5c6a9 | 4379 | static unsigned HOST_WIDE_INT |
a25f1211 RH |
4380 | array_size_for_constructor (val) |
4381 | tree val; | |
4382 | { | |
4383 | tree max_index, i; | |
4384 | ||
a25f1211 RH |
4385 | max_index = NULL_TREE; |
4386 | for (i = CONSTRUCTOR_ELTS (val); i ; i = TREE_CHAIN (i)) | |
4387 | { | |
4388 | tree index = TREE_PURPOSE (i); | |
4389 | ||
4390 | if (TREE_CODE (index) == RANGE_EXPR) | |
4391 | index = TREE_OPERAND (index, 1); | |
4392 | if (max_index == NULL_TREE || tree_int_cst_lt (max_index, index)) | |
4393 | max_index = index; | |
4394 | } | |
4395 | ||
a25f1211 | 4396 | if (max_index == NULL_TREE) |
ffc5c6a9 | 4397 | return 0; |
a25f1211 RH |
4398 | |
4399 | /* Compute the total number of array elements. */ | |
ffc5c6a9 RH |
4400 | i = size_binop (MINUS_EXPR, convert (sizetype, max_index), |
4401 | convert (sizetype, | |
4402 | TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val))))); | |
4403 | i = size_binop (PLUS_EXPR, i, convert (sizetype, integer_one_node)); | |
a25f1211 RH |
4404 | |
4405 | /* Multiply by the array element unit size to find number of bytes. */ | |
ffc5c6a9 | 4406 | i = size_binop (MULT_EXPR, i, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val)))); |
a25f1211 RH |
4407 | |
4408 | return tree_low_cst (i, 1); | |
4409 | } | |
4410 | ||
4411 | /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants). | |
79e68feb RS |
4412 | Generate at least SIZE bytes, padding if necessary. */ |
4413 | ||
5a13eaa4 | 4414 | static void |
79e68feb RS |
4415 | output_constructor (exp, size) |
4416 | tree exp; | |
4417 | int size; | |
4418 | { | |
85f3d674 | 4419 | tree type = TREE_TYPE (exp); |
79e68feb | 4420 | register tree link, field = 0; |
85f3d674 | 4421 | tree min_index = 0; |
79e68feb RS |
4422 | /* Number of bytes output or skipped so far. |
4423 | In other words, current position within the constructor. */ | |
85f3d674 | 4424 | HOST_WIDE_INT total_bytes = 0; |
79e68feb RS |
4425 | /* Non-zero means BYTE contains part of a byte, to be output. */ |
4426 | int byte_buffer_in_use = 0; | |
a544cfd2 | 4427 | register int byte = 0; |
79e68feb | 4428 | |
37366632 | 4429 | if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT) |
79e68feb RS |
4430 | abort (); |
4431 | ||
85f3d674 RK |
4432 | if (TREE_CODE (type) == RECORD_TYPE) |
4433 | field = TYPE_FIELDS (type); | |
79e68feb | 4434 | |
85f3d674 RK |
4435 | if (TREE_CODE (type) == ARRAY_TYPE |
4436 | && TYPE_DOMAIN (type) != 0) | |
4437 | min_index = TYPE_MIN_VALUE (TYPE_DOMAIN (type)); | |
13b457e7 | 4438 | |
79e68feb RS |
4439 | /* As LINK goes through the elements of the constant, |
4440 | FIELD goes through the structure fields, if the constant is a structure. | |
4441 | if the constant is a union, then we override this, | |
4442 | by getting the field from the TREE_LIST element. | |
43f7bed5 VM |
4443 | But the constant could also be an array. Then FIELD is zero. |
4444 | ||
4445 | There is always a maximum of one element in the chain LINK for unions | |
4446 | (even if the initializer in a source program incorrectly contains | |
4447 | more one). */ | |
79e68feb RS |
4448 | for (link = CONSTRUCTOR_ELTS (exp); |
4449 | link; | |
4450 | link = TREE_CHAIN (link), | |
4451 | field = field ? TREE_CHAIN (field) : 0) | |
4452 | { | |
4453 | tree val = TREE_VALUE (link); | |
3181cbfd RS |
4454 | tree index = 0; |
4455 | ||
85f3d674 RK |
4456 | /* The element in a union constructor specifies the proper field |
4457 | or index. */ | |
4458 | if ((TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE | |
4459 | || TREE_CODE (type) == QUAL_UNION_TYPE) | |
4460 | && TREE_PURPOSE (link) != 0) | |
4461 | field = TREE_PURPOSE (link); | |
3181cbfd | 4462 | |
85f3d674 | 4463 | else if (TREE_CODE (type) == ARRAY_TYPE) |
3181cbfd RS |
4464 | index = TREE_PURPOSE (link); |
4465 | ||
79e68feb | 4466 | /* Eliminate the marker that makes a cast not be an lvalue. */ |
d964285c CH |
4467 | if (val != 0) |
4468 | STRIP_NOPS (val); | |
79e68feb | 4469 | |
8311a11f PB |
4470 | if (index && TREE_CODE (index) == RANGE_EXPR) |
4471 | { | |
bf1aaf0a | 4472 | unsigned HOST_WIDE_INT fieldsize |
85f3d674 RK |
4473 | = int_size_in_bytes (TREE_TYPE (type)); |
4474 | HOST_WIDE_INT lo_index = tree_low_cst (TREE_OPERAND (index, 0), 0); | |
4475 | HOST_WIDE_INT hi_index = tree_low_cst (TREE_OPERAND (index, 1), 0); | |
8311a11f | 4476 | HOST_WIDE_INT index; |
85f3d674 | 4477 | |
8311a11f PB |
4478 | for (index = lo_index; index <= hi_index; index++) |
4479 | { | |
4480 | /* Output the element's initial value. */ | |
4481 | if (val == 0) | |
4482 | assemble_zeros (fieldsize); | |
4483 | else | |
4484 | output_constant (val, fieldsize); | |
4485 | ||
4486 | /* Count its size. */ | |
4487 | total_bytes += fieldsize; | |
4488 | } | |
4489 | } | |
4490 | else if (field == 0 || !DECL_BIT_FIELD (field)) | |
79e68feb | 4491 | { |
3181cbfd RS |
4492 | /* An element that is not a bit-field. */ |
4493 | ||
bf1aaf0a | 4494 | unsigned HOST_WIDE_INT fieldsize; |
79e68feb RS |
4495 | /* Since this structure is static, |
4496 | we know the positions are constant. */ | |
85f3d674 | 4497 | HOST_WIDE_INT pos = field ? int_byte_position (field) : 0; |
770ae6cc | 4498 | |
3181cbfd | 4499 | if (index != 0) |
85f3d674 RK |
4500 | pos = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val)), 1) |
4501 | * (tree_low_cst (index, 0) - tree_low_cst (min_index, 0))); | |
79e68feb | 4502 | |
3181cbfd | 4503 | /* Output any buffered-up bit-fields preceding this element. */ |
79e68feb RS |
4504 | if (byte_buffer_in_use) |
4505 | { | |
4506 | ASM_OUTPUT_BYTE (asm_out_file, byte); | |
4507 | total_bytes++; | |
4508 | byte_buffer_in_use = 0; | |
4509 | } | |
4510 | ||
4511 | /* Advance to offset of this element. | |
4512 | Note no alignment needed in an array, since that is guaranteed | |
4513 | if each element has the proper size. */ | |
85f3d674 | 4514 | if ((field != 0 || index != 0) && pos != total_bytes) |
79e68feb | 4515 | { |
85f3d674 RK |
4516 | assemble_zeros (pos - total_bytes); |
4517 | total_bytes = pos; | |
79e68feb | 4518 | } |
ca2eed21 | 4519 | |
85f3d674 RK |
4520 | else if (field != 0 && DECL_PACKED (field)) |
4521 | /* Some assemblers automaticallly align a datum according to its | |
4522 | size if no align directive is specified. The datum, however, | |
4523 | may be declared with 'packed' attribute, so we have to disable | |
4524 | such a feature. */ | |
4525 | ASM_OUTPUT_ALIGN (asm_out_file, 0); | |
79e68feb RS |
4526 | |
4527 | /* Determine size this element should occupy. */ | |
4528 | if (field) | |
a25f1211 | 4529 | { |
ffc5c6a9 RH |
4530 | fieldsize = 0; |
4531 | ||
4532 | /* If this is an array with an unspecified upper bound, | |
4533 | the initializer determines the size. */ | |
4534 | /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL, | |
4535 | but we cannot do this until the deprecated support for | |
4536 | initializing zero-length array members is removed. */ | |
4537 | if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE | |
4538 | && TYPE_DOMAIN (TREE_TYPE (field)) | |
4539 | && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field)))) | |
4540 | { | |
a25f1211 | 4541 | fieldsize = array_size_for_constructor (val); |
ffc5c6a9 RH |
4542 | /* Given a non-empty initialization, this field had |
4543 | better be last. */ | |
4544 | if (fieldsize != 0 && TREE_CHAIN (field) != NULL_TREE) | |
4545 | abort (); | |
4546 | } | |
4547 | else if (DECL_SIZE_UNIT (field)) | |
4548 | { | |
4549 | /* ??? This can't be right. If the decl size overflows | |
4550 | a host integer we will silently emit no data. */ | |
4551 | if (host_integerp (DECL_SIZE_UNIT (field), 1)) | |
4552 | fieldsize = tree_low_cst (DECL_SIZE_UNIT (field), 1); | |
4553 | } | |
a25f1211 | 4554 | } |
79e68feb | 4555 | else |
85f3d674 | 4556 | fieldsize = int_size_in_bytes (TREE_TYPE (type)); |
79e68feb RS |
4557 | |
4558 | /* Output the element's initial value. */ | |
4559 | if (val == 0) | |
4560 | assemble_zeros (fieldsize); | |
4561 | else | |
4562 | output_constant (val, fieldsize); | |
4563 | ||
4564 | /* Count its size. */ | |
4565 | total_bytes += fieldsize; | |
4566 | } | |
4567 | else if (val != 0 && TREE_CODE (val) != INTEGER_CST) | |
4568 | error ("invalid initial value for member `%s'", | |
4569 | IDENTIFIER_POINTER (DECL_NAME (field))); | |
4570 | else | |
4571 | { | |
4572 | /* Element that is a bit-field. */ | |
4573 | ||
770ae6cc RK |
4574 | HOST_WIDE_INT next_offset = int_bit_position (field); |
4575 | HOST_WIDE_INT end_offset | |
4576 | = (next_offset + tree_low_cst (DECL_SIZE (field), 1)); | |
79e68feb RS |
4577 | |
4578 | if (val == 0) | |
4579 | val = integer_zero_node; | |
4580 | ||
4581 | /* If this field does not start in this (or, next) byte, | |
4582 | skip some bytes. */ | |
4583 | if (next_offset / BITS_PER_UNIT != total_bytes) | |
4584 | { | |
4585 | /* Output remnant of any bit field in previous bytes. */ | |
4586 | if (byte_buffer_in_use) | |
4587 | { | |
4588 | ASM_OUTPUT_BYTE (asm_out_file, byte); | |
4589 | total_bytes++; | |
4590 | byte_buffer_in_use = 0; | |
4591 | } | |
4592 | ||
4593 | /* If still not at proper byte, advance to there. */ | |
4594 | if (next_offset / BITS_PER_UNIT != total_bytes) | |
4595 | { | |
4596 | assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes); | |
4597 | total_bytes = next_offset / BITS_PER_UNIT; | |
4598 | } | |
4599 | } | |
4600 | ||
4601 | if (! byte_buffer_in_use) | |
4602 | byte = 0; | |
4603 | ||
4604 | /* We must split the element into pieces that fall within | |
4605 | separate bytes, and combine each byte with previous or | |
4606 | following bit-fields. */ | |
4607 | ||
b4ac57ab | 4608 | /* next_offset is the offset n fbits from the beginning of |
79e68feb RS |
4609 | the structure to the next bit of this element to be processed. |
4610 | end_offset is the offset of the first bit past the end of | |
4611 | this element. */ | |
4612 | while (next_offset < end_offset) | |
4613 | { | |
4614 | int this_time; | |
e7105755 JW |
4615 | int shift; |
4616 | HOST_WIDE_INT value; | |
85f3d674 RK |
4617 | HOST_WIDE_INT next_byte = next_offset / BITS_PER_UNIT; |
4618 | HOST_WIDE_INT next_bit = next_offset % BITS_PER_UNIT; | |
79e68feb RS |
4619 | |
4620 | /* Advance from byte to byte | |
4621 | within this element when necessary. */ | |
4622 | while (next_byte != total_bytes) | |
4623 | { | |
4624 | ASM_OUTPUT_BYTE (asm_out_file, byte); | |
4625 | total_bytes++; | |
4626 | byte = 0; | |
4627 | } | |
4628 | ||
4629 | /* Number of bits we can process at once | |
4630 | (all part of the same byte). */ | |
4631 | this_time = MIN (end_offset - next_offset, | |
4632 | BITS_PER_UNIT - next_bit); | |
f76b9db2 | 4633 | if (BYTES_BIG_ENDIAN) |
79e68feb | 4634 | { |
f76b9db2 ILT |
4635 | /* On big-endian machine, take the most significant bits |
4636 | first (of the bits that are significant) | |
4637 | and put them into bytes from the most significant end. */ | |
4638 | shift = end_offset - next_offset - this_time; | |
85f3d674 | 4639 | |
f76b9db2 | 4640 | /* Don't try to take a bunch of bits that cross |
dfb2c079 HB |
4641 | the word boundary in the INTEGER_CST. We can |
4642 | only select bits from the LOW or HIGH part | |
4643 | not from both. */ | |
f76b9db2 ILT |
4644 | if (shift < HOST_BITS_PER_WIDE_INT |
4645 | && shift + this_time > HOST_BITS_PER_WIDE_INT) | |
4646 | { | |
8b1cb95b GK |
4647 | this_time = shift + this_time - HOST_BITS_PER_WIDE_INT; |
4648 | shift = HOST_BITS_PER_WIDE_INT; | |
f76b9db2 ILT |
4649 | } |
4650 | ||
4651 | /* Now get the bits from the appropriate constant word. */ | |
4652 | if (shift < HOST_BITS_PER_WIDE_INT) | |
85f3d674 | 4653 | value = TREE_INT_CST_LOW (val); |
f76b9db2 ILT |
4654 | else if (shift < 2 * HOST_BITS_PER_WIDE_INT) |
4655 | { | |
4656 | value = TREE_INT_CST_HIGH (val); | |
4657 | shift -= HOST_BITS_PER_WIDE_INT; | |
4658 | } | |
4659 | else | |
4660 | abort (); | |
85f3d674 | 4661 | |
dfb2c079 HB |
4662 | /* Get the result. This works only when: |
4663 | 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */ | |
f76b9db2 | 4664 | byte |= (((value >> shift) |
dfb2c079 | 4665 | & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1)) |
f76b9db2 | 4666 | << (BITS_PER_UNIT - this_time - next_bit)); |
79e68feb RS |
4667 | } |
4668 | else | |
79e68feb | 4669 | { |
f76b9db2 ILT |
4670 | /* On little-endian machines, |
4671 | take first the least significant bits of the value | |
4672 | and pack them starting at the least significant | |
4673 | bits of the bytes. */ | |
770ae6cc RK |
4674 | shift = next_offset - int_bit_position (field); |
4675 | ||
f76b9db2 | 4676 | /* Don't try to take a bunch of bits that cross |
dfb2c079 HB |
4677 | the word boundary in the INTEGER_CST. We can |
4678 | only select bits from the LOW or HIGH part | |
4679 | not from both. */ | |
f76b9db2 ILT |
4680 | if (shift < HOST_BITS_PER_WIDE_INT |
4681 | && shift + this_time > HOST_BITS_PER_WIDE_INT) | |
770ae6cc | 4682 | this_time = (HOST_BITS_PER_WIDE_INT - shift); |
f76b9db2 ILT |
4683 | |
4684 | /* Now get the bits from the appropriate constant word. */ | |
e9a25f70 | 4685 | if (shift < HOST_BITS_PER_WIDE_INT) |
f76b9db2 ILT |
4686 | value = TREE_INT_CST_LOW (val); |
4687 | else if (shift < 2 * HOST_BITS_PER_WIDE_INT) | |
4688 | { | |
4689 | value = TREE_INT_CST_HIGH (val); | |
4690 | shift -= HOST_BITS_PER_WIDE_INT; | |
4691 | } | |
4692 | else | |
4693 | abort (); | |
770ae6cc | 4694 | |
dfb2c079 HB |
4695 | /* Get the result. This works only when: |
4696 | 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */ | |
f76b9db2 | 4697 | byte |= (((value >> shift) |
dfb2c079 | 4698 | & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1)) |
f76b9db2 | 4699 | << next_bit); |
79e68feb | 4700 | } |
85f3d674 | 4701 | |
79e68feb RS |
4702 | next_offset += this_time; |
4703 | byte_buffer_in_use = 1; | |
4704 | } | |
4705 | } | |
4706 | } | |
85f3d674 | 4707 | |
79e68feb RS |
4708 | if (byte_buffer_in_use) |
4709 | { | |
4710 | ASM_OUTPUT_BYTE (asm_out_file, byte); | |
4711 | total_bytes++; | |
4712 | } | |
85f3d674 | 4713 | |
79e68feb RS |
4714 | if (total_bytes < size) |
4715 | assemble_zeros (size - total_bytes); | |
4716 | } | |
ca695ac9 | 4717 | |
0e9264a2 JL |
4718 | #ifdef HANDLE_PRAGMA_WEAK |
4719 | /* Add function NAME to the weak symbols list. VALUE is a weak alias | |
4720 | associatd with NAME. */ | |
4721 | ||
4722 | int | |
4723 | add_weak (name, value) | |
63ad61ed ZW |
4724 | const char *name; |
4725 | const char *value; | |
0e9264a2 JL |
4726 | { |
4727 | struct weak_syms *weak; | |
4728 | ||
4729 | weak = (struct weak_syms *) permalloc (sizeof (struct weak_syms)); | |
4730 | ||
4731 | if (weak == NULL) | |
4732 | return 0; | |
4733 | ||
4734 | weak->next = weak_decls; | |
4735 | weak->name = name; | |
4736 | weak->value = value; | |
4737 | weak_decls = weak; | |
4738 | ||
4739 | return 1; | |
4740 | } | |
4741 | #endif /* HANDLE_PRAGMA_WEAK */ | |
4742 | ||
4b8af8d9 JM |
4743 | /* Declare DECL to be a weak symbol. */ |
4744 | ||
4745 | void | |
4746 | declare_weak (decl) | |
4747 | tree decl; | |
4748 | { | |
4749 | if (! TREE_PUBLIC (decl)) | |
4750 | error_with_decl (decl, "weak declaration of `%s' must be public"); | |
daefd78b JM |
4751 | else if (TREE_ASM_WRITTEN (decl)) |
4752 | error_with_decl (decl, "weak declaration of `%s' must precede definition"); | |
4753 | else if (SUPPORTS_WEAK) | |
4754 | DECL_WEAK (decl) = 1; | |
0e9264a2 JL |
4755 | #ifdef HANDLE_PRAGMA_WEAK |
4756 | add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)), NULL); | |
4757 | #endif | |
4b8af8d9 JM |
4758 | } |
4759 | ||
4760 | /* Emit any pending weak declarations. */ | |
4761 | ||
e2af664c NC |
4762 | #ifdef HANDLE_PRAGMA_WEAK |
4763 | struct weak_syms * weak_decls; | |
4764 | #endif | |
4765 | ||
4b8af8d9 JM |
4766 | void |
4767 | weak_finish () | |
4768 | { | |
4769 | #ifdef HANDLE_PRAGMA_WEAK | |
4770 | if (HANDLE_PRAGMA_WEAK) | |
4771 | { | |
eb0430f0 MM |
4772 | struct weak_syms *t; |
4773 | for (t = weak_decls; t; t = t->next) | |
4b8af8d9 | 4774 | { |
ec99e58f | 4775 | if (t->name) |
3aa8ab7b | 4776 | ASM_OUTPUT_WEAK_ALIAS (asm_out_file, t->name, t->value); |
ec99e58f RL |
4777 | } |
4778 | } | |
4779 | #endif | |
4780 | } | |
4781 | ||
4782 | /* Remove NAME from the pending list of weak symbols. This prevents | |
4783 | the compiler from emitting multiple .weak directives which confuses | |
4784 | some assemblers. */ | |
341a243e | 4785 | #ifdef ASM_WEAKEN_LABEL |
ec99e58f RL |
4786 | static void |
4787 | remove_from_pending_weak_list (name) | |
63ad61ed | 4788 | const char *name ATTRIBUTE_UNUSED; |
ec99e58f RL |
4789 | { |
4790 | #ifdef HANDLE_PRAGMA_WEAK | |
4791 | if (HANDLE_PRAGMA_WEAK) | |
4792 | { | |
4793 | struct weak_syms *t; | |
4794 | for (t = weak_decls; t; t = t->next) | |
4795 | { | |
548191a4 | 4796 | if (t->name && strcmp (name, t->name) == 0) |
ec99e58f | 4797 | t->name = NULL; |
4b8af8d9 JM |
4798 | } |
4799 | } | |
4800 | #endif | |
4801 | } | |
341a243e | 4802 | #endif |
4b8af8d9 JM |
4803 | |
4804 | void | |
4805 | assemble_alias (decl, target) | |
91813b28 | 4806 | tree decl, target ATTRIBUTE_UNUSED; |
4b8af8d9 | 4807 | { |
3cce094d | 4808 | const char *name; |
4b8af8d9 | 4809 | |
9ea07fd0 JW |
4810 | /* We must force creation of DECL_RTL for debug info generation, even though |
4811 | we don't use it here. */ | |
6496a589 | 4812 | make_decl_rtl (decl, NULL); |
9ea07fd0 | 4813 | |
19e7881c | 4814 | name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)); |
4b8af8d9 | 4815 | |
4927276d | 4816 | #ifdef ASM_OUTPUT_DEF |
4b8af8d9 JM |
4817 | /* Make name accessible from other files, if appropriate. */ |
4818 | ||
4819 | if (TREE_PUBLIC (decl)) | |
4820 | { | |
daefd78b JM |
4821 | #ifdef ASM_WEAKEN_LABEL |
4822 | if (DECL_WEAK (decl)) | |
ec99e58f RL |
4823 | { |
4824 | ASM_WEAKEN_LABEL (asm_out_file, name); | |
4825 | /* Remove this function from the pending weak list so that | |
4826 | we do not emit multiple .weak directives for it. */ | |
4827 | remove_from_pending_weak_list | |
4828 | (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl))); | |
4829 | } | |
48ad5afd | 4830 | else |
daefd78b | 4831 | #endif |
48ad5afd | 4832 | ASM_GLOBALIZE_LABEL (asm_out_file, name); |
4b8af8d9 JM |
4833 | } |
4834 | ||
e4faf1eb NC |
4835 | #ifdef ASM_OUTPUT_DEF_FROM_DECLS |
4836 | ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target); | |
4837 | #else | |
4b8af8d9 | 4838 | ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target)); |
e4faf1eb | 4839 | #endif |
daefd78b | 4840 | TREE_ASM_WRITTEN (decl) = 1; |
4b8af8d9 | 4841 | #else |
4927276d JM |
4842 | #ifdef ASM_OUTPUT_WEAK_ALIAS |
4843 | if (! DECL_WEAK (decl)) | |
4844 | warning ("only weak aliases are supported in this configuration"); | |
4845 | ||
4846 | ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target)); | |
4847 | TREE_ASM_WRITTEN (decl) = 1; | |
4848 | #else | |
4849 | warning ("alias definitions not supported in this configuration; ignored"); | |
4850 | #endif | |
4b8af8d9 JM |
4851 | #endif |
4852 | } | |
f796d997 | 4853 | |
f796d997 JM |
4854 | /* Returns 1 if the target configuration supports defining public symbols |
4855 | so that one of them will be chosen at link time instead of generating a | |
4856 | multiply-defined symbol error, whether through the use of weak symbols or | |
4857 | a target-specific mechanism for having duplicates discarded. */ | |
4858 | ||
4859 | int | |
4860 | supports_one_only () | |
4861 | { | |
4862 | if (SUPPORTS_ONE_ONLY) | |
4863 | return 1; | |
4864 | return SUPPORTS_WEAK; | |
4865 | } | |
4866 | ||
4867 | /* Set up DECL as a public symbol that can be defined in multiple | |
4868 | translation units without generating a linker error. */ | |
4869 | ||
4870 | void | |
4871 | make_decl_one_only (decl) | |
4872 | tree decl; | |
4873 | { | |
4874 | if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL) | |
4875 | abort (); | |
4876 | ||
4877 | TREE_PUBLIC (decl) = 1; | |
4878 | ||
4879 | if (TREE_CODE (decl) == VAR_DECL | |
4880 | && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node)) | |
4881 | DECL_COMMON (decl) = 1; | |
4882 | else if (SUPPORTS_ONE_ONLY) | |
4883 | { | |
4884 | #ifdef MAKE_DECL_ONE_ONLY | |
4885 | MAKE_DECL_ONE_ONLY (decl); | |
4886 | #endif | |
4887 | DECL_ONE_ONLY (decl) = 1; | |
4888 | } | |
4889 | else if (SUPPORTS_WEAK) | |
4890 | DECL_WEAK (decl) = 1; | |
4891 | else | |
4892 | abort (); | |
4893 | } | |
76095e2f RH |
4894 | |
4895 | void | |
4896 | init_varasm_once () | |
4897 | { | |
bd7cf17e JJ |
4898 | const_str_htab = htab_create (128, const_str_htab_hash, const_str_htab_eq, |
4899 | const_str_htab_del); | |
14a774a9 | 4900 | ggc_add_root (const_hash_table, MAX_HASH_TABLE, sizeof const_hash_table[0], |
76095e2f | 4901 | mark_const_hash_entry); |
bd7cf17e JJ |
4902 | ggc_add_root (&const_str_htab, 1, sizeof const_str_htab, |
4903 | mark_const_str_htab); | |
76095e2f | 4904 | } |
ce152ef8 AM |
4905 | |
4906 | /* Extra support for EH values. */ | |
4907 | void | |
4908 | assemble_eh_label (name) | |
4909 | const char *name; | |
4910 | { | |
4911 | #ifdef ASM_OUTPUT_EH_LABEL | |
4912 | ASM_OUTPUT_EH_LABEL (asm_out_file, name); | |
4913 | #else | |
4914 | assemble_label (name); | |
4915 | #endif | |
4916 | } | |
4917 | ||
4918 | /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */ | |
4919 | ||
4920 | void | |
4921 | assemble_eh_align (align) | |
4922 | int align; | |
4923 | { | |
4924 | #ifdef ASM_OUTPUT_EH_ALIGN | |
4925 | if (align > BITS_PER_UNIT) | |
4926 | ASM_OUTPUT_EH_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT)); | |
4927 | #else | |
4928 | assemble_align (align); | |
4929 | #endif | |
4930 | } | |
4931 | ||
4932 | ||
4933 | /* On some platforms, we may want to specify a special mechansim to | |
4934 | output EH data when generating with a function.. */ | |
4935 | int | |
4936 | assemble_eh_integer (x, size, force) | |
4937 | rtx x; | |
4938 | int size; | |
4939 | int force; | |
4940 | { | |
4941 | ||
4942 | switch (size) | |
4943 | { | |
4944 | #ifdef ASM_OUTPUT_EH_CHAR | |
4945 | case 1: | |
4946 | ASM_OUTPUT_EH_CHAR (asm_out_file, x); | |
4947 | return 1; | |
4948 | #endif | |
4949 | ||
4950 | #ifdef ASM_OUTPUT_EH_SHORT | |
4951 | case 2: | |
4952 | ASM_OUTPUT_EH_SHORT (asm_out_file, x); | |
4953 | return 1; | |
4954 | #endif | |
4955 | ||
4956 | #ifdef ASM_OUTPUT_EH_INT | |
4957 | case 4: | |
4958 | ASM_OUTPUT_EH_INT (asm_out_file, x); | |
4959 | return 1; | |
4960 | #endif | |
4961 | ||
4962 | #ifdef ASM_OUTPUT_EH_DOUBLE_INT | |
4963 | case 8: | |
4964 | ASM_OUTPUT_EH_DOUBLE_INT (asm_out_file, x); | |
4965 | return 1; | |
4966 | #endif | |
4967 | ||
4968 | default: | |
4969 | break; | |
4970 | } | |
4971 | return (assemble_integer (x, size, force)); | |
4972 | } | |
4973 | ||
4974 | ||
4975 |