1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
32 #include "coretypes.h"
39 #include "hard-reg-set.h"
47 #include "langhooks.h"
53 #ifdef XCOFF_DEBUGGING_INFO
54 #include "xcoffout.h" /* Needed for external data
55 declarations for e.g. AIX 4.x. */
58 #ifndef TRAMPOLINE_ALIGNMENT
59 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
63 #define ASM_STABS_OP "\t.stabs\t"
66 /* The (assembler) name of the first globally-visible object output. */
67 const char *first_global_object_name;
68 const char *weak_global_object_name;
71 struct constant_descriptor_rtx;
75 #define MAX_RTX_HASH_TABLE 61
77 struct varasm_status GTY(())
79 /* Hash facility for making memory-constants
80 from constant rtl-expressions. It is used on RISC machines
81 where immediate integer arguments and constant addresses are restricted
82 so that such constants must be stored in memory.
84 This pool of constants is reinitialized for each function
85 so each function gets its own constants-pool that comes right before
87 struct constant_descriptor_rtx ** GTY ((length ("MAX_RTX_HASH_TABLE")))
88 x_const_rtx_hash_table;
89 struct pool_constant ** GTY ((length ("MAX_RTX_HASH_TABLE")))
90 x_const_rtx_sym_hash_table;
92 /* Pointers to first and last constant in pool. */
93 struct pool_constant *x_first_pool;
94 struct pool_constant *x_last_pool;
96 /* Current offset in constant pool (does not include any machine-specific
98 HOST_WIDE_INT x_pool_offset;
100 /* Number of tree-constants deferred during the expansion of this
102 unsigned int deferred_constants;
105 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
106 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
107 #define first_pool (cfun->varasm->x_first_pool)
108 #define last_pool (cfun->varasm->x_last_pool)
109 #define pool_offset (cfun->varasm->x_pool_offset)
110 #define n_deferred_constants (cfun->varasm->deferred_constants)
112 /* Number for making the label on the next
113 constant that is stored in memory. */
115 static GTY(()) int const_labelno;
117 /* Number for making the label on the next
118 static variable internal to a function. */
120 static GTY(()) int var_labelno;
122 /* Carry information from ASM_DECLARE_OBJECT_NAME
123 to ASM_FINISH_DECLARE_OBJECT. */
125 int size_directive_output;
127 /* The last decl for which assemble_variable was called,
128 if it did ASM_DECLARE_OBJECT_NAME.
129 If the last call to assemble_variable didn't do that,
132 tree last_assemble_variable_decl;
134 /* RTX_UNCHANGING_P in a MEM can mean it is stored into, for initialization.
135 So giving constant the alias set for the type will allow such
136 initializations to appear to conflict with the load of the constant. We
137 avoid this by giving all constants an alias set for just constants.
138 Since there will be no stores to that alias set, nothing will ever
139 conflict with them. */
141 static HOST_WIDE_INT const_alias_set;
143 static const char *strip_reg_name PARAMS ((const char *));
144 static int contains_pointers_p PARAMS ((tree));
145 static void decode_addr_const PARAMS ((tree, struct addr_const *));
146 static hashval_t const_desc_hash PARAMS ((const void *));
147 static int const_desc_eq PARAMS ((const void *, const void *));
148 static hashval_t const_hash_1 PARAMS ((const tree));
149 static int compare_constant PARAMS ((const tree, const tree));
150 static tree copy_constant PARAMS ((tree));
151 static void output_constant_def_contents PARAMS ((rtx));
152 static void decode_rtx_const PARAMS ((enum machine_mode, rtx,
153 struct rtx_const *));
154 static unsigned int const_hash_rtx PARAMS ((enum machine_mode, rtx));
155 static int compare_constant_rtx
156 PARAMS ((enum machine_mode, rtx, struct constant_descriptor_rtx *));
157 static struct constant_descriptor_rtx * record_constant_rtx
158 PARAMS ((enum machine_mode, rtx));
159 static struct pool_constant *find_pool_constant PARAMS ((struct function *, rtx));
160 static void mark_constant_pool PARAMS ((void));
161 static void mark_constants PARAMS ((rtx));
162 static int mark_constant PARAMS ((rtx *current_rtx, void *data));
163 static int output_addressed_constants PARAMS ((tree));
164 static unsigned HOST_WIDE_INT array_size_for_constructor PARAMS ((tree));
165 static unsigned min_align PARAMS ((unsigned, unsigned));
166 static void output_constructor PARAMS ((tree, unsigned HOST_WIDE_INT,
168 static void globalize_decl PARAMS ((tree));
169 static void maybe_assemble_visibility PARAMS ((tree));
170 static int in_named_entry_eq PARAMS ((const void *, const void *));
171 static hashval_t in_named_entry_hash PARAMS ((const void *));
172 #ifdef ASM_OUTPUT_BSS
173 static void asm_output_bss PARAMS ((FILE *, tree, const char *,
174 unsigned HOST_WIDE_INT,
175 unsigned HOST_WIDE_INT));
177 #ifdef BSS_SECTION_ASM_OP
178 #ifdef ASM_OUTPUT_ALIGNED_BSS
179 static void asm_output_aligned_bss
180 PARAMS ((FILE *, tree, const char *,
181 unsigned HOST_WIDE_INT, int)) ATTRIBUTE_UNUSED;
183 #endif /* BSS_SECTION_ASM_OP */
184 static bool asm_emit_uninitialised PARAMS ((tree, const char*,
185 unsigned HOST_WIDE_INT,
186 unsigned HOST_WIDE_INT));
187 static void mark_weak PARAMS ((tree));
189 enum in_section { no_section, in_text, in_data, in_named
190 #ifdef BSS_SECTION_ASM_OP
193 #ifdef CTORS_SECTION_ASM_OP
196 #ifdef DTORS_SECTION_ASM_OP
199 #ifdef READONLY_DATA_SECTION_ASM_OP
202 #ifdef EXTRA_SECTIONS
206 static GTY(()) enum in_section in_section = no_section;
208 /* Return a nonzero value if DECL has a section attribute. */
209 #ifndef IN_NAMED_SECTION
210 #define IN_NAMED_SECTION(DECL) \
211 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
212 && DECL_SECTION_NAME (DECL) != NULL_TREE)
215 /* Text of section name when in_section == in_named. */
216 static GTY(()) const char *in_named_name;
218 /* Hash table of flags that have been used for a particular named section. */
220 struct in_named_entry GTY(())
227 static GTY((param_is (struct in_named_entry))) htab_t in_named_htab;
229 /* Define functions like text_section for any extra sections. */
230 #ifdef EXTRA_SECTION_FUNCTIONS
231 EXTRA_SECTION_FUNCTIONS
234 /* Tell assembler to switch to text section. */
239 if (in_section != in_text)
241 in_section = in_text;
245 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
250 /* Tell assembler to switch to data section. */
255 if (in_section != in_data)
257 in_section = in_data;
258 if (flag_shared_data)
260 #ifdef SHARED_SECTION_ASM_OP
261 fprintf (asm_out_file, "%s\n", SHARED_SECTION_ASM_OP);
263 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
267 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
271 /* Tell assembler to switch to read-only data section. This is normally
275 readonly_data_section ()
277 #ifdef READONLY_DATA_SECTION
278 READONLY_DATA_SECTION (); /* Note this can call data_section. */
280 #ifdef READONLY_DATA_SECTION_ASM_OP
281 if (in_section != in_readonly_data)
283 in_section = in_readonly_data;
284 fputs (READONLY_DATA_SECTION_ASM_OP, asm_out_file);
285 fputc ('\n', asm_out_file);
293 /* Determine if we're in the text section. */
298 return in_section == in_text;
301 /* Determine if we're in the data section. */
306 return in_section == in_data;
309 /* Helper routines for maintaining in_named_htab. */
312 in_named_entry_eq (p1, p2)
316 const struct in_named_entry *old = p1;
317 const char *new = p2;
319 return strcmp (old->name, new) == 0;
323 in_named_entry_hash (p)
326 const struct in_named_entry *old = p;
327 return htab_hash_string (old->name);
330 /* If SECTION has been seen before as a named section, return the flags
331 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
332 set of flags for a section to have, so 0 does not mean that the section
333 has not been seen. */
336 get_named_section_flags (section)
339 struct in_named_entry **slot;
341 slot = (struct in_named_entry **)
342 htab_find_slot_with_hash (in_named_htab, section,
343 htab_hash_string (section), NO_INSERT);
345 return slot ? (*slot)->flags : 0;
348 /* Returns true if the section has been declared before. Sets internal
349 flag on this section in in_named_hash so subsequent calls on this
350 section will return false. */
353 named_section_first_declaration (name)
356 struct in_named_entry **slot;
358 slot = (struct in_named_entry **)
359 htab_find_slot_with_hash (in_named_htab, name,
360 htab_hash_string (name), NO_INSERT);
361 if (! (*slot)->declared)
363 (*slot)->declared = true;
373 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
374 different set of flags, return false. */
377 set_named_section_flags (section, flags)
381 struct in_named_entry **slot, *entry;
383 slot = (struct in_named_entry **)
384 htab_find_slot_with_hash (in_named_htab, section,
385 htab_hash_string (section), INSERT);
390 entry = (struct in_named_entry *) ggc_alloc (sizeof (*entry));
392 entry->name = ggc_strdup (section);
393 entry->flags = flags;
394 entry->declared = false;
396 else if (entry->flags != flags)
402 /* Tell assembler to change to section NAME with attributes FLAGS. */
405 named_section_flags (name, flags)
409 if (in_section != in_named || strcmp (name, in_named_name) != 0)
411 if (! set_named_section_flags (name, flags))
414 (*targetm.asm_out.named_section) (name, flags);
416 if (flags & SECTION_FORGET)
417 in_section = no_section;
420 in_named_name = ggc_strdup (name);
421 in_section = in_named;
426 /* Tell assembler to change to section NAME for DECL.
427 If DECL is NULL, just switch to section NAME.
428 If NAME is NULL, get the name from DECL.
429 If RELOC is 1, the initializer for DECL contains relocs. */
432 named_section (decl, name, reloc)
439 if (decl != NULL_TREE && !DECL_P (decl))
442 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
444 flags = (* targetm.section_type_flags) (decl, name, reloc);
446 /* Sanity check user variables for flag changes. Non-user
447 section flag changes will abort in named_section_flags.
448 However, don't complain if SECTION_OVERRIDE is set.
449 We trust that the setter knows that it is safe to ignore
450 the default flags for this decl. */
451 if (decl && ! set_named_section_flags (name, flags))
453 flags = get_named_section_flags (name);
454 if ((flags & SECTION_OVERRIDE) == 0)
455 error_with_decl (decl, "%s causes a section type conflict");
458 named_section_flags (name, flags);
461 /* If required, set DECL_SECTION_NAME to a unique name. */
464 resolve_unique_section (decl, reloc, flag_function_or_data_sections)
466 int reloc ATTRIBUTE_UNUSED;
467 int flag_function_or_data_sections;
469 if (DECL_SECTION_NAME (decl) == NULL_TREE
470 && targetm.have_named_sections
471 && (flag_function_or_data_sections
472 || DECL_ONE_ONLY (decl)))
473 (*targetm.asm_out.unique_section) (decl, reloc);
476 #ifdef BSS_SECTION_ASM_OP
478 /* Tell the assembler to switch to the bss section. */
483 if (in_section != in_bss)
485 #ifdef SHARED_BSS_SECTION_ASM_OP
486 if (flag_shared_data)
487 fprintf (asm_out_file, "%s\n", SHARED_BSS_SECTION_ASM_OP);
490 fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP);
496 #ifdef ASM_OUTPUT_BSS
498 /* Utility function for ASM_OUTPUT_BSS for targets to use if
499 they don't support alignments in .bss.
500 ??? It is believed that this function will work in most cases so such
501 support is localized here. */
504 asm_output_bss (file, decl, name, size, rounded)
506 tree decl ATTRIBUTE_UNUSED;
508 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED, rounded;
510 (*targetm.asm_out.globalize_label) (file, name);
512 #ifdef ASM_DECLARE_OBJECT_NAME
513 last_assemble_variable_decl = decl;
514 ASM_DECLARE_OBJECT_NAME (file, name, decl);
516 /* Standard thing is just output label for the object. */
517 ASM_OUTPUT_LABEL (file, name);
518 #endif /* ASM_DECLARE_OBJECT_NAME */
519 ASM_OUTPUT_SKIP (file, rounded ? rounded : 1);
524 #ifdef ASM_OUTPUT_ALIGNED_BSS
526 /* Utility function for targets to use in implementing
527 ASM_OUTPUT_ALIGNED_BSS.
528 ??? It is believed that this function will work in most cases so such
529 support is localized here. */
532 asm_output_aligned_bss (file, decl, name, size, align)
534 tree decl ATTRIBUTE_UNUSED;
536 unsigned HOST_WIDE_INT size;
540 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
541 #ifdef ASM_DECLARE_OBJECT_NAME
542 last_assemble_variable_decl = decl;
543 ASM_DECLARE_OBJECT_NAME (file, name, decl);
545 /* Standard thing is just output label for the object. */
546 ASM_OUTPUT_LABEL (file, name);
547 #endif /* ASM_DECLARE_OBJECT_NAME */
548 ASM_OUTPUT_SKIP (file, size ? size : 1);
553 #endif /* BSS_SECTION_ASM_OP */
555 /* Switch to the section for function DECL.
557 If DECL is NULL_TREE, switch to the text section.
558 ??? It's not clear that we will ever be passed NULL_TREE, but it's
559 safer to handle it. */
562 function_section (decl)
565 if (decl != NULL_TREE
566 && DECL_SECTION_NAME (decl) != NULL_TREE)
567 named_section (decl, (char *) 0, 0);
572 /* Switch to section for variable DECL. RELOC is the same as the
573 argument to SELECT_SECTION. */
576 variable_section (decl, reloc)
580 if (IN_NAMED_SECTION (decl))
581 named_section (decl, NULL, reloc);
583 (*targetm.asm_out.select_section) (decl, reloc, DECL_ALIGN (decl));
586 /* Tell assembler to switch to the section for string merging. */
589 mergeable_string_section (decl, align, flags)
590 tree decl ATTRIBUTE_UNUSED;
591 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED;
592 unsigned int flags ATTRIBUTE_UNUSED;
594 #ifdef HAVE_GAS_SHF_MERGE
595 if (flag_merge_constants
596 && TREE_CODE (decl) == STRING_CST
597 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
599 && TREE_STRING_LENGTH (decl) >= int_size_in_bytes (TREE_TYPE (decl)))
601 enum machine_mode mode;
602 unsigned int modesize;
607 mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (decl)));
608 modesize = GET_MODE_BITSIZE (mode);
609 if (modesize >= 8 && modesize <= 256
610 && (modesize & (modesize - 1)) == 0)
612 if (align < modesize)
615 str = TREE_STRING_POINTER (decl);
616 len = TREE_STRING_LENGTH (decl);
617 unit = GET_MODE_SIZE (mode);
619 /* Check for embedded NUL characters. */
620 for (i = 0; i < len; i += unit)
622 for (j = 0; j < unit; j++)
623 if (str[i + j] != '\0')
630 sprintf (name, ".rodata.str%d.%d", modesize / 8,
632 flags |= (modesize / 8) | SECTION_MERGE | SECTION_STRINGS;
633 if (!i && modesize < align)
635 /* A "" string with requested alignment greater than
636 character size might cause a problem:
637 if some other string required even bigger
638 alignment than "", then linker might think the
639 "" is just part of padding after some other string
640 and not put it into the hash table initially.
641 But this means "" could have smaller alignment
643 #ifdef ASM_OUTPUT_SECTION_START
644 named_section_flags (name, flags);
645 ASM_OUTPUT_SECTION_START (asm_out_file);
647 readonly_data_section ();
652 named_section_flags (name, flags);
658 readonly_data_section ();
661 /* Tell assembler to switch to the section for constant merging. */
664 mergeable_constant_section (mode, align, flags)
665 enum machine_mode mode ATTRIBUTE_UNUSED;
666 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED;
667 unsigned int flags ATTRIBUTE_UNUSED;
669 #ifdef HAVE_GAS_SHF_MERGE
670 unsigned int modesize = GET_MODE_BITSIZE (mode);
672 if (flag_merge_constants
678 && (align & (align - 1)) == 0)
682 sprintf (name, ".rodata.cst%d", (int) (align / 8));
683 flags |= (align / 8) | SECTION_MERGE;
684 named_section_flags (name, flags);
688 readonly_data_section ();
691 /* Given NAME, a putative register name, discard any customary prefixes. */
694 strip_reg_name (name)
697 #ifdef REGISTER_PREFIX
698 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
699 name += strlen (REGISTER_PREFIX);
701 if (name[0] == '%' || name[0] == '#')
706 /* Decode an `asm' spec for a declaration as a register name.
707 Return the register number, or -1 if nothing specified,
708 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
709 or -3 if ASMSPEC is `cc' and is not recognized,
710 or -4 if ASMSPEC is `memory' and is not recognized.
711 Accept an exact spelling or a decimal number.
712 Prefixes such as % are optional. */
715 decode_reg_name (asmspec)
722 /* Get rid of confusing prefixes. */
723 asmspec = strip_reg_name (asmspec);
725 /* Allow a decimal number as a "register name". */
726 for (i = strlen (asmspec) - 1; i >= 0; i--)
727 if (! ISDIGIT (asmspec[i]))
729 if (asmspec[0] != 0 && i < 0)
732 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
738 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
740 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
743 #ifdef ADDITIONAL_REGISTER_NAMES
745 static const struct { const char *const name; const int number; } table[]
746 = ADDITIONAL_REGISTER_NAMES;
748 for (i = 0; i < (int) ARRAY_SIZE (table); i++)
749 if (! strcmp (asmspec, table[i].name))
750 return table[i].number;
752 #endif /* ADDITIONAL_REGISTER_NAMES */
754 if (!strcmp (asmspec, "memory"))
757 if (!strcmp (asmspec, "cc"))
766 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
767 have static storage duration. In other words, it should not be an
768 automatic variable, including PARM_DECLs.
770 There is, however, one exception: this function handles variables
771 explicitly placed in a particular register by the user.
773 ASMSPEC, if not 0, is the string which the user specified as the
774 assembler symbol name.
776 This is never called for PARM_DECL nodes. */
779 make_decl_rtl (decl, asmspec)
783 int top_level = (DECL_CONTEXT (decl) == NULL_TREE);
784 const char *name = 0;
785 const char *new_name = 0;
789 /* Check that we are not being given an automatic variable. */
790 /* A weak alias has TREE_PUBLIC set but not the other bits. */
791 if (TREE_CODE (decl) == PARM_DECL
792 || TREE_CODE (decl) == RESULT_DECL
793 || (TREE_CODE (decl) == VAR_DECL
794 && !TREE_STATIC (decl)
795 && !TREE_PUBLIC (decl)
796 && !DECL_EXTERNAL (decl)
797 && !DECL_REGISTER (decl)))
799 /* And that we were not given a type or a label. */
800 else if (TREE_CODE (decl) == TYPE_DECL
801 || TREE_CODE (decl) == LABEL_DECL)
804 /* For a duplicate declaration, we can be called twice on the
805 same DECL node. Don't discard the RTL already made. */
806 if (DECL_RTL_SET_P (decl))
808 /* If the old RTL had the wrong mode, fix the mode. */
809 if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
810 SET_DECL_RTL (decl, adjust_address_nv (DECL_RTL (decl),
811 DECL_MODE (decl), 0));
813 /* ??? Another way to do this would be to maintain a hashed
814 table of such critters. Instead of adding stuff to a DECL
815 to give certain attributes to it, we could use an external
816 hash map from DECL to set of attributes. */
818 /* Let the target reassign the RTL if it wants.
819 This is necessary, for example, when one machine specific
820 decl attribute overrides another. */
821 (* targetm.encode_section_info) (decl, DECL_RTL (decl), false);
825 new_name = name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
827 reg_number = decode_reg_name (asmspec);
828 if (reg_number == -2)
830 /* ASMSPEC is given, and not the name of a register. Mark the
831 name with a star so assemble_name won't munge it. */
832 char *starred = alloca (strlen (asmspec) + 2);
834 strcpy (starred + 1, asmspec);
838 if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
840 /* First detect errors in declaring global registers. */
841 if (reg_number == -1)
842 error_with_decl (decl, "register name not specified for `%s'");
843 else if (reg_number < 0)
844 error_with_decl (decl, "invalid register name for `%s'");
845 else if (TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
846 error_with_decl (decl,
847 "data type of `%s' isn't suitable for a register");
848 else if (! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl))))
849 error_with_decl (decl,
850 "register specified for `%s' isn't suitable for data type");
851 /* Now handle properly declared static register variables. */
856 if (DECL_INITIAL (decl) != 0 && TREE_STATIC (decl))
858 DECL_INITIAL (decl) = 0;
859 error ("global register variable has initial value");
861 if (TREE_THIS_VOLATILE (decl))
862 warning ("volatile register variables don't work as you might wish");
864 /* If the user specified one of the eliminables registers here,
865 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
866 confused with that register and be eliminated. This usage is
867 somewhat suspect... */
869 SET_DECL_RTL (decl, gen_rtx_raw_REG (DECL_MODE (decl), reg_number));
870 ORIGINAL_REGNO (DECL_RTL (decl)) = reg_number;
871 REG_USERVAR_P (DECL_RTL (decl)) = 1;
873 if (TREE_STATIC (decl))
875 /* Make this register global, so not usable for anything
877 #ifdef ASM_DECLARE_REGISTER_GLOBAL
878 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name);
880 nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl));
882 globalize_reg (reg_number + --nregs);
885 /* As a register variable, it has no section. */
890 /* Now handle ordinary static variables and functions (in memory).
891 Also handle vars declared register invalidly. */
893 if (reg_number >= 0 || reg_number == -3)
894 error_with_decl (decl,
895 "register name given for non-register variable `%s'");
897 /* Specifying a section attribute on a variable forces it into a
898 non-.bss section, and thus it cannot be common. */
899 if (TREE_CODE (decl) == VAR_DECL
900 && DECL_SECTION_NAME (decl) != NULL_TREE
901 && DECL_INITIAL (decl) == NULL_TREE
902 && DECL_COMMON (decl))
903 DECL_COMMON (decl) = 0;
905 /* Variables can't be both common and weak. */
906 if (TREE_CODE (decl) == VAR_DECL && DECL_WEAK (decl))
907 DECL_COMMON (decl) = 0;
909 /* Can't use just the variable's own name for a variable
910 whose scope is less than the whole file, unless it's a member
911 of a local class (which will already be unambiguous).
912 Concatenate a distinguishing number. */
913 if (!top_level && !TREE_PUBLIC (decl)
914 && ! (DECL_CONTEXT (decl) && TYPE_P (DECL_CONTEXT (decl)))
916 && name == IDENTIFIER_POINTER (DECL_NAME (decl)))
920 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
925 if (name != new_name)
927 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (new_name));
928 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
931 x = gen_rtx_SYMBOL_REF (Pmode, name);
932 SYMBOL_REF_WEAK (x) = DECL_WEAK (decl);
933 SYMBOL_REF_DECL (x) = decl;
935 x = gen_rtx_MEM (DECL_MODE (decl), x);
936 if (TREE_CODE (decl) != FUNCTION_DECL)
937 set_mem_attributes (x, decl, 1);
938 SET_DECL_RTL (decl, x);
940 /* Optionally set flags or add text to the name to record information
941 such as that it is a function name.
942 If the name is changed, the macro ASM_OUTPUT_LABELREF
943 will have to know how to strip this information. */
944 (* targetm.encode_section_info) (decl, DECL_RTL (decl), true);
947 /* Make the rtl for variable VAR be volatile.
948 Use this only for static variables. */
951 make_var_volatile (var)
954 if (GET_CODE (DECL_RTL (var)) != MEM)
957 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
960 /* Output a string of literal assembler code
961 for an `asm' keyword used between functions. */
964 assemble_asm (string)
969 if (TREE_CODE (string) == ADDR_EXPR)
970 string = TREE_OPERAND (string, 0);
972 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
975 /* Record an element in the table of global destructors. SYMBOL is
976 a SYMBOL_REF of the function to be called; PRIORITY is a number
977 between 0 and MAX_INIT_PRIORITY. */
980 default_stabs_asm_out_destructor (symbol, priority)
982 int priority ATTRIBUTE_UNUSED;
984 /* Tell GNU LD that this is part of the static destructor set.
985 This will work for any system that uses stabs, most usefully
987 fprintf (asm_out_file, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
988 assemble_name (asm_out_file, XSTR (symbol, 0));
989 fputc ('\n', asm_out_file);
993 default_named_section_asm_out_destructor (symbol, priority)
997 const char *section = ".dtors";
1000 /* ??? This only works reliably with the GNU linker. */
1001 if (priority != DEFAULT_INIT_PRIORITY)
1003 sprintf (buf, ".dtors.%.5u",
1004 /* Invert the numbering so the linker puts us in the proper
1005 order; constructors are run from right to left, and the
1006 linker sorts in increasing order. */
1007 MAX_INIT_PRIORITY - priority);
1011 named_section_flags (section, SECTION_WRITE);
1012 assemble_align (POINTER_SIZE);
1013 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1016 #ifdef DTORS_SECTION_ASM_OP
1020 if (in_section != in_dtors)
1022 in_section = in_dtors;
1023 fputs (DTORS_SECTION_ASM_OP, asm_out_file);
1024 fputc ('\n', asm_out_file);
1029 default_dtor_section_asm_out_destructor (symbol, priority)
1031 int priority ATTRIBUTE_UNUSED;
1034 assemble_align (POINTER_SIZE);
1035 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1039 /* Likewise for global constructors. */
1042 default_stabs_asm_out_constructor (symbol, priority)
1044 int priority ATTRIBUTE_UNUSED;
1046 /* Tell GNU LD that this is part of the static destructor set.
1047 This will work for any system that uses stabs, most usefully
1049 fprintf (asm_out_file, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
1050 assemble_name (asm_out_file, XSTR (symbol, 0));
1051 fputc ('\n', asm_out_file);
1055 default_named_section_asm_out_constructor (symbol, priority)
1059 const char *section = ".ctors";
1062 /* ??? This only works reliably with the GNU linker. */
1063 if (priority != DEFAULT_INIT_PRIORITY)
1065 sprintf (buf, ".ctors.%.5u",
1066 /* Invert the numbering so the linker puts us in the proper
1067 order; constructors are run from right to left, and the
1068 linker sorts in increasing order. */
1069 MAX_INIT_PRIORITY - priority);
1073 named_section_flags (section, SECTION_WRITE);
1074 assemble_align (POINTER_SIZE);
1075 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1078 #ifdef CTORS_SECTION_ASM_OP
1082 if (in_section != in_ctors)
1084 in_section = in_ctors;
1085 fputs (CTORS_SECTION_ASM_OP, asm_out_file);
1086 fputc ('\n', asm_out_file);
1091 default_ctor_section_asm_out_constructor (symbol, priority)
1093 int priority ATTRIBUTE_UNUSED;
1096 assemble_align (POINTER_SIZE);
1097 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1101 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1102 a nonzero value if the constant pool should be output before the
1103 start of the function, or a zero value if the pool should output
1104 after the end of the function. The default is to put it before the
1107 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1108 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1111 /* Output assembler code for the constant pool of a function and associated
1112 with defining the name of the function. DECL describes the function.
1113 NAME is the function's name. For the constant pool, we use the current
1114 constant pool data. */
1117 assemble_start_function (decl, fnname)
1123 /* The following code does not need preprocessing in the assembler. */
1127 if (CONSTANT_POOL_BEFORE_FUNCTION)
1128 output_constant_pool (fnname, decl);
1130 resolve_unique_section (decl, 0, flag_function_sections);
1131 function_section (decl);
1133 /* Tell assembler to move to target machine's alignment for functions. */
1134 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1135 if (align < force_align_functions_log)
1136 align = force_align_functions_log;
1139 ASM_OUTPUT_ALIGN (asm_out_file, align);
1142 /* Handle a user-specified function alignment.
1143 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1144 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1145 if (align_functions_log > align
1146 && cfun->function_frequency != FUNCTION_FREQUENCY_UNLIKELY_EXECUTED)
1148 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1149 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file,
1150 align_functions_log, align_functions - 1);
1152 ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
1156 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1157 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
1160 (*debug_hooks->begin_function) (decl);
1162 /* Make function name accessible from other files, if appropriate. */
1164 if (TREE_PUBLIC (decl))
1166 if (! first_global_object_name)
1171 p = (* targetm.strip_name_encoding) (fnname);
1174 if (! DECL_WEAK (decl) && ! DECL_ONE_ONLY (decl))
1175 first_global_object_name = name;
1177 weak_global_object_name = name;
1180 globalize_decl (decl);
1182 maybe_assemble_visibility (decl);
1185 /* Do any machine/system dependent processing of the function name */
1186 #ifdef ASM_DECLARE_FUNCTION_NAME
1187 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
1189 /* Standard thing is just output label for the function. */
1190 ASM_OUTPUT_LABEL (asm_out_file, fnname);
1191 #endif /* ASM_DECLARE_FUNCTION_NAME */
1194 /* Output assembler code associated with defining the size of the
1195 function. DECL describes the function. NAME is the function's name. */
1198 assemble_end_function (decl, fnname)
1202 #ifdef ASM_DECLARE_FUNCTION_SIZE
1203 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1205 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1207 output_constant_pool (fnname, decl);
1208 function_section (decl); /* need to switch back */
1212 /* Assemble code to leave SIZE bytes of zeros. */
1215 assemble_zeros (size)
1216 unsigned HOST_WIDE_INT size;
1218 /* Do no output if -fsyntax-only. */
1219 if (flag_syntax_only)
1222 #ifdef ASM_NO_SKIP_IN_TEXT
1223 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1224 so we must output 0s explicitly in the text section. */
1225 if (ASM_NO_SKIP_IN_TEXT && in_text_section ())
1227 unsigned HOST_WIDE_INT i;
1228 for (i = 0; i < size; i++)
1229 assemble_integer (const0_rtx, 1, BITS_PER_UNIT, 1);
1234 ASM_OUTPUT_SKIP (asm_out_file, size);
1237 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1240 assemble_align (align)
1243 if (align > BITS_PER_UNIT)
1245 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1249 /* Assemble a string constant with the specified C string as contents. */
1252 assemble_string (p, size)
1259 /* If the string is very long, split it up. */
1263 int thissize = size - pos;
1264 if (thissize > maximum)
1267 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1275 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1276 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1277 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1279 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1280 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1281 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1283 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1284 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1288 #if defined ASM_OUTPUT_ALIGNED_BSS
1289 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1290 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1292 #if defined ASM_OUTPUT_BSS
1293 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1294 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1300 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1301 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1302 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1304 #if defined ASM_OUTPUT_ALIGNED_COMMON
1305 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1306 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1308 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1309 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1314 asm_emit_uninitialised (decl, name, size, rounded)
1317 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED;
1318 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED;
1326 destination = asm_dest_local;
1328 /* ??? We should handle .bss via select_section mechanisms rather than
1329 via special target hooks. That would eliminate this special case. */
1330 if (TREE_PUBLIC (decl))
1332 if (!DECL_COMMON (decl))
1334 destination = asm_dest_bss;
1339 destination = asm_dest_common;
1342 if (destination == asm_dest_bss)
1343 globalize_decl (decl);
1344 resolve_unique_section (decl, 0, flag_data_sections);
1346 if (flag_shared_data)
1348 switch (destination)
1350 #ifdef ASM_OUTPUT_SHARED_BSS
1352 ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded);
1355 #ifdef ASM_OUTPUT_SHARED_COMMON
1356 case asm_dest_common:
1357 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1360 #ifdef ASM_OUTPUT_SHARED_LOCAL
1361 case asm_dest_local:
1362 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1370 switch (destination)
1374 ASM_EMIT_BSS (decl, name, size, rounded);
1377 case asm_dest_common:
1378 ASM_EMIT_COMMON (decl, name, size, rounded);
1380 case asm_dest_local:
1381 ASM_EMIT_LOCAL (decl, name, size, rounded);
1390 /* Assemble everything that is needed for a variable or function declaration.
1391 Not used for automatic variables, and not used for function definitions.
1392 Should not be called for variables of incomplete structure type.
1394 TOP_LEVEL is nonzero if this variable has file scope.
1395 AT_END is nonzero if this is the special handling, at end of compilation,
1396 to define things that have had only tentative definitions.
1397 DONT_OUTPUT_DATA if nonzero means don't actually output the
1398 initial value (that will be done by the caller). */
1401 assemble_variable (decl, top_level, at_end, dont_output_data)
1403 int top_level ATTRIBUTE_UNUSED;
1404 int at_end ATTRIBUTE_UNUSED;
1405 int dont_output_data;
1412 if (lang_hooks.decls.prepare_assemble_variable)
1413 (*lang_hooks.decls.prepare_assemble_variable) (decl);
1415 last_assemble_variable_decl = 0;
1417 /* Normally no need to say anything here for external references,
1418 since assemble_external is called by the language-specific code
1419 when a declaration is first seen. */
1421 if (DECL_EXTERNAL (decl))
1424 /* Output no assembler code for a function declaration.
1425 Only definitions of functions output anything. */
1427 if (TREE_CODE (decl) == FUNCTION_DECL)
1430 /* Do nothing for global register variables. */
1431 if (DECL_RTL_SET_P (decl) && GET_CODE (DECL_RTL (decl)) == REG)
1433 TREE_ASM_WRITTEN (decl) = 1;
1437 /* If type was incomplete when the variable was declared,
1438 see if it is complete now. */
1440 if (DECL_SIZE (decl) == 0)
1441 layout_decl (decl, 0);
1443 /* Still incomplete => don't allocate it; treat the tentative defn
1444 (which is what it must have been) as an `extern' reference. */
1446 if (!dont_output_data && DECL_SIZE (decl) == 0)
1448 error ("%Hstorage size of `%s' isn't known",
1449 &DECL_SOURCE_LOCATION (decl),
1450 IDENTIFIER_POINTER (DECL_NAME (decl)));
1451 TREE_ASM_WRITTEN (decl) = 1;
1455 /* The first declaration of a variable that comes through this function
1456 decides whether it is global (in C, has external linkage)
1457 or local (in C, has internal linkage). So do nothing more
1458 if this function has already run. */
1460 if (TREE_ASM_WRITTEN (decl))
1463 /* Make sure targetm.encode_section_info is invoked before we set
1465 decl_rtl = DECL_RTL (decl);
1467 TREE_ASM_WRITTEN (decl) = 1;
1469 /* Do no output if -fsyntax-only. */
1470 if (flag_syntax_only)
1475 if (! dont_output_data
1476 && ! host_integerp (DECL_SIZE_UNIT (decl), 1))
1478 error_with_decl (decl, "size of variable `%s' is too large");
1482 name = XSTR (XEXP (decl_rtl, 0), 0);
1483 if (TREE_PUBLIC (decl) && DECL_NAME (decl)
1484 && ! first_global_object_name
1485 && ! (DECL_COMMON (decl) && (DECL_INITIAL (decl) == 0
1486 || DECL_INITIAL (decl) == error_mark_node))
1487 && ! DECL_WEAK (decl)
1488 && ! DECL_ONE_ONLY (decl))
1493 p = (* targetm.strip_name_encoding) (name);
1494 xname = xstrdup (p);
1495 first_global_object_name = xname;
1498 /* Compute the alignment of this data. */
1500 align = DECL_ALIGN (decl);
1502 /* In the case for initialing an array whose length isn't specified,
1503 where we have not yet been able to do the layout,
1504 figure out the proper alignment now. */
1505 if (dont_output_data && DECL_SIZE (decl) == 0
1506 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1507 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1509 /* Some object file formats have a maximum alignment which they support.
1510 In particular, a.out format supports a maximum alignment of 4. */
1511 #ifndef MAX_OFILE_ALIGNMENT
1512 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1514 if (align > MAX_OFILE_ALIGNMENT)
1516 warning_with_decl (decl,
1517 "alignment of `%s' is greater than maximum object file alignment. Using %d",
1518 MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
1519 align = MAX_OFILE_ALIGNMENT;
1522 /* On some machines, it is good to increase alignment sometimes. */
1523 if (! DECL_USER_ALIGN (decl))
1525 #ifdef DATA_ALIGNMENT
1526 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1528 #ifdef CONSTANT_ALIGNMENT
1529 if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node)
1530 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1534 /* Reset the alignment in case we have made it tighter, so we can benefit
1535 from it in get_pointer_alignment. */
1536 DECL_ALIGN (decl) = align;
1537 set_mem_align (decl_rtl, align);
1539 if (TREE_PUBLIC (decl))
1540 maybe_assemble_visibility (decl);
1542 /* Output any data that we will need to use the address of. */
1543 if (DECL_INITIAL (decl) == error_mark_node)
1544 reloc = contains_pointers_p (TREE_TYPE (decl)) ? 3 : 0;
1545 else if (DECL_INITIAL (decl))
1546 reloc = output_addressed_constants (DECL_INITIAL (decl));
1547 resolve_unique_section (decl, reloc, flag_data_sections);
1549 /* Handle uninitialized definitions. */
1551 /* If the decl has been given an explicit section name, then it
1552 isn't common, and shouldn't be handled as such. */
1553 if (DECL_SECTION_NAME (decl) || dont_output_data)
1555 /* We don't implement common thread-local data at present. */
1556 else if (DECL_THREAD_LOCAL (decl))
1558 if (DECL_COMMON (decl))
1559 sorry ("thread-local COMMON data not implemented");
1561 else if (DECL_INITIAL (decl) == 0
1562 || DECL_INITIAL (decl) == error_mark_node
1563 || (flag_zero_initialized_in_bss
1564 /* Leave constant zeroes in .rodata so they can be shared. */
1565 && !TREE_READONLY (decl)
1566 && initializer_zerop (DECL_INITIAL (decl))))
1568 unsigned HOST_WIDE_INT size = tree_low_cst (DECL_SIZE_UNIT (decl), 1);
1569 unsigned HOST_WIDE_INT rounded = size;
1571 /* Don't allocate zero bytes of common,
1572 since that means "undefined external" in the linker. */
1576 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1577 so that each uninitialized object starts on such a boundary. */
1578 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1579 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1580 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1582 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1583 if ((unsigned HOST_WIDE_INT) DECL_ALIGN (decl) / BITS_PER_UNIT > rounded)
1585 (decl, "requested alignment for %s is greater than implemented alignment of %d",rounded);
1588 /* If the target cannot output uninitialized but not common global data
1589 in .bss, then we have to use .data, so fall through. */
1590 if (asm_emit_uninitialised (decl, name, size, rounded))
1594 /* Handle initialized definitions.
1595 Also handle uninitialized global definitions if -fno-common and the
1596 target doesn't support ASM_OUTPUT_BSS. */
1598 /* First make the assembler name(s) global if appropriate. */
1599 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1600 globalize_decl (decl);
1602 /* Switch to the appropriate section. */
1603 variable_section (decl, reloc);
1605 /* dbxout.c needs to know this. */
1606 if (in_text_section ())
1607 DECL_IN_TEXT_SECTION (decl) = 1;
1609 /* Output the alignment of this data. */
1610 if (align > BITS_PER_UNIT)
1612 ASM_OUTPUT_ALIGN (asm_out_file,
1613 floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT));
1616 /* Do any machine/system dependent processing of the object. */
1617 #ifdef ASM_DECLARE_OBJECT_NAME
1618 last_assemble_variable_decl = decl;
1619 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1621 /* Standard thing is just output label for the object. */
1622 ASM_OUTPUT_LABEL (asm_out_file, name);
1623 #endif /* ASM_DECLARE_OBJECT_NAME */
1625 if (!dont_output_data)
1627 if (DECL_INITIAL (decl) && DECL_INITIAL (decl) != error_mark_node)
1628 /* Output the actual data. */
1629 output_constant (DECL_INITIAL (decl),
1630 tree_low_cst (DECL_SIZE_UNIT (decl), 1),
1633 /* Leave space for it. */
1634 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl), 1));
1638 /* Return 1 if type TYPE contains any pointers. */
1641 contains_pointers_p (type)
1644 switch (TREE_CODE (type))
1647 case REFERENCE_TYPE:
1648 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1649 so I'll play safe and return 1. */
1655 case QUAL_UNION_TYPE:
1658 /* For a type that has fields, see if the fields have pointers. */
1659 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1660 if (TREE_CODE (fields) == FIELD_DECL
1661 && contains_pointers_p (TREE_TYPE (fields)))
1667 /* An array type contains pointers if its element type does. */
1668 return contains_pointers_p (TREE_TYPE (type));
1675 /* Output something to declare an external symbol to the assembler.
1676 (Most assemblers don't need this, so we normally output nothing.)
1677 Do nothing if DECL is not external. */
1680 assemble_external (decl)
1681 tree decl ATTRIBUTE_UNUSED;
1683 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1684 main body of this code is only rarely exercised. To provide some
1685 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1686 open. If it's not, we should not be calling this function. */
1690 #ifdef ASM_OUTPUT_EXTERNAL
1691 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1693 rtx rtl = DECL_RTL (decl);
1695 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1696 && ! SYMBOL_REF_USED (XEXP (rtl, 0)))
1698 /* Some systems do require some output. */
1699 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1700 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1706 /* Similar, for calling a library function FUN. */
1709 assemble_external_libcall (fun)
1710 rtx fun ATTRIBUTE_UNUSED;
1712 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1713 /* Declare library function name external when first used, if nec. */
1714 if (! SYMBOL_REF_USED (fun))
1716 SYMBOL_REF_USED (fun) = 1;
1717 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun);
1722 /* Assemble a label named NAME. */
1725 assemble_label (name)
1728 ASM_OUTPUT_LABEL (asm_out_file, name);
1731 /* Set the symbol_referenced flag for ID and notify callgraph code. */
1733 mark_referenced (id)
1736 if (!TREE_SYMBOL_REFERENCED (id))
1738 struct cgraph_node *node;
1739 struct cgraph_varpool_node *vnode;
1741 if (!cgraph_global_info_ready)
1743 node = cgraph_node_for_identifier (id);
1745 cgraph_mark_needed_node (node, 1);
1748 vnode = cgraph_varpool_node_for_identifier (id);
1750 cgraph_varpool_mark_needed_node (vnode);
1752 TREE_SYMBOL_REFERENCED (id) = 1;
1755 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1756 If NAME starts with a *, the rest of NAME is output verbatim.
1757 Otherwise NAME is transformed in an implementation-defined way
1758 (usually by the addition of an underscore).
1759 Many macros in the tm file are defined to call this function. */
1762 assemble_name (file, name)
1766 const char *real_name;
1769 real_name = (* targetm.strip_name_encoding) (name);
1771 id = maybe_get_identifier (real_name);
1773 mark_referenced (id);
1776 fputs (&name[1], file);
1778 ASM_OUTPUT_LABELREF (file, name);
1781 /* Allocate SIZE bytes writable static space with a gensym name
1782 and return an RTX to refer to its address. */
1785 assemble_static_space (size)
1786 unsigned HOST_WIDE_INT size;
1789 const char *namestring;
1793 if (flag_shared_data)
1797 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1799 namestring = ggc_strdup (name);
1801 x = gen_rtx_SYMBOL_REF (Pmode, namestring);
1802 SYMBOL_REF_FLAGS (x) = SYMBOL_FLAG_LOCAL;
1804 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1805 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
1808 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1809 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1812 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1813 so that each uninitialized object starts on such a boundary. */
1814 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1815 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1816 = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1817 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1818 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1819 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1826 /* Assemble the static constant template for function entry trampolines.
1827 This is done at most once per compilation.
1828 Returns an RTX for the address of the template. */
1830 #ifdef TRAMPOLINE_TEMPLATE
1832 assemble_trampoline_template ()
1839 /* By default, put trampoline templates in read-only data section. */
1841 #ifdef TRAMPOLINE_SECTION
1842 TRAMPOLINE_SECTION ();
1844 readonly_data_section ();
1847 /* Write the assembler code to define one. */
1848 align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
1851 ASM_OUTPUT_ALIGN (asm_out_file, align);
1854 (*targetm.asm_out.internal_label) (asm_out_file, "LTRAMP", 0);
1855 TRAMPOLINE_TEMPLATE (asm_out_file);
1857 /* Record the rtl to refer to it. */
1858 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1859 name = ggc_strdup (label);
1860 symbol = gen_rtx_SYMBOL_REF (Pmode, name);
1861 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
1867 /* A and B are either alignments or offsets. Return the minimum alignment
1868 that may be assumed after adding the two together. */
1870 static inline unsigned
1874 return (a | b) & -(a | b);
1877 /* Return the assembler directive for creating a given kind of integer
1878 object. SIZE is the number of bytes in the object and ALIGNED_P
1879 indicates whether it is known to be aligned. Return NULL if the
1880 assembly dialect has no such directive.
1882 The returned string should be printed at the start of a new line and
1883 be followed immediately by the object's initial value. */
1886 integer_asm_op (size, aligned_p)
1890 struct asm_int_op *ops;
1893 ops = &targetm.asm_out.aligned_op;
1895 ops = &targetm.asm_out.unaligned_op;
1900 return targetm.asm_out.byte_op;
1914 /* Use directive OP to assemble an integer object X. Print OP at the
1915 start of the line, followed immediately by the value of X. */
1918 assemble_integer_with_op (op, x)
1922 fputs (op, asm_out_file);
1923 output_addr_const (asm_out_file, x);
1924 fputc ('\n', asm_out_file);
1927 /* The default implementation of the asm_out.integer target hook. */
1930 default_assemble_integer (x, size, aligned_p)
1931 rtx x ATTRIBUTE_UNUSED;
1932 unsigned int size ATTRIBUTE_UNUSED;
1933 int aligned_p ATTRIBUTE_UNUSED;
1935 const char *op = integer_asm_op (size, aligned_p);
1936 return op && (assemble_integer_with_op (op, x), true);
1939 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1940 the alignment of the integer in bits. Return 1 if we were able to output
1941 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1945 assemble_integer (x, size, align, force)
1953 aligned_p = (align >= MIN (size * BITS_PER_UNIT, BIGGEST_ALIGNMENT));
1955 /* See if the target hook can handle this kind of object. */
1956 if ((*targetm.asm_out.integer) (x, size, aligned_p))
1959 /* If the object is a multi-byte one, try splitting it up. Split
1960 it into words it if is multi-word, otherwise split it into bytes. */
1963 enum machine_mode omode, imode;
1964 unsigned int subalign;
1965 unsigned int subsize, i;
1967 subsize = size > UNITS_PER_WORD? UNITS_PER_WORD : 1;
1968 subalign = MIN (align, subsize * BITS_PER_UNIT);
1969 omode = mode_for_size (subsize * BITS_PER_UNIT, MODE_INT, 0);
1970 imode = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1972 for (i = 0; i < size; i += subsize)
1974 rtx partial = simplify_subreg (omode, x, imode, i);
1975 if (!partial || !assemble_integer (partial, subsize, subalign, 0))
1981 /* If we've printed some of it, but not all of it, there's no going
1994 assemble_real (d, mode, align)
1996 enum machine_mode mode;
2001 unsigned int nalign = min_align (align, 32);
2003 switch (BITS_PER_UNIT)
2009 REAL_VALUE_TO_TARGET_SINGLE (d, l);
2010 assemble_integer (GEN_INT (l), 4, align, 1);
2013 REAL_VALUE_TO_TARGET_DOUBLE (d, data);
2014 assemble_integer (GEN_INT (data[0]), 4, align, 1);
2015 assemble_integer (GEN_INT (data[1]), 4, nalign, 1);
2018 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d, data);
2019 assemble_integer (GEN_INT (data[0]), 4, align, 1);
2020 assemble_integer (GEN_INT (data[1]), 4, nalign, 1);
2021 assemble_integer (GEN_INT (data[2]), 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);
2028 assemble_integer (GEN_INT (data[3]), 4, nalign, 1);
2039 REAL_VALUE_TO_TARGET_SINGLE (d, l);
2040 assemble_integer (GEN_INT (l), 2, align, 1);
2043 REAL_VALUE_TO_TARGET_DOUBLE (d, data);
2044 assemble_integer (GEN_INT (data[0]), 2, align, 1);
2045 assemble_integer (GEN_INT (data[1]), 1, nalign, 1);
2056 REAL_VALUE_TO_TARGET_SINGLE (d, l);
2057 assemble_integer (GEN_INT (l), 1, align, 1);
2060 REAL_VALUE_TO_TARGET_DOUBLE (d, data);
2061 assemble_integer (GEN_INT (data[0]), 1, align, 1);
2062 assemble_integer (GEN_INT (data[1]), 1, nalign, 1);
2074 /* Given an expression EXP with a constant value,
2075 reduce it to the sum of an assembler symbol and an integer.
2076 Store them both in the structure *VALUE.
2077 Abort if EXP does not reduce. */
2079 struct addr_const GTY(())
2082 HOST_WIDE_INT offset;
2086 decode_addr_const (exp, value)
2088 struct addr_const *value;
2090 tree target = TREE_OPERAND (exp, 0);
2096 if (TREE_CODE (target) == COMPONENT_REF
2097 && host_integerp (byte_position (TREE_OPERAND (target, 1)), 0))
2100 offset += int_byte_position (TREE_OPERAND (target, 1));
2101 target = TREE_OPERAND (target, 0);
2103 else if (TREE_CODE (target) == ARRAY_REF
2104 || TREE_CODE (target) == ARRAY_RANGE_REF)
2106 offset += (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target)), 1)
2107 * tree_low_cst (TREE_OPERAND (target, 1), 0));
2108 target = TREE_OPERAND (target, 0);
2114 switch (TREE_CODE (target))
2118 x = DECL_RTL (target);
2122 x = gen_rtx_MEM (FUNCTION_MODE,
2123 gen_rtx_LABEL_REF (VOIDmode, force_label_rtx (target)));
2131 x = output_constant_def (target, 1);
2138 if (GET_CODE (x) != MEM)
2143 value->offset = offset;
2146 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2147 enum kind { RTX_UNKNOWN, RTX_DOUBLE, RTX_VECTOR, RTX_INT, RTX_UNSPEC };
2148 struct rtx_const GTY(())
2150 ENUM_BITFIELD(kind) kind : 16;
2151 ENUM_BITFIELD(machine_mode) mode : 16;
2152 union rtx_const_un {
2153 REAL_VALUE_TYPE GTY ((tag ("4"))) du;
2154 struct rtx_const_u_addr {
2157 HOST_WIDE_INT offset;
2158 } GTY ((tag ("1"))) addr;
2159 struct rtx_const_u_di {
2162 } GTY ((tag ("0"))) di;
2164 /* The max vector size we have is 16 wide; two variants for
2165 integral and floating point vectors. */
2166 struct rtx_const_int_vec {
2169 } GTY ((tag ("2"))) int_vec[16];
2171 REAL_VALUE_TYPE GTY ((tag ("3"))) fp_vec[8];
2173 } GTY ((desc ("%1.kind >= RTX_INT"), descbits ("1"))) un;
2176 /* Uniquize all constants that appear in memory.
2177 Each constant in memory thus far output is recorded
2178 in `const_hash_table'. */
2180 struct constant_descriptor_tree GTY(())
2182 /* A MEM for the constant. */
2185 /* The value of the constant. */
2189 static GTY((param_is (struct constant_descriptor_tree)))
2190 htab_t const_desc_htab;
2192 static struct constant_descriptor_tree * build_constant_desc PARAMS ((tree));
2193 static void maybe_output_constant_def_contents
2194 PARAMS ((struct constant_descriptor_tree *, int));
2196 /* Compute a hash code for a constant expression. */
2199 const_desc_hash (ptr)
2202 return const_hash_1 (((struct constant_descriptor_tree *)ptr)->value);
2212 enum tree_code code = TREE_CODE (exp);
2214 /* Either set P and LEN to the address and len of something to hash and
2215 exit the switch or return a value. */
2220 p = (char *) &TREE_INT_CST (exp);
2221 len = sizeof TREE_INT_CST (exp);
2225 return real_hash (TREE_REAL_CST_PTR (exp));
2228 p = TREE_STRING_POINTER (exp);
2229 len = TREE_STRING_LENGTH (exp);
2232 return (const_hash_1 (TREE_REALPART (exp)) * 5
2233 + const_hash_1 (TREE_IMAGPART (exp)));
2236 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2240 len = int_size_in_bytes (TREE_TYPE (exp));
2241 tmp = (char *) alloca (len);
2242 get_set_constructor_bytes (exp, (unsigned char *) tmp, len);
2250 hi = 5 + int_size_in_bytes (TREE_TYPE (exp));
2252 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2253 if (TREE_VALUE (link))
2254 hi = hi * 603 + const_hash_1 (TREE_VALUE (link));
2262 struct addr_const value;
2264 decode_addr_const (exp, &value);
2265 if (GET_CODE (value.base) == SYMBOL_REF)
2267 /* Don't hash the address of the SYMBOL_REF;
2268 only use the offset and the symbol name. */
2270 p = XSTR (value.base, 0);
2271 for (i = 0; p[i] != 0; i++)
2272 hi = ((hi * 613) + (unsigned) (p[i]));
2274 else if (GET_CODE (value.base) == LABEL_REF)
2275 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2283 return (const_hash_1 (TREE_OPERAND (exp, 0)) * 9
2284 + const_hash_1 (TREE_OPERAND (exp, 1)));
2288 case NON_LVALUE_EXPR:
2289 return const_hash_1 (TREE_OPERAND (exp, 0)) * 7 + 2;
2292 /* A language specific constant. Just hash the code. */
2296 /* Compute hashing function. */
2298 for (i = 0; i < len; i++)
2299 hi = ((hi * 613) + (unsigned) (p[i]));
2304 /* Wrapper of compare_constant, for the htab interface. */
2306 const_desc_eq (p1, p2)
2310 return compare_constant (((struct constant_descriptor_tree *)p1)->value,
2311 ((struct constant_descriptor_tree *)p2)->value);
2314 /* Compare t1 and t2, and return 1 only if they are known to result in
2315 the same bit pattern on output. */
2318 compare_constant (t1, t2)
2322 enum tree_code typecode;
2324 if (t1 == NULL_TREE)
2325 return t2 == NULL_TREE;
2326 if (t2 == NULL_TREE)
2329 if (TREE_CODE (t1) != TREE_CODE (t2))
2332 switch (TREE_CODE (t1))
2335 /* Integer constants are the same only if the same width of type. */
2336 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2338 return tree_int_cst_equal (t1, t2);
2341 /* Real constants are the same only if the same width of type. */
2342 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2345 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
2348 if (flag_writable_strings)
2351 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2)))
2354 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
2355 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
2356 TREE_STRING_LENGTH (t1)));
2359 return (compare_constant (TREE_REALPART (t1), TREE_REALPART (t2))
2360 && compare_constant (TREE_IMAGPART (t1), TREE_IMAGPART (t2)));
2363 typecode = TREE_CODE (TREE_TYPE (t1));
2364 if (typecode != TREE_CODE (TREE_TYPE (t2)))
2367 if (typecode == SET_TYPE)
2369 int len = int_size_in_bytes (TREE_TYPE (t2));
2370 unsigned char *tmp1, *tmp2;
2372 if (int_size_in_bytes (TREE_TYPE (t1)) != len)
2375 tmp1 = (unsigned char *) alloca (len);
2376 tmp2 = (unsigned char *) alloca (len);
2378 if (get_set_constructor_bytes (t1, tmp1, len) != NULL_TREE)
2380 if (get_set_constructor_bytes (t2, tmp2, len) != NULL_TREE)
2383 return memcmp (tmp1, tmp2, len) != 0;
2389 if (typecode == ARRAY_TYPE)
2391 HOST_WIDE_INT size_1 = int_size_in_bytes (TREE_TYPE (t1));
2392 /* For arrays, check that the sizes all match. */
2393 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2))
2395 || size_1 != int_size_in_bytes (TREE_TYPE (t2)))
2400 /* For record and union constructors, require exact type
2402 if (TREE_TYPE (t1) != TREE_TYPE (t2))
2406 for (l1 = CONSTRUCTOR_ELTS (t1), l2 = CONSTRUCTOR_ELTS (t2);
2408 l1 = TREE_CHAIN (l1), l2 = TREE_CHAIN (l2))
2410 /* Check that each value is the same... */
2411 if (! compare_constant (TREE_VALUE (l1), TREE_VALUE (l2)))
2413 /* ... and that they apply to the same fields! */
2414 if (typecode == ARRAY_TYPE)
2416 if (! compare_constant (TREE_PURPOSE (l1),
2422 if (TREE_PURPOSE (l1) != TREE_PURPOSE (l2))
2427 return l1 == NULL_TREE && l2 == NULL_TREE;
2433 struct addr_const value1, value2;
2435 decode_addr_const (t1, &value1);
2436 decode_addr_const (t2, &value2);
2437 return (value1.offset == value2.offset
2438 && strcmp (XSTR (value1.base, 0), XSTR (value2.base, 0)) == 0);
2444 return (compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))
2445 && compare_constant(TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)));
2449 case NON_LVALUE_EXPR:
2450 return compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2455 nt1 = (*lang_hooks.expand_constant) (t1);
2456 nt2 = (*lang_hooks.expand_constant) (t2);
2457 if (nt1 != t1 || nt2 != t2)
2458 return compare_constant (nt1, nt2);
2464 /* Should not get here. */
2468 /* Make a copy of the whole tree structure for a constant. This
2469 handles the same types of nodes that compare_constant handles. */
2475 switch (TREE_CODE (exp))
2478 /* For ADDR_EXPR, we do not want to copy the decl whose address
2479 is requested. We do want to copy constants though. */
2480 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c')
2481 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2482 copy_constant (TREE_OPERAND (exp, 0)));
2484 return copy_node (exp);
2489 return copy_node (exp);
2492 return build_complex (TREE_TYPE (exp),
2493 copy_constant (TREE_REALPART (exp)),
2494 copy_constant (TREE_IMAGPART (exp)));
2498 return build (TREE_CODE (exp), TREE_TYPE (exp),
2499 copy_constant (TREE_OPERAND (exp, 0)),
2500 copy_constant (TREE_OPERAND (exp, 1)));
2504 case NON_LVALUE_EXPR:
2505 case VIEW_CONVERT_EXPR:
2506 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2507 copy_constant (TREE_OPERAND (exp, 0)));
2511 tree copy = copy_node (exp);
2512 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2515 CONSTRUCTOR_ELTS (copy) = list;
2516 for (tail = list; tail; tail = TREE_CHAIN (tail))
2517 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2518 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2519 for (tail = list; tail; tail = TREE_CHAIN (tail))
2520 TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail));
2528 t = (*lang_hooks.expand_constant) (exp);
2530 return copy_constant (t);
2537 /* Subroutine of output_constant_def:
2538 No constant equal to EXP is known to have been output.
2539 Make a constant descriptor to enter EXP in the hash table.
2540 Assign the label number and construct RTL to refer to the
2541 constant's location in memory.
2542 Caller is responsible for updating the hash table. */
2544 static struct constant_descriptor_tree *
2545 build_constant_desc (exp)
2552 struct constant_descriptor_tree *desc;
2554 desc = ggc_alloc (sizeof (*desc));
2555 desc->value = copy_constant (exp);
2557 /* Create a string containing the label name, in LABEL. */
2558 labelno = const_labelno++;
2559 ASM_GENERATE_INTERNAL_LABEL (label, "LC", labelno);
2561 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2562 symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label));
2563 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
2564 SYMBOL_REF_DECL (symbol) = desc->value;
2565 TREE_CONSTANT_POOL_ADDRESS_P (symbol) = 1;
2567 rtl = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)), symbol);
2568 set_mem_attributes (rtl, exp, 1);
2569 set_mem_alias_set (rtl, 0);
2570 set_mem_alias_set (rtl, const_alias_set);
2572 /* Set flags or add text to the name to record information, such as
2573 that it is a local symbol. If the name is changed, the macro
2574 ASM_OUTPUT_LABELREF will have to know how to strip this
2575 information. This call might invalidate our local variable
2576 SYMBOL; we can't use it afterward. */
2578 (*targetm.encode_section_info) (exp, rtl, true);
2585 /* Return an rtx representing a reference to constant data in memory
2586 for the constant expression EXP.
2588 If assembler code for such a constant has already been output,
2589 return an rtx to refer to it.
2590 Otherwise, output such a constant in memory
2591 and generate an rtx for it.
2593 If DEFER is nonzero, this constant can be deferred and output only
2594 if referenced in the function after all optimizations.
2596 The const_hash_table records which constants already have label strings. */
2599 output_constant_def (exp, defer)
2603 struct constant_descriptor_tree *desc;
2604 struct constant_descriptor_tree key;
2607 /* Look up EXP in the table of constant descriptors. If we didn't find
2608 it, create a new one. */
2610 loc = htab_find_slot (const_desc_htab, &key, INSERT);
2615 desc = build_constant_desc (exp);
2619 maybe_output_constant_def_contents (desc, defer);
2623 /* Subroutine of output_constant_def: Decide whether or not we need to
2624 output the constant DESC now, and if so, do it. */
2626 maybe_output_constant_def_contents (desc, defer)
2627 struct constant_descriptor_tree *desc;
2630 rtx symbol = XEXP (desc->rtl, 0);
2631 tree exp = desc->value;
2633 if (flag_syntax_only)
2636 if (TREE_ASM_WRITTEN (exp))
2637 /* Already output; don't do it again. */
2640 /* The only constants that cannot safely be deferred, assuming the
2641 context allows it, are strings under flag_writable_strings. */
2642 if (defer && (TREE_CODE (exp) != STRING_CST || !flag_writable_strings))
2644 /* Increment n_deferred_constants if it exists. It needs to be at
2645 least as large as the number of constants actually referred to
2646 by the function. If it's too small we'll stop looking too early
2647 and fail to emit constants; if it's too large we'll only look
2648 through the entire function when we could have stopped earlier. */
2650 n_deferred_constants++;
2654 output_constant_def_contents (symbol);
2657 /* We must output the constant data referred to by SYMBOL; do so. */
2660 output_constant_def_contents (symbol)
2663 tree exp = SYMBOL_REF_DECL (symbol);
2664 const char *label = XSTR (symbol, 0);
2666 /* Make sure any other constants whose addresses appear in EXP
2667 are assigned label numbers. */
2668 int reloc = output_addressed_constants (exp);
2670 /* Align the location counter as required by EXP's data type. */
2671 int align = TYPE_ALIGN (TREE_TYPE (exp));
2672 #ifdef CONSTANT_ALIGNMENT
2673 align = CONSTANT_ALIGNMENT (exp, align);
2676 /* We are no longer deferring this constant. */
2677 TREE_ASM_WRITTEN (exp) = 1;
2679 if (IN_NAMED_SECTION (exp))
2680 named_section (exp, NULL, reloc);
2682 (*targetm.asm_out.select_section) (exp, reloc, align);
2684 if (align > BITS_PER_UNIT)
2686 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2689 /* Output the label itself. */
2690 ASM_OUTPUT_LABEL (asm_out_file, label);
2692 /* Output the value of EXP. */
2693 output_constant (exp,
2694 (TREE_CODE (exp) == STRING_CST
2695 ? MAX (TREE_STRING_LENGTH (exp),
2696 int_size_in_bytes (TREE_TYPE (exp)))
2697 : int_size_in_bytes (TREE_TYPE (exp))),
2702 /* A constant which was deferred in its original location has been
2703 inserted by the RTL inliner into a different function. The
2704 current function's deferred constant count must be incremented. */
2706 notice_rtl_inlining_of_deferred_constant ()
2708 n_deferred_constants++;
2711 /* Used in the hash tables to avoid outputting the same constant
2712 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2713 are output once per function, not once per file; there seems
2714 to be no reason for the difference. */
2716 struct constant_descriptor_rtx GTY(())
2718 /* More constant_descriptors with the same hash code. */
2719 struct constant_descriptor_rtx *next;
2721 /* A MEM for the constant. */
2724 /* The value of the constant. */
2725 struct rtx_const value;
2728 /* Structure to represent sufficient information about a constant so that
2729 it can be output when the constant pool is output, so that function
2730 integration can be done, and to simplify handling on machines that reference
2731 constant pool as base+displacement. */
2733 struct pool_constant GTY(())
2735 struct constant_descriptor_rtx *desc;
2736 struct pool_constant *next;
2737 struct pool_constant *next_sym;
2739 enum machine_mode mode;
2742 HOST_WIDE_INT offset;
2746 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2747 The argument is XSTR (... , 0) */
2749 #define SYMHASH(LABEL) (((unsigned long) (LABEL)) % MAX_RTX_HASH_TABLE)
2751 /* Initialize constant pool hashing for a new function. */
2754 init_varasm_status (f)
2757 struct varasm_status *p;
2758 p = (struct varasm_status *) ggc_alloc (sizeof (struct varasm_status));
2760 p->x_const_rtx_hash_table
2761 = ((struct constant_descriptor_rtx **)
2762 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2763 * sizeof (struct constant_descriptor_rtx *)));
2764 p->x_const_rtx_sym_hash_table
2765 = ((struct pool_constant **)
2766 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2767 * sizeof (struct pool_constant *)));
2769 p->x_first_pool = p->x_last_pool = 0;
2770 p->x_pool_offset = 0;
2771 p->deferred_constants = 0;
2775 /* Express an rtx for a constant integer (perhaps symbolic)
2776 as the sum of a symbol or label plus an explicit integer.
2777 They are stored into VALUE. */
2780 decode_rtx_const (mode, x, value)
2781 enum machine_mode mode;
2783 struct rtx_const *value;
2785 /* Clear the whole structure, including any gaps. */
2786 memset (value, 0, sizeof (struct rtx_const));
2788 value->kind = RTX_INT; /* Most usual kind. */
2791 switch (GET_CODE (x))
2794 value->kind = RTX_DOUBLE;
2795 if (GET_MODE (x) != VOIDmode)
2797 const REAL_VALUE_TYPE *r = CONST_DOUBLE_REAL_VALUE (x);
2799 value->mode = GET_MODE (x);
2801 /* Copy the REAL_VALUE_TYPE by members so that we don't
2802 copy garbage from the original structure into our
2803 carefully cleaned hashing structure. */
2804 value->un.du.class = r->class;
2805 value->un.du.sign = r->sign;
2812 value->un.du.exp = r->exp;
2815 memcpy (value->un.du.sig, r->sig, sizeof (r->sig));
2823 value->un.di.low = CONST_DOUBLE_LOW (x);
2824 value->un.di.high = CONST_DOUBLE_HIGH (x);
2832 units = CONST_VECTOR_NUNITS (x);
2833 value->kind = RTX_VECTOR;
2836 if (GET_MODE_CLASS (mode) == MODE_VECTOR_INT)
2838 for (i = 0; i < units; ++i)
2840 rtx elt = CONST_VECTOR_ELT (x, i);
2841 if (GET_CODE (elt) == CONST_INT)
2843 value->un.int_vec[i].low = INTVAL (elt);
2844 value->un.int_vec[i].high = 0;
2848 value->un.int_vec[i].low = CONST_DOUBLE_LOW (elt);
2849 value->un.int_vec[i].high = CONST_DOUBLE_HIGH (elt);
2853 else if (GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
2855 for (i = 0; i < units; ++i)
2857 const REAL_VALUE_TYPE *r
2858 = CONST_DOUBLE_REAL_VALUE (CONST_VECTOR_ELT (x, i));
2859 REAL_VALUE_TYPE *d = &value->un.fp_vec[i];
2861 /* Copy the REAL_VALUE_TYPE by members so that we don't
2862 copy garbage from the original structure into our
2863 carefully cleaned hashing structure. */
2864 d->class = r->class;
2875 memcpy (d->sig, r->sig, sizeof (r->sig));
2888 value->un.addr.offset = INTVAL (x);
2894 value->un.addr.base = x;
2899 if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 1)) == CONST_INT)
2901 value->un.addr.base = XEXP (x, 0);
2902 value->un.addr.offset = INTVAL (XEXP (x, 1));
2904 else if (GET_CODE (x) == MINUS && GET_CODE (XEXP (x, 1)) == CONST_INT)
2906 value->un.addr.base = XEXP (x, 0);
2907 value->un.addr.offset = - INTVAL (XEXP (x, 1));
2911 value->un.addr.base = x;
2912 value->un.addr.offset = 0;
2917 value->kind = RTX_UNKNOWN;
2921 if (value->kind == RTX_INT && value->un.addr.base != 0
2922 && GET_CODE (value->un.addr.base) == UNSPEC)
2924 /* For a simple UNSPEC, the base is set to the
2925 operand, the kind field is set to the index of
2926 the unspec expression.
2927 Together with the code below, in case that
2928 the operand is a SYMBOL_REF or LABEL_REF,
2929 the address of the string or the code_label
2930 is taken as base. */
2931 if (XVECLEN (value->un.addr.base, 0) == 1)
2933 value->kind = RTX_UNSPEC + XINT (value->un.addr.base, 1);
2934 value->un.addr.base = XVECEXP (value->un.addr.base, 0, 0);
2938 if (value->kind >= RTX_INT && value->un.addr.base != 0)
2939 switch (GET_CODE (value->un.addr.base))
2942 /* Use the string's address, not the SYMBOL_REF's address,
2943 for the sake of addresses of library routines. */
2944 value->un.addr.symbol = XSTR (value->un.addr.base, 0);
2945 value->un.addr.base = NULL_RTX;
2949 /* For a LABEL_REF, compare labels. */
2950 value->un.addr.base = XEXP (value->un.addr.base, 0);
2957 /* Given a MINUS expression, simplify it if both sides
2958 include the same symbol. */
2961 simplify_subtraction (x)
2964 struct rtx_const val0, val1;
2966 decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0);
2967 decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1);
2969 if (val0.kind >= RTX_INT
2970 && val0.kind == val1.kind
2971 && val0.un.addr.base == val1.un.addr.base
2972 && val0.un.addr.symbol == val1.un.addr.symbol)
2973 return GEN_INT (val0.un.addr.offset - val1.un.addr.offset);
2978 /* Compute a hash code for a constant RTL expression. */
2981 const_hash_rtx (mode, x)
2982 enum machine_mode mode;
2986 struct rtx_const value;
2987 unsigned int data[sizeof(struct rtx_const) / sizeof (unsigned int)];
2993 decode_rtx_const (mode, x, &u.value);
2995 /* Compute hashing function. */
2997 for (i = 0; i < ARRAY_SIZE (u.data); i++)
2998 hi = hi * 613 + u.data[i];
3000 return hi % MAX_RTX_HASH_TABLE;
3003 /* Compare a constant rtl object X with a constant-descriptor DESC.
3004 Return 1 if DESC describes a constant with the same value as X. */
3007 compare_constant_rtx (mode, x, desc)
3008 enum machine_mode mode;
3010 struct constant_descriptor_rtx *desc;
3012 struct rtx_const value;
3014 decode_rtx_const (mode, x, &value);
3016 /* Compare constant contents. */
3017 return memcmp (&value, &desc->value, sizeof (struct rtx_const)) == 0;
3020 /* Construct a constant descriptor for the rtl-expression X.
3021 It is up to the caller to enter the descriptor in the hash table. */
3023 static struct constant_descriptor_rtx *
3024 record_constant_rtx (mode, x)
3025 enum machine_mode mode;
3028 struct constant_descriptor_rtx *ptr;
3030 ptr = (struct constant_descriptor_rtx *) ggc_alloc (sizeof (*ptr));
3031 decode_rtx_const (mode, x, &ptr->value);
3036 /* Given a constant rtx X, return a MEM for the location in memory at which
3037 this constant has been placed. Return 0 if it not has been placed yet. */
3040 mem_for_const_double (x)
3043 enum machine_mode mode = GET_MODE (x);
3044 struct constant_descriptor_rtx *desc;
3046 for (desc = const_rtx_hash_table[const_hash_rtx (mode, x)]; desc;
3048 if (compare_constant_rtx (mode, x, desc))
3054 /* Given a constant rtx X, make (or find) a memory constant for its value
3055 and return a MEM rtx to refer to it in memory. */
3058 force_const_mem (mode, x)
3059 enum machine_mode mode;
3063 struct constant_descriptor_rtx *desc;
3066 struct pool_constant *pool;
3069 /* If we're not allowed to drop X into the constant pool, don't. */
3070 if ((*targetm.cannot_force_const_mem) (x))
3073 /* Compute hash code of X. Search the descriptors for that hash code
3074 to see if any of them describes X. If yes, we have an rtx to use. */
3075 hash = const_hash_rtx (mode, x);
3076 for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next)
3077 if (compare_constant_rtx (mode, x, desc))
3080 /* No constant equal to X is known to have been output.
3081 Make a constant descriptor to enter X in the hash table
3082 and make a MEM for it. */
3083 desc = record_constant_rtx (mode, x);
3084 desc->next = const_rtx_hash_table[hash];
3085 const_rtx_hash_table[hash] = desc;
3087 /* Align the location counter as required by EXP's data type. */
3088 align = GET_MODE_ALIGNMENT (mode == VOIDmode ? word_mode : mode);
3089 #ifdef CONSTANT_ALIGNMENT
3091 tree type = (*lang_hooks.types.type_for_mode) (mode, 0);
3092 if (type != NULL_TREE)
3093 align = CONSTANT_ALIGNMENT (make_tree (type, x), align);
3097 pool_offset += (align / BITS_PER_UNIT) - 1;
3098 pool_offset &= ~ ((align / BITS_PER_UNIT) - 1);
3100 if (GET_CODE (x) == LABEL_REF)
3101 LABEL_PRESERVE_P (XEXP (x, 0)) = 1;
3103 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3104 pool = (struct pool_constant *) ggc_alloc (sizeof (struct pool_constant));
3108 pool->labelno = const_labelno;
3109 pool->align = align;
3110 pool->offset = pool_offset;
3117 last_pool->next = pool;
3120 pool_offset += GET_MODE_SIZE (mode);
3122 /* Create a string containing the label name, in LABEL. */
3123 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3127 /* Construct the SYMBOL_REF and the MEM. */
3129 symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label));
3130 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
3132 pool->desc->rtl = def = gen_rtx_MEM (mode, symbol);
3133 set_mem_attributes (def, (*lang_hooks.types.type_for_mode) (mode, 0), 1);
3134 RTX_UNCHANGING_P (def) = 1;
3136 /* Add label to symbol hash table. */
3137 hash = SYMHASH (XSTR (symbol, 0));
3138 pool->next_sym = const_rtx_sym_hash_table[hash];
3139 const_rtx_sym_hash_table[hash] = pool;
3141 /* Mark the symbol_ref as belonging to this constants pool. */
3142 CONSTANT_POOL_ADDRESS_P (symbol) = 1;
3143 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
3144 current_function_uses_const_pool = 1;
3149 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3150 the corresponding pool_constant structure. */
3152 static struct pool_constant *
3153 find_pool_constant (f, addr)
3157 struct pool_constant *pool;
3158 const char *label = XSTR (addr, 0);
3160 for (pool = f->varasm->x_const_rtx_sym_hash_table[SYMHASH (label)]; pool;
3161 pool = pool->next_sym)
3162 if (XSTR (XEXP (pool->desc->rtl, 0), 0) == label)
3168 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3171 get_pool_constant (addr)
3174 return (find_pool_constant (cfun, addr))->constant;
3177 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3178 and whether it has been output or not. */
3181 get_pool_constant_mark (addr, pmarked)
3185 struct pool_constant *pool = find_pool_constant (cfun, addr);
3186 *pmarked = (pool->mark != 0);
3187 return pool->constant;
3190 /* Likewise, but for the constant pool of a specific function. */
3193 get_pool_constant_for_function (f, addr)
3197 return (find_pool_constant (f, addr))->constant;
3200 /* Similar, return the mode. */
3203 get_pool_mode (addr)
3206 return (find_pool_constant (cfun, addr))->mode;
3210 get_pool_mode_for_function (f, addr)
3214 return (find_pool_constant (f, addr))->mode;
3217 /* Similar, return the offset in the constant pool. */
3220 get_pool_offset (addr)
3223 return (find_pool_constant (cfun, addr))->offset;
3226 /* Return the size of the constant pool. */
3234 /* Write all the constants in the constant pool. */
3237 output_constant_pool (fnname, fndecl)
3238 const char *fnname ATTRIBUTE_UNUSED;
3239 tree fndecl ATTRIBUTE_UNUSED;
3241 struct pool_constant *pool;
3245 /* It is possible for gcc to call force_const_mem and then to later
3246 discard the instructions which refer to the constant. In such a
3247 case we do not need to output the constant. */
3248 mark_constant_pool ();
3250 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3251 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset);
3254 for (pool = first_pool; pool; pool = pool->next)
3263 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3264 whose CODE_LABEL has been deleted. This can occur if a jump table
3265 is eliminated by optimization. If so, write a constant of zero
3266 instead. Note that this can also happen by turning the
3267 CODE_LABEL into a NOTE. */
3268 /* ??? This seems completely and utterly wrong. Certainly it's
3269 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3270 functioning even with INSN_DELETED_P and friends. */
3273 switch (GET_CODE (x))
3276 if (GET_CODE (XEXP (x, 0)) != PLUS
3277 || GET_CODE (XEXP (XEXP (x, 0), 0)) != LABEL_REF)
3279 tmp = XEXP (XEXP (x, 0), 0);
3284 if (INSN_DELETED_P (tmp)
3285 || (GET_CODE (tmp) == NOTE
3286 && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_DELETED))
3297 /* First switch to correct section. */
3298 (*targetm.asm_out.select_rtx_section) (pool->mode, x, pool->align);
3300 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3301 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode,
3302 pool->align, pool->labelno, done);
3305 assemble_align (pool->align);
3307 /* Output the label. */
3308 (*targetm.asm_out.internal_label) (asm_out_file, "LC", pool->labelno);
3310 /* Output the value of the constant itself. */
3311 switch (GET_MODE_CLASS (pool->mode))
3314 if (GET_CODE (x) != CONST_DOUBLE)
3317 REAL_VALUE_FROM_CONST_DOUBLE (r, x);
3318 assemble_real (r, pool->mode, pool->align);
3322 case MODE_PARTIAL_INT:
3323 assemble_integer (x, GET_MODE_SIZE (pool->mode), pool->align, 1);
3326 case MODE_VECTOR_FLOAT:
3331 if (GET_CODE (x) != CONST_VECTOR)
3334 units = CONST_VECTOR_NUNITS (x);
3336 for (i = 0; i < units; i++)
3338 elt = CONST_VECTOR_ELT (x, i);
3339 REAL_VALUE_FROM_CONST_DOUBLE (r, elt);
3340 assemble_real (r, GET_MODE_INNER (pool->mode), pool->align);
3345 case MODE_VECTOR_INT:
3350 if (GET_CODE (x) != CONST_VECTOR)
3353 units = CONST_VECTOR_NUNITS (x);
3355 for (i = 0; i < units; i++)
3357 elt = CONST_VECTOR_ELT (x, i);
3358 assemble_integer (elt, GET_MODE_UNIT_SIZE (pool->mode),
3368 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3369 sections have proper size. */
3370 if (pool->align > GET_MODE_BITSIZE (pool->mode)
3371 && in_section == in_named
3372 && get_named_section_flags (in_named_name) & SECTION_MERGE)
3373 assemble_align (pool->align);
3375 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3380 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3381 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool_offset);
3384 /* Done with this pool. */
3385 first_pool = last_pool = 0;
3388 /* Look through the instructions for this function, and mark all the
3389 entries in the constant pool which are actually being used. Emit
3390 deferred constants which have indeed been used. */
3393 mark_constant_pool ()
3397 struct pool_constant *pool;
3399 if (first_pool == 0 && n_deferred_constants == 0)
3402 for (pool = first_pool; pool; pool = pool->next)
3405 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3407 mark_constants (PATTERN (insn));
3409 for (link = current_function_epilogue_delay_list;
3411 link = XEXP (link, 1))
3413 insn = XEXP (link, 0);
3416 mark_constants (PATTERN (insn));
3420 /* Look through appropriate parts of X, marking all entries in the
3421 constant pool which are actually being used. Entries that are only
3422 referenced by other constants are also marked as used. Emit
3423 deferred strings that are used. */
3430 const char *format_ptr;
3435 if (GET_CODE (x) == SYMBOL_REF)
3437 mark_constant (&x, NULL);
3441 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3442 insns, not any notes that may be attached. We don't want to mark
3443 a constant just because it happens to appear in a REG_EQUIV note. */
3446 mark_constants (PATTERN (x));
3450 format_ptr = GET_RTX_FORMAT (GET_CODE (x));
3452 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (x)); i++)
3454 switch (*format_ptr++)
3457 mark_constants (XEXP (x, i));
3461 if (XVEC (x, i) != 0)
3465 for (j = 0; j < XVECLEN (x, i); j++)
3466 mark_constants (XVECEXP (x, i, j));
3486 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3487 to as used. Emit referenced deferred strings. This function can
3488 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3491 mark_constant (current_rtx, data)
3493 void *data ATTRIBUTE_UNUSED;
3495 rtx x = *current_rtx;
3500 else if (GET_CODE (x) == SYMBOL_REF)
3502 if (CONSTANT_POOL_ADDRESS_P (x))
3504 struct pool_constant *pool = find_pool_constant (cfun, x);
3505 if (pool->mark == 0)
3508 for_each_rtx (&(pool->constant), &mark_constant, NULL);
3513 else if (TREE_CONSTANT_POOL_ADDRESS_P (x))
3515 tree exp = SYMBOL_REF_DECL (x);
3516 if (!TREE_ASM_WRITTEN (exp))
3518 n_deferred_constants--;
3519 output_constant_def_contents (x);
3526 /* Find all the constants whose addresses are referenced inside of EXP,
3527 and make sure assembler code with a label has been output for each one.
3528 Indicate whether an ADDR_EXPR has been encountered. */
3531 output_addressed_constants (exp)
3534 int reloc = 0, reloc2;
3537 /* Give the front-end a chance to convert VALUE to something that
3538 looks more like a constant to the back-end. */
3539 exp = (*lang_hooks.expand_constant) (exp);
3541 switch (TREE_CODE (exp))
3545 /* Go inside any operations that get_inner_reference can handle and see
3546 if what's inside is a constant: no need to do anything here for
3547 addresses of variables or functions. */
3548 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
3549 tem = TREE_OPERAND (tem, 0))
3552 if (TREE_CODE_CLASS (TREE_CODE (tem)) == 'c'
3553 || TREE_CODE (tem) == CONSTRUCTOR)
3554 output_constant_def (tem, 0);
3556 if (TREE_PUBLIC (tem))
3563 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3564 reloc |= output_addressed_constants (TREE_OPERAND (exp, 1));
3568 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3569 reloc2 = output_addressed_constants (TREE_OPERAND (exp, 1));
3570 /* The difference of two local labels is computable at link time. */
3571 if (reloc == 1 && reloc2 == 1)
3579 case NON_LVALUE_EXPR:
3580 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3584 for (tem = CONSTRUCTOR_ELTS (exp); tem; tem = TREE_CHAIN (tem))
3585 if (TREE_VALUE (tem) != 0)
3586 reloc |= output_addressed_constants (TREE_VALUE (tem));
3596 /* Return nonzero if VALUE is a valid constant-valued expression
3597 for use in initializing a static variable; one that can be an
3598 element of a "constant" initializer.
3600 Return null_pointer_node if the value is absolute;
3601 if it is relocatable, return the variable that determines the relocation.
3602 We assume that VALUE has been folded as much as possible;
3603 therefore, we do not need to check for such things as
3604 arithmetic-combinations of integers. */
3607 initializer_constant_valid_p (value, endtype)
3611 /* Give the front-end a chance to convert VALUE to something that
3612 looks more like a constant to the back-end. */
3613 value = (*lang_hooks.expand_constant) (value);
3615 switch (TREE_CODE (value))
3618 if ((TREE_CODE (TREE_TYPE (value)) == UNION_TYPE
3619 || TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE)
3620 && TREE_CONSTANT (value)
3621 && CONSTRUCTOR_ELTS (value))
3623 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value)),
3626 return TREE_STATIC (value) ? null_pointer_node : 0;
3633 return null_pointer_node;
3637 return staticp (TREE_OPERAND (value, 0)) ? TREE_OPERAND (value, 0) : 0;
3639 case VIEW_CONVERT_EXPR:
3640 case NON_LVALUE_EXPR:
3641 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3645 /* Allow conversions between pointer types. */
3646 if (POINTER_TYPE_P (TREE_TYPE (value))
3647 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3648 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3650 /* Allow conversions between real types. */
3651 if (FLOAT_TYPE_P (TREE_TYPE (value))
3652 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3653 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3655 /* Allow length-preserving conversions between integer types. */
3656 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3657 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3658 && (TYPE_PRECISION (TREE_TYPE (value))
3659 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3660 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3662 /* Allow conversions between other integer types only if
3664 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3665 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3667 tree inner = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3669 if (inner == null_pointer_node)
3670 return null_pointer_node;
3674 /* Allow (int) &foo provided int is as wide as a pointer. */
3675 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3676 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3677 && (TYPE_PRECISION (TREE_TYPE (value))
3678 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3679 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3682 /* Likewise conversions from int to pointers, but also allow
3683 conversions from 0. */
3684 if (POINTER_TYPE_P (TREE_TYPE (value))
3685 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3687 if (integer_zerop (TREE_OPERAND (value, 0)))
3688 return null_pointer_node;
3689 else if (TYPE_PRECISION (TREE_TYPE (value))
3690 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0))))
3691 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3695 /* Allow conversions to union types if the value inside is okay. */
3696 if (TREE_CODE (TREE_TYPE (value)) == UNION_TYPE)
3697 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3702 if (! INTEGRAL_TYPE_P (endtype)
3703 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3705 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3707 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3709 /* If either term is absolute, use the other terms relocation. */
3710 if (valid0 == null_pointer_node)
3712 if (valid1 == null_pointer_node)
3718 if (! INTEGRAL_TYPE_P (endtype)
3719 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3721 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3723 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3725 /* Win if second argument is absolute. */
3726 if (valid1 == null_pointer_node)
3728 /* Win if both arguments have the same relocation.
3729 Then the value is absolute. */
3730 if (valid0 == valid1 && valid0 != 0)
3731 return null_pointer_node;
3733 /* Since GCC guarantees that string constants are unique in the
3734 generated code, a subtraction between two copies of the same
3735 constant string is absolute. */
3736 if (valid0 && TREE_CODE (valid0) == STRING_CST &&
3737 valid1 && TREE_CODE (valid1) == STRING_CST &&
3738 TREE_STRING_POINTER (valid0) == TREE_STRING_POINTER (valid1))
3739 return null_pointer_node;
3742 /* Support differences between labels. */
3743 if (INTEGRAL_TYPE_P (endtype))
3746 op0 = TREE_OPERAND (value, 0);
3747 op1 = TREE_OPERAND (value, 1);
3749 /* Like STRIP_NOPS except allow the operand mode to widen.
3750 This works around a feature of fold that simplifies
3751 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3752 that the narrower operation is cheaper. */
3754 while (TREE_CODE (op0) == NOP_EXPR
3755 || TREE_CODE (op0) == CONVERT_EXPR
3756 || TREE_CODE (op0) == NON_LVALUE_EXPR)
3758 tree inner = TREE_OPERAND (op0, 0);
3759 if (inner == error_mark_node
3760 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3761 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0)))
3762 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3767 while (TREE_CODE (op1) == NOP_EXPR
3768 || TREE_CODE (op1) == CONVERT_EXPR
3769 || TREE_CODE (op1) == NON_LVALUE_EXPR)
3771 tree inner = TREE_OPERAND (op1, 0);
3772 if (inner == error_mark_node
3773 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3774 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1)))
3775 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3780 if (TREE_CODE (op0) == ADDR_EXPR
3781 && TREE_CODE (TREE_OPERAND (op0, 0)) == LABEL_DECL
3782 && TREE_CODE (op1) == ADDR_EXPR
3783 && TREE_CODE (TREE_OPERAND (op1, 0)) == LABEL_DECL)
3784 return null_pointer_node;
3795 /* Output assembler code for constant EXP to FILE, with no label.
3796 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3797 Assumes output_addressed_constants has been done on EXP already.
3799 Generate exactly SIZE bytes of assembler data, padding at the end
3800 with zeros if necessary. SIZE must always be specified.
3802 SIZE is important for structure constructors,
3803 since trailing members may have been omitted from the constructor.
3804 It is also important for initialization of arrays from string constants
3805 since the full length of the string constant might not be wanted.
3806 It is also needed for initialization of unions, where the initializer's
3807 type is just one member, and that may not be as long as the union.
3809 There a case in which we would fail to output exactly SIZE bytes:
3810 for a structure constructor that wants to produce more than SIZE bytes.
3811 But such constructors will never be generated for any possible input.
3813 ALIGN is the alignment of the data in bits. */
3816 output_constant (exp, size, align)
3818 unsigned HOST_WIDE_INT size;
3821 enum tree_code code;
3822 unsigned HOST_WIDE_INT thissize;
3824 /* Some front-ends use constants other than the standard language-independent
3825 varieties, but which may still be output directly. Give the front-end a
3826 chance to convert EXP to a language-independent representation. */
3827 exp = (*lang_hooks.expand_constant) (exp);
3829 if (size == 0 || flag_syntax_only)
3832 /* Eliminate any conversions since we'll be outputting the underlying
3834 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
3835 || TREE_CODE (exp) == NON_LVALUE_EXPR
3836 || TREE_CODE (exp) == VIEW_CONVERT_EXPR)
3837 exp = TREE_OPERAND (exp, 0);
3839 code = TREE_CODE (TREE_TYPE (exp));
3840 thissize = int_size_in_bytes (TREE_TYPE (exp));
3842 /* Allow a constructor with no elements for any data type.
3843 This means to fill the space with zeros. */
3844 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
3846 assemble_zeros (size);
3850 if (TREE_CODE (exp) == FDESC_EXPR)
3852 #ifdef ASM_OUTPUT_FDESC
3853 HOST_WIDE_INT part = tree_low_cst (TREE_OPERAND (exp, 1), 0);
3854 tree decl = TREE_OPERAND (exp, 0);
3855 ASM_OUTPUT_FDESC (asm_out_file, decl, part);
3862 /* Now output the underlying data. If we've handling the padding, return.
3863 Otherwise, break and ensure THISSIZE is the size written. */
3871 case REFERENCE_TYPE:
3872 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
3873 EXPAND_INITIALIZER),
3875 error ("initializer for integer value is too complicated");
3879 if (TREE_CODE (exp) != REAL_CST)
3880 error ("initializer for floating value is not a floating constant");
3882 assemble_real (TREE_REAL_CST (exp),
3883 mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0),
3888 output_constant (TREE_REALPART (exp), thissize / 2, align);
3889 output_constant (TREE_IMAGPART (exp), thissize / 2,
3890 min_align (align, BITS_PER_UNIT * (thissize / 2)));
3895 if (TREE_CODE (exp) == CONSTRUCTOR)
3897 output_constructor (exp, size, align);
3900 else if (TREE_CODE (exp) == STRING_CST)
3902 thissize = MIN ((unsigned HOST_WIDE_INT)TREE_STRING_LENGTH (exp),
3904 assemble_string (TREE_STRING_POINTER (exp), thissize);
3906 else if (TREE_CODE (exp) == VECTOR_CST)
3910 unsigned int nalign;
3911 enum machine_mode inner;
3913 inner = GET_MODE_INNER (TYPE_MODE (TREE_TYPE (exp)));
3914 nalign = MIN (align, GET_MODE_ALIGNMENT (inner));
3916 elt_size = GET_MODE_UNIT_SIZE (TYPE_MODE (TREE_TYPE (exp)));
3918 link = TREE_VECTOR_CST_ELTS (exp);
3919 output_constant (TREE_VALUE (link), elt_size, align);
3920 while ((link = TREE_CHAIN (link)) != NULL)
3921 output_constant (TREE_VALUE (link), elt_size, nalign);
3929 if (TREE_CODE (exp) == CONSTRUCTOR)
3930 output_constructor (exp, size, align);
3936 if (TREE_CODE (exp) == INTEGER_CST)
3937 assemble_integer (expand_expr (exp, NULL_RTX,
3938 VOIDmode, EXPAND_INITIALIZER),
3939 thissize, align, 1);
3940 else if (TREE_CODE (exp) == CONSTRUCTOR)
3942 unsigned char *buffer = (unsigned char *) alloca (thissize);
3943 if (get_set_constructor_bytes (exp, buffer, thissize))
3945 assemble_string ((char *) buffer, thissize);
3948 error ("unknown set constructor type");
3958 if (size > thissize)
3959 assemble_zeros (size - thissize);
3963 /* Subroutine of output_constructor, used for computing the size of
3964 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3965 type with an unspecified upper bound. */
3967 static unsigned HOST_WIDE_INT
3968 array_size_for_constructor (val)
3973 /* This code used to attempt to handle string constants that are not
3974 arrays of single-bytes, but nothing else does, so there's no point in
3976 if (TREE_CODE (val) == STRING_CST)
3977 return TREE_STRING_LENGTH (val);
3979 max_index = NULL_TREE;
3980 for (i = CONSTRUCTOR_ELTS (val); i; i = TREE_CHAIN (i))
3982 tree index = TREE_PURPOSE (i);
3984 if (TREE_CODE (index) == RANGE_EXPR)
3985 index = TREE_OPERAND (index, 1);
3986 if (max_index == NULL_TREE || tree_int_cst_lt (max_index, index))
3990 if (max_index == NULL_TREE)
3993 /* Compute the total number of array elements. */
3994 i = size_binop (MINUS_EXPR, convert (sizetype, max_index),
3996 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val)))));
3997 i = size_binop (PLUS_EXPR, i, convert (sizetype, integer_one_node));
3999 /* Multiply by the array element unit size to find number of bytes. */
4000 i = size_binop (MULT_EXPR, i, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val))));
4002 return tree_low_cst (i, 1);
4005 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4006 Generate at least SIZE bytes, padding if necessary. */
4009 output_constructor (exp, size, align)
4011 unsigned HOST_WIDE_INT size;
4014 tree type = TREE_TYPE (exp);
4015 tree link, field = 0;
4017 /* Number of bytes output or skipped so far.
4018 In other words, current position within the constructor. */
4019 HOST_WIDE_INT total_bytes = 0;
4020 /* Nonzero means BYTE contains part of a byte, to be output. */
4021 int byte_buffer_in_use = 0;
4024 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
4027 if (TREE_CODE (type) == RECORD_TYPE)
4028 field = TYPE_FIELDS (type);
4030 if (TREE_CODE (type) == ARRAY_TYPE
4031 && TYPE_DOMAIN (type) != 0)
4032 min_index = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
4034 /* As LINK goes through the elements of the constant,
4035 FIELD goes through the structure fields, if the constant is a structure.
4036 if the constant is a union, then we override this,
4037 by getting the field from the TREE_LIST element.
4038 But the constant could also be an array. Then FIELD is zero.
4040 There is always a maximum of one element in the chain LINK for unions
4041 (even if the initializer in a source program incorrectly contains
4043 for (link = CONSTRUCTOR_ELTS (exp);
4045 link = TREE_CHAIN (link),
4046 field = field ? TREE_CHAIN (field) : 0)
4048 tree val = TREE_VALUE (link);
4051 /* The element in a union constructor specifies the proper field
4053 if ((TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
4054 || TREE_CODE (type) == QUAL_UNION_TYPE)
4055 && TREE_PURPOSE (link) != 0)
4056 field = TREE_PURPOSE (link);
4058 else if (TREE_CODE (type) == ARRAY_TYPE)
4059 index = TREE_PURPOSE (link);
4061 /* Eliminate the marker that makes a cast not be an lvalue. */
4065 if (index && TREE_CODE (index) == RANGE_EXPR)
4067 unsigned HOST_WIDE_INT fieldsize
4068 = int_size_in_bytes (TREE_TYPE (type));
4069 HOST_WIDE_INT lo_index = tree_low_cst (TREE_OPERAND (index, 0), 0);
4070 HOST_WIDE_INT hi_index = tree_low_cst (TREE_OPERAND (index, 1), 0);
4071 HOST_WIDE_INT index;
4072 unsigned int align2 = min_align (align, fieldsize * BITS_PER_UNIT);
4074 for (index = lo_index; index <= hi_index; index++)
4076 /* Output the element's initial value. */
4078 assemble_zeros (fieldsize);
4080 output_constant (val, fieldsize, align2);
4082 /* Count its size. */
4083 total_bytes += fieldsize;
4086 else if (field == 0 || !DECL_BIT_FIELD (field))
4088 /* An element that is not a bit-field. */
4090 unsigned HOST_WIDE_INT fieldsize;
4091 /* Since this structure is static,
4092 we know the positions are constant. */
4093 HOST_WIDE_INT pos = field ? int_byte_position (field) : 0;
4094 unsigned int align2;
4097 pos = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val)), 1)
4098 * (tree_low_cst (index, 0) - tree_low_cst (min_index, 0)));
4100 /* Output any buffered-up bit-fields preceding this element. */
4101 if (byte_buffer_in_use)
4103 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4105 byte_buffer_in_use = 0;
4108 /* Advance to offset of this element.
4109 Note no alignment needed in an array, since that is guaranteed
4110 if each element has the proper size. */
4111 if ((field != 0 || index != 0) && pos != total_bytes)
4113 assemble_zeros (pos - total_bytes);
4117 /* Find the alignment of this element. */
4118 align2 = min_align (align, BITS_PER_UNIT * pos);
4120 /* Determine size this element should occupy. */
4125 /* If this is an array with an unspecified upper bound,
4126 the initializer determines the size. */
4127 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4128 but we cannot do this until the deprecated support for
4129 initializing zero-length array members is removed. */
4130 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE
4131 && TYPE_DOMAIN (TREE_TYPE (field))
4132 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field))))
4134 fieldsize = array_size_for_constructor (val);
4135 /* Given a non-empty initialization, this field had
4137 if (fieldsize != 0 && TREE_CHAIN (field) != NULL_TREE)
4140 else if (DECL_SIZE_UNIT (field))
4142 /* ??? This can't be right. If the decl size overflows
4143 a host integer we will silently emit no data. */
4144 if (host_integerp (DECL_SIZE_UNIT (field), 1))
4145 fieldsize = tree_low_cst (DECL_SIZE_UNIT (field), 1);
4149 fieldsize = int_size_in_bytes (TREE_TYPE (type));
4151 /* Output the element's initial value. */
4153 assemble_zeros (fieldsize);
4155 output_constant (val, fieldsize, align2);
4157 /* Count its size. */
4158 total_bytes += fieldsize;
4160 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
4161 error ("invalid initial value for member `%s'",
4162 IDENTIFIER_POINTER (DECL_NAME (field)));
4165 /* Element that is a bit-field. */
4167 HOST_WIDE_INT next_offset = int_bit_position (field);
4168 HOST_WIDE_INT end_offset
4169 = (next_offset + tree_low_cst (DECL_SIZE (field), 1));
4172 val = integer_zero_node;
4174 /* If this field does not start in this (or, next) byte,
4176 if (next_offset / BITS_PER_UNIT != total_bytes)
4178 /* Output remnant of any bit field in previous bytes. */
4179 if (byte_buffer_in_use)
4181 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4183 byte_buffer_in_use = 0;
4186 /* If still not at proper byte, advance to there. */
4187 if (next_offset / BITS_PER_UNIT != total_bytes)
4189 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
4190 total_bytes = next_offset / BITS_PER_UNIT;
4194 if (! byte_buffer_in_use)
4197 /* We must split the element into pieces that fall within
4198 separate bytes, and combine each byte with previous or
4199 following bit-fields. */
4201 /* next_offset is the offset n fbits from the beginning of
4202 the structure to the next bit of this element to be processed.
4203 end_offset is the offset of the first bit past the end of
4205 while (next_offset < end_offset)
4209 HOST_WIDE_INT value;
4210 HOST_WIDE_INT next_byte = next_offset / BITS_PER_UNIT;
4211 HOST_WIDE_INT next_bit = next_offset % BITS_PER_UNIT;
4213 /* Advance from byte to byte
4214 within this element when necessary. */
4215 while (next_byte != total_bytes)
4217 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4222 /* Number of bits we can process at once
4223 (all part of the same byte). */
4224 this_time = MIN (end_offset - next_offset,
4225 BITS_PER_UNIT - next_bit);
4226 if (BYTES_BIG_ENDIAN)
4228 /* On big-endian machine, take the most significant bits
4229 first (of the bits that are significant)
4230 and put them into bytes from the most significant end. */
4231 shift = end_offset - next_offset - this_time;
4233 /* Don't try to take a bunch of bits that cross
4234 the word boundary in the INTEGER_CST. We can
4235 only select bits from the LOW or HIGH part
4237 if (shift < HOST_BITS_PER_WIDE_INT
4238 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4240 this_time = shift + this_time - HOST_BITS_PER_WIDE_INT;
4241 shift = HOST_BITS_PER_WIDE_INT;
4244 /* Now get the bits from the appropriate constant word. */
4245 if (shift < HOST_BITS_PER_WIDE_INT)
4246 value = TREE_INT_CST_LOW (val);
4247 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4249 value = TREE_INT_CST_HIGH (val);
4250 shift -= HOST_BITS_PER_WIDE_INT;
4255 /* Get the result. This works only when:
4256 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4257 byte |= (((value >> shift)
4258 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4259 << (BITS_PER_UNIT - this_time - next_bit));
4263 /* On little-endian machines,
4264 take first the least significant bits of the value
4265 and pack them starting at the least significant
4266 bits of the bytes. */
4267 shift = next_offset - int_bit_position (field);
4269 /* Don't try to take a bunch of bits that cross
4270 the word boundary in the INTEGER_CST. We can
4271 only select bits from the LOW or HIGH part
4273 if (shift < HOST_BITS_PER_WIDE_INT
4274 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4275 this_time = (HOST_BITS_PER_WIDE_INT - shift);
4277 /* Now get the bits from the appropriate constant word. */
4278 if (shift < HOST_BITS_PER_WIDE_INT)
4279 value = TREE_INT_CST_LOW (val);
4280 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4282 value = TREE_INT_CST_HIGH (val);
4283 shift -= HOST_BITS_PER_WIDE_INT;
4288 /* Get the result. This works only when:
4289 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4290 byte |= (((value >> shift)
4291 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4295 next_offset += this_time;
4296 byte_buffer_in_use = 1;
4301 if (byte_buffer_in_use)
4303 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4307 if ((unsigned HOST_WIDE_INT)total_bytes < size)
4308 assemble_zeros (size - total_bytes);
4311 /* This TREE_LIST contains any weak symbol declarations waiting
4313 static GTY(()) tree weak_decls;
4315 /* Mark DECL as weak. */
4321 DECL_WEAK (decl) = 1;
4323 if (DECL_RTL_SET_P (decl)
4324 && GET_CODE (DECL_RTL (decl)) == MEM
4325 && XEXP (DECL_RTL (decl), 0)
4326 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == SYMBOL_REF)
4327 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl), 0)) = 1;
4330 /* Merge weak status between NEWDECL and OLDDECL. */
4333 merge_weak (newdecl, olddecl)
4337 if (DECL_WEAK (newdecl) == DECL_WEAK (olddecl))
4340 if (DECL_WEAK (newdecl))
4344 /* NEWDECL is weak, but OLDDECL is not. */
4346 /* If we already output the OLDDECL, we're in trouble; we can't
4347 go back and make it weak. This error cannot caught in
4348 declare_weak because the NEWDECL and OLDDECL was not yet
4349 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4350 if (TREE_ASM_WRITTEN (olddecl))
4351 error_with_decl (newdecl,
4352 "weak declaration of `%s' must precede definition");
4354 /* If we've already generated rtl referencing OLDDECL, we may
4355 have done so in a way that will not function properly with
4357 else if (TREE_USED (olddecl)
4358 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl)))
4359 warning_with_decl (newdecl, "weak declaration of `%s' after first use results in unspecified behavior");
4363 /* We put the NEWDECL on the weak_decls list at some point.
4364 Replace it with the OLDDECL. */
4365 for (wd = weak_decls; wd; wd = TREE_CHAIN (wd))
4366 if (TREE_VALUE (wd) == newdecl)
4368 TREE_VALUE (wd) = olddecl;
4371 /* We may not find the entry on the list. If NEWDECL is a
4372 weak alias, then we will have already called
4373 globalize_decl to remove the entry; in that case, we do
4374 not need to do anything. */
4377 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4378 mark_weak (olddecl);
4381 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4382 weak. Just update NEWDECL to indicate that it's weak too. */
4383 mark_weak (newdecl);
4386 /* Declare DECL to be a weak symbol. */
4392 if (! TREE_PUBLIC (decl))
4393 error_with_decl (decl, "weak declaration of `%s' must be public");
4394 else if (TREE_CODE (decl) == FUNCTION_DECL && TREE_ASM_WRITTEN (decl))
4395 error_with_decl (decl, "weak declaration of `%s' must precede definition");
4396 else if (SUPPORTS_WEAK)
4398 if (! DECL_WEAK (decl))
4399 weak_decls = tree_cons (NULL, decl, weak_decls);
4402 warning_with_decl (decl, "weak declaration of `%s' not supported");
4407 /* Emit any pending weak declarations. */
4414 for (t = weak_decls; t; t = TREE_CHAIN (t))
4416 tree decl = TREE_VALUE (t);
4417 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4418 const char *const name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4421 if (! TREE_USED (decl))
4424 #ifdef ASM_WEAKEN_DECL
4425 ASM_WEAKEN_DECL (asm_out_file, decl, name, NULL);
4427 #ifdef ASM_WEAKEN_LABEL
4428 ASM_WEAKEN_LABEL (asm_out_file, name);
4430 #ifdef ASM_OUTPUT_WEAK_ALIAS
4431 warning ("only weak aliases are supported in this configuration");
4439 /* Emit the assembly bits to indicate that DECL is globally visible. */
4442 globalize_decl (decl)
4445 const char *name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4447 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4448 if (DECL_WEAK (decl))
4452 #ifdef ASM_WEAKEN_DECL
4453 ASM_WEAKEN_DECL (asm_out_file, decl, name, 0);
4455 ASM_WEAKEN_LABEL (asm_out_file, name);
4458 /* Remove this function from the pending weak list so that
4459 we do not emit multiple .weak directives for it. */
4460 for (p = &weak_decls; (t = *p) ; )
4462 if (DECL_ASSEMBLER_NAME (decl) == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
4463 *p = TREE_CHAIN (t);
4465 p = &TREE_CHAIN (t);
4471 (*targetm.asm_out.globalize_label) (asm_out_file, name);
4474 /* Emit an assembler directive to make the symbol for DECL an alias to
4475 the symbol for TARGET. */
4478 assemble_alias (decl, target)
4479 tree decl, target ATTRIBUTE_UNUSED;
4483 /* We must force creation of DECL_RTL for debug info generation, even though
4484 we don't use it here. */
4485 make_decl_rtl (decl, NULL);
4487 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4489 #ifdef ASM_OUTPUT_DEF
4490 /* Make name accessible from other files, if appropriate. */
4492 if (TREE_PUBLIC (decl))
4494 globalize_decl (decl);
4495 maybe_assemble_visibility (decl);
4498 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4499 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
4501 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4503 #else /* !ASM_OUTPUT_DEF */
4504 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4505 if (! DECL_WEAK (decl))
4506 warning ("only weak aliases are supported in this configuration");
4508 #ifdef ASM_WEAKEN_DECL
4509 ASM_WEAKEN_DECL (asm_out_file, decl, name, IDENTIFIER_POINTER (target));
4511 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
4514 warning ("alias definitions not supported in this configuration; ignored");
4518 TREE_USED (decl) = 1;
4519 TREE_ASM_WRITTEN (decl) = 1;
4520 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl)) = 1;
4523 /* Emit an assembler directive to set symbol for DECL visibility to
4524 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4527 default_assemble_visibility (decl, vis)
4531 static const char * const visibility_types[] = {
4532 NULL, "internal", "hidden", "protected"
4535 const char *name, *type;
4537 name = (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
4538 type = visibility_types[vis];
4540 #ifdef HAVE_GAS_HIDDEN
4541 fprintf (asm_out_file, "\t.%s\t", type);
4542 assemble_name (asm_out_file, name);
4543 fprintf (asm_out_file, "\n");
4545 warning ("visibility attribute not supported in this configuration; ignored");
4549 /* A helper function to call assemble_visibility when needed for a decl. */
4552 maybe_assemble_visibility (decl)
4555 enum symbol_visibility vis = decl_visibility (decl);
4557 if (vis != VISIBILITY_DEFAULT)
4558 (* targetm.asm_out.visibility) (decl, vis);
4561 /* Returns 1 if the target configuration supports defining public symbols
4562 so that one of them will be chosen at link time instead of generating a
4563 multiply-defined symbol error, whether through the use of weak symbols or
4564 a target-specific mechanism for having duplicates discarded. */
4567 supports_one_only ()
4569 if (SUPPORTS_ONE_ONLY)
4571 return SUPPORTS_WEAK;
4574 /* Set up DECL as a public symbol that can be defined in multiple
4575 translation units without generating a linker error. */
4578 make_decl_one_only (decl)
4581 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL)
4584 TREE_PUBLIC (decl) = 1;
4586 if (TREE_CODE (decl) == VAR_DECL
4587 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
4588 DECL_COMMON (decl) = 1;
4589 else if (SUPPORTS_ONE_ONLY)
4591 #ifdef MAKE_DECL_ONE_ONLY
4592 MAKE_DECL_ONE_ONLY (decl);
4594 DECL_ONE_ONLY (decl) = 1;
4596 else if (SUPPORTS_WEAK)
4597 DECL_WEAK (decl) = 1;
4605 in_named_htab = htab_create_ggc (31, in_named_entry_hash,
4606 in_named_entry_eq, NULL);
4607 const_desc_htab = htab_create_ggc (1009, const_desc_hash,
4608 const_desc_eq, NULL);
4610 const_alias_set = new_alias_set ();
4614 decl_tls_model (decl)
4617 enum tls_model kind;
4618 tree attr = lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl));
4623 attr = TREE_VALUE (TREE_VALUE (attr));
4624 if (TREE_CODE (attr) != STRING_CST)
4626 if (!strcmp (TREE_STRING_POINTER (attr), "local-exec"))
4627 kind = TLS_MODEL_LOCAL_EXEC;
4628 else if (!strcmp (TREE_STRING_POINTER (attr), "initial-exec"))
4629 kind = TLS_MODEL_INITIAL_EXEC;
4630 else if (!strcmp (TREE_STRING_POINTER (attr), "local-dynamic"))
4631 kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
4632 else if (!strcmp (TREE_STRING_POINTER (attr), "global-dynamic"))
4633 kind = TLS_MODEL_GLOBAL_DYNAMIC;
4639 is_local = (*targetm.binds_local_p) (decl);
4643 kind = TLS_MODEL_LOCAL_EXEC;
4645 kind = TLS_MODEL_INITIAL_EXEC;
4647 /* Local dynamic is inefficient when we're not combining the
4648 parts of the address. */
4649 else if (optimize && is_local)
4650 kind = TLS_MODEL_LOCAL_DYNAMIC;
4652 kind = TLS_MODEL_GLOBAL_DYNAMIC;
4653 if (kind < flag_tls_default)
4654 kind = flag_tls_default;
4659 enum symbol_visibility
4660 decl_visibility (decl)
4663 tree attr = lookup_attribute ("visibility", DECL_ATTRIBUTES (decl));
4667 const char *which = TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr)));
4669 if (strcmp (which, "default") == 0)
4670 return VISIBILITY_DEFAULT;
4671 if (strcmp (which, "internal") == 0)
4672 return VISIBILITY_INTERNAL;
4673 if (strcmp (which, "hidden") == 0)
4674 return VISIBILITY_HIDDEN;
4675 if (strcmp (which, "protected") == 0)
4676 return VISIBILITY_PROTECTED;
4681 return VISIBILITY_DEFAULT;
4684 /* Select a set of attributes for section NAME based on the properties
4685 of DECL and whether or not RELOC indicates that DECL's initializer
4686 might contain runtime relocations.
4688 We make the section read-only and executable for a function decl,
4689 read-only for a const data decl, and writable for a non-const data decl. */
4692 default_section_type_flags (decl, name, reloc)
4697 return default_section_type_flags_1 (decl, name, reloc, flag_pic);
4701 default_section_type_flags_1 (decl, name, reloc, shlib)
4709 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
4710 flags = SECTION_CODE;
4711 else if (decl && decl_readonly_section_1 (decl, reloc, shlib))
4714 flags = SECTION_WRITE;
4716 if (decl && DECL_ONE_ONLY (decl))
4717 flags |= SECTION_LINKONCE;
4719 if (decl && TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4720 flags |= SECTION_TLS | SECTION_WRITE;
4722 if (strcmp (name, ".bss") == 0
4723 || strncmp (name, ".bss.", 5) == 0
4724 || strncmp (name, ".gnu.linkonce.b.", 16) == 0
4725 || strcmp (name, ".sbss") == 0
4726 || strncmp (name, ".sbss.", 6) == 0
4727 || strncmp (name, ".gnu.linkonce.sb.", 17) == 0
4728 || strcmp (name, ".tbss") == 0
4729 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4730 flags |= SECTION_BSS;
4732 if (strcmp (name, ".tdata") == 0
4733 || strcmp (name, ".tbss") == 0
4734 || strncmp (name, ".gnu.linkonce.td.", 17) == 0
4735 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4736 flags |= SECTION_TLS;
4738 /* These three sections have special ELF types. They are neither
4739 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4740 want to print a section type (@progbits or @nobits). If someone
4741 is silly enough to emit code or TLS variables to one of these
4742 sections, then don't handle them specially. */
4743 if (!(flags & (SECTION_CODE | SECTION_BSS | SECTION_TLS))
4744 && (strcmp (name, ".init_array") == 0
4745 || strcmp (name, ".fini_array") == 0
4746 || strcmp (name, ".preinit_array") == 0))
4747 flags |= SECTION_NOTYPE;
4752 /* Output assembly to switch to section NAME with attribute FLAGS.
4753 Four variants for common object file formats. */
4756 default_no_named_section (name, flags)
4757 const char *name ATTRIBUTE_UNUSED;
4758 unsigned int flags ATTRIBUTE_UNUSED;
4760 /* Some object formats don't support named sections at all. The
4761 front-end should already have flagged this as an error. */
4766 default_elf_asm_named_section (name, flags)
4770 char flagchars[10], *f = flagchars;
4772 if (! named_section_first_declaration (name))
4774 fprintf (asm_out_file, "\t.section\t%s\n", name);
4778 if (!(flags & SECTION_DEBUG))
4780 if (flags & SECTION_WRITE)
4782 if (flags & SECTION_CODE)
4784 if (flags & SECTION_SMALL)
4786 if (flags & SECTION_MERGE)
4788 if (flags & SECTION_STRINGS)
4790 if (flags & SECTION_TLS)
4794 fprintf (asm_out_file, "\t.section\t%s,\"%s\"", name, flagchars);
4796 if (!(flags & SECTION_NOTYPE))
4800 if (flags & SECTION_BSS)
4805 fprintf (asm_out_file, ",@%s", type);
4807 if (flags & SECTION_ENTSIZE)
4808 fprintf (asm_out_file, ",%d", flags & SECTION_ENTSIZE);
4811 putc ('\n', asm_out_file);
4815 default_coff_asm_named_section (name, flags)
4819 char flagchars[8], *f = flagchars;
4821 if (flags & SECTION_WRITE)
4823 if (flags & SECTION_CODE)
4827 fprintf (asm_out_file, "\t.section\t%s,\"%s\"\n", name, flagchars);
4831 default_pe_asm_named_section (name, flags)
4835 default_coff_asm_named_section (name, flags);
4837 if (flags & SECTION_LINKONCE)
4839 /* Functions may have been compiled at various levels of
4840 optimization so we can't use `same_size' here.
4841 Instead, have the linker pick one. */
4842 fprintf (asm_out_file, "\t.linkonce %s\n",
4843 (flags & SECTION_CODE ? "discard" : "same_size"));
4847 /* Used for vtable gc in GNU binutils. Record that the pointer at OFFSET
4848 from SYMBOL is used in all classes derived from SYMBOL. */
4851 assemble_vtable_entry (symbol, offset)
4853 HOST_WIDE_INT offset;
4855 fputs ("\t.vtable_entry ", asm_out_file);
4856 output_addr_const (asm_out_file, symbol);
4857 fprintf (asm_out_file, ", " HOST_WIDE_INT_PRINT_DEC "\n", offset);
4860 /* Used for vtable gc in GNU binutils. Record the class hierarchy by noting
4861 that the vtable symbol CHILD is derived from the vtable symbol PARENT. */
4864 assemble_vtable_inherit (child, parent)
4867 fputs ("\t.vtable_inherit ", asm_out_file);
4868 output_addr_const (asm_out_file, child);
4869 fputs (", ", asm_out_file);
4870 output_addr_const (asm_out_file, parent);
4871 fputc ('\n', asm_out_file);
4874 /* The lame default section selector. */
4877 default_select_section (decl, reloc, align)
4880 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED;
4882 bool readonly = false;
4886 if (decl_readonly_section (decl, reloc))
4889 else if (TREE_CODE (decl) == CONSTRUCTOR)
4891 if (! ((flag_pic && reloc)
4892 || !TREE_READONLY (decl)
4893 || TREE_SIDE_EFFECTS (decl)
4894 || !TREE_CONSTANT (decl)))
4897 else if (TREE_CODE (decl) == STRING_CST)
4898 readonly = !flag_writable_strings;
4899 else if (! (flag_pic && reloc))
4903 readonly_data_section ();
4908 /* A helper function for default_elf_select_section and
4909 default_elf_unique_section. Categorizes the DECL. */
4911 enum section_category
4916 SECCAT_RODATA_MERGE_STR,
4917 SECCAT_RODATA_MERGE_STR_INIT,
4918 SECCAT_RODATA_MERGE_CONST,
4923 /* To optimize loading of shared programs, define following subsections
4925 _REL Contains data that has relocations, so they get grouped
4926 together and dynamic linker will visit fewer pages in memory.
4927 _RO Contains data that is otherwise read-only. This is useful
4928 with prelinking as most relocations won't be dynamically
4929 linked and thus stay read only.
4930 _LOCAL Marks data containing relocations only to local objects.
4931 These relocations will get fully resolved by prelinking. */
4933 SECCAT_DATA_REL_LOCAL,
4935 SECCAT_DATA_REL_RO_LOCAL,
4945 static enum section_category
4946 categorize_decl_for_section PARAMS ((tree, int, int));
4948 static enum section_category
4949 categorize_decl_for_section (decl, reloc, shlib)
4954 enum section_category ret;
4956 if (TREE_CODE (decl) == FUNCTION_DECL)
4958 else if (TREE_CODE (decl) == STRING_CST)
4960 if (flag_writable_strings)
4963 return SECCAT_RODATA_MERGE_STR;
4965 else if (TREE_CODE (decl) == VAR_DECL)
4967 if (DECL_INITIAL (decl) == NULL
4968 || DECL_INITIAL (decl) == error_mark_node)
4970 else if (! TREE_READONLY (decl)
4971 || TREE_SIDE_EFFECTS (decl)
4972 || ! TREE_CONSTANT (DECL_INITIAL (decl)))
4974 if (shlib && (reloc & 2))
4975 ret = SECCAT_DATA_REL;
4976 else if (shlib && reloc)
4977 ret = SECCAT_DATA_REL_LOCAL;
4981 else if (shlib && (reloc & 2))
4982 ret = SECCAT_DATA_REL_RO;
4983 else if (shlib && reloc)
4984 ret = SECCAT_DATA_REL_RO_LOCAL;
4985 else if (reloc || flag_merge_constants < 2)
4986 /* C and C++ don't allow different variables to share the same
4987 location. -fmerge-all-constants allows even that (at the
4988 expense of not conforming). */
4989 ret = SECCAT_RODATA;
4990 else if (TREE_CODE (DECL_INITIAL (decl)) == STRING_CST)
4991 ret = SECCAT_RODATA_MERGE_STR_INIT;
4993 ret = SECCAT_RODATA_MERGE_CONST;
4995 else if (TREE_CODE (decl) == CONSTRUCTOR)
4997 if ((shlib && reloc)
4998 || TREE_SIDE_EFFECTS (decl)
4999 || ! TREE_CONSTANT (decl))
5002 ret = SECCAT_RODATA;
5005 ret = SECCAT_RODATA;
5007 /* There are no read-only thread-local sections. */
5008 if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
5010 if (ret == SECCAT_BSS)
5016 /* If the target uses small data sections, select it. */
5017 else if ((*targetm.in_small_data_p) (decl))
5019 if (ret == SECCAT_BSS)
5021 else if (targetm.have_srodata_section && ret == SECCAT_RODATA)
5022 ret = SECCAT_SRODATA;
5031 decl_readonly_section (decl, reloc)
5035 return decl_readonly_section_1 (decl, reloc, flag_pic);
5039 decl_readonly_section_1 (decl, reloc, shlib)
5044 switch (categorize_decl_for_section (decl, reloc, shlib))
5047 case SECCAT_RODATA_MERGE_STR:
5048 case SECCAT_RODATA_MERGE_STR_INIT:
5049 case SECCAT_RODATA_MERGE_CONST:
5050 case SECCAT_SRODATA:
5059 /* Select a section based on the above categorization. */
5062 default_elf_select_section (decl, reloc, align)
5065 unsigned HOST_WIDE_INT align;
5067 default_elf_select_section_1 (decl, reloc, align, flag_pic);
5071 default_elf_select_section_1 (decl, reloc, align, shlib)
5074 unsigned HOST_WIDE_INT align;
5077 switch (categorize_decl_for_section (decl, reloc, shlib))
5080 /* We're not supposed to be called on FUNCTION_DECLs. */
5083 readonly_data_section ();
5085 case SECCAT_RODATA_MERGE_STR:
5086 mergeable_string_section (decl, align, 0);
5088 case SECCAT_RODATA_MERGE_STR_INIT:
5089 mergeable_string_section (DECL_INITIAL (decl), align, 0);
5091 case SECCAT_RODATA_MERGE_CONST:
5092 mergeable_constant_section (DECL_MODE (decl), align, 0);
5094 case SECCAT_SRODATA:
5095 named_section (NULL_TREE, ".sdata2", reloc);
5100 case SECCAT_DATA_REL:
5101 named_section (NULL_TREE, ".data.rel", reloc);
5103 case SECCAT_DATA_REL_LOCAL:
5104 named_section (NULL_TREE, ".data.rel.local", reloc);
5106 case SECCAT_DATA_REL_RO:
5107 named_section (NULL_TREE, ".data.rel.ro", reloc);
5109 case SECCAT_DATA_REL_RO_LOCAL:
5110 named_section (NULL_TREE, ".data.rel.ro.local", reloc);
5113 named_section (NULL_TREE, ".sdata", reloc);
5116 named_section (NULL_TREE, ".tdata", reloc);
5119 #ifdef BSS_SECTION_ASM_OP
5122 named_section (NULL_TREE, ".bss", reloc);
5126 named_section (NULL_TREE, ".sbss", reloc);
5129 named_section (NULL_TREE, ".tbss", reloc);
5136 /* Construct a unique section name based on the decl name and the
5137 categorization performed above. */
5140 default_unique_section (decl, reloc)
5144 default_unique_section_1 (decl, reloc, flag_pic);
5148 default_unique_section_1 (decl, reloc, shlib)
5153 bool one_only = DECL_ONE_ONLY (decl);
5154 const char *prefix, *name;
5158 switch (categorize_decl_for_section (decl, reloc, shlib))
5161 prefix = one_only ? ".gnu.linkonce.t." : ".text.";
5164 case SECCAT_RODATA_MERGE_STR:
5165 case SECCAT_RODATA_MERGE_STR_INIT:
5166 case SECCAT_RODATA_MERGE_CONST:
5167 prefix = one_only ? ".gnu.linkonce.r." : ".rodata.";
5169 case SECCAT_SRODATA:
5170 prefix = one_only ? ".gnu.linkonce.s2." : ".sdata2.";
5173 case SECCAT_DATA_REL:
5174 case SECCAT_DATA_REL_LOCAL:
5175 case SECCAT_DATA_REL_RO:
5176 case SECCAT_DATA_REL_RO_LOCAL:
5177 prefix = one_only ? ".gnu.linkonce.d." : ".data.";
5180 prefix = one_only ? ".gnu.linkonce.s." : ".sdata.";
5183 prefix = one_only ? ".gnu.linkonce.b." : ".bss.";
5186 prefix = one_only ? ".gnu.linkonce.sb." : ".sbss.";
5189 prefix = one_only ? ".gnu.linkonce.td." : ".tdata.";
5192 prefix = one_only ? ".gnu.linkonce.tb." : ".tbss.";
5197 plen = strlen (prefix);
5199 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
5200 name = (* targetm.strip_name_encoding) (name);
5201 nlen = strlen (name);
5203 string = alloca (nlen + plen + 1);
5204 memcpy (string, prefix, plen);
5205 memcpy (string + plen, name, nlen + 1);
5207 DECL_SECTION_NAME (decl) = build_string (nlen + plen, string);
5211 default_select_rtx_section (mode, x, align)
5212 enum machine_mode mode ATTRIBUTE_UNUSED;
5214 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED;
5217 switch (GET_CODE (x))
5229 readonly_data_section ();
5233 default_elf_select_rtx_section (mode, x, align)
5234 enum machine_mode mode;
5236 unsigned HOST_WIDE_INT align;
5238 /* ??? Handle small data here somehow. */
5241 switch (GET_CODE (x))
5245 named_section (NULL_TREE, ".data.rel.ro", 3);
5249 named_section (NULL_TREE, ".data.rel.ro.local", 1);
5256 mergeable_constant_section (mode, align, 0);
5259 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
5262 default_encode_section_info (decl, rtl, first)
5265 int first ATTRIBUTE_UNUSED;
5270 /* Careful not to prod global register variables. */
5271 if (GET_CODE (rtl) != MEM)
5273 symbol = XEXP (rtl, 0);
5274 if (GET_CODE (symbol) != SYMBOL_REF)
5278 if (TREE_CODE (decl) == FUNCTION_DECL)
5279 flags |= SYMBOL_FLAG_FUNCTION;
5280 if ((*targetm.binds_local_p) (decl))
5281 flags |= SYMBOL_FLAG_LOCAL;
5282 if ((*targetm.in_small_data_p) (decl))
5283 flags |= SYMBOL_FLAG_SMALL;
5284 if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
5285 flags |= decl_tls_model (decl) << SYMBOL_FLAG_TLS_SHIFT;
5286 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
5287 being PUBLIC, the thing *must* be defined in this translation unit.
5288 Prevent this buglet from being propagated into rtl code as well. */
5289 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
5290 flags |= SYMBOL_FLAG_EXTERNAL;
5292 SYMBOL_REF_FLAGS (symbol) = flags;
5295 /* By default, we do nothing for encode_section_info, so we need not
5296 do anything but discard the '*' marker. */
5299 default_strip_name_encoding (str)
5302 return str + (*str == '*');
5305 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5306 wrt cross-module name binding. */
5309 default_binds_local_p (exp)
5312 return default_binds_local_p_1 (exp, flag_shlib);
5316 default_binds_local_p_1 (exp, shlib)
5322 /* A non-decl is an entry in the constant pool. */
5325 /* Static variables are always local. */
5326 else if (! TREE_PUBLIC (exp))
5328 /* A variable is local if the user tells us so. */
5329 else if (decl_visibility (exp) != VISIBILITY_DEFAULT)
5331 /* Otherwise, variables defined outside this object may not be local. */
5332 else if (DECL_EXTERNAL (exp))
5334 /* Linkonce and weak data are never local. */
5335 else if (DECL_ONE_ONLY (exp) || DECL_WEAK (exp))
5337 /* If PIC, then assume that any global name can be overridden by
5338 symbols resolved from other modules. */
5341 /* Uninitialized COMMON variable may be unified with symbols
5342 resolved from other modules. */
5343 else if (DECL_COMMON (exp)
5344 && (DECL_INITIAL (exp) == NULL
5345 || DECL_INITIAL (exp) == error_mark_node))
5347 /* Otherwise we're left with initialized (or non-common) global data
5348 which is of necessity defined locally. */
5355 /* Determine whether or not a pointer mode is valid. Assume defaults
5356 of ptr_mode or Pmode - can be overridden. */
5358 default_valid_pointer_mode (mode)
5359 enum machine_mode mode;
5361 return (mode == ptr_mode || mode == Pmode);
5364 /* Default function to output code that will globalize a label. A
5365 target must define GLOBAL_ASM_OP or provide it's own function to
5366 globalize a label. */
5367 #ifdef GLOBAL_ASM_OP
5369 default_globalize_label (stream, name)
5373 fputs (GLOBAL_ASM_OP, stream);
5374 assemble_name (stream, name);
5375 putc ('\n', stream);
5377 #endif /* GLOBAL_ASM_OP */
5379 /* This is how to output an internal numbered label where PREFIX is
5380 the class of label and LABELNO is the number within the class. */
5383 default_internal_label (stream, prefix, labelno)
5386 unsigned long labelno;
5388 char *const buf = alloca (40 + strlen (prefix));
5389 ASM_GENERATE_INTERNAL_LABEL (buf, prefix, labelno);
5390 ASM_OUTPUT_LABEL (stream, buf);
5393 /* This is the default behavior at the beginning of a file. It's
5394 controlled by two other target-hook toggles. */
5396 default_file_start ()
5398 if (targetm.file_start_app_off && !flag_verbose_asm)
5399 fputs (ASM_APP_OFF, asm_out_file);
5401 if (targetm.file_start_file_directive)
5402 output_file_directive (asm_out_file, main_input_filename);
5405 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5406 which emits a special section directive used to indicate whether or
5407 not this object file needs an executable stack. This is primarily
5408 a GNU extension to ELF but could be used on other targets. */
5410 file_end_indicate_exec_stack ()
5412 unsigned int flags = SECTION_DEBUG;
5413 if (trampolines_created)
5414 flags |= SECTION_CODE;
5416 named_section_flags (".note.GNU-stack", flags);
5419 #include "gt-varasm.h"