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 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
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. */
37 #include "hard-reg-set.h"
46 #include "langhooks.h"
51 #ifdef XCOFF_DEBUGGING_INFO
52 #include "xcoffout.h" /* Needed for external data
53 declarations for e.g. AIX 4.x. */
56 #ifndef TRAMPOLINE_ALIGNMENT
57 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
61 #define ASM_STABS_OP "\t.stabs\t"
64 /* The (assembler) name of the first globally-visible object output. */
65 const char *first_global_object_name;
66 const char *weak_global_object_name;
69 struct constant_descriptor_rtx;
73 #define MAX_RTX_HASH_TABLE 61
75 struct varasm_status GTY(())
77 /* Hash facility for making memory-constants
78 from constant rtl-expressions. It is used on RISC machines
79 where immediate integer arguments and constant addresses are restricted
80 so that such constants must be stored in memory.
82 This pool of constants is reinitialized for each function
83 so each function gets its own constants-pool that comes right before
85 struct constant_descriptor_rtx ** GTY ((length ("MAX_RTX_HASH_TABLE")))
86 x_const_rtx_hash_table;
87 struct pool_constant ** GTY ((length ("MAX_RTX_HASH_TABLE")))
88 x_const_rtx_sym_hash_table;
90 /* Pointers to first and last constant in pool. */
91 struct pool_constant *x_first_pool;
92 struct pool_constant *x_last_pool;
94 /* Current offset in constant pool (does not include any machine-specific
96 HOST_WIDE_INT x_pool_offset;
99 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
100 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
101 #define first_pool (cfun->varasm->x_first_pool)
102 #define last_pool (cfun->varasm->x_last_pool)
103 #define pool_offset (cfun->varasm->x_pool_offset)
105 /* Number for making the label on the next
106 constant that is stored in memory. */
110 /* Number for making the label on the next
111 static variable internal to a function. */
115 /* Carry information from ASM_DECLARE_OBJECT_NAME
116 to ASM_FINISH_DECLARE_OBJECT. */
118 int size_directive_output;
120 /* The last decl for which assemble_variable was called,
121 if it did ASM_DECLARE_OBJECT_NAME.
122 If the last call to assemble_variable didn't do that,
125 tree last_assemble_variable_decl;
127 /* RTX_UNCHANGING_P in a MEM can mean it is stored into, for initialization.
128 So giving constant the alias set for the type will allow such
129 initializations to appear to conflict with the load of the constant. We
130 avoid this by giving all constants an alias set for just constants.
131 Since there will be no stores to that alias set, nothing will ever
132 conflict with them. */
134 static HOST_WIDE_INT const_alias_set;
136 static const char *strip_reg_name PARAMS ((const char *));
137 static int contains_pointers_p PARAMS ((tree));
138 static void decode_addr_const PARAMS ((tree, struct addr_const *));
139 static unsigned int const_hash PARAMS ((tree));
140 static unsigned int const_hash_1 PARAMS ((tree));
141 static int compare_constant PARAMS ((tree, tree));
142 static tree copy_constant PARAMS ((tree));
143 static void output_constant_def_contents PARAMS ((tree, int, int));
144 static void decode_rtx_const PARAMS ((enum machine_mode, rtx,
145 struct rtx_const *));
146 static unsigned int const_hash_rtx PARAMS ((enum machine_mode, rtx));
147 static int compare_constant_rtx
148 PARAMS ((enum machine_mode, rtx, struct constant_descriptor_rtx *));
149 static struct constant_descriptor_rtx * record_constant_rtx
150 PARAMS ((enum machine_mode, rtx));
151 static struct pool_constant *find_pool_constant PARAMS ((struct function *, rtx));
152 static void mark_constant_pool PARAMS ((void));
153 static void mark_constants PARAMS ((rtx));
154 static int mark_constant PARAMS ((rtx *current_rtx, void *data));
155 static int output_addressed_constants PARAMS ((tree));
156 static void output_after_function_constants PARAMS ((void));
157 static unsigned HOST_WIDE_INT array_size_for_constructor PARAMS ((tree));
158 static unsigned min_align PARAMS ((unsigned, unsigned));
159 static void output_constructor PARAMS ((tree, HOST_WIDE_INT,
161 static void globalize_decl PARAMS ((tree));
162 static void maybe_assemble_visibility PARAMS ((tree));
163 static int in_named_entry_eq PARAMS ((const PTR, const PTR));
164 static hashval_t in_named_entry_hash PARAMS ((const PTR));
165 #ifdef ASM_OUTPUT_BSS
166 static void asm_output_bss PARAMS ((FILE *, tree, const char *, int, int));
168 #ifdef BSS_SECTION_ASM_OP
169 #ifdef ASM_OUTPUT_ALIGNED_BSS
170 static void asm_output_aligned_bss PARAMS ((FILE *, tree, const char *,
173 #endif /* BSS_SECTION_ASM_OP */
174 static hashval_t const_str_htab_hash PARAMS ((const void *x));
175 static int const_str_htab_eq PARAMS ((const void *x, const void *y));
176 static bool asm_emit_uninitialised PARAMS ((tree, const char*, int, int));
177 static void resolve_unique_section PARAMS ((tree, int, int));
178 static void mark_weak PARAMS ((tree));
180 static enum in_section { no_section, in_text, in_data, in_named
181 #ifdef BSS_SECTION_ASM_OP
184 #ifdef CTORS_SECTION_ASM_OP
187 #ifdef DTORS_SECTION_ASM_OP
190 #ifdef READONLY_DATA_SECTION_ASM_OP
193 #ifdef EXTRA_SECTIONS
196 } in_section = no_section;
198 /* Return a nonzero value if DECL has a section attribute. */
199 #ifndef IN_NAMED_SECTION
200 #define IN_NAMED_SECTION(DECL) \
201 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
202 && DECL_SECTION_NAME (DECL) != NULL_TREE)
205 /* Text of section name when in_section == in_named. */
206 static const char *in_named_name;
208 /* Hash table of flags that have been used for a particular named section. */
210 struct in_named_entry
217 static htab_t in_named_htab;
219 /* Define functions like text_section for any extra sections. */
220 #ifdef EXTRA_SECTION_FUNCTIONS
221 EXTRA_SECTION_FUNCTIONS
224 /* Tell assembler to switch to text section. */
229 if (in_section != in_text)
231 in_section = in_text;
235 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
240 /* Tell assembler to switch to data section. */
245 if (in_section != in_data)
247 in_section = in_data;
248 if (flag_shared_data)
250 #ifdef SHARED_SECTION_ASM_OP
251 fprintf (asm_out_file, "%s\n", SHARED_SECTION_ASM_OP);
253 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
257 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
261 /* Tell assembler to ALWAYS switch to data section, in case
262 it's not sure where it is. */
265 force_data_section ()
267 in_section = no_section;
271 /* Tell assembler to switch to read-only data section. This is normally
275 readonly_data_section ()
277 #ifdef READONLY_DATA_SECTION
278 READONLY_DATA_SECTION (); /* Note this can call data_section. */
280 #ifdef READONLY_DATA_SECTION_ASM_OP
281 if (in_section != in_readonly_data)
283 in_section = in_readonly_data;
284 fputs (READONLY_DATA_SECTION_ASM_OP, asm_out_file);
285 fputc ('\n', asm_out_file);
293 /* Determine if we're in the text section. */
298 return in_section == in_text;
301 /* Determine if we're in the data section. */
306 return in_section == in_data;
309 /* Helper routines for maintaining in_named_htab. */
312 in_named_entry_eq (p1, p2)
316 const struct in_named_entry *old = p1;
317 const char *new = p2;
319 return strcmp (old->name, new) == 0;
323 in_named_entry_hash (p)
326 const struct in_named_entry *old = p;
327 return htab_hash_string (old->name);
330 /* If SECTION has been seen before as a named section, return the flags
331 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
332 set of flags for a section to have, so 0 does not mean that the section
333 has not been seen. */
336 get_named_section_flags (section)
339 struct in_named_entry **slot;
341 slot = (struct in_named_entry **)
342 htab_find_slot_with_hash (in_named_htab, section,
343 htab_hash_string (section), NO_INSERT);
345 return slot ? (*slot)->flags : 0;
348 /* Returns true if the section has been declared before. Sets internal
349 flag on this section in in_named_hash so subsequent calls on this
350 section will return false. */
353 named_section_first_declaration (name)
356 struct in_named_entry **slot;
358 slot = (struct in_named_entry **)
359 htab_find_slot_with_hash (in_named_htab, name,
360 htab_hash_string (name), NO_INSERT);
361 if (! (*slot)->declared)
363 (*slot)->declared = true;
373 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
374 different set of flags, return false. */
377 set_named_section_flags (section, flags)
381 struct in_named_entry **slot, *entry;
383 slot = (struct in_named_entry **)
384 htab_find_slot_with_hash (in_named_htab, section,
385 htab_hash_string (section), INSERT);
390 entry = (struct in_named_entry *) xmalloc (sizeof (*entry));
392 entry->name = ggc_strdup (section);
393 entry->flags = flags;
394 entry->declared = false;
396 else if (entry->flags != flags)
402 /* Tell assembler to change to section NAME with attributes FLAGS. */
405 named_section_flags (name, flags)
409 if (in_section != in_named || strcmp (name, in_named_name) != 0)
411 if (! set_named_section_flags (name, flags))
414 (*targetm.asm_out.named_section) (name, flags);
416 if (flags & SECTION_FORGET)
417 in_section = no_section;
420 in_named_name = ggc_strdup (name);
421 in_section = in_named;
426 /* Tell assembler to change to section NAME for DECL.
427 If DECL is NULL, just switch to section NAME.
428 If NAME is NULL, get the name from DECL.
429 If RELOC is 1, the initializer for DECL contains relocs. */
432 named_section (decl, name, reloc)
439 if (decl != NULL_TREE && !DECL_P (decl))
442 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
444 flags = (* targetm.section_type_flags) (decl, name, reloc);
446 /* Sanity check user variables for flag changes. Non-user
447 section flag changes will abort in named_section_flags.
448 However, don't complain if SECTION_OVERRIDE is set.
449 We trust that the setter knows that it is safe to ignore
450 the default flags for this decl. */
451 if (decl && ! set_named_section_flags (name, flags))
453 flags = get_named_section_flags (name);
454 if ((flags & SECTION_OVERRIDE) == 0)
455 error_with_decl (decl, "%s causes a section type conflict");
458 named_section_flags (name, flags);
461 /* If required, set DECL_SECTION_NAME to a unique name. */
464 resolve_unique_section (decl, reloc, flag_function_or_data_sections)
466 int reloc ATTRIBUTE_UNUSED;
467 int flag_function_or_data_sections;
469 if (DECL_SECTION_NAME (decl) == NULL_TREE
470 && targetm.have_named_sections
471 && (flag_function_or_data_sections
472 || DECL_ONE_ONLY (decl)))
473 (*targetm.asm_out.unique_section) (decl, reloc);
476 #ifdef BSS_SECTION_ASM_OP
478 /* Tell the assembler to switch to the bss section. */
483 if (in_section != in_bss)
485 #ifdef SHARED_BSS_SECTION_ASM_OP
486 if (flag_shared_data)
487 fprintf (asm_out_file, "%s\n", SHARED_BSS_SECTION_ASM_OP);
490 fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP);
496 #ifdef ASM_OUTPUT_BSS
498 /* Utility function for ASM_OUTPUT_BSS for targets to use if
499 they don't support alignments in .bss.
500 ??? It is believed that this function will work in most cases so such
501 support is localized here. */
504 asm_output_bss (file, decl, name, size, rounded)
506 tree decl ATTRIBUTE_UNUSED;
508 int size ATTRIBUTE_UNUSED, rounded;
510 (*targetm.asm_out.globalize_label) (file, name);
512 #ifdef ASM_DECLARE_OBJECT_NAME
513 last_assemble_variable_decl = decl;
514 ASM_DECLARE_OBJECT_NAME (file, name, decl);
516 /* Standard thing is just output label for the object. */
517 ASM_OUTPUT_LABEL (file, name);
518 #endif /* ASM_DECLARE_OBJECT_NAME */
519 ASM_OUTPUT_SKIP (file, rounded ? rounded : 1);
524 #ifdef ASM_OUTPUT_ALIGNED_BSS
526 /* Utility function for targets to use in implementing
527 ASM_OUTPUT_ALIGNED_BSS.
528 ??? It is believed that this function will work in most cases so such
529 support is localized here. */
532 asm_output_aligned_bss (file, decl, name, size, align)
534 tree decl ATTRIBUTE_UNUSED;
539 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
540 #ifdef ASM_DECLARE_OBJECT_NAME
541 last_assemble_variable_decl = decl;
542 ASM_DECLARE_OBJECT_NAME (file, name, decl);
544 /* Standard thing is just output label for the object. */
545 ASM_OUTPUT_LABEL (file, name);
546 #endif /* ASM_DECLARE_OBJECT_NAME */
547 ASM_OUTPUT_SKIP (file, size ? size : 1);
552 #endif /* BSS_SECTION_ASM_OP */
554 /* Switch to the section for function DECL.
556 If DECL is NULL_TREE, switch to the text section.
557 ??? It's not clear that we will ever be passed NULL_TREE, but it's
558 safer to handle it. */
561 function_section (decl)
564 if (decl != NULL_TREE
565 && DECL_SECTION_NAME (decl) != NULL_TREE)
566 named_section (decl, (char *) 0, 0);
571 /* Switch to section for variable DECL. RELOC is the same as the
572 argument to SELECT_SECTION. */
575 variable_section (decl, reloc)
579 if (IN_NAMED_SECTION (decl))
580 named_section (decl, NULL, reloc);
582 (*targetm.asm_out.select_section) (decl, reloc, DECL_ALIGN (decl));
585 /* Tell assembler to switch to the section for string merging. */
588 mergeable_string_section (decl, align, flags)
589 tree decl ATTRIBUTE_UNUSED;
590 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED;
591 unsigned int flags ATTRIBUTE_UNUSED;
593 #ifdef HAVE_GAS_SHF_MERGE
594 if (flag_merge_constants
595 && TREE_CODE (decl) == STRING_CST
596 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
598 && TREE_STRING_LENGTH (decl) >= int_size_in_bytes (TREE_TYPE (decl)))
600 enum machine_mode mode;
601 unsigned int modesize;
606 mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (decl)));
607 modesize = GET_MODE_BITSIZE (mode);
608 if (modesize >= 8 && modesize <= 256
609 && (modesize & (modesize - 1)) == 0)
611 if (align < modesize)
614 str = TREE_STRING_POINTER (decl);
615 len = TREE_STRING_LENGTH (decl);
616 unit = GET_MODE_SIZE (mode);
618 /* Check for embedded NUL characters. */
619 for (i = 0; i < len; i += unit)
621 for (j = 0; j < unit; j++)
622 if (str[i + j] != '\0')
629 sprintf (name, ".rodata.str%d.%d", modesize / 8,
631 flags |= (modesize / 8) | SECTION_MERGE | SECTION_STRINGS;
632 if (!i && modesize < align)
634 /* A "" string with requested alignment greater than
635 character size might cause a problem:
636 if some other string required even bigger
637 alignment than "", then linker might think the
638 "" is just part of padding after some other string
639 and not put it into the hash table initially.
640 But this means "" could have smaller alignment
642 #ifdef ASM_OUTPUT_SECTION_START
643 named_section_flags (name, flags);
644 ASM_OUTPUT_SECTION_START (asm_out_file);
646 readonly_data_section ();
651 named_section_flags (name, flags);
657 readonly_data_section ();
660 /* Tell assembler to switch to the section for constant merging. */
663 mergeable_constant_section (mode, align, flags)
664 enum machine_mode mode ATTRIBUTE_UNUSED;
665 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED;
666 unsigned int flags ATTRIBUTE_UNUSED;
668 #ifdef HAVE_GAS_SHF_MERGE
669 unsigned int modesize = GET_MODE_BITSIZE (mode);
671 if (flag_merge_constants
677 && (align & (align - 1)) == 0)
681 sprintf (name, ".rodata.cst%d", (int) (align / 8));
682 flags |= (align / 8) | SECTION_MERGE;
683 named_section_flags (name, flags);
687 readonly_data_section ();
690 /* Given NAME, a putative register name, discard any customary prefixes. */
693 strip_reg_name (name)
696 #ifdef REGISTER_PREFIX
697 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
698 name += strlen (REGISTER_PREFIX);
700 if (name[0] == '%' || name[0] == '#')
705 /* Decode an `asm' spec for a declaration as a register name.
706 Return the register number, or -1 if nothing specified,
707 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
708 or -3 if ASMSPEC is `cc' and is not recognized,
709 or -4 if ASMSPEC is `memory' and is not recognized.
710 Accept an exact spelling or a decimal number.
711 Prefixes such as % are optional. */
714 decode_reg_name (asmspec)
721 /* Get rid of confusing prefixes. */
722 asmspec = strip_reg_name (asmspec);
724 /* Allow a decimal number as a "register name". */
725 for (i = strlen (asmspec) - 1; i >= 0; i--)
726 if (! ISDIGIT (asmspec[i]))
728 if (asmspec[0] != 0 && i < 0)
731 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
737 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
739 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
742 #ifdef ADDITIONAL_REGISTER_NAMES
744 static const struct { const char *const name; const int number; } table[]
745 = ADDITIONAL_REGISTER_NAMES;
747 for (i = 0; i < (int) ARRAY_SIZE (table); i++)
748 if (! strcmp (asmspec, table[i].name))
749 return table[i].number;
751 #endif /* ADDITIONAL_REGISTER_NAMES */
753 if (!strcmp (asmspec, "memory"))
756 if (!strcmp (asmspec, "cc"))
765 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
766 have static storage duration. In other words, it should not be an
767 automatic variable, including PARM_DECLs.
769 There is, however, one exception: this function handles variables
770 explicitly placed in a particular register by the user.
772 ASMSPEC, if not 0, is the string which the user specified as the
773 assembler symbol name.
775 This is never called for PARM_DECL nodes. */
778 make_decl_rtl (decl, asmspec)
782 int top_level = (DECL_CONTEXT (decl) == NULL_TREE);
783 const char *name = 0;
784 const char *new_name = 0;
788 /* Check that we are not being given an automatic variable. */
789 /* A weak alias has TREE_PUBLIC set but not the other bits. */
790 if (TREE_CODE (decl) == PARM_DECL
791 || TREE_CODE (decl) == RESULT_DECL
792 || (TREE_CODE (decl) == VAR_DECL
793 && !TREE_STATIC (decl)
794 && !TREE_PUBLIC (decl)
795 && !DECL_EXTERNAL (decl)
796 && !DECL_REGISTER (decl)))
798 /* And that we were not given a type or a label. */
799 else if (TREE_CODE (decl) == TYPE_DECL
800 || TREE_CODE (decl) == LABEL_DECL)
803 /* For a duplicate declaration, we can be called twice on the
804 same DECL node. Don't discard the RTL already made. */
805 if (DECL_RTL_SET_P (decl))
807 /* If the old RTL had the wrong mode, fix the mode. */
808 if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
809 SET_DECL_RTL (decl, adjust_address_nv (DECL_RTL (decl),
810 DECL_MODE (decl), 0));
812 /* ??? Another way to do this would be to maintain a hashed
813 table of such critters. Instead of adding stuff to a DECL
814 to give certain attributes to it, we could use an external
815 hash map from DECL to set of attributes. */
817 /* Let the target reassign the RTL if it wants.
818 This is necessary, for example, when one machine specific
819 decl attribute overrides another. */
820 (* targetm.encode_section_info) (decl, false);
824 new_name = name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
826 reg_number = decode_reg_name (asmspec);
827 if (reg_number == -2)
829 /* ASMSPEC is given, and not the name of a register. Mark the
830 name with a star so assemble_name won't munge it. */
831 char *starred = alloca (strlen (asmspec) + 2);
833 strcpy (starred + 1, asmspec);
837 if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
839 /* First detect errors in declaring global registers. */
840 if (reg_number == -1)
841 error_with_decl (decl, "register name not specified for `%s'");
842 else if (reg_number < 0)
843 error_with_decl (decl, "invalid register name for `%s'");
844 else if (TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
845 error_with_decl (decl,
846 "data type of `%s' isn't suitable for a register");
847 else if (! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl))))
848 error_with_decl (decl,
849 "register specified for `%s' isn't suitable for data type");
850 /* Now handle properly declared static register variables. */
855 if (DECL_INITIAL (decl) != 0 && TREE_STATIC (decl))
857 DECL_INITIAL (decl) = 0;
858 error ("global register variable has initial value");
860 if (TREE_THIS_VOLATILE (decl))
861 warning ("volatile register variables don't work as you might wish");
863 /* If the user specified one of the eliminables registers here,
864 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
865 confused with that register and be eliminated. This usage is
866 somewhat suspect... */
868 SET_DECL_RTL (decl, gen_rtx_raw_REG (DECL_MODE (decl), reg_number));
869 ORIGINAL_REGNO (DECL_RTL (decl)) = reg_number;
870 REG_USERVAR_P (DECL_RTL (decl)) = 1;
872 if (TREE_STATIC (decl))
874 /* Make this register global, so not usable for anything
876 #ifdef ASM_DECLARE_REGISTER_GLOBAL
877 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name);
879 nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl));
881 globalize_reg (reg_number + --nregs);
884 /* As a register variable, it has no section. */
889 /* Now handle ordinary static variables and functions (in memory).
890 Also handle vars declared register invalidly. */
892 if (reg_number >= 0 || reg_number == -3)
893 error_with_decl (decl,
894 "register name given for non-register variable `%s'");
896 /* Specifying a section attribute on a variable forces it into a
897 non-.bss section, and thus it cannot be common. */
898 if (TREE_CODE (decl) == VAR_DECL
899 && DECL_SECTION_NAME (decl) != NULL_TREE
900 && DECL_INITIAL (decl) == NULL_TREE
901 && DECL_COMMON (decl))
902 DECL_COMMON (decl) = 0;
904 /* Variables can't be both common and weak. */
905 if (TREE_CODE (decl) == VAR_DECL && DECL_WEAK (decl))
906 DECL_COMMON (decl) = 0;
908 /* Can't use just the variable's own name for a variable
909 whose scope is less than the whole file, unless it's a member
910 of a local class (which will already be unambiguous).
911 Concatenate a distinguishing number. */
912 if (!top_level && !TREE_PUBLIC (decl)
913 && ! (DECL_CONTEXT (decl) && TYPE_P (DECL_CONTEXT (decl)))
915 && name == IDENTIFIER_POINTER (DECL_NAME (decl)))
919 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
924 if (name != new_name)
926 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (new_name));
927 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
930 /* If this variable is to be treated as volatile, show its
931 tree node has side effects. */
932 if ((flag_volatile_global && TREE_CODE (decl) == VAR_DECL
933 && TREE_PUBLIC (decl))
934 || ((flag_volatile_static && TREE_CODE (decl) == VAR_DECL
935 && (TREE_PUBLIC (decl) || TREE_STATIC (decl)))))
936 TREE_SIDE_EFFECTS (decl) = 1;
938 x = gen_rtx_MEM (DECL_MODE (decl), gen_rtx_SYMBOL_REF (Pmode, name));
939 SYMBOL_REF_WEAK (XEXP (x, 0)) = DECL_WEAK (decl);
940 if (TREE_CODE (decl) != FUNCTION_DECL)
941 set_mem_attributes (x, decl, 1);
942 SET_DECL_RTL (decl, x);
944 /* Optionally set flags or add text to the name to record information
945 such as that it is a function name.
946 If the name is changed, the macro ASM_OUTPUT_LABELREF
947 will have to know how to strip this information. */
948 (* targetm.encode_section_info) (decl, true);
951 /* Make the rtl for variable VAR be volatile.
952 Use this only for static variables. */
955 make_var_volatile (var)
958 if (GET_CODE (DECL_RTL (var)) != MEM)
961 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
964 /* Output alignment directive to align for constant expression EXP. */
967 assemble_constant_align (exp)
972 /* Align the location counter as required by EXP's data type. */
973 align = TYPE_ALIGN (TREE_TYPE (exp));
974 #ifdef CONSTANT_ALIGNMENT
975 align = CONSTANT_ALIGNMENT (exp, align);
978 if (align > BITS_PER_UNIT)
980 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
984 /* Output a string of literal assembler code
985 for an `asm' keyword used between functions. */
988 assemble_asm (string)
993 if (TREE_CODE (string) == ADDR_EXPR)
994 string = TREE_OPERAND (string, 0);
996 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
999 /* Record an element in the table of global destructors. SYMBOL is
1000 a SYMBOL_REF of the function to be called; PRIORITY is a number
1001 between 0 and MAX_INIT_PRIORITY. */
1004 default_stabs_asm_out_destructor (symbol, priority)
1006 int priority ATTRIBUTE_UNUSED;
1008 /* Tell GNU LD that this is part of the static destructor set.
1009 This will work for any system that uses stabs, most usefully
1011 fprintf (asm_out_file, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
1012 assemble_name (asm_out_file, XSTR (symbol, 0));
1013 fputc ('\n', asm_out_file);
1017 default_named_section_asm_out_destructor (symbol, priority)
1021 const char *section = ".dtors";
1024 /* ??? This only works reliably with the GNU linker. */
1025 if (priority != DEFAULT_INIT_PRIORITY)
1027 sprintf (buf, ".dtors.%.5u",
1028 /* Invert the numbering so the linker puts us in the proper
1029 order; constructors are run from right to left, and the
1030 linker sorts in increasing order. */
1031 MAX_INIT_PRIORITY - priority);
1035 named_section_flags (section, SECTION_WRITE);
1036 assemble_align (POINTER_SIZE);
1037 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1040 #ifdef DTORS_SECTION_ASM_OP
1044 if (in_section != in_dtors)
1046 in_section = in_dtors;
1047 fputs (DTORS_SECTION_ASM_OP, asm_out_file);
1048 fputc ('\n', asm_out_file);
1053 default_dtor_section_asm_out_destructor (symbol, priority)
1055 int priority ATTRIBUTE_UNUSED;
1058 assemble_align (POINTER_SIZE);
1059 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1063 /* Likewise for global constructors. */
1066 default_stabs_asm_out_constructor (symbol, priority)
1068 int priority ATTRIBUTE_UNUSED;
1070 /* Tell GNU LD that this is part of the static destructor set.
1071 This will work for any system that uses stabs, most usefully
1073 fprintf (asm_out_file, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
1074 assemble_name (asm_out_file, XSTR (symbol, 0));
1075 fputc ('\n', asm_out_file);
1079 default_named_section_asm_out_constructor (symbol, priority)
1083 const char *section = ".ctors";
1086 /* ??? This only works reliably with the GNU linker. */
1087 if (priority != DEFAULT_INIT_PRIORITY)
1089 sprintf (buf, ".ctors.%.5u",
1090 /* Invert the numbering so the linker puts us in the proper
1091 order; constructors are run from right to left, and the
1092 linker sorts in increasing order. */
1093 MAX_INIT_PRIORITY - priority);
1097 named_section_flags (section, SECTION_WRITE);
1098 assemble_align (POINTER_SIZE);
1099 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1102 #ifdef CTORS_SECTION_ASM_OP
1106 if (in_section != in_ctors)
1108 in_section = in_ctors;
1109 fputs (CTORS_SECTION_ASM_OP, asm_out_file);
1110 fputc ('\n', asm_out_file);
1115 default_ctor_section_asm_out_constructor (symbol, priority)
1117 int priority ATTRIBUTE_UNUSED;
1120 assemble_align (POINTER_SIZE);
1121 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1125 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1126 a nonzero value if the constant pool should be output before the
1127 start of the function, or a zero value if the pool should output
1128 after the end of the function. The default is to put it before the
1131 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1132 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1135 /* Output assembler code for the constant pool of a function and associated
1136 with defining the name of the function. DECL describes the function.
1137 NAME is the function's name. For the constant pool, we use the current
1138 constant pool data. */
1141 assemble_start_function (decl, fnname)
1147 /* The following code does not need preprocessing in the assembler. */
1151 if (CONSTANT_POOL_BEFORE_FUNCTION)
1152 output_constant_pool (fnname, decl);
1154 resolve_unique_section (decl, 0, flag_function_sections);
1155 function_section (decl);
1157 /* Tell assembler to move to target machine's alignment for functions. */
1158 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1159 if (align < force_align_functions_log)
1160 align = force_align_functions_log;
1163 ASM_OUTPUT_ALIGN (asm_out_file, align);
1166 /* Handle a user-specified function alignment.
1167 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1168 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1169 if (align_functions_log > align
1170 && cfun->function_frequency != FUNCTION_FREQUENCY_UNLIKELY_EXECUTED)
1172 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1173 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file,
1174 align_functions_log, align_functions - 1);
1176 ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
1180 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1181 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
1184 (*debug_hooks->begin_function) (decl);
1186 /* Make function name accessible from other files, if appropriate. */
1188 if (TREE_PUBLIC (decl))
1190 if (! first_global_object_name)
1195 p = (* targetm.strip_name_encoding) (fnname);
1198 if (! DECL_WEAK (decl) && ! DECL_ONE_ONLY (decl))
1199 first_global_object_name = name;
1201 weak_global_object_name = name;
1204 globalize_decl (decl);
1206 maybe_assemble_visibility (decl);
1209 /* Do any machine/system dependent processing of the function name */
1210 #ifdef ASM_DECLARE_FUNCTION_NAME
1211 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
1213 /* Standard thing is just output label for the function. */
1214 ASM_OUTPUT_LABEL (asm_out_file, fnname);
1215 #endif /* ASM_DECLARE_FUNCTION_NAME */
1218 /* Output assembler code associated with defining the size of the
1219 function. DECL describes the function. NAME is the function's name. */
1222 assemble_end_function (decl, fnname)
1226 #ifdef ASM_DECLARE_FUNCTION_SIZE
1227 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1229 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1231 output_constant_pool (fnname, decl);
1232 function_section (decl); /* need to switch back */
1235 /* Output any constants which should appear after the function. */
1236 output_after_function_constants ();
1239 /* Assemble code to leave SIZE bytes of zeros. */
1242 assemble_zeros (size)
1245 /* Do no output if -fsyntax-only. */
1246 if (flag_syntax_only)
1249 #ifdef ASM_NO_SKIP_IN_TEXT
1250 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1251 so we must output 0s explicitly in the text section. */
1252 if (ASM_NO_SKIP_IN_TEXT && in_text_section ())
1255 for (i = 0; i < size; i++)
1256 assemble_integer (const0_rtx, 1, BITS_PER_UNIT, 1);
1261 ASM_OUTPUT_SKIP (asm_out_file, size);
1264 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1267 assemble_align (align)
1270 if (align > BITS_PER_UNIT)
1272 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1276 /* Assemble a string constant with the specified C string as contents. */
1279 assemble_string (p, size)
1286 /* If the string is very long, split it up. */
1290 int thissize = size - pos;
1291 if (thissize > maximum)
1294 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1302 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1303 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1304 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1306 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1307 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1308 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1310 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1311 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1315 #if defined ASM_OUTPUT_ALIGNED_BSS
1316 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1317 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1319 #if defined ASM_OUTPUT_BSS
1320 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1321 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1327 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1328 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1329 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1331 #if defined ASM_OUTPUT_ALIGNED_COMMON
1332 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1333 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1335 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1336 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1341 asm_emit_uninitialised (decl, name, size, rounded)
1344 int size ATTRIBUTE_UNUSED;
1345 int rounded ATTRIBUTE_UNUSED;
1353 destination = asm_dest_local;
1355 /* ??? We should handle .bss via select_section mechanisms rather than
1356 via special target hooks. That would eliminate this special case. */
1357 if (TREE_PUBLIC (decl))
1359 if (!DECL_COMMON (decl))
1361 destination = asm_dest_bss;
1366 destination = asm_dest_common;
1369 if (destination == asm_dest_bss)
1370 globalize_decl (decl);
1371 resolve_unique_section (decl, 0, flag_data_sections);
1373 if (flag_shared_data)
1375 switch (destination)
1377 #ifdef ASM_OUTPUT_SHARED_BSS
1379 ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded);
1382 #ifdef ASM_OUTPUT_SHARED_COMMON
1383 case asm_dest_common:
1384 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1387 #ifdef ASM_OUTPUT_SHARED_LOCAL
1388 case asm_dest_local:
1389 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1397 switch (destination)
1401 ASM_EMIT_BSS (decl, name, size, rounded);
1404 case asm_dest_common:
1405 ASM_EMIT_COMMON (decl, name, size, rounded);
1407 case asm_dest_local:
1408 ASM_EMIT_LOCAL (decl, name, size, rounded);
1417 /* Assemble everything that is needed for a variable or function declaration.
1418 Not used for automatic variables, and not used for function definitions.
1419 Should not be called for variables of incomplete structure type.
1421 TOP_LEVEL is nonzero if this variable has file scope.
1422 AT_END is nonzero if this is the special handling, at end of compilation,
1423 to define things that have had only tentative definitions.
1424 DONT_OUTPUT_DATA if nonzero means don't actually output the
1425 initial value (that will be done by the caller). */
1428 assemble_variable (decl, top_level, at_end, dont_output_data)
1430 int top_level ATTRIBUTE_UNUSED;
1431 int at_end ATTRIBUTE_UNUSED;
1432 int dont_output_data;
1439 last_assemble_variable_decl = 0;
1441 /* Normally no need to say anything here for external references,
1442 since assemble_external is called by the language-specific code
1443 when a declaration is first seen. */
1445 if (DECL_EXTERNAL (decl))
1448 /* Output no assembler code for a function declaration.
1449 Only definitions of functions output anything. */
1451 if (TREE_CODE (decl) == FUNCTION_DECL)
1454 /* Do nothing for global register variables. */
1455 if (DECL_RTL_SET_P (decl) && GET_CODE (DECL_RTL (decl)) == REG)
1457 TREE_ASM_WRITTEN (decl) = 1;
1461 /* If type was incomplete when the variable was declared,
1462 see if it is complete now. */
1464 if (DECL_SIZE (decl) == 0)
1465 layout_decl (decl, 0);
1467 /* Still incomplete => don't allocate it; treat the tentative defn
1468 (which is what it must have been) as an `extern' reference. */
1470 if (!dont_output_data && DECL_SIZE (decl) == 0)
1472 error_with_file_and_line (DECL_SOURCE_FILE (decl),
1473 DECL_SOURCE_LINE (decl),
1474 "storage size of `%s' isn't known",
1475 IDENTIFIER_POINTER (DECL_NAME (decl)));
1476 TREE_ASM_WRITTEN (decl) = 1;
1480 /* The first declaration of a variable that comes through this function
1481 decides whether it is global (in C, has external linkage)
1482 or local (in C, has internal linkage). So do nothing more
1483 if this function has already run. */
1485 if (TREE_ASM_WRITTEN (decl))
1488 /* Make sure targetm.encode_section_info is invoked before we set
1490 decl_rtl = DECL_RTL (decl);
1492 TREE_ASM_WRITTEN (decl) = 1;
1494 /* Do no output if -fsyntax-only. */
1495 if (flag_syntax_only)
1500 if (! dont_output_data
1501 && ! host_integerp (DECL_SIZE_UNIT (decl), 1))
1503 error_with_decl (decl, "size of variable `%s' is too large");
1507 name = XSTR (XEXP (decl_rtl, 0), 0);
1508 if (TREE_PUBLIC (decl) && DECL_NAME (decl)
1509 && ! first_global_object_name
1510 && ! (DECL_COMMON (decl) && (DECL_INITIAL (decl) == 0
1511 || DECL_INITIAL (decl) == error_mark_node))
1512 && ! DECL_WEAK (decl)
1513 && ! DECL_ONE_ONLY (decl))
1518 p = (* targetm.strip_name_encoding) (name);
1519 xname = xstrdup (p);
1520 first_global_object_name = xname;
1523 /* Compute the alignment of this data. */
1525 align = DECL_ALIGN (decl);
1527 /* In the case for initialing an array whose length isn't specified,
1528 where we have not yet been able to do the layout,
1529 figure out the proper alignment now. */
1530 if (dont_output_data && DECL_SIZE (decl) == 0
1531 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1532 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1534 /* Some object file formats have a maximum alignment which they support.
1535 In particular, a.out format supports a maximum alignment of 4. */
1536 #ifndef MAX_OFILE_ALIGNMENT
1537 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1539 if (align > MAX_OFILE_ALIGNMENT)
1541 warning_with_decl (decl,
1542 "alignment of `%s' is greater than maximum object file alignment. Using %d",
1543 MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
1544 align = MAX_OFILE_ALIGNMENT;
1547 /* On some machines, it is good to increase alignment sometimes. */
1548 if (! DECL_USER_ALIGN (decl))
1550 #ifdef DATA_ALIGNMENT
1551 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1553 #ifdef CONSTANT_ALIGNMENT
1554 if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node)
1555 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1559 /* Reset the alignment in case we have made it tighter, so we can benefit
1560 from it in get_pointer_alignment. */
1561 DECL_ALIGN (decl) = align;
1562 set_mem_align (decl_rtl, align);
1564 if (TREE_PUBLIC (decl))
1565 maybe_assemble_visibility (decl);
1567 /* Output any data that we will need to use the address of. */
1568 if (DECL_INITIAL (decl) == error_mark_node)
1569 reloc = contains_pointers_p (TREE_TYPE (decl)) ? 3 : 0;
1570 else if (DECL_INITIAL (decl))
1571 reloc = output_addressed_constants (DECL_INITIAL (decl));
1572 resolve_unique_section (decl, reloc, flag_data_sections);
1574 /* Handle uninitialized definitions. */
1576 /* If the decl has been given an explicit section name, then it
1577 isn't common, and shouldn't be handled as such. */
1578 if (DECL_SECTION_NAME (decl) || dont_output_data)
1580 /* We don't implement common thread-local data at present. */
1581 else if (DECL_THREAD_LOCAL (decl))
1583 if (DECL_COMMON (decl))
1584 sorry ("thread-local COMMON data not implemented");
1586 else if (DECL_INITIAL (decl) == 0
1587 || DECL_INITIAL (decl) == error_mark_node
1588 || (flag_zero_initialized_in_bss
1589 /* Leave constant zeroes in .rodata so they can be shared. */
1590 && !TREE_READONLY (decl)
1591 && initializer_zerop (DECL_INITIAL (decl))))
1593 unsigned HOST_WIDE_INT size = tree_low_cst (DECL_SIZE_UNIT (decl), 1);
1594 unsigned HOST_WIDE_INT rounded = size;
1596 /* Don't allocate zero bytes of common,
1597 since that means "undefined external" in the linker. */
1601 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1602 so that each uninitialized object starts on such a boundary. */
1603 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1604 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1605 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1607 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1608 if ((unsigned HOST_WIDE_INT) DECL_ALIGN (decl) / BITS_PER_UNIT > rounded)
1610 (decl, "requested alignment for %s is greater than implemented alignment of %d",rounded);
1613 /* If the target cannot output uninitialized but not common global data
1614 in .bss, then we have to use .data, so fall through. */
1615 if (asm_emit_uninitialised (decl, name, size, rounded))
1619 /* Handle initialized definitions.
1620 Also handle uninitialized global definitions if -fno-common and the
1621 target doesn't support ASM_OUTPUT_BSS. */
1623 /* First make the assembler name(s) global if appropriate. */
1624 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1625 globalize_decl (decl);
1627 /* Switch to the appropriate section. */
1628 variable_section (decl, reloc);
1630 /* dbxout.c needs to know this. */
1631 if (in_text_section ())
1632 DECL_IN_TEXT_SECTION (decl) = 1;
1634 /* Output the alignment of this data. */
1635 if (align > BITS_PER_UNIT)
1637 ASM_OUTPUT_ALIGN (asm_out_file,
1638 floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT));
1641 /* Do any machine/system dependent processing of the object. */
1642 #ifdef ASM_DECLARE_OBJECT_NAME
1643 last_assemble_variable_decl = decl;
1644 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1646 /* Standard thing is just output label for the object. */
1647 ASM_OUTPUT_LABEL (asm_out_file, name);
1648 #endif /* ASM_DECLARE_OBJECT_NAME */
1650 if (!dont_output_data)
1652 if (DECL_INITIAL (decl) && DECL_INITIAL (decl) != error_mark_node)
1653 /* Output the actual data. */
1654 output_constant (DECL_INITIAL (decl),
1655 tree_low_cst (DECL_SIZE_UNIT (decl), 1),
1658 /* Leave space for it. */
1659 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl), 1));
1663 /* Return 1 if type TYPE contains any pointers. */
1666 contains_pointers_p (type)
1669 switch (TREE_CODE (type))
1672 case REFERENCE_TYPE:
1673 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1674 so I'll play safe and return 1. */
1680 case QUAL_UNION_TYPE:
1683 /* For a type that has fields, see if the fields have pointers. */
1684 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1685 if (TREE_CODE (fields) == FIELD_DECL
1686 && contains_pointers_p (TREE_TYPE (fields)))
1692 /* An array type contains pointers if its element type does. */
1693 return contains_pointers_p (TREE_TYPE (type));
1700 /* Output something to declare an external symbol to the assembler.
1701 (Most assemblers don't need this, so we normally output nothing.)
1702 Do nothing if DECL is not external. */
1705 assemble_external (decl)
1706 tree decl ATTRIBUTE_UNUSED;
1708 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1709 main body of this code is only rarely exercised. To provide some
1710 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1711 open. If it's not, we should not be calling this function. */
1715 #ifdef ASM_OUTPUT_EXTERNAL
1716 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1718 rtx rtl = DECL_RTL (decl);
1720 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1721 && ! SYMBOL_REF_USED (XEXP (rtl, 0)))
1723 /* Some systems do require some output. */
1724 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1725 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1731 /* Similar, for calling a library function FUN. */
1734 assemble_external_libcall (fun)
1735 rtx fun ATTRIBUTE_UNUSED;
1737 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1738 /* Declare library function name external when first used, if nec. */
1739 if (! SYMBOL_REF_USED (fun))
1741 SYMBOL_REF_USED (fun) = 1;
1742 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun);
1747 /* Assemble a label named NAME. */
1750 assemble_label (name)
1753 ASM_OUTPUT_LABEL (asm_out_file, name);
1756 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1757 If NAME starts with a *, the rest of NAME is output verbatim.
1758 Otherwise NAME is transformed in an implementation-defined way
1759 (usually by the addition of an underscore).
1760 Many macros in the tm file are defined to call this function. */
1763 assemble_name (file, name)
1767 const char *real_name;
1770 real_name = (* targetm.strip_name_encoding) (name);
1772 id = maybe_get_identifier (real_name);
1774 TREE_SYMBOL_REFERENCED (id) = 1;
1777 fputs (&name[1], file);
1779 ASM_OUTPUT_LABELREF (file, name);
1782 /* Allocate SIZE bytes writable static space with a gensym name
1783 and return an RTX to refer to its address. */
1786 assemble_static_space (size)
1790 const char *namestring;
1794 if (flag_shared_data)
1798 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1800 namestring = ggc_strdup (name);
1802 x = gen_rtx_SYMBOL_REF (Pmode, namestring);
1804 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1805 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
1808 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1809 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1812 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1813 so that each uninitialized object starts on such a boundary. */
1814 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1815 int rounded ATTRIBUTE_UNUSED
1816 = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1817 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1818 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1819 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1826 /* Assemble the static constant template for function entry trampolines.
1827 This is done at most once per compilation.
1828 Returns an RTX for the address of the template. */
1830 #ifdef TRAMPOLINE_TEMPLATE
1832 assemble_trampoline_template ()
1838 /* By default, put trampoline templates in read-only data section. */
1840 #ifdef TRAMPOLINE_SECTION
1841 TRAMPOLINE_SECTION ();
1843 readonly_data_section ();
1846 /* Write the assembler code to define one. */
1847 align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
1850 ASM_OUTPUT_ALIGN (asm_out_file, align);
1853 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LTRAMP", 0);
1854 TRAMPOLINE_TEMPLATE (asm_out_file);
1856 /* Record the rtl to refer to it. */
1857 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1858 name = ggc_strdup (label);
1859 return gen_rtx_SYMBOL_REF (Pmode, name);
1863 /* A and B are either alignments or offsets. Return the minimum alignment
1864 that may be assumed after adding the two together. */
1866 static inline unsigned
1870 return (a | b) & -(a | b);
1873 /* Return the assembler directive for creating a given kind of integer
1874 object. SIZE is the number of bytes in the object and ALIGNED_P
1875 indicates whether it is known to be aligned. Return NULL if the
1876 assembly dialect has no such directive.
1878 The returned string should be printed at the start of a new line and
1879 be followed immediately by the object's initial value. */
1882 integer_asm_op (size, aligned_p)
1886 struct asm_int_op *ops;
1889 ops = &targetm.asm_out.aligned_op;
1891 ops = &targetm.asm_out.unaligned_op;
1896 return targetm.asm_out.byte_op;
1910 /* Use directive OP to assemble an integer object X. Print OP at the
1911 start of the line, followed immediately by the value of X. */
1914 assemble_integer_with_op (op, x)
1918 fputs (op, asm_out_file);
1919 output_addr_const (asm_out_file, x);
1920 fputc ('\n', asm_out_file);
1923 /* The default implementation of the asm_out.integer target hook. */
1926 default_assemble_integer (x, size, aligned_p)
1927 rtx x ATTRIBUTE_UNUSED;
1928 unsigned int size ATTRIBUTE_UNUSED;
1929 int aligned_p ATTRIBUTE_UNUSED;
1931 const char *op = integer_asm_op (size, aligned_p);
1932 return op && (assemble_integer_with_op (op, x), true);
1935 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1936 the alignment of the integer in bits. Return 1 if we were able to output
1937 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1941 assemble_integer (x, size, align, force)
1949 aligned_p = (align >= MIN (size * BITS_PER_UNIT, BIGGEST_ALIGNMENT));
1951 /* See if the target hook can handle this kind of object. */
1952 if ((*targetm.asm_out.integer) (x, size, aligned_p))
1955 /* If the object is a multi-byte one, try splitting it up. Split
1956 it into words it if is multi-word, otherwise split it into bytes. */
1959 enum machine_mode omode, imode;
1960 unsigned int subalign;
1961 unsigned int subsize, i;
1963 subsize = size > UNITS_PER_WORD? UNITS_PER_WORD : 1;
1964 subalign = MIN (align, subsize * BITS_PER_UNIT);
1965 omode = mode_for_size (subsize * BITS_PER_UNIT, MODE_INT, 0);
1966 imode = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1968 for (i = 0; i < size; i += subsize)
1970 rtx partial = simplify_subreg (omode, x, imode, i);
1971 if (!partial || !assemble_integer (partial, subsize, subalign, 0))
1977 /* If we've printed some of it, but not all of it, there's no going
1990 assemble_real (d, mode, align)
1992 enum machine_mode mode;
1997 unsigned int nalign = min_align (align, 32);
1999 switch (BITS_PER_UNIT)
2005 REAL_VALUE_TO_TARGET_SINGLE (d, l);
2006 assemble_integer (GEN_INT (l), 4, align, 1);
2009 REAL_VALUE_TO_TARGET_DOUBLE (d, data);
2010 assemble_integer (GEN_INT (data[0]), 4, align, 1);
2011 assemble_integer (GEN_INT (data[1]), 4, nalign, 1);
2014 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d, data);
2015 assemble_integer (GEN_INT (data[0]), 4, align, 1);
2016 assemble_integer (GEN_INT (data[1]), 4, nalign, 1);
2017 assemble_integer (GEN_INT (data[2]), 4, nalign, 1);
2020 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d, data);
2021 assemble_integer (GEN_INT (data[0]), 4, align, 1);
2022 assemble_integer (GEN_INT (data[1]), 4, nalign, 1);
2023 assemble_integer (GEN_INT (data[2]), 4, nalign, 1);
2024 assemble_integer (GEN_INT (data[3]), 4, nalign, 1);
2035 REAL_VALUE_TO_TARGET_SINGLE (d, l);
2036 assemble_integer (GEN_INT (l), 2, align, 1);
2039 REAL_VALUE_TO_TARGET_DOUBLE (d, data);
2040 assemble_integer (GEN_INT (data[0]), 2, align, 1);
2041 assemble_integer (GEN_INT (data[1]), 1, nalign, 1);
2052 REAL_VALUE_TO_TARGET_SINGLE (d, l);
2053 assemble_integer (GEN_INT (l), 1, align, 1);
2056 REAL_VALUE_TO_TARGET_DOUBLE (d, data);
2057 assemble_integer (GEN_INT (data[0]), 1, align, 1);
2058 assemble_integer (GEN_INT (data[1]), 1, nalign, 1);
2070 /* Given an expression EXP with a constant value,
2071 reduce it to the sum of an assembler symbol and an integer.
2072 Store them both in the structure *VALUE.
2073 Abort if EXP does not reduce. */
2075 struct addr_const GTY(())
2078 HOST_WIDE_INT offset;
2082 decode_addr_const (exp, value)
2084 struct addr_const *value;
2086 tree target = TREE_OPERAND (exp, 0);
2092 if (TREE_CODE (target) == COMPONENT_REF
2093 && host_integerp (byte_position (TREE_OPERAND (target, 1)), 0))
2096 offset += int_byte_position (TREE_OPERAND (target, 1));
2097 target = TREE_OPERAND (target, 0);
2099 else if (TREE_CODE (target) == ARRAY_REF
2100 || TREE_CODE (target) == ARRAY_RANGE_REF)
2102 offset += (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target)), 1)
2103 * tree_low_cst (TREE_OPERAND (target, 1), 0));
2104 target = TREE_OPERAND (target, 0);
2110 switch (TREE_CODE (target))
2114 x = DECL_RTL (target);
2118 x = gen_rtx_MEM (FUNCTION_MODE,
2119 gen_rtx_LABEL_REF (VOIDmode,
2120 label_rtx (TREE_OPERAND (exp, 0))));
2128 /* This constant should have been output already, but we can't simply
2129 use TREE_CST_RTL since INTEGER_CST doesn't have one. */
2130 x = output_constant_def (target, 1);
2137 if (GET_CODE (x) != MEM)
2142 value->offset = offset;
2145 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2146 enum kind { RTX_UNKNOWN, RTX_DOUBLE, RTX_VECTOR, RTX_INT, RTX_UNSPEC };
2147 struct rtx_const GTY(())
2149 ENUM_BITFIELD(kind) kind : 16;
2150 ENUM_BITFIELD(machine_mode) mode : 16;
2151 union rtx_const_un {
2153 struct rtx_const_u_addr {
2156 HOST_WIDE_INT offset;
2157 } GTY ((tag ("1"))) addr;
2158 struct rtx_const_u_di {
2161 } GTY ((tag ("0"))) di;
2163 /* The max vector size we have is 16 wide; two variants for
2164 integral and floating point vectors. */
2165 struct rtx_const_int_vec {
2168 } GTY ((tag ("2"))) int_vec[16];
2170 REAL_VALUE_TYPE GTY ((tag ("3"))) fp_vec[8];
2172 } GTY ((desc ("%1.kind >= RTX_INT"), descbits ("1"))) un;
2175 /* Uniquize all constants that appear in memory.
2176 Each constant in memory thus far output is recorded
2177 in `const_hash_table'. */
2179 struct constant_descriptor_tree GTY(())
2181 /* More constant_descriptors with the same hash code. */
2182 struct constant_descriptor_tree *next;
2184 /* The label of the constant. */
2187 /* A MEM for the constant. */
2190 /* The value of the constant. */
2194 #define MAX_HASH_TABLE 1009
2195 static GTY(()) struct constant_descriptor_tree *
2196 const_hash_table[MAX_HASH_TABLE];
2198 /* We maintain a hash table of STRING_CST values. Unless we are asked to force
2199 out a string constant, we defer output of the constants until we know
2200 they are actually used. This will be if something takes its address or if
2201 there is a usage of the string in the RTL of a function. */
2203 #define STRHASH(x) htab_hash_pointer (x)
2205 struct deferred_string GTY(())
2212 static GTY ((param_is (struct deferred_string))) htab_t const_str_htab;
2214 /* Returns a hash code for X (which is a really a
2215 struct deferred_string *). */
2218 const_str_htab_hash (x)
2221 return STRHASH (((const struct deferred_string *) x)->label);
2224 /* Returns nonzero if the value represented by X (which is really a
2225 struct deferred_string *) is the same as that given by Y
2226 (which is really a char *). */
2229 const_str_htab_eq (x, y)
2233 return (((const struct deferred_string *) x)->label == (const char *) y);
2236 /* Compute a hash code for a constant expression. */
2242 return const_hash_1 (exp) % MAX_HASH_TABLE;
2252 enum tree_code code = TREE_CODE (exp);
2254 /* Either set P and LEN to the address and len of something to hash and
2255 exit the switch or return a value. */
2260 p = (char *) &TREE_INT_CST (exp);
2261 len = sizeof TREE_INT_CST (exp);
2265 return real_hash (TREE_REAL_CST_PTR (exp));
2268 p = TREE_STRING_POINTER (exp);
2269 len = TREE_STRING_LENGTH (exp);
2273 return (const_hash_1 (TREE_REALPART (exp)) * 5
2274 + const_hash_1 (TREE_IMAGPART (exp)));
2277 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2281 len = int_size_in_bytes (TREE_TYPE (exp));
2282 tmp = (char *) alloca (len);
2283 get_set_constructor_bytes (exp, (unsigned char *) tmp, len);
2291 hi = 5 + int_size_in_bytes (TREE_TYPE (exp));
2293 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2294 if (TREE_VALUE (link))
2295 hi = hi * 603 + const_hash_1 (TREE_VALUE (link));
2303 struct addr_const value;
2305 decode_addr_const (exp, &value);
2306 if (GET_CODE (value.base) == SYMBOL_REF)
2308 /* Don't hash the address of the SYMBOL_REF;
2309 only use the offset and the symbol name. */
2311 p = XSTR (value.base, 0);
2312 for (i = 0; p[i] != 0; i++)
2313 hi = ((hi * 613) + (unsigned) (p[i]));
2315 else if (GET_CODE (value.base) == LABEL_REF)
2316 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2324 return (const_hash_1 (TREE_OPERAND (exp, 0)) * 9
2325 + const_hash_1 (TREE_OPERAND (exp, 1)));
2329 case NON_LVALUE_EXPR:
2330 return const_hash_1 (TREE_OPERAND (exp, 0)) * 7 + 2;
2333 /* A language specific constant. Just hash the code. */
2337 /* Compute hashing function */
2339 for (i = 0; i < len; i++)
2340 hi = ((hi * 613) + (unsigned) (p[i]));
2345 /* Compare t1 and t2, and return 1 only if they are known to result in
2346 the same bit pattern on output. */
2349 compare_constant (t1, t2)
2353 enum tree_code typecode;
2355 if (t1 == NULL_TREE)
2356 return t2 == NULL_TREE;
2357 if (t2 == NULL_TREE)
2360 if (TREE_CODE (t1) != TREE_CODE (t2))
2363 switch (TREE_CODE (t1))
2366 /* Integer constants are the same only if the same width of type. */
2367 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2369 return tree_int_cst_equal (t1, t2);
2372 /* Real constants are the same only if the same width of type. */
2373 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2376 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
2379 if (flag_writable_strings)
2382 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2)))
2385 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
2386 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
2387 TREE_STRING_LENGTH (t1)));
2390 return (compare_constant (TREE_REALPART (t1), TREE_REALPART (t2))
2391 && compare_constant (TREE_IMAGPART (t1), TREE_IMAGPART (t2)));
2394 typecode = TREE_CODE (TREE_TYPE (t1));
2395 if (typecode != TREE_CODE (TREE_TYPE (t2)))
2398 if (typecode == SET_TYPE)
2400 int len = int_size_in_bytes (TREE_TYPE (t2));
2401 unsigned char *tmp1, *tmp2;
2403 if (int_size_in_bytes (TREE_TYPE (t1)) != len)
2406 tmp1 = (unsigned char *) alloca (len);
2407 tmp2 = (unsigned char *) alloca (len);
2409 if (get_set_constructor_bytes (t1, tmp1, len) != NULL_TREE)
2411 if (get_set_constructor_bytes (t2, tmp2, len) != NULL_TREE)
2414 return memcmp (tmp1, tmp2, len) == 0;
2420 if (typecode == ARRAY_TYPE)
2422 HOST_WIDE_INT size_1 = int_size_in_bytes (TREE_TYPE (t1));
2423 /* For arrays, check that the sizes all match. */
2424 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2))
2426 || size_1 != int_size_in_bytes (TREE_TYPE (t2)))
2431 /* For record and union constructors, require exact type
2433 if (TREE_TYPE (t1) != TREE_TYPE (t2))
2437 for (l1 = CONSTRUCTOR_ELTS (t1), l2 = CONSTRUCTOR_ELTS (t2);
2439 l1 = TREE_CHAIN (l1), l2 = TREE_CHAIN (l2))
2441 /* Check that each value is the same... */
2442 if (! compare_constant (TREE_VALUE (l1), TREE_VALUE (l2)))
2444 /* ... and that they apply to the same fields! */
2445 if (typecode == ARRAY_TYPE)
2447 if (! compare_constant (TREE_PURPOSE (l1),
2453 if (TREE_PURPOSE (l1) != TREE_PURPOSE (l2))
2458 return l1 == NULL_TREE && l2 == NULL_TREE;
2464 struct addr_const value1, value2;
2466 decode_addr_const (t1, &value1);
2467 decode_addr_const (t2, &value2);
2468 return (value1.offset == value2.offset
2469 && strcmp (XSTR (value1.base, 0), XSTR (value2.base, 0)) == 0);
2475 return (compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))
2476 && compare_constant(TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)));
2480 case NON_LVALUE_EXPR:
2481 return compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2486 nt1 = (*lang_hooks.expand_constant) (t1);
2487 nt2 = (*lang_hooks.expand_constant) (t2);
2488 if (nt1 != t1 || nt2 != t2)
2489 return compare_constant (nt1, nt2);
2495 /* Should not get here. */
2499 /* Record a list of constant expressions that were passed to
2500 output_constant_def but that could not be output right away. */
2502 struct deferred_constant
2504 struct deferred_constant *next;
2510 static struct deferred_constant *deferred_constants;
2512 /* Another list of constants which should be output after the
2514 static struct deferred_constant *after_function_constants;
2516 /* Nonzero means defer output of addressed subconstants
2517 (i.e., those for which output_constant_def is called.) */
2518 static int defer_addressed_constants_flag;
2520 /* Start deferring output of subconstants. */
2523 defer_addressed_constants ()
2525 defer_addressed_constants_flag++;
2528 /* Stop deferring output of subconstants,
2529 and output now all those that have been deferred. */
2532 output_deferred_addressed_constants ()
2534 struct deferred_constant *p, *next;
2536 defer_addressed_constants_flag--;
2538 if (defer_addressed_constants_flag > 0)
2541 for (p = deferred_constants; p; p = next)
2543 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2548 deferred_constants = 0;
2551 /* Output any constants which should appear after a function. */
2554 output_after_function_constants ()
2556 struct deferred_constant *p, *next;
2558 for (p = after_function_constants; p; p = next)
2560 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2565 after_function_constants = 0;
2568 /* Make a copy of the whole tree structure for a constant. This
2569 handles the same types of nodes that compare_constant handles. */
2575 switch (TREE_CODE (exp))
2578 /* For ADDR_EXPR, we do not want to copy the decl whose address
2579 is requested. We do want to copy constants though. */
2580 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c')
2581 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2582 copy_constant (TREE_OPERAND (exp, 0)));
2584 return copy_node (exp);
2589 return copy_node (exp);
2592 return build_complex (TREE_TYPE (exp),
2593 copy_constant (TREE_REALPART (exp)),
2594 copy_constant (TREE_IMAGPART (exp)));
2598 return build (TREE_CODE (exp), TREE_TYPE (exp),
2599 copy_constant (TREE_OPERAND (exp, 0)),
2600 copy_constant (TREE_OPERAND (exp, 1)));
2604 case NON_LVALUE_EXPR:
2605 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2606 copy_constant (TREE_OPERAND (exp, 0)));
2610 tree copy = copy_node (exp);
2611 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2614 CONSTRUCTOR_ELTS (copy) = list;
2615 for (tail = list; tail; tail = TREE_CHAIN (tail))
2616 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2617 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2618 for (tail = list; tail; tail = TREE_CHAIN (tail))
2619 TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail));
2627 t = (*lang_hooks.expand_constant) (exp);
2629 return copy_constant (t);
2636 /* Return an rtx representing a reference to constant data in memory
2637 for the constant expression EXP.
2639 If assembler code for such a constant has already been output,
2640 return an rtx to refer to it.
2641 Otherwise, output such a constant in memory (or defer it for later)
2642 and generate an rtx for it.
2644 If DEFER is nonzero, the output of string constants can be deferred
2645 and output only if referenced in the function after all optimizations.
2647 The TREE_CST_RTL of EXP is set up to point to that rtx.
2648 The const_hash_table records which constants already have label strings. */
2651 output_constant_def (exp, defer)
2656 struct constant_descriptor_tree *desc;
2657 struct deferred_string **defstr;
2661 int after_function = 0;
2666 /* We can't just use the saved RTL if this is a deferred string constant
2667 and we are not to defer anymore. */
2668 if (TREE_CODE (exp) != INTEGER_CST && TREE_CST_RTL (exp)
2669 && (defer || !STRING_POOL_ADDRESS_P (XEXP (TREE_CST_RTL (exp), 0))))
2670 return TREE_CST_RTL (exp);
2672 /* Make sure any other constants whose addresses appear in EXP
2673 are assigned label numbers. */
2675 reloc = output_addressed_constants (exp);
2677 /* Compute hash code of EXP. Search the descriptors for that hash code
2678 to see if any of them describes EXP. If yes, the descriptor records
2679 the label number already assigned. */
2681 hash = const_hash (exp);
2683 for (desc = const_hash_table[hash]; desc; desc = desc->next)
2684 if (compare_constant (exp, desc->value))
2689 /* No constant equal to EXP is known to have been output.
2690 Make a constant descriptor to enter EXP in the hash table.
2691 Assign the label number and record it in the descriptor for
2692 future calls to this function to find. */
2694 /* Create a string containing the label name, in LABEL. */
2695 labelno = const_labelno++;
2696 ASM_GENERATE_INTERNAL_LABEL (label, "LC", labelno);
2698 desc = ggc_alloc (sizeof (*desc));
2699 desc->next = const_hash_table[hash];
2700 desc->label = ggc_strdup (label);
2701 desc->value = copy_constant (exp);
2702 const_hash_table[hash] = desc;
2704 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2706 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)),
2707 gen_rtx_SYMBOL_REF (Pmode, desc->label));
2709 set_mem_attributes (rtl, exp, 1);
2710 set_mem_alias_set (rtl, 0);
2711 set_mem_alias_set (rtl, const_alias_set);
2718 if (TREE_CODE (exp) != INTEGER_CST)
2719 TREE_CST_RTL (exp) = rtl;
2721 /* Optionally set flags or add text to the name to record information
2722 such as that it is a function name. If the name is changed, the macro
2723 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2724 /* A previously-processed constant would already have section info
2728 /* Take care not to invoke targetm.encode_section_info for
2729 constants which don't have a TREE_CST_RTL. */
2730 if (TREE_CODE (exp) != INTEGER_CST)
2731 (*targetm.encode_section_info) (exp, true);
2734 desc->label = XSTR (XEXP (desc->rtl, 0), 0);
2737 #ifdef CONSTANT_AFTER_FUNCTION_P
2738 if (current_function_decl != 0
2739 && CONSTANT_AFTER_FUNCTION_P (exp))
2744 && STRING_POOL_ADDRESS_P (XEXP (rtl, 0))
2745 && (!defer || defer_addressed_constants_flag || after_function))
2747 defstr = (struct deferred_string **)
2748 htab_find_slot_with_hash (const_str_htab, desc->label,
2749 STRHASH (desc->label), NO_INSERT);
2752 /* If the string is currently deferred but we need to output it now,
2753 remove it from deferred string hash table. */
2755 labelno = (*defstr)->labelno;
2756 STRING_POOL_ADDRESS_P (XEXP (rtl, 0)) = 0;
2757 htab_clear_slot (const_str_htab, (void **) defstr);
2761 /* If this is the first time we've seen this particular constant,
2762 output it (or defer its output for later). */
2765 if (defer_addressed_constants_flag || after_function)
2767 struct deferred_constant *p
2768 = (struct deferred_constant *)
2769 xmalloc (sizeof (struct deferred_constant));
2771 p->exp = desc->value;
2773 p->labelno = labelno;
2776 p->next = after_function_constants;
2777 after_function_constants = p;
2781 p->next = deferred_constants;
2782 deferred_constants = p;
2787 /* Do no output if -fsyntax-only. */
2788 if (! flag_syntax_only)
2790 if (TREE_CODE (exp) != STRING_CST
2792 || flag_writable_strings
2793 || (defstr = (struct deferred_string **)
2794 htab_find_slot_with_hash (const_str_htab,
2796 STRHASH (desc->label),
2798 output_constant_def_contents (exp, reloc, labelno);
2801 struct deferred_string *p;
2803 p = (struct deferred_string *)
2804 ggc_alloc (sizeof (struct deferred_string));
2806 p->exp = desc->value;
2807 p->label = desc->label;
2808 p->labelno = labelno;
2810 STRING_POOL_ADDRESS_P (XEXP (rtl, 0)) = 1;
2819 /* Now output assembler code to define the label for EXP,
2820 and follow it with the data of EXP. */
2823 output_constant_def_contents (exp, reloc, labelno)
2831 /* Align the location counter as required by EXP's data type. */
2832 align = TYPE_ALIGN (TREE_TYPE (exp));
2833 #ifdef CONSTANT_ALIGNMENT
2834 align = CONSTANT_ALIGNMENT (exp, align);
2837 if (IN_NAMED_SECTION (exp))
2838 named_section (exp, NULL, reloc);
2840 (*targetm.asm_out.select_section) (exp, reloc, align);
2842 if (align > BITS_PER_UNIT)
2844 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2847 size = int_size_in_bytes (TREE_TYPE (exp));
2848 if (TREE_CODE (exp) == STRING_CST)
2849 size = MAX (TREE_STRING_LENGTH (exp), size);
2851 /* Do any machine/system dependent processing of the constant. */
2852 #ifdef ASM_DECLARE_CONSTANT_NAME
2855 ASM_GENERATE_INTERNAL_LABEL (label, "LC", labelno);
2856 ASM_DECLARE_CONSTANT_NAME (asm_out_file, label, exp, size);
2859 /* Standard thing is just output label for the constant. */
2860 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", labelno);
2861 #endif /* ASM_DECLARE_CONSTANT_NAME */
2863 /* Output the value of EXP. */
2864 output_constant (exp, size, align);
2867 /* Used in the hash tables to avoid outputting the same constant
2868 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2869 are output once per function, not once per file; there seems
2870 to be no reason for the difference. */
2872 struct constant_descriptor_rtx GTY(())
2874 /* More constant_descriptors with the same hash code. */
2875 struct constant_descriptor_rtx *next;
2877 /* A MEM for the constant. */
2880 /* The value of the constant. */
2881 struct rtx_const value;
2884 /* Structure to represent sufficient information about a constant so that
2885 it can be output when the constant pool is output, so that function
2886 integration can be done, and to simplify handling on machines that reference
2887 constant pool as base+displacement. */
2889 struct pool_constant GTY(())
2891 struct constant_descriptor_rtx *desc;
2892 struct pool_constant *next;
2893 struct pool_constant *next_sym;
2895 enum machine_mode mode;
2898 HOST_WIDE_INT offset;
2902 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2903 The argument is XSTR (... , 0) */
2905 #define SYMHASH(LABEL) (((unsigned long) (LABEL)) % MAX_RTX_HASH_TABLE)
2907 /* Initialize constant pool hashing for a new function. */
2910 init_varasm_status (f)
2913 struct varasm_status *p;
2914 p = (struct varasm_status *) ggc_alloc (sizeof (struct varasm_status));
2916 p->x_const_rtx_hash_table
2917 = ((struct constant_descriptor_rtx **)
2918 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2919 * sizeof (struct constant_descriptor_rtx *)));
2920 p->x_const_rtx_sym_hash_table
2921 = ((struct pool_constant **)
2922 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2923 * sizeof (struct pool_constant *)));
2925 p->x_first_pool = p->x_last_pool = 0;
2926 p->x_pool_offset = 0;
2930 /* Express an rtx for a constant integer (perhaps symbolic)
2931 as the sum of a symbol or label plus an explicit integer.
2932 They are stored into VALUE. */
2935 decode_rtx_const (mode, x, value)
2936 enum machine_mode mode;
2938 struct rtx_const *value;
2940 /* Clear the whole structure, including any gaps. */
2941 memset (value, 0, sizeof (struct rtx_const));
2943 value->kind = RTX_INT; /* Most usual kind. */
2946 switch (GET_CODE (x))
2949 value->kind = RTX_DOUBLE;
2950 if (GET_MODE (x) != VOIDmode)
2952 const REAL_VALUE_TYPE *r = CONST_DOUBLE_REAL_VALUE (x);
2954 value->mode = GET_MODE (x);
2956 /* Copy the REAL_VALUE_TYPE by members so that we don't
2957 copy garbage from the original structure into our
2958 carefully cleaned hashing structure. */
2959 value->un.du.class = r->class;
2960 value->un.du.sign = r->sign;
2967 value->un.du.exp = r->exp;
2970 memcpy (value->un.du.sig, r->sig, sizeof (r->sig));
2978 value->un.di.low = CONST_DOUBLE_LOW (x);
2979 value->un.di.high = CONST_DOUBLE_HIGH (x);
2987 units = CONST_VECTOR_NUNITS (x);
2988 value->kind = RTX_VECTOR;
2991 if (GET_MODE_CLASS (mode) == MODE_VECTOR_INT)
2993 for (i = 0; i < units; ++i)
2995 rtx elt = CONST_VECTOR_ELT (x, i);
2996 if (GET_CODE (elt) == CONST_INT)
2998 value->un.int_vec[i].low = INTVAL (elt);
2999 value->un.int_vec[i].high = 0;
3003 value->un.int_vec[i].low = CONST_DOUBLE_LOW (elt);
3004 value->un.int_vec[i].high = CONST_DOUBLE_HIGH (elt);
3008 else if (GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
3010 for (i = 0; i < units; ++i)
3012 const REAL_VALUE_TYPE *r
3013 = CONST_DOUBLE_REAL_VALUE (CONST_VECTOR_ELT (x, i));
3014 REAL_VALUE_TYPE *d = &value->un.fp_vec[i];
3016 /* Copy the REAL_VALUE_TYPE by members so that we don't
3017 copy garbage from the original structure into our
3018 carefully cleaned hashing structure. */
3019 d->class = r->class;
3030 memcpy (d->sig, r->sig, sizeof (r->sig));
3043 value->un.addr.offset = INTVAL (x);
3049 value->un.addr.base = x;
3054 if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 1)) == CONST_INT)
3056 value->un.addr.base = XEXP (x, 0);
3057 value->un.addr.offset = INTVAL (XEXP (x, 1));
3059 else if (GET_CODE (x) == MINUS && GET_CODE (XEXP (x, 1)) == CONST_INT)
3061 value->un.addr.base = XEXP (x, 0);
3062 value->un.addr.offset = - INTVAL (XEXP (x, 1));
3066 value->un.addr.base = x;
3067 value->un.addr.offset = 0;
3072 value->kind = RTX_UNKNOWN;
3076 if (value->kind == RTX_INT && value->un.addr.base != 0
3077 && GET_CODE (value->un.addr.base) == UNSPEC)
3079 /* For a simple UNSPEC, the base is set to the
3080 operand, the kind field is set to the index of
3081 the unspec expression.
3082 Together with the code below, in case that
3083 the operand is a SYMBOL_REF or LABEL_REF,
3084 the address of the string or the code_label
3085 is taken as base. */
3086 if (XVECLEN (value->un.addr.base, 0) == 1)
3088 value->kind = RTX_UNSPEC + XINT (value->un.addr.base, 1);
3089 value->un.addr.base = XVECEXP (value->un.addr.base, 0, 0);
3093 if (value->kind >= RTX_INT && value->un.addr.base != 0)
3094 switch (GET_CODE (value->un.addr.base))
3097 /* Use the string's address, not the SYMBOL_REF's address,
3098 for the sake of addresses of library routines. */
3099 value->un.addr.symbol = XSTR (value->un.addr.base, 0);
3100 value->un.addr.base = NULL_RTX;
3104 /* For a LABEL_REF, compare labels. */
3105 value->un.addr.base = XEXP (value->un.addr.base, 0);
3112 /* Given a MINUS expression, simplify it if both sides
3113 include the same symbol. */
3116 simplify_subtraction (x)
3119 struct rtx_const val0, val1;
3121 decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0);
3122 decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1);
3124 if (val0.kind >= RTX_INT
3125 && val0.kind == val1.kind
3126 && val0.un.addr.base == val1.un.addr.base
3127 && val0.un.addr.symbol == val1.un.addr.symbol)
3128 return GEN_INT (val0.un.addr.offset - val1.un.addr.offset);
3133 /* Compute a hash code for a constant RTL expression. */
3136 const_hash_rtx (mode, x)
3137 enum machine_mode mode;
3141 struct rtx_const value;
3142 unsigned int data[sizeof(struct rtx_const) / sizeof (unsigned int)];
3148 decode_rtx_const (mode, x, &u.value);
3150 /* Compute hashing function */
3152 for (i = 0; i < ARRAY_SIZE (u.data); i++)
3153 hi = hi * 613 + u.data[i];
3155 return hi % MAX_RTX_HASH_TABLE;
3158 /* Compare a constant rtl object X with a constant-descriptor DESC.
3159 Return 1 if DESC describes a constant with the same value as X. */
3162 compare_constant_rtx (mode, x, desc)
3163 enum machine_mode mode;
3165 struct constant_descriptor_rtx *desc;
3167 struct rtx_const value;
3169 decode_rtx_const (mode, x, &value);
3171 /* Compare constant contents. */
3172 return memcmp (&value, &desc->value, sizeof (struct rtx_const)) == 0;
3175 /* Construct a constant descriptor for the rtl-expression X.
3176 It is up to the caller to enter the descriptor in the hash table. */
3178 static struct constant_descriptor_rtx *
3179 record_constant_rtx (mode, x)
3180 enum machine_mode mode;
3183 struct constant_descriptor_rtx *ptr;
3185 ptr = (struct constant_descriptor_rtx *) ggc_alloc (sizeof (*ptr));
3186 decode_rtx_const (mode, x, &ptr->value);
3191 /* Given a constant rtx X, return a MEM for the location in memory at which
3192 this constant has been placed. Return 0 if it not has been placed yet. */
3195 mem_for_const_double (x)
3198 enum machine_mode mode = GET_MODE (x);
3199 struct constant_descriptor_rtx *desc;
3201 for (desc = const_rtx_hash_table[const_hash_rtx (mode, x)]; desc;
3203 if (compare_constant_rtx (mode, x, desc))
3209 /* Given a constant rtx X, make (or find) a memory constant for its value
3210 and return a MEM rtx to refer to it in memory. */
3213 force_const_mem (mode, x)
3214 enum machine_mode mode;
3218 struct constant_descriptor_rtx *desc;
3221 struct pool_constant *pool;
3224 /* If we're not allowed to drop X into the constant pool, don't. */
3225 if ((*targetm.cannot_force_const_mem) (x))
3228 /* Compute hash code of X. Search the descriptors for that hash code
3229 to see if any of them describes X. If yes, we have an rtx to use. */
3230 hash = const_hash_rtx (mode, x);
3231 for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next)
3232 if (compare_constant_rtx (mode, x, desc))
3235 /* No constant equal to X is known to have been output.
3236 Make a constant descriptor to enter X in the hash table
3237 and make a MEM for it. */
3238 desc = record_constant_rtx (mode, x);
3239 desc->next = const_rtx_hash_table[hash];
3240 const_rtx_hash_table[hash] = desc;
3242 /* Align the location counter as required by EXP's data type. */
3243 align = GET_MODE_ALIGNMENT (mode == VOIDmode ? word_mode : mode);
3244 #ifdef CONSTANT_ALIGNMENT
3245 align = CONSTANT_ALIGNMENT (make_tree ((*lang_hooks.types.type_for_mode)
3246 (mode, 0), x), align);
3249 pool_offset += (align / BITS_PER_UNIT) - 1;
3250 pool_offset &= ~ ((align / BITS_PER_UNIT) - 1);
3252 if (GET_CODE (x) == LABEL_REF)
3253 LABEL_PRESERVE_P (XEXP (x, 0)) = 1;
3255 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3256 pool = (struct pool_constant *) ggc_alloc (sizeof (struct pool_constant));
3260 pool->labelno = const_labelno;
3261 pool->align = align;
3262 pool->offset = pool_offset;
3269 last_pool->next = pool;
3272 pool_offset += GET_MODE_SIZE (mode);
3274 /* Create a string containing the label name, in LABEL. */
3275 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3279 /* Construct the SYMBOL_REF and the MEM. */
3281 pool->desc->rtl = def
3282 = gen_rtx_MEM (mode, gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label)));
3283 set_mem_alias_set (def, const_alias_set);
3284 set_mem_attributes (def, (*lang_hooks.types.type_for_mode) (mode, 0), 1);
3285 RTX_UNCHANGING_P (def) = 1;
3287 /* Add label to symbol hash table. */
3288 hash = SYMHASH (XSTR (XEXP (def, 0), 0));
3289 pool->next_sym = const_rtx_sym_hash_table[hash];
3290 const_rtx_sym_hash_table[hash] = pool;
3292 /* Mark the symbol_ref as belonging to this constants pool. */
3293 CONSTANT_POOL_ADDRESS_P (XEXP (def, 0)) = 1;
3294 current_function_uses_const_pool = 1;
3299 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3300 the corresponding pool_constant structure. */
3302 static struct pool_constant *
3303 find_pool_constant (f, addr)
3307 struct pool_constant *pool;
3308 const char *label = XSTR (addr, 0);
3310 for (pool = f->varasm->x_const_rtx_sym_hash_table[SYMHASH (label)]; pool;
3311 pool = pool->next_sym)
3312 if (XSTR (XEXP (pool->desc->rtl, 0), 0) == label)
3318 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3321 get_pool_constant (addr)
3324 return (find_pool_constant (cfun, addr))->constant;
3327 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3328 and whether it has been output or not. */
3331 get_pool_constant_mark (addr, pmarked)
3335 struct pool_constant *pool = find_pool_constant (cfun, addr);
3336 *pmarked = (pool->mark != 0);
3337 return pool->constant;
3340 /* Likewise, but for the constant pool of a specific function. */
3343 get_pool_constant_for_function (f, addr)
3347 return (find_pool_constant (f, addr))->constant;
3350 /* Similar, return the mode. */
3353 get_pool_mode (addr)
3356 return (find_pool_constant (cfun, addr))->mode;
3360 get_pool_mode_for_function (f, addr)
3364 return (find_pool_constant (f, addr))->mode;
3367 /* Similar, return the offset in the constant pool. */
3370 get_pool_offset (addr)
3373 return (find_pool_constant (cfun, addr))->offset;
3376 /* Return the size of the constant pool. */
3384 /* Write all the constants in the constant pool. */
3387 output_constant_pool (fnname, fndecl)
3388 const char *fnname ATTRIBUTE_UNUSED;
3389 tree fndecl ATTRIBUTE_UNUSED;
3391 struct pool_constant *pool;
3395 /* It is possible for gcc to call force_const_mem and then to later
3396 discard the instructions which refer to the constant. In such a
3397 case we do not need to output the constant. */
3398 mark_constant_pool ();
3400 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3401 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset);
3404 for (pool = first_pool; pool; pool = pool->next)
3413 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3414 whose CODE_LABEL has been deleted. This can occur if a jump table
3415 is eliminated by optimization. If so, write a constant of zero
3416 instead. Note that this can also happen by turning the
3417 CODE_LABEL into a NOTE. */
3418 /* ??? This seems completely and utterly wrong. Certainly it's
3419 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3420 functioning even with INSN_DELETED_P and friends. */
3423 switch (GET_CODE (x))
3426 if (GET_CODE (XEXP (x, 0)) != PLUS
3427 || GET_CODE (XEXP (XEXP (x, 0), 0)) != LABEL_REF)
3429 tmp = XEXP (XEXP (x, 0), 0);
3434 if (INSN_DELETED_P (tmp)
3435 || (GET_CODE (tmp) == NOTE
3436 && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_DELETED))
3447 /* First switch to correct section. */
3448 (*targetm.asm_out.select_rtx_section) (pool->mode, x, pool->align);
3450 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3451 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode,
3452 pool->align, pool->labelno, done);
3455 assemble_align (pool->align);
3457 /* Output the label. */
3458 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", pool->labelno);
3460 /* Output the value of the constant itself. */
3461 switch (GET_MODE_CLASS (pool->mode))
3464 if (GET_CODE (x) != CONST_DOUBLE)
3467 REAL_VALUE_FROM_CONST_DOUBLE (r, x);
3468 assemble_real (r, pool->mode, pool->align);
3472 case MODE_PARTIAL_INT:
3473 assemble_integer (x, GET_MODE_SIZE (pool->mode), pool->align, 1);
3476 case MODE_VECTOR_FLOAT:
3481 if (GET_CODE (x) != CONST_VECTOR)
3484 units = CONST_VECTOR_NUNITS (x);
3486 for (i = 0; i < units; i++)
3488 elt = CONST_VECTOR_ELT (x, i);
3489 REAL_VALUE_FROM_CONST_DOUBLE (r, elt);
3490 assemble_real (r, GET_MODE_INNER (pool->mode), pool->align);
3495 case MODE_VECTOR_INT:
3500 if (GET_CODE (x) != CONST_VECTOR)
3503 units = CONST_VECTOR_NUNITS (x);
3505 for (i = 0; i < units; i++)
3507 elt = CONST_VECTOR_ELT (x, i);
3508 assemble_integer (elt, GET_MODE_UNIT_SIZE (pool->mode),
3518 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3519 sections have proper size. */
3520 if (pool->align > GET_MODE_BITSIZE (pool->mode)
3521 && in_section == in_named
3522 && get_named_section_flags (in_named_name) & SECTION_MERGE)
3523 assemble_align (pool->align);
3525 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3530 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3531 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool_offset);
3534 /* Done with this pool. */
3535 first_pool = last_pool = 0;
3538 /* Look through the instructions for this function, and mark all the
3539 entries in the constant pool which are actually being used.
3540 Emit used deferred strings. */
3543 mark_constant_pool ()
3547 struct pool_constant *pool;
3549 if (first_pool == 0 && htab_elements (const_str_htab) == 0)
3552 for (pool = first_pool; pool; pool = pool->next)
3555 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3557 mark_constants (PATTERN (insn));
3559 for (link = current_function_epilogue_delay_list;
3561 link = XEXP (link, 1))
3563 insn = XEXP (link, 0);
3566 mark_constants (PATTERN (insn));
3570 /* Look through appropriate parts of X, marking all entries in the
3571 constant pool which are actually being used. Entries that are only
3572 referenced by other constants are also marked as used. Emit
3573 deferred strings that are used. */
3580 const char *format_ptr;
3585 if (GET_CODE (x) == SYMBOL_REF)
3587 mark_constant (&x, NULL);
3591 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3592 insns, not any notes that may be attached. We don't want to mark
3593 a constant just because it happens to appear in a REG_EQUIV note. */
3596 mark_constants (PATTERN (x));
3600 format_ptr = GET_RTX_FORMAT (GET_CODE (x));
3602 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (x)); i++)
3604 switch (*format_ptr++)
3607 mark_constants (XEXP (x, i));
3611 if (XVEC (x, i) != 0)
3615 for (j = 0; j < XVECLEN (x, i); j++)
3616 mark_constants (XVECEXP (x, i, j));
3636 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3637 to as used. Emit referenced deferred strings. This function can
3638 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3641 mark_constant (current_rtx, data)
3643 void *data ATTRIBUTE_UNUSED;
3645 rtx x = *current_rtx;
3650 else if (GET_CODE (x) == SYMBOL_REF)
3652 if (CONSTANT_POOL_ADDRESS_P (x))
3654 struct pool_constant *pool = find_pool_constant (cfun, x);
3655 if (pool->mark == 0)
3658 for_each_rtx (&(pool->constant), &mark_constant, NULL);
3663 else if (STRING_POOL_ADDRESS_P (x))
3665 struct deferred_string **defstr;
3667 defstr = (struct deferred_string **)
3668 htab_find_slot_with_hash (const_str_htab, XSTR (x, 0),
3669 STRHASH (XSTR (x, 0)), NO_INSERT);
3672 struct deferred_string *p = *defstr;
3674 STRING_POOL_ADDRESS_P (x) = 0;
3675 output_constant_def_contents (p->exp, 0, p->labelno);
3676 htab_clear_slot (const_str_htab, (void **) defstr);
3683 /* Find all the constants whose addresses are referenced inside of EXP,
3684 and make sure assembler code with a label has been output for each one.
3685 Indicate whether an ADDR_EXPR has been encountered. */
3688 output_addressed_constants (exp)
3691 int reloc = 0, reloc2;
3694 /* Give the front-end a chance to convert VALUE to something that
3695 looks more like a constant to the back-end. */
3696 exp = (*lang_hooks.expand_constant) (exp);
3698 switch (TREE_CODE (exp))
3702 /* Go inside any operations that get_inner_reference can handle and see
3703 if what's inside is a constant: no need to do anything here for
3704 addresses of variables or functions. */
3705 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
3706 tem = TREE_OPERAND (tem, 0))
3709 if (TREE_CODE_CLASS (TREE_CODE (tem)) == 'c'
3710 || TREE_CODE (tem) == CONSTRUCTOR)
3711 output_constant_def (tem, 0);
3713 if (TREE_PUBLIC (tem))
3720 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3721 reloc |= output_addressed_constants (TREE_OPERAND (exp, 1));
3725 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3726 reloc2 = output_addressed_constants (TREE_OPERAND (exp, 1));
3727 /* The difference of two local labels is computable at link time. */
3728 if (reloc == 1 && reloc2 == 1)
3736 case NON_LVALUE_EXPR:
3737 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3741 for (tem = CONSTRUCTOR_ELTS (exp); tem; tem = TREE_CHAIN (tem))
3742 if (TREE_VALUE (tem) != 0)
3743 reloc |= output_addressed_constants (TREE_VALUE (tem));
3753 /* Return nonzero if VALUE is a valid constant-valued expression
3754 for use in initializing a static variable; one that can be an
3755 element of a "constant" initializer.
3757 Return null_pointer_node if the value is absolute;
3758 if it is relocatable, return the variable that determines the relocation.
3759 We assume that VALUE has been folded as much as possible;
3760 therefore, we do not need to check for such things as
3761 arithmetic-combinations of integers. */
3764 initializer_constant_valid_p (value, endtype)
3768 /* Give the front-end a chance to convert VALUE to something that
3769 looks more like a constant to the back-end. */
3770 value = (*lang_hooks.expand_constant) (value);
3772 switch (TREE_CODE (value))
3775 if ((TREE_CODE (TREE_TYPE (value)) == UNION_TYPE
3776 || TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE)
3777 && TREE_CONSTANT (value)
3778 && CONSTRUCTOR_ELTS (value))
3781 bool absolute = true;
3783 for (elt = CONSTRUCTOR_ELTS (value); elt; elt = TREE_CHAIN (elt))
3786 value = TREE_VALUE (elt);
3787 reloc = initializer_constant_valid_p (value, TREE_TYPE (value));
3790 if (reloc != null_pointer_node)
3793 /* For a non-absolute relocation, there is no single
3794 variable that can be "the variable that determines the
3796 return absolute ? null_pointer_node : error_mark_node;
3799 return TREE_STATIC (value) ? null_pointer_node : NULL_TREE;
3806 return null_pointer_node;
3810 return staticp (TREE_OPERAND (value, 0)) ? TREE_OPERAND (value, 0) : 0;
3812 case VIEW_CONVERT_EXPR:
3813 case NON_LVALUE_EXPR:
3814 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3818 /* Allow conversions between pointer types. */
3819 if (POINTER_TYPE_P (TREE_TYPE (value))
3820 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3821 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3823 /* Allow conversions between real types. */
3824 if (FLOAT_TYPE_P (TREE_TYPE (value))
3825 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3826 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3828 /* Allow length-preserving conversions between integer types. */
3829 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3830 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3831 && (TYPE_PRECISION (TREE_TYPE (value))
3832 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3833 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3835 /* Allow conversions between other integer types only if
3837 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3838 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3840 tree inner = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3842 if (inner == null_pointer_node)
3843 return null_pointer_node;
3847 /* Allow (int) &foo provided int is as wide as a pointer. */
3848 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3849 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3850 && (TYPE_PRECISION (TREE_TYPE (value))
3851 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3852 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3855 /* Likewise conversions from int to pointers, but also allow
3856 conversions from 0. */
3857 if (POINTER_TYPE_P (TREE_TYPE (value))
3858 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3860 if (integer_zerop (TREE_OPERAND (value, 0)))
3861 return null_pointer_node;
3862 else if (TYPE_PRECISION (TREE_TYPE (value))
3863 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0))))
3864 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3868 /* Allow conversions to union types if the value inside is okay. */
3869 if (TREE_CODE (TREE_TYPE (value)) == UNION_TYPE)
3870 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3875 if (! INTEGRAL_TYPE_P (endtype)
3876 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3878 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3880 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3882 /* If either term is absolute, use the other terms relocation. */
3883 if (valid0 == null_pointer_node)
3885 if (valid1 == null_pointer_node)
3891 if (! INTEGRAL_TYPE_P (endtype)
3892 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3894 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3896 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3898 /* Win if second argument is absolute. */
3899 if (valid1 == null_pointer_node)
3901 /* Win if both arguments have the same relocation.
3902 Then the value is absolute. */
3903 if (valid0 == valid1 && valid0 != 0)
3904 return null_pointer_node;
3906 /* Since GCC guarantees that string constants are unique in the
3907 generated code, a subtraction between two copies of the same
3908 constant string is absolute. */
3909 if (valid0 && TREE_CODE (valid0) == STRING_CST &&
3910 valid1 && TREE_CODE (valid1) == STRING_CST &&
3911 TREE_STRING_POINTER (valid0) == TREE_STRING_POINTER (valid1))
3912 return null_pointer_node;
3915 /* Support differences between labels. */
3916 if (INTEGRAL_TYPE_P (endtype))
3919 op0 = TREE_OPERAND (value, 0);
3920 op1 = TREE_OPERAND (value, 1);
3922 /* Like STRIP_NOPS except allow the operand mode to widen.
3923 This works around a feature of fold that simplfies
3924 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3925 that the narrower operation is cheaper. */
3927 while (TREE_CODE (op0) == NOP_EXPR
3928 || TREE_CODE (op0) == CONVERT_EXPR
3929 || TREE_CODE (op0) == NON_LVALUE_EXPR)
3931 tree inner = TREE_OPERAND (op0, 0);
3932 if (inner == error_mark_node
3933 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3934 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0)))
3935 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3940 while (TREE_CODE (op1) == NOP_EXPR
3941 || TREE_CODE (op1) == CONVERT_EXPR
3942 || TREE_CODE (op1) == NON_LVALUE_EXPR)
3944 tree inner = TREE_OPERAND (op1, 0);
3945 if (inner == error_mark_node
3946 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3947 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1)))
3948 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3953 if (TREE_CODE (op0) == ADDR_EXPR
3954 && TREE_CODE (TREE_OPERAND (op0, 0)) == LABEL_DECL
3955 && TREE_CODE (op1) == ADDR_EXPR
3956 && TREE_CODE (TREE_OPERAND (op1, 0)) == LABEL_DECL)
3957 return null_pointer_node;
3968 /* Output assembler code for constant EXP to FILE, with no label.
3969 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3970 Assumes output_addressed_constants has been done on EXP already.
3972 Generate exactly SIZE bytes of assembler data, padding at the end
3973 with zeros if necessary. SIZE must always be specified.
3975 SIZE is important for structure constructors,
3976 since trailing members may have been omitted from the constructor.
3977 It is also important for initialization of arrays from string constants
3978 since the full length of the string constant might not be wanted.
3979 It is also needed for initialization of unions, where the initializer's
3980 type is just one member, and that may not be as long as the union.
3982 There a case in which we would fail to output exactly SIZE bytes:
3983 for a structure constructor that wants to produce more than SIZE bytes.
3984 But such constructors will never be generated for any possible input.
3986 ALIGN is the alignment of the data in bits. */
3989 output_constant (exp, size, align)
3994 enum tree_code code;
3995 HOST_WIDE_INT thissize;
3997 /* Some front-ends use constants other than the standard language-indepdent
3998 varieties, but which may still be output directly. Give the front-end a
3999 chance to convert EXP to a language-independent representation. */
4000 exp = (*lang_hooks.expand_constant) (exp);
4002 if (size == 0 || flag_syntax_only)
4005 /* Eliminate any conversions since we'll be outputting the underlying
4007 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
4008 || TREE_CODE (exp) == NON_LVALUE_EXPR
4009 || TREE_CODE (exp) == VIEW_CONVERT_EXPR)
4010 exp = TREE_OPERAND (exp, 0);
4012 code = TREE_CODE (TREE_TYPE (exp));
4013 thissize = int_size_in_bytes (TREE_TYPE (exp));
4015 /* Allow a constructor with no elements for any data type.
4016 This means to fill the space with zeros. */
4017 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
4019 assemble_zeros (size);
4023 if (TREE_CODE (exp) == FDESC_EXPR)
4025 #ifdef ASM_OUTPUT_FDESC
4026 HOST_WIDE_INT part = tree_low_cst (TREE_OPERAND (exp, 1), 0);
4027 tree decl = TREE_OPERAND (exp, 0);
4028 ASM_OUTPUT_FDESC (asm_out_file, decl, part);
4035 /* Now output the underlying data. If we've handling the padding, return.
4036 Otherwise, break and ensure THISSIZE is the size written. */
4044 case REFERENCE_TYPE:
4045 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
4046 EXPAND_INITIALIZER),
4048 error ("initializer for integer value is too complicated");
4052 if (TREE_CODE (exp) != REAL_CST)
4053 error ("initializer for floating value is not a floating constant");
4055 assemble_real (TREE_REAL_CST (exp),
4056 mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0),
4061 output_constant (TREE_REALPART (exp), thissize / 2, align);
4062 output_constant (TREE_IMAGPART (exp), thissize / 2,
4063 min_align (align, BITS_PER_UNIT * (thissize / 2)));
4068 if (TREE_CODE (exp) == CONSTRUCTOR)
4070 output_constructor (exp, size, align);
4073 else if (TREE_CODE (exp) == STRING_CST)
4075 thissize = MIN (TREE_STRING_LENGTH (exp), size);
4076 assemble_string (TREE_STRING_POINTER (exp), thissize);
4078 else if (TREE_CODE (exp) == VECTOR_CST)
4082 unsigned int nalign;
4083 enum machine_mode inner;
4085 inner = GET_MODE_INNER (TYPE_MODE (TREE_TYPE (exp)));
4086 nalign = MIN (align, GET_MODE_ALIGNMENT (inner));
4088 elt_size = GET_MODE_UNIT_SIZE (TYPE_MODE (TREE_TYPE (exp)));
4090 link = TREE_VECTOR_CST_ELTS (exp);
4091 output_constant (TREE_VALUE (link), elt_size, align);
4092 while ((link = TREE_CHAIN (link)) != NULL)
4093 output_constant (TREE_VALUE (link), elt_size, nalign);
4101 if (TREE_CODE (exp) == CONSTRUCTOR)
4102 output_constructor (exp, size, align);
4108 if (TREE_CODE (exp) == INTEGER_CST)
4109 assemble_integer (expand_expr (exp, NULL_RTX,
4110 VOIDmode, EXPAND_INITIALIZER),
4111 thissize, align, 1);
4112 else if (TREE_CODE (exp) == CONSTRUCTOR)
4114 unsigned char *buffer = (unsigned char *) alloca (thissize);
4115 if (get_set_constructor_bytes (exp, buffer, thissize))
4117 assemble_string ((char *) buffer, thissize);
4120 error ("unknown set constructor type");
4132 assemble_zeros (size);
4136 /* Subroutine of output_constructor, used for computing the size of
4137 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4138 type with an unspecified upper bound. */
4140 static unsigned HOST_WIDE_INT
4141 array_size_for_constructor (val)
4146 /* This code used to attempt to handle string constants that are not
4147 arrays of single-bytes, but nothing else does, so there's no point in
4149 if (TREE_CODE (val) == STRING_CST)
4150 return TREE_STRING_LENGTH (val);
4152 max_index = NULL_TREE;
4153 for (i = CONSTRUCTOR_ELTS (val); i; i = TREE_CHAIN (i))
4155 tree index = TREE_PURPOSE (i);
4157 if (TREE_CODE (index) == RANGE_EXPR)
4158 index = TREE_OPERAND (index, 1);
4159 if (max_index == NULL_TREE || tree_int_cst_lt (max_index, index))
4163 if (max_index == NULL_TREE)
4166 /* Compute the total number of array elements. */
4167 i = size_binop (MINUS_EXPR, convert (sizetype, max_index),
4169 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val)))));
4170 i = size_binop (PLUS_EXPR, i, convert (sizetype, integer_one_node));
4172 /* Multiply by the array element unit size to find number of bytes. */
4173 i = size_binop (MULT_EXPR, i, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val))));
4175 return tree_low_cst (i, 1);
4178 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4179 Generate at least SIZE bytes, padding if necessary. */
4182 output_constructor (exp, size, align)
4187 tree type = TREE_TYPE (exp);
4188 tree link, field = 0;
4190 /* Number of bytes output or skipped so far.
4191 In other words, current position within the constructor. */
4192 HOST_WIDE_INT total_bytes = 0;
4193 /* Non-zero means BYTE contains part of a byte, to be output. */
4194 int byte_buffer_in_use = 0;
4197 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
4200 if (TREE_CODE (type) == RECORD_TYPE)
4201 field = TYPE_FIELDS (type);
4203 if (TREE_CODE (type) == ARRAY_TYPE
4204 && TYPE_DOMAIN (type) != 0)
4205 min_index = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
4207 /* As LINK goes through the elements of the constant,
4208 FIELD goes through the structure fields, if the constant is a structure.
4209 if the constant is a union, then we override this,
4210 by getting the field from the TREE_LIST element.
4211 But the constant could also be an array. Then FIELD is zero.
4213 There is always a maximum of one element in the chain LINK for unions
4214 (even if the initializer in a source program incorrectly contains
4216 for (link = CONSTRUCTOR_ELTS (exp);
4218 link = TREE_CHAIN (link),
4219 field = field ? TREE_CHAIN (field) : 0)
4221 tree val = TREE_VALUE (link);
4224 /* The element in a union constructor specifies the proper field
4226 if ((TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
4227 || TREE_CODE (type) == QUAL_UNION_TYPE)
4228 && TREE_PURPOSE (link) != 0)
4229 field = TREE_PURPOSE (link);
4231 else if (TREE_CODE (type) == ARRAY_TYPE)
4232 index = TREE_PURPOSE (link);
4234 /* Eliminate the marker that makes a cast not be an lvalue. */
4238 if (index && TREE_CODE (index) == RANGE_EXPR)
4240 unsigned HOST_WIDE_INT fieldsize
4241 = int_size_in_bytes (TREE_TYPE (type));
4242 HOST_WIDE_INT lo_index = tree_low_cst (TREE_OPERAND (index, 0), 0);
4243 HOST_WIDE_INT hi_index = tree_low_cst (TREE_OPERAND (index, 1), 0);
4244 HOST_WIDE_INT index;
4245 unsigned int align2 = min_align (align, fieldsize * BITS_PER_UNIT);
4247 for (index = lo_index; index <= hi_index; index++)
4249 /* Output the element's initial value. */
4251 assemble_zeros (fieldsize);
4253 output_constant (val, fieldsize, align2);
4255 /* Count its size. */
4256 total_bytes += fieldsize;
4259 else if (field == 0 || !DECL_BIT_FIELD (field))
4261 /* An element that is not a bit-field. */
4263 unsigned HOST_WIDE_INT fieldsize;
4264 /* Since this structure is static,
4265 we know the positions are constant. */
4266 HOST_WIDE_INT pos = field ? int_byte_position (field) : 0;
4267 unsigned int align2;
4270 pos = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val)), 1)
4271 * (tree_low_cst (index, 0) - tree_low_cst (min_index, 0)));
4273 /* Output any buffered-up bit-fields preceding this element. */
4274 if (byte_buffer_in_use)
4276 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4278 byte_buffer_in_use = 0;
4281 /* Advance to offset of this element.
4282 Note no alignment needed in an array, since that is guaranteed
4283 if each element has the proper size. */
4284 if ((field != 0 || index != 0) && pos != total_bytes)
4286 assemble_zeros (pos - total_bytes);
4290 /* Find the alignment of this element. */
4291 align2 = min_align (align, BITS_PER_UNIT * pos);
4293 /* Determine size this element should occupy. */
4298 /* If this is an array with an unspecified upper bound,
4299 the initializer determines the size. */
4300 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4301 but we cannot do this until the deprecated support for
4302 initializing zero-length array members is removed. */
4303 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE
4304 && TYPE_DOMAIN (TREE_TYPE (field))
4305 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field))))
4307 fieldsize = array_size_for_constructor (val);
4308 /* Given a non-empty initialization, this field had
4310 if (fieldsize != 0 && TREE_CHAIN (field) != NULL_TREE)
4313 else if (DECL_SIZE_UNIT (field))
4315 /* ??? This can't be right. If the decl size overflows
4316 a host integer we will silently emit no data. */
4317 if (host_integerp (DECL_SIZE_UNIT (field), 1))
4318 fieldsize = tree_low_cst (DECL_SIZE_UNIT (field), 1);
4322 fieldsize = int_size_in_bytes (TREE_TYPE (type));
4324 /* Output the element's initial value. */
4326 assemble_zeros (fieldsize);
4328 output_constant (val, fieldsize, align2);
4330 /* Count its size. */
4331 total_bytes += fieldsize;
4333 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
4334 error ("invalid initial value for member `%s'",
4335 IDENTIFIER_POINTER (DECL_NAME (field)));
4338 /* Element that is a bit-field. */
4340 HOST_WIDE_INT next_offset = int_bit_position (field);
4341 HOST_WIDE_INT end_offset
4342 = (next_offset + tree_low_cst (DECL_SIZE (field), 1));
4345 val = integer_zero_node;
4347 /* If this field does not start in this (or, next) byte,
4349 if (next_offset / BITS_PER_UNIT != total_bytes)
4351 /* Output remnant of any bit field in previous bytes. */
4352 if (byte_buffer_in_use)
4354 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4356 byte_buffer_in_use = 0;
4359 /* If still not at proper byte, advance to there. */
4360 if (next_offset / BITS_PER_UNIT != total_bytes)
4362 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
4363 total_bytes = next_offset / BITS_PER_UNIT;
4367 if (! byte_buffer_in_use)
4370 /* We must split the element into pieces that fall within
4371 separate bytes, and combine each byte with previous or
4372 following bit-fields. */
4374 /* next_offset is the offset n fbits from the beginning of
4375 the structure to the next bit of this element to be processed.
4376 end_offset is the offset of the first bit past the end of
4378 while (next_offset < end_offset)
4382 HOST_WIDE_INT value;
4383 HOST_WIDE_INT next_byte = next_offset / BITS_PER_UNIT;
4384 HOST_WIDE_INT next_bit = next_offset % BITS_PER_UNIT;
4386 /* Advance from byte to byte
4387 within this element when necessary. */
4388 while (next_byte != total_bytes)
4390 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4395 /* Number of bits we can process at once
4396 (all part of the same byte). */
4397 this_time = MIN (end_offset - next_offset,
4398 BITS_PER_UNIT - next_bit);
4399 if (BYTES_BIG_ENDIAN)
4401 /* On big-endian machine, take the most significant bits
4402 first (of the bits that are significant)
4403 and put them into bytes from the most significant end. */
4404 shift = end_offset - next_offset - this_time;
4406 /* Don't try to take a bunch of bits that cross
4407 the word boundary in the INTEGER_CST. We can
4408 only select bits from the LOW or HIGH part
4410 if (shift < HOST_BITS_PER_WIDE_INT
4411 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4413 this_time = shift + this_time - HOST_BITS_PER_WIDE_INT;
4414 shift = HOST_BITS_PER_WIDE_INT;
4417 /* Now get the bits from the appropriate constant word. */
4418 if (shift < HOST_BITS_PER_WIDE_INT)
4419 value = TREE_INT_CST_LOW (val);
4420 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4422 value = TREE_INT_CST_HIGH (val);
4423 shift -= HOST_BITS_PER_WIDE_INT;
4428 /* Get the result. This works only when:
4429 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4430 byte |= (((value >> shift)
4431 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4432 << (BITS_PER_UNIT - this_time - next_bit));
4436 /* On little-endian machines,
4437 take first the least significant bits of the value
4438 and pack them starting at the least significant
4439 bits of the bytes. */
4440 shift = next_offset - int_bit_position (field);
4442 /* Don't try to take a bunch of bits that cross
4443 the word boundary in the INTEGER_CST. We can
4444 only select bits from the LOW or HIGH part
4446 if (shift < HOST_BITS_PER_WIDE_INT
4447 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4448 this_time = (HOST_BITS_PER_WIDE_INT - shift);
4450 /* Now get the bits from the appropriate constant word. */
4451 if (shift < HOST_BITS_PER_WIDE_INT)
4452 value = TREE_INT_CST_LOW (val);
4453 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4455 value = TREE_INT_CST_HIGH (val);
4456 shift -= HOST_BITS_PER_WIDE_INT;
4461 /* Get the result. This works only when:
4462 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4463 byte |= (((value >> shift)
4464 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4468 next_offset += this_time;
4469 byte_buffer_in_use = 1;
4474 if (byte_buffer_in_use)
4476 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4480 if (total_bytes < size)
4481 assemble_zeros (size - total_bytes);
4484 /* This TREE_LIST contains any weak symbol declarations waiting
4486 static GTY(()) tree weak_decls;
4488 /* Mark DECL as weak. */
4494 DECL_WEAK (decl) = 1;
4496 if (DECL_RTL_SET_P (decl)
4497 && GET_CODE (DECL_RTL (decl)) == MEM
4498 && XEXP (DECL_RTL (decl), 0)
4499 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == SYMBOL_REF)
4500 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl), 0)) = 1;
4503 /* Merge weak status between NEWDECL and OLDDECL. */
4506 merge_weak (newdecl, olddecl)
4510 if (DECL_WEAK (newdecl) == DECL_WEAK (olddecl))
4513 if (DECL_WEAK (newdecl))
4517 /* NEWDECL is weak, but OLDDECL is not. */
4519 /* If we already output the OLDDECL, we're in trouble; we can't
4520 go back and make it weak. This error cannot caught in
4521 declare_weak because the NEWDECL and OLDDECL was not yet
4522 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4523 if (TREE_ASM_WRITTEN (olddecl))
4524 error_with_decl (newdecl,
4525 "weak declaration of `%s' must precede definition");
4527 /* If we've already generated rtl referencing OLDDECL, we may
4528 have done so in a way that will not function properly with
4530 else if (TREE_USED (olddecl)
4531 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl)))
4532 warning_with_decl (newdecl, "weak declaration of `%s' after first use results in unspecified behavior");
4536 /* We put the NEWDECL on the weak_decls list at some point.
4537 Replace it with the OLDDECL. */
4538 for (wd = weak_decls; wd; wd = TREE_CHAIN (wd))
4539 if (TREE_VALUE (wd) == newdecl)
4541 TREE_VALUE (wd) = olddecl;
4544 /* We may not find the entry on the list. If NEWDECL is a
4545 weak alias, then we will have already called
4546 globalize_decl to remove the entry; in that case, we do
4547 not need to do anything. */
4550 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4551 mark_weak (olddecl);
4554 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4555 weak. Just update NEWDECL to indicate that it's weak too. */
4556 mark_weak (newdecl);
4559 /* Declare DECL to be a weak symbol. */
4565 if (! TREE_PUBLIC (decl))
4566 error_with_decl (decl, "weak declaration of `%s' must be public");
4567 else if (TREE_CODE (decl) == FUNCTION_DECL && TREE_ASM_WRITTEN (decl))
4568 error_with_decl (decl, "weak declaration of `%s' must precede definition");
4569 else if (SUPPORTS_WEAK)
4571 if (! DECL_WEAK (decl))
4572 weak_decls = tree_cons (NULL, decl, weak_decls);
4575 warning_with_decl (decl, "weak declaration of `%s' not supported");
4580 /* Emit any pending weak declarations. */
4587 for (t = weak_decls; t; t = TREE_CHAIN (t))
4589 tree decl = TREE_VALUE (t);
4590 const char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4592 if (! TREE_USED (decl))
4595 #ifdef ASM_WEAKEN_DECL
4596 ASM_WEAKEN_DECL (asm_out_file, decl, name, NULL);
4598 #ifdef ASM_WEAKEN_LABEL
4599 ASM_WEAKEN_LABEL (asm_out_file, name);
4601 #ifdef ASM_OUTPUT_WEAK_ALIAS
4602 warning ("only weak aliases are supported in this configuration");
4610 /* Emit the assembly bits to indicate that DECL is globally visible. */
4613 globalize_decl (decl)
4616 const char *name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4618 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4619 if (DECL_WEAK (decl))
4623 #ifdef ASM_WEAKEN_DECL
4624 ASM_WEAKEN_DECL (asm_out_file, decl, name, 0);
4626 ASM_WEAKEN_LABEL (asm_out_file, name);
4629 /* Remove this function from the pending weak list so that
4630 we do not emit multiple .weak directives for it. */
4631 for (p = &weak_decls; (t = *p) ; )
4633 if (DECL_ASSEMBLER_NAME (decl) == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
4634 *p = TREE_CHAIN (t);
4636 p = &TREE_CHAIN (t);
4642 (*targetm.asm_out.globalize_label) (asm_out_file, name);
4645 /* Emit an assembler directive to make the symbol for DECL an alias to
4646 the symbol for TARGET. */
4649 assemble_alias (decl, target)
4650 tree decl, target ATTRIBUTE_UNUSED;
4654 /* We must force creation of DECL_RTL for debug info generation, even though
4655 we don't use it here. */
4656 make_decl_rtl (decl, NULL);
4658 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4660 #ifdef ASM_OUTPUT_DEF
4661 /* Make name accessible from other files, if appropriate. */
4663 if (TREE_PUBLIC (decl))
4665 globalize_decl (decl);
4666 maybe_assemble_visibility (decl);
4669 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4670 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
4672 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4674 #else /* !ASM_OUTPUT_DEF */
4675 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4676 if (! DECL_WEAK (decl))
4677 warning ("only weak aliases are supported in this configuration");
4679 #ifdef ASM_WEAKEN_DECL
4680 ASM_WEAKEN_DECL (asm_out_file, decl, name, IDENTIFIER_POINTER (target));
4682 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
4685 warning ("alias definitions not supported in this configuration; ignored");
4689 TREE_USED (decl) = 1;
4690 TREE_ASM_WRITTEN (decl) = 1;
4691 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl)) = 1;
4694 /* Emit an assembler directive to set symbol for DECL visibility to
4695 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4698 default_assemble_visibility (decl, vis)
4702 static const char * const visibility_types[] = {
4703 NULL, "internal", "hidden", "protected"
4706 const char *name, *type;
4708 name = (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
4709 type = visibility_types[vis];
4711 #ifdef HAVE_GAS_HIDDEN
4712 fprintf (asm_out_file, "\t.%s\t", type);
4713 assemble_name (asm_out_file, name);
4714 fprintf (asm_out_file, "\n");
4716 warning ("visibility attribute not supported in this configuration; ignored");
4720 /* A helper function to call assemble_visibility when needed for a decl. */
4723 maybe_assemble_visibility (decl)
4726 enum symbol_visibility vis = decl_visibility (decl);
4728 if (vis != VISIBILITY_DEFAULT)
4729 (* targetm.asm_out.visibility) (decl, vis);
4732 /* Returns 1 if the target configuration supports defining public symbols
4733 so that one of them will be chosen at link time instead of generating a
4734 multiply-defined symbol error, whether through the use of weak symbols or
4735 a target-specific mechanism for having duplicates discarded. */
4738 supports_one_only ()
4740 if (SUPPORTS_ONE_ONLY)
4742 return SUPPORTS_WEAK;
4745 /* Set up DECL as a public symbol that can be defined in multiple
4746 translation units without generating a linker error. */
4749 make_decl_one_only (decl)
4752 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL)
4755 TREE_PUBLIC (decl) = 1;
4757 if (TREE_CODE (decl) == VAR_DECL
4758 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
4759 DECL_COMMON (decl) = 1;
4760 else if (SUPPORTS_ONE_ONLY)
4762 #ifdef MAKE_DECL_ONE_ONLY
4763 MAKE_DECL_ONE_ONLY (decl);
4765 DECL_ONE_ONLY (decl) = 1;
4767 else if (SUPPORTS_WEAK)
4768 DECL_WEAK (decl) = 1;
4776 const_str_htab = htab_create_ggc (128, const_str_htab_hash,
4777 const_str_htab_eq, NULL);
4778 in_named_htab = htab_create (31, in_named_entry_hash,
4779 in_named_entry_eq, NULL);
4781 const_alias_set = new_alias_set ();
4785 decl_tls_model (decl)
4788 enum tls_model kind;
4789 tree attr = lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl));
4794 attr = TREE_VALUE (TREE_VALUE (attr));
4795 if (TREE_CODE (attr) != STRING_CST)
4797 if (!strcmp (TREE_STRING_POINTER (attr), "local-exec"))
4798 kind = TLS_MODEL_LOCAL_EXEC;
4799 else if (!strcmp (TREE_STRING_POINTER (attr), "initial-exec"))
4800 kind = TLS_MODEL_INITIAL_EXEC;
4801 else if (!strcmp (TREE_STRING_POINTER (attr), "local-dynamic"))
4802 kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
4803 else if (!strcmp (TREE_STRING_POINTER (attr), "global-dynamic"))
4804 kind = TLS_MODEL_GLOBAL_DYNAMIC;
4810 is_local = (*targetm.binds_local_p) (decl);
4814 kind = TLS_MODEL_LOCAL_EXEC;
4816 kind = TLS_MODEL_INITIAL_EXEC;
4818 /* Local dynamic is inefficient when we're not combining the
4819 parts of the address. */
4820 else if (optimize && is_local)
4821 kind = TLS_MODEL_LOCAL_DYNAMIC;
4823 kind = TLS_MODEL_GLOBAL_DYNAMIC;
4824 if (kind < flag_tls_default)
4825 kind = flag_tls_default;
4830 enum symbol_visibility
4831 decl_visibility (decl)
4834 tree attr = lookup_attribute ("visibility", DECL_ATTRIBUTES (decl));
4838 const char *which = TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr)));
4840 if (strcmp (which, "default") == 0)
4841 return VISIBILITY_DEFAULT;
4842 if (strcmp (which, "internal") == 0)
4843 return VISIBILITY_INTERNAL;
4844 if (strcmp (which, "hidden") == 0)
4845 return VISIBILITY_HIDDEN;
4846 if (strcmp (which, "protected") == 0)
4847 return VISIBILITY_PROTECTED;
4852 return VISIBILITY_DEFAULT;
4855 /* Select a set of attributes for section NAME based on the properties
4856 of DECL and whether or not RELOC indicates that DECL's initializer
4857 might contain runtime relocations.
4859 We make the section read-only and executable for a function decl,
4860 read-only for a const data decl, and writable for a non-const data decl. */
4863 default_section_type_flags (decl, name, reloc)
4868 return default_section_type_flags_1 (decl, name, reloc, flag_pic);
4872 default_section_type_flags_1 (decl, name, reloc, shlib)
4880 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
4881 flags = SECTION_CODE;
4882 else if (decl && decl_readonly_section_1 (decl, reloc, shlib))
4885 flags = SECTION_WRITE;
4887 if (decl && DECL_ONE_ONLY (decl))
4888 flags |= SECTION_LINKONCE;
4890 if (decl && TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4891 flags |= SECTION_TLS | SECTION_WRITE;
4893 if (strcmp (name, ".bss") == 0
4894 || strncmp (name, ".bss.", 5) == 0
4895 || strncmp (name, ".gnu.linkonce.b.", 16) == 0
4896 || strcmp (name, ".sbss") == 0
4897 || strncmp (name, ".sbss.", 6) == 0
4898 || strncmp (name, ".gnu.linkonce.sb.", 17) == 0
4899 || strcmp (name, ".tbss") == 0
4900 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4901 flags |= SECTION_BSS;
4903 if (strcmp (name, ".tdata") == 0
4904 || strcmp (name, ".tbss") == 0
4905 || strncmp (name, ".gnu.linkonce.td.", 17) == 0
4906 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4907 flags |= SECTION_TLS;
4909 /* These three sections have special ELF types. They are neither
4910 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4911 want to print a section type (@progbits or @nobits). If someone
4912 is silly enough to emit code or TLS variables to one of these
4913 sections, then don't handle them specially. */
4914 if (!(flags & (SECTION_CODE | SECTION_BSS | SECTION_TLS))
4915 && (strcmp (name, ".init_array") == 0
4916 || strcmp (name, ".fini_array") == 0
4917 || strcmp (name, ".preinit_array") == 0))
4918 flags |= SECTION_NOTYPE;
4923 /* Output assembly to switch to section NAME with attribute FLAGS.
4924 Four variants for common object file formats. */
4927 default_no_named_section (name, flags)
4928 const char *name ATTRIBUTE_UNUSED;
4929 unsigned int flags ATTRIBUTE_UNUSED;
4931 /* Some object formats don't support named sections at all. The
4932 front-end should already have flagged this as an error. */
4937 default_elf_asm_named_section (name, flags)
4941 char flagchars[10], *f = flagchars;
4943 if (! named_section_first_declaration (name))
4945 fprintf (asm_out_file, "\t.section\t%s\n", name);
4949 if (!(flags & SECTION_DEBUG))
4951 if (flags & SECTION_WRITE)
4953 if (flags & SECTION_CODE)
4955 if (flags & SECTION_SMALL)
4957 if (flags & SECTION_MERGE)
4959 if (flags & SECTION_STRINGS)
4961 if (flags & SECTION_TLS)
4965 fprintf (asm_out_file, "\t.section\t%s,\"%s\"", name, flagchars);
4967 if (!(flags & SECTION_NOTYPE))
4971 if (flags & SECTION_BSS)
4976 fprintf (asm_out_file, ",@%s", type);
4978 if (flags & SECTION_ENTSIZE)
4979 fprintf (asm_out_file, ",%d", flags & SECTION_ENTSIZE);
4982 putc ('\n', asm_out_file);
4986 default_coff_asm_named_section (name, flags)
4990 char flagchars[8], *f = flagchars;
4992 if (flags & SECTION_WRITE)
4994 if (flags & SECTION_CODE)
4998 fprintf (asm_out_file, "\t.section\t%s,\"%s\"\n", name, flagchars);
5002 default_pe_asm_named_section (name, flags)
5006 default_coff_asm_named_section (name, flags);
5008 if (flags & SECTION_LINKONCE)
5010 /* Functions may have been compiled at various levels of
5011 optimization so we can't use `same_size' here.
5012 Instead, have the linker pick one. */
5013 fprintf (asm_out_file, "\t.linkonce %s\n",
5014 (flags & SECTION_CODE ? "discard" : "same_size"));
5018 /* Used for vtable gc in GNU binutils. Record that the pointer at OFFSET
5019 from SYMBOL is used in all classes derived from SYMBOL. */
5022 assemble_vtable_entry (symbol, offset)
5024 HOST_WIDE_INT offset;
5026 fputs ("\t.vtable_entry ", asm_out_file);
5027 output_addr_const (asm_out_file, symbol);
5028 fputs (", ", asm_out_file);
5029 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC, offset);
5030 fputc ('\n', asm_out_file);
5033 /* Used for vtable gc in GNU binutils. Record the class hierarchy by noting
5034 that the vtable symbol CHILD is derived from the vtable symbol PARENT. */
5037 assemble_vtable_inherit (child, parent)
5040 fputs ("\t.vtable_inherit ", asm_out_file);
5041 output_addr_const (asm_out_file, child);
5042 fputs (", ", asm_out_file);
5043 output_addr_const (asm_out_file, parent);
5044 fputc ('\n', asm_out_file);
5047 /* The lame default section selector. */
5050 default_select_section (decl, reloc, align)
5053 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED;
5055 bool readonly = false;
5059 if (decl_readonly_section (decl, reloc))
5062 else if (TREE_CODE (decl) == CONSTRUCTOR)
5064 if (! ((flag_pic && reloc)
5065 || !TREE_READONLY (decl)
5066 || TREE_SIDE_EFFECTS (decl)
5067 || !TREE_CONSTANT (decl)))
5070 else if (TREE_CODE (decl) == STRING_CST)
5071 readonly = !flag_writable_strings;
5072 else if (! (flag_pic && reloc))
5076 readonly_data_section ();
5081 /* A helper function for default_elf_select_section and
5082 default_elf_unique_section. Categorizes the DECL. */
5084 enum section_category
5089 SECCAT_RODATA_MERGE_STR,
5090 SECCAT_RODATA_MERGE_STR_INIT,
5091 SECCAT_RODATA_MERGE_CONST,
5096 /* To optimize loading of shared programs, define following subsections
5098 _REL Contains data that has relocations, so they get grouped
5099 together and dynamic linker will visit fewer pages in memory.
5100 _RO Contains data that is otherwise read-only. This is useful
5101 with prelinking as most relocations won't be dynamically
5102 linked and thus stay read only.
5103 _LOCAL Marks data containing relocations only to local objects.
5104 These relocations will get fully resolved by prelinking. */
5106 SECCAT_DATA_REL_LOCAL,
5108 SECCAT_DATA_REL_RO_LOCAL,
5118 static enum section_category
5119 categorize_decl_for_section PARAMS ((tree, int, int));
5121 static enum section_category
5122 categorize_decl_for_section (decl, reloc, shlib)
5127 enum section_category ret;
5129 if (TREE_CODE (decl) == FUNCTION_DECL)
5131 else if (TREE_CODE (decl) == STRING_CST)
5133 if (flag_writable_strings)
5136 return SECCAT_RODATA_MERGE_STR;
5138 else if (TREE_CODE (decl) == VAR_DECL)
5140 if (DECL_INITIAL (decl) == NULL
5141 || DECL_INITIAL (decl) == error_mark_node)
5143 else if (! TREE_READONLY (decl)
5144 || TREE_SIDE_EFFECTS (decl)
5145 || ! TREE_CONSTANT (DECL_INITIAL (decl)))
5147 if (shlib && (reloc & 2))
5148 ret = SECCAT_DATA_REL;
5149 else if (shlib && reloc)
5150 ret = SECCAT_DATA_REL_LOCAL;
5154 else if (shlib && (reloc & 2))
5155 ret = SECCAT_DATA_REL_RO;
5156 else if (shlib && reloc)
5157 ret = SECCAT_DATA_REL_RO_LOCAL;
5158 else if (reloc || flag_merge_constants < 2)
5159 /* C and C++ don't allow different variables to share the same
5160 location. -fmerge-all-constants allows even that (at the
5161 expense of not conforming). */
5162 ret = SECCAT_RODATA;
5163 else if (TREE_CODE (DECL_INITIAL (decl)) == STRING_CST)
5164 ret = SECCAT_RODATA_MERGE_STR_INIT;
5166 ret = SECCAT_RODATA_MERGE_CONST;
5168 else if (TREE_CODE (decl) == CONSTRUCTOR)
5170 if ((shlib && reloc)
5171 || TREE_SIDE_EFFECTS (decl)
5172 || ! TREE_CONSTANT (decl))
5175 ret = SECCAT_RODATA;
5178 ret = SECCAT_RODATA;
5180 /* There are no read-only thread-local sections. */
5181 if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
5183 if (ret == SECCAT_BSS)
5189 /* If the target uses small data sections, select it. */
5190 else if ((*targetm.in_small_data_p) (decl))
5192 if (ret == SECCAT_BSS)
5194 else if (targetm.have_srodata_section && ret == SECCAT_RODATA)
5195 ret = SECCAT_SRODATA;
5204 decl_readonly_section (decl, reloc)
5208 return decl_readonly_section_1 (decl, reloc, flag_pic);
5212 decl_readonly_section_1 (decl, reloc, shlib)
5217 switch (categorize_decl_for_section (decl, reloc, shlib))
5220 case SECCAT_RODATA_MERGE_STR:
5221 case SECCAT_RODATA_MERGE_STR_INIT:
5222 case SECCAT_RODATA_MERGE_CONST:
5223 case SECCAT_SRODATA:
5232 /* Select a section based on the above categorization. */
5235 default_elf_select_section (decl, reloc, align)
5238 unsigned HOST_WIDE_INT align;
5240 default_elf_select_section_1 (decl, reloc, align, flag_pic);
5244 default_elf_select_section_1 (decl, reloc, align, shlib)
5247 unsigned HOST_WIDE_INT align;
5250 switch (categorize_decl_for_section (decl, reloc, shlib))
5253 /* We're not supposed to be called on FUNCTION_DECLs. */
5256 readonly_data_section ();
5258 case SECCAT_RODATA_MERGE_STR:
5259 mergeable_string_section (decl, align, 0);
5261 case SECCAT_RODATA_MERGE_STR_INIT:
5262 mergeable_string_section (DECL_INITIAL (decl), align, 0);
5264 case SECCAT_RODATA_MERGE_CONST:
5265 mergeable_constant_section (DECL_MODE (decl), align, 0);
5267 case SECCAT_SRODATA:
5268 named_section (NULL_TREE, ".sdata2", reloc);
5273 case SECCAT_DATA_REL:
5274 named_section (NULL_TREE, ".data.rel", reloc);
5276 case SECCAT_DATA_REL_LOCAL:
5277 named_section (NULL_TREE, ".data.rel.local", reloc);
5279 case SECCAT_DATA_REL_RO:
5280 named_section (NULL_TREE, ".data.rel.ro", reloc);
5282 case SECCAT_DATA_REL_RO_LOCAL:
5283 named_section (NULL_TREE, ".data.rel.ro.local", reloc);
5286 named_section (NULL_TREE, ".sdata", reloc);
5289 named_section (NULL_TREE, ".tdata", reloc);
5292 #ifdef BSS_SECTION_ASM_OP
5295 named_section (NULL_TREE, ".bss", reloc);
5299 named_section (NULL_TREE, ".sbss", reloc);
5302 named_section (NULL_TREE, ".tbss", reloc);
5309 /* Construct a unique section name based on the decl name and the
5310 categorization performed above. */
5313 default_unique_section (decl, reloc)
5317 default_unique_section_1 (decl, reloc, flag_pic);
5321 default_unique_section_1 (decl, reloc, shlib)
5326 bool one_only = DECL_ONE_ONLY (decl);
5327 const char *prefix, *name;
5331 switch (categorize_decl_for_section (decl, reloc, shlib))
5334 prefix = one_only ? ".gnu.linkonce.t." : ".text.";
5337 case SECCAT_RODATA_MERGE_STR:
5338 case SECCAT_RODATA_MERGE_STR_INIT:
5339 case SECCAT_RODATA_MERGE_CONST:
5340 prefix = one_only ? ".gnu.linkonce.r." : ".rodata.";
5342 case SECCAT_SRODATA:
5343 prefix = one_only ? ".gnu.linkonce.s2." : ".sdata2.";
5346 case SECCAT_DATA_REL:
5347 case SECCAT_DATA_REL_LOCAL:
5348 case SECCAT_DATA_REL_RO:
5349 case SECCAT_DATA_REL_RO_LOCAL:
5350 prefix = one_only ? ".gnu.linkonce.d." : ".data.";
5353 prefix = one_only ? ".gnu.linkonce.s." : ".sdata.";
5356 prefix = one_only ? ".gnu.linkonce.b." : ".bss.";
5359 prefix = one_only ? ".gnu.linkonce.sb." : ".sbss.";
5362 prefix = one_only ? ".gnu.linkonce.td." : ".tdata.";
5365 prefix = one_only ? ".gnu.linkonce.tb." : ".tbss.";
5370 plen = strlen (prefix);
5372 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
5373 name = (* targetm.strip_name_encoding) (name);
5374 nlen = strlen (name);
5376 string = alloca (nlen + plen + 1);
5377 memcpy (string, prefix, plen);
5378 memcpy (string + plen, name, nlen + 1);
5380 DECL_SECTION_NAME (decl) = build_string (nlen + plen, string);
5384 default_select_rtx_section (mode, x, align)
5385 enum machine_mode mode ATTRIBUTE_UNUSED;
5387 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED;
5390 switch (GET_CODE (x))
5402 readonly_data_section ();
5406 default_elf_select_rtx_section (mode, x, align)
5407 enum machine_mode mode;
5409 unsigned HOST_WIDE_INT align;
5411 /* ??? Handle small data here somehow. */
5414 switch (GET_CODE (x))
5418 named_section (NULL_TREE, ".data.rel.ro", 3);
5422 named_section (NULL_TREE, ".data.rel.ro.local", 1);
5429 mergeable_constant_section (mode, align, 0);
5432 /* By default, we do nothing for encode_section_info, so we need not
5433 do anything but discard the '*' marker. */
5436 default_strip_name_encoding (str)
5439 return str + (*str == '*');
5442 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5443 wrt cross-module name binding. */
5446 default_binds_local_p (exp)
5449 return default_binds_local_p_1 (exp, flag_pic);
5453 default_binds_local_p_1 (exp, shlib)
5459 /* A non-decl is an entry in the constant pool. */
5462 /* Static variables are always local. */
5463 else if (! TREE_PUBLIC (exp))
5465 /* A variable is local if the user tells us so. */
5466 else if (decl_visibility (exp) != VISIBILITY_DEFAULT)
5468 /* Otherwise, variables defined outside this object may not be local. */
5469 else if (DECL_EXTERNAL (exp))
5471 /* Linkonce and weak data are never local. */
5472 else if (DECL_ONE_ONLY (exp) || DECL_WEAK (exp))
5474 /* If PIC, then assume that any global name can be overridden by
5475 symbols resolved from other modules. */
5478 /* Uninitialized COMMON variable may be unified with symbols
5479 resolved from other modules. */
5480 else if (DECL_COMMON (exp)
5481 && (DECL_INITIAL (exp) == NULL
5482 || DECL_INITIAL (exp) == error_mark_node))
5484 /* Otherwise we're left with initialized (or non-common) global data
5485 which is of necessity defined locally. */
5492 /* Default function to output code that will globalize a label. A
5493 target must define GLOBAL_ASM_OP or provide it's own function to
5494 globalize a label. */
5495 #ifdef GLOBAL_ASM_OP
5497 default_globalize_label (stream, name)
5501 fputs (GLOBAL_ASM_OP, stream);
5502 assemble_name (stream, name);
5503 putc ('\n', stream);
5505 #endif /* GLOBAL_ASM_OP */
5507 #include "gt-varasm.h"