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