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
PARAMS ((FILE *, tree
, const char *,
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_MEM (DECL_MODE (decl
), gen_rtx_SYMBOL_REF (Pmode
, name
));
924 SYMBOL_REF_WEAK (XEXP (x
, 0)) = DECL_WEAK (decl
);
925 if (TREE_CODE (decl
) != FUNCTION_DECL
)
926 set_mem_attributes (x
, decl
, 1);
927 SET_DECL_RTL (decl
, x
);
929 /* Optionally set flags or add text to the name to record information
930 such as that it is a function name.
931 If the name is changed, the macro ASM_OUTPUT_LABELREF
932 will have to know how to strip this information. */
933 (* targetm
.encode_section_info
) (decl
, true);
936 /* Make the rtl for variable VAR be volatile.
937 Use this only for static variables. */
940 make_var_volatile (var
)
943 if (GET_CODE (DECL_RTL (var
)) != MEM
)
946 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
949 /* Output a string of literal assembler code
950 for an `asm' keyword used between functions. */
953 assemble_asm (string
)
958 if (TREE_CODE (string
) == ADDR_EXPR
)
959 string
= TREE_OPERAND (string
, 0);
961 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
964 /* Record an element in the table of global destructors. SYMBOL is
965 a SYMBOL_REF of the function to be called; PRIORITY is a number
966 between 0 and MAX_INIT_PRIORITY. */
969 default_stabs_asm_out_destructor (symbol
, priority
)
971 int priority ATTRIBUTE_UNUSED
;
973 /* Tell GNU LD that this is part of the static destructor set.
974 This will work for any system that uses stabs, most usefully
976 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
977 assemble_name (asm_out_file
, XSTR (symbol
, 0));
978 fputc ('\n', asm_out_file
);
982 default_named_section_asm_out_destructor (symbol
, priority
)
986 const char *section
= ".dtors";
989 /* ??? This only works reliably with the GNU linker. */
990 if (priority
!= DEFAULT_INIT_PRIORITY
)
992 sprintf (buf
, ".dtors.%.5u",
993 /* Invert the numbering so the linker puts us in the proper
994 order; constructors are run from right to left, and the
995 linker sorts in increasing order. */
996 MAX_INIT_PRIORITY
- priority
);
1000 named_section_flags (section
, SECTION_WRITE
);
1001 assemble_align (POINTER_SIZE
);
1002 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1005 #ifdef DTORS_SECTION_ASM_OP
1009 if (in_section
!= in_dtors
)
1011 in_section
= in_dtors
;
1012 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
1013 fputc ('\n', asm_out_file
);
1018 default_dtor_section_asm_out_destructor (symbol
, priority
)
1020 int priority ATTRIBUTE_UNUSED
;
1023 assemble_align (POINTER_SIZE
);
1024 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1028 /* Likewise for global constructors. */
1031 default_stabs_asm_out_constructor (symbol
, priority
)
1033 int priority ATTRIBUTE_UNUSED
;
1035 /* Tell GNU LD that this is part of the static destructor set.
1036 This will work for any system that uses stabs, most usefully
1038 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
1039 assemble_name (asm_out_file
, XSTR (symbol
, 0));
1040 fputc ('\n', asm_out_file
);
1044 default_named_section_asm_out_constructor (symbol
, priority
)
1048 const char *section
= ".ctors";
1051 /* ??? This only works reliably with the GNU linker. */
1052 if (priority
!= DEFAULT_INIT_PRIORITY
)
1054 sprintf (buf
, ".ctors.%.5u",
1055 /* Invert the numbering so the linker puts us in the proper
1056 order; constructors are run from right to left, and the
1057 linker sorts in increasing order. */
1058 MAX_INIT_PRIORITY
- priority
);
1062 named_section_flags (section
, SECTION_WRITE
);
1063 assemble_align (POINTER_SIZE
);
1064 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1067 #ifdef CTORS_SECTION_ASM_OP
1071 if (in_section
!= in_ctors
)
1073 in_section
= in_ctors
;
1074 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1075 fputc ('\n', asm_out_file
);
1080 default_ctor_section_asm_out_constructor (symbol
, priority
)
1082 int priority ATTRIBUTE_UNUSED
;
1085 assemble_align (POINTER_SIZE
);
1086 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1090 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1091 a nonzero value if the constant pool should be output before the
1092 start of the function, or a zero value if the pool should output
1093 after the end of the function. The default is to put it before the
1096 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1097 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1100 /* Output assembler code for the constant pool of a function and associated
1101 with defining the name of the function. DECL describes the function.
1102 NAME is the function's name. For the constant pool, we use the current
1103 constant pool data. */
1106 assemble_start_function (decl
, fnname
)
1112 /* The following code does not need preprocessing in the assembler. */
1116 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1117 output_constant_pool (fnname
, decl
);
1119 resolve_unique_section (decl
, 0, flag_function_sections
);
1120 function_section (decl
);
1122 /* Tell assembler to move to target machine's alignment for functions. */
1123 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1124 if (align
< force_align_functions_log
)
1125 align
= force_align_functions_log
;
1128 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1131 /* Handle a user-specified function alignment.
1132 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1133 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1134 if (align_functions_log
> align
1135 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1137 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1138 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1139 align_functions_log
, align_functions
- 1);
1141 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1145 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1146 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1149 (*debug_hooks
->begin_function
) (decl
);
1151 /* Make function name accessible from other files, if appropriate. */
1153 if (TREE_PUBLIC (decl
))
1155 if (! first_global_object_name
)
1160 p
= (* targetm
.strip_name_encoding
) (fnname
);
1163 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1164 first_global_object_name
= name
;
1166 weak_global_object_name
= name
;
1169 globalize_decl (decl
);
1171 maybe_assemble_visibility (decl
);
1174 /* Do any machine/system dependent processing of the function name */
1175 #ifdef ASM_DECLARE_FUNCTION_NAME
1176 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1178 /* Standard thing is just output label for the function. */
1179 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1180 #endif /* ASM_DECLARE_FUNCTION_NAME */
1183 /* Output assembler code associated with defining the size of the
1184 function. DECL describes the function. NAME is the function's name. */
1187 assemble_end_function (decl
, fnname
)
1191 #ifdef ASM_DECLARE_FUNCTION_SIZE
1192 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1194 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1196 output_constant_pool (fnname
, decl
);
1197 function_section (decl
); /* need to switch back */
1200 /* Output any constants which should appear after the function. */
1201 output_after_function_constants ();
1204 /* Assemble code to leave SIZE bytes of zeros. */
1207 assemble_zeros (size
)
1210 /* Do no output if -fsyntax-only. */
1211 if (flag_syntax_only
)
1214 #ifdef ASM_NO_SKIP_IN_TEXT
1215 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1216 so we must output 0s explicitly in the text section. */
1217 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1220 for (i
= 0; i
< size
; i
++)
1221 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1226 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1229 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1232 assemble_align (align
)
1235 if (align
> BITS_PER_UNIT
)
1237 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1241 /* Assemble a string constant with the specified C string as contents. */
1244 assemble_string (p
, size
)
1251 /* If the string is very long, split it up. */
1255 int thissize
= size
- pos
;
1256 if (thissize
> maximum
)
1259 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1267 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1268 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1269 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1271 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1272 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1273 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1275 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1276 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1280 #if defined ASM_OUTPUT_ALIGNED_BSS
1281 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1282 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1284 #if defined ASM_OUTPUT_BSS
1285 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1286 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1292 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1293 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1294 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1296 #if defined ASM_OUTPUT_ALIGNED_COMMON
1297 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1298 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1300 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1301 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1306 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1309 int size ATTRIBUTE_UNUSED
;
1310 int rounded ATTRIBUTE_UNUSED
;
1318 destination
= asm_dest_local
;
1320 /* ??? We should handle .bss via select_section mechanisms rather than
1321 via special target hooks. That would eliminate this special case. */
1322 if (TREE_PUBLIC (decl
))
1324 if (!DECL_COMMON (decl
))
1326 destination
= asm_dest_bss
;
1331 destination
= asm_dest_common
;
1334 if (destination
== asm_dest_bss
)
1335 globalize_decl (decl
);
1336 resolve_unique_section (decl
, 0, flag_data_sections
);
1338 if (flag_shared_data
)
1340 switch (destination
)
1342 #ifdef ASM_OUTPUT_SHARED_BSS
1344 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1347 #ifdef ASM_OUTPUT_SHARED_COMMON
1348 case asm_dest_common
:
1349 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1352 #ifdef ASM_OUTPUT_SHARED_LOCAL
1353 case asm_dest_local
:
1354 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1362 switch (destination
)
1366 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1369 case asm_dest_common
:
1370 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1372 case asm_dest_local
:
1373 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1382 /* Assemble everything that is needed for a variable or function declaration.
1383 Not used for automatic variables, and not used for function definitions.
1384 Should not be called for variables of incomplete structure type.
1386 TOP_LEVEL is nonzero if this variable has file scope.
1387 AT_END is nonzero if this is the special handling, at end of compilation,
1388 to define things that have had only tentative definitions.
1389 DONT_OUTPUT_DATA if nonzero means don't actually output the
1390 initial value (that will be done by the caller). */
1393 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1395 int top_level ATTRIBUTE_UNUSED
;
1396 int at_end ATTRIBUTE_UNUSED
;
1397 int dont_output_data
;
1404 last_assemble_variable_decl
= 0;
1406 /* Normally no need to say anything here for external references,
1407 since assemble_external is called by the language-specific code
1408 when a declaration is first seen. */
1410 if (DECL_EXTERNAL (decl
))
1413 /* Output no assembler code for a function declaration.
1414 Only definitions of functions output anything. */
1416 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1419 /* Do nothing for global register variables. */
1420 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1422 TREE_ASM_WRITTEN (decl
) = 1;
1426 /* If type was incomplete when the variable was declared,
1427 see if it is complete now. */
1429 if (DECL_SIZE (decl
) == 0)
1430 layout_decl (decl
, 0);
1432 /* Still incomplete => don't allocate it; treat the tentative defn
1433 (which is what it must have been) as an `extern' reference. */
1435 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1437 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1438 DECL_SOURCE_LINE (decl
),
1439 "storage size of `%s' isn't known",
1440 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1441 TREE_ASM_WRITTEN (decl
) = 1;
1445 /* The first declaration of a variable that comes through this function
1446 decides whether it is global (in C, has external linkage)
1447 or local (in C, has internal linkage). So do nothing more
1448 if this function has already run. */
1450 if (TREE_ASM_WRITTEN (decl
))
1453 /* Make sure targetm.encode_section_info is invoked before we set
1455 decl_rtl
= DECL_RTL (decl
);
1457 TREE_ASM_WRITTEN (decl
) = 1;
1459 /* Do no output if -fsyntax-only. */
1460 if (flag_syntax_only
)
1465 if (! dont_output_data
1466 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1468 error_with_decl (decl
, "size of variable `%s' is too large");
1472 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1473 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1474 && ! first_global_object_name
1475 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1476 || DECL_INITIAL (decl
) == error_mark_node
))
1477 && ! DECL_WEAK (decl
)
1478 && ! DECL_ONE_ONLY (decl
))
1483 p
= (* targetm
.strip_name_encoding
) (name
);
1484 xname
= xstrdup (p
);
1485 first_global_object_name
= xname
;
1488 /* Compute the alignment of this data. */
1490 align
= DECL_ALIGN (decl
);
1492 /* In the case for initialing an array whose length isn't specified,
1493 where we have not yet been able to do the layout,
1494 figure out the proper alignment now. */
1495 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1496 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1497 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1499 /* Some object file formats have a maximum alignment which they support.
1500 In particular, a.out format supports a maximum alignment of 4. */
1501 #ifndef MAX_OFILE_ALIGNMENT
1502 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1504 if (align
> MAX_OFILE_ALIGNMENT
)
1506 warning_with_decl (decl
,
1507 "alignment of `%s' is greater than maximum object file alignment. Using %d",
1508 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1509 align
= MAX_OFILE_ALIGNMENT
;
1512 /* On some machines, it is good to increase alignment sometimes. */
1513 if (! DECL_USER_ALIGN (decl
))
1515 #ifdef DATA_ALIGNMENT
1516 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1518 #ifdef CONSTANT_ALIGNMENT
1519 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1520 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1524 /* Reset the alignment in case we have made it tighter, so we can benefit
1525 from it in get_pointer_alignment. */
1526 DECL_ALIGN (decl
) = align
;
1527 set_mem_align (decl_rtl
, align
);
1529 if (TREE_PUBLIC (decl
))
1530 maybe_assemble_visibility (decl
);
1532 /* Output any data that we will need to use the address of. */
1533 if (DECL_INITIAL (decl
) == error_mark_node
)
1534 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1535 else if (DECL_INITIAL (decl
))
1536 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1537 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1539 /* Handle uninitialized definitions. */
1541 /* If the decl has been given an explicit section name, then it
1542 isn't common, and shouldn't be handled as such. */
1543 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1545 /* We don't implement common thread-local data at present. */
1546 else if (DECL_THREAD_LOCAL (decl
))
1548 if (DECL_COMMON (decl
))
1549 sorry ("thread-local COMMON data not implemented");
1551 else if (DECL_INITIAL (decl
) == 0
1552 || DECL_INITIAL (decl
) == error_mark_node
1553 || (flag_zero_initialized_in_bss
1554 && initializer_zerop (DECL_INITIAL (decl
))))
1556 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1557 unsigned HOST_WIDE_INT rounded
= size
;
1559 /* Don't allocate zero bytes of common,
1560 since that means "undefined external" in the linker. */
1564 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1565 so that each uninitialized object starts on such a boundary. */
1566 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1567 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1568 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1570 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1571 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1573 (decl
, "requested alignment for %s is greater than implemented alignment of %d",rounded
);
1576 /* If the target cannot output uninitialized but not common global data
1577 in .bss, then we have to use .data, so fall through. */
1578 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1582 /* Handle initialized definitions.
1583 Also handle uninitialized global definitions if -fno-common and the
1584 target doesn't support ASM_OUTPUT_BSS. */
1586 /* First make the assembler name(s) global if appropriate. */
1587 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1588 globalize_decl (decl
);
1590 /* Switch to the appropriate section. */
1591 variable_section (decl
, reloc
);
1593 /* dbxout.c needs to know this. */
1594 if (in_text_section ())
1595 DECL_IN_TEXT_SECTION (decl
) = 1;
1597 /* Output the alignment of this data. */
1598 if (align
> BITS_PER_UNIT
)
1600 ASM_OUTPUT_ALIGN (asm_out_file
,
1601 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1604 /* Do any machine/system dependent processing of the object. */
1605 #ifdef ASM_DECLARE_OBJECT_NAME
1606 last_assemble_variable_decl
= decl
;
1607 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1609 /* Standard thing is just output label for the object. */
1610 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1611 #endif /* ASM_DECLARE_OBJECT_NAME */
1613 if (!dont_output_data
)
1615 if (DECL_INITIAL (decl
) && DECL_INITIAL (decl
) != error_mark_node
)
1616 /* Output the actual data. */
1617 output_constant (DECL_INITIAL (decl
),
1618 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1621 /* Leave space for it. */
1622 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1626 /* Return 1 if type TYPE contains any pointers. */
1629 contains_pointers_p (type
)
1632 switch (TREE_CODE (type
))
1635 case REFERENCE_TYPE
:
1636 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1637 so I'll play safe and return 1. */
1643 case QUAL_UNION_TYPE
:
1646 /* For a type that has fields, see if the fields have pointers. */
1647 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1648 if (TREE_CODE (fields
) == FIELD_DECL
1649 && contains_pointers_p (TREE_TYPE (fields
)))
1655 /* An array type contains pointers if its element type does. */
1656 return contains_pointers_p (TREE_TYPE (type
));
1663 /* Output something to declare an external symbol to the assembler.
1664 (Most assemblers don't need this, so we normally output nothing.)
1665 Do nothing if DECL is not external. */
1668 assemble_external (decl
)
1669 tree decl ATTRIBUTE_UNUSED
;
1671 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1672 main body of this code is only rarely exercised. To provide some
1673 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1674 open. If it's not, we should not be calling this function. */
1678 #ifdef ASM_OUTPUT_EXTERNAL
1679 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1681 rtx rtl
= DECL_RTL (decl
);
1683 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1684 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1686 /* Some systems do require some output. */
1687 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1688 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1694 /* Similar, for calling a library function FUN. */
1697 assemble_external_libcall (fun
)
1698 rtx fun ATTRIBUTE_UNUSED
;
1700 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1701 /* Declare library function name external when first used, if nec. */
1702 if (! SYMBOL_REF_USED (fun
))
1704 SYMBOL_REF_USED (fun
) = 1;
1705 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1710 /* Assemble a label named NAME. */
1713 assemble_label (name
)
1716 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1719 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1720 If NAME starts with a *, the rest of NAME is output verbatim.
1721 Otherwise NAME is transformed in an implementation-defined way
1722 (usually by the addition of an underscore).
1723 Many macros in the tm file are defined to call this function. */
1726 assemble_name (file
, name
)
1730 const char *real_name
;
1733 real_name
= (* targetm
.strip_name_encoding
) (name
);
1735 id
= maybe_get_identifier (real_name
);
1737 TREE_SYMBOL_REFERENCED (id
) = 1;
1740 fputs (&name
[1], file
);
1742 ASM_OUTPUT_LABELREF (file
, name
);
1745 /* Allocate SIZE bytes writable static space with a gensym name
1746 and return an RTX to refer to its address. */
1749 assemble_static_space (size
)
1753 const char *namestring
;
1757 if (flag_shared_data
)
1761 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1763 namestring
= ggc_strdup (name
);
1765 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1767 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1768 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1771 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1772 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1775 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1776 so that each uninitialized object starts on such a boundary. */
1777 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1778 int rounded ATTRIBUTE_UNUSED
1779 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1780 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1781 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1782 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1789 /* Assemble the static constant template for function entry trampolines.
1790 This is done at most once per compilation.
1791 Returns an RTX for the address of the template. */
1793 #ifdef TRAMPOLINE_TEMPLATE
1795 assemble_trampoline_template ()
1801 /* By default, put trampoline templates in read-only data section. */
1803 #ifdef TRAMPOLINE_SECTION
1804 TRAMPOLINE_SECTION ();
1806 readonly_data_section ();
1809 /* Write the assembler code to define one. */
1810 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1813 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1816 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LTRAMP", 0);
1817 TRAMPOLINE_TEMPLATE (asm_out_file
);
1819 /* Record the rtl to refer to it. */
1820 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1821 name
= ggc_strdup (label
);
1822 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1826 /* A and B are either alignments or offsets. Return the minimum alignment
1827 that may be assumed after adding the two together. */
1829 static inline unsigned
1833 return (a
| b
) & -(a
| b
);
1836 /* Return the assembler directive for creating a given kind of integer
1837 object. SIZE is the number of bytes in the object and ALIGNED_P
1838 indicates whether it is known to be aligned. Return NULL if the
1839 assembly dialect has no such directive.
1841 The returned string should be printed at the start of a new line and
1842 be followed immediately by the object's initial value. */
1845 integer_asm_op (size
, aligned_p
)
1849 struct asm_int_op
*ops
;
1852 ops
= &targetm
.asm_out
.aligned_op
;
1854 ops
= &targetm
.asm_out
.unaligned_op
;
1859 return targetm
.asm_out
.byte_op
;
1873 /* Use directive OP to assemble an integer object X. Print OP at the
1874 start of the line, followed immediately by the value of X. */
1877 assemble_integer_with_op (op
, x
)
1881 fputs (op
, asm_out_file
);
1882 output_addr_const (asm_out_file
, x
);
1883 fputc ('\n', asm_out_file
);
1886 /* The default implementation of the asm_out.integer target hook. */
1889 default_assemble_integer (x
, size
, aligned_p
)
1890 rtx x ATTRIBUTE_UNUSED
;
1891 unsigned int size ATTRIBUTE_UNUSED
;
1892 int aligned_p ATTRIBUTE_UNUSED
;
1894 const char *op
= integer_asm_op (size
, aligned_p
);
1895 return op
&& (assemble_integer_with_op (op
, x
), true);
1898 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1899 the alignment of the integer in bits. Return 1 if we were able to output
1900 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1904 assemble_integer (x
, size
, align
, force
)
1912 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
1914 /* See if the target hook can handle this kind of object. */
1915 if ((*targetm
.asm_out
.integer
) (x
, size
, aligned_p
))
1918 /* If the object is a multi-byte one, try splitting it up. Split
1919 it into words it if is multi-word, otherwise split it into bytes. */
1922 enum machine_mode omode
, imode
;
1923 unsigned int subalign
;
1924 unsigned int subsize
, i
;
1926 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
1927 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
1928 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
1929 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1931 for (i
= 0; i
< size
; i
+= subsize
)
1933 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
1934 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
1940 /* If we've printed some of it, but not all of it, there's no going
1953 assemble_real (d
, mode
, align
)
1955 enum machine_mode mode
;
1960 unsigned int nalign
= min_align (align
, 32);
1962 switch (BITS_PER_UNIT
)
1968 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1969 assemble_integer (GEN_INT (l
), 4, align
, 1);
1972 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1973 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1974 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1977 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
1978 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1979 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1980 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
1983 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
1984 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1985 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1986 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
1987 assemble_integer (GEN_INT (data
[3]), 4, nalign
, 1);
1998 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1999 assemble_integer (GEN_INT (l
), 2, align
, 1);
2002 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
2003 assemble_integer (GEN_INT (data
[0]), 2, align
, 1);
2004 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
2015 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
2016 assemble_integer (GEN_INT (l
), 1, align
, 1);
2019 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
2020 assemble_integer (GEN_INT (data
[0]), 1, align
, 1);
2021 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
2033 /* Given an expression EXP with a constant value,
2034 reduce it to the sum of an assembler symbol and an integer.
2035 Store them both in the structure *VALUE.
2036 Abort if EXP does not reduce. */
2038 struct addr_const
GTY(())
2041 HOST_WIDE_INT offset
;
2045 decode_addr_const (exp
, value
)
2047 struct addr_const
*value
;
2049 tree target
= TREE_OPERAND (exp
, 0);
2055 if (TREE_CODE (target
) == COMPONENT_REF
2056 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2059 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2060 target
= TREE_OPERAND (target
, 0);
2062 else if (TREE_CODE (target
) == ARRAY_REF
2063 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2065 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2066 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2067 target
= TREE_OPERAND (target
, 0);
2073 switch (TREE_CODE (target
))
2077 x
= DECL_RTL (target
);
2081 x
= gen_rtx_MEM (FUNCTION_MODE
,
2082 gen_rtx_LABEL_REF (VOIDmode
,
2083 label_rtx (TREE_OPERAND (exp
, 0))));
2091 /* This constant should have been output already, but we can't simply
2092 use TREE_CST_RTL since INTEGER_CST doesn't have one. */
2093 x
= output_constant_def (target
, 1);
2100 if (GET_CODE (x
) != MEM
)
2105 value
->offset
= offset
;
2108 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2109 enum kind
{ RTX_UNKNOWN
, RTX_DOUBLE
, RTX_VECTOR
, RTX_INT
, RTX_UNSPEC
};
2110 struct rtx_const
GTY(())
2112 ENUM_BITFIELD(kind
) kind
: 16;
2113 ENUM_BITFIELD(machine_mode
) mode
: 16;
2114 union rtx_const_un
{
2115 REAL_VALUE_TYPE
GTY ((tag ("4"))) du
;
2116 struct addr_const
GTY ((tag ("1"))) addr
;
2117 struct rtx_const_u_di
{
2120 } GTY ((tag ("0"))) di
;
2122 /* The max vector size we have is 16 wide; two variants for
2123 integral and floating point vectors. */
2124 struct rtx_const_int_vec
{
2127 } GTY ((tag ("2"))) int_vec
[16];
2129 REAL_VALUE_TYPE
GTY ((tag ("3"))) fp_vec
[8];
2131 } GTY ((desc ("%1.kind >= RTX_INT"), descbits ("1"))) un
;
2134 /* Uniquize all constants that appear in memory.
2135 Each constant in memory thus far output is recorded
2136 in `const_hash_table'. */
2138 struct constant_descriptor_tree
GTY(())
2140 /* More constant_descriptors with the same hash code. */
2141 struct constant_descriptor_tree
*next
;
2143 /* The label of the constant. */
2146 /* A MEM for the constant. */
2149 /* The value of the constant. */
2153 #define MAX_HASH_TABLE 1009
2154 static GTY(()) struct constant_descriptor_tree
*
2155 const_hash_table
[MAX_HASH_TABLE
];
2157 /* We maintain a hash table of STRING_CST values. Unless we are asked to force
2158 out a string constant, we defer output of the constants until we know
2159 they are actually used. This will be if something takes its address or if
2160 there is a usage of the string in the RTL of a function. */
2162 #define STRHASH(x) htab_hash_pointer (x)
2164 struct deferred_string
GTY(())
2171 static GTY ((param_is (struct deferred_string
))) htab_t const_str_htab
;
2173 /* Returns a hash code for X (which is a really a
2174 struct deferred_string *). */
2177 const_str_htab_hash (x
)
2180 return STRHASH (((const struct deferred_string
*) x
)->label
);
2183 /* Returns nonzero if the value represented by X (which is really a
2184 struct deferred_string *) is the same as that given by Y
2185 (which is really a char *). */
2188 const_str_htab_eq (x
, y
)
2192 return (((const struct deferred_string
*) x
)->label
== (const char *) y
);
2195 /* Compute a hash code for a constant expression. */
2201 return const_hash_1 (exp
) % MAX_HASH_TABLE
;
2211 enum tree_code code
= TREE_CODE (exp
);
2213 /* Either set P and LEN to the address and len of something to hash and
2214 exit the switch or return a value. */
2219 p
= (char *) &TREE_INT_CST (exp
);
2220 len
= sizeof TREE_INT_CST (exp
);
2224 return real_hash (TREE_REAL_CST_PTR (exp
));
2227 p
= TREE_STRING_POINTER (exp
);
2228 len
= TREE_STRING_LENGTH (exp
);
2232 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2233 + const_hash_1 (TREE_IMAGPART (exp
)));
2236 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2240 len
= int_size_in_bytes (TREE_TYPE (exp
));
2241 tmp
= (char *) alloca (len
);
2242 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2250 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2252 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2253 if (TREE_VALUE (link
))
2254 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2262 struct addr_const value
;
2264 decode_addr_const (exp
, &value
);
2265 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2267 /* Don't hash the address of the SYMBOL_REF;
2268 only use the offset and the symbol name. */
2270 p
= XSTR (value
.base
, 0);
2271 for (i
= 0; p
[i
] != 0; i
++)
2272 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2274 else if (GET_CODE (value
.base
) == LABEL_REF
)
2275 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2283 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2284 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2288 case NON_LVALUE_EXPR
:
2289 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2292 /* A language specific constant. Just hash the code. */
2296 /* Compute hashing function */
2298 for (i
= 0; i
< len
; i
++)
2299 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2304 /* Compare t1 and t2, and return 1 only if they are known to result in
2305 the same bit pattern on output. */
2308 compare_constant (t1
, t2
)
2312 enum tree_code typecode
;
2314 if (t1
== NULL_TREE
)
2315 return t2
== NULL_TREE
;
2316 if (t2
== NULL_TREE
)
2319 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2322 switch (TREE_CODE (t1
))
2325 /* Integer constants are the same only if the same width of type. */
2326 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2328 return tree_int_cst_equal (t1
, t2
);
2331 /* Real constants are the same only if the same width of type. */
2332 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2335 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2338 if (flag_writable_strings
)
2341 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2344 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2345 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2346 TREE_STRING_LENGTH (t1
)));
2349 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2350 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2353 typecode
= TREE_CODE (TREE_TYPE (t1
));
2354 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2357 if (typecode
== SET_TYPE
)
2359 int len
= int_size_in_bytes (TREE_TYPE (t2
));
2360 unsigned char *tmp1
, *tmp2
;
2362 if (int_size_in_bytes (TREE_TYPE (t1
)) != len
)
2365 tmp1
= (unsigned char *) alloca (len
);
2366 tmp2
= (unsigned char *) alloca (len
);
2368 if (get_set_constructor_bytes (t1
, tmp1
, len
) != NULL_TREE
)
2370 if (get_set_constructor_bytes (t2
, tmp2
, len
) != NULL_TREE
)
2373 return memcmp (tmp1
, tmp2
, len
) != 0;
2379 if (typecode
== ARRAY_TYPE
)
2381 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2382 /* For arrays, check that the sizes all match. */
2383 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2385 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2390 /* For record and union constructors, require exact type
2392 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2396 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2398 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2400 /* Check that each value is the same... */
2401 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2403 /* ... and that they apply to the same fields! */
2404 if (typecode
== ARRAY_TYPE
)
2406 if (! compare_constant (TREE_PURPOSE (l1
),
2412 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2417 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2423 struct addr_const value1
, value2
;
2425 decode_addr_const (t1
, &value1
);
2426 decode_addr_const (t2
, &value2
);
2427 return (value1
.offset
== value2
.offset
2428 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2434 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2435 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2439 case NON_LVALUE_EXPR
:
2440 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2445 nt1
= (*lang_hooks
.expand_constant
) (t1
);
2446 nt2
= (*lang_hooks
.expand_constant
) (t2
);
2447 if (nt1
!= t1
|| nt2
!= t2
)
2448 return compare_constant (nt1
, nt2
);
2454 /* Should not get here. */
2458 /* Record a list of constant expressions that were passed to
2459 output_constant_def but that could not be output right away. */
2461 struct deferred_constant
2463 struct deferred_constant
*next
;
2469 static struct deferred_constant
*deferred_constants
;
2471 /* Another list of constants which should be output after the
2473 static struct deferred_constant
*after_function_constants
;
2475 /* Nonzero means defer output of addressed subconstants
2476 (i.e., those for which output_constant_def is called.) */
2477 static int defer_addressed_constants_flag
;
2479 /* Start deferring output of subconstants. */
2482 defer_addressed_constants ()
2484 defer_addressed_constants_flag
++;
2487 /* Stop deferring output of subconstants,
2488 and output now all those that have been deferred. */
2491 output_deferred_addressed_constants ()
2493 struct deferred_constant
*p
, *next
;
2495 defer_addressed_constants_flag
--;
2497 if (defer_addressed_constants_flag
> 0)
2500 for (p
= deferred_constants
; p
; p
= next
)
2502 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2507 deferred_constants
= 0;
2510 /* Output any constants which should appear after a function. */
2513 output_after_function_constants ()
2515 struct deferred_constant
*p
, *next
;
2517 for (p
= after_function_constants
; p
; p
= next
)
2519 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2524 after_function_constants
= 0;
2527 /* Make a copy of the whole tree structure for a constant. This
2528 handles the same types of nodes that compare_constant handles. */
2534 switch (TREE_CODE (exp
))
2537 /* For ADDR_EXPR, we do not want to copy the decl whose address
2538 is requested. We do want to copy constants though. */
2539 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2540 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2541 copy_constant (TREE_OPERAND (exp
, 0)));
2543 return copy_node (exp
);
2548 return copy_node (exp
);
2551 return build_complex (TREE_TYPE (exp
),
2552 copy_constant (TREE_REALPART (exp
)),
2553 copy_constant (TREE_IMAGPART (exp
)));
2557 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2558 copy_constant (TREE_OPERAND (exp
, 0)),
2559 copy_constant (TREE_OPERAND (exp
, 1)));
2563 case NON_LVALUE_EXPR
:
2564 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2565 copy_constant (TREE_OPERAND (exp
, 0)));
2569 tree copy
= copy_node (exp
);
2570 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2573 CONSTRUCTOR_ELTS (copy
) = list
;
2574 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2575 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2576 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2577 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2578 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2586 t
= (*lang_hooks
.expand_constant
) (exp
);
2588 return copy_constant (t
);
2595 /* Return an rtx representing a reference to constant data in memory
2596 for the constant expression EXP.
2598 If assembler code for such a constant has already been output,
2599 return an rtx to refer to it.
2600 Otherwise, output such a constant in memory (or defer it for later)
2601 and generate an rtx for it.
2603 If DEFER is nonzero, the output of string constants can be deferred
2604 and output only if referenced in the function after all optimizations.
2606 The TREE_CST_RTL of EXP is set up to point to that rtx.
2607 The const_hash_table records which constants already have label strings. */
2610 output_constant_def (exp
, defer
)
2615 struct constant_descriptor_tree
*desc
;
2616 struct deferred_string
**defstr
;
2620 int after_function
= 0;
2624 /* We can't just use the saved RTL if this is a deferred string constant
2625 and we are not to defer anymore. */
2626 if (TREE_CODE (exp
) != INTEGER_CST
&& TREE_CST_RTL (exp
)
2627 && (defer
|| !STRING_POOL_ADDRESS_P (XEXP (TREE_CST_RTL (exp
), 0))))
2628 return TREE_CST_RTL (exp
);
2630 /* Make sure any other constants whose addresses appear in EXP
2631 are assigned label numbers. */
2633 reloc
= output_addressed_constants (exp
);
2635 /* Compute hash code of EXP. Search the descriptors for that hash code
2636 to see if any of them describes EXP. If yes, the descriptor records
2637 the label number already assigned. */
2639 hash
= const_hash (exp
);
2641 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
2642 if (compare_constant (exp
, desc
->value
))
2647 /* No constant equal to EXP is known to have been output.
2648 Make a constant descriptor to enter EXP in the hash table.
2649 Assign the label number and record it in the descriptor for
2650 future calls to this function to find. */
2652 /* Create a string containing the label name, in LABEL. */
2653 labelno
= const_labelno
++;
2654 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2656 desc
= ggc_alloc (sizeof (*desc
));
2657 desc
->next
= const_hash_table
[hash
];
2658 desc
->label
= ggc_strdup (label
);
2659 desc
->value
= copy_constant (exp
);
2660 const_hash_table
[hash
] = desc
;
2662 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2664 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
2665 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
2667 set_mem_attributes (rtl
, exp
, 1);
2668 set_mem_alias_set (rtl
, 0);
2669 set_mem_alias_set (rtl
, const_alias_set
);
2676 if (TREE_CODE (exp
) != INTEGER_CST
)
2677 TREE_CST_RTL (exp
) = rtl
;
2679 /* Optionally set flags or add text to the name to record information
2680 such as that it is a function name. If the name is changed, the macro
2681 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2682 /* A previously-processed constant would already have section info
2686 /* Take care not to invoke targetm.encode_section_info for
2687 constants which don't have a TREE_CST_RTL. */
2688 if (TREE_CODE (exp
) != INTEGER_CST
)
2689 (*targetm
.encode_section_info
) (exp
, true);
2692 desc
->label
= XSTR (XEXP (desc
->rtl
, 0), 0);
2695 #ifdef CONSTANT_AFTER_FUNCTION_P
2696 if (current_function_decl
!= 0
2697 && CONSTANT_AFTER_FUNCTION_P (exp
))
2702 && STRING_POOL_ADDRESS_P (XEXP (rtl
, 0))
2703 && (!defer
|| defer_addressed_constants_flag
|| after_function
))
2705 defstr
= (struct deferred_string
**)
2706 htab_find_slot_with_hash (const_str_htab
, desc
->label
,
2707 STRHASH (desc
->label
), NO_INSERT
);
2710 /* If the string is currently deferred but we need to output it now,
2711 remove it from deferred string hash table. */
2713 labelno
= (*defstr
)->labelno
;
2714 STRING_POOL_ADDRESS_P (XEXP (rtl
, 0)) = 0;
2715 htab_clear_slot (const_str_htab
, (void **) defstr
);
2719 /* If this is the first time we've seen this particular constant,
2720 output it (or defer its output for later). */
2723 if (defer_addressed_constants_flag
|| after_function
)
2725 struct deferred_constant
*p
2726 = (struct deferred_constant
*)
2727 xmalloc (sizeof (struct deferred_constant
));
2729 p
->exp
= desc
->value
;
2731 p
->labelno
= labelno
;
2734 p
->next
= after_function_constants
;
2735 after_function_constants
= p
;
2739 p
->next
= deferred_constants
;
2740 deferred_constants
= p
;
2745 /* Do no output if -fsyntax-only. */
2746 if (! flag_syntax_only
)
2748 if (TREE_CODE (exp
) != STRING_CST
2750 || flag_writable_strings
2751 || (defstr
= (struct deferred_string
**)
2752 htab_find_slot_with_hash (const_str_htab
,
2754 STRHASH (desc
->label
),
2756 output_constant_def_contents (exp
, reloc
, labelno
);
2759 struct deferred_string
*p
;
2761 p
= (struct deferred_string
*)
2762 ggc_alloc (sizeof (struct deferred_string
));
2764 p
->exp
= desc
->value
;
2765 p
->label
= desc
->label
;
2766 p
->labelno
= labelno
;
2768 STRING_POOL_ADDRESS_P (XEXP (rtl
, 0)) = 1;
2777 /* Now output assembler code to define the label for EXP,
2778 and follow it with the data of EXP. */
2781 output_constant_def_contents (exp
, reloc
, labelno
)
2788 /* Align the location counter as required by EXP's data type. */
2789 align
= TYPE_ALIGN (TREE_TYPE (exp
));
2790 #ifdef CONSTANT_ALIGNMENT
2791 align
= CONSTANT_ALIGNMENT (exp
, align
);
2794 if (IN_NAMED_SECTION (exp
))
2795 named_section (exp
, NULL
, reloc
);
2797 (*targetm
.asm_out
.select_section
) (exp
, reloc
, align
);
2799 if (align
> BITS_PER_UNIT
)
2801 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2804 /* Output the label itself. */
2805 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LC", labelno
);
2807 /* Output the value of EXP. */
2808 output_constant (exp
,
2809 (TREE_CODE (exp
) == STRING_CST
2810 ? MAX (TREE_STRING_LENGTH (exp
),
2811 int_size_in_bytes (TREE_TYPE (exp
)))
2812 : int_size_in_bytes (TREE_TYPE (exp
))),
2817 /* Used in the hash tables to avoid outputting the same constant
2818 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2819 are output once per function, not once per file; there seems
2820 to be no reason for the difference. */
2822 struct constant_descriptor_rtx
GTY(())
2824 /* More constant_descriptors with the same hash code. */
2825 struct constant_descriptor_rtx
*next
;
2827 /* A MEM for the constant. */
2830 /* The value of the constant. */
2831 struct rtx_const value
;
2834 /* Structure to represent sufficient information about a constant so that
2835 it can be output when the constant pool is output, so that function
2836 integration can be done, and to simplify handling on machines that reference
2837 constant pool as base+displacement. */
2839 struct pool_constant
GTY(())
2841 struct constant_descriptor_rtx
*desc
;
2842 struct pool_constant
*next
;
2843 struct pool_constant
*next_sym
;
2845 enum machine_mode mode
;
2848 HOST_WIDE_INT offset
;
2852 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2853 The argument is XSTR (... , 0) */
2855 #define SYMHASH(LABEL) (((unsigned long) (LABEL)) % MAX_RTX_HASH_TABLE)
2857 /* Initialize constant pool hashing for a new function. */
2860 init_varasm_status (f
)
2863 struct varasm_status
*p
;
2864 p
= (struct varasm_status
*) ggc_alloc (sizeof (struct varasm_status
));
2866 p
->x_const_rtx_hash_table
2867 = ((struct constant_descriptor_rtx
**)
2868 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2869 * sizeof (struct constant_descriptor_rtx
*)));
2870 p
->x_const_rtx_sym_hash_table
2871 = ((struct pool_constant
**)
2872 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2873 * sizeof (struct pool_constant
*)));
2875 p
->x_first_pool
= p
->x_last_pool
= 0;
2876 p
->x_pool_offset
= 0;
2880 /* Express an rtx for a constant integer (perhaps symbolic)
2881 as the sum of a symbol or label plus an explicit integer.
2882 They are stored into VALUE. */
2885 decode_rtx_const (mode
, x
, value
)
2886 enum machine_mode mode
;
2888 struct rtx_const
*value
;
2890 /* Clear the whole structure, including any gaps. */
2891 memset (value
, 0, sizeof (struct rtx_const
));
2893 value
->kind
= RTX_INT
; /* Most usual kind. */
2896 switch (GET_CODE (x
))
2899 value
->kind
= RTX_DOUBLE
;
2900 if (GET_MODE (x
) != VOIDmode
)
2902 const REAL_VALUE_TYPE
*r
= CONST_DOUBLE_REAL_VALUE (x
);
2904 value
->mode
= GET_MODE (x
);
2906 /* Copy the REAL_VALUE_TYPE by members so that we don't
2907 copy garbage from the original structure into our
2908 carefully cleaned hashing structure. */
2909 value
->un
.du
.class = r
->class;
2910 value
->un
.du
.sign
= r
->sign
;
2917 value
->un
.du
.exp
= r
->exp
;
2920 memcpy (value
->un
.du
.sig
, r
->sig
, sizeof (r
->sig
));
2928 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
2929 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
2937 units
= CONST_VECTOR_NUNITS (x
);
2938 value
->kind
= RTX_VECTOR
;
2941 if (GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
)
2943 for (i
= 0; i
< units
; ++i
)
2945 rtx elt
= CONST_VECTOR_ELT (x
, i
);
2946 if (GET_CODE (elt
) == CONST_INT
)
2948 value
->un
.int_vec
[i
].low
= INTVAL (elt
);
2949 value
->un
.int_vec
[i
].high
= 0;
2953 value
->un
.int_vec
[i
].low
= CONST_DOUBLE_LOW (elt
);
2954 value
->un
.int_vec
[i
].high
= CONST_DOUBLE_HIGH (elt
);
2958 else if (GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
2960 for (i
= 0; i
< units
; ++i
)
2962 const REAL_VALUE_TYPE
*r
2963 = CONST_DOUBLE_REAL_VALUE (CONST_VECTOR_ELT (x
, i
));
2964 REAL_VALUE_TYPE
*d
= &value
->un
.fp_vec
[i
];
2966 /* Copy the REAL_VALUE_TYPE by members so that we don't
2967 copy garbage from the original structure into our
2968 carefully cleaned hashing structure. */
2969 d
->class = r
->class;
2980 memcpy (d
->sig
, r
->sig
, sizeof (r
->sig
));
2993 value
->un
.addr
.offset
= INTVAL (x
);
2999 value
->un
.addr
.base
= x
;
3004 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3006 value
->un
.addr
.base
= XEXP (x
, 0);
3007 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3009 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3011 value
->un
.addr
.base
= XEXP (x
, 0);
3012 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3016 value
->un
.addr
.base
= x
;
3017 value
->un
.addr
.offset
= 0;
3022 value
->kind
= RTX_UNKNOWN
;
3026 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0
3027 && GET_CODE (value
->un
.addr
.base
) == UNSPEC
)
3029 /* For a simple UNSPEC, the base is set to the
3030 operand, the kind field is set to the index of
3031 the unspec expression.
3032 Together with the code below, in case that
3033 the operand is a SYMBOL_REF or LABEL_REF,
3034 the address of the string or the code_label
3035 is taken as base. */
3036 if (XVECLEN (value
->un
.addr
.base
, 0) == 1)
3038 value
->kind
= RTX_UNSPEC
+ XINT (value
->un
.addr
.base
, 1);
3039 value
->un
.addr
.base
= XVECEXP (value
->un
.addr
.base
, 0, 0);
3043 if (value
->kind
>= RTX_INT
&& value
->un
.addr
.base
!= 0)
3044 switch (GET_CODE (value
->un
.addr
.base
))
3048 /* Use the string's address, not the SYMBOL_REF's address,
3049 for the sake of addresses of library routines. */
3050 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3055 /* For a LABEL_REF, compare labels. */
3056 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3063 /* Given a MINUS expression, simplify it if both sides
3064 include the same symbol. */
3067 simplify_subtraction (x
)
3070 struct rtx_const val0
, val1
;
3072 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3073 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3075 if (val0
.kind
>= RTX_INT
3076 && val0
.kind
== val1
.kind
3077 && val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3078 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3083 /* Compute a hash code for a constant RTL expression. */
3086 const_hash_rtx (mode
, x
)
3087 enum machine_mode mode
;
3091 struct rtx_const value
;
3092 unsigned int data
[sizeof(struct rtx_const
) / sizeof (unsigned int)];
3098 decode_rtx_const (mode
, x
, &u
.value
);
3100 /* Compute hashing function */
3102 for (i
= 0; i
< ARRAY_SIZE (u
.data
); i
++)
3103 hi
= hi
* 613 + u
.data
[i
];
3105 return hi
% MAX_RTX_HASH_TABLE
;
3108 /* Compare a constant rtl object X with a constant-descriptor DESC.
3109 Return 1 if DESC describes a constant with the same value as X. */
3112 compare_constant_rtx (mode
, x
, desc
)
3113 enum machine_mode mode
;
3115 struct constant_descriptor_rtx
*desc
;
3117 struct rtx_const value
;
3119 decode_rtx_const (mode
, x
, &value
);
3121 /* Compare constant contents. */
3122 return memcmp (&value
, &desc
->value
, sizeof (struct rtx_const
)) == 0;
3125 /* Construct a constant descriptor for the rtl-expression X.
3126 It is up to the caller to enter the descriptor in the hash table. */
3128 static struct constant_descriptor_rtx
*
3129 record_constant_rtx (mode
, x
)
3130 enum machine_mode mode
;
3133 struct constant_descriptor_rtx
*ptr
;
3135 ptr
= (struct constant_descriptor_rtx
*) ggc_alloc (sizeof (*ptr
));
3136 decode_rtx_const (mode
, x
, &ptr
->value
);
3141 /* Given a constant rtx X, return a MEM for the location in memory at which
3142 this constant has been placed. Return 0 if it not has been placed yet. */
3145 mem_for_const_double (x
)
3148 enum machine_mode mode
= GET_MODE (x
);
3149 struct constant_descriptor_rtx
*desc
;
3151 for (desc
= const_rtx_hash_table
[const_hash_rtx (mode
, x
)]; desc
;
3153 if (compare_constant_rtx (mode
, x
, desc
))
3159 /* Given a constant rtx X, make (or find) a memory constant for its value
3160 and return a MEM rtx to refer to it in memory. */
3163 force_const_mem (mode
, x
)
3164 enum machine_mode mode
;
3168 struct constant_descriptor_rtx
*desc
;
3171 struct pool_constant
*pool
;
3174 /* If we're not allowed to drop X into the constant pool, don't. */
3175 if ((*targetm
.cannot_force_const_mem
) (x
))
3178 /* Compute hash code of X. Search the descriptors for that hash code
3179 to see if any of them describes X. If yes, we have an rtx to use. */
3180 hash
= const_hash_rtx (mode
, x
);
3181 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3182 if (compare_constant_rtx (mode
, x
, desc
))
3185 /* No constant equal to X is known to have been output.
3186 Make a constant descriptor to enter X in the hash table
3187 and make a MEM for it. */
3188 desc
= record_constant_rtx (mode
, x
);
3189 desc
->next
= const_rtx_hash_table
[hash
];
3190 const_rtx_hash_table
[hash
] = desc
;
3192 /* Align the location counter as required by EXP's data type. */
3193 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
3194 #ifdef CONSTANT_ALIGNMENT
3195 align
= CONSTANT_ALIGNMENT (make_tree ((*lang_hooks
.types
.type_for_mode
)
3196 (mode
, 0), x
), align
);
3199 pool_offset
+= (align
/ BITS_PER_UNIT
) - 1;
3200 pool_offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
3202 if (GET_CODE (x
) == LABEL_REF
)
3203 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
3205 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3206 pool
= (struct pool_constant
*) ggc_alloc (sizeof (struct pool_constant
));
3210 pool
->labelno
= const_labelno
;
3211 pool
->align
= align
;
3212 pool
->offset
= pool_offset
;
3219 last_pool
->next
= pool
;
3222 pool_offset
+= GET_MODE_SIZE (mode
);
3224 /* Create a string containing the label name, in LABEL. */
3225 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3229 /* Construct the SYMBOL_REF and the MEM. */
3231 pool
->desc
->rtl
= def
3232 = gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
)));
3233 set_mem_alias_set (def
, const_alias_set
);
3234 set_mem_attributes (def
, (*lang_hooks
.types
.type_for_mode
) (mode
, 0), 1);
3235 RTX_UNCHANGING_P (def
) = 1;
3237 /* Add label to symbol hash table. */
3238 hash
= SYMHASH (XSTR (XEXP (def
, 0), 0));
3239 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3240 const_rtx_sym_hash_table
[hash
] = pool
;
3242 /* Mark the symbol_ref as belonging to this constants pool. */
3243 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3244 current_function_uses_const_pool
= 1;
3249 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3250 the corresponding pool_constant structure. */
3252 static struct pool_constant
*
3253 find_pool_constant (f
, addr
)
3257 struct pool_constant
*pool
;
3258 const char *label
= XSTR (addr
, 0);
3260 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3261 pool
= pool
->next_sym
)
3262 if (XSTR (XEXP (pool
->desc
->rtl
, 0), 0) == label
)
3268 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3271 get_pool_constant (addr
)
3274 return (find_pool_constant (cfun
, addr
))->constant
;
3277 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3278 and whether it has been output or not. */
3281 get_pool_constant_mark (addr
, pmarked
)
3285 struct pool_constant
*pool
= find_pool_constant (cfun
, addr
);
3286 *pmarked
= (pool
->mark
!= 0);
3287 return pool
->constant
;
3290 /* Likewise, but for the constant pool of a specific function. */
3293 get_pool_constant_for_function (f
, addr
)
3297 return (find_pool_constant (f
, addr
))->constant
;
3300 /* Similar, return the mode. */
3303 get_pool_mode (addr
)
3306 return (find_pool_constant (cfun
, addr
))->mode
;
3310 get_pool_mode_for_function (f
, addr
)
3314 return (find_pool_constant (f
, addr
))->mode
;
3317 /* Similar, return the offset in the constant pool. */
3320 get_pool_offset (addr
)
3323 return (find_pool_constant (cfun
, addr
))->offset
;
3326 /* Return the size of the constant pool. */
3334 /* Write all the constants in the constant pool. */
3337 output_constant_pool (fnname
, fndecl
)
3338 const char *fnname ATTRIBUTE_UNUSED
;
3339 tree fndecl ATTRIBUTE_UNUSED
;
3341 struct pool_constant
*pool
;
3345 /* It is possible for gcc to call force_const_mem and then to later
3346 discard the instructions which refer to the constant. In such a
3347 case we do not need to output the constant. */
3348 mark_constant_pool ();
3350 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3351 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3354 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3363 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3364 whose CODE_LABEL has been deleted. This can occur if a jump table
3365 is eliminated by optimization. If so, write a constant of zero
3366 instead. Note that this can also happen by turning the
3367 CODE_LABEL into a NOTE. */
3368 /* ??? This seems completely and utterly wrong. Certainly it's
3369 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3370 functioning even with INSN_DELETED_P and friends. */
3373 switch (GET_CODE (x
))
3376 if (GET_CODE (XEXP (x
, 0)) != PLUS
3377 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3379 tmp
= XEXP (XEXP (x
, 0), 0);
3384 if (INSN_DELETED_P (tmp
)
3385 || (GET_CODE (tmp
) == NOTE
3386 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3397 /* First switch to correct section. */
3398 (*targetm
.asm_out
.select_rtx_section
) (pool
->mode
, x
, pool
->align
);
3400 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3401 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3402 pool
->align
, pool
->labelno
, done
);
3405 assemble_align (pool
->align
);
3407 /* Output the label. */
3408 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LC", pool
->labelno
);
3410 /* Output the value of the constant itself. */
3411 switch (GET_MODE_CLASS (pool
->mode
))
3414 if (GET_CODE (x
) != CONST_DOUBLE
)
3417 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3418 assemble_real (r
, pool
->mode
, pool
->align
);
3422 case MODE_PARTIAL_INT
:
3423 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), pool
->align
, 1);
3426 case MODE_VECTOR_FLOAT
:
3431 if (GET_CODE (x
) != CONST_VECTOR
)
3434 units
= CONST_VECTOR_NUNITS (x
);
3436 for (i
= 0; i
< units
; i
++)
3438 elt
= CONST_VECTOR_ELT (x
, i
);
3439 REAL_VALUE_FROM_CONST_DOUBLE (r
, elt
);
3440 assemble_real (r
, GET_MODE_INNER (pool
->mode
), pool
->align
);
3445 case MODE_VECTOR_INT
:
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 assemble_integer (elt
, GET_MODE_UNIT_SIZE (pool
->mode
),
3468 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3469 sections have proper size. */
3470 if (pool
->align
> GET_MODE_BITSIZE (pool
->mode
)
3471 && in_section
== in_named
3472 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3473 assemble_align (pool
->align
);
3475 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3480 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3481 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3484 /* Done with this pool. */
3485 first_pool
= last_pool
= 0;
3488 /* Look through the instructions for this function, and mark all the
3489 entries in the constant pool which are actually being used.
3490 Emit used deferred strings. */
3493 mark_constant_pool ()
3497 struct pool_constant
*pool
;
3499 if (first_pool
== 0 && htab_elements (const_str_htab
) == 0)
3502 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3505 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3507 mark_constants (PATTERN (insn
));
3509 for (link
= current_function_epilogue_delay_list
;
3511 link
= XEXP (link
, 1))
3513 insn
= XEXP (link
, 0);
3516 mark_constants (PATTERN (insn
));
3520 /* Look through appropriate parts of X, marking all entries in the
3521 constant pool which are actually being used. Entries that are only
3522 referenced by other constants are also marked as used. Emit
3523 deferred strings that are used. */
3530 const char *format_ptr
;
3535 if (GET_CODE (x
) == SYMBOL_REF
)
3537 mark_constant (&x
, NULL
);
3541 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3542 insns, not any notes that may be attached. We don't want to mark
3543 a constant just because it happens to appear in a REG_EQUIV note. */
3546 mark_constants (PATTERN (x
));
3550 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3552 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3554 switch (*format_ptr
++)
3557 mark_constants (XEXP (x
, i
));
3561 if (XVEC (x
, i
) != 0)
3565 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3566 mark_constants (XVECEXP (x
, i
, j
));
3586 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3587 to as used. Emit referenced deferred strings. This function can
3588 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3591 mark_constant (current_rtx
, data
)
3593 void *data ATTRIBUTE_UNUSED
;
3595 rtx x
= *current_rtx
;
3600 else if (GET_CODE (x
) == SYMBOL_REF
)
3602 if (CONSTANT_POOL_ADDRESS_P (x
))
3604 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3605 if (pool
->mark
== 0)
3608 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3613 else if (STRING_POOL_ADDRESS_P (x
))
3615 struct deferred_string
**defstr
;
3617 defstr
= (struct deferred_string
**)
3618 htab_find_slot_with_hash (const_str_htab
, XSTR (x
, 0),
3619 STRHASH (XSTR (x
, 0)), NO_INSERT
);
3622 struct deferred_string
*p
= *defstr
;
3624 STRING_POOL_ADDRESS_P (x
) = 0;
3625 output_constant_def_contents (p
->exp
, 0, p
->labelno
);
3626 htab_clear_slot (const_str_htab
, (void **) defstr
);
3633 /* Find all the constants whose addresses are referenced inside of EXP,
3634 and make sure assembler code with a label has been output for each one.
3635 Indicate whether an ADDR_EXPR has been encountered. */
3638 output_addressed_constants (exp
)
3641 int reloc
= 0, reloc2
;
3644 /* Give the front-end a chance to convert VALUE to something that
3645 looks more like a constant to the back-end. */
3646 exp
= (*lang_hooks
.expand_constant
) (exp
);
3648 switch (TREE_CODE (exp
))
3652 /* Go inside any operations that get_inner_reference can handle and see
3653 if what's inside is a constant: no need to do anything here for
3654 addresses of variables or functions. */
3655 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3656 tem
= TREE_OPERAND (tem
, 0))
3659 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
3660 || TREE_CODE (tem
) == CONSTRUCTOR
)
3661 output_constant_def (tem
, 0);
3663 if (TREE_PUBLIC (tem
))
3670 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3671 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3675 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3676 reloc2
= output_addressed_constants (TREE_OPERAND (exp
, 1));
3677 /* The difference of two local labels is computable at link time. */
3678 if (reloc
== 1 && reloc2
== 1)
3686 case NON_LVALUE_EXPR
:
3687 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3691 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3692 if (TREE_VALUE (tem
) != 0)
3693 reloc
|= output_addressed_constants (TREE_VALUE (tem
));
3703 /* Return nonzero if VALUE is a valid constant-valued expression
3704 for use in initializing a static variable; one that can be an
3705 element of a "constant" initializer.
3707 Return null_pointer_node if the value is absolute;
3708 if it is relocatable, return the variable that determines the relocation.
3709 We assume that VALUE has been folded as much as possible;
3710 therefore, we do not need to check for such things as
3711 arithmetic-combinations of integers. */
3714 initializer_constant_valid_p (value
, endtype
)
3718 /* Give the front-end a chance to convert VALUE to something that
3719 looks more like a constant to the back-end. */
3720 value
= (*lang_hooks
.expand_constant
) (value
);
3722 switch (TREE_CODE (value
))
3725 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3726 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3727 && TREE_CONSTANT (value
)
3728 && CONSTRUCTOR_ELTS (value
))
3730 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
3733 return TREE_STATIC (value
) ? null_pointer_node
: 0;
3740 return null_pointer_node
;
3744 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
3746 case VIEW_CONVERT_EXPR
:
3747 case NON_LVALUE_EXPR
:
3748 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3752 /* Allow conversions between pointer types. */
3753 if (POINTER_TYPE_P (TREE_TYPE (value
))
3754 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3755 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3757 /* Allow conversions between real types. */
3758 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3759 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3760 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3762 /* Allow length-preserving conversions between integer types. */
3763 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3764 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3765 && (TYPE_PRECISION (TREE_TYPE (value
))
3766 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3767 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3769 /* Allow conversions between other integer types only if
3771 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3772 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3774 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3776 if (inner
== null_pointer_node
)
3777 return null_pointer_node
;
3781 /* Allow (int) &foo provided int is as wide as a pointer. */
3782 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3783 && POINTER_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),
3789 /* Likewise conversions from int to pointers, but also allow
3790 conversions from 0. */
3791 if (POINTER_TYPE_P (TREE_TYPE (value
))
3792 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3794 if (integer_zerop (TREE_OPERAND (value
, 0)))
3795 return null_pointer_node
;
3796 else if (TYPE_PRECISION (TREE_TYPE (value
))
3797 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
3798 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3802 /* Allow conversions to union types if the value inside is okay. */
3803 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
3804 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3809 if (! INTEGRAL_TYPE_P (endtype
)
3810 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3812 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3814 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3816 /* If either term is absolute, use the other terms relocation. */
3817 if (valid0
== null_pointer_node
)
3819 if (valid1
== null_pointer_node
)
3825 if (! INTEGRAL_TYPE_P (endtype
)
3826 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3828 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3830 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3832 /* Win if second argument is absolute. */
3833 if (valid1
== null_pointer_node
)
3835 /* Win if both arguments have the same relocation.
3836 Then the value is absolute. */
3837 if (valid0
== valid1
&& valid0
!= 0)
3838 return null_pointer_node
;
3840 /* Since GCC guarantees that string constants are unique in the
3841 generated code, a subtraction between two copies of the same
3842 constant string is absolute. */
3843 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
3844 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
3845 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
3846 return null_pointer_node
;
3849 /* Support differences between labels. */
3850 if (INTEGRAL_TYPE_P (endtype
))
3853 op0
= TREE_OPERAND (value
, 0);
3854 op1
= TREE_OPERAND (value
, 1);
3856 /* Like STRIP_NOPS except allow the operand mode to widen.
3857 This works around a feature of fold that simplifies
3858 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3859 that the narrower operation is cheaper. */
3861 while (TREE_CODE (op0
) == NOP_EXPR
3862 || TREE_CODE (op0
) == CONVERT_EXPR
3863 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3865 tree inner
= TREE_OPERAND (op0
, 0);
3866 if (inner
== error_mark_node
3867 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3868 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3869 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3874 while (TREE_CODE (op1
) == NOP_EXPR
3875 || TREE_CODE (op1
) == CONVERT_EXPR
3876 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3878 tree inner
= TREE_OPERAND (op1
, 0);
3879 if (inner
== error_mark_node
3880 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3881 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3882 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3887 if (TREE_CODE (op0
) == ADDR_EXPR
3888 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
3889 && TREE_CODE (op1
) == ADDR_EXPR
3890 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
3891 return null_pointer_node
;
3902 /* Output assembler code for constant EXP to FILE, with no label.
3903 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3904 Assumes output_addressed_constants has been done on EXP already.
3906 Generate exactly SIZE bytes of assembler data, padding at the end
3907 with zeros if necessary. SIZE must always be specified.
3909 SIZE is important for structure constructors,
3910 since trailing members may have been omitted from the constructor.
3911 It is also important for initialization of arrays from string constants
3912 since the full length of the string constant might not be wanted.
3913 It is also needed for initialization of unions, where the initializer's
3914 type is just one member, and that may not be as long as the union.
3916 There a case in which we would fail to output exactly SIZE bytes:
3917 for a structure constructor that wants to produce more than SIZE bytes.
3918 But such constructors will never be generated for any possible input.
3920 ALIGN is the alignment of the data in bits. */
3923 output_constant (exp
, size
, align
)
3928 enum tree_code code
;
3929 HOST_WIDE_INT thissize
;
3931 /* Some front-ends use constants other than the standard language-independent
3932 varieties, but which may still be output directly. Give the front-end a
3933 chance to convert EXP to a language-independent representation. */
3934 exp
= (*lang_hooks
.expand_constant
) (exp
);
3936 if (size
== 0 || flag_syntax_only
)
3939 /* Eliminate any conversions since we'll be outputting the underlying
3941 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3942 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3943 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3944 exp
= TREE_OPERAND (exp
, 0);
3946 code
= TREE_CODE (TREE_TYPE (exp
));
3947 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3949 /* Allow a constructor with no elements for any data type.
3950 This means to fill the space with zeros. */
3951 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3953 assemble_zeros (size
);
3957 if (TREE_CODE (exp
) == FDESC_EXPR
)
3959 #ifdef ASM_OUTPUT_FDESC
3960 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3961 tree decl
= TREE_OPERAND (exp
, 0);
3962 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3969 /* Now output the underlying data. If we've handling the padding, return.
3970 Otherwise, break and ensure THISSIZE is the size written. */
3978 case REFERENCE_TYPE
:
3979 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3980 EXPAND_INITIALIZER
),
3982 error ("initializer for integer value is too complicated");
3986 if (TREE_CODE (exp
) != REAL_CST
)
3987 error ("initializer for floating value is not a floating constant");
3989 assemble_real (TREE_REAL_CST (exp
),
3990 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0),
3995 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3996 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3997 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
4002 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4004 output_constructor (exp
, size
, align
);
4007 else if (TREE_CODE (exp
) == STRING_CST
)
4009 thissize
= MIN (TREE_STRING_LENGTH (exp
), size
);
4010 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
4018 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4019 output_constructor (exp
, size
, align
);
4025 if (TREE_CODE (exp
) == INTEGER_CST
)
4026 assemble_integer (expand_expr (exp
, NULL_RTX
,
4027 VOIDmode
, EXPAND_INITIALIZER
),
4028 thissize
, align
, 1);
4029 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4031 unsigned char *buffer
= (unsigned char *) alloca (thissize
);
4032 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
4034 assemble_string ((char *) buffer
, thissize
);
4037 error ("unknown set constructor type");
4049 assemble_zeros (size
);
4053 /* Subroutine of output_constructor, used for computing the size of
4054 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4055 type with an unspecified upper bound. */
4057 static unsigned HOST_WIDE_INT
4058 array_size_for_constructor (val
)
4063 /* This code used to attempt to handle string constants that are not
4064 arrays of single-bytes, but nothing else does, so there's no point in
4066 if (TREE_CODE (val
) == STRING_CST
)
4067 return TREE_STRING_LENGTH (val
);
4069 max_index
= NULL_TREE
;
4070 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
4072 tree index
= TREE_PURPOSE (i
);
4074 if (TREE_CODE (index
) == RANGE_EXPR
)
4075 index
= TREE_OPERAND (index
, 1);
4076 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
4080 if (max_index
== NULL_TREE
)
4083 /* Compute the total number of array elements. */
4084 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
4086 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
4087 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
4089 /* Multiply by the array element unit size to find number of bytes. */
4090 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
4092 return tree_low_cst (i
, 1);
4095 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4096 Generate at least SIZE bytes, padding if necessary. */
4099 output_constructor (exp
, size
, align
)
4104 tree type
= TREE_TYPE (exp
);
4105 tree link
, field
= 0;
4107 /* Number of bytes output or skipped so far.
4108 In other words, current position within the constructor. */
4109 HOST_WIDE_INT total_bytes
= 0;
4110 /* Nonzero means BYTE contains part of a byte, to be output. */
4111 int byte_buffer_in_use
= 0;
4114 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4117 if (TREE_CODE (type
) == RECORD_TYPE
)
4118 field
= TYPE_FIELDS (type
);
4120 if (TREE_CODE (type
) == ARRAY_TYPE
4121 && TYPE_DOMAIN (type
) != 0)
4122 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
4124 /* As LINK goes through the elements of the constant,
4125 FIELD goes through the structure fields, if the constant is a structure.
4126 if the constant is a union, then we override this,
4127 by getting the field from the TREE_LIST element.
4128 But the constant could also be an array. Then FIELD is zero.
4130 There is always a maximum of one element in the chain LINK for unions
4131 (even if the initializer in a source program incorrectly contains
4133 for (link
= CONSTRUCTOR_ELTS (exp
);
4135 link
= TREE_CHAIN (link
),
4136 field
= field
? TREE_CHAIN (field
) : 0)
4138 tree val
= TREE_VALUE (link
);
4141 /* The element in a union constructor specifies the proper field
4143 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4144 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4145 && TREE_PURPOSE (link
) != 0)
4146 field
= TREE_PURPOSE (link
);
4148 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4149 index
= TREE_PURPOSE (link
);
4151 /* Eliminate the marker that makes a cast not be an lvalue. */
4155 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4157 unsigned HOST_WIDE_INT fieldsize
4158 = int_size_in_bytes (TREE_TYPE (type
));
4159 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
4160 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
4161 HOST_WIDE_INT index
;
4162 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
4164 for (index
= lo_index
; index
<= hi_index
; index
++)
4166 /* Output the element's initial value. */
4168 assemble_zeros (fieldsize
);
4170 output_constant (val
, fieldsize
, align2
);
4172 /* Count its size. */
4173 total_bytes
+= fieldsize
;
4176 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4178 /* An element that is not a bit-field. */
4180 unsigned HOST_WIDE_INT fieldsize
;
4181 /* Since this structure is static,
4182 we know the positions are constant. */
4183 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
4184 unsigned int align2
;
4187 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4188 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
4190 /* Output any buffered-up bit-fields preceding this element. */
4191 if (byte_buffer_in_use
)
4193 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4195 byte_buffer_in_use
= 0;
4198 /* Advance to offset of this element.
4199 Note no alignment needed in an array, since that is guaranteed
4200 if each element has the proper size. */
4201 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
4203 assemble_zeros (pos
- total_bytes
);
4207 /* Find the alignment of this element. */
4208 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
4210 /* Determine size this element should occupy. */
4215 /* If this is an array with an unspecified upper bound,
4216 the initializer determines the size. */
4217 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4218 but we cannot do this until the deprecated support for
4219 initializing zero-length array members is removed. */
4220 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4221 && TYPE_DOMAIN (TREE_TYPE (field
))
4222 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4224 fieldsize
= array_size_for_constructor (val
);
4225 /* Given a non-empty initialization, this field had
4227 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4230 else if (DECL_SIZE_UNIT (field
))
4232 /* ??? This can't be right. If the decl size overflows
4233 a host integer we will silently emit no data. */
4234 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4235 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4239 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4241 /* Output the element's initial value. */
4243 assemble_zeros (fieldsize
);
4245 output_constant (val
, fieldsize
, align2
);
4247 /* Count its size. */
4248 total_bytes
+= fieldsize
;
4250 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4251 error ("invalid initial value for member `%s'",
4252 IDENTIFIER_POINTER (DECL_NAME (field
)));
4255 /* Element that is a bit-field. */
4257 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4258 HOST_WIDE_INT end_offset
4259 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4262 val
= integer_zero_node
;
4264 /* If this field does not start in this (or, next) byte,
4266 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4268 /* Output remnant of any bit field in previous bytes. */
4269 if (byte_buffer_in_use
)
4271 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4273 byte_buffer_in_use
= 0;
4276 /* If still not at proper byte, advance to there. */
4277 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4279 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4280 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4284 if (! byte_buffer_in_use
)
4287 /* We must split the element into pieces that fall within
4288 separate bytes, and combine each byte with previous or
4289 following bit-fields. */
4291 /* next_offset is the offset n fbits from the beginning of
4292 the structure to the next bit of this element to be processed.
4293 end_offset is the offset of the first bit past the end of
4295 while (next_offset
< end_offset
)
4299 HOST_WIDE_INT value
;
4300 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4301 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4303 /* Advance from byte to byte
4304 within this element when necessary. */
4305 while (next_byte
!= total_bytes
)
4307 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4312 /* Number of bits we can process at once
4313 (all part of the same byte). */
4314 this_time
= MIN (end_offset
- next_offset
,
4315 BITS_PER_UNIT
- next_bit
);
4316 if (BYTES_BIG_ENDIAN
)
4318 /* On big-endian machine, take the most significant bits
4319 first (of the bits that are significant)
4320 and put them into bytes from the most significant end. */
4321 shift
= end_offset
- next_offset
- this_time
;
4323 /* Don't try to take a bunch of bits that cross
4324 the word boundary in the INTEGER_CST. We can
4325 only select bits from the LOW or HIGH part
4327 if (shift
< HOST_BITS_PER_WIDE_INT
4328 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4330 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4331 shift
= HOST_BITS_PER_WIDE_INT
;
4334 /* Now get the bits from the appropriate constant word. */
4335 if (shift
< HOST_BITS_PER_WIDE_INT
)
4336 value
= TREE_INT_CST_LOW (val
);
4337 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4339 value
= TREE_INT_CST_HIGH (val
);
4340 shift
-= HOST_BITS_PER_WIDE_INT
;
4345 /* Get the result. This works only when:
4346 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4347 byte
|= (((value
>> shift
)
4348 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4349 << (BITS_PER_UNIT
- this_time
- next_bit
));
4353 /* On little-endian machines,
4354 take first the least significant bits of the value
4355 and pack them starting at the least significant
4356 bits of the bytes. */
4357 shift
= next_offset
- int_bit_position (field
);
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
)
4365 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4367 /* Now get the bits from the appropriate constant word. */
4368 if (shift
< HOST_BITS_PER_WIDE_INT
)
4369 value
= TREE_INT_CST_LOW (val
);
4370 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4372 value
= TREE_INT_CST_HIGH (val
);
4373 shift
-= HOST_BITS_PER_WIDE_INT
;
4378 /* Get the result. This works only when:
4379 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4380 byte
|= (((value
>> shift
)
4381 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4385 next_offset
+= this_time
;
4386 byte_buffer_in_use
= 1;
4391 if (byte_buffer_in_use
)
4393 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4397 if (total_bytes
< size
)
4398 assemble_zeros (size
- total_bytes
);
4401 /* This TREE_LIST contains any weak symbol declarations waiting
4403 static GTY(()) tree weak_decls
;
4405 /* Mark DECL as weak. */
4411 DECL_WEAK (decl
) = 1;
4413 if (DECL_RTL_SET_P (decl
)
4414 && GET_CODE (DECL_RTL (decl
)) == MEM
4415 && XEXP (DECL_RTL (decl
), 0)
4416 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4417 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4420 /* Merge weak status between NEWDECL and OLDDECL. */
4423 merge_weak (newdecl
, olddecl
)
4427 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4430 if (DECL_WEAK (newdecl
))
4434 /* NEWDECL is weak, but OLDDECL is not. */
4436 /* If we already output the OLDDECL, we're in trouble; we can't
4437 go back and make it weak. This error cannot caught in
4438 declare_weak because the NEWDECL and OLDDECL was not yet
4439 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4440 if (TREE_ASM_WRITTEN (olddecl
))
4441 error_with_decl (newdecl
,
4442 "weak declaration of `%s' must precede definition");
4444 /* If we've already generated rtl referencing OLDDECL, we may
4445 have done so in a way that will not function properly with
4447 else if (TREE_USED (olddecl
)
4448 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4449 warning_with_decl (newdecl
, "weak declaration of `%s' after first use results in unspecified behavior");
4453 /* We put the NEWDECL on the weak_decls list at some point.
4454 Replace it with the OLDDECL. */
4455 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4456 if (TREE_VALUE (wd
) == newdecl
)
4458 TREE_VALUE (wd
) = olddecl
;
4461 /* We may not find the entry on the list. If NEWDECL is a
4462 weak alias, then we will have already called
4463 globalize_decl to remove the entry; in that case, we do
4464 not need to do anything. */
4467 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4468 mark_weak (olddecl
);
4471 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4472 weak. Just update NEWDECL to indicate that it's weak too. */
4473 mark_weak (newdecl
);
4476 /* Declare DECL to be a weak symbol. */
4482 if (! TREE_PUBLIC (decl
))
4483 error_with_decl (decl
, "weak declaration of `%s' must be public");
4484 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4485 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4486 else if (SUPPORTS_WEAK
)
4488 if (! DECL_WEAK (decl
))
4489 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4492 warning_with_decl (decl
, "weak declaration of `%s' not supported");
4497 /* Emit any pending weak declarations. */
4504 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4506 tree decl
= TREE_VALUE (t
);
4507 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4508 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4511 if (! TREE_USED (decl
))
4514 #ifdef ASM_WEAKEN_DECL
4515 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4517 #ifdef ASM_WEAKEN_LABEL
4518 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4520 #ifdef ASM_OUTPUT_WEAK_ALIAS
4521 warning ("only weak aliases are supported in this configuration");
4529 /* Emit the assembly bits to indicate that DECL is globally visible. */
4532 globalize_decl (decl
)
4535 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4537 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4538 if (DECL_WEAK (decl
))
4542 #ifdef ASM_WEAKEN_DECL
4543 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4545 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4548 /* Remove this function from the pending weak list so that
4549 we do not emit multiple .weak directives for it. */
4550 for (p
= &weak_decls
; (t
= *p
) ; )
4552 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4553 *p
= TREE_CHAIN (t
);
4555 p
= &TREE_CHAIN (t
);
4561 (*targetm
.asm_out
.globalize_label
) (asm_out_file
, name
);
4564 /* Emit an assembler directive to make the symbol for DECL an alias to
4565 the symbol for TARGET. */
4568 assemble_alias (decl
, target
)
4569 tree decl
, target ATTRIBUTE_UNUSED
;
4573 /* We must force creation of DECL_RTL for debug info generation, even though
4574 we don't use it here. */
4575 make_decl_rtl (decl
, NULL
);
4577 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4579 #ifdef ASM_OUTPUT_DEF
4580 /* Make name accessible from other files, if appropriate. */
4582 if (TREE_PUBLIC (decl
))
4584 globalize_decl (decl
);
4585 maybe_assemble_visibility (decl
);
4588 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4589 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4591 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4593 #else /* !ASM_OUTPUT_DEF */
4594 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4595 if (! DECL_WEAK (decl
))
4596 warning ("only weak aliases are supported in this configuration");
4598 #ifdef ASM_WEAKEN_DECL
4599 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4601 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4604 warning ("alias definitions not supported in this configuration; ignored");
4608 TREE_USED (decl
) = 1;
4609 TREE_ASM_WRITTEN (decl
) = 1;
4610 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4613 /* Emit an assembler directive to set symbol for DECL visibility to
4614 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4617 default_assemble_visibility (decl
, vis
)
4621 static const char * const visibility_types
[] = {
4622 NULL
, "internal", "hidden", "protected"
4625 const char *name
, *type
;
4627 name
= (* targetm
.strip_name_encoding
)
4628 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4629 type
= visibility_types
[vis
];
4631 #ifdef HAVE_GAS_HIDDEN
4632 fprintf (asm_out_file
, "\t.%s\t%s\n", type
, name
);
4634 warning ("visibility attribute not supported in this configuration; ignored");
4638 /* A helper function to call assemble_visibility when needed for a decl. */
4641 maybe_assemble_visibility (decl
)
4644 enum symbol_visibility vis
= decl_visibility (decl
);
4646 if (vis
!= VISIBILITY_DEFAULT
)
4647 (* targetm
.asm_out
.visibility
) (decl
, vis
);
4650 /* Returns 1 if the target configuration supports defining public symbols
4651 so that one of them will be chosen at link time instead of generating a
4652 multiply-defined symbol error, whether through the use of weak symbols or
4653 a target-specific mechanism for having duplicates discarded. */
4656 supports_one_only ()
4658 if (SUPPORTS_ONE_ONLY
)
4660 return SUPPORTS_WEAK
;
4663 /* Set up DECL as a public symbol that can be defined in multiple
4664 translation units without generating a linker error. */
4667 make_decl_one_only (decl
)
4670 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4673 TREE_PUBLIC (decl
) = 1;
4675 if (TREE_CODE (decl
) == VAR_DECL
4676 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4677 DECL_COMMON (decl
) = 1;
4678 else if (SUPPORTS_ONE_ONLY
)
4680 #ifdef MAKE_DECL_ONE_ONLY
4681 MAKE_DECL_ONE_ONLY (decl
);
4683 DECL_ONE_ONLY (decl
) = 1;
4685 else if (SUPPORTS_WEAK
)
4686 DECL_WEAK (decl
) = 1;
4694 const_str_htab
= htab_create_ggc (128, const_str_htab_hash
,
4695 const_str_htab_eq
, NULL
);
4696 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4697 in_named_entry_eq
, NULL
);
4699 const_alias_set
= new_alias_set ();
4703 decl_tls_model (decl
)
4706 enum tls_model kind
;
4707 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4712 attr
= TREE_VALUE (TREE_VALUE (attr
));
4713 if (TREE_CODE (attr
) != STRING_CST
)
4715 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4716 kind
= TLS_MODEL_LOCAL_EXEC
;
4717 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4718 kind
= TLS_MODEL_INITIAL_EXEC
;
4719 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4720 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4721 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4722 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4728 is_local
= (*targetm
.binds_local_p
) (decl
);
4732 kind
= TLS_MODEL_LOCAL_EXEC
;
4734 kind
= TLS_MODEL_INITIAL_EXEC
;
4736 /* Local dynamic is inefficient when we're not combining the
4737 parts of the address. */
4738 else if (optimize
&& is_local
)
4739 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4741 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4742 if (kind
< flag_tls_default
)
4743 kind
= flag_tls_default
;
4748 enum symbol_visibility
4749 decl_visibility (decl
)
4752 tree attr
= lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
));
4756 const char *which
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
4758 if (strcmp (which
, "default") == 0)
4759 return VISIBILITY_DEFAULT
;
4760 if (strcmp (which
, "internal") == 0)
4761 return VISIBILITY_INTERNAL
;
4762 if (strcmp (which
, "hidden") == 0)
4763 return VISIBILITY_HIDDEN
;
4764 if (strcmp (which
, "protected") == 0)
4765 return VISIBILITY_PROTECTED
;
4770 return VISIBILITY_DEFAULT
;
4773 /* Select a set of attributes for section NAME based on the properties
4774 of DECL and whether or not RELOC indicates that DECL's initializer
4775 might contain runtime relocations.
4777 We make the section read-only and executable for a function decl,
4778 read-only for a const data decl, and writable for a non-const data decl. */
4781 default_section_type_flags (decl
, name
, reloc
)
4786 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4790 default_section_type_flags_1 (decl
, name
, reloc
, shlib
)
4798 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4799 flags
= SECTION_CODE
;
4800 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4803 flags
= SECTION_WRITE
;
4805 if (decl
&& DECL_ONE_ONLY (decl
))
4806 flags
|= SECTION_LINKONCE
;
4808 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4809 flags
|= SECTION_TLS
| SECTION_WRITE
;
4811 if (strcmp (name
, ".bss") == 0
4812 || strncmp (name
, ".bss.", 5) == 0
4813 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4814 || strcmp (name
, ".sbss") == 0
4815 || strncmp (name
, ".sbss.", 6) == 0
4816 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0
4817 || strcmp (name
, ".tbss") == 0
4818 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4819 flags
|= SECTION_BSS
;
4821 if (strcmp (name
, ".tdata") == 0
4822 || strcmp (name
, ".tbss") == 0
4823 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0
4824 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4825 flags
|= SECTION_TLS
;
4827 /* These three sections have special ELF types. They are neither
4828 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4829 want to print a section type (@progbits or @nobits). If someone
4830 is silly enough to emit code or TLS variables to one of these
4831 sections, then don't handle them specially. */
4832 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4833 && (strcmp (name
, ".init_array") == 0
4834 || strcmp (name
, ".fini_array") == 0
4835 || strcmp (name
, ".preinit_array") == 0))
4836 flags
|= SECTION_NOTYPE
;
4841 /* Output assembly to switch to section NAME with attribute FLAGS.
4842 Four variants for common object file formats. */
4845 default_no_named_section (name
, flags
)
4846 const char *name ATTRIBUTE_UNUSED
;
4847 unsigned int flags ATTRIBUTE_UNUSED
;
4849 /* Some object formats don't support named sections at all. The
4850 front-end should already have flagged this as an error. */
4855 default_elf_asm_named_section (name
, flags
)
4859 char flagchars
[10], *f
= flagchars
;
4861 if (! named_section_first_declaration (name
))
4863 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4867 if (!(flags
& SECTION_DEBUG
))
4869 if (flags
& SECTION_WRITE
)
4871 if (flags
& SECTION_CODE
)
4873 if (flags
& SECTION_SMALL
)
4875 if (flags
& SECTION_MERGE
)
4877 if (flags
& SECTION_STRINGS
)
4879 if (flags
& SECTION_TLS
)
4883 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4885 if (!(flags
& SECTION_NOTYPE
))
4889 if (flags
& SECTION_BSS
)
4894 fprintf (asm_out_file
, ",@%s", type
);
4896 if (flags
& SECTION_ENTSIZE
)
4897 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4900 putc ('\n', asm_out_file
);
4904 default_coff_asm_named_section (name
, flags
)
4908 char flagchars
[8], *f
= flagchars
;
4910 if (flags
& SECTION_WRITE
)
4912 if (flags
& SECTION_CODE
)
4916 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4920 default_pe_asm_named_section (name
, flags
)
4924 default_coff_asm_named_section (name
, flags
);
4926 if (flags
& SECTION_LINKONCE
)
4928 /* Functions may have been compiled at various levels of
4929 optimization so we can't use `same_size' here.
4930 Instead, have the linker pick one. */
4931 fprintf (asm_out_file
, "\t.linkonce %s\n",
4932 (flags
& SECTION_CODE
? "discard" : "same_size"));
4936 /* Used for vtable gc in GNU binutils. Record that the pointer at OFFSET
4937 from SYMBOL is used in all classes derived from SYMBOL. */
4940 assemble_vtable_entry (symbol
, offset
)
4942 HOST_WIDE_INT offset
;
4944 fputs ("\t.vtable_entry ", asm_out_file
);
4945 output_addr_const (asm_out_file
, symbol
);
4946 fputs (", ", asm_out_file
);
4947 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
, offset
);
4948 fputc ('\n', asm_out_file
);
4951 /* Used for vtable gc in GNU binutils. Record the class hierarchy by noting
4952 that the vtable symbol CHILD is derived from the vtable symbol PARENT. */
4955 assemble_vtable_inherit (child
, parent
)
4958 fputs ("\t.vtable_inherit ", asm_out_file
);
4959 output_addr_const (asm_out_file
, child
);
4960 fputs (", ", asm_out_file
);
4961 output_addr_const (asm_out_file
, parent
);
4962 fputc ('\n', asm_out_file
);
4965 /* The lame default section selector. */
4968 default_select_section (decl
, reloc
, align
)
4971 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
4973 bool readonly
= false;
4977 if (decl_readonly_section (decl
, reloc
))
4980 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4982 if (! ((flag_pic
&& reloc
)
4983 || !TREE_READONLY (decl
)
4984 || TREE_SIDE_EFFECTS (decl
)
4985 || !TREE_CONSTANT (decl
)))
4988 else if (TREE_CODE (decl
) == STRING_CST
)
4989 readonly
= !flag_writable_strings
;
4990 else if (! (flag_pic
&& reloc
))
4994 readonly_data_section ();
4999 /* A helper function for default_elf_select_section and
5000 default_elf_unique_section. Categorizes the DECL. */
5002 enum section_category
5007 SECCAT_RODATA_MERGE_STR
,
5008 SECCAT_RODATA_MERGE_STR_INIT
,
5009 SECCAT_RODATA_MERGE_CONST
,
5014 /* To optimize loading of shared programs, define following subsections
5016 _REL Contains data that has relocations, so they get grouped
5017 together and dynamic linker will visit fewer pages in memory.
5018 _RO Contains data that is otherwise read-only. This is useful
5019 with prelinking as most relocations won't be dynamically
5020 linked and thus stay read only.
5021 _LOCAL Marks data containing relocations only to local objects.
5022 These relocations will get fully resolved by prelinking. */
5024 SECCAT_DATA_REL_LOCAL
,
5026 SECCAT_DATA_REL_RO_LOCAL
,
5036 static enum section_category
5037 categorize_decl_for_section
PARAMS ((tree
, int, int));
5039 static enum section_category
5040 categorize_decl_for_section (decl
, reloc
, shlib
)
5045 enum section_category ret
;
5047 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5049 else if (TREE_CODE (decl
) == STRING_CST
)
5051 if (flag_writable_strings
)
5054 return SECCAT_RODATA_MERGE_STR
;
5056 else if (TREE_CODE (decl
) == VAR_DECL
)
5058 if (DECL_INITIAL (decl
) == NULL
5059 || DECL_INITIAL (decl
) == error_mark_node
)
5061 else if (! TREE_READONLY (decl
)
5062 || TREE_SIDE_EFFECTS (decl
)
5063 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
5065 if (shlib
&& (reloc
& 2))
5066 ret
= SECCAT_DATA_REL
;
5067 else if (shlib
&& reloc
)
5068 ret
= SECCAT_DATA_REL_LOCAL
;
5072 else if (shlib
&& (reloc
& 2))
5073 ret
= SECCAT_DATA_REL_RO
;
5074 else if (shlib
&& reloc
)
5075 ret
= SECCAT_DATA_REL_RO_LOCAL
;
5076 else if (reloc
|| flag_merge_constants
< 2)
5077 /* C and C++ don't allow different variables to share the same
5078 location. -fmerge-all-constants allows even that (at the
5079 expense of not conforming). */
5080 ret
= SECCAT_RODATA
;
5081 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
5082 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
5084 ret
= SECCAT_RODATA_MERGE_CONST
;
5086 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
5088 if ((shlib
&& reloc
)
5089 || TREE_SIDE_EFFECTS (decl
)
5090 || ! TREE_CONSTANT (decl
))
5093 ret
= SECCAT_RODATA
;
5096 ret
= SECCAT_RODATA
;
5098 /* There are no read-only thread-local sections. */
5099 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5101 if (ret
== SECCAT_BSS
)
5107 /* If the target uses small data sections, select it. */
5108 else if ((*targetm
.in_small_data_p
) (decl
))
5110 if (ret
== SECCAT_BSS
)
5112 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
5113 ret
= SECCAT_SRODATA
;
5122 decl_readonly_section (decl
, reloc
)
5126 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
5130 decl_readonly_section_1 (decl
, reloc
, shlib
)
5135 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5138 case SECCAT_RODATA_MERGE_STR
:
5139 case SECCAT_RODATA_MERGE_STR_INIT
:
5140 case SECCAT_RODATA_MERGE_CONST
:
5141 case SECCAT_SRODATA
:
5150 /* Select a section based on the above categorization. */
5153 default_elf_select_section (decl
, reloc
, align
)
5156 unsigned HOST_WIDE_INT align
;
5158 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
5162 default_elf_select_section_1 (decl
, reloc
, align
, shlib
)
5165 unsigned HOST_WIDE_INT align
;
5168 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5171 /* We're not supposed to be called on FUNCTION_DECLs. */
5174 readonly_data_section ();
5176 case SECCAT_RODATA_MERGE_STR
:
5177 mergeable_string_section (decl
, align
, 0);
5179 case SECCAT_RODATA_MERGE_STR_INIT
:
5180 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
5182 case SECCAT_RODATA_MERGE_CONST
:
5183 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
5185 case SECCAT_SRODATA
:
5186 named_section (NULL_TREE
, ".sdata2", reloc
);
5191 case SECCAT_DATA_REL
:
5192 named_section (NULL_TREE
, ".data.rel", reloc
);
5194 case SECCAT_DATA_REL_LOCAL
:
5195 named_section (NULL_TREE
, ".data.rel.local", reloc
);
5197 case SECCAT_DATA_REL_RO
:
5198 named_section (NULL_TREE
, ".data.rel.ro", reloc
);
5200 case SECCAT_DATA_REL_RO_LOCAL
:
5201 named_section (NULL_TREE
, ".data.rel.ro.local", reloc
);
5204 named_section (NULL_TREE
, ".sdata", reloc
);
5207 named_section (NULL_TREE
, ".tdata", reloc
);
5210 #ifdef BSS_SECTION_ASM_OP
5213 named_section (NULL_TREE
, ".bss", reloc
);
5217 named_section (NULL_TREE
, ".sbss", reloc
);
5220 named_section (NULL_TREE
, ".tbss", reloc
);
5227 /* Construct a unique section name based on the decl name and the
5228 categorization performed above. */
5231 default_unique_section (decl
, reloc
)
5235 default_unique_section_1 (decl
, reloc
, flag_pic
);
5239 default_unique_section_1 (decl
, reloc
, shlib
)
5244 bool one_only
= DECL_ONE_ONLY (decl
);
5245 const char *prefix
, *name
;
5249 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5252 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
5255 case SECCAT_RODATA_MERGE_STR
:
5256 case SECCAT_RODATA_MERGE_STR_INIT
:
5257 case SECCAT_RODATA_MERGE_CONST
:
5258 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
5260 case SECCAT_SRODATA
:
5261 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
5264 case SECCAT_DATA_REL
:
5265 case SECCAT_DATA_REL_LOCAL
:
5266 case SECCAT_DATA_REL_RO
:
5267 case SECCAT_DATA_REL_RO_LOCAL
:
5268 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
5271 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
5274 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
5277 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
5280 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
5283 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
5288 plen
= strlen (prefix
);
5290 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5291 name
= (* targetm
.strip_name_encoding
) (name
);
5292 nlen
= strlen (name
);
5294 string
= alloca (nlen
+ plen
+ 1);
5295 memcpy (string
, prefix
, plen
);
5296 memcpy (string
+ plen
, name
, nlen
+ 1);
5298 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
5302 default_select_rtx_section (mode
, x
, align
)
5303 enum machine_mode mode ATTRIBUTE_UNUSED
;
5305 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
5308 switch (GET_CODE (x
))
5320 readonly_data_section ();
5324 default_elf_select_rtx_section (mode
, x
, align
)
5325 enum machine_mode mode
;
5327 unsigned HOST_WIDE_INT align
;
5329 /* ??? Handle small data here somehow. */
5332 switch (GET_CODE (x
))
5336 named_section (NULL_TREE
, ".data.rel.ro", 3);
5340 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
5347 mergeable_constant_section (mode
, align
, 0);
5350 /* By default, we do nothing for encode_section_info, so we need not
5351 do anything but discard the '*' marker. */
5354 default_strip_name_encoding (str
)
5357 return str
+ (*str
== '*');
5360 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5361 wrt cross-module name binding. */
5364 default_binds_local_p (exp
)
5367 return default_binds_local_p_1 (exp
, flag_pic
);
5371 default_binds_local_p_1 (exp
, shlib
)
5377 /* A non-decl is an entry in the constant pool. */
5380 /* Static variables are always local. */
5381 else if (! TREE_PUBLIC (exp
))
5383 /* A variable is local if the user tells us so. */
5384 else if (decl_visibility (exp
) != VISIBILITY_DEFAULT
)
5386 /* Otherwise, variables defined outside this object may not be local. */
5387 else if (DECL_EXTERNAL (exp
))
5389 /* Linkonce and weak data are never local. */
5390 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
5392 /* If PIC, then assume that any global name can be overridden by
5393 symbols resolved from other modules. */
5396 /* Uninitialized COMMON variable may be unified with symbols
5397 resolved from other modules. */
5398 else if (DECL_COMMON (exp
)
5399 && (DECL_INITIAL (exp
) == NULL
5400 || DECL_INITIAL (exp
) == error_mark_node
))
5402 /* Otherwise we're left with initialized (or non-common) global data
5403 which is of necessity defined locally. */
5410 /* Determine whether or not a pointer mode is valid. Assume defaults
5411 of ptr_mode or Pmode - can be overridden. */
5413 default_valid_pointer_mode (mode
)
5414 enum machine_mode mode
;
5416 return (mode
== ptr_mode
|| mode
== Pmode
);
5419 /* Default function to output code that will globalize a label. A
5420 target must define GLOBAL_ASM_OP or provide it's own function to
5421 globalize a label. */
5422 #ifdef GLOBAL_ASM_OP
5424 default_globalize_label (stream
, name
)
5428 fputs (GLOBAL_ASM_OP
, stream
);
5429 assemble_name (stream
, name
);
5430 putc ('\n', stream
);
5432 #endif /* GLOBAL_ASM_OP */
5434 /* This is how to output an internal numbered label where PREFIX is
5435 the class of label and LABELNO is the number within the class. */
5438 default_internal_label (stream
, prefix
, labelno
)
5441 unsigned long labelno
;
5443 char *const buf
= alloca (40 + strlen (prefix
));
5444 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5445 ASM_OUTPUT_LABEL (stream
, buf
);
5448 #include "gt-varasm.h"