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"
47 #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
;
100 /* Number of tree-constants deferred during the expansion of this
102 unsigned int deferred_constants
;
105 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
106 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
107 #define first_pool (cfun->varasm->x_first_pool)
108 #define last_pool (cfun->varasm->x_last_pool)
109 #define pool_offset (cfun->varasm->x_pool_offset)
110 #define n_deferred_constants (cfun->varasm->deferred_constants)
112 /* Number for making the label on the next
113 constant that is stored in memory. */
115 static GTY(()) int const_labelno
;
117 /* Number for making the label on the next
118 static variable internal to a function. */
120 static GTY(()) int var_labelno
;
122 /* Carry information from ASM_DECLARE_OBJECT_NAME
123 to ASM_FINISH_DECLARE_OBJECT. */
125 int size_directive_output
;
127 /* The last decl for which assemble_variable was called,
128 if it did ASM_DECLARE_OBJECT_NAME.
129 If the last call to assemble_variable didn't do that,
132 tree last_assemble_variable_decl
;
134 /* RTX_UNCHANGING_P in a MEM can mean it is stored into, for initialization.
135 So giving constant the alias set for the type will allow such
136 initializations to appear to conflict with the load of the constant. We
137 avoid this by giving all constants an alias set for just constants.
138 Since there will be no stores to that alias set, nothing will ever
139 conflict with them. */
141 static HOST_WIDE_INT const_alias_set
;
143 static const char *strip_reg_name (const char *);
144 static int contains_pointers_p (tree
);
145 static void decode_addr_const (tree
, struct addr_const
*);
146 static hashval_t
const_desc_hash (const void *);
147 static int const_desc_eq (const void *, const void *);
148 static hashval_t
const_hash_1 (const tree
);
149 static int compare_constant (const tree
, const tree
);
150 static tree
copy_constant (tree
);
151 static void output_constant_def_contents (rtx
);
152 static void decode_rtx_const (enum machine_mode
, rtx
, struct rtx_const
*);
153 static unsigned int const_hash_rtx (enum machine_mode
, rtx
);
154 static int compare_constant_rtx (enum machine_mode
, rtx
,
155 struct constant_descriptor_rtx
*);
156 static struct constant_descriptor_rtx
* record_constant_rtx
157 (enum machine_mode
, rtx
);
158 static struct pool_constant
*find_pool_constant (struct function
*, rtx
);
159 static void mark_constant_pool (void);
160 static void mark_constants (rtx
);
161 static int mark_constant (rtx
*current_rtx
, void *data
);
162 static int output_addressed_constants (tree
);
163 static unsigned HOST_WIDE_INT
array_size_for_constructor (tree
);
164 static unsigned min_align (unsigned, unsigned);
165 static void output_constructor (tree
, unsigned HOST_WIDE_INT
, unsigned int);
166 static void globalize_decl (tree
);
167 static void maybe_assemble_visibility (tree
);
168 static int in_named_entry_eq (const void *, const void *);
169 static hashval_t
in_named_entry_hash (const void *);
170 #ifdef ASM_OUTPUT_BSS
171 static void asm_output_bss (FILE *, tree
, const char *,
172 unsigned HOST_WIDE_INT
, unsigned HOST_WIDE_INT
);
174 #ifdef BSS_SECTION_ASM_OP
175 #ifdef ASM_OUTPUT_ALIGNED_BSS
176 static void asm_output_aligned_bss (FILE *, tree
, const char *,
177 unsigned HOST_WIDE_INT
, int)
180 #endif /* BSS_SECTION_ASM_OP */
181 static bool asm_emit_uninitialised (tree
, const char*,
182 unsigned HOST_WIDE_INT
,
183 unsigned HOST_WIDE_INT
);
184 static void mark_weak (tree
);
186 enum in_section
{ no_section
, in_text
, in_data
, in_named
187 #ifdef BSS_SECTION_ASM_OP
190 #ifdef CTORS_SECTION_ASM_OP
193 #ifdef DTORS_SECTION_ASM_OP
196 #ifdef READONLY_DATA_SECTION_ASM_OP
199 #ifdef EXTRA_SECTIONS
203 static GTY(()) enum in_section in_section
= no_section
;
205 /* Return a nonzero value if DECL has a section attribute. */
206 #ifndef IN_NAMED_SECTION
207 #define IN_NAMED_SECTION(DECL) \
208 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
209 && DECL_SECTION_NAME (DECL) != NULL_TREE)
212 /* Text of section name when in_section == in_named. */
213 static GTY(()) const char *in_named_name
;
215 /* Hash table of flags that have been used for a particular named section. */
217 struct in_named_entry
GTY(())
224 static GTY((param_is (struct in_named_entry
))) htab_t in_named_htab
;
226 /* Define functions like text_section for any extra sections. */
227 #ifdef EXTRA_SECTION_FUNCTIONS
228 EXTRA_SECTION_FUNCTIONS
231 /* Tell assembler to switch to text section. */
236 if (in_section
!= in_text
)
238 in_section
= in_text
;
242 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
247 /* Tell assembler to switch to data section. */
252 if (in_section
!= in_data
)
254 in_section
= in_data
;
255 if (flag_shared_data
)
257 #ifdef SHARED_SECTION_ASM_OP
258 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
260 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
264 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
268 /* Tell assembler to switch to read-only data section. This is normally
272 readonly_data_section (void)
274 #ifdef READONLY_DATA_SECTION
275 READONLY_DATA_SECTION (); /* Note this can call data_section. */
277 #ifdef READONLY_DATA_SECTION_ASM_OP
278 if (in_section
!= in_readonly_data
)
280 in_section
= in_readonly_data
;
281 fputs (READONLY_DATA_SECTION_ASM_OP
, asm_out_file
);
282 fputc ('\n', asm_out_file
);
290 /* Determine if we're in the text section. */
293 in_text_section (void)
295 return in_section
== in_text
;
298 /* Determine if we're in the data section. */
301 in_data_section (void)
303 return in_section
== in_data
;
306 /* Helper routines for maintaining in_named_htab. */
309 in_named_entry_eq (const void *p1
, const void *p2
)
311 const struct in_named_entry
*old
= p1
;
312 const char *new = p2
;
314 return strcmp (old
->name
, new) == 0;
318 in_named_entry_hash (const void *p
)
320 const struct in_named_entry
*old
= p
;
321 return htab_hash_string (old
->name
);
324 /* If SECTION has been seen before as a named section, return the flags
325 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
326 set of flags for a section to have, so 0 does not mean that the section
327 has not been seen. */
330 get_named_section_flags (const char *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 (const char *name
)
348 struct in_named_entry
**slot
;
350 slot
= (struct in_named_entry
**)
351 htab_find_slot_with_hash (in_named_htab
, name
,
352 htab_hash_string (name
), NO_INSERT
);
353 if (! (*slot
)->declared
)
355 (*slot
)->declared
= true;
365 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
366 different set of flags, return false. */
369 set_named_section_flags (const char *section
, unsigned int flags
)
371 struct in_named_entry
**slot
, *entry
;
373 slot
= (struct in_named_entry
**)
374 htab_find_slot_with_hash (in_named_htab
, section
,
375 htab_hash_string (section
), INSERT
);
380 entry
= (struct in_named_entry
*) ggc_alloc (sizeof (*entry
));
382 entry
->name
= ggc_strdup (section
);
383 entry
->flags
= flags
;
384 entry
->declared
= false;
386 else if (entry
->flags
!= flags
)
392 /* Tell assembler to change to section NAME with attributes FLAGS. */
395 named_section_flags (const char *name
, unsigned int flags
)
397 if (in_section
!= in_named
|| strcmp (name
, in_named_name
) != 0)
399 if (! set_named_section_flags (name
, flags
))
402 (*targetm
.asm_out
.named_section
) (name
, flags
);
404 if (flags
& SECTION_FORGET
)
405 in_section
= no_section
;
408 in_named_name
= ggc_strdup (name
);
409 in_section
= in_named
;
414 /* Tell assembler to change to section NAME for DECL.
415 If DECL is NULL, just switch to section NAME.
416 If NAME is NULL, get the name from DECL.
417 If RELOC is 1, the initializer for DECL contains relocs. */
420 named_section (tree decl
, const char *name
, int reloc
)
424 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
427 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
429 flags
= (* targetm
.section_type_flags
) (decl
, name
, reloc
);
431 /* Sanity check user variables for flag changes. Non-user
432 section flag changes will abort in named_section_flags.
433 However, don't complain if SECTION_OVERRIDE is set.
434 We trust that the setter knows that it is safe to ignore
435 the default flags for this decl. */
436 if (decl
&& ! set_named_section_flags (name
, flags
))
438 flags
= get_named_section_flags (name
);
439 if ((flags
& SECTION_OVERRIDE
) == 0)
440 error_with_decl (decl
, "%s causes a section type conflict");
443 named_section_flags (name
, flags
);
446 /* If required, set DECL_SECTION_NAME to a unique name. */
449 resolve_unique_section (tree decl
, int reloc ATTRIBUTE_UNUSED
,
450 int flag_function_or_data_sections
)
452 if (DECL_SECTION_NAME (decl
) == NULL_TREE
453 && targetm
.have_named_sections
454 && (flag_function_or_data_sections
455 || DECL_ONE_ONLY (decl
)))
456 (*targetm
.asm_out
.unique_section
) (decl
, reloc
);
459 #ifdef BSS_SECTION_ASM_OP
461 /* Tell the assembler to switch to the bss section. */
466 if (in_section
!= in_bss
)
468 #ifdef SHARED_BSS_SECTION_ASM_OP
469 if (flag_shared_data
)
470 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
473 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
479 #ifdef ASM_OUTPUT_BSS
481 /* Utility function for ASM_OUTPUT_BSS for targets to use if
482 they don't support alignments in .bss.
483 ??? It is believed that this function will work in most cases so such
484 support is localized here. */
487 asm_output_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
489 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
490 unsigned HOST_WIDE_INT rounded
)
492 (*targetm
.asm_out
.globalize_label
) (file
, name
);
494 #ifdef ASM_DECLARE_OBJECT_NAME
495 last_assemble_variable_decl
= decl
;
496 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
498 /* Standard thing is just output label for the object. */
499 ASM_OUTPUT_LABEL (file
, name
);
500 #endif /* ASM_DECLARE_OBJECT_NAME */
501 ASM_OUTPUT_SKIP (file
, rounded
? rounded
: 1);
506 #ifdef ASM_OUTPUT_ALIGNED_BSS
508 /* Utility function for targets to use in implementing
509 ASM_OUTPUT_ALIGNED_BSS.
510 ??? It is believed that this function will work in most cases so such
511 support is localized here. */
514 asm_output_aligned_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
515 const char *name
, unsigned HOST_WIDE_INT size
,
519 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
520 #ifdef ASM_DECLARE_OBJECT_NAME
521 last_assemble_variable_decl
= decl
;
522 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
524 /* Standard thing is just output label for the object. */
525 ASM_OUTPUT_LABEL (file
, name
);
526 #endif /* ASM_DECLARE_OBJECT_NAME */
527 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
532 #endif /* BSS_SECTION_ASM_OP */
534 /* Switch to the section for function DECL.
536 If DECL is NULL_TREE, switch to the text section.
537 ??? It's not clear that we will ever be passed NULL_TREE, but it's
538 safer to handle it. */
541 function_section (tree decl
)
543 if (decl
!= NULL_TREE
544 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
545 named_section (decl
, (char *) 0, 0);
550 /* Switch to section for variable DECL. RELOC is the same as the
551 argument to SELECT_SECTION. */
554 variable_section (tree decl
, int reloc
)
556 if (IN_NAMED_SECTION (decl
))
557 named_section (decl
, NULL
, reloc
);
559 (*targetm
.asm_out
.select_section
) (decl
, reloc
, DECL_ALIGN (decl
));
562 /* Tell assembler to switch to the section for string merging. */
565 mergeable_string_section (tree decl ATTRIBUTE_UNUSED
,
566 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
567 unsigned int flags ATTRIBUTE_UNUSED
)
569 #ifdef HAVE_GAS_SHF_MERGE
570 if (flag_merge_constants
571 && TREE_CODE (decl
) == STRING_CST
572 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
574 && TREE_STRING_LENGTH (decl
) >= int_size_in_bytes (TREE_TYPE (decl
)))
576 enum machine_mode mode
;
577 unsigned int modesize
;
582 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (decl
)));
583 modesize
= GET_MODE_BITSIZE (mode
);
584 if (modesize
>= 8 && modesize
<= 256
585 && (modesize
& (modesize
- 1)) == 0)
587 if (align
< modesize
)
590 str
= TREE_STRING_POINTER (decl
);
591 len
= TREE_STRING_LENGTH (decl
);
592 unit
= GET_MODE_SIZE (mode
);
594 /* Check for embedded NUL characters. */
595 for (i
= 0; i
< len
; i
+= unit
)
597 for (j
= 0; j
< unit
; j
++)
598 if (str
[i
+ j
] != '\0')
605 sprintf (name
, ".rodata.str%d.%d", modesize
/ 8,
607 flags
|= (modesize
/ 8) | SECTION_MERGE
| SECTION_STRINGS
;
608 if (!i
&& modesize
< align
)
610 /* A "" string with requested alignment greater than
611 character size might cause a problem:
612 if some other string required even bigger
613 alignment than "", then linker might think the
614 "" is just part of padding after some other string
615 and not put it into the hash table initially.
616 But this means "" could have smaller alignment
618 #ifdef ASM_OUTPUT_SECTION_START
619 named_section_flags (name
, flags
);
620 ASM_OUTPUT_SECTION_START (asm_out_file
);
622 readonly_data_section ();
627 named_section_flags (name
, flags
);
633 readonly_data_section ();
636 /* Tell assembler to switch to the section for constant merging. */
639 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
640 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
641 unsigned int flags ATTRIBUTE_UNUSED
)
643 #ifdef HAVE_GAS_SHF_MERGE
644 unsigned int modesize
= GET_MODE_BITSIZE (mode
);
646 if (flag_merge_constants
652 && (align
& (align
- 1)) == 0)
656 sprintf (name
, ".rodata.cst%d", (int) (align
/ 8));
657 flags
|= (align
/ 8) | SECTION_MERGE
;
658 named_section_flags (name
, flags
);
662 readonly_data_section ();
665 /* Given NAME, a putative register name, discard any customary prefixes. */
668 strip_reg_name (const char *name
)
670 #ifdef REGISTER_PREFIX
671 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
672 name
+= strlen (REGISTER_PREFIX
);
674 if (name
[0] == '%' || name
[0] == '#')
679 /* Decode an `asm' spec for a declaration as a register name.
680 Return the register number, or -1 if nothing specified,
681 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
682 or -3 if ASMSPEC is `cc' and is not recognized,
683 or -4 if ASMSPEC is `memory' and is not recognized.
684 Accept an exact spelling or a decimal number.
685 Prefixes such as % are optional. */
688 decode_reg_name (const char *asmspec
)
694 /* Get rid of confusing prefixes. */
695 asmspec
= strip_reg_name (asmspec
);
697 /* Allow a decimal number as a "register name". */
698 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
699 if (! ISDIGIT (asmspec
[i
]))
701 if (asmspec
[0] != 0 && i
< 0)
704 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
710 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
712 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
715 #ifdef ADDITIONAL_REGISTER_NAMES
717 static const struct { const char *const name
; const int number
; } table
[]
718 = ADDITIONAL_REGISTER_NAMES
;
720 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
721 if (! strcmp (asmspec
, table
[i
].name
))
722 return table
[i
].number
;
724 #endif /* ADDITIONAL_REGISTER_NAMES */
726 if (!strcmp (asmspec
, "memory"))
729 if (!strcmp (asmspec
, "cc"))
738 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
739 have static storage duration. In other words, it should not be an
740 automatic variable, including PARM_DECLs.
742 There is, however, one exception: this function handles variables
743 explicitly placed in a particular register by the user.
745 ASMSPEC, if not 0, is the string which the user specified as the
746 assembler symbol name.
748 This is never called for PARM_DECL nodes. */
751 make_decl_rtl (tree decl
, const char *asmspec
)
753 int top_level
= (DECL_CONTEXT (decl
) == NULL_TREE
);
754 const char *name
= 0;
755 const char *new_name
= 0;
759 /* Check that we are not being given an automatic variable. */
760 /* A weak alias has TREE_PUBLIC set but not the other bits. */
761 if (TREE_CODE (decl
) == PARM_DECL
762 || TREE_CODE (decl
) == RESULT_DECL
763 || (TREE_CODE (decl
) == VAR_DECL
764 && !TREE_STATIC (decl
)
765 && !TREE_PUBLIC (decl
)
766 && !DECL_EXTERNAL (decl
)
767 && !DECL_REGISTER (decl
)))
769 /* And that we were not given a type or a label. */
770 else if (TREE_CODE (decl
) == TYPE_DECL
771 || TREE_CODE (decl
) == LABEL_DECL
)
774 /* For a duplicate declaration, we can be called twice on the
775 same DECL node. Don't discard the RTL already made. */
776 if (DECL_RTL_SET_P (decl
))
778 /* If the old RTL had the wrong mode, fix the mode. */
779 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
780 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
781 DECL_MODE (decl
), 0));
783 /* ??? Another way to do this would be to maintain a hashed
784 table of such critters. Instead of adding stuff to a DECL
785 to give certain attributes to it, we could use an external
786 hash map from DECL to set of attributes. */
788 /* Let the target reassign the RTL if it wants.
789 This is necessary, for example, when one machine specific
790 decl attribute overrides another. */
791 (* targetm
.encode_section_info
) (decl
, DECL_RTL (decl
), false);
795 new_name
= name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
797 reg_number
= decode_reg_name (asmspec
);
798 if (reg_number
== -2)
800 /* ASMSPEC is given, and not the name of a register. Mark the
801 name with a star so assemble_name won't munge it. */
802 char *starred
= alloca (strlen (asmspec
) + 2);
804 strcpy (starred
+ 1, asmspec
);
808 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
810 /* First detect errors in declaring global registers. */
811 if (reg_number
== -1)
812 error_with_decl (decl
, "register name not specified for `%s'");
813 else if (reg_number
< 0)
814 error_with_decl (decl
, "invalid register name for `%s'");
815 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
816 error_with_decl (decl
,
817 "data type of `%s' isn't suitable for a register");
818 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
819 error_with_decl (decl
,
820 "register specified for `%s' isn't suitable for data type");
821 /* Now handle properly declared static register variables. */
826 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
828 DECL_INITIAL (decl
) = 0;
829 error ("global register variable has initial value");
831 if (TREE_THIS_VOLATILE (decl
))
832 warning ("volatile register variables don't work as you might wish");
834 /* If the user specified one of the eliminables registers here,
835 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
836 confused with that register and be eliminated. This usage is
837 somewhat suspect... */
839 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
840 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
841 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
843 if (TREE_STATIC (decl
))
845 /* Make this register global, so not usable for anything
847 #ifdef ASM_DECLARE_REGISTER_GLOBAL
848 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
850 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
852 globalize_reg (reg_number
+ --nregs
);
855 /* As a register variable, it has no section. */
860 /* Now handle ordinary static variables and functions (in memory).
861 Also handle vars declared register invalidly. */
863 if (reg_number
>= 0 || reg_number
== -3)
864 error_with_decl (decl
,
865 "register name given for non-register variable `%s'");
867 /* Specifying a section attribute on a variable forces it into a
868 non-.bss section, and thus it cannot be common. */
869 if (TREE_CODE (decl
) == VAR_DECL
870 && DECL_SECTION_NAME (decl
) != NULL_TREE
871 && DECL_INITIAL (decl
) == NULL_TREE
872 && DECL_COMMON (decl
))
873 DECL_COMMON (decl
) = 0;
875 /* Variables can't be both common and weak. */
876 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
877 DECL_COMMON (decl
) = 0;
879 /* Can't use just the variable's own name for a variable
880 whose scope is less than the whole file, unless it's a member
881 of a local class (which will already be unambiguous).
882 Concatenate a distinguishing number. */
883 if (!top_level
&& !TREE_PUBLIC (decl
)
884 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
886 && name
== IDENTIFIER_POINTER (DECL_NAME (decl
)))
890 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
895 if (name
!= new_name
)
897 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (new_name
));
898 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
901 x
= gen_rtx_SYMBOL_REF (Pmode
, name
);
902 SYMBOL_REF_WEAK (x
) = DECL_WEAK (decl
);
903 SYMBOL_REF_DECL (x
) = decl
;
905 x
= gen_rtx_MEM (DECL_MODE (decl
), x
);
906 if (TREE_CODE (decl
) != FUNCTION_DECL
)
907 set_mem_attributes (x
, decl
, 1);
908 SET_DECL_RTL (decl
, x
);
910 /* Optionally set flags or add text to the name to record information
911 such as that it is a function name.
912 If the name is changed, the macro ASM_OUTPUT_LABELREF
913 will have to know how to strip this information. */
914 (* targetm
.encode_section_info
) (decl
, DECL_RTL (decl
), true);
917 /* Make the rtl for variable VAR be volatile.
918 Use this only for static variables. */
921 make_var_volatile (tree var
)
923 if (GET_CODE (DECL_RTL (var
)) != MEM
)
926 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
929 /* Output a string of literal assembler code
930 for an `asm' keyword used between functions. */
933 assemble_asm (tree string
)
937 if (TREE_CODE (string
) == ADDR_EXPR
)
938 string
= TREE_OPERAND (string
, 0);
940 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
943 /* Record an element in the table of global destructors. SYMBOL is
944 a SYMBOL_REF of the function to be called; PRIORITY is a number
945 between 0 and MAX_INIT_PRIORITY. */
948 default_stabs_asm_out_destructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
950 /* Tell GNU LD that this is part of the static destructor set.
951 This will work for any system that uses stabs, most usefully
953 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
954 assemble_name (asm_out_file
, XSTR (symbol
, 0));
955 fputc ('\n', asm_out_file
);
959 default_named_section_asm_out_destructor (rtx symbol
, int priority
)
961 const char *section
= ".dtors";
964 /* ??? This only works reliably with the GNU linker. */
965 if (priority
!= DEFAULT_INIT_PRIORITY
)
967 sprintf (buf
, ".dtors.%.5u",
968 /* Invert the numbering so the linker puts us in the proper
969 order; constructors are run from right to left, and the
970 linker sorts in increasing order. */
971 MAX_INIT_PRIORITY
- priority
);
975 named_section_flags (section
, SECTION_WRITE
);
976 assemble_align (POINTER_SIZE
);
977 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
980 #ifdef DTORS_SECTION_ASM_OP
984 if (in_section
!= in_dtors
)
986 in_section
= in_dtors
;
987 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
988 fputc ('\n', asm_out_file
);
993 default_dtor_section_asm_out_destructor (rtx symbol
,
994 int priority ATTRIBUTE_UNUSED
)
997 assemble_align (POINTER_SIZE
);
998 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1002 /* Likewise for global constructors. */
1005 default_stabs_asm_out_constructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
1007 /* Tell GNU LD that this is part of the static destructor set.
1008 This will work for any system that uses stabs, most usefully
1010 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
1011 assemble_name (asm_out_file
, XSTR (symbol
, 0));
1012 fputc ('\n', asm_out_file
);
1016 default_named_section_asm_out_constructor (rtx symbol
, int priority
)
1018 const char *section
= ".ctors";
1021 /* ??? This only works reliably with the GNU linker. */
1022 if (priority
!= DEFAULT_INIT_PRIORITY
)
1024 sprintf (buf
, ".ctors.%.5u",
1025 /* Invert the numbering so the linker puts us in the proper
1026 order; constructors are run from right to left, and the
1027 linker sorts in increasing order. */
1028 MAX_INIT_PRIORITY
- priority
);
1032 named_section_flags (section
, SECTION_WRITE
);
1033 assemble_align (POINTER_SIZE
);
1034 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1037 #ifdef CTORS_SECTION_ASM_OP
1039 ctors_section (void)
1041 if (in_section
!= in_ctors
)
1043 in_section
= in_ctors
;
1044 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1045 fputc ('\n', asm_out_file
);
1050 default_ctor_section_asm_out_constructor (rtx symbol
,
1051 int priority ATTRIBUTE_UNUSED
)
1054 assemble_align (POINTER_SIZE
);
1055 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1059 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1060 a nonzero value if the constant pool should be output before the
1061 start of the function, or a zero value if the pool should output
1062 after the end of the function. The default is to put it before the
1065 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1066 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1069 /* Output assembler code for the constant pool of a function and associated
1070 with defining the name of the function. DECL describes the function.
1071 NAME is the function's name. For the constant pool, we use the current
1072 constant pool data. */
1075 assemble_start_function (tree decl
, const char *fnname
)
1079 /* The following code does not need preprocessing in the assembler. */
1083 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1084 output_constant_pool (fnname
, decl
);
1086 resolve_unique_section (decl
, 0, flag_function_sections
);
1087 function_section (decl
);
1089 /* Tell assembler to move to target machine's alignment for functions. */
1090 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1091 if (align
< force_align_functions_log
)
1092 align
= force_align_functions_log
;
1095 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1098 /* Handle a user-specified function alignment.
1099 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1100 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1101 if (align_functions_log
> align
1102 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1104 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1105 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1106 align_functions_log
, align_functions
- 1);
1108 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1112 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1113 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1116 (*debug_hooks
->begin_function
) (decl
);
1118 /* Make function name accessible from other files, if appropriate. */
1120 if (TREE_PUBLIC (decl
))
1122 if (! first_global_object_name
)
1127 p
= (* targetm
.strip_name_encoding
) (fnname
);
1130 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1131 first_global_object_name
= name
;
1133 weak_global_object_name
= name
;
1136 globalize_decl (decl
);
1138 maybe_assemble_visibility (decl
);
1141 /* Do any machine/system dependent processing of the function name */
1142 #ifdef ASM_DECLARE_FUNCTION_NAME
1143 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1145 /* Standard thing is just output label for the function. */
1146 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1147 #endif /* ASM_DECLARE_FUNCTION_NAME */
1150 /* Output assembler code associated with defining the size of the
1151 function. DECL describes the function. NAME is the function's name. */
1154 assemble_end_function (tree decl
, const char *fnname
)
1156 #ifdef ASM_DECLARE_FUNCTION_SIZE
1157 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1159 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1161 output_constant_pool (fnname
, decl
);
1162 function_section (decl
); /* need to switch back */
1166 /* Assemble code to leave SIZE bytes of zeros. */
1169 assemble_zeros (unsigned HOST_WIDE_INT size
)
1171 /* Do no output if -fsyntax-only. */
1172 if (flag_syntax_only
)
1175 #ifdef ASM_NO_SKIP_IN_TEXT
1176 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1177 so we must output 0s explicitly in the text section. */
1178 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1180 unsigned HOST_WIDE_INT i
;
1181 for (i
= 0; i
< size
; i
++)
1182 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1187 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1190 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1193 assemble_align (int align
)
1195 if (align
> BITS_PER_UNIT
)
1197 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1201 /* Assemble a string constant with the specified C string as contents. */
1204 assemble_string (const char *p
, int size
)
1209 /* If the string is very long, split it up. */
1213 int thissize
= size
- pos
;
1214 if (thissize
> maximum
)
1217 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1225 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1226 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1227 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1229 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1230 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1231 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1233 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1234 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1238 #if defined ASM_OUTPUT_ALIGNED_BSS
1239 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1240 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1242 #if defined ASM_OUTPUT_BSS
1243 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1244 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1250 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1251 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1252 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1254 #if defined ASM_OUTPUT_ALIGNED_COMMON
1255 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1256 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1258 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1259 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1264 asm_emit_uninitialised (tree decl
, const char *name
,
1265 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
1266 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
)
1274 destination
= asm_dest_local
;
1276 /* ??? We should handle .bss via select_section mechanisms rather than
1277 via special target hooks. That would eliminate this special case. */
1278 if (TREE_PUBLIC (decl
))
1280 if (!DECL_COMMON (decl
))
1282 destination
= asm_dest_bss
;
1287 destination
= asm_dest_common
;
1290 if (destination
== asm_dest_bss
)
1291 globalize_decl (decl
);
1292 resolve_unique_section (decl
, 0, flag_data_sections
);
1294 if (flag_shared_data
)
1296 switch (destination
)
1298 #ifdef ASM_OUTPUT_SHARED_BSS
1300 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1303 #ifdef ASM_OUTPUT_SHARED_COMMON
1304 case asm_dest_common
:
1305 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1308 #ifdef ASM_OUTPUT_SHARED_LOCAL
1309 case asm_dest_local
:
1310 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1318 switch (destination
)
1322 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1325 case asm_dest_common
:
1326 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1328 case asm_dest_local
:
1329 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1338 /* Assemble everything that is needed for a variable or function declaration.
1339 Not used for automatic variables, and not used for function definitions.
1340 Should not be called for variables of incomplete structure type.
1342 TOP_LEVEL is nonzero if this variable has file scope.
1343 AT_END is nonzero if this is the special handling, at end of compilation,
1344 to define things that have had only tentative definitions.
1345 DONT_OUTPUT_DATA if nonzero means don't actually output the
1346 initial value (that will be done by the caller). */
1349 assemble_variable (tree decl
, int top_level ATTRIBUTE_UNUSED
,
1350 int at_end ATTRIBUTE_UNUSED
, int dont_output_data
)
1357 if (lang_hooks
.decls
.prepare_assemble_variable
)
1358 (*lang_hooks
.decls
.prepare_assemble_variable
) (decl
);
1360 last_assemble_variable_decl
= 0;
1362 /* Normally no need to say anything here for external references,
1363 since assemble_external is called by the language-specific code
1364 when a declaration is first seen. */
1366 if (DECL_EXTERNAL (decl
))
1369 /* Output no assembler code for a function declaration.
1370 Only definitions of functions output anything. */
1372 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1375 /* Do nothing for global register variables. */
1376 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1378 TREE_ASM_WRITTEN (decl
) = 1;
1382 /* If type was incomplete when the variable was declared,
1383 see if it is complete now. */
1385 if (DECL_SIZE (decl
) == 0)
1386 layout_decl (decl
, 0);
1388 /* Still incomplete => don't allocate it; treat the tentative defn
1389 (which is what it must have been) as an `extern' reference. */
1391 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1393 error ("%Hstorage size of `%s' isn't known",
1394 &DECL_SOURCE_LOCATION (decl
),
1395 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1396 TREE_ASM_WRITTEN (decl
) = 1;
1400 /* The first declaration of a variable that comes through this function
1401 decides whether it is global (in C, has external linkage)
1402 or local (in C, has internal linkage). So do nothing more
1403 if this function has already run. */
1405 if (TREE_ASM_WRITTEN (decl
))
1408 /* Make sure targetm.encode_section_info is invoked before we set
1410 decl_rtl
= DECL_RTL (decl
);
1412 TREE_ASM_WRITTEN (decl
) = 1;
1414 /* Do no output if -fsyntax-only. */
1415 if (flag_syntax_only
)
1420 if (! dont_output_data
1421 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1423 error_with_decl (decl
, "size of variable `%s' is too large");
1427 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1428 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1429 && ! first_global_object_name
1430 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1431 || DECL_INITIAL (decl
) == error_mark_node
))
1432 && ! DECL_WEAK (decl
)
1433 && ! DECL_ONE_ONLY (decl
))
1438 p
= (* targetm
.strip_name_encoding
) (name
);
1439 xname
= xstrdup (p
);
1440 first_global_object_name
= xname
;
1443 /* Compute the alignment of this data. */
1445 align
= DECL_ALIGN (decl
);
1447 /* In the case for initialing an array whose length isn't specified,
1448 where we have not yet been able to do the layout,
1449 figure out the proper alignment now. */
1450 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1451 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1452 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1454 /* Some object file formats have a maximum alignment which they support.
1455 In particular, a.out format supports a maximum alignment of 4. */
1456 #ifndef MAX_OFILE_ALIGNMENT
1457 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1459 if (align
> MAX_OFILE_ALIGNMENT
)
1461 warning_with_decl (decl
,
1462 "alignment of `%s' is greater than maximum object file alignment. Using %d",
1463 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1464 align
= MAX_OFILE_ALIGNMENT
;
1467 /* On some machines, it is good to increase alignment sometimes. */
1468 if (! DECL_USER_ALIGN (decl
))
1470 #ifdef DATA_ALIGNMENT
1471 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1473 #ifdef CONSTANT_ALIGNMENT
1474 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1475 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1479 /* Reset the alignment in case we have made it tighter, so we can benefit
1480 from it in get_pointer_alignment. */
1481 DECL_ALIGN (decl
) = align
;
1482 set_mem_align (decl_rtl
, align
);
1484 if (TREE_PUBLIC (decl
))
1485 maybe_assemble_visibility (decl
);
1487 /* Output any data that we will need to use the address of. */
1488 if (DECL_INITIAL (decl
) == error_mark_node
)
1489 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1490 else if (DECL_INITIAL (decl
))
1491 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1492 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1494 /* Handle uninitialized definitions. */
1496 /* If the decl has been given an explicit section name, then it
1497 isn't common, and shouldn't be handled as such. */
1498 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1500 /* We don't implement common thread-local data at present. */
1501 else if (DECL_THREAD_LOCAL (decl
))
1503 if (DECL_COMMON (decl
))
1504 sorry ("thread-local COMMON data not implemented");
1506 else if (DECL_INITIAL (decl
) == 0
1507 || DECL_INITIAL (decl
) == error_mark_node
1508 || (flag_zero_initialized_in_bss
1509 /* Leave constant zeroes in .rodata so they can be shared. */
1510 && !TREE_READONLY (decl
)
1511 && initializer_zerop (DECL_INITIAL (decl
))))
1513 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1514 unsigned HOST_WIDE_INT rounded
= size
;
1516 /* Don't allocate zero bytes of common,
1517 since that means "undefined external" in the linker. */
1521 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1522 so that each uninitialized object starts on such a boundary. */
1523 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1524 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1525 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1527 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1528 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1530 (decl
, "requested alignment for %s is greater than implemented alignment of %d",rounded
);
1533 /* If the target cannot output uninitialized but not common global data
1534 in .bss, then we have to use .data, so fall through. */
1535 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1539 /* Handle initialized definitions.
1540 Also handle uninitialized global definitions if -fno-common and the
1541 target doesn't support ASM_OUTPUT_BSS. */
1543 /* First make the assembler name(s) global if appropriate. */
1544 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1545 globalize_decl (decl
);
1547 /* Switch to the appropriate section. */
1548 variable_section (decl
, reloc
);
1550 /* dbxout.c needs to know this. */
1551 if (in_text_section ())
1552 DECL_IN_TEXT_SECTION (decl
) = 1;
1554 /* Output the alignment of this data. */
1555 if (align
> BITS_PER_UNIT
)
1557 ASM_OUTPUT_ALIGN (asm_out_file
,
1558 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1561 /* Do any machine/system dependent processing of the object. */
1562 #ifdef ASM_DECLARE_OBJECT_NAME
1563 last_assemble_variable_decl
= decl
;
1564 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1566 /* Standard thing is just output label for the object. */
1567 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1568 #endif /* ASM_DECLARE_OBJECT_NAME */
1570 if (!dont_output_data
)
1572 if (DECL_INITIAL (decl
) && DECL_INITIAL (decl
) != error_mark_node
)
1573 /* Output the actual data. */
1574 output_constant (DECL_INITIAL (decl
),
1575 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1578 /* Leave space for it. */
1579 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1583 /* Return 1 if type TYPE contains any pointers. */
1586 contains_pointers_p (tree type
)
1588 switch (TREE_CODE (type
))
1591 case REFERENCE_TYPE
:
1592 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1593 so I'll play safe and return 1. */
1599 case QUAL_UNION_TYPE
:
1602 /* For a type that has fields, see if the fields have pointers. */
1603 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1604 if (TREE_CODE (fields
) == FIELD_DECL
1605 && contains_pointers_p (TREE_TYPE (fields
)))
1611 /* An array type contains pointers if its element type does. */
1612 return contains_pointers_p (TREE_TYPE (type
));
1619 /* Output something to declare an external symbol to the assembler.
1620 (Most assemblers don't need this, so we normally output nothing.)
1621 Do nothing if DECL is not external. */
1624 assemble_external (tree decl ATTRIBUTE_UNUSED
)
1626 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1627 main body of this code is only rarely exercised. To provide some
1628 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1629 open. If it's not, we should not be calling this function. */
1633 #ifdef ASM_OUTPUT_EXTERNAL
1634 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1636 rtx rtl
= DECL_RTL (decl
);
1638 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1639 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1641 /* Some systems do require some output. */
1642 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1643 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1649 /* Similar, for calling a library function FUN. */
1652 assemble_external_libcall (rtx fun ATTRIBUTE_UNUSED
)
1654 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1655 /* Declare library function name external when first used, if nec. */
1656 if (! SYMBOL_REF_USED (fun
))
1658 SYMBOL_REF_USED (fun
) = 1;
1659 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1664 /* Assemble a label named NAME. */
1667 assemble_label (const char *name
)
1669 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1672 /* Set the symbol_referenced flag for ID and notify callgraph code. */
1674 mark_referenced (tree id
)
1676 if (!TREE_SYMBOL_REFERENCED (id
))
1678 struct cgraph_node
*node
;
1679 struct cgraph_varpool_node
*vnode
;
1681 if (!cgraph_global_info_ready
)
1683 node
= cgraph_node_for_identifier (id
);
1685 cgraph_mark_needed_node (node
, 1);
1688 vnode
= cgraph_varpool_node_for_identifier (id
);
1690 cgraph_varpool_mark_needed_node (vnode
);
1692 TREE_SYMBOL_REFERENCED (id
) = 1;
1695 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1696 If NAME starts with a *, the rest of NAME is output verbatim.
1697 Otherwise NAME is transformed in an implementation-defined way
1698 (usually by the addition of an underscore).
1699 Many macros in the tm file are defined to call this function. */
1702 assemble_name (FILE *file
, const char *name
)
1704 const char *real_name
;
1707 real_name
= (* targetm
.strip_name_encoding
) (name
);
1709 id
= maybe_get_identifier (real_name
);
1711 mark_referenced (id
);
1714 fputs (&name
[1], file
);
1716 ASM_OUTPUT_LABELREF (file
, name
);
1719 /* Allocate SIZE bytes writable static space with a gensym name
1720 and return an RTX to refer to its address. */
1723 assemble_static_space (unsigned HOST_WIDE_INT size
)
1726 const char *namestring
;
1730 if (flag_shared_data
)
1734 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1736 namestring
= ggc_strdup (name
);
1738 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1739 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
1741 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1742 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1745 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1746 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1749 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1750 so that each uninitialized object starts on such a boundary. */
1751 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1752 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1753 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1754 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1755 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1756 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1763 /* Assemble the static constant template for function entry trampolines.
1764 This is done at most once per compilation.
1765 Returns an RTX for the address of the template. */
1767 #ifdef TRAMPOLINE_TEMPLATE
1769 assemble_trampoline_template (void)
1776 /* By default, put trampoline templates in read-only data section. */
1778 #ifdef TRAMPOLINE_SECTION
1779 TRAMPOLINE_SECTION ();
1781 readonly_data_section ();
1784 /* Write the assembler code to define one. */
1785 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1788 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1791 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LTRAMP", 0);
1792 TRAMPOLINE_TEMPLATE (asm_out_file
);
1794 /* Record the rtl to refer to it. */
1795 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1796 name
= ggc_strdup (label
);
1797 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
1798 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
1804 /* A and B are either alignments or offsets. Return the minimum alignment
1805 that may be assumed after adding the two together. */
1807 static inline unsigned
1808 min_align (unsigned int a
, unsigned int b
)
1810 return (a
| b
) & -(a
| b
);
1813 /* Return the assembler directive for creating a given kind of integer
1814 object. SIZE is the number of bytes in the object and ALIGNED_P
1815 indicates whether it is known to be aligned. Return NULL if the
1816 assembly dialect has no such directive.
1818 The returned string should be printed at the start of a new line and
1819 be followed immediately by the object's initial value. */
1822 integer_asm_op (int size
, int aligned_p
)
1824 struct asm_int_op
*ops
;
1827 ops
= &targetm
.asm_out
.aligned_op
;
1829 ops
= &targetm
.asm_out
.unaligned_op
;
1834 return targetm
.asm_out
.byte_op
;
1848 /* Use directive OP to assemble an integer object X. Print OP at the
1849 start of the line, followed immediately by the value of X. */
1852 assemble_integer_with_op (const char *op
, rtx x
)
1854 fputs (op
, asm_out_file
);
1855 output_addr_const (asm_out_file
, x
);
1856 fputc ('\n', asm_out_file
);
1859 /* The default implementation of the asm_out.integer target hook. */
1862 default_assemble_integer (rtx x ATTRIBUTE_UNUSED
,
1863 unsigned int size ATTRIBUTE_UNUSED
,
1864 int aligned_p ATTRIBUTE_UNUSED
)
1866 const char *op
= integer_asm_op (size
, aligned_p
);
1867 return op
&& (assemble_integer_with_op (op
, x
), true);
1870 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1871 the alignment of the integer in bits. Return 1 if we were able to output
1872 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1876 assemble_integer (rtx x
, unsigned int size
, unsigned int align
, int force
)
1880 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
1882 /* See if the target hook can handle this kind of object. */
1883 if ((*targetm
.asm_out
.integer
) (x
, size
, aligned_p
))
1886 /* If the object is a multi-byte one, try splitting it up. Split
1887 it into words it if is multi-word, otherwise split it into bytes. */
1890 enum machine_mode omode
, imode
;
1891 unsigned int subalign
;
1892 unsigned int subsize
, i
;
1894 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
1895 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
1896 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
1897 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1899 for (i
= 0; i
< size
; i
+= subsize
)
1901 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
1902 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
1908 /* If we've printed some of it, but not all of it, there's no going
1921 assemble_real (REAL_VALUE_TYPE d
, enum machine_mode mode
, unsigned int align
)
1925 unsigned int nalign
= min_align (align
, 32);
1927 switch (BITS_PER_UNIT
)
1933 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1934 assemble_integer (GEN_INT (l
), 4, align
, 1);
1937 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1938 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1939 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1942 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
1943 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1944 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1945 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
1948 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
1949 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1950 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1951 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
1952 assemble_integer (GEN_INT (data
[3]), 4, nalign
, 1);
1963 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1964 assemble_integer (GEN_INT (l
), 2, align
, 1);
1967 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1968 assemble_integer (GEN_INT (data
[0]), 2, align
, 1);
1969 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
1980 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1981 assemble_integer (GEN_INT (l
), 1, align
, 1);
1984 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1985 assemble_integer (GEN_INT (data
[0]), 1, align
, 1);
1986 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
1998 /* Given an expression EXP with a constant value,
1999 reduce it to the sum of an assembler symbol and an integer.
2000 Store them both in the structure *VALUE.
2001 Abort if EXP does not reduce. */
2003 struct addr_const
GTY(())
2006 HOST_WIDE_INT offset
;
2010 decode_addr_const (tree exp
, struct addr_const
*value
)
2012 tree target
= TREE_OPERAND (exp
, 0);
2018 if (TREE_CODE (target
) == COMPONENT_REF
2019 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2022 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2023 target
= TREE_OPERAND (target
, 0);
2025 else if (TREE_CODE (target
) == ARRAY_REF
2026 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2028 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2029 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2030 target
= TREE_OPERAND (target
, 0);
2036 switch (TREE_CODE (target
))
2040 x
= DECL_RTL (target
);
2044 x
= gen_rtx_MEM (FUNCTION_MODE
,
2045 gen_rtx_LABEL_REF (VOIDmode
, force_label_rtx (target
)));
2053 x
= output_constant_def (target
, 1);
2060 if (GET_CODE (x
) != MEM
)
2065 value
->offset
= offset
;
2068 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2069 enum kind
{ RTX_UNKNOWN
, RTX_DOUBLE
, RTX_VECTOR
, RTX_INT
, RTX_UNSPEC
};
2070 struct rtx_const
GTY(())
2072 ENUM_BITFIELD(kind
) kind
: 16;
2073 ENUM_BITFIELD(machine_mode
) mode
: 16;
2074 union rtx_const_un
{
2075 REAL_VALUE_TYPE
GTY ((tag ("4"))) du
;
2076 struct rtx_const_u_addr
{
2079 HOST_WIDE_INT offset
;
2080 } GTY ((tag ("1"))) addr
;
2081 struct rtx_const_u_di
{
2084 } GTY ((tag ("0"))) di
;
2086 /* The max vector size we have is 16 wide; two variants for
2087 integral and floating point vectors. */
2088 struct rtx_const_int_vec
{
2091 } GTY ((tag ("2"))) int_vec
[16];
2093 REAL_VALUE_TYPE
GTY ((tag ("3"))) fp_vec
[8];
2095 } GTY ((desc ("%1.kind >= RTX_INT"), descbits ("1"))) un
;
2098 /* Uniquize all constants that appear in memory.
2099 Each constant in memory thus far output is recorded
2100 in `const_hash_table'. */
2102 struct constant_descriptor_tree
GTY(())
2104 /* A MEM for the constant. */
2107 /* The value of the constant. */
2111 static GTY((param_is (struct constant_descriptor_tree
)))
2112 htab_t const_desc_htab
;
2114 static struct constant_descriptor_tree
* build_constant_desc (tree
);
2115 static void maybe_output_constant_def_contents (struct constant_descriptor_tree
*, int);
2117 /* Compute a hash code for a constant expression. */
2120 const_desc_hash (const void *ptr
)
2122 return const_hash_1 (((struct constant_descriptor_tree
*)ptr
)->value
);
2126 const_hash_1 (const tree exp
)
2131 enum tree_code code
= TREE_CODE (exp
);
2133 /* Either set P and LEN to the address and len of something to hash and
2134 exit the switch or return a value. */
2139 p
= (char *) &TREE_INT_CST (exp
);
2140 len
= sizeof TREE_INT_CST (exp
);
2144 return real_hash (TREE_REAL_CST_PTR (exp
));
2147 p
= TREE_STRING_POINTER (exp
);
2148 len
= TREE_STRING_LENGTH (exp
);
2151 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2152 + const_hash_1 (TREE_IMAGPART (exp
)));
2155 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2159 len
= int_size_in_bytes (TREE_TYPE (exp
));
2160 tmp
= (char *) alloca (len
);
2161 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2169 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2171 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2172 if (TREE_VALUE (link
))
2173 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2181 struct addr_const value
;
2183 decode_addr_const (exp
, &value
);
2184 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2186 /* Don't hash the address of the SYMBOL_REF;
2187 only use the offset and the symbol name. */
2189 p
= XSTR (value
.base
, 0);
2190 for (i
= 0; p
[i
] != 0; i
++)
2191 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2193 else if (GET_CODE (value
.base
) == LABEL_REF
)
2194 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2202 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2203 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2207 case NON_LVALUE_EXPR
:
2208 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2211 /* A language specific constant. Just hash the code. */
2215 /* Compute hashing function. */
2217 for (i
= 0; i
< len
; i
++)
2218 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2223 /* Wrapper of compare_constant, for the htab interface. */
2225 const_desc_eq (const void *p1
, const void *p2
)
2227 return compare_constant (((struct constant_descriptor_tree
*)p1
)->value
,
2228 ((struct constant_descriptor_tree
*)p2
)->value
);
2231 /* Compare t1 and t2, and return 1 only if they are known to result in
2232 the same bit pattern on output. */
2235 compare_constant (const tree t1
, const tree t2
)
2237 enum tree_code typecode
;
2239 if (t1
== NULL_TREE
)
2240 return t2
== NULL_TREE
;
2241 if (t2
== NULL_TREE
)
2244 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2247 switch (TREE_CODE (t1
))
2250 /* Integer constants are the same only if the same width of type. */
2251 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2253 return tree_int_cst_equal (t1
, t2
);
2256 /* Real constants are the same only if the same width of type. */
2257 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2260 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2263 if (flag_writable_strings
)
2266 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2269 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2270 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2271 TREE_STRING_LENGTH (t1
)));
2274 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2275 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2278 typecode
= TREE_CODE (TREE_TYPE (t1
));
2279 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2282 if (typecode
== SET_TYPE
)
2284 int len
= int_size_in_bytes (TREE_TYPE (t2
));
2285 unsigned char *tmp1
, *tmp2
;
2287 if (int_size_in_bytes (TREE_TYPE (t1
)) != len
)
2290 tmp1
= (unsigned char *) alloca (len
);
2291 tmp2
= (unsigned char *) alloca (len
);
2293 if (get_set_constructor_bytes (t1
, tmp1
, len
) != NULL_TREE
)
2295 if (get_set_constructor_bytes (t2
, tmp2
, len
) != NULL_TREE
)
2298 return memcmp (tmp1
, tmp2
, len
) != 0;
2304 if (typecode
== ARRAY_TYPE
)
2306 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2307 /* For arrays, check that the sizes all match. */
2308 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2310 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2315 /* For record and union constructors, require exact type
2317 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2321 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2323 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2325 /* Check that each value is the same... */
2326 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2328 /* ... and that they apply to the same fields! */
2329 if (typecode
== ARRAY_TYPE
)
2331 if (! compare_constant (TREE_PURPOSE (l1
),
2337 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2342 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2348 struct addr_const value1
, value2
;
2350 decode_addr_const (t1
, &value1
);
2351 decode_addr_const (t2
, &value2
);
2352 return (value1
.offset
== value2
.offset
2353 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2359 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2360 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2364 case NON_LVALUE_EXPR
:
2365 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2370 nt1
= (*lang_hooks
.expand_constant
) (t1
);
2371 nt2
= (*lang_hooks
.expand_constant
) (t2
);
2372 if (nt1
!= t1
|| nt2
!= t2
)
2373 return compare_constant (nt1
, nt2
);
2379 /* Should not get here. */
2383 /* Make a copy of the whole tree structure for a constant. This
2384 handles the same types of nodes that compare_constant handles. */
2387 copy_constant (tree exp
)
2389 switch (TREE_CODE (exp
))
2392 /* For ADDR_EXPR, we do not want to copy the decl whose address
2393 is requested. We do want to copy constants though. */
2394 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2395 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2396 copy_constant (TREE_OPERAND (exp
, 0)));
2398 return copy_node (exp
);
2403 return copy_node (exp
);
2406 return build_complex (TREE_TYPE (exp
),
2407 copy_constant (TREE_REALPART (exp
)),
2408 copy_constant (TREE_IMAGPART (exp
)));
2412 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2413 copy_constant (TREE_OPERAND (exp
, 0)),
2414 copy_constant (TREE_OPERAND (exp
, 1)));
2418 case NON_LVALUE_EXPR
:
2419 case VIEW_CONVERT_EXPR
:
2420 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2421 copy_constant (TREE_OPERAND (exp
, 0)));
2425 tree copy
= copy_node (exp
);
2426 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2429 CONSTRUCTOR_ELTS (copy
) = list
;
2430 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2431 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2432 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2433 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2434 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2442 t
= (*lang_hooks
.expand_constant
) (exp
);
2444 return copy_constant (t
);
2451 /* Subroutine of output_constant_def:
2452 No constant equal to EXP is known to have been output.
2453 Make a constant descriptor to enter EXP in the hash table.
2454 Assign the label number and construct RTL to refer to the
2455 constant's location in memory.
2456 Caller is responsible for updating the hash table. */
2458 static struct constant_descriptor_tree
*
2459 build_constant_desc (tree exp
)
2465 struct constant_descriptor_tree
*desc
;
2467 desc
= ggc_alloc (sizeof (*desc
));
2468 desc
->value
= copy_constant (exp
);
2470 /* Create a string containing the label name, in LABEL. */
2471 labelno
= const_labelno
++;
2472 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2474 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2475 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2476 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2477 SYMBOL_REF_DECL (symbol
) = desc
->value
;
2478 TREE_CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2480 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2481 set_mem_attributes (rtl
, exp
, 1);
2482 set_mem_alias_set (rtl
, 0);
2483 set_mem_alias_set (rtl
, const_alias_set
);
2485 /* Set flags or add text to the name to record information, such as
2486 that it is a local symbol. If the name is changed, the macro
2487 ASM_OUTPUT_LABELREF will have to know how to strip this
2488 information. This call might invalidate our local variable
2489 SYMBOL; we can't use it afterward. */
2491 (*targetm
.encode_section_info
) (exp
, rtl
, true);
2498 /* Return an rtx representing a reference to constant data in memory
2499 for the constant expression EXP.
2501 If assembler code for such a constant has already been output,
2502 return an rtx to refer to it.
2503 Otherwise, output such a constant in memory
2504 and generate an rtx for it.
2506 If DEFER is nonzero, this constant can be deferred and output only
2507 if referenced in the function after all optimizations.
2509 The const_hash_table records which constants already have label strings. */
2512 output_constant_def (tree exp
, int defer
)
2514 struct constant_descriptor_tree
*desc
;
2515 struct constant_descriptor_tree key
;
2518 /* Look up EXP in the table of constant descriptors. If we didn't find
2519 it, create a new one. */
2521 loc
= htab_find_slot (const_desc_htab
, &key
, INSERT
);
2526 desc
= build_constant_desc (exp
);
2530 maybe_output_constant_def_contents (desc
, defer
);
2534 /* Subroutine of output_constant_def: Decide whether or not we need to
2535 output the constant DESC now, and if so, do it. */
2537 maybe_output_constant_def_contents (struct constant_descriptor_tree
*desc
,
2540 rtx symbol
= XEXP (desc
->rtl
, 0);
2541 tree exp
= desc
->value
;
2543 if (flag_syntax_only
)
2546 if (TREE_ASM_WRITTEN (exp
))
2547 /* Already output; don't do it again. */
2550 /* The only constants that cannot safely be deferred, assuming the
2551 context allows it, are strings under flag_writable_strings. */
2552 if (defer
&& (TREE_CODE (exp
) != STRING_CST
|| !flag_writable_strings
))
2554 /* Increment n_deferred_constants if it exists. It needs to be at
2555 least as large as the number of constants actually referred to
2556 by the function. If it's too small we'll stop looking too early
2557 and fail to emit constants; if it's too large we'll only look
2558 through the entire function when we could have stopped earlier. */
2560 n_deferred_constants
++;
2564 output_constant_def_contents (symbol
);
2567 /* We must output the constant data referred to by SYMBOL; do so. */
2570 output_constant_def_contents (rtx symbol
)
2572 tree exp
= SYMBOL_REF_DECL (symbol
);
2573 const char *label
= XSTR (symbol
, 0);
2575 /* Make sure any other constants whose addresses appear in EXP
2576 are assigned label numbers. */
2577 int reloc
= output_addressed_constants (exp
);
2579 /* Align the location counter as required by EXP's data type. */
2580 int align
= TYPE_ALIGN (TREE_TYPE (exp
));
2581 #ifdef CONSTANT_ALIGNMENT
2582 align
= CONSTANT_ALIGNMENT (exp
, align
);
2585 /* We are no longer deferring this constant. */
2586 TREE_ASM_WRITTEN (exp
) = 1;
2588 if (IN_NAMED_SECTION (exp
))
2589 named_section (exp
, NULL
, reloc
);
2591 (*targetm
.asm_out
.select_section
) (exp
, reloc
, align
);
2593 if (align
> BITS_PER_UNIT
)
2595 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2598 /* Output the label itself. */
2599 ASM_OUTPUT_LABEL (asm_out_file
, label
);
2601 /* Output the value of EXP. */
2602 output_constant (exp
,
2603 (TREE_CODE (exp
) == STRING_CST
2604 ? MAX (TREE_STRING_LENGTH (exp
),
2605 int_size_in_bytes (TREE_TYPE (exp
)))
2606 : int_size_in_bytes (TREE_TYPE (exp
))),
2611 /* A constant which was deferred in its original location has been
2612 inserted by the RTL inliner into a different function. The
2613 current function's deferred constant count must be incremented. */
2615 notice_rtl_inlining_of_deferred_constant (void)
2617 n_deferred_constants
++;
2620 /* Used in the hash tables to avoid outputting the same constant
2621 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2622 are output once per function, not once per file; there seems
2623 to be no reason for the difference. */
2625 struct constant_descriptor_rtx
GTY(())
2627 /* More constant_descriptors with the same hash code. */
2628 struct constant_descriptor_rtx
*next
;
2630 /* A MEM for the constant. */
2633 /* The value of the constant. */
2634 struct rtx_const value
;
2637 /* Structure to represent sufficient information about a constant so that
2638 it can be output when the constant pool is output, so that function
2639 integration can be done, and to simplify handling on machines that reference
2640 constant pool as base+displacement. */
2642 struct pool_constant
GTY(())
2644 struct constant_descriptor_rtx
*desc
;
2645 struct pool_constant
*next
;
2646 struct pool_constant
*next_sym
;
2648 enum machine_mode mode
;
2651 HOST_WIDE_INT offset
;
2655 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2656 The argument is XSTR (... , 0) */
2658 #define SYMHASH(LABEL) (((unsigned long) (LABEL)) % MAX_RTX_HASH_TABLE)
2660 /* Initialize constant pool hashing for a new function. */
2663 init_varasm_status (struct function
*f
)
2665 struct varasm_status
*p
;
2666 p
= (struct varasm_status
*) ggc_alloc (sizeof (struct varasm_status
));
2668 p
->x_const_rtx_hash_table
2669 = ((struct constant_descriptor_rtx
**)
2670 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2671 * sizeof (struct constant_descriptor_rtx
*)));
2672 p
->x_const_rtx_sym_hash_table
2673 = ((struct pool_constant
**)
2674 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2675 * sizeof (struct pool_constant
*)));
2677 p
->x_first_pool
= p
->x_last_pool
= 0;
2678 p
->x_pool_offset
= 0;
2679 p
->deferred_constants
= 0;
2683 /* Express an rtx for a constant integer (perhaps symbolic)
2684 as the sum of a symbol or label plus an explicit integer.
2685 They are stored into VALUE. */
2688 decode_rtx_const (enum machine_mode mode
, rtx x
, struct rtx_const
*value
)
2690 /* Clear the whole structure, including any gaps. */
2691 memset (value
, 0, sizeof (struct rtx_const
));
2693 value
->kind
= RTX_INT
; /* Most usual kind. */
2696 switch (GET_CODE (x
))
2699 value
->kind
= RTX_DOUBLE
;
2700 if (GET_MODE (x
) != VOIDmode
)
2702 const REAL_VALUE_TYPE
*r
= CONST_DOUBLE_REAL_VALUE (x
);
2704 value
->mode
= GET_MODE (x
);
2706 /* Copy the REAL_VALUE_TYPE by members so that we don't
2707 copy garbage from the original structure into our
2708 carefully cleaned hashing structure. */
2709 value
->un
.du
.class = r
->class;
2710 value
->un
.du
.sign
= r
->sign
;
2717 value
->un
.du
.exp
= r
->exp
;
2720 memcpy (value
->un
.du
.sig
, r
->sig
, sizeof (r
->sig
));
2728 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
2729 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
2737 units
= CONST_VECTOR_NUNITS (x
);
2738 value
->kind
= RTX_VECTOR
;
2741 if (GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
)
2743 for (i
= 0; i
< units
; ++i
)
2745 rtx elt
= CONST_VECTOR_ELT (x
, i
);
2746 if (GET_CODE (elt
) == CONST_INT
)
2748 value
->un
.int_vec
[i
].low
= INTVAL (elt
);
2749 value
->un
.int_vec
[i
].high
= 0;
2753 value
->un
.int_vec
[i
].low
= CONST_DOUBLE_LOW (elt
);
2754 value
->un
.int_vec
[i
].high
= CONST_DOUBLE_HIGH (elt
);
2758 else if (GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
2760 for (i
= 0; i
< units
; ++i
)
2762 const REAL_VALUE_TYPE
*r
2763 = CONST_DOUBLE_REAL_VALUE (CONST_VECTOR_ELT (x
, i
));
2764 REAL_VALUE_TYPE
*d
= &value
->un
.fp_vec
[i
];
2766 /* Copy the REAL_VALUE_TYPE by members so that we don't
2767 copy garbage from the original structure into our
2768 carefully cleaned hashing structure. */
2769 d
->class = r
->class;
2780 memcpy (d
->sig
, r
->sig
, sizeof (r
->sig
));
2793 value
->un
.addr
.offset
= INTVAL (x
);
2799 value
->un
.addr
.base
= x
;
2804 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
2806 value
->un
.addr
.base
= XEXP (x
, 0);
2807 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
2809 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
2811 value
->un
.addr
.base
= XEXP (x
, 0);
2812 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
2816 value
->un
.addr
.base
= x
;
2817 value
->un
.addr
.offset
= 0;
2822 value
->kind
= RTX_UNKNOWN
;
2826 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0
2827 && GET_CODE (value
->un
.addr
.base
) == UNSPEC
)
2829 /* For a simple UNSPEC, the base is set to the
2830 operand, the kind field is set to the index of
2831 the unspec expression.
2832 Together with the code below, in case that
2833 the operand is a SYMBOL_REF or LABEL_REF,
2834 the address of the string or the code_label
2835 is taken as base. */
2836 if (XVECLEN (value
->un
.addr
.base
, 0) == 1)
2838 value
->kind
= RTX_UNSPEC
+ XINT (value
->un
.addr
.base
, 1);
2839 value
->un
.addr
.base
= XVECEXP (value
->un
.addr
.base
, 0, 0);
2843 if (value
->kind
>= RTX_INT
&& value
->un
.addr
.base
!= 0)
2844 switch (GET_CODE (value
->un
.addr
.base
))
2847 /* Use the string's address, not the SYMBOL_REF's address,
2848 for the sake of addresses of library routines. */
2849 value
->un
.addr
.symbol
= XSTR (value
->un
.addr
.base
, 0);
2850 value
->un
.addr
.base
= NULL_RTX
;
2854 /* For a LABEL_REF, compare labels. */
2855 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
2862 /* Given a MINUS expression, simplify it if both sides
2863 include the same symbol. */
2866 simplify_subtraction (rtx x
)
2868 struct rtx_const val0
, val1
;
2870 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
2871 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
2873 if (val0
.kind
>= RTX_INT
2874 && val0
.kind
== val1
.kind
2875 && val0
.un
.addr
.base
== val1
.un
.addr
.base
2876 && val0
.un
.addr
.symbol
== val1
.un
.addr
.symbol
)
2877 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
2882 /* Compute a hash code for a constant RTL expression. */
2885 const_hash_rtx (enum machine_mode mode
, rtx x
)
2888 struct rtx_const value
;
2889 unsigned int data
[sizeof(struct rtx_const
) / sizeof (unsigned int)];
2895 decode_rtx_const (mode
, x
, &u
.value
);
2897 /* Compute hashing function. */
2899 for (i
= 0; i
< ARRAY_SIZE (u
.data
); i
++)
2900 hi
= hi
* 613 + u
.data
[i
];
2902 return hi
% MAX_RTX_HASH_TABLE
;
2905 /* Compare a constant rtl object X with a constant-descriptor DESC.
2906 Return 1 if DESC describes a constant with the same value as X. */
2909 compare_constant_rtx (enum machine_mode mode
, rtx x
,
2910 struct constant_descriptor_rtx
*desc
)
2912 struct rtx_const value
;
2914 decode_rtx_const (mode
, x
, &value
);
2916 /* Compare constant contents. */
2917 return memcmp (&value
, &desc
->value
, sizeof (struct rtx_const
)) == 0;
2920 /* Construct a constant descriptor for the rtl-expression X.
2921 It is up to the caller to enter the descriptor in the hash table. */
2923 static struct constant_descriptor_rtx
*
2924 record_constant_rtx (enum machine_mode mode
, rtx x
)
2926 struct constant_descriptor_rtx
*ptr
;
2928 ptr
= (struct constant_descriptor_rtx
*) ggc_alloc (sizeof (*ptr
));
2929 decode_rtx_const (mode
, x
, &ptr
->value
);
2934 /* Given a constant rtx X, return a MEM for the location in memory at which
2935 this constant has been placed. Return 0 if it not has been placed yet. */
2938 mem_for_const_double (rtx x
)
2940 enum machine_mode mode
= GET_MODE (x
);
2941 struct constant_descriptor_rtx
*desc
;
2943 for (desc
= const_rtx_hash_table
[const_hash_rtx (mode
, x
)]; desc
;
2945 if (compare_constant_rtx (mode
, x
, desc
))
2951 /* Given a constant rtx X, make (or find) a memory constant for its value
2952 and return a MEM rtx to refer to it in memory. */
2955 force_const_mem (enum machine_mode mode
, rtx x
)
2958 struct constant_descriptor_rtx
*desc
;
2961 struct pool_constant
*pool
;
2964 /* If we're not allowed to drop X into the constant pool, don't. */
2965 if ((*targetm
.cannot_force_const_mem
) (x
))
2968 /* Compute hash code of X. Search the descriptors for that hash code
2969 to see if any of them describes X. If yes, we have an rtx to use. */
2970 hash
= const_hash_rtx (mode
, x
);
2971 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
2972 if (compare_constant_rtx (mode
, x
, desc
))
2975 /* No constant equal to X is known to have been output.
2976 Make a constant descriptor to enter X in the hash table
2977 and make a MEM for it. */
2978 desc
= record_constant_rtx (mode
, x
);
2979 desc
->next
= const_rtx_hash_table
[hash
];
2980 const_rtx_hash_table
[hash
] = desc
;
2982 /* Align the location counter as required by EXP's data type. */
2983 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
2984 #ifdef CONSTANT_ALIGNMENT
2986 tree type
= (*lang_hooks
.types
.type_for_mode
) (mode
, 0);
2987 if (type
!= NULL_TREE
)
2988 align
= CONSTANT_ALIGNMENT (make_tree (type
, x
), align
);
2992 pool_offset
+= (align
/ BITS_PER_UNIT
) - 1;
2993 pool_offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
2995 if (GET_CODE (x
) == LABEL_REF
)
2996 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
2998 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
2999 pool
= (struct pool_constant
*) ggc_alloc (sizeof (struct pool_constant
));
3003 pool
->labelno
= const_labelno
;
3004 pool
->align
= align
;
3005 pool
->offset
= pool_offset
;
3012 last_pool
->next
= pool
;
3015 pool_offset
+= GET_MODE_SIZE (mode
);
3017 /* Create a string containing the label name, in LABEL. */
3018 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3022 /* Construct the SYMBOL_REF and the MEM. */
3024 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
3025 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
3027 pool
->desc
->rtl
= def
= gen_rtx_MEM (mode
, symbol
);
3028 set_mem_attributes (def
, (*lang_hooks
.types
.type_for_mode
) (mode
, 0), 1);
3029 RTX_UNCHANGING_P (def
) = 1;
3031 /* Add label to symbol hash table. */
3032 hash
= SYMHASH (XSTR (symbol
, 0));
3033 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3034 const_rtx_sym_hash_table
[hash
] = pool
;
3036 /* Mark the symbol_ref as belonging to this constants pool. */
3037 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
3038 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
3039 current_function_uses_const_pool
= 1;
3044 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3045 the corresponding pool_constant structure. */
3047 static struct pool_constant
*
3048 find_pool_constant (struct function
*f
, rtx addr
)
3050 struct pool_constant
*pool
;
3051 const char *label
= XSTR (addr
, 0);
3053 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3054 pool
= pool
->next_sym
)
3055 if (XSTR (XEXP (pool
->desc
->rtl
, 0), 0) == label
)
3061 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3064 get_pool_constant (rtx addr
)
3066 return (find_pool_constant (cfun
, addr
))->constant
;
3069 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3070 and whether it has been output or not. */
3073 get_pool_constant_mark (rtx addr
, bool *pmarked
)
3075 struct pool_constant
*pool
= find_pool_constant (cfun
, addr
);
3076 *pmarked
= (pool
->mark
!= 0);
3077 return pool
->constant
;
3080 /* Likewise, but for the constant pool of a specific function. */
3083 get_pool_constant_for_function (struct function
*f
, rtx addr
)
3085 return (find_pool_constant (f
, addr
))->constant
;
3088 /* Similar, return the mode. */
3091 get_pool_mode (rtx addr
)
3093 return (find_pool_constant (cfun
, addr
))->mode
;
3097 get_pool_mode_for_function (struct function
*f
, rtx addr
)
3099 return (find_pool_constant (f
, addr
))->mode
;
3102 /* Similar, return the offset in the constant pool. */
3105 get_pool_offset (rtx addr
)
3107 return (find_pool_constant (cfun
, addr
))->offset
;
3110 /* Return the size of the constant pool. */
3113 get_pool_size (void)
3118 /* Write all the constants in the constant pool. */
3121 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED
,
3122 tree fndecl ATTRIBUTE_UNUSED
)
3124 struct pool_constant
*pool
;
3128 /* It is possible for gcc to call force_const_mem and then to later
3129 discard the instructions which refer to the constant. In such a
3130 case we do not need to output the constant. */
3131 mark_constant_pool ();
3133 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3134 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3137 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3146 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3147 whose CODE_LABEL has been deleted. This can occur if a jump table
3148 is eliminated by optimization. If so, write a constant of zero
3149 instead. Note that this can also happen by turning the
3150 CODE_LABEL into a NOTE. */
3151 /* ??? This seems completely and utterly wrong. Certainly it's
3152 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3153 functioning even with INSN_DELETED_P and friends. */
3156 switch (GET_CODE (x
))
3159 if (GET_CODE (XEXP (x
, 0)) != PLUS
3160 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3162 tmp
= XEXP (XEXP (x
, 0), 0);
3167 if (INSN_DELETED_P (tmp
)
3168 || (GET_CODE (tmp
) == NOTE
3169 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3180 /* First switch to correct section. */
3181 (*targetm
.asm_out
.select_rtx_section
) (pool
->mode
, x
, pool
->align
);
3183 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3184 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3185 pool
->align
, pool
->labelno
, done
);
3188 assemble_align (pool
->align
);
3190 /* Output the label. */
3191 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LC", pool
->labelno
);
3193 /* Output the value of the constant itself. */
3194 switch (GET_MODE_CLASS (pool
->mode
))
3197 if (GET_CODE (x
) != CONST_DOUBLE
)
3200 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3201 assemble_real (r
, pool
->mode
, pool
->align
);
3205 case MODE_PARTIAL_INT
:
3206 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), pool
->align
, 1);
3209 case MODE_VECTOR_FLOAT
:
3214 if (GET_CODE (x
) != CONST_VECTOR
)
3217 units
= CONST_VECTOR_NUNITS (x
);
3219 for (i
= 0; i
< units
; i
++)
3221 elt
= CONST_VECTOR_ELT (x
, i
);
3222 REAL_VALUE_FROM_CONST_DOUBLE (r
, elt
);
3223 assemble_real (r
, GET_MODE_INNER (pool
->mode
), pool
->align
);
3228 case MODE_VECTOR_INT
:
3233 if (GET_CODE (x
) != CONST_VECTOR
)
3236 units
= CONST_VECTOR_NUNITS (x
);
3238 for (i
= 0; i
< units
; i
++)
3240 elt
= CONST_VECTOR_ELT (x
, i
);
3241 assemble_integer (elt
, GET_MODE_UNIT_SIZE (pool
->mode
),
3251 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3252 sections have proper size. */
3253 if (pool
->align
> GET_MODE_BITSIZE (pool
->mode
)
3254 && in_section
== in_named
3255 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3256 assemble_align (pool
->align
);
3258 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3263 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3264 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3267 /* Done with this pool. */
3268 first_pool
= last_pool
= 0;
3271 /* Look through the instructions for this function, and mark all the
3272 entries in the constant pool which are actually being used. Emit
3273 deferred constants which have indeed been used. */
3276 mark_constant_pool (void)
3280 struct pool_constant
*pool
;
3282 if (first_pool
== 0 && n_deferred_constants
== 0)
3285 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3288 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3290 mark_constants (PATTERN (insn
));
3292 for (link
= current_function_epilogue_delay_list
;
3294 link
= XEXP (link
, 1))
3296 insn
= XEXP (link
, 0);
3299 mark_constants (PATTERN (insn
));
3303 /* Look through appropriate parts of X, marking all entries in the
3304 constant pool which are actually being used. Entries that are only
3305 referenced by other constants are also marked as used. Emit
3306 deferred strings that are used. */
3309 mark_constants (rtx x
)
3312 const char *format_ptr
;
3317 if (GET_CODE (x
) == SYMBOL_REF
)
3319 mark_constant (&x
, NULL
);
3323 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3324 insns, not any notes that may be attached. We don't want to mark
3325 a constant just because it happens to appear in a REG_EQUIV note. */
3328 mark_constants (PATTERN (x
));
3332 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3334 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3336 switch (*format_ptr
++)
3339 mark_constants (XEXP (x
, i
));
3343 if (XVEC (x
, i
) != 0)
3347 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3348 mark_constants (XVECEXP (x
, i
, j
));
3368 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3369 to as used. Emit referenced deferred strings. This function can
3370 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3373 mark_constant (rtx
*current_rtx
, void *data ATTRIBUTE_UNUSED
)
3375 rtx x
= *current_rtx
;
3380 else if (GET_CODE (x
) == SYMBOL_REF
)
3382 if (CONSTANT_POOL_ADDRESS_P (x
))
3384 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3385 if (pool
->mark
== 0)
3388 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3393 else if (TREE_CONSTANT_POOL_ADDRESS_P (x
))
3395 tree exp
= SYMBOL_REF_DECL (x
);
3396 if (!TREE_ASM_WRITTEN (exp
))
3398 n_deferred_constants
--;
3399 output_constant_def_contents (x
);
3406 /* Find all the constants whose addresses are referenced inside of EXP,
3407 and make sure assembler code with a label has been output for each one.
3408 Indicate whether an ADDR_EXPR has been encountered. */
3411 output_addressed_constants (tree exp
)
3413 int reloc
= 0, reloc2
;
3416 /* Give the front-end a chance to convert VALUE to something that
3417 looks more like a constant to the back-end. */
3418 exp
= (*lang_hooks
.expand_constant
) (exp
);
3420 switch (TREE_CODE (exp
))
3424 /* Go inside any operations that get_inner_reference can handle and see
3425 if what's inside is a constant: no need to do anything here for
3426 addresses of variables or functions. */
3427 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3428 tem
= TREE_OPERAND (tem
, 0))
3431 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
3432 || TREE_CODE (tem
) == CONSTRUCTOR
)
3433 output_constant_def (tem
, 0);
3435 if (TREE_PUBLIC (tem
))
3442 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3443 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3447 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3448 reloc2
= output_addressed_constants (TREE_OPERAND (exp
, 1));
3449 /* The difference of two local labels is computable at link time. */
3450 if (reloc
== 1 && reloc2
== 1)
3458 case NON_LVALUE_EXPR
:
3459 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3463 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3464 if (TREE_VALUE (tem
) != 0)
3465 reloc
|= output_addressed_constants (TREE_VALUE (tem
));
3475 /* Return nonzero if VALUE is a valid constant-valued expression
3476 for use in initializing a static variable; one that can be an
3477 element of a "constant" initializer.
3479 Return null_pointer_node if the value is absolute;
3480 if it is relocatable, return the variable that determines the relocation.
3481 We assume that VALUE has been folded as much as possible;
3482 therefore, we do not need to check for such things as
3483 arithmetic-combinations of integers. */
3486 initializer_constant_valid_p (tree value
, tree endtype
)
3488 /* Give the front-end a chance to convert VALUE to something that
3489 looks more like a constant to the back-end. */
3490 value
= (*lang_hooks
.expand_constant
) (value
);
3492 switch (TREE_CODE (value
))
3495 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3496 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3497 && TREE_CONSTANT (value
)
3498 && CONSTRUCTOR_ELTS (value
))
3500 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
3503 return TREE_STATIC (value
) ? null_pointer_node
: 0;
3510 return null_pointer_node
;
3514 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
3516 case VIEW_CONVERT_EXPR
:
3517 case NON_LVALUE_EXPR
:
3518 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3522 /* Allow conversions between pointer types. */
3523 if (POINTER_TYPE_P (TREE_TYPE (value
))
3524 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3525 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3527 /* Allow conversions between real types. */
3528 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3529 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3530 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3532 /* Allow length-preserving conversions between integer types. */
3533 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3534 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3535 && (TYPE_PRECISION (TREE_TYPE (value
))
3536 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3537 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3539 /* Allow conversions between other integer types only if
3541 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3542 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3544 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3546 if (inner
== null_pointer_node
)
3547 return null_pointer_node
;
3551 /* Allow (int) &foo provided int is as wide as a pointer. */
3552 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3553 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3554 && (TYPE_PRECISION (TREE_TYPE (value
))
3555 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3556 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3559 /* Likewise conversions from int to pointers, but also allow
3560 conversions from 0. */
3561 if (POINTER_TYPE_P (TREE_TYPE (value
))
3562 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3564 if (integer_zerop (TREE_OPERAND (value
, 0)))
3565 return null_pointer_node
;
3566 else if (TYPE_PRECISION (TREE_TYPE (value
))
3567 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
3568 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3572 /* Allow conversions to union types if the value inside is okay. */
3573 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
3574 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3579 if (! INTEGRAL_TYPE_P (endtype
)
3580 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3582 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3584 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3586 /* If either term is absolute, use the other terms relocation. */
3587 if (valid0
== null_pointer_node
)
3589 if (valid1
== null_pointer_node
)
3595 if (! INTEGRAL_TYPE_P (endtype
)
3596 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3598 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3600 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3602 /* Win if second argument is absolute. */
3603 if (valid1
== null_pointer_node
)
3605 /* Win if both arguments have the same relocation.
3606 Then the value is absolute. */
3607 if (valid0
== valid1
&& valid0
!= 0)
3608 return null_pointer_node
;
3610 /* Since GCC guarantees that string constants are unique in the
3611 generated code, a subtraction between two copies of the same
3612 constant string is absolute. */
3613 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
3614 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
3615 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
3616 return null_pointer_node
;
3619 /* Support differences between labels. */
3620 if (INTEGRAL_TYPE_P (endtype
))
3623 op0
= TREE_OPERAND (value
, 0);
3624 op1
= TREE_OPERAND (value
, 1);
3626 /* Like STRIP_NOPS except allow the operand mode to widen.
3627 This works around a feature of fold that simplifies
3628 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3629 that the narrower operation is cheaper. */
3631 while (TREE_CODE (op0
) == NOP_EXPR
3632 || TREE_CODE (op0
) == CONVERT_EXPR
3633 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3635 tree inner
= TREE_OPERAND (op0
, 0);
3636 if (inner
== error_mark_node
3637 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3638 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3639 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3644 while (TREE_CODE (op1
) == NOP_EXPR
3645 || TREE_CODE (op1
) == CONVERT_EXPR
3646 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3648 tree inner
= TREE_OPERAND (op1
, 0);
3649 if (inner
== error_mark_node
3650 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3651 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3652 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3657 if (TREE_CODE (op0
) == ADDR_EXPR
3658 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
3659 && TREE_CODE (op1
) == ADDR_EXPR
3660 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
3661 return null_pointer_node
;
3672 /* Output assembler code for constant EXP to FILE, with no label.
3673 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3674 Assumes output_addressed_constants has been done on EXP already.
3676 Generate exactly SIZE bytes of assembler data, padding at the end
3677 with zeros if necessary. SIZE must always be specified.
3679 SIZE is important for structure constructors,
3680 since trailing members may have been omitted from the constructor.
3681 It is also important for initialization of arrays from string constants
3682 since the full length of the string constant might not be wanted.
3683 It is also needed for initialization of unions, where the initializer's
3684 type is just one member, and that may not be as long as the union.
3686 There a case in which we would fail to output exactly SIZE bytes:
3687 for a structure constructor that wants to produce more than SIZE bytes.
3688 But such constructors will never be generated for any possible input.
3690 ALIGN is the alignment of the data in bits. */
3693 output_constant (tree exp
, unsigned HOST_WIDE_INT size
, unsigned int align
)
3695 enum tree_code code
;
3696 unsigned HOST_WIDE_INT thissize
;
3698 /* Some front-ends use constants other than the standard language-independent
3699 varieties, but which may still be output directly. Give the front-end a
3700 chance to convert EXP to a language-independent representation. */
3701 exp
= (*lang_hooks
.expand_constant
) (exp
);
3703 if (size
== 0 || flag_syntax_only
)
3706 /* Eliminate any conversions since we'll be outputting the underlying
3708 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3709 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3710 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3711 exp
= TREE_OPERAND (exp
, 0);
3713 code
= TREE_CODE (TREE_TYPE (exp
));
3714 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3716 /* Allow a constructor with no elements for any data type.
3717 This means to fill the space with zeros. */
3718 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3720 assemble_zeros (size
);
3724 if (TREE_CODE (exp
) == FDESC_EXPR
)
3726 #ifdef ASM_OUTPUT_FDESC
3727 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3728 tree decl
= TREE_OPERAND (exp
, 0);
3729 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3736 /* Now output the underlying data. If we've handling the padding, return.
3737 Otherwise, break and ensure THISSIZE is the size written. */
3745 case REFERENCE_TYPE
:
3746 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3747 EXPAND_INITIALIZER
),
3749 error ("initializer for integer value is too complicated");
3753 if (TREE_CODE (exp
) != REAL_CST
)
3754 error ("initializer for floating value is not a floating constant");
3756 assemble_real (TREE_REAL_CST (exp
),
3757 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0),
3762 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3763 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3764 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
3769 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3771 output_constructor (exp
, size
, align
);
3774 else if (TREE_CODE (exp
) == STRING_CST
)
3776 thissize
= MIN ((unsigned HOST_WIDE_INT
)TREE_STRING_LENGTH (exp
),
3778 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
3780 else if (TREE_CODE (exp
) == VECTOR_CST
)
3784 unsigned int nalign
;
3785 enum machine_mode inner
;
3787 inner
= GET_MODE_INNER (TYPE_MODE (TREE_TYPE (exp
)));
3788 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
3790 elt_size
= GET_MODE_UNIT_SIZE (TYPE_MODE (TREE_TYPE (exp
)));
3792 link
= TREE_VECTOR_CST_ELTS (exp
);
3793 output_constant (TREE_VALUE (link
), elt_size
, align
);
3794 while ((link
= TREE_CHAIN (link
)) != NULL
)
3795 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
3803 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3804 output_constructor (exp
, size
, align
);
3810 if (TREE_CODE (exp
) == INTEGER_CST
)
3811 assemble_integer (expand_expr (exp
, NULL_RTX
,
3812 VOIDmode
, EXPAND_INITIALIZER
),
3813 thissize
, align
, 1);
3814 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3816 unsigned char *buffer
= (unsigned char *) alloca (thissize
);
3817 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
3819 assemble_string ((char *) buffer
, thissize
);
3822 error ("unknown set constructor type");
3832 if (size
> thissize
)
3833 assemble_zeros (size
- thissize
);
3837 /* Subroutine of output_constructor, used for computing the size of
3838 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3839 type with an unspecified upper bound. */
3841 static unsigned HOST_WIDE_INT
3842 array_size_for_constructor (tree val
)
3846 /* This code used to attempt to handle string constants that are not
3847 arrays of single-bytes, but nothing else does, so there's no point in
3849 if (TREE_CODE (val
) == STRING_CST
)
3850 return TREE_STRING_LENGTH (val
);
3852 max_index
= NULL_TREE
;
3853 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
3855 tree index
= TREE_PURPOSE (i
);
3857 if (TREE_CODE (index
) == RANGE_EXPR
)
3858 index
= TREE_OPERAND (index
, 1);
3859 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
3863 if (max_index
== NULL_TREE
)
3866 /* Compute the total number of array elements. */
3867 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
3869 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
3870 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
3872 /* Multiply by the array element unit size to find number of bytes. */
3873 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
3875 return tree_low_cst (i
, 1);
3878 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3879 Generate at least SIZE bytes, padding if necessary. */
3882 output_constructor (tree exp
, unsigned HOST_WIDE_INT size
,
3885 tree type
= TREE_TYPE (exp
);
3886 tree link
, field
= 0;
3888 /* Number of bytes output or skipped so far.
3889 In other words, current position within the constructor. */
3890 HOST_WIDE_INT total_bytes
= 0;
3891 /* Nonzero means BYTE contains part of a byte, to be output. */
3892 int byte_buffer_in_use
= 0;
3895 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3898 if (TREE_CODE (type
) == RECORD_TYPE
)
3899 field
= TYPE_FIELDS (type
);
3901 if (TREE_CODE (type
) == ARRAY_TYPE
3902 && TYPE_DOMAIN (type
) != 0)
3903 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
3905 /* As LINK goes through the elements of the constant,
3906 FIELD goes through the structure fields, if the constant is a structure.
3907 if the constant is a union, then we override this,
3908 by getting the field from the TREE_LIST element.
3909 But the constant could also be an array. Then FIELD is zero.
3911 There is always a maximum of one element in the chain LINK for unions
3912 (even if the initializer in a source program incorrectly contains
3914 for (link
= CONSTRUCTOR_ELTS (exp
);
3916 link
= TREE_CHAIN (link
),
3917 field
= field
? TREE_CHAIN (field
) : 0)
3919 tree val
= TREE_VALUE (link
);
3922 /* The element in a union constructor specifies the proper field
3924 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
3925 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
3926 && TREE_PURPOSE (link
) != 0)
3927 field
= TREE_PURPOSE (link
);
3929 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3930 index
= TREE_PURPOSE (link
);
3932 /* Eliminate the marker that makes a cast not be an lvalue. */
3936 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
3938 unsigned HOST_WIDE_INT fieldsize
3939 = int_size_in_bytes (TREE_TYPE (type
));
3940 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
3941 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
3942 HOST_WIDE_INT index
;
3943 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
3945 for (index
= lo_index
; index
<= hi_index
; index
++)
3947 /* Output the element's initial value. */
3949 assemble_zeros (fieldsize
);
3951 output_constant (val
, fieldsize
, align2
);
3953 /* Count its size. */
3954 total_bytes
+= fieldsize
;
3957 else if (field
== 0 || !DECL_BIT_FIELD (field
))
3959 /* An element that is not a bit-field. */
3961 unsigned HOST_WIDE_INT fieldsize
;
3962 /* Since this structure is static,
3963 we know the positions are constant. */
3964 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
3965 unsigned int align2
;
3968 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
3969 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
3971 /* Output any buffered-up bit-fields preceding this element. */
3972 if (byte_buffer_in_use
)
3974 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3976 byte_buffer_in_use
= 0;
3979 /* Advance to offset of this element.
3980 Note no alignment needed in an array, since that is guaranteed
3981 if each element has the proper size. */
3982 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
3984 assemble_zeros (pos
- total_bytes
);
3988 /* Find the alignment of this element. */
3989 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
3991 /* Determine size this element should occupy. */
3996 /* If this is an array with an unspecified upper bound,
3997 the initializer determines the size. */
3998 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
3999 but we cannot do this until the deprecated support for
4000 initializing zero-length array members is removed. */
4001 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4002 && TYPE_DOMAIN (TREE_TYPE (field
))
4003 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4005 fieldsize
= array_size_for_constructor (val
);
4006 /* Given a non-empty initialization, this field had
4008 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4011 else if (DECL_SIZE_UNIT (field
))
4013 /* ??? This can't be right. If the decl size overflows
4014 a host integer we will silently emit no data. */
4015 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4016 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4020 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4022 /* Output the element's initial value. */
4024 assemble_zeros (fieldsize
);
4026 output_constant (val
, fieldsize
, align2
);
4028 /* Count its size. */
4029 total_bytes
+= fieldsize
;
4031 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4032 error ("invalid initial value for member `%s'",
4033 IDENTIFIER_POINTER (DECL_NAME (field
)));
4036 /* Element that is a bit-field. */
4038 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4039 HOST_WIDE_INT end_offset
4040 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4043 val
= integer_zero_node
;
4045 /* If this field does not start in this (or, next) byte,
4047 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4049 /* Output remnant of any bit field in previous bytes. */
4050 if (byte_buffer_in_use
)
4052 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4054 byte_buffer_in_use
= 0;
4057 /* If still not at proper byte, advance to there. */
4058 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4060 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4061 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4065 if (! byte_buffer_in_use
)
4068 /* We must split the element into pieces that fall within
4069 separate bytes, and combine each byte with previous or
4070 following bit-fields. */
4072 /* next_offset is the offset n fbits from the beginning of
4073 the structure to the next bit of this element to be processed.
4074 end_offset is the offset of the first bit past the end of
4076 while (next_offset
< end_offset
)
4080 HOST_WIDE_INT value
;
4081 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4082 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4084 /* Advance from byte to byte
4085 within this element when necessary. */
4086 while (next_byte
!= total_bytes
)
4088 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4093 /* Number of bits we can process at once
4094 (all part of the same byte). */
4095 this_time
= MIN (end_offset
- next_offset
,
4096 BITS_PER_UNIT
- next_bit
);
4097 if (BYTES_BIG_ENDIAN
)
4099 /* On big-endian machine, take the most significant bits
4100 first (of the bits that are significant)
4101 and put them into bytes from the most significant end. */
4102 shift
= end_offset
- next_offset
- this_time
;
4104 /* Don't try to take a bunch of bits that cross
4105 the word boundary in the INTEGER_CST. We can
4106 only select bits from the LOW or HIGH part
4108 if (shift
< HOST_BITS_PER_WIDE_INT
4109 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4111 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4112 shift
= HOST_BITS_PER_WIDE_INT
;
4115 /* Now get the bits from the appropriate constant word. */
4116 if (shift
< HOST_BITS_PER_WIDE_INT
)
4117 value
= TREE_INT_CST_LOW (val
);
4118 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4120 value
= TREE_INT_CST_HIGH (val
);
4121 shift
-= HOST_BITS_PER_WIDE_INT
;
4126 /* Get the result. This works only when:
4127 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4128 byte
|= (((value
>> shift
)
4129 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4130 << (BITS_PER_UNIT
- this_time
- next_bit
));
4134 /* On little-endian machines,
4135 take first the least significant bits of the value
4136 and pack them starting at the least significant
4137 bits of the bytes. */
4138 shift
= next_offset
- int_bit_position (field
);
4140 /* Don't try to take a bunch of bits that cross
4141 the word boundary in the INTEGER_CST. We can
4142 only select bits from the LOW or HIGH part
4144 if (shift
< HOST_BITS_PER_WIDE_INT
4145 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4146 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4148 /* Now get the bits from the appropriate constant word. */
4149 if (shift
< HOST_BITS_PER_WIDE_INT
)
4150 value
= TREE_INT_CST_LOW (val
);
4151 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4153 value
= TREE_INT_CST_HIGH (val
);
4154 shift
-= HOST_BITS_PER_WIDE_INT
;
4159 /* Get the result. This works only when:
4160 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4161 byte
|= (((value
>> shift
)
4162 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4166 next_offset
+= this_time
;
4167 byte_buffer_in_use
= 1;
4172 if (byte_buffer_in_use
)
4174 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4178 if ((unsigned HOST_WIDE_INT
)total_bytes
< size
)
4179 assemble_zeros (size
- total_bytes
);
4182 /* This TREE_LIST contains any weak symbol declarations waiting
4184 static GTY(()) tree weak_decls
;
4186 /* Mark DECL as weak. */
4189 mark_weak (tree decl
)
4191 DECL_WEAK (decl
) = 1;
4193 if (DECL_RTL_SET_P (decl
)
4194 && GET_CODE (DECL_RTL (decl
)) == MEM
4195 && XEXP (DECL_RTL (decl
), 0)
4196 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4197 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4200 /* Merge weak status between NEWDECL and OLDDECL. */
4203 merge_weak (tree newdecl
, tree olddecl
)
4205 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4208 if (DECL_WEAK (newdecl
))
4212 /* NEWDECL is weak, but OLDDECL is not. */
4214 /* If we already output the OLDDECL, we're in trouble; we can't
4215 go back and make it weak. This error cannot caught in
4216 declare_weak because the NEWDECL and OLDDECL was not yet
4217 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4218 if (TREE_ASM_WRITTEN (olddecl
))
4219 error_with_decl (newdecl
,
4220 "weak declaration of `%s' must precede definition");
4222 /* If we've already generated rtl referencing OLDDECL, we may
4223 have done so in a way that will not function properly with
4225 else if (TREE_USED (olddecl
)
4226 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4227 warning_with_decl (newdecl
, "weak declaration of `%s' after first use results in unspecified behavior");
4231 /* We put the NEWDECL on the weak_decls list at some point.
4232 Replace it with the OLDDECL. */
4233 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4234 if (TREE_VALUE (wd
) == newdecl
)
4236 TREE_VALUE (wd
) = olddecl
;
4239 /* We may not find the entry on the list. If NEWDECL is a
4240 weak alias, then we will have already called
4241 globalize_decl to remove the entry; in that case, we do
4242 not need to do anything. */
4245 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4246 mark_weak (olddecl
);
4249 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4250 weak. Just update NEWDECL to indicate that it's weak too. */
4251 mark_weak (newdecl
);
4254 /* Declare DECL to be a weak symbol. */
4257 declare_weak (tree decl
)
4259 if (! TREE_PUBLIC (decl
))
4260 error_with_decl (decl
, "weak declaration of `%s' must be public");
4261 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4262 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4263 else if (SUPPORTS_WEAK
)
4265 if (! DECL_WEAK (decl
))
4266 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4269 warning_with_decl (decl
, "weak declaration of `%s' not supported");
4274 /* Emit any pending weak declarations. */
4281 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4283 tree decl
= TREE_VALUE (t
);
4284 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4285 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4288 if (! TREE_USED (decl
))
4291 #ifdef ASM_WEAKEN_DECL
4292 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4294 #ifdef ASM_WEAKEN_LABEL
4295 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4297 #ifdef ASM_OUTPUT_WEAK_ALIAS
4298 warning ("only weak aliases are supported in this configuration");
4306 /* Emit the assembly bits to indicate that DECL is globally visible. */
4309 globalize_decl (tree decl
)
4311 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4313 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4314 if (DECL_WEAK (decl
))
4318 #ifdef ASM_WEAKEN_DECL
4319 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4321 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4324 /* Remove this function from the pending weak list so that
4325 we do not emit multiple .weak directives for it. */
4326 for (p
= &weak_decls
; (t
= *p
) ; )
4328 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4329 *p
= TREE_CHAIN (t
);
4331 p
= &TREE_CHAIN (t
);
4337 (*targetm
.asm_out
.globalize_label
) (asm_out_file
, name
);
4340 /* Emit an assembler directive to make the symbol for DECL an alias to
4341 the symbol for TARGET. */
4344 assemble_alias (tree decl
, tree target ATTRIBUTE_UNUSED
)
4348 /* We must force creation of DECL_RTL for debug info generation, even though
4349 we don't use it here. */
4350 make_decl_rtl (decl
, NULL
);
4352 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4354 #ifdef ASM_OUTPUT_DEF
4355 /* Make name accessible from other files, if appropriate. */
4357 if (TREE_PUBLIC (decl
))
4359 globalize_decl (decl
);
4360 maybe_assemble_visibility (decl
);
4363 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4364 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4366 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4368 #else /* !ASM_OUTPUT_DEF */
4369 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4370 if (! DECL_WEAK (decl
))
4371 warning ("only weak aliases are supported in this configuration");
4373 #ifdef ASM_WEAKEN_DECL
4374 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4376 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4379 warning ("alias definitions not supported in this configuration; ignored");
4383 TREE_USED (decl
) = 1;
4384 TREE_ASM_WRITTEN (decl
) = 1;
4385 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4388 /* Emit an assembler directive to set symbol for DECL visibility to
4389 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4392 default_assemble_visibility (tree decl
, int vis
)
4394 static const char * const visibility_types
[] = {
4395 NULL
, "internal", "hidden", "protected"
4398 const char *name
, *type
;
4400 name
= (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4401 type
= visibility_types
[vis
];
4403 #ifdef HAVE_GAS_HIDDEN
4404 fprintf (asm_out_file
, "\t.%s\t", type
);
4405 assemble_name (asm_out_file
, name
);
4406 fprintf (asm_out_file
, "\n");
4408 warning ("visibility attribute not supported in this configuration; ignored");
4412 /* A helper function to call assemble_visibility when needed for a decl. */
4415 maybe_assemble_visibility (tree decl
)
4417 enum symbol_visibility vis
= decl_visibility (decl
);
4419 if (vis
!= VISIBILITY_DEFAULT
)
4420 (* targetm
.asm_out
.visibility
) (decl
, vis
);
4423 /* Returns 1 if the target configuration supports defining public symbols
4424 so that one of them will be chosen at link time instead of generating a
4425 multiply-defined symbol error, whether through the use of weak symbols or
4426 a target-specific mechanism for having duplicates discarded. */
4429 supports_one_only (void)
4431 if (SUPPORTS_ONE_ONLY
)
4433 return SUPPORTS_WEAK
;
4436 /* Set up DECL as a public symbol that can be defined in multiple
4437 translation units without generating a linker error. */
4440 make_decl_one_only (tree decl
)
4442 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4445 TREE_PUBLIC (decl
) = 1;
4447 if (TREE_CODE (decl
) == VAR_DECL
4448 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4449 DECL_COMMON (decl
) = 1;
4450 else if (SUPPORTS_ONE_ONLY
)
4452 #ifdef MAKE_DECL_ONE_ONLY
4453 MAKE_DECL_ONE_ONLY (decl
);
4455 DECL_ONE_ONLY (decl
) = 1;
4457 else if (SUPPORTS_WEAK
)
4458 DECL_WEAK (decl
) = 1;
4464 init_varasm_once (void)
4466 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4467 in_named_entry_eq
, NULL
);
4468 const_desc_htab
= htab_create_ggc (1009, const_desc_hash
,
4469 const_desc_eq
, NULL
);
4471 const_alias_set
= new_alias_set ();
4475 decl_tls_model (tree decl
)
4477 enum tls_model kind
;
4478 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4483 attr
= TREE_VALUE (TREE_VALUE (attr
));
4484 if (TREE_CODE (attr
) != STRING_CST
)
4486 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4487 kind
= TLS_MODEL_LOCAL_EXEC
;
4488 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4489 kind
= TLS_MODEL_INITIAL_EXEC
;
4490 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4491 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4492 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4493 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4499 is_local
= (*targetm
.binds_local_p
) (decl
);
4503 kind
= TLS_MODEL_LOCAL_EXEC
;
4505 kind
= TLS_MODEL_INITIAL_EXEC
;
4507 /* Local dynamic is inefficient when we're not combining the
4508 parts of the address. */
4509 else if (optimize
&& is_local
)
4510 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4512 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4513 if (kind
< flag_tls_default
)
4514 kind
= flag_tls_default
;
4519 enum symbol_visibility
4520 decl_visibility (tree decl
)
4522 tree attr
= lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
));
4526 const char *which
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
4528 if (strcmp (which
, "default") == 0)
4529 return VISIBILITY_DEFAULT
;
4530 if (strcmp (which
, "internal") == 0)
4531 return VISIBILITY_INTERNAL
;
4532 if (strcmp (which
, "hidden") == 0)
4533 return VISIBILITY_HIDDEN
;
4534 if (strcmp (which
, "protected") == 0)
4535 return VISIBILITY_PROTECTED
;
4540 return VISIBILITY_DEFAULT
;
4543 /* Select a set of attributes for section NAME based on the properties
4544 of DECL and whether or not RELOC indicates that DECL's initializer
4545 might contain runtime relocations.
4547 We make the section read-only and executable for a function decl,
4548 read-only for a const data decl, and writable for a non-const data decl. */
4551 default_section_type_flags (tree decl
, const char *name
, int reloc
)
4553 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4557 default_section_type_flags_1 (tree decl
, const char *name
, int reloc
,
4562 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4563 flags
= SECTION_CODE
;
4564 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4567 flags
= SECTION_WRITE
;
4569 if (decl
&& DECL_ONE_ONLY (decl
))
4570 flags
|= SECTION_LINKONCE
;
4572 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4573 flags
|= SECTION_TLS
| SECTION_WRITE
;
4575 if (strcmp (name
, ".bss") == 0
4576 || strncmp (name
, ".bss.", 5) == 0
4577 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4578 || strcmp (name
, ".sbss") == 0
4579 || strncmp (name
, ".sbss.", 6) == 0
4580 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0
4581 || strcmp (name
, ".tbss") == 0
4582 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4583 flags
|= SECTION_BSS
;
4585 if (strcmp (name
, ".tdata") == 0
4586 || strcmp (name
, ".tbss") == 0
4587 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0
4588 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4589 flags
|= SECTION_TLS
;
4591 /* These three sections have special ELF types. They are neither
4592 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4593 want to print a section type (@progbits or @nobits). If someone
4594 is silly enough to emit code or TLS variables to one of these
4595 sections, then don't handle them specially. */
4596 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4597 && (strcmp (name
, ".init_array") == 0
4598 || strcmp (name
, ".fini_array") == 0
4599 || strcmp (name
, ".preinit_array") == 0))
4600 flags
|= SECTION_NOTYPE
;
4605 /* Output assembly to switch to section NAME with attribute FLAGS.
4606 Four variants for common object file formats. */
4609 default_no_named_section (const char *name ATTRIBUTE_UNUSED
,
4610 unsigned int flags ATTRIBUTE_UNUSED
)
4612 /* Some object formats don't support named sections at all. The
4613 front-end should already have flagged this as an error. */
4618 default_elf_asm_named_section (const char *name
, unsigned int flags
)
4620 char flagchars
[10], *f
= flagchars
;
4622 if (! named_section_first_declaration (name
))
4624 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4628 if (!(flags
& SECTION_DEBUG
))
4630 if (flags
& SECTION_WRITE
)
4632 if (flags
& SECTION_CODE
)
4634 if (flags
& SECTION_SMALL
)
4636 if (flags
& SECTION_MERGE
)
4638 if (flags
& SECTION_STRINGS
)
4640 if (flags
& SECTION_TLS
)
4644 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4646 if (!(flags
& SECTION_NOTYPE
))
4650 if (flags
& SECTION_BSS
)
4655 fprintf (asm_out_file
, ",@%s", type
);
4657 if (flags
& SECTION_ENTSIZE
)
4658 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4661 putc ('\n', asm_out_file
);
4665 default_coff_asm_named_section (const char *name
, unsigned int flags
)
4667 char flagchars
[8], *f
= flagchars
;
4669 if (flags
& SECTION_WRITE
)
4671 if (flags
& SECTION_CODE
)
4675 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4679 default_pe_asm_named_section (const char *name
, unsigned int flags
)
4681 default_coff_asm_named_section (name
, flags
);
4683 if (flags
& SECTION_LINKONCE
)
4685 /* Functions may have been compiled at various levels of
4686 optimization so we can't use `same_size' here.
4687 Instead, have the linker pick one. */
4688 fprintf (asm_out_file
, "\t.linkonce %s\n",
4689 (flags
& SECTION_CODE
? "discard" : "same_size"));
4693 /* Used for vtable gc in GNU binutils. Record that the pointer at OFFSET
4694 from SYMBOL is used in all classes derived from SYMBOL. */
4697 assemble_vtable_entry (rtx symbol
, HOST_WIDE_INT offset
)
4699 fputs ("\t.vtable_entry ", asm_out_file
);
4700 output_addr_const (asm_out_file
, symbol
);
4701 fprintf (asm_out_file
, ", " HOST_WIDE_INT_PRINT_DEC
"\n", offset
);
4704 /* Used for vtable gc in GNU binutils. Record the class hierarchy by noting
4705 that the vtable symbol CHILD is derived from the vtable symbol PARENT. */
4708 assemble_vtable_inherit (rtx child
, rtx parent
)
4710 fputs ("\t.vtable_inherit ", asm_out_file
);
4711 output_addr_const (asm_out_file
, child
);
4712 fputs (", ", asm_out_file
);
4713 output_addr_const (asm_out_file
, parent
);
4714 fputc ('\n', asm_out_file
);
4717 /* The lame default section selector. */
4720 default_select_section (tree decl
, int reloc
,
4721 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4723 bool readonly
= false;
4727 if (decl_readonly_section (decl
, reloc
))
4730 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4732 if (! ((flag_pic
&& reloc
)
4733 || !TREE_READONLY (decl
)
4734 || TREE_SIDE_EFFECTS (decl
)
4735 || !TREE_CONSTANT (decl
)))
4738 else if (TREE_CODE (decl
) == STRING_CST
)
4739 readonly
= !flag_writable_strings
;
4740 else if (! (flag_pic
&& reloc
))
4744 readonly_data_section ();
4749 /* A helper function for default_elf_select_section and
4750 default_elf_unique_section. Categorizes the DECL. */
4752 enum section_category
4757 SECCAT_RODATA_MERGE_STR
,
4758 SECCAT_RODATA_MERGE_STR_INIT
,
4759 SECCAT_RODATA_MERGE_CONST
,
4764 /* To optimize loading of shared programs, define following subsections
4766 _REL Contains data that has relocations, so they get grouped
4767 together and dynamic linker will visit fewer pages in memory.
4768 _RO Contains data that is otherwise read-only. This is useful
4769 with prelinking as most relocations won't be dynamically
4770 linked and thus stay read only.
4771 _LOCAL Marks data containing relocations only to local objects.
4772 These relocations will get fully resolved by prelinking. */
4774 SECCAT_DATA_REL_LOCAL
,
4776 SECCAT_DATA_REL_RO_LOCAL
,
4786 static enum section_category
4787 categorize_decl_for_section (tree
, int, int);
4789 static enum section_category
4790 categorize_decl_for_section (tree decl
, int reloc
, int shlib
)
4792 enum section_category ret
;
4794 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4796 else if (TREE_CODE (decl
) == STRING_CST
)
4798 if (flag_writable_strings
)
4801 return SECCAT_RODATA_MERGE_STR
;
4803 else if (TREE_CODE (decl
) == VAR_DECL
)
4805 if (DECL_INITIAL (decl
) == NULL
4806 || DECL_INITIAL (decl
) == error_mark_node
)
4808 else if (! TREE_READONLY (decl
)
4809 || TREE_SIDE_EFFECTS (decl
)
4810 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
4812 if (shlib
&& (reloc
& 2))
4813 ret
= SECCAT_DATA_REL
;
4814 else if (shlib
&& reloc
)
4815 ret
= SECCAT_DATA_REL_LOCAL
;
4819 else if (shlib
&& (reloc
& 2))
4820 ret
= SECCAT_DATA_REL_RO
;
4821 else if (shlib
&& reloc
)
4822 ret
= SECCAT_DATA_REL_RO_LOCAL
;
4823 else if (reloc
|| flag_merge_constants
< 2)
4824 /* C and C++ don't allow different variables to share the same
4825 location. -fmerge-all-constants allows even that (at the
4826 expense of not conforming). */
4827 ret
= SECCAT_RODATA
;
4828 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
4829 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
4831 ret
= SECCAT_RODATA_MERGE_CONST
;
4833 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4835 if ((shlib
&& reloc
)
4836 || TREE_SIDE_EFFECTS (decl
)
4837 || ! TREE_CONSTANT (decl
))
4840 ret
= SECCAT_RODATA
;
4843 ret
= SECCAT_RODATA
;
4845 /* There are no read-only thread-local sections. */
4846 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4848 if (ret
== SECCAT_BSS
)
4854 /* If the target uses small data sections, select it. */
4855 else if ((*targetm
.in_small_data_p
) (decl
))
4857 if (ret
== SECCAT_BSS
)
4859 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
4860 ret
= SECCAT_SRODATA
;
4869 decl_readonly_section (tree decl
, int reloc
)
4871 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
4875 decl_readonly_section_1 (tree decl
, int reloc
, int shlib
)
4877 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4880 case SECCAT_RODATA_MERGE_STR
:
4881 case SECCAT_RODATA_MERGE_STR_INIT
:
4882 case SECCAT_RODATA_MERGE_CONST
:
4883 case SECCAT_SRODATA
:
4892 /* Select a section based on the above categorization. */
4895 default_elf_select_section (tree decl
, int reloc
,
4896 unsigned HOST_WIDE_INT align
)
4898 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
4902 default_elf_select_section_1 (tree decl
, int reloc
,
4903 unsigned HOST_WIDE_INT align
, int shlib
)
4905 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4908 /* We're not supposed to be called on FUNCTION_DECLs. */
4911 readonly_data_section ();
4913 case SECCAT_RODATA_MERGE_STR
:
4914 mergeable_string_section (decl
, align
, 0);
4916 case SECCAT_RODATA_MERGE_STR_INIT
:
4917 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
4919 case SECCAT_RODATA_MERGE_CONST
:
4920 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
4922 case SECCAT_SRODATA
:
4923 named_section (NULL_TREE
, ".sdata2", reloc
);
4928 case SECCAT_DATA_REL
:
4929 named_section (NULL_TREE
, ".data.rel", reloc
);
4931 case SECCAT_DATA_REL_LOCAL
:
4932 named_section (NULL_TREE
, ".data.rel.local", reloc
);
4934 case SECCAT_DATA_REL_RO
:
4935 named_section (NULL_TREE
, ".data.rel.ro", reloc
);
4937 case SECCAT_DATA_REL_RO_LOCAL
:
4938 named_section (NULL_TREE
, ".data.rel.ro.local", reloc
);
4941 named_section (NULL_TREE
, ".sdata", reloc
);
4944 named_section (NULL_TREE
, ".tdata", reloc
);
4947 #ifdef BSS_SECTION_ASM_OP
4950 named_section (NULL_TREE
, ".bss", reloc
);
4954 named_section (NULL_TREE
, ".sbss", reloc
);
4957 named_section (NULL_TREE
, ".tbss", reloc
);
4964 /* Construct a unique section name based on the decl name and the
4965 categorization performed above. */
4968 default_unique_section (tree decl
, int reloc
)
4970 default_unique_section_1 (decl
, reloc
, flag_pic
);
4974 default_unique_section_1 (tree decl
, int reloc
, int shlib
)
4976 bool one_only
= DECL_ONE_ONLY (decl
);
4977 const char *prefix
, *name
;
4981 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4984 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
4987 case SECCAT_RODATA_MERGE_STR
:
4988 case SECCAT_RODATA_MERGE_STR_INIT
:
4989 case SECCAT_RODATA_MERGE_CONST
:
4990 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
4992 case SECCAT_SRODATA
:
4993 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
4996 case SECCAT_DATA_REL
:
4997 case SECCAT_DATA_REL_LOCAL
:
4998 case SECCAT_DATA_REL_RO
:
4999 case SECCAT_DATA_REL_RO_LOCAL
:
5000 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
5003 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
5006 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
5009 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
5012 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
5015 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
5020 plen
= strlen (prefix
);
5022 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5023 name
= (* targetm
.strip_name_encoding
) (name
);
5024 nlen
= strlen (name
);
5026 string
= alloca (nlen
+ plen
+ 1);
5027 memcpy (string
, prefix
, plen
);
5028 memcpy (string
+ plen
, name
, nlen
+ 1);
5030 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
5034 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
5036 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
5039 switch (GET_CODE (x
))
5051 readonly_data_section ();
5055 default_elf_select_rtx_section (enum machine_mode mode
, rtx x
,
5056 unsigned HOST_WIDE_INT align
)
5058 /* ??? Handle small data here somehow. */
5061 switch (GET_CODE (x
))
5065 named_section (NULL_TREE
, ".data.rel.ro", 3);
5069 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
5076 mergeable_constant_section (mode
, align
, 0);
5079 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
5082 default_encode_section_info (tree decl
, rtx rtl
, int first ATTRIBUTE_UNUSED
)
5087 /* Careful not to prod global register variables. */
5088 if (GET_CODE (rtl
) != MEM
)
5090 symbol
= XEXP (rtl
, 0);
5091 if (GET_CODE (symbol
) != SYMBOL_REF
)
5095 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5096 flags
|= SYMBOL_FLAG_FUNCTION
;
5097 if ((*targetm
.binds_local_p
) (decl
))
5098 flags
|= SYMBOL_FLAG_LOCAL
;
5099 if ((*targetm
.in_small_data_p
) (decl
))
5100 flags
|= SYMBOL_FLAG_SMALL
;
5101 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5102 flags
|= decl_tls_model (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
5103 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
5104 being PUBLIC, the thing *must* be defined in this translation unit.
5105 Prevent this buglet from being propagated into rtl code as well. */
5106 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
5107 flags
|= SYMBOL_FLAG_EXTERNAL
;
5109 SYMBOL_REF_FLAGS (symbol
) = flags
;
5112 /* By default, we do nothing for encode_section_info, so we need not
5113 do anything but discard the '*' marker. */
5116 default_strip_name_encoding (const char *str
)
5118 return str
+ (*str
== '*');
5121 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5122 wrt cross-module name binding. */
5125 default_binds_local_p (tree exp
)
5127 return default_binds_local_p_1 (exp
, flag_shlib
);
5131 default_binds_local_p_1 (tree exp
, int shlib
)
5135 /* A non-decl is an entry in the constant pool. */
5138 /* Static variables are always local. */
5139 else if (! TREE_PUBLIC (exp
))
5141 /* A variable is local if the user tells us so. */
5142 else if (decl_visibility (exp
) != VISIBILITY_DEFAULT
)
5144 /* Otherwise, variables defined outside this object may not be local. */
5145 else if (DECL_EXTERNAL (exp
))
5147 /* Linkonce and weak data are never local. */
5148 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
5150 /* If PIC, then assume that any global name can be overridden by
5151 symbols resolved from other modules. */
5154 /* Uninitialized COMMON variable may be unified with symbols
5155 resolved from other modules. */
5156 else if (DECL_COMMON (exp
)
5157 && (DECL_INITIAL (exp
) == NULL
5158 || DECL_INITIAL (exp
) == error_mark_node
))
5160 /* Otherwise we're left with initialized (or non-common) global data
5161 which is of necessity defined locally. */
5168 /* Determine whether or not a pointer mode is valid. Assume defaults
5169 of ptr_mode or Pmode - can be overridden. */
5171 default_valid_pointer_mode (enum machine_mode mode
)
5173 return (mode
== ptr_mode
|| mode
== Pmode
);
5176 /* Default function to output code that will globalize a label. A
5177 target must define GLOBAL_ASM_OP or provide it's own function to
5178 globalize a label. */
5179 #ifdef GLOBAL_ASM_OP
5181 default_globalize_label (FILE * stream
, const char *name
)
5183 fputs (GLOBAL_ASM_OP
, stream
);
5184 assemble_name (stream
, name
);
5185 putc ('\n', stream
);
5187 #endif /* GLOBAL_ASM_OP */
5189 /* This is how to output an internal numbered label where PREFIX is
5190 the class of label and LABELNO is the number within the class. */
5193 default_internal_label (FILE *stream
, const char *prefix
,
5194 unsigned long labelno
)
5196 char *const buf
= alloca (40 + strlen (prefix
));
5197 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5198 ASM_OUTPUT_LABEL (stream
, buf
);
5201 /* This is the default behavior at the beginning of a file. It's
5202 controlled by two other target-hook toggles. */
5204 default_file_start (void)
5206 if (targetm
.file_start_app_off
&& !flag_verbose_asm
)
5207 fputs (ASM_APP_OFF
, asm_out_file
);
5209 if (targetm
.file_start_file_directive
)
5210 output_file_directive (asm_out_file
, main_input_filename
);
5213 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5214 which emits a special section directive used to indicate whether or
5215 not this object file needs an executable stack. This is primarily
5216 a GNU extension to ELF but could be used on other targets. */
5218 file_end_indicate_exec_stack (void)
5220 unsigned int flags
= SECTION_DEBUG
;
5221 if (trampolines_created
)
5222 flags
|= SECTION_CODE
;
5224 named_section_flags (".note.GNU-stack", flags
);
5227 #include "gt-varasm.h"