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