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, 2004, 2005
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 /* This file handles generation of all the assembler code
25 *except* the instructions of a function.
26 This includes declarations of variables and their initial values.
28 We also output the assembler code for constants stored in memory
29 and are responsible for combining constants with the same value. */
33 #include "coretypes.h"
40 #include "hard-reg-set.h"
48 #include "langhooks.h"
52 #include "tree-mudflap.h"
54 #include "cfglayout.h"
56 #ifdef XCOFF_DEBUGGING_INFO
57 #include "xcoffout.h" /* Needed for external data
58 declarations for e.g. AIX 4.x. */
61 /* The (assembler) name of the first globally-visible object output. */
62 const char *first_global_object_name;
63 const char *weak_global_object_name;
66 struct constant_descriptor_rtx;
67 struct rtx_constant_pool;
69 struct varasm_status GTY(())
71 /* If we're using a per-function constant pool, this is it. */
72 struct rtx_constant_pool *pool;
74 /* Number of tree-constants deferred during the expansion of this
76 unsigned int deferred_constants;
79 #define n_deferred_constants (cfun->varasm->deferred_constants)
81 /* Number for making the label on the next
82 constant that is stored in memory. */
84 static GTY(()) int const_labelno;
86 /* Carry information from ASM_DECLARE_OBJECT_NAME
87 to ASM_FINISH_DECLARE_OBJECT. */
89 int size_directive_output;
91 /* The last decl for which assemble_variable was called,
92 if it did ASM_DECLARE_OBJECT_NAME.
93 If the last call to assemble_variable didn't do that,
96 tree last_assemble_variable_decl;
98 /* The following global variable indicates if the section label for the
99 "cold" section of code has been output yet to the assembler. The
100 label is useful when running gdb. This is part of the optimization that
101 partitions hot and cold basic blocks into separate sections of the .o
104 static bool unlikely_section_label_printed = false;
106 /* The following global variable indicates the label name to be put at
107 the start of the first cold section within each function, when
108 partitioning basic blocks into hot and cold sections. */
110 static char *unlikely_section_label = NULL;
112 /* The following global variable indicates the section name to be used
113 for the current cold section, when partitioning hot and cold basic
114 blocks into separate sections. */
116 static char *unlikely_text_section_name = NULL;
118 /* We give all constants their own alias set. Perhaps redundant with
119 MEM_READONLY_P, but pre-dates it. */
121 static HOST_WIDE_INT const_alias_set;
123 static const char *strip_reg_name (const char *);
124 static int contains_pointers_p (tree);
125 #ifdef ASM_OUTPUT_EXTERNAL
126 static bool incorporeal_function_p (tree);
128 static void decode_addr_const (tree, struct addr_const *);
129 static hashval_t const_desc_hash (const void *);
130 static int const_desc_eq (const void *, const void *);
131 static hashval_t const_hash_1 (const tree);
132 static int compare_constant (const tree, const tree);
133 static tree copy_constant (tree);
134 static void output_constant_def_contents (rtx);
135 static void output_addressed_constants (tree);
136 static unsigned HOST_WIDE_INT array_size_for_constructor (tree);
137 static unsigned min_align (unsigned, unsigned);
138 static void output_constructor (tree, unsigned HOST_WIDE_INT, unsigned int);
139 static void globalize_decl (tree);
140 static void maybe_assemble_visibility (tree);
141 static int in_named_entry_eq (const void *, const void *);
142 static hashval_t in_named_entry_hash (const void *);
143 #ifdef BSS_SECTION_ASM_OP
144 #ifdef ASM_OUTPUT_BSS
145 static void asm_output_bss (FILE *, tree, const char *,
146 unsigned HOST_WIDE_INT, unsigned HOST_WIDE_INT);
148 #ifdef ASM_OUTPUT_ALIGNED_BSS
149 static void asm_output_aligned_bss (FILE *, tree, const char *,
150 unsigned HOST_WIDE_INT, int)
153 #endif /* BSS_SECTION_ASM_OP */
154 static bool asm_emit_uninitialised (tree, const char*,
155 unsigned HOST_WIDE_INT,
156 unsigned HOST_WIDE_INT);
157 static void mark_weak (tree);
159 enum in_section { no_section, in_text, in_unlikely_executed_text, in_data,
161 #ifdef BSS_SECTION_ASM_OP
164 #ifdef CTORS_SECTION_ASM_OP
167 #ifdef DTORS_SECTION_ASM_OP
170 #ifdef READONLY_DATA_SECTION_ASM_OP
173 #ifdef EXTRA_SECTIONS
177 static GTY(()) enum in_section in_section = no_section;
179 /* Return a nonzero value if DECL has a section attribute. */
180 #ifndef IN_NAMED_SECTION
181 #define IN_NAMED_SECTION(DECL) \
182 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
183 && DECL_SECTION_NAME (DECL) != NULL_TREE)
186 /* Text of section name when in_section == in_named. */
187 static GTY(()) const char *in_named_name;
189 /* Hash table of flags that have been used for a particular named section. */
191 struct in_named_entry GTY(())
198 static GTY((param_is (struct in_named_entry))) htab_t in_named_htab;
200 /* Define functions like text_section for any extra sections. */
201 #ifdef EXTRA_SECTION_FUNCTIONS
202 EXTRA_SECTION_FUNCTIONS
205 /* Tell assembler to switch to text section. */
210 if (in_section != in_text)
212 in_section = in_text;
213 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
217 /* Tell assembler to switch to unlikely-to-be-executed text section. */
220 unlikely_text_section (void)
225 if (! unlikely_text_section_name)
227 if (DECL_SECTION_NAME (current_function_decl)
228 && (strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME
229 (current_function_decl)),
230 HOT_TEXT_SECTION_NAME) != 0)
231 && (strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME
232 (current_function_decl)),
233 UNLIKELY_EXECUTED_TEXT_SECTION_NAME) != 0))
235 name = TREE_STRING_POINTER (DECL_SECTION_NAME
236 (current_function_decl));
238 unlikely_text_section_name = xmalloc ((len + 10) * sizeof (char));
239 strcpy (unlikely_text_section_name, name);
240 strcat (unlikely_text_section_name, "_unlikely");
244 len = strlen (UNLIKELY_EXECUTED_TEXT_SECTION_NAME);
245 unlikely_text_section_name = xmalloc (len+1 * sizeof (char));
246 strcpy (unlikely_text_section_name,
247 UNLIKELY_EXECUTED_TEXT_SECTION_NAME);
251 if ((in_section != in_unlikely_executed_text)
252 && (in_section != in_named
253 || strcmp (in_named_name, unlikely_text_section_name) != 0))
255 named_section (NULL_TREE, unlikely_text_section_name, 0);
256 in_section = in_unlikely_executed_text;
258 if (!unlikely_section_label_printed)
260 ASM_OUTPUT_LABEL (asm_out_file, unlikely_section_label);
261 unlikely_section_label_printed = true;
266 /* Tell assembler to switch to data section. */
271 if (in_section != in_data)
273 in_section = in_data;
274 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
278 /* Tell assembler to switch to read-only data section. This is normally
282 readonly_data_section (void)
284 #ifdef READONLY_DATA_SECTION
285 READONLY_DATA_SECTION (); /* Note this can call data_section. */
287 #ifdef READONLY_DATA_SECTION_ASM_OP
288 if (in_section != in_readonly_data)
290 in_section = in_readonly_data;
291 fputs (READONLY_DATA_SECTION_ASM_OP, asm_out_file);
292 fputc ('\n', asm_out_file);
300 /* Determine if we're in the text section. */
303 in_text_section (void)
305 return in_section == in_text;
308 /* Determine if we're in the unlikely-to-be-executed text section. */
311 in_unlikely_text_section (void)
315 ret_val = ((in_section == in_unlikely_executed_text)
316 || (in_section == in_named
317 && unlikely_text_section_name
318 && strcmp (in_named_name, unlikely_text_section_name) == 0));
323 /* Determine if we're in the data section. */
326 in_data_section (void)
328 return in_section == in_data;
331 /* Helper routines for maintaining in_named_htab. */
334 in_named_entry_eq (const void *p1, const void *p2)
336 const struct in_named_entry *old = p1;
337 const char *new = p2;
339 return strcmp (old->name, new) == 0;
343 in_named_entry_hash (const void *p)
345 const struct in_named_entry *old = p;
346 return htab_hash_string (old->name);
349 /* If SECTION has been seen before as a named section, return the flags
350 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
351 set of flags for a section to have, so 0 does not mean that the section
352 has not been seen. */
355 get_named_section_flags (const char *section)
357 struct in_named_entry **slot;
359 slot = (struct in_named_entry **)
360 htab_find_slot_with_hash (in_named_htab, section,
361 htab_hash_string (section), NO_INSERT);
363 return slot ? (*slot)->flags : 0;
366 /* Returns true if the section has been declared before. Sets internal
367 flag on this section in in_named_hash so subsequent calls on this
368 section will return false. */
371 named_section_first_declaration (const char *name)
373 struct in_named_entry **slot;
375 slot = (struct in_named_entry **)
376 htab_find_slot_with_hash (in_named_htab, name,
377 htab_hash_string (name), NO_INSERT);
378 if (! (*slot)->declared)
380 (*slot)->declared = true;
390 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
391 different set of flags, return false. */
394 set_named_section_flags (const char *section, unsigned int flags)
396 struct in_named_entry **slot, *entry;
398 slot = (struct in_named_entry **)
399 htab_find_slot_with_hash (in_named_htab, section,
400 htab_hash_string (section), INSERT);
405 entry = ggc_alloc (sizeof (*entry));
407 entry->name = ggc_strdup (section);
408 entry->flags = flags;
409 entry->declared = false;
411 else if (entry->flags != flags)
417 /* Tell assembler to change to section NAME with attributes FLAGS. If
418 DECL is non-NULL, it is the VAR_DECL or FUNCTION_DECL with which
419 this section is associated. */
422 named_section_real (const char *name, unsigned int flags, tree decl)
424 if (in_section != in_named || strcmp (name, in_named_name) != 0)
426 if (! set_named_section_flags (name, flags))
429 targetm.asm_out.named_section (name, flags, decl);
431 if (flags & SECTION_FORGET)
432 in_section = no_section;
435 in_named_name = ggc_strdup (name);
436 in_section = in_named;
441 /* Tell assembler to change to section NAME for DECL.
442 If DECL is NULL, just switch to section NAME.
443 If NAME is NULL, get the name from DECL.
444 If RELOC is 1, the initializer for DECL contains relocs. */
447 named_section (tree decl, const char *name, int reloc)
451 if (decl != NULL_TREE && !DECL_P (decl))
454 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
456 if (strcmp (name, UNLIKELY_EXECUTED_TEXT_SECTION_NAME) == 0
457 && !unlikely_text_section_name)
459 unlikely_text_section_name = xmalloc
460 (strlen (UNLIKELY_EXECUTED_TEXT_SECTION_NAME) + 1
462 strcpy (unlikely_text_section_name,
463 UNLIKELY_EXECUTED_TEXT_SECTION_NAME);
466 flags = targetm.section_type_flags (decl, name, reloc);
468 /* Sanity check user variables for flag changes. Non-user
469 section flag changes will abort in named_section_flags.
470 However, don't complain if SECTION_OVERRIDE is set.
471 We trust that the setter knows that it is safe to ignore
472 the default flags for this decl. */
473 if (decl && ! set_named_section_flags (name, flags))
475 flags = get_named_section_flags (name);
476 if ((flags & SECTION_OVERRIDE) == 0)
477 error ("%J%D causes a section type conflict", decl, decl);
480 named_section_real (name, flags, decl);
483 /* If required, set DECL_SECTION_NAME to a unique name. */
486 resolve_unique_section (tree decl, int reloc ATTRIBUTE_UNUSED,
487 int flag_function_or_data_sections)
489 if (DECL_SECTION_NAME (decl) == NULL_TREE
490 && targetm.have_named_sections
491 && (flag_function_or_data_sections
492 || DECL_ONE_ONLY (decl)))
493 targetm.asm_out.unique_section (decl, reloc);
496 #ifdef BSS_SECTION_ASM_OP
498 /* Tell the assembler to switch to the bss section. */
503 if (in_section != in_bss)
505 fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP);
510 #ifdef ASM_OUTPUT_BSS
512 /* Utility function for ASM_OUTPUT_BSS for targets to use if
513 they don't support alignments in .bss.
514 ??? It is believed that this function will work in most cases so such
515 support is localized here. */
518 asm_output_bss (FILE *file, tree decl ATTRIBUTE_UNUSED,
520 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
521 unsigned HOST_WIDE_INT rounded)
523 targetm.asm_out.globalize_label (file, name);
525 #ifdef ASM_DECLARE_OBJECT_NAME
526 last_assemble_variable_decl = decl;
527 ASM_DECLARE_OBJECT_NAME (file, name, decl);
529 /* Standard thing is just output label for the object. */
530 ASM_OUTPUT_LABEL (file, name);
531 #endif /* ASM_DECLARE_OBJECT_NAME */
532 ASM_OUTPUT_SKIP (file, rounded ? rounded : 1);
537 #ifdef ASM_OUTPUT_ALIGNED_BSS
539 /* Utility function for targets to use in implementing
540 ASM_OUTPUT_ALIGNED_BSS.
541 ??? It is believed that this function will work in most cases so such
542 support is localized here. */
545 asm_output_aligned_bss (FILE *file, tree decl ATTRIBUTE_UNUSED,
546 const char *name, unsigned HOST_WIDE_INT size,
550 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
551 #ifdef ASM_DECLARE_OBJECT_NAME
552 last_assemble_variable_decl = decl;
553 ASM_DECLARE_OBJECT_NAME (file, name, decl);
555 /* Standard thing is just output label for the object. */
556 ASM_OUTPUT_LABEL (file, name);
557 #endif /* ASM_DECLARE_OBJECT_NAME */
558 ASM_OUTPUT_SKIP (file, size ? size : 1);
563 #endif /* BSS_SECTION_ASM_OP */
565 /* Switch to the section for function DECL.
567 If DECL is NULL_TREE, switch to the text section. We can be passed
568 NULL_TREE under some circumstances by dbxout.c at least. */
571 function_section (tree decl)
573 if (decl == NULL_TREE)
577 /* ??? Typical use of this function maybe shouldn't be looking
578 for unlikely blocks at all - in the event that an entire
579 function is going into the unlikely-execute section, that
580 should be reflected in its DECL_SECTION_NAME. */
581 rtx insns = cfun && cfun->emit ? get_insns () : 0;
582 bool unlikely = insns && scan_ahead_for_unlikely_executed_note (insns);
584 #ifdef USE_SELECT_SECTION_FOR_FUNCTIONS
585 targetm.asm_out.select_section (decl, unlikely, DECL_ALIGN (decl));
588 unlikely_text_section ();
589 else if (DECL_SECTION_NAME (decl))
590 named_section (decl, 0, 0);
597 /* Switch to read-only data section associated with function DECL. */
600 default_function_rodata_section (tree decl)
602 if (decl != NULL_TREE && DECL_SECTION_NAME (decl))
604 const char *name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
606 /* For .gnu.linkonce.t.foo we want to use .gnu.linkonce.r.foo. */
607 if (DECL_ONE_ONLY (decl) && strncmp (name, ".gnu.linkonce.t.", 16) == 0)
609 size_t len = strlen (name) + 1;
610 char *rname = alloca (len);
612 memcpy (rname, name, len);
614 named_section_real (rname, SECTION_LINKONCE, decl);
617 /* For .text.foo we want to use .rodata.foo. */
618 else if (flag_function_sections && flag_data_sections
619 && strncmp (name, ".text.", 6) == 0)
621 size_t len = strlen (name) + 1;
622 char *rname = alloca (len + 2);
624 memcpy (rname, ".rodata", 7);
625 memcpy (rname + 7, name + 5, len - 5);
626 named_section_flags (rname, 0);
631 readonly_data_section ();
634 /* Switch to read-only data section associated with function DECL
635 for targets where that section should be always the single
636 readonly data section. */
639 default_no_function_rodata_section (tree decl ATTRIBUTE_UNUSED)
641 readonly_data_section ();
644 /* Switch to section for variable DECL. RELOC is the same as the
645 argument to SELECT_SECTION. */
648 variable_section (tree decl, int reloc)
650 if (IN_NAMED_SECTION (decl))
651 named_section (decl, NULL, reloc);
653 targetm.asm_out.select_section (decl, reloc, DECL_ALIGN (decl));
656 /* Tell assembler to switch to the section for string merging. */
659 mergeable_string_section (tree decl ATTRIBUTE_UNUSED,
660 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED,
661 unsigned int flags ATTRIBUTE_UNUSED)
663 if (HAVE_GAS_SHF_MERGE && flag_merge_constants
664 && TREE_CODE (decl) == STRING_CST
665 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
667 && TREE_STRING_LENGTH (decl) >= int_size_in_bytes (TREE_TYPE (decl)))
669 enum machine_mode mode;
670 unsigned int modesize;
675 mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (decl)));
676 modesize = GET_MODE_BITSIZE (mode);
677 if (modesize >= 8 && modesize <= 256
678 && (modesize & (modesize - 1)) == 0)
680 if (align < modesize)
683 str = TREE_STRING_POINTER (decl);
684 len = TREE_STRING_LENGTH (decl);
685 unit = GET_MODE_SIZE (mode);
687 /* Check for embedded NUL characters. */
688 for (i = 0; i < len; i += unit)
690 for (j = 0; j < unit; j++)
691 if (str[i + j] != '\0')
698 sprintf (name, ".rodata.str%d.%d", modesize / 8,
700 flags |= (modesize / 8) | SECTION_MERGE | SECTION_STRINGS;
701 if (!i && modesize < align)
703 /* A "" string with requested alignment greater than
704 character size might cause a problem:
705 if some other string required even bigger
706 alignment than "", then linker might think the
707 "" is just part of padding after some other string
708 and not put it into the hash table initially.
709 But this means "" could have smaller alignment
711 #ifdef ASM_OUTPUT_SECTION_START
712 named_section_flags (name, flags);
713 ASM_OUTPUT_SECTION_START (asm_out_file);
715 readonly_data_section ();
720 named_section_flags (name, flags);
726 readonly_data_section ();
729 /* Tell assembler to switch to the section for constant merging. */
732 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED,
733 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED,
734 unsigned int flags ATTRIBUTE_UNUSED)
736 unsigned int modesize = GET_MODE_BITSIZE (mode);
738 if (HAVE_GAS_SHF_MERGE && flag_merge_constants
744 && (align & (align - 1)) == 0)
748 sprintf (name, ".rodata.cst%d", (int) (align / 8));
749 flags |= (align / 8) | SECTION_MERGE;
750 named_section_flags (name, flags);
754 readonly_data_section ();
757 /* Given NAME, a putative register name, discard any customary prefixes. */
760 strip_reg_name (const char *name)
762 #ifdef REGISTER_PREFIX
763 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
764 name += strlen (REGISTER_PREFIX);
766 if (name[0] == '%' || name[0] == '#')
771 /* The user has asked for a DECL to have a particular name. Set (or
772 change) it in such a way that we don't prefix an underscore to
775 set_user_assembler_name (tree decl, const char *name)
777 char *starred = alloca (strlen (name) + 2);
779 strcpy (starred + 1, name);
780 change_decl_assembler_name (decl, get_identifier (starred));
781 SET_DECL_RTL (decl, NULL_RTX);
784 /* Decode an `asm' spec for a declaration as a register name.
785 Return the register number, or -1 if nothing specified,
786 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
787 or -3 if ASMSPEC is `cc' and is not recognized,
788 or -4 if ASMSPEC is `memory' and is not recognized.
789 Accept an exact spelling or a decimal number.
790 Prefixes such as % are optional. */
793 decode_reg_name (const char *asmspec)
799 /* Get rid of confusing prefixes. */
800 asmspec = strip_reg_name (asmspec);
802 /* Allow a decimal number as a "register name". */
803 for (i = strlen (asmspec) - 1; i >= 0; i--)
804 if (! ISDIGIT (asmspec[i]))
806 if (asmspec[0] != 0 && i < 0)
809 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
815 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
817 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
820 #ifdef ADDITIONAL_REGISTER_NAMES
822 static const struct { const char *const name; const int number; } table[]
823 = ADDITIONAL_REGISTER_NAMES;
825 for (i = 0; i < (int) ARRAY_SIZE (table); i++)
826 if (! strcmp (asmspec, table[i].name))
827 return table[i].number;
829 #endif /* ADDITIONAL_REGISTER_NAMES */
831 if (!strcmp (asmspec, "memory"))
834 if (!strcmp (asmspec, "cc"))
843 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
844 have static storage duration. In other words, it should not be an
845 automatic variable, including PARM_DECLs.
847 There is, however, one exception: this function handles variables
848 explicitly placed in a particular register by the user.
850 This is never called for PARM_DECL nodes. */
853 make_decl_rtl (tree decl)
855 const char *name = 0;
859 /* Check that we are not being given an automatic variable. */
860 /* A weak alias has TREE_PUBLIC set but not the other bits. */
861 if (TREE_CODE (decl) == PARM_DECL
862 || TREE_CODE (decl) == RESULT_DECL
863 || (TREE_CODE (decl) == VAR_DECL
864 && !TREE_STATIC (decl)
865 && !TREE_PUBLIC (decl)
866 && !DECL_EXTERNAL (decl)
867 && !DECL_REGISTER (decl)))
869 /* And that we were not given a type or a label. */
870 else if (TREE_CODE (decl) == TYPE_DECL
871 || TREE_CODE (decl) == LABEL_DECL)
874 /* For a duplicate declaration, we can be called twice on the
875 same DECL node. Don't discard the RTL already made. */
876 if (DECL_RTL_SET_P (decl))
878 /* If the old RTL had the wrong mode, fix the mode. */
879 if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
880 SET_DECL_RTL (decl, adjust_address_nv (DECL_RTL (decl),
881 DECL_MODE (decl), 0));
883 if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
886 /* ??? Another way to do this would be to maintain a hashed
887 table of such critters. Instead of adding stuff to a DECL
888 to give certain attributes to it, we could use an external
889 hash map from DECL to set of attributes. */
891 /* Let the target reassign the RTL if it wants.
892 This is necessary, for example, when one machine specific
893 decl attribute overrides another. */
894 targetm.encode_section_info (decl, DECL_RTL (decl), false);
896 /* Make this function static known to the mudflap runtime. */
897 if (flag_mudflap && TREE_CODE (decl) == VAR_DECL)
898 mudflap_enqueue_decl (decl);
903 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
905 if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
907 reg_number = decode_reg_name (name);
908 /* First detect errors in declaring global registers. */
909 if (reg_number == -1)
910 error ("%Jregister name not specified for %qD", decl, decl);
911 else if (reg_number < 0)
912 error ("%Jinvalid register name for %qD", decl, decl);
913 else if (TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
914 error ("%Jdata type of %qD isn%'t suitable for a register",
916 else if (! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl))))
917 error ("%Jregister specified for %qD isn%'t suitable for data type",
919 /* Now handle properly declared static register variables. */
924 if (DECL_INITIAL (decl) != 0 && TREE_STATIC (decl))
926 DECL_INITIAL (decl) = 0;
927 error ("global register variable has initial value");
929 if (TREE_THIS_VOLATILE (decl))
930 warning ("volatile register variables don%'t "
931 "work as you might wish");
933 /* If the user specified one of the eliminables registers here,
934 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
935 confused with that register and be eliminated. This usage is
936 somewhat suspect... */
938 SET_DECL_RTL (decl, gen_rtx_raw_REG (DECL_MODE (decl), reg_number));
939 ORIGINAL_REGNO (DECL_RTL (decl)) = reg_number;
940 REG_USERVAR_P (DECL_RTL (decl)) = 1;
942 if (TREE_STATIC (decl))
944 /* Make this register global, so not usable for anything
946 #ifdef ASM_DECLARE_REGISTER_GLOBAL
947 name = IDENTIFIER_POINTER (DECL_NAME (decl));
948 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name);
950 nregs = hard_regno_nregs[reg_number][DECL_MODE (decl)];
952 globalize_reg (reg_number + --nregs);
955 /* As a register variable, it has no section. */
959 /* Now handle ordinary static variables and functions (in memory).
960 Also handle vars declared register invalidly. */
961 else if (name[0] == '*')
963 #ifdef REGISTER_PREFIX
964 if (strlen (REGISTER_PREFIX) != 0)
966 reg_number = decode_reg_name (name);
967 if (reg_number >= 0 || reg_number == -3)
968 error ("%Jregister name given for non-register variable %qD", decl, decl);
973 /* Specifying a section attribute on a variable forces it into a
974 non-.bss section, and thus it cannot be common. */
975 if (TREE_CODE (decl) == VAR_DECL
976 && DECL_SECTION_NAME (decl) != NULL_TREE
977 && DECL_INITIAL (decl) == NULL_TREE
978 && DECL_COMMON (decl))
979 DECL_COMMON (decl) = 0;
981 /* Variables can't be both common and weak. */
982 if (TREE_CODE (decl) == VAR_DECL && DECL_WEAK (decl))
983 DECL_COMMON (decl) = 0;
985 x = gen_rtx_SYMBOL_REF (Pmode, name);
986 SYMBOL_REF_WEAK (x) = DECL_WEAK (decl);
987 SYMBOL_REF_DECL (x) = decl;
989 x = gen_rtx_MEM (DECL_MODE (decl), x);
990 if (TREE_CODE (decl) != FUNCTION_DECL)
991 set_mem_attributes (x, decl, 1);
992 SET_DECL_RTL (decl, x);
994 /* Optionally set flags or add text to the name to record information
995 such as that it is a function name.
996 If the name is changed, the macro ASM_OUTPUT_LABELREF
997 will have to know how to strip this information. */
998 targetm.encode_section_info (decl, DECL_RTL (decl), true);
1000 /* Make this function static known to the mudflap runtime. */
1001 if (flag_mudflap && TREE_CODE (decl) == VAR_DECL)
1002 mudflap_enqueue_decl (decl);
1005 /* Make the rtl for variable VAR be volatile.
1006 Use this only for static variables. */
1009 make_var_volatile (tree var)
1011 if (!MEM_P (DECL_RTL (var)))
1014 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
1017 /* Output a string of literal assembler code
1018 for an `asm' keyword used between functions. */
1021 assemble_asm (tree string)
1025 if (TREE_CODE (string) == ADDR_EXPR)
1026 string = TREE_OPERAND (string, 0);
1028 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
1031 /* Record an element in the table of global destructors. SYMBOL is
1032 a SYMBOL_REF of the function to be called; PRIORITY is a number
1033 between 0 and MAX_INIT_PRIORITY. */
1036 default_stabs_asm_out_destructor (rtx symbol ATTRIBUTE_UNUSED,
1037 int priority ATTRIBUTE_UNUSED)
1039 #if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO
1040 /* Tell GNU LD that this is part of the static destructor set.
1041 This will work for any system that uses stabs, most usefully
1043 dbxout_begin_simple_stabs ("___DTOR_LIST__", 22 /* N_SETT */);
1044 dbxout_stab_value_label (XSTR (symbol, 0));
1046 sorry ("global destructors not supported on this target");
1051 default_named_section_asm_out_destructor (rtx symbol, int priority)
1053 const char *section = ".dtors";
1056 /* ??? This only works reliably with the GNU linker. */
1057 if (priority != DEFAULT_INIT_PRIORITY)
1059 sprintf (buf, ".dtors.%.5u",
1060 /* Invert the numbering so the linker puts us in the proper
1061 order; constructors are run from right to left, and the
1062 linker sorts in increasing order. */
1063 MAX_INIT_PRIORITY - priority);
1067 named_section_flags (section, SECTION_WRITE);
1068 assemble_align (POINTER_SIZE);
1069 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1072 #ifdef DTORS_SECTION_ASM_OP
1074 dtors_section (void)
1076 if (in_section != in_dtors)
1078 in_section = in_dtors;
1079 fputs (DTORS_SECTION_ASM_OP, asm_out_file);
1080 fputc ('\n', asm_out_file);
1085 default_dtor_section_asm_out_destructor (rtx symbol,
1086 int priority ATTRIBUTE_UNUSED)
1089 assemble_align (POINTER_SIZE);
1090 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1094 /* Likewise for global constructors. */
1097 default_stabs_asm_out_constructor (rtx symbol ATTRIBUTE_UNUSED,
1098 int priority ATTRIBUTE_UNUSED)
1100 #if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO
1101 /* Tell GNU LD that this is part of the static destructor set.
1102 This will work for any system that uses stabs, most usefully
1104 dbxout_begin_simple_stabs ("___CTOR_LIST__", 22 /* N_SETT */);
1105 dbxout_stab_value_label (XSTR (symbol, 0));
1107 sorry ("global constructors not supported on this target");
1112 default_named_section_asm_out_constructor (rtx symbol, int priority)
1114 const char *section = ".ctors";
1117 /* ??? This only works reliably with the GNU linker. */
1118 if (priority != DEFAULT_INIT_PRIORITY)
1120 sprintf (buf, ".ctors.%.5u",
1121 /* Invert the numbering so the linker puts us in the proper
1122 order; constructors are run from right to left, and the
1123 linker sorts in increasing order. */
1124 MAX_INIT_PRIORITY - priority);
1128 named_section_flags (section, SECTION_WRITE);
1129 assemble_align (POINTER_SIZE);
1130 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1133 #ifdef CTORS_SECTION_ASM_OP
1135 ctors_section (void)
1137 if (in_section != in_ctors)
1139 in_section = in_ctors;
1140 fputs (CTORS_SECTION_ASM_OP, asm_out_file);
1141 fputc ('\n', asm_out_file);
1146 default_ctor_section_asm_out_constructor (rtx symbol,
1147 int priority ATTRIBUTE_UNUSED)
1150 assemble_align (POINTER_SIZE);
1151 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1155 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1156 a nonzero value if the constant pool should be output before the
1157 start of the function, or a zero value if the pool should output
1158 after the end of the function. The default is to put it before the
1161 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1162 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1165 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
1166 to be output to assembler.
1167 Set first_global_object_name and weak_global_object_name as appropriate. */
1170 notice_global_symbol (tree decl)
1172 const char **type = &first_global_object_name;
1174 if (first_global_object_name
1175 || !TREE_PUBLIC (decl) || DECL_EXTERNAL (decl)
1176 || !DECL_NAME (decl)
1177 || (TREE_CODE (decl) != FUNCTION_DECL
1178 && (TREE_CODE (decl) != VAR_DECL
1179 || (DECL_COMMON (decl)
1180 && (DECL_INITIAL (decl) == 0
1181 || DECL_INITIAL (decl) == error_mark_node))))
1182 || !MEM_P (DECL_RTL (decl)))
1185 /* We win when global object is found, but it is useful to know about weak
1186 symbol as well so we can produce nicer unique names. */
1187 if (DECL_WEAK (decl) || DECL_ONE_ONLY (decl))
1188 type = &weak_global_object_name;
1194 rtx decl_rtl = DECL_RTL (decl);
1196 p = targetm.strip_name_encoding (XSTR (XEXP (decl_rtl, 0), 0));
1203 /* Output assembler code for the constant pool of a function and associated
1204 with defining the name of the function. DECL describes the function.
1205 NAME is the function's name. For the constant pool, we use the current
1206 constant pool data. */
1209 assemble_start_function (tree decl, const char *fnname)
1213 if (unlikely_text_section_name)
1214 free (unlikely_text_section_name);
1216 unlikely_section_label_printed = false;
1217 unlikely_text_section_name = NULL;
1219 unlikely_section_label = reconcat (unlikely_section_label,
1220 fnname, ".unlikely_section", NULL);
1222 /* The following code does not need preprocessing in the assembler. */
1226 if (CONSTANT_POOL_BEFORE_FUNCTION)
1227 output_constant_pool (fnname, decl);
1229 /* Make sure the cold text (code) section is properly aligned. This
1230 is necessary here in the case where the function has both hot and
1231 cold sections, because we don't want to re-set the alignment when the
1232 section switch happens mid-function. We don't need to set the hot
1233 section alignment here, because code further down in this function
1234 sets the alignment for whichever section comes first, and if there
1235 is a hot section it is guaranteed to be first. */
1237 if (flag_reorder_blocks_and_partition)
1239 unlikely_text_section ();
1240 assemble_align (FUNCTION_BOUNDARY);
1243 resolve_unique_section (decl, 0, flag_function_sections);
1244 function_section (decl);
1246 /* Tell assembler to move to target machine's alignment for functions. */
1247 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1248 if (align < force_align_functions_log)
1249 align = force_align_functions_log;
1252 ASM_OUTPUT_ALIGN (asm_out_file, align);
1255 /* Handle a user-specified function alignment.
1256 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1257 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1258 if (align_functions_log > align
1259 && cfun->function_frequency != FUNCTION_FREQUENCY_UNLIKELY_EXECUTED)
1261 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1262 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file,
1263 align_functions_log, align_functions - 1);
1265 ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
1269 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1270 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
1273 (*debug_hooks->begin_function) (decl);
1275 /* Make function name accessible from other files, if appropriate. */
1277 if (TREE_PUBLIC (decl))
1279 notice_global_symbol (decl);
1281 globalize_decl (decl);
1283 maybe_assemble_visibility (decl);
1286 if (DECL_PRESERVE_P (decl))
1287 targetm.asm_out.mark_decl_preserved (fnname);
1289 /* Do any machine/system dependent processing of the function name. */
1290 #ifdef ASM_DECLARE_FUNCTION_NAME
1291 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
1293 /* Standard thing is just output label for the function. */
1294 ASM_OUTPUT_LABEL (asm_out_file, fnname);
1295 #endif /* ASM_DECLARE_FUNCTION_NAME */
1297 if (in_unlikely_text_section ()
1298 && !unlikely_section_label_printed)
1300 ASM_OUTPUT_LABEL (asm_out_file, unlikely_section_label);
1301 unlikely_section_label_printed = true;
1305 /* Output assembler code associated with defining the size of the
1306 function. DECL describes the function. NAME is the function's name. */
1309 assemble_end_function (tree decl, const char *fnname)
1311 #ifdef ASM_DECLARE_FUNCTION_SIZE
1312 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1314 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1316 output_constant_pool (fnname, decl);
1317 function_section (decl); /* need to switch back */
1321 /* Assemble code to leave SIZE bytes of zeros. */
1324 assemble_zeros (unsigned HOST_WIDE_INT size)
1326 /* Do no output if -fsyntax-only. */
1327 if (flag_syntax_only)
1330 #ifdef ASM_NO_SKIP_IN_TEXT
1331 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1332 so we must output 0s explicitly in the text section. */
1333 if ((ASM_NO_SKIP_IN_TEXT && in_text_section ())
1334 || (ASM_NO_SKIP_IN_TEXT && in_unlikely_text_section ()))
1336 unsigned HOST_WIDE_INT i;
1337 for (i = 0; i < size; i++)
1338 assemble_integer (const0_rtx, 1, BITS_PER_UNIT, 1);
1343 ASM_OUTPUT_SKIP (asm_out_file, size);
1346 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1349 assemble_align (int align)
1351 if (align > BITS_PER_UNIT)
1353 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1357 /* Assemble a string constant with the specified C string as contents. */
1360 assemble_string (const char *p, int size)
1365 /* If the string is very long, split it up. */
1369 int thissize = size - pos;
1370 if (thissize > maximum)
1373 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1381 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1382 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1383 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1385 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1386 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1387 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1389 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1390 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1394 #if defined ASM_OUTPUT_ALIGNED_BSS
1395 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1396 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1398 #if defined ASM_OUTPUT_BSS
1399 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1400 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1406 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1407 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1408 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1410 #if defined ASM_OUTPUT_ALIGNED_COMMON
1411 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1412 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1414 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1415 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1420 asm_emit_uninitialised (tree decl, const char *name,
1421 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
1422 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED)
1430 destination = asm_dest_local;
1432 /* ??? We should handle .bss via select_section mechanisms rather than
1433 via special target hooks. That would eliminate this special case. */
1434 if (TREE_PUBLIC (decl))
1436 if (!DECL_COMMON (decl))
1438 destination = asm_dest_bss;
1443 destination = asm_dest_common;
1446 if (destination != asm_dest_common)
1448 resolve_unique_section (decl, 0, flag_data_sections);
1449 /* Custom sections don't belong here. */
1450 if (DECL_SECTION_NAME (decl))
1454 if (destination == asm_dest_bss)
1455 globalize_decl (decl);
1457 if (flag_shared_data)
1459 switch (destination)
1461 #ifdef ASM_OUTPUT_SHARED_BSS
1463 ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded);
1466 #ifdef ASM_OUTPUT_SHARED_COMMON
1467 case asm_dest_common:
1468 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1471 #ifdef ASM_OUTPUT_SHARED_LOCAL
1472 case asm_dest_local:
1473 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1481 switch (destination)
1485 ASM_EMIT_BSS (decl, name, size, rounded);
1488 case asm_dest_common:
1489 ASM_EMIT_COMMON (decl, name, size, rounded);
1491 case asm_dest_local:
1492 ASM_EMIT_LOCAL (decl, name, size, rounded);
1501 /* Assemble everything that is needed for a variable or function declaration.
1502 Not used for automatic variables, and not used for function definitions.
1503 Should not be called for variables of incomplete structure type.
1505 TOP_LEVEL is nonzero if this variable has file scope.
1506 AT_END is nonzero if this is the special handling, at end of compilation,
1507 to define things that have had only tentative definitions.
1508 DONT_OUTPUT_DATA if nonzero means don't actually output the
1509 initial value (that will be done by the caller). */
1512 assemble_variable (tree decl, int top_level ATTRIBUTE_UNUSED,
1513 int at_end ATTRIBUTE_UNUSED, int dont_output_data)
1520 if (lang_hooks.decls.prepare_assemble_variable)
1521 lang_hooks.decls.prepare_assemble_variable (decl);
1523 last_assemble_variable_decl = 0;
1525 /* Normally no need to say anything here for external references,
1526 since assemble_external is called by the language-specific code
1527 when a declaration is first seen. */
1529 if (DECL_EXTERNAL (decl))
1532 /* Output no assembler code for a function declaration.
1533 Only definitions of functions output anything. */
1535 if (TREE_CODE (decl) == FUNCTION_DECL)
1538 /* Do nothing for global register variables. */
1539 if (DECL_RTL_SET_P (decl) && REG_P (DECL_RTL (decl)))
1541 TREE_ASM_WRITTEN (decl) = 1;
1545 /* If type was incomplete when the variable was declared,
1546 see if it is complete now. */
1548 if (DECL_SIZE (decl) == 0)
1549 layout_decl (decl, 0);
1551 /* Still incomplete => don't allocate it; treat the tentative defn
1552 (which is what it must have been) as an `extern' reference. */
1554 if (!dont_output_data && DECL_SIZE (decl) == 0)
1556 error ("%Jstorage size of %qD isn%'t known", decl, decl);
1557 TREE_ASM_WRITTEN (decl) = 1;
1561 /* The first declaration of a variable that comes through this function
1562 decides whether it is global (in C, has external linkage)
1563 or local (in C, has internal linkage). So do nothing more
1564 if this function has already run. */
1566 if (TREE_ASM_WRITTEN (decl))
1569 /* Make sure targetm.encode_section_info is invoked before we set
1571 decl_rtl = DECL_RTL (decl);
1573 TREE_ASM_WRITTEN (decl) = 1;
1575 /* Do no output if -fsyntax-only. */
1576 if (flag_syntax_only)
1581 if (! dont_output_data
1582 && ! host_integerp (DECL_SIZE_UNIT (decl), 1))
1584 error ("%Jsize of variable %qD is too large", decl, decl);
1588 name = XSTR (XEXP (decl_rtl, 0), 0);
1589 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1590 notice_global_symbol (decl);
1592 /* Compute the alignment of this data. */
1594 align = DECL_ALIGN (decl);
1596 /* In the case for initialing an array whose length isn't specified,
1597 where we have not yet been able to do the layout,
1598 figure out the proper alignment now. */
1599 if (dont_output_data && DECL_SIZE (decl) == 0
1600 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1601 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1603 /* Some object file formats have a maximum alignment which they support.
1604 In particular, a.out format supports a maximum alignment of 4. */
1605 if (align > MAX_OFILE_ALIGNMENT)
1607 warning ("%Jalignment of %qD is greater than maximum object "
1608 "file alignment. Using %d", decl, decl,
1609 MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
1610 align = MAX_OFILE_ALIGNMENT;
1613 /* On some machines, it is good to increase alignment sometimes. */
1614 if (! DECL_USER_ALIGN (decl))
1616 #ifdef DATA_ALIGNMENT
1617 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1619 #ifdef CONSTANT_ALIGNMENT
1620 if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node)
1621 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1625 /* Reset the alignment in case we have made it tighter, so we can benefit
1626 from it in get_pointer_alignment. */
1627 DECL_ALIGN (decl) = align;
1628 set_mem_align (decl_rtl, align);
1630 if (TREE_PUBLIC (decl))
1631 maybe_assemble_visibility (decl);
1633 if (DECL_PRESERVE_P (decl))
1634 targetm.asm_out.mark_decl_preserved (name);
1636 /* Handle uninitialized definitions. */
1638 /* If the decl has been given an explicit section name, then it
1639 isn't common, and shouldn't be handled as such. */
1640 if (DECL_SECTION_NAME (decl) || dont_output_data)
1642 /* We don't implement common thread-local data at present. */
1643 else if (DECL_THREAD_LOCAL (decl))
1645 if (DECL_COMMON (decl))
1646 sorry ("thread-local COMMON data not implemented");
1648 else if (DECL_INITIAL (decl) == 0
1649 || DECL_INITIAL (decl) == error_mark_node
1650 || (flag_zero_initialized_in_bss
1651 /* Leave constant zeroes in .rodata so they can be shared. */
1652 && !TREE_READONLY (decl)
1653 && initializer_zerop (DECL_INITIAL (decl))))
1655 unsigned HOST_WIDE_INT size = tree_low_cst (DECL_SIZE_UNIT (decl), 1);
1656 unsigned HOST_WIDE_INT rounded = size;
1658 /* Don't allocate zero bytes of common,
1659 since that means "undefined external" in the linker. */
1663 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1664 so that each uninitialized object starts on such a boundary. */
1665 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1666 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1667 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1669 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1670 if ((unsigned HOST_WIDE_INT) DECL_ALIGN_UNIT (decl) > rounded)
1671 warning ("%Jrequested alignment for %qD is greater than "
1672 "implemented alignment of %d", decl, decl, rounded);
1675 /* If the target cannot output uninitialized but not common global data
1676 in .bss, then we have to use .data, so fall through. */
1677 if (asm_emit_uninitialised (decl, name, size, rounded))
1681 /* Handle initialized definitions.
1682 Also handle uninitialized global definitions if -fno-common and the
1683 target doesn't support ASM_OUTPUT_BSS. */
1685 /* First make the assembler name(s) global if appropriate. */
1686 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1687 globalize_decl (decl);
1689 /* Output any data that we will need to use the address of. */
1690 if (DECL_INITIAL (decl) == error_mark_node)
1691 reloc = contains_pointers_p (TREE_TYPE (decl)) ? 3 : 0;
1692 else if (DECL_INITIAL (decl))
1694 reloc = compute_reloc_for_constant (DECL_INITIAL (decl));
1695 output_addressed_constants (DECL_INITIAL (decl));
1698 /* Switch to the appropriate section. */
1699 resolve_unique_section (decl, reloc, flag_data_sections);
1700 variable_section (decl, reloc);
1702 /* dbxout.c needs to know this. */
1703 if (in_text_section () || in_unlikely_text_section ())
1704 DECL_IN_TEXT_SECTION (decl) = 1;
1706 /* Output the alignment of this data. */
1707 if (align > BITS_PER_UNIT)
1708 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (DECL_ALIGN_UNIT (decl)));
1710 /* Do any machine/system dependent processing of the object. */
1711 #ifdef ASM_DECLARE_OBJECT_NAME
1712 last_assemble_variable_decl = decl;
1713 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1715 /* Standard thing is just output label for the object. */
1716 ASM_OUTPUT_LABEL (asm_out_file, name);
1717 #endif /* ASM_DECLARE_OBJECT_NAME */
1719 if (!dont_output_data)
1721 if (DECL_INITIAL (decl)
1722 && DECL_INITIAL (decl) != error_mark_node
1723 && !initializer_zerop (DECL_INITIAL (decl)))
1724 /* Output the actual data. */
1725 output_constant (DECL_INITIAL (decl),
1726 tree_low_cst (DECL_SIZE_UNIT (decl), 1),
1729 /* Leave space for it. */
1730 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl), 1));
1734 /* Return 1 if type TYPE contains any pointers. */
1737 contains_pointers_p (tree type)
1739 switch (TREE_CODE (type))
1742 case REFERENCE_TYPE:
1743 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1744 so I'll play safe and return 1. */
1750 case QUAL_UNION_TYPE:
1753 /* For a type that has fields, see if the fields have pointers. */
1754 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1755 if (TREE_CODE (fields) == FIELD_DECL
1756 && contains_pointers_p (TREE_TYPE (fields)))
1762 /* An array type contains pointers if its element type does. */
1763 return contains_pointers_p (TREE_TYPE (type));
1770 /* In unit-at-a-time mode, we delay assemble_external processing until
1771 the compilation unit is finalized. This is the best we can do for
1772 right now (i.e. stage 3 of GCC 4.0) - the right thing is to delay
1773 it all the way to final. See PR 17982 for further discussion. */
1774 static GTY(()) tree pending_assemble_externals;
1776 #ifdef ASM_OUTPUT_EXTERNAL
1777 /* True if DECL is a function decl for which no out-of-line copy exists.
1778 It is assumed that DECL's assembler name has been set. */
1781 incorporeal_function_p (tree decl)
1783 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_BUILT_IN (decl))
1787 if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
1788 && DECL_FUNCTION_CODE (decl) == BUILT_IN_ALLOCA)
1791 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
1792 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
1798 /* Actually do the tests to determine if this is necessary, and invoke
1799 ASM_OUTPUT_EXTERNAL. */
1801 assemble_external_real (tree decl)
1803 rtx rtl = DECL_RTL (decl);
1805 if (MEM_P (rtl) && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1806 && !SYMBOL_REF_USED (XEXP (rtl, 0))
1807 && !incorporeal_function_p (decl))
1809 /* Some systems do require some output. */
1810 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1811 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1817 process_pending_assemble_externals (void)
1819 #ifdef ASM_OUTPUT_EXTERNAL
1821 for (list = pending_assemble_externals; list; list = TREE_CHAIN (list))
1822 assemble_external_real (TREE_VALUE (list));
1824 pending_assemble_externals = 0;
1828 /* Output something to declare an external symbol to the assembler.
1829 (Most assemblers don't need this, so we normally output nothing.)
1830 Do nothing if DECL is not external. */
1833 assemble_external (tree decl ATTRIBUTE_UNUSED)
1835 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1836 main body of this code is only rarely exercised. To provide some
1837 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1838 open. If it's not, we should not be calling this function. */
1839 gcc_assert (asm_out_file);
1841 #ifdef ASM_OUTPUT_EXTERNAL
1842 if (!DECL_P (decl) || !DECL_EXTERNAL (decl) || !TREE_PUBLIC (decl))
1845 if (flag_unit_at_a_time)
1846 pending_assemble_externals = tree_cons (0, decl,
1847 pending_assemble_externals);
1849 assemble_external_real (decl);
1853 /* Similar, for calling a library function FUN. */
1856 assemble_external_libcall (rtx fun)
1858 /* Declare library function name external when first used, if nec. */
1859 if (! SYMBOL_REF_USED (fun))
1861 SYMBOL_REF_USED (fun) = 1;
1862 targetm.asm_out.external_libcall (fun);
1866 /* Assemble a label named NAME. */
1869 assemble_label (const char *name)
1871 ASM_OUTPUT_LABEL (asm_out_file, name);
1874 /* Set the symbol_referenced flag for ID. */
1876 mark_referenced (tree id)
1878 TREE_SYMBOL_REFERENCED (id) = 1;
1881 /* Set the symbol_referenced flag for DECL and notify callgraph. */
1883 mark_decl_referenced (tree decl)
1885 if (TREE_CODE (decl) == FUNCTION_DECL)
1887 /* Extern inline functions don't become needed when referenced. */
1888 if (!DECL_EXTERNAL (decl))
1889 cgraph_mark_needed_node (cgraph_node (decl));
1891 else if (TREE_CODE (decl) == VAR_DECL)
1892 cgraph_varpool_mark_needed_node (cgraph_varpool_node (decl));
1893 /* else do nothing - we can get various sorts of CST nodes here,
1894 which do not need to be marked. */
1897 /* Output to FILE (an assembly file) a reference to NAME. If NAME
1898 starts with a *, the rest of NAME is output verbatim. Otherwise
1899 NAME is transformed in a target-specific way (usually by the
1900 addition of an underscore). */
1903 assemble_name_raw (FILE *file, const char *name)
1906 fputs (&name[1], file);
1908 ASM_OUTPUT_LABELREF (file, name);
1911 /* Like assemble_name_raw, but should be used when NAME might refer to
1912 an entity that is also represented as a tree (like a function or
1913 variable). If NAME does refer to such an entity, that entity will
1914 be marked as referenced. */
1917 assemble_name (FILE *file, const char *name)
1919 const char *real_name;
1922 real_name = targetm.strip_name_encoding (name);
1924 id = maybe_get_identifier (real_name);
1926 mark_referenced (id);
1928 assemble_name_raw (file, name);
1931 /* Allocate SIZE bytes writable static space with a gensym name
1932 and return an RTX to refer to its address. */
1935 assemble_static_space (unsigned HOST_WIDE_INT size)
1938 const char *namestring;
1942 if (flag_shared_data)
1946 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1948 namestring = ggc_strdup (name);
1950 x = gen_rtx_SYMBOL_REF (Pmode, namestring);
1951 SYMBOL_REF_FLAGS (x) = SYMBOL_FLAG_LOCAL;
1953 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1954 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
1957 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1958 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1961 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1962 so that each uninitialized object starts on such a boundary. */
1963 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1964 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1965 = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1966 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1967 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1968 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1975 /* Assemble the static constant template for function entry trampolines.
1976 This is done at most once per compilation.
1977 Returns an RTX for the address of the template. */
1979 static GTY(()) rtx initial_trampoline;
1981 #ifdef TRAMPOLINE_TEMPLATE
1983 assemble_trampoline_template (void)
1990 if (initial_trampoline)
1991 return initial_trampoline;
1993 /* By default, put trampoline templates in read-only data section. */
1995 #ifdef TRAMPOLINE_SECTION
1996 TRAMPOLINE_SECTION ();
1998 readonly_data_section ();
2001 /* Write the assembler code to define one. */
2002 align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
2005 ASM_OUTPUT_ALIGN (asm_out_file, align);
2008 targetm.asm_out.internal_label (asm_out_file, "LTRAMP", 0);
2009 TRAMPOLINE_TEMPLATE (asm_out_file);
2011 /* Record the rtl to refer to it. */
2012 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
2013 name = ggc_strdup (label);
2014 symbol = gen_rtx_SYMBOL_REF (Pmode, name);
2015 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
2017 initial_trampoline = gen_rtx_MEM (BLKmode, symbol);
2018 set_mem_align (initial_trampoline, TRAMPOLINE_ALIGNMENT);
2020 return initial_trampoline;
2024 /* A and B are either alignments or offsets. Return the minimum alignment
2025 that may be assumed after adding the two together. */
2027 static inline unsigned
2028 min_align (unsigned int a, unsigned int b)
2030 return (a | b) & -(a | b);
2033 /* Return the assembler directive for creating a given kind of integer
2034 object. SIZE is the number of bytes in the object and ALIGNED_P
2035 indicates whether it is known to be aligned. Return NULL if the
2036 assembly dialect has no such directive.
2038 The returned string should be printed at the start of a new line and
2039 be followed immediately by the object's initial value. */
2042 integer_asm_op (int size, int aligned_p)
2044 struct asm_int_op *ops;
2047 ops = &targetm.asm_out.aligned_op;
2049 ops = &targetm.asm_out.unaligned_op;
2054 return targetm.asm_out.byte_op;
2068 /* Use directive OP to assemble an integer object X. Print OP at the
2069 start of the line, followed immediately by the value of X. */
2072 assemble_integer_with_op (const char *op, rtx x)
2074 fputs (op, asm_out_file);
2075 output_addr_const (asm_out_file, x);
2076 fputc ('\n', asm_out_file);
2079 /* The default implementation of the asm_out.integer target hook. */
2082 default_assemble_integer (rtx x ATTRIBUTE_UNUSED,
2083 unsigned int size ATTRIBUTE_UNUSED,
2084 int aligned_p ATTRIBUTE_UNUSED)
2086 const char *op = integer_asm_op (size, aligned_p);
2087 /* Avoid GAS bugs for large values. Specifically negative values whose
2088 absolute value fits in a bfd_vma, but not in a bfd_signed_vma. */
2089 if (size > UNITS_PER_WORD && size > POINTER_SIZE / BITS_PER_UNIT)
2091 return op && (assemble_integer_with_op (op, x), true);
2094 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
2095 the alignment of the integer in bits. Return 1 if we were able to output
2096 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
2100 assemble_integer (rtx x, unsigned int size, unsigned int align, int force)
2104 aligned_p = (align >= MIN (size * BITS_PER_UNIT, BIGGEST_ALIGNMENT));
2106 /* See if the target hook can handle this kind of object. */
2107 if (targetm.asm_out.integer (x, size, aligned_p))
2110 /* If the object is a multi-byte one, try splitting it up. Split
2111 it into words it if is multi-word, otherwise split it into bytes. */
2114 enum machine_mode omode, imode;
2115 unsigned int subalign;
2116 unsigned int subsize, i;
2118 subsize = size > UNITS_PER_WORD? UNITS_PER_WORD : 1;
2119 subalign = MIN (align, subsize * BITS_PER_UNIT);
2120 omode = mode_for_size (subsize * BITS_PER_UNIT, MODE_INT, 0);
2121 imode = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
2123 for (i = 0; i < size; i += subsize)
2125 rtx partial = simplify_subreg (omode, x, imode, i);
2126 if (!partial || !assemble_integer (partial, subsize, subalign, 0))
2132 /* If we've printed some of it, but not all of it, there's no going
2145 assemble_real (REAL_VALUE_TYPE d, enum machine_mode mode, unsigned int align)
2149 int bitsize, nelts, nunits, units_per;
2151 /* This is hairy. We have a quantity of known size. real_to_target
2152 will put it into an array of *host* longs, 32 bits per element
2153 (even if long is more than 32 bits). We need to determine the
2154 number of array elements that are occupied (nelts) and the number
2155 of *target* min-addressable units that will be occupied in the
2156 object file (nunits). We cannot assume that 32 divides the
2157 mode's bitsize (size * BITS_PER_UNIT) evenly.
2159 size * BITS_PER_UNIT is used here to make sure that padding bits
2160 (which might appear at either end of the value; real_to_target
2161 will include the padding bits in its output array) are included. */
2163 nunits = GET_MODE_SIZE (mode);
2164 bitsize = nunits * BITS_PER_UNIT;
2165 nelts = CEIL (bitsize, 32);
2166 units_per = 32 / BITS_PER_UNIT;
2168 real_to_target (data, &d, mode);
2170 /* Put out the first word with the specified alignment. */
2171 assemble_integer (GEN_INT (data[0]), MIN (nunits, units_per), align, 1);
2172 nunits -= units_per;
2174 /* Subsequent words need only 32-bit alignment. */
2175 align = min_align (align, 32);
2177 for (i = 1; i < nelts; i++)
2179 assemble_integer (GEN_INT (data[i]), MIN (nunits, units_per), align, 1);
2180 nunits -= units_per;
2184 /* Given an expression EXP with a constant value,
2185 reduce it to the sum of an assembler symbol and an integer.
2186 Store them both in the structure *VALUE.
2187 Abort if EXP does not reduce. */
2189 struct addr_const GTY(())
2192 HOST_WIDE_INT offset;
2196 decode_addr_const (tree exp, struct addr_const *value)
2198 tree target = TREE_OPERAND (exp, 0);
2204 if (TREE_CODE (target) == COMPONENT_REF
2205 && host_integerp (byte_position (TREE_OPERAND (target, 1)), 0))
2208 offset += int_byte_position (TREE_OPERAND (target, 1));
2209 target = TREE_OPERAND (target, 0);
2211 else if (TREE_CODE (target) == ARRAY_REF
2212 || TREE_CODE (target) == ARRAY_RANGE_REF)
2214 offset += (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target)), 1)
2215 * tree_low_cst (TREE_OPERAND (target, 1), 0));
2216 target = TREE_OPERAND (target, 0);
2222 switch (TREE_CODE (target))
2226 x = DECL_RTL (target);
2230 x = gen_rtx_MEM (FUNCTION_MODE,
2231 gen_rtx_LABEL_REF (VOIDmode, force_label_rtx (target)));
2239 x = output_constant_def (target, 1);
2251 value->offset = offset;
2254 /* Uniquize all constants that appear in memory.
2255 Each constant in memory thus far output is recorded
2256 in `const_desc_table'. */
2258 struct constant_descriptor_tree GTY(())
2260 /* A MEM for the constant. */
2263 /* The value of the constant. */
2267 static GTY((param_is (struct constant_descriptor_tree)))
2268 htab_t const_desc_htab;
2270 static struct constant_descriptor_tree * build_constant_desc (tree);
2271 static void maybe_output_constant_def_contents (struct constant_descriptor_tree *, int);
2273 /* Compute a hash code for a constant expression. */
2276 const_desc_hash (const void *ptr)
2278 return const_hash_1 (((struct constant_descriptor_tree *)ptr)->value);
2282 const_hash_1 (const tree exp)
2287 enum tree_code code = TREE_CODE (exp);
2289 /* Either set P and LEN to the address and len of something to hash and
2290 exit the switch or return a value. */
2295 p = (char *) &TREE_INT_CST (exp);
2296 len = sizeof TREE_INT_CST (exp);
2300 return real_hash (TREE_REAL_CST_PTR (exp));
2303 p = TREE_STRING_POINTER (exp);
2304 len = TREE_STRING_LENGTH (exp);
2308 return (const_hash_1 (TREE_REALPART (exp)) * 5
2309 + const_hash_1 (TREE_IMAGPART (exp)));
2315 hi = 5 + int_size_in_bytes (TREE_TYPE (exp));
2317 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2318 if (TREE_VALUE (link))
2319 hi = hi * 603 + const_hash_1 (TREE_VALUE (link));
2327 struct addr_const value;
2329 decode_addr_const (exp, &value);
2330 if (GET_CODE (value.base) == SYMBOL_REF)
2332 /* Don't hash the address of the SYMBOL_REF;
2333 only use the offset and the symbol name. */
2335 p = XSTR (value.base, 0);
2336 for (i = 0; p[i] != 0; i++)
2337 hi = ((hi * 613) + (unsigned) (p[i]));
2339 else if (GET_CODE (value.base) == LABEL_REF)
2340 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2348 return (const_hash_1 (TREE_OPERAND (exp, 0)) * 9
2349 + const_hash_1 (TREE_OPERAND (exp, 1)));
2353 case NON_LVALUE_EXPR:
2354 return const_hash_1 (TREE_OPERAND (exp, 0)) * 7 + 2;
2357 /* A language specific constant. Just hash the code. */
2361 /* Compute hashing function. */
2363 for (i = 0; i < len; i++)
2364 hi = ((hi * 613) + (unsigned) (p[i]));
2369 /* Wrapper of compare_constant, for the htab interface. */
2371 const_desc_eq (const void *p1, const void *p2)
2373 return compare_constant (((struct constant_descriptor_tree *)p1)->value,
2374 ((struct constant_descriptor_tree *)p2)->value);
2377 /* Compare t1 and t2, and return 1 only if they are known to result in
2378 the same bit pattern on output. */
2381 compare_constant (const tree t1, const tree t2)
2383 enum tree_code typecode;
2385 if (t1 == NULL_TREE)
2386 return t2 == NULL_TREE;
2387 if (t2 == NULL_TREE)
2390 if (TREE_CODE (t1) != TREE_CODE (t2))
2393 switch (TREE_CODE (t1))
2396 /* Integer constants are the same only if the same width of type. */
2397 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2399 return tree_int_cst_equal (t1, t2);
2402 /* Real constants are the same only if the same width of type. */
2403 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2406 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
2409 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2)))
2412 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
2413 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
2414 TREE_STRING_LENGTH (t1)));
2417 return (compare_constant (TREE_REALPART (t1), TREE_REALPART (t2))
2418 && compare_constant (TREE_IMAGPART (t1), TREE_IMAGPART (t2)));
2424 typecode = TREE_CODE (TREE_TYPE (t1));
2425 if (typecode != TREE_CODE (TREE_TYPE (t2)))
2428 if (typecode == ARRAY_TYPE)
2430 HOST_WIDE_INT size_1 = int_size_in_bytes (TREE_TYPE (t1));
2431 /* For arrays, check that the sizes all match. */
2432 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2))
2434 || size_1 != int_size_in_bytes (TREE_TYPE (t2)))
2439 /* For record and union constructors, require exact type
2441 if (TREE_TYPE (t1) != TREE_TYPE (t2))
2445 for (l1 = CONSTRUCTOR_ELTS (t1), l2 = CONSTRUCTOR_ELTS (t2);
2447 l1 = TREE_CHAIN (l1), l2 = TREE_CHAIN (l2))
2449 /* Check that each value is the same... */
2450 if (! compare_constant (TREE_VALUE (l1), TREE_VALUE (l2)))
2452 /* ... and that they apply to the same fields! */
2453 if (typecode == ARRAY_TYPE)
2455 if (! compare_constant (TREE_PURPOSE (l1),
2461 if (TREE_PURPOSE (l1) != TREE_PURPOSE (l2))
2466 return l1 == NULL_TREE && l2 == NULL_TREE;
2472 struct addr_const value1, value2;
2474 decode_addr_const (t1, &value1);
2475 decode_addr_const (t2, &value2);
2476 return (value1.offset == value2.offset
2477 && strcmp (XSTR (value1.base, 0), XSTR (value2.base, 0)) == 0);
2483 return (compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))
2484 && compare_constant(TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)));
2488 case NON_LVALUE_EXPR:
2489 case VIEW_CONVERT_EXPR:
2490 return compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2495 nt1 = lang_hooks.expand_constant (t1);
2496 nt2 = lang_hooks.expand_constant (t2);
2497 if (nt1 != t1 || nt2 != t2)
2498 return compare_constant (nt1, nt2);
2504 /* Should not get here. */
2508 /* Make a copy of the whole tree structure for a constant. This
2509 handles the same types of nodes that compare_constant handles. */
2512 copy_constant (tree exp)
2514 switch (TREE_CODE (exp))
2517 /* For ADDR_EXPR, we do not want to copy the decl whose address
2518 is requested. We do want to copy constants though. */
2519 if (CONSTANT_CLASS_P (TREE_OPERAND (exp, 0)))
2520 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2521 copy_constant (TREE_OPERAND (exp, 0)));
2523 return copy_node (exp);
2528 return copy_node (exp);
2531 return build_complex (TREE_TYPE (exp),
2532 copy_constant (TREE_REALPART (exp)),
2533 copy_constant (TREE_IMAGPART (exp)));
2537 return build2 (TREE_CODE (exp), TREE_TYPE (exp),
2538 copy_constant (TREE_OPERAND (exp, 0)),
2539 copy_constant (TREE_OPERAND (exp, 1)));
2543 case NON_LVALUE_EXPR:
2544 case VIEW_CONVERT_EXPR:
2545 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2546 copy_constant (TREE_OPERAND (exp, 0)));
2550 tree copy = copy_node (exp);
2551 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2554 CONSTRUCTOR_ELTS (copy) = list;
2555 for (tail = list; tail; tail = TREE_CHAIN (tail))
2556 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2564 t = lang_hooks.expand_constant (exp);
2566 return copy_constant (t);
2573 /* Subroutine of output_constant_def:
2574 No constant equal to EXP is known to have been output.
2575 Make a constant descriptor to enter EXP in the hash table.
2576 Assign the label number and construct RTL to refer to the
2577 constant's location in memory.
2578 Caller is responsible for updating the hash table. */
2580 static struct constant_descriptor_tree *
2581 build_constant_desc (tree exp)
2587 struct constant_descriptor_tree *desc;
2589 desc = ggc_alloc (sizeof (*desc));
2590 desc->value = copy_constant (exp);
2592 /* Propagate marked-ness to copied constant. */
2593 if (flag_mudflap && mf_marked_p (exp))
2594 mf_mark (desc->value);
2596 /* Create a string containing the label name, in LABEL. */
2597 labelno = const_labelno++;
2598 ASM_GENERATE_INTERNAL_LABEL (label, "LC", labelno);
2600 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2601 symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label));
2602 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
2603 SYMBOL_REF_DECL (symbol) = desc->value;
2604 TREE_CONSTANT_POOL_ADDRESS_P (symbol) = 1;
2606 rtl = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)), symbol);
2607 set_mem_attributes (rtl, exp, 1);
2608 set_mem_alias_set (rtl, 0);
2609 set_mem_alias_set (rtl, const_alias_set);
2611 /* Set flags or add text to the name to record information, such as
2612 that it is a local symbol. If the name is changed, the macro
2613 ASM_OUTPUT_LABELREF will have to know how to strip this
2614 information. This call might invalidate our local variable
2615 SYMBOL; we can't use it afterward. */
2617 targetm.encode_section_info (exp, rtl, true);
2624 /* Return an rtx representing a reference to constant data in memory
2625 for the constant expression EXP.
2627 If assembler code for such a constant has already been output,
2628 return an rtx to refer to it.
2629 Otherwise, output such a constant in memory
2630 and generate an rtx for it.
2632 If DEFER is nonzero, this constant can be deferred and output only
2633 if referenced in the function after all optimizations.
2635 `const_desc_table' records which constants already have label strings. */
2638 output_constant_def (tree exp, int defer)
2640 struct constant_descriptor_tree *desc;
2641 struct constant_descriptor_tree key;
2644 /* Look up EXP in the table of constant descriptors. If we didn't find
2645 it, create a new one. */
2647 loc = htab_find_slot (const_desc_htab, &key, INSERT);
2652 desc = build_constant_desc (exp);
2656 maybe_output_constant_def_contents (desc, defer);
2660 /* Subroutine of output_constant_def: Decide whether or not we need to
2661 output the constant DESC now, and if so, do it. */
2663 maybe_output_constant_def_contents (struct constant_descriptor_tree *desc,
2666 rtx symbol = XEXP (desc->rtl, 0);
2667 tree exp = desc->value;
2669 if (flag_syntax_only)
2672 if (TREE_ASM_WRITTEN (exp))
2673 /* Already output; don't do it again. */
2676 /* We can always defer constants as long as the context allows
2680 /* Increment n_deferred_constants if it exists. It needs to be at
2681 least as large as the number of constants actually referred to
2682 by the function. If it's too small we'll stop looking too early
2683 and fail to emit constants; if it's too large we'll only look
2684 through the entire function when we could have stopped earlier. */
2686 n_deferred_constants++;
2690 output_constant_def_contents (symbol);
2693 /* We must output the constant data referred to by SYMBOL; do so. */
2696 output_constant_def_contents (rtx symbol)
2698 tree exp = SYMBOL_REF_DECL (symbol);
2699 const char *label = XSTR (symbol, 0);
2702 /* Make sure any other constants whose addresses appear in EXP
2703 are assigned label numbers. */
2704 int reloc = compute_reloc_for_constant (exp);
2706 /* Align the location counter as required by EXP's data type. */
2707 unsigned int align = TYPE_ALIGN (TREE_TYPE (exp));
2708 #ifdef CONSTANT_ALIGNMENT
2709 align = CONSTANT_ALIGNMENT (exp, align);
2712 output_addressed_constants (exp);
2714 /* We are no longer deferring this constant. */
2715 TREE_ASM_WRITTEN (exp) = 1;
2717 if (IN_NAMED_SECTION (exp))
2718 named_section (exp, NULL, reloc);
2720 targetm.asm_out.select_section (exp, reloc, align);
2722 if (align > BITS_PER_UNIT)
2724 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2727 size = int_size_in_bytes (TREE_TYPE (exp));
2728 if (TREE_CODE (exp) == STRING_CST)
2729 size = MAX (TREE_STRING_LENGTH (exp), size);
2731 /* Do any machine/system dependent processing of the constant. */
2732 #ifdef ASM_DECLARE_CONSTANT_NAME
2733 ASM_DECLARE_CONSTANT_NAME (asm_out_file, label, exp, size);
2735 /* Standard thing is just output label for the constant. */
2736 ASM_OUTPUT_LABEL (asm_out_file, label);
2737 #endif /* ASM_DECLARE_CONSTANT_NAME */
2739 /* Output the value of EXP. */
2740 output_constant (exp, size, align);
2742 mudflap_enqueue_constant (exp);
2745 /* Look up EXP in the table of constant descriptors. Return the rtl
2746 if it has been emitted, else null. */
2749 lookup_constant_def (tree exp)
2751 struct constant_descriptor_tree *desc;
2752 struct constant_descriptor_tree key;
2755 desc = htab_find (const_desc_htab, &key);
2757 return (desc ? desc->rtl : NULL_RTX);
2760 /* Used in the hash tables to avoid outputting the same constant
2761 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2762 are output once per function, not once per file. */
2763 /* ??? Only a few targets need per-function constant pools. Most
2764 can use one per-file pool. Should add a targetm bit to tell the
2767 struct rtx_constant_pool GTY(())
2769 /* Pointers to first and last constant in pool, as ordered by offset. */
2770 struct constant_descriptor_rtx *first;
2771 struct constant_descriptor_rtx *last;
2773 /* Hash facility for making memory-constants from constant rtl-expressions.
2774 It is used on RISC machines where immediate integer arguments and
2775 constant addresses are restricted so that such constants must be stored
2777 htab_t GTY((param_is (struct constant_descriptor_rtx))) const_rtx_htab;
2778 htab_t GTY((param_is (struct constant_descriptor_rtx))) const_rtx_sym_htab;
2780 /* Current offset in constant pool (does not include any
2781 machine-specific header). */
2782 HOST_WIDE_INT offset;
2785 struct constant_descriptor_rtx GTY((chain_next ("%h.next")))
2787 struct constant_descriptor_rtx *next;
2791 HOST_WIDE_INT offset;
2793 enum machine_mode mode;
2799 /* Hash and compare functions for const_rtx_htab. */
2802 const_desc_rtx_hash (const void *ptr)
2804 const struct constant_descriptor_rtx *desc = ptr;
2809 const_desc_rtx_eq (const void *a, const void *b)
2811 const struct constant_descriptor_rtx *x = a;
2812 const struct constant_descriptor_rtx *y = b;
2814 if (x->mode != y->mode)
2816 return rtx_equal_p (x->constant, y->constant);
2819 /* Hash and compare functions for const_rtx_sym_htab. */
2822 const_desc_rtx_sym_hash (const void *ptr)
2824 const struct constant_descriptor_rtx *desc = ptr;
2825 return htab_hash_string (XSTR (desc->sym, 0));
2829 const_desc_rtx_sym_eq (const void *a, const void *b)
2831 const struct constant_descriptor_rtx *x = a;
2832 const struct constant_descriptor_rtx *y = b;
2833 return XSTR (x->sym, 0) == XSTR (y->sym, 0);
2836 /* This is the worker function for const_rtx_hash, called via for_each_rtx. */
2839 const_rtx_hash_1 (rtx *xp, void *data)
2841 unsigned HOST_WIDE_INT hwi;
2842 enum machine_mode mode;
2848 code = GET_CODE (x);
2849 mode = GET_MODE (x);
2850 h = (hashval_t) code * 1048573 + mode;
2858 const int shift = sizeof (hashval_t) * CHAR_BIT;
2859 const int n = sizeof (HOST_WIDE_INT) / sizeof (hashval_t);
2862 h ^= (hashval_t) hwi;
2863 for (i = 1; i < n; ++i)
2866 h ^= (hashval_t) hwi;
2872 if (mode == VOIDmode)
2874 hwi = CONST_DOUBLE_LOW (x) ^ CONST_DOUBLE_HIGH (x);
2878 h ^= real_hash (CONST_DOUBLE_REAL_VALUE (x));
2884 for (i = XVECLEN (x, 0); i-- > 0; )
2885 h = h * 251 + const_rtx_hash_1 (&XVECEXP (x, 0, i), data);
2890 h ^= htab_hash_string (XSTR (x, 0));
2894 h = h * 251 + CODE_LABEL_NUMBER (XEXP (x, 0));
2898 case UNSPEC_VOLATILE:
2899 h = h * 251 + XINT (x, 1);
2907 *hp = *hp * 509 + h;
2911 /* Compute a hash value for X, which should be a constant. */
2914 const_rtx_hash (rtx x)
2917 for_each_rtx (&x, const_rtx_hash_1, &h);
2922 /* Initialize constant pool hashing for a new function. */
2925 init_varasm_status (struct function *f)
2927 struct varasm_status *p;
2928 struct rtx_constant_pool *pool;
2930 p = ggc_alloc (sizeof (struct varasm_status));
2933 pool = ggc_alloc (sizeof (struct rtx_constant_pool));
2935 p->deferred_constants = 0;
2937 pool->const_rtx_htab = htab_create_ggc (31, const_desc_rtx_hash,
2938 const_desc_rtx_eq, NULL);
2939 pool->const_rtx_sym_htab = htab_create_ggc (31, const_desc_rtx_sym_hash,
2940 const_desc_rtx_sym_eq, NULL);
2941 pool->first = pool->last = NULL;
2945 /* Given a MINUS expression, simplify it if both sides
2946 include the same symbol. */
2949 simplify_subtraction (rtx x)
2951 rtx r = simplify_rtx (x);
2955 /* Given a constant rtx X, make (or find) a memory constant for its value
2956 and return a MEM rtx to refer to it in memory. */
2959 force_const_mem (enum machine_mode mode, rtx x)
2961 struct constant_descriptor_rtx *desc, tmp;
2962 struct rtx_constant_pool *pool = cfun->varasm->pool;
2969 /* If we're not allowed to drop X into the constant pool, don't. */
2970 if (targetm.cannot_force_const_mem (x))
2973 /* Lookup the value in the hashtable. */
2976 hash = const_rtx_hash (x);
2977 slot = htab_find_slot_with_hash (pool->const_rtx_htab, &tmp, hash, INSERT);
2980 /* If the constant was already present, return its memory. */
2982 return copy_rtx (desc->mem);
2984 /* Otherwise, create a new descriptor. */
2985 desc = ggc_alloc (sizeof (*desc));
2988 /* Align the location counter as required by EXP's data type. */
2989 align = GET_MODE_ALIGNMENT (mode == VOIDmode ? word_mode : mode);
2990 #ifdef CONSTANT_ALIGNMENT
2992 tree type = lang_hooks.types.type_for_mode (mode, 0);
2993 if (type != NULL_TREE)
2994 align = CONSTANT_ALIGNMENT (make_tree (type, x), align);
2998 pool->offset += (align / BITS_PER_UNIT) - 1;
2999 pool->offset &= ~ ((align / BITS_PER_UNIT) - 1);
3002 desc->constant = tmp.constant;
3003 desc->offset = pool->offset;
3006 desc->align = align;
3007 desc->labelno = const_labelno;
3010 pool->offset += GET_MODE_SIZE (mode);
3012 pool->last->next = desc;
3014 pool->first = pool->last = desc;
3017 /* Create a string containing the label name, in LABEL. */
3018 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3021 /* Construct the SYMBOL_REF. Make sure to mark it as belonging to
3022 the constants pool. */
3023 desc->sym = symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label));
3024 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
3025 CONSTANT_POOL_ADDRESS_P (symbol) = 1;
3026 current_function_uses_const_pool = 1;
3028 /* Insert the descriptor into the symbol cross-reference table too. */
3029 slot = htab_find_slot (pool->const_rtx_sym_htab, desc, INSERT);
3034 /* Construct the MEM. */
3035 desc->mem = def = gen_const_mem (mode, symbol);
3036 set_mem_attributes (def, lang_hooks.types.type_for_mode (mode, 0), 1);
3037 set_mem_align (def, align);
3039 /* If we're dropping a label to the constant pool, make sure we
3041 if (GET_CODE (x) == LABEL_REF)
3042 LABEL_PRESERVE_P (XEXP (x, 0)) = 1;
3044 return copy_rtx (def);
3047 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3048 the corresponding constant_descriptor_rtx structure. */
3050 static struct constant_descriptor_rtx *
3051 find_pool_constant (struct rtx_constant_pool *pool, rtx sym)
3053 struct constant_descriptor_rtx tmp;
3055 return htab_find (pool->const_rtx_sym_htab, &tmp);
3058 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3061 get_pool_constant (rtx addr)
3063 return find_pool_constant (cfun->varasm->pool, addr)->constant;
3066 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3067 and whether it has been output or not. */
3070 get_pool_constant_mark (rtx addr, bool *pmarked)
3072 struct constant_descriptor_rtx *desc;
3074 desc = find_pool_constant (cfun->varasm->pool, addr);
3075 *pmarked = (desc->mark != 0);
3076 return desc->constant;
3079 /* Likewise, but for the constant pool of a specific function. */
3082 get_pool_constant_for_function (struct function *f, rtx addr)
3084 return find_pool_constant (f->varasm->pool, addr)->constant;
3087 /* Similar, return the mode. */
3090 get_pool_mode (rtx addr)
3092 return find_pool_constant (cfun->varasm->pool, addr)->mode;
3095 /* Return the size of the constant pool. */
3098 get_pool_size (void)
3100 return cfun->varasm->pool->offset;
3103 /* Worker function for output_constant_pool_1. Emit assembly for X
3104 in MODE with known alignment ALIGN. */
3107 output_constant_pool_2 (enum machine_mode mode, rtx x, unsigned int align)
3109 switch (GET_MODE_CLASS (mode))
3112 if (GET_CODE (x) != CONST_DOUBLE)
3117 REAL_VALUE_FROM_CONST_DOUBLE (r, x);
3118 assemble_real (r, mode, align);
3123 case MODE_PARTIAL_INT:
3124 assemble_integer (x, GET_MODE_SIZE (mode), align, 1);
3127 case MODE_VECTOR_FLOAT:
3128 case MODE_VECTOR_INT:
3131 enum machine_mode submode = GET_MODE_INNER (mode);
3132 unsigned int subalign = MIN (align, GET_MODE_BITSIZE (submode));
3134 if (GET_CODE (x) != CONST_VECTOR)
3136 units = CONST_VECTOR_NUNITS (x);
3138 for (i = 0; i < units; i++)
3140 rtx elt = CONST_VECTOR_ELT (x, i);
3141 output_constant_pool_2 (submode, elt, i ? subalign : align);
3151 /* Worker function for output_constant_pool. Emit POOL. */
3154 output_constant_pool_1 (struct constant_descriptor_rtx *desc)
3162 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3163 whose CODE_LABEL has been deleted. This can occur if a jump table
3164 is eliminated by optimization. If so, write a constant of zero
3165 instead. Note that this can also happen by turning the
3166 CODE_LABEL into a NOTE. */
3167 /* ??? This seems completely and utterly wrong. Certainly it's
3168 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3169 functioning even with INSN_DELETED_P and friends. */
3172 switch (GET_CODE (x))
3175 if (GET_CODE (XEXP (x, 0)) != PLUS
3176 || GET_CODE (XEXP (XEXP (x, 0), 0)) != LABEL_REF)
3178 tmp = XEXP (XEXP (x, 0), 0);
3183 if (INSN_DELETED_P (tmp)
3185 && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_DELETED))
3196 /* First switch to correct section. */
3197 targetm.asm_out.select_rtx_section (desc->mode, x, desc->align);
3199 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3200 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, desc->mode,
3201 desc->align, desc->labelno, done);
3204 assemble_align (desc->align);
3206 /* Output the label. */
3207 targetm.asm_out.internal_label (asm_out_file, "LC", desc->labelno);
3209 /* Output the data. */
3210 output_constant_pool_2 (desc->mode, x, desc->align);
3212 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3213 sections have proper size. */
3214 if (desc->align > GET_MODE_BITSIZE (desc->mode)
3215 && in_section == in_named
3216 && get_named_section_flags (in_named_name) & SECTION_MERGE)
3217 assemble_align (desc->align);
3219 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3225 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3226 to as used. Emit referenced deferred strings. This function can
3227 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3230 mark_constant (rtx *current_rtx, void *data)
3232 struct rtx_constant_pool *pool = data;
3233 rtx x = *current_rtx;
3235 if (x == NULL_RTX || GET_CODE (x) != SYMBOL_REF)
3238 if (CONSTANT_POOL_ADDRESS_P (x))
3240 struct constant_descriptor_rtx *desc = find_pool_constant (pool, x);
3241 if (desc->mark == 0)
3244 for_each_rtx (&desc->constant, mark_constant, pool);
3247 else if (TREE_CONSTANT_POOL_ADDRESS_P (x))
3249 tree exp = SYMBOL_REF_DECL (x);
3250 if (!TREE_ASM_WRITTEN (exp))
3252 n_deferred_constants--;
3253 output_constant_def_contents (x);
3260 /* Look through appropriate parts of INSN, marking all entries in the
3261 constant pool which are actually being used. Entries that are only
3262 referenced by other constants are also marked as used. Emit
3263 deferred strings that are used. */
3266 mark_constants (struct rtx_constant_pool *pool, rtx insn)
3271 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3272 insns, not any notes that may be attached. We don't want to mark
3273 a constant just because it happens to appear in a REG_EQUIV note. */
3274 if (GET_CODE (PATTERN (insn)) == SEQUENCE)
3276 rtx seq = PATTERN (insn);
3277 int i, n = XVECLEN (seq, 0);
3278 for (i = 0; i < n; ++i)
3280 rtx subinsn = XVECEXP (seq, 0, i);
3281 if (INSN_P (subinsn))
3282 for_each_rtx (&PATTERN (subinsn), mark_constant, pool);
3286 for_each_rtx (&PATTERN (insn), mark_constant, pool);
3289 /* Look through the instructions for this function, and mark all the
3290 entries in POOL which are actually being used. Emit deferred constants
3291 which have indeed been used. */
3294 mark_constant_pool (struct rtx_constant_pool *pool)
3298 if (pool->first == 0 && n_deferred_constants == 0)
3301 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3302 mark_constants (pool, insn);
3304 for (link = current_function_epilogue_delay_list;
3306 link = XEXP (link, 1))
3307 mark_constants (pool, XEXP (link, 0));
3310 /* Write all the constants in the constant pool. */
3313 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED,
3314 tree fndecl ATTRIBUTE_UNUSED)
3316 struct rtx_constant_pool *pool = cfun->varasm->pool;
3317 struct constant_descriptor_rtx *desc;
3319 /* It is possible for gcc to call force_const_mem and then to later
3320 discard the instructions which refer to the constant. In such a
3321 case we do not need to output the constant. */
3322 mark_constant_pool (pool);
3324 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3325 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool->offset);
3328 for (desc = pool->first; desc ; desc = desc->next)
3329 output_constant_pool_1 (desc);
3331 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3332 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool->offset);
3336 /* Determine what kind of relocations EXP may need. */
3339 compute_reloc_for_constant (tree exp)
3341 int reloc = 0, reloc2;
3344 /* Give the front-end a chance to convert VALUE to something that
3345 looks more like a constant to the back-end. */
3346 exp = lang_hooks.expand_constant (exp);
3348 switch (TREE_CODE (exp))
3352 /* Go inside any operations that get_inner_reference can handle and see
3353 if what's inside is a constant: no need to do anything here for
3354 addresses of variables or functions. */
3355 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
3356 tem = TREE_OPERAND (tem, 0))
3359 if (TREE_PUBLIC (tem))
3366 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
3367 reloc |= compute_reloc_for_constant (TREE_OPERAND (exp, 1));
3371 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
3372 reloc2 = compute_reloc_for_constant (TREE_OPERAND (exp, 1));
3373 /* The difference of two local labels is computable at link time. */
3374 if (reloc == 1 && reloc2 == 1)
3382 case NON_LVALUE_EXPR:
3383 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
3387 for (tem = CONSTRUCTOR_ELTS (exp); tem; tem = TREE_CHAIN (tem))
3388 if (TREE_VALUE (tem) != 0)
3389 reloc |= compute_reloc_for_constant (TREE_VALUE (tem));
3399 /* Find all the constants whose addresses are referenced inside of EXP,
3400 and make sure assembler code with a label has been output for each one.
3401 Indicate whether an ADDR_EXPR has been encountered. */
3404 output_addressed_constants (tree exp)
3408 /* Give the front-end a chance to convert VALUE to something that
3409 looks more like a constant to the back-end. */
3410 exp = lang_hooks.expand_constant (exp);
3412 switch (TREE_CODE (exp))
3416 /* Go inside any operations that get_inner_reference can handle and see
3417 if what's inside is a constant: no need to do anything here for
3418 addresses of variables or functions. */
3419 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
3420 tem = TREE_OPERAND (tem, 0))
3423 /* If we have an initialized CONST_DECL, retrieve the initializer. */
3424 if (TREE_CODE (tem) == CONST_DECL && DECL_INITIAL (tem))
3425 tem = DECL_INITIAL (tem);
3427 if (CONSTANT_CLASS_P (tem) || TREE_CODE (tem) == CONSTRUCTOR)
3428 output_constant_def (tem, 0);
3433 output_addressed_constants (TREE_OPERAND (exp, 1));
3438 case NON_LVALUE_EXPR:
3439 output_addressed_constants (TREE_OPERAND (exp, 0));
3443 for (tem = CONSTRUCTOR_ELTS (exp); tem; tem = TREE_CHAIN (tem))
3444 if (TREE_VALUE (tem) != 0)
3445 output_addressed_constants (TREE_VALUE (tem));
3454 /* Return nonzero if VALUE is a valid constant-valued expression
3455 for use in initializing a static variable; one that can be an
3456 element of a "constant" initializer.
3458 Return null_pointer_node if the value is absolute;
3459 if it is relocatable, return the variable that determines the relocation.
3460 We assume that VALUE has been folded as much as possible;
3461 therefore, we do not need to check for such things as
3462 arithmetic-combinations of integers. */
3465 initializer_constant_valid_p (tree value, tree endtype)
3467 /* Give the front-end a chance to convert VALUE to something that
3468 looks more like a constant to the back-end. */
3469 value = lang_hooks.expand_constant (value);
3471 switch (TREE_CODE (value))
3474 if ((TREE_CODE (TREE_TYPE (value)) == UNION_TYPE
3475 || TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE)
3476 && TREE_CONSTANT (value)
3477 && CONSTRUCTOR_ELTS (value))
3480 bool absolute = true;
3482 for (elt = CONSTRUCTOR_ELTS (value); elt; elt = TREE_CHAIN (elt))
3485 value = TREE_VALUE (elt);
3486 reloc = initializer_constant_valid_p (value, TREE_TYPE (value));
3489 if (reloc != null_pointer_node)
3492 /* For a non-absolute relocation, there is no single
3493 variable that can be "the variable that determines the
3495 return absolute ? null_pointer_node : error_mark_node;
3498 return TREE_STATIC (value) ? null_pointer_node : NULL_TREE;
3505 return null_pointer_node;
3509 value = staticp (TREE_OPERAND (value, 0));
3510 /* "&(*a).f" is like unto pointer arithmetic. If "a" turns out to
3511 be a constant, this is old-skool offsetof-like nonsense. */
3513 && TREE_CODE (value) == INDIRECT_REF
3514 && TREE_CONSTANT (TREE_OPERAND (value, 0)))
3515 return null_pointer_node;
3516 /* Taking the address of a nested function involves a trampoline. */
3518 && TREE_CODE (value) == FUNCTION_DECL
3519 && ((decl_function_context (value) && !DECL_NO_STATIC_CHAIN (value))
3520 || DECL_NON_ADDR_CONST_P (value)))
3524 case VIEW_CONVERT_EXPR:
3525 case NON_LVALUE_EXPR:
3526 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3535 src = TREE_OPERAND (value, 0);
3536 src_type = TREE_TYPE (src);
3537 dest_type = TREE_TYPE (value);
3539 /* Allow conversions between pointer types, floating-point
3540 types, and offset types. */
3541 if ((POINTER_TYPE_P (dest_type) && POINTER_TYPE_P (src_type))
3542 || (FLOAT_TYPE_P (dest_type) && FLOAT_TYPE_P (src_type))
3543 || (TREE_CODE (dest_type) == OFFSET_TYPE
3544 && TREE_CODE (src_type) == OFFSET_TYPE))
3545 return initializer_constant_valid_p (src, endtype);
3547 /* Allow length-preserving conversions between integer types. */
3548 if (INTEGRAL_TYPE_P (dest_type) && INTEGRAL_TYPE_P (src_type)
3549 && (TYPE_PRECISION (dest_type) == TYPE_PRECISION (src_type)))
3550 return initializer_constant_valid_p (src, endtype);
3552 /* Allow conversions between other integer types only if
3554 if (INTEGRAL_TYPE_P (dest_type) && INTEGRAL_TYPE_P (src_type))
3556 tree inner = initializer_constant_valid_p (src, endtype);
3557 if (inner == null_pointer_node)
3558 return null_pointer_node;
3562 /* Allow (int) &foo provided int is as wide as a pointer. */
3563 if (INTEGRAL_TYPE_P (dest_type) && POINTER_TYPE_P (src_type)
3564 && (TYPE_PRECISION (dest_type) >= TYPE_PRECISION (src_type)))
3565 return initializer_constant_valid_p (src, endtype);
3567 /* Likewise conversions from int to pointers, but also allow
3568 conversions from 0. */
3569 if ((POINTER_TYPE_P (dest_type)
3570 || TREE_CODE (dest_type) == OFFSET_TYPE)
3571 && INTEGRAL_TYPE_P (src_type))
3573 if (integer_zerop (src))
3574 return null_pointer_node;
3575 else if (TYPE_PRECISION (dest_type) <= TYPE_PRECISION (src_type))
3576 return initializer_constant_valid_p (src, endtype);
3579 /* Allow conversions to struct or union types if the value
3581 if (TREE_CODE (dest_type) == RECORD_TYPE
3582 || TREE_CODE (dest_type) == UNION_TYPE)
3583 return initializer_constant_valid_p (src, endtype);
3588 if (! INTEGRAL_TYPE_P (endtype)
3589 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3591 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3593 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3595 /* If either term is absolute, use the other terms relocation. */
3596 if (valid0 == null_pointer_node)
3598 if (valid1 == null_pointer_node)
3604 if (! INTEGRAL_TYPE_P (endtype)
3605 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3607 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3609 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3611 /* Win if second argument is absolute. */
3612 if (valid1 == null_pointer_node)
3614 /* Win if both arguments have the same relocation.
3615 Then the value is absolute. */
3616 if (valid0 == valid1 && valid0 != 0)
3617 return null_pointer_node;
3619 /* Since GCC guarantees that string constants are unique in the
3620 generated code, a subtraction between two copies of the same
3621 constant string is absolute. */
3622 if (valid0 && TREE_CODE (valid0) == STRING_CST
3623 && valid1 && TREE_CODE (valid1) == STRING_CST
3624 && operand_equal_p (valid0, valid1, 1))
3625 return null_pointer_node;
3628 /* Support narrowing differences. */
3629 if (INTEGRAL_TYPE_P (endtype))
3633 op0 = TREE_OPERAND (value, 0);
3634 op1 = TREE_OPERAND (value, 1);
3636 /* Like STRIP_NOPS except allow the operand mode to widen.
3637 This works around a feature of fold that simplifies
3638 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3639 that the narrower operation is cheaper. */
3641 while (TREE_CODE (op0) == NOP_EXPR
3642 || TREE_CODE (op0) == CONVERT_EXPR
3643 || TREE_CODE (op0) == NON_LVALUE_EXPR)
3645 tree inner = TREE_OPERAND (op0, 0);
3646 if (inner == error_mark_node
3647 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3648 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0)))
3649 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3654 while (TREE_CODE (op1) == NOP_EXPR
3655 || TREE_CODE (op1) == CONVERT_EXPR
3656 || TREE_CODE (op1) == NON_LVALUE_EXPR)
3658 tree inner = TREE_OPERAND (op1, 0);
3659 if (inner == error_mark_node
3660 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3661 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1)))
3662 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3667 op0 = initializer_constant_valid_p (op0, endtype);
3668 op1 = initializer_constant_valid_p (op1, endtype);
3670 /* Both initializers must be known. */
3674 return null_pointer_node;
3676 /* Support differences between labels. */
3677 if (TREE_CODE (op0) == LABEL_DECL
3678 && TREE_CODE (op1) == LABEL_DECL)
3679 return null_pointer_node;
3681 if (TREE_CODE (op0) == STRING_CST
3682 && TREE_CODE (op1) == STRING_CST
3683 && operand_equal_p (op0, op1, 1))
3684 return null_pointer_node;
3696 /* Output assembler code for constant EXP to FILE, with no label.
3697 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3698 Assumes output_addressed_constants has been done on EXP already.
3700 Generate exactly SIZE bytes of assembler data, padding at the end
3701 with zeros if necessary. SIZE must always be specified.
3703 SIZE is important for structure constructors,
3704 since trailing members may have been omitted from the constructor.
3705 It is also important for initialization of arrays from string constants
3706 since the full length of the string constant might not be wanted.
3707 It is also needed for initialization of unions, where the initializer's
3708 type is just one member, and that may not be as long as the union.
3710 There a case in which we would fail to output exactly SIZE bytes:
3711 for a structure constructor that wants to produce more than SIZE bytes.
3712 But such constructors will never be generated for any possible input.
3714 ALIGN is the alignment of the data in bits. */
3717 output_constant (tree exp, unsigned HOST_WIDE_INT size, unsigned int align)
3719 enum tree_code code;
3720 unsigned HOST_WIDE_INT thissize;
3722 /* Some front-ends use constants other than the standard language-independent
3723 varieties, but which may still be output directly. Give the front-end a
3724 chance to convert EXP to a language-independent representation. */
3725 exp = lang_hooks.expand_constant (exp);
3727 if (size == 0 || flag_syntax_only)
3730 /* Eliminate any conversions since we'll be outputting the underlying
3732 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
3733 || TREE_CODE (exp) == NON_LVALUE_EXPR
3734 || TREE_CODE (exp) == VIEW_CONVERT_EXPR)
3735 exp = TREE_OPERAND (exp, 0);
3737 code = TREE_CODE (TREE_TYPE (exp));
3738 thissize = int_size_in_bytes (TREE_TYPE (exp));
3740 /* Allow a constructor with no elements for any data type.
3741 This means to fill the space with zeros. */
3742 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
3744 assemble_zeros (size);
3748 if (TREE_CODE (exp) == FDESC_EXPR)
3750 #ifdef ASM_OUTPUT_FDESC
3751 HOST_WIDE_INT part = tree_low_cst (TREE_OPERAND (exp, 1), 0);
3752 tree decl = TREE_OPERAND (exp, 0);
3753 ASM_OUTPUT_FDESC (asm_out_file, decl, part);
3760 /* Now output the underlying data. If we've handling the padding, return.
3761 Otherwise, break and ensure SIZE is the size written. */
3769 case REFERENCE_TYPE:
3771 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
3772 EXPAND_INITIALIZER),
3773 MIN (size, thissize), align, 0))
3774 error ("initializer for integer value is too complicated");
3778 if (TREE_CODE (exp) != REAL_CST)
3779 error ("initializer for floating value is not a floating constant");
3781 assemble_real (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)), align);
3785 output_constant (TREE_REALPART (exp), thissize / 2, align);
3786 output_constant (TREE_IMAGPART (exp), thissize / 2,
3787 min_align (align, BITS_PER_UNIT * (thissize / 2)));
3792 if (TREE_CODE (exp) == CONSTRUCTOR)
3794 output_constructor (exp, size, align);
3797 else if (TREE_CODE (exp) == STRING_CST)
3799 thissize = MIN ((unsigned HOST_WIDE_INT)TREE_STRING_LENGTH (exp),
3801 assemble_string (TREE_STRING_POINTER (exp), thissize);
3803 else if (TREE_CODE (exp) == VECTOR_CST)
3807 unsigned int nalign;
3808 enum machine_mode inner;
3810 inner = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
3811 nalign = MIN (align, GET_MODE_ALIGNMENT (inner));
3813 elt_size = GET_MODE_SIZE (inner);
3815 link = TREE_VECTOR_CST_ELTS (exp);
3816 output_constant (TREE_VALUE (link), elt_size, align);
3817 while ((link = TREE_CHAIN (link)) != NULL)
3818 output_constant (TREE_VALUE (link), elt_size, nalign);
3826 if (TREE_CODE (exp) == CONSTRUCTOR)
3827 output_constructor (exp, size, align);
3839 if (size > thissize)
3840 assemble_zeros (size - thissize);
3844 /* Subroutine of output_constructor, used for computing the size of
3845 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3846 type with an unspecified upper bound. */
3848 static unsigned HOST_WIDE_INT
3849 array_size_for_constructor (tree val)
3853 /* This code used to attempt to handle string constants that are not
3854 arrays of single-bytes, but nothing else does, so there's no point in
3856 if (TREE_CODE (val) == STRING_CST)
3857 return TREE_STRING_LENGTH (val);
3859 max_index = NULL_TREE;
3860 for (i = CONSTRUCTOR_ELTS (val); i; i = TREE_CHAIN (i))
3862 tree index = TREE_PURPOSE (i);
3864 if (TREE_CODE (index) == RANGE_EXPR)
3865 index = TREE_OPERAND (index, 1);
3866 if (max_index == NULL_TREE || tree_int_cst_lt (max_index, index))
3870 if (max_index == NULL_TREE)
3873 /* Compute the total number of array elements. */
3874 i = size_binop (MINUS_EXPR, convert (sizetype, max_index),
3876 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val)))));
3877 i = size_binop (PLUS_EXPR, i, convert (sizetype, integer_one_node));
3879 /* Multiply by the array element unit size to find number of bytes. */
3880 i = size_binop (MULT_EXPR, i, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val))));
3882 return tree_low_cst (i, 1);
3885 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3886 Generate at least SIZE bytes, padding if necessary. */
3889 output_constructor (tree exp, unsigned HOST_WIDE_INT size,
3892 tree type = TREE_TYPE (exp);
3893 tree link, field = 0;
3895 /* Number of bytes output or skipped so far.
3896 In other words, current position within the constructor. */
3897 HOST_WIDE_INT total_bytes = 0;
3898 /* Nonzero means BYTE contains part of a byte, to be output. */
3899 int byte_buffer_in_use = 0;
3902 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
3905 if (TREE_CODE (type) == RECORD_TYPE)
3906 field = TYPE_FIELDS (type);
3908 if (TREE_CODE (type) == ARRAY_TYPE
3909 && TYPE_DOMAIN (type) != 0)
3910 min_index = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
3912 /* As LINK goes through the elements of the constant,
3913 FIELD goes through the structure fields, if the constant is a structure.
3914 if the constant is a union, then we override this,
3915 by getting the field from the TREE_LIST element.
3916 But the constant could also be an array. Then FIELD is zero.
3918 There is always a maximum of one element in the chain LINK for unions
3919 (even if the initializer in a source program incorrectly contains
3921 for (link = CONSTRUCTOR_ELTS (exp);
3923 link = TREE_CHAIN (link),
3924 field = field ? TREE_CHAIN (field) : 0)
3926 tree val = TREE_VALUE (link);
3929 /* The element in a union constructor specifies the proper field
3931 if ((TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
3932 || TREE_CODE (type) == QUAL_UNION_TYPE)
3933 && TREE_PURPOSE (link) != 0)
3934 field = TREE_PURPOSE (link);
3936 else if (TREE_CODE (type) == ARRAY_TYPE)
3937 index = TREE_PURPOSE (link);
3939 #ifdef ASM_COMMENT_START
3940 if (field && flag_verbose_asm)
3941 fprintf (asm_out_file, "%s %s:\n",
3944 ? IDENTIFIER_POINTER (DECL_NAME (field))
3948 /* Eliminate the marker that makes a cast not be an lvalue. */
3952 if (index && TREE_CODE (index) == RANGE_EXPR)
3954 unsigned HOST_WIDE_INT fieldsize
3955 = int_size_in_bytes (TREE_TYPE (type));
3956 HOST_WIDE_INT lo_index = tree_low_cst (TREE_OPERAND (index, 0), 0);
3957 HOST_WIDE_INT hi_index = tree_low_cst (TREE_OPERAND (index, 1), 0);
3958 HOST_WIDE_INT index;
3959 unsigned int align2 = min_align (align, fieldsize * BITS_PER_UNIT);
3961 for (index = lo_index; index <= hi_index; index++)
3963 /* Output the element's initial value. */
3965 assemble_zeros (fieldsize);
3967 output_constant (val, fieldsize, align2);
3969 /* Count its size. */
3970 total_bytes += fieldsize;
3973 else if (field == 0 || !DECL_BIT_FIELD (field))
3975 /* An element that is not a bit-field. */
3977 unsigned HOST_WIDE_INT fieldsize;
3978 /* Since this structure is static,
3979 we know the positions are constant. */
3980 HOST_WIDE_INT pos = field ? int_byte_position (field) : 0;
3981 unsigned int align2;
3984 pos = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val)), 1)
3985 * (tree_low_cst (index, 0) - tree_low_cst (min_index, 0)));
3987 /* Output any buffered-up bit-fields preceding this element. */
3988 if (byte_buffer_in_use)
3990 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
3992 byte_buffer_in_use = 0;
3995 /* Advance to offset of this element.
3996 Note no alignment needed in an array, since that is guaranteed
3997 if each element has the proper size. */
3998 if ((field != 0 || index != 0) && pos != total_bytes)
4000 assemble_zeros (pos - total_bytes);
4004 /* Find the alignment of this element. */
4005 align2 = min_align (align, BITS_PER_UNIT * pos);
4007 /* Determine size this element should occupy. */
4012 /* If this is an array with an unspecified upper bound,
4013 the initializer determines the size. */
4014 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4015 but we cannot do this until the deprecated support for
4016 initializing zero-length array members is removed. */
4017 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE
4018 && TYPE_DOMAIN (TREE_TYPE (field))
4019 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field))))
4021 fieldsize = array_size_for_constructor (val);
4022 /* Given a non-empty initialization, this field had
4024 if (fieldsize != 0 && TREE_CHAIN (field) != NULL_TREE)
4027 else if (DECL_SIZE_UNIT (field))
4029 /* ??? This can't be right. If the decl size overflows
4030 a host integer we will silently emit no data. */
4031 if (host_integerp (DECL_SIZE_UNIT (field), 1))
4032 fieldsize = tree_low_cst (DECL_SIZE_UNIT (field), 1);
4036 fieldsize = int_size_in_bytes (TREE_TYPE (type));
4038 /* Output the element's initial value. */
4040 assemble_zeros (fieldsize);
4042 output_constant (val, fieldsize, align2);
4044 /* Count its size. */
4045 total_bytes += fieldsize;
4047 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
4048 error ("invalid initial value for member %qs",
4049 IDENTIFIER_POINTER (DECL_NAME (field)));
4052 /* Element that is a bit-field. */
4054 HOST_WIDE_INT next_offset = int_bit_position (field);
4055 HOST_WIDE_INT end_offset
4056 = (next_offset + tree_low_cst (DECL_SIZE (field), 1));
4059 val = integer_zero_node;
4061 /* If this field does not start in this (or, next) byte,
4063 if (next_offset / BITS_PER_UNIT != total_bytes)
4065 /* Output remnant of any bit field in previous bytes. */
4066 if (byte_buffer_in_use)
4068 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4070 byte_buffer_in_use = 0;
4073 /* If still not at proper byte, advance to there. */
4074 if (next_offset / BITS_PER_UNIT != total_bytes)
4076 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
4077 total_bytes = next_offset / BITS_PER_UNIT;
4081 if (! byte_buffer_in_use)
4084 /* We must split the element into pieces that fall within
4085 separate bytes, and combine each byte with previous or
4086 following bit-fields. */
4088 /* next_offset is the offset n fbits from the beginning of
4089 the structure to the next bit of this element to be processed.
4090 end_offset is the offset of the first bit past the end of
4092 while (next_offset < end_offset)
4096 HOST_WIDE_INT value;
4097 HOST_WIDE_INT next_byte = next_offset / BITS_PER_UNIT;
4098 HOST_WIDE_INT next_bit = next_offset % BITS_PER_UNIT;
4100 /* Advance from byte to byte
4101 within this element when necessary. */
4102 while (next_byte != total_bytes)
4104 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4109 /* Number of bits we can process at once
4110 (all part of the same byte). */
4111 this_time = MIN (end_offset - next_offset,
4112 BITS_PER_UNIT - next_bit);
4113 if (BYTES_BIG_ENDIAN)
4115 /* On big-endian machine, take the most significant bits
4116 first (of the bits that are significant)
4117 and put them into bytes from the most significant end. */
4118 shift = end_offset - next_offset - this_time;
4120 /* Don't try to take a bunch of bits that cross
4121 the word boundary in the INTEGER_CST. We can
4122 only select bits from the LOW or HIGH part
4124 if (shift < HOST_BITS_PER_WIDE_INT
4125 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4127 this_time = shift + this_time - HOST_BITS_PER_WIDE_INT;
4128 shift = HOST_BITS_PER_WIDE_INT;
4131 /* Now get the bits from the appropriate constant word. */
4132 if (shift < HOST_BITS_PER_WIDE_INT)
4133 value = TREE_INT_CST_LOW (val);
4134 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4136 value = TREE_INT_CST_HIGH (val);
4137 shift -= HOST_BITS_PER_WIDE_INT;
4142 /* Get the result. This works only when:
4143 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4144 byte |= (((value >> shift)
4145 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4146 << (BITS_PER_UNIT - this_time - next_bit));
4150 /* On little-endian machines,
4151 take first the least significant bits of the value
4152 and pack them starting at the least significant
4153 bits of the bytes. */
4154 shift = next_offset - int_bit_position (field);
4156 /* Don't try to take a bunch of bits that cross
4157 the word boundary in the INTEGER_CST. We can
4158 only select bits from the LOW or HIGH part
4160 if (shift < HOST_BITS_PER_WIDE_INT
4161 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4162 this_time = (HOST_BITS_PER_WIDE_INT - shift);
4164 /* Now get the bits from the appropriate constant word. */
4165 if (shift < HOST_BITS_PER_WIDE_INT)
4166 value = TREE_INT_CST_LOW (val);
4167 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4169 value = TREE_INT_CST_HIGH (val);
4170 shift -= HOST_BITS_PER_WIDE_INT;
4175 /* Get the result. This works only when:
4176 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4177 byte |= (((value >> shift)
4178 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4182 next_offset += this_time;
4183 byte_buffer_in_use = 1;
4188 if (byte_buffer_in_use)
4190 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4194 if ((unsigned HOST_WIDE_INT)total_bytes < size)
4195 assemble_zeros (size - total_bytes);
4198 /* This TREE_LIST contains any weak symbol declarations waiting
4200 static GTY(()) tree weak_decls;
4202 /* Mark DECL as weak. */
4205 mark_weak (tree decl)
4207 DECL_WEAK (decl) = 1;
4209 if (DECL_RTL_SET_P (decl)
4210 && MEM_P (DECL_RTL (decl))
4211 && XEXP (DECL_RTL (decl), 0)
4212 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == SYMBOL_REF)
4213 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl), 0)) = 1;
4216 /* Merge weak status between NEWDECL and OLDDECL. */
4219 merge_weak (tree newdecl, tree olddecl)
4221 if (DECL_WEAK (newdecl) == DECL_WEAK (olddecl))
4224 if (DECL_WEAK (newdecl))
4228 /* NEWDECL is weak, but OLDDECL is not. */
4230 /* If we already output the OLDDECL, we're in trouble; we can't
4231 go back and make it weak. This error cannot caught in
4232 declare_weak because the NEWDECL and OLDDECL was not yet
4233 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4234 if (TREE_ASM_WRITTEN (olddecl))
4235 error ("%Jweak declaration of %qD must precede definition",
4238 /* If we've already generated rtl referencing OLDDECL, we may
4239 have done so in a way that will not function properly with
4241 else if (TREE_USED (olddecl)
4242 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl)))
4243 warning ("%Jweak declaration of %qD after first use results "
4244 "in unspecified behavior", newdecl, newdecl);
4248 /* We put the NEWDECL on the weak_decls list at some point.
4249 Replace it with the OLDDECL. */
4250 for (wd = weak_decls; wd; wd = TREE_CHAIN (wd))
4251 if (TREE_VALUE (wd) == newdecl)
4253 TREE_VALUE (wd) = olddecl;
4256 /* We may not find the entry on the list. If NEWDECL is a
4257 weak alias, then we will have already called
4258 globalize_decl to remove the entry; in that case, we do
4259 not need to do anything. */
4262 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4263 mark_weak (olddecl);
4266 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4267 weak. Just update NEWDECL to indicate that it's weak too. */
4268 mark_weak (newdecl);
4271 /* Declare DECL to be a weak symbol. */
4274 declare_weak (tree decl)
4276 if (! TREE_PUBLIC (decl))
4277 error ("%Jweak declaration of %qD must be public", decl, decl);
4278 else if (TREE_CODE (decl) == FUNCTION_DECL && TREE_ASM_WRITTEN (decl))
4279 error ("%Jweak declaration of %qD must precede definition", decl, decl);
4280 else if (SUPPORTS_WEAK)
4282 if (! DECL_WEAK (decl))
4283 weak_decls = tree_cons (NULL, decl, weak_decls);
4286 warning ("%Jweak declaration of %qD not supported", decl, decl);
4291 /* Emit any pending weak declarations. */
4298 for (t = weak_decls; t; t = TREE_CHAIN (t))
4300 tree decl = TREE_VALUE (t);
4301 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4302 const char *const name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4305 if (! TREE_USED (decl))
4308 #ifdef ASM_WEAKEN_DECL
4309 ASM_WEAKEN_DECL (asm_out_file, decl, name, NULL);
4311 #ifdef ASM_WEAKEN_LABEL
4312 ASM_WEAKEN_LABEL (asm_out_file, name);
4314 #ifdef ASM_OUTPUT_WEAK_ALIAS
4315 warning ("only weak aliases are supported in this configuration");
4323 /* Emit the assembly bits to indicate that DECL is globally visible. */
4326 globalize_decl (tree decl)
4328 const char *name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4330 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4331 if (DECL_WEAK (decl))
4335 #ifdef ASM_WEAKEN_DECL
4336 ASM_WEAKEN_DECL (asm_out_file, decl, name, 0);
4338 ASM_WEAKEN_LABEL (asm_out_file, name);
4341 /* Remove this function from the pending weak list so that
4342 we do not emit multiple .weak directives for it. */
4343 for (p = &weak_decls; (t = *p) ; )
4345 if (DECL_ASSEMBLER_NAME (decl) == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
4346 *p = TREE_CHAIN (t);
4348 p = &TREE_CHAIN (t);
4352 #elif defined(ASM_MAKE_LABEL_LINKONCE)
4353 if (DECL_ONE_ONLY (decl))
4354 ASM_MAKE_LABEL_LINKONCE (asm_out_file, name);
4357 targetm.asm_out.globalize_label (asm_out_file, name);
4360 /* We have to be able to tell cgraph about the needed-ness of the target
4361 of an alias. This requires that the decl have been defined. Aliases
4362 that preceed their definition have to be queued for later processing. */
4364 struct alias_pair GTY(())
4369 typedef struct alias_pair *alias_pair;
4371 /* Define gc'd vector type. */
4372 DEF_VEC_GC_P(alias_pair);
4374 static GTY(()) VEC(alias_pair) *alias_pairs;
4376 /* Given an assembly name, find the decl it is associated with. At the
4377 same time, mark it needed for cgraph. */
4380 find_decl_and_mark_needed (tree decl, tree target)
4382 struct cgraph_node *fnode = NULL;
4383 struct cgraph_varpool_node *vnode = NULL;
4385 /* C++ thunk emitting code produces aliases late in the game.
4386 Avoid confusing cgraph code in that case. */
4387 if (!cgraph_global_info_ready)
4389 if (TREE_CODE (decl) == FUNCTION_DECL)
4391 fnode = cgraph_node_for_asm (target);
4393 vnode = cgraph_varpool_node_for_asm (target);
4397 vnode = cgraph_varpool_node_for_asm (target);
4399 fnode = cgraph_node_for_asm (target);
4405 cgraph_mark_needed_node (fnode);
4410 cgraph_varpool_mark_needed_node (vnode);
4418 do_assemble_alias (tree decl, tree target)
4420 TREE_ASM_WRITTEN (decl) = 1;
4421 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl)) = 1;
4423 #ifdef ASM_OUTPUT_DEF
4424 /* Make name accessible from other files, if appropriate. */
4426 if (TREE_PUBLIC (decl))
4428 globalize_decl (decl);
4429 maybe_assemble_visibility (decl);
4432 # ifdef ASM_OUTPUT_DEF_FROM_DECLS
4433 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
4435 ASM_OUTPUT_DEF (asm_out_file,
4436 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)),
4437 IDENTIFIER_POINTER (target));
4439 #elif defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4444 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4445 # ifdef ASM_WEAKEN_DECL
4446 ASM_WEAKEN_DECL (asm_out_file, decl, name, IDENTIFIER_POINTER (target));
4448 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
4450 /* Remove this function from the pending weak list so that
4451 we do not emit multiple .weak directives for it. */
4452 for (p = &weak_decls; (t = *p) ; )
4453 if (DECL_ASSEMBLER_NAME (decl) == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
4454 *p = TREE_CHAIN (t);
4456 p = &TREE_CHAIN (t);
4461 /* First pass of completing pending aliases. Make sure that cgraph knows
4462 which symbols will be required. */
4465 finish_aliases_1 (void)
4470 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
4474 target_decl = find_decl_and_mark_needed (p->decl, p->target);
4475 if (target_decl == NULL)
4476 error ("%J%qD aliased to undefined symbol %qE",
4477 p->decl, p->decl, p->target);
4478 else if (DECL_EXTERNAL (target_decl))
4479 error ("%J%qD aliased to external symbol %qE",
4480 p->decl, p->decl, p->target);
4484 /* Second pass of completing pending aliases. Emit the actual assembly.
4485 This happens at the end of compilation and thus it is assured that the
4486 target symbol has been emitted. */
4489 finish_aliases_2 (void)
4494 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
4495 do_assemble_alias (p->decl, p->target);
4500 /* Emit an assembler directive to make the symbol for DECL an alias to
4501 the symbol for TARGET. */
4504 assemble_alias (tree decl, tree target)
4508 #if !defined (ASM_OUTPUT_DEF)
4509 # if !defined(ASM_OUTPUT_WEAK_ALIAS) && !defined (ASM_WEAKEN_DECL)
4510 error ("%Jalias definitions not supported in this configuration", decl);
4513 if (!DECL_WEAK (decl))
4515 error ("%Jonly weak aliases are supported in this configuration", decl);
4521 /* We must force creation of DECL_RTL for debug info generation, even though
4522 we don't use it here. */
4523 make_decl_rtl (decl);
4524 TREE_USED (decl) = 1;
4526 /* A quirk of the initial implementation of aliases required that the user
4527 add "extern" to all of them. Which is silly, but now historical. Do
4528 note that the symbol is in fact locally defined. */
4529 DECL_EXTERNAL (decl) = 0;
4531 /* Allow aliases to aliases. */
4532 if (TREE_CODE (decl) == FUNCTION_DECL)
4533 cgraph_node (decl)->alias = true;
4535 cgraph_varpool_node (decl)->alias = true;
4537 /* If the target has already been emitted, we don't have to queue the
4538 alias. This saves a tad o memory. */
4539 target_decl = find_decl_and_mark_needed (decl, target);
4540 if (target_decl && TREE_ASM_WRITTEN (target_decl))
4541 do_assemble_alias (decl, target);
4546 p = ggc_alloc (sizeof (struct alias_pair));
4549 VEC_safe_push (alias_pair, alias_pairs, p);
4553 /* Emit an assembler directive to set symbol for DECL visibility to
4554 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4557 default_assemble_visibility (tree decl, int vis)
4559 static const char * const visibility_types[] = {
4560 NULL, "internal", "hidden", "protected"
4563 const char *name, *type;
4565 name = (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
4566 type = visibility_types[vis];
4568 #ifdef HAVE_GAS_HIDDEN
4569 fprintf (asm_out_file, "\t.%s\t", type);
4570 assemble_name (asm_out_file, name);
4571 fprintf (asm_out_file, "\n");
4573 warning ("visibility attribute not supported in this configuration; ignored");
4577 /* A helper function to call assemble_visibility when needed for a decl. */
4580 maybe_assemble_visibility (tree decl)
4582 enum symbol_visibility vis = DECL_VISIBILITY (decl);
4584 if (vis != VISIBILITY_DEFAULT)
4585 targetm.asm_out.visibility (decl, vis);
4588 /* Returns 1 if the target configuration supports defining public symbols
4589 so that one of them will be chosen at link time instead of generating a
4590 multiply-defined symbol error, whether through the use of weak symbols or
4591 a target-specific mechanism for having duplicates discarded. */
4594 supports_one_only (void)
4596 if (SUPPORTS_ONE_ONLY)
4598 return SUPPORTS_WEAK;
4601 /* Set up DECL as a public symbol that can be defined in multiple
4602 translation units without generating a linker error. */
4605 make_decl_one_only (tree decl)
4607 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL)
4610 TREE_PUBLIC (decl) = 1;
4612 if (SUPPORTS_ONE_ONLY)
4614 #ifdef MAKE_DECL_ONE_ONLY
4615 MAKE_DECL_ONE_ONLY (decl);
4617 DECL_ONE_ONLY (decl) = 1;
4619 else if (TREE_CODE (decl) == VAR_DECL
4620 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
4621 DECL_COMMON (decl) = 1;
4622 else if (SUPPORTS_WEAK)
4623 DECL_WEAK (decl) = 1;
4629 init_varasm_once (void)
4631 in_named_htab = htab_create_ggc (31, in_named_entry_hash,
4632 in_named_entry_eq, NULL);
4633 const_desc_htab = htab_create_ggc (1009, const_desc_hash,
4634 const_desc_eq, NULL);
4636 const_alias_set = new_alias_set ();
4639 static enum tls_model
4640 decl_tls_model (tree decl)
4642 enum tls_model kind;
4643 tree attr = lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl));
4648 attr = TREE_VALUE (TREE_VALUE (attr));
4649 if (TREE_CODE (attr) != STRING_CST)
4651 if (!strcmp (TREE_STRING_POINTER (attr), "local-exec"))
4652 kind = TLS_MODEL_LOCAL_EXEC;
4653 else if (!strcmp (TREE_STRING_POINTER (attr), "initial-exec"))
4654 kind = TLS_MODEL_INITIAL_EXEC;
4655 else if (!strcmp (TREE_STRING_POINTER (attr), "local-dynamic"))
4656 kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
4657 else if (!strcmp (TREE_STRING_POINTER (attr), "global-dynamic"))
4658 kind = TLS_MODEL_GLOBAL_DYNAMIC;
4664 is_local = targetm.binds_local_p (decl);
4668 kind = TLS_MODEL_LOCAL_EXEC;
4670 kind = TLS_MODEL_INITIAL_EXEC;
4672 /* Local dynamic is inefficient when we're not combining the
4673 parts of the address. */
4674 else if (optimize && is_local)
4675 kind = TLS_MODEL_LOCAL_DYNAMIC;
4677 kind = TLS_MODEL_GLOBAL_DYNAMIC;
4678 if (kind < flag_tls_default)
4679 kind = flag_tls_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 (tree decl, const char *name, int reloc)
4694 return default_section_type_flags_1 (decl, name, reloc, flag_pic);
4698 default_section_type_flags_1 (tree decl, const char *name, int reloc,
4703 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
4704 flags = SECTION_CODE;
4705 else if (decl && decl_readonly_section_1 (decl, reloc, shlib))
4707 else if (unlikely_text_section_name
4708 && strcmp (name, unlikely_text_section_name) == 0)
4709 flags = SECTION_CODE;
4711 flags = SECTION_WRITE;
4713 if (decl && DECL_ONE_ONLY (decl))
4714 flags |= SECTION_LINKONCE;
4716 if (decl && TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4717 flags |= SECTION_TLS | SECTION_WRITE;
4719 if (strcmp (name, ".bss") == 0
4720 || strncmp (name, ".bss.", 5) == 0
4721 || strncmp (name, ".gnu.linkonce.b.", 16) == 0
4722 || strcmp (name, ".sbss") == 0
4723 || strncmp (name, ".sbss.", 6) == 0
4724 || strncmp (name, ".gnu.linkonce.sb.", 17) == 0)
4725 flags |= SECTION_BSS;
4727 if (strcmp (name, ".tdata") == 0
4728 || strncmp (name, ".tdata.", 7) == 0
4729 || strncmp (name, ".gnu.linkonce.td.", 17) == 0)
4730 flags |= SECTION_TLS;
4732 if (strcmp (name, ".tbss") == 0
4733 || strncmp (name, ".tbss.", 6) == 0
4734 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4735 flags |= SECTION_TLS | SECTION_BSS;
4737 /* These three sections have special ELF types. They are neither
4738 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4739 want to print a section type (@progbits or @nobits). If someone
4740 is silly enough to emit code or TLS variables to one of these
4741 sections, then don't handle them specially. */
4742 if (!(flags & (SECTION_CODE | SECTION_BSS | SECTION_TLS))
4743 && (strcmp (name, ".init_array") == 0
4744 || strcmp (name, ".fini_array") == 0
4745 || strcmp (name, ".preinit_array") == 0))
4746 flags |= SECTION_NOTYPE;
4751 /* Output assembly to switch to section NAME with attribute FLAGS.
4752 Four variants for common object file formats. */
4755 default_no_named_section (const char *name ATTRIBUTE_UNUSED,
4756 unsigned int flags ATTRIBUTE_UNUSED,
4757 tree decl ATTRIBUTE_UNUSED)
4759 /* Some object formats don't support named sections at all. The
4760 front-end should already have flagged this as an error. */
4765 default_elf_asm_named_section (const char *name, unsigned int flags,
4766 tree decl ATTRIBUTE_UNUSED)
4768 char flagchars[10], *f = flagchars;
4770 /* If we have already declared this section, we can use an
4771 abbreviated form to switch back to it -- unless this section is
4772 part of a COMDAT groups, in which case GAS requires the full
4773 declaration every time. */
4774 if (!(HAVE_GAS_COMDAT_GROUP && (flags & SECTION_LINKONCE))
4775 && ! named_section_first_declaration (name))
4777 fprintf (asm_out_file, "\t.section\t%s\n", name);
4781 if (!(flags & SECTION_DEBUG))
4783 if (flags & SECTION_WRITE)
4785 if (flags & SECTION_CODE)
4787 if (flags & SECTION_SMALL)
4789 if (flags & SECTION_MERGE)
4791 if (flags & SECTION_STRINGS)
4793 if (flags & SECTION_TLS)
4795 if (HAVE_GAS_COMDAT_GROUP && (flags & SECTION_LINKONCE))
4799 fprintf (asm_out_file, "\t.section\t%s,\"%s\"", name, flagchars);
4801 if (!(flags & SECTION_NOTYPE))
4806 if (flags & SECTION_BSS)
4812 #ifdef ASM_COMMENT_START
4813 /* On platforms that use "@" as the assembly comment character,
4815 if (strcmp (ASM_COMMENT_START, "@") == 0)
4818 fprintf (asm_out_file, format, type);
4820 if (flags & SECTION_ENTSIZE)
4821 fprintf (asm_out_file, ",%d", flags & SECTION_ENTSIZE);
4822 if (HAVE_GAS_COMDAT_GROUP && (flags & SECTION_LINKONCE))
4823 fprintf (asm_out_file, ",%s,comdat",
4824 lang_hooks.decls.comdat_group (decl));
4827 putc ('\n', asm_out_file);
4831 default_coff_asm_named_section (const char *name, unsigned int flags,
4832 tree decl ATTRIBUTE_UNUSED)
4834 char flagchars[8], *f = flagchars;
4836 if (flags & SECTION_WRITE)
4838 if (flags & SECTION_CODE)
4842 fprintf (asm_out_file, "\t.section\t%s,\"%s\"\n", name, flagchars);
4846 default_pe_asm_named_section (const char *name, unsigned int flags,
4849 default_coff_asm_named_section (name, flags, decl);
4851 if (flags & SECTION_LINKONCE)
4853 /* Functions may have been compiled at various levels of
4854 optimization so we can't use `same_size' here.
4855 Instead, have the linker pick one. */
4856 fprintf (asm_out_file, "\t.linkonce %s\n",
4857 (flags & SECTION_CODE ? "discard" : "same_size"));
4861 /* The lame default section selector. */
4864 default_select_section (tree decl, int reloc,
4865 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED)
4867 bool readonly = false;
4871 if (decl_readonly_section (decl, reloc))
4874 else if (TREE_CODE (decl) == CONSTRUCTOR)
4876 if (! ((flag_pic && reloc)
4877 || !TREE_READONLY (decl)
4878 || TREE_SIDE_EFFECTS (decl)
4879 || !TREE_CONSTANT (decl)))
4882 else if (TREE_CODE (decl) == STRING_CST)
4884 else if (! (flag_pic && reloc))
4888 readonly_data_section ();
4893 /* A helper function for default_elf_select_section and
4894 default_elf_unique_section. Categorizes the DECL. */
4896 enum section_category
4901 SECCAT_RODATA_MERGE_STR,
4902 SECCAT_RODATA_MERGE_STR_INIT,
4903 SECCAT_RODATA_MERGE_CONST,
4908 /* To optimize loading of shared programs, define following subsections
4910 _REL Contains data that has relocations, so they get grouped
4911 together and dynamic linker will visit fewer pages in memory.
4912 _RO Contains data that is otherwise read-only. This is useful
4913 with prelinking as most relocations won't be dynamically
4914 linked and thus stay read only.
4915 _LOCAL Marks data containing relocations only to local objects.
4916 These relocations will get fully resolved by prelinking. */
4918 SECCAT_DATA_REL_LOCAL,
4920 SECCAT_DATA_REL_RO_LOCAL,
4930 static enum section_category
4931 categorize_decl_for_section (tree, int, int);
4933 static enum section_category
4934 categorize_decl_for_section (tree decl, int reloc, int shlib)
4936 enum section_category ret;
4938 if (TREE_CODE (decl) == FUNCTION_DECL)
4940 else if (TREE_CODE (decl) == STRING_CST)
4942 if (flag_mudflap) /* or !flag_merge_constants */
4943 return SECCAT_RODATA;
4945 return SECCAT_RODATA_MERGE_STR;
4947 else if (TREE_CODE (decl) == VAR_DECL)
4949 if (DECL_INITIAL (decl) == NULL
4950 || DECL_INITIAL (decl) == error_mark_node
4951 || (flag_zero_initialized_in_bss
4952 /* Leave constant zeroes in .rodata so they can be shared. */
4953 && !TREE_READONLY (decl)
4954 && initializer_zerop (DECL_INITIAL (decl))))
4956 else if (! TREE_READONLY (decl)
4957 || TREE_SIDE_EFFECTS (decl)
4958 || ! TREE_CONSTANT (DECL_INITIAL (decl)))
4960 if (shlib && (reloc & 2))
4961 ret = SECCAT_DATA_REL;
4962 else if (shlib && reloc)
4963 ret = SECCAT_DATA_REL_LOCAL;
4967 else if (shlib && (reloc & 2))
4968 ret = SECCAT_DATA_REL_RO;
4969 else if (shlib && reloc)
4970 ret = SECCAT_DATA_REL_RO_LOCAL;
4971 else if (reloc || flag_merge_constants < 2)
4972 /* C and C++ don't allow different variables to share the same
4973 location. -fmerge-all-constants allows even that (at the
4974 expense of not conforming). */
4975 ret = SECCAT_RODATA;
4976 else if (TREE_CODE (DECL_INITIAL (decl)) == STRING_CST)
4977 ret = SECCAT_RODATA_MERGE_STR_INIT;
4979 ret = SECCAT_RODATA_MERGE_CONST;
4981 else if (TREE_CODE (decl) == CONSTRUCTOR)
4983 if ((shlib && reloc)
4984 || TREE_SIDE_EFFECTS (decl)
4985 || ! TREE_CONSTANT (decl))
4988 ret = SECCAT_RODATA;
4991 ret = SECCAT_RODATA;
4993 /* There are no read-only thread-local sections. */
4994 if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4996 /* Note that this would be *just* SECCAT_BSS, except that there's
4997 no concept of a read-only thread-local-data section. */
4998 if (ret == SECCAT_BSS
4999 || (flag_zero_initialized_in_bss
5000 && initializer_zerop (DECL_INITIAL (decl))))
5006 /* If the target uses small data sections, select it. */
5007 else if (targetm.in_small_data_p (decl))
5009 if (ret == SECCAT_BSS)
5011 else if (targetm.have_srodata_section && ret == SECCAT_RODATA)
5012 ret = SECCAT_SRODATA;
5021 decl_readonly_section (tree decl, int reloc)
5023 return decl_readonly_section_1 (decl, reloc, flag_pic);
5027 decl_readonly_section_1 (tree decl, int reloc, int shlib)
5029 switch (categorize_decl_for_section (decl, reloc, shlib))
5032 case SECCAT_RODATA_MERGE_STR:
5033 case SECCAT_RODATA_MERGE_STR_INIT:
5034 case SECCAT_RODATA_MERGE_CONST:
5035 case SECCAT_SRODATA:
5044 /* Select a section based on the above categorization. */
5047 default_elf_select_section (tree decl, int reloc,
5048 unsigned HOST_WIDE_INT align)
5050 default_elf_select_section_1 (decl, reloc, align, flag_pic);
5054 default_elf_select_section_1 (tree decl, int reloc,
5055 unsigned HOST_WIDE_INT align, int shlib)
5058 switch (categorize_decl_for_section (decl, reloc, shlib))
5061 /* We're not supposed to be called on FUNCTION_DECLs. */
5064 readonly_data_section ();
5066 case SECCAT_RODATA_MERGE_STR:
5067 mergeable_string_section (decl, align, 0);
5069 case SECCAT_RODATA_MERGE_STR_INIT:
5070 mergeable_string_section (DECL_INITIAL (decl), align, 0);
5072 case SECCAT_RODATA_MERGE_CONST:
5073 mergeable_constant_section (DECL_MODE (decl), align, 0);
5075 case SECCAT_SRODATA:
5081 case SECCAT_DATA_REL:
5082 sname = ".data.rel";
5084 case SECCAT_DATA_REL_LOCAL:
5085 sname = ".data.rel.local";
5087 case SECCAT_DATA_REL_RO:
5088 sname = ".data.rel.ro";
5090 case SECCAT_DATA_REL_RO_LOCAL:
5091 sname = ".data.rel.ro.local";
5100 #ifdef BSS_SECTION_ASM_OP
5119 named_section (decl, sname, reloc);
5122 /* Construct a unique section name based on the decl name and the
5123 categorization performed above. */
5126 default_unique_section (tree decl, int reloc)
5128 default_unique_section_1 (decl, reloc, flag_pic);
5132 default_unique_section_1 (tree decl, int reloc, int shlib)
5134 bool one_only = DECL_ONE_ONLY (decl);
5135 const char *prefix, *name;
5139 switch (categorize_decl_for_section (decl, reloc, shlib))
5142 prefix = one_only ? ".gnu.linkonce.t." : ".text.";
5145 case SECCAT_RODATA_MERGE_STR:
5146 case SECCAT_RODATA_MERGE_STR_INIT:
5147 case SECCAT_RODATA_MERGE_CONST:
5148 prefix = one_only ? ".gnu.linkonce.r." : ".rodata.";
5150 case SECCAT_SRODATA:
5151 prefix = one_only ? ".gnu.linkonce.s2." : ".sdata2.";
5154 case SECCAT_DATA_REL:
5155 case SECCAT_DATA_REL_LOCAL:
5156 case SECCAT_DATA_REL_RO:
5157 case SECCAT_DATA_REL_RO_LOCAL:
5158 prefix = one_only ? ".gnu.linkonce.d." : ".data.";
5161 prefix = one_only ? ".gnu.linkonce.s." : ".sdata.";
5164 prefix = one_only ? ".gnu.linkonce.b." : ".bss.";
5167 prefix = one_only ? ".gnu.linkonce.sb." : ".sbss.";
5170 prefix = one_only ? ".gnu.linkonce.td." : ".tdata.";
5173 prefix = one_only ? ".gnu.linkonce.tb." : ".tbss.";
5178 plen = strlen (prefix);
5180 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
5181 name = targetm.strip_name_encoding (name);
5182 nlen = strlen (name);
5184 string = alloca (nlen + plen + 1);
5185 memcpy (string, prefix, plen);
5186 memcpy (string + plen, name, nlen + 1);
5188 DECL_SECTION_NAME (decl) = build_string (nlen + plen, string);
5192 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED,
5194 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED)
5197 switch (GET_CODE (x))
5209 readonly_data_section ();
5213 default_elf_select_rtx_section (enum machine_mode mode, rtx x,
5214 unsigned HOST_WIDE_INT align)
5216 /* ??? Handle small data here somehow. */
5219 switch (GET_CODE (x))
5223 named_section (NULL_TREE, ".data.rel.ro", 3);
5227 named_section (NULL_TREE, ".data.rel.ro.local", 1);
5234 mergeable_constant_section (mode, align, 0);
5237 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
5240 default_encode_section_info (tree decl, rtx rtl, int first ATTRIBUTE_UNUSED)
5245 /* Careful not to prod global register variables. */
5248 symbol = XEXP (rtl, 0);
5249 if (GET_CODE (symbol) != SYMBOL_REF)
5253 if (TREE_CODE (decl) == FUNCTION_DECL)
5254 flags |= SYMBOL_FLAG_FUNCTION;
5255 if (targetm.binds_local_p (decl))
5256 flags |= SYMBOL_FLAG_LOCAL;
5257 if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
5258 flags |= decl_tls_model (decl) << SYMBOL_FLAG_TLS_SHIFT;
5259 else if (targetm.in_small_data_p (decl))
5260 flags |= SYMBOL_FLAG_SMALL;
5261 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
5262 being PUBLIC, the thing *must* be defined in this translation unit.
5263 Prevent this buglet from being propagated into rtl code as well. */
5264 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
5265 flags |= SYMBOL_FLAG_EXTERNAL;
5267 SYMBOL_REF_FLAGS (symbol) = flags;
5270 /* By default, we do nothing for encode_section_info, so we need not
5271 do anything but discard the '*' marker. */
5274 default_strip_name_encoding (const char *str)
5276 return str + (*str == '*');
5279 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5280 wrt cross-module name binding. */
5283 default_binds_local_p (tree exp)
5285 return default_binds_local_p_1 (exp, flag_shlib);
5289 default_binds_local_p_1 (tree exp, int shlib)
5293 /* A non-decl is an entry in the constant pool. */
5296 /* Static variables are always local. */
5297 else if (! TREE_PUBLIC (exp))
5299 /* A variable is local if the user explicitly tells us so. */
5300 else if (DECL_VISIBILITY_SPECIFIED (exp) && DECL_VISIBILITY (exp) != VISIBILITY_DEFAULT)
5302 /* Otherwise, variables defined outside this object may not be local. */
5303 else if (DECL_EXTERNAL (exp))
5305 /* Linkonce and weak data are never local. */
5306 else if (DECL_ONE_ONLY (exp) || DECL_WEAK (exp))
5308 /* If none of the above and visibility is not default, make local. */
5309 else if (DECL_VISIBILITY (exp) != VISIBILITY_DEFAULT)
5311 /* If PIC, then assume that any global name can be overridden by
5312 symbols resolved from other modules. */
5315 /* Uninitialized COMMON variable may be unified with symbols
5316 resolved from other modules. */
5317 else if (DECL_COMMON (exp)
5318 && (DECL_INITIAL (exp) == NULL
5319 || DECL_INITIAL (exp) == error_mark_node))
5321 /* Otherwise we're left with initialized (or non-common) global data
5322 which is of necessity defined locally. */
5329 /* Determine whether or not a pointer mode is valid. Assume defaults
5330 of ptr_mode or Pmode - can be overridden. */
5332 default_valid_pointer_mode (enum machine_mode mode)
5334 return (mode == ptr_mode || mode == Pmode);
5337 /* Default function to output code that will globalize a label. A
5338 target must define GLOBAL_ASM_OP or provide it's own function to
5339 globalize a label. */
5340 #ifdef GLOBAL_ASM_OP
5342 default_globalize_label (FILE * stream, const char *name)
5344 fputs (GLOBAL_ASM_OP, stream);
5345 assemble_name (stream, name);
5346 putc ('\n', stream);
5348 #endif /* GLOBAL_ASM_OP */
5350 /* Default function to output a label for unwind information. The
5351 default is to do nothing. A target that needs nonlocal labels for
5352 unwind information must provide its own function to do this. */
5354 default_emit_unwind_label (FILE * stream ATTRIBUTE_UNUSED,
5355 tree decl ATTRIBUTE_UNUSED,
5356 int for_eh ATTRIBUTE_UNUSED,
5357 int empty ATTRIBUTE_UNUSED)
5361 /* This is how to output an internal numbered label where PREFIX is
5362 the class of label and LABELNO is the number within the class. */
5365 default_internal_label (FILE *stream, const char *prefix,
5366 unsigned long labelno)
5368 char *const buf = alloca (40 + strlen (prefix));
5369 ASM_GENERATE_INTERNAL_LABEL (buf, prefix, labelno);
5370 ASM_OUTPUT_INTERNAL_LABEL (stream, buf);
5373 /* This is the default behavior at the beginning of a file. It's
5374 controlled by two other target-hook toggles. */
5376 default_file_start (void)
5378 if (targetm.file_start_app_off && !flag_verbose_asm)
5379 fputs (ASM_APP_OFF, asm_out_file);
5381 if (targetm.file_start_file_directive)
5382 output_file_directive (asm_out_file, main_input_filename);
5385 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5386 which emits a special section directive used to indicate whether or
5387 not this object file needs an executable stack. This is primarily
5388 a GNU extension to ELF but could be used on other targets. */
5390 int trampolines_created;
5393 file_end_indicate_exec_stack (void)
5395 unsigned int flags = SECTION_DEBUG;
5396 if (trampolines_created)
5397 flags |= SECTION_CODE;
5399 named_section_flags (".note.GNU-stack", flags);
5402 #include "gt-varasm.h"