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