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. */
32 #include "coretypes.h"
39 #include "hard-reg-set.h"
48 #include "langhooks.h"
53 #ifdef XCOFF_DEBUGGING_INFO
54 #include "xcoffout.h" /* Needed for external data
55 declarations for e.g. AIX 4.x. */
58 #ifndef TRAMPOLINE_ALIGNMENT
59 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
63 #define ASM_STABS_OP "\t.stabs\t"
66 /* The (assembler) name of the first globally-visible object output. */
67 const char *first_global_object_name;
68 const char *weak_global_object_name;
71 struct constant_descriptor_rtx;
75 #define MAX_RTX_HASH_TABLE 61
77 struct varasm_status GTY(())
79 /* Hash facility for making memory-constants
80 from constant rtl-expressions. It is used on RISC machines
81 where immediate integer arguments and constant addresses are restricted
82 so that such constants must be stored in memory.
84 This pool of constants is reinitialized for each function
85 so each function gets its own constants-pool that comes right before
87 struct constant_descriptor_rtx ** GTY ((length ("MAX_RTX_HASH_TABLE")))
88 x_const_rtx_hash_table;
89 struct pool_constant ** GTY ((length ("MAX_RTX_HASH_TABLE")))
90 x_const_rtx_sym_hash_table;
92 /* Pointers to first and last constant in pool. */
93 struct pool_constant *x_first_pool;
94 struct pool_constant *x_last_pool;
96 /* Current offset in constant pool (does not include any machine-specific
98 HOST_WIDE_INT x_pool_offset;
101 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
102 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
103 #define first_pool (cfun->varasm->x_first_pool)
104 #define last_pool (cfun->varasm->x_last_pool)
105 #define pool_offset (cfun->varasm->x_pool_offset)
107 /* Number for making the label on the next
108 constant that is stored in memory. */
110 static GTY(()) int const_labelno;
112 /* Number for making the label on the next
113 static variable internal to a function. */
115 static GTY(()) int var_labelno;
117 /* Carry information from ASM_DECLARE_OBJECT_NAME
118 to ASM_FINISH_DECLARE_OBJECT. */
120 int size_directive_output;
122 /* The last decl for which assemble_variable was called,
123 if it did ASM_DECLARE_OBJECT_NAME.
124 If the last call to assemble_variable didn't do that,
127 tree last_assemble_variable_decl;
129 /* RTX_UNCHANGING_P in a MEM can mean it is stored into, for initialization.
130 So giving constant the alias set for the type will allow such
131 initializations to appear to conflict with the load of the constant. We
132 avoid this by giving all constants an alias set for just constants.
133 Since there will be no stores to that alias set, nothing will ever
134 conflict with them. */
136 static HOST_WIDE_INT const_alias_set;
138 static const char *strip_reg_name PARAMS ((const char *));
139 static int contains_pointers_p PARAMS ((tree));
140 static void decode_addr_const PARAMS ((tree, struct addr_const *));
141 static unsigned int const_hash PARAMS ((tree));
142 static unsigned int const_hash_1 PARAMS ((tree));
143 static int compare_constant PARAMS ((tree, tree));
144 static tree copy_constant PARAMS ((tree));
145 static void output_constant_def_contents PARAMS ((tree, int, int));
146 static void decode_rtx_const PARAMS ((enum machine_mode, rtx,
147 struct rtx_const *));
148 static unsigned int const_hash_rtx PARAMS ((enum machine_mode, rtx));
149 static int compare_constant_rtx
150 PARAMS ((enum machine_mode, rtx, struct constant_descriptor_rtx *));
151 static struct constant_descriptor_rtx * record_constant_rtx
152 PARAMS ((enum machine_mode, rtx));
153 static struct pool_constant *find_pool_constant PARAMS ((struct function *, rtx));
154 static void mark_constant_pool PARAMS ((void));
155 static void mark_constants PARAMS ((rtx));
156 static int mark_constant PARAMS ((rtx *current_rtx, void *data));
157 static int output_addressed_constants PARAMS ((tree));
158 static void output_after_function_constants PARAMS ((void));
159 static unsigned HOST_WIDE_INT array_size_for_constructor PARAMS ((tree));
160 static unsigned min_align PARAMS ((unsigned, unsigned));
161 static void output_constructor PARAMS ((tree, HOST_WIDE_INT,
163 static void globalize_decl PARAMS ((tree));
164 static void maybe_assemble_visibility PARAMS ((tree));
165 static int in_named_entry_eq PARAMS ((const PTR, const PTR));
166 static hashval_t in_named_entry_hash PARAMS ((const PTR));
167 #ifdef ASM_OUTPUT_BSS
168 static void asm_output_bss PARAMS ((FILE *, tree, const char *, int, int));
170 #ifdef BSS_SECTION_ASM_OP
171 #ifdef ASM_OUTPUT_ALIGNED_BSS
172 static void asm_output_aligned_bss
173 PARAMS ((FILE *, tree, const char *, int, int)) ATTRIBUTE_UNUSED;
175 #endif /* BSS_SECTION_ASM_OP */
176 static hashval_t const_str_htab_hash PARAMS ((const void *x));
177 static int const_str_htab_eq PARAMS ((const void *x, const void *y));
178 static bool asm_emit_uninitialised PARAMS ((tree, const char*, int, int));
179 static void resolve_unique_section PARAMS ((tree, int, int));
180 static void mark_weak PARAMS ((tree));
182 enum in_section { no_section, in_text, in_data, in_named
183 #ifdef BSS_SECTION_ASM_OP
186 #ifdef CTORS_SECTION_ASM_OP
189 #ifdef DTORS_SECTION_ASM_OP
192 #ifdef READONLY_DATA_SECTION_ASM_OP
195 #ifdef EXTRA_SECTIONS
199 static GTY(()) enum in_section in_section = no_section;
201 /* Return a nonzero value if DECL has a section attribute. */
202 #ifndef IN_NAMED_SECTION
203 #define IN_NAMED_SECTION(DECL) \
204 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
205 && DECL_SECTION_NAME (DECL) != NULL_TREE)
208 /* Text of section name when in_section == in_named. */
209 static GTY(()) const char *in_named_name;
211 /* Hash table of flags that have been used for a particular named section. */
213 struct in_named_entry GTY(())
220 static GTY((param_is (struct in_named_entry))) htab_t in_named_htab;
222 /* Define functions like text_section for any extra sections. */
223 #ifdef EXTRA_SECTION_FUNCTIONS
224 EXTRA_SECTION_FUNCTIONS
227 /* Tell assembler to switch to text section. */
232 if (in_section != in_text)
234 in_section = in_text;
238 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
243 /* Tell assembler to switch to data section. */
248 if (in_section != in_data)
250 in_section = in_data;
251 if (flag_shared_data)
253 #ifdef SHARED_SECTION_ASM_OP
254 fprintf (asm_out_file, "%s\n", SHARED_SECTION_ASM_OP);
256 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
260 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
264 /* Tell assembler to switch to read-only data section. This is normally
268 readonly_data_section ()
270 #ifdef READONLY_DATA_SECTION
271 READONLY_DATA_SECTION (); /* Note this can call data_section. */
273 #ifdef READONLY_DATA_SECTION_ASM_OP
274 if (in_section != in_readonly_data)
276 in_section = in_readonly_data;
277 fputs (READONLY_DATA_SECTION_ASM_OP, asm_out_file);
278 fputc ('\n', asm_out_file);
286 /* Determine if we're in the text section. */
291 return in_section == in_text;
294 /* Determine if we're in the data section. */
299 return in_section == in_data;
302 /* Helper routines for maintaining in_named_htab. */
305 in_named_entry_eq (p1, p2)
309 const struct in_named_entry *old = p1;
310 const char *new = p2;
312 return strcmp (old->name, new) == 0;
316 in_named_entry_hash (p)
319 const struct in_named_entry *old = p;
320 return htab_hash_string (old->name);
323 /* If SECTION has been seen before as a named section, return the flags
324 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
325 set of flags for a section to have, so 0 does not mean that the section
326 has not been seen. */
329 get_named_section_flags (section)
332 struct in_named_entry **slot;
334 slot = (struct in_named_entry **)
335 htab_find_slot_with_hash (in_named_htab, section,
336 htab_hash_string (section), NO_INSERT);
338 return slot ? (*slot)->flags : 0;
341 /* Returns true if the section has been declared before. Sets internal
342 flag on this section in in_named_hash so subsequent calls on this
343 section will return false. */
346 named_section_first_declaration (name)
349 struct in_named_entry **slot;
351 slot = (struct in_named_entry **)
352 htab_find_slot_with_hash (in_named_htab, name,
353 htab_hash_string (name), NO_INSERT);
354 if (! (*slot)->declared)
356 (*slot)->declared = true;
366 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
367 different set of flags, return false. */
370 set_named_section_flags (section, flags)
374 struct in_named_entry **slot, *entry;
376 slot = (struct in_named_entry **)
377 htab_find_slot_with_hash (in_named_htab, section,
378 htab_hash_string (section), INSERT);
383 entry = (struct in_named_entry *) ggc_alloc (sizeof (*entry));
385 entry->name = ggc_strdup (section);
386 entry->flags = flags;
387 entry->declared = false;
389 else if (entry->flags != flags)
395 /* Tell assembler to change to section NAME with attributes FLAGS. */
398 named_section_flags (name, flags)
402 if (in_section != in_named || strcmp (name, in_named_name) != 0)
404 if (! set_named_section_flags (name, flags))
407 (*targetm.asm_out.named_section) (name, flags);
409 if (flags & SECTION_FORGET)
410 in_section = no_section;
413 in_named_name = ggc_strdup (name);
414 in_section = in_named;
419 /* Tell assembler to change to section NAME for DECL.
420 If DECL is NULL, just switch to section NAME.
421 If NAME is NULL, get the name from DECL.
422 If RELOC is 1, the initializer for DECL contains relocs. */
425 named_section (decl, name, reloc)
432 if (decl != NULL_TREE && !DECL_P (decl))
435 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
437 flags = (* targetm.section_type_flags) (decl, name, reloc);
439 /* Sanity check user variables for flag changes. Non-user
440 section flag changes will abort in named_section_flags.
441 However, don't complain if SECTION_OVERRIDE is set.
442 We trust that the setter knows that it is safe to ignore
443 the default flags for this decl. */
444 if (decl && ! set_named_section_flags (name, flags))
446 flags = get_named_section_flags (name);
447 if ((flags & SECTION_OVERRIDE) == 0)
448 error_with_decl (decl, "%s causes a section type conflict");
451 named_section_flags (name, flags);
454 /* If required, set DECL_SECTION_NAME to a unique name. */
457 resolve_unique_section (decl, reloc, flag_function_or_data_sections)
459 int reloc ATTRIBUTE_UNUSED;
460 int flag_function_or_data_sections;
462 if (DECL_SECTION_NAME (decl) == NULL_TREE
463 && targetm.have_named_sections
464 && (flag_function_or_data_sections
465 || DECL_ONE_ONLY (decl)))
466 (*targetm.asm_out.unique_section) (decl, reloc);
469 #ifdef BSS_SECTION_ASM_OP
471 /* Tell the assembler to switch to the bss section. */
476 if (in_section != in_bss)
478 #ifdef SHARED_BSS_SECTION_ASM_OP
479 if (flag_shared_data)
480 fprintf (asm_out_file, "%s\n", SHARED_BSS_SECTION_ASM_OP);
483 fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP);
489 #ifdef ASM_OUTPUT_BSS
491 /* Utility function for ASM_OUTPUT_BSS for targets to use if
492 they don't support alignments in .bss.
493 ??? It is believed that this function will work in most cases so such
494 support is localized here. */
497 asm_output_bss (file, decl, name, size, rounded)
499 tree decl ATTRIBUTE_UNUSED;
501 int size ATTRIBUTE_UNUSED, rounded;
503 (*targetm.asm_out.globalize_label) (file, name);
505 #ifdef ASM_DECLARE_OBJECT_NAME
506 last_assemble_variable_decl = decl;
507 ASM_DECLARE_OBJECT_NAME (file, name, decl);
509 /* Standard thing is just output label for the object. */
510 ASM_OUTPUT_LABEL (file, name);
511 #endif /* ASM_DECLARE_OBJECT_NAME */
512 ASM_OUTPUT_SKIP (file, rounded ? rounded : 1);
517 #ifdef ASM_OUTPUT_ALIGNED_BSS
519 /* Utility function for targets to use in implementing
520 ASM_OUTPUT_ALIGNED_BSS.
521 ??? It is believed that this function will work in most cases so such
522 support is localized here. */
525 asm_output_aligned_bss (file, decl, name, size, align)
527 tree decl ATTRIBUTE_UNUSED;
532 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
533 #ifdef ASM_DECLARE_OBJECT_NAME
534 last_assemble_variable_decl = decl;
535 ASM_DECLARE_OBJECT_NAME (file, name, decl);
537 /* Standard thing is just output label for the object. */
538 ASM_OUTPUT_LABEL (file, name);
539 #endif /* ASM_DECLARE_OBJECT_NAME */
540 ASM_OUTPUT_SKIP (file, size ? size : 1);
545 #endif /* BSS_SECTION_ASM_OP */
547 /* Switch to the section for function DECL.
549 If DECL is NULL_TREE, switch to the text section.
550 ??? It's not clear that we will ever be passed NULL_TREE, but it's
551 safer to handle it. */
554 function_section (decl)
557 if (decl != NULL_TREE
558 && DECL_SECTION_NAME (decl) != NULL_TREE)
559 named_section (decl, (char *) 0, 0);
564 /* Switch to section for variable DECL. RELOC is the same as the
565 argument to SELECT_SECTION. */
568 variable_section (decl, reloc)
572 if (IN_NAMED_SECTION (decl))
573 named_section (decl, NULL, reloc);
575 (*targetm.asm_out.select_section) (decl, reloc, DECL_ALIGN (decl));
578 /* Tell assembler to switch to the section for string merging. */
581 mergeable_string_section (decl, align, flags)
582 tree decl ATTRIBUTE_UNUSED;
583 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED;
584 unsigned int flags ATTRIBUTE_UNUSED;
586 #ifdef HAVE_GAS_SHF_MERGE
587 if (flag_merge_constants
588 && TREE_CODE (decl) == STRING_CST
589 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
591 && TREE_STRING_LENGTH (decl) >= int_size_in_bytes (TREE_TYPE (decl)))
593 enum machine_mode mode;
594 unsigned int modesize;
599 mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (decl)));
600 modesize = GET_MODE_BITSIZE (mode);
601 if (modesize >= 8 && modesize <= 256
602 && (modesize & (modesize - 1)) == 0)
604 if (align < modesize)
607 str = TREE_STRING_POINTER (decl);
608 len = TREE_STRING_LENGTH (decl);
609 unit = GET_MODE_SIZE (mode);
611 /* Check for embedded NUL characters. */
612 for (i = 0; i < len; i += unit)
614 for (j = 0; j < unit; j++)
615 if (str[i + j] != '\0')
622 sprintf (name, ".rodata.str%d.%d", modesize / 8,
624 flags |= (modesize / 8) | SECTION_MERGE | SECTION_STRINGS;
625 if (!i && modesize < align)
627 /* A "" string with requested alignment greater than
628 character size might cause a problem:
629 if some other string required even bigger
630 alignment than "", then linker might think the
631 "" is just part of padding after some other string
632 and not put it into the hash table initially.
633 But this means "" could have smaller alignment
635 #ifdef ASM_OUTPUT_SECTION_START
636 named_section_flags (name, flags);
637 ASM_OUTPUT_SECTION_START (asm_out_file);
639 readonly_data_section ();
644 named_section_flags (name, flags);
650 readonly_data_section ();
653 /* Tell assembler to switch to the section for constant merging. */
656 mergeable_constant_section (mode, align, flags)
657 enum machine_mode mode ATTRIBUTE_UNUSED;
658 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED;
659 unsigned int flags ATTRIBUTE_UNUSED;
661 #ifdef HAVE_GAS_SHF_MERGE
662 unsigned int modesize = GET_MODE_BITSIZE (mode);
664 if (flag_merge_constants
670 && (align & (align - 1)) == 0)
674 sprintf (name, ".rodata.cst%d", (int) (align / 8));
675 flags |= (align / 8) | SECTION_MERGE;
676 named_section_flags (name, flags);
680 readonly_data_section ();
683 /* Given NAME, a putative register name, discard any customary prefixes. */
686 strip_reg_name (name)
689 #ifdef REGISTER_PREFIX
690 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
691 name += strlen (REGISTER_PREFIX);
693 if (name[0] == '%' || name[0] == '#')
698 /* Decode an `asm' spec for a declaration as a register name.
699 Return the register number, or -1 if nothing specified,
700 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
701 or -3 if ASMSPEC is `cc' and is not recognized,
702 or -4 if ASMSPEC is `memory' and is not recognized.
703 Accept an exact spelling or a decimal number.
704 Prefixes such as % are optional. */
707 decode_reg_name (asmspec)
714 /* Get rid of confusing prefixes. */
715 asmspec = strip_reg_name (asmspec);
717 /* Allow a decimal number as a "register name". */
718 for (i = strlen (asmspec) - 1; i >= 0; i--)
719 if (! ISDIGIT (asmspec[i]))
721 if (asmspec[0] != 0 && i < 0)
724 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
730 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
732 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
735 #ifdef ADDITIONAL_REGISTER_NAMES
737 static const struct { const char *const name; const int number; } table[]
738 = ADDITIONAL_REGISTER_NAMES;
740 for (i = 0; i < (int) ARRAY_SIZE (table); i++)
741 if (! strcmp (asmspec, table[i].name))
742 return table[i].number;
744 #endif /* ADDITIONAL_REGISTER_NAMES */
746 if (!strcmp (asmspec, "memory"))
749 if (!strcmp (asmspec, "cc"))
758 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
759 have static storage duration. In other words, it should not be an
760 automatic variable, including PARM_DECLs.
762 There is, however, one exception: this function handles variables
763 explicitly placed in a particular register by the user.
765 ASMSPEC, if not 0, is the string which the user specified as the
766 assembler symbol name.
768 This is never called for PARM_DECL nodes. */
771 make_decl_rtl (decl, asmspec)
775 int top_level = (DECL_CONTEXT (decl) == NULL_TREE);
776 const char *name = 0;
777 const char *new_name = 0;
781 /* Check that we are not being given an automatic variable. */
782 /* A weak alias has TREE_PUBLIC set but not the other bits. */
783 if (TREE_CODE (decl) == PARM_DECL
784 || TREE_CODE (decl) == RESULT_DECL
785 || (TREE_CODE (decl) == VAR_DECL
786 && !TREE_STATIC (decl)
787 && !TREE_PUBLIC (decl)
788 && !DECL_EXTERNAL (decl)
789 && !DECL_REGISTER (decl)))
791 /* And that we were not given a type or a label. */
792 else if (TREE_CODE (decl) == TYPE_DECL
793 || TREE_CODE (decl) == LABEL_DECL)
796 /* For a duplicate declaration, we can be called twice on the
797 same DECL node. Don't discard the RTL already made. */
798 if (DECL_RTL_SET_P (decl))
800 /* If the old RTL had the wrong mode, fix the mode. */
801 if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
802 SET_DECL_RTL (decl, adjust_address_nv (DECL_RTL (decl),
803 DECL_MODE (decl), 0));
805 /* ??? Another way to do this would be to maintain a hashed
806 table of such critters. Instead of adding stuff to a DECL
807 to give certain attributes to it, we could use an external
808 hash map from DECL to set of attributes. */
810 /* Let the target reassign the RTL if it wants.
811 This is necessary, for example, when one machine specific
812 decl attribute overrides another. */
813 (* targetm.encode_section_info) (decl, false);
817 new_name = name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
819 reg_number = decode_reg_name (asmspec);
820 if (reg_number == -2)
822 /* ASMSPEC is given, and not the name of a register. Mark the
823 name with a star so assemble_name won't munge it. */
824 char *starred = alloca (strlen (asmspec) + 2);
826 strcpy (starred + 1, asmspec);
830 if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
832 /* First detect errors in declaring global registers. */
833 if (reg_number == -1)
834 error_with_decl (decl, "register name not specified for `%s'");
835 else if (reg_number < 0)
836 error_with_decl (decl, "invalid register name for `%s'");
837 else if (TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
838 error_with_decl (decl,
839 "data type of `%s' isn't suitable for a register");
840 else if (! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl))))
841 error_with_decl (decl,
842 "register specified for `%s' isn't suitable for data type");
843 /* Now handle properly declared static register variables. */
848 if (DECL_INITIAL (decl) != 0 && TREE_STATIC (decl))
850 DECL_INITIAL (decl) = 0;
851 error ("global register variable has initial value");
853 if (TREE_THIS_VOLATILE (decl))
854 warning ("volatile register variables don't work as you might wish");
856 /* If the user specified one of the eliminables registers here,
857 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
858 confused with that register and be eliminated. This usage is
859 somewhat suspect... */
861 SET_DECL_RTL (decl, gen_rtx_raw_REG (DECL_MODE (decl), reg_number));
862 ORIGINAL_REGNO (DECL_RTL (decl)) = reg_number;
863 REG_USERVAR_P (DECL_RTL (decl)) = 1;
865 if (TREE_STATIC (decl))
867 /* Make this register global, so not usable for anything
869 #ifdef ASM_DECLARE_REGISTER_GLOBAL
870 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name);
872 nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl));
874 globalize_reg (reg_number + --nregs);
877 /* As a register variable, it has no section. */
882 /* Now handle ordinary static variables and functions (in memory).
883 Also handle vars declared register invalidly. */
885 if (reg_number >= 0 || reg_number == -3)
886 error_with_decl (decl,
887 "register name given for non-register variable `%s'");
889 /* Specifying a section attribute on a variable forces it into a
890 non-.bss section, and thus it cannot be common. */
891 if (TREE_CODE (decl) == VAR_DECL
892 && DECL_SECTION_NAME (decl) != NULL_TREE
893 && DECL_INITIAL (decl) == NULL_TREE
894 && DECL_COMMON (decl))
895 DECL_COMMON (decl) = 0;
897 /* Variables can't be both common and weak. */
898 if (TREE_CODE (decl) == VAR_DECL && DECL_WEAK (decl))
899 DECL_COMMON (decl) = 0;
901 /* Can't use just the variable's own name for a variable
902 whose scope is less than the whole file, unless it's a member
903 of a local class (which will already be unambiguous).
904 Concatenate a distinguishing number. */
905 if (!top_level && !TREE_PUBLIC (decl)
906 && ! (DECL_CONTEXT (decl) && TYPE_P (DECL_CONTEXT (decl)))
908 && name == IDENTIFIER_POINTER (DECL_NAME (decl)))
912 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
917 if (name != new_name)
919 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (new_name));
920 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
923 x = gen_rtx_MEM (DECL_MODE (decl), gen_rtx_SYMBOL_REF (Pmode, name));
924 SYMBOL_REF_WEAK (XEXP (x, 0)) = DECL_WEAK (decl);
925 if (TREE_CODE (decl) != FUNCTION_DECL)
926 set_mem_attributes (x, decl, 1);
927 SET_DECL_RTL (decl, x);
929 /* Optionally set flags or add text to the name to record information
930 such as that it is a function name.
931 If the name is changed, the macro ASM_OUTPUT_LABELREF
932 will have to know how to strip this information. */
933 (* targetm.encode_section_info) (decl, true);
936 /* Make the rtl for variable VAR be volatile.
937 Use this only for static variables. */
940 make_var_volatile (var)
943 if (GET_CODE (DECL_RTL (var)) != MEM)
946 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
949 /* Output a string of literal assembler code
950 for an `asm' keyword used between functions. */
953 assemble_asm (string)
958 if (TREE_CODE (string) == ADDR_EXPR)
959 string = TREE_OPERAND (string, 0);
961 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
964 /* Record an element in the table of global destructors. SYMBOL is
965 a SYMBOL_REF of the function to be called; PRIORITY is a number
966 between 0 and MAX_INIT_PRIORITY. */
969 default_stabs_asm_out_destructor (symbol, priority)
971 int priority ATTRIBUTE_UNUSED;
973 /* Tell GNU LD that this is part of the static destructor set.
974 This will work for any system that uses stabs, most usefully
976 fprintf (asm_out_file, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
977 assemble_name (asm_out_file, XSTR (symbol, 0));
978 fputc ('\n', asm_out_file);
982 default_named_section_asm_out_destructor (symbol, priority)
986 const char *section = ".dtors";
989 /* ??? This only works reliably with the GNU linker. */
990 if (priority != DEFAULT_INIT_PRIORITY)
992 sprintf (buf, ".dtors.%.5u",
993 /* Invert the numbering so the linker puts us in the proper
994 order; constructors are run from right to left, and the
995 linker sorts in increasing order. */
996 MAX_INIT_PRIORITY - priority);
1000 named_section_flags (section, SECTION_WRITE);
1001 assemble_align (POINTER_SIZE);
1002 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1005 #ifdef DTORS_SECTION_ASM_OP
1009 if (in_section != in_dtors)
1011 in_section = in_dtors;
1012 fputs (DTORS_SECTION_ASM_OP, asm_out_file);
1013 fputc ('\n', asm_out_file);
1018 default_dtor_section_asm_out_destructor (symbol, priority)
1020 int priority ATTRIBUTE_UNUSED;
1023 assemble_align (POINTER_SIZE);
1024 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1028 /* Likewise for global constructors. */
1031 default_stabs_asm_out_constructor (symbol, priority)
1033 int priority ATTRIBUTE_UNUSED;
1035 /* Tell GNU LD that this is part of the static destructor set.
1036 This will work for any system that uses stabs, most usefully
1038 fprintf (asm_out_file, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
1039 assemble_name (asm_out_file, XSTR (symbol, 0));
1040 fputc ('\n', asm_out_file);
1044 default_named_section_asm_out_constructor (symbol, priority)
1048 const char *section = ".ctors";
1051 /* ??? This only works reliably with the GNU linker. */
1052 if (priority != DEFAULT_INIT_PRIORITY)
1054 sprintf (buf, ".ctors.%.5u",
1055 /* Invert the numbering so the linker puts us in the proper
1056 order; constructors are run from right to left, and the
1057 linker sorts in increasing order. */
1058 MAX_INIT_PRIORITY - priority);
1062 named_section_flags (section, SECTION_WRITE);
1063 assemble_align (POINTER_SIZE);
1064 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1067 #ifdef CTORS_SECTION_ASM_OP
1071 if (in_section != in_ctors)
1073 in_section = in_ctors;
1074 fputs (CTORS_SECTION_ASM_OP, asm_out_file);
1075 fputc ('\n', asm_out_file);
1080 default_ctor_section_asm_out_constructor (symbol, priority)
1082 int priority ATTRIBUTE_UNUSED;
1085 assemble_align (POINTER_SIZE);
1086 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1090 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1091 a nonzero value if the constant pool should be output before the
1092 start of the function, or a zero value if the pool should output
1093 after the end of the function. The default is to put it before the
1096 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1097 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1100 /* Output assembler code for the constant pool of a function and associated
1101 with defining the name of the function. DECL describes the function.
1102 NAME is the function's name. For the constant pool, we use the current
1103 constant pool data. */
1106 assemble_start_function (decl, fnname)
1112 /* The following code does not need preprocessing in the assembler. */
1116 if (CONSTANT_POOL_BEFORE_FUNCTION)
1117 output_constant_pool (fnname, decl);
1119 resolve_unique_section (decl, 0, flag_function_sections);
1120 function_section (decl);
1122 /* Tell assembler to move to target machine's alignment for functions. */
1123 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1124 if (align < force_align_functions_log)
1125 align = force_align_functions_log;
1128 ASM_OUTPUT_ALIGN (asm_out_file, align);
1131 /* Handle a user-specified function alignment.
1132 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1133 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1134 if (align_functions_log > align
1135 && cfun->function_frequency != FUNCTION_FREQUENCY_UNLIKELY_EXECUTED)
1137 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1138 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file,
1139 align_functions_log, align_functions - 1);
1141 ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
1145 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1146 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
1149 (*debug_hooks->begin_function) (decl);
1151 /* Make function name accessible from other files, if appropriate. */
1153 if (TREE_PUBLIC (decl))
1155 if (! first_global_object_name)
1160 p = (* targetm.strip_name_encoding) (fnname);
1163 if (! DECL_WEAK (decl) && ! DECL_ONE_ONLY (decl))
1164 first_global_object_name = name;
1166 weak_global_object_name = name;
1169 globalize_decl (decl);
1171 maybe_assemble_visibility (decl);
1174 /* Do any machine/system dependent processing of the function name */
1175 #ifdef ASM_DECLARE_FUNCTION_NAME
1176 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
1178 /* Standard thing is just output label for the function. */
1179 ASM_OUTPUT_LABEL (asm_out_file, fnname);
1180 #endif /* ASM_DECLARE_FUNCTION_NAME */
1183 /* Output assembler code associated with defining the size of the
1184 function. DECL describes the function. NAME is the function's name. */
1187 assemble_end_function (decl, fnname)
1191 #ifdef ASM_DECLARE_FUNCTION_SIZE
1192 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1194 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1196 output_constant_pool (fnname, decl);
1197 function_section (decl); /* need to switch back */
1200 /* Output any constants which should appear after the function. */
1201 output_after_function_constants ();
1204 /* Assemble code to leave SIZE bytes of zeros. */
1207 assemble_zeros (size)
1210 /* Do no output if -fsyntax-only. */
1211 if (flag_syntax_only)
1214 #ifdef ASM_NO_SKIP_IN_TEXT
1215 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1216 so we must output 0s explicitly in the text section. */
1217 if (ASM_NO_SKIP_IN_TEXT && in_text_section ())
1220 for (i = 0; i < size; i++)
1221 assemble_integer (const0_rtx, 1, BITS_PER_UNIT, 1);
1226 ASM_OUTPUT_SKIP (asm_out_file, size);
1229 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1232 assemble_align (align)
1235 if (align > BITS_PER_UNIT)
1237 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1241 /* Assemble a string constant with the specified C string as contents. */
1244 assemble_string (p, size)
1251 /* If the string is very long, split it up. */
1255 int thissize = size - pos;
1256 if (thissize > maximum)
1259 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1267 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1268 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1269 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1271 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1272 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1273 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1275 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1276 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1280 #if defined ASM_OUTPUT_ALIGNED_BSS
1281 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1282 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1284 #if defined ASM_OUTPUT_BSS
1285 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1286 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1292 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1293 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1294 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1296 #if defined ASM_OUTPUT_ALIGNED_COMMON
1297 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1298 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1300 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1301 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1306 asm_emit_uninitialised (decl, name, size, rounded)
1309 int size ATTRIBUTE_UNUSED;
1310 int rounded ATTRIBUTE_UNUSED;
1318 destination = asm_dest_local;
1320 /* ??? We should handle .bss via select_section mechanisms rather than
1321 via special target hooks. That would eliminate this special case. */
1322 if (TREE_PUBLIC (decl))
1324 if (!DECL_COMMON (decl))
1326 destination = asm_dest_bss;
1331 destination = asm_dest_common;
1334 if (destination == asm_dest_bss)
1335 globalize_decl (decl);
1336 resolve_unique_section (decl, 0, flag_data_sections);
1338 if (flag_shared_data)
1340 switch (destination)
1342 #ifdef ASM_OUTPUT_SHARED_BSS
1344 ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded);
1347 #ifdef ASM_OUTPUT_SHARED_COMMON
1348 case asm_dest_common:
1349 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1352 #ifdef ASM_OUTPUT_SHARED_LOCAL
1353 case asm_dest_local:
1354 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1362 switch (destination)
1366 ASM_EMIT_BSS (decl, name, size, rounded);
1369 case asm_dest_common:
1370 ASM_EMIT_COMMON (decl, name, size, rounded);
1372 case asm_dest_local:
1373 ASM_EMIT_LOCAL (decl, name, size, rounded);
1382 /* Assemble everything that is needed for a variable or function declaration.
1383 Not used for automatic variables, and not used for function definitions.
1384 Should not be called for variables of incomplete structure type.
1386 TOP_LEVEL is nonzero if this variable has file scope.
1387 AT_END is nonzero if this is the special handling, at end of compilation,
1388 to define things that have had only tentative definitions.
1389 DONT_OUTPUT_DATA if nonzero means don't actually output the
1390 initial value (that will be done by the caller). */
1393 assemble_variable (decl, top_level, at_end, dont_output_data)
1395 int top_level ATTRIBUTE_UNUSED;
1396 int at_end ATTRIBUTE_UNUSED;
1397 int dont_output_data;
1404 last_assemble_variable_decl = 0;
1406 /* Normally no need to say anything here for external references,
1407 since assemble_external is called by the language-specific code
1408 when a declaration is first seen. */
1410 if (DECL_EXTERNAL (decl))
1413 /* Output no assembler code for a function declaration.
1414 Only definitions of functions output anything. */
1416 if (TREE_CODE (decl) == FUNCTION_DECL)
1419 /* Do nothing for global register variables. */
1420 if (DECL_RTL_SET_P (decl) && GET_CODE (DECL_RTL (decl)) == REG)
1422 TREE_ASM_WRITTEN (decl) = 1;
1426 /* If type was incomplete when the variable was declared,
1427 see if it is complete now. */
1429 if (DECL_SIZE (decl) == 0)
1430 layout_decl (decl, 0);
1432 /* Still incomplete => don't allocate it; treat the tentative defn
1433 (which is what it must have been) as an `extern' reference. */
1435 if (!dont_output_data && DECL_SIZE (decl) == 0)
1437 error_with_file_and_line (DECL_SOURCE_FILE (decl),
1438 DECL_SOURCE_LINE (decl),
1439 "storage size of `%s' isn't known",
1440 IDENTIFIER_POINTER (DECL_NAME (decl)));
1441 TREE_ASM_WRITTEN (decl) = 1;
1445 /* The first declaration of a variable that comes through this function
1446 decides whether it is global (in C, has external linkage)
1447 or local (in C, has internal linkage). So do nothing more
1448 if this function has already run. */
1450 if (TREE_ASM_WRITTEN (decl))
1453 /* Make sure targetm.encode_section_info is invoked before we set
1455 decl_rtl = DECL_RTL (decl);
1457 TREE_ASM_WRITTEN (decl) = 1;
1459 /* Do no output if -fsyntax-only. */
1460 if (flag_syntax_only)
1465 if (! dont_output_data
1466 && ! host_integerp (DECL_SIZE_UNIT (decl), 1))
1468 error_with_decl (decl, "size of variable `%s' is too large");
1472 name = XSTR (XEXP (decl_rtl, 0), 0);
1473 if (TREE_PUBLIC (decl) && DECL_NAME (decl)
1474 && ! first_global_object_name
1475 && ! (DECL_COMMON (decl) && (DECL_INITIAL (decl) == 0
1476 || DECL_INITIAL (decl) == error_mark_node))
1477 && ! DECL_WEAK (decl)
1478 && ! DECL_ONE_ONLY (decl))
1483 p = (* targetm.strip_name_encoding) (name);
1484 xname = xstrdup (p);
1485 first_global_object_name = xname;
1488 /* Compute the alignment of this data. */
1490 align = DECL_ALIGN (decl);
1492 /* In the case for initialing an array whose length isn't specified,
1493 where we have not yet been able to do the layout,
1494 figure out the proper alignment now. */
1495 if (dont_output_data && DECL_SIZE (decl) == 0
1496 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1497 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1499 /* Some object file formats have a maximum alignment which they support.
1500 In particular, a.out format supports a maximum alignment of 4. */
1501 #ifndef MAX_OFILE_ALIGNMENT
1502 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1504 if (align > MAX_OFILE_ALIGNMENT)
1506 warning_with_decl (decl,
1507 "alignment of `%s' is greater than maximum object file alignment. Using %d",
1508 MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
1509 align = MAX_OFILE_ALIGNMENT;
1512 /* On some machines, it is good to increase alignment sometimes. */
1513 if (! DECL_USER_ALIGN (decl))
1515 #ifdef DATA_ALIGNMENT
1516 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1518 #ifdef CONSTANT_ALIGNMENT
1519 if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node)
1520 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1524 /* Reset the alignment in case we have made it tighter, so we can benefit
1525 from it in get_pointer_alignment. */
1526 DECL_ALIGN (decl) = align;
1527 set_mem_align (decl_rtl, align);
1529 if (TREE_PUBLIC (decl))
1530 maybe_assemble_visibility (decl);
1532 /* Output any data that we will need to use the address of. */
1533 if (DECL_INITIAL (decl) == error_mark_node)
1534 reloc = contains_pointers_p (TREE_TYPE (decl)) ? 3 : 0;
1535 else if (DECL_INITIAL (decl))
1536 reloc = output_addressed_constants (DECL_INITIAL (decl));
1537 resolve_unique_section (decl, reloc, flag_data_sections);
1539 /* Handle uninitialized definitions. */
1541 /* If the decl has been given an explicit section name, then it
1542 isn't common, and shouldn't be handled as such. */
1543 if (DECL_SECTION_NAME (decl) || dont_output_data)
1545 /* We don't implement common thread-local data at present. */
1546 else if (DECL_THREAD_LOCAL (decl))
1548 if (DECL_COMMON (decl))
1549 sorry ("thread-local COMMON data not implemented");
1551 else if (DECL_INITIAL (decl) == 0
1552 || DECL_INITIAL (decl) == error_mark_node
1553 || (flag_zero_initialized_in_bss
1554 /* Leave constant zeroes in .rodata so they can be shared. */
1555 && !TREE_READONLY (decl)
1556 && initializer_zerop (DECL_INITIAL (decl))))
1558 unsigned HOST_WIDE_INT size = tree_low_cst (DECL_SIZE_UNIT (decl), 1);
1559 unsigned HOST_WIDE_INT rounded = size;
1561 /* Don't allocate zero bytes of common,
1562 since that means "undefined external" in the linker. */
1566 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1567 so that each uninitialized object starts on such a boundary. */
1568 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1569 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1570 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1572 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1573 if ((unsigned HOST_WIDE_INT) DECL_ALIGN (decl) / BITS_PER_UNIT > rounded)
1575 (decl, "requested alignment for %s is greater than implemented alignment of %d",rounded);
1578 /* If the target cannot output uninitialized but not common global data
1579 in .bss, then we have to use .data, so fall through. */
1580 if (asm_emit_uninitialised (decl, name, size, rounded))
1584 /* Handle initialized definitions.
1585 Also handle uninitialized global definitions if -fno-common and the
1586 target doesn't support ASM_OUTPUT_BSS. */
1588 /* First make the assembler name(s) global if appropriate. */
1589 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1590 globalize_decl (decl);
1592 /* Switch to the appropriate section. */
1593 variable_section (decl, reloc);
1595 /* dbxout.c needs to know this. */
1596 if (in_text_section ())
1597 DECL_IN_TEXT_SECTION (decl) = 1;
1599 /* Output the alignment of this data. */
1600 if (align > BITS_PER_UNIT)
1602 ASM_OUTPUT_ALIGN (asm_out_file,
1603 floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT));
1606 /* Do any machine/system dependent processing of the object. */
1607 #ifdef ASM_DECLARE_OBJECT_NAME
1608 last_assemble_variable_decl = decl;
1609 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1611 /* Standard thing is just output label for the object. */
1612 ASM_OUTPUT_LABEL (asm_out_file, name);
1613 #endif /* ASM_DECLARE_OBJECT_NAME */
1615 if (!dont_output_data)
1617 if (DECL_INITIAL (decl) && DECL_INITIAL (decl) != error_mark_node)
1618 /* Output the actual data. */
1619 output_constant (DECL_INITIAL (decl),
1620 tree_low_cst (DECL_SIZE_UNIT (decl), 1),
1623 /* Leave space for it. */
1624 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl), 1));
1628 /* Return 1 if type TYPE contains any pointers. */
1631 contains_pointers_p (type)
1634 switch (TREE_CODE (type))
1637 case REFERENCE_TYPE:
1638 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1639 so I'll play safe and return 1. */
1645 case QUAL_UNION_TYPE:
1648 /* For a type that has fields, see if the fields have pointers. */
1649 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1650 if (TREE_CODE (fields) == FIELD_DECL
1651 && contains_pointers_p (TREE_TYPE (fields)))
1657 /* An array type contains pointers if its element type does. */
1658 return contains_pointers_p (TREE_TYPE (type));
1665 /* Output something to declare an external symbol to the assembler.
1666 (Most assemblers don't need this, so we normally output nothing.)
1667 Do nothing if DECL is not external. */
1670 assemble_external (decl)
1671 tree decl ATTRIBUTE_UNUSED;
1673 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1674 main body of this code is only rarely exercised. To provide some
1675 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1676 open. If it's not, we should not be calling this function. */
1680 #ifdef ASM_OUTPUT_EXTERNAL
1681 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1683 rtx rtl = DECL_RTL (decl);
1685 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1686 && ! SYMBOL_REF_USED (XEXP (rtl, 0)))
1688 /* Some systems do require some output. */
1689 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1690 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1696 /* Similar, for calling a library function FUN. */
1699 assemble_external_libcall (fun)
1700 rtx fun ATTRIBUTE_UNUSED;
1702 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1703 /* Declare library function name external when first used, if nec. */
1704 if (! SYMBOL_REF_USED (fun))
1706 SYMBOL_REF_USED (fun) = 1;
1707 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun);
1712 /* Assemble a label named NAME. */
1715 assemble_label (name)
1718 ASM_OUTPUT_LABEL (asm_out_file, name);
1721 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1722 If NAME starts with a *, the rest of NAME is output verbatim.
1723 Otherwise NAME is transformed in an implementation-defined way
1724 (usually by the addition of an underscore).
1725 Many macros in the tm file are defined to call this function. */
1728 assemble_name (file, name)
1732 const char *real_name;
1735 real_name = (* targetm.strip_name_encoding) (name);
1737 id = maybe_get_identifier (real_name);
1739 TREE_SYMBOL_REFERENCED (id) = 1;
1742 fputs (&name[1], file);
1744 ASM_OUTPUT_LABELREF (file, name);
1747 /* Allocate SIZE bytes writable static space with a gensym name
1748 and return an RTX to refer to its address. */
1751 assemble_static_space (size)
1755 const char *namestring;
1759 if (flag_shared_data)
1763 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1765 namestring = ggc_strdup (name);
1767 x = gen_rtx_SYMBOL_REF (Pmode, namestring);
1769 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1770 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
1773 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1774 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1777 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1778 so that each uninitialized object starts on such a boundary. */
1779 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1780 int rounded ATTRIBUTE_UNUSED
1781 = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1782 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1783 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1784 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1791 /* Assemble the static constant template for function entry trampolines.
1792 This is done at most once per compilation.
1793 Returns an RTX for the address of the template. */
1795 #ifdef TRAMPOLINE_TEMPLATE
1797 assemble_trampoline_template ()
1803 /* By default, put trampoline templates in read-only data section. */
1805 #ifdef TRAMPOLINE_SECTION
1806 TRAMPOLINE_SECTION ();
1808 readonly_data_section ();
1811 /* Write the assembler code to define one. */
1812 align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
1815 ASM_OUTPUT_ALIGN (asm_out_file, align);
1818 (*targetm.asm_out.internal_label) (asm_out_file, "LTRAMP", 0);
1819 TRAMPOLINE_TEMPLATE (asm_out_file);
1821 /* Record the rtl to refer to it. */
1822 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1823 name = ggc_strdup (label);
1824 return gen_rtx_SYMBOL_REF (Pmode, name);
1828 /* A and B are either alignments or offsets. Return the minimum alignment
1829 that may be assumed after adding the two together. */
1831 static inline unsigned
1835 return (a | b) & -(a | b);
1838 /* Return the assembler directive for creating a given kind of integer
1839 object. SIZE is the number of bytes in the object and ALIGNED_P
1840 indicates whether it is known to be aligned. Return NULL if the
1841 assembly dialect has no such directive.
1843 The returned string should be printed at the start of a new line and
1844 be followed immediately by the object's initial value. */
1847 integer_asm_op (size, aligned_p)
1851 struct asm_int_op *ops;
1854 ops = &targetm.asm_out.aligned_op;
1856 ops = &targetm.asm_out.unaligned_op;
1861 return targetm.asm_out.byte_op;
1875 /* Use directive OP to assemble an integer object X. Print OP at the
1876 start of the line, followed immediately by the value of X. */
1879 assemble_integer_with_op (op, x)
1883 fputs (op, asm_out_file);
1884 output_addr_const (asm_out_file, x);
1885 fputc ('\n', asm_out_file);
1888 /* The default implementation of the asm_out.integer target hook. */
1891 default_assemble_integer (x, size, aligned_p)
1892 rtx x ATTRIBUTE_UNUSED;
1893 unsigned int size ATTRIBUTE_UNUSED;
1894 int aligned_p ATTRIBUTE_UNUSED;
1896 const char *op = integer_asm_op (size, aligned_p);
1897 return op && (assemble_integer_with_op (op, x), true);
1900 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1901 the alignment of the integer in bits. Return 1 if we were able to output
1902 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1906 assemble_integer (x, size, align, force)
1914 aligned_p = (align >= MIN (size * BITS_PER_UNIT, BIGGEST_ALIGNMENT));
1916 /* See if the target hook can handle this kind of object. */
1917 if ((*targetm.asm_out.integer) (x, size, aligned_p))
1920 /* If the object is a multi-byte one, try splitting it up. Split
1921 it into words it if is multi-word, otherwise split it into bytes. */
1924 enum machine_mode omode, imode;
1925 unsigned int subalign;
1926 unsigned int subsize, i;
1928 subsize = size > UNITS_PER_WORD? UNITS_PER_WORD : 1;
1929 subalign = MIN (align, subsize * BITS_PER_UNIT);
1930 omode = mode_for_size (subsize * BITS_PER_UNIT, MODE_INT, 0);
1931 imode = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1933 for (i = 0; i < size; i += subsize)
1935 rtx partial = simplify_subreg (omode, x, imode, i);
1936 if (!partial || !assemble_integer (partial, subsize, subalign, 0))
1942 /* If we've printed some of it, but not all of it, there's no going
1955 assemble_real (d, mode, align)
1957 enum machine_mode mode;
1962 unsigned int nalign = min_align (align, 32);
1964 switch (BITS_PER_UNIT)
1970 REAL_VALUE_TO_TARGET_SINGLE (d, l);
1971 assemble_integer (GEN_INT (l), 4, align, 1);
1974 REAL_VALUE_TO_TARGET_DOUBLE (d, data);
1975 assemble_integer (GEN_INT (data[0]), 4, align, 1);
1976 assemble_integer (GEN_INT (data[1]), 4, nalign, 1);
1979 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d, data);
1980 assemble_integer (GEN_INT (data[0]), 4, align, 1);
1981 assemble_integer (GEN_INT (data[1]), 4, nalign, 1);
1982 assemble_integer (GEN_INT (data[2]), 4, nalign, 1);
1985 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d, data);
1986 assemble_integer (GEN_INT (data[0]), 4, align, 1);
1987 assemble_integer (GEN_INT (data[1]), 4, nalign, 1);
1988 assemble_integer (GEN_INT (data[2]), 4, nalign, 1);
1989 assemble_integer (GEN_INT (data[3]), 4, nalign, 1);
2000 REAL_VALUE_TO_TARGET_SINGLE (d, l);
2001 assemble_integer (GEN_INT (l), 2, align, 1);
2004 REAL_VALUE_TO_TARGET_DOUBLE (d, data);
2005 assemble_integer (GEN_INT (data[0]), 2, align, 1);
2006 assemble_integer (GEN_INT (data[1]), 1, nalign, 1);
2017 REAL_VALUE_TO_TARGET_SINGLE (d, l);
2018 assemble_integer (GEN_INT (l), 1, align, 1);
2021 REAL_VALUE_TO_TARGET_DOUBLE (d, data);
2022 assemble_integer (GEN_INT (data[0]), 1, align, 1);
2023 assemble_integer (GEN_INT (data[1]), 1, nalign, 1);
2035 /* Given an expression EXP with a constant value,
2036 reduce it to the sum of an assembler symbol and an integer.
2037 Store them both in the structure *VALUE.
2038 Abort if EXP does not reduce. */
2040 struct addr_const GTY(())
2043 HOST_WIDE_INT offset;
2047 decode_addr_const (exp, value)
2049 struct addr_const *value;
2051 tree target = TREE_OPERAND (exp, 0);
2057 if (TREE_CODE (target) == COMPONENT_REF
2058 && host_integerp (byte_position (TREE_OPERAND (target, 1)), 0))
2061 offset += int_byte_position (TREE_OPERAND (target, 1));
2062 target = TREE_OPERAND (target, 0);
2064 else if (TREE_CODE (target) == ARRAY_REF
2065 || TREE_CODE (target) == ARRAY_RANGE_REF)
2067 offset += (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target)), 1)
2068 * tree_low_cst (TREE_OPERAND (target, 1), 0));
2069 target = TREE_OPERAND (target, 0);
2075 switch (TREE_CODE (target))
2079 x = DECL_RTL (target);
2083 x = gen_rtx_MEM (FUNCTION_MODE,
2084 gen_rtx_LABEL_REF (VOIDmode,
2085 label_rtx (TREE_OPERAND (exp, 0))));
2093 /* This constant should have been output already, but we can't simply
2094 use TREE_CST_RTL since INTEGER_CST doesn't have one. */
2095 x = output_constant_def (target, 1);
2102 if (GET_CODE (x) != MEM)
2107 value->offset = offset;
2110 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2111 enum kind { RTX_UNKNOWN, RTX_DOUBLE, RTX_VECTOR, RTX_INT, RTX_UNSPEC };
2112 struct rtx_const GTY(())
2114 ENUM_BITFIELD(kind) kind : 16;
2115 ENUM_BITFIELD(machine_mode) mode : 16;
2116 union rtx_const_un {
2117 REAL_VALUE_TYPE GTY ((tag ("4"))) du;
2118 struct rtx_const_u_addr {
2121 HOST_WIDE_INT offset;
2122 } GTY ((tag ("1"))) addr;
2123 struct rtx_const_u_di {
2126 } GTY ((tag ("0"))) di;
2128 /* The max vector size we have is 16 wide; two variants for
2129 integral and floating point vectors. */
2130 struct rtx_const_int_vec {
2133 } GTY ((tag ("2"))) int_vec[16];
2135 REAL_VALUE_TYPE GTY ((tag ("3"))) fp_vec[8];
2137 } GTY ((desc ("%1.kind >= RTX_INT"), descbits ("1"))) un;
2140 /* Uniquize all constants that appear in memory.
2141 Each constant in memory thus far output is recorded
2142 in `const_hash_table'. */
2144 struct constant_descriptor_tree GTY(())
2146 /* More constant_descriptors with the same hash code. */
2147 struct constant_descriptor_tree *next;
2149 /* The label of the constant. */
2152 /* A MEM for the constant. */
2155 /* The value of the constant. */
2159 #define MAX_HASH_TABLE 1009
2160 static GTY(()) struct constant_descriptor_tree *
2161 const_hash_table[MAX_HASH_TABLE];
2163 /* We maintain a hash table of STRING_CST values. Unless we are asked to force
2164 out a string constant, we defer output of the constants until we know
2165 they are actually used. This will be if something takes its address or if
2166 there is a usage of the string in the RTL of a function. */
2168 #define STRHASH(x) htab_hash_pointer (x)
2170 struct deferred_string GTY(())
2177 static GTY ((param_is (struct deferred_string))) htab_t const_str_htab;
2179 /* Returns a hash code for X (which is a really a
2180 struct deferred_string *). */
2183 const_str_htab_hash (x)
2186 return STRHASH (((const struct deferred_string *) x)->label);
2189 /* Returns nonzero if the value represented by X (which is really a
2190 struct deferred_string *) is the same as that given by Y
2191 (which is really a char *). */
2194 const_str_htab_eq (x, y)
2198 return (((const struct deferred_string *) x)->label == (const char *) y);
2201 /* Compute a hash code for a constant expression. */
2207 return const_hash_1 (exp) % MAX_HASH_TABLE;
2217 enum tree_code code = TREE_CODE (exp);
2219 /* Either set P and LEN to the address and len of something to hash and
2220 exit the switch or return a value. */
2225 p = (char *) &TREE_INT_CST (exp);
2226 len = sizeof TREE_INT_CST (exp);
2230 return real_hash (TREE_REAL_CST_PTR (exp));
2233 p = TREE_STRING_POINTER (exp);
2234 len = TREE_STRING_LENGTH (exp);
2238 return (const_hash_1 (TREE_REALPART (exp)) * 5
2239 + const_hash_1 (TREE_IMAGPART (exp)));
2242 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2246 len = int_size_in_bytes (TREE_TYPE (exp));
2247 tmp = (char *) alloca (len);
2248 get_set_constructor_bytes (exp, (unsigned char *) tmp, len);
2256 hi = 5 + int_size_in_bytes (TREE_TYPE (exp));
2258 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2259 if (TREE_VALUE (link))
2260 hi = hi * 603 + const_hash_1 (TREE_VALUE (link));
2268 struct addr_const value;
2270 decode_addr_const (exp, &value);
2271 if (GET_CODE (value.base) == SYMBOL_REF)
2273 /* Don't hash the address of the SYMBOL_REF;
2274 only use the offset and the symbol name. */
2276 p = XSTR (value.base, 0);
2277 for (i = 0; p[i] != 0; i++)
2278 hi = ((hi * 613) + (unsigned) (p[i]));
2280 else if (GET_CODE (value.base) == LABEL_REF)
2281 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2289 return (const_hash_1 (TREE_OPERAND (exp, 0)) * 9
2290 + const_hash_1 (TREE_OPERAND (exp, 1)));
2294 case NON_LVALUE_EXPR:
2295 return const_hash_1 (TREE_OPERAND (exp, 0)) * 7 + 2;
2298 /* A language specific constant. Just hash the code. */
2302 /* Compute hashing function */
2304 for (i = 0; i < len; i++)
2305 hi = ((hi * 613) + (unsigned) (p[i]));
2310 /* Compare t1 and t2, and return 1 only if they are known to result in
2311 the same bit pattern on output. */
2314 compare_constant (t1, t2)
2318 enum tree_code typecode;
2320 if (t1 == NULL_TREE)
2321 return t2 == NULL_TREE;
2322 if (t2 == NULL_TREE)
2325 if (TREE_CODE (t1) != TREE_CODE (t2))
2328 switch (TREE_CODE (t1))
2331 /* Integer constants are the same only if the same width of type. */
2332 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2334 return tree_int_cst_equal (t1, t2);
2337 /* Real constants are the same only if the same width of type. */
2338 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2341 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
2344 if (flag_writable_strings)
2347 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2)))
2350 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
2351 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
2352 TREE_STRING_LENGTH (t1)));
2355 return (compare_constant (TREE_REALPART (t1), TREE_REALPART (t2))
2356 && compare_constant (TREE_IMAGPART (t1), TREE_IMAGPART (t2)));
2359 typecode = TREE_CODE (TREE_TYPE (t1));
2360 if (typecode != TREE_CODE (TREE_TYPE (t2)))
2363 if (typecode == SET_TYPE)
2365 int len = int_size_in_bytes (TREE_TYPE (t2));
2366 unsigned char *tmp1, *tmp2;
2368 if (int_size_in_bytes (TREE_TYPE (t1)) != len)
2371 tmp1 = (unsigned char *) alloca (len);
2372 tmp2 = (unsigned char *) alloca (len);
2374 if (get_set_constructor_bytes (t1, tmp1, len) != NULL_TREE)
2376 if (get_set_constructor_bytes (t2, tmp2, len) != NULL_TREE)
2379 return memcmp (tmp1, tmp2, len) != 0;
2385 if (typecode == ARRAY_TYPE)
2387 HOST_WIDE_INT size_1 = int_size_in_bytes (TREE_TYPE (t1));
2388 /* For arrays, check that the sizes all match. */
2389 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2))
2391 || size_1 != int_size_in_bytes (TREE_TYPE (t2)))
2396 /* For record and union constructors, require exact type
2398 if (TREE_TYPE (t1) != TREE_TYPE (t2))
2402 for (l1 = CONSTRUCTOR_ELTS (t1), l2 = CONSTRUCTOR_ELTS (t2);
2404 l1 = TREE_CHAIN (l1), l2 = TREE_CHAIN (l2))
2406 /* Check that each value is the same... */
2407 if (! compare_constant (TREE_VALUE (l1), TREE_VALUE (l2)))
2409 /* ... and that they apply to the same fields! */
2410 if (typecode == ARRAY_TYPE)
2412 if (! compare_constant (TREE_PURPOSE (l1),
2418 if (TREE_PURPOSE (l1) != TREE_PURPOSE (l2))
2423 return l1 == NULL_TREE && l2 == NULL_TREE;
2429 struct addr_const value1, value2;
2431 decode_addr_const (t1, &value1);
2432 decode_addr_const (t2, &value2);
2433 return (value1.offset == value2.offset
2434 && strcmp (XSTR (value1.base, 0), XSTR (value2.base, 0)) == 0);
2440 return (compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))
2441 && compare_constant(TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)));
2445 case NON_LVALUE_EXPR:
2446 return compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2451 nt1 = (*lang_hooks.expand_constant) (t1);
2452 nt2 = (*lang_hooks.expand_constant) (t2);
2453 if (nt1 != t1 || nt2 != t2)
2454 return compare_constant (nt1, nt2);
2460 /* Should not get here. */
2464 /* Record a list of constant expressions that were passed to
2465 output_constant_def but that could not be output right away. */
2467 struct deferred_constant
2469 struct deferred_constant *next;
2475 static struct deferred_constant *deferred_constants;
2477 /* Another list of constants which should be output after the
2479 static struct deferred_constant *after_function_constants;
2481 /* Nonzero means defer output of addressed subconstants
2482 (i.e., those for which output_constant_def is called.) */
2483 static int defer_addressed_constants_flag;
2485 /* Start deferring output of subconstants. */
2488 defer_addressed_constants ()
2490 defer_addressed_constants_flag++;
2493 /* Stop deferring output of subconstants,
2494 and output now all those that have been deferred. */
2497 output_deferred_addressed_constants ()
2499 struct deferred_constant *p, *next;
2501 defer_addressed_constants_flag--;
2503 if (defer_addressed_constants_flag > 0)
2506 for (p = deferred_constants; p; p = next)
2508 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2513 deferred_constants = 0;
2516 /* Output any constants which should appear after a function. */
2519 output_after_function_constants ()
2521 struct deferred_constant *p, *next;
2523 for (p = after_function_constants; p; p = next)
2525 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2530 after_function_constants = 0;
2533 /* Make a copy of the whole tree structure for a constant. This
2534 handles the same types of nodes that compare_constant handles. */
2540 switch (TREE_CODE (exp))
2543 /* For ADDR_EXPR, we do not want to copy the decl whose address
2544 is requested. We do want to copy constants though. */
2545 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c')
2546 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2547 copy_constant (TREE_OPERAND (exp, 0)));
2549 return copy_node (exp);
2554 return copy_node (exp);
2557 return build_complex (TREE_TYPE (exp),
2558 copy_constant (TREE_REALPART (exp)),
2559 copy_constant (TREE_IMAGPART (exp)));
2563 return build (TREE_CODE (exp), TREE_TYPE (exp),
2564 copy_constant (TREE_OPERAND (exp, 0)),
2565 copy_constant (TREE_OPERAND (exp, 1)));
2569 case NON_LVALUE_EXPR:
2570 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2571 copy_constant (TREE_OPERAND (exp, 0)));
2575 tree copy = copy_node (exp);
2576 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2579 CONSTRUCTOR_ELTS (copy) = list;
2580 for (tail = list; tail; tail = TREE_CHAIN (tail))
2581 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2582 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2583 for (tail = list; tail; tail = TREE_CHAIN (tail))
2584 TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail));
2592 t = (*lang_hooks.expand_constant) (exp);
2594 return copy_constant (t);
2601 /* Return an rtx representing a reference to constant data in memory
2602 for the constant expression EXP.
2604 If assembler code for such a constant has already been output,
2605 return an rtx to refer to it.
2606 Otherwise, output such a constant in memory (or defer it for later)
2607 and generate an rtx for it.
2609 If DEFER is nonzero, the output of string constants can be deferred
2610 and output only if referenced in the function after all optimizations.
2612 The TREE_CST_RTL of EXP is set up to point to that rtx.
2613 The const_hash_table records which constants already have label strings. */
2616 output_constant_def (exp, defer)
2621 struct constant_descriptor_tree *desc;
2622 struct deferred_string **defstr;
2626 int after_function = 0;
2630 /* We can't just use the saved RTL if this is a deferred string constant
2631 and we are not to defer anymore. */
2632 if (TREE_CODE (exp) != INTEGER_CST && TREE_CST_RTL (exp)
2633 && (defer || !STRING_POOL_ADDRESS_P (XEXP (TREE_CST_RTL (exp), 0))))
2634 return TREE_CST_RTL (exp);
2636 /* Make sure any other constants whose addresses appear in EXP
2637 are assigned label numbers. */
2639 reloc = output_addressed_constants (exp);
2641 /* Compute hash code of EXP. Search the descriptors for that hash code
2642 to see if any of them describes EXP. If yes, the descriptor records
2643 the label number already assigned. */
2645 hash = const_hash (exp);
2647 for (desc = const_hash_table[hash]; desc; desc = desc->next)
2648 if (compare_constant (exp, desc->value))
2653 /* No constant equal to EXP is known to have been output.
2654 Make a constant descriptor to enter EXP in the hash table.
2655 Assign the label number and record it in the descriptor for
2656 future calls to this function to find. */
2658 /* Create a string containing the label name, in LABEL. */
2659 labelno = const_labelno++;
2660 ASM_GENERATE_INTERNAL_LABEL (label, "LC", labelno);
2662 desc = ggc_alloc (sizeof (*desc));
2663 desc->next = const_hash_table[hash];
2664 desc->label = ggc_strdup (label);
2665 desc->value = copy_constant (exp);
2666 const_hash_table[hash] = desc;
2668 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2670 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)),
2671 gen_rtx_SYMBOL_REF (Pmode, desc->label));
2673 set_mem_attributes (rtl, exp, 1);
2674 set_mem_alias_set (rtl, 0);
2675 set_mem_alias_set (rtl, const_alias_set);
2682 if (TREE_CODE (exp) != INTEGER_CST)
2683 TREE_CST_RTL (exp) = rtl;
2685 /* Optionally set flags or add text to the name to record information
2686 such as that it is a function name. If the name is changed, the macro
2687 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2688 /* A previously-processed constant would already have section info
2692 /* Take care not to invoke targetm.encode_section_info for
2693 constants which don't have a TREE_CST_RTL. */
2694 if (TREE_CODE (exp) != INTEGER_CST)
2695 (*targetm.encode_section_info) (exp, true);
2698 desc->label = XSTR (XEXP (desc->rtl, 0), 0);
2701 #ifdef CONSTANT_AFTER_FUNCTION_P
2702 if (current_function_decl != 0
2703 && CONSTANT_AFTER_FUNCTION_P (exp))
2708 && STRING_POOL_ADDRESS_P (XEXP (rtl, 0))
2709 && (!defer || defer_addressed_constants_flag || after_function))
2711 defstr = (struct deferred_string **)
2712 htab_find_slot_with_hash (const_str_htab, desc->label,
2713 STRHASH (desc->label), NO_INSERT);
2716 /* If the string is currently deferred but we need to output it now,
2717 remove it from deferred string hash table. */
2719 labelno = (*defstr)->labelno;
2720 STRING_POOL_ADDRESS_P (XEXP (rtl, 0)) = 0;
2721 htab_clear_slot (const_str_htab, (void **) defstr);
2725 /* If this is the first time we've seen this particular constant,
2726 output it (or defer its output for later). */
2729 if (defer_addressed_constants_flag || after_function)
2731 struct deferred_constant *p
2732 = (struct deferred_constant *)
2733 xmalloc (sizeof (struct deferred_constant));
2735 p->exp = desc->value;
2737 p->labelno = labelno;
2740 p->next = after_function_constants;
2741 after_function_constants = p;
2745 p->next = deferred_constants;
2746 deferred_constants = p;
2751 /* Do no output if -fsyntax-only. */
2752 if (! flag_syntax_only)
2754 if (TREE_CODE (exp) != STRING_CST
2756 || flag_writable_strings
2757 || (defstr = (struct deferred_string **)
2758 htab_find_slot_with_hash (const_str_htab,
2760 STRHASH (desc->label),
2762 output_constant_def_contents (exp, reloc, labelno);
2765 struct deferred_string *p;
2767 p = (struct deferred_string *)
2768 ggc_alloc (sizeof (struct deferred_string));
2770 p->exp = desc->value;
2771 p->label = desc->label;
2772 p->labelno = labelno;
2774 STRING_POOL_ADDRESS_P (XEXP (rtl, 0)) = 1;
2783 /* Now output assembler code to define the label for EXP,
2784 and follow it with the data of EXP. */
2787 output_constant_def_contents (exp, reloc, labelno)
2794 /* Align the location counter as required by EXP's data type. */
2795 align = TYPE_ALIGN (TREE_TYPE (exp));
2796 #ifdef CONSTANT_ALIGNMENT
2797 align = CONSTANT_ALIGNMENT (exp, align);
2800 if (IN_NAMED_SECTION (exp))
2801 named_section (exp, NULL, reloc);
2803 (*targetm.asm_out.select_section) (exp, reloc, align);
2805 if (align > BITS_PER_UNIT)
2807 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2810 /* Output the label itself. */
2811 (*targetm.asm_out.internal_label) (asm_out_file, "LC", labelno);
2813 /* Output the value of EXP. */
2814 output_constant (exp,
2815 (TREE_CODE (exp) == STRING_CST
2816 ? MAX (TREE_STRING_LENGTH (exp),
2817 int_size_in_bytes (TREE_TYPE (exp)))
2818 : int_size_in_bytes (TREE_TYPE (exp))),
2823 /* Used in the hash tables to avoid outputting the same constant
2824 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2825 are output once per function, not once per file; there seems
2826 to be no reason for the difference. */
2828 struct constant_descriptor_rtx GTY(())
2830 /* More constant_descriptors with the same hash code. */
2831 struct constant_descriptor_rtx *next;
2833 /* A MEM for the constant. */
2836 /* The value of the constant. */
2837 struct rtx_const value;
2840 /* Structure to represent sufficient information about a constant so that
2841 it can be output when the constant pool is output, so that function
2842 integration can be done, and to simplify handling on machines that reference
2843 constant pool as base+displacement. */
2845 struct pool_constant GTY(())
2847 struct constant_descriptor_rtx *desc;
2848 struct pool_constant *next;
2849 struct pool_constant *next_sym;
2851 enum machine_mode mode;
2854 HOST_WIDE_INT offset;
2858 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2859 The argument is XSTR (... , 0) */
2861 #define SYMHASH(LABEL) (((unsigned long) (LABEL)) % MAX_RTX_HASH_TABLE)
2863 /* Initialize constant pool hashing for a new function. */
2866 init_varasm_status (f)
2869 struct varasm_status *p;
2870 p = (struct varasm_status *) ggc_alloc (sizeof (struct varasm_status));
2872 p->x_const_rtx_hash_table
2873 = ((struct constant_descriptor_rtx **)
2874 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2875 * sizeof (struct constant_descriptor_rtx *)));
2876 p->x_const_rtx_sym_hash_table
2877 = ((struct pool_constant **)
2878 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2879 * sizeof (struct pool_constant *)));
2881 p->x_first_pool = p->x_last_pool = 0;
2882 p->x_pool_offset = 0;
2886 /* Express an rtx for a constant integer (perhaps symbolic)
2887 as the sum of a symbol or label plus an explicit integer.
2888 They are stored into VALUE. */
2891 decode_rtx_const (mode, x, value)
2892 enum machine_mode mode;
2894 struct rtx_const *value;
2896 /* Clear the whole structure, including any gaps. */
2897 memset (value, 0, sizeof (struct rtx_const));
2899 value->kind = RTX_INT; /* Most usual kind. */
2902 switch (GET_CODE (x))
2905 value->kind = RTX_DOUBLE;
2906 if (GET_MODE (x) != VOIDmode)
2908 const REAL_VALUE_TYPE *r = CONST_DOUBLE_REAL_VALUE (x);
2910 value->mode = GET_MODE (x);
2912 /* Copy the REAL_VALUE_TYPE by members so that we don't
2913 copy garbage from the original structure into our
2914 carefully cleaned hashing structure. */
2915 value->un.du.class = r->class;
2916 value->un.du.sign = r->sign;
2923 value->un.du.exp = r->exp;
2926 memcpy (value->un.du.sig, r->sig, sizeof (r->sig));
2934 value->un.di.low = CONST_DOUBLE_LOW (x);
2935 value->un.di.high = CONST_DOUBLE_HIGH (x);
2943 units = CONST_VECTOR_NUNITS (x);
2944 value->kind = RTX_VECTOR;
2947 if (GET_MODE_CLASS (mode) == MODE_VECTOR_INT)
2949 for (i = 0; i < units; ++i)
2951 rtx elt = CONST_VECTOR_ELT (x, i);
2952 if (GET_CODE (elt) == CONST_INT)
2954 value->un.int_vec[i].low = INTVAL (elt);
2955 value->un.int_vec[i].high = 0;
2959 value->un.int_vec[i].low = CONST_DOUBLE_LOW (elt);
2960 value->un.int_vec[i].high = CONST_DOUBLE_HIGH (elt);
2964 else if (GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
2966 for (i = 0; i < units; ++i)
2968 const REAL_VALUE_TYPE *r
2969 = CONST_DOUBLE_REAL_VALUE (CONST_VECTOR_ELT (x, i));
2970 REAL_VALUE_TYPE *d = &value->un.fp_vec[i];
2972 /* Copy the REAL_VALUE_TYPE by members so that we don't
2973 copy garbage from the original structure into our
2974 carefully cleaned hashing structure. */
2975 d->class = r->class;
2986 memcpy (d->sig, r->sig, sizeof (r->sig));
2999 value->un.addr.offset = INTVAL (x);
3005 value->un.addr.base = x;
3010 if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 1)) == CONST_INT)
3012 value->un.addr.base = XEXP (x, 0);
3013 value->un.addr.offset = INTVAL (XEXP (x, 1));
3015 else if (GET_CODE (x) == MINUS && GET_CODE (XEXP (x, 1)) == CONST_INT)
3017 value->un.addr.base = XEXP (x, 0);
3018 value->un.addr.offset = - INTVAL (XEXP (x, 1));
3022 value->un.addr.base = x;
3023 value->un.addr.offset = 0;
3028 value->kind = RTX_UNKNOWN;
3032 if (value->kind == RTX_INT && value->un.addr.base != 0
3033 && GET_CODE (value->un.addr.base) == UNSPEC)
3035 /* For a simple UNSPEC, the base is set to the
3036 operand, the kind field is set to the index of
3037 the unspec expression.
3038 Together with the code below, in case that
3039 the operand is a SYMBOL_REF or LABEL_REF,
3040 the address of the string or the code_label
3041 is taken as base. */
3042 if (XVECLEN (value->un.addr.base, 0) == 1)
3044 value->kind = RTX_UNSPEC + XINT (value->un.addr.base, 1);
3045 value->un.addr.base = XVECEXP (value->un.addr.base, 0, 0);
3049 if (value->kind >= RTX_INT && value->un.addr.base != 0)
3050 switch (GET_CODE (value->un.addr.base))
3053 /* Use the string's address, not the SYMBOL_REF's address,
3054 for the sake of addresses of library routines. */
3055 value->un.addr.symbol = XSTR (value->un.addr.base, 0);
3056 value->un.addr.base = NULL_RTX;
3060 /* For a LABEL_REF, compare labels. */
3061 value->un.addr.base = XEXP (value->un.addr.base, 0);
3068 /* Given a MINUS expression, simplify it if both sides
3069 include the same symbol. */
3072 simplify_subtraction (x)
3075 struct rtx_const val0, val1;
3077 decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0);
3078 decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1);
3080 if (val0.kind >= RTX_INT
3081 && val0.kind == val1.kind
3082 && val0.un.addr.base == val1.un.addr.base
3083 && val0.un.addr.symbol == val1.un.addr.symbol)
3084 return GEN_INT (val0.un.addr.offset - val1.un.addr.offset);
3089 /* Compute a hash code for a constant RTL expression. */
3092 const_hash_rtx (mode, x)
3093 enum machine_mode mode;
3097 struct rtx_const value;
3098 unsigned int data[sizeof(struct rtx_const) / sizeof (unsigned int)];
3104 decode_rtx_const (mode, x, &u.value);
3106 /* Compute hashing function */
3108 for (i = 0; i < ARRAY_SIZE (u.data); i++)
3109 hi = hi * 613 + u.data[i];
3111 return hi % MAX_RTX_HASH_TABLE;
3114 /* Compare a constant rtl object X with a constant-descriptor DESC.
3115 Return 1 if DESC describes a constant with the same value as X. */
3118 compare_constant_rtx (mode, x, desc)
3119 enum machine_mode mode;
3121 struct constant_descriptor_rtx *desc;
3123 struct rtx_const value;
3125 decode_rtx_const (mode, x, &value);
3127 /* Compare constant contents. */
3128 return memcmp (&value, &desc->value, sizeof (struct rtx_const)) == 0;
3131 /* Construct a constant descriptor for the rtl-expression X.
3132 It is up to the caller to enter the descriptor in the hash table. */
3134 static struct constant_descriptor_rtx *
3135 record_constant_rtx (mode, x)
3136 enum machine_mode mode;
3139 struct constant_descriptor_rtx *ptr;
3141 ptr = (struct constant_descriptor_rtx *) ggc_alloc (sizeof (*ptr));
3142 decode_rtx_const (mode, x, &ptr->value);
3147 /* Given a constant rtx X, return a MEM for the location in memory at which
3148 this constant has been placed. Return 0 if it not has been placed yet. */
3151 mem_for_const_double (x)
3154 enum machine_mode mode = GET_MODE (x);
3155 struct constant_descriptor_rtx *desc;
3157 for (desc = const_rtx_hash_table[const_hash_rtx (mode, x)]; desc;
3159 if (compare_constant_rtx (mode, x, desc))
3165 /* Given a constant rtx X, make (or find) a memory constant for its value
3166 and return a MEM rtx to refer to it in memory. */
3169 force_const_mem (mode, x)
3170 enum machine_mode mode;
3174 struct constant_descriptor_rtx *desc;
3177 struct pool_constant *pool;
3180 /* If we're not allowed to drop X into the constant pool, don't. */
3181 if ((*targetm.cannot_force_const_mem) (x))
3184 /* Compute hash code of X. Search the descriptors for that hash code
3185 to see if any of them describes X. If yes, we have an rtx to use. */
3186 hash = const_hash_rtx (mode, x);
3187 for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next)
3188 if (compare_constant_rtx (mode, x, desc))
3191 /* No constant equal to X is known to have been output.
3192 Make a constant descriptor to enter X in the hash table
3193 and make a MEM for it. */
3194 desc = record_constant_rtx (mode, x);
3195 desc->next = const_rtx_hash_table[hash];
3196 const_rtx_hash_table[hash] = desc;
3198 /* Align the location counter as required by EXP's data type. */
3199 align = GET_MODE_ALIGNMENT (mode == VOIDmode ? word_mode : mode);
3200 #ifdef CONSTANT_ALIGNMENT
3201 align = CONSTANT_ALIGNMENT (make_tree ((*lang_hooks.types.type_for_mode)
3202 (mode, 0), x), align);
3205 pool_offset += (align / BITS_PER_UNIT) - 1;
3206 pool_offset &= ~ ((align / BITS_PER_UNIT) - 1);
3208 if (GET_CODE (x) == LABEL_REF)
3209 LABEL_PRESERVE_P (XEXP (x, 0)) = 1;
3211 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3212 pool = (struct pool_constant *) ggc_alloc (sizeof (struct pool_constant));
3216 pool->labelno = const_labelno;
3217 pool->align = align;
3218 pool->offset = pool_offset;
3225 last_pool->next = pool;
3228 pool_offset += GET_MODE_SIZE (mode);
3230 /* Create a string containing the label name, in LABEL. */
3231 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3235 /* Construct the SYMBOL_REF and the MEM. */
3237 pool->desc->rtl = def
3238 = gen_rtx_MEM (mode, gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label)));
3239 set_mem_alias_set (def, const_alias_set);
3240 set_mem_attributes (def, (*lang_hooks.types.type_for_mode) (mode, 0), 1);
3241 RTX_UNCHANGING_P (def) = 1;
3243 /* Add label to symbol hash table. */
3244 hash = SYMHASH (XSTR (XEXP (def, 0), 0));
3245 pool->next_sym = const_rtx_sym_hash_table[hash];
3246 const_rtx_sym_hash_table[hash] = pool;
3248 /* Mark the symbol_ref as belonging to this constants pool. */
3249 CONSTANT_POOL_ADDRESS_P (XEXP (def, 0)) = 1;
3250 current_function_uses_const_pool = 1;
3255 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3256 the corresponding pool_constant structure. */
3258 static struct pool_constant *
3259 find_pool_constant (f, addr)
3263 struct pool_constant *pool;
3264 const char *label = XSTR (addr, 0);
3266 for (pool = f->varasm->x_const_rtx_sym_hash_table[SYMHASH (label)]; pool;
3267 pool = pool->next_sym)
3268 if (XSTR (XEXP (pool->desc->rtl, 0), 0) == label)
3274 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3277 get_pool_constant (addr)
3280 return (find_pool_constant (cfun, addr))->constant;
3283 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3284 and whether it has been output or not. */
3287 get_pool_constant_mark (addr, pmarked)
3291 struct pool_constant *pool = find_pool_constant (cfun, addr);
3292 *pmarked = (pool->mark != 0);
3293 return pool->constant;
3296 /* Likewise, but for the constant pool of a specific function. */
3299 get_pool_constant_for_function (f, addr)
3303 return (find_pool_constant (f, addr))->constant;
3306 /* Similar, return the mode. */
3309 get_pool_mode (addr)
3312 return (find_pool_constant (cfun, addr))->mode;
3316 get_pool_mode_for_function (f, addr)
3320 return (find_pool_constant (f, addr))->mode;
3323 /* Similar, return the offset in the constant pool. */
3326 get_pool_offset (addr)
3329 return (find_pool_constant (cfun, addr))->offset;
3332 /* Return the size of the constant pool. */
3340 /* Write all the constants in the constant pool. */
3343 output_constant_pool (fnname, fndecl)
3344 const char *fnname ATTRIBUTE_UNUSED;
3345 tree fndecl ATTRIBUTE_UNUSED;
3347 struct pool_constant *pool;
3351 /* It is possible for gcc to call force_const_mem and then to later
3352 discard the instructions which refer to the constant. In such a
3353 case we do not need to output the constant. */
3354 mark_constant_pool ();
3356 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3357 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset);
3360 for (pool = first_pool; pool; pool = pool->next)
3369 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3370 whose CODE_LABEL has been deleted. This can occur if a jump table
3371 is eliminated by optimization. If so, write a constant of zero
3372 instead. Note that this can also happen by turning the
3373 CODE_LABEL into a NOTE. */
3374 /* ??? This seems completely and utterly wrong. Certainly it's
3375 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3376 functioning even with INSN_DELETED_P and friends. */
3379 switch (GET_CODE (x))
3382 if (GET_CODE (XEXP (x, 0)) != PLUS
3383 || GET_CODE (XEXP (XEXP (x, 0), 0)) != LABEL_REF)
3385 tmp = XEXP (XEXP (x, 0), 0);
3390 if (INSN_DELETED_P (tmp)
3391 || (GET_CODE (tmp) == NOTE
3392 && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_DELETED))
3403 /* First switch to correct section. */
3404 (*targetm.asm_out.select_rtx_section) (pool->mode, x, pool->align);
3406 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3407 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode,
3408 pool->align, pool->labelno, done);
3411 assemble_align (pool->align);
3413 /* Output the label. */
3414 (*targetm.asm_out.internal_label) (asm_out_file, "LC", pool->labelno);
3416 /* Output the value of the constant itself. */
3417 switch (GET_MODE_CLASS (pool->mode))
3420 if (GET_CODE (x) != CONST_DOUBLE)
3423 REAL_VALUE_FROM_CONST_DOUBLE (r, x);
3424 assemble_real (r, pool->mode, pool->align);
3428 case MODE_PARTIAL_INT:
3429 assemble_integer (x, GET_MODE_SIZE (pool->mode), pool->align, 1);
3432 case MODE_VECTOR_FLOAT:
3437 if (GET_CODE (x) != CONST_VECTOR)
3440 units = CONST_VECTOR_NUNITS (x);
3442 for (i = 0; i < units; i++)
3444 elt = CONST_VECTOR_ELT (x, i);
3445 REAL_VALUE_FROM_CONST_DOUBLE (r, elt);
3446 assemble_real (r, GET_MODE_INNER (pool->mode), pool->align);
3451 case MODE_VECTOR_INT:
3456 if (GET_CODE (x) != CONST_VECTOR)
3459 units = CONST_VECTOR_NUNITS (x);
3461 for (i = 0; i < units; i++)
3463 elt = CONST_VECTOR_ELT (x, i);
3464 assemble_integer (elt, GET_MODE_UNIT_SIZE (pool->mode),
3474 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3475 sections have proper size. */
3476 if (pool->align > GET_MODE_BITSIZE (pool->mode)
3477 && in_section == in_named
3478 && get_named_section_flags (in_named_name) & SECTION_MERGE)
3479 assemble_align (pool->align);
3481 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3486 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3487 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool_offset);
3490 /* Done with this pool. */
3491 first_pool = last_pool = 0;
3494 /* Look through the instructions for this function, and mark all the
3495 entries in the constant pool which are actually being used.
3496 Emit used deferred strings. */
3499 mark_constant_pool ()
3503 struct pool_constant *pool;
3505 if (first_pool == 0 && htab_elements (const_str_htab) == 0)
3508 for (pool = first_pool; pool; pool = pool->next)
3511 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3513 mark_constants (PATTERN (insn));
3515 for (link = current_function_epilogue_delay_list;
3517 link = XEXP (link, 1))
3519 insn = XEXP (link, 0);
3522 mark_constants (PATTERN (insn));
3526 /* Look through appropriate parts of X, marking all entries in the
3527 constant pool which are actually being used. Entries that are only
3528 referenced by other constants are also marked as used. Emit
3529 deferred strings that are used. */
3536 const char *format_ptr;
3541 if (GET_CODE (x) == SYMBOL_REF)
3543 mark_constant (&x, NULL);
3547 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3548 insns, not any notes that may be attached. We don't want to mark
3549 a constant just because it happens to appear in a REG_EQUIV note. */
3552 mark_constants (PATTERN (x));
3556 format_ptr = GET_RTX_FORMAT (GET_CODE (x));
3558 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (x)); i++)
3560 switch (*format_ptr++)
3563 mark_constants (XEXP (x, i));
3567 if (XVEC (x, i) != 0)
3571 for (j = 0; j < XVECLEN (x, i); j++)
3572 mark_constants (XVECEXP (x, i, j));
3592 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3593 to as used. Emit referenced deferred strings. This function can
3594 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3597 mark_constant (current_rtx, data)
3599 void *data ATTRIBUTE_UNUSED;
3601 rtx x = *current_rtx;
3606 else if (GET_CODE (x) == SYMBOL_REF)
3608 if (CONSTANT_POOL_ADDRESS_P (x))
3610 struct pool_constant *pool = find_pool_constant (cfun, x);
3611 if (pool->mark == 0)
3614 for_each_rtx (&(pool->constant), &mark_constant, NULL);
3619 else if (STRING_POOL_ADDRESS_P (x))
3621 struct deferred_string **defstr;
3623 defstr = (struct deferred_string **)
3624 htab_find_slot_with_hash (const_str_htab, XSTR (x, 0),
3625 STRHASH (XSTR (x, 0)), NO_INSERT);
3628 struct deferred_string *p = *defstr;
3630 STRING_POOL_ADDRESS_P (x) = 0;
3631 output_constant_def_contents (p->exp, 0, p->labelno);
3632 htab_clear_slot (const_str_htab, (void **) defstr);
3639 /* Find all the constants whose addresses are referenced inside of EXP,
3640 and make sure assembler code with a label has been output for each one.
3641 Indicate whether an ADDR_EXPR has been encountered. */
3644 output_addressed_constants (exp)
3647 int reloc = 0, reloc2;
3650 /* Give the front-end a chance to convert VALUE to something that
3651 looks more like a constant to the back-end. */
3652 exp = (*lang_hooks.expand_constant) (exp);
3654 switch (TREE_CODE (exp))
3658 /* Go inside any operations that get_inner_reference can handle and see
3659 if what's inside is a constant: no need to do anything here for
3660 addresses of variables or functions. */
3661 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
3662 tem = TREE_OPERAND (tem, 0))
3665 if (TREE_CODE_CLASS (TREE_CODE (tem)) == 'c'
3666 || TREE_CODE (tem) == CONSTRUCTOR)
3667 output_constant_def (tem, 0);
3669 if (TREE_PUBLIC (tem))
3676 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3677 reloc |= output_addressed_constants (TREE_OPERAND (exp, 1));
3681 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3682 reloc2 = output_addressed_constants (TREE_OPERAND (exp, 1));
3683 /* The difference of two local labels is computable at link time. */
3684 if (reloc == 1 && reloc2 == 1)
3692 case NON_LVALUE_EXPR:
3693 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3697 for (tem = CONSTRUCTOR_ELTS (exp); tem; tem = TREE_CHAIN (tem))
3698 if (TREE_VALUE (tem) != 0)
3699 reloc |= output_addressed_constants (TREE_VALUE (tem));
3709 /* Return nonzero if VALUE is a valid constant-valued expression
3710 for use in initializing a static variable; one that can be an
3711 element of a "constant" initializer.
3713 Return null_pointer_node if the value is absolute;
3714 if it is relocatable, return the variable that determines the relocation.
3715 We assume that VALUE has been folded as much as possible;
3716 therefore, we do not need to check for such things as
3717 arithmetic-combinations of integers. */
3720 initializer_constant_valid_p (value, endtype)
3724 /* Give the front-end a chance to convert VALUE to something that
3725 looks more like a constant to the back-end. */
3726 value = (*lang_hooks.expand_constant) (value);
3728 switch (TREE_CODE (value))
3731 if ((TREE_CODE (TREE_TYPE (value)) == UNION_TYPE
3732 || TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE)
3733 && TREE_CONSTANT (value)
3734 && CONSTRUCTOR_ELTS (value))
3736 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value)),
3739 return TREE_STATIC (value) ? null_pointer_node : 0;
3746 return null_pointer_node;
3750 return staticp (TREE_OPERAND (value, 0)) ? TREE_OPERAND (value, 0) : 0;
3752 case VIEW_CONVERT_EXPR:
3753 case NON_LVALUE_EXPR:
3754 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3758 /* Allow conversions between pointer types. */
3759 if (POINTER_TYPE_P (TREE_TYPE (value))
3760 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3761 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3763 /* Allow conversions between real types. */
3764 if (FLOAT_TYPE_P (TREE_TYPE (value))
3765 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3766 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3768 /* Allow length-preserving conversions between integer types. */
3769 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3770 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3771 && (TYPE_PRECISION (TREE_TYPE (value))
3772 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3773 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3775 /* Allow conversions between other integer types only if
3777 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3778 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3780 tree inner = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3782 if (inner == null_pointer_node)
3783 return null_pointer_node;
3787 /* Allow (int) &foo provided int is as wide as a pointer. */
3788 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3789 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3790 && (TYPE_PRECISION (TREE_TYPE (value))
3791 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3792 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3795 /* Likewise conversions from int to pointers, but also allow
3796 conversions from 0. */
3797 if (POINTER_TYPE_P (TREE_TYPE (value))
3798 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3800 if (integer_zerop (TREE_OPERAND (value, 0)))
3801 return null_pointer_node;
3802 else if (TYPE_PRECISION (TREE_TYPE (value))
3803 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0))))
3804 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3808 /* Allow conversions to union types if the value inside is okay. */
3809 if (TREE_CODE (TREE_TYPE (value)) == UNION_TYPE)
3810 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3815 if (! INTEGRAL_TYPE_P (endtype)
3816 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3818 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3820 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3822 /* If either term is absolute, use the other terms relocation. */
3823 if (valid0 == null_pointer_node)
3825 if (valid1 == null_pointer_node)
3831 if (! INTEGRAL_TYPE_P (endtype)
3832 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3834 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3836 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3838 /* Win if second argument is absolute. */
3839 if (valid1 == null_pointer_node)
3841 /* Win if both arguments have the same relocation.
3842 Then the value is absolute. */
3843 if (valid0 == valid1 && valid0 != 0)
3844 return null_pointer_node;
3846 /* Since GCC guarantees that string constants are unique in the
3847 generated code, a subtraction between two copies of the same
3848 constant string is absolute. */
3849 if (valid0 && TREE_CODE (valid0) == STRING_CST &&
3850 valid1 && TREE_CODE (valid1) == STRING_CST &&
3851 TREE_STRING_POINTER (valid0) == TREE_STRING_POINTER (valid1))
3852 return null_pointer_node;
3855 /* Support differences between labels. */
3856 if (INTEGRAL_TYPE_P (endtype))
3859 op0 = TREE_OPERAND (value, 0);
3860 op1 = TREE_OPERAND (value, 1);
3862 /* Like STRIP_NOPS except allow the operand mode to widen.
3863 This works around a feature of fold that simplifies
3864 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3865 that the narrower operation is cheaper. */
3867 while (TREE_CODE (op0) == NOP_EXPR
3868 || TREE_CODE (op0) == CONVERT_EXPR
3869 || TREE_CODE (op0) == NON_LVALUE_EXPR)
3871 tree inner = TREE_OPERAND (op0, 0);
3872 if (inner == error_mark_node
3873 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3874 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0)))
3875 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3880 while (TREE_CODE (op1) == NOP_EXPR
3881 || TREE_CODE (op1) == CONVERT_EXPR
3882 || TREE_CODE (op1) == NON_LVALUE_EXPR)
3884 tree inner = TREE_OPERAND (op1, 0);
3885 if (inner == error_mark_node
3886 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3887 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1)))
3888 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3893 if (TREE_CODE (op0) == ADDR_EXPR
3894 && TREE_CODE (TREE_OPERAND (op0, 0)) == LABEL_DECL
3895 && TREE_CODE (op1) == ADDR_EXPR
3896 && TREE_CODE (TREE_OPERAND (op1, 0)) == LABEL_DECL)
3897 return null_pointer_node;
3908 /* Output assembler code for constant EXP to FILE, with no label.
3909 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3910 Assumes output_addressed_constants has been done on EXP already.
3912 Generate exactly SIZE bytes of assembler data, padding at the end
3913 with zeros if necessary. SIZE must always be specified.
3915 SIZE is important for structure constructors,
3916 since trailing members may have been omitted from the constructor.
3917 It is also important for initialization of arrays from string constants
3918 since the full length of the string constant might not be wanted.
3919 It is also needed for initialization of unions, where the initializer's
3920 type is just one member, and that may not be as long as the union.
3922 There a case in which we would fail to output exactly SIZE bytes:
3923 for a structure constructor that wants to produce more than SIZE bytes.
3924 But such constructors will never be generated for any possible input.
3926 ALIGN is the alignment of the data in bits. */
3929 output_constant (exp, size, align)
3934 enum tree_code code;
3935 HOST_WIDE_INT thissize;
3937 /* Some front-ends use constants other than the standard language-independent
3938 varieties, but which may still be output directly. Give the front-end a
3939 chance to convert EXP to a language-independent representation. */
3940 exp = (*lang_hooks.expand_constant) (exp);
3942 if (size == 0 || flag_syntax_only)
3945 /* Eliminate any conversions since we'll be outputting the underlying
3947 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
3948 || TREE_CODE (exp) == NON_LVALUE_EXPR
3949 || TREE_CODE (exp) == VIEW_CONVERT_EXPR)
3950 exp = TREE_OPERAND (exp, 0);
3952 code = TREE_CODE (TREE_TYPE (exp));
3953 thissize = int_size_in_bytes (TREE_TYPE (exp));
3955 /* Allow a constructor with no elements for any data type.
3956 This means to fill the space with zeros. */
3957 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
3959 assemble_zeros (size);
3963 if (TREE_CODE (exp) == FDESC_EXPR)
3965 #ifdef ASM_OUTPUT_FDESC
3966 HOST_WIDE_INT part = tree_low_cst (TREE_OPERAND (exp, 1), 0);
3967 tree decl = TREE_OPERAND (exp, 0);
3968 ASM_OUTPUT_FDESC (asm_out_file, decl, part);
3975 /* Now output the underlying data. If we've handling the padding, return.
3976 Otherwise, break and ensure THISSIZE is the size written. */
3984 case REFERENCE_TYPE:
3985 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
3986 EXPAND_INITIALIZER),
3988 error ("initializer for integer value is too complicated");
3992 if (TREE_CODE (exp) != REAL_CST)
3993 error ("initializer for floating value is not a floating constant");
3995 assemble_real (TREE_REAL_CST (exp),
3996 mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0),
4001 output_constant (TREE_REALPART (exp), thissize / 2, align);
4002 output_constant (TREE_IMAGPART (exp), thissize / 2,
4003 min_align (align, BITS_PER_UNIT * (thissize / 2)));
4008 if (TREE_CODE (exp) == CONSTRUCTOR)
4010 output_constructor (exp, size, align);
4013 else if (TREE_CODE (exp) == STRING_CST)
4015 thissize = MIN (TREE_STRING_LENGTH (exp), size);
4016 assemble_string (TREE_STRING_POINTER (exp), thissize);
4018 else if (TREE_CODE (exp) == VECTOR_CST)
4022 unsigned int nalign;
4023 enum machine_mode inner;
4025 inner = GET_MODE_INNER (TYPE_MODE (TREE_TYPE (exp)));
4026 nalign = MIN (align, GET_MODE_ALIGNMENT (inner));
4028 elt_size = GET_MODE_UNIT_SIZE (TYPE_MODE (TREE_TYPE (exp)));
4030 link = TREE_VECTOR_CST_ELTS (exp);
4031 output_constant (TREE_VALUE (link), elt_size, align);
4032 while ((link = TREE_CHAIN (link)) != NULL)
4033 output_constant (TREE_VALUE (link), elt_size, nalign);
4041 if (TREE_CODE (exp) == CONSTRUCTOR)
4042 output_constructor (exp, size, align);
4048 if (TREE_CODE (exp) == INTEGER_CST)
4049 assemble_integer (expand_expr (exp, NULL_RTX,
4050 VOIDmode, EXPAND_INITIALIZER),
4051 thissize, align, 1);
4052 else if (TREE_CODE (exp) == CONSTRUCTOR)
4054 unsigned char *buffer = (unsigned char *) alloca (thissize);
4055 if (get_set_constructor_bytes (exp, buffer, thissize))
4057 assemble_string ((char *) buffer, thissize);
4060 error ("unknown set constructor type");
4072 assemble_zeros (size);
4076 /* Subroutine of output_constructor, used for computing the size of
4077 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4078 type with an unspecified upper bound. */
4080 static unsigned HOST_WIDE_INT
4081 array_size_for_constructor (val)
4086 /* This code used to attempt to handle string constants that are not
4087 arrays of single-bytes, but nothing else does, so there's no point in
4089 if (TREE_CODE (val) == STRING_CST)
4090 return TREE_STRING_LENGTH (val);
4092 max_index = NULL_TREE;
4093 for (i = CONSTRUCTOR_ELTS (val); i; i = TREE_CHAIN (i))
4095 tree index = TREE_PURPOSE (i);
4097 if (TREE_CODE (index) == RANGE_EXPR)
4098 index = TREE_OPERAND (index, 1);
4099 if (max_index == NULL_TREE || tree_int_cst_lt (max_index, index))
4103 if (max_index == NULL_TREE)
4106 /* Compute the total number of array elements. */
4107 i = size_binop (MINUS_EXPR, convert (sizetype, max_index),
4109 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val)))));
4110 i = size_binop (PLUS_EXPR, i, convert (sizetype, integer_one_node));
4112 /* Multiply by the array element unit size to find number of bytes. */
4113 i = size_binop (MULT_EXPR, i, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val))));
4115 return tree_low_cst (i, 1);
4118 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4119 Generate at least SIZE bytes, padding if necessary. */
4122 output_constructor (exp, size, align)
4127 tree type = TREE_TYPE (exp);
4128 tree link, field = 0;
4130 /* Number of bytes output or skipped so far.
4131 In other words, current position within the constructor. */
4132 HOST_WIDE_INT total_bytes = 0;
4133 /* Nonzero means BYTE contains part of a byte, to be output. */
4134 int byte_buffer_in_use = 0;
4137 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
4140 if (TREE_CODE (type) == RECORD_TYPE)
4141 field = TYPE_FIELDS (type);
4143 if (TREE_CODE (type) == ARRAY_TYPE
4144 && TYPE_DOMAIN (type) != 0)
4145 min_index = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
4147 /* As LINK goes through the elements of the constant,
4148 FIELD goes through the structure fields, if the constant is a structure.
4149 if the constant is a union, then we override this,
4150 by getting the field from the TREE_LIST element.
4151 But the constant could also be an array. Then FIELD is zero.
4153 There is always a maximum of one element in the chain LINK for unions
4154 (even if the initializer in a source program incorrectly contains
4156 for (link = CONSTRUCTOR_ELTS (exp);
4158 link = TREE_CHAIN (link),
4159 field = field ? TREE_CHAIN (field) : 0)
4161 tree val = TREE_VALUE (link);
4164 /* The element in a union constructor specifies the proper field
4166 if ((TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
4167 || TREE_CODE (type) == QUAL_UNION_TYPE)
4168 && TREE_PURPOSE (link) != 0)
4169 field = TREE_PURPOSE (link);
4171 else if (TREE_CODE (type) == ARRAY_TYPE)
4172 index = TREE_PURPOSE (link);
4174 /* Eliminate the marker that makes a cast not be an lvalue. */
4178 if (index && TREE_CODE (index) == RANGE_EXPR)
4180 unsigned HOST_WIDE_INT fieldsize
4181 = int_size_in_bytes (TREE_TYPE (type));
4182 HOST_WIDE_INT lo_index = tree_low_cst (TREE_OPERAND (index, 0), 0);
4183 HOST_WIDE_INT hi_index = tree_low_cst (TREE_OPERAND (index, 1), 0);
4184 HOST_WIDE_INT index;
4185 unsigned int align2 = min_align (align, fieldsize * BITS_PER_UNIT);
4187 for (index = lo_index; index <= hi_index; index++)
4189 /* Output the element's initial value. */
4191 assemble_zeros (fieldsize);
4193 output_constant (val, fieldsize, align2);
4195 /* Count its size. */
4196 total_bytes += fieldsize;
4199 else if (field == 0 || !DECL_BIT_FIELD (field))
4201 /* An element that is not a bit-field. */
4203 unsigned HOST_WIDE_INT fieldsize;
4204 /* Since this structure is static,
4205 we know the positions are constant. */
4206 HOST_WIDE_INT pos = field ? int_byte_position (field) : 0;
4207 unsigned int align2;
4210 pos = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val)), 1)
4211 * (tree_low_cst (index, 0) - tree_low_cst (min_index, 0)));
4213 /* Output any buffered-up bit-fields preceding this element. */
4214 if (byte_buffer_in_use)
4216 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4218 byte_buffer_in_use = 0;
4221 /* Advance to offset of this element.
4222 Note no alignment needed in an array, since that is guaranteed
4223 if each element has the proper size. */
4224 if ((field != 0 || index != 0) && pos != total_bytes)
4226 assemble_zeros (pos - total_bytes);
4230 /* Find the alignment of this element. */
4231 align2 = min_align (align, BITS_PER_UNIT * pos);
4233 /* Determine size this element should occupy. */
4238 /* If this is an array with an unspecified upper bound,
4239 the initializer determines the size. */
4240 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4241 but we cannot do this until the deprecated support for
4242 initializing zero-length array members is removed. */
4243 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE
4244 && TYPE_DOMAIN (TREE_TYPE (field))
4245 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field))))
4247 fieldsize = array_size_for_constructor (val);
4248 /* Given a non-empty initialization, this field had
4250 if (fieldsize != 0 && TREE_CHAIN (field) != NULL_TREE)
4253 else if (DECL_SIZE_UNIT (field))
4255 /* ??? This can't be right. If the decl size overflows
4256 a host integer we will silently emit no data. */
4257 if (host_integerp (DECL_SIZE_UNIT (field), 1))
4258 fieldsize = tree_low_cst (DECL_SIZE_UNIT (field), 1);
4262 fieldsize = int_size_in_bytes (TREE_TYPE (type));
4264 /* Output the element's initial value. */
4266 assemble_zeros (fieldsize);
4268 output_constant (val, fieldsize, align2);
4270 /* Count its size. */
4271 total_bytes += fieldsize;
4273 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
4274 error ("invalid initial value for member `%s'",
4275 IDENTIFIER_POINTER (DECL_NAME (field)));
4278 /* Element that is a bit-field. */
4280 HOST_WIDE_INT next_offset = int_bit_position (field);
4281 HOST_WIDE_INT end_offset
4282 = (next_offset + tree_low_cst (DECL_SIZE (field), 1));
4285 val = integer_zero_node;
4287 /* If this field does not start in this (or, next) byte,
4289 if (next_offset / BITS_PER_UNIT != total_bytes)
4291 /* Output remnant of any bit field in previous bytes. */
4292 if (byte_buffer_in_use)
4294 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4296 byte_buffer_in_use = 0;
4299 /* If still not at proper byte, advance to there. */
4300 if (next_offset / BITS_PER_UNIT != total_bytes)
4302 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
4303 total_bytes = next_offset / BITS_PER_UNIT;
4307 if (! byte_buffer_in_use)
4310 /* We must split the element into pieces that fall within
4311 separate bytes, and combine each byte with previous or
4312 following bit-fields. */
4314 /* next_offset is the offset n fbits from the beginning of
4315 the structure to the next bit of this element to be processed.
4316 end_offset is the offset of the first bit past the end of
4318 while (next_offset < end_offset)
4322 HOST_WIDE_INT value;
4323 HOST_WIDE_INT next_byte = next_offset / BITS_PER_UNIT;
4324 HOST_WIDE_INT next_bit = next_offset % BITS_PER_UNIT;
4326 /* Advance from byte to byte
4327 within this element when necessary. */
4328 while (next_byte != total_bytes)
4330 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4335 /* Number of bits we can process at once
4336 (all part of the same byte). */
4337 this_time = MIN (end_offset - next_offset,
4338 BITS_PER_UNIT - next_bit);
4339 if (BYTES_BIG_ENDIAN)
4341 /* On big-endian machine, take the most significant bits
4342 first (of the bits that are significant)
4343 and put them into bytes from the most significant end. */
4344 shift = end_offset - next_offset - this_time;
4346 /* Don't try to take a bunch of bits that cross
4347 the word boundary in the INTEGER_CST. We can
4348 only select bits from the LOW or HIGH part
4350 if (shift < HOST_BITS_PER_WIDE_INT
4351 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4353 this_time = shift + this_time - HOST_BITS_PER_WIDE_INT;
4354 shift = HOST_BITS_PER_WIDE_INT;
4357 /* Now get the bits from the appropriate constant word. */
4358 if (shift < HOST_BITS_PER_WIDE_INT)
4359 value = TREE_INT_CST_LOW (val);
4360 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4362 value = TREE_INT_CST_HIGH (val);
4363 shift -= HOST_BITS_PER_WIDE_INT;
4368 /* Get the result. This works only when:
4369 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4370 byte |= (((value >> shift)
4371 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4372 << (BITS_PER_UNIT - this_time - next_bit));
4376 /* On little-endian machines,
4377 take first the least significant bits of the value
4378 and pack them starting at the least significant
4379 bits of the bytes. */
4380 shift = next_offset - int_bit_position (field);
4382 /* Don't try to take a bunch of bits that cross
4383 the word boundary in the INTEGER_CST. We can
4384 only select bits from the LOW or HIGH part
4386 if (shift < HOST_BITS_PER_WIDE_INT
4387 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4388 this_time = (HOST_BITS_PER_WIDE_INT - shift);
4390 /* Now get the bits from the appropriate constant word. */
4391 if (shift < HOST_BITS_PER_WIDE_INT)
4392 value = TREE_INT_CST_LOW (val);
4393 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4395 value = TREE_INT_CST_HIGH (val);
4396 shift -= HOST_BITS_PER_WIDE_INT;
4401 /* Get the result. This works only when:
4402 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4403 byte |= (((value >> shift)
4404 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4408 next_offset += this_time;
4409 byte_buffer_in_use = 1;
4414 if (byte_buffer_in_use)
4416 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4420 if (total_bytes < size)
4421 assemble_zeros (size - total_bytes);
4424 /* This TREE_LIST contains any weak symbol declarations waiting
4426 static GTY(()) tree weak_decls;
4428 /* Mark DECL as weak. */
4434 DECL_WEAK (decl) = 1;
4436 if (DECL_RTL_SET_P (decl)
4437 && GET_CODE (DECL_RTL (decl)) == MEM
4438 && XEXP (DECL_RTL (decl), 0)
4439 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == SYMBOL_REF)
4440 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl), 0)) = 1;
4443 /* Merge weak status between NEWDECL and OLDDECL. */
4446 merge_weak (newdecl, olddecl)
4450 if (DECL_WEAK (newdecl) == DECL_WEAK (olddecl))
4453 if (DECL_WEAK (newdecl))
4457 /* NEWDECL is weak, but OLDDECL is not. */
4459 /* If we already output the OLDDECL, we're in trouble; we can't
4460 go back and make it weak. This error cannot caught in
4461 declare_weak because the NEWDECL and OLDDECL was not yet
4462 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4463 if (TREE_ASM_WRITTEN (olddecl))
4464 error_with_decl (newdecl,
4465 "weak declaration of `%s' must precede definition");
4467 /* If we've already generated rtl referencing OLDDECL, we may
4468 have done so in a way that will not function properly with
4470 else if (TREE_USED (olddecl)
4471 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl)))
4472 warning_with_decl (newdecl, "weak declaration of `%s' after first use results in unspecified behavior");
4476 /* We put the NEWDECL on the weak_decls list at some point.
4477 Replace it with the OLDDECL. */
4478 for (wd = weak_decls; wd; wd = TREE_CHAIN (wd))
4479 if (TREE_VALUE (wd) == newdecl)
4481 TREE_VALUE (wd) = olddecl;
4484 /* We may not find the entry on the list. If NEWDECL is a
4485 weak alias, then we will have already called
4486 globalize_decl to remove the entry; in that case, we do
4487 not need to do anything. */
4490 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4491 mark_weak (olddecl);
4494 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4495 weak. Just update NEWDECL to indicate that it's weak too. */
4496 mark_weak (newdecl);
4499 /* Declare DECL to be a weak symbol. */
4505 if (! TREE_PUBLIC (decl))
4506 error_with_decl (decl, "weak declaration of `%s' must be public");
4507 else if (TREE_CODE (decl) == FUNCTION_DECL && TREE_ASM_WRITTEN (decl))
4508 error_with_decl (decl, "weak declaration of `%s' must precede definition");
4509 else if (SUPPORTS_WEAK)
4511 if (! DECL_WEAK (decl))
4512 weak_decls = tree_cons (NULL, decl, weak_decls);
4515 warning_with_decl (decl, "weak declaration of `%s' not supported");
4520 /* Emit any pending weak declarations. */
4527 for (t = weak_decls; t; t = TREE_CHAIN (t))
4529 tree decl = TREE_VALUE (t);
4530 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4531 const char *const name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4534 if (! TREE_USED (decl))
4537 #ifdef ASM_WEAKEN_DECL
4538 ASM_WEAKEN_DECL (asm_out_file, decl, name, NULL);
4540 #ifdef ASM_WEAKEN_LABEL
4541 ASM_WEAKEN_LABEL (asm_out_file, name);
4543 #ifdef ASM_OUTPUT_WEAK_ALIAS
4544 warning ("only weak aliases are supported in this configuration");
4552 /* Emit the assembly bits to indicate that DECL is globally visible. */
4555 globalize_decl (decl)
4558 const char *name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4560 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4561 if (DECL_WEAK (decl))
4565 #ifdef ASM_WEAKEN_DECL
4566 ASM_WEAKEN_DECL (asm_out_file, decl, name, 0);
4568 ASM_WEAKEN_LABEL (asm_out_file, name);
4571 /* Remove this function from the pending weak list so that
4572 we do not emit multiple .weak directives for it. */
4573 for (p = &weak_decls; (t = *p) ; )
4575 if (DECL_ASSEMBLER_NAME (decl) == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
4576 *p = TREE_CHAIN (t);
4578 p = &TREE_CHAIN (t);
4584 (*targetm.asm_out.globalize_label) (asm_out_file, name);
4587 /* Emit an assembler directive to make the symbol for DECL an alias to
4588 the symbol for TARGET. */
4591 assemble_alias (decl, target)
4592 tree decl, target ATTRIBUTE_UNUSED;
4596 /* We must force creation of DECL_RTL for debug info generation, even though
4597 we don't use it here. */
4598 make_decl_rtl (decl, NULL);
4600 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4602 #ifdef ASM_OUTPUT_DEF
4603 /* Make name accessible from other files, if appropriate. */
4605 if (TREE_PUBLIC (decl))
4607 globalize_decl (decl);
4608 maybe_assemble_visibility (decl);
4611 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4612 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
4614 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4616 #else /* !ASM_OUTPUT_DEF */
4617 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4618 if (! DECL_WEAK (decl))
4619 warning ("only weak aliases are supported in this configuration");
4621 #ifdef ASM_WEAKEN_DECL
4622 ASM_WEAKEN_DECL (asm_out_file, decl, name, IDENTIFIER_POINTER (target));
4624 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
4627 warning ("alias definitions not supported in this configuration; ignored");
4631 TREE_USED (decl) = 1;
4632 TREE_ASM_WRITTEN (decl) = 1;
4633 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl)) = 1;
4636 /* Emit an assembler directive to set symbol for DECL visibility to
4637 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4640 default_assemble_visibility (decl, vis)
4644 static const char * const visibility_types[] = {
4645 NULL, "internal", "hidden", "protected"
4648 const char *name, *type;
4650 name = (* targetm.strip_name_encoding)
4651 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
4652 type = visibility_types[vis];
4654 #ifdef HAVE_GAS_HIDDEN
4655 fprintf (asm_out_file, "\t.%s\t%s\n", type, name);
4657 warning ("visibility attribute not supported in this configuration; ignored");
4661 /* A helper function to call assemble_visibility when needed for a decl. */
4664 maybe_assemble_visibility (decl)
4667 enum symbol_visibility vis = decl_visibility (decl);
4669 if (vis != VISIBILITY_DEFAULT)
4670 (* targetm.asm_out.visibility) (decl, vis);
4673 /* Returns 1 if the target configuration supports defining public symbols
4674 so that one of them will be chosen at link time instead of generating a
4675 multiply-defined symbol error, whether through the use of weak symbols or
4676 a target-specific mechanism for having duplicates discarded. */
4679 supports_one_only ()
4681 if (SUPPORTS_ONE_ONLY)
4683 return SUPPORTS_WEAK;
4686 /* Set up DECL as a public symbol that can be defined in multiple
4687 translation units without generating a linker error. */
4690 make_decl_one_only (decl)
4693 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL)
4696 TREE_PUBLIC (decl) = 1;
4698 if (TREE_CODE (decl) == VAR_DECL
4699 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
4700 DECL_COMMON (decl) = 1;
4701 else if (SUPPORTS_ONE_ONLY)
4703 #ifdef MAKE_DECL_ONE_ONLY
4704 MAKE_DECL_ONE_ONLY (decl);
4706 DECL_ONE_ONLY (decl) = 1;
4708 else if (SUPPORTS_WEAK)
4709 declare_weak (decl);
4717 const_str_htab = htab_create_ggc (128, const_str_htab_hash,
4718 const_str_htab_eq, NULL);
4719 in_named_htab = htab_create_ggc (31, in_named_entry_hash,
4720 in_named_entry_eq, NULL);
4722 const_alias_set = new_alias_set ();
4726 decl_tls_model (decl)
4729 enum tls_model kind;
4730 tree attr = lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl));
4735 attr = TREE_VALUE (TREE_VALUE (attr));
4736 if (TREE_CODE (attr) != STRING_CST)
4738 if (!strcmp (TREE_STRING_POINTER (attr), "local-exec"))
4739 kind = TLS_MODEL_LOCAL_EXEC;
4740 else if (!strcmp (TREE_STRING_POINTER (attr), "initial-exec"))
4741 kind = TLS_MODEL_INITIAL_EXEC;
4742 else if (!strcmp (TREE_STRING_POINTER (attr), "local-dynamic"))
4743 kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
4744 else if (!strcmp (TREE_STRING_POINTER (attr), "global-dynamic"))
4745 kind = TLS_MODEL_GLOBAL_DYNAMIC;
4751 is_local = (*targetm.binds_local_p) (decl);
4755 kind = TLS_MODEL_LOCAL_EXEC;
4757 kind = TLS_MODEL_INITIAL_EXEC;
4759 /* Local dynamic is inefficient when we're not combining the
4760 parts of the address. */
4761 else if (optimize && is_local)
4762 kind = TLS_MODEL_LOCAL_DYNAMIC;
4764 kind = TLS_MODEL_GLOBAL_DYNAMIC;
4765 if (kind < flag_tls_default)
4766 kind = flag_tls_default;
4771 enum symbol_visibility
4772 decl_visibility (decl)
4775 tree attr = lookup_attribute ("visibility", DECL_ATTRIBUTES (decl));
4779 const char *which = TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr)));
4781 if (strcmp (which, "default") == 0)
4782 return VISIBILITY_DEFAULT;
4783 if (strcmp (which, "internal") == 0)
4784 return VISIBILITY_INTERNAL;
4785 if (strcmp (which, "hidden") == 0)
4786 return VISIBILITY_HIDDEN;
4787 if (strcmp (which, "protected") == 0)
4788 return VISIBILITY_PROTECTED;
4793 return VISIBILITY_DEFAULT;
4796 /* Select a set of attributes for section NAME based on the properties
4797 of DECL and whether or not RELOC indicates that DECL's initializer
4798 might contain runtime relocations.
4800 We make the section read-only and executable for a function decl,
4801 read-only for a const data decl, and writable for a non-const data decl. */
4804 default_section_type_flags (decl, name, reloc)
4809 return default_section_type_flags_1 (decl, name, reloc, flag_pic);
4813 default_section_type_flags_1 (decl, name, reloc, shlib)
4821 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
4822 flags = SECTION_CODE;
4823 else if (decl && decl_readonly_section_1 (decl, reloc, shlib))
4826 flags = SECTION_WRITE;
4828 if (decl && DECL_ONE_ONLY (decl))
4829 flags |= SECTION_LINKONCE;
4831 if (decl && TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4832 flags |= SECTION_TLS | SECTION_WRITE;
4834 if (strcmp (name, ".bss") == 0
4835 || strncmp (name, ".bss.", 5) == 0
4836 || strncmp (name, ".gnu.linkonce.b.", 16) == 0
4837 || strcmp (name, ".sbss") == 0
4838 || strncmp (name, ".sbss.", 6) == 0
4839 || strncmp (name, ".gnu.linkonce.sb.", 17) == 0
4840 || strcmp (name, ".tbss") == 0
4841 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4842 flags |= SECTION_BSS;
4844 if (strcmp (name, ".tdata") == 0
4845 || strcmp (name, ".tbss") == 0
4846 || strncmp (name, ".gnu.linkonce.td.", 17) == 0
4847 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4848 flags |= SECTION_TLS;
4850 /* These three sections have special ELF types. They are neither
4851 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4852 want to print a section type (@progbits or @nobits). If someone
4853 is silly enough to emit code or TLS variables to one of these
4854 sections, then don't handle them specially. */
4855 if (!(flags & (SECTION_CODE | SECTION_BSS | SECTION_TLS))
4856 && (strcmp (name, ".init_array") == 0
4857 || strcmp (name, ".fini_array") == 0
4858 || strcmp (name, ".preinit_array") == 0))
4859 flags |= SECTION_NOTYPE;
4864 /* Output assembly to switch to section NAME with attribute FLAGS.
4865 Four variants for common object file formats. */
4868 default_no_named_section (name, flags)
4869 const char *name ATTRIBUTE_UNUSED;
4870 unsigned int flags ATTRIBUTE_UNUSED;
4872 /* Some object formats don't support named sections at all. The
4873 front-end should already have flagged this as an error. */
4878 default_elf_asm_named_section (name, flags)
4882 char flagchars[10], *f = flagchars;
4884 if (! named_section_first_declaration (name))
4886 fprintf (asm_out_file, "\t.section\t%s\n", name);
4890 if (!(flags & SECTION_DEBUG))
4892 if (flags & SECTION_WRITE)
4894 if (flags & SECTION_CODE)
4896 if (flags & SECTION_SMALL)
4898 if (flags & SECTION_MERGE)
4900 if (flags & SECTION_STRINGS)
4902 if (flags & SECTION_TLS)
4906 fprintf (asm_out_file, "\t.section\t%s,\"%s\"", name, flagchars);
4908 if (!(flags & SECTION_NOTYPE))
4912 if (flags & SECTION_BSS)
4917 fprintf (asm_out_file, ",@%s", type);
4919 if (flags & SECTION_ENTSIZE)
4920 fprintf (asm_out_file, ",%d", flags & SECTION_ENTSIZE);
4923 putc ('\n', asm_out_file);
4927 default_coff_asm_named_section (name, flags)
4931 char flagchars[8], *f = flagchars;
4933 if (flags & SECTION_WRITE)
4935 if (flags & SECTION_CODE)
4939 fprintf (asm_out_file, "\t.section\t%s,\"%s\"\n", name, flagchars);
4943 default_pe_asm_named_section (name, flags)
4947 default_coff_asm_named_section (name, flags);
4949 if (flags & SECTION_LINKONCE)
4951 /* Functions may have been compiled at various levels of
4952 optimization so we can't use `same_size' here.
4953 Instead, have the linker pick one. */
4954 fprintf (asm_out_file, "\t.linkonce %s\n",
4955 (flags & SECTION_CODE ? "discard" : "same_size"));
4959 /* Used for vtable gc in GNU binutils. Record that the pointer at OFFSET
4960 from SYMBOL is used in all classes derived from SYMBOL. */
4963 assemble_vtable_entry (symbol, offset)
4965 HOST_WIDE_INT offset;
4967 fputs ("\t.vtable_entry ", asm_out_file);
4968 output_addr_const (asm_out_file, symbol);
4969 fputs (", ", asm_out_file);
4970 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC, offset);
4971 fputc ('\n', asm_out_file);
4974 /* Used for vtable gc in GNU binutils. Record the class hierarchy by noting
4975 that the vtable symbol CHILD is derived from the vtable symbol PARENT. */
4978 assemble_vtable_inherit (child, parent)
4981 fputs ("\t.vtable_inherit ", asm_out_file);
4982 output_addr_const (asm_out_file, child);
4983 fputs (", ", asm_out_file);
4984 output_addr_const (asm_out_file, parent);
4985 fputc ('\n', asm_out_file);
4988 /* The lame default section selector. */
4991 default_select_section (decl, reloc, align)
4994 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED;
4996 bool readonly = false;
5000 if (decl_readonly_section (decl, reloc))
5003 else if (TREE_CODE (decl) == CONSTRUCTOR)
5005 if (! ((flag_pic && reloc)
5006 || !TREE_READONLY (decl)
5007 || TREE_SIDE_EFFECTS (decl)
5008 || !TREE_CONSTANT (decl)))
5011 else if (TREE_CODE (decl) == STRING_CST)
5012 readonly = !flag_writable_strings;
5013 else if (! (flag_pic && reloc))
5017 readonly_data_section ();
5022 /* A helper function for default_elf_select_section and
5023 default_elf_unique_section. Categorizes the DECL. */
5025 enum section_category
5030 SECCAT_RODATA_MERGE_STR,
5031 SECCAT_RODATA_MERGE_STR_INIT,
5032 SECCAT_RODATA_MERGE_CONST,
5037 /* To optimize loading of shared programs, define following subsections
5039 _REL Contains data that has relocations, so they get grouped
5040 together and dynamic linker will visit fewer pages in memory.
5041 _RO Contains data that is otherwise read-only. This is useful
5042 with prelinking as most relocations won't be dynamically
5043 linked and thus stay read only.
5044 _LOCAL Marks data containing relocations only to local objects.
5045 These relocations will get fully resolved by prelinking. */
5047 SECCAT_DATA_REL_LOCAL,
5049 SECCAT_DATA_REL_RO_LOCAL,
5059 static enum section_category
5060 categorize_decl_for_section PARAMS ((tree, int, int));
5062 static enum section_category
5063 categorize_decl_for_section (decl, reloc, shlib)
5068 enum section_category ret;
5070 if (TREE_CODE (decl) == FUNCTION_DECL)
5072 else if (TREE_CODE (decl) == STRING_CST)
5074 if (flag_writable_strings)
5077 return SECCAT_RODATA_MERGE_STR;
5079 else if (TREE_CODE (decl) == VAR_DECL)
5081 if (DECL_INITIAL (decl) == NULL
5082 || DECL_INITIAL (decl) == error_mark_node)
5084 else if (! TREE_READONLY (decl)
5085 || TREE_SIDE_EFFECTS (decl)
5086 || ! TREE_CONSTANT (DECL_INITIAL (decl)))
5088 if (shlib && (reloc & 2))
5089 ret = SECCAT_DATA_REL;
5090 else if (shlib && reloc)
5091 ret = SECCAT_DATA_REL_LOCAL;
5095 else if (shlib && (reloc & 2))
5096 ret = SECCAT_DATA_REL_RO;
5097 else if (shlib && reloc)
5098 ret = SECCAT_DATA_REL_RO_LOCAL;
5099 else if (reloc || flag_merge_constants < 2)
5100 /* C and C++ don't allow different variables to share the same
5101 location. -fmerge-all-constants allows even that (at the
5102 expense of not conforming). */
5103 ret = SECCAT_RODATA;
5104 else if (TREE_CODE (DECL_INITIAL (decl)) == STRING_CST)
5105 ret = SECCAT_RODATA_MERGE_STR_INIT;
5107 ret = SECCAT_RODATA_MERGE_CONST;
5109 else if (TREE_CODE (decl) == CONSTRUCTOR)
5111 if ((shlib && reloc)
5112 || TREE_SIDE_EFFECTS (decl)
5113 || ! TREE_CONSTANT (decl))
5116 ret = SECCAT_RODATA;
5119 ret = SECCAT_RODATA;
5121 /* There are no read-only thread-local sections. */
5122 if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
5124 if (ret == SECCAT_BSS)
5130 /* If the target uses small data sections, select it. */
5131 else if ((*targetm.in_small_data_p) (decl))
5133 if (ret == SECCAT_BSS)
5135 else if (targetm.have_srodata_section && ret == SECCAT_RODATA)
5136 ret = SECCAT_SRODATA;
5145 decl_readonly_section (decl, reloc)
5149 return decl_readonly_section_1 (decl, reloc, flag_pic);
5153 decl_readonly_section_1 (decl, reloc, shlib)
5158 switch (categorize_decl_for_section (decl, reloc, shlib))
5161 case SECCAT_RODATA_MERGE_STR:
5162 case SECCAT_RODATA_MERGE_STR_INIT:
5163 case SECCAT_RODATA_MERGE_CONST:
5164 case SECCAT_SRODATA:
5173 /* Select a section based on the above categorization. */
5176 default_elf_select_section (decl, reloc, align)
5179 unsigned HOST_WIDE_INT align;
5181 default_elf_select_section_1 (decl, reloc, align, flag_pic);
5185 default_elf_select_section_1 (decl, reloc, align, shlib)
5188 unsigned HOST_WIDE_INT align;
5191 switch (categorize_decl_for_section (decl, reloc, shlib))
5194 /* We're not supposed to be called on FUNCTION_DECLs. */
5197 readonly_data_section ();
5199 case SECCAT_RODATA_MERGE_STR:
5200 mergeable_string_section (decl, align, 0);
5202 case SECCAT_RODATA_MERGE_STR_INIT:
5203 mergeable_string_section (DECL_INITIAL (decl), align, 0);
5205 case SECCAT_RODATA_MERGE_CONST:
5206 mergeable_constant_section (DECL_MODE (decl), align, 0);
5208 case SECCAT_SRODATA:
5209 named_section (NULL_TREE, ".sdata2", reloc);
5214 case SECCAT_DATA_REL:
5215 named_section (NULL_TREE, ".data.rel", reloc);
5217 case SECCAT_DATA_REL_LOCAL:
5218 named_section (NULL_TREE, ".data.rel.local", reloc);
5220 case SECCAT_DATA_REL_RO:
5221 named_section (NULL_TREE, ".data.rel.ro", reloc);
5223 case SECCAT_DATA_REL_RO_LOCAL:
5224 named_section (NULL_TREE, ".data.rel.ro.local", reloc);
5227 named_section (NULL_TREE, ".sdata", reloc);
5230 named_section (NULL_TREE, ".tdata", reloc);
5233 #ifdef BSS_SECTION_ASM_OP
5236 named_section (NULL_TREE, ".bss", reloc);
5240 named_section (NULL_TREE, ".sbss", reloc);
5243 named_section (NULL_TREE, ".tbss", reloc);
5250 /* Construct a unique section name based on the decl name and the
5251 categorization performed above. */
5254 default_unique_section (decl, reloc)
5258 default_unique_section_1 (decl, reloc, flag_pic);
5262 default_unique_section_1 (decl, reloc, shlib)
5267 bool one_only = DECL_ONE_ONLY (decl);
5268 const char *prefix, *name;
5272 switch (categorize_decl_for_section (decl, reloc, shlib))
5275 prefix = one_only ? ".gnu.linkonce.t." : ".text.";
5278 case SECCAT_RODATA_MERGE_STR:
5279 case SECCAT_RODATA_MERGE_STR_INIT:
5280 case SECCAT_RODATA_MERGE_CONST:
5281 prefix = one_only ? ".gnu.linkonce.r." : ".rodata.";
5283 case SECCAT_SRODATA:
5284 prefix = one_only ? ".gnu.linkonce.s2." : ".sdata2.";
5287 case SECCAT_DATA_REL:
5288 case SECCAT_DATA_REL_LOCAL:
5289 case SECCAT_DATA_REL_RO:
5290 case SECCAT_DATA_REL_RO_LOCAL:
5291 prefix = one_only ? ".gnu.linkonce.d." : ".data.";
5294 prefix = one_only ? ".gnu.linkonce.s." : ".sdata.";
5297 prefix = one_only ? ".gnu.linkonce.b." : ".bss.";
5300 prefix = one_only ? ".gnu.linkonce.sb." : ".sbss.";
5303 prefix = one_only ? ".gnu.linkonce.td." : ".tdata.";
5306 prefix = one_only ? ".gnu.linkonce.tb." : ".tbss.";
5311 plen = strlen (prefix);
5313 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
5314 name = (* targetm.strip_name_encoding) (name);
5315 nlen = strlen (name);
5317 string = alloca (nlen + plen + 1);
5318 memcpy (string, prefix, plen);
5319 memcpy (string + plen, name, nlen + 1);
5321 DECL_SECTION_NAME (decl) = build_string (nlen + plen, string);
5325 default_select_rtx_section (mode, x, align)
5326 enum machine_mode mode ATTRIBUTE_UNUSED;
5328 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED;
5331 switch (GET_CODE (x))
5343 readonly_data_section ();
5347 default_elf_select_rtx_section (mode, x, align)
5348 enum machine_mode mode;
5350 unsigned HOST_WIDE_INT align;
5352 /* ??? Handle small data here somehow. */
5355 switch (GET_CODE (x))
5359 named_section (NULL_TREE, ".data.rel.ro", 3);
5363 named_section (NULL_TREE, ".data.rel.ro.local", 1);
5370 mergeable_constant_section (mode, align, 0);
5373 /* By default, we do nothing for encode_section_info, so we need not
5374 do anything but discard the '*' marker. */
5377 default_strip_name_encoding (str)
5380 return str + (*str == '*');
5383 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5384 wrt cross-module name binding. */
5387 default_binds_local_p (exp)
5390 return default_binds_local_p_1 (exp, flag_pic);
5394 default_binds_local_p_1 (exp, shlib)
5400 /* A non-decl is an entry in the constant pool. */
5403 /* Static variables are always local. */
5404 else if (! TREE_PUBLIC (exp))
5406 /* A variable is local if the user tells us so. */
5407 else if (decl_visibility (exp) != VISIBILITY_DEFAULT)
5409 /* Otherwise, variables defined outside this object may not be local. */
5410 else if (DECL_EXTERNAL (exp))
5412 /* Linkonce and weak data are never local. */
5413 else if (DECL_ONE_ONLY (exp) || DECL_WEAK (exp))
5415 /* If PIC, then assume that any global name can be overridden by
5416 symbols resolved from other modules. */
5419 /* Uninitialized COMMON variable may be unified with symbols
5420 resolved from other modules. */
5421 else if (DECL_COMMON (exp)
5422 && (DECL_INITIAL (exp) == NULL
5423 || DECL_INITIAL (exp) == error_mark_node))
5425 /* Otherwise we're left with initialized (or non-common) global data
5426 which is of necessity defined locally. */
5433 /* Determine whether or not a pointer mode is valid. Assume defaults
5434 of ptr_mode or Pmode - can be overridden. */
5436 default_valid_pointer_mode (mode)
5437 enum machine_mode mode;
5439 return (mode == ptr_mode || mode == Pmode);
5442 /* Default function to output code that will globalize a label. A
5443 target must define GLOBAL_ASM_OP or provide it's own function to
5444 globalize a label. */
5445 #ifdef GLOBAL_ASM_OP
5447 default_globalize_label (stream, name)
5451 fputs (GLOBAL_ASM_OP, stream);
5452 assemble_name (stream, name);
5453 putc ('\n', stream);
5455 #endif /* GLOBAL_ASM_OP */
5457 /* This is how to output an internal numbered label where PREFIX is
5458 the class of label and LABELNO is the number within the class. */
5461 default_internal_label (stream, prefix, labelno)
5464 unsigned long labelno;
5466 char *const buf = alloca (40 + strlen (prefix));
5467 ASM_GENERATE_INTERNAL_LABEL (buf, prefix, labelno);
5468 ASM_OUTPUT_LABEL (stream, buf);
5471 #include "gt-varasm.h"