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