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. */
61 #define ASM_STABS_OP "\t.stabs\t"
64 /* The (assembler) name of the first globally-visible object output. */
65 const char *first_global_object_name
;
66 const char *weak_global_object_name
;
69 struct constant_descriptor_rtx
;
70 struct rtx_constant_pool
;
72 struct varasm_status
GTY(())
74 /* If we're using a per-function constant pool, this is it. */
75 struct rtx_constant_pool
*pool
;
77 /* Number of tree-constants deferred during the expansion of this
79 unsigned int deferred_constants
;
82 #define n_deferred_constants (cfun->varasm->deferred_constants)
84 /* Number for making the label on the next
85 constant that is stored in memory. */
87 static GTY(()) int const_labelno
;
89 /* Carry information from ASM_DECLARE_OBJECT_NAME
90 to ASM_FINISH_DECLARE_OBJECT. */
92 int size_directive_output
;
94 /* The last decl for which assemble_variable was called,
95 if it did ASM_DECLARE_OBJECT_NAME.
96 If the last call to assemble_variable didn't do that,
99 tree last_assemble_variable_decl
;
101 /* The following global variable indicates if the section label for the
102 "cold" section of code has been output yet to the assembler. The
103 label is useful when running gdb. This is part of the optimization that
104 partitions hot and cold basic blocks into separate sections of the .o
107 static bool unlikely_section_label_printed
= false;
109 /* The following global variable indicates the label name to be put at
110 the start of the first cold section within each function, when
111 partitioning basic blocks into hot and cold sections. */
113 static char *unlikely_section_label
= NULL
;
115 /* The following global variable indicates the section name to be used
116 for the current cold section, when partitioning hot and cold basic
117 blocks into separate sections. */
119 static char *unlikely_text_section_name
= NULL
;
121 /* We give all constants their own alias set. Perhaps redundant with
122 MEM_READONLY_P, but pre-dates it. */
124 static HOST_WIDE_INT const_alias_set
;
126 static const char *strip_reg_name (const char *);
127 static int contains_pointers_p (tree
);
128 #ifdef ASM_OUTPUT_EXTERNAL
129 static bool incorporeal_function_p (tree
);
131 static void decode_addr_const (tree
, struct addr_const
*);
132 static hashval_t
const_desc_hash (const void *);
133 static int const_desc_eq (const void *, const void *);
134 static hashval_t
const_hash_1 (const tree
);
135 static int compare_constant (const tree
, const tree
);
136 static tree
copy_constant (tree
);
137 static void output_constant_def_contents (rtx
);
138 static void output_addressed_constants (tree
);
139 static unsigned HOST_WIDE_INT
array_size_for_constructor (tree
);
140 static unsigned min_align (unsigned, unsigned);
141 static void output_constructor (tree
, unsigned HOST_WIDE_INT
, unsigned int);
142 static void globalize_decl (tree
);
143 static void maybe_assemble_visibility (tree
);
144 static int in_named_entry_eq (const void *, const void *);
145 static hashval_t
in_named_entry_hash (const void *);
146 #ifdef BSS_SECTION_ASM_OP
147 #ifdef ASM_OUTPUT_BSS
148 static void asm_output_bss (FILE *, tree
, const char *,
149 unsigned HOST_WIDE_INT
, unsigned HOST_WIDE_INT
);
151 #ifdef ASM_OUTPUT_ALIGNED_BSS
152 static void asm_output_aligned_bss (FILE *, tree
, const char *,
153 unsigned HOST_WIDE_INT
, int)
156 #endif /* BSS_SECTION_ASM_OP */
157 static bool asm_emit_uninitialised (tree
, const char*,
158 unsigned HOST_WIDE_INT
,
159 unsigned HOST_WIDE_INT
);
160 static void mark_weak (tree
);
162 enum in_section
{ no_section
, in_text
, in_unlikely_executed_text
, in_data
,
164 #ifdef BSS_SECTION_ASM_OP
167 #ifdef CTORS_SECTION_ASM_OP
170 #ifdef DTORS_SECTION_ASM_OP
173 #ifdef READONLY_DATA_SECTION_ASM_OP
176 #ifdef EXTRA_SECTIONS
180 static GTY(()) enum in_section in_section
= no_section
;
182 /* Return a nonzero value if DECL has a section attribute. */
183 #ifndef IN_NAMED_SECTION
184 #define IN_NAMED_SECTION(DECL) \
185 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
186 && DECL_SECTION_NAME (DECL) != NULL_TREE)
189 /* Text of section name when in_section == in_named. */
190 static GTY(()) const char *in_named_name
;
192 /* Hash table of flags that have been used for a particular named section. */
194 struct in_named_entry
GTY(())
201 static GTY((param_is (struct in_named_entry
))) htab_t in_named_htab
;
203 /* Define functions like text_section for any extra sections. */
204 #ifdef EXTRA_SECTION_FUNCTIONS
205 EXTRA_SECTION_FUNCTIONS
208 /* Tell assembler to switch to text section. */
213 if (in_section
!= in_text
)
215 in_section
= in_text
;
216 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
220 /* Tell assembler to switch to unlikely-to-be-executed text section. */
223 unlikely_text_section (void)
228 if (! unlikely_text_section_name
)
230 if (DECL_SECTION_NAME (current_function_decl
)
231 && (strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME
232 (current_function_decl
)),
233 HOT_TEXT_SECTION_NAME
) != 0)
234 && (strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME
235 (current_function_decl
)),
236 UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) != 0))
238 name
= TREE_STRING_POINTER (DECL_SECTION_NAME
239 (current_function_decl
));
241 unlikely_text_section_name
= xmalloc ((len
+ 10) * sizeof (char));
242 strcpy (unlikely_text_section_name
, name
);
243 strcat (unlikely_text_section_name
, "_unlikely");
247 len
= strlen (UNLIKELY_EXECUTED_TEXT_SECTION_NAME
);
248 unlikely_text_section_name
= xmalloc (len
+1 * sizeof (char));
249 strcpy (unlikely_text_section_name
,
250 UNLIKELY_EXECUTED_TEXT_SECTION_NAME
);
254 if ((in_section
!= in_unlikely_executed_text
)
255 && (in_section
!= in_named
256 || strcmp (in_named_name
, unlikely_text_section_name
) != 0))
258 named_section (NULL_TREE
, unlikely_text_section_name
, 0);
259 in_section
= in_unlikely_executed_text
;
261 if (!unlikely_section_label_printed
)
263 ASM_OUTPUT_LABEL (asm_out_file
, unlikely_section_label
);
264 unlikely_section_label_printed
= true;
269 /* Tell assembler to switch to data section. */
274 if (in_section
!= in_data
)
276 in_section
= in_data
;
277 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
281 /* Tell assembler to switch to read-only data section. This is normally
285 readonly_data_section (void)
287 #ifdef READONLY_DATA_SECTION
288 READONLY_DATA_SECTION (); /* Note this can call data_section. */
290 #ifdef READONLY_DATA_SECTION_ASM_OP
291 if (in_section
!= in_readonly_data
)
293 in_section
= in_readonly_data
;
294 fputs (READONLY_DATA_SECTION_ASM_OP
, asm_out_file
);
295 fputc ('\n', asm_out_file
);
303 /* Determine if we're in the text section. */
306 in_text_section (void)
308 return in_section
== in_text
;
311 /* Determine if we're in the unlikely-to-be-executed text section. */
314 in_unlikely_text_section (void)
318 ret_val
= ((in_section
== in_unlikely_executed_text
)
319 || (in_section
== in_named
320 && unlikely_text_section_name
321 && strcmp (in_named_name
, unlikely_text_section_name
) == 0));
326 /* Determine if we're in the data section. */
329 in_data_section (void)
331 return in_section
== in_data
;
334 /* Helper routines for maintaining in_named_htab. */
337 in_named_entry_eq (const void *p1
, const void *p2
)
339 const struct in_named_entry
*old
= p1
;
340 const char *new = p2
;
342 return strcmp (old
->name
, new) == 0;
346 in_named_entry_hash (const void *p
)
348 const struct in_named_entry
*old
= p
;
349 return htab_hash_string (old
->name
);
352 /* If SECTION has been seen before as a named section, return the flags
353 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
354 set of flags for a section to have, so 0 does not mean that the section
355 has not been seen. */
358 get_named_section_flags (const char *section
)
360 struct in_named_entry
**slot
;
362 slot
= (struct in_named_entry
**)
363 htab_find_slot_with_hash (in_named_htab
, section
,
364 htab_hash_string (section
), NO_INSERT
);
366 return slot
? (*slot
)->flags
: 0;
369 /* Returns true if the section has been declared before. Sets internal
370 flag on this section in in_named_hash so subsequent calls on this
371 section will return false. */
374 named_section_first_declaration (const char *name
)
376 struct in_named_entry
**slot
;
378 slot
= (struct in_named_entry
**)
379 htab_find_slot_with_hash (in_named_htab
, name
,
380 htab_hash_string (name
), NO_INSERT
);
381 if (! (*slot
)->declared
)
383 (*slot
)->declared
= true;
393 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
394 different set of flags, return false. */
397 set_named_section_flags (const char *section
, unsigned int flags
)
399 struct in_named_entry
**slot
, *entry
;
401 slot
= (struct in_named_entry
**)
402 htab_find_slot_with_hash (in_named_htab
, section
,
403 htab_hash_string (section
), INSERT
);
408 entry
= ggc_alloc (sizeof (*entry
));
410 entry
->name
= ggc_strdup (section
);
411 entry
->flags
= flags
;
412 entry
->declared
= false;
414 else if (entry
->flags
!= flags
)
420 /* Tell assembler to change to section NAME with attributes FLAGS. If
421 DECL is non-NULL, it is the VAR_DECL or FUNCTION_DECL with which
422 this section is associated. */
425 named_section_real (const char *name
, unsigned int flags
, tree decl
)
427 if (in_section
!= in_named
|| strcmp (name
, in_named_name
) != 0)
429 if (! set_named_section_flags (name
, flags
))
432 targetm
.asm_out
.named_section (name
, flags
, decl
);
434 if (flags
& SECTION_FORGET
)
435 in_section
= no_section
;
438 in_named_name
= ggc_strdup (name
);
439 in_section
= in_named
;
444 /* Tell assembler to change to section NAME for DECL.
445 If DECL is NULL, just switch to section NAME.
446 If NAME is NULL, get the name from DECL.
447 If RELOC is 1, the initializer for DECL contains relocs. */
450 named_section (tree decl
, const char *name
, int reloc
)
454 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
457 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
459 if (strcmp (name
, UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) == 0
460 && !unlikely_text_section_name
)
462 unlikely_text_section_name
= xmalloc
463 (strlen (UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) + 1
465 strcpy (unlikely_text_section_name
,
466 UNLIKELY_EXECUTED_TEXT_SECTION_NAME
);
469 flags
= targetm
.section_type_flags (decl
, name
, reloc
);
471 /* Sanity check user variables for flag changes. Non-user
472 section flag changes will abort in named_section_flags.
473 However, don't complain if SECTION_OVERRIDE is set.
474 We trust that the setter knows that it is safe to ignore
475 the default flags for this decl. */
476 if (decl
&& ! set_named_section_flags (name
, flags
))
478 flags
= get_named_section_flags (name
);
479 if ((flags
& SECTION_OVERRIDE
) == 0)
480 error ("%J%D causes a section type conflict", decl
, decl
);
483 named_section_real (name
, flags
, decl
);
486 /* If required, set DECL_SECTION_NAME to a unique name. */
489 resolve_unique_section (tree decl
, int reloc ATTRIBUTE_UNUSED
,
490 int flag_function_or_data_sections
)
492 if (DECL_SECTION_NAME (decl
) == NULL_TREE
493 && targetm
.have_named_sections
494 && (flag_function_or_data_sections
495 || DECL_ONE_ONLY (decl
)))
496 targetm
.asm_out
.unique_section (decl
, reloc
);
499 #ifdef BSS_SECTION_ASM_OP
501 /* Tell the assembler to switch to the bss section. */
506 if (in_section
!= in_bss
)
508 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
513 #ifdef ASM_OUTPUT_BSS
515 /* Utility function for ASM_OUTPUT_BSS for targets to use if
516 they don't support alignments in .bss.
517 ??? It is believed that this function will work in most cases so such
518 support is localized here. */
521 asm_output_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
523 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
524 unsigned HOST_WIDE_INT rounded
)
526 targetm
.asm_out
.globalize_label (file
, name
);
528 #ifdef ASM_DECLARE_OBJECT_NAME
529 last_assemble_variable_decl
= decl
;
530 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
532 /* Standard thing is just output label for the object. */
533 ASM_OUTPUT_LABEL (file
, name
);
534 #endif /* ASM_DECLARE_OBJECT_NAME */
535 ASM_OUTPUT_SKIP (file
, rounded
? rounded
: 1);
540 #ifdef ASM_OUTPUT_ALIGNED_BSS
542 /* Utility function for targets to use in implementing
543 ASM_OUTPUT_ALIGNED_BSS.
544 ??? It is believed that this function will work in most cases so such
545 support is localized here. */
548 asm_output_aligned_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
549 const char *name
, unsigned HOST_WIDE_INT size
,
553 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
554 #ifdef ASM_DECLARE_OBJECT_NAME
555 last_assemble_variable_decl
= decl
;
556 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
558 /* Standard thing is just output label for the object. */
559 ASM_OUTPUT_LABEL (file
, name
);
560 #endif /* ASM_DECLARE_OBJECT_NAME */
561 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
566 #endif /* BSS_SECTION_ASM_OP */
568 /* Switch to the section for function DECL.
570 If DECL is NULL_TREE, switch to the text section.
571 ??? It's not clear that we will ever be passed NULL_TREE, but it's
572 safer to handle it. */
575 function_section (tree decl
)
577 if (scan_ahead_for_unlikely_executed_note (get_insns()))
578 unlikely_text_section ();
579 else if (decl
!= NULL_TREE
580 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
581 named_section (decl
, (char *) 0, 0);
586 /* Switch to read-only data section associated with function DECL. */
589 default_function_rodata_section (tree decl
)
591 if (decl
!= NULL_TREE
&& DECL_SECTION_NAME (decl
))
593 const char *name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
595 /* For .gnu.linkonce.t.foo we want to use .gnu.linkonce.r.foo. */
596 if (DECL_ONE_ONLY (decl
) && strncmp (name
, ".gnu.linkonce.t.", 16) == 0)
598 size_t len
= strlen (name
) + 1;
599 char *rname
= alloca (len
);
601 memcpy (rname
, name
, len
);
603 named_section_real (rname
, SECTION_LINKONCE
, decl
);
606 /* For .text.foo we want to use .rodata.foo. */
607 else if (flag_function_sections
&& flag_data_sections
608 && strncmp (name
, ".text.", 6) == 0)
610 size_t len
= strlen (name
) + 1;
611 char *rname
= alloca (len
+ 2);
613 memcpy (rname
, ".rodata", 7);
614 memcpy (rname
+ 7, name
+ 5, len
- 5);
615 named_section_flags (rname
, 0);
620 readonly_data_section ();
623 /* Switch to read-only data section associated with function DECL
624 for targets where that section should be always the single
625 readonly data section. */
628 default_no_function_rodata_section (tree decl ATTRIBUTE_UNUSED
)
630 readonly_data_section ();
633 /* Switch to section for variable DECL. RELOC is the same as the
634 argument to SELECT_SECTION. */
637 variable_section (tree decl
, int reloc
)
639 if (IN_NAMED_SECTION (decl
))
640 named_section (decl
, NULL
, reloc
);
642 targetm
.asm_out
.select_section (decl
, reloc
, DECL_ALIGN (decl
));
645 /* Tell assembler to switch to the section for string merging. */
648 mergeable_string_section (tree decl ATTRIBUTE_UNUSED
,
649 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
650 unsigned int flags ATTRIBUTE_UNUSED
)
652 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
653 && TREE_CODE (decl
) == STRING_CST
654 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
656 && TREE_STRING_LENGTH (decl
) >= int_size_in_bytes (TREE_TYPE (decl
)))
658 enum machine_mode mode
;
659 unsigned int modesize
;
664 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (decl
)));
665 modesize
= GET_MODE_BITSIZE (mode
);
666 if (modesize
>= 8 && modesize
<= 256
667 && (modesize
& (modesize
- 1)) == 0)
669 if (align
< modesize
)
672 str
= TREE_STRING_POINTER (decl
);
673 len
= TREE_STRING_LENGTH (decl
);
674 unit
= GET_MODE_SIZE (mode
);
676 /* Check for embedded NUL characters. */
677 for (i
= 0; i
< len
; i
+= unit
)
679 for (j
= 0; j
< unit
; j
++)
680 if (str
[i
+ j
] != '\0')
687 sprintf (name
, ".rodata.str%d.%d", modesize
/ 8,
689 flags
|= (modesize
/ 8) | SECTION_MERGE
| SECTION_STRINGS
;
690 if (!i
&& modesize
< align
)
692 /* A "" string with requested alignment greater than
693 character size might cause a problem:
694 if some other string required even bigger
695 alignment than "", then linker might think the
696 "" is just part of padding after some other string
697 and not put it into the hash table initially.
698 But this means "" could have smaller alignment
700 #ifdef ASM_OUTPUT_SECTION_START
701 named_section_flags (name
, flags
);
702 ASM_OUTPUT_SECTION_START (asm_out_file
);
704 readonly_data_section ();
709 named_section_flags (name
, flags
);
715 readonly_data_section ();
718 /* Tell assembler to switch to the section for constant merging. */
721 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
722 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
723 unsigned int flags ATTRIBUTE_UNUSED
)
725 unsigned int modesize
= GET_MODE_BITSIZE (mode
);
727 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
733 && (align
& (align
- 1)) == 0)
737 sprintf (name
, ".rodata.cst%d", (int) (align
/ 8));
738 flags
|= (align
/ 8) | SECTION_MERGE
;
739 named_section_flags (name
, flags
);
743 readonly_data_section ();
746 /* Given NAME, a putative register name, discard any customary prefixes. */
749 strip_reg_name (const char *name
)
751 #ifdef REGISTER_PREFIX
752 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
753 name
+= strlen (REGISTER_PREFIX
);
755 if (name
[0] == '%' || name
[0] == '#')
760 /* The user has asked for a DECL to have a particular name. Set (or
761 change) it in such a way that we don't prefix an underscore to
764 set_user_assembler_name (tree decl
, const char *name
)
766 char *starred
= alloca (strlen (name
) + 2);
768 strcpy (starred
+ 1, name
);
769 change_decl_assembler_name (decl
, get_identifier (starred
));
770 SET_DECL_RTL (decl
, NULL_RTX
);
773 /* Decode an `asm' spec for a declaration as a register name.
774 Return the register number, or -1 if nothing specified,
775 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
776 or -3 if ASMSPEC is `cc' and is not recognized,
777 or -4 if ASMSPEC is `memory' and is not recognized.
778 Accept an exact spelling or a decimal number.
779 Prefixes such as % are optional. */
782 decode_reg_name (const char *asmspec
)
784 if (asmspec
!= 0 && strlen (asmspec
) != 0)
788 /* Get rid of confusing prefixes. */
789 asmspec
= strip_reg_name (asmspec
);
791 /* Allow a decimal number as a "register name". */
792 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
793 if (! ISDIGIT (asmspec
[i
]))
795 if (asmspec
[0] != 0 && i
< 0)
798 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
804 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
806 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
809 #ifdef ADDITIONAL_REGISTER_NAMES
811 static const struct { const char *const name
; const int number
; } table
[]
812 = ADDITIONAL_REGISTER_NAMES
;
814 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
815 if (! strcmp (asmspec
, table
[i
].name
))
816 return table
[i
].number
;
818 #endif /* ADDITIONAL_REGISTER_NAMES */
820 if (!strcmp (asmspec
, "memory"))
823 if (!strcmp (asmspec
, "cc"))
832 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
833 have static storage duration. In other words, it should not be an
834 automatic variable, including PARM_DECLs.
836 There is, however, one exception: this function handles variables
837 explicitly placed in a particular register by the user.
839 This is never called for PARM_DECL nodes. */
842 make_decl_rtl (tree decl
)
844 const char *name
= 0;
848 /* Check that we are not being given an automatic variable. */
849 /* A weak alias has TREE_PUBLIC set but not the other bits. */
850 if (TREE_CODE (decl
) == PARM_DECL
851 || TREE_CODE (decl
) == RESULT_DECL
852 || (TREE_CODE (decl
) == VAR_DECL
853 && !TREE_STATIC (decl
)
854 && !TREE_PUBLIC (decl
)
855 && !DECL_EXTERNAL (decl
)
856 && !DECL_REGISTER (decl
)))
858 /* And that we were not given a type or a label. */
859 else if (TREE_CODE (decl
) == TYPE_DECL
860 || TREE_CODE (decl
) == LABEL_DECL
)
863 /* For a duplicate declaration, we can be called twice on the
864 same DECL node. Don't discard the RTL already made. */
865 if (DECL_RTL_SET_P (decl
))
867 /* If the old RTL had the wrong mode, fix the mode. */
868 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
869 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
870 DECL_MODE (decl
), 0));
872 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
875 /* ??? Another way to do this would be to maintain a hashed
876 table of such critters. Instead of adding stuff to a DECL
877 to give certain attributes to it, we could use an external
878 hash map from DECL to set of attributes. */
880 /* Let the target reassign the RTL if it wants.
881 This is necessary, for example, when one machine specific
882 decl attribute overrides another. */
883 targetm
.encode_section_info (decl
, DECL_RTL (decl
), false);
885 /* Make this function static known to the mudflap runtime. */
886 if (flag_mudflap
&& TREE_CODE (decl
) == VAR_DECL
)
887 mudflap_enqueue_decl (decl
);
892 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
894 reg_number
= decode_reg_name (name
);
896 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
898 /* First detect errors in declaring global registers. */
899 if (reg_number
== -1)
900 error ("%Jregister name not specified for %qD", decl
, decl
);
901 else if (reg_number
< 0)
902 error ("%Jinvalid register name for %qD", decl
, decl
);
903 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
904 error ("%Jdata type of %qD isn%'t suitable for a register",
906 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
907 error ("%Jregister specified for %qD isn%'t suitable for data type",
909 /* Now handle properly declared static register variables. */
914 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
916 DECL_INITIAL (decl
) = 0;
917 error ("global register variable has initial value");
919 if (TREE_THIS_VOLATILE (decl
))
920 warning ("volatile register variables don%'t "
921 "work as you might wish");
923 /* If the user specified one of the eliminables registers here,
924 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
925 confused with that register and be eliminated. This usage is
926 somewhat suspect... */
928 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
929 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
930 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
932 if (TREE_STATIC (decl
))
934 /* Make this register global, so not usable for anything
936 #ifdef ASM_DECLARE_REGISTER_GLOBAL
937 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
939 nregs
= hard_regno_nregs
[reg_number
][DECL_MODE (decl
)];
941 globalize_reg (reg_number
+ --nregs
);
944 /* As a register variable, it has no section. */
949 /* Now handle ordinary static variables and functions (in memory).
950 Also handle vars declared register invalidly. */
952 if (name
[0] == '*' && (reg_number
>= 0 || reg_number
== -3))
953 error ("%Jregister name given for non-register variable %qD", decl
, decl
);
955 /* Specifying a section attribute on a variable forces it into a
956 non-.bss section, and thus it cannot be common. */
957 if (TREE_CODE (decl
) == VAR_DECL
958 && DECL_SECTION_NAME (decl
) != NULL_TREE
959 && DECL_INITIAL (decl
) == NULL_TREE
960 && DECL_COMMON (decl
))
961 DECL_COMMON (decl
) = 0;
963 /* Variables can't be both common and weak. */
964 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
965 DECL_COMMON (decl
) = 0;
967 x
= gen_rtx_SYMBOL_REF (Pmode
, name
);
968 SYMBOL_REF_WEAK (x
) = DECL_WEAK (decl
);
969 SYMBOL_REF_DECL (x
) = decl
;
971 x
= gen_rtx_MEM (DECL_MODE (decl
), x
);
972 if (TREE_CODE (decl
) != FUNCTION_DECL
)
973 set_mem_attributes (x
, decl
, 1);
974 SET_DECL_RTL (decl
, x
);
976 /* Optionally set flags or add text to the name to record information
977 such as that it is a function name.
978 If the name is changed, the macro ASM_OUTPUT_LABELREF
979 will have to know how to strip this information. */
980 targetm
.encode_section_info (decl
, DECL_RTL (decl
), true);
982 /* Make this function static known to the mudflap runtime. */
983 if (flag_mudflap
&& TREE_CODE (decl
) == VAR_DECL
)
984 mudflap_enqueue_decl (decl
);
987 /* Make the rtl for variable VAR be volatile.
988 Use this only for static variables. */
991 make_var_volatile (tree var
)
993 if (!MEM_P (DECL_RTL (var
)))
996 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
999 /* Output a string of literal assembler code
1000 for an `asm' keyword used between functions. */
1003 assemble_asm (tree string
)
1007 if (TREE_CODE (string
) == ADDR_EXPR
)
1008 string
= TREE_OPERAND (string
, 0);
1010 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
1013 /* Record an element in the table of global destructors. SYMBOL is
1014 a SYMBOL_REF of the function to be called; PRIORITY is a number
1015 between 0 and MAX_INIT_PRIORITY. */
1018 default_stabs_asm_out_destructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
1020 /* Tell GNU LD that this is part of the static destructor set.
1021 This will work for any system that uses stabs, most usefully
1023 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
1024 assemble_name (asm_out_file
, XSTR (symbol
, 0));
1025 fputc ('\n', asm_out_file
);
1029 default_named_section_asm_out_destructor (rtx symbol
, int priority
)
1031 const char *section
= ".dtors";
1034 /* ??? This only works reliably with the GNU linker. */
1035 if (priority
!= DEFAULT_INIT_PRIORITY
)
1037 sprintf (buf
, ".dtors.%.5u",
1038 /* Invert the numbering so the linker puts us in the proper
1039 order; constructors are run from right to left, and the
1040 linker sorts in increasing order. */
1041 MAX_INIT_PRIORITY
- priority
);
1045 named_section_flags (section
, SECTION_WRITE
);
1046 assemble_align (POINTER_SIZE
);
1047 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1050 #ifdef DTORS_SECTION_ASM_OP
1052 dtors_section (void)
1054 if (in_section
!= in_dtors
)
1056 in_section
= in_dtors
;
1057 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
1058 fputc ('\n', asm_out_file
);
1063 default_dtor_section_asm_out_destructor (rtx symbol
,
1064 int priority ATTRIBUTE_UNUSED
)
1067 assemble_align (POINTER_SIZE
);
1068 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1072 /* Likewise for global constructors. */
1075 default_stabs_asm_out_constructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
1077 /* Tell GNU LD that this is part of the static destructor set.
1078 This will work for any system that uses stabs, most usefully
1080 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
1081 assemble_name (asm_out_file
, XSTR (symbol
, 0));
1082 fputc ('\n', asm_out_file
);
1086 default_named_section_asm_out_constructor (rtx symbol
, int priority
)
1088 const char *section
= ".ctors";
1091 /* ??? This only works reliably with the GNU linker. */
1092 if (priority
!= DEFAULT_INIT_PRIORITY
)
1094 sprintf (buf
, ".ctors.%.5u",
1095 /* Invert the numbering so the linker puts us in the proper
1096 order; constructors are run from right to left, and the
1097 linker sorts in increasing order. */
1098 MAX_INIT_PRIORITY
- priority
);
1102 named_section_flags (section
, SECTION_WRITE
);
1103 assemble_align (POINTER_SIZE
);
1104 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1107 #ifdef CTORS_SECTION_ASM_OP
1109 ctors_section (void)
1111 if (in_section
!= in_ctors
)
1113 in_section
= in_ctors
;
1114 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1115 fputc ('\n', asm_out_file
);
1120 default_ctor_section_asm_out_constructor (rtx symbol
,
1121 int priority ATTRIBUTE_UNUSED
)
1124 assemble_align (POINTER_SIZE
);
1125 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1129 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1130 a nonzero value if the constant pool should be output before the
1131 start of the function, or a zero value if the pool should output
1132 after the end of the function. The default is to put it before the
1135 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1136 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1139 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
1140 to be output to assembler.
1141 Set first_global_object_name and weak_global_object_name as appropriate. */
1144 notice_global_symbol (tree decl
)
1146 const char **type
= &first_global_object_name
;
1148 if (first_global_object_name
1149 || !TREE_PUBLIC (decl
) || DECL_EXTERNAL (decl
)
1150 || !DECL_NAME (decl
)
1151 || (TREE_CODE (decl
) != FUNCTION_DECL
1152 && (TREE_CODE (decl
) != VAR_DECL
1153 || (DECL_COMMON (decl
)
1154 && (DECL_INITIAL (decl
) == 0
1155 || DECL_INITIAL (decl
) == error_mark_node
))))
1156 || !MEM_P (DECL_RTL (decl
)))
1159 /* We win when global object is found, but it is useful to know about weak
1160 symbol as well so we can produce nicer unique names. */
1161 if (DECL_WEAK (decl
) || DECL_ONE_ONLY (decl
))
1162 type
= &weak_global_object_name
;
1168 rtx decl_rtl
= DECL_RTL (decl
);
1170 p
= targetm
.strip_name_encoding (XSTR (XEXP (decl_rtl
, 0), 0));
1177 /* Output assembler code for the constant pool of a function and associated
1178 with defining the name of the function. DECL describes the function.
1179 NAME is the function's name. For the constant pool, we use the current
1180 constant pool data. */
1183 assemble_start_function (tree decl
, const char *fnname
)
1187 if (unlikely_text_section_name
)
1188 free (unlikely_text_section_name
);
1190 unlikely_section_label_printed
= false;
1191 unlikely_text_section_name
= NULL
;
1193 unlikely_section_label
= reconcat (unlikely_section_label
,
1194 fnname
, ".unlikely_section", NULL
);
1196 /* The following code does not need preprocessing in the assembler. */
1200 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1201 output_constant_pool (fnname
, decl
);
1203 /* Make sure the cold text (code) section is properly aligned. This
1204 is necessary here in the case where the function has both hot and
1205 cold sections, because we don't want to re-set the alignment when the
1206 section switch happens mid-function. We don't need to set the hot
1207 section alignment here, because code further down in this function
1208 sets the alignment for whichever section comes first, and if there
1209 is a hot section it is guaranteed to be first. */
1211 if (flag_reorder_blocks_and_partition
)
1213 unlikely_text_section ();
1214 assemble_align (FUNCTION_BOUNDARY
);
1217 resolve_unique_section (decl
, 0, flag_function_sections
);
1218 function_section (decl
);
1220 /* Tell assembler to move to target machine's alignment for functions. */
1221 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1222 if (align
< force_align_functions_log
)
1223 align
= force_align_functions_log
;
1226 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1229 /* Handle a user-specified function alignment.
1230 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1231 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1232 if (align_functions_log
> align
1233 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1235 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1236 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1237 align_functions_log
, align_functions
- 1);
1239 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1243 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1244 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1247 (*debug_hooks
->begin_function
) (decl
);
1249 /* Make function name accessible from other files, if appropriate. */
1251 if (TREE_PUBLIC (decl
))
1253 notice_global_symbol (decl
);
1255 globalize_decl (decl
);
1257 maybe_assemble_visibility (decl
);
1260 if (DECL_PRESERVE_P (decl
))
1261 targetm
.asm_out
.mark_decl_preserved (fnname
);
1263 /* Do any machine/system dependent processing of the function name. */
1264 #ifdef ASM_DECLARE_FUNCTION_NAME
1265 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1267 /* Standard thing is just output label for the function. */
1268 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1269 #endif /* ASM_DECLARE_FUNCTION_NAME */
1271 if (in_unlikely_text_section ()
1272 && !unlikely_section_label_printed
)
1274 ASM_OUTPUT_LABEL (asm_out_file
, unlikely_section_label
);
1275 unlikely_section_label_printed
= true;
1279 /* Output assembler code associated with defining the size of the
1280 function. DECL describes the function. NAME is the function's name. */
1283 assemble_end_function (tree decl
, const char *fnname
)
1285 #ifdef ASM_DECLARE_FUNCTION_SIZE
1286 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1288 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1290 output_constant_pool (fnname
, decl
);
1291 function_section (decl
); /* need to switch back */
1295 /* Assemble code to leave SIZE bytes of zeros. */
1298 assemble_zeros (unsigned HOST_WIDE_INT size
)
1300 /* Do no output if -fsyntax-only. */
1301 if (flag_syntax_only
)
1304 #ifdef ASM_NO_SKIP_IN_TEXT
1305 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1306 so we must output 0s explicitly in the text section. */
1307 if ((ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1308 || (ASM_NO_SKIP_IN_TEXT
&& in_unlikely_text_section ()))
1310 unsigned HOST_WIDE_INT i
;
1311 for (i
= 0; i
< size
; i
++)
1312 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1317 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1320 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1323 assemble_align (int align
)
1325 if (align
> BITS_PER_UNIT
)
1327 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1331 /* Assemble a string constant with the specified C string as contents. */
1334 assemble_string (const char *p
, int size
)
1339 /* If the string is very long, split it up. */
1343 int thissize
= size
- pos
;
1344 if (thissize
> maximum
)
1347 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1355 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1356 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1357 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1359 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1360 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1361 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1363 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1364 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1368 #if defined ASM_OUTPUT_ALIGNED_BSS
1369 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1370 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1372 #if defined ASM_OUTPUT_BSS
1373 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1374 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1380 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1381 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1382 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1384 #if defined ASM_OUTPUT_ALIGNED_COMMON
1385 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1386 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1388 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1389 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1394 asm_emit_uninitialised (tree decl
, const char *name
,
1395 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
1396 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
)
1404 destination
= asm_dest_local
;
1406 /* ??? We should handle .bss via select_section mechanisms rather than
1407 via special target hooks. That would eliminate this special case. */
1408 if (TREE_PUBLIC (decl
))
1410 if (!DECL_COMMON (decl
))
1412 destination
= asm_dest_bss
;
1417 destination
= asm_dest_common
;
1420 if (destination
== asm_dest_bss
)
1421 globalize_decl (decl
);
1422 resolve_unique_section (decl
, 0, flag_data_sections
);
1424 if (flag_shared_data
)
1426 switch (destination
)
1428 #ifdef ASM_OUTPUT_SHARED_BSS
1430 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1433 #ifdef ASM_OUTPUT_SHARED_COMMON
1434 case asm_dest_common
:
1435 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1438 #ifdef ASM_OUTPUT_SHARED_LOCAL
1439 case asm_dest_local
:
1440 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1448 switch (destination
)
1452 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1455 case asm_dest_common
:
1456 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1458 case asm_dest_local
:
1459 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1468 /* Assemble everything that is needed for a variable or function declaration.
1469 Not used for automatic variables, and not used for function definitions.
1470 Should not be called for variables of incomplete structure type.
1472 TOP_LEVEL is nonzero if this variable has file scope.
1473 AT_END is nonzero if this is the special handling, at end of compilation,
1474 to define things that have had only tentative definitions.
1475 DONT_OUTPUT_DATA if nonzero means don't actually output the
1476 initial value (that will be done by the caller). */
1479 assemble_variable (tree decl
, int top_level ATTRIBUTE_UNUSED
,
1480 int at_end ATTRIBUTE_UNUSED
, int dont_output_data
)
1487 if (lang_hooks
.decls
.prepare_assemble_variable
)
1488 lang_hooks
.decls
.prepare_assemble_variable (decl
);
1490 last_assemble_variable_decl
= 0;
1492 /* Normally no need to say anything here for external references,
1493 since assemble_external is called by the language-specific code
1494 when a declaration is first seen. */
1496 if (DECL_EXTERNAL (decl
))
1499 /* Output no assembler code for a function declaration.
1500 Only definitions of functions output anything. */
1502 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1505 /* Do nothing for global register variables. */
1506 if (DECL_RTL_SET_P (decl
) && REG_P (DECL_RTL (decl
)))
1508 TREE_ASM_WRITTEN (decl
) = 1;
1512 /* If type was incomplete when the variable was declared,
1513 see if it is complete now. */
1515 if (DECL_SIZE (decl
) == 0)
1516 layout_decl (decl
, 0);
1518 /* Still incomplete => don't allocate it; treat the tentative defn
1519 (which is what it must have been) as an `extern' reference. */
1521 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1523 error ("%Jstorage size of %qD isn%'t known", decl
, decl
);
1524 TREE_ASM_WRITTEN (decl
) = 1;
1528 /* The first declaration of a variable that comes through this function
1529 decides whether it is global (in C, has external linkage)
1530 or local (in C, has internal linkage). So do nothing more
1531 if this function has already run. */
1533 if (TREE_ASM_WRITTEN (decl
))
1536 /* Make sure targetm.encode_section_info is invoked before we set
1538 decl_rtl
= DECL_RTL (decl
);
1540 TREE_ASM_WRITTEN (decl
) = 1;
1542 /* Do no output if -fsyntax-only. */
1543 if (flag_syntax_only
)
1548 if (! dont_output_data
1549 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1551 error ("%Jsize of variable %qD is too large", decl
, decl
);
1555 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1556 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1557 notice_global_symbol (decl
);
1559 /* Compute the alignment of this data. */
1561 align
= DECL_ALIGN (decl
);
1563 /* In the case for initialing an array whose length isn't specified,
1564 where we have not yet been able to do the layout,
1565 figure out the proper alignment now. */
1566 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1567 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1568 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1570 /* Some object file formats have a maximum alignment which they support.
1571 In particular, a.out format supports a maximum alignment of 4. */
1572 if (align
> MAX_OFILE_ALIGNMENT
)
1574 warning ("%Jalignment of %qD is greater than maximum object "
1575 "file alignment. Using %d", decl
, decl
,
1576 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1577 align
= MAX_OFILE_ALIGNMENT
;
1580 /* On some machines, it is good to increase alignment sometimes. */
1581 if (! DECL_USER_ALIGN (decl
))
1583 #ifdef DATA_ALIGNMENT
1584 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1586 #ifdef CONSTANT_ALIGNMENT
1587 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1588 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1592 /* Reset the alignment in case we have made it tighter, so we can benefit
1593 from it in get_pointer_alignment. */
1594 DECL_ALIGN (decl
) = align
;
1595 set_mem_align (decl_rtl
, align
);
1597 if (TREE_PUBLIC (decl
))
1598 maybe_assemble_visibility (decl
);
1600 if (DECL_PRESERVE_P (decl
))
1601 targetm
.asm_out
.mark_decl_preserved (name
);
1603 /* Output any data that we will need to use the address of. */
1604 if (DECL_INITIAL (decl
) == error_mark_node
)
1605 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1606 else if (DECL_INITIAL (decl
))
1608 reloc
= compute_reloc_for_constant (DECL_INITIAL (decl
));
1609 output_addressed_constants (DECL_INITIAL (decl
));
1611 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1613 /* Handle uninitialized definitions. */
1615 /* If the decl has been given an explicit section name, then it
1616 isn't common, and shouldn't be handled as such. */
1617 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1619 /* We don't implement common thread-local data at present. */
1620 else if (DECL_THREAD_LOCAL (decl
))
1622 if (DECL_COMMON (decl
))
1623 sorry ("thread-local COMMON data not implemented");
1625 else if (DECL_INITIAL (decl
) == 0
1626 || DECL_INITIAL (decl
) == error_mark_node
1627 || (flag_zero_initialized_in_bss
1628 /* Leave constant zeroes in .rodata so they can be shared. */
1629 && !TREE_READONLY (decl
)
1630 && initializer_zerop (DECL_INITIAL (decl
))))
1632 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1633 unsigned HOST_WIDE_INT rounded
= size
;
1635 /* Don't allocate zero bytes of common,
1636 since that means "undefined external" in the linker. */
1640 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1641 so that each uninitialized object starts on such a boundary. */
1642 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1643 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1644 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1646 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1647 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN_UNIT (decl
) > rounded
)
1648 warning ("%Jrequested alignment for %qD is greater than "
1649 "implemented alignment of %d", decl
, decl
, rounded
);
1652 /* If the target cannot output uninitialized but not common global data
1653 in .bss, then we have to use .data, so fall through. */
1654 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1658 /* Handle initialized definitions.
1659 Also handle uninitialized global definitions if -fno-common and the
1660 target doesn't support ASM_OUTPUT_BSS. */
1662 /* First make the assembler name(s) global if appropriate. */
1663 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1664 globalize_decl (decl
);
1666 /* Switch to the appropriate section. */
1667 variable_section (decl
, reloc
);
1669 /* dbxout.c needs to know this. */
1670 if (in_text_section () || in_unlikely_text_section ())
1671 DECL_IN_TEXT_SECTION (decl
) = 1;
1673 /* Output the alignment of this data. */
1674 if (align
> BITS_PER_UNIT
)
1675 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (DECL_ALIGN_UNIT (decl
)));
1677 /* Do any machine/system dependent processing of the object. */
1678 #ifdef ASM_DECLARE_OBJECT_NAME
1679 last_assemble_variable_decl
= decl
;
1680 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1682 /* Standard thing is just output label for the object. */
1683 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1684 #endif /* ASM_DECLARE_OBJECT_NAME */
1686 if (!dont_output_data
)
1688 if (DECL_INITIAL (decl
)
1689 && DECL_INITIAL (decl
) != error_mark_node
1690 && !initializer_zerop (DECL_INITIAL (decl
)))
1691 /* Output the actual data. */
1692 output_constant (DECL_INITIAL (decl
),
1693 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1696 /* Leave space for it. */
1697 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1701 /* Return 1 if type TYPE contains any pointers. */
1704 contains_pointers_p (tree type
)
1706 switch (TREE_CODE (type
))
1709 case REFERENCE_TYPE
:
1710 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1711 so I'll play safe and return 1. */
1717 case QUAL_UNION_TYPE
:
1720 /* For a type that has fields, see if the fields have pointers. */
1721 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1722 if (TREE_CODE (fields
) == FIELD_DECL
1723 && contains_pointers_p (TREE_TYPE (fields
)))
1729 /* An array type contains pointers if its element type does. */
1730 return contains_pointers_p (TREE_TYPE (type
));
1737 #ifdef ASM_OUTPUT_EXTERNAL
1738 /* True if DECL is a function decl for which no out-of-line copy exists.
1739 It is assumed that DECL's assembler name has been set. */
1742 incorporeal_function_p (tree decl
)
1744 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_BUILT_IN (decl
))
1748 if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1749 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_ALLOCA
)
1752 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
1753 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
1760 /* Output something to declare an external symbol to the assembler.
1761 (Most assemblers don't need this, so we normally output nothing.)
1762 Do nothing if DECL is not external. */
1765 assemble_external (tree decl ATTRIBUTE_UNUSED
)
1767 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1768 main body of this code is only rarely exercised. To provide some
1769 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1770 open. If it's not, we should not be calling this function. */
1774 #ifdef ASM_OUTPUT_EXTERNAL
1775 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1777 rtx rtl
= DECL_RTL (decl
);
1779 if (MEM_P (rtl
) && GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1780 && !SYMBOL_REF_USED (XEXP (rtl
, 0))
1781 && !incorporeal_function_p (decl
))
1783 /* Some systems do require some output. */
1784 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1785 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1791 /* Similar, for calling a library function FUN. */
1794 assemble_external_libcall (rtx fun
)
1796 /* Declare library function name external when first used, if nec. */
1797 if (! SYMBOL_REF_USED (fun
))
1799 SYMBOL_REF_USED (fun
) = 1;
1800 targetm
.asm_out
.external_libcall (fun
);
1804 /* Assemble a label named NAME. */
1807 assemble_label (const char *name
)
1809 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1812 /* Set the symbol_referenced flag for ID. */
1814 mark_referenced (tree id
)
1816 TREE_SYMBOL_REFERENCED (id
) = 1;
1819 /* Set the symbol_referenced flag for DECL and notify callgraph. */
1821 mark_decl_referenced (tree decl
)
1823 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1824 cgraph_mark_needed_node (cgraph_node (decl
));
1825 else if (TREE_CODE (decl
) == VAR_DECL
)
1826 cgraph_varpool_mark_needed_node (cgraph_varpool_node (decl
));
1827 /* else do nothing - we can get various sorts of CST nodes here,
1828 which do not need to be marked. */
1831 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1832 If NAME starts with a *, the rest of NAME is output verbatim.
1833 Otherwise NAME is transformed in an implementation-defined way
1834 (usually by the addition of an underscore).
1835 Many macros in the tm file are defined to call this function. */
1838 assemble_name (FILE *file
, const char *name
)
1840 const char *real_name
;
1843 real_name
= targetm
.strip_name_encoding (name
);
1845 id
= maybe_get_identifier (real_name
);
1847 mark_referenced (id
);
1850 fputs (&name
[1], file
);
1852 ASM_OUTPUT_LABELREF (file
, name
);
1855 /* Allocate SIZE bytes writable static space with a gensym name
1856 and return an RTX to refer to its address. */
1859 assemble_static_space (unsigned HOST_WIDE_INT size
)
1862 const char *namestring
;
1866 if (flag_shared_data
)
1870 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1872 namestring
= ggc_strdup (name
);
1874 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1875 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
1877 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1878 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1881 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1882 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1885 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1886 so that each uninitialized object starts on such a boundary. */
1887 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1888 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1889 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1890 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1891 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1892 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1899 /* Assemble the static constant template for function entry trampolines.
1900 This is done at most once per compilation.
1901 Returns an RTX for the address of the template. */
1903 static GTY(()) rtx initial_trampoline
;
1905 #ifdef TRAMPOLINE_TEMPLATE
1907 assemble_trampoline_template (void)
1914 if (initial_trampoline
)
1915 return initial_trampoline
;
1917 /* By default, put trampoline templates in read-only data section. */
1919 #ifdef TRAMPOLINE_SECTION
1920 TRAMPOLINE_SECTION ();
1922 readonly_data_section ();
1925 /* Write the assembler code to define one. */
1926 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1929 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1932 targetm
.asm_out
.internal_label (asm_out_file
, "LTRAMP", 0);
1933 TRAMPOLINE_TEMPLATE (asm_out_file
);
1935 /* Record the rtl to refer to it. */
1936 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1937 name
= ggc_strdup (label
);
1938 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
1939 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
1941 initial_trampoline
= gen_rtx_MEM (BLKmode
, symbol
);
1942 set_mem_align (initial_trampoline
, TRAMPOLINE_ALIGNMENT
);
1944 return initial_trampoline
;
1948 /* A and B are either alignments or offsets. Return the minimum alignment
1949 that may be assumed after adding the two together. */
1951 static inline unsigned
1952 min_align (unsigned int a
, unsigned int b
)
1954 return (a
| b
) & -(a
| b
);
1957 /* Return the assembler directive for creating a given kind of integer
1958 object. SIZE is the number of bytes in the object and ALIGNED_P
1959 indicates whether it is known to be aligned. Return NULL if the
1960 assembly dialect has no such directive.
1962 The returned string should be printed at the start of a new line and
1963 be followed immediately by the object's initial value. */
1966 integer_asm_op (int size
, int aligned_p
)
1968 struct asm_int_op
*ops
;
1971 ops
= &targetm
.asm_out
.aligned_op
;
1973 ops
= &targetm
.asm_out
.unaligned_op
;
1978 return targetm
.asm_out
.byte_op
;
1992 /* Use directive OP to assemble an integer object X. Print OP at the
1993 start of the line, followed immediately by the value of X. */
1996 assemble_integer_with_op (const char *op
, rtx x
)
1998 fputs (op
, asm_out_file
);
1999 output_addr_const (asm_out_file
, x
);
2000 fputc ('\n', asm_out_file
);
2003 /* The default implementation of the asm_out.integer target hook. */
2006 default_assemble_integer (rtx x ATTRIBUTE_UNUSED
,
2007 unsigned int size ATTRIBUTE_UNUSED
,
2008 int aligned_p ATTRIBUTE_UNUSED
)
2010 const char *op
= integer_asm_op (size
, aligned_p
);
2011 return op
&& (assemble_integer_with_op (op
, x
), true);
2014 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
2015 the alignment of the integer in bits. Return 1 if we were able to output
2016 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
2020 assemble_integer (rtx x
, unsigned int size
, unsigned int align
, int force
)
2024 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
2026 /* See if the target hook can handle this kind of object. */
2027 if (targetm
.asm_out
.integer (x
, size
, aligned_p
))
2030 /* If the object is a multi-byte one, try splitting it up. Split
2031 it into words it if is multi-word, otherwise split it into bytes. */
2034 enum machine_mode omode
, imode
;
2035 unsigned int subalign
;
2036 unsigned int subsize
, i
;
2038 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
2039 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
2040 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
2041 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
2043 for (i
= 0; i
< size
; i
+= subsize
)
2045 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
2046 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
2052 /* If we've printed some of it, but not all of it, there's no going
2065 assemble_real (REAL_VALUE_TYPE d
, enum machine_mode mode
, unsigned int align
)
2069 int bitsize
, nelts
, nunits
, units_per
;
2071 /* This is hairy. We have a quantity of known size. real_to_target
2072 will put it into an array of *host* longs, 32 bits per element
2073 (even if long is more than 32 bits). We need to determine the
2074 number of array elements that are occupied (nelts) and the number
2075 of *target* min-addressable units that will be occupied in the
2076 object file (nunits). We cannot assume that 32 divides the
2077 mode's bitsize (size * BITS_PER_UNIT) evenly.
2079 size * BITS_PER_UNIT is used here to make sure that padding bits
2080 (which might appear at either end of the value; real_to_target
2081 will include the padding bits in its output array) are included. */
2083 nunits
= GET_MODE_SIZE (mode
);
2084 bitsize
= nunits
* BITS_PER_UNIT
;
2085 nelts
= CEIL (bitsize
, 32);
2086 units_per
= 32 / BITS_PER_UNIT
;
2088 real_to_target (data
, &d
, mode
);
2090 /* Put out the first word with the specified alignment. */
2091 assemble_integer (GEN_INT (data
[0]), MIN (nunits
, units_per
), align
, 1);
2092 nunits
-= units_per
;
2094 /* Subsequent words need only 32-bit alignment. */
2095 align
= min_align (align
, 32);
2097 for (i
= 1; i
< nelts
; i
++)
2099 assemble_integer (GEN_INT (data
[i
]), MIN (nunits
, units_per
), align
, 1);
2100 nunits
-= units_per
;
2104 /* Given an expression EXP with a constant value,
2105 reduce it to the sum of an assembler symbol and an integer.
2106 Store them both in the structure *VALUE.
2107 Abort if EXP does not reduce. */
2109 struct addr_const
GTY(())
2112 HOST_WIDE_INT offset
;
2116 decode_addr_const (tree exp
, struct addr_const
*value
)
2118 tree target
= TREE_OPERAND (exp
, 0);
2124 if (TREE_CODE (target
) == COMPONENT_REF
2125 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2128 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2129 target
= TREE_OPERAND (target
, 0);
2131 else if (TREE_CODE (target
) == ARRAY_REF
2132 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2134 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2135 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2136 target
= TREE_OPERAND (target
, 0);
2142 switch (TREE_CODE (target
))
2146 x
= DECL_RTL (target
);
2150 x
= gen_rtx_MEM (FUNCTION_MODE
,
2151 gen_rtx_LABEL_REF (VOIDmode
, force_label_rtx (target
)));
2159 x
= output_constant_def (target
, 1);
2171 value
->offset
= offset
;
2174 /* Uniquize all constants that appear in memory.
2175 Each constant in memory thus far output is recorded
2176 in `const_desc_table'. */
2178 struct constant_descriptor_tree
GTY(())
2180 /* A MEM for the constant. */
2183 /* The value of the constant. */
2187 static GTY((param_is (struct constant_descriptor_tree
)))
2188 htab_t const_desc_htab
;
2190 static struct constant_descriptor_tree
* build_constant_desc (tree
);
2191 static void maybe_output_constant_def_contents (struct constant_descriptor_tree
*, int);
2193 /* Compute a hash code for a constant expression. */
2196 const_desc_hash (const void *ptr
)
2198 return const_hash_1 (((struct constant_descriptor_tree
*)ptr
)->value
);
2202 const_hash_1 (const tree exp
)
2207 enum tree_code code
= TREE_CODE (exp
);
2209 /* Either set P and LEN to the address and len of something to hash and
2210 exit the switch or return a value. */
2215 p
= (char *) &TREE_INT_CST (exp
);
2216 len
= sizeof TREE_INT_CST (exp
);
2220 return real_hash (TREE_REAL_CST_PTR (exp
));
2223 p
= TREE_STRING_POINTER (exp
);
2224 len
= TREE_STRING_LENGTH (exp
);
2228 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2229 + const_hash_1 (TREE_IMAGPART (exp
)));
2232 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2236 len
= int_size_in_bytes (TREE_TYPE (exp
));
2238 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2246 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2248 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2249 if (TREE_VALUE (link
))
2250 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2258 struct addr_const value
;
2260 decode_addr_const (exp
, &value
);
2261 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2263 /* Don't hash the address of the SYMBOL_REF;
2264 only use the offset and the symbol name. */
2266 p
= XSTR (value
.base
, 0);
2267 for (i
= 0; p
[i
] != 0; i
++)
2268 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2270 else if (GET_CODE (value
.base
) == LABEL_REF
)
2271 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2279 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2280 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2284 case NON_LVALUE_EXPR
:
2285 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2288 /* A language specific constant. Just hash the code. */
2292 /* Compute hashing function. */
2294 for (i
= 0; i
< len
; i
++)
2295 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2300 /* Wrapper of compare_constant, for the htab interface. */
2302 const_desc_eq (const void *p1
, const void *p2
)
2304 return compare_constant (((struct constant_descriptor_tree
*)p1
)->value
,
2305 ((struct constant_descriptor_tree
*)p2
)->value
);
2308 /* Compare t1 and t2, and return 1 only if they are known to result in
2309 the same bit pattern on output. */
2312 compare_constant (const tree t1
, const tree t2
)
2314 enum tree_code typecode
;
2316 if (t1
== NULL_TREE
)
2317 return t2
== NULL_TREE
;
2318 if (t2
== NULL_TREE
)
2321 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2324 switch (TREE_CODE (t1
))
2327 /* Integer constants are the same only if the same width of type. */
2328 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2330 return tree_int_cst_equal (t1
, t2
);
2333 /* Real constants are the same only if the same width of type. */
2334 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2337 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2340 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2343 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2344 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2345 TREE_STRING_LENGTH (t1
)));
2348 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2349 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2352 typecode
= TREE_CODE (TREE_TYPE (t1
));
2353 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2356 if (typecode
== SET_TYPE
)
2358 int len
= int_size_in_bytes (TREE_TYPE (t2
));
2359 unsigned char *tmp1
, *tmp2
;
2361 if (int_size_in_bytes (TREE_TYPE (t1
)) != len
)
2364 tmp1
= alloca (len
);
2365 tmp2
= alloca (len
);
2367 if (get_set_constructor_bytes (t1
, tmp1
, len
) != NULL_TREE
)
2369 if (get_set_constructor_bytes (t2
, tmp2
, len
) != NULL_TREE
)
2372 return memcmp (tmp1
, tmp2
, len
) == 0;
2378 if (typecode
== ARRAY_TYPE
)
2380 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2381 /* For arrays, check that the sizes all match. */
2382 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2384 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2389 /* For record and union constructors, require exact type
2391 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2395 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2397 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2399 /* Check that each value is the same... */
2400 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2402 /* ... and that they apply to the same fields! */
2403 if (typecode
== ARRAY_TYPE
)
2405 if (! compare_constant (TREE_PURPOSE (l1
),
2411 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2416 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2422 struct addr_const value1
, value2
;
2424 decode_addr_const (t1
, &value1
);
2425 decode_addr_const (t2
, &value2
);
2426 return (value1
.offset
== value2
.offset
2427 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2433 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2434 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2438 case NON_LVALUE_EXPR
:
2439 case VIEW_CONVERT_EXPR
:
2440 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2445 nt1
= lang_hooks
.expand_constant (t1
);
2446 nt2
= lang_hooks
.expand_constant (t2
);
2447 if (nt1
!= t1
|| nt2
!= t2
)
2448 return compare_constant (nt1
, nt2
);
2454 /* Should not get here. */
2458 /* Make a copy of the whole tree structure for a constant. This
2459 handles the same types of nodes that compare_constant handles. */
2462 copy_constant (tree exp
)
2464 switch (TREE_CODE (exp
))
2467 /* For ADDR_EXPR, we do not want to copy the decl whose address
2468 is requested. We do want to copy constants though. */
2469 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2470 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2471 copy_constant (TREE_OPERAND (exp
, 0)));
2473 return copy_node (exp
);
2478 return copy_node (exp
);
2481 return build_complex (TREE_TYPE (exp
),
2482 copy_constant (TREE_REALPART (exp
)),
2483 copy_constant (TREE_IMAGPART (exp
)));
2487 return build2 (TREE_CODE (exp
), TREE_TYPE (exp
),
2488 copy_constant (TREE_OPERAND (exp
, 0)),
2489 copy_constant (TREE_OPERAND (exp
, 1)));
2493 case NON_LVALUE_EXPR
:
2494 case VIEW_CONVERT_EXPR
:
2495 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2496 copy_constant (TREE_OPERAND (exp
, 0)));
2500 tree copy
= copy_node (exp
);
2501 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2504 CONSTRUCTOR_ELTS (copy
) = list
;
2505 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2506 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2507 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2508 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2509 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2517 t
= lang_hooks
.expand_constant (exp
);
2519 return copy_constant (t
);
2526 /* Subroutine of output_constant_def:
2527 No constant equal to EXP is known to have been output.
2528 Make a constant descriptor to enter EXP in the hash table.
2529 Assign the label number and construct RTL to refer to the
2530 constant's location in memory.
2531 Caller is responsible for updating the hash table. */
2533 static struct constant_descriptor_tree
*
2534 build_constant_desc (tree exp
)
2540 struct constant_descriptor_tree
*desc
;
2542 desc
= ggc_alloc (sizeof (*desc
));
2543 desc
->value
= copy_constant (exp
);
2545 /* Propagate marked-ness to copied constant. */
2546 if (flag_mudflap
&& mf_marked_p (exp
))
2547 mf_mark (desc
->value
);
2549 /* Create a string containing the label name, in LABEL. */
2550 labelno
= const_labelno
++;
2551 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2553 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2554 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2555 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2556 SYMBOL_REF_DECL (symbol
) = desc
->value
;
2557 TREE_CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2559 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2560 set_mem_attributes (rtl
, exp
, 1);
2561 set_mem_alias_set (rtl
, 0);
2562 set_mem_alias_set (rtl
, const_alias_set
);
2564 /* Set flags or add text to the name to record information, such as
2565 that it is a local symbol. If the name is changed, the macro
2566 ASM_OUTPUT_LABELREF will have to know how to strip this
2567 information. This call might invalidate our local variable
2568 SYMBOL; we can't use it afterward. */
2570 targetm
.encode_section_info (exp
, rtl
, true);
2577 /* Return an rtx representing a reference to constant data in memory
2578 for the constant expression EXP.
2580 If assembler code for such a constant has already been output,
2581 return an rtx to refer to it.
2582 Otherwise, output such a constant in memory
2583 and generate an rtx for it.
2585 If DEFER is nonzero, this constant can be deferred and output only
2586 if referenced in the function after all optimizations.
2588 `const_desc_table' records which constants already have label strings. */
2591 output_constant_def (tree exp
, int defer
)
2593 struct constant_descriptor_tree
*desc
;
2594 struct constant_descriptor_tree key
;
2597 /* Look up EXP in the table of constant descriptors. If we didn't find
2598 it, create a new one. */
2600 loc
= htab_find_slot (const_desc_htab
, &key
, INSERT
);
2605 desc
= build_constant_desc (exp
);
2609 maybe_output_constant_def_contents (desc
, defer
);
2613 /* Subroutine of output_constant_def: Decide whether or not we need to
2614 output the constant DESC now, and if so, do it. */
2616 maybe_output_constant_def_contents (struct constant_descriptor_tree
*desc
,
2619 rtx symbol
= XEXP (desc
->rtl
, 0);
2620 tree exp
= desc
->value
;
2622 if (flag_syntax_only
)
2625 if (TREE_ASM_WRITTEN (exp
))
2626 /* Already output; don't do it again. */
2629 /* We can always defer constants as long as the context allows
2633 /* Increment n_deferred_constants if it exists. It needs to be at
2634 least as large as the number of constants actually referred to
2635 by the function. If it's too small we'll stop looking too early
2636 and fail to emit constants; if it's too large we'll only look
2637 through the entire function when we could have stopped earlier. */
2639 n_deferred_constants
++;
2643 output_constant_def_contents (symbol
);
2646 /* We must output the constant data referred to by SYMBOL; do so. */
2649 output_constant_def_contents (rtx symbol
)
2651 tree exp
= SYMBOL_REF_DECL (symbol
);
2652 const char *label
= XSTR (symbol
, 0);
2655 /* Make sure any other constants whose addresses appear in EXP
2656 are assigned label numbers. */
2657 int reloc
= compute_reloc_for_constant (exp
);
2659 /* Align the location counter as required by EXP's data type. */
2660 unsigned int align
= TYPE_ALIGN (TREE_TYPE (exp
));
2661 #ifdef CONSTANT_ALIGNMENT
2662 align
= CONSTANT_ALIGNMENT (exp
, align
);
2665 output_addressed_constants (exp
);
2667 /* We are no longer deferring this constant. */
2668 TREE_ASM_WRITTEN (exp
) = 1;
2670 if (IN_NAMED_SECTION (exp
))
2671 named_section (exp
, NULL
, reloc
);
2673 targetm
.asm_out
.select_section (exp
, reloc
, align
);
2675 if (align
> BITS_PER_UNIT
)
2677 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2680 size
= int_size_in_bytes (TREE_TYPE (exp
));
2681 if (TREE_CODE (exp
) == STRING_CST
)
2682 size
= MAX (TREE_STRING_LENGTH (exp
), size
);
2684 /* Do any machine/system dependent processing of the constant. */
2685 #ifdef ASM_DECLARE_CONSTANT_NAME
2686 ASM_DECLARE_CONSTANT_NAME (asm_out_file
, label
, exp
, size
);
2688 /* Standard thing is just output label for the constant. */
2689 ASM_OUTPUT_LABEL (asm_out_file
, label
);
2690 #endif /* ASM_DECLARE_CONSTANT_NAME */
2692 /* Output the value of EXP. */
2693 output_constant (exp
, size
, align
);
2695 mudflap_enqueue_constant (exp
);
2698 /* Look up EXP in the table of constant descriptors. Return the rtl
2699 if it has been emitted, else null. */
2702 lookup_constant_def (tree exp
)
2704 struct constant_descriptor_tree
*desc
;
2705 struct constant_descriptor_tree key
;
2708 desc
= htab_find (const_desc_htab
, &key
);
2710 return (desc
? desc
->rtl
: NULL_RTX
);
2713 /* Used in the hash tables to avoid outputting the same constant
2714 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2715 are output once per function, not once per file. */
2716 /* ??? Only a few targets need per-function constant pools. Most
2717 can use one per-file pool. Should add a targetm bit to tell the
2720 struct rtx_constant_pool
GTY(())
2722 /* Pointers to first and last constant in pool, as ordered by offset. */
2723 struct constant_descriptor_rtx
*first
;
2724 struct constant_descriptor_rtx
*last
;
2726 /* Hash facility for making memory-constants from constant rtl-expressions.
2727 It is used on RISC machines where immediate integer arguments and
2728 constant addresses are restricted so that such constants must be stored
2730 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_htab
;
2731 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_sym_htab
;
2733 /* Current offset in constant pool (does not include any
2734 machine-specific header). */
2735 HOST_WIDE_INT offset
;
2738 struct constant_descriptor_rtx
GTY((chain_next ("%h.next")))
2740 struct constant_descriptor_rtx
*next
;
2744 HOST_WIDE_INT offset
;
2746 enum machine_mode mode
;
2752 /* Hash and compare functions for const_rtx_htab. */
2755 const_desc_rtx_hash (const void *ptr
)
2757 const struct constant_descriptor_rtx
*desc
= ptr
;
2762 const_desc_rtx_eq (const void *a
, const void *b
)
2764 const struct constant_descriptor_rtx
*x
= a
;
2765 const struct constant_descriptor_rtx
*y
= b
;
2767 if (x
->mode
!= y
->mode
)
2769 return rtx_equal_p (x
->constant
, y
->constant
);
2772 /* Hash and compare functions for const_rtx_sym_htab. */
2775 const_desc_rtx_sym_hash (const void *ptr
)
2777 const struct constant_descriptor_rtx
*desc
= ptr
;
2778 return htab_hash_string (XSTR (desc
->sym
, 0));
2782 const_desc_rtx_sym_eq (const void *a
, const void *b
)
2784 const struct constant_descriptor_rtx
*x
= a
;
2785 const struct constant_descriptor_rtx
*y
= b
;
2786 return XSTR (x
->sym
, 0) == XSTR (y
->sym
, 0);
2789 /* This is the worker function for const_rtx_hash, called via for_each_rtx. */
2792 const_rtx_hash_1 (rtx
*xp
, void *data
)
2794 unsigned HOST_WIDE_INT hwi
;
2795 enum machine_mode mode
;
2801 code
= GET_CODE (x
);
2802 mode
= GET_MODE (x
);
2803 h
= (hashval_t
) code
* 1048573 + mode
;
2811 const int shift
= sizeof (hashval_t
) * CHAR_BIT
;
2812 const int n
= sizeof (HOST_WIDE_INT
) / sizeof (hashval_t
);
2815 h
^= (hashval_t
) hwi
;
2816 for (i
= 1; i
< n
; ++i
)
2819 h
^= (hashval_t
) hwi
;
2825 if (mode
== VOIDmode
)
2827 hwi
= CONST_DOUBLE_LOW (x
) ^ CONST_DOUBLE_HIGH (x
);
2831 h
^= real_hash (CONST_DOUBLE_REAL_VALUE (x
));
2835 h
^= htab_hash_string (XSTR (x
, 0));
2839 h
= h
* 251 + CODE_LABEL_NUMBER (XEXP (x
, 0));
2843 case UNSPEC_VOLATILE
:
2844 h
= h
* 251 + XINT (x
, 1);
2852 *hp
= *hp
* 509 + h
;
2856 /* Compute a hash value for X, which should be a constant. */
2859 const_rtx_hash (rtx x
)
2862 for_each_rtx (&x
, const_rtx_hash_1
, &h
);
2867 /* Initialize constant pool hashing for a new function. */
2870 init_varasm_status (struct function
*f
)
2872 struct varasm_status
*p
;
2873 struct rtx_constant_pool
*pool
;
2875 p
= ggc_alloc (sizeof (struct varasm_status
));
2878 pool
= ggc_alloc (sizeof (struct rtx_constant_pool
));
2880 p
->deferred_constants
= 0;
2882 pool
->const_rtx_htab
= htab_create_ggc (31, const_desc_rtx_hash
,
2883 const_desc_rtx_eq
, NULL
);
2884 pool
->const_rtx_sym_htab
= htab_create_ggc (31, const_desc_rtx_sym_hash
,
2885 const_desc_rtx_sym_eq
, NULL
);
2886 pool
->first
= pool
->last
= NULL
;
2890 /* Given a MINUS expression, simplify it if both sides
2891 include the same symbol. */
2894 simplify_subtraction (rtx x
)
2896 rtx r
= simplify_rtx (x
);
2900 /* Given a constant rtx X, make (or find) a memory constant for its value
2901 and return a MEM rtx to refer to it in memory. */
2904 force_const_mem (enum machine_mode mode
, rtx x
)
2906 struct constant_descriptor_rtx
*desc
, tmp
;
2907 struct rtx_constant_pool
*pool
= cfun
->varasm
->pool
;
2914 /* If we're not allowed to drop X into the constant pool, don't. */
2915 if (targetm
.cannot_force_const_mem (x
))
2918 /* Lookup the value in the hashtable. */
2921 hash
= const_rtx_hash (x
);
2922 slot
= htab_find_slot_with_hash (pool
->const_rtx_htab
, &tmp
, hash
, INSERT
);
2925 /* If the constant was already present, return its memory. */
2927 return copy_rtx (desc
->mem
);
2929 /* Otherwise, create a new descriptor. */
2930 desc
= ggc_alloc (sizeof (*desc
));
2933 /* Align the location counter as required by EXP's data type. */
2934 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
2935 #ifdef CONSTANT_ALIGNMENT
2937 tree type
= lang_hooks
.types
.type_for_mode (mode
, 0);
2938 if (type
!= NULL_TREE
)
2939 align
= CONSTANT_ALIGNMENT (make_tree (type
, x
), align
);
2943 pool
->offset
+= (align
/ BITS_PER_UNIT
) - 1;
2944 pool
->offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
2947 desc
->constant
= tmp
.constant
;
2948 desc
->offset
= pool
->offset
;
2951 desc
->align
= align
;
2952 desc
->labelno
= const_labelno
;
2955 pool
->offset
+= GET_MODE_SIZE (mode
);
2957 pool
->last
->next
= desc
;
2959 pool
->first
= pool
->last
= desc
;
2962 /* Create a string containing the label name, in LABEL. */
2963 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2966 /* Construct the SYMBOL_REF. Make sure to mark it as belonging to
2967 the constants pool. */
2968 desc
->sym
= symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2969 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2970 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2971 current_function_uses_const_pool
= 1;
2973 /* Insert the descriptor into the symbol cross-reference table too. */
2974 slot
= htab_find_slot (pool
->const_rtx_sym_htab
, desc
, INSERT
);
2979 /* Construct the MEM. */
2980 desc
->mem
= def
= gen_const_mem (mode
, symbol
);
2981 set_mem_attributes (def
, lang_hooks
.types
.type_for_mode (mode
, 0), 1);
2983 /* If we're dropping a label to the constant pool, make sure we
2985 if (GET_CODE (x
) == LABEL_REF
)
2986 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
2988 return copy_rtx (def
);
2991 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
2992 the corresponding constant_descriptor_rtx structure. */
2994 static struct constant_descriptor_rtx
*
2995 find_pool_constant (struct rtx_constant_pool
*pool
, rtx sym
)
2997 struct constant_descriptor_rtx tmp
;
2999 return htab_find (pool
->const_rtx_sym_htab
, &tmp
);
3002 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3005 get_pool_constant (rtx addr
)
3007 return find_pool_constant (cfun
->varasm
->pool
, addr
)->constant
;
3010 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3011 and whether it has been output or not. */
3014 get_pool_constant_mark (rtx addr
, bool *pmarked
)
3016 struct constant_descriptor_rtx
*desc
;
3018 desc
= find_pool_constant (cfun
->varasm
->pool
, addr
);
3019 *pmarked
= (desc
->mark
!= 0);
3020 return desc
->constant
;
3023 /* Likewise, but for the constant pool of a specific function. */
3026 get_pool_constant_for_function (struct function
*f
, rtx addr
)
3028 return find_pool_constant (f
->varasm
->pool
, addr
)->constant
;
3031 /* Similar, return the mode. */
3034 get_pool_mode (rtx addr
)
3036 return find_pool_constant (cfun
->varasm
->pool
, addr
)->mode
;
3040 get_pool_mode_for_function (struct function
*f
, rtx addr
)
3042 return find_pool_constant (f
->varasm
->pool
, addr
)->mode
;
3045 /* Similar, return the offset in the constant pool. */
3048 get_pool_offset (rtx addr
)
3050 return find_pool_constant (cfun
->varasm
->pool
, addr
)->offset
;
3053 /* Return the size of the constant pool. */
3056 get_pool_size (void)
3058 return cfun
->varasm
->pool
->offset
;
3061 /* Worker function for output_constant_pool_1. Emit assembly for X
3062 in MODE with known alignment ALIGN. */
3065 output_constant_pool_2 (enum machine_mode mode
, rtx x
, unsigned int align
)
3067 switch (GET_MODE_CLASS (mode
))
3070 if (GET_CODE (x
) != CONST_DOUBLE
)
3075 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3076 assemble_real (r
, mode
, align
);
3081 case MODE_PARTIAL_INT
:
3082 assemble_integer (x
, GET_MODE_SIZE (mode
), align
, 1);
3085 case MODE_VECTOR_FLOAT
:
3086 case MODE_VECTOR_INT
:
3089 enum machine_mode submode
= GET_MODE_INNER (mode
);
3090 unsigned int subalign
= MIN (align
, GET_MODE_BITSIZE (submode
));
3092 if (GET_CODE (x
) != CONST_VECTOR
)
3094 units
= CONST_VECTOR_NUNITS (x
);
3096 for (i
= 0; i
< units
; i
++)
3098 rtx elt
= CONST_VECTOR_ELT (x
, i
);
3099 output_constant_pool_2 (submode
, elt
, i
? subalign
: align
);
3109 /* Worker function for output_constant_pool. Emit POOL. */
3112 output_constant_pool_1 (struct constant_descriptor_rtx
*desc
)
3120 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3121 whose CODE_LABEL has been deleted. This can occur if a jump table
3122 is eliminated by optimization. If so, write a constant of zero
3123 instead. Note that this can also happen by turning the
3124 CODE_LABEL into a NOTE. */
3125 /* ??? This seems completely and utterly wrong. Certainly it's
3126 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3127 functioning even with INSN_DELETED_P and friends. */
3130 switch (GET_CODE (x
))
3133 if (GET_CODE (XEXP (x
, 0)) != PLUS
3134 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3136 tmp
= XEXP (XEXP (x
, 0), 0);
3141 if (INSN_DELETED_P (tmp
)
3143 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3154 /* First switch to correct section. */
3155 targetm
.asm_out
.select_rtx_section (desc
->mode
, x
, desc
->align
);
3157 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3158 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, desc
->mode
,
3159 desc
->align
, desc
->labelno
, done
);
3162 assemble_align (desc
->align
);
3164 /* Output the label. */
3165 targetm
.asm_out
.internal_label (asm_out_file
, "LC", desc
->labelno
);
3167 /* Output the data. */
3168 output_constant_pool_2 (desc
->mode
, x
, desc
->align
);
3170 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3171 sections have proper size. */
3172 if (desc
->align
> GET_MODE_BITSIZE (desc
->mode
)
3173 && in_section
== in_named
3174 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3175 assemble_align (desc
->align
);
3177 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3183 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3184 to as used. Emit referenced deferred strings. This function can
3185 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3188 mark_constant (rtx
*current_rtx
, void *data
)
3190 struct rtx_constant_pool
*pool
= data
;
3191 rtx x
= *current_rtx
;
3193 if (x
== NULL_RTX
|| GET_CODE (x
) != SYMBOL_REF
)
3196 if (CONSTANT_POOL_ADDRESS_P (x
))
3198 struct constant_descriptor_rtx
*desc
= find_pool_constant (pool
, x
);
3199 if (desc
->mark
== 0)
3202 for_each_rtx (&desc
->constant
, mark_constant
, pool
);
3205 else if (TREE_CONSTANT_POOL_ADDRESS_P (x
))
3207 tree exp
= SYMBOL_REF_DECL (x
);
3208 if (!TREE_ASM_WRITTEN (exp
))
3210 n_deferred_constants
--;
3211 output_constant_def_contents (x
);
3218 /* Look through appropriate parts of INSN, marking all entries in the
3219 constant pool which are actually being used. Entries that are only
3220 referenced by other constants are also marked as used. Emit
3221 deferred strings that are used. */
3224 mark_constants (struct rtx_constant_pool
*pool
, rtx insn
)
3229 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3230 insns, not any notes that may be attached. We don't want to mark
3231 a constant just because it happens to appear in a REG_EQUIV note. */
3232 if (GET_CODE (PATTERN (insn
)) == SEQUENCE
)
3234 rtx seq
= PATTERN (insn
);
3235 int i
, n
= XVECLEN (seq
, 0);
3236 for (i
= 0; i
< n
; ++i
)
3238 rtx subinsn
= XVECEXP (seq
, 0, i
);
3239 if (INSN_P (subinsn
))
3240 for_each_rtx (&PATTERN (subinsn
), mark_constant
, pool
);
3244 for_each_rtx (&PATTERN (insn
), mark_constant
, pool
);
3247 /* Look through the instructions for this function, and mark all the
3248 entries in POOL which are actually being used. Emit deferred constants
3249 which have indeed been used. */
3252 mark_constant_pool (struct rtx_constant_pool
*pool
)
3256 if (pool
->first
== 0 && n_deferred_constants
== 0)
3259 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3260 mark_constants (pool
, insn
);
3262 for (link
= current_function_epilogue_delay_list
;
3264 link
= XEXP (link
, 1))
3265 mark_constants (pool
, XEXP (link
, 0));
3268 /* Write all the constants in the constant pool. */
3271 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED
,
3272 tree fndecl ATTRIBUTE_UNUSED
)
3274 struct rtx_constant_pool
*pool
= cfun
->varasm
->pool
;
3275 struct constant_descriptor_rtx
*desc
;
3277 /* It is possible for gcc to call force_const_mem and then to later
3278 discard the instructions which refer to the constant. In such a
3279 case we do not need to output the constant. */
3280 mark_constant_pool (pool
);
3282 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3283 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3286 for (desc
= pool
->first
; desc
; desc
= desc
->next
)
3287 output_constant_pool_1 (desc
);
3289 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3290 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3294 /* Determine what kind of relocations EXP may need. */
3297 compute_reloc_for_constant (tree exp
)
3299 int reloc
= 0, reloc2
;
3302 /* Give the front-end a chance to convert VALUE to something that
3303 looks more like a constant to the back-end. */
3304 exp
= lang_hooks
.expand_constant (exp
);
3306 switch (TREE_CODE (exp
))
3310 /* Go inside any operations that get_inner_reference can handle and see
3311 if what's inside is a constant: no need to do anything here for
3312 addresses of variables or functions. */
3313 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3314 tem
= TREE_OPERAND (tem
, 0))
3317 if (TREE_PUBLIC (tem
))
3324 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3325 reloc
|= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3329 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3330 reloc2
= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3331 /* The difference of two local labels is computable at link time. */
3332 if (reloc
== 1 && reloc2
== 1)
3340 case NON_LVALUE_EXPR
:
3341 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3345 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3346 if (TREE_VALUE (tem
) != 0)
3347 reloc
|= compute_reloc_for_constant (TREE_VALUE (tem
));
3357 /* Find all the constants whose addresses are referenced inside of EXP,
3358 and make sure assembler code with a label has been output for each one.
3359 Indicate whether an ADDR_EXPR has been encountered. */
3362 output_addressed_constants (tree exp
)
3366 /* Give the front-end a chance to convert VALUE to something that
3367 looks more like a constant to the back-end. */
3368 exp
= lang_hooks
.expand_constant (exp
);
3370 switch (TREE_CODE (exp
))
3374 /* Go inside any operations that get_inner_reference can handle and see
3375 if what's inside is a constant: no need to do anything here for
3376 addresses of variables or functions. */
3377 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3378 tem
= TREE_OPERAND (tem
, 0))
3381 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
3382 || TREE_CODE (tem
) == CONSTRUCTOR
)
3383 output_constant_def (tem
, 0);
3388 output_addressed_constants (TREE_OPERAND (exp
, 1));
3393 case NON_LVALUE_EXPR
:
3394 output_addressed_constants (TREE_OPERAND (exp
, 0));
3398 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3399 if (TREE_VALUE (tem
) != 0)
3400 output_addressed_constants (TREE_VALUE (tem
));
3409 /* Return nonzero if VALUE is a valid constant-valued expression
3410 for use in initializing a static variable; one that can be an
3411 element of a "constant" initializer.
3413 Return null_pointer_node if the value is absolute;
3414 if it is relocatable, return the variable that determines the relocation.
3415 We assume that VALUE has been folded as much as possible;
3416 therefore, we do not need to check for such things as
3417 arithmetic-combinations of integers. */
3420 initializer_constant_valid_p (tree value
, tree endtype
)
3422 /* Give the front-end a chance to convert VALUE to something that
3423 looks more like a constant to the back-end. */
3424 value
= lang_hooks
.expand_constant (value
);
3426 switch (TREE_CODE (value
))
3429 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3430 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3431 && TREE_CONSTANT (value
)
3432 && CONSTRUCTOR_ELTS (value
))
3435 bool absolute
= true;
3437 for (elt
= CONSTRUCTOR_ELTS (value
); elt
; elt
= TREE_CHAIN (elt
))
3440 value
= TREE_VALUE (elt
);
3441 reloc
= initializer_constant_valid_p (value
, TREE_TYPE (value
));
3444 if (reloc
!= null_pointer_node
)
3447 /* For a non-absolute relocation, there is no single
3448 variable that can be "the variable that determines the
3450 return absolute
? null_pointer_node
: error_mark_node
;
3453 return TREE_STATIC (value
) ? null_pointer_node
: NULL_TREE
;
3460 return null_pointer_node
;
3464 value
= staticp (TREE_OPERAND (value
, 0));
3465 /* "&(*a).f" is like unto pointer arithmetic. If "a" turns out to
3466 be a constant, this is old-skool offsetof-like nonsense. */
3468 && TREE_CODE (value
) == INDIRECT_REF
3469 && TREE_CONSTANT (TREE_OPERAND (value
, 0)))
3470 return null_pointer_node
;
3473 case VIEW_CONVERT_EXPR
:
3474 case NON_LVALUE_EXPR
:
3475 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3479 /* Allow conversions between pointer types. */
3480 if (POINTER_TYPE_P (TREE_TYPE (value
))
3481 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3482 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3484 /* Allow conversions between real types. */
3485 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3486 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3487 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3489 /* Allow length-preserving conversions between integer types. */
3490 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3491 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3492 && (TYPE_PRECISION (TREE_TYPE (value
))
3493 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3494 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3496 /* Allow conversions between other integer types only if
3498 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3499 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3501 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3503 if (inner
== null_pointer_node
)
3504 return null_pointer_node
;
3508 /* Allow (int) &foo provided int is as wide as a pointer. */
3509 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3510 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3511 && (TYPE_PRECISION (TREE_TYPE (value
))
3512 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3513 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3516 /* Likewise conversions from int to pointers, but also allow
3517 conversions from 0. */
3518 if ((POINTER_TYPE_P (TREE_TYPE (value
))
3519 || TREE_CODE (TREE_TYPE (value
)) == OFFSET_TYPE
)
3520 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3522 if (integer_zerop (TREE_OPERAND (value
, 0)))
3523 return null_pointer_node
;
3524 else if (TYPE_PRECISION (TREE_TYPE (value
))
3525 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
3526 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3530 /* Allow conversions to struct or union types if the value
3532 if (TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
3533 || TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
3534 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3539 if (! INTEGRAL_TYPE_P (endtype
)
3540 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3542 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3544 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3546 /* If either term is absolute, use the other terms relocation. */
3547 if (valid0
== null_pointer_node
)
3549 if (valid1
== null_pointer_node
)
3555 if (! INTEGRAL_TYPE_P (endtype
)
3556 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3558 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3560 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3562 /* Win if second argument is absolute. */
3563 if (valid1
== null_pointer_node
)
3565 /* Win if both arguments have the same relocation.
3566 Then the value is absolute. */
3567 if (valid0
== valid1
&& valid0
!= 0)
3568 return null_pointer_node
;
3570 /* Since GCC guarantees that string constants are unique in the
3571 generated code, a subtraction between two copies of the same
3572 constant string is absolute. */
3573 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
3574 && valid1
&& TREE_CODE (valid1
) == STRING_CST
3575 && operand_equal_p (valid0
, valid1
, 1))
3576 return null_pointer_node
;
3579 /* Support narrowing differences. */
3580 if (INTEGRAL_TYPE_P (endtype
))
3584 op0
= TREE_OPERAND (value
, 0);
3585 op1
= TREE_OPERAND (value
, 1);
3587 /* Like STRIP_NOPS except allow the operand mode to widen.
3588 This works around a feature of fold that simplifies
3589 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3590 that the narrower operation is cheaper. */
3592 while (TREE_CODE (op0
) == NOP_EXPR
3593 || TREE_CODE (op0
) == CONVERT_EXPR
3594 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3596 tree inner
= TREE_OPERAND (op0
, 0);
3597 if (inner
== error_mark_node
3598 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3599 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3600 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3605 while (TREE_CODE (op1
) == NOP_EXPR
3606 || TREE_CODE (op1
) == CONVERT_EXPR
3607 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3609 tree inner
= TREE_OPERAND (op1
, 0);
3610 if (inner
== error_mark_node
3611 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3612 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3613 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3618 op0
= initializer_constant_valid_p (op0
, endtype
);
3619 op1
= initializer_constant_valid_p (op1
, endtype
);
3621 /* Both initializers must be known. */
3625 return null_pointer_node
;
3627 /* Support differences between labels. */
3628 if (TREE_CODE (op0
) == LABEL_DECL
3629 && TREE_CODE (op1
) == LABEL_DECL
)
3630 return null_pointer_node
;
3632 if (TREE_CODE (op0
) == STRING_CST
3633 && TREE_CODE (op1
) == STRING_CST
3634 && operand_equal_p (op0
, op1
, 1))
3635 return null_pointer_node
;
3647 /* Output assembler code for constant EXP to FILE, with no label.
3648 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3649 Assumes output_addressed_constants has been done on EXP already.
3651 Generate exactly SIZE bytes of assembler data, padding at the end
3652 with zeros if necessary. SIZE must always be specified.
3654 SIZE is important for structure constructors,
3655 since trailing members may have been omitted from the constructor.
3656 It is also important for initialization of arrays from string constants
3657 since the full length of the string constant might not be wanted.
3658 It is also needed for initialization of unions, where the initializer's
3659 type is just one member, and that may not be as long as the union.
3661 There a case in which we would fail to output exactly SIZE bytes:
3662 for a structure constructor that wants to produce more than SIZE bytes.
3663 But such constructors will never be generated for any possible input.
3665 ALIGN is the alignment of the data in bits. */
3668 output_constant (tree exp
, unsigned HOST_WIDE_INT size
, unsigned int align
)
3670 enum tree_code code
;
3671 unsigned HOST_WIDE_INT thissize
;
3673 /* Some front-ends use constants other than the standard language-independent
3674 varieties, but which may still be output directly. Give the front-end a
3675 chance to convert EXP to a language-independent representation. */
3676 exp
= lang_hooks
.expand_constant (exp
);
3678 if (size
== 0 || flag_syntax_only
)
3681 /* Eliminate any conversions since we'll be outputting the underlying
3683 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3684 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3685 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3686 exp
= TREE_OPERAND (exp
, 0);
3688 code
= TREE_CODE (TREE_TYPE (exp
));
3689 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3691 /* Allow a constructor with no elements for any data type.
3692 This means to fill the space with zeros. */
3693 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3695 assemble_zeros (size
);
3699 if (TREE_CODE (exp
) == FDESC_EXPR
)
3701 #ifdef ASM_OUTPUT_FDESC
3702 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3703 tree decl
= TREE_OPERAND (exp
, 0);
3704 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3711 /* Now output the underlying data. If we've handling the padding, return.
3712 Otherwise, break and ensure SIZE is the size written. */
3720 case REFERENCE_TYPE
:
3722 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3723 EXPAND_INITIALIZER
),
3724 MIN (size
, thissize
), align
, 0))
3725 error ("initializer for integer value is too complicated");
3729 if (TREE_CODE (exp
) != REAL_CST
)
3730 error ("initializer for floating value is not a floating constant");
3732 assemble_real (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)), align
);
3736 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3737 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3738 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
3743 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3745 output_constructor (exp
, size
, align
);
3748 else if (TREE_CODE (exp
) == STRING_CST
)
3750 thissize
= MIN ((unsigned HOST_WIDE_INT
)TREE_STRING_LENGTH (exp
),
3752 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
3754 else if (TREE_CODE (exp
) == VECTOR_CST
)
3758 unsigned int nalign
;
3759 enum machine_mode inner
;
3761 inner
= TYPE_MODE (TREE_TYPE (TREE_TYPE (exp
)));
3762 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
3764 elt_size
= GET_MODE_SIZE (inner
);
3766 link
= TREE_VECTOR_CST_ELTS (exp
);
3767 output_constant (TREE_VALUE (link
), elt_size
, align
);
3768 while ((link
= TREE_CHAIN (link
)) != NULL
)
3769 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
3777 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3778 output_constructor (exp
, size
, align
);
3784 if (TREE_CODE (exp
) == INTEGER_CST
)
3785 assemble_integer (expand_expr (exp
, NULL_RTX
,
3786 VOIDmode
, EXPAND_INITIALIZER
),
3787 thissize
, align
, 1);
3788 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3790 unsigned char *buffer
= alloca (thissize
);
3791 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
3793 assemble_string ((char *) buffer
, thissize
);
3796 error ("unknown set constructor type");
3806 if (size
> thissize
)
3807 assemble_zeros (size
- thissize
);
3811 /* Subroutine of output_constructor, used for computing the size of
3812 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3813 type with an unspecified upper bound. */
3815 static unsigned HOST_WIDE_INT
3816 array_size_for_constructor (tree val
)
3820 /* This code used to attempt to handle string constants that are not
3821 arrays of single-bytes, but nothing else does, so there's no point in
3823 if (TREE_CODE (val
) == STRING_CST
)
3824 return TREE_STRING_LENGTH (val
);
3826 max_index
= NULL_TREE
;
3827 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
3829 tree index
= TREE_PURPOSE (i
);
3831 if (TREE_CODE (index
) == RANGE_EXPR
)
3832 index
= TREE_OPERAND (index
, 1);
3833 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
3837 if (max_index
== NULL_TREE
)
3840 /* Compute the total number of array elements. */
3841 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
3843 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
3844 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
3846 /* Multiply by the array element unit size to find number of bytes. */
3847 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
3849 return tree_low_cst (i
, 1);
3852 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3853 Generate at least SIZE bytes, padding if necessary. */
3856 output_constructor (tree exp
, unsigned HOST_WIDE_INT size
,
3859 tree type
= TREE_TYPE (exp
);
3860 tree link
, field
= 0;
3862 /* Number of bytes output or skipped so far.
3863 In other words, current position within the constructor. */
3864 HOST_WIDE_INT total_bytes
= 0;
3865 /* Nonzero means BYTE contains part of a byte, to be output. */
3866 int byte_buffer_in_use
= 0;
3869 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3872 if (TREE_CODE (type
) == RECORD_TYPE
)
3873 field
= TYPE_FIELDS (type
);
3875 if (TREE_CODE (type
) == ARRAY_TYPE
3876 && TYPE_DOMAIN (type
) != 0)
3877 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
3879 /* As LINK goes through the elements of the constant,
3880 FIELD goes through the structure fields, if the constant is a structure.
3881 if the constant is a union, then we override this,
3882 by getting the field from the TREE_LIST element.
3883 But the constant could also be an array. Then FIELD is zero.
3885 There is always a maximum of one element in the chain LINK for unions
3886 (even if the initializer in a source program incorrectly contains
3888 for (link
= CONSTRUCTOR_ELTS (exp
);
3890 link
= TREE_CHAIN (link
),
3891 field
= field
? TREE_CHAIN (field
) : 0)
3893 tree val
= TREE_VALUE (link
);
3896 /* The element in a union constructor specifies the proper field
3898 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
3899 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
3900 && TREE_PURPOSE (link
) != 0)
3901 field
= TREE_PURPOSE (link
);
3903 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3904 index
= TREE_PURPOSE (link
);
3906 #ifdef ASM_COMMENT_START
3907 if (field
&& flag_verbose_asm
)
3908 fprintf (asm_out_file
, "%s %s:\n",
3911 ? IDENTIFIER_POINTER (DECL_NAME (field
))
3915 /* Eliminate the marker that makes a cast not be an lvalue. */
3919 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
3921 unsigned HOST_WIDE_INT fieldsize
3922 = int_size_in_bytes (TREE_TYPE (type
));
3923 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
3924 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
3925 HOST_WIDE_INT index
;
3926 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
3928 for (index
= lo_index
; index
<= hi_index
; index
++)
3930 /* Output the element's initial value. */
3932 assemble_zeros (fieldsize
);
3934 output_constant (val
, fieldsize
, align2
);
3936 /* Count its size. */
3937 total_bytes
+= fieldsize
;
3940 else if (field
== 0 || !DECL_BIT_FIELD (field
))
3942 /* An element that is not a bit-field. */
3944 unsigned HOST_WIDE_INT fieldsize
;
3945 /* Since this structure is static,
3946 we know the positions are constant. */
3947 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
3948 unsigned int align2
;
3951 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
3952 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
3954 /* Output any buffered-up bit-fields preceding this element. */
3955 if (byte_buffer_in_use
)
3957 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3959 byte_buffer_in_use
= 0;
3962 /* Advance to offset of this element.
3963 Note no alignment needed in an array, since that is guaranteed
3964 if each element has the proper size. */
3965 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
3967 assemble_zeros (pos
- total_bytes
);
3971 /* Find the alignment of this element. */
3972 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
3974 /* Determine size this element should occupy. */
3979 /* If this is an array with an unspecified upper bound,
3980 the initializer determines the size. */
3981 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
3982 but we cannot do this until the deprecated support for
3983 initializing zero-length array members is removed. */
3984 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
3985 && TYPE_DOMAIN (TREE_TYPE (field
))
3986 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
3988 fieldsize
= array_size_for_constructor (val
);
3989 /* Given a non-empty initialization, this field had
3991 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
3994 else if (DECL_SIZE_UNIT (field
))
3996 /* ??? This can't be right. If the decl size overflows
3997 a host integer we will silently emit no data. */
3998 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
3999 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4003 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4005 /* Output the element's initial value. */
4007 assemble_zeros (fieldsize
);
4009 output_constant (val
, fieldsize
, align2
);
4011 /* Count its size. */
4012 total_bytes
+= fieldsize
;
4014 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4015 error ("invalid initial value for member %qs",
4016 IDENTIFIER_POINTER (DECL_NAME (field
)));
4019 /* Element that is a bit-field. */
4021 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4022 HOST_WIDE_INT end_offset
4023 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4026 val
= integer_zero_node
;
4028 /* If this field does not start in this (or, next) byte,
4030 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4032 /* Output remnant of any bit field in previous bytes. */
4033 if (byte_buffer_in_use
)
4035 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4037 byte_buffer_in_use
= 0;
4040 /* If still not at proper byte, advance to there. */
4041 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4043 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4044 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4048 if (! byte_buffer_in_use
)
4051 /* We must split the element into pieces that fall within
4052 separate bytes, and combine each byte with previous or
4053 following bit-fields. */
4055 /* next_offset is the offset n fbits from the beginning of
4056 the structure to the next bit of this element to be processed.
4057 end_offset is the offset of the first bit past the end of
4059 while (next_offset
< end_offset
)
4063 HOST_WIDE_INT value
;
4064 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4065 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4067 /* Advance from byte to byte
4068 within this element when necessary. */
4069 while (next_byte
!= total_bytes
)
4071 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4076 /* Number of bits we can process at once
4077 (all part of the same byte). */
4078 this_time
= MIN (end_offset
- next_offset
,
4079 BITS_PER_UNIT
- next_bit
);
4080 if (BYTES_BIG_ENDIAN
)
4082 /* On big-endian machine, take the most significant bits
4083 first (of the bits that are significant)
4084 and put them into bytes from the most significant end. */
4085 shift
= end_offset
- next_offset
- this_time
;
4087 /* Don't try to take a bunch of bits that cross
4088 the word boundary in the INTEGER_CST. We can
4089 only select bits from the LOW or HIGH part
4091 if (shift
< HOST_BITS_PER_WIDE_INT
4092 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4094 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4095 shift
= HOST_BITS_PER_WIDE_INT
;
4098 /* Now get the bits from the appropriate constant word. */
4099 if (shift
< HOST_BITS_PER_WIDE_INT
)
4100 value
= TREE_INT_CST_LOW (val
);
4101 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4103 value
= TREE_INT_CST_HIGH (val
);
4104 shift
-= HOST_BITS_PER_WIDE_INT
;
4109 /* Get the result. This works only when:
4110 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4111 byte
|= (((value
>> shift
)
4112 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4113 << (BITS_PER_UNIT
- this_time
- next_bit
));
4117 /* On little-endian machines,
4118 take first the least significant bits of the value
4119 and pack them starting at the least significant
4120 bits of the bytes. */
4121 shift
= next_offset
- int_bit_position (field
);
4123 /* Don't try to take a bunch of bits that cross
4124 the word boundary in the INTEGER_CST. We can
4125 only select bits from the LOW or HIGH part
4127 if (shift
< HOST_BITS_PER_WIDE_INT
4128 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4129 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4131 /* Now get the bits from the appropriate constant word. */
4132 if (shift
< HOST_BITS_PER_WIDE_INT
)
4133 value
= TREE_INT_CST_LOW (val
);
4134 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4136 value
= TREE_INT_CST_HIGH (val
);
4137 shift
-= HOST_BITS_PER_WIDE_INT
;
4142 /* Get the result. This works only when:
4143 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4144 byte
|= (((value
>> shift
)
4145 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4149 next_offset
+= this_time
;
4150 byte_buffer_in_use
= 1;
4155 if (byte_buffer_in_use
)
4157 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4161 if ((unsigned HOST_WIDE_INT
)total_bytes
< size
)
4162 assemble_zeros (size
- total_bytes
);
4165 /* This TREE_LIST contains any weak symbol declarations waiting
4167 static GTY(()) tree weak_decls
;
4169 /* Mark DECL as weak. */
4172 mark_weak (tree decl
)
4174 DECL_WEAK (decl
) = 1;
4176 if (DECL_RTL_SET_P (decl
)
4177 && MEM_P (DECL_RTL (decl
))
4178 && XEXP (DECL_RTL (decl
), 0)
4179 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4180 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4183 /* Merge weak status between NEWDECL and OLDDECL. */
4186 merge_weak (tree newdecl
, tree olddecl
)
4188 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4191 if (DECL_WEAK (newdecl
))
4195 /* NEWDECL is weak, but OLDDECL is not. */
4197 /* If we already output the OLDDECL, we're in trouble; we can't
4198 go back and make it weak. This error cannot caught in
4199 declare_weak because the NEWDECL and OLDDECL was not yet
4200 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4201 if (TREE_ASM_WRITTEN (olddecl
))
4202 error ("%Jweak declaration of %qD must precede definition",
4205 /* If we've already generated rtl referencing OLDDECL, we may
4206 have done so in a way that will not function properly with
4208 else if (TREE_USED (olddecl
)
4209 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4210 warning ("%Jweak declaration of %qD after first use results "
4211 "in unspecified behavior", newdecl
, newdecl
);
4215 /* We put the NEWDECL on the weak_decls list at some point.
4216 Replace it with the OLDDECL. */
4217 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4218 if (TREE_VALUE (wd
) == newdecl
)
4220 TREE_VALUE (wd
) = olddecl
;
4223 /* We may not find the entry on the list. If NEWDECL is a
4224 weak alias, then we will have already called
4225 globalize_decl to remove the entry; in that case, we do
4226 not need to do anything. */
4229 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4230 mark_weak (olddecl
);
4233 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4234 weak. Just update NEWDECL to indicate that it's weak too. */
4235 mark_weak (newdecl
);
4238 /* Declare DECL to be a weak symbol. */
4241 declare_weak (tree decl
)
4243 if (! TREE_PUBLIC (decl
))
4244 error ("%Jweak declaration of %qD must be public", decl
, decl
);
4245 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4246 error ("%Jweak declaration of %qD must precede definition", decl
, decl
);
4247 else if (SUPPORTS_WEAK
)
4249 if (! DECL_WEAK (decl
))
4250 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4253 warning ("%Jweak declaration of %qD not supported", decl
, decl
);
4258 /* Emit any pending weak declarations. */
4265 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4267 tree decl
= TREE_VALUE (t
);
4268 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4269 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4272 if (! TREE_USED (decl
))
4275 #ifdef ASM_WEAKEN_DECL
4276 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4278 #ifdef ASM_WEAKEN_LABEL
4279 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4281 #ifdef ASM_OUTPUT_WEAK_ALIAS
4282 warning ("only weak aliases are supported in this configuration");
4290 /* Emit the assembly bits to indicate that DECL is globally visible. */
4293 globalize_decl (tree decl
)
4295 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4297 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4298 if (DECL_WEAK (decl
))
4302 #ifdef ASM_WEAKEN_DECL
4303 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4305 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4308 /* Remove this function from the pending weak list so that
4309 we do not emit multiple .weak directives for it. */
4310 for (p
= &weak_decls
; (t
= *p
) ; )
4312 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4313 *p
= TREE_CHAIN (t
);
4315 p
= &TREE_CHAIN (t
);
4319 #elif defined(ASM_MAKE_LABEL_LINKONCE)
4320 if (DECL_ONE_ONLY (decl
))
4321 ASM_MAKE_LABEL_LINKONCE (asm_out_file
, name
);
4324 targetm
.asm_out
.globalize_label (asm_out_file
, name
);
4327 /* Emit an assembler directive to make the symbol for DECL an alias to
4328 the symbol for TARGET. */
4331 assemble_alias (tree decl
, tree target ATTRIBUTE_UNUSED
)
4335 /* We must force creation of DECL_RTL for debug info generation, even though
4336 we don't use it here. */
4337 make_decl_rtl (decl
);
4339 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4341 #ifdef ASM_OUTPUT_DEF
4342 /* Make name accessible from other files, if appropriate. */
4344 if (TREE_PUBLIC (decl
))
4346 globalize_decl (decl
);
4347 maybe_assemble_visibility (decl
);
4350 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4351 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4353 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4355 #else /* !ASM_OUTPUT_DEF */
4356 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4357 if (DECL_WEAK (decl
))
4360 #ifdef ASM_WEAKEN_DECL
4361 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4363 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4365 /* Remove this function from the pending weak list so that
4366 we do not emit multiple .weak directives for it. */
4367 for (p
= &weak_decls
; (t
= *p
) ; )
4368 if (DECL_ASSEMBLER_NAME (decl
)
4369 == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4370 *p
= TREE_CHAIN (t
);
4372 p
= &TREE_CHAIN (t
);
4375 warning ("only weak aliases are supported in this configuration");
4378 warning ("alias definitions not supported in this configuration; ignored");
4382 TREE_USED (decl
) = 1;
4383 TREE_ASM_WRITTEN (decl
) = 1;
4384 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4387 /* Emit an assembler directive to set symbol for DECL visibility to
4388 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4391 default_assemble_visibility (tree decl
, int vis
)
4393 static const char * const visibility_types
[] = {
4394 NULL
, "internal", "hidden", "protected"
4397 const char *name
, *type
;
4399 name
= (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4400 type
= visibility_types
[vis
];
4402 #ifdef HAVE_GAS_HIDDEN
4403 fprintf (asm_out_file
, "\t.%s\t", type
);
4404 assemble_name (asm_out_file
, name
);
4405 fprintf (asm_out_file
, "\n");
4407 warning ("visibility attribute not supported in this configuration; ignored");
4411 /* A helper function to call assemble_visibility when needed for a decl. */
4414 maybe_assemble_visibility (tree decl
)
4416 enum symbol_visibility vis
= DECL_VISIBILITY (decl
);
4418 if (vis
!= VISIBILITY_DEFAULT
)
4419 targetm
.asm_out
.visibility (decl
, vis
);
4422 /* Returns 1 if the target configuration supports defining public symbols
4423 so that one of them will be chosen at link time instead of generating a
4424 multiply-defined symbol error, whether through the use of weak symbols or
4425 a target-specific mechanism for having duplicates discarded. */
4428 supports_one_only (void)
4430 if (SUPPORTS_ONE_ONLY
)
4432 return SUPPORTS_WEAK
;
4435 /* Set up DECL as a public symbol that can be defined in multiple
4436 translation units without generating a linker error. */
4439 make_decl_one_only (tree decl
)
4441 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4444 TREE_PUBLIC (decl
) = 1;
4446 if (SUPPORTS_ONE_ONLY
)
4448 #ifdef MAKE_DECL_ONE_ONLY
4449 MAKE_DECL_ONE_ONLY (decl
);
4451 DECL_ONE_ONLY (decl
) = 1;
4453 else if (TREE_CODE (decl
) == VAR_DECL
4454 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4455 DECL_COMMON (decl
) = 1;
4456 else if (SUPPORTS_WEAK
)
4457 DECL_WEAK (decl
) = 1;
4463 init_varasm_once (void)
4465 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4466 in_named_entry_eq
, NULL
);
4467 const_desc_htab
= htab_create_ggc (1009, const_desc_hash
,
4468 const_desc_eq
, NULL
);
4470 const_alias_set
= new_alias_set ();
4474 decl_tls_model (tree decl
)
4476 enum tls_model kind
;
4477 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4482 attr
= TREE_VALUE (TREE_VALUE (attr
));
4483 if (TREE_CODE (attr
) != STRING_CST
)
4485 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4486 kind
= TLS_MODEL_LOCAL_EXEC
;
4487 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4488 kind
= TLS_MODEL_INITIAL_EXEC
;
4489 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4490 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4491 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4492 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4498 is_local
= targetm
.binds_local_p (decl
);
4502 kind
= TLS_MODEL_LOCAL_EXEC
;
4504 kind
= TLS_MODEL_INITIAL_EXEC
;
4506 /* Local dynamic is inefficient when we're not combining the
4507 parts of the address. */
4508 else if (optimize
&& is_local
)
4509 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4511 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4512 if (kind
< flag_tls_default
)
4513 kind
= flag_tls_default
;
4518 /* Select a set of attributes for section NAME based on the properties
4519 of DECL and whether or not RELOC indicates that DECL's initializer
4520 might contain runtime relocations.
4522 We make the section read-only and executable for a function decl,
4523 read-only for a const data decl, and writable for a non-const data decl. */
4526 default_section_type_flags (tree decl
, const char *name
, int reloc
)
4528 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4532 default_section_type_flags_1 (tree decl
, const char *name
, int reloc
,
4537 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4538 flags
= SECTION_CODE
;
4539 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4541 else if (unlikely_text_section_name
4542 && strcmp (name
, unlikely_text_section_name
) == 0)
4543 flags
= SECTION_CODE
;
4545 flags
= SECTION_WRITE
;
4547 if (decl
&& DECL_ONE_ONLY (decl
))
4548 flags
|= SECTION_LINKONCE
;
4550 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4551 flags
|= SECTION_TLS
| SECTION_WRITE
;
4553 if (strcmp (name
, ".bss") == 0
4554 || strncmp (name
, ".bss.", 5) == 0
4555 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4556 || strcmp (name
, ".sbss") == 0
4557 || strncmp (name
, ".sbss.", 6) == 0
4558 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0
4559 || strcmp (name
, ".tbss") == 0
4560 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4561 flags
|= SECTION_BSS
;
4563 if (strcmp (name
, ".tdata") == 0
4564 || strcmp (name
, ".tbss") == 0
4565 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0
4566 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4567 flags
|= SECTION_TLS
;
4569 /* These three sections have special ELF types. They are neither
4570 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4571 want to print a section type (@progbits or @nobits). If someone
4572 is silly enough to emit code or TLS variables to one of these
4573 sections, then don't handle them specially. */
4574 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4575 && (strcmp (name
, ".init_array") == 0
4576 || strcmp (name
, ".fini_array") == 0
4577 || strcmp (name
, ".preinit_array") == 0))
4578 flags
|= SECTION_NOTYPE
;
4583 /* Output assembly to switch to section NAME with attribute FLAGS.
4584 Four variants for common object file formats. */
4587 default_no_named_section (const char *name ATTRIBUTE_UNUSED
,
4588 unsigned int flags ATTRIBUTE_UNUSED
,
4589 tree decl ATTRIBUTE_UNUSED
)
4591 /* Some object formats don't support named sections at all. The
4592 front-end should already have flagged this as an error. */
4597 default_elf_asm_named_section (const char *name
, unsigned int flags
,
4598 tree decl ATTRIBUTE_UNUSED
)
4600 char flagchars
[10], *f
= flagchars
;
4602 /* If we have already declared this section, we can use an
4603 abbreviated form to switch back to it -- unless this section is
4604 part of a COMDAT groups, in which case GAS requires the full
4605 declaration every time. */
4606 if (!(HAVE_GAS_COMDAT_GROUP
&& (flags
& SECTION_LINKONCE
))
4607 && ! named_section_first_declaration (name
))
4609 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4613 if (!(flags
& SECTION_DEBUG
))
4615 if (flags
& SECTION_WRITE
)
4617 if (flags
& SECTION_CODE
)
4619 if (flags
& SECTION_SMALL
)
4621 if (flags
& SECTION_MERGE
)
4623 if (flags
& SECTION_STRINGS
)
4625 if (flags
& SECTION_TLS
)
4627 if (HAVE_GAS_COMDAT_GROUP
&& (flags
& SECTION_LINKONCE
))
4631 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4633 if (!(flags
& SECTION_NOTYPE
))
4638 if (flags
& SECTION_BSS
)
4644 #ifdef ASM_COMMENT_START
4645 /* On platforms that use "@" as the assembly comment character,
4647 if (strcmp (ASM_COMMENT_START
, "@") == 0)
4650 fprintf (asm_out_file
, format
, type
);
4652 if (flags
& SECTION_ENTSIZE
)
4653 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4654 if (HAVE_GAS_COMDAT_GROUP
&& (flags
& SECTION_LINKONCE
))
4655 fprintf (asm_out_file
, ",%s,comdat",
4656 lang_hooks
.decls
.comdat_group (decl
));
4659 putc ('\n', asm_out_file
);
4663 default_coff_asm_named_section (const char *name
, unsigned int flags
,
4664 tree decl ATTRIBUTE_UNUSED
)
4666 char flagchars
[8], *f
= flagchars
;
4668 if (flags
& SECTION_WRITE
)
4670 if (flags
& SECTION_CODE
)
4674 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4678 default_pe_asm_named_section (const char *name
, unsigned int flags
,
4681 default_coff_asm_named_section (name
, flags
, decl
);
4683 if (flags
& SECTION_LINKONCE
)
4685 /* Functions may have been compiled at various levels of
4686 optimization so we can't use `same_size' here.
4687 Instead, have the linker pick one. */
4688 fprintf (asm_out_file
, "\t.linkonce %s\n",
4689 (flags
& SECTION_CODE
? "discard" : "same_size"));
4693 /* The lame default section selector. */
4696 default_select_section (tree decl
, int reloc
,
4697 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4699 bool readonly
= false;
4703 if (decl_readonly_section (decl
, reloc
))
4706 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4708 if (! ((flag_pic
&& reloc
)
4709 || !TREE_READONLY (decl
)
4710 || TREE_SIDE_EFFECTS (decl
)
4711 || !TREE_CONSTANT (decl
)))
4714 else if (TREE_CODE (decl
) == STRING_CST
)
4716 else if (! (flag_pic
&& reloc
))
4720 readonly_data_section ();
4725 /* A helper function for default_elf_select_section and
4726 default_elf_unique_section. Categorizes the DECL. */
4728 enum section_category
4733 SECCAT_RODATA_MERGE_STR
,
4734 SECCAT_RODATA_MERGE_STR_INIT
,
4735 SECCAT_RODATA_MERGE_CONST
,
4740 /* To optimize loading of shared programs, define following subsections
4742 _REL Contains data that has relocations, so they get grouped
4743 together and dynamic linker will visit fewer pages in memory.
4744 _RO Contains data that is otherwise read-only. This is useful
4745 with prelinking as most relocations won't be dynamically
4746 linked and thus stay read only.
4747 _LOCAL Marks data containing relocations only to local objects.
4748 These relocations will get fully resolved by prelinking. */
4750 SECCAT_DATA_REL_LOCAL
,
4752 SECCAT_DATA_REL_RO_LOCAL
,
4762 static enum section_category
4763 categorize_decl_for_section (tree
, int, int);
4765 static enum section_category
4766 categorize_decl_for_section (tree decl
, int reloc
, int shlib
)
4768 enum section_category ret
;
4770 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4772 else if (TREE_CODE (decl
) == STRING_CST
)
4774 if (flag_mudflap
) /* or !flag_merge_constants */
4775 return SECCAT_RODATA
;
4777 return SECCAT_RODATA_MERGE_STR
;
4779 else if (TREE_CODE (decl
) == VAR_DECL
)
4781 if (DECL_INITIAL (decl
) == NULL
4782 || DECL_INITIAL (decl
) == error_mark_node
4783 || (flag_zero_initialized_in_bss
4784 /* Leave constant zeroes in .rodata so they can be shared. */
4785 && !TREE_READONLY (decl
)
4786 && initializer_zerop (DECL_INITIAL (decl
))))
4788 else if (! TREE_READONLY (decl
)
4789 || TREE_SIDE_EFFECTS (decl
)
4790 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
4792 if (shlib
&& (reloc
& 2))
4793 ret
= SECCAT_DATA_REL
;
4794 else if (shlib
&& reloc
)
4795 ret
= SECCAT_DATA_REL_LOCAL
;
4799 else if (shlib
&& (reloc
& 2))
4800 ret
= SECCAT_DATA_REL_RO
;
4801 else if (shlib
&& reloc
)
4802 ret
= SECCAT_DATA_REL_RO_LOCAL
;
4803 else if (reloc
|| flag_merge_constants
< 2)
4804 /* C and C++ don't allow different variables to share the same
4805 location. -fmerge-all-constants allows even that (at the
4806 expense of not conforming). */
4807 ret
= SECCAT_RODATA
;
4808 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
4809 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
4811 ret
= SECCAT_RODATA_MERGE_CONST
;
4813 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4815 if ((shlib
&& reloc
)
4816 || TREE_SIDE_EFFECTS (decl
)
4817 || ! TREE_CONSTANT (decl
))
4820 ret
= SECCAT_RODATA
;
4823 ret
= SECCAT_RODATA
;
4825 /* There are no read-only thread-local sections. */
4826 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4828 /* Note that this would be *just* SECCAT_BSS, except that there's
4829 no concept of a read-only thread-local-data section. */
4830 if (ret
== SECCAT_BSS
4831 || (flag_zero_initialized_in_bss
4832 && initializer_zerop (DECL_INITIAL (decl
))))
4838 /* If the target uses small data sections, select it. */
4839 else if (targetm
.in_small_data_p (decl
))
4841 if (ret
== SECCAT_BSS
)
4843 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
4844 ret
= SECCAT_SRODATA
;
4853 decl_readonly_section (tree decl
, int reloc
)
4855 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
4859 decl_readonly_section_1 (tree decl
, int reloc
, int shlib
)
4861 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4864 case SECCAT_RODATA_MERGE_STR
:
4865 case SECCAT_RODATA_MERGE_STR_INIT
:
4866 case SECCAT_RODATA_MERGE_CONST
:
4867 case SECCAT_SRODATA
:
4876 /* Select a section based on the above categorization. */
4879 default_elf_select_section (tree decl
, int reloc
,
4880 unsigned HOST_WIDE_INT align
)
4882 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
4886 default_elf_select_section_1 (tree decl
, int reloc
,
4887 unsigned HOST_WIDE_INT align
, int shlib
)
4889 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4892 /* We're not supposed to be called on FUNCTION_DECLs. */
4895 readonly_data_section ();
4897 case SECCAT_RODATA_MERGE_STR
:
4898 mergeable_string_section (decl
, align
, 0);
4900 case SECCAT_RODATA_MERGE_STR_INIT
:
4901 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
4903 case SECCAT_RODATA_MERGE_CONST
:
4904 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
4906 case SECCAT_SRODATA
:
4907 named_section (NULL_TREE
, ".sdata2", reloc
);
4912 case SECCAT_DATA_REL
:
4913 named_section (NULL_TREE
, ".data.rel", reloc
);
4915 case SECCAT_DATA_REL_LOCAL
:
4916 named_section (NULL_TREE
, ".data.rel.local", reloc
);
4918 case SECCAT_DATA_REL_RO
:
4919 named_section (NULL_TREE
, ".data.rel.ro", reloc
);
4921 case SECCAT_DATA_REL_RO_LOCAL
:
4922 named_section (NULL_TREE
, ".data.rel.ro.local", reloc
);
4925 named_section (NULL_TREE
, ".sdata", reloc
);
4928 named_section (NULL_TREE
, ".tdata", reloc
);
4931 #ifdef BSS_SECTION_ASM_OP
4934 named_section (NULL_TREE
, ".bss", reloc
);
4938 named_section (NULL_TREE
, ".sbss", reloc
);
4941 named_section (NULL_TREE
, ".tbss", reloc
);
4948 /* Construct a unique section name based on the decl name and the
4949 categorization performed above. */
4952 default_unique_section (tree decl
, int reloc
)
4954 default_unique_section_1 (decl
, reloc
, flag_pic
);
4958 default_unique_section_1 (tree decl
, int reloc
, int shlib
)
4960 bool one_only
= DECL_ONE_ONLY (decl
);
4961 const char *prefix
, *name
;
4965 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4968 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
4971 case SECCAT_RODATA_MERGE_STR
:
4972 case SECCAT_RODATA_MERGE_STR_INIT
:
4973 case SECCAT_RODATA_MERGE_CONST
:
4974 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
4976 case SECCAT_SRODATA
:
4977 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
4980 case SECCAT_DATA_REL
:
4981 case SECCAT_DATA_REL_LOCAL
:
4982 case SECCAT_DATA_REL_RO
:
4983 case SECCAT_DATA_REL_RO_LOCAL
:
4984 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
4987 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
4990 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
4993 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
4996 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
4999 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
5004 plen
= strlen (prefix
);
5006 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5007 name
= targetm
.strip_name_encoding (name
);
5008 nlen
= strlen (name
);
5010 string
= alloca (nlen
+ plen
+ 1);
5011 memcpy (string
, prefix
, plen
);
5012 memcpy (string
+ plen
, name
, nlen
+ 1);
5014 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
5018 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
5020 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
5023 switch (GET_CODE (x
))
5035 readonly_data_section ();
5039 default_elf_select_rtx_section (enum machine_mode mode
, rtx x
,
5040 unsigned HOST_WIDE_INT align
)
5042 /* ??? Handle small data here somehow. */
5045 switch (GET_CODE (x
))
5049 named_section (NULL_TREE
, ".data.rel.ro", 3);
5053 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
5060 mergeable_constant_section (mode
, align
, 0);
5063 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
5066 default_encode_section_info (tree decl
, rtx rtl
, int first ATTRIBUTE_UNUSED
)
5071 /* Careful not to prod global register variables. */
5074 symbol
= XEXP (rtl
, 0);
5075 if (GET_CODE (symbol
) != SYMBOL_REF
)
5079 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5080 flags
|= SYMBOL_FLAG_FUNCTION
;
5081 if (targetm
.binds_local_p (decl
))
5082 flags
|= SYMBOL_FLAG_LOCAL
;
5083 if (targetm
.in_small_data_p (decl
))
5084 flags
|= SYMBOL_FLAG_SMALL
;
5085 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5086 flags
|= decl_tls_model (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
5087 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
5088 being PUBLIC, the thing *must* be defined in this translation unit.
5089 Prevent this buglet from being propagated into rtl code as well. */
5090 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
5091 flags
|= SYMBOL_FLAG_EXTERNAL
;
5093 SYMBOL_REF_FLAGS (symbol
) = flags
;
5096 /* By default, we do nothing for encode_section_info, so we need not
5097 do anything but discard the '*' marker. */
5100 default_strip_name_encoding (const char *str
)
5102 return str
+ (*str
== '*');
5105 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5106 wrt cross-module name binding. */
5109 default_binds_local_p (tree exp
)
5111 return default_binds_local_p_1 (exp
, flag_shlib
);
5115 default_binds_local_p_1 (tree exp
, int shlib
)
5119 /* A non-decl is an entry in the constant pool. */
5122 /* Static variables are always local. */
5123 else if (! TREE_PUBLIC (exp
))
5125 /* A variable is local if the user explicitly tells us so. */
5126 else if (DECL_VISIBILITY_SPECIFIED (exp
) && DECL_VISIBILITY (exp
) != VISIBILITY_DEFAULT
)
5128 /* Otherwise, variables defined outside this object may not be local. */
5129 else if (DECL_EXTERNAL (exp
))
5131 /* Linkonce and weak data are never local. */
5132 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
5134 /* If none of the above and visibility is not default, make local. */
5135 else if (DECL_VISIBILITY (exp
) != VISIBILITY_DEFAULT
)
5137 /* If PIC, then assume that any global name can be overridden by
5138 symbols resolved from other modules. */
5141 /* Uninitialized COMMON variable may be unified with symbols
5142 resolved from other modules. */
5143 else if (DECL_COMMON (exp
)
5144 && (DECL_INITIAL (exp
) == NULL
5145 || DECL_INITIAL (exp
) == error_mark_node
))
5147 /* Otherwise we're left with initialized (or non-common) global data
5148 which is of necessity defined locally. */
5155 /* Determine whether or not a pointer mode is valid. Assume defaults
5156 of ptr_mode or Pmode - can be overridden. */
5158 default_valid_pointer_mode (enum machine_mode mode
)
5160 return (mode
== ptr_mode
|| mode
== Pmode
);
5163 /* Default function to output code that will globalize a label. A
5164 target must define GLOBAL_ASM_OP or provide it's own function to
5165 globalize a label. */
5166 #ifdef GLOBAL_ASM_OP
5168 default_globalize_label (FILE * stream
, const char *name
)
5170 fputs (GLOBAL_ASM_OP
, stream
);
5171 assemble_name (stream
, name
);
5172 putc ('\n', stream
);
5174 #endif /* GLOBAL_ASM_OP */
5176 /* Default function to output a label for unwind information. The
5177 default is to do nothing. A target that needs nonlocal labels for
5178 unwind information must provide its own function to do this. */
5180 default_emit_unwind_label (FILE * stream ATTRIBUTE_UNUSED
,
5181 tree decl ATTRIBUTE_UNUSED
,
5182 int for_eh ATTRIBUTE_UNUSED
,
5183 int empty ATTRIBUTE_UNUSED
)
5187 /* This is how to output an internal numbered label where PREFIX is
5188 the class of label and LABELNO is the number within the class. */
5191 default_internal_label (FILE *stream
, const char *prefix
,
5192 unsigned long labelno
)
5194 char *const buf
= alloca (40 + strlen (prefix
));
5195 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5196 ASM_OUTPUT_LABEL (stream
, buf
);
5199 /* This is the default behavior at the beginning of a file. It's
5200 controlled by two other target-hook toggles. */
5202 default_file_start (void)
5204 if (targetm
.file_start_app_off
&& !flag_verbose_asm
)
5205 fputs (ASM_APP_OFF
, asm_out_file
);
5207 if (targetm
.file_start_file_directive
)
5208 output_file_directive (asm_out_file
, main_input_filename
);
5211 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5212 which emits a special section directive used to indicate whether or
5213 not this object file needs an executable stack. This is primarily
5214 a GNU extension to ELF but could be used on other targets. */
5216 int trampolines_created
;
5219 file_end_indicate_exec_stack (void)
5221 unsigned int flags
= SECTION_DEBUG
;
5222 if (trampolines_created
)
5223 flags
|= SECTION_CODE
;
5225 named_section_flags (".note.GNU-stack", flags
);
5228 #include "gt-varasm.h"