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 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
37 #include "hard-reg-set.h"
46 #include "langhooks.h"
51 #ifdef XCOFF_DEBUGGING_INFO
52 #include "xcoffout.h" /* Needed for external data
53 declarations for e.g. AIX 4.x. */
56 #ifndef TRAMPOLINE_ALIGNMENT
57 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
61 #define ASM_STABS_OP "\t.stabs\t"
64 /* The (assembler) name of the first globally-visible object output. */
65 const char *first_global_object_name;
66 const char *weak_global_object_name;
69 struct constant_descriptor_rtx;
73 #define MAX_RTX_HASH_TABLE 61
75 struct varasm_status GTY(())
77 /* Hash facility for making memory-constants
78 from constant rtl-expressions. It is used on RISC machines
79 where immediate integer arguments and constant addresses are restricted
80 so that such constants must be stored in memory.
82 This pool of constants is reinitialized for each function
83 so each function gets its own constants-pool that comes right before
85 struct constant_descriptor_rtx ** GTY ((length ("MAX_RTX_HASH_TABLE")))
86 x_const_rtx_hash_table;
87 struct pool_constant ** GTY ((length ("MAX_RTX_HASH_TABLE")))
88 x_const_rtx_sym_hash_table;
90 /* Pointers to first and last constant in pool. */
91 struct pool_constant *x_first_pool;
92 struct pool_constant *x_last_pool;
94 /* Current offset in constant pool (does not include any machine-specific
96 HOST_WIDE_INT x_pool_offset;
99 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
100 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
101 #define first_pool (cfun->varasm->x_first_pool)
102 #define last_pool (cfun->varasm->x_last_pool)
103 #define pool_offset (cfun->varasm->x_pool_offset)
105 /* Number for making the label on the next
106 constant that is stored in memory. */
110 /* Number for making the label on the next
111 static variable internal to a function. */
115 /* Carry information from ASM_DECLARE_OBJECT_NAME
116 to ASM_FINISH_DECLARE_OBJECT. */
118 int size_directive_output;
120 /* The last decl for which assemble_variable was called,
121 if it did ASM_DECLARE_OBJECT_NAME.
122 If the last call to assemble_variable didn't do that,
125 tree last_assemble_variable_decl;
127 /* RTX_UNCHANGING_P in a MEM can mean it is stored into, for initialization.
128 So giving constant the alias set for the type will allow such
129 initializations to appear to conflict with the load of the constant. We
130 avoid this by giving all constants an alias set for just constants.
131 Since there will be no stores to that alias set, nothing will ever
132 conflict with them. */
134 static HOST_WIDE_INT const_alias_set;
136 static const char *strip_reg_name PARAMS ((const char *));
137 static int contains_pointers_p PARAMS ((tree));
138 static void decode_addr_const PARAMS ((tree, struct addr_const *));
139 static int const_hash PARAMS ((tree));
140 static int compare_constant PARAMS ((tree, tree));
141 static tree copy_constant PARAMS ((tree));
142 static void output_constant_def_contents PARAMS ((tree, int, int));
143 static void decode_rtx_const PARAMS ((enum machine_mode, rtx,
144 struct rtx_const *));
145 static int const_hash_rtx PARAMS ((enum machine_mode, rtx));
146 static int compare_constant_rtx
147 PARAMS ((enum machine_mode, rtx, struct constant_descriptor_rtx *));
148 static struct constant_descriptor_rtx * record_constant_rtx
149 PARAMS ((enum machine_mode, rtx));
150 static struct pool_constant *find_pool_constant PARAMS ((struct function *, rtx));
151 static void mark_constant_pool PARAMS ((void));
152 static void mark_constants PARAMS ((rtx));
153 static int mark_constant PARAMS ((rtx *current_rtx, void *data));
154 static int output_addressed_constants PARAMS ((tree));
155 static void output_after_function_constants PARAMS ((void));
156 static unsigned HOST_WIDE_INT array_size_for_constructor PARAMS ((tree));
157 static unsigned min_align PARAMS ((unsigned, unsigned));
158 static void output_constructor PARAMS ((tree, HOST_WIDE_INT,
160 static void globalize_decl PARAMS ((tree));
161 static void maybe_assemble_visibility PARAMS ((tree));
162 static int in_named_entry_eq PARAMS ((const PTR, const PTR));
163 static hashval_t in_named_entry_hash PARAMS ((const PTR));
164 #ifdef ASM_OUTPUT_BSS
165 static void asm_output_bss PARAMS ((FILE *, tree, const char *, int, int));
167 #ifdef BSS_SECTION_ASM_OP
168 #ifdef ASM_OUTPUT_ALIGNED_BSS
169 static void asm_output_aligned_bss PARAMS ((FILE *, tree, const char *,
172 #endif /* BSS_SECTION_ASM_OP */
173 static hashval_t const_str_htab_hash PARAMS ((const void *x));
174 static int const_str_htab_eq PARAMS ((const void *x, const void *y));
175 static void asm_emit_uninitialised PARAMS ((tree, const char*, int, int));
176 static void resolve_unique_section PARAMS ((tree, int, int));
177 static void mark_weak PARAMS ((tree));
179 static enum in_section { no_section, in_text, in_data, in_named
180 #ifdef BSS_SECTION_ASM_OP
183 #ifdef CTORS_SECTION_ASM_OP
186 #ifdef DTORS_SECTION_ASM_OP
189 #ifdef READONLY_DATA_SECTION_ASM_OP
192 #ifdef EXTRA_SECTIONS
195 } in_section = no_section;
197 /* Return a non-zero value if DECL has a section attribute. */
198 #ifndef IN_NAMED_SECTION
199 #define IN_NAMED_SECTION(DECL) \
200 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
201 && DECL_SECTION_NAME (DECL) != NULL_TREE)
204 /* Text of section name when in_section == in_named. */
205 static const char *in_named_name;
207 /* Hash table of flags that have been used for a particular named section. */
209 struct in_named_entry
216 static htab_t in_named_htab;
218 /* Define functions like text_section for any extra sections. */
219 #ifdef EXTRA_SECTION_FUNCTIONS
220 EXTRA_SECTION_FUNCTIONS
223 /* Tell assembler to switch to text section. */
228 if (in_section != in_text)
230 in_section = in_text;
234 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
239 /* Tell assembler to switch to data section. */
244 if (in_section != in_data)
246 in_section = in_data;
247 if (flag_shared_data)
249 #ifdef SHARED_SECTION_ASM_OP
250 fprintf (asm_out_file, "%s\n", SHARED_SECTION_ASM_OP);
252 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
256 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
260 /* Tell assembler to ALWAYS switch to data section, in case
261 it's not sure where it is. */
264 force_data_section ()
266 in_section = no_section;
270 /* Tell assembler to switch to read-only data section. This is normally
274 readonly_data_section ()
276 #ifdef READONLY_DATA_SECTION
277 READONLY_DATA_SECTION (); /* Note this can call data_section. */
279 #ifdef READONLY_DATA_SECTION_ASM_OP
280 if (in_section != in_readonly_data)
282 in_section = in_readonly_data;
283 fputs (READONLY_DATA_SECTION_ASM_OP, asm_out_file);
284 fputc ('\n', asm_out_file);
292 /* Determine if we're in the text section. */
297 return in_section == in_text;
300 /* Determine if we're in the data section. */
305 return in_section == in_data;
308 /* Helper routines for maintaining in_named_htab. */
311 in_named_entry_eq (p1, p2)
315 const struct in_named_entry *old = p1;
316 const char *new = p2;
318 return strcmp (old->name, new) == 0;
322 in_named_entry_hash (p)
325 const struct in_named_entry *old = p;
326 return htab_hash_string (old->name);
329 /* If SECTION has been seen before as a named section, return the flags
330 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
331 set of flags for a section to have, so 0 does not mean that the section
332 has not been seen. */
335 get_named_section_flags (section)
338 struct in_named_entry **slot;
340 slot = (struct in_named_entry **)
341 htab_find_slot_with_hash (in_named_htab, section,
342 htab_hash_string (section), NO_INSERT);
344 return slot ? (*slot)->flags : 0;
347 /* Returns true if the section has been declared before. Sets internal
348 flag on this section in in_named_hash so subsequent calls on this
349 section will return false. */
352 named_section_first_declaration (name)
355 struct in_named_entry **slot;
357 slot = (struct in_named_entry **)
358 htab_find_slot_with_hash (in_named_htab, name,
359 htab_hash_string (name), NO_INSERT);
360 if (! (*slot)->declared)
362 (*slot)->declared = true;
372 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
373 different set of flags, return false. */
376 set_named_section_flags (section, flags)
380 struct in_named_entry **slot, *entry;
382 slot = (struct in_named_entry **)
383 htab_find_slot_with_hash (in_named_htab, section,
384 htab_hash_string (section), INSERT);
389 entry = (struct in_named_entry *) xmalloc (sizeof (*entry));
391 entry->name = ggc_strdup (section);
392 entry->flags = flags;
393 entry->declared = false;
395 else if (entry->flags != flags)
401 /* Tell assembler to change to section NAME with attributes FLAGS. */
404 named_section_flags (name, flags)
408 if (in_section != in_named || strcmp (name, in_named_name) != 0)
410 if (! set_named_section_flags (name, flags))
413 (*targetm.asm_out.named_section) (name, flags);
415 if (flags & SECTION_FORGET)
416 in_section = no_section;
419 in_named_name = ggc_strdup (name);
420 in_section = in_named;
425 /* Tell assembler to change to section NAME for DECL.
426 If DECL is NULL, just switch to section NAME.
427 If NAME is NULL, get the name from DECL.
428 If RELOC is 1, the initializer for DECL contains relocs. */
431 named_section (decl, name, reloc)
438 if (decl != NULL_TREE && !DECL_P (decl))
441 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
443 flags = (* targetm.section_type_flags) (decl, name, reloc);
445 /* Sanity check user variables for flag changes. Non-user
446 section flag changes will abort in named_section_flags.
447 However, don't complain if SECTION_OVERRIDE is set.
448 We trust that the setter knows that it is safe to ignore
449 the default flags for this decl. */
450 if (decl && ! set_named_section_flags (name, flags))
452 flags = get_named_section_flags (name);
453 if ((flags & SECTION_OVERRIDE) == 0)
454 error_with_decl (decl, "%s causes a section type conflict");
457 named_section_flags (name, flags);
460 /* If required, set DECL_SECTION_NAME to a unique name. */
463 resolve_unique_section (decl, reloc, flag_function_or_data_sections)
465 int reloc ATTRIBUTE_UNUSED;
466 int flag_function_or_data_sections;
468 if (DECL_SECTION_NAME (decl) == NULL_TREE
469 && targetm.have_named_sections
470 && (flag_function_or_data_sections
471 || DECL_ONE_ONLY (decl)))
472 (*targetm.asm_out.unique_section) (decl, reloc);
475 #ifdef BSS_SECTION_ASM_OP
477 /* Tell the assembler to switch to the bss section. */
482 if (in_section != in_bss)
484 #ifdef SHARED_BSS_SECTION_ASM_OP
485 if (flag_shared_data)
486 fprintf (asm_out_file, "%s\n", SHARED_BSS_SECTION_ASM_OP);
489 fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP);
495 #ifdef ASM_OUTPUT_BSS
497 /* Utility function for ASM_OUTPUT_BSS for targets to use if
498 they don't support alignments in .bss.
499 ??? It is believed that this function will work in most cases so such
500 support is localized here. */
503 asm_output_bss (file, decl, name, size, rounded)
505 tree decl ATTRIBUTE_UNUSED;
507 int size ATTRIBUTE_UNUSED, rounded;
509 ASM_GLOBALIZE_LABEL (file, name);
511 #ifdef ASM_DECLARE_OBJECT_NAME
512 last_assemble_variable_decl = decl;
513 ASM_DECLARE_OBJECT_NAME (file, name, decl);
515 /* Standard thing is just output label for the object. */
516 ASM_OUTPUT_LABEL (file, name);
517 #endif /* ASM_DECLARE_OBJECT_NAME */
518 ASM_OUTPUT_SKIP (file, rounded ? rounded : 1);
523 #ifdef ASM_OUTPUT_ALIGNED_BSS
525 /* Utility function for targets to use in implementing
526 ASM_OUTPUT_ALIGNED_BSS.
527 ??? It is believed that this function will work in most cases so such
528 support is localized here. */
531 asm_output_aligned_bss (file, decl, name, size, align)
533 tree decl ATTRIBUTE_UNUSED;
537 ASM_GLOBALIZE_LABEL (file, name);
539 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
540 #ifdef ASM_DECLARE_OBJECT_NAME
541 last_assemble_variable_decl = decl;
542 ASM_DECLARE_OBJECT_NAME (file, name, decl);
544 /* Standard thing is just output label for the object. */
545 ASM_OUTPUT_LABEL (file, name);
546 #endif /* ASM_DECLARE_OBJECT_NAME */
547 ASM_OUTPUT_SKIP (file, size ? size : 1);
552 #endif /* BSS_SECTION_ASM_OP */
554 /* Switch to the section for function DECL.
556 If DECL is NULL_TREE, switch to the text section.
557 ??? It's not clear that we will ever be passed NULL_TREE, but it's
558 safer to handle it. */
561 function_section (decl)
564 if (decl != NULL_TREE
565 && DECL_SECTION_NAME (decl) != NULL_TREE)
566 named_section (decl, (char *) 0, 0);
571 /* Switch to section for variable DECL. RELOC is the same as the
572 argument to SELECT_SECTION. */
575 variable_section (decl, reloc)
579 if (IN_NAMED_SECTION (decl))
580 named_section (decl, NULL, reloc);
582 (*targetm.asm_out.select_section) (decl, reloc, DECL_ALIGN (decl));
585 /* Tell assembler to switch to the section for the exception handling
589 default_exception_section ()
591 if (targetm.have_named_sections)
592 named_section (NULL_TREE, ".gcc_except_table", 0);
596 readonly_data_section ();
599 /* Tell assembler to switch to the section for string merging. */
602 mergeable_string_section (decl, align, flags)
603 tree decl ATTRIBUTE_UNUSED;
604 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED;
605 unsigned int flags ATTRIBUTE_UNUSED;
607 #ifdef HAVE_GAS_SHF_MERGE
608 if (flag_merge_constants
609 && TREE_CODE (decl) == STRING_CST
610 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
612 && TREE_STRING_LENGTH (decl) >= int_size_in_bytes (TREE_TYPE (decl)))
614 enum machine_mode mode;
615 unsigned int modesize;
620 mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (decl)));
621 modesize = GET_MODE_BITSIZE (mode);
622 if (modesize >= 8 && modesize <= 256
623 && (modesize & (modesize - 1)) == 0)
625 if (align < modesize)
628 str = TREE_STRING_POINTER (decl);
629 len = TREE_STRING_LENGTH (decl);
630 unit = GET_MODE_SIZE (mode);
632 /* Check for embedded NUL characters. */
633 for (i = 0; i < len; i += unit)
635 for (j = 0; j < unit; j++)
636 if (str[i + j] != '\0')
643 sprintf (name, ".rodata.str%d.%d", modesize / 8,
645 flags |= (modesize / 8) | SECTION_MERGE | SECTION_STRINGS;
646 if (!i && modesize < align)
648 /* A "" string with requested alignment greater than
649 character size might cause a problem:
650 if some other string required even bigger
651 alignment than "", then linker might think the
652 "" is just part of padding after some other string
653 and not put it into the hash table initially.
654 But this means "" could have smaller alignment
656 #ifdef ASM_OUTPUT_SECTION_START
657 named_section_flags (name, flags);
658 ASM_OUTPUT_SECTION_START (asm_out_file);
660 readonly_data_section ();
665 named_section_flags (name, flags);
671 readonly_data_section ();
674 /* Tell assembler to switch to the section for constant merging. */
677 mergeable_constant_section (mode, align, flags)
678 enum machine_mode mode ATTRIBUTE_UNUSED;
679 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED;
680 unsigned int flags ATTRIBUTE_UNUSED;
682 #ifdef HAVE_GAS_SHF_MERGE
683 unsigned int modesize = GET_MODE_BITSIZE (mode);
685 if (flag_merge_constants
691 && (align & (align - 1)) == 0)
695 sprintf (name, ".rodata.cst%d", (int) (align / 8));
696 flags |= (align / 8) | SECTION_MERGE;
697 named_section_flags (name, flags);
701 readonly_data_section ();
704 /* Given NAME, a putative register name, discard any customary prefixes. */
707 strip_reg_name (name)
710 #ifdef REGISTER_PREFIX
711 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
712 name += strlen (REGISTER_PREFIX);
714 if (name[0] == '%' || name[0] == '#')
719 /* Decode an `asm' spec for a declaration as a register name.
720 Return the register number, or -1 if nothing specified,
721 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
722 or -3 if ASMSPEC is `cc' and is not recognized,
723 or -4 if ASMSPEC is `memory' and is not recognized.
724 Accept an exact spelling or a decimal number.
725 Prefixes such as % are optional. */
728 decode_reg_name (asmspec)
735 /* Get rid of confusing prefixes. */
736 asmspec = strip_reg_name (asmspec);
738 /* Allow a decimal number as a "register name". */
739 for (i = strlen (asmspec) - 1; i >= 0; i--)
740 if (! ISDIGIT (asmspec[i]))
742 if (asmspec[0] != 0 && i < 0)
745 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
751 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
753 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
756 #ifdef ADDITIONAL_REGISTER_NAMES
758 static const struct { const char *const name; const int number; } table[]
759 = ADDITIONAL_REGISTER_NAMES;
761 for (i = 0; i < (int) ARRAY_SIZE (table); i++)
762 if (! strcmp (asmspec, table[i].name))
763 return table[i].number;
765 #endif /* ADDITIONAL_REGISTER_NAMES */
767 if (!strcmp (asmspec, "memory"))
770 if (!strcmp (asmspec, "cc"))
779 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
780 have static storage duration. In other words, it should not be an
781 automatic variable, including PARM_DECLs.
783 There is, however, one exception: this function handles variables
784 explicitly placed in a particular register by the user.
786 ASMSPEC, if not 0, is the string which the user specified as the
787 assembler symbol name.
789 This is never called for PARM_DECL nodes. */
792 make_decl_rtl (decl, asmspec)
796 int top_level = (DECL_CONTEXT (decl) == NULL_TREE);
797 const char *name = 0;
798 const char *new_name = 0;
802 /* Check that we are not being given an automatic variable. */
803 /* A weak alias has TREE_PUBLIC set but not the other bits. */
804 if (TREE_CODE (decl) == PARM_DECL
805 || TREE_CODE (decl) == RESULT_DECL
806 || (TREE_CODE (decl) == VAR_DECL
807 && !TREE_STATIC (decl)
808 && !TREE_PUBLIC (decl)
809 && !DECL_EXTERNAL (decl)
810 && !DECL_REGISTER (decl)))
812 /* And that we were not given a type or a label. */
813 else if (TREE_CODE (decl) == TYPE_DECL
814 || TREE_CODE (decl) == LABEL_DECL)
817 /* For a duplicate declaration, we can be called twice on the
818 same DECL node. Don't discard the RTL already made. */
819 if (DECL_RTL_SET_P (decl))
821 /* If the old RTL had the wrong mode, fix the mode. */
822 if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
823 SET_DECL_RTL (decl, adjust_address_nv (DECL_RTL (decl),
824 DECL_MODE (decl), 0));
826 /* ??? Another way to do this would be to do what halfpic.c does
827 and maintain a hashed table of such critters. */
828 /* Let the target reassign the RTL if it wants.
829 This is necessary, for example, when one machine specific
830 decl attribute overrides another. */
831 (* targetm.encode_section_info) (decl, false);
835 new_name = name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
837 reg_number = decode_reg_name (asmspec);
838 if (reg_number == -2)
840 /* ASMSPEC is given, and not the name of a register. Mark the
841 name with a star so assemble_name won't munge it. */
842 char *starred = alloca (strlen (asmspec) + 2);
844 strcpy (starred + 1, asmspec);
848 if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
850 /* First detect errors in declaring global registers. */
851 if (reg_number == -1)
852 error_with_decl (decl, "register name not specified for `%s'");
853 else if (reg_number < 0)
854 error_with_decl (decl, "invalid register name for `%s'");
855 else if (TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
856 error_with_decl (decl,
857 "data type of `%s' isn't suitable for a register");
858 else if (! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl))))
859 error_with_decl (decl,
860 "register specified for `%s' isn't suitable for data type");
861 /* Now handle properly declared static register variables. */
866 if (DECL_INITIAL (decl) != 0 && TREE_STATIC (decl))
868 DECL_INITIAL (decl) = 0;
869 error ("global register variable has initial value");
871 if (TREE_THIS_VOLATILE (decl))
872 warning ("volatile register variables don't work as you might wish");
874 /* If the user specified one of the eliminables registers here,
875 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
876 confused with that register and be eliminated. This usage is
877 somewhat suspect... */
879 SET_DECL_RTL (decl, gen_rtx_raw_REG (DECL_MODE (decl), reg_number));
880 ORIGINAL_REGNO (DECL_RTL (decl)) = reg_number;
881 REG_USERVAR_P (DECL_RTL (decl)) = 1;
883 if (TREE_STATIC (decl))
885 /* Make this register global, so not usable for anything
887 #ifdef ASM_DECLARE_REGISTER_GLOBAL
888 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name);
890 nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl));
892 globalize_reg (reg_number + --nregs);
895 /* As a register variable, it has no section. */
900 /* Now handle ordinary static variables and functions (in memory).
901 Also handle vars declared register invalidly. */
903 if (reg_number >= 0 || reg_number == -3)
904 error_with_decl (decl,
905 "register name given for non-register variable `%s'");
907 /* Specifying a section attribute on a variable forces it into a
908 non-.bss section, and thus it cannot be common. */
909 if (TREE_CODE (decl) == VAR_DECL
910 && DECL_SECTION_NAME (decl) != NULL_TREE
911 && DECL_INITIAL (decl) == NULL_TREE
912 && DECL_COMMON (decl))
913 DECL_COMMON (decl) = 0;
915 /* Variables can't be both common and weak. */
916 if (TREE_CODE (decl) == VAR_DECL && DECL_WEAK (decl))
917 DECL_COMMON (decl) = 0;
919 /* Can't use just the variable's own name for a variable
920 whose scope is less than the whole file, unless it's a member
921 of a local class (which will already be unambiguous).
922 Concatenate a distinguishing number. */
923 if (!top_level && !TREE_PUBLIC (decl)
924 && ! (DECL_CONTEXT (decl) && TYPE_P (DECL_CONTEXT (decl)))
926 && name == IDENTIFIER_POINTER (DECL_NAME (decl)))
930 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
935 if (name != new_name)
937 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (new_name));
938 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
941 /* If this variable is to be treated as volatile, show its
942 tree node has side effects. */
943 if ((flag_volatile_global && TREE_CODE (decl) == VAR_DECL
944 && TREE_PUBLIC (decl))
945 || ((flag_volatile_static && TREE_CODE (decl) == VAR_DECL
946 && (TREE_PUBLIC (decl) || TREE_STATIC (decl)))))
947 TREE_SIDE_EFFECTS (decl) = 1;
949 x = gen_rtx_MEM (DECL_MODE (decl), gen_rtx_SYMBOL_REF (Pmode, name));
950 SYMBOL_REF_WEAK (XEXP (x, 0)) = DECL_WEAK (decl);
951 if (TREE_CODE (decl) != FUNCTION_DECL)
952 set_mem_attributes (x, decl, 1);
953 SET_DECL_RTL (decl, x);
955 /* Optionally set flags or add text to the name to record information
956 such as that it is a function name.
957 If the name is changed, the macro ASM_OUTPUT_LABELREF
958 will have to know how to strip this information. */
959 (* targetm.encode_section_info) (decl, true);
962 /* Make the rtl for variable VAR be volatile.
963 Use this only for static variables. */
966 make_var_volatile (var)
969 if (GET_CODE (DECL_RTL (var)) != MEM)
972 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
975 /* Output alignment directive to align for constant expression EXP. */
978 assemble_constant_align (exp)
983 /* Align the location counter as required by EXP's data type. */
984 align = TYPE_ALIGN (TREE_TYPE (exp));
985 #ifdef CONSTANT_ALIGNMENT
986 align = CONSTANT_ALIGNMENT (exp, align);
989 if (align > BITS_PER_UNIT)
991 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
995 /* Output a string of literal assembler code
996 for an `asm' keyword used between functions. */
999 assemble_asm (string)
1004 if (TREE_CODE (string) == ADDR_EXPR)
1005 string = TREE_OPERAND (string, 0);
1007 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
1010 /* Record an element in the table of global destructors. SYMBOL is
1011 a SYMBOL_REF of the function to be called; PRIORITY is a number
1012 between 0 and MAX_INIT_PRIORITY. */
1015 default_stabs_asm_out_destructor (symbol, priority)
1017 int priority ATTRIBUTE_UNUSED;
1019 /* Tell GNU LD that this is part of the static destructor set.
1020 This will work for any system that uses stabs, most usefully
1022 fprintf (asm_out_file, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
1023 assemble_name (asm_out_file, XSTR (symbol, 0));
1024 fputc ('\n', asm_out_file);
1028 default_named_section_asm_out_destructor (symbol, priority)
1032 const char *section = ".dtors";
1035 /* ??? This only works reliably with the GNU linker. */
1036 if (priority != DEFAULT_INIT_PRIORITY)
1038 sprintf (buf, ".dtors.%.5u",
1039 /* Invert the numbering so the linker puts us in the proper
1040 order; constructors are run from right to left, and the
1041 linker sorts in increasing order. */
1042 MAX_INIT_PRIORITY - priority);
1046 named_section_flags (section, SECTION_WRITE);
1047 assemble_align (POINTER_SIZE);
1048 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1051 #ifdef DTORS_SECTION_ASM_OP
1055 if (in_section != in_dtors)
1057 in_section = in_dtors;
1058 fputs (DTORS_SECTION_ASM_OP, asm_out_file);
1059 fputc ('\n', asm_out_file);
1064 default_dtor_section_asm_out_destructor (symbol, priority)
1066 int priority ATTRIBUTE_UNUSED;
1069 assemble_align (POINTER_SIZE);
1070 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1074 /* Likewise for global constructors. */
1077 default_stabs_asm_out_constructor (symbol, priority)
1079 int priority ATTRIBUTE_UNUSED;
1081 /* Tell GNU LD that this is part of the static destructor set.
1082 This will work for any system that uses stabs, most usefully
1084 fprintf (asm_out_file, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
1085 assemble_name (asm_out_file, XSTR (symbol, 0));
1086 fputc ('\n', asm_out_file);
1090 default_named_section_asm_out_constructor (symbol, priority)
1094 const char *section = ".ctors";
1097 /* ??? This only works reliably with the GNU linker. */
1098 if (priority != DEFAULT_INIT_PRIORITY)
1100 sprintf (buf, ".ctors.%.5u",
1101 /* Invert the numbering so the linker puts us in the proper
1102 order; constructors are run from right to left, and the
1103 linker sorts in increasing order. */
1104 MAX_INIT_PRIORITY - priority);
1108 named_section_flags (section, SECTION_WRITE);
1109 assemble_align (POINTER_SIZE);
1110 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1113 #ifdef CTORS_SECTION_ASM_OP
1117 if (in_section != in_ctors)
1119 in_section = in_ctors;
1120 fputs (CTORS_SECTION_ASM_OP, asm_out_file);
1121 fputc ('\n', asm_out_file);
1126 default_ctor_section_asm_out_constructor (symbol, priority)
1128 int priority ATTRIBUTE_UNUSED;
1131 assemble_align (POINTER_SIZE);
1132 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1136 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1137 a non-zero value if the constant pool should be output before the
1138 start of the function, or a zero value if the pool should output
1139 after the end of the function. The default is to put it before the
1142 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1143 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1146 /* Output assembler code for the constant pool of a function and associated
1147 with defining the name of the function. DECL describes the function.
1148 NAME is the function's name. For the constant pool, we use the current
1149 constant pool data. */
1152 assemble_start_function (decl, fnname)
1158 /* The following code does not need preprocessing in the assembler. */
1162 if (CONSTANT_POOL_BEFORE_FUNCTION)
1163 output_constant_pool (fnname, decl);
1165 resolve_unique_section (decl, 0, flag_function_sections);
1166 function_section (decl);
1168 /* Tell assembler to move to target machine's alignment for functions. */
1169 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1172 ASM_OUTPUT_ALIGN (asm_out_file, align);
1175 /* Handle a user-specified function alignment.
1176 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1177 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1178 if (align_functions_log > align
1179 && cfun->function_frequency != FUNCTION_FREQUENCY_UNLIKELY_EXECUTED)
1181 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1182 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file,
1183 align_functions_log, align_functions - 1);
1185 ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
1189 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1190 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
1193 (*debug_hooks->begin_function) (decl);
1195 /* Make function name accessible from other files, if appropriate. */
1197 if (TREE_PUBLIC (decl))
1199 if (! first_global_object_name)
1204 p = (* targetm.strip_name_encoding) (fnname);
1205 name = permalloc (strlen (p) + 1);
1208 if (! DECL_WEAK (decl) && ! DECL_ONE_ONLY (decl))
1209 first_global_object_name = name;
1211 weak_global_object_name = name;
1214 globalize_decl (decl);
1216 maybe_assemble_visibility (decl);
1219 /* Do any machine/system dependent processing of the function name */
1220 #ifdef ASM_DECLARE_FUNCTION_NAME
1221 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
1223 /* Standard thing is just output label for the function. */
1224 ASM_OUTPUT_LABEL (asm_out_file, fnname);
1225 #endif /* ASM_DECLARE_FUNCTION_NAME */
1228 /* Output assembler code associated with defining the size of the
1229 function. DECL describes the function. NAME is the function's name. */
1232 assemble_end_function (decl, fnname)
1236 #ifdef ASM_DECLARE_FUNCTION_SIZE
1237 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1239 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1241 output_constant_pool (fnname, decl);
1242 function_section (decl); /* need to switch back */
1245 /* Output any constants which should appear after the function. */
1246 output_after_function_constants ();
1249 /* Assemble code to leave SIZE bytes of zeros. */
1252 assemble_zeros (size)
1255 /* Do no output if -fsyntax-only. */
1256 if (flag_syntax_only)
1259 #ifdef ASM_NO_SKIP_IN_TEXT
1260 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1261 so we must output 0s explicitly in the text section. */
1262 if (ASM_NO_SKIP_IN_TEXT && in_text_section ())
1265 for (i = 0; i < size; i++)
1266 assemble_integer (const0_rtx, 1, BITS_PER_UNIT, 1);
1271 ASM_OUTPUT_SKIP (asm_out_file, size);
1274 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1277 assemble_align (align)
1280 if (align > BITS_PER_UNIT)
1282 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1286 /* Assemble a string constant with the specified C string as contents. */
1289 assemble_string (p, size)
1296 /* If the string is very long, split it up. */
1300 int thissize = size - pos;
1301 if (thissize > maximum)
1304 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1312 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1313 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1314 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1316 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1317 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1318 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1320 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1321 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1325 #if defined ASM_OUTPUT_ALIGNED_BSS
1326 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1327 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1329 #if defined ASM_OUTPUT_BSS
1330 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1331 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1337 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1338 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1339 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1341 #if defined ASM_OUTPUT_ALIGNED_COMMON
1342 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1343 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1345 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1346 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1351 asm_emit_uninitialised (decl, name, size, rounded)
1354 int size ATTRIBUTE_UNUSED;
1355 int rounded ATTRIBUTE_UNUSED;
1363 destination = asm_dest_local;
1365 if (TREE_PUBLIC (decl))
1367 #if defined ASM_EMIT_BSS
1368 if (! DECL_COMMON (decl))
1369 destination = asm_dest_bss;
1372 destination = asm_dest_common;
1375 if (destination == asm_dest_bss)
1376 globalize_decl (decl);
1377 resolve_unique_section (decl, 0, flag_data_sections);
1379 if (flag_shared_data)
1381 switch (destination)
1383 #ifdef ASM_OUTPUT_SHARED_BSS
1385 ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded);
1388 #ifdef ASM_OUTPUT_SHARED_COMMON
1389 case asm_dest_common:
1390 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1393 #ifdef ASM_OUTPUT_SHARED_LOCAL
1394 case asm_dest_local:
1395 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1403 switch (destination)
1407 ASM_EMIT_BSS (decl, name, size, rounded);
1410 case asm_dest_common:
1411 ASM_EMIT_COMMON (decl, name, size, rounded);
1413 case asm_dest_local:
1414 ASM_EMIT_LOCAL (decl, name, size, rounded);
1423 /* Assemble everything that is needed for a variable or function declaration.
1424 Not used for automatic variables, and not used for function definitions.
1425 Should not be called for variables of incomplete structure type.
1427 TOP_LEVEL is nonzero if this variable has file scope.
1428 AT_END is nonzero if this is the special handling, at end of compilation,
1429 to define things that have had only tentative definitions.
1430 DONT_OUTPUT_DATA if nonzero means don't actually output the
1431 initial value (that will be done by the caller). */
1434 assemble_variable (decl, top_level, at_end, dont_output_data)
1436 int top_level ATTRIBUTE_UNUSED;
1437 int at_end ATTRIBUTE_UNUSED;
1438 int dont_output_data;
1445 last_assemble_variable_decl = 0;
1447 /* Normally no need to say anything here for external references,
1448 since assemble_external is called by the language-specific code
1449 when a declaration is first seen. */
1451 if (DECL_EXTERNAL (decl))
1454 /* Output no assembler code for a function declaration.
1455 Only definitions of functions output anything. */
1457 if (TREE_CODE (decl) == FUNCTION_DECL)
1460 /* Do nothing for global register variables. */
1461 if (DECL_RTL_SET_P (decl) && GET_CODE (DECL_RTL (decl)) == REG)
1463 TREE_ASM_WRITTEN (decl) = 1;
1467 /* If type was incomplete when the variable was declared,
1468 see if it is complete now. */
1470 if (DECL_SIZE (decl) == 0)
1471 layout_decl (decl, 0);
1473 /* Still incomplete => don't allocate it; treat the tentative defn
1474 (which is what it must have been) as an `extern' reference. */
1476 if (!dont_output_data && DECL_SIZE (decl) == 0)
1478 error_with_file_and_line (DECL_SOURCE_FILE (decl),
1479 DECL_SOURCE_LINE (decl),
1480 "storage size of `%s' isn't known",
1481 IDENTIFIER_POINTER (DECL_NAME (decl)));
1482 TREE_ASM_WRITTEN (decl) = 1;
1486 /* The first declaration of a variable that comes through this function
1487 decides whether it is global (in C, has external linkage)
1488 or local (in C, has internal linkage). So do nothing more
1489 if this function has already run. */
1491 if (TREE_ASM_WRITTEN (decl))
1494 /* Make sure targetm.encode_section_info is invoked before we set
1496 decl_rtl = DECL_RTL (decl);
1498 TREE_ASM_WRITTEN (decl) = 1;
1500 /* Do no output if -fsyntax-only. */
1501 if (flag_syntax_only)
1506 if (! dont_output_data
1507 && ! host_integerp (DECL_SIZE_UNIT (decl), 1))
1509 error_with_decl (decl, "size of variable `%s' is too large");
1513 name = XSTR (XEXP (decl_rtl, 0), 0);
1514 if (TREE_PUBLIC (decl) && DECL_NAME (decl)
1515 && ! first_global_object_name
1516 && ! (DECL_COMMON (decl) && (DECL_INITIAL (decl) == 0
1517 || DECL_INITIAL (decl) == error_mark_node))
1518 && ! DECL_WEAK (decl)
1519 && ! DECL_ONE_ONLY (decl))
1524 p = (* targetm.strip_name_encoding) (name);
1525 xname = permalloc (strlen (p) + 1);
1527 first_global_object_name = xname;
1530 /* Compute the alignment of this data. */
1532 align = DECL_ALIGN (decl);
1534 /* In the case for initialing an array whose length isn't specified,
1535 where we have not yet been able to do the layout,
1536 figure out the proper alignment now. */
1537 if (dont_output_data && DECL_SIZE (decl) == 0
1538 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1539 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1541 /* Some object file formats have a maximum alignment which they support.
1542 In particular, a.out format supports a maximum alignment of 4. */
1543 #ifndef MAX_OFILE_ALIGNMENT
1544 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1546 if (align > MAX_OFILE_ALIGNMENT)
1548 warning_with_decl (decl,
1549 "alignment of `%s' is greater than maximum object file alignment. Using %d",
1550 MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
1551 align = MAX_OFILE_ALIGNMENT;
1554 /* On some machines, it is good to increase alignment sometimes. */
1555 if (! DECL_USER_ALIGN (decl))
1557 #ifdef DATA_ALIGNMENT
1558 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1560 #ifdef CONSTANT_ALIGNMENT
1561 if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node)
1562 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1566 /* Reset the alignment in case we have made it tighter, so we can benefit
1567 from it in get_pointer_alignment. */
1568 DECL_ALIGN (decl) = align;
1569 set_mem_align (decl_rtl, align);
1571 if (TREE_PUBLIC (decl))
1572 maybe_assemble_visibility (decl);
1574 /* Output any data that we will need to use the address of. */
1575 if (DECL_INITIAL (decl) == error_mark_node)
1576 reloc = contains_pointers_p (TREE_TYPE (decl)) ? 3 : 0;
1577 else if (DECL_INITIAL (decl))
1578 reloc = output_addressed_constants (DECL_INITIAL (decl));
1579 resolve_unique_section (decl, reloc, flag_data_sections);
1581 /* Handle uninitialized definitions. */
1583 /* If the decl has been given an explicit section name, then it
1584 isn't common, and shouldn't be handled as such. */
1585 if (DECL_SECTION_NAME (decl) || dont_output_data)
1587 /* We don't implement common thread-local data at present. */
1588 else if (DECL_THREAD_LOCAL (decl))
1590 if (DECL_COMMON (decl))
1591 sorry ("thread-local COMMON data not implemented");
1593 #ifndef ASM_EMIT_BSS
1594 /* If the target can't output uninitialized but not common global data
1595 in .bss, then we have to use .data. */
1596 /* ??? We should handle .bss via select_section mechanisms rather than
1597 via special target hooks. That would eliminate this special case. */
1598 else if (!DECL_COMMON (decl))
1601 else if (DECL_INITIAL (decl) == 0
1602 || DECL_INITIAL (decl) == error_mark_node
1603 || (flag_zero_initialized_in_bss
1604 && initializer_zerop (DECL_INITIAL (decl))))
1606 unsigned HOST_WIDE_INT size = tree_low_cst (DECL_SIZE_UNIT (decl), 1);
1607 unsigned HOST_WIDE_INT rounded = size;
1609 /* Don't allocate zero bytes of common,
1610 since that means "undefined external" in the linker. */
1614 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1615 so that each uninitialized object starts on such a boundary. */
1616 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1617 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1618 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1620 /* Don't continue this line--convex cc version 4.1 would lose. */
1621 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1622 if ((unsigned HOST_WIDE_INT) DECL_ALIGN (decl) / BITS_PER_UNIT > rounded)
1624 (decl, "requested alignment for %s is greater than implemented alignment of %d",rounded);
1627 asm_emit_uninitialised (decl, name, size, rounded);
1632 /* Handle initialized definitions.
1633 Also handle uninitialized global definitions if -fno-common and the
1634 target doesn't support ASM_OUTPUT_BSS. */
1636 /* First make the assembler name(s) global if appropriate. */
1637 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1638 globalize_decl (decl);
1640 /* Switch to the appropriate section. */
1641 variable_section (decl, reloc);
1643 /* dbxout.c needs to know this. */
1644 if (in_text_section ())
1645 DECL_IN_TEXT_SECTION (decl) = 1;
1647 /* Output the alignment of this data. */
1648 if (align > BITS_PER_UNIT)
1650 ASM_OUTPUT_ALIGN (asm_out_file,
1651 floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT));
1654 /* Do any machine/system dependent processing of the object. */
1655 #ifdef ASM_DECLARE_OBJECT_NAME
1656 last_assemble_variable_decl = decl;
1657 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1659 /* Standard thing is just output label for the object. */
1660 ASM_OUTPUT_LABEL (asm_out_file, name);
1661 #endif /* ASM_DECLARE_OBJECT_NAME */
1663 if (!dont_output_data)
1665 if (DECL_INITIAL (decl) && DECL_INITIAL (decl) != error_mark_node)
1666 /* Output the actual data. */
1667 output_constant (DECL_INITIAL (decl),
1668 tree_low_cst (DECL_SIZE_UNIT (decl), 1),
1671 /* Leave space for it. */
1672 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl), 1));
1676 /* Return 1 if type TYPE contains any pointers. */
1679 contains_pointers_p (type)
1682 switch (TREE_CODE (type))
1685 case REFERENCE_TYPE:
1686 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1687 so I'll play safe and return 1. */
1693 case QUAL_UNION_TYPE:
1696 /* For a type that has fields, see if the fields have pointers. */
1697 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1698 if (TREE_CODE (fields) == FIELD_DECL
1699 && contains_pointers_p (TREE_TYPE (fields)))
1705 /* An array type contains pointers if its element type does. */
1706 return contains_pointers_p (TREE_TYPE (type));
1713 /* Output something to declare an external symbol to the assembler.
1714 (Most assemblers don't need this, so we normally output nothing.)
1715 Do nothing if DECL is not external. */
1718 assemble_external (decl)
1719 tree decl ATTRIBUTE_UNUSED;
1721 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1722 main body of this code is only rarely exercised. To provide some
1723 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1724 open. If it's not, we should not be calling this function. */
1728 #ifdef ASM_OUTPUT_EXTERNAL
1729 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1731 rtx rtl = DECL_RTL (decl);
1733 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1734 && ! SYMBOL_REF_USED (XEXP (rtl, 0)))
1736 /* Some systems do require some output. */
1737 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1738 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1744 /* Similar, for calling a library function FUN. */
1747 assemble_external_libcall (fun)
1748 rtx fun ATTRIBUTE_UNUSED;
1750 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1751 /* Declare library function name external when first used, if nec. */
1752 if (! SYMBOL_REF_USED (fun))
1754 SYMBOL_REF_USED (fun) = 1;
1755 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun);
1760 /* Declare the label NAME global. */
1763 assemble_global (name)
1764 const char *name ATTRIBUTE_UNUSED;
1766 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1769 /* Assemble a label named NAME. */
1772 assemble_label (name)
1775 ASM_OUTPUT_LABEL (asm_out_file, name);
1778 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1779 If NAME starts with a *, the rest of NAME is output verbatim.
1780 Otherwise NAME is transformed in an implementation-defined way
1781 (usually by the addition of an underscore).
1782 Many macros in the tm file are defined to call this function. */
1785 assemble_name (file, name)
1789 const char *real_name;
1792 real_name = (* targetm.strip_name_encoding) (name);
1794 id = maybe_get_identifier (real_name);
1796 TREE_SYMBOL_REFERENCED (id) = 1;
1799 fputs (&name[1], file);
1801 ASM_OUTPUT_LABELREF (file, name);
1804 /* Allocate SIZE bytes writable static space with a gensym name
1805 and return an RTX to refer to its address. */
1808 assemble_static_space (size)
1812 const char *namestring;
1816 if (flag_shared_data)
1820 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1822 namestring = ggc_strdup (name);
1824 x = gen_rtx_SYMBOL_REF (Pmode, namestring);
1826 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1827 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
1830 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1831 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1834 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1835 so that each uninitialized object starts on such a boundary. */
1836 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1837 int rounded ATTRIBUTE_UNUSED
1838 = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1839 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1840 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1841 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1848 /* Assemble the static constant template for function entry trampolines.
1849 This is done at most once per compilation.
1850 Returns an RTX for the address of the template. */
1852 #ifdef TRAMPOLINE_TEMPLATE
1854 assemble_trampoline_template ()
1860 /* By default, put trampoline templates in read-only data section. */
1862 #ifdef TRAMPOLINE_SECTION
1863 TRAMPOLINE_SECTION ();
1865 readonly_data_section ();
1868 /* Write the assembler code to define one. */
1869 align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
1872 ASM_OUTPUT_ALIGN (asm_out_file, align);
1875 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LTRAMP", 0);
1876 TRAMPOLINE_TEMPLATE (asm_out_file);
1878 /* Record the rtl to refer to it. */
1879 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1880 name = ggc_strdup (label);
1881 return gen_rtx_SYMBOL_REF (Pmode, name);
1885 /* A and B are either alignments or offsets. Return the minimum alignment
1886 that may be assumed after adding the two together. */
1888 static inline unsigned
1892 return (a | b) & -(a | b);
1895 /* Return the assembler directive for creating a given kind of integer
1896 object. SIZE is the number of bytes in the object and ALIGNED_P
1897 indicates whether it is known to be aligned. Return NULL if the
1898 assembly dialect has no such directive.
1900 The returned string should be printed at the start of a new line and
1901 be followed immediately by the object's initial value. */
1904 integer_asm_op (size, aligned_p)
1908 struct asm_int_op *ops;
1911 ops = &targetm.asm_out.aligned_op;
1913 ops = &targetm.asm_out.unaligned_op;
1918 return targetm.asm_out.byte_op;
1932 /* Use directive OP to assemble an integer object X. Print OP at the
1933 start of the line, followed immediately by the value of X. */
1936 assemble_integer_with_op (op, x)
1940 fputs (op, asm_out_file);
1941 output_addr_const (asm_out_file, x);
1942 fputc ('\n', asm_out_file);
1945 /* The default implementation of the asm_out.integer target hook. */
1948 default_assemble_integer (x, size, aligned_p)
1949 rtx x ATTRIBUTE_UNUSED;
1950 unsigned int size ATTRIBUTE_UNUSED;
1951 int aligned_p ATTRIBUTE_UNUSED;
1953 const char *op = integer_asm_op (size, aligned_p);
1954 return op && (assemble_integer_with_op (op, x), true);
1957 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1958 the alignment of the integer in bits. Return 1 if we were able to output
1959 the constant, otherwise 0. If FORCE is non-zero, abort if we can't output
1963 assemble_integer (x, size, align, force)
1971 aligned_p = (align >= MIN (size * BITS_PER_UNIT, BIGGEST_ALIGNMENT));
1973 /* See if the target hook can handle this kind of object. */
1974 if ((*targetm.asm_out.integer) (x, size, aligned_p))
1977 /* If the object is a multi-byte one, try splitting it up. Split
1978 it into words it if is multi-word, otherwise split it into bytes. */
1981 enum machine_mode omode, imode;
1982 unsigned int subalign;
1983 unsigned int subsize, i;
1985 subsize = size > UNITS_PER_WORD? UNITS_PER_WORD : 1;
1986 subalign = MIN (align, subsize * BITS_PER_UNIT);
1987 omode = mode_for_size (subsize * BITS_PER_UNIT, MODE_INT, 0);
1988 imode = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1990 for (i = 0; i < size; i += subsize)
1992 rtx partial = simplify_subreg (omode, x, imode, i);
1993 if (!partial || !assemble_integer (partial, subsize, subalign, 0))
1999 /* If we've printed some of it, but not all of it, there's no going
2012 assemble_real (d, mode, align)
2014 enum machine_mode mode;
2019 unsigned int nalign = min_align (align, 32);
2021 switch (BITS_PER_UNIT)
2027 REAL_VALUE_TO_TARGET_SINGLE (d, l);
2028 assemble_integer (GEN_INT (l), 4, align, 1);
2031 REAL_VALUE_TO_TARGET_DOUBLE (d, data);
2032 assemble_integer (GEN_INT (data[0]), 4, align, 1);
2033 assemble_integer (GEN_INT (data[1]), 4, nalign, 1);
2036 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d, data);
2037 assemble_integer (GEN_INT (data[0]), 4, align, 1);
2038 assemble_integer (GEN_INT (data[1]), 4, nalign, 1);
2039 assemble_integer (GEN_INT (data[2]), 4, nalign, 1);
2042 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d, data);
2043 assemble_integer (GEN_INT (data[0]), 4, align, 1);
2044 assemble_integer (GEN_INT (data[1]), 4, nalign, 1);
2045 assemble_integer (GEN_INT (data[2]), 4, nalign, 1);
2046 assemble_integer (GEN_INT (data[3]), 4, nalign, 1);
2057 REAL_VALUE_TO_TARGET_SINGLE (d, l);
2058 assemble_integer (GEN_INT (l), 2, align, 1);
2061 REAL_VALUE_TO_TARGET_DOUBLE (d, data);
2062 assemble_integer (GEN_INT (data[0]), 2, align, 1);
2063 assemble_integer (GEN_INT (data[1]), 1, nalign, 1);
2074 REAL_VALUE_TO_TARGET_SINGLE (d, l);
2075 assemble_integer (GEN_INT (l), 1, align, 1);
2078 REAL_VALUE_TO_TARGET_DOUBLE (d, data);
2079 assemble_integer (GEN_INT (data[0]), 1, align, 1);
2080 assemble_integer (GEN_INT (data[1]), 1, nalign, 1);
2092 /* Given an expression EXP with a constant value,
2093 reduce it to the sum of an assembler symbol and an integer.
2094 Store them both in the structure *VALUE.
2095 Abort if EXP does not reduce. */
2097 struct addr_const GTY(())
2100 HOST_WIDE_INT offset;
2104 decode_addr_const (exp, value)
2106 struct addr_const *value;
2108 tree target = TREE_OPERAND (exp, 0);
2114 if (TREE_CODE (target) == COMPONENT_REF
2115 && host_integerp (byte_position (TREE_OPERAND (target, 1)), 0))
2118 offset += int_byte_position (TREE_OPERAND (target, 1));
2119 target = TREE_OPERAND (target, 0);
2121 else if (TREE_CODE (target) == ARRAY_REF
2122 || TREE_CODE (target) == ARRAY_RANGE_REF)
2124 offset += (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target)), 1)
2125 * tree_low_cst (TREE_OPERAND (target, 1), 0));
2126 target = TREE_OPERAND (target, 0);
2132 switch (TREE_CODE (target))
2136 x = DECL_RTL (target);
2140 x = gen_rtx_MEM (FUNCTION_MODE,
2141 gen_rtx_LABEL_REF (VOIDmode,
2142 label_rtx (TREE_OPERAND (exp, 0))));
2150 /* This constant should have been output already, but we can't simply
2151 use TREE_CST_RTL since INTEGER_CST doesn't have one. */
2152 x = output_constant_def (target, 1);
2159 if (GET_CODE (x) != MEM)
2164 value->offset = offset;
2167 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2168 enum kind { RTX_UNKNOWN, RTX_DOUBLE, RTX_VECTOR, RTX_INT, RTX_UNSPEC };
2169 struct rtx_const GTY(())
2171 ENUM_BITFIELD(kind) kind : 16;
2172 ENUM_BITFIELD(machine_mode) mode : 16;
2173 union rtx_const_un {
2175 struct addr_const GTY ((tag ("1"))) addr;
2176 struct rtx_const_u_di {
2179 } GTY ((tag ("0"))) di;
2181 /* The max vector size we have is 8 wide. This should be enough. */
2182 HOST_WIDE_INT veclo[16];
2183 HOST_WIDE_INT vechi[16];
2184 } GTY ((desc ("%1.kind >= RTX_INT"), descbits ("1"))) un;
2187 /* Uniquize all constants that appear in memory.
2188 Each constant in memory thus far output is recorded
2189 in `const_hash_table'. */
2191 struct constant_descriptor_tree GTY(())
2193 /* More constant_descriptors with the same hash code. */
2194 struct constant_descriptor_tree *next;
2196 /* The label of the constant. */
2199 /* A MEM for the constant. */
2202 /* The value of the constant. */
2207 #define MAX_HASH_TABLE 1009
2208 static GTY(()) struct constant_descriptor_tree *
2209 const_hash_table[MAX_HASH_TABLE];
2211 /* We maintain a hash table of STRING_CST values. Unless we are asked to force
2212 out a string constant, we defer output of the constants until we know
2213 they are actually used. This will be if something takes its address or if
2214 there is a usage of the string in the RTL of a function. */
2216 #define STRHASH(x) ((hashval_t) ((long) (x) >> 3))
2218 struct deferred_string GTY(())
2225 static GTY ((param_is (struct deferred_string))) htab_t const_str_htab;
2227 /* Returns a hash code for X (which is a really a
2228 struct deferred_string *). */
2231 const_str_htab_hash (x)
2234 return STRHASH (((const struct deferred_string *) x)->label);
2237 /* Returns non-zero if the value represented by X (which is really a
2238 struct deferred_string *) is the same as that given by Y
2239 (which is really a char *). */
2242 const_str_htab_eq (x, y)
2246 return (((const struct deferred_string *) x)->label == (const char *) y);
2249 /* Compute a hash code for a constant expression. */
2257 enum tree_code code = TREE_CODE (exp);
2259 /* Either set P and LEN to the address and len of something to hash and
2260 exit the switch or return a value. */
2265 p = (char *) &TREE_INT_CST (exp);
2266 len = sizeof TREE_INT_CST (exp);
2270 p = (char *) &TREE_REAL_CST (exp);
2271 len = sizeof TREE_REAL_CST (exp);
2275 p = TREE_STRING_POINTER (exp);
2276 len = TREE_STRING_LENGTH (exp);
2280 return (const_hash (TREE_REALPART (exp)) * 5
2281 + const_hash (TREE_IMAGPART (exp)));
2284 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2288 len = int_size_in_bytes (TREE_TYPE (exp));
2289 tmp = (char *) alloca (len);
2290 get_set_constructor_bytes (exp, (unsigned char *) tmp, len);
2298 /* For record type, include the type in the hashing.
2299 We do not do so for array types
2300 because (1) the sizes of the elements are sufficient
2301 and (2) distinct array types can have the same constructor.
2302 Instead, we include the array size because the constructor could
2304 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2305 hi = ((unsigned long) TREE_TYPE (exp) & ((1 << HASHBITS) - 1))
2308 hi = ((5 + int_size_in_bytes (TREE_TYPE (exp)))
2309 & ((1 << HASHBITS) - 1)) % MAX_HASH_TABLE;
2311 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2312 if (TREE_VALUE (link))
2314 = (hi * 603 + const_hash (TREE_VALUE (link))) % MAX_HASH_TABLE;
2321 struct addr_const value;
2323 decode_addr_const (exp, &value);
2324 if (GET_CODE (value.base) == SYMBOL_REF)
2326 /* Don't hash the address of the SYMBOL_REF;
2327 only use the offset and the symbol name. */
2329 p = XSTR (value.base, 0);
2330 for (i = 0; p[i] != 0; i++)
2331 hi = ((hi * 613) + (unsigned) (p[i]));
2333 else if (GET_CODE (value.base) == LABEL_REF)
2334 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2338 hi &= (1 << HASHBITS) - 1;
2339 hi %= MAX_HASH_TABLE;
2345 return (const_hash (TREE_OPERAND (exp, 0)) * 9
2346 + const_hash (TREE_OPERAND (exp, 1)));
2350 case NON_LVALUE_EXPR:
2351 return const_hash (TREE_OPERAND (exp, 0)) * 7 + 2;
2354 /* A language specific constant. Just hash the code. */
2355 return (int) code % MAX_HASH_TABLE;
2358 /* Compute hashing function */
2360 for (i = 0; i < len; i++)
2361 hi = ((hi * 613) + (unsigned) (p[i]));
2363 hi &= (1 << HASHBITS) - 1;
2364 hi %= MAX_HASH_TABLE;
2368 /* Compare t1 and t2, and return 1 only if they are known to result in
2369 the same bit pattern on output. */
2372 compare_constant (t1, t2)
2376 enum tree_code typecode;
2378 if (t1 == NULL_TREE)
2379 return t2 == NULL_TREE;
2380 if (t2 == NULL_TREE)
2383 if (TREE_CODE (t1) != TREE_CODE (t2))
2386 switch (TREE_CODE (t1))
2389 /* Integer constants are the same only if the same width of type. */
2390 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2392 return tree_int_cst_equal (t1, t2);
2395 /* Real constants are the same only if the same width of type. */
2396 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2399 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
2402 if (flag_writable_strings)
2405 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2)))
2408 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
2409 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
2410 TREE_STRING_LENGTH (t1)));
2413 return (compare_constant (TREE_REALPART (t1), TREE_REALPART (t2))
2414 && compare_constant (TREE_IMAGPART (t1), TREE_IMAGPART (t2)));
2417 typecode = TREE_CODE (TREE_TYPE (t1));
2418 if (typecode != TREE_CODE (TREE_TYPE (t2)))
2421 if (typecode == SET_TYPE)
2423 int len = int_size_in_bytes (TREE_TYPE (t2));
2424 unsigned char *tmp1, *tmp2;
2426 if (int_size_in_bytes (TREE_TYPE (t1)) != len)
2429 tmp1 = (unsigned char *) alloca (len);
2430 tmp2 = (unsigned char *) alloca (len);
2432 if (get_set_constructor_bytes (t1, tmp1, len) != NULL_TREE)
2434 if (get_set_constructor_bytes (t2, tmp2, len) != NULL_TREE)
2437 return memcmp (tmp1, tmp2, len) != 0;
2443 if (typecode == ARRAY_TYPE)
2445 HOST_WIDE_INT size_1 = int_size_in_bytes (TREE_TYPE (t1));
2446 /* For arrays, check that the sizes all match. */
2447 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2))
2449 || size_1 != int_size_in_bytes (TREE_TYPE (t2)))
2454 /* For record and union constructors, require exact type
2456 if (TREE_TYPE (t1) != TREE_TYPE (t2))
2460 for (l1 = CONSTRUCTOR_ELTS (t1), l2 = CONSTRUCTOR_ELTS (t2);
2462 l1 = TREE_CHAIN (l1), l2 = TREE_CHAIN (l2))
2464 /* Check that each value is the same... */
2465 if (! compare_constant (TREE_VALUE (l1), TREE_VALUE (l2)))
2467 /* ... and that they apply to the same fields! */
2468 if (typecode == ARRAY_TYPE)
2470 if (! compare_constant (TREE_PURPOSE (l1),
2476 if (TREE_PURPOSE (l1) != TREE_PURPOSE (l2))
2481 return l1 == NULL_TREE && l2 == NULL_TREE;
2486 struct addr_const value1, value2;
2488 decode_addr_const (t1, &value1);
2489 decode_addr_const (t2, &value2);
2490 return (value1.offset == value2.offset
2491 && strcmp (XSTR (value1.base, 0), XSTR (value2.base, 0)) == 0);
2497 return (compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))
2498 && compare_constant(TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)));
2502 case NON_LVALUE_EXPR:
2503 return compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2508 nt1 = (*lang_hooks.expand_constant) (t1);
2509 nt2 = (*lang_hooks.expand_constant) (t2);
2510 if (nt1 != t1 || nt2 != t2)
2511 return compare_constant (nt1, nt2);
2517 /* Should not get here. */
2521 /* Record a list of constant expressions that were passed to
2522 output_constant_def but that could not be output right away. */
2524 struct deferred_constant
2526 struct deferred_constant *next;
2532 static struct deferred_constant *deferred_constants;
2534 /* Another list of constants which should be output after the
2536 static struct deferred_constant *after_function_constants;
2538 /* Nonzero means defer output of addressed subconstants
2539 (i.e., those for which output_constant_def is called.) */
2540 static int defer_addressed_constants_flag;
2542 /* Start deferring output of subconstants. */
2545 defer_addressed_constants ()
2547 defer_addressed_constants_flag++;
2550 /* Stop deferring output of subconstants,
2551 and output now all those that have been deferred. */
2554 output_deferred_addressed_constants ()
2556 struct deferred_constant *p, *next;
2558 defer_addressed_constants_flag--;
2560 if (defer_addressed_constants_flag > 0)
2563 for (p = deferred_constants; p; p = next)
2565 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2570 deferred_constants = 0;
2573 /* Output any constants which should appear after a function. */
2576 output_after_function_constants ()
2578 struct deferred_constant *p, *next;
2580 for (p = after_function_constants; p; p = next)
2582 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2587 after_function_constants = 0;
2590 /* Make a copy of the whole tree structure for a constant. This
2591 handles the same types of nodes that compare_constant handles. */
2597 switch (TREE_CODE (exp))
2600 /* For ADDR_EXPR, we do not want to copy the decl whose address
2601 is requested. We do want to copy constants though. */
2602 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c')
2603 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2604 copy_constant (TREE_OPERAND (exp, 0)));
2606 return copy_node (exp);
2611 return copy_node (exp);
2614 return build_complex (TREE_TYPE (exp),
2615 copy_constant (TREE_REALPART (exp)),
2616 copy_constant (TREE_IMAGPART (exp)));
2620 return build (TREE_CODE (exp), TREE_TYPE (exp),
2621 copy_constant (TREE_OPERAND (exp, 0)),
2622 copy_constant (TREE_OPERAND (exp, 1)));
2626 case NON_LVALUE_EXPR:
2627 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2628 copy_constant (TREE_OPERAND (exp, 0)));
2632 tree copy = copy_node (exp);
2633 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2636 CONSTRUCTOR_ELTS (copy) = list;
2637 for (tail = list; tail; tail = TREE_CHAIN (tail))
2638 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2639 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2640 for (tail = list; tail; tail = TREE_CHAIN (tail))
2641 TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail));
2649 t = (*lang_hooks.expand_constant) (exp);
2651 return copy_constant (t);
2658 /* Return an rtx representing a reference to constant data in memory
2659 for the constant expression EXP.
2661 If assembler code for such a constant has already been output,
2662 return an rtx to refer to it.
2663 Otherwise, output such a constant in memory (or defer it for later)
2664 and generate an rtx for it.
2666 If DEFER is non-zero, the output of string constants can be deferred
2667 and output only if referenced in the function after all optimizations.
2669 The TREE_CST_RTL of EXP is set up to point to that rtx.
2670 The const_hash_table records which constants already have label strings. */
2673 output_constant_def (exp, defer)
2678 struct constant_descriptor_tree *desc;
2679 struct deferred_string **defstr;
2683 int after_function = 0;
2687 /* We can't just use the saved RTL if this is a deferred string constant
2688 and we are not to defer anymore. */
2689 if (TREE_CODE (exp) != INTEGER_CST && TREE_CST_RTL (exp)
2690 && (defer || !STRING_POOL_ADDRESS_P (XEXP (TREE_CST_RTL (exp), 0))))
2691 return TREE_CST_RTL (exp);
2693 /* Make sure any other constants whose addresses appear in EXP
2694 are assigned label numbers. */
2696 reloc = output_addressed_constants (exp);
2698 /* Compute hash code of EXP. Search the descriptors for that hash code
2699 to see if any of them describes EXP. If yes, the descriptor records
2700 the label number already assigned. */
2702 hash = const_hash (exp) % MAX_HASH_TABLE;
2704 for (desc = const_hash_table[hash]; desc; desc = desc->next)
2705 if (compare_constant (exp, desc->value))
2710 /* No constant equal to EXP is known to have been output.
2711 Make a constant descriptor to enter EXP in the hash table.
2712 Assign the label number and record it in the descriptor for
2713 future calls to this function to find. */
2715 /* Create a string containing the label name, in LABEL. */
2716 labelno = const_labelno++;
2717 ASM_GENERATE_INTERNAL_LABEL (label, "LC", labelno);
2719 desc = ggc_alloc (sizeof (*desc));
2720 desc->next = const_hash_table[hash];
2721 desc->label = ggc_strdup (label);
2722 desc->value = copy_constant (exp);
2723 const_hash_table[hash] = desc;
2725 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2727 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)),
2728 gen_rtx_SYMBOL_REF (Pmode, desc->label));
2730 set_mem_attributes (rtl, exp, 1);
2731 set_mem_alias_set (rtl, 0);
2732 set_mem_alias_set (rtl, const_alias_set);
2739 if (TREE_CODE (exp) != INTEGER_CST)
2740 TREE_CST_RTL (exp) = rtl;
2742 /* Optionally set flags or add text to the name to record information
2743 such as that it is a function name. If the name is changed, the macro
2744 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2745 /* A previously-processed constant would already have section info
2749 /* Take care not to invoke targetm.encode_section_info for
2750 constants which don't have a TREE_CST_RTL. */
2751 if (TREE_CODE (exp) != INTEGER_CST)
2752 (*targetm.encode_section_info) (exp, true);
2755 desc->label = XSTR (XEXP (desc->rtl, 0), 0);
2758 #ifdef CONSTANT_AFTER_FUNCTION_P
2759 if (current_function_decl != 0
2760 && CONSTANT_AFTER_FUNCTION_P (exp))
2765 && STRING_POOL_ADDRESS_P (XEXP (rtl, 0))
2766 && (!defer || defer_addressed_constants_flag || after_function))
2768 defstr = (struct deferred_string **)
2769 htab_find_slot_with_hash (const_str_htab, desc->label,
2770 STRHASH (desc->label), NO_INSERT);
2773 /* If the string is currently deferred but we need to output it now,
2774 remove it from deferred string hash table. */
2776 labelno = (*defstr)->labelno;
2777 STRING_POOL_ADDRESS_P (XEXP (rtl, 0)) = 0;
2778 htab_clear_slot (const_str_htab, (void **) defstr);
2782 /* If this is the first time we've seen this particular constant,
2783 output it (or defer its output for later). */
2786 if (defer_addressed_constants_flag || after_function)
2788 struct deferred_constant *p
2789 = (struct deferred_constant *)
2790 xmalloc (sizeof (struct deferred_constant));
2792 p->exp = desc->value;
2794 p->labelno = labelno;
2797 p->next = after_function_constants;
2798 after_function_constants = p;
2802 p->next = deferred_constants;
2803 deferred_constants = p;
2808 /* Do no output if -fsyntax-only. */
2809 if (! flag_syntax_only)
2811 if (TREE_CODE (exp) != STRING_CST
2813 || flag_writable_strings
2814 || (defstr = (struct deferred_string **)
2815 htab_find_slot_with_hash (const_str_htab,
2817 STRHASH (desc->label),
2819 output_constant_def_contents (exp, reloc, labelno);
2822 struct deferred_string *p;
2824 p = (struct deferred_string *)
2825 ggc_alloc (sizeof (struct deferred_string));
2827 p->exp = desc->value;
2828 p->label = desc->label;
2829 p->labelno = labelno;
2831 STRING_POOL_ADDRESS_P (XEXP (rtl, 0)) = 1;
2840 /* Now output assembler code to define the label for EXP,
2841 and follow it with the data of EXP. */
2844 output_constant_def_contents (exp, reloc, labelno)
2851 /* Align the location counter as required by EXP's data type. */
2852 align = TYPE_ALIGN (TREE_TYPE (exp));
2853 #ifdef CONSTANT_ALIGNMENT
2854 align = CONSTANT_ALIGNMENT (exp, align);
2857 if (IN_NAMED_SECTION (exp))
2858 named_section (exp, NULL, reloc);
2860 (*targetm.asm_out.select_section) (exp, reloc, align);
2862 if (align > BITS_PER_UNIT)
2864 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2867 /* Output the label itself. */
2868 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", labelno);
2870 /* Output the value of EXP. */
2871 output_constant (exp,
2872 (TREE_CODE (exp) == STRING_CST
2873 ? MAX (TREE_STRING_LENGTH (exp),
2874 int_size_in_bytes (TREE_TYPE (exp)))
2875 : int_size_in_bytes (TREE_TYPE (exp))),
2880 /* Used in the hash tables to avoid outputting the same constant
2881 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2882 are output once per function, not once per file; there seems
2883 to be no reason for the difference. */
2885 struct constant_descriptor_rtx GTY(())
2887 /* More constant_descriptors with the same hash code. */
2888 struct constant_descriptor_rtx *next;
2890 /* The label of the constant. */
2893 /* A MEM for the constant. */
2896 /* The value of the constant. */
2897 struct rtx_const value;
2900 /* Structure to represent sufficient information about a constant so that
2901 it can be output when the constant pool is output, so that function
2902 integration can be done, and to simplify handling on machines that reference
2903 constant pool as base+displacement. */
2905 struct pool_constant GTY(())
2907 struct constant_descriptor_rtx *desc;
2908 struct pool_constant *next;
2909 struct pool_constant *next_sym;
2911 enum machine_mode mode;
2914 HOST_WIDE_INT offset;
2918 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2919 The argument is XSTR (... , 0) */
2921 #define SYMHASH(LABEL) \
2922 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
2924 /* Initialize constant pool hashing for a new function. */
2927 init_varasm_status (f)
2930 struct varasm_status *p;
2931 p = (struct varasm_status *) ggc_alloc (sizeof (struct varasm_status));
2933 p->x_const_rtx_hash_table
2934 = ((struct constant_descriptor_rtx **)
2935 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2936 * sizeof (struct constant_descriptor_rtx *)));
2937 p->x_const_rtx_sym_hash_table
2938 = ((struct pool_constant **)
2939 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2940 * sizeof (struct pool_constant *)));
2942 p->x_first_pool = p->x_last_pool = 0;
2943 p->x_pool_offset = 0;
2947 /* Express an rtx for a constant integer (perhaps symbolic)
2948 as the sum of a symbol or label plus an explicit integer.
2949 They are stored into VALUE. */
2952 decode_rtx_const (mode, x, value)
2953 enum machine_mode mode;
2955 struct rtx_const *value;
2957 /* Clear the whole structure, including any gaps. */
2958 memset (value, 0, sizeof (struct rtx_const));
2960 value->kind = RTX_INT; /* Most usual kind. */
2963 switch (GET_CODE (x))
2966 value->kind = RTX_DOUBLE;
2967 if (GET_MODE (x) != VOIDmode)
2969 value->mode = GET_MODE (x);
2970 REAL_VALUE_FROM_CONST_DOUBLE (value->un.du, x);
2974 value->un.di.low = CONST_DOUBLE_LOW (x);
2975 value->un.di.high = CONST_DOUBLE_HIGH (x);
2984 units = CONST_VECTOR_NUNITS (x);
2985 value->kind = RTX_VECTOR;
2988 for (i = 0; i < units; ++i)
2990 elt = CONST_VECTOR_ELT (x, i);
2991 if (GET_MODE_CLASS (mode) == MODE_VECTOR_INT)
2993 value->un.veclo[i] = (HOST_WIDE_INT) INTVAL (elt);
2994 value->un.vechi[i] = 0;
2996 else if (GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
2998 value->un.veclo[i] = (HOST_WIDE_INT) CONST_DOUBLE_LOW (elt);
2999 value->un.vechi[i] = (HOST_WIDE_INT) CONST_DOUBLE_HIGH (elt);
3008 value->un.addr.offset = INTVAL (x);
3014 value->un.addr.base = x;
3019 if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 1)) == CONST_INT)
3021 value->un.addr.base = XEXP (x, 0);
3022 value->un.addr.offset = INTVAL (XEXP (x, 1));
3024 else if (GET_CODE (x) == MINUS && GET_CODE (XEXP (x, 1)) == CONST_INT)
3026 value->un.addr.base = XEXP (x, 0);
3027 value->un.addr.offset = - INTVAL (XEXP (x, 1));
3031 value->un.addr.base = x;
3032 value->un.addr.offset = 0;
3037 value->kind = RTX_UNKNOWN;
3041 if (value->kind == RTX_INT && value->un.addr.base != 0
3042 && GET_CODE (value->un.addr.base) == UNSPEC)
3044 /* For a simple UNSPEC, the base is set to the
3045 operand, the kind field is set to the index of
3046 the unspec expression.
3047 Together with the code below, in case that
3048 the operand is a SYMBOL_REF or LABEL_REF,
3049 the address of the string or the code_label
3050 is taken as base. */
3051 if (XVECLEN (value->un.addr.base, 0) == 1)
3053 value->kind = RTX_UNSPEC + XINT (value->un.addr.base, 1);
3054 value->un.addr.base = XVECEXP (value->un.addr.base, 0, 0);
3058 if (value->kind > RTX_DOUBLE && value->un.addr.base != 0)
3059 switch (GET_CODE (value->un.addr.base))
3063 /* Use the string's address, not the SYMBOL_REF's address,
3064 for the sake of addresses of library routines. */
3065 value->un.addr.base = (rtx) XSTR (value->un.addr.base, 0);
3070 /* For a LABEL_REF, compare labels. */
3071 value->un.addr.base = XEXP (value->un.addr.base, 0);
3078 /* Given a MINUS expression, simplify it if both sides
3079 include the same symbol. */
3082 simplify_subtraction (x)
3085 struct rtx_const val0, val1;
3087 decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0);
3088 decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1);
3090 if (val0.kind > RTX_DOUBLE
3091 && val0.kind == val1.kind
3092 && val0.un.addr.base == val1.un.addr.base)
3093 return GEN_INT (val0.un.addr.offset - val1.un.addr.offset);
3098 /* Compute a hash code for a constant RTL expression. */
3101 const_hash_rtx (mode, x)
3102 enum machine_mode mode;
3108 struct rtx_const value;
3109 decode_rtx_const (mode, x, &value);
3111 /* Compute hashing function */
3113 for (i = 0; i < sizeof value / sizeof (int); i++)
3114 hi += ((int *) &value)[i];
3116 hi &= (1 << HASHBITS) - 1;
3117 hi %= MAX_RTX_HASH_TABLE;
3121 /* Compare a constant rtl object X with a constant-descriptor DESC.
3122 Return 1 if DESC describes a constant with the same value as X. */
3125 compare_constant_rtx (mode, x, desc)
3126 enum machine_mode mode;
3128 struct constant_descriptor_rtx *desc;
3130 struct rtx_const value;
3132 decode_rtx_const (mode, x, &value);
3134 /* Compare constant contents. */
3135 return memcmp (&value, &desc->value, sizeof (struct rtx_const)) == 0;
3138 /* Construct a constant descriptor for the rtl-expression X.
3139 It is up to the caller to enter the descriptor in the hash table. */
3141 static struct constant_descriptor_rtx *
3142 record_constant_rtx (mode, x)
3143 enum machine_mode mode;
3146 struct constant_descriptor_rtx *ptr;
3148 ptr = (struct constant_descriptor_rtx *) ggc_alloc (sizeof (*ptr));
3149 decode_rtx_const (mode, x, &ptr->value);
3154 /* Given a constant rtx X, return a MEM for the location in memory at which
3155 this constant has been placed. Return 0 if it not has been placed yet. */
3158 mem_for_const_double (x)
3161 enum machine_mode mode = GET_MODE (x);
3162 struct constant_descriptor_rtx *desc;
3164 for (desc = const_rtx_hash_table[const_hash_rtx (mode, x)]; desc;
3166 if (compare_constant_rtx (mode, x, desc))
3172 /* Given a constant rtx X, make (or find) a memory constant for its value
3173 and return a MEM rtx to refer to it in memory. */
3176 force_const_mem (mode, x)
3177 enum machine_mode mode;
3181 struct constant_descriptor_rtx *desc;
3184 struct pool_constant *pool;
3187 /* Compute hash code of X. Search the descriptors for that hash code
3188 to see if any of them describes X. If yes, we have an rtx to use. */
3189 hash = const_hash_rtx (mode, x);
3190 for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next)
3191 if (compare_constant_rtx (mode, x, desc))
3194 /* No constant equal to X is known to have been output.
3195 Make a constant descriptor to enter X in the hash table
3196 and make a MEM for it. */
3197 desc = record_constant_rtx (mode, x);
3198 desc->next = const_rtx_hash_table[hash];
3199 const_rtx_hash_table[hash] = desc;
3201 /* Align the location counter as required by EXP's data type. */
3202 align = GET_MODE_ALIGNMENT (mode == VOIDmode ? word_mode : mode);
3203 #ifdef CONSTANT_ALIGNMENT
3204 align = CONSTANT_ALIGNMENT (make_tree ((*lang_hooks.types.type_for_mode)
3205 (mode, 0), x), align);
3208 pool_offset += (align / BITS_PER_UNIT) - 1;
3209 pool_offset &= ~ ((align / BITS_PER_UNIT) - 1);
3211 if (GET_CODE (x) == LABEL_REF)
3212 LABEL_PRESERVE_P (XEXP (x, 0)) = 1;
3214 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3215 pool = (struct pool_constant *) ggc_alloc (sizeof (struct pool_constant));
3219 pool->labelno = const_labelno;
3220 pool->align = align;
3221 pool->offset = pool_offset;
3228 last_pool->next = pool;
3231 pool_offset += GET_MODE_SIZE (mode);
3233 /* Create a string containing the label name, in LABEL. */
3234 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3238 /* Construct the SYMBOL_REF and the MEM. */
3240 pool->desc->rtl = def
3241 = gen_rtx_MEM (mode, gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label)));
3242 set_mem_alias_set (def, const_alias_set);
3243 set_mem_attributes (def, (*lang_hooks.types.type_for_mode) (mode, 0), 1);
3244 RTX_UNCHANGING_P (def) = 1;
3246 /* Add label to symbol hash table. */
3247 hash = SYMHASH (XSTR (XEXP (def, 0), 0));
3248 pool->next_sym = const_rtx_sym_hash_table[hash];
3249 const_rtx_sym_hash_table[hash] = pool;
3251 /* Mark the symbol_ref as belonging to this constants pool. */
3252 CONSTANT_POOL_ADDRESS_P (XEXP (def, 0)) = 1;
3253 current_function_uses_const_pool = 1;
3258 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3259 the corresponding pool_constant structure. */
3261 static struct pool_constant *
3262 find_pool_constant (f, addr)
3266 struct pool_constant *pool;
3267 const char *label = XSTR (addr, 0);
3269 for (pool = f->varasm->x_const_rtx_sym_hash_table[SYMHASH (label)]; pool;
3270 pool = pool->next_sym)
3271 if (XSTR (XEXP (pool->desc->rtl, 0), 0) == label)
3277 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3280 get_pool_constant (addr)
3283 return (find_pool_constant (cfun, addr))->constant;
3286 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3287 and whether it has been output or not. */
3290 get_pool_constant_mark (addr, pmarked)
3294 struct pool_constant *pool = find_pool_constant (cfun, addr);
3295 *pmarked = (pool->mark != 0);
3296 return pool->constant;
3299 /* Likewise, but for the constant pool of a specific function. */
3302 get_pool_constant_for_function (f, addr)
3306 return (find_pool_constant (f, addr))->constant;
3309 /* Similar, return the mode. */
3312 get_pool_mode (addr)
3315 return (find_pool_constant (cfun, addr))->mode;
3319 get_pool_mode_for_function (f, addr)
3323 return (find_pool_constant (f, addr))->mode;
3326 /* Similar, return the offset in the constant pool. */
3329 get_pool_offset (addr)
3332 return (find_pool_constant (cfun, addr))->offset;
3335 /* Return the size of the constant pool. */
3343 /* Write all the constants in the constant pool. */
3346 output_constant_pool (fnname, fndecl)
3347 const char *fnname ATTRIBUTE_UNUSED;
3348 tree fndecl ATTRIBUTE_UNUSED;
3350 struct pool_constant *pool;
3354 /* It is possible for gcc to call force_const_mem and then to later
3355 discard the instructions which refer to the constant. In such a
3356 case we do not need to output the constant. */
3357 mark_constant_pool ();
3359 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3360 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset);
3363 for (pool = first_pool; pool; pool = pool->next)
3372 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3373 whose CODE_LABEL has been deleted. This can occur if a jump table
3374 is eliminated by optimization. If so, write a constant of zero
3375 instead. Note that this can also happen by turning the
3376 CODE_LABEL into a NOTE. */
3377 /* ??? This seems completely and utterly wrong. Certainly it's
3378 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3379 functioning even with INSN_DELETED_P and friends. */
3382 switch (GET_CODE (x))
3385 if (GET_CODE (XEXP (x, 0)) != PLUS
3386 || GET_CODE (XEXP (XEXP (x, 0), 0)) != LABEL_REF)
3388 tmp = XEXP (XEXP (x, 0), 0);
3393 if (INSN_DELETED_P (tmp)
3394 || (GET_CODE (tmp) == NOTE
3395 && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_DELETED))
3406 /* First switch to correct section. */
3407 (*targetm.asm_out.select_rtx_section) (pool->mode, x, pool->align);
3409 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3410 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode,
3411 pool->align, pool->labelno, done);
3414 assemble_align (pool->align);
3416 /* Output the label. */
3417 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", pool->labelno);
3419 /* Output the value of the constant itself. */
3420 switch (GET_MODE_CLASS (pool->mode))
3423 if (GET_CODE (x) != CONST_DOUBLE)
3426 REAL_VALUE_FROM_CONST_DOUBLE (r, x);
3427 assemble_real (r, pool->mode, pool->align);
3431 case MODE_PARTIAL_INT:
3432 assemble_integer (x, GET_MODE_SIZE (pool->mode), pool->align, 1);
3435 case MODE_VECTOR_FLOAT:
3440 if (GET_CODE (x) != CONST_VECTOR)
3443 units = CONST_VECTOR_NUNITS (x);
3445 for (i = 0; i < units; i++)
3447 elt = CONST_VECTOR_ELT (x, i);
3448 REAL_VALUE_FROM_CONST_DOUBLE (r, elt);
3449 assemble_real (r, GET_MODE_INNER (pool->mode), pool->align);
3454 case MODE_VECTOR_INT:
3459 if (GET_CODE (x) != CONST_VECTOR)
3462 units = CONST_VECTOR_NUNITS (x);
3464 for (i = 0; i < units; i++)
3466 elt = CONST_VECTOR_ELT (x, i);
3467 assemble_integer (elt, GET_MODE_UNIT_SIZE (pool->mode),
3477 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3482 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3483 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool_offset);
3486 /* Done with this pool. */
3487 first_pool = last_pool = 0;
3490 /* Look through the instructions for this function, and mark all the
3491 entries in the constant pool which are actually being used.
3492 Emit used deferred strings. */
3495 mark_constant_pool ()
3499 struct pool_constant *pool;
3501 if (first_pool == 0 && htab_elements (const_str_htab) == 0)
3504 for (pool = first_pool; pool; pool = pool->next)
3507 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3509 mark_constants (PATTERN (insn));
3511 for (link = current_function_epilogue_delay_list;
3513 link = XEXP (link, 1))
3515 insn = XEXP (link, 0);
3518 mark_constants (PATTERN (insn));
3522 /* Look through appropriate parts of X, marking all entries in the
3523 constant pool which are actually being used. Entries that are only
3524 referenced by other constants are also marked as used. Emit
3525 deferred strings that are used. */
3532 const char *format_ptr;
3537 if (GET_CODE (x) == SYMBOL_REF)
3539 mark_constant (&x, NULL);
3543 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3544 insns, not any notes that may be attached. We don't want to mark
3545 a constant just because it happens to appear in a REG_EQUIV note. */
3548 mark_constants (PATTERN (x));
3552 format_ptr = GET_RTX_FORMAT (GET_CODE (x));
3554 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (x)); i++)
3556 switch (*format_ptr++)
3559 mark_constants (XEXP (x, i));
3563 if (XVEC (x, i) != 0)
3567 for (j = 0; j < XVECLEN (x, i); j++)
3568 mark_constants (XVECEXP (x, i, j));
3588 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3589 to as used. Emit referenced deferred strings. This function can
3590 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3593 mark_constant (current_rtx, data)
3595 void *data ATTRIBUTE_UNUSED;
3597 rtx x = *current_rtx;
3602 else if (GET_CODE (x) == SYMBOL_REF)
3604 if (CONSTANT_POOL_ADDRESS_P (x))
3606 struct pool_constant *pool = find_pool_constant (cfun, x);
3607 if (pool->mark == 0)
3610 for_each_rtx (&(pool->constant), &mark_constant, NULL);
3615 else if (STRING_POOL_ADDRESS_P (x))
3617 struct deferred_string **defstr;
3619 defstr = (struct deferred_string **)
3620 htab_find_slot_with_hash (const_str_htab, XSTR (x, 0),
3621 STRHASH (XSTR (x, 0)), NO_INSERT);
3624 struct deferred_string *p = *defstr;
3626 STRING_POOL_ADDRESS_P (x) = 0;
3627 output_constant_def_contents (p->exp, 0, p->labelno);
3628 htab_clear_slot (const_str_htab, (void **) defstr);
3635 /* Find all the constants whose addresses are referenced inside of EXP,
3636 and make sure assembler code with a label has been output for each one.
3637 Indicate whether an ADDR_EXPR has been encountered. */
3640 output_addressed_constants (exp)
3646 /* Give the front-end a chance to convert VALUE to something that
3647 looks more like a constant to the back-end. */
3648 exp = (*lang_hooks.expand_constant) (exp);
3650 switch (TREE_CODE (exp))
3653 /* Go inside any operations that get_inner_reference can handle and see
3654 if what's inside is a constant: no need to do anything here for
3655 addresses of variables or functions. */
3656 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
3657 tem = TREE_OPERAND (tem, 0))
3660 if (TREE_CODE_CLASS (TREE_CODE (tem)) == 'c'
3661 || TREE_CODE (tem) == CONSTRUCTOR)
3662 output_constant_def (tem, 0);
3664 if (TREE_PUBLIC (tem))
3672 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3673 reloc |= output_addressed_constants (TREE_OPERAND (exp, 1));
3678 case NON_LVALUE_EXPR:
3679 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3683 for (tem = CONSTRUCTOR_ELTS (exp); tem; tem = TREE_CHAIN (tem))
3684 if (TREE_VALUE (tem) != 0)
3685 reloc |= output_addressed_constants (TREE_VALUE (tem));
3695 /* Return nonzero if VALUE is a valid constant-valued expression
3696 for use in initializing a static variable; one that can be an
3697 element of a "constant" initializer.
3699 Return null_pointer_node if the value is absolute;
3700 if it is relocatable, return the variable that determines the relocation.
3701 We assume that VALUE has been folded as much as possible;
3702 therefore, we do not need to check for such things as
3703 arithmetic-combinations of integers. */
3706 initializer_constant_valid_p (value, endtype)
3710 /* Give the front-end a chance to convert VALUE to something that
3711 looks more like a constant to the back-end. */
3712 value = (*lang_hooks.expand_constant) (value);
3714 switch (TREE_CODE (value))
3717 if ((TREE_CODE (TREE_TYPE (value)) == UNION_TYPE
3718 || TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE)
3719 && TREE_CONSTANT (value)
3720 && CONSTRUCTOR_ELTS (value))
3722 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value)),
3725 return TREE_STATIC (value) ? null_pointer_node : 0;
3732 return null_pointer_node;
3736 return staticp (TREE_OPERAND (value, 0)) ? TREE_OPERAND (value, 0) : 0;
3738 case VIEW_CONVERT_EXPR:
3739 case NON_LVALUE_EXPR:
3740 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3744 /* Allow conversions between pointer types. */
3745 if (POINTER_TYPE_P (TREE_TYPE (value))
3746 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3747 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3749 /* Allow conversions between real types. */
3750 if (FLOAT_TYPE_P (TREE_TYPE (value))
3751 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3752 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3754 /* Allow length-preserving conversions between integer types. */
3755 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3756 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3757 && (TYPE_PRECISION (TREE_TYPE (value))
3758 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3759 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3761 /* Allow conversions between other integer types only if
3763 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3764 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3766 tree inner = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3768 if (inner == null_pointer_node)
3769 return null_pointer_node;
3773 /* Allow (int) &foo provided int is as wide as a pointer. */
3774 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3775 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3776 && (TYPE_PRECISION (TREE_TYPE (value))
3777 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3778 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3781 /* Likewise conversions from int to pointers, but also allow
3782 conversions from 0. */
3783 if (POINTER_TYPE_P (TREE_TYPE (value))
3784 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3786 if (integer_zerop (TREE_OPERAND (value, 0)))
3787 return null_pointer_node;
3788 else if (TYPE_PRECISION (TREE_TYPE (value))
3789 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0))))
3790 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3794 /* Allow conversions to union types if the value inside is okay. */
3795 if (TREE_CODE (TREE_TYPE (value)) == UNION_TYPE)
3796 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3801 if (! INTEGRAL_TYPE_P (endtype)
3802 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3804 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3806 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3808 /* If either term is absolute, use the other terms relocation. */
3809 if (valid0 == null_pointer_node)
3811 if (valid1 == null_pointer_node)
3817 if (! INTEGRAL_TYPE_P (endtype)
3818 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3820 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3822 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3824 /* Win if second argument is absolute. */
3825 if (valid1 == null_pointer_node)
3827 /* Win if both arguments have the same relocation.
3828 Then the value is absolute. */
3829 if (valid0 == valid1 && valid0 != 0)
3830 return null_pointer_node;
3832 /* Since GCC guarantees that string constants are unique in the
3833 generated code, a subtraction between two copies of the same
3834 constant string is absolute. */
3835 if (valid0 && TREE_CODE (valid0) == STRING_CST &&
3836 valid1 && TREE_CODE (valid1) == STRING_CST &&
3837 TREE_STRING_POINTER (valid0) == TREE_STRING_POINTER (valid1))
3838 return null_pointer_node;
3841 /* Support differences between labels. */
3842 if (INTEGRAL_TYPE_P (endtype))
3845 op0 = TREE_OPERAND (value, 0);
3846 op1 = TREE_OPERAND (value, 1);
3848 /* Like STRIP_NOPS except allow the operand mode to widen.
3849 This works around a feature of fold that simplfies
3850 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3851 that the narrower operation is cheaper. */
3853 while (TREE_CODE (op0) == NOP_EXPR
3854 || TREE_CODE (op0) == CONVERT_EXPR
3855 || TREE_CODE (op0) == NON_LVALUE_EXPR)
3857 tree inner = TREE_OPERAND (op0, 0);
3858 if (inner == error_mark_node
3859 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3860 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0)))
3861 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3866 while (TREE_CODE (op1) == NOP_EXPR
3867 || TREE_CODE (op1) == CONVERT_EXPR
3868 || TREE_CODE (op1) == NON_LVALUE_EXPR)
3870 tree inner = TREE_OPERAND (op1, 0);
3871 if (inner == error_mark_node
3872 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3873 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1)))
3874 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3879 if (TREE_CODE (op0) == ADDR_EXPR
3880 && TREE_CODE (TREE_OPERAND (op0, 0)) == LABEL_DECL
3881 && TREE_CODE (op1) == ADDR_EXPR
3882 && TREE_CODE (TREE_OPERAND (op1, 0)) == LABEL_DECL)
3883 return null_pointer_node;
3894 /* Output assembler code for constant EXP to FILE, with no label.
3895 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3896 Assumes output_addressed_constants has been done on EXP already.
3898 Generate exactly SIZE bytes of assembler data, padding at the end
3899 with zeros if necessary. SIZE must always be specified.
3901 SIZE is important for structure constructors,
3902 since trailing members may have been omitted from the constructor.
3903 It is also important for initialization of arrays from string constants
3904 since the full length of the string constant might not be wanted.
3905 It is also needed for initialization of unions, where the initializer's
3906 type is just one member, and that may not be as long as the union.
3908 There a case in which we would fail to output exactly SIZE bytes:
3909 for a structure constructor that wants to produce more than SIZE bytes.
3910 But such constructors will never be generated for any possible input.
3912 ALIGN is the alignment of the data in bits. */
3915 output_constant (exp, size, align)
3920 enum tree_code code;
3921 HOST_WIDE_INT thissize;
3923 /* Some front-ends use constants other than the standard language-indepdent
3924 varieties, but which may still be output directly. Give the front-end a
3925 chance to convert EXP to a language-independent representation. */
3926 exp = (*lang_hooks.expand_constant) (exp);
3928 if (size == 0 || flag_syntax_only)
3931 /* Eliminate any conversions since we'll be outputting the underlying
3933 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
3934 || TREE_CODE (exp) == NON_LVALUE_EXPR
3935 || TREE_CODE (exp) == VIEW_CONVERT_EXPR)
3936 exp = TREE_OPERAND (exp, 0);
3938 code = TREE_CODE (TREE_TYPE (exp));
3939 thissize = int_size_in_bytes (TREE_TYPE (exp));
3941 /* Allow a constructor with no elements for any data type.
3942 This means to fill the space with zeros. */
3943 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
3945 assemble_zeros (size);
3949 if (TREE_CODE (exp) == FDESC_EXPR)
3951 #ifdef ASM_OUTPUT_FDESC
3952 HOST_WIDE_INT part = tree_low_cst (TREE_OPERAND (exp, 1), 0);
3953 tree decl = TREE_OPERAND (exp, 0);
3954 ASM_OUTPUT_FDESC (asm_out_file, decl, part);
3961 /* Now output the underlying data. If we've handling the padding, return.
3962 Otherwise, break and ensure THISSIZE is the size written. */
3970 case REFERENCE_TYPE:
3971 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
3972 EXPAND_INITIALIZER),
3974 error ("initializer for integer value is too complicated");
3978 if (TREE_CODE (exp) != REAL_CST)
3979 error ("initializer for floating value is not a floating constant");
3981 assemble_real (TREE_REAL_CST (exp),
3982 mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0),
3987 output_constant (TREE_REALPART (exp), thissize / 2, align);
3988 output_constant (TREE_IMAGPART (exp), thissize / 2,
3989 min_align (align, BITS_PER_UNIT * (thissize / 2)));
3994 if (TREE_CODE (exp) == CONSTRUCTOR)
3996 output_constructor (exp, size, align);
3999 else if (TREE_CODE (exp) == STRING_CST)
4001 thissize = MIN (TREE_STRING_LENGTH (exp), size);
4002 assemble_string (TREE_STRING_POINTER (exp), thissize);
4010 if (TREE_CODE (exp) == CONSTRUCTOR)
4011 output_constructor (exp, size, align);
4017 if (TREE_CODE (exp) == INTEGER_CST)
4018 assemble_integer (expand_expr (exp, NULL_RTX,
4019 VOIDmode, EXPAND_INITIALIZER),
4020 thissize, align, 1);
4021 else if (TREE_CODE (exp) == CONSTRUCTOR)
4023 unsigned char *buffer = (unsigned char *) alloca (thissize);
4024 if (get_set_constructor_bytes (exp, buffer, thissize))
4026 assemble_string ((char *) buffer, thissize);
4029 error ("unknown set constructor type");
4041 assemble_zeros (size);
4045 /* Subroutine of output_constructor, used for computing the size of
4046 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4047 type with an unspecified upper bound. */
4049 static unsigned HOST_WIDE_INT
4050 array_size_for_constructor (val)
4055 /* This code used to attempt to handle string constants that are not
4056 arrays of single-bytes, but nothing else does, so there's no point in
4058 if (TREE_CODE (val) == STRING_CST)
4059 return TREE_STRING_LENGTH (val);
4061 max_index = NULL_TREE;
4062 for (i = CONSTRUCTOR_ELTS (val); i; i = TREE_CHAIN (i))
4064 tree index = TREE_PURPOSE (i);
4066 if (TREE_CODE (index) == RANGE_EXPR)
4067 index = TREE_OPERAND (index, 1);
4068 if (max_index == NULL_TREE || tree_int_cst_lt (max_index, index))
4072 if (max_index == NULL_TREE)
4075 /* Compute the total number of array elements. */
4076 i = size_binop (MINUS_EXPR, convert (sizetype, max_index),
4078 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val)))));
4079 i = size_binop (PLUS_EXPR, i, convert (sizetype, integer_one_node));
4081 /* Multiply by the array element unit size to find number of bytes. */
4082 i = size_binop (MULT_EXPR, i, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val))));
4084 return tree_low_cst (i, 1);
4087 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4088 Generate at least SIZE bytes, padding if necessary. */
4091 output_constructor (exp, size, align)
4096 tree type = TREE_TYPE (exp);
4097 tree link, field = 0;
4099 /* Number of bytes output or skipped so far.
4100 In other words, current position within the constructor. */
4101 HOST_WIDE_INT total_bytes = 0;
4102 /* Non-zero means BYTE contains part of a byte, to be output. */
4103 int byte_buffer_in_use = 0;
4106 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
4109 if (TREE_CODE (type) == RECORD_TYPE)
4110 field = TYPE_FIELDS (type);
4112 if (TREE_CODE (type) == ARRAY_TYPE
4113 && TYPE_DOMAIN (type) != 0)
4114 min_index = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
4116 /* As LINK goes through the elements of the constant,
4117 FIELD goes through the structure fields, if the constant is a structure.
4118 if the constant is a union, then we override this,
4119 by getting the field from the TREE_LIST element.
4120 But the constant could also be an array. Then FIELD is zero.
4122 There is always a maximum of one element in the chain LINK for unions
4123 (even if the initializer in a source program incorrectly contains
4125 for (link = CONSTRUCTOR_ELTS (exp);
4127 link = TREE_CHAIN (link),
4128 field = field ? TREE_CHAIN (field) : 0)
4130 tree val = TREE_VALUE (link);
4133 /* The element in a union constructor specifies the proper field
4135 if ((TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
4136 || TREE_CODE (type) == QUAL_UNION_TYPE)
4137 && TREE_PURPOSE (link) != 0)
4138 field = TREE_PURPOSE (link);
4140 else if (TREE_CODE (type) == ARRAY_TYPE)
4141 index = TREE_PURPOSE (link);
4143 /* Eliminate the marker that makes a cast not be an lvalue. */
4147 if (index && TREE_CODE (index) == RANGE_EXPR)
4149 unsigned HOST_WIDE_INT fieldsize
4150 = int_size_in_bytes (TREE_TYPE (type));
4151 HOST_WIDE_INT lo_index = tree_low_cst (TREE_OPERAND (index, 0), 0);
4152 HOST_WIDE_INT hi_index = tree_low_cst (TREE_OPERAND (index, 1), 0);
4153 HOST_WIDE_INT index;
4154 unsigned int align2 = min_align (align, fieldsize * BITS_PER_UNIT);
4156 for (index = lo_index; index <= hi_index; index++)
4158 /* Output the element's initial value. */
4160 assemble_zeros (fieldsize);
4162 output_constant (val, fieldsize, align2);
4164 /* Count its size. */
4165 total_bytes += fieldsize;
4168 else if (field == 0 || !DECL_BIT_FIELD (field))
4170 /* An element that is not a bit-field. */
4172 unsigned HOST_WIDE_INT fieldsize;
4173 /* Since this structure is static,
4174 we know the positions are constant. */
4175 HOST_WIDE_INT pos = field ? int_byte_position (field) : 0;
4176 unsigned int align2;
4179 pos = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val)), 1)
4180 * (tree_low_cst (index, 0) - tree_low_cst (min_index, 0)));
4182 /* Output any buffered-up bit-fields preceding this element. */
4183 if (byte_buffer_in_use)
4185 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4187 byte_buffer_in_use = 0;
4190 /* Advance to offset of this element.
4191 Note no alignment needed in an array, since that is guaranteed
4192 if each element has the proper size. */
4193 if ((field != 0 || index != 0) && pos != total_bytes)
4195 assemble_zeros (pos - total_bytes);
4199 /* Find the alignment of this element. */
4200 align2 = min_align (align, BITS_PER_UNIT * pos);
4202 /* Determine size this element should occupy. */
4207 /* If this is an array with an unspecified upper bound,
4208 the initializer determines the size. */
4209 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4210 but we cannot do this until the deprecated support for
4211 initializing zero-length array members is removed. */
4212 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE
4213 && TYPE_DOMAIN (TREE_TYPE (field))
4214 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field))))
4216 fieldsize = array_size_for_constructor (val);
4217 /* Given a non-empty initialization, this field had
4219 if (fieldsize != 0 && TREE_CHAIN (field) != NULL_TREE)
4222 else if (DECL_SIZE_UNIT (field))
4224 /* ??? This can't be right. If the decl size overflows
4225 a host integer we will silently emit no data. */
4226 if (host_integerp (DECL_SIZE_UNIT (field), 1))
4227 fieldsize = tree_low_cst (DECL_SIZE_UNIT (field), 1);
4231 fieldsize = int_size_in_bytes (TREE_TYPE (type));
4233 /* Output the element's initial value. */
4235 assemble_zeros (fieldsize);
4237 output_constant (val, fieldsize, align2);
4239 /* Count its size. */
4240 total_bytes += fieldsize;
4242 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
4243 error ("invalid initial value for member `%s'",
4244 IDENTIFIER_POINTER (DECL_NAME (field)));
4247 /* Element that is a bit-field. */
4249 HOST_WIDE_INT next_offset = int_bit_position (field);
4250 HOST_WIDE_INT end_offset
4251 = (next_offset + tree_low_cst (DECL_SIZE (field), 1));
4254 val = integer_zero_node;
4256 /* If this field does not start in this (or, next) byte,
4258 if (next_offset / BITS_PER_UNIT != total_bytes)
4260 /* Output remnant of any bit field in previous bytes. */
4261 if (byte_buffer_in_use)
4263 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4265 byte_buffer_in_use = 0;
4268 /* If still not at proper byte, advance to there. */
4269 if (next_offset / BITS_PER_UNIT != total_bytes)
4271 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
4272 total_bytes = next_offset / BITS_PER_UNIT;
4276 if (! byte_buffer_in_use)
4279 /* We must split the element into pieces that fall within
4280 separate bytes, and combine each byte with previous or
4281 following bit-fields. */
4283 /* next_offset is the offset n fbits from the beginning of
4284 the structure to the next bit of this element to be processed.
4285 end_offset is the offset of the first bit past the end of
4287 while (next_offset < end_offset)
4291 HOST_WIDE_INT value;
4292 HOST_WIDE_INT next_byte = next_offset / BITS_PER_UNIT;
4293 HOST_WIDE_INT next_bit = next_offset % BITS_PER_UNIT;
4295 /* Advance from byte to byte
4296 within this element when necessary. */
4297 while (next_byte != total_bytes)
4299 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4304 /* Number of bits we can process at once
4305 (all part of the same byte). */
4306 this_time = MIN (end_offset - next_offset,
4307 BITS_PER_UNIT - next_bit);
4308 if (BYTES_BIG_ENDIAN)
4310 /* On big-endian machine, take the most significant bits
4311 first (of the bits that are significant)
4312 and put them into bytes from the most significant end. */
4313 shift = end_offset - next_offset - this_time;
4315 /* Don't try to take a bunch of bits that cross
4316 the word boundary in the INTEGER_CST. We can
4317 only select bits from the LOW or HIGH part
4319 if (shift < HOST_BITS_PER_WIDE_INT
4320 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4322 this_time = shift + this_time - HOST_BITS_PER_WIDE_INT;
4323 shift = HOST_BITS_PER_WIDE_INT;
4326 /* Now get the bits from the appropriate constant word. */
4327 if (shift < HOST_BITS_PER_WIDE_INT)
4328 value = TREE_INT_CST_LOW (val);
4329 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4331 value = TREE_INT_CST_HIGH (val);
4332 shift -= HOST_BITS_PER_WIDE_INT;
4337 /* Get the result. This works only when:
4338 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4339 byte |= (((value >> shift)
4340 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4341 << (BITS_PER_UNIT - this_time - next_bit));
4345 /* On little-endian machines,
4346 take first the least significant bits of the value
4347 and pack them starting at the least significant
4348 bits of the bytes. */
4349 shift = next_offset - int_bit_position (field);
4351 /* Don't try to take a bunch of bits that cross
4352 the word boundary in the INTEGER_CST. We can
4353 only select bits from the LOW or HIGH part
4355 if (shift < HOST_BITS_PER_WIDE_INT
4356 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4357 this_time = (HOST_BITS_PER_WIDE_INT - shift);
4359 /* Now get the bits from the appropriate constant word. */
4360 if (shift < HOST_BITS_PER_WIDE_INT)
4361 value = TREE_INT_CST_LOW (val);
4362 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4364 value = TREE_INT_CST_HIGH (val);
4365 shift -= HOST_BITS_PER_WIDE_INT;
4370 /* Get the result. This works only when:
4371 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4372 byte |= (((value >> shift)
4373 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4377 next_offset += this_time;
4378 byte_buffer_in_use = 1;
4383 if (byte_buffer_in_use)
4385 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4389 if (total_bytes < size)
4390 assemble_zeros (size - total_bytes);
4393 /* This TREE_LIST contains any weak symbol declarations waiting
4395 static GTY(()) tree weak_decls;
4397 /* Mark DECL as weak. */
4403 DECL_WEAK (decl) = 1;
4405 if (DECL_RTL_SET_P (decl)
4406 && GET_CODE (DECL_RTL (decl)) == MEM
4407 && XEXP (DECL_RTL (decl), 0)
4408 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == SYMBOL_REF)
4409 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl), 0)) = 1;
4412 /* Merge weak status between NEWDECL and OLDDECL. */
4415 merge_weak (newdecl, olddecl)
4419 if (DECL_WEAK (newdecl) == DECL_WEAK (olddecl))
4422 if (DECL_WEAK (newdecl))
4426 /* NEWDECL is weak, but OLDDECL is not. */
4428 /* If we already output the OLDDECL, we're in trouble; we can't
4429 go back and make it weak. This error cannot caught in
4430 declare_weak because the NEWDECL and OLDDECL was not yet
4431 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4432 if (TREE_ASM_WRITTEN (olddecl))
4433 error_with_decl (newdecl,
4434 "weak declaration of `%s' must precede definition");
4436 /* If we've already generated rtl referencing OLDDECL, we may
4437 have done so in a way that will not function properly with
4439 else if (TREE_USED (olddecl)
4440 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl)))
4441 warning_with_decl (newdecl, "weak declaration of `%s' after first use results in unspecified behavior");
4445 /* We put the NEWDECL on the weak_decls list at some point.
4446 Replace it with the OLDDECL. */
4447 for (wd = weak_decls; wd; wd = TREE_CHAIN (wd))
4448 if (TREE_VALUE (wd) == newdecl)
4450 TREE_VALUE (wd) = olddecl;
4453 /* We may not find the entry on the list. If NEWDECL is a
4454 weak alias, then we will have already called
4455 globalize_decl to remove the entry; in that case, we do
4456 not need to do anything. */
4459 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4460 mark_weak (olddecl);
4463 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4464 weak. Just update NEWDECL to indicate that it's weak too. */
4465 mark_weak (newdecl);
4468 /* Declare DECL to be a weak symbol. */
4474 if (! TREE_PUBLIC (decl))
4475 error_with_decl (decl, "weak declaration of `%s' must be public");
4476 else if (TREE_CODE (decl) == FUNCTION_DECL && TREE_ASM_WRITTEN (decl))
4477 error_with_decl (decl, "weak declaration of `%s' must precede definition");
4478 else if (SUPPORTS_WEAK)
4480 if (! DECL_WEAK (decl))
4481 weak_decls = tree_cons (NULL, decl, weak_decls);
4484 warning_with_decl (decl, "weak declaration of `%s' not supported");
4489 /* Emit any pending weak declarations. */
4496 for (t = weak_decls; t; t = TREE_CHAIN (t))
4498 tree decl = TREE_VALUE (t);
4499 const char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4501 if (! TREE_USED (decl))
4504 #ifdef ASM_WEAKEN_DECL
4505 ASM_WEAKEN_DECL (asm_out_file, decl, name, NULL);
4507 #ifdef ASM_WEAKEN_LABEL
4508 ASM_WEAKEN_LABEL (asm_out_file, name);
4510 #ifdef ASM_OUTPUT_WEAK_ALIAS
4511 warning ("only weak aliases are supported in this configuration");
4519 /* Emit the assembly bits to indicate that DECL is globally visible. */
4522 globalize_decl (decl)
4525 const char *name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4527 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4528 if (DECL_WEAK (decl))
4532 #ifdef ASM_WEAKEN_DECL
4533 ASM_WEAKEN_DECL (asm_out_file, decl, name, 0);
4535 ASM_WEAKEN_LABEL (asm_out_file, name);
4538 /* Remove this function from the pending weak list so that
4539 we do not emit multiple .weak directives for it. */
4540 for (p = &weak_decls; (t = *p) ; )
4542 if (DECL_ASSEMBLER_NAME (decl) == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
4543 *p = TREE_CHAIN (t);
4545 p = &TREE_CHAIN (t);
4551 ASM_GLOBALIZE_LABEL (asm_out_file, name);
4554 /* Emit an assembler directive to make the symbol for DECL an alias to
4555 the symbol for TARGET. */
4558 assemble_alias (decl, target)
4559 tree decl, target ATTRIBUTE_UNUSED;
4563 /* We must force creation of DECL_RTL for debug info generation, even though
4564 we don't use it here. */
4565 make_decl_rtl (decl, NULL);
4567 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4569 #ifdef ASM_OUTPUT_DEF
4570 /* Make name accessible from other files, if appropriate. */
4572 if (TREE_PUBLIC (decl))
4574 globalize_decl (decl);
4575 maybe_assemble_visibility (decl);
4578 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4579 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
4581 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4583 #else /* !ASM_OUTPUT_DEF */
4584 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4585 if (! DECL_WEAK (decl))
4586 warning ("only weak aliases are supported in this configuration");
4588 #ifdef ASM_WEAKEN_DECL
4589 ASM_WEAKEN_DECL (asm_out_file, decl, name, IDENTIFIER_POINTER (target));
4591 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
4594 warning ("alias definitions not supported in this configuration; ignored");
4598 TREE_USED (decl) = 1;
4599 TREE_ASM_WRITTEN (decl) = 1;
4600 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl)) = 1;
4603 /* Emit an assembler directive to set symbol for DECL visibility to
4607 assemble_visibility (decl, visibility_type)
4609 const char *visibility_type ATTRIBUTE_UNUSED;
4613 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4615 #ifdef HAVE_GAS_HIDDEN
4616 fprintf (asm_out_file, "\t.%s\t%s\n", visibility_type, name);
4618 warning ("visibility attribute not supported in this configuration; ignored");
4622 /* A helper function to call assemble_visibility when needed for a decl. */
4625 maybe_assemble_visibility (decl)
4628 tree visibility = lookup_attribute ("visibility", DECL_ATTRIBUTES (decl));
4632 = TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (visibility)));
4633 assemble_visibility (decl, type);
4637 /* Returns 1 if the target configuration supports defining public symbols
4638 so that one of them will be chosen at link time instead of generating a
4639 multiply-defined symbol error, whether through the use of weak symbols or
4640 a target-specific mechanism for having duplicates discarded. */
4643 supports_one_only ()
4645 if (SUPPORTS_ONE_ONLY)
4647 return SUPPORTS_WEAK;
4650 /* Set up DECL as a public symbol that can be defined in multiple
4651 translation units without generating a linker error. */
4654 make_decl_one_only (decl)
4657 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL)
4660 TREE_PUBLIC (decl) = 1;
4662 if (TREE_CODE (decl) == VAR_DECL
4663 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
4664 DECL_COMMON (decl) = 1;
4665 else if (SUPPORTS_ONE_ONLY)
4667 #ifdef MAKE_DECL_ONE_ONLY
4668 MAKE_DECL_ONE_ONLY (decl);
4670 DECL_ONE_ONLY (decl) = 1;
4672 else if (SUPPORTS_WEAK)
4673 DECL_WEAK (decl) = 1;
4681 const_str_htab = htab_create_ggc (128, const_str_htab_hash,
4682 const_str_htab_eq, NULL);
4683 in_named_htab = htab_create (31, in_named_entry_hash,
4684 in_named_entry_eq, NULL);
4686 const_alias_set = new_alias_set ();
4689 /* Select a set of attributes for section NAME based on the properties
4690 of DECL and whether or not RELOC indicates that DECL's initializer
4691 might contain runtime relocations.
4693 We make the section read-only and executable for a function decl,
4694 read-only for a const data decl, and writable for a non-const data decl. */
4697 default_section_type_flags (decl, name, reloc)
4704 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
4705 flags = SECTION_CODE;
4706 else if (decl && DECL_READONLY_SECTION (decl, reloc))
4709 flags = SECTION_WRITE;
4711 if (decl && DECL_ONE_ONLY (decl))
4712 flags |= SECTION_LINKONCE;
4714 if (decl && TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4715 flags |= SECTION_TLS | SECTION_WRITE;
4717 if (strcmp (name, ".bss") == 0
4718 || strncmp (name, ".bss.", 5) == 0
4719 || strncmp (name, ".gnu.linkonce.b.", 16) == 0
4720 || strcmp (name, ".sbss") == 0
4721 || strncmp (name, ".sbss.", 6) == 0
4722 || strncmp (name, ".gnu.linkonce.sb.", 17) == 0
4723 || strcmp (name, ".tbss") == 0
4724 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4725 flags |= SECTION_BSS;
4727 if (strcmp (name, ".tdata") == 0
4728 || strcmp (name, ".tbss") == 0
4729 || strncmp (name, ".gnu.linkonce.td.", 17) == 0
4730 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4731 flags |= SECTION_TLS;
4736 /* Output assembly to switch to section NAME with attribute FLAGS.
4737 Four variants for common object file formats. */
4740 default_no_named_section (name, flags)
4741 const char *name ATTRIBUTE_UNUSED;
4742 unsigned int flags ATTRIBUTE_UNUSED;
4744 /* Some object formats don't support named sections at all. The
4745 front-end should already have flagged this as an error. */
4750 default_elf_asm_named_section (name, flags)
4754 char flagchars[10], *f = flagchars;
4757 if (! named_section_first_declaration (name))
4759 fprintf (asm_out_file, "\t.section\t%s\n", name);
4763 if (!(flags & SECTION_DEBUG))
4765 if (flags & SECTION_WRITE)
4767 if (flags & SECTION_CODE)
4769 if (flags & SECTION_SMALL)
4771 if (flags & SECTION_MERGE)
4773 if (flags & SECTION_STRINGS)
4775 if (flags & SECTION_TLS)
4779 if (flags & SECTION_BSS)
4784 if (flags & SECTION_ENTSIZE)
4785 fprintf (asm_out_file, "\t.section\t%s,\"%s\",@%s,%d\n",
4786 name, flagchars, type, flags & SECTION_ENTSIZE);
4788 fprintf (asm_out_file, "\t.section\t%s,\"%s\",@%s\n",
4789 name, flagchars, type);
4793 default_coff_asm_named_section (name, flags)
4797 char flagchars[8], *f = flagchars;
4799 if (flags & SECTION_WRITE)
4801 if (flags & SECTION_CODE)
4805 fprintf (asm_out_file, "\t.section\t%s,\"%s\"\n", name, flagchars);
4809 default_pe_asm_named_section (name, flags)
4813 default_coff_asm_named_section (name, flags);
4815 if (flags & SECTION_LINKONCE)
4817 /* Functions may have been compiled at various levels of
4818 optimization so we can't use `same_size' here.
4819 Instead, have the linker pick one. */
4820 fprintf (asm_out_file, "\t.linkonce %s\n",
4821 (flags & SECTION_CODE ? "discard" : "same_size"));
4825 /* Used for vtable gc in GNU binutils. Record that the pointer at OFFSET
4826 from SYMBOL is used in all classes derived from SYMBOL. */
4829 assemble_vtable_entry (symbol, offset)
4831 HOST_WIDE_INT offset;
4833 fputs ("\t.vtable_entry ", asm_out_file);
4834 output_addr_const (asm_out_file, symbol);
4835 fputs (", ", asm_out_file);
4836 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC, offset);
4837 fputc ('\n', asm_out_file);
4840 /* Used for vtable gc in GNU binutils. Record the class hierarchy by noting
4841 that the vtable symbol CHILD is derived from the vtable symbol PARENT. */
4844 assemble_vtable_inherit (child, parent)
4847 fputs ("\t.vtable_inherit ", asm_out_file);
4848 output_addr_const (asm_out_file, child);
4849 fputs (", ", asm_out_file);
4850 output_addr_const (asm_out_file, parent);
4851 fputc ('\n', asm_out_file);
4854 /* The lame default section selector. */
4857 default_select_section (decl, reloc, align)
4860 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED;
4862 bool readonly = false;
4866 if (DECL_READONLY_SECTION (decl, reloc))
4869 else if (TREE_CODE (decl) == CONSTRUCTOR)
4871 if (! ((flag_pic && reloc)
4872 || !TREE_READONLY (decl)
4873 || TREE_SIDE_EFFECTS (decl)
4874 || !TREE_CONSTANT (decl)))
4877 else if (TREE_CODE (decl) == STRING_CST)
4878 readonly = !flag_writable_strings;
4879 else if (! (flag_pic && reloc))
4883 readonly_data_section ();
4888 /* A helper function for default_elf_select_section and
4889 default_elf_unique_section. Categorizes the DECL. */
4891 enum section_category
4896 SECCAT_RODATA_MERGE_STR,
4897 SECCAT_RODATA_MERGE_STR_INIT,
4898 SECCAT_RODATA_MERGE_CONST,
4902 /* To optimize loading of shared programs, define following subsections
4904 _REL Contains data that has relocations, so they get grouped
4905 together and dynamic linker will visit fewer pages in memory.
4906 _RO Contains data that is otherwise read-only. This is useful
4907 with prelinking as most relocations won't be dynamically
4908 linked and thus stay read only.
4909 _LOCAL Marks data containing relocations only to local objects.
4910 These relocations will get fully resolved by prelinking. */
4912 SECCAT_DATA_REL_LOCAL,
4914 SECCAT_DATA_REL_RO_LOCAL,
4924 static enum section_category categorize_decl_for_section PARAMS ((tree, int));
4926 static enum section_category
4927 categorize_decl_for_section (decl, reloc)
4931 enum section_category ret;
4933 if (TREE_CODE (decl) == FUNCTION_DECL)
4935 else if (TREE_CODE (decl) == STRING_CST)
4937 if (flag_writable_strings)
4940 return SECCAT_RODATA_MERGE_STR;
4942 else if (TREE_CODE (decl) == VAR_DECL)
4944 if (DECL_INITIAL (decl) == NULL
4945 || DECL_INITIAL (decl) == error_mark_node)
4947 else if (! TREE_READONLY (decl)
4948 || TREE_SIDE_EFFECTS (decl)
4949 || ! TREE_CONSTANT (DECL_INITIAL (decl)))
4951 if (flag_pic && (reloc & 2))
4952 ret = SECCAT_DATA_REL;
4953 else if (flag_pic && reloc)
4954 ret = SECCAT_DATA_REL_LOCAL;
4958 else if (flag_pic && (reloc & 2))
4959 ret = SECCAT_DATA_REL_RO;
4960 else if (flag_pic && reloc)
4961 ret = SECCAT_DATA_REL_RO_LOCAL;
4962 else if (flag_merge_constants < 2)
4963 /* C and C++ don't allow different variables to share the same
4964 location. -fmerge-all-constants allows even that (at the
4965 expense of not conforming). */
4966 ret = SECCAT_RODATA;
4967 else if (TREE_CODE (DECL_INITIAL (decl)) == STRING_CST)
4968 ret = SECCAT_RODATA_MERGE_STR_INIT;
4970 ret = SECCAT_RODATA_MERGE_CONST;
4972 else if (TREE_CODE (decl) == CONSTRUCTOR)
4974 if ((flag_pic && reloc)
4975 || TREE_SIDE_EFFECTS (decl)
4976 || ! TREE_CONSTANT (decl))
4979 ret = SECCAT_RODATA;
4982 ret = SECCAT_RODATA;
4984 /* There are no read-only thread-local sections. */
4985 if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4987 if (ret == SECCAT_BSS)
4993 /* If the target uses small data sections, select it. */
4994 else if ((*targetm.in_small_data_p) (decl))
4996 if (ret == SECCAT_BSS)
5005 /* Select a section based on the above categorization. */
5008 default_elf_select_section (decl, reloc, align)
5011 unsigned HOST_WIDE_INT align;
5013 switch (categorize_decl_for_section (decl, reloc))
5016 /* We're not supposed to be called on FUNCTION_DECLs. */
5019 readonly_data_section ();
5021 case SECCAT_RODATA_MERGE_STR:
5022 mergeable_string_section (decl, align, 0);
5024 case SECCAT_RODATA_MERGE_STR_INIT:
5025 mergeable_string_section (DECL_INITIAL (decl), align, 0);
5027 case SECCAT_RODATA_MERGE_CONST:
5028 mergeable_constant_section (DECL_MODE (decl), align, 0);
5033 case SECCAT_DATA_REL:
5034 named_section (NULL_TREE, ".data.rel", reloc);
5036 case SECCAT_DATA_REL_LOCAL:
5037 named_section (NULL_TREE, ".data.rel.local", reloc);
5039 case SECCAT_DATA_REL_RO:
5040 named_section (NULL_TREE, ".data.rel.ro", reloc);
5042 case SECCAT_DATA_REL_RO_LOCAL:
5043 named_section (NULL_TREE, ".data.rel.ro.local", reloc);
5046 named_section (NULL_TREE, ".sdata", reloc);
5049 named_section (NULL_TREE, ".tdata", reloc);
5052 #ifdef BSS_SECTION_ASM_OP
5055 named_section (NULL_TREE, ".bss", reloc);
5059 named_section (NULL_TREE, ".sbss", reloc);
5062 named_section (NULL_TREE, ".tbss", reloc);
5069 /* Construct a unique section name based on the decl name and the
5070 categorization performed above. */
5073 default_unique_section (decl, reloc)
5077 bool one_only = DECL_ONE_ONLY (decl);
5078 const char *prefix, *name;
5082 switch (categorize_decl_for_section (decl, reloc))
5085 prefix = one_only ? ".gnu.linkonce.t." : ".text.";
5088 case SECCAT_RODATA_MERGE_STR:
5089 case SECCAT_RODATA_MERGE_STR_INIT:
5090 case SECCAT_RODATA_MERGE_CONST:
5091 prefix = one_only ? ".gnu.linkonce.r." : ".rodata.";
5094 case SECCAT_DATA_REL:
5095 case SECCAT_DATA_REL_LOCAL:
5096 case SECCAT_DATA_REL_RO:
5097 case SECCAT_DATA_REL_RO_LOCAL:
5098 prefix = one_only ? ".gnu.linkonce.d." : ".data.";
5101 prefix = one_only ? ".gnu.linkonce.s." : ".sdata.";
5104 prefix = one_only ? ".gnu.linkonce.b." : ".bss.";
5107 prefix = one_only ? ".gnu.linkonce.sb." : ".sbss.";
5110 prefix = one_only ? ".gnu.linkonce.td." : ".tdata.";
5113 prefix = one_only ? ".gnu.linkonce.tb." : ".tbss.";
5118 plen = strlen (prefix);
5120 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
5121 name = (* targetm.strip_name_encoding) (name);
5122 nlen = strlen (name);
5124 string = alloca (nlen + plen + 1);
5125 memcpy (string, prefix, plen);
5126 memcpy (string + plen, name, nlen + 1);
5128 DECL_SECTION_NAME (decl) = build_string (nlen + plen, string);
5132 default_select_rtx_section (mode, x, align)
5133 enum machine_mode mode ATTRIBUTE_UNUSED;
5135 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED;
5138 switch (GET_CODE (x))
5150 readonly_data_section ();
5154 default_elf_select_rtx_section (mode, x, align)
5155 enum machine_mode mode;
5157 unsigned HOST_WIDE_INT align;
5159 /* ??? Handle small data here somehow. */
5162 switch (GET_CODE (x))
5166 named_section (NULL_TREE, ".data.rel.ro", 3);
5170 named_section (NULL_TREE, ".data.rel.ro.local", 1);
5177 mergeable_constant_section (mode, align, 0);
5180 /* By default, we do nothing for encode_section_info, so we need not
5181 do anything but discard the '*' marker. */
5184 default_strip_name_encoding (str)
5187 return str + (*str == '*');
5190 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5191 wrt cross-module name binding. */
5194 default_binds_local_p (exp)
5199 /* A non-decl is an entry in the constant pool. */
5202 /* Static variables are always local. */
5203 else if (! TREE_PUBLIC (exp))
5205 /* A variable is local if the user tells us so. */
5206 else if (MODULE_LOCAL_P (exp))
5208 /* Otherwise, variables defined outside this object may not be local. */
5209 else if (DECL_EXTERNAL (exp))
5211 /* Linkonce and weak data are never local. */
5212 else if (DECL_ONE_ONLY (exp) || DECL_WEAK (exp))
5214 /* If PIC, then assume that any global name can be overridden by
5215 symbols resolved from other modules. */
5218 /* Uninitialized COMMON variable may be unified with symbols
5219 resolved from other modules. */
5220 else if (DECL_COMMON (exp)
5221 && (DECL_INITIAL (exp) == NULL
5222 || DECL_INITIAL (exp) == error_mark_node))
5224 /* Otherwise we're left with initialized (or non-common) global data
5225 which is of necessity defined locally. */
5232 #include "gt-varasm.h"