1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
32 #include "coretypes.h"
39 #include "hard-reg-set.h"
47 #include "langhooks.h"
52 #include "cfglayout.h"
54 #ifdef XCOFF_DEBUGGING_INFO
55 #include "xcoffout.h" /* Needed for external data
56 declarations for e.g. AIX 4.x. */
59 #ifndef TRAMPOLINE_ALIGNMENT
60 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
64 #define ASM_STABS_OP "\t.stabs\t"
67 /* The (assembler) name of the first globally-visible object output. */
68 const char *first_global_object_name;
69 const char *weak_global_object_name;
72 struct constant_descriptor_rtx;
73 struct rtx_constant_pool;
75 struct varasm_status GTY(())
77 /* If we're using a per-function constant pool, this is it. */
78 struct rtx_constant_pool *pool;
80 /* Number of tree-constants deferred during the expansion of this
82 unsigned int deferred_constants;
85 #define n_deferred_constants (cfun->varasm->deferred_constants)
87 /* Number for making the label on the next
88 constant that is stored in memory. */
90 static GTY(()) int const_labelno;
92 /* Carry information from ASM_DECLARE_OBJECT_NAME
93 to ASM_FINISH_DECLARE_OBJECT. */
95 int size_directive_output;
97 /* The last decl for which assemble_variable was called,
98 if it did ASM_DECLARE_OBJECT_NAME.
99 If the last call to assemble_variable didn't do that,
102 tree last_assemble_variable_decl;
104 /* The following global variable indicates if the section label for the
105 "cold" section of code has been output yet to the assembler. The
106 label is useful when running gdb. This is part of the optimization that
107 partitions hot and cold basic blocks into separate sections of the .o
110 bool unlikely_section_label_printed = false;
112 /* RTX_UNCHANGING_P in a MEM can mean it is stored into, for initialization.
113 So giving constant the alias set for the type will allow such
114 initializations to appear to conflict with the load of the constant. We
115 avoid this by giving all constants an alias set for just constants.
116 Since there will be no stores to that alias set, nothing will ever
117 conflict with them. */
119 static HOST_WIDE_INT const_alias_set;
121 static const char *strip_reg_name (const char *);
122 static int contains_pointers_p (tree);
123 #ifdef ASM_OUTPUT_EXTERNAL
124 static bool incorporeal_function_p (tree);
126 static void decode_addr_const (tree, struct addr_const *);
127 static hashval_t const_desc_hash (const void *);
128 static int const_desc_eq (const void *, const void *);
129 static hashval_t const_hash_1 (const tree);
130 static int compare_constant (const tree, const tree);
131 static tree copy_constant (tree);
132 static void output_constant_def_contents (rtx);
133 static void output_addressed_constants (tree);
134 static unsigned HOST_WIDE_INT array_size_for_constructor (tree);
135 static unsigned min_align (unsigned, unsigned);
136 static void output_constructor (tree, unsigned HOST_WIDE_INT, unsigned int);
137 static void globalize_decl (tree);
138 static void maybe_assemble_visibility (tree);
139 static int in_named_entry_eq (const void *, const void *);
140 static hashval_t in_named_entry_hash (const void *);
141 #ifdef ASM_OUTPUT_BSS
142 static void asm_output_bss (FILE *, tree, const char *,
143 unsigned HOST_WIDE_INT, unsigned HOST_WIDE_INT);
145 #ifdef BSS_SECTION_ASM_OP
146 #ifdef ASM_OUTPUT_ALIGNED_BSS
147 static void asm_output_aligned_bss (FILE *, tree, const char *,
148 unsigned HOST_WIDE_INT, int)
151 #endif /* BSS_SECTION_ASM_OP */
152 static bool asm_emit_uninitialised (tree, const char*,
153 unsigned HOST_WIDE_INT,
154 unsigned HOST_WIDE_INT);
155 static void mark_weak (tree);
157 enum in_section { no_section, in_text, in_unlikely_executed_text, in_data,
159 #ifdef BSS_SECTION_ASM_OP
162 #ifdef CTORS_SECTION_ASM_OP
165 #ifdef DTORS_SECTION_ASM_OP
168 #ifdef READONLY_DATA_SECTION_ASM_OP
171 #ifdef EXTRA_SECTIONS
175 static GTY(()) enum in_section in_section = no_section;
177 /* Return a nonzero value if DECL has a section attribute. */
178 #ifndef IN_NAMED_SECTION
179 #define IN_NAMED_SECTION(DECL) \
180 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
181 && DECL_SECTION_NAME (DECL) != NULL_TREE)
184 /* Text of section name when in_section == in_named. */
185 static GTY(()) const char *in_named_name;
187 /* Hash table of flags that have been used for a particular named section. */
189 struct in_named_entry GTY(())
196 static GTY((param_is (struct in_named_entry))) htab_t in_named_htab;
198 /* Define functions like text_section for any extra sections. */
199 #ifdef EXTRA_SECTION_FUNCTIONS
200 EXTRA_SECTION_FUNCTIONS
203 /* Tell assembler to switch to text section. */
208 if (in_section != in_text)
210 in_section = in_text;
211 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
212 ASM_OUTPUT_ALIGN (asm_out_file, 2);
216 /* Tell assembler to switch to unlikely-to-be-executed text section. */
219 unlikely_text_section (void)
221 if ((in_section != in_unlikely_executed_text)
222 && (in_section != in_named
223 || strcmp (in_named_name, UNLIKELY_EXECUTED_TEXT_SECTION_NAME) != 0))
225 if (targetm.have_named_sections)
226 named_section (NULL_TREE, UNLIKELY_EXECUTED_TEXT_SECTION_NAME, 0);
229 in_section = in_unlikely_executed_text;
230 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
233 if (!unlikely_section_label_printed)
235 fprintf (asm_out_file, "__%s_unlikely_section:\n",
236 current_function_name ());
237 unlikely_section_label_printed = true;
239 /* Make sure that we have appropriate alignment for instructions
241 assemble_align (FUNCTION_BOUNDARY);
246 /* Tell assembler to switch to data section. */
251 if (in_section != in_data)
253 in_section = in_data;
254 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
258 /* Tell assembler to switch to read-only data section. This is normally
262 readonly_data_section (void)
264 #ifdef READONLY_DATA_SECTION
265 READONLY_DATA_SECTION (); /* Note this can call data_section. */
267 #ifdef READONLY_DATA_SECTION_ASM_OP
268 if (in_section != in_readonly_data)
270 in_section = in_readonly_data;
271 fputs (READONLY_DATA_SECTION_ASM_OP, asm_out_file);
272 fputc ('\n', asm_out_file);
280 /* Determine if we're in the text section. */
283 in_text_section (void)
285 return in_section == in_text;
288 /* Determine if we're in the unlikely-to-be-executed text section. */
291 in_unlikely_text_section (void)
293 return in_section == in_unlikely_executed_text;
296 /* Determine if we're in the data section. */
299 in_data_section (void)
301 return in_section == in_data;
304 /* Helper routines for maintaining in_named_htab. */
307 in_named_entry_eq (const void *p1, const void *p2)
309 const struct in_named_entry *old = p1;
310 const char *new = p2;
312 return strcmp (old->name, new) == 0;
316 in_named_entry_hash (const void *p)
318 const struct in_named_entry *old = p;
319 return htab_hash_string (old->name);
322 /* If SECTION has been seen before as a named section, return the flags
323 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
324 set of flags for a section to have, so 0 does not mean that the section
325 has not been seen. */
328 get_named_section_flags (const char *section)
330 struct in_named_entry **slot;
332 slot = (struct in_named_entry **)
333 htab_find_slot_with_hash (in_named_htab, section,
334 htab_hash_string (section), NO_INSERT);
336 return slot ? (*slot)->flags : 0;
339 /* Returns true if the section has been declared before. Sets internal
340 flag on this section in in_named_hash so subsequent calls on this
341 section will return false. */
344 named_section_first_declaration (const char *name)
346 struct in_named_entry **slot;
348 slot = (struct in_named_entry **)
349 htab_find_slot_with_hash (in_named_htab, name,
350 htab_hash_string (name), NO_INSERT);
351 if (! (*slot)->declared)
353 (*slot)->declared = true;
363 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
364 different set of flags, return false. */
367 set_named_section_flags (const char *section, unsigned int flags)
369 struct in_named_entry **slot, *entry;
371 slot = (struct in_named_entry **)
372 htab_find_slot_with_hash (in_named_htab, section,
373 htab_hash_string (section), INSERT);
378 entry = ggc_alloc (sizeof (*entry));
380 entry->name = ggc_strdup (section);
381 entry->flags = flags;
382 entry->declared = false;
384 else if (entry->flags != flags)
390 /* Tell assembler to change to section NAME with attributes FLAGS. */
393 named_section_flags (const char *name, unsigned int flags)
395 if (in_section != in_named || strcmp (name, in_named_name) != 0)
397 if (! set_named_section_flags (name, flags))
400 targetm.asm_out.named_section (name, flags);
402 if (flags & SECTION_FORGET)
403 in_section = no_section;
406 in_named_name = ggc_strdup (name);
407 in_section = in_named;
412 /* Tell assembler to change to section NAME for DECL.
413 If DECL is NULL, just switch to section NAME.
414 If NAME is NULL, get the name from DECL.
415 If RELOC is 1, the initializer for DECL contains relocs. */
418 named_section (tree decl, const char *name, int reloc)
422 if (decl != NULL_TREE && !DECL_P (decl))
425 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
427 flags = targetm.section_type_flags (decl, name, reloc);
429 /* Sanity check user variables for flag changes. Non-user
430 section flag changes will abort in named_section_flags.
431 However, don't complain if SECTION_OVERRIDE is set.
432 We trust that the setter knows that it is safe to ignore
433 the default flags for this decl. */
434 if (decl && ! set_named_section_flags (name, flags))
436 flags = get_named_section_flags (name);
437 if ((flags & SECTION_OVERRIDE) == 0)
438 error ("%J%D causes a section type conflict", decl, decl);
441 named_section_flags (name, flags);
444 /* If required, set DECL_SECTION_NAME to a unique name. */
447 resolve_unique_section (tree decl, int reloc ATTRIBUTE_UNUSED,
448 int flag_function_or_data_sections)
450 if (DECL_SECTION_NAME (decl) == NULL_TREE
451 && targetm.have_named_sections
452 && (flag_function_or_data_sections
453 || DECL_ONE_ONLY (decl)))
454 targetm.asm_out.unique_section (decl, reloc);
457 #ifdef BSS_SECTION_ASM_OP
459 /* Tell the assembler to switch to the bss section. */
464 if (in_section != in_bss)
466 fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP);
471 #ifdef ASM_OUTPUT_BSS
473 /* Utility function for ASM_OUTPUT_BSS for targets to use if
474 they don't support alignments in .bss.
475 ??? It is believed that this function will work in most cases so such
476 support is localized here. */
479 asm_output_bss (FILE *file, tree decl ATTRIBUTE_UNUSED,
481 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
482 unsigned HOST_WIDE_INT rounded)
484 targetm.asm_out.globalize_label (file, name);
486 #ifdef ASM_DECLARE_OBJECT_NAME
487 last_assemble_variable_decl = decl;
488 ASM_DECLARE_OBJECT_NAME (file, name, decl);
490 /* Standard thing is just output label for the object. */
491 ASM_OUTPUT_LABEL (file, name);
492 #endif /* ASM_DECLARE_OBJECT_NAME */
493 ASM_OUTPUT_SKIP (file, rounded ? rounded : 1);
498 #ifdef ASM_OUTPUT_ALIGNED_BSS
500 /* Utility function for targets to use in implementing
501 ASM_OUTPUT_ALIGNED_BSS.
502 ??? It is believed that this function will work in most cases so such
503 support is localized here. */
506 asm_output_aligned_bss (FILE *file, tree decl ATTRIBUTE_UNUSED,
507 const char *name, unsigned HOST_WIDE_INT size,
511 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
512 #ifdef ASM_DECLARE_OBJECT_NAME
513 last_assemble_variable_decl = decl;
514 ASM_DECLARE_OBJECT_NAME (file, name, decl);
516 /* Standard thing is just output label for the object. */
517 ASM_OUTPUT_LABEL (file, name);
518 #endif /* ASM_DECLARE_OBJECT_NAME */
519 ASM_OUTPUT_SKIP (file, size ? size : 1);
524 #endif /* BSS_SECTION_ASM_OP */
526 /* Switch to the section for function DECL.
528 If DECL is NULL_TREE, switch to the text section.
529 ??? It's not clear that we will ever be passed NULL_TREE, but it's
530 safer to handle it. */
533 function_section (tree decl)
535 if (scan_ahead_for_unlikely_executed_note (get_insns()))
536 unlikely_text_section ();
539 if (decl != NULL_TREE
540 && DECL_SECTION_NAME (decl) != NULL_TREE)
541 named_section (decl, (char *) 0, 0);
547 /* Switch to section for variable DECL. RELOC is the same as the
548 argument to SELECT_SECTION. */
551 variable_section (tree decl, int reloc)
553 if (IN_NAMED_SECTION (decl))
554 named_section (decl, NULL, reloc);
556 targetm.asm_out.select_section (decl, reloc, DECL_ALIGN (decl));
559 /* Tell assembler to switch to the section for string merging. */
562 mergeable_string_section (tree decl ATTRIBUTE_UNUSED,
563 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED,
564 unsigned int flags ATTRIBUTE_UNUSED)
566 if (HAVE_GAS_SHF_MERGE && flag_merge_constants
567 && TREE_CODE (decl) == STRING_CST
568 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
570 && TREE_STRING_LENGTH (decl) >= int_size_in_bytes (TREE_TYPE (decl)))
572 enum machine_mode mode;
573 unsigned int modesize;
578 mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (decl)));
579 modesize = GET_MODE_BITSIZE (mode);
580 if (modesize >= 8 && modesize <= 256
581 && (modesize & (modesize - 1)) == 0)
583 if (align < modesize)
586 str = TREE_STRING_POINTER (decl);
587 len = TREE_STRING_LENGTH (decl);
588 unit = GET_MODE_SIZE (mode);
590 /* Check for embedded NUL characters. */
591 for (i = 0; i < len; i += unit)
593 for (j = 0; j < unit; j++)
594 if (str[i + j] != '\0')
601 sprintf (name, ".rodata.str%d.%d", modesize / 8,
603 flags |= (modesize / 8) | SECTION_MERGE | SECTION_STRINGS;
604 if (!i && modesize < align)
606 /* A "" string with requested alignment greater than
607 character size might cause a problem:
608 if some other string required even bigger
609 alignment than "", then linker might think the
610 "" is just part of padding after some other string
611 and not put it into the hash table initially.
612 But this means "" could have smaller alignment
614 #ifdef ASM_OUTPUT_SECTION_START
615 named_section_flags (name, flags);
616 ASM_OUTPUT_SECTION_START (asm_out_file);
618 readonly_data_section ();
623 named_section_flags (name, flags);
629 readonly_data_section ();
632 /* Tell assembler to switch to the section for constant merging. */
635 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED,
636 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED,
637 unsigned int flags ATTRIBUTE_UNUSED)
639 unsigned int modesize = GET_MODE_BITSIZE (mode);
641 if (HAVE_GAS_SHF_MERGE && flag_merge_constants
647 && (align & (align - 1)) == 0)
651 sprintf (name, ".rodata.cst%d", (int) (align / 8));
652 flags |= (align / 8) | SECTION_MERGE;
653 named_section_flags (name, flags);
657 readonly_data_section ();
660 /* Given NAME, a putative register name, discard any customary prefixes. */
663 strip_reg_name (const char *name)
665 #ifdef REGISTER_PREFIX
666 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
667 name += strlen (REGISTER_PREFIX);
669 if (name[0] == '%' || name[0] == '#')
674 /* Decode an `asm' spec for a declaration as a register name.
675 Return the register number, or -1 if nothing specified,
676 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
677 or -3 if ASMSPEC is `cc' and is not recognized,
678 or -4 if ASMSPEC is `memory' and is not recognized.
679 Accept an exact spelling or a decimal number.
680 Prefixes such as % are optional. */
683 decode_reg_name (const char *asmspec)
689 /* Get rid of confusing prefixes. */
690 asmspec = strip_reg_name (asmspec);
692 /* Allow a decimal number as a "register name". */
693 for (i = strlen (asmspec) - 1; i >= 0; i--)
694 if (! ISDIGIT (asmspec[i]))
696 if (asmspec[0] != 0 && i < 0)
699 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
705 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
707 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
710 #ifdef ADDITIONAL_REGISTER_NAMES
712 static const struct { const char *const name; const int number; } table[]
713 = ADDITIONAL_REGISTER_NAMES;
715 for (i = 0; i < (int) ARRAY_SIZE (table); i++)
716 if (! strcmp (asmspec, table[i].name))
717 return table[i].number;
719 #endif /* ADDITIONAL_REGISTER_NAMES */
721 if (!strcmp (asmspec, "memory"))
724 if (!strcmp (asmspec, "cc"))
733 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
734 have static storage duration. In other words, it should not be an
735 automatic variable, including PARM_DECLs.
737 There is, however, one exception: this function handles variables
738 explicitly placed in a particular register by the user.
740 ASMSPEC, if not 0, is the string which the user specified as the
741 assembler symbol name.
743 This is never called for PARM_DECL nodes. */
746 make_decl_rtl (tree decl, const char *asmspec)
748 const char *name = 0;
752 /* Check that we are not being given an automatic variable. */
753 /* A weak alias has TREE_PUBLIC set but not the other bits. */
754 if (TREE_CODE (decl) == PARM_DECL
755 || TREE_CODE (decl) == RESULT_DECL
756 || (TREE_CODE (decl) == VAR_DECL
757 && !TREE_STATIC (decl)
758 && !TREE_PUBLIC (decl)
759 && !DECL_EXTERNAL (decl)
760 && !DECL_REGISTER (decl)))
762 /* And that we were not given a type or a label. */
763 else if (TREE_CODE (decl) == TYPE_DECL
764 || TREE_CODE (decl) == LABEL_DECL)
767 /* For a duplicate declaration, we can be called twice on the
768 same DECL node. Don't discard the RTL already made. */
769 if (DECL_RTL_SET_P (decl))
771 /* If the old RTL had the wrong mode, fix the mode. */
772 if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
773 SET_DECL_RTL (decl, adjust_address_nv (DECL_RTL (decl),
774 DECL_MODE (decl), 0));
776 /* ??? Another way to do this would be to maintain a hashed
777 table of such critters. Instead of adding stuff to a DECL
778 to give certain attributes to it, we could use an external
779 hash map from DECL to set of attributes. */
781 /* Let the target reassign the RTL if it wants.
782 This is necessary, for example, when one machine specific
783 decl attribute overrides another. */
784 targetm.encode_section_info (decl, DECL_RTL (decl), false);
788 reg_number = decode_reg_name (asmspec);
789 if (reg_number == -2)
791 /* ASMSPEC is given, and not the name of a register. Mark the
792 name with a star so assemble_name won't munge it. */
793 char *starred = alloca (strlen (asmspec) + 2);
795 strcpy (starred + 1, asmspec);
796 change_decl_assembler_name (decl, get_identifier (starred));
799 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
801 if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
803 /* First detect errors in declaring global registers. */
804 if (reg_number == -1)
805 error ("%Jregister name not specified for '%D'", decl, decl);
806 else if (reg_number < 0)
807 error ("%Jinvalid register name for '%D'", decl, decl);
808 else if (TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
809 error ("%Jdata type of '%D' isn't suitable for a register",
811 else if (! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl))))
812 error ("%Jregister specified for '%D' isn't suitable for data type",
814 /* Now handle properly declared static register variables. */
819 if (DECL_INITIAL (decl) != 0 && TREE_STATIC (decl))
821 DECL_INITIAL (decl) = 0;
822 error ("global register variable has initial value");
824 if (TREE_THIS_VOLATILE (decl))
825 warning ("volatile register variables don't work as you might wish");
827 /* If the user specified one of the eliminables registers here,
828 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
829 confused with that register and be eliminated. This usage is
830 somewhat suspect... */
832 SET_DECL_RTL (decl, gen_rtx_raw_REG (DECL_MODE (decl), reg_number));
833 ORIGINAL_REGNO (DECL_RTL (decl)) = reg_number;
834 REG_USERVAR_P (DECL_RTL (decl)) = 1;
836 if (TREE_STATIC (decl))
838 /* Make this register global, so not usable for anything
840 #ifdef ASM_DECLARE_REGISTER_GLOBAL
841 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name);
843 nregs = hard_regno_nregs[reg_number][DECL_MODE (decl)];
845 globalize_reg (reg_number + --nregs);
848 /* As a register variable, it has no section. */
853 /* Now handle ordinary static variables and functions (in memory).
854 Also handle vars declared register invalidly. */
856 if (reg_number >= 0 || reg_number == -3)
857 error ("%Jregister name given for non-register variable '%D'", decl, decl);
859 /* Specifying a section attribute on a variable forces it into a
860 non-.bss section, and thus it cannot be common. */
861 if (TREE_CODE (decl) == VAR_DECL
862 && DECL_SECTION_NAME (decl) != NULL_TREE
863 && DECL_INITIAL (decl) == NULL_TREE
864 && DECL_COMMON (decl))
865 DECL_COMMON (decl) = 0;
867 /* Variables can't be both common and weak. */
868 if (TREE_CODE (decl) == VAR_DECL && DECL_WEAK (decl))
869 DECL_COMMON (decl) = 0;
871 x = gen_rtx_SYMBOL_REF (Pmode, name);
872 SYMBOL_REF_WEAK (x) = DECL_WEAK (decl);
873 SYMBOL_REF_DECL (x) = decl;
875 x = gen_rtx_MEM (DECL_MODE (decl), x);
876 if (TREE_CODE (decl) != FUNCTION_DECL)
877 set_mem_attributes (x, decl, 1);
878 SET_DECL_RTL (decl, x);
880 /* Optionally set flags or add text to the name to record information
881 such as that it is a function name.
882 If the name is changed, the macro ASM_OUTPUT_LABELREF
883 will have to know how to strip this information. */
884 targetm.encode_section_info (decl, DECL_RTL (decl), true);
887 /* Make the rtl for variable VAR be volatile.
888 Use this only for static variables. */
891 make_var_volatile (tree var)
893 if (GET_CODE (DECL_RTL (var)) != MEM)
896 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
899 /* Output a string of literal assembler code
900 for an `asm' keyword used between functions. */
903 assemble_asm (tree string)
907 if (TREE_CODE (string) == ADDR_EXPR)
908 string = TREE_OPERAND (string, 0);
910 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
913 /* Record an element in the table of global destructors. SYMBOL is
914 a SYMBOL_REF of the function to be called; PRIORITY is a number
915 between 0 and MAX_INIT_PRIORITY. */
918 default_stabs_asm_out_destructor (rtx symbol, int priority ATTRIBUTE_UNUSED)
920 /* Tell GNU LD that this is part of the static destructor set.
921 This will work for any system that uses stabs, most usefully
923 fprintf (asm_out_file, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
924 assemble_name (asm_out_file, XSTR (symbol, 0));
925 fputc ('\n', asm_out_file);
929 default_named_section_asm_out_destructor (rtx symbol, int priority)
931 const char *section = ".dtors";
934 /* ??? This only works reliably with the GNU linker. */
935 if (priority != DEFAULT_INIT_PRIORITY)
937 sprintf (buf, ".dtors.%.5u",
938 /* Invert the numbering so the linker puts us in the proper
939 order; constructors are run from right to left, and the
940 linker sorts in increasing order. */
941 MAX_INIT_PRIORITY - priority);
945 named_section_flags (section, SECTION_WRITE);
946 assemble_align (POINTER_SIZE);
947 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
950 #ifdef DTORS_SECTION_ASM_OP
954 if (in_section != in_dtors)
956 in_section = in_dtors;
957 fputs (DTORS_SECTION_ASM_OP, asm_out_file);
958 fputc ('\n', asm_out_file);
963 default_dtor_section_asm_out_destructor (rtx symbol,
964 int priority ATTRIBUTE_UNUSED)
967 assemble_align (POINTER_SIZE);
968 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
972 /* Likewise for global constructors. */
975 default_stabs_asm_out_constructor (rtx symbol, int priority ATTRIBUTE_UNUSED)
977 /* Tell GNU LD that this is part of the static destructor set.
978 This will work for any system that uses stabs, most usefully
980 fprintf (asm_out_file, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
981 assemble_name (asm_out_file, XSTR (symbol, 0));
982 fputc ('\n', asm_out_file);
986 default_named_section_asm_out_constructor (rtx symbol, int priority)
988 const char *section = ".ctors";
991 /* ??? This only works reliably with the GNU linker. */
992 if (priority != DEFAULT_INIT_PRIORITY)
994 sprintf (buf, ".ctors.%.5u",
995 /* Invert the numbering so the linker puts us in the proper
996 order; constructors are run from right to left, and the
997 linker sorts in increasing order. */
998 MAX_INIT_PRIORITY - priority);
1002 named_section_flags (section, SECTION_WRITE);
1003 assemble_align (POINTER_SIZE);
1004 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1007 #ifdef CTORS_SECTION_ASM_OP
1009 ctors_section (void)
1011 if (in_section != in_ctors)
1013 in_section = in_ctors;
1014 fputs (CTORS_SECTION_ASM_OP, asm_out_file);
1015 fputc ('\n', asm_out_file);
1020 default_ctor_section_asm_out_constructor (rtx symbol,
1021 int priority ATTRIBUTE_UNUSED)
1024 assemble_align (POINTER_SIZE);
1025 assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
1029 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1030 a nonzero value if the constant pool should be output before the
1031 start of the function, or a zero value if the pool should output
1032 after the end of the function. The default is to put it before the
1035 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1036 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1039 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
1040 to be output to assembler.
1041 Set first_global_object_name and weak_global_object_name as appropriate. */
1044 notice_global_symbol (tree decl)
1046 const char **type = &first_global_object_name;
1048 if (first_global_object_name
1049 || !TREE_PUBLIC (decl) || DECL_EXTERNAL (decl)
1050 || !DECL_NAME (decl)
1051 || (TREE_CODE (decl) != FUNCTION_DECL
1052 && (TREE_CODE (decl) != VAR_DECL
1053 || (DECL_COMMON (decl)
1054 && (DECL_INITIAL (decl) == 0
1055 || DECL_INITIAL (decl) == error_mark_node))))
1056 || GET_CODE (DECL_RTL (decl)) != MEM)
1059 /* We win when global object is found, but it is useful to know about weak
1060 symbol as well so we can produce nicer unique names. */
1061 if (DECL_WEAK (decl) || DECL_ONE_ONLY (decl))
1062 type = &weak_global_object_name;
1068 rtx decl_rtl = DECL_RTL (decl);
1070 p = targetm.strip_name_encoding (XSTR (XEXP (decl_rtl, 0), 0));
1077 /* Output assembler code for the constant pool of a function and associated
1078 with defining the name of the function. DECL describes the function.
1079 NAME is the function's name. For the constant pool, we use the current
1080 constant pool data. */
1083 assemble_start_function (tree decl, const char *fnname)
1087 unlikely_section_label_printed = false;
1089 /* The following code does not need preprocessing in the assembler. */
1093 if (CONSTANT_POOL_BEFORE_FUNCTION)
1094 output_constant_pool (fnname, decl);
1096 resolve_unique_section (decl, 0, flag_function_sections);
1097 function_section (decl);
1099 /* Tell assembler to move to target machine's alignment for functions. */
1100 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1101 if (align < force_align_functions_log)
1102 align = force_align_functions_log;
1105 ASM_OUTPUT_ALIGN (asm_out_file, align);
1108 /* Handle a user-specified function alignment.
1109 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1110 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1111 if (align_functions_log > align
1112 && cfun->function_frequency != FUNCTION_FREQUENCY_UNLIKELY_EXECUTED)
1114 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1115 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file,
1116 align_functions_log, align_functions - 1);
1118 ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
1122 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1123 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
1126 (*debug_hooks->begin_function) (decl);
1128 /* Make function name accessible from other files, if appropriate. */
1130 if (TREE_PUBLIC (decl))
1132 notice_global_symbol (decl);
1134 globalize_decl (decl);
1136 maybe_assemble_visibility (decl);
1139 /* Do any machine/system dependent processing of the function name. */
1140 #ifdef ASM_DECLARE_FUNCTION_NAME
1141 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
1143 /* Standard thing is just output label for the function. */
1144 ASM_OUTPUT_LABEL (asm_out_file, fnname);
1145 #endif /* ASM_DECLARE_FUNCTION_NAME */
1148 /* Output assembler code associated with defining the size of the
1149 function. DECL describes the function. NAME is the function's name. */
1152 assemble_end_function (tree decl, const char *fnname)
1154 #ifdef ASM_DECLARE_FUNCTION_SIZE
1155 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
1157 if (! CONSTANT_POOL_BEFORE_FUNCTION)
1159 output_constant_pool (fnname, decl);
1160 function_section (decl); /* need to switch back */
1164 /* Assemble code to leave SIZE bytes of zeros. */
1167 assemble_zeros (unsigned HOST_WIDE_INT size)
1169 /* Do no output if -fsyntax-only. */
1170 if (flag_syntax_only)
1173 #ifdef ASM_NO_SKIP_IN_TEXT
1174 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1175 so we must output 0s explicitly in the text section. */
1176 if ((ASM_NO_SKIP_IN_TEXT && in_text_section ())
1177 || (ASM_NO_SKIP_IN_TEXT && in_unlikely_text_section ()))
1179 unsigned HOST_WIDE_INT i;
1180 for (i = 0; i < size; i++)
1181 assemble_integer (const0_rtx, 1, BITS_PER_UNIT, 1);
1186 ASM_OUTPUT_SKIP (asm_out_file, size);
1189 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1192 assemble_align (int align)
1194 if (align > BITS_PER_UNIT)
1196 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1200 /* Assemble a string constant with the specified C string as contents. */
1203 assemble_string (const char *p, int size)
1208 /* If the string is very long, split it up. */
1212 int thissize = size - pos;
1213 if (thissize > maximum)
1216 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
1224 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1225 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1226 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1228 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1229 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1230 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1232 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1233 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1237 #if defined ASM_OUTPUT_ALIGNED_BSS
1238 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1239 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1241 #if defined ASM_OUTPUT_BSS
1242 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1243 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1249 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1250 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1251 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1253 #if defined ASM_OUTPUT_ALIGNED_COMMON
1254 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1255 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1257 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1258 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1263 asm_emit_uninitialised (tree decl, const char *name,
1264 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
1265 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED)
1273 destination = asm_dest_local;
1275 /* ??? We should handle .bss via select_section mechanisms rather than
1276 via special target hooks. That would eliminate this special case. */
1277 if (TREE_PUBLIC (decl))
1279 if (!DECL_COMMON (decl))
1281 destination = asm_dest_bss;
1286 destination = asm_dest_common;
1289 if (destination == asm_dest_bss)
1290 globalize_decl (decl);
1291 resolve_unique_section (decl, 0, flag_data_sections);
1293 if (flag_shared_data)
1295 switch (destination)
1297 #ifdef ASM_OUTPUT_SHARED_BSS
1299 ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded);
1302 #ifdef ASM_OUTPUT_SHARED_COMMON
1303 case asm_dest_common:
1304 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1307 #ifdef ASM_OUTPUT_SHARED_LOCAL
1308 case asm_dest_local:
1309 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1317 switch (destination)
1321 ASM_EMIT_BSS (decl, name, size, rounded);
1324 case asm_dest_common:
1325 ASM_EMIT_COMMON (decl, name, size, rounded);
1327 case asm_dest_local:
1328 ASM_EMIT_LOCAL (decl, name, size, rounded);
1337 /* Assemble everything that is needed for a variable or function declaration.
1338 Not used for automatic variables, and not used for function definitions.
1339 Should not be called for variables of incomplete structure type.
1341 TOP_LEVEL is nonzero if this variable has file scope.
1342 AT_END is nonzero if this is the special handling, at end of compilation,
1343 to define things that have had only tentative definitions.
1344 DONT_OUTPUT_DATA if nonzero means don't actually output the
1345 initial value (that will be done by the caller). */
1348 assemble_variable (tree decl, int top_level ATTRIBUTE_UNUSED,
1349 int at_end ATTRIBUTE_UNUSED, int dont_output_data)
1356 if (lang_hooks.decls.prepare_assemble_variable)
1357 lang_hooks.decls.prepare_assemble_variable (decl);
1359 last_assemble_variable_decl = 0;
1361 /* Normally no need to say anything here for external references,
1362 since assemble_external is called by the language-specific code
1363 when a declaration is first seen. */
1365 if (DECL_EXTERNAL (decl))
1368 /* Output no assembler code for a function declaration.
1369 Only definitions of functions output anything. */
1371 if (TREE_CODE (decl) == FUNCTION_DECL)
1374 /* Do nothing for global register variables. */
1375 if (DECL_RTL_SET_P (decl) && GET_CODE (DECL_RTL (decl)) == REG)
1377 TREE_ASM_WRITTEN (decl) = 1;
1381 /* If type was incomplete when the variable was declared,
1382 see if it is complete now. */
1384 if (DECL_SIZE (decl) == 0)
1385 layout_decl (decl, 0);
1387 /* Still incomplete => don't allocate it; treat the tentative defn
1388 (which is what it must have been) as an `extern' reference. */
1390 if (!dont_output_data && DECL_SIZE (decl) == 0)
1392 error ("%Jstorage size of `%D' isn't known", decl, decl);
1393 TREE_ASM_WRITTEN (decl) = 1;
1397 /* The first declaration of a variable that comes through this function
1398 decides whether it is global (in C, has external linkage)
1399 or local (in C, has internal linkage). So do nothing more
1400 if this function has already run. */
1402 if (TREE_ASM_WRITTEN (decl))
1405 /* Make sure targetm.encode_section_info is invoked before we set
1407 decl_rtl = DECL_RTL (decl);
1409 TREE_ASM_WRITTEN (decl) = 1;
1411 /* Do no output if -fsyntax-only. */
1412 if (flag_syntax_only)
1417 if (! dont_output_data
1418 && ! host_integerp (DECL_SIZE_UNIT (decl), 1))
1420 error ("%Jsize of variable '%D' is too large", decl, decl);
1424 name = XSTR (XEXP (decl_rtl, 0), 0);
1425 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1426 notice_global_symbol (decl);
1428 /* Compute the alignment of this data. */
1430 align = DECL_ALIGN (decl);
1432 /* In the case for initialing an array whose length isn't specified,
1433 where we have not yet been able to do the layout,
1434 figure out the proper alignment now. */
1435 if (dont_output_data && DECL_SIZE (decl) == 0
1436 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1437 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1439 /* Some object file formats have a maximum alignment which they support.
1440 In particular, a.out format supports a maximum alignment of 4. */
1441 #ifndef MAX_OFILE_ALIGNMENT
1442 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1444 if (align > MAX_OFILE_ALIGNMENT)
1446 warning ("%Jalignment of '%D' is greater than maximum object "
1447 "file alignment. Using %d", decl, decl,
1448 MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
1449 align = MAX_OFILE_ALIGNMENT;
1452 /* On some machines, it is good to increase alignment sometimes. */
1453 if (! DECL_USER_ALIGN (decl))
1455 #ifdef DATA_ALIGNMENT
1456 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1458 #ifdef CONSTANT_ALIGNMENT
1459 if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node)
1460 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1464 /* Reset the alignment in case we have made it tighter, so we can benefit
1465 from it in get_pointer_alignment. */
1466 DECL_ALIGN (decl) = align;
1467 set_mem_align (decl_rtl, align);
1469 if (TREE_PUBLIC (decl))
1470 maybe_assemble_visibility (decl);
1472 /* Output any data that we will need to use the address of. */
1473 if (DECL_INITIAL (decl) == error_mark_node)
1474 reloc = contains_pointers_p (TREE_TYPE (decl)) ? 3 : 0;
1475 else if (DECL_INITIAL (decl))
1477 reloc = compute_reloc_for_constant (DECL_INITIAL (decl));
1478 output_addressed_constants (DECL_INITIAL (decl));
1480 resolve_unique_section (decl, reloc, flag_data_sections);
1482 /* Handle uninitialized definitions. */
1484 /* If the decl has been given an explicit section name, then it
1485 isn't common, and shouldn't be handled as such. */
1486 if (DECL_SECTION_NAME (decl) || dont_output_data)
1488 /* We don't implement common thread-local data at present. */
1489 else if (DECL_THREAD_LOCAL (decl))
1491 if (DECL_COMMON (decl))
1492 sorry ("thread-local COMMON data not implemented");
1494 else if (DECL_INITIAL (decl) == 0
1495 || DECL_INITIAL (decl) == error_mark_node
1496 || (flag_zero_initialized_in_bss
1497 /* Leave constant zeroes in .rodata so they can be shared. */
1498 && !TREE_READONLY (decl)
1499 && initializer_zerop (DECL_INITIAL (decl))))
1501 unsigned HOST_WIDE_INT size = tree_low_cst (DECL_SIZE_UNIT (decl), 1);
1502 unsigned HOST_WIDE_INT rounded = size;
1504 /* Don't allocate zero bytes of common,
1505 since that means "undefined external" in the linker. */
1509 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1510 so that each uninitialized object starts on such a boundary. */
1511 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1512 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1513 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1515 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1516 if ((unsigned HOST_WIDE_INT) DECL_ALIGN (decl) / BITS_PER_UNIT > rounded)
1517 warning ("%Jrequested alignment for '%D' is greater than "
1518 "implemented alignment of %d", decl, decl, rounded);
1521 /* If the target cannot output uninitialized but not common global data
1522 in .bss, then we have to use .data, so fall through. */
1523 if (asm_emit_uninitialised (decl, name, size, rounded))
1527 /* Handle initialized definitions.
1528 Also handle uninitialized global definitions if -fno-common and the
1529 target doesn't support ASM_OUTPUT_BSS. */
1531 /* First make the assembler name(s) global if appropriate. */
1532 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1533 globalize_decl (decl);
1535 /* Switch to the appropriate section. */
1536 variable_section (decl, reloc);
1538 /* dbxout.c needs to know this. */
1539 if (in_text_section () || in_unlikely_text_section ())
1540 DECL_IN_TEXT_SECTION (decl) = 1;
1542 /* Output the alignment of this data. */
1543 if (align > BITS_PER_UNIT)
1545 ASM_OUTPUT_ALIGN (asm_out_file,
1546 floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT));
1549 /* Do any machine/system dependent processing of the object. */
1550 #ifdef ASM_DECLARE_OBJECT_NAME
1551 last_assemble_variable_decl = decl;
1552 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1554 /* Standard thing is just output label for the object. */
1555 ASM_OUTPUT_LABEL (asm_out_file, name);
1556 #endif /* ASM_DECLARE_OBJECT_NAME */
1558 if (!dont_output_data)
1560 if (DECL_INITIAL (decl) && DECL_INITIAL (decl) != error_mark_node)
1561 /* Output the actual data. */
1562 output_constant (DECL_INITIAL (decl),
1563 tree_low_cst (DECL_SIZE_UNIT (decl), 1),
1566 /* Leave space for it. */
1567 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl), 1));
1571 /* Return 1 if type TYPE contains any pointers. */
1574 contains_pointers_p (tree type)
1576 switch (TREE_CODE (type))
1579 case REFERENCE_TYPE:
1580 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1581 so I'll play safe and return 1. */
1587 case QUAL_UNION_TYPE:
1590 /* For a type that has fields, see if the fields have pointers. */
1591 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1592 if (TREE_CODE (fields) == FIELD_DECL
1593 && contains_pointers_p (TREE_TYPE (fields)))
1599 /* An array type contains pointers if its element type does. */
1600 return contains_pointers_p (TREE_TYPE (type));
1607 #ifdef ASM_OUTPUT_EXTERNAL
1608 /* True if DECL is a function decl for which no out-of-line copy exists.
1609 It is assumed that DECL's assembler name has been set. */
1612 incorporeal_function_p (tree decl)
1614 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_BUILT_IN (decl))
1618 if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
1619 && DECL_FUNCTION_CODE (decl) == BUILT_IN_ALLOCA)
1622 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
1623 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
1630 /* Output something to declare an external symbol to the assembler.
1631 (Most assemblers don't need this, so we normally output nothing.)
1632 Do nothing if DECL is not external. */
1635 assemble_external (tree decl ATTRIBUTE_UNUSED)
1637 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1638 main body of this code is only rarely exercised. To provide some
1639 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1640 open. If it's not, we should not be calling this function. */
1644 #ifdef ASM_OUTPUT_EXTERNAL
1645 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1647 rtx rtl = DECL_RTL (decl);
1649 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1650 && !SYMBOL_REF_USED (XEXP (rtl, 0))
1651 && !incorporeal_function_p (decl))
1653 /* Some systems do require some output. */
1654 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1655 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1661 /* Similar, for calling a library function FUN. */
1664 assemble_external_libcall (rtx fun)
1666 /* Declare library function name external when first used, if nec. */
1667 if (! SYMBOL_REF_USED (fun))
1669 SYMBOL_REF_USED (fun) = 1;
1670 targetm.asm_out.external_libcall (fun);
1674 /* Assemble a label named NAME. */
1677 assemble_label (const char *name)
1679 ASM_OUTPUT_LABEL (asm_out_file, name);
1682 /* Set the symbol_referenced flag for ID and notify callgraph code. */
1684 mark_referenced (tree id)
1686 if (!TREE_SYMBOL_REFERENCED (id))
1688 struct cgraph_node *node;
1689 struct cgraph_varpool_node *vnode;
1691 if (!cgraph_global_info_ready)
1693 node = cgraph_node_for_identifier (id);
1695 cgraph_mark_needed_node (node);
1698 vnode = cgraph_varpool_node_for_identifier (id);
1700 cgraph_varpool_mark_needed_node (vnode);
1702 TREE_SYMBOL_REFERENCED (id) = 1;
1705 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1706 If NAME starts with a *, the rest of NAME is output verbatim.
1707 Otherwise NAME is transformed in an implementation-defined way
1708 (usually by the addition of an underscore).
1709 Many macros in the tm file are defined to call this function. */
1712 assemble_name (FILE *file, const char *name)
1714 const char *real_name;
1717 real_name = targetm.strip_name_encoding (name);
1719 id = maybe_get_identifier (real_name);
1721 mark_referenced (id);
1724 fputs (&name[1], file);
1726 ASM_OUTPUT_LABELREF (file, name);
1729 /* Allocate SIZE bytes writable static space with a gensym name
1730 and return an RTX to refer to its address. */
1733 assemble_static_space (unsigned HOST_WIDE_INT size)
1736 const char *namestring;
1740 if (flag_shared_data)
1744 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1746 namestring = ggc_strdup (name);
1748 x = gen_rtx_SYMBOL_REF (Pmode, namestring);
1749 SYMBOL_REF_FLAGS (x) = SYMBOL_FLAG_LOCAL;
1751 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1752 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size,
1755 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1756 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1759 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1760 so that each uninitialized object starts on such a boundary. */
1761 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1762 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1763 = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1764 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1765 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1766 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1773 /* Assemble the static constant template for function entry trampolines.
1774 This is done at most once per compilation.
1775 Returns an RTX for the address of the template. */
1777 #ifdef TRAMPOLINE_TEMPLATE
1779 assemble_trampoline_template (void)
1786 /* By default, put trampoline templates in read-only data section. */
1788 #ifdef TRAMPOLINE_SECTION
1789 TRAMPOLINE_SECTION ();
1791 readonly_data_section ();
1794 /* Write the assembler code to define one. */
1795 align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT);
1798 ASM_OUTPUT_ALIGN (asm_out_file, align);
1801 targetm.asm_out.internal_label (asm_out_file, "LTRAMP", 0);
1802 TRAMPOLINE_TEMPLATE (asm_out_file);
1804 /* Record the rtl to refer to it. */
1805 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1806 name = ggc_strdup (label);
1807 symbol = gen_rtx_SYMBOL_REF (Pmode, name);
1808 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
1814 /* A and B are either alignments or offsets. Return the minimum alignment
1815 that may be assumed after adding the two together. */
1817 static inline unsigned
1818 min_align (unsigned int a, unsigned int b)
1820 return (a | b) & -(a | b);
1823 /* Return the assembler directive for creating a given kind of integer
1824 object. SIZE is the number of bytes in the object and ALIGNED_P
1825 indicates whether it is known to be aligned. Return NULL if the
1826 assembly dialect has no such directive.
1828 The returned string should be printed at the start of a new line and
1829 be followed immediately by the object's initial value. */
1832 integer_asm_op (int size, int aligned_p)
1834 struct asm_int_op *ops;
1837 ops = &targetm.asm_out.aligned_op;
1839 ops = &targetm.asm_out.unaligned_op;
1844 return targetm.asm_out.byte_op;
1858 /* Use directive OP to assemble an integer object X. Print OP at the
1859 start of the line, followed immediately by the value of X. */
1862 assemble_integer_with_op (const char *op, rtx x)
1864 fputs (op, asm_out_file);
1865 output_addr_const (asm_out_file, x);
1866 fputc ('\n', asm_out_file);
1869 /* The default implementation of the asm_out.integer target hook. */
1872 default_assemble_integer (rtx x ATTRIBUTE_UNUSED,
1873 unsigned int size ATTRIBUTE_UNUSED,
1874 int aligned_p ATTRIBUTE_UNUSED)
1876 const char *op = integer_asm_op (size, aligned_p);
1877 return op && (assemble_integer_with_op (op, x), true);
1880 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1881 the alignment of the integer in bits. Return 1 if we were able to output
1882 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1886 assemble_integer (rtx x, unsigned int size, unsigned int align, int force)
1890 aligned_p = (align >= MIN (size * BITS_PER_UNIT, BIGGEST_ALIGNMENT));
1892 /* See if the target hook can handle this kind of object. */
1893 if (targetm.asm_out.integer (x, size, aligned_p))
1896 /* If the object is a multi-byte one, try splitting it up. Split
1897 it into words it if is multi-word, otherwise split it into bytes. */
1900 enum machine_mode omode, imode;
1901 unsigned int subalign;
1902 unsigned int subsize, i;
1904 subsize = size > UNITS_PER_WORD? UNITS_PER_WORD : 1;
1905 subalign = MIN (align, subsize * BITS_PER_UNIT);
1906 omode = mode_for_size (subsize * BITS_PER_UNIT, MODE_INT, 0);
1907 imode = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1909 for (i = 0; i < size; i += subsize)
1911 rtx partial = simplify_subreg (omode, x, imode, i);
1912 if (!partial || !assemble_integer (partial, subsize, subalign, 0))
1918 /* If we've printed some of it, but not all of it, there's no going
1931 assemble_real (REAL_VALUE_TYPE d, enum machine_mode mode, unsigned int align)
1935 int bitsize, nelts, nunits, units_per;
1937 /* This is hairy. We have a quantity of known size. real_to_target
1938 will put it into an array of *host* longs, 32 bits per element
1939 (even if long is more than 32 bits). We need to determine the
1940 number of array elements that are occupied (nelts) and the number
1941 of *target* min-addressable units that will be occupied in the
1942 object file (nunits). We cannot assume that 32 divides the
1943 mode's bitsize (size * BITS_PER_UNIT) evenly.
1945 size * BITS_PER_UNIT is used here to make sure that padding bits
1946 (which might appear at either end of the value; real_to_target
1947 will include the padding bits in its output array) are included. */
1949 nunits = GET_MODE_SIZE (mode);
1950 bitsize = nunits * BITS_PER_UNIT;
1951 nelts = CEIL (bitsize, 32);
1952 units_per = 32 / BITS_PER_UNIT;
1954 real_to_target (data, &d, mode);
1956 /* Put out the first word with the specified alignment. */
1957 assemble_integer (GEN_INT (data[0]), MIN (nunits, units_per), align, 1);
1958 nunits -= units_per;
1960 /* Subsequent words need only 32-bit alignment. */
1961 align = min_align (align, 32);
1963 for (i = 1; i < nelts; i++)
1965 assemble_integer (GEN_INT (data[i]), MIN (nunits, units_per), align, 1);
1966 nunits -= units_per;
1970 /* Given an expression EXP with a constant value,
1971 reduce it to the sum of an assembler symbol and an integer.
1972 Store them both in the structure *VALUE.
1973 Abort if EXP does not reduce. */
1975 struct addr_const GTY(())
1978 HOST_WIDE_INT offset;
1982 decode_addr_const (tree exp, struct addr_const *value)
1984 tree target = TREE_OPERAND (exp, 0);
1990 if (TREE_CODE (target) == COMPONENT_REF
1991 && host_integerp (byte_position (TREE_OPERAND (target, 1)), 0))
1994 offset += int_byte_position (TREE_OPERAND (target, 1));
1995 target = TREE_OPERAND (target, 0);
1997 else if (TREE_CODE (target) == ARRAY_REF
1998 || TREE_CODE (target) == ARRAY_RANGE_REF)
2000 offset += (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target)), 1)
2001 * tree_low_cst (TREE_OPERAND (target, 1), 0));
2002 target = TREE_OPERAND (target, 0);
2008 switch (TREE_CODE (target))
2012 x = DECL_RTL (target);
2016 x = gen_rtx_MEM (FUNCTION_MODE,
2017 gen_rtx_LABEL_REF (VOIDmode, force_label_rtx (target)));
2025 x = output_constant_def (target, 1);
2032 if (GET_CODE (x) != MEM)
2037 value->offset = offset;
2040 /* Uniquize all constants that appear in memory.
2041 Each constant in memory thus far output is recorded
2042 in `const_desc_table'. */
2044 struct constant_descriptor_tree GTY(())
2046 /* A MEM for the constant. */
2049 /* The value of the constant. */
2053 static GTY((param_is (struct constant_descriptor_tree)))
2054 htab_t const_desc_htab;
2056 static struct constant_descriptor_tree * build_constant_desc (tree);
2057 static void maybe_output_constant_def_contents (struct constant_descriptor_tree *, int);
2059 /* Compute a hash code for a constant expression. */
2062 const_desc_hash (const void *ptr)
2064 return const_hash_1 (((struct constant_descriptor_tree *)ptr)->value);
2068 const_hash_1 (const tree exp)
2073 enum tree_code code = TREE_CODE (exp);
2075 /* Either set P and LEN to the address and len of something to hash and
2076 exit the switch or return a value. */
2081 p = (char *) &TREE_INT_CST (exp);
2082 len = sizeof TREE_INT_CST (exp);
2086 return real_hash (TREE_REAL_CST_PTR (exp));
2089 p = TREE_STRING_POINTER (exp);
2090 len = TREE_STRING_LENGTH (exp);
2094 return (const_hash_1 (TREE_REALPART (exp)) * 5
2095 + const_hash_1 (TREE_IMAGPART (exp)));
2098 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2102 len = int_size_in_bytes (TREE_TYPE (exp));
2104 get_set_constructor_bytes (exp, (unsigned char *) tmp, len);
2112 hi = 5 + int_size_in_bytes (TREE_TYPE (exp));
2114 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2115 if (TREE_VALUE (link))
2116 hi = hi * 603 + const_hash_1 (TREE_VALUE (link));
2124 struct addr_const value;
2126 decode_addr_const (exp, &value);
2127 if (GET_CODE (value.base) == SYMBOL_REF)
2129 /* Don't hash the address of the SYMBOL_REF;
2130 only use the offset and the symbol name. */
2132 p = XSTR (value.base, 0);
2133 for (i = 0; p[i] != 0; i++)
2134 hi = ((hi * 613) + (unsigned) (p[i]));
2136 else if (GET_CODE (value.base) == LABEL_REF)
2137 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2145 return (const_hash_1 (TREE_OPERAND (exp, 0)) * 9
2146 + const_hash_1 (TREE_OPERAND (exp, 1)));
2150 case NON_LVALUE_EXPR:
2151 return const_hash_1 (TREE_OPERAND (exp, 0)) * 7 + 2;
2154 /* A language specific constant. Just hash the code. */
2158 /* Compute hashing function. */
2160 for (i = 0; i < len; i++)
2161 hi = ((hi * 613) + (unsigned) (p[i]));
2166 /* Wrapper of compare_constant, for the htab interface. */
2168 const_desc_eq (const void *p1, const void *p2)
2170 return compare_constant (((struct constant_descriptor_tree *)p1)->value,
2171 ((struct constant_descriptor_tree *)p2)->value);
2174 /* Compare t1 and t2, and return 1 only if they are known to result in
2175 the same bit pattern on output. */
2178 compare_constant (const tree t1, const tree t2)
2180 enum tree_code typecode;
2182 if (t1 == NULL_TREE)
2183 return t2 == NULL_TREE;
2184 if (t2 == NULL_TREE)
2187 if (TREE_CODE (t1) != TREE_CODE (t2))
2190 switch (TREE_CODE (t1))
2193 /* Integer constants are the same only if the same width of type. */
2194 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2196 return tree_int_cst_equal (t1, t2);
2199 /* Real constants are the same only if the same width of type. */
2200 if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
2203 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
2206 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2)))
2209 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
2210 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
2211 TREE_STRING_LENGTH (t1)));
2214 return (compare_constant (TREE_REALPART (t1), TREE_REALPART (t2))
2215 && compare_constant (TREE_IMAGPART (t1), TREE_IMAGPART (t2)));
2218 typecode = TREE_CODE (TREE_TYPE (t1));
2219 if (typecode != TREE_CODE (TREE_TYPE (t2)))
2222 if (typecode == SET_TYPE)
2224 int len = int_size_in_bytes (TREE_TYPE (t2));
2225 unsigned char *tmp1, *tmp2;
2227 if (int_size_in_bytes (TREE_TYPE (t1)) != len)
2230 tmp1 = alloca (len);
2231 tmp2 = alloca (len);
2233 if (get_set_constructor_bytes (t1, tmp1, len) != NULL_TREE)
2235 if (get_set_constructor_bytes (t2, tmp2, len) != NULL_TREE)
2238 return memcmp (tmp1, tmp2, len) == 0;
2244 if (typecode == ARRAY_TYPE)
2246 HOST_WIDE_INT size_1 = int_size_in_bytes (TREE_TYPE (t1));
2247 /* For arrays, check that the sizes all match. */
2248 if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2))
2250 || size_1 != int_size_in_bytes (TREE_TYPE (t2)))
2255 /* For record and union constructors, require exact type
2257 if (TREE_TYPE (t1) != TREE_TYPE (t2))
2261 for (l1 = CONSTRUCTOR_ELTS (t1), l2 = CONSTRUCTOR_ELTS (t2);
2263 l1 = TREE_CHAIN (l1), l2 = TREE_CHAIN (l2))
2265 /* Check that each value is the same... */
2266 if (! compare_constant (TREE_VALUE (l1), TREE_VALUE (l2)))
2268 /* ... and that they apply to the same fields! */
2269 if (typecode == ARRAY_TYPE)
2271 if (! compare_constant (TREE_PURPOSE (l1),
2277 if (TREE_PURPOSE (l1) != TREE_PURPOSE (l2))
2282 return l1 == NULL_TREE && l2 == NULL_TREE;
2288 struct addr_const value1, value2;
2290 decode_addr_const (t1, &value1);
2291 decode_addr_const (t2, &value2);
2292 return (value1.offset == value2.offset
2293 && strcmp (XSTR (value1.base, 0), XSTR (value2.base, 0)) == 0);
2299 return (compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0))
2300 && compare_constant(TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)));
2304 case NON_LVALUE_EXPR:
2305 case VIEW_CONVERT_EXPR:
2306 return compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
2311 nt1 = lang_hooks.expand_constant (t1);
2312 nt2 = lang_hooks.expand_constant (t2);
2313 if (nt1 != t1 || nt2 != t2)
2314 return compare_constant (nt1, nt2);
2320 /* Should not get here. */
2324 /* Make a copy of the whole tree structure for a constant. This
2325 handles the same types of nodes that compare_constant handles. */
2328 copy_constant (tree exp)
2330 switch (TREE_CODE (exp))
2333 /* For ADDR_EXPR, we do not want to copy the decl whose address
2334 is requested. We do want to copy constants though. */
2335 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == 'c')
2336 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2337 copy_constant (TREE_OPERAND (exp, 0)));
2339 return copy_node (exp);
2344 return copy_node (exp);
2347 return build_complex (TREE_TYPE (exp),
2348 copy_constant (TREE_REALPART (exp)),
2349 copy_constant (TREE_IMAGPART (exp)));
2353 return build (TREE_CODE (exp), TREE_TYPE (exp),
2354 copy_constant (TREE_OPERAND (exp, 0)),
2355 copy_constant (TREE_OPERAND (exp, 1)));
2359 case NON_LVALUE_EXPR:
2360 case VIEW_CONVERT_EXPR:
2361 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2362 copy_constant (TREE_OPERAND (exp, 0)));
2366 tree copy = copy_node (exp);
2367 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2370 CONSTRUCTOR_ELTS (copy) = list;
2371 for (tail = list; tail; tail = TREE_CHAIN (tail))
2372 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2373 if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
2374 for (tail = list; tail; tail = TREE_CHAIN (tail))
2375 TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail));
2383 t = lang_hooks.expand_constant (exp);
2385 return copy_constant (t);
2392 /* Subroutine of output_constant_def:
2393 No constant equal to EXP is known to have been output.
2394 Make a constant descriptor to enter EXP in the hash table.
2395 Assign the label number and construct RTL to refer to the
2396 constant's location in memory.
2397 Caller is responsible for updating the hash table. */
2399 static struct constant_descriptor_tree *
2400 build_constant_desc (tree exp)
2406 struct constant_descriptor_tree *desc;
2408 desc = ggc_alloc (sizeof (*desc));
2409 desc->value = copy_constant (exp);
2411 /* Create a string containing the label name, in LABEL. */
2412 labelno = const_labelno++;
2413 ASM_GENERATE_INTERNAL_LABEL (label, "LC", labelno);
2415 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2416 symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label));
2417 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
2418 SYMBOL_REF_DECL (symbol) = desc->value;
2419 TREE_CONSTANT_POOL_ADDRESS_P (symbol) = 1;
2421 rtl = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)), symbol);
2422 set_mem_attributes (rtl, exp, 1);
2423 set_mem_alias_set (rtl, 0);
2424 set_mem_alias_set (rtl, const_alias_set);
2426 /* Set flags or add text to the name to record information, such as
2427 that it is a local symbol. If the name is changed, the macro
2428 ASM_OUTPUT_LABELREF will have to know how to strip this
2429 information. This call might invalidate our local variable
2430 SYMBOL; we can't use it afterward. */
2432 targetm.encode_section_info (exp, rtl, true);
2439 /* Return an rtx representing a reference to constant data in memory
2440 for the constant expression EXP.
2442 If assembler code for such a constant has already been output,
2443 return an rtx to refer to it.
2444 Otherwise, output such a constant in memory
2445 and generate an rtx for it.
2447 If DEFER is nonzero, this constant can be deferred and output only
2448 if referenced in the function after all optimizations.
2450 `const_desc_table' records which constants already have label strings. */
2453 output_constant_def (tree exp, int defer)
2455 struct constant_descriptor_tree *desc;
2456 struct constant_descriptor_tree key;
2459 /* Look up EXP in the table of constant descriptors. If we didn't find
2460 it, create a new one. */
2462 loc = htab_find_slot (const_desc_htab, &key, INSERT);
2467 desc = build_constant_desc (exp);
2471 maybe_output_constant_def_contents (desc, defer);
2475 /* Subroutine of output_constant_def: Decide whether or not we need to
2476 output the constant DESC now, and if so, do it. */
2478 maybe_output_constant_def_contents (struct constant_descriptor_tree *desc,
2481 rtx symbol = XEXP (desc->rtl, 0);
2482 tree exp = desc->value;
2484 if (flag_syntax_only)
2487 if (TREE_ASM_WRITTEN (exp))
2488 /* Already output; don't do it again. */
2491 /* We can always defer constants as long as the context allows
2495 /* Increment n_deferred_constants if it exists. It needs to be at
2496 least as large as the number of constants actually referred to
2497 by the function. If it's too small we'll stop looking too early
2498 and fail to emit constants; if it's too large we'll only look
2499 through the entire function when we could have stopped earlier. */
2501 n_deferred_constants++;
2505 output_constant_def_contents (symbol);
2508 /* We must output the constant data referred to by SYMBOL; do so. */
2511 output_constant_def_contents (rtx symbol)
2513 tree exp = SYMBOL_REF_DECL (symbol);
2514 const char *label = XSTR (symbol, 0);
2517 /* Make sure any other constants whose addresses appear in EXP
2518 are assigned label numbers. */
2519 int reloc = compute_reloc_for_constant (exp);
2521 /* Align the location counter as required by EXP's data type. */
2522 int align = TYPE_ALIGN (TREE_TYPE (exp));
2523 #ifdef CONSTANT_ALIGNMENT
2524 align = CONSTANT_ALIGNMENT (exp, align);
2527 output_addressed_constants (exp);
2529 /* We are no longer deferring this constant. */
2530 TREE_ASM_WRITTEN (exp) = 1;
2532 if (IN_NAMED_SECTION (exp))
2533 named_section (exp, NULL, reloc);
2535 targetm.asm_out.select_section (exp, reloc, align);
2537 if (align > BITS_PER_UNIT)
2539 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2542 size = int_size_in_bytes (TREE_TYPE (exp));
2543 if (TREE_CODE (exp) == STRING_CST)
2544 size = MAX (TREE_STRING_LENGTH (exp), size);
2546 /* Do any machine/system dependent processing of the constant. */
2547 #ifdef ASM_DECLARE_CONSTANT_NAME
2548 ASM_DECLARE_CONSTANT_NAME (asm_out_file, label, exp, size);
2550 /* Standard thing is just output label for the constant. */
2551 ASM_OUTPUT_LABEL (asm_out_file, label);
2552 #endif /* ASM_DECLARE_CONSTANT_NAME */
2554 /* Output the value of EXP. */
2555 output_constant (exp, size, align);
2558 /* A constant which was deferred in its original location has been
2559 inserted by the RTL inliner into a different function. The
2560 current function's deferred constant count must be incremented. */
2562 notice_rtl_inlining_of_deferred_constant (void)
2564 n_deferred_constants++;
2567 /* Look up EXP in the table of constant descriptors. Return the rtl
2568 if it has been emitted, else null. */
2571 lookup_constant_def (tree exp)
2573 struct constant_descriptor_tree *desc;
2574 struct constant_descriptor_tree key;
2577 desc = htab_find (const_desc_htab, &key);
2579 return (desc ? desc->rtl : NULL_RTX);
2582 /* Used in the hash tables to avoid outputting the same constant
2583 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2584 are output once per function, not once per file. */
2585 /* ??? Only a few targets need per-function constant pools. Most
2586 can use one per-file pool. Should add a targetm bit to tell the
2589 struct rtx_constant_pool GTY(())
2591 /* Pointers to first and last constant in pool, as ordered by offset. */
2592 struct constant_descriptor_rtx *first;
2593 struct constant_descriptor_rtx *last;
2595 /* Hash facility for making memory-constants from constant rtl-expressions.
2596 It is used on RISC machines where immediate integer arguments and
2597 constant addresses are restricted so that such constants must be stored
2599 htab_t GTY((param_is (struct constant_descriptor_rtx))) const_rtx_htab;
2600 htab_t GTY((param_is (struct constant_descriptor_rtx))) const_rtx_sym_htab;
2602 /* Current offset in constant pool (does not include any
2603 machine-specific header). */
2604 HOST_WIDE_INT offset;
2607 struct constant_descriptor_rtx GTY((chain_next ("%h.next")))
2609 struct constant_descriptor_rtx *next;
2613 HOST_WIDE_INT offset;
2615 enum machine_mode mode;
2621 /* Hash and compare functions for const_rtx_htab. */
2624 const_desc_rtx_hash (const void *ptr)
2626 const struct constant_descriptor_rtx *desc = ptr;
2631 const_desc_rtx_eq (const void *a, const void *b)
2633 const struct constant_descriptor_rtx *x = a;
2634 const struct constant_descriptor_rtx *y = b;
2636 if (x->mode != y->mode)
2638 return rtx_equal_p (x->constant, y->constant);
2641 /* Hash and compare functions for const_rtx_sym_htab. */
2644 const_desc_rtx_sym_hash (const void *ptr)
2646 const struct constant_descriptor_rtx *desc = ptr;
2647 return htab_hash_string (XSTR (desc->sym, 0));
2651 const_desc_rtx_sym_eq (const void *a, const void *b)
2653 const struct constant_descriptor_rtx *x = a;
2654 const struct constant_descriptor_rtx *y = b;
2655 return XSTR (x->sym, 0) == XSTR (y->sym, 0);
2658 /* This is the worker function for const_rtx_hash, called via for_each_rtx. */
2661 const_rtx_hash_1 (rtx *xp, void *data)
2663 unsigned HOST_WIDE_INT hwi;
2664 enum machine_mode mode;
2670 code = GET_CODE (x);
2671 mode = GET_MODE (x);
2672 h = (hashval_t) code * 1048573 + mode;
2680 const int shift = sizeof (hashval_t) * CHAR_BIT;
2681 const int n = sizeof (HOST_WIDE_INT) / sizeof (hashval_t);
2684 h ^= (hashval_t) hwi;
2685 for (i = 1; i < n; ++i)
2688 h ^= (hashval_t) hwi;
2694 if (mode == VOIDmode)
2696 hwi = CONST_DOUBLE_LOW (x) ^ CONST_DOUBLE_HIGH (x);
2700 h ^= real_hash (CONST_DOUBLE_REAL_VALUE (x));
2704 h ^= htab_hash_string (XSTR (x, 0));
2708 h = h * 251 + CODE_LABEL_NUMBER (XEXP (x, 0));
2712 case UNSPEC_VOLATILE:
2713 h = h * 251 + XINT (x, 1);
2721 *hp = *hp * 509 + h;
2725 /* Compute a hash value for X, which should be a constant. */
2728 const_rtx_hash (rtx x)
2731 for_each_rtx (&x, const_rtx_hash_1, &h);
2736 /* Initialize constant pool hashing for a new function. */
2739 init_varasm_status (struct function *f)
2741 struct varasm_status *p;
2742 struct rtx_constant_pool *pool;
2744 p = ggc_alloc (sizeof (struct varasm_status));
2747 pool = ggc_alloc (sizeof (struct rtx_constant_pool));
2749 p->deferred_constants = 0;
2751 pool->const_rtx_htab = htab_create_ggc (31, const_desc_rtx_hash,
2752 const_desc_rtx_eq, NULL);
2753 pool->const_rtx_sym_htab = htab_create_ggc (31, const_desc_rtx_sym_hash,
2754 const_desc_rtx_sym_eq, NULL);
2755 pool->first = pool->last = NULL;
2759 /* Given a MINUS expression, simplify it if both sides
2760 include the same symbol. */
2763 simplify_subtraction (rtx x)
2765 rtx r = simplify_rtx (x);
2769 /* Given a constant rtx X, make (or find) a memory constant for its value
2770 and return a MEM rtx to refer to it in memory. */
2773 force_const_mem (enum machine_mode mode, rtx x)
2775 struct constant_descriptor_rtx *desc, tmp;
2776 struct rtx_constant_pool *pool = cfun->varasm->pool;
2783 /* If we're not allowed to drop X into the constant pool, don't. */
2784 if (targetm.cannot_force_const_mem (x))
2787 /* Lookup the value in the hashtable. */
2790 hash = const_rtx_hash (x);
2791 slot = htab_find_slot_with_hash (pool->const_rtx_htab, &tmp, hash, INSERT);
2794 /* If the constant was already present, return its memory. */
2796 return copy_rtx (desc->mem);
2798 /* Otherwise, create a new descriptor. */
2799 desc = ggc_alloc (sizeof (*desc));
2802 /* Align the location counter as required by EXP's data type. */
2803 align = GET_MODE_ALIGNMENT (mode == VOIDmode ? word_mode : mode);
2804 #ifdef CONSTANT_ALIGNMENT
2806 tree type = lang_hooks.types.type_for_mode (mode, 0);
2807 if (type != NULL_TREE)
2808 align = CONSTANT_ALIGNMENT (make_tree (type, x), align);
2812 pool->offset += (align / BITS_PER_UNIT) - 1;
2813 pool->offset &= ~ ((align / BITS_PER_UNIT) - 1);
2816 desc->constant = tmp.constant;
2817 desc->offset = pool->offset;
2820 desc->align = align;
2821 desc->labelno = const_labelno;
2824 pool->offset += GET_MODE_SIZE (mode);
2826 pool->last->next = desc;
2828 pool->first = pool->last = desc;
2831 /* Create a string containing the label name, in LABEL. */
2832 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
2835 /* Construct the SYMBOL_REF. Make sure to mark it as belonging to
2836 the constants pool. */
2837 desc->sym = symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label));
2838 SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL;
2839 CONSTANT_POOL_ADDRESS_P (symbol) = 1;
2840 current_function_uses_const_pool = 1;
2842 /* Insert the descriptor into the symbol cross-reference table too. */
2843 slot = htab_find_slot (pool->const_rtx_sym_htab, desc, INSERT);
2848 /* Construct the MEM. */
2849 desc->mem = def = gen_rtx_MEM (mode, symbol);
2850 set_mem_attributes (def, lang_hooks.types.type_for_mode (mode, 0), 1);
2851 RTX_UNCHANGING_P (def) = 1;
2853 /* If we're dropping a label to the constant pool, make sure we
2855 if (GET_CODE (x) == LABEL_REF)
2856 LABEL_PRESERVE_P (XEXP (x, 0)) = 1;
2858 return copy_rtx (def);
2861 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
2862 the corresponding constant_descriptor_rtx structure. */
2864 static struct constant_descriptor_rtx *
2865 find_pool_constant (struct rtx_constant_pool *pool, rtx sym)
2867 struct constant_descriptor_rtx tmp;
2869 return htab_find (pool->const_rtx_sym_htab, &tmp);
2872 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
2875 get_pool_constant (rtx addr)
2877 return find_pool_constant (cfun->varasm->pool, addr)->constant;
2880 /* Given a constant pool SYMBOL_REF, return the corresponding constant
2881 and whether it has been output or not. */
2884 get_pool_constant_mark (rtx addr, bool *pmarked)
2886 struct constant_descriptor_rtx *desc;
2888 desc = find_pool_constant (cfun->varasm->pool, addr);
2889 *pmarked = (desc->mark != 0);
2890 return desc->constant;
2893 /* Likewise, but for the constant pool of a specific function. */
2896 get_pool_constant_for_function (struct function *f, rtx addr)
2898 return find_pool_constant (f->varasm->pool, addr)->constant;
2901 /* Similar, return the mode. */
2904 get_pool_mode (rtx addr)
2906 return find_pool_constant (cfun->varasm->pool, addr)->mode;
2910 get_pool_mode_for_function (struct function *f, rtx addr)
2912 return find_pool_constant (f->varasm->pool, addr)->mode;
2915 /* Similar, return the offset in the constant pool. */
2918 get_pool_offset (rtx addr)
2920 return find_pool_constant (cfun->varasm->pool, addr)->offset;
2923 /* Return the size of the constant pool. */
2926 get_pool_size (void)
2928 return cfun->varasm->pool->offset;
2931 /* Worker function for output_constant_pool_1. Emit assembly for X
2932 in MODE with known alignment ALIGN. */
2935 output_constant_pool_2 (enum machine_mode mode, rtx x, unsigned int align)
2937 switch (GET_MODE_CLASS (mode))
2940 if (GET_CODE (x) != CONST_DOUBLE)
2945 REAL_VALUE_FROM_CONST_DOUBLE (r, x);
2946 assemble_real (r, mode, align);
2951 case MODE_PARTIAL_INT:
2952 assemble_integer (x, GET_MODE_SIZE (mode), align, 1);
2955 case MODE_VECTOR_FLOAT:
2956 case MODE_VECTOR_INT:
2959 enum machine_mode submode = GET_MODE_INNER (mode);
2960 unsigned int subalign = MIN (align, GET_MODE_BITSIZE (submode));
2962 if (GET_CODE (x) != CONST_VECTOR)
2964 units = CONST_VECTOR_NUNITS (x);
2966 for (i = 0; i < units; i++)
2968 rtx elt = CONST_VECTOR_ELT (x, i);
2969 output_constant_pool_2 (submode, elt, i ? subalign : align);
2979 /* Worker function for output_constant_pool. Emit POOL. */
2982 output_constant_pool_1 (struct constant_descriptor_rtx *desc)
2990 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
2991 whose CODE_LABEL has been deleted. This can occur if a jump table
2992 is eliminated by optimization. If so, write a constant of zero
2993 instead. Note that this can also happen by turning the
2994 CODE_LABEL into a NOTE. */
2995 /* ??? This seems completely and utterly wrong. Certainly it's
2996 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
2997 functioning even with INSN_DELETED_P and friends. */
3000 switch (GET_CODE (x))
3003 if (GET_CODE (XEXP (x, 0)) != PLUS
3004 || GET_CODE (XEXP (XEXP (x, 0), 0)) != LABEL_REF)
3006 tmp = XEXP (XEXP (x, 0), 0);
3011 if (INSN_DELETED_P (tmp)
3012 || (GET_CODE (tmp) == NOTE
3013 && NOTE_LINE_NUMBER (tmp) == NOTE_INSN_DELETED))
3024 /* First switch to correct section. */
3025 targetm.asm_out.select_rtx_section (desc->mode, x, desc->align);
3027 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3028 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, desc->mode,
3029 desc->align, desc->labelno, done);
3032 assemble_align (desc->align);
3034 /* Output the label. */
3035 targetm.asm_out.internal_label (asm_out_file, "LC", desc->labelno);
3037 /* Output the data. */
3038 output_constant_pool_2 (desc->mode, x, desc->align);
3040 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3041 sections have proper size. */
3042 if (desc->align > GET_MODE_BITSIZE (desc->mode)
3043 && in_section == in_named
3044 && get_named_section_flags (in_named_name) & SECTION_MERGE)
3045 assemble_align (desc->align);
3047 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3053 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3054 to as used. Emit referenced deferred strings. This function can
3055 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3058 mark_constant (rtx *current_rtx, void *data)
3060 struct rtx_constant_pool *pool = data;
3061 rtx x = *current_rtx;
3063 if (x == NULL_RTX || GET_CODE (x) != SYMBOL_REF)
3066 if (CONSTANT_POOL_ADDRESS_P (x))
3068 struct constant_descriptor_rtx *desc = find_pool_constant (pool, x);
3069 if (desc->mark == 0)
3072 for_each_rtx (&desc->constant, mark_constant, pool);
3075 else if (TREE_CONSTANT_POOL_ADDRESS_P (x))
3077 tree exp = SYMBOL_REF_DECL (x);
3078 if (!TREE_ASM_WRITTEN (exp))
3080 n_deferred_constants--;
3081 output_constant_def_contents (x);
3088 /* Look through appropriate parts of INSN, marking all entries in the
3089 constant pool which are actually being used. Entries that are only
3090 referenced by other constants are also marked as used. Emit
3091 deferred strings that are used. */
3094 mark_constants (struct rtx_constant_pool *pool, rtx insn)
3099 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3100 insns, not any notes that may be attached. We don't want to mark
3101 a constant just because it happens to appear in a REG_EQUIV note. */
3102 if (GET_CODE (PATTERN (insn)) == SEQUENCE)
3104 rtx seq = PATTERN (insn);
3105 int i, n = XVECLEN (seq, 0);
3106 for (i = 0; i < n; ++i)
3108 rtx subinsn = XVECEXP (seq, 0, i);
3109 if (INSN_P (subinsn))
3110 for_each_rtx (&PATTERN (subinsn), mark_constant, pool);
3114 for_each_rtx (&PATTERN (insn), mark_constant, pool);
3117 /* Look through the instructions for this function, and mark all the
3118 entries in POOL which are actually being used. Emit deferred constants
3119 which have indeed been used. */
3122 mark_constant_pool (struct rtx_constant_pool *pool)
3126 if (pool->first == 0 && n_deferred_constants == 0)
3129 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
3130 mark_constants (pool, insn);
3132 for (link = current_function_epilogue_delay_list;
3134 link = XEXP (link, 1))
3135 mark_constants (pool, XEXP (link, 0));
3138 /* Write all the constants in the constant pool. */
3141 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED,
3142 tree fndecl ATTRIBUTE_UNUSED)
3144 struct rtx_constant_pool *pool = cfun->varasm->pool;
3145 struct constant_descriptor_rtx *desc;
3147 /* It is possible for gcc to call force_const_mem and then to later
3148 discard the instructions which refer to the constant. In such a
3149 case we do not need to output the constant. */
3150 mark_constant_pool (pool);
3152 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3153 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool->offset);
3156 for (desc = pool->first; desc ; desc = desc->next)
3157 output_constant_pool_1 (desc);
3159 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3160 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool->offset);
3164 /* Determine what kind of relocations EXP may need. */
3167 compute_reloc_for_constant (tree exp)
3169 int reloc = 0, reloc2;
3172 /* Give the front-end a chance to convert VALUE to something that
3173 looks more like a constant to the back-end. */
3174 exp = lang_hooks.expand_constant (exp);
3176 switch (TREE_CODE (exp))
3180 /* Go inside any operations that get_inner_reference can handle and see
3181 if what's inside is a constant: no need to do anything here for
3182 addresses of variables or functions. */
3183 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
3184 tem = TREE_OPERAND (tem, 0))
3187 if (TREE_PUBLIC (tem))
3194 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
3195 reloc |= compute_reloc_for_constant (TREE_OPERAND (exp, 1));
3199 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
3200 reloc2 = compute_reloc_for_constant (TREE_OPERAND (exp, 1));
3201 /* The difference of two local labels is computable at link time. */
3202 if (reloc == 1 && reloc2 == 1)
3210 case NON_LVALUE_EXPR:
3211 reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
3215 for (tem = CONSTRUCTOR_ELTS (exp); tem; tem = TREE_CHAIN (tem))
3216 if (TREE_VALUE (tem) != 0)
3217 reloc |= compute_reloc_for_constant (TREE_VALUE (tem));
3227 /* Find all the constants whose addresses are referenced inside of EXP,
3228 and make sure assembler code with a label has been output for each one.
3229 Indicate whether an ADDR_EXPR has been encountered. */
3232 output_addressed_constants (tree exp)
3236 /* Give the front-end a chance to convert VALUE to something that
3237 looks more like a constant to the back-end. */
3238 exp = lang_hooks.expand_constant (exp);
3240 switch (TREE_CODE (exp))
3244 /* Go inside any operations that get_inner_reference can handle and see
3245 if what's inside is a constant: no need to do anything here for
3246 addresses of variables or functions. */
3247 for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
3248 tem = TREE_OPERAND (tem, 0))
3251 if (TREE_CODE_CLASS (TREE_CODE (tem)) == 'c'
3252 || TREE_CODE (tem) == CONSTRUCTOR)
3253 output_constant_def (tem, 0);
3258 output_addressed_constants (TREE_OPERAND (exp, 1));
3263 case NON_LVALUE_EXPR:
3264 output_addressed_constants (TREE_OPERAND (exp, 0));
3268 for (tem = CONSTRUCTOR_ELTS (exp); tem; tem = TREE_CHAIN (tem))
3269 if (TREE_VALUE (tem) != 0)
3270 output_addressed_constants (TREE_VALUE (tem));
3279 /* Return nonzero if VALUE is a valid constant-valued expression
3280 for use in initializing a static variable; one that can be an
3281 element of a "constant" initializer.
3283 Return null_pointer_node if the value is absolute;
3284 if it is relocatable, return the variable that determines the relocation.
3285 We assume that VALUE has been folded as much as possible;
3286 therefore, we do not need to check for such things as
3287 arithmetic-combinations of integers. */
3290 initializer_constant_valid_p (tree value, tree endtype)
3292 /* Give the front-end a chance to convert VALUE to something that
3293 looks more like a constant to the back-end. */
3294 value = lang_hooks.expand_constant (value);
3296 switch (TREE_CODE (value))
3299 if ((TREE_CODE (TREE_TYPE (value)) == UNION_TYPE
3300 || TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE)
3301 && TREE_CONSTANT (value)
3302 && CONSTRUCTOR_ELTS (value))
3305 bool absolute = true;
3307 for (elt = CONSTRUCTOR_ELTS (value); elt; elt = TREE_CHAIN (elt))
3310 value = TREE_VALUE (elt);
3311 reloc = initializer_constant_valid_p (value, TREE_TYPE (value));
3314 if (reloc != null_pointer_node)
3317 /* For a non-absolute relocation, there is no single
3318 variable that can be "the variable that determines the
3320 return absolute ? null_pointer_node : error_mark_node;
3323 return TREE_STATIC (value) ? null_pointer_node : NULL_TREE;
3330 return null_pointer_node;
3334 return staticp (TREE_OPERAND (value, 0)) ? TREE_OPERAND (value, 0) : 0;
3336 case VIEW_CONVERT_EXPR:
3337 case NON_LVALUE_EXPR:
3338 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3342 /* Allow conversions between pointer types. */
3343 if (POINTER_TYPE_P (TREE_TYPE (value))
3344 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3345 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3347 /* Allow conversions between real types. */
3348 if (FLOAT_TYPE_P (TREE_TYPE (value))
3349 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3350 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3352 /* Allow length-preserving conversions between integer types. */
3353 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3354 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3355 && (TYPE_PRECISION (TREE_TYPE (value))
3356 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3357 return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
3359 /* Allow conversions between other integer types only if
3361 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3362 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3364 tree inner = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3366 if (inner == null_pointer_node)
3367 return null_pointer_node;
3371 /* Allow (int) &foo provided int is as wide as a pointer. */
3372 if (INTEGRAL_TYPE_P (TREE_TYPE (value))
3373 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0)))
3374 && (TYPE_PRECISION (TREE_TYPE (value))
3375 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0)))))
3376 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3379 /* Likewise conversions from int to pointers, but also allow
3380 conversions from 0. */
3381 if ((POINTER_TYPE_P (TREE_TYPE (value))
3382 || TREE_CODE (TREE_TYPE (value)) == OFFSET_TYPE)
3383 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value, 0))))
3385 if (integer_zerop (TREE_OPERAND (value, 0)))
3386 return null_pointer_node;
3387 else if (TYPE_PRECISION (TREE_TYPE (value))
3388 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value, 0))))
3389 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3393 /* Allow conversions to struct or union types if the value
3395 if (TREE_CODE (TREE_TYPE (value)) == RECORD_TYPE
3396 || TREE_CODE (TREE_TYPE (value)) == UNION_TYPE)
3397 return initializer_constant_valid_p (TREE_OPERAND (value, 0),
3402 if (! INTEGRAL_TYPE_P (endtype)
3403 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3405 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3407 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3409 /* If either term is absolute, use the other terms relocation. */
3410 if (valid0 == null_pointer_node)
3412 if (valid1 == null_pointer_node)
3418 if (! INTEGRAL_TYPE_P (endtype)
3419 || TYPE_PRECISION (endtype) >= POINTER_SIZE)
3421 tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
3423 tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
3425 /* Win if second argument is absolute. */
3426 if (valid1 == null_pointer_node)
3428 /* Win if both arguments have the same relocation.
3429 Then the value is absolute. */
3430 if (valid0 == valid1 && valid0 != 0)
3431 return null_pointer_node;
3433 /* Since GCC guarantees that string constants are unique in the
3434 generated code, a subtraction between two copies of the same
3435 constant string is absolute. */
3436 if (valid0 && TREE_CODE (valid0) == STRING_CST &&
3437 valid1 && TREE_CODE (valid1) == STRING_CST &&
3438 TREE_STRING_POINTER (valid0) == TREE_STRING_POINTER (valid1))
3439 return null_pointer_node;
3442 /* Support differences between labels. */
3443 if (INTEGRAL_TYPE_P (endtype))
3446 op0 = TREE_OPERAND (value, 0);
3447 op1 = TREE_OPERAND (value, 1);
3449 /* Like STRIP_NOPS except allow the operand mode to widen.
3450 This works around a feature of fold that simplifies
3451 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3452 that the narrower operation is cheaper. */
3454 while (TREE_CODE (op0) == NOP_EXPR
3455 || TREE_CODE (op0) == CONVERT_EXPR
3456 || TREE_CODE (op0) == NON_LVALUE_EXPR)
3458 tree inner = TREE_OPERAND (op0, 0);
3459 if (inner == error_mark_node
3460 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3461 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0)))
3462 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3467 while (TREE_CODE (op1) == NOP_EXPR
3468 || TREE_CODE (op1) == CONVERT_EXPR
3469 || TREE_CODE (op1) == NON_LVALUE_EXPR)
3471 tree inner = TREE_OPERAND (op1, 0);
3472 if (inner == error_mark_node
3473 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
3474 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1)))
3475 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
3480 if (TREE_CODE (op0) == ADDR_EXPR
3481 && TREE_CODE (TREE_OPERAND (op0, 0)) == LABEL_DECL
3482 && TREE_CODE (op1) == ADDR_EXPR
3483 && TREE_CODE (TREE_OPERAND (op1, 0)) == LABEL_DECL)
3484 return null_pointer_node;
3495 /* Output assembler code for constant EXP to FILE, with no label.
3496 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3497 Assumes output_addressed_constants has been done on EXP already.
3499 Generate exactly SIZE bytes of assembler data, padding at the end
3500 with zeros if necessary. SIZE must always be specified.
3502 SIZE is important for structure constructors,
3503 since trailing members may have been omitted from the constructor.
3504 It is also important for initialization of arrays from string constants
3505 since the full length of the string constant might not be wanted.
3506 It is also needed for initialization of unions, where the initializer's
3507 type is just one member, and that may not be as long as the union.
3509 There a case in which we would fail to output exactly SIZE bytes:
3510 for a structure constructor that wants to produce more than SIZE bytes.
3511 But such constructors will never be generated for any possible input.
3513 ALIGN is the alignment of the data in bits. */
3516 output_constant (tree exp, unsigned HOST_WIDE_INT size, unsigned int align)
3518 enum tree_code code;
3519 unsigned HOST_WIDE_INT thissize;
3521 /* Some front-ends use constants other than the standard language-independent
3522 varieties, but which may still be output directly. Give the front-end a
3523 chance to convert EXP to a language-independent representation. */
3524 exp = lang_hooks.expand_constant (exp);
3526 if (size == 0 || flag_syntax_only)
3529 /* Eliminate any conversions since we'll be outputting the underlying
3531 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
3532 || TREE_CODE (exp) == NON_LVALUE_EXPR
3533 || TREE_CODE (exp) == VIEW_CONVERT_EXPR)
3534 exp = TREE_OPERAND (exp, 0);
3536 code = TREE_CODE (TREE_TYPE (exp));
3537 thissize = int_size_in_bytes (TREE_TYPE (exp));
3539 /* Allow a constructor with no elements for any data type.
3540 This means to fill the space with zeros. */
3541 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
3543 assemble_zeros (size);
3547 if (TREE_CODE (exp) == FDESC_EXPR)
3549 #ifdef ASM_OUTPUT_FDESC
3550 HOST_WIDE_INT part = tree_low_cst (TREE_OPERAND (exp, 1), 0);
3551 tree decl = TREE_OPERAND (exp, 0);
3552 ASM_OUTPUT_FDESC (asm_out_file, decl, part);
3559 /* Now output the underlying data. If we've handling the padding, return.
3560 Otherwise, break and ensure THISSIZE is the size written. */
3568 case REFERENCE_TYPE:
3570 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
3571 EXPAND_INITIALIZER),
3573 error ("initializer for integer value is too complicated");
3577 if (TREE_CODE (exp) != REAL_CST)
3578 error ("initializer for floating value is not a floating constant");
3580 assemble_real (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)), align);
3584 output_constant (TREE_REALPART (exp), thissize / 2, align);
3585 output_constant (TREE_IMAGPART (exp), thissize / 2,
3586 min_align (align, BITS_PER_UNIT * (thissize / 2)));
3591 if (TREE_CODE (exp) == CONSTRUCTOR)
3593 output_constructor (exp, size, align);
3596 else if (TREE_CODE (exp) == STRING_CST)
3598 thissize = MIN ((unsigned HOST_WIDE_INT)TREE_STRING_LENGTH (exp),
3600 assemble_string (TREE_STRING_POINTER (exp), thissize);
3602 else if (TREE_CODE (exp) == VECTOR_CST)
3606 unsigned int nalign;
3607 enum machine_mode inner;
3609 inner = GET_MODE_INNER (TYPE_MODE (TREE_TYPE (exp)));
3610 nalign = MIN (align, GET_MODE_ALIGNMENT (inner));
3612 elt_size = GET_MODE_UNIT_SIZE (TYPE_MODE (TREE_TYPE (exp)));
3614 link = TREE_VECTOR_CST_ELTS (exp);
3615 output_constant (TREE_VALUE (link), elt_size, align);
3616 while ((link = TREE_CHAIN (link)) != NULL)
3617 output_constant (TREE_VALUE (link), elt_size, nalign);
3625 if (TREE_CODE (exp) == CONSTRUCTOR)
3626 output_constructor (exp, size, align);
3632 if (TREE_CODE (exp) == INTEGER_CST)
3633 assemble_integer (expand_expr (exp, NULL_RTX,
3634 VOIDmode, EXPAND_INITIALIZER),
3635 thissize, align, 1);
3636 else if (TREE_CODE (exp) == CONSTRUCTOR)
3638 unsigned char *buffer = alloca (thissize);
3639 if (get_set_constructor_bytes (exp, buffer, thissize))
3641 assemble_string ((char *) buffer, thissize);
3644 error ("unknown set constructor type");
3654 if (size > thissize)
3655 assemble_zeros (size - thissize);
3659 /* Subroutine of output_constructor, used for computing the size of
3660 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3661 type with an unspecified upper bound. */
3663 static unsigned HOST_WIDE_INT
3664 array_size_for_constructor (tree val)
3668 /* This code used to attempt to handle string constants that are not
3669 arrays of single-bytes, but nothing else does, so there's no point in
3671 if (TREE_CODE (val) == STRING_CST)
3672 return TREE_STRING_LENGTH (val);
3674 max_index = NULL_TREE;
3675 for (i = CONSTRUCTOR_ELTS (val); i; i = TREE_CHAIN (i))
3677 tree index = TREE_PURPOSE (i);
3679 if (TREE_CODE (index) == RANGE_EXPR)
3680 index = TREE_OPERAND (index, 1);
3681 if (max_index == NULL_TREE || tree_int_cst_lt (max_index, index))
3685 if (max_index == NULL_TREE)
3688 /* Compute the total number of array elements. */
3689 i = size_binop (MINUS_EXPR, convert (sizetype, max_index),
3691 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val)))));
3692 i = size_binop (PLUS_EXPR, i, convert (sizetype, integer_one_node));
3694 /* Multiply by the array element unit size to find number of bytes. */
3695 i = size_binop (MULT_EXPR, i, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val))));
3697 return tree_low_cst (i, 1);
3700 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3701 Generate at least SIZE bytes, padding if necessary. */
3704 output_constructor (tree exp, unsigned HOST_WIDE_INT size,
3707 tree type = TREE_TYPE (exp);
3708 tree link, field = 0;
3710 /* Number of bytes output or skipped so far.
3711 In other words, current position within the constructor. */
3712 HOST_WIDE_INT total_bytes = 0;
3713 /* Nonzero means BYTE contains part of a byte, to be output. */
3714 int byte_buffer_in_use = 0;
3717 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
3720 if (TREE_CODE (type) == RECORD_TYPE)
3721 field = TYPE_FIELDS (type);
3723 if (TREE_CODE (type) == ARRAY_TYPE
3724 && TYPE_DOMAIN (type) != 0)
3725 min_index = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
3727 /* As LINK goes through the elements of the constant,
3728 FIELD goes through the structure fields, if the constant is a structure.
3729 if the constant is a union, then we override this,
3730 by getting the field from the TREE_LIST element.
3731 But the constant could also be an array. Then FIELD is zero.
3733 There is always a maximum of one element in the chain LINK for unions
3734 (even if the initializer in a source program incorrectly contains
3736 for (link = CONSTRUCTOR_ELTS (exp);
3738 link = TREE_CHAIN (link),
3739 field = field ? TREE_CHAIN (field) : 0)
3741 tree val = TREE_VALUE (link);
3744 /* The element in a union constructor specifies the proper field
3746 if ((TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
3747 || TREE_CODE (type) == QUAL_UNION_TYPE)
3748 && TREE_PURPOSE (link) != 0)
3749 field = TREE_PURPOSE (link);
3751 else if (TREE_CODE (type) == ARRAY_TYPE)
3752 index = TREE_PURPOSE (link);
3754 #ifdef ASM_COMMENT_START
3755 if (field && flag_verbose_asm)
3756 fprintf (asm_out_file, "%s %s:\n",
3759 ? IDENTIFIER_POINTER (DECL_NAME (field))
3763 /* Eliminate the marker that makes a cast not be an lvalue. */
3767 if (index && TREE_CODE (index) == RANGE_EXPR)
3769 unsigned HOST_WIDE_INT fieldsize
3770 = int_size_in_bytes (TREE_TYPE (type));
3771 HOST_WIDE_INT lo_index = tree_low_cst (TREE_OPERAND (index, 0), 0);
3772 HOST_WIDE_INT hi_index = tree_low_cst (TREE_OPERAND (index, 1), 0);
3773 HOST_WIDE_INT index;
3774 unsigned int align2 = min_align (align, fieldsize * BITS_PER_UNIT);
3776 for (index = lo_index; index <= hi_index; index++)
3778 /* Output the element's initial value. */
3780 assemble_zeros (fieldsize);
3782 output_constant (val, fieldsize, align2);
3784 /* Count its size. */
3785 total_bytes += fieldsize;
3788 else if (field == 0 || !DECL_BIT_FIELD (field))
3790 /* An element that is not a bit-field. */
3792 unsigned HOST_WIDE_INT fieldsize;
3793 /* Since this structure is static,
3794 we know the positions are constant. */
3795 HOST_WIDE_INT pos = field ? int_byte_position (field) : 0;
3796 unsigned int align2;
3799 pos = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val)), 1)
3800 * (tree_low_cst (index, 0) - tree_low_cst (min_index, 0)));
3802 /* Output any buffered-up bit-fields preceding this element. */
3803 if (byte_buffer_in_use)
3805 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
3807 byte_buffer_in_use = 0;
3810 /* Advance to offset of this element.
3811 Note no alignment needed in an array, since that is guaranteed
3812 if each element has the proper size. */
3813 if ((field != 0 || index != 0) && pos != total_bytes)
3815 assemble_zeros (pos - total_bytes);
3819 /* Find the alignment of this element. */
3820 align2 = min_align (align, BITS_PER_UNIT * pos);
3822 /* Determine size this element should occupy. */
3827 /* If this is an array with an unspecified upper bound,
3828 the initializer determines the size. */
3829 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
3830 but we cannot do this until the deprecated support for
3831 initializing zero-length array members is removed. */
3832 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE
3833 && TYPE_DOMAIN (TREE_TYPE (field))
3834 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field))))
3836 fieldsize = array_size_for_constructor (val);
3837 /* Given a non-empty initialization, this field had
3839 if (fieldsize != 0 && TREE_CHAIN (field) != NULL_TREE)
3842 else if (DECL_SIZE_UNIT (field))
3844 /* ??? This can't be right. If the decl size overflows
3845 a host integer we will silently emit no data. */
3846 if (host_integerp (DECL_SIZE_UNIT (field), 1))
3847 fieldsize = tree_low_cst (DECL_SIZE_UNIT (field), 1);
3851 fieldsize = int_size_in_bytes (TREE_TYPE (type));
3853 /* Output the element's initial value. */
3855 assemble_zeros (fieldsize);
3857 output_constant (val, fieldsize, align2);
3859 /* Count its size. */
3860 total_bytes += fieldsize;
3862 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
3863 error ("invalid initial value for member `%s'",
3864 IDENTIFIER_POINTER (DECL_NAME (field)));
3867 /* Element that is a bit-field. */
3869 HOST_WIDE_INT next_offset = int_bit_position (field);
3870 HOST_WIDE_INT end_offset
3871 = (next_offset + tree_low_cst (DECL_SIZE (field), 1));
3874 val = integer_zero_node;
3876 /* If this field does not start in this (or, next) byte,
3878 if (next_offset / BITS_PER_UNIT != total_bytes)
3880 /* Output remnant of any bit field in previous bytes. */
3881 if (byte_buffer_in_use)
3883 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
3885 byte_buffer_in_use = 0;
3888 /* If still not at proper byte, advance to there. */
3889 if (next_offset / BITS_PER_UNIT != total_bytes)
3891 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
3892 total_bytes = next_offset / BITS_PER_UNIT;
3896 if (! byte_buffer_in_use)
3899 /* We must split the element into pieces that fall within
3900 separate bytes, and combine each byte with previous or
3901 following bit-fields. */
3903 /* next_offset is the offset n fbits from the beginning of
3904 the structure to the next bit of this element to be processed.
3905 end_offset is the offset of the first bit past the end of
3907 while (next_offset < end_offset)
3911 HOST_WIDE_INT value;
3912 HOST_WIDE_INT next_byte = next_offset / BITS_PER_UNIT;
3913 HOST_WIDE_INT next_bit = next_offset % BITS_PER_UNIT;
3915 /* Advance from byte to byte
3916 within this element when necessary. */
3917 while (next_byte != total_bytes)
3919 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
3924 /* Number of bits we can process at once
3925 (all part of the same byte). */
3926 this_time = MIN (end_offset - next_offset,
3927 BITS_PER_UNIT - next_bit);
3928 if (BYTES_BIG_ENDIAN)
3930 /* On big-endian machine, take the most significant bits
3931 first (of the bits that are significant)
3932 and put them into bytes from the most significant end. */
3933 shift = end_offset - next_offset - this_time;
3935 /* Don't try to take a bunch of bits that cross
3936 the word boundary in the INTEGER_CST. We can
3937 only select bits from the LOW or HIGH part
3939 if (shift < HOST_BITS_PER_WIDE_INT
3940 && shift + this_time > HOST_BITS_PER_WIDE_INT)
3942 this_time = shift + this_time - HOST_BITS_PER_WIDE_INT;
3943 shift = HOST_BITS_PER_WIDE_INT;
3946 /* Now get the bits from the appropriate constant word. */
3947 if (shift < HOST_BITS_PER_WIDE_INT)
3948 value = TREE_INT_CST_LOW (val);
3949 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
3951 value = TREE_INT_CST_HIGH (val);
3952 shift -= HOST_BITS_PER_WIDE_INT;
3957 /* Get the result. This works only when:
3958 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
3959 byte |= (((value >> shift)
3960 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
3961 << (BITS_PER_UNIT - this_time - next_bit));
3965 /* On little-endian machines,
3966 take first the least significant bits of the value
3967 and pack them starting at the least significant
3968 bits of the bytes. */
3969 shift = next_offset - int_bit_position (field);
3971 /* Don't try to take a bunch of bits that cross
3972 the word boundary in the INTEGER_CST. We can
3973 only select bits from the LOW or HIGH part
3975 if (shift < HOST_BITS_PER_WIDE_INT
3976 && shift + this_time > HOST_BITS_PER_WIDE_INT)
3977 this_time = (HOST_BITS_PER_WIDE_INT - shift);
3979 /* Now get the bits from the appropriate constant word. */
3980 if (shift < HOST_BITS_PER_WIDE_INT)
3981 value = TREE_INT_CST_LOW (val);
3982 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
3984 value = TREE_INT_CST_HIGH (val);
3985 shift -= HOST_BITS_PER_WIDE_INT;
3990 /* Get the result. This works only when:
3991 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
3992 byte |= (((value >> shift)
3993 & (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
3997 next_offset += this_time;
3998 byte_buffer_in_use = 1;
4003 if (byte_buffer_in_use)
4005 assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
4009 if ((unsigned HOST_WIDE_INT)total_bytes < size)
4010 assemble_zeros (size - total_bytes);
4013 /* This TREE_LIST contains any weak symbol declarations waiting
4015 static GTY(()) tree weak_decls;
4017 /* Mark DECL as weak. */
4020 mark_weak (tree decl)
4022 DECL_WEAK (decl) = 1;
4024 if (DECL_RTL_SET_P (decl)
4025 && GET_CODE (DECL_RTL (decl)) == MEM
4026 && XEXP (DECL_RTL (decl), 0)
4027 && GET_CODE (XEXP (DECL_RTL (decl), 0)) == SYMBOL_REF)
4028 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl), 0)) = 1;
4031 /* Merge weak status between NEWDECL and OLDDECL. */
4034 merge_weak (tree newdecl, tree olddecl)
4036 if (DECL_WEAK (newdecl) == DECL_WEAK (olddecl))
4039 if (DECL_WEAK (newdecl))
4043 /* NEWDECL is weak, but OLDDECL is not. */
4045 /* If we already output the OLDDECL, we're in trouble; we can't
4046 go back and make it weak. This error cannot caught in
4047 declare_weak because the NEWDECL and OLDDECL was not yet
4048 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4049 if (TREE_ASM_WRITTEN (olddecl))
4050 error ("%Jweak declaration of '%D' must precede definition",
4053 /* If we've already generated rtl referencing OLDDECL, we may
4054 have done so in a way that will not function properly with
4056 else if (TREE_USED (olddecl)
4057 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl)))
4058 warning ("%Jweak declaration of '%D' after first use results "
4059 "in unspecified behavior", newdecl, newdecl);
4063 /* We put the NEWDECL on the weak_decls list at some point.
4064 Replace it with the OLDDECL. */
4065 for (wd = weak_decls; wd; wd = TREE_CHAIN (wd))
4066 if (TREE_VALUE (wd) == newdecl)
4068 TREE_VALUE (wd) = olddecl;
4071 /* We may not find the entry on the list. If NEWDECL is a
4072 weak alias, then we will have already called
4073 globalize_decl to remove the entry; in that case, we do
4074 not need to do anything. */
4077 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4078 mark_weak (olddecl);
4081 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4082 weak. Just update NEWDECL to indicate that it's weak too. */
4083 mark_weak (newdecl);
4086 /* Declare DECL to be a weak symbol. */
4089 declare_weak (tree decl)
4091 if (! TREE_PUBLIC (decl))
4092 error ("%Jweak declaration of '%D' must be public", decl, decl);
4093 else if (TREE_CODE (decl) == FUNCTION_DECL && TREE_ASM_WRITTEN (decl))
4094 error ("%Jweak declaration of '%D' must precede definition", decl, decl);
4095 else if (SUPPORTS_WEAK)
4097 if (! DECL_WEAK (decl))
4098 weak_decls = tree_cons (NULL, decl, weak_decls);
4101 warning ("%Jweak declaration of '%D' not supported", decl, decl);
4106 /* Emit any pending weak declarations. */
4113 for (t = weak_decls; t; t = TREE_CHAIN (t))
4115 tree decl = TREE_VALUE (t);
4116 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4117 const char *const name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4120 if (! TREE_USED (decl))
4123 #ifdef ASM_WEAKEN_DECL
4124 ASM_WEAKEN_DECL (asm_out_file, decl, name, NULL);
4126 #ifdef ASM_WEAKEN_LABEL
4127 ASM_WEAKEN_LABEL (asm_out_file, name);
4129 #ifdef ASM_OUTPUT_WEAK_ALIAS
4130 warning ("only weak aliases are supported in this configuration");
4138 /* Emit the assembly bits to indicate that DECL is globally visible. */
4141 globalize_decl (tree decl)
4143 const char *name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
4145 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4146 if (DECL_WEAK (decl))
4150 #ifdef ASM_WEAKEN_DECL
4151 ASM_WEAKEN_DECL (asm_out_file, decl, name, 0);
4153 ASM_WEAKEN_LABEL (asm_out_file, name);
4156 /* Remove this function from the pending weak list so that
4157 we do not emit multiple .weak directives for it. */
4158 for (p = &weak_decls; (t = *p) ; )
4160 if (DECL_ASSEMBLER_NAME (decl) == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
4161 *p = TREE_CHAIN (t);
4163 p = &TREE_CHAIN (t);
4167 #elif defined(ASM_MAKE_LABEL_LINKONCE)
4168 if (DECL_ONE_ONLY (decl))
4169 ASM_MAKE_LABEL_LINKONCE (asm_out_file, name);
4172 targetm.asm_out.globalize_label (asm_out_file, name);
4175 /* Emit an assembler directive to make the symbol for DECL an alias to
4176 the symbol for TARGET. */
4179 assemble_alias (tree decl, tree target ATTRIBUTE_UNUSED)
4183 /* We must force creation of DECL_RTL for debug info generation, even though
4184 we don't use it here. */
4185 make_decl_rtl (decl, NULL);
4187 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4189 #ifdef ASM_OUTPUT_DEF
4190 /* Make name accessible from other files, if appropriate. */
4192 if (TREE_PUBLIC (decl))
4194 globalize_decl (decl);
4195 maybe_assemble_visibility (decl);
4198 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4199 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
4201 ASM_OUTPUT_DEF (asm_out_file, name, IDENTIFIER_POINTER (target));
4203 #else /* !ASM_OUTPUT_DEF */
4204 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4205 if (DECL_WEAK (decl))
4208 #ifdef ASM_WEAKEN_DECL
4209 ASM_WEAKEN_DECL (asm_out_file, decl, name, IDENTIFIER_POINTER (target));
4211 ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
4213 /* Remove this function from the pending weak list so that
4214 we do not emit multiple .weak directives for it. */
4215 for (p = &weak_decls; (t = *p) ; )
4216 if (DECL_ASSEMBLER_NAME (decl)
4217 == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
4218 *p = TREE_CHAIN (t);
4220 p = &TREE_CHAIN (t);
4223 warning ("only weak aliases are supported in this configuration");
4226 warning ("alias definitions not supported in this configuration; ignored");
4230 TREE_USED (decl) = 1;
4231 TREE_ASM_WRITTEN (decl) = 1;
4232 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl)) = 1;
4235 /* Emit an assembler directive to set symbol for DECL visibility to
4236 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4239 default_assemble_visibility (tree decl, int vis)
4241 static const char * const visibility_types[] = {
4242 NULL, "internal", "hidden", "protected"
4245 const char *name, *type;
4247 name = (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
4248 type = visibility_types[vis];
4250 #ifdef HAVE_GAS_HIDDEN
4251 fprintf (asm_out_file, "\t.%s\t", type);
4252 assemble_name (asm_out_file, name);
4253 fprintf (asm_out_file, "\n");
4255 warning ("visibility attribute not supported in this configuration; ignored");
4259 /* A helper function to call assemble_visibility when needed for a decl. */
4262 maybe_assemble_visibility (tree decl)
4264 enum symbol_visibility vis = DECL_VISIBILITY (decl);
4266 if (vis != VISIBILITY_DEFAULT)
4267 targetm.asm_out.visibility (decl, vis);
4270 /* Returns 1 if the target configuration supports defining public symbols
4271 so that one of them will be chosen at link time instead of generating a
4272 multiply-defined symbol error, whether through the use of weak symbols or
4273 a target-specific mechanism for having duplicates discarded. */
4276 supports_one_only (void)
4278 if (SUPPORTS_ONE_ONLY)
4280 return SUPPORTS_WEAK;
4283 /* Set up DECL as a public symbol that can be defined in multiple
4284 translation units without generating a linker error. */
4287 make_decl_one_only (tree decl)
4289 if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL)
4292 TREE_PUBLIC (decl) = 1;
4294 if (SUPPORTS_ONE_ONLY)
4296 #ifdef MAKE_DECL_ONE_ONLY
4297 MAKE_DECL_ONE_ONLY (decl);
4299 DECL_ONE_ONLY (decl) = 1;
4301 else if (TREE_CODE (decl) == VAR_DECL
4302 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
4303 DECL_COMMON (decl) = 1;
4304 else if (SUPPORTS_WEAK)
4305 DECL_WEAK (decl) = 1;
4311 init_varasm_once (void)
4313 in_named_htab = htab_create_ggc (31, in_named_entry_hash,
4314 in_named_entry_eq, NULL);
4315 const_desc_htab = htab_create_ggc (1009, const_desc_hash,
4316 const_desc_eq, NULL);
4318 const_alias_set = new_alias_set ();
4322 decl_tls_model (tree decl)
4324 enum tls_model kind;
4325 tree attr = lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl));
4330 attr = TREE_VALUE (TREE_VALUE (attr));
4331 if (TREE_CODE (attr) != STRING_CST)
4333 if (!strcmp (TREE_STRING_POINTER (attr), "local-exec"))
4334 kind = TLS_MODEL_LOCAL_EXEC;
4335 else if (!strcmp (TREE_STRING_POINTER (attr), "initial-exec"))
4336 kind = TLS_MODEL_INITIAL_EXEC;
4337 else if (!strcmp (TREE_STRING_POINTER (attr), "local-dynamic"))
4338 kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
4339 else if (!strcmp (TREE_STRING_POINTER (attr), "global-dynamic"))
4340 kind = TLS_MODEL_GLOBAL_DYNAMIC;
4346 is_local = targetm.binds_local_p (decl);
4350 kind = TLS_MODEL_LOCAL_EXEC;
4352 kind = TLS_MODEL_INITIAL_EXEC;
4354 /* Local dynamic is inefficient when we're not combining the
4355 parts of the address. */
4356 else if (optimize && is_local)
4357 kind = TLS_MODEL_LOCAL_DYNAMIC;
4359 kind = TLS_MODEL_GLOBAL_DYNAMIC;
4360 if (kind < flag_tls_default)
4361 kind = flag_tls_default;
4366 /* Select a set of attributes for section NAME based on the properties
4367 of DECL and whether or not RELOC indicates that DECL's initializer
4368 might contain runtime relocations.
4370 We make the section read-only and executable for a function decl,
4371 read-only for a const data decl, and writable for a non-const data decl. */
4374 default_section_type_flags (tree decl, const char *name, int reloc)
4376 return default_section_type_flags_1 (decl, name, reloc, flag_pic);
4380 default_section_type_flags_1 (tree decl, const char *name, int reloc,
4385 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
4386 flags = SECTION_CODE;
4387 else if (decl && decl_readonly_section_1 (decl, reloc, shlib))
4389 else if (strcmp (name, UNLIKELY_EXECUTED_TEXT_SECTION_NAME) == 0)
4390 flags = SECTION_CODE;
4392 flags = SECTION_WRITE;
4394 if (decl && DECL_ONE_ONLY (decl))
4395 flags |= SECTION_LINKONCE;
4397 if (decl && TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4398 flags |= SECTION_TLS | SECTION_WRITE;
4400 if (strcmp (name, ".bss") == 0
4401 || strncmp (name, ".bss.", 5) == 0
4402 || strncmp (name, ".gnu.linkonce.b.", 16) == 0
4403 || strcmp (name, ".sbss") == 0
4404 || strncmp (name, ".sbss.", 6) == 0
4405 || strncmp (name, ".gnu.linkonce.sb.", 17) == 0
4406 || strcmp (name, ".tbss") == 0
4407 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4408 flags |= SECTION_BSS;
4410 if (strcmp (name, ".tdata") == 0
4411 || strcmp (name, ".tbss") == 0
4412 || strncmp (name, ".gnu.linkonce.td.", 17) == 0
4413 || strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
4414 flags |= SECTION_TLS;
4416 /* These three sections have special ELF types. They are neither
4417 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4418 want to print a section type (@progbits or @nobits). If someone
4419 is silly enough to emit code or TLS variables to one of these
4420 sections, then don't handle them specially. */
4421 if (!(flags & (SECTION_CODE | SECTION_BSS | SECTION_TLS))
4422 && (strcmp (name, ".init_array") == 0
4423 || strcmp (name, ".fini_array") == 0
4424 || strcmp (name, ".preinit_array") == 0))
4425 flags |= SECTION_NOTYPE;
4430 /* Output assembly to switch to section NAME with attribute FLAGS.
4431 Four variants for common object file formats. */
4434 default_no_named_section (const char *name ATTRIBUTE_UNUSED,
4435 unsigned int flags ATTRIBUTE_UNUSED)
4437 /* Some object formats don't support named sections at all. The
4438 front-end should already have flagged this as an error. */
4443 default_elf_asm_named_section (const char *name, unsigned int flags)
4445 char flagchars[10], *f = flagchars;
4447 if (! named_section_first_declaration (name))
4449 fprintf (asm_out_file, "\t.section\t%s\n", name);
4453 if (!(flags & SECTION_DEBUG))
4455 if (flags & SECTION_WRITE)
4457 if (flags & SECTION_CODE)
4459 if (flags & SECTION_SMALL)
4461 if (flags & SECTION_MERGE)
4463 if (flags & SECTION_STRINGS)
4465 if (flags & SECTION_TLS)
4469 fprintf (asm_out_file, "\t.section\t%s,\"%s\"", name, flagchars);
4471 if (!(flags & SECTION_NOTYPE))
4475 if (flags & SECTION_BSS)
4480 fprintf (asm_out_file, ",@%s", type);
4482 if (flags & SECTION_ENTSIZE)
4483 fprintf (asm_out_file, ",%d", flags & SECTION_ENTSIZE);
4486 putc ('\n', asm_out_file);
4490 default_coff_asm_named_section (const char *name, unsigned int flags)
4492 char flagchars[8], *f = flagchars;
4494 if (flags & SECTION_WRITE)
4496 if (flags & SECTION_CODE)
4500 fprintf (asm_out_file, "\t.section\t%s,\"%s\"\n", name, flagchars);
4504 default_pe_asm_named_section (const char *name, unsigned int flags)
4506 default_coff_asm_named_section (name, flags);
4508 if (flags & SECTION_LINKONCE)
4510 /* Functions may have been compiled at various levels of
4511 optimization so we can't use `same_size' here.
4512 Instead, have the linker pick one. */
4513 fprintf (asm_out_file, "\t.linkonce %s\n",
4514 (flags & SECTION_CODE ? "discard" : "same_size"));
4518 /* The lame default section selector. */
4521 default_select_section (tree decl, int reloc,
4522 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED)
4524 bool readonly = false;
4528 if (decl_readonly_section (decl, reloc))
4531 else if (TREE_CODE (decl) == CONSTRUCTOR)
4533 if (! ((flag_pic && reloc)
4534 || !TREE_READONLY (decl)
4535 || TREE_SIDE_EFFECTS (decl)
4536 || !TREE_CONSTANT (decl)))
4539 else if (TREE_CODE (decl) == STRING_CST)
4541 else if (! (flag_pic && reloc))
4545 readonly_data_section ();
4550 /* A helper function for default_elf_select_section and
4551 default_elf_unique_section. Categorizes the DECL. */
4553 enum section_category
4558 SECCAT_RODATA_MERGE_STR,
4559 SECCAT_RODATA_MERGE_STR_INIT,
4560 SECCAT_RODATA_MERGE_CONST,
4565 /* To optimize loading of shared programs, define following subsections
4567 _REL Contains data that has relocations, so they get grouped
4568 together and dynamic linker will visit fewer pages in memory.
4569 _RO Contains data that is otherwise read-only. This is useful
4570 with prelinking as most relocations won't be dynamically
4571 linked and thus stay read only.
4572 _LOCAL Marks data containing relocations only to local objects.
4573 These relocations will get fully resolved by prelinking. */
4575 SECCAT_DATA_REL_LOCAL,
4577 SECCAT_DATA_REL_RO_LOCAL,
4587 static enum section_category
4588 categorize_decl_for_section (tree, int, int);
4590 static enum section_category
4591 categorize_decl_for_section (tree decl, int reloc, int shlib)
4593 enum section_category ret;
4595 if (TREE_CODE (decl) == FUNCTION_DECL)
4597 else if (TREE_CODE (decl) == STRING_CST)
4598 return SECCAT_RODATA_MERGE_STR;
4599 else if (TREE_CODE (decl) == VAR_DECL)
4601 if (DECL_INITIAL (decl) == NULL
4602 || DECL_INITIAL (decl) == error_mark_node)
4604 else if (! TREE_READONLY (decl)
4605 || TREE_SIDE_EFFECTS (decl)
4606 || ! TREE_CONSTANT (DECL_INITIAL (decl)))
4608 if (shlib && (reloc & 2))
4609 ret = SECCAT_DATA_REL;
4610 else if (shlib && reloc)
4611 ret = SECCAT_DATA_REL_LOCAL;
4615 else if (shlib && (reloc & 2))
4616 ret = SECCAT_DATA_REL_RO;
4617 else if (shlib && reloc)
4618 ret = SECCAT_DATA_REL_RO_LOCAL;
4619 else if (reloc || flag_merge_constants < 2)
4620 /* C and C++ don't allow different variables to share the same
4621 location. -fmerge-all-constants allows even that (at the
4622 expense of not conforming). */
4623 ret = SECCAT_RODATA;
4624 else if (TREE_CODE (DECL_INITIAL (decl)) == STRING_CST)
4625 ret = SECCAT_RODATA_MERGE_STR_INIT;
4627 ret = SECCAT_RODATA_MERGE_CONST;
4629 else if (TREE_CODE (decl) == CONSTRUCTOR)
4631 if ((shlib && reloc)
4632 || TREE_SIDE_EFFECTS (decl)
4633 || ! TREE_CONSTANT (decl))
4636 ret = SECCAT_RODATA;
4639 ret = SECCAT_RODATA;
4641 /* There are no read-only thread-local sections. */
4642 if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4644 if (ret == SECCAT_BSS)
4650 /* If the target uses small data sections, select it. */
4651 else if (targetm.in_small_data_p (decl))
4653 if (ret == SECCAT_BSS)
4655 else if (targetm.have_srodata_section && ret == SECCAT_RODATA)
4656 ret = SECCAT_SRODATA;
4665 decl_readonly_section (tree decl, int reloc)
4667 return decl_readonly_section_1 (decl, reloc, flag_pic);
4671 decl_readonly_section_1 (tree decl, int reloc, int shlib)
4673 switch (categorize_decl_for_section (decl, reloc, shlib))
4676 case SECCAT_RODATA_MERGE_STR:
4677 case SECCAT_RODATA_MERGE_STR_INIT:
4678 case SECCAT_RODATA_MERGE_CONST:
4679 case SECCAT_SRODATA:
4688 /* Select a section based on the above categorization. */
4691 default_elf_select_section (tree decl, int reloc,
4692 unsigned HOST_WIDE_INT align)
4694 default_elf_select_section_1 (decl, reloc, align, flag_pic);
4698 default_elf_select_section_1 (tree decl, int reloc,
4699 unsigned HOST_WIDE_INT align, int shlib)
4701 switch (categorize_decl_for_section (decl, reloc, shlib))
4704 /* We're not supposed to be called on FUNCTION_DECLs. */
4707 readonly_data_section ();
4709 case SECCAT_RODATA_MERGE_STR:
4710 mergeable_string_section (decl, align, 0);
4712 case SECCAT_RODATA_MERGE_STR_INIT:
4713 mergeable_string_section (DECL_INITIAL (decl), align, 0);
4715 case SECCAT_RODATA_MERGE_CONST:
4716 mergeable_constant_section (DECL_MODE (decl), align, 0);
4718 case SECCAT_SRODATA:
4719 named_section (NULL_TREE, ".sdata2", reloc);
4724 case SECCAT_DATA_REL:
4725 named_section (NULL_TREE, ".data.rel", reloc);
4727 case SECCAT_DATA_REL_LOCAL:
4728 named_section (NULL_TREE, ".data.rel.local", reloc);
4730 case SECCAT_DATA_REL_RO:
4731 named_section (NULL_TREE, ".data.rel.ro", reloc);
4733 case SECCAT_DATA_REL_RO_LOCAL:
4734 named_section (NULL_TREE, ".data.rel.ro.local", reloc);
4737 named_section (NULL_TREE, ".sdata", reloc);
4740 named_section (NULL_TREE, ".tdata", reloc);
4743 #ifdef BSS_SECTION_ASM_OP
4746 named_section (NULL_TREE, ".bss", reloc);
4750 named_section (NULL_TREE, ".sbss", reloc);
4753 named_section (NULL_TREE, ".tbss", reloc);
4760 /* Construct a unique section name based on the decl name and the
4761 categorization performed above. */
4764 default_unique_section (tree decl, int reloc)
4766 default_unique_section_1 (decl, reloc, flag_pic);
4770 default_unique_section_1 (tree decl, int reloc, int shlib)
4772 bool one_only = DECL_ONE_ONLY (decl);
4773 const char *prefix, *name;
4777 switch (categorize_decl_for_section (decl, reloc, shlib))
4780 prefix = one_only ? ".gnu.linkonce.t." : ".text.";
4783 case SECCAT_RODATA_MERGE_STR:
4784 case SECCAT_RODATA_MERGE_STR_INIT:
4785 case SECCAT_RODATA_MERGE_CONST:
4786 prefix = one_only ? ".gnu.linkonce.r." : ".rodata.";
4788 case SECCAT_SRODATA:
4789 prefix = one_only ? ".gnu.linkonce.s2." : ".sdata2.";
4792 case SECCAT_DATA_REL:
4793 case SECCAT_DATA_REL_LOCAL:
4794 case SECCAT_DATA_REL_RO:
4795 case SECCAT_DATA_REL_RO_LOCAL:
4796 prefix = one_only ? ".gnu.linkonce.d." : ".data.";
4799 prefix = one_only ? ".gnu.linkonce.s." : ".sdata.";
4802 prefix = one_only ? ".gnu.linkonce.b." : ".bss.";
4805 prefix = one_only ? ".gnu.linkonce.sb." : ".sbss.";
4808 prefix = one_only ? ".gnu.linkonce.td." : ".tdata.";
4811 prefix = one_only ? ".gnu.linkonce.tb." : ".tbss.";
4816 plen = strlen (prefix);
4818 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4819 name = targetm.strip_name_encoding (name);
4820 nlen = strlen (name);
4822 string = alloca (nlen + plen + 1);
4823 memcpy (string, prefix, plen);
4824 memcpy (string + plen, name, nlen + 1);
4826 DECL_SECTION_NAME (decl) = build_string (nlen + plen, string);
4830 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED,
4832 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED)
4835 switch (GET_CODE (x))
4847 readonly_data_section ();
4851 default_elf_select_rtx_section (enum machine_mode mode, rtx x,
4852 unsigned HOST_WIDE_INT align)
4854 /* ??? Handle small data here somehow. */
4857 switch (GET_CODE (x))
4861 named_section (NULL_TREE, ".data.rel.ro", 3);
4865 named_section (NULL_TREE, ".data.rel.ro.local", 1);
4872 mergeable_constant_section (mode, align, 0);
4875 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
4878 default_encode_section_info (tree decl, rtx rtl, int first ATTRIBUTE_UNUSED)
4883 /* Careful not to prod global register variables. */
4884 if (GET_CODE (rtl) != MEM)
4886 symbol = XEXP (rtl, 0);
4887 if (GET_CODE (symbol) != SYMBOL_REF)
4891 if (TREE_CODE (decl) == FUNCTION_DECL)
4892 flags |= SYMBOL_FLAG_FUNCTION;
4893 if (targetm.binds_local_p (decl))
4894 flags |= SYMBOL_FLAG_LOCAL;
4895 if (targetm.in_small_data_p (decl))
4896 flags |= SYMBOL_FLAG_SMALL;
4897 if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL (decl))
4898 flags |= decl_tls_model (decl) << SYMBOL_FLAG_TLS_SHIFT;
4899 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
4900 being PUBLIC, the thing *must* be defined in this translation unit.
4901 Prevent this buglet from being propagated into rtl code as well. */
4902 if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
4903 flags |= SYMBOL_FLAG_EXTERNAL;
4905 SYMBOL_REF_FLAGS (symbol) = flags;
4908 /* By default, we do nothing for encode_section_info, so we need not
4909 do anything but discard the '*' marker. */
4912 default_strip_name_encoding (const char *str)
4914 return str + (*str == '*');
4917 /* Assume ELF-ish defaults, since that's pretty much the most liberal
4918 wrt cross-module name binding. */
4921 default_binds_local_p (tree exp)
4923 return default_binds_local_p_1 (exp, flag_shlib);
4927 default_binds_local_p_1 (tree exp, int shlib)
4931 /* A non-decl is an entry in the constant pool. */
4934 /* Static variables are always local. */
4935 else if (! TREE_PUBLIC (exp))
4937 /* A variable is local if the user tells us so. */
4938 else if (DECL_VISIBILITY (exp) != VISIBILITY_DEFAULT)
4940 /* Otherwise, variables defined outside this object may not be local. */
4941 else if (DECL_EXTERNAL (exp))
4943 /* Linkonce and weak data are never local. */
4944 else if (DECL_ONE_ONLY (exp) || DECL_WEAK (exp))
4946 /* If PIC, then assume that any global name can be overridden by
4947 symbols resolved from other modules. */
4950 /* Uninitialized COMMON variable may be unified with symbols
4951 resolved from other modules. */
4952 else if (DECL_COMMON (exp)
4953 && (DECL_INITIAL (exp) == NULL
4954 || DECL_INITIAL (exp) == error_mark_node))
4956 /* Otherwise we're left with initialized (or non-common) global data
4957 which is of necessity defined locally. */
4964 /* Determine whether or not a pointer mode is valid. Assume defaults
4965 of ptr_mode or Pmode - can be overridden. */
4967 default_valid_pointer_mode (enum machine_mode mode)
4969 return (mode == ptr_mode || mode == Pmode);
4972 /* Default function to output code that will globalize a label. A
4973 target must define GLOBAL_ASM_OP or provide it's own function to
4974 globalize a label. */
4975 #ifdef GLOBAL_ASM_OP
4977 default_globalize_label (FILE * stream, const char *name)
4979 fputs (GLOBAL_ASM_OP, stream);
4980 assemble_name (stream, name);
4981 putc ('\n', stream);
4983 #endif /* GLOBAL_ASM_OP */
4985 /* Default function to output a label for unwind information. The
4986 default is to do nothing. A target that needs nonlocal labels for
4987 unwind information must provide its own function to do this. */
4989 default_emit_unwind_label (FILE * stream ATTRIBUTE_UNUSED,
4990 tree decl ATTRIBUTE_UNUSED,
4991 int empty ATTRIBUTE_UNUSED)
4995 /* This is how to output an internal numbered label where PREFIX is
4996 the class of label and LABELNO is the number within the class. */
4999 default_internal_label (FILE *stream, const char *prefix,
5000 unsigned long labelno)
5002 char *const buf = alloca (40 + strlen (prefix));
5003 ASM_GENERATE_INTERNAL_LABEL (buf, prefix, labelno);
5004 ASM_OUTPUT_LABEL (stream, buf);
5007 /* This is the default behavior at the beginning of a file. It's
5008 controlled by two other target-hook toggles. */
5010 default_file_start (void)
5012 if (targetm.file_start_app_off && !flag_verbose_asm)
5013 fputs (ASM_APP_OFF, asm_out_file);
5015 if (targetm.file_start_file_directive)
5016 output_file_directive (asm_out_file, main_input_filename);
5019 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5020 which emits a special section directive used to indicate whether or
5021 not this object file needs an executable stack. This is primarily
5022 a GNU extension to ELF but could be used on other targets. */
5024 file_end_indicate_exec_stack (void)
5026 unsigned int flags = SECTION_DEBUG;
5027 if (trampolines_created)
5028 flags |= SECTION_CODE;
5030 named_section_flags (".note.GNU-stack", flags);
5033 #include "gt-varasm.h"