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 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
32 #include "coretypes.h"
39 #include "hard-reg-set.h"
47 #include "langhooks.h"
51 #include "tree-mudflap.h"
53 #include "cfglayout.h"
55 #ifdef XCOFF_DEBUGGING_INFO
56 #include "xcoffout.h" /* Needed for external data
57 declarations for e.g. AIX 4.x. */
60 /* The (assembler) name of the first globally-visible object output. */
61 const char *first_global_object_name;
62 const char *weak_global_object_name;
65 struct constant_descriptor_rtx;
66 struct rtx_constant_pool;
68 struct varasm_status GTY(())
70 /* If we're using a per-function constant pool, this is it. */
71 struct rtx_constant_pool *pool;
73 /* Number of tree-constants deferred during the expansion of this
75 unsigned int deferred_constants;
78 #define n_deferred_constants (cfun->varasm->deferred_constants)
80 /* Number for making the label on the next
81 constant that is stored in memory. */
83 static GTY(()) int const_labelno;
85 /* Carry information from ASM_DECLARE_OBJECT_NAME
86 to ASM_FINISH_DECLARE_OBJECT. */
88 int size_directive_output;
90 /* The last decl for which assemble_variable was called,
91 if it did ASM_DECLARE_OBJECT_NAME.
92 If the last call to assemble_variable didn't do that,
95 tree last_assemble_variable_decl;
97 /* The following global variable indicates if the section label for the
98 "cold" section of code has been output yet to the assembler. The
99 label is useful when running gdb. This is part of the optimization that
100 partitions hot and cold basic blocks into separate sections of the .o
103 static bool unlikely_section_label_printed = false;
105 /* The following global variable indicates the label name to be put at
106 the start of the first cold section within each function, when
107 partitioning basic blocks into hot and cold sections. */
109 static char *unlikely_section_label = NULL;
111 /* The following global variable indicates the section name to be used
112 for the current cold section, when partitioning hot and cold basic
113 blocks into separate sections. */
115 static char *unlikely_text_section_name = NULL;
117 /* We give all constants their own alias set. Perhaps redundant with
118 MEM_READONLY_P, but pre-dates it. */
120 static HOST_WIDE_INT const_alias_set;
122 static const char *strip_reg_name (const char *);
123 static int contains_pointers_p (tree);
124 #ifdef ASM_OUTPUT_EXTERNAL
125 static bool incorporeal_function_p (tree);
127 static void decode_addr_const (tree, struct addr_const *);
128 static hashval_t const_desc_hash (const void *);
129 static int const_desc_eq (const void *, const void *);
130 static hashval_t const_hash_1 (const tree);
131 static int compare_constant (const tree, const tree);
132 static tree copy_constant (tree);
133 static void output_constant_def_contents (rtx);
134 static void output_addressed_constants (tree);
135 static unsigned HOST_WIDE_INT array_size_for_constructor (tree);
136 static unsigned min_align (unsigned, unsigned);
137 static void output_constructor (tree, unsigned HOST_WIDE_INT, unsigned int);
138 static void globalize_decl (tree);
139 static void maybe_assemble_visibility (tree);
140 static int in_named_entry_eq (const void *, const void *);
141 static hashval_t in_named_entry_hash (const void *);
142 #ifdef BSS_SECTION_ASM_OP
143 #ifdef ASM_OUTPUT_BSS
144 static void asm_output_bss (FILE *, tree, const char *,
145 unsigned HOST_WIDE_INT, unsigned HOST_WIDE_INT);
147 #ifdef ASM_OUTPUT_ALIGNED_BSS
148 static void asm_output_aligned_bss (FILE *, tree, const char *,
149 unsigned HOST_WIDE_INT, int)
152 #endif /* BSS_SECTION_ASM_OP */
153 static bool asm_emit_uninitialised (tree, const char*,
154 unsigned HOST_WIDE_INT,
155 unsigned HOST_WIDE_INT);
156 static void mark_weak (tree);
158 enum in_section { no_section, in_text, in_unlikely_executed_text, in_data,
160 #ifdef BSS_SECTION_ASM_OP
163 #ifdef CTORS_SECTION_ASM_OP
166 #ifdef DTORS_SECTION_ASM_OP
169 #ifdef READONLY_DATA_SECTION_ASM_OP
172 #ifdef EXTRA_SECTIONS
176 static GTY(()) enum in_section in_section = no_section;
178 /* Return a nonzero value if DECL has a section attribute. */
179 #ifndef IN_NAMED_SECTION
180 #define IN_NAMED_SECTION(DECL) \
181 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
182 && DECL_SECTION_NAME (DECL) != NULL_TREE)
185 /* Text of section name when in_section == in_named. */
186 static GTY(()) const char *in_named_name;
188 /* Hash table of flags that have been used for a particular named section. */
190 struct in_named_entry GTY(())
197 static GTY((param_is (struct in_named_entry))) htab_t in_named_htab;
199 /* Define functions like text_section for any extra sections. */
200 #ifdef EXTRA_SECTION_FUNCTIONS
201 EXTRA_SECTION_FUNCTIONS
204 /* Tell assembler to switch to text section. */
209 if (in_section != in_text)
211 in_section = in_text;
212 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
216 /* Tell assembler to switch to unlikely-to-be-executed text section. */
219 unlikely_text_section (void)
224 if (! unlikely_text_section_name)
226 if (DECL_SECTION_NAME (current_function_decl)
227 && (strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME
228 (current_function_decl)),
229 HOT_TEXT_SECTION_NAME) != 0)
230 && (strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME
231 (current_function_decl)),
232 UNLIKELY_EXECUTED_TEXT_SECTION_NAME) != 0))
234 name = TREE_STRING_POINTER (DECL_SECTION_NAME
235 (current_function_decl));
237 unlikely_text_section_name = xmalloc ((len + 10) * sizeof (char));
238 strcpy (unlikely_text_section_name, name);
239 strcat (unlikely_text_section_name, "_unlikely");
243 len = strlen (UNLIKELY_EXECUTED_TEXT_SECTION_NAME);
244 unlikely_text_section_name = xmalloc (len+1 * sizeof (char));
245 strcpy (unlikely_text_section_name,
246 UNLIKELY_EXECUTED_TEXT_SECTION_NAME);
250 if ((in_section != in_unlikely_executed_text)
251 && (in_section != in_named
252 || strcmp (in_named_name, unlikely_text_section_name) != 0))
254 named_section (NULL_TREE, unlikely_text_section_name, 0);
255 in_section = in_unlikely_executed_text;
257 if (!unlikely_section_label_printed)
259 ASM_OUTPUT_LABEL (asm_out_file, unlikely_section_label);
260 unlikely_section_label_printed = true;
265 /* Tell assembler to switch to data section. */
270 if (in_section != in_data)
272 in_section = in_data;
273 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
277 /* Tell assembler to switch to read-only data section. This is normally
281 readonly_data_section (void)
283 #ifdef READONLY_DATA_SECTION
284 READONLY_DATA_SECTION (); /* Note this can call data_section. */
286 #ifdef READONLY_DATA_SECTION_ASM_OP
287 if (in_section != in_readonly_data)
289 in_section = in_readonly_data;
290 fputs (READONLY_DATA_SECTION_ASM_OP, asm_out_file);
291 fputc ('\n', asm_out_file);
299 /* Determine if we're in the text section. */
302 in_text_section (void)
304 return in_section == in_text;
307 /* Determine if we're in the unlikely-to-be-executed text section. */
310 in_unlikely_text_section (void)
314 ret_val = ((in_section == in_unlikely_executed_text)
315 || (in_section == in_named
316 && unlikely_text_section_name
317 && strcmp (in_named_name, unlikely_text_section_name) == 0));
322 /* Determine if we're in the data section. */
325 in_data_section (void)
327 return in_section == in_data;
330 /* Helper routines for maintaining in_named_htab. */
333 in_named_entry_eq (const void *p1, const void *p2)
335 const struct in_named_entry *old = p1;
336 const char *new = p2;
338 return strcmp (old->name, new) == 0;
342 in_named_entry_hash (const void *p)
344 const struct in_named_entry *old = p;
345 return htab_hash_string (old->name);
348 /* If SECTION has been seen before as a named section, return the flags
349 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
350 set of flags for a section to have, so 0 does not mean that the section
351 has not been seen. */
354 get_named_section_flags (const char *section)
356 struct in_named_entry **slot;
358 slot = (struct in_named_entry **)
359 htab_find_slot_with_hash (in_named_htab, section,
360 htab_hash_string (section), NO_INSERT);
362 return slot ? (*slot)->flags : 0;
365 /* Returns true if the section has been declared before. Sets internal
366 flag on this section in in_named_hash so subsequent calls on this
367 section will return false. */
370 named_section_first_declaration (const char *name)
372 struct in_named_entry **slot;
374 slot = (struct in_named_entry **)
375 htab_find_slot_with_hash (in_named_htab, name,
376 htab_hash_string (name), NO_INSERT);
377 if (! (*slot)->declared)
379 (*slot)->declared = true;
389 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
390 different set of flags, return false. */
393 set_named_section_flags (const char *section, unsigned int flags)
395 struct in_named_entry **slot, *entry;
397 slot = (struct in_named_entry **)
398 htab_find_slot_with_hash (in_named_htab, section,
399 htab_hash_string (section), INSERT);
404 entry = ggc_alloc (sizeof (*entry));
406 entry->name = ggc_strdup (section);
407 entry->flags = flags;
408 entry->declared = false;
410 else if (entry->flags != flags)
416 /* Tell assembler to change to section NAME with attributes FLAGS. If
417 DECL is non-NULL, it is the VAR_DECL or FUNCTION_DECL with which
418 this section is associated. */
421 named_section_real (const char *name, unsigned int flags, tree decl)
423 if (in_section != in_named || strcmp (name, in_named_name) != 0)
425 if (! set_named_section_flags (name, flags))
428 targetm.asm_out.named_section (name, flags, decl);
430 if (flags & SECTION_FORGET)
431 in_section = no_section;
434 in_named_name = ggc_strdup (name);
435 in_section = in_named;
440 /* Tell assembler to change to section NAME for DECL.
441 If DECL is NULL, just switch to section NAME.
442 If NAME is NULL, get the name from DECL.
443 If RELOC is 1, the initializer for DECL contains relocs. */
446 named_section (tree decl, const char *name, int reloc)
450 if (decl != NULL_TREE && !DECL_P (decl))
453 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
455 if (strcmp (name, UNLIKELY_EXECUTED_TEXT_SECTION_NAME) == 0
456 && !unlikely_text_section_name)
458 unlikely_text_section_name = xmalloc
459 (strlen (UNLIKELY_EXECUTED_TEXT_SECTION_NAME) + 1
461 strcpy (unlikely_text_section_name,
462 UNLIKELY_EXECUTED_TEXT_SECTION_NAME);
465 flags = targetm.section_type_flags (decl, name, reloc);
467 /* Sanity check user variables for flag changes. Non-user
468 section flag changes will abort in named_section_flags.
469 However, don't complain if SECTION_OVERRIDE is set.
470 We trust that the setter knows that it is safe to ignore
471 the default flags for this decl. */
472 if (decl && ! set_named_section_flags (name, flags))
474 flags = get_named_section_flags (name);
475 if ((flags & SECTION_OVERRIDE) == 0)
476 error ("%J%D causes a section type conflict", decl, decl);
479 named_section_real (name, flags, decl);
482 /* If required, set DECL_SECTION_NAME to a unique name. */
485 resolve_unique_section (tree decl, int reloc ATTRIBUTE_UNUSED,
486 int flag_function_or_data_sections)
488 if (DECL_SECTION_NAME (decl) == NULL_TREE
489 && targetm.have_named_sections
490 && (flag_function_or_data_sections
491 || DECL_ONE_ONLY (decl)))
492 targetm.asm_out.unique_section (decl, reloc);
495 #ifdef BSS_SECTION_ASM_OP
497 /* Tell the assembler to switch to the bss section. */
502 if (in_section != in_bss)
504 fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP);
509 #ifdef ASM_OUTPUT_BSS
511 /* Utility function for ASM_OUTPUT_BSS for targets to use if
512 they don't support alignments in .bss.
513 ??? It is believed that this function will work in most cases so such
514 support is localized here. */
517 asm_output_bss (FILE *file, tree decl ATTRIBUTE_UNUSED,
519 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
520 unsigned HOST_WIDE_INT rounded)
522 targetm.asm_out.globalize_label (file, name);
524 #ifdef ASM_DECLARE_OBJECT_NAME
525 last_assemble_variable_decl = decl;
526 ASM_DECLARE_OBJECT_NAME (file, name, decl);
528 /* Standard thing is just output label for the object. */
529 ASM_OUTPUT_LABEL (file, name);
530 #endif /* ASM_DECLARE_OBJECT_NAME */
531 ASM_OUTPUT_SKIP (file, rounded ? rounded : 1);
536 #ifdef ASM_OUTPUT_ALIGNED_BSS
538 /* Utility function for targets to use in implementing
539 ASM_OUTPUT_ALIGNED_BSS.
540 ??? It is believed that this function will work in most cases so such
541 support is localized here. */
544 asm_output_aligned_bss (FILE *file, tree decl ATTRIBUTE_UNUSED,
545 const char *name, unsigned HOST_WIDE_INT size,
549 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
550 #ifdef ASM_DECLARE_OBJECT_NAME
551 last_assemble_variable_decl = decl;
552 ASM_DECLARE_OBJECT_NAME (file, name, decl);
554 /* Standard thing is just output label for the object. */
555 ASM_OUTPUT_LABEL (file, name);
556 #endif /* ASM_DECLARE_OBJECT_NAME */
557 ASM_OUTPUT_SKIP (file, size ? size : 1);
562 #endif /* BSS_SECTION_ASM_OP */
564 /* Switch to the section for function DECL.
566 If DECL is NULL_TREE, switch to the text section. We can be passed
567 NULL_TREE under some circumstances by dbxout.c at least. */
570 function_section (tree decl)
572 if (decl == NULL_TREE)
576 /* ??? Typical use of this function maybe shouldn't be looking
577 for unlikely blocks at all - in the event that an entire
578 function is going into the unlikely-execute section, that
579 should be reflected in its DECL_SECTION_NAME. */
580 rtx insns = cfun && cfun->emit ? get_insns () : 0;
581 bool unlikely = insns && scan_ahead_for_unlikely_executed_note (insns);
583 #ifdef USE_SELECT_SECTION_FOR_FUNCTIONS
584 targetm.asm_out.select_section (decl, unlikely, DECL_ALIGN (decl));
587 unlikely_text_section ();
588 else if (DECL_SECTION_NAME (decl))
589 named_section (decl, 0, 0);
596 /* Switch to read-only data section associated with function DECL. */
599 default_function_rodata_section (tree decl)
601 if (decl != NULL_TREE && DECL_SECTION_NAME (decl))
603 const char *name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
605 /* For .gnu.linkonce.t.foo we want to use .gnu.linkonce.r.foo. */
606 if (DECL_ONE_ONLY (decl) && strncmp (name, ".gnu.linkonce.t.", 16) == 0)
608 size_t len = strlen (name) + 1;
609 char *rname = alloca (len);
611 memcpy (rname, name, len);
613 named_section_real (rname, SECTION_LINKONCE, decl);
616 /* For .text.foo we want to use .rodata.foo. */
617 else if (flag_function_sections && flag_data_sections
618 && strncmp (name, ".text.", 6) == 0)
620 size_t len = strlen (name) + 1;
621 char *rname = alloca (len + 2);
623 memcpy (rname, ".rodata", 7);
624 memcpy (rname + 7, name + 5, len - 5);
625 named_section_flags (rname, 0);
630 readonly_data_section ();
633 /* Switch to read-only data section associated with function DECL
634 for targets where that section should be always the single
635 readonly data section. */
638 default_no_function_rodata_section (tree decl ATTRIBUTE_UNUSED)
640 readonly_data_section ();
643 /* Switch to section for variable DECL. RELOC is the same as the
644 argument to SELECT_SECTION. */
647 variable_section (tree decl, int reloc)
649 if (IN_NAMED_SECTION (decl))
650 named_section (decl, NULL, reloc);
652 targetm.asm_out.select_section (decl, reloc, DECL_ALIGN (decl));
655 /* Tell assembler to switch to the section for string merging. */
658 mergeable_string_section (tree decl ATTRIBUTE_UNUSED,
659 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED,
660 unsigned int flags ATTRIBUTE_UNUSED)
662 if (HAVE_GAS_SHF_MERGE && flag_merge_constants
663 && TREE_CODE (decl) == STRING_CST
664 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
666 && TREE_STRING_LENGTH (decl) >= int_size_in_bytes (TREE_TYPE (decl)))
668 enum machine_mode mode;
669 unsigned int modesize;
674 mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (decl)));
675 modesize = GET_MODE_BITSIZE (mode);
676 if (modesize >= 8 && modesize <= 256
677 && (modesize & (modesize - 1)) == 0)
679 if (align < modesize)
682 str = TREE_STRING_POINTER (decl);
683 len = TREE_STRING_LENGTH (decl);
684 unit = GET_MODE_SIZE (mode);
686 /* Check for embedded NUL characters. */
687 for (i = 0; i < len; i += unit)
689 for (j = 0; j < unit; j++)
690 if (str[i + j] != '\0')
697 sprintf (name, ".rodata.str%d.%d", modesize / 8,
699 flags |= (modesize / 8) | SECTION_MERGE | SECTION_STRINGS;
700 if (!i && modesize < align)
702 /* A "" string with requested alignment greater than
703 character size might cause a problem:
704 if some other string required even bigger
705 alignment than "", then linker might think the
706 "" is just part of padding after some other string
707 and not put it into the hash table initially.
708 But this means "" could have smaller alignment
710 #ifdef ASM_OUTPUT_SECTION_START
711 named_section_flags (name, flags);
712 ASM_OUTPUT_SECTION_START (asm_out_file);
714 readonly_data_section ();
719 named_section_flags (name, flags);
725 readonly_data_section ();
728 /* Tell assembler to switch to the section for constant merging. */
731 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED,
732 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED,
733 unsigned int flags ATTRIBUTE_UNUSED)
735 unsigned int modesize = GET_MODE_BITSIZE (mode);
737 if (HAVE_GAS_SHF_MERGE && flag_merge_constants
743 && (align & (align - 1)) == 0)
747 sprintf (name, ".rodata.cst%d", (int) (align / 8));
748 flags |= (align / 8) | SECTION_MERGE;
749 named_section_flags (name, flags);
753 readonly_data_section ();
756 /* Given NAME, a putative register name, discard any customary prefixes. */
759 strip_reg_name (const char *name)
761 #ifdef REGISTER_PREFIX
762 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
763 name += strlen (REGISTER_PREFIX);
765 if (name[0] == '%' || name[0] == '#')
770 /* The user has asked for a DECL to have a particular name. Set (or
771 change) it in such a way that we don't prefix an underscore to
774 set_user_assembler_name (tree decl, const char *name)
776 char *starred = alloca (strlen (name) + 2);
778 strcpy (starred + 1, name);
779 change_decl_assembler_name (decl, get_identifier (starred));
780 SET_DECL_RTL (decl, NULL_RTX);
783 /* Decode an `asm' spec for a declaration as a register name.
784 Return the register number, or -1 if nothing specified,
785 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
786 or -3 if ASMSPEC is `cc' and is not recognized,
787 or -4 if ASMSPEC is `memory' and is not recognized.
788 Accept an exact spelling or a decimal number.
789 Prefixes such as % are optional. */
792 decode_reg_name (const char *asmspec)
798 /* Get rid of confusing prefixes. */
799 asmspec = strip_reg_name (asmspec);
801 /* Allow a decimal number as a "register name". */
802 for (i = strlen (asmspec) - 1; i >= 0; i--)
803 if (! ISDIGIT (asmspec[i]))
805 if (asmspec[0] != 0 && i < 0)
808 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
814 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
816 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
819 #ifdef ADDITIONAL_REGISTER_NAMES
821 static const struct { const char *const name; const int number; } table[]
822 = ADDITIONAL_REGISTER_NAMES;
824 for (i = 0; i < (int) ARRAY_SIZE (table); i++)
825 if (! strcmp (asmspec, table[i].name))
826 return table[i].number;
828 #endif /* ADDITIONAL_REGISTER_NAMES */
830 if (!strcmp (asmspec, "memory"))
833 if (!strcmp (asmspec, "cc"))
842 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
843 have static storage duration. In other words, it should not be an
844 automatic variable, including PARM_DECLs.
846 There is, however, one exception: this function handles variables
847 explicitly placed in a particular register by the user.
849 This is never called for PARM_DECL nodes. */
852 make_decl_rtl (tree decl)
854 const char *name = 0;
858 /* Check that we are not being given an automatic variable. */
859 /* A weak alias has TREE_PUBLIC set but not the other bits. */
860 if (TREE_CODE (decl) == PARM_DECL
861 || TREE_CODE (decl) == RESULT_DECL
862 || (TREE_CODE (decl) == VAR_DECL
863 && !TREE_STATIC (decl)
864 && !TREE_PUBLIC (decl)
865 && !DECL_EXTERNAL (decl)
866 && !DECL_REGISTER (decl)))
868 /* And that we were not given a type or a label. */
869 else if (TREE_CODE (decl) == TYPE_DECL
870 || TREE_CODE (decl) == LABEL_DECL)
873 /* For a duplicate declaration, we can be called twice on the
874 same DECL node. Don't discard the RTL already made. */
875 if (DECL_RTL_SET_P (decl))
877 /* If the old RTL had the wrong mode, fix the mode. */
878 if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
879 SET_DECL_RTL (decl, adjust_address_nv (DECL_RTL (decl),
880 DECL_MODE (decl), 0));
882 if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
885 /* ??? Another way to do this would be to maintain a hashed
886 table of such critters. Instead of adding stuff to a DECL
887 to give certain attributes to it, we could use an external
888 hash map from DECL to set of attributes. */
890 /* Let the target reassign the RTL if it wants.
891 This is necessary, for example, when one machine specific
892 decl attribute overrides another. */
893 targetm.encode_section_info (decl, DECL_RTL (decl), false);
895 /* Make this function static known to the mudflap runtime. */
896 if (flag_mudflap && TREE_CODE (decl) == VAR_DECL)
897 mudflap_enqueue_decl (decl);
902 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 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name);
949 nregs = hard_regno_nregs[reg_number][DECL_MODE (decl)];
951 globalize_reg (reg_number + --nregs);
954 /* As a register variable, it has no section. */
958 /* Now handle ordinary static variables and functions (in memory).
959 Also handle vars declared register invalidly. */
960 else if (name[0] == '*')
962 #ifdef REGISTER_PREFIX
963 if (strlen (REGISTER_PREFIX) != 0)
965 reg_number = decode_reg_name (name);
966 if (reg_number >= 0 || reg_number == -3)
967 error ("%Jregister name given for non-register variable %qD", decl, decl);
972 /* Specifying a section attribute on a variable forces it into a
973 non-.bss section, and thus it cannot be common. */
974 if (TREE_CODE (decl) == VAR_DECL
975 && DECL_SECTION_NAME (decl) != NULL_TREE
976 && DECL_INITIAL (decl) == NULL_TREE
977 && DECL_COMMON (decl))
978 DECL_COMMON (decl) = 0;
980 /* Variables can't be both common and weak. */
981 if (TREE_CODE (decl) == VAR_DECL && DECL_WEAK (decl))
982 DECL_COMMON (decl) = 0;
984 x = gen_rtx_SYMBOL_REF (Pmode, name);
985 SYMBOL_REF_WEAK (x) = DECL_WEAK (decl);
986 SYMBOL_REF_DECL (x) = decl;
988 x = gen_rtx_MEM (DECL_MODE (decl), x);
989 if (TREE_CODE (decl) != FUNCTION_DECL)
990 set_mem_attributes (x, decl, 1);
991 SET_DECL_RTL (decl, x);
993 /* Optionally set flags or add text to the name to record information
994 such as that it is a function name.
995 If the name is changed, the macro ASM_OUTPUT_LABELREF
996 will have to know how to strip this information. */
997 targetm.encode_section_info (decl, DECL_RTL (decl), true);
999 /* Make this function static known to the mudflap runtime. */
1000 if (flag_mudflap && TREE_CODE (decl) == VAR_DECL)
1001 mudflap_enqueue_decl (decl);
1004 /* Make the rtl for variable VAR be volatile.
1005 Use this only for static variables. */
1008 make_var_volatile (tree var)
1010 if (!MEM_P (DECL_RTL (var)))
1013 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
1016 /* Output a string of literal assembler code
1017 for an `asm' keyword used between functions. */
1020 assemble_asm (tree string)
1024 if (TREE_CODE (string) == ADDR_EXPR)
1025 string = TREE_OPERAND (string, 0);
1027 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
1030 /* Record an element in the table of global destructors. SYMBOL is
1031 a SYMBOL_REF of the function to be called; PRIORITY is a number
1032 between 0 and MAX_INIT_PRIORITY. */
1035 default_stabs_asm_out_destructor (rtx symbol ATTRIBUTE_UNUSED,
1036 int priority ATTRIBUTE_UNUSED)
1038 #if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO
1039 /* Tell GNU LD that this is part of the static destructor set.
1040 This will work for any system that uses stabs, most usefully
1042 dbxout_begin_simple_stabs ("___DTOR_LIST__", 22 /* N_SETT */);
1043 dbxout_stab_value_label (XSTR (symbol, 0));
1045 sorry ("global destructors not supported on this target");
1050 default_named_section_asm_out_destructor (rtx symbol, int priority)
1052 const char *section = ".dtors";
1055 /* ??? This only works reliably with the GNU linker. */
1056 if (priority != DEFAULT_INIT_PRIORITY)
1058 sprintf (buf, ".dtors.%.5u",
1059 /* Invert the numbering so the linker puts us in the proper
1060 order; constructors are run from right to left, and the
1061 linker sorts in increasing order. */
1062 MAX_INIT_PRIORITY - priority);
1066 named_section_flags (section, SECTION_WRITE);
1067 assemble_align (POINTER_SIZE);
1068 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1071 #ifdef DTORS_SECTION_ASM_OP
1073 dtors_section (void)
1075 if (in_section != in_dtors)
1077 in_section = in_dtors;
1078 fputs (DTORS_SECTION_ASM_OP, asm_out_file);
1079 fputc ('\n', asm_out_file);
1084 default_dtor_section_asm_out_destructor (rtx symbol,
1085 int priority ATTRIBUTE_UNUSED)
1088 assemble_align (POINTER_SIZE);
1089 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1093 /* Likewise for global constructors. */
1096 default_stabs_asm_out_constructor (rtx symbol ATTRIBUTE_UNUSED,
1097 int priority ATTRIBUTE_UNUSED)
1099 #if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO
1100 /* Tell GNU LD that this is part of the static destructor set.
1101 This will work for any system that uses stabs, most usefully
1103 dbxout_begin_simple_stabs ("___CTOR_LIST__", 22 /* N_SETT */);
1104 dbxout_stab_value_label (XSTR (symbol, 0));
1106 sorry ("global constructors not supported on this target");
1111 default_named_section_asm_out_constructor (rtx symbol, int priority)
1113 const char *section = ".ctors";
1116 /* ??? This only works reliably with the GNU linker. */
1117 if (priority != DEFAULT_INIT_PRIORITY)
1119 sprintf (buf, ".ctors.%.5u",
1120 /* Invert the numbering so the linker puts us in the proper
1121 order; constructors are run from right to left, and the
1122 linker sorts in increasing order. */
1123 MAX_INIT_PRIORITY - priority);
1127 named_section_flags (section, SECTION_WRITE);
1128 assemble_align (POINTER_SIZE);
1129 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1132 #ifdef CTORS_SECTION_ASM_OP
1134 ctors_section (void)
1136 if (in_section != in_ctors)
1138 in_section = in_ctors;
1139 fputs (CTORS_SECTION_ASM_OP, asm_out_file);
1140 fputc ('\n', asm_out_file);
1145 default_ctor_section_asm_out_constructor (rtx symbol,
1146 int priority ATTRIBUTE_UNUSED)
1149 assemble_align (POINTER_SIZE);
1150 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1154 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1155 a nonzero value if the constant pool should be output before the
1156 start of the function, or a zero value if the pool should output
1157 after the end of the function. The default is to put it before the
1160 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1161 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1164 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
1165 to be output to assembler.
1166 Set first_global_object_name and weak_global_object_name as appropriate. */
1169 notice_global_symbol (tree decl)
1171 const char **type = &first_global_object_name;
1173 if (first_global_object_name
1174 || !TREE_PUBLIC (decl) || DECL_EXTERNAL (decl)
1175 || !DECL_NAME (decl)
1176 || (TREE_CODE (decl) != FUNCTION_DECL
1177 && (TREE_CODE (decl) != VAR_DECL
1178 || (DECL_COMMON (decl)
1179 && (DECL_INITIAL (decl) == 0
1180 || DECL_INITIAL (decl) == error_mark_node))))
1181 || !MEM_P (DECL_RTL (decl)))
1184 /* We win when global object is found, but it is useful to know about weak
1185 symbol as well so we can produce nicer unique names. */
1186 if (DECL_WEAK (decl) || DECL_ONE_ONLY (decl))
1187 type = &weak_global_object_name;
1193 rtx decl_rtl = DECL_RTL (decl);
1195 p = targetm.strip_name_encoding (XSTR (XEXP (decl_rtl, 0), 0));
1202 /* Output assembler code for the constant pool of a function and associated
1203 with defining the name of the function. DECL describes the function.
1204 NAME is the function's name. For the constant pool, we use the current
1205 constant pool data. */
1208 assemble_start_function (tree decl, const char *fnname)
1212 if (unlikely_text_section_name)
1213 free (unlikely_text_section_name);
1215 unlikely_section_label_printed = false;
1216 unlikely_text_section_name = NULL;
1218 unlikely_section_label = reconcat (unlikely_section_label,
1219 fnname, ".unlikely_section", NULL);
1221 /* The following code does not need preprocessing in the assembler. */
1225 if (CONSTANT_POOL_BEFORE_FUNCTION)
1226 output_constant_pool (fnname, decl);
1228 /* Make sure the cold text (code) section is properly aligned. This
1229 is necessary here in the case where the function has both hot and
1230 cold sections, because we don't want to re-set the alignment when the
1231 section switch happens mid-function. We don't need to set the hot
1232 section alignment here, because code further down in this function
1233 sets the alignment for whichever section comes first, and if there
1234 is a hot section it is guaranteed to be first. */
1236 if (flag_reorder_blocks_and_partition)
1238 unlikely_text_section ();
1239 assemble_align (FUNCTION_BOUNDARY);
1242 resolve_unique_section (decl, 0, flag_function_sections);
1243 function_section (decl);
1245 /* Tell assembler to move to target machine's alignment for functions. */
1246 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1247 if (align < force_align_functions_log)
1248 align = force_align_functions_log;
1251 ASM_OUTPUT_ALIGN (asm_out_file, align);
1254 /* Handle a user-specified function alignment.
1255 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1256 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1257 if (align_functions_log > align
1258 && cfun->function_frequency != FUNCTION_FREQUENCY_UNLIKELY_EXECUTED)
1260 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1261 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file,
1262 align_functions_log, align_functions - 1);
1264 ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
1268 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1269 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
1272 (*debug_hooks->begin_function) (decl);
1274 /* Make function name accessible from other files, if appropriate. */
1276 if (TREE_PUBLIC (decl))
1278 notice_global_symbol (decl);
1280 globalize_decl (decl);
1282 maybe_assemble_visibility (decl);
1285 if (DECL_PRESERVE_P (decl))
1286 targetm.asm_out.mark_decl_preserved (fnname);
1288 /* Do any machine/system dependent processing of the function name. */
1289 #ifdef ASM_DECLARE_FUNCTION_NAME
1290 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
1292 /* Standard thing is just output label for the function. */
1293 ASM_OUTPUT_LABEL (asm_out_file, fnname);
1294 #endif /* ASM_DECLARE_FUNCTION_NAME */
1296 if (in_unlikely_text_section ()
1297 && !unlikely_section_label_printed)
1299 ASM_OUTPUT_LABEL (asm_out_file, unlikely_section_label);
1300 unlikely_section_label_printed = true;
1304 /* Output assembler code associated with defining the size of the
1305 function. DECL describes the function. NAME is the function's name. */
1308 assemble_end_function (tree decl, const char *fnname)
1310 #ifdef ASM_DECLARE_FUNCTION_SIZE
1311 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1313 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1315 output_constant_pool (fnname, decl);
1316 function_section (decl); /* need to switch back */
1320 /* Assemble code to leave SIZE bytes of zeros. */
1323 assemble_zeros (unsigned HOST_WIDE_INT size)
1325 /* Do no output if -fsyntax-only. */
1326 if (flag_syntax_only)
1329 #ifdef ASM_NO_SKIP_IN_TEXT
1330 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1331 so we must output 0s explicitly in the text section. */
1332 if ((ASM_NO_SKIP_IN_TEXT && in_text_section ())
1333 || (ASM_NO_SKIP_IN_TEXT && in_unlikely_text_section ()))
1335 unsigned HOST_WIDE_INT i;
1336 for (i = 0; i < size; i++)
1337 assemble_integer (const0_rtx, 1, BITS_PER_UNIT, 1);
1342 ASM_OUTPUT_SKIP (asm_out_file, size);
1345 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1348 assemble_align (int align)
1350 if (align > BITS_PER_UNIT)
1352 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1356 /* Assemble a string constant with the specified C string as contents. */
1359 assemble_string (const char *p, int size)
1364 /* If the string is very long, split it up. */
1368 int thissize = size - pos;
1369 if (thissize > maximum)
1372 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1380 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1381 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1382 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1384 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1385 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1386 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1388 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1389 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1393 #if defined ASM_OUTPUT_ALIGNED_BSS
1394 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1395 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1397 #if defined ASM_OUTPUT_BSS
1398 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1399 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1405 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1406 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1407 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1409 #if defined ASM_OUTPUT_ALIGNED_COMMON
1410 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1411 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1413 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1414 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1419 asm_emit_uninitialised (tree decl, const char *name,
1420 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
1421 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED)
1429 destination = asm_dest_local;
1431 /* ??? We should handle .bss via select_section mechanisms rather than
1432 via special target hooks. That would eliminate this special case. */
1433 if (TREE_PUBLIC (decl))
1435 if (!DECL_COMMON (decl))
1437 destination = asm_dest_bss;
1442 destination = asm_dest_common;
1445 if (destination != asm_dest_common)
1447 resolve_unique_section (decl, 0, flag_data_sections);
1448 /* Custom sections don't belong here. */
1449 if (DECL_SECTION_NAME (decl))
1453 if (destination == asm_dest_bss)
1454 globalize_decl (decl);
1456 if (flag_shared_data)
1458 switch (destination)
1460 #ifdef ASM_OUTPUT_SHARED_BSS
1462 ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded);
1465 #ifdef ASM_OUTPUT_SHARED_COMMON
1466 case asm_dest_common:
1467 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1470 #ifdef ASM_OUTPUT_SHARED_LOCAL
1471 case asm_dest_local:
1472 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1480 switch (destination)
1484 ASM_EMIT_BSS (decl, name, size, rounded);
1487 case asm_dest_common:
1488 ASM_EMIT_COMMON (decl, name, size, rounded);
1490 case asm_dest_local:
1491 ASM_EMIT_LOCAL (decl, name, size, rounded);
1500 /* Assemble everything that is needed for a variable or function declaration.
1501 Not used for automatic variables, and not used for function definitions.
1502 Should not be called for variables of incomplete structure type.
1504 TOP_LEVEL is nonzero if this variable has file scope.
1505 AT_END is nonzero if this is the special handling, at end of compilation,
1506 to define things that have had only tentative definitions.
1507 DONT_OUTPUT_DATA if nonzero means don't actually output the
1508 initial value (that will be done by the caller). */
1511 assemble_variable (tree decl, int top_level ATTRIBUTE_UNUSED,
1512 int at_end ATTRIBUTE_UNUSED, int dont_output_data)
1519 if (lang_hooks.decls.prepare_assemble_variable)
1520 lang_hooks.decls.prepare_assemble_variable (decl);
1522 last_assemble_variable_decl = 0;
1524 /* Normally no need to say anything here for external references,
1525 since assemble_external is called by the language-specific code
1526 when a declaration is first seen. */
1528 if (DECL_EXTERNAL (decl))
1531 /* Output no assembler code for a function declaration.
1532 Only definitions of functions output anything. */
1534 if (TREE_CODE (decl) == FUNCTION_DECL)
1537 /* Do nothing for global register variables. */
1538 if (DECL_RTL_SET_P (decl) && REG_P (DECL_RTL (decl)))
1540 TREE_ASM_WRITTEN (decl) = 1;
1544 /* If type was incomplete when the variable was declared,
1545 see if it is complete now. */
1547 if (DECL_SIZE (decl) == 0)
1548 layout_decl (decl, 0);
1550 /* Still incomplete => don't allocate it; treat the tentative defn
1551 (which is what it must have been) as an `extern' reference. */
1553 if (!dont_output_data && DECL_SIZE (decl) == 0)
1555 error ("%Jstorage size of %qD isn%'t known", decl, decl);
1556 TREE_ASM_WRITTEN (decl) = 1;
1560 /* The first declaration of a variable that comes through this function
1561 decides whether it is global (in C, has external linkage)
1562 or local (in C, has internal linkage). So do nothing more
1563 if this function has already run. */
1565 if (TREE_ASM_WRITTEN (decl))
1568 /* Make sure targetm.encode_section_info is invoked before we set
1570 decl_rtl = DECL_RTL (decl);
1572 TREE_ASM_WRITTEN (decl) = 1;
1574 /* Do no output if -fsyntax-only. */
1575 if (flag_syntax_only)
1580 if (! dont_output_data
1581 && ! host_integerp (DECL_SIZE_UNIT (decl), 1))
1583 error ("%Jsize of variable %qD is too large", decl, decl);
1587 name = XSTR (XEXP (decl_rtl, 0), 0);
1588 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1589 notice_global_symbol (decl);
1591 /* Compute the alignment of this data. */
1593 align = DECL_ALIGN (decl);
1595 /* In the case for initialing an array whose length isn't specified,
1596 where we have not yet been able to do the layout,
1597 figure out the proper alignment now. */
1598 if (dont_output_data && DECL_SIZE (decl) == 0
1599 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1600 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1602 /* Some object file formats have a maximum alignment which they support.
1603 In particular, a.out format supports a maximum alignment of 4. */
1604 if (align > MAX_OFILE_ALIGNMENT)
1606 warning ("%Jalignment of %qD is greater than maximum object "
1607 "file alignment. Using %d", decl, decl,
1608 MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
1609 align = MAX_OFILE_ALIGNMENT;
1612 /* On some machines, it is good to increase alignment sometimes. */
1613 if (! DECL_USER_ALIGN (decl))
1615 #ifdef DATA_ALIGNMENT
1616 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1618 #ifdef CONSTANT_ALIGNMENT
1619 if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node)
1620 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1624 /* Reset the alignment in case we have made it tighter, so we can benefit
1625 from it in get_pointer_alignment. */
1626 DECL_ALIGN (decl) = align;
1627 set_mem_align (decl_rtl, align);
1629 if (TREE_PUBLIC (decl))
1630 maybe_assemble_visibility (decl);
1632 if (DECL_PRESERVE_P (decl))
1633 targetm.asm_out.mark_decl_preserved (name);
1635 /* Handle uninitialized definitions. */
1637 /* If the decl has been given an explicit section name, then it
1638 isn't common, and shouldn't be handled as such. */
1639 if (DECL_SECTION_NAME (decl) || dont_output_data)
1641 /* We don't implement common thread-local data at present. */
1642 else if (DECL_THREAD_LOCAL (decl))
1644 if (DECL_COMMON (decl))
1645 sorry ("thread-local COMMON data not implemented");
1647 else if (DECL_INITIAL (decl) == 0
1648 || DECL_INITIAL (decl) == error_mark_node
1649 || (flag_zero_initialized_in_bss
1650 /* Leave constant zeroes in .rodata so they can be shared. */
1651 && !TREE_READONLY (decl)
1652 && initializer_zerop (DECL_INITIAL (decl))))
1654 unsigned HOST_WIDE_INT size = tree_low_cst (DECL_SIZE_UNIT (decl), 1);
1655 unsigned HOST_WIDE_INT rounded = size;
1657 /* Don't allocate zero bytes of common,
1658 since that means "undefined external" in the linker. */
1662 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1663 so that each uninitialized object starts on such a boundary. */
1664 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1665 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1666 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1668 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1669 if ((unsigned HOST_WIDE_INT) DECL_ALIGN_UNIT (decl) > rounded)
1670 warning ("%Jrequested alignment for %qD is greater than "
1671 "implemented alignment of %d", decl, decl, rounded);
1674 /* If the target cannot output uninitialized but not common global data
1675 in .bss, then we have to use .data, so fall through. */
1676 if (asm_emit_uninitialised (decl, name, size, rounded))
1680 /* Handle initialized definitions.
1681 Also handle uninitialized global definitions if -fno-common and the
1682 target doesn't support ASM_OUTPUT_BSS. */
1684 /* First make the assembler name(s) global if appropriate. */
1685 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1686 globalize_decl (decl);
1688 /* Output any data that we will need to use the address of. */
1689 if (DECL_INITIAL (decl) == error_mark_node)
1690 reloc = contains_pointers_p (TREE_TYPE (decl)) ? 3 : 0;
1691 else if (DECL_INITIAL (decl))
1693 reloc = compute_reloc_for_constant (DECL_INITIAL (decl));
1694 output_addressed_constants (DECL_INITIAL (decl));
1697 /* Switch to the appropriate section. */
1698 resolve_unique_section (decl, reloc, flag_data_sections);
1699 variable_section (decl, reloc);
1701 /* dbxout.c needs to know this. */
1702 if (in_text_section () || in_unlikely_text_section ())
1703 DECL_IN_TEXT_SECTION (decl) = 1;
1705 /* Output the alignment of this data. */
1706 if (align > BITS_PER_UNIT)
1707 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (DECL_ALIGN_UNIT (decl)));
1709 /* Do any machine/system dependent processing of the object. */
1710 #ifdef ASM_DECLARE_OBJECT_NAME
1711 last_assemble_variable_decl = decl;
1712 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1714 /* Standard thing is just output label for the object. */
1715 ASM_OUTPUT_LABEL (asm_out_file, name);
1716 #endif /* ASM_DECLARE_OBJECT_NAME */
1718 if (!dont_output_data)
1720 if (DECL_INITIAL (decl)
1721 && DECL_INITIAL (decl) != error_mark_node
1722 && !initializer_zerop (DECL_INITIAL (decl)))
1723 /* Output the actual data. */
1724 output_constant (DECL_INITIAL (decl),
1725 tree_low_cst (DECL_SIZE_UNIT (decl), 1),
1728 /* Leave space for it. */
1729 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl), 1));
1733 /* Return 1 if type TYPE contains any pointers. */
1736 contains_pointers_p (tree type)
1738 switch (TREE_CODE (type))
1741 case REFERENCE_TYPE:
1742 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1743 so I'll play safe and return 1. */
1749 case QUAL_UNION_TYPE:
1752 /* For a type that has fields, see if the fields have pointers. */
1753 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1754 if (TREE_CODE (fields) == FIELD_DECL
1755 && contains_pointers_p (TREE_TYPE (fields)))
1761 /* An array type contains pointers if its element type does. */
1762 return contains_pointers_p (TREE_TYPE (type));
1769 /* In unit-at-a-time mode, we delay assemble_external processing until
1770 the compilation unit is finalized. This is the best we can do for
1771 right now (i.e. stage 3 of GCC 4.0) - the right thing is to delay
1772 it all the way to final. See PR 17982 for further discussion. */
1773 static GTY(()) tree pending_assemble_externals;
1775 #ifdef ASM_OUTPUT_EXTERNAL
1776 /* True if DECL is a function decl for which no out-of-line copy exists.
1777 It is assumed that DECL's assembler name has been set. */
1780 incorporeal_function_p (tree decl)
1782 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_BUILT_IN (decl))
1786 if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
1787 && DECL_FUNCTION_CODE (decl) == BUILT_IN_ALLOCA)
1790 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
1791 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
1797 /* Actually do the tests to determine if this is necessary, and invoke
1798 ASM_OUTPUT_EXTERNAL. */
1800 assemble_external_real (tree decl)
1802 rtx rtl = DECL_RTL (decl);
1804 if (MEM_P (rtl) && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1805 && !SYMBOL_REF_USED (XEXP (rtl, 0))
1806 && !incorporeal_function_p (decl))
1808 /* Some systems do require some output. */
1809 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1810 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1816 process_pending_assemble_externals (void)
1818 #ifdef ASM_OUTPUT_EXTERNAL
1820 for (list = pending_assemble_externals; list; list = TREE_CHAIN (list))
1821 assemble_external_real (TREE_VALUE (list));
1823 pending_assemble_externals = 0;
1827 /* Output something to declare an external symbol to the assembler.
1828 (Most assemblers don't need this, so we normally output nothing.)
1829 Do nothing if DECL is not external. */
1832 assemble_external (tree decl ATTRIBUTE_UNUSED)
1834 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1835 main body of this code is only rarely exercised. To provide some
1836 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1837 open. If it's not, we should not be calling this function. */
1838 gcc_assert (asm_out_file);
1840 #ifdef ASM_OUTPUT_EXTERNAL
1841 if (!DECL_P (decl) || !DECL_EXTERNAL (decl) || !TREE_PUBLIC (decl))
1844 if (flag_unit_at_a_time)
1845 pending_assemble_externals = tree_cons (0, decl,
1846 pending_assemble_externals);
1848 assemble_external_real (decl);
1852 /* Similar, for calling a library function FUN. */
1855 assemble_external_libcall (rtx fun)
1857 /* Declare library function name external when first used, if nec. */
1858 if (! SYMBOL_REF_USED (fun))
1860 SYMBOL_REF_USED (fun) = 1;
1861 targetm.asm_out.external_libcall (fun);
1865 /* Assemble a label named NAME. */
1868 assemble_label (const char *name)
1870 ASM_OUTPUT_LABEL (asm_out_file, name);
1873 /* Set the symbol_referenced flag for ID. */
1875 mark_referenced (tree id)
1877 TREE_SYMBOL_REFERENCED (id) = 1;
1880 /* Set the symbol_referenced flag for DECL and notify callgraph. */
1882 mark_decl_referenced (tree decl)
1884 if (TREE_CODE (decl) == FUNCTION_DECL)
1885 cgraph_mark_needed_node (cgraph_node (decl));
1886 else if (TREE_CODE (decl) == VAR_DECL)
1887 cgraph_varpool_mark_needed_node (cgraph_varpool_node (decl));
1888 /* else do nothing - we can get various sorts of CST nodes here,
1889 which do not need to be marked. */
1892 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1893 If NAME starts with a *, the rest of NAME is output verbatim.
1894 Otherwise NAME is transformed in an implementation-defined way
1895 (usually by the addition of an underscore).
1896 Many macros in the tm file are defined to call this function. */
1899 assemble_name (FILE *file, const char *name)
1901 const char *real_name;
1904 real_name = targetm.strip_name_encoding (name);
1906 id = maybe_get_identifier (real_name);
1908 mark_referenced (id);
1911 fputs (&name[1], file);
1913 ASM_OUTPUT_LABELREF (file, name);
1916 /* Allocate SIZE bytes writable static space with a gensym name
1917 and return an RTX to refer to its address. */
1920 assemble_static_space (unsigned HOST_WIDE_INT size)
1923 const char *namestring;
1927 if (flag_shared_data)
1931 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1933 namestring = ggc_strdup (name);
1935 x = gen_rtx_SYMBOL_REF (Pmode, namestring);
1936 SYMBOL_REF_FLAGS (x) = SYMBOL_FLAG_LOCAL;
1938 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1939 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
1942 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1943 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1946 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1947 so that each uninitialized object starts on such a boundary. */
1948 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1949 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1950 = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1951 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1952 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1953 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1960 /* Assemble the static constant template for function entry trampolines.
1961 This is done at most once per compilation.
1962 Returns an RTX for the address of the template. */
1964 static GTY(()) rtx initial_trampoline;
1966 #ifdef TRAMPOLINE_TEMPLATE
1968 assemble_trampoline_template (void)
1975 if (initial_trampoline)
1976 return initial_trampoline;
1978 /* By default, put trampoline templates in read-only data section. */
1980 #ifdef TRAMPOLINE_SECTION
1981 TRAMPOLINE_SECTION ();
1983 readonly_data_section ();
1986 /* Write the assembler code to define one. */
1987 align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
1990 ASM_OUTPUT_ALIGN (asm_out_file, align);
1993 targetm.asm_out.internal_label (asm_out_file, "LTRAMP", 0);
1994 TRAMPOLINE_TEMPLATE (asm_out_file);
1996 /* Record the rtl to refer to it. */
1997 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1998 name = ggc_strdup (label);
1999 symbol = gen_rtx_SYMBOL_REF (Pmode, name);
2000 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
2002 initial_trampoline = gen_rtx_MEM (BLKmode, symbol);
2003 set_mem_align (initial_trampoline, TRAMPOLINE_ALIGNMENT);
2005 return initial_trampoline;
2009 /* A and B are either alignments or offsets. Return the minimum alignment
2010 that may be assumed after adding the two together. */
2012 static inline unsigned
2013 min_align (unsigned int a, unsigned int b)
2015 return (a | b) & -(a | b);
2018 /* Return the assembler directive for creating a given kind of integer
2019 object. SIZE is the number of bytes in the object and ALIGNED_P
2020 indicates whether it is known to be aligned. Return NULL if the
2021 assembly dialect has no such directive.
2023 The returned string should be printed at the start of a new line and
2024 be followed immediately by the object's initial value. */
2027 integer_asm_op (int size, int aligned_p)
2029 struct asm_int_op *ops;
2032 ops = &targetm.asm_out.aligned_op;
2034 ops = &targetm.asm_out.unaligned_op;
2039 return targetm.asm_out.byte_op;
2053 /* Use directive OP to assemble an integer object X. Print OP at the
2054 start of the line, followed immediately by the value of X. */
2057 assemble_integer_with_op (const char *op, rtx x)
2059 fputs (op, asm_out_file);
2060 output_addr_const (asm_out_file, x);
2061 fputc ('\n', asm_out_file);
2064 /* The default implementation of the asm_out.integer target hook. */
2067 default_assemble_integer (rtx x ATTRIBUTE_UNUSED,
2068 unsigned int size ATTRIBUTE_UNUSED,
2069 int aligned_p ATTRIBUTE_UNUSED)
2071 const char *op = integer_asm_op (size, aligned_p);
2072 /* Avoid GAS bugs for large values. Specifically negative values whose
2073 absolute value fits in a bfd_vma, but not in a bfd_signed_vma. */
2074 if (size > UNITS_PER_WORD && size > POINTER_SIZE / BITS_PER_UNIT)
2076 return op && (assemble_integer_with_op (op, x), true);
2079 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
2080 the alignment of the integer in bits. Return 1 if we were able to output
2081 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
2085 assemble_integer (rtx x, unsigned int size, unsigned int align, int force)
2089 aligned_p = (align >= MIN (size * BITS_PER_UNIT, BIGGEST_ALIGNMENT));
2091 /* See if the target hook can handle this kind of object. */
2092 if (targetm.asm_out.integer (x, size, aligned_p))
2095 /* If the object is a multi-byte one, try splitting it up. Split
2096 it into words it if is multi-word, otherwise split it into bytes. */
2099 enum machine_mode omode, imode;
2100 unsigned int subalign;
2101 unsigned int subsize, i;
2103 subsize = size > UNITS_PER_WORD? UNITS_PER_WORD : 1;
2104 subalign = MIN (align, subsize * BITS_PER_UNIT);
2105 omode = mode_for_size (subsize * BITS_PER_UNIT, MODE_INT, 0);
2106 imode = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
2108 for (i = 0; i < size; i += subsize)
2110 rtx partial = simplify_subreg (omode, x, imode, i);
2111 if (!partial || !assemble_integer (partial, subsize, subalign, 0))
2117 /* If we've printed some of it, but not all of it, there's no going
2130 assemble_real (REAL_VALUE_TYPE d, enum machine_mode mode, unsigned int align)
2134 int bitsize, nelts, nunits, units_per;
2136 /* This is hairy. We have a quantity of known size. real_to_target
2137 will put it into an array of *host* longs, 32 bits per element
2138 (even if long is more than 32 bits). We need to determine the
2139 number of array elements that are occupied (nelts) and the number
2140 of *target* min-addressable units that will be occupied in the
2141 object file (nunits). We cannot assume that 32 divides the
2142 mode's bitsize (size * BITS_PER_UNIT) evenly.
2144 size * BITS_PER_UNIT is used here to make sure that padding bits
2145 (which might appear at either end of the value; real_to_target
2146 will include the padding bits in its output array) are included. */
2148 nunits = GET_MODE_SIZE (mode);
2149 bitsize = nunits * BITS_PER_UNIT;
2150 nelts = CEIL (bitsize, 32);
2151 units_per = 32 / BITS_PER_UNIT;
2153 real_to_target (data, &d, mode);
2155 /* Put out the first word with the specified alignment. */
2156 assemble_integer (GEN_INT (data[0]), MIN (nunits, units_per), align, 1);
2157 nunits -= units_per;
2159 /* Subsequent words need only 32-bit alignment. */
2160 align = min_align (align, 32);
2162 for (i = 1; i < nelts; i++)
2164 assemble_integer (GEN_INT (data[i]), MIN (nunits, units_per), align, 1);
2165 nunits -= units_per;
2169 /* Given an expression EXP with a constant value,
2170 reduce it to the sum of an assembler symbol and an integer.
2171 Store them both in the structure *VALUE.
2172 Abort if EXP does not reduce. */
2174 struct addr_const GTY(())
2177 HOST_WIDE_INT offset;
2181 decode_addr_const (tree exp, struct addr_const *value)
2183 tree target = TREE_OPERAND (exp, 0);
2189 if (TREE_CODE (target) == COMPONENT_REF
2190 && host_integerp (byte_position (TREE_OPERAND (target, 1)), 0))
2193 offset += int_byte_position (TREE_OPERAND (target, 1));
2194 target = TREE_OPERAND (target, 0);
2196 else if (TREE_CODE (target) == ARRAY_REF
2197 || TREE_CODE (target) == ARRAY_RANGE_REF)
2199 offset += (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target)), 1)
2200 * tree_low_cst (TREE_OPERAND (target, 1), 0));
2201 target = TREE_OPERAND (target, 0);
2207 switch (TREE_CODE (target))
2211 x = DECL_RTL (target);
2215 x = gen_rtx_MEM (FUNCTION_MODE,
2216 gen_rtx_LABEL_REF (VOIDmode, force_label_rtx (target)));
2224 x = output_constant_def (target, 1);
2236 value->offset = offset;
2239 /* Uniquize all constants that appear in memory.
2240 Each constant in memory thus far output is recorded
2241 in `const_desc_table'. */
2243 struct constant_descriptor_tree GTY(())
2245 /* A MEM for the constant. */
2248 /* The value of the constant. */
2252 static GTY((param_is (struct constant_descriptor_tree)))
2253 htab_t const_desc_htab;
2255 static struct constant_descriptor_tree * build_constant_desc (tree);
2256 static void maybe_output_constant_def_contents (struct constant_descriptor_tree *, int);
2258 /* Compute a hash code for a constant expression. */
2261 const_desc_hash (const void *ptr)
2263 return const_hash_1 (((struct constant_descriptor_tree *)ptr)->value);
2267 const_hash_1 (const tree exp)
2272 enum tree_code code = TREE_CODE (exp);
2274 /* Either set P and LEN to the address and len of something to hash and
2275 exit the switch or return a value. */
2280 p = (char *) &TREE_INT_CST (exp);
2281 len = sizeof TREE_INT_CST (exp);
2285 return real_hash (TREE_REAL_CST_PTR (exp));
2288 p = TREE_STRING_POINTER (exp);
2289 len = TREE_STRING_LENGTH (exp);
2293 return (const_hash_1 (TREE_REALPART (exp)) * 5
2294 + const_hash_1 (TREE_IMAGPART (exp)));
2300 hi = 5 + int_size_in_bytes (TREE_TYPE (exp));
2302 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2303 if (TREE_VALUE (link))
2304 hi = hi * 603 + const_hash_1 (TREE_VALUE (link));
2312 struct addr_const value;
2314 decode_addr_const (exp, &value);
2315 if (GET_CODE (value.base) == SYMBOL_REF)
2317 /* Don't hash the address of the SYMBOL_REF;
2318 only use the offset and the symbol name. */
2320 p = XSTR (value.base, 0);
2321 for (i = 0; p[i] != 0; i++)
2322 hi = ((hi * 613) + (unsigned) (p[i]));
2324 else if (GET_CODE (value.base) == LABEL_REF)
2325 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2333 return (const_hash_1 (TREE_OPERAND (exp, 0)) * 9
2334 + const_hash_1 (TREE_OPERAND (exp, 1)));
2338 case NON_LVALUE_EXPR:
2339 return const_hash_1 (TREE_OPERAND (exp, 0)) * 7 + 2;
2342 /* A language specific constant. Just hash the code. */
2346 /* Compute hashing function. */
2348 for (i = 0; i < len; i++)
2349 hi = ((hi * 613) + (unsigned) (p[i]));
2354 /* Wrapper of compare_constant, for the htab interface. */
2356 const_desc_eq (const void *p1, const void *p2)
2358 return compare_constant (((struct constant_descriptor_tree *)p1)->value,
2359 ((struct constant_descriptor_tree *)p2)->value);
2362 /* Compare t1 and t2, and return 1 only if they are known to result in
2363 the same bit pattern on output. */
2366 compare_constant (const tree t1, const tree t2)
2368 enum tree_code typecode;
2370 if (t1 == NULL_TREE)
2371 return t2 == NULL_TREE;
2372 if (t2 == NULL_TREE)
2375 if (TREE_CODE (t1) != TREE_CODE (t2))
2378 switch (TREE_CODE (t1))
2381 /* Integer constants are the same only if the same width of type. */
2382 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2384 return tree_int_cst_equal (t1, t2);
2387 /* Real constants are the same only if the same width of type. */
2388 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2391 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
2394 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2)))
2397 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
2398 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
2399 TREE_STRING_LENGTH (t1)));
2402 return (compare_constant (TREE_REALPART (t1), TREE_REALPART (t2))
2403 && compare_constant (TREE_IMAGPART (t1), TREE_IMAGPART (t2)));
2409 typecode = TREE_CODE (TREE_TYPE (t1));
2410 if (typecode != TREE_CODE (TREE_TYPE (t2)))
2413 if (typecode == ARRAY_TYPE)
2415 HOST_WIDE_INT size_1 = int_size_in_bytes (TREE_TYPE (t1));
2416 /* For arrays, check that the sizes all match. */
2417 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2))
2419 || size_1 != int_size_in_bytes (TREE_TYPE (t2)))
2424 /* For record and union constructors, require exact type
2426 if (TREE_TYPE (t1) != TREE_TYPE (t2))
2430 for (l1 = CONSTRUCTOR_ELTS (t1), l2 = CONSTRUCTOR_ELTS (t2);
2432 l1 = TREE_CHAIN (l1), l2 = TREE_CHAIN (l2))
2434 /* Check that each value is the same... */
2435 if (! compare_constant (TREE_VALUE (l1), TREE_VALUE (l2)))
2437 /* ... and that they apply to the same fields! */
2438 if (typecode == ARRAY_TYPE)
2440 if (! compare_constant (TREE_PURPOSE (l1),
2446 if (TREE_PURPOSE (l1) != TREE_PURPOSE (l2))
2451 return l1 == NULL_TREE && l2 == NULL_TREE;
2457 struct addr_const value1, value2;
2459 decode_addr_const (t1, &value1);
2460 decode_addr_const (t2, &value2);
2461 return (value1.offset == value2.offset
2462 && strcmp (XSTR (value1.base, 0), XSTR (value2.base, 0)) == 0);
2468 return (compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))
2469 && compare_constant(TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)));
2473 case NON_LVALUE_EXPR:
2474 case VIEW_CONVERT_EXPR:
2475 return compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2480 nt1 = lang_hooks.expand_constant (t1);
2481 nt2 = lang_hooks.expand_constant (t2);
2482 if (nt1 != t1 || nt2 != t2)
2483 return compare_constant (nt1, nt2);
2489 /* Should not get here. */
2493 /* Make a copy of the whole tree structure for a constant. This
2494 handles the same types of nodes that compare_constant handles. */
2497 copy_constant (tree exp)
2499 switch (TREE_CODE (exp))
2502 /* For ADDR_EXPR, we do not want to copy the decl whose address
2503 is requested. We do want to copy constants though. */
2504 if (CONSTANT_CLASS_P (TREE_OPERAND (exp, 0)))
2505 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2506 copy_constant (TREE_OPERAND (exp, 0)));
2508 return copy_node (exp);
2513 return copy_node (exp);
2516 return build_complex (TREE_TYPE (exp),
2517 copy_constant (TREE_REALPART (exp)),
2518 copy_constant (TREE_IMAGPART (exp)));
2522 return build2 (TREE_CODE (exp), TREE_TYPE (exp),
2523 copy_constant (TREE_OPERAND (exp, 0)),
2524 copy_constant (TREE_OPERAND (exp, 1)));
2528 case NON_LVALUE_EXPR:
2529 case VIEW_CONVERT_EXPR:
2530 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2531 copy_constant (TREE_OPERAND (exp, 0)));
2535 tree copy = copy_node (exp);
2536 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2539 CONSTRUCTOR_ELTS (copy) = list;
2540 for (tail = list; tail; tail = TREE_CHAIN (tail))
2541 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2549 t = lang_hooks.expand_constant (exp);
2551 return copy_constant (t);
2558 /* Subroutine of output_constant_def:
2559 No constant equal to EXP is known to have been output.
2560 Make a constant descriptor to enter EXP in the hash table.
2561 Assign the label number and construct RTL to refer to the
2562 constant's location in memory.
2563 Caller is responsible for updating the hash table. */
2565 static struct constant_descriptor_tree *
2566 build_constant_desc (tree exp)
2572 struct constant_descriptor_tree *desc;
2574 desc = ggc_alloc (sizeof (*desc));
2575 desc->value = copy_constant (exp);
2577 /* Propagate marked-ness to copied constant. */
2578 if (flag_mudflap && mf_marked_p (exp))
2579 mf_mark (desc->value);
2581 /* Create a string containing the label name, in LABEL. */
2582 labelno = const_labelno++;
2583 ASM_GENERATE_INTERNAL_LABEL (label, "LC", labelno);
2585 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2586 symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label));
2587 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
2588 SYMBOL_REF_DECL (symbol) = desc->value;
2589 TREE_CONSTANT_POOL_ADDRESS_P (symbol) = 1;
2591 rtl = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)), symbol);
2592 set_mem_attributes (rtl, exp, 1);
2593 set_mem_alias_set (rtl, 0);
2594 set_mem_alias_set (rtl, const_alias_set);
2596 /* Set flags or add text to the name to record information, such as
2597 that it is a local symbol. If the name is changed, the macro
2598 ASM_OUTPUT_LABELREF will have to know how to strip this
2599 information. This call might invalidate our local variable
2600 SYMBOL; we can't use it afterward. */
2602 targetm.encode_section_info (exp, rtl, true);
2609 /* Return an rtx representing a reference to constant data in memory
2610 for the constant expression EXP.
2612 If assembler code for such a constant has already been output,
2613 return an rtx to refer to it.
2614 Otherwise, output such a constant in memory
2615 and generate an rtx for it.
2617 If DEFER is nonzero, this constant can be deferred and output only
2618 if referenced in the function after all optimizations.
2620 `const_desc_table' records which constants already have label strings. */
2623 output_constant_def (tree exp, int defer)
2625 struct constant_descriptor_tree *desc;
2626 struct constant_descriptor_tree key;
2629 /* Look up EXP in the table of constant descriptors. If we didn't find
2630 it, create a new one. */
2632 loc = htab_find_slot (const_desc_htab, &key, INSERT);
2637 desc = build_constant_desc (exp);
2641 maybe_output_constant_def_contents (desc, defer);
2645 /* Subroutine of output_constant_def: Decide whether or not we need to
2646 output the constant DESC now, and if so, do it. */
2648 maybe_output_constant_def_contents (struct constant_descriptor_tree *desc,
2651 rtx symbol = XEXP (desc->rtl, 0);
2652 tree exp = desc->value;
2654 if (flag_syntax_only)
2657 if (TREE_ASM_WRITTEN (exp))
2658 /* Already output; don't do it again. */
2661 /* We can always defer constants as long as the context allows
2665 /* Increment n_deferred_constants if it exists. It needs to be at
2666 least as large as the number of constants actually referred to
2667 by the function. If it's too small we'll stop looking too early
2668 and fail to emit constants; if it's too large we'll only look
2669 through the entire function when we could have stopped earlier. */
2671 n_deferred_constants++;
2675 output_constant_def_contents (symbol);
2678 /* We must output the constant data referred to by SYMBOL; do so. */
2681 output_constant_def_contents (rtx symbol)
2683 tree exp = SYMBOL_REF_DECL (symbol);
2684 const char *label = XSTR (symbol, 0);
2687 /* Make sure any other constants whose addresses appear in EXP
2688 are assigned label numbers. */
2689 int reloc = compute_reloc_for_constant (exp);
2691 /* Align the location counter as required by EXP's data type. */
2692 unsigned int align = TYPE_ALIGN (TREE_TYPE (exp));
2693 #ifdef CONSTANT_ALIGNMENT
2694 align = CONSTANT_ALIGNMENT (exp, align);
2697 output_addressed_constants (exp);
2699 /* We are no longer deferring this constant. */
2700 TREE_ASM_WRITTEN (exp) = 1;
2702 if (IN_NAMED_SECTION (exp))
2703 named_section (exp, NULL, reloc);
2705 targetm.asm_out.select_section (exp, reloc, align);
2707 if (align > BITS_PER_UNIT)
2709 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2712 size = int_size_in_bytes (TREE_TYPE (exp));
2713 if (TREE_CODE (exp) == STRING_CST)
2714 size = MAX (TREE_STRING_LENGTH (exp), size);
2716 /* Do any machine/system dependent processing of the constant. */
2717 #ifdef ASM_DECLARE_CONSTANT_NAME
2718 ASM_DECLARE_CONSTANT_NAME (asm_out_file, label, exp, size);
2720 /* Standard thing is just output label for the constant. */
2721 ASM_OUTPUT_LABEL (asm_out_file, label);
2722 #endif /* ASM_DECLARE_CONSTANT_NAME */
2724 /* Output the value of EXP. */
2725 output_constant (exp, size, align);
2727 mudflap_enqueue_constant (exp);
2730 /* Look up EXP in the table of constant descriptors. Return the rtl
2731 if it has been emitted, else null. */
2734 lookup_constant_def (tree exp)
2736 struct constant_descriptor_tree *desc;
2737 struct constant_descriptor_tree key;
2740 desc = htab_find (const_desc_htab, &key);
2742 return (desc ? desc->rtl : NULL_RTX);
2745 /* Used in the hash tables to avoid outputting the same constant
2746 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2747 are output once per function, not once per file. */
2748 /* ??? Only a few targets need per-function constant pools. Most
2749 can use one per-file pool. Should add a targetm bit to tell the
2752 struct rtx_constant_pool GTY(())
2754 /* Pointers to first and last constant in pool, as ordered by offset. */
2755 struct constant_descriptor_rtx *first;
2756 struct constant_descriptor_rtx *last;
2758 /* Hash facility for making memory-constants from constant rtl-expressions.
2759 It is used on RISC machines where immediate integer arguments and
2760 constant addresses are restricted so that such constants must be stored
2762 htab_t GTY((param_is (struct constant_descriptor_rtx))) const_rtx_htab;
2763 htab_t GTY((param_is (struct constant_descriptor_rtx))) const_rtx_sym_htab;
2765 /* Current offset in constant pool (does not include any
2766 machine-specific header). */
2767 HOST_WIDE_INT offset;
2770 struct constant_descriptor_rtx GTY((chain_next ("%h.next")))
2772 struct constant_descriptor_rtx *next;
2776 HOST_WIDE_INT offset;
2778 enum machine_mode mode;
2784 /* Hash and compare functions for const_rtx_htab. */
2787 const_desc_rtx_hash (const void *ptr)
2789 const struct constant_descriptor_rtx *desc = ptr;
2794 const_desc_rtx_eq (const void *a, const void *b)
2796 const struct constant_descriptor_rtx *x = a;
2797 const struct constant_descriptor_rtx *y = b;
2799 if (x->mode != y->mode)
2801 return rtx_equal_p (x->constant, y->constant);
2804 /* Hash and compare functions for const_rtx_sym_htab. */
2807 const_desc_rtx_sym_hash (const void *ptr)
2809 const struct constant_descriptor_rtx *desc = ptr;
2810 return htab_hash_string (XSTR (desc->sym, 0));
2814 const_desc_rtx_sym_eq (const void *a, const void *b)
2816 const struct constant_descriptor_rtx *x = a;
2817 const struct constant_descriptor_rtx *y = b;
2818 return XSTR (x->sym, 0) == XSTR (y->sym, 0);
2821 /* This is the worker function for const_rtx_hash, called via for_each_rtx. */
2824 const_rtx_hash_1 (rtx *xp, void *data)
2826 unsigned HOST_WIDE_INT hwi;
2827 enum machine_mode mode;
2833 code = GET_CODE (x);
2834 mode = GET_MODE (x);
2835 h = (hashval_t) code * 1048573 + mode;
2843 const int shift = sizeof (hashval_t) * CHAR_BIT;
2844 const int n = sizeof (HOST_WIDE_INT) / sizeof (hashval_t);
2847 h ^= (hashval_t) hwi;
2848 for (i = 1; i < n; ++i)
2851 h ^= (hashval_t) hwi;
2857 if (mode == VOIDmode)
2859 hwi = CONST_DOUBLE_LOW (x) ^ CONST_DOUBLE_HIGH (x);
2863 h ^= real_hash (CONST_DOUBLE_REAL_VALUE (x));
2867 h ^= htab_hash_string (XSTR (x, 0));
2871 h = h * 251 + CODE_LABEL_NUMBER (XEXP (x, 0));
2875 case UNSPEC_VOLATILE:
2876 h = h * 251 + XINT (x, 1);
2884 *hp = *hp * 509 + h;
2888 /* Compute a hash value for X, which should be a constant. */
2891 const_rtx_hash (rtx x)
2894 for_each_rtx (&x, const_rtx_hash_1, &h);
2899 /* Initialize constant pool hashing for a new function. */
2902 init_varasm_status (struct function *f)
2904 struct varasm_status *p;
2905 struct rtx_constant_pool *pool;
2907 p = ggc_alloc (sizeof (struct varasm_status));
2910 pool = ggc_alloc (sizeof (struct rtx_constant_pool));
2912 p->deferred_constants = 0;
2914 pool->const_rtx_htab = htab_create_ggc (31, const_desc_rtx_hash,
2915 const_desc_rtx_eq, NULL);
2916 pool->const_rtx_sym_htab = htab_create_ggc (31, const_desc_rtx_sym_hash,
2917 const_desc_rtx_sym_eq, NULL);
2918 pool->first = pool->last = NULL;
2922 /* Given a MINUS expression, simplify it if both sides
2923 include the same symbol. */
2926 simplify_subtraction (rtx x)
2928 rtx r = simplify_rtx (x);
2932 /* Given a constant rtx X, make (or find) a memory constant for its value
2933 and return a MEM rtx to refer to it in memory. */
2936 force_const_mem (enum machine_mode mode, rtx x)
2938 struct constant_descriptor_rtx *desc, tmp;
2939 struct rtx_constant_pool *pool = cfun->varasm->pool;
2946 /* If we're not allowed to drop X into the constant pool, don't. */
2947 if (targetm.cannot_force_const_mem (x))
2950 /* Lookup the value in the hashtable. */
2953 hash = const_rtx_hash (x);
2954 slot = htab_find_slot_with_hash (pool->const_rtx_htab, &tmp, hash, INSERT);
2957 /* If the constant was already present, return its memory. */
2959 return copy_rtx (desc->mem);
2961 /* Otherwise, create a new descriptor. */
2962 desc = ggc_alloc (sizeof (*desc));
2965 /* Align the location counter as required by EXP's data type. */
2966 align = GET_MODE_ALIGNMENT (mode == VOIDmode ? word_mode : mode);
2967 #ifdef CONSTANT_ALIGNMENT
2969 tree type = lang_hooks.types.type_for_mode (mode, 0);
2970 if (type != NULL_TREE)
2971 align = CONSTANT_ALIGNMENT (make_tree (type, x), align);
2975 pool->offset += (align / BITS_PER_UNIT) - 1;
2976 pool->offset &= ~ ((align / BITS_PER_UNIT) - 1);
2979 desc->constant = tmp.constant;
2980 desc->offset = pool->offset;
2983 desc->align = align;
2984 desc->labelno = const_labelno;
2987 pool->offset += GET_MODE_SIZE (mode);
2989 pool->last->next = desc;
2991 pool->first = pool->last = desc;
2994 /* Create a string containing the label name, in LABEL. */
2995 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
2998 /* Construct the SYMBOL_REF. Make sure to mark it as belonging to
2999 the constants pool. */
3000 desc->sym = symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label));
3001 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
3002 CONSTANT_POOL_ADDRESS_P (symbol) = 1;
3003 current_function_uses_const_pool = 1;
3005 /* Insert the descriptor into the symbol cross-reference table too. */
3006 slot = htab_find_slot (pool->const_rtx_sym_htab, desc, INSERT);
3011 /* Construct the MEM. */
3012 desc->mem = def = gen_const_mem (mode, symbol);
3013 set_mem_attributes (def, lang_hooks.types.type_for_mode (mode, 0), 1);
3015 /* If we're dropping a label to the constant pool, make sure we
3017 if (GET_CODE (x) == LABEL_REF)
3018 LABEL_PRESERVE_P (XEXP (x, 0)) = 1;
3020 return copy_rtx (def);
3023 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3024 the corresponding constant_descriptor_rtx structure. */
3026 static struct constant_descriptor_rtx *
3027 find_pool_constant (struct rtx_constant_pool *pool, rtx sym)
3029 struct constant_descriptor_rtx tmp;
3031 return htab_find (pool->const_rtx_sym_htab, &tmp);
3034 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3037 get_pool_constant (rtx addr)
3039 return find_pool_constant (cfun->varasm->pool, addr)->constant;
3042 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3043 and whether it has been output or not. */
3046 get_pool_constant_mark (rtx addr, bool *pmarked)
3048 struct constant_descriptor_rtx *desc;
3050 desc = find_pool_constant (cfun->varasm->pool, addr);
3051 *pmarked = (desc->mark != 0);
3052 return desc->constant;
3055 /* Likewise, but for the constant pool of a specific function. */
3058 get_pool_constant_for_function (struct function *f, rtx addr)
3060 return find_pool_constant (f->varasm->pool, addr)->constant;
3063 /* Similar, return the mode. */
3066 get_pool_mode (rtx addr)
3068 return find_pool_constant (cfun->varasm->pool, addr)->mode;
3071 /* Return the size of the constant pool. */
3074 get_pool_size (void)
3076 return cfun->varasm->pool->offset;
3079 /* Worker function for output_constant_pool_1. Emit assembly for X
3080 in MODE with known alignment ALIGN. */
3083 output_constant_pool_2 (enum machine_mode mode, rtx x, unsigned int align)
3085 switch (GET_MODE_CLASS (mode))
3088 if (GET_CODE (x) != CONST_DOUBLE)
3093 REAL_VALUE_FROM_CONST_DOUBLE (r, x);
3094 assemble_real (r, mode, align);
3099 case MODE_PARTIAL_INT:
3100 assemble_integer (x, GET_MODE_SIZE (mode), align, 1);
3103 case MODE_VECTOR_FLOAT:
3104 case MODE_VECTOR_INT:
3107 enum machine_mode submode = GET_MODE_INNER (mode);
3108 unsigned int subalign = MIN (align, GET_MODE_BITSIZE (submode));
3110 if (GET_CODE (x) != CONST_VECTOR)
3112 units = CONST_VECTOR_NUNITS (x);
3114 for (i = 0; i < units; i++)
3116 rtx elt = CONST_VECTOR_ELT (x, i);
3117 output_constant_pool_2 (submode, elt, i ? subalign : align);
3127 /* Worker function for output_constant_pool. Emit POOL. */
3130 output_constant_pool_1 (struct constant_descriptor_rtx *desc)
3138 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3139 whose CODE_LABEL has been deleted. This can occur if a jump table
3140 is eliminated by optimization. If so, write a constant of zero
3141 instead. Note that this can also happen by turning the
3142 CODE_LABEL into a NOTE. */
3143 /* ??? This seems completely and utterly wrong. Certainly it's
3144 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3145 functioning even with INSN_DELETED_P and friends. */
3148 switch (GET_CODE (x))
3151 if (GET_CODE (XEXP (x, 0)) != PLUS
3152 || GET_CODE (XEXP (XEXP (x, 0), 0)) != LABEL_REF)
3154 tmp = XEXP (XEXP (x, 0), 0);
3159 if (INSN_DELETED_P (tmp)
3161 && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_DELETED))
3172 /* First switch to correct section. */
3173 targetm.asm_out.select_rtx_section (desc->mode, x, desc->align);
3175 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3176 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, desc->mode,
3177 desc->align, desc->labelno, done);
3180 assemble_align (desc->align);
3182 /* Output the label. */
3183 targetm.asm_out.internal_label (asm_out_file, "LC", desc->labelno);
3185 /* Output the data. */
3186 output_constant_pool_2 (desc->mode, x, desc->align);
3188 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3189 sections have proper size. */
3190 if (desc->align > GET_MODE_BITSIZE (desc->mode)
3191 && in_section == in_named
3192 && get_named_section_flags (in_named_name) & SECTION_MERGE)
3193 assemble_align (desc->align);
3195 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3201 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3202 to as used. Emit referenced deferred strings. This function can
3203 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3206 mark_constant (rtx *current_rtx, void *data)
3208 struct rtx_constant_pool *pool = data;
3209 rtx x = *current_rtx;
3211 if (x == NULL_RTX || GET_CODE (x) != SYMBOL_REF)
3214 if (CONSTANT_POOL_ADDRESS_P (x))
3216 struct constant_descriptor_rtx *desc = find_pool_constant (pool, x);
3217 if (desc->mark == 0)
3220 for_each_rtx (&desc->constant, mark_constant, pool);
3223 else if (TREE_CONSTANT_POOL_ADDRESS_P (x))
3225 tree exp = SYMBOL_REF_DECL (x);
3226 if (!TREE_ASM_WRITTEN (exp))
3228 n_deferred_constants--;
3229 output_constant_def_contents (x);
3236 /* Look through appropriate parts of INSN, marking all entries in the
3237 constant pool which are actually being used. Entries that are only
3238 referenced by other constants are also marked as used. Emit
3239 deferred strings that are used. */
3242 mark_constants (struct rtx_constant_pool *pool, rtx insn)
3247 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3248 insns, not any notes that may be attached. We don't want to mark
3249 a constant just because it happens to appear in a REG_EQUIV note. */
3250 if (GET_CODE (PATTERN (insn)) == SEQUENCE)
3252 rtx seq = PATTERN (insn);
3253 int i, n = XVECLEN (seq, 0);
3254 for (i = 0; i < n; ++i)
3256 rtx subinsn = XVECEXP (seq, 0, i);
3257 if (INSN_P (subinsn))
3258 for_each_rtx (&PATTERN (subinsn), mark_constant, pool);
3262 for_each_rtx (&PATTERN (insn), mark_constant, pool);
3265 /* Look through the instructions for this function, and mark all the
3266 entries in POOL which are actually being used. Emit deferred constants
3267 which have indeed been used. */
3270 mark_constant_pool (struct rtx_constant_pool *pool)
3274 if (pool->first == 0 && n_deferred_constants == 0)
3277 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3278 mark_constants (pool, insn);
3280 for (link = current_function_epilogue_delay_list;
3282 link = XEXP (link, 1))
3283 mark_constants (pool, XEXP (link, 0));
3286 /* Write all the constants in the constant pool. */
3289 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED,
3290 tree fndecl ATTRIBUTE_UNUSED)
3292 struct rtx_constant_pool *pool = cfun->varasm->pool;
3293 struct constant_descriptor_rtx *desc;
3295 /* It is possible for gcc to call force_const_mem and then to later
3296 discard the instructions which refer to the constant. In such a
3297 case we do not need to output the constant. */
3298 mark_constant_pool (pool);
3300 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3301 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool->offset);
3304 for (desc = pool->first; desc ; desc = desc->next)
3305 output_constant_pool_1 (desc);
3307 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3308 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool->offset);
3312 /* Determine what kind of relocations EXP may need. */
3315 compute_reloc_for_constant (tree exp)
3317 int reloc = 0, reloc2;
3320 /* Give the front-end a chance to convert VALUE to something that
3321 looks more like a constant to the back-end. */
3322 exp = lang_hooks.expand_constant (exp);
3324 switch (TREE_CODE (exp))
3328 /* Go inside any operations that get_inner_reference can handle and see
3329 if what's inside is a constant: no need to do anything here for
3330 addresses of variables or functions. */
3331 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
3332 tem = TREE_OPERAND (tem, 0))
3335 if (TREE_PUBLIC (tem))
3342 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
3343 reloc |= compute_reloc_for_constant (TREE_OPERAND (exp, 1));
3347 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
3348 reloc2 = compute_reloc_for_constant (TREE_OPERAND (exp, 1));
3349 /* The difference of two local labels is computable at link time. */
3350 if (reloc == 1 && reloc2 == 1)
3358 case NON_LVALUE_EXPR:
3359 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
3363 for (tem = CONSTRUCTOR_ELTS (exp); tem; tem = TREE_CHAIN (tem))
3364 if (TREE_VALUE (tem) != 0)
3365 reloc |= compute_reloc_for_constant (TREE_VALUE (tem));
3375 /* Find all the constants whose addresses are referenced inside of EXP,
3376 and make sure assembler code with a label has been output for each one.
3377 Indicate whether an ADDR_EXPR has been encountered. */
3380 output_addressed_constants (tree exp)
3384 /* Give the front-end a chance to convert VALUE to something that
3385 looks more like a constant to the back-end. */
3386 exp = lang_hooks.expand_constant (exp);
3388 switch (TREE_CODE (exp))
3392 /* Go inside any operations that get_inner_reference can handle and see
3393 if what's inside is a constant: no need to do anything here for
3394 addresses of variables or functions. */
3395 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
3396 tem = TREE_OPERAND (tem, 0))
3399 /* If we have an initialized CONST_DECL, retrieve the initializer. */
3400 if (TREE_CODE (tem) == CONST_DECL && DECL_INITIAL (tem))
3401 tem = DECL_INITIAL (tem);
3403 if (CONSTANT_CLASS_P (tem) || TREE_CODE (tem) == CONSTRUCTOR)
3404 output_constant_def (tem, 0);
3409 output_addressed_constants (TREE_OPERAND (exp, 1));
3414 case NON_LVALUE_EXPR:
3415 output_addressed_constants (TREE_OPERAND (exp, 0));
3419 for (tem = CONSTRUCTOR_ELTS (exp); tem; tem = TREE_CHAIN (tem))
3420 if (TREE_VALUE (tem) != 0)
3421 output_addressed_constants (TREE_VALUE (tem));
3430 /* Return nonzero if VALUE is a valid constant-valued expression
3431 for use in initializing a static variable; one that can be an
3432 element of a "constant" initializer.
3434 Return null_pointer_node if the value is absolute;
3435 if it is relocatable, return the variable that determines the relocation.
3436 We assume that VALUE has been folded as much as possible;
3437 therefore, we do not need to check for such things as
3438 arithmetic-combinations of integers. */
3441 initializer_constant_valid_p (tree value, tree endtype)
3443 /* Give the front-end a chance to convert VALUE to something that
3444 looks more like a constant to the back-end. */
3445 value = lang_hooks.expand_constant (value);
3447 switch (TREE_CODE (value))
3450 if ((TREE_CODE (TREE_TYPE (value)) == UNION_TYPE
3451 || TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE)
3452 && TREE_CONSTANT (value)
3453 && CONSTRUCTOR_ELTS (value))
3456 bool absolute = true;
3458 for (elt = CONSTRUCTOR_ELTS (value); elt; elt = TREE_CHAIN (elt))
3461 value = TREE_VALUE (elt);
3462 reloc = initializer_constant_valid_p (value, TREE_TYPE (value));
3465 if (reloc != null_pointer_node)
3468 /* For a non-absolute relocation, there is no single
3469 variable that can be "the variable that determines the
3471 return absolute ? null_pointer_node : error_mark_node;
3474 return TREE_STATIC (value) ? null_pointer_node : NULL_TREE;
3481 return null_pointer_node;
3485 value = staticp (TREE_OPERAND (value, 0));
3486 /* "&(*a).f" is like unto pointer arithmetic. If "a" turns out to
3487 be a constant, this is old-skool offsetof-like nonsense. */
3489 && TREE_CODE (value) == INDIRECT_REF
3490 && TREE_CONSTANT (TREE_OPERAND (value, 0)))
3491 return null_pointer_node;
3494 case VIEW_CONVERT_EXPR:
3495 case NON_LVALUE_EXPR:
3496 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3500 /* Allow conversions between pointer types. */
3501 if (POINTER_TYPE_P (TREE_TYPE (value))
3502 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3503 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3505 /* Allow conversions between real types. */
3506 if (FLOAT_TYPE_P (TREE_TYPE (value))
3507 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3508 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3510 /* Allow length-preserving conversions between integer types. */
3511 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3512 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3513 && (TYPE_PRECISION (TREE_TYPE (value))
3514 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3515 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3517 /* Allow conversions between other integer types only if
3519 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3520 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3522 tree inner = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3524 if (inner == null_pointer_node)
3525 return null_pointer_node;
3529 /* Allow (int) &foo provided int is as wide as a pointer. */
3530 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3531 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3532 && (TYPE_PRECISION (TREE_TYPE (value))
3533 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3534 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3537 /* Likewise conversions from int to pointers, but also allow
3538 conversions from 0. */
3539 if ((POINTER_TYPE_P (TREE_TYPE (value))
3540 || TREE_CODE (TREE_TYPE (value)) == OFFSET_TYPE)
3541 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3543 if (integer_zerop (TREE_OPERAND (value, 0)))
3544 return null_pointer_node;
3545 else if (TYPE_PRECISION (TREE_TYPE (value))
3546 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0))))
3547 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3551 /* Allow conversions to struct or union types if the value
3553 if (TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE
3554 || TREE_CODE (TREE_TYPE (value)) == UNION_TYPE)
3555 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3560 if (! INTEGRAL_TYPE_P (endtype)
3561 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3563 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3565 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3567 /* If either term is absolute, use the other terms relocation. */
3568 if (valid0 == null_pointer_node)
3570 if (valid1 == null_pointer_node)
3576 if (! INTEGRAL_TYPE_P (endtype)
3577 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3579 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3581 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3583 /* Win if second argument is absolute. */
3584 if (valid1 == null_pointer_node)
3586 /* Win if both arguments have the same relocation.
3587 Then the value is absolute. */
3588 if (valid0 == valid1 && valid0 != 0)
3589 return null_pointer_node;
3591 /* Since GCC guarantees that string constants are unique in the
3592 generated code, a subtraction between two copies of the same
3593 constant string is absolute. */
3594 if (valid0 && TREE_CODE (valid0) == STRING_CST
3595 && valid1 && TREE_CODE (valid1) == STRING_CST
3596 && operand_equal_p (valid0, valid1, 1))
3597 return null_pointer_node;
3600 /* Support narrowing differences. */
3601 if (INTEGRAL_TYPE_P (endtype))
3605 op0 = TREE_OPERAND (value, 0);
3606 op1 = TREE_OPERAND (value, 1);
3608 /* Like STRIP_NOPS except allow the operand mode to widen.
3609 This works around a feature of fold that simplifies
3610 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3611 that the narrower operation is cheaper. */
3613 while (TREE_CODE (op0) == NOP_EXPR
3614 || TREE_CODE (op0) == CONVERT_EXPR
3615 || TREE_CODE (op0) == NON_LVALUE_EXPR)
3617 tree inner = TREE_OPERAND (op0, 0);
3618 if (inner == error_mark_node
3619 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3620 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0)))
3621 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3626 while (TREE_CODE (op1) == NOP_EXPR
3627 || TREE_CODE (op1) == CONVERT_EXPR
3628 || TREE_CODE (op1) == NON_LVALUE_EXPR)
3630 tree inner = TREE_OPERAND (op1, 0);
3631 if (inner == error_mark_node
3632 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3633 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1)))
3634 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3639 op0 = initializer_constant_valid_p (op0, endtype);
3640 op1 = initializer_constant_valid_p (op1, endtype);
3642 /* Both initializers must be known. */
3646 return null_pointer_node;
3648 /* Support differences between labels. */
3649 if (TREE_CODE (op0) == LABEL_DECL
3650 && TREE_CODE (op1) == LABEL_DECL)
3651 return null_pointer_node;
3653 if (TREE_CODE (op0) == STRING_CST
3654 && TREE_CODE (op1) == STRING_CST
3655 && operand_equal_p (op0, op1, 1))
3656 return null_pointer_node;
3668 /* Output assembler code for constant EXP to FILE, with no label.
3669 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3670 Assumes output_addressed_constants has been done on EXP already.
3672 Generate exactly SIZE bytes of assembler data, padding at the end
3673 with zeros if necessary. SIZE must always be specified.
3675 SIZE is important for structure constructors,
3676 since trailing members may have been omitted from the constructor.
3677 It is also important for initialization of arrays from string constants
3678 since the full length of the string constant might not be wanted.
3679 It is also needed for initialization of unions, where the initializer's
3680 type is just one member, and that may not be as long as the union.
3682 There a case in which we would fail to output exactly SIZE bytes:
3683 for a structure constructor that wants to produce more than SIZE bytes.
3684 But such constructors will never be generated for any possible input.
3686 ALIGN is the alignment of the data in bits. */
3689 output_constant (tree exp, unsigned HOST_WIDE_INT size, unsigned int align)
3691 enum tree_code code;
3692 unsigned HOST_WIDE_INT thissize;
3694 /* Some front-ends use constants other than the standard language-independent
3695 varieties, but which may still be output directly. Give the front-end a
3696 chance to convert EXP to a language-independent representation. */
3697 exp = lang_hooks.expand_constant (exp);
3699 if (size == 0 || flag_syntax_only)
3702 /* Eliminate any conversions since we'll be outputting the underlying
3704 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
3705 || TREE_CODE (exp) == NON_LVALUE_EXPR
3706 || TREE_CODE (exp) == VIEW_CONVERT_EXPR)
3707 exp = TREE_OPERAND (exp, 0);
3709 code = TREE_CODE (TREE_TYPE (exp));
3710 thissize = int_size_in_bytes (TREE_TYPE (exp));
3712 /* Allow a constructor with no elements for any data type.
3713 This means to fill the space with zeros. */
3714 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
3716 assemble_zeros (size);
3720 if (TREE_CODE (exp) == FDESC_EXPR)
3722 #ifdef ASM_OUTPUT_FDESC
3723 HOST_WIDE_INT part = tree_low_cst (TREE_OPERAND (exp, 1), 0);
3724 tree decl = TREE_OPERAND (exp, 0);
3725 ASM_OUTPUT_FDESC (asm_out_file, decl, part);
3732 /* Now output the underlying data. If we've handling the padding, return.
3733 Otherwise, break and ensure SIZE is the size written. */
3741 case REFERENCE_TYPE:
3743 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
3744 EXPAND_INITIALIZER),
3745 MIN (size, thissize), align, 0))
3746 error ("initializer for integer value is too complicated");
3750 if (TREE_CODE (exp) != REAL_CST)
3751 error ("initializer for floating value is not a floating constant");
3753 assemble_real (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)), align);
3757 output_constant (TREE_REALPART (exp), thissize / 2, align);
3758 output_constant (TREE_IMAGPART (exp), thissize / 2,
3759 min_align (align, BITS_PER_UNIT * (thissize / 2)));
3764 if (TREE_CODE (exp) == CONSTRUCTOR)
3766 output_constructor (exp, size, align);
3769 else if (TREE_CODE (exp) == STRING_CST)
3771 thissize = MIN ((unsigned HOST_WIDE_INT)TREE_STRING_LENGTH (exp),
3773 assemble_string (TREE_STRING_POINTER (exp), thissize);
3775 else if (TREE_CODE (exp) == VECTOR_CST)
3779 unsigned int nalign;
3780 enum machine_mode inner;
3782 inner = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
3783 nalign = MIN (align, GET_MODE_ALIGNMENT (inner));
3785 elt_size = GET_MODE_SIZE (inner);
3787 link = TREE_VECTOR_CST_ELTS (exp);
3788 output_constant (TREE_VALUE (link), elt_size, align);
3789 while ((link = TREE_CHAIN (link)) != NULL)
3790 output_constant (TREE_VALUE (link), elt_size, nalign);
3798 if (TREE_CODE (exp) == CONSTRUCTOR)
3799 output_constructor (exp, size, align);
3811 if (size > thissize)
3812 assemble_zeros (size - thissize);
3816 /* Subroutine of output_constructor, used for computing the size of
3817 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3818 type with an unspecified upper bound. */
3820 static unsigned HOST_WIDE_INT
3821 array_size_for_constructor (tree val)
3825 /* This code used to attempt to handle string constants that are not
3826 arrays of single-bytes, but nothing else does, so there's no point in
3828 if (TREE_CODE (val) == STRING_CST)
3829 return TREE_STRING_LENGTH (val);
3831 max_index = NULL_TREE;
3832 for (i = CONSTRUCTOR_ELTS (val); i; i = TREE_CHAIN (i))
3834 tree index = TREE_PURPOSE (i);
3836 if (TREE_CODE (index) == RANGE_EXPR)
3837 index = TREE_OPERAND (index, 1);
3838 if (max_index == NULL_TREE || tree_int_cst_lt (max_index, index))
3842 if (max_index == NULL_TREE)
3845 /* Compute the total number of array elements. */
3846 i = size_binop (MINUS_EXPR, convert (sizetype, max_index),
3848 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val)))));
3849 i = size_binop (PLUS_EXPR, i, convert (sizetype, integer_one_node));
3851 /* Multiply by the array element unit size to find number of bytes. */
3852 i = size_binop (MULT_EXPR, i, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val))));
3854 return tree_low_cst (i, 1);
3857 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3858 Generate at least SIZE bytes, padding if necessary. */
3861 output_constructor (tree exp, unsigned HOST_WIDE_INT size,
3864 tree type = TREE_TYPE (exp);
3865 tree link, field = 0;
3867 /* Number of bytes output or skipped so far.
3868 In other words, current position within the constructor. */
3869 HOST_WIDE_INT total_bytes = 0;
3870 /* Nonzero means BYTE contains part of a byte, to be output. */
3871 int byte_buffer_in_use = 0;
3874 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
3877 if (TREE_CODE (type) == RECORD_TYPE)
3878 field = TYPE_FIELDS (type);
3880 if (TREE_CODE (type) == ARRAY_TYPE
3881 && TYPE_DOMAIN (type) != 0)
3882 min_index = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
3884 /* As LINK goes through the elements of the constant,
3885 FIELD goes through the structure fields, if the constant is a structure.
3886 if the constant is a union, then we override this,
3887 by getting the field from the TREE_LIST element.
3888 But the constant could also be an array. Then FIELD is zero.
3890 There is always a maximum of one element in the chain LINK for unions
3891 (even if the initializer in a source program incorrectly contains
3893 for (link = CONSTRUCTOR_ELTS (exp);
3895 link = TREE_CHAIN (link),
3896 field = field ? TREE_CHAIN (field) : 0)
3898 tree val = TREE_VALUE (link);
3901 /* The element in a union constructor specifies the proper field
3903 if ((TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
3904 || TREE_CODE (type) == QUAL_UNION_TYPE)
3905 && TREE_PURPOSE (link) != 0)
3906 field = TREE_PURPOSE (link);
3908 else if (TREE_CODE (type) == ARRAY_TYPE)
3909 index = TREE_PURPOSE (link);
3911 #ifdef ASM_COMMENT_START
3912 if (field && flag_verbose_asm)
3913 fprintf (asm_out_file, "%s %s:\n",
3916 ? IDENTIFIER_POINTER (DECL_NAME (field))
3920 /* Eliminate the marker that makes a cast not be an lvalue. */
3924 if (index && TREE_CODE (index) == RANGE_EXPR)
3926 unsigned HOST_WIDE_INT fieldsize
3927 = int_size_in_bytes (TREE_TYPE (type));
3928 HOST_WIDE_INT lo_index = tree_low_cst (TREE_OPERAND (index, 0), 0);
3929 HOST_WIDE_INT hi_index = tree_low_cst (TREE_OPERAND (index, 1), 0);
3930 HOST_WIDE_INT index;
3931 unsigned int align2 = min_align (align, fieldsize * BITS_PER_UNIT);
3933 for (index = lo_index; index <= hi_index; index++)
3935 /* Output the element's initial value. */
3937 assemble_zeros (fieldsize);
3939 output_constant (val, fieldsize, align2);
3941 /* Count its size. */
3942 total_bytes += fieldsize;
3945 else if (field == 0 || !DECL_BIT_FIELD (field))
3947 /* An element that is not a bit-field. */
3949 unsigned HOST_WIDE_INT fieldsize;
3950 /* Since this structure is static,
3951 we know the positions are constant. */
3952 HOST_WIDE_INT pos = field ? int_byte_position (field) : 0;
3953 unsigned int align2;
3956 pos = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val)), 1)
3957 * (tree_low_cst (index, 0) - tree_low_cst (min_index, 0)));
3959 /* Output any buffered-up bit-fields preceding this element. */
3960 if (byte_buffer_in_use)
3962 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
3964 byte_buffer_in_use = 0;
3967 /* Advance to offset of this element.
3968 Note no alignment needed in an array, since that is guaranteed
3969 if each element has the proper size. */
3970 if ((field != 0 || index != 0) && pos != total_bytes)
3972 assemble_zeros (pos - total_bytes);
3976 /* Find the alignment of this element. */
3977 align2 = min_align (align, BITS_PER_UNIT * pos);
3979 /* Determine size this element should occupy. */
3984 /* If this is an array with an unspecified upper bound,
3985 the initializer determines the size. */
3986 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
3987 but we cannot do this until the deprecated support for
3988 initializing zero-length array members is removed. */
3989 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE
3990 && TYPE_DOMAIN (TREE_TYPE (field))
3991 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field))))
3993 fieldsize = array_size_for_constructor (val);
3994 /* Given a non-empty initialization, this field had
3996 if (fieldsize != 0 && TREE_CHAIN (field) != NULL_TREE)
3999 else if (DECL_SIZE_UNIT (field))
4001 /* ??? This can't be right. If the decl size overflows
4002 a host integer we will silently emit no data. */
4003 if (host_integerp (DECL_SIZE_UNIT (field), 1))
4004 fieldsize = tree_low_cst (DECL_SIZE_UNIT (field), 1);
4008 fieldsize = int_size_in_bytes (TREE_TYPE (type));
4010 /* Output the element's initial value. */
4012 assemble_zeros (fieldsize);
4014 output_constant (val, fieldsize, align2);
4016 /* Count its size. */
4017 total_bytes += fieldsize;
4019 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
4020 error ("invalid initial value for member %qs",
4021 IDENTIFIER_POINTER (DECL_NAME (field)));
4024 /* Element that is a bit-field. */
4026 HOST_WIDE_INT next_offset = int_bit_position (field);
4027 HOST_WIDE_INT end_offset
4028 = (next_offset + tree_low_cst (DECL_SIZE (field), 1));
4031 val = integer_zero_node;
4033 /* If this field does not start in this (or, next) byte,
4035 if (next_offset / BITS_PER_UNIT != total_bytes)
4037 /* Output remnant of any bit field in previous bytes. */
4038 if (byte_buffer_in_use)
4040 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4042 byte_buffer_in_use = 0;
4045 /* If still not at proper byte, advance to there. */
4046 if (next_offset / BITS_PER_UNIT != total_bytes)
4048 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
4049 total_bytes = next_offset / BITS_PER_UNIT;
4053 if (! byte_buffer_in_use)
4056 /* We must split the element into pieces that fall within
4057 separate bytes, and combine each byte with previous or
4058 following bit-fields. */
4060 /* next_offset is the offset n fbits from the beginning of
4061 the structure to the next bit of this element to be processed.
4062 end_offset is the offset of the first bit past the end of
4064 while (next_offset < end_offset)
4068 HOST_WIDE_INT value;
4069 HOST_WIDE_INT next_byte = next_offset / BITS_PER_UNIT;
4070 HOST_WIDE_INT next_bit = next_offset % BITS_PER_UNIT;
4072 /* Advance from byte to byte
4073 within this element when necessary. */
4074 while (next_byte != total_bytes)
4076 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4081 /* Number of bits we can process at once
4082 (all part of the same byte). */
4083 this_time = MIN (end_offset - next_offset,
4084 BITS_PER_UNIT - next_bit);
4085 if (BYTES_BIG_ENDIAN)
4087 /* On big-endian machine, take the most significant bits
4088 first (of the bits that are significant)
4089 and put them into bytes from the most significant end. */
4090 shift = end_offset - next_offset - this_time;
4092 /* Don't try to take a bunch of bits that cross
4093 the word boundary in the INTEGER_CST. We can
4094 only select bits from the LOW or HIGH part
4096 if (shift < HOST_BITS_PER_WIDE_INT
4097 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4099 this_time = shift + this_time - HOST_BITS_PER_WIDE_INT;
4100 shift = HOST_BITS_PER_WIDE_INT;
4103 /* Now get the bits from the appropriate constant word. */
4104 if (shift < HOST_BITS_PER_WIDE_INT)
4105 value = TREE_INT_CST_LOW (val);
4106 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4108 value = TREE_INT_CST_HIGH (val);
4109 shift -= HOST_BITS_PER_WIDE_INT;
4114 /* Get the result. This works only when:
4115 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4116 byte |= (((value >> shift)
4117 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4118 << (BITS_PER_UNIT - this_time - next_bit));
4122 /* On little-endian machines,
4123 take first the least significant bits of the value
4124 and pack them starting at the least significant
4125 bits of the bytes. */
4126 shift = next_offset - int_bit_position (field);
4128 /* Don't try to take a bunch of bits that cross
4129 the word boundary in the INTEGER_CST. We can
4130 only select bits from the LOW or HIGH part
4132 if (shift < HOST_BITS_PER_WIDE_INT
4133 && shift + this_time > HOST_BITS_PER_WIDE_INT)
4134 this_time = (HOST_BITS_PER_WIDE_INT - shift);
4136 /* Now get the bits from the appropriate constant word. */
4137 if (shift < HOST_BITS_PER_WIDE_INT)
4138 value = TREE_INT_CST_LOW (val);
4139 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
4141 value = TREE_INT_CST_HIGH (val);
4142 shift -= HOST_BITS_PER_WIDE_INT;
4147 /* Get the result. This works only when:
4148 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4149 byte |= (((value >> shift)
4150 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
4154 next_offset += this_time;
4155 byte_buffer_in_use = 1;
4160 if (byte_buffer_in_use)
4162 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4166 if ((unsigned HOST_WIDE_INT)total_bytes < size)
4167 assemble_zeros (size - total_bytes);
4170 /* This TREE_LIST contains any weak symbol declarations waiting
4172 static GTY(()) tree weak_decls;
4174 /* Mark DECL as weak. */
4177 mark_weak (tree decl)
4179 DECL_WEAK (decl) = 1;
4181 if (DECL_RTL_SET_P (decl)
4182 && MEM_P (DECL_RTL (decl))
4183 && XEXP (DECL_RTL (decl), 0)
4184 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == SYMBOL_REF)
4185 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl), 0)) = 1;
4188 /* Merge weak status between NEWDECL and OLDDECL. */
4191 merge_weak (tree newdecl, tree olddecl)
4193 if (DECL_WEAK (newdecl) == DECL_WEAK (olddecl))
4196 if (DECL_WEAK (newdecl))
4200 /* NEWDECL is weak, but OLDDECL is not. */
4202 /* If we already output the OLDDECL, we're in trouble; we can't
4203 go back and make it weak. This error cannot caught in
4204 declare_weak because the NEWDECL and OLDDECL was not yet
4205 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4206 if (TREE_ASM_WRITTEN (olddecl))
4207 error ("%Jweak declaration of %qD must precede definition",
4210 /* If we've already generated rtl referencing OLDDECL, we may
4211 have done so in a way that will not function properly with
4213 else if (TREE_USED (olddecl)
4214 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl)))
4215 warning ("%Jweak declaration of %qD after first use results "
4216 "in unspecified behavior", newdecl, newdecl);
4220 /* We put the NEWDECL on the weak_decls list at some point.
4221 Replace it with the OLDDECL. */
4222 for (wd = weak_decls; wd; wd = TREE_CHAIN (wd))
4223 if (TREE_VALUE (wd) == newdecl)
4225 TREE_VALUE (wd) = olddecl;
4228 /* We may not find the entry on the list. If NEWDECL is a
4229 weak alias, then we will have already called
4230 globalize_decl to remove the entry; in that case, we do
4231 not need to do anything. */
4234 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4235 mark_weak (olddecl);
4238 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4239 weak. Just update NEWDECL to indicate that it's weak too. */
4240 mark_weak (newdecl);
4243 /* Declare DECL to be a weak symbol. */
4246 declare_weak (tree decl)
4248 if (! TREE_PUBLIC (decl))
4249 error ("%Jweak declaration of %qD must be public", decl, decl);
4250 else if (TREE_CODE (decl) == FUNCTION_DECL && TREE_ASM_WRITTEN (decl))
4251 error ("%Jweak declaration of %qD must precede definition", decl, decl);
4252 else if (SUPPORTS_WEAK)
4254 if (! DECL_WEAK (decl))
4255 weak_decls = tree_cons (NULL, decl, weak_decls);
4258 warning ("%Jweak declaration of %qD not supported", decl, decl);
4263 /* Emit any pending weak declarations. */
4270 for (t = weak_decls; t; t = TREE_CHAIN (t))
4272 tree decl = TREE_VALUE (t);
4273 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4274 const char *const name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4277 if (! TREE_USED (decl))
4280 #ifdef ASM_WEAKEN_DECL
4281 ASM_WEAKEN_DECL (asm_out_file, decl, name, NULL);
4283 #ifdef ASM_WEAKEN_LABEL
4284 ASM_WEAKEN_LABEL (asm_out_file, name);
4286 #ifdef ASM_OUTPUT_WEAK_ALIAS
4287 warning ("only weak aliases are supported in this configuration");
4295 /* Emit the assembly bits to indicate that DECL is globally visible. */
4298 globalize_decl (tree decl)
4300 const char *name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4302 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4303 if (DECL_WEAK (decl))
4307 #ifdef ASM_WEAKEN_DECL
4308 ASM_WEAKEN_DECL (asm_out_file, decl, name, 0);
4310 ASM_WEAKEN_LABEL (asm_out_file, name);
4313 /* Remove this function from the pending weak list so that
4314 we do not emit multiple .weak directives for it. */
4315 for (p = &weak_decls; (t = *p) ; )
4317 if (DECL_ASSEMBLER_NAME (decl) == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
4318 *p = TREE_CHAIN (t);
4320 p = &TREE_CHAIN (t);
4324 #elif defined(ASM_MAKE_LABEL_LINKONCE)
4325 if (DECL_ONE_ONLY (decl))
4326 ASM_MAKE_LABEL_LINKONCE (asm_out_file, name);
4329 targetm.asm_out.globalize_label (asm_out_file, name);
4332 /* Emit an assembler directive to make the symbol for DECL an alias to
4333 the symbol for TARGET. */
4336 assemble_alias (tree decl, tree target ATTRIBUTE_UNUSED)
4340 /* We must force creation of DECL_RTL for debug info generation, even though
4341 we don't use it here. */
4342 make_decl_rtl (decl);
4344 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4346 #ifdef ASM_OUTPUT_DEF
4347 /* Make name accessible from other files, if appropriate. */
4349 if (TREE_PUBLIC (decl))
4351 globalize_decl (decl);
4352 maybe_assemble_visibility (decl);
4355 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4356 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
4358 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4360 #else /* !ASM_OUTPUT_DEF */
4361 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4362 if (DECL_WEAK (decl))
4365 #ifdef ASM_WEAKEN_DECL
4366 ASM_WEAKEN_DECL (asm_out_file, decl, name, IDENTIFIER_POINTER (target));
4368 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
4370 /* Remove this function from the pending weak list so that
4371 we do not emit multiple .weak directives for it. */
4372 for (p = &weak_decls; (t = *p) ; )
4373 if (DECL_ASSEMBLER_NAME (decl)
4374 == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
4375 *p = TREE_CHAIN (t);
4377 p = &TREE_CHAIN (t);
4380 warning ("only weak aliases are supported in this configuration");
4383 warning ("alias definitions not supported in this configuration; ignored");
4387 TREE_USED (decl) = 1;
4388 TREE_ASM_WRITTEN (decl) = 1;
4389 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl)) = 1;
4392 /* Emit an assembler directive to set symbol for DECL visibility to
4393 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4396 default_assemble_visibility (tree decl, int vis)
4398 static const char * const visibility_types[] = {
4399 NULL, "internal", "hidden", "protected"
4402 const char *name, *type;
4404 name = (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
4405 type = visibility_types[vis];
4407 #ifdef HAVE_GAS_HIDDEN
4408 fprintf (asm_out_file, "\t.%s\t", type);
4409 assemble_name (asm_out_file, name);
4410 fprintf (asm_out_file, "\n");
4412 warning ("visibility attribute not supported in this configuration; ignored");
4416 /* A helper function to call assemble_visibility when needed for a decl. */
4419 maybe_assemble_visibility (tree decl)
4421 enum symbol_visibility vis = DECL_VISIBILITY (decl);
4423 if (vis != VISIBILITY_DEFAULT)
4424 targetm.asm_out.visibility (decl, vis);
4427 /* Returns 1 if the target configuration supports defining public symbols
4428 so that one of them will be chosen at link time instead of generating a
4429 multiply-defined symbol error, whether through the use of weak symbols or
4430 a target-specific mechanism for having duplicates discarded. */
4433 supports_one_only (void)
4435 if (SUPPORTS_ONE_ONLY)
4437 return SUPPORTS_WEAK;
4440 /* Set up DECL as a public symbol that can be defined in multiple
4441 translation units without generating a linker error. */
4444 make_decl_one_only (tree decl)
4446 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL)
4449 TREE_PUBLIC (decl) = 1;
4451 if (SUPPORTS_ONE_ONLY)
4453 #ifdef MAKE_DECL_ONE_ONLY
4454 MAKE_DECL_ONE_ONLY (decl);
4456 DECL_ONE_ONLY (decl) = 1;
4458 else if (TREE_CODE (decl) == VAR_DECL
4459 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
4460 DECL_COMMON (decl) = 1;
4461 else if (SUPPORTS_WEAK)
4462 DECL_WEAK (decl) = 1;
4468 init_varasm_once (void)
4470 in_named_htab = htab_create_ggc (31, in_named_entry_hash,
4471 in_named_entry_eq, NULL);
4472 const_desc_htab = htab_create_ggc (1009, const_desc_hash,
4473 const_desc_eq, NULL);
4475 const_alias_set = new_alias_set ();
4478 static enum tls_model
4479 decl_tls_model (tree decl)
4481 enum tls_model kind;
4482 tree attr = lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl));
4487 attr = TREE_VALUE (TREE_VALUE (attr));
4488 if (TREE_CODE (attr) != STRING_CST)
4490 if (!strcmp (TREE_STRING_POINTER (attr), "local-exec"))
4491 kind = TLS_MODEL_LOCAL_EXEC;
4492 else if (!strcmp (TREE_STRING_POINTER (attr), "initial-exec"))
4493 kind = TLS_MODEL_INITIAL_EXEC;
4494 else if (!strcmp (TREE_STRING_POINTER (attr), "local-dynamic"))
4495 kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
4496 else if (!strcmp (TREE_STRING_POINTER (attr), "global-dynamic"))
4497 kind = TLS_MODEL_GLOBAL_DYNAMIC;
4503 is_local = targetm.binds_local_p (decl);
4507 kind = TLS_MODEL_LOCAL_EXEC;
4509 kind = TLS_MODEL_INITIAL_EXEC;
4511 /* Local dynamic is inefficient when we're not combining the
4512 parts of the address. */
4513 else if (optimize && is_local)
4514 kind = TLS_MODEL_LOCAL_DYNAMIC;
4516 kind = TLS_MODEL_GLOBAL_DYNAMIC;
4517 if (kind < flag_tls_default)
4518 kind = flag_tls_default;
4523 /* Select a set of attributes for section NAME based on the properties
4524 of DECL and whether or not RELOC indicates that DECL's initializer
4525 might contain runtime relocations.
4527 We make the section read-only and executable for a function decl,
4528 read-only for a const data decl, and writable for a non-const data decl. */
4531 default_section_type_flags (tree decl, const char *name, int reloc)
4533 return default_section_type_flags_1 (decl, name, reloc, flag_pic);
4537 default_section_type_flags_1 (tree decl, const char *name, int reloc,
4542 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
4543 flags = SECTION_CODE;
4544 else if (decl && decl_readonly_section_1 (decl, reloc, shlib))
4546 else if (unlikely_text_section_name
4547 && strcmp (name, unlikely_text_section_name) == 0)
4548 flags = SECTION_CODE;
4550 flags = SECTION_WRITE;
4552 if (decl && DECL_ONE_ONLY (decl))
4553 flags |= SECTION_LINKONCE;
4555 if (decl && TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4556 flags |= SECTION_TLS | SECTION_WRITE;
4558 if (strcmp (name, ".bss") == 0
4559 || strncmp (name, ".bss.", 5) == 0
4560 || strncmp (name, ".gnu.linkonce.b.", 16) == 0
4561 || strcmp (name, ".sbss") == 0
4562 || strncmp (name, ".sbss.", 6) == 0
4563 || strncmp (name, ".gnu.linkonce.sb.", 17) == 0
4564 || strcmp (name, ".tbss") == 0
4565 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4566 flags |= SECTION_BSS;
4568 if (strcmp (name, ".tdata") == 0
4569 || strcmp (name, ".tbss") == 0
4570 || strncmp (name, ".gnu.linkonce.td.", 17) == 0
4571 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4572 flags |= SECTION_TLS;
4574 /* These three sections have special ELF types. They are neither
4575 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4576 want to print a section type (@progbits or @nobits). If someone
4577 is silly enough to emit code or TLS variables to one of these
4578 sections, then don't handle them specially. */
4579 if (!(flags & (SECTION_CODE | SECTION_BSS | SECTION_TLS))
4580 && (strcmp (name, ".init_array") == 0
4581 || strcmp (name, ".fini_array") == 0
4582 || strcmp (name, ".preinit_array") == 0))
4583 flags |= SECTION_NOTYPE;
4588 /* Output assembly to switch to section NAME with attribute FLAGS.
4589 Four variants for common object file formats. */
4592 default_no_named_section (const char *name ATTRIBUTE_UNUSED,
4593 unsigned int flags ATTRIBUTE_UNUSED,
4594 tree decl ATTRIBUTE_UNUSED)
4596 /* Some object formats don't support named sections at all. The
4597 front-end should already have flagged this as an error. */
4602 default_elf_asm_named_section (const char *name, unsigned int flags,
4603 tree decl ATTRIBUTE_UNUSED)
4605 char flagchars[10], *f = flagchars;
4607 /* If we have already declared this section, we can use an
4608 abbreviated form to switch back to it -- unless this section is
4609 part of a COMDAT groups, in which case GAS requires the full
4610 declaration every time. */
4611 if (!(HAVE_GAS_COMDAT_GROUP && (flags & SECTION_LINKONCE))
4612 && ! named_section_first_declaration (name))
4614 fprintf (asm_out_file, "\t.section\t%s\n", name);
4618 if (!(flags & SECTION_DEBUG))
4620 if (flags & SECTION_WRITE)
4622 if (flags & SECTION_CODE)
4624 if (flags & SECTION_SMALL)
4626 if (flags & SECTION_MERGE)
4628 if (flags & SECTION_STRINGS)
4630 if (flags & SECTION_TLS)
4632 if (HAVE_GAS_COMDAT_GROUP && (flags & SECTION_LINKONCE))
4636 fprintf (asm_out_file, "\t.section\t%s,\"%s\"", name, flagchars);
4638 if (!(flags & SECTION_NOTYPE))
4643 if (flags & SECTION_BSS)
4649 #ifdef ASM_COMMENT_START
4650 /* On platforms that use "@" as the assembly comment character,
4652 if (strcmp (ASM_COMMENT_START, "@") == 0)
4655 fprintf (asm_out_file, format, type);
4657 if (flags & SECTION_ENTSIZE)
4658 fprintf (asm_out_file, ",%d", flags & SECTION_ENTSIZE);
4659 if (HAVE_GAS_COMDAT_GROUP && (flags & SECTION_LINKONCE))
4660 fprintf (asm_out_file, ",%s,comdat",
4661 lang_hooks.decls.comdat_group (decl));
4664 putc ('\n', asm_out_file);
4668 default_coff_asm_named_section (const char *name, unsigned int flags,
4669 tree decl ATTRIBUTE_UNUSED)
4671 char flagchars[8], *f = flagchars;
4673 if (flags & SECTION_WRITE)
4675 if (flags & SECTION_CODE)
4679 fprintf (asm_out_file, "\t.section\t%s,\"%s\"\n", name, flagchars);
4683 default_pe_asm_named_section (const char *name, unsigned int flags,
4686 default_coff_asm_named_section (name, flags, decl);
4688 if (flags & SECTION_LINKONCE)
4690 /* Functions may have been compiled at various levels of
4691 optimization so we can't use `same_size' here.
4692 Instead, have the linker pick one. */
4693 fprintf (asm_out_file, "\t.linkonce %s\n",
4694 (flags & SECTION_CODE ? "discard" : "same_size"));
4698 /* The lame default section selector. */
4701 default_select_section (tree decl, int reloc,
4702 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED)
4704 bool readonly = false;
4708 if (decl_readonly_section (decl, reloc))
4711 else if (TREE_CODE (decl) == CONSTRUCTOR)
4713 if (! ((flag_pic && reloc)
4714 || !TREE_READONLY (decl)
4715 || TREE_SIDE_EFFECTS (decl)
4716 || !TREE_CONSTANT (decl)))
4719 else if (TREE_CODE (decl) == STRING_CST)
4721 else if (! (flag_pic && reloc))
4725 readonly_data_section ();
4730 /* A helper function for default_elf_select_section and
4731 default_elf_unique_section. Categorizes the DECL. */
4733 enum section_category
4738 SECCAT_RODATA_MERGE_STR,
4739 SECCAT_RODATA_MERGE_STR_INIT,
4740 SECCAT_RODATA_MERGE_CONST,
4745 /* To optimize loading of shared programs, define following subsections
4747 _REL Contains data that has relocations, so they get grouped
4748 together and dynamic linker will visit fewer pages in memory.
4749 _RO Contains data that is otherwise read-only. This is useful
4750 with prelinking as most relocations won't be dynamically
4751 linked and thus stay read only.
4752 _LOCAL Marks data containing relocations only to local objects.
4753 These relocations will get fully resolved by prelinking. */
4755 SECCAT_DATA_REL_LOCAL,
4757 SECCAT_DATA_REL_RO_LOCAL,
4767 static enum section_category
4768 categorize_decl_for_section (tree, int, int);
4770 static enum section_category
4771 categorize_decl_for_section (tree decl, int reloc, int shlib)
4773 enum section_category ret;
4775 if (TREE_CODE (decl) == FUNCTION_DECL)
4777 else if (TREE_CODE (decl) == STRING_CST)
4779 if (flag_mudflap) /* or !flag_merge_constants */
4780 return SECCAT_RODATA;
4782 return SECCAT_RODATA_MERGE_STR;
4784 else if (TREE_CODE (decl) == VAR_DECL)
4786 if (DECL_INITIAL (decl) == NULL
4787 || DECL_INITIAL (decl) == error_mark_node
4788 || (flag_zero_initialized_in_bss
4789 /* Leave constant zeroes in .rodata so they can be shared. */
4790 && !TREE_READONLY (decl)
4791 && initializer_zerop (DECL_INITIAL (decl))))
4793 else if (! TREE_READONLY (decl)
4794 || TREE_SIDE_EFFECTS (decl)
4795 || ! TREE_CONSTANT (DECL_INITIAL (decl)))
4797 if (shlib && (reloc & 2))
4798 ret = SECCAT_DATA_REL;
4799 else if (shlib && reloc)
4800 ret = SECCAT_DATA_REL_LOCAL;
4804 else if (shlib && (reloc & 2))
4805 ret = SECCAT_DATA_REL_RO;
4806 else if (shlib && reloc)
4807 ret = SECCAT_DATA_REL_RO_LOCAL;
4808 else if (reloc || flag_merge_constants < 2)
4809 /* C and C++ don't allow different variables to share the same
4810 location. -fmerge-all-constants allows even that (at the
4811 expense of not conforming). */
4812 ret = SECCAT_RODATA;
4813 else if (TREE_CODE (DECL_INITIAL (decl)) == STRING_CST)
4814 ret = SECCAT_RODATA_MERGE_STR_INIT;
4816 ret = SECCAT_RODATA_MERGE_CONST;
4818 else if (TREE_CODE (decl) == CONSTRUCTOR)
4820 if ((shlib && reloc)
4821 || TREE_SIDE_EFFECTS (decl)
4822 || ! TREE_CONSTANT (decl))
4825 ret = SECCAT_RODATA;
4828 ret = SECCAT_RODATA;
4830 /* There are no read-only thread-local sections. */
4831 if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4833 /* Note that this would be *just* SECCAT_BSS, except that there's
4834 no concept of a read-only thread-local-data section. */
4835 if (ret == SECCAT_BSS
4836 || (flag_zero_initialized_in_bss
4837 && initializer_zerop (DECL_INITIAL (decl))))
4843 /* If the target uses small data sections, select it. */
4844 else if (targetm.in_small_data_p (decl))
4846 if (ret == SECCAT_BSS)
4848 else if (targetm.have_srodata_section && ret == SECCAT_RODATA)
4849 ret = SECCAT_SRODATA;
4858 decl_readonly_section (tree decl, int reloc)
4860 return decl_readonly_section_1 (decl, reloc, flag_pic);
4864 decl_readonly_section_1 (tree decl, int reloc, int shlib)
4866 switch (categorize_decl_for_section (decl, reloc, shlib))
4869 case SECCAT_RODATA_MERGE_STR:
4870 case SECCAT_RODATA_MERGE_STR_INIT:
4871 case SECCAT_RODATA_MERGE_CONST:
4872 case SECCAT_SRODATA:
4881 /* Select a section based on the above categorization. */
4884 default_elf_select_section (tree decl, int reloc,
4885 unsigned HOST_WIDE_INT align)
4887 default_elf_select_section_1 (decl, reloc, align, flag_pic);
4891 default_elf_select_section_1 (tree decl, int reloc,
4892 unsigned HOST_WIDE_INT align, int shlib)
4895 switch (categorize_decl_for_section (decl, reloc, shlib))
4898 /* We're not supposed to be called on FUNCTION_DECLs. */
4901 readonly_data_section ();
4903 case SECCAT_RODATA_MERGE_STR:
4904 mergeable_string_section (decl, align, 0);
4906 case SECCAT_RODATA_MERGE_STR_INIT:
4907 mergeable_string_section (DECL_INITIAL (decl), align, 0);
4909 case SECCAT_RODATA_MERGE_CONST:
4910 mergeable_constant_section (DECL_MODE (decl), align, 0);
4912 case SECCAT_SRODATA:
4918 case SECCAT_DATA_REL:
4919 sname = ".data.rel";
4921 case SECCAT_DATA_REL_LOCAL:
4922 sname = ".data.rel.local";
4924 case SECCAT_DATA_REL_RO:
4925 sname = ".data.rel.ro";
4927 case SECCAT_DATA_REL_RO_LOCAL:
4928 sname = ".data.rel.ro.local";
4937 #ifdef BSS_SECTION_ASM_OP
4956 named_section (decl, sname, reloc);
4959 /* Construct a unique section name based on the decl name and the
4960 categorization performed above. */
4963 default_unique_section (tree decl, int reloc)
4965 default_unique_section_1 (decl, reloc, flag_pic);
4969 default_unique_section_1 (tree decl, int reloc, int shlib)
4971 bool one_only = DECL_ONE_ONLY (decl);
4972 const char *prefix, *name;
4976 switch (categorize_decl_for_section (decl, reloc, shlib))
4979 prefix = one_only ? ".gnu.linkonce.t." : ".text.";
4982 case SECCAT_RODATA_MERGE_STR:
4983 case SECCAT_RODATA_MERGE_STR_INIT:
4984 case SECCAT_RODATA_MERGE_CONST:
4985 prefix = one_only ? ".gnu.linkonce.r." : ".rodata.";
4987 case SECCAT_SRODATA:
4988 prefix = one_only ? ".gnu.linkonce.s2." : ".sdata2.";
4991 case SECCAT_DATA_REL:
4992 case SECCAT_DATA_REL_LOCAL:
4993 case SECCAT_DATA_REL_RO:
4994 case SECCAT_DATA_REL_RO_LOCAL:
4995 prefix = one_only ? ".gnu.linkonce.d." : ".data.";
4998 prefix = one_only ? ".gnu.linkonce.s." : ".sdata.";
5001 prefix = one_only ? ".gnu.linkonce.b." : ".bss.";
5004 prefix = one_only ? ".gnu.linkonce.sb." : ".sbss.";
5007 prefix = one_only ? ".gnu.linkonce.td." : ".tdata.";
5010 prefix = one_only ? ".gnu.linkonce.tb." : ".tbss.";
5015 plen = strlen (prefix);
5017 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
5018 name = targetm.strip_name_encoding (name);
5019 nlen = strlen (name);
5021 string = alloca (nlen + plen + 1);
5022 memcpy (string, prefix, plen);
5023 memcpy (string + plen, name, nlen + 1);
5025 DECL_SECTION_NAME (decl) = build_string (nlen + plen, string);
5029 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED,
5031 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED)
5034 switch (GET_CODE (x))
5046 readonly_data_section ();
5050 default_elf_select_rtx_section (enum machine_mode mode, rtx x,
5051 unsigned HOST_WIDE_INT align)
5053 /* ??? Handle small data here somehow. */
5056 switch (GET_CODE (x))
5060 named_section (NULL_TREE, ".data.rel.ro", 3);
5064 named_section (NULL_TREE, ".data.rel.ro.local", 1);
5071 mergeable_constant_section (mode, align, 0);
5074 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
5077 default_encode_section_info (tree decl, rtx rtl, int first ATTRIBUTE_UNUSED)
5082 /* Careful not to prod global register variables. */
5085 symbol = XEXP (rtl, 0);
5086 if (GET_CODE (symbol) != SYMBOL_REF)
5090 if (TREE_CODE (decl) == FUNCTION_DECL)
5091 flags |= SYMBOL_FLAG_FUNCTION;
5092 if (targetm.binds_local_p (decl))
5093 flags |= SYMBOL_FLAG_LOCAL;
5094 if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
5095 flags |= decl_tls_model (decl) << SYMBOL_FLAG_TLS_SHIFT;
5096 else if (targetm.in_small_data_p (decl))
5097 flags |= SYMBOL_FLAG_SMALL;
5098 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
5099 being PUBLIC, the thing *must* be defined in this translation unit.
5100 Prevent this buglet from being propagated into rtl code as well. */
5101 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
5102 flags |= SYMBOL_FLAG_EXTERNAL;
5104 SYMBOL_REF_FLAGS (symbol) = flags;
5107 /* By default, we do nothing for encode_section_info, so we need not
5108 do anything but discard the '*' marker. */
5111 default_strip_name_encoding (const char *str)
5113 return str + (*str == '*');
5116 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5117 wrt cross-module name binding. */
5120 default_binds_local_p (tree exp)
5122 return default_binds_local_p_1 (exp, flag_shlib);
5126 default_binds_local_p_1 (tree exp, int shlib)
5130 /* A non-decl is an entry in the constant pool. */
5133 /* Static variables are always local. */
5134 else if (! TREE_PUBLIC (exp))
5136 /* A variable is local if the user explicitly tells us so. */
5137 else if (DECL_VISIBILITY_SPECIFIED (exp) && DECL_VISIBILITY (exp) != VISIBILITY_DEFAULT)
5139 /* Otherwise, variables defined outside this object may not be local. */
5140 else if (DECL_EXTERNAL (exp))
5142 /* Linkonce and weak data are never local. */
5143 else if (DECL_ONE_ONLY (exp) || DECL_WEAK (exp))
5145 /* If none of the above and visibility is not default, make local. */
5146 else if (DECL_VISIBILITY (exp) != VISIBILITY_DEFAULT)
5148 /* If PIC, then assume that any global name can be overridden by
5149 symbols resolved from other modules. */
5152 /* Uninitialized COMMON variable may be unified with symbols
5153 resolved from other modules. */
5154 else if (DECL_COMMON (exp)
5155 && (DECL_INITIAL (exp) == NULL
5156 || DECL_INITIAL (exp) == error_mark_node))
5158 /* Otherwise we're left with initialized (or non-common) global data
5159 which is of necessity defined locally. */
5166 /* Determine whether or not a pointer mode is valid. Assume defaults
5167 of ptr_mode or Pmode - can be overridden. */
5169 default_valid_pointer_mode (enum machine_mode mode)
5171 return (mode == ptr_mode || mode == Pmode);
5174 /* Default function to output code that will globalize a label. A
5175 target must define GLOBAL_ASM_OP or provide it's own function to
5176 globalize a label. */
5177 #ifdef GLOBAL_ASM_OP
5179 default_globalize_label (FILE * stream, const char *name)
5181 fputs (GLOBAL_ASM_OP, stream);
5182 assemble_name (stream, name);
5183 putc ('\n', stream);
5185 #endif /* GLOBAL_ASM_OP */
5187 /* Default function to output a label for unwind information. The
5188 default is to do nothing. A target that needs nonlocal labels for
5189 unwind information must provide its own function to do this. */
5191 default_emit_unwind_label (FILE * stream ATTRIBUTE_UNUSED,
5192 tree decl ATTRIBUTE_UNUSED,
5193 int for_eh ATTRIBUTE_UNUSED,
5194 int empty ATTRIBUTE_UNUSED)
5198 /* This is how to output an internal numbered label where PREFIX is
5199 the class of label and LABELNO is the number within the class. */
5202 default_internal_label (FILE *stream, const char *prefix,
5203 unsigned long labelno)
5205 char *const buf = alloca (40 + strlen (prefix));
5206 ASM_GENERATE_INTERNAL_LABEL (buf, prefix, labelno);
5207 ASM_OUTPUT_LABEL (stream, buf);
5210 /* This is the default behavior at the beginning of a file. It's
5211 controlled by two other target-hook toggles. */
5213 default_file_start (void)
5215 if (targetm.file_start_app_off && !flag_verbose_asm)
5216 fputs (ASM_APP_OFF, asm_out_file);
5218 if (targetm.file_start_file_directive)
5219 output_file_directive (asm_out_file, main_input_filename);
5222 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5223 which emits a special section directive used to indicate whether or
5224 not this object file needs an executable stack. This is primarily
5225 a GNU extension to ELF but could be used on other targets. */
5227 int trampolines_created;
5230 file_end_indicate_exec_stack (void)
5232 unsigned int flags = SECTION_DEBUG;
5233 if (trampolines_created)
5234 flags |= SECTION_CODE;
5236 named_section_flags (".note.GNU-stack", flags);
5239 #include "gt-varasm.h"