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"
53 #ifdef XCOFF_DEBUGGING_INFO
54 #include "xcoffout.h" /* Needed for external data
55 declarations for e.g. AIX 4.x. */
58 #ifndef TRAMPOLINE_ALIGNMENT
59 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
63 #define ASM_STABS_OP "\t.stabs\t"
66 /* The (assembler) name of the first globally-visible object output. */
67 const char *first_global_object_name;
68 const char *weak_global_object_name;
71 struct constant_descriptor_rtx;
72 struct rtx_constant_pool;
74 struct varasm_status GTY(())
76 /* If we're using a per-function constant pool, this is it. */
77 struct rtx_constant_pool *pool;
79 /* Number of tree-constants deferred during the expansion of this
81 unsigned int deferred_constants;
84 #define n_deferred_constants (cfun->varasm->deferred_constants)
86 /* Number for making the label on the next
87 constant that is stored in memory. */
89 static GTY(()) int const_labelno;
91 /* Carry information from ASM_DECLARE_OBJECT_NAME
92 to ASM_FINISH_DECLARE_OBJECT. */
94 int size_directive_output;
96 /* The last decl for which assemble_variable was called,
97 if it did ASM_DECLARE_OBJECT_NAME.
98 If the last call to assemble_variable didn't do that,
101 tree last_assemble_variable_decl;
103 /* RTX_UNCHANGING_P in a MEM can mean it is stored into, for initialization.
104 So giving constant the alias set for the type will allow such
105 initializations to appear to conflict with the load of the constant. We
106 avoid this by giving all constants an alias set for just constants.
107 Since there will be no stores to that alias set, nothing will ever
108 conflict with them. */
110 static HOST_WIDE_INT const_alias_set;
112 static const char *strip_reg_name (const char *);
113 static int contains_pointers_p (tree);
114 #ifdef ASM_OUTPUT_EXTERNAL
115 static bool incorporeal_function_p (tree);
117 static void decode_addr_const (tree, struct addr_const *);
118 static hashval_t const_desc_hash (const void *);
119 static int const_desc_eq (const void *, const void *);
120 static hashval_t const_hash_1 (const tree);
121 static int compare_constant (const tree, const tree);
122 static tree copy_constant (tree);
123 static void output_constant_def_contents (rtx);
124 static void output_addressed_constants (tree);
125 static unsigned HOST_WIDE_INT array_size_for_constructor (tree);
126 static unsigned min_align (unsigned, unsigned);
127 static void output_constructor (tree, unsigned HOST_WIDE_INT, unsigned int);
128 static void globalize_decl (tree);
129 static void maybe_assemble_visibility (tree);
130 static int in_named_entry_eq (const void *, const void *);
131 static hashval_t in_named_entry_hash (const void *);
132 #ifdef ASM_OUTPUT_BSS
133 static void asm_output_bss (FILE *, tree, const char *,
134 unsigned HOST_WIDE_INT, unsigned HOST_WIDE_INT);
136 #ifdef BSS_SECTION_ASM_OP
137 #ifdef ASM_OUTPUT_ALIGNED_BSS
138 static void asm_output_aligned_bss (FILE *, tree, const char *,
139 unsigned HOST_WIDE_INT, int)
142 #endif /* BSS_SECTION_ASM_OP */
143 static bool asm_emit_uninitialised (tree, const char*,
144 unsigned HOST_WIDE_INT,
145 unsigned HOST_WIDE_INT);
146 static void mark_weak (tree);
148 enum in_section { no_section, in_text, in_data, in_named
149 #ifdef BSS_SECTION_ASM_OP
152 #ifdef CTORS_SECTION_ASM_OP
155 #ifdef DTORS_SECTION_ASM_OP
158 #ifdef READONLY_DATA_SECTION_ASM_OP
161 #ifdef EXTRA_SECTIONS
165 static GTY(()) enum in_section in_section = no_section;
167 /* Return a nonzero value if DECL has a section attribute. */
168 #ifndef IN_NAMED_SECTION
169 #define IN_NAMED_SECTION(DECL) \
170 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
171 && DECL_SECTION_NAME (DECL) != NULL_TREE)
174 /* Text of section name when in_section == in_named. */
175 static GTY(()) const char *in_named_name;
177 /* Hash table of flags that have been used for a particular named section. */
179 struct in_named_entry GTY(())
186 static GTY((param_is (struct in_named_entry))) htab_t in_named_htab;
188 /* Define functions like text_section for any extra sections. */
189 #ifdef EXTRA_SECTION_FUNCTIONS
190 EXTRA_SECTION_FUNCTIONS
193 /* Tell assembler to switch to text section. */
198 if (in_section != in_text)
200 in_section = in_text;
201 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
205 /* Tell assembler to switch to data section. */
210 if (in_section != in_data)
212 in_section = in_data;
213 if (flag_shared_data)
215 #ifdef SHARED_SECTION_ASM_OP
216 fprintf (asm_out_file, "%s\n", SHARED_SECTION_ASM_OP);
218 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
222 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
226 /* Tell assembler to switch to read-only data section. This is normally
230 readonly_data_section (void)
232 #ifdef READONLY_DATA_SECTION
233 READONLY_DATA_SECTION (); /* Note this can call data_section. */
235 #ifdef READONLY_DATA_SECTION_ASM_OP
236 if (in_section != in_readonly_data)
238 in_section = in_readonly_data;
239 fputs (READONLY_DATA_SECTION_ASM_OP, asm_out_file);
240 fputc ('\n', asm_out_file);
248 /* Determine if we're in the text section. */
251 in_text_section (void)
253 return in_section == in_text;
256 /* Determine if we're in the data section. */
259 in_data_section (void)
261 return in_section == in_data;
264 /* Helper routines for maintaining in_named_htab. */
267 in_named_entry_eq (const void *p1, const void *p2)
269 const struct in_named_entry *old = p1;
270 const char *new = p2;
272 return strcmp (old->name, new) == 0;
276 in_named_entry_hash (const void *p)
278 const struct in_named_entry *old = p;
279 return htab_hash_string (old->name);
282 /* If SECTION has been seen before as a named section, return the flags
283 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
284 set of flags for a section to have, so 0 does not mean that the section
285 has not been seen. */
288 get_named_section_flags (const char *section)
290 struct in_named_entry **slot;
292 slot = (struct in_named_entry **)
293 htab_find_slot_with_hash (in_named_htab, section,
294 htab_hash_string (section), NO_INSERT);
296 return slot ? (*slot)->flags : 0;
299 /* Returns true if the section has been declared before. Sets internal
300 flag on this section in in_named_hash so subsequent calls on this
301 section will return false. */
304 named_section_first_declaration (const char *name)
306 struct in_named_entry **slot;
308 slot = (struct in_named_entry **)
309 htab_find_slot_with_hash (in_named_htab, name,
310 htab_hash_string (name), NO_INSERT);
311 if (! (*slot)->declared)
313 (*slot)->declared = true;
323 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
324 different set of flags, return false. */
327 set_named_section_flags (const char *section, unsigned int flags)
329 struct in_named_entry **slot, *entry;
331 slot = (struct in_named_entry **)
332 htab_find_slot_with_hash (in_named_htab, section,
333 htab_hash_string (section), INSERT);
338 entry = ggc_alloc (sizeof (*entry));
340 entry->name = ggc_strdup (section);
341 entry->flags = flags;
342 entry->declared = false;
344 else if (entry->flags != flags)
350 /* Tell assembler to change to section NAME with attributes FLAGS. */
353 named_section_flags (const char *name, unsigned int flags)
355 if (in_section != in_named || strcmp (name, in_named_name) != 0)
357 if (! set_named_section_flags (name, flags))
360 (*targetm.asm_out.named_section) (name, flags);
362 if (flags & SECTION_FORGET)
363 in_section = no_section;
366 in_named_name = ggc_strdup (name);
367 in_section = in_named;
372 /* Tell assembler to change to section NAME for DECL.
373 If DECL is NULL, just switch to section NAME.
374 If NAME is NULL, get the name from DECL.
375 If RELOC is 1, the initializer for DECL contains relocs. */
378 named_section (tree decl, const char *name, int reloc)
382 if (decl != NULL_TREE && !DECL_P (decl))
385 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
387 flags = (* targetm.section_type_flags) (decl, name, reloc);
389 /* Sanity check user variables for flag changes. Non-user
390 section flag changes will abort in named_section_flags.
391 However, don't complain if SECTION_OVERRIDE is set.
392 We trust that the setter knows that it is safe to ignore
393 the default flags for this decl. */
394 if (decl && ! set_named_section_flags (name, flags))
396 flags = get_named_section_flags (name);
397 if ((flags & SECTION_OVERRIDE) == 0)
398 error ("%J%D causes a section type conflict", decl, decl);
401 named_section_flags (name, flags);
404 /* If required, set DECL_SECTION_NAME to a unique name. */
407 resolve_unique_section (tree decl, int reloc ATTRIBUTE_UNUSED,
408 int flag_function_or_data_sections)
410 if (DECL_SECTION_NAME (decl) == NULL_TREE
411 && targetm.have_named_sections
412 && (flag_function_or_data_sections
413 || DECL_ONE_ONLY (decl)))
414 (*targetm.asm_out.unique_section) (decl, reloc);
417 #ifdef BSS_SECTION_ASM_OP
419 /* Tell the assembler to switch to the bss section. */
424 if (in_section != in_bss)
426 fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP);
431 #ifdef ASM_OUTPUT_BSS
433 /* Utility function for ASM_OUTPUT_BSS for targets to use if
434 they don't support alignments in .bss.
435 ??? It is believed that this function will work in most cases so such
436 support is localized here. */
439 asm_output_bss (FILE *file, tree decl ATTRIBUTE_UNUSED,
441 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
442 unsigned HOST_WIDE_INT rounded)
444 (*targetm.asm_out.globalize_label) (file, name);
446 #ifdef ASM_DECLARE_OBJECT_NAME
447 last_assemble_variable_decl = decl;
448 ASM_DECLARE_OBJECT_NAME (file, name, decl);
450 /* Standard thing is just output label for the object. */
451 ASM_OUTPUT_LABEL (file, name);
452 #endif /* ASM_DECLARE_OBJECT_NAME */
453 ASM_OUTPUT_SKIP (file, rounded ? rounded : 1);
458 #ifdef ASM_OUTPUT_ALIGNED_BSS
460 /* Utility function for targets to use in implementing
461 ASM_OUTPUT_ALIGNED_BSS.
462 ??? It is believed that this function will work in most cases so such
463 support is localized here. */
466 asm_output_aligned_bss (FILE *file, tree decl ATTRIBUTE_UNUSED,
467 const char *name, unsigned HOST_WIDE_INT size,
471 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
472 #ifdef ASM_DECLARE_OBJECT_NAME
473 last_assemble_variable_decl = decl;
474 ASM_DECLARE_OBJECT_NAME (file, name, decl);
476 /* Standard thing is just output label for the object. */
477 ASM_OUTPUT_LABEL (file, name);
478 #endif /* ASM_DECLARE_OBJECT_NAME */
479 ASM_OUTPUT_SKIP (file, size ? size : 1);
484 #endif /* BSS_SECTION_ASM_OP */
486 /* Switch to the section for function DECL.
488 If DECL is NULL_TREE, switch to the text section.
489 ??? It's not clear that we will ever be passed NULL_TREE, but it's
490 safer to handle it. */
493 function_section (tree decl)
495 if (decl != NULL_TREE
496 && DECL_SECTION_NAME (decl) != NULL_TREE)
497 named_section (decl, (char *) 0, 0);
502 /* Switch to section for variable DECL. RELOC is the same as the
503 argument to SELECT_SECTION. */
506 variable_section (tree decl, int reloc)
508 if (IN_NAMED_SECTION (decl))
509 named_section (decl, NULL, reloc);
511 (*targetm.asm_out.select_section) (decl, reloc, DECL_ALIGN (decl));
514 /* Tell assembler to switch to the section for string merging. */
517 mergeable_string_section (tree decl ATTRIBUTE_UNUSED,
518 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED,
519 unsigned int flags ATTRIBUTE_UNUSED)
521 if (HAVE_GAS_SHF_MERGE && flag_merge_constants
522 && TREE_CODE (decl) == STRING_CST
523 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
525 && TREE_STRING_LENGTH (decl) >= int_size_in_bytes (TREE_TYPE (decl)))
527 enum machine_mode mode;
528 unsigned int modesize;
533 mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (decl)));
534 modesize = GET_MODE_BITSIZE (mode);
535 if (modesize >= 8 && modesize <= 256
536 && (modesize & (modesize - 1)) == 0)
538 if (align < modesize)
541 str = TREE_STRING_POINTER (decl);
542 len = TREE_STRING_LENGTH (decl);
543 unit = GET_MODE_SIZE (mode);
545 /* Check for embedded NUL characters. */
546 for (i = 0; i < len; i += unit)
548 for (j = 0; j < unit; j++)
549 if (str[i + j] != '\0')
556 sprintf (name, ".rodata.str%d.%d", modesize / 8,
558 flags |= (modesize / 8) | SECTION_MERGE | SECTION_STRINGS;
559 if (!i && modesize < align)
561 /* A "" string with requested alignment greater than
562 character size might cause a problem:
563 if some other string required even bigger
564 alignment than "", then linker might think the
565 "" is just part of padding after some other string
566 and not put it into the hash table initially.
567 But this means "" could have smaller alignment
569 #ifdef ASM_OUTPUT_SECTION_START
570 named_section_flags (name, flags);
571 ASM_OUTPUT_SECTION_START (asm_out_file);
573 readonly_data_section ();
578 named_section_flags (name, flags);
584 readonly_data_section ();
587 /* Tell assembler to switch to the section for constant merging. */
590 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED,
591 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED,
592 unsigned int flags ATTRIBUTE_UNUSED)
594 unsigned int modesize = GET_MODE_BITSIZE (mode);
596 if (HAVE_GAS_SHF_MERGE && flag_merge_constants
602 && (align & (align - 1)) == 0)
606 sprintf (name, ".rodata.cst%d", (int) (align / 8));
607 flags |= (align / 8) | SECTION_MERGE;
608 named_section_flags (name, flags);
612 readonly_data_section ();
615 /* Given NAME, a putative register name, discard any customary prefixes. */
618 strip_reg_name (const char *name)
620 #ifdef REGISTER_PREFIX
621 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
622 name += strlen (REGISTER_PREFIX);
624 if (name[0] == '%' || name[0] == '#')
629 /* Decode an `asm' spec for a declaration as a register name.
630 Return the register number, or -1 if nothing specified,
631 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
632 or -3 if ASMSPEC is `cc' and is not recognized,
633 or -4 if ASMSPEC is `memory' and is not recognized.
634 Accept an exact spelling or a decimal number.
635 Prefixes such as % are optional. */
638 decode_reg_name (const char *asmspec)
644 /* Get rid of confusing prefixes. */
645 asmspec = strip_reg_name (asmspec);
647 /* Allow a decimal number as a "register name". */
648 for (i = strlen (asmspec) - 1; i >= 0; i--)
649 if (! ISDIGIT (asmspec[i]))
651 if (asmspec[0] != 0 && i < 0)
654 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
660 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
662 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
665 #ifdef ADDITIONAL_REGISTER_NAMES
667 static const struct { const char *const name; const int number; } table[]
668 = ADDITIONAL_REGISTER_NAMES;
670 for (i = 0; i < (int) ARRAY_SIZE (table); i++)
671 if (! strcmp (asmspec, table[i].name))
672 return table[i].number;
674 #endif /* ADDITIONAL_REGISTER_NAMES */
676 if (!strcmp (asmspec, "memory"))
679 if (!strcmp (asmspec, "cc"))
688 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
689 have static storage duration. In other words, it should not be an
690 automatic variable, including PARM_DECLs.
692 There is, however, one exception: this function handles variables
693 explicitly placed in a particular register by the user.
695 ASMSPEC, if not 0, is the string which the user specified as the
696 assembler symbol name.
698 This is never called for PARM_DECL nodes. */
701 make_decl_rtl (tree decl, const char *asmspec)
703 const char *name = 0;
707 /* Check that we are not being given an automatic variable. */
708 /* A weak alias has TREE_PUBLIC set but not the other bits. */
709 if (TREE_CODE (decl) == PARM_DECL
710 || TREE_CODE (decl) == RESULT_DECL
711 || (TREE_CODE (decl) == VAR_DECL
712 && !TREE_STATIC (decl)
713 && !TREE_PUBLIC (decl)
714 && !DECL_EXTERNAL (decl)
715 && !DECL_REGISTER (decl)))
717 /* And that we were not given a type or a label. */
718 else if (TREE_CODE (decl) == TYPE_DECL
719 || TREE_CODE (decl) == LABEL_DECL)
722 /* For a duplicate declaration, we can be called twice on the
723 same DECL node. Don't discard the RTL already made. */
724 if (DECL_RTL_SET_P (decl))
726 /* If the old RTL had the wrong mode, fix the mode. */
727 if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
728 SET_DECL_RTL (decl, adjust_address_nv (DECL_RTL (decl),
729 DECL_MODE (decl), 0));
731 /* ??? Another way to do this would be to maintain a hashed
732 table of such critters. Instead of adding stuff to a DECL
733 to give certain attributes to it, we could use an external
734 hash map from DECL to set of attributes. */
736 /* Let the target reassign the RTL if it wants.
737 This is necessary, for example, when one machine specific
738 decl attribute overrides another. */
739 (* targetm.encode_section_info) (decl, DECL_RTL (decl), false);
743 reg_number = decode_reg_name (asmspec);
744 if (reg_number == -2)
746 /* ASMSPEC is given, and not the name of a register. Mark the
747 name with a star so assemble_name won't munge it. */
748 char *starred = alloca (strlen (asmspec) + 2);
750 strcpy (starred + 1, asmspec);
751 change_decl_assembler_name (decl, get_identifier (starred));
754 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
756 if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
758 /* First detect errors in declaring global registers. */
759 if (reg_number == -1)
760 error ("%Jregister name not specified for '%D'", decl, decl);
761 else if (reg_number < 0)
762 error ("%Jinvalid register name for '%D'", decl, decl);
763 else if (TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
764 error ("%Jdata type of '%D' isn't suitable for a register",
766 else if (! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl))))
767 error ("%Jregister specified for '%D' isn't suitable for data type",
769 /* Now handle properly declared static register variables. */
774 if (DECL_INITIAL (decl) != 0 && TREE_STATIC (decl))
776 DECL_INITIAL (decl) = 0;
777 error ("global register variable has initial value");
779 if (TREE_THIS_VOLATILE (decl))
780 warning ("volatile register variables don't work as you might wish");
782 /* If the user specified one of the eliminables registers here,
783 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
784 confused with that register and be eliminated. This usage is
785 somewhat suspect... */
787 SET_DECL_RTL (decl, gen_rtx_raw_REG (DECL_MODE (decl), reg_number));
788 ORIGINAL_REGNO (DECL_RTL (decl)) = reg_number;
789 REG_USERVAR_P (DECL_RTL (decl)) = 1;
791 if (TREE_STATIC (decl))
793 /* Make this register global, so not usable for anything
795 #ifdef ASM_DECLARE_REGISTER_GLOBAL
796 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name);
798 nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl));
800 globalize_reg (reg_number + --nregs);
803 /* As a register variable, it has no section. */
808 /* Now handle ordinary static variables and functions (in memory).
809 Also handle vars declared register invalidly. */
811 if (reg_number >= 0 || reg_number == -3)
812 error ("%Jregister name given for non-register variable '%D'", decl, decl);
814 /* Specifying a section attribute on a variable forces it into a
815 non-.bss section, and thus it cannot be common. */
816 if (TREE_CODE (decl) == VAR_DECL
817 && DECL_SECTION_NAME (decl) != NULL_TREE
818 && DECL_INITIAL (decl) == NULL_TREE
819 && DECL_COMMON (decl))
820 DECL_COMMON (decl) = 0;
822 /* Variables can't be both common and weak. */
823 if (TREE_CODE (decl) == VAR_DECL && DECL_WEAK (decl))
824 DECL_COMMON (decl) = 0;
826 x = gen_rtx_SYMBOL_REF (Pmode, name);
827 SYMBOL_REF_WEAK (x) = DECL_WEAK (decl);
828 SYMBOL_REF_DECL (x) = decl;
830 x = gen_rtx_MEM (DECL_MODE (decl), x);
831 if (TREE_CODE (decl) != FUNCTION_DECL)
832 set_mem_attributes (x, decl, 1);
833 SET_DECL_RTL (decl, x);
835 /* Optionally set flags or add text to the name to record information
836 such as that it is a function name.
837 If the name is changed, the macro ASM_OUTPUT_LABELREF
838 will have to know how to strip this information. */
839 (* targetm.encode_section_info) (decl, DECL_RTL (decl), true);
842 /* Make the rtl for variable VAR be volatile.
843 Use this only for static variables. */
846 make_var_volatile (tree var)
848 if (GET_CODE (DECL_RTL (var)) != MEM)
851 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
854 /* Output a string of literal assembler code
855 for an `asm' keyword used between functions. */
858 assemble_asm (tree string)
862 if (TREE_CODE (string) == ADDR_EXPR)
863 string = TREE_OPERAND (string, 0);
865 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
868 /* Record an element in the table of global destructors. SYMBOL is
869 a SYMBOL_REF of the function to be called; PRIORITY is a number
870 between 0 and MAX_INIT_PRIORITY. */
873 default_stabs_asm_out_destructor (rtx symbol, int priority ATTRIBUTE_UNUSED)
875 /* Tell GNU LD that this is part of the static destructor set.
876 This will work for any system that uses stabs, most usefully
878 fprintf (asm_out_file, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
879 assemble_name (asm_out_file, XSTR (symbol, 0));
880 fputc ('\n', asm_out_file);
884 default_named_section_asm_out_destructor (rtx symbol, int priority)
886 const char *section = ".dtors";
889 /* ??? This only works reliably with the GNU linker. */
890 if (priority != DEFAULT_INIT_PRIORITY)
892 sprintf (buf, ".dtors.%.5u",
893 /* Invert the numbering so the linker puts us in the proper
894 order; constructors are run from right to left, and the
895 linker sorts in increasing order. */
896 MAX_INIT_PRIORITY - priority);
900 named_section_flags (section, SECTION_WRITE);
901 assemble_align (POINTER_SIZE);
902 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
905 #ifdef DTORS_SECTION_ASM_OP
909 if (in_section != in_dtors)
911 in_section = in_dtors;
912 fputs (DTORS_SECTION_ASM_OP, asm_out_file);
913 fputc ('\n', asm_out_file);
918 default_dtor_section_asm_out_destructor (rtx symbol,
919 int priority ATTRIBUTE_UNUSED)
922 assemble_align (POINTER_SIZE);
923 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
927 /* Likewise for global constructors. */
930 default_stabs_asm_out_constructor (rtx symbol, int priority ATTRIBUTE_UNUSED)
932 /* Tell GNU LD that this is part of the static destructor set.
933 This will work for any system that uses stabs, most usefully
935 fprintf (asm_out_file, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
936 assemble_name (asm_out_file, XSTR (symbol, 0));
937 fputc ('\n', asm_out_file);
941 default_named_section_asm_out_constructor (rtx symbol, int priority)
943 const char *section = ".ctors";
946 /* ??? This only works reliably with the GNU linker. */
947 if (priority != DEFAULT_INIT_PRIORITY)
949 sprintf (buf, ".ctors.%.5u",
950 /* Invert the numbering so the linker puts us in the proper
951 order; constructors are run from right to left, and the
952 linker sorts in increasing order. */
953 MAX_INIT_PRIORITY - priority);
957 named_section_flags (section, SECTION_WRITE);
958 assemble_align (POINTER_SIZE);
959 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
962 #ifdef CTORS_SECTION_ASM_OP
966 if (in_section != in_ctors)
968 in_section = in_ctors;
969 fputs (CTORS_SECTION_ASM_OP, asm_out_file);
970 fputc ('\n', asm_out_file);
975 default_ctor_section_asm_out_constructor (rtx symbol,
976 int priority ATTRIBUTE_UNUSED)
979 assemble_align (POINTER_SIZE);
980 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
984 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
985 a nonzero value if the constant pool should be output before the
986 start of the function, or a zero value if the pool should output
987 after the end of the function. The default is to put it before the
990 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
991 #define CONSTANT_POOL_BEFORE_FUNCTION 1
994 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
995 to be output to assembler.
996 Set first_global_object_name and weak_global_object_name as appropriate. */
999 notice_global_symbol (tree decl)
1001 const char **type = &first_global_object_name;
1003 if (first_global_object_name
1004 || !TREE_PUBLIC (decl) || DECL_EXTERNAL (decl)
1005 || !DECL_NAME (decl)
1006 || (TREE_CODE (decl) != FUNCTION_DECL
1007 && (TREE_CODE (decl) != VAR_DECL
1008 || (DECL_COMMON (decl)
1009 && (DECL_INITIAL (decl) == 0
1010 || DECL_INITIAL (decl) == error_mark_node))))
1011 || GET_CODE (DECL_RTL (decl)) != MEM)
1014 /* We win when global object is found, but it is usefull to know about weak
1015 symbol as well so we can produce nicer unique names. */
1016 if (DECL_WEAK (decl) || DECL_ONE_ONLY (decl))
1017 type = &weak_global_object_name;
1023 rtx decl_rtl = DECL_RTL (decl);
1025 p = (* targetm.strip_name_encoding) (XSTR (XEXP (decl_rtl, 0), 0));
1032 /* Output assembler code for the constant pool of a function and associated
1033 with defining the name of the function. DECL describes the function.
1034 NAME is the function's name. For the constant pool, we use the current
1035 constant pool data. */
1038 assemble_start_function (tree decl, const char *fnname)
1042 /* The following code does not need preprocessing in the assembler. */
1046 if (CONSTANT_POOL_BEFORE_FUNCTION)
1047 output_constant_pool (fnname, decl);
1049 resolve_unique_section (decl, 0, flag_function_sections);
1050 function_section (decl);
1052 /* Tell assembler to move to target machine's alignment for functions. */
1053 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1054 if (align < force_align_functions_log)
1055 align = force_align_functions_log;
1058 ASM_OUTPUT_ALIGN (asm_out_file, align);
1061 /* Handle a user-specified function alignment.
1062 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1063 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1064 if (align_functions_log > align
1065 && cfun->function_frequency != FUNCTION_FREQUENCY_UNLIKELY_EXECUTED)
1067 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1068 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file,
1069 align_functions_log, align_functions - 1);
1071 ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
1075 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1076 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
1079 (*debug_hooks->begin_function) (decl);
1081 /* Make function name accessible from other files, if appropriate. */
1083 if (TREE_PUBLIC (decl))
1085 notice_global_symbol (decl);
1087 globalize_decl (decl);
1089 maybe_assemble_visibility (decl);
1092 /* Do any machine/system dependent processing of the function name. */
1093 #ifdef ASM_DECLARE_FUNCTION_NAME
1094 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
1096 /* Standard thing is just output label for the function. */
1097 ASM_OUTPUT_LABEL (asm_out_file, fnname);
1098 #endif /* ASM_DECLARE_FUNCTION_NAME */
1101 /* Output assembler code associated with defining the size of the
1102 function. DECL describes the function. NAME is the function's name. */
1105 assemble_end_function (tree decl, const char *fnname)
1107 #ifdef ASM_DECLARE_FUNCTION_SIZE
1108 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1110 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1112 output_constant_pool (fnname, decl);
1113 function_section (decl); /* need to switch back */
1117 /* Assemble code to leave SIZE bytes of zeros. */
1120 assemble_zeros (unsigned HOST_WIDE_INT size)
1122 /* Do no output if -fsyntax-only. */
1123 if (flag_syntax_only)
1126 #ifdef ASM_NO_SKIP_IN_TEXT
1127 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1128 so we must output 0s explicitly in the text section. */
1129 if (ASM_NO_SKIP_IN_TEXT && in_text_section ())
1131 unsigned HOST_WIDE_INT i;
1132 for (i = 0; i < size; i++)
1133 assemble_integer (const0_rtx, 1, BITS_PER_UNIT, 1);
1138 ASM_OUTPUT_SKIP (asm_out_file, size);
1141 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1144 assemble_align (int align)
1146 if (align > BITS_PER_UNIT)
1148 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1152 /* Assemble a string constant with the specified C string as contents. */
1155 assemble_string (const char *p, int size)
1160 /* If the string is very long, split it up. */
1164 int thissize = size - pos;
1165 if (thissize > maximum)
1168 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1176 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1177 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1178 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1180 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1181 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1182 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1184 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1185 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1189 #if defined ASM_OUTPUT_ALIGNED_BSS
1190 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1191 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1193 #if defined ASM_OUTPUT_BSS
1194 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1195 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1201 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1202 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1203 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1205 #if defined ASM_OUTPUT_ALIGNED_COMMON
1206 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1207 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1209 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1210 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1215 asm_emit_uninitialised (tree decl, const char *name,
1216 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
1217 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED)
1225 destination = asm_dest_local;
1227 /* ??? We should handle .bss via select_section mechanisms rather than
1228 via special target hooks. That would eliminate this special case. */
1229 if (TREE_PUBLIC (decl))
1231 if (!DECL_COMMON (decl))
1233 destination = asm_dest_bss;
1238 destination = asm_dest_common;
1241 if (destination == asm_dest_bss)
1242 globalize_decl (decl);
1243 resolve_unique_section (decl, 0, flag_data_sections);
1245 if (flag_shared_data)
1247 switch (destination)
1249 #ifdef ASM_OUTPUT_SHARED_BSS
1251 ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded);
1254 #ifdef ASM_OUTPUT_SHARED_COMMON
1255 case asm_dest_common:
1256 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1259 #ifdef ASM_OUTPUT_SHARED_LOCAL
1260 case asm_dest_local:
1261 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1269 switch (destination)
1273 ASM_EMIT_BSS (decl, name, size, rounded);
1276 case asm_dest_common:
1277 ASM_EMIT_COMMON (decl, name, size, rounded);
1279 case asm_dest_local:
1280 ASM_EMIT_LOCAL (decl, name, size, rounded);
1289 /* Assemble everything that is needed for a variable or function declaration.
1290 Not used for automatic variables, and not used for function definitions.
1291 Should not be called for variables of incomplete structure type.
1293 TOP_LEVEL is nonzero if this variable has file scope.
1294 AT_END is nonzero if this is the special handling, at end of compilation,
1295 to define things that have had only tentative definitions.
1296 DONT_OUTPUT_DATA if nonzero means don't actually output the
1297 initial value (that will be done by the caller). */
1300 assemble_variable (tree decl, int top_level ATTRIBUTE_UNUSED,
1301 int at_end ATTRIBUTE_UNUSED, int dont_output_data)
1308 if (lang_hooks.decls.prepare_assemble_variable)
1309 (*lang_hooks.decls.prepare_assemble_variable) (decl);
1311 last_assemble_variable_decl = 0;
1313 /* Normally no need to say anything here for external references,
1314 since assemble_external is called by the language-specific code
1315 when a declaration is first seen. */
1317 if (DECL_EXTERNAL (decl))
1320 /* Output no assembler code for a function declaration.
1321 Only definitions of functions output anything. */
1323 if (TREE_CODE (decl) == FUNCTION_DECL)
1326 /* Do nothing for global register variables. */
1327 if (DECL_RTL_SET_P (decl) && GET_CODE (DECL_RTL (decl)) == REG)
1329 TREE_ASM_WRITTEN (decl) = 1;
1333 /* If type was incomplete when the variable was declared,
1334 see if it is complete now. */
1336 if (DECL_SIZE (decl) == 0)
1337 layout_decl (decl, 0);
1339 /* Still incomplete => don't allocate it; treat the tentative defn
1340 (which is what it must have been) as an `extern' reference. */
1342 if (!dont_output_data && DECL_SIZE (decl) == 0)
1344 error ("%Jstorage size of `%D' isn't known", decl, decl);
1345 TREE_ASM_WRITTEN (decl) = 1;
1349 /* The first declaration of a variable that comes through this function
1350 decides whether it is global (in C, has external linkage)
1351 or local (in C, has internal linkage). So do nothing more
1352 if this function has already run. */
1354 if (TREE_ASM_WRITTEN (decl))
1357 /* Make sure targetm.encode_section_info is invoked before we set
1359 decl_rtl = DECL_RTL (decl);
1361 TREE_ASM_WRITTEN (decl) = 1;
1363 /* Do no output if -fsyntax-only. */
1364 if (flag_syntax_only)
1369 if (! dont_output_data
1370 && ! host_integerp (DECL_SIZE_UNIT (decl), 1))
1372 error ("%Jsize of variable '%D' is too large", decl, decl);
1376 name = XSTR (XEXP (decl_rtl, 0), 0);
1377 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1378 notice_global_symbol (decl);
1380 /* Compute the alignment of this data. */
1382 align = DECL_ALIGN (decl);
1384 /* In the case for initialing an array whose length isn't specified,
1385 where we have not yet been able to do the layout,
1386 figure out the proper alignment now. */
1387 if (dont_output_data && DECL_SIZE (decl) == 0
1388 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1389 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1391 /* Some object file formats have a maximum alignment which they support.
1392 In particular, a.out format supports a maximum alignment of 4. */
1393 #ifndef MAX_OFILE_ALIGNMENT
1394 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1396 if (align > MAX_OFILE_ALIGNMENT)
1398 warning ("%Jalignment of '%D' is greater than maximum object "
1399 "file alignment. Using %d", decl, decl,
1400 MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
1401 align = MAX_OFILE_ALIGNMENT;
1404 /* On some machines, it is good to increase alignment sometimes. */
1405 if (! DECL_USER_ALIGN (decl))
1407 #ifdef DATA_ALIGNMENT
1408 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1410 #ifdef CONSTANT_ALIGNMENT
1411 if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node)
1412 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1416 /* Reset the alignment in case we have made it tighter, so we can benefit
1417 from it in get_pointer_alignment. */
1418 DECL_ALIGN (decl) = align;
1419 set_mem_align (decl_rtl, align);
1421 if (TREE_PUBLIC (decl))
1422 maybe_assemble_visibility (decl);
1424 /* Output any data that we will need to use the address of. */
1425 if (DECL_INITIAL (decl) == error_mark_node)
1426 reloc = contains_pointers_p (TREE_TYPE (decl)) ? 3 : 0;
1427 else if (DECL_INITIAL (decl))
1429 reloc = compute_reloc_for_constant (DECL_INITIAL (decl));
1430 output_addressed_constants (DECL_INITIAL (decl));
1432 resolve_unique_section (decl, reloc, flag_data_sections);
1434 /* Handle uninitialized definitions. */
1436 /* If the decl has been given an explicit section name, then it
1437 isn't common, and shouldn't be handled as such. */
1438 if (DECL_SECTION_NAME (decl) || dont_output_data)
1440 /* We don't implement common thread-local data at present. */
1441 else if (DECL_THREAD_LOCAL (decl))
1443 if (DECL_COMMON (decl))
1444 sorry ("thread-local COMMON data not implemented");
1446 else if (DECL_INITIAL (decl) == 0
1447 || DECL_INITIAL (decl) == error_mark_node
1448 || (flag_zero_initialized_in_bss
1449 /* Leave constant zeroes in .rodata so they can be shared. */
1450 && !TREE_READONLY (decl)
1451 && initializer_zerop (DECL_INITIAL (decl))))
1453 unsigned HOST_WIDE_INT size = tree_low_cst (DECL_SIZE_UNIT (decl), 1);
1454 unsigned HOST_WIDE_INT rounded = size;
1456 /* Don't allocate zero bytes of common,
1457 since that means "undefined external" in the linker. */
1461 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1462 so that each uninitialized object starts on such a boundary. */
1463 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1464 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1465 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1467 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1468 if ((unsigned HOST_WIDE_INT) DECL_ALIGN (decl) / BITS_PER_UNIT > rounded)
1469 warning ("%Jrequested alignment for '%D' is greater than "
1470 "implemented alignment of %d", decl, decl, rounded);
1473 /* If the target cannot output uninitialized but not common global data
1474 in .bss, then we have to use .data, so fall through. */
1475 if (asm_emit_uninitialised (decl, name, size, rounded))
1479 /* Handle initialized definitions.
1480 Also handle uninitialized global definitions if -fno-common and the
1481 target doesn't support ASM_OUTPUT_BSS. */
1483 /* First make the assembler name(s) global if appropriate. */
1484 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1485 globalize_decl (decl);
1487 /* Switch to the appropriate section. */
1488 variable_section (decl, reloc);
1490 /* dbxout.c needs to know this. */
1491 if (in_text_section ())
1492 DECL_IN_TEXT_SECTION (decl) = 1;
1494 /* Output the alignment of this data. */
1495 if (align > BITS_PER_UNIT)
1497 ASM_OUTPUT_ALIGN (asm_out_file,
1498 floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT));
1501 /* Do any machine/system dependent processing of the object. */
1502 #ifdef ASM_DECLARE_OBJECT_NAME
1503 last_assemble_variable_decl = decl;
1504 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1506 /* Standard thing is just output label for the object. */
1507 ASM_OUTPUT_LABEL (asm_out_file, name);
1508 #endif /* ASM_DECLARE_OBJECT_NAME */
1510 if (!dont_output_data)
1512 if (DECL_INITIAL (decl) && DECL_INITIAL (decl) != error_mark_node)
1513 /* Output the actual data. */
1514 output_constant (DECL_INITIAL (decl),
1515 tree_low_cst (DECL_SIZE_UNIT (decl), 1),
1518 /* Leave space for it. */
1519 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl), 1));
1523 /* Return 1 if type TYPE contains any pointers. */
1526 contains_pointers_p (tree type)
1528 switch (TREE_CODE (type))
1531 case REFERENCE_TYPE:
1532 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1533 so I'll play safe and return 1. */
1539 case QUAL_UNION_TYPE:
1542 /* For a type that has fields, see if the fields have pointers. */
1543 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1544 if (TREE_CODE (fields) == FIELD_DECL
1545 && contains_pointers_p (TREE_TYPE (fields)))
1551 /* An array type contains pointers if its element type does. */
1552 return contains_pointers_p (TREE_TYPE (type));
1559 #ifdef ASM_OUTPUT_EXTERNAL
1560 /* True if DECL is a function decl for which no out-of-line copy exists.
1561 It is assumed that DECL's assembler name has been set. */
1564 incorporeal_function_p (tree decl)
1566 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_BUILT_IN (decl))
1570 if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
1571 && DECL_FUNCTION_CODE (decl) == BUILT_IN_ALLOCA)
1574 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
1575 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
1582 /* Output something to declare an external symbol to the assembler.
1583 (Most assemblers don't need this, so we normally output nothing.)
1584 Do nothing if DECL is not external. */
1587 assemble_external (tree decl ATTRIBUTE_UNUSED)
1589 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1590 main body of this code is only rarely exercised. To provide some
1591 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1592 open. If it's not, we should not be calling this function. */
1596 #ifdef ASM_OUTPUT_EXTERNAL
1597 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1599 rtx rtl = DECL_RTL (decl);
1601 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1602 && !SYMBOL_REF_USED (XEXP (rtl, 0))
1603 && !incorporeal_function_p (decl))
1605 /* Some systems do require some output. */
1606 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1607 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1613 /* Similar, for calling a library function FUN. */
1616 assemble_external_libcall (rtx fun)
1618 /* Declare library function name external when first used, if nec. */
1619 if (! SYMBOL_REF_USED (fun))
1621 SYMBOL_REF_USED (fun) = 1;
1622 (*targetm.asm_out.external_libcall) (fun);
1626 /* Assemble a label named NAME. */
1629 assemble_label (const char *name)
1631 ASM_OUTPUT_LABEL (asm_out_file, name);
1634 /* Set the symbol_referenced flag for ID and notify callgraph code. */
1636 mark_referenced (tree id)
1638 if (!TREE_SYMBOL_REFERENCED (id))
1640 struct cgraph_node *node;
1641 struct cgraph_varpool_node *vnode;
1643 if (!cgraph_global_info_ready)
1645 node = cgraph_node_for_identifier (id);
1647 cgraph_mark_needed_node (node);
1650 vnode = cgraph_varpool_node_for_identifier (id);
1652 cgraph_varpool_mark_needed_node (vnode);
1654 TREE_SYMBOL_REFERENCED (id) = 1;
1657 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1658 If NAME starts with a *, the rest of NAME is output verbatim.
1659 Otherwise NAME is transformed in an implementation-defined way
1660 (usually by the addition of an underscore).
1661 Many macros in the tm file are defined to call this function. */
1664 assemble_name (FILE *file, const char *name)
1666 const char *real_name;
1669 real_name = (* targetm.strip_name_encoding) (name);
1671 id = maybe_get_identifier (real_name);
1673 mark_referenced (id);
1676 fputs (&name[1], file);
1678 ASM_OUTPUT_LABELREF (file, name);
1681 /* Allocate SIZE bytes writable static space with a gensym name
1682 and return an RTX to refer to its address. */
1685 assemble_static_space (unsigned HOST_WIDE_INT size)
1688 const char *namestring;
1692 if (flag_shared_data)
1696 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1698 namestring = ggc_strdup (name);
1700 x = gen_rtx_SYMBOL_REF (Pmode, namestring);
1701 SYMBOL_REF_FLAGS (x) = SYMBOL_FLAG_LOCAL;
1703 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1704 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
1707 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1708 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1711 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1712 so that each uninitialized object starts on such a boundary. */
1713 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1714 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1715 = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1716 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1717 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1718 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1725 /* Assemble the static constant template for function entry trampolines.
1726 This is done at most once per compilation.
1727 Returns an RTX for the address of the template. */
1729 #ifdef TRAMPOLINE_TEMPLATE
1731 assemble_trampoline_template (void)
1738 /* By default, put trampoline templates in read-only data section. */
1740 #ifdef TRAMPOLINE_SECTION
1741 TRAMPOLINE_SECTION ();
1743 readonly_data_section ();
1746 /* Write the assembler code to define one. */
1747 align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
1750 ASM_OUTPUT_ALIGN (asm_out_file, align);
1753 (*targetm.asm_out.internal_label) (asm_out_file, "LTRAMP", 0);
1754 TRAMPOLINE_TEMPLATE (asm_out_file);
1756 /* Record the rtl to refer to it. */
1757 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1758 name = ggc_strdup (label);
1759 symbol = gen_rtx_SYMBOL_REF (Pmode, name);
1760 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
1766 /* A and B are either alignments or offsets. Return the minimum alignment
1767 that may be assumed after adding the two together. */
1769 static inline unsigned
1770 min_align (unsigned int a, unsigned int b)
1772 return (a | b) & -(a | b);
1775 /* Return the assembler directive for creating a given kind of integer
1776 object. SIZE is the number of bytes in the object and ALIGNED_P
1777 indicates whether it is known to be aligned. Return NULL if the
1778 assembly dialect has no such directive.
1780 The returned string should be printed at the start of a new line and
1781 be followed immediately by the object's initial value. */
1784 integer_asm_op (int size, int aligned_p)
1786 struct asm_int_op *ops;
1789 ops = &targetm.asm_out.aligned_op;
1791 ops = &targetm.asm_out.unaligned_op;
1796 return targetm.asm_out.byte_op;
1810 /* Use directive OP to assemble an integer object X. Print OP at the
1811 start of the line, followed immediately by the value of X. */
1814 assemble_integer_with_op (const char *op, rtx x)
1816 fputs (op, asm_out_file);
1817 output_addr_const (asm_out_file, x);
1818 fputc ('\n', asm_out_file);
1821 /* The default implementation of the asm_out.integer target hook. */
1824 default_assemble_integer (rtx x ATTRIBUTE_UNUSED,
1825 unsigned int size ATTRIBUTE_UNUSED,
1826 int aligned_p ATTRIBUTE_UNUSED)
1828 const char *op = integer_asm_op (size, aligned_p);
1829 return op && (assemble_integer_with_op (op, x), true);
1832 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1833 the alignment of the integer in bits. Return 1 if we were able to output
1834 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1838 assemble_integer (rtx x, unsigned int size, unsigned int align, int force)
1842 aligned_p = (align >= MIN (size * BITS_PER_UNIT, BIGGEST_ALIGNMENT));
1844 /* See if the target hook can handle this kind of object. */
1845 if ((*targetm.asm_out.integer) (x, size, aligned_p))
1848 /* If the object is a multi-byte one, try splitting it up. Split
1849 it into words it if is multi-word, otherwise split it into bytes. */
1852 enum machine_mode omode, imode;
1853 unsigned int subalign;
1854 unsigned int subsize, i;
1856 subsize = size > UNITS_PER_WORD? UNITS_PER_WORD : 1;
1857 subalign = MIN (align, subsize * BITS_PER_UNIT);
1858 omode = mode_for_size (subsize * BITS_PER_UNIT, MODE_INT, 0);
1859 imode = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1861 for (i = 0; i < size; i += subsize)
1863 rtx partial = simplify_subreg (omode, x, imode, i);
1864 if (!partial || !assemble_integer (partial, subsize, subalign, 0))
1870 /* If we've printed some of it, but not all of it, there's no going
1883 assemble_real (REAL_VALUE_TYPE d, enum machine_mode mode, unsigned int align)
1887 int bitsize, nelts, nunits, units_per;
1889 /* This is hairy. We have a quantity of known size. real_to_target
1890 will put it into an array of *host* longs, 32 bits per element
1891 (even if long is more than 32 bits). We need to determine the
1892 number of array elements that are occupied (nelts) and the number
1893 of *target* min-addressable units that will be occupied in the
1894 object file (nunits). We cannot assume that 32 divides the
1895 mode's bitsize (size * BITS_PER_UNIT) evenly.
1897 size * BITS_PER_UNIT is used here to make sure that padding bits
1898 (which might appear at either end of the value; real_to_target
1899 will include the padding bits in its output array) are included. */
1901 nunits = GET_MODE_SIZE (mode);
1902 bitsize = nunits * BITS_PER_UNIT;
1903 nelts = CEIL (bitsize, 32);
1904 units_per = 32 / BITS_PER_UNIT;
1906 real_to_target (data, &d, mode);
1908 /* Put out the first word with the specified alignment. */
1909 assemble_integer (GEN_INT (data[0]), MIN (nunits, units_per), align, 1);
1910 nunits -= units_per;
1912 /* Subsequent words need only 32-bit alignment. */
1913 align = min_align (align, 32);
1915 for (i = 1; i < nelts; i++)
1917 assemble_integer (GEN_INT (data[i]), MIN (nunits, units_per), align, 1);
1918 nunits -= units_per;
1922 /* Given an expression EXP with a constant value,
1923 reduce it to the sum of an assembler symbol and an integer.
1924 Store them both in the structure *VALUE.
1925 Abort if EXP does not reduce. */
1927 struct addr_const GTY(())
1930 HOST_WIDE_INT offset;
1934 decode_addr_const (tree exp, struct addr_const *value)
1936 tree target = TREE_OPERAND (exp, 0);
1942 if (TREE_CODE (target) == COMPONENT_REF
1943 && host_integerp (byte_position (TREE_OPERAND (target, 1)), 0))
1946 offset += int_byte_position (TREE_OPERAND (target, 1));
1947 target = TREE_OPERAND (target, 0);
1949 else if (TREE_CODE (target) == ARRAY_REF
1950 || TREE_CODE (target) == ARRAY_RANGE_REF)
1952 offset += (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target)), 1)
1953 * tree_low_cst (TREE_OPERAND (target, 1), 0));
1954 target = TREE_OPERAND (target, 0);
1960 switch (TREE_CODE (target))
1964 x = DECL_RTL (target);
1968 x = gen_rtx_MEM (FUNCTION_MODE,
1969 gen_rtx_LABEL_REF (VOIDmode, force_label_rtx (target)));
1977 x = output_constant_def (target, 1);
1984 if (GET_CODE (x) != MEM)
1989 value->offset = offset;
1992 /* Uniquize all constants that appear in memory.
1993 Each constant in memory thus far output is recorded
1994 in `const_desc_table'. */
1996 struct constant_descriptor_tree GTY(())
1998 /* A MEM for the constant. */
2001 /* The value of the constant. */
2005 static GTY((param_is (struct constant_descriptor_tree)))
2006 htab_t const_desc_htab;
2008 static struct constant_descriptor_tree * build_constant_desc (tree);
2009 static void maybe_output_constant_def_contents (struct constant_descriptor_tree *, int);
2011 /* Compute a hash code for a constant expression. */
2014 const_desc_hash (const void *ptr)
2016 return const_hash_1 (((struct constant_descriptor_tree *)ptr)->value);
2020 const_hash_1 (const tree exp)
2025 enum tree_code code = TREE_CODE (exp);
2027 /* Either set P and LEN to the address and len of something to hash and
2028 exit the switch or return a value. */
2033 p = (char *) &TREE_INT_CST (exp);
2034 len = sizeof TREE_INT_CST (exp);
2038 return real_hash (TREE_REAL_CST_PTR (exp));
2041 if (flag_writable_strings)
2048 p = TREE_STRING_POINTER (exp);
2049 len = TREE_STRING_LENGTH (exp);
2054 return (const_hash_1 (TREE_REALPART (exp)) * 5
2055 + const_hash_1 (TREE_IMAGPART (exp)));
2058 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2062 len = int_size_in_bytes (TREE_TYPE (exp));
2064 get_set_constructor_bytes (exp, (unsigned char *) tmp, len);
2072 hi = 5 + int_size_in_bytes (TREE_TYPE (exp));
2074 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2075 if (TREE_VALUE (link))
2076 hi = hi * 603 + const_hash_1 (TREE_VALUE (link));
2084 struct addr_const value;
2086 decode_addr_const (exp, &value);
2087 if (GET_CODE (value.base) == SYMBOL_REF)
2089 /* Don't hash the address of the SYMBOL_REF;
2090 only use the offset and the symbol name. */
2092 p = XSTR (value.base, 0);
2093 for (i = 0; p[i] != 0; i++)
2094 hi = ((hi * 613) + (unsigned) (p[i]));
2096 else if (GET_CODE (value.base) == LABEL_REF)
2097 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2105 return (const_hash_1 (TREE_OPERAND (exp, 0)) * 9
2106 + const_hash_1 (TREE_OPERAND (exp, 1)));
2110 case NON_LVALUE_EXPR:
2111 return const_hash_1 (TREE_OPERAND (exp, 0)) * 7 + 2;
2114 /* A language specific constant. Just hash the code. */
2118 /* Compute hashing function. */
2120 for (i = 0; i < len; i++)
2121 hi = ((hi * 613) + (unsigned) (p[i]));
2126 /* Wrapper of compare_constant, for the htab interface. */
2128 const_desc_eq (const void *p1, const void *p2)
2130 return compare_constant (((struct constant_descriptor_tree *)p1)->value,
2131 ((struct constant_descriptor_tree *)p2)->value);
2134 /* Compare t1 and t2, and return 1 only if they are known to result in
2135 the same bit pattern on output. */
2138 compare_constant (const tree t1, const tree t2)
2140 enum tree_code typecode;
2142 if (t1 == NULL_TREE)
2143 return t2 == NULL_TREE;
2144 if (t2 == NULL_TREE)
2147 if (TREE_CODE (t1) != TREE_CODE (t2))
2150 switch (TREE_CODE (t1))
2153 /* Integer constants are the same only if the same width of type. */
2154 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2156 return tree_int_cst_equal (t1, t2);
2159 /* Real constants are the same only if the same width of type. */
2160 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2163 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
2166 if (flag_writable_strings)
2169 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2)))
2172 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
2173 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
2174 TREE_STRING_LENGTH (t1)));
2177 return (compare_constant (TREE_REALPART (t1), TREE_REALPART (t2))
2178 && compare_constant (TREE_IMAGPART (t1), TREE_IMAGPART (t2)));
2181 typecode = TREE_CODE (TREE_TYPE (t1));
2182 if (typecode != TREE_CODE (TREE_TYPE (t2)))
2185 if (typecode == SET_TYPE)
2187 int len = int_size_in_bytes (TREE_TYPE (t2));
2188 unsigned char *tmp1, *tmp2;
2190 if (int_size_in_bytes (TREE_TYPE (t1)) != len)
2193 tmp1 = alloca (len);
2194 tmp2 = alloca (len);
2196 if (get_set_constructor_bytes (t1, tmp1, len) != NULL_TREE)
2198 if (get_set_constructor_bytes (t2, tmp2, len) != NULL_TREE)
2201 return memcmp (tmp1, tmp2, len) == 0;
2207 if (typecode == ARRAY_TYPE)
2209 HOST_WIDE_INT size_1 = int_size_in_bytes (TREE_TYPE (t1));
2210 /* For arrays, check that the sizes all match. */
2211 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2))
2213 || size_1 != int_size_in_bytes (TREE_TYPE (t2)))
2218 /* For record and union constructors, require exact type
2220 if (TREE_TYPE (t1) != TREE_TYPE (t2))
2224 for (l1 = CONSTRUCTOR_ELTS (t1), l2 = CONSTRUCTOR_ELTS (t2);
2226 l1 = TREE_CHAIN (l1), l2 = TREE_CHAIN (l2))
2228 /* Check that each value is the same... */
2229 if (! compare_constant (TREE_VALUE (l1), TREE_VALUE (l2)))
2231 /* ... and that they apply to the same fields! */
2232 if (typecode == ARRAY_TYPE)
2234 if (! compare_constant (TREE_PURPOSE (l1),
2240 if (TREE_PURPOSE (l1) != TREE_PURPOSE (l2))
2245 return l1 == NULL_TREE && l2 == NULL_TREE;
2251 struct addr_const value1, value2;
2253 decode_addr_const (t1, &value1);
2254 decode_addr_const (t2, &value2);
2255 return (value1.offset == value2.offset
2256 && strcmp (XSTR (value1.base, 0), XSTR (value2.base, 0)) == 0);
2262 return (compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))
2263 && compare_constant(TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)));
2267 case NON_LVALUE_EXPR:
2268 return compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2273 nt1 = (*lang_hooks.expand_constant) (t1);
2274 nt2 = (*lang_hooks.expand_constant) (t2);
2275 if (nt1 != t1 || nt2 != t2)
2276 return compare_constant (nt1, nt2);
2282 /* Should not get here. */
2286 /* Make a copy of the whole tree structure for a constant. This
2287 handles the same types of nodes that compare_constant handles. */
2290 copy_constant (tree exp)
2292 switch (TREE_CODE (exp))
2295 /* For ADDR_EXPR, we do not want to copy the decl whose address
2296 is requested. We do want to copy constants though. */
2297 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c')
2298 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2299 copy_constant (TREE_OPERAND (exp, 0)));
2301 return copy_node (exp);
2306 return copy_node (exp);
2309 return build_complex (TREE_TYPE (exp),
2310 copy_constant (TREE_REALPART (exp)),
2311 copy_constant (TREE_IMAGPART (exp)));
2315 return build (TREE_CODE (exp), TREE_TYPE (exp),
2316 copy_constant (TREE_OPERAND (exp, 0)),
2317 copy_constant (TREE_OPERAND (exp, 1)));
2321 case NON_LVALUE_EXPR:
2322 case VIEW_CONVERT_EXPR:
2323 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2324 copy_constant (TREE_OPERAND (exp, 0)));
2328 tree copy = copy_node (exp);
2329 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2332 CONSTRUCTOR_ELTS (copy) = list;
2333 for (tail = list; tail; tail = TREE_CHAIN (tail))
2334 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2335 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2336 for (tail = list; tail; tail = TREE_CHAIN (tail))
2337 TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail));
2345 t = (*lang_hooks.expand_constant) (exp);
2347 return copy_constant (t);
2354 /* Subroutine of output_constant_def:
2355 No constant equal to EXP is known to have been output.
2356 Make a constant descriptor to enter EXP in the hash table.
2357 Assign the label number and construct RTL to refer to the
2358 constant's location in memory.
2359 Caller is responsible for updating the hash table. */
2361 static struct constant_descriptor_tree *
2362 build_constant_desc (tree exp)
2368 struct constant_descriptor_tree *desc;
2370 desc = ggc_alloc (sizeof (*desc));
2371 if (flag_writable_strings && TREE_CODE (exp) == STRING_CST)
2374 desc->value = copy_constant (exp);
2376 /* Create a string containing the label name, in LABEL. */
2377 labelno = const_labelno++;
2378 ASM_GENERATE_INTERNAL_LABEL (label, "LC", labelno);
2380 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2381 symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label));
2382 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
2383 SYMBOL_REF_DECL (symbol) = desc->value;
2384 TREE_CONSTANT_POOL_ADDRESS_P (symbol) = 1;
2386 rtl = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)), symbol);
2387 set_mem_attributes (rtl, exp, 1);
2388 set_mem_alias_set (rtl, 0);
2389 set_mem_alias_set (rtl, const_alias_set);
2391 /* Set flags or add text to the name to record information, such as
2392 that it is a local symbol. If the name is changed, the macro
2393 ASM_OUTPUT_LABELREF will have to know how to strip this
2394 information. This call might invalidate our local variable
2395 SYMBOL; we can't use it afterward. */
2397 (*targetm.encode_section_info) (exp, rtl, true);
2404 /* Return an rtx representing a reference to constant data in memory
2405 for the constant expression EXP.
2407 If assembler code for such a constant has already been output,
2408 return an rtx to refer to it.
2409 Otherwise, output such a constant in memory
2410 and generate an rtx for it.
2412 If DEFER is nonzero, this constant can be deferred and output only
2413 if referenced in the function after all optimizations.
2415 `const_desc_table' records which constants already have label strings. */
2418 output_constant_def (tree exp, int defer)
2420 struct constant_descriptor_tree *desc;
2421 struct constant_descriptor_tree key;
2424 /* Look up EXP in the table of constant descriptors. If we didn't find
2425 it, create a new one. */
2427 loc = htab_find_slot (const_desc_htab, &key, INSERT);
2432 desc = build_constant_desc (exp);
2436 maybe_output_constant_def_contents (desc, defer);
2440 /* Subroutine of output_constant_def: Decide whether or not we need to
2441 output the constant DESC now, and if so, do it. */
2443 maybe_output_constant_def_contents (struct constant_descriptor_tree *desc,
2446 rtx symbol = XEXP (desc->rtl, 0);
2447 tree exp = desc->value;
2449 if (flag_syntax_only)
2452 if (TREE_ASM_WRITTEN (exp))
2453 /* Already output; don't do it again. */
2456 /* The only constants that cannot safely be deferred, assuming the
2457 context allows it, are strings under flag_writable_strings. */
2458 if (defer && (TREE_CODE (exp) != STRING_CST || !flag_writable_strings))
2460 /* Increment n_deferred_constants if it exists. It needs to be at
2461 least as large as the number of constants actually referred to
2462 by the function. If it's too small we'll stop looking too early
2463 and fail to emit constants; if it's too large we'll only look
2464 through the entire function when we could have stopped earlier. */
2466 n_deferred_constants++;
2470 output_constant_def_contents (symbol);
2473 /* We must output the constant data referred to by SYMBOL; do so. */
2476 output_constant_def_contents (rtx symbol)
2478 tree exp = SYMBOL_REF_DECL (symbol);
2479 const char *label = XSTR (symbol, 0);
2482 /* Make sure any other constants whose addresses appear in EXP
2483 are assigned label numbers. */
2484 int reloc = compute_reloc_for_constant (exp);
2486 /* Align the location counter as required by EXP's data type. */
2487 int align = TYPE_ALIGN (TREE_TYPE (exp));
2488 #ifdef CONSTANT_ALIGNMENT
2489 align = CONSTANT_ALIGNMENT (exp, align);
2492 output_addressed_constants (exp);
2494 /* We are no longer deferring this constant. */
2495 TREE_ASM_WRITTEN (exp) = 1;
2497 if (IN_NAMED_SECTION (exp))
2498 named_section (exp, NULL, reloc);
2500 (*targetm.asm_out.select_section) (exp, reloc, align);
2502 if (align > BITS_PER_UNIT)
2504 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2507 size = int_size_in_bytes (TREE_TYPE (exp));
2508 if (TREE_CODE (exp) == STRING_CST)
2509 size = MAX (TREE_STRING_LENGTH (exp), size);
2511 /* Do any machine/system dependent processing of the constant. */
2512 #ifdef ASM_DECLARE_CONSTANT_NAME
2513 ASM_DECLARE_CONSTANT_NAME (asm_out_file, label, exp, size);
2515 /* Standard thing is just output label for the constant. */
2516 ASM_OUTPUT_LABEL (asm_out_file, label);
2517 #endif /* ASM_DECLARE_CONSTANT_NAME */
2519 /* Output the value of EXP. */
2520 output_constant (exp, size, align);
2523 /* A constant which was deferred in its original location has been
2524 inserted by the RTL inliner into a different function. The
2525 current function's deferred constant count must be incremented. */
2527 notice_rtl_inlining_of_deferred_constant (void)
2529 n_deferred_constants++;
2532 /* Look up EXP in the table of constant descriptors. Return the rtl
2533 if it has been emitted, else null. */
2536 lookup_constant_def (tree exp)
2538 struct constant_descriptor_tree *desc;
2539 struct constant_descriptor_tree key;
2542 desc = htab_find (const_desc_htab, &key);
2544 return (desc ? desc->rtl : NULL_RTX);
2547 /* Used in the hash tables to avoid outputting the same constant
2548 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2549 are output once per function, not once per file. */
2550 /* ??? Only a few targets need per-function constant pools. Most
2551 can use one per-file pool. Should add a targetm bit to tell the
2554 struct rtx_constant_pool GTY(())
2556 /* Pointers to first and last constant in pool, as ordered by offset. */
2557 struct constant_descriptor_rtx *first;
2558 struct constant_descriptor_rtx *last;
2560 /* Hash facility for making memory-constants from constant rtl-expressions.
2561 It is used on RISC machines where immediate integer arguments and
2562 constant addresses are restricted so that such constants must be stored
2564 htab_t GTY((param_is (struct constant_descriptor_rtx))) const_rtx_htab;
2565 htab_t GTY((param_is (struct constant_descriptor_rtx))) const_rtx_sym_htab;
2567 /* Current offset in constant pool (does not include any
2568 machine-specific header). */
2569 HOST_WIDE_INT offset;
2572 struct constant_descriptor_rtx GTY((chain_next ("%h.next")))
2574 struct constant_descriptor_rtx *next;
2578 HOST_WIDE_INT offset;
2580 enum machine_mode mode;
2586 /* Hash and compare functions for const_rtx_htab. */
2589 const_desc_rtx_hash (const void *ptr)
2591 const struct constant_descriptor_rtx *desc = ptr;
2596 const_desc_rtx_eq (const void *a, const void *b)
2598 const struct constant_descriptor_rtx *x = a;
2599 const struct constant_descriptor_rtx *y = b;
2601 if (x->mode != y->mode)
2603 return rtx_equal_p (x->constant, y->constant);
2606 /* Hash and compare functions for const_rtx_sym_htab. */
2609 const_desc_rtx_sym_hash (const void *ptr)
2611 const struct constant_descriptor_rtx *desc = ptr;
2612 return htab_hash_string (XSTR (desc->sym, 0));
2616 const_desc_rtx_sym_eq (const void *a, const void *b)
2618 const struct constant_descriptor_rtx *x = a;
2619 const struct constant_descriptor_rtx *y = b;
2620 return x->sym == y->sym;
2623 /* This is the worker function for const_rtx_hash, called via for_each_rtx. */
2626 const_rtx_hash_1 (rtx *xp, void *data)
2628 unsigned HOST_WIDE_INT hwi;
2629 enum machine_mode mode;
2635 code = GET_CODE (x);
2636 mode = GET_MODE (x);
2637 h = (hashval_t) code * 1048573 + mode;
2645 const int shift = sizeof (hashval_t) * CHAR_BIT;
2646 const int n = sizeof (HOST_WIDE_INT) / sizeof (hashval_t);
2649 h ^= (hashval_t) hwi;
2650 for (i = 1; i < n; ++i)
2653 h ^= (hashval_t) hwi;
2659 if (mode == VOIDmode)
2661 hwi = CONST_DOUBLE_LOW (x) ^ CONST_DOUBLE_HIGH (x);
2665 h ^= real_hash (CONST_DOUBLE_REAL_VALUE (x));
2669 h ^= htab_hash_string (XSTR (x, 0));
2673 h = h * 251 + CODE_LABEL_NUMBER (XEXP (x, 0));
2677 case UNSPEC_VOLATILE:
2678 h = h * 251 + XINT (x, 1);
2686 *hp = *hp * 509 + h;
2690 /* Compute a hash value for X, which should be a constant. */
2693 const_rtx_hash (rtx x)
2696 for_each_rtx (&x, const_rtx_hash_1, &h);
2701 /* Initialize constant pool hashing for a new function. */
2704 init_varasm_status (struct function *f)
2706 struct varasm_status *p;
2707 struct rtx_constant_pool *pool;
2709 p = ggc_alloc (sizeof (struct varasm_status));
2712 pool = ggc_alloc (sizeof (struct rtx_constant_pool));
2714 p->deferred_constants = 0;
2716 pool->const_rtx_htab = htab_create_ggc (31, const_desc_rtx_hash,
2717 const_desc_rtx_eq, NULL);
2718 pool->const_rtx_sym_htab = htab_create_ggc (31, const_desc_rtx_sym_hash,
2719 const_desc_rtx_sym_eq, NULL);
2720 pool->first = pool->last = NULL;
2724 /* Given a MINUS expression, simplify it if both sides
2725 include the same symbol. */
2728 simplify_subtraction (rtx x)
2730 rtx r = simplify_rtx (x);
2734 /* Given a constant rtx X, make (or find) a memory constant for its value
2735 and return a MEM rtx to refer to it in memory. */
2738 force_const_mem (enum machine_mode mode, rtx x)
2740 struct constant_descriptor_rtx *desc, tmp;
2741 struct rtx_constant_pool *pool = cfun->varasm->pool;
2748 /* If we're not allowed to drop X into the constant pool, don't. */
2749 if ((*targetm.cannot_force_const_mem) (x))
2752 /* Lookup the value in the hashtable. */
2755 hash = const_rtx_hash (x);
2756 slot = htab_find_slot_with_hash (pool->const_rtx_htab, &tmp, hash, INSERT);
2759 /* If the constant was already present, return its memory. */
2761 return copy_rtx (desc->mem);
2763 /* Otherwise, create a new descriptor. */
2764 desc = ggc_alloc (sizeof (*desc));
2767 /* Align the location counter as required by EXP's data type. */
2768 align = GET_MODE_ALIGNMENT (mode == VOIDmode ? word_mode : mode);
2769 #ifdef CONSTANT_ALIGNMENT
2771 tree type = (*lang_hooks.types.type_for_mode) (mode, 0);
2772 if (type != NULL_TREE)
2773 align = CONSTANT_ALIGNMENT (make_tree (type, x), align);
2777 pool->offset += (align / BITS_PER_UNIT) - 1;
2778 pool->offset &= ~ ((align / BITS_PER_UNIT) - 1);
2781 desc->constant = tmp.constant;
2782 desc->offset = pool->offset;
2785 desc->align = align;
2786 desc->labelno = const_labelno;
2789 pool->offset += GET_MODE_SIZE (mode);
2791 pool->last->next = desc;
2793 pool->first = pool->last = desc;
2796 /* Create a string containing the label name, in LABEL. */
2797 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
2800 /* Construct the SYMBOL_REF. Make sure to mark it as belonging to
2801 the constants pool. */
2802 desc->sym = symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label));
2803 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
2804 CONSTANT_POOL_ADDRESS_P (symbol) = 1;
2805 current_function_uses_const_pool = 1;
2807 /* Insert the descriptor into the symbol cross-reference table too. */
2808 slot = htab_find_slot (pool->const_rtx_sym_htab, desc, INSERT);
2813 /* Construct the MEM. */
2814 desc->mem = def = gen_rtx_MEM (mode, symbol);
2815 set_mem_attributes (def, (*lang_hooks.types.type_for_mode) (mode, 0), 1);
2816 RTX_UNCHANGING_P (def) = 1;
2818 /* If we're dropping a label to the constant pool, make sure we
2820 if (GET_CODE (x) == LABEL_REF)
2821 LABEL_PRESERVE_P (XEXP (x, 0)) = 1;
2823 return copy_rtx (def);
2826 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
2827 the corresponding constant_descriptor_rtx structure. */
2829 static struct constant_descriptor_rtx *
2830 find_pool_constant (struct rtx_constant_pool *pool, rtx sym)
2832 struct constant_descriptor_rtx tmp;
2834 return htab_find (pool->const_rtx_sym_htab, &tmp);
2837 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
2840 get_pool_constant (rtx addr)
2842 return find_pool_constant (cfun->varasm->pool, addr)->constant;
2845 /* Given a constant pool SYMBOL_REF, return the corresponding constant
2846 and whether it has been output or not. */
2849 get_pool_constant_mark (rtx addr, bool *pmarked)
2851 struct constant_descriptor_rtx *desc;
2853 desc = find_pool_constant (cfun->varasm->pool, addr);
2854 *pmarked = (desc->mark != 0);
2855 return desc->constant;
2858 /* Likewise, but for the constant pool of a specific function. */
2861 get_pool_constant_for_function (struct function *f, rtx addr)
2863 return find_pool_constant (f->varasm->pool, addr)->constant;
2866 /* Similar, return the mode. */
2869 get_pool_mode (rtx addr)
2871 return find_pool_constant (cfun->varasm->pool, addr)->mode;
2875 get_pool_mode_for_function (struct function *f, rtx addr)
2877 return find_pool_constant (f->varasm->pool, addr)->mode;
2880 /* Similar, return the offset in the constant pool. */
2883 get_pool_offset (rtx addr)
2885 return find_pool_constant (cfun->varasm->pool, addr)->offset;
2888 /* Return the size of the constant pool. */
2891 get_pool_size (void)
2893 return cfun->varasm->pool->offset;
2896 /* Worker function for output_constant_pool_1. Emit assembly for X
2897 in MODE with known alignment ALIGN. */
2900 output_constant_pool_2 (enum machine_mode mode, rtx x, unsigned int align)
2902 switch (GET_MODE_CLASS (mode))
2905 if (GET_CODE (x) != CONST_DOUBLE)
2910 REAL_VALUE_FROM_CONST_DOUBLE (r, x);
2911 assemble_real (r, mode, align);
2916 case MODE_PARTIAL_INT:
2917 assemble_integer (x, GET_MODE_SIZE (mode), align, 1);
2920 case MODE_VECTOR_FLOAT:
2921 case MODE_VECTOR_INT:
2924 enum machine_mode submode = GET_MODE_INNER (mode);
2925 unsigned int subalign = MIN (align, GET_MODE_BITSIZE (submode));
2927 if (GET_CODE (x) != CONST_VECTOR)
2929 units = CONST_VECTOR_NUNITS (x);
2931 for (i = 0; i < units; i++)
2933 rtx elt = CONST_VECTOR_ELT (x, i);
2934 output_constant_pool_2 (submode, elt, i ? subalign : align);
2944 /* Worker function for output_constant_pool. Emit POOL. */
2947 output_constant_pool_1 (struct constant_descriptor_rtx *desc)
2955 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
2956 whose CODE_LABEL has been deleted. This can occur if a jump table
2957 is eliminated by optimization. If so, write a constant of zero
2958 instead. Note that this can also happen by turning the
2959 CODE_LABEL into a NOTE. */
2960 /* ??? This seems completely and utterly wrong. Certainly it's
2961 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
2962 functioning even with INSN_DELETED_P and friends. */
2965 switch (GET_CODE (x))
2968 if (GET_CODE (XEXP (x, 0)) != PLUS
2969 || GET_CODE (XEXP (XEXP (x, 0), 0)) != LABEL_REF)
2971 tmp = XEXP (XEXP (x, 0), 0);
2976 if (INSN_DELETED_P (tmp)
2977 || (GET_CODE (tmp) == NOTE
2978 && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_DELETED))
2989 /* First switch to correct section. */
2990 (*targetm.asm_out.select_rtx_section) (desc->mode, x, desc->align);
2992 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
2993 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, desc->mode,
2994 desc->align, desc->labelno, done);
2997 assemble_align (desc->align);
2999 /* Output the label. */
3000 (*targetm.asm_out.internal_label) (asm_out_file, "LC", desc->labelno);
3002 /* Output the data. */
3003 output_constant_pool_2 (desc->mode, x, desc->align);
3005 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3006 sections have proper size. */
3007 if (desc->align > GET_MODE_BITSIZE (desc->mode)
3008 && in_section == in_named
3009 && get_named_section_flags (in_named_name) & SECTION_MERGE)
3010 assemble_align (desc->align);
3012 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3018 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3019 to as used. Emit referenced deferred strings. This function can
3020 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3023 mark_constant (rtx *current_rtx, void *data)
3025 struct rtx_constant_pool *pool = data;
3026 rtx x = *current_rtx;
3028 if (x == NULL_RTX || GET_CODE (x) != SYMBOL_REF)
3031 if (CONSTANT_POOL_ADDRESS_P (x))
3033 struct constant_descriptor_rtx *desc = find_pool_constant (pool, x);
3034 if (desc->mark == 0)
3037 for_each_rtx (&desc->constant, mark_constant, pool);
3040 else if (TREE_CONSTANT_POOL_ADDRESS_P (x))
3042 tree exp = SYMBOL_REF_DECL (x);
3043 if (!TREE_ASM_WRITTEN (exp))
3045 n_deferred_constants--;
3046 output_constant_def_contents (x);
3053 /* Look through appropriate parts of INSN, marking all entries in the
3054 constant pool which are actually being used. Entries that are only
3055 referenced by other constants are also marked as used. Emit
3056 deferred strings that are used. */
3059 mark_constants (struct rtx_constant_pool *pool, rtx insn)
3064 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3065 insns, not any notes that may be attached. We don't want to mark
3066 a constant just because it happens to appear in a REG_EQUIV note. */
3067 if (GET_CODE (PATTERN (insn)) == SEQUENCE)
3069 rtx seq = PATTERN (insn);
3070 int i, n = XVECLEN (seq, 0);
3071 for (i = 0; i < n; ++i)
3073 rtx subinsn = XVECEXP (seq, 0, i);
3074 if (INSN_P (subinsn))
3075 for_each_rtx (&PATTERN (subinsn), mark_constant, pool);
3079 for_each_rtx (&PATTERN (insn), mark_constant, pool);
3082 /* Look through the instructions for this function, and mark all the
3083 entries in POOL which are actually being used. Emit deferred constants
3084 which have indeed been used. */
3087 mark_constant_pool (struct rtx_constant_pool *pool)
3091 if (pool->first == 0 && n_deferred_constants == 0)
3094 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3095 mark_constants (pool, insn);
3097 for (link = current_function_epilogue_delay_list;
3099 link = XEXP (link, 1))
3100 mark_constants (pool, XEXP (link, 0));
3103 /* Write all the constants in the constant pool. */
3106 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED,
3107 tree fndecl ATTRIBUTE_UNUSED)
3109 struct rtx_constant_pool *pool = cfun->varasm->pool;
3110 struct constant_descriptor_rtx *desc;
3112 /* It is possible for gcc to call force_const_mem and then to later
3113 discard the instructions which refer to the constant. In such a
3114 case we do not need to output the constant. */
3115 mark_constant_pool (pool);
3117 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3118 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool->offset);
3121 for (desc = pool->first; desc ; desc = desc->next)
3122 output_constant_pool_1 (desc);
3124 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3125 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool->offset);
3128 /* Done with this pool. */
3129 cfun->varasm->pool = NULL;
3132 /* Determine what kind of relocations EXP may need. */
3135 compute_reloc_for_constant (tree exp)
3137 int reloc = 0, reloc2;
3140 /* Give the front-end a chance to convert VALUE to something that
3141 looks more like a constant to the back-end. */
3142 exp = (*lang_hooks.expand_constant) (exp);
3144 switch (TREE_CODE (exp))
3148 /* Go inside any operations that get_inner_reference can handle and see
3149 if what's inside is a constant: no need to do anything here for
3150 addresses of variables or functions. */
3151 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
3152 tem = TREE_OPERAND (tem, 0))
3155 if (TREE_PUBLIC (tem))
3162 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
3163 reloc |= compute_reloc_for_constant (TREE_OPERAND (exp, 1));
3167 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
3168 reloc2 = compute_reloc_for_constant (TREE_OPERAND (exp, 1));
3169 /* The difference of two local labels is computable at link time. */
3170 if (reloc == 1 && reloc2 == 1)
3178 case NON_LVALUE_EXPR:
3179 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
3183 for (tem = CONSTRUCTOR_ELTS (exp); tem; tem = TREE_CHAIN (tem))
3184 if (TREE_VALUE (tem) != 0)
3185 reloc |= compute_reloc_for_constant (TREE_VALUE (tem));
3195 /* Find all the constants whose addresses are referenced inside of EXP,
3196 and make sure assembler code with a label has been output for each one.
3197 Indicate whether an ADDR_EXPR has been encountered. */
3200 output_addressed_constants (tree exp)
3204 /* Give the front-end a chance to convert VALUE to something that
3205 looks more like a constant to the back-end. */
3206 exp = (*lang_hooks.expand_constant) (exp);
3208 switch (TREE_CODE (exp))
3212 /* Go inside any operations that get_inner_reference can handle and see
3213 if what's inside is a constant: no need to do anything here for
3214 addresses of variables or functions. */
3215 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
3216 tem = TREE_OPERAND (tem, 0))
3219 if (TREE_CODE_CLASS (TREE_CODE (tem)) == 'c'
3220 || TREE_CODE (tem) == CONSTRUCTOR)
3221 output_constant_def (tem, 0);
3226 output_addressed_constants (TREE_OPERAND (exp, 1));
3231 case NON_LVALUE_EXPR:
3232 output_addressed_constants (TREE_OPERAND (exp, 0));
3236 for (tem = CONSTRUCTOR_ELTS (exp); tem; tem = TREE_CHAIN (tem))
3237 if (TREE_VALUE (tem) != 0)
3238 output_addressed_constants (TREE_VALUE (tem));
3247 /* Return nonzero if VALUE is a valid constant-valued expression
3248 for use in initializing a static variable; one that can be an
3249 element of a "constant" initializer.
3251 Return null_pointer_node if the value is absolute;
3252 if it is relocatable, return the variable that determines the relocation.
3253 We assume that VALUE has been folded as much as possible;
3254 therefore, we do not need to check for such things as
3255 arithmetic-combinations of integers. */
3258 initializer_constant_valid_p (tree value, tree endtype)
3260 /* Give the front-end a chance to convert VALUE to something that
3261 looks more like a constant to the back-end. */
3262 value = (*lang_hooks.expand_constant) (value);
3264 switch (TREE_CODE (value))
3267 if ((TREE_CODE (TREE_TYPE (value)) == UNION_TYPE
3268 || TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE)
3269 && TREE_CONSTANT (value)
3270 && CONSTRUCTOR_ELTS (value))
3273 bool absolute = true;
3275 for (elt = CONSTRUCTOR_ELTS (value); elt; elt = TREE_CHAIN (elt))
3278 value = TREE_VALUE (elt);
3279 reloc = initializer_constant_valid_p (value, TREE_TYPE (value));
3282 if (reloc != null_pointer_node)
3285 /* For a non-absolute relocation, there is no single
3286 variable that can be "the variable that determines the
3288 return absolute ? null_pointer_node : error_mark_node;
3291 return TREE_STATIC (value) ? null_pointer_node : NULL_TREE;
3298 return null_pointer_node;
3302 return staticp (TREE_OPERAND (value, 0)) ? TREE_OPERAND (value, 0) : 0;
3304 case VIEW_CONVERT_EXPR:
3305 case NON_LVALUE_EXPR:
3306 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3310 /* Allow conversions between pointer types. */
3311 if (POINTER_TYPE_P (TREE_TYPE (value))
3312 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3313 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3315 /* Allow conversions between real types. */
3316 if (FLOAT_TYPE_P (TREE_TYPE (value))
3317 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3318 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3320 /* Allow length-preserving conversions between integer types. */
3321 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3322 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3323 && (TYPE_PRECISION (TREE_TYPE (value))
3324 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3325 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3327 /* Allow conversions between other integer types only if
3329 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3330 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3332 tree inner = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3334 if (inner == null_pointer_node)
3335 return null_pointer_node;
3339 /* Allow (int) &foo provided int is as wide as a pointer. */
3340 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3341 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3342 && (TYPE_PRECISION (TREE_TYPE (value))
3343 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3344 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3347 /* Likewise conversions from int to pointers, but also allow
3348 conversions from 0. */
3349 if ((POINTER_TYPE_P (TREE_TYPE (value))
3350 || TREE_CODE (TREE_TYPE (value)) == OFFSET_TYPE)
3351 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3353 if (integer_zerop (TREE_OPERAND (value, 0)))
3354 return null_pointer_node;
3355 else if (TYPE_PRECISION (TREE_TYPE (value))
3356 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0))))
3357 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3361 /* Allow conversions to union types if the value inside is okay. */
3362 if (TREE_CODE (TREE_TYPE (value)) == UNION_TYPE)
3363 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3368 if (! INTEGRAL_TYPE_P (endtype)
3369 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3371 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3373 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3375 /* If either term is absolute, use the other terms relocation. */
3376 if (valid0 == null_pointer_node)
3378 if (valid1 == null_pointer_node)
3384 if (! INTEGRAL_TYPE_P (endtype)
3385 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3387 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3389 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3391 /* Win if second argument is absolute. */
3392 if (valid1 == null_pointer_node)
3394 /* Win if both arguments have the same relocation.
3395 Then the value is absolute. */
3396 if (valid0 == valid1 && valid0 != 0)
3397 return null_pointer_node;
3399 /* Since GCC guarantees that string constants are unique in the
3400 generated code, a subtraction between two copies of the same
3401 constant string is absolute. */
3402 if (valid0 && TREE_CODE (valid0) == STRING_CST &&
3403 valid1 && TREE_CODE (valid1) == STRING_CST &&
3404 TREE_STRING_POINTER (valid0) == TREE_STRING_POINTER (valid1))
3405 return null_pointer_node;
3408 /* Support differences between labels. */
3409 if (INTEGRAL_TYPE_P (endtype))
3412 op0 = TREE_OPERAND (value, 0);
3413 op1 = TREE_OPERAND (value, 1);
3415 /* Like STRIP_NOPS except allow the operand mode to widen.
3416 This works around a feature of fold that simplifies
3417 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3418 that the narrower operation is cheaper. */
3420 while (TREE_CODE (op0) == NOP_EXPR
3421 || TREE_CODE (op0) == CONVERT_EXPR
3422 || TREE_CODE (op0) == NON_LVALUE_EXPR)
3424 tree inner = TREE_OPERAND (op0, 0);
3425 if (inner == error_mark_node
3426 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3427 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0)))
3428 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3433 while (TREE_CODE (op1) == NOP_EXPR
3434 || TREE_CODE (op1) == CONVERT_EXPR
3435 || TREE_CODE (op1) == NON_LVALUE_EXPR)
3437 tree inner = TREE_OPERAND (op1, 0);
3438 if (inner == error_mark_node
3439 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3440 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1)))
3441 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3446 if (TREE_CODE (op0) == ADDR_EXPR
3447 && TREE_CODE (TREE_OPERAND (op0, 0)) == LABEL_DECL
3448 && TREE_CODE (op1) == ADDR_EXPR
3449 && TREE_CODE (TREE_OPERAND (op1, 0)) == LABEL_DECL)
3450 return null_pointer_node;
3461 /* Output assembler code for constant EXP to FILE, with no label.
3462 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3463 Assumes output_addressed_constants has been done on EXP already.
3465 Generate exactly SIZE bytes of assembler data, padding at the end
3466 with zeros if necessary. SIZE must always be specified.
3468 SIZE is important for structure constructors,
3469 since trailing members may have been omitted from the constructor.
3470 It is also important for initialization of arrays from string constants
3471 since the full length of the string constant might not be wanted.
3472 It is also needed for initialization of unions, where the initializer's
3473 type is just one member, and that may not be as long as the union.
3475 There a case in which we would fail to output exactly SIZE bytes:
3476 for a structure constructor that wants to produce more than SIZE bytes.
3477 But such constructors will never be generated for any possible input.
3479 ALIGN is the alignment of the data in bits. */
3482 output_constant (tree exp, unsigned HOST_WIDE_INT size, unsigned int align)
3484 enum tree_code code;
3485 unsigned HOST_WIDE_INT thissize;
3487 /* Some front-ends use constants other than the standard language-independent
3488 varieties, but which may still be output directly. Give the front-end a
3489 chance to convert EXP to a language-independent representation. */
3490 exp = (*lang_hooks.expand_constant) (exp);
3492 if (size == 0 || flag_syntax_only)
3495 /* Eliminate any conversions since we'll be outputting the underlying
3497 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
3498 || TREE_CODE (exp) == NON_LVALUE_EXPR
3499 || TREE_CODE (exp) == VIEW_CONVERT_EXPR)
3500 exp = TREE_OPERAND (exp, 0);
3502 code = TREE_CODE (TREE_TYPE (exp));
3503 thissize = int_size_in_bytes (TREE_TYPE (exp));
3505 /* Allow a constructor with no elements for any data type.
3506 This means to fill the space with zeros. */
3507 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
3509 assemble_zeros (size);
3513 if (TREE_CODE (exp) == FDESC_EXPR)
3515 #ifdef ASM_OUTPUT_FDESC
3516 HOST_WIDE_INT part = tree_low_cst (TREE_OPERAND (exp, 1), 0);
3517 tree decl = TREE_OPERAND (exp, 0);
3518 ASM_OUTPUT_FDESC (asm_out_file, decl, part);
3525 /* Now output the underlying data. If we've handling the padding, return.
3526 Otherwise, break and ensure THISSIZE is the size written. */
3534 case REFERENCE_TYPE:
3536 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
3537 EXPAND_INITIALIZER),
3539 error ("initializer for integer value is too complicated");
3543 if (TREE_CODE (exp) != REAL_CST)
3544 error ("initializer for floating value is not a floating constant");
3546 assemble_real (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)), align);
3550 output_constant (TREE_REALPART (exp), thissize / 2, align);
3551 output_constant (TREE_IMAGPART (exp), thissize / 2,
3552 min_align (align, BITS_PER_UNIT * (thissize / 2)));
3557 if (TREE_CODE (exp) == CONSTRUCTOR)
3559 output_constructor (exp, size, align);
3562 else if (TREE_CODE (exp) == STRING_CST)
3564 thissize = MIN ((unsigned HOST_WIDE_INT)TREE_STRING_LENGTH (exp),
3566 assemble_string (TREE_STRING_POINTER (exp), thissize);
3568 else if (TREE_CODE (exp) == VECTOR_CST)
3572 unsigned int nalign;
3573 enum machine_mode inner;
3575 inner = GET_MODE_INNER (TYPE_MODE (TREE_TYPE (exp)));
3576 nalign = MIN (align, GET_MODE_ALIGNMENT (inner));
3578 elt_size = GET_MODE_UNIT_SIZE (TYPE_MODE (TREE_TYPE (exp)));
3580 link = TREE_VECTOR_CST_ELTS (exp);
3581 output_constant (TREE_VALUE (link), elt_size, align);
3582 while ((link = TREE_CHAIN (link)) != NULL)
3583 output_constant (TREE_VALUE (link), elt_size, nalign);
3591 if (TREE_CODE (exp) == CONSTRUCTOR)
3592 output_constructor (exp, size, align);
3598 if (TREE_CODE (exp) == INTEGER_CST)
3599 assemble_integer (expand_expr (exp, NULL_RTX,
3600 VOIDmode, EXPAND_INITIALIZER),
3601 thissize, align, 1);
3602 else if (TREE_CODE (exp) == CONSTRUCTOR)
3604 unsigned char *buffer = alloca (thissize);
3605 if (get_set_constructor_bytes (exp, buffer, thissize))
3607 assemble_string ((char *) buffer, thissize);
3610 error ("unknown set constructor type");
3620 if (size > thissize)
3621 assemble_zeros (size - thissize);
3625 /* Subroutine of output_constructor, used for computing the size of
3626 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3627 type with an unspecified upper bound. */
3629 static unsigned HOST_WIDE_INT
3630 array_size_for_constructor (tree val)
3634 /* This code used to attempt to handle string constants that are not
3635 arrays of single-bytes, but nothing else does, so there's no point in
3637 if (TREE_CODE (val) == STRING_CST)
3638 return TREE_STRING_LENGTH (val);
3640 max_index = NULL_TREE;
3641 for (i = CONSTRUCTOR_ELTS (val); i; i = TREE_CHAIN (i))
3643 tree index = TREE_PURPOSE (i);
3645 if (TREE_CODE (index) == RANGE_EXPR)
3646 index = TREE_OPERAND (index, 1);
3647 if (max_index == NULL_TREE || tree_int_cst_lt (max_index, index))
3651 if (max_index == NULL_TREE)
3654 /* Compute the total number of array elements. */
3655 i = size_binop (MINUS_EXPR, convert (sizetype, max_index),
3657 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val)))));
3658 i = size_binop (PLUS_EXPR, i, convert (sizetype, integer_one_node));
3660 /* Multiply by the array element unit size to find number of bytes. */
3661 i = size_binop (MULT_EXPR, i, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val))));
3663 return tree_low_cst (i, 1);
3666 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3667 Generate at least SIZE bytes, padding if necessary. */
3670 output_constructor (tree exp, unsigned HOST_WIDE_INT size,
3673 tree type = TREE_TYPE (exp);
3674 tree link, field = 0;
3676 /* Number of bytes output or skipped so far.
3677 In other words, current position within the constructor. */
3678 HOST_WIDE_INT total_bytes = 0;
3679 /* Nonzero means BYTE contains part of a byte, to be output. */
3680 int byte_buffer_in_use = 0;
3683 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
3686 if (TREE_CODE (type) == RECORD_TYPE)
3687 field = TYPE_FIELDS (type);
3689 if (TREE_CODE (type) == ARRAY_TYPE
3690 && TYPE_DOMAIN (type) != 0)
3691 min_index = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
3693 /* As LINK goes through the elements of the constant,
3694 FIELD goes through the structure fields, if the constant is a structure.
3695 if the constant is a union, then we override this,
3696 by getting the field from the TREE_LIST element.
3697 But the constant could also be an array. Then FIELD is zero.
3699 There is always a maximum of one element in the chain LINK for unions
3700 (even if the initializer in a source program incorrectly contains
3702 for (link = CONSTRUCTOR_ELTS (exp);
3704 link = TREE_CHAIN (link),
3705 field = field ? TREE_CHAIN (field) : 0)
3707 tree val = TREE_VALUE (link);
3710 /* The element in a union constructor specifies the proper field
3712 if ((TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
3713 || TREE_CODE (type) == QUAL_UNION_TYPE)
3714 && TREE_PURPOSE (link) != 0)
3715 field = TREE_PURPOSE (link);
3717 else if (TREE_CODE (type) == ARRAY_TYPE)
3718 index = TREE_PURPOSE (link);
3720 #ifdef ASM_COMMENT_START
3721 if (field && flag_verbose_asm)
3722 fprintf (asm_out_file, "%s %s:\n",
3725 ? IDENTIFIER_POINTER (DECL_NAME (field))
3729 /* Eliminate the marker that makes a cast not be an lvalue. */
3733 if (index && TREE_CODE (index) == RANGE_EXPR)
3735 unsigned HOST_WIDE_INT fieldsize
3736 = int_size_in_bytes (TREE_TYPE (type));
3737 HOST_WIDE_INT lo_index = tree_low_cst (TREE_OPERAND (index, 0), 0);
3738 HOST_WIDE_INT hi_index = tree_low_cst (TREE_OPERAND (index, 1), 0);
3739 HOST_WIDE_INT index;
3740 unsigned int align2 = min_align (align, fieldsize * BITS_PER_UNIT);
3742 for (index = lo_index; index <= hi_index; index++)
3744 /* Output the element's initial value. */
3746 assemble_zeros (fieldsize);
3748 output_constant (val, fieldsize, align2);
3750 /* Count its size. */
3751 total_bytes += fieldsize;
3754 else if (field == 0 || !DECL_BIT_FIELD (field))
3756 /* An element that is not a bit-field. */
3758 unsigned HOST_WIDE_INT fieldsize;
3759 /* Since this structure is static,
3760 we know the positions are constant. */
3761 HOST_WIDE_INT pos = field ? int_byte_position (field) : 0;
3762 unsigned int align2;
3765 pos = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val)), 1)
3766 * (tree_low_cst (index, 0) - tree_low_cst (min_index, 0)));
3768 /* Output any buffered-up bit-fields preceding this element. */
3769 if (byte_buffer_in_use)
3771 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
3773 byte_buffer_in_use = 0;
3776 /* Advance to offset of this element.
3777 Note no alignment needed in an array, since that is guaranteed
3778 if each element has the proper size. */
3779 if ((field != 0 || index != 0) && pos != total_bytes)
3781 assemble_zeros (pos - total_bytes);
3785 /* Find the alignment of this element. */
3786 align2 = min_align (align, BITS_PER_UNIT * pos);
3788 /* Determine size this element should occupy. */
3793 /* If this is an array with an unspecified upper bound,
3794 the initializer determines the size. */
3795 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
3796 but we cannot do this until the deprecated support for
3797 initializing zero-length array members is removed. */
3798 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE
3799 && TYPE_DOMAIN (TREE_TYPE (field))
3800 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field))))
3802 fieldsize = array_size_for_constructor (val);
3803 /* Given a non-empty initialization, this field had
3805 if (fieldsize != 0 && TREE_CHAIN (field) != NULL_TREE)
3808 else if (DECL_SIZE_UNIT (field))
3810 /* ??? This can't be right. If the decl size overflows
3811 a host integer we will silently emit no data. */
3812 if (host_integerp (DECL_SIZE_UNIT (field), 1))
3813 fieldsize = tree_low_cst (DECL_SIZE_UNIT (field), 1);
3817 fieldsize = int_size_in_bytes (TREE_TYPE (type));
3819 /* Output the element's initial value. */
3821 assemble_zeros (fieldsize);
3823 output_constant (val, fieldsize, align2);
3825 /* Count its size. */
3826 total_bytes += fieldsize;
3828 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
3829 error ("invalid initial value for member `%s'",
3830 IDENTIFIER_POINTER (DECL_NAME (field)));
3833 /* Element that is a bit-field. */
3835 HOST_WIDE_INT next_offset = int_bit_position (field);
3836 HOST_WIDE_INT end_offset
3837 = (next_offset + tree_low_cst (DECL_SIZE (field), 1));
3840 val = integer_zero_node;
3842 /* If this field does not start in this (or, next) byte,
3844 if (next_offset / BITS_PER_UNIT != total_bytes)
3846 /* Output remnant of any bit field in previous bytes. */
3847 if (byte_buffer_in_use)
3849 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
3851 byte_buffer_in_use = 0;
3854 /* If still not at proper byte, advance to there. */
3855 if (next_offset / BITS_PER_UNIT != total_bytes)
3857 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
3858 total_bytes = next_offset / BITS_PER_UNIT;
3862 if (! byte_buffer_in_use)
3865 /* We must split the element into pieces that fall within
3866 separate bytes, and combine each byte with previous or
3867 following bit-fields. */
3869 /* next_offset is the offset n fbits from the beginning of
3870 the structure to the next bit of this element to be processed.
3871 end_offset is the offset of the first bit past the end of
3873 while (next_offset < end_offset)
3877 HOST_WIDE_INT value;
3878 HOST_WIDE_INT next_byte = next_offset / BITS_PER_UNIT;
3879 HOST_WIDE_INT next_bit = next_offset % BITS_PER_UNIT;
3881 /* Advance from byte to byte
3882 within this element when necessary. */
3883 while (next_byte != total_bytes)
3885 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
3890 /* Number of bits we can process at once
3891 (all part of the same byte). */
3892 this_time = MIN (end_offset - next_offset,
3893 BITS_PER_UNIT - next_bit);
3894 if (BYTES_BIG_ENDIAN)
3896 /* On big-endian machine, take the most significant bits
3897 first (of the bits that are significant)
3898 and put them into bytes from the most significant end. */
3899 shift = end_offset - next_offset - this_time;
3901 /* Don't try to take a bunch of bits that cross
3902 the word boundary in the INTEGER_CST. We can
3903 only select bits from the LOW or HIGH part
3905 if (shift < HOST_BITS_PER_WIDE_INT
3906 && shift + this_time > HOST_BITS_PER_WIDE_INT)
3908 this_time = shift + this_time - HOST_BITS_PER_WIDE_INT;
3909 shift = HOST_BITS_PER_WIDE_INT;
3912 /* Now get the bits from the appropriate constant word. */
3913 if (shift < HOST_BITS_PER_WIDE_INT)
3914 value = TREE_INT_CST_LOW (val);
3915 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
3917 value = TREE_INT_CST_HIGH (val);
3918 shift -= HOST_BITS_PER_WIDE_INT;
3923 /* Get the result. This works only when:
3924 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
3925 byte |= (((value >> shift)
3926 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
3927 << (BITS_PER_UNIT - this_time - next_bit));
3931 /* On little-endian machines,
3932 take first the least significant bits of the value
3933 and pack them starting at the least significant
3934 bits of the bytes. */
3935 shift = next_offset - int_bit_position (field);
3937 /* Don't try to take a bunch of bits that cross
3938 the word boundary in the INTEGER_CST. We can
3939 only select bits from the LOW or HIGH part
3941 if (shift < HOST_BITS_PER_WIDE_INT
3942 && shift + this_time > HOST_BITS_PER_WIDE_INT)
3943 this_time = (HOST_BITS_PER_WIDE_INT - shift);
3945 /* Now get the bits from the appropriate constant word. */
3946 if (shift < HOST_BITS_PER_WIDE_INT)
3947 value = TREE_INT_CST_LOW (val);
3948 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
3950 value = TREE_INT_CST_HIGH (val);
3951 shift -= HOST_BITS_PER_WIDE_INT;
3956 /* Get the result. This works only when:
3957 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
3958 byte |= (((value >> shift)
3959 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
3963 next_offset += this_time;
3964 byte_buffer_in_use = 1;
3969 if (byte_buffer_in_use)
3971 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
3975 if ((unsigned HOST_WIDE_INT)total_bytes < size)
3976 assemble_zeros (size - total_bytes);
3979 /* This TREE_LIST contains any weak symbol declarations waiting
3981 static GTY(()) tree weak_decls;
3983 /* Mark DECL as weak. */
3986 mark_weak (tree decl)
3988 DECL_WEAK (decl) = 1;
3990 if (DECL_RTL_SET_P (decl)
3991 && GET_CODE (DECL_RTL (decl)) == MEM
3992 && XEXP (DECL_RTL (decl), 0)
3993 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == SYMBOL_REF)
3994 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl), 0)) = 1;
3997 /* Merge weak status between NEWDECL and OLDDECL. */
4000 merge_weak (tree newdecl, tree olddecl)
4002 if (DECL_WEAK (newdecl) == DECL_WEAK (olddecl))
4005 if (DECL_WEAK (newdecl))
4009 /* NEWDECL is weak, but OLDDECL is not. */
4011 /* If we already output the OLDDECL, we're in trouble; we can't
4012 go back and make it weak. This error cannot caught in
4013 declare_weak because the NEWDECL and OLDDECL was not yet
4014 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4015 if (TREE_ASM_WRITTEN (olddecl))
4016 error ("%Jweak declaration of '%D' must precede definition",
4019 /* If we've already generated rtl referencing OLDDECL, we may
4020 have done so in a way that will not function properly with
4022 else if (TREE_USED (olddecl)
4023 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl)))
4024 warning ("%Jweak declaration of '%D' after first use results "
4025 "in unspecified behavior", newdecl, newdecl);
4029 /* We put the NEWDECL on the weak_decls list at some point.
4030 Replace it with the OLDDECL. */
4031 for (wd = weak_decls; wd; wd = TREE_CHAIN (wd))
4032 if (TREE_VALUE (wd) == newdecl)
4034 TREE_VALUE (wd) = olddecl;
4037 /* We may not find the entry on the list. If NEWDECL is a
4038 weak alias, then we will have already called
4039 globalize_decl to remove the entry; in that case, we do
4040 not need to do anything. */
4043 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4044 mark_weak (olddecl);
4047 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4048 weak. Just update NEWDECL to indicate that it's weak too. */
4049 mark_weak (newdecl);
4052 /* Declare DECL to be a weak symbol. */
4055 declare_weak (tree decl)
4057 if (! TREE_PUBLIC (decl))
4058 error ("%Jweak declaration of '%D' must be public", decl, decl);
4059 else if (TREE_CODE (decl) == FUNCTION_DECL && TREE_ASM_WRITTEN (decl))
4060 error ("%Jweak declaration of '%D' must precede definition", decl, decl);
4061 else if (SUPPORTS_WEAK)
4063 if (! DECL_WEAK (decl))
4064 weak_decls = tree_cons (NULL, decl, weak_decls);
4067 warning ("%Jweak declaration of '%D' not supported", decl, decl);
4072 /* Emit any pending weak declarations. */
4079 for (t = weak_decls; t; t = TREE_CHAIN (t))
4081 tree decl = TREE_VALUE (t);
4082 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4083 const char *const name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4086 if (! TREE_USED (decl))
4089 #ifdef ASM_WEAKEN_DECL
4090 ASM_WEAKEN_DECL (asm_out_file, decl, name, NULL);
4092 #ifdef ASM_WEAKEN_LABEL
4093 ASM_WEAKEN_LABEL (asm_out_file, name);
4095 #ifdef ASM_OUTPUT_WEAK_ALIAS
4096 warning ("only weak aliases are supported in this configuration");
4104 /* Emit the assembly bits to indicate that DECL is globally visible. */
4107 globalize_decl (tree decl)
4109 const char *name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4111 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4112 if (DECL_WEAK (decl))
4116 #ifdef ASM_WEAKEN_DECL
4117 ASM_WEAKEN_DECL (asm_out_file, decl, name, 0);
4119 ASM_WEAKEN_LABEL (asm_out_file, name);
4122 /* Remove this function from the pending weak list so that
4123 we do not emit multiple .weak directives for it. */
4124 for (p = &weak_decls; (t = *p) ; )
4126 if (DECL_ASSEMBLER_NAME (decl) == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
4127 *p = TREE_CHAIN (t);
4129 p = &TREE_CHAIN (t);
4135 (*targetm.asm_out.globalize_label) (asm_out_file, name);
4138 /* Emit an assembler directive to make the symbol for DECL an alias to
4139 the symbol for TARGET. */
4142 assemble_alias (tree decl, tree target ATTRIBUTE_UNUSED)
4146 /* We must force creation of DECL_RTL for debug info generation, even though
4147 we don't use it here. */
4148 make_decl_rtl (decl, NULL);
4150 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4152 #ifdef ASM_OUTPUT_DEF
4153 /* Make name accessible from other files, if appropriate. */
4155 if (TREE_PUBLIC (decl))
4157 globalize_decl (decl);
4158 maybe_assemble_visibility (decl);
4161 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4162 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
4164 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4166 #else /* !ASM_OUTPUT_DEF */
4167 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4168 if (DECL_WEAK (decl))
4171 #ifdef ASM_WEAKEN_DECL
4172 ASM_WEAKEN_DECL (asm_out_file, decl, name, IDENTIFIER_POINTER (target));
4174 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
4176 /* Remove this function from the pending weak list so that
4177 we do not emit multiple .weak directives for it. */
4178 for (p = &weak_decls; (t = *p) ; )
4179 if (DECL_ASSEMBLER_NAME (decl)
4180 == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
4181 *p = TREE_CHAIN (t);
4183 p = &TREE_CHAIN (t);
4186 warning ("only weak aliases are supported in this configuration");
4189 warning ("alias definitions not supported in this configuration; ignored");
4193 TREE_USED (decl) = 1;
4194 TREE_ASM_WRITTEN (decl) = 1;
4195 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl)) = 1;
4198 /* Emit an assembler directive to set symbol for DECL visibility to
4199 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4202 default_assemble_visibility (tree decl, int vis)
4204 static const char * const visibility_types[] = {
4205 NULL, "internal", "hidden", "protected"
4208 const char *name, *type;
4210 name = (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
4211 type = visibility_types[vis];
4213 #ifdef HAVE_GAS_HIDDEN
4214 fprintf (asm_out_file, "\t.%s\t", type);
4215 assemble_name (asm_out_file, name);
4216 fprintf (asm_out_file, "\n");
4218 warning ("visibility attribute not supported in this configuration; ignored");
4222 /* A helper function to call assemble_visibility when needed for a decl. */
4225 maybe_assemble_visibility (tree decl)
4227 enum symbol_visibility vis = DECL_VISIBILITY (decl);
4229 if (vis != VISIBILITY_DEFAULT)
4230 (* targetm.asm_out.visibility) (decl, vis);
4233 /* Returns 1 if the target configuration supports defining public symbols
4234 so that one of them will be chosen at link time instead of generating a
4235 multiply-defined symbol error, whether through the use of weak symbols or
4236 a target-specific mechanism for having duplicates discarded. */
4239 supports_one_only (void)
4241 if (SUPPORTS_ONE_ONLY)
4243 return SUPPORTS_WEAK;
4246 /* Set up DECL as a public symbol that can be defined in multiple
4247 translation units without generating a linker error. */
4250 make_decl_one_only (tree decl)
4252 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL)
4255 TREE_PUBLIC (decl) = 1;
4257 if (TREE_CODE (decl) == VAR_DECL
4258 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
4259 DECL_COMMON (decl) = 1;
4260 else if (SUPPORTS_ONE_ONLY)
4262 #ifdef MAKE_DECL_ONE_ONLY
4263 MAKE_DECL_ONE_ONLY (decl);
4265 DECL_ONE_ONLY (decl) = 1;
4267 else if (SUPPORTS_WEAK)
4268 DECL_WEAK (decl) = 1;
4274 init_varasm_once (void)
4276 in_named_htab = htab_create_ggc (31, in_named_entry_hash,
4277 in_named_entry_eq, NULL);
4278 const_desc_htab = htab_create_ggc (1009, const_desc_hash,
4279 const_desc_eq, NULL);
4281 const_alias_set = new_alias_set ();
4285 decl_tls_model (tree decl)
4287 enum tls_model kind;
4288 tree attr = lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl));
4293 attr = TREE_VALUE (TREE_VALUE (attr));
4294 if (TREE_CODE (attr) != STRING_CST)
4296 if (!strcmp (TREE_STRING_POINTER (attr), "local-exec"))
4297 kind = TLS_MODEL_LOCAL_EXEC;
4298 else if (!strcmp (TREE_STRING_POINTER (attr), "initial-exec"))
4299 kind = TLS_MODEL_INITIAL_EXEC;
4300 else if (!strcmp (TREE_STRING_POINTER (attr), "local-dynamic"))
4301 kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
4302 else if (!strcmp (TREE_STRING_POINTER (attr), "global-dynamic"))
4303 kind = TLS_MODEL_GLOBAL_DYNAMIC;
4309 is_local = (*targetm.binds_local_p) (decl);
4313 kind = TLS_MODEL_LOCAL_EXEC;
4315 kind = TLS_MODEL_INITIAL_EXEC;
4317 /* Local dynamic is inefficient when we're not combining the
4318 parts of the address. */
4319 else if (optimize && is_local)
4320 kind = TLS_MODEL_LOCAL_DYNAMIC;
4322 kind = TLS_MODEL_GLOBAL_DYNAMIC;
4323 if (kind < flag_tls_default)
4324 kind = flag_tls_default;
4329 /* Select a set of attributes for section NAME based on the properties
4330 of DECL and whether or not RELOC indicates that DECL's initializer
4331 might contain runtime relocations.
4333 We make the section read-only and executable for a function decl,
4334 read-only for a const data decl, and writable for a non-const data decl. */
4337 default_section_type_flags (tree decl, const char *name, int reloc)
4339 return default_section_type_flags_1 (decl, name, reloc, flag_pic);
4343 default_section_type_flags_1 (tree decl, const char *name, int reloc,
4348 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
4349 flags = SECTION_CODE;
4350 else if (decl && decl_readonly_section_1 (decl, reloc, shlib))
4353 flags = SECTION_WRITE;
4355 if (decl && DECL_ONE_ONLY (decl))
4356 flags |= SECTION_LINKONCE;
4358 if (decl && TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4359 flags |= SECTION_TLS | SECTION_WRITE;
4361 if (strcmp (name, ".bss") == 0
4362 || strncmp (name, ".bss.", 5) == 0
4363 || strncmp (name, ".gnu.linkonce.b.", 16) == 0
4364 || strcmp (name, ".sbss") == 0
4365 || strncmp (name, ".sbss.", 6) == 0
4366 || strncmp (name, ".gnu.linkonce.sb.", 17) == 0
4367 || strcmp (name, ".tbss") == 0
4368 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4369 flags |= SECTION_BSS;
4371 if (strcmp (name, ".tdata") == 0
4372 || strcmp (name, ".tbss") == 0
4373 || strncmp (name, ".gnu.linkonce.td.", 17) == 0
4374 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4375 flags |= SECTION_TLS;
4377 /* These three sections have special ELF types. They are neither
4378 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4379 want to print a section type (@progbits or @nobits). If someone
4380 is silly enough to emit code or TLS variables to one of these
4381 sections, then don't handle them specially. */
4382 if (!(flags & (SECTION_CODE | SECTION_BSS | SECTION_TLS))
4383 && (strcmp (name, ".init_array") == 0
4384 || strcmp (name, ".fini_array") == 0
4385 || strcmp (name, ".preinit_array") == 0))
4386 flags |= SECTION_NOTYPE;
4391 /* Output assembly to switch to section NAME with attribute FLAGS.
4392 Four variants for common object file formats. */
4395 default_no_named_section (const char *name ATTRIBUTE_UNUSED,
4396 unsigned int flags ATTRIBUTE_UNUSED)
4398 /* Some object formats don't support named sections at all. The
4399 front-end should already have flagged this as an error. */
4404 default_elf_asm_named_section (const char *name, unsigned int flags)
4406 char flagchars[10], *f = flagchars;
4408 if (! named_section_first_declaration (name))
4410 fprintf (asm_out_file, "\t.section\t%s\n", name);
4414 if (!(flags & SECTION_DEBUG))
4416 if (flags & SECTION_WRITE)
4418 if (flags & SECTION_CODE)
4420 if (flags & SECTION_SMALL)
4422 if (flags & SECTION_MERGE)
4424 if (flags & SECTION_STRINGS)
4426 if (flags & SECTION_TLS)
4430 fprintf (asm_out_file, "\t.section\t%s,\"%s\"", name, flagchars);
4432 if (!(flags & SECTION_NOTYPE))
4436 if (flags & SECTION_BSS)
4441 fprintf (asm_out_file, ",@%s", type);
4443 if (flags & SECTION_ENTSIZE)
4444 fprintf (asm_out_file, ",%d", flags & SECTION_ENTSIZE);
4447 putc ('\n', asm_out_file);
4451 default_coff_asm_named_section (const char *name, unsigned int flags)
4453 char flagchars[8], *f = flagchars;
4455 if (flags & SECTION_WRITE)
4457 if (flags & SECTION_CODE)
4461 fprintf (asm_out_file, "\t.section\t%s,\"%s\"\n", name, flagchars);
4465 default_pe_asm_named_section (const char *name, unsigned int flags)
4467 default_coff_asm_named_section (name, flags);
4469 if (flags & SECTION_LINKONCE)
4471 /* Functions may have been compiled at various levels of
4472 optimization so we can't use `same_size' here.
4473 Instead, have the linker pick one. */
4474 fprintf (asm_out_file, "\t.linkonce %s\n",
4475 (flags & SECTION_CODE ? "discard" : "same_size"));
4479 /* The lame default section selector. */
4482 default_select_section (tree decl, int reloc,
4483 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED)
4485 bool readonly = false;
4489 if (decl_readonly_section (decl, reloc))
4492 else if (TREE_CODE (decl) == CONSTRUCTOR)
4494 if (! ((flag_pic && reloc)
4495 || !TREE_READONLY (decl)
4496 || TREE_SIDE_EFFECTS (decl)
4497 || !TREE_CONSTANT (decl)))
4500 else if (TREE_CODE (decl) == STRING_CST)
4501 readonly = !flag_writable_strings;
4502 else if (! (flag_pic && reloc))
4506 readonly_data_section ();
4511 /* A helper function for default_elf_select_section and
4512 default_elf_unique_section. Categorizes the DECL. */
4514 enum section_category
4519 SECCAT_RODATA_MERGE_STR,
4520 SECCAT_RODATA_MERGE_STR_INIT,
4521 SECCAT_RODATA_MERGE_CONST,
4526 /* To optimize loading of shared programs, define following subsections
4528 _REL Contains data that has relocations, so they get grouped
4529 together and dynamic linker will visit fewer pages in memory.
4530 _RO Contains data that is otherwise read-only. This is useful
4531 with prelinking as most relocations won't be dynamically
4532 linked and thus stay read only.
4533 _LOCAL Marks data containing relocations only to local objects.
4534 These relocations will get fully resolved by prelinking. */
4536 SECCAT_DATA_REL_LOCAL,
4538 SECCAT_DATA_REL_RO_LOCAL,
4548 static enum section_category
4549 categorize_decl_for_section (tree, int, int);
4551 static enum section_category
4552 categorize_decl_for_section (tree decl, int reloc, int shlib)
4554 enum section_category ret;
4556 if (TREE_CODE (decl) == FUNCTION_DECL)
4558 else if (TREE_CODE (decl) == STRING_CST)
4560 if (flag_writable_strings)
4563 return SECCAT_RODATA_MERGE_STR;
4565 else if (TREE_CODE (decl) == VAR_DECL)
4567 if (DECL_INITIAL (decl) == NULL
4568 || DECL_INITIAL (decl) == error_mark_node)
4570 else if (! TREE_READONLY (decl)
4571 || TREE_SIDE_EFFECTS (decl)
4572 || ! TREE_CONSTANT (DECL_INITIAL (decl)))
4574 if (shlib && (reloc & 2))
4575 ret = SECCAT_DATA_REL;
4576 else if (shlib && reloc)
4577 ret = SECCAT_DATA_REL_LOCAL;
4581 else if (shlib && (reloc & 2))
4582 ret = SECCAT_DATA_REL_RO;
4583 else if (shlib && reloc)
4584 ret = SECCAT_DATA_REL_RO_LOCAL;
4585 else if (reloc || flag_merge_constants < 2)
4586 /* C and C++ don't allow different variables to share the same
4587 location. -fmerge-all-constants allows even that (at the
4588 expense of not conforming). */
4589 ret = SECCAT_RODATA;
4590 else if (TREE_CODE (DECL_INITIAL (decl)) == STRING_CST)
4591 ret = SECCAT_RODATA_MERGE_STR_INIT;
4593 ret = SECCAT_RODATA_MERGE_CONST;
4595 else if (TREE_CODE (decl) == CONSTRUCTOR)
4597 if ((shlib && reloc)
4598 || TREE_SIDE_EFFECTS (decl)
4599 || ! TREE_CONSTANT (decl))
4602 ret = SECCAT_RODATA;
4605 ret = SECCAT_RODATA;
4607 /* There are no read-only thread-local sections. */
4608 if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4610 if (ret == SECCAT_BSS)
4616 /* If the target uses small data sections, select it. */
4617 else if ((*targetm.in_small_data_p) (decl))
4619 if (ret == SECCAT_BSS)
4621 else if (targetm.have_srodata_section && ret == SECCAT_RODATA)
4622 ret = SECCAT_SRODATA;
4631 decl_readonly_section (tree decl, int reloc)
4633 return decl_readonly_section_1 (decl, reloc, flag_pic);
4637 decl_readonly_section_1 (tree decl, int reloc, int shlib)
4639 switch (categorize_decl_for_section (decl, reloc, shlib))
4642 case SECCAT_RODATA_MERGE_STR:
4643 case SECCAT_RODATA_MERGE_STR_INIT:
4644 case SECCAT_RODATA_MERGE_CONST:
4645 case SECCAT_SRODATA:
4654 /* Select a section based on the above categorization. */
4657 default_elf_select_section (tree decl, int reloc,
4658 unsigned HOST_WIDE_INT align)
4660 default_elf_select_section_1 (decl, reloc, align, flag_pic);
4664 default_elf_select_section_1 (tree decl, int reloc,
4665 unsigned HOST_WIDE_INT align, int shlib)
4667 switch (categorize_decl_for_section (decl, reloc, shlib))
4670 /* We're not supposed to be called on FUNCTION_DECLs. */
4673 readonly_data_section ();
4675 case SECCAT_RODATA_MERGE_STR:
4676 mergeable_string_section (decl, align, 0);
4678 case SECCAT_RODATA_MERGE_STR_INIT:
4679 mergeable_string_section (DECL_INITIAL (decl), align, 0);
4681 case SECCAT_RODATA_MERGE_CONST:
4682 mergeable_constant_section (DECL_MODE (decl), align, 0);
4684 case SECCAT_SRODATA:
4685 named_section (NULL_TREE, ".sdata2", reloc);
4690 case SECCAT_DATA_REL:
4691 named_section (NULL_TREE, ".data.rel", reloc);
4693 case SECCAT_DATA_REL_LOCAL:
4694 named_section (NULL_TREE, ".data.rel.local", reloc);
4696 case SECCAT_DATA_REL_RO:
4697 named_section (NULL_TREE, ".data.rel.ro", reloc);
4699 case SECCAT_DATA_REL_RO_LOCAL:
4700 named_section (NULL_TREE, ".data.rel.ro.local", reloc);
4703 named_section (NULL_TREE, ".sdata", reloc);
4706 named_section (NULL_TREE, ".tdata", reloc);
4709 #ifdef BSS_SECTION_ASM_OP
4712 named_section (NULL_TREE, ".bss", reloc);
4716 named_section (NULL_TREE, ".sbss", reloc);
4719 named_section (NULL_TREE, ".tbss", reloc);
4726 /* Construct a unique section name based on the decl name and the
4727 categorization performed above. */
4730 default_unique_section (tree decl, int reloc)
4732 default_unique_section_1 (decl, reloc, flag_pic);
4736 default_unique_section_1 (tree decl, int reloc, int shlib)
4738 bool one_only = DECL_ONE_ONLY (decl);
4739 const char *prefix, *name;
4743 switch (categorize_decl_for_section (decl, reloc, shlib))
4746 prefix = one_only ? ".gnu.linkonce.t." : ".text.";
4749 case SECCAT_RODATA_MERGE_STR:
4750 case SECCAT_RODATA_MERGE_STR_INIT:
4751 case SECCAT_RODATA_MERGE_CONST:
4752 prefix = one_only ? ".gnu.linkonce.r." : ".rodata.";
4754 case SECCAT_SRODATA:
4755 prefix = one_only ? ".gnu.linkonce.s2." : ".sdata2.";
4758 case SECCAT_DATA_REL:
4759 case SECCAT_DATA_REL_LOCAL:
4760 case SECCAT_DATA_REL_RO:
4761 case SECCAT_DATA_REL_RO_LOCAL:
4762 prefix = one_only ? ".gnu.linkonce.d." : ".data.";
4765 prefix = one_only ? ".gnu.linkonce.s." : ".sdata.";
4768 prefix = one_only ? ".gnu.linkonce.b." : ".bss.";
4771 prefix = one_only ? ".gnu.linkonce.sb." : ".sbss.";
4774 prefix = one_only ? ".gnu.linkonce.td." : ".tdata.";
4777 prefix = one_only ? ".gnu.linkonce.tb." : ".tbss.";
4782 plen = strlen (prefix);
4784 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4785 name = (* targetm.strip_name_encoding) (name);
4786 nlen = strlen (name);
4788 string = alloca (nlen + plen + 1);
4789 memcpy (string, prefix, plen);
4790 memcpy (string + plen, name, nlen + 1);
4792 DECL_SECTION_NAME (decl) = build_string (nlen + plen, string);
4796 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED,
4798 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED)
4801 switch (GET_CODE (x))
4813 readonly_data_section ();
4817 default_elf_select_rtx_section (enum machine_mode mode, rtx x,
4818 unsigned HOST_WIDE_INT align)
4820 /* ??? Handle small data here somehow. */
4823 switch (GET_CODE (x))
4827 named_section (NULL_TREE, ".data.rel.ro", 3);
4831 named_section (NULL_TREE, ".data.rel.ro.local", 1);
4838 mergeable_constant_section (mode, align, 0);
4841 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
4844 default_encode_section_info (tree decl, rtx rtl, int first ATTRIBUTE_UNUSED)
4849 /* Careful not to prod global register variables. */
4850 if (GET_CODE (rtl) != MEM)
4852 symbol = XEXP (rtl, 0);
4853 if (GET_CODE (symbol) != SYMBOL_REF)
4857 if (TREE_CODE (decl) == FUNCTION_DECL)
4858 flags |= SYMBOL_FLAG_FUNCTION;
4859 if ((*targetm.binds_local_p) (decl))
4860 flags |= SYMBOL_FLAG_LOCAL;
4861 if ((*targetm.in_small_data_p) (decl))
4862 flags |= SYMBOL_FLAG_SMALL;
4863 if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4864 flags |= decl_tls_model (decl) << SYMBOL_FLAG_TLS_SHIFT;
4865 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
4866 being PUBLIC, the thing *must* be defined in this translation unit.
4867 Prevent this buglet from being propagated into rtl code as well. */
4868 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
4869 flags |= SYMBOL_FLAG_EXTERNAL;
4871 SYMBOL_REF_FLAGS (symbol) = flags;
4874 /* By default, we do nothing for encode_section_info, so we need not
4875 do anything but discard the '*' marker. */
4878 default_strip_name_encoding (const char *str)
4880 return str + (*str == '*');
4883 /* Assume ELF-ish defaults, since that's pretty much the most liberal
4884 wrt cross-module name binding. */
4887 default_binds_local_p (tree exp)
4889 return default_binds_local_p_1 (exp, flag_shlib);
4893 default_binds_local_p_1 (tree exp, int shlib)
4897 /* A non-decl is an entry in the constant pool. */
4900 /* Static variables are always local. */
4901 else if (! TREE_PUBLIC (exp))
4903 /* A variable is local if the user tells us so. */
4904 else if (DECL_VISIBILITY (exp) != VISIBILITY_DEFAULT)
4906 /* Otherwise, variables defined outside this object may not be local. */
4907 else if (DECL_EXTERNAL (exp))
4909 /* Linkonce and weak data are never local. */
4910 else if (DECL_ONE_ONLY (exp) || DECL_WEAK (exp))
4912 /* If PIC, then assume that any global name can be overridden by
4913 symbols resolved from other modules. */
4916 /* Uninitialized COMMON variable may be unified with symbols
4917 resolved from other modules. */
4918 else if (DECL_COMMON (exp)
4919 && (DECL_INITIAL (exp) == NULL
4920 || DECL_INITIAL (exp) == error_mark_node))
4922 /* Otherwise we're left with initialized (or non-common) global data
4923 which is of necessity defined locally. */
4930 /* Determine whether or not a pointer mode is valid. Assume defaults
4931 of ptr_mode or Pmode - can be overridden. */
4933 default_valid_pointer_mode (enum machine_mode mode)
4935 return (mode == ptr_mode || mode == Pmode);
4938 /* Default function to output code that will globalize a label. A
4939 target must define GLOBAL_ASM_OP or provide it's own function to
4940 globalize a label. */
4941 #ifdef GLOBAL_ASM_OP
4943 default_globalize_label (FILE * stream, const char *name)
4945 fputs (GLOBAL_ASM_OP, stream);
4946 assemble_name (stream, name);
4947 putc ('\n', stream);
4949 #endif /* GLOBAL_ASM_OP */
4951 /* This is how to output an internal numbered label where PREFIX is
4952 the class of label and LABELNO is the number within the class. */
4955 default_internal_label (FILE *stream, const char *prefix,
4956 unsigned long labelno)
4958 char *const buf = alloca (40 + strlen (prefix));
4959 ASM_GENERATE_INTERNAL_LABEL (buf, prefix, labelno);
4960 ASM_OUTPUT_LABEL (stream, buf);
4963 /* This is the default behavior at the beginning of a file. It's
4964 controlled by two other target-hook toggles. */
4966 default_file_start (void)
4968 if (targetm.file_start_app_off && !flag_verbose_asm)
4969 fputs (ASM_APP_OFF, asm_out_file);
4971 if (targetm.file_start_file_directive)
4972 output_file_directive (asm_out_file, main_input_filename);
4975 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
4976 which emits a special section directive used to indicate whether or
4977 not this object file needs an executable stack. This is primarily
4978 a GNU extension to ELF but could be used on other targets. */
4980 file_end_indicate_exec_stack (void)
4982 unsigned int flags = SECTION_DEBUG;
4983 if (trampolines_created)
4984 flags |= SECTION_CODE;
4986 named_section_flags (".note.GNU-stack", flags);
4989 #include "gt-varasm.h"