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 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"
48 #include "langhooks.h"
53 #ifdef XCOFF_DEBUGGING_INFO
54 #include "xcoffout.h" /* Needed for external data
55 declarations for e.g. AIX 4.x. */
58 #ifndef TRAMPOLINE_ALIGNMENT
59 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
63 #define ASM_STABS_OP "\t.stabs\t"
66 /* The (assembler) name of the first globally-visible object output. */
67 const char *first_global_object_name
;
68 const char *weak_global_object_name
;
71 struct constant_descriptor_rtx
;
75 #define MAX_RTX_HASH_TABLE 61
77 struct varasm_status
GTY(())
79 /* Hash facility for making memory-constants
80 from constant rtl-expressions. It is used on RISC machines
81 where immediate integer arguments and constant addresses are restricted
82 so that such constants must be stored in memory.
84 This pool of constants is reinitialized for each function
85 so each function gets its own constants-pool that comes right before
87 struct constant_descriptor_rtx
** GTY ((length ("MAX_RTX_HASH_TABLE")))
88 x_const_rtx_hash_table
;
89 struct pool_constant
** GTY ((length ("MAX_RTX_HASH_TABLE")))
90 x_const_rtx_sym_hash_table
;
92 /* Pointers to first and last constant in pool. */
93 struct pool_constant
*x_first_pool
;
94 struct pool_constant
*x_last_pool
;
96 /* Current offset in constant pool (does not include any machine-specific
98 HOST_WIDE_INT x_pool_offset
;
101 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
102 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
103 #define first_pool (cfun->varasm->x_first_pool)
104 #define last_pool (cfun->varasm->x_last_pool)
105 #define pool_offset (cfun->varasm->x_pool_offset)
107 /* Number for making the label on the next
108 constant that is stored in memory. */
110 static GTY(()) int const_labelno
;
112 /* Number for making the label on the next
113 static variable internal to a function. */
115 static GTY(()) int var_labelno
;
117 /* Carry information from ASM_DECLARE_OBJECT_NAME
118 to ASM_FINISH_DECLARE_OBJECT. */
120 int size_directive_output
;
122 /* The last decl for which assemble_variable was called,
123 if it did ASM_DECLARE_OBJECT_NAME.
124 If the last call to assemble_variable didn't do that,
127 tree last_assemble_variable_decl
;
129 /* RTX_UNCHANGING_P in a MEM can mean it is stored into, for initialization.
130 So giving constant the alias set for the type will allow such
131 initializations to appear to conflict with the load of the constant. We
132 avoid this by giving all constants an alias set for just constants.
133 Since there will be no stores to that alias set, nothing will ever
134 conflict with them. */
136 static HOST_WIDE_INT const_alias_set
;
138 static const char *strip_reg_name
PARAMS ((const char *));
139 static int contains_pointers_p
PARAMS ((tree
));
140 static void decode_addr_const
PARAMS ((tree
, struct addr_const
*));
141 static unsigned int const_hash
PARAMS ((tree
));
142 static unsigned int const_hash_1
PARAMS ((tree
));
143 static int compare_constant
PARAMS ((tree
, tree
));
144 static tree copy_constant
PARAMS ((tree
));
145 static void output_constant_def_contents
PARAMS ((tree
, int, int));
146 static void decode_rtx_const
PARAMS ((enum machine_mode
, rtx
,
147 struct rtx_const
*));
148 static unsigned int const_hash_rtx
PARAMS ((enum machine_mode
, rtx
));
149 static int compare_constant_rtx
150 PARAMS ((enum machine_mode
, rtx
, struct constant_descriptor_rtx
*));
151 static struct constant_descriptor_rtx
* record_constant_rtx
152 PARAMS ((enum machine_mode
, rtx
));
153 static struct pool_constant
*find_pool_constant
PARAMS ((struct function
*, rtx
));
154 static void mark_constant_pool
PARAMS ((void));
155 static void mark_constants
PARAMS ((rtx
));
156 static int mark_constant
PARAMS ((rtx
*current_rtx
, void *data
));
157 static int output_addressed_constants
PARAMS ((tree
));
158 static void output_after_function_constants
PARAMS ((void));
159 static unsigned HOST_WIDE_INT array_size_for_constructor
PARAMS ((tree
));
160 static unsigned min_align
PARAMS ((unsigned, unsigned));
161 static void output_constructor
PARAMS ((tree
, HOST_WIDE_INT
,
163 static void globalize_decl
PARAMS ((tree
));
164 static void maybe_assemble_visibility
PARAMS ((tree
));
165 static int in_named_entry_eq
PARAMS ((const PTR
, const PTR
));
166 static hashval_t in_named_entry_hash
PARAMS ((const PTR
));
167 #ifdef ASM_OUTPUT_BSS
168 static void asm_output_bss
PARAMS ((FILE *, tree
, const char *, int, int));
170 #ifdef BSS_SECTION_ASM_OP
171 #ifdef ASM_OUTPUT_ALIGNED_BSS
172 static void asm_output_aligned_bss
173 PARAMS ((FILE *, tree
, const char *, int, int)) ATTRIBUTE_UNUSED
;
175 #endif /* BSS_SECTION_ASM_OP */
176 static hashval_t const_str_htab_hash
PARAMS ((const void *x
));
177 static int const_str_htab_eq
PARAMS ((const void *x
, const void *y
));
178 static bool asm_emit_uninitialised
PARAMS ((tree
, const char*, int, int));
179 static void resolve_unique_section
PARAMS ((tree
, int, int));
180 static void mark_weak
PARAMS ((tree
));
182 enum in_section
{ no_section
, in_text
, in_data
, in_named
183 #ifdef BSS_SECTION_ASM_OP
186 #ifdef CTORS_SECTION_ASM_OP
189 #ifdef DTORS_SECTION_ASM_OP
192 #ifdef READONLY_DATA_SECTION_ASM_OP
195 #ifdef EXTRA_SECTIONS
199 static GTY(()) enum in_section in_section
= no_section
;
201 /* Return a nonzero value if DECL has a section attribute. */
202 #ifndef IN_NAMED_SECTION
203 #define IN_NAMED_SECTION(DECL) \
204 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
205 && DECL_SECTION_NAME (DECL) != NULL_TREE)
208 /* Text of section name when in_section == in_named. */
209 static GTY(()) const char *in_named_name
;
211 /* Hash table of flags that have been used for a particular named section. */
213 struct in_named_entry
GTY(())
220 static GTY((param_is (struct in_named_entry
))) htab_t in_named_htab
;
222 /* Define functions like text_section for any extra sections. */
223 #ifdef EXTRA_SECTION_FUNCTIONS
224 EXTRA_SECTION_FUNCTIONS
227 /* Tell assembler to switch to text section. */
232 if (in_section
!= in_text
)
234 in_section
= in_text
;
238 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
243 /* Tell assembler to switch to data section. */
248 if (in_section
!= in_data
)
250 in_section
= in_data
;
251 if (flag_shared_data
)
253 #ifdef SHARED_SECTION_ASM_OP
254 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
256 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
260 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
264 /* Tell assembler to switch to read-only data section. This is normally
268 readonly_data_section ()
270 #ifdef READONLY_DATA_SECTION
271 READONLY_DATA_SECTION (); /* Note this can call data_section. */
273 #ifdef READONLY_DATA_SECTION_ASM_OP
274 if (in_section
!= in_readonly_data
)
276 in_section
= in_readonly_data
;
277 fputs (READONLY_DATA_SECTION_ASM_OP
, asm_out_file
);
278 fputc ('\n', asm_out_file
);
286 /* Determine if we're in the text section. */
291 return in_section
== in_text
;
294 /* Determine if we're in the data section. */
299 return in_section
== in_data
;
302 /* Helper routines for maintaining in_named_htab. */
305 in_named_entry_eq (p1
, p2
)
309 const struct in_named_entry
*old
= p1
;
310 const char *new = p2
;
312 return strcmp (old
->name
, new) == 0;
316 in_named_entry_hash (p
)
319 const struct in_named_entry
*old
= p
;
320 return htab_hash_string (old
->name
);
323 /* If SECTION has been seen before as a named section, return the flags
324 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
325 set of flags for a section to have, so 0 does not mean that the section
326 has not been seen. */
329 get_named_section_flags (section
)
332 struct in_named_entry
**slot
;
334 slot
= (struct in_named_entry
**)
335 htab_find_slot_with_hash (in_named_htab
, section
,
336 htab_hash_string (section
), NO_INSERT
);
338 return slot
? (*slot
)->flags
: 0;
341 /* Returns true if the section has been declared before. Sets internal
342 flag on this section in in_named_hash so subsequent calls on this
343 section will return false. */
346 named_section_first_declaration (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 (section
, flags
)
374 struct in_named_entry
**slot
, *entry
;
376 slot
= (struct in_named_entry
**)
377 htab_find_slot_with_hash (in_named_htab
, section
,
378 htab_hash_string (section
), INSERT
);
383 entry
= (struct in_named_entry
*) ggc_alloc (sizeof (*entry
));
385 entry
->name
= ggc_strdup (section
);
386 entry
->flags
= flags
;
387 entry
->declared
= false;
389 else if (entry
->flags
!= flags
)
395 /* Tell assembler to change to section NAME with attributes FLAGS. */
398 named_section_flags (name
, flags
)
402 if (in_section
!= in_named
|| strcmp (name
, in_named_name
) != 0)
404 if (! set_named_section_flags (name
, flags
))
407 (*targetm
.asm_out
.named_section
) (name
, flags
);
409 if (flags
& SECTION_FORGET
)
410 in_section
= no_section
;
413 in_named_name
= ggc_strdup (name
);
414 in_section
= in_named
;
419 /* Tell assembler to change to section NAME for DECL.
420 If DECL is NULL, just switch to section NAME.
421 If NAME is NULL, get the name from DECL.
422 If RELOC is 1, the initializer for DECL contains relocs. */
425 named_section (decl
, name
, reloc
)
432 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
435 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
437 flags
= (* targetm
.section_type_flags
) (decl
, name
, reloc
);
439 /* Sanity check user variables for flag changes. Non-user
440 section flag changes will abort in named_section_flags.
441 However, don't complain if SECTION_OVERRIDE is set.
442 We trust that the setter knows that it is safe to ignore
443 the default flags for this decl. */
444 if (decl
&& ! set_named_section_flags (name
, flags
))
446 flags
= get_named_section_flags (name
);
447 if ((flags
& SECTION_OVERRIDE
) == 0)
448 error_with_decl (decl
, "%s causes a section type conflict");
451 named_section_flags (name
, flags
);
454 /* If required, set DECL_SECTION_NAME to a unique name. */
457 resolve_unique_section (decl
, reloc
, flag_function_or_data_sections
)
459 int reloc ATTRIBUTE_UNUSED
;
460 int flag_function_or_data_sections
;
462 if (DECL_SECTION_NAME (decl
) == NULL_TREE
463 && targetm
.have_named_sections
464 && (flag_function_or_data_sections
465 || DECL_ONE_ONLY (decl
)))
466 (*targetm
.asm_out
.unique_section
) (decl
, reloc
);
469 #ifdef BSS_SECTION_ASM_OP
471 /* Tell the assembler to switch to the bss section. */
476 if (in_section
!= in_bss
)
478 #ifdef SHARED_BSS_SECTION_ASM_OP
479 if (flag_shared_data
)
480 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
483 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
489 #ifdef ASM_OUTPUT_BSS
491 /* Utility function for ASM_OUTPUT_BSS for targets to use if
492 they don't support alignments in .bss.
493 ??? It is believed that this function will work in most cases so such
494 support is localized here. */
497 asm_output_bss (file
, decl
, name
, size
, rounded
)
499 tree decl ATTRIBUTE_UNUSED
;
501 int size ATTRIBUTE_UNUSED
, rounded
;
503 (*targetm
.asm_out
.globalize_label
) (file
, name
);
505 #ifdef ASM_DECLARE_OBJECT_NAME
506 last_assemble_variable_decl
= decl
;
507 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
509 /* Standard thing is just output label for the object. */
510 ASM_OUTPUT_LABEL (file
, name
);
511 #endif /* ASM_DECLARE_OBJECT_NAME */
512 ASM_OUTPUT_SKIP (file
, rounded
? rounded
: 1);
517 #ifdef ASM_OUTPUT_ALIGNED_BSS
519 /* Utility function for targets to use in implementing
520 ASM_OUTPUT_ALIGNED_BSS.
521 ??? It is believed that this function will work in most cases so such
522 support is localized here. */
525 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
527 tree decl ATTRIBUTE_UNUSED
;
532 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
533 #ifdef ASM_DECLARE_OBJECT_NAME
534 last_assemble_variable_decl
= decl
;
535 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
537 /* Standard thing is just output label for the object. */
538 ASM_OUTPUT_LABEL (file
, name
);
539 #endif /* ASM_DECLARE_OBJECT_NAME */
540 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
545 #endif /* BSS_SECTION_ASM_OP */
547 /* Switch to the section for function DECL.
549 If DECL is NULL_TREE, switch to the text section.
550 ??? It's not clear that we will ever be passed NULL_TREE, but it's
551 safer to handle it. */
554 function_section (decl
)
557 if (decl
!= NULL_TREE
558 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
559 named_section (decl
, (char *) 0, 0);
564 /* Switch to section for variable DECL. RELOC is the same as the
565 argument to SELECT_SECTION. */
568 variable_section (decl
, reloc
)
572 if (IN_NAMED_SECTION (decl
))
573 named_section (decl
, NULL
, reloc
);
575 (*targetm
.asm_out
.select_section
) (decl
, reloc
, DECL_ALIGN (decl
));
578 /* Tell assembler to switch to the section for string merging. */
581 mergeable_string_section (decl
, align
, flags
)
582 tree decl ATTRIBUTE_UNUSED
;
583 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
584 unsigned int flags ATTRIBUTE_UNUSED
;
586 #ifdef HAVE_GAS_SHF_MERGE
587 if (flag_merge_constants
588 && TREE_CODE (decl
) == STRING_CST
589 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
591 && TREE_STRING_LENGTH (decl
) >= int_size_in_bytes (TREE_TYPE (decl
)))
593 enum machine_mode mode
;
594 unsigned int modesize
;
599 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (decl
)));
600 modesize
= GET_MODE_BITSIZE (mode
);
601 if (modesize
>= 8 && modesize
<= 256
602 && (modesize
& (modesize
- 1)) == 0)
604 if (align
< modesize
)
607 str
= TREE_STRING_POINTER (decl
);
608 len
= TREE_STRING_LENGTH (decl
);
609 unit
= GET_MODE_SIZE (mode
);
611 /* Check for embedded NUL characters. */
612 for (i
= 0; i
< len
; i
+= unit
)
614 for (j
= 0; j
< unit
; j
++)
615 if (str
[i
+ j
] != '\0')
622 sprintf (name
, ".rodata.str%d.%d", modesize
/ 8,
624 flags
|= (modesize
/ 8) | SECTION_MERGE
| SECTION_STRINGS
;
625 if (!i
&& modesize
< align
)
627 /* A "" string with requested alignment greater than
628 character size might cause a problem:
629 if some other string required even bigger
630 alignment than "", then linker might think the
631 "" is just part of padding after some other string
632 and not put it into the hash table initially.
633 But this means "" could have smaller alignment
635 #ifdef ASM_OUTPUT_SECTION_START
636 named_section_flags (name
, flags
);
637 ASM_OUTPUT_SECTION_START (asm_out_file
);
639 readonly_data_section ();
644 named_section_flags (name
, flags
);
650 readonly_data_section ();
653 /* Tell assembler to switch to the section for constant merging. */
656 mergeable_constant_section (mode
, align
, flags
)
657 enum machine_mode mode ATTRIBUTE_UNUSED
;
658 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
659 unsigned int flags ATTRIBUTE_UNUSED
;
661 #ifdef HAVE_GAS_SHF_MERGE
662 unsigned int modesize
= GET_MODE_BITSIZE (mode
);
664 if (flag_merge_constants
670 && (align
& (align
- 1)) == 0)
674 sprintf (name
, ".rodata.cst%d", (int) (align
/ 8));
675 flags
|= (align
/ 8) | SECTION_MERGE
;
676 named_section_flags (name
, flags
);
680 readonly_data_section ();
683 /* Given NAME, a putative register name, discard any customary prefixes. */
686 strip_reg_name (name
)
689 #ifdef REGISTER_PREFIX
690 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
691 name
+= strlen (REGISTER_PREFIX
);
693 if (name
[0] == '%' || name
[0] == '#')
698 /* Decode an `asm' spec for a declaration as a register name.
699 Return the register number, or -1 if nothing specified,
700 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
701 or -3 if ASMSPEC is `cc' and is not recognized,
702 or -4 if ASMSPEC is `memory' and is not recognized.
703 Accept an exact spelling or a decimal number.
704 Prefixes such as % are optional. */
707 decode_reg_name (asmspec
)
714 /* Get rid of confusing prefixes. */
715 asmspec
= strip_reg_name (asmspec
);
717 /* Allow a decimal number as a "register name". */
718 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
719 if (! ISDIGIT (asmspec
[i
]))
721 if (asmspec
[0] != 0 && i
< 0)
724 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
730 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
732 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
735 #ifdef ADDITIONAL_REGISTER_NAMES
737 static const struct { const char *const name
; const int number
; } table
[]
738 = ADDITIONAL_REGISTER_NAMES
;
740 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
741 if (! strcmp (asmspec
, table
[i
].name
))
742 return table
[i
].number
;
744 #endif /* ADDITIONAL_REGISTER_NAMES */
746 if (!strcmp (asmspec
, "memory"))
749 if (!strcmp (asmspec
, "cc"))
758 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
759 have static storage duration. In other words, it should not be an
760 automatic variable, including PARM_DECLs.
762 There is, however, one exception: this function handles variables
763 explicitly placed in a particular register by the user.
765 ASMSPEC, if not 0, is the string which the user specified as the
766 assembler symbol name.
768 This is never called for PARM_DECL nodes. */
771 make_decl_rtl (decl
, asmspec
)
775 int top_level
= (DECL_CONTEXT (decl
) == NULL_TREE
);
776 const char *name
= 0;
777 const char *new_name
= 0;
781 /* Check that we are not being given an automatic variable. */
782 /* A weak alias has TREE_PUBLIC set but not the other bits. */
783 if (TREE_CODE (decl
) == PARM_DECL
784 || TREE_CODE (decl
) == RESULT_DECL
785 || (TREE_CODE (decl
) == VAR_DECL
786 && !TREE_STATIC (decl
)
787 && !TREE_PUBLIC (decl
)
788 && !DECL_EXTERNAL (decl
)
789 && !DECL_REGISTER (decl
)))
791 /* And that we were not given a type or a label. */
792 else if (TREE_CODE (decl
) == TYPE_DECL
793 || TREE_CODE (decl
) == LABEL_DECL
)
796 /* For a duplicate declaration, we can be called twice on the
797 same DECL node. Don't discard the RTL already made. */
798 if (DECL_RTL_SET_P (decl
))
800 /* If the old RTL had the wrong mode, fix the mode. */
801 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
802 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
803 DECL_MODE (decl
), 0));
805 /* ??? Another way to do this would be to maintain a hashed
806 table of such critters. Instead of adding stuff to a DECL
807 to give certain attributes to it, we could use an external
808 hash map from DECL to set of attributes. */
810 /* Let the target reassign the RTL if it wants.
811 This is necessary, for example, when one machine specific
812 decl attribute overrides another. */
813 (* targetm
.encode_section_info
) (decl
, false);
817 new_name
= name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
819 reg_number
= decode_reg_name (asmspec
);
820 if (reg_number
== -2)
822 /* ASMSPEC is given, and not the name of a register. Mark the
823 name with a star so assemble_name won't munge it. */
824 char *starred
= alloca (strlen (asmspec
) + 2);
826 strcpy (starred
+ 1, asmspec
);
830 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
832 /* First detect errors in declaring global registers. */
833 if (reg_number
== -1)
834 error_with_decl (decl
, "register name not specified for `%s'");
835 else if (reg_number
< 0)
836 error_with_decl (decl
, "invalid register name for `%s'");
837 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
838 error_with_decl (decl
,
839 "data type of `%s' isn't suitable for a register");
840 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
841 error_with_decl (decl
,
842 "register specified for `%s' isn't suitable for data type");
843 /* Now handle properly declared static register variables. */
848 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
850 DECL_INITIAL (decl
) = 0;
851 error ("global register variable has initial value");
853 if (TREE_THIS_VOLATILE (decl
))
854 warning ("volatile register variables don't work as you might wish");
856 /* If the user specified one of the eliminables registers here,
857 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
858 confused with that register and be eliminated. This usage is
859 somewhat suspect... */
861 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
862 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
863 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
865 if (TREE_STATIC (decl
))
867 /* Make this register global, so not usable for anything
869 #ifdef ASM_DECLARE_REGISTER_GLOBAL
870 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
872 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
874 globalize_reg (reg_number
+ --nregs
);
877 /* As a register variable, it has no section. */
882 /* Now handle ordinary static variables and functions (in memory).
883 Also handle vars declared register invalidly. */
885 if (reg_number
>= 0 || reg_number
== -3)
886 error_with_decl (decl
,
887 "register name given for non-register variable `%s'");
889 /* Specifying a section attribute on a variable forces it into a
890 non-.bss section, and thus it cannot be common. */
891 if (TREE_CODE (decl
) == VAR_DECL
892 && DECL_SECTION_NAME (decl
) != NULL_TREE
893 && DECL_INITIAL (decl
) == NULL_TREE
894 && DECL_COMMON (decl
))
895 DECL_COMMON (decl
) = 0;
897 /* Variables can't be both common and weak. */
898 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
899 DECL_COMMON (decl
) = 0;
901 /* Can't use just the variable's own name for a variable
902 whose scope is less than the whole file, unless it's a member
903 of a local class (which will already be unambiguous).
904 Concatenate a distinguishing number. */
905 if (!top_level
&& !TREE_PUBLIC (decl
)
906 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
908 && name
== IDENTIFIER_POINTER (DECL_NAME (decl
)))
912 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
917 if (name
!= new_name
)
919 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (new_name
));
920 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
923 x
= gen_rtx_SYMBOL_REF (Pmode
, name
);
924 SYMBOL_REF_WEAK (x
) = DECL_WEAK (decl
);
925 SYMBOL_REF_DECL (x
) = decl
;
927 x
= gen_rtx_MEM (DECL_MODE (decl
), x
);
928 if (TREE_CODE (decl
) != FUNCTION_DECL
)
929 set_mem_attributes (x
, decl
, 1);
930 SET_DECL_RTL (decl
, x
);
932 /* Optionally set flags or add text to the name to record information
933 such as that it is a function name.
934 If the name is changed, the macro ASM_OUTPUT_LABELREF
935 will have to know how to strip this information. */
936 (* targetm
.encode_section_info
) (decl
, true);
939 /* Make the rtl for variable VAR be volatile.
940 Use this only for static variables. */
943 make_var_volatile (var
)
946 if (GET_CODE (DECL_RTL (var
)) != MEM
)
949 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
952 /* Output a string of literal assembler code
953 for an `asm' keyword used between functions. */
956 assemble_asm (string
)
961 if (TREE_CODE (string
) == ADDR_EXPR
)
962 string
= TREE_OPERAND (string
, 0);
964 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
967 /* Record an element in the table of global destructors. SYMBOL is
968 a SYMBOL_REF of the function to be called; PRIORITY is a number
969 between 0 and MAX_INIT_PRIORITY. */
972 default_stabs_asm_out_destructor (symbol
, priority
)
974 int priority ATTRIBUTE_UNUSED
;
976 /* Tell GNU LD that this is part of the static destructor set.
977 This will work for any system that uses stabs, most usefully
979 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
980 assemble_name (asm_out_file
, XSTR (symbol
, 0));
981 fputc ('\n', asm_out_file
);
985 default_named_section_asm_out_destructor (symbol
, priority
)
989 const char *section
= ".dtors";
992 /* ??? This only works reliably with the GNU linker. */
993 if (priority
!= DEFAULT_INIT_PRIORITY
)
995 sprintf (buf
, ".dtors.%.5u",
996 /* Invert the numbering so the linker puts us in the proper
997 order; constructors are run from right to left, and the
998 linker sorts in increasing order. */
999 MAX_INIT_PRIORITY
- priority
);
1003 named_section_flags (section
, SECTION_WRITE
);
1004 assemble_align (POINTER_SIZE
);
1005 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1008 #ifdef DTORS_SECTION_ASM_OP
1012 if (in_section
!= in_dtors
)
1014 in_section
= in_dtors
;
1015 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
1016 fputc ('\n', asm_out_file
);
1021 default_dtor_section_asm_out_destructor (symbol
, priority
)
1023 int priority ATTRIBUTE_UNUSED
;
1026 assemble_align (POINTER_SIZE
);
1027 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1031 /* Likewise for global constructors. */
1034 default_stabs_asm_out_constructor (symbol
, priority
)
1036 int priority ATTRIBUTE_UNUSED
;
1038 /* Tell GNU LD that this is part of the static destructor set.
1039 This will work for any system that uses stabs, most usefully
1041 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
1042 assemble_name (asm_out_file
, XSTR (symbol
, 0));
1043 fputc ('\n', asm_out_file
);
1047 default_named_section_asm_out_constructor (symbol
, 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
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 (symbol
, priority
)
1085 int priority ATTRIBUTE_UNUSED
;
1088 assemble_align (POINTER_SIZE
);
1089 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1093 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1094 a nonzero value if the constant pool should be output before the
1095 start of the function, or a zero value if the pool should output
1096 after the end of the function. The default is to put it before the
1099 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1100 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1103 /* Output assembler code for the constant pool of a function and associated
1104 with defining the name of the function. DECL describes the function.
1105 NAME is the function's name. For the constant pool, we use the current
1106 constant pool data. */
1109 assemble_start_function (decl
, fnname
)
1115 /* The following code does not need preprocessing in the assembler. */
1119 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1120 output_constant_pool (fnname
, decl
);
1122 resolve_unique_section (decl
, 0, flag_function_sections
);
1123 function_section (decl
);
1125 /* Tell assembler to move to target machine's alignment for functions. */
1126 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1127 if (align
< force_align_functions_log
)
1128 align
= force_align_functions_log
;
1131 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1134 /* Handle a user-specified function alignment.
1135 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1136 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1137 if (align_functions_log
> align
1138 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1140 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1141 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1142 align_functions_log
, align_functions
- 1);
1144 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1148 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1149 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1152 (*debug_hooks
->begin_function
) (decl
);
1154 /* Make function name accessible from other files, if appropriate. */
1156 if (TREE_PUBLIC (decl
))
1158 if (! first_global_object_name
)
1163 p
= (* targetm
.strip_name_encoding
) (fnname
);
1166 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1167 first_global_object_name
= name
;
1169 weak_global_object_name
= name
;
1172 globalize_decl (decl
);
1174 maybe_assemble_visibility (decl
);
1177 /* Do any machine/system dependent processing of the function name */
1178 #ifdef ASM_DECLARE_FUNCTION_NAME
1179 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1181 /* Standard thing is just output label for the function. */
1182 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1183 #endif /* ASM_DECLARE_FUNCTION_NAME */
1186 /* Output assembler code associated with defining the size of the
1187 function. DECL describes the function. NAME is the function's name. */
1190 assemble_end_function (decl
, fnname
)
1194 #ifdef ASM_DECLARE_FUNCTION_SIZE
1195 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1197 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1199 output_constant_pool (fnname
, decl
);
1200 function_section (decl
); /* need to switch back */
1203 /* Output any constants which should appear after the function. */
1204 output_after_function_constants ();
1207 /* Assemble code to leave SIZE bytes of zeros. */
1210 assemble_zeros (size
)
1213 /* Do no output if -fsyntax-only. */
1214 if (flag_syntax_only
)
1217 #ifdef ASM_NO_SKIP_IN_TEXT
1218 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1219 so we must output 0s explicitly in the text section. */
1220 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1223 for (i
= 0; i
< size
; i
++)
1224 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1229 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1232 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1235 assemble_align (align
)
1238 if (align
> BITS_PER_UNIT
)
1240 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1244 /* Assemble a string constant with the specified C string as contents. */
1247 assemble_string (p
, size
)
1254 /* If the string is very long, split it up. */
1258 int thissize
= size
- pos
;
1259 if (thissize
> maximum
)
1262 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1270 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1271 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1272 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1274 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1275 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1276 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1278 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1279 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1283 #if defined ASM_OUTPUT_ALIGNED_BSS
1284 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1285 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1287 #if defined ASM_OUTPUT_BSS
1288 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1289 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1295 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1296 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1297 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1299 #if defined ASM_OUTPUT_ALIGNED_COMMON
1300 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1301 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1303 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1304 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1309 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1312 int size ATTRIBUTE_UNUSED
;
1313 int rounded ATTRIBUTE_UNUSED
;
1321 destination
= asm_dest_local
;
1323 /* ??? We should handle .bss via select_section mechanisms rather than
1324 via special target hooks. That would eliminate this special case. */
1325 if (TREE_PUBLIC (decl
))
1327 if (!DECL_COMMON (decl
))
1329 destination
= asm_dest_bss
;
1334 destination
= asm_dest_common
;
1337 if (destination
== asm_dest_bss
)
1338 globalize_decl (decl
);
1339 resolve_unique_section (decl
, 0, flag_data_sections
);
1341 if (flag_shared_data
)
1343 switch (destination
)
1345 #ifdef ASM_OUTPUT_SHARED_BSS
1347 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1350 #ifdef ASM_OUTPUT_SHARED_COMMON
1351 case asm_dest_common
:
1352 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1355 #ifdef ASM_OUTPUT_SHARED_LOCAL
1356 case asm_dest_local
:
1357 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1365 switch (destination
)
1369 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1372 case asm_dest_common
:
1373 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1375 case asm_dest_local
:
1376 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1385 /* Assemble everything that is needed for a variable or function declaration.
1386 Not used for automatic variables, and not used for function definitions.
1387 Should not be called for variables of incomplete structure type.
1389 TOP_LEVEL is nonzero if this variable has file scope.
1390 AT_END is nonzero if this is the special handling, at end of compilation,
1391 to define things that have had only tentative definitions.
1392 DONT_OUTPUT_DATA if nonzero means don't actually output the
1393 initial value (that will be done by the caller). */
1396 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1398 int top_level ATTRIBUTE_UNUSED
;
1399 int at_end ATTRIBUTE_UNUSED
;
1400 int dont_output_data
;
1407 last_assemble_variable_decl
= 0;
1409 /* Normally no need to say anything here for external references,
1410 since assemble_external is called by the language-specific code
1411 when a declaration is first seen. */
1413 if (DECL_EXTERNAL (decl
))
1416 /* Output no assembler code for a function declaration.
1417 Only definitions of functions output anything. */
1419 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1422 /* Do nothing for global register variables. */
1423 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1425 TREE_ASM_WRITTEN (decl
) = 1;
1429 /* If type was incomplete when the variable was declared,
1430 see if it is complete now. */
1432 if (DECL_SIZE (decl
) == 0)
1433 layout_decl (decl
, 0);
1435 /* Still incomplete => don't allocate it; treat the tentative defn
1436 (which is what it must have been) as an `extern' reference. */
1438 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1440 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1441 DECL_SOURCE_LINE (decl
),
1442 "storage size of `%s' isn't known",
1443 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1444 TREE_ASM_WRITTEN (decl
) = 1;
1448 /* The first declaration of a variable that comes through this function
1449 decides whether it is global (in C, has external linkage)
1450 or local (in C, has internal linkage). So do nothing more
1451 if this function has already run. */
1453 if (TREE_ASM_WRITTEN (decl
))
1456 /* Make sure targetm.encode_section_info is invoked before we set
1458 decl_rtl
= DECL_RTL (decl
);
1460 TREE_ASM_WRITTEN (decl
) = 1;
1462 /* Do no output if -fsyntax-only. */
1463 if (flag_syntax_only
)
1468 if (! dont_output_data
1469 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1471 error_with_decl (decl
, "size of variable `%s' is too large");
1475 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1476 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1477 && ! first_global_object_name
1478 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1479 || DECL_INITIAL (decl
) == error_mark_node
))
1480 && ! DECL_WEAK (decl
)
1481 && ! DECL_ONE_ONLY (decl
))
1486 p
= (* targetm
.strip_name_encoding
) (name
);
1487 xname
= xstrdup (p
);
1488 first_global_object_name
= xname
;
1491 /* Compute the alignment of this data. */
1493 align
= DECL_ALIGN (decl
);
1495 /* In the case for initialing an array whose length isn't specified,
1496 where we have not yet been able to do the layout,
1497 figure out the proper alignment now. */
1498 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1499 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1500 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1502 /* Some object file formats have a maximum alignment which they support.
1503 In particular, a.out format supports a maximum alignment of 4. */
1504 #ifndef MAX_OFILE_ALIGNMENT
1505 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1507 if (align
> MAX_OFILE_ALIGNMENT
)
1509 warning_with_decl (decl
,
1510 "alignment of `%s' is greater than maximum object file alignment. Using %d",
1511 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1512 align
= MAX_OFILE_ALIGNMENT
;
1515 /* On some machines, it is good to increase alignment sometimes. */
1516 if (! DECL_USER_ALIGN (decl
))
1518 #ifdef DATA_ALIGNMENT
1519 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1521 #ifdef CONSTANT_ALIGNMENT
1522 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1523 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1527 /* Reset the alignment in case we have made it tighter, so we can benefit
1528 from it in get_pointer_alignment. */
1529 DECL_ALIGN (decl
) = align
;
1530 set_mem_align (decl_rtl
, align
);
1532 if (TREE_PUBLIC (decl
))
1533 maybe_assemble_visibility (decl
);
1535 /* Output any data that we will need to use the address of. */
1536 if (DECL_INITIAL (decl
) == error_mark_node
)
1537 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1538 else if (DECL_INITIAL (decl
))
1539 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1540 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1542 /* Handle uninitialized definitions. */
1544 /* If the decl has been given an explicit section name, then it
1545 isn't common, and shouldn't be handled as such. */
1546 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1548 /* We don't implement common thread-local data at present. */
1549 else if (DECL_THREAD_LOCAL (decl
))
1551 if (DECL_COMMON (decl
))
1552 sorry ("thread-local COMMON data not implemented");
1554 else if (DECL_INITIAL (decl
) == 0
1555 || DECL_INITIAL (decl
) == error_mark_node
1556 || (flag_zero_initialized_in_bss
1557 /* Leave constant zeroes in .rodata so they can be shared. */
1558 && !TREE_READONLY (decl
)
1559 && initializer_zerop (DECL_INITIAL (decl
))))
1561 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1562 unsigned HOST_WIDE_INT rounded
= size
;
1564 /* Don't allocate zero bytes of common,
1565 since that means "undefined external" in the linker. */
1569 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1570 so that each uninitialized object starts on such a boundary. */
1571 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1572 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1573 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1575 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1576 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1578 (decl
, "requested alignment for %s is greater than implemented alignment of %d",rounded
);
1581 /* If the target cannot output uninitialized but not common global data
1582 in .bss, then we have to use .data, so fall through. */
1583 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1587 /* Handle initialized definitions.
1588 Also handle uninitialized global definitions if -fno-common and the
1589 target doesn't support ASM_OUTPUT_BSS. */
1591 /* First make the assembler name(s) global if appropriate. */
1592 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1593 globalize_decl (decl
);
1595 /* Switch to the appropriate section. */
1596 variable_section (decl
, reloc
);
1598 /* dbxout.c needs to know this. */
1599 if (in_text_section ())
1600 DECL_IN_TEXT_SECTION (decl
) = 1;
1602 /* Output the alignment of this data. */
1603 if (align
> BITS_PER_UNIT
)
1605 ASM_OUTPUT_ALIGN (asm_out_file
,
1606 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1609 /* Do any machine/system dependent processing of the object. */
1610 #ifdef ASM_DECLARE_OBJECT_NAME
1611 last_assemble_variable_decl
= decl
;
1612 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1614 /* Standard thing is just output label for the object. */
1615 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1616 #endif /* ASM_DECLARE_OBJECT_NAME */
1618 if (!dont_output_data
)
1620 if (DECL_INITIAL (decl
) && DECL_INITIAL (decl
) != error_mark_node
)
1621 /* Output the actual data. */
1622 output_constant (DECL_INITIAL (decl
),
1623 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1626 /* Leave space for it. */
1627 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1631 /* Return 1 if type TYPE contains any pointers. */
1634 contains_pointers_p (type
)
1637 switch (TREE_CODE (type
))
1640 case REFERENCE_TYPE
:
1641 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1642 so I'll play safe and return 1. */
1648 case QUAL_UNION_TYPE
:
1651 /* For a type that has fields, see if the fields have pointers. */
1652 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1653 if (TREE_CODE (fields
) == FIELD_DECL
1654 && contains_pointers_p (TREE_TYPE (fields
)))
1660 /* An array type contains pointers if its element type does. */
1661 return contains_pointers_p (TREE_TYPE (type
));
1668 /* Output something to declare an external symbol to the assembler.
1669 (Most assemblers don't need this, so we normally output nothing.)
1670 Do nothing if DECL is not external. */
1673 assemble_external (decl
)
1674 tree decl ATTRIBUTE_UNUSED
;
1676 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1677 main body of this code is only rarely exercised. To provide some
1678 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1679 open. If it's not, we should not be calling this function. */
1683 #ifdef ASM_OUTPUT_EXTERNAL
1684 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1686 rtx rtl
= DECL_RTL (decl
);
1688 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1689 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1691 /* Some systems do require some output. */
1692 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1693 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1699 /* Similar, for calling a library function FUN. */
1702 assemble_external_libcall (fun
)
1703 rtx fun ATTRIBUTE_UNUSED
;
1705 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1706 /* Declare library function name external when first used, if nec. */
1707 if (! SYMBOL_REF_USED (fun
))
1709 SYMBOL_REF_USED (fun
) = 1;
1710 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1715 /* Assemble a label named NAME. */
1718 assemble_label (name
)
1721 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1724 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1725 If NAME starts with a *, the rest of NAME is output verbatim.
1726 Otherwise NAME is transformed in an implementation-defined way
1727 (usually by the addition of an underscore).
1728 Many macros in the tm file are defined to call this function. */
1731 assemble_name (file
, name
)
1735 const char *real_name
;
1738 real_name
= (* targetm
.strip_name_encoding
) (name
);
1740 id
= maybe_get_identifier (real_name
);
1742 TREE_SYMBOL_REFERENCED (id
) = 1;
1745 fputs (&name
[1], file
);
1747 ASM_OUTPUT_LABELREF (file
, name
);
1750 /* Allocate SIZE bytes writable static space with a gensym name
1751 and return an RTX to refer to its address. */
1754 assemble_static_space (size
)
1758 const char *namestring
;
1762 if (flag_shared_data
)
1766 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1768 namestring
= ggc_strdup (name
);
1770 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1771 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
1773 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1774 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1777 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1778 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1781 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1782 so that each uninitialized object starts on such a boundary. */
1783 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1784 int rounded ATTRIBUTE_UNUSED
1785 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1786 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1787 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1788 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1795 /* Assemble the static constant template for function entry trampolines.
1796 This is done at most once per compilation.
1797 Returns an RTX for the address of the template. */
1799 #ifdef TRAMPOLINE_TEMPLATE
1801 assemble_trampoline_template ()
1808 /* By default, put trampoline templates in read-only data section. */
1810 #ifdef TRAMPOLINE_SECTION
1811 TRAMPOLINE_SECTION ();
1813 readonly_data_section ();
1816 /* Write the assembler code to define one. */
1817 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1820 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1823 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LTRAMP", 0);
1824 TRAMPOLINE_TEMPLATE (asm_out_file
);
1826 /* Record the rtl to refer to it. */
1827 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1828 name
= ggc_strdup (label
);
1829 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
1830 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
1836 /* A and B are either alignments or offsets. Return the minimum alignment
1837 that may be assumed after adding the two together. */
1839 static inline unsigned
1843 return (a
| b
) & -(a
| b
);
1846 /* Return the assembler directive for creating a given kind of integer
1847 object. SIZE is the number of bytes in the object and ALIGNED_P
1848 indicates whether it is known to be aligned. Return NULL if the
1849 assembly dialect has no such directive.
1851 The returned string should be printed at the start of a new line and
1852 be followed immediately by the object's initial value. */
1855 integer_asm_op (size
, aligned_p
)
1859 struct asm_int_op
*ops
;
1862 ops
= &targetm
.asm_out
.aligned_op
;
1864 ops
= &targetm
.asm_out
.unaligned_op
;
1869 return targetm
.asm_out
.byte_op
;
1883 /* Use directive OP to assemble an integer object X. Print OP at the
1884 start of the line, followed immediately by the value of X. */
1887 assemble_integer_with_op (op
, x
)
1891 fputs (op
, asm_out_file
);
1892 output_addr_const (asm_out_file
, x
);
1893 fputc ('\n', asm_out_file
);
1896 /* The default implementation of the asm_out.integer target hook. */
1899 default_assemble_integer (x
, size
, aligned_p
)
1900 rtx x ATTRIBUTE_UNUSED
;
1901 unsigned int size ATTRIBUTE_UNUSED
;
1902 int aligned_p ATTRIBUTE_UNUSED
;
1904 const char *op
= integer_asm_op (size
, aligned_p
);
1905 return op
&& (assemble_integer_with_op (op
, x
), true);
1908 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1909 the alignment of the integer in bits. Return 1 if we were able to output
1910 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1914 assemble_integer (x
, size
, align
, force
)
1922 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
1924 /* See if the target hook can handle this kind of object. */
1925 if ((*targetm
.asm_out
.integer
) (x
, size
, aligned_p
))
1928 /* If the object is a multi-byte one, try splitting it up. Split
1929 it into words it if is multi-word, otherwise split it into bytes. */
1932 enum machine_mode omode
, imode
;
1933 unsigned int subalign
;
1934 unsigned int subsize
, i
;
1936 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
1937 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
1938 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
1939 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1941 for (i
= 0; i
< size
; i
+= subsize
)
1943 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
1944 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
1950 /* If we've printed some of it, but not all of it, there's no going
1963 assemble_real (d
, mode
, align
)
1965 enum machine_mode mode
;
1970 unsigned int nalign
= min_align (align
, 32);
1972 switch (BITS_PER_UNIT
)
1978 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1979 assemble_integer (GEN_INT (l
), 4, align
, 1);
1982 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1983 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1984 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1987 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
1988 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1989 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1990 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
1993 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
1994 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1995 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1996 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
1997 assemble_integer (GEN_INT (data
[3]), 4, nalign
, 1);
2008 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
2009 assemble_integer (GEN_INT (l
), 2, align
, 1);
2012 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
2013 assemble_integer (GEN_INT (data
[0]), 2, align
, 1);
2014 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
2025 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
2026 assemble_integer (GEN_INT (l
), 1, align
, 1);
2029 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
2030 assemble_integer (GEN_INT (data
[0]), 1, align
, 1);
2031 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
2043 /* Given an expression EXP with a constant value,
2044 reduce it to the sum of an assembler symbol and an integer.
2045 Store them both in the structure *VALUE.
2046 Abort if EXP does not reduce. */
2048 struct addr_const
GTY(())
2051 HOST_WIDE_INT offset
;
2055 decode_addr_const (exp
, value
)
2057 struct addr_const
*value
;
2059 tree target
= TREE_OPERAND (exp
, 0);
2065 if (TREE_CODE (target
) == COMPONENT_REF
2066 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2069 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2070 target
= TREE_OPERAND (target
, 0);
2072 else if (TREE_CODE (target
) == ARRAY_REF
2073 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2075 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2076 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2077 target
= TREE_OPERAND (target
, 0);
2083 switch (TREE_CODE (target
))
2087 x
= DECL_RTL (target
);
2091 x
= gen_rtx_MEM (FUNCTION_MODE
,
2092 gen_rtx_LABEL_REF (VOIDmode
,
2093 label_rtx (TREE_OPERAND (exp
, 0))));
2101 /* This constant should have been output already, but we can't simply
2102 use TREE_CST_RTL since INTEGER_CST doesn't have one. */
2103 x
= output_constant_def (target
, 1);
2110 if (GET_CODE (x
) != MEM
)
2115 value
->offset
= offset
;
2118 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2119 enum kind
{ RTX_UNKNOWN
, RTX_DOUBLE
, RTX_VECTOR
, RTX_INT
, RTX_UNSPEC
};
2120 struct rtx_const
GTY(())
2122 ENUM_BITFIELD(kind
) kind
: 16;
2123 ENUM_BITFIELD(machine_mode
) mode
: 16;
2124 union rtx_const_un
{
2125 REAL_VALUE_TYPE
GTY ((tag ("4"))) du
;
2126 struct rtx_const_u_addr
{
2129 HOST_WIDE_INT offset
;
2130 } GTY ((tag ("1"))) addr
;
2131 struct rtx_const_u_di
{
2134 } GTY ((tag ("0"))) di
;
2136 /* The max vector size we have is 16 wide; two variants for
2137 integral and floating point vectors. */
2138 struct rtx_const_int_vec
{
2141 } GTY ((tag ("2"))) int_vec
[16];
2143 REAL_VALUE_TYPE
GTY ((tag ("3"))) fp_vec
[8];
2145 } GTY ((desc ("%1.kind >= RTX_INT"), descbits ("1"))) un
;
2148 /* Uniquize all constants that appear in memory.
2149 Each constant in memory thus far output is recorded
2150 in `const_hash_table'. */
2152 struct constant_descriptor_tree
GTY(())
2154 /* More constant_descriptors with the same hash code. */
2155 struct constant_descriptor_tree
*next
;
2157 /* The label of the constant. */
2160 /* A MEM for the constant. */
2163 /* The value of the constant. */
2167 #define MAX_HASH_TABLE 1009
2168 static GTY(()) struct constant_descriptor_tree
*
2169 const_hash_table
[MAX_HASH_TABLE
];
2171 /* We maintain a hash table of STRING_CST values. Unless we are asked to force
2172 out a string constant, we defer output of the constants until we know
2173 they are actually used. This will be if something takes its address or if
2174 there is a usage of the string in the RTL of a function. */
2176 #define STRHASH(x) htab_hash_pointer (x)
2178 struct deferred_string
GTY(())
2185 static GTY ((param_is (struct deferred_string
))) htab_t const_str_htab
;
2187 /* Returns a hash code for X (which is a really a
2188 struct deferred_string *). */
2191 const_str_htab_hash (x
)
2194 return STRHASH (((const struct deferred_string
*) x
)->label
);
2197 /* Returns nonzero if the value represented by X (which is really a
2198 struct deferred_string *) is the same as that given by Y
2199 (which is really a char *). */
2202 const_str_htab_eq (x
, y
)
2206 return (((const struct deferred_string
*) x
)->label
== (const char *) y
);
2209 /* Compute a hash code for a constant expression. */
2215 return const_hash_1 (exp
) % MAX_HASH_TABLE
;
2225 enum tree_code code
= TREE_CODE (exp
);
2227 /* Either set P and LEN to the address and len of something to hash and
2228 exit the switch or return a value. */
2233 p
= (char *) &TREE_INT_CST (exp
);
2234 len
= sizeof TREE_INT_CST (exp
);
2238 return real_hash (TREE_REAL_CST_PTR (exp
));
2241 p
= TREE_STRING_POINTER (exp
);
2242 len
= TREE_STRING_LENGTH (exp
);
2246 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2247 + const_hash_1 (TREE_IMAGPART (exp
)));
2250 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2254 len
= int_size_in_bytes (TREE_TYPE (exp
));
2255 tmp
= (char *) alloca (len
);
2256 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2264 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2266 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2267 if (TREE_VALUE (link
))
2268 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2276 struct addr_const value
;
2278 decode_addr_const (exp
, &value
);
2279 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2281 /* Don't hash the address of the SYMBOL_REF;
2282 only use the offset and the symbol name. */
2284 p
= XSTR (value
.base
, 0);
2285 for (i
= 0; p
[i
] != 0; i
++)
2286 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2288 else if (GET_CODE (value
.base
) == LABEL_REF
)
2289 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2297 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2298 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2302 case NON_LVALUE_EXPR
:
2303 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2306 /* A language specific constant. Just hash the code. */
2310 /* Compute hashing function */
2312 for (i
= 0; i
< len
; i
++)
2313 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2318 /* Compare t1 and t2, and return 1 only if they are known to result in
2319 the same bit pattern on output. */
2322 compare_constant (t1
, t2
)
2326 enum tree_code typecode
;
2328 if (t1
== NULL_TREE
)
2329 return t2
== NULL_TREE
;
2330 if (t2
== NULL_TREE
)
2333 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2336 switch (TREE_CODE (t1
))
2339 /* Integer constants are the same only if the same width of type. */
2340 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2342 return tree_int_cst_equal (t1
, t2
);
2345 /* Real constants are the same only if the same width of type. */
2346 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2349 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2352 if (flag_writable_strings
)
2355 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2358 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2359 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2360 TREE_STRING_LENGTH (t1
)));
2363 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2364 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2367 typecode
= TREE_CODE (TREE_TYPE (t1
));
2368 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2371 if (typecode
== SET_TYPE
)
2373 int len
= int_size_in_bytes (TREE_TYPE (t2
));
2374 unsigned char *tmp1
, *tmp2
;
2376 if (int_size_in_bytes (TREE_TYPE (t1
)) != len
)
2379 tmp1
= (unsigned char *) alloca (len
);
2380 tmp2
= (unsigned char *) alloca (len
);
2382 if (get_set_constructor_bytes (t1
, tmp1
, len
) != NULL_TREE
)
2384 if (get_set_constructor_bytes (t2
, tmp2
, len
) != NULL_TREE
)
2387 return memcmp (tmp1
, tmp2
, len
) != 0;
2393 if (typecode
== ARRAY_TYPE
)
2395 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2396 /* For arrays, check that the sizes all match. */
2397 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2399 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2404 /* For record and union constructors, require exact type
2406 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2410 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2412 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2414 /* Check that each value is the same... */
2415 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2417 /* ... and that they apply to the same fields! */
2418 if (typecode
== ARRAY_TYPE
)
2420 if (! compare_constant (TREE_PURPOSE (l1
),
2426 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2431 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2437 struct addr_const value1
, value2
;
2439 decode_addr_const (t1
, &value1
);
2440 decode_addr_const (t2
, &value2
);
2441 return (value1
.offset
== value2
.offset
2442 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2448 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2449 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2453 case NON_LVALUE_EXPR
:
2454 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2459 nt1
= (*lang_hooks
.expand_constant
) (t1
);
2460 nt2
= (*lang_hooks
.expand_constant
) (t2
);
2461 if (nt1
!= t1
|| nt2
!= t2
)
2462 return compare_constant (nt1
, nt2
);
2468 /* Should not get here. */
2472 /* Record a list of constant expressions that were passed to
2473 output_constant_def but that could not be output right away. */
2475 struct deferred_constant
2477 struct deferred_constant
*next
;
2483 static struct deferred_constant
*deferred_constants
;
2485 /* Another list of constants which should be output after the
2487 static struct deferred_constant
*after_function_constants
;
2489 /* Nonzero means defer output of addressed subconstants
2490 (i.e., those for which output_constant_def is called.) */
2491 static int defer_addressed_constants_flag
;
2493 /* Start deferring output of subconstants. */
2496 defer_addressed_constants ()
2498 defer_addressed_constants_flag
++;
2501 /* Stop deferring output of subconstants,
2502 and output now all those that have been deferred. */
2505 output_deferred_addressed_constants ()
2507 struct deferred_constant
*p
, *next
;
2509 defer_addressed_constants_flag
--;
2511 if (defer_addressed_constants_flag
> 0)
2514 for (p
= deferred_constants
; p
; p
= next
)
2516 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2521 deferred_constants
= 0;
2524 /* Output any constants which should appear after a function. */
2527 output_after_function_constants ()
2529 struct deferred_constant
*p
, *next
;
2531 for (p
= after_function_constants
; p
; p
= next
)
2533 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2538 after_function_constants
= 0;
2541 /* Make a copy of the whole tree structure for a constant. This
2542 handles the same types of nodes that compare_constant handles. */
2548 switch (TREE_CODE (exp
))
2551 /* For ADDR_EXPR, we do not want to copy the decl whose address
2552 is requested. We do want to copy constants though. */
2553 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2554 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2555 copy_constant (TREE_OPERAND (exp
, 0)));
2557 return copy_node (exp
);
2562 return copy_node (exp
);
2565 return build_complex (TREE_TYPE (exp
),
2566 copy_constant (TREE_REALPART (exp
)),
2567 copy_constant (TREE_IMAGPART (exp
)));
2571 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2572 copy_constant (TREE_OPERAND (exp
, 0)),
2573 copy_constant (TREE_OPERAND (exp
, 1)));
2577 case NON_LVALUE_EXPR
:
2578 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2579 copy_constant (TREE_OPERAND (exp
, 0)));
2583 tree copy
= copy_node (exp
);
2584 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2587 CONSTRUCTOR_ELTS (copy
) = list
;
2588 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2589 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2590 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2591 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2592 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2600 t
= (*lang_hooks
.expand_constant
) (exp
);
2602 return copy_constant (t
);
2609 /* Return an rtx representing a reference to constant data in memory
2610 for the constant expression EXP.
2612 If assembler code for such a constant has already been output,
2613 return an rtx to refer to it.
2614 Otherwise, output such a constant in memory (or defer it for later)
2615 and generate an rtx for it.
2617 If DEFER is nonzero, the output of string constants can be deferred
2618 and output only if referenced in the function after all optimizations.
2620 The TREE_CST_RTL of EXP is set up to point to that rtx.
2621 The const_hash_table records which constants already have label strings. */
2624 output_constant_def (exp
, defer
)
2629 struct constant_descriptor_tree
*desc
;
2630 struct deferred_string
**defstr
;
2634 int after_function
= 0;
2638 /* We can't just use the saved RTL if this is a deferred string constant
2639 and we are not to defer anymore. */
2640 if (TREE_CODE (exp
) != INTEGER_CST
&& TREE_CST_RTL (exp
)
2641 && (defer
|| !STRING_POOL_ADDRESS_P (XEXP (TREE_CST_RTL (exp
), 0))))
2642 return TREE_CST_RTL (exp
);
2644 /* Make sure any other constants whose addresses appear in EXP
2645 are assigned label numbers. */
2647 reloc
= output_addressed_constants (exp
);
2649 /* Compute hash code of EXP. Search the descriptors for that hash code
2650 to see if any of them describes EXP. If yes, the descriptor records
2651 the label number already assigned. */
2653 hash
= const_hash (exp
);
2655 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
2656 if (compare_constant (exp
, desc
->value
))
2663 /* No constant equal to EXP is known to have been output.
2664 Make a constant descriptor to enter EXP in the hash table.
2665 Assign the label number and record it in the descriptor for
2666 future calls to this function to find. */
2668 /* Create a string containing the label name, in LABEL. */
2669 labelno
= const_labelno
++;
2670 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2672 desc
= ggc_alloc (sizeof (*desc
));
2673 desc
->next
= const_hash_table
[hash
];
2674 desc
->label
= ggc_strdup (label
);
2675 desc
->value
= copy_constant (exp
);
2676 const_hash_table
[hash
] = desc
;
2678 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2679 symbol
= gen_rtx_SYMBOL_REF (Pmode
, desc
->label
);
2680 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2682 rtl
= desc
->rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2684 set_mem_attributes (rtl
, exp
, 1);
2685 set_mem_alias_set (rtl
, 0);
2686 set_mem_alias_set (rtl
, const_alias_set
);
2693 if (TREE_CODE (exp
) != INTEGER_CST
)
2694 TREE_CST_RTL (exp
) = rtl
;
2696 /* Optionally set flags or add text to the name to record information
2697 such as that it is a function name. If the name is changed, the macro
2698 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2699 /* A previously-processed constant would already have section info
2703 /* Take care not to invoke targetm.encode_section_info for
2704 constants which don't have a TREE_CST_RTL. */
2705 if (TREE_CODE (exp
) != INTEGER_CST
)
2706 (*targetm
.encode_section_info
) (exp
, true);
2709 desc
->label
= XSTR (XEXP (desc
->rtl
, 0), 0);
2712 #ifdef CONSTANT_AFTER_FUNCTION_P
2713 if (current_function_decl
!= 0
2714 && CONSTANT_AFTER_FUNCTION_P (exp
))
2719 && STRING_POOL_ADDRESS_P (XEXP (rtl
, 0))
2720 && (!defer
|| defer_addressed_constants_flag
|| after_function
))
2722 defstr
= (struct deferred_string
**)
2723 htab_find_slot_with_hash (const_str_htab
, desc
->label
,
2724 STRHASH (desc
->label
), NO_INSERT
);
2727 /* If the string is currently deferred but we need to output it now,
2728 remove it from deferred string hash table. */
2730 labelno
= (*defstr
)->labelno
;
2731 STRING_POOL_ADDRESS_P (XEXP (rtl
, 0)) = 0;
2732 htab_clear_slot (const_str_htab
, (void **) defstr
);
2736 /* If this is the first time we've seen this particular constant,
2737 output it (or defer its output for later). */
2740 if (defer_addressed_constants_flag
|| after_function
)
2742 struct deferred_constant
*p
2743 = (struct deferred_constant
*)
2744 xmalloc (sizeof (struct deferred_constant
));
2746 p
->exp
= desc
->value
;
2748 p
->labelno
= labelno
;
2751 p
->next
= after_function_constants
;
2752 after_function_constants
= p
;
2756 p
->next
= deferred_constants
;
2757 deferred_constants
= p
;
2762 /* Do no output if -fsyntax-only. */
2763 if (! flag_syntax_only
)
2765 if (TREE_CODE (exp
) != STRING_CST
2767 || flag_writable_strings
2768 || (defstr
= (struct deferred_string
**)
2769 htab_find_slot_with_hash (const_str_htab
,
2771 STRHASH (desc
->label
),
2773 output_constant_def_contents (exp
, reloc
, labelno
);
2776 struct deferred_string
*p
;
2778 p
= (struct deferred_string
*)
2779 ggc_alloc (sizeof (struct deferred_string
));
2781 p
->exp
= desc
->value
;
2782 p
->label
= desc
->label
;
2783 p
->labelno
= labelno
;
2785 STRING_POOL_ADDRESS_P (XEXP (rtl
, 0)) = 1;
2794 /* Now output assembler code to define the label for EXP,
2795 and follow it with the data of EXP. */
2798 output_constant_def_contents (exp
, reloc
, labelno
)
2805 /* Align the location counter as required by EXP's data type. */
2806 align
= TYPE_ALIGN (TREE_TYPE (exp
));
2807 #ifdef CONSTANT_ALIGNMENT
2808 align
= CONSTANT_ALIGNMENT (exp
, align
);
2811 if (IN_NAMED_SECTION (exp
))
2812 named_section (exp
, NULL
, reloc
);
2814 (*targetm
.asm_out
.select_section
) (exp
, reloc
, align
);
2816 if (align
> BITS_PER_UNIT
)
2818 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2821 /* Output the label itself. */
2822 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LC", labelno
);
2824 /* Output the value of EXP. */
2825 output_constant (exp
,
2826 (TREE_CODE (exp
) == STRING_CST
2827 ? MAX (TREE_STRING_LENGTH (exp
),
2828 int_size_in_bytes (TREE_TYPE (exp
)))
2829 : int_size_in_bytes (TREE_TYPE (exp
))),
2834 /* Used in the hash tables to avoid outputting the same constant
2835 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2836 are output once per function, not once per file; there seems
2837 to be no reason for the difference. */
2839 struct constant_descriptor_rtx
GTY(())
2841 /* More constant_descriptors with the same hash code. */
2842 struct constant_descriptor_rtx
*next
;
2844 /* A MEM for the constant. */
2847 /* The value of the constant. */
2848 struct rtx_const value
;
2851 /* Structure to represent sufficient information about a constant so that
2852 it can be output when the constant pool is output, so that function
2853 integration can be done, and to simplify handling on machines that reference
2854 constant pool as base+displacement. */
2856 struct pool_constant
GTY(())
2858 struct constant_descriptor_rtx
*desc
;
2859 struct pool_constant
*next
;
2860 struct pool_constant
*next_sym
;
2862 enum machine_mode mode
;
2865 HOST_WIDE_INT offset
;
2869 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2870 The argument is XSTR (... , 0) */
2872 #define SYMHASH(LABEL) (((unsigned long) (LABEL)) % MAX_RTX_HASH_TABLE)
2874 /* Initialize constant pool hashing for a new function. */
2877 init_varasm_status (f
)
2880 struct varasm_status
*p
;
2881 p
= (struct varasm_status
*) ggc_alloc (sizeof (struct varasm_status
));
2883 p
->x_const_rtx_hash_table
2884 = ((struct constant_descriptor_rtx
**)
2885 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2886 * sizeof (struct constant_descriptor_rtx
*)));
2887 p
->x_const_rtx_sym_hash_table
2888 = ((struct pool_constant
**)
2889 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2890 * sizeof (struct pool_constant
*)));
2892 p
->x_first_pool
= p
->x_last_pool
= 0;
2893 p
->x_pool_offset
= 0;
2897 /* Express an rtx for a constant integer (perhaps symbolic)
2898 as the sum of a symbol or label plus an explicit integer.
2899 They are stored into VALUE. */
2902 decode_rtx_const (mode
, x
, value
)
2903 enum machine_mode mode
;
2905 struct rtx_const
*value
;
2907 /* Clear the whole structure, including any gaps. */
2908 memset (value
, 0, sizeof (struct rtx_const
));
2910 value
->kind
= RTX_INT
; /* Most usual kind. */
2913 switch (GET_CODE (x
))
2916 value
->kind
= RTX_DOUBLE
;
2917 if (GET_MODE (x
) != VOIDmode
)
2919 const REAL_VALUE_TYPE
*r
= CONST_DOUBLE_REAL_VALUE (x
);
2921 value
->mode
= GET_MODE (x
);
2923 /* Copy the REAL_VALUE_TYPE by members so that we don't
2924 copy garbage from the original structure into our
2925 carefully cleaned hashing structure. */
2926 value
->un
.du
.class = r
->class;
2927 value
->un
.du
.sign
= r
->sign
;
2934 value
->un
.du
.exp
= r
->exp
;
2937 memcpy (value
->un
.du
.sig
, r
->sig
, sizeof (r
->sig
));
2945 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
2946 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
2954 units
= CONST_VECTOR_NUNITS (x
);
2955 value
->kind
= RTX_VECTOR
;
2958 if (GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
)
2960 for (i
= 0; i
< units
; ++i
)
2962 rtx elt
= CONST_VECTOR_ELT (x
, i
);
2963 if (GET_CODE (elt
) == CONST_INT
)
2965 value
->un
.int_vec
[i
].low
= INTVAL (elt
);
2966 value
->un
.int_vec
[i
].high
= 0;
2970 value
->un
.int_vec
[i
].low
= CONST_DOUBLE_LOW (elt
);
2971 value
->un
.int_vec
[i
].high
= CONST_DOUBLE_HIGH (elt
);
2975 else if (GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
2977 for (i
= 0; i
< units
; ++i
)
2979 const REAL_VALUE_TYPE
*r
2980 = CONST_DOUBLE_REAL_VALUE (CONST_VECTOR_ELT (x
, i
));
2981 REAL_VALUE_TYPE
*d
= &value
->un
.fp_vec
[i
];
2983 /* Copy the REAL_VALUE_TYPE by members so that we don't
2984 copy garbage from the original structure into our
2985 carefully cleaned hashing structure. */
2986 d
->class = r
->class;
2997 memcpy (d
->sig
, r
->sig
, sizeof (r
->sig
));
3010 value
->un
.addr
.offset
= INTVAL (x
);
3016 value
->un
.addr
.base
= x
;
3021 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3023 value
->un
.addr
.base
= XEXP (x
, 0);
3024 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3026 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3028 value
->un
.addr
.base
= XEXP (x
, 0);
3029 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3033 value
->un
.addr
.base
= x
;
3034 value
->un
.addr
.offset
= 0;
3039 value
->kind
= RTX_UNKNOWN
;
3043 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0
3044 && GET_CODE (value
->un
.addr
.base
) == UNSPEC
)
3046 /* For a simple UNSPEC, the base is set to the
3047 operand, the kind field is set to the index of
3048 the unspec expression.
3049 Together with the code below, in case that
3050 the operand is a SYMBOL_REF or LABEL_REF,
3051 the address of the string or the code_label
3052 is taken as base. */
3053 if (XVECLEN (value
->un
.addr
.base
, 0) == 1)
3055 value
->kind
= RTX_UNSPEC
+ XINT (value
->un
.addr
.base
, 1);
3056 value
->un
.addr
.base
= XVECEXP (value
->un
.addr
.base
, 0, 0);
3060 if (value
->kind
>= RTX_INT
&& value
->un
.addr
.base
!= 0)
3061 switch (GET_CODE (value
->un
.addr
.base
))
3064 /* Use the string's address, not the SYMBOL_REF's address,
3065 for the sake of addresses of library routines. */
3066 value
->un
.addr
.symbol
= XSTR (value
->un
.addr
.base
, 0);
3067 value
->un
.addr
.base
= NULL_RTX
;
3071 /* For a LABEL_REF, compare labels. */
3072 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3079 /* Given a MINUS expression, simplify it if both sides
3080 include the same symbol. */
3083 simplify_subtraction (x
)
3086 struct rtx_const val0
, val1
;
3088 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3089 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3091 if (val0
.kind
>= RTX_INT
3092 && val0
.kind
== val1
.kind
3093 && val0
.un
.addr
.base
== val1
.un
.addr
.base
3094 && val0
.un
.addr
.symbol
== val1
.un
.addr
.symbol
)
3095 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3100 /* Compute a hash code for a constant RTL expression. */
3103 const_hash_rtx (mode
, x
)
3104 enum machine_mode mode
;
3108 struct rtx_const value
;
3109 unsigned int data
[sizeof(struct rtx_const
) / sizeof (unsigned int)];
3115 decode_rtx_const (mode
, x
, &u
.value
);
3117 /* Compute hashing function */
3119 for (i
= 0; i
< ARRAY_SIZE (u
.data
); i
++)
3120 hi
= hi
* 613 + u
.data
[i
];
3122 return hi
% MAX_RTX_HASH_TABLE
;
3125 /* Compare a constant rtl object X with a constant-descriptor DESC.
3126 Return 1 if DESC describes a constant with the same value as X. */
3129 compare_constant_rtx (mode
, x
, desc
)
3130 enum machine_mode mode
;
3132 struct constant_descriptor_rtx
*desc
;
3134 struct rtx_const value
;
3136 decode_rtx_const (mode
, x
, &value
);
3138 /* Compare constant contents. */
3139 return memcmp (&value
, &desc
->value
, sizeof (struct rtx_const
)) == 0;
3142 /* Construct a constant descriptor for the rtl-expression X.
3143 It is up to the caller to enter the descriptor in the hash table. */
3145 static struct constant_descriptor_rtx
*
3146 record_constant_rtx (mode
, x
)
3147 enum machine_mode mode
;
3150 struct constant_descriptor_rtx
*ptr
;
3152 ptr
= (struct constant_descriptor_rtx
*) ggc_alloc (sizeof (*ptr
));
3153 decode_rtx_const (mode
, x
, &ptr
->value
);
3158 /* Given a constant rtx X, return a MEM for the location in memory at which
3159 this constant has been placed. Return 0 if it not has been placed yet. */
3162 mem_for_const_double (x
)
3165 enum machine_mode mode
= GET_MODE (x
);
3166 struct constant_descriptor_rtx
*desc
;
3168 for (desc
= const_rtx_hash_table
[const_hash_rtx (mode
, x
)]; desc
;
3170 if (compare_constant_rtx (mode
, x
, desc
))
3176 /* Given a constant rtx X, make (or find) a memory constant for its value
3177 and return a MEM rtx to refer to it in memory. */
3180 force_const_mem (mode
, x
)
3181 enum machine_mode mode
;
3185 struct constant_descriptor_rtx
*desc
;
3188 struct pool_constant
*pool
;
3191 /* If we're not allowed to drop X into the constant pool, don't. */
3192 if ((*targetm
.cannot_force_const_mem
) (x
))
3195 /* Compute hash code of X. Search the descriptors for that hash code
3196 to see if any of them describes X. If yes, we have an rtx to use. */
3197 hash
= const_hash_rtx (mode
, x
);
3198 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3199 if (compare_constant_rtx (mode
, x
, desc
))
3202 /* No constant equal to X is known to have been output.
3203 Make a constant descriptor to enter X in the hash table
3204 and make a MEM for it. */
3205 desc
= record_constant_rtx (mode
, x
);
3206 desc
->next
= const_rtx_hash_table
[hash
];
3207 const_rtx_hash_table
[hash
] = desc
;
3209 /* Align the location counter as required by EXP's data type. */
3210 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
3211 #ifdef CONSTANT_ALIGNMENT
3212 align
= CONSTANT_ALIGNMENT (make_tree ((*lang_hooks
.types
.type_for_mode
)
3213 (mode
, 0), x
), align
);
3216 pool_offset
+= (align
/ BITS_PER_UNIT
) - 1;
3217 pool_offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
3219 if (GET_CODE (x
) == LABEL_REF
)
3220 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
3222 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3223 pool
= (struct pool_constant
*) ggc_alloc (sizeof (struct pool_constant
));
3227 pool
->labelno
= const_labelno
;
3228 pool
->align
= align
;
3229 pool
->offset
= pool_offset
;
3236 last_pool
->next
= pool
;
3239 pool_offset
+= GET_MODE_SIZE (mode
);
3241 /* Create a string containing the label name, in LABEL. */
3242 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3246 /* Construct the SYMBOL_REF and the MEM. */
3248 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
3249 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
3251 pool
->desc
->rtl
= def
= gen_rtx_MEM (mode
, symbol
);
3252 set_mem_attributes (def
, (*lang_hooks
.types
.type_for_mode
) (mode
, 0), 1);
3253 RTX_UNCHANGING_P (def
) = 1;
3255 /* Add label to symbol hash table. */
3256 hash
= SYMHASH (XSTR (symbol
, 0));
3257 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3258 const_rtx_sym_hash_table
[hash
] = pool
;
3260 /* Mark the symbol_ref as belonging to this constants pool. */
3261 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
3262 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
3263 current_function_uses_const_pool
= 1;
3268 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3269 the corresponding pool_constant structure. */
3271 static struct pool_constant
*
3272 find_pool_constant (f
, addr
)
3276 struct pool_constant
*pool
;
3277 const char *label
= XSTR (addr
, 0);
3279 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3280 pool
= pool
->next_sym
)
3281 if (XSTR (XEXP (pool
->desc
->rtl
, 0), 0) == label
)
3287 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3290 get_pool_constant (addr
)
3293 return (find_pool_constant (cfun
, addr
))->constant
;
3296 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3297 and whether it has been output or not. */
3300 get_pool_constant_mark (addr
, pmarked
)
3304 struct pool_constant
*pool
= find_pool_constant (cfun
, addr
);
3305 *pmarked
= (pool
->mark
!= 0);
3306 return pool
->constant
;
3309 /* Likewise, but for the constant pool of a specific function. */
3312 get_pool_constant_for_function (f
, addr
)
3316 return (find_pool_constant (f
, addr
))->constant
;
3319 /* Similar, return the mode. */
3322 get_pool_mode (addr
)
3325 return (find_pool_constant (cfun
, addr
))->mode
;
3329 get_pool_mode_for_function (f
, addr
)
3333 return (find_pool_constant (f
, addr
))->mode
;
3336 /* Similar, return the offset in the constant pool. */
3339 get_pool_offset (addr
)
3342 return (find_pool_constant (cfun
, addr
))->offset
;
3345 /* Return the size of the constant pool. */
3353 /* Write all the constants in the constant pool. */
3356 output_constant_pool (fnname
, fndecl
)
3357 const char *fnname ATTRIBUTE_UNUSED
;
3358 tree fndecl ATTRIBUTE_UNUSED
;
3360 struct pool_constant
*pool
;
3364 /* It is possible for gcc to call force_const_mem and then to later
3365 discard the instructions which refer to the constant. In such a
3366 case we do not need to output the constant. */
3367 mark_constant_pool ();
3369 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3370 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3373 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3382 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3383 whose CODE_LABEL has been deleted. This can occur if a jump table
3384 is eliminated by optimization. If so, write a constant of zero
3385 instead. Note that this can also happen by turning the
3386 CODE_LABEL into a NOTE. */
3387 /* ??? This seems completely and utterly wrong. Certainly it's
3388 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3389 functioning even with INSN_DELETED_P and friends. */
3392 switch (GET_CODE (x
))
3395 if (GET_CODE (XEXP (x
, 0)) != PLUS
3396 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3398 tmp
= XEXP (XEXP (x
, 0), 0);
3403 if (INSN_DELETED_P (tmp
)
3404 || (GET_CODE (tmp
) == NOTE
3405 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3416 /* First switch to correct section. */
3417 (*targetm
.asm_out
.select_rtx_section
) (pool
->mode
, x
, pool
->align
);
3419 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3420 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3421 pool
->align
, pool
->labelno
, done
);
3424 assemble_align (pool
->align
);
3426 /* Output the label. */
3427 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LC", pool
->labelno
);
3429 /* Output the value of the constant itself. */
3430 switch (GET_MODE_CLASS (pool
->mode
))
3433 if (GET_CODE (x
) != CONST_DOUBLE
)
3436 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3437 assemble_real (r
, pool
->mode
, pool
->align
);
3441 case MODE_PARTIAL_INT
:
3442 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), pool
->align
, 1);
3445 case MODE_VECTOR_FLOAT
:
3450 if (GET_CODE (x
) != CONST_VECTOR
)
3453 units
= CONST_VECTOR_NUNITS (x
);
3455 for (i
= 0; i
< units
; i
++)
3457 elt
= CONST_VECTOR_ELT (x
, i
);
3458 REAL_VALUE_FROM_CONST_DOUBLE (r
, elt
);
3459 assemble_real (r
, GET_MODE_INNER (pool
->mode
), pool
->align
);
3464 case MODE_VECTOR_INT
:
3469 if (GET_CODE (x
) != CONST_VECTOR
)
3472 units
= CONST_VECTOR_NUNITS (x
);
3474 for (i
= 0; i
< units
; i
++)
3476 elt
= CONST_VECTOR_ELT (x
, i
);
3477 assemble_integer (elt
, GET_MODE_UNIT_SIZE (pool
->mode
),
3487 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3488 sections have proper size. */
3489 if (pool
->align
> GET_MODE_BITSIZE (pool
->mode
)
3490 && in_section
== in_named
3491 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3492 assemble_align (pool
->align
);
3494 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3499 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3500 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3503 /* Done with this pool. */
3504 first_pool
= last_pool
= 0;
3507 /* Look through the instructions for this function, and mark all the
3508 entries in the constant pool which are actually being used.
3509 Emit used deferred strings. */
3512 mark_constant_pool ()
3516 struct pool_constant
*pool
;
3518 if (first_pool
== 0 && htab_elements (const_str_htab
) == 0)
3521 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3524 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3526 mark_constants (PATTERN (insn
));
3528 for (link
= current_function_epilogue_delay_list
;
3530 link
= XEXP (link
, 1))
3532 insn
= XEXP (link
, 0);
3535 mark_constants (PATTERN (insn
));
3539 /* Look through appropriate parts of X, marking all entries in the
3540 constant pool which are actually being used. Entries that are only
3541 referenced by other constants are also marked as used. Emit
3542 deferred strings that are used. */
3549 const char *format_ptr
;
3554 if (GET_CODE (x
) == SYMBOL_REF
)
3556 mark_constant (&x
, NULL
);
3560 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3561 insns, not any notes that may be attached. We don't want to mark
3562 a constant just because it happens to appear in a REG_EQUIV note. */
3565 mark_constants (PATTERN (x
));
3569 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3571 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3573 switch (*format_ptr
++)
3576 mark_constants (XEXP (x
, i
));
3580 if (XVEC (x
, i
) != 0)
3584 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3585 mark_constants (XVECEXP (x
, i
, j
));
3605 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3606 to as used. Emit referenced deferred strings. This function can
3607 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3610 mark_constant (current_rtx
, data
)
3612 void *data ATTRIBUTE_UNUSED
;
3614 rtx x
= *current_rtx
;
3619 else if (GET_CODE (x
) == SYMBOL_REF
)
3621 if (CONSTANT_POOL_ADDRESS_P (x
))
3623 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3624 if (pool
->mark
== 0)
3627 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3632 else if (STRING_POOL_ADDRESS_P (x
))
3634 struct deferred_string
**defstr
;
3636 defstr
= (struct deferred_string
**)
3637 htab_find_slot_with_hash (const_str_htab
, XSTR (x
, 0),
3638 STRHASH (XSTR (x
, 0)), NO_INSERT
);
3641 struct deferred_string
*p
= *defstr
;
3643 STRING_POOL_ADDRESS_P (x
) = 0;
3644 output_constant_def_contents (p
->exp
, 0, p
->labelno
);
3645 htab_clear_slot (const_str_htab
, (void **) defstr
);
3652 /* Find all the constants whose addresses are referenced inside of EXP,
3653 and make sure assembler code with a label has been output for each one.
3654 Indicate whether an ADDR_EXPR has been encountered. */
3657 output_addressed_constants (exp
)
3660 int reloc
= 0, reloc2
;
3663 /* Give the front-end a chance to convert VALUE to something that
3664 looks more like a constant to the back-end. */
3665 exp
= (*lang_hooks
.expand_constant
) (exp
);
3667 switch (TREE_CODE (exp
))
3671 /* Go inside any operations that get_inner_reference can handle and see
3672 if what's inside is a constant: no need to do anything here for
3673 addresses of variables or functions. */
3674 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3675 tem
= TREE_OPERAND (tem
, 0))
3678 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
3679 || TREE_CODE (tem
) == CONSTRUCTOR
)
3680 output_constant_def (tem
, 0);
3682 if (TREE_PUBLIC (tem
))
3689 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3690 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3694 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3695 reloc2
= output_addressed_constants (TREE_OPERAND (exp
, 1));
3696 /* The difference of two local labels is computable at link time. */
3697 if (reloc
== 1 && reloc2
== 1)
3705 case NON_LVALUE_EXPR
:
3706 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3710 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3711 if (TREE_VALUE (tem
) != 0)
3712 reloc
|= output_addressed_constants (TREE_VALUE (tem
));
3722 /* Return nonzero if VALUE is a valid constant-valued expression
3723 for use in initializing a static variable; one that can be an
3724 element of a "constant" initializer.
3726 Return null_pointer_node if the value is absolute;
3727 if it is relocatable, return the variable that determines the relocation.
3728 We assume that VALUE has been folded as much as possible;
3729 therefore, we do not need to check for such things as
3730 arithmetic-combinations of integers. */
3733 initializer_constant_valid_p (value
, endtype
)
3737 /* Give the front-end a chance to convert VALUE to something that
3738 looks more like a constant to the back-end. */
3739 value
= (*lang_hooks
.expand_constant
) (value
);
3741 switch (TREE_CODE (value
))
3744 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3745 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3746 && TREE_CONSTANT (value
)
3747 && CONSTRUCTOR_ELTS (value
))
3749 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
3752 return TREE_STATIC (value
) ? null_pointer_node
: 0;
3759 return null_pointer_node
;
3763 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
3765 case VIEW_CONVERT_EXPR
:
3766 case NON_LVALUE_EXPR
:
3767 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3771 /* Allow conversions between pointer types. */
3772 if (POINTER_TYPE_P (TREE_TYPE (value
))
3773 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3774 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3776 /* Allow conversions between real types. */
3777 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3778 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3779 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3781 /* Allow length-preserving conversions between integer types. */
3782 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3783 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3784 && (TYPE_PRECISION (TREE_TYPE (value
))
3785 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3786 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3788 /* Allow conversions between other integer types only if
3790 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3791 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3793 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3795 if (inner
== null_pointer_node
)
3796 return null_pointer_node
;
3800 /* Allow (int) &foo provided int is as wide as a pointer. */
3801 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3802 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3803 && (TYPE_PRECISION (TREE_TYPE (value
))
3804 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3805 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3808 /* Likewise conversions from int to pointers, but also allow
3809 conversions from 0. */
3810 if (POINTER_TYPE_P (TREE_TYPE (value
))
3811 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3813 if (integer_zerop (TREE_OPERAND (value
, 0)))
3814 return null_pointer_node
;
3815 else if (TYPE_PRECISION (TREE_TYPE (value
))
3816 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
3817 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3821 /* Allow conversions to union types if the value inside is okay. */
3822 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
3823 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3828 if (! INTEGRAL_TYPE_P (endtype
)
3829 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3831 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3833 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3835 /* If either term is absolute, use the other terms relocation. */
3836 if (valid0
== null_pointer_node
)
3838 if (valid1
== null_pointer_node
)
3844 if (! INTEGRAL_TYPE_P (endtype
)
3845 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3847 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3849 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3851 /* Win if second argument is absolute. */
3852 if (valid1
== null_pointer_node
)
3854 /* Win if both arguments have the same relocation.
3855 Then the value is absolute. */
3856 if (valid0
== valid1
&& valid0
!= 0)
3857 return null_pointer_node
;
3859 /* Since GCC guarantees that string constants are unique in the
3860 generated code, a subtraction between two copies of the same
3861 constant string is absolute. */
3862 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
3863 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
3864 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
3865 return null_pointer_node
;
3868 /* Support differences between labels. */
3869 if (INTEGRAL_TYPE_P (endtype
))
3872 op0
= TREE_OPERAND (value
, 0);
3873 op1
= TREE_OPERAND (value
, 1);
3875 /* Like STRIP_NOPS except allow the operand mode to widen.
3876 This works around a feature of fold that simplifies
3877 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3878 that the narrower operation is cheaper. */
3880 while (TREE_CODE (op0
) == NOP_EXPR
3881 || TREE_CODE (op0
) == CONVERT_EXPR
3882 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3884 tree inner
= TREE_OPERAND (op0
, 0);
3885 if (inner
== error_mark_node
3886 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3887 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3888 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3893 while (TREE_CODE (op1
) == NOP_EXPR
3894 || TREE_CODE (op1
) == CONVERT_EXPR
3895 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3897 tree inner
= TREE_OPERAND (op1
, 0);
3898 if (inner
== error_mark_node
3899 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3900 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3901 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3906 if (TREE_CODE (op0
) == ADDR_EXPR
3907 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
3908 && TREE_CODE (op1
) == ADDR_EXPR
3909 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
3910 return null_pointer_node
;
3921 /* Output assembler code for constant EXP to FILE, with no label.
3922 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3923 Assumes output_addressed_constants has been done on EXP already.
3925 Generate exactly SIZE bytes of assembler data, padding at the end
3926 with zeros if necessary. SIZE must always be specified.
3928 SIZE is important for structure constructors,
3929 since trailing members may have been omitted from the constructor.
3930 It is also important for initialization of arrays from string constants
3931 since the full length of the string constant might not be wanted.
3932 It is also needed for initialization of unions, where the initializer's
3933 type is just one member, and that may not be as long as the union.
3935 There a case in which we would fail to output exactly SIZE bytes:
3936 for a structure constructor that wants to produce more than SIZE bytes.
3937 But such constructors will never be generated for any possible input.
3939 ALIGN is the alignment of the data in bits. */
3942 output_constant (exp
, size
, align
)
3947 enum tree_code code
;
3948 HOST_WIDE_INT thissize
;
3950 /* Some front-ends use constants other than the standard language-independent
3951 varieties, but which may still be output directly. Give the front-end a
3952 chance to convert EXP to a language-independent representation. */
3953 exp
= (*lang_hooks
.expand_constant
) (exp
);
3955 if (size
== 0 || flag_syntax_only
)
3958 /* Eliminate any conversions since we'll be outputting the underlying
3960 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3961 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3962 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3963 exp
= TREE_OPERAND (exp
, 0);
3965 code
= TREE_CODE (TREE_TYPE (exp
));
3966 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3968 /* Allow a constructor with no elements for any data type.
3969 This means to fill the space with zeros. */
3970 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3972 assemble_zeros (size
);
3976 if (TREE_CODE (exp
) == FDESC_EXPR
)
3978 #ifdef ASM_OUTPUT_FDESC
3979 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3980 tree decl
= TREE_OPERAND (exp
, 0);
3981 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3988 /* Now output the underlying data. If we've handling the padding, return.
3989 Otherwise, break and ensure THISSIZE is the size written. */
3997 case REFERENCE_TYPE
:
3998 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3999 EXPAND_INITIALIZER
),
4001 error ("initializer for integer value is too complicated");
4005 if (TREE_CODE (exp
) != REAL_CST
)
4006 error ("initializer for floating value is not a floating constant");
4008 assemble_real (TREE_REAL_CST (exp
),
4009 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0),
4014 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
4015 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
4016 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
4021 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4023 output_constructor (exp
, size
, align
);
4026 else if (TREE_CODE (exp
) == STRING_CST
)
4028 thissize
= MIN (TREE_STRING_LENGTH (exp
), size
);
4029 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
4031 else if (TREE_CODE (exp
) == VECTOR_CST
)
4035 unsigned int nalign
;
4036 enum machine_mode inner
;
4038 inner
= GET_MODE_INNER (TYPE_MODE (TREE_TYPE (exp
)));
4039 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
4041 elt_size
= GET_MODE_UNIT_SIZE (TYPE_MODE (TREE_TYPE (exp
)));
4043 link
= TREE_VECTOR_CST_ELTS (exp
);
4044 output_constant (TREE_VALUE (link
), elt_size
, align
);
4045 while ((link
= TREE_CHAIN (link
)) != NULL
)
4046 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
4054 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4055 output_constructor (exp
, size
, align
);
4061 if (TREE_CODE (exp
) == INTEGER_CST
)
4062 assemble_integer (expand_expr (exp
, NULL_RTX
,
4063 VOIDmode
, EXPAND_INITIALIZER
),
4064 thissize
, align
, 1);
4065 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4067 unsigned char *buffer
= (unsigned char *) alloca (thissize
);
4068 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
4070 assemble_string ((char *) buffer
, thissize
);
4073 error ("unknown set constructor type");
4085 assemble_zeros (size
);
4089 /* Subroutine of output_constructor, used for computing the size of
4090 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4091 type with an unspecified upper bound. */
4093 static unsigned HOST_WIDE_INT
4094 array_size_for_constructor (val
)
4099 /* This code used to attempt to handle string constants that are not
4100 arrays of single-bytes, but nothing else does, so there's no point in
4102 if (TREE_CODE (val
) == STRING_CST
)
4103 return TREE_STRING_LENGTH (val
);
4105 max_index
= NULL_TREE
;
4106 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
4108 tree index
= TREE_PURPOSE (i
);
4110 if (TREE_CODE (index
) == RANGE_EXPR
)
4111 index
= TREE_OPERAND (index
, 1);
4112 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
4116 if (max_index
== NULL_TREE
)
4119 /* Compute the total number of array elements. */
4120 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
4122 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
4123 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
4125 /* Multiply by the array element unit size to find number of bytes. */
4126 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
4128 return tree_low_cst (i
, 1);
4131 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4132 Generate at least SIZE bytes, padding if necessary. */
4135 output_constructor (exp
, size
, align
)
4140 tree type
= TREE_TYPE (exp
);
4141 tree link
, field
= 0;
4143 /* Number of bytes output or skipped so far.
4144 In other words, current position within the constructor. */
4145 HOST_WIDE_INT total_bytes
= 0;
4146 /* Nonzero means BYTE contains part of a byte, to be output. */
4147 int byte_buffer_in_use
= 0;
4150 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4153 if (TREE_CODE (type
) == RECORD_TYPE
)
4154 field
= TYPE_FIELDS (type
);
4156 if (TREE_CODE (type
) == ARRAY_TYPE
4157 && TYPE_DOMAIN (type
) != 0)
4158 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
4160 /* As LINK goes through the elements of the constant,
4161 FIELD goes through the structure fields, if the constant is a structure.
4162 if the constant is a union, then we override this,
4163 by getting the field from the TREE_LIST element.
4164 But the constant could also be an array. Then FIELD is zero.
4166 There is always a maximum of one element in the chain LINK for unions
4167 (even if the initializer in a source program incorrectly contains
4169 for (link
= CONSTRUCTOR_ELTS (exp
);
4171 link
= TREE_CHAIN (link
),
4172 field
= field
? TREE_CHAIN (field
) : 0)
4174 tree val
= TREE_VALUE (link
);
4177 /* The element in a union constructor specifies the proper field
4179 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4180 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4181 && TREE_PURPOSE (link
) != 0)
4182 field
= TREE_PURPOSE (link
);
4184 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4185 index
= TREE_PURPOSE (link
);
4187 /* Eliminate the marker that makes a cast not be an lvalue. */
4191 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4193 unsigned HOST_WIDE_INT fieldsize
4194 = int_size_in_bytes (TREE_TYPE (type
));
4195 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
4196 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
4197 HOST_WIDE_INT index
;
4198 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
4200 for (index
= lo_index
; index
<= hi_index
; index
++)
4202 /* Output the element's initial value. */
4204 assemble_zeros (fieldsize
);
4206 output_constant (val
, fieldsize
, align2
);
4208 /* Count its size. */
4209 total_bytes
+= fieldsize
;
4212 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4214 /* An element that is not a bit-field. */
4216 unsigned HOST_WIDE_INT fieldsize
;
4217 /* Since this structure is static,
4218 we know the positions are constant. */
4219 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
4220 unsigned int align2
;
4223 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4224 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
4226 /* Output any buffered-up bit-fields preceding this element. */
4227 if (byte_buffer_in_use
)
4229 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4231 byte_buffer_in_use
= 0;
4234 /* Advance to offset of this element.
4235 Note no alignment needed in an array, since that is guaranteed
4236 if each element has the proper size. */
4237 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
4239 assemble_zeros (pos
- total_bytes
);
4243 /* Find the alignment of this element. */
4244 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
4246 /* Determine size this element should occupy. */
4251 /* If this is an array with an unspecified upper bound,
4252 the initializer determines the size. */
4253 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4254 but we cannot do this until the deprecated support for
4255 initializing zero-length array members is removed. */
4256 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4257 && TYPE_DOMAIN (TREE_TYPE (field
))
4258 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4260 fieldsize
= array_size_for_constructor (val
);
4261 /* Given a non-empty initialization, this field had
4263 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4266 else if (DECL_SIZE_UNIT (field
))
4268 /* ??? This can't be right. If the decl size overflows
4269 a host integer we will silently emit no data. */
4270 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4271 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4275 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4277 /* Output the element's initial value. */
4279 assemble_zeros (fieldsize
);
4281 output_constant (val
, fieldsize
, align2
);
4283 /* Count its size. */
4284 total_bytes
+= fieldsize
;
4286 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4287 error ("invalid initial value for member `%s'",
4288 IDENTIFIER_POINTER (DECL_NAME (field
)));
4291 /* Element that is a bit-field. */
4293 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4294 HOST_WIDE_INT end_offset
4295 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4298 val
= integer_zero_node
;
4300 /* If this field does not start in this (or, next) byte,
4302 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4304 /* Output remnant of any bit field in previous bytes. */
4305 if (byte_buffer_in_use
)
4307 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4309 byte_buffer_in_use
= 0;
4312 /* If still not at proper byte, advance to there. */
4313 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4315 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4316 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4320 if (! byte_buffer_in_use
)
4323 /* We must split the element into pieces that fall within
4324 separate bytes, and combine each byte with previous or
4325 following bit-fields. */
4327 /* next_offset is the offset n fbits from the beginning of
4328 the structure to the next bit of this element to be processed.
4329 end_offset is the offset of the first bit past the end of
4331 while (next_offset
< end_offset
)
4335 HOST_WIDE_INT value
;
4336 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4337 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4339 /* Advance from byte to byte
4340 within this element when necessary. */
4341 while (next_byte
!= total_bytes
)
4343 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4348 /* Number of bits we can process at once
4349 (all part of the same byte). */
4350 this_time
= MIN (end_offset
- next_offset
,
4351 BITS_PER_UNIT
- next_bit
);
4352 if (BYTES_BIG_ENDIAN
)
4354 /* On big-endian machine, take the most significant bits
4355 first (of the bits that are significant)
4356 and put them into bytes from the most significant end. */
4357 shift
= end_offset
- next_offset
- this_time
;
4359 /* Don't try to take a bunch of bits that cross
4360 the word boundary in the INTEGER_CST. We can
4361 only select bits from the LOW or HIGH part
4363 if (shift
< HOST_BITS_PER_WIDE_INT
4364 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4366 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4367 shift
= HOST_BITS_PER_WIDE_INT
;
4370 /* Now get the bits from the appropriate constant word. */
4371 if (shift
< HOST_BITS_PER_WIDE_INT
)
4372 value
= TREE_INT_CST_LOW (val
);
4373 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4375 value
= TREE_INT_CST_HIGH (val
);
4376 shift
-= HOST_BITS_PER_WIDE_INT
;
4381 /* Get the result. This works only when:
4382 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4383 byte
|= (((value
>> shift
)
4384 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4385 << (BITS_PER_UNIT
- this_time
- next_bit
));
4389 /* On little-endian machines,
4390 take first the least significant bits of the value
4391 and pack them starting at the least significant
4392 bits of the bytes. */
4393 shift
= next_offset
- int_bit_position (field
);
4395 /* Don't try to take a bunch of bits that cross
4396 the word boundary in the INTEGER_CST. We can
4397 only select bits from the LOW or HIGH part
4399 if (shift
< HOST_BITS_PER_WIDE_INT
4400 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4401 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4403 /* Now get the bits from the appropriate constant word. */
4404 if (shift
< HOST_BITS_PER_WIDE_INT
)
4405 value
= TREE_INT_CST_LOW (val
);
4406 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4408 value
= TREE_INT_CST_HIGH (val
);
4409 shift
-= HOST_BITS_PER_WIDE_INT
;
4414 /* Get the result. This works only when:
4415 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4416 byte
|= (((value
>> shift
)
4417 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4421 next_offset
+= this_time
;
4422 byte_buffer_in_use
= 1;
4427 if (byte_buffer_in_use
)
4429 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4433 if (total_bytes
< size
)
4434 assemble_zeros (size
- total_bytes
);
4437 /* This TREE_LIST contains any weak symbol declarations waiting
4439 static GTY(()) tree weak_decls
;
4441 /* Mark DECL as weak. */
4447 DECL_WEAK (decl
) = 1;
4449 if (DECL_RTL_SET_P (decl
)
4450 && GET_CODE (DECL_RTL (decl
)) == MEM
4451 && XEXP (DECL_RTL (decl
), 0)
4452 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4453 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4456 /* Merge weak status between NEWDECL and OLDDECL. */
4459 merge_weak (newdecl
, olddecl
)
4463 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4466 if (DECL_WEAK (newdecl
))
4470 /* NEWDECL is weak, but OLDDECL is not. */
4472 /* If we already output the OLDDECL, we're in trouble; we can't
4473 go back and make it weak. This error cannot caught in
4474 declare_weak because the NEWDECL and OLDDECL was not yet
4475 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4476 if (TREE_ASM_WRITTEN (olddecl
))
4477 error_with_decl (newdecl
,
4478 "weak declaration of `%s' must precede definition");
4480 /* If we've already generated rtl referencing OLDDECL, we may
4481 have done so in a way that will not function properly with
4483 else if (TREE_USED (olddecl
)
4484 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4485 warning_with_decl (newdecl
, "weak declaration of `%s' after first use results in unspecified behavior");
4489 /* We put the NEWDECL on the weak_decls list at some point.
4490 Replace it with the OLDDECL. */
4491 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4492 if (TREE_VALUE (wd
) == newdecl
)
4494 TREE_VALUE (wd
) = olddecl
;
4497 /* We may not find the entry on the list. If NEWDECL is a
4498 weak alias, then we will have already called
4499 globalize_decl to remove the entry; in that case, we do
4500 not need to do anything. */
4503 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4504 mark_weak (olddecl
);
4507 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4508 weak. Just update NEWDECL to indicate that it's weak too. */
4509 mark_weak (newdecl
);
4512 /* Declare DECL to be a weak symbol. */
4518 if (! TREE_PUBLIC (decl
))
4519 error_with_decl (decl
, "weak declaration of `%s' must be public");
4520 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4521 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4522 else if (SUPPORTS_WEAK
)
4524 if (! DECL_WEAK (decl
))
4525 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4528 warning_with_decl (decl
, "weak declaration of `%s' not supported");
4533 /* Emit any pending weak declarations. */
4540 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4542 tree decl
= TREE_VALUE (t
);
4543 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4544 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4547 if (! TREE_USED (decl
))
4550 #ifdef ASM_WEAKEN_DECL
4551 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4553 #ifdef ASM_WEAKEN_LABEL
4554 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4556 #ifdef ASM_OUTPUT_WEAK_ALIAS
4557 warning ("only weak aliases are supported in this configuration");
4565 /* Emit the assembly bits to indicate that DECL is globally visible. */
4568 globalize_decl (decl
)
4571 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4573 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4574 if (DECL_WEAK (decl
))
4578 #ifdef ASM_WEAKEN_DECL
4579 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4581 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4584 /* Remove this function from the pending weak list so that
4585 we do not emit multiple .weak directives for it. */
4586 for (p
= &weak_decls
; (t
= *p
) ; )
4588 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4589 *p
= TREE_CHAIN (t
);
4591 p
= &TREE_CHAIN (t
);
4597 (*targetm
.asm_out
.globalize_label
) (asm_out_file
, name
);
4600 /* Emit an assembler directive to make the symbol for DECL an alias to
4601 the symbol for TARGET. */
4604 assemble_alias (decl
, target
)
4605 tree decl
, target ATTRIBUTE_UNUSED
;
4609 /* We must force creation of DECL_RTL for debug info generation, even though
4610 we don't use it here. */
4611 make_decl_rtl (decl
, NULL
);
4613 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4615 #ifdef ASM_OUTPUT_DEF
4616 /* Make name accessible from other files, if appropriate. */
4618 if (TREE_PUBLIC (decl
))
4620 globalize_decl (decl
);
4621 maybe_assemble_visibility (decl
);
4624 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4625 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4627 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4629 #else /* !ASM_OUTPUT_DEF */
4630 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4631 if (! DECL_WEAK (decl
))
4632 warning ("only weak aliases are supported in this configuration");
4634 #ifdef ASM_WEAKEN_DECL
4635 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4637 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4640 warning ("alias definitions not supported in this configuration; ignored");
4644 TREE_USED (decl
) = 1;
4645 TREE_ASM_WRITTEN (decl
) = 1;
4646 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4649 /* Emit an assembler directive to set symbol for DECL visibility to
4650 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4653 default_assemble_visibility (decl
, vis
)
4657 static const char * const visibility_types
[] = {
4658 NULL
, "internal", "hidden", "protected"
4661 const char *name
, *type
;
4663 name
= (* targetm
.strip_name_encoding
)
4664 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4665 type
= visibility_types
[vis
];
4667 #ifdef HAVE_GAS_HIDDEN
4668 fprintf (asm_out_file
, "\t.%s\t%s\n", type
, name
);
4670 warning ("visibility attribute not supported in this configuration; ignored");
4674 /* A helper function to call assemble_visibility when needed for a decl. */
4677 maybe_assemble_visibility (decl
)
4680 enum symbol_visibility vis
= decl_visibility (decl
);
4682 if (vis
!= VISIBILITY_DEFAULT
)
4683 (* targetm
.asm_out
.visibility
) (decl
, vis
);
4686 /* Returns 1 if the target configuration supports defining public symbols
4687 so that one of them will be chosen at link time instead of generating a
4688 multiply-defined symbol error, whether through the use of weak symbols or
4689 a target-specific mechanism for having duplicates discarded. */
4692 supports_one_only ()
4694 if (SUPPORTS_ONE_ONLY
)
4696 return SUPPORTS_WEAK
;
4699 /* Set up DECL as a public symbol that can be defined in multiple
4700 translation units without generating a linker error. */
4703 make_decl_one_only (decl
)
4706 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4709 TREE_PUBLIC (decl
) = 1;
4711 if (TREE_CODE (decl
) == VAR_DECL
4712 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4713 DECL_COMMON (decl
) = 1;
4714 else if (SUPPORTS_ONE_ONLY
)
4716 #ifdef MAKE_DECL_ONE_ONLY
4717 MAKE_DECL_ONE_ONLY (decl
);
4719 DECL_ONE_ONLY (decl
) = 1;
4721 else if (SUPPORTS_WEAK
)
4722 DECL_WEAK (decl
) = 1;
4730 const_str_htab
= htab_create_ggc (128, const_str_htab_hash
,
4731 const_str_htab_eq
, NULL
);
4732 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4733 in_named_entry_eq
, NULL
);
4735 const_alias_set
= new_alias_set ();
4739 decl_tls_model (decl
)
4742 enum tls_model kind
;
4743 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4748 attr
= TREE_VALUE (TREE_VALUE (attr
));
4749 if (TREE_CODE (attr
) != STRING_CST
)
4751 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4752 kind
= TLS_MODEL_LOCAL_EXEC
;
4753 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4754 kind
= TLS_MODEL_INITIAL_EXEC
;
4755 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4756 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4757 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4758 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4764 is_local
= (*targetm
.binds_local_p
) (decl
);
4768 kind
= TLS_MODEL_LOCAL_EXEC
;
4770 kind
= TLS_MODEL_INITIAL_EXEC
;
4772 /* Local dynamic is inefficient when we're not combining the
4773 parts of the address. */
4774 else if (optimize
&& is_local
)
4775 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4777 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4778 if (kind
< flag_tls_default
)
4779 kind
= flag_tls_default
;
4784 enum symbol_visibility
4785 decl_visibility (decl
)
4788 tree attr
= lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
));
4792 const char *which
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
4794 if (strcmp (which
, "default") == 0)
4795 return VISIBILITY_DEFAULT
;
4796 if (strcmp (which
, "internal") == 0)
4797 return VISIBILITY_INTERNAL
;
4798 if (strcmp (which
, "hidden") == 0)
4799 return VISIBILITY_HIDDEN
;
4800 if (strcmp (which
, "protected") == 0)
4801 return VISIBILITY_PROTECTED
;
4806 return VISIBILITY_DEFAULT
;
4809 /* Select a set of attributes for section NAME based on the properties
4810 of DECL and whether or not RELOC indicates that DECL's initializer
4811 might contain runtime relocations.
4813 We make the section read-only and executable for a function decl,
4814 read-only for a const data decl, and writable for a non-const data decl. */
4817 default_section_type_flags (decl
, name
, reloc
)
4822 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4826 default_section_type_flags_1 (decl
, name
, reloc
, shlib
)
4834 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4835 flags
= SECTION_CODE
;
4836 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4839 flags
= SECTION_WRITE
;
4841 if (decl
&& DECL_ONE_ONLY (decl
))
4842 flags
|= SECTION_LINKONCE
;
4844 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4845 flags
|= SECTION_TLS
| SECTION_WRITE
;
4847 if (strcmp (name
, ".bss") == 0
4848 || strncmp (name
, ".bss.", 5) == 0
4849 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4850 || strcmp (name
, ".sbss") == 0
4851 || strncmp (name
, ".sbss.", 6) == 0
4852 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0
4853 || strcmp (name
, ".tbss") == 0
4854 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4855 flags
|= SECTION_BSS
;
4857 if (strcmp (name
, ".tdata") == 0
4858 || strcmp (name
, ".tbss") == 0
4859 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0
4860 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4861 flags
|= SECTION_TLS
;
4863 /* These three sections have special ELF types. They are neither
4864 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4865 want to print a section type (@progbits or @nobits). If someone
4866 is silly enough to emit code or TLS variables to one of these
4867 sections, then don't handle them specially. */
4868 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4869 && (strcmp (name
, ".init_array") == 0
4870 || strcmp (name
, ".fini_array") == 0
4871 || strcmp (name
, ".preinit_array") == 0))
4872 flags
|= SECTION_NOTYPE
;
4877 /* Output assembly to switch to section NAME with attribute FLAGS.
4878 Four variants for common object file formats. */
4881 default_no_named_section (name
, flags
)
4882 const char *name ATTRIBUTE_UNUSED
;
4883 unsigned int flags ATTRIBUTE_UNUSED
;
4885 /* Some object formats don't support named sections at all. The
4886 front-end should already have flagged this as an error. */
4891 default_elf_asm_named_section (name
, flags
)
4895 char flagchars
[10], *f
= flagchars
;
4897 if (! named_section_first_declaration (name
))
4899 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4903 if (!(flags
& SECTION_DEBUG
))
4905 if (flags
& SECTION_WRITE
)
4907 if (flags
& SECTION_CODE
)
4909 if (flags
& SECTION_SMALL
)
4911 if (flags
& SECTION_MERGE
)
4913 if (flags
& SECTION_STRINGS
)
4915 if (flags
& SECTION_TLS
)
4919 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4921 if (!(flags
& SECTION_NOTYPE
))
4925 if (flags
& SECTION_BSS
)
4930 fprintf (asm_out_file
, ",@%s", type
);
4932 if (flags
& SECTION_ENTSIZE
)
4933 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4936 putc ('\n', asm_out_file
);
4940 default_coff_asm_named_section (name
, flags
)
4944 char flagchars
[8], *f
= flagchars
;
4946 if (flags
& SECTION_WRITE
)
4948 if (flags
& SECTION_CODE
)
4952 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4956 default_pe_asm_named_section (name
, flags
)
4960 default_coff_asm_named_section (name
, flags
);
4962 if (flags
& SECTION_LINKONCE
)
4964 /* Functions may have been compiled at various levels of
4965 optimization so we can't use `same_size' here.
4966 Instead, have the linker pick one. */
4967 fprintf (asm_out_file
, "\t.linkonce %s\n",
4968 (flags
& SECTION_CODE
? "discard" : "same_size"));
4972 /* Used for vtable gc in GNU binutils. Record that the pointer at OFFSET
4973 from SYMBOL is used in all classes derived from SYMBOL. */
4976 assemble_vtable_entry (symbol
, offset
)
4978 HOST_WIDE_INT offset
;
4980 fputs ("\t.vtable_entry ", asm_out_file
);
4981 output_addr_const (asm_out_file
, symbol
);
4982 fputs (", ", asm_out_file
);
4983 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
, offset
);
4984 fputc ('\n', asm_out_file
);
4987 /* Used for vtable gc in GNU binutils. Record the class hierarchy by noting
4988 that the vtable symbol CHILD is derived from the vtable symbol PARENT. */
4991 assemble_vtable_inherit (child
, parent
)
4994 fputs ("\t.vtable_inherit ", asm_out_file
);
4995 output_addr_const (asm_out_file
, child
);
4996 fputs (", ", asm_out_file
);
4997 output_addr_const (asm_out_file
, parent
);
4998 fputc ('\n', asm_out_file
);
5001 /* The lame default section selector. */
5004 default_select_section (decl
, reloc
, align
)
5007 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
5009 bool readonly
= false;
5013 if (decl_readonly_section (decl
, reloc
))
5016 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
5018 if (! ((flag_pic
&& reloc
)
5019 || !TREE_READONLY (decl
)
5020 || TREE_SIDE_EFFECTS (decl
)
5021 || !TREE_CONSTANT (decl
)))
5024 else if (TREE_CODE (decl
) == STRING_CST
)
5025 readonly
= !flag_writable_strings
;
5026 else if (! (flag_pic
&& reloc
))
5030 readonly_data_section ();
5035 /* A helper function for default_elf_select_section and
5036 default_elf_unique_section. Categorizes the DECL. */
5038 enum section_category
5043 SECCAT_RODATA_MERGE_STR
,
5044 SECCAT_RODATA_MERGE_STR_INIT
,
5045 SECCAT_RODATA_MERGE_CONST
,
5050 /* To optimize loading of shared programs, define following subsections
5052 _REL Contains data that has relocations, so they get grouped
5053 together and dynamic linker will visit fewer pages in memory.
5054 _RO Contains data that is otherwise read-only. This is useful
5055 with prelinking as most relocations won't be dynamically
5056 linked and thus stay read only.
5057 _LOCAL Marks data containing relocations only to local objects.
5058 These relocations will get fully resolved by prelinking. */
5060 SECCAT_DATA_REL_LOCAL
,
5062 SECCAT_DATA_REL_RO_LOCAL
,
5072 static enum section_category
5073 categorize_decl_for_section
PARAMS ((tree
, int, int));
5075 static enum section_category
5076 categorize_decl_for_section (decl
, reloc
, shlib
)
5081 enum section_category ret
;
5083 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5085 else if (TREE_CODE (decl
) == STRING_CST
)
5087 if (flag_writable_strings
)
5090 return SECCAT_RODATA_MERGE_STR
;
5092 else if (TREE_CODE (decl
) == VAR_DECL
)
5094 if (DECL_INITIAL (decl
) == NULL
5095 || DECL_INITIAL (decl
) == error_mark_node
)
5097 else if (! TREE_READONLY (decl
)
5098 || TREE_SIDE_EFFECTS (decl
)
5099 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
5101 if (shlib
&& (reloc
& 2))
5102 ret
= SECCAT_DATA_REL
;
5103 else if (shlib
&& reloc
)
5104 ret
= SECCAT_DATA_REL_LOCAL
;
5108 else if (shlib
&& (reloc
& 2))
5109 ret
= SECCAT_DATA_REL_RO
;
5110 else if (shlib
&& reloc
)
5111 ret
= SECCAT_DATA_REL_RO_LOCAL
;
5112 else if (reloc
|| flag_merge_constants
< 2)
5113 /* C and C++ don't allow different variables to share the same
5114 location. -fmerge-all-constants allows even that (at the
5115 expense of not conforming). */
5116 ret
= SECCAT_RODATA
;
5117 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
5118 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
5120 ret
= SECCAT_RODATA_MERGE_CONST
;
5122 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
5124 if ((shlib
&& reloc
)
5125 || TREE_SIDE_EFFECTS (decl
)
5126 || ! TREE_CONSTANT (decl
))
5129 ret
= SECCAT_RODATA
;
5132 ret
= SECCAT_RODATA
;
5134 /* There are no read-only thread-local sections. */
5135 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5137 if (ret
== SECCAT_BSS
)
5143 /* If the target uses small data sections, select it. */
5144 else if ((*targetm
.in_small_data_p
) (decl
))
5146 if (ret
== SECCAT_BSS
)
5148 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
5149 ret
= SECCAT_SRODATA
;
5158 decl_readonly_section (decl
, reloc
)
5162 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
5166 decl_readonly_section_1 (decl
, reloc
, shlib
)
5171 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5174 case SECCAT_RODATA_MERGE_STR
:
5175 case SECCAT_RODATA_MERGE_STR_INIT
:
5176 case SECCAT_RODATA_MERGE_CONST
:
5177 case SECCAT_SRODATA
:
5186 /* Select a section based on the above categorization. */
5189 default_elf_select_section (decl
, reloc
, align
)
5192 unsigned HOST_WIDE_INT align
;
5194 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
5198 default_elf_select_section_1 (decl
, reloc
, align
, shlib
)
5201 unsigned HOST_WIDE_INT align
;
5204 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5207 /* We're not supposed to be called on FUNCTION_DECLs. */
5210 readonly_data_section ();
5212 case SECCAT_RODATA_MERGE_STR
:
5213 mergeable_string_section (decl
, align
, 0);
5215 case SECCAT_RODATA_MERGE_STR_INIT
:
5216 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
5218 case SECCAT_RODATA_MERGE_CONST
:
5219 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
5221 case SECCAT_SRODATA
:
5222 named_section (NULL_TREE
, ".sdata2", reloc
);
5227 case SECCAT_DATA_REL
:
5228 named_section (NULL_TREE
, ".data.rel", reloc
);
5230 case SECCAT_DATA_REL_LOCAL
:
5231 named_section (NULL_TREE
, ".data.rel.local", reloc
);
5233 case SECCAT_DATA_REL_RO
:
5234 named_section (NULL_TREE
, ".data.rel.ro", reloc
);
5236 case SECCAT_DATA_REL_RO_LOCAL
:
5237 named_section (NULL_TREE
, ".data.rel.ro.local", reloc
);
5240 named_section (NULL_TREE
, ".sdata", reloc
);
5243 named_section (NULL_TREE
, ".tdata", reloc
);
5246 #ifdef BSS_SECTION_ASM_OP
5249 named_section (NULL_TREE
, ".bss", reloc
);
5253 named_section (NULL_TREE
, ".sbss", reloc
);
5256 named_section (NULL_TREE
, ".tbss", reloc
);
5263 /* Construct a unique section name based on the decl name and the
5264 categorization performed above. */
5267 default_unique_section (decl
, reloc
)
5271 default_unique_section_1 (decl
, reloc
, flag_pic
);
5275 default_unique_section_1 (decl
, reloc
, shlib
)
5280 bool one_only
= DECL_ONE_ONLY (decl
);
5281 const char *prefix
, *name
;
5285 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5288 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
5291 case SECCAT_RODATA_MERGE_STR
:
5292 case SECCAT_RODATA_MERGE_STR_INIT
:
5293 case SECCAT_RODATA_MERGE_CONST
:
5294 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
5296 case SECCAT_SRODATA
:
5297 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
5300 case SECCAT_DATA_REL
:
5301 case SECCAT_DATA_REL_LOCAL
:
5302 case SECCAT_DATA_REL_RO
:
5303 case SECCAT_DATA_REL_RO_LOCAL
:
5304 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
5307 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
5310 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
5313 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
5316 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
5319 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
5324 plen
= strlen (prefix
);
5326 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5327 name
= (* targetm
.strip_name_encoding
) (name
);
5328 nlen
= strlen (name
);
5330 string
= alloca (nlen
+ plen
+ 1);
5331 memcpy (string
, prefix
, plen
);
5332 memcpy (string
+ plen
, name
, nlen
+ 1);
5334 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
5338 default_select_rtx_section (mode
, x
, align
)
5339 enum machine_mode mode ATTRIBUTE_UNUSED
;
5341 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
5344 switch (GET_CODE (x
))
5356 readonly_data_section ();
5360 default_elf_select_rtx_section (mode
, x
, align
)
5361 enum machine_mode mode
;
5363 unsigned HOST_WIDE_INT align
;
5365 /* ??? Handle small data here somehow. */
5368 switch (GET_CODE (x
))
5372 named_section (NULL_TREE
, ".data.rel.ro", 3);
5376 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
5383 mergeable_constant_section (mode
, align
, 0);
5386 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
5389 default_encode_section_info (decl
, first
)
5391 int first ATTRIBUTE_UNUSED
;
5396 rtl
= DECL_P (decl
) ? DECL_RTL (decl
) : TREE_CST_RTL (decl
);
5398 /* Careful not to prod global register variables. */
5399 if (GET_CODE (rtl
) != MEM
)
5401 symbol
= XEXP (rtl
, 0);
5402 if (GET_CODE (symbol
) != SYMBOL_REF
)
5406 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5407 flags
|= SYMBOL_FLAG_FUNCTION
;
5408 if ((*targetm
.binds_local_p
) (decl
))
5409 flags
|= SYMBOL_FLAG_LOCAL
;
5410 if ((*targetm
.in_small_data_p
) (decl
))
5411 flags
|= SYMBOL_FLAG_SMALL
;
5412 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5413 flags
|= decl_tls_model (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
5414 if (DECL_P (decl
) && DECL_EXTERNAL (decl
))
5415 flags
|= SYMBOL_FLAG_EXTERNAL
;
5417 SYMBOL_REF_FLAGS (symbol
) = flags
;
5420 /* By default, we do nothing for encode_section_info, so we need not
5421 do anything but discard the '*' marker. */
5424 default_strip_name_encoding (str
)
5427 return str
+ (*str
== '*');
5430 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5431 wrt cross-module name binding. */
5434 default_binds_local_p (exp
)
5437 return default_binds_local_p_1 (exp
, flag_pic
);
5441 default_binds_local_p_1 (exp
, shlib
)
5447 /* A non-decl is an entry in the constant pool. */
5450 /* Static variables are always local. */
5451 else if (! TREE_PUBLIC (exp
))
5453 /* A variable is local if the user tells us so. */
5454 else if (decl_visibility (exp
) != VISIBILITY_DEFAULT
)
5456 /* Otherwise, variables defined outside this object may not be local. */
5457 else if (DECL_EXTERNAL (exp
))
5459 /* Linkonce and weak data are never local. */
5460 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
5462 /* If PIC, then assume that any global name can be overridden by
5463 symbols resolved from other modules. */
5466 /* Uninitialized COMMON variable may be unified with symbols
5467 resolved from other modules. */
5468 else if (DECL_COMMON (exp
)
5469 && (DECL_INITIAL (exp
) == NULL
5470 || DECL_INITIAL (exp
) == error_mark_node
))
5472 /* Otherwise we're left with initialized (or non-common) global data
5473 which is of necessity defined locally. */
5480 /* Determine whether or not a pointer mode is valid. Assume defaults
5481 of ptr_mode or Pmode - can be overridden. */
5483 default_valid_pointer_mode (mode
)
5484 enum machine_mode mode
;
5486 return (mode
== ptr_mode
|| mode
== Pmode
);
5489 /* Default function to output code that will globalize a label. A
5490 target must define GLOBAL_ASM_OP or provide it's own function to
5491 globalize a label. */
5492 #ifdef GLOBAL_ASM_OP
5494 default_globalize_label (stream
, name
)
5498 fputs (GLOBAL_ASM_OP
, stream
);
5499 assemble_name (stream
, name
);
5500 putc ('\n', stream
);
5502 #endif /* GLOBAL_ASM_OP */
5504 /* This is how to output an internal numbered label where PREFIX is
5505 the class of label and LABELNO is the number within the class. */
5508 default_internal_label (stream
, prefix
, labelno
)
5511 unsigned long labelno
;
5513 char *const buf
= alloca (40 + strlen (prefix
));
5514 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5515 ASM_OUTPUT_LABEL (stream
, buf
);
5518 #include "gt-varasm.h"