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"
52 #include "cfglayout.h"
54 #ifdef XCOFF_DEBUGGING_INFO
55 #include "xcoffout.h" /* Needed for external data
56 declarations for e.g. AIX 4.x. */
59 #ifndef TRAMPOLINE_ALIGNMENT
60 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
64 #define ASM_STABS_OP "\t.stabs\t"
67 /* The (assembler) name of the first globally-visible object output. */
68 const char *first_global_object_name;
69 const char *weak_global_object_name;
72 struct constant_descriptor_rtx;
73 struct rtx_constant_pool;
75 struct varasm_status GTY(())
77 /* If we're using a per-function constant pool, this is it. */
78 struct rtx_constant_pool *pool;
80 /* Number of tree-constants deferred during the expansion of this
82 unsigned int deferred_constants;
85 #define n_deferred_constants (cfun->varasm->deferred_constants)
87 /* Number for making the label on the next
88 constant that is stored in memory. */
90 static GTY(()) int const_labelno;
92 /* Carry information from ASM_DECLARE_OBJECT_NAME
93 to ASM_FINISH_DECLARE_OBJECT. */
95 int size_directive_output;
97 /* The last decl for which assemble_variable was called,
98 if it did ASM_DECLARE_OBJECT_NAME.
99 If the last call to assemble_variable didn't do that,
102 tree last_assemble_variable_decl;
104 /* The following global variable indicates if the section label for the
105 "cold" section of code has been output yet to the assembler. The
106 label is useful when running gdb. This is part of the optimization that
107 partitions hot and cold basic blocks into separate sections of the .o
110 bool unlikely_section_label_printed = false;
112 /* RTX_UNCHANGING_P in a MEM can mean it is stored into, for initialization.
113 So giving constant the alias set for the type will allow such
114 initializations to appear to conflict with the load of the constant. We
115 avoid this by giving all constants an alias set for just constants.
116 Since there will be no stores to that alias set, nothing will ever
117 conflict with them. */
119 static HOST_WIDE_INT const_alias_set;
121 static const char *strip_reg_name (const char *);
122 static int contains_pointers_p (tree);
123 #ifdef ASM_OUTPUT_EXTERNAL
124 static bool incorporeal_function_p (tree);
126 static void decode_addr_const (tree, struct addr_const *);
127 static hashval_t const_desc_hash (const void *);
128 static int const_desc_eq (const void *, const void *);
129 static hashval_t const_hash_1 (const tree);
130 static int compare_constant (const tree, const tree);
131 static tree copy_constant (tree);
132 static void output_constant_def_contents (rtx);
133 static void output_addressed_constants (tree);
134 static unsigned HOST_WIDE_INT array_size_for_constructor (tree);
135 static unsigned min_align (unsigned, unsigned);
136 static void output_constructor (tree, unsigned HOST_WIDE_INT, unsigned int);
137 static void globalize_decl (tree);
138 static void maybe_assemble_visibility (tree);
139 static int in_named_entry_eq (const void *, const void *);
140 static hashval_t in_named_entry_hash (const void *);
141 #ifdef ASM_OUTPUT_BSS
142 static void asm_output_bss (FILE *, tree, const char *,
143 unsigned HOST_WIDE_INT, unsigned HOST_WIDE_INT);
145 #ifdef BSS_SECTION_ASM_OP
146 #ifdef ASM_OUTPUT_ALIGNED_BSS
147 static void asm_output_aligned_bss (FILE *, tree, const char *,
148 unsigned HOST_WIDE_INT, int)
151 #endif /* BSS_SECTION_ASM_OP */
152 static bool asm_emit_uninitialised (tree, const char*,
153 unsigned HOST_WIDE_INT,
154 unsigned HOST_WIDE_INT);
155 static void mark_weak (tree);
157 enum in_section { no_section, in_text, in_unlikely_executed_text, in_data,
159 #ifdef BSS_SECTION_ASM_OP
162 #ifdef CTORS_SECTION_ASM_OP
165 #ifdef DTORS_SECTION_ASM_OP
168 #ifdef READONLY_DATA_SECTION_ASM_OP
171 #ifdef EXTRA_SECTIONS
175 static GTY(()) enum in_section in_section = no_section;
177 /* Return a nonzero value if DECL has a section attribute. */
178 #ifndef IN_NAMED_SECTION
179 #define IN_NAMED_SECTION(DECL) \
180 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
181 && DECL_SECTION_NAME (DECL) != NULL_TREE)
184 /* Text of section name when in_section == in_named. */
185 static GTY(()) const char *in_named_name;
187 /* Hash table of flags that have been used for a particular named section. */
189 struct in_named_entry GTY(())
196 static GTY((param_is (struct in_named_entry))) htab_t in_named_htab;
198 /* Define functions like text_section for any extra sections. */
199 #ifdef EXTRA_SECTION_FUNCTIONS
200 EXTRA_SECTION_FUNCTIONS
203 /* Tell assembler to switch to text section. */
208 if (in_section != in_text)
210 in_section = in_text;
211 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
212 ASM_OUTPUT_ALIGN (asm_out_file, 2);
216 /* Tell assembler to switch to unlikely-to-be-executed text section. */
219 unlikely_text_section (void)
221 if ((in_section != in_unlikely_executed_text)
222 && (in_section != in_named
223 || strcmp (in_named_name, UNLIKELY_EXECUTED_TEXT_SECTION_NAME) != 0))
225 if (targetm.have_named_sections)
226 named_section (NULL_TREE, UNLIKELY_EXECUTED_TEXT_SECTION_NAME, 0);
229 in_section = in_unlikely_executed_text;
230 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
231 ASM_OUTPUT_ALIGN (asm_out_file, 2);
234 if (!unlikely_section_label_printed)
236 fprintf (asm_out_file, "__%s_unlikely_section:\n",
237 current_function_name ());
238 unlikely_section_label_printed = true;
243 /* Tell assembler to switch to data section. */
248 if (in_section != in_data)
250 in_section = in_data;
251 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
255 /* Tell assembler to switch to read-only data section. This is normally
259 readonly_data_section (void)
261 #ifdef READONLY_DATA_SECTION
262 READONLY_DATA_SECTION (); /* Note this can call data_section. */
264 #ifdef READONLY_DATA_SECTION_ASM_OP
265 if (in_section != in_readonly_data)
267 in_section = in_readonly_data;
268 fputs (READONLY_DATA_SECTION_ASM_OP, asm_out_file);
269 fputc ('\n', asm_out_file);
277 /* Determine if we're in the text section. */
280 in_text_section (void)
282 return in_section == in_text;
285 /* Determine if we're in the unlikely-to-be-executed text section. */
288 in_unlikely_text_section (void)
290 return in_section == in_unlikely_executed_text;
293 /* Determine if we're in the data section. */
296 in_data_section (void)
298 return in_section == in_data;
301 /* Helper routines for maintaining in_named_htab. */
304 in_named_entry_eq (const void *p1, const void *p2)
306 const struct in_named_entry *old = p1;
307 const char *new = p2;
309 return strcmp (old->name, new) == 0;
313 in_named_entry_hash (const void *p)
315 const struct in_named_entry *old = p;
316 return htab_hash_string (old->name);
319 /* If SECTION has been seen before as a named section, return the flags
320 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
321 set of flags for a section to have, so 0 does not mean that the section
322 has not been seen. */
325 get_named_section_flags (const char *section)
327 struct in_named_entry **slot;
329 slot = (struct in_named_entry **)
330 htab_find_slot_with_hash (in_named_htab, section,
331 htab_hash_string (section), NO_INSERT);
333 return slot ? (*slot)->flags : 0;
336 /* Returns true if the section has been declared before. Sets internal
337 flag on this section in in_named_hash so subsequent calls on this
338 section will return false. */
341 named_section_first_declaration (const char *name)
343 struct in_named_entry **slot;
345 slot = (struct in_named_entry **)
346 htab_find_slot_with_hash (in_named_htab, name,
347 htab_hash_string (name), NO_INSERT);
348 if (! (*slot)->declared)
350 (*slot)->declared = true;
360 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
361 different set of flags, return false. */
364 set_named_section_flags (const char *section, unsigned int flags)
366 struct in_named_entry **slot, *entry;
368 slot = (struct in_named_entry **)
369 htab_find_slot_with_hash (in_named_htab, section,
370 htab_hash_string (section), INSERT);
375 entry = ggc_alloc (sizeof (*entry));
377 entry->name = ggc_strdup (section);
378 entry->flags = flags;
379 entry->declared = false;
381 else if (entry->flags != flags)
387 /* Tell assembler to change to section NAME with attributes FLAGS. */
390 named_section_flags (const char *name, unsigned int flags)
392 if (in_section != in_named || strcmp (name, in_named_name) != 0)
394 if (! set_named_section_flags (name, flags))
397 targetm.asm_out.named_section (name, flags);
399 if (flags & SECTION_FORGET)
400 in_section = no_section;
403 in_named_name = ggc_strdup (name);
404 in_section = in_named;
409 /* Tell assembler to change to section NAME for DECL.
410 If DECL is NULL, just switch to section NAME.
411 If NAME is NULL, get the name from DECL.
412 If RELOC is 1, the initializer for DECL contains relocs. */
415 named_section (tree decl, const char *name, int reloc)
419 if (decl != NULL_TREE && !DECL_P (decl))
422 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
424 flags = targetm.section_type_flags (decl, name, reloc);
426 /* Sanity check user variables for flag changes. Non-user
427 section flag changes will abort in named_section_flags.
428 However, don't complain if SECTION_OVERRIDE is set.
429 We trust that the setter knows that it is safe to ignore
430 the default flags for this decl. */
431 if (decl && ! set_named_section_flags (name, flags))
433 flags = get_named_section_flags (name);
434 if ((flags & SECTION_OVERRIDE) == 0)
435 error ("%J%D causes a section type conflict", decl, decl);
438 named_section_flags (name, flags);
441 /* If required, set DECL_SECTION_NAME to a unique name. */
444 resolve_unique_section (tree decl, int reloc ATTRIBUTE_UNUSED,
445 int flag_function_or_data_sections)
447 if (DECL_SECTION_NAME (decl) == NULL_TREE
448 && targetm.have_named_sections
449 && (flag_function_or_data_sections
450 || DECL_ONE_ONLY (decl)))
451 targetm.asm_out.unique_section (decl, reloc);
454 #ifdef BSS_SECTION_ASM_OP
456 /* Tell the assembler to switch to the bss section. */
461 if (in_section != in_bss)
463 fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP);
468 #ifdef ASM_OUTPUT_BSS
470 /* Utility function for ASM_OUTPUT_BSS for targets to use if
471 they don't support alignments in .bss.
472 ??? It is believed that this function will work in most cases so such
473 support is localized here. */
476 asm_output_bss (FILE *file, tree decl ATTRIBUTE_UNUSED,
478 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
479 unsigned HOST_WIDE_INT rounded)
481 targetm.asm_out.globalize_label (file, name);
483 #ifdef ASM_DECLARE_OBJECT_NAME
484 last_assemble_variable_decl = decl;
485 ASM_DECLARE_OBJECT_NAME (file, name, decl);
487 /* Standard thing is just output label for the object. */
488 ASM_OUTPUT_LABEL (file, name);
489 #endif /* ASM_DECLARE_OBJECT_NAME */
490 ASM_OUTPUT_SKIP (file, rounded ? rounded : 1);
495 #ifdef ASM_OUTPUT_ALIGNED_BSS
497 /* Utility function for targets to use in implementing
498 ASM_OUTPUT_ALIGNED_BSS.
499 ??? It is believed that this function will work in most cases so such
500 support is localized here. */
503 asm_output_aligned_bss (FILE *file, tree decl ATTRIBUTE_UNUSED,
504 const char *name, unsigned HOST_WIDE_INT size,
508 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
509 #ifdef ASM_DECLARE_OBJECT_NAME
510 last_assemble_variable_decl = decl;
511 ASM_DECLARE_OBJECT_NAME (file, name, decl);
513 /* Standard thing is just output label for the object. */
514 ASM_OUTPUT_LABEL (file, name);
515 #endif /* ASM_DECLARE_OBJECT_NAME */
516 ASM_OUTPUT_SKIP (file, size ? size : 1);
521 #endif /* BSS_SECTION_ASM_OP */
523 /* Switch to the section for function DECL.
525 If DECL is NULL_TREE, switch to the text section.
526 ??? It's not clear that we will ever be passed NULL_TREE, but it's
527 safer to handle it. */
530 function_section (tree decl)
532 if (scan_ahead_for_unlikely_executed_note (get_insns()))
533 unlikely_text_section ();
536 if (decl != NULL_TREE
537 && DECL_SECTION_NAME (decl) != NULL_TREE)
538 named_section (decl, (char *) 0, 0);
544 /* Switch to section for variable DECL. RELOC is the same as the
545 argument to SELECT_SECTION. */
548 variable_section (tree decl, int reloc)
550 if (IN_NAMED_SECTION (decl))
551 named_section (decl, NULL, reloc);
553 targetm.asm_out.select_section (decl, reloc, DECL_ALIGN (decl));
556 /* Tell assembler to switch to the section for string merging. */
559 mergeable_string_section (tree decl ATTRIBUTE_UNUSED,
560 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED,
561 unsigned int flags ATTRIBUTE_UNUSED)
563 if (HAVE_GAS_SHF_MERGE && flag_merge_constants
564 && TREE_CODE (decl) == STRING_CST
565 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
567 && TREE_STRING_LENGTH (decl) >= int_size_in_bytes (TREE_TYPE (decl)))
569 enum machine_mode mode;
570 unsigned int modesize;
575 mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (decl)));
576 modesize = GET_MODE_BITSIZE (mode);
577 if (modesize >= 8 && modesize <= 256
578 && (modesize & (modesize - 1)) == 0)
580 if (align < modesize)
583 str = TREE_STRING_POINTER (decl);
584 len = TREE_STRING_LENGTH (decl);
585 unit = GET_MODE_SIZE (mode);
587 /* Check for embedded NUL characters. */
588 for (i = 0; i < len; i += unit)
590 for (j = 0; j < unit; j++)
591 if (str[i + j] != '\0')
598 sprintf (name, ".rodata.str%d.%d", modesize / 8,
600 flags |= (modesize / 8) | SECTION_MERGE | SECTION_STRINGS;
601 if (!i && modesize < align)
603 /* A "" string with requested alignment greater than
604 character size might cause a problem:
605 if some other string required even bigger
606 alignment than "", then linker might think the
607 "" is just part of padding after some other string
608 and not put it into the hash table initially.
609 But this means "" could have smaller alignment
611 #ifdef ASM_OUTPUT_SECTION_START
612 named_section_flags (name, flags);
613 ASM_OUTPUT_SECTION_START (asm_out_file);
615 readonly_data_section ();
620 named_section_flags (name, flags);
626 readonly_data_section ();
629 /* Tell assembler to switch to the section for constant merging. */
632 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED,
633 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED,
634 unsigned int flags ATTRIBUTE_UNUSED)
636 unsigned int modesize = GET_MODE_BITSIZE (mode);
638 if (HAVE_GAS_SHF_MERGE && flag_merge_constants
644 && (align & (align - 1)) == 0)
648 sprintf (name, ".rodata.cst%d", (int) (align / 8));
649 flags |= (align / 8) | SECTION_MERGE;
650 named_section_flags (name, flags);
654 readonly_data_section ();
657 /* Given NAME, a putative register name, discard any customary prefixes. */
660 strip_reg_name (const char *name)
662 #ifdef REGISTER_PREFIX
663 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
664 name += strlen (REGISTER_PREFIX);
666 if (name[0] == '%' || name[0] == '#')
671 /* Decode an `asm' spec for a declaration as a register name.
672 Return the register number, or -1 if nothing specified,
673 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
674 or -3 if ASMSPEC is `cc' and is not recognized,
675 or -4 if ASMSPEC is `memory' and is not recognized.
676 Accept an exact spelling or a decimal number.
677 Prefixes such as % are optional. */
680 decode_reg_name (const char *asmspec)
686 /* Get rid of confusing prefixes. */
687 asmspec = strip_reg_name (asmspec);
689 /* Allow a decimal number as a "register name". */
690 for (i = strlen (asmspec) - 1; i >= 0; i--)
691 if (! ISDIGIT (asmspec[i]))
693 if (asmspec[0] != 0 && i < 0)
696 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
702 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
704 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
707 #ifdef ADDITIONAL_REGISTER_NAMES
709 static const struct { const char *const name; const int number; } table[]
710 = ADDITIONAL_REGISTER_NAMES;
712 for (i = 0; i < (int) ARRAY_SIZE (table); i++)
713 if (! strcmp (asmspec, table[i].name))
714 return table[i].number;
716 #endif /* ADDITIONAL_REGISTER_NAMES */
718 if (!strcmp (asmspec, "memory"))
721 if (!strcmp (asmspec, "cc"))
730 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
731 have static storage duration. In other words, it should not be an
732 automatic variable, including PARM_DECLs.
734 There is, however, one exception: this function handles variables
735 explicitly placed in a particular register by the user.
737 ASMSPEC, if not 0, is the string which the user specified as the
738 assembler symbol name.
740 This is never called for PARM_DECL nodes. */
743 make_decl_rtl (tree decl, const char *asmspec)
745 const char *name = 0;
749 /* Check that we are not being given an automatic variable. */
750 /* A weak alias has TREE_PUBLIC set but not the other bits. */
751 if (TREE_CODE (decl) == PARM_DECL
752 || TREE_CODE (decl) == RESULT_DECL
753 || (TREE_CODE (decl) == VAR_DECL
754 && !TREE_STATIC (decl)
755 && !TREE_PUBLIC (decl)
756 && !DECL_EXTERNAL (decl)
757 && !DECL_REGISTER (decl)))
759 /* And that we were not given a type or a label. */
760 else if (TREE_CODE (decl) == TYPE_DECL
761 || TREE_CODE (decl) == LABEL_DECL)
764 /* For a duplicate declaration, we can be called twice on the
765 same DECL node. Don't discard the RTL already made. */
766 if (DECL_RTL_SET_P (decl))
768 /* If the old RTL had the wrong mode, fix the mode. */
769 if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
770 SET_DECL_RTL (decl, adjust_address_nv (DECL_RTL (decl),
771 DECL_MODE (decl), 0));
773 /* ??? Another way to do this would be to maintain a hashed
774 table of such critters. Instead of adding stuff to a DECL
775 to give certain attributes to it, we could use an external
776 hash map from DECL to set of attributes. */
778 /* Let the target reassign the RTL if it wants.
779 This is necessary, for example, when one machine specific
780 decl attribute overrides another. */
781 targetm.encode_section_info (decl, DECL_RTL (decl), false);
785 reg_number = decode_reg_name (asmspec);
786 if (reg_number == -2)
788 /* ASMSPEC is given, and not the name of a register. Mark the
789 name with a star so assemble_name won't munge it. */
790 char *starred = alloca (strlen (asmspec) + 2);
792 strcpy (starred + 1, asmspec);
793 change_decl_assembler_name (decl, get_identifier (starred));
796 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
798 if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
800 /* First detect errors in declaring global registers. */
801 if (reg_number == -1)
802 error ("%Jregister name not specified for '%D'", decl, decl);
803 else if (reg_number < 0)
804 error ("%Jinvalid register name for '%D'", decl, decl);
805 else if (TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
806 error ("%Jdata type of '%D' isn't suitable for a register",
808 else if (! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl))))
809 error ("%Jregister specified for '%D' isn't suitable for data type",
811 /* Now handle properly declared static register variables. */
816 if (DECL_INITIAL (decl) != 0 && TREE_STATIC (decl))
818 DECL_INITIAL (decl) = 0;
819 error ("global register variable has initial value");
821 if (TREE_THIS_VOLATILE (decl))
822 warning ("volatile register variables don't work as you might wish");
824 /* If the user specified one of the eliminables registers here,
825 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
826 confused with that register and be eliminated. This usage is
827 somewhat suspect... */
829 SET_DECL_RTL (decl, gen_rtx_raw_REG (DECL_MODE (decl), reg_number));
830 ORIGINAL_REGNO (DECL_RTL (decl)) = reg_number;
831 REG_USERVAR_P (DECL_RTL (decl)) = 1;
833 if (TREE_STATIC (decl))
835 /* Make this register global, so not usable for anything
837 #ifdef ASM_DECLARE_REGISTER_GLOBAL
838 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name);
840 nregs = hard_regno_nregs[reg_number][DECL_MODE (decl)];
842 globalize_reg (reg_number + --nregs);
845 /* As a register variable, it has no section. */
850 /* Now handle ordinary static variables and functions (in memory).
851 Also handle vars declared register invalidly. */
853 if (reg_number >= 0 || reg_number == -3)
854 error ("%Jregister name given for non-register variable '%D'", decl, decl);
856 /* Specifying a section attribute on a variable forces it into a
857 non-.bss section, and thus it cannot be common. */
858 if (TREE_CODE (decl) == VAR_DECL
859 && DECL_SECTION_NAME (decl) != NULL_TREE
860 && DECL_INITIAL (decl) == NULL_TREE
861 && DECL_COMMON (decl))
862 DECL_COMMON (decl) = 0;
864 /* Variables can't be both common and weak. */
865 if (TREE_CODE (decl) == VAR_DECL && DECL_WEAK (decl))
866 DECL_COMMON (decl) = 0;
868 x = gen_rtx_SYMBOL_REF (Pmode, name);
869 SYMBOL_REF_WEAK (x) = DECL_WEAK (decl);
870 SYMBOL_REF_DECL (x) = decl;
872 x = gen_rtx_MEM (DECL_MODE (decl), x);
873 if (TREE_CODE (decl) != FUNCTION_DECL)
874 set_mem_attributes (x, decl, 1);
875 SET_DECL_RTL (decl, x);
877 /* Optionally set flags or add text to the name to record information
878 such as that it is a function name.
879 If the name is changed, the macro ASM_OUTPUT_LABELREF
880 will have to know how to strip this information. */
881 targetm.encode_section_info (decl, DECL_RTL (decl), true);
884 /* Make the rtl for variable VAR be volatile.
885 Use this only for static variables. */
888 make_var_volatile (tree var)
890 if (GET_CODE (DECL_RTL (var)) != MEM)
893 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
896 /* Output a string of literal assembler code
897 for an `asm' keyword used between functions. */
900 assemble_asm (tree string)
904 if (TREE_CODE (string) == ADDR_EXPR)
905 string = TREE_OPERAND (string, 0);
907 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
910 /* Record an element in the table of global destructors. SYMBOL is
911 a SYMBOL_REF of the function to be called; PRIORITY is a number
912 between 0 and MAX_INIT_PRIORITY. */
915 default_stabs_asm_out_destructor (rtx symbol, int priority ATTRIBUTE_UNUSED)
917 /* Tell GNU LD that this is part of the static destructor set.
918 This will work for any system that uses stabs, most usefully
920 fprintf (asm_out_file, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
921 assemble_name (asm_out_file, XSTR (symbol, 0));
922 fputc ('\n', asm_out_file);
926 default_named_section_asm_out_destructor (rtx symbol, int priority)
928 const char *section = ".dtors";
931 /* ??? This only works reliably with the GNU linker. */
932 if (priority != DEFAULT_INIT_PRIORITY)
934 sprintf (buf, ".dtors.%.5u",
935 /* Invert the numbering so the linker puts us in the proper
936 order; constructors are run from right to left, and the
937 linker sorts in increasing order. */
938 MAX_INIT_PRIORITY - priority);
942 named_section_flags (section, SECTION_WRITE);
943 assemble_align (POINTER_SIZE);
944 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
947 #ifdef DTORS_SECTION_ASM_OP
951 if (in_section != in_dtors)
953 in_section = in_dtors;
954 fputs (DTORS_SECTION_ASM_OP, asm_out_file);
955 fputc ('\n', asm_out_file);
960 default_dtor_section_asm_out_destructor (rtx symbol,
961 int priority ATTRIBUTE_UNUSED)
964 assemble_align (POINTER_SIZE);
965 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
969 /* Likewise for global constructors. */
972 default_stabs_asm_out_constructor (rtx symbol, int priority ATTRIBUTE_UNUSED)
974 /* Tell GNU LD that this is part of the static destructor set.
975 This will work for any system that uses stabs, most usefully
977 fprintf (asm_out_file, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
978 assemble_name (asm_out_file, XSTR (symbol, 0));
979 fputc ('\n', asm_out_file);
983 default_named_section_asm_out_constructor (rtx symbol, int priority)
985 const char *section = ".ctors";
988 /* ??? This only works reliably with the GNU linker. */
989 if (priority != DEFAULT_INIT_PRIORITY)
991 sprintf (buf, ".ctors.%.5u",
992 /* Invert the numbering so the linker puts us in the proper
993 order; constructors are run from right to left, and the
994 linker sorts in increasing order. */
995 MAX_INIT_PRIORITY - priority);
999 named_section_flags (section, SECTION_WRITE);
1000 assemble_align (POINTER_SIZE);
1001 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1004 #ifdef CTORS_SECTION_ASM_OP
1006 ctors_section (void)
1008 if (in_section != in_ctors)
1010 in_section = in_ctors;
1011 fputs (CTORS_SECTION_ASM_OP, asm_out_file);
1012 fputc ('\n', asm_out_file);
1017 default_ctor_section_asm_out_constructor (rtx symbol,
1018 int priority ATTRIBUTE_UNUSED)
1021 assemble_align (POINTER_SIZE);
1022 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1026 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1027 a nonzero value if the constant pool should be output before the
1028 start of the function, or a zero value if the pool should output
1029 after the end of the function. The default is to put it before the
1032 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1033 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1036 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
1037 to be output to assembler.
1038 Set first_global_object_name and weak_global_object_name as appropriate. */
1041 notice_global_symbol (tree decl)
1043 const char **type = &first_global_object_name;
1045 if (first_global_object_name
1046 || !TREE_PUBLIC (decl) || DECL_EXTERNAL (decl)
1047 || !DECL_NAME (decl)
1048 || (TREE_CODE (decl) != FUNCTION_DECL
1049 && (TREE_CODE (decl) != VAR_DECL
1050 || (DECL_COMMON (decl)
1051 && (DECL_INITIAL (decl) == 0
1052 || DECL_INITIAL (decl) == error_mark_node))))
1053 || GET_CODE (DECL_RTL (decl)) != MEM)
1056 /* We win when global object is found, but it is useful to know about weak
1057 symbol as well so we can produce nicer unique names. */
1058 if (DECL_WEAK (decl) || DECL_ONE_ONLY (decl))
1059 type = &weak_global_object_name;
1065 rtx decl_rtl = DECL_RTL (decl);
1067 p = targetm.strip_name_encoding (XSTR (XEXP (decl_rtl, 0), 0));
1074 /* Output assembler code for the constant pool of a function and associated
1075 with defining the name of the function. DECL describes the function.
1076 NAME is the function's name. For the constant pool, we use the current
1077 constant pool data. */
1080 assemble_start_function (tree decl, const char *fnname)
1084 unlikely_section_label_printed = false;
1086 /* The following code does not need preprocessing in the assembler. */
1090 if (CONSTANT_POOL_BEFORE_FUNCTION)
1091 output_constant_pool (fnname, decl);
1093 resolve_unique_section (decl, 0, flag_function_sections);
1094 function_section (decl);
1096 /* Tell assembler to move to target machine's alignment for functions. */
1097 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1098 if (align < force_align_functions_log)
1099 align = force_align_functions_log;
1102 ASM_OUTPUT_ALIGN (asm_out_file, align);
1105 /* Handle a user-specified function alignment.
1106 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1107 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1108 if (align_functions_log > align
1109 && cfun->function_frequency != FUNCTION_FREQUENCY_UNLIKELY_EXECUTED)
1111 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1112 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file,
1113 align_functions_log, align_functions - 1);
1115 ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
1119 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1120 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
1123 (*debug_hooks->begin_function) (decl);
1125 /* Make function name accessible from other files, if appropriate. */
1127 if (TREE_PUBLIC (decl))
1129 notice_global_symbol (decl);
1131 globalize_decl (decl);
1133 maybe_assemble_visibility (decl);
1136 /* Do any machine/system dependent processing of the function name. */
1137 #ifdef ASM_DECLARE_FUNCTION_NAME
1138 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
1140 /* Standard thing is just output label for the function. */
1141 ASM_OUTPUT_LABEL (asm_out_file, fnname);
1142 #endif /* ASM_DECLARE_FUNCTION_NAME */
1145 /* Output assembler code associated with defining the size of the
1146 function. DECL describes the function. NAME is the function's name. */
1149 assemble_end_function (tree decl, const char *fnname)
1151 #ifdef ASM_DECLARE_FUNCTION_SIZE
1152 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1154 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1156 output_constant_pool (fnname, decl);
1157 function_section (decl); /* need to switch back */
1161 /* Assemble code to leave SIZE bytes of zeros. */
1164 assemble_zeros (unsigned HOST_WIDE_INT size)
1166 /* Do no output if -fsyntax-only. */
1167 if (flag_syntax_only)
1170 #ifdef ASM_NO_SKIP_IN_TEXT
1171 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1172 so we must output 0s explicitly in the text section. */
1173 if ((ASM_NO_SKIP_IN_TEXT && in_text_section ())
1174 || (ASM_NO_SKIP_IN_TEXT && in_unlikely_text_section ()))
1176 unsigned HOST_WIDE_INT i;
1177 for (i = 0; i < size; i++)
1178 assemble_integer (const0_rtx, 1, BITS_PER_UNIT, 1);
1183 ASM_OUTPUT_SKIP (asm_out_file, size);
1186 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1189 assemble_align (int align)
1191 if (align > BITS_PER_UNIT)
1193 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1197 /* Assemble a string constant with the specified C string as contents. */
1200 assemble_string (const char *p, int size)
1205 /* If the string is very long, split it up. */
1209 int thissize = size - pos;
1210 if (thissize > maximum)
1213 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1221 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1222 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1223 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1225 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1226 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1227 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1229 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1230 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1234 #if defined ASM_OUTPUT_ALIGNED_BSS
1235 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1236 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1238 #if defined ASM_OUTPUT_BSS
1239 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1240 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1246 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1247 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1248 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1250 #if defined ASM_OUTPUT_ALIGNED_COMMON
1251 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1252 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1254 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1255 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1260 asm_emit_uninitialised (tree decl, const char *name,
1261 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
1262 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED)
1270 destination = asm_dest_local;
1272 /* ??? We should handle .bss via select_section mechanisms rather than
1273 via special target hooks. That would eliminate this special case. */
1274 if (TREE_PUBLIC (decl))
1276 if (!DECL_COMMON (decl))
1278 destination = asm_dest_bss;
1283 destination = asm_dest_common;
1286 if (destination == asm_dest_bss)
1287 globalize_decl (decl);
1288 resolve_unique_section (decl, 0, flag_data_sections);
1290 if (flag_shared_data)
1292 switch (destination)
1294 #ifdef ASM_OUTPUT_SHARED_BSS
1296 ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded);
1299 #ifdef ASM_OUTPUT_SHARED_COMMON
1300 case asm_dest_common:
1301 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1304 #ifdef ASM_OUTPUT_SHARED_LOCAL
1305 case asm_dest_local:
1306 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1314 switch (destination)
1318 ASM_EMIT_BSS (decl, name, size, rounded);
1321 case asm_dest_common:
1322 ASM_EMIT_COMMON (decl, name, size, rounded);
1324 case asm_dest_local:
1325 ASM_EMIT_LOCAL (decl, name, size, rounded);
1334 /* Assemble everything that is needed for a variable or function declaration.
1335 Not used for automatic variables, and not used for function definitions.
1336 Should not be called for variables of incomplete structure type.
1338 TOP_LEVEL is nonzero if this variable has file scope.
1339 AT_END is nonzero if this is the special handling, at end of compilation,
1340 to define things that have had only tentative definitions.
1341 DONT_OUTPUT_DATA if nonzero means don't actually output the
1342 initial value (that will be done by the caller). */
1345 assemble_variable (tree decl, int top_level ATTRIBUTE_UNUSED,
1346 int at_end ATTRIBUTE_UNUSED, int dont_output_data)
1353 if (lang_hooks.decls.prepare_assemble_variable)
1354 lang_hooks.decls.prepare_assemble_variable (decl);
1356 last_assemble_variable_decl = 0;
1358 /* Normally no need to say anything here for external references,
1359 since assemble_external is called by the language-specific code
1360 when a declaration is first seen. */
1362 if (DECL_EXTERNAL (decl))
1365 /* Output no assembler code for a function declaration.
1366 Only definitions of functions output anything. */
1368 if (TREE_CODE (decl) == FUNCTION_DECL)
1371 /* Do nothing for global register variables. */
1372 if (DECL_RTL_SET_P (decl) && GET_CODE (DECL_RTL (decl)) == REG)
1374 TREE_ASM_WRITTEN (decl) = 1;
1378 /* If type was incomplete when the variable was declared,
1379 see if it is complete now. */
1381 if (DECL_SIZE (decl) == 0)
1382 layout_decl (decl, 0);
1384 /* Still incomplete => don't allocate it; treat the tentative defn
1385 (which is what it must have been) as an `extern' reference. */
1387 if (!dont_output_data && DECL_SIZE (decl) == 0)
1389 error ("%Jstorage size of `%D' isn't known", decl, decl);
1390 TREE_ASM_WRITTEN (decl) = 1;
1394 /* The first declaration of a variable that comes through this function
1395 decides whether it is global (in C, has external linkage)
1396 or local (in C, has internal linkage). So do nothing more
1397 if this function has already run. */
1399 if (TREE_ASM_WRITTEN (decl))
1402 /* Make sure targetm.encode_section_info is invoked before we set
1404 decl_rtl = DECL_RTL (decl);
1406 TREE_ASM_WRITTEN (decl) = 1;
1408 /* Do no output if -fsyntax-only. */
1409 if (flag_syntax_only)
1414 if (! dont_output_data
1415 && ! host_integerp (DECL_SIZE_UNIT (decl), 1))
1417 error ("%Jsize of variable '%D' is too large", decl, decl);
1421 name = XSTR (XEXP (decl_rtl, 0), 0);
1422 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1423 notice_global_symbol (decl);
1425 /* Compute the alignment of this data. */
1427 align = DECL_ALIGN (decl);
1429 /* In the case for initialing an array whose length isn't specified,
1430 where we have not yet been able to do the layout,
1431 figure out the proper alignment now. */
1432 if (dont_output_data && DECL_SIZE (decl) == 0
1433 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1434 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1436 /* Some object file formats have a maximum alignment which they support.
1437 In particular, a.out format supports a maximum alignment of 4. */
1438 #ifndef MAX_OFILE_ALIGNMENT
1439 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1441 if (align > MAX_OFILE_ALIGNMENT)
1443 warning ("%Jalignment of '%D' is greater than maximum object "
1444 "file alignment. Using %d", decl, decl,
1445 MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
1446 align = MAX_OFILE_ALIGNMENT;
1449 /* On some machines, it is good to increase alignment sometimes. */
1450 if (! DECL_USER_ALIGN (decl))
1452 #ifdef DATA_ALIGNMENT
1453 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1455 #ifdef CONSTANT_ALIGNMENT
1456 if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node)
1457 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1461 /* Reset the alignment in case we have made it tighter, so we can benefit
1462 from it in get_pointer_alignment. */
1463 DECL_ALIGN (decl) = align;
1464 set_mem_align (decl_rtl, align);
1466 if (TREE_PUBLIC (decl))
1467 maybe_assemble_visibility (decl);
1469 /* Output any data that we will need to use the address of. */
1470 if (DECL_INITIAL (decl) == error_mark_node)
1471 reloc = contains_pointers_p (TREE_TYPE (decl)) ? 3 : 0;
1472 else if (DECL_INITIAL (decl))
1474 reloc = compute_reloc_for_constant (DECL_INITIAL (decl));
1475 output_addressed_constants (DECL_INITIAL (decl));
1477 resolve_unique_section (decl, reloc, flag_data_sections);
1479 /* Handle uninitialized definitions. */
1481 /* If the decl has been given an explicit section name, then it
1482 isn't common, and shouldn't be handled as such. */
1483 if (DECL_SECTION_NAME (decl) || dont_output_data)
1485 /* We don't implement common thread-local data at present. */
1486 else if (DECL_THREAD_LOCAL (decl))
1488 if (DECL_COMMON (decl))
1489 sorry ("thread-local COMMON data not implemented");
1491 else if (DECL_INITIAL (decl) == 0
1492 || DECL_INITIAL (decl) == error_mark_node
1493 || (flag_zero_initialized_in_bss
1494 /* Leave constant zeroes in .rodata so they can be shared. */
1495 && !TREE_READONLY (decl)
1496 && initializer_zerop (DECL_INITIAL (decl))))
1498 unsigned HOST_WIDE_INT size = tree_low_cst (DECL_SIZE_UNIT (decl), 1);
1499 unsigned HOST_WIDE_INT rounded = size;
1501 /* Don't allocate zero bytes of common,
1502 since that means "undefined external" in the linker. */
1506 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1507 so that each uninitialized object starts on such a boundary. */
1508 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1509 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1510 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1512 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1513 if ((unsigned HOST_WIDE_INT) DECL_ALIGN (decl) / BITS_PER_UNIT > rounded)
1514 warning ("%Jrequested alignment for '%D' is greater than "
1515 "implemented alignment of %d", decl, decl, rounded);
1518 /* If the target cannot output uninitialized but not common global data
1519 in .bss, then we have to use .data, so fall through. */
1520 if (asm_emit_uninitialised (decl, name, size, rounded))
1524 /* Handle initialized definitions.
1525 Also handle uninitialized global definitions if -fno-common and the
1526 target doesn't support ASM_OUTPUT_BSS. */
1528 /* First make the assembler name(s) global if appropriate. */
1529 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1530 globalize_decl (decl);
1532 /* Switch to the appropriate section. */
1533 variable_section (decl, reloc);
1535 /* dbxout.c needs to know this. */
1536 if (in_text_section () || in_unlikely_text_section ())
1537 DECL_IN_TEXT_SECTION (decl) = 1;
1539 /* Output the alignment of this data. */
1540 if (align > BITS_PER_UNIT)
1542 ASM_OUTPUT_ALIGN (asm_out_file,
1543 floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT));
1546 /* Do any machine/system dependent processing of the object. */
1547 #ifdef ASM_DECLARE_OBJECT_NAME
1548 last_assemble_variable_decl = decl;
1549 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1551 /* Standard thing is just output label for the object. */
1552 ASM_OUTPUT_LABEL (asm_out_file, name);
1553 #endif /* ASM_DECLARE_OBJECT_NAME */
1555 if (!dont_output_data)
1557 if (DECL_INITIAL (decl) && DECL_INITIAL (decl) != error_mark_node)
1558 /* Output the actual data. */
1559 output_constant (DECL_INITIAL (decl),
1560 tree_low_cst (DECL_SIZE_UNIT (decl), 1),
1563 /* Leave space for it. */
1564 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl), 1));
1568 /* Return 1 if type TYPE contains any pointers. */
1571 contains_pointers_p (tree type)
1573 switch (TREE_CODE (type))
1576 case REFERENCE_TYPE:
1577 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1578 so I'll play safe and return 1. */
1584 case QUAL_UNION_TYPE:
1587 /* For a type that has fields, see if the fields have pointers. */
1588 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1589 if (TREE_CODE (fields) == FIELD_DECL
1590 && contains_pointers_p (TREE_TYPE (fields)))
1596 /* An array type contains pointers if its element type does. */
1597 return contains_pointers_p (TREE_TYPE (type));
1604 #ifdef ASM_OUTPUT_EXTERNAL
1605 /* True if DECL is a function decl for which no out-of-line copy exists.
1606 It is assumed that DECL's assembler name has been set. */
1609 incorporeal_function_p (tree decl)
1611 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_BUILT_IN (decl))
1615 if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
1616 && DECL_FUNCTION_CODE (decl) == BUILT_IN_ALLOCA)
1619 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
1620 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
1627 /* Output something to declare an external symbol to the assembler.
1628 (Most assemblers don't need this, so we normally output nothing.)
1629 Do nothing if DECL is not external. */
1632 assemble_external (tree decl ATTRIBUTE_UNUSED)
1634 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1635 main body of this code is only rarely exercised. To provide some
1636 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1637 open. If it's not, we should not be calling this function. */
1641 #ifdef ASM_OUTPUT_EXTERNAL
1642 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1644 rtx rtl = DECL_RTL (decl);
1646 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1647 && !SYMBOL_REF_USED (XEXP (rtl, 0))
1648 && !incorporeal_function_p (decl))
1650 /* Some systems do require some output. */
1651 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1652 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1658 /* Similar, for calling a library function FUN. */
1661 assemble_external_libcall (rtx fun)
1663 /* Declare library function name external when first used, if nec. */
1664 if (! SYMBOL_REF_USED (fun))
1666 SYMBOL_REF_USED (fun) = 1;
1667 targetm.asm_out.external_libcall (fun);
1671 /* Assemble a label named NAME. */
1674 assemble_label (const char *name)
1676 ASM_OUTPUT_LABEL (asm_out_file, name);
1679 /* Set the symbol_referenced flag for ID and notify callgraph code. */
1681 mark_referenced (tree id)
1683 if (!TREE_SYMBOL_REFERENCED (id))
1685 struct cgraph_node *node;
1686 struct cgraph_varpool_node *vnode;
1688 if (!cgraph_global_info_ready)
1690 node = cgraph_node_for_identifier (id);
1692 cgraph_mark_needed_node (node);
1695 vnode = cgraph_varpool_node_for_identifier (id);
1697 cgraph_varpool_mark_needed_node (vnode);
1699 TREE_SYMBOL_REFERENCED (id) = 1;
1702 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1703 If NAME starts with a *, the rest of NAME is output verbatim.
1704 Otherwise NAME is transformed in an implementation-defined way
1705 (usually by the addition of an underscore).
1706 Many macros in the tm file are defined to call this function. */
1709 assemble_name (FILE *file, const char *name)
1711 const char *real_name;
1714 real_name = targetm.strip_name_encoding (name);
1716 id = maybe_get_identifier (real_name);
1718 mark_referenced (id);
1721 fputs (&name[1], file);
1723 ASM_OUTPUT_LABELREF (file, name);
1726 /* Allocate SIZE bytes writable static space with a gensym name
1727 and return an RTX to refer to its address. */
1730 assemble_static_space (unsigned HOST_WIDE_INT size)
1733 const char *namestring;
1737 if (flag_shared_data)
1741 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1743 namestring = ggc_strdup (name);
1745 x = gen_rtx_SYMBOL_REF (Pmode, namestring);
1746 SYMBOL_REF_FLAGS (x) = SYMBOL_FLAG_LOCAL;
1748 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1749 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
1752 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1753 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1756 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1757 so that each uninitialized object starts on such a boundary. */
1758 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1759 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1760 = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1761 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1762 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1763 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1770 /* Assemble the static constant template for function entry trampolines.
1771 This is done at most once per compilation.
1772 Returns an RTX for the address of the template. */
1774 #ifdef TRAMPOLINE_TEMPLATE
1776 assemble_trampoline_template (void)
1783 /* By default, put trampoline templates in read-only data section. */
1785 #ifdef TRAMPOLINE_SECTION
1786 TRAMPOLINE_SECTION ();
1788 readonly_data_section ();
1791 /* Write the assembler code to define one. */
1792 align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
1795 ASM_OUTPUT_ALIGN (asm_out_file, align);
1798 targetm.asm_out.internal_label (asm_out_file, "LTRAMP", 0);
1799 TRAMPOLINE_TEMPLATE (asm_out_file);
1801 /* Record the rtl to refer to it. */
1802 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1803 name = ggc_strdup (label);
1804 symbol = gen_rtx_SYMBOL_REF (Pmode, name);
1805 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
1811 /* A and B are either alignments or offsets. Return the minimum alignment
1812 that may be assumed after adding the two together. */
1814 static inline unsigned
1815 min_align (unsigned int a, unsigned int b)
1817 return (a | b) & -(a | b);
1820 /* Return the assembler directive for creating a given kind of integer
1821 object. SIZE is the number of bytes in the object and ALIGNED_P
1822 indicates whether it is known to be aligned. Return NULL if the
1823 assembly dialect has no such directive.
1825 The returned string should be printed at the start of a new line and
1826 be followed immediately by the object's initial value. */
1829 integer_asm_op (int size, int aligned_p)
1831 struct asm_int_op *ops;
1834 ops = &targetm.asm_out.aligned_op;
1836 ops = &targetm.asm_out.unaligned_op;
1841 return targetm.asm_out.byte_op;
1855 /* Use directive OP to assemble an integer object X. Print OP at the
1856 start of the line, followed immediately by the value of X. */
1859 assemble_integer_with_op (const char *op, rtx x)
1861 fputs (op, asm_out_file);
1862 output_addr_const (asm_out_file, x);
1863 fputc ('\n', asm_out_file);
1866 /* The default implementation of the asm_out.integer target hook. */
1869 default_assemble_integer (rtx x ATTRIBUTE_UNUSED,
1870 unsigned int size ATTRIBUTE_UNUSED,
1871 int aligned_p ATTRIBUTE_UNUSED)
1873 const char *op = integer_asm_op (size, aligned_p);
1874 return op && (assemble_integer_with_op (op, x), true);
1877 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1878 the alignment of the integer in bits. Return 1 if we were able to output
1879 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1883 assemble_integer (rtx x, unsigned int size, unsigned int align, int force)
1887 aligned_p = (align >= MIN (size * BITS_PER_UNIT, BIGGEST_ALIGNMENT));
1889 /* See if the target hook can handle this kind of object. */
1890 if (targetm.asm_out.integer (x, size, aligned_p))
1893 /* If the object is a multi-byte one, try splitting it up. Split
1894 it into words it if is multi-word, otherwise split it into bytes. */
1897 enum machine_mode omode, imode;
1898 unsigned int subalign;
1899 unsigned int subsize, i;
1901 subsize = size > UNITS_PER_WORD? UNITS_PER_WORD : 1;
1902 subalign = MIN (align, subsize * BITS_PER_UNIT);
1903 omode = mode_for_size (subsize * BITS_PER_UNIT, MODE_INT, 0);
1904 imode = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1906 for (i = 0; i < size; i += subsize)
1908 rtx partial = simplify_subreg (omode, x, imode, i);
1909 if (!partial || !assemble_integer (partial, subsize, subalign, 0))
1915 /* If we've printed some of it, but not all of it, there's no going
1928 assemble_real (REAL_VALUE_TYPE d, enum machine_mode mode, unsigned int align)
1932 int bitsize, nelts, nunits, units_per;
1934 /* This is hairy. We have a quantity of known size. real_to_target
1935 will put it into an array of *host* longs, 32 bits per element
1936 (even if long is more than 32 bits). We need to determine the
1937 number of array elements that are occupied (nelts) and the number
1938 of *target* min-addressable units that will be occupied in the
1939 object file (nunits). We cannot assume that 32 divides the
1940 mode's bitsize (size * BITS_PER_UNIT) evenly.
1942 size * BITS_PER_UNIT is used here to make sure that padding bits
1943 (which might appear at either end of the value; real_to_target
1944 will include the padding bits in its output array) are included. */
1946 nunits = GET_MODE_SIZE (mode);
1947 bitsize = nunits * BITS_PER_UNIT;
1948 nelts = CEIL (bitsize, 32);
1949 units_per = 32 / BITS_PER_UNIT;
1951 real_to_target (data, &d, mode);
1953 /* Put out the first word with the specified alignment. */
1954 assemble_integer (GEN_INT (data[0]), MIN (nunits, units_per), align, 1);
1955 nunits -= units_per;
1957 /* Subsequent words need only 32-bit alignment. */
1958 align = min_align (align, 32);
1960 for (i = 1; i < nelts; i++)
1962 assemble_integer (GEN_INT (data[i]), MIN (nunits, units_per), align, 1);
1963 nunits -= units_per;
1967 /* Given an expression EXP with a constant value,
1968 reduce it to the sum of an assembler symbol and an integer.
1969 Store them both in the structure *VALUE.
1970 Abort if EXP does not reduce. */
1972 struct addr_const GTY(())
1975 HOST_WIDE_INT offset;
1979 decode_addr_const (tree exp, struct addr_const *value)
1981 tree target = TREE_OPERAND (exp, 0);
1987 if (TREE_CODE (target) == COMPONENT_REF
1988 && host_integerp (byte_position (TREE_OPERAND (target, 1)), 0))
1991 offset += int_byte_position (TREE_OPERAND (target, 1));
1992 target = TREE_OPERAND (target, 0);
1994 else if (TREE_CODE (target) == ARRAY_REF
1995 || TREE_CODE (target) == ARRAY_RANGE_REF)
1997 offset += (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target)), 1)
1998 * tree_low_cst (TREE_OPERAND (target, 1), 0));
1999 target = TREE_OPERAND (target, 0);
2005 switch (TREE_CODE (target))
2009 x = DECL_RTL (target);
2013 x = gen_rtx_MEM (FUNCTION_MODE,
2014 gen_rtx_LABEL_REF (VOIDmode, force_label_rtx (target)));
2022 x = output_constant_def (target, 1);
2029 if (GET_CODE (x) != MEM)
2034 value->offset = offset;
2037 /* Uniquize all constants that appear in memory.
2038 Each constant in memory thus far output is recorded
2039 in `const_desc_table'. */
2041 struct constant_descriptor_tree GTY(())
2043 /* A MEM for the constant. */
2046 /* The value of the constant. */
2050 static GTY((param_is (struct constant_descriptor_tree)))
2051 htab_t const_desc_htab;
2053 static struct constant_descriptor_tree * build_constant_desc (tree);
2054 static void maybe_output_constant_def_contents (struct constant_descriptor_tree *, int);
2056 /* Compute a hash code for a constant expression. */
2059 const_desc_hash (const void *ptr)
2061 return const_hash_1 (((struct constant_descriptor_tree *)ptr)->value);
2065 const_hash_1 (const tree exp)
2070 enum tree_code code = TREE_CODE (exp);
2072 /* Either set P and LEN to the address and len of something to hash and
2073 exit the switch or return a value. */
2078 p = (char *) &TREE_INT_CST (exp);
2079 len = sizeof TREE_INT_CST (exp);
2083 return real_hash (TREE_REAL_CST_PTR (exp));
2086 p = TREE_STRING_POINTER (exp);
2087 len = TREE_STRING_LENGTH (exp);
2091 return (const_hash_1 (TREE_REALPART (exp)) * 5
2092 + const_hash_1 (TREE_IMAGPART (exp)));
2095 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2099 len = int_size_in_bytes (TREE_TYPE (exp));
2101 get_set_constructor_bytes (exp, (unsigned char *) tmp, len);
2109 hi = 5 + int_size_in_bytes (TREE_TYPE (exp));
2111 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2112 if (TREE_VALUE (link))
2113 hi = hi * 603 + const_hash_1 (TREE_VALUE (link));
2121 struct addr_const value;
2123 decode_addr_const (exp, &value);
2124 if (GET_CODE (value.base) == SYMBOL_REF)
2126 /* Don't hash the address of the SYMBOL_REF;
2127 only use the offset and the symbol name. */
2129 p = XSTR (value.base, 0);
2130 for (i = 0; p[i] != 0; i++)
2131 hi = ((hi * 613) + (unsigned) (p[i]));
2133 else if (GET_CODE (value.base) == LABEL_REF)
2134 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2142 return (const_hash_1 (TREE_OPERAND (exp, 0)) * 9
2143 + const_hash_1 (TREE_OPERAND (exp, 1)));
2147 case NON_LVALUE_EXPR:
2148 return const_hash_1 (TREE_OPERAND (exp, 0)) * 7 + 2;
2151 /* A language specific constant. Just hash the code. */
2155 /* Compute hashing function. */
2157 for (i = 0; i < len; i++)
2158 hi = ((hi * 613) + (unsigned) (p[i]));
2163 /* Wrapper of compare_constant, for the htab interface. */
2165 const_desc_eq (const void *p1, const void *p2)
2167 return compare_constant (((struct constant_descriptor_tree *)p1)->value,
2168 ((struct constant_descriptor_tree *)p2)->value);
2171 /* Compare t1 and t2, and return 1 only if they are known to result in
2172 the same bit pattern on output. */
2175 compare_constant (const tree t1, const tree t2)
2177 enum tree_code typecode;
2179 if (t1 == NULL_TREE)
2180 return t2 == NULL_TREE;
2181 if (t2 == NULL_TREE)
2184 if (TREE_CODE (t1) != TREE_CODE (t2))
2187 switch (TREE_CODE (t1))
2190 /* Integer constants are the same only if the same width of type. */
2191 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2193 return tree_int_cst_equal (t1, t2);
2196 /* Real constants are the same only if the same width of type. */
2197 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2200 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
2203 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2)))
2206 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
2207 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
2208 TREE_STRING_LENGTH (t1)));
2211 return (compare_constant (TREE_REALPART (t1), TREE_REALPART (t2))
2212 && compare_constant (TREE_IMAGPART (t1), TREE_IMAGPART (t2)));
2215 typecode = TREE_CODE (TREE_TYPE (t1));
2216 if (typecode != TREE_CODE (TREE_TYPE (t2)))
2219 if (typecode == SET_TYPE)
2221 int len = int_size_in_bytes (TREE_TYPE (t2));
2222 unsigned char *tmp1, *tmp2;
2224 if (int_size_in_bytes (TREE_TYPE (t1)) != len)
2227 tmp1 = alloca (len);
2228 tmp2 = alloca (len);
2230 if (get_set_constructor_bytes (t1, tmp1, len) != NULL_TREE)
2232 if (get_set_constructor_bytes (t2, tmp2, len) != NULL_TREE)
2235 return memcmp (tmp1, tmp2, len) == 0;
2241 if (typecode == ARRAY_TYPE)
2243 HOST_WIDE_INT size_1 = int_size_in_bytes (TREE_TYPE (t1));
2244 /* For arrays, check that the sizes all match. */
2245 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2))
2247 || size_1 != int_size_in_bytes (TREE_TYPE (t2)))
2252 /* For record and union constructors, require exact type
2254 if (TREE_TYPE (t1) != TREE_TYPE (t2))
2258 for (l1 = CONSTRUCTOR_ELTS (t1), l2 = CONSTRUCTOR_ELTS (t2);
2260 l1 = TREE_CHAIN (l1), l2 = TREE_CHAIN (l2))
2262 /* Check that each value is the same... */
2263 if (! compare_constant (TREE_VALUE (l1), TREE_VALUE (l2)))
2265 /* ... and that they apply to the same fields! */
2266 if (typecode == ARRAY_TYPE)
2268 if (! compare_constant (TREE_PURPOSE (l1),
2274 if (TREE_PURPOSE (l1) != TREE_PURPOSE (l2))
2279 return l1 == NULL_TREE && l2 == NULL_TREE;
2285 struct addr_const value1, value2;
2287 decode_addr_const (t1, &value1);
2288 decode_addr_const (t2, &value2);
2289 return (value1.offset == value2.offset
2290 && strcmp (XSTR (value1.base, 0), XSTR (value2.base, 0)) == 0);
2296 return (compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))
2297 && compare_constant(TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)));
2301 case NON_LVALUE_EXPR:
2302 return compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2307 nt1 = lang_hooks.expand_constant (t1);
2308 nt2 = lang_hooks.expand_constant (t2);
2309 if (nt1 != t1 || nt2 != t2)
2310 return compare_constant (nt1, nt2);
2316 /* Should not get here. */
2320 /* Make a copy of the whole tree structure for a constant. This
2321 handles the same types of nodes that compare_constant handles. */
2324 copy_constant (tree exp)
2326 switch (TREE_CODE (exp))
2329 /* For ADDR_EXPR, we do not want to copy the decl whose address
2330 is requested. We do want to copy constants though. */
2331 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c')
2332 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2333 copy_constant (TREE_OPERAND (exp, 0)));
2335 return copy_node (exp);
2340 return copy_node (exp);
2343 return build_complex (TREE_TYPE (exp),
2344 copy_constant (TREE_REALPART (exp)),
2345 copy_constant (TREE_IMAGPART (exp)));
2349 return build (TREE_CODE (exp), TREE_TYPE (exp),
2350 copy_constant (TREE_OPERAND (exp, 0)),
2351 copy_constant (TREE_OPERAND (exp, 1)));
2355 case NON_LVALUE_EXPR:
2356 case VIEW_CONVERT_EXPR:
2357 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2358 copy_constant (TREE_OPERAND (exp, 0)));
2362 tree copy = copy_node (exp);
2363 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2366 CONSTRUCTOR_ELTS (copy) = list;
2367 for (tail = list; tail; tail = TREE_CHAIN (tail))
2368 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2369 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2370 for (tail = list; tail; tail = TREE_CHAIN (tail))
2371 TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail));
2379 t = lang_hooks.expand_constant (exp);
2381 return copy_constant (t);
2388 /* Subroutine of output_constant_def:
2389 No constant equal to EXP is known to have been output.
2390 Make a constant descriptor to enter EXP in the hash table.
2391 Assign the label number and construct RTL to refer to the
2392 constant's location in memory.
2393 Caller is responsible for updating the hash table. */
2395 static struct constant_descriptor_tree *
2396 build_constant_desc (tree exp)
2402 struct constant_descriptor_tree *desc;
2404 desc = ggc_alloc (sizeof (*desc));
2405 desc->value = copy_constant (exp);
2407 /* Create a string containing the label name, in LABEL. */
2408 labelno = const_labelno++;
2409 ASM_GENERATE_INTERNAL_LABEL (label, "LC", labelno);
2411 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2412 symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label));
2413 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
2414 SYMBOL_REF_DECL (symbol) = desc->value;
2415 TREE_CONSTANT_POOL_ADDRESS_P (symbol) = 1;
2417 rtl = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)), symbol);
2418 set_mem_attributes (rtl, exp, 1);
2419 set_mem_alias_set (rtl, 0);
2420 set_mem_alias_set (rtl, const_alias_set);
2422 /* Set flags or add text to the name to record information, such as
2423 that it is a local symbol. If the name is changed, the macro
2424 ASM_OUTPUT_LABELREF will have to know how to strip this
2425 information. This call might invalidate our local variable
2426 SYMBOL; we can't use it afterward. */
2428 targetm.encode_section_info (exp, rtl, true);
2435 /* Return an rtx representing a reference to constant data in memory
2436 for the constant expression EXP.
2438 If assembler code for such a constant has already been output,
2439 return an rtx to refer to it.
2440 Otherwise, output such a constant in memory
2441 and generate an rtx for it.
2443 If DEFER is nonzero, this constant can be deferred and output only
2444 if referenced in the function after all optimizations.
2446 `const_desc_table' records which constants already have label strings. */
2449 output_constant_def (tree exp, int defer)
2451 struct constant_descriptor_tree *desc;
2452 struct constant_descriptor_tree key;
2455 /* Look up EXP in the table of constant descriptors. If we didn't find
2456 it, create a new one. */
2458 loc = htab_find_slot (const_desc_htab, &key, INSERT);
2463 desc = build_constant_desc (exp);
2467 maybe_output_constant_def_contents (desc, defer);
2471 /* Subroutine of output_constant_def: Decide whether or not we need to
2472 output the constant DESC now, and if so, do it. */
2474 maybe_output_constant_def_contents (struct constant_descriptor_tree *desc,
2477 rtx symbol = XEXP (desc->rtl, 0);
2478 tree exp = desc->value;
2480 if (flag_syntax_only)
2483 if (TREE_ASM_WRITTEN (exp))
2484 /* Already output; don't do it again. */
2487 /* We can always defer constants as long as the context allows
2491 /* Increment n_deferred_constants if it exists. It needs to be at
2492 least as large as the number of constants actually referred to
2493 by the function. If it's too small we'll stop looking too early
2494 and fail to emit constants; if it's too large we'll only look
2495 through the entire function when we could have stopped earlier. */
2497 n_deferred_constants++;
2501 output_constant_def_contents (symbol);
2504 /* We must output the constant data referred to by SYMBOL; do so. */
2507 output_constant_def_contents (rtx symbol)
2509 tree exp = SYMBOL_REF_DECL (symbol);
2510 const char *label = XSTR (symbol, 0);
2513 /* Make sure any other constants whose addresses appear in EXP
2514 are assigned label numbers. */
2515 int reloc = compute_reloc_for_constant (exp);
2517 /* Align the location counter as required by EXP's data type. */
2518 int align = TYPE_ALIGN (TREE_TYPE (exp));
2519 #ifdef CONSTANT_ALIGNMENT
2520 align = CONSTANT_ALIGNMENT (exp, align);
2523 output_addressed_constants (exp);
2525 /* We are no longer deferring this constant. */
2526 TREE_ASM_WRITTEN (exp) = 1;
2528 if (IN_NAMED_SECTION (exp))
2529 named_section (exp, NULL, reloc);
2531 targetm.asm_out.select_section (exp, reloc, align);
2533 if (align > BITS_PER_UNIT)
2535 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2538 size = int_size_in_bytes (TREE_TYPE (exp));
2539 if (TREE_CODE (exp) == STRING_CST)
2540 size = MAX (TREE_STRING_LENGTH (exp), size);
2542 /* Do any machine/system dependent processing of the constant. */
2543 #ifdef ASM_DECLARE_CONSTANT_NAME
2544 ASM_DECLARE_CONSTANT_NAME (asm_out_file, label, exp, size);
2546 /* Standard thing is just output label for the constant. */
2547 ASM_OUTPUT_LABEL (asm_out_file, label);
2548 #endif /* ASM_DECLARE_CONSTANT_NAME */
2550 /* Output the value of EXP. */
2551 output_constant (exp, size, align);
2554 /* A constant which was deferred in its original location has been
2555 inserted by the RTL inliner into a different function. The
2556 current function's deferred constant count must be incremented. */
2558 notice_rtl_inlining_of_deferred_constant (void)
2560 n_deferred_constants++;
2563 /* Look up EXP in the table of constant descriptors. Return the rtl
2564 if it has been emitted, else null. */
2567 lookup_constant_def (tree exp)
2569 struct constant_descriptor_tree *desc;
2570 struct constant_descriptor_tree key;
2573 desc = htab_find (const_desc_htab, &key);
2575 return (desc ? desc->rtl : NULL_RTX);
2578 /* Used in the hash tables to avoid outputting the same constant
2579 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2580 are output once per function, not once per file. */
2581 /* ??? Only a few targets need per-function constant pools. Most
2582 can use one per-file pool. Should add a targetm bit to tell the
2585 struct rtx_constant_pool GTY(())
2587 /* Pointers to first and last constant in pool, as ordered by offset. */
2588 struct constant_descriptor_rtx *first;
2589 struct constant_descriptor_rtx *last;
2591 /* Hash facility for making memory-constants from constant rtl-expressions.
2592 It is used on RISC machines where immediate integer arguments and
2593 constant addresses are restricted so that such constants must be stored
2595 htab_t GTY((param_is (struct constant_descriptor_rtx))) const_rtx_htab;
2596 htab_t GTY((param_is (struct constant_descriptor_rtx))) const_rtx_sym_htab;
2598 /* Current offset in constant pool (does not include any
2599 machine-specific header). */
2600 HOST_WIDE_INT offset;
2603 struct constant_descriptor_rtx GTY((chain_next ("%h.next")))
2605 struct constant_descriptor_rtx *next;
2609 HOST_WIDE_INT offset;
2611 enum machine_mode mode;
2617 /* Hash and compare functions for const_rtx_htab. */
2620 const_desc_rtx_hash (const void *ptr)
2622 const struct constant_descriptor_rtx *desc = ptr;
2627 const_desc_rtx_eq (const void *a, const void *b)
2629 const struct constant_descriptor_rtx *x = a;
2630 const struct constant_descriptor_rtx *y = b;
2632 if (x->mode != y->mode)
2634 return rtx_equal_p (x->constant, y->constant);
2637 /* Hash and compare functions for const_rtx_sym_htab. */
2640 const_desc_rtx_sym_hash (const void *ptr)
2642 const struct constant_descriptor_rtx *desc = ptr;
2643 return htab_hash_string (XSTR (desc->sym, 0));
2647 const_desc_rtx_sym_eq (const void *a, const void *b)
2649 const struct constant_descriptor_rtx *x = a;
2650 const struct constant_descriptor_rtx *y = b;
2651 return XSTR (x->sym, 0) == XSTR (y->sym, 0);
2654 /* This is the worker function for const_rtx_hash, called via for_each_rtx. */
2657 const_rtx_hash_1 (rtx *xp, void *data)
2659 unsigned HOST_WIDE_INT hwi;
2660 enum machine_mode mode;
2666 code = GET_CODE (x);
2667 mode = GET_MODE (x);
2668 h = (hashval_t) code * 1048573 + mode;
2676 const int shift = sizeof (hashval_t) * CHAR_BIT;
2677 const int n = sizeof (HOST_WIDE_INT) / sizeof (hashval_t);
2680 h ^= (hashval_t) hwi;
2681 for (i = 1; i < n; ++i)
2684 h ^= (hashval_t) hwi;
2690 if (mode == VOIDmode)
2692 hwi = CONST_DOUBLE_LOW (x) ^ CONST_DOUBLE_HIGH (x);
2696 h ^= real_hash (CONST_DOUBLE_REAL_VALUE (x));
2700 h ^= htab_hash_string (XSTR (x, 0));
2704 h = h * 251 + CODE_LABEL_NUMBER (XEXP (x, 0));
2708 case UNSPEC_VOLATILE:
2709 h = h * 251 + XINT (x, 1);
2717 *hp = *hp * 509 + h;
2721 /* Compute a hash value for X, which should be a constant. */
2724 const_rtx_hash (rtx x)
2727 for_each_rtx (&x, const_rtx_hash_1, &h);
2732 /* Initialize constant pool hashing for a new function. */
2735 init_varasm_status (struct function *f)
2737 struct varasm_status *p;
2738 struct rtx_constant_pool *pool;
2740 p = ggc_alloc (sizeof (struct varasm_status));
2743 pool = ggc_alloc (sizeof (struct rtx_constant_pool));
2745 p->deferred_constants = 0;
2747 pool->const_rtx_htab = htab_create_ggc (31, const_desc_rtx_hash,
2748 const_desc_rtx_eq, NULL);
2749 pool->const_rtx_sym_htab = htab_create_ggc (31, const_desc_rtx_sym_hash,
2750 const_desc_rtx_sym_eq, NULL);
2751 pool->first = pool->last = NULL;
2755 /* Given a MINUS expression, simplify it if both sides
2756 include the same symbol. */
2759 simplify_subtraction (rtx x)
2761 rtx r = simplify_rtx (x);
2765 /* Given a constant rtx X, make (or find) a memory constant for its value
2766 and return a MEM rtx to refer to it in memory. */
2769 force_const_mem (enum machine_mode mode, rtx x)
2771 struct constant_descriptor_rtx *desc, tmp;
2772 struct rtx_constant_pool *pool = cfun->varasm->pool;
2779 /* If we're not allowed to drop X into the constant pool, don't. */
2780 if (targetm.cannot_force_const_mem (x))
2783 /* Lookup the value in the hashtable. */
2786 hash = const_rtx_hash (x);
2787 slot = htab_find_slot_with_hash (pool->const_rtx_htab, &tmp, hash, INSERT);
2790 /* If the constant was already present, return its memory. */
2792 return copy_rtx (desc->mem);
2794 /* Otherwise, create a new descriptor. */
2795 desc = ggc_alloc (sizeof (*desc));
2798 /* Align the location counter as required by EXP's data type. */
2799 align = GET_MODE_ALIGNMENT (mode == VOIDmode ? word_mode : mode);
2800 #ifdef CONSTANT_ALIGNMENT
2802 tree type = lang_hooks.types.type_for_mode (mode, 0);
2803 if (type != NULL_TREE)
2804 align = CONSTANT_ALIGNMENT (make_tree (type, x), align);
2808 pool->offset += (align / BITS_PER_UNIT) - 1;
2809 pool->offset &= ~ ((align / BITS_PER_UNIT) - 1);
2812 desc->constant = tmp.constant;
2813 desc->offset = pool->offset;
2816 desc->align = align;
2817 desc->labelno = const_labelno;
2820 pool->offset += GET_MODE_SIZE (mode);
2822 pool->last->next = desc;
2824 pool->first = pool->last = desc;
2827 /* Create a string containing the label name, in LABEL. */
2828 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
2831 /* Construct the SYMBOL_REF. Make sure to mark it as belonging to
2832 the constants pool. */
2833 desc->sym = symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label));
2834 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
2835 CONSTANT_POOL_ADDRESS_P (symbol) = 1;
2836 current_function_uses_const_pool = 1;
2838 /* Insert the descriptor into the symbol cross-reference table too. */
2839 slot = htab_find_slot (pool->const_rtx_sym_htab, desc, INSERT);
2844 /* Construct the MEM. */
2845 desc->mem = def = gen_rtx_MEM (mode, symbol);
2846 set_mem_attributes (def, lang_hooks.types.type_for_mode (mode, 0), 1);
2847 RTX_UNCHANGING_P (def) = 1;
2849 /* If we're dropping a label to the constant pool, make sure we
2851 if (GET_CODE (x) == LABEL_REF)
2852 LABEL_PRESERVE_P (XEXP (x, 0)) = 1;
2854 return copy_rtx (def);
2857 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
2858 the corresponding constant_descriptor_rtx structure. */
2860 static struct constant_descriptor_rtx *
2861 find_pool_constant (struct rtx_constant_pool *pool, rtx sym)
2863 struct constant_descriptor_rtx tmp;
2865 return htab_find (pool->const_rtx_sym_htab, &tmp);
2868 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
2871 get_pool_constant (rtx addr)
2873 return find_pool_constant (cfun->varasm->pool, addr)->constant;
2876 /* Given a constant pool SYMBOL_REF, return the corresponding constant
2877 and whether it has been output or not. */
2880 get_pool_constant_mark (rtx addr, bool *pmarked)
2882 struct constant_descriptor_rtx *desc;
2884 desc = find_pool_constant (cfun->varasm->pool, addr);
2885 *pmarked = (desc->mark != 0);
2886 return desc->constant;
2889 /* Likewise, but for the constant pool of a specific function. */
2892 get_pool_constant_for_function (struct function *f, rtx addr)
2894 return find_pool_constant (f->varasm->pool, addr)->constant;
2897 /* Similar, return the mode. */
2900 get_pool_mode (rtx addr)
2902 return find_pool_constant (cfun->varasm->pool, addr)->mode;
2906 get_pool_mode_for_function (struct function *f, rtx addr)
2908 return find_pool_constant (f->varasm->pool, addr)->mode;
2911 /* Similar, return the offset in the constant pool. */
2914 get_pool_offset (rtx addr)
2916 return find_pool_constant (cfun->varasm->pool, addr)->offset;
2919 /* Return the size of the constant pool. */
2922 get_pool_size (void)
2924 return cfun->varasm->pool->offset;
2927 /* Worker function for output_constant_pool_1. Emit assembly for X
2928 in MODE with known alignment ALIGN. */
2931 output_constant_pool_2 (enum machine_mode mode, rtx x, unsigned int align)
2933 switch (GET_MODE_CLASS (mode))
2936 if (GET_CODE (x) != CONST_DOUBLE)
2941 REAL_VALUE_FROM_CONST_DOUBLE (r, x);
2942 assemble_real (r, mode, align);
2947 case MODE_PARTIAL_INT:
2948 assemble_integer (x, GET_MODE_SIZE (mode), align, 1);
2951 case MODE_VECTOR_FLOAT:
2952 case MODE_VECTOR_INT:
2955 enum machine_mode submode = GET_MODE_INNER (mode);
2956 unsigned int subalign = MIN (align, GET_MODE_BITSIZE (submode));
2958 if (GET_CODE (x) != CONST_VECTOR)
2960 units = CONST_VECTOR_NUNITS (x);
2962 for (i = 0; i < units; i++)
2964 rtx elt = CONST_VECTOR_ELT (x, i);
2965 output_constant_pool_2 (submode, elt, i ? subalign : align);
2975 /* Worker function for output_constant_pool. Emit POOL. */
2978 output_constant_pool_1 (struct constant_descriptor_rtx *desc)
2986 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
2987 whose CODE_LABEL has been deleted. This can occur if a jump table
2988 is eliminated by optimization. If so, write a constant of zero
2989 instead. Note that this can also happen by turning the
2990 CODE_LABEL into a NOTE. */
2991 /* ??? This seems completely and utterly wrong. Certainly it's
2992 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
2993 functioning even with INSN_DELETED_P and friends. */
2996 switch (GET_CODE (x))
2999 if (GET_CODE (XEXP (x, 0)) != PLUS
3000 || GET_CODE (XEXP (XEXP (x, 0), 0)) != LABEL_REF)
3002 tmp = XEXP (XEXP (x, 0), 0);
3007 if (INSN_DELETED_P (tmp)
3008 || (GET_CODE (tmp) == NOTE
3009 && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_DELETED))
3020 /* First switch to correct section. */
3021 targetm.asm_out.select_rtx_section (desc->mode, x, desc->align);
3023 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3024 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, desc->mode,
3025 desc->align, desc->labelno, done);
3028 assemble_align (desc->align);
3030 /* Output the label. */
3031 targetm.asm_out.internal_label (asm_out_file, "LC", desc->labelno);
3033 /* Output the data. */
3034 output_constant_pool_2 (desc->mode, x, desc->align);
3036 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3037 sections have proper size. */
3038 if (desc->align > GET_MODE_BITSIZE (desc->mode)
3039 && in_section == in_named
3040 && get_named_section_flags (in_named_name) & SECTION_MERGE)
3041 assemble_align (desc->align);
3043 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3049 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3050 to as used. Emit referenced deferred strings. This function can
3051 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3054 mark_constant (rtx *current_rtx, void *data)
3056 struct rtx_constant_pool *pool = data;
3057 rtx x = *current_rtx;
3059 if (x == NULL_RTX || GET_CODE (x) != SYMBOL_REF)
3062 if (CONSTANT_POOL_ADDRESS_P (x))
3064 struct constant_descriptor_rtx *desc = find_pool_constant (pool, x);
3065 if (desc->mark == 0)
3068 for_each_rtx (&desc->constant, mark_constant, pool);
3071 else if (TREE_CONSTANT_POOL_ADDRESS_P (x))
3073 tree exp = SYMBOL_REF_DECL (x);
3074 if (!TREE_ASM_WRITTEN (exp))
3076 n_deferred_constants--;
3077 output_constant_def_contents (x);
3084 /* Look through appropriate parts of INSN, marking all entries in the
3085 constant pool which are actually being used. Entries that are only
3086 referenced by other constants are also marked as used. Emit
3087 deferred strings that are used. */
3090 mark_constants (struct rtx_constant_pool *pool, rtx insn)
3095 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3096 insns, not any notes that may be attached. We don't want to mark
3097 a constant just because it happens to appear in a REG_EQUIV note. */
3098 if (GET_CODE (PATTERN (insn)) == SEQUENCE)
3100 rtx seq = PATTERN (insn);
3101 int i, n = XVECLEN (seq, 0);
3102 for (i = 0; i < n; ++i)
3104 rtx subinsn = XVECEXP (seq, 0, i);
3105 if (INSN_P (subinsn))
3106 for_each_rtx (&PATTERN (subinsn), mark_constant, pool);
3110 for_each_rtx (&PATTERN (insn), mark_constant, pool);
3113 /* Look through the instructions for this function, and mark all the
3114 entries in POOL which are actually being used. Emit deferred constants
3115 which have indeed been used. */
3118 mark_constant_pool (struct rtx_constant_pool *pool)
3122 if (pool->first == 0 && n_deferred_constants == 0)
3125 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3126 mark_constants (pool, insn);
3128 for (link = current_function_epilogue_delay_list;
3130 link = XEXP (link, 1))
3131 mark_constants (pool, XEXP (link, 0));
3134 /* Write all the constants in the constant pool. */
3137 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED,
3138 tree fndecl ATTRIBUTE_UNUSED)
3140 struct rtx_constant_pool *pool = cfun->varasm->pool;
3141 struct constant_descriptor_rtx *desc;
3143 /* It is possible for gcc to call force_const_mem and then to later
3144 discard the instructions which refer to the constant. In such a
3145 case we do not need to output the constant. */
3146 mark_constant_pool (pool);
3148 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3149 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool->offset);
3152 for (desc = pool->first; desc ; desc = desc->next)
3153 output_constant_pool_1 (desc);
3155 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3156 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool->offset);
3160 /* Determine what kind of relocations EXP may need. */
3163 compute_reloc_for_constant (tree exp)
3165 int reloc = 0, reloc2;
3168 /* Give the front-end a chance to convert VALUE to something that
3169 looks more like a constant to the back-end. */
3170 exp = lang_hooks.expand_constant (exp);
3172 switch (TREE_CODE (exp))
3176 /* Go inside any operations that get_inner_reference can handle and see
3177 if what's inside is a constant: no need to do anything here for
3178 addresses of variables or functions. */
3179 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
3180 tem = TREE_OPERAND (tem, 0))
3183 if (TREE_PUBLIC (tem))
3190 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
3191 reloc |= compute_reloc_for_constant (TREE_OPERAND (exp, 1));
3195 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
3196 reloc2 = compute_reloc_for_constant (TREE_OPERAND (exp, 1));
3197 /* The difference of two local labels is computable at link time. */
3198 if (reloc == 1 && reloc2 == 1)
3206 case NON_LVALUE_EXPR:
3207 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
3211 for (tem = CONSTRUCTOR_ELTS (exp); tem; tem = TREE_CHAIN (tem))
3212 if (TREE_VALUE (tem) != 0)
3213 reloc |= compute_reloc_for_constant (TREE_VALUE (tem));
3223 /* Find all the constants whose addresses are referenced inside of EXP,
3224 and make sure assembler code with a label has been output for each one.
3225 Indicate whether an ADDR_EXPR has been encountered. */
3228 output_addressed_constants (tree exp)
3232 /* Give the front-end a chance to convert VALUE to something that
3233 looks more like a constant to the back-end. */
3234 exp = lang_hooks.expand_constant (exp);
3236 switch (TREE_CODE (exp))
3240 /* Go inside any operations that get_inner_reference can handle and see
3241 if what's inside is a constant: no need to do anything here for
3242 addresses of variables or functions. */
3243 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
3244 tem = TREE_OPERAND (tem, 0))
3247 if (TREE_CODE_CLASS (TREE_CODE (tem)) == 'c'
3248 || TREE_CODE (tem) == CONSTRUCTOR)
3249 output_constant_def (tem, 0);
3254 output_addressed_constants (TREE_OPERAND (exp, 1));
3259 case NON_LVALUE_EXPR:
3260 output_addressed_constants (TREE_OPERAND (exp, 0));
3264 for (tem = CONSTRUCTOR_ELTS (exp); tem; tem = TREE_CHAIN (tem))
3265 if (TREE_VALUE (tem) != 0)
3266 output_addressed_constants (TREE_VALUE (tem));
3275 /* Return nonzero if VALUE is a valid constant-valued expression
3276 for use in initializing a static variable; one that can be an
3277 element of a "constant" initializer.
3279 Return null_pointer_node if the value is absolute;
3280 if it is relocatable, return the variable that determines the relocation.
3281 We assume that VALUE has been folded as much as possible;
3282 therefore, we do not need to check for such things as
3283 arithmetic-combinations of integers. */
3286 initializer_constant_valid_p (tree value, tree endtype)
3288 /* Give the front-end a chance to convert VALUE to something that
3289 looks more like a constant to the back-end. */
3290 value = lang_hooks.expand_constant (value);
3292 switch (TREE_CODE (value))
3295 if ((TREE_CODE (TREE_TYPE (value)) == UNION_TYPE
3296 || TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE)
3297 && TREE_CONSTANT (value)
3298 && CONSTRUCTOR_ELTS (value))
3301 bool absolute = true;
3303 for (elt = CONSTRUCTOR_ELTS (value); elt; elt = TREE_CHAIN (elt))
3306 value = TREE_VALUE (elt);
3307 reloc = initializer_constant_valid_p (value, TREE_TYPE (value));
3310 if (reloc != null_pointer_node)
3313 /* For a non-absolute relocation, there is no single
3314 variable that can be "the variable that determines the
3316 return absolute ? null_pointer_node : error_mark_node;
3319 return TREE_STATIC (value) ? null_pointer_node : NULL_TREE;
3326 return null_pointer_node;
3330 return staticp (TREE_OPERAND (value, 0)) ? TREE_OPERAND (value, 0) : 0;
3332 case VIEW_CONVERT_EXPR:
3333 case NON_LVALUE_EXPR:
3334 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3338 /* Allow conversions between pointer types. */
3339 if (POINTER_TYPE_P (TREE_TYPE (value))
3340 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3341 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3343 /* Allow conversions between real types. */
3344 if (FLOAT_TYPE_P (TREE_TYPE (value))
3345 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3346 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3348 /* Allow length-preserving conversions between integer types. */
3349 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3350 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3351 && (TYPE_PRECISION (TREE_TYPE (value))
3352 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3353 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3355 /* Allow conversions between other integer types only if
3357 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3358 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3360 tree inner = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3362 if (inner == null_pointer_node)
3363 return null_pointer_node;
3367 /* Allow (int) &foo provided int is as wide as a pointer. */
3368 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3369 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3370 && (TYPE_PRECISION (TREE_TYPE (value))
3371 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3372 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3375 /* Likewise conversions from int to pointers, but also allow
3376 conversions from 0. */
3377 if ((POINTER_TYPE_P (TREE_TYPE (value))
3378 || TREE_CODE (TREE_TYPE (value)) == OFFSET_TYPE)
3379 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3381 if (integer_zerop (TREE_OPERAND (value, 0)))
3382 return null_pointer_node;
3383 else if (TYPE_PRECISION (TREE_TYPE (value))
3384 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0))))
3385 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3389 /* Allow conversions to struct or union types if the value
3391 if (TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE
3392 || TREE_CODE (TREE_TYPE (value)) == UNION_TYPE)
3393 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3398 if (! INTEGRAL_TYPE_P (endtype)
3399 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3401 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3403 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3405 /* If either term is absolute, use the other terms relocation. */
3406 if (valid0 == null_pointer_node)
3408 if (valid1 == null_pointer_node)
3414 if (! INTEGRAL_TYPE_P (endtype)
3415 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3417 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3419 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3421 /* Win if second argument is absolute. */
3422 if (valid1 == null_pointer_node)
3424 /* Win if both arguments have the same relocation.
3425 Then the value is absolute. */
3426 if (valid0 == valid1 && valid0 != 0)
3427 return null_pointer_node;
3429 /* Since GCC guarantees that string constants are unique in the
3430 generated code, a subtraction between two copies of the same
3431 constant string is absolute. */
3432 if (valid0 && TREE_CODE (valid0) == STRING_CST &&
3433 valid1 && TREE_CODE (valid1) == STRING_CST &&
3434 TREE_STRING_POINTER (valid0) == TREE_STRING_POINTER (valid1))
3435 return null_pointer_node;
3438 /* Support differences between labels. */
3439 if (INTEGRAL_TYPE_P (endtype))
3442 op0 = TREE_OPERAND (value, 0);
3443 op1 = TREE_OPERAND (value, 1);
3445 /* Like STRIP_NOPS except allow the operand mode to widen.
3446 This works around a feature of fold that simplifies
3447 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3448 that the narrower operation is cheaper. */
3450 while (TREE_CODE (op0) == NOP_EXPR
3451 || TREE_CODE (op0) == CONVERT_EXPR
3452 || TREE_CODE (op0) == NON_LVALUE_EXPR)
3454 tree inner = TREE_OPERAND (op0, 0);
3455 if (inner == error_mark_node
3456 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3457 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0)))
3458 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3463 while (TREE_CODE (op1) == NOP_EXPR
3464 || TREE_CODE (op1) == CONVERT_EXPR
3465 || TREE_CODE (op1) == NON_LVALUE_EXPR)
3467 tree inner = TREE_OPERAND (op1, 0);
3468 if (inner == error_mark_node
3469 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3470 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1)))
3471 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3476 if (TREE_CODE (op0) == ADDR_EXPR
3477 && TREE_CODE (TREE_OPERAND (op0, 0)) == LABEL_DECL
3478 && TREE_CODE (op1) == ADDR_EXPR
3479 && TREE_CODE (TREE_OPERAND (op1, 0)) == LABEL_DECL)
3480 return null_pointer_node;
3491 /* Output assembler code for constant EXP to FILE, with no label.
3492 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3493 Assumes output_addressed_constants has been done on EXP already.
3495 Generate exactly SIZE bytes of assembler data, padding at the end
3496 with zeros if necessary. SIZE must always be specified.
3498 SIZE is important for structure constructors,
3499 since trailing members may have been omitted from the constructor.
3500 It is also important for initialization of arrays from string constants
3501 since the full length of the string constant might not be wanted.
3502 It is also needed for initialization of unions, where the initializer's
3503 type is just one member, and that may not be as long as the union.
3505 There a case in which we would fail to output exactly SIZE bytes:
3506 for a structure constructor that wants to produce more than SIZE bytes.
3507 But such constructors will never be generated for any possible input.
3509 ALIGN is the alignment of the data in bits. */
3512 output_constant (tree exp, unsigned HOST_WIDE_INT size, unsigned int align)
3514 enum tree_code code;
3515 unsigned HOST_WIDE_INT thissize;
3517 /* Some front-ends use constants other than the standard language-independent
3518 varieties, but which may still be output directly. Give the front-end a
3519 chance to convert EXP to a language-independent representation. */
3520 exp = lang_hooks.expand_constant (exp);
3522 if (size == 0 || flag_syntax_only)
3525 /* Eliminate any conversions since we'll be outputting the underlying
3527 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
3528 || TREE_CODE (exp) == NON_LVALUE_EXPR
3529 || TREE_CODE (exp) == VIEW_CONVERT_EXPR)
3530 exp = TREE_OPERAND (exp, 0);
3532 code = TREE_CODE (TREE_TYPE (exp));
3533 thissize = int_size_in_bytes (TREE_TYPE (exp));
3535 /* Allow a constructor with no elements for any data type.
3536 This means to fill the space with zeros. */
3537 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
3539 assemble_zeros (size);
3543 if (TREE_CODE (exp) == FDESC_EXPR)
3545 #ifdef ASM_OUTPUT_FDESC
3546 HOST_WIDE_INT part = tree_low_cst (TREE_OPERAND (exp, 1), 0);
3547 tree decl = TREE_OPERAND (exp, 0);
3548 ASM_OUTPUT_FDESC (asm_out_file, decl, part);
3555 /* Now output the underlying data. If we've handling the padding, return.
3556 Otherwise, break and ensure THISSIZE is the size written. */
3564 case REFERENCE_TYPE:
3566 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
3567 EXPAND_INITIALIZER),
3569 error ("initializer for integer value is too complicated");
3573 if (TREE_CODE (exp) != REAL_CST)
3574 error ("initializer for floating value is not a floating constant");
3576 assemble_real (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)), align);
3580 output_constant (TREE_REALPART (exp), thissize / 2, align);
3581 output_constant (TREE_IMAGPART (exp), thissize / 2,
3582 min_align (align, BITS_PER_UNIT * (thissize / 2)));
3587 if (TREE_CODE (exp) == CONSTRUCTOR)
3589 output_constructor (exp, size, align);
3592 else if (TREE_CODE (exp) == STRING_CST)
3594 thissize = MIN ((unsigned HOST_WIDE_INT)TREE_STRING_LENGTH (exp),
3596 assemble_string (TREE_STRING_POINTER (exp), thissize);
3598 else if (TREE_CODE (exp) == VECTOR_CST)
3602 unsigned int nalign;
3603 enum machine_mode inner;
3605 inner = GET_MODE_INNER (TYPE_MODE (TREE_TYPE (exp)));
3606 nalign = MIN (align, GET_MODE_ALIGNMENT (inner));
3608 elt_size = GET_MODE_UNIT_SIZE (TYPE_MODE (TREE_TYPE (exp)));
3610 link = TREE_VECTOR_CST_ELTS (exp);
3611 output_constant (TREE_VALUE (link), elt_size, align);
3612 while ((link = TREE_CHAIN (link)) != NULL)
3613 output_constant (TREE_VALUE (link), elt_size, nalign);
3621 if (TREE_CODE (exp) == CONSTRUCTOR)
3622 output_constructor (exp, size, align);
3628 if (TREE_CODE (exp) == INTEGER_CST)
3629 assemble_integer (expand_expr (exp, NULL_RTX,
3630 VOIDmode, EXPAND_INITIALIZER),
3631 thissize, align, 1);
3632 else if (TREE_CODE (exp) == CONSTRUCTOR)
3634 unsigned char *buffer = alloca (thissize);
3635 if (get_set_constructor_bytes (exp, buffer, thissize))
3637 assemble_string ((char *) buffer, thissize);
3640 error ("unknown set constructor type");
3650 if (size > thissize)
3651 assemble_zeros (size - thissize);
3655 /* Subroutine of output_constructor, used for computing the size of
3656 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3657 type with an unspecified upper bound. */
3659 static unsigned HOST_WIDE_INT
3660 array_size_for_constructor (tree val)
3664 /* This code used to attempt to handle string constants that are not
3665 arrays of single-bytes, but nothing else does, so there's no point in
3667 if (TREE_CODE (val) == STRING_CST)
3668 return TREE_STRING_LENGTH (val);
3670 max_index = NULL_TREE;
3671 for (i = CONSTRUCTOR_ELTS (val); i; i = TREE_CHAIN (i))
3673 tree index = TREE_PURPOSE (i);
3675 if (TREE_CODE (index) == RANGE_EXPR)
3676 index = TREE_OPERAND (index, 1);
3677 if (max_index == NULL_TREE || tree_int_cst_lt (max_index, index))
3681 if (max_index == NULL_TREE)
3684 /* Compute the total number of array elements. */
3685 i = size_binop (MINUS_EXPR, convert (sizetype, max_index),
3687 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val)))));
3688 i = size_binop (PLUS_EXPR, i, convert (sizetype, integer_one_node));
3690 /* Multiply by the array element unit size to find number of bytes. */
3691 i = size_binop (MULT_EXPR, i, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val))));
3693 return tree_low_cst (i, 1);
3696 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3697 Generate at least SIZE bytes, padding if necessary. */
3700 output_constructor (tree exp, unsigned HOST_WIDE_INT size,
3703 tree type = TREE_TYPE (exp);
3704 tree link, field = 0;
3706 /* Number of bytes output or skipped so far.
3707 In other words, current position within the constructor. */
3708 HOST_WIDE_INT total_bytes = 0;
3709 /* Nonzero means BYTE contains part of a byte, to be output. */
3710 int byte_buffer_in_use = 0;
3713 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
3716 if (TREE_CODE (type) == RECORD_TYPE)
3717 field = TYPE_FIELDS (type);
3719 if (TREE_CODE (type) == ARRAY_TYPE
3720 && TYPE_DOMAIN (type) != 0)
3721 min_index = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
3723 /* As LINK goes through the elements of the constant,
3724 FIELD goes through the structure fields, if the constant is a structure.
3725 if the constant is a union, then we override this,
3726 by getting the field from the TREE_LIST element.
3727 But the constant could also be an array. Then FIELD is zero.
3729 There is always a maximum of one element in the chain LINK for unions
3730 (even if the initializer in a source program incorrectly contains
3732 for (link = CONSTRUCTOR_ELTS (exp);
3734 link = TREE_CHAIN (link),
3735 field = field ? TREE_CHAIN (field) : 0)
3737 tree val = TREE_VALUE (link);
3740 /* The element in a union constructor specifies the proper field
3742 if ((TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
3743 || TREE_CODE (type) == QUAL_UNION_TYPE)
3744 && TREE_PURPOSE (link) != 0)
3745 field = TREE_PURPOSE (link);
3747 else if (TREE_CODE (type) == ARRAY_TYPE)
3748 index = TREE_PURPOSE (link);
3750 #ifdef ASM_COMMENT_START
3751 if (field && flag_verbose_asm)
3752 fprintf (asm_out_file, "%s %s:\n",
3755 ? IDENTIFIER_POINTER (DECL_NAME (field))
3759 /* Eliminate the marker that makes a cast not be an lvalue. */
3763 if (index && TREE_CODE (index) == RANGE_EXPR)
3765 unsigned HOST_WIDE_INT fieldsize
3766 = int_size_in_bytes (TREE_TYPE (type));
3767 HOST_WIDE_INT lo_index = tree_low_cst (TREE_OPERAND (index, 0), 0);
3768 HOST_WIDE_INT hi_index = tree_low_cst (TREE_OPERAND (index, 1), 0);
3769 HOST_WIDE_INT index;
3770 unsigned int align2 = min_align (align, fieldsize * BITS_PER_UNIT);
3772 for (index = lo_index; index <= hi_index; index++)
3774 /* Output the element's initial value. */
3776 assemble_zeros (fieldsize);
3778 output_constant (val, fieldsize, align2);
3780 /* Count its size. */
3781 total_bytes += fieldsize;
3784 else if (field == 0 || !DECL_BIT_FIELD (field))
3786 /* An element that is not a bit-field. */
3788 unsigned HOST_WIDE_INT fieldsize;
3789 /* Since this structure is static,
3790 we know the positions are constant. */
3791 HOST_WIDE_INT pos = field ? int_byte_position (field) : 0;
3792 unsigned int align2;
3795 pos = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val)), 1)
3796 * (tree_low_cst (index, 0) - tree_low_cst (min_index, 0)));
3798 /* Output any buffered-up bit-fields preceding this element. */
3799 if (byte_buffer_in_use)
3801 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
3803 byte_buffer_in_use = 0;
3806 /* Advance to offset of this element.
3807 Note no alignment needed in an array, since that is guaranteed
3808 if each element has the proper size. */
3809 if ((field != 0 || index != 0) && pos != total_bytes)
3811 assemble_zeros (pos - total_bytes);
3815 /* Find the alignment of this element. */
3816 align2 = min_align (align, BITS_PER_UNIT * pos);
3818 /* Determine size this element should occupy. */
3823 /* If this is an array with an unspecified upper bound,
3824 the initializer determines the size. */
3825 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
3826 but we cannot do this until the deprecated support for
3827 initializing zero-length array members is removed. */
3828 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE
3829 && TYPE_DOMAIN (TREE_TYPE (field))
3830 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field))))
3832 fieldsize = array_size_for_constructor (val);
3833 /* Given a non-empty initialization, this field had
3835 if (fieldsize != 0 && TREE_CHAIN (field) != NULL_TREE)
3838 else if (DECL_SIZE_UNIT (field))
3840 /* ??? This can't be right. If the decl size overflows
3841 a host integer we will silently emit no data. */
3842 if (host_integerp (DECL_SIZE_UNIT (field), 1))
3843 fieldsize = tree_low_cst (DECL_SIZE_UNIT (field), 1);
3847 fieldsize = int_size_in_bytes (TREE_TYPE (type));
3849 /* Output the element's initial value. */
3851 assemble_zeros (fieldsize);
3853 output_constant (val, fieldsize, align2);
3855 /* Count its size. */
3856 total_bytes += fieldsize;
3858 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
3859 error ("invalid initial value for member `%s'",
3860 IDENTIFIER_POINTER (DECL_NAME (field)));
3863 /* Element that is a bit-field. */
3865 HOST_WIDE_INT next_offset = int_bit_position (field);
3866 HOST_WIDE_INT end_offset
3867 = (next_offset + tree_low_cst (DECL_SIZE (field), 1));
3870 val = integer_zero_node;
3872 /* If this field does not start in this (or, next) byte,
3874 if (next_offset / BITS_PER_UNIT != total_bytes)
3876 /* Output remnant of any bit field in previous bytes. */
3877 if (byte_buffer_in_use)
3879 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
3881 byte_buffer_in_use = 0;
3884 /* If still not at proper byte, advance to there. */
3885 if (next_offset / BITS_PER_UNIT != total_bytes)
3887 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
3888 total_bytes = next_offset / BITS_PER_UNIT;
3892 if (! byte_buffer_in_use)
3895 /* We must split the element into pieces that fall within
3896 separate bytes, and combine each byte with previous or
3897 following bit-fields. */
3899 /* next_offset is the offset n fbits from the beginning of
3900 the structure to the next bit of this element to be processed.
3901 end_offset is the offset of the first bit past the end of
3903 while (next_offset < end_offset)
3907 HOST_WIDE_INT value;
3908 HOST_WIDE_INT next_byte = next_offset / BITS_PER_UNIT;
3909 HOST_WIDE_INT next_bit = next_offset % BITS_PER_UNIT;
3911 /* Advance from byte to byte
3912 within this element when necessary. */
3913 while (next_byte != total_bytes)
3915 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
3920 /* Number of bits we can process at once
3921 (all part of the same byte). */
3922 this_time = MIN (end_offset - next_offset,
3923 BITS_PER_UNIT - next_bit);
3924 if (BYTES_BIG_ENDIAN)
3926 /* On big-endian machine, take the most significant bits
3927 first (of the bits that are significant)
3928 and put them into bytes from the most significant end. */
3929 shift = end_offset - next_offset - this_time;
3931 /* Don't try to take a bunch of bits that cross
3932 the word boundary in the INTEGER_CST. We can
3933 only select bits from the LOW or HIGH part
3935 if (shift < HOST_BITS_PER_WIDE_INT
3936 && shift + this_time > HOST_BITS_PER_WIDE_INT)
3938 this_time = shift + this_time - HOST_BITS_PER_WIDE_INT;
3939 shift = HOST_BITS_PER_WIDE_INT;
3942 /* Now get the bits from the appropriate constant word. */
3943 if (shift < HOST_BITS_PER_WIDE_INT)
3944 value = TREE_INT_CST_LOW (val);
3945 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
3947 value = TREE_INT_CST_HIGH (val);
3948 shift -= HOST_BITS_PER_WIDE_INT;
3953 /* Get the result. This works only when:
3954 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
3955 byte |= (((value >> shift)
3956 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
3957 << (BITS_PER_UNIT - this_time - next_bit));
3961 /* On little-endian machines,
3962 take first the least significant bits of the value
3963 and pack them starting at the least significant
3964 bits of the bytes. */
3965 shift = next_offset - int_bit_position (field);
3967 /* Don't try to take a bunch of bits that cross
3968 the word boundary in the INTEGER_CST. We can
3969 only select bits from the LOW or HIGH part
3971 if (shift < HOST_BITS_PER_WIDE_INT
3972 && shift + this_time > HOST_BITS_PER_WIDE_INT)
3973 this_time = (HOST_BITS_PER_WIDE_INT - shift);
3975 /* Now get the bits from the appropriate constant word. */
3976 if (shift < HOST_BITS_PER_WIDE_INT)
3977 value = TREE_INT_CST_LOW (val);
3978 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
3980 value = TREE_INT_CST_HIGH (val);
3981 shift -= HOST_BITS_PER_WIDE_INT;
3986 /* Get the result. This works only when:
3987 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
3988 byte |= (((value >> shift)
3989 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
3993 next_offset += this_time;
3994 byte_buffer_in_use = 1;
3999 if (byte_buffer_in_use)
4001 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4005 if ((unsigned HOST_WIDE_INT)total_bytes < size)
4006 assemble_zeros (size - total_bytes);
4009 /* This TREE_LIST contains any weak symbol declarations waiting
4011 static GTY(()) tree weak_decls;
4013 /* Mark DECL as weak. */
4016 mark_weak (tree decl)
4018 DECL_WEAK (decl) = 1;
4020 if (DECL_RTL_SET_P (decl)
4021 && GET_CODE (DECL_RTL (decl)) == MEM
4022 && XEXP (DECL_RTL (decl), 0)
4023 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == SYMBOL_REF)
4024 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl), 0)) = 1;
4027 /* Merge weak status between NEWDECL and OLDDECL. */
4030 merge_weak (tree newdecl, tree olddecl)
4032 if (DECL_WEAK (newdecl) == DECL_WEAK (olddecl))
4035 if (DECL_WEAK (newdecl))
4039 /* NEWDECL is weak, but OLDDECL is not. */
4041 /* If we already output the OLDDECL, we're in trouble; we can't
4042 go back and make it weak. This error cannot caught in
4043 declare_weak because the NEWDECL and OLDDECL was not yet
4044 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4045 if (TREE_ASM_WRITTEN (olddecl))
4046 error ("%Jweak declaration of '%D' must precede definition",
4049 /* If we've already generated rtl referencing OLDDECL, we may
4050 have done so in a way that will not function properly with
4052 else if (TREE_USED (olddecl)
4053 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl)))
4054 warning ("%Jweak declaration of '%D' after first use results "
4055 "in unspecified behavior", newdecl, newdecl);
4059 /* We put the NEWDECL on the weak_decls list at some point.
4060 Replace it with the OLDDECL. */
4061 for (wd = weak_decls; wd; wd = TREE_CHAIN (wd))
4062 if (TREE_VALUE (wd) == newdecl)
4064 TREE_VALUE (wd) = olddecl;
4067 /* We may not find the entry on the list. If NEWDECL is a
4068 weak alias, then we will have already called
4069 globalize_decl to remove the entry; in that case, we do
4070 not need to do anything. */
4073 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4074 mark_weak (olddecl);
4077 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4078 weak. Just update NEWDECL to indicate that it's weak too. */
4079 mark_weak (newdecl);
4082 /* Declare DECL to be a weak symbol. */
4085 declare_weak (tree decl)
4087 if (! TREE_PUBLIC (decl))
4088 error ("%Jweak declaration of '%D' must be public", decl, decl);
4089 else if (TREE_CODE (decl) == FUNCTION_DECL && TREE_ASM_WRITTEN (decl))
4090 error ("%Jweak declaration of '%D' must precede definition", decl, decl);
4091 else if (SUPPORTS_WEAK)
4093 if (! DECL_WEAK (decl))
4094 weak_decls = tree_cons (NULL, decl, weak_decls);
4097 warning ("%Jweak declaration of '%D' not supported", decl, decl);
4102 /* Emit any pending weak declarations. */
4109 for (t = weak_decls; t; t = TREE_CHAIN (t))
4111 tree decl = TREE_VALUE (t);
4112 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4113 const char *const name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4116 if (! TREE_USED (decl))
4119 #ifdef ASM_WEAKEN_DECL
4120 ASM_WEAKEN_DECL (asm_out_file, decl, name, NULL);
4122 #ifdef ASM_WEAKEN_LABEL
4123 ASM_WEAKEN_LABEL (asm_out_file, name);
4125 #ifdef ASM_OUTPUT_WEAK_ALIAS
4126 warning ("only weak aliases are supported in this configuration");
4134 /* Emit the assembly bits to indicate that DECL is globally visible. */
4137 globalize_decl (tree decl)
4139 const char *name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4141 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4142 if (DECL_WEAK (decl))
4146 #ifdef ASM_WEAKEN_DECL
4147 ASM_WEAKEN_DECL (asm_out_file, decl, name, 0);
4149 ASM_WEAKEN_LABEL (asm_out_file, name);
4152 /* Remove this function from the pending weak list so that
4153 we do not emit multiple .weak directives for it. */
4154 for (p = &weak_decls; (t = *p) ; )
4156 if (DECL_ASSEMBLER_NAME (decl) == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
4157 *p = TREE_CHAIN (t);
4159 p = &TREE_CHAIN (t);
4163 #elif defined(ASM_MAKE_LABEL_LINKONCE)
4164 if (DECL_ONE_ONLY (decl))
4165 ASM_MAKE_LABEL_LINKONCE (asm_out_file, name);
4168 targetm.asm_out.globalize_label (asm_out_file, name);
4171 /* Emit an assembler directive to make the symbol for DECL an alias to
4172 the symbol for TARGET. */
4175 assemble_alias (tree decl, tree target ATTRIBUTE_UNUSED)
4179 /* We must force creation of DECL_RTL for debug info generation, even though
4180 we don't use it here. */
4181 make_decl_rtl (decl, NULL);
4183 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4185 #ifdef ASM_OUTPUT_DEF
4186 /* Make name accessible from other files, if appropriate. */
4188 if (TREE_PUBLIC (decl))
4190 globalize_decl (decl);
4191 maybe_assemble_visibility (decl);
4194 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4195 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
4197 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4199 #else /* !ASM_OUTPUT_DEF */
4200 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4201 if (DECL_WEAK (decl))
4204 #ifdef ASM_WEAKEN_DECL
4205 ASM_WEAKEN_DECL (asm_out_file, decl, name, IDENTIFIER_POINTER (target));
4207 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
4209 /* Remove this function from the pending weak list so that
4210 we do not emit multiple .weak directives for it. */
4211 for (p = &weak_decls; (t = *p) ; )
4212 if (DECL_ASSEMBLER_NAME (decl)
4213 == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
4214 *p = TREE_CHAIN (t);
4216 p = &TREE_CHAIN (t);
4219 warning ("only weak aliases are supported in this configuration");
4222 warning ("alias definitions not supported in this configuration; ignored");
4226 TREE_USED (decl) = 1;
4227 TREE_ASM_WRITTEN (decl) = 1;
4228 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl)) = 1;
4231 /* Emit an assembler directive to set symbol for DECL visibility to
4232 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4235 default_assemble_visibility (tree decl, int vis)
4237 static const char * const visibility_types[] = {
4238 NULL, "internal", "hidden", "protected"
4241 const char *name, *type;
4243 name = (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
4244 type = visibility_types[vis];
4246 #ifdef HAVE_GAS_HIDDEN
4247 fprintf (asm_out_file, "\t.%s\t", type);
4248 assemble_name (asm_out_file, name);
4249 fprintf (asm_out_file, "\n");
4251 warning ("visibility attribute not supported in this configuration; ignored");
4255 /* A helper function to call assemble_visibility when needed for a decl. */
4258 maybe_assemble_visibility (tree decl)
4260 enum symbol_visibility vis = DECL_VISIBILITY (decl);
4262 if (vis != VISIBILITY_DEFAULT)
4263 targetm.asm_out.visibility (decl, vis);
4266 /* Returns 1 if the target configuration supports defining public symbols
4267 so that one of them will be chosen at link time instead of generating a
4268 multiply-defined symbol error, whether through the use of weak symbols or
4269 a target-specific mechanism for having duplicates discarded. */
4272 supports_one_only (void)
4274 if (SUPPORTS_ONE_ONLY)
4276 return SUPPORTS_WEAK;
4279 /* Set up DECL as a public symbol that can be defined in multiple
4280 translation units without generating a linker error. */
4283 make_decl_one_only (tree decl)
4285 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL)
4288 TREE_PUBLIC (decl) = 1;
4290 if (SUPPORTS_ONE_ONLY)
4292 #ifdef MAKE_DECL_ONE_ONLY
4293 MAKE_DECL_ONE_ONLY (decl);
4295 DECL_ONE_ONLY (decl) = 1;
4297 else if (TREE_CODE (decl) == VAR_DECL
4298 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
4299 DECL_COMMON (decl) = 1;
4300 else if (SUPPORTS_WEAK)
4301 DECL_WEAK (decl) = 1;
4307 init_varasm_once (void)
4309 in_named_htab = htab_create_ggc (31, in_named_entry_hash,
4310 in_named_entry_eq, NULL);
4311 const_desc_htab = htab_create_ggc (1009, const_desc_hash,
4312 const_desc_eq, NULL);
4314 const_alias_set = new_alias_set ();
4318 decl_tls_model (tree decl)
4320 enum tls_model kind;
4321 tree attr = lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl));
4326 attr = TREE_VALUE (TREE_VALUE (attr));
4327 if (TREE_CODE (attr) != STRING_CST)
4329 if (!strcmp (TREE_STRING_POINTER (attr), "local-exec"))
4330 kind = TLS_MODEL_LOCAL_EXEC;
4331 else if (!strcmp (TREE_STRING_POINTER (attr), "initial-exec"))
4332 kind = TLS_MODEL_INITIAL_EXEC;
4333 else if (!strcmp (TREE_STRING_POINTER (attr), "local-dynamic"))
4334 kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
4335 else if (!strcmp (TREE_STRING_POINTER (attr), "global-dynamic"))
4336 kind = TLS_MODEL_GLOBAL_DYNAMIC;
4342 is_local = targetm.binds_local_p (decl);
4346 kind = TLS_MODEL_LOCAL_EXEC;
4348 kind = TLS_MODEL_INITIAL_EXEC;
4350 /* Local dynamic is inefficient when we're not combining the
4351 parts of the address. */
4352 else if (optimize && is_local)
4353 kind = TLS_MODEL_LOCAL_DYNAMIC;
4355 kind = TLS_MODEL_GLOBAL_DYNAMIC;
4356 if (kind < flag_tls_default)
4357 kind = flag_tls_default;
4362 /* Select a set of attributes for section NAME based on the properties
4363 of DECL and whether or not RELOC indicates that DECL's initializer
4364 might contain runtime relocations.
4366 We make the section read-only and executable for a function decl,
4367 read-only for a const data decl, and writable for a non-const data decl. */
4370 default_section_type_flags (tree decl, const char *name, int reloc)
4372 return default_section_type_flags_1 (decl, name, reloc, flag_pic);
4376 default_section_type_flags_1 (tree decl, const char *name, int reloc,
4381 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
4382 flags = SECTION_CODE;
4383 else if (decl && decl_readonly_section_1 (decl, reloc, shlib))
4385 else if (strcmp (name, UNLIKELY_EXECUTED_TEXT_SECTION_NAME) == 0)
4386 flags = SECTION_CODE;
4388 flags = SECTION_WRITE;
4390 if (decl && DECL_ONE_ONLY (decl))
4391 flags |= SECTION_LINKONCE;
4393 if (decl && TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4394 flags |= SECTION_TLS | SECTION_WRITE;
4396 if (strcmp (name, ".bss") == 0
4397 || strncmp (name, ".bss.", 5) == 0
4398 || strncmp (name, ".gnu.linkonce.b.", 16) == 0
4399 || strcmp (name, ".sbss") == 0
4400 || strncmp (name, ".sbss.", 6) == 0
4401 || strncmp (name, ".gnu.linkonce.sb.", 17) == 0
4402 || strcmp (name, ".tbss") == 0
4403 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4404 flags |= SECTION_BSS;
4406 if (strcmp (name, ".tdata") == 0
4407 || strcmp (name, ".tbss") == 0
4408 || strncmp (name, ".gnu.linkonce.td.", 17) == 0
4409 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4410 flags |= SECTION_TLS;
4412 /* These three sections have special ELF types. They are neither
4413 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4414 want to print a section type (@progbits or @nobits). If someone
4415 is silly enough to emit code or TLS variables to one of these
4416 sections, then don't handle them specially. */
4417 if (!(flags & (SECTION_CODE | SECTION_BSS | SECTION_TLS))
4418 && (strcmp (name, ".init_array") == 0
4419 || strcmp (name, ".fini_array") == 0
4420 || strcmp (name, ".preinit_array") == 0))
4421 flags |= SECTION_NOTYPE;
4426 /* Output assembly to switch to section NAME with attribute FLAGS.
4427 Four variants for common object file formats. */
4430 default_no_named_section (const char *name ATTRIBUTE_UNUSED,
4431 unsigned int flags ATTRIBUTE_UNUSED)
4433 /* Some object formats don't support named sections at all. The
4434 front-end should already have flagged this as an error. */
4439 default_elf_asm_named_section (const char *name, unsigned int flags)
4441 char flagchars[10], *f = flagchars;
4443 if (! named_section_first_declaration (name))
4445 fprintf (asm_out_file, "\t.section\t%s\n", name);
4449 if (!(flags & SECTION_DEBUG))
4451 if (flags & SECTION_WRITE)
4453 if (flags & SECTION_CODE)
4455 if (flags & SECTION_SMALL)
4457 if (flags & SECTION_MERGE)
4459 if (flags & SECTION_STRINGS)
4461 if (flags & SECTION_TLS)
4465 fprintf (asm_out_file, "\t.section\t%s,\"%s\"", name, flagchars);
4467 if (!(flags & SECTION_NOTYPE))
4471 if (flags & SECTION_BSS)
4476 fprintf (asm_out_file, ",@%s", type);
4478 if (flags & SECTION_ENTSIZE)
4479 fprintf (asm_out_file, ",%d", flags & SECTION_ENTSIZE);
4482 putc ('\n', asm_out_file);
4486 default_coff_asm_named_section (const char *name, unsigned int flags)
4488 char flagchars[8], *f = flagchars;
4490 if (flags & SECTION_WRITE)
4492 if (flags & SECTION_CODE)
4496 fprintf (asm_out_file, "\t.section\t%s,\"%s\"\n", name, flagchars);
4500 default_pe_asm_named_section (const char *name, unsigned int flags)
4502 default_coff_asm_named_section (name, flags);
4504 if (flags & SECTION_LINKONCE)
4506 /* Functions may have been compiled at various levels of
4507 optimization so we can't use `same_size' here.
4508 Instead, have the linker pick one. */
4509 fprintf (asm_out_file, "\t.linkonce %s\n",
4510 (flags & SECTION_CODE ? "discard" : "same_size"));
4514 /* The lame default section selector. */
4517 default_select_section (tree decl, int reloc,
4518 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED)
4520 bool readonly = false;
4524 if (decl_readonly_section (decl, reloc))
4527 else if (TREE_CODE (decl) == CONSTRUCTOR)
4529 if (! ((flag_pic && reloc)
4530 || !TREE_READONLY (decl)
4531 || TREE_SIDE_EFFECTS (decl)
4532 || !TREE_CONSTANT (decl)))
4535 else if (TREE_CODE (decl) == STRING_CST)
4537 else if (! (flag_pic && reloc))
4541 readonly_data_section ();
4546 /* A helper function for default_elf_select_section and
4547 default_elf_unique_section. Categorizes the DECL. */
4549 enum section_category
4554 SECCAT_RODATA_MERGE_STR,
4555 SECCAT_RODATA_MERGE_STR_INIT,
4556 SECCAT_RODATA_MERGE_CONST,
4561 /* To optimize loading of shared programs, define following subsections
4563 _REL Contains data that has relocations, so they get grouped
4564 together and dynamic linker will visit fewer pages in memory.
4565 _RO Contains data that is otherwise read-only. This is useful
4566 with prelinking as most relocations won't be dynamically
4567 linked and thus stay read only.
4568 _LOCAL Marks data containing relocations only to local objects.
4569 These relocations will get fully resolved by prelinking. */
4571 SECCAT_DATA_REL_LOCAL,
4573 SECCAT_DATA_REL_RO_LOCAL,
4583 static enum section_category
4584 categorize_decl_for_section (tree, int, int);
4586 static enum section_category
4587 categorize_decl_for_section (tree decl, int reloc, int shlib)
4589 enum section_category ret;
4591 if (TREE_CODE (decl) == FUNCTION_DECL)
4593 else if (TREE_CODE (decl) == STRING_CST)
4594 return SECCAT_RODATA_MERGE_STR;
4595 else if (TREE_CODE (decl) == VAR_DECL)
4597 if (DECL_INITIAL (decl) == NULL
4598 || DECL_INITIAL (decl) == error_mark_node)
4600 else if (! TREE_READONLY (decl)
4601 || TREE_SIDE_EFFECTS (decl)
4602 || ! TREE_CONSTANT (DECL_INITIAL (decl)))
4604 if (shlib && (reloc & 2))
4605 ret = SECCAT_DATA_REL;
4606 else if (shlib && reloc)
4607 ret = SECCAT_DATA_REL_LOCAL;
4611 else if (shlib && (reloc & 2))
4612 ret = SECCAT_DATA_REL_RO;
4613 else if (shlib && reloc)
4614 ret = SECCAT_DATA_REL_RO_LOCAL;
4615 else if (reloc || flag_merge_constants < 2)
4616 /* C and C++ don't allow different variables to share the same
4617 location. -fmerge-all-constants allows even that (at the
4618 expense of not conforming). */
4619 ret = SECCAT_RODATA;
4620 else if (TREE_CODE (DECL_INITIAL (decl)) == STRING_CST)
4621 ret = SECCAT_RODATA_MERGE_STR_INIT;
4623 ret = SECCAT_RODATA_MERGE_CONST;
4625 else if (TREE_CODE (decl) == CONSTRUCTOR)
4627 if ((shlib && reloc)
4628 || TREE_SIDE_EFFECTS (decl)
4629 || ! TREE_CONSTANT (decl))
4632 ret = SECCAT_RODATA;
4635 ret = SECCAT_RODATA;
4637 /* There are no read-only thread-local sections. */
4638 if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4640 if (ret == SECCAT_BSS)
4646 /* If the target uses small data sections, select it. */
4647 else if (targetm.in_small_data_p (decl))
4649 if (ret == SECCAT_BSS)
4651 else if (targetm.have_srodata_section && ret == SECCAT_RODATA)
4652 ret = SECCAT_SRODATA;
4661 decl_readonly_section (tree decl, int reloc)
4663 return decl_readonly_section_1 (decl, reloc, flag_pic);
4667 decl_readonly_section_1 (tree decl, int reloc, int shlib)
4669 switch (categorize_decl_for_section (decl, reloc, shlib))
4672 case SECCAT_RODATA_MERGE_STR:
4673 case SECCAT_RODATA_MERGE_STR_INIT:
4674 case SECCAT_RODATA_MERGE_CONST:
4675 case SECCAT_SRODATA:
4684 /* Select a section based on the above categorization. */
4687 default_elf_select_section (tree decl, int reloc,
4688 unsigned HOST_WIDE_INT align)
4690 default_elf_select_section_1 (decl, reloc, align, flag_pic);
4694 default_elf_select_section_1 (tree decl, int reloc,
4695 unsigned HOST_WIDE_INT align, int shlib)
4697 switch (categorize_decl_for_section (decl, reloc, shlib))
4700 /* We're not supposed to be called on FUNCTION_DECLs. */
4703 readonly_data_section ();
4705 case SECCAT_RODATA_MERGE_STR:
4706 mergeable_string_section (decl, align, 0);
4708 case SECCAT_RODATA_MERGE_STR_INIT:
4709 mergeable_string_section (DECL_INITIAL (decl), align, 0);
4711 case SECCAT_RODATA_MERGE_CONST:
4712 mergeable_constant_section (DECL_MODE (decl), align, 0);
4714 case SECCAT_SRODATA:
4715 named_section (NULL_TREE, ".sdata2", reloc);
4720 case SECCAT_DATA_REL:
4721 named_section (NULL_TREE, ".data.rel", reloc);
4723 case SECCAT_DATA_REL_LOCAL:
4724 named_section (NULL_TREE, ".data.rel.local", reloc);
4726 case SECCAT_DATA_REL_RO:
4727 named_section (NULL_TREE, ".data.rel.ro", reloc);
4729 case SECCAT_DATA_REL_RO_LOCAL:
4730 named_section (NULL_TREE, ".data.rel.ro.local", reloc);
4733 named_section (NULL_TREE, ".sdata", reloc);
4736 named_section (NULL_TREE, ".tdata", reloc);
4739 #ifdef BSS_SECTION_ASM_OP
4742 named_section (NULL_TREE, ".bss", reloc);
4746 named_section (NULL_TREE, ".sbss", reloc);
4749 named_section (NULL_TREE, ".tbss", reloc);
4756 /* Construct a unique section name based on the decl name and the
4757 categorization performed above. */
4760 default_unique_section (tree decl, int reloc)
4762 default_unique_section_1 (decl, reloc, flag_pic);
4766 default_unique_section_1 (tree decl, int reloc, int shlib)
4768 bool one_only = DECL_ONE_ONLY (decl);
4769 const char *prefix, *name;
4773 switch (categorize_decl_for_section (decl, reloc, shlib))
4776 prefix = one_only ? ".gnu.linkonce.t." : ".text.";
4779 case SECCAT_RODATA_MERGE_STR:
4780 case SECCAT_RODATA_MERGE_STR_INIT:
4781 case SECCAT_RODATA_MERGE_CONST:
4782 prefix = one_only ? ".gnu.linkonce.r." : ".rodata.";
4784 case SECCAT_SRODATA:
4785 prefix = one_only ? ".gnu.linkonce.s2." : ".sdata2.";
4788 case SECCAT_DATA_REL:
4789 case SECCAT_DATA_REL_LOCAL:
4790 case SECCAT_DATA_REL_RO:
4791 case SECCAT_DATA_REL_RO_LOCAL:
4792 prefix = one_only ? ".gnu.linkonce.d." : ".data.";
4795 prefix = one_only ? ".gnu.linkonce.s." : ".sdata.";
4798 prefix = one_only ? ".gnu.linkonce.b." : ".bss.";
4801 prefix = one_only ? ".gnu.linkonce.sb." : ".sbss.";
4804 prefix = one_only ? ".gnu.linkonce.td." : ".tdata.";
4807 prefix = one_only ? ".gnu.linkonce.tb." : ".tbss.";
4812 plen = strlen (prefix);
4814 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4815 name = targetm.strip_name_encoding (name);
4816 nlen = strlen (name);
4818 string = alloca (nlen + plen + 1);
4819 memcpy (string, prefix, plen);
4820 memcpy (string + plen, name, nlen + 1);
4822 DECL_SECTION_NAME (decl) = build_string (nlen + plen, string);
4826 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED,
4828 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED)
4831 switch (GET_CODE (x))
4843 readonly_data_section ();
4847 default_elf_select_rtx_section (enum machine_mode mode, rtx x,
4848 unsigned HOST_WIDE_INT align)
4850 /* ??? Handle small data here somehow. */
4853 switch (GET_CODE (x))
4857 named_section (NULL_TREE, ".data.rel.ro", 3);
4861 named_section (NULL_TREE, ".data.rel.ro.local", 1);
4868 mergeable_constant_section (mode, align, 0);
4871 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
4874 default_encode_section_info (tree decl, rtx rtl, int first ATTRIBUTE_UNUSED)
4879 /* Careful not to prod global register variables. */
4880 if (GET_CODE (rtl) != MEM)
4882 symbol = XEXP (rtl, 0);
4883 if (GET_CODE (symbol) != SYMBOL_REF)
4887 if (TREE_CODE (decl) == FUNCTION_DECL)
4888 flags |= SYMBOL_FLAG_FUNCTION;
4889 if (targetm.binds_local_p (decl))
4890 flags |= SYMBOL_FLAG_LOCAL;
4891 if (targetm.in_small_data_p (decl))
4892 flags |= SYMBOL_FLAG_SMALL;
4893 if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4894 flags |= decl_tls_model (decl) << SYMBOL_FLAG_TLS_SHIFT;
4895 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
4896 being PUBLIC, the thing *must* be defined in this translation unit.
4897 Prevent this buglet from being propagated into rtl code as well. */
4898 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
4899 flags |= SYMBOL_FLAG_EXTERNAL;
4901 SYMBOL_REF_FLAGS (symbol) = flags;
4904 /* By default, we do nothing for encode_section_info, so we need not
4905 do anything but discard the '*' marker. */
4908 default_strip_name_encoding (const char *str)
4910 return str + (*str == '*');
4913 /* Assume ELF-ish defaults, since that's pretty much the most liberal
4914 wrt cross-module name binding. */
4917 default_binds_local_p (tree exp)
4919 return default_binds_local_p_1 (exp, flag_shlib);
4923 default_binds_local_p_1 (tree exp, int shlib)
4927 /* A non-decl is an entry in the constant pool. */
4930 /* Static variables are always local. */
4931 else if (! TREE_PUBLIC (exp))
4933 /* A variable is local if the user tells us so. */
4934 else if (DECL_VISIBILITY (exp) != VISIBILITY_DEFAULT)
4936 /* Otherwise, variables defined outside this object may not be local. */
4937 else if (DECL_EXTERNAL (exp))
4939 /* Linkonce and weak data are never local. */
4940 else if (DECL_ONE_ONLY (exp) || DECL_WEAK (exp))
4942 /* If PIC, then assume that any global name can be overridden by
4943 symbols resolved from other modules. */
4946 /* Uninitialized COMMON variable may be unified with symbols
4947 resolved from other modules. */
4948 else if (DECL_COMMON (exp)
4949 && (DECL_INITIAL (exp) == NULL
4950 || DECL_INITIAL (exp) == error_mark_node))
4952 /* Otherwise we're left with initialized (or non-common) global data
4953 which is of necessity defined locally. */
4960 /* Determine whether or not a pointer mode is valid. Assume defaults
4961 of ptr_mode or Pmode - can be overridden. */
4963 default_valid_pointer_mode (enum machine_mode mode)
4965 return (mode == ptr_mode || mode == Pmode);
4968 /* Default function to output code that will globalize a label. A
4969 target must define GLOBAL_ASM_OP or provide it's own function to
4970 globalize a label. */
4971 #ifdef GLOBAL_ASM_OP
4973 default_globalize_label (FILE * stream, const char *name)
4975 fputs (GLOBAL_ASM_OP, stream);
4976 assemble_name (stream, name);
4977 putc ('\n', stream);
4979 #endif /* GLOBAL_ASM_OP */
4981 /* Default function to output a label for unwind information. The
4982 default is to do nothing. A target that needs nonlocal labels for
4983 unwind information must provide its own function to do this. */
4985 default_emit_unwind_label (FILE * stream ATTRIBUTE_UNUSED,
4986 tree decl ATTRIBUTE_UNUSED,
4987 int empty ATTRIBUTE_UNUSED)
4991 /* This is how to output an internal numbered label where PREFIX is
4992 the class of label and LABELNO is the number within the class. */
4995 default_internal_label (FILE *stream, const char *prefix,
4996 unsigned long labelno)
4998 char *const buf = alloca (40 + strlen (prefix));
4999 ASM_GENERATE_INTERNAL_LABEL (buf, prefix, labelno);
5000 ASM_OUTPUT_LABEL (stream, buf);
5003 /* This is the default behavior at the beginning of a file. It's
5004 controlled by two other target-hook toggles. */
5006 default_file_start (void)
5008 if (targetm.file_start_app_off && !flag_verbose_asm)
5009 fputs (ASM_APP_OFF, asm_out_file);
5011 if (targetm.file_start_file_directive)
5012 output_file_directive (asm_out_file, main_input_filename);
5015 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5016 which emits a special section directive used to indicate whether or
5017 not this object file needs an executable stack. This is primarily
5018 a GNU extension to ELF but could be used on other targets. */
5020 file_end_indicate_exec_stack (void)
5022 unsigned int flags = SECTION_DEBUG;
5023 if (trampolines_created)
5024 flags |= SECTION_CODE;
5026 named_section_flags (".note.GNU-stack", flags);
5029 #include "gt-varasm.h"