1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
24 /* This file handles generation of all the assembler code
25 *except* the instructions of a function.
26 This includes declarations of variables and their initial values.
28 We also output the assembler code for constants stored in memory
29 and are responsible for combining constants with the same value. */
33 #include "coretypes.h"
40 #include "hard-reg-set.h"
48 #include "langhooks.h"
52 #include "tree-mudflap.h"
54 #include "cfglayout.h"
55 #include "basic-block.h"
57 #ifdef XCOFF_DEBUGGING_INFO
58 #include "xcoffout.h" /* Needed for external data
59 declarations for e.g. AIX 4.x. */
62 /* The (assembler) name of the first globally-visible object output. */
63 extern GTY(()) const char *first_global_object_name
;
64 extern GTY(()) const char *weak_global_object_name
;
66 const char *first_global_object_name
;
67 const char *weak_global_object_name
;
70 struct constant_descriptor_rtx
;
71 struct rtx_constant_pool
;
73 struct varasm_status
GTY(())
75 /* If we're using a per-function constant pool, this is it. */
76 struct rtx_constant_pool
*pool
;
78 /* Number of tree-constants deferred during the expansion of this
80 unsigned int deferred_constants
;
83 #define n_deferred_constants (cfun->varasm->deferred_constants)
85 /* Number for making the label on the next
86 constant that is stored in memory. */
88 static GTY(()) int const_labelno
;
90 /* Carry information from ASM_DECLARE_OBJECT_NAME
91 to ASM_FINISH_DECLARE_OBJECT. */
93 int size_directive_output
;
95 /* The last decl for which assemble_variable was called,
96 if it did ASM_DECLARE_OBJECT_NAME.
97 If the last call to assemble_variable didn't do that,
100 tree last_assemble_variable_decl
;
102 /* The following global variable indicates if the first basic block
103 in a function belongs to the cold partition or not. */
105 bool first_function_block_is_cold
;
107 /* We give all constants their own alias set. Perhaps redundant with
108 MEM_READONLY_P, but pre-dates it. */
110 static HOST_WIDE_INT const_alias_set
;
112 static const char *strip_reg_name (const char *);
113 static int contains_pointers_p (tree
);
114 #ifdef ASM_OUTPUT_EXTERNAL
115 static bool incorporeal_function_p (tree
);
117 static void decode_addr_const (tree
, struct addr_const
*);
118 static hashval_t
const_desc_hash (const void *);
119 static int const_desc_eq (const void *, const void *);
120 static hashval_t
const_hash_1 (const tree
);
121 static int compare_constant (const tree
, const tree
);
122 static tree
copy_constant (tree
);
123 static void output_constant_def_contents (rtx
);
124 static void output_addressed_constants (tree
);
125 static unsigned HOST_WIDE_INT
array_size_for_constructor (tree
);
126 static unsigned min_align (unsigned, unsigned);
127 static void output_constructor (tree
, unsigned HOST_WIDE_INT
, unsigned int);
128 static void globalize_decl (tree
);
129 static void maybe_assemble_visibility (tree
);
130 static int in_named_entry_eq (const void *, const void *);
131 static hashval_t
in_named_entry_hash (const void *);
132 static void initialize_cold_section_name (void);
133 #ifdef BSS_SECTION_ASM_OP
134 #ifdef ASM_OUTPUT_BSS
135 static void asm_output_bss (FILE *, tree
, const char *,
136 unsigned HOST_WIDE_INT
, unsigned HOST_WIDE_INT
);
138 #ifdef ASM_OUTPUT_ALIGNED_BSS
139 static void asm_output_aligned_bss (FILE *, tree
, const char *,
140 unsigned HOST_WIDE_INT
, int)
143 #endif /* BSS_SECTION_ASM_OP */
144 static bool asm_emit_uninitialised (tree
, const char*,
145 unsigned HOST_WIDE_INT
,
146 unsigned HOST_WIDE_INT
);
147 static void mark_weak (tree
);
149 static GTY(()) enum in_section in_section
= no_section
;
150 enum in_section last_text_section
;
152 /* Return a nonzero value if DECL has a section attribute. */
153 #ifndef IN_NAMED_SECTION
154 #define IN_NAMED_SECTION(DECL) \
155 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
156 && DECL_SECTION_NAME (DECL) != NULL_TREE)
159 /* Text of section name when in_section == in_named. */
160 static GTY(()) const char *in_named_name
;
161 const char *last_text_section_name
;
163 /* Hash table of flags that have been used for a particular named section. */
165 struct in_named_entry
GTY(())
172 static GTY((param_is (struct in_named_entry
))) htab_t in_named_htab
;
174 /* Define functions like text_section for any extra sections. */
175 #ifdef EXTRA_SECTION_FUNCTIONS
176 EXTRA_SECTION_FUNCTIONS
180 initialize_cold_section_name (void)
182 const char *stripped_name
;
186 gcc_assert (cfun
&& current_function_decl
);
187 if (cfun
->unlikely_text_section_name
)
190 dsn
= DECL_SECTION_NAME (current_function_decl
);
191 if (flag_function_sections
&& dsn
)
193 name
= alloca (TREE_STRING_LENGTH (dsn
) + 1);
194 memcpy (name
, TREE_STRING_POINTER (dsn
), TREE_STRING_LENGTH (dsn
) + 1);
196 stripped_name
= targetm
.strip_name_encoding (name
);
198 buffer
= ACONCAT ((stripped_name
, "_unlikely", NULL
));
199 cfun
->unlikely_text_section_name
= ggc_strdup (buffer
);
202 cfun
->unlikely_text_section_name
= UNLIKELY_EXECUTED_TEXT_SECTION_NAME
;
205 /* Tell assembler to switch to text section. */
210 if (in_section
!= in_text
)
212 in_section
= in_text
;
213 last_text_section
= in_text
;
214 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
218 /* Tell assembler to switch to unlikely-to-be-executed text section. */
221 unlikely_text_section (void)
225 if (!cfun
->unlikely_text_section_name
)
226 initialize_cold_section_name ();
228 if (flag_function_sections
229 || ((in_section
!= in_unlikely_executed_text
)
230 && (in_section
!= in_named
231 || (strcmp (in_named_name
, cfun
->unlikely_text_section_name
)
234 named_section (NULL_TREE
, cfun
->unlikely_text_section_name
, 0);
235 in_section
= in_unlikely_executed_text
;
236 last_text_section
= in_unlikely_executed_text
;
241 named_section (NULL_TREE
, UNLIKELY_EXECUTED_TEXT_SECTION_NAME
, 0);
242 in_section
= in_unlikely_executed_text
;
243 last_text_section
= in_unlikely_executed_text
;
247 /* Tell assembler to switch to data section. */
252 if (in_section
!= in_data
)
254 in_section
= in_data
;
255 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
259 /* Tell assembler to switch to read-only data section. This is normally
263 readonly_data_section (void)
265 #ifdef READONLY_DATA_SECTION
266 READONLY_DATA_SECTION (); /* Note this can call data_section. */
268 #ifdef READONLY_DATA_SECTION_ASM_OP
269 if (in_section
!= in_readonly_data
)
271 in_section
= in_readonly_data
;
272 fputs (READONLY_DATA_SECTION_ASM_OP
, asm_out_file
);
273 fputc ('\n', asm_out_file
);
281 /* Determine if we're in the text section. */
284 in_text_section (void)
286 return in_section
== in_text
;
289 /* Determine if we're in the unlikely-to-be-executed text section. */
292 in_unlikely_text_section (void)
298 ret_val
= ((in_section
== in_unlikely_executed_text
)
299 || (in_section
== in_named
300 && cfun
->unlikely_text_section_name
301 && strcmp (in_named_name
,
302 cfun
->unlikely_text_section_name
) == 0));
306 ret_val
= ((in_section
== in_unlikely_executed_text
)
307 || (in_section
== in_named
308 && strcmp (in_named_name
,
309 UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) == 0));
315 /* Determine if we're in the data section. */
318 in_data_section (void)
320 return in_section
== in_data
;
323 /* Helper routines for maintaining in_named_htab. */
326 in_named_entry_eq (const void *p1
, const void *p2
)
328 const struct in_named_entry
*old
= p1
;
329 const char *new = p2
;
331 return strcmp (old
->name
, new) == 0;
335 in_named_entry_hash (const void *p
)
337 const struct in_named_entry
*old
= p
;
338 return htab_hash_string (old
->name
);
341 /* If SECTION has been seen before as a named section, return the flags
342 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
343 set of flags for a section to have, so 0 does not mean that the section
344 has not been seen. */
347 get_named_section_flags (const char *section
)
349 struct in_named_entry
**slot
;
351 slot
= (struct in_named_entry
**)
352 htab_find_slot_with_hash (in_named_htab
, section
,
353 htab_hash_string (section
), NO_INSERT
);
355 return slot
? (*slot
)->flags
: 0;
358 /* Returns true if the section has been declared before. Sets internal
359 flag on this section in in_named_hash so subsequent calls on this
360 section will return false. */
363 named_section_first_declaration (const char *name
)
365 struct in_named_entry
**slot
;
367 slot
= (struct in_named_entry
**)
368 htab_find_slot_with_hash (in_named_htab
, name
,
369 htab_hash_string (name
), NO_INSERT
);
370 if (! (*slot
)->declared
)
372 (*slot
)->declared
= true;
382 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
383 different set of flags, return false. */
386 set_named_section_flags (const char *section
, unsigned int flags
)
388 struct in_named_entry
**slot
, *entry
;
390 slot
= (struct in_named_entry
**)
391 htab_find_slot_with_hash (in_named_htab
, section
,
392 htab_hash_string (section
), INSERT
);
397 entry
= ggc_alloc (sizeof (*entry
));
399 entry
->name
= ggc_strdup (section
);
400 entry
->flags
= flags
;
401 entry
->declared
= false;
403 else if (entry
->flags
!= flags
)
409 /* Tell assembler to change to section NAME with attributes FLAGS. If
410 DECL is non-NULL, it is the VAR_DECL or FUNCTION_DECL with which
411 this section is associated. */
414 named_section_real (const char *name
, unsigned int flags
, tree decl
)
416 if (in_section
!= in_named
|| strcmp (name
, in_named_name
) != 0)
418 bool unchanged
= set_named_section_flags (name
, flags
);
420 gcc_assert (unchanged
);
422 targetm
.asm_out
.named_section (name
, flags
, decl
);
424 if (flags
& SECTION_FORGET
)
425 in_section
= no_section
;
428 in_named_name
= ggc_strdup (name
);
429 in_section
= in_named
;
433 if (in_text_section () || in_unlikely_text_section ())
435 last_text_section
= in_section
;
436 last_text_section_name
= name
;
440 /* Tell assembler to change to section NAME for DECL.
441 If DECL is NULL, just switch to section NAME.
442 If NAME is NULL, get the name from DECL.
443 If RELOC is 1, the initializer for DECL contains relocs. */
446 named_section (tree decl
, const char *name
, int reloc
)
450 gcc_assert (!decl
|| DECL_P (decl
));
452 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
454 if (strcmp (name
, UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) == 0
456 && ! cfun
->unlikely_text_section_name
)
457 cfun
->unlikely_text_section_name
= UNLIKELY_EXECUTED_TEXT_SECTION_NAME
;
459 flags
= targetm
.section_type_flags (decl
, name
, reloc
);
461 /* Sanity check user variables for flag changes. Non-user
462 section flag changes will die in named_section_flags.
463 However, don't complain if SECTION_OVERRIDE is set.
464 We trust that the setter knows that it is safe to ignore
465 the default flags for this decl. */
466 if (decl
&& ! set_named_section_flags (name
, flags
))
468 flags
= get_named_section_flags (name
);
469 if ((flags
& SECTION_OVERRIDE
) == 0)
470 error ("%+D causes a section type conflict", decl
);
473 named_section_real (name
, flags
, decl
);
476 /* If required, set DECL_SECTION_NAME to a unique name. */
479 resolve_unique_section (tree decl
, int reloc ATTRIBUTE_UNUSED
,
480 int flag_function_or_data_sections
)
482 if (DECL_SECTION_NAME (decl
) == NULL_TREE
483 && targetm
.have_named_sections
484 && (flag_function_or_data_sections
485 || DECL_ONE_ONLY (decl
)))
486 targetm
.asm_out
.unique_section (decl
, reloc
);
489 #ifdef BSS_SECTION_ASM_OP
491 /* Tell the assembler to switch to the bss section. */
496 if (in_section
!= in_bss
)
498 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
503 #ifdef ASM_OUTPUT_BSS
505 /* Utility function for ASM_OUTPUT_BSS for targets to use if
506 they don't support alignments in .bss.
507 ??? It is believed that this function will work in most cases so such
508 support is localized here. */
511 asm_output_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
513 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
514 unsigned HOST_WIDE_INT rounded
)
516 targetm
.asm_out
.globalize_label (file
, name
);
518 #ifdef ASM_DECLARE_OBJECT_NAME
519 last_assemble_variable_decl
= decl
;
520 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
522 /* Standard thing is just output label for the object. */
523 ASM_OUTPUT_LABEL (file
, name
);
524 #endif /* ASM_DECLARE_OBJECT_NAME */
525 ASM_OUTPUT_SKIP (file
, rounded
? rounded
: 1);
530 #ifdef ASM_OUTPUT_ALIGNED_BSS
532 /* Utility function for targets to use in implementing
533 ASM_OUTPUT_ALIGNED_BSS.
534 ??? It is believed that this function will work in most cases so such
535 support is localized here. */
538 asm_output_aligned_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
539 const char *name
, unsigned HOST_WIDE_INT size
,
543 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
544 #ifdef ASM_DECLARE_OBJECT_NAME
545 last_assemble_variable_decl
= decl
;
546 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
548 /* Standard thing is just output label for the object. */
549 ASM_OUTPUT_LABEL (file
, name
);
550 #endif /* ASM_DECLARE_OBJECT_NAME */
551 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
556 #endif /* BSS_SECTION_ASM_OP */
558 /* Switch to the section for function DECL.
560 If DECL is NULL_TREE, switch to the text section. We can be passed
561 NULL_TREE under some circumstances by dbxout.c at least. */
564 function_section (tree decl
)
568 if (first_function_block_is_cold
)
571 #ifdef USE_SELECT_SECTION_FOR_FUNCTIONS
572 targetm
.asm_out
.select_section (decl
, reloc
, DECL_ALIGN (decl
));
574 if (decl
!= NULL_TREE
575 && DECL_SECTION_NAME (decl
) != NULL_TREE
576 && targetm
.have_named_sections
)
577 named_section (decl
, (char *) 0, 0);
584 current_function_section (tree decl
)
586 #ifdef USE_SELECT_SECTION_FOR_FUNCTIONS
589 if (in_unlikely_text_section ()
590 || last_text_section
== in_unlikely_executed_text
)
593 targetm
.asm_out
.select_section (decl
, reloc
, DECL_ALIGN (decl
));
595 if (last_text_section
== in_unlikely_executed_text
)
596 unlikely_text_section ();
597 else if (last_text_section
== in_text
)
599 else if (last_text_section
== in_named
600 && targetm
.have_named_sections
)
601 named_section (NULL_TREE
, last_text_section_name
, 0);
603 function_section (decl
);
607 /* Switch to read-only data section associated with function DECL. */
610 default_function_rodata_section (tree decl
)
612 if (decl
!= NULL_TREE
&& DECL_SECTION_NAME (decl
))
614 const char *name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
616 if (DECL_ONE_ONLY (decl
) && HAVE_COMDAT_GROUP
)
618 size_t len
= strlen (name
) + 3;
619 char* rname
= alloca (len
);
621 strcpy (rname
, ".rodata");
622 strcat (rname
, name
+ 5);
623 named_section_real (rname
, SECTION_LINKONCE
, decl
);
626 /* For .gnu.linkonce.t.foo we want to use .gnu.linkonce.r.foo. */
627 else if (DECL_ONE_ONLY (decl
)
628 && strncmp (name
, ".gnu.linkonce.t.", 16) == 0)
630 size_t len
= strlen (name
) + 1;
631 char *rname
= alloca (len
);
633 memcpy (rname
, name
, len
);
635 named_section_real (rname
, SECTION_LINKONCE
, decl
);
638 /* For .text.foo we want to use .rodata.foo. */
639 else if (flag_function_sections
&& flag_data_sections
640 && strncmp (name
, ".text.", 6) == 0)
642 size_t len
= strlen (name
) + 1;
643 char *rname
= alloca (len
+ 2);
645 memcpy (rname
, ".rodata", 7);
646 memcpy (rname
+ 7, name
+ 5, len
- 5);
647 named_section_flags (rname
, 0);
652 readonly_data_section ();
655 /* Switch to read-only data section associated with function DECL
656 for targets where that section should be always the single
657 readonly data section. */
660 default_no_function_rodata_section (tree decl ATTRIBUTE_UNUSED
)
662 readonly_data_section ();
665 /* Switch to section for variable DECL. RELOC is the same as the
666 argument to SELECT_SECTION. */
669 variable_section (tree decl
, int reloc
)
671 if (IN_NAMED_SECTION (decl
))
672 named_section (decl
, NULL
, reloc
);
674 targetm
.asm_out
.select_section (decl
, reloc
, DECL_ALIGN (decl
));
677 /* Tell assembler to switch to the section for string merging. */
680 mergeable_string_section (tree decl ATTRIBUTE_UNUSED
,
681 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
682 unsigned int flags ATTRIBUTE_UNUSED
)
684 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
685 && TREE_CODE (decl
) == STRING_CST
686 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
688 && TREE_STRING_LENGTH (decl
) >= int_size_in_bytes (TREE_TYPE (decl
)))
690 enum machine_mode mode
;
691 unsigned int modesize
;
696 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (decl
)));
697 modesize
= GET_MODE_BITSIZE (mode
);
698 if (modesize
>= 8 && modesize
<= 256
699 && (modesize
& (modesize
- 1)) == 0)
701 if (align
< modesize
)
704 str
= TREE_STRING_POINTER (decl
);
705 len
= TREE_STRING_LENGTH (decl
);
706 unit
= GET_MODE_SIZE (mode
);
708 /* Check for embedded NUL characters. */
709 for (i
= 0; i
< len
; i
+= unit
)
711 for (j
= 0; j
< unit
; j
++)
712 if (str
[i
+ j
] != '\0')
719 sprintf (name
, ".rodata.str%d.%d", modesize
/ 8,
721 flags
|= (modesize
/ 8) | SECTION_MERGE
| SECTION_STRINGS
;
722 if (!i
&& modesize
< align
)
724 /* A "" string with requested alignment greater than
725 character size might cause a problem:
726 if some other string required even bigger
727 alignment than "", then linker might think the
728 "" is just part of padding after some other string
729 and not put it into the hash table initially.
730 But this means "" could have smaller alignment
732 #ifdef ASM_OUTPUT_SECTION_START
733 named_section_flags (name
, flags
);
734 ASM_OUTPUT_SECTION_START (asm_out_file
);
736 readonly_data_section ();
741 named_section_flags (name
, flags
);
747 readonly_data_section ();
750 /* Tell assembler to switch to the section for constant merging. */
753 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
754 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
755 unsigned int flags ATTRIBUTE_UNUSED
)
757 unsigned int modesize
= GET_MODE_BITSIZE (mode
);
759 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
765 && (align
& (align
- 1)) == 0)
769 sprintf (name
, ".rodata.cst%d", (int) (align
/ 8));
770 flags
|= (align
/ 8) | SECTION_MERGE
;
771 named_section_flags (name
, flags
);
775 readonly_data_section ();
778 /* Given NAME, a putative register name, discard any customary prefixes. */
781 strip_reg_name (const char *name
)
783 #ifdef REGISTER_PREFIX
784 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
785 name
+= strlen (REGISTER_PREFIX
);
787 if (name
[0] == '%' || name
[0] == '#')
792 /* The user has asked for a DECL to have a particular name. Set (or
793 change) it in such a way that we don't prefix an underscore to
796 set_user_assembler_name (tree decl
, const char *name
)
798 char *starred
= alloca (strlen (name
) + 2);
800 strcpy (starred
+ 1, name
);
801 change_decl_assembler_name (decl
, get_identifier (starred
));
802 SET_DECL_RTL (decl
, NULL_RTX
);
805 /* Decode an `asm' spec for a declaration as a register name.
806 Return the register number, or -1 if nothing specified,
807 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
808 or -3 if ASMSPEC is `cc' and is not recognized,
809 or -4 if ASMSPEC is `memory' and is not recognized.
810 Accept an exact spelling or a decimal number.
811 Prefixes such as % are optional. */
814 decode_reg_name (const char *asmspec
)
820 /* Get rid of confusing prefixes. */
821 asmspec
= strip_reg_name (asmspec
);
823 /* Allow a decimal number as a "register name". */
824 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
825 if (! ISDIGIT (asmspec
[i
]))
827 if (asmspec
[0] != 0 && i
< 0)
830 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
836 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
838 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
841 #ifdef ADDITIONAL_REGISTER_NAMES
843 static const struct { const char *const name
; const int number
; } table
[]
844 = ADDITIONAL_REGISTER_NAMES
;
846 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
848 && ! strcmp (asmspec
, table
[i
].name
))
849 return table
[i
].number
;
851 #endif /* ADDITIONAL_REGISTER_NAMES */
853 if (!strcmp (asmspec
, "memory"))
856 if (!strcmp (asmspec
, "cc"))
865 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
866 have static storage duration. In other words, it should not be an
867 automatic variable, including PARM_DECLs.
869 There is, however, one exception: this function handles variables
870 explicitly placed in a particular register by the user.
872 This is never called for PARM_DECL nodes. */
875 make_decl_rtl (tree decl
)
877 const char *name
= 0;
881 /* Check that we are not being given an automatic variable. */
882 gcc_assert (TREE_CODE (decl
) != PARM_DECL
883 && TREE_CODE (decl
) != RESULT_DECL
);
885 /* A weak alias has TREE_PUBLIC set but not the other bits. */
886 gcc_assert (TREE_CODE (decl
) != VAR_DECL
887 || TREE_STATIC (decl
)
888 || TREE_PUBLIC (decl
)
889 || DECL_EXTERNAL (decl
)
890 || DECL_REGISTER (decl
));
892 /* And that we were not given a type or a label. */
893 gcc_assert (TREE_CODE (decl
) != TYPE_DECL
894 && TREE_CODE (decl
) != LABEL_DECL
);
896 /* For a duplicate declaration, we can be called twice on the
897 same DECL node. Don't discard the RTL already made. */
898 if (DECL_RTL_SET_P (decl
))
900 /* If the old RTL had the wrong mode, fix the mode. */
901 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
902 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
903 DECL_MODE (decl
), 0));
905 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
908 /* ??? Another way to do this would be to maintain a hashed
909 table of such critters. Instead of adding stuff to a DECL
910 to give certain attributes to it, we could use an external
911 hash map from DECL to set of attributes. */
913 /* Let the target reassign the RTL if it wants.
914 This is necessary, for example, when one machine specific
915 decl attribute overrides another. */
916 targetm
.encode_section_info (decl
, DECL_RTL (decl
), false);
918 /* Make this function static known to the mudflap runtime. */
919 if (flag_mudflap
&& TREE_CODE (decl
) == VAR_DECL
)
920 mudflap_enqueue_decl (decl
);
925 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
927 if (name
[0] != '*' && TREE_CODE (decl
) != FUNCTION_DECL
928 && DECL_REGISTER (decl
))
930 error ("register name not specified for %q+D", decl
);
932 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
934 const char *asmspec
= name
+1;
935 reg_number
= decode_reg_name (asmspec
);
936 /* First detect errors in declaring global registers. */
937 if (reg_number
== -1)
938 error ("register name not specified for %q+D", decl
);
939 else if (reg_number
< 0)
940 error ("invalid register name for %q+D", decl
);
941 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
942 error ("data type of %q+D isn%'t suitable for a register",
944 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
945 error ("register specified for %q+D isn%'t suitable for data type",
947 /* Now handle properly declared static register variables. */
952 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
954 DECL_INITIAL (decl
) = 0;
955 error ("global register variable has initial value");
957 if (TREE_THIS_VOLATILE (decl
))
958 warning (OPT_Wvolatile_register_var
,
959 "optimization may eliminate reads and/or "
960 "writes to register variables");
962 /* If the user specified one of the eliminables registers here,
963 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
964 confused with that register and be eliminated. This usage is
965 somewhat suspect... */
967 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
968 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
969 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
971 if (TREE_STATIC (decl
))
973 /* Make this register global, so not usable for anything
975 #ifdef ASM_DECLARE_REGISTER_GLOBAL
976 name
= IDENTIFIER_POINTER (DECL_NAME (decl
));
977 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
979 nregs
= hard_regno_nregs
[reg_number
][DECL_MODE (decl
)];
981 globalize_reg (reg_number
+ --nregs
);
984 /* As a register variable, it has no section. */
988 /* Now handle ordinary static variables and functions (in memory).
989 Also handle vars declared register invalidly. */
990 else if (name
[0] == '*')
992 #ifdef REGISTER_PREFIX
993 if (strlen (REGISTER_PREFIX
) != 0)
995 reg_number
= decode_reg_name (name
);
996 if (reg_number
>= 0 || reg_number
== -3)
997 error ("register name given for non-register variable %q+D", decl
);
1002 /* Specifying a section attribute on a variable forces it into a
1003 non-.bss section, and thus it cannot be common. */
1004 if (TREE_CODE (decl
) == VAR_DECL
1005 && DECL_SECTION_NAME (decl
) != NULL_TREE
1006 && DECL_INITIAL (decl
) == NULL_TREE
1007 && DECL_COMMON (decl
))
1008 DECL_COMMON (decl
) = 0;
1010 /* Variables can't be both common and weak. */
1011 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
1012 DECL_COMMON (decl
) = 0;
1014 x
= gen_rtx_SYMBOL_REF (Pmode
, name
);
1015 SYMBOL_REF_WEAK (x
) = DECL_WEAK (decl
);
1016 SYMBOL_REF_DECL (x
) = decl
;
1018 x
= gen_rtx_MEM (DECL_MODE (decl
), x
);
1019 if (TREE_CODE (decl
) != FUNCTION_DECL
)
1020 set_mem_attributes (x
, decl
, 1);
1021 SET_DECL_RTL (decl
, x
);
1023 /* Optionally set flags or add text to the name to record information
1024 such as that it is a function name.
1025 If the name is changed, the macro ASM_OUTPUT_LABELREF
1026 will have to know how to strip this information. */
1027 targetm
.encode_section_info (decl
, DECL_RTL (decl
), true);
1029 /* Make this function static known to the mudflap runtime. */
1030 if (flag_mudflap
&& TREE_CODE (decl
) == VAR_DECL
)
1031 mudflap_enqueue_decl (decl
);
1034 /* Make the rtl for variable VAR be volatile.
1035 Use this only for static variables. */
1038 make_var_volatile (tree var
)
1040 gcc_assert (MEM_P (DECL_RTL (var
)));
1042 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
1045 /* Output a string of literal assembler code
1046 for an `asm' keyword used between functions. */
1049 assemble_asm (tree string
)
1053 if (TREE_CODE (string
) == ADDR_EXPR
)
1054 string
= TREE_OPERAND (string
, 0);
1056 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
1059 /* Record an element in the table of global destructors. SYMBOL is
1060 a SYMBOL_REF of the function to be called; PRIORITY is a number
1061 between 0 and MAX_INIT_PRIORITY. */
1064 default_stabs_asm_out_destructor (rtx symbol ATTRIBUTE_UNUSED
,
1065 int priority ATTRIBUTE_UNUSED
)
1067 #if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO
1068 /* Tell GNU LD that this is part of the static destructor set.
1069 This will work for any system that uses stabs, most usefully
1071 dbxout_begin_simple_stabs ("___DTOR_LIST__", 22 /* N_SETT */);
1072 dbxout_stab_value_label (XSTR (symbol
, 0));
1074 sorry ("global destructors not supported on this target");
1079 default_named_section_asm_out_destructor (rtx symbol
, int priority
)
1081 const char *section
= ".dtors";
1084 /* ??? This only works reliably with the GNU linker. */
1085 if (priority
!= DEFAULT_INIT_PRIORITY
)
1087 sprintf (buf
, ".dtors.%.5u",
1088 /* Invert the numbering so the linker puts us in the proper
1089 order; constructors are run from right to left, and the
1090 linker sorts in increasing order. */
1091 MAX_INIT_PRIORITY
- priority
);
1095 named_section_flags (section
, SECTION_WRITE
);
1096 assemble_align (POINTER_SIZE
);
1097 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1100 #ifdef DTORS_SECTION_ASM_OP
1102 dtors_section (void)
1104 if (in_section
!= in_dtors
)
1106 in_section
= in_dtors
;
1107 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
1108 fputc ('\n', asm_out_file
);
1113 default_dtor_section_asm_out_destructor (rtx symbol
,
1114 int priority ATTRIBUTE_UNUSED
)
1117 assemble_align (POINTER_SIZE
);
1118 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1122 /* Likewise for global constructors. */
1125 default_stabs_asm_out_constructor (rtx symbol ATTRIBUTE_UNUSED
,
1126 int priority ATTRIBUTE_UNUSED
)
1128 #if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO
1129 /* Tell GNU LD that this is part of the static destructor set.
1130 This will work for any system that uses stabs, most usefully
1132 dbxout_begin_simple_stabs ("___CTOR_LIST__", 22 /* N_SETT */);
1133 dbxout_stab_value_label (XSTR (symbol
, 0));
1135 sorry ("global constructors not supported on this target");
1140 default_named_section_asm_out_constructor (rtx symbol
, int priority
)
1142 const char *section
= ".ctors";
1145 /* ??? This only works reliably with the GNU linker. */
1146 if (priority
!= DEFAULT_INIT_PRIORITY
)
1148 sprintf (buf
, ".ctors.%.5u",
1149 /* Invert the numbering so the linker puts us in the proper
1150 order; constructors are run from right to left, and the
1151 linker sorts in increasing order. */
1152 MAX_INIT_PRIORITY
- priority
);
1156 named_section_flags (section
, SECTION_WRITE
);
1157 assemble_align (POINTER_SIZE
);
1158 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1161 #ifdef CTORS_SECTION_ASM_OP
1163 ctors_section (void)
1165 if (in_section
!= in_ctors
)
1167 in_section
= in_ctors
;
1168 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1169 fputc ('\n', asm_out_file
);
1174 default_ctor_section_asm_out_constructor (rtx symbol
,
1175 int priority ATTRIBUTE_UNUSED
)
1178 assemble_align (POINTER_SIZE
);
1179 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1183 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1184 a nonzero value if the constant pool should be output before the
1185 start of the function, or a zero value if the pool should output
1186 after the end of the function. The default is to put it before the
1189 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1190 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1193 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
1194 to be output to assembler.
1195 Set first_global_object_name and weak_global_object_name as appropriate. */
1198 notice_global_symbol (tree decl
)
1200 const char **type
= &first_global_object_name
;
1202 if (first_global_object_name
1203 || !TREE_PUBLIC (decl
) || DECL_EXTERNAL (decl
)
1204 || !DECL_NAME (decl
)
1205 || (TREE_CODE (decl
) != FUNCTION_DECL
1206 && (TREE_CODE (decl
) != VAR_DECL
1207 || (DECL_COMMON (decl
)
1208 && (DECL_INITIAL (decl
) == 0
1209 || DECL_INITIAL (decl
) == error_mark_node
))))
1210 || !MEM_P (DECL_RTL (decl
)))
1213 /* We win when global object is found, but it is useful to know about weak
1214 symbol as well so we can produce nicer unique names. */
1215 if (DECL_WEAK (decl
) || DECL_ONE_ONLY (decl
))
1216 type
= &weak_global_object_name
;
1222 rtx decl_rtl
= DECL_RTL (decl
);
1224 p
= targetm
.strip_name_encoding (XSTR (XEXP (decl_rtl
, 0), 0));
1225 name
= ggc_strdup (p
);
1231 /* Output assembler code for the constant pool of a function and associated
1232 with defining the name of the function. DECL describes the function.
1233 NAME is the function's name. For the constant pool, we use the current
1234 constant pool data. */
1237 assemble_start_function (tree decl
, const char *fnname
)
1240 char tmp_label
[100];
1241 bool hot_label_written
= false;
1243 cfun
->unlikely_text_section_name
= NULL
;
1245 first_function_block_is_cold
= false;
1246 if (flag_reorder_blocks_and_partition
)
1248 ASM_GENERATE_INTERNAL_LABEL (tmp_label
, "LHOTB", const_labelno
);
1249 cfun
->hot_section_label
= ggc_strdup (tmp_label
);
1250 ASM_GENERATE_INTERNAL_LABEL (tmp_label
, "LCOLDB", const_labelno
);
1251 cfun
->cold_section_label
= ggc_strdup (tmp_label
);
1252 ASM_GENERATE_INTERNAL_LABEL (tmp_label
, "LHOTE", const_labelno
);
1253 cfun
->hot_section_end_label
= ggc_strdup (tmp_label
);
1254 ASM_GENERATE_INTERNAL_LABEL (tmp_label
, "LCOLDE", const_labelno
);
1255 cfun
->cold_section_end_label
= ggc_strdup (tmp_label
);
1260 cfun
->hot_section_label
= NULL
;
1261 cfun
->cold_section_label
= NULL
;
1262 cfun
->hot_section_end_label
= NULL
;
1263 cfun
->cold_section_end_label
= NULL
;
1266 /* The following code does not need preprocessing in the assembler. */
1270 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1271 output_constant_pool (fnname
, decl
);
1273 resolve_unique_section (decl
, 0, flag_function_sections
);
1275 /* Make sure the not and cold text (code) sections are properly
1276 aligned. This is necessary here in the case where the function
1277 has both hot and cold sections, because we don't want to re-set
1278 the alignment when the section switch happens mid-function. */
1280 if (flag_reorder_blocks_and_partition
)
1282 unlikely_text_section ();
1283 assemble_align (FUNCTION_BOUNDARY
);
1284 ASM_OUTPUT_LABEL (asm_out_file
, cfun
->cold_section_label
);
1286 /* When the function starts with a cold section, we need to explicitly
1287 align the hot section and write out the hot section label.
1288 But if the current function is a thunk, we do not have a CFG. */
1289 if (!current_function_is_thunk
1290 && BB_PARTITION (ENTRY_BLOCK_PTR
->next_bb
) == BB_COLD_PARTITION
)
1293 assemble_align (FUNCTION_BOUNDARY
);
1294 ASM_OUTPUT_LABEL (asm_out_file
, cfun
->hot_section_label
);
1295 hot_label_written
= true;
1296 first_function_block_is_cold
= true;
1299 else if (DECL_SECTION_NAME (decl
))
1301 /* Calls to function_section rely on first_function_block_is_cold
1302 being accurate. The first block may be cold even if we aren't
1303 doing partitioning, if the entire function was decided by
1304 choose_function_section (predict.c) to be cold. */
1306 initialize_cold_section_name ();
1308 if (cfun
->unlikely_text_section_name
1309 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl
)),
1310 cfun
->unlikely_text_section_name
) == 0)
1311 first_function_block_is_cold
= true;
1314 last_text_section
= no_section
;
1316 /* Switch to the correct text section for the start of the function. */
1318 function_section (decl
);
1319 if (flag_reorder_blocks_and_partition
1320 && !hot_label_written
)
1321 ASM_OUTPUT_LABEL (asm_out_file
, cfun
->hot_section_label
);
1323 /* Tell assembler to move to target machine's alignment for functions. */
1324 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1325 if (align
< force_align_functions_log
)
1326 align
= force_align_functions_log
;
1329 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1332 /* Handle a user-specified function alignment.
1333 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1334 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1335 if (align_functions_log
> align
1336 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1338 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1339 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1340 align_functions_log
, align_functions
- 1);
1342 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1346 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1347 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1350 (*debug_hooks
->begin_function
) (decl
);
1352 /* Make function name accessible from other files, if appropriate. */
1354 if (TREE_PUBLIC (decl
))
1356 notice_global_symbol (decl
);
1358 globalize_decl (decl
);
1360 maybe_assemble_visibility (decl
);
1363 if (DECL_PRESERVE_P (decl
))
1364 targetm
.asm_out
.mark_decl_preserved (fnname
);
1366 /* Do any machine/system dependent processing of the function name. */
1367 #ifdef ASM_DECLARE_FUNCTION_NAME
1368 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1370 /* Standard thing is just output label for the function. */
1371 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1372 #endif /* ASM_DECLARE_FUNCTION_NAME */
1375 /* Output assembler code associated with defining the size of the
1376 function. DECL describes the function. NAME is the function's name. */
1379 assemble_end_function (tree decl
, const char *fnname
)
1381 #ifdef ASM_DECLARE_FUNCTION_SIZE
1382 /* We could have switched section in the middle of the function. */
1383 if (flag_reorder_blocks_and_partition
)
1384 function_section (decl
);
1385 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1387 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1389 output_constant_pool (fnname
, decl
);
1390 function_section (decl
); /* need to switch back */
1392 /* Output labels for end of hot/cold text sections (to be used by
1394 if (flag_reorder_blocks_and_partition
)
1396 enum in_section save_text_section
;
1398 save_text_section
= in_section
;
1399 unlikely_text_section ();
1400 ASM_OUTPUT_LABEL (asm_out_file
, cfun
->cold_section_end_label
);
1401 if (first_function_block_is_cold
)
1404 function_section (decl
);
1405 ASM_OUTPUT_LABEL (asm_out_file
, cfun
->hot_section_end_label
);
1406 if (save_text_section
== in_unlikely_executed_text
)
1407 unlikely_text_section ();
1411 /* Assemble code to leave SIZE bytes of zeros. */
1414 assemble_zeros (unsigned HOST_WIDE_INT size
)
1416 /* Do no output if -fsyntax-only. */
1417 if (flag_syntax_only
)
1420 #ifdef ASM_NO_SKIP_IN_TEXT
1421 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1422 so we must output 0s explicitly in the text section. */
1423 if ((ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1424 || (ASM_NO_SKIP_IN_TEXT
&& in_unlikely_text_section ()))
1426 unsigned HOST_WIDE_INT i
;
1427 for (i
= 0; i
< size
; i
++)
1428 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1433 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1436 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1439 assemble_align (int align
)
1441 if (align
> BITS_PER_UNIT
)
1443 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1447 /* Assemble a string constant with the specified C string as contents. */
1450 assemble_string (const char *p
, int size
)
1455 /* If the string is very long, split it up. */
1459 int thissize
= size
- pos
;
1460 if (thissize
> maximum
)
1463 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1471 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1472 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1473 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1475 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1476 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1477 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1479 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1480 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1484 #if defined ASM_OUTPUT_ALIGNED_BSS
1485 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1486 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1488 #if defined ASM_OUTPUT_BSS
1489 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1490 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1496 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1497 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1498 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1500 #if defined ASM_OUTPUT_ALIGNED_COMMON
1501 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1502 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1504 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1505 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1510 asm_emit_uninitialised (tree decl
, const char *name
,
1511 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
1512 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
)
1520 destination
= asm_dest_local
;
1522 /* ??? We should handle .bss via select_section mechanisms rather than
1523 via special target hooks. That would eliminate this special case. */
1524 if (TREE_PUBLIC (decl
))
1526 if (!DECL_COMMON (decl
))
1528 destination
= asm_dest_bss
;
1533 destination
= asm_dest_common
;
1536 if (destination
!= asm_dest_common
)
1538 resolve_unique_section (decl
, 0, flag_data_sections
);
1539 /* Custom sections don't belong here. */
1540 if (DECL_SECTION_NAME (decl
))
1544 if (destination
== asm_dest_bss
)
1545 globalize_decl (decl
);
1547 if (flag_shared_data
)
1549 switch (destination
)
1551 #ifdef ASM_OUTPUT_SHARED_BSS
1553 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1556 #ifdef ASM_OUTPUT_SHARED_COMMON
1557 case asm_dest_common
:
1558 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1561 #ifdef ASM_OUTPUT_SHARED_LOCAL
1562 case asm_dest_local
:
1563 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1571 switch (destination
)
1575 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1578 case asm_dest_common
:
1579 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1581 case asm_dest_local
:
1582 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1591 /* Assemble everything that is needed for a variable or function declaration.
1592 Not used for automatic variables, and not used for function definitions.
1593 Should not be called for variables of incomplete structure type.
1595 TOP_LEVEL is nonzero if this variable has file scope.
1596 AT_END is nonzero if this is the special handling, at end of compilation,
1597 to define things that have had only tentative definitions.
1598 DONT_OUTPUT_DATA if nonzero means don't actually output the
1599 initial value (that will be done by the caller). */
1602 assemble_variable (tree decl
, int top_level ATTRIBUTE_UNUSED
,
1603 int at_end ATTRIBUTE_UNUSED
, int dont_output_data
)
1610 if (lang_hooks
.decls
.prepare_assemble_variable
)
1611 lang_hooks
.decls
.prepare_assemble_variable (decl
);
1613 last_assemble_variable_decl
= 0;
1615 /* Normally no need to say anything here for external references,
1616 since assemble_external is called by the language-specific code
1617 when a declaration is first seen. */
1619 if (DECL_EXTERNAL (decl
))
1622 /* Output no assembler code for a function declaration.
1623 Only definitions of functions output anything. */
1625 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1628 /* Do nothing for global register variables. */
1629 if (DECL_RTL_SET_P (decl
) && REG_P (DECL_RTL (decl
)))
1631 TREE_ASM_WRITTEN (decl
) = 1;
1635 /* If type was incomplete when the variable was declared,
1636 see if it is complete now. */
1638 if (DECL_SIZE (decl
) == 0)
1639 layout_decl (decl
, 0);
1641 /* Still incomplete => don't allocate it; treat the tentative defn
1642 (which is what it must have been) as an `extern' reference. */
1644 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1646 error ("storage size of %q+D isn%'t known", decl
);
1647 TREE_ASM_WRITTEN (decl
) = 1;
1651 /* The first declaration of a variable that comes through this function
1652 decides whether it is global (in C, has external linkage)
1653 or local (in C, has internal linkage). So do nothing more
1654 if this function has already run. */
1656 if (TREE_ASM_WRITTEN (decl
))
1659 /* Make sure targetm.encode_section_info is invoked before we set
1661 decl_rtl
= DECL_RTL (decl
);
1663 TREE_ASM_WRITTEN (decl
) = 1;
1665 /* Do no output if -fsyntax-only. */
1666 if (flag_syntax_only
)
1671 if (! dont_output_data
1672 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1674 error ("size of variable %q+D is too large", decl
);
1678 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1679 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1680 notice_global_symbol (decl
);
1682 /* Compute the alignment of this data. */
1684 align
= DECL_ALIGN (decl
);
1686 /* In the case for initialing an array whose length isn't specified,
1687 where we have not yet been able to do the layout,
1688 figure out the proper alignment now. */
1689 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1690 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1691 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1693 /* Some object file formats have a maximum alignment which they support.
1694 In particular, a.out format supports a maximum alignment of 4. */
1695 if (align
> MAX_OFILE_ALIGNMENT
)
1697 warning (0, "alignment of %q+D is greater than maximum object "
1698 "file alignment. Using %d", decl
,
1699 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1700 align
= MAX_OFILE_ALIGNMENT
;
1703 /* On some machines, it is good to increase alignment sometimes. */
1704 if (! DECL_USER_ALIGN (decl
))
1706 #ifdef DATA_ALIGNMENT
1707 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1709 #ifdef CONSTANT_ALIGNMENT
1710 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1711 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1715 /* Reset the alignment in case we have made it tighter, so we can benefit
1716 from it in get_pointer_alignment. */
1717 DECL_ALIGN (decl
) = align
;
1718 set_mem_align (decl_rtl
, align
);
1720 if (TREE_PUBLIC (decl
))
1721 maybe_assemble_visibility (decl
);
1723 if (DECL_PRESERVE_P (decl
))
1724 targetm
.asm_out
.mark_decl_preserved (name
);
1726 /* Handle uninitialized definitions. */
1728 /* If the decl has been given an explicit section name, then it
1729 isn't common, and shouldn't be handled as such. */
1730 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1732 /* We don't implement common thread-local data at present. */
1733 else if (DECL_THREAD_LOCAL_P (decl
))
1735 if (DECL_COMMON (decl
))
1736 sorry ("thread-local COMMON data not implemented");
1738 else if (DECL_INITIAL (decl
) == 0
1739 || DECL_INITIAL (decl
) == error_mark_node
1740 || (flag_zero_initialized_in_bss
1741 /* Leave constant zeroes in .rodata so they can be shared. */
1742 && !TREE_READONLY (decl
)
1743 && initializer_zerop (DECL_INITIAL (decl
))))
1745 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1746 unsigned HOST_WIDE_INT rounded
= size
;
1748 /* Don't allocate zero bytes of common,
1749 since that means "undefined external" in the linker. */
1753 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1754 so that each uninitialized object starts on such a boundary. */
1755 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1756 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1757 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1759 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1760 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN_UNIT (decl
) > rounded
)
1761 warning (0, "requested alignment for %q+D is greater than "
1762 "implemented alignment of %wu", decl
, rounded
);
1765 /* If the target cannot output uninitialized but not common global data
1766 in .bss, then we have to use .data, so fall through. */
1767 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1771 /* Handle initialized definitions.
1772 Also handle uninitialized global definitions if -fno-common and the
1773 target doesn't support ASM_OUTPUT_BSS. */
1775 /* First make the assembler name(s) global if appropriate. */
1776 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1777 globalize_decl (decl
);
1779 /* Output any data that we will need to use the address of. */
1780 if (DECL_INITIAL (decl
) == error_mark_node
)
1781 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1782 else if (DECL_INITIAL (decl
))
1784 reloc
= compute_reloc_for_constant (DECL_INITIAL (decl
));
1785 output_addressed_constants (DECL_INITIAL (decl
));
1788 /* Switch to the appropriate section. */
1789 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1790 variable_section (decl
, reloc
);
1792 /* dbxout.c needs to know this. */
1793 if (in_text_section () || in_unlikely_text_section ())
1794 DECL_IN_TEXT_SECTION (decl
) = 1;
1796 /* Output the alignment of this data. */
1797 if (align
> BITS_PER_UNIT
)
1798 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (DECL_ALIGN_UNIT (decl
)));
1800 /* Do any machine/system dependent processing of the object. */
1801 #ifdef ASM_DECLARE_OBJECT_NAME
1802 last_assemble_variable_decl
= decl
;
1803 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1805 /* Standard thing is just output label for the object. */
1806 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1807 #endif /* ASM_DECLARE_OBJECT_NAME */
1809 if (!dont_output_data
)
1811 if (DECL_INITIAL (decl
)
1812 && DECL_INITIAL (decl
) != error_mark_node
1813 && !initializer_zerop (DECL_INITIAL (decl
)))
1814 /* Output the actual data. */
1815 output_constant (DECL_INITIAL (decl
),
1816 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1819 /* Leave space for it. */
1820 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1824 /* Return 1 if type TYPE contains any pointers. */
1827 contains_pointers_p (tree type
)
1829 switch (TREE_CODE (type
))
1832 case REFERENCE_TYPE
:
1833 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1834 so I'll play safe and return 1. */
1840 case QUAL_UNION_TYPE
:
1843 /* For a type that has fields, see if the fields have pointers. */
1844 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1845 if (TREE_CODE (fields
) == FIELD_DECL
1846 && contains_pointers_p (TREE_TYPE (fields
)))
1852 /* An array type contains pointers if its element type does. */
1853 return contains_pointers_p (TREE_TYPE (type
));
1860 /* In unit-at-a-time mode, we delay assemble_external processing until
1861 the compilation unit is finalized. This is the best we can do for
1862 right now (i.e. stage 3 of GCC 4.0) - the right thing is to delay
1863 it all the way to final. See PR 17982 for further discussion. */
1864 static GTY(()) tree pending_assemble_externals
;
1866 #ifdef ASM_OUTPUT_EXTERNAL
1867 /* True if DECL is a function decl for which no out-of-line copy exists.
1868 It is assumed that DECL's assembler name has been set. */
1871 incorporeal_function_p (tree decl
)
1873 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_BUILT_IN (decl
))
1877 if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1878 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_ALLOCA
)
1881 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
1882 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
1888 /* Actually do the tests to determine if this is necessary, and invoke
1889 ASM_OUTPUT_EXTERNAL. */
1891 assemble_external_real (tree decl
)
1893 rtx rtl
= DECL_RTL (decl
);
1895 if (MEM_P (rtl
) && GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1896 && !SYMBOL_REF_USED (XEXP (rtl
, 0))
1897 && !incorporeal_function_p (decl
))
1899 /* Some systems do require some output. */
1900 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1901 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1907 process_pending_assemble_externals (void)
1909 #ifdef ASM_OUTPUT_EXTERNAL
1911 for (list
= pending_assemble_externals
; list
; list
= TREE_CHAIN (list
))
1912 assemble_external_real (TREE_VALUE (list
));
1914 pending_assemble_externals
= 0;
1918 /* Output something to declare an external symbol to the assembler.
1919 (Most assemblers don't need this, so we normally output nothing.)
1920 Do nothing if DECL is not external. */
1923 assemble_external (tree decl ATTRIBUTE_UNUSED
)
1925 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1926 main body of this code is only rarely exercised. To provide some
1927 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1928 open. If it's not, we should not be calling this function. */
1929 gcc_assert (asm_out_file
);
1931 #ifdef ASM_OUTPUT_EXTERNAL
1932 if (!DECL_P (decl
) || !DECL_EXTERNAL (decl
) || !TREE_PUBLIC (decl
))
1935 if (flag_unit_at_a_time
)
1936 pending_assemble_externals
= tree_cons (0, decl
,
1937 pending_assemble_externals
);
1939 assemble_external_real (decl
);
1943 /* Similar, for calling a library function FUN. */
1946 assemble_external_libcall (rtx fun
)
1948 /* Declare library function name external when first used, if nec. */
1949 if (! SYMBOL_REF_USED (fun
))
1951 SYMBOL_REF_USED (fun
) = 1;
1952 targetm
.asm_out
.external_libcall (fun
);
1956 /* Assemble a label named NAME. */
1959 assemble_label (const char *name
)
1961 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1964 /* Set the symbol_referenced flag for ID. */
1966 mark_referenced (tree id
)
1968 TREE_SYMBOL_REFERENCED (id
) = 1;
1971 /* Set the symbol_referenced flag for DECL and notify callgraph. */
1973 mark_decl_referenced (tree decl
)
1975 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1977 /* Extern inline functions don't become needed when referenced.
1978 If we know a method will be emitted in other TU and no new
1979 functions can be marked reachable, just use the external
1981 struct cgraph_node
*node
= cgraph_node (decl
);
1982 if (!DECL_EXTERNAL (decl
)
1983 && (!node
->local
.vtable_method
|| !cgraph_global_info_ready
1984 || !node
->local
.finalized
))
1985 cgraph_mark_needed_node (node
);
1987 else if (TREE_CODE (decl
) == VAR_DECL
)
1989 struct cgraph_varpool_node
*node
= cgraph_varpool_node (decl
);
1990 cgraph_varpool_mark_needed_node (node
);
1991 /* C++ frontend use mark_decl_references to force COMDAT variables
1992 to be output that might appear dead otherwise. */
1993 node
->force_output
= true;
1995 /* else do nothing - we can get various sorts of CST nodes here,
1996 which do not need to be marked. */
2000 ultimate_transparent_alias_target (tree
*alias
)
2002 tree target
= *alias
;
2004 if (IDENTIFIER_TRANSPARENT_ALIAS (target
))
2006 gcc_assert (TREE_CHAIN (target
));
2007 target
= ultimate_transparent_alias_target (&TREE_CHAIN (target
));
2008 gcc_assert (! IDENTIFIER_TRANSPARENT_ALIAS (target
)
2009 && ! TREE_CHAIN (target
));
2016 /* Output to FILE (an assembly file) a reference to NAME. If NAME
2017 starts with a *, the rest of NAME is output verbatim. Otherwise
2018 NAME is transformed in a target-specific way (usually by the
2019 addition of an underscore). */
2022 assemble_name_raw (FILE *file
, const char *name
)
2025 fputs (&name
[1], file
);
2027 ASM_OUTPUT_LABELREF (file
, name
);
2030 /* Like assemble_name_raw, but should be used when NAME might refer to
2031 an entity that is also represented as a tree (like a function or
2032 variable). If NAME does refer to such an entity, that entity will
2033 be marked as referenced. */
2036 assemble_name (FILE *file
, const char *name
)
2038 const char *real_name
;
2041 real_name
= targetm
.strip_name_encoding (name
);
2043 id
= maybe_get_identifier (real_name
);
2048 mark_referenced (id
);
2049 ultimate_transparent_alias_target (&id
);
2051 name
= IDENTIFIER_POINTER (id
);
2052 gcc_assert (! TREE_CHAIN (id
));
2055 assemble_name_raw (file
, name
);
2058 /* Allocate SIZE bytes writable static space with a gensym name
2059 and return an RTX to refer to its address. */
2062 assemble_static_space (unsigned HOST_WIDE_INT size
)
2065 const char *namestring
;
2069 if (flag_shared_data
)
2073 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
2075 namestring
= ggc_strdup (name
);
2077 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
2078 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
2080 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
2081 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
2084 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
2085 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
2088 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
2089 so that each uninitialized object starts on such a boundary. */
2090 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
2091 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
2092 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
2093 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
2094 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
2095 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
2102 /* Assemble the static constant template for function entry trampolines.
2103 This is done at most once per compilation.
2104 Returns an RTX for the address of the template. */
2106 static GTY(()) rtx initial_trampoline
;
2108 #ifdef TRAMPOLINE_TEMPLATE
2110 assemble_trampoline_template (void)
2117 if (initial_trampoline
)
2118 return initial_trampoline
;
2120 /* By default, put trampoline templates in read-only data section. */
2122 #ifdef TRAMPOLINE_SECTION
2123 TRAMPOLINE_SECTION ();
2125 readonly_data_section ();
2128 /* Write the assembler code to define one. */
2129 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
2132 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
2135 targetm
.asm_out
.internal_label (asm_out_file
, "LTRAMP", 0);
2136 TRAMPOLINE_TEMPLATE (asm_out_file
);
2138 /* Record the rtl to refer to it. */
2139 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
2140 name
= ggc_strdup (label
);
2141 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
2142 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2144 initial_trampoline
= gen_rtx_MEM (BLKmode
, symbol
);
2145 set_mem_align (initial_trampoline
, TRAMPOLINE_ALIGNMENT
);
2147 return initial_trampoline
;
2151 /* A and B are either alignments or offsets. Return the minimum alignment
2152 that may be assumed after adding the two together. */
2154 static inline unsigned
2155 min_align (unsigned int a
, unsigned int b
)
2157 return (a
| b
) & -(a
| b
);
2160 /* Return the assembler directive for creating a given kind of integer
2161 object. SIZE is the number of bytes in the object and ALIGNED_P
2162 indicates whether it is known to be aligned. Return NULL if the
2163 assembly dialect has no such directive.
2165 The returned string should be printed at the start of a new line and
2166 be followed immediately by the object's initial value. */
2169 integer_asm_op (int size
, int aligned_p
)
2171 struct asm_int_op
*ops
;
2174 ops
= &targetm
.asm_out
.aligned_op
;
2176 ops
= &targetm
.asm_out
.unaligned_op
;
2181 return targetm
.asm_out
.byte_op
;
2195 /* Use directive OP to assemble an integer object X. Print OP at the
2196 start of the line, followed immediately by the value of X. */
2199 assemble_integer_with_op (const char *op
, rtx x
)
2201 fputs (op
, asm_out_file
);
2202 output_addr_const (asm_out_file
, x
);
2203 fputc ('\n', asm_out_file
);
2206 /* The default implementation of the asm_out.integer target hook. */
2209 default_assemble_integer (rtx x ATTRIBUTE_UNUSED
,
2210 unsigned int size ATTRIBUTE_UNUSED
,
2211 int aligned_p ATTRIBUTE_UNUSED
)
2213 const char *op
= integer_asm_op (size
, aligned_p
);
2214 /* Avoid GAS bugs for large values. Specifically negative values whose
2215 absolute value fits in a bfd_vma, but not in a bfd_signed_vma. */
2216 if (size
> UNITS_PER_WORD
&& size
> POINTER_SIZE
/ BITS_PER_UNIT
)
2218 return op
&& (assemble_integer_with_op (op
, x
), true);
2221 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
2222 the alignment of the integer in bits. Return 1 if we were able to output
2223 the constant, otherwise 0. We must be able to output the constant,
2224 if FORCE is nonzero. */
2227 assemble_integer (rtx x
, unsigned int size
, unsigned int align
, int force
)
2231 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
2233 /* See if the target hook can handle this kind of object. */
2234 if (targetm
.asm_out
.integer (x
, size
, aligned_p
))
2237 /* If the object is a multi-byte one, try splitting it up. Split
2238 it into words it if is multi-word, otherwise split it into bytes. */
2241 enum machine_mode omode
, imode
;
2242 unsigned int subalign
;
2243 unsigned int subsize
, i
;
2245 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
2246 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
2247 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
2248 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
2250 for (i
= 0; i
< size
; i
+= subsize
)
2252 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
2253 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
2259 /* If we've printed some of it, but not all of it, there's no going
2264 gcc_assert (!force
);
2270 assemble_real (REAL_VALUE_TYPE d
, enum machine_mode mode
, unsigned int align
)
2274 int bitsize
, nelts
, nunits
, units_per
;
2276 /* This is hairy. We have a quantity of known size. real_to_target
2277 will put it into an array of *host* longs, 32 bits per element
2278 (even if long is more than 32 bits). We need to determine the
2279 number of array elements that are occupied (nelts) and the number
2280 of *target* min-addressable units that will be occupied in the
2281 object file (nunits). We cannot assume that 32 divides the
2282 mode's bitsize (size * BITS_PER_UNIT) evenly.
2284 size * BITS_PER_UNIT is used here to make sure that padding bits
2285 (which might appear at either end of the value; real_to_target
2286 will include the padding bits in its output array) are included. */
2288 nunits
= GET_MODE_SIZE (mode
);
2289 bitsize
= nunits
* BITS_PER_UNIT
;
2290 nelts
= CEIL (bitsize
, 32);
2291 units_per
= 32 / BITS_PER_UNIT
;
2293 real_to_target (data
, &d
, mode
);
2295 /* Put out the first word with the specified alignment. */
2296 assemble_integer (GEN_INT (data
[0]), MIN (nunits
, units_per
), align
, 1);
2297 nunits
-= units_per
;
2299 /* Subsequent words need only 32-bit alignment. */
2300 align
= min_align (align
, 32);
2302 for (i
= 1; i
< nelts
; i
++)
2304 assemble_integer (GEN_INT (data
[i
]), MIN (nunits
, units_per
), align
, 1);
2305 nunits
-= units_per
;
2309 /* Given an expression EXP with a constant value,
2310 reduce it to the sum of an assembler symbol and an integer.
2311 Store them both in the structure *VALUE.
2312 EXP must be reducible. */
2314 struct addr_const
GTY(())
2317 HOST_WIDE_INT offset
;
2321 decode_addr_const (tree exp
, struct addr_const
*value
)
2323 tree target
= TREE_OPERAND (exp
, 0);
2329 if (TREE_CODE (target
) == COMPONENT_REF
2330 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2333 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2334 target
= TREE_OPERAND (target
, 0);
2336 else if (TREE_CODE (target
) == ARRAY_REF
2337 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2339 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2340 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2341 target
= TREE_OPERAND (target
, 0);
2347 switch (TREE_CODE (target
))
2351 x
= DECL_RTL (target
);
2355 x
= gen_rtx_MEM (FUNCTION_MODE
,
2356 gen_rtx_LABEL_REF (Pmode
, force_label_rtx (target
)));
2364 x
= output_constant_def (target
, 1);
2371 gcc_assert (MEM_P (x
));
2375 value
->offset
= offset
;
2378 /* Uniquize all constants that appear in memory.
2379 Each constant in memory thus far output is recorded
2380 in `const_desc_table'. */
2382 struct constant_descriptor_tree
GTY(())
2384 /* A MEM for the constant. */
2387 /* The value of the constant. */
2390 /* Hash of value. Computing the hash from value each time
2391 hashfn is called can't work properly, as that means recursive
2392 use of the hash table during hash table expansion. */
2396 static GTY((param_is (struct constant_descriptor_tree
)))
2397 htab_t const_desc_htab
;
2399 static struct constant_descriptor_tree
* build_constant_desc (tree
);
2400 static void maybe_output_constant_def_contents (struct constant_descriptor_tree
*, int);
2402 /* Compute a hash code for a constant expression. */
2405 const_desc_hash (const void *ptr
)
2407 return ((struct constant_descriptor_tree
*)ptr
)->hash
;
2411 const_hash_1 (const tree exp
)
2416 enum tree_code code
= TREE_CODE (exp
);
2418 /* Either set P and LEN to the address and len of something to hash and
2419 exit the switch or return a value. */
2424 p
= (char *) &TREE_INT_CST (exp
);
2425 len
= sizeof TREE_INT_CST (exp
);
2429 return real_hash (TREE_REAL_CST_PTR (exp
));
2432 p
= TREE_STRING_POINTER (exp
);
2433 len
= TREE_STRING_LENGTH (exp
);
2437 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2438 + const_hash_1 (TREE_IMAGPART (exp
)));
2442 unsigned HOST_WIDE_INT idx
;
2445 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2447 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp
), idx
, value
)
2449 hi
= hi
* 603 + const_hash_1 (value
);
2457 struct addr_const value
;
2459 decode_addr_const (exp
, &value
);
2460 switch (GET_CODE (value
.base
))
2463 /* Don't hash the address of the SYMBOL_REF;
2464 only use the offset and the symbol name. */
2466 p
= XSTR (value
.base
, 0);
2467 for (i
= 0; p
[i
] != 0; i
++)
2468 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2472 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2483 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2484 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2488 case NON_LVALUE_EXPR
:
2489 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2492 /* A language specific constant. Just hash the code. */
2496 /* Compute hashing function. */
2498 for (i
= 0; i
< len
; i
++)
2499 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2504 /* Wrapper of compare_constant, for the htab interface. */
2506 const_desc_eq (const void *p1
, const void *p2
)
2508 const struct constant_descriptor_tree
*c1
= p1
;
2509 const struct constant_descriptor_tree
*c2
= p2
;
2510 if (c1
->hash
!= c2
->hash
)
2512 return compare_constant (c1
->value
, c2
->value
);
2515 /* Compare t1 and t2, and return 1 only if they are known to result in
2516 the same bit pattern on output. */
2519 compare_constant (const tree t1
, const tree t2
)
2521 enum tree_code typecode
;
2523 if (t1
== NULL_TREE
)
2524 return t2
== NULL_TREE
;
2525 if (t2
== NULL_TREE
)
2528 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2531 switch (TREE_CODE (t1
))
2534 /* Integer constants are the same only if the same width of type. */
2535 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2537 return tree_int_cst_equal (t1
, t2
);
2540 /* Real constants are the same only if the same width of type. */
2541 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2544 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2547 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2550 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2551 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2552 TREE_STRING_LENGTH (t1
)));
2555 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2556 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2560 VEC(constructor_elt
, gc
) *v1
, *v2
;
2561 unsigned HOST_WIDE_INT idx
;
2563 typecode
= TREE_CODE (TREE_TYPE (t1
));
2564 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2567 if (typecode
== ARRAY_TYPE
)
2569 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2570 /* For arrays, check that the sizes all match. */
2571 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2573 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2578 /* For record and union constructors, require exact type
2580 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2584 v1
= CONSTRUCTOR_ELTS (t1
);
2585 v2
= CONSTRUCTOR_ELTS (t2
);
2586 if (VEC_length (constructor_elt
, v1
)
2587 != VEC_length (constructor_elt
, v2
))
2590 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
2592 constructor_elt
*c1
= VEC_index (constructor_elt
, v1
, idx
);
2593 constructor_elt
*c2
= VEC_index (constructor_elt
, v2
, idx
);
2595 /* Check that each value is the same... */
2596 if (!compare_constant (c1
->value
, c2
->value
))
2598 /* ... and that they apply to the same fields! */
2599 if (typecode
== ARRAY_TYPE
)
2601 if (!compare_constant (c1
->index
, c2
->index
))
2606 if (c1
->index
!= c2
->index
)
2617 struct addr_const value1
, value2
;
2619 decode_addr_const (t1
, &value1
);
2620 decode_addr_const (t2
, &value2
);
2621 return (value1
.offset
== value2
.offset
2622 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2628 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2629 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2633 case NON_LVALUE_EXPR
:
2634 case VIEW_CONVERT_EXPR
:
2635 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2640 nt1
= lang_hooks
.expand_constant (t1
);
2641 nt2
= lang_hooks
.expand_constant (t2
);
2642 if (nt1
!= t1
|| nt2
!= t2
)
2643 return compare_constant (nt1
, nt2
);
2652 /* Make a copy of the whole tree structure for a constant. This
2653 handles the same types of nodes that compare_constant handles. */
2656 copy_constant (tree exp
)
2658 switch (TREE_CODE (exp
))
2661 /* For ADDR_EXPR, we do not want to copy the decl whose address
2662 is requested. We do want to copy constants though. */
2663 if (CONSTANT_CLASS_P (TREE_OPERAND (exp
, 0)))
2664 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2665 copy_constant (TREE_OPERAND (exp
, 0)));
2667 return copy_node (exp
);
2672 return copy_node (exp
);
2675 return build_complex (TREE_TYPE (exp
),
2676 copy_constant (TREE_REALPART (exp
)),
2677 copy_constant (TREE_IMAGPART (exp
)));
2681 return build2 (TREE_CODE (exp
), TREE_TYPE (exp
),
2682 copy_constant (TREE_OPERAND (exp
, 0)),
2683 copy_constant (TREE_OPERAND (exp
, 1)));
2687 case NON_LVALUE_EXPR
:
2688 case VIEW_CONVERT_EXPR
:
2689 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2690 copy_constant (TREE_OPERAND (exp
, 0)));
2694 tree copy
= copy_node (exp
);
2695 VEC(constructor_elt
, gc
) *v
;
2696 unsigned HOST_WIDE_INT idx
;
2697 tree purpose
, value
;
2699 v
= VEC_alloc(constructor_elt
, gc
, VEC_length(constructor_elt
,
2700 CONSTRUCTOR_ELTS (exp
)));
2701 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp
), idx
, purpose
, value
)
2703 constructor_elt
*ce
= VEC_quick_push (constructor_elt
, v
, NULL
);
2704 ce
->index
= purpose
;
2705 ce
->value
= copy_constant (value
);
2707 CONSTRUCTOR_ELTS (copy
) = v
;
2713 tree t
= lang_hooks
.expand_constant (exp
);
2715 gcc_assert (t
== exp
);
2716 return copy_constant (t
);
2721 /* Subroutine of output_constant_def:
2722 No constant equal to EXP is known to have been output.
2723 Make a constant descriptor to enter EXP in the hash table.
2724 Assign the label number and construct RTL to refer to the
2725 constant's location in memory.
2726 Caller is responsible for updating the hash table. */
2728 static struct constant_descriptor_tree
*
2729 build_constant_desc (tree exp
)
2735 struct constant_descriptor_tree
*desc
;
2737 desc
= ggc_alloc (sizeof (*desc
));
2738 desc
->value
= copy_constant (exp
);
2740 /* Propagate marked-ness to copied constant. */
2741 if (flag_mudflap
&& mf_marked_p (exp
))
2742 mf_mark (desc
->value
);
2744 /* Create a string containing the label name, in LABEL. */
2745 labelno
= const_labelno
++;
2746 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2748 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2749 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2750 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2751 SYMBOL_REF_DECL (symbol
) = desc
->value
;
2752 TREE_CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2754 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2755 set_mem_attributes (rtl
, exp
, 1);
2756 set_mem_alias_set (rtl
, 0);
2757 set_mem_alias_set (rtl
, const_alias_set
);
2759 /* Set flags or add text to the name to record information, such as
2760 that it is a local symbol. If the name is changed, the macro
2761 ASM_OUTPUT_LABELREF will have to know how to strip this
2762 information. This call might invalidate our local variable
2763 SYMBOL; we can't use it afterward. */
2765 targetm
.encode_section_info (exp
, rtl
, true);
2772 /* Return an rtx representing a reference to constant data in memory
2773 for the constant expression EXP.
2775 If assembler code for such a constant has already been output,
2776 return an rtx to refer to it.
2777 Otherwise, output such a constant in memory
2778 and generate an rtx for it.
2780 If DEFER is nonzero, this constant can be deferred and output only
2781 if referenced in the function after all optimizations.
2783 `const_desc_table' records which constants already have label strings. */
2786 output_constant_def (tree exp
, int defer
)
2788 struct constant_descriptor_tree
*desc
;
2789 struct constant_descriptor_tree key
;
2792 /* Look up EXP in the table of constant descriptors. If we didn't find
2793 it, create a new one. */
2795 key
.hash
= const_hash_1 (exp
);
2796 loc
= htab_find_slot_with_hash (const_desc_htab
, &key
, key
.hash
, INSERT
);
2801 desc
= build_constant_desc (exp
);
2802 desc
->hash
= key
.hash
;
2806 maybe_output_constant_def_contents (desc
, defer
);
2810 /* Subroutine of output_constant_def: Decide whether or not we need to
2811 output the constant DESC now, and if so, do it. */
2813 maybe_output_constant_def_contents (struct constant_descriptor_tree
*desc
,
2816 rtx symbol
= XEXP (desc
->rtl
, 0);
2817 tree exp
= desc
->value
;
2819 if (flag_syntax_only
)
2822 if (TREE_ASM_WRITTEN (exp
))
2823 /* Already output; don't do it again. */
2826 /* We can always defer constants as long as the context allows
2830 /* Increment n_deferred_constants if it exists. It needs to be at
2831 least as large as the number of constants actually referred to
2832 by the function. If it's too small we'll stop looking too early
2833 and fail to emit constants; if it's too large we'll only look
2834 through the entire function when we could have stopped earlier. */
2836 n_deferred_constants
++;
2840 output_constant_def_contents (symbol
);
2843 /* We must output the constant data referred to by SYMBOL; do so. */
2846 output_constant_def_contents (rtx symbol
)
2848 tree exp
= SYMBOL_REF_DECL (symbol
);
2849 const char *label
= XSTR (symbol
, 0);
2852 /* Make sure any other constants whose addresses appear in EXP
2853 are assigned label numbers. */
2854 int reloc
= compute_reloc_for_constant (exp
);
2856 /* Align the location counter as required by EXP's data type. */
2857 unsigned int align
= TYPE_ALIGN (TREE_TYPE (exp
));
2858 #ifdef CONSTANT_ALIGNMENT
2859 align
= CONSTANT_ALIGNMENT (exp
, align
);
2862 output_addressed_constants (exp
);
2864 /* We are no longer deferring this constant. */
2865 TREE_ASM_WRITTEN (exp
) = 1;
2867 if (IN_NAMED_SECTION (exp
))
2868 named_section (exp
, NULL
, reloc
);
2870 targetm
.asm_out
.select_section (exp
, reloc
, align
);
2872 if (align
> BITS_PER_UNIT
)
2874 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2877 size
= int_size_in_bytes (TREE_TYPE (exp
));
2878 if (TREE_CODE (exp
) == STRING_CST
)
2879 size
= MAX (TREE_STRING_LENGTH (exp
), size
);
2881 /* Do any machine/system dependent processing of the constant. */
2882 #ifdef ASM_DECLARE_CONSTANT_NAME
2883 ASM_DECLARE_CONSTANT_NAME (asm_out_file
, label
, exp
, size
);
2885 /* Standard thing is just output label for the constant. */
2886 ASM_OUTPUT_LABEL (asm_out_file
, label
);
2887 #endif /* ASM_DECLARE_CONSTANT_NAME */
2889 /* Output the value of EXP. */
2890 output_constant (exp
, size
, align
);
2892 mudflap_enqueue_constant (exp
);
2895 /* Look up EXP in the table of constant descriptors. Return the rtl
2896 if it has been emitted, else null. */
2899 lookup_constant_def (tree exp
)
2901 struct constant_descriptor_tree
*desc
;
2902 struct constant_descriptor_tree key
;
2905 key
.hash
= const_hash_1 (exp
);
2906 desc
= htab_find_with_hash (const_desc_htab
, &key
, key
.hash
);
2908 return (desc
? desc
->rtl
: NULL_RTX
);
2911 /* Used in the hash tables to avoid outputting the same constant
2912 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2913 are output once per function, not once per file. */
2914 /* ??? Only a few targets need per-function constant pools. Most
2915 can use one per-file pool. Should add a targetm bit to tell the
2918 struct rtx_constant_pool
GTY(())
2920 /* Pointers to first and last constant in pool, as ordered by offset. */
2921 struct constant_descriptor_rtx
*first
;
2922 struct constant_descriptor_rtx
*last
;
2924 /* Hash facility for making memory-constants from constant rtl-expressions.
2925 It is used on RISC machines where immediate integer arguments and
2926 constant addresses are restricted so that such constants must be stored
2928 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_htab
;
2929 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_sym_htab
;
2931 /* Current offset in constant pool (does not include any
2932 machine-specific header). */
2933 HOST_WIDE_INT offset
;
2936 struct constant_descriptor_rtx
GTY((chain_next ("%h.next")))
2938 struct constant_descriptor_rtx
*next
;
2942 HOST_WIDE_INT offset
;
2944 enum machine_mode mode
;
2950 /* Hash and compare functions for const_rtx_htab. */
2953 const_desc_rtx_hash (const void *ptr
)
2955 const struct constant_descriptor_rtx
*desc
= ptr
;
2960 const_desc_rtx_eq (const void *a
, const void *b
)
2962 const struct constant_descriptor_rtx
*x
= a
;
2963 const struct constant_descriptor_rtx
*y
= b
;
2965 if (x
->mode
!= y
->mode
)
2967 return rtx_equal_p (x
->constant
, y
->constant
);
2970 /* Hash and compare functions for const_rtx_sym_htab. */
2973 const_desc_rtx_sym_hash (const void *ptr
)
2975 const struct constant_descriptor_rtx
*desc
= ptr
;
2976 return htab_hash_string (XSTR (desc
->sym
, 0));
2980 const_desc_rtx_sym_eq (const void *a
, const void *b
)
2982 const struct constant_descriptor_rtx
*x
= a
;
2983 const struct constant_descriptor_rtx
*y
= b
;
2984 return XSTR (x
->sym
, 0) == XSTR (y
->sym
, 0);
2987 /* This is the worker function for const_rtx_hash, called via for_each_rtx. */
2990 const_rtx_hash_1 (rtx
*xp
, void *data
)
2992 unsigned HOST_WIDE_INT hwi
;
2993 enum machine_mode mode
;
2999 code
= GET_CODE (x
);
3000 mode
= GET_MODE (x
);
3001 h
= (hashval_t
) code
* 1048573 + mode
;
3009 const int shift
= sizeof (hashval_t
) * CHAR_BIT
;
3010 const int n
= sizeof (HOST_WIDE_INT
) / sizeof (hashval_t
);
3013 h
^= (hashval_t
) hwi
;
3014 for (i
= 1; i
< n
; ++i
)
3017 h
^= (hashval_t
) hwi
;
3023 if (mode
== VOIDmode
)
3025 hwi
= CONST_DOUBLE_LOW (x
) ^ CONST_DOUBLE_HIGH (x
);
3029 h
^= real_hash (CONST_DOUBLE_REAL_VALUE (x
));
3035 for (i
= XVECLEN (x
, 0); i
-- > 0; )
3036 h
= h
* 251 + const_rtx_hash_1 (&XVECEXP (x
, 0, i
), data
);
3041 h
^= htab_hash_string (XSTR (x
, 0));
3045 h
= h
* 251 + CODE_LABEL_NUMBER (XEXP (x
, 0));
3049 case UNSPEC_VOLATILE
:
3050 h
= h
* 251 + XINT (x
, 1);
3058 *hp
= *hp
* 509 + h
;
3062 /* Compute a hash value for X, which should be a constant. */
3065 const_rtx_hash (rtx x
)
3068 for_each_rtx (&x
, const_rtx_hash_1
, &h
);
3073 /* Initialize constant pool hashing for a new function. */
3076 init_varasm_status (struct function
*f
)
3078 struct varasm_status
*p
;
3079 struct rtx_constant_pool
*pool
;
3081 p
= ggc_alloc (sizeof (struct varasm_status
));
3084 pool
= ggc_alloc (sizeof (struct rtx_constant_pool
));
3086 p
->deferred_constants
= 0;
3088 pool
->const_rtx_htab
= htab_create_ggc (31, const_desc_rtx_hash
,
3089 const_desc_rtx_eq
, NULL
);
3090 pool
->const_rtx_sym_htab
= htab_create_ggc (31, const_desc_rtx_sym_hash
,
3091 const_desc_rtx_sym_eq
, NULL
);
3092 pool
->first
= pool
->last
= NULL
;
3096 /* Given a MINUS expression, simplify it if both sides
3097 include the same symbol. */
3100 simplify_subtraction (rtx x
)
3102 rtx r
= simplify_rtx (x
);
3106 /* Given a constant rtx X, make (or find) a memory constant for its value
3107 and return a MEM rtx to refer to it in memory. */
3110 force_const_mem (enum machine_mode mode
, rtx x
)
3112 struct constant_descriptor_rtx
*desc
, tmp
;
3113 struct rtx_constant_pool
*pool
= cfun
->varasm
->pool
;
3120 /* If we're not allowed to drop X into the constant pool, don't. */
3121 if (targetm
.cannot_force_const_mem (x
))
3124 /* Lookup the value in the hashtable. */
3127 hash
= const_rtx_hash (x
);
3128 slot
= htab_find_slot_with_hash (pool
->const_rtx_htab
, &tmp
, hash
, INSERT
);
3131 /* If the constant was already present, return its memory. */
3133 return copy_rtx (desc
->mem
);
3135 /* Otherwise, create a new descriptor. */
3136 desc
= ggc_alloc (sizeof (*desc
));
3139 /* Align the location counter as required by EXP's data type. */
3140 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
3141 #ifdef CONSTANT_ALIGNMENT
3143 tree type
= lang_hooks
.types
.type_for_mode (mode
, 0);
3144 if (type
!= NULL_TREE
)
3145 align
= CONSTANT_ALIGNMENT (make_tree (type
, x
), align
);
3149 pool
->offset
+= (align
/ BITS_PER_UNIT
) - 1;
3150 pool
->offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
3153 desc
->constant
= tmp
.constant
;
3154 desc
->offset
= pool
->offset
;
3157 desc
->align
= align
;
3158 desc
->labelno
= const_labelno
;
3161 pool
->offset
+= GET_MODE_SIZE (mode
);
3163 pool
->last
->next
= desc
;
3165 pool
->first
= pool
->last
= desc
;
3168 /* Create a string containing the label name, in LABEL. */
3169 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3172 /* Construct the SYMBOL_REF. Make sure to mark it as belonging to
3173 the constants pool. */
3174 desc
->sym
= symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
3175 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
3176 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
3177 current_function_uses_const_pool
= 1;
3179 /* Insert the descriptor into the symbol cross-reference table too. */
3180 slot
= htab_find_slot (pool
->const_rtx_sym_htab
, desc
, INSERT
);
3181 gcc_assert (!*slot
);
3184 /* Construct the MEM. */
3185 desc
->mem
= def
= gen_const_mem (mode
, symbol
);
3186 set_mem_attributes (def
, lang_hooks
.types
.type_for_mode (mode
, 0), 1);
3187 set_mem_align (def
, align
);
3189 /* If we're dropping a label to the constant pool, make sure we
3191 if (GET_CODE (x
) == LABEL_REF
)
3192 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
3194 return copy_rtx (def
);
3197 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3198 the corresponding constant_descriptor_rtx structure. */
3200 static struct constant_descriptor_rtx
*
3201 find_pool_constant (struct rtx_constant_pool
*pool
, rtx sym
)
3203 struct constant_descriptor_rtx tmp
;
3205 return htab_find (pool
->const_rtx_sym_htab
, &tmp
);
3208 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3211 get_pool_constant (rtx addr
)
3213 return find_pool_constant (cfun
->varasm
->pool
, addr
)->constant
;
3216 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3217 and whether it has been output or not. */
3220 get_pool_constant_mark (rtx addr
, bool *pmarked
)
3222 struct constant_descriptor_rtx
*desc
;
3224 desc
= find_pool_constant (cfun
->varasm
->pool
, addr
);
3225 *pmarked
= (desc
->mark
!= 0);
3226 return desc
->constant
;
3229 /* Likewise, but for the constant pool of a specific function. */
3232 get_pool_constant_for_function (struct function
*f
, rtx addr
)
3234 return find_pool_constant (f
->varasm
->pool
, addr
)->constant
;
3237 /* Similar, return the mode. */
3240 get_pool_mode (rtx addr
)
3242 return find_pool_constant (cfun
->varasm
->pool
, addr
)->mode
;
3245 /* Return the size of the constant pool. */
3248 get_pool_size (void)
3250 return cfun
->varasm
->pool
->offset
;
3253 /* Worker function for output_constant_pool_1. Emit assembly for X
3254 in MODE with known alignment ALIGN. */
3257 output_constant_pool_2 (enum machine_mode mode
, rtx x
, unsigned int align
)
3259 switch (GET_MODE_CLASS (mode
))
3265 gcc_assert (GET_CODE (x
) == CONST_DOUBLE
);
3266 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3267 assemble_real (r
, mode
, align
);
3272 case MODE_PARTIAL_INT
:
3273 assemble_integer (x
, GET_MODE_SIZE (mode
), align
, 1);
3276 case MODE_VECTOR_FLOAT
:
3277 case MODE_VECTOR_INT
:
3280 enum machine_mode submode
= GET_MODE_INNER (mode
);
3281 unsigned int subalign
= MIN (align
, GET_MODE_BITSIZE (submode
));
3283 gcc_assert (GET_CODE (x
) == CONST_VECTOR
);
3284 units
= CONST_VECTOR_NUNITS (x
);
3286 for (i
= 0; i
< units
; i
++)
3288 rtx elt
= CONST_VECTOR_ELT (x
, i
);
3289 output_constant_pool_2 (submode
, elt
, i
? subalign
: align
);
3299 /* Worker function for output_constant_pool. Emit POOL. */
3302 output_constant_pool_1 (struct constant_descriptor_rtx
*desc
)
3310 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3311 whose CODE_LABEL has been deleted. This can occur if a jump table
3312 is eliminated by optimization. If so, write a constant of zero
3313 instead. Note that this can also happen by turning the
3314 CODE_LABEL into a NOTE. */
3315 /* ??? This seems completely and utterly wrong. Certainly it's
3316 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3317 functioning even with INSN_DELETED_P and friends. */
3320 switch (GET_CODE (x
))
3323 if (GET_CODE (XEXP (x
, 0)) != PLUS
3324 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3326 tmp
= XEXP (XEXP (x
, 0), 0);
3331 gcc_assert (!INSN_DELETED_P (tmp
));
3332 gcc_assert (!NOTE_P (tmp
)
3333 || NOTE_LINE_NUMBER (tmp
) != NOTE_INSN_DELETED
);
3340 /* First switch to correct section. */
3341 targetm
.asm_out
.select_rtx_section (desc
->mode
, x
, desc
->align
);
3343 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3344 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, desc
->mode
,
3345 desc
->align
, desc
->labelno
, done
);
3348 assemble_align (desc
->align
);
3350 /* Output the label. */
3351 targetm
.asm_out
.internal_label (asm_out_file
, "LC", desc
->labelno
);
3353 /* Output the data. */
3354 output_constant_pool_2 (desc
->mode
, x
, desc
->align
);
3356 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3357 sections have proper size. */
3358 if (desc
->align
> GET_MODE_BITSIZE (desc
->mode
)
3359 && in_section
== in_named
3360 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3361 assemble_align (desc
->align
);
3363 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3369 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3370 to as used. Emit referenced deferred strings. This function can
3371 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3374 mark_constant (rtx
*current_rtx
, void *data
)
3376 struct rtx_constant_pool
*pool
= data
;
3377 rtx x
= *current_rtx
;
3379 if (x
== NULL_RTX
|| GET_CODE (x
) != SYMBOL_REF
)
3382 if (CONSTANT_POOL_ADDRESS_P (x
))
3384 struct constant_descriptor_rtx
*desc
= find_pool_constant (pool
, x
);
3385 if (desc
->mark
== 0)
3388 for_each_rtx (&desc
->constant
, mark_constant
, pool
);
3391 else if (TREE_CONSTANT_POOL_ADDRESS_P (x
))
3393 tree exp
= SYMBOL_REF_DECL (x
);
3394 if (!TREE_ASM_WRITTEN (exp
))
3396 n_deferred_constants
--;
3397 output_constant_def_contents (x
);
3404 /* Look through appropriate parts of INSN, marking all entries in the
3405 constant pool which are actually being used. Entries that are only
3406 referenced by other constants are also marked as used. Emit
3407 deferred strings that are used. */
3410 mark_constants (struct rtx_constant_pool
*pool
, rtx insn
)
3415 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3416 insns, not any notes that may be attached. We don't want to mark
3417 a constant just because it happens to appear in a REG_EQUIV note. */
3418 if (GET_CODE (PATTERN (insn
)) == SEQUENCE
)
3420 rtx seq
= PATTERN (insn
);
3421 int i
, n
= XVECLEN (seq
, 0);
3422 for (i
= 0; i
< n
; ++i
)
3424 rtx subinsn
= XVECEXP (seq
, 0, i
);
3425 if (INSN_P (subinsn
))
3426 for_each_rtx (&PATTERN (subinsn
), mark_constant
, pool
);
3430 for_each_rtx (&PATTERN (insn
), mark_constant
, pool
);
3433 /* Look through the instructions for this function, and mark all the
3434 entries in POOL which are actually being used. Emit deferred constants
3435 which have indeed been used. */
3438 mark_constant_pool (struct rtx_constant_pool
*pool
)
3442 if (pool
->first
== 0 && n_deferred_constants
== 0)
3445 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3446 mark_constants (pool
, insn
);
3448 for (link
= current_function_epilogue_delay_list
;
3450 link
= XEXP (link
, 1))
3451 mark_constants (pool
, XEXP (link
, 0));
3454 /* Write all the constants in the constant pool. */
3457 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED
,
3458 tree fndecl ATTRIBUTE_UNUSED
)
3460 struct rtx_constant_pool
*pool
= cfun
->varasm
->pool
;
3461 struct constant_descriptor_rtx
*desc
;
3463 /* It is possible for gcc to call force_const_mem and then to later
3464 discard the instructions which refer to the constant. In such a
3465 case we do not need to output the constant. */
3466 mark_constant_pool (pool
);
3468 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3469 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3472 for (desc
= pool
->first
; desc
; desc
= desc
->next
)
3473 output_constant_pool_1 (desc
);
3475 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3476 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3480 /* Determine what kind of relocations EXP may need. */
3483 compute_reloc_for_constant (tree exp
)
3485 int reloc
= 0, reloc2
;
3488 /* Give the front-end a chance to convert VALUE to something that
3489 looks more like a constant to the back-end. */
3490 exp
= lang_hooks
.expand_constant (exp
);
3492 switch (TREE_CODE (exp
))
3496 /* Go inside any operations that get_inner_reference can handle and see
3497 if what's inside is a constant: no need to do anything here for
3498 addresses of variables or functions. */
3499 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3500 tem
= TREE_OPERAND (tem
, 0))
3503 if (TREE_PUBLIC (tem
))
3510 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3511 reloc
|= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3515 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3516 reloc2
= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3517 /* The difference of two local labels is computable at link time. */
3518 if (reloc
== 1 && reloc2
== 1)
3526 case NON_LVALUE_EXPR
:
3527 case VIEW_CONVERT_EXPR
:
3528 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3533 unsigned HOST_WIDE_INT idx
;
3534 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp
), idx
, tem
)
3536 reloc
|= compute_reloc_for_constant (tem
);
3546 /* Find all the constants whose addresses are referenced inside of EXP,
3547 and make sure assembler code with a label has been output for each one.
3548 Indicate whether an ADDR_EXPR has been encountered. */
3551 output_addressed_constants (tree exp
)
3555 /* Give the front-end a chance to convert VALUE to something that
3556 looks more like a constant to the back-end. */
3557 exp
= lang_hooks
.expand_constant (exp
);
3559 switch (TREE_CODE (exp
))
3563 /* Go inside any operations that get_inner_reference can handle and see
3564 if what's inside is a constant: no need to do anything here for
3565 addresses of variables or functions. */
3566 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3567 tem
= TREE_OPERAND (tem
, 0))
3570 /* If we have an initialized CONST_DECL, retrieve the initializer. */
3571 if (TREE_CODE (tem
) == CONST_DECL
&& DECL_INITIAL (tem
))
3572 tem
= DECL_INITIAL (tem
);
3574 if (CONSTANT_CLASS_P (tem
) || TREE_CODE (tem
) == CONSTRUCTOR
)
3575 output_constant_def (tem
, 0);
3580 output_addressed_constants (TREE_OPERAND (exp
, 1));
3585 case NON_LVALUE_EXPR
:
3586 case VIEW_CONVERT_EXPR
:
3587 output_addressed_constants (TREE_OPERAND (exp
, 0));
3592 unsigned HOST_WIDE_INT idx
;
3593 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp
), idx
, tem
)
3595 output_addressed_constants (tem
);
3604 /* Return nonzero if VALUE is a valid constant-valued expression
3605 for use in initializing a static variable; one that can be an
3606 element of a "constant" initializer.
3608 Return null_pointer_node if the value is absolute;
3609 if it is relocatable, return the variable that determines the relocation.
3610 We assume that VALUE has been folded as much as possible;
3611 therefore, we do not need to check for such things as
3612 arithmetic-combinations of integers. */
3615 initializer_constant_valid_p (tree value
, tree endtype
)
3617 /* Give the front-end a chance to convert VALUE to something that
3618 looks more like a constant to the back-end. */
3619 value
= lang_hooks
.expand_constant (value
);
3621 switch (TREE_CODE (value
))
3624 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3625 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3626 && TREE_CONSTANT (value
)
3627 && !VEC_empty (constructor_elt
, CONSTRUCTOR_ELTS (value
)))
3629 unsigned HOST_WIDE_INT idx
;
3631 bool absolute
= true;
3633 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (value
), idx
, elt
)
3636 reloc
= initializer_constant_valid_p (elt
, TREE_TYPE (elt
));
3639 if (reloc
!= null_pointer_node
)
3642 /* For a non-absolute relocation, there is no single
3643 variable that can be "the variable that determines the
3645 return absolute
? null_pointer_node
: error_mark_node
;
3648 return TREE_STATIC (value
) ? null_pointer_node
: NULL_TREE
;
3655 return null_pointer_node
;
3659 value
= staticp (TREE_OPERAND (value
, 0));
3660 /* "&(*a).f" is like unto pointer arithmetic. If "a" turns out to
3661 be a constant, this is old-skool offsetof-like nonsense. */
3663 && TREE_CODE (value
) == INDIRECT_REF
3664 && TREE_CONSTANT (TREE_OPERAND (value
, 0)))
3665 return null_pointer_node
;
3666 /* Taking the address of a nested function involves a trampoline. */
3668 && TREE_CODE (value
) == FUNCTION_DECL
3669 && ((decl_function_context (value
) && !DECL_NO_STATIC_CHAIN (value
))
3670 || DECL_DLLIMPORT_P (value
)))
3674 case VIEW_CONVERT_EXPR
:
3675 case NON_LVALUE_EXPR
:
3676 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3685 src
= TREE_OPERAND (value
, 0);
3686 src_type
= TREE_TYPE (src
);
3687 dest_type
= TREE_TYPE (value
);
3689 /* Allow conversions between pointer types, floating-point
3690 types, and offset types. */
3691 if ((POINTER_TYPE_P (dest_type
) && POINTER_TYPE_P (src_type
))
3692 || (FLOAT_TYPE_P (dest_type
) && FLOAT_TYPE_P (src_type
))
3693 || (TREE_CODE (dest_type
) == OFFSET_TYPE
3694 && TREE_CODE (src_type
) == OFFSET_TYPE
))
3695 return initializer_constant_valid_p (src
, endtype
);
3697 /* Allow length-preserving conversions between integer types. */
3698 if (INTEGRAL_TYPE_P (dest_type
) && INTEGRAL_TYPE_P (src_type
)
3699 && (TYPE_PRECISION (dest_type
) == TYPE_PRECISION (src_type
)))
3700 return initializer_constant_valid_p (src
, endtype
);
3702 /* Allow conversions between other integer types only if
3704 if (INTEGRAL_TYPE_P (dest_type
) && INTEGRAL_TYPE_P (src_type
))
3706 tree inner
= initializer_constant_valid_p (src
, endtype
);
3707 if (inner
== null_pointer_node
)
3708 return null_pointer_node
;
3712 /* Allow (int) &foo provided int is as wide as a pointer. */
3713 if (INTEGRAL_TYPE_P (dest_type
) && POINTER_TYPE_P (src_type
)
3714 && (TYPE_PRECISION (dest_type
) >= TYPE_PRECISION (src_type
)))
3715 return initializer_constant_valid_p (src
, endtype
);
3717 /* Likewise conversions from int to pointers, but also allow
3718 conversions from 0. */
3719 if ((POINTER_TYPE_P (dest_type
)
3720 || TREE_CODE (dest_type
) == OFFSET_TYPE
)
3721 && INTEGRAL_TYPE_P (src_type
))
3723 if (integer_zerop (src
))
3724 return null_pointer_node
;
3725 else if (TYPE_PRECISION (dest_type
) <= TYPE_PRECISION (src_type
))
3726 return initializer_constant_valid_p (src
, endtype
);
3729 /* Allow conversions to struct or union types if the value
3731 if (TREE_CODE (dest_type
) == RECORD_TYPE
3732 || TREE_CODE (dest_type
) == UNION_TYPE
)
3733 return initializer_constant_valid_p (src
, endtype
);
3738 if (! INTEGRAL_TYPE_P (endtype
)
3739 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3741 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3743 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3745 /* If either term is absolute, use the other terms relocation. */
3746 if (valid0
== null_pointer_node
)
3748 if (valid1
== null_pointer_node
)
3754 if (! INTEGRAL_TYPE_P (endtype
)
3755 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3757 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3759 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3761 /* Win if second argument is absolute. */
3762 if (valid1
== null_pointer_node
)
3764 /* Win if both arguments have the same relocation.
3765 Then the value is absolute. */
3766 if (valid0
== valid1
&& valid0
!= 0)
3767 return null_pointer_node
;
3769 /* Since GCC guarantees that string constants are unique in the
3770 generated code, a subtraction between two copies of the same
3771 constant string is absolute. */
3772 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
3773 && valid1
&& TREE_CODE (valid1
) == STRING_CST
3774 && operand_equal_p (valid0
, valid1
, 1))
3775 return null_pointer_node
;
3778 /* Support narrowing differences. */
3779 if (INTEGRAL_TYPE_P (endtype
))
3783 op0
= TREE_OPERAND (value
, 0);
3784 op1
= TREE_OPERAND (value
, 1);
3786 /* Like STRIP_NOPS except allow the operand mode to widen.
3787 This works around a feature of fold that simplifies
3788 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3789 that the narrower operation is cheaper. */
3791 while (TREE_CODE (op0
) == NOP_EXPR
3792 || TREE_CODE (op0
) == CONVERT_EXPR
3793 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3795 tree inner
= TREE_OPERAND (op0
, 0);
3796 if (inner
== error_mark_node
3797 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3798 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3799 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3804 while (TREE_CODE (op1
) == NOP_EXPR
3805 || TREE_CODE (op1
) == CONVERT_EXPR
3806 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3808 tree inner
= TREE_OPERAND (op1
, 0);
3809 if (inner
== error_mark_node
3810 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3811 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3812 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3817 op0
= initializer_constant_valid_p (op0
, endtype
);
3818 op1
= initializer_constant_valid_p (op1
, endtype
);
3820 /* Both initializers must be known. */
3824 return null_pointer_node
;
3826 /* Support differences between labels. */
3827 if (TREE_CODE (op0
) == LABEL_DECL
3828 && TREE_CODE (op1
) == LABEL_DECL
)
3829 return null_pointer_node
;
3831 if (TREE_CODE (op0
) == STRING_CST
3832 && TREE_CODE (op1
) == STRING_CST
3833 && operand_equal_p (op0
, op1
, 1))
3834 return null_pointer_node
;
3846 /* Output assembler code for constant EXP to FILE, with no label.
3847 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3848 Assumes output_addressed_constants has been done on EXP already.
3850 Generate exactly SIZE bytes of assembler data, padding at the end
3851 with zeros if necessary. SIZE must always be specified.
3853 SIZE is important for structure constructors,
3854 since trailing members may have been omitted from the constructor.
3855 It is also important for initialization of arrays from string constants
3856 since the full length of the string constant might not be wanted.
3857 It is also needed for initialization of unions, where the initializer's
3858 type is just one member, and that may not be as long as the union.
3860 There a case in which we would fail to output exactly SIZE bytes:
3861 for a structure constructor that wants to produce more than SIZE bytes.
3862 But such constructors will never be generated for any possible input.
3864 ALIGN is the alignment of the data in bits. */
3867 output_constant (tree exp
, unsigned HOST_WIDE_INT size
, unsigned int align
)
3869 enum tree_code code
;
3870 unsigned HOST_WIDE_INT thissize
;
3872 /* Some front-ends use constants other than the standard language-independent
3873 varieties, but which may still be output directly. Give the front-end a
3874 chance to convert EXP to a language-independent representation. */
3875 exp
= lang_hooks
.expand_constant (exp
);
3877 if (size
== 0 || flag_syntax_only
)
3880 /* See if we're trying to initialize a pointer in a non-default mode
3881 to the address of some declaration somewhere. If the target says
3882 the mode is valid for pointers, assume the target has a way of
3884 if (TREE_CODE (exp
) == NOP_EXPR
3885 && POINTER_TYPE_P (TREE_TYPE (exp
))
3886 && targetm
.valid_pointer_mode (TYPE_MODE (TREE_TYPE (exp
))))
3888 tree saved_type
= TREE_TYPE (exp
);
3890 /* Peel off any intermediate conversions-to-pointer for valid
3892 while (TREE_CODE (exp
) == NOP_EXPR
3893 && POINTER_TYPE_P (TREE_TYPE (exp
))
3894 && targetm
.valid_pointer_mode (TYPE_MODE (TREE_TYPE (exp
))))
3895 exp
= TREE_OPERAND (exp
, 0);
3897 /* If what we're left with is the address of something, we can
3898 convert the address to the final type and output it that
3900 if (TREE_CODE (exp
) == ADDR_EXPR
)
3901 exp
= build1 (ADDR_EXPR
, saved_type
, TREE_OPERAND (exp
, 0));
3904 /* Eliminate any conversions since we'll be outputting the underlying
3906 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3907 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3908 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3910 HOST_WIDE_INT type_size
= int_size_in_bytes (TREE_TYPE (exp
));
3911 HOST_WIDE_INT op_size
= int_size_in_bytes (TREE_TYPE (TREE_OPERAND (exp
, 0)));
3913 /* Make sure eliminating the conversion is really a no-op, except with
3914 VIEW_CONVERT_EXPRs to allow for wild Ada unchecked conversions and
3915 union types to allow for Ada unchecked unions. */
3916 if (type_size
> op_size
3917 && TREE_CODE (exp
) != VIEW_CONVERT_EXPR
3918 && TREE_CODE (TREE_TYPE (exp
)) != UNION_TYPE
)
3919 internal_error ("no-op convert from %wd to %wd bytes in initializer",
3920 op_size
, type_size
);
3922 exp
= TREE_OPERAND (exp
, 0);
3925 code
= TREE_CODE (TREE_TYPE (exp
));
3926 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3928 /* Allow a constructor with no elements for any data type.
3929 This means to fill the space with zeros. */
3930 if (TREE_CODE (exp
) == CONSTRUCTOR
3931 && VEC_empty (constructor_elt
, CONSTRUCTOR_ELTS (exp
)))
3933 assemble_zeros (size
);
3937 if (TREE_CODE (exp
) == FDESC_EXPR
)
3939 #ifdef ASM_OUTPUT_FDESC
3940 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3941 tree decl
= TREE_OPERAND (exp
, 0);
3942 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3949 /* Now output the underlying data. If we've handling the padding, return.
3950 Otherwise, break and ensure SIZE is the size written. */
3958 case REFERENCE_TYPE
:
3960 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3961 EXPAND_INITIALIZER
),
3962 MIN (size
, thissize
), align
, 0))
3963 error ("initializer for integer value is too complicated");
3967 if (TREE_CODE (exp
) != REAL_CST
)
3968 error ("initializer for floating value is not a floating constant");
3970 assemble_real (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)), align
);
3974 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3975 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3976 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
3981 switch (TREE_CODE (exp
))
3984 output_constructor (exp
, size
, align
);
3987 thissize
= MIN ((unsigned HOST_WIDE_INT
)TREE_STRING_LENGTH (exp
),
3989 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
3996 unsigned int nalign
;
3997 enum machine_mode inner
;
3999 inner
= TYPE_MODE (TREE_TYPE (TREE_TYPE (exp
)));
4000 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
4002 elt_size
= GET_MODE_SIZE (inner
);
4004 link
= TREE_VECTOR_CST_ELTS (exp
);
4005 output_constant (TREE_VALUE (link
), elt_size
, align
);
4006 while ((link
= TREE_CHAIN (link
)) != NULL
)
4007 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
4017 gcc_assert (TREE_CODE (exp
) == CONSTRUCTOR
);
4018 output_constructor (exp
, size
, align
);
4028 if (size
> thissize
)
4029 assemble_zeros (size
- thissize
);
4033 /* Subroutine of output_constructor, used for computing the size of
4034 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4035 type with an unspecified upper bound. */
4037 static unsigned HOST_WIDE_INT
4038 array_size_for_constructor (tree val
)
4041 unsigned HOST_WIDE_INT cnt
;
4044 /* This code used to attempt to handle string constants that are not
4045 arrays of single-bytes, but nothing else does, so there's no point in
4047 if (TREE_CODE (val
) == STRING_CST
)
4048 return TREE_STRING_LENGTH (val
);
4050 max_index
= NULL_TREE
;
4051 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (val
), cnt
, index
, value
)
4053 if (TREE_CODE (index
) == RANGE_EXPR
)
4054 index
= TREE_OPERAND (index
, 1);
4055 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
4059 if (max_index
== NULL_TREE
)
4062 /* Compute the total number of array elements. */
4063 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
4065 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
4066 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
4068 /* Multiply by the array element unit size to find number of bytes. */
4069 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
4071 return tree_low_cst (i
, 1);
4074 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4075 Generate at least SIZE bytes, padding if necessary. */
4078 output_constructor (tree exp
, unsigned HOST_WIDE_INT size
,
4081 tree type
= TREE_TYPE (exp
);
4084 /* Number of bytes output or skipped so far.
4085 In other words, current position within the constructor. */
4086 HOST_WIDE_INT total_bytes
= 0;
4087 /* Nonzero means BYTE contains part of a byte, to be output. */
4088 int byte_buffer_in_use
= 0;
4090 unsigned HOST_WIDE_INT cnt
;
4091 constructor_elt
*ce
;
4093 gcc_assert (HOST_BITS_PER_WIDE_INT
>= BITS_PER_UNIT
);
4095 if (TREE_CODE (type
) == RECORD_TYPE
)
4096 field
= TYPE_FIELDS (type
);
4098 if (TREE_CODE (type
) == ARRAY_TYPE
4099 && TYPE_DOMAIN (type
) != 0)
4100 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
4102 /* As LINK goes through the elements of the constant,
4103 FIELD goes through the structure fields, if the constant is a structure.
4104 if the constant is a union, then we override this,
4105 by getting the field from the TREE_LIST element.
4106 But the constant could also be an array. Then FIELD is zero.
4108 There is always a maximum of one element in the chain LINK for unions
4109 (even if the initializer in a source program incorrectly contains
4112 VEC_iterate (constructor_elt
, CONSTRUCTOR_ELTS (exp
), cnt
, ce
);
4113 cnt
++, field
= field
? TREE_CHAIN (field
) : 0)
4115 tree val
= ce
->value
;
4118 /* The element in a union constructor specifies the proper field
4120 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4121 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4125 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4128 #ifdef ASM_COMMENT_START
4129 if (field
&& flag_verbose_asm
)
4130 fprintf (asm_out_file
, "%s %s:\n",
4133 ? IDENTIFIER_POINTER (DECL_NAME (field
))
4137 /* Eliminate the marker that makes a cast not be an lvalue. */
4141 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4143 unsigned HOST_WIDE_INT fieldsize
4144 = int_size_in_bytes (TREE_TYPE (type
));
4145 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
4146 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
4147 HOST_WIDE_INT index
;
4148 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
4150 for (index
= lo_index
; index
<= hi_index
; index
++)
4152 /* Output the element's initial value. */
4154 assemble_zeros (fieldsize
);
4156 output_constant (val
, fieldsize
, align2
);
4158 /* Count its size. */
4159 total_bytes
+= fieldsize
;
4162 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4164 /* An element that is not a bit-field. */
4166 unsigned HOST_WIDE_INT fieldsize
;
4167 /* Since this structure is static,
4168 we know the positions are constant. */
4169 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
4170 unsigned int align2
;
4173 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4174 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
4176 /* Output any buffered-up bit-fields preceding this element. */
4177 if (byte_buffer_in_use
)
4179 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4181 byte_buffer_in_use
= 0;
4184 /* Advance to offset of this element.
4185 Note no alignment needed in an array, since that is guaranteed
4186 if each element has the proper size. */
4187 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
4189 gcc_assert (pos
>= total_bytes
);
4190 assemble_zeros (pos
- total_bytes
);
4194 /* Find the alignment of this element. */
4195 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
4197 /* Determine size this element should occupy. */
4202 /* If this is an array with an unspecified upper bound,
4203 the initializer determines the size. */
4204 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4205 but we cannot do this until the deprecated support for
4206 initializing zero-length array members is removed. */
4207 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4208 && TYPE_DOMAIN (TREE_TYPE (field
))
4209 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4211 fieldsize
= array_size_for_constructor (val
);
4212 /* Given a non-empty initialization, this field had
4214 gcc_assert (!fieldsize
|| !TREE_CHAIN (field
));
4216 else if (DECL_SIZE_UNIT (field
))
4218 /* ??? This can't be right. If the decl size overflows
4219 a host integer we will silently emit no data. */
4220 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4221 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4225 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4227 /* Output the element's initial value. */
4229 assemble_zeros (fieldsize
);
4231 output_constant (val
, fieldsize
, align2
);
4233 /* Count its size. */
4234 total_bytes
+= fieldsize
;
4236 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4237 error ("invalid initial value for member %qs",
4238 IDENTIFIER_POINTER (DECL_NAME (field
)));
4241 /* Element that is a bit-field. */
4243 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4244 HOST_WIDE_INT end_offset
4245 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4248 val
= integer_zero_node
;
4250 /* If this field does not start in this (or, next) byte,
4252 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4254 /* Output remnant of any bit field in previous bytes. */
4255 if (byte_buffer_in_use
)
4257 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4259 byte_buffer_in_use
= 0;
4262 /* If still not at proper byte, advance to there. */
4263 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4265 gcc_assert (next_offset
/ BITS_PER_UNIT
>= total_bytes
);
4266 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4267 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4271 if (! byte_buffer_in_use
)
4274 /* We must split the element into pieces that fall within
4275 separate bytes, and combine each byte with previous or
4276 following bit-fields. */
4278 /* next_offset is the offset n fbits from the beginning of
4279 the structure to the next bit of this element to be processed.
4280 end_offset is the offset of the first bit past the end of
4282 while (next_offset
< end_offset
)
4286 HOST_WIDE_INT value
;
4287 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4288 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4290 /* Advance from byte to byte
4291 within this element when necessary. */
4292 while (next_byte
!= total_bytes
)
4294 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4299 /* Number of bits we can process at once
4300 (all part of the same byte). */
4301 this_time
= MIN (end_offset
- next_offset
,
4302 BITS_PER_UNIT
- next_bit
);
4303 if (BYTES_BIG_ENDIAN
)
4305 /* On big-endian machine, take the most significant bits
4306 first (of the bits that are significant)
4307 and put them into bytes from the most significant end. */
4308 shift
= end_offset
- next_offset
- this_time
;
4310 /* Don't try to take a bunch of bits that cross
4311 the word boundary in the INTEGER_CST. We can
4312 only select bits from the LOW or HIGH part
4314 if (shift
< HOST_BITS_PER_WIDE_INT
4315 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4317 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4318 shift
= HOST_BITS_PER_WIDE_INT
;
4321 /* Now get the bits from the appropriate constant word. */
4322 if (shift
< HOST_BITS_PER_WIDE_INT
)
4323 value
= TREE_INT_CST_LOW (val
);
4326 gcc_assert (shift
< 2 * HOST_BITS_PER_WIDE_INT
);
4327 value
= TREE_INT_CST_HIGH (val
);
4328 shift
-= HOST_BITS_PER_WIDE_INT
;
4331 /* Get the result. This works only when:
4332 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4333 byte
|= (((value
>> shift
)
4334 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4335 << (BITS_PER_UNIT
- this_time
- next_bit
));
4339 /* On little-endian machines,
4340 take first the least significant bits of the value
4341 and pack them starting at the least significant
4342 bits of the bytes. */
4343 shift
= next_offset
- int_bit_position (field
);
4345 /* Don't try to take a bunch of bits that cross
4346 the word boundary in the INTEGER_CST. We can
4347 only select bits from the LOW or HIGH part
4349 if (shift
< HOST_BITS_PER_WIDE_INT
4350 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4351 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4353 /* Now get the bits from the appropriate constant word. */
4354 if (shift
< HOST_BITS_PER_WIDE_INT
)
4355 value
= TREE_INT_CST_LOW (val
);
4358 gcc_assert (shift
< 2 * HOST_BITS_PER_WIDE_INT
);
4359 value
= TREE_INT_CST_HIGH (val
);
4360 shift
-= HOST_BITS_PER_WIDE_INT
;
4363 /* Get the result. This works only when:
4364 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4365 byte
|= (((value
>> shift
)
4366 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4370 next_offset
+= this_time
;
4371 byte_buffer_in_use
= 1;
4376 if (byte_buffer_in_use
)
4378 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4382 if ((unsigned HOST_WIDE_INT
)total_bytes
< size
)
4383 assemble_zeros (size
- total_bytes
);
4386 /* This TREE_LIST contains any weak symbol declarations waiting
4388 static GTY(()) tree weak_decls
;
4390 /* Mark DECL as weak. */
4393 mark_weak (tree decl
)
4395 DECL_WEAK (decl
) = 1;
4397 if (DECL_RTL_SET_P (decl
)
4398 && MEM_P (DECL_RTL (decl
))
4399 && XEXP (DECL_RTL (decl
), 0)
4400 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4401 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4404 /* Merge weak status between NEWDECL and OLDDECL. */
4407 merge_weak (tree newdecl
, tree olddecl
)
4409 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4411 if (DECL_WEAK (newdecl
) && SUPPORTS_WEAK
)
4414 /* We put the NEWDECL on the weak_decls list at some point
4415 and OLDDECL as well. Keep just OLDDECL on the list. */
4416 for (pwd
= &weak_decls
; *pwd
; pwd
= &TREE_CHAIN (*pwd
))
4417 if (TREE_VALUE (*pwd
) == newdecl
)
4419 *pwd
= TREE_CHAIN (*pwd
);
4426 if (DECL_WEAK (newdecl
))
4430 /* NEWDECL is weak, but OLDDECL is not. */
4432 /* If we already output the OLDDECL, we're in trouble; we can't
4433 go back and make it weak. This error cannot caught in
4434 declare_weak because the NEWDECL and OLDDECL was not yet
4435 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4436 if (TREE_ASM_WRITTEN (olddecl
))
4437 error ("weak declaration of %q+D must precede definition",
4440 /* If we've already generated rtl referencing OLDDECL, we may
4441 have done so in a way that will not function properly with
4443 else if (TREE_USED (olddecl
)
4444 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4445 warning (0, "weak declaration of %q+D after first use results "
4446 "in unspecified behavior", newdecl
);
4450 /* We put the NEWDECL on the weak_decls list at some point.
4451 Replace it with the OLDDECL. */
4452 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4453 if (TREE_VALUE (wd
) == newdecl
)
4455 TREE_VALUE (wd
) = olddecl
;
4458 /* We may not find the entry on the list. If NEWDECL is a
4459 weak alias, then we will have already called
4460 globalize_decl to remove the entry; in that case, we do
4461 not need to do anything. */
4464 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4465 mark_weak (olddecl
);
4468 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4469 weak. Just update NEWDECL to indicate that it's weak too. */
4470 mark_weak (newdecl
);
4473 /* Declare DECL to be a weak symbol. */
4476 declare_weak (tree decl
)
4478 if (! TREE_PUBLIC (decl
))
4479 error ("weak declaration of %q+D must be public", decl
);
4480 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4481 error ("weak declaration of %q+D must precede definition", decl
);
4482 else if (SUPPORTS_WEAK
)
4484 if (! DECL_WEAK (decl
))
4485 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4488 warning (0, "weak declaration of %q+D not supported", decl
);
4494 weak_finish_1 (tree decl
)
4496 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4497 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4500 if (! TREE_USED (decl
))
4503 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
))
4504 && lookup_attribute ("alias", DECL_ATTRIBUTES (decl
)))
4507 #ifdef ASM_WEAKEN_DECL
4508 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4510 #ifdef ASM_WEAKEN_LABEL
4511 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4513 #ifdef ASM_OUTPUT_WEAK_ALIAS
4515 static bool warn_once
= 0;
4518 warning (0, "only weak aliases are supported in this configuration");
4528 /* This TREE_LIST contains weakref targets. */
4530 static GTY(()) tree weakref_targets
;
4532 /* Forward declaration. */
4533 static tree
find_decl_and_mark_needed (tree decl
, tree target
);
4535 /* Emit any pending weak declarations. */
4542 for (t
= weakref_targets
; t
; t
= TREE_CHAIN (t
))
4544 tree alias_decl
= TREE_PURPOSE (t
);
4545 tree target
= ultimate_transparent_alias_target (&TREE_VALUE (t
));
4547 if (! TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (alias_decl
)))
4548 /* Remove alias_decl from the weak list, but leave entries for
4549 the target alone. */
4551 #ifndef ASM_OUTPUT_WEAKREF
4552 else if (! TREE_SYMBOL_REFERENCED (target
))
4554 # ifdef ASM_WEAKEN_LABEL
4555 ASM_WEAKEN_LABEL (asm_out_file
, IDENTIFIER_POINTER (target
));
4557 tree decl
= find_decl_and_mark_needed (alias_decl
, target
);
4561 decl
= build_decl (TREE_CODE (alias_decl
), target
,
4562 TREE_TYPE (alias_decl
));
4564 DECL_EXTERNAL (decl
) = 1;
4565 TREE_PUBLIC (decl
) = 1;
4566 DECL_ARTIFICIAL (decl
) = 1;
4567 TREE_NOTHROW (decl
) = TREE_NOTHROW (alias_decl
);
4568 TREE_USED (decl
) = 1;
4571 weak_finish_1 (decl
);
4580 /* Remove the alias and the target from the pending weak list
4581 so that we do not emit any .weak directives for the former,
4582 nor multiple .weak directives for the latter. */
4583 for (p
= &weak_decls
; (t2
= *p
) ; )
4585 if (TREE_VALUE (t2
) == alias_decl
4586 || target
== DECL_ASSEMBLER_NAME (TREE_VALUE (t2
)))
4587 *p
= TREE_CHAIN (t2
);
4589 p
= &TREE_CHAIN (t2
);
4592 /* Remove other weakrefs to the same target, to speed things up. */
4593 for (p
= &TREE_CHAIN (t
); (t2
= *p
) ; )
4595 if (target
== ultimate_transparent_alias_target (&TREE_VALUE (t2
)))
4596 *p
= TREE_CHAIN (t2
);
4598 p
= &TREE_CHAIN (t2
);
4603 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4605 tree decl
= TREE_VALUE (t
);
4607 weak_finish_1 (decl
);
4611 /* Emit the assembly bits to indicate that DECL is globally visible. */
4614 globalize_decl (tree decl
)
4616 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4618 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4619 if (DECL_WEAK (decl
))
4623 #ifdef ASM_WEAKEN_DECL
4624 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4626 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4629 /* Remove this function from the pending weak list so that
4630 we do not emit multiple .weak directives for it. */
4631 for (p
= &weak_decls
; (t
= *p
) ; )
4633 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4634 *p
= TREE_CHAIN (t
);
4636 p
= &TREE_CHAIN (t
);
4639 /* Remove weakrefs to the same target from the pending weakref
4640 list, for the same reason. */
4641 for (p
= &weakref_targets
; (t
= *p
) ; )
4643 if (DECL_ASSEMBLER_NAME (decl
)
4644 == ultimate_transparent_alias_target (&TREE_VALUE (t
)))
4645 *p
= TREE_CHAIN (t
);
4647 p
= &TREE_CHAIN (t
);
4652 #elif defined(ASM_MAKE_LABEL_LINKONCE)
4653 if (DECL_ONE_ONLY (decl
))
4654 ASM_MAKE_LABEL_LINKONCE (asm_out_file
, name
);
4657 targetm
.asm_out
.globalize_label (asm_out_file
, name
);
4660 /* We have to be able to tell cgraph about the needed-ness of the target
4661 of an alias. This requires that the decl have been defined. Aliases
4662 that precede their definition have to be queued for later processing. */
4664 typedef struct alias_pair
GTY(())
4670 /* Define gc'd vector type. */
4671 DEF_VEC_O(alias_pair
);
4672 DEF_VEC_ALLOC_O(alias_pair
,gc
);
4674 static GTY(()) VEC(alias_pair
,gc
) *alias_pairs
;
4676 /* Given an assembly name, find the decl it is associated with. At the
4677 same time, mark it needed for cgraph. */
4680 find_decl_and_mark_needed (tree decl
, tree target
)
4682 struct cgraph_node
*fnode
= NULL
;
4683 struct cgraph_varpool_node
*vnode
= NULL
;
4685 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4687 fnode
= cgraph_node_for_asm (target
);
4689 vnode
= cgraph_varpool_node_for_asm (target
);
4693 vnode
= cgraph_varpool_node_for_asm (target
);
4695 fnode
= cgraph_node_for_asm (target
);
4700 /* We can't mark function nodes as used after cgraph global info
4701 is finished. This wouldn't generally be necessary, but C++
4702 virtual table thunks are introduced late in the game and
4703 might seem like they need marking, although in fact they
4705 if (! cgraph_global_info_ready
)
4706 cgraph_mark_needed_node (fnode
);
4711 cgraph_varpool_mark_needed_node (vnode
);
4718 /* Output the assembler code for a define (equate) using ASM_OUTPUT_DEF
4719 or ASM_OUTPUT_DEF_FROM_DECLS. The function defines the symbol whose
4720 tree node is DECL to have the value of the tree node TARGET. */
4723 do_assemble_alias (tree decl
, tree target
)
4725 if (TREE_ASM_WRITTEN (decl
))
4728 TREE_ASM_WRITTEN (decl
) = 1;
4729 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4731 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
)))
4733 ultimate_transparent_alias_target (&target
);
4735 if (!TREE_SYMBOL_REFERENCED (target
))
4736 weakref_targets
= tree_cons (decl
, target
, weakref_targets
);
4738 #ifdef ASM_OUTPUT_WEAKREF
4739 ASM_OUTPUT_WEAKREF (asm_out_file
,
4740 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)),
4741 IDENTIFIER_POINTER (target
));
4745 error ("%Jweakref is not supported in this configuration", decl
);
4752 #ifdef ASM_OUTPUT_DEF
4753 /* Make name accessible from other files, if appropriate. */
4755 if (TREE_PUBLIC (decl
))
4757 globalize_decl (decl
);
4758 maybe_assemble_visibility (decl
);
4761 # ifdef ASM_OUTPUT_DEF_FROM_DECLS
4762 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4764 ASM_OUTPUT_DEF (asm_out_file
,
4765 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)),
4766 IDENTIFIER_POINTER (target
));
4768 #elif defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4773 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4774 # ifdef ASM_WEAKEN_DECL
4775 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4777 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4779 /* Remove this function from the pending weak list so that
4780 we do not emit multiple .weak directives for it. */
4781 for (p
= &weak_decls
; (t
= *p
) ; )
4782 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4783 *p
= TREE_CHAIN (t
);
4785 p
= &TREE_CHAIN (t
);
4787 /* Remove weakrefs to the same target from the pending weakref
4788 list, for the same reason. */
4789 for (p
= &weakref_targets
; (t
= *p
) ; )
4791 if (DECL_ASSEMBLER_NAME (decl
)
4792 == ultimate_transparent_alias_target (&TREE_VALUE (t
)))
4793 *p
= TREE_CHAIN (t
);
4795 p
= &TREE_CHAIN (t
);
4801 /* First pass of completing pending aliases. Make sure that cgraph knows
4802 which symbols will be required. */
4805 finish_aliases_1 (void)
4810 for (i
= 0; VEC_iterate (alias_pair
, alias_pairs
, i
, p
); i
++)
4814 target_decl
= find_decl_and_mark_needed (p
->decl
, p
->target
);
4815 if (target_decl
== NULL
)
4817 if (! lookup_attribute ("weakref", DECL_ATTRIBUTES (p
->decl
)))
4818 error ("%q+D aliased to undefined symbol %qs",
4819 p
->decl
, IDENTIFIER_POINTER (p
->target
));
4821 else if (DECL_EXTERNAL (target_decl
)
4822 && ! lookup_attribute ("weakref", DECL_ATTRIBUTES (p
->decl
)))
4823 error ("%q+D aliased to external symbol %qs",
4824 p
->decl
, IDENTIFIER_POINTER (p
->target
));
4828 /* Second pass of completing pending aliases. Emit the actual assembly.
4829 This happens at the end of compilation and thus it is assured that the
4830 target symbol has been emitted. */
4833 finish_aliases_2 (void)
4838 for (i
= 0; VEC_iterate (alias_pair
, alias_pairs
, i
, p
); i
++)
4839 do_assemble_alias (p
->decl
, p
->target
);
4841 VEC_truncate (alias_pair
, alias_pairs
, 0);
4844 /* Emit an assembler directive to make the symbol for DECL an alias to
4845 the symbol for TARGET. */
4848 assemble_alias (tree decl
, tree target
)
4851 bool is_weakref
= false;
4853 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
)))
4855 tree alias
= DECL_ASSEMBLER_NAME (decl
);
4859 ultimate_transparent_alias_target (&target
);
4861 if (alias
== target
)
4862 error ("weakref %q+D ultimately targets itself", decl
);
4865 #ifndef ASM_OUTPUT_WEAKREF
4866 IDENTIFIER_TRANSPARENT_ALIAS (alias
) = 1;
4867 TREE_CHAIN (alias
) = target
;
4873 #if !defined (ASM_OUTPUT_DEF)
4874 # if !defined(ASM_OUTPUT_WEAK_ALIAS) && !defined (ASM_WEAKEN_DECL)
4875 error ("%Jalias definitions not supported in this configuration", decl
);
4878 if (!DECL_WEAK (decl
))
4880 error ("%Jonly weak aliases are supported in this configuration", decl
);
4887 /* We must force creation of DECL_RTL for debug info generation, even though
4888 we don't use it here. */
4889 make_decl_rtl (decl
);
4890 TREE_USED (decl
) = 1;
4892 /* A quirk of the initial implementation of aliases required that the user
4893 add "extern" to all of them. Which is silly, but now historical. Do
4894 note that the symbol is in fact locally defined. */
4896 DECL_EXTERNAL (decl
) = 0;
4898 /* Allow aliases to aliases. */
4899 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4900 cgraph_node (decl
)->alias
= true;
4902 cgraph_varpool_node (decl
)->alias
= true;
4904 /* If the target has already been emitted, we don't have to queue the
4905 alias. This saves a tad o memory. */
4906 target_decl
= find_decl_and_mark_needed (decl
, target
);
4907 if (target_decl
&& TREE_ASM_WRITTEN (target_decl
))
4908 do_assemble_alias (decl
, target
);
4911 alias_pair
*p
= VEC_safe_push (alias_pair
, gc
, alias_pairs
, NULL
);
4917 /* Emit an assembler directive to set symbol for DECL visibility to
4918 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4921 default_assemble_visibility (tree decl
, int vis
)
4923 static const char * const visibility_types
[] = {
4924 NULL
, "internal", "hidden", "protected"
4927 const char *name
, *type
;
4929 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4930 type
= visibility_types
[vis
];
4932 #ifdef HAVE_GAS_HIDDEN
4933 fprintf (asm_out_file
, "\t.%s\t", type
);
4934 assemble_name (asm_out_file
, name
);
4935 fprintf (asm_out_file
, "\n");
4937 warning (OPT_Wattributes
, "visibility attribute not supported "
4938 "in this configuration; ignored");
4942 /* A helper function to call assemble_visibility when needed for a decl. */
4945 maybe_assemble_visibility (tree decl
)
4947 enum symbol_visibility vis
= DECL_VISIBILITY (decl
);
4949 if (vis
!= VISIBILITY_DEFAULT
)
4950 targetm
.asm_out
.visibility (decl
, vis
);
4953 /* Returns 1 if the target configuration supports defining public symbols
4954 so that one of them will be chosen at link time instead of generating a
4955 multiply-defined symbol error, whether through the use of weak symbols or
4956 a target-specific mechanism for having duplicates discarded. */
4959 supports_one_only (void)
4961 if (SUPPORTS_ONE_ONLY
)
4963 return SUPPORTS_WEAK
;
4966 /* Set up DECL as a public symbol that can be defined in multiple
4967 translation units without generating a linker error. */
4970 make_decl_one_only (tree decl
)
4972 gcc_assert (TREE_CODE (decl
) == VAR_DECL
4973 || TREE_CODE (decl
) == FUNCTION_DECL
);
4975 TREE_PUBLIC (decl
) = 1;
4977 if (SUPPORTS_ONE_ONLY
)
4979 #ifdef MAKE_DECL_ONE_ONLY
4980 MAKE_DECL_ONE_ONLY (decl
);
4982 DECL_ONE_ONLY (decl
) = 1;
4984 else if (TREE_CODE (decl
) == VAR_DECL
4985 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4986 DECL_COMMON (decl
) = 1;
4989 gcc_assert (SUPPORTS_WEAK
);
4990 DECL_WEAK (decl
) = 1;
4995 init_varasm_once (void)
4997 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4998 in_named_entry_eq
, NULL
);
4999 const_desc_htab
= htab_create_ggc (1009, const_desc_hash
,
5000 const_desc_eq
, NULL
);
5002 const_alias_set
= new_alias_set ();
5006 decl_default_tls_model (tree decl
)
5008 enum tls_model kind
;
5011 is_local
= targetm
.binds_local_p (decl
);
5015 kind
= TLS_MODEL_LOCAL_EXEC
;
5017 kind
= TLS_MODEL_INITIAL_EXEC
;
5020 /* Local dynamic is inefficient when we're not combining the
5021 parts of the address. */
5022 else if (optimize
&& is_local
)
5023 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
5025 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
5026 if (kind
< flag_tls_default
)
5027 kind
= flag_tls_default
;
5032 /* Select a set of attributes for section NAME based on the properties
5033 of DECL and whether or not RELOC indicates that DECL's initializer
5034 might contain runtime relocations.
5036 We make the section read-only and executable for a function decl,
5037 read-only for a const data decl, and writable for a non-const data decl. */
5040 default_section_type_flags (tree decl
, const char *name
, int reloc
)
5042 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
5046 default_section_type_flags_1 (tree decl
, const char *name
, int reloc
,
5051 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
5052 flags
= SECTION_CODE
;
5053 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
5055 else if (current_function_decl
5057 && cfun
->unlikely_text_section_name
5058 && strcmp (name
, cfun
->unlikely_text_section_name
) == 0)
5059 flags
= SECTION_CODE
;
5061 && (!current_function_decl
|| !cfun
)
5062 && strcmp (name
, UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) == 0)
5063 flags
= SECTION_CODE
;
5065 flags
= SECTION_WRITE
;
5067 if (decl
&& DECL_ONE_ONLY (decl
))
5068 flags
|= SECTION_LINKONCE
;
5070 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (decl
))
5071 flags
|= SECTION_TLS
| SECTION_WRITE
;
5073 if (strcmp (name
, ".bss") == 0
5074 || strncmp (name
, ".bss.", 5) == 0
5075 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
5076 || strcmp (name
, ".sbss") == 0
5077 || strncmp (name
, ".sbss.", 6) == 0
5078 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0)
5079 flags
|= SECTION_BSS
;
5081 if (strcmp (name
, ".tdata") == 0
5082 || strncmp (name
, ".tdata.", 7) == 0
5083 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0)
5084 flags
|= SECTION_TLS
;
5086 if (strcmp (name
, ".tbss") == 0
5087 || strncmp (name
, ".tbss.", 6) == 0
5088 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
5089 flags
|= SECTION_TLS
| SECTION_BSS
;
5091 /* These three sections have special ELF types. They are neither
5092 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
5093 want to print a section type (@progbits or @nobits). If someone
5094 is silly enough to emit code or TLS variables to one of these
5095 sections, then don't handle them specially. */
5096 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
5097 && (strcmp (name
, ".init_array") == 0
5098 || strcmp (name
, ".fini_array") == 0
5099 || strcmp (name
, ".preinit_array") == 0))
5100 flags
|= SECTION_NOTYPE
;
5105 /* Output assembly to switch to section NAME with attribute FLAGS.
5106 Four variants for common object file formats. */
5109 default_no_named_section (const char *name ATTRIBUTE_UNUSED
,
5110 unsigned int flags ATTRIBUTE_UNUSED
,
5111 tree decl ATTRIBUTE_UNUSED
)
5113 /* Some object formats don't support named sections at all. The
5114 front-end should already have flagged this as an error. */
5119 default_elf_asm_named_section (const char *name
, unsigned int flags
,
5120 tree decl ATTRIBUTE_UNUSED
)
5122 char flagchars
[10], *f
= flagchars
;
5124 /* If we have already declared this section, we can use an
5125 abbreviated form to switch back to it -- unless this section is
5126 part of a COMDAT groups, in which case GAS requires the full
5127 declaration every time. */
5128 if (!(HAVE_COMDAT_GROUP
&& (flags
& SECTION_LINKONCE
))
5129 && ! named_section_first_declaration (name
))
5131 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
5135 if (!(flags
& SECTION_DEBUG
))
5137 if (flags
& SECTION_WRITE
)
5139 if (flags
& SECTION_CODE
)
5141 if (flags
& SECTION_SMALL
)
5143 if (flags
& SECTION_MERGE
)
5145 if (flags
& SECTION_STRINGS
)
5147 if (flags
& SECTION_TLS
)
5149 if (HAVE_COMDAT_GROUP
&& (flags
& SECTION_LINKONCE
))
5153 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
5155 if (!(flags
& SECTION_NOTYPE
))
5160 if (flags
& SECTION_BSS
)
5166 #ifdef ASM_COMMENT_START
5167 /* On platforms that use "@" as the assembly comment character,
5169 if (strcmp (ASM_COMMENT_START
, "@") == 0)
5172 fprintf (asm_out_file
, format
, type
);
5174 if (flags
& SECTION_ENTSIZE
)
5175 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
5176 if (HAVE_COMDAT_GROUP
&& (flags
& SECTION_LINKONCE
))
5177 fprintf (asm_out_file
, ",%s,comdat",
5178 lang_hooks
.decls
.comdat_group (decl
));
5181 putc ('\n', asm_out_file
);
5185 default_coff_asm_named_section (const char *name
, unsigned int flags
,
5186 tree decl ATTRIBUTE_UNUSED
)
5188 char flagchars
[8], *f
= flagchars
;
5190 if (flags
& SECTION_WRITE
)
5192 if (flags
& SECTION_CODE
)
5196 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
5200 default_pe_asm_named_section (const char *name
, unsigned int flags
,
5203 default_coff_asm_named_section (name
, flags
, decl
);
5205 if (flags
& SECTION_LINKONCE
)
5207 /* Functions may have been compiled at various levels of
5208 optimization so we can't use `same_size' here.
5209 Instead, have the linker pick one. */
5210 fprintf (asm_out_file
, "\t.linkonce %s\n",
5211 (flags
& SECTION_CODE
? "discard" : "same_size"));
5215 /* The lame default section selector. */
5218 default_select_section (tree decl
, int reloc
,
5219 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
5221 bool readonly
= false;
5225 if (decl_readonly_section (decl
, reloc
))
5228 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
5230 if (! ((flag_pic
&& reloc
)
5231 || !TREE_READONLY (decl
)
5232 || TREE_SIDE_EFFECTS (decl
)
5233 || !TREE_CONSTANT (decl
)))
5236 else if (TREE_CODE (decl
) == STRING_CST
)
5238 else if (! (flag_pic
&& reloc
))
5242 readonly_data_section ();
5247 enum section_category
5248 categorize_decl_for_section (tree decl
, int reloc
, int shlib
)
5250 enum section_category ret
;
5252 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5254 else if (TREE_CODE (decl
) == STRING_CST
)
5256 if (flag_mudflap
) /* or !flag_merge_constants */
5257 return SECCAT_RODATA
;
5259 return SECCAT_RODATA_MERGE_STR
;
5261 else if (TREE_CODE (decl
) == VAR_DECL
)
5263 if (DECL_INITIAL (decl
) == NULL
5264 || DECL_INITIAL (decl
) == error_mark_node
5265 || (flag_zero_initialized_in_bss
5266 /* Leave constant zeroes in .rodata so they can be shared. */
5267 && !TREE_READONLY (decl
)
5268 && initializer_zerop (DECL_INITIAL (decl
))))
5270 else if (! TREE_READONLY (decl
)
5271 || TREE_SIDE_EFFECTS (decl
)
5272 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
5274 if (shlib
&& (reloc
& 2))
5275 ret
= SECCAT_DATA_REL
;
5276 else if (shlib
&& reloc
)
5277 ret
= SECCAT_DATA_REL_LOCAL
;
5281 else if (shlib
&& (reloc
& 2))
5282 ret
= SECCAT_DATA_REL_RO
;
5283 else if (shlib
&& reloc
)
5284 ret
= SECCAT_DATA_REL_RO_LOCAL
;
5285 else if (reloc
|| flag_merge_constants
< 2)
5286 /* C and C++ don't allow different variables to share the same
5287 location. -fmerge-all-constants allows even that (at the
5288 expense of not conforming). */
5289 ret
= SECCAT_RODATA
;
5290 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
5291 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
5293 ret
= SECCAT_RODATA_MERGE_CONST
;
5295 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
5297 if ((shlib
&& reloc
)
5298 || TREE_SIDE_EFFECTS (decl
)
5299 || ! TREE_CONSTANT (decl
))
5302 ret
= SECCAT_RODATA
;
5305 ret
= SECCAT_RODATA
;
5307 /* There are no read-only thread-local sections. */
5308 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (decl
))
5310 /* Note that this would be *just* SECCAT_BSS, except that there's
5311 no concept of a read-only thread-local-data section. */
5312 if (ret
== SECCAT_BSS
5313 || (flag_zero_initialized_in_bss
5314 && initializer_zerop (DECL_INITIAL (decl
))))
5320 /* If the target uses small data sections, select it. */
5321 else if (targetm
.in_small_data_p (decl
))
5323 if (ret
== SECCAT_BSS
)
5325 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
5326 ret
= SECCAT_SRODATA
;
5335 decl_readonly_section (tree decl
, int reloc
)
5337 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
5341 decl_readonly_section_1 (tree decl
, int reloc
, int shlib
)
5343 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5346 case SECCAT_RODATA_MERGE_STR
:
5347 case SECCAT_RODATA_MERGE_STR_INIT
:
5348 case SECCAT_RODATA_MERGE_CONST
:
5349 case SECCAT_SRODATA
:
5358 /* Select a section based on the above categorization. */
5361 default_elf_select_section (tree decl
, int reloc
,
5362 unsigned HOST_WIDE_INT align
)
5364 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
5368 default_elf_select_section_1 (tree decl
, int reloc
,
5369 unsigned HOST_WIDE_INT align
, int shlib
)
5372 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5375 /* We're not supposed to be called on FUNCTION_DECLs. */
5378 readonly_data_section ();
5380 case SECCAT_RODATA_MERGE_STR
:
5381 mergeable_string_section (decl
, align
, 0);
5383 case SECCAT_RODATA_MERGE_STR_INIT
:
5384 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
5386 case SECCAT_RODATA_MERGE_CONST
:
5387 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
5389 case SECCAT_SRODATA
:
5395 case SECCAT_DATA_REL
:
5396 sname
= ".data.rel";
5398 case SECCAT_DATA_REL_LOCAL
:
5399 sname
= ".data.rel.local";
5401 case SECCAT_DATA_REL_RO
:
5402 sname
= ".data.rel.ro";
5404 case SECCAT_DATA_REL_RO_LOCAL
:
5405 sname
= ".data.rel.ro.local";
5414 #ifdef BSS_SECTION_ASM_OP
5433 named_section (decl
, sname
, reloc
);
5436 /* Construct a unique section name based on the decl name and the
5437 categorization performed above. */
5440 default_unique_section (tree decl
, int reloc
)
5442 default_unique_section_1 (decl
, reloc
, flag_pic
);
5446 default_unique_section_1 (tree decl
, int reloc
, int shlib
)
5448 /* We only need to use .gnu.linkonce if we don't have COMDAT groups. */
5449 bool one_only
= DECL_ONE_ONLY (decl
) && !HAVE_COMDAT_GROUP
;
5450 const char *prefix
, *name
;
5454 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5457 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
5460 case SECCAT_RODATA_MERGE_STR
:
5461 case SECCAT_RODATA_MERGE_STR_INIT
:
5462 case SECCAT_RODATA_MERGE_CONST
:
5463 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
5465 case SECCAT_SRODATA
:
5466 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
5469 case SECCAT_DATA_REL
:
5470 case SECCAT_DATA_REL_LOCAL
:
5471 case SECCAT_DATA_REL_RO
:
5472 case SECCAT_DATA_REL_RO_LOCAL
:
5473 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
5476 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
5479 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
5482 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
5485 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
5488 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
5493 plen
= strlen (prefix
);
5495 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5496 name
= targetm
.strip_name_encoding (name
);
5497 nlen
= strlen (name
);
5499 string
= alloca (nlen
+ plen
+ 1);
5500 memcpy (string
, prefix
, plen
);
5501 memcpy (string
+ plen
, name
, nlen
+ 1);
5503 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
5507 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
5509 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
5512 switch (GET_CODE (x
))
5524 readonly_data_section ();
5528 default_elf_select_rtx_section (enum machine_mode mode
, rtx x
,
5529 unsigned HOST_WIDE_INT align
)
5531 /* ??? Handle small data here somehow. */
5534 switch (GET_CODE (x
))
5538 named_section (NULL_TREE
, ".data.rel.ro", 3);
5542 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
5549 mergeable_constant_section (mode
, align
, 0);
5552 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
5555 default_encode_section_info (tree decl
, rtx rtl
, int first ATTRIBUTE_UNUSED
)
5560 /* Careful not to prod global register variables. */
5563 symbol
= XEXP (rtl
, 0);
5564 if (GET_CODE (symbol
) != SYMBOL_REF
)
5568 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5569 flags
|= SYMBOL_FLAG_FUNCTION
;
5570 if (targetm
.binds_local_p (decl
))
5571 flags
|= SYMBOL_FLAG_LOCAL
;
5572 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (decl
))
5573 flags
|= DECL_TLS_MODEL (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
5574 else if (targetm
.in_small_data_p (decl
))
5575 flags
|= SYMBOL_FLAG_SMALL
;
5576 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
5577 being PUBLIC, the thing *must* be defined in this translation unit.
5578 Prevent this buglet from being propagated into rtl code as well. */
5579 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
5580 flags
|= SYMBOL_FLAG_EXTERNAL
;
5582 SYMBOL_REF_FLAGS (symbol
) = flags
;
5585 /* By default, we do nothing for encode_section_info, so we need not
5586 do anything but discard the '*' marker. */
5589 default_strip_name_encoding (const char *str
)
5591 return str
+ (*str
== '*');
5594 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5595 wrt cross-module name binding. */
5598 default_binds_local_p (tree exp
)
5600 return default_binds_local_p_1 (exp
, flag_shlib
);
5604 default_binds_local_p_1 (tree exp
, int shlib
)
5608 /* A non-decl is an entry in the constant pool. */
5611 /* Static variables are always local. */
5612 else if (! TREE_PUBLIC (exp
))
5614 /* A variable is local if the user explicitly tells us so. */
5615 else if (DECL_VISIBILITY_SPECIFIED (exp
) && DECL_VISIBILITY (exp
) != VISIBILITY_DEFAULT
)
5617 /* Otherwise, variables defined outside this object may not be local. */
5618 else if (DECL_EXTERNAL (exp
))
5620 /* Linkonce and weak data are never local. */
5621 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
5623 /* If none of the above and visibility is not default, make local. */
5624 else if (DECL_VISIBILITY (exp
) != VISIBILITY_DEFAULT
)
5626 /* If PIC, then assume that any global name can be overridden by
5627 symbols resolved from other modules. */
5630 /* Uninitialized COMMON variable may be unified with symbols
5631 resolved from other modules. */
5632 else if (DECL_COMMON (exp
)
5633 && (DECL_INITIAL (exp
) == NULL
5634 || DECL_INITIAL (exp
) == error_mark_node
))
5636 /* Otherwise we're left with initialized (or non-common) global data
5637 which is of necessity defined locally. */
5644 /* Determine whether or not a pointer mode is valid. Assume defaults
5645 of ptr_mode or Pmode - can be overridden. */
5647 default_valid_pointer_mode (enum machine_mode mode
)
5649 return (mode
== ptr_mode
|| mode
== Pmode
);
5652 /* Default function to output code that will globalize a label. A
5653 target must define GLOBAL_ASM_OP or provide its own function to
5654 globalize a label. */
5655 #ifdef GLOBAL_ASM_OP
5657 default_globalize_label (FILE * stream
, const char *name
)
5659 fputs (GLOBAL_ASM_OP
, stream
);
5660 assemble_name (stream
, name
);
5661 putc ('\n', stream
);
5663 #endif /* GLOBAL_ASM_OP */
5665 /* Default function to output a label for unwind information. The
5666 default is to do nothing. A target that needs nonlocal labels for
5667 unwind information must provide its own function to do this. */
5669 default_emit_unwind_label (FILE * stream ATTRIBUTE_UNUSED
,
5670 tree decl ATTRIBUTE_UNUSED
,
5671 int for_eh ATTRIBUTE_UNUSED
,
5672 int empty ATTRIBUTE_UNUSED
)
5676 /* This is how to output an internal numbered label where PREFIX is
5677 the class of label and LABELNO is the number within the class. */
5680 default_internal_label (FILE *stream
, const char *prefix
,
5681 unsigned long labelno
)
5683 char *const buf
= alloca (40 + strlen (prefix
));
5684 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5685 ASM_OUTPUT_INTERNAL_LABEL (stream
, buf
);
5688 /* This is the default behavior at the beginning of a file. It's
5689 controlled by two other target-hook toggles. */
5691 default_file_start (void)
5693 if (targetm
.file_start_app_off
&& !flag_verbose_asm
)
5694 fputs (ASM_APP_OFF
, asm_out_file
);
5696 if (targetm
.file_start_file_directive
)
5697 output_file_directive (asm_out_file
, main_input_filename
);
5700 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5701 which emits a special section directive used to indicate whether or
5702 not this object file needs an executable stack. This is primarily
5703 a GNU extension to ELF but could be used on other targets. */
5705 int trampolines_created
;
5708 file_end_indicate_exec_stack (void)
5710 unsigned int flags
= SECTION_DEBUG
;
5711 if (trampolines_created
)
5712 flags
|= SECTION_CODE
;
5714 named_section_flags (".note.GNU-stack", flags
);
5717 #include "gt-varasm.h"