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 bool 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 (*targetm.asm_out.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 (*targetm.asm_out.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 maintain a hashed
827 table of such critters. Instead of adding stuff to a DECL
828 to give certain attributes to it, we could use an external
829 hash map from DECL to set of attributes. */
831 /* Let the target reassign the RTL if it wants.
832 This is necessary, for example, when one machine specific
833 decl attribute overrides another. */
834 (* targetm.encode_section_info) (decl, false);
838 new_name = name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
840 reg_number = decode_reg_name (asmspec);
841 if (reg_number == -2)
843 /* ASMSPEC is given, and not the name of a register. Mark the
844 name with a star so assemble_name won't munge it. */
845 char *starred = alloca (strlen (asmspec) + 2);
847 strcpy (starred + 1, asmspec);
851 if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
853 /* First detect errors in declaring global registers. */
854 if (reg_number == -1)
855 error_with_decl (decl, "register name not specified for `%s'");
856 else if (reg_number < 0)
857 error_with_decl (decl, "invalid register name for `%s'");
858 else if (TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
859 error_with_decl (decl,
860 "data type of `%s' isn't suitable for a register");
861 else if (! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl))))
862 error_with_decl (decl,
863 "register specified for `%s' isn't suitable for data type");
864 /* Now handle properly declared static register variables. */
869 if (DECL_INITIAL (decl) != 0 && TREE_STATIC (decl))
871 DECL_INITIAL (decl) = 0;
872 error ("global register variable has initial value");
874 if (TREE_THIS_VOLATILE (decl))
875 warning ("volatile register variables don't work as you might wish");
877 /* If the user specified one of the eliminables registers here,
878 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
879 confused with that register and be eliminated. This usage is
880 somewhat suspect... */
882 SET_DECL_RTL (decl, gen_rtx_raw_REG (DECL_MODE (decl), reg_number));
883 ORIGINAL_REGNO (DECL_RTL (decl)) = reg_number;
884 REG_USERVAR_P (DECL_RTL (decl)) = 1;
886 if (TREE_STATIC (decl))
888 /* Make this register global, so not usable for anything
890 #ifdef ASM_DECLARE_REGISTER_GLOBAL
891 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name);
893 nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl));
895 globalize_reg (reg_number + --nregs);
898 /* As a register variable, it has no section. */
903 /* Now handle ordinary static variables and functions (in memory).
904 Also handle vars declared register invalidly. */
906 if (reg_number >= 0 || reg_number == -3)
907 error_with_decl (decl,
908 "register name given for non-register variable `%s'");
910 /* Specifying a section attribute on a variable forces it into a
911 non-.bss section, and thus it cannot be common. */
912 if (TREE_CODE (decl) == VAR_DECL
913 && DECL_SECTION_NAME (decl) != NULL_TREE
914 && DECL_INITIAL (decl) == NULL_TREE
915 && DECL_COMMON (decl))
916 DECL_COMMON (decl) = 0;
918 /* Variables can't be both common and weak. */
919 if (TREE_CODE (decl) == VAR_DECL && DECL_WEAK (decl))
920 DECL_COMMON (decl) = 0;
922 /* Can't use just the variable's own name for a variable
923 whose scope is less than the whole file, unless it's a member
924 of a local class (which will already be unambiguous).
925 Concatenate a distinguishing number. */
926 if (!top_level && !TREE_PUBLIC (decl)
927 && ! (DECL_CONTEXT (decl) && TYPE_P (DECL_CONTEXT (decl)))
929 && name == IDENTIFIER_POINTER (DECL_NAME (decl)))
933 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
938 if (name != new_name)
940 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (new_name));
941 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
944 /* If this variable is to be treated as volatile, show its
945 tree node has side effects. */
946 if ((flag_volatile_global && TREE_CODE (decl) == VAR_DECL
947 && TREE_PUBLIC (decl))
948 || ((flag_volatile_static && TREE_CODE (decl) == VAR_DECL
949 && (TREE_PUBLIC (decl) || TREE_STATIC (decl)))))
950 TREE_SIDE_EFFECTS (decl) = 1;
952 x = gen_rtx_MEM (DECL_MODE (decl), gen_rtx_SYMBOL_REF (Pmode, name));
953 SYMBOL_REF_WEAK (XEXP (x, 0)) = DECL_WEAK (decl);
954 if (TREE_CODE (decl) != FUNCTION_DECL)
955 set_mem_attributes (x, decl, 1);
956 SET_DECL_RTL (decl, x);
958 /* Optionally set flags or add text to the name to record information
959 such as that it is a function name.
960 If the name is changed, the macro ASM_OUTPUT_LABELREF
961 will have to know how to strip this information. */
962 (* targetm.encode_section_info) (decl, true);
965 /* Make the rtl for variable VAR be volatile.
966 Use this only for static variables. */
969 make_var_volatile (var)
972 if (GET_CODE (DECL_RTL (var)) != MEM)
975 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
978 /* Output alignment directive to align for constant expression EXP. */
981 assemble_constant_align (exp)
986 /* Align the location counter as required by EXP's data type. */
987 align = TYPE_ALIGN (TREE_TYPE (exp));
988 #ifdef CONSTANT_ALIGNMENT
989 align = CONSTANT_ALIGNMENT (exp, align);
992 if (align > BITS_PER_UNIT)
994 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
998 /* Output a string of literal assembler code
999 for an `asm' keyword used between functions. */
1002 assemble_asm (string)
1007 if (TREE_CODE (string) == ADDR_EXPR)
1008 string = TREE_OPERAND (string, 0);
1010 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
1013 /* Record an element in the table of global destructors. SYMBOL is
1014 a SYMBOL_REF of the function to be called; PRIORITY is a number
1015 between 0 and MAX_INIT_PRIORITY. */
1018 default_stabs_asm_out_destructor (symbol, priority)
1020 int priority ATTRIBUTE_UNUSED;
1022 /* Tell GNU LD that this is part of the static destructor set.
1023 This will work for any system that uses stabs, most usefully
1025 fprintf (asm_out_file, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
1026 assemble_name (asm_out_file, XSTR (symbol, 0));
1027 fputc ('\n', asm_out_file);
1031 default_named_section_asm_out_destructor (symbol, priority)
1035 const char *section = ".dtors";
1038 /* ??? This only works reliably with the GNU linker. */
1039 if (priority != DEFAULT_INIT_PRIORITY)
1041 sprintf (buf, ".dtors.%.5u",
1042 /* Invert the numbering so the linker puts us in the proper
1043 order; constructors are run from right to left, and the
1044 linker sorts in increasing order. */
1045 MAX_INIT_PRIORITY - priority);
1049 named_section_flags (section, SECTION_WRITE);
1050 assemble_align (POINTER_SIZE);
1051 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1054 #ifdef DTORS_SECTION_ASM_OP
1058 if (in_section != in_dtors)
1060 in_section = in_dtors;
1061 fputs (DTORS_SECTION_ASM_OP, asm_out_file);
1062 fputc ('\n', asm_out_file);
1067 default_dtor_section_asm_out_destructor (symbol, priority)
1069 int priority ATTRIBUTE_UNUSED;
1072 assemble_align (POINTER_SIZE);
1073 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1077 /* Likewise for global constructors. */
1080 default_stabs_asm_out_constructor (symbol, priority)
1082 int priority ATTRIBUTE_UNUSED;
1084 /* Tell GNU LD that this is part of the static destructor set.
1085 This will work for any system that uses stabs, most usefully
1087 fprintf (asm_out_file, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
1088 assemble_name (asm_out_file, XSTR (symbol, 0));
1089 fputc ('\n', asm_out_file);
1093 default_named_section_asm_out_constructor (symbol, priority)
1097 const char *section = ".ctors";
1100 /* ??? This only works reliably with the GNU linker. */
1101 if (priority != DEFAULT_INIT_PRIORITY)
1103 sprintf (buf, ".ctors.%.5u",
1104 /* Invert the numbering so the linker puts us in the proper
1105 order; constructors are run from right to left, and the
1106 linker sorts in increasing order. */
1107 MAX_INIT_PRIORITY - priority);
1111 named_section_flags (section, SECTION_WRITE);
1112 assemble_align (POINTER_SIZE);
1113 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1116 #ifdef CTORS_SECTION_ASM_OP
1120 if (in_section != in_ctors)
1122 in_section = in_ctors;
1123 fputs (CTORS_SECTION_ASM_OP, asm_out_file);
1124 fputc ('\n', asm_out_file);
1129 default_ctor_section_asm_out_constructor (symbol, priority)
1131 int priority ATTRIBUTE_UNUSED;
1134 assemble_align (POINTER_SIZE);
1135 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1139 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1140 a non-zero value if the constant pool should be output before the
1141 start of the function, or a zero value if the pool should output
1142 after the end of the function. The default is to put it before the
1145 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1146 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1149 /* Output assembler code for the constant pool of a function and associated
1150 with defining the name of the function. DECL describes the function.
1151 NAME is the function's name. For the constant pool, we use the current
1152 constant pool data. */
1155 assemble_start_function (decl, fnname)
1161 /* The following code does not need preprocessing in the assembler. */
1165 if (CONSTANT_POOL_BEFORE_FUNCTION)
1166 output_constant_pool (fnname, decl);
1168 resolve_unique_section (decl, 0, flag_function_sections);
1169 function_section (decl);
1171 /* Tell assembler to move to target machine's alignment for functions. */
1172 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1175 ASM_OUTPUT_ALIGN (asm_out_file, align);
1178 /* Handle a user-specified function alignment.
1179 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1180 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1181 if (align_functions_log > align
1182 && cfun->function_frequency != FUNCTION_FREQUENCY_UNLIKELY_EXECUTED)
1184 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1185 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file,
1186 align_functions_log, align_functions - 1);
1188 ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
1192 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1193 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
1196 (*debug_hooks->begin_function) (decl);
1198 /* Make function name accessible from other files, if appropriate. */
1200 if (TREE_PUBLIC (decl))
1202 if (! first_global_object_name)
1207 p = (* targetm.strip_name_encoding) (fnname);
1210 if (! DECL_WEAK (decl) && ! DECL_ONE_ONLY (decl))
1211 first_global_object_name = name;
1213 weak_global_object_name = name;
1216 globalize_decl (decl);
1218 maybe_assemble_visibility (decl);
1221 /* Do any machine/system dependent processing of the function name */
1222 #ifdef ASM_DECLARE_FUNCTION_NAME
1223 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
1225 /* Standard thing is just output label for the function. */
1226 ASM_OUTPUT_LABEL (asm_out_file, fnname);
1227 #endif /* ASM_DECLARE_FUNCTION_NAME */
1230 /* Output assembler code associated with defining the size of the
1231 function. DECL describes the function. NAME is the function's name. */
1234 assemble_end_function (decl, fnname)
1238 #ifdef ASM_DECLARE_FUNCTION_SIZE
1239 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1241 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1243 output_constant_pool (fnname, decl);
1244 function_section (decl); /* need to switch back */
1247 /* Output any constants which should appear after the function. */
1248 output_after_function_constants ();
1251 /* Assemble code to leave SIZE bytes of zeros. */
1254 assemble_zeros (size)
1257 /* Do no output if -fsyntax-only. */
1258 if (flag_syntax_only)
1261 #ifdef ASM_NO_SKIP_IN_TEXT
1262 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1263 so we must output 0s explicitly in the text section. */
1264 if (ASM_NO_SKIP_IN_TEXT && in_text_section ())
1267 for (i = 0; i < size; i++)
1268 assemble_integer (const0_rtx, 1, BITS_PER_UNIT, 1);
1273 ASM_OUTPUT_SKIP (asm_out_file, size);
1276 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1279 assemble_align (align)
1282 if (align > BITS_PER_UNIT)
1284 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1288 /* Assemble a string constant with the specified C string as contents. */
1291 assemble_string (p, size)
1298 /* If the string is very long, split it up. */
1302 int thissize = size - pos;
1303 if (thissize > maximum)
1306 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1314 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1315 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1316 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1318 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1319 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1320 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1322 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1323 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1327 #if defined ASM_OUTPUT_ALIGNED_BSS
1328 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1329 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1331 #if defined ASM_OUTPUT_BSS
1332 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1333 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1339 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1340 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1341 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1343 #if defined ASM_OUTPUT_ALIGNED_COMMON
1344 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1345 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1347 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1348 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1353 asm_emit_uninitialised (decl, name, size, rounded)
1356 int size ATTRIBUTE_UNUSED;
1357 int rounded ATTRIBUTE_UNUSED;
1365 destination = asm_dest_local;
1367 /* ??? We should handle .bss via select_section mechanisms rather than
1368 via special target hooks. That would eliminate this special case. */
1369 if (TREE_PUBLIC (decl))
1371 if (!DECL_COMMON (decl))
1373 destination = asm_dest_bss;
1378 destination = asm_dest_common;
1381 if (destination == asm_dest_bss)
1382 globalize_decl (decl);
1383 resolve_unique_section (decl, 0, flag_data_sections);
1385 if (flag_shared_data)
1387 switch (destination)
1389 #ifdef ASM_OUTPUT_SHARED_BSS
1391 ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded);
1394 #ifdef ASM_OUTPUT_SHARED_COMMON
1395 case asm_dest_common:
1396 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1399 #ifdef ASM_OUTPUT_SHARED_LOCAL
1400 case asm_dest_local:
1401 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1409 switch (destination)
1413 ASM_EMIT_BSS (decl, name, size, rounded);
1416 case asm_dest_common:
1417 ASM_EMIT_COMMON (decl, name, size, rounded);
1419 case asm_dest_local:
1420 ASM_EMIT_LOCAL (decl, name, size, rounded);
1429 /* Assemble everything that is needed for a variable or function declaration.
1430 Not used for automatic variables, and not used for function definitions.
1431 Should not be called for variables of incomplete structure type.
1433 TOP_LEVEL is nonzero if this variable has file scope.
1434 AT_END is nonzero if this is the special handling, at end of compilation,
1435 to define things that have had only tentative definitions.
1436 DONT_OUTPUT_DATA if nonzero means don't actually output the
1437 initial value (that will be done by the caller). */
1440 assemble_variable (decl, top_level, at_end, dont_output_data)
1442 int top_level ATTRIBUTE_UNUSED;
1443 int at_end ATTRIBUTE_UNUSED;
1444 int dont_output_data;
1451 last_assemble_variable_decl = 0;
1453 /* Normally no need to say anything here for external references,
1454 since assemble_external is called by the language-specific code
1455 when a declaration is first seen. */
1457 if (DECL_EXTERNAL (decl))
1460 /* Output no assembler code for a function declaration.
1461 Only definitions of functions output anything. */
1463 if (TREE_CODE (decl) == FUNCTION_DECL)
1466 /* Do nothing for global register variables. */
1467 if (DECL_RTL_SET_P (decl) && GET_CODE (DECL_RTL (decl)) == REG)
1469 TREE_ASM_WRITTEN (decl) = 1;
1473 /* If type was incomplete when the variable was declared,
1474 see if it is complete now. */
1476 if (DECL_SIZE (decl) == 0)
1477 layout_decl (decl, 0);
1479 /* Still incomplete => don't allocate it; treat the tentative defn
1480 (which is what it must have been) as an `extern' reference. */
1482 if (!dont_output_data && DECL_SIZE (decl) == 0)
1484 error_with_file_and_line (DECL_SOURCE_FILE (decl),
1485 DECL_SOURCE_LINE (decl),
1486 "storage size of `%s' isn't known",
1487 IDENTIFIER_POINTER (DECL_NAME (decl)));
1488 TREE_ASM_WRITTEN (decl) = 1;
1492 /* The first declaration of a variable that comes through this function
1493 decides whether it is global (in C, has external linkage)
1494 or local (in C, has internal linkage). So do nothing more
1495 if this function has already run. */
1497 if (TREE_ASM_WRITTEN (decl))
1500 /* Make sure targetm.encode_section_info is invoked before we set
1502 decl_rtl = DECL_RTL (decl);
1504 TREE_ASM_WRITTEN (decl) = 1;
1506 /* Do no output if -fsyntax-only. */
1507 if (flag_syntax_only)
1512 if (! dont_output_data
1513 && ! host_integerp (DECL_SIZE_UNIT (decl), 1))
1515 error_with_decl (decl, "size of variable `%s' is too large");
1519 name = XSTR (XEXP (decl_rtl, 0), 0);
1520 if (TREE_PUBLIC (decl) && DECL_NAME (decl)
1521 && ! first_global_object_name
1522 && ! (DECL_COMMON (decl) && (DECL_INITIAL (decl) == 0
1523 || DECL_INITIAL (decl) == error_mark_node))
1524 && ! DECL_WEAK (decl)
1525 && ! DECL_ONE_ONLY (decl))
1530 p = (* targetm.strip_name_encoding) (name);
1531 xname = xstrdup (p);
1532 first_global_object_name = xname;
1535 /* Compute the alignment of this data. */
1537 align = DECL_ALIGN (decl);
1539 /* In the case for initialing an array whose length isn't specified,
1540 where we have not yet been able to do the layout,
1541 figure out the proper alignment now. */
1542 if (dont_output_data && DECL_SIZE (decl) == 0
1543 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1544 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1546 /* Some object file formats have a maximum alignment which they support.
1547 In particular, a.out format supports a maximum alignment of 4. */
1548 #ifndef MAX_OFILE_ALIGNMENT
1549 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1551 if (align > MAX_OFILE_ALIGNMENT)
1553 warning_with_decl (decl,
1554 "alignment of `%s' is greater than maximum object file alignment. Using %d",
1555 MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
1556 align = MAX_OFILE_ALIGNMENT;
1559 /* On some machines, it is good to increase alignment sometimes. */
1560 if (! DECL_USER_ALIGN (decl))
1562 #ifdef DATA_ALIGNMENT
1563 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1565 #ifdef CONSTANT_ALIGNMENT
1566 if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node)
1567 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1571 /* Reset the alignment in case we have made it tighter, so we can benefit
1572 from it in get_pointer_alignment. */
1573 DECL_ALIGN (decl) = align;
1574 set_mem_align (decl_rtl, align);
1576 if (TREE_PUBLIC (decl))
1577 maybe_assemble_visibility (decl);
1579 /* Output any data that we will need to use the address of. */
1580 if (DECL_INITIAL (decl) == error_mark_node)
1581 reloc = contains_pointers_p (TREE_TYPE (decl)) ? 3 : 0;
1582 else if (DECL_INITIAL (decl))
1583 reloc = output_addressed_constants (DECL_INITIAL (decl));
1584 resolve_unique_section (decl, reloc, flag_data_sections);
1586 /* Handle uninitialized definitions. */
1588 /* If the decl has been given an explicit section name, then it
1589 isn't common, and shouldn't be handled as such. */
1590 if (DECL_SECTION_NAME (decl) || dont_output_data)
1592 /* We don't implement common thread-local data at present. */
1593 else if (DECL_THREAD_LOCAL (decl))
1595 if (DECL_COMMON (decl))
1596 sorry ("thread-local COMMON data not implemented");
1598 else if (DECL_INITIAL (decl) == 0
1599 || DECL_INITIAL (decl) == error_mark_node
1600 || (flag_zero_initialized_in_bss
1601 && initializer_zerop (DECL_INITIAL (decl))))
1603 unsigned HOST_WIDE_INT size = tree_low_cst (DECL_SIZE_UNIT (decl), 1);
1604 unsigned HOST_WIDE_INT rounded = size;
1606 /* Don't allocate zero bytes of common,
1607 since that means "undefined external" in the linker. */
1611 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1612 so that each uninitialized object starts on such a boundary. */
1613 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1614 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1615 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1617 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1618 if ((unsigned HOST_WIDE_INT) DECL_ALIGN (decl) / BITS_PER_UNIT > rounded)
1620 (decl, "requested alignment for %s is greater than implemented alignment of %d",rounded);
1623 /* If the target cannot output uninitialized but not common global data
1624 in .bss, then we have to use .data, so fall through. */
1625 if (asm_emit_uninitialised (decl, name, size, rounded))
1629 /* Handle initialized definitions.
1630 Also handle uninitialized global definitions if -fno-common and the
1631 target doesn't support ASM_OUTPUT_BSS. */
1633 /* First make the assembler name(s) global if appropriate. */
1634 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1635 globalize_decl (decl);
1637 /* Switch to the appropriate section. */
1638 variable_section (decl, reloc);
1640 /* dbxout.c needs to know this. */
1641 if (in_text_section ())
1642 DECL_IN_TEXT_SECTION (decl) = 1;
1644 /* Output the alignment of this data. */
1645 if (align > BITS_PER_UNIT)
1647 ASM_OUTPUT_ALIGN (asm_out_file,
1648 floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT));
1651 /* Do any machine/system dependent processing of the object. */
1652 #ifdef ASM_DECLARE_OBJECT_NAME
1653 last_assemble_variable_decl = decl;
1654 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1656 /* Standard thing is just output label for the object. */
1657 ASM_OUTPUT_LABEL (asm_out_file, name);
1658 #endif /* ASM_DECLARE_OBJECT_NAME */
1660 if (!dont_output_data)
1662 if (DECL_INITIAL (decl) && DECL_INITIAL (decl) != error_mark_node)
1663 /* Output the actual data. */
1664 output_constant (DECL_INITIAL (decl),
1665 tree_low_cst (DECL_SIZE_UNIT (decl), 1),
1668 /* Leave space for it. */
1669 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl), 1));
1673 /* Return 1 if type TYPE contains any pointers. */
1676 contains_pointers_p (type)
1679 switch (TREE_CODE (type))
1682 case REFERENCE_TYPE:
1683 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1684 so I'll play safe and return 1. */
1690 case QUAL_UNION_TYPE:
1693 /* For a type that has fields, see if the fields have pointers. */
1694 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1695 if (TREE_CODE (fields) == FIELD_DECL
1696 && contains_pointers_p (TREE_TYPE (fields)))
1702 /* An array type contains pointers if its element type does. */
1703 return contains_pointers_p (TREE_TYPE (type));
1710 /* Output something to declare an external symbol to the assembler.
1711 (Most assemblers don't need this, so we normally output nothing.)
1712 Do nothing if DECL is not external. */
1715 assemble_external (decl)
1716 tree decl ATTRIBUTE_UNUSED;
1718 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1719 main body of this code is only rarely exercised. To provide some
1720 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1721 open. If it's not, we should not be calling this function. */
1725 #ifdef ASM_OUTPUT_EXTERNAL
1726 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1728 rtx rtl = DECL_RTL (decl);
1730 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1731 && ! SYMBOL_REF_USED (XEXP (rtl, 0)))
1733 /* Some systems do require some output. */
1734 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1735 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1741 /* Similar, for calling a library function FUN. */
1744 assemble_external_libcall (fun)
1745 rtx fun ATTRIBUTE_UNUSED;
1747 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1748 /* Declare library function name external when first used, if nec. */
1749 if (! SYMBOL_REF_USED (fun))
1751 SYMBOL_REF_USED (fun) = 1;
1752 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun);
1757 /* Assemble a label named NAME. */
1760 assemble_label (name)
1763 ASM_OUTPUT_LABEL (asm_out_file, name);
1766 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1767 If NAME starts with a *, the rest of NAME is output verbatim.
1768 Otherwise NAME is transformed in an implementation-defined way
1769 (usually by the addition of an underscore).
1770 Many macros in the tm file are defined to call this function. */
1773 assemble_name (file, name)
1777 const char *real_name;
1780 real_name = (* targetm.strip_name_encoding) (name);
1782 id = maybe_get_identifier (real_name);
1784 TREE_SYMBOL_REFERENCED (id) = 1;
1787 fputs (&name[1], file);
1789 ASM_OUTPUT_LABELREF (file, name);
1792 /* Allocate SIZE bytes writable static space with a gensym name
1793 and return an RTX to refer to its address. */
1796 assemble_static_space (size)
1800 const char *namestring;
1804 if (flag_shared_data)
1808 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1810 namestring = ggc_strdup (name);
1812 x = gen_rtx_SYMBOL_REF (Pmode, namestring);
1814 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1815 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
1818 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1819 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1822 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1823 so that each uninitialized object starts on such a boundary. */
1824 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1825 int rounded ATTRIBUTE_UNUSED
1826 = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1827 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1828 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1829 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1836 /* Assemble the static constant template for function entry trampolines.
1837 This is done at most once per compilation.
1838 Returns an RTX for the address of the template. */
1840 #ifdef TRAMPOLINE_TEMPLATE
1842 assemble_trampoline_template ()
1848 /* By default, put trampoline templates in read-only data section. */
1850 #ifdef TRAMPOLINE_SECTION
1851 TRAMPOLINE_SECTION ();
1853 readonly_data_section ();
1856 /* Write the assembler code to define one. */
1857 align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
1860 ASM_OUTPUT_ALIGN (asm_out_file, align);
1863 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LTRAMP", 0);
1864 TRAMPOLINE_TEMPLATE (asm_out_file);
1866 /* Record the rtl to refer to it. */
1867 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1868 name = ggc_strdup (label);
1869 return gen_rtx_SYMBOL_REF (Pmode, name);
1873 /* A and B are either alignments or offsets. Return the minimum alignment
1874 that may be assumed after adding the two together. */
1876 static inline unsigned
1880 return (a | b) & -(a | b);
1883 /* Return the assembler directive for creating a given kind of integer
1884 object. SIZE is the number of bytes in the object and ALIGNED_P
1885 indicates whether it is known to be aligned. Return NULL if the
1886 assembly dialect has no such directive.
1888 The returned string should be printed at the start of a new line and
1889 be followed immediately by the object's initial value. */
1892 integer_asm_op (size, aligned_p)
1896 struct asm_int_op *ops;
1899 ops = &targetm.asm_out.aligned_op;
1901 ops = &targetm.asm_out.unaligned_op;
1906 return targetm.asm_out.byte_op;
1920 /* Use directive OP to assemble an integer object X. Print OP at the
1921 start of the line, followed immediately by the value of X. */
1924 assemble_integer_with_op (op, x)
1928 fputs (op, asm_out_file);
1929 output_addr_const (asm_out_file, x);
1930 fputc ('\n', asm_out_file);
1933 /* The default implementation of the asm_out.integer target hook. */
1936 default_assemble_integer (x, size, aligned_p)
1937 rtx x ATTRIBUTE_UNUSED;
1938 unsigned int size ATTRIBUTE_UNUSED;
1939 int aligned_p ATTRIBUTE_UNUSED;
1941 const char *op = integer_asm_op (size, aligned_p);
1942 return op && (assemble_integer_with_op (op, x), true);
1945 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1946 the alignment of the integer in bits. Return 1 if we were able to output
1947 the constant, otherwise 0. If FORCE is non-zero, abort if we can't output
1951 assemble_integer (x, size, align, force)
1959 aligned_p = (align >= MIN (size * BITS_PER_UNIT, BIGGEST_ALIGNMENT));
1961 /* See if the target hook can handle this kind of object. */
1962 if ((*targetm.asm_out.integer) (x, size, aligned_p))
1965 /* If the object is a multi-byte one, try splitting it up. Split
1966 it into words it if is multi-word, otherwise split it into bytes. */
1969 enum machine_mode omode, imode;
1970 unsigned int subalign;
1971 unsigned int subsize, i;
1973 subsize = size > UNITS_PER_WORD? UNITS_PER_WORD : 1;
1974 subalign = MIN (align, subsize * BITS_PER_UNIT);
1975 omode = mode_for_size (subsize * BITS_PER_UNIT, MODE_INT, 0);
1976 imode = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1978 for (i = 0; i < size; i += subsize)
1980 rtx partial = simplify_subreg (omode, x, imode, i);
1981 if (!partial || !assemble_integer (partial, subsize, subalign, 0))
1987 /* If we've printed some of it, but not all of it, there's no going
2000 assemble_real (d, mode, align)
2002 enum machine_mode mode;
2007 unsigned int nalign = min_align (align, 32);
2009 switch (BITS_PER_UNIT)
2015 REAL_VALUE_TO_TARGET_SINGLE (d, l);
2016 assemble_integer (GEN_INT (l), 4, align, 1);
2019 REAL_VALUE_TO_TARGET_DOUBLE (d, data);
2020 assemble_integer (GEN_INT (data[0]), 4, align, 1);
2021 assemble_integer (GEN_INT (data[1]), 4, nalign, 1);
2024 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d, data);
2025 assemble_integer (GEN_INT (data[0]), 4, align, 1);
2026 assemble_integer (GEN_INT (data[1]), 4, nalign, 1);
2027 assemble_integer (GEN_INT (data[2]), 4, nalign, 1);
2030 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d, data);
2031 assemble_integer (GEN_INT (data[0]), 4, align, 1);
2032 assemble_integer (GEN_INT (data[1]), 4, nalign, 1);
2033 assemble_integer (GEN_INT (data[2]), 4, nalign, 1);
2034 assemble_integer (GEN_INT (data[3]), 4, nalign, 1);
2045 REAL_VALUE_TO_TARGET_SINGLE (d, l);
2046 assemble_integer (GEN_INT (l), 2, align, 1);
2049 REAL_VALUE_TO_TARGET_DOUBLE (d, data);
2050 assemble_integer (GEN_INT (data[0]), 2, align, 1);
2051 assemble_integer (GEN_INT (data[1]), 1, nalign, 1);
2062 REAL_VALUE_TO_TARGET_SINGLE (d, l);
2063 assemble_integer (GEN_INT (l), 1, align, 1);
2066 REAL_VALUE_TO_TARGET_DOUBLE (d, data);
2067 assemble_integer (GEN_INT (data[0]), 1, align, 1);
2068 assemble_integer (GEN_INT (data[1]), 1, nalign, 1);
2080 /* Given an expression EXP with a constant value,
2081 reduce it to the sum of an assembler symbol and an integer.
2082 Store them both in the structure *VALUE.
2083 Abort if EXP does not reduce. */
2085 struct addr_const GTY(())
2088 HOST_WIDE_INT offset;
2092 decode_addr_const (exp, value)
2094 struct addr_const *value;
2096 tree target = TREE_OPERAND (exp, 0);
2102 if (TREE_CODE (target) == COMPONENT_REF
2103 && host_integerp (byte_position (TREE_OPERAND (target, 1)), 0))
2106 offset += int_byte_position (TREE_OPERAND (target, 1));
2107 target = TREE_OPERAND (target, 0);
2109 else if (TREE_CODE (target) == ARRAY_REF
2110 || TREE_CODE (target) == ARRAY_RANGE_REF)
2112 offset += (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target)), 1)
2113 * tree_low_cst (TREE_OPERAND (target, 1), 0));
2114 target = TREE_OPERAND (target, 0);
2120 switch (TREE_CODE (target))
2124 x = DECL_RTL (target);
2128 x = gen_rtx_MEM (FUNCTION_MODE,
2129 gen_rtx_LABEL_REF (VOIDmode,
2130 label_rtx (TREE_OPERAND (exp, 0))));
2138 /* This constant should have been output already, but we can't simply
2139 use TREE_CST_RTL since INTEGER_CST doesn't have one. */
2140 x = output_constant_def (target, 1);
2147 if (GET_CODE (x) != MEM)
2152 value->offset = offset;
2155 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2156 enum kind { RTX_UNKNOWN, RTX_DOUBLE, RTX_VECTOR, RTX_INT, RTX_UNSPEC };
2157 struct rtx_const GTY(())
2159 ENUM_BITFIELD(kind) kind : 16;
2160 ENUM_BITFIELD(machine_mode) mode : 16;
2161 union rtx_const_un {
2163 struct addr_const GTY ((tag ("1"))) addr;
2164 struct rtx_const_u_di {
2167 } GTY ((tag ("0"))) di;
2169 /* The max vector size we have is 8 wide. This should be enough. */
2170 HOST_WIDE_INT veclo[16];
2171 HOST_WIDE_INT vechi[16];
2172 } GTY ((desc ("%1.kind >= RTX_INT"), descbits ("1"))) un;
2175 /* Uniquize all constants that appear in memory.
2176 Each constant in memory thus far output is recorded
2177 in `const_hash_table'. */
2179 struct constant_descriptor_tree GTY(())
2181 /* More constant_descriptors with the same hash code. */
2182 struct constant_descriptor_tree *next;
2184 /* The label of the constant. */
2187 /* A MEM for the constant. */
2190 /* The value of the constant. */
2195 #define MAX_HASH_TABLE 1009
2196 static GTY(()) struct constant_descriptor_tree *
2197 const_hash_table[MAX_HASH_TABLE];
2199 /* We maintain a hash table of STRING_CST values. Unless we are asked to force
2200 out a string constant, we defer output of the constants until we know
2201 they are actually used. This will be if something takes its address or if
2202 there is a usage of the string in the RTL of a function. */
2204 #define STRHASH(x) ((hashval_t) ((long) (x) >> 3))
2206 struct deferred_string GTY(())
2213 static GTY ((param_is (struct deferred_string))) htab_t const_str_htab;
2215 /* Returns a hash code for X (which is a really a
2216 struct deferred_string *). */
2219 const_str_htab_hash (x)
2222 return STRHASH (((const struct deferred_string *) x)->label);
2225 /* Returns non-zero if the value represented by X (which is really a
2226 struct deferred_string *) is the same as that given by Y
2227 (which is really a char *). */
2230 const_str_htab_eq (x, y)
2234 return (((const struct deferred_string *) x)->label == (const char *) y);
2237 /* Compute a hash code for a constant expression. */
2245 enum tree_code code = TREE_CODE (exp);
2247 /* Either set P and LEN to the address and len of something to hash and
2248 exit the switch or return a value. */
2253 p = (char *) &TREE_INT_CST (exp);
2254 len = sizeof TREE_INT_CST (exp);
2258 p = (char *) &TREE_REAL_CST (exp);
2259 len = sizeof TREE_REAL_CST (exp);
2263 p = TREE_STRING_POINTER (exp);
2264 len = TREE_STRING_LENGTH (exp);
2268 return (const_hash (TREE_REALPART (exp)) * 5
2269 + const_hash (TREE_IMAGPART (exp)));
2272 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2276 len = int_size_in_bytes (TREE_TYPE (exp));
2277 tmp = (char *) alloca (len);
2278 get_set_constructor_bytes (exp, (unsigned char *) tmp, len);
2286 /* For record type, include the type in the hashing.
2287 We do not do so for array types
2288 because (1) the sizes of the elements are sufficient
2289 and (2) distinct array types can have the same constructor.
2290 Instead, we include the array size because the constructor could
2292 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2293 hi = ((unsigned long) TREE_TYPE (exp) & ((1 << HASHBITS) - 1))
2296 hi = ((5 + int_size_in_bytes (TREE_TYPE (exp)))
2297 & ((1 << HASHBITS) - 1)) % MAX_HASH_TABLE;
2299 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2300 if (TREE_VALUE (link))
2302 = (hi * 603 + const_hash (TREE_VALUE (link))) % MAX_HASH_TABLE;
2310 struct addr_const value;
2312 decode_addr_const (exp, &value);
2313 if (GET_CODE (value.base) == SYMBOL_REF)
2315 /* Don't hash the address of the SYMBOL_REF;
2316 only use the offset and the symbol name. */
2318 p = XSTR (value.base, 0);
2319 for (i = 0; p[i] != 0; i++)
2320 hi = ((hi * 613) + (unsigned) (p[i]));
2322 else if (GET_CODE (value.base) == LABEL_REF)
2323 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2327 hi &= (1 << HASHBITS) - 1;
2328 hi %= MAX_HASH_TABLE;
2334 return (const_hash (TREE_OPERAND (exp, 0)) * 9
2335 + const_hash (TREE_OPERAND (exp, 1)));
2339 case NON_LVALUE_EXPR:
2340 return const_hash (TREE_OPERAND (exp, 0)) * 7 + 2;
2343 /* A language specific constant. Just hash the code. */
2344 return (int) code % MAX_HASH_TABLE;
2347 /* Compute hashing function */
2349 for (i = 0; i < len; i++)
2350 hi = ((hi * 613) + (unsigned) (p[i]));
2352 hi &= (1 << HASHBITS) - 1;
2353 hi %= MAX_HASH_TABLE;
2357 /* Compare t1 and t2, and return 1 only if they are known to result in
2358 the same bit pattern on output. */
2361 compare_constant (t1, t2)
2365 enum tree_code typecode;
2367 if (t1 == NULL_TREE)
2368 return t2 == NULL_TREE;
2369 if (t2 == NULL_TREE)
2372 if (TREE_CODE (t1) != TREE_CODE (t2))
2375 switch (TREE_CODE (t1))
2378 /* Integer constants are the same only if the same width of type. */
2379 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2381 return tree_int_cst_equal (t1, t2);
2384 /* Real constants are the same only if the same width of type. */
2385 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2388 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
2391 if (flag_writable_strings)
2394 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2)))
2397 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
2398 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
2399 TREE_STRING_LENGTH (t1)));
2402 return (compare_constant (TREE_REALPART (t1), TREE_REALPART (t2))
2403 && compare_constant (TREE_IMAGPART (t1), TREE_IMAGPART (t2)));
2406 typecode = TREE_CODE (TREE_TYPE (t1));
2407 if (typecode != TREE_CODE (TREE_TYPE (t2)))
2410 if (typecode == SET_TYPE)
2412 int len = int_size_in_bytes (TREE_TYPE (t2));
2413 unsigned char *tmp1, *tmp2;
2415 if (int_size_in_bytes (TREE_TYPE (t1)) != len)
2418 tmp1 = (unsigned char *) alloca (len);
2419 tmp2 = (unsigned char *) alloca (len);
2421 if (get_set_constructor_bytes (t1, tmp1, len) != NULL_TREE)
2423 if (get_set_constructor_bytes (t2, tmp2, len) != NULL_TREE)
2426 return memcmp (tmp1, tmp2, len) != 0;
2432 if (typecode == ARRAY_TYPE)
2434 HOST_WIDE_INT size_1 = int_size_in_bytes (TREE_TYPE (t1));
2435 /* For arrays, check that the sizes all match. */
2436 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2))
2438 || size_1 != int_size_in_bytes (TREE_TYPE (t2)))
2443 /* For record and union constructors, require exact type
2445 if (TREE_TYPE (t1) != TREE_TYPE (t2))
2449 for (l1 = CONSTRUCTOR_ELTS (t1), l2 = CONSTRUCTOR_ELTS (t2);
2451 l1 = TREE_CHAIN (l1), l2 = TREE_CHAIN (l2))
2453 /* Check that each value is the same... */
2454 if (! compare_constant (TREE_VALUE (l1), TREE_VALUE (l2)))
2456 /* ... and that they apply to the same fields! */
2457 if (typecode == ARRAY_TYPE)
2459 if (! compare_constant (TREE_PURPOSE (l1),
2465 if (TREE_PURPOSE (l1) != TREE_PURPOSE (l2))
2470 return l1 == NULL_TREE && l2 == NULL_TREE;
2476 struct addr_const value1, value2;
2478 decode_addr_const (t1, &value1);
2479 decode_addr_const (t2, &value2);
2480 return (value1.offset == value2.offset
2481 && strcmp (XSTR (value1.base, 0), XSTR (value2.base, 0)) == 0);
2487 return (compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))
2488 && compare_constant(TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)));
2492 case NON_LVALUE_EXPR:
2493 return compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2498 nt1 = (*lang_hooks.expand_constant) (t1);
2499 nt2 = (*lang_hooks.expand_constant) (t2);
2500 if (nt1 != t1 || nt2 != t2)
2501 return compare_constant (nt1, nt2);
2507 /* Should not get here. */
2511 /* Record a list of constant expressions that were passed to
2512 output_constant_def but that could not be output right away. */
2514 struct deferred_constant
2516 struct deferred_constant *next;
2522 static struct deferred_constant *deferred_constants;
2524 /* Another list of constants which should be output after the
2526 static struct deferred_constant *after_function_constants;
2528 /* Nonzero means defer output of addressed subconstants
2529 (i.e., those for which output_constant_def is called.) */
2530 static int defer_addressed_constants_flag;
2532 /* Start deferring output of subconstants. */
2535 defer_addressed_constants ()
2537 defer_addressed_constants_flag++;
2540 /* Stop deferring output of subconstants,
2541 and output now all those that have been deferred. */
2544 output_deferred_addressed_constants ()
2546 struct deferred_constant *p, *next;
2548 defer_addressed_constants_flag--;
2550 if (defer_addressed_constants_flag > 0)
2553 for (p = deferred_constants; p; p = next)
2555 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2560 deferred_constants = 0;
2563 /* Output any constants which should appear after a function. */
2566 output_after_function_constants ()
2568 struct deferred_constant *p, *next;
2570 for (p = after_function_constants; p; p = next)
2572 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2577 after_function_constants = 0;
2580 /* Make a copy of the whole tree structure for a constant. This
2581 handles the same types of nodes that compare_constant handles. */
2587 switch (TREE_CODE (exp))
2590 /* For ADDR_EXPR, we do not want to copy the decl whose address
2591 is requested. We do want to copy constants though. */
2592 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c')
2593 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2594 copy_constant (TREE_OPERAND (exp, 0)));
2596 return copy_node (exp);
2601 return copy_node (exp);
2604 return build_complex (TREE_TYPE (exp),
2605 copy_constant (TREE_REALPART (exp)),
2606 copy_constant (TREE_IMAGPART (exp)));
2610 return build (TREE_CODE (exp), TREE_TYPE (exp),
2611 copy_constant (TREE_OPERAND (exp, 0)),
2612 copy_constant (TREE_OPERAND (exp, 1)));
2616 case NON_LVALUE_EXPR:
2617 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2618 copy_constant (TREE_OPERAND (exp, 0)));
2622 tree copy = copy_node (exp);
2623 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2626 CONSTRUCTOR_ELTS (copy) = list;
2627 for (tail = list; tail; tail = TREE_CHAIN (tail))
2628 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2629 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2630 for (tail = list; tail; tail = TREE_CHAIN (tail))
2631 TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail));
2639 t = (*lang_hooks.expand_constant) (exp);
2641 return copy_constant (t);
2648 /* Return an rtx representing a reference to constant data in memory
2649 for the constant expression EXP.
2651 If assembler code for such a constant has already been output,
2652 return an rtx to refer to it.
2653 Otherwise, output such a constant in memory (or defer it for later)
2654 and generate an rtx for it.
2656 If DEFER is non-zero, the output of string constants can be deferred
2657 and output only if referenced in the function after all optimizations.
2659 The TREE_CST_RTL of EXP is set up to point to that rtx.
2660 The const_hash_table records which constants already have label strings. */
2663 output_constant_def (exp, defer)
2668 struct constant_descriptor_tree *desc;
2669 struct deferred_string **defstr;
2673 int after_function = 0;
2677 /* We can't just use the saved RTL if this is a deferred string constant
2678 and we are not to defer anymore. */
2679 if (TREE_CODE (exp) != INTEGER_CST && TREE_CST_RTL (exp)
2680 && (defer || !STRING_POOL_ADDRESS_P (XEXP (TREE_CST_RTL (exp), 0))))
2681 return TREE_CST_RTL (exp);
2683 /* Make sure any other constants whose addresses appear in EXP
2684 are assigned label numbers. */
2686 reloc = output_addressed_constants (exp);
2688 /* Compute hash code of EXP. Search the descriptors for that hash code
2689 to see if any of them describes EXP. If yes, the descriptor records
2690 the label number already assigned. */
2692 hash = const_hash (exp) % MAX_HASH_TABLE;
2694 for (desc = const_hash_table[hash]; desc; desc = desc->next)
2695 if (compare_constant (exp, desc->value))
2700 /* No constant equal to EXP is known to have been output.
2701 Make a constant descriptor to enter EXP in the hash table.
2702 Assign the label number and record it in the descriptor for
2703 future calls to this function to find. */
2705 /* Create a string containing the label name, in LABEL. */
2706 labelno = const_labelno++;
2707 ASM_GENERATE_INTERNAL_LABEL (label, "LC", labelno);
2709 desc = ggc_alloc (sizeof (*desc));
2710 desc->next = const_hash_table[hash];
2711 desc->label = ggc_strdup (label);
2712 desc->value = copy_constant (exp);
2713 const_hash_table[hash] = desc;
2715 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2717 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)),
2718 gen_rtx_SYMBOL_REF (Pmode, desc->label));
2720 set_mem_attributes (rtl, exp, 1);
2721 set_mem_alias_set (rtl, 0);
2722 set_mem_alias_set (rtl, const_alias_set);
2729 if (TREE_CODE (exp) != INTEGER_CST)
2730 TREE_CST_RTL (exp) = rtl;
2732 /* Optionally set flags or add text to the name to record information
2733 such as that it is a function name. If the name is changed, the macro
2734 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2735 /* A previously-processed constant would already have section info
2739 /* Take care not to invoke targetm.encode_section_info for
2740 constants which don't have a TREE_CST_RTL. */
2741 if (TREE_CODE (exp) != INTEGER_CST)
2742 (*targetm.encode_section_info) (exp, true);
2745 desc->label = XSTR (XEXP (desc->rtl, 0), 0);
2748 #ifdef CONSTANT_AFTER_FUNCTION_P
2749 if (current_function_decl != 0
2750 && CONSTANT_AFTER_FUNCTION_P (exp))
2755 && STRING_POOL_ADDRESS_P (XEXP (rtl, 0))
2756 && (!defer || defer_addressed_constants_flag || after_function))
2758 defstr = (struct deferred_string **)
2759 htab_find_slot_with_hash (const_str_htab, desc->label,
2760 STRHASH (desc->label), NO_INSERT);
2763 /* If the string is currently deferred but we need to output it now,
2764 remove it from deferred string hash table. */
2766 labelno = (*defstr)->labelno;
2767 STRING_POOL_ADDRESS_P (XEXP (rtl, 0)) = 0;
2768 htab_clear_slot (const_str_htab, (void **) defstr);
2772 /* If this is the first time we've seen this particular constant,
2773 output it (or defer its output for later). */
2776 if (defer_addressed_constants_flag || after_function)
2778 struct deferred_constant *p
2779 = (struct deferred_constant *)
2780 xmalloc (sizeof (struct deferred_constant));
2782 p->exp = desc->value;
2784 p->labelno = labelno;
2787 p->next = after_function_constants;
2788 after_function_constants = p;
2792 p->next = deferred_constants;
2793 deferred_constants = p;
2798 /* Do no output if -fsyntax-only. */
2799 if (! flag_syntax_only)
2801 if (TREE_CODE (exp) != STRING_CST
2803 || flag_writable_strings
2804 || (defstr = (struct deferred_string **)
2805 htab_find_slot_with_hash (const_str_htab,
2807 STRHASH (desc->label),
2809 output_constant_def_contents (exp, reloc, labelno);
2812 struct deferred_string *p;
2814 p = (struct deferred_string *)
2815 ggc_alloc (sizeof (struct deferred_string));
2817 p->exp = desc->value;
2818 p->label = desc->label;
2819 p->labelno = labelno;
2821 STRING_POOL_ADDRESS_P (XEXP (rtl, 0)) = 1;
2830 /* Now output assembler code to define the label for EXP,
2831 and follow it with the data of EXP. */
2834 output_constant_def_contents (exp, reloc, labelno)
2841 /* Align the location counter as required by EXP's data type. */
2842 align = TYPE_ALIGN (TREE_TYPE (exp));
2843 #ifdef CONSTANT_ALIGNMENT
2844 align = CONSTANT_ALIGNMENT (exp, align);
2847 if (IN_NAMED_SECTION (exp))
2848 named_section (exp, NULL, reloc);
2850 (*targetm.asm_out.select_section) (exp, reloc, align);
2852 if (align > BITS_PER_UNIT)
2854 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2857 /* Output the label itself. */
2858 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", labelno);
2860 /* Output the value of EXP. */
2861 output_constant (exp,
2862 (TREE_CODE (exp) == STRING_CST
2863 ? MAX (TREE_STRING_LENGTH (exp),
2864 int_size_in_bytes (TREE_TYPE (exp)))
2865 : int_size_in_bytes (TREE_TYPE (exp))),
2870 /* Used in the hash tables to avoid outputting the same constant
2871 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2872 are output once per function, not once per file; there seems
2873 to be no reason for the difference. */
2875 struct constant_descriptor_rtx GTY(())
2877 /* More constant_descriptors with the same hash code. */
2878 struct constant_descriptor_rtx *next;
2880 /* The label of the constant. */
2883 /* A MEM for the constant. */
2886 /* The value of the constant. */
2887 struct rtx_const value;
2890 /* Structure to represent sufficient information about a constant so that
2891 it can be output when the constant pool is output, so that function
2892 integration can be done, and to simplify handling on machines that reference
2893 constant pool as base+displacement. */
2895 struct pool_constant GTY(())
2897 struct constant_descriptor_rtx *desc;
2898 struct pool_constant *next;
2899 struct pool_constant *next_sym;
2901 enum machine_mode mode;
2904 HOST_WIDE_INT offset;
2908 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2909 The argument is XSTR (... , 0) */
2911 #define SYMHASH(LABEL) \
2912 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
2914 /* Initialize constant pool hashing for a new function. */
2917 init_varasm_status (f)
2920 struct varasm_status *p;
2921 p = (struct varasm_status *) ggc_alloc (sizeof (struct varasm_status));
2923 p->x_const_rtx_hash_table
2924 = ((struct constant_descriptor_rtx **)
2925 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2926 * sizeof (struct constant_descriptor_rtx *)));
2927 p->x_const_rtx_sym_hash_table
2928 = ((struct pool_constant **)
2929 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2930 * sizeof (struct pool_constant *)));
2932 p->x_first_pool = p->x_last_pool = 0;
2933 p->x_pool_offset = 0;
2937 /* Express an rtx for a constant integer (perhaps symbolic)
2938 as the sum of a symbol or label plus an explicit integer.
2939 They are stored into VALUE. */
2942 decode_rtx_const (mode, x, value)
2943 enum machine_mode mode;
2945 struct rtx_const *value;
2947 /* Clear the whole structure, including any gaps. */
2948 memset (value, 0, sizeof (struct rtx_const));
2950 value->kind = RTX_INT; /* Most usual kind. */
2953 switch (GET_CODE (x))
2956 value->kind = RTX_DOUBLE;
2957 if (GET_MODE (x) != VOIDmode)
2959 value->mode = GET_MODE (x);
2960 REAL_VALUE_FROM_CONST_DOUBLE (value->un.du, x);
2964 value->un.di.low = CONST_DOUBLE_LOW (x);
2965 value->un.di.high = CONST_DOUBLE_HIGH (x);
2974 units = CONST_VECTOR_NUNITS (x);
2975 value->kind = RTX_VECTOR;
2978 for (i = 0; i < units; ++i)
2980 elt = CONST_VECTOR_ELT (x, i);
2981 if (GET_MODE_CLASS (mode) == MODE_VECTOR_INT)
2983 value->un.veclo[i] = (HOST_WIDE_INT) INTVAL (elt);
2984 value->un.vechi[i] = 0;
2986 else if (GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
2988 value->un.veclo[i] = (HOST_WIDE_INT) CONST_DOUBLE_LOW (elt);
2989 value->un.vechi[i] = (HOST_WIDE_INT) CONST_DOUBLE_HIGH (elt);
2998 value->un.addr.offset = INTVAL (x);
3004 value->un.addr.base = x;
3009 if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 1)) == CONST_INT)
3011 value->un.addr.base = XEXP (x, 0);
3012 value->un.addr.offset = INTVAL (XEXP (x, 1));
3014 else if (GET_CODE (x) == MINUS && GET_CODE (XEXP (x, 1)) == CONST_INT)
3016 value->un.addr.base = XEXP (x, 0);
3017 value->un.addr.offset = - INTVAL (XEXP (x, 1));
3021 value->un.addr.base = x;
3022 value->un.addr.offset = 0;
3027 value->kind = RTX_UNKNOWN;
3031 if (value->kind == RTX_INT && value->un.addr.base != 0
3032 && GET_CODE (value->un.addr.base) == UNSPEC)
3034 /* For a simple UNSPEC, the base is set to the
3035 operand, the kind field is set to the index of
3036 the unspec expression.
3037 Together with the code below, in case that
3038 the operand is a SYMBOL_REF or LABEL_REF,
3039 the address of the string or the code_label
3040 is taken as base. */
3041 if (XVECLEN (value->un.addr.base, 0) == 1)
3043 value->kind = RTX_UNSPEC + XINT (value->un.addr.base, 1);
3044 value->un.addr.base = XVECEXP (value->un.addr.base, 0, 0);
3048 if (value->kind > RTX_DOUBLE && value->un.addr.base != 0)
3049 switch (GET_CODE (value->un.addr.base))
3053 /* Use the string's address, not the SYMBOL_REF's address,
3054 for the sake of addresses of library routines. */
3055 value->un.addr.base = (rtx) XSTR (value->un.addr.base, 0);
3060 /* For a LABEL_REF, compare labels. */
3061 value->un.addr.base = XEXP (value->un.addr.base, 0);
3068 /* Given a MINUS expression, simplify it if both sides
3069 include the same symbol. */
3072 simplify_subtraction (x)
3075 struct rtx_const val0, val1;
3077 decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0);
3078 decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1);
3080 if (val0.kind > RTX_DOUBLE
3081 && val0.kind == val1.kind
3082 && val0.un.addr.base == val1.un.addr.base)
3083 return GEN_INT (val0.un.addr.offset - val1.un.addr.offset);
3088 /* Compute a hash code for a constant RTL expression. */
3091 const_hash_rtx (mode, x)
3092 enum machine_mode mode;
3098 struct rtx_const value;
3099 decode_rtx_const (mode, x, &value);
3101 /* Compute hashing function */
3103 for (i = 0; i < sizeof value / sizeof (int); i++)
3104 hi += ((int *) &value)[i];
3106 hi &= (1 << HASHBITS) - 1;
3107 hi %= MAX_RTX_HASH_TABLE;
3111 /* Compare a constant rtl object X with a constant-descriptor DESC.
3112 Return 1 if DESC describes a constant with the same value as X. */
3115 compare_constant_rtx (mode, x, desc)
3116 enum machine_mode mode;
3118 struct constant_descriptor_rtx *desc;
3120 struct rtx_const value;
3122 decode_rtx_const (mode, x, &value);
3124 /* Compare constant contents. */
3125 return memcmp (&value, &desc->value, sizeof (struct rtx_const)) == 0;
3128 /* Construct a constant descriptor for the rtl-expression X.
3129 It is up to the caller to enter the descriptor in the hash table. */
3131 static struct constant_descriptor_rtx *
3132 record_constant_rtx (mode, x)
3133 enum machine_mode mode;
3136 struct constant_descriptor_rtx *ptr;
3138 ptr = (struct constant_descriptor_rtx *) ggc_alloc (sizeof (*ptr));
3139 decode_rtx_const (mode, x, &ptr->value);
3144 /* Given a constant rtx X, return a MEM for the location in memory at which
3145 this constant has been placed. Return 0 if it not has been placed yet. */
3148 mem_for_const_double (x)
3151 enum machine_mode mode = GET_MODE (x);
3152 struct constant_descriptor_rtx *desc;
3154 for (desc = const_rtx_hash_table[const_hash_rtx (mode, x)]; desc;
3156 if (compare_constant_rtx (mode, x, desc))
3162 /* Given a constant rtx X, make (or find) a memory constant for its value
3163 and return a MEM rtx to refer to it in memory. */
3166 force_const_mem (mode, x)
3167 enum machine_mode mode;
3171 struct constant_descriptor_rtx *desc;
3174 struct pool_constant *pool;
3177 /* Compute hash code of X. Search the descriptors for that hash code
3178 to see if any of them describes X. If yes, we have an rtx to use. */
3179 hash = const_hash_rtx (mode, x);
3180 for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next)
3181 if (compare_constant_rtx (mode, x, desc))
3184 /* No constant equal to X is known to have been output.
3185 Make a constant descriptor to enter X in the hash table
3186 and make a MEM for it. */
3187 desc = record_constant_rtx (mode, x);
3188 desc->next = const_rtx_hash_table[hash];
3189 const_rtx_hash_table[hash] = desc;
3191 /* Align the location counter as required by EXP's data type. */
3192 align = GET_MODE_ALIGNMENT (mode == VOIDmode ? word_mode : mode);
3193 #ifdef CONSTANT_ALIGNMENT
3194 align = CONSTANT_ALIGNMENT (make_tree ((*lang_hooks.types.type_for_mode)
3195 (mode, 0), x), align);
3198 pool_offset += (align / BITS_PER_UNIT) - 1;
3199 pool_offset &= ~ ((align / BITS_PER_UNIT) - 1);
3201 if (GET_CODE (x) == LABEL_REF)
3202 LABEL_PRESERVE_P (XEXP (x, 0)) = 1;
3204 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3205 pool = (struct pool_constant *) ggc_alloc (sizeof (struct pool_constant));
3209 pool->labelno = const_labelno;
3210 pool->align = align;
3211 pool->offset = pool_offset;
3218 last_pool->next = pool;
3221 pool_offset += GET_MODE_SIZE (mode);
3223 /* Create a string containing the label name, in LABEL. */
3224 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3228 /* Construct the SYMBOL_REF and the MEM. */
3230 pool->desc->rtl = def
3231 = gen_rtx_MEM (mode, gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label)));
3232 set_mem_alias_set (def, const_alias_set);
3233 set_mem_attributes (def, (*lang_hooks.types.type_for_mode) (mode, 0), 1);
3234 RTX_UNCHANGING_P (def) = 1;
3236 /* Add label to symbol hash table. */
3237 hash = SYMHASH (XSTR (XEXP (def, 0), 0));
3238 pool->next_sym = const_rtx_sym_hash_table[hash];
3239 const_rtx_sym_hash_table[hash] = pool;
3241 /* Mark the symbol_ref as belonging to this constants pool. */
3242 CONSTANT_POOL_ADDRESS_P (XEXP (def, 0)) = 1;
3243 current_function_uses_const_pool = 1;
3248 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3249 the corresponding pool_constant structure. */
3251 static struct pool_constant *
3252 find_pool_constant (f, addr)
3256 struct pool_constant *pool;
3257 const char *label = XSTR (addr, 0);
3259 for (pool = f->varasm->x_const_rtx_sym_hash_table[SYMHASH (label)]; pool;
3260 pool = pool->next_sym)
3261 if (XSTR (XEXP (pool->desc->rtl, 0), 0) == label)
3267 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3270 get_pool_constant (addr)
3273 return (find_pool_constant (cfun, addr))->constant;
3276 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3277 and whether it has been output or not. */
3280 get_pool_constant_mark (addr, pmarked)
3284 struct pool_constant *pool = find_pool_constant (cfun, addr);
3285 *pmarked = (pool->mark != 0);
3286 return pool->constant;
3289 /* Likewise, but for the constant pool of a specific function. */
3292 get_pool_constant_for_function (f, addr)
3296 return (find_pool_constant (f, addr))->constant;
3299 /* Similar, return the mode. */
3302 get_pool_mode (addr)
3305 return (find_pool_constant (cfun, addr))->mode;
3309 get_pool_mode_for_function (f, addr)
3313 return (find_pool_constant (f, addr))->mode;
3316 /* Similar, return the offset in the constant pool. */
3319 get_pool_offset (addr)
3322 return (find_pool_constant (cfun, addr))->offset;
3325 /* Return the size of the constant pool. */
3333 /* Write all the constants in the constant pool. */
3336 output_constant_pool (fnname, fndecl)
3337 const char *fnname ATTRIBUTE_UNUSED;
3338 tree fndecl ATTRIBUTE_UNUSED;
3340 struct pool_constant *pool;
3344 /* It is possible for gcc to call force_const_mem and then to later
3345 discard the instructions which refer to the constant. In such a
3346 case we do not need to output the constant. */
3347 mark_constant_pool ();
3349 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3350 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset);
3353 for (pool = first_pool; pool; pool = pool->next)
3362 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3363 whose CODE_LABEL has been deleted. This can occur if a jump table
3364 is eliminated by optimization. If so, write a constant of zero
3365 instead. Note that this can also happen by turning the
3366 CODE_LABEL into a NOTE. */
3367 /* ??? This seems completely and utterly wrong. Certainly it's
3368 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3369 functioning even with INSN_DELETED_P and friends. */
3372 switch (GET_CODE (x))
3375 if (GET_CODE (XEXP (x, 0)) != PLUS
3376 || GET_CODE (XEXP (XEXP (x, 0), 0)) != LABEL_REF)
3378 tmp = XEXP (XEXP (x, 0), 0);
3383 if (INSN_DELETED_P (tmp)
3384 || (GET_CODE (tmp) == NOTE
3385 && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_DELETED))
3396 /* First switch to correct section. */
3397 (*targetm.asm_out.select_rtx_section) (pool->mode, x, pool->align);
3399 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3400 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode,
3401 pool->align, pool->labelno, done);
3404 assemble_align (pool->align);
3406 /* Output the label. */
3407 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", pool->labelno);
3409 /* Output the value of the constant itself. */
3410 switch (GET_MODE_CLASS (pool->mode))
3413 if (GET_CODE (x) != CONST_DOUBLE)
3416 REAL_VALUE_FROM_CONST_DOUBLE (r, x);
3417 assemble_real (r, pool->mode, pool->align);
3421 case MODE_PARTIAL_INT:
3422 assemble_integer (x, GET_MODE_SIZE (pool->mode), pool->align, 1);
3425 case MODE_VECTOR_FLOAT:
3430 if (GET_CODE (x) != CONST_VECTOR)
3433 units = CONST_VECTOR_NUNITS (x);
3435 for (i = 0; i < units; i++)
3437 elt = CONST_VECTOR_ELT (x, i);
3438 REAL_VALUE_FROM_CONST_DOUBLE (r, elt);
3439 assemble_real (r, GET_MODE_INNER (pool->mode), pool->align);
3444 case MODE_VECTOR_INT:
3449 if (GET_CODE (x) != CONST_VECTOR)
3452 units = CONST_VECTOR_NUNITS (x);
3454 for (i = 0; i < units; i++)
3456 elt = CONST_VECTOR_ELT (x, i);
3457 assemble_integer (elt, GET_MODE_UNIT_SIZE (pool->mode),
3467 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3472 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3473 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool_offset);
3476 /* Done with this pool. */
3477 first_pool = last_pool = 0;
3480 /* Look through the instructions for this function, and mark all the
3481 entries in the constant pool which are actually being used.
3482 Emit used deferred strings. */
3485 mark_constant_pool ()
3489 struct pool_constant *pool;
3491 if (first_pool == 0 && htab_elements (const_str_htab) == 0)
3494 for (pool = first_pool; pool; pool = pool->next)
3497 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3499 mark_constants (PATTERN (insn));
3501 for (link = current_function_epilogue_delay_list;
3503 link = XEXP (link, 1))
3505 insn = XEXP (link, 0);
3508 mark_constants (PATTERN (insn));
3512 /* Look through appropriate parts of X, marking all entries in the
3513 constant pool which are actually being used. Entries that are only
3514 referenced by other constants are also marked as used. Emit
3515 deferred strings that are used. */
3522 const char *format_ptr;
3527 if (GET_CODE (x) == SYMBOL_REF)
3529 mark_constant (&x, NULL);
3533 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3534 insns, not any notes that may be attached. We don't want to mark
3535 a constant just because it happens to appear in a REG_EQUIV note. */
3538 mark_constants (PATTERN (x));
3542 format_ptr = GET_RTX_FORMAT (GET_CODE (x));
3544 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (x)); i++)
3546 switch (*format_ptr++)
3549 mark_constants (XEXP (x, i));
3553 if (XVEC (x, i) != 0)
3557 for (j = 0; j < XVECLEN (x, i); j++)
3558 mark_constants (XVECEXP (x, i, j));
3578 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3579 to as used. Emit referenced deferred strings. This function can
3580 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3583 mark_constant (current_rtx, data)
3585 void *data ATTRIBUTE_UNUSED;
3587 rtx x = *current_rtx;
3592 else if (GET_CODE (x) == SYMBOL_REF)
3594 if (CONSTANT_POOL_ADDRESS_P (x))
3596 struct pool_constant *pool = find_pool_constant (cfun, x);
3597 if (pool->mark == 0)
3600 for_each_rtx (&(pool->constant), &mark_constant, NULL);
3605 else if (STRING_POOL_ADDRESS_P (x))
3607 struct deferred_string **defstr;
3609 defstr = (struct deferred_string **)
3610 htab_find_slot_with_hash (const_str_htab, XSTR (x, 0),
3611 STRHASH (XSTR (x, 0)), NO_INSERT);
3614 struct deferred_string *p = *defstr;
3616 STRING_POOL_ADDRESS_P (x) = 0;
3617 output_constant_def_contents (p->exp, 0, p->labelno);
3618 htab_clear_slot (const_str_htab, (void **) defstr);
3625 /* Find all the constants whose addresses are referenced inside of EXP,
3626 and make sure assembler code with a label has been output for each one.
3627 Indicate whether an ADDR_EXPR has been encountered. */
3630 output_addressed_constants (exp)
3636 /* Give the front-end a chance to convert VALUE to something that
3637 looks more like a constant to the back-end. */
3638 exp = (*lang_hooks.expand_constant) (exp);
3640 switch (TREE_CODE (exp))
3644 /* Go inside any operations that get_inner_reference can handle and see
3645 if what's inside is a constant: no need to do anything here for
3646 addresses of variables or functions. */
3647 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
3648 tem = TREE_OPERAND (tem, 0))
3651 if (TREE_CODE_CLASS (TREE_CODE (tem)) == 'c'
3652 || TREE_CODE (tem) == CONSTRUCTOR)
3653 output_constant_def (tem, 0);
3655 if (TREE_PUBLIC (tem))
3663 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3664 reloc |= output_addressed_constants (TREE_OPERAND (exp, 1));
3669 case NON_LVALUE_EXPR:
3670 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3674 for (tem = CONSTRUCTOR_ELTS (exp); tem; tem = TREE_CHAIN (tem))
3675 if (TREE_VALUE (tem) != 0)
3676 reloc |= output_addressed_constants (TREE_VALUE (tem));
3686 /* Return nonzero if VALUE is a valid constant-valued expression
3687 for use in initializing a static variable; one that can be an
3688 element of a "constant" initializer.
3690 Return null_pointer_node if the value is absolute;
3691 if it is relocatable, return the variable that determines the relocation.
3692 We assume that VALUE has been folded as much as possible;
3693 therefore, we do not need to check for such things as
3694 arithmetic-combinations of integers. */
3697 initializer_constant_valid_p (value, endtype)
3701 /* Give the front-end a chance to convert VALUE to something that
3702 looks more like a constant to the back-end. */
3703 value = (*lang_hooks.expand_constant) (value);
3705 switch (TREE_CODE (value))
3708 if ((TREE_CODE (TREE_TYPE (value)) == UNION_TYPE
3709 || TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE)
3710 && TREE_CONSTANT (value)
3711 && CONSTRUCTOR_ELTS (value))
3713 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value)),
3716 return TREE_STATIC (value) ? null_pointer_node : 0;
3723 return null_pointer_node;
3727 return staticp (TREE_OPERAND (value, 0)) ? TREE_OPERAND (value, 0) : 0;
3729 case VIEW_CONVERT_EXPR:
3730 case NON_LVALUE_EXPR:
3731 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3735 /* Allow conversions between pointer types. */
3736 if (POINTER_TYPE_P (TREE_TYPE (value))
3737 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3738 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3740 /* Allow conversions between real types. */
3741 if (FLOAT_TYPE_P (TREE_TYPE (value))
3742 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3743 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3745 /* Allow length-preserving conversions between integer types. */
3746 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3747 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3748 && (TYPE_PRECISION (TREE_TYPE (value))
3749 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3750 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3752 /* Allow conversions between other integer types only if
3754 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3755 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3757 tree inner = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3759 if (inner == null_pointer_node)
3760 return null_pointer_node;
3764 /* Allow (int) &foo provided int is as wide as a pointer. */
3765 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3766 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3767 && (TYPE_PRECISION (TREE_TYPE (value))
3768 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3769 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3772 /* Likewise conversions from int to pointers, but also allow
3773 conversions from 0. */
3774 if (POINTER_TYPE_P (TREE_TYPE (value))
3775 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3777 if (integer_zerop (TREE_OPERAND (value, 0)))
3778 return null_pointer_node;
3779 else if (TYPE_PRECISION (TREE_TYPE (value))
3780 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0))))
3781 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3785 /* Allow conversions to union types if the value inside is okay. */
3786 if (TREE_CODE (TREE_TYPE (value)) == UNION_TYPE)
3787 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3792 if (! INTEGRAL_TYPE_P (endtype)
3793 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3795 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3797 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3799 /* If either term is absolute, use the other terms relocation. */
3800 if (valid0 == null_pointer_node)
3802 if (valid1 == null_pointer_node)
3808 if (! INTEGRAL_TYPE_P (endtype)
3809 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3811 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3813 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3815 /* Win if second argument is absolute. */
3816 if (valid1 == null_pointer_node)
3818 /* Win if both arguments have the same relocation.
3819 Then the value is absolute. */
3820 if (valid0 == valid1 && valid0 != 0)
3821 return null_pointer_node;
3823 /* Since GCC guarantees that string constants are unique in the
3824 generated code, a subtraction between two copies of the same
3825 constant string is absolute. */
3826 if (valid0 && TREE_CODE (valid0) == STRING_CST &&
3827 valid1 && TREE_CODE (valid1) == STRING_CST &&
3828 TREE_STRING_POINTER (valid0) == TREE_STRING_POINTER (valid1))
3829 return null_pointer_node;
3832 /* Support differences between labels. */
3833 if (INTEGRAL_TYPE_P (endtype))
3836 op0 = TREE_OPERAND (value, 0);
3837 op1 = TREE_OPERAND (value, 1);
3839 /* Like STRIP_NOPS except allow the operand mode to widen.
3840 This works around a feature of fold that simplfies
3841 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3842 that the narrower operation is cheaper. */
3844 while (TREE_CODE (op0) == NOP_EXPR
3845 || TREE_CODE (op0) == CONVERT_EXPR
3846 || TREE_CODE (op0) == NON_LVALUE_EXPR)
3848 tree inner = TREE_OPERAND (op0, 0);
3849 if (inner == error_mark_node
3850 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3851 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0)))
3852 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3857 while (TREE_CODE (op1) == NOP_EXPR
3858 || TREE_CODE (op1) == CONVERT_EXPR
3859 || TREE_CODE (op1) == NON_LVALUE_EXPR)
3861 tree inner = TREE_OPERAND (op1, 0);
3862 if (inner == error_mark_node
3863 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3864 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1)))
3865 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3870 if (TREE_CODE (op0) == ADDR_EXPR
3871 && TREE_CODE (TREE_OPERAND (op0, 0)) == LABEL_DECL
3872 && TREE_CODE (op1) == ADDR_EXPR
3873 && TREE_CODE (TREE_OPERAND (op1, 0)) == LABEL_DECL)
3874 return null_pointer_node;
3885 /* Output assembler code for constant EXP to FILE, with no label.
3886 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3887 Assumes output_addressed_constants has been done on EXP already.
3889 Generate exactly SIZE bytes of assembler data, padding at the end
3890 with zeros if necessary. SIZE must always be specified.
3892 SIZE is important for structure constructors,
3893 since trailing members may have been omitted from the constructor.
3894 It is also important for initialization of arrays from string constants
3895 since the full length of the string constant might not be wanted.
3896 It is also needed for initialization of unions, where the initializer's
3897 type is just one member, and that may not be as long as the union.
3899 There a case in which we would fail to output exactly SIZE bytes:
3900 for a structure constructor that wants to produce more than SIZE bytes.
3901 But such constructors will never be generated for any possible input.
3903 ALIGN is the alignment of the data in bits. */
3906 output_constant (exp, size, align)
3911 enum tree_code code;
3912 HOST_WIDE_INT thissize;
3914 /* Some front-ends use constants other than the standard language-indepdent
3915 varieties, but which may still be output directly. Give the front-end a
3916 chance to convert EXP to a language-independent representation. */
3917 exp = (*lang_hooks.expand_constant) (exp);
3919 if (size == 0 || flag_syntax_only)
3922 /* Eliminate any conversions since we'll be outputting the underlying
3924 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
3925 || TREE_CODE (exp) == NON_LVALUE_EXPR
3926 || TREE_CODE (exp) == VIEW_CONVERT_EXPR)
3927 exp = TREE_OPERAND (exp, 0);
3929 code = TREE_CODE (TREE_TYPE (exp));
3930 thissize = int_size_in_bytes (TREE_TYPE (exp));
3932 /* Allow a constructor with no elements for any data type.
3933 This means to fill the space with zeros. */
3934 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
3936 assemble_zeros (size);
3940 if (TREE_CODE (exp) == FDESC_EXPR)
3942 #ifdef ASM_OUTPUT_FDESC
3943 HOST_WIDE_INT part = tree_low_cst (TREE_OPERAND (exp, 1), 0);
3944 tree decl = TREE_OPERAND (exp, 0);
3945 ASM_OUTPUT_FDESC (asm_out_file, decl, part);
3952 /* Now output the underlying data. If we've handling the padding, return.
3953 Otherwise, break and ensure THISSIZE is the size written. */
3961 case REFERENCE_TYPE:
3962 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
3963 EXPAND_INITIALIZER),
3965 error ("initializer for integer value is too complicated");
3969 if (TREE_CODE (exp) != REAL_CST)
3970 error ("initializer for floating value is not a floating constant");
3972 assemble_real (TREE_REAL_CST (exp),
3973 mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0),
3978 output_constant (TREE_REALPART (exp), thissize / 2, align);
3979 output_constant (TREE_IMAGPART (exp), thissize / 2,
3980 min_align (align, BITS_PER_UNIT * (thissize / 2)));
3985 if (TREE_CODE (exp) == CONSTRUCTOR)
3987 output_constructor (exp, size, align);
3990 else if (TREE_CODE (exp) == STRING_CST)
3992 thissize = MIN (TREE_STRING_LENGTH (exp), size);
3993 assemble_string (TREE_STRING_POINTER (exp), thissize);
4001 if (TREE_CODE (exp) == CONSTRUCTOR)
4002 output_constructor (exp, size, align);
4008 if (TREE_CODE (exp) == INTEGER_CST)
4009 assemble_integer (expand_expr (exp, NULL_RTX,
4010 VOIDmode, EXPAND_INITIALIZER),
4011 thissize, align, 1);
4012 else if (TREE_CODE (exp) == CONSTRUCTOR)
4014 unsigned char *buffer = (unsigned char *) alloca (thissize);
4015 if (get_set_constructor_bytes (exp, buffer, thissize))
4017 assemble_string ((char *) buffer, thissize);
4020 error ("unknown set constructor type");
4032 assemble_zeros (size);
4036 /* Subroutine of output_constructor, used for computing the size of
4037 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4038 type with an unspecified upper bound. */
4040 static unsigned HOST_WIDE_INT
4041 array_size_for_constructor (val)
4046 /* This code used to attempt to handle string constants that are not
4047 arrays of single-bytes, but nothing else does, so there's no point in
4049 if (TREE_CODE (val) == STRING_CST)
4050 return TREE_STRING_LENGTH (val);
4052 max_index = NULL_TREE;
4053 for (i = CONSTRUCTOR_ELTS (val); i; i = TREE_CHAIN (i))
4055 tree index = TREE_PURPOSE (i);
4057 if (TREE_CODE (index) == RANGE_EXPR)
4058 index = TREE_OPERAND (index, 1);
4059 if (max_index == NULL_TREE || tree_int_cst_lt (max_index, index))
4063 if (max_index == NULL_TREE)
4066 /* Compute the total number of array elements. */
4067 i = size_binop (MINUS_EXPR, convert (sizetype, max_index),
4069 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val)))));
4070 i = size_binop (PLUS_EXPR, i, convert (sizetype, integer_one_node));
4072 /* Multiply by the array element unit size to find number of bytes. */
4073 i = size_binop (MULT_EXPR, i, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val))));
4075 return tree_low_cst (i, 1);
4078 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4079 Generate at least SIZE bytes, padding if necessary. */
4082 output_constructor (exp, size, align)
4087 tree type = TREE_TYPE (exp);
4088 tree link, field = 0;
4090 /* Number of bytes output or skipped so far.
4091 In other words, current position within the constructor. */
4092 HOST_WIDE_INT total_bytes = 0;
4093 /* Non-zero means BYTE contains part of a byte, to be output. */
4094 int byte_buffer_in_use = 0;
4097 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
4100 if (TREE_CODE (type) == RECORD_TYPE)
4101 field = TYPE_FIELDS (type);
4103 if (TREE_CODE (type) == ARRAY_TYPE
4104 && TYPE_DOMAIN (type) != 0)
4105 min_index = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
4107 /* As LINK goes through the elements of the constant,
4108 FIELD goes through the structure fields, if the constant is a structure.
4109 if the constant is a union, then we override this,
4110 by getting the field from the TREE_LIST element.
4111 But the constant could also be an array. Then FIELD is zero.
4113 There is always a maximum of one element in the chain LINK for unions
4114 (even if the initializer in a source program incorrectly contains
4116 for (link = CONSTRUCTOR_ELTS (exp);
4118 link = TREE_CHAIN (link),
4119 field = field ? TREE_CHAIN (field) : 0)
4121 tree val = TREE_VALUE (link);
4124 /* The element in a union constructor specifies the proper field
4126 if ((TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
4127 || TREE_CODE (type) == QUAL_UNION_TYPE)
4128 && TREE_PURPOSE (link) != 0)
4129 field = TREE_PURPOSE (link);
4131 else if (TREE_CODE (type) == ARRAY_TYPE)
4132 index = TREE_PURPOSE (link);
4134 /* Eliminate the marker that makes a cast not be an lvalue. */
4138 if (index && TREE_CODE (index) == RANGE_EXPR)
4140 unsigned HOST_WIDE_INT fieldsize
4141 = int_size_in_bytes (TREE_TYPE (type));
4142 HOST_WIDE_INT lo_index = tree_low_cst (TREE_OPERAND (index, 0), 0);
4143 HOST_WIDE_INT hi_index = tree_low_cst (TREE_OPERAND (index, 1), 0);
4144 HOST_WIDE_INT index;
4145 unsigned int align2 = min_align (align, fieldsize * BITS_PER_UNIT);
4147 for (index = lo_index; index <= hi_index; index++)
4149 /* Output the element's initial value. */
4151 assemble_zeros (fieldsize);
4153 output_constant (val, fieldsize, align2);
4155 /* Count its size. */
4156 total_bytes += fieldsize;
4159 else if (field == 0 || !DECL_BIT_FIELD (field))
4161 /* An element that is not a bit-field. */
4163 unsigned HOST_WIDE_INT fieldsize;
4164 /* Since this structure is static,
4165 we know the positions are constant. */
4166 HOST_WIDE_INT pos = field ? int_byte_position (field) : 0;
4167 unsigned int align2;
4170 pos = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val)), 1)
4171 * (tree_low_cst (index, 0) - tree_low_cst (min_index, 0)));
4173 /* Output any buffered-up bit-fields preceding this element. */
4174 if (byte_buffer_in_use)
4176 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4178 byte_buffer_in_use = 0;
4181 /* Advance to offset of this element.
4182 Note no alignment needed in an array, since that is guaranteed
4183 if each element has the proper size. */
4184 if ((field != 0 || index != 0) && pos != total_bytes)
4186 assemble_zeros (pos - total_bytes);
4190 /* Find the alignment of this element. */
4191 align2 = min_align (align, BITS_PER_UNIT * pos);
4193 /* Determine size this element should occupy. */
4198 /* If this is an array with an unspecified upper bound,
4199 the initializer determines the size. */
4200 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4201 but we cannot do this until the deprecated support for
4202 initializing zero-length array members is removed. */
4203 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE
4204 && TYPE_DOMAIN (TREE_TYPE (field))
4205 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field))))
4207 fieldsize = array_size_for_constructor (val);
4208 /* Given a non-empty initialization, this field had
4210 if (fieldsize != 0 && TREE_CHAIN (field) != NULL_TREE)
4213 else if (DECL_SIZE_UNIT (field))
4215 /* ??? This can't be right. If the decl size overflows
4216 a host integer we will silently emit no data. */
4217 if (host_integerp (DECL_SIZE_UNIT (field), 1))
4218 fieldsize = tree_low_cst (DECL_SIZE_UNIT (field), 1);
4222 fieldsize = int_size_in_bytes (TREE_TYPE (type));
4224 /* Output the element's initial value. */
4226 assemble_zeros (fieldsize);
4228 output_constant (val, fieldsize, align2);
4230 /* Count its size. */
4231 total_bytes += fieldsize;
4233 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
4234 error ("invalid initial value for member `%s'",
4235 IDENTIFIER_POINTER (DECL_NAME (field)));
4238 /* Element that is a bit-field. */
4240 HOST_WIDE_INT next_offset = int_bit_position (field);
4241 HOST_WIDE_INT end_offset
4242 = (next_offset + tree_low_cst (DECL_SIZE (field), 1));
4245 val = integer_zero_node;
4247 /* If this field does not start in this (or, next) byte,
4249 if (next_offset / BITS_PER_UNIT != total_bytes)
4251 /* Output remnant of any bit field in previous bytes. */
4252 if (byte_buffer_in_use)
4254 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4256 byte_buffer_in_use = 0;
4259 /* If still not at proper byte, advance to there. */
4260 if (next_offset / BITS_PER_UNIT != total_bytes)
4262 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
4263 total_bytes = next_offset / BITS_PER_UNIT;
4267 if (! byte_buffer_in_use)
4270 /* We must split the element into pieces that fall within
4271 separate bytes, and combine each byte with previous or
4272 following bit-fields. */
4274 /* next_offset is the offset n fbits from the beginning of
4275 the structure to the next bit of this element to be processed.
4276 end_offset is the offset of the first bit past the end of
4278 while (next_offset < end_offset)
4282 HOST_WIDE_INT value;
4283 HOST_WIDE_INT next_byte = next_offset / BITS_PER_UNIT;
4284 HOST_WIDE_INT next_bit = next_offset % BITS_PER_UNIT;
4286 /* Advance from byte to byte
4287 within this element when necessary. */
4288 while (next_byte != total_bytes)
4290 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4295 /* Number of bits we can process at once
4296 (all part of the same byte). */
4297 this_time = MIN (end_offset - next_offset,
4298 BITS_PER_UNIT - next_bit);
4299 if (BYTES_BIG_ENDIAN)
4301 /* On big-endian machine, take the most significant bits
4302 first (of the bits that are significant)
4303 and put them into bytes from the most significant end. */
4304 shift = end_offset - next_offset - this_time;
4306 /* Don't try to take a bunch of bits that cross
4307 the word boundary in the INTEGER_CST. We can
4308 only select bits from the LOW or HIGH part
4310 if (shift < HOST_BITS_PER_WIDE_INT
4311 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4313 this_time = shift + this_time - HOST_BITS_PER_WIDE_INT;
4314 shift = HOST_BITS_PER_WIDE_INT;
4317 /* Now get the bits from the appropriate constant word. */
4318 if (shift < HOST_BITS_PER_WIDE_INT)
4319 value = TREE_INT_CST_LOW (val);
4320 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4322 value = TREE_INT_CST_HIGH (val);
4323 shift -= HOST_BITS_PER_WIDE_INT;
4328 /* Get the result. This works only when:
4329 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4330 byte |= (((value >> shift)
4331 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4332 << (BITS_PER_UNIT - this_time - next_bit));
4336 /* On little-endian machines,
4337 take first the least significant bits of the value
4338 and pack them starting at the least significant
4339 bits of the bytes. */
4340 shift = next_offset - int_bit_position (field);
4342 /* Don't try to take a bunch of bits that cross
4343 the word boundary in the INTEGER_CST. We can
4344 only select bits from the LOW or HIGH part
4346 if (shift < HOST_BITS_PER_WIDE_INT
4347 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4348 this_time = (HOST_BITS_PER_WIDE_INT - shift);
4350 /* Now get the bits from the appropriate constant word. */
4351 if (shift < HOST_BITS_PER_WIDE_INT)
4352 value = TREE_INT_CST_LOW (val);
4353 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4355 value = TREE_INT_CST_HIGH (val);
4356 shift -= HOST_BITS_PER_WIDE_INT;
4361 /* Get the result. This works only when:
4362 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4363 byte |= (((value >> shift)
4364 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4368 next_offset += this_time;
4369 byte_buffer_in_use = 1;
4374 if (byte_buffer_in_use)
4376 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4380 if (total_bytes < size)
4381 assemble_zeros (size - total_bytes);
4384 /* This TREE_LIST contains any weak symbol declarations waiting
4386 static GTY(()) tree weak_decls;
4388 /* Mark DECL as weak. */
4394 DECL_WEAK (decl) = 1;
4396 if (DECL_RTL_SET_P (decl)
4397 && GET_CODE (DECL_RTL (decl)) == MEM
4398 && XEXP (DECL_RTL (decl), 0)
4399 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == SYMBOL_REF)
4400 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl), 0)) = 1;
4403 /* Merge weak status between NEWDECL and OLDDECL. */
4406 merge_weak (newdecl, olddecl)
4410 if (DECL_WEAK (newdecl) == DECL_WEAK (olddecl))
4413 if (DECL_WEAK (newdecl))
4417 /* NEWDECL is weak, but OLDDECL is not. */
4419 /* If we already output the OLDDECL, we're in trouble; we can't
4420 go back and make it weak. This error cannot caught in
4421 declare_weak because the NEWDECL and OLDDECL was not yet
4422 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4423 if (TREE_ASM_WRITTEN (olddecl))
4424 error_with_decl (newdecl,
4425 "weak declaration of `%s' must precede definition");
4427 /* If we've already generated rtl referencing OLDDECL, we may
4428 have done so in a way that will not function properly with
4430 else if (TREE_USED (olddecl)
4431 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl)))
4432 warning_with_decl (newdecl, "weak declaration of `%s' after first use results in unspecified behavior");
4436 /* We put the NEWDECL on the weak_decls list at some point.
4437 Replace it with the OLDDECL. */
4438 for (wd = weak_decls; wd; wd = TREE_CHAIN (wd))
4439 if (TREE_VALUE (wd) == newdecl)
4441 TREE_VALUE (wd) = olddecl;
4444 /* We may not find the entry on the list. If NEWDECL is a
4445 weak alias, then we will have already called
4446 globalize_decl to remove the entry; in that case, we do
4447 not need to do anything. */
4450 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4451 mark_weak (olddecl);
4454 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4455 weak. Just update NEWDECL to indicate that it's weak too. */
4456 mark_weak (newdecl);
4459 /* Declare DECL to be a weak symbol. */
4465 if (! TREE_PUBLIC (decl))
4466 error_with_decl (decl, "weak declaration of `%s' must be public");
4467 else if (TREE_CODE (decl) == FUNCTION_DECL && TREE_ASM_WRITTEN (decl))
4468 error_with_decl (decl, "weak declaration of `%s' must precede definition");
4469 else if (SUPPORTS_WEAK)
4471 if (! DECL_WEAK (decl))
4472 weak_decls = tree_cons (NULL, decl, weak_decls);
4475 warning_with_decl (decl, "weak declaration of `%s' not supported");
4480 /* Emit any pending weak declarations. */
4487 for (t = weak_decls; t; t = TREE_CHAIN (t))
4489 tree decl = TREE_VALUE (t);
4490 const char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4492 if (! TREE_USED (decl))
4495 #ifdef ASM_WEAKEN_DECL
4496 ASM_WEAKEN_DECL (asm_out_file, decl, name, NULL);
4498 #ifdef ASM_WEAKEN_LABEL
4499 ASM_WEAKEN_LABEL (asm_out_file, name);
4501 #ifdef ASM_OUTPUT_WEAK_ALIAS
4502 warning ("only weak aliases are supported in this configuration");
4510 /* Emit the assembly bits to indicate that DECL is globally visible. */
4513 globalize_decl (decl)
4516 const char *name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4518 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4519 if (DECL_WEAK (decl))
4523 #ifdef ASM_WEAKEN_DECL
4524 ASM_WEAKEN_DECL (asm_out_file, decl, name, 0);
4526 ASM_WEAKEN_LABEL (asm_out_file, name);
4529 /* Remove this function from the pending weak list so that
4530 we do not emit multiple .weak directives for it. */
4531 for (p = &weak_decls; (t = *p) ; )
4533 if (DECL_ASSEMBLER_NAME (decl) == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
4534 *p = TREE_CHAIN (t);
4536 p = &TREE_CHAIN (t);
4542 (*targetm.asm_out.globalize_label) (asm_out_file, name);
4545 /* Emit an assembler directive to make the symbol for DECL an alias to
4546 the symbol for TARGET. */
4549 assemble_alias (decl, target)
4550 tree decl, target ATTRIBUTE_UNUSED;
4554 /* We must force creation of DECL_RTL for debug info generation, even though
4555 we don't use it here. */
4556 make_decl_rtl (decl, NULL);
4558 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4560 #ifdef ASM_OUTPUT_DEF
4561 /* Make name accessible from other files, if appropriate. */
4563 if (TREE_PUBLIC (decl))
4565 globalize_decl (decl);
4566 maybe_assemble_visibility (decl);
4569 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4570 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
4572 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4574 #else /* !ASM_OUTPUT_DEF */
4575 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4576 if (! DECL_WEAK (decl))
4577 warning ("only weak aliases are supported in this configuration");
4579 #ifdef ASM_WEAKEN_DECL
4580 ASM_WEAKEN_DECL (asm_out_file, decl, name, IDENTIFIER_POINTER (target));
4582 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
4585 warning ("alias definitions not supported in this configuration; ignored");
4589 TREE_USED (decl) = 1;
4590 TREE_ASM_WRITTEN (decl) = 1;
4591 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl)) = 1;
4594 /* Emit an assembler directive to set symbol for DECL visibility to
4598 assemble_visibility (decl, visibility_type)
4600 const char *visibility_type ATTRIBUTE_UNUSED;
4604 name = (* targetm.strip_name_encoding)
4605 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
4607 #ifdef HAVE_GAS_HIDDEN
4608 fprintf (asm_out_file, "\t.%s\t%s\n", visibility_type, name);
4610 warning ("visibility attribute not supported in this configuration; ignored");
4614 /* A helper function to call assemble_visibility when needed for a decl. */
4617 maybe_assemble_visibility (decl)
4620 tree visibility = lookup_attribute ("visibility", DECL_ATTRIBUTES (decl));
4624 = TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (visibility)));
4625 assemble_visibility (decl, type);
4629 /* Returns 1 if the target configuration supports defining public symbols
4630 so that one of them will be chosen at link time instead of generating a
4631 multiply-defined symbol error, whether through the use of weak symbols or
4632 a target-specific mechanism for having duplicates discarded. */
4635 supports_one_only ()
4637 if (SUPPORTS_ONE_ONLY)
4639 return SUPPORTS_WEAK;
4642 /* Set up DECL as a public symbol that can be defined in multiple
4643 translation units without generating a linker error. */
4646 make_decl_one_only (decl)
4649 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL)
4652 TREE_PUBLIC (decl) = 1;
4654 if (TREE_CODE (decl) == VAR_DECL
4655 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
4656 DECL_COMMON (decl) = 1;
4657 else if (SUPPORTS_ONE_ONLY)
4659 #ifdef MAKE_DECL_ONE_ONLY
4660 MAKE_DECL_ONE_ONLY (decl);
4662 DECL_ONE_ONLY (decl) = 1;
4664 else if (SUPPORTS_WEAK)
4665 DECL_WEAK (decl) = 1;
4673 const_str_htab = htab_create_ggc (128, const_str_htab_hash,
4674 const_str_htab_eq, NULL);
4675 in_named_htab = htab_create (31, in_named_entry_hash,
4676 in_named_entry_eq, NULL);
4678 const_alias_set = new_alias_set ();
4681 /* Select a set of attributes for section NAME based on the properties
4682 of DECL and whether or not RELOC indicates that DECL's initializer
4683 might contain runtime relocations.
4685 We make the section read-only and executable for a function decl,
4686 read-only for a const data decl, and writable for a non-const data decl. */
4689 default_section_type_flags (decl, name, reloc)
4696 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
4697 flags = SECTION_CODE;
4698 else if (decl && decl_readonly_section (decl, reloc))
4701 flags = SECTION_WRITE;
4703 if (decl && DECL_ONE_ONLY (decl))
4704 flags |= SECTION_LINKONCE;
4706 if (decl && TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4707 flags |= SECTION_TLS | SECTION_WRITE;
4709 if (strcmp (name, ".bss") == 0
4710 || strncmp (name, ".bss.", 5) == 0
4711 || strncmp (name, ".gnu.linkonce.b.", 16) == 0
4712 || strcmp (name, ".sbss") == 0
4713 || strncmp (name, ".sbss.", 6) == 0
4714 || strncmp (name, ".gnu.linkonce.sb.", 17) == 0
4715 || strcmp (name, ".tbss") == 0
4716 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4717 flags |= SECTION_BSS;
4719 if (strcmp (name, ".tdata") == 0
4720 || strcmp (name, ".tbss") == 0
4721 || strncmp (name, ".gnu.linkonce.td.", 17) == 0
4722 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4723 flags |= SECTION_TLS;
4728 /* Output assembly to switch to section NAME with attribute FLAGS.
4729 Four variants for common object file formats. */
4732 default_no_named_section (name, flags)
4733 const char *name ATTRIBUTE_UNUSED;
4734 unsigned int flags ATTRIBUTE_UNUSED;
4736 /* Some object formats don't support named sections at all. The
4737 front-end should already have flagged this as an error. */
4742 default_elf_asm_named_section (name, flags)
4746 char flagchars[10], *f = flagchars;
4749 if (! named_section_first_declaration (name))
4751 fprintf (asm_out_file, "\t.section\t%s\n", name);
4755 if (!(flags & SECTION_DEBUG))
4757 if (flags & SECTION_WRITE)
4759 if (flags & SECTION_CODE)
4761 if (flags & SECTION_SMALL)
4763 if (flags & SECTION_MERGE)
4765 if (flags & SECTION_STRINGS)
4767 if (flags & SECTION_TLS)
4771 if (flags & SECTION_BSS)
4776 if (flags & SECTION_ENTSIZE)
4777 fprintf (asm_out_file, "\t.section\t%s,\"%s\",@%s,%d\n",
4778 name, flagchars, type, flags & SECTION_ENTSIZE);
4780 fprintf (asm_out_file, "\t.section\t%s,\"%s\",@%s\n",
4781 name, flagchars, type);
4785 default_coff_asm_named_section (name, flags)
4789 char flagchars[8], *f = flagchars;
4791 if (flags & SECTION_WRITE)
4793 if (flags & SECTION_CODE)
4797 fprintf (asm_out_file, "\t.section\t%s,\"%s\"\n", name, flagchars);
4801 default_pe_asm_named_section (name, flags)
4805 default_coff_asm_named_section (name, flags);
4807 if (flags & SECTION_LINKONCE)
4809 /* Functions may have been compiled at various levels of
4810 optimization so we can't use `same_size' here.
4811 Instead, have the linker pick one. */
4812 fprintf (asm_out_file, "\t.linkonce %s\n",
4813 (flags & SECTION_CODE ? "discard" : "same_size"));
4817 /* Used for vtable gc in GNU binutils. Record that the pointer at OFFSET
4818 from SYMBOL is used in all classes derived from SYMBOL. */
4821 assemble_vtable_entry (symbol, offset)
4823 HOST_WIDE_INT offset;
4825 fputs ("\t.vtable_entry ", asm_out_file);
4826 output_addr_const (asm_out_file, symbol);
4827 fputs (", ", asm_out_file);
4828 fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC, offset);
4829 fputc ('\n', asm_out_file);
4832 /* Used for vtable gc in GNU binutils. Record the class hierarchy by noting
4833 that the vtable symbol CHILD is derived from the vtable symbol PARENT. */
4836 assemble_vtable_inherit (child, parent)
4839 fputs ("\t.vtable_inherit ", asm_out_file);
4840 output_addr_const (asm_out_file, child);
4841 fputs (", ", asm_out_file);
4842 output_addr_const (asm_out_file, parent);
4843 fputc ('\n', asm_out_file);
4846 /* The lame default section selector. */
4849 default_select_section (decl, reloc, align)
4852 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED;
4854 bool readonly = false;
4858 if (decl_readonly_section (decl, reloc))
4861 else if (TREE_CODE (decl) == CONSTRUCTOR)
4863 if (! ((flag_pic && reloc)
4864 || !TREE_READONLY (decl)
4865 || TREE_SIDE_EFFECTS (decl)
4866 || !TREE_CONSTANT (decl)))
4869 else if (TREE_CODE (decl) == STRING_CST)
4870 readonly = !flag_writable_strings;
4871 else if (! (flag_pic && reloc))
4875 readonly_data_section ();
4880 /* A helper function for default_elf_select_section and
4881 default_elf_unique_section. Categorizes the DECL. */
4883 enum section_category
4888 SECCAT_RODATA_MERGE_STR,
4889 SECCAT_RODATA_MERGE_STR_INIT,
4890 SECCAT_RODATA_MERGE_CONST,
4894 /* To optimize loading of shared programs, define following subsections
4896 _REL Contains data that has relocations, so they get grouped
4897 together and dynamic linker will visit fewer pages in memory.
4898 _RO Contains data that is otherwise read-only. This is useful
4899 with prelinking as most relocations won't be dynamically
4900 linked and thus stay read only.
4901 _LOCAL Marks data containing relocations only to local objects.
4902 These relocations will get fully resolved by prelinking. */
4904 SECCAT_DATA_REL_LOCAL,
4906 SECCAT_DATA_REL_RO_LOCAL,
4916 static enum section_category categorize_decl_for_section PARAMS ((tree, int));
4918 static enum section_category
4919 categorize_decl_for_section (decl, reloc)
4923 enum section_category ret;
4925 if (TREE_CODE (decl) == FUNCTION_DECL)
4927 else if (TREE_CODE (decl) == STRING_CST)
4929 if (flag_writable_strings)
4932 return SECCAT_RODATA_MERGE_STR;
4934 else if (TREE_CODE (decl) == VAR_DECL)
4936 if (DECL_INITIAL (decl) == NULL
4937 || DECL_INITIAL (decl) == error_mark_node)
4939 else if (! TREE_READONLY (decl)
4940 || TREE_SIDE_EFFECTS (decl)
4941 || ! TREE_CONSTANT (DECL_INITIAL (decl)))
4943 if (flag_pic && (reloc & 2))
4944 ret = SECCAT_DATA_REL;
4945 else if (flag_pic && reloc)
4946 ret = SECCAT_DATA_REL_LOCAL;
4950 else if (flag_pic && (reloc & 2))
4951 ret = SECCAT_DATA_REL_RO;
4952 else if (flag_pic && reloc)
4953 ret = SECCAT_DATA_REL_RO_LOCAL;
4954 else if (flag_merge_constants < 2)
4955 /* C and C++ don't allow different variables to share the same
4956 location. -fmerge-all-constants allows even that (at the
4957 expense of not conforming). */
4958 ret = SECCAT_RODATA;
4959 else if (TREE_CODE (DECL_INITIAL (decl)) == STRING_CST)
4960 ret = SECCAT_RODATA_MERGE_STR_INIT;
4962 ret = SECCAT_RODATA_MERGE_CONST;
4964 else if (TREE_CODE (decl) == CONSTRUCTOR)
4966 if ((flag_pic && reloc)
4967 || TREE_SIDE_EFFECTS (decl)
4968 || ! TREE_CONSTANT (decl))
4971 ret = SECCAT_RODATA;
4974 ret = SECCAT_RODATA;
4976 /* There are no read-only thread-local sections. */
4977 if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4979 if (ret == SECCAT_BSS)
4985 /* If the target uses small data sections, select it. */
4986 else if ((*targetm.in_small_data_p) (decl))
4988 if (ret == SECCAT_BSS)
4998 decl_readonly_section (decl, reloc)
5002 switch (categorize_decl_for_section (decl, reloc))
5005 case SECCAT_RODATA_MERGE_STR:
5006 case SECCAT_RODATA_MERGE_STR_INIT:
5007 case SECCAT_RODATA_MERGE_CONST:
5016 /* Select a section based on the above categorization. */
5019 default_elf_select_section (decl, reloc, align)
5022 unsigned HOST_WIDE_INT align;
5024 switch (categorize_decl_for_section (decl, reloc))
5027 /* We're not supposed to be called on FUNCTION_DECLs. */
5030 readonly_data_section ();
5032 case SECCAT_RODATA_MERGE_STR:
5033 mergeable_string_section (decl, align, 0);
5035 case SECCAT_RODATA_MERGE_STR_INIT:
5036 mergeable_string_section (DECL_INITIAL (decl), align, 0);
5038 case SECCAT_RODATA_MERGE_CONST:
5039 mergeable_constant_section (DECL_MODE (decl), align, 0);
5044 case SECCAT_DATA_REL:
5045 named_section (NULL_TREE, ".data.rel", reloc);
5047 case SECCAT_DATA_REL_LOCAL:
5048 named_section (NULL_TREE, ".data.rel.local", reloc);
5050 case SECCAT_DATA_REL_RO:
5051 named_section (NULL_TREE, ".data.rel.ro", reloc);
5053 case SECCAT_DATA_REL_RO_LOCAL:
5054 named_section (NULL_TREE, ".data.rel.ro.local", reloc);
5057 named_section (NULL_TREE, ".sdata", reloc);
5060 named_section (NULL_TREE, ".tdata", reloc);
5063 #ifdef BSS_SECTION_ASM_OP
5066 named_section (NULL_TREE, ".bss", reloc);
5070 named_section (NULL_TREE, ".sbss", reloc);
5073 named_section (NULL_TREE, ".tbss", reloc);
5080 /* Construct a unique section name based on the decl name and the
5081 categorization performed above. */
5084 default_unique_section (decl, reloc)
5088 bool one_only = DECL_ONE_ONLY (decl);
5089 const char *prefix, *name;
5093 switch (categorize_decl_for_section (decl, reloc))
5096 prefix = one_only ? ".gnu.linkonce.t." : ".text.";
5099 case SECCAT_RODATA_MERGE_STR:
5100 case SECCAT_RODATA_MERGE_STR_INIT:
5101 case SECCAT_RODATA_MERGE_CONST:
5102 prefix = one_only ? ".gnu.linkonce.r." : ".rodata.";
5105 case SECCAT_DATA_REL:
5106 case SECCAT_DATA_REL_LOCAL:
5107 case SECCAT_DATA_REL_RO:
5108 case SECCAT_DATA_REL_RO_LOCAL:
5109 prefix = one_only ? ".gnu.linkonce.d." : ".data.";
5112 prefix = one_only ? ".gnu.linkonce.s." : ".sdata.";
5115 prefix = one_only ? ".gnu.linkonce.b." : ".bss.";
5118 prefix = one_only ? ".gnu.linkonce.sb." : ".sbss.";
5121 prefix = one_only ? ".gnu.linkonce.td." : ".tdata.";
5124 prefix = one_only ? ".gnu.linkonce.tb." : ".tbss.";
5129 plen = strlen (prefix);
5131 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
5132 name = (* targetm.strip_name_encoding) (name);
5133 nlen = strlen (name);
5135 string = alloca (nlen + plen + 1);
5136 memcpy (string, prefix, plen);
5137 memcpy (string + plen, name, nlen + 1);
5139 DECL_SECTION_NAME (decl) = build_string (nlen + plen, string);
5143 default_select_rtx_section (mode, x, align)
5144 enum machine_mode mode ATTRIBUTE_UNUSED;
5146 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED;
5149 switch (GET_CODE (x))
5161 readonly_data_section ();
5165 default_elf_select_rtx_section (mode, x, align)
5166 enum machine_mode mode;
5168 unsigned HOST_WIDE_INT align;
5170 /* ??? Handle small data here somehow. */
5173 switch (GET_CODE (x))
5177 named_section (NULL_TREE, ".data.rel.ro", 3);
5181 named_section (NULL_TREE, ".data.rel.ro.local", 1);
5188 mergeable_constant_section (mode, align, 0);
5191 /* By default, we do nothing for encode_section_info, so we need not
5192 do anything but discard the '*' marker. */
5195 default_strip_name_encoding (str)
5198 return str + (*str == '*');
5201 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5202 wrt cross-module name binding. */
5205 default_binds_local_p (exp)
5210 /* A non-decl is an entry in the constant pool. */
5213 /* Static variables are always local. */
5214 else if (! TREE_PUBLIC (exp))
5216 /* A variable is local if the user tells us so. */
5217 else if (MODULE_LOCAL_P (exp))
5219 /* Otherwise, variables defined outside this object may not be local. */
5220 else if (DECL_EXTERNAL (exp))
5222 /* Linkonce and weak data are never local. */
5223 else if (DECL_ONE_ONLY (exp) || DECL_WEAK (exp))
5225 /* If PIC, then assume that any global name can be overridden by
5226 symbols resolved from other modules. */
5229 /* Uninitialized COMMON variable may be unified with symbols
5230 resolved from other modules. */
5231 else if (DECL_COMMON (exp)
5232 && (DECL_INITIAL (exp) == NULL
5233 || DECL_INITIAL (exp) == error_mark_node))
5235 /* Otherwise we're left with initialized (or non-common) global data
5236 which is of necessity defined locally. */
5243 /* Default function to output code that will globalize a label. A
5244 target must define GLOBAL_ASM_OP or provide it's own function to
5245 globalize a label. */
5246 #ifdef GLOBAL_ASM_OP
5248 default_globalize_label (stream, name)
5252 fputs (GLOBAL_ASM_OP, stream);
5253 assemble_name (stream, name);
5254 putc ('\n', stream);
5256 #endif /* GLOBAL_ASM_OP */
5258 #include "gt-varasm.h"