1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 /* This file handles generation of all the assembler code
25 *except* the instructions of a function.
26 This includes declarations of variables and their initial values.
28 We also output the assembler code for constants stored in memory
29 and are responsible for combining constants with the same value. */
33 #include "coretypes.h"
40 #include "hard-reg-set.h"
48 #include "langhooks.h"
52 #include "tree-mudflap.h"
54 #include "cfglayout.h"
56 #ifdef XCOFF_DEBUGGING_INFO
57 #include "xcoffout.h" /* Needed for external data
58 declarations for e.g. AIX 4.x. */
61 /* The (assembler) name of the first globally-visible object output. */
62 const char *first_global_object_name
;
63 const char *weak_global_object_name
;
66 struct constant_descriptor_rtx
;
67 struct rtx_constant_pool
;
69 struct varasm_status
GTY(())
71 /* If we're using a per-function constant pool, this is it. */
72 struct rtx_constant_pool
*pool
;
74 /* Number of tree-constants deferred during the expansion of this
76 unsigned int deferred_constants
;
79 #define n_deferred_constants (cfun->varasm->deferred_constants)
81 /* Number for making the label on the next
82 constant that is stored in memory. */
84 static GTY(()) int const_labelno
;
86 /* Carry information from ASM_DECLARE_OBJECT_NAME
87 to ASM_FINISH_DECLARE_OBJECT. */
89 int size_directive_output
;
91 /* The last decl for which assemble_variable was called,
92 if it did ASM_DECLARE_OBJECT_NAME.
93 If the last call to assemble_variable didn't do that,
96 tree last_assemble_variable_decl
;
98 /* The following global variable indicates if the section label for the
99 "cold" section of code has been output yet to the assembler. The
100 label is useful when running gdb. This is part of the optimization that
101 partitions hot and cold basic blocks into separate sections of the .o
104 static bool unlikely_section_label_printed
= false;
106 /* The following global variable indicates the label name to be put at
107 the start of the first cold section within each function, when
108 partitioning basic blocks into hot and cold sections. */
110 static char *unlikely_section_label
= NULL
;
112 /* The following global variable indicates the section name to be used
113 for the current cold section, when partitioning hot and cold basic
114 blocks into separate sections. */
116 static char *unlikely_text_section_name
= NULL
;
118 /* We give all constants their own alias set. Perhaps redundant with
119 MEM_READONLY_P, but pre-dates it. */
121 static HOST_WIDE_INT const_alias_set
;
123 static const char *strip_reg_name (const char *);
124 static int contains_pointers_p (tree
);
125 #ifdef ASM_OUTPUT_EXTERNAL
126 static bool incorporeal_function_p (tree
);
128 static void decode_addr_const (tree
, struct addr_const
*);
129 static hashval_t
const_desc_hash (const void *);
130 static int const_desc_eq (const void *, const void *);
131 static hashval_t
const_hash_1 (const tree
);
132 static int compare_constant (const tree
, const tree
);
133 static tree
copy_constant (tree
);
134 static void output_constant_def_contents (rtx
);
135 static void output_addressed_constants (tree
);
136 static unsigned HOST_WIDE_INT
array_size_for_constructor (tree
);
137 static unsigned min_align (unsigned, unsigned);
138 static void output_constructor (tree
, unsigned HOST_WIDE_INT
, unsigned int);
139 static void globalize_decl (tree
);
140 static void maybe_assemble_visibility (tree
);
141 static int in_named_entry_eq (const void *, const void *);
142 static hashval_t
in_named_entry_hash (const void *);
143 #ifdef BSS_SECTION_ASM_OP
144 #ifdef ASM_OUTPUT_BSS
145 static void asm_output_bss (FILE *, tree
, const char *,
146 unsigned HOST_WIDE_INT
, unsigned HOST_WIDE_INT
);
148 #ifdef ASM_OUTPUT_ALIGNED_BSS
149 static void asm_output_aligned_bss (FILE *, tree
, const char *,
150 unsigned HOST_WIDE_INT
, int)
153 #endif /* BSS_SECTION_ASM_OP */
154 static bool asm_emit_uninitialised (tree
, const char*,
155 unsigned HOST_WIDE_INT
,
156 unsigned HOST_WIDE_INT
);
157 static void mark_weak (tree
);
159 enum in_section
{ no_section
, in_text
, in_unlikely_executed_text
, in_data
,
161 #ifdef BSS_SECTION_ASM_OP
164 #ifdef CTORS_SECTION_ASM_OP
167 #ifdef DTORS_SECTION_ASM_OP
170 #ifdef READONLY_DATA_SECTION_ASM_OP
173 #ifdef EXTRA_SECTIONS
177 static GTY(()) enum in_section in_section
= no_section
;
179 /* Return a nonzero value if DECL has a section attribute. */
180 #ifndef IN_NAMED_SECTION
181 #define IN_NAMED_SECTION(DECL) \
182 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
183 && DECL_SECTION_NAME (DECL) != NULL_TREE)
186 /* Text of section name when in_section == in_named. */
187 static GTY(()) const char *in_named_name
;
189 /* Hash table of flags that have been used for a particular named section. */
191 struct in_named_entry
GTY(())
198 static GTY((param_is (struct in_named_entry
))) htab_t in_named_htab
;
200 /* Define functions like text_section for any extra sections. */
201 #ifdef EXTRA_SECTION_FUNCTIONS
202 EXTRA_SECTION_FUNCTIONS
205 /* Tell assembler to switch to text section. */
210 if (in_section
!= in_text
)
212 in_section
= in_text
;
213 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
217 /* Tell assembler to switch to unlikely-to-be-executed text section. */
220 unlikely_text_section (void)
225 if (! unlikely_text_section_name
)
227 if (DECL_SECTION_NAME (current_function_decl
)
228 && (strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME
229 (current_function_decl
)),
230 HOT_TEXT_SECTION_NAME
) != 0)
231 && (strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME
232 (current_function_decl
)),
233 UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) != 0))
235 name
= TREE_STRING_POINTER (DECL_SECTION_NAME
236 (current_function_decl
));
238 unlikely_text_section_name
= xmalloc ((len
+ 10) * sizeof (char));
239 strcpy (unlikely_text_section_name
, name
);
240 strcat (unlikely_text_section_name
, "_unlikely");
244 len
= strlen (UNLIKELY_EXECUTED_TEXT_SECTION_NAME
);
245 unlikely_text_section_name
= xmalloc (len
+1 * sizeof (char));
246 strcpy (unlikely_text_section_name
,
247 UNLIKELY_EXECUTED_TEXT_SECTION_NAME
);
251 if ((in_section
!= in_unlikely_executed_text
)
252 && (in_section
!= in_named
253 || strcmp (in_named_name
, unlikely_text_section_name
) != 0))
255 named_section (NULL_TREE
, unlikely_text_section_name
, 0);
256 in_section
= in_unlikely_executed_text
;
258 if (!unlikely_section_label_printed
)
260 ASM_OUTPUT_LABEL (asm_out_file
, unlikely_section_label
);
261 unlikely_section_label_printed
= true;
266 /* Tell assembler to switch to data section. */
271 if (in_section
!= in_data
)
273 in_section
= in_data
;
274 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
278 /* Tell assembler to switch to read-only data section. This is normally
282 readonly_data_section (void)
284 #ifdef READONLY_DATA_SECTION
285 READONLY_DATA_SECTION (); /* Note this can call data_section. */
287 #ifdef READONLY_DATA_SECTION_ASM_OP
288 if (in_section
!= in_readonly_data
)
290 in_section
= in_readonly_data
;
291 fputs (READONLY_DATA_SECTION_ASM_OP
, asm_out_file
);
292 fputc ('\n', asm_out_file
);
300 /* Determine if we're in the text section. */
303 in_text_section (void)
305 return in_section
== in_text
;
308 /* Determine if we're in the unlikely-to-be-executed text section. */
311 in_unlikely_text_section (void)
315 ret_val
= ((in_section
== in_unlikely_executed_text
)
316 || (in_section
== in_named
317 && unlikely_text_section_name
318 && strcmp (in_named_name
, unlikely_text_section_name
) == 0));
323 /* Determine if we're in the data section. */
326 in_data_section (void)
328 return in_section
== in_data
;
331 /* Helper routines for maintaining in_named_htab. */
334 in_named_entry_eq (const void *p1
, const void *p2
)
336 const struct in_named_entry
*old
= p1
;
337 const char *new = p2
;
339 return strcmp (old
->name
, new) == 0;
343 in_named_entry_hash (const void *p
)
345 const struct in_named_entry
*old
= p
;
346 return htab_hash_string (old
->name
);
349 /* If SECTION has been seen before as a named section, return the flags
350 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
351 set of flags for a section to have, so 0 does not mean that the section
352 has not been seen. */
355 get_named_section_flags (const char *section
)
357 struct in_named_entry
**slot
;
359 slot
= (struct in_named_entry
**)
360 htab_find_slot_with_hash (in_named_htab
, section
,
361 htab_hash_string (section
), NO_INSERT
);
363 return slot
? (*slot
)->flags
: 0;
366 /* Returns true if the section has been declared before. Sets internal
367 flag on this section in in_named_hash so subsequent calls on this
368 section will return false. */
371 named_section_first_declaration (const char *name
)
373 struct in_named_entry
**slot
;
375 slot
= (struct in_named_entry
**)
376 htab_find_slot_with_hash (in_named_htab
, name
,
377 htab_hash_string (name
), NO_INSERT
);
378 if (! (*slot
)->declared
)
380 (*slot
)->declared
= true;
390 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
391 different set of flags, return false. */
394 set_named_section_flags (const char *section
, unsigned int flags
)
396 struct in_named_entry
**slot
, *entry
;
398 slot
= (struct in_named_entry
**)
399 htab_find_slot_with_hash (in_named_htab
, section
,
400 htab_hash_string (section
), INSERT
);
405 entry
= ggc_alloc (sizeof (*entry
));
407 entry
->name
= ggc_strdup (section
);
408 entry
->flags
= flags
;
409 entry
->declared
= false;
411 else if (entry
->flags
!= flags
)
417 /* Tell assembler to change to section NAME with attributes FLAGS. If
418 DECL is non-NULL, it is the VAR_DECL or FUNCTION_DECL with which
419 this section is associated. */
422 named_section_real (const char *name
, unsigned int flags
, tree decl
)
424 if (in_section
!= in_named
|| strcmp (name
, in_named_name
) != 0)
426 if (! set_named_section_flags (name
, flags
))
429 targetm
.asm_out
.named_section (name
, flags
, decl
);
431 if (flags
& SECTION_FORGET
)
432 in_section
= no_section
;
435 in_named_name
= ggc_strdup (name
);
436 in_section
= in_named
;
441 /* Tell assembler to change to section NAME for DECL.
442 If DECL is NULL, just switch to section NAME.
443 If NAME is NULL, get the name from DECL.
444 If RELOC is 1, the initializer for DECL contains relocs. */
447 named_section (tree decl
, const char *name
, int reloc
)
451 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
454 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
456 if (strcmp (name
, UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) == 0
457 && !unlikely_text_section_name
)
459 unlikely_text_section_name
= xmalloc
460 (strlen (UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) + 1
462 strcpy (unlikely_text_section_name
,
463 UNLIKELY_EXECUTED_TEXT_SECTION_NAME
);
466 flags
= targetm
.section_type_flags (decl
, name
, reloc
);
468 /* Sanity check user variables for flag changes. Non-user
469 section flag changes will abort in named_section_flags.
470 However, don't complain if SECTION_OVERRIDE is set.
471 We trust that the setter knows that it is safe to ignore
472 the default flags for this decl. */
473 if (decl
&& ! set_named_section_flags (name
, flags
))
475 flags
= get_named_section_flags (name
);
476 if ((flags
& SECTION_OVERRIDE
) == 0)
477 error ("%J%D causes a section type conflict", decl
, decl
);
480 named_section_real (name
, flags
, decl
);
483 /* If required, set DECL_SECTION_NAME to a unique name. */
486 resolve_unique_section (tree decl
, int reloc ATTRIBUTE_UNUSED
,
487 int flag_function_or_data_sections
)
489 if (DECL_SECTION_NAME (decl
) == NULL_TREE
490 && targetm
.have_named_sections
491 && (flag_function_or_data_sections
492 || DECL_ONE_ONLY (decl
)))
493 targetm
.asm_out
.unique_section (decl
, reloc
);
496 #ifdef BSS_SECTION_ASM_OP
498 /* Tell the assembler to switch to the bss section. */
503 if (in_section
!= in_bss
)
505 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
510 #ifdef ASM_OUTPUT_BSS
512 /* Utility function for ASM_OUTPUT_BSS for targets to use if
513 they don't support alignments in .bss.
514 ??? It is believed that this function will work in most cases so such
515 support is localized here. */
518 asm_output_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
520 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
521 unsigned HOST_WIDE_INT rounded
)
523 targetm
.asm_out
.globalize_label (file
, name
);
525 #ifdef ASM_DECLARE_OBJECT_NAME
526 last_assemble_variable_decl
= decl
;
527 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
529 /* Standard thing is just output label for the object. */
530 ASM_OUTPUT_LABEL (file
, name
);
531 #endif /* ASM_DECLARE_OBJECT_NAME */
532 ASM_OUTPUT_SKIP (file
, rounded
? rounded
: 1);
537 #ifdef ASM_OUTPUT_ALIGNED_BSS
539 /* Utility function for targets to use in implementing
540 ASM_OUTPUT_ALIGNED_BSS.
541 ??? It is believed that this function will work in most cases so such
542 support is localized here. */
545 asm_output_aligned_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
546 const char *name
, unsigned HOST_WIDE_INT size
,
550 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
551 #ifdef ASM_DECLARE_OBJECT_NAME
552 last_assemble_variable_decl
= decl
;
553 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
555 /* Standard thing is just output label for the object. */
556 ASM_OUTPUT_LABEL (file
, name
);
557 #endif /* ASM_DECLARE_OBJECT_NAME */
558 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
563 #endif /* BSS_SECTION_ASM_OP */
565 /* Switch to the section for function DECL.
567 If DECL is NULL_TREE, switch to the text section. We can be passed
568 NULL_TREE under some circumstances by dbxout.c at least. */
571 function_section (tree decl
)
573 if (decl
== NULL_TREE
)
577 /* ??? Typical use of this function maybe shouldn't be looking
578 for unlikely blocks at all - in the event that an entire
579 function is going into the unlikely-execute section, that
580 should be reflected in its DECL_SECTION_NAME. */
581 rtx insns
= cfun
&& cfun
->emit
? get_insns () : 0;
582 bool unlikely
= insns
&& scan_ahead_for_unlikely_executed_note (insns
);
584 #ifdef USE_SELECT_SECTION_FOR_FUNCTIONS
585 targetm
.asm_out
.select_section (decl
, unlikely
, DECL_ALIGN (decl
));
588 unlikely_text_section ();
589 else if (DECL_SECTION_NAME (decl
))
590 named_section (decl
, 0, 0);
597 /* Switch to read-only data section associated with function DECL. */
600 default_function_rodata_section (tree decl
)
602 if (decl
!= NULL_TREE
&& DECL_SECTION_NAME (decl
))
604 const char *name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
606 /* For .gnu.linkonce.t.foo we want to use .gnu.linkonce.r.foo. */
607 if (DECL_ONE_ONLY (decl
) && strncmp (name
, ".gnu.linkonce.t.", 16) == 0)
609 size_t len
= strlen (name
) + 1;
610 char *rname
= alloca (len
);
612 memcpy (rname
, name
, len
);
614 named_section_real (rname
, SECTION_LINKONCE
, decl
);
617 /* For .text.foo we want to use .rodata.foo. */
618 else if (flag_function_sections
&& flag_data_sections
619 && strncmp (name
, ".text.", 6) == 0)
621 size_t len
= strlen (name
) + 1;
622 char *rname
= alloca (len
+ 2);
624 memcpy (rname
, ".rodata", 7);
625 memcpy (rname
+ 7, name
+ 5, len
- 5);
626 named_section_flags (rname
, 0);
631 readonly_data_section ();
634 /* Switch to read-only data section associated with function DECL
635 for targets where that section should be always the single
636 readonly data section. */
639 default_no_function_rodata_section (tree decl ATTRIBUTE_UNUSED
)
641 readonly_data_section ();
644 /* Switch to section for variable DECL. RELOC is the same as the
645 argument to SELECT_SECTION. */
648 variable_section (tree decl
, int reloc
)
650 if (IN_NAMED_SECTION (decl
))
651 named_section (decl
, NULL
, reloc
);
653 targetm
.asm_out
.select_section (decl
, reloc
, DECL_ALIGN (decl
));
656 /* Tell assembler to switch to the section for string merging. */
659 mergeable_string_section (tree decl ATTRIBUTE_UNUSED
,
660 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
661 unsigned int flags ATTRIBUTE_UNUSED
)
663 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
664 && TREE_CODE (decl
) == STRING_CST
665 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
667 && TREE_STRING_LENGTH (decl
) >= int_size_in_bytes (TREE_TYPE (decl
)))
669 enum machine_mode mode
;
670 unsigned int modesize
;
675 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (decl
)));
676 modesize
= GET_MODE_BITSIZE (mode
);
677 if (modesize
>= 8 && modesize
<= 256
678 && (modesize
& (modesize
- 1)) == 0)
680 if (align
< modesize
)
683 str
= TREE_STRING_POINTER (decl
);
684 len
= TREE_STRING_LENGTH (decl
);
685 unit
= GET_MODE_SIZE (mode
);
687 /* Check for embedded NUL characters. */
688 for (i
= 0; i
< len
; i
+= unit
)
690 for (j
= 0; j
< unit
; j
++)
691 if (str
[i
+ j
] != '\0')
698 sprintf (name
, ".rodata.str%d.%d", modesize
/ 8,
700 flags
|= (modesize
/ 8) | SECTION_MERGE
| SECTION_STRINGS
;
701 if (!i
&& modesize
< align
)
703 /* A "" string with requested alignment greater than
704 character size might cause a problem:
705 if some other string required even bigger
706 alignment than "", then linker might think the
707 "" is just part of padding after some other string
708 and not put it into the hash table initially.
709 But this means "" could have smaller alignment
711 #ifdef ASM_OUTPUT_SECTION_START
712 named_section_flags (name
, flags
);
713 ASM_OUTPUT_SECTION_START (asm_out_file
);
715 readonly_data_section ();
720 named_section_flags (name
, flags
);
726 readonly_data_section ();
729 /* Tell assembler to switch to the section for constant merging. */
732 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
733 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
734 unsigned int flags ATTRIBUTE_UNUSED
)
736 unsigned int modesize
= GET_MODE_BITSIZE (mode
);
738 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
744 && (align
& (align
- 1)) == 0)
748 sprintf (name
, ".rodata.cst%d", (int) (align
/ 8));
749 flags
|= (align
/ 8) | SECTION_MERGE
;
750 named_section_flags (name
, flags
);
754 readonly_data_section ();
757 /* Given NAME, a putative register name, discard any customary prefixes. */
760 strip_reg_name (const char *name
)
762 #ifdef REGISTER_PREFIX
763 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
764 name
+= strlen (REGISTER_PREFIX
);
766 if (name
[0] == '%' || name
[0] == '#')
771 /* The user has asked for a DECL to have a particular name. Set (or
772 change) it in such a way that we don't prefix an underscore to
775 set_user_assembler_name (tree decl
, const char *name
)
777 char *starred
= alloca (strlen (name
) + 2);
779 strcpy (starred
+ 1, name
);
780 change_decl_assembler_name (decl
, get_identifier (starred
));
781 SET_DECL_RTL (decl
, NULL_RTX
);
784 /* Decode an `asm' spec for a declaration as a register name.
785 Return the register number, or -1 if nothing specified,
786 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
787 or -3 if ASMSPEC is `cc' and is not recognized,
788 or -4 if ASMSPEC is `memory' and is not recognized.
789 Accept an exact spelling or a decimal number.
790 Prefixes such as % are optional. */
793 decode_reg_name (const char *asmspec
)
799 /* Get rid of confusing prefixes. */
800 asmspec
= strip_reg_name (asmspec
);
802 /* Allow a decimal number as a "register name". */
803 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
804 if (! ISDIGIT (asmspec
[i
]))
806 if (asmspec
[0] != 0 && i
< 0)
809 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
815 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
817 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
820 #ifdef ADDITIONAL_REGISTER_NAMES
822 static const struct { const char *const name
; const int number
; } table
[]
823 = ADDITIONAL_REGISTER_NAMES
;
825 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
826 if (! strcmp (asmspec
, table
[i
].name
))
827 return table
[i
].number
;
829 #endif /* ADDITIONAL_REGISTER_NAMES */
831 if (!strcmp (asmspec
, "memory"))
834 if (!strcmp (asmspec
, "cc"))
843 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
844 have static storage duration. In other words, it should not be an
845 automatic variable, including PARM_DECLs.
847 There is, however, one exception: this function handles variables
848 explicitly placed in a particular register by the user.
850 This is never called for PARM_DECL nodes. */
853 make_decl_rtl (tree decl
)
855 const char *name
= 0;
859 /* Check that we are not being given an automatic variable. */
860 /* A weak alias has TREE_PUBLIC set but not the other bits. */
861 if (TREE_CODE (decl
) == PARM_DECL
862 || TREE_CODE (decl
) == RESULT_DECL
863 || (TREE_CODE (decl
) == VAR_DECL
864 && !TREE_STATIC (decl
)
865 && !TREE_PUBLIC (decl
)
866 && !DECL_EXTERNAL (decl
)
867 && !DECL_REGISTER (decl
)))
869 /* And that we were not given a type or a label. */
870 else if (TREE_CODE (decl
) == TYPE_DECL
871 || TREE_CODE (decl
) == LABEL_DECL
)
874 /* For a duplicate declaration, we can be called twice on the
875 same DECL node. Don't discard the RTL already made. */
876 if (DECL_RTL_SET_P (decl
))
878 /* If the old RTL had the wrong mode, fix the mode. */
879 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
880 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
881 DECL_MODE (decl
), 0));
883 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
886 /* ??? Another way to do this would be to maintain a hashed
887 table of such critters. Instead of adding stuff to a DECL
888 to give certain attributes to it, we could use an external
889 hash map from DECL to set of attributes. */
891 /* Let the target reassign the RTL if it wants.
892 This is necessary, for example, when one machine specific
893 decl attribute overrides another. */
894 targetm
.encode_section_info (decl
, DECL_RTL (decl
), false);
896 /* Make this function static known to the mudflap runtime. */
897 if (flag_mudflap
&& TREE_CODE (decl
) == VAR_DECL
)
898 mudflap_enqueue_decl (decl
);
903 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
906 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
908 reg_number
= decode_reg_name (name
);
909 /* First detect errors in declaring global registers. */
910 if (reg_number
== -1)
911 error ("%Jregister name not specified for %qD", decl
, decl
);
912 else if (reg_number
< 0)
913 error ("%Jinvalid register name for %qD", decl
, decl
);
914 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
915 error ("%Jdata type of %qD isn%'t suitable for a register",
917 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
918 error ("%Jregister specified for %qD isn%'t suitable for data type",
920 /* Now handle properly declared static register variables. */
925 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
927 DECL_INITIAL (decl
) = 0;
928 error ("global register variable has initial value");
930 if (TREE_THIS_VOLATILE (decl
))
931 warning ("volatile register variables don%'t "
932 "work as you might wish");
934 /* If the user specified one of the eliminables registers here,
935 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
936 confused with that register and be eliminated. This usage is
937 somewhat suspect... */
939 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
940 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
941 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
943 if (TREE_STATIC (decl
))
945 /* Make this register global, so not usable for anything
947 #ifdef ASM_DECLARE_REGISTER_GLOBAL
948 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
950 nregs
= hard_regno_nregs
[reg_number
][DECL_MODE (decl
)];
952 globalize_reg (reg_number
+ --nregs
);
955 /* As a register variable, it has no section. */
959 /* Now handle ordinary static variables and functions (in memory).
960 Also handle vars declared register invalidly. */
961 else if (name
[0] == '*')
963 #ifdef REGISTER_PREFIX
964 if (strlen (REGISTER_PREFIX
) != 0)
966 reg_number
= decode_reg_name (name
);
967 if (reg_number
>= 0 || reg_number
== -3)
968 error ("%Jregister name given for non-register variable %qD", decl
, decl
);
973 /* Specifying a section attribute on a variable forces it into a
974 non-.bss section, and thus it cannot be common. */
975 if (TREE_CODE (decl
) == VAR_DECL
976 && DECL_SECTION_NAME (decl
) != NULL_TREE
977 && DECL_INITIAL (decl
) == NULL_TREE
978 && DECL_COMMON (decl
))
979 DECL_COMMON (decl
) = 0;
981 /* Variables can't be both common and weak. */
982 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
983 DECL_COMMON (decl
) = 0;
985 x
= gen_rtx_SYMBOL_REF (Pmode
, name
);
986 SYMBOL_REF_WEAK (x
) = DECL_WEAK (decl
);
987 SYMBOL_REF_DECL (x
) = decl
;
989 x
= gen_rtx_MEM (DECL_MODE (decl
), x
);
990 if (TREE_CODE (decl
) != FUNCTION_DECL
)
991 set_mem_attributes (x
, decl
, 1);
992 SET_DECL_RTL (decl
, x
);
994 /* Optionally set flags or add text to the name to record information
995 such as that it is a function name.
996 If the name is changed, the macro ASM_OUTPUT_LABELREF
997 will have to know how to strip this information. */
998 targetm
.encode_section_info (decl
, DECL_RTL (decl
), true);
1000 /* Make this function static known to the mudflap runtime. */
1001 if (flag_mudflap
&& TREE_CODE (decl
) == VAR_DECL
)
1002 mudflap_enqueue_decl (decl
);
1005 /* Make the rtl for variable VAR be volatile.
1006 Use this only for static variables. */
1009 make_var_volatile (tree var
)
1011 if (!MEM_P (DECL_RTL (var
)))
1014 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
1017 /* Output a string of literal assembler code
1018 for an `asm' keyword used between functions. */
1021 assemble_asm (tree string
)
1025 if (TREE_CODE (string
) == ADDR_EXPR
)
1026 string
= TREE_OPERAND (string
, 0);
1028 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
1031 /* Record an element in the table of global destructors. SYMBOL is
1032 a SYMBOL_REF of the function to be called; PRIORITY is a number
1033 between 0 and MAX_INIT_PRIORITY. */
1036 default_stabs_asm_out_destructor (rtx symbol ATTRIBUTE_UNUSED
,
1037 int priority ATTRIBUTE_UNUSED
)
1039 #if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO
1040 /* Tell GNU LD that this is part of the static destructor set.
1041 This will work for any system that uses stabs, most usefully
1043 dbxout_begin_simple_stabs ("___DTOR_LIST__", 22 /* N_SETT */);
1044 dbxout_stab_value_label (XSTR (symbol
, 0));
1046 sorry ("global destructors not supported on this target");
1051 default_named_section_asm_out_destructor (rtx symbol
, int priority
)
1053 const char *section
= ".dtors";
1056 /* ??? This only works reliably with the GNU linker. */
1057 if (priority
!= DEFAULT_INIT_PRIORITY
)
1059 sprintf (buf
, ".dtors.%.5u",
1060 /* Invert the numbering so the linker puts us in the proper
1061 order; constructors are run from right to left, and the
1062 linker sorts in increasing order. */
1063 MAX_INIT_PRIORITY
- priority
);
1067 named_section_flags (section
, SECTION_WRITE
);
1068 assemble_align (POINTER_SIZE
);
1069 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1072 #ifdef DTORS_SECTION_ASM_OP
1074 dtors_section (void)
1076 if (in_section
!= in_dtors
)
1078 in_section
= in_dtors
;
1079 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
1080 fputc ('\n', asm_out_file
);
1085 default_dtor_section_asm_out_destructor (rtx symbol
,
1086 int priority ATTRIBUTE_UNUSED
)
1089 assemble_align (POINTER_SIZE
);
1090 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1094 /* Likewise for global constructors. */
1097 default_stabs_asm_out_constructor (rtx symbol ATTRIBUTE_UNUSED
,
1098 int priority ATTRIBUTE_UNUSED
)
1100 #if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO
1101 /* Tell GNU LD that this is part of the static destructor set.
1102 This will work for any system that uses stabs, most usefully
1104 dbxout_begin_simple_stabs ("___CTOR_LIST__", 22 /* N_SETT */);
1105 dbxout_stab_value_label (XSTR (symbol
, 0));
1107 sorry ("global constructors not supported on this target");
1112 default_named_section_asm_out_constructor (rtx symbol
, int priority
)
1114 const char *section
= ".ctors";
1117 /* ??? This only works reliably with the GNU linker. */
1118 if (priority
!= DEFAULT_INIT_PRIORITY
)
1120 sprintf (buf
, ".ctors.%.5u",
1121 /* Invert the numbering so the linker puts us in the proper
1122 order; constructors are run from right to left, and the
1123 linker sorts in increasing order. */
1124 MAX_INIT_PRIORITY
- priority
);
1128 named_section_flags (section
, SECTION_WRITE
);
1129 assemble_align (POINTER_SIZE
);
1130 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1133 #ifdef CTORS_SECTION_ASM_OP
1135 ctors_section (void)
1137 if (in_section
!= in_ctors
)
1139 in_section
= in_ctors
;
1140 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1141 fputc ('\n', asm_out_file
);
1146 default_ctor_section_asm_out_constructor (rtx symbol
,
1147 int priority ATTRIBUTE_UNUSED
)
1150 assemble_align (POINTER_SIZE
);
1151 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1155 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1156 a nonzero value if the constant pool should be output before the
1157 start of the function, or a zero value if the pool should output
1158 after the end of the function. The default is to put it before the
1161 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1162 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1165 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
1166 to be output to assembler.
1167 Set first_global_object_name and weak_global_object_name as appropriate. */
1170 notice_global_symbol (tree decl
)
1172 const char **type
= &first_global_object_name
;
1174 if (first_global_object_name
1175 || !TREE_PUBLIC (decl
) || DECL_EXTERNAL (decl
)
1176 || !DECL_NAME (decl
)
1177 || (TREE_CODE (decl
) != FUNCTION_DECL
1178 && (TREE_CODE (decl
) != VAR_DECL
1179 || (DECL_COMMON (decl
)
1180 && (DECL_INITIAL (decl
) == 0
1181 || DECL_INITIAL (decl
) == error_mark_node
))))
1182 || !MEM_P (DECL_RTL (decl
)))
1185 /* We win when global object is found, but it is useful to know about weak
1186 symbol as well so we can produce nicer unique names. */
1187 if (DECL_WEAK (decl
) || DECL_ONE_ONLY (decl
))
1188 type
= &weak_global_object_name
;
1194 rtx decl_rtl
= DECL_RTL (decl
);
1196 p
= targetm
.strip_name_encoding (XSTR (XEXP (decl_rtl
, 0), 0));
1203 /* Output assembler code for the constant pool of a function and associated
1204 with defining the name of the function. DECL describes the function.
1205 NAME is the function's name. For the constant pool, we use the current
1206 constant pool data. */
1209 assemble_start_function (tree decl
, const char *fnname
)
1213 if (unlikely_text_section_name
)
1214 free (unlikely_text_section_name
);
1216 unlikely_section_label_printed
= false;
1217 unlikely_text_section_name
= NULL
;
1219 unlikely_section_label
= reconcat (unlikely_section_label
,
1220 fnname
, ".unlikely_section", NULL
);
1222 /* The following code does not need preprocessing in the assembler. */
1226 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1227 output_constant_pool (fnname
, decl
);
1229 /* Make sure the cold text (code) section is properly aligned. This
1230 is necessary here in the case where the function has both hot and
1231 cold sections, because we don't want to re-set the alignment when the
1232 section switch happens mid-function. We don't need to set the hot
1233 section alignment here, because code further down in this function
1234 sets the alignment for whichever section comes first, and if there
1235 is a hot section it is guaranteed to be first. */
1237 if (flag_reorder_blocks_and_partition
)
1239 unlikely_text_section ();
1240 assemble_align (FUNCTION_BOUNDARY
);
1243 resolve_unique_section (decl
, 0, flag_function_sections
);
1244 function_section (decl
);
1246 /* Tell assembler to move to target machine's alignment for functions. */
1247 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1248 if (align
< force_align_functions_log
)
1249 align
= force_align_functions_log
;
1252 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1255 /* Handle a user-specified function alignment.
1256 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1257 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1258 if (align_functions_log
> align
1259 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1261 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1262 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1263 align_functions_log
, align_functions
- 1);
1265 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1269 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1270 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1273 (*debug_hooks
->begin_function
) (decl
);
1275 /* Make function name accessible from other files, if appropriate. */
1277 if (TREE_PUBLIC (decl
))
1279 notice_global_symbol (decl
);
1281 globalize_decl (decl
);
1283 maybe_assemble_visibility (decl
);
1286 if (DECL_PRESERVE_P (decl
))
1287 targetm
.asm_out
.mark_decl_preserved (fnname
);
1289 /* Do any machine/system dependent processing of the function name. */
1290 #ifdef ASM_DECLARE_FUNCTION_NAME
1291 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1293 /* Standard thing is just output label for the function. */
1294 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1295 #endif /* ASM_DECLARE_FUNCTION_NAME */
1297 if (in_unlikely_text_section ()
1298 && !unlikely_section_label_printed
)
1300 ASM_OUTPUT_LABEL (asm_out_file
, unlikely_section_label
);
1301 unlikely_section_label_printed
= true;
1305 /* Output assembler code associated with defining the size of the
1306 function. DECL describes the function. NAME is the function's name. */
1309 assemble_end_function (tree decl
, const char *fnname
)
1311 #ifdef ASM_DECLARE_FUNCTION_SIZE
1312 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1314 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1316 output_constant_pool (fnname
, decl
);
1317 function_section (decl
); /* need to switch back */
1321 /* Assemble code to leave SIZE bytes of zeros. */
1324 assemble_zeros (unsigned HOST_WIDE_INT size
)
1326 /* Do no output if -fsyntax-only. */
1327 if (flag_syntax_only
)
1330 #ifdef ASM_NO_SKIP_IN_TEXT
1331 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1332 so we must output 0s explicitly in the text section. */
1333 if ((ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1334 || (ASM_NO_SKIP_IN_TEXT
&& in_unlikely_text_section ()))
1336 unsigned HOST_WIDE_INT i
;
1337 for (i
= 0; i
< size
; i
++)
1338 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1343 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1346 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1349 assemble_align (int align
)
1351 if (align
> BITS_PER_UNIT
)
1353 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1357 /* Assemble a string constant with the specified C string as contents. */
1360 assemble_string (const char *p
, int size
)
1365 /* If the string is very long, split it up. */
1369 int thissize
= size
- pos
;
1370 if (thissize
> maximum
)
1373 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1381 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1382 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1383 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1385 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1386 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1387 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1389 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1390 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1394 #if defined ASM_OUTPUT_ALIGNED_BSS
1395 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1396 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1398 #if defined ASM_OUTPUT_BSS
1399 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1400 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1406 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1407 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1408 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1410 #if defined ASM_OUTPUT_ALIGNED_COMMON
1411 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1412 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1414 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1415 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1420 asm_emit_uninitialised (tree decl
, const char *name
,
1421 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
1422 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
)
1430 destination
= asm_dest_local
;
1432 /* ??? We should handle .bss via select_section mechanisms rather than
1433 via special target hooks. That would eliminate this special case. */
1434 if (TREE_PUBLIC (decl
))
1436 if (!DECL_COMMON (decl
))
1438 destination
= asm_dest_bss
;
1443 destination
= asm_dest_common
;
1446 if (destination
!= asm_dest_common
)
1448 resolve_unique_section (decl
, 0, flag_data_sections
);
1449 /* Custom sections don't belong here. */
1450 if (DECL_SECTION_NAME (decl
))
1454 if (destination
== asm_dest_bss
)
1455 globalize_decl (decl
);
1457 if (flag_shared_data
)
1459 switch (destination
)
1461 #ifdef ASM_OUTPUT_SHARED_BSS
1463 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1466 #ifdef ASM_OUTPUT_SHARED_COMMON
1467 case asm_dest_common
:
1468 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1471 #ifdef ASM_OUTPUT_SHARED_LOCAL
1472 case asm_dest_local
:
1473 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1481 switch (destination
)
1485 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1488 case asm_dest_common
:
1489 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1491 case asm_dest_local
:
1492 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1501 /* Assemble everything that is needed for a variable or function declaration.
1502 Not used for automatic variables, and not used for function definitions.
1503 Should not be called for variables of incomplete structure type.
1505 TOP_LEVEL is nonzero if this variable has file scope.
1506 AT_END is nonzero if this is the special handling, at end of compilation,
1507 to define things that have had only tentative definitions.
1508 DONT_OUTPUT_DATA if nonzero means don't actually output the
1509 initial value (that will be done by the caller). */
1512 assemble_variable (tree decl
, int top_level ATTRIBUTE_UNUSED
,
1513 int at_end ATTRIBUTE_UNUSED
, int dont_output_data
)
1520 if (lang_hooks
.decls
.prepare_assemble_variable
)
1521 lang_hooks
.decls
.prepare_assemble_variable (decl
);
1523 last_assemble_variable_decl
= 0;
1525 /* Normally no need to say anything here for external references,
1526 since assemble_external is called by the language-specific code
1527 when a declaration is first seen. */
1529 if (DECL_EXTERNAL (decl
))
1532 /* Output no assembler code for a function declaration.
1533 Only definitions of functions output anything. */
1535 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1538 /* Do nothing for global register variables. */
1539 if (DECL_RTL_SET_P (decl
) && REG_P (DECL_RTL (decl
)))
1541 TREE_ASM_WRITTEN (decl
) = 1;
1545 /* If type was incomplete when the variable was declared,
1546 see if it is complete now. */
1548 if (DECL_SIZE (decl
) == 0)
1549 layout_decl (decl
, 0);
1551 /* Still incomplete => don't allocate it; treat the tentative defn
1552 (which is what it must have been) as an `extern' reference. */
1554 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1556 error ("%Jstorage size of %qD isn%'t known", decl
, decl
);
1557 TREE_ASM_WRITTEN (decl
) = 1;
1561 /* The first declaration of a variable that comes through this function
1562 decides whether it is global (in C, has external linkage)
1563 or local (in C, has internal linkage). So do nothing more
1564 if this function has already run. */
1566 if (TREE_ASM_WRITTEN (decl
))
1569 /* Make sure targetm.encode_section_info is invoked before we set
1571 decl_rtl
= DECL_RTL (decl
);
1573 TREE_ASM_WRITTEN (decl
) = 1;
1575 /* Do no output if -fsyntax-only. */
1576 if (flag_syntax_only
)
1581 if (! dont_output_data
1582 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1584 error ("%Jsize of variable %qD is too large", decl
, decl
);
1588 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1589 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1590 notice_global_symbol (decl
);
1592 /* Compute the alignment of this data. */
1594 align
= DECL_ALIGN (decl
);
1596 /* In the case for initialing an array whose length isn't specified,
1597 where we have not yet been able to do the layout,
1598 figure out the proper alignment now. */
1599 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1600 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1601 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1603 /* Some object file formats have a maximum alignment which they support.
1604 In particular, a.out format supports a maximum alignment of 4. */
1605 if (align
> MAX_OFILE_ALIGNMENT
)
1607 warning ("%Jalignment of %qD is greater than maximum object "
1608 "file alignment. Using %d", decl
, decl
,
1609 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1610 align
= MAX_OFILE_ALIGNMENT
;
1613 /* On some machines, it is good to increase alignment sometimes. */
1614 if (! DECL_USER_ALIGN (decl
))
1616 #ifdef DATA_ALIGNMENT
1617 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1619 #ifdef CONSTANT_ALIGNMENT
1620 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1621 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1625 /* Reset the alignment in case we have made it tighter, so we can benefit
1626 from it in get_pointer_alignment. */
1627 DECL_ALIGN (decl
) = align
;
1628 set_mem_align (decl_rtl
, align
);
1630 if (TREE_PUBLIC (decl
))
1631 maybe_assemble_visibility (decl
);
1633 if (DECL_PRESERVE_P (decl
))
1634 targetm
.asm_out
.mark_decl_preserved (name
);
1636 /* Handle uninitialized definitions. */
1638 /* If the decl has been given an explicit section name, then it
1639 isn't common, and shouldn't be handled as such. */
1640 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1642 /* We don't implement common thread-local data at present. */
1643 else if (DECL_THREAD_LOCAL (decl
))
1645 if (DECL_COMMON (decl
))
1646 sorry ("thread-local COMMON data not implemented");
1648 else if (DECL_INITIAL (decl
) == 0
1649 || DECL_INITIAL (decl
) == error_mark_node
1650 || (flag_zero_initialized_in_bss
1651 /* Leave constant zeroes in .rodata so they can be shared. */
1652 && !TREE_READONLY (decl
)
1653 && initializer_zerop (DECL_INITIAL (decl
))))
1655 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1656 unsigned HOST_WIDE_INT rounded
= size
;
1658 /* Don't allocate zero bytes of common,
1659 since that means "undefined external" in the linker. */
1663 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1664 so that each uninitialized object starts on such a boundary. */
1665 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1666 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1667 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1669 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1670 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN_UNIT (decl
) > rounded
)
1671 warning ("%Jrequested alignment for %qD is greater than "
1672 "implemented alignment of %d", decl
, decl
, rounded
);
1675 /* If the target cannot output uninitialized but not common global data
1676 in .bss, then we have to use .data, so fall through. */
1677 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1681 /* Handle initialized definitions.
1682 Also handle uninitialized global definitions if -fno-common and the
1683 target doesn't support ASM_OUTPUT_BSS. */
1685 /* First make the assembler name(s) global if appropriate. */
1686 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1687 globalize_decl (decl
);
1689 /* Output any data that we will need to use the address of. */
1690 if (DECL_INITIAL (decl
) == error_mark_node
)
1691 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1692 else if (DECL_INITIAL (decl
))
1694 reloc
= compute_reloc_for_constant (DECL_INITIAL (decl
));
1695 output_addressed_constants (DECL_INITIAL (decl
));
1698 /* Switch to the appropriate section. */
1699 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1700 variable_section (decl
, reloc
);
1702 /* dbxout.c needs to know this. */
1703 if (in_text_section () || in_unlikely_text_section ())
1704 DECL_IN_TEXT_SECTION (decl
) = 1;
1706 /* Output the alignment of this data. */
1707 if (align
> BITS_PER_UNIT
)
1708 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (DECL_ALIGN_UNIT (decl
)));
1710 /* Do any machine/system dependent processing of the object. */
1711 #ifdef ASM_DECLARE_OBJECT_NAME
1712 last_assemble_variable_decl
= decl
;
1713 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1715 /* Standard thing is just output label for the object. */
1716 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1717 #endif /* ASM_DECLARE_OBJECT_NAME */
1719 if (!dont_output_data
)
1721 if (DECL_INITIAL (decl
)
1722 && DECL_INITIAL (decl
) != error_mark_node
1723 && !initializer_zerop (DECL_INITIAL (decl
)))
1724 /* Output the actual data. */
1725 output_constant (DECL_INITIAL (decl
),
1726 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1729 /* Leave space for it. */
1730 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1734 /* Return 1 if type TYPE contains any pointers. */
1737 contains_pointers_p (tree type
)
1739 switch (TREE_CODE (type
))
1742 case REFERENCE_TYPE
:
1743 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1744 so I'll play safe and return 1. */
1750 case QUAL_UNION_TYPE
:
1753 /* For a type that has fields, see if the fields have pointers. */
1754 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1755 if (TREE_CODE (fields
) == FIELD_DECL
1756 && contains_pointers_p (TREE_TYPE (fields
)))
1762 /* An array type contains pointers if its element type does. */
1763 return contains_pointers_p (TREE_TYPE (type
));
1770 /* In unit-at-a-time mode, we delay assemble_external processing until
1771 the compilation unit is finalized. This is the best we can do for
1772 right now (i.e. stage 3 of GCC 4.0) - the right thing is to delay
1773 it all the way to final. See PR 17982 for further discussion. */
1774 static GTY(()) tree pending_assemble_externals
;
1776 #ifdef ASM_OUTPUT_EXTERNAL
1777 /* True if DECL is a function decl for which no out-of-line copy exists.
1778 It is assumed that DECL's assembler name has been set. */
1781 incorporeal_function_p (tree decl
)
1783 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_BUILT_IN (decl
))
1787 if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1788 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_ALLOCA
)
1791 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
1792 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
1798 /* Actually do the tests to determine if this is necessary, and invoke
1799 ASM_OUTPUT_EXTERNAL. */
1801 assemble_external_real (tree decl
)
1803 rtx rtl
= DECL_RTL (decl
);
1805 if (MEM_P (rtl
) && GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1806 && !SYMBOL_REF_USED (XEXP (rtl
, 0))
1807 && !incorporeal_function_p (decl
))
1809 /* Some systems do require some output. */
1810 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1811 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1817 process_pending_assemble_externals (void)
1819 #ifdef ASM_OUTPUT_EXTERNAL
1821 for (list
= pending_assemble_externals
; list
; list
= TREE_CHAIN (list
))
1822 assemble_external_real (TREE_VALUE (list
));
1824 pending_assemble_externals
= 0;
1828 /* Output something to declare an external symbol to the assembler.
1829 (Most assemblers don't need this, so we normally output nothing.)
1830 Do nothing if DECL is not external. */
1833 assemble_external (tree decl ATTRIBUTE_UNUSED
)
1835 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1836 main body of this code is only rarely exercised. To provide some
1837 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1838 open. If it's not, we should not be calling this function. */
1839 gcc_assert (asm_out_file
);
1841 #ifdef ASM_OUTPUT_EXTERNAL
1842 if (!DECL_P (decl
) || !DECL_EXTERNAL (decl
) || !TREE_PUBLIC (decl
))
1845 if (flag_unit_at_a_time
)
1846 pending_assemble_externals
= tree_cons (0, decl
,
1847 pending_assemble_externals
);
1849 assemble_external_real (decl
);
1853 /* Similar, for calling a library function FUN. */
1856 assemble_external_libcall (rtx fun
)
1858 /* Declare library function name external when first used, if nec. */
1859 if (! SYMBOL_REF_USED (fun
))
1861 SYMBOL_REF_USED (fun
) = 1;
1862 targetm
.asm_out
.external_libcall (fun
);
1866 /* Assemble a label named NAME. */
1869 assemble_label (const char *name
)
1871 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1874 /* Set the symbol_referenced flag for ID. */
1876 mark_referenced (tree id
)
1878 TREE_SYMBOL_REFERENCED (id
) = 1;
1881 /* Set the symbol_referenced flag for DECL and notify callgraph. */
1883 mark_decl_referenced (tree decl
)
1885 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1886 cgraph_mark_needed_node (cgraph_node (decl
));
1887 else if (TREE_CODE (decl
) == VAR_DECL
)
1888 cgraph_varpool_mark_needed_node (cgraph_varpool_node (decl
));
1889 /* else do nothing - we can get various sorts of CST nodes here,
1890 which do not need to be marked. */
1893 /* Output to FILE (an assembly file) a reference to NAME. If NAME
1894 starts with a *, the rest of NAME is output verbatim. Otherwise
1895 NAME is transformed in a target-specific way (usually by the
1896 addition of an underscore). */
1899 assemble_name_raw (FILE *file
, const char *name
)
1902 fputs (&name
[1], file
);
1904 ASM_OUTPUT_LABELREF (file
, name
);
1907 /* Like assemble_name_raw, but should be used when NAME might refer to
1908 an entity that is also represented as a tree (like a function or
1909 variable). If NAME does refer to such an entity, that entity will
1910 be marked as referenced. */
1913 assemble_name (FILE *file
, const char *name
)
1915 const char *real_name
;
1918 real_name
= targetm
.strip_name_encoding (name
);
1920 id
= maybe_get_identifier (real_name
);
1922 mark_referenced (id
);
1924 assemble_name_raw (file
, name
);
1927 /* Allocate SIZE bytes writable static space with a gensym name
1928 and return an RTX to refer to its address. */
1931 assemble_static_space (unsigned HOST_WIDE_INT size
)
1934 const char *namestring
;
1938 if (flag_shared_data
)
1942 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1944 namestring
= ggc_strdup (name
);
1946 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1947 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
1949 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1950 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1953 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1954 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1957 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1958 so that each uninitialized object starts on such a boundary. */
1959 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1960 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1961 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1962 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1963 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1964 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1971 /* Assemble the static constant template for function entry trampolines.
1972 This is done at most once per compilation.
1973 Returns an RTX for the address of the template. */
1975 static GTY(()) rtx initial_trampoline
;
1977 #ifdef TRAMPOLINE_TEMPLATE
1979 assemble_trampoline_template (void)
1986 if (initial_trampoline
)
1987 return initial_trampoline
;
1989 /* By default, put trampoline templates in read-only data section. */
1991 #ifdef TRAMPOLINE_SECTION
1992 TRAMPOLINE_SECTION ();
1994 readonly_data_section ();
1997 /* Write the assembler code to define one. */
1998 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
2001 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
2004 targetm
.asm_out
.internal_label (asm_out_file
, "LTRAMP", 0);
2005 TRAMPOLINE_TEMPLATE (asm_out_file
);
2007 /* Record the rtl to refer to it. */
2008 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
2009 name
= ggc_strdup (label
);
2010 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
2011 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2013 initial_trampoline
= gen_rtx_MEM (BLKmode
, symbol
);
2014 set_mem_align (initial_trampoline
, TRAMPOLINE_ALIGNMENT
);
2016 return initial_trampoline
;
2020 /* A and B are either alignments or offsets. Return the minimum alignment
2021 that may be assumed after adding the two together. */
2023 static inline unsigned
2024 min_align (unsigned int a
, unsigned int b
)
2026 return (a
| b
) & -(a
| b
);
2029 /* Return the assembler directive for creating a given kind of integer
2030 object. SIZE is the number of bytes in the object and ALIGNED_P
2031 indicates whether it is known to be aligned. Return NULL if the
2032 assembly dialect has no such directive.
2034 The returned string should be printed at the start of a new line and
2035 be followed immediately by the object's initial value. */
2038 integer_asm_op (int size
, int aligned_p
)
2040 struct asm_int_op
*ops
;
2043 ops
= &targetm
.asm_out
.aligned_op
;
2045 ops
= &targetm
.asm_out
.unaligned_op
;
2050 return targetm
.asm_out
.byte_op
;
2064 /* Use directive OP to assemble an integer object X. Print OP at the
2065 start of the line, followed immediately by the value of X. */
2068 assemble_integer_with_op (const char *op
, rtx x
)
2070 fputs (op
, asm_out_file
);
2071 output_addr_const (asm_out_file
, x
);
2072 fputc ('\n', asm_out_file
);
2075 /* The default implementation of the asm_out.integer target hook. */
2078 default_assemble_integer (rtx x ATTRIBUTE_UNUSED
,
2079 unsigned int size ATTRIBUTE_UNUSED
,
2080 int aligned_p ATTRIBUTE_UNUSED
)
2082 const char *op
= integer_asm_op (size
, aligned_p
);
2083 /* Avoid GAS bugs for large values. Specifically negative values whose
2084 absolute value fits in a bfd_vma, but not in a bfd_signed_vma. */
2085 if (size
> UNITS_PER_WORD
&& size
> POINTER_SIZE
/ BITS_PER_UNIT
)
2087 return op
&& (assemble_integer_with_op (op
, x
), true);
2090 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
2091 the alignment of the integer in bits. Return 1 if we were able to output
2092 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
2096 assemble_integer (rtx x
, unsigned int size
, unsigned int align
, int force
)
2100 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
2102 /* See if the target hook can handle this kind of object. */
2103 if (targetm
.asm_out
.integer (x
, size
, aligned_p
))
2106 /* If the object is a multi-byte one, try splitting it up. Split
2107 it into words it if is multi-word, otherwise split it into bytes. */
2110 enum machine_mode omode
, imode
;
2111 unsigned int subalign
;
2112 unsigned int subsize
, i
;
2114 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
2115 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
2116 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
2117 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
2119 for (i
= 0; i
< size
; i
+= subsize
)
2121 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
2122 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
2128 /* If we've printed some of it, but not all of it, there's no going
2141 assemble_real (REAL_VALUE_TYPE d
, enum machine_mode mode
, unsigned int align
)
2145 int bitsize
, nelts
, nunits
, units_per
;
2147 /* This is hairy. We have a quantity of known size. real_to_target
2148 will put it into an array of *host* longs, 32 bits per element
2149 (even if long is more than 32 bits). We need to determine the
2150 number of array elements that are occupied (nelts) and the number
2151 of *target* min-addressable units that will be occupied in the
2152 object file (nunits). We cannot assume that 32 divides the
2153 mode's bitsize (size * BITS_PER_UNIT) evenly.
2155 size * BITS_PER_UNIT is used here to make sure that padding bits
2156 (which might appear at either end of the value; real_to_target
2157 will include the padding bits in its output array) are included. */
2159 nunits
= GET_MODE_SIZE (mode
);
2160 bitsize
= nunits
* BITS_PER_UNIT
;
2161 nelts
= CEIL (bitsize
, 32);
2162 units_per
= 32 / BITS_PER_UNIT
;
2164 real_to_target (data
, &d
, mode
);
2166 /* Put out the first word with the specified alignment. */
2167 assemble_integer (GEN_INT (data
[0]), MIN (nunits
, units_per
), align
, 1);
2168 nunits
-= units_per
;
2170 /* Subsequent words need only 32-bit alignment. */
2171 align
= min_align (align
, 32);
2173 for (i
= 1; i
< nelts
; i
++)
2175 assemble_integer (GEN_INT (data
[i
]), MIN (nunits
, units_per
), align
, 1);
2176 nunits
-= units_per
;
2180 /* Given an expression EXP with a constant value,
2181 reduce it to the sum of an assembler symbol and an integer.
2182 Store them both in the structure *VALUE.
2183 Abort if EXP does not reduce. */
2185 struct addr_const
GTY(())
2188 HOST_WIDE_INT offset
;
2192 decode_addr_const (tree exp
, struct addr_const
*value
)
2194 tree target
= TREE_OPERAND (exp
, 0);
2200 if (TREE_CODE (target
) == COMPONENT_REF
2201 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2204 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2205 target
= TREE_OPERAND (target
, 0);
2207 else if (TREE_CODE (target
) == ARRAY_REF
2208 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2210 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2211 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2212 target
= TREE_OPERAND (target
, 0);
2218 switch (TREE_CODE (target
))
2222 x
= DECL_RTL (target
);
2226 x
= gen_rtx_MEM (FUNCTION_MODE
,
2227 gen_rtx_LABEL_REF (VOIDmode
, force_label_rtx (target
)));
2235 x
= output_constant_def (target
, 1);
2247 value
->offset
= offset
;
2250 /* Uniquize all constants that appear in memory.
2251 Each constant in memory thus far output is recorded
2252 in `const_desc_table'. */
2254 struct constant_descriptor_tree
GTY(())
2256 /* A MEM for the constant. */
2259 /* The value of the constant. */
2263 static GTY((param_is (struct constant_descriptor_tree
)))
2264 htab_t const_desc_htab
;
2266 static struct constant_descriptor_tree
* build_constant_desc (tree
);
2267 static void maybe_output_constant_def_contents (struct constant_descriptor_tree
*, int);
2269 /* Compute a hash code for a constant expression. */
2272 const_desc_hash (const void *ptr
)
2274 return const_hash_1 (((struct constant_descriptor_tree
*)ptr
)->value
);
2278 const_hash_1 (const tree exp
)
2283 enum tree_code code
= TREE_CODE (exp
);
2285 /* Either set P and LEN to the address and len of something to hash and
2286 exit the switch or return a value. */
2291 p
= (char *) &TREE_INT_CST (exp
);
2292 len
= sizeof TREE_INT_CST (exp
);
2296 return real_hash (TREE_REAL_CST_PTR (exp
));
2299 p
= TREE_STRING_POINTER (exp
);
2300 len
= TREE_STRING_LENGTH (exp
);
2304 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2305 + const_hash_1 (TREE_IMAGPART (exp
)));
2311 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2313 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2314 if (TREE_VALUE (link
))
2315 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2323 struct addr_const value
;
2325 decode_addr_const (exp
, &value
);
2326 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2328 /* Don't hash the address of the SYMBOL_REF;
2329 only use the offset and the symbol name. */
2331 p
= XSTR (value
.base
, 0);
2332 for (i
= 0; p
[i
] != 0; i
++)
2333 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2335 else if (GET_CODE (value
.base
) == LABEL_REF
)
2336 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2344 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2345 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2349 case NON_LVALUE_EXPR
:
2350 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2353 /* A language specific constant. Just hash the code. */
2357 /* Compute hashing function. */
2359 for (i
= 0; i
< len
; i
++)
2360 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2365 /* Wrapper of compare_constant, for the htab interface. */
2367 const_desc_eq (const void *p1
, const void *p2
)
2369 return compare_constant (((struct constant_descriptor_tree
*)p1
)->value
,
2370 ((struct constant_descriptor_tree
*)p2
)->value
);
2373 /* Compare t1 and t2, and return 1 only if they are known to result in
2374 the same bit pattern on output. */
2377 compare_constant (const tree t1
, const tree t2
)
2379 enum tree_code typecode
;
2381 if (t1
== NULL_TREE
)
2382 return t2
== NULL_TREE
;
2383 if (t2
== NULL_TREE
)
2386 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2389 switch (TREE_CODE (t1
))
2392 /* Integer constants are the same only if the same width of type. */
2393 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2395 return tree_int_cst_equal (t1
, t2
);
2398 /* Real constants are the same only if the same width of type. */
2399 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2402 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2405 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2408 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2409 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2410 TREE_STRING_LENGTH (t1
)));
2413 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2414 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2420 typecode
= TREE_CODE (TREE_TYPE (t1
));
2421 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2424 if (typecode
== ARRAY_TYPE
)
2426 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2427 /* For arrays, check that the sizes all match. */
2428 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2430 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2435 /* For record and union constructors, require exact type
2437 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2441 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2443 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2445 /* Check that each value is the same... */
2446 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2448 /* ... and that they apply to the same fields! */
2449 if (typecode
== ARRAY_TYPE
)
2451 if (! compare_constant (TREE_PURPOSE (l1
),
2457 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2462 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2468 struct addr_const value1
, value2
;
2470 decode_addr_const (t1
, &value1
);
2471 decode_addr_const (t2
, &value2
);
2472 return (value1
.offset
== value2
.offset
2473 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2479 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2480 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2484 case NON_LVALUE_EXPR
:
2485 case VIEW_CONVERT_EXPR
:
2486 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2491 nt1
= lang_hooks
.expand_constant (t1
);
2492 nt2
= lang_hooks
.expand_constant (t2
);
2493 if (nt1
!= t1
|| nt2
!= t2
)
2494 return compare_constant (nt1
, nt2
);
2500 /* Should not get here. */
2504 /* Make a copy of the whole tree structure for a constant. This
2505 handles the same types of nodes that compare_constant handles. */
2508 copy_constant (tree exp
)
2510 switch (TREE_CODE (exp
))
2513 /* For ADDR_EXPR, we do not want to copy the decl whose address
2514 is requested. We do want to copy constants though. */
2515 if (CONSTANT_CLASS_P (TREE_OPERAND (exp
, 0)))
2516 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2517 copy_constant (TREE_OPERAND (exp
, 0)));
2519 return copy_node (exp
);
2524 return copy_node (exp
);
2527 return build_complex (TREE_TYPE (exp
),
2528 copy_constant (TREE_REALPART (exp
)),
2529 copy_constant (TREE_IMAGPART (exp
)));
2533 return build2 (TREE_CODE (exp
), TREE_TYPE (exp
),
2534 copy_constant (TREE_OPERAND (exp
, 0)),
2535 copy_constant (TREE_OPERAND (exp
, 1)));
2539 case NON_LVALUE_EXPR
:
2540 case VIEW_CONVERT_EXPR
:
2541 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2542 copy_constant (TREE_OPERAND (exp
, 0)));
2546 tree copy
= copy_node (exp
);
2547 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2550 CONSTRUCTOR_ELTS (copy
) = list
;
2551 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2552 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2560 t
= lang_hooks
.expand_constant (exp
);
2562 return copy_constant (t
);
2569 /* Subroutine of output_constant_def:
2570 No constant equal to EXP is known to have been output.
2571 Make a constant descriptor to enter EXP in the hash table.
2572 Assign the label number and construct RTL to refer to the
2573 constant's location in memory.
2574 Caller is responsible for updating the hash table. */
2576 static struct constant_descriptor_tree
*
2577 build_constant_desc (tree exp
)
2583 struct constant_descriptor_tree
*desc
;
2585 desc
= ggc_alloc (sizeof (*desc
));
2586 desc
->value
= copy_constant (exp
);
2588 /* Propagate marked-ness to copied constant. */
2589 if (flag_mudflap
&& mf_marked_p (exp
))
2590 mf_mark (desc
->value
);
2592 /* Create a string containing the label name, in LABEL. */
2593 labelno
= const_labelno
++;
2594 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2596 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2597 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2598 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2599 SYMBOL_REF_DECL (symbol
) = desc
->value
;
2600 TREE_CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2602 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2603 set_mem_attributes (rtl
, exp
, 1);
2604 set_mem_alias_set (rtl
, 0);
2605 set_mem_alias_set (rtl
, const_alias_set
);
2607 /* Set flags or add text to the name to record information, such as
2608 that it is a local symbol. If the name is changed, the macro
2609 ASM_OUTPUT_LABELREF will have to know how to strip this
2610 information. This call might invalidate our local variable
2611 SYMBOL; we can't use it afterward. */
2613 targetm
.encode_section_info (exp
, rtl
, true);
2620 /* Return an rtx representing a reference to constant data in memory
2621 for the constant expression EXP.
2623 If assembler code for such a constant has already been output,
2624 return an rtx to refer to it.
2625 Otherwise, output such a constant in memory
2626 and generate an rtx for it.
2628 If DEFER is nonzero, this constant can be deferred and output only
2629 if referenced in the function after all optimizations.
2631 `const_desc_table' records which constants already have label strings. */
2634 output_constant_def (tree exp
, int defer
)
2636 struct constant_descriptor_tree
*desc
;
2637 struct constant_descriptor_tree key
;
2640 /* Look up EXP in the table of constant descriptors. If we didn't find
2641 it, create a new one. */
2643 loc
= htab_find_slot (const_desc_htab
, &key
, INSERT
);
2648 desc
= build_constant_desc (exp
);
2652 maybe_output_constant_def_contents (desc
, defer
);
2656 /* Subroutine of output_constant_def: Decide whether or not we need to
2657 output the constant DESC now, and if so, do it. */
2659 maybe_output_constant_def_contents (struct constant_descriptor_tree
*desc
,
2662 rtx symbol
= XEXP (desc
->rtl
, 0);
2663 tree exp
= desc
->value
;
2665 if (flag_syntax_only
)
2668 if (TREE_ASM_WRITTEN (exp
))
2669 /* Already output; don't do it again. */
2672 /* We can always defer constants as long as the context allows
2676 /* Increment n_deferred_constants if it exists. It needs to be at
2677 least as large as the number of constants actually referred to
2678 by the function. If it's too small we'll stop looking too early
2679 and fail to emit constants; if it's too large we'll only look
2680 through the entire function when we could have stopped earlier. */
2682 n_deferred_constants
++;
2686 output_constant_def_contents (symbol
);
2689 /* We must output the constant data referred to by SYMBOL; do so. */
2692 output_constant_def_contents (rtx symbol
)
2694 tree exp
= SYMBOL_REF_DECL (symbol
);
2695 const char *label
= XSTR (symbol
, 0);
2698 /* Make sure any other constants whose addresses appear in EXP
2699 are assigned label numbers. */
2700 int reloc
= compute_reloc_for_constant (exp
);
2702 /* Align the location counter as required by EXP's data type. */
2703 unsigned int align
= TYPE_ALIGN (TREE_TYPE (exp
));
2704 #ifdef CONSTANT_ALIGNMENT
2705 align
= CONSTANT_ALIGNMENT (exp
, align
);
2708 output_addressed_constants (exp
);
2710 /* We are no longer deferring this constant. */
2711 TREE_ASM_WRITTEN (exp
) = 1;
2713 if (IN_NAMED_SECTION (exp
))
2714 named_section (exp
, NULL
, reloc
);
2716 targetm
.asm_out
.select_section (exp
, reloc
, align
);
2718 if (align
> BITS_PER_UNIT
)
2720 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2723 size
= int_size_in_bytes (TREE_TYPE (exp
));
2724 if (TREE_CODE (exp
) == STRING_CST
)
2725 size
= MAX (TREE_STRING_LENGTH (exp
), size
);
2727 /* Do any machine/system dependent processing of the constant. */
2728 #ifdef ASM_DECLARE_CONSTANT_NAME
2729 ASM_DECLARE_CONSTANT_NAME (asm_out_file
, label
, exp
, size
);
2731 /* Standard thing is just output label for the constant. */
2732 ASM_OUTPUT_LABEL (asm_out_file
, label
);
2733 #endif /* ASM_DECLARE_CONSTANT_NAME */
2735 /* Output the value of EXP. */
2736 output_constant (exp
, size
, align
);
2738 mudflap_enqueue_constant (exp
);
2741 /* Look up EXP in the table of constant descriptors. Return the rtl
2742 if it has been emitted, else null. */
2745 lookup_constant_def (tree exp
)
2747 struct constant_descriptor_tree
*desc
;
2748 struct constant_descriptor_tree key
;
2751 desc
= htab_find (const_desc_htab
, &key
);
2753 return (desc
? desc
->rtl
: NULL_RTX
);
2756 /* Used in the hash tables to avoid outputting the same constant
2757 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2758 are output once per function, not once per file. */
2759 /* ??? Only a few targets need per-function constant pools. Most
2760 can use one per-file pool. Should add a targetm bit to tell the
2763 struct rtx_constant_pool
GTY(())
2765 /* Pointers to first and last constant in pool, as ordered by offset. */
2766 struct constant_descriptor_rtx
*first
;
2767 struct constant_descriptor_rtx
*last
;
2769 /* Hash facility for making memory-constants from constant rtl-expressions.
2770 It is used on RISC machines where immediate integer arguments and
2771 constant addresses are restricted so that such constants must be stored
2773 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_htab
;
2774 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_sym_htab
;
2776 /* Current offset in constant pool (does not include any
2777 machine-specific header). */
2778 HOST_WIDE_INT offset
;
2781 struct constant_descriptor_rtx
GTY((chain_next ("%h.next")))
2783 struct constant_descriptor_rtx
*next
;
2787 HOST_WIDE_INT offset
;
2789 enum machine_mode mode
;
2795 /* Hash and compare functions for const_rtx_htab. */
2798 const_desc_rtx_hash (const void *ptr
)
2800 const struct constant_descriptor_rtx
*desc
= ptr
;
2805 const_desc_rtx_eq (const void *a
, const void *b
)
2807 const struct constant_descriptor_rtx
*x
= a
;
2808 const struct constant_descriptor_rtx
*y
= b
;
2810 if (x
->mode
!= y
->mode
)
2812 return rtx_equal_p (x
->constant
, y
->constant
);
2815 /* Hash and compare functions for const_rtx_sym_htab. */
2818 const_desc_rtx_sym_hash (const void *ptr
)
2820 const struct constant_descriptor_rtx
*desc
= ptr
;
2821 return htab_hash_string (XSTR (desc
->sym
, 0));
2825 const_desc_rtx_sym_eq (const void *a
, const void *b
)
2827 const struct constant_descriptor_rtx
*x
= a
;
2828 const struct constant_descriptor_rtx
*y
= b
;
2829 return XSTR (x
->sym
, 0) == XSTR (y
->sym
, 0);
2832 /* This is the worker function for const_rtx_hash, called via for_each_rtx. */
2835 const_rtx_hash_1 (rtx
*xp
, void *data
)
2837 unsigned HOST_WIDE_INT hwi
;
2838 enum machine_mode mode
;
2844 code
= GET_CODE (x
);
2845 mode
= GET_MODE (x
);
2846 h
= (hashval_t
) code
* 1048573 + mode
;
2854 const int shift
= sizeof (hashval_t
) * CHAR_BIT
;
2855 const int n
= sizeof (HOST_WIDE_INT
) / sizeof (hashval_t
);
2858 h
^= (hashval_t
) hwi
;
2859 for (i
= 1; i
< n
; ++i
)
2862 h
^= (hashval_t
) hwi
;
2868 if (mode
== VOIDmode
)
2870 hwi
= CONST_DOUBLE_LOW (x
) ^ CONST_DOUBLE_HIGH (x
);
2874 h
^= real_hash (CONST_DOUBLE_REAL_VALUE (x
));
2880 for (i
= XVECLEN (x
, 0); i
-- > 0; )
2881 h
= h
* 251 + const_rtx_hash_1 (&XVECEXP (x
, 0, i
), data
);
2886 h
^= htab_hash_string (XSTR (x
, 0));
2890 h
= h
* 251 + CODE_LABEL_NUMBER (XEXP (x
, 0));
2894 case UNSPEC_VOLATILE
:
2895 h
= h
* 251 + XINT (x
, 1);
2903 *hp
= *hp
* 509 + h
;
2907 /* Compute a hash value for X, which should be a constant. */
2910 const_rtx_hash (rtx x
)
2913 for_each_rtx (&x
, const_rtx_hash_1
, &h
);
2918 /* Initialize constant pool hashing for a new function. */
2921 init_varasm_status (struct function
*f
)
2923 struct varasm_status
*p
;
2924 struct rtx_constant_pool
*pool
;
2926 p
= ggc_alloc (sizeof (struct varasm_status
));
2929 pool
= ggc_alloc (sizeof (struct rtx_constant_pool
));
2931 p
->deferred_constants
= 0;
2933 pool
->const_rtx_htab
= htab_create_ggc (31, const_desc_rtx_hash
,
2934 const_desc_rtx_eq
, NULL
);
2935 pool
->const_rtx_sym_htab
= htab_create_ggc (31, const_desc_rtx_sym_hash
,
2936 const_desc_rtx_sym_eq
, NULL
);
2937 pool
->first
= pool
->last
= NULL
;
2941 /* Given a MINUS expression, simplify it if both sides
2942 include the same symbol. */
2945 simplify_subtraction (rtx x
)
2947 rtx r
= simplify_rtx (x
);
2951 /* Given a constant rtx X, make (or find) a memory constant for its value
2952 and return a MEM rtx to refer to it in memory. */
2955 force_const_mem (enum machine_mode mode
, rtx x
)
2957 struct constant_descriptor_rtx
*desc
, tmp
;
2958 struct rtx_constant_pool
*pool
= cfun
->varasm
->pool
;
2965 /* If we're not allowed to drop X into the constant pool, don't. */
2966 if (targetm
.cannot_force_const_mem (x
))
2969 /* Lookup the value in the hashtable. */
2972 hash
= const_rtx_hash (x
);
2973 slot
= htab_find_slot_with_hash (pool
->const_rtx_htab
, &tmp
, hash
, INSERT
);
2976 /* If the constant was already present, return its memory. */
2978 return copy_rtx (desc
->mem
);
2980 /* Otherwise, create a new descriptor. */
2981 desc
= ggc_alloc (sizeof (*desc
));
2984 /* Align the location counter as required by EXP's data type. */
2985 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
2986 #ifdef CONSTANT_ALIGNMENT
2988 tree type
= lang_hooks
.types
.type_for_mode (mode
, 0);
2989 if (type
!= NULL_TREE
)
2990 align
= CONSTANT_ALIGNMENT (make_tree (type
, x
), align
);
2994 pool
->offset
+= (align
/ BITS_PER_UNIT
) - 1;
2995 pool
->offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
2998 desc
->constant
= tmp
.constant
;
2999 desc
->offset
= pool
->offset
;
3002 desc
->align
= align
;
3003 desc
->labelno
= const_labelno
;
3006 pool
->offset
+= GET_MODE_SIZE (mode
);
3008 pool
->last
->next
= desc
;
3010 pool
->first
= pool
->last
= desc
;
3013 /* Create a string containing the label name, in LABEL. */
3014 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3017 /* Construct the SYMBOL_REF. Make sure to mark it as belonging to
3018 the constants pool. */
3019 desc
->sym
= symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
3020 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
3021 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
3022 current_function_uses_const_pool
= 1;
3024 /* Insert the descriptor into the symbol cross-reference table too. */
3025 slot
= htab_find_slot (pool
->const_rtx_sym_htab
, desc
, INSERT
);
3030 /* Construct the MEM. */
3031 desc
->mem
= def
= gen_const_mem (mode
, symbol
);
3032 set_mem_attributes (def
, lang_hooks
.types
.type_for_mode (mode
, 0), 1);
3033 set_mem_align (def
, align
);
3035 /* If we're dropping a label to the constant pool, make sure we
3037 if (GET_CODE (x
) == LABEL_REF
)
3038 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
3040 return copy_rtx (def
);
3043 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3044 the corresponding constant_descriptor_rtx structure. */
3046 static struct constant_descriptor_rtx
*
3047 find_pool_constant (struct rtx_constant_pool
*pool
, rtx sym
)
3049 struct constant_descriptor_rtx tmp
;
3051 return htab_find (pool
->const_rtx_sym_htab
, &tmp
);
3054 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3057 get_pool_constant (rtx addr
)
3059 return find_pool_constant (cfun
->varasm
->pool
, addr
)->constant
;
3062 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3063 and whether it has been output or not. */
3066 get_pool_constant_mark (rtx addr
, bool *pmarked
)
3068 struct constant_descriptor_rtx
*desc
;
3070 desc
= find_pool_constant (cfun
->varasm
->pool
, addr
);
3071 *pmarked
= (desc
->mark
!= 0);
3072 return desc
->constant
;
3075 /* Likewise, but for the constant pool of a specific function. */
3078 get_pool_constant_for_function (struct function
*f
, rtx addr
)
3080 return find_pool_constant (f
->varasm
->pool
, addr
)->constant
;
3083 /* Similar, return the mode. */
3086 get_pool_mode (rtx addr
)
3088 return find_pool_constant (cfun
->varasm
->pool
, addr
)->mode
;
3091 /* Return the size of the constant pool. */
3094 get_pool_size (void)
3096 return cfun
->varasm
->pool
->offset
;
3099 /* Worker function for output_constant_pool_1. Emit assembly for X
3100 in MODE with known alignment ALIGN. */
3103 output_constant_pool_2 (enum machine_mode mode
, rtx x
, unsigned int align
)
3105 switch (GET_MODE_CLASS (mode
))
3108 if (GET_CODE (x
) != CONST_DOUBLE
)
3113 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3114 assemble_real (r
, mode
, align
);
3119 case MODE_PARTIAL_INT
:
3120 assemble_integer (x
, GET_MODE_SIZE (mode
), align
, 1);
3123 case MODE_VECTOR_FLOAT
:
3124 case MODE_VECTOR_INT
:
3127 enum machine_mode submode
= GET_MODE_INNER (mode
);
3128 unsigned int subalign
= MIN (align
, GET_MODE_BITSIZE (submode
));
3130 if (GET_CODE (x
) != CONST_VECTOR
)
3132 units
= CONST_VECTOR_NUNITS (x
);
3134 for (i
= 0; i
< units
; i
++)
3136 rtx elt
= CONST_VECTOR_ELT (x
, i
);
3137 output_constant_pool_2 (submode
, elt
, i
? subalign
: align
);
3147 /* Worker function for output_constant_pool. Emit POOL. */
3150 output_constant_pool_1 (struct constant_descriptor_rtx
*desc
)
3158 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3159 whose CODE_LABEL has been deleted. This can occur if a jump table
3160 is eliminated by optimization. If so, write a constant of zero
3161 instead. Note that this can also happen by turning the
3162 CODE_LABEL into a NOTE. */
3163 /* ??? This seems completely and utterly wrong. Certainly it's
3164 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3165 functioning even with INSN_DELETED_P and friends. */
3168 switch (GET_CODE (x
))
3171 if (GET_CODE (XEXP (x
, 0)) != PLUS
3172 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3174 tmp
= XEXP (XEXP (x
, 0), 0);
3179 if (INSN_DELETED_P (tmp
)
3181 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3192 /* First switch to correct section. */
3193 targetm
.asm_out
.select_rtx_section (desc
->mode
, x
, desc
->align
);
3195 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3196 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, desc
->mode
,
3197 desc
->align
, desc
->labelno
, done
);
3200 assemble_align (desc
->align
);
3202 /* Output the label. */
3203 targetm
.asm_out
.internal_label (asm_out_file
, "LC", desc
->labelno
);
3205 /* Output the data. */
3206 output_constant_pool_2 (desc
->mode
, x
, desc
->align
);
3208 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3209 sections have proper size. */
3210 if (desc
->align
> GET_MODE_BITSIZE (desc
->mode
)
3211 && in_section
== in_named
3212 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3213 assemble_align (desc
->align
);
3215 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3221 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3222 to as used. Emit referenced deferred strings. This function can
3223 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3226 mark_constant (rtx
*current_rtx
, void *data
)
3228 struct rtx_constant_pool
*pool
= data
;
3229 rtx x
= *current_rtx
;
3231 if (x
== NULL_RTX
|| GET_CODE (x
) != SYMBOL_REF
)
3234 if (CONSTANT_POOL_ADDRESS_P (x
))
3236 struct constant_descriptor_rtx
*desc
= find_pool_constant (pool
, x
);
3237 if (desc
->mark
== 0)
3240 for_each_rtx (&desc
->constant
, mark_constant
, pool
);
3243 else if (TREE_CONSTANT_POOL_ADDRESS_P (x
))
3245 tree exp
= SYMBOL_REF_DECL (x
);
3246 if (!TREE_ASM_WRITTEN (exp
))
3248 n_deferred_constants
--;
3249 output_constant_def_contents (x
);
3256 /* Look through appropriate parts of INSN, marking all entries in the
3257 constant pool which are actually being used. Entries that are only
3258 referenced by other constants are also marked as used. Emit
3259 deferred strings that are used. */
3262 mark_constants (struct rtx_constant_pool
*pool
, rtx insn
)
3267 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3268 insns, not any notes that may be attached. We don't want to mark
3269 a constant just because it happens to appear in a REG_EQUIV note. */
3270 if (GET_CODE (PATTERN (insn
)) == SEQUENCE
)
3272 rtx seq
= PATTERN (insn
);
3273 int i
, n
= XVECLEN (seq
, 0);
3274 for (i
= 0; i
< n
; ++i
)
3276 rtx subinsn
= XVECEXP (seq
, 0, i
);
3277 if (INSN_P (subinsn
))
3278 for_each_rtx (&PATTERN (subinsn
), mark_constant
, pool
);
3282 for_each_rtx (&PATTERN (insn
), mark_constant
, pool
);
3285 /* Look through the instructions for this function, and mark all the
3286 entries in POOL which are actually being used. Emit deferred constants
3287 which have indeed been used. */
3290 mark_constant_pool (struct rtx_constant_pool
*pool
)
3294 if (pool
->first
== 0 && n_deferred_constants
== 0)
3297 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3298 mark_constants (pool
, insn
);
3300 for (link
= current_function_epilogue_delay_list
;
3302 link
= XEXP (link
, 1))
3303 mark_constants (pool
, XEXP (link
, 0));
3306 /* Write all the constants in the constant pool. */
3309 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED
,
3310 tree fndecl ATTRIBUTE_UNUSED
)
3312 struct rtx_constant_pool
*pool
= cfun
->varasm
->pool
;
3313 struct constant_descriptor_rtx
*desc
;
3315 /* It is possible for gcc to call force_const_mem and then to later
3316 discard the instructions which refer to the constant. In such a
3317 case we do not need to output the constant. */
3318 mark_constant_pool (pool
);
3320 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3321 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3324 for (desc
= pool
->first
; desc
; desc
= desc
->next
)
3325 output_constant_pool_1 (desc
);
3327 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3328 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3332 /* Determine what kind of relocations EXP may need. */
3335 compute_reloc_for_constant (tree exp
)
3337 int reloc
= 0, reloc2
;
3340 /* Give the front-end a chance to convert VALUE to something that
3341 looks more like a constant to the back-end. */
3342 exp
= lang_hooks
.expand_constant (exp
);
3344 switch (TREE_CODE (exp
))
3348 /* Go inside any operations that get_inner_reference can handle and see
3349 if what's inside is a constant: no need to do anything here for
3350 addresses of variables or functions. */
3351 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3352 tem
= TREE_OPERAND (tem
, 0))
3355 if (TREE_PUBLIC (tem
))
3362 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3363 reloc
|= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3367 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3368 reloc2
= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3369 /* The difference of two local labels is computable at link time. */
3370 if (reloc
== 1 && reloc2
== 1)
3378 case NON_LVALUE_EXPR
:
3379 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3383 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3384 if (TREE_VALUE (tem
) != 0)
3385 reloc
|= compute_reloc_for_constant (TREE_VALUE (tem
));
3395 /* Find all the constants whose addresses are referenced inside of EXP,
3396 and make sure assembler code with a label has been output for each one.
3397 Indicate whether an ADDR_EXPR has been encountered. */
3400 output_addressed_constants (tree exp
)
3404 /* Give the front-end a chance to convert VALUE to something that
3405 looks more like a constant to the back-end. */
3406 exp
= lang_hooks
.expand_constant (exp
);
3408 switch (TREE_CODE (exp
))
3412 /* Go inside any operations that get_inner_reference can handle and see
3413 if what's inside is a constant: no need to do anything here for
3414 addresses of variables or functions. */
3415 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3416 tem
= TREE_OPERAND (tem
, 0))
3419 /* If we have an initialized CONST_DECL, retrieve the initializer. */
3420 if (TREE_CODE (tem
) == CONST_DECL
&& DECL_INITIAL (tem
))
3421 tem
= DECL_INITIAL (tem
);
3423 if (CONSTANT_CLASS_P (tem
) || TREE_CODE (tem
) == CONSTRUCTOR
)
3424 output_constant_def (tem
, 0);
3429 output_addressed_constants (TREE_OPERAND (exp
, 1));
3434 case NON_LVALUE_EXPR
:
3435 output_addressed_constants (TREE_OPERAND (exp
, 0));
3439 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3440 if (TREE_VALUE (tem
) != 0)
3441 output_addressed_constants (TREE_VALUE (tem
));
3450 /* Return nonzero if VALUE is a valid constant-valued expression
3451 for use in initializing a static variable; one that can be an
3452 element of a "constant" initializer.
3454 Return null_pointer_node if the value is absolute;
3455 if it is relocatable, return the variable that determines the relocation.
3456 We assume that VALUE has been folded as much as possible;
3457 therefore, we do not need to check for such things as
3458 arithmetic-combinations of integers. */
3461 initializer_constant_valid_p (tree value
, tree endtype
)
3463 /* Give the front-end a chance to convert VALUE to something that
3464 looks more like a constant to the back-end. */
3465 value
= lang_hooks
.expand_constant (value
);
3467 switch (TREE_CODE (value
))
3470 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3471 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3472 && TREE_CONSTANT (value
)
3473 && CONSTRUCTOR_ELTS (value
))
3476 bool absolute
= true;
3478 for (elt
= CONSTRUCTOR_ELTS (value
); elt
; elt
= TREE_CHAIN (elt
))
3481 value
= TREE_VALUE (elt
);
3482 reloc
= initializer_constant_valid_p (value
, TREE_TYPE (value
));
3485 if (reloc
!= null_pointer_node
)
3488 /* For a non-absolute relocation, there is no single
3489 variable that can be "the variable that determines the
3491 return absolute
? null_pointer_node
: error_mark_node
;
3494 return TREE_STATIC (value
) ? null_pointer_node
: NULL_TREE
;
3501 return null_pointer_node
;
3505 value
= staticp (TREE_OPERAND (value
, 0));
3506 /* "&(*a).f" is like unto pointer arithmetic. If "a" turns out to
3507 be a constant, this is old-skool offsetof-like nonsense. */
3509 && TREE_CODE (value
) == INDIRECT_REF
3510 && TREE_CONSTANT (TREE_OPERAND (value
, 0)))
3511 return null_pointer_node
;
3512 /* Taking the address of a nested function involves a trampoline. */
3514 && TREE_CODE (value
) == FUNCTION_DECL
3515 && ((decl_function_context (value
) && !DECL_NO_STATIC_CHAIN (value
))
3516 || DECL_NON_ADDR_CONST_P (value
)))
3520 case VIEW_CONVERT_EXPR
:
3521 case NON_LVALUE_EXPR
:
3522 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3531 src
= TREE_OPERAND (value
, 0);
3532 src_type
= TREE_TYPE (src
);
3533 dest_type
= TREE_TYPE (value
);
3535 /* Allow conversions between pointer types, floating-point
3536 types, and offset types. */
3537 if ((POINTER_TYPE_P (dest_type
) && POINTER_TYPE_P (src_type
))
3538 || (FLOAT_TYPE_P (dest_type
) && FLOAT_TYPE_P (src_type
))
3539 || (TREE_CODE (dest_type
) == OFFSET_TYPE
3540 && TREE_CODE (src_type
) == OFFSET_TYPE
))
3541 return initializer_constant_valid_p (src
, endtype
);
3543 /* Allow length-preserving conversions between integer types. */
3544 if (INTEGRAL_TYPE_P (dest_type
) && INTEGRAL_TYPE_P (src_type
)
3545 && (TYPE_PRECISION (dest_type
) == TYPE_PRECISION (src_type
)))
3546 return initializer_constant_valid_p (src
, endtype
);
3548 /* Allow conversions between other integer types only if
3550 if (INTEGRAL_TYPE_P (dest_type
) && INTEGRAL_TYPE_P (src_type
))
3552 tree inner
= initializer_constant_valid_p (src
, endtype
);
3553 if (inner
== null_pointer_node
)
3554 return null_pointer_node
;
3558 /* Allow (int) &foo provided int is as wide as a pointer. */
3559 if (INTEGRAL_TYPE_P (dest_type
) && POINTER_TYPE_P (src_type
)
3560 && (TYPE_PRECISION (dest_type
) >= TYPE_PRECISION (src_type
)))
3561 return initializer_constant_valid_p (src
, endtype
);
3563 /* Likewise conversions from int to pointers, but also allow
3564 conversions from 0. */
3565 if ((POINTER_TYPE_P (dest_type
)
3566 || TREE_CODE (dest_type
) == OFFSET_TYPE
)
3567 && INTEGRAL_TYPE_P (src_type
))
3569 if (integer_zerop (src
))
3570 return null_pointer_node
;
3571 else if (TYPE_PRECISION (dest_type
) <= TYPE_PRECISION (src_type
))
3572 return initializer_constant_valid_p (src
, endtype
);
3575 /* Allow conversions to struct or union types if the value
3577 if (TREE_CODE (dest_type
) == RECORD_TYPE
3578 || TREE_CODE (dest_type
) == UNION_TYPE
)
3579 return initializer_constant_valid_p (src
, endtype
);
3584 if (! INTEGRAL_TYPE_P (endtype
)
3585 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3587 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3589 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3591 /* If either term is absolute, use the other terms relocation. */
3592 if (valid0
== null_pointer_node
)
3594 if (valid1
== null_pointer_node
)
3600 if (! INTEGRAL_TYPE_P (endtype
)
3601 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3603 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3605 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3607 /* Win if second argument is absolute. */
3608 if (valid1
== null_pointer_node
)
3610 /* Win if both arguments have the same relocation.
3611 Then the value is absolute. */
3612 if (valid0
== valid1
&& valid0
!= 0)
3613 return null_pointer_node
;
3615 /* Since GCC guarantees that string constants are unique in the
3616 generated code, a subtraction between two copies of the same
3617 constant string is absolute. */
3618 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
3619 && valid1
&& TREE_CODE (valid1
) == STRING_CST
3620 && operand_equal_p (valid0
, valid1
, 1))
3621 return null_pointer_node
;
3624 /* Support narrowing differences. */
3625 if (INTEGRAL_TYPE_P (endtype
))
3629 op0
= TREE_OPERAND (value
, 0);
3630 op1
= TREE_OPERAND (value
, 1);
3632 /* Like STRIP_NOPS except allow the operand mode to widen.
3633 This works around a feature of fold that simplifies
3634 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3635 that the narrower operation is cheaper. */
3637 while (TREE_CODE (op0
) == NOP_EXPR
3638 || TREE_CODE (op0
) == CONVERT_EXPR
3639 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3641 tree inner
= TREE_OPERAND (op0
, 0);
3642 if (inner
== error_mark_node
3643 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3644 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3645 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3650 while (TREE_CODE (op1
) == NOP_EXPR
3651 || TREE_CODE (op1
) == CONVERT_EXPR
3652 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3654 tree inner
= TREE_OPERAND (op1
, 0);
3655 if (inner
== error_mark_node
3656 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3657 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3658 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3663 op0
= initializer_constant_valid_p (op0
, endtype
);
3664 op1
= initializer_constant_valid_p (op1
, endtype
);
3666 /* Both initializers must be known. */
3670 return null_pointer_node
;
3672 /* Support differences between labels. */
3673 if (TREE_CODE (op0
) == LABEL_DECL
3674 && TREE_CODE (op1
) == LABEL_DECL
)
3675 return null_pointer_node
;
3677 if (TREE_CODE (op0
) == STRING_CST
3678 && TREE_CODE (op1
) == STRING_CST
3679 && operand_equal_p (op0
, op1
, 1))
3680 return null_pointer_node
;
3692 /* Output assembler code for constant EXP to FILE, with no label.
3693 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3694 Assumes output_addressed_constants has been done on EXP already.
3696 Generate exactly SIZE bytes of assembler data, padding at the end
3697 with zeros if necessary. SIZE must always be specified.
3699 SIZE is important for structure constructors,
3700 since trailing members may have been omitted from the constructor.
3701 It is also important for initialization of arrays from string constants
3702 since the full length of the string constant might not be wanted.
3703 It is also needed for initialization of unions, where the initializer's
3704 type is just one member, and that may not be as long as the union.
3706 There a case in which we would fail to output exactly SIZE bytes:
3707 for a structure constructor that wants to produce more than SIZE bytes.
3708 But such constructors will never be generated for any possible input.
3710 ALIGN is the alignment of the data in bits. */
3713 output_constant (tree exp
, unsigned HOST_WIDE_INT size
, unsigned int align
)
3715 enum tree_code code
;
3716 unsigned HOST_WIDE_INT thissize
;
3718 /* Some front-ends use constants other than the standard language-independent
3719 varieties, but which may still be output directly. Give the front-end a
3720 chance to convert EXP to a language-independent representation. */
3721 exp
= lang_hooks
.expand_constant (exp
);
3723 if (size
== 0 || flag_syntax_only
)
3726 /* Eliminate any conversions since we'll be outputting the underlying
3728 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3729 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3730 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3731 exp
= TREE_OPERAND (exp
, 0);
3733 code
= TREE_CODE (TREE_TYPE (exp
));
3734 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3736 /* Allow a constructor with no elements for any data type.
3737 This means to fill the space with zeros. */
3738 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3740 assemble_zeros (size
);
3744 if (TREE_CODE (exp
) == FDESC_EXPR
)
3746 #ifdef ASM_OUTPUT_FDESC
3747 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3748 tree decl
= TREE_OPERAND (exp
, 0);
3749 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3756 /* Now output the underlying data. If we've handling the padding, return.
3757 Otherwise, break and ensure SIZE is the size written. */
3765 case REFERENCE_TYPE
:
3767 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3768 EXPAND_INITIALIZER
),
3769 MIN (size
, thissize
), align
, 0))
3770 error ("initializer for integer value is too complicated");
3774 if (TREE_CODE (exp
) != REAL_CST
)
3775 error ("initializer for floating value is not a floating constant");
3777 assemble_real (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)), align
);
3781 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3782 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3783 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
3788 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3790 output_constructor (exp
, size
, align
);
3793 else if (TREE_CODE (exp
) == STRING_CST
)
3795 thissize
= MIN ((unsigned HOST_WIDE_INT
)TREE_STRING_LENGTH (exp
),
3797 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
3799 else if (TREE_CODE (exp
) == VECTOR_CST
)
3803 unsigned int nalign
;
3804 enum machine_mode inner
;
3806 inner
= TYPE_MODE (TREE_TYPE (TREE_TYPE (exp
)));
3807 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
3809 elt_size
= GET_MODE_SIZE (inner
);
3811 link
= TREE_VECTOR_CST_ELTS (exp
);
3812 output_constant (TREE_VALUE (link
), elt_size
, align
);
3813 while ((link
= TREE_CHAIN (link
)) != NULL
)
3814 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
3822 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3823 output_constructor (exp
, size
, align
);
3835 if (size
> thissize
)
3836 assemble_zeros (size
- thissize
);
3840 /* Subroutine of output_constructor, used for computing the size of
3841 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3842 type with an unspecified upper bound. */
3844 static unsigned HOST_WIDE_INT
3845 array_size_for_constructor (tree val
)
3849 /* This code used to attempt to handle string constants that are not
3850 arrays of single-bytes, but nothing else does, so there's no point in
3852 if (TREE_CODE (val
) == STRING_CST
)
3853 return TREE_STRING_LENGTH (val
);
3855 max_index
= NULL_TREE
;
3856 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
3858 tree index
= TREE_PURPOSE (i
);
3860 if (TREE_CODE (index
) == RANGE_EXPR
)
3861 index
= TREE_OPERAND (index
, 1);
3862 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
3866 if (max_index
== NULL_TREE
)
3869 /* Compute the total number of array elements. */
3870 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
3872 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
3873 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
3875 /* Multiply by the array element unit size to find number of bytes. */
3876 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
3878 return tree_low_cst (i
, 1);
3881 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3882 Generate at least SIZE bytes, padding if necessary. */
3885 output_constructor (tree exp
, unsigned HOST_WIDE_INT size
,
3888 tree type
= TREE_TYPE (exp
);
3889 tree link
, field
= 0;
3891 /* Number of bytes output or skipped so far.
3892 In other words, current position within the constructor. */
3893 HOST_WIDE_INT total_bytes
= 0;
3894 /* Nonzero means BYTE contains part of a byte, to be output. */
3895 int byte_buffer_in_use
= 0;
3898 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3901 if (TREE_CODE (type
) == RECORD_TYPE
)
3902 field
= TYPE_FIELDS (type
);
3904 if (TREE_CODE (type
) == ARRAY_TYPE
3905 && TYPE_DOMAIN (type
) != 0)
3906 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
3908 /* As LINK goes through the elements of the constant,
3909 FIELD goes through the structure fields, if the constant is a structure.
3910 if the constant is a union, then we override this,
3911 by getting the field from the TREE_LIST element.
3912 But the constant could also be an array. Then FIELD is zero.
3914 There is always a maximum of one element in the chain LINK for unions
3915 (even if the initializer in a source program incorrectly contains
3917 for (link
= CONSTRUCTOR_ELTS (exp
);
3919 link
= TREE_CHAIN (link
),
3920 field
= field
? TREE_CHAIN (field
) : 0)
3922 tree val
= TREE_VALUE (link
);
3925 /* The element in a union constructor specifies the proper field
3927 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
3928 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
3929 && TREE_PURPOSE (link
) != 0)
3930 field
= TREE_PURPOSE (link
);
3932 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3933 index
= TREE_PURPOSE (link
);
3935 #ifdef ASM_COMMENT_START
3936 if (field
&& flag_verbose_asm
)
3937 fprintf (asm_out_file
, "%s %s:\n",
3940 ? IDENTIFIER_POINTER (DECL_NAME (field
))
3944 /* Eliminate the marker that makes a cast not be an lvalue. */
3948 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
3950 unsigned HOST_WIDE_INT fieldsize
3951 = int_size_in_bytes (TREE_TYPE (type
));
3952 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
3953 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
3954 HOST_WIDE_INT index
;
3955 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
3957 for (index
= lo_index
; index
<= hi_index
; index
++)
3959 /* Output the element's initial value. */
3961 assemble_zeros (fieldsize
);
3963 output_constant (val
, fieldsize
, align2
);
3965 /* Count its size. */
3966 total_bytes
+= fieldsize
;
3969 else if (field
== 0 || !DECL_BIT_FIELD (field
))
3971 /* An element that is not a bit-field. */
3973 unsigned HOST_WIDE_INT fieldsize
;
3974 /* Since this structure is static,
3975 we know the positions are constant. */
3976 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
3977 unsigned int align2
;
3980 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
3981 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
3983 /* Output any buffered-up bit-fields preceding this element. */
3984 if (byte_buffer_in_use
)
3986 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3988 byte_buffer_in_use
= 0;
3991 /* Advance to offset of this element.
3992 Note no alignment needed in an array, since that is guaranteed
3993 if each element has the proper size. */
3994 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
3996 assemble_zeros (pos
- total_bytes
);
4000 /* Find the alignment of this element. */
4001 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
4003 /* Determine size this element should occupy. */
4008 /* If this is an array with an unspecified upper bound,
4009 the initializer determines the size. */
4010 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4011 but we cannot do this until the deprecated support for
4012 initializing zero-length array members is removed. */
4013 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4014 && TYPE_DOMAIN (TREE_TYPE (field
))
4015 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4017 fieldsize
= array_size_for_constructor (val
);
4018 /* Given a non-empty initialization, this field had
4020 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4023 else if (DECL_SIZE_UNIT (field
))
4025 /* ??? This can't be right. If the decl size overflows
4026 a host integer we will silently emit no data. */
4027 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4028 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4032 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4034 /* Output the element's initial value. */
4036 assemble_zeros (fieldsize
);
4038 output_constant (val
, fieldsize
, align2
);
4040 /* Count its size. */
4041 total_bytes
+= fieldsize
;
4043 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4044 error ("invalid initial value for member %qs",
4045 IDENTIFIER_POINTER (DECL_NAME (field
)));
4048 /* Element that is a bit-field. */
4050 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4051 HOST_WIDE_INT end_offset
4052 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4055 val
= integer_zero_node
;
4057 /* If this field does not start in this (or, next) byte,
4059 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4061 /* Output remnant of any bit field in previous bytes. */
4062 if (byte_buffer_in_use
)
4064 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4066 byte_buffer_in_use
= 0;
4069 /* If still not at proper byte, advance to there. */
4070 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4072 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4073 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4077 if (! byte_buffer_in_use
)
4080 /* We must split the element into pieces that fall within
4081 separate bytes, and combine each byte with previous or
4082 following bit-fields. */
4084 /* next_offset is the offset n fbits from the beginning of
4085 the structure to the next bit of this element to be processed.
4086 end_offset is the offset of the first bit past the end of
4088 while (next_offset
< end_offset
)
4092 HOST_WIDE_INT value
;
4093 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4094 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4096 /* Advance from byte to byte
4097 within this element when necessary. */
4098 while (next_byte
!= total_bytes
)
4100 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4105 /* Number of bits we can process at once
4106 (all part of the same byte). */
4107 this_time
= MIN (end_offset
- next_offset
,
4108 BITS_PER_UNIT
- next_bit
);
4109 if (BYTES_BIG_ENDIAN
)
4111 /* On big-endian machine, take the most significant bits
4112 first (of the bits that are significant)
4113 and put them into bytes from the most significant end. */
4114 shift
= end_offset
- next_offset
- this_time
;
4116 /* Don't try to take a bunch of bits that cross
4117 the word boundary in the INTEGER_CST. We can
4118 only select bits from the LOW or HIGH part
4120 if (shift
< HOST_BITS_PER_WIDE_INT
4121 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4123 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4124 shift
= HOST_BITS_PER_WIDE_INT
;
4127 /* Now get the bits from the appropriate constant word. */
4128 if (shift
< HOST_BITS_PER_WIDE_INT
)
4129 value
= TREE_INT_CST_LOW (val
);
4130 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4132 value
= TREE_INT_CST_HIGH (val
);
4133 shift
-= HOST_BITS_PER_WIDE_INT
;
4138 /* Get the result. This works only when:
4139 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4140 byte
|= (((value
>> shift
)
4141 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4142 << (BITS_PER_UNIT
- this_time
- next_bit
));
4146 /* On little-endian machines,
4147 take first the least significant bits of the value
4148 and pack them starting at the least significant
4149 bits of the bytes. */
4150 shift
= next_offset
- int_bit_position (field
);
4152 /* Don't try to take a bunch of bits that cross
4153 the word boundary in the INTEGER_CST. We can
4154 only select bits from the LOW or HIGH part
4156 if (shift
< HOST_BITS_PER_WIDE_INT
4157 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4158 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4160 /* Now get the bits from the appropriate constant word. */
4161 if (shift
< HOST_BITS_PER_WIDE_INT
)
4162 value
= TREE_INT_CST_LOW (val
);
4163 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4165 value
= TREE_INT_CST_HIGH (val
);
4166 shift
-= HOST_BITS_PER_WIDE_INT
;
4171 /* Get the result. This works only when:
4172 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4173 byte
|= (((value
>> shift
)
4174 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4178 next_offset
+= this_time
;
4179 byte_buffer_in_use
= 1;
4184 if (byte_buffer_in_use
)
4186 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4190 if ((unsigned HOST_WIDE_INT
)total_bytes
< size
)
4191 assemble_zeros (size
- total_bytes
);
4194 /* This TREE_LIST contains any weak symbol declarations waiting
4196 static GTY(()) tree weak_decls
;
4198 /* Mark DECL as weak. */
4201 mark_weak (tree decl
)
4203 DECL_WEAK (decl
) = 1;
4205 if (DECL_RTL_SET_P (decl
)
4206 && MEM_P (DECL_RTL (decl
))
4207 && XEXP (DECL_RTL (decl
), 0)
4208 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4209 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4212 /* Merge weak status between NEWDECL and OLDDECL. */
4215 merge_weak (tree newdecl
, tree olddecl
)
4217 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4220 if (DECL_WEAK (newdecl
))
4224 /* NEWDECL is weak, but OLDDECL is not. */
4226 /* If we already output the OLDDECL, we're in trouble; we can't
4227 go back and make it weak. This error cannot caught in
4228 declare_weak because the NEWDECL and OLDDECL was not yet
4229 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4230 if (TREE_ASM_WRITTEN (olddecl
))
4231 error ("%Jweak declaration of %qD must precede definition",
4234 /* If we've already generated rtl referencing OLDDECL, we may
4235 have done so in a way that will not function properly with
4237 else if (TREE_USED (olddecl
)
4238 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4239 warning ("%Jweak declaration of %qD after first use results "
4240 "in unspecified behavior", newdecl
, newdecl
);
4244 /* We put the NEWDECL on the weak_decls list at some point.
4245 Replace it with the OLDDECL. */
4246 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4247 if (TREE_VALUE (wd
) == newdecl
)
4249 TREE_VALUE (wd
) = olddecl
;
4252 /* We may not find the entry on the list. If NEWDECL is a
4253 weak alias, then we will have already called
4254 globalize_decl to remove the entry; in that case, we do
4255 not need to do anything. */
4258 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4259 mark_weak (olddecl
);
4262 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4263 weak. Just update NEWDECL to indicate that it's weak too. */
4264 mark_weak (newdecl
);
4267 /* Declare DECL to be a weak symbol. */
4270 declare_weak (tree decl
)
4272 if (! TREE_PUBLIC (decl
))
4273 error ("%Jweak declaration of %qD must be public", decl
, decl
);
4274 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4275 error ("%Jweak declaration of %qD must precede definition", decl
, decl
);
4276 else if (SUPPORTS_WEAK
)
4278 if (! DECL_WEAK (decl
))
4279 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4282 warning ("%Jweak declaration of %qD not supported", decl
, decl
);
4287 /* Emit any pending weak declarations. */
4294 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4296 tree decl
= TREE_VALUE (t
);
4297 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4298 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4301 if (! TREE_USED (decl
))
4304 #ifdef ASM_WEAKEN_DECL
4305 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4307 #ifdef ASM_WEAKEN_LABEL
4308 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4310 #ifdef ASM_OUTPUT_WEAK_ALIAS
4311 warning ("only weak aliases are supported in this configuration");
4319 /* Emit the assembly bits to indicate that DECL is globally visible. */
4322 globalize_decl (tree decl
)
4324 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4326 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4327 if (DECL_WEAK (decl
))
4331 #ifdef ASM_WEAKEN_DECL
4332 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4334 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4337 /* Remove this function from the pending weak list so that
4338 we do not emit multiple .weak directives for it. */
4339 for (p
= &weak_decls
; (t
= *p
) ; )
4341 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4342 *p
= TREE_CHAIN (t
);
4344 p
= &TREE_CHAIN (t
);
4348 #elif defined(ASM_MAKE_LABEL_LINKONCE)
4349 if (DECL_ONE_ONLY (decl
))
4350 ASM_MAKE_LABEL_LINKONCE (asm_out_file
, name
);
4353 targetm
.asm_out
.globalize_label (asm_out_file
, name
);
4356 /* Some targets do not allow a forward or undefined reference in a
4357 ASM_OUTPUT_DEF. Thus, a mechanism is needed to defer the output of
4358 this assembler code. The following struct holds the declaration
4359 and target for a deferred output define. */
4360 struct output_def_pair
GTY(())
4365 typedef struct output_def_pair
*output_def_pair
;
4367 /* Define gc'd vector type. */
4368 DEF_VEC_GC_P(output_def_pair
);
4370 /* Vector of output_def_pair pointers. */
4371 static GTY(()) VEC(output_def_pair
) *output_defs
;
4373 #ifdef ASM_OUTPUT_DEF
4374 /* Output the assembler code for a define (equate) using ASM_OUTPUT_DEF
4375 or ASM_OUTPUT_DEF_FROM_DECLS. The function defines the symbol whose
4376 tree node is DECL to have the value of the tree node TARGET. */
4379 assemble_output_def (tree decl ATTRIBUTE_UNUSED
, tree target ATTRIBUTE_UNUSED
)
4381 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4382 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4384 ASM_OUTPUT_DEF (asm_out_file
,
4385 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)),
4386 IDENTIFIER_POINTER (target
));
4391 /* Process the vector of pending assembler defines. */
4394 process_pending_assemble_output_defs (void)
4396 #ifdef ASM_OUTPUT_DEF
4400 for (i
= 0; VEC_iterate (output_def_pair
, output_defs
, i
, p
); i
++)
4401 assemble_output_def (p
->decl
, p
->target
);
4407 /* Emit an assembler directive to make the symbol for DECL an alias to
4408 the symbol for TARGET. */
4411 assemble_alias (tree decl
, tree target
)
4413 /* We must force creation of DECL_RTL for debug info generation, even though
4414 we don't use it here. */
4415 make_decl_rtl (decl
);
4417 #ifdef ASM_OUTPUT_DEF
4418 /* Make name accessible from other files, if appropriate. */
4420 if (TREE_PUBLIC (decl
))
4422 globalize_decl (decl
);
4423 maybe_assemble_visibility (decl
);
4426 if (TARGET_DEFERRED_OUTPUT_DEFS (decl
, target
))
4430 p
= ggc_alloc (sizeof (struct output_def_pair
));
4433 VEC_safe_push (output_def_pair
, output_defs
, p
);
4436 assemble_output_def (decl
, target
);
4437 #else /* !ASM_OUTPUT_DEF */
4438 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4439 if (DECL_WEAK (decl
))
4444 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4445 #ifdef ASM_WEAKEN_DECL
4446 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4448 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4450 /* Remove this function from the pending weak list so that
4451 we do not emit multiple .weak directives for it. */
4452 for (p
= &weak_decls
; (t
= *p
) ; )
4453 if (DECL_ASSEMBLER_NAME (decl
)
4454 == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4455 *p
= TREE_CHAIN (t
);
4457 p
= &TREE_CHAIN (t
);
4460 warning ("only weak aliases are supported in this configuration");
4463 warning ("alias definitions not supported in this configuration; ignored");
4467 /* Tell cgraph that the aliased symbol is needed. We *could* be more
4468 specific and tell cgraph about the relationship between the two
4469 symbols, but given that aliases virtually always exist for a reason,
4470 it doesn't seem worthwhile. */
4471 if (flag_unit_at_a_time
)
4473 struct cgraph_node
*fnode
= NULL
;
4474 struct cgraph_varpool_node
*vnode
= NULL
;
4476 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4478 fnode
= cgraph_node_for_asm (target
);
4480 cgraph_mark_needed_node (fnode
);
4483 vnode
= cgraph_varpool_node_for_asm (target
);
4485 cgraph_varpool_mark_needed_node (vnode
);
4490 vnode
= cgraph_varpool_node_for_asm (target
);
4492 cgraph_varpool_mark_needed_node (vnode
);
4495 fnode
= cgraph_node_for_asm (target
);
4497 cgraph_mark_needed_node (fnode
);
4501 if (fnode
== NULL
&& vnode
== NULL
)
4502 warning ("%qD aliased to undefined symbol %qE", decl
, target
);
4505 TREE_USED (decl
) = 1;
4506 TREE_ASM_WRITTEN (decl
) = 1;
4507 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4510 /* Emit an assembler directive to set symbol for DECL visibility to
4511 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4514 default_assemble_visibility (tree decl
, int vis
)
4516 static const char * const visibility_types
[] = {
4517 NULL
, "internal", "hidden", "protected"
4520 const char *name
, *type
;
4522 name
= (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4523 type
= visibility_types
[vis
];
4525 #ifdef HAVE_GAS_HIDDEN
4526 fprintf (asm_out_file
, "\t.%s\t", type
);
4527 assemble_name (asm_out_file
, name
);
4528 fprintf (asm_out_file
, "\n");
4530 warning ("visibility attribute not supported in this configuration; ignored");
4534 /* A helper function to call assemble_visibility when needed for a decl. */
4537 maybe_assemble_visibility (tree decl
)
4539 enum symbol_visibility vis
= DECL_VISIBILITY (decl
);
4541 if (vis
!= VISIBILITY_DEFAULT
)
4542 targetm
.asm_out
.visibility (decl
, vis
);
4545 /* Returns 1 if the target configuration supports defining public symbols
4546 so that one of them will be chosen at link time instead of generating a
4547 multiply-defined symbol error, whether through the use of weak symbols or
4548 a target-specific mechanism for having duplicates discarded. */
4551 supports_one_only (void)
4553 if (SUPPORTS_ONE_ONLY
)
4555 return SUPPORTS_WEAK
;
4558 /* Set up DECL as a public symbol that can be defined in multiple
4559 translation units without generating a linker error. */
4562 make_decl_one_only (tree decl
)
4564 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4567 TREE_PUBLIC (decl
) = 1;
4569 if (SUPPORTS_ONE_ONLY
)
4571 #ifdef MAKE_DECL_ONE_ONLY
4572 MAKE_DECL_ONE_ONLY (decl
);
4574 DECL_ONE_ONLY (decl
) = 1;
4576 else if (TREE_CODE (decl
) == VAR_DECL
4577 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4578 DECL_COMMON (decl
) = 1;
4579 else if (SUPPORTS_WEAK
)
4580 DECL_WEAK (decl
) = 1;
4586 init_varasm_once (void)
4588 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4589 in_named_entry_eq
, NULL
);
4590 const_desc_htab
= htab_create_ggc (1009, const_desc_hash
,
4591 const_desc_eq
, NULL
);
4593 const_alias_set
= new_alias_set ();
4596 static enum tls_model
4597 decl_tls_model (tree decl
)
4599 enum tls_model kind
;
4600 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4605 attr
= TREE_VALUE (TREE_VALUE (attr
));
4606 if (TREE_CODE (attr
) != STRING_CST
)
4608 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4609 kind
= TLS_MODEL_LOCAL_EXEC
;
4610 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4611 kind
= TLS_MODEL_INITIAL_EXEC
;
4612 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4613 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4614 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4615 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4621 is_local
= targetm
.binds_local_p (decl
);
4625 kind
= TLS_MODEL_LOCAL_EXEC
;
4627 kind
= TLS_MODEL_INITIAL_EXEC
;
4629 /* Local dynamic is inefficient when we're not combining the
4630 parts of the address. */
4631 else if (optimize
&& is_local
)
4632 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4634 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4635 if (kind
< flag_tls_default
)
4636 kind
= flag_tls_default
;
4641 /* Select a set of attributes for section NAME based on the properties
4642 of DECL and whether or not RELOC indicates that DECL's initializer
4643 might contain runtime relocations.
4645 We make the section read-only and executable for a function decl,
4646 read-only for a const data decl, and writable for a non-const data decl. */
4649 default_section_type_flags (tree decl
, const char *name
, int reloc
)
4651 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4655 default_section_type_flags_1 (tree decl
, const char *name
, int reloc
,
4660 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4661 flags
= SECTION_CODE
;
4662 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4664 else if (unlikely_text_section_name
4665 && strcmp (name
, unlikely_text_section_name
) == 0)
4666 flags
= SECTION_CODE
;
4668 flags
= SECTION_WRITE
;
4670 if (decl
&& DECL_ONE_ONLY (decl
))
4671 flags
|= SECTION_LINKONCE
;
4673 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4674 flags
|= SECTION_TLS
| SECTION_WRITE
;
4676 if (strcmp (name
, ".bss") == 0
4677 || strncmp (name
, ".bss.", 5) == 0
4678 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4679 || strcmp (name
, ".sbss") == 0
4680 || strncmp (name
, ".sbss.", 6) == 0
4681 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0)
4682 flags
|= SECTION_BSS
;
4684 if (strcmp (name
, ".tdata") == 0
4685 || strncmp (name
, ".tdata.", 7) == 0
4686 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0)
4687 flags
|= SECTION_TLS
;
4689 if (strcmp (name
, ".tbss") == 0
4690 || strncmp (name
, ".tbss.", 6) == 0
4691 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4692 flags
|= SECTION_TLS
| SECTION_BSS
;
4694 /* These three sections have special ELF types. They are neither
4695 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4696 want to print a section type (@progbits or @nobits). If someone
4697 is silly enough to emit code or TLS variables to one of these
4698 sections, then don't handle them specially. */
4699 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4700 && (strcmp (name
, ".init_array") == 0
4701 || strcmp (name
, ".fini_array") == 0
4702 || strcmp (name
, ".preinit_array") == 0))
4703 flags
|= SECTION_NOTYPE
;
4708 /* Output assembly to switch to section NAME with attribute FLAGS.
4709 Four variants for common object file formats. */
4712 default_no_named_section (const char *name ATTRIBUTE_UNUSED
,
4713 unsigned int flags ATTRIBUTE_UNUSED
,
4714 tree decl ATTRIBUTE_UNUSED
)
4716 /* Some object formats don't support named sections at all. The
4717 front-end should already have flagged this as an error. */
4722 default_elf_asm_named_section (const char *name
, unsigned int flags
,
4723 tree decl ATTRIBUTE_UNUSED
)
4725 char flagchars
[10], *f
= flagchars
;
4727 /* If we have already declared this section, we can use an
4728 abbreviated form to switch back to it -- unless this section is
4729 part of a COMDAT groups, in which case GAS requires the full
4730 declaration every time. */
4731 if (!(HAVE_GAS_COMDAT_GROUP
&& (flags
& SECTION_LINKONCE
))
4732 && ! named_section_first_declaration (name
))
4734 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4738 if (!(flags
& SECTION_DEBUG
))
4740 if (flags
& SECTION_WRITE
)
4742 if (flags
& SECTION_CODE
)
4744 if (flags
& SECTION_SMALL
)
4746 if (flags
& SECTION_MERGE
)
4748 if (flags
& SECTION_STRINGS
)
4750 if (flags
& SECTION_TLS
)
4752 if (HAVE_GAS_COMDAT_GROUP
&& (flags
& SECTION_LINKONCE
))
4756 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4758 if (!(flags
& SECTION_NOTYPE
))
4763 if (flags
& SECTION_BSS
)
4769 #ifdef ASM_COMMENT_START
4770 /* On platforms that use "@" as the assembly comment character,
4772 if (strcmp (ASM_COMMENT_START
, "@") == 0)
4775 fprintf (asm_out_file
, format
, type
);
4777 if (flags
& SECTION_ENTSIZE
)
4778 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4779 if (HAVE_GAS_COMDAT_GROUP
&& (flags
& SECTION_LINKONCE
))
4780 fprintf (asm_out_file
, ",%s,comdat",
4781 lang_hooks
.decls
.comdat_group (decl
));
4784 putc ('\n', asm_out_file
);
4788 default_coff_asm_named_section (const char *name
, unsigned int flags
,
4789 tree decl ATTRIBUTE_UNUSED
)
4791 char flagchars
[8], *f
= flagchars
;
4793 if (flags
& SECTION_WRITE
)
4795 if (flags
& SECTION_CODE
)
4799 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4803 default_pe_asm_named_section (const char *name
, unsigned int flags
,
4806 default_coff_asm_named_section (name
, flags
, decl
);
4808 if (flags
& SECTION_LINKONCE
)
4810 /* Functions may have been compiled at various levels of
4811 optimization so we can't use `same_size' here.
4812 Instead, have the linker pick one. */
4813 fprintf (asm_out_file
, "\t.linkonce %s\n",
4814 (flags
& SECTION_CODE
? "discard" : "same_size"));
4818 /* The lame default section selector. */
4821 default_select_section (tree decl
, int reloc
,
4822 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4824 bool readonly
= false;
4828 if (decl_readonly_section (decl
, reloc
))
4831 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4833 if (! ((flag_pic
&& reloc
)
4834 || !TREE_READONLY (decl
)
4835 || TREE_SIDE_EFFECTS (decl
)
4836 || !TREE_CONSTANT (decl
)))
4839 else if (TREE_CODE (decl
) == STRING_CST
)
4841 else if (! (flag_pic
&& reloc
))
4845 readonly_data_section ();
4850 /* A helper function for default_elf_select_section and
4851 default_elf_unique_section. Categorizes the DECL. */
4853 enum section_category
4858 SECCAT_RODATA_MERGE_STR
,
4859 SECCAT_RODATA_MERGE_STR_INIT
,
4860 SECCAT_RODATA_MERGE_CONST
,
4865 /* To optimize loading of shared programs, define following subsections
4867 _REL Contains data that has relocations, so they get grouped
4868 together and dynamic linker will visit fewer pages in memory.
4869 _RO Contains data that is otherwise read-only. This is useful
4870 with prelinking as most relocations won't be dynamically
4871 linked and thus stay read only.
4872 _LOCAL Marks data containing relocations only to local objects.
4873 These relocations will get fully resolved by prelinking. */
4875 SECCAT_DATA_REL_LOCAL
,
4877 SECCAT_DATA_REL_RO_LOCAL
,
4887 static enum section_category
4888 categorize_decl_for_section (tree
, int, int);
4890 static enum section_category
4891 categorize_decl_for_section (tree decl
, int reloc
, int shlib
)
4893 enum section_category ret
;
4895 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4897 else if (TREE_CODE (decl
) == STRING_CST
)
4899 if (flag_mudflap
) /* or !flag_merge_constants */
4900 return SECCAT_RODATA
;
4902 return SECCAT_RODATA_MERGE_STR
;
4904 else if (TREE_CODE (decl
) == VAR_DECL
)
4906 if (DECL_INITIAL (decl
) == NULL
4907 || DECL_INITIAL (decl
) == error_mark_node
4908 || (flag_zero_initialized_in_bss
4909 /* Leave constant zeroes in .rodata so they can be shared. */
4910 && !TREE_READONLY (decl
)
4911 && initializer_zerop (DECL_INITIAL (decl
))))
4913 else if (! TREE_READONLY (decl
)
4914 || TREE_SIDE_EFFECTS (decl
)
4915 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
4917 if (shlib
&& (reloc
& 2))
4918 ret
= SECCAT_DATA_REL
;
4919 else if (shlib
&& reloc
)
4920 ret
= SECCAT_DATA_REL_LOCAL
;
4924 else if (shlib
&& (reloc
& 2))
4925 ret
= SECCAT_DATA_REL_RO
;
4926 else if (shlib
&& reloc
)
4927 ret
= SECCAT_DATA_REL_RO_LOCAL
;
4928 else if (reloc
|| flag_merge_constants
< 2)
4929 /* C and C++ don't allow different variables to share the same
4930 location. -fmerge-all-constants allows even that (at the
4931 expense of not conforming). */
4932 ret
= SECCAT_RODATA
;
4933 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
4934 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
4936 ret
= SECCAT_RODATA_MERGE_CONST
;
4938 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4940 if ((shlib
&& reloc
)
4941 || TREE_SIDE_EFFECTS (decl
)
4942 || ! TREE_CONSTANT (decl
))
4945 ret
= SECCAT_RODATA
;
4948 ret
= SECCAT_RODATA
;
4950 /* There are no read-only thread-local sections. */
4951 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4953 /* Note that this would be *just* SECCAT_BSS, except that there's
4954 no concept of a read-only thread-local-data section. */
4955 if (ret
== SECCAT_BSS
4956 || (flag_zero_initialized_in_bss
4957 && initializer_zerop (DECL_INITIAL (decl
))))
4963 /* If the target uses small data sections, select it. */
4964 else if (targetm
.in_small_data_p (decl
))
4966 if (ret
== SECCAT_BSS
)
4968 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
4969 ret
= SECCAT_SRODATA
;
4978 decl_readonly_section (tree decl
, int reloc
)
4980 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
4984 decl_readonly_section_1 (tree decl
, int reloc
, int shlib
)
4986 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4989 case SECCAT_RODATA_MERGE_STR
:
4990 case SECCAT_RODATA_MERGE_STR_INIT
:
4991 case SECCAT_RODATA_MERGE_CONST
:
4992 case SECCAT_SRODATA
:
5001 /* Select a section based on the above categorization. */
5004 default_elf_select_section (tree decl
, int reloc
,
5005 unsigned HOST_WIDE_INT align
)
5007 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
5011 default_elf_select_section_1 (tree decl
, int reloc
,
5012 unsigned HOST_WIDE_INT align
, int shlib
)
5015 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5018 /* We're not supposed to be called on FUNCTION_DECLs. */
5021 readonly_data_section ();
5023 case SECCAT_RODATA_MERGE_STR
:
5024 mergeable_string_section (decl
, align
, 0);
5026 case SECCAT_RODATA_MERGE_STR_INIT
:
5027 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
5029 case SECCAT_RODATA_MERGE_CONST
:
5030 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
5032 case SECCAT_SRODATA
:
5038 case SECCAT_DATA_REL
:
5039 sname
= ".data.rel";
5041 case SECCAT_DATA_REL_LOCAL
:
5042 sname
= ".data.rel.local";
5044 case SECCAT_DATA_REL_RO
:
5045 sname
= ".data.rel.ro";
5047 case SECCAT_DATA_REL_RO_LOCAL
:
5048 sname
= ".data.rel.ro.local";
5057 #ifdef BSS_SECTION_ASM_OP
5076 named_section (decl
, sname
, reloc
);
5079 /* Construct a unique section name based on the decl name and the
5080 categorization performed above. */
5083 default_unique_section (tree decl
, int reloc
)
5085 default_unique_section_1 (decl
, reloc
, flag_pic
);
5089 default_unique_section_1 (tree decl
, int reloc
, int shlib
)
5091 bool one_only
= DECL_ONE_ONLY (decl
);
5092 const char *prefix
, *name
;
5096 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5099 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
5102 case SECCAT_RODATA_MERGE_STR
:
5103 case SECCAT_RODATA_MERGE_STR_INIT
:
5104 case SECCAT_RODATA_MERGE_CONST
:
5105 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
5107 case SECCAT_SRODATA
:
5108 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
5111 case SECCAT_DATA_REL
:
5112 case SECCAT_DATA_REL_LOCAL
:
5113 case SECCAT_DATA_REL_RO
:
5114 case SECCAT_DATA_REL_RO_LOCAL
:
5115 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
5118 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
5121 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
5124 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
5127 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
5130 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
5135 plen
= strlen (prefix
);
5137 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5138 name
= targetm
.strip_name_encoding (name
);
5139 nlen
= strlen (name
);
5141 string
= alloca (nlen
+ plen
+ 1);
5142 memcpy (string
, prefix
, plen
);
5143 memcpy (string
+ plen
, name
, nlen
+ 1);
5145 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
5149 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
5151 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
5154 switch (GET_CODE (x
))
5166 readonly_data_section ();
5170 default_elf_select_rtx_section (enum machine_mode mode
, rtx x
,
5171 unsigned HOST_WIDE_INT align
)
5173 /* ??? Handle small data here somehow. */
5176 switch (GET_CODE (x
))
5180 named_section (NULL_TREE
, ".data.rel.ro", 3);
5184 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
5191 mergeable_constant_section (mode
, align
, 0);
5194 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
5197 default_encode_section_info (tree decl
, rtx rtl
, int first ATTRIBUTE_UNUSED
)
5202 /* Careful not to prod global register variables. */
5205 symbol
= XEXP (rtl
, 0);
5206 if (GET_CODE (symbol
) != SYMBOL_REF
)
5210 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5211 flags
|= SYMBOL_FLAG_FUNCTION
;
5212 if (targetm
.binds_local_p (decl
))
5213 flags
|= SYMBOL_FLAG_LOCAL
;
5214 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5215 flags
|= decl_tls_model (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
5216 else if (targetm
.in_small_data_p (decl
))
5217 flags
|= SYMBOL_FLAG_SMALL
;
5218 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
5219 being PUBLIC, the thing *must* be defined in this translation unit.
5220 Prevent this buglet from being propagated into rtl code as well. */
5221 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
5222 flags
|= SYMBOL_FLAG_EXTERNAL
;
5224 SYMBOL_REF_FLAGS (symbol
) = flags
;
5227 /* By default, we do nothing for encode_section_info, so we need not
5228 do anything but discard the '*' marker. */
5231 default_strip_name_encoding (const char *str
)
5233 return str
+ (*str
== '*');
5236 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5237 wrt cross-module name binding. */
5240 default_binds_local_p (tree exp
)
5242 return default_binds_local_p_1 (exp
, flag_shlib
);
5246 default_binds_local_p_1 (tree exp
, int shlib
)
5250 /* A non-decl is an entry in the constant pool. */
5253 /* Static variables are always local. */
5254 else if (! TREE_PUBLIC (exp
))
5256 /* A variable is local if the user explicitly tells us so. */
5257 else if (DECL_VISIBILITY_SPECIFIED (exp
) && DECL_VISIBILITY (exp
) != VISIBILITY_DEFAULT
)
5259 /* Otherwise, variables defined outside this object may not be local. */
5260 else if (DECL_EXTERNAL (exp
))
5262 /* Linkonce and weak data are never local. */
5263 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
5265 /* If none of the above and visibility is not default, make local. */
5266 else if (DECL_VISIBILITY (exp
) != VISIBILITY_DEFAULT
)
5268 /* If PIC, then assume that any global name can be overridden by
5269 symbols resolved from other modules. */
5272 /* Uninitialized COMMON variable may be unified with symbols
5273 resolved from other modules. */
5274 else if (DECL_COMMON (exp
)
5275 && (DECL_INITIAL (exp
) == NULL
5276 || DECL_INITIAL (exp
) == error_mark_node
))
5278 /* Otherwise we're left with initialized (or non-common) global data
5279 which is of necessity defined locally. */
5286 /* Determine whether or not a pointer mode is valid. Assume defaults
5287 of ptr_mode or Pmode - can be overridden. */
5289 default_valid_pointer_mode (enum machine_mode mode
)
5291 return (mode
== ptr_mode
|| mode
== Pmode
);
5294 /* Default function to output code that will globalize a label. A
5295 target must define GLOBAL_ASM_OP or provide it's own function to
5296 globalize a label. */
5297 #ifdef GLOBAL_ASM_OP
5299 default_globalize_label (FILE * stream
, const char *name
)
5301 fputs (GLOBAL_ASM_OP
, stream
);
5302 assemble_name (stream
, name
);
5303 putc ('\n', stream
);
5305 #endif /* GLOBAL_ASM_OP */
5307 /* Default function to output a label for unwind information. The
5308 default is to do nothing. A target that needs nonlocal labels for
5309 unwind information must provide its own function to do this. */
5311 default_emit_unwind_label (FILE * stream ATTRIBUTE_UNUSED
,
5312 tree decl ATTRIBUTE_UNUSED
,
5313 int for_eh ATTRIBUTE_UNUSED
,
5314 int empty ATTRIBUTE_UNUSED
)
5318 /* This is how to output an internal numbered label where PREFIX is
5319 the class of label and LABELNO is the number within the class. */
5322 default_internal_label (FILE *stream
, const char *prefix
,
5323 unsigned long labelno
)
5325 char *const buf
= alloca (40 + strlen (prefix
));
5326 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5327 ASM_OUTPUT_INTERNAL_LABEL (stream
, buf
);
5330 /* This is the default behavior at the beginning of a file. It's
5331 controlled by two other target-hook toggles. */
5333 default_file_start (void)
5335 if (targetm
.file_start_app_off
&& !flag_verbose_asm
)
5336 fputs (ASM_APP_OFF
, asm_out_file
);
5338 if (targetm
.file_start_file_directive
)
5339 output_file_directive (asm_out_file
, main_input_filename
);
5342 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5343 which emits a special section directive used to indicate whether or
5344 not this object file needs an executable stack. This is primarily
5345 a GNU extension to ELF but could be used on other targets. */
5347 int trampolines_created
;
5350 file_end_indicate_exec_stack (void)
5352 unsigned int flags
= SECTION_DEBUG
;
5353 if (trampolines_created
)
5354 flags
|= SECTION_CODE
;
5356 named_section_flags (".note.GNU-stack", flags
);
5359 #include "gt-varasm.h"