1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
32 #include "coretypes.h"
39 #include "hard-reg-set.h"
47 #include "langhooks.h"
51 #include "tree-mudflap.h"
53 #include "cfglayout.h"
55 #ifdef XCOFF_DEBUGGING_INFO
56 #include "xcoffout.h" /* Needed for external data
57 declarations for e.g. AIX 4.x. */
61 #define ASM_STABS_OP "\t.stabs\t"
64 /* The (assembler) name of the first globally-visible object output. */
65 const char *first_global_object_name
;
66 const char *weak_global_object_name
;
69 struct constant_descriptor_rtx
;
70 struct rtx_constant_pool
;
72 struct varasm_status
GTY(())
74 /* If we're using a per-function constant pool, this is it. */
75 struct rtx_constant_pool
*pool
;
77 /* Number of tree-constants deferred during the expansion of this
79 unsigned int deferred_constants
;
82 #define n_deferred_constants (cfun->varasm->deferred_constants)
84 /* Number for making the label on the next
85 constant that is stored in memory. */
87 static GTY(()) int const_labelno
;
89 /* Carry information from ASM_DECLARE_OBJECT_NAME
90 to ASM_FINISH_DECLARE_OBJECT. */
92 int size_directive_output
;
94 /* The last decl for which assemble_variable was called,
95 if it did ASM_DECLARE_OBJECT_NAME.
96 If the last call to assemble_variable didn't do that,
99 tree last_assemble_variable_decl
;
101 /* The following global variable indicates if the section label for the
102 "cold" section of code has been output yet to the assembler. The
103 label is useful when running gdb. This is part of the optimization that
104 partitions hot and cold basic blocks into separate sections of the .o
107 bool unlikely_section_label_printed
= false;
109 /* The following global variable indicates the label name to be put at
110 the start of the first cold section within each function, when
111 partitioning basic blocks into hot and cold sections. */
113 char *unlikely_section_label
= NULL
;
115 /* The following global variable indicates the section name to be used
116 for the current cold section, when partitioning hot and cold basic
117 blocks into separate sections. */
119 char *unlikely_text_section_name
= NULL
;
121 /* RTX_UNCHANGING_P in a MEM can mean it is stored into, for initialization.
122 So giving constant the alias set for the type will allow such
123 initializations to appear to conflict with the load of the constant. We
124 avoid this by giving all constants an alias set for just constants.
125 Since there will be no stores to that alias set, nothing will ever
126 conflict with them. */
128 static HOST_WIDE_INT const_alias_set
;
130 static const char *strip_reg_name (const char *);
131 static int contains_pointers_p (tree
);
132 #ifdef ASM_OUTPUT_EXTERNAL
133 static bool incorporeal_function_p (tree
);
135 static void decode_addr_const (tree
, struct addr_const
*);
136 static hashval_t
const_desc_hash (const void *);
137 static int const_desc_eq (const void *, const void *);
138 static hashval_t
const_hash_1 (const tree
);
139 static int compare_constant (const tree
, const tree
);
140 static tree
copy_constant (tree
);
141 static void output_constant_def_contents (rtx
);
142 static void output_addressed_constants (tree
);
143 static unsigned HOST_WIDE_INT
array_size_for_constructor (tree
);
144 static unsigned min_align (unsigned, unsigned);
145 static void output_constructor (tree
, unsigned HOST_WIDE_INT
, unsigned int);
146 static void globalize_decl (tree
);
147 static void maybe_assemble_visibility (tree
);
148 static int in_named_entry_eq (const void *, const void *);
149 static hashval_t
in_named_entry_hash (const void *);
150 #ifdef BSS_SECTION_ASM_OP
151 #ifdef ASM_OUTPUT_BSS
152 static void asm_output_bss (FILE *, tree
, const char *,
153 unsigned HOST_WIDE_INT
, unsigned HOST_WIDE_INT
);
155 #ifdef ASM_OUTPUT_ALIGNED_BSS
156 static void asm_output_aligned_bss (FILE *, tree
, const char *,
157 unsigned HOST_WIDE_INT
, int)
160 #endif /* BSS_SECTION_ASM_OP */
161 static bool asm_emit_uninitialised (tree
, const char*,
162 unsigned HOST_WIDE_INT
,
163 unsigned HOST_WIDE_INT
);
164 static void mark_weak (tree
);
166 enum in_section
{ no_section
, in_text
, in_unlikely_executed_text
, in_data
,
168 #ifdef BSS_SECTION_ASM_OP
171 #ifdef CTORS_SECTION_ASM_OP
174 #ifdef DTORS_SECTION_ASM_OP
177 #ifdef READONLY_DATA_SECTION_ASM_OP
180 #ifdef EXTRA_SECTIONS
184 static GTY(()) enum in_section in_section
= no_section
;
186 /* Return a nonzero value if DECL has a section attribute. */
187 #ifndef IN_NAMED_SECTION
188 #define IN_NAMED_SECTION(DECL) \
189 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
190 && DECL_SECTION_NAME (DECL) != NULL_TREE)
193 /* Text of section name when in_section == in_named. */
194 static GTY(()) const char *in_named_name
;
196 /* Hash table of flags that have been used for a particular named section. */
198 struct in_named_entry
GTY(())
205 static GTY((param_is (struct in_named_entry
))) htab_t in_named_htab
;
207 /* Define functions like text_section for any extra sections. */
208 #ifdef EXTRA_SECTION_FUNCTIONS
209 EXTRA_SECTION_FUNCTIONS
212 /* Tell assembler to switch to text section. */
217 if (in_section
!= in_text
)
219 in_section
= in_text
;
220 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
224 /* Tell assembler to switch to unlikely-to-be-executed text section. */
227 unlikely_text_section (void)
229 if ((in_section
!= in_unlikely_executed_text
)
230 && (in_section
!= in_named
231 || strcmp (in_named_name
, UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) != 0))
233 if (targetm
.have_named_sections
)
234 named_section (NULL_TREE
, UNLIKELY_EXECUTED_TEXT_SECTION_NAME
, 0);
237 in_section
= in_unlikely_executed_text
;
238 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
241 if (!unlikely_section_label_printed
)
243 ASM_OUTPUT_LABEL (asm_out_file
, unlikely_section_label
);
244 unlikely_section_label_printed
= true;
249 /* Tell assembler to switch to data section. */
254 if (in_section
!= in_data
)
256 in_section
= in_data
;
257 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
261 /* Tell assembler to switch to read-only data section. This is normally
265 readonly_data_section (void)
267 #ifdef READONLY_DATA_SECTION
268 READONLY_DATA_SECTION (); /* Note this can call data_section. */
270 #ifdef READONLY_DATA_SECTION_ASM_OP
271 if (in_section
!= in_readonly_data
)
273 in_section
= in_readonly_data
;
274 fputs (READONLY_DATA_SECTION_ASM_OP
, asm_out_file
);
275 fputc ('\n', asm_out_file
);
283 /* Determine if we're in the text section. */
286 in_text_section (void)
288 return in_section
== in_text
;
291 /* Determine if we're in the unlikely-to-be-executed text section. */
294 in_unlikely_text_section (void)
296 return in_section
== in_unlikely_executed_text
;
299 /* Determine if we're in the data section. */
302 in_data_section (void)
304 return in_section
== in_data
;
307 /* Helper routines for maintaining in_named_htab. */
310 in_named_entry_eq (const void *p1
, const void *p2
)
312 const struct in_named_entry
*old
= p1
;
313 const char *new = p2
;
315 return strcmp (old
->name
, new) == 0;
319 in_named_entry_hash (const void *p
)
321 const struct in_named_entry
*old
= p
;
322 return htab_hash_string (old
->name
);
325 /* If SECTION has been seen before as a named section, return the flags
326 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
327 set of flags for a section to have, so 0 does not mean that the section
328 has not been seen. */
331 get_named_section_flags (const char *section
)
333 struct in_named_entry
**slot
;
335 slot
= (struct in_named_entry
**)
336 htab_find_slot_with_hash (in_named_htab
, section
,
337 htab_hash_string (section
), NO_INSERT
);
339 return slot
? (*slot
)->flags
: 0;
342 /* Returns true if the section has been declared before. Sets internal
343 flag on this section in in_named_hash so subsequent calls on this
344 section will return false. */
347 named_section_first_declaration (const char *name
)
349 struct in_named_entry
**slot
;
351 slot
= (struct in_named_entry
**)
352 htab_find_slot_with_hash (in_named_htab
, name
,
353 htab_hash_string (name
), NO_INSERT
);
354 if (! (*slot
)->declared
)
356 (*slot
)->declared
= true;
366 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
367 different set of flags, return false. */
370 set_named_section_flags (const char *section
, unsigned int flags
)
372 struct in_named_entry
**slot
, *entry
;
374 slot
= (struct in_named_entry
**)
375 htab_find_slot_with_hash (in_named_htab
, section
,
376 htab_hash_string (section
), INSERT
);
381 entry
= ggc_alloc (sizeof (*entry
));
383 entry
->name
= ggc_strdup (section
);
384 entry
->flags
= flags
;
385 entry
->declared
= false;
387 else if (entry
->flags
!= flags
)
393 /* Tell assembler to change to section NAME with attributes FLAGS. */
396 named_section_flags (const char *name
, unsigned int flags
)
398 if (in_section
!= in_named
|| strcmp (name
, in_named_name
) != 0)
400 if (! set_named_section_flags (name
, flags
))
403 targetm
.asm_out
.named_section (name
, flags
);
405 if (flags
& SECTION_FORGET
)
406 in_section
= no_section
;
409 in_named_name
= ggc_strdup (name
);
410 in_section
= in_named
;
415 /* Tell assembler to change to section NAME for DECL.
416 If DECL is NULL, just switch to section NAME.
417 If NAME is NULL, get the name from DECL.
418 If RELOC is 1, the initializer for DECL contains relocs. */
421 named_section (tree decl
, const char *name
, int reloc
)
425 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
428 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
430 flags
= targetm
.section_type_flags (decl
, name
, reloc
);
432 /* Sanity check user variables for flag changes. Non-user
433 section flag changes will abort in named_section_flags.
434 However, don't complain if SECTION_OVERRIDE is set.
435 We trust that the setter knows that it is safe to ignore
436 the default flags for this decl. */
437 if (decl
&& ! set_named_section_flags (name
, flags
))
439 flags
= get_named_section_flags (name
);
440 if ((flags
& SECTION_OVERRIDE
) == 0)
441 error ("%J%D causes a section type conflict", decl
, decl
);
444 named_section_flags (name
, flags
);
447 /* If required, set DECL_SECTION_NAME to a unique name. */
450 resolve_unique_section (tree decl
, int reloc ATTRIBUTE_UNUSED
,
451 int flag_function_or_data_sections
)
453 if (DECL_SECTION_NAME (decl
) == NULL_TREE
454 && targetm
.have_named_sections
455 && (flag_function_or_data_sections
456 || DECL_ONE_ONLY (decl
)))
457 targetm
.asm_out
.unique_section (decl
, reloc
);
460 #ifdef BSS_SECTION_ASM_OP
462 /* Tell the assembler to switch to the bss section. */
467 if (in_section
!= in_bss
)
469 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
474 #ifdef ASM_OUTPUT_BSS
476 /* Utility function for ASM_OUTPUT_BSS for targets to use if
477 they don't support alignments in .bss.
478 ??? It is believed that this function will work in most cases so such
479 support is localized here. */
482 asm_output_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
484 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
485 unsigned HOST_WIDE_INT rounded
)
487 targetm
.asm_out
.globalize_label (file
, name
);
489 #ifdef ASM_DECLARE_OBJECT_NAME
490 last_assemble_variable_decl
= decl
;
491 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
493 /* Standard thing is just output label for the object. */
494 ASM_OUTPUT_LABEL (file
, name
);
495 #endif /* ASM_DECLARE_OBJECT_NAME */
496 ASM_OUTPUT_SKIP (file
, rounded
? rounded
: 1);
501 #ifdef ASM_OUTPUT_ALIGNED_BSS
503 /* Utility function for targets to use in implementing
504 ASM_OUTPUT_ALIGNED_BSS.
505 ??? It is believed that this function will work in most cases so such
506 support is localized here. */
509 asm_output_aligned_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
510 const char *name
, unsigned HOST_WIDE_INT size
,
514 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
515 #ifdef ASM_DECLARE_OBJECT_NAME
516 last_assemble_variable_decl
= decl
;
517 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
519 /* Standard thing is just output label for the object. */
520 ASM_OUTPUT_LABEL (file
, name
);
521 #endif /* ASM_DECLARE_OBJECT_NAME */
522 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
527 #endif /* BSS_SECTION_ASM_OP */
529 /* Switch to the section for function DECL.
531 If DECL is NULL_TREE, switch to the text section.
532 ??? It's not clear that we will ever be passed NULL_TREE, but it's
533 safer to handle it. */
536 function_section (tree decl
)
538 if (scan_ahead_for_unlikely_executed_note (get_insns()))
539 unlikely_text_section ();
542 if (decl
!= NULL_TREE
543 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
544 named_section (decl
, (char *) 0, 0);
550 /* Switch to read-only data section associated with function DECL. */
553 default_function_rodata_section (tree decl
)
555 if (decl
!= NULL_TREE
&& DECL_SECTION_NAME (decl
))
557 const char *name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
559 /* For .gnu.linkonce.t.foo we want to use .gnu.linkonce.r.foo. */
560 if (DECL_ONE_ONLY (decl
) && strncmp (name
, ".gnu.linkonce.t.", 16) == 0)
562 size_t len
= strlen (name
) + 1;
563 char *rname
= alloca (len
);
565 memcpy (rname
, name
, len
);
567 named_section_flags (rname
, SECTION_LINKONCE
);
570 /* For .text.foo we want to use .rodata.foo. */
571 else if (flag_function_sections
&& flag_data_sections
572 && strncmp (name
, ".text.", 6) == 0)
574 size_t len
= strlen (name
) + 1;
575 char *rname
= alloca (len
+ 2);
577 memcpy (rname
, ".rodata", 7);
578 memcpy (rname
+ 7, name
+ 5, len
- 5);
579 named_section_flags (rname
, 0);
584 readonly_data_section ();
587 /* Switch to read-only data section associated with function DECL
588 for targets where that section should be always the single
589 readonly data section. */
592 default_no_function_rodata_section (tree decl ATTRIBUTE_UNUSED
)
594 readonly_data_section ();
597 /* Switch to section for variable DECL. RELOC is the same as the
598 argument to SELECT_SECTION. */
601 variable_section (tree decl
, int reloc
)
603 if (IN_NAMED_SECTION (decl
))
604 named_section (decl
, NULL
, reloc
);
606 targetm
.asm_out
.select_section (decl
, reloc
, DECL_ALIGN (decl
));
609 /* Tell assembler to switch to the section for string merging. */
612 mergeable_string_section (tree decl ATTRIBUTE_UNUSED
,
613 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
614 unsigned int flags ATTRIBUTE_UNUSED
)
616 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
617 && TREE_CODE (decl
) == STRING_CST
618 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
620 && TREE_STRING_LENGTH (decl
) >= int_size_in_bytes (TREE_TYPE (decl
)))
622 enum machine_mode mode
;
623 unsigned int modesize
;
628 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (decl
)));
629 modesize
= GET_MODE_BITSIZE (mode
);
630 if (modesize
>= 8 && modesize
<= 256
631 && (modesize
& (modesize
- 1)) == 0)
633 if (align
< modesize
)
636 str
= TREE_STRING_POINTER (decl
);
637 len
= TREE_STRING_LENGTH (decl
);
638 unit
= GET_MODE_SIZE (mode
);
640 /* Check for embedded NUL characters. */
641 for (i
= 0; i
< len
; i
+= unit
)
643 for (j
= 0; j
< unit
; j
++)
644 if (str
[i
+ j
] != '\0')
651 sprintf (name
, ".rodata.str%d.%d", modesize
/ 8,
653 flags
|= (modesize
/ 8) | SECTION_MERGE
| SECTION_STRINGS
;
654 if (!i
&& modesize
< align
)
656 /* A "" string with requested alignment greater than
657 character size might cause a problem:
658 if some other string required even bigger
659 alignment than "", then linker might think the
660 "" is just part of padding after some other string
661 and not put it into the hash table initially.
662 But this means "" could have smaller alignment
664 #ifdef ASM_OUTPUT_SECTION_START
665 named_section_flags (name
, flags
);
666 ASM_OUTPUT_SECTION_START (asm_out_file
);
668 readonly_data_section ();
673 named_section_flags (name
, flags
);
679 readonly_data_section ();
682 /* Tell assembler to switch to the section for constant merging. */
685 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
686 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
687 unsigned int flags ATTRIBUTE_UNUSED
)
689 unsigned int modesize
= GET_MODE_BITSIZE (mode
);
691 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
697 && (align
& (align
- 1)) == 0)
701 sprintf (name
, ".rodata.cst%d", (int) (align
/ 8));
702 flags
|= (align
/ 8) | SECTION_MERGE
;
703 named_section_flags (name
, flags
);
707 readonly_data_section ();
710 /* Given NAME, a putative register name, discard any customary prefixes. */
713 strip_reg_name (const char *name
)
715 #ifdef REGISTER_PREFIX
716 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
717 name
+= strlen (REGISTER_PREFIX
);
719 if (name
[0] == '%' || name
[0] == '#')
724 /* The user has asked for a DECL to have a particular name. Set (or
725 change) it in such a way that we don't prefix an underscore to
728 set_user_assembler_name (tree decl
, const char *name
)
730 char *starred
= alloca (strlen (name
) + 2);
732 strcpy (starred
+ 1, name
);
733 change_decl_assembler_name (decl
, get_identifier (starred
));
734 SET_DECL_RTL (decl
, NULL_RTX
);
737 /* Decode an `asm' spec for a declaration as a register name.
738 Return the register number, or -1 if nothing specified,
739 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
740 or -3 if ASMSPEC is `cc' and is not recognized,
741 or -4 if ASMSPEC is `memory' and is not recognized.
742 Accept an exact spelling or a decimal number.
743 Prefixes such as % are optional. */
746 decode_reg_name (const char *asmspec
)
752 /* Get rid of confusing prefixes. */
753 asmspec
= strip_reg_name (asmspec
);
755 /* Allow a decimal number as a "register name". */
756 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
757 if (! ISDIGIT (asmspec
[i
]))
759 if (asmspec
[0] != 0 && i
< 0)
762 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
768 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
770 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
773 #ifdef ADDITIONAL_REGISTER_NAMES
775 static const struct { const char *const name
; const int number
; } table
[]
776 = ADDITIONAL_REGISTER_NAMES
;
778 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
779 if (! strcmp (asmspec
, table
[i
].name
))
780 return table
[i
].number
;
782 #endif /* ADDITIONAL_REGISTER_NAMES */
784 if (!strcmp (asmspec
, "memory"))
787 if (!strcmp (asmspec
, "cc"))
796 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
797 have static storage duration. In other words, it should not be an
798 automatic variable, including PARM_DECLs.
800 There is, however, one exception: this function handles variables
801 explicitly placed in a particular register by the user.
803 This is never called for PARM_DECL nodes. */
806 make_decl_rtl (tree decl
)
808 const char *name
= 0;
812 /* Check that we are not being given an automatic variable. */
813 /* A weak alias has TREE_PUBLIC set but not the other bits. */
814 if (TREE_CODE (decl
) == PARM_DECL
815 || TREE_CODE (decl
) == RESULT_DECL
816 || (TREE_CODE (decl
) == VAR_DECL
817 && !TREE_STATIC (decl
)
818 && !TREE_PUBLIC (decl
)
819 && !DECL_EXTERNAL (decl
)
820 && !DECL_REGISTER (decl
)))
822 /* And that we were not given a type or a label. */
823 else if (TREE_CODE (decl
) == TYPE_DECL
824 || TREE_CODE (decl
) == LABEL_DECL
)
827 /* For a duplicate declaration, we can be called twice on the
828 same DECL node. Don't discard the RTL already made. */
829 if (DECL_RTL_SET_P (decl
))
831 /* If the old RTL had the wrong mode, fix the mode. */
832 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
833 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
834 DECL_MODE (decl
), 0));
836 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
839 /* ??? Another way to do this would be to maintain a hashed
840 table of such critters. Instead of adding stuff to a DECL
841 to give certain attributes to it, we could use an external
842 hash map from DECL to set of attributes. */
844 /* Let the target reassign the RTL if it wants.
845 This is necessary, for example, when one machine specific
846 decl attribute overrides another. */
847 targetm
.encode_section_info (decl
, DECL_RTL (decl
), false);
849 /* Make this function static known to the mudflap runtime. */
850 if (flag_mudflap
&& TREE_CODE (decl
) == VAR_DECL
)
851 mudflap_enqueue_decl (decl
);
856 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
858 reg_number
= decode_reg_name (name
);
860 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
862 /* First detect errors in declaring global registers. */
863 if (reg_number
== -1)
864 error ("%Jregister name not specified for '%D'", decl
, decl
);
865 else if (reg_number
< 0)
866 error ("%Jinvalid register name for '%D'", decl
, decl
);
867 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
868 error ("%Jdata type of '%D' isn't suitable for a register",
870 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
871 error ("%Jregister specified for '%D' isn't suitable for data type",
873 /* Now handle properly declared static register variables. */
878 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
880 DECL_INITIAL (decl
) = 0;
881 error ("global register variable has initial value");
883 if (TREE_THIS_VOLATILE (decl
))
884 warning ("volatile register variables don't work as you might wish");
886 /* If the user specified one of the eliminables registers here,
887 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
888 confused with that register and be eliminated. This usage is
889 somewhat suspect... */
891 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
892 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
893 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
895 if (TREE_STATIC (decl
))
897 /* Make this register global, so not usable for anything
899 #ifdef ASM_DECLARE_REGISTER_GLOBAL
900 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
902 nregs
= hard_regno_nregs
[reg_number
][DECL_MODE (decl
)];
904 globalize_reg (reg_number
+ --nregs
);
907 /* As a register variable, it has no section. */
912 /* Now handle ordinary static variables and functions (in memory).
913 Also handle vars declared register invalidly. */
915 if (name
[0] == '*' && (reg_number
>= 0 || reg_number
== -3))
916 error ("%Jregister name given for non-register variable '%D'", decl
, decl
);
918 /* Specifying a section attribute on a variable forces it into a
919 non-.bss section, and thus it cannot be common. */
920 if (TREE_CODE (decl
) == VAR_DECL
921 && DECL_SECTION_NAME (decl
) != NULL_TREE
922 && DECL_INITIAL (decl
) == NULL_TREE
923 && DECL_COMMON (decl
))
924 DECL_COMMON (decl
) = 0;
926 /* Variables can't be both common and weak. */
927 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
928 DECL_COMMON (decl
) = 0;
930 x
= gen_rtx_SYMBOL_REF (Pmode
, name
);
931 SYMBOL_REF_WEAK (x
) = DECL_WEAK (decl
);
932 SYMBOL_REF_DECL (x
) = decl
;
934 x
= gen_rtx_MEM (DECL_MODE (decl
), x
);
935 if (TREE_CODE (decl
) != FUNCTION_DECL
)
936 set_mem_attributes (x
, decl
, 1);
937 SET_DECL_RTL (decl
, x
);
939 /* Optionally set flags or add text to the name to record information
940 such as that it is a function name.
941 If the name is changed, the macro ASM_OUTPUT_LABELREF
942 will have to know how to strip this information. */
943 targetm
.encode_section_info (decl
, DECL_RTL (decl
), true);
945 /* Make this function static known to the mudflap runtime. */
946 if (flag_mudflap
&& TREE_CODE (decl
) == VAR_DECL
)
947 mudflap_enqueue_decl (decl
);
950 /* Make the rtl for variable VAR be volatile.
951 Use this only for static variables. */
954 make_var_volatile (tree var
)
956 if (!MEM_P (DECL_RTL (var
)))
959 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
962 /* Output a string of literal assembler code
963 for an `asm' keyword used between functions. */
966 assemble_asm (tree string
)
970 if (TREE_CODE (string
) == ADDR_EXPR
)
971 string
= TREE_OPERAND (string
, 0);
973 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
976 /* Record an element in the table of global destructors. SYMBOL is
977 a SYMBOL_REF of the function to be called; PRIORITY is a number
978 between 0 and MAX_INIT_PRIORITY. */
981 default_stabs_asm_out_destructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
983 /* Tell GNU LD that this is part of the static destructor set.
984 This will work for any system that uses stabs, most usefully
986 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
987 assemble_name (asm_out_file
, XSTR (symbol
, 0));
988 fputc ('\n', asm_out_file
);
992 default_named_section_asm_out_destructor (rtx symbol
, int priority
)
994 const char *section
= ".dtors";
997 /* ??? This only works reliably with the GNU linker. */
998 if (priority
!= DEFAULT_INIT_PRIORITY
)
1000 sprintf (buf
, ".dtors.%.5u",
1001 /* Invert the numbering so the linker puts us in the proper
1002 order; constructors are run from right to left, and the
1003 linker sorts in increasing order. */
1004 MAX_INIT_PRIORITY
- priority
);
1008 named_section_flags (section
, SECTION_WRITE
);
1009 assemble_align (POINTER_SIZE
);
1010 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1013 #ifdef DTORS_SECTION_ASM_OP
1015 dtors_section (void)
1017 if (in_section
!= in_dtors
)
1019 in_section
= in_dtors
;
1020 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
1021 fputc ('\n', asm_out_file
);
1026 default_dtor_section_asm_out_destructor (rtx symbol
,
1027 int priority ATTRIBUTE_UNUSED
)
1030 assemble_align (POINTER_SIZE
);
1031 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1035 /* Likewise for global constructors. */
1038 default_stabs_asm_out_constructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
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 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
1044 assemble_name (asm_out_file
, XSTR (symbol
, 0));
1045 fputc ('\n', asm_out_file
);
1049 default_named_section_asm_out_constructor (rtx symbol
, int priority
)
1051 const char *section
= ".ctors";
1054 /* ??? This only works reliably with the GNU linker. */
1055 if (priority
!= DEFAULT_INIT_PRIORITY
)
1057 sprintf (buf
, ".ctors.%.5u",
1058 /* Invert the numbering so the linker puts us in the proper
1059 order; constructors are run from right to left, and the
1060 linker sorts in increasing order. */
1061 MAX_INIT_PRIORITY
- priority
);
1065 named_section_flags (section
, SECTION_WRITE
);
1066 assemble_align (POINTER_SIZE
);
1067 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1070 #ifdef CTORS_SECTION_ASM_OP
1072 ctors_section (void)
1074 if (in_section
!= in_ctors
)
1076 in_section
= in_ctors
;
1077 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1078 fputc ('\n', asm_out_file
);
1083 default_ctor_section_asm_out_constructor (rtx symbol
,
1084 int priority ATTRIBUTE_UNUSED
)
1087 assemble_align (POINTER_SIZE
);
1088 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1092 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1093 a nonzero value if the constant pool should be output before the
1094 start of the function, or a zero value if the pool should output
1095 after the end of the function. The default is to put it before the
1098 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1099 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1102 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
1103 to be output to assembler.
1104 Set first_global_object_name and weak_global_object_name as appropriate. */
1107 notice_global_symbol (tree decl
)
1109 const char **type
= &first_global_object_name
;
1111 if (first_global_object_name
1112 || !TREE_PUBLIC (decl
) || DECL_EXTERNAL (decl
)
1113 || !DECL_NAME (decl
)
1114 || (TREE_CODE (decl
) != FUNCTION_DECL
1115 && (TREE_CODE (decl
) != VAR_DECL
1116 || (DECL_COMMON (decl
)
1117 && (DECL_INITIAL (decl
) == 0
1118 || DECL_INITIAL (decl
) == error_mark_node
))))
1119 || !MEM_P (DECL_RTL (decl
)))
1122 /* We win when global object is found, but it is useful to know about weak
1123 symbol as well so we can produce nicer unique names. */
1124 if (DECL_WEAK (decl
) || DECL_ONE_ONLY (decl
))
1125 type
= &weak_global_object_name
;
1131 rtx decl_rtl
= DECL_RTL (decl
);
1133 p
= targetm
.strip_name_encoding (XSTR (XEXP (decl_rtl
, 0), 0));
1140 /* Output assembler code for the constant pool of a function and associated
1141 with defining the name of the function. DECL describes the function.
1142 NAME is the function's name. For the constant pool, we use the current
1143 constant pool data. */
1146 assemble_start_function (tree decl
, const char *fnname
)
1150 if (unlikely_text_section_name
)
1151 free (unlikely_text_section_name
);
1153 unlikely_section_label_printed
= false;
1154 unlikely_text_section_name
= NULL
;
1156 if (unlikely_section_label
)
1157 free (unlikely_section_label
);
1158 unlikely_section_label
= xmalloc ((strlen (fnname
) + 18) * sizeof (char));
1159 sprintf (unlikely_section_label
, "%s_unlikely_section", fnname
);
1161 /* The following code does not need preprocessing in the assembler. */
1165 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1166 output_constant_pool (fnname
, decl
);
1168 /* Make sure the cold text (code) section is properly aligned. This
1169 is necessary here in the case where the function has both hot and
1170 cold sections, because we don't want to re-set the alignment when the
1171 section switch happens mid-function. We don't need to set the hot
1172 section alignment here, because code further down in this function
1173 sets the alignment for whichever section comes first, and if there
1174 is a hot section it is guaranteed to be first. */
1176 if (flag_reorder_blocks_and_partition
)
1178 unlikely_text_section ();
1179 assemble_align (FUNCTION_BOUNDARY
);
1182 resolve_unique_section (decl
, 0, flag_function_sections
);
1183 function_section (decl
);
1185 /* Tell assembler to move to target machine's alignment for functions. */
1186 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1187 if (align
< force_align_functions_log
)
1188 align
= force_align_functions_log
;
1191 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1194 /* Handle a user-specified function alignment.
1195 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1196 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1197 if (align_functions_log
> align
1198 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1200 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1201 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1202 align_functions_log
, align_functions
- 1);
1204 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1208 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1209 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1212 (*debug_hooks
->begin_function
) (decl
);
1214 /* Make function name accessible from other files, if appropriate. */
1216 if (TREE_PUBLIC (decl
))
1218 notice_global_symbol (decl
);
1220 globalize_decl (decl
);
1222 maybe_assemble_visibility (decl
);
1225 /* Do any machine/system dependent processing of the function name. */
1226 #ifdef ASM_DECLARE_FUNCTION_NAME
1227 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1229 /* Standard thing is just output label for the function. */
1230 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1231 #endif /* ASM_DECLARE_FUNCTION_NAME */
1233 if (in_unlikely_text_section ()
1234 && !unlikely_section_label_printed
)
1236 ASM_OUTPUT_LABEL (asm_out_file
, unlikely_section_label
);
1237 unlikely_section_label_printed
= true;
1241 /* Output assembler code associated with defining the size of the
1242 function. DECL describes the function. NAME is the function's name. */
1245 assemble_end_function (tree decl
, const char *fnname
)
1247 #ifdef ASM_DECLARE_FUNCTION_SIZE
1248 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1250 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1252 output_constant_pool (fnname
, decl
);
1253 function_section (decl
); /* need to switch back */
1257 /* Assemble code to leave SIZE bytes of zeros. */
1260 assemble_zeros (unsigned HOST_WIDE_INT size
)
1262 /* Do no output if -fsyntax-only. */
1263 if (flag_syntax_only
)
1266 #ifdef ASM_NO_SKIP_IN_TEXT
1267 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1268 so we must output 0s explicitly in the text section. */
1269 if ((ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1270 || (ASM_NO_SKIP_IN_TEXT
&& in_unlikely_text_section ()))
1272 unsigned HOST_WIDE_INT i
;
1273 for (i
= 0; i
< size
; i
++)
1274 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1279 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1282 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1285 assemble_align (int align
)
1287 if (align
> BITS_PER_UNIT
)
1289 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1293 /* Assemble a string constant with the specified C string as contents. */
1296 assemble_string (const char *p
, int size
)
1301 /* If the string is very long, split it up. */
1305 int thissize
= size
- pos
;
1306 if (thissize
> maximum
)
1309 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1317 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1318 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1319 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1321 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1322 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1323 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1325 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1326 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1330 #if defined ASM_OUTPUT_ALIGNED_BSS
1331 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1332 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1334 #if defined ASM_OUTPUT_BSS
1335 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1336 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1342 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1343 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1344 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1346 #if defined ASM_OUTPUT_ALIGNED_COMMON
1347 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1348 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1350 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1351 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1356 asm_emit_uninitialised (tree decl
, const char *name
,
1357 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
1358 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
)
1366 destination
= asm_dest_local
;
1368 /* ??? We should handle .bss via select_section mechanisms rather than
1369 via special target hooks. That would eliminate this special case. */
1370 if (TREE_PUBLIC (decl
))
1372 if (!DECL_COMMON (decl
))
1374 destination
= asm_dest_bss
;
1379 destination
= asm_dest_common
;
1382 if (destination
== asm_dest_bss
)
1383 globalize_decl (decl
);
1384 resolve_unique_section (decl
, 0, flag_data_sections
);
1386 if (flag_shared_data
)
1388 switch (destination
)
1390 #ifdef ASM_OUTPUT_SHARED_BSS
1392 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1395 #ifdef ASM_OUTPUT_SHARED_COMMON
1396 case asm_dest_common
:
1397 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1400 #ifdef ASM_OUTPUT_SHARED_LOCAL
1401 case asm_dest_local
:
1402 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1410 switch (destination
)
1414 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1417 case asm_dest_common
:
1418 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1420 case asm_dest_local
:
1421 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1430 /* Assemble everything that is needed for a variable or function declaration.
1431 Not used for automatic variables, and not used for function definitions.
1432 Should not be called for variables of incomplete structure type.
1434 TOP_LEVEL is nonzero if this variable has file scope.
1435 AT_END is nonzero if this is the special handling, at end of compilation,
1436 to define things that have had only tentative definitions.
1437 DONT_OUTPUT_DATA if nonzero means don't actually output the
1438 initial value (that will be done by the caller). */
1441 assemble_variable (tree decl
, int top_level ATTRIBUTE_UNUSED
,
1442 int at_end ATTRIBUTE_UNUSED
, int dont_output_data
)
1449 if (lang_hooks
.decls
.prepare_assemble_variable
)
1450 lang_hooks
.decls
.prepare_assemble_variable (decl
);
1452 last_assemble_variable_decl
= 0;
1454 /* Normally no need to say anything here for external references,
1455 since assemble_external is called by the language-specific code
1456 when a declaration is first seen. */
1458 if (DECL_EXTERNAL (decl
))
1461 /* Output no assembler code for a function declaration.
1462 Only definitions of functions output anything. */
1464 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1467 /* Do nothing for global register variables. */
1468 if (DECL_RTL_SET_P (decl
) && REG_P (DECL_RTL (decl
)))
1470 TREE_ASM_WRITTEN (decl
) = 1;
1474 /* If type was incomplete when the variable was declared,
1475 see if it is complete now. */
1477 if (DECL_SIZE (decl
) == 0)
1478 layout_decl (decl
, 0);
1480 /* Still incomplete => don't allocate it; treat the tentative defn
1481 (which is what it must have been) as an `extern' reference. */
1483 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1485 error ("%Jstorage size of `%D' isn't known", decl
, decl
);
1486 TREE_ASM_WRITTEN (decl
) = 1;
1490 /* The first declaration of a variable that comes through this function
1491 decides whether it is global (in C, has external linkage)
1492 or local (in C, has internal linkage). So do nothing more
1493 if this function has already run. */
1495 if (TREE_ASM_WRITTEN (decl
))
1498 /* Make sure targetm.encode_section_info is invoked before we set
1500 decl_rtl
= DECL_RTL (decl
);
1502 TREE_ASM_WRITTEN (decl
) = 1;
1504 /* Do no output if -fsyntax-only. */
1505 if (flag_syntax_only
)
1510 if (! dont_output_data
1511 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1513 error ("%Jsize of variable '%D' is too large", decl
, decl
);
1517 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1518 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1519 notice_global_symbol (decl
);
1521 /* Compute the alignment of this data. */
1523 align
= DECL_ALIGN (decl
);
1525 /* In the case for initialing an array whose length isn't specified,
1526 where we have not yet been able to do the layout,
1527 figure out the proper alignment now. */
1528 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1529 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1530 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1532 /* Some object file formats have a maximum alignment which they support.
1533 In particular, a.out format supports a maximum alignment of 4. */
1534 #ifndef MAX_OFILE_ALIGNMENT
1535 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1537 if (align
> MAX_OFILE_ALIGNMENT
)
1539 warning ("%Jalignment of '%D' is greater than maximum object "
1540 "file alignment. Using %d", decl
, decl
,
1541 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1542 align
= MAX_OFILE_ALIGNMENT
;
1545 /* On some machines, it is good to increase alignment sometimes. */
1546 if (! DECL_USER_ALIGN (decl
))
1548 #ifdef DATA_ALIGNMENT
1549 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1551 #ifdef CONSTANT_ALIGNMENT
1552 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1553 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1557 /* Reset the alignment in case we have made it tighter, so we can benefit
1558 from it in get_pointer_alignment. */
1559 DECL_ALIGN (decl
) = align
;
1560 set_mem_align (decl_rtl
, align
);
1562 if (TREE_PUBLIC (decl
))
1563 maybe_assemble_visibility (decl
);
1565 /* Output any data that we will need to use the address of. */
1566 if (DECL_INITIAL (decl
) == error_mark_node
)
1567 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1568 else if (DECL_INITIAL (decl
))
1570 reloc
= compute_reloc_for_constant (DECL_INITIAL (decl
));
1571 output_addressed_constants (DECL_INITIAL (decl
));
1573 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1575 /* Handle uninitialized definitions. */
1577 /* If the decl has been given an explicit section name, then it
1578 isn't common, and shouldn't be handled as such. */
1579 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1581 /* We don't implement common thread-local data at present. */
1582 else if (DECL_THREAD_LOCAL (decl
))
1584 if (DECL_COMMON (decl
))
1585 sorry ("thread-local COMMON data not implemented");
1587 else if (DECL_INITIAL (decl
) == 0
1588 || DECL_INITIAL (decl
) == error_mark_node
1589 || (flag_zero_initialized_in_bss
1590 /* Leave constant zeroes in .rodata so they can be shared. */
1591 && !TREE_READONLY (decl
)
1592 && initializer_zerop (DECL_INITIAL (decl
))))
1594 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1595 unsigned HOST_WIDE_INT rounded
= size
;
1597 /* Don't allocate zero bytes of common,
1598 since that means "undefined external" in the linker. */
1602 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1603 so that each uninitialized object starts on such a boundary. */
1604 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1605 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1606 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1608 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1609 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1610 warning ("%Jrequested alignment for '%D' is greater than "
1611 "implemented alignment of %d", decl
, decl
, rounded
);
1614 /* If the target cannot output uninitialized but not common global data
1615 in .bss, then we have to use .data, so fall through. */
1616 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1620 /* Handle initialized definitions.
1621 Also handle uninitialized global definitions if -fno-common and the
1622 target doesn't support ASM_OUTPUT_BSS. */
1624 /* First make the assembler name(s) global if appropriate. */
1625 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1626 globalize_decl (decl
);
1628 /* Switch to the appropriate section. */
1629 variable_section (decl
, reloc
);
1631 /* dbxout.c needs to know this. */
1632 if (in_text_section () || in_unlikely_text_section ())
1633 DECL_IN_TEXT_SECTION (decl
) = 1;
1635 /* Output the alignment of this data. */
1636 if (align
> BITS_PER_UNIT
)
1638 ASM_OUTPUT_ALIGN (asm_out_file
,
1639 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1642 /* Do any machine/system dependent processing of the object. */
1643 #ifdef ASM_DECLARE_OBJECT_NAME
1644 last_assemble_variable_decl
= decl
;
1645 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1647 /* Standard thing is just output label for the object. */
1648 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1649 #endif /* ASM_DECLARE_OBJECT_NAME */
1651 if (!dont_output_data
)
1653 if (DECL_INITIAL (decl
)
1654 && DECL_INITIAL (decl
) != error_mark_node
1655 && !initializer_zerop (DECL_INITIAL (decl
)))
1656 /* Output the actual data. */
1657 output_constant (DECL_INITIAL (decl
),
1658 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1661 /* Leave space for it. */
1662 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1666 /* Return 1 if type TYPE contains any pointers. */
1669 contains_pointers_p (tree type
)
1671 switch (TREE_CODE (type
))
1674 case REFERENCE_TYPE
:
1675 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1676 so I'll play safe and return 1. */
1682 case QUAL_UNION_TYPE
:
1685 /* For a type that has fields, see if the fields have pointers. */
1686 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1687 if (TREE_CODE (fields
) == FIELD_DECL
1688 && contains_pointers_p (TREE_TYPE (fields
)))
1694 /* An array type contains pointers if its element type does. */
1695 return contains_pointers_p (TREE_TYPE (type
));
1702 #ifdef ASM_OUTPUT_EXTERNAL
1703 /* True if DECL is a function decl for which no out-of-line copy exists.
1704 It is assumed that DECL's assembler name has been set. */
1707 incorporeal_function_p (tree decl
)
1709 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_BUILT_IN (decl
))
1713 if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1714 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_ALLOCA
)
1717 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
1718 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
1725 /* Output something to declare an external symbol to the assembler.
1726 (Most assemblers don't need this, so we normally output nothing.)
1727 Do nothing if DECL is not external. */
1730 assemble_external (tree decl ATTRIBUTE_UNUSED
)
1732 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1733 main body of this code is only rarely exercised. To provide some
1734 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1735 open. If it's not, we should not be calling this function. */
1739 #ifdef ASM_OUTPUT_EXTERNAL
1740 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1742 rtx rtl
= DECL_RTL (decl
);
1744 if (MEM_P (rtl
) && GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1745 && !SYMBOL_REF_USED (XEXP (rtl
, 0))
1746 && !incorporeal_function_p (decl
))
1748 /* Some systems do require some output. */
1749 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1750 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1756 /* Similar, for calling a library function FUN. */
1759 assemble_external_libcall (rtx fun
)
1761 /* Declare library function name external when first used, if nec. */
1762 if (! SYMBOL_REF_USED (fun
))
1764 SYMBOL_REF_USED (fun
) = 1;
1765 targetm
.asm_out
.external_libcall (fun
);
1769 /* Assemble a label named NAME. */
1772 assemble_label (const char *name
)
1774 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1777 /* Set the symbol_referenced flag for ID. */
1779 mark_referenced (tree id
)
1781 TREE_SYMBOL_REFERENCED (id
) = 1;
1784 /* Set the symbol_referenced flag for DECL and notify callgraph. */
1786 mark_decl_referenced (tree decl
)
1788 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1789 cgraph_mark_needed_node (cgraph_node (decl
));
1790 else if (TREE_CODE (decl
) == VAR_DECL
)
1791 cgraph_varpool_mark_needed_node (cgraph_varpool_node (decl
));
1792 /* else do nothing - we can get various sorts of CST nodes here,
1793 which do not need to be marked. */
1796 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1797 If NAME starts with a *, the rest of NAME is output verbatim.
1798 Otherwise NAME is transformed in an implementation-defined way
1799 (usually by the addition of an underscore).
1800 Many macros in the tm file are defined to call this function. */
1803 assemble_name (FILE *file
, const char *name
)
1805 const char *real_name
;
1808 real_name
= targetm
.strip_name_encoding (name
);
1810 id
= maybe_get_identifier (real_name
);
1812 mark_referenced (id
);
1815 fputs (&name
[1], file
);
1817 ASM_OUTPUT_LABELREF (file
, name
);
1820 /* Allocate SIZE bytes writable static space with a gensym name
1821 and return an RTX to refer to its address. */
1824 assemble_static_space (unsigned HOST_WIDE_INT size
)
1827 const char *namestring
;
1831 if (flag_shared_data
)
1835 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1837 namestring
= ggc_strdup (name
);
1839 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1840 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
1842 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1843 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1846 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1847 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1850 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1851 so that each uninitialized object starts on such a boundary. */
1852 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1853 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1854 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1855 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1856 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1857 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1864 /* Assemble the static constant template for function entry trampolines.
1865 This is done at most once per compilation.
1866 Returns an RTX for the address of the template. */
1868 static GTY(()) rtx initial_trampoline
;
1870 #ifdef TRAMPOLINE_TEMPLATE
1872 assemble_trampoline_template (void)
1879 if (initial_trampoline
)
1880 return initial_trampoline
;
1882 /* By default, put trampoline templates in read-only data section. */
1884 #ifdef TRAMPOLINE_SECTION
1885 TRAMPOLINE_SECTION ();
1887 readonly_data_section ();
1890 /* Write the assembler code to define one. */
1891 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1894 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1897 targetm
.asm_out
.internal_label (asm_out_file
, "LTRAMP", 0);
1898 TRAMPOLINE_TEMPLATE (asm_out_file
);
1900 /* Record the rtl to refer to it. */
1901 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1902 name
= ggc_strdup (label
);
1903 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
1904 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
1906 initial_trampoline
= gen_rtx_MEM (BLKmode
, symbol
);
1907 set_mem_align (initial_trampoline
, TRAMPOLINE_ALIGNMENT
);
1909 return initial_trampoline
;
1913 /* A and B are either alignments or offsets. Return the minimum alignment
1914 that may be assumed after adding the two together. */
1916 static inline unsigned
1917 min_align (unsigned int a
, unsigned int b
)
1919 return (a
| b
) & -(a
| b
);
1922 /* Return the assembler directive for creating a given kind of integer
1923 object. SIZE is the number of bytes in the object and ALIGNED_P
1924 indicates whether it is known to be aligned. Return NULL if the
1925 assembly dialect has no such directive.
1927 The returned string should be printed at the start of a new line and
1928 be followed immediately by the object's initial value. */
1931 integer_asm_op (int size
, int aligned_p
)
1933 struct asm_int_op
*ops
;
1936 ops
= &targetm
.asm_out
.aligned_op
;
1938 ops
= &targetm
.asm_out
.unaligned_op
;
1943 return targetm
.asm_out
.byte_op
;
1957 /* Use directive OP to assemble an integer object X. Print OP at the
1958 start of the line, followed immediately by the value of X. */
1961 assemble_integer_with_op (const char *op
, rtx x
)
1963 fputs (op
, asm_out_file
);
1964 output_addr_const (asm_out_file
, x
);
1965 fputc ('\n', asm_out_file
);
1968 /* The default implementation of the asm_out.integer target hook. */
1971 default_assemble_integer (rtx x ATTRIBUTE_UNUSED
,
1972 unsigned int size ATTRIBUTE_UNUSED
,
1973 int aligned_p ATTRIBUTE_UNUSED
)
1975 const char *op
= integer_asm_op (size
, aligned_p
);
1976 return op
&& (assemble_integer_with_op (op
, x
), true);
1979 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1980 the alignment of the integer in bits. Return 1 if we were able to output
1981 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1985 assemble_integer (rtx x
, unsigned int size
, unsigned int align
, int force
)
1989 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
1991 /* See if the target hook can handle this kind of object. */
1992 if (targetm
.asm_out
.integer (x
, size
, aligned_p
))
1995 /* If the object is a multi-byte one, try splitting it up. Split
1996 it into words it if is multi-word, otherwise split it into bytes. */
1999 enum machine_mode omode
, imode
;
2000 unsigned int subalign
;
2001 unsigned int subsize
, i
;
2003 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
2004 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
2005 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
2006 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
2008 for (i
= 0; i
< size
; i
+= subsize
)
2010 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
2011 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
2017 /* If we've printed some of it, but not all of it, there's no going
2030 assemble_real (REAL_VALUE_TYPE d
, enum machine_mode mode
, unsigned int align
)
2034 int bitsize
, nelts
, nunits
, units_per
;
2036 /* This is hairy. We have a quantity of known size. real_to_target
2037 will put it into an array of *host* longs, 32 bits per element
2038 (even if long is more than 32 bits). We need to determine the
2039 number of array elements that are occupied (nelts) and the number
2040 of *target* min-addressable units that will be occupied in the
2041 object file (nunits). We cannot assume that 32 divides the
2042 mode's bitsize (size * BITS_PER_UNIT) evenly.
2044 size * BITS_PER_UNIT is used here to make sure that padding bits
2045 (which might appear at either end of the value; real_to_target
2046 will include the padding bits in its output array) are included. */
2048 nunits
= GET_MODE_SIZE (mode
);
2049 bitsize
= nunits
* BITS_PER_UNIT
;
2050 nelts
= CEIL (bitsize
, 32);
2051 units_per
= 32 / BITS_PER_UNIT
;
2053 real_to_target (data
, &d
, mode
);
2055 /* Put out the first word with the specified alignment. */
2056 assemble_integer (GEN_INT (data
[0]), MIN (nunits
, units_per
), align
, 1);
2057 nunits
-= units_per
;
2059 /* Subsequent words need only 32-bit alignment. */
2060 align
= min_align (align
, 32);
2062 for (i
= 1; i
< nelts
; i
++)
2064 assemble_integer (GEN_INT (data
[i
]), MIN (nunits
, units_per
), align
, 1);
2065 nunits
-= units_per
;
2069 /* Given an expression EXP with a constant value,
2070 reduce it to the sum of an assembler symbol and an integer.
2071 Store them both in the structure *VALUE.
2072 Abort if EXP does not reduce. */
2074 struct addr_const
GTY(())
2077 HOST_WIDE_INT offset
;
2081 decode_addr_const (tree exp
, struct addr_const
*value
)
2083 tree target
= TREE_OPERAND (exp
, 0);
2089 if (TREE_CODE (target
) == COMPONENT_REF
2090 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2093 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2094 target
= TREE_OPERAND (target
, 0);
2096 else if (TREE_CODE (target
) == ARRAY_REF
2097 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2099 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2100 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2101 target
= TREE_OPERAND (target
, 0);
2107 switch (TREE_CODE (target
))
2111 x
= DECL_RTL (target
);
2115 x
= gen_rtx_MEM (FUNCTION_MODE
,
2116 gen_rtx_LABEL_REF (VOIDmode
, force_label_rtx (target
)));
2124 x
= output_constant_def (target
, 1);
2136 value
->offset
= offset
;
2139 /* Uniquize all constants that appear in memory.
2140 Each constant in memory thus far output is recorded
2141 in `const_desc_table'. */
2143 struct constant_descriptor_tree
GTY(())
2145 /* A MEM for the constant. */
2148 /* The value of the constant. */
2152 static GTY((param_is (struct constant_descriptor_tree
)))
2153 htab_t const_desc_htab
;
2155 static struct constant_descriptor_tree
* build_constant_desc (tree
);
2156 static void maybe_output_constant_def_contents (struct constant_descriptor_tree
*, int);
2158 /* Compute a hash code for a constant expression. */
2161 const_desc_hash (const void *ptr
)
2163 return const_hash_1 (((struct constant_descriptor_tree
*)ptr
)->value
);
2167 const_hash_1 (const tree exp
)
2172 enum tree_code code
= TREE_CODE (exp
);
2174 /* Either set P and LEN to the address and len of something to hash and
2175 exit the switch or return a value. */
2180 p
= (char *) &TREE_INT_CST (exp
);
2181 len
= sizeof TREE_INT_CST (exp
);
2185 return real_hash (TREE_REAL_CST_PTR (exp
));
2188 p
= TREE_STRING_POINTER (exp
);
2189 len
= TREE_STRING_LENGTH (exp
);
2193 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2194 + const_hash_1 (TREE_IMAGPART (exp
)));
2197 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2201 len
= int_size_in_bytes (TREE_TYPE (exp
));
2203 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2211 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2213 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2214 if (TREE_VALUE (link
))
2215 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2223 struct addr_const value
;
2225 decode_addr_const (exp
, &value
);
2226 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2228 /* Don't hash the address of the SYMBOL_REF;
2229 only use the offset and the symbol name. */
2231 p
= XSTR (value
.base
, 0);
2232 for (i
= 0; p
[i
] != 0; i
++)
2233 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2235 else if (GET_CODE (value
.base
) == LABEL_REF
)
2236 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2244 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2245 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2249 case NON_LVALUE_EXPR
:
2250 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2253 /* A language specific constant. Just hash the code. */
2257 /* Compute hashing function. */
2259 for (i
= 0; i
< len
; i
++)
2260 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2265 /* Wrapper of compare_constant, for the htab interface. */
2267 const_desc_eq (const void *p1
, const void *p2
)
2269 return compare_constant (((struct constant_descriptor_tree
*)p1
)->value
,
2270 ((struct constant_descriptor_tree
*)p2
)->value
);
2273 /* Compare t1 and t2, and return 1 only if they are known to result in
2274 the same bit pattern on output. */
2277 compare_constant (const tree t1
, const tree t2
)
2279 enum tree_code typecode
;
2281 if (t1
== NULL_TREE
)
2282 return t2
== NULL_TREE
;
2283 if (t2
== NULL_TREE
)
2286 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2289 switch (TREE_CODE (t1
))
2292 /* Integer constants are the same only if the same width of type. */
2293 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2295 return tree_int_cst_equal (t1
, t2
);
2298 /* Real constants are the same only if the same width of type. */
2299 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2302 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2305 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2308 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2309 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2310 TREE_STRING_LENGTH (t1
)));
2313 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2314 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2317 typecode
= TREE_CODE (TREE_TYPE (t1
));
2318 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2321 if (typecode
== SET_TYPE
)
2323 int len
= int_size_in_bytes (TREE_TYPE (t2
));
2324 unsigned char *tmp1
, *tmp2
;
2326 if (int_size_in_bytes (TREE_TYPE (t1
)) != len
)
2329 tmp1
= alloca (len
);
2330 tmp2
= alloca (len
);
2332 if (get_set_constructor_bytes (t1
, tmp1
, len
) != NULL_TREE
)
2334 if (get_set_constructor_bytes (t2
, tmp2
, len
) != NULL_TREE
)
2337 return memcmp (tmp1
, tmp2
, len
) == 0;
2343 if (typecode
== ARRAY_TYPE
)
2345 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2346 /* For arrays, check that the sizes all match. */
2347 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2349 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2354 /* For record and union constructors, require exact type
2356 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2360 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2362 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2364 /* Check that each value is the same... */
2365 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2367 /* ... and that they apply to the same fields! */
2368 if (typecode
== ARRAY_TYPE
)
2370 if (! compare_constant (TREE_PURPOSE (l1
),
2376 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2381 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2387 struct addr_const value1
, value2
;
2389 decode_addr_const (t1
, &value1
);
2390 decode_addr_const (t2
, &value2
);
2391 return (value1
.offset
== value2
.offset
2392 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2398 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2399 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2403 case NON_LVALUE_EXPR
:
2404 case VIEW_CONVERT_EXPR
:
2405 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2410 nt1
= lang_hooks
.expand_constant (t1
);
2411 nt2
= lang_hooks
.expand_constant (t2
);
2412 if (nt1
!= t1
|| nt2
!= t2
)
2413 return compare_constant (nt1
, nt2
);
2419 /* Should not get here. */
2423 /* Make a copy of the whole tree structure for a constant. This
2424 handles the same types of nodes that compare_constant handles. */
2427 copy_constant (tree exp
)
2429 switch (TREE_CODE (exp
))
2432 /* For ADDR_EXPR, we do not want to copy the decl whose address
2433 is requested. We do want to copy constants though. */
2434 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2435 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2436 copy_constant (TREE_OPERAND (exp
, 0)));
2438 return copy_node (exp
);
2443 return copy_node (exp
);
2446 return build_complex (TREE_TYPE (exp
),
2447 copy_constant (TREE_REALPART (exp
)),
2448 copy_constant (TREE_IMAGPART (exp
)));
2452 return build2 (TREE_CODE (exp
), TREE_TYPE (exp
),
2453 copy_constant (TREE_OPERAND (exp
, 0)),
2454 copy_constant (TREE_OPERAND (exp
, 1)));
2458 case NON_LVALUE_EXPR
:
2459 case VIEW_CONVERT_EXPR
:
2460 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2461 copy_constant (TREE_OPERAND (exp
, 0)));
2465 tree copy
= copy_node (exp
);
2466 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2469 CONSTRUCTOR_ELTS (copy
) = list
;
2470 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2471 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2472 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2473 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2474 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2482 t
= lang_hooks
.expand_constant (exp
);
2484 return copy_constant (t
);
2491 /* Subroutine of output_constant_def:
2492 No constant equal to EXP is known to have been output.
2493 Make a constant descriptor to enter EXP in the hash table.
2494 Assign the label number and construct RTL to refer to the
2495 constant's location in memory.
2496 Caller is responsible for updating the hash table. */
2498 static struct constant_descriptor_tree
*
2499 build_constant_desc (tree exp
)
2505 struct constant_descriptor_tree
*desc
;
2507 desc
= ggc_alloc (sizeof (*desc
));
2508 desc
->value
= copy_constant (exp
);
2510 /* Propagate marked-ness to copied constant. */
2511 if (flag_mudflap
&& mf_marked_p (exp
))
2512 mf_mark (desc
->value
);
2514 /* Create a string containing the label name, in LABEL. */
2515 labelno
= const_labelno
++;
2516 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2518 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2519 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2520 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2521 SYMBOL_REF_DECL (symbol
) = desc
->value
;
2522 TREE_CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2524 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2525 set_mem_attributes (rtl
, exp
, 1);
2526 set_mem_alias_set (rtl
, 0);
2527 set_mem_alias_set (rtl
, const_alias_set
);
2529 /* Set flags or add text to the name to record information, such as
2530 that it is a local symbol. If the name is changed, the macro
2531 ASM_OUTPUT_LABELREF will have to know how to strip this
2532 information. This call might invalidate our local variable
2533 SYMBOL; we can't use it afterward. */
2535 targetm
.encode_section_info (exp
, rtl
, true);
2542 /* Return an rtx representing a reference to constant data in memory
2543 for the constant expression EXP.
2545 If assembler code for such a constant has already been output,
2546 return an rtx to refer to it.
2547 Otherwise, output such a constant in memory
2548 and generate an rtx for it.
2550 If DEFER is nonzero, this constant can be deferred and output only
2551 if referenced in the function after all optimizations.
2553 `const_desc_table' records which constants already have label strings. */
2556 output_constant_def (tree exp
, int defer
)
2558 struct constant_descriptor_tree
*desc
;
2559 struct constant_descriptor_tree key
;
2562 /* Look up EXP in the table of constant descriptors. If we didn't find
2563 it, create a new one. */
2565 loc
= htab_find_slot (const_desc_htab
, &key
, INSERT
);
2570 desc
= build_constant_desc (exp
);
2574 maybe_output_constant_def_contents (desc
, defer
);
2578 /* Subroutine of output_constant_def: Decide whether or not we need to
2579 output the constant DESC now, and if so, do it. */
2581 maybe_output_constant_def_contents (struct constant_descriptor_tree
*desc
,
2584 rtx symbol
= XEXP (desc
->rtl
, 0);
2585 tree exp
= desc
->value
;
2587 if (flag_syntax_only
)
2590 if (TREE_ASM_WRITTEN (exp
))
2591 /* Already output; don't do it again. */
2594 /* We can always defer constants as long as the context allows
2598 /* Increment n_deferred_constants if it exists. It needs to be at
2599 least as large as the number of constants actually referred to
2600 by the function. If it's too small we'll stop looking too early
2601 and fail to emit constants; if it's too large we'll only look
2602 through the entire function when we could have stopped earlier. */
2604 n_deferred_constants
++;
2608 output_constant_def_contents (symbol
);
2611 /* We must output the constant data referred to by SYMBOL; do so. */
2614 output_constant_def_contents (rtx symbol
)
2616 tree exp
= SYMBOL_REF_DECL (symbol
);
2617 const char *label
= XSTR (symbol
, 0);
2620 /* Make sure any other constants whose addresses appear in EXP
2621 are assigned label numbers. */
2622 int reloc
= compute_reloc_for_constant (exp
);
2624 /* Align the location counter as required by EXP's data type. */
2625 int align
= TYPE_ALIGN (TREE_TYPE (exp
));
2626 #ifdef CONSTANT_ALIGNMENT
2627 align
= CONSTANT_ALIGNMENT (exp
, align
);
2630 output_addressed_constants (exp
);
2632 /* We are no longer deferring this constant. */
2633 TREE_ASM_WRITTEN (exp
) = 1;
2635 if (IN_NAMED_SECTION (exp
))
2636 named_section (exp
, NULL
, reloc
);
2638 targetm
.asm_out
.select_section (exp
, reloc
, align
);
2640 if (align
> BITS_PER_UNIT
)
2642 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2645 size
= int_size_in_bytes (TREE_TYPE (exp
));
2646 if (TREE_CODE (exp
) == STRING_CST
)
2647 size
= MAX (TREE_STRING_LENGTH (exp
), size
);
2649 /* Do any machine/system dependent processing of the constant. */
2650 #ifdef ASM_DECLARE_CONSTANT_NAME
2651 ASM_DECLARE_CONSTANT_NAME (asm_out_file
, label
, exp
, size
);
2653 /* Standard thing is just output label for the constant. */
2654 ASM_OUTPUT_LABEL (asm_out_file
, label
);
2655 #endif /* ASM_DECLARE_CONSTANT_NAME */
2657 /* Output the value of EXP. */
2658 output_constant (exp
, size
, align
);
2660 mudflap_enqueue_constant (exp
);
2663 /* Look up EXP in the table of constant descriptors. Return the rtl
2664 if it has been emitted, else null. */
2667 lookup_constant_def (tree exp
)
2669 struct constant_descriptor_tree
*desc
;
2670 struct constant_descriptor_tree key
;
2673 desc
= htab_find (const_desc_htab
, &key
);
2675 return (desc
? desc
->rtl
: NULL_RTX
);
2678 /* Used in the hash tables to avoid outputting the same constant
2679 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2680 are output once per function, not once per file. */
2681 /* ??? Only a few targets need per-function constant pools. Most
2682 can use one per-file pool. Should add a targetm bit to tell the
2685 struct rtx_constant_pool
GTY(())
2687 /* Pointers to first and last constant in pool, as ordered by offset. */
2688 struct constant_descriptor_rtx
*first
;
2689 struct constant_descriptor_rtx
*last
;
2691 /* Hash facility for making memory-constants from constant rtl-expressions.
2692 It is used on RISC machines where immediate integer arguments and
2693 constant addresses are restricted so that such constants must be stored
2695 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_htab
;
2696 htab_t
GTY((param_is (struct constant_descriptor_rtx
))) const_rtx_sym_htab
;
2698 /* Current offset in constant pool (does not include any
2699 machine-specific header). */
2700 HOST_WIDE_INT offset
;
2703 struct constant_descriptor_rtx
GTY((chain_next ("%h.next")))
2705 struct constant_descriptor_rtx
*next
;
2709 HOST_WIDE_INT offset
;
2711 enum machine_mode mode
;
2717 /* Hash and compare functions for const_rtx_htab. */
2720 const_desc_rtx_hash (const void *ptr
)
2722 const struct constant_descriptor_rtx
*desc
= ptr
;
2727 const_desc_rtx_eq (const void *a
, const void *b
)
2729 const struct constant_descriptor_rtx
*x
= a
;
2730 const struct constant_descriptor_rtx
*y
= b
;
2732 if (x
->mode
!= y
->mode
)
2734 return rtx_equal_p (x
->constant
, y
->constant
);
2737 /* Hash and compare functions for const_rtx_sym_htab. */
2740 const_desc_rtx_sym_hash (const void *ptr
)
2742 const struct constant_descriptor_rtx
*desc
= ptr
;
2743 return htab_hash_string (XSTR (desc
->sym
, 0));
2747 const_desc_rtx_sym_eq (const void *a
, const void *b
)
2749 const struct constant_descriptor_rtx
*x
= a
;
2750 const struct constant_descriptor_rtx
*y
= b
;
2751 return XSTR (x
->sym
, 0) == XSTR (y
->sym
, 0);
2754 /* This is the worker function for const_rtx_hash, called via for_each_rtx. */
2757 const_rtx_hash_1 (rtx
*xp
, void *data
)
2759 unsigned HOST_WIDE_INT hwi
;
2760 enum machine_mode mode
;
2766 code
= GET_CODE (x
);
2767 mode
= GET_MODE (x
);
2768 h
= (hashval_t
) code
* 1048573 + mode
;
2776 const int shift
= sizeof (hashval_t
) * CHAR_BIT
;
2777 const int n
= sizeof (HOST_WIDE_INT
) / sizeof (hashval_t
);
2780 h
^= (hashval_t
) hwi
;
2781 for (i
= 1; i
< n
; ++i
)
2784 h
^= (hashval_t
) hwi
;
2790 if (mode
== VOIDmode
)
2792 hwi
= CONST_DOUBLE_LOW (x
) ^ CONST_DOUBLE_HIGH (x
);
2796 h
^= real_hash (CONST_DOUBLE_REAL_VALUE (x
));
2800 h
^= htab_hash_string (XSTR (x
, 0));
2804 h
= h
* 251 + CODE_LABEL_NUMBER (XEXP (x
, 0));
2808 case UNSPEC_VOLATILE
:
2809 h
= h
* 251 + XINT (x
, 1);
2817 *hp
= *hp
* 509 + h
;
2821 /* Compute a hash value for X, which should be a constant. */
2824 const_rtx_hash (rtx x
)
2827 for_each_rtx (&x
, const_rtx_hash_1
, &h
);
2832 /* Initialize constant pool hashing for a new function. */
2835 init_varasm_status (struct function
*f
)
2837 struct varasm_status
*p
;
2838 struct rtx_constant_pool
*pool
;
2840 p
= ggc_alloc (sizeof (struct varasm_status
));
2843 pool
= ggc_alloc (sizeof (struct rtx_constant_pool
));
2845 p
->deferred_constants
= 0;
2847 pool
->const_rtx_htab
= htab_create_ggc (31, const_desc_rtx_hash
,
2848 const_desc_rtx_eq
, NULL
);
2849 pool
->const_rtx_sym_htab
= htab_create_ggc (31, const_desc_rtx_sym_hash
,
2850 const_desc_rtx_sym_eq
, NULL
);
2851 pool
->first
= pool
->last
= NULL
;
2855 /* Given a MINUS expression, simplify it if both sides
2856 include the same symbol. */
2859 simplify_subtraction (rtx x
)
2861 rtx r
= simplify_rtx (x
);
2865 /* Given a constant rtx X, make (or find) a memory constant for its value
2866 and return a MEM rtx to refer to it in memory. */
2869 force_const_mem (enum machine_mode mode
, rtx x
)
2871 struct constant_descriptor_rtx
*desc
, tmp
;
2872 struct rtx_constant_pool
*pool
= cfun
->varasm
->pool
;
2879 /* If we're not allowed to drop X into the constant pool, don't. */
2880 if (targetm
.cannot_force_const_mem (x
))
2883 /* Lookup the value in the hashtable. */
2886 hash
= const_rtx_hash (x
);
2887 slot
= htab_find_slot_with_hash (pool
->const_rtx_htab
, &tmp
, hash
, INSERT
);
2890 /* If the constant was already present, return its memory. */
2892 return copy_rtx (desc
->mem
);
2894 /* Otherwise, create a new descriptor. */
2895 desc
= ggc_alloc (sizeof (*desc
));
2898 /* Align the location counter as required by EXP's data type. */
2899 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
2900 #ifdef CONSTANT_ALIGNMENT
2902 tree type
= lang_hooks
.types
.type_for_mode (mode
, 0);
2903 if (type
!= NULL_TREE
)
2904 align
= CONSTANT_ALIGNMENT (make_tree (type
, x
), align
);
2908 pool
->offset
+= (align
/ BITS_PER_UNIT
) - 1;
2909 pool
->offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
2912 desc
->constant
= tmp
.constant
;
2913 desc
->offset
= pool
->offset
;
2916 desc
->align
= align
;
2917 desc
->labelno
= const_labelno
;
2920 pool
->offset
+= GET_MODE_SIZE (mode
);
2922 pool
->last
->next
= desc
;
2924 pool
->first
= pool
->last
= desc
;
2927 /* Create a string containing the label name, in LABEL. */
2928 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2931 /* Construct the SYMBOL_REF. Make sure to mark it as belonging to
2932 the constants pool. */
2933 desc
->sym
= symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2934 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2935 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2936 current_function_uses_const_pool
= 1;
2938 /* Insert the descriptor into the symbol cross-reference table too. */
2939 slot
= htab_find_slot (pool
->const_rtx_sym_htab
, desc
, INSERT
);
2944 /* Construct the MEM. */
2945 desc
->mem
= def
= gen_rtx_MEM (mode
, symbol
);
2946 set_mem_attributes (def
, lang_hooks
.types
.type_for_mode (mode
, 0), 1);
2947 RTX_UNCHANGING_P (def
) = 1;
2949 /* If we're dropping a label to the constant pool, make sure we
2951 if (GET_CODE (x
) == LABEL_REF
)
2952 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
2954 return copy_rtx (def
);
2957 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
2958 the corresponding constant_descriptor_rtx structure. */
2960 static struct constant_descriptor_rtx
*
2961 find_pool_constant (struct rtx_constant_pool
*pool
, rtx sym
)
2963 struct constant_descriptor_rtx tmp
;
2965 return htab_find (pool
->const_rtx_sym_htab
, &tmp
);
2968 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
2971 get_pool_constant (rtx addr
)
2973 return find_pool_constant (cfun
->varasm
->pool
, addr
)->constant
;
2976 /* Given a constant pool SYMBOL_REF, return the corresponding constant
2977 and whether it has been output or not. */
2980 get_pool_constant_mark (rtx addr
, bool *pmarked
)
2982 struct constant_descriptor_rtx
*desc
;
2984 desc
= find_pool_constant (cfun
->varasm
->pool
, addr
);
2985 *pmarked
= (desc
->mark
!= 0);
2986 return desc
->constant
;
2989 /* Likewise, but for the constant pool of a specific function. */
2992 get_pool_constant_for_function (struct function
*f
, rtx addr
)
2994 return find_pool_constant (f
->varasm
->pool
, addr
)->constant
;
2997 /* Similar, return the mode. */
3000 get_pool_mode (rtx addr
)
3002 return find_pool_constant (cfun
->varasm
->pool
, addr
)->mode
;
3006 get_pool_mode_for_function (struct function
*f
, rtx addr
)
3008 return find_pool_constant (f
->varasm
->pool
, addr
)->mode
;
3011 /* Similar, return the offset in the constant pool. */
3014 get_pool_offset (rtx addr
)
3016 return find_pool_constant (cfun
->varasm
->pool
, addr
)->offset
;
3019 /* Return the size of the constant pool. */
3022 get_pool_size (void)
3024 return cfun
->varasm
->pool
->offset
;
3027 /* Worker function for output_constant_pool_1. Emit assembly for X
3028 in MODE with known alignment ALIGN. */
3031 output_constant_pool_2 (enum machine_mode mode
, rtx x
, unsigned int align
)
3033 switch (GET_MODE_CLASS (mode
))
3036 if (GET_CODE (x
) != CONST_DOUBLE
)
3041 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3042 assemble_real (r
, mode
, align
);
3047 case MODE_PARTIAL_INT
:
3048 assemble_integer (x
, GET_MODE_SIZE (mode
), align
, 1);
3051 case MODE_VECTOR_FLOAT
:
3052 case MODE_VECTOR_INT
:
3055 enum machine_mode submode
= GET_MODE_INNER (mode
);
3056 unsigned int subalign
= MIN (align
, GET_MODE_BITSIZE (submode
));
3058 if (GET_CODE (x
) != CONST_VECTOR
)
3060 units
= CONST_VECTOR_NUNITS (x
);
3062 for (i
= 0; i
< units
; i
++)
3064 rtx elt
= CONST_VECTOR_ELT (x
, i
);
3065 output_constant_pool_2 (submode
, elt
, i
? subalign
: align
);
3075 /* Worker function for output_constant_pool. Emit POOL. */
3078 output_constant_pool_1 (struct constant_descriptor_rtx
*desc
)
3086 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3087 whose CODE_LABEL has been deleted. This can occur if a jump table
3088 is eliminated by optimization. If so, write a constant of zero
3089 instead. Note that this can also happen by turning the
3090 CODE_LABEL into a NOTE. */
3091 /* ??? This seems completely and utterly wrong. Certainly it's
3092 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3093 functioning even with INSN_DELETED_P and friends. */
3096 switch (GET_CODE (x
))
3099 if (GET_CODE (XEXP (x
, 0)) != PLUS
3100 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3102 tmp
= XEXP (XEXP (x
, 0), 0);
3107 if (INSN_DELETED_P (tmp
)
3109 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3120 /* First switch to correct section. */
3121 targetm
.asm_out
.select_rtx_section (desc
->mode
, x
, desc
->align
);
3123 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3124 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, desc
->mode
,
3125 desc
->align
, desc
->labelno
, done
);
3128 assemble_align (desc
->align
);
3130 /* Output the label. */
3131 targetm
.asm_out
.internal_label (asm_out_file
, "LC", desc
->labelno
);
3133 /* Output the data. */
3134 output_constant_pool_2 (desc
->mode
, x
, desc
->align
);
3136 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3137 sections have proper size. */
3138 if (desc
->align
> GET_MODE_BITSIZE (desc
->mode
)
3139 && in_section
== in_named
3140 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3141 assemble_align (desc
->align
);
3143 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3149 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3150 to as used. Emit referenced deferred strings. This function can
3151 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3154 mark_constant (rtx
*current_rtx
, void *data
)
3156 struct rtx_constant_pool
*pool
= data
;
3157 rtx x
= *current_rtx
;
3159 if (x
== NULL_RTX
|| GET_CODE (x
) != SYMBOL_REF
)
3162 if (CONSTANT_POOL_ADDRESS_P (x
))
3164 struct constant_descriptor_rtx
*desc
= find_pool_constant (pool
, x
);
3165 if (desc
->mark
== 0)
3168 for_each_rtx (&desc
->constant
, mark_constant
, pool
);
3171 else if (TREE_CONSTANT_POOL_ADDRESS_P (x
))
3173 tree exp
= SYMBOL_REF_DECL (x
);
3174 if (!TREE_ASM_WRITTEN (exp
))
3176 n_deferred_constants
--;
3177 output_constant_def_contents (x
);
3184 /* Look through appropriate parts of INSN, marking all entries in the
3185 constant pool which are actually being used. Entries that are only
3186 referenced by other constants are also marked as used. Emit
3187 deferred strings that are used. */
3190 mark_constants (struct rtx_constant_pool
*pool
, rtx insn
)
3195 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3196 insns, not any notes that may be attached. We don't want to mark
3197 a constant just because it happens to appear in a REG_EQUIV note. */
3198 if (GET_CODE (PATTERN (insn
)) == SEQUENCE
)
3200 rtx seq
= PATTERN (insn
);
3201 int i
, n
= XVECLEN (seq
, 0);
3202 for (i
= 0; i
< n
; ++i
)
3204 rtx subinsn
= XVECEXP (seq
, 0, i
);
3205 if (INSN_P (subinsn
))
3206 for_each_rtx (&PATTERN (subinsn
), mark_constant
, pool
);
3210 for_each_rtx (&PATTERN (insn
), mark_constant
, pool
);
3213 /* Look through the instructions for this function, and mark all the
3214 entries in POOL which are actually being used. Emit deferred constants
3215 which have indeed been used. */
3218 mark_constant_pool (struct rtx_constant_pool
*pool
)
3222 if (pool
->first
== 0 && n_deferred_constants
== 0)
3225 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3226 mark_constants (pool
, insn
);
3228 for (link
= current_function_epilogue_delay_list
;
3230 link
= XEXP (link
, 1))
3231 mark_constants (pool
, XEXP (link
, 0));
3234 /* Write all the constants in the constant pool. */
3237 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED
,
3238 tree fndecl ATTRIBUTE_UNUSED
)
3240 struct rtx_constant_pool
*pool
= cfun
->varasm
->pool
;
3241 struct constant_descriptor_rtx
*desc
;
3243 /* It is possible for gcc to call force_const_mem and then to later
3244 discard the instructions which refer to the constant. In such a
3245 case we do not need to output the constant. */
3246 mark_constant_pool (pool
);
3248 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3249 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3252 for (desc
= pool
->first
; desc
; desc
= desc
->next
)
3253 output_constant_pool_1 (desc
);
3255 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3256 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool
->offset
);
3260 /* Determine what kind of relocations EXP may need. */
3263 compute_reloc_for_constant (tree exp
)
3265 int reloc
= 0, reloc2
;
3268 /* Give the front-end a chance to convert VALUE to something that
3269 looks more like a constant to the back-end. */
3270 exp
= lang_hooks
.expand_constant (exp
);
3272 switch (TREE_CODE (exp
))
3276 /* Go inside any operations that get_inner_reference can handle and see
3277 if what's inside is a constant: no need to do anything here for
3278 addresses of variables or functions. */
3279 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3280 tem
= TREE_OPERAND (tem
, 0))
3283 if (TREE_PUBLIC (tem
))
3290 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3291 reloc
|= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3295 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3296 reloc2
= compute_reloc_for_constant (TREE_OPERAND (exp
, 1));
3297 /* The difference of two local labels is computable at link time. */
3298 if (reloc
== 1 && reloc2
== 1)
3306 case NON_LVALUE_EXPR
:
3307 reloc
= compute_reloc_for_constant (TREE_OPERAND (exp
, 0));
3311 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3312 if (TREE_VALUE (tem
) != 0)
3313 reloc
|= compute_reloc_for_constant (TREE_VALUE (tem
));
3323 /* Find all the constants whose addresses are referenced inside of EXP,
3324 and make sure assembler code with a label has been output for each one.
3325 Indicate whether an ADDR_EXPR has been encountered. */
3328 output_addressed_constants (tree exp
)
3332 /* Give the front-end a chance to convert VALUE to something that
3333 looks more like a constant to the back-end. */
3334 exp
= lang_hooks
.expand_constant (exp
);
3336 switch (TREE_CODE (exp
))
3340 /* Go inside any operations that get_inner_reference can handle and see
3341 if what's inside is a constant: no need to do anything here for
3342 addresses of variables or functions. */
3343 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3344 tem
= TREE_OPERAND (tem
, 0))
3347 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
3348 || TREE_CODE (tem
) == CONSTRUCTOR
)
3349 output_constant_def (tem
, 0);
3354 output_addressed_constants (TREE_OPERAND (exp
, 1));
3359 case NON_LVALUE_EXPR
:
3360 output_addressed_constants (TREE_OPERAND (exp
, 0));
3364 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3365 if (TREE_VALUE (tem
) != 0)
3366 output_addressed_constants (TREE_VALUE (tem
));
3375 /* Return nonzero if VALUE is a valid constant-valued expression
3376 for use in initializing a static variable; one that can be an
3377 element of a "constant" initializer.
3379 Return null_pointer_node if the value is absolute;
3380 if it is relocatable, return the variable that determines the relocation.
3381 We assume that VALUE has been folded as much as possible;
3382 therefore, we do not need to check for such things as
3383 arithmetic-combinations of integers. */
3386 initializer_constant_valid_p (tree value
, tree endtype
)
3388 /* Give the front-end a chance to convert VALUE to something that
3389 looks more like a constant to the back-end. */
3390 value
= lang_hooks
.expand_constant (value
);
3392 switch (TREE_CODE (value
))
3395 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3396 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3397 && TREE_CONSTANT (value
)
3398 && CONSTRUCTOR_ELTS (value
))
3401 bool absolute
= true;
3403 for (elt
= CONSTRUCTOR_ELTS (value
); elt
; elt
= TREE_CHAIN (elt
))
3406 value
= TREE_VALUE (elt
);
3407 reloc
= initializer_constant_valid_p (value
, TREE_TYPE (value
));
3410 if (reloc
!= null_pointer_node
)
3413 /* For a non-absolute relocation, there is no single
3414 variable that can be "the variable that determines the
3416 return absolute
? null_pointer_node
: error_mark_node
;
3419 return TREE_STATIC (value
) ? null_pointer_node
: NULL_TREE
;
3426 return null_pointer_node
;
3430 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
3432 case VIEW_CONVERT_EXPR
:
3433 case NON_LVALUE_EXPR
:
3434 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3438 /* Allow conversions between pointer types. */
3439 if (POINTER_TYPE_P (TREE_TYPE (value
))
3440 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3441 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3443 /* Allow conversions between real types. */
3444 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3445 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3446 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3448 /* Allow length-preserving conversions between integer types. */
3449 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3450 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3451 && (TYPE_PRECISION (TREE_TYPE (value
))
3452 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3453 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3455 /* Allow conversions between other integer types only if
3457 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3458 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3460 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3462 if (inner
== null_pointer_node
)
3463 return null_pointer_node
;
3467 /* Allow (int) &foo provided int is as wide as a pointer. */
3468 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3469 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3470 && (TYPE_PRECISION (TREE_TYPE (value
))
3471 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3472 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3475 /* Likewise conversions from int to pointers, but also allow
3476 conversions from 0. */
3477 if ((POINTER_TYPE_P (TREE_TYPE (value
))
3478 || TREE_CODE (TREE_TYPE (value
)) == OFFSET_TYPE
)
3479 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3481 if (integer_zerop (TREE_OPERAND (value
, 0)))
3482 return null_pointer_node
;
3483 else if (TYPE_PRECISION (TREE_TYPE (value
))
3484 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
3485 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3489 /* Allow conversions to struct or union types if the value
3491 if (TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
3492 || TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
3493 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3498 if (! INTEGRAL_TYPE_P (endtype
)
3499 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3501 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3503 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3505 /* If either term is absolute, use the other terms relocation. */
3506 if (valid0
== null_pointer_node
)
3508 if (valid1
== null_pointer_node
)
3514 if (! INTEGRAL_TYPE_P (endtype
)
3515 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3517 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3519 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3521 /* Win if second argument is absolute. */
3522 if (valid1
== null_pointer_node
)
3524 /* Win if both arguments have the same relocation.
3525 Then the value is absolute. */
3526 if (valid0
== valid1
&& valid0
!= 0)
3527 return null_pointer_node
;
3529 /* Since GCC guarantees that string constants are unique in the
3530 generated code, a subtraction between two copies of the same
3531 constant string is absolute. */
3532 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
3533 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
3534 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
3535 return null_pointer_node
;
3538 /* Support differences between labels. */
3539 if (INTEGRAL_TYPE_P (endtype
))
3542 op0
= TREE_OPERAND (value
, 0);
3543 op1
= TREE_OPERAND (value
, 1);
3545 /* Like STRIP_NOPS except allow the operand mode to widen.
3546 This works around a feature of fold that simplifies
3547 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3548 that the narrower operation is cheaper. */
3550 while (TREE_CODE (op0
) == NOP_EXPR
3551 || TREE_CODE (op0
) == CONVERT_EXPR
3552 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3554 tree inner
= TREE_OPERAND (op0
, 0);
3555 if (inner
== error_mark_node
3556 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3557 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3558 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3563 while (TREE_CODE (op1
) == NOP_EXPR
3564 || TREE_CODE (op1
) == CONVERT_EXPR
3565 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3567 tree inner
= TREE_OPERAND (op1
, 0);
3568 if (inner
== error_mark_node
3569 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3570 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3571 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3576 if (TREE_CODE (op0
) == ADDR_EXPR
3577 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
3578 && TREE_CODE (op1
) == ADDR_EXPR
3579 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
3580 return null_pointer_node
;
3591 /* Output assembler code for constant EXP to FILE, with no label.
3592 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3593 Assumes output_addressed_constants has been done on EXP already.
3595 Generate exactly SIZE bytes of assembler data, padding at the end
3596 with zeros if necessary. SIZE must always be specified.
3598 SIZE is important for structure constructors,
3599 since trailing members may have been omitted from the constructor.
3600 It is also important for initialization of arrays from string constants
3601 since the full length of the string constant might not be wanted.
3602 It is also needed for initialization of unions, where the initializer's
3603 type is just one member, and that may not be as long as the union.
3605 There a case in which we would fail to output exactly SIZE bytes:
3606 for a structure constructor that wants to produce more than SIZE bytes.
3607 But such constructors will never be generated for any possible input.
3609 ALIGN is the alignment of the data in bits. */
3612 output_constant (tree exp
, unsigned HOST_WIDE_INT size
, unsigned int align
)
3614 enum tree_code code
;
3615 unsigned HOST_WIDE_INT thissize
;
3617 /* Some front-ends use constants other than the standard language-independent
3618 varieties, but which may still be output directly. Give the front-end a
3619 chance to convert EXP to a language-independent representation. */
3620 exp
= lang_hooks
.expand_constant (exp
);
3622 if (size
== 0 || flag_syntax_only
)
3625 /* Eliminate any conversions since we'll be outputting the underlying
3627 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3628 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3629 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3630 exp
= TREE_OPERAND (exp
, 0);
3632 code
= TREE_CODE (TREE_TYPE (exp
));
3633 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3635 /* Allow a constructor with no elements for any data type.
3636 This means to fill the space with zeros. */
3637 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3639 assemble_zeros (size
);
3643 if (TREE_CODE (exp
) == FDESC_EXPR
)
3645 #ifdef ASM_OUTPUT_FDESC
3646 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3647 tree decl
= TREE_OPERAND (exp
, 0);
3648 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3655 /* Now output the underlying data. If we've handling the padding, return.
3656 Otherwise, break and ensure SIZE is the size written. */
3664 case REFERENCE_TYPE
:
3666 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3667 EXPAND_INITIALIZER
),
3668 MIN (size
, thissize
), align
, 0))
3669 error ("initializer for integer value is too complicated");
3673 if (TREE_CODE (exp
) != REAL_CST
)
3674 error ("initializer for floating value is not a floating constant");
3676 assemble_real (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)), align
);
3680 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3681 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3682 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
3687 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3689 output_constructor (exp
, size
, align
);
3692 else if (TREE_CODE (exp
) == STRING_CST
)
3694 thissize
= MIN ((unsigned HOST_WIDE_INT
)TREE_STRING_LENGTH (exp
),
3696 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
3698 else if (TREE_CODE (exp
) == VECTOR_CST
)
3702 unsigned int nalign
;
3703 enum machine_mode inner
;
3705 inner
= TYPE_MODE (TREE_TYPE (TREE_TYPE (exp
)));
3706 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
3708 elt_size
= GET_MODE_SIZE (inner
);
3710 link
= TREE_VECTOR_CST_ELTS (exp
);
3711 output_constant (TREE_VALUE (link
), elt_size
, align
);
3712 while ((link
= TREE_CHAIN (link
)) != NULL
)
3713 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
3721 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3722 output_constructor (exp
, size
, align
);
3728 if (TREE_CODE (exp
) == INTEGER_CST
)
3729 assemble_integer (expand_expr (exp
, NULL_RTX
,
3730 VOIDmode
, EXPAND_INITIALIZER
),
3731 thissize
, align
, 1);
3732 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3734 unsigned char *buffer
= alloca (thissize
);
3735 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
3737 assemble_string ((char *) buffer
, thissize
);
3740 error ("unknown set constructor type");
3750 if (size
> thissize
)
3751 assemble_zeros (size
- thissize
);
3755 /* Subroutine of output_constructor, used for computing the size of
3756 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3757 type with an unspecified upper bound. */
3759 static unsigned HOST_WIDE_INT
3760 array_size_for_constructor (tree val
)
3764 /* This code used to attempt to handle string constants that are not
3765 arrays of single-bytes, but nothing else does, so there's no point in
3767 if (TREE_CODE (val
) == STRING_CST
)
3768 return TREE_STRING_LENGTH (val
);
3770 max_index
= NULL_TREE
;
3771 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
3773 tree index
= TREE_PURPOSE (i
);
3775 if (TREE_CODE (index
) == RANGE_EXPR
)
3776 index
= TREE_OPERAND (index
, 1);
3777 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
3781 if (max_index
== NULL_TREE
)
3784 /* Compute the total number of array elements. */
3785 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
3787 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
3788 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
3790 /* Multiply by the array element unit size to find number of bytes. */
3791 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
3793 return tree_low_cst (i
, 1);
3796 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3797 Generate at least SIZE bytes, padding if necessary. */
3800 output_constructor (tree exp
, unsigned HOST_WIDE_INT size
,
3803 tree type
= TREE_TYPE (exp
);
3804 tree link
, field
= 0;
3806 /* Number of bytes output or skipped so far.
3807 In other words, current position within the constructor. */
3808 HOST_WIDE_INT total_bytes
= 0;
3809 /* Nonzero means BYTE contains part of a byte, to be output. */
3810 int byte_buffer_in_use
= 0;
3813 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3816 if (TREE_CODE (type
) == RECORD_TYPE
)
3817 field
= TYPE_FIELDS (type
);
3819 if (TREE_CODE (type
) == ARRAY_TYPE
3820 && TYPE_DOMAIN (type
) != 0)
3821 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
3823 /* As LINK goes through the elements of the constant,
3824 FIELD goes through the structure fields, if the constant is a structure.
3825 if the constant is a union, then we override this,
3826 by getting the field from the TREE_LIST element.
3827 But the constant could also be an array. Then FIELD is zero.
3829 There is always a maximum of one element in the chain LINK for unions
3830 (even if the initializer in a source program incorrectly contains
3832 for (link
= CONSTRUCTOR_ELTS (exp
);
3834 link
= TREE_CHAIN (link
),
3835 field
= field
? TREE_CHAIN (field
) : 0)
3837 tree val
= TREE_VALUE (link
);
3840 /* The element in a union constructor specifies the proper field
3842 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
3843 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
3844 && TREE_PURPOSE (link
) != 0)
3845 field
= TREE_PURPOSE (link
);
3847 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3848 index
= TREE_PURPOSE (link
);
3850 #ifdef ASM_COMMENT_START
3851 if (field
&& flag_verbose_asm
)
3852 fprintf (asm_out_file
, "%s %s:\n",
3855 ? IDENTIFIER_POINTER (DECL_NAME (field
))
3859 /* Eliminate the marker that makes a cast not be an lvalue. */
3863 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
3865 unsigned HOST_WIDE_INT fieldsize
3866 = int_size_in_bytes (TREE_TYPE (type
));
3867 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
3868 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
3869 HOST_WIDE_INT index
;
3870 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
3872 for (index
= lo_index
; index
<= hi_index
; index
++)
3874 /* Output the element's initial value. */
3876 assemble_zeros (fieldsize
);
3878 output_constant (val
, fieldsize
, align2
);
3880 /* Count its size. */
3881 total_bytes
+= fieldsize
;
3884 else if (field
== 0 || !DECL_BIT_FIELD (field
))
3886 /* An element that is not a bit-field. */
3888 unsigned HOST_WIDE_INT fieldsize
;
3889 /* Since this structure is static,
3890 we know the positions are constant. */
3891 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
3892 unsigned int align2
;
3895 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
3896 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
3898 /* Output any buffered-up bit-fields preceding this element. */
3899 if (byte_buffer_in_use
)
3901 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3903 byte_buffer_in_use
= 0;
3906 /* Advance to offset of this element.
3907 Note no alignment needed in an array, since that is guaranteed
3908 if each element has the proper size. */
3909 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
3911 assemble_zeros (pos
- total_bytes
);
3915 /* Find the alignment of this element. */
3916 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
3918 /* Determine size this element should occupy. */
3923 /* If this is an array with an unspecified upper bound,
3924 the initializer determines the size. */
3925 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
3926 but we cannot do this until the deprecated support for
3927 initializing zero-length array members is removed. */
3928 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
3929 && TYPE_DOMAIN (TREE_TYPE (field
))
3930 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
3932 fieldsize
= array_size_for_constructor (val
);
3933 /* Given a non-empty initialization, this field had
3935 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
3938 else if (DECL_SIZE_UNIT (field
))
3940 /* ??? This can't be right. If the decl size overflows
3941 a host integer we will silently emit no data. */
3942 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
3943 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
3947 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
3949 /* Output the element's initial value. */
3951 assemble_zeros (fieldsize
);
3953 output_constant (val
, fieldsize
, align2
);
3955 /* Count its size. */
3956 total_bytes
+= fieldsize
;
3958 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
3959 error ("invalid initial value for member `%s'",
3960 IDENTIFIER_POINTER (DECL_NAME (field
)));
3963 /* Element that is a bit-field. */
3965 HOST_WIDE_INT next_offset
= int_bit_position (field
);
3966 HOST_WIDE_INT end_offset
3967 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
3970 val
= integer_zero_node
;
3972 /* If this field does not start in this (or, next) byte,
3974 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
3976 /* Output remnant of any bit field in previous bytes. */
3977 if (byte_buffer_in_use
)
3979 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3981 byte_buffer_in_use
= 0;
3984 /* If still not at proper byte, advance to there. */
3985 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
3987 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
3988 total_bytes
= next_offset
/ BITS_PER_UNIT
;
3992 if (! byte_buffer_in_use
)
3995 /* We must split the element into pieces that fall within
3996 separate bytes, and combine each byte with previous or
3997 following bit-fields. */
3999 /* next_offset is the offset n fbits from the beginning of
4000 the structure to the next bit of this element to be processed.
4001 end_offset is the offset of the first bit past the end of
4003 while (next_offset
< end_offset
)
4007 HOST_WIDE_INT value
;
4008 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4009 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4011 /* Advance from byte to byte
4012 within this element when necessary. */
4013 while (next_byte
!= total_bytes
)
4015 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4020 /* Number of bits we can process at once
4021 (all part of the same byte). */
4022 this_time
= MIN (end_offset
- next_offset
,
4023 BITS_PER_UNIT
- next_bit
);
4024 if (BYTES_BIG_ENDIAN
)
4026 /* On big-endian machine, take the most significant bits
4027 first (of the bits that are significant)
4028 and put them into bytes from the most significant end. */
4029 shift
= end_offset
- next_offset
- this_time
;
4031 /* Don't try to take a bunch of bits that cross
4032 the word boundary in the INTEGER_CST. We can
4033 only select bits from the LOW or HIGH part
4035 if (shift
< HOST_BITS_PER_WIDE_INT
4036 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4038 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4039 shift
= HOST_BITS_PER_WIDE_INT
;
4042 /* Now get the bits from the appropriate constant word. */
4043 if (shift
< HOST_BITS_PER_WIDE_INT
)
4044 value
= TREE_INT_CST_LOW (val
);
4045 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4047 value
= TREE_INT_CST_HIGH (val
);
4048 shift
-= HOST_BITS_PER_WIDE_INT
;
4053 /* Get the result. This works only when:
4054 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4055 byte
|= (((value
>> shift
)
4056 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4057 << (BITS_PER_UNIT
- this_time
- next_bit
));
4061 /* On little-endian machines,
4062 take first the least significant bits of the value
4063 and pack them starting at the least significant
4064 bits of the bytes. */
4065 shift
= next_offset
- int_bit_position (field
);
4067 /* Don't try to take a bunch of bits that cross
4068 the word boundary in the INTEGER_CST. We can
4069 only select bits from the LOW or HIGH part
4071 if (shift
< HOST_BITS_PER_WIDE_INT
4072 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4073 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4075 /* Now get the bits from the appropriate constant word. */
4076 if (shift
< HOST_BITS_PER_WIDE_INT
)
4077 value
= TREE_INT_CST_LOW (val
);
4078 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4080 value
= TREE_INT_CST_HIGH (val
);
4081 shift
-= HOST_BITS_PER_WIDE_INT
;
4086 /* Get the result. This works only when:
4087 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4088 byte
|= (((value
>> shift
)
4089 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4093 next_offset
+= this_time
;
4094 byte_buffer_in_use
= 1;
4099 if (byte_buffer_in_use
)
4101 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4105 if ((unsigned HOST_WIDE_INT
)total_bytes
< size
)
4106 assemble_zeros (size
- total_bytes
);
4109 /* This TREE_LIST contains any weak symbol declarations waiting
4111 static GTY(()) tree weak_decls
;
4113 /* Mark DECL as weak. */
4116 mark_weak (tree decl
)
4118 DECL_WEAK (decl
) = 1;
4120 if (DECL_RTL_SET_P (decl
)
4121 && MEM_P (DECL_RTL (decl
))
4122 && XEXP (DECL_RTL (decl
), 0)
4123 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4124 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4127 /* Merge weak status between NEWDECL and OLDDECL. */
4130 merge_weak (tree newdecl
, tree olddecl
)
4132 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4135 if (DECL_WEAK (newdecl
))
4139 /* NEWDECL is weak, but OLDDECL is not. */
4141 /* If we already output the OLDDECL, we're in trouble; we can't
4142 go back and make it weak. This error cannot caught in
4143 declare_weak because the NEWDECL and OLDDECL was not yet
4144 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4145 if (TREE_ASM_WRITTEN (olddecl
))
4146 error ("%Jweak declaration of '%D' must precede definition",
4149 /* If we've already generated rtl referencing OLDDECL, we may
4150 have done so in a way that will not function properly with
4152 else if (TREE_USED (olddecl
)
4153 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4154 warning ("%Jweak declaration of '%D' after first use results "
4155 "in unspecified behavior", newdecl
, newdecl
);
4159 /* We put the NEWDECL on the weak_decls list at some point.
4160 Replace it with the OLDDECL. */
4161 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4162 if (TREE_VALUE (wd
) == newdecl
)
4164 TREE_VALUE (wd
) = olddecl
;
4167 /* We may not find the entry on the list. If NEWDECL is a
4168 weak alias, then we will have already called
4169 globalize_decl to remove the entry; in that case, we do
4170 not need to do anything. */
4173 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4174 mark_weak (olddecl
);
4177 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4178 weak. Just update NEWDECL to indicate that it's weak too. */
4179 mark_weak (newdecl
);
4182 /* Declare DECL to be a weak symbol. */
4185 declare_weak (tree decl
)
4187 if (! TREE_PUBLIC (decl
))
4188 error ("%Jweak declaration of '%D' must be public", decl
, decl
);
4189 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4190 error ("%Jweak declaration of '%D' must precede definition", decl
, decl
);
4191 else if (SUPPORTS_WEAK
)
4193 if (! DECL_WEAK (decl
))
4194 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4197 warning ("%Jweak declaration of '%D' not supported", decl
, decl
);
4202 /* Emit any pending weak declarations. */
4209 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4211 tree decl
= TREE_VALUE (t
);
4212 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4213 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4216 if (! TREE_USED (decl
))
4219 #ifdef ASM_WEAKEN_DECL
4220 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4222 #ifdef ASM_WEAKEN_LABEL
4223 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4225 #ifdef ASM_OUTPUT_WEAK_ALIAS
4226 warning ("only weak aliases are supported in this configuration");
4234 /* Emit the assembly bits to indicate that DECL is globally visible. */
4237 globalize_decl (tree decl
)
4239 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4241 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4242 if (DECL_WEAK (decl
))
4246 #ifdef ASM_WEAKEN_DECL
4247 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4249 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4252 /* Remove this function from the pending weak list so that
4253 we do not emit multiple .weak directives for it. */
4254 for (p
= &weak_decls
; (t
= *p
) ; )
4256 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4257 *p
= TREE_CHAIN (t
);
4259 p
= &TREE_CHAIN (t
);
4263 #elif defined(ASM_MAKE_LABEL_LINKONCE)
4264 if (DECL_ONE_ONLY (decl
))
4265 ASM_MAKE_LABEL_LINKONCE (asm_out_file
, name
);
4268 targetm
.asm_out
.globalize_label (asm_out_file
, name
);
4271 /* Emit an assembler directive to make the symbol for DECL an alias to
4272 the symbol for TARGET. */
4275 assemble_alias (tree decl
, tree target ATTRIBUTE_UNUSED
)
4279 /* We must force creation of DECL_RTL for debug info generation, even though
4280 we don't use it here. */
4281 make_decl_rtl (decl
);
4283 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4285 #ifdef ASM_OUTPUT_DEF
4286 /* Make name accessible from other files, if appropriate. */
4288 if (TREE_PUBLIC (decl
))
4290 globalize_decl (decl
);
4291 maybe_assemble_visibility (decl
);
4294 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4295 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4297 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4299 #else /* !ASM_OUTPUT_DEF */
4300 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4301 if (DECL_WEAK (decl
))
4304 #ifdef ASM_WEAKEN_DECL
4305 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4307 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4309 /* Remove this function from the pending weak list so that
4310 we do not emit multiple .weak directives for it. */
4311 for (p
= &weak_decls
; (t
= *p
) ; )
4312 if (DECL_ASSEMBLER_NAME (decl
)
4313 == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4314 *p
= TREE_CHAIN (t
);
4316 p
= &TREE_CHAIN (t
);
4319 warning ("only weak aliases are supported in this configuration");
4322 warning ("alias definitions not supported in this configuration; ignored");
4326 TREE_USED (decl
) = 1;
4327 TREE_ASM_WRITTEN (decl
) = 1;
4328 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4331 /* Emit an assembler directive to set symbol for DECL visibility to
4332 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4335 default_assemble_visibility (tree decl
, int vis
)
4337 static const char * const visibility_types
[] = {
4338 NULL
, "internal", "hidden", "protected"
4341 const char *name
, *type
;
4343 name
= (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4344 type
= visibility_types
[vis
];
4346 #ifdef HAVE_GAS_HIDDEN
4347 fprintf (asm_out_file
, "\t.%s\t", type
);
4348 assemble_name (asm_out_file
, name
);
4349 fprintf (asm_out_file
, "\n");
4351 warning ("visibility attribute not supported in this configuration; ignored");
4355 /* A helper function to call assemble_visibility when needed for a decl. */
4358 maybe_assemble_visibility (tree decl
)
4360 enum symbol_visibility vis
= DECL_VISIBILITY (decl
);
4362 if (vis
!= VISIBILITY_DEFAULT
)
4363 targetm
.asm_out
.visibility (decl
, vis
);
4366 /* Returns 1 if the target configuration supports defining public symbols
4367 so that one of them will be chosen at link time instead of generating a
4368 multiply-defined symbol error, whether through the use of weak symbols or
4369 a target-specific mechanism for having duplicates discarded. */
4372 supports_one_only (void)
4374 if (SUPPORTS_ONE_ONLY
)
4376 return SUPPORTS_WEAK
;
4379 /* Set up DECL as a public symbol that can be defined in multiple
4380 translation units without generating a linker error. */
4383 make_decl_one_only (tree decl
)
4385 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4388 TREE_PUBLIC (decl
) = 1;
4390 if (SUPPORTS_ONE_ONLY
)
4392 #ifdef MAKE_DECL_ONE_ONLY
4393 MAKE_DECL_ONE_ONLY (decl
);
4395 DECL_ONE_ONLY (decl
) = 1;
4397 else if (TREE_CODE (decl
) == VAR_DECL
4398 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4399 DECL_COMMON (decl
) = 1;
4400 else if (SUPPORTS_WEAK
)
4401 DECL_WEAK (decl
) = 1;
4407 init_varasm_once (void)
4409 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4410 in_named_entry_eq
, NULL
);
4411 const_desc_htab
= htab_create_ggc (1009, const_desc_hash
,
4412 const_desc_eq
, NULL
);
4414 const_alias_set
= new_alias_set ();
4418 decl_tls_model (tree decl
)
4420 enum tls_model kind
;
4421 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4426 attr
= TREE_VALUE (TREE_VALUE (attr
));
4427 if (TREE_CODE (attr
) != STRING_CST
)
4429 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4430 kind
= TLS_MODEL_LOCAL_EXEC
;
4431 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4432 kind
= TLS_MODEL_INITIAL_EXEC
;
4433 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4434 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4435 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4436 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4442 is_local
= targetm
.binds_local_p (decl
);
4446 kind
= TLS_MODEL_LOCAL_EXEC
;
4448 kind
= TLS_MODEL_INITIAL_EXEC
;
4450 /* Local dynamic is inefficient when we're not combining the
4451 parts of the address. */
4452 else if (optimize
&& is_local
)
4453 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4455 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4456 if (kind
< flag_tls_default
)
4457 kind
= flag_tls_default
;
4462 /* Select a set of attributes for section NAME based on the properties
4463 of DECL and whether or not RELOC indicates that DECL's initializer
4464 might contain runtime relocations.
4466 We make the section read-only and executable for a function decl,
4467 read-only for a const data decl, and writable for a non-const data decl. */
4470 default_section_type_flags (tree decl
, const char *name
, int reloc
)
4472 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4476 default_section_type_flags_1 (tree decl
, const char *name
, int reloc
,
4481 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4482 flags
= SECTION_CODE
;
4483 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4485 else if (strcmp (name
, UNLIKELY_EXECUTED_TEXT_SECTION_NAME
) == 0)
4486 flags
= SECTION_CODE
;
4488 flags
= SECTION_WRITE
;
4490 if (decl
&& DECL_ONE_ONLY (decl
))
4491 flags
|= SECTION_LINKONCE
;
4493 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4494 flags
|= SECTION_TLS
| SECTION_WRITE
;
4496 if (strcmp (name
, ".bss") == 0
4497 || strncmp (name
, ".bss.", 5) == 0
4498 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4499 || strcmp (name
, ".sbss") == 0
4500 || strncmp (name
, ".sbss.", 6) == 0
4501 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0
4502 || strcmp (name
, ".tbss") == 0
4503 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4504 flags
|= SECTION_BSS
;
4506 if (strcmp (name
, ".tdata") == 0
4507 || strcmp (name
, ".tbss") == 0
4508 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0
4509 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4510 flags
|= SECTION_TLS
;
4512 /* These three sections have special ELF types. They are neither
4513 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4514 want to print a section type (@progbits or @nobits). If someone
4515 is silly enough to emit code or TLS variables to one of these
4516 sections, then don't handle them specially. */
4517 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4518 && (strcmp (name
, ".init_array") == 0
4519 || strcmp (name
, ".fini_array") == 0
4520 || strcmp (name
, ".preinit_array") == 0))
4521 flags
|= SECTION_NOTYPE
;
4526 /* Output assembly to switch to section NAME with attribute FLAGS.
4527 Four variants for common object file formats. */
4530 default_no_named_section (const char *name ATTRIBUTE_UNUSED
,
4531 unsigned int flags ATTRIBUTE_UNUSED
)
4533 /* Some object formats don't support named sections at all. The
4534 front-end should already have flagged this as an error. */
4539 default_elf_asm_named_section (const char *name
, unsigned int flags
)
4541 char flagchars
[10], *f
= flagchars
;
4543 if (! named_section_first_declaration (name
))
4545 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4549 if (!(flags
& SECTION_DEBUG
))
4551 if (flags
& SECTION_WRITE
)
4553 if (flags
& SECTION_CODE
)
4555 if (flags
& SECTION_SMALL
)
4557 if (flags
& SECTION_MERGE
)
4559 if (flags
& SECTION_STRINGS
)
4561 if (flags
& SECTION_TLS
)
4565 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4567 if (!(flags
& SECTION_NOTYPE
))
4571 if (flags
& SECTION_BSS
)
4576 fprintf (asm_out_file
, ",@%s", type
);
4578 if (flags
& SECTION_ENTSIZE
)
4579 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4582 putc ('\n', asm_out_file
);
4586 default_coff_asm_named_section (const char *name
, unsigned int flags
)
4588 char flagchars
[8], *f
= flagchars
;
4590 if (flags
& SECTION_WRITE
)
4592 if (flags
& SECTION_CODE
)
4596 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4600 default_pe_asm_named_section (const char *name
, unsigned int flags
)
4602 default_coff_asm_named_section (name
, flags
);
4604 if (flags
& SECTION_LINKONCE
)
4606 /* Functions may have been compiled at various levels of
4607 optimization so we can't use `same_size' here.
4608 Instead, have the linker pick one. */
4609 fprintf (asm_out_file
, "\t.linkonce %s\n",
4610 (flags
& SECTION_CODE
? "discard" : "same_size"));
4614 /* The lame default section selector. */
4617 default_select_section (tree decl
, int reloc
,
4618 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4620 bool readonly
= false;
4624 if (decl_readonly_section (decl
, reloc
))
4627 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4629 if (! ((flag_pic
&& reloc
)
4630 || !TREE_READONLY (decl
)
4631 || TREE_SIDE_EFFECTS (decl
)
4632 || !TREE_CONSTANT (decl
)))
4635 else if (TREE_CODE (decl
) == STRING_CST
)
4637 else if (! (flag_pic
&& reloc
))
4641 readonly_data_section ();
4646 /* A helper function for default_elf_select_section and
4647 default_elf_unique_section. Categorizes the DECL. */
4649 enum section_category
4654 SECCAT_RODATA_MERGE_STR
,
4655 SECCAT_RODATA_MERGE_STR_INIT
,
4656 SECCAT_RODATA_MERGE_CONST
,
4661 /* To optimize loading of shared programs, define following subsections
4663 _REL Contains data that has relocations, so they get grouped
4664 together and dynamic linker will visit fewer pages in memory.
4665 _RO Contains data that is otherwise read-only. This is useful
4666 with prelinking as most relocations won't be dynamically
4667 linked and thus stay read only.
4668 _LOCAL Marks data containing relocations only to local objects.
4669 These relocations will get fully resolved by prelinking. */
4671 SECCAT_DATA_REL_LOCAL
,
4673 SECCAT_DATA_REL_RO_LOCAL
,
4683 static enum section_category
4684 categorize_decl_for_section (tree
, int, int);
4686 static enum section_category
4687 categorize_decl_for_section (tree decl
, int reloc
, int shlib
)
4689 enum section_category ret
;
4691 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4693 else if (TREE_CODE (decl
) == STRING_CST
)
4695 if (flag_mudflap
) /* or !flag_merge_constants */
4696 return SECCAT_RODATA
;
4698 return SECCAT_RODATA_MERGE_STR
;
4700 else if (TREE_CODE (decl
) == VAR_DECL
)
4702 if (DECL_INITIAL (decl
) == NULL
4703 || DECL_INITIAL (decl
) == error_mark_node
4704 || (flag_zero_initialized_in_bss
4705 /* Leave constant zeroes in .rodata so they can be shared. */
4706 && !TREE_READONLY (decl
)
4707 && initializer_zerop (DECL_INITIAL (decl
))))
4709 else if (! TREE_READONLY (decl
)
4710 || TREE_SIDE_EFFECTS (decl
)
4711 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
4713 if (shlib
&& (reloc
& 2))
4714 ret
= SECCAT_DATA_REL
;
4715 else if (shlib
&& reloc
)
4716 ret
= SECCAT_DATA_REL_LOCAL
;
4720 else if (shlib
&& (reloc
& 2))
4721 ret
= SECCAT_DATA_REL_RO
;
4722 else if (shlib
&& reloc
)
4723 ret
= SECCAT_DATA_REL_RO_LOCAL
;
4724 else if (reloc
|| flag_merge_constants
< 2)
4725 /* C and C++ don't allow different variables to share the same
4726 location. -fmerge-all-constants allows even that (at the
4727 expense of not conforming). */
4728 ret
= SECCAT_RODATA
;
4729 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
4730 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
4732 ret
= SECCAT_RODATA_MERGE_CONST
;
4734 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4736 if ((shlib
&& reloc
)
4737 || TREE_SIDE_EFFECTS (decl
)
4738 || ! TREE_CONSTANT (decl
))
4741 ret
= SECCAT_RODATA
;
4744 ret
= SECCAT_RODATA
;
4746 /* There are no read-only thread-local sections. */
4747 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4749 /* Note that this would be *just* SECCAT_BSS, except that there's
4750 no concept of a read-only thread-local-data section. */
4751 if (ret
== SECCAT_BSS
4752 || (flag_zero_initialized_in_bss
4753 && initializer_zerop (DECL_INITIAL (decl
))))
4759 /* If the target uses small data sections, select it. */
4760 else if (targetm
.in_small_data_p (decl
))
4762 if (ret
== SECCAT_BSS
)
4764 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
4765 ret
= SECCAT_SRODATA
;
4774 decl_readonly_section (tree decl
, int reloc
)
4776 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
4780 decl_readonly_section_1 (tree decl
, int reloc
, int shlib
)
4782 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4785 case SECCAT_RODATA_MERGE_STR
:
4786 case SECCAT_RODATA_MERGE_STR_INIT
:
4787 case SECCAT_RODATA_MERGE_CONST
:
4788 case SECCAT_SRODATA
:
4797 /* Select a section based on the above categorization. */
4800 default_elf_select_section (tree decl
, int reloc
,
4801 unsigned HOST_WIDE_INT align
)
4803 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
4807 default_elf_select_section_1 (tree decl
, int reloc
,
4808 unsigned HOST_WIDE_INT align
, int shlib
)
4810 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4813 /* We're not supposed to be called on FUNCTION_DECLs. */
4816 readonly_data_section ();
4818 case SECCAT_RODATA_MERGE_STR
:
4819 mergeable_string_section (decl
, align
, 0);
4821 case SECCAT_RODATA_MERGE_STR_INIT
:
4822 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
4824 case SECCAT_RODATA_MERGE_CONST
:
4825 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
4827 case SECCAT_SRODATA
:
4828 named_section (NULL_TREE
, ".sdata2", reloc
);
4833 case SECCAT_DATA_REL
:
4834 named_section (NULL_TREE
, ".data.rel", reloc
);
4836 case SECCAT_DATA_REL_LOCAL
:
4837 named_section (NULL_TREE
, ".data.rel.local", reloc
);
4839 case SECCAT_DATA_REL_RO
:
4840 named_section (NULL_TREE
, ".data.rel.ro", reloc
);
4842 case SECCAT_DATA_REL_RO_LOCAL
:
4843 named_section (NULL_TREE
, ".data.rel.ro.local", reloc
);
4846 named_section (NULL_TREE
, ".sdata", reloc
);
4849 named_section (NULL_TREE
, ".tdata", reloc
);
4852 #ifdef BSS_SECTION_ASM_OP
4855 named_section (NULL_TREE
, ".bss", reloc
);
4859 named_section (NULL_TREE
, ".sbss", reloc
);
4862 named_section (NULL_TREE
, ".tbss", reloc
);
4869 /* Construct a unique section name based on the decl name and the
4870 categorization performed above. */
4873 default_unique_section (tree decl
, int reloc
)
4875 default_unique_section_1 (decl
, reloc
, flag_pic
);
4879 default_unique_section_1 (tree decl
, int reloc
, int shlib
)
4881 bool one_only
= DECL_ONE_ONLY (decl
);
4882 const char *prefix
, *name
;
4886 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4889 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
4892 case SECCAT_RODATA_MERGE_STR
:
4893 case SECCAT_RODATA_MERGE_STR_INIT
:
4894 case SECCAT_RODATA_MERGE_CONST
:
4895 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
4897 case SECCAT_SRODATA
:
4898 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
4901 case SECCAT_DATA_REL
:
4902 case SECCAT_DATA_REL_LOCAL
:
4903 case SECCAT_DATA_REL_RO
:
4904 case SECCAT_DATA_REL_RO_LOCAL
:
4905 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
4908 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
4911 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
4914 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
4917 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
4920 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
4925 plen
= strlen (prefix
);
4927 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4928 name
= targetm
.strip_name_encoding (name
);
4929 nlen
= strlen (name
);
4931 string
= alloca (nlen
+ plen
+ 1);
4932 memcpy (string
, prefix
, plen
);
4933 memcpy (string
+ plen
, name
, nlen
+ 1);
4935 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
4939 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
4941 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4944 switch (GET_CODE (x
))
4956 readonly_data_section ();
4960 default_elf_select_rtx_section (enum machine_mode mode
, rtx x
,
4961 unsigned HOST_WIDE_INT align
)
4963 /* ??? Handle small data here somehow. */
4966 switch (GET_CODE (x
))
4970 named_section (NULL_TREE
, ".data.rel.ro", 3);
4974 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
4981 mergeable_constant_section (mode
, align
, 0);
4984 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
4987 default_encode_section_info (tree decl
, rtx rtl
, int first ATTRIBUTE_UNUSED
)
4992 /* Careful not to prod global register variables. */
4995 symbol
= XEXP (rtl
, 0);
4996 if (GET_CODE (symbol
) != SYMBOL_REF
)
5000 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5001 flags
|= SYMBOL_FLAG_FUNCTION
;
5002 if (targetm
.binds_local_p (decl
))
5003 flags
|= SYMBOL_FLAG_LOCAL
;
5004 if (targetm
.in_small_data_p (decl
))
5005 flags
|= SYMBOL_FLAG_SMALL
;
5006 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5007 flags
|= decl_tls_model (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
5008 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
5009 being PUBLIC, the thing *must* be defined in this translation unit.
5010 Prevent this buglet from being propagated into rtl code as well. */
5011 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
5012 flags
|= SYMBOL_FLAG_EXTERNAL
;
5014 SYMBOL_REF_FLAGS (symbol
) = flags
;
5017 /* By default, we do nothing for encode_section_info, so we need not
5018 do anything but discard the '*' marker. */
5021 default_strip_name_encoding (const char *str
)
5023 return str
+ (*str
== '*');
5026 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5027 wrt cross-module name binding. */
5030 default_binds_local_p (tree exp
)
5032 return default_binds_local_p_1 (exp
, flag_shlib
);
5036 default_binds_local_p_1 (tree exp
, int shlib
)
5040 /* A non-decl is an entry in the constant pool. */
5043 /* Static variables are always local. */
5044 else if (! TREE_PUBLIC (exp
))
5046 /* A variable is local if the user explicitly tells us so. */
5047 else if (DECL_VISIBILITY_SPECIFIED (exp
) && DECL_VISIBILITY (exp
) != VISIBILITY_DEFAULT
)
5049 /* Otherwise, variables defined outside this object may not be local. */
5050 else if (DECL_EXTERNAL (exp
))
5052 /* Linkonce and weak data are never local. */
5053 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
5055 /* If none of the above and visibility is not default, make local. */
5056 else if (DECL_VISIBILITY (exp
) != VISIBILITY_DEFAULT
)
5058 /* If PIC, then assume that any global name can be overridden by
5059 symbols resolved from other modules. */
5062 /* Uninitialized COMMON variable may be unified with symbols
5063 resolved from other modules. */
5064 else if (DECL_COMMON (exp
)
5065 && (DECL_INITIAL (exp
) == NULL
5066 || DECL_INITIAL (exp
) == error_mark_node
))
5068 /* Otherwise we're left with initialized (or non-common) global data
5069 which is of necessity defined locally. */
5076 /* Determine whether or not a pointer mode is valid. Assume defaults
5077 of ptr_mode or Pmode - can be overridden. */
5079 default_valid_pointer_mode (enum machine_mode mode
)
5081 return (mode
== ptr_mode
|| mode
== Pmode
);
5084 /* Default function to output code that will globalize a label. A
5085 target must define GLOBAL_ASM_OP or provide it's own function to
5086 globalize a label. */
5087 #ifdef GLOBAL_ASM_OP
5089 default_globalize_label (FILE * stream
, const char *name
)
5091 fputs (GLOBAL_ASM_OP
, stream
);
5092 assemble_name (stream
, name
);
5093 putc ('\n', stream
);
5095 #endif /* GLOBAL_ASM_OP */
5097 /* Default function to output a label for unwind information. The
5098 default is to do nothing. A target that needs nonlocal labels for
5099 unwind information must provide its own function to do this. */
5101 default_emit_unwind_label (FILE * stream ATTRIBUTE_UNUSED
,
5102 tree decl ATTRIBUTE_UNUSED
,
5103 int for_eh ATTRIBUTE_UNUSED
,
5104 int empty ATTRIBUTE_UNUSED
)
5108 /* This is how to output an internal numbered label where PREFIX is
5109 the class of label and LABELNO is the number within the class. */
5112 default_internal_label (FILE *stream
, const char *prefix
,
5113 unsigned long labelno
)
5115 char *const buf
= alloca (40 + strlen (prefix
));
5116 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5117 ASM_OUTPUT_LABEL (stream
, buf
);
5120 /* This is the default behavior at the beginning of a file. It's
5121 controlled by two other target-hook toggles. */
5123 default_file_start (void)
5125 if (targetm
.file_start_app_off
&& !flag_verbose_asm
)
5126 fputs (ASM_APP_OFF
, asm_out_file
);
5128 if (targetm
.file_start_file_directive
)
5129 output_file_directive (asm_out_file
, main_input_filename
);
5132 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5133 which emits a special section directive used to indicate whether or
5134 not this object file needs an executable stack. This is primarily
5135 a GNU extension to ELF but could be used on other targets. */
5137 int trampolines_created
;
5140 file_end_indicate_exec_stack (void)
5142 unsigned int flags
= SECTION_DEBUG
;
5143 if (trampolines_created
)
5144 flags
|= SECTION_CODE
;
5146 named_section_flags (".note.GNU-stack", flags
);
5149 #include "gt-varasm.h"