1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
32 #include "coretypes.h"
39 #include "hard-reg-set.h"
47 #include "langhooks.h"
51 #include "tree-mudflap.h"
53 #include "cfglayout.h"
55 #ifdef XCOFF_DEBUGGING_INFO
56 #include "xcoffout.h" /* Needed for external data
57 declarations for e.g. AIX 4.x. */
60 /* The (assembler) name of the first globally-visible object output. */
61 const char *first_global_object_name
;
62 const char *weak_global_object_name
;
65 struct constant_descriptor_rtx
;
66 struct rtx_constant_pool
;
68 struct varasm_status
GTY(())
70 /* If we're using a per-function constant pool, this is it. */
71 struct rtx_constant_pool
*pool
;
73 /* Number of tree-constants deferred during the expansion of this
75 unsigned int deferred_constants
;
78 #define n_deferred_constants (cfun->varasm->deferred_constants)
80 /* Number for making the label on the next
81 constant that is stored in memory. */
83 static GTY(()) int const_labelno
;
85 /* Carry information from ASM_DECLARE_OBJECT_NAME
86 to ASM_FINISH_DECLARE_OBJECT. */
88 int size_directive_output
;
90 /* The last decl for which assemble_variable was called,
91 if it did ASM_DECLARE_OBJECT_NAME.
92 If the last call to assemble_variable didn't do that,
95 tree last_assemble_variable_decl
;
97 /* The following global variable indicates if the section label for the
98 "cold" section of code has been output yet to the assembler. The
99 label is useful when running gdb. This is part of the optimization that
100 partitions hot and cold basic blocks into separate sections of the .o
103 static bool unlikely_section_label_printed
= false;
105 /* The following global variable indicates the label name to be put at
106 the start of the first cold section within each function, when
107 partitioning basic blocks into hot and cold sections. */
109 static char *unlikely_section_label
= NULL
;
111 /* The following global variable indicates the section name to be used
112 for the current cold section, when partitioning hot and cold basic
113 blocks into separate sections. */
115 static char *unlikely_text_section_name
= NULL
;
117 /* We give all constants their own alias set. Perhaps redundant with
118 MEM_READONLY_P, but pre-dates it. */
120 static HOST_WIDE_INT const_alias_set
;
122 static const char *strip_reg_name (const char *);
123 static int contains_pointers_p (tree
);
124 #ifdef ASM_OUTPUT_EXTERNAL
125 static bool incorporeal_function_p (tree
);
127 static void decode_addr_const (tree
, struct addr_const
*);
128 static hashval_t
const_desc_hash (const void *);
129 static int const_desc_eq (const void *, const void *);
130 static hashval_t
const_hash_1 (const tree
);
131 static int compare_constant (const tree
, const tree
);
132 static tree
copy_constant (tree
);
133 static void output_constant_def_contents (rtx
);
134 static void output_addressed_constants (tree
);
135 static unsigned HOST_WIDE_INT
array_size_for_constructor (tree
);
136 static unsigned min_align (unsigned, unsigned);
137 static void output_constructor (tree
, unsigned HOST_WIDE_INT
, unsigned int);
138 static void globalize_decl (tree
);
139 static void maybe_assemble_visibility (tree
);
140 static int in_named_entry_eq (const void *, const void *);
141 static hashval_t
in_named_entry_hash (const void *);
142 #ifdef BSS_SECTION_ASM_OP
143 #ifdef ASM_OUTPUT_BSS
144 static void asm_output_bss (FILE *, tree
, const char *,
145 unsigned HOST_WIDE_INT
, unsigned HOST_WIDE_INT
);
147 #ifdef ASM_OUTPUT_ALIGNED_BSS
148 static void asm_output_aligned_bss (FILE *, tree
, const char *,
149 unsigned HOST_WIDE_INT
, int)
152 #endif /* BSS_SECTION_ASM_OP */
153 static bool asm_emit_uninitialised (tree
, const char*,
154 unsigned HOST_WIDE_INT
,
155 unsigned HOST_WIDE_INT
);
156 static void mark_weak (tree
);
158 enum in_section
{ no_section
, in_text
, in_unlikely_executed_text
, in_data
,
160 #ifdef BSS_SECTION_ASM_OP
163 #ifdef CTORS_SECTION_ASM_OP
166 #ifdef DTORS_SECTION_ASM_OP
169 #ifdef READONLY_DATA_SECTION_ASM_OP
172 #ifdef EXTRA_SECTIONS
176 static GTY(()) enum in_section in_section
= no_section
;
178 /* Return a nonzero value if DECL has a section attribute. */
179 #ifndef IN_NAMED_SECTION
180 #define IN_NAMED_SECTION(DECL) \
181 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
182 && DECL_SECTION_NAME (DECL) != NULL_TREE)
185 /* Text of section name when in_section == in_named. */
186 static GTY(()) const char *in_named_name
;
188 /* Hash table of flags that have been used for a particular named section. */
190 struct in_named_entry
GTY(())
197 static GTY((param_is (struct in_named_entry
))) htab_t in_named_htab
;
199 /* Define functions like text_section for any extra sections. */
200 #ifdef EXTRA_SECTION_FUNCTIONS
201 EXTRA_SECTION_FUNCTIONS
204 /* Tell assembler to switch to text section. */
209 if (in_section
!= in_text
)
211 in_section
= in_text
;
212 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
216 /* Tell assembler to switch to unlikely-to-be-executed text section. */
219 unlikely_text_section (void)
224 if (! unlikely_text_section_name
)
226 if (DECL_SECTION_NAME (current_function_decl
)
227 && (strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME
228 (current_function_decl
)),
229 HOT_TEXT_SECTION_NAME
) != 0)
230 && (strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME
231 (current_function_decl
)),
232 UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) != 0))
234 name
= TREE_STRING_POINTER (DECL_SECTION_NAME
235 (current_function_decl
));
237 unlikely_text_section_name
= xmalloc ((len
+ 10) * sizeof (char));
238 strcpy (unlikely_text_section_name
, name
);
239 strcat (unlikely_text_section_name
, "_unlikely");
243 len
= strlen (UNLIKELY_EXECUTED_TEXT_SECTION_NAME
);
244 unlikely_text_section_name
= xmalloc (len
+1 * sizeof (char));
245 strcpy (unlikely_text_section_name
,
246 UNLIKELY_EXECUTED_TEXT_SECTION_NAME
);
250 if ((in_section
!= in_unlikely_executed_text
)
251 && (in_section
!= in_named
252 || strcmp (in_named_name
, unlikely_text_section_name
) != 0))
254 named_section (NULL_TREE
, unlikely_text_section_name
, 0);
255 in_section
= in_unlikely_executed_text
;
257 if (!unlikely_section_label_printed
)
259 ASM_OUTPUT_LABEL (asm_out_file
, unlikely_section_label
);
260 unlikely_section_label_printed
= true;
265 /* Tell assembler to switch to data section. */
270 if (in_section
!= in_data
)
272 in_section
= in_data
;
273 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
277 /* Tell assembler to switch to read-only data section. This is normally
281 readonly_data_section (void)
283 #ifdef READONLY_DATA_SECTION
284 READONLY_DATA_SECTION (); /* Note this can call data_section. */
286 #ifdef READONLY_DATA_SECTION_ASM_OP
287 if (in_section
!= in_readonly_data
)
289 in_section
= in_readonly_data
;
290 fputs (READONLY_DATA_SECTION_ASM_OP
, asm_out_file
);
291 fputc ('\n', asm_out_file
);
299 /* Determine if we're in the text section. */
302 in_text_section (void)
304 return in_section
== in_text
;
307 /* Determine if we're in the unlikely-to-be-executed text section. */
310 in_unlikely_text_section (void)
314 ret_val
= ((in_section
== in_unlikely_executed_text
)
315 || (in_section
== in_named
316 && unlikely_text_section_name
317 && strcmp (in_named_name
, unlikely_text_section_name
) == 0));
322 /* Determine if we're in the data section. */
325 in_data_section (void)
327 return in_section
== in_data
;
330 /* Helper routines for maintaining in_named_htab. */
333 in_named_entry_eq (const void *p1
, const void *p2
)
335 const struct in_named_entry
*old
= p1
;
336 const char *new = p2
;
338 return strcmp (old
->name
, new) == 0;
342 in_named_entry_hash (const void *p
)
344 const struct in_named_entry
*old
= p
;
345 return htab_hash_string (old
->name
);
348 /* If SECTION has been seen before as a named section, return the flags
349 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
350 set of flags for a section to have, so 0 does not mean that the section
351 has not been seen. */
354 get_named_section_flags (const char *section
)
356 struct in_named_entry
**slot
;
358 slot
= (struct in_named_entry
**)
359 htab_find_slot_with_hash (in_named_htab
, section
,
360 htab_hash_string (section
), NO_INSERT
);
362 return slot
? (*slot
)->flags
: 0;
365 /* Returns true if the section has been declared before. Sets internal
366 flag on this section in in_named_hash so subsequent calls on this
367 section will return false. */
370 named_section_first_declaration (const char *name
)
372 struct in_named_entry
**slot
;
374 slot
= (struct in_named_entry
**)
375 htab_find_slot_with_hash (in_named_htab
, name
,
376 htab_hash_string (name
), NO_INSERT
);
377 if (! (*slot
)->declared
)
379 (*slot
)->declared
= true;
389 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
390 different set of flags, return false. */
393 set_named_section_flags (const char *section
, unsigned int flags
)
395 struct in_named_entry
**slot
, *entry
;
397 slot
= (struct in_named_entry
**)
398 htab_find_slot_with_hash (in_named_htab
, section
,
399 htab_hash_string (section
), INSERT
);
404 entry
= ggc_alloc (sizeof (*entry
));
406 entry
->name
= ggc_strdup (section
);
407 entry
->flags
= flags
;
408 entry
->declared
= false;
410 else if (entry
->flags
!= flags
)
416 /* Tell assembler to change to section NAME with attributes FLAGS. If
417 DECL is non-NULL, it is the VAR_DECL or FUNCTION_DECL with which
418 this section is associated. */
421 named_section_real (const char *name
, unsigned int flags
, tree decl
)
423 if (in_section
!= in_named
|| strcmp (name
, in_named_name
) != 0)
425 if (! set_named_section_flags (name
, flags
))
428 targetm
.asm_out
.named_section (name
, flags
, decl
);
430 if (flags
& SECTION_FORGET
)
431 in_section
= no_section
;
434 in_named_name
= ggc_strdup (name
);
435 in_section
= in_named
;
440 /* Tell assembler to change to section NAME for DECL.
441 If DECL is NULL, just switch to section NAME.
442 If NAME is NULL, get the name from DECL.
443 If RELOC is 1, the initializer for DECL contains relocs. */
446 named_section (tree decl
, const char *name
, int reloc
)
450 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
453 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
455 if (strcmp (name
, UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) == 0
456 && !unlikely_text_section_name
)
458 unlikely_text_section_name
= xmalloc
459 (strlen (UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) + 1
461 strcpy (unlikely_text_section_name
,
462 UNLIKELY_EXECUTED_TEXT_SECTION_NAME
);
465 flags
= targetm
.section_type_flags (decl
, name
, reloc
);
467 /* Sanity check user variables for flag changes. Non-user
468 section flag changes will abort in named_section_flags.
469 However, don't complain if SECTION_OVERRIDE is set.
470 We trust that the setter knows that it is safe to ignore
471 the default flags for this decl. */
472 if (decl
&& ! set_named_section_flags (name
, flags
))
474 flags
= get_named_section_flags (name
);
475 if ((flags
& SECTION_OVERRIDE
) == 0)
476 error ("%J%D causes a section type conflict", decl
, decl
);
479 named_section_real (name
, flags
, decl
);
482 /* If required, set DECL_SECTION_NAME to a unique name. */
485 resolve_unique_section (tree decl
, int reloc ATTRIBUTE_UNUSED
,
486 int flag_function_or_data_sections
)
488 if (DECL_SECTION_NAME (decl
) == NULL_TREE
489 && targetm
.have_named_sections
490 && (flag_function_or_data_sections
491 || DECL_ONE_ONLY (decl
)))
492 targetm
.asm_out
.unique_section (decl
, reloc
);
495 #ifdef BSS_SECTION_ASM_OP
497 /* Tell the assembler to switch to the bss section. */
502 if (in_section
!= in_bss
)
504 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
509 #ifdef ASM_OUTPUT_BSS
511 /* Utility function for ASM_OUTPUT_BSS for targets to use if
512 they don't support alignments in .bss.
513 ??? It is believed that this function will work in most cases so such
514 support is localized here. */
517 asm_output_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
519 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
520 unsigned HOST_WIDE_INT rounded
)
522 targetm
.asm_out
.globalize_label (file
, name
);
524 #ifdef ASM_DECLARE_OBJECT_NAME
525 last_assemble_variable_decl
= decl
;
526 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
528 /* Standard thing is just output label for the object. */
529 ASM_OUTPUT_LABEL (file
, name
);
530 #endif /* ASM_DECLARE_OBJECT_NAME */
531 ASM_OUTPUT_SKIP (file
, rounded
? rounded
: 1);
536 #ifdef ASM_OUTPUT_ALIGNED_BSS
538 /* Utility function for targets to use in implementing
539 ASM_OUTPUT_ALIGNED_BSS.
540 ??? It is believed that this function will work in most cases so such
541 support is localized here. */
544 asm_output_aligned_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
545 const char *name
, unsigned HOST_WIDE_INT size
,
549 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
550 #ifdef ASM_DECLARE_OBJECT_NAME
551 last_assemble_variable_decl
= decl
;
552 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
554 /* Standard thing is just output label for the object. */
555 ASM_OUTPUT_LABEL (file
, name
);
556 #endif /* ASM_DECLARE_OBJECT_NAME */
557 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
562 #endif /* BSS_SECTION_ASM_OP */
564 /* Switch to the section for function DECL.
566 If DECL is NULL_TREE, switch to the text section. We can be passed
567 NULL_TREE under some circumstances by dbxout.c at least. */
570 function_section (tree decl
)
572 if (decl
== NULL_TREE
)
576 /* ??? Typical use of this function maybe shouldn't be looking
577 for unlikely blocks at all - in the event that an entire
578 function is going into the unlikely-execute section, that
579 should be reflected in its DECL_SECTION_NAME. */
580 rtx insns
= cfun
&& cfun
->emit
? get_insns () : 0;
581 bool unlikely
= insns
&& scan_ahead_for_unlikely_executed_note (insns
);
583 #ifdef USE_SELECT_SECTION_FOR_FUNCTIONS
584 targetm
.asm_out
.select_section (decl
, unlikely
, DECL_ALIGN (decl
));
587 unlikely_text_section ();
588 else if (DECL_SECTION_NAME (decl
))
589 named_section (decl
, 0, 0);
596 /* Switch to read-only data section associated with function DECL. */
599 default_function_rodata_section (tree decl
)
601 if (decl
!= NULL_TREE
&& DECL_SECTION_NAME (decl
))
603 const char *name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
605 /* For .gnu.linkonce.t.foo we want to use .gnu.linkonce.r.foo. */
606 if (DECL_ONE_ONLY (decl
) && strncmp (name
, ".gnu.linkonce.t.", 16) == 0)
608 size_t len
= strlen (name
) + 1;
609 char *rname
= alloca (len
);
611 memcpy (rname
, name
, len
);
613 named_section_real (rname
, SECTION_LINKONCE
, decl
);
616 /* For .text.foo we want to use .rodata.foo. */
617 else if (flag_function_sections
&& flag_data_sections
618 && strncmp (name
, ".text.", 6) == 0)
620 size_t len
= strlen (name
) + 1;
621 char *rname
= alloca (len
+ 2);
623 memcpy (rname
, ".rodata", 7);
624 memcpy (rname
+ 7, name
+ 5, len
- 5);
625 named_section_flags (rname
, 0);
630 readonly_data_section ();
633 /* Switch to read-only data section associated with function DECL
634 for targets where that section should be always the single
635 readonly data section. */
638 default_no_function_rodata_section (tree decl ATTRIBUTE_UNUSED
)
640 readonly_data_section ();
643 /* Switch to section for variable DECL. RELOC is the same as the
644 argument to SELECT_SECTION. */
647 variable_section (tree decl
, int reloc
)
649 if (IN_NAMED_SECTION (decl
))
650 named_section (decl
, NULL
, reloc
);
652 targetm
.asm_out
.select_section (decl
, reloc
, DECL_ALIGN (decl
));
655 /* Tell assembler to switch to the section for string merging. */
658 mergeable_string_section (tree decl ATTRIBUTE_UNUSED
,
659 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
660 unsigned int flags ATTRIBUTE_UNUSED
)
662 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
663 && TREE_CODE (decl
) == STRING_CST
664 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
666 && TREE_STRING_LENGTH (decl
) >= int_size_in_bytes (TREE_TYPE (decl
)))
668 enum machine_mode mode
;
669 unsigned int modesize
;
674 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (decl
)));
675 modesize
= GET_MODE_BITSIZE (mode
);
676 if (modesize
>= 8 && modesize
<= 256
677 && (modesize
& (modesize
- 1)) == 0)
679 if (align
< modesize
)
682 str
= TREE_STRING_POINTER (decl
);
683 len
= TREE_STRING_LENGTH (decl
);
684 unit
= GET_MODE_SIZE (mode
);
686 /* Check for embedded NUL characters. */
687 for (i
= 0; i
< len
; i
+= unit
)
689 for (j
= 0; j
< unit
; j
++)
690 if (str
[i
+ j
] != '\0')
697 sprintf (name
, ".rodata.str%d.%d", modesize
/ 8,
699 flags
|= (modesize
/ 8) | SECTION_MERGE
| SECTION_STRINGS
;
700 if (!i
&& modesize
< align
)
702 /* A "" string with requested alignment greater than
703 character size might cause a problem:
704 if some other string required even bigger
705 alignment than "", then linker might think the
706 "" is just part of padding after some other string
707 and not put it into the hash table initially.
708 But this means "" could have smaller alignment
710 #ifdef ASM_OUTPUT_SECTION_START
711 named_section_flags (name
, flags
);
712 ASM_OUTPUT_SECTION_START (asm_out_file
);
714 readonly_data_section ();
719 named_section_flags (name
, flags
);
725 readonly_data_section ();
728 /* Tell assembler to switch to the section for constant merging. */
731 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
732 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
733 unsigned int flags ATTRIBUTE_UNUSED
)
735 unsigned int modesize
= GET_MODE_BITSIZE (mode
);
737 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
743 && (align
& (align
- 1)) == 0)
747 sprintf (name
, ".rodata.cst%d", (int) (align
/ 8));
748 flags
|= (align
/ 8) | SECTION_MERGE
;
749 named_section_flags (name
, flags
);
753 readonly_data_section ();
756 /* Given NAME, a putative register name, discard any customary prefixes. */
759 strip_reg_name (const char *name
)
761 #ifdef REGISTER_PREFIX
762 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
763 name
+= strlen (REGISTER_PREFIX
);
765 if (name
[0] == '%' || name
[0] == '#')
770 /* The user has asked for a DECL to have a particular name. Set (or
771 change) it in such a way that we don't prefix an underscore to
774 set_user_assembler_name (tree decl
, const char *name
)
776 char *starred
= alloca (strlen (name
) + 2);
778 strcpy (starred
+ 1, name
);
779 change_decl_assembler_name (decl
, get_identifier (starred
));
780 SET_DECL_RTL (decl
, NULL_RTX
);
783 /* Decode an `asm' spec for a declaration as a register name.
784 Return the register number, or -1 if nothing specified,
785 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
786 or -3 if ASMSPEC is `cc' and is not recognized,
787 or -4 if ASMSPEC is `memory' and is not recognized.
788 Accept an exact spelling or a decimal number.
789 Prefixes such as % are optional. */
792 decode_reg_name (const char *asmspec
)
798 /* Get rid of confusing prefixes. */
799 asmspec
= strip_reg_name (asmspec
);
801 /* Allow a decimal number as a "register name". */
802 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
803 if (! ISDIGIT (asmspec
[i
]))
805 if (asmspec
[0] != 0 && i
< 0)
808 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
814 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
816 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
819 #ifdef ADDITIONAL_REGISTER_NAMES
821 static const struct { const char *const name
; const int number
; } table
[]
822 = ADDITIONAL_REGISTER_NAMES
;
824 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
825 if (! strcmp (asmspec
, table
[i
].name
))
826 return table
[i
].number
;
828 #endif /* ADDITIONAL_REGISTER_NAMES */
830 if (!strcmp (asmspec
, "memory"))
833 if (!strcmp (asmspec
, "cc"))
842 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
843 have static storage duration. In other words, it should not be an
844 automatic variable, including PARM_DECLs.
846 There is, however, one exception: this function handles variables
847 explicitly placed in a particular register by the user.
849 This is never called for PARM_DECL nodes. */
852 make_decl_rtl (tree decl
)
854 const char *name
= 0;
858 /* Check that we are not being given an automatic variable. */
859 /* A weak alias has TREE_PUBLIC set but not the other bits. */
860 if (TREE_CODE (decl
) == PARM_DECL
861 || TREE_CODE (decl
) == RESULT_DECL
862 || (TREE_CODE (decl
) == VAR_DECL
863 && !TREE_STATIC (decl
)
864 && !TREE_PUBLIC (decl
)
865 && !DECL_EXTERNAL (decl
)
866 && !DECL_REGISTER (decl
)))
868 /* And that we were not given a type or a label. */
869 else if (TREE_CODE (decl
) == TYPE_DECL
870 || TREE_CODE (decl
) == LABEL_DECL
)
873 /* For a duplicate declaration, we can be called twice on the
874 same DECL node. Don't discard the RTL already made. */
875 if (DECL_RTL_SET_P (decl
))
877 /* If the old RTL had the wrong mode, fix the mode. */
878 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
879 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
880 DECL_MODE (decl
), 0));
882 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
885 /* ??? Another way to do this would be to maintain a hashed
886 table of such critters. Instead of adding stuff to a DECL
887 to give certain attributes to it, we could use an external
888 hash map from DECL to set of attributes. */
890 /* Let the target reassign the RTL if it wants.
891 This is necessary, for example, when one machine specific
892 decl attribute overrides another. */
893 targetm
.encode_section_info (decl
, DECL_RTL (decl
), false);
895 /* Make this function static known to the mudflap runtime. */
896 if (flag_mudflap
&& TREE_CODE (decl
) == VAR_DECL
)
897 mudflap_enqueue_decl (decl
);
902 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
905 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
907 reg_number
= decode_reg_name (name
);
908 /* First detect errors in declaring global registers. */
909 if (reg_number
== -1)
910 error ("%Jregister name not specified for %qD", decl
, decl
);
911 else if (reg_number
< 0)
912 error ("%Jinvalid register name for %qD", decl
, decl
);
913 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
914 error ("%Jdata type of %qD isn%'t suitable for a register",
916 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
917 error ("%Jregister specified for %qD isn%'t suitable for data type",
919 /* Now handle properly declared static register variables. */
924 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
926 DECL_INITIAL (decl
) = 0;
927 error ("global register variable has initial value");
929 if (TREE_THIS_VOLATILE (decl
))
930 warning ("volatile register variables don%'t "
931 "work as you might wish");
933 /* If the user specified one of the eliminables registers here,
934 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
935 confused with that register and be eliminated. This usage is
936 somewhat suspect... */
938 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
939 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
940 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
942 if (TREE_STATIC (decl
))
944 /* Make this register global, so not usable for anything
946 #ifdef ASM_DECLARE_REGISTER_GLOBAL
947 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
949 nregs
= hard_regno_nregs
[reg_number
][DECL_MODE (decl
)];
951 globalize_reg (reg_number
+ --nregs
);
954 /* As a register variable, it has no section. */
958 /* Now handle ordinary static variables and functions (in memory).
959 Also handle vars declared register invalidly. */
960 else if (name
[0] == '*')
962 #ifdef REGISTER_PREFIX
963 if (strlen (REGISTER_PREFIX
) != 0)
965 reg_number
= decode_reg_name (name
);
966 if (reg_number
>= 0 || reg_number
== -3)
967 error ("%Jregister name given for non-register variable %qD", decl
, decl
);
972 /* Specifying a section attribute on a variable forces it into a
973 non-.bss section, and thus it cannot be common. */
974 if (TREE_CODE (decl
) == VAR_DECL
975 && DECL_SECTION_NAME (decl
) != NULL_TREE
976 && DECL_INITIAL (decl
) == NULL_TREE
977 && DECL_COMMON (decl
))
978 DECL_COMMON (decl
) = 0;
980 /* Variables can't be both common and weak. */
981 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
982 DECL_COMMON (decl
) = 0;
984 x
= gen_rtx_SYMBOL_REF (Pmode
, name
);
985 SYMBOL_REF_WEAK (x
) = DECL_WEAK (decl
);
986 SYMBOL_REF_DECL (x
) = decl
;
988 x
= gen_rtx_MEM (DECL_MODE (decl
), x
);
989 if (TREE_CODE (decl
) != FUNCTION_DECL
)
990 set_mem_attributes (x
, decl
, 1);
991 SET_DECL_RTL (decl
, x
);
993 /* Optionally set flags or add text to the name to record information
994 such as that it is a function name.
995 If the name is changed, the macro ASM_OUTPUT_LABELREF
996 will have to know how to strip this information. */
997 targetm
.encode_section_info (decl
, DECL_RTL (decl
), true);
999 /* Make this function static known to the mudflap runtime. */
1000 if (flag_mudflap
&& TREE_CODE (decl
) == VAR_DECL
)
1001 mudflap_enqueue_decl (decl
);
1004 /* Make the rtl for variable VAR be volatile.
1005 Use this only for static variables. */
1008 make_var_volatile (tree var
)
1010 if (!MEM_P (DECL_RTL (var
)))
1013 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
1016 /* Output a string of literal assembler code
1017 for an `asm' keyword used between functions. */
1020 assemble_asm (tree string
)
1024 if (TREE_CODE (string
) == ADDR_EXPR
)
1025 string
= TREE_OPERAND (string
, 0);
1027 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
1030 /* Record an element in the table of global destructors. SYMBOL is
1031 a SYMBOL_REF of the function to be called; PRIORITY is a number
1032 between 0 and MAX_INIT_PRIORITY. */
1035 default_stabs_asm_out_destructor (rtx symbol ATTRIBUTE_UNUSED
,
1036 int priority ATTRIBUTE_UNUSED
)
1038 #if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO
1039 /* Tell GNU LD that this is part of the static destructor set.
1040 This will work for any system that uses stabs, most usefully
1042 dbxout_begin_simple_stabs ("___DTOR_LIST__", 22 /* N_SETT */);
1043 dbxout_stab_value_label (XSTR (symbol
, 0));
1045 sorry ("global destructors not supported on this target");
1050 default_named_section_asm_out_destructor (rtx symbol
, int priority
)
1052 const char *section
= ".dtors";
1055 /* ??? This only works reliably with the GNU linker. */
1056 if (priority
!= DEFAULT_INIT_PRIORITY
)
1058 sprintf (buf
, ".dtors.%.5u",
1059 /* Invert the numbering so the linker puts us in the proper
1060 order; constructors are run from right to left, and the
1061 linker sorts in increasing order. */
1062 MAX_INIT_PRIORITY
- priority
);
1066 named_section_flags (section
, SECTION_WRITE
);
1067 assemble_align (POINTER_SIZE
);
1068 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1071 #ifdef DTORS_SECTION_ASM_OP
1073 dtors_section (void)
1075 if (in_section
!= in_dtors
)
1077 in_section
= in_dtors
;
1078 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
1079 fputc ('\n', asm_out_file
);
1084 default_dtor_section_asm_out_destructor (rtx symbol
,
1085 int priority ATTRIBUTE_UNUSED
)
1088 assemble_align (POINTER_SIZE
);
1089 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1093 /* Likewise for global constructors. */
1096 default_stabs_asm_out_constructor (rtx symbol ATTRIBUTE_UNUSED
,
1097 int priority ATTRIBUTE_UNUSED
)
1099 #if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO
1100 /* Tell GNU LD that this is part of the static destructor set.
1101 This will work for any system that uses stabs, most usefully
1103 dbxout_begin_simple_stabs ("___CTOR_LIST__", 22 /* N_SETT */);
1104 dbxout_stab_value_label (XSTR (symbol
, 0));
1106 sorry ("global constructors not supported on this target");
1111 default_named_section_asm_out_constructor (rtx symbol
, int priority
)
1113 const char *section
= ".ctors";
1116 /* ??? This only works reliably with the GNU linker. */
1117 if (priority
!= DEFAULT_INIT_PRIORITY
)
1119 sprintf (buf
, ".ctors.%.5u",
1120 /* Invert the numbering so the linker puts us in the proper
1121 order; constructors are run from right to left, and the
1122 linker sorts in increasing order. */
1123 MAX_INIT_PRIORITY
- priority
);
1127 named_section_flags (section
, SECTION_WRITE
);
1128 assemble_align (POINTER_SIZE
);
1129 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1132 #ifdef CTORS_SECTION_ASM_OP
1134 ctors_section (void)
1136 if (in_section
!= in_ctors
)
1138 in_section
= in_ctors
;
1139 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1140 fputc ('\n', asm_out_file
);
1145 default_ctor_section_asm_out_constructor (rtx symbol
,
1146 int priority ATTRIBUTE_UNUSED
)
1149 assemble_align (POINTER_SIZE
);
1150 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1154 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1155 a nonzero value if the constant pool should be output before the
1156 start of the function, or a zero value if the pool should output
1157 after the end of the function. The default is to put it before the
1160 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1161 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1164 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
1165 to be output to assembler.
1166 Set first_global_object_name and weak_global_object_name as appropriate. */
1169 notice_global_symbol (tree decl
)
1171 const char **type
= &first_global_object_name
;
1173 if (first_global_object_name
1174 || !TREE_PUBLIC (decl
) || DECL_EXTERNAL (decl
)
1175 || !DECL_NAME (decl
)
1176 || (TREE_CODE (decl
) != FUNCTION_DECL
1177 && (TREE_CODE (decl
) != VAR_DECL
1178 || (DECL_COMMON (decl
)
1179 && (DECL_INITIAL (decl
) == 0
1180 || DECL_INITIAL (decl
) == error_mark_node
))))
1181 || !MEM_P (DECL_RTL (decl
)))
1184 /* We win when global object is found, but it is useful to know about weak
1185 symbol as well so we can produce nicer unique names. */
1186 if (DECL_WEAK (decl
) || DECL_ONE_ONLY (decl
))
1187 type
= &weak_global_object_name
;
1193 rtx decl_rtl
= DECL_RTL (decl
);
1195 p
= targetm
.strip_name_encoding (XSTR (XEXP (decl_rtl
, 0), 0));
1202 /* Output assembler code for the constant pool of a function and associated
1203 with defining the name of the function. DECL describes the function.
1204 NAME is the function's name. For the constant pool, we use the current
1205 constant pool data. */
1208 assemble_start_function (tree decl
, const char *fnname
)
1212 if (unlikely_text_section_name
)
1213 free (unlikely_text_section_name
);
1215 unlikely_section_label_printed
= false;
1216 unlikely_text_section_name
= NULL
;
1218 unlikely_section_label
= reconcat (unlikely_section_label
,
1219 fnname
, ".unlikely_section", NULL
);
1221 /* The following code does not need preprocessing in the assembler. */
1225 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1226 output_constant_pool (fnname
, decl
);
1228 /* Make sure the cold text (code) section is properly aligned. This
1229 is necessary here in the case where the function has both hot and
1230 cold sections, because we don't want to re-set the alignment when the
1231 section switch happens mid-function. We don't need to set the hot
1232 section alignment here, because code further down in this function
1233 sets the alignment for whichever section comes first, and if there
1234 is a hot section it is guaranteed to be first. */
1236 if (flag_reorder_blocks_and_partition
)
1238 unlikely_text_section ();
1239 assemble_align (FUNCTION_BOUNDARY
);
1242 resolve_unique_section (decl
, 0, flag_function_sections
);
1243 function_section (decl
);
1245 /* Tell assembler to move to target machine's alignment for functions. */
1246 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1247 if (align
< force_align_functions_log
)
1248 align
= force_align_functions_log
;
1251 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1254 /* Handle a user-specified function alignment.
1255 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1256 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1257 if (align_functions_log
> align
1258 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1260 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1261 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1262 align_functions_log
, align_functions
- 1);
1264 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1268 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1269 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1272 (*debug_hooks
->begin_function
) (decl
);
1274 /* Make function name accessible from other files, if appropriate. */
1276 if (TREE_PUBLIC (decl
))
1278 notice_global_symbol (decl
);
1280 globalize_decl (decl
);
1282 maybe_assemble_visibility (decl
);
1285 if (DECL_PRESERVE_P (decl
))
1286 targetm
.asm_out
.mark_decl_preserved (fnname
);
1288 /* Do any machine/system dependent processing of the function name. */
1289 #ifdef ASM_DECLARE_FUNCTION_NAME
1290 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1292 /* Standard thing is just output label for the function. */
1293 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1294 #endif /* ASM_DECLARE_FUNCTION_NAME */
1296 if (in_unlikely_text_section ()
1297 && !unlikely_section_label_printed
)
1299 ASM_OUTPUT_LABEL (asm_out_file
, unlikely_section_label
);
1300 unlikely_section_label_printed
= true;
1304 /* Output assembler code associated with defining the size of the
1305 function. DECL describes the function. NAME is the function's name. */
1308 assemble_end_function (tree decl
, const char *fnname
)
1310 #ifdef ASM_DECLARE_FUNCTION_SIZE
1311 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1313 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1315 output_constant_pool (fnname
, decl
);
1316 function_section (decl
); /* need to switch back */
1320 /* Assemble code to leave SIZE bytes of zeros. */
1323 assemble_zeros (unsigned HOST_WIDE_INT size
)
1325 /* Do no output if -fsyntax-only. */
1326 if (flag_syntax_only
)
1329 #ifdef ASM_NO_SKIP_IN_TEXT
1330 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1331 so we must output 0s explicitly in the text section. */
1332 if ((ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1333 || (ASM_NO_SKIP_IN_TEXT
&& in_unlikely_text_section ()))
1335 unsigned HOST_WIDE_INT i
;
1336 for (i
= 0; i
< size
; i
++)
1337 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1342 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1345 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1348 assemble_align (int align
)
1350 if (align
> BITS_PER_UNIT
)
1352 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1356 /* Assemble a string constant with the specified C string as contents. */
1359 assemble_string (const char *p
, int size
)
1364 /* If the string is very long, split it up. */
1368 int thissize
= size
- pos
;
1369 if (thissize
> maximum
)
1372 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1380 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1381 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1382 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1384 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1385 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1386 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1388 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1389 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1393 #if defined ASM_OUTPUT_ALIGNED_BSS
1394 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1395 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1397 #if defined ASM_OUTPUT_BSS
1398 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1399 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1405 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1406 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1407 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1409 #if defined ASM_OUTPUT_ALIGNED_COMMON
1410 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1411 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1413 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1414 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1419 asm_emit_uninitialised (tree decl
, const char *name
,
1420 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
1421 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
)
1429 destination
= asm_dest_local
;
1431 /* ??? We should handle .bss via select_section mechanisms rather than
1432 via special target hooks. That would eliminate this special case. */
1433 if (TREE_PUBLIC (decl
))
1435 if (!DECL_COMMON (decl
))
1437 destination
= asm_dest_bss
;
1442 destination
= asm_dest_common
;
1445 if (destination
== asm_dest_bss
)
1446 globalize_decl (decl
);
1447 resolve_unique_section (decl
, 0, flag_data_sections
);
1449 if (flag_shared_data
)
1451 switch (destination
)
1453 #ifdef ASM_OUTPUT_SHARED_BSS
1455 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1458 #ifdef ASM_OUTPUT_SHARED_COMMON
1459 case asm_dest_common
:
1460 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1463 #ifdef ASM_OUTPUT_SHARED_LOCAL
1464 case asm_dest_local
:
1465 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1473 switch (destination
)
1477 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1480 case asm_dest_common
:
1481 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1483 case asm_dest_local
:
1484 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1493 /* Assemble everything that is needed for a variable or function declaration.
1494 Not used for automatic variables, and not used for function definitions.
1495 Should not be called for variables of incomplete structure type.
1497 TOP_LEVEL is nonzero if this variable has file scope.
1498 AT_END is nonzero if this is the special handling, at end of compilation,
1499 to define things that have had only tentative definitions.
1500 DONT_OUTPUT_DATA if nonzero means don't actually output the
1501 initial value (that will be done by the caller). */
1504 assemble_variable (tree decl
, int top_level ATTRIBUTE_UNUSED
,
1505 int at_end ATTRIBUTE_UNUSED
, int dont_output_data
)
1512 if (lang_hooks
.decls
.prepare_assemble_variable
)
1513 lang_hooks
.decls
.prepare_assemble_variable (decl
);
1515 last_assemble_variable_decl
= 0;
1517 /* Normally no need to say anything here for external references,
1518 since assemble_external is called by the language-specific code
1519 when a declaration is first seen. */
1521 if (DECL_EXTERNAL (decl
))
1524 /* Output no assembler code for a function declaration.
1525 Only definitions of functions output anything. */
1527 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1530 /* Do nothing for global register variables. */
1531 if (DECL_RTL_SET_P (decl
) && REG_P (DECL_RTL (decl
)))
1533 TREE_ASM_WRITTEN (decl
) = 1;
1537 /* If type was incomplete when the variable was declared,
1538 see if it is complete now. */
1540 if (DECL_SIZE (decl
) == 0)
1541 layout_decl (decl
, 0);
1543 /* Still incomplete => don't allocate it; treat the tentative defn
1544 (which is what it must have been) as an `extern' reference. */
1546 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1548 error ("%Jstorage size of %qD isn%'t known", decl
, decl
);
1549 TREE_ASM_WRITTEN (decl
) = 1;
1553 /* The first declaration of a variable that comes through this function
1554 decides whether it is global (in C, has external linkage)
1555 or local (in C, has internal linkage). So do nothing more
1556 if this function has already run. */
1558 if (TREE_ASM_WRITTEN (decl
))
1561 /* Make sure targetm.encode_section_info is invoked before we set
1563 decl_rtl
= DECL_RTL (decl
);
1565 TREE_ASM_WRITTEN (decl
) = 1;
1567 /* Do no output if -fsyntax-only. */
1568 if (flag_syntax_only
)
1573 if (! dont_output_data
1574 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1576 error ("%Jsize of variable %qD is too large", decl
, decl
);
1580 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1581 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1582 notice_global_symbol (decl
);
1584 /* Compute the alignment of this data. */
1586 align
= DECL_ALIGN (decl
);
1588 /* In the case for initialing an array whose length isn't specified,
1589 where we have not yet been able to do the layout,
1590 figure out the proper alignment now. */
1591 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1592 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1593 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1595 /* Some object file formats have a maximum alignment which they support.
1596 In particular, a.out format supports a maximum alignment of 4. */
1597 if (align
> MAX_OFILE_ALIGNMENT
)
1599 warning ("%Jalignment of %qD is greater than maximum object "
1600 "file alignment. Using %d", decl
, decl
,
1601 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1602 align
= MAX_OFILE_ALIGNMENT
;
1605 /* On some machines, it is good to increase alignment sometimes. */
1606 if (! DECL_USER_ALIGN (decl
))
1608 #ifdef DATA_ALIGNMENT
1609 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1611 #ifdef CONSTANT_ALIGNMENT
1612 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1613 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1617 /* Reset the alignment in case we have made it tighter, so we can benefit
1618 from it in get_pointer_alignment. */
1619 DECL_ALIGN (decl
) = align
;
1620 set_mem_align (decl_rtl
, align
);
1622 if (TREE_PUBLIC (decl
))
1623 maybe_assemble_visibility (decl
);
1625 if (DECL_PRESERVE_P (decl
))
1626 targetm
.asm_out
.mark_decl_preserved (name
);
1628 /* Output any data that we will need to use the address of. */
1629 if (DECL_INITIAL (decl
) == error_mark_node
)
1630 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1631 else if (DECL_INITIAL (decl
))
1633 reloc
= compute_reloc_for_constant (DECL_INITIAL (decl
));
1634 output_addressed_constants (DECL_INITIAL (decl
));
1636 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1638 /* Handle uninitialized definitions. */
1640 /* If the decl has been given an explicit section name, then it
1641 isn't common, and shouldn't be handled as such. */
1642 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1644 /* We don't implement common thread-local data at present. */
1645 else if (DECL_THREAD_LOCAL (decl
))
1647 if (DECL_COMMON (decl
))
1648 sorry ("thread-local COMMON data not implemented");
1650 else if (DECL_INITIAL (decl
) == 0
1651 || DECL_INITIAL (decl
) == error_mark_node
1652 || (flag_zero_initialized_in_bss
1653 /* Leave constant zeroes in .rodata so they can be shared. */
1654 && !TREE_READONLY (decl
)
1655 && initializer_zerop (DECL_INITIAL (decl
))))
1657 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1658 unsigned HOST_WIDE_INT rounded
= size
;
1660 /* Don't allocate zero bytes of common,
1661 since that means "undefined external" in the linker. */
1665 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1666 so that each uninitialized object starts on such a boundary. */
1667 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1668 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1669 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1671 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1672 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN_UNIT (decl
) > rounded
)
1673 warning ("%Jrequested alignment for %qD is greater than "
1674 "implemented alignment of %d", decl
, decl
, rounded
);
1677 /* If the target cannot output uninitialized but not common global data
1678 in .bss, then we have to use .data, so fall through. */
1679 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1683 /* Handle initialized definitions.
1684 Also handle uninitialized global definitions if -fno-common and the
1685 target doesn't support ASM_OUTPUT_BSS. */
1687 /* First make the assembler name(s) global if appropriate. */
1688 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1689 globalize_decl (decl
);
1691 /* Switch to the appropriate section. */
1692 variable_section (decl
, reloc
);
1694 /* dbxout.c needs to know this. */
1695 if (in_text_section () || in_unlikely_text_section ())
1696 DECL_IN_TEXT_SECTION (decl
) = 1;
1698 /* Output the alignment of this data. */
1699 if (align
> BITS_PER_UNIT
)
1700 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (DECL_ALIGN_UNIT (decl
)));
1702 /* Do any machine/system dependent processing of the object. */
1703 #ifdef ASM_DECLARE_OBJECT_NAME
1704 last_assemble_variable_decl
= decl
;
1705 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1707 /* Standard thing is just output label for the object. */
1708 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1709 #endif /* ASM_DECLARE_OBJECT_NAME */
1711 if (!dont_output_data
)
1713 if (DECL_INITIAL (decl
)
1714 && DECL_INITIAL (decl
) != error_mark_node
1715 && !initializer_zerop (DECL_INITIAL (decl
)))
1716 /* Output the actual data. */
1717 output_constant (DECL_INITIAL (decl
),
1718 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1721 /* Leave space for it. */
1722 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1726 /* Return 1 if type TYPE contains any pointers. */
1729 contains_pointers_p (tree type
)
1731 switch (TREE_CODE (type
))
1734 case REFERENCE_TYPE
:
1735 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1736 so I'll play safe and return 1. */
1742 case QUAL_UNION_TYPE
:
1745 /* For a type that has fields, see if the fields have pointers. */
1746 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1747 if (TREE_CODE (fields
) == FIELD_DECL
1748 && contains_pointers_p (TREE_TYPE (fields
)))
1754 /* An array type contains pointers if its element type does. */
1755 return contains_pointers_p (TREE_TYPE (type
));
1762 /* In unit-at-a-time mode, we delay assemble_external processing until
1763 the compilation unit is finalized. This is the best we can do for
1764 right now (i.e. stage 3 of GCC 4.0) - the right thing is to delay
1765 it all the way to final. See PR 17982 for further discussion. */
1766 static GTY(()) tree pending_assemble_externals
;
1768 #ifdef ASM_OUTPUT_EXTERNAL
1769 /* True if DECL is a function decl for which no out-of-line copy exists.
1770 It is assumed that DECL's assembler name has been set. */
1773 incorporeal_function_p (tree decl
)
1775 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_BUILT_IN (decl
))
1779 if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1780 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_ALLOCA
)
1783 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
1784 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
1790 /* Actually do the tests to determine if this is necessary, and invoke
1791 ASM_OUTPUT_EXTERNAL. */
1793 assemble_external_real (tree decl
)
1795 rtx rtl
= DECL_RTL (decl
);
1797 if (MEM_P (rtl
) && GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1798 && !SYMBOL_REF_USED (XEXP (rtl
, 0))
1799 && !incorporeal_function_p (decl
))
1801 /* Some systems do require some output. */
1802 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1803 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1809 process_pending_assemble_externals (void)
1811 #ifdef ASM_OUTPUT_EXTERNAL
1813 for (list
= pending_assemble_externals
; list
; list
= TREE_CHAIN (list
))
1814 assemble_external_real (TREE_VALUE (list
));
1816 pending_assemble_externals
= 0;
1820 /* Output something to declare an external symbol to the assembler.
1821 (Most assemblers don't need this, so we normally output nothing.)
1822 Do nothing if DECL is not external. */
1825 assemble_external (tree decl ATTRIBUTE_UNUSED
)
1827 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1828 main body of this code is only rarely exercised. To provide some
1829 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1830 open. If it's not, we should not be calling this function. */
1831 gcc_assert (asm_out_file
);
1833 #ifdef ASM_OUTPUT_EXTERNAL
1834 if (!DECL_P (decl
) || !DECL_EXTERNAL (decl
) || !TREE_PUBLIC (decl
))
1837 if (flag_unit_at_a_time
)
1838 pending_assemble_externals
= tree_cons (0, decl
,
1839 pending_assemble_externals
);
1841 assemble_external_real (decl
);
1845 /* Similar, for calling a library function FUN. */
1848 assemble_external_libcall (rtx fun
)
1850 /* Declare library function name external when first used, if nec. */
1851 if (! SYMBOL_REF_USED (fun
))
1853 SYMBOL_REF_USED (fun
) = 1;
1854 targetm
.asm_out
.external_libcall (fun
);
1858 /* Assemble a label named NAME. */
1861 assemble_label (const char *name
)
1863 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1866 /* Set the symbol_referenced flag for ID. */
1868 mark_referenced (tree id
)
1870 TREE_SYMBOL_REFERENCED (id
) = 1;
1873 /* Set the symbol_referenced flag for DECL and notify callgraph. */
1875 mark_decl_referenced (tree decl
)
1877 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1878 cgraph_mark_needed_node (cgraph_node (decl
));
1879 else if (TREE_CODE (decl
) == VAR_DECL
)
1880 cgraph_varpool_mark_needed_node (cgraph_varpool_node (decl
));
1881 /* else do nothing - we can get various sorts of CST nodes here,
1882 which do not need to be marked. */
1885 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1886 If NAME starts with a *, the rest of NAME is output verbatim.
1887 Otherwise NAME is transformed in an implementation-defined way
1888 (usually by the addition of an underscore).
1889 Many macros in the tm file are defined to call this function. */
1892 assemble_name (FILE *file
, const char *name
)
1894 const char *real_name
;
1897 real_name
= targetm
.strip_name_encoding (name
);
1899 id
= maybe_get_identifier (real_name
);
1901 mark_referenced (id
);
1904 fputs (&name
[1], file
);
1906 ASM_OUTPUT_LABELREF (file
, name
);
1909 /* Allocate SIZE bytes writable static space with a gensym name
1910 and return an RTX to refer to its address. */
1913 assemble_static_space (unsigned HOST_WIDE_INT size
)
1916 const char *namestring
;
1920 if (flag_shared_data
)
1924 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1926 namestring
= ggc_strdup (name
);
1928 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1929 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
1931 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1932 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1935 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1936 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1939 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1940 so that each uninitialized object starts on such a boundary. */
1941 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1942 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1943 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1944 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1945 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1946 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1953 /* Assemble the static constant template for function entry trampolines.
1954 This is done at most once per compilation.
1955 Returns an RTX for the address of the template. */
1957 static GTY(()) rtx initial_trampoline
;
1959 #ifdef TRAMPOLINE_TEMPLATE
1961 assemble_trampoline_template (void)
1968 if (initial_trampoline
)
1969 return initial_trampoline
;
1971 /* By default, put trampoline templates in read-only data section. */
1973 #ifdef TRAMPOLINE_SECTION
1974 TRAMPOLINE_SECTION ();
1976 readonly_data_section ();
1979 /* Write the assembler code to define one. */
1980 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1983 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1986 targetm
.asm_out
.internal_label (asm_out_file
, "LTRAMP", 0);
1987 TRAMPOLINE_TEMPLATE (asm_out_file
);
1989 /* Record the rtl to refer to it. */
1990 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1991 name
= ggc_strdup (label
);
1992 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
1993 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
1995 initial_trampoline
= gen_rtx_MEM (BLKmode
, symbol
);
1996 set_mem_align (initial_trampoline
, TRAMPOLINE_ALIGNMENT
);
1998 return initial_trampoline
;
2002 /* A and B are either alignments or offsets. Return the minimum alignment
2003 that may be assumed after adding the two together. */
2005 static inline unsigned
2006 min_align (unsigned int a
, unsigned int b
)
2008 return (a
| b
) & -(a
| b
);
2011 /* Return the assembler directive for creating a given kind of integer
2012 object. SIZE is the number of bytes in the object and ALIGNED_P
2013 indicates whether it is known to be aligned. Return NULL if the
2014 assembly dialect has no such directive.
2016 The returned string should be printed at the start of a new line and
2017 be followed immediately by the object's initial value. */
2020 integer_asm_op (int size
, int aligned_p
)
2022 struct asm_int_op
*ops
;
2025 ops
= &targetm
.asm_out
.aligned_op
;
2027 ops
= &targetm
.asm_out
.unaligned_op
;
2032 return targetm
.asm_out
.byte_op
;
2046 /* Use directive OP to assemble an integer object X. Print OP at the
2047 start of the line, followed immediately by the value of X. */
2050 assemble_integer_with_op (const char *op
, rtx x
)
2052 fputs (op
, asm_out_file
);
2053 output_addr_const (asm_out_file
, x
);
2054 fputc ('\n', asm_out_file
);
2057 /* The default implementation of the asm_out.integer target hook. */
2060 default_assemble_integer (rtx x ATTRIBUTE_UNUSED
,
2061 unsigned int size ATTRIBUTE_UNUSED
,
2062 int aligned_p ATTRIBUTE_UNUSED
)
2064 const char *op
= integer_asm_op (size
, aligned_p
);
2065 /* Avoid GAS bugs for large values. Specifically negative values whose
2066 absolute value fits in a bfd_vma, but not in a bfd_signed_vma. */
2067 if (size
> UNITS_PER_WORD
&& size
> POINTER_SIZE
/ BITS_PER_UNIT
)
2069 return op
&& (assemble_integer_with_op (op
, x
), true);
2072 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
2073 the alignment of the integer in bits. Return 1 if we were able to output
2074 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
2078 assemble_integer (rtx x
, unsigned int size
, unsigned int align
, int force
)
2082 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
2084 /* See if the target hook can handle this kind of object. */
2085 if (targetm
.asm_out
.integer (x
, size
, aligned_p
))
2088 /* If the object is a multi-byte one, try splitting it up. Split
2089 it into words it if is multi-word, otherwise split it into bytes. */
2092 enum machine_mode omode
, imode
;
2093 unsigned int subalign
;
2094 unsigned int subsize
, i
;
2096 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
2097 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
2098 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
2099 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
2101 for (i
= 0; i
< size
; i
+= subsize
)
2103 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
2104 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
2110 /* If we've printed some of it, but not all of it, there's no going
2123 assemble_real (REAL_VALUE_TYPE d
, enum machine_mode mode
, unsigned int align
)
2127 int bitsize
, nelts
, nunits
, units_per
;
2129 /* This is hairy. We have a quantity of known size. real_to_target
2130 will put it into an array of *host* longs, 32 bits per element
2131 (even if long is more than 32 bits). We need to determine the
2132 number of array elements that are occupied (nelts) and the number
2133 of *target* min-addressable units that will be occupied in the
2134 object file (nunits). We cannot assume that 32 divides the
2135 mode's bitsize (size * BITS_PER_UNIT) evenly.
2137 size * BITS_PER_UNIT is used here to make sure that padding bits
2138 (which might appear at either end of the value; real_to_target
2139 will include the padding bits in its output array) are included. */
2141 nunits
= GET_MODE_SIZE (mode
);
2142 bitsize
= nunits
* BITS_PER_UNIT
;
2143 nelts
= CEIL (bitsize
, 32);
2144 units_per
= 32 / BITS_PER_UNIT
;
2146 real_to_target (data
, &d
, mode
);
2148 /* Put out the first word with the specified alignment. */
2149 assemble_integer (GEN_INT (data
[0]), MIN (nunits
, units_per
), align
, 1);
2150 nunits
-= units_per
;
2152 /* Subsequent words need only 32-bit alignment. */
2153 align
= min_align (align
, 32);
2155 for (i
= 1; i
< nelts
; i
++)
2157 assemble_integer (GEN_INT (data
[i
]), MIN (nunits
, units_per
), align
, 1);
2158 nunits
-= units_per
;
2162 /* Given an expression EXP with a constant value,
2163 reduce it to the sum of an assembler symbol and an integer.
2164 Store them both in the structure *VALUE.
2165 Abort if EXP does not reduce. */
2167 struct addr_const
GTY(())
2170 HOST_WIDE_INT offset
;
2174 decode_addr_const (tree exp
, struct addr_const
*value
)
2176 tree target
= TREE_OPERAND (exp
, 0);
2182 if (TREE_CODE (target
) == COMPONENT_REF
2183 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2186 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2187 target
= TREE_OPERAND (target
, 0);
2189 else if (TREE_CODE (target
) == ARRAY_REF
2190 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2192 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2193 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2194 target
= TREE_OPERAND (target
, 0);
2200 switch (TREE_CODE (target
))
2204 x
= DECL_RTL (target
);
2208 x
= gen_rtx_MEM (FUNCTION_MODE
,
2209 gen_rtx_LABEL_REF (VOIDmode
, force_label_rtx (target
)));
2217 x
= output_constant_def (target
, 1);
2229 value
->offset
= offset
;
2232 /* Uniquize all constants that appear in memory.
2233 Each constant in memory thus far output is recorded
2234 in `const_desc_table'. */
2236 struct constant_descriptor_tree
GTY(())
2238 /* A MEM for the constant. */
2241 /* The value of the constant. */
2245 static GTY((param_is (struct constant_descriptor_tree
)))
2246 htab_t const_desc_htab
;
2248 static struct constant_descriptor_tree
* build_constant_desc (tree
);
2249 static void maybe_output_constant_def_contents (struct constant_descriptor_tree
*, int);
2251 /* Compute a hash code for a constant expression. */
2254 const_desc_hash (const void *ptr
)
2256 return const_hash_1 (((struct constant_descriptor_tree
*)ptr
)->value
);
2260 const_hash_1 (const tree exp
)
2265 enum tree_code code
= TREE_CODE (exp
);
2267 /* Either set P and LEN to the address and len of something to hash and
2268 exit the switch or return a value. */
2273 p
= (char *) &TREE_INT_CST (exp
);
2274 len
= sizeof TREE_INT_CST (exp
);
2278 return real_hash (TREE_REAL_CST_PTR (exp
));
2281 p
= TREE_STRING_POINTER (exp
);
2282 len
= TREE_STRING_LENGTH (exp
);
2286 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2287 + const_hash_1 (TREE_IMAGPART (exp
)));
2293 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2295 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2296 if (TREE_VALUE (link
))
2297 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2305 struct addr_const value
;
2307 decode_addr_const (exp
, &value
);
2308 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2310 /* Don't hash the address of the SYMBOL_REF;
2311 only use the offset and the symbol name. */
2313 p
= XSTR (value
.base
, 0);
2314 for (i
= 0; p
[i
] != 0; i
++)
2315 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2317 else if (GET_CODE (value
.base
) == LABEL_REF
)
2318 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2326 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2327 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2331 case NON_LVALUE_EXPR
:
2332 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2335 /* A language specific constant. Just hash the code. */
2339 /* Compute hashing function. */
2341 for (i
= 0; i
< len
; i
++)
2342 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2347 /* Wrapper of compare_constant, for the htab interface. */
2349 const_desc_eq (const void *p1
, const void *p2
)
2351 return compare_constant (((struct constant_descriptor_tree
*)p1
)->value
,
2352 ((struct constant_descriptor_tree
*)p2
)->value
);
2355 /* Compare t1 and t2, and return 1 only if they are known to result in
2356 the same bit pattern on output. */
2359 compare_constant (const tree t1
, const tree t2
)
2361 enum tree_code typecode
;
2363 if (t1
== NULL_TREE
)
2364 return t2
== NULL_TREE
;
2365 if (t2
== NULL_TREE
)
2368 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2371 switch (TREE_CODE (t1
))
2374 /* Integer constants are the same only if the same width of type. */
2375 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2377 return tree_int_cst_equal (t1
, t2
);
2380 /* Real constants are the same only if the same width of type. */
2381 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2384 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2387 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2390 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2391 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2392 TREE_STRING_LENGTH (t1
)));
2395 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2396 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2402 typecode
= TREE_CODE (TREE_TYPE (t1
));
2403 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2406 if (typecode
== ARRAY_TYPE
)
2408 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2409 /* For arrays, check that the sizes all match. */
2410 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2412 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2417 /* For record and union constructors, require exact type
2419 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2423 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2425 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2427 /* Check that each value is the same... */
2428 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2430 /* ... and that they apply to the same fields! */
2431 if (typecode
== ARRAY_TYPE
)
2433 if (! compare_constant (TREE_PURPOSE (l1
),
2439 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2444 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2450 struct addr_const value1
, value2
;
2452 decode_addr_const (t1
, &value1
);
2453 decode_addr_const (t2
, &value2
);
2454 return (value1
.offset
== value2
.offset
2455 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2461 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2462 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2466 case NON_LVALUE_EXPR
:
2467 case VIEW_CONVERT_EXPR
:
2468 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2473 nt1
= lang_hooks
.expand_constant (t1
);
2474 nt2
= lang_hooks
.expand_constant (t2
);
2475 if (nt1
!= t1
|| nt2
!= t2
)
2476 return compare_constant (nt1
, nt2
);
2482 /* Should not get here. */
2486 /* Make a copy of the whole tree structure for a constant. This
2487 handles the same types of nodes that compare_constant handles. */
2490 copy_constant (tree exp
)
2492 switch (TREE_CODE (exp
))
2495 /* For ADDR_EXPR, we do not want to copy the decl whose address
2496 is requested. We do want to copy constants though. */
2497 if (CONSTANT_CLASS_P (TREE_OPERAND (exp
, 0)))
2498 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2499 copy_constant (TREE_OPERAND (exp
, 0)));
2501 return copy_node (exp
);
2506 return copy_node (exp
);
2509 return build_complex (TREE_TYPE (exp
),
2510 copy_constant (TREE_REALPART (exp
)),
2511 copy_constant (TREE_IMAGPART (exp
)));
2515 return build2 (TREE_CODE (exp
), TREE_TYPE (exp
),
2516 copy_constant (TREE_OPERAND (exp
, 0)),
2517 copy_constant (TREE_OPERAND (exp
, 1)));
2521 case NON_LVALUE_EXPR
:
2522 case VIEW_CONVERT_EXPR
:
2523 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2524 copy_constant (TREE_OPERAND (exp
, 0)));
2528 tree copy
= copy_node (exp
);
2529 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2532 CONSTRUCTOR_ELTS (copy
) = list
;
2533 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2534 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2542 t
= lang_hooks
.expand_constant (exp
);
2544 return copy_constant (t
);
2551 /* Subroutine of output_constant_def:
2552 No constant equal to EXP is known to have been output.
2553 Make a constant descriptor to enter EXP in the hash table.
2554 Assign the label number and construct RTL to refer to the
2555 constant's location in memory.
2556 Caller is responsible for updating the hash table. */
2558 static struct constant_descriptor_tree
*
2559 build_constant_desc (tree exp
)
2565 struct constant_descriptor_tree
*desc
;
2567 desc
= ggc_alloc (sizeof (*desc
));
2568 desc
->value
= copy_constant (exp
);
2570 /* Propagate marked-ness to copied constant. */
2571 if (flag_mudflap
&& mf_marked_p (exp
))
2572 mf_mark (desc
->value
);
2574 /* Create a string containing the label name, in LABEL. */
2575 labelno
= const_labelno
++;
2576 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2578 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2579 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2580 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2581 SYMBOL_REF_DECL (symbol
) = desc
->value
;
2582 TREE_CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2584 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2585 set_mem_attributes (rtl
, exp
, 1);
2586 set_mem_alias_set (rtl
, 0);
2587 set_mem_alias_set (rtl
, const_alias_set
);
2589 /* Set flags or add text to the name to record information, such as
2590 that it is a local symbol. If the name is changed, the macro
2591 ASM_OUTPUT_LABELREF will have to know how to strip this
2592 information. This call might invalidate our local variable
2593 SYMBOL; we can't use it afterward. */
2595 targetm
.encode_section_info (exp
, rtl
, true);
2602 /* Return an rtx representing a reference to constant data in memory
2603 for the constant expression EXP.
2605 If assembler code for such a constant has already been output,
2606 return an rtx to refer to it.
2607 Otherwise, output such a constant in memory
2608 and generate an rtx for it.
2610 If DEFER is nonzero, this constant can be deferred and output only
2611 if referenced in the function after all optimizations.
2613 `const_desc_table' records which constants already have label strings. */
2616 output_constant_def (tree exp
, int defer
)
2618 struct constant_descriptor_tree
*desc
;
2619 struct constant_descriptor_tree key
;
2622 /* Look up EXP in the table of constant descriptors. If we didn't find
2623 it, create a new one. */
2625 loc
= htab_find_slot (const_desc_htab
, &key
, INSERT
);
2630 desc
= build_constant_desc (exp
);
2634 maybe_output_constant_def_contents (desc
, defer
);
2638 /* Subroutine of output_constant_def: Decide whether or not we need to
2639 output the constant DESC now, and if so, do it. */
2641 maybe_output_constant_def_contents (struct constant_descriptor_tree
*desc
,
2644 rtx symbol
= XEXP (desc
->rtl
, 0);
2645 tree exp
= desc
->value
;
2647 if (flag_syntax_only
)
2650 if (TREE_ASM_WRITTEN (exp
))
2651 /* Already output; don't do it again. */
2654 /* We can always defer constants as long as the context allows
2658 /* Increment n_deferred_constants if it exists. It needs to be at
2659 least as large as the number of constants actually referred to
2660 by the function. If it's too small we'll stop looking too early
2661 and fail to emit constants; if it's too large we'll only look
2662 through the entire function when we could have stopped earlier. */
2664 n_deferred_constants
++;
2668 output_constant_def_contents (symbol
);
2671 /* We must output the constant data referred to by SYMBOL; do so. */
2674 output_constant_def_contents (rtx symbol
)
2676 tree exp
= SYMBOL_REF_DECL (symbol
);
2677 const char *label
= XSTR (symbol
, 0);
2680 /* Make sure any other constants whose addresses appear in EXP
2681 are assigned label numbers. */
2682 int reloc
= compute_reloc_for_constant (exp
);
2684 /* Align the location counter as required by EXP's data type. */
2685 unsigned int align
= TYPE_ALIGN (TREE_TYPE (exp
));
2686 #ifdef CONSTANT_ALIGNMENT
2687 align
= CONSTANT_ALIGNMENT (exp
, align
);
2690 output_addressed_constants (exp
);
2692 /* We are no longer deferring this constant. */
2693 TREE_ASM_WRITTEN (exp
) = 1;
2695 if (IN_NAMED_SECTION (exp
))
2696 named_section (exp
, NULL
, reloc
);
2698 targetm
.asm_out
.select_section (exp
, reloc
, align
);
2700 if (align
> BITS_PER_UNIT
)
2702 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2705 size
= int_size_in_bytes (TREE_TYPE (exp
));
2706 if (TREE_CODE (exp
) == STRING_CST
)
2707 size
= MAX (TREE_STRING_LENGTH (exp
), size
);
2709 /* Do any machine/system dependent processing of the constant. */
2710 #ifdef ASM_DECLARE_CONSTANT_NAME
2711 ASM_DECLARE_CONSTANT_NAME (asm_out_file
, label
, exp
, size
);
2713 /* Standard thing is just output label for the constant. */
2714 ASM_OUTPUT_LABEL (asm_out_file
, label
);
2715 #endif /* ASM_DECLARE_CONSTANT_NAME */
2717 /* Output the value of EXP. */
2718 output_constant (exp
, size
, align
);
2720 mudflap_enqueue_constant (exp
);
2723 /* Look up EXP in the table of constant descriptors. Return the rtl
2724 if it has been emitted, else null. */
2727 lookup_constant_def (tree exp
)
2729 struct constant_descriptor_tree
*desc
;
2730 struct constant_descriptor_tree key
;
2733 desc
= htab_find (const_desc_htab
, &key
);
2735 return (desc
? desc
->rtl
: NULL_RTX
);
2738 /* Used in the hash tables to avoid outputting the same constant
2739 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2740 are output once per function, not once per file. */
2741 /* ??? Only a few targets need per-function constant pools. Most
2742 can use one per-file pool. Should add a targetm bit to tell the
2745 struct rtx_constant_pool
GTY(())
2747 /* Pointers to first and last constant in pool, as ordered by offset. */
2748 struct constant_descriptor_rtx
*first
;
2749 struct constant_descriptor_rtx
*last
;
2751 /* Hash facility for making memory-constants from constant rtl-expressions.
2752 It is used on RISC machines where immediate integer arguments and
2753 constant addresses are restricted so that such constants must be stored
2755 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_htab
;
2756 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_sym_htab
;
2758 /* Current offset in constant pool (does not include any
2759 machine-specific header). */
2760 HOST_WIDE_INT offset
;
2763 struct constant_descriptor_rtx
GTY((chain_next ("%h.next")))
2765 struct constant_descriptor_rtx
*next
;
2769 HOST_WIDE_INT offset
;
2771 enum machine_mode mode
;
2777 /* Hash and compare functions for const_rtx_htab. */
2780 const_desc_rtx_hash (const void *ptr
)
2782 const struct constant_descriptor_rtx
*desc
= ptr
;
2787 const_desc_rtx_eq (const void *a
, const void *b
)
2789 const struct constant_descriptor_rtx
*x
= a
;
2790 const struct constant_descriptor_rtx
*y
= b
;
2792 if (x
->mode
!= y
->mode
)
2794 return rtx_equal_p (x
->constant
, y
->constant
);
2797 /* Hash and compare functions for const_rtx_sym_htab. */
2800 const_desc_rtx_sym_hash (const void *ptr
)
2802 const struct constant_descriptor_rtx
*desc
= ptr
;
2803 return htab_hash_string (XSTR (desc
->sym
, 0));
2807 const_desc_rtx_sym_eq (const void *a
, const void *b
)
2809 const struct constant_descriptor_rtx
*x
= a
;
2810 const struct constant_descriptor_rtx
*y
= b
;
2811 return XSTR (x
->sym
, 0) == XSTR (y
->sym
, 0);
2814 /* This is the worker function for const_rtx_hash, called via for_each_rtx. */
2817 const_rtx_hash_1 (rtx
*xp
, void *data
)
2819 unsigned HOST_WIDE_INT hwi
;
2820 enum machine_mode mode
;
2826 code
= GET_CODE (x
);
2827 mode
= GET_MODE (x
);
2828 h
= (hashval_t
) code
* 1048573 + mode
;
2836 const int shift
= sizeof (hashval_t
) * CHAR_BIT
;
2837 const int n
= sizeof (HOST_WIDE_INT
) / sizeof (hashval_t
);
2840 h
^= (hashval_t
) hwi
;
2841 for (i
= 1; i
< n
; ++i
)
2844 h
^= (hashval_t
) hwi
;
2850 if (mode
== VOIDmode
)
2852 hwi
= CONST_DOUBLE_LOW (x
) ^ CONST_DOUBLE_HIGH (x
);
2856 h
^= real_hash (CONST_DOUBLE_REAL_VALUE (x
));
2860 h
^= htab_hash_string (XSTR (x
, 0));
2864 h
= h
* 251 + CODE_LABEL_NUMBER (XEXP (x
, 0));
2868 case UNSPEC_VOLATILE
:
2869 h
= h
* 251 + XINT (x
, 1);
2877 *hp
= *hp
* 509 + h
;
2881 /* Compute a hash value for X, which should be a constant. */
2884 const_rtx_hash (rtx x
)
2887 for_each_rtx (&x
, const_rtx_hash_1
, &h
);
2892 /* Initialize constant pool hashing for a new function. */
2895 init_varasm_status (struct function
*f
)
2897 struct varasm_status
*p
;
2898 struct rtx_constant_pool
*pool
;
2900 p
= ggc_alloc (sizeof (struct varasm_status
));
2903 pool
= ggc_alloc (sizeof (struct rtx_constant_pool
));
2905 p
->deferred_constants
= 0;
2907 pool
->const_rtx_htab
= htab_create_ggc (31, const_desc_rtx_hash
,
2908 const_desc_rtx_eq
, NULL
);
2909 pool
->const_rtx_sym_htab
= htab_create_ggc (31, const_desc_rtx_sym_hash
,
2910 const_desc_rtx_sym_eq
, NULL
);
2911 pool
->first
= pool
->last
= NULL
;
2915 /* Given a MINUS expression, simplify it if both sides
2916 include the same symbol. */
2919 simplify_subtraction (rtx x
)
2921 rtx r
= simplify_rtx (x
);
2925 /* Given a constant rtx X, make (or find) a memory constant for its value
2926 and return a MEM rtx to refer to it in memory. */
2929 force_const_mem (enum machine_mode mode
, rtx x
)
2931 struct constant_descriptor_rtx
*desc
, tmp
;
2932 struct rtx_constant_pool
*pool
= cfun
->varasm
->pool
;
2939 /* If we're not allowed to drop X into the constant pool, don't. */
2940 if (targetm
.cannot_force_const_mem (x
))
2943 /* Lookup the value in the hashtable. */
2946 hash
= const_rtx_hash (x
);
2947 slot
= htab_find_slot_with_hash (pool
->const_rtx_htab
, &tmp
, hash
, INSERT
);
2950 /* If the constant was already present, return its memory. */
2952 return copy_rtx (desc
->mem
);
2954 /* Otherwise, create a new descriptor. */
2955 desc
= ggc_alloc (sizeof (*desc
));
2958 /* Align the location counter as required by EXP's data type. */
2959 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
2960 #ifdef CONSTANT_ALIGNMENT
2962 tree type
= lang_hooks
.types
.type_for_mode (mode
, 0);
2963 if (type
!= NULL_TREE
)
2964 align
= CONSTANT_ALIGNMENT (make_tree (type
, x
), align
);
2968 pool
->offset
+= (align
/ BITS_PER_UNIT
) - 1;
2969 pool
->offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
2972 desc
->constant
= tmp
.constant
;
2973 desc
->offset
= pool
->offset
;
2976 desc
->align
= align
;
2977 desc
->labelno
= const_labelno
;
2980 pool
->offset
+= GET_MODE_SIZE (mode
);
2982 pool
->last
->next
= desc
;
2984 pool
->first
= pool
->last
= desc
;
2987 /* Create a string containing the label name, in LABEL. */
2988 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2991 /* Construct the SYMBOL_REF. Make sure to mark it as belonging to
2992 the constants pool. */
2993 desc
->sym
= symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2994 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2995 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2996 current_function_uses_const_pool
= 1;
2998 /* Insert the descriptor into the symbol cross-reference table too. */
2999 slot
= htab_find_slot (pool
->const_rtx_sym_htab
, desc
, INSERT
);
3004 /* Construct the MEM. */
3005 desc
->mem
= def
= gen_const_mem (mode
, symbol
);
3006 set_mem_attributes (def
, lang_hooks
.types
.type_for_mode (mode
, 0), 1);
3008 /* If we're dropping a label to the constant pool, make sure we
3010 if (GET_CODE (x
) == LABEL_REF
)
3011 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
3013 return copy_rtx (def
);
3016 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3017 the corresponding constant_descriptor_rtx structure. */
3019 static struct constant_descriptor_rtx
*
3020 find_pool_constant (struct rtx_constant_pool
*pool
, rtx sym
)
3022 struct constant_descriptor_rtx tmp
;
3024 return htab_find (pool
->const_rtx_sym_htab
, &tmp
);
3027 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3030 get_pool_constant (rtx addr
)
3032 return find_pool_constant (cfun
->varasm
->pool
, addr
)->constant
;
3035 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3036 and whether it has been output or not. */
3039 get_pool_constant_mark (rtx addr
, bool *pmarked
)
3041 struct constant_descriptor_rtx
*desc
;
3043 desc
= find_pool_constant (cfun
->varasm
->pool
, addr
);
3044 *pmarked
= (desc
->mark
!= 0);
3045 return desc
->constant
;
3048 /* Likewise, but for the constant pool of a specific function. */
3051 get_pool_constant_for_function (struct function
*f
, rtx addr
)
3053 return find_pool_constant (f
->varasm
->pool
, addr
)->constant
;
3056 /* Similar, return the mode. */
3059 get_pool_mode (rtx addr
)
3061 return find_pool_constant (cfun
->varasm
->pool
, addr
)->mode
;
3064 /* Return the size of the constant pool. */
3067 get_pool_size (void)
3069 return cfun
->varasm
->pool
->offset
;
3072 /* Worker function for output_constant_pool_1. Emit assembly for X
3073 in MODE with known alignment ALIGN. */
3076 output_constant_pool_2 (enum machine_mode mode
, rtx x
, unsigned int align
)
3078 switch (GET_MODE_CLASS (mode
))
3081 if (GET_CODE (x
) != CONST_DOUBLE
)
3086 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3087 assemble_real (r
, mode
, align
);
3092 case MODE_PARTIAL_INT
:
3093 assemble_integer (x
, GET_MODE_SIZE (mode
), align
, 1);
3096 case MODE_VECTOR_FLOAT
:
3097 case MODE_VECTOR_INT
:
3100 enum machine_mode submode
= GET_MODE_INNER (mode
);
3101 unsigned int subalign
= MIN (align
, GET_MODE_BITSIZE (submode
));
3103 if (GET_CODE (x
) != CONST_VECTOR
)
3105 units
= CONST_VECTOR_NUNITS (x
);
3107 for (i
= 0; i
< units
; i
++)
3109 rtx elt
= CONST_VECTOR_ELT (x
, i
);
3110 output_constant_pool_2 (submode
, elt
, i
? subalign
: align
);
3120 /* Worker function for output_constant_pool. Emit POOL. */
3123 output_constant_pool_1 (struct constant_descriptor_rtx
*desc
)
3131 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3132 whose CODE_LABEL has been deleted. This can occur if a jump table
3133 is eliminated by optimization. If so, write a constant of zero
3134 instead. Note that this can also happen by turning the
3135 CODE_LABEL into a NOTE. */
3136 /* ??? This seems completely and utterly wrong. Certainly it's
3137 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3138 functioning even with INSN_DELETED_P and friends. */
3141 switch (GET_CODE (x
))
3144 if (GET_CODE (XEXP (x
, 0)) != PLUS
3145 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3147 tmp
= XEXP (XEXP (x
, 0), 0);
3152 if (INSN_DELETED_P (tmp
)
3154 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3165 /* First switch to correct section. */
3166 targetm
.asm_out
.select_rtx_section (desc
->mode
, x
, desc
->align
);
3168 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3169 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, desc
->mode
,
3170 desc
->align
, desc
->labelno
, done
);
3173 assemble_align (desc
->align
);
3175 /* Output the label. */
3176 targetm
.asm_out
.internal_label (asm_out_file
, "LC", desc
->labelno
);
3178 /* Output the data. */
3179 output_constant_pool_2 (desc
->mode
, x
, desc
->align
);
3181 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3182 sections have proper size. */
3183 if (desc
->align
> GET_MODE_BITSIZE (desc
->mode
)
3184 && in_section
== in_named
3185 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3186 assemble_align (desc
->align
);
3188 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3194 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3195 to as used. Emit referenced deferred strings. This function can
3196 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3199 mark_constant (rtx
*current_rtx
, void *data
)
3201 struct rtx_constant_pool
*pool
= data
;
3202 rtx x
= *current_rtx
;
3204 if (x
== NULL_RTX
|| GET_CODE (x
) != SYMBOL_REF
)
3207 if (CONSTANT_POOL_ADDRESS_P (x
))
3209 struct constant_descriptor_rtx
*desc
= find_pool_constant (pool
, x
);
3210 if (desc
->mark
== 0)
3213 for_each_rtx (&desc
->constant
, mark_constant
, pool
);
3216 else if (TREE_CONSTANT_POOL_ADDRESS_P (x
))
3218 tree exp
= SYMBOL_REF_DECL (x
);
3219 if (!TREE_ASM_WRITTEN (exp
))
3221 n_deferred_constants
--;
3222 output_constant_def_contents (x
);
3229 /* Look through appropriate parts of INSN, marking all entries in the
3230 constant pool which are actually being used. Entries that are only
3231 referenced by other constants are also marked as used. Emit
3232 deferred strings that are used. */
3235 mark_constants (struct rtx_constant_pool
*pool
, rtx insn
)
3240 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3241 insns, not any notes that may be attached. We don't want to mark
3242 a constant just because it happens to appear in a REG_EQUIV note. */
3243 if (GET_CODE (PATTERN (insn
)) == SEQUENCE
)
3245 rtx seq
= PATTERN (insn
);
3246 int i
, n
= XVECLEN (seq
, 0);
3247 for (i
= 0; i
< n
; ++i
)
3249 rtx subinsn
= XVECEXP (seq
, 0, i
);
3250 if (INSN_P (subinsn
))
3251 for_each_rtx (&PATTERN (subinsn
), mark_constant
, pool
);
3255 for_each_rtx (&PATTERN (insn
), mark_constant
, pool
);
3258 /* Look through the instructions for this function, and mark all the
3259 entries in POOL which are actually being used. Emit deferred constants
3260 which have indeed been used. */
3263 mark_constant_pool (struct rtx_constant_pool
*pool
)
3267 if (pool
->first
== 0 && n_deferred_constants
== 0)
3270 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3271 mark_constants (pool
, insn
);
3273 for (link
= current_function_epilogue_delay_list
;
3275 link
= XEXP (link
, 1))
3276 mark_constants (pool
, XEXP (link
, 0));
3279 /* Write all the constants in the constant pool. */
3282 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED
,
3283 tree fndecl ATTRIBUTE_UNUSED
)
3285 struct rtx_constant_pool
*pool
= cfun
->varasm
->pool
;
3286 struct constant_descriptor_rtx
*desc
;
3288 /* It is possible for gcc to call force_const_mem and then to later
3289 discard the instructions which refer to the constant. In such a
3290 case we do not need to output the constant. */
3291 mark_constant_pool (pool
);
3293 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3294 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3297 for (desc
= pool
->first
; desc
; desc
= desc
->next
)
3298 output_constant_pool_1 (desc
);
3300 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3301 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3305 /* Determine what kind of relocations EXP may need. */
3308 compute_reloc_for_constant (tree exp
)
3310 int reloc
= 0, reloc2
;
3313 /* Give the front-end a chance to convert VALUE to something that
3314 looks more like a constant to the back-end. */
3315 exp
= lang_hooks
.expand_constant (exp
);
3317 switch (TREE_CODE (exp
))
3321 /* Go inside any operations that get_inner_reference can handle and see
3322 if what's inside is a constant: no need to do anything here for
3323 addresses of variables or functions. */
3324 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3325 tem
= TREE_OPERAND (tem
, 0))
3328 if (TREE_PUBLIC (tem
))
3335 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3336 reloc
|= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3340 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3341 reloc2
= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3342 /* The difference of two local labels is computable at link time. */
3343 if (reloc
== 1 && reloc2
== 1)
3351 case NON_LVALUE_EXPR
:
3352 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3356 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3357 if (TREE_VALUE (tem
) != 0)
3358 reloc
|= compute_reloc_for_constant (TREE_VALUE (tem
));
3368 /* Find all the constants whose addresses are referenced inside of EXP,
3369 and make sure assembler code with a label has been output for each one.
3370 Indicate whether an ADDR_EXPR has been encountered. */
3373 output_addressed_constants (tree exp
)
3377 /* Give the front-end a chance to convert VALUE to something that
3378 looks more like a constant to the back-end. */
3379 exp
= lang_hooks
.expand_constant (exp
);
3381 switch (TREE_CODE (exp
))
3385 /* Go inside any operations that get_inner_reference can handle and see
3386 if what's inside is a constant: no need to do anything here for
3387 addresses of variables or functions. */
3388 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3389 tem
= TREE_OPERAND (tem
, 0))
3392 /* If we have an initialized CONST_DECL, retrieve the initializer. */
3393 if (TREE_CODE (tem
) == CONST_DECL
&& DECL_INITIAL (tem
))
3394 tem
= DECL_INITIAL (tem
);
3396 if (CONSTANT_CLASS_P (tem
) || TREE_CODE (tem
) == CONSTRUCTOR
)
3397 output_constant_def (tem
, 0);
3402 output_addressed_constants (TREE_OPERAND (exp
, 1));
3407 case NON_LVALUE_EXPR
:
3408 output_addressed_constants (TREE_OPERAND (exp
, 0));
3412 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3413 if (TREE_VALUE (tem
) != 0)
3414 output_addressed_constants (TREE_VALUE (tem
));
3423 /* Return nonzero if VALUE is a valid constant-valued expression
3424 for use in initializing a static variable; one that can be an
3425 element of a "constant" initializer.
3427 Return null_pointer_node if the value is absolute;
3428 if it is relocatable, return the variable that determines the relocation.
3429 We assume that VALUE has been folded as much as possible;
3430 therefore, we do not need to check for such things as
3431 arithmetic-combinations of integers. */
3434 initializer_constant_valid_p (tree value
, tree endtype
)
3436 /* Give the front-end a chance to convert VALUE to something that
3437 looks more like a constant to the back-end. */
3438 value
= lang_hooks
.expand_constant (value
);
3440 switch (TREE_CODE (value
))
3443 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3444 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3445 && TREE_CONSTANT (value
)
3446 && CONSTRUCTOR_ELTS (value
))
3449 bool absolute
= true;
3451 for (elt
= CONSTRUCTOR_ELTS (value
); elt
; elt
= TREE_CHAIN (elt
))
3454 value
= TREE_VALUE (elt
);
3455 reloc
= initializer_constant_valid_p (value
, TREE_TYPE (value
));
3458 if (reloc
!= null_pointer_node
)
3461 /* For a non-absolute relocation, there is no single
3462 variable that can be "the variable that determines the
3464 return absolute
? null_pointer_node
: error_mark_node
;
3467 return TREE_STATIC (value
) ? null_pointer_node
: NULL_TREE
;
3474 return null_pointer_node
;
3478 value
= staticp (TREE_OPERAND (value
, 0));
3479 /* "&(*a).f" is like unto pointer arithmetic. If "a" turns out to
3480 be a constant, this is old-skool offsetof-like nonsense. */
3482 && TREE_CODE (value
) == INDIRECT_REF
3483 && TREE_CONSTANT (TREE_OPERAND (value
, 0)))
3484 return null_pointer_node
;
3487 case VIEW_CONVERT_EXPR
:
3488 case NON_LVALUE_EXPR
:
3489 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3493 /* Allow conversions between pointer types. */
3494 if (POINTER_TYPE_P (TREE_TYPE (value
))
3495 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3496 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3498 /* Allow conversions between real types. */
3499 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3500 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3501 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3503 /* Allow length-preserving conversions between integer types. */
3504 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3505 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3506 && (TYPE_PRECISION (TREE_TYPE (value
))
3507 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3508 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3510 /* Allow conversions between other integer types only if
3512 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3513 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3515 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3517 if (inner
== null_pointer_node
)
3518 return null_pointer_node
;
3522 /* Allow (int) &foo provided int is as wide as a pointer. */
3523 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3524 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3525 && (TYPE_PRECISION (TREE_TYPE (value
))
3526 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3527 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3530 /* Likewise conversions from int to pointers, but also allow
3531 conversions from 0. */
3532 if ((POINTER_TYPE_P (TREE_TYPE (value
))
3533 || TREE_CODE (TREE_TYPE (value
)) == OFFSET_TYPE
)
3534 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3536 if (integer_zerop (TREE_OPERAND (value
, 0)))
3537 return null_pointer_node
;
3538 else if (TYPE_PRECISION (TREE_TYPE (value
))
3539 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
3540 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3544 /* Allow conversions to struct or union types if the value
3546 if (TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
3547 || TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
3548 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3553 if (! INTEGRAL_TYPE_P (endtype
)
3554 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3556 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3558 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3560 /* If either term is absolute, use the other terms relocation. */
3561 if (valid0
== null_pointer_node
)
3563 if (valid1
== null_pointer_node
)
3569 if (! INTEGRAL_TYPE_P (endtype
)
3570 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3572 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3574 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3576 /* Win if second argument is absolute. */
3577 if (valid1
== null_pointer_node
)
3579 /* Win if both arguments have the same relocation.
3580 Then the value is absolute. */
3581 if (valid0
== valid1
&& valid0
!= 0)
3582 return null_pointer_node
;
3584 /* Since GCC guarantees that string constants are unique in the
3585 generated code, a subtraction between two copies of the same
3586 constant string is absolute. */
3587 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
3588 && valid1
&& TREE_CODE (valid1
) == STRING_CST
3589 && operand_equal_p (valid0
, valid1
, 1))
3590 return null_pointer_node
;
3593 /* Support narrowing differences. */
3594 if (INTEGRAL_TYPE_P (endtype
))
3598 op0
= TREE_OPERAND (value
, 0);
3599 op1
= TREE_OPERAND (value
, 1);
3601 /* Like STRIP_NOPS except allow the operand mode to widen.
3602 This works around a feature of fold that simplifies
3603 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3604 that the narrower operation is cheaper. */
3606 while (TREE_CODE (op0
) == NOP_EXPR
3607 || TREE_CODE (op0
) == CONVERT_EXPR
3608 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3610 tree inner
= TREE_OPERAND (op0
, 0);
3611 if (inner
== error_mark_node
3612 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3613 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3614 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3619 while (TREE_CODE (op1
) == NOP_EXPR
3620 || TREE_CODE (op1
) == CONVERT_EXPR
3621 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3623 tree inner
= TREE_OPERAND (op1
, 0);
3624 if (inner
== error_mark_node
3625 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3626 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3627 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3632 op0
= initializer_constant_valid_p (op0
, endtype
);
3633 op1
= initializer_constant_valid_p (op1
, endtype
);
3635 /* Both initializers must be known. */
3639 return null_pointer_node
;
3641 /* Support differences between labels. */
3642 if (TREE_CODE (op0
) == LABEL_DECL
3643 && TREE_CODE (op1
) == LABEL_DECL
)
3644 return null_pointer_node
;
3646 if (TREE_CODE (op0
) == STRING_CST
3647 && TREE_CODE (op1
) == STRING_CST
3648 && operand_equal_p (op0
, op1
, 1))
3649 return null_pointer_node
;
3661 /* Output assembler code for constant EXP to FILE, with no label.
3662 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3663 Assumes output_addressed_constants has been done on EXP already.
3665 Generate exactly SIZE bytes of assembler data, padding at the end
3666 with zeros if necessary. SIZE must always be specified.
3668 SIZE is important for structure constructors,
3669 since trailing members may have been omitted from the constructor.
3670 It is also important for initialization of arrays from string constants
3671 since the full length of the string constant might not be wanted.
3672 It is also needed for initialization of unions, where the initializer's
3673 type is just one member, and that may not be as long as the union.
3675 There a case in which we would fail to output exactly SIZE bytes:
3676 for a structure constructor that wants to produce more than SIZE bytes.
3677 But such constructors will never be generated for any possible input.
3679 ALIGN is the alignment of the data in bits. */
3682 output_constant (tree exp
, unsigned HOST_WIDE_INT size
, unsigned int align
)
3684 enum tree_code code
;
3685 unsigned HOST_WIDE_INT thissize
;
3687 /* Some front-ends use constants other than the standard language-independent
3688 varieties, but which may still be output directly. Give the front-end a
3689 chance to convert EXP to a language-independent representation. */
3690 exp
= lang_hooks
.expand_constant (exp
);
3692 if (size
== 0 || flag_syntax_only
)
3695 /* Eliminate any conversions since we'll be outputting the underlying
3697 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3698 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3699 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3700 exp
= TREE_OPERAND (exp
, 0);
3702 code
= TREE_CODE (TREE_TYPE (exp
));
3703 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3705 /* Allow a constructor with no elements for any data type.
3706 This means to fill the space with zeros. */
3707 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3709 assemble_zeros (size
);
3713 if (TREE_CODE (exp
) == FDESC_EXPR
)
3715 #ifdef ASM_OUTPUT_FDESC
3716 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3717 tree decl
= TREE_OPERAND (exp
, 0);
3718 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3725 /* Now output the underlying data. If we've handling the padding, return.
3726 Otherwise, break and ensure SIZE is the size written. */
3734 case REFERENCE_TYPE
:
3736 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3737 EXPAND_INITIALIZER
),
3738 MIN (size
, thissize
), align
, 0))
3739 error ("initializer for integer value is too complicated");
3743 if (TREE_CODE (exp
) != REAL_CST
)
3744 error ("initializer for floating value is not a floating constant");
3746 assemble_real (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)), align
);
3750 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3751 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3752 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
3757 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3759 output_constructor (exp
, size
, align
);
3762 else if (TREE_CODE (exp
) == STRING_CST
)
3764 thissize
= MIN ((unsigned HOST_WIDE_INT
)TREE_STRING_LENGTH (exp
),
3766 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
3768 else if (TREE_CODE (exp
) == VECTOR_CST
)
3772 unsigned int nalign
;
3773 enum machine_mode inner
;
3775 inner
= TYPE_MODE (TREE_TYPE (TREE_TYPE (exp
)));
3776 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
3778 elt_size
= GET_MODE_SIZE (inner
);
3780 link
= TREE_VECTOR_CST_ELTS (exp
);
3781 output_constant (TREE_VALUE (link
), elt_size
, align
);
3782 while ((link
= TREE_CHAIN (link
)) != NULL
)
3783 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
3791 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3792 output_constructor (exp
, size
, align
);
3804 if (size
> thissize
)
3805 assemble_zeros (size
- thissize
);
3809 /* Subroutine of output_constructor, used for computing the size of
3810 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3811 type with an unspecified upper bound. */
3813 static unsigned HOST_WIDE_INT
3814 array_size_for_constructor (tree val
)
3818 /* This code used to attempt to handle string constants that are not
3819 arrays of single-bytes, but nothing else does, so there's no point in
3821 if (TREE_CODE (val
) == STRING_CST
)
3822 return TREE_STRING_LENGTH (val
);
3824 max_index
= NULL_TREE
;
3825 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
3827 tree index
= TREE_PURPOSE (i
);
3829 if (TREE_CODE (index
) == RANGE_EXPR
)
3830 index
= TREE_OPERAND (index
, 1);
3831 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
3835 if (max_index
== NULL_TREE
)
3838 /* Compute the total number of array elements. */
3839 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
3841 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
3842 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
3844 /* Multiply by the array element unit size to find number of bytes. */
3845 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
3847 return tree_low_cst (i
, 1);
3850 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3851 Generate at least SIZE bytes, padding if necessary. */
3854 output_constructor (tree exp
, unsigned HOST_WIDE_INT size
,
3857 tree type
= TREE_TYPE (exp
);
3858 tree link
, field
= 0;
3860 /* Number of bytes output or skipped so far.
3861 In other words, current position within the constructor. */
3862 HOST_WIDE_INT total_bytes
= 0;
3863 /* Nonzero means BYTE contains part of a byte, to be output. */
3864 int byte_buffer_in_use
= 0;
3867 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3870 if (TREE_CODE (type
) == RECORD_TYPE
)
3871 field
= TYPE_FIELDS (type
);
3873 if (TREE_CODE (type
) == ARRAY_TYPE
3874 && TYPE_DOMAIN (type
) != 0)
3875 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
3877 /* As LINK goes through the elements of the constant,
3878 FIELD goes through the structure fields, if the constant is a structure.
3879 if the constant is a union, then we override this,
3880 by getting the field from the TREE_LIST element.
3881 But the constant could also be an array. Then FIELD is zero.
3883 There is always a maximum of one element in the chain LINK for unions
3884 (even if the initializer in a source program incorrectly contains
3886 for (link
= CONSTRUCTOR_ELTS (exp
);
3888 link
= TREE_CHAIN (link
),
3889 field
= field
? TREE_CHAIN (field
) : 0)
3891 tree val
= TREE_VALUE (link
);
3894 /* The element in a union constructor specifies the proper field
3896 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
3897 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
3898 && TREE_PURPOSE (link
) != 0)
3899 field
= TREE_PURPOSE (link
);
3901 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3902 index
= TREE_PURPOSE (link
);
3904 #ifdef ASM_COMMENT_START
3905 if (field
&& flag_verbose_asm
)
3906 fprintf (asm_out_file
, "%s %s:\n",
3909 ? IDENTIFIER_POINTER (DECL_NAME (field
))
3913 /* Eliminate the marker that makes a cast not be an lvalue. */
3917 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
3919 unsigned HOST_WIDE_INT fieldsize
3920 = int_size_in_bytes (TREE_TYPE (type
));
3921 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
3922 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
3923 HOST_WIDE_INT index
;
3924 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
3926 for (index
= lo_index
; index
<= hi_index
; index
++)
3928 /* Output the element's initial value. */
3930 assemble_zeros (fieldsize
);
3932 output_constant (val
, fieldsize
, align2
);
3934 /* Count its size. */
3935 total_bytes
+= fieldsize
;
3938 else if (field
== 0 || !DECL_BIT_FIELD (field
))
3940 /* An element that is not a bit-field. */
3942 unsigned HOST_WIDE_INT fieldsize
;
3943 /* Since this structure is static,
3944 we know the positions are constant. */
3945 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
3946 unsigned int align2
;
3949 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
3950 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
3952 /* Output any buffered-up bit-fields preceding this element. */
3953 if (byte_buffer_in_use
)
3955 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3957 byte_buffer_in_use
= 0;
3960 /* Advance to offset of this element.
3961 Note no alignment needed in an array, since that is guaranteed
3962 if each element has the proper size. */
3963 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
3965 assemble_zeros (pos
- total_bytes
);
3969 /* Find the alignment of this element. */
3970 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
3972 /* Determine size this element should occupy. */
3977 /* If this is an array with an unspecified upper bound,
3978 the initializer determines the size. */
3979 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
3980 but we cannot do this until the deprecated support for
3981 initializing zero-length array members is removed. */
3982 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
3983 && TYPE_DOMAIN (TREE_TYPE (field
))
3984 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
3986 fieldsize
= array_size_for_constructor (val
);
3987 /* Given a non-empty initialization, this field had
3989 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
3992 else if (DECL_SIZE_UNIT (field
))
3994 /* ??? This can't be right. If the decl size overflows
3995 a host integer we will silently emit no data. */
3996 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
3997 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4001 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4003 /* Output the element's initial value. */
4005 assemble_zeros (fieldsize
);
4007 output_constant (val
, fieldsize
, align2
);
4009 /* Count its size. */
4010 total_bytes
+= fieldsize
;
4012 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4013 error ("invalid initial value for member %qs",
4014 IDENTIFIER_POINTER (DECL_NAME (field
)));
4017 /* Element that is a bit-field. */
4019 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4020 HOST_WIDE_INT end_offset
4021 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4024 val
= integer_zero_node
;
4026 /* If this field does not start in this (or, next) byte,
4028 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4030 /* Output remnant of any bit field in previous bytes. */
4031 if (byte_buffer_in_use
)
4033 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4035 byte_buffer_in_use
= 0;
4038 /* If still not at proper byte, advance to there. */
4039 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4041 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4042 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4046 if (! byte_buffer_in_use
)
4049 /* We must split the element into pieces that fall within
4050 separate bytes, and combine each byte with previous or
4051 following bit-fields. */
4053 /* next_offset is the offset n fbits from the beginning of
4054 the structure to the next bit of this element to be processed.
4055 end_offset is the offset of the first bit past the end of
4057 while (next_offset
< end_offset
)
4061 HOST_WIDE_INT value
;
4062 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4063 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4065 /* Advance from byte to byte
4066 within this element when necessary. */
4067 while (next_byte
!= total_bytes
)
4069 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4074 /* Number of bits we can process at once
4075 (all part of the same byte). */
4076 this_time
= MIN (end_offset
- next_offset
,
4077 BITS_PER_UNIT
- next_bit
);
4078 if (BYTES_BIG_ENDIAN
)
4080 /* On big-endian machine, take the most significant bits
4081 first (of the bits that are significant)
4082 and put them into bytes from the most significant end. */
4083 shift
= end_offset
- next_offset
- this_time
;
4085 /* Don't try to take a bunch of bits that cross
4086 the word boundary in the INTEGER_CST. We can
4087 only select bits from the LOW or HIGH part
4089 if (shift
< HOST_BITS_PER_WIDE_INT
4090 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4092 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4093 shift
= HOST_BITS_PER_WIDE_INT
;
4096 /* Now get the bits from the appropriate constant word. */
4097 if (shift
< HOST_BITS_PER_WIDE_INT
)
4098 value
= TREE_INT_CST_LOW (val
);
4099 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4101 value
= TREE_INT_CST_HIGH (val
);
4102 shift
-= HOST_BITS_PER_WIDE_INT
;
4107 /* Get the result. This works only when:
4108 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4109 byte
|= (((value
>> shift
)
4110 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4111 << (BITS_PER_UNIT
- this_time
- next_bit
));
4115 /* On little-endian machines,
4116 take first the least significant bits of the value
4117 and pack them starting at the least significant
4118 bits of the bytes. */
4119 shift
= next_offset
- int_bit_position (field
);
4121 /* Don't try to take a bunch of bits that cross
4122 the word boundary in the INTEGER_CST. We can
4123 only select bits from the LOW or HIGH part
4125 if (shift
< HOST_BITS_PER_WIDE_INT
4126 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4127 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4129 /* Now get the bits from the appropriate constant word. */
4130 if (shift
< HOST_BITS_PER_WIDE_INT
)
4131 value
= TREE_INT_CST_LOW (val
);
4132 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4134 value
= TREE_INT_CST_HIGH (val
);
4135 shift
-= HOST_BITS_PER_WIDE_INT
;
4140 /* Get the result. This works only when:
4141 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4142 byte
|= (((value
>> shift
)
4143 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4147 next_offset
+= this_time
;
4148 byte_buffer_in_use
= 1;
4153 if (byte_buffer_in_use
)
4155 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4159 if ((unsigned HOST_WIDE_INT
)total_bytes
< size
)
4160 assemble_zeros (size
- total_bytes
);
4163 /* This TREE_LIST contains any weak symbol declarations waiting
4165 static GTY(()) tree weak_decls
;
4167 /* Mark DECL as weak. */
4170 mark_weak (tree decl
)
4172 DECL_WEAK (decl
) = 1;
4174 if (DECL_RTL_SET_P (decl
)
4175 && MEM_P (DECL_RTL (decl
))
4176 && XEXP (DECL_RTL (decl
), 0)
4177 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4178 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4181 /* Merge weak status between NEWDECL and OLDDECL. */
4184 merge_weak (tree newdecl
, tree olddecl
)
4186 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4189 if (DECL_WEAK (newdecl
))
4193 /* NEWDECL is weak, but OLDDECL is not. */
4195 /* If we already output the OLDDECL, we're in trouble; we can't
4196 go back and make it weak. This error cannot caught in
4197 declare_weak because the NEWDECL and OLDDECL was not yet
4198 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4199 if (TREE_ASM_WRITTEN (olddecl
))
4200 error ("%Jweak declaration of %qD must precede definition",
4203 /* If we've already generated rtl referencing OLDDECL, we may
4204 have done so in a way that will not function properly with
4206 else if (TREE_USED (olddecl
)
4207 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4208 warning ("%Jweak declaration of %qD after first use results "
4209 "in unspecified behavior", newdecl
, newdecl
);
4213 /* We put the NEWDECL on the weak_decls list at some point.
4214 Replace it with the OLDDECL. */
4215 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4216 if (TREE_VALUE (wd
) == newdecl
)
4218 TREE_VALUE (wd
) = olddecl
;
4221 /* We may not find the entry on the list. If NEWDECL is a
4222 weak alias, then we will have already called
4223 globalize_decl to remove the entry; in that case, we do
4224 not need to do anything. */
4227 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4228 mark_weak (olddecl
);
4231 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4232 weak. Just update NEWDECL to indicate that it's weak too. */
4233 mark_weak (newdecl
);
4236 /* Declare DECL to be a weak symbol. */
4239 declare_weak (tree decl
)
4241 if (! TREE_PUBLIC (decl
))
4242 error ("%Jweak declaration of %qD must be public", decl
, decl
);
4243 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4244 error ("%Jweak declaration of %qD must precede definition", decl
, decl
);
4245 else if (SUPPORTS_WEAK
)
4247 if (! DECL_WEAK (decl
))
4248 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4251 warning ("%Jweak declaration of %qD not supported", decl
, decl
);
4256 /* Emit any pending weak declarations. */
4263 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4265 tree decl
= TREE_VALUE (t
);
4266 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4267 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4270 if (! TREE_USED (decl
))
4273 #ifdef ASM_WEAKEN_DECL
4274 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4276 #ifdef ASM_WEAKEN_LABEL
4277 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4279 #ifdef ASM_OUTPUT_WEAK_ALIAS
4280 warning ("only weak aliases are supported in this configuration");
4288 /* Emit the assembly bits to indicate that DECL is globally visible. */
4291 globalize_decl (tree decl
)
4293 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4295 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4296 if (DECL_WEAK (decl
))
4300 #ifdef ASM_WEAKEN_DECL
4301 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4303 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4306 /* Remove this function from the pending weak list so that
4307 we do not emit multiple .weak directives for it. */
4308 for (p
= &weak_decls
; (t
= *p
) ; )
4310 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4311 *p
= TREE_CHAIN (t
);
4313 p
= &TREE_CHAIN (t
);
4317 #elif defined(ASM_MAKE_LABEL_LINKONCE)
4318 if (DECL_ONE_ONLY (decl
))
4319 ASM_MAKE_LABEL_LINKONCE (asm_out_file
, name
);
4322 targetm
.asm_out
.globalize_label (asm_out_file
, name
);
4325 /* Emit an assembler directive to make the symbol for DECL an alias to
4326 the symbol for TARGET. */
4329 assemble_alias (tree decl
, tree target ATTRIBUTE_UNUSED
)
4333 /* We must force creation of DECL_RTL for debug info generation, even though
4334 we don't use it here. */
4335 make_decl_rtl (decl
);
4337 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4339 #ifdef ASM_OUTPUT_DEF
4340 /* Make name accessible from other files, if appropriate. */
4342 if (TREE_PUBLIC (decl
))
4344 globalize_decl (decl
);
4345 maybe_assemble_visibility (decl
);
4348 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4349 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4351 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4353 #else /* !ASM_OUTPUT_DEF */
4354 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4355 if (DECL_WEAK (decl
))
4358 #ifdef ASM_WEAKEN_DECL
4359 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4361 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4363 /* Remove this function from the pending weak list so that
4364 we do not emit multiple .weak directives for it. */
4365 for (p
= &weak_decls
; (t
= *p
) ; )
4366 if (DECL_ASSEMBLER_NAME (decl
)
4367 == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4368 *p
= TREE_CHAIN (t
);
4370 p
= &TREE_CHAIN (t
);
4373 warning ("only weak aliases are supported in this configuration");
4376 warning ("alias definitions not supported in this configuration; ignored");
4380 TREE_USED (decl
) = 1;
4381 TREE_ASM_WRITTEN (decl
) = 1;
4382 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4385 /* Emit an assembler directive to set symbol for DECL visibility to
4386 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4389 default_assemble_visibility (tree decl
, int vis
)
4391 static const char * const visibility_types
[] = {
4392 NULL
, "internal", "hidden", "protected"
4395 const char *name
, *type
;
4397 name
= (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4398 type
= visibility_types
[vis
];
4400 #ifdef HAVE_GAS_HIDDEN
4401 fprintf (asm_out_file
, "\t.%s\t", type
);
4402 assemble_name (asm_out_file
, name
);
4403 fprintf (asm_out_file
, "\n");
4405 warning ("visibility attribute not supported in this configuration; ignored");
4409 /* A helper function to call assemble_visibility when needed for a decl. */
4412 maybe_assemble_visibility (tree decl
)
4414 enum symbol_visibility vis
= DECL_VISIBILITY (decl
);
4416 if (vis
!= VISIBILITY_DEFAULT
)
4417 targetm
.asm_out
.visibility (decl
, vis
);
4420 /* Returns 1 if the target configuration supports defining public symbols
4421 so that one of them will be chosen at link time instead of generating a
4422 multiply-defined symbol error, whether through the use of weak symbols or
4423 a target-specific mechanism for having duplicates discarded. */
4426 supports_one_only (void)
4428 if (SUPPORTS_ONE_ONLY
)
4430 return SUPPORTS_WEAK
;
4433 /* Set up DECL as a public symbol that can be defined in multiple
4434 translation units without generating a linker error. */
4437 make_decl_one_only (tree decl
)
4439 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4442 TREE_PUBLIC (decl
) = 1;
4444 if (SUPPORTS_ONE_ONLY
)
4446 #ifdef MAKE_DECL_ONE_ONLY
4447 MAKE_DECL_ONE_ONLY (decl
);
4449 DECL_ONE_ONLY (decl
) = 1;
4451 else if (TREE_CODE (decl
) == VAR_DECL
4452 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4453 DECL_COMMON (decl
) = 1;
4454 else if (SUPPORTS_WEAK
)
4455 DECL_WEAK (decl
) = 1;
4461 init_varasm_once (void)
4463 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4464 in_named_entry_eq
, NULL
);
4465 const_desc_htab
= htab_create_ggc (1009, const_desc_hash
,
4466 const_desc_eq
, NULL
);
4468 const_alias_set
= new_alias_set ();
4471 static enum tls_model
4472 decl_tls_model (tree decl
)
4474 enum tls_model kind
;
4475 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4480 attr
= TREE_VALUE (TREE_VALUE (attr
));
4481 if (TREE_CODE (attr
) != STRING_CST
)
4483 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4484 kind
= TLS_MODEL_LOCAL_EXEC
;
4485 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4486 kind
= TLS_MODEL_INITIAL_EXEC
;
4487 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4488 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4489 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4490 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4496 is_local
= targetm
.binds_local_p (decl
);
4500 kind
= TLS_MODEL_LOCAL_EXEC
;
4502 kind
= TLS_MODEL_INITIAL_EXEC
;
4504 /* Local dynamic is inefficient when we're not combining the
4505 parts of the address. */
4506 else if (optimize
&& is_local
)
4507 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4509 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4510 if (kind
< flag_tls_default
)
4511 kind
= flag_tls_default
;
4516 /* Select a set of attributes for section NAME based on the properties
4517 of DECL and whether or not RELOC indicates that DECL's initializer
4518 might contain runtime relocations.
4520 We make the section read-only and executable for a function decl,
4521 read-only for a const data decl, and writable for a non-const data decl. */
4524 default_section_type_flags (tree decl
, const char *name
, int reloc
)
4526 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4530 default_section_type_flags_1 (tree decl
, const char *name
, int reloc
,
4535 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4536 flags
= SECTION_CODE
;
4537 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4539 else if (unlikely_text_section_name
4540 && strcmp (name
, unlikely_text_section_name
) == 0)
4541 flags
= SECTION_CODE
;
4543 flags
= SECTION_WRITE
;
4545 if (decl
&& DECL_ONE_ONLY (decl
))
4546 flags
|= SECTION_LINKONCE
;
4548 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4549 flags
|= SECTION_TLS
| SECTION_WRITE
;
4551 if (strcmp (name
, ".bss") == 0
4552 || strncmp (name
, ".bss.", 5) == 0
4553 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4554 || strcmp (name
, ".sbss") == 0
4555 || strncmp (name
, ".sbss.", 6) == 0
4556 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0
4557 || strcmp (name
, ".tbss") == 0
4558 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4559 flags
|= SECTION_BSS
;
4561 if (strcmp (name
, ".tdata") == 0
4562 || strcmp (name
, ".tbss") == 0
4563 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0
4564 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4565 flags
|= SECTION_TLS
;
4567 /* These three sections have special ELF types. They are neither
4568 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4569 want to print a section type (@progbits or @nobits). If someone
4570 is silly enough to emit code or TLS variables to one of these
4571 sections, then don't handle them specially. */
4572 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4573 && (strcmp (name
, ".init_array") == 0
4574 || strcmp (name
, ".fini_array") == 0
4575 || strcmp (name
, ".preinit_array") == 0))
4576 flags
|= SECTION_NOTYPE
;
4581 /* Output assembly to switch to section NAME with attribute FLAGS.
4582 Four variants for common object file formats. */
4585 default_no_named_section (const char *name ATTRIBUTE_UNUSED
,
4586 unsigned int flags ATTRIBUTE_UNUSED
,
4587 tree decl ATTRIBUTE_UNUSED
)
4589 /* Some object formats don't support named sections at all. The
4590 front-end should already have flagged this as an error. */
4595 default_elf_asm_named_section (const char *name
, unsigned int flags
,
4596 tree decl ATTRIBUTE_UNUSED
)
4598 char flagchars
[10], *f
= flagchars
;
4600 /* If we have already declared this section, we can use an
4601 abbreviated form to switch back to it -- unless this section is
4602 part of a COMDAT groups, in which case GAS requires the full
4603 declaration every time. */
4604 if (!(HAVE_GAS_COMDAT_GROUP
&& (flags
& SECTION_LINKONCE
))
4605 && ! named_section_first_declaration (name
))
4607 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4611 if (!(flags
& SECTION_DEBUG
))
4613 if (flags
& SECTION_WRITE
)
4615 if (flags
& SECTION_CODE
)
4617 if (flags
& SECTION_SMALL
)
4619 if (flags
& SECTION_MERGE
)
4621 if (flags
& SECTION_STRINGS
)
4623 if (flags
& SECTION_TLS
)
4625 if (HAVE_GAS_COMDAT_GROUP
&& (flags
& SECTION_LINKONCE
))
4629 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4631 if (!(flags
& SECTION_NOTYPE
))
4636 if (flags
& SECTION_BSS
)
4642 #ifdef ASM_COMMENT_START
4643 /* On platforms that use "@" as the assembly comment character,
4645 if (strcmp (ASM_COMMENT_START
, "@") == 0)
4648 fprintf (asm_out_file
, format
, type
);
4650 if (flags
& SECTION_ENTSIZE
)
4651 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4652 if (HAVE_GAS_COMDAT_GROUP
&& (flags
& SECTION_LINKONCE
))
4653 fprintf (asm_out_file
, ",%s,comdat",
4654 lang_hooks
.decls
.comdat_group (decl
));
4657 putc ('\n', asm_out_file
);
4661 default_coff_asm_named_section (const char *name
, unsigned int flags
,
4662 tree decl ATTRIBUTE_UNUSED
)
4664 char flagchars
[8], *f
= flagchars
;
4666 if (flags
& SECTION_WRITE
)
4668 if (flags
& SECTION_CODE
)
4672 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4676 default_pe_asm_named_section (const char *name
, unsigned int flags
,
4679 default_coff_asm_named_section (name
, flags
, decl
);
4681 if (flags
& SECTION_LINKONCE
)
4683 /* Functions may have been compiled at various levels of
4684 optimization so we can't use `same_size' here.
4685 Instead, have the linker pick one. */
4686 fprintf (asm_out_file
, "\t.linkonce %s\n",
4687 (flags
& SECTION_CODE
? "discard" : "same_size"));
4691 /* The lame default section selector. */
4694 default_select_section (tree decl
, int reloc
,
4695 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4697 bool readonly
= false;
4701 if (decl_readonly_section (decl
, reloc
))
4704 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4706 if (! ((flag_pic
&& reloc
)
4707 || !TREE_READONLY (decl
)
4708 || TREE_SIDE_EFFECTS (decl
)
4709 || !TREE_CONSTANT (decl
)))
4712 else if (TREE_CODE (decl
) == STRING_CST
)
4714 else if (! (flag_pic
&& reloc
))
4718 readonly_data_section ();
4723 /* A helper function for default_elf_select_section and
4724 default_elf_unique_section. Categorizes the DECL. */
4726 enum section_category
4731 SECCAT_RODATA_MERGE_STR
,
4732 SECCAT_RODATA_MERGE_STR_INIT
,
4733 SECCAT_RODATA_MERGE_CONST
,
4738 /* To optimize loading of shared programs, define following subsections
4740 _REL Contains data that has relocations, so they get grouped
4741 together and dynamic linker will visit fewer pages in memory.
4742 _RO Contains data that is otherwise read-only. This is useful
4743 with prelinking as most relocations won't be dynamically
4744 linked and thus stay read only.
4745 _LOCAL Marks data containing relocations only to local objects.
4746 These relocations will get fully resolved by prelinking. */
4748 SECCAT_DATA_REL_LOCAL
,
4750 SECCAT_DATA_REL_RO_LOCAL
,
4760 static enum section_category
4761 categorize_decl_for_section (tree
, int, int);
4763 static enum section_category
4764 categorize_decl_for_section (tree decl
, int reloc
, int shlib
)
4766 enum section_category ret
;
4768 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4770 else if (TREE_CODE (decl
) == STRING_CST
)
4772 if (flag_mudflap
) /* or !flag_merge_constants */
4773 return SECCAT_RODATA
;
4775 return SECCAT_RODATA_MERGE_STR
;
4777 else if (TREE_CODE (decl
) == VAR_DECL
)
4779 if (DECL_INITIAL (decl
) == NULL
4780 || DECL_INITIAL (decl
) == error_mark_node
4781 || (flag_zero_initialized_in_bss
4782 /* Leave constant zeroes in .rodata so they can be shared. */
4783 && !TREE_READONLY (decl
)
4784 && initializer_zerop (DECL_INITIAL (decl
))))
4786 else if (! TREE_READONLY (decl
)
4787 || TREE_SIDE_EFFECTS (decl
)
4788 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
4790 if (shlib
&& (reloc
& 2))
4791 ret
= SECCAT_DATA_REL
;
4792 else if (shlib
&& reloc
)
4793 ret
= SECCAT_DATA_REL_LOCAL
;
4797 else if (shlib
&& (reloc
& 2))
4798 ret
= SECCAT_DATA_REL_RO
;
4799 else if (shlib
&& reloc
)
4800 ret
= SECCAT_DATA_REL_RO_LOCAL
;
4801 else if (reloc
|| flag_merge_constants
< 2)
4802 /* C and C++ don't allow different variables to share the same
4803 location. -fmerge-all-constants allows even that (at the
4804 expense of not conforming). */
4805 ret
= SECCAT_RODATA
;
4806 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
4807 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
4809 ret
= SECCAT_RODATA_MERGE_CONST
;
4811 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4813 if ((shlib
&& reloc
)
4814 || TREE_SIDE_EFFECTS (decl
)
4815 || ! TREE_CONSTANT (decl
))
4818 ret
= SECCAT_RODATA
;
4821 ret
= SECCAT_RODATA
;
4823 /* There are no read-only thread-local sections. */
4824 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4826 /* Note that this would be *just* SECCAT_BSS, except that there's
4827 no concept of a read-only thread-local-data section. */
4828 if (ret
== SECCAT_BSS
4829 || (flag_zero_initialized_in_bss
4830 && initializer_zerop (DECL_INITIAL (decl
))))
4836 /* If the target uses small data sections, select it. */
4837 else if (targetm
.in_small_data_p (decl
))
4839 if (ret
== SECCAT_BSS
)
4841 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
4842 ret
= SECCAT_SRODATA
;
4851 decl_readonly_section (tree decl
, int reloc
)
4853 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
4857 decl_readonly_section_1 (tree decl
, int reloc
, int shlib
)
4859 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4862 case SECCAT_RODATA_MERGE_STR
:
4863 case SECCAT_RODATA_MERGE_STR_INIT
:
4864 case SECCAT_RODATA_MERGE_CONST
:
4865 case SECCAT_SRODATA
:
4874 /* Select a section based on the above categorization. */
4877 default_elf_select_section (tree decl
, int reloc
,
4878 unsigned HOST_WIDE_INT align
)
4880 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
4884 default_elf_select_section_1 (tree decl
, int reloc
,
4885 unsigned HOST_WIDE_INT align
, int shlib
)
4888 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4891 /* We're not supposed to be called on FUNCTION_DECLs. */
4894 readonly_data_section ();
4896 case SECCAT_RODATA_MERGE_STR
:
4897 mergeable_string_section (decl
, align
, 0);
4899 case SECCAT_RODATA_MERGE_STR_INIT
:
4900 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
4902 case SECCAT_RODATA_MERGE_CONST
:
4903 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
4905 case SECCAT_SRODATA
:
4911 case SECCAT_DATA_REL
:
4912 sname
= ".data.rel";
4914 case SECCAT_DATA_REL_LOCAL
:
4915 sname
= ".data.rel.local";
4917 case SECCAT_DATA_REL_RO
:
4918 sname
= ".data.rel.ro";
4920 case SECCAT_DATA_REL_RO_LOCAL
:
4921 sname
= ".data.rel.ro.local";
4930 #ifdef BSS_SECTION_ASM_OP
4949 named_section (decl
, sname
, reloc
);
4952 /* Construct a unique section name based on the decl name and the
4953 categorization performed above. */
4956 default_unique_section (tree decl
, int reloc
)
4958 default_unique_section_1 (decl
, reloc
, flag_pic
);
4962 default_unique_section_1 (tree decl
, int reloc
, int shlib
)
4964 bool one_only
= DECL_ONE_ONLY (decl
);
4965 const char *prefix
, *name
;
4969 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4972 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
4975 case SECCAT_RODATA_MERGE_STR
:
4976 case SECCAT_RODATA_MERGE_STR_INIT
:
4977 case SECCAT_RODATA_MERGE_CONST
:
4978 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
4980 case SECCAT_SRODATA
:
4981 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
4984 case SECCAT_DATA_REL
:
4985 case SECCAT_DATA_REL_LOCAL
:
4986 case SECCAT_DATA_REL_RO
:
4987 case SECCAT_DATA_REL_RO_LOCAL
:
4988 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
4991 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
4994 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
4997 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
5000 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
5003 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
5008 plen
= strlen (prefix
);
5010 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5011 name
= targetm
.strip_name_encoding (name
);
5012 nlen
= strlen (name
);
5014 string
= alloca (nlen
+ plen
+ 1);
5015 memcpy (string
, prefix
, plen
);
5016 memcpy (string
+ plen
, name
, nlen
+ 1);
5018 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
5022 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
5024 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
5027 switch (GET_CODE (x
))
5039 readonly_data_section ();
5043 default_elf_select_rtx_section (enum machine_mode mode
, rtx x
,
5044 unsigned HOST_WIDE_INT align
)
5046 /* ??? Handle small data here somehow. */
5049 switch (GET_CODE (x
))
5053 named_section (NULL_TREE
, ".data.rel.ro", 3);
5057 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
5064 mergeable_constant_section (mode
, align
, 0);
5067 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
5070 default_encode_section_info (tree decl
, rtx rtl
, int first ATTRIBUTE_UNUSED
)
5075 /* Careful not to prod global register variables. */
5078 symbol
= XEXP (rtl
, 0);
5079 if (GET_CODE (symbol
) != SYMBOL_REF
)
5083 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5084 flags
|= SYMBOL_FLAG_FUNCTION
;
5085 if (targetm
.binds_local_p (decl
))
5086 flags
|= SYMBOL_FLAG_LOCAL
;
5087 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5088 flags
|= decl_tls_model (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
5089 else if (targetm
.in_small_data_p (decl
))
5090 flags
|= SYMBOL_FLAG_SMALL
;
5091 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
5092 being PUBLIC, the thing *must* be defined in this translation unit.
5093 Prevent this buglet from being propagated into rtl code as well. */
5094 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
5095 flags
|= SYMBOL_FLAG_EXTERNAL
;
5097 SYMBOL_REF_FLAGS (symbol
) = flags
;
5100 /* By default, we do nothing for encode_section_info, so we need not
5101 do anything but discard the '*' marker. */
5104 default_strip_name_encoding (const char *str
)
5106 return str
+ (*str
== '*');
5109 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5110 wrt cross-module name binding. */
5113 default_binds_local_p (tree exp
)
5115 return default_binds_local_p_1 (exp
, flag_shlib
);
5119 default_binds_local_p_1 (tree exp
, int shlib
)
5123 /* A non-decl is an entry in the constant pool. */
5126 /* Static variables are always local. */
5127 else if (! TREE_PUBLIC (exp
))
5129 /* A variable is local if the user explicitly tells us so. */
5130 else if (DECL_VISIBILITY_SPECIFIED (exp
) && DECL_VISIBILITY (exp
) != VISIBILITY_DEFAULT
)
5132 /* Otherwise, variables defined outside this object may not be local. */
5133 else if (DECL_EXTERNAL (exp
))
5135 /* Linkonce and weak data are never local. */
5136 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
5138 /* If none of the above and visibility is not default, make local. */
5139 else if (DECL_VISIBILITY (exp
) != VISIBILITY_DEFAULT
)
5141 /* If PIC, then assume that any global name can be overridden by
5142 symbols resolved from other modules. */
5145 /* Uninitialized COMMON variable may be unified with symbols
5146 resolved from other modules. */
5147 else if (DECL_COMMON (exp
)
5148 && (DECL_INITIAL (exp
) == NULL
5149 || DECL_INITIAL (exp
) == error_mark_node
))
5151 /* Otherwise we're left with initialized (or non-common) global data
5152 which is of necessity defined locally. */
5159 /* Determine whether or not a pointer mode is valid. Assume defaults
5160 of ptr_mode or Pmode - can be overridden. */
5162 default_valid_pointer_mode (enum machine_mode mode
)
5164 return (mode
== ptr_mode
|| mode
== Pmode
);
5167 /* Default function to output code that will globalize a label. A
5168 target must define GLOBAL_ASM_OP or provide it's own function to
5169 globalize a label. */
5170 #ifdef GLOBAL_ASM_OP
5172 default_globalize_label (FILE * stream
, const char *name
)
5174 fputs (GLOBAL_ASM_OP
, stream
);
5175 assemble_name (stream
, name
);
5176 putc ('\n', stream
);
5178 #endif /* GLOBAL_ASM_OP */
5180 /* Default function to output a label for unwind information. The
5181 default is to do nothing. A target that needs nonlocal labels for
5182 unwind information must provide its own function to do this. */
5184 default_emit_unwind_label (FILE * stream ATTRIBUTE_UNUSED
,
5185 tree decl ATTRIBUTE_UNUSED
,
5186 int for_eh ATTRIBUTE_UNUSED
,
5187 int empty ATTRIBUTE_UNUSED
)
5191 /* This is how to output an internal numbered label where PREFIX is
5192 the class of label and LABELNO is the number within the class. */
5195 default_internal_label (FILE *stream
, const char *prefix
,
5196 unsigned long labelno
)
5198 char *const buf
= alloca (40 + strlen (prefix
));
5199 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5200 ASM_OUTPUT_LABEL (stream
, buf
);
5203 /* This is the default behavior at the beginning of a file. It's
5204 controlled by two other target-hook toggles. */
5206 default_file_start (void)
5208 if (targetm
.file_start_app_off
&& !flag_verbose_asm
)
5209 fputs (ASM_APP_OFF
, asm_out_file
);
5211 if (targetm
.file_start_file_directive
)
5212 output_file_directive (asm_out_file
, main_input_filename
);
5215 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5216 which emits a special section directive used to indicate whether or
5217 not this object file needs an executable stack. This is primarily
5218 a GNU extension to ELF but could be used on other targets. */
5220 int trampolines_created
;
5223 file_end_indicate_exec_stack (void)
5225 unsigned int flags
= SECTION_DEBUG
;
5226 if (trampolines_created
)
5227 flags
|= SECTION_CODE
;
5229 named_section_flags (".note.GNU-stack", flags
);
5232 #include "gt-varasm.h"