1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009,
4 2010 Free Software Foundation, Inc.
6 This file is part of GCC.
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 3, or (at your option) any later
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
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
32 #include "coretypes.h"
39 #include "hard-reg-set.h"
46 #include "langhooks.h"
50 #include "targhooks.h"
51 #include "tree-mudflap.h"
53 #include "cfglayout.h"
54 #include "basic-block.h"
55 #include "tree-iterator.h"
57 #ifdef XCOFF_DEBUGGING_INFO
58 #include "xcoffout.h" /* Needed for external data
59 declarations for e.g. AIX 4.x. */
62 /* The (assembler) name of the first globally-visible object output. */
63 extern GTY(()) const char *first_global_object_name;
64 extern GTY(()) const char *weak_global_object_name;
66 const char *first_global_object_name;
67 const char *weak_global_object_name;
70 struct constant_descriptor_rtx;
71 struct rtx_constant_pool;
73 #define n_deferred_constants (crtl->varasm.deferred_constants)
75 /* Number for making the label on the next
76 constant that is stored in memory. */
78 static GTY(()) int const_labelno;
80 /* Carry information from ASM_DECLARE_OBJECT_NAME
81 to ASM_FINISH_DECLARE_OBJECT. */
83 int size_directive_output;
85 /* The last decl for which assemble_variable was called,
86 if it did ASM_DECLARE_OBJECT_NAME.
87 If the last call to assemble_variable didn't do that,
90 tree last_assemble_variable_decl;
92 /* The following global variable indicates if the first basic block
93 in a function belongs to the cold partition or not. */
95 bool first_function_block_is_cold;
97 /* We give all constants their own alias set. Perhaps redundant with
98 MEM_READONLY_P, but pre-dates it. */
100 static alias_set_type const_alias_set;
102 static const char *strip_reg_name (const char *);
103 static int contains_pointers_p (tree);
104 #ifdef ASM_OUTPUT_EXTERNAL
105 static bool incorporeal_function_p (tree);
107 static void decode_addr_const (tree, struct addr_const *);
108 static hashval_t const_desc_hash (const void *);
109 static int const_desc_eq (const void *, const void *);
110 static hashval_t const_hash_1 (const tree);
111 static int compare_constant (const tree, const tree);
112 static tree copy_constant (tree);
113 static void output_constant_def_contents (rtx);
114 static void output_addressed_constants (tree);
115 static unsigned HOST_WIDE_INT array_size_for_constructor (tree);
116 static unsigned min_align (unsigned, unsigned);
117 static void globalize_decl (tree);
118 #ifdef BSS_SECTION_ASM_OP
119 #ifdef ASM_OUTPUT_BSS
120 static void asm_output_bss (FILE *, tree, const char *,
121 unsigned HOST_WIDE_INT, unsigned HOST_WIDE_INT);
123 #ifdef ASM_OUTPUT_ALIGNED_BSS
124 static void asm_output_aligned_bss (FILE *, tree, const char *,
125 unsigned HOST_WIDE_INT, int)
128 #endif /* BSS_SECTION_ASM_OP */
129 static void mark_weak (tree);
130 static void output_constant_pool (const char *, tree);
132 /* Well-known sections, each one associated with some sort of *_ASM_OP. */
133 section *text_section;
134 section *data_section;
135 section *readonly_data_section;
136 section *sdata_section;
137 section *ctors_section;
138 section *dtors_section;
139 section *bss_section;
140 section *sbss_section;
142 /* Various forms of common section. All are guaranteed to be nonnull. */
143 section *tls_comm_section;
144 section *comm_section;
145 section *lcomm_section;
147 /* A SECTION_NOSWITCH section used for declaring global BSS variables.
149 section *bss_noswitch_section;
151 /* The section that holds the main exception table, when known. The section
152 is set either by the target's init_sections hook or by the first call to
153 switch_to_exception_section. */
154 section *exception_section;
156 /* The section that holds the DWARF2 frame unwind information, when known.
157 The section is set either by the target's init_sections hook or by the
158 first call to switch_to_eh_frame_section. */
159 section *eh_frame_section;
161 /* asm_out_file's current section. This is NULL if no section has yet
162 been selected or if we lose track of what the current section is. */
165 /* True if code for the current function is currently being directed
166 at the cold section. */
167 bool in_cold_section_p;
169 /* A linked list of all the unnamed sections. */
170 static GTY(()) section *unnamed_sections;
172 /* Return a nonzero value if DECL has a section attribute. */
173 #ifndef IN_NAMED_SECTION
174 #define IN_NAMED_SECTION(DECL) \
175 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
176 && DECL_SECTION_NAME (DECL) != NULL_TREE)
179 /* Hash table of named sections. */
180 static GTY((param_is (section))) htab_t section_htab;
182 /* A table of object_blocks, indexed by section. */
183 static GTY((param_is (struct object_block))) htab_t object_block_htab;
185 /* The next number to use for internal anchor labels. */
186 static GTY(()) int anchor_labelno;
188 /* A pool of constants that can be shared between functions. */
189 static GTY(()) struct rtx_constant_pool *shared_constant_pool;
193 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
195 static GTY (()) tree emutls_object_type;
196 /* Emulated TLS objects have the TLS model TLS_MODEL_EMULATED. This
197 macro can be used on them to distinguish the control variable from
198 the initialization template. */
199 #define DECL_EMUTLS_VAR_P(D) (TREE_TYPE (D) == emutls_object_type)
201 #if !defined (NO_DOT_IN_LABEL)
202 # define EMUTLS_SEPARATOR "."
203 #elif !defined (NO_DOLLAR_IN_LABEL)
204 # define EMUTLS_SEPARATOR "$"
206 # define EMUTLS_SEPARATOR "_"
209 /* Create an IDENTIFIER_NODE by prefixing PREFIX to the
210 IDENTIFIER_NODE NAME's name. */
213 prefix_name (const char *prefix, tree name)
215 unsigned plen = strlen (prefix);
216 unsigned nlen = strlen (IDENTIFIER_POINTER (name));
217 char *toname = (char *) alloca (plen + nlen + 1);
219 memcpy (toname, prefix, plen);
220 memcpy (toname + plen, IDENTIFIER_POINTER (name), nlen + 1);
222 return get_identifier (toname);
225 /* Create an identifier for the struct __emutls_object, given an identifier
226 of the DECL_ASSEMBLY_NAME of the original object. */
229 get_emutls_object_name (tree name)
231 const char *prefix = (targetm.emutls.var_prefix
232 ? targetm.emutls.var_prefix
233 : "__emutls_v" EMUTLS_SEPARATOR);
234 return prefix_name (prefix, name);
238 default_emutls_var_fields (tree type, tree *name ATTRIBUTE_UNUSED)
240 tree word_type_node, field, next_field;
242 field = build_decl (UNKNOWN_LOCATION,
243 FIELD_DECL, get_identifier ("__templ"), ptr_type_node);
244 DECL_CONTEXT (field) = type;
247 field = build_decl (UNKNOWN_LOCATION,
248 FIELD_DECL, get_identifier ("__offset"),
250 DECL_CONTEXT (field) = type;
251 TREE_CHAIN (field) = next_field;
254 word_type_node = lang_hooks.types.type_for_mode (word_mode, 1);
255 field = build_decl (UNKNOWN_LOCATION,
256 FIELD_DECL, get_identifier ("__align"),
258 DECL_CONTEXT (field) = type;
259 TREE_CHAIN (field) = next_field;
262 field = build_decl (UNKNOWN_LOCATION,
263 FIELD_DECL, get_identifier ("__size"), word_type_node);
264 DECL_CONTEXT (field) = type;
265 TREE_CHAIN (field) = next_field;
270 /* Create the structure for struct __emutls_object. This should match the
271 structure at the top of emutls.c, modulo the union there. */
274 get_emutls_object_type (void)
276 tree type, type_name, field;
278 type = emutls_object_type;
282 emutls_object_type = type = lang_hooks.types.make_type (RECORD_TYPE);
284 field = targetm.emutls.var_fields (type, &type_name);
286 type_name = get_identifier ("__emutls_object");
287 type_name = build_decl (UNKNOWN_LOCATION,
288 TYPE_DECL, type_name, type);
289 TYPE_NAME (type) = type_name;
290 TYPE_FIELDS (type) = field;
296 /* Create a read-only variable like DECL, with the same DECL_INITIAL.
297 This will be used for initializing the emulated tls data area. */
300 get_emutls_init_templ_addr (tree decl)
304 if (targetm.emutls.register_common && !DECL_INITIAL (decl)
305 && !DECL_SECTION_NAME (decl))
306 return null_pointer_node;
308 name = DECL_ASSEMBLER_NAME (decl);
309 if (!targetm.emutls.tmpl_prefix || targetm.emutls.tmpl_prefix[0])
311 const char *prefix = (targetm.emutls.tmpl_prefix
312 ? targetm.emutls.tmpl_prefix
313 : "__emutls_t" EMUTLS_SEPARATOR);
314 name = prefix_name (prefix, name);
317 to = build_decl (DECL_SOURCE_LOCATION (decl),
318 VAR_DECL, name, TREE_TYPE (decl));
319 SET_DECL_ASSEMBLER_NAME (to, DECL_NAME (to));
320 DECL_TLS_MODEL (to) = TLS_MODEL_EMULATED;
321 DECL_ARTIFICIAL (to) = 1;
322 TREE_USED (to) = TREE_USED (decl);
323 TREE_READONLY (to) = 1;
324 DECL_IGNORED_P (to) = 1;
325 DECL_CONTEXT (to) = DECL_CONTEXT (decl);
326 DECL_SECTION_NAME (to) = DECL_SECTION_NAME (decl);
328 DECL_WEAK (to) = DECL_WEAK (decl);
329 if (DECL_ONE_ONLY (decl))
331 make_decl_one_only (to, DECL_ASSEMBLER_NAME (to));
332 TREE_STATIC (to) = TREE_STATIC (decl);
333 TREE_PUBLIC (to) = TREE_PUBLIC (decl);
334 DECL_VISIBILITY (to) = DECL_VISIBILITY (decl);
337 TREE_STATIC (to) = 1;
339 DECL_INITIAL (to) = DECL_INITIAL (decl);
340 DECL_INITIAL (decl) = NULL;
342 varpool_finalize_decl (to);
343 return build_fold_addr_expr (to);
346 /* When emulating tls, we use a control structure for use by the runtime.
347 Create and return this structure. */
350 emutls_decl (tree decl)
353 struct tree_map *h, in;
356 if (targetm.have_tls || decl == NULL || decl == error_mark_node
357 || TREE_CODE (decl) != VAR_DECL || ! DECL_THREAD_LOCAL_P (decl))
360 /* Look up the object in the hash; return the control structure if
361 it has already been created. */
363 emutls_htab = htab_create_ggc (512, tree_map_hash, tree_map_eq, 0);
365 name = DECL_ASSEMBLER_NAME (decl);
367 /* Note that we use the hash of the decl's name, rather than a hash
368 of the decl's pointer. In emutls_finish we iterate through the
369 hash table, and we want this traversal to be predictable. */
370 in.hash = htab_hash_string (IDENTIFIER_POINTER (name));
372 loc = htab_find_slot_with_hash (emutls_htab, &in, in.hash, INSERT);
373 h = (struct tree_map *) *loc;
378 to = build_decl (DECL_SOURCE_LOCATION (decl),
379 VAR_DECL, get_emutls_object_name (name),
380 get_emutls_object_type ());
382 h = GGC_NEW (struct tree_map);
386 *(struct tree_map **) loc = h;
388 DECL_TLS_MODEL (to) = TLS_MODEL_EMULATED;
389 DECL_ARTIFICIAL (to) = 1;
390 DECL_IGNORED_P (to) = 1;
391 TREE_READONLY (to) = 0;
392 SET_DECL_ASSEMBLER_NAME (to, DECL_NAME (to));
393 if (DECL_ONE_ONLY (decl))
394 make_decl_one_only (to, DECL_ASSEMBLER_NAME (to));
395 DECL_CONTEXT (to) = DECL_CONTEXT (decl);
396 if (targetm.emutls.var_align_fixed)
397 /* If we're not allowed to change the proxy object's
398 alignment, pretend it's been set by the user. */
399 DECL_USER_ALIGN (to) = 1;
402 /* Note that these fields may need to be updated from time to time from
403 the original decl. Consider:
404 extern __thread int i;
405 int foo() { return i; }
407 in which I goes from external to locally defined and initialized. */
409 TREE_STATIC (to) = TREE_STATIC (decl);
410 TREE_USED (to) = TREE_USED (decl);
411 TREE_PUBLIC (to) = TREE_PUBLIC (decl);
412 DECL_EXTERNAL (to) = DECL_EXTERNAL (decl);
413 DECL_COMMON (to) = DECL_COMMON (decl);
414 DECL_WEAK (to) = DECL_WEAK (decl);
415 DECL_VISIBILITY (to) = DECL_VISIBILITY (decl);
421 emutls_common_1 (void **loc, void *xstmts)
423 struct tree_map *h = *(struct tree_map **) loc;
424 tree args, x, *pstmts = (tree *) xstmts;
427 if (! DECL_COMMON (h->base.from)
428 || (DECL_INITIAL (h->base.from)
429 && DECL_INITIAL (h->base.from) != error_mark_node))
432 word_type_node = lang_hooks.types.type_for_mode (word_mode, 1);
434 /* The idea was to call get_emutls_init_templ_addr here, but if we
435 do this and there is an initializer, -fanchor_section loses,
436 because it would be too late to ensure the template is
438 x = null_pointer_node;
439 args = tree_cons (NULL, x, NULL);
440 x = build_int_cst (word_type_node, DECL_ALIGN_UNIT (h->base.from));
441 args = tree_cons (NULL, x, args);
442 x = fold_convert (word_type_node, DECL_SIZE_UNIT (h->base.from));
443 args = tree_cons (NULL, x, args);
444 x = build_fold_addr_expr (h->to);
445 args = tree_cons (NULL, x, args);
447 x = built_in_decls[BUILT_IN_EMUTLS_REGISTER_COMMON];
448 x = build_function_call_expr (UNKNOWN_LOCATION, x, args);
450 append_to_statement_list (x, pstmts);
457 if (targetm.emutls.register_common)
459 tree body = NULL_TREE;
461 if (emutls_htab == NULL)
464 htab_traverse_noresize (emutls_htab, emutls_common_1, &body);
465 if (body == NULL_TREE)
468 cgraph_build_static_cdtor ('I', body, DEFAULT_INIT_PRIORITY);
472 /* Helper routines for maintaining section_htab. */
475 section_entry_eq (const void *p1, const void *p2)
477 const section *old = (const section *) p1;
478 const char *new_name = (const char *) p2;
480 return strcmp (old->named.name, new_name) == 0;
484 section_entry_hash (const void *p)
486 const section *old = (const section *) p;
487 return htab_hash_string (old->named.name);
490 /* Return a hash value for section SECT. */
493 hash_section (section *sect)
495 if (sect->common.flags & SECTION_NAMED)
496 return htab_hash_string (sect->named.name);
497 return sect->common.flags;
500 /* Helper routines for maintaining object_block_htab. */
503 object_block_entry_eq (const void *p1, const void *p2)
505 const struct object_block *old = (const struct object_block *) p1;
506 const section *new_section = (const section *) p2;
508 return old->sect == new_section;
512 object_block_entry_hash (const void *p)
514 const struct object_block *old = (const struct object_block *) p;
515 return hash_section (old->sect);
518 /* Return a new unnamed section with the given fields. */
521 get_unnamed_section (unsigned int flags, void (*callback) (const void *),
526 sect = GGC_NEW (section);
527 sect->unnamed.common.flags = flags | SECTION_UNNAMED;
528 sect->unnamed.callback = callback;
529 sect->unnamed.data = data;
530 sect->unnamed.next = unnamed_sections;
532 unnamed_sections = sect;
536 /* Return a SECTION_NOSWITCH section with the given fields. */
539 get_noswitch_section (unsigned int flags, noswitch_section_callback callback)
543 sect = GGC_NEW (section);
544 sect->noswitch.common.flags = flags | SECTION_NOSWITCH;
545 sect->noswitch.callback = callback;
550 /* Return the named section structure associated with NAME. Create
551 a new section with the given fields if no such structure exists. */
554 get_section (const char *name, unsigned int flags, tree decl)
556 section *sect, **slot;
559 htab_find_slot_with_hash (section_htab, name,
560 htab_hash_string (name), INSERT);
561 flags |= SECTION_NAMED;
564 sect = GGC_NEW (section);
565 sect->named.common.flags = flags;
566 sect->named.name = ggc_strdup (name);
567 sect->named.decl = decl;
573 if ((sect->common.flags & ~SECTION_DECLARED) != flags
574 && ((sect->common.flags | flags) & SECTION_OVERRIDE) == 0)
576 /* Sanity check user variables for flag changes. */
578 decl = sect->named.decl;
580 error ("%+D causes a section type conflict", decl);
586 /* Return true if the current compilation mode benefits from having
587 objects grouped into blocks. */
590 use_object_blocks_p (void)
592 return flag_section_anchors;
595 /* Return the object_block structure for section SECT. Create a new
596 structure if we haven't created one already. Return null if SECT
599 static struct object_block *
600 get_block_for_section (section *sect)
602 struct object_block *block;
608 slot = htab_find_slot_with_hash (object_block_htab, sect,
609 hash_section (sect), INSERT);
610 block = (struct object_block *) *slot;
613 block = (struct object_block *)
614 ggc_alloc_cleared (sizeof (struct object_block));
621 /* Create a symbol with label LABEL and place it at byte offset
622 OFFSET in BLOCK. OFFSET can be negative if the symbol's offset
623 is not yet known. LABEL must be a garbage-collected string. */
626 create_block_symbol (const char *label, struct object_block *block,
627 HOST_WIDE_INT offset)
632 /* Create the extended SYMBOL_REF. */
633 size = RTX_HDR_SIZE + sizeof (struct block_symbol);
634 symbol = (rtx) ggc_alloc_zone (size, &rtl_zone);
636 /* Initialize the normal SYMBOL_REF fields. */
637 memset (symbol, 0, size);
638 PUT_CODE (symbol, SYMBOL_REF);
639 PUT_MODE (symbol, Pmode);
640 XSTR (symbol, 0) = label;
641 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_HAS_BLOCK_INFO;
643 /* Initialize the block_symbol stuff. */
644 SYMBOL_REF_BLOCK (symbol) = block;
645 SYMBOL_REF_BLOCK_OFFSET (symbol) = offset;
651 initialize_cold_section_name (void)
653 const char *stripped_name;
657 gcc_assert (cfun && current_function_decl);
658 if (crtl->subsections.unlikely_text_section_name)
661 dsn = DECL_SECTION_NAME (current_function_decl);
662 if (flag_function_sections && dsn)
664 name = (char *) alloca (TREE_STRING_LENGTH (dsn) + 1);
665 memcpy (name, TREE_STRING_POINTER (dsn), TREE_STRING_LENGTH (dsn) + 1);
667 stripped_name = targetm.strip_name_encoding (name);
669 buffer = ACONCAT ((stripped_name, "_unlikely", NULL));
670 crtl->subsections.unlikely_text_section_name = ggc_strdup (buffer);
673 crtl->subsections.unlikely_text_section_name = UNLIKELY_EXECUTED_TEXT_SECTION_NAME;
676 /* Tell assembler to switch to unlikely-to-be-executed text section. */
679 unlikely_text_section (void)
683 if (!crtl->subsections.unlikely_text_section_name)
684 initialize_cold_section_name ();
686 return get_named_section (NULL, crtl->subsections.unlikely_text_section_name, 0);
689 return get_named_section (NULL, UNLIKELY_EXECUTED_TEXT_SECTION_NAME, 0);
692 /* When called within a function context, return true if the function
693 has been assigned a cold text section and if SECT is that section.
694 When called outside a function context, return true if SECT is the
695 default cold section. */
698 unlikely_text_section_p (section *sect)
703 name = crtl->subsections.unlikely_text_section_name;
705 name = UNLIKELY_EXECUTED_TEXT_SECTION_NAME;
709 && SECTION_STYLE (sect) == SECTION_NAMED
710 && strcmp (name, sect->named.name) == 0);
713 /* Return a section with a particular name and with whatever SECTION_*
714 flags section_type_flags deems appropriate. The name of the section
715 is taken from NAME if nonnull, otherwise it is taken from DECL's
716 DECL_SECTION_NAME. DECL is the decl associated with the section
717 (see the section comment for details) and RELOC is as for
718 section_type_flags. */
721 get_named_section (tree decl, const char *name, int reloc)
725 gcc_assert (!decl || DECL_P (decl));
727 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
729 flags = targetm.section_type_flags (decl, name, reloc);
731 return get_section (name, flags, decl);
734 /* If required, set DECL_SECTION_NAME to a unique name. */
737 resolve_unique_section (tree decl, int reloc ATTRIBUTE_UNUSED,
738 int flag_function_or_data_sections)
740 if (DECL_SECTION_NAME (decl) == NULL_TREE
741 && targetm.have_named_sections
742 && (flag_function_or_data_sections
743 || DECL_ONE_ONLY (decl)))
744 targetm.asm_out.unique_section (decl, reloc);
747 #ifdef BSS_SECTION_ASM_OP
749 #ifdef ASM_OUTPUT_BSS
751 /* Utility function for ASM_OUTPUT_BSS for targets to use if
752 they don't support alignments in .bss.
753 ??? It is believed that this function will work in most cases so such
754 support is localized here. */
757 asm_output_bss (FILE *file, tree decl ATTRIBUTE_UNUSED,
759 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
760 unsigned HOST_WIDE_INT rounded)
762 gcc_assert (strcmp (XSTR (XEXP (DECL_RTL (decl), 0), 0), name) == 0);
763 targetm.asm_out.globalize_decl_name (file, decl);
764 switch_to_section (bss_section);
765 #ifdef ASM_DECLARE_OBJECT_NAME
766 last_assemble_variable_decl = decl;
767 ASM_DECLARE_OBJECT_NAME (file, name, decl);
769 /* Standard thing is just output label for the object. */
770 ASM_OUTPUT_LABEL (file, name);
771 #endif /* ASM_DECLARE_OBJECT_NAME */
772 ASM_OUTPUT_SKIP (file, rounded ? rounded : 1);
777 #ifdef ASM_OUTPUT_ALIGNED_BSS
779 /* Utility function for targets to use in implementing
780 ASM_OUTPUT_ALIGNED_BSS.
781 ??? It is believed that this function will work in most cases so such
782 support is localized here. */
785 asm_output_aligned_bss (FILE *file, tree decl ATTRIBUTE_UNUSED,
786 const char *name, unsigned HOST_WIDE_INT size,
789 switch_to_section (bss_section);
790 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
791 #ifdef ASM_DECLARE_OBJECT_NAME
792 last_assemble_variable_decl = decl;
793 ASM_DECLARE_OBJECT_NAME (file, name, decl);
795 /* Standard thing is just output label for the object. */
796 ASM_OUTPUT_LABEL (file, name);
797 #endif /* ASM_DECLARE_OBJECT_NAME */
798 ASM_OUTPUT_SKIP (file, size ? size : 1);
803 #endif /* BSS_SECTION_ASM_OP */
805 #ifndef USE_SELECT_SECTION_FOR_FUNCTIONS
806 /* Return the hot section for function DECL. Return text_section for
810 hot_function_section (tree decl)
812 if (decl != NULL_TREE
813 && DECL_SECTION_NAME (decl) != NULL_TREE
814 && targetm.have_named_sections)
815 return get_named_section (decl, NULL, 0);
821 /* Return the section for function DECL.
823 If DECL is NULL_TREE, return the text section. We can be passed
824 NULL_TREE under some circumstances by dbxout.c at least. */
827 function_section (tree decl)
831 if (first_function_block_is_cold)
834 #ifdef USE_SELECT_SECTION_FOR_FUNCTIONS
835 if (decl != NULL_TREE
836 && DECL_SECTION_NAME (decl) != NULL_TREE)
837 return reloc ? unlikely_text_section ()
838 : get_named_section (decl, NULL, 0);
840 return targetm.asm_out.select_section (decl, reloc, DECL_ALIGN (decl));
842 return reloc ? unlikely_text_section () : hot_function_section (decl);
847 current_function_section (void)
849 #ifdef USE_SELECT_SECTION_FOR_FUNCTIONS
850 if (current_function_decl != NULL_TREE
851 && DECL_SECTION_NAME (current_function_decl) != NULL_TREE)
852 return in_cold_section_p ? unlikely_text_section ()
853 : get_named_section (current_function_decl,
856 return targetm.asm_out.select_section (current_function_decl,
858 DECL_ALIGN (current_function_decl));
860 return (in_cold_section_p
861 ? unlikely_text_section ()
862 : hot_function_section (current_function_decl));
866 /* Return the read-only data section associated with function DECL. */
869 default_function_rodata_section (tree decl)
871 if (decl != NULL_TREE && DECL_SECTION_NAME (decl))
873 const char *name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
875 if (DECL_ONE_ONLY (decl) && HAVE_COMDAT_GROUP)
881 dot = strchr (name + 1, '.');
884 len = strlen (dot) + 8;
885 rname = (char *) alloca (len);
887 strcpy (rname, ".rodata");
889 return get_section (rname, SECTION_LINKONCE, decl);
891 /* For .gnu.linkonce.t.foo we want to use .gnu.linkonce.r.foo. */
892 else if (DECL_ONE_ONLY (decl)
893 && strncmp (name, ".gnu.linkonce.t.", 16) == 0)
895 size_t len = strlen (name) + 1;
896 char *rname = (char *) alloca (len);
898 memcpy (rname, name, len);
900 return get_section (rname, SECTION_LINKONCE, decl);
902 /* For .text.foo we want to use .rodata.foo. */
903 else if (flag_function_sections && flag_data_sections
904 && strncmp (name, ".text.", 6) == 0)
906 size_t len = strlen (name) + 1;
907 char *rname = (char *) alloca (len + 2);
909 memcpy (rname, ".rodata", 7);
910 memcpy (rname + 7, name + 5, len - 5);
911 return get_section (rname, 0, decl);
915 return readonly_data_section;
918 /* Return the read-only data section associated with function DECL
919 for targets where that section should be always the single
920 readonly data section. */
923 default_no_function_rodata_section (tree decl ATTRIBUTE_UNUSED)
925 return readonly_data_section;
928 /* Return the section to use for string merging. */
931 mergeable_string_section (tree decl ATTRIBUTE_UNUSED,
932 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED,
933 unsigned int flags ATTRIBUTE_UNUSED)
937 if (HAVE_GAS_SHF_MERGE && flag_merge_constants
938 && TREE_CODE (decl) == STRING_CST
939 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
941 && (len = int_size_in_bytes (TREE_TYPE (decl))) > 0
942 && TREE_STRING_LENGTH (decl) >= len)
944 enum machine_mode mode;
945 unsigned int modesize;
951 mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (decl)));
952 modesize = GET_MODE_BITSIZE (mode);
953 if (modesize >= 8 && modesize <= 256
954 && (modesize & (modesize - 1)) == 0)
956 if (align < modesize)
959 str = TREE_STRING_POINTER (decl);
960 unit = GET_MODE_SIZE (mode);
962 /* Check for embedded NUL characters. */
963 for (i = 0; i < len; i += unit)
965 for (j = 0; j < unit; j++)
966 if (str[i + j] != '\0')
973 sprintf (name, ".rodata.str%d.%d", modesize / 8,
975 flags |= (modesize / 8) | SECTION_MERGE | SECTION_STRINGS;
976 return get_section (name, flags, NULL);
981 return readonly_data_section;
984 /* Return the section to use for constant merging. */
987 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED,
988 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED,
989 unsigned int flags ATTRIBUTE_UNUSED)
991 unsigned int modesize = GET_MODE_BITSIZE (mode);
993 if (HAVE_GAS_SHF_MERGE && flag_merge_constants
999 && (align & (align - 1)) == 0)
1003 sprintf (name, ".rodata.cst%d", (int) (align / 8));
1004 flags |= (align / 8) | SECTION_MERGE;
1005 return get_section (name, flags, NULL);
1007 return readonly_data_section;
1010 /* Given NAME, a putative register name, discard any customary prefixes. */
1013 strip_reg_name (const char *name)
1015 #ifdef REGISTER_PREFIX
1016 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
1017 name += strlen (REGISTER_PREFIX);
1019 if (name[0] == '%' || name[0] == '#')
1024 /* The user has asked for a DECL to have a particular name. Set (or
1025 change) it in such a way that we don't prefix an underscore to
1028 set_user_assembler_name (tree decl, const char *name)
1030 char *starred = (char *) alloca (strlen (name) + 2);
1032 strcpy (starred + 1, name);
1033 change_decl_assembler_name (decl, get_identifier (starred));
1034 SET_DECL_RTL (decl, NULL_RTX);
1037 /* Decode an `asm' spec for a declaration as a register name.
1038 Return the register number, or -1 if nothing specified,
1039 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
1040 or -3 if ASMSPEC is `cc' and is not recognized,
1041 or -4 if ASMSPEC is `memory' and is not recognized.
1042 Accept an exact spelling or a decimal number.
1043 Prefixes such as % are optional. */
1046 decode_reg_name (const char *asmspec)
1052 /* Get rid of confusing prefixes. */
1053 asmspec = strip_reg_name (asmspec);
1055 /* Allow a decimal number as a "register name". */
1056 for (i = strlen (asmspec) - 1; i >= 0; i--)
1057 if (! ISDIGIT (asmspec[i]))
1059 if (asmspec[0] != 0 && i < 0)
1062 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
1068 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1070 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
1073 #ifdef ADDITIONAL_REGISTER_NAMES
1075 static const struct { const char *const name; const int number; } table[]
1076 = ADDITIONAL_REGISTER_NAMES;
1078 for (i = 0; i < (int) ARRAY_SIZE (table); i++)
1079 if (table[i].name[0]
1080 && ! strcmp (asmspec, table[i].name))
1081 return table[i].number;
1083 #endif /* ADDITIONAL_REGISTER_NAMES */
1085 if (!strcmp (asmspec, "memory"))
1088 if (!strcmp (asmspec, "cc"))
1097 /* Return true if DECL's initializer is suitable for a BSS section. */
1100 bss_initializer_p (const_tree decl)
1102 return (DECL_INITIAL (decl) == NULL
1103 || DECL_INITIAL (decl) == error_mark_node
1104 || (flag_zero_initialized_in_bss
1105 /* Leave constant zeroes in .rodata so they
1107 && !TREE_READONLY (decl)
1108 && initializer_zerop (DECL_INITIAL (decl))));
1111 /* Compute the alignment of variable specified by DECL.
1112 DONT_OUTPUT_DATA is from assemble_variable. */
1115 align_variable (tree decl, bool dont_output_data)
1117 unsigned int align = DECL_ALIGN (decl);
1119 /* In the case for initialing an array whose length isn't specified,
1120 where we have not yet been able to do the layout,
1121 figure out the proper alignment now. */
1122 if (dont_output_data && DECL_SIZE (decl) == 0
1123 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1124 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1126 /* Some object file formats have a maximum alignment which they support.
1127 In particular, a.out format supports a maximum alignment of 4. */
1128 if (align > MAX_OFILE_ALIGNMENT)
1130 warning (0, "alignment of %q+D is greater than maximum object "
1131 "file alignment. Using %d", decl,
1132 MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
1133 align = MAX_OFILE_ALIGNMENT;
1136 /* On some machines, it is good to increase alignment sometimes. */
1137 if (! DECL_USER_ALIGN (decl))
1139 #ifdef DATA_ALIGNMENT
1140 unsigned int data_align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1141 /* Don't increase alignment too much for TLS variables - TLS space
1143 if (! DECL_THREAD_LOCAL_P (decl) || data_align <= BITS_PER_WORD)
1146 #ifdef CONSTANT_ALIGNMENT
1147 if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node)
1149 unsigned int const_align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl),
1151 /* Don't increase alignment too much for TLS variables - TLS space
1153 if (! DECL_THREAD_LOCAL_P (decl) || const_align <= BITS_PER_WORD)
1154 align = const_align;
1159 /* Reset the alignment in case we have made it tighter, so we can benefit
1160 from it in get_pointer_alignment. */
1161 DECL_ALIGN (decl) = align;
1164 /* Return the section into which the given VAR_DECL or CONST_DECL
1165 should be placed. PREFER_NOSWITCH_P is true if a noswitch
1166 section should be used wherever possible. */
1169 get_variable_section (tree decl, bool prefer_noswitch_p)
1171 addr_space_t as = ADDR_SPACE_GENERIC;
1174 if (TREE_TYPE (decl) != error_mark_node)
1175 as = TYPE_ADDR_SPACE (TREE_TYPE (decl));
1177 /* If the decl has been given an explicit section name, or it resides
1178 in a non-generic address space, then it isn't common, and shouldn't
1179 be handled as such. */
1180 if (DECL_COMMON (decl) && DECL_SECTION_NAME (decl) == NULL
1181 && ADDR_SPACE_GENERIC_P (as))
1183 if (DECL_THREAD_LOCAL_P (decl))
1184 return tls_comm_section;
1185 /* This cannot be common bss for an emulated TLS object without
1186 a register_common hook. */
1187 else if (DECL_TLS_MODEL (decl) == TLS_MODEL_EMULATED
1188 && !targetm.emutls.register_common)
1190 else if (TREE_PUBLIC (decl) && bss_initializer_p (decl))
1191 return comm_section;
1194 if (DECL_INITIAL (decl) == error_mark_node)
1195 reloc = contains_pointers_p (TREE_TYPE (decl)) ? 3 : 0;
1196 else if (DECL_INITIAL (decl))
1197 reloc = compute_reloc_for_constant (DECL_INITIAL (decl));
1201 resolve_unique_section (decl, reloc, flag_data_sections);
1202 if (IN_NAMED_SECTION (decl))
1203 return get_named_section (decl, NULL, reloc);
1205 if (ADDR_SPACE_GENERIC_P (as)
1206 && !DECL_THREAD_LOCAL_P (decl)
1207 && !(prefer_noswitch_p && targetm.have_switchable_bss_sections)
1208 && bss_initializer_p (decl))
1210 if (!TREE_PUBLIC (decl))
1211 return lcomm_section;
1212 if (bss_noswitch_section)
1213 return bss_noswitch_section;
1216 return targetm.asm_out.select_section (decl, reloc, DECL_ALIGN (decl));
1219 /* Return the block into which object_block DECL should be placed. */
1221 static struct object_block *
1222 get_block_for_decl (tree decl)
1226 if (TREE_CODE (decl) == VAR_DECL)
1228 /* The object must be defined in this translation unit. */
1229 if (DECL_EXTERNAL (decl))
1232 /* There's no point using object blocks for something that is
1233 isolated by definition. */
1234 if (DECL_ONE_ONLY (decl))
1238 /* We can only calculate block offsets if the decl has a known
1240 if (DECL_SIZE_UNIT (decl) == NULL)
1242 if (!host_integerp (DECL_SIZE_UNIT (decl), 1))
1245 /* Find out which section should contain DECL. We cannot put it into
1246 an object block if it requires a standalone definition. */
1247 if (TREE_CODE (decl) == VAR_DECL)
1248 align_variable (decl, 0);
1249 sect = get_variable_section (decl, true);
1250 if (SECTION_STYLE (sect) == SECTION_NOSWITCH)
1253 return get_block_for_section (sect);
1256 /* Make sure block symbol SYMBOL is in block BLOCK. */
1259 change_symbol_block (rtx symbol, struct object_block *block)
1261 if (block != SYMBOL_REF_BLOCK (symbol))
1263 gcc_assert (SYMBOL_REF_BLOCK_OFFSET (symbol) < 0);
1264 SYMBOL_REF_BLOCK (symbol) = block;
1268 /* Return true if it is possible to put DECL in an object_block. */
1271 use_blocks_for_decl_p (tree decl)
1273 /* Only data DECLs can be placed into object blocks. */
1274 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != CONST_DECL)
1277 /* Detect decls created by dw2_force_const_mem. Such decls are
1278 special because DECL_INITIAL doesn't specify the decl's true value.
1279 dw2_output_indirect_constants will instead call assemble_variable
1280 with dont_output_data set to 1 and then print the contents itself. */
1281 if (DECL_INITIAL (decl) == decl)
1284 /* If this decl is an alias, then we don't want to emit a definition. */
1285 if (lookup_attribute ("alias", DECL_ATTRIBUTES (decl)))
1291 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
1292 have static storage duration. In other words, it should not be an
1293 automatic variable, including PARM_DECLs.
1295 There is, however, one exception: this function handles variables
1296 explicitly placed in a particular register by the user.
1298 This is never called for PARM_DECL nodes. */
1301 make_decl_rtl (tree decl)
1303 const char *name = 0;
1307 /* Check that we are not being given an automatic variable. */
1308 gcc_assert (TREE_CODE (decl) != PARM_DECL
1309 && TREE_CODE (decl) != RESULT_DECL);
1311 /* A weak alias has TREE_PUBLIC set but not the other bits. */
1312 gcc_assert (TREE_CODE (decl) != VAR_DECL
1313 || TREE_STATIC (decl)
1314 || TREE_PUBLIC (decl)
1315 || DECL_EXTERNAL (decl)
1316 || DECL_REGISTER (decl));
1318 /* And that we were not given a type or a label. */
1319 gcc_assert (TREE_CODE (decl) != TYPE_DECL
1320 && TREE_CODE (decl) != LABEL_DECL);
1322 /* For a duplicate declaration, we can be called twice on the
1323 same DECL node. Don't discard the RTL already made. */
1324 if (DECL_RTL_SET_P (decl))
1326 /* If the old RTL had the wrong mode, fix the mode. */
1327 x = DECL_RTL (decl);
1328 if (GET_MODE (x) != DECL_MODE (decl))
1329 SET_DECL_RTL (decl, adjust_address_nv (x, DECL_MODE (decl), 0));
1331 if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
1334 /* ??? Another way to do this would be to maintain a hashed
1335 table of such critters. Instead of adding stuff to a DECL
1336 to give certain attributes to it, we could use an external
1337 hash map from DECL to set of attributes. */
1339 /* Let the target reassign the RTL if it wants.
1340 This is necessary, for example, when one machine specific
1341 decl attribute overrides another. */
1342 targetm.encode_section_info (decl, DECL_RTL (decl), false);
1344 /* If the symbol has a SYMBOL_REF_BLOCK field, update it based
1345 on the new decl information. */
1347 && GET_CODE (XEXP (x, 0)) == SYMBOL_REF
1348 && SYMBOL_REF_HAS_BLOCK_INFO_P (XEXP (x, 0)))
1349 change_symbol_block (XEXP (x, 0), get_block_for_decl (decl));
1351 /* Make this function static known to the mudflap runtime. */
1352 if (flag_mudflap && TREE_CODE (decl) == VAR_DECL)
1353 mudflap_enqueue_decl (decl);
1358 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
1360 if (name[0] != '*' && TREE_CODE (decl) != FUNCTION_DECL
1361 && DECL_REGISTER (decl))
1363 error ("register name not specified for %q+D", decl);
1365 else if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
1367 const char *asmspec = name+1;
1368 reg_number = decode_reg_name (asmspec);
1369 /* First detect errors in declaring global registers. */
1370 if (reg_number == -1)
1371 error ("register name not specified for %q+D", decl);
1372 else if (reg_number < 0)
1373 error ("invalid register name for %q+D", decl);
1374 else if (TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
1375 error ("data type of %q+D isn%'t suitable for a register",
1377 else if (! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl))))
1378 error ("register specified for %q+D isn%'t suitable for data type",
1380 /* Now handle properly declared static register variables. */
1385 if (DECL_INITIAL (decl) != 0 && TREE_STATIC (decl))
1387 DECL_INITIAL (decl) = 0;
1388 error ("global register variable has initial value");
1390 if (TREE_THIS_VOLATILE (decl))
1391 warning (OPT_Wvolatile_register_var,
1392 "optimization may eliminate reads and/or "
1393 "writes to register variables");
1395 /* If the user specified one of the eliminables registers here,
1396 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
1397 confused with that register and be eliminated. This usage is
1398 somewhat suspect... */
1400 SET_DECL_RTL (decl, gen_rtx_raw_REG (DECL_MODE (decl), reg_number));
1401 ORIGINAL_REGNO (DECL_RTL (decl)) = reg_number;
1402 REG_USERVAR_P (DECL_RTL (decl)) = 1;
1404 if (TREE_STATIC (decl))
1406 /* Make this register global, so not usable for anything
1408 #ifdef ASM_DECLARE_REGISTER_GLOBAL
1409 name = IDENTIFIER_POINTER (DECL_NAME (decl));
1410 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name);
1412 nregs = hard_regno_nregs[reg_number][DECL_MODE (decl)];
1414 globalize_reg (reg_number + --nregs);
1417 /* As a register variable, it has no section. */
1421 /* Now handle ordinary static variables and functions (in memory).
1422 Also handle vars declared register invalidly. */
1423 else if (name[0] == '*')
1425 #ifdef REGISTER_PREFIX
1426 if (strlen (REGISTER_PREFIX) != 0)
1428 reg_number = decode_reg_name (name);
1429 if (reg_number >= 0 || reg_number == -3)
1430 error ("register name given for non-register variable %q+D", decl);
1435 /* Specifying a section attribute on a variable forces it into a
1436 non-.bss section, and thus it cannot be common. */
1437 if (TREE_CODE (decl) == VAR_DECL
1438 && DECL_SECTION_NAME (decl) != NULL_TREE
1439 && DECL_INITIAL (decl) == NULL_TREE
1440 && DECL_COMMON (decl))
1441 DECL_COMMON (decl) = 0;
1443 /* Variables can't be both common and weak. */
1444 if (TREE_CODE (decl) == VAR_DECL && DECL_WEAK (decl))
1445 DECL_COMMON (decl) = 0;
1447 if (use_object_blocks_p () && use_blocks_for_decl_p (decl))
1448 x = create_block_symbol (name, get_block_for_decl (decl), -1);
1451 enum machine_mode address_mode = Pmode;
1452 if (TREE_TYPE (decl) != error_mark_node)
1454 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (decl));
1455 address_mode = targetm.addr_space.address_mode (as);
1457 x = gen_rtx_SYMBOL_REF (address_mode, name);
1459 SYMBOL_REF_WEAK (x) = DECL_WEAK (decl);
1460 SET_SYMBOL_REF_DECL (x, decl);
1462 x = gen_rtx_MEM (DECL_MODE (decl), x);
1463 if (TREE_CODE (decl) != FUNCTION_DECL)
1464 set_mem_attributes (x, decl, 1);
1465 SET_DECL_RTL (decl, x);
1467 /* Optionally set flags or add text to the name to record information
1468 such as that it is a function name.
1469 If the name is changed, the macro ASM_OUTPUT_LABELREF
1470 will have to know how to strip this information. */
1471 targetm.encode_section_info (decl, DECL_RTL (decl), true);
1473 /* Make this function static known to the mudflap runtime. */
1474 if (flag_mudflap && TREE_CODE (decl) == VAR_DECL)
1475 mudflap_enqueue_decl (decl);
1478 /* Output a string of literal assembler code
1479 for an `asm' keyword used between functions. */
1482 assemble_asm (tree string)
1486 if (TREE_CODE (string) == ADDR_EXPR)
1487 string = TREE_OPERAND (string, 0);
1489 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
1492 /* Record an element in the table of global destructors. SYMBOL is
1493 a SYMBOL_REF of the function to be called; PRIORITY is a number
1494 between 0 and MAX_INIT_PRIORITY. */
1497 default_stabs_asm_out_destructor (rtx symbol ATTRIBUTE_UNUSED,
1498 int priority ATTRIBUTE_UNUSED)
1500 #if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO
1501 /* Tell GNU LD that this is part of the static destructor set.
1502 This will work for any system that uses stabs, most usefully
1504 dbxout_begin_simple_stabs ("___DTOR_LIST__", 22 /* N_SETT */);
1505 dbxout_stab_value_label (XSTR (symbol, 0));
1507 sorry ("global destructors not supported on this target");
1511 /* Write the address of the entity given by SYMBOL to SEC. */
1513 assemble_addr_to_section (rtx symbol, section *sec)
1515 switch_to_section (sec);
1516 assemble_align (POINTER_SIZE);
1517 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1520 /* Return the numbered .ctors.N (if CONSTRUCTOR_P) or .dtors.N (if
1521 not) section for PRIORITY. */
1523 get_cdtor_priority_section (int priority, bool constructor_p)
1527 /* ??? This only works reliably with the GNU linker. */
1528 sprintf (buf, "%s.%.5u",
1529 constructor_p ? ".ctors" : ".dtors",
1530 /* Invert the numbering so the linker puts us in the proper
1531 order; constructors are run from right to left, and the
1532 linker sorts in increasing order. */
1533 MAX_INIT_PRIORITY - priority);
1534 return get_section (buf, SECTION_WRITE, NULL);
1538 default_named_section_asm_out_destructor (rtx symbol, int priority)
1542 if (priority != DEFAULT_INIT_PRIORITY)
1543 sec = get_cdtor_priority_section (priority,
1544 /*constructor_p=*/false);
1546 sec = get_section (".dtors", SECTION_WRITE, NULL);
1548 assemble_addr_to_section (symbol, sec);
1551 #ifdef DTORS_SECTION_ASM_OP
1553 default_dtor_section_asm_out_destructor (rtx symbol,
1554 int priority ATTRIBUTE_UNUSED)
1556 assemble_addr_to_section (symbol, dtors_section);
1560 /* Likewise for global constructors. */
1563 default_stabs_asm_out_constructor (rtx symbol ATTRIBUTE_UNUSED,
1564 int priority ATTRIBUTE_UNUSED)
1566 #if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO
1567 /* Tell GNU LD that this is part of the static destructor set.
1568 This will work for any system that uses stabs, most usefully
1570 dbxout_begin_simple_stabs ("___CTOR_LIST__", 22 /* N_SETT */);
1571 dbxout_stab_value_label (XSTR (symbol, 0));
1573 sorry ("global constructors not supported on this target");
1578 default_named_section_asm_out_constructor (rtx symbol, int priority)
1582 if (priority != DEFAULT_INIT_PRIORITY)
1583 sec = get_cdtor_priority_section (priority,
1584 /*constructor_p=*/true);
1586 sec = get_section (".ctors", SECTION_WRITE, NULL);
1588 assemble_addr_to_section (symbol, sec);
1591 #ifdef CTORS_SECTION_ASM_OP
1593 default_ctor_section_asm_out_constructor (rtx symbol,
1594 int priority ATTRIBUTE_UNUSED)
1596 assemble_addr_to_section (symbol, ctors_section);
1600 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1601 a nonzero value if the constant pool should be output before the
1602 start of the function, or a zero value if the pool should output
1603 after the end of the function. The default is to put it before the
1606 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1607 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1610 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
1611 to be output to assembler.
1612 Set first_global_object_name and weak_global_object_name as appropriate. */
1615 notice_global_symbol (tree decl)
1617 const char **type = &first_global_object_name;
1619 if (first_global_object_name
1620 || !TREE_PUBLIC (decl)
1621 || DECL_EXTERNAL (decl)
1622 || !DECL_NAME (decl)
1623 || (TREE_CODE (decl) != FUNCTION_DECL
1624 && (TREE_CODE (decl) != VAR_DECL
1625 || (DECL_COMMON (decl)
1626 && (DECL_INITIAL (decl) == 0
1627 || DECL_INITIAL (decl) == error_mark_node))))
1628 || !MEM_P (DECL_RTL (decl)))
1631 /* We win when global object is found, but it is useful to know about weak
1632 symbol as well so we can produce nicer unique names. */
1633 if (DECL_WEAK (decl) || DECL_ONE_ONLY (decl) || flag_shlib)
1634 type = &weak_global_object_name;
1640 rtx decl_rtl = DECL_RTL (decl);
1642 p = targetm.strip_name_encoding (XSTR (XEXP (decl_rtl, 0), 0));
1643 name = ggc_strdup (p);
1649 /* Output assembler code for the constant pool of a function and associated
1650 with defining the name of the function. DECL describes the function.
1651 NAME is the function's name. For the constant pool, we use the current
1652 constant pool data. */
1655 assemble_start_function (tree decl, const char *fnname)
1658 char tmp_label[100];
1659 bool hot_label_written = false;
1661 crtl->subsections.unlikely_text_section_name = NULL;
1663 first_function_block_is_cold = false;
1664 if (flag_reorder_blocks_and_partition)
1666 ASM_GENERATE_INTERNAL_LABEL (tmp_label, "LHOTB", const_labelno);
1667 crtl->subsections.hot_section_label = ggc_strdup (tmp_label);
1668 ASM_GENERATE_INTERNAL_LABEL (tmp_label, "LCOLDB", const_labelno);
1669 crtl->subsections.cold_section_label = ggc_strdup (tmp_label);
1670 ASM_GENERATE_INTERNAL_LABEL (tmp_label, "LHOTE", const_labelno);
1671 crtl->subsections.hot_section_end_label = ggc_strdup (tmp_label);
1672 ASM_GENERATE_INTERNAL_LABEL (tmp_label, "LCOLDE", const_labelno);
1673 crtl->subsections.cold_section_end_label = ggc_strdup (tmp_label);
1678 crtl->subsections.hot_section_label = NULL;
1679 crtl->subsections.cold_section_label = NULL;
1680 crtl->subsections.hot_section_end_label = NULL;
1681 crtl->subsections.cold_section_end_label = NULL;
1684 /* The following code does not need preprocessing in the assembler. */
1688 if (CONSTANT_POOL_BEFORE_FUNCTION)
1689 output_constant_pool (fnname, decl);
1691 resolve_unique_section (decl, 0, flag_function_sections);
1693 /* Make sure the not and cold text (code) sections are properly
1694 aligned. This is necessary here in the case where the function
1695 has both hot and cold sections, because we don't want to re-set
1696 the alignment when the section switch happens mid-function. */
1698 if (flag_reorder_blocks_and_partition)
1700 switch_to_section (unlikely_text_section ());
1701 assemble_align (DECL_ALIGN (decl));
1702 ASM_OUTPUT_LABEL (asm_out_file, crtl->subsections.cold_section_label);
1704 /* When the function starts with a cold section, we need to explicitly
1705 align the hot section and write out the hot section label.
1706 But if the current function is a thunk, we do not have a CFG. */
1708 && BB_PARTITION (ENTRY_BLOCK_PTR->next_bb) == BB_COLD_PARTITION)
1710 switch_to_section (text_section);
1711 assemble_align (DECL_ALIGN (decl));
1712 ASM_OUTPUT_LABEL (asm_out_file, crtl->subsections.hot_section_label);
1713 hot_label_written = true;
1714 first_function_block_is_cold = true;
1717 else if (DECL_SECTION_NAME (decl))
1719 /* Calls to function_section rely on first_function_block_is_cold
1720 being accurate. The first block may be cold even if we aren't
1721 doing partitioning, if the entire function was decided by
1722 choose_function_section (predict.c) to be cold. */
1724 initialize_cold_section_name ();
1726 if (crtl->subsections.unlikely_text_section_name
1727 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
1728 crtl->subsections.unlikely_text_section_name) == 0)
1729 first_function_block_is_cold = true;
1732 in_cold_section_p = first_function_block_is_cold;
1734 /* Switch to the correct text section for the start of the function. */
1736 switch_to_section (function_section (decl));
1737 if (flag_reorder_blocks_and_partition
1738 && !hot_label_written)
1739 ASM_OUTPUT_LABEL (asm_out_file, crtl->subsections.hot_section_label);
1741 /* Tell assembler to move to target machine's alignment for functions. */
1742 align = floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT);
1745 ASM_OUTPUT_ALIGN (asm_out_file, align);
1748 /* Handle a user-specified function alignment.
1749 Note that we still need to align to DECL_ALIGN, as above,
1750 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1751 if (! DECL_USER_ALIGN (decl)
1752 && align_functions_log > align
1753 && optimize_function_for_speed_p (cfun))
1755 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1756 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file,
1757 align_functions_log, align_functions - 1);
1759 ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
1763 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1764 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
1767 if (!DECL_IGNORED_P (decl))
1768 (*debug_hooks->begin_function) (decl);
1770 /* Make function name accessible from other files, if appropriate. */
1772 if (TREE_PUBLIC (decl))
1774 notice_global_symbol (decl);
1776 globalize_decl (decl);
1778 maybe_assemble_visibility (decl);
1781 if (DECL_PRESERVE_P (decl))
1782 targetm.asm_out.mark_decl_preserved (fnname);
1784 /* Do any machine/system dependent processing of the function name. */
1785 #ifdef ASM_DECLARE_FUNCTION_NAME
1786 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
1788 /* Standard thing is just output label for the function. */
1789 ASM_OUTPUT_LABEL (asm_out_file, fnname);
1790 #endif /* ASM_DECLARE_FUNCTION_NAME */
1793 /* Output assembler code associated with defining the size of the
1794 function. DECL describes the function. NAME is the function's name. */
1797 assemble_end_function (tree decl, const char *fnname ATTRIBUTE_UNUSED)
1799 #ifdef ASM_DECLARE_FUNCTION_SIZE
1800 /* We could have switched section in the middle of the function. */
1801 if (flag_reorder_blocks_and_partition)
1802 switch_to_section (function_section (decl));
1803 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1805 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1807 output_constant_pool (fnname, decl);
1808 switch_to_section (function_section (decl)); /* need to switch back */
1810 /* Output labels for end of hot/cold text sections (to be used by
1812 if (flag_reorder_blocks_and_partition)
1814 section *save_text_section;
1816 save_text_section = in_section;
1817 switch_to_section (unlikely_text_section ());
1818 ASM_OUTPUT_LABEL (asm_out_file, crtl->subsections.cold_section_end_label);
1819 if (first_function_block_is_cold)
1820 switch_to_section (text_section);
1822 switch_to_section (function_section (decl));
1823 ASM_OUTPUT_LABEL (asm_out_file, crtl->subsections.hot_section_end_label);
1824 switch_to_section (save_text_section);
1828 /* Assemble code to leave SIZE bytes of zeros. */
1831 assemble_zeros (unsigned HOST_WIDE_INT size)
1833 /* Do no output if -fsyntax-only. */
1834 if (flag_syntax_only)
1837 #ifdef ASM_NO_SKIP_IN_TEXT
1838 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1839 so we must output 0s explicitly in the text section. */
1840 if (ASM_NO_SKIP_IN_TEXT && (in_section->common.flags & SECTION_CODE) != 0)
1842 unsigned HOST_WIDE_INT i;
1843 for (i = 0; i < size; i++)
1844 assemble_integer (const0_rtx, 1, BITS_PER_UNIT, 1);
1849 ASM_OUTPUT_SKIP (asm_out_file, size);
1852 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1855 assemble_align (int align)
1857 if (align > BITS_PER_UNIT)
1859 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1863 /* Assemble a string constant with the specified C string as contents. */
1866 assemble_string (const char *p, int size)
1871 /* If the string is very long, split it up. */
1875 int thissize = size - pos;
1876 if (thissize > maximum)
1879 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1887 /* A noswitch_section_callback for lcomm_section. */
1890 emit_local (tree decl ATTRIBUTE_UNUSED,
1891 const char *name ATTRIBUTE_UNUSED,
1892 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
1893 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED)
1895 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1896 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name,
1897 size, DECL_ALIGN (decl));
1899 #elif defined ASM_OUTPUT_ALIGNED_LOCAL
1900 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl));
1903 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1908 /* A noswitch_section_callback for bss_noswitch_section. */
1910 #if defined ASM_OUTPUT_ALIGNED_BSS || defined ASM_OUTPUT_BSS
1912 emit_bss (tree decl ATTRIBUTE_UNUSED,
1913 const char *name ATTRIBUTE_UNUSED,
1914 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
1915 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED)
1917 #if defined ASM_OUTPUT_ALIGNED_BSS
1918 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl));
1921 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded);
1927 /* A noswitch_section_callback for comm_section. */
1930 emit_common (tree decl ATTRIBUTE_UNUSED,
1931 const char *name ATTRIBUTE_UNUSED,
1932 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
1933 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED)
1935 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1936 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name,
1937 size, DECL_ALIGN (decl));
1939 #elif defined ASM_OUTPUT_ALIGNED_COMMON
1940 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl));
1943 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded);
1948 /* A noswitch_section_callback for tls_comm_section. */
1951 emit_tls_common (tree decl ATTRIBUTE_UNUSED,
1952 const char *name ATTRIBUTE_UNUSED,
1953 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
1954 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED)
1956 #ifdef ASM_OUTPUT_TLS_COMMON
1957 ASM_OUTPUT_TLS_COMMON (asm_out_file, decl, name, size);
1960 sorry ("thread-local COMMON data not implemented");
1965 /* Assemble DECL given that it belongs in SECTION_NOSWITCH section SECT.
1966 NAME is the name of DECL's SYMBOL_REF. */
1969 assemble_noswitch_variable (tree decl, const char *name, section *sect)
1971 unsigned HOST_WIDE_INT size, rounded;
1973 size = tree_low_cst (DECL_SIZE_UNIT (decl), 1);
1976 /* Don't allocate zero bytes of common,
1977 since that means "undefined external" in the linker. */
1981 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1982 so that each uninitialized object starts on such a boundary. */
1983 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1984 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1985 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1987 if (!sect->noswitch.callback (decl, name, size, rounded)
1988 && (unsigned HOST_WIDE_INT) DECL_ALIGN_UNIT (decl) > rounded)
1989 warning (0, "requested alignment for %q+D is greater than "
1990 "implemented alignment of %wu", decl, rounded);
1993 /* A subroutine of assemble_variable. Output the label and contents of
1994 DECL, whose address is a SYMBOL_REF with name NAME. DONT_OUTPUT_DATA
1995 is as for assemble_variable. */
1998 assemble_variable_contents (tree decl, const char *name,
1999 bool dont_output_data)
2001 /* Do any machine/system dependent processing of the object. */
2002 #ifdef ASM_DECLARE_OBJECT_NAME
2003 last_assemble_variable_decl = decl;
2004 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
2006 /* Standard thing is just output label for the object. */
2007 ASM_OUTPUT_LABEL (asm_out_file, name);
2008 #endif /* ASM_DECLARE_OBJECT_NAME */
2010 if (!dont_output_data)
2012 if (DECL_INITIAL (decl)
2013 && DECL_INITIAL (decl) != error_mark_node
2014 && !initializer_zerop (DECL_INITIAL (decl)))
2015 /* Output the actual data. */
2016 output_constant (DECL_INITIAL (decl),
2017 tree_low_cst (DECL_SIZE_UNIT (decl), 1),
2020 /* Leave space for it. */
2021 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl), 1));
2025 /* Initialize emulated tls object TO, which refers to TLS variable
2026 DECL and is initialized by PROXY. */
2029 default_emutls_var_init (tree to, tree decl, tree proxy)
2031 VEC(constructor_elt,gc) *v = VEC_alloc (constructor_elt, gc, 4);
2032 constructor_elt *elt;
2033 tree type = TREE_TYPE (to);
2034 tree field = TYPE_FIELDS (type);
2036 elt = VEC_quick_push (constructor_elt, v, NULL);
2038 elt->value = fold_convert (TREE_TYPE (field), DECL_SIZE_UNIT (decl));
2040 elt = VEC_quick_push (constructor_elt, v, NULL);
2041 field = TREE_CHAIN (field);
2043 elt->value = build_int_cst (TREE_TYPE (field),
2044 DECL_ALIGN_UNIT (decl));
2046 elt = VEC_quick_push (constructor_elt, v, NULL);
2047 field = TREE_CHAIN (field);
2049 elt->value = null_pointer_node;
2051 elt = VEC_quick_push (constructor_elt, v, NULL);
2052 field = TREE_CHAIN (field);
2056 return build_constructor (type, v);
2059 /* Assemble everything that is needed for a variable or function declaration.
2060 Not used for automatic variables, and not used for function definitions.
2061 Should not be called for variables of incomplete structure type.
2063 TOP_LEVEL is nonzero if this variable has file scope.
2064 AT_END is nonzero if this is the special handling, at end of compilation,
2065 to define things that have had only tentative definitions.
2066 DONT_OUTPUT_DATA if nonzero means don't actually output the
2067 initial value (that will be done by the caller). */
2070 assemble_variable (tree decl, int top_level ATTRIBUTE_UNUSED,
2071 int at_end ATTRIBUTE_UNUSED, int dont_output_data)
2074 rtx decl_rtl, symbol;
2077 if (! targetm.have_tls
2078 && TREE_CODE (decl) == VAR_DECL
2079 && DECL_THREAD_LOCAL_P (decl))
2081 tree to = emutls_decl (decl);
2083 /* If this variable is defined locally, then we need to initialize the
2084 control structure with size and alignment information. We do this
2085 at the last moment because tentative definitions can take a locally
2086 defined but uninitialized variable and initialize it later, which
2087 would result in incorrect contents. */
2088 if (! DECL_EXTERNAL (to)
2089 && (! DECL_COMMON (to)
2090 || (DECL_INITIAL (decl)
2091 && DECL_INITIAL (decl) != error_mark_node)))
2093 DECL_INITIAL (to) = targetm.emutls.var_init
2094 (to, decl, get_emutls_init_templ_addr (decl));
2096 /* Make sure the template is marked as needed early enough.
2097 Without this, if the variable is placed in a
2098 section-anchored block, the template will only be marked
2099 when it's too late. */
2100 record_references_in_initializer (to, false);
2106 last_assemble_variable_decl = 0;
2108 /* Normally no need to say anything here for external references,
2109 since assemble_external is called by the language-specific code
2110 when a declaration is first seen. */
2112 if (DECL_EXTERNAL (decl))
2115 /* Output no assembler code for a function declaration.
2116 Only definitions of functions output anything. */
2118 if (TREE_CODE (decl) == FUNCTION_DECL)
2121 /* Do nothing for global register variables. */
2122 if (DECL_RTL_SET_P (decl) && REG_P (DECL_RTL (decl)))
2124 TREE_ASM_WRITTEN (decl) = 1;
2128 /* If type was incomplete when the variable was declared,
2129 see if it is complete now. */
2131 if (DECL_SIZE (decl) == 0)
2132 layout_decl (decl, 0);
2134 /* Still incomplete => don't allocate it; treat the tentative defn
2135 (which is what it must have been) as an `extern' reference. */
2137 if (!dont_output_data && DECL_SIZE (decl) == 0)
2139 error ("storage size of %q+D isn%'t known", decl);
2140 TREE_ASM_WRITTEN (decl) = 1;
2144 /* The first declaration of a variable that comes through this function
2145 decides whether it is global (in C, has external linkage)
2146 or local (in C, has internal linkage). So do nothing more
2147 if this function has already run. */
2149 if (TREE_ASM_WRITTEN (decl))
2152 /* Make sure targetm.encode_section_info is invoked before we set
2154 decl_rtl = DECL_RTL (decl);
2156 TREE_ASM_WRITTEN (decl) = 1;
2158 /* Do no output if -fsyntax-only. */
2159 if (flag_syntax_only)
2164 if (! dont_output_data
2165 && ! host_integerp (DECL_SIZE_UNIT (decl), 1))
2167 error ("size of variable %q+D is too large", decl);
2171 gcc_assert (MEM_P (decl_rtl));
2172 gcc_assert (GET_CODE (XEXP (decl_rtl, 0)) == SYMBOL_REF);
2173 symbol = XEXP (decl_rtl, 0);
2174 name = XSTR (symbol, 0);
2175 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
2176 notice_global_symbol (decl);
2178 /* Compute the alignment of this data. */
2180 align_variable (decl, dont_output_data);
2181 set_mem_align (decl_rtl, DECL_ALIGN (decl));
2183 if (TREE_PUBLIC (decl))
2184 maybe_assemble_visibility (decl);
2186 if (DECL_PRESERVE_P (decl))
2187 targetm.asm_out.mark_decl_preserved (name);
2189 /* First make the assembler name(s) global if appropriate. */
2190 sect = get_variable_section (decl, false);
2191 if (TREE_PUBLIC (decl)
2192 && (sect->common.flags & SECTION_COMMON) == 0)
2193 globalize_decl (decl);
2195 /* Output any data that we will need to use the address of. */
2196 if (DECL_INITIAL (decl) && DECL_INITIAL (decl) != error_mark_node)
2197 output_addressed_constants (DECL_INITIAL (decl));
2199 /* dbxout.c needs to know this. */
2200 if (sect && (sect->common.flags & SECTION_CODE) != 0)
2201 DECL_IN_TEXT_SECTION (decl) = 1;
2203 /* If the decl is part of an object_block, make sure that the decl
2204 has been positioned within its block, but do not write out its
2205 definition yet. output_object_blocks will do that later. */
2206 if (SYMBOL_REF_HAS_BLOCK_INFO_P (symbol) && SYMBOL_REF_BLOCK (symbol))
2208 gcc_assert (!dont_output_data);
2209 place_block_symbol (symbol);
2211 else if (SECTION_STYLE (sect) == SECTION_NOSWITCH)
2212 assemble_noswitch_variable (decl, name, sect);
2215 switch_to_section (sect);
2216 if (DECL_ALIGN (decl) > BITS_PER_UNIT)
2217 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (DECL_ALIGN_UNIT (decl)));
2218 assemble_variable_contents (decl, name, dont_output_data);
2222 /* Return 1 if type TYPE contains any pointers. */
2225 contains_pointers_p (tree type)
2227 switch (TREE_CODE (type))
2230 case REFERENCE_TYPE:
2231 /* I'm not sure whether OFFSET_TYPE needs this treatment,
2232 so I'll play safe and return 1. */
2238 case QUAL_UNION_TYPE:
2241 /* For a type that has fields, see if the fields have pointers. */
2242 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
2243 if (TREE_CODE (fields) == FIELD_DECL
2244 && contains_pointers_p (TREE_TYPE (fields)))
2250 /* An array type contains pointers if its element type does. */
2251 return contains_pointers_p (TREE_TYPE (type));
2258 /* We delay assemble_external processing until
2259 the compilation unit is finalized. This is the best we can do for
2260 right now (i.e. stage 3 of GCC 4.0) - the right thing is to delay
2261 it all the way to final. See PR 17982 for further discussion. */
2262 static GTY(()) tree pending_assemble_externals;
2264 #ifdef ASM_OUTPUT_EXTERNAL
2265 /* True if DECL is a function decl for which no out-of-line copy exists.
2266 It is assumed that DECL's assembler name has been set. */
2269 incorporeal_function_p (tree decl)
2271 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_BUILT_IN (decl))
2275 if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
2276 && DECL_FUNCTION_CODE (decl) == BUILT_IN_ALLOCA)
2279 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
2280 if (is_builtin_name (name))
2286 /* Actually do the tests to determine if this is necessary, and invoke
2287 ASM_OUTPUT_EXTERNAL. */
2289 assemble_external_real (tree decl)
2291 rtx rtl = DECL_RTL (decl);
2293 if (MEM_P (rtl) && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
2294 && !SYMBOL_REF_USED (XEXP (rtl, 0))
2295 && !incorporeal_function_p (decl))
2297 /* Some systems do require some output. */
2298 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
2299 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
2305 process_pending_assemble_externals (void)
2307 #ifdef ASM_OUTPUT_EXTERNAL
2309 for (list = pending_assemble_externals; list; list = TREE_CHAIN (list))
2310 assemble_external_real (TREE_VALUE (list));
2312 pending_assemble_externals = 0;
2316 /* This TREE_LIST contains any weak symbol declarations waiting
2318 static GTY(()) tree weak_decls;
2320 /* Output something to declare an external symbol to the assembler,
2321 and qualifiers such as weakness. (Most assemblers don't need
2322 extern declaration, so we normally output nothing.) Do nothing if
2323 DECL is not external. */
2326 assemble_external (tree decl ATTRIBUTE_UNUSED)
2328 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
2329 main body of this code is only rarely exercised. To provide some
2330 testing, on all platforms, we make sure that the ASM_OUT_FILE is
2331 open. If it's not, we should not be calling this function. */
2332 gcc_assert (asm_out_file);
2334 if (!DECL_P (decl) || !DECL_EXTERNAL (decl) || !TREE_PUBLIC (decl))
2337 /* We want to output annotation for weak and external symbols at
2338 very last to check if they are references or not. */
2342 /* TREE_STATIC is a weird and abused creature which is not
2343 generally the right test for whether an entity has been
2344 locally emitted, inlined or otherwise not-really-extern, but
2345 for declarations that can be weak, it happens to be
2347 && !TREE_STATIC (decl)
2348 && lookup_attribute ("weak", DECL_ATTRIBUTES (decl))
2349 && value_member (decl, weak_decls) == NULL_TREE)
2350 weak_decls = tree_cons (NULL, decl, weak_decls);
2352 #ifdef ASM_OUTPUT_EXTERNAL
2353 if (value_member (decl, pending_assemble_externals) == NULL_TREE)
2354 pending_assemble_externals = tree_cons (NULL, decl,
2355 pending_assemble_externals);
2359 /* Similar, for calling a library function FUN. */
2362 assemble_external_libcall (rtx fun)
2364 /* Declare library function name external when first used, if nec. */
2365 if (! SYMBOL_REF_USED (fun))
2367 SYMBOL_REF_USED (fun) = 1;
2368 targetm.asm_out.external_libcall (fun);
2372 /* Assemble a label named NAME. */
2375 assemble_label (const char *name)
2377 ASM_OUTPUT_LABEL (asm_out_file, name);
2380 /* Set the symbol_referenced flag for ID. */
2382 mark_referenced (tree id)
2384 TREE_SYMBOL_REFERENCED (id) = 1;
2387 /* Set the symbol_referenced flag for DECL and notify callgraph. */
2389 mark_decl_referenced (tree decl)
2391 if (TREE_CODE (decl) == FUNCTION_DECL)
2393 /* Extern inline functions don't become needed when referenced.
2394 If we know a method will be emitted in other TU and no new
2395 functions can be marked reachable, just use the external
2397 struct cgraph_node *node = cgraph_node (decl);
2398 if (!DECL_EXTERNAL (decl)
2399 && (!node->local.vtable_method || !cgraph_global_info_ready
2400 || !node->local.finalized))
2401 cgraph_mark_needed_node (node);
2403 else if (TREE_CODE (decl) == VAR_DECL)
2405 struct varpool_node *node = varpool_node (decl);
2406 varpool_mark_needed_node (node);
2407 /* C++ frontend use mark_decl_references to force COMDAT variables
2408 to be output that might appear dead otherwise. */
2409 node->force_output = true;
2411 /* else do nothing - we can get various sorts of CST nodes here,
2412 which do not need to be marked. */
2416 /* Follow the IDENTIFIER_TRANSPARENT_ALIAS chain starting at *ALIAS
2417 until we find an identifier that is not itself a transparent alias.
2418 Modify the alias passed to it by reference (and all aliases on the
2419 way to the ultimate target), such that they do not have to be
2420 followed again, and return the ultimate target of the alias
2424 ultimate_transparent_alias_target (tree *alias)
2426 tree target = *alias;
2428 if (IDENTIFIER_TRANSPARENT_ALIAS (target))
2430 gcc_assert (TREE_CHAIN (target));
2431 target = ultimate_transparent_alias_target (&TREE_CHAIN (target));
2432 gcc_assert (! IDENTIFIER_TRANSPARENT_ALIAS (target)
2433 && ! TREE_CHAIN (target));
2440 /* Output to FILE (an assembly file) a reference to NAME. If NAME
2441 starts with a *, the rest of NAME is output verbatim. Otherwise
2442 NAME is transformed in a target-specific way (usually by the
2443 addition of an underscore). */
2446 assemble_name_raw (FILE *file, const char *name)
2449 fputs (&name[1], file);
2451 ASM_OUTPUT_LABELREF (file, name);
2454 /* Like assemble_name_raw, but should be used when NAME might refer to
2455 an entity that is also represented as a tree (like a function or
2456 variable). If NAME does refer to such an entity, that entity will
2457 be marked as referenced. */
2460 assemble_name (FILE *file, const char *name)
2462 const char *real_name;
2465 real_name = targetm.strip_name_encoding (name);
2467 id = maybe_get_identifier (real_name);
2472 mark_referenced (id);
2473 ultimate_transparent_alias_target (&id);
2475 name = IDENTIFIER_POINTER (id);
2476 gcc_assert (! TREE_CHAIN (id));
2479 assemble_name_raw (file, name);
2482 /* Allocate SIZE bytes writable static space with a gensym name
2483 and return an RTX to refer to its address. */
2486 assemble_static_space (unsigned HOST_WIDE_INT size)
2489 const char *namestring;
2492 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
2494 namestring = ggc_strdup (name);
2496 x = gen_rtx_SYMBOL_REF (Pmode, namestring);
2497 SYMBOL_REF_FLAGS (x) = SYMBOL_FLAG_LOCAL;
2499 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
2500 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
2503 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
2504 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
2507 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
2508 so that each uninitialized object starts on such a boundary. */
2509 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
2510 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
2511 = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
2512 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
2513 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
2514 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
2521 /* Assemble the static constant template for function entry trampolines.
2522 This is done at most once per compilation.
2523 Returns an RTX for the address of the template. */
2525 static GTY(()) rtx initial_trampoline;
2528 assemble_trampoline_template (void)
2535 gcc_assert (targetm.asm_out.trampoline_template != NULL);
2537 if (initial_trampoline)
2538 return initial_trampoline;
2540 /* By default, put trampoline templates in read-only data section. */
2542 #ifdef TRAMPOLINE_SECTION
2543 switch_to_section (TRAMPOLINE_SECTION);
2545 switch_to_section (readonly_data_section);
2548 /* Write the assembler code to define one. */
2549 align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
2551 ASM_OUTPUT_ALIGN (asm_out_file, align);
2553 targetm.asm_out.internal_label (asm_out_file, "LTRAMP", 0);
2554 targetm.asm_out.trampoline_template (asm_out_file);
2556 /* Record the rtl to refer to it. */
2557 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
2558 name = ggc_strdup (label);
2559 symbol = gen_rtx_SYMBOL_REF (Pmode, name);
2560 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
2562 initial_trampoline = gen_const_mem (BLKmode, symbol);
2563 set_mem_align (initial_trampoline, TRAMPOLINE_ALIGNMENT);
2564 set_mem_size (initial_trampoline, GEN_INT (TRAMPOLINE_SIZE));
2566 return initial_trampoline;
2569 /* A and B are either alignments or offsets. Return the minimum alignment
2570 that may be assumed after adding the two together. */
2572 static inline unsigned
2573 min_align (unsigned int a, unsigned int b)
2575 return (a | b) & -(a | b);
2578 /* Return the assembler directive for creating a given kind of integer
2579 object. SIZE is the number of bytes in the object and ALIGNED_P
2580 indicates whether it is known to be aligned. Return NULL if the
2581 assembly dialect has no such directive.
2583 The returned string should be printed at the start of a new line and
2584 be followed immediately by the object's initial value. */
2587 integer_asm_op (int size, int aligned_p)
2589 struct asm_int_op *ops;
2592 ops = &targetm.asm_out.aligned_op;
2594 ops = &targetm.asm_out.unaligned_op;
2599 return targetm.asm_out.byte_op;
2613 /* Use directive OP to assemble an integer object X. Print OP at the
2614 start of the line, followed immediately by the value of X. */
2617 assemble_integer_with_op (const char *op, rtx x)
2619 fputs (op, asm_out_file);
2620 output_addr_const (asm_out_file, x);
2621 fputc ('\n', asm_out_file);
2624 /* The default implementation of the asm_out.integer target hook. */
2627 default_assemble_integer (rtx x ATTRIBUTE_UNUSED,
2628 unsigned int size ATTRIBUTE_UNUSED,
2629 int aligned_p ATTRIBUTE_UNUSED)
2631 const char *op = integer_asm_op (size, aligned_p);
2632 /* Avoid GAS bugs for large values. Specifically negative values whose
2633 absolute value fits in a bfd_vma, but not in a bfd_signed_vma. */
2634 if (size > UNITS_PER_WORD && size > POINTER_SIZE / BITS_PER_UNIT)
2636 return op && (assemble_integer_with_op (op, x), true);
2639 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
2640 the alignment of the integer in bits. Return 1 if we were able to output
2641 the constant, otherwise 0. We must be able to output the constant,
2642 if FORCE is nonzero. */
2645 assemble_integer (rtx x, unsigned int size, unsigned int align, int force)
2649 aligned_p = (align >= MIN (size * BITS_PER_UNIT, BIGGEST_ALIGNMENT));
2651 /* See if the target hook can handle this kind of object. */
2652 if (targetm.asm_out.integer (x, size, aligned_p))
2655 /* If the object is a multi-byte one, try splitting it up. Split
2656 it into words it if is multi-word, otherwise split it into bytes. */
2659 enum machine_mode omode, imode;
2660 unsigned int subalign;
2661 unsigned int subsize, i;
2662 enum mode_class mclass;
2664 subsize = size > UNITS_PER_WORD? UNITS_PER_WORD : 1;
2665 subalign = MIN (align, subsize * BITS_PER_UNIT);
2666 if (GET_CODE (x) == CONST_FIXED)
2667 mclass = GET_MODE_CLASS (GET_MODE (x));
2671 omode = mode_for_size (subsize * BITS_PER_UNIT, mclass, 0);
2672 imode = mode_for_size (size * BITS_PER_UNIT, mclass, 0);
2674 for (i = 0; i < size; i += subsize)
2676 rtx partial = simplify_subreg (omode, x, imode, i);
2677 if (!partial || !assemble_integer (partial, subsize, subalign, 0))
2683 /* If we've printed some of it, but not all of it, there's no going
2688 gcc_assert (!force);
2694 assemble_real (REAL_VALUE_TYPE d, enum machine_mode mode, unsigned int align)
2696 long data[4] = {0, 0, 0, 0};
2698 int bitsize, nelts, nunits, units_per;
2700 /* This is hairy. We have a quantity of known size. real_to_target
2701 will put it into an array of *host* longs, 32 bits per element
2702 (even if long is more than 32 bits). We need to determine the
2703 number of array elements that are occupied (nelts) and the number
2704 of *target* min-addressable units that will be occupied in the
2705 object file (nunits). We cannot assume that 32 divides the
2706 mode's bitsize (size * BITS_PER_UNIT) evenly.
2708 size * BITS_PER_UNIT is used here to make sure that padding bits
2709 (which might appear at either end of the value; real_to_target
2710 will include the padding bits in its output array) are included. */
2712 nunits = GET_MODE_SIZE (mode);
2713 bitsize = nunits * BITS_PER_UNIT;
2714 nelts = CEIL (bitsize, 32);
2715 units_per = 32 / BITS_PER_UNIT;
2717 real_to_target (data, &d, mode);
2719 /* Put out the first word with the specified alignment. */
2720 assemble_integer (GEN_INT (data[0]), MIN (nunits, units_per), align, 1);
2721 nunits -= units_per;
2723 /* Subsequent words need only 32-bit alignment. */
2724 align = min_align (align, 32);
2726 for (i = 1; i < nelts; i++)
2728 assemble_integer (GEN_INT (data[i]), MIN (nunits, units_per), align, 1);
2729 nunits -= units_per;
2733 /* Given an expression EXP with a constant value,
2734 reduce it to the sum of an assembler symbol and an integer.
2735 Store them both in the structure *VALUE.
2736 EXP must be reducible. */
2738 struct GTY(()) addr_const {
2740 HOST_WIDE_INT offset;
2744 decode_addr_const (tree exp, struct addr_const *value)
2746 tree target = TREE_OPERAND (exp, 0);
2752 if (TREE_CODE (target) == COMPONENT_REF
2753 && host_integerp (byte_position (TREE_OPERAND (target, 1)), 0))
2756 offset += int_byte_position (TREE_OPERAND (target, 1));
2757 target = TREE_OPERAND (target, 0);
2759 else if (TREE_CODE (target) == ARRAY_REF
2760 || TREE_CODE (target) == ARRAY_RANGE_REF)
2762 offset += (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target)), 1)
2763 * tree_low_cst (TREE_OPERAND (target, 1), 0));
2764 target = TREE_OPERAND (target, 0);
2770 switch (TREE_CODE (target))
2774 x = DECL_RTL (target);
2778 x = gen_rtx_MEM (FUNCTION_MODE,
2779 gen_rtx_LABEL_REF (Pmode, force_label_rtx (target)));
2788 x = output_constant_def (target, 1);
2795 gcc_assert (MEM_P (x));
2799 value->offset = offset;
2803 static GTY((param_is (struct constant_descriptor_tree)))
2804 htab_t const_desc_htab;
2806 static struct constant_descriptor_tree * build_constant_desc (tree);
2807 static void maybe_output_constant_def_contents (struct constant_descriptor_tree *, int);
2809 /* Constant pool accessor function. */
2812 constant_pool_htab (void)
2814 return const_desc_htab;
2817 /* Compute a hash code for a constant expression. */
2820 const_desc_hash (const void *ptr)
2822 return ((const struct constant_descriptor_tree *)ptr)->hash;
2826 const_hash_1 (const tree exp)
2831 enum tree_code code = TREE_CODE (exp);
2833 /* Either set P and LEN to the address and len of something to hash and
2834 exit the switch or return a value. */
2839 p = (char *) &TREE_INT_CST (exp);
2840 len = sizeof TREE_INT_CST (exp);
2844 return real_hash (TREE_REAL_CST_PTR (exp));
2847 return fixed_hash (TREE_FIXED_CST_PTR (exp));
2850 p = TREE_STRING_POINTER (exp);
2851 len = TREE_STRING_LENGTH (exp);
2855 return (const_hash_1 (TREE_REALPART (exp)) * 5
2856 + const_hash_1 (TREE_IMAGPART (exp)));
2860 unsigned HOST_WIDE_INT idx;
2863 hi = 5 + int_size_in_bytes (TREE_TYPE (exp));
2865 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
2867 hi = hi * 603 + const_hash_1 (value);
2875 struct addr_const value;
2877 decode_addr_const (exp, &value);
2878 switch (GET_CODE (value.base))
2881 /* Don't hash the address of the SYMBOL_REF;
2882 only use the offset and the symbol name. */
2884 p = XSTR (value.base, 0);
2885 for (i = 0; p[i] != 0; i++)
2886 hi = ((hi * 613) + (unsigned) (p[i]));
2890 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2900 case POINTER_PLUS_EXPR:
2902 return (const_hash_1 (TREE_OPERAND (exp, 0)) * 9
2903 + const_hash_1 (TREE_OPERAND (exp, 1)));
2906 return const_hash_1 (TREE_OPERAND (exp, 0)) * 7 + 2;
2909 /* A language specific constant. Just hash the code. */
2913 /* Compute hashing function. */
2915 for (i = 0; i < len; i++)
2916 hi = ((hi * 613) + (unsigned) (p[i]));
2921 /* Wrapper of compare_constant, for the htab interface. */
2923 const_desc_eq (const void *p1, const void *p2)
2925 const struct constant_descriptor_tree *const c1
2926 = (const struct constant_descriptor_tree *) p1;
2927 const struct constant_descriptor_tree *const c2
2928 = (const struct constant_descriptor_tree *) p2;
2929 if (c1->hash != c2->hash)
2931 return compare_constant (c1->value, c2->value);
2934 /* Compare t1 and t2, and return 1 only if they are known to result in
2935 the same bit pattern on output. */
2938 compare_constant (const tree t1, const tree t2)
2940 enum tree_code typecode;
2942 if (t1 == NULL_TREE)
2943 return t2 == NULL_TREE;
2944 if (t2 == NULL_TREE)
2947 if (TREE_CODE (t1) != TREE_CODE (t2))
2950 switch (TREE_CODE (t1))
2953 /* Integer constants are the same only if the same width of type. */
2954 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2956 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2)))
2958 return tree_int_cst_equal (t1, t2);
2961 /* Real constants are the same only if the same width of type. */
2962 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2965 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
2968 /* Fixed constants are the same only if the same width of type. */
2969 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2972 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
2975 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2)))
2978 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
2979 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
2980 TREE_STRING_LENGTH (t1)));
2983 return (compare_constant (TREE_REALPART (t1), TREE_REALPART (t2))
2984 && compare_constant (TREE_IMAGPART (t1), TREE_IMAGPART (t2)));
2988 VEC(constructor_elt, gc) *v1, *v2;
2989 unsigned HOST_WIDE_INT idx;
2991 typecode = TREE_CODE (TREE_TYPE (t1));
2992 if (typecode != TREE_CODE (TREE_TYPE (t2)))
2995 if (typecode == ARRAY_TYPE)
2997 HOST_WIDE_INT size_1 = int_size_in_bytes (TREE_TYPE (t1));
2998 /* For arrays, check that the sizes all match. */
2999 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2))
3001 || size_1 != int_size_in_bytes (TREE_TYPE (t2)))
3006 /* For record and union constructors, require exact type
3008 if (TREE_TYPE (t1) != TREE_TYPE (t2))
3012 v1 = CONSTRUCTOR_ELTS (t1);
3013 v2 = CONSTRUCTOR_ELTS (t2);
3014 if (VEC_length (constructor_elt, v1)
3015 != VEC_length (constructor_elt, v2))
3018 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
3020 constructor_elt *c1 = VEC_index (constructor_elt, v1, idx);
3021 constructor_elt *c2 = VEC_index (constructor_elt, v2, idx);
3023 /* Check that each value is the same... */
3024 if (!compare_constant (c1->value, c2->value))
3026 /* ... and that they apply to the same fields! */
3027 if (typecode == ARRAY_TYPE)
3029 if (!compare_constant (c1->index, c2->index))
3034 if (c1->index != c2->index)
3045 struct addr_const value1, value2;
3047 decode_addr_const (t1, &value1);
3048 decode_addr_const (t2, &value2);
3049 return (value1.offset == value2.offset
3050 && strcmp (XSTR (value1.base, 0), XSTR (value2.base, 0)) == 0);
3054 case POINTER_PLUS_EXPR:
3057 return (compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))
3058 && compare_constant(TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)));
3061 case VIEW_CONVERT_EXPR:
3062 return compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3071 /* Make a copy of the whole tree structure for a constant. This
3072 handles the same types of nodes that compare_constant handles. */
3075 copy_constant (tree exp)
3077 switch (TREE_CODE (exp))
3080 /* For ADDR_EXPR, we do not want to copy the decl whose address
3081 is requested. We do want to copy constants though. */
3082 if (CONSTANT_CLASS_P (TREE_OPERAND (exp, 0)))
3083 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
3084 copy_constant (TREE_OPERAND (exp, 0)));
3086 return copy_node (exp);
3092 return copy_node (exp);
3095 return build_complex (TREE_TYPE (exp),
3096 copy_constant (TREE_REALPART (exp)),
3097 copy_constant (TREE_IMAGPART (exp)));
3100 case POINTER_PLUS_EXPR:
3102 return build2 (TREE_CODE (exp), TREE_TYPE (exp),
3103 copy_constant (TREE_OPERAND (exp, 0)),
3104 copy_constant (TREE_OPERAND (exp, 1)));
3107 case VIEW_CONVERT_EXPR:
3108 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
3109 copy_constant (TREE_OPERAND (exp, 0)));
3113 tree copy = copy_node (exp);
3114 VEC(constructor_elt, gc) *v;
3115 unsigned HOST_WIDE_INT idx;
3116 tree purpose, value;
3118 v = VEC_alloc(constructor_elt, gc, VEC_length(constructor_elt,
3119 CONSTRUCTOR_ELTS (exp)));
3120 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), idx, purpose, value)
3122 constructor_elt *ce = VEC_quick_push (constructor_elt, v, NULL);
3123 ce->index = purpose;
3124 ce->value = copy_constant (value);
3126 CONSTRUCTOR_ELTS (copy) = v;
3135 /* Return the alignment of constant EXP in bits. */
3138 get_constant_alignment (tree exp)
3142 align = TYPE_ALIGN (TREE_TYPE (exp));
3143 #ifdef CONSTANT_ALIGNMENT
3144 align = CONSTANT_ALIGNMENT (exp, align);
3149 /* Return the section into which constant EXP should be placed. */
3152 get_constant_section (tree exp)
3154 if (IN_NAMED_SECTION (exp))
3155 return get_named_section (exp, NULL, compute_reloc_for_constant (exp));
3157 return targetm.asm_out.select_section (exp,
3158 compute_reloc_for_constant (exp),
3159 get_constant_alignment (exp));
3162 /* Return the size of constant EXP in bytes. */
3164 static HOST_WIDE_INT
3165 get_constant_size (tree exp)
3169 size = int_size_in_bytes (TREE_TYPE (exp));
3170 if (TREE_CODE (exp) == STRING_CST)
3171 size = MAX (TREE_STRING_LENGTH (exp), size);
3175 /* Subroutine of output_constant_def:
3176 No constant equal to EXP is known to have been output.
3177 Make a constant descriptor to enter EXP in the hash table.
3178 Assign the label number and construct RTL to refer to the
3179 constant's location in memory.
3180 Caller is responsible for updating the hash table. */
3182 static struct constant_descriptor_tree *
3183 build_constant_desc (tree exp)
3189 struct constant_descriptor_tree *desc;
3191 desc = GGC_NEW (struct constant_descriptor_tree);
3192 desc->value = copy_constant (exp);
3194 /* Propagate marked-ness to copied constant. */
3195 if (flag_mudflap && mf_marked_p (exp))
3196 mf_mark (desc->value);
3198 /* Create a string containing the label name, in LABEL. */
3199 labelno = const_labelno++;
3200 ASM_GENERATE_INTERNAL_LABEL (label, "LC", labelno);
3202 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3203 if (use_object_blocks_p ())
3205 section *sect = get_constant_section (exp);
3206 symbol = create_block_symbol (ggc_strdup (label),
3207 get_block_for_section (sect), -1);
3210 symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label));
3211 SYMBOL_REF_FLAGS (symbol) |= SYMBOL_FLAG_LOCAL;
3212 SET_SYMBOL_REF_DECL (symbol, desc->value);
3213 TREE_CONSTANT_POOL_ADDRESS_P (symbol) = 1;
3215 rtl = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)), symbol);
3216 set_mem_attributes (rtl, exp, 1);
3217 set_mem_alias_set (rtl, 0);
3218 set_mem_alias_set (rtl, const_alias_set);
3220 /* We cannot share RTX'es in pool entries.
3221 Mark this piece of RTL as required for unsharing. */
3222 RTX_FLAG (rtl, used) = 1;
3224 /* Set flags or add text to the name to record information, such as
3225 that it is a local symbol. If the name is changed, the macro
3226 ASM_OUTPUT_LABELREF will have to know how to strip this
3227 information. This call might invalidate our local variable
3228 SYMBOL; we can't use it afterward. */
3230 targetm.encode_section_info (exp, rtl, true);
3237 /* Return an rtx representing a reference to constant data in memory
3238 for the constant expression EXP.
3240 If assembler code for such a constant has already been output,
3241 return an rtx to refer to it.
3242 Otherwise, output such a constant in memory
3243 and generate an rtx for it.
3245 If DEFER is nonzero, this constant can be deferred and output only
3246 if referenced in the function after all optimizations.
3248 `const_desc_table' records which constants already have label strings. */
3251 output_constant_def (tree exp, int defer)
3253 struct constant_descriptor_tree *desc;
3254 struct constant_descriptor_tree key;
3257 /* Look up EXP in the table of constant descriptors. If we didn't find
3258 it, create a new one. */
3260 key.hash = const_hash_1 (exp);
3261 loc = htab_find_slot_with_hash (const_desc_htab, &key, key.hash, INSERT);
3263 desc = (struct constant_descriptor_tree *) *loc;
3266 desc = build_constant_desc (exp);
3267 desc->hash = key.hash;
3271 maybe_output_constant_def_contents (desc, defer);
3275 /* Subroutine of output_constant_def: Decide whether or not we need to
3276 output the constant DESC now, and if so, do it. */
3278 maybe_output_constant_def_contents (struct constant_descriptor_tree *desc,
3281 rtx symbol = XEXP (desc->rtl, 0);
3282 tree exp = desc->value;
3284 if (flag_syntax_only)
3287 if (TREE_ASM_WRITTEN (exp))
3288 /* Already output; don't do it again. */
3291 /* We can always defer constants as long as the context allows
3295 /* Increment n_deferred_constants if it exists. It needs to be at
3296 least as large as the number of constants actually referred to
3297 by the function. If it's too small we'll stop looking too early
3298 and fail to emit constants; if it's too large we'll only look
3299 through the entire function when we could have stopped earlier. */
3301 n_deferred_constants++;
3305 output_constant_def_contents (symbol);
3308 /* Subroutine of output_constant_def_contents. Output the definition
3309 of constant EXP, which is pointed to by label LABEL. ALIGN is the
3310 constant's alignment in bits. */
3313 assemble_constant_contents (tree exp, const char *label, unsigned int align)
3317 size = get_constant_size (exp);
3319 /* Do any machine/system dependent processing of the constant. */
3320 #ifdef ASM_DECLARE_CONSTANT_NAME
3321 ASM_DECLARE_CONSTANT_NAME (asm_out_file, label, exp, size);
3323 /* Standard thing is just output label for the constant. */
3324 ASM_OUTPUT_LABEL (asm_out_file, label);
3325 #endif /* ASM_DECLARE_CONSTANT_NAME */
3327 /* Output the value of EXP. */
3328 output_constant (exp, size, align);
3331 /* We must output the constant data referred to by SYMBOL; do so. */
3334 output_constant_def_contents (rtx symbol)
3336 tree exp = SYMBOL_REF_DECL (symbol);
3339 /* Make sure any other constants whose addresses appear in EXP
3340 are assigned label numbers. */
3341 output_addressed_constants (exp);
3343 /* We are no longer deferring this constant. */
3344 TREE_ASM_WRITTEN (exp) = 1;
3346 /* If the constant is part of an object block, make sure that the
3347 decl has been positioned within its block, but do not write out
3348 its definition yet. output_object_blocks will do that later. */
3349 if (SYMBOL_REF_HAS_BLOCK_INFO_P (symbol) && SYMBOL_REF_BLOCK (symbol))
3350 place_block_symbol (symbol);
3353 switch_to_section (get_constant_section (exp));
3354 align = get_constant_alignment (exp);
3355 if (align > BITS_PER_UNIT)
3356 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
3357 assemble_constant_contents (exp, XSTR (symbol, 0), align);
3360 mudflap_enqueue_constant (exp);
3363 /* Look up EXP in the table of constant descriptors. Return the rtl
3364 if it has been emitted, else null. */
3367 lookup_constant_def (tree exp)
3369 struct constant_descriptor_tree *desc;
3370 struct constant_descriptor_tree key;
3373 key.hash = const_hash_1 (exp);
3374 desc = (struct constant_descriptor_tree *)
3375 htab_find_with_hash (const_desc_htab, &key, key.hash);
3377 return (desc ? desc->rtl : NULL_RTX);
3380 /* Used in the hash tables to avoid outputting the same constant
3381 twice. Unlike 'struct constant_descriptor_tree', RTX constants
3382 are output once per function, not once per file. */
3383 /* ??? Only a few targets need per-function constant pools. Most
3384 can use one per-file pool. Should add a targetm bit to tell the
3387 struct GTY(()) rtx_constant_pool {
3388 /* Pointers to first and last constant in pool, as ordered by offset. */
3389 struct constant_descriptor_rtx *first;
3390 struct constant_descriptor_rtx *last;
3392 /* Hash facility for making memory-constants from constant rtl-expressions.
3393 It is used on RISC machines where immediate integer arguments and
3394 constant addresses are restricted so that such constants must be stored
3396 htab_t GTY((param_is (struct constant_descriptor_rtx))) const_rtx_htab;
3398 /* Current offset in constant pool (does not include any
3399 machine-specific header). */
3400 HOST_WIDE_INT offset;
3403 struct GTY((chain_next ("%h.next"))) constant_descriptor_rtx {
3404 struct constant_descriptor_rtx *next;
3408 HOST_WIDE_INT offset;
3410 enum machine_mode mode;
3416 /* Hash and compare functions for const_rtx_htab. */
3419 const_desc_rtx_hash (const void *ptr)
3421 const struct constant_descriptor_rtx *const desc
3422 = (const struct constant_descriptor_rtx *) ptr;
3427 const_desc_rtx_eq (const void *a, const void *b)
3429 const struct constant_descriptor_rtx *const x
3430 = (const struct constant_descriptor_rtx *) a;
3431 const struct constant_descriptor_rtx *const y
3432 = (const struct constant_descriptor_rtx *) b;
3434 if (x->mode != y->mode)
3436 return rtx_equal_p (x->constant, y->constant);
3439 /* This is the worker function for const_rtx_hash, called via for_each_rtx. */
3442 const_rtx_hash_1 (rtx *xp, void *data)
3444 unsigned HOST_WIDE_INT hwi;
3445 enum machine_mode mode;
3451 code = GET_CODE (x);
3452 mode = GET_MODE (x);
3453 h = (hashval_t) code * 1048573 + mode;
3461 int shift = sizeof (hashval_t) * CHAR_BIT;
3462 const int n = sizeof (HOST_WIDE_INT) / sizeof (hashval_t);
3465 h ^= (hashval_t) hwi;
3466 for (i = 1; i < n; ++i)
3469 h ^= (hashval_t) hwi;
3475 if (mode == VOIDmode)
3477 hwi = CONST_DOUBLE_LOW (x) ^ CONST_DOUBLE_HIGH (x);
3481 h ^= real_hash (CONST_DOUBLE_REAL_VALUE (x));
3485 h ^= fixed_hash (CONST_FIXED_VALUE (x));
3491 for (i = XVECLEN (x, 0); i-- > 0; )
3492 h = h * 251 + const_rtx_hash_1 (&XVECEXP (x, 0, i), data);
3497 h ^= htab_hash_string (XSTR (x, 0));
3501 h = h * 251 + CODE_LABEL_NUMBER (XEXP (x, 0));
3505 case UNSPEC_VOLATILE:
3506 h = h * 251 + XINT (x, 1);
3513 hp = (hashval_t *) data;
3514 *hp = *hp * 509 + h;
3518 /* Compute a hash value for X, which should be a constant. */
3521 const_rtx_hash (rtx x)
3524 for_each_rtx (&x, const_rtx_hash_1, &h);
3529 /* Create and return a new rtx constant pool. */
3531 static struct rtx_constant_pool *
3532 create_constant_pool (void)
3534 struct rtx_constant_pool *pool;
3536 pool = GGC_NEW (struct rtx_constant_pool);
3537 pool->const_rtx_htab = htab_create_ggc (31, const_desc_rtx_hash,
3538 const_desc_rtx_eq, NULL);
3545 /* Initialize constant pool hashing for a new function. */
3548 init_varasm_status (void)
3550 crtl->varasm.pool = create_constant_pool ();
3551 crtl->varasm.deferred_constants = 0;
3554 /* Given a MINUS expression, simplify it if both sides
3555 include the same symbol. */
3558 simplify_subtraction (rtx x)
3560 rtx r = simplify_rtx (x);
3564 /* Given a constant rtx X, make (or find) a memory constant for its value
3565 and return a MEM rtx to refer to it in memory. */
3568 force_const_mem (enum machine_mode mode, rtx x)
3570 struct constant_descriptor_rtx *desc, tmp;
3571 struct rtx_constant_pool *pool;
3578 /* If we're not allowed to drop X into the constant pool, don't. */
3579 if (targetm.cannot_force_const_mem (x))
3582 /* Record that this function has used a constant pool entry. */
3583 crtl->uses_const_pool = 1;
3585 /* Decide which pool to use. */
3586 pool = (targetm.use_blocks_for_constant_p (mode, x)
3587 ? shared_constant_pool
3588 : crtl->varasm.pool);
3590 /* Lookup the value in the hashtable. */
3593 hash = const_rtx_hash (x);
3594 slot = htab_find_slot_with_hash (pool->const_rtx_htab, &tmp, hash, INSERT);
3595 desc = (struct constant_descriptor_rtx *) *slot;
3597 /* If the constant was already present, return its memory. */
3599 return copy_rtx (desc->mem);
3601 /* Otherwise, create a new descriptor. */
3602 desc = GGC_NEW (struct constant_descriptor_rtx);
3605 /* Align the location counter as required by EXP's data type. */
3606 align = GET_MODE_ALIGNMENT (mode == VOIDmode ? word_mode : mode);
3607 #ifdef CONSTANT_ALIGNMENT
3609 tree type = lang_hooks.types.type_for_mode (mode, 0);
3610 if (type != NULL_TREE)
3611 align = CONSTANT_ALIGNMENT (make_tree (type, x), align);
3615 pool->offset += (align / BITS_PER_UNIT) - 1;
3616 pool->offset &= ~ ((align / BITS_PER_UNIT) - 1);
3619 desc->constant = tmp.constant;
3620 desc->offset = pool->offset;
3623 desc->align = align;
3624 desc->labelno = const_labelno;
3627 pool->offset += GET_MODE_SIZE (mode);
3629 pool->last->next = desc;
3631 pool->first = pool->last = desc;
3634 /* Create a string containing the label name, in LABEL. */
3635 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3638 /* Construct the SYMBOL_REF. Make sure to mark it as belonging to
3639 the constants pool. */
3640 if (use_object_blocks_p () && targetm.use_blocks_for_constant_p (mode, x))
3642 section *sect = targetm.asm_out.select_rtx_section (mode, x, align);
3643 symbol = create_block_symbol (ggc_strdup (label),
3644 get_block_for_section (sect), -1);
3647 symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label));
3649 SYMBOL_REF_FLAGS (symbol) |= SYMBOL_FLAG_LOCAL;
3650 CONSTANT_POOL_ADDRESS_P (symbol) = 1;
3651 SET_SYMBOL_REF_CONSTANT (symbol, desc);
3653 /* Construct the MEM. */
3654 desc->mem = def = gen_const_mem (mode, symbol);
3655 set_mem_attributes (def, lang_hooks.types.type_for_mode (mode, 0), 1);
3656 set_mem_align (def, align);
3658 /* If we're dropping a label to the constant pool, make sure we
3660 if (GET_CODE (x) == LABEL_REF)
3661 LABEL_PRESERVE_P (XEXP (x, 0)) = 1;
3663 return copy_rtx (def);
3666 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3669 get_pool_constant (rtx addr)
3671 return SYMBOL_REF_CONSTANT (addr)->constant;
3674 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3675 and whether it has been output or not. */
3678 get_pool_constant_mark (rtx addr, bool *pmarked)
3680 struct constant_descriptor_rtx *desc;
3682 desc = SYMBOL_REF_CONSTANT (addr);
3683 *pmarked = (desc->mark != 0);
3684 return desc->constant;
3687 /* Similar, return the mode. */
3690 get_pool_mode (const_rtx addr)
3692 return SYMBOL_REF_CONSTANT (addr)->mode;
3695 /* Return the size of the constant pool. */
3698 get_pool_size (void)
3700 return crtl->varasm.pool->offset;
3703 /* Worker function for output_constant_pool_1. Emit assembly for X
3704 in MODE with known alignment ALIGN. */
3707 output_constant_pool_2 (enum machine_mode mode, rtx x, unsigned int align)
3709 switch (GET_MODE_CLASS (mode))
3712 case MODE_DECIMAL_FLOAT:
3716 gcc_assert (GET_CODE (x) == CONST_DOUBLE);
3717 REAL_VALUE_FROM_CONST_DOUBLE (r, x);
3718 assemble_real (r, mode, align);
3723 case MODE_PARTIAL_INT:
3728 assemble_integer (x, GET_MODE_SIZE (mode), align, 1);
3731 case MODE_VECTOR_FLOAT:
3732 case MODE_VECTOR_INT:
3733 case MODE_VECTOR_FRACT:
3734 case MODE_VECTOR_UFRACT:
3735 case MODE_VECTOR_ACCUM:
3736 case MODE_VECTOR_UACCUM:
3739 enum machine_mode submode = GET_MODE_INNER (mode);
3740 unsigned int subalign = MIN (align, GET_MODE_BITSIZE (submode));
3742 gcc_assert (GET_CODE (x) == CONST_VECTOR);
3743 units = CONST_VECTOR_NUNITS (x);
3745 for (i = 0; i < units; i++)
3747 rtx elt = CONST_VECTOR_ELT (x, i);
3748 output_constant_pool_2 (submode, elt, i ? subalign : align);
3758 /* Worker function for output_constant_pool. Emit constant DESC,
3759 giving it ALIGN bits of alignment. */
3762 output_constant_pool_1 (struct constant_descriptor_rtx *desc,
3769 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3770 whose CODE_LABEL has been deleted. This can occur if a jump table
3771 is eliminated by optimization. If so, write a constant of zero
3772 instead. Note that this can also happen by turning the
3773 CODE_LABEL into a NOTE. */
3774 /* ??? This seems completely and utterly wrong. Certainly it's
3775 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3776 functioning even with INSN_DELETED_P and friends. */
3779 switch (GET_CODE (tmp))
3782 if (GET_CODE (XEXP (tmp, 0)) != PLUS
3783 || GET_CODE (XEXP (XEXP (tmp, 0), 0)) != LABEL_REF)
3785 tmp = XEXP (XEXP (tmp, 0), 0);
3789 tmp = XEXP (tmp, 0);
3790 gcc_assert (!INSN_DELETED_P (tmp));
3791 gcc_assert (!NOTE_P (tmp)
3792 || NOTE_KIND (tmp) != NOTE_INSN_DELETED);
3799 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3800 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, desc->mode,
3801 align, desc->labelno, done);
3804 assemble_align (align);
3806 /* Output the label. */
3807 targetm.asm_out.internal_label (asm_out_file, "LC", desc->labelno);
3809 /* Output the data. */
3810 output_constant_pool_2 (desc->mode, x, align);
3812 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3813 sections have proper size. */
3814 if (align > GET_MODE_BITSIZE (desc->mode)
3816 && (in_section->common.flags & SECTION_MERGE))
3817 assemble_align (align);
3819 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3825 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3826 to as used. Emit referenced deferred strings. This function can
3827 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3830 mark_constant (rtx *current_rtx, void *data ATTRIBUTE_UNUSED)
3832 rtx x = *current_rtx;
3834 if (x == NULL_RTX || GET_CODE (x) != SYMBOL_REF)
3837 if (CONSTANT_POOL_ADDRESS_P (x))
3839 struct constant_descriptor_rtx *desc = SYMBOL_REF_CONSTANT (x);
3840 if (desc->mark == 0)
3843 for_each_rtx (&desc->constant, mark_constant, NULL);
3846 else if (TREE_CONSTANT_POOL_ADDRESS_P (x))
3848 tree exp = SYMBOL_REF_DECL (x);
3849 if (!TREE_ASM_WRITTEN (exp))
3851 n_deferred_constants--;
3852 output_constant_def_contents (x);
3859 /* Look through appropriate parts of INSN, marking all entries in the
3860 constant pool which are actually being used. Entries that are only
3861 referenced by other constants are also marked as used. Emit
3862 deferred strings that are used. */
3865 mark_constants (rtx insn)
3870 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3871 insns, not any notes that may be attached. We don't want to mark
3872 a constant just because it happens to appear in a REG_EQUIV note. */
3873 if (GET_CODE (PATTERN (insn)) == SEQUENCE)
3875 rtx seq = PATTERN (insn);
3876 int i, n = XVECLEN (seq, 0);
3877 for (i = 0; i < n; ++i)
3879 rtx subinsn = XVECEXP (seq, 0, i);
3880 if (INSN_P (subinsn))
3881 for_each_rtx (&PATTERN (subinsn), mark_constant, NULL);
3885 for_each_rtx (&PATTERN (insn), mark_constant, NULL);
3888 /* Look through the instructions for this function, and mark all the
3889 entries in POOL which are actually being used. Emit deferred constants
3890 which have indeed been used. */
3893 mark_constant_pool (void)
3897 if (!crtl->uses_const_pool && n_deferred_constants == 0)
3900 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3901 mark_constants (insn);
3903 for (link = crtl->epilogue_delay_list;
3905 link = XEXP (link, 1))
3906 mark_constants (XEXP (link, 0));
3909 /* Write all the constants in POOL. */
3912 output_constant_pool_contents (struct rtx_constant_pool *pool)
3914 struct constant_descriptor_rtx *desc;
3916 for (desc = pool->first; desc ; desc = desc->next)
3919 /* If the constant is part of an object_block, make sure that
3920 the constant has been positioned within its block, but do not
3921 write out its definition yet. output_object_blocks will do
3923 if (SYMBOL_REF_HAS_BLOCK_INFO_P (desc->sym)
3924 && SYMBOL_REF_BLOCK (desc->sym))
3925 place_block_symbol (desc->sym);
3928 switch_to_section (targetm.asm_out.select_rtx_section
3929 (desc->mode, desc->constant, desc->align));
3930 output_constant_pool_1 (desc, desc->align);
3935 /* Mark all constants that are used in the current function, then write
3936 out the function's private constant pool. */
3939 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED,
3940 tree fndecl ATTRIBUTE_UNUSED)
3942 struct rtx_constant_pool *pool = crtl->varasm.pool;
3944 /* It is possible for gcc to call force_const_mem and then to later
3945 discard the instructions which refer to the constant. In such a
3946 case we do not need to output the constant. */
3947 mark_constant_pool ();
3949 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3950 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool->offset);
3953 output_constant_pool_contents (pool);
3955 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3956 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool->offset);
3960 /* Write the contents of the shared constant pool. */
3963 output_shared_constant_pool (void)
3965 output_constant_pool_contents (shared_constant_pool);
3968 /* Determine what kind of relocations EXP may need. */
3971 compute_reloc_for_constant (tree exp)
3973 int reloc = 0, reloc2;
3976 switch (TREE_CODE (exp))
3980 /* Go inside any operations that get_inner_reference can handle and see
3981 if what's inside is a constant: no need to do anything here for
3982 addresses of variables or functions. */
3983 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
3984 tem = TREE_OPERAND (tem, 0))
3987 if (TREE_PUBLIC (tem))
3994 case POINTER_PLUS_EXPR:
3995 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
3996 reloc |= compute_reloc_for_constant (TREE_OPERAND (exp, 1));
4000 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
4001 reloc2 = compute_reloc_for_constant (TREE_OPERAND (exp, 1));
4002 /* The difference of two local labels is computable at link time. */
4003 if (reloc == 1 && reloc2 == 1)
4010 case VIEW_CONVERT_EXPR:
4011 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
4016 unsigned HOST_WIDE_INT idx;
4017 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, tem)
4019 reloc |= compute_reloc_for_constant (tem);
4029 /* Find all the constants whose addresses are referenced inside of EXP,
4030 and make sure assembler code with a label has been output for each one.
4031 Indicate whether an ADDR_EXPR has been encountered. */
4034 output_addressed_constants (tree exp)
4038 switch (TREE_CODE (exp))
4042 /* Go inside any operations that get_inner_reference can handle and see
4043 if what's inside is a constant: no need to do anything here for
4044 addresses of variables or functions. */
4045 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
4046 tem = TREE_OPERAND (tem, 0))
4049 /* If we have an initialized CONST_DECL, retrieve the initializer. */
4050 if (TREE_CODE (tem) == CONST_DECL && DECL_INITIAL (tem))
4051 tem = DECL_INITIAL (tem);
4053 if (CONSTANT_CLASS_P (tem) || TREE_CODE (tem) == CONSTRUCTOR)
4054 output_constant_def (tem, 0);
4058 case POINTER_PLUS_EXPR:
4060 output_addressed_constants (TREE_OPERAND (exp, 1));
4064 case VIEW_CONVERT_EXPR:
4065 output_addressed_constants (TREE_OPERAND (exp, 0));
4070 unsigned HOST_WIDE_INT idx;
4071 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, tem)
4073 output_addressed_constants (tem);
4082 /* Whether a constructor CTOR is a valid static constant initializer if all
4083 its elements are. This used to be internal to initializer_constant_valid_p
4084 and has been exposed to let other functions like categorize_ctor_elements
4085 evaluate the property while walking a constructor for other purposes. */
4088 constructor_static_from_elts_p (const_tree ctor)
4090 return (TREE_CONSTANT (ctor)
4091 && (TREE_CODE (TREE_TYPE (ctor)) == UNION_TYPE
4092 || TREE_CODE (TREE_TYPE (ctor)) == RECORD_TYPE)
4093 && !VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (ctor)));
4096 static tree initializer_constant_valid_p_1 (tree value, tree endtype,
4099 /* A subroutine of initializer_constant_valid_p. VALUE is a MINUS_EXPR,
4100 PLUS_EXPR or POINTER_PLUS_EXPR. This looks for cases of VALUE
4101 which are valid when ENDTYPE is an integer of any size; in
4102 particular, this does not accept a pointer minus a constant. This
4103 returns null_pointer_node if the VALUE is an absolute constant
4104 which can be used to initialize a static variable. Otherwise it
4108 narrowing_initializer_constant_valid_p (tree value, tree endtype, tree *cache)
4112 if (!INTEGRAL_TYPE_P (endtype))
4115 op0 = TREE_OPERAND (value, 0);
4116 op1 = TREE_OPERAND (value, 1);
4118 /* Like STRIP_NOPS except allow the operand mode to widen. This
4119 works around a feature of fold that simplifies (int)(p1 - p2) to
4120 ((int)p1 - (int)p2) under the theory that the narrower operation
4123 while (CONVERT_EXPR_P (op0)
4124 || TREE_CODE (op0) == NON_LVALUE_EXPR)
4126 tree inner = TREE_OPERAND (op0, 0);
4127 if (inner == error_mark_node
4128 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
4129 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0)))
4130 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
4135 while (CONVERT_EXPR_P (op1)
4136 || TREE_CODE (op1) == NON_LVALUE_EXPR)
4138 tree inner = TREE_OPERAND (op1, 0);
4139 if (inner == error_mark_node
4140 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
4141 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1)))
4142 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
4147 op0 = initializer_constant_valid_p_1 (op0, endtype, cache);
4151 op1 = initializer_constant_valid_p_1 (op1, endtype,
4152 cache ? cache + 2 : NULL);
4153 /* Both initializers must be known. */
4157 && (op0 == null_pointer_node
4158 || TREE_CODE (value) == MINUS_EXPR))
4159 return null_pointer_node;
4161 /* Support differences between labels. */
4162 if (TREE_CODE (op0) == LABEL_DECL
4163 && TREE_CODE (op1) == LABEL_DECL)
4164 return null_pointer_node;
4166 if (TREE_CODE (op0) == STRING_CST
4167 && TREE_CODE (op1) == STRING_CST
4168 && operand_equal_p (op0, op1, 1))
4169 return null_pointer_node;
4175 /* Helper function of initializer_constant_valid_p.
4176 Return nonzero if VALUE is a valid constant-valued expression
4177 for use in initializing a static variable; one that can be an
4178 element of a "constant" initializer.
4180 Return null_pointer_node if the value is absolute;
4181 if it is relocatable, return the variable that determines the relocation.
4182 We assume that VALUE has been folded as much as possible;
4183 therefore, we do not need to check for such things as
4184 arithmetic-combinations of integers.
4186 Use CACHE (pointer to 2 tree values) for caching if non-NULL. */
4189 initializer_constant_valid_p_1 (tree value, tree endtype, tree *cache)
4193 switch (TREE_CODE (value))
4196 if (constructor_static_from_elts_p (value))
4198 unsigned HOST_WIDE_INT idx;
4200 bool absolute = true;
4202 if (cache && cache[0] == value)
4204 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (value), idx, elt)
4207 reloc = initializer_constant_valid_p_1 (elt, TREE_TYPE (elt),
4214 cache[1] = NULL_TREE;
4218 if (reloc != null_pointer_node)
4221 /* For a non-absolute relocation, there is no single
4222 variable that can be "the variable that determines the
4227 cache[1] = absolute ? null_pointer_node : error_mark_node;
4229 return absolute ? null_pointer_node : error_mark_node;
4232 return TREE_STATIC (value) ? null_pointer_node : NULL_TREE;
4240 return null_pointer_node;
4245 tree op0 = staticp (TREE_OPERAND (value, 0));
4248 /* "&(*a).f" is like unto pointer arithmetic. If "a" turns out
4249 to be a constant, this is old-skool offsetof-like nonsense. */
4250 if (TREE_CODE (op0) == INDIRECT_REF
4251 && TREE_CONSTANT (TREE_OPERAND (op0, 0)))
4252 return null_pointer_node;
4253 /* Taking the address of a nested function involves a trampoline,
4254 unless we don't need or want one. */
4255 if (TREE_CODE (op0) == FUNCTION_DECL
4256 && DECL_STATIC_CHAIN (op0)
4257 && !TREE_NO_TRAMPOLINE (value))
4259 /* "&{...}" requires a temporary to hold the constructed
4261 if (TREE_CODE (op0) == CONSTRUCTOR)
4267 case NON_LVALUE_EXPR:
4268 return initializer_constant_valid_p_1 (TREE_OPERAND (value, 0),
4271 case VIEW_CONVERT_EXPR:
4273 tree src = TREE_OPERAND (value, 0);
4274 tree src_type = TREE_TYPE (src);
4275 tree dest_type = TREE_TYPE (value);
4277 /* Allow view-conversions from aggregate to non-aggregate type only
4278 if the bit pattern is fully preserved afterwards; otherwise, the
4279 RTL expander won't be able to apply a subsequent transformation
4280 to the underlying constructor. */
4281 if (AGGREGATE_TYPE_P (src_type) && !AGGREGATE_TYPE_P (dest_type))
4283 if (TYPE_MODE (endtype) == TYPE_MODE (dest_type))
4284 return initializer_constant_valid_p_1 (src, endtype, cache);
4289 /* Allow all other kinds of view-conversion. */
4290 return initializer_constant_valid_p_1 (src, endtype, cache);
4295 tree src = TREE_OPERAND (value, 0);
4296 tree src_type = TREE_TYPE (src);
4297 tree dest_type = TREE_TYPE (value);
4299 /* Allow conversions between pointer types, floating-point
4300 types, and offset types. */
4301 if ((POINTER_TYPE_P (dest_type) && POINTER_TYPE_P (src_type))
4302 || (FLOAT_TYPE_P (dest_type) && FLOAT_TYPE_P (src_type))
4303 || (TREE_CODE (dest_type) == OFFSET_TYPE
4304 && TREE_CODE (src_type) == OFFSET_TYPE))
4305 return initializer_constant_valid_p_1 (src, endtype, cache);
4307 /* Allow length-preserving conversions between integer types. */
4308 if (INTEGRAL_TYPE_P (dest_type) && INTEGRAL_TYPE_P (src_type)
4309 && (TYPE_PRECISION (dest_type) == TYPE_PRECISION (src_type)))
4310 return initializer_constant_valid_p_1 (src, endtype, cache);
4312 /* Allow conversions between other integer types only if
4314 if (INTEGRAL_TYPE_P (dest_type) && INTEGRAL_TYPE_P (src_type))
4316 tree inner = initializer_constant_valid_p_1 (src, endtype, cache);
4317 if (inner == null_pointer_node)
4318 return null_pointer_node;
4322 /* Allow (int) &foo provided int is as wide as a pointer. */
4323 if (INTEGRAL_TYPE_P (dest_type) && POINTER_TYPE_P (src_type)
4324 && (TYPE_PRECISION (dest_type) >= TYPE_PRECISION (src_type)))
4325 return initializer_constant_valid_p_1 (src, endtype, cache);
4327 /* Likewise conversions from int to pointers, but also allow
4328 conversions from 0. */
4329 if ((POINTER_TYPE_P (dest_type)
4330 || TREE_CODE (dest_type) == OFFSET_TYPE)
4331 && INTEGRAL_TYPE_P (src_type))
4333 if (TREE_CODE (src) == INTEGER_CST
4334 && TYPE_PRECISION (dest_type) >= TYPE_PRECISION (src_type))
4335 return null_pointer_node;
4336 if (integer_zerop (src))
4337 return null_pointer_node;
4338 else if (TYPE_PRECISION (dest_type) <= TYPE_PRECISION (src_type))
4339 return initializer_constant_valid_p_1 (src, endtype, cache);
4342 /* Allow conversions to struct or union types if the value
4344 if (TREE_CODE (dest_type) == RECORD_TYPE
4345 || TREE_CODE (dest_type) == UNION_TYPE)
4346 return initializer_constant_valid_p_1 (src, endtype, cache);
4350 case POINTER_PLUS_EXPR:
4352 /* Any valid floating-point constants will have been folded by now;
4353 with -frounding-math we hit this with addition of two constants. */
4354 if (TREE_CODE (endtype) == REAL_TYPE)
4356 if (cache && cache[0] == value)
4358 if (! INTEGRAL_TYPE_P (endtype)
4359 || TYPE_PRECISION (endtype) >= TYPE_PRECISION (TREE_TYPE (value)))
4361 tree ncache[4] = { NULL_TREE, NULL_TREE, NULL_TREE, NULL_TREE };
4363 = initializer_constant_valid_p_1 (TREE_OPERAND (value, 0),
4366 = initializer_constant_valid_p_1 (TREE_OPERAND (value, 1),
4367 endtype, ncache + 2);
4368 /* If either term is absolute, use the other term's relocation. */
4369 if (valid0 == null_pointer_node)
4371 else if (valid1 == null_pointer_node)
4373 /* Support narrowing pointer differences. */
4375 ret = narrowing_initializer_constant_valid_p (value, endtype,
4379 /* Support narrowing pointer differences. */
4380 ret = narrowing_initializer_constant_valid_p (value, endtype, NULL);
4389 if (TREE_CODE (endtype) == REAL_TYPE)
4391 if (cache && cache[0] == value)
4393 if (! INTEGRAL_TYPE_P (endtype)
4394 || TYPE_PRECISION (endtype) >= TYPE_PRECISION (TREE_TYPE (value)))
4396 tree ncache[4] = { NULL_TREE, NULL_TREE, NULL_TREE, NULL_TREE };
4398 = initializer_constant_valid_p_1 (TREE_OPERAND (value, 0),
4401 = initializer_constant_valid_p_1 (TREE_OPERAND (value, 1),
4402 endtype, ncache + 2);
4403 /* Win if second argument is absolute. */
4404 if (valid1 == null_pointer_node)
4406 /* Win if both arguments have the same relocation.
4407 Then the value is absolute. */
4408 else if (valid0 == valid1 && valid0 != 0)
4409 ret = null_pointer_node;
4410 /* Since GCC guarantees that string constants are unique in the
4411 generated code, a subtraction between two copies of the same
4412 constant string is absolute. */
4413 else if (valid0 && TREE_CODE (valid0) == STRING_CST
4414 && valid1 && TREE_CODE (valid1) == STRING_CST
4415 && operand_equal_p (valid0, valid1, 1))
4416 ret = null_pointer_node;
4417 /* Support narrowing differences. */
4419 ret = narrowing_initializer_constant_valid_p (value, endtype,
4423 /* Support narrowing differences. */
4424 ret = narrowing_initializer_constant_valid_p (value, endtype, NULL);
4439 /* Return nonzero if VALUE is a valid constant-valued expression
4440 for use in initializing a static variable; one that can be an
4441 element of a "constant" initializer.
4443 Return null_pointer_node if the value is absolute;
4444 if it is relocatable, return the variable that determines the relocation.
4445 We assume that VALUE has been folded as much as possible;
4446 therefore, we do not need to check for such things as
4447 arithmetic-combinations of integers. */
4449 initializer_constant_valid_p (tree value, tree endtype)
4451 return initializer_constant_valid_p_1 (value, endtype, NULL);
4454 /* Return true if VALUE is a valid constant-valued expression
4455 for use in initializing a static bit-field; one that can be
4456 an element of a "constant" initializer. */
4459 initializer_constant_valid_for_bitfield_p (tree value)
4461 /* For bitfields we support integer constants or possibly nested aggregates
4463 switch (TREE_CODE (value))
4467 unsigned HOST_WIDE_INT idx;
4470 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (value), idx, elt)
4471 if (!initializer_constant_valid_for_bitfield_p (elt))
4479 case VIEW_CONVERT_EXPR:
4480 case NON_LVALUE_EXPR:
4482 initializer_constant_valid_for_bitfield_p (TREE_OPERAND (value, 0));
4491 /* output_constructor outer state of relevance in recursive calls, typically
4492 for nested aggregate bitfields. */
4495 unsigned int bit_offset; /* current position in ... */
4496 int byte; /* ... the outer byte buffer. */
4499 static unsigned HOST_WIDE_INT
4500 output_constructor (tree, unsigned HOST_WIDE_INT, unsigned int,
4503 /* Output assembler code for constant EXP to FILE, with no label.
4504 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4505 Assumes output_addressed_constants has been done on EXP already.
4507 Generate exactly SIZE bytes of assembler data, padding at the end
4508 with zeros if necessary. SIZE must always be specified.
4510 SIZE is important for structure constructors,
4511 since trailing members may have been omitted from the constructor.
4512 It is also important for initialization of arrays from string constants
4513 since the full length of the string constant might not be wanted.
4514 It is also needed for initialization of unions, where the initializer's
4515 type is just one member, and that may not be as long as the union.
4517 There a case in which we would fail to output exactly SIZE bytes:
4518 for a structure constructor that wants to produce more than SIZE bytes.
4519 But such constructors will never be generated for any possible input.
4521 ALIGN is the alignment of the data in bits. */
4524 output_constant (tree exp, unsigned HOST_WIDE_INT size, unsigned int align)
4526 enum tree_code code;
4527 unsigned HOST_WIDE_INT thissize;
4529 if (size == 0 || flag_syntax_only)
4532 /* See if we're trying to initialize a pointer in a non-default mode
4533 to the address of some declaration somewhere. If the target says
4534 the mode is valid for pointers, assume the target has a way of
4536 if (TREE_CODE (exp) == NOP_EXPR
4537 && POINTER_TYPE_P (TREE_TYPE (exp))
4538 && targetm.addr_space.valid_pointer_mode
4539 (TYPE_MODE (TREE_TYPE (exp)),
4540 TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp)))))
4542 tree saved_type = TREE_TYPE (exp);
4544 /* Peel off any intermediate conversions-to-pointer for valid
4546 while (TREE_CODE (exp) == NOP_EXPR
4547 && POINTER_TYPE_P (TREE_TYPE (exp))
4548 && targetm.addr_space.valid_pointer_mode
4549 (TYPE_MODE (TREE_TYPE (exp)),
4550 TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp)))))
4551 exp = TREE_OPERAND (exp, 0);
4553 /* If what we're left with is the address of something, we can
4554 convert the address to the final type and output it that
4556 if (TREE_CODE (exp) == ADDR_EXPR)
4557 exp = build1 (ADDR_EXPR, saved_type, TREE_OPERAND (exp, 0));
4558 /* Likewise for constant ints. */
4559 else if (TREE_CODE (exp) == INTEGER_CST)
4560 exp = build_int_cst_wide (saved_type, TREE_INT_CST_LOW (exp),
4561 TREE_INT_CST_HIGH (exp));
4565 /* Eliminate any conversions since we'll be outputting the underlying
4567 while (CONVERT_EXPR_P (exp)
4568 || TREE_CODE (exp) == NON_LVALUE_EXPR
4569 || TREE_CODE (exp) == VIEW_CONVERT_EXPR)
4571 HOST_WIDE_INT type_size = int_size_in_bytes (TREE_TYPE (exp));
4572 HOST_WIDE_INT op_size = int_size_in_bytes (TREE_TYPE (TREE_OPERAND (exp, 0)));
4574 /* Make sure eliminating the conversion is really a no-op, except with
4575 VIEW_CONVERT_EXPRs to allow for wild Ada unchecked conversions and
4576 union types to allow for Ada unchecked unions. */
4577 if (type_size > op_size
4578 && TREE_CODE (exp) != VIEW_CONVERT_EXPR
4579 && TREE_CODE (TREE_TYPE (exp)) != UNION_TYPE)
4580 /* Keep the conversion. */
4583 exp = TREE_OPERAND (exp, 0);
4586 code = TREE_CODE (TREE_TYPE (exp));
4587 thissize = int_size_in_bytes (TREE_TYPE (exp));
4589 /* Allow a constructor with no elements for any data type.
4590 This means to fill the space with zeros. */
4591 if (TREE_CODE (exp) == CONSTRUCTOR
4592 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (exp)))
4594 assemble_zeros (size);
4598 if (TREE_CODE (exp) == FDESC_EXPR)
4600 #ifdef ASM_OUTPUT_FDESC
4601 HOST_WIDE_INT part = tree_low_cst (TREE_OPERAND (exp, 1), 0);
4602 tree decl = TREE_OPERAND (exp, 0);
4603 ASM_OUTPUT_FDESC (asm_out_file, decl, part);
4610 /* Now output the underlying data. If we've handling the padding, return.
4611 Otherwise, break and ensure SIZE is the size written. */
4618 case REFERENCE_TYPE:
4620 case FIXED_POINT_TYPE:
4621 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
4622 EXPAND_INITIALIZER),
4623 MIN (size, thissize), align, 0))
4624 error ("initializer for integer/fixed-point value is too complicated");
4628 if (TREE_CODE (exp) != REAL_CST)
4629 error ("initializer for floating value is not a floating constant");
4631 assemble_real (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)), align);
4635 output_constant (TREE_REALPART (exp), thissize / 2, align);
4636 output_constant (TREE_IMAGPART (exp), thissize / 2,
4637 min_align (align, BITS_PER_UNIT * (thissize / 2)));
4642 switch (TREE_CODE (exp))
4645 output_constructor (exp, size, align, NULL);
4648 thissize = MIN ((unsigned HOST_WIDE_INT)TREE_STRING_LENGTH (exp),
4650 assemble_string (TREE_STRING_POINTER (exp), thissize);
4657 unsigned int nalign;
4658 enum machine_mode inner;
4660 inner = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
4661 nalign = MIN (align, GET_MODE_ALIGNMENT (inner));
4663 elt_size = GET_MODE_SIZE (inner);
4665 link = TREE_VECTOR_CST_ELTS (exp);
4666 output_constant (TREE_VALUE (link), elt_size, align);
4667 thissize = elt_size;
4668 while ((link = TREE_CHAIN (link)) != NULL)
4670 output_constant (TREE_VALUE (link), elt_size, nalign);
4671 thissize += elt_size;
4682 gcc_assert (TREE_CODE (exp) == CONSTRUCTOR);
4683 output_constructor (exp, size, align, NULL);
4693 if (size > thissize)
4694 assemble_zeros (size - thissize);
4698 /* Subroutine of output_constructor, used for computing the size of
4699 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4700 type with an unspecified upper bound. */
4702 static unsigned HOST_WIDE_INT
4703 array_size_for_constructor (tree val)
4706 unsigned HOST_WIDE_INT cnt;
4707 tree index, value, tmp;
4709 /* This code used to attempt to handle string constants that are not
4710 arrays of single-bytes, but nothing else does, so there's no point in
4712 if (TREE_CODE (val) == STRING_CST)
4713 return TREE_STRING_LENGTH (val);
4715 max_index = NULL_TREE;
4716 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (val), cnt, index, value)
4718 if (TREE_CODE (index) == RANGE_EXPR)
4719 index = TREE_OPERAND (index, 1);
4720 if (max_index == NULL_TREE || tree_int_cst_lt (max_index, index))
4724 if (max_index == NULL_TREE)
4727 /* Compute the total number of array elements. */
4728 tmp = TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val)));
4729 i = size_binop (MINUS_EXPR, fold_convert (sizetype, max_index),
4730 fold_convert (sizetype, tmp));
4731 i = size_binop (PLUS_EXPR, i, build_int_cst (sizetype, 1));
4733 /* Multiply by the array element unit size to find number of bytes. */
4734 i = size_binop (MULT_EXPR, i, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val))));
4736 return tree_low_cst (i, 1);
4739 /* Other datastructures + helpers for output_constructor. */
4741 /* output_constructor local state to support interaction with helpers. */
4745 /* Received arguments. */
4746 tree exp; /* Constructor expression. */
4747 unsigned HOST_WIDE_INT size; /* # bytes to output - pad if necessary. */
4748 unsigned int align; /* Known initial alignment. */
4750 /* Constructor expression data. */
4751 tree type; /* Expression type. */
4752 tree field; /* Current field decl in a record. */
4753 tree min_index; /* Lower bound if specified for an array. */
4755 /* Output processing state. */
4756 HOST_WIDE_INT total_bytes; /* # bytes output so far / current position. */
4757 bool byte_buffer_in_use; /* Whether byte ... */
4758 int byte; /* ... contains part of a bitfield byte yet to
4761 int last_relative_index; /* Implicit or explicit index of the last
4762 array element output within a bitfield. */
4763 /* Current element. */
4764 tree val; /* Current element value. */
4765 tree index; /* Current element index. */
4769 /* Helper for output_constructor. From the current LOCAL state, output a
4770 RANGE_EXPR element. */
4773 output_constructor_array_range (oc_local_state *local)
4775 unsigned HOST_WIDE_INT fieldsize
4776 = int_size_in_bytes (TREE_TYPE (local->type));
4778 HOST_WIDE_INT lo_index
4779 = tree_low_cst (TREE_OPERAND (local->index, 0), 0);
4780 HOST_WIDE_INT hi_index
4781 = tree_low_cst (TREE_OPERAND (local->index, 1), 0);
4782 HOST_WIDE_INT index;
4785 = min_align (local->align, fieldsize * BITS_PER_UNIT);
4787 for (index = lo_index; index <= hi_index; index++)
4789 /* Output the element's initial value. */
4790 if (local->val == NULL_TREE)
4791 assemble_zeros (fieldsize);
4793 output_constant (local->val, fieldsize, align2);
4795 /* Count its size. */
4796 local->total_bytes += fieldsize;
4800 /* Helper for output_constructor. From the current LOCAL state, output a
4801 field element that is not true bitfield or part of an outer one. */
4804 output_constructor_regular_field (oc_local_state *local)
4806 /* Field size and position. Since this structure is static, we know the
4807 positions are constant. */
4808 unsigned HOST_WIDE_INT fieldsize;
4809 HOST_WIDE_INT fieldpos;
4811 unsigned int align2;
4813 if (local->index != NULL_TREE)
4814 fieldpos = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (local->val)), 1)
4815 * ((tree_low_cst (local->index, 0)
4816 - tree_low_cst (local->min_index, 0))));
4817 else if (local->field != NULL_TREE)
4818 fieldpos = int_byte_position (local->field);
4822 /* Output any buffered-up bit-fields preceding this element. */
4823 if (local->byte_buffer_in_use)
4825 assemble_integer (GEN_INT (local->byte), 1, BITS_PER_UNIT, 1);
4826 local->total_bytes++;
4827 local->byte_buffer_in_use = false;
4830 /* Advance to offset of this element.
4831 Note no alignment needed in an array, since that is guaranteed
4832 if each element has the proper size. */
4833 if ((local->field != NULL_TREE || local->index != NULL_TREE)
4834 && fieldpos != local->total_bytes)
4836 gcc_assert (fieldpos >= local->total_bytes);
4837 assemble_zeros (fieldpos - local->total_bytes);
4838 local->total_bytes = fieldpos;
4841 /* Find the alignment of this element. */
4842 align2 = min_align (local->align, BITS_PER_UNIT * fieldpos);
4844 /* Determine size this element should occupy. */
4849 /* If this is an array with an unspecified upper bound,
4850 the initializer determines the size. */
4851 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4852 but we cannot do this until the deprecated support for
4853 initializing zero-length array members is removed. */
4854 if (TREE_CODE (TREE_TYPE (local->field)) == ARRAY_TYPE
4855 && TYPE_DOMAIN (TREE_TYPE (local->field))
4856 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (local->field))))
4858 fieldsize = array_size_for_constructor (local->val);
4859 /* Given a non-empty initialization, this field had
4861 gcc_assert (!fieldsize || !TREE_CHAIN (local->field));
4863 else if (DECL_SIZE_UNIT (local->field))
4865 /* ??? This can't be right. If the decl size overflows
4866 a host integer we will silently emit no data. */
4867 if (host_integerp (DECL_SIZE_UNIT (local->field), 1))
4868 fieldsize = tree_low_cst (DECL_SIZE_UNIT (local->field), 1);
4872 fieldsize = int_size_in_bytes (TREE_TYPE (local->type));
4874 /* Output the element's initial value. */
4875 if (local->val == NULL_TREE)
4876 assemble_zeros (fieldsize);
4878 output_constant (local->val, fieldsize, align2);
4880 /* Count its size. */
4881 local->total_bytes += fieldsize;
4884 /* Helper for output_constructor. From the current LOCAL and OUTER states,
4885 output an element that is a true bitfield or part of an outer one. */
4888 output_constructor_bitfield (oc_local_state *local, oc_outer_state *outer)
4890 /* Bit size of this element. */
4891 HOST_WIDE_INT ebitsize
4893 ? tree_low_cst (DECL_SIZE (local->field), 1)
4894 : tree_low_cst (TYPE_SIZE (TREE_TYPE (local->type)), 1));
4896 /* Relative index of this element if this is an array component. */
4897 HOST_WIDE_INT relative_index
4900 ? (tree_low_cst (local->index, 0)
4901 - tree_low_cst (local->min_index, 0))
4902 : local->last_relative_index + 1)
4905 /* Bit position of this element from the start of the containing
4907 HOST_WIDE_INT constructor_relative_ebitpos
4909 ? int_bit_position (local->field)
4910 : ebitsize * relative_index);
4912 /* Bit position of this element from the start of a possibly ongoing
4913 outer byte buffer. */
4914 HOST_WIDE_INT byte_relative_ebitpos
4915 = ((outer ? outer->bit_offset : 0) + constructor_relative_ebitpos);
4917 /* From the start of a possibly ongoing outer byte buffer, offsets to
4918 the first bit of this element and to the first bit past the end of
4920 HOST_WIDE_INT next_offset = byte_relative_ebitpos;
4921 HOST_WIDE_INT end_offset = byte_relative_ebitpos + ebitsize;
4923 local->last_relative_index = relative_index;
4925 if (local->val == NULL_TREE)
4926 local->val = integer_zero_node;
4928 while (TREE_CODE (local->val) == VIEW_CONVERT_EXPR
4929 || TREE_CODE (local->val) == NON_LVALUE_EXPR)
4930 local->val = TREE_OPERAND (local->val, 0);
4932 if (TREE_CODE (local->val) != INTEGER_CST
4933 && TREE_CODE (local->val) != CONSTRUCTOR)
4935 error ("invalid initial value for member %qE", DECL_NAME (local->field));
4939 /* If this field does not start in this (or, next) byte,
4941 if (next_offset / BITS_PER_UNIT != local->total_bytes)
4943 /* Output remnant of any bit field in previous bytes. */
4944 if (local->byte_buffer_in_use)
4946 assemble_integer (GEN_INT (local->byte), 1, BITS_PER_UNIT, 1);
4947 local->total_bytes++;
4948 local->byte_buffer_in_use = false;
4951 /* If still not at proper byte, advance to there. */
4952 if (next_offset / BITS_PER_UNIT != local->total_bytes)
4954 gcc_assert (next_offset / BITS_PER_UNIT >= local->total_bytes);
4955 assemble_zeros (next_offset / BITS_PER_UNIT - local->total_bytes);
4956 local->total_bytes = next_offset / BITS_PER_UNIT;
4960 /* Set up the buffer if necessary. */
4961 if (!local->byte_buffer_in_use)
4965 local->byte_buffer_in_use = true;
4968 /* If this is nested constructor, recurse passing the bit offset and the
4969 pending data, then retrieve the new pending data afterwards. */
4970 if (TREE_CODE (local->val) == CONSTRUCTOR)
4972 oc_outer_state output_state;
4974 output_state.bit_offset = next_offset % BITS_PER_UNIT;
4975 output_state.byte = local->byte;
4977 += output_constructor (local->val, 0, 0, &output_state);
4978 local->byte = output_state.byte;
4982 /* Otherwise, we must split the element into pieces that fall within
4983 separate bytes, and combine each byte with previous or following
4985 while (next_offset < end_offset)
4989 HOST_WIDE_INT value;
4990 HOST_WIDE_INT next_byte = next_offset / BITS_PER_UNIT;
4991 HOST_WIDE_INT next_bit = next_offset % BITS_PER_UNIT;
4993 /* Advance from byte to byte
4994 within this element when necessary. */
4995 while (next_byte != local->total_bytes)
4997 assemble_integer (GEN_INT (local->byte), 1, BITS_PER_UNIT, 1);
4998 local->total_bytes++;
5002 /* Number of bits we can process at once
5003 (all part of the same byte). */
5004 this_time = MIN (end_offset - next_offset,
5005 BITS_PER_UNIT - next_bit);
5006 if (BYTES_BIG_ENDIAN)
5008 /* On big-endian machine, take the most significant bits
5009 first (of the bits that are significant)
5010 and put them into bytes from the most significant end. */
5011 shift = end_offset - next_offset - this_time;
5013 /* Don't try to take a bunch of bits that cross
5014 the word boundary in the INTEGER_CST. We can
5015 only select bits from the LOW or HIGH part
5017 if (shift < HOST_BITS_PER_WIDE_INT
5018 && shift + this_time > HOST_BITS_PER_WIDE_INT)
5020 this_time = shift + this_time - HOST_BITS_PER_WIDE_INT;
5021 shift = HOST_BITS_PER_WIDE_INT;
5024 /* Now get the bits from the appropriate constant word. */
5025 if (shift < HOST_BITS_PER_WIDE_INT)
5026 value = TREE_INT_CST_LOW (local->val);
5029 gcc_assert (shift < 2 * HOST_BITS_PER_WIDE_INT);
5030 value = TREE_INT_CST_HIGH (local->val);
5031 shift -= HOST_BITS_PER_WIDE_INT;
5034 /* Get the result. This works only when:
5035 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
5036 local->byte |= (((value >> shift)
5037 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
5038 << (BITS_PER_UNIT - this_time - next_bit));
5042 /* On little-endian machines,
5043 take first the least significant bits of the value
5044 and pack them starting at the least significant
5045 bits of the bytes. */
5046 shift = next_offset - byte_relative_ebitpos;
5048 /* Don't try to take a bunch of bits that cross
5049 the word boundary in the INTEGER_CST. We can
5050 only select bits from the LOW or HIGH part
5052 if (shift < HOST_BITS_PER_WIDE_INT
5053 && shift + this_time > HOST_BITS_PER_WIDE_INT)
5054 this_time = (HOST_BITS_PER_WIDE_INT - shift);
5056 /* Now get the bits from the appropriate constant word. */
5057 if (shift < HOST_BITS_PER_WIDE_INT)
5058 value = TREE_INT_CST_LOW (local->val);
5061 gcc_assert (shift < 2 * HOST_BITS_PER_WIDE_INT);
5062 value = TREE_INT_CST_HIGH (local->val);
5063 shift -= HOST_BITS_PER_WIDE_INT;
5066 /* Get the result. This works only when:
5067 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
5068 local->byte |= (((value >> shift)
5069 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
5073 next_offset += this_time;
5074 local->byte_buffer_in_use = true;
5078 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
5079 Generate at least SIZE bytes, padding if necessary. OUTER designates the
5080 caller output state of relevance in recursive invocations. */
5082 static unsigned HOST_WIDE_INT
5083 output_constructor (tree exp, unsigned HOST_WIDE_INT size,
5084 unsigned int align, oc_outer_state * outer)
5086 unsigned HOST_WIDE_INT cnt;
5087 constructor_elt *ce;
5089 oc_local_state local;
5091 /* Setup our local state to communicate with helpers. */
5094 local.align = align;
5096 local.total_bytes = 0;
5097 local.byte_buffer_in_use = outer != NULL;
5098 local.byte = outer ? outer->byte : 0;
5100 local.type = TREE_TYPE (exp);
5102 local.last_relative_index = -1;
5104 local.min_index = NULL_TREE;
5105 if (TREE_CODE (local.type) == ARRAY_TYPE
5106 && TYPE_DOMAIN (local.type) != NULL_TREE)
5107 local.min_index = TYPE_MIN_VALUE (TYPE_DOMAIN (local.type));
5109 gcc_assert (HOST_BITS_PER_WIDE_INT >= BITS_PER_UNIT);
5111 /* As CE goes through the elements of the constant, FIELD goes through the
5112 structure fields if the constant is a structure. If the constant is a
5113 union, we override this by getting the field from the TREE_LIST element.
5114 But the constant could also be an array. Then FIELD is zero.
5116 There is always a maximum of one element in the chain LINK for unions
5117 (even if the initializer in a source program incorrectly contains
5120 local.field = NULL_TREE;
5121 if (TREE_CODE (local.type) == RECORD_TYPE)
5122 local.field = TYPE_FIELDS (local.type);
5125 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (exp), cnt, ce);
5126 cnt++, local.field = local.field ? TREE_CHAIN (local.field) : 0)
5128 local.val = ce->value;
5129 local.index = NULL_TREE;
5131 /* The element in a union constructor specifies the proper field
5133 if ((TREE_CODE (local.type) == RECORD_TYPE
5134 || TREE_CODE (local.type) == UNION_TYPE
5135 || TREE_CODE (local.type) == QUAL_UNION_TYPE)
5136 && ce->index != NULL_TREE)
5137 local.field = ce->index;
5139 else if (TREE_CODE (local.type) == ARRAY_TYPE)
5140 local.index = ce->index;
5142 #ifdef ASM_COMMENT_START
5143 if (local.field && flag_verbose_asm)
5144 fprintf (asm_out_file, "%s %s:\n",
5146 DECL_NAME (local.field)
5147 ? IDENTIFIER_POINTER (DECL_NAME (local.field))
5151 /* Eliminate the marker that makes a cast not be an lvalue. */
5152 if (local.val != NULL_TREE)
5153 STRIP_NOPS (local.val);
5155 /* Output the current element, using the appropriate helper ... */
5157 /* For an array slice not part of an outer bitfield. */
5159 && local.index != NULL_TREE
5160 && TREE_CODE (local.index) == RANGE_EXPR)
5161 output_constructor_array_range (&local);
5163 /* For a field that is neither a true bitfield nor part of an outer one,
5164 known to be at least byte aligned and multiple-of-bytes long. */
5166 && (local.field == NULL_TREE
5167 || !CONSTRUCTOR_BITFIELD_P (local.field)))
5168 output_constructor_regular_field (&local);
5170 /* For a true bitfield or part of an outer one. */
5172 output_constructor_bitfield (&local, outer);
5175 /* If we are not at toplevel, save the pending data for our caller.
5176 Otherwise output the pending data and padding zeros as needed. */
5178 outer->byte = local.byte;
5181 if (local.byte_buffer_in_use)
5183 assemble_integer (GEN_INT (local.byte), 1, BITS_PER_UNIT, 1);
5184 local.total_bytes++;
5187 if ((unsigned HOST_WIDE_INT)local.total_bytes < local.size)
5189 assemble_zeros (local.size - local.total_bytes);
5190 local.total_bytes = local.size;
5194 return local.total_bytes;
5197 /* Mark DECL as weak. */
5200 mark_weak (tree decl)
5202 DECL_WEAK (decl) = 1;
5204 if (DECL_RTL_SET_P (decl)
5205 && MEM_P (DECL_RTL (decl))
5206 && XEXP (DECL_RTL (decl), 0)
5207 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == SYMBOL_REF)
5208 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl), 0)) = 1;
5211 /* Merge weak status between NEWDECL and OLDDECL. */
5214 merge_weak (tree newdecl, tree olddecl)
5216 if (DECL_WEAK (newdecl) == DECL_WEAK (olddecl))
5218 if (DECL_WEAK (newdecl) && SUPPORTS_WEAK)
5221 /* We put the NEWDECL on the weak_decls list at some point
5222 and OLDDECL as well. Keep just OLDDECL on the list. */
5223 for (pwd = &weak_decls; *pwd; pwd = &TREE_CHAIN (*pwd))
5224 if (TREE_VALUE (*pwd) == newdecl)
5226 *pwd = TREE_CHAIN (*pwd);
5233 if (DECL_WEAK (newdecl))
5237 /* NEWDECL is weak, but OLDDECL is not. */
5239 /* If we already output the OLDDECL, we're in trouble; we can't
5240 go back and make it weak. This error cannot be caught in
5241 declare_weak because the NEWDECL and OLDDECL was not yet
5242 been merged; therefore, TREE_ASM_WRITTEN was not set. */
5243 if (TREE_ASM_WRITTEN (olddecl))
5244 error ("weak declaration of %q+D must precede definition",
5247 /* If we've already generated rtl referencing OLDDECL, we may
5248 have done so in a way that will not function properly with
5250 else if (TREE_USED (olddecl)
5251 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl)))
5252 warning (0, "weak declaration of %q+D after first use results "
5253 "in unspecified behavior", newdecl);
5257 /* We put the NEWDECL on the weak_decls list at some point.
5258 Replace it with the OLDDECL. */
5259 for (wd = weak_decls; wd; wd = TREE_CHAIN (wd))
5260 if (TREE_VALUE (wd) == newdecl)
5262 TREE_VALUE (wd) = olddecl;
5265 /* We may not find the entry on the list. If NEWDECL is a
5266 weak alias, then we will have already called
5267 globalize_decl to remove the entry; in that case, we do
5268 not need to do anything. */
5271 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
5272 mark_weak (olddecl);
5275 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
5276 weak. Just update NEWDECL to indicate that it's weak too. */
5277 mark_weak (newdecl);
5280 /* Declare DECL to be a weak symbol. */
5283 declare_weak (tree decl)
5285 if (! TREE_PUBLIC (decl))
5286 error ("weak declaration of %q+D must be public", decl);
5287 else if (TREE_CODE (decl) == FUNCTION_DECL && TREE_ASM_WRITTEN (decl))
5288 error ("weak declaration of %q+D must precede definition", decl);
5289 else if (!SUPPORTS_WEAK)
5290 warning (0, "weak declaration of %q+D not supported", decl);
5293 if (!lookup_attribute ("weak", DECL_ATTRIBUTES (decl)))
5294 DECL_ATTRIBUTES (decl)
5295 = tree_cons (get_identifier ("weak"), NULL, DECL_ATTRIBUTES (decl));
5299 weak_finish_1 (tree decl)
5301 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
5302 const char *const name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
5305 if (! TREE_USED (decl))
5308 #ifdef ASM_WEAKEN_DECL
5309 ASM_WEAKEN_DECL (asm_out_file, decl, name, NULL);
5311 #ifdef ASM_WEAKEN_LABEL
5312 ASM_WEAKEN_LABEL (asm_out_file, name);
5314 #ifdef ASM_OUTPUT_WEAK_ALIAS
5316 static bool warn_once = 0;
5319 warning (0, "only weak aliases are supported in this configuration");
5329 /* This TREE_LIST contains weakref targets. */
5331 static GTY(()) tree weakref_targets;
5333 /* Forward declaration. */
5334 static tree find_decl_and_mark_needed (tree decl, tree target);
5336 /* Emit any pending weak declarations. */
5343 for (t = weakref_targets; t; t = TREE_CHAIN (t))
5345 tree alias_decl = TREE_PURPOSE (t);
5346 tree target = ultimate_transparent_alias_target (&TREE_VALUE (t));
5348 if (! TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (alias_decl)))
5349 /* Remove alias_decl from the weak list, but leave entries for
5350 the target alone. */
5352 #ifndef ASM_OUTPUT_WEAKREF
5353 else if (! TREE_SYMBOL_REFERENCED (target))
5355 /* Use ASM_WEAKEN_LABEL only if ASM_WEAKEN_DECL is not
5356 defined, otherwise we and weak_finish_1 would use
5357 different macros. */
5358 # if defined ASM_WEAKEN_LABEL && ! defined ASM_WEAKEN_DECL
5359 ASM_WEAKEN_LABEL (asm_out_file, IDENTIFIER_POINTER (target));
5361 tree decl = find_decl_and_mark_needed (alias_decl, target);
5365 decl = build_decl (DECL_SOURCE_LOCATION (alias_decl),
5366 TREE_CODE (alias_decl), target,
5367 TREE_TYPE (alias_decl));
5369 DECL_EXTERNAL (decl) = 1;
5370 TREE_PUBLIC (decl) = 1;
5371 DECL_ARTIFICIAL (decl) = 1;
5372 TREE_NOTHROW (decl) = TREE_NOTHROW (alias_decl);
5373 TREE_USED (decl) = 1;
5376 weak_finish_1 (decl);
5385 /* Remove the alias and the target from the pending weak list
5386 so that we do not emit any .weak directives for the former,
5387 nor multiple .weak directives for the latter. */
5388 for (p = &weak_decls; (t2 = *p) ; )
5390 if (TREE_VALUE (t2) == alias_decl
5391 || target == DECL_ASSEMBLER_NAME (TREE_VALUE (t2)))
5392 *p = TREE_CHAIN (t2);
5394 p = &TREE_CHAIN (t2);
5397 /* Remove other weakrefs to the same target, to speed things up. */
5398 for (p = &TREE_CHAIN (t); (t2 = *p) ; )
5400 if (target == ultimate_transparent_alias_target (&TREE_VALUE (t2)))
5401 *p = TREE_CHAIN (t2);
5403 p = &TREE_CHAIN (t2);
5408 for (t = weak_decls; t; t = TREE_CHAIN (t))
5410 tree decl = TREE_VALUE (t);
5412 weak_finish_1 (decl);
5416 /* Emit the assembly bits to indicate that DECL is globally visible. */
5419 globalize_decl (tree decl)
5422 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
5423 if (DECL_WEAK (decl))
5425 const char *name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
5428 #ifdef ASM_WEAKEN_DECL
5429 ASM_WEAKEN_DECL (asm_out_file, decl, name, 0);
5431 ASM_WEAKEN_LABEL (asm_out_file, name);
5434 /* Remove this function from the pending weak list so that
5435 we do not emit multiple .weak directives for it. */
5436 for (p = &weak_decls; (t = *p) ; )
5438 if (DECL_ASSEMBLER_NAME (decl) == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
5439 *p = TREE_CHAIN (t);
5441 p = &TREE_CHAIN (t);
5444 /* Remove weakrefs to the same target from the pending weakref
5445 list, for the same reason. */
5446 for (p = &weakref_targets; (t = *p) ; )
5448 if (DECL_ASSEMBLER_NAME (decl)
5449 == ultimate_transparent_alias_target (&TREE_VALUE (t)))
5450 *p = TREE_CHAIN (t);
5452 p = &TREE_CHAIN (t);
5459 targetm.asm_out.globalize_decl_name (asm_out_file, decl);
5462 VEC(alias_pair,gc) *alias_pairs;
5464 /* Given an assembly name, find the decl it is associated with. At the
5465 same time, mark it needed for cgraph. */
5468 find_decl_and_mark_needed (tree decl, tree target)
5470 struct cgraph_node *fnode = NULL;
5471 struct varpool_node *vnode = NULL;
5473 if (TREE_CODE (decl) == FUNCTION_DECL)
5475 fnode = cgraph_node_for_asm (target);
5477 vnode = varpool_node_for_asm (target);
5481 vnode = varpool_node_for_asm (target);
5483 fnode = cgraph_node_for_asm (target);
5488 cgraph_mark_needed_node (fnode);
5493 varpool_mark_needed_node (vnode);
5500 /* Output the assembler code for a define (equate) using ASM_OUTPUT_DEF
5501 or ASM_OUTPUT_DEF_FROM_DECLS. The function defines the symbol whose
5502 tree node is DECL to have the value of the tree node TARGET. */
5505 do_assemble_alias (tree decl, tree target)
5507 if (TREE_ASM_WRITTEN (decl))
5510 TREE_ASM_WRITTEN (decl) = 1;
5511 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl)) = 1;
5513 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)))
5515 ultimate_transparent_alias_target (&target);
5517 if (!targetm.have_tls
5518 && TREE_CODE (decl) == VAR_DECL
5519 && DECL_THREAD_LOCAL_P (decl))
5521 decl = emutls_decl (decl);
5522 target = get_emutls_object_name (target);
5525 if (!TREE_SYMBOL_REFERENCED (target))
5526 weakref_targets = tree_cons (decl, target, weakref_targets);
5528 #ifdef ASM_OUTPUT_WEAKREF
5529 ASM_OUTPUT_WEAKREF (asm_out_file, decl,
5530 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)),
5531 IDENTIFIER_POINTER (target));
5535 error_at (DECL_SOURCE_LOCATION (decl),
5536 "weakref is not supported in this configuration");
5543 if (!targetm.have_tls
5544 && TREE_CODE (decl) == VAR_DECL
5545 && DECL_THREAD_LOCAL_P (decl))
5547 decl = emutls_decl (decl);
5548 target = get_emutls_object_name (target);
5551 #ifdef ASM_OUTPUT_DEF
5552 /* Make name accessible from other files, if appropriate. */
5554 if (TREE_PUBLIC (decl))
5556 globalize_decl (decl);
5557 maybe_assemble_visibility (decl);
5560 # ifdef ASM_OUTPUT_DEF_FROM_DECLS
5561 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
5563 ASM_OUTPUT_DEF (asm_out_file,
5564 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)),
5565 IDENTIFIER_POINTER (target));
5567 #elif defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
5572 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
5573 # ifdef ASM_WEAKEN_DECL
5574 ASM_WEAKEN_DECL (asm_out_file, decl, name, IDENTIFIER_POINTER (target));
5576 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
5578 /* Remove this function from the pending weak list so that
5579 we do not emit multiple .weak directives for it. */
5580 for (p = &weak_decls; (t = *p) ; )
5581 if (DECL_ASSEMBLER_NAME (decl) == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
5582 *p = TREE_CHAIN (t);
5584 p = &TREE_CHAIN (t);
5586 /* Remove weakrefs to the same target from the pending weakref
5587 list, for the same reason. */
5588 for (p = &weakref_targets; (t = *p) ; )
5590 if (DECL_ASSEMBLER_NAME (decl)
5591 == ultimate_transparent_alias_target (&TREE_VALUE (t)))
5592 *p = TREE_CHAIN (t);
5594 p = &TREE_CHAIN (t);
5601 /* Remove the alias pairing for functions that are no longer in the call
5605 remove_unreachable_alias_pairs (void)
5610 if (alias_pairs == NULL)
5613 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); )
5615 if (!DECL_EXTERNAL (p->decl))
5617 struct cgraph_node *fnode = NULL;
5618 struct varpool_node *vnode = NULL;
5619 fnode = cgraph_node_for_asm (p->target);
5620 vnode = (fnode == NULL) ? varpool_node_for_asm (p->target) : NULL;
5621 if (fnode == NULL && vnode == NULL)
5623 VEC_unordered_remove (alias_pair, alias_pairs, i);
5633 /* First pass of completing pending aliases. Make sure that cgraph knows
5634 which symbols will be required. */
5637 finish_aliases_1 (void)
5642 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
5646 target_decl = find_decl_and_mark_needed (p->decl, p->target);
5647 if (target_decl == NULL)
5649 if (! lookup_attribute ("weakref", DECL_ATTRIBUTES (p->decl)))
5650 error ("%q+D aliased to undefined symbol %qE",
5651 p->decl, p->target);
5653 else if (DECL_EXTERNAL (target_decl)
5654 /* We use local aliases for C++ thunks to force the tailcall
5655 to bind locally. Of course this is a hack - to keep it
5656 working do the following (which is not strictly correct). */
5657 && (! TREE_CODE (target_decl) == FUNCTION_DECL
5658 || ! DECL_VIRTUAL_P (target_decl))
5659 && ! lookup_attribute ("weakref", DECL_ATTRIBUTES (p->decl)))
5660 error ("%q+D aliased to external symbol %qE",
5661 p->decl, p->target);
5665 /* Second pass of completing pending aliases. Emit the actual assembly.
5666 This happens at the end of compilation and thus it is assured that the
5667 target symbol has been emitted. */
5670 finish_aliases_2 (void)
5675 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
5676 do_assemble_alias (p->decl, p->target);
5678 VEC_truncate (alias_pair, alias_pairs, 0);
5681 /* Emit an assembler directive to make the symbol for DECL an alias to
5682 the symbol for TARGET. */
5685 assemble_alias (tree decl, tree target)
5688 bool is_weakref = false;
5690 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)))
5692 tree alias = DECL_ASSEMBLER_NAME (decl);
5696 ultimate_transparent_alias_target (&target);
5698 if (alias == target)
5699 error ("weakref %q+D ultimately targets itself", decl);
5702 #ifndef ASM_OUTPUT_WEAKREF
5703 IDENTIFIER_TRANSPARENT_ALIAS (alias) = 1;
5704 TREE_CHAIN (alias) = target;
5707 if (TREE_PUBLIC (decl))
5708 error ("weakref %q+D must have static linkage", decl);
5712 #if !defined (ASM_OUTPUT_DEF)
5713 # if !defined(ASM_OUTPUT_WEAK_ALIAS) && !defined (ASM_WEAKEN_DECL)
5714 error_at (DECL_SOURCE_LOCATION (decl),
5715 "alias definitions not supported in this configuration");
5718 if (!DECL_WEAK (decl))
5720 error_at (DECL_SOURCE_LOCATION (decl),
5721 "only weak aliases are supported in this configuration");
5728 /* We must force creation of DECL_RTL for debug info generation, even though
5729 we don't use it here. */
5730 make_decl_rtl (decl);
5731 TREE_USED (decl) = 1;
5733 /* A quirk of the initial implementation of aliases required that the user
5734 add "extern" to all of them. Which is silly, but now historical. Do
5735 note that the symbol is in fact locally defined. */
5737 DECL_EXTERNAL (decl) = 0;
5739 /* Allow aliases to aliases. */
5740 if (TREE_CODE (decl) == FUNCTION_DECL)
5741 cgraph_node (decl)->alias = true;
5743 varpool_node (decl)->alias = true;
5745 /* If the target has already been emitted, we don't have to queue the
5746 alias. This saves a tad of memory. */
5747 if (cgraph_global_info_ready)
5748 target_decl = find_decl_and_mark_needed (decl, target);
5751 if (target_decl && TREE_ASM_WRITTEN (target_decl))
5752 do_assemble_alias (decl, target);
5755 alias_pair *p = VEC_safe_push (alias_pair, gc, alias_pairs, NULL);
5761 /* Emit an assembler directive to set symbol for DECL visibility to
5762 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
5765 default_assemble_visibility (tree decl, int vis)
5767 static const char * const visibility_types[] = {
5768 NULL, "protected", "hidden", "internal"
5771 const char *name, *type;
5773 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
5774 type = visibility_types[vis];
5776 #ifdef HAVE_GAS_HIDDEN
5777 fprintf (asm_out_file, "\t.%s\t", type);
5778 assemble_name (asm_out_file, name);
5779 fprintf (asm_out_file, "\n");
5781 warning (OPT_Wattributes, "visibility attribute not supported "
5782 "in this configuration; ignored");
5786 /* A helper function to call assemble_visibility when needed for a decl. */
5789 maybe_assemble_visibility (tree decl)
5791 enum symbol_visibility vis = DECL_VISIBILITY (decl);
5793 if (vis != VISIBILITY_DEFAULT)
5795 targetm.asm_out.visibility (decl, vis);
5802 /* Returns 1 if the target configuration supports defining public symbols
5803 so that one of them will be chosen at link time instead of generating a
5804 multiply-defined symbol error, whether through the use of weak symbols or
5805 a target-specific mechanism for having duplicates discarded. */
5808 supports_one_only (void)
5810 if (SUPPORTS_ONE_ONLY)
5812 return SUPPORTS_WEAK;
5815 /* Set up DECL as a public symbol that can be defined in multiple
5816 translation units without generating a linker error. */
5819 make_decl_one_only (tree decl, tree comdat_group)
5821 gcc_assert (TREE_CODE (decl) == VAR_DECL
5822 || TREE_CODE (decl) == FUNCTION_DECL);
5824 TREE_PUBLIC (decl) = 1;
5826 if (SUPPORTS_ONE_ONLY)
5828 #ifdef MAKE_DECL_ONE_ONLY
5829 MAKE_DECL_ONE_ONLY (decl);
5831 DECL_COMDAT_GROUP (decl) = comdat_group;
5833 else if (TREE_CODE (decl) == VAR_DECL
5834 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
5835 DECL_COMMON (decl) = 1;
5838 gcc_assert (SUPPORTS_WEAK);
5839 DECL_WEAK (decl) = 1;
5844 init_varasm_once (void)
5846 section_htab = htab_create_ggc (31, section_entry_hash,
5847 section_entry_eq, NULL);
5848 object_block_htab = htab_create_ggc (31, object_block_entry_hash,
5849 object_block_entry_eq, NULL);
5850 const_desc_htab = htab_create_ggc (1009, const_desc_hash,
5851 const_desc_eq, NULL);
5853 const_alias_set = new_alias_set ();
5854 shared_constant_pool = create_constant_pool ();
5856 #ifdef TEXT_SECTION_ASM_OP
5857 text_section = get_unnamed_section (SECTION_CODE, output_section_asm_op,
5858 TEXT_SECTION_ASM_OP);
5861 #ifdef DATA_SECTION_ASM_OP
5862 data_section = get_unnamed_section (SECTION_WRITE, output_section_asm_op,
5863 DATA_SECTION_ASM_OP);
5866 #ifdef SDATA_SECTION_ASM_OP
5867 sdata_section = get_unnamed_section (SECTION_WRITE, output_section_asm_op,
5868 SDATA_SECTION_ASM_OP);
5871 #ifdef READONLY_DATA_SECTION_ASM_OP
5872 readonly_data_section = get_unnamed_section (0, output_section_asm_op,
5873 READONLY_DATA_SECTION_ASM_OP);
5876 #ifdef CTORS_SECTION_ASM_OP
5877 ctors_section = get_unnamed_section (0, output_section_asm_op,
5878 CTORS_SECTION_ASM_OP);
5881 #ifdef DTORS_SECTION_ASM_OP
5882 dtors_section = get_unnamed_section (0, output_section_asm_op,
5883 DTORS_SECTION_ASM_OP);
5886 #ifdef BSS_SECTION_ASM_OP
5887 bss_section = get_unnamed_section (SECTION_WRITE | SECTION_BSS,
5888 output_section_asm_op,
5889 BSS_SECTION_ASM_OP);
5892 #ifdef SBSS_SECTION_ASM_OP
5893 sbss_section = get_unnamed_section (SECTION_WRITE | SECTION_BSS,
5894 output_section_asm_op,
5895 SBSS_SECTION_ASM_OP);
5898 tls_comm_section = get_noswitch_section (SECTION_WRITE | SECTION_BSS
5899 | SECTION_COMMON, emit_tls_common);
5900 lcomm_section = get_noswitch_section (SECTION_WRITE | SECTION_BSS
5901 | SECTION_COMMON, emit_local);
5902 comm_section = get_noswitch_section (SECTION_WRITE | SECTION_BSS
5903 | SECTION_COMMON, emit_common);
5905 #if defined ASM_OUTPUT_ALIGNED_BSS || defined ASM_OUTPUT_BSS
5906 bss_noswitch_section = get_noswitch_section (SECTION_WRITE | SECTION_BSS,
5910 targetm.asm_out.init_sections ();
5912 if (readonly_data_section == NULL)
5913 readonly_data_section = text_section;
5917 decl_default_tls_model (const_tree decl)
5919 enum tls_model kind;
5922 is_local = targetm.binds_local_p (decl);
5926 kind = TLS_MODEL_LOCAL_EXEC;
5928 kind = TLS_MODEL_INITIAL_EXEC;
5931 /* Local dynamic is inefficient when we're not combining the
5932 parts of the address. */
5933 else if (optimize && is_local)
5934 kind = TLS_MODEL_LOCAL_DYNAMIC;
5936 kind = TLS_MODEL_GLOBAL_DYNAMIC;
5937 if (kind < flag_tls_default)
5938 kind = flag_tls_default;
5943 /* Select a set of attributes for section NAME based on the properties
5944 of DECL and whether or not RELOC indicates that DECL's initializer
5945 might contain runtime relocations.
5947 We make the section read-only and executable for a function decl,
5948 read-only for a const data decl, and writable for a non-const data decl. */
5951 default_section_type_flags (tree decl, const char *name, int reloc)
5955 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
5956 flags = SECTION_CODE;
5957 else if (decl && decl_readonly_section (decl, reloc))
5959 else if (current_function_decl
5961 && crtl->subsections.unlikely_text_section_name
5962 && strcmp (name, crtl->subsections.unlikely_text_section_name) == 0)
5963 flags = SECTION_CODE;
5965 && (!current_function_decl || !cfun)
5966 && strcmp (name, UNLIKELY_EXECUTED_TEXT_SECTION_NAME) == 0)
5967 flags = SECTION_CODE;
5969 flags = SECTION_WRITE;
5971 if (decl && DECL_ONE_ONLY (decl))
5972 flags |= SECTION_LINKONCE;
5974 if (decl && TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL_P (decl))
5975 flags |= SECTION_TLS | SECTION_WRITE;
5977 if (strcmp (name, ".bss") == 0
5978 || strncmp (name, ".bss.", 5) == 0
5979 || strncmp (name, ".gnu.linkonce.b.", 16) == 0
5980 || strcmp (name, ".sbss") == 0
5981 || strncmp (name, ".sbss.", 6) == 0
5982 || strncmp (name, ".gnu.linkonce.sb.", 17) == 0)
5983 flags |= SECTION_BSS;
5985 if (strcmp (name, ".tdata") == 0
5986 || strncmp (name, ".tdata.", 7) == 0
5987 || strncmp (name, ".gnu.linkonce.td.", 17) == 0)
5988 flags |= SECTION_TLS;
5990 if (strcmp (name, ".tbss") == 0
5991 || strncmp (name, ".tbss.", 6) == 0
5992 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
5993 flags |= SECTION_TLS | SECTION_BSS;
5995 /* These three sections have special ELF types. They are neither
5996 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
5997 want to print a section type (@progbits or @nobits). If someone
5998 is silly enough to emit code or TLS variables to one of these
5999 sections, then don't handle them specially. */
6000 if (!(flags & (SECTION_CODE | SECTION_BSS | SECTION_TLS))
6001 && (strcmp (name, ".init_array") == 0
6002 || strcmp (name, ".fini_array") == 0
6003 || strcmp (name, ".preinit_array") == 0))
6004 flags |= SECTION_NOTYPE;
6009 /* Return true if the target supports some form of global BSS,
6010 either through bss_noswitch_section, or by selecting a BSS
6011 section in TARGET_ASM_SELECT_SECTION. */
6014 have_global_bss_p (void)
6016 return bss_noswitch_section || targetm.have_switchable_bss_sections;
6019 /* Output assembly to switch to section NAME with attribute FLAGS.
6020 Four variants for common object file formats. */
6023 default_no_named_section (const char *name ATTRIBUTE_UNUSED,
6024 unsigned int flags ATTRIBUTE_UNUSED,
6025 tree decl ATTRIBUTE_UNUSED)
6027 /* Some object formats don't support named sections at all. The
6028 front-end should already have flagged this as an error. */
6033 default_elf_asm_named_section (const char *name, unsigned int flags,
6034 tree decl ATTRIBUTE_UNUSED)
6036 char flagchars[10], *f = flagchars;
6038 /* If we have already declared this section, we can use an
6039 abbreviated form to switch back to it -- unless this section is
6040 part of a COMDAT groups, in which case GAS requires the full
6041 declaration every time. */
6042 if (!(HAVE_COMDAT_GROUP && (flags & SECTION_LINKONCE))
6043 && (flags & SECTION_DECLARED))
6045 fprintf (asm_out_file, "\t.section\t%s\n", name);
6049 if (!(flags & SECTION_DEBUG))
6051 if (flags & SECTION_WRITE)
6053 if (flags & SECTION_CODE)
6055 if (flags & SECTION_SMALL)
6057 if (flags & SECTION_MERGE)
6059 if (flags & SECTION_STRINGS)
6061 if (flags & SECTION_TLS)
6063 if (HAVE_COMDAT_GROUP && (flags & SECTION_LINKONCE))
6067 fprintf (asm_out_file, "\t.section\t%s,\"%s\"", name, flagchars);
6069 if (!(flags & SECTION_NOTYPE))
6074 if (flags & SECTION_BSS)
6080 #ifdef ASM_COMMENT_START
6081 /* On platforms that use "@" as the assembly comment character,
6083 if (strcmp (ASM_COMMENT_START, "@") == 0)
6086 fprintf (asm_out_file, format, type);
6088 if (flags & SECTION_ENTSIZE)
6089 fprintf (asm_out_file, ",%d", flags & SECTION_ENTSIZE);
6090 if (HAVE_COMDAT_GROUP && (flags & SECTION_LINKONCE))
6092 if (TREE_CODE (decl) == IDENTIFIER_NODE)
6093 fprintf (asm_out_file, ",%s,comdat", IDENTIFIER_POINTER (decl));
6095 fprintf (asm_out_file, ",%s,comdat",
6096 IDENTIFIER_POINTER (DECL_COMDAT_GROUP (decl)));
6100 putc ('\n', asm_out_file);
6104 default_coff_asm_named_section (const char *name, unsigned int flags,
6105 tree decl ATTRIBUTE_UNUSED)
6107 char flagchars[8], *f = flagchars;
6109 if (flags & SECTION_WRITE)
6111 if (flags & SECTION_CODE)
6115 fprintf (asm_out_file, "\t.section\t%s,\"%s\"\n", name, flagchars);
6119 default_pe_asm_named_section (const char *name, unsigned int flags,
6122 default_coff_asm_named_section (name, flags, decl);
6124 if (flags & SECTION_LINKONCE)
6126 /* Functions may have been compiled at various levels of
6127 optimization so we can't use `same_size' here.
6128 Instead, have the linker pick one. */
6129 fprintf (asm_out_file, "\t.linkonce %s\n",
6130 (flags & SECTION_CODE ? "discard" : "same_size"));
6134 /* The lame default section selector. */
6137 default_select_section (tree decl, int reloc,
6138 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED)
6142 if (decl_readonly_section (decl, reloc))
6143 return readonly_data_section;
6145 else if (TREE_CODE (decl) == CONSTRUCTOR)
6147 if (! ((flag_pic && reloc)
6148 || !TREE_READONLY (decl)
6149 || TREE_SIDE_EFFECTS (decl)
6150 || !TREE_CONSTANT (decl)))
6151 return readonly_data_section;
6153 else if (TREE_CODE (decl) == STRING_CST)
6154 return readonly_data_section;
6155 else if (! (flag_pic && reloc))
6156 return readonly_data_section;
6158 return data_section;
6161 enum section_category
6162 categorize_decl_for_section (const_tree decl, int reloc)
6164 enum section_category ret;
6166 if (TREE_CODE (decl) == FUNCTION_DECL)
6168 else if (TREE_CODE (decl) == STRING_CST)
6170 if (flag_mudflap) /* or !flag_merge_constants */
6171 return SECCAT_RODATA;
6173 return SECCAT_RODATA_MERGE_STR;
6175 else if (TREE_CODE (decl) == VAR_DECL)
6177 if (bss_initializer_p (decl))
6179 else if (! TREE_READONLY (decl)
6180 || TREE_SIDE_EFFECTS (decl)
6181 || ! TREE_CONSTANT (DECL_INITIAL (decl)))
6183 /* Here the reloc_rw_mask is not testing whether the section should
6184 be read-only or not, but whether the dynamic link will have to
6185 do something. If so, we wish to segregate the data in order to
6186 minimize cache misses inside the dynamic linker. */
6187 if (reloc & targetm.asm_out.reloc_rw_mask ())
6188 ret = reloc == 1 ? SECCAT_DATA_REL_LOCAL : SECCAT_DATA_REL;
6192 else if (reloc & targetm.asm_out.reloc_rw_mask ())
6193 ret = reloc == 1 ? SECCAT_DATA_REL_RO_LOCAL : SECCAT_DATA_REL_RO;
6194 else if (reloc || flag_merge_constants < 2)
6195 /* C and C++ don't allow different variables to share the same
6196 location. -fmerge-all-constants allows even that (at the
6197 expense of not conforming). */
6198 ret = SECCAT_RODATA;
6199 else if (TREE_CODE (DECL_INITIAL (decl)) == STRING_CST)
6200 ret = SECCAT_RODATA_MERGE_STR_INIT;
6202 ret = SECCAT_RODATA_MERGE_CONST;
6204 else if (TREE_CODE (decl) == CONSTRUCTOR)
6206 if ((reloc & targetm.asm_out.reloc_rw_mask ())
6207 || TREE_SIDE_EFFECTS (decl)
6208 || ! TREE_CONSTANT (decl))
6211 ret = SECCAT_RODATA;
6214 ret = SECCAT_RODATA;
6216 /* There are no read-only thread-local sections. */
6217 if (TREE_CODE (decl) == VAR_DECL && DECL_TLS_MODEL (decl))
6219 if (DECL_TLS_MODEL (decl) == TLS_MODEL_EMULATED)
6221 if (DECL_EMUTLS_VAR_P (decl))
6223 if (targetm.emutls.var_section)
6224 ret = SECCAT_EMUTLS_VAR;
6228 if (targetm.emutls.tmpl_prefix)
6229 ret = SECCAT_EMUTLS_TMPL;
6232 /* Note that this would be *just* SECCAT_BSS, except that there's
6233 no concept of a read-only thread-local-data section. */
6234 else if (ret == SECCAT_BSS
6235 || (flag_zero_initialized_in_bss
6236 && initializer_zerop (DECL_INITIAL (decl))))
6242 /* If the target uses small data sections, select it. */
6243 else if (targetm.in_small_data_p (decl))
6245 if (ret == SECCAT_BSS)
6247 else if (targetm.have_srodata_section && ret == SECCAT_RODATA)
6248 ret = SECCAT_SRODATA;
6257 decl_readonly_section (const_tree decl, int reloc)
6259 switch (categorize_decl_for_section (decl, reloc))
6262 case SECCAT_RODATA_MERGE_STR:
6263 case SECCAT_RODATA_MERGE_STR_INIT:
6264 case SECCAT_RODATA_MERGE_CONST:
6265 case SECCAT_SRODATA:
6274 /* Select a section based on the above categorization. */
6277 default_elf_select_section (tree decl, int reloc,
6278 unsigned HOST_WIDE_INT align)
6281 switch (categorize_decl_for_section (decl, reloc))
6284 /* We're not supposed to be called on FUNCTION_DECLs. */
6287 return readonly_data_section;
6288 case SECCAT_RODATA_MERGE_STR:
6289 return mergeable_string_section (decl, align, 0);
6290 case SECCAT_RODATA_MERGE_STR_INIT:
6291 return mergeable_string_section (DECL_INITIAL (decl), align, 0);
6292 case SECCAT_RODATA_MERGE_CONST:
6293 return mergeable_constant_section (DECL_MODE (decl), align, 0);
6294 case SECCAT_SRODATA:
6298 return data_section;
6299 case SECCAT_DATA_REL:
6300 sname = ".data.rel";
6302 case SECCAT_DATA_REL_LOCAL:
6303 sname = ".data.rel.local";
6305 case SECCAT_DATA_REL_RO:
6306 sname = ".data.rel.ro";
6308 case SECCAT_DATA_REL_RO_LOCAL:
6309 sname = ".data.rel.ro.local";
6328 case SECCAT_EMUTLS_VAR:
6329 sname = targetm.emutls.var_section;
6331 case SECCAT_EMUTLS_TMPL:
6332 sname = targetm.emutls.tmpl_section;
6340 return get_named_section (decl, sname, reloc);
6343 /* Construct a unique section name based on the decl name and the
6344 categorization performed above. */
6347 default_unique_section (tree decl, int reloc)
6349 /* We only need to use .gnu.linkonce if we don't have COMDAT groups. */
6350 bool one_only = DECL_ONE_ONLY (decl) && !HAVE_COMDAT_GROUP;
6351 const char *prefix, *name, *linkonce;
6354 switch (categorize_decl_for_section (decl, reloc))
6357 prefix = one_only ? ".t" : ".text";
6360 case SECCAT_RODATA_MERGE_STR:
6361 case SECCAT_RODATA_MERGE_STR_INIT:
6362 case SECCAT_RODATA_MERGE_CONST:
6363 prefix = one_only ? ".r" : ".rodata";
6365 case SECCAT_SRODATA:
6366 prefix = one_only ? ".s2" : ".sdata2";
6369 prefix = one_only ? ".d" : ".data";
6371 case SECCAT_DATA_REL:
6372 prefix = one_only ? ".d.rel" : ".data.rel";
6374 case SECCAT_DATA_REL_LOCAL:
6375 prefix = one_only ? ".d.rel.local" : ".data.rel.local";
6377 case SECCAT_DATA_REL_RO:
6378 prefix = one_only ? ".d.rel.ro" : ".data.rel.ro";
6380 case SECCAT_DATA_REL_RO_LOCAL:
6381 prefix = one_only ? ".d.rel.ro.local" : ".data.rel.ro.local";
6384 prefix = one_only ? ".s" : ".sdata";
6387 prefix = one_only ? ".b" : ".bss";
6390 prefix = one_only ? ".sb" : ".sbss";
6393 prefix = one_only ? ".td" : ".tdata";
6396 prefix = one_only ? ".tb" : ".tbss";
6398 case SECCAT_EMUTLS_VAR:
6399 prefix = targetm.emutls.var_section;
6401 case SECCAT_EMUTLS_TMPL:
6402 prefix = targetm.emutls.tmpl_section;
6408 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
6409 name = targetm.strip_name_encoding (name);
6411 /* If we're using one_only, then there needs to be a .gnu.linkonce
6412 prefix to the section name. */
6413 linkonce = one_only ? ".gnu.linkonce" : "";
6415 string = ACONCAT ((linkonce, prefix, ".", name, NULL));
6417 DECL_SECTION_NAME (decl) = build_string (strlen (string), string);
6420 /* Like compute_reloc_for_constant, except for an RTX. The return value
6421 is a mask for which bit 1 indicates a global relocation, and bit 0
6422 indicates a local relocation. */
6425 compute_reloc_for_rtx_1 (rtx *xp, void *data)
6427 int *preloc = (int *) data;
6430 switch (GET_CODE (x))
6433 *preloc |= SYMBOL_REF_LOCAL_P (x) ? 1 : 2;
6446 compute_reloc_for_rtx (rtx x)
6450 switch (GET_CODE (x))
6456 for_each_rtx (&x, compute_reloc_for_rtx_1, &reloc);
6465 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED,
6467 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED)
6469 if (compute_reloc_for_rtx (x) & targetm.asm_out.reloc_rw_mask ())
6470 return data_section;
6472 return readonly_data_section;
6476 default_elf_select_rtx_section (enum machine_mode mode, rtx x,
6477 unsigned HOST_WIDE_INT align)
6479 int reloc = compute_reloc_for_rtx (x);
6481 /* ??? Handle small data here somehow. */
6483 if (reloc & targetm.asm_out.reloc_rw_mask ())
6486 return get_named_section (NULL, ".data.rel.ro.local", 1);
6488 return get_named_section (NULL, ".data.rel.ro", 3);
6491 return mergeable_constant_section (mode, align, 0);
6494 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
6497 default_encode_section_info (tree decl, rtx rtl, int first ATTRIBUTE_UNUSED)
6502 /* Careful not to prod global register variables. */
6505 symbol = XEXP (rtl, 0);
6506 if (GET_CODE (symbol) != SYMBOL_REF)
6509 flags = SYMBOL_REF_FLAGS (symbol) & SYMBOL_FLAG_HAS_BLOCK_INFO;
6510 if (TREE_CODE (decl) == FUNCTION_DECL)
6511 flags |= SYMBOL_FLAG_FUNCTION;
6512 if (targetm.binds_local_p (decl))
6513 flags |= SYMBOL_FLAG_LOCAL;
6514 if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL_P (decl)
6515 && DECL_TLS_MODEL (decl) != TLS_MODEL_EMULATED)
6516 flags |= DECL_TLS_MODEL (decl) << SYMBOL_FLAG_TLS_SHIFT;
6517 else if (targetm.in_small_data_p (decl))
6518 flags |= SYMBOL_FLAG_SMALL;
6519 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
6520 being PUBLIC, the thing *must* be defined in this translation unit.
6521 Prevent this buglet from being propagated into rtl code as well. */
6522 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
6523 flags |= SYMBOL_FLAG_EXTERNAL;
6525 SYMBOL_REF_FLAGS (symbol) = flags;
6528 /* By default, we do nothing for encode_section_info, so we need not
6529 do anything but discard the '*' marker. */
6532 default_strip_name_encoding (const char *str)
6534 return str + (*str == '*');
6537 #ifdef ASM_OUTPUT_DEF
6538 /* The default implementation of TARGET_ASM_OUTPUT_ANCHOR. Define the
6539 anchor relative to ".", the current section position. */
6542 default_asm_output_anchor (rtx symbol)
6546 sprintf (buffer, "*. + " HOST_WIDE_INT_PRINT_DEC,
6547 SYMBOL_REF_BLOCK_OFFSET (symbol));
6548 ASM_OUTPUT_DEF (asm_out_file, XSTR (symbol, 0), buffer);
6552 /* The default implementation of TARGET_USE_ANCHORS_FOR_SYMBOL_P. */
6555 default_use_anchors_for_symbol_p (const_rtx symbol)
6560 /* Don't use anchors for mergeable sections. The linker might move
6561 the objects around. */
6562 sect = SYMBOL_REF_BLOCK (symbol)->sect;
6563 if (sect->common.flags & SECTION_MERGE)
6566 /* Don't use anchors for small data sections. The small data register
6567 acts as an anchor for such sections. */
6568 if (sect->common.flags & SECTION_SMALL)
6571 decl = SYMBOL_REF_DECL (symbol);
6572 if (decl && DECL_P (decl))
6574 /* Don't use section anchors for decls that might be defined by
6576 if (!targetm.binds_local_p (decl))
6579 /* Don't use section anchors for decls that will be placed in a
6580 small data section. */
6581 /* ??? Ideally, this check would be redundant with the SECTION_SMALL
6582 one above. The problem is that we only use SECTION_SMALL for
6583 sections that should be marked as small in the section directive. */
6584 if (targetm.in_small_data_p (decl))
6590 /* Assume ELF-ish defaults, since that's pretty much the most liberal
6591 wrt cross-module name binding. */
6594 default_binds_local_p (const_tree exp)
6596 return default_binds_local_p_1 (exp, flag_shlib);
6600 default_binds_local_p_1 (const_tree exp, int shlib)
6604 /* A non-decl is an entry in the constant pool. */
6607 /* Weakrefs may not bind locally, even though the weakref itself is
6608 always static and therefore local. */
6609 else if (lookup_attribute ("weakref", DECL_ATTRIBUTES (exp)))
6611 /* Static variables are always local. */
6612 else if (! TREE_PUBLIC (exp))
6614 /* A variable is local if the user has said explicitly that it will
6616 else if (DECL_VISIBILITY_SPECIFIED (exp)
6617 && DECL_VISIBILITY (exp) != VISIBILITY_DEFAULT)
6619 /* Variables defined outside this object might not be local. */
6620 else if (DECL_EXTERNAL (exp))
6622 /* If defined in this object and visibility is not default, must be
6624 else if (DECL_VISIBILITY (exp) != VISIBILITY_DEFAULT)
6626 /* Default visibility weak data can be overridden by a strong symbol
6627 in another module and so are not local. */
6628 else if (DECL_WEAK (exp))
6630 /* If PIC, then assume that any global name can be overridden by
6631 symbols resolved from other modules, unless we are compiling with
6632 -fwhole-program, which assumes that names are local. */
6634 local_p = flag_whole_program;
6635 /* Uninitialized COMMON variable may be unified with symbols
6636 resolved from other modules. */
6637 else if (DECL_COMMON (exp)
6638 && (DECL_INITIAL (exp) == NULL
6639 || DECL_INITIAL (exp) == error_mark_node))
6641 /* Otherwise we're left with initialized (or non-common) global data
6642 which is of necessity defined locally. */
6649 /* Default function to output code that will globalize a label. A
6650 target must define GLOBAL_ASM_OP or provide its own function to
6651 globalize a label. */
6652 #ifdef GLOBAL_ASM_OP
6654 default_globalize_label (FILE * stream, const char *name)
6656 fputs (GLOBAL_ASM_OP, stream);
6657 assemble_name (stream, name);
6658 putc ('\n', stream);
6660 #endif /* GLOBAL_ASM_OP */
6662 /* Default function to output code that will globalize a declaration. */
6664 default_globalize_decl_name (FILE * stream, tree decl)
6666 const char *name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
6667 targetm.asm_out.globalize_label (stream, name);
6670 /* Default function to output a label for unwind information. The
6671 default is to do nothing. A target that needs nonlocal labels for
6672 unwind information must provide its own function to do this. */
6674 default_emit_unwind_label (FILE * stream ATTRIBUTE_UNUSED,
6675 tree decl ATTRIBUTE_UNUSED,
6676 int for_eh ATTRIBUTE_UNUSED,
6677 int empty ATTRIBUTE_UNUSED)
6681 /* Default function to output a label to divide up the exception table.
6682 The default is to do nothing. A target that needs/wants to divide
6683 up the table must provide it's own function to do this. */
6685 default_emit_except_table_label (FILE * stream ATTRIBUTE_UNUSED)
6689 /* This is how to output an internal numbered label where PREFIX is
6690 the class of label and LABELNO is the number within the class. */
6693 default_internal_label (FILE *stream, const char *prefix,
6694 unsigned long labelno)
6696 char *const buf = (char *) alloca (40 + strlen (prefix));
6697 ASM_GENERATE_INTERNAL_LABEL (buf, prefix, labelno);
6698 ASM_OUTPUT_INTERNAL_LABEL (stream, buf);
6701 /* This is the default behavior at the beginning of a file. It's
6702 controlled by two other target-hook toggles. */
6704 default_file_start (void)
6706 if (targetm.file_start_app_off
6707 && !(flag_verbose_asm || flag_debug_asm || flag_dump_rtl_in_asm))
6708 fputs (ASM_APP_OFF, asm_out_file);
6710 if (targetm.file_start_file_directive)
6711 output_file_directive (asm_out_file, main_input_filename);
6714 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
6715 which emits a special section directive used to indicate whether or
6716 not this object file needs an executable stack. This is primarily
6717 a GNU extension to ELF but could be used on other targets. */
6719 int trampolines_created;
6722 file_end_indicate_exec_stack (void)
6724 unsigned int flags = SECTION_DEBUG;
6725 if (trampolines_created)
6726 flags |= SECTION_CODE;
6728 switch_to_section (get_section (".note.GNU-stack", flags, NULL));
6731 /* Output DIRECTIVE (a C string) followed by a newline. This is used as
6732 a get_unnamed_section callback. */
6735 output_section_asm_op (const void *directive)
6737 fprintf (asm_out_file, "%s\n", (const char *) directive);
6740 /* Emit assembly code to switch to section NEW_SECTION. Do nothing if
6741 the current section is NEW_SECTION. */
6744 switch_to_section (section *new_section)
6746 if (in_section == new_section)
6749 if (new_section->common.flags & SECTION_FORGET)
6752 in_section = new_section;
6754 switch (SECTION_STYLE (new_section))
6758 && !crtl->subsections.unlikely_text_section_name
6759 && strcmp (new_section->named.name,
6760 UNLIKELY_EXECUTED_TEXT_SECTION_NAME) == 0)
6761 crtl->subsections.unlikely_text_section_name = UNLIKELY_EXECUTED_TEXT_SECTION_NAME;
6763 targetm.asm_out.named_section (new_section->named.name,
6764 new_section->named.common.flags,
6765 new_section->named.decl);
6768 case SECTION_UNNAMED:
6769 new_section->unnamed.callback (new_section->unnamed.data);
6772 case SECTION_NOSWITCH:
6777 new_section->common.flags |= SECTION_DECLARED;
6780 /* If block symbol SYMBOL has not yet been assigned an offset, place
6781 it at the end of its block. */
6784 place_block_symbol (rtx symbol)
6786 unsigned HOST_WIDE_INT size, mask, offset;
6787 struct constant_descriptor_rtx *desc;
6788 unsigned int alignment;
6789 struct object_block *block;
6792 gcc_assert (SYMBOL_REF_BLOCK (symbol));
6793 if (SYMBOL_REF_BLOCK_OFFSET (symbol) >= 0)
6796 /* Work out the symbol's size and alignment. */
6797 if (CONSTANT_POOL_ADDRESS_P (symbol))
6799 desc = SYMBOL_REF_CONSTANT (symbol);
6800 alignment = desc->align;
6801 size = GET_MODE_SIZE (desc->mode);
6803 else if (TREE_CONSTANT_POOL_ADDRESS_P (symbol))
6805 decl = SYMBOL_REF_DECL (symbol);
6806 alignment = get_constant_alignment (decl);
6807 size = get_constant_size (decl);
6811 decl = SYMBOL_REF_DECL (symbol);
6812 alignment = DECL_ALIGN (decl);
6813 size = tree_low_cst (DECL_SIZE_UNIT (decl), 1);
6816 /* Calculate the object's offset from the start of the block. */
6817 block = SYMBOL_REF_BLOCK (symbol);
6818 mask = alignment / BITS_PER_UNIT - 1;
6819 offset = (block->size + mask) & ~mask;
6820 SYMBOL_REF_BLOCK_OFFSET (symbol) = offset;
6822 /* Record the block's new alignment and size. */
6823 block->alignment = MAX (block->alignment, alignment);
6824 block->size = offset + size;
6826 VEC_safe_push (rtx, gc, block->objects, symbol);
6829 /* Return the anchor that should be used to address byte offset OFFSET
6830 from the first object in BLOCK. MODEL is the TLS model used
6834 get_section_anchor (struct object_block *block, HOST_WIDE_INT offset,
6835 enum tls_model model)
6838 unsigned int begin, middle, end;
6839 unsigned HOST_WIDE_INT min_offset, max_offset, range, bias, delta;
6842 /* Work out the anchor's offset. Use an offset of 0 for the first
6843 anchor so that we don't pessimize the case where we take the address
6844 of a variable at the beginning of the block. This is particularly
6845 useful when a block has only one variable assigned to it.
6847 We try to place anchors RANGE bytes apart, so there can then be
6848 anchors at +/-RANGE, +/-2 * RANGE, and so on, up to the limits of
6849 a ptr_mode offset. With some target settings, the lowest such
6850 anchor might be out of range for the lowest ptr_mode offset;
6851 likewise the highest anchor for the highest offset. Use anchors
6852 at the extreme ends of the ptr_mode range in such cases.
6854 All arithmetic uses unsigned integers in order to avoid
6856 max_offset = (unsigned HOST_WIDE_INT) targetm.max_anchor_offset;
6857 min_offset = (unsigned HOST_WIDE_INT) targetm.min_anchor_offset;
6858 range = max_offset - min_offset + 1;
6863 bias = 1 << (GET_MODE_BITSIZE (ptr_mode) - 1);
6866 delta = -(unsigned HOST_WIDE_INT) offset + max_offset;
6867 delta -= delta % range;
6870 offset = (HOST_WIDE_INT) (-delta);
6874 delta = (unsigned HOST_WIDE_INT) offset - min_offset;
6875 delta -= delta % range;
6876 if (delta > bias - 1)
6878 offset = (HOST_WIDE_INT) delta;
6882 /* Do a binary search to see if there's already an anchor we can use.
6883 Set BEGIN to the new anchor's index if not. */
6885 end = VEC_length (rtx, block->anchors);
6886 while (begin != end)
6888 middle = (end + begin) / 2;
6889 anchor = VEC_index (rtx, block->anchors, middle);
6890 if (SYMBOL_REF_BLOCK_OFFSET (anchor) > offset)
6892 else if (SYMBOL_REF_BLOCK_OFFSET (anchor) < offset)
6894 else if (SYMBOL_REF_TLS_MODEL (anchor) > model)
6896 else if (SYMBOL_REF_TLS_MODEL (anchor) < model)
6902 /* Create a new anchor with a unique label. */
6903 ASM_GENERATE_INTERNAL_LABEL (label, "LANCHOR", anchor_labelno++);
6904 anchor = create_block_symbol (ggc_strdup (label), block, offset);
6905 SYMBOL_REF_FLAGS (anchor) |= SYMBOL_FLAG_LOCAL | SYMBOL_FLAG_ANCHOR;
6906 SYMBOL_REF_FLAGS (anchor) |= model << SYMBOL_FLAG_TLS_SHIFT;
6908 /* Insert it at index BEGIN. */
6909 VEC_safe_insert (rtx, gc, block->anchors, begin, anchor);
6913 /* Output the objects in BLOCK. */
6916 output_object_block (struct object_block *block)
6918 struct constant_descriptor_rtx *desc;
6920 HOST_WIDE_INT offset;
6924 if (block->objects == NULL)
6927 /* Switch to the section and make sure that the first byte is
6928 suitably aligned. */
6929 switch_to_section (block->sect);
6930 assemble_align (block->alignment);
6932 /* Define the values of all anchors relative to the current section
6934 for (i = 0; VEC_iterate (rtx, block->anchors, i, symbol); i++)
6935 targetm.asm_out.output_anchor (symbol);
6937 /* Output the objects themselves. */
6939 for (i = 0; VEC_iterate (rtx, block->objects, i, symbol); i++)
6941 /* Move to the object's offset, padding with zeros if necessary. */
6942 assemble_zeros (SYMBOL_REF_BLOCK_OFFSET (symbol) - offset);
6943 offset = SYMBOL_REF_BLOCK_OFFSET (symbol);
6944 if (CONSTANT_POOL_ADDRESS_P (symbol))
6946 desc = SYMBOL_REF_CONSTANT (symbol);
6947 output_constant_pool_1 (desc, 1);
6948 offset += GET_MODE_SIZE (desc->mode);
6950 else if (TREE_CONSTANT_POOL_ADDRESS_P (symbol))
6952 decl = SYMBOL_REF_DECL (symbol);
6953 assemble_constant_contents (decl, XSTR (symbol, 0),
6954 get_constant_alignment (decl));
6955 offset += get_constant_size (decl);
6959 decl = SYMBOL_REF_DECL (symbol);
6960 assemble_variable_contents (decl, XSTR (symbol, 0), false);
6961 offset += tree_low_cst (DECL_SIZE_UNIT (decl), 1);
6966 /* A htab_traverse callback used to call output_object_block for
6967 each member of object_block_htab. */
6970 output_object_block_htab (void **slot, void *data ATTRIBUTE_UNUSED)
6972 output_object_block ((struct object_block *) (*slot));
6976 /* Output the definitions of all object_blocks. */
6979 output_object_blocks (void)
6981 htab_traverse (object_block_htab, output_object_block_htab, NULL);
6984 /* This function provides a possible implementation of the
6985 TARGET_ASM_RECORD_GCC_SWITCHES target hook for ELF targets. When triggered
6986 by -frecord-gcc-switches it creates a new mergeable, string section in the
6987 assembler output file called TARGET_ASM_RECORD_GCC_SWITCHES_SECTION which
6988 contains the switches in ASCII format.
6990 FIXME: This code does not correctly handle double quote characters
6991 that appear inside strings, (it strips them rather than preserving them).
6992 FIXME: ASM_OUTPUT_ASCII, as defined in config/elfos.h will not emit NUL
6993 characters - instead it treats them as sub-string separators. Since
6994 we want to emit NUL strings terminators into the object file we have to use
6998 elf_record_gcc_switches (print_switch_type type, const char * name)
7000 static char buffer[1024];
7002 /* This variable is used as part of a simplistic heuristic to detect
7003 command line switches which take an argument:
7005 "If a command line option does not start with a dash then
7006 it is an argument for the previous command line option."
7008 This fails in the case of the command line option which is the name
7009 of the file to compile, but otherwise it is pretty reasonable. */
7010 static bool previous_name_held_back = FALSE;
7014 case SWITCH_TYPE_PASSED:
7017 if (previous_name_held_back)
7019 unsigned int len = strlen (buffer);
7021 snprintf (buffer + len, sizeof buffer - len, " %s", name);
7022 ASM_OUTPUT_ASCII (asm_out_file, buffer, strlen (buffer));
7023 ASM_OUTPUT_SKIP (asm_out_file, (unsigned HOST_WIDE_INT) 1);
7024 previous_name_held_back = FALSE;
7028 strncpy (buffer, name, sizeof buffer);
7029 ASM_OUTPUT_ASCII (asm_out_file, buffer, strlen (buffer));
7030 ASM_OUTPUT_SKIP (asm_out_file, (unsigned HOST_WIDE_INT) 1);
7035 if (previous_name_held_back)
7037 ASM_OUTPUT_ASCII (asm_out_file, buffer, strlen (buffer));
7038 ASM_OUTPUT_SKIP (asm_out_file, (unsigned HOST_WIDE_INT) 1);
7041 strncpy (buffer, name, sizeof buffer);
7042 previous_name_held_back = TRUE;
7046 case SWITCH_TYPE_DESCRIPTIVE:
7049 /* Distinguish between invocations where name is NULL. */
7050 static bool started = false;
7054 if (previous_name_held_back)
7056 ASM_OUTPUT_ASCII (asm_out_file, buffer, strlen (buffer));
7057 ASM_OUTPUT_SKIP (asm_out_file, (unsigned HOST_WIDE_INT) 1);
7064 sec = get_section (targetm.asm_out.record_gcc_switches_section,
7068 | (SECTION_ENTSIZE & 1),
7070 switch_to_section (sec);
7079 /* The return value is currently ignored by the caller, but must be 0.
7080 For -fverbose-asm the return value would be the number of characters
7081 emitted into the assembler file. */
7085 /* Emit text to declare externally defined symbols. It is needed to
7086 properly support non-default visibility. */
7088 default_elf_asm_output_external (FILE *file ATTRIBUTE_UNUSED,
7090 const char *name ATTRIBUTE_UNUSED)
7092 /* We output the name if and only if TREE_SYMBOL_REFERENCED is
7093 set in order to avoid putting out names that are never really
7095 if (TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))
7096 && targetm.binds_local_p (decl))
7097 maybe_assemble_visibility (decl);
7100 #include "gt-varasm.h"