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