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 || (TREE_CODE (DECL_CONTEXT (decl
))
755 == TRANSLATION_UNIT_DECL
));
756 const char *name
= 0;
757 const char *new_name
= 0;
761 /* Check that we are not being given an automatic variable. */
762 /* A weak alias has TREE_PUBLIC set but not the other bits. */
763 if (TREE_CODE (decl
) == PARM_DECL
764 || TREE_CODE (decl
) == RESULT_DECL
765 || (TREE_CODE (decl
) == VAR_DECL
766 && !TREE_STATIC (decl
)
767 && !TREE_PUBLIC (decl
)
768 && !DECL_EXTERNAL (decl
)
769 && !DECL_REGISTER (decl
)))
771 /* And that we were not given a type or a label. */
772 else if (TREE_CODE (decl
) == TYPE_DECL
773 || TREE_CODE (decl
) == LABEL_DECL
)
776 /* For a duplicate declaration, we can be called twice on the
777 same DECL node. Don't discard the RTL already made. */
778 if (DECL_RTL_SET_P (decl
))
780 /* If the old RTL had the wrong mode, fix the mode. */
781 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
782 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
783 DECL_MODE (decl
), 0));
785 /* ??? Another way to do this would be to maintain a hashed
786 table of such critters. Instead of adding stuff to a DECL
787 to give certain attributes to it, we could use an external
788 hash map from DECL to set of attributes. */
790 /* Let the target reassign the RTL if it wants.
791 This is necessary, for example, when one machine specific
792 decl attribute overrides another. */
793 (* targetm
.encode_section_info
) (decl
, DECL_RTL (decl
), false);
797 new_name
= name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
799 reg_number
= decode_reg_name (asmspec
);
800 if (reg_number
== -2)
802 /* ASMSPEC is given, and not the name of a register. Mark the
803 name with a star so assemble_name won't munge it. */
804 char *starred
= alloca (strlen (asmspec
) + 2);
806 strcpy (starred
+ 1, asmspec
);
810 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
812 /* First detect errors in declaring global registers. */
813 if (reg_number
== -1)
814 error_with_decl (decl
, "register name not specified for `%s'");
815 else if (reg_number
< 0)
816 error_with_decl (decl
, "invalid register name for `%s'");
817 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
818 error_with_decl (decl
,
819 "data type of `%s' isn't suitable for a register");
820 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
821 error_with_decl (decl
,
822 "register specified for `%s' isn't suitable for data type");
823 /* Now handle properly declared static register variables. */
828 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
830 DECL_INITIAL (decl
) = 0;
831 error ("global register variable has initial value");
833 if (TREE_THIS_VOLATILE (decl
))
834 warning ("volatile register variables don't work as you might wish");
836 /* If the user specified one of the eliminables registers here,
837 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
838 confused with that register and be eliminated. This usage is
839 somewhat suspect... */
841 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
842 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
843 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
845 if (TREE_STATIC (decl
))
847 /* Make this register global, so not usable for anything
849 #ifdef ASM_DECLARE_REGISTER_GLOBAL
850 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
852 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
854 globalize_reg (reg_number
+ --nregs
);
857 /* As a register variable, it has no section. */
862 /* Now handle ordinary static variables and functions (in memory).
863 Also handle vars declared register invalidly. */
865 if (reg_number
>= 0 || reg_number
== -3)
866 error_with_decl (decl
,
867 "register name given for non-register variable `%s'");
869 /* Specifying a section attribute on a variable forces it into a
870 non-.bss section, and thus it cannot be common. */
871 if (TREE_CODE (decl
) == VAR_DECL
872 && DECL_SECTION_NAME (decl
) != NULL_TREE
873 && DECL_INITIAL (decl
) == NULL_TREE
874 && DECL_COMMON (decl
))
875 DECL_COMMON (decl
) = 0;
877 /* Variables can't be both common and weak. */
878 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
879 DECL_COMMON (decl
) = 0;
881 /* Can't use just the variable's own name for a variable
882 whose scope is less than the whole file, unless it's a member
883 of a local class (which will already be unambiguous).
884 Concatenate a distinguishing number. */
885 if (!top_level
&& !TREE_PUBLIC (decl
)
886 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
888 && name
== IDENTIFIER_POINTER (DECL_NAME (decl
)))
892 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
897 if (name
!= new_name
)
899 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (new_name
));
900 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
903 x
= gen_rtx_SYMBOL_REF (Pmode
, name
);
904 SYMBOL_REF_WEAK (x
) = DECL_WEAK (decl
);
905 SYMBOL_REF_DECL (x
) = decl
;
907 x
= gen_rtx_MEM (DECL_MODE (decl
), x
);
908 if (TREE_CODE (decl
) != FUNCTION_DECL
)
909 set_mem_attributes (x
, decl
, 1);
910 SET_DECL_RTL (decl
, x
);
912 /* Optionally set flags or add text to the name to record information
913 such as that it is a function name.
914 If the name is changed, the macro ASM_OUTPUT_LABELREF
915 will have to know how to strip this information. */
916 (* targetm
.encode_section_info
) (decl
, DECL_RTL (decl
), true);
919 /* Make the rtl for variable VAR be volatile.
920 Use this only for static variables. */
923 make_var_volatile (tree var
)
925 if (GET_CODE (DECL_RTL (var
)) != MEM
)
928 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
931 /* Output a string of literal assembler code
932 for an `asm' keyword used between functions. */
935 assemble_asm (tree string
)
939 if (TREE_CODE (string
) == ADDR_EXPR
)
940 string
= TREE_OPERAND (string
, 0);
942 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
945 /* Record an element in the table of global destructors. SYMBOL is
946 a SYMBOL_REF of the function to be called; PRIORITY is a number
947 between 0 and MAX_INIT_PRIORITY. */
950 default_stabs_asm_out_destructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
952 /* Tell GNU LD that this is part of the static destructor set.
953 This will work for any system that uses stabs, most usefully
955 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
956 assemble_name (asm_out_file
, XSTR (symbol
, 0));
957 fputc ('\n', asm_out_file
);
961 default_named_section_asm_out_destructor (rtx symbol
, int priority
)
963 const char *section
= ".dtors";
966 /* ??? This only works reliably with the GNU linker. */
967 if (priority
!= DEFAULT_INIT_PRIORITY
)
969 sprintf (buf
, ".dtors.%.5u",
970 /* Invert the numbering so the linker puts us in the proper
971 order; constructors are run from right to left, and the
972 linker sorts in increasing order. */
973 MAX_INIT_PRIORITY
- priority
);
977 named_section_flags (section
, SECTION_WRITE
);
978 assemble_align (POINTER_SIZE
);
979 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
982 #ifdef DTORS_SECTION_ASM_OP
986 if (in_section
!= in_dtors
)
988 in_section
= in_dtors
;
989 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
990 fputc ('\n', asm_out_file
);
995 default_dtor_section_asm_out_destructor (rtx symbol
,
996 int priority ATTRIBUTE_UNUSED
)
999 assemble_align (POINTER_SIZE
);
1000 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1004 /* Likewise for global constructors. */
1007 default_stabs_asm_out_constructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
1009 /* Tell GNU LD that this is part of the static destructor set.
1010 This will work for any system that uses stabs, most usefully
1012 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
1013 assemble_name (asm_out_file
, XSTR (symbol
, 0));
1014 fputc ('\n', asm_out_file
);
1018 default_named_section_asm_out_constructor (rtx symbol
, int priority
)
1020 const char *section
= ".ctors";
1023 /* ??? This only works reliably with the GNU linker. */
1024 if (priority
!= DEFAULT_INIT_PRIORITY
)
1026 sprintf (buf
, ".ctors.%.5u",
1027 /* Invert the numbering so the linker puts us in the proper
1028 order; constructors are run from right to left, and the
1029 linker sorts in increasing order. */
1030 MAX_INIT_PRIORITY
- priority
);
1034 named_section_flags (section
, SECTION_WRITE
);
1035 assemble_align (POINTER_SIZE
);
1036 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1039 #ifdef CTORS_SECTION_ASM_OP
1041 ctors_section (void)
1043 if (in_section
!= in_ctors
)
1045 in_section
= in_ctors
;
1046 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1047 fputc ('\n', asm_out_file
);
1052 default_ctor_section_asm_out_constructor (rtx symbol
,
1053 int priority ATTRIBUTE_UNUSED
)
1056 assemble_align (POINTER_SIZE
);
1057 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1061 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1062 a nonzero value if the constant pool should be output before the
1063 start of the function, or a zero value if the pool should output
1064 after the end of the function. The default is to put it before the
1067 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1068 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1071 /* Output assembler code for the constant pool of a function and associated
1072 with defining the name of the function. DECL describes the function.
1073 NAME is the function's name. For the constant pool, we use the current
1074 constant pool data. */
1077 assemble_start_function (tree decl
, const char *fnname
)
1081 /* The following code does not need preprocessing in the assembler. */
1085 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1086 output_constant_pool (fnname
, decl
);
1088 resolve_unique_section (decl
, 0, flag_function_sections
);
1089 function_section (decl
);
1091 /* Tell assembler to move to target machine's alignment for functions. */
1092 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1093 if (align
< force_align_functions_log
)
1094 align
= force_align_functions_log
;
1097 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1100 /* Handle a user-specified function alignment.
1101 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1102 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1103 if (align_functions_log
> align
1104 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1106 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1107 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1108 align_functions_log
, align_functions
- 1);
1110 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1114 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1115 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1118 (*debug_hooks
->begin_function
) (decl
);
1120 /* Make function name accessible from other files, if appropriate. */
1122 if (TREE_PUBLIC (decl
))
1124 if (! first_global_object_name
)
1129 p
= (* targetm
.strip_name_encoding
) (fnname
);
1132 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1133 first_global_object_name
= name
;
1135 weak_global_object_name
= name
;
1138 globalize_decl (decl
);
1140 maybe_assemble_visibility (decl
);
1143 /* Do any machine/system dependent processing of the function name */
1144 #ifdef ASM_DECLARE_FUNCTION_NAME
1145 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1147 /* Standard thing is just output label for the function. */
1148 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1149 #endif /* ASM_DECLARE_FUNCTION_NAME */
1152 /* Output assembler code associated with defining the size of the
1153 function. DECL describes the function. NAME is the function's name. */
1156 assemble_end_function (tree decl
, const char *fnname
)
1158 #ifdef ASM_DECLARE_FUNCTION_SIZE
1159 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1161 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1163 output_constant_pool (fnname
, decl
);
1164 function_section (decl
); /* need to switch back */
1168 /* Assemble code to leave SIZE bytes of zeros. */
1171 assemble_zeros (unsigned HOST_WIDE_INT size
)
1173 /* Do no output if -fsyntax-only. */
1174 if (flag_syntax_only
)
1177 #ifdef ASM_NO_SKIP_IN_TEXT
1178 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1179 so we must output 0s explicitly in the text section. */
1180 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1182 unsigned HOST_WIDE_INT i
;
1183 for (i
= 0; i
< size
; i
++)
1184 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1189 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1192 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1195 assemble_align (int align
)
1197 if (align
> BITS_PER_UNIT
)
1199 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1203 /* Assemble a string constant with the specified C string as contents. */
1206 assemble_string (const char *p
, int size
)
1211 /* If the string is very long, split it up. */
1215 int thissize
= size
- pos
;
1216 if (thissize
> maximum
)
1219 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1227 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1228 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1229 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1231 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1232 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1233 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1235 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1236 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1240 #if defined ASM_OUTPUT_ALIGNED_BSS
1241 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1242 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1244 #if defined ASM_OUTPUT_BSS
1245 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1246 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1252 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1253 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1254 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1256 #if defined ASM_OUTPUT_ALIGNED_COMMON
1257 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1258 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1260 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1261 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1266 asm_emit_uninitialised (tree decl
, const char *name
,
1267 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
1268 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
)
1276 destination
= asm_dest_local
;
1278 /* ??? We should handle .bss via select_section mechanisms rather than
1279 via special target hooks. That would eliminate this special case. */
1280 if (TREE_PUBLIC (decl
))
1282 if (!DECL_COMMON (decl
))
1284 destination
= asm_dest_bss
;
1289 destination
= asm_dest_common
;
1292 if (destination
== asm_dest_bss
)
1293 globalize_decl (decl
);
1294 resolve_unique_section (decl
, 0, flag_data_sections
);
1296 if (flag_shared_data
)
1298 switch (destination
)
1300 #ifdef ASM_OUTPUT_SHARED_BSS
1302 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1305 #ifdef ASM_OUTPUT_SHARED_COMMON
1306 case asm_dest_common
:
1307 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1310 #ifdef ASM_OUTPUT_SHARED_LOCAL
1311 case asm_dest_local
:
1312 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1320 switch (destination
)
1324 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1327 case asm_dest_common
:
1328 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1330 case asm_dest_local
:
1331 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1340 /* Assemble everything that is needed for a variable or function declaration.
1341 Not used for automatic variables, and not used for function definitions.
1342 Should not be called for variables of incomplete structure type.
1344 TOP_LEVEL is nonzero if this variable has file scope.
1345 AT_END is nonzero if this is the special handling, at end of compilation,
1346 to define things that have had only tentative definitions.
1347 DONT_OUTPUT_DATA if nonzero means don't actually output the
1348 initial value (that will be done by the caller). */
1351 assemble_variable (tree decl
, int top_level ATTRIBUTE_UNUSED
,
1352 int at_end ATTRIBUTE_UNUSED
, int dont_output_data
)
1359 if (lang_hooks
.decls
.prepare_assemble_variable
)
1360 (*lang_hooks
.decls
.prepare_assemble_variable
) (decl
);
1362 last_assemble_variable_decl
= 0;
1364 /* Normally no need to say anything here for external references,
1365 since assemble_external is called by the language-specific code
1366 when a declaration is first seen. */
1368 if (DECL_EXTERNAL (decl
))
1371 /* Output no assembler code for a function declaration.
1372 Only definitions of functions output anything. */
1374 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1377 /* Do nothing for global register variables. */
1378 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1380 TREE_ASM_WRITTEN (decl
) = 1;
1384 /* If type was incomplete when the variable was declared,
1385 see if it is complete now. */
1387 if (DECL_SIZE (decl
) == 0)
1388 layout_decl (decl
, 0);
1390 /* Still incomplete => don't allocate it; treat the tentative defn
1391 (which is what it must have been) as an `extern' reference. */
1393 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1395 error ("%Hstorage size of `%s' isn't known",
1396 &DECL_SOURCE_LOCATION (decl
),
1397 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1398 TREE_ASM_WRITTEN (decl
) = 1;
1402 /* The first declaration of a variable that comes through this function
1403 decides whether it is global (in C, has external linkage)
1404 or local (in C, has internal linkage). So do nothing more
1405 if this function has already run. */
1407 if (TREE_ASM_WRITTEN (decl
))
1410 /* Make sure targetm.encode_section_info is invoked before we set
1412 decl_rtl
= DECL_RTL (decl
);
1414 TREE_ASM_WRITTEN (decl
) = 1;
1416 /* Do no output if -fsyntax-only. */
1417 if (flag_syntax_only
)
1422 if (! dont_output_data
1423 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1425 error_with_decl (decl
, "size of variable `%s' is too large");
1429 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1430 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1431 && ! first_global_object_name
1432 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1433 || DECL_INITIAL (decl
) == error_mark_node
))
1434 && ! DECL_WEAK (decl
)
1435 && ! DECL_ONE_ONLY (decl
))
1440 p
= (* targetm
.strip_name_encoding
) (name
);
1441 xname
= xstrdup (p
);
1442 first_global_object_name
= xname
;
1445 /* Compute the alignment of this data. */
1447 align
= DECL_ALIGN (decl
);
1449 /* In the case for initialing an array whose length isn't specified,
1450 where we have not yet been able to do the layout,
1451 figure out the proper alignment now. */
1452 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1453 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1454 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1456 /* Some object file formats have a maximum alignment which they support.
1457 In particular, a.out format supports a maximum alignment of 4. */
1458 #ifndef MAX_OFILE_ALIGNMENT
1459 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1461 if (align
> MAX_OFILE_ALIGNMENT
)
1463 warning_with_decl (decl
,
1464 "alignment of `%s' is greater than maximum object file alignment. Using %d",
1465 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1466 align
= MAX_OFILE_ALIGNMENT
;
1469 /* On some machines, it is good to increase alignment sometimes. */
1470 if (! DECL_USER_ALIGN (decl
))
1472 #ifdef DATA_ALIGNMENT
1473 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1475 #ifdef CONSTANT_ALIGNMENT
1476 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1477 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1481 /* Reset the alignment in case we have made it tighter, so we can benefit
1482 from it in get_pointer_alignment. */
1483 DECL_ALIGN (decl
) = align
;
1484 set_mem_align (decl_rtl
, align
);
1486 if (TREE_PUBLIC (decl
))
1487 maybe_assemble_visibility (decl
);
1489 /* Output any data that we will need to use the address of. */
1490 if (DECL_INITIAL (decl
) == error_mark_node
)
1491 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1492 else if (DECL_INITIAL (decl
))
1493 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1494 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1496 /* Handle uninitialized definitions. */
1498 /* If the decl has been given an explicit section name, then it
1499 isn't common, and shouldn't be handled as such. */
1500 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1502 /* We don't implement common thread-local data at present. */
1503 else if (DECL_THREAD_LOCAL (decl
))
1505 if (DECL_COMMON (decl
))
1506 sorry ("thread-local COMMON data not implemented");
1508 else if (DECL_INITIAL (decl
) == 0
1509 || DECL_INITIAL (decl
) == error_mark_node
1510 || (flag_zero_initialized_in_bss
1511 /* Leave constant zeroes in .rodata so they can be shared. */
1512 && !TREE_READONLY (decl
)
1513 && initializer_zerop (DECL_INITIAL (decl
))))
1515 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1516 unsigned HOST_WIDE_INT rounded
= size
;
1518 /* Don't allocate zero bytes of common,
1519 since that means "undefined external" in the linker. */
1523 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1524 so that each uninitialized object starts on such a boundary. */
1525 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1526 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1527 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1529 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1530 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1532 (decl
, "requested alignment for %s is greater than implemented alignment of %d",rounded
);
1535 /* If the target cannot output uninitialized but not common global data
1536 in .bss, then we have to use .data, so fall through. */
1537 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1541 /* Handle initialized definitions.
1542 Also handle uninitialized global definitions if -fno-common and the
1543 target doesn't support ASM_OUTPUT_BSS. */
1545 /* First make the assembler name(s) global if appropriate. */
1546 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1547 globalize_decl (decl
);
1549 /* Switch to the appropriate section. */
1550 variable_section (decl
, reloc
);
1552 /* dbxout.c needs to know this. */
1553 if (in_text_section ())
1554 DECL_IN_TEXT_SECTION (decl
) = 1;
1556 /* Output the alignment of this data. */
1557 if (align
> BITS_PER_UNIT
)
1559 ASM_OUTPUT_ALIGN (asm_out_file
,
1560 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1563 /* Do any machine/system dependent processing of the object. */
1564 #ifdef ASM_DECLARE_OBJECT_NAME
1565 last_assemble_variable_decl
= decl
;
1566 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1568 /* Standard thing is just output label for the object. */
1569 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1570 #endif /* ASM_DECLARE_OBJECT_NAME */
1572 if (!dont_output_data
)
1574 if (DECL_INITIAL (decl
) && DECL_INITIAL (decl
) != error_mark_node
)
1575 /* Output the actual data. */
1576 output_constant (DECL_INITIAL (decl
),
1577 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1580 /* Leave space for it. */
1581 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1585 /* Return 1 if type TYPE contains any pointers. */
1588 contains_pointers_p (tree type
)
1590 switch (TREE_CODE (type
))
1593 case REFERENCE_TYPE
:
1594 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1595 so I'll play safe and return 1. */
1601 case QUAL_UNION_TYPE
:
1604 /* For a type that has fields, see if the fields have pointers. */
1605 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1606 if (TREE_CODE (fields
) == FIELD_DECL
1607 && contains_pointers_p (TREE_TYPE (fields
)))
1613 /* An array type contains pointers if its element type does. */
1614 return contains_pointers_p (TREE_TYPE (type
));
1621 /* Output something to declare an external symbol to the assembler.
1622 (Most assemblers don't need this, so we normally output nothing.)
1623 Do nothing if DECL is not external. */
1626 assemble_external (tree decl ATTRIBUTE_UNUSED
)
1628 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1629 main body of this code is only rarely exercised. To provide some
1630 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1631 open. If it's not, we should not be calling this function. */
1635 #ifdef ASM_OUTPUT_EXTERNAL
1636 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1638 rtx rtl
= DECL_RTL (decl
);
1640 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1641 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1643 /* Some systems do require some output. */
1644 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1645 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1651 /* Similar, for calling a library function FUN. */
1654 assemble_external_libcall (rtx fun ATTRIBUTE_UNUSED
)
1656 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1657 /* Declare library function name external when first used, if nec. */
1658 if (! SYMBOL_REF_USED (fun
))
1660 SYMBOL_REF_USED (fun
) = 1;
1661 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1666 /* Assemble a label named NAME. */
1669 assemble_label (const char *name
)
1671 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1674 /* Set the symbol_referenced flag for ID and notify callgraph code. */
1676 mark_referenced (tree id
)
1678 if (!TREE_SYMBOL_REFERENCED (id
))
1680 struct cgraph_node
*node
;
1681 struct cgraph_varpool_node
*vnode
;
1683 if (!cgraph_global_info_ready
)
1685 node
= cgraph_node_for_identifier (id
);
1687 cgraph_mark_needed_node (node
, 1);
1690 vnode
= cgraph_varpool_node_for_identifier (id
);
1692 cgraph_varpool_mark_needed_node (vnode
);
1694 TREE_SYMBOL_REFERENCED (id
) = 1;
1697 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1698 If NAME starts with a *, the rest of NAME is output verbatim.
1699 Otherwise NAME is transformed in an implementation-defined way
1700 (usually by the addition of an underscore).
1701 Many macros in the tm file are defined to call this function. */
1704 assemble_name (FILE *file
, const char *name
)
1706 const char *real_name
;
1709 real_name
= (* targetm
.strip_name_encoding
) (name
);
1711 id
= maybe_get_identifier (real_name
);
1713 mark_referenced (id
);
1716 fputs (&name
[1], file
);
1718 ASM_OUTPUT_LABELREF (file
, name
);
1721 /* Allocate SIZE bytes writable static space with a gensym name
1722 and return an RTX to refer to its address. */
1725 assemble_static_space (unsigned HOST_WIDE_INT size
)
1728 const char *namestring
;
1732 if (flag_shared_data
)
1736 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1738 namestring
= ggc_strdup (name
);
1740 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1741 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
1743 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1744 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1747 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1748 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1751 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1752 so that each uninitialized object starts on such a boundary. */
1753 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1754 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1755 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1756 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1757 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1758 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1765 /* Assemble the static constant template for function entry trampolines.
1766 This is done at most once per compilation.
1767 Returns an RTX for the address of the template. */
1769 #ifdef TRAMPOLINE_TEMPLATE
1771 assemble_trampoline_template (void)
1778 /* By default, put trampoline templates in read-only data section. */
1780 #ifdef TRAMPOLINE_SECTION
1781 TRAMPOLINE_SECTION ();
1783 readonly_data_section ();
1786 /* Write the assembler code to define one. */
1787 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1790 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1793 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LTRAMP", 0);
1794 TRAMPOLINE_TEMPLATE (asm_out_file
);
1796 /* Record the rtl to refer to it. */
1797 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1798 name
= ggc_strdup (label
);
1799 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
1800 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
1806 /* A and B are either alignments or offsets. Return the minimum alignment
1807 that may be assumed after adding the two together. */
1809 static inline unsigned
1810 min_align (unsigned int a
, unsigned int b
)
1812 return (a
| b
) & -(a
| b
);
1815 /* Return the assembler directive for creating a given kind of integer
1816 object. SIZE is the number of bytes in the object and ALIGNED_P
1817 indicates whether it is known to be aligned. Return NULL if the
1818 assembly dialect has no such directive.
1820 The returned string should be printed at the start of a new line and
1821 be followed immediately by the object's initial value. */
1824 integer_asm_op (int size
, int aligned_p
)
1826 struct asm_int_op
*ops
;
1829 ops
= &targetm
.asm_out
.aligned_op
;
1831 ops
= &targetm
.asm_out
.unaligned_op
;
1836 return targetm
.asm_out
.byte_op
;
1850 /* Use directive OP to assemble an integer object X. Print OP at the
1851 start of the line, followed immediately by the value of X. */
1854 assemble_integer_with_op (const char *op
, rtx x
)
1856 fputs (op
, asm_out_file
);
1857 output_addr_const (asm_out_file
, x
);
1858 fputc ('\n', asm_out_file
);
1861 /* The default implementation of the asm_out.integer target hook. */
1864 default_assemble_integer (rtx x ATTRIBUTE_UNUSED
,
1865 unsigned int size ATTRIBUTE_UNUSED
,
1866 int aligned_p ATTRIBUTE_UNUSED
)
1868 const char *op
= integer_asm_op (size
, aligned_p
);
1869 return op
&& (assemble_integer_with_op (op
, x
), true);
1872 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1873 the alignment of the integer in bits. Return 1 if we were able to output
1874 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1878 assemble_integer (rtx x
, unsigned int size
, unsigned int align
, int force
)
1882 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
1884 /* See if the target hook can handle this kind of object. */
1885 if ((*targetm
.asm_out
.integer
) (x
, size
, aligned_p
))
1888 /* If the object is a multi-byte one, try splitting it up. Split
1889 it into words it if is multi-word, otherwise split it into bytes. */
1892 enum machine_mode omode
, imode
;
1893 unsigned int subalign
;
1894 unsigned int subsize
, i
;
1896 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
1897 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
1898 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
1899 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1901 for (i
= 0; i
< size
; i
+= subsize
)
1903 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
1904 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
1910 /* If we've printed some of it, but not all of it, there's no going
1923 assemble_real (REAL_VALUE_TYPE d
, enum machine_mode mode
, unsigned int align
)
1927 unsigned int nalign
= min_align (align
, 32);
1929 switch (BITS_PER_UNIT
)
1935 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1936 assemble_integer (GEN_INT (l
), 4, align
, 1);
1939 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1940 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1941 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1944 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
1945 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1946 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1947 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
1950 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
1951 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1952 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1953 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
1954 assemble_integer (GEN_INT (data
[3]), 4, nalign
, 1);
1965 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1966 assemble_integer (GEN_INT (l
), 2, align
, 1);
1969 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1970 assemble_integer (GEN_INT (data
[0]), 2, align
, 1);
1971 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
1982 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1983 assemble_integer (GEN_INT (l
), 1, align
, 1);
1986 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1987 assemble_integer (GEN_INT (data
[0]), 1, align
, 1);
1988 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
2000 /* Given an expression EXP with a constant value,
2001 reduce it to the sum of an assembler symbol and an integer.
2002 Store them both in the structure *VALUE.
2003 Abort if EXP does not reduce. */
2005 struct addr_const
GTY(())
2008 HOST_WIDE_INT offset
;
2012 decode_addr_const (tree exp
, struct addr_const
*value
)
2014 tree target
= TREE_OPERAND (exp
, 0);
2020 if (TREE_CODE (target
) == COMPONENT_REF
2021 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2024 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2025 target
= TREE_OPERAND (target
, 0);
2027 else if (TREE_CODE (target
) == ARRAY_REF
2028 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2030 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2031 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2032 target
= TREE_OPERAND (target
, 0);
2038 switch (TREE_CODE (target
))
2042 x
= DECL_RTL (target
);
2046 x
= gen_rtx_MEM (FUNCTION_MODE
,
2047 gen_rtx_LABEL_REF (VOIDmode
, force_label_rtx (target
)));
2055 x
= output_constant_def (target
, 1);
2062 if (GET_CODE (x
) != MEM
)
2067 value
->offset
= offset
;
2070 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2071 enum kind
{ RTX_UNKNOWN
, RTX_DOUBLE
, RTX_VECTOR
, RTX_INT
, RTX_UNSPEC
};
2072 struct rtx_const
GTY(())
2074 ENUM_BITFIELD(kind
) kind
: 16;
2075 ENUM_BITFIELD(machine_mode
) mode
: 16;
2076 union rtx_const_un
{
2077 REAL_VALUE_TYPE
GTY ((tag ("4"))) du
;
2078 struct rtx_const_u_addr
{
2081 HOST_WIDE_INT offset
;
2082 } GTY ((tag ("1"))) addr
;
2083 struct rtx_const_u_di
{
2086 } GTY ((tag ("0"))) di
;
2088 /* The max vector size we have is 16 wide; two variants for
2089 integral and floating point vectors. */
2090 struct rtx_const_int_vec
{
2093 } GTY ((tag ("2"))) int_vec
[16];
2095 REAL_VALUE_TYPE
GTY ((tag ("3"))) fp_vec
[8];
2097 } GTY ((desc ("%1.kind >= RTX_INT"), descbits ("1"))) un
;
2100 /* Uniquize all constants that appear in memory.
2101 Each constant in memory thus far output is recorded
2102 in `const_hash_table'. */
2104 struct constant_descriptor_tree
GTY(())
2106 /* A MEM for the constant. */
2109 /* The value of the constant. */
2113 static GTY((param_is (struct constant_descriptor_tree
)))
2114 htab_t const_desc_htab
;
2116 static struct constant_descriptor_tree
* build_constant_desc (tree
);
2117 static void maybe_output_constant_def_contents (struct constant_descriptor_tree
*, int);
2119 /* Compute a hash code for a constant expression. */
2122 const_desc_hash (const void *ptr
)
2124 return const_hash_1 (((struct constant_descriptor_tree
*)ptr
)->value
);
2128 const_hash_1 (const tree exp
)
2133 enum tree_code code
= TREE_CODE (exp
);
2135 /* Either set P and LEN to the address and len of something to hash and
2136 exit the switch or return a value. */
2141 p
= (char *) &TREE_INT_CST (exp
);
2142 len
= sizeof TREE_INT_CST (exp
);
2146 return real_hash (TREE_REAL_CST_PTR (exp
));
2149 p
= TREE_STRING_POINTER (exp
);
2150 len
= TREE_STRING_LENGTH (exp
);
2153 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2154 + const_hash_1 (TREE_IMAGPART (exp
)));
2157 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2161 len
= int_size_in_bytes (TREE_TYPE (exp
));
2162 tmp
= (char *) alloca (len
);
2163 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2171 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2173 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2174 if (TREE_VALUE (link
))
2175 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2183 struct addr_const value
;
2185 decode_addr_const (exp
, &value
);
2186 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2188 /* Don't hash the address of the SYMBOL_REF;
2189 only use the offset and the symbol name. */
2191 p
= XSTR (value
.base
, 0);
2192 for (i
= 0; p
[i
] != 0; i
++)
2193 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2195 else if (GET_CODE (value
.base
) == LABEL_REF
)
2196 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2204 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2205 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2209 case NON_LVALUE_EXPR
:
2210 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2213 /* A language specific constant. Just hash the code. */
2217 /* Compute hashing function. */
2219 for (i
= 0; i
< len
; i
++)
2220 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2225 /* Wrapper of compare_constant, for the htab interface. */
2227 const_desc_eq (const void *p1
, const void *p2
)
2229 return compare_constant (((struct constant_descriptor_tree
*)p1
)->value
,
2230 ((struct constant_descriptor_tree
*)p2
)->value
);
2233 /* Compare t1 and t2, and return 1 only if they are known to result in
2234 the same bit pattern on output. */
2237 compare_constant (const tree t1
, const tree t2
)
2239 enum tree_code typecode
;
2241 if (t1
== NULL_TREE
)
2242 return t2
== NULL_TREE
;
2243 if (t2
== NULL_TREE
)
2246 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2249 switch (TREE_CODE (t1
))
2252 /* Integer constants are the same only if the same width of type. */
2253 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2255 return tree_int_cst_equal (t1
, t2
);
2258 /* Real constants are the same only if the same width of type. */
2259 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2262 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2265 if (flag_writable_strings
)
2268 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2271 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2272 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2273 TREE_STRING_LENGTH (t1
)));
2276 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2277 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2280 typecode
= TREE_CODE (TREE_TYPE (t1
));
2281 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2284 if (typecode
== SET_TYPE
)
2286 int len
= int_size_in_bytes (TREE_TYPE (t2
));
2287 unsigned char *tmp1
, *tmp2
;
2289 if (int_size_in_bytes (TREE_TYPE (t1
)) != len
)
2292 tmp1
= (unsigned char *) alloca (len
);
2293 tmp2
= (unsigned char *) alloca (len
);
2295 if (get_set_constructor_bytes (t1
, tmp1
, len
) != NULL_TREE
)
2297 if (get_set_constructor_bytes (t2
, tmp2
, len
) != NULL_TREE
)
2300 return memcmp (tmp1
, tmp2
, len
) != 0;
2306 if (typecode
== ARRAY_TYPE
)
2308 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2309 /* For arrays, check that the sizes all match. */
2310 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2312 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2317 /* For record and union constructors, require exact type
2319 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2323 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2325 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2327 /* Check that each value is the same... */
2328 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2330 /* ... and that they apply to the same fields! */
2331 if (typecode
== ARRAY_TYPE
)
2333 if (! compare_constant (TREE_PURPOSE (l1
),
2339 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2344 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2350 struct addr_const value1
, value2
;
2352 decode_addr_const (t1
, &value1
);
2353 decode_addr_const (t2
, &value2
);
2354 return (value1
.offset
== value2
.offset
2355 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2361 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2362 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2366 case NON_LVALUE_EXPR
:
2367 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2372 nt1
= (*lang_hooks
.expand_constant
) (t1
);
2373 nt2
= (*lang_hooks
.expand_constant
) (t2
);
2374 if (nt1
!= t1
|| nt2
!= t2
)
2375 return compare_constant (nt1
, nt2
);
2381 /* Should not get here. */
2385 /* Make a copy of the whole tree structure for a constant. This
2386 handles the same types of nodes that compare_constant handles. */
2389 copy_constant (tree exp
)
2391 switch (TREE_CODE (exp
))
2394 /* For ADDR_EXPR, we do not want to copy the decl whose address
2395 is requested. We do want to copy constants though. */
2396 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2397 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2398 copy_constant (TREE_OPERAND (exp
, 0)));
2400 return copy_node (exp
);
2405 return copy_node (exp
);
2408 return build_complex (TREE_TYPE (exp
),
2409 copy_constant (TREE_REALPART (exp
)),
2410 copy_constant (TREE_IMAGPART (exp
)));
2414 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2415 copy_constant (TREE_OPERAND (exp
, 0)),
2416 copy_constant (TREE_OPERAND (exp
, 1)));
2420 case NON_LVALUE_EXPR
:
2421 case VIEW_CONVERT_EXPR
:
2422 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2423 copy_constant (TREE_OPERAND (exp
, 0)));
2427 tree copy
= copy_node (exp
);
2428 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2431 CONSTRUCTOR_ELTS (copy
) = list
;
2432 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2433 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2434 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2435 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2436 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2444 t
= (*lang_hooks
.expand_constant
) (exp
);
2446 return copy_constant (t
);
2453 /* Subroutine of output_constant_def:
2454 No constant equal to EXP is known to have been output.
2455 Make a constant descriptor to enter EXP in the hash table.
2456 Assign the label number and construct RTL to refer to the
2457 constant's location in memory.
2458 Caller is responsible for updating the hash table. */
2460 static struct constant_descriptor_tree
*
2461 build_constant_desc (tree exp
)
2467 struct constant_descriptor_tree
*desc
;
2469 desc
= ggc_alloc (sizeof (*desc
));
2470 desc
->value
= copy_constant (exp
);
2472 /* Create a string containing the label name, in LABEL. */
2473 labelno
= const_labelno
++;
2474 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2476 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2477 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2478 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2479 SYMBOL_REF_DECL (symbol
) = desc
->value
;
2480 TREE_CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2482 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2483 set_mem_attributes (rtl
, exp
, 1);
2484 set_mem_alias_set (rtl
, 0);
2485 set_mem_alias_set (rtl
, const_alias_set
);
2487 /* Set flags or add text to the name to record information, such as
2488 that it is a local symbol. If the name is changed, the macro
2489 ASM_OUTPUT_LABELREF will have to know how to strip this
2490 information. This call might invalidate our local variable
2491 SYMBOL; we can't use it afterward. */
2493 (*targetm
.encode_section_info
) (exp
, rtl
, true);
2500 /* Return an rtx representing a reference to constant data in memory
2501 for the constant expression EXP.
2503 If assembler code for such a constant has already been output,
2504 return an rtx to refer to it.
2505 Otherwise, output such a constant in memory
2506 and generate an rtx for it.
2508 If DEFER is nonzero, this constant can be deferred and output only
2509 if referenced in the function after all optimizations.
2511 The const_hash_table records which constants already have label strings. */
2514 output_constant_def (tree exp
, int defer
)
2516 struct constant_descriptor_tree
*desc
;
2517 struct constant_descriptor_tree key
;
2520 /* Look up EXP in the table of constant descriptors. If we didn't find
2521 it, create a new one. */
2523 loc
= htab_find_slot (const_desc_htab
, &key
, INSERT
);
2528 desc
= build_constant_desc (exp
);
2532 maybe_output_constant_def_contents (desc
, defer
);
2536 /* Subroutine of output_constant_def: Decide whether or not we need to
2537 output the constant DESC now, and if so, do it. */
2539 maybe_output_constant_def_contents (struct constant_descriptor_tree
*desc
,
2542 rtx symbol
= XEXP (desc
->rtl
, 0);
2543 tree exp
= desc
->value
;
2545 if (flag_syntax_only
)
2548 if (TREE_ASM_WRITTEN (exp
))
2549 /* Already output; don't do it again. */
2552 /* The only constants that cannot safely be deferred, assuming the
2553 context allows it, are strings under flag_writable_strings. */
2554 if (defer
&& (TREE_CODE (exp
) != STRING_CST
|| !flag_writable_strings
))
2556 /* Increment n_deferred_constants if it exists. It needs to be at
2557 least as large as the number of constants actually referred to
2558 by the function. If it's too small we'll stop looking too early
2559 and fail to emit constants; if it's too large we'll only look
2560 through the entire function when we could have stopped earlier. */
2562 n_deferred_constants
++;
2566 output_constant_def_contents (symbol
);
2569 /* We must output the constant data referred to by SYMBOL; do so. */
2572 output_constant_def_contents (rtx symbol
)
2574 tree exp
= SYMBOL_REF_DECL (symbol
);
2575 const char *label
= XSTR (symbol
, 0);
2577 /* Make sure any other constants whose addresses appear in EXP
2578 are assigned label numbers. */
2579 int reloc
= output_addressed_constants (exp
);
2581 /* Align the location counter as required by EXP's data type. */
2582 int align
= TYPE_ALIGN (TREE_TYPE (exp
));
2583 #ifdef CONSTANT_ALIGNMENT
2584 align
= CONSTANT_ALIGNMENT (exp
, align
);
2587 /* We are no longer deferring this constant. */
2588 TREE_ASM_WRITTEN (exp
) = 1;
2590 if (IN_NAMED_SECTION (exp
))
2591 named_section (exp
, NULL
, reloc
);
2593 (*targetm
.asm_out
.select_section
) (exp
, reloc
, align
);
2595 if (align
> BITS_PER_UNIT
)
2597 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2600 /* Output the label itself. */
2601 ASM_OUTPUT_LABEL (asm_out_file
, label
);
2603 /* Output the value of EXP. */
2604 output_constant (exp
,
2605 (TREE_CODE (exp
) == STRING_CST
2606 ? MAX (TREE_STRING_LENGTH (exp
),
2607 int_size_in_bytes (TREE_TYPE (exp
)))
2608 : int_size_in_bytes (TREE_TYPE (exp
))),
2613 /* A constant which was deferred in its original location has been
2614 inserted by the RTL inliner into a different function. The
2615 current function's deferred constant count must be incremented. */
2617 notice_rtl_inlining_of_deferred_constant (void)
2619 n_deferred_constants
++;
2622 /* Used in the hash tables to avoid outputting the same constant
2623 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2624 are output once per function, not once per file; there seems
2625 to be no reason for the difference. */
2627 struct constant_descriptor_rtx
GTY(())
2629 /* More constant_descriptors with the same hash code. */
2630 struct constant_descriptor_rtx
*next
;
2632 /* A MEM for the constant. */
2635 /* The value of the constant. */
2636 struct rtx_const value
;
2639 /* Structure to represent sufficient information about a constant so that
2640 it can be output when the constant pool is output, so that function
2641 integration can be done, and to simplify handling on machines that reference
2642 constant pool as base+displacement. */
2644 struct pool_constant
GTY(())
2646 struct constant_descriptor_rtx
*desc
;
2647 struct pool_constant
*next
;
2648 struct pool_constant
*next_sym
;
2650 enum machine_mode mode
;
2653 HOST_WIDE_INT offset
;
2657 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2658 The argument is XSTR (... , 0) */
2660 #define SYMHASH(LABEL) (((unsigned long) (LABEL)) % MAX_RTX_HASH_TABLE)
2662 /* Initialize constant pool hashing for a new function. */
2665 init_varasm_status (struct function
*f
)
2667 struct varasm_status
*p
;
2668 p
= (struct varasm_status
*) ggc_alloc (sizeof (struct varasm_status
));
2670 p
->x_const_rtx_hash_table
2671 = ((struct constant_descriptor_rtx
**)
2672 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2673 * sizeof (struct constant_descriptor_rtx
*)));
2674 p
->x_const_rtx_sym_hash_table
2675 = ((struct pool_constant
**)
2676 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2677 * sizeof (struct pool_constant
*)));
2679 p
->x_first_pool
= p
->x_last_pool
= 0;
2680 p
->x_pool_offset
= 0;
2681 p
->deferred_constants
= 0;
2685 /* Express an rtx for a constant integer (perhaps symbolic)
2686 as the sum of a symbol or label plus an explicit integer.
2687 They are stored into VALUE. */
2690 decode_rtx_const (enum machine_mode mode
, rtx x
, struct rtx_const
*value
)
2692 /* Clear the whole structure, including any gaps. */
2693 memset (value
, 0, sizeof (struct rtx_const
));
2695 value
->kind
= RTX_INT
; /* Most usual kind. */
2698 switch (GET_CODE (x
))
2701 value
->kind
= RTX_DOUBLE
;
2702 if (GET_MODE (x
) != VOIDmode
)
2704 const REAL_VALUE_TYPE
*r
= CONST_DOUBLE_REAL_VALUE (x
);
2706 value
->mode
= GET_MODE (x
);
2708 /* Copy the REAL_VALUE_TYPE by members so that we don't
2709 copy garbage from the original structure into our
2710 carefully cleaned hashing structure. */
2711 value
->un
.du
.class = r
->class;
2712 value
->un
.du
.sign
= r
->sign
;
2719 value
->un
.du
.exp
= r
->exp
;
2722 memcpy (value
->un
.du
.sig
, r
->sig
, sizeof (r
->sig
));
2730 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
2731 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
2739 units
= CONST_VECTOR_NUNITS (x
);
2740 value
->kind
= RTX_VECTOR
;
2743 if (GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
)
2745 for (i
= 0; i
< units
; ++i
)
2747 rtx elt
= CONST_VECTOR_ELT (x
, i
);
2748 if (GET_CODE (elt
) == CONST_INT
)
2750 value
->un
.int_vec
[i
].low
= INTVAL (elt
);
2751 value
->un
.int_vec
[i
].high
= 0;
2755 value
->un
.int_vec
[i
].low
= CONST_DOUBLE_LOW (elt
);
2756 value
->un
.int_vec
[i
].high
= CONST_DOUBLE_HIGH (elt
);
2760 else if (GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
2762 for (i
= 0; i
< units
; ++i
)
2764 const REAL_VALUE_TYPE
*r
2765 = CONST_DOUBLE_REAL_VALUE (CONST_VECTOR_ELT (x
, i
));
2766 REAL_VALUE_TYPE
*d
= &value
->un
.fp_vec
[i
];
2768 /* Copy the REAL_VALUE_TYPE by members so that we don't
2769 copy garbage from the original structure into our
2770 carefully cleaned hashing structure. */
2771 d
->class = r
->class;
2782 memcpy (d
->sig
, r
->sig
, sizeof (r
->sig
));
2795 value
->un
.addr
.offset
= INTVAL (x
);
2801 value
->un
.addr
.base
= x
;
2806 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
2808 value
->un
.addr
.base
= XEXP (x
, 0);
2809 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
2811 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
2813 value
->un
.addr
.base
= XEXP (x
, 0);
2814 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
2818 value
->un
.addr
.base
= x
;
2819 value
->un
.addr
.offset
= 0;
2824 value
->kind
= RTX_UNKNOWN
;
2828 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0
2829 && GET_CODE (value
->un
.addr
.base
) == UNSPEC
)
2831 /* For a simple UNSPEC, the base is set to the
2832 operand, the kind field is set to the index of
2833 the unspec expression.
2834 Together with the code below, in case that
2835 the operand is a SYMBOL_REF or LABEL_REF,
2836 the address of the string or the code_label
2837 is taken as base. */
2838 if (XVECLEN (value
->un
.addr
.base
, 0) == 1)
2840 value
->kind
= RTX_UNSPEC
+ XINT (value
->un
.addr
.base
, 1);
2841 value
->un
.addr
.base
= XVECEXP (value
->un
.addr
.base
, 0, 0);
2845 if (value
->kind
>= RTX_INT
&& value
->un
.addr
.base
!= 0)
2846 switch (GET_CODE (value
->un
.addr
.base
))
2849 /* Use the string's address, not the SYMBOL_REF's address,
2850 for the sake of addresses of library routines. */
2851 value
->un
.addr
.symbol
= XSTR (value
->un
.addr
.base
, 0);
2852 value
->un
.addr
.base
= NULL_RTX
;
2856 /* For a LABEL_REF, compare labels. */
2857 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
2864 /* Given a MINUS expression, simplify it if both sides
2865 include the same symbol. */
2868 simplify_subtraction (rtx x
)
2870 struct rtx_const val0
, val1
;
2872 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
2873 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
2875 if (val0
.kind
>= RTX_INT
2876 && val0
.kind
== val1
.kind
2877 && val0
.un
.addr
.base
== val1
.un
.addr
.base
2878 && val0
.un
.addr
.symbol
== val1
.un
.addr
.symbol
)
2879 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
2884 /* Compute a hash code for a constant RTL expression. */
2887 const_hash_rtx (enum machine_mode mode
, rtx x
)
2890 struct rtx_const value
;
2891 unsigned int data
[sizeof(struct rtx_const
) / sizeof (unsigned int)];
2897 decode_rtx_const (mode
, x
, &u
.value
);
2899 /* Compute hashing function. */
2901 for (i
= 0; i
< ARRAY_SIZE (u
.data
); i
++)
2902 hi
= hi
* 613 + u
.data
[i
];
2904 return hi
% MAX_RTX_HASH_TABLE
;
2907 /* Compare a constant rtl object X with a constant-descriptor DESC.
2908 Return 1 if DESC describes a constant with the same value as X. */
2911 compare_constant_rtx (enum machine_mode mode
, rtx x
,
2912 struct constant_descriptor_rtx
*desc
)
2914 struct rtx_const value
;
2916 decode_rtx_const (mode
, x
, &value
);
2918 /* Compare constant contents. */
2919 return memcmp (&value
, &desc
->value
, sizeof (struct rtx_const
)) == 0;
2922 /* Construct a constant descriptor for the rtl-expression X.
2923 It is up to the caller to enter the descriptor in the hash table. */
2925 static struct constant_descriptor_rtx
*
2926 record_constant_rtx (enum machine_mode mode
, rtx x
)
2928 struct constant_descriptor_rtx
*ptr
;
2930 ptr
= (struct constant_descriptor_rtx
*) ggc_alloc (sizeof (*ptr
));
2931 decode_rtx_const (mode
, x
, &ptr
->value
);
2936 /* Given a constant rtx X, make (or find) a memory constant for its value
2937 and return a MEM rtx to refer to it in memory. */
2940 force_const_mem (enum machine_mode mode
, rtx x
)
2943 struct constant_descriptor_rtx
*desc
;
2946 struct pool_constant
*pool
;
2949 /* If we're not allowed to drop X into the constant pool, don't. */
2950 if ((*targetm
.cannot_force_const_mem
) (x
))
2953 /* Compute hash code of X. Search the descriptors for that hash code
2954 to see if any of them describes X. If yes, we have an rtx to use. */
2955 hash
= const_hash_rtx (mode
, x
);
2956 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
2957 if (compare_constant_rtx (mode
, x
, desc
))
2960 /* No constant equal to X is known to have been output.
2961 Make a constant descriptor to enter X in the hash table
2962 and make a MEM for it. */
2963 desc
= record_constant_rtx (mode
, x
);
2964 desc
->next
= const_rtx_hash_table
[hash
];
2965 const_rtx_hash_table
[hash
] = desc
;
2967 /* Align the location counter as required by EXP's data type. */
2968 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
2969 #ifdef CONSTANT_ALIGNMENT
2971 tree type
= (*lang_hooks
.types
.type_for_mode
) (mode
, 0);
2972 if (type
!= NULL_TREE
)
2973 align
= CONSTANT_ALIGNMENT (make_tree (type
, x
), align
);
2977 pool_offset
+= (align
/ BITS_PER_UNIT
) - 1;
2978 pool_offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
2980 if (GET_CODE (x
) == LABEL_REF
)
2981 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
2983 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
2984 pool
= (struct pool_constant
*) ggc_alloc (sizeof (struct pool_constant
));
2988 pool
->labelno
= const_labelno
;
2989 pool
->align
= align
;
2990 pool
->offset
= pool_offset
;
2997 last_pool
->next
= pool
;
3000 pool_offset
+= GET_MODE_SIZE (mode
);
3002 /* Create a string containing the label name, in LABEL. */
3003 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3007 /* Construct the SYMBOL_REF and the MEM. */
3009 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
3010 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
3012 pool
->desc
->rtl
= def
= gen_rtx_MEM (mode
, symbol
);
3013 set_mem_attributes (def
, (*lang_hooks
.types
.type_for_mode
) (mode
, 0), 1);
3014 RTX_UNCHANGING_P (def
) = 1;
3016 /* Add label to symbol hash table. */
3017 hash
= SYMHASH (XSTR (symbol
, 0));
3018 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3019 const_rtx_sym_hash_table
[hash
] = pool
;
3021 /* Mark the symbol_ref as belonging to this constants pool. */
3022 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
3023 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
3024 current_function_uses_const_pool
= 1;
3029 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3030 the corresponding pool_constant structure. */
3032 static struct pool_constant
*
3033 find_pool_constant (struct function
*f
, rtx addr
)
3035 struct pool_constant
*pool
;
3036 const char *label
= XSTR (addr
, 0);
3038 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3039 pool
= pool
->next_sym
)
3040 if (XSTR (XEXP (pool
->desc
->rtl
, 0), 0) == label
)
3046 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3049 get_pool_constant (rtx addr
)
3051 return (find_pool_constant (cfun
, addr
))->constant
;
3054 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3055 and whether it has been output or not. */
3058 get_pool_constant_mark (rtx addr
, bool *pmarked
)
3060 struct pool_constant
*pool
= find_pool_constant (cfun
, addr
);
3061 *pmarked
= (pool
->mark
!= 0);
3062 return pool
->constant
;
3065 /* Likewise, but for the constant pool of a specific function. */
3068 get_pool_constant_for_function (struct function
*f
, rtx addr
)
3070 return (find_pool_constant (f
, addr
))->constant
;
3073 /* Similar, return the mode. */
3076 get_pool_mode (rtx addr
)
3078 return (find_pool_constant (cfun
, addr
))->mode
;
3082 get_pool_mode_for_function (struct function
*f
, rtx addr
)
3084 return (find_pool_constant (f
, addr
))->mode
;
3087 /* Similar, return the offset in the constant pool. */
3090 get_pool_offset (rtx addr
)
3092 return (find_pool_constant (cfun
, addr
))->offset
;
3095 /* Return the size of the constant pool. */
3098 get_pool_size (void)
3103 /* Write all the constants in the constant pool. */
3106 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED
,
3107 tree fndecl ATTRIBUTE_UNUSED
)
3109 struct pool_constant
*pool
;
3113 /* It is possible for gcc to call force_const_mem and then to later
3114 discard the instructions which refer to the constant. In such a
3115 case we do not need to output the constant. */
3116 mark_constant_pool ();
3118 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3119 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3122 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3131 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3132 whose CODE_LABEL has been deleted. This can occur if a jump table
3133 is eliminated by optimization. If so, write a constant of zero
3134 instead. Note that this can also happen by turning the
3135 CODE_LABEL into a NOTE. */
3136 /* ??? This seems completely and utterly wrong. Certainly it's
3137 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3138 functioning even with INSN_DELETED_P and friends. */
3141 switch (GET_CODE (x
))
3144 if (GET_CODE (XEXP (x
, 0)) != PLUS
3145 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3147 tmp
= XEXP (XEXP (x
, 0), 0);
3152 if (INSN_DELETED_P (tmp
)
3153 || (GET_CODE (tmp
) == NOTE
3154 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3165 /* First switch to correct section. */
3166 (*targetm
.asm_out
.select_rtx_section
) (pool
->mode
, x
, pool
->align
);
3168 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3169 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3170 pool
->align
, pool
->labelno
, done
);
3173 assemble_align (pool
->align
);
3175 /* Output the label. */
3176 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LC", pool
->labelno
);
3178 /* Output the value of the constant itself. */
3179 switch (GET_MODE_CLASS (pool
->mode
))
3182 if (GET_CODE (x
) != CONST_DOUBLE
)
3185 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3186 assemble_real (r
, pool
->mode
, pool
->align
);
3190 case MODE_PARTIAL_INT
:
3191 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), pool
->align
, 1);
3194 case MODE_VECTOR_FLOAT
:
3199 if (GET_CODE (x
) != CONST_VECTOR
)
3202 units
= CONST_VECTOR_NUNITS (x
);
3204 for (i
= 0; i
< units
; i
++)
3206 elt
= CONST_VECTOR_ELT (x
, i
);
3207 REAL_VALUE_FROM_CONST_DOUBLE (r
, elt
);
3208 assemble_real (r
, GET_MODE_INNER (pool
->mode
), pool
->align
);
3213 case MODE_VECTOR_INT
:
3218 if (GET_CODE (x
) != CONST_VECTOR
)
3221 units
= CONST_VECTOR_NUNITS (x
);
3223 for (i
= 0; i
< units
; i
++)
3225 elt
= CONST_VECTOR_ELT (x
, i
);
3226 assemble_integer (elt
, GET_MODE_UNIT_SIZE (pool
->mode
),
3236 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3237 sections have proper size. */
3238 if (pool
->align
> GET_MODE_BITSIZE (pool
->mode
)
3239 && in_section
== in_named
3240 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3241 assemble_align (pool
->align
);
3243 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3248 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3249 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3252 /* Done with this pool. */
3253 first_pool
= last_pool
= 0;
3256 /* Look through the instructions for this function, and mark all the
3257 entries in the constant pool which are actually being used. Emit
3258 deferred constants which have indeed been used. */
3261 mark_constant_pool (void)
3265 struct pool_constant
*pool
;
3267 if (first_pool
== 0 && n_deferred_constants
== 0)
3270 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3273 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3275 mark_constants (PATTERN (insn
));
3277 for (link
= current_function_epilogue_delay_list
;
3279 link
= XEXP (link
, 1))
3281 insn
= XEXP (link
, 0);
3284 mark_constants (PATTERN (insn
));
3288 /* Look through appropriate parts of X, marking all entries in the
3289 constant pool which are actually being used. Entries that are only
3290 referenced by other constants are also marked as used. Emit
3291 deferred strings that are used. */
3294 mark_constants (rtx x
)
3297 const char *format_ptr
;
3302 if (GET_CODE (x
) == SYMBOL_REF
)
3304 mark_constant (&x
, NULL
);
3308 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3309 insns, not any notes that may be attached. We don't want to mark
3310 a constant just because it happens to appear in a REG_EQUIV note. */
3313 mark_constants (PATTERN (x
));
3317 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3319 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3321 switch (*format_ptr
++)
3324 mark_constants (XEXP (x
, i
));
3328 if (XVEC (x
, i
) != 0)
3332 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3333 mark_constants (XVECEXP (x
, i
, j
));
3353 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3354 to as used. Emit referenced deferred strings. This function can
3355 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3358 mark_constant (rtx
*current_rtx
, void *data ATTRIBUTE_UNUSED
)
3360 rtx x
= *current_rtx
;
3365 else if (GET_CODE (x
) == SYMBOL_REF
)
3367 if (CONSTANT_POOL_ADDRESS_P (x
))
3369 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3370 if (pool
->mark
== 0)
3373 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3378 else if (TREE_CONSTANT_POOL_ADDRESS_P (x
))
3380 tree exp
= SYMBOL_REF_DECL (x
);
3381 if (!TREE_ASM_WRITTEN (exp
))
3383 n_deferred_constants
--;
3384 output_constant_def_contents (x
);
3391 /* Find all the constants whose addresses are referenced inside of EXP,
3392 and make sure assembler code with a label has been output for each one.
3393 Indicate whether an ADDR_EXPR has been encountered. */
3396 output_addressed_constants (tree exp
)
3398 int reloc
= 0, reloc2
;
3401 /* Give the front-end a chance to convert VALUE to something that
3402 looks more like a constant to the back-end. */
3403 exp
= (*lang_hooks
.expand_constant
) (exp
);
3405 switch (TREE_CODE (exp
))
3409 /* Go inside any operations that get_inner_reference can handle and see
3410 if what's inside is a constant: no need to do anything here for
3411 addresses of variables or functions. */
3412 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3413 tem
= TREE_OPERAND (tem
, 0))
3416 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
3417 || TREE_CODE (tem
) == CONSTRUCTOR
)
3418 output_constant_def (tem
, 0);
3420 if (TREE_PUBLIC (tem
))
3427 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3428 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3432 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3433 reloc2
= output_addressed_constants (TREE_OPERAND (exp
, 1));
3434 /* The difference of two local labels is computable at link time. */
3435 if (reloc
== 1 && reloc2
== 1)
3443 case NON_LVALUE_EXPR
:
3444 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3448 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3449 if (TREE_VALUE (tem
) != 0)
3450 reloc
|= output_addressed_constants (TREE_VALUE (tem
));
3460 /* Return nonzero if VALUE is a valid constant-valued expression
3461 for use in initializing a static variable; one that can be an
3462 element of a "constant" initializer.
3464 Return null_pointer_node if the value is absolute;
3465 if it is relocatable, return the variable that determines the relocation.
3466 We assume that VALUE has been folded as much as possible;
3467 therefore, we do not need to check for such things as
3468 arithmetic-combinations of integers. */
3471 initializer_constant_valid_p (tree value
, tree endtype
)
3473 /* Give the front-end a chance to convert VALUE to something that
3474 looks more like a constant to the back-end. */
3475 value
= (*lang_hooks
.expand_constant
) (value
);
3477 switch (TREE_CODE (value
))
3480 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3481 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3482 && TREE_CONSTANT (value
)
3483 && CONSTRUCTOR_ELTS (value
))
3485 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
3488 return TREE_STATIC (value
) ? null_pointer_node
: 0;
3495 return null_pointer_node
;
3499 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
3501 case VIEW_CONVERT_EXPR
:
3502 case NON_LVALUE_EXPR
:
3503 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3507 /* Allow conversions between pointer types. */
3508 if (POINTER_TYPE_P (TREE_TYPE (value
))
3509 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3510 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3512 /* Allow conversions between real types. */
3513 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3514 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3515 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3517 /* Allow length-preserving conversions between integer types. */
3518 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3519 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3520 && (TYPE_PRECISION (TREE_TYPE (value
))
3521 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3522 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3524 /* Allow conversions between other integer types only if
3526 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3527 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3529 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3531 if (inner
== null_pointer_node
)
3532 return null_pointer_node
;
3536 /* Allow (int) &foo provided int is as wide as a pointer. */
3537 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3538 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3539 && (TYPE_PRECISION (TREE_TYPE (value
))
3540 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3541 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3544 /* Likewise conversions from int to pointers, but also allow
3545 conversions from 0. */
3546 if (POINTER_TYPE_P (TREE_TYPE (value
))
3547 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3549 if (integer_zerop (TREE_OPERAND (value
, 0)))
3550 return null_pointer_node
;
3551 else if (TYPE_PRECISION (TREE_TYPE (value
))
3552 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
3553 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3557 /* Allow conversions to union types if the value inside is okay. */
3558 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
3559 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3564 if (! INTEGRAL_TYPE_P (endtype
)
3565 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3567 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3569 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3571 /* If either term is absolute, use the other terms relocation. */
3572 if (valid0
== null_pointer_node
)
3574 if (valid1
== null_pointer_node
)
3580 if (! INTEGRAL_TYPE_P (endtype
)
3581 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3583 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3585 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3587 /* Win if second argument is absolute. */
3588 if (valid1
== null_pointer_node
)
3590 /* Win if both arguments have the same relocation.
3591 Then the value is absolute. */
3592 if (valid0
== valid1
&& valid0
!= 0)
3593 return null_pointer_node
;
3595 /* Since GCC guarantees that string constants are unique in the
3596 generated code, a subtraction between two copies of the same
3597 constant string is absolute. */
3598 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
3599 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
3600 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
3601 return null_pointer_node
;
3604 /* Support differences between labels. */
3605 if (INTEGRAL_TYPE_P (endtype
))
3608 op0
= TREE_OPERAND (value
, 0);
3609 op1
= TREE_OPERAND (value
, 1);
3611 /* Like STRIP_NOPS except allow the operand mode to widen.
3612 This works around a feature of fold that simplifies
3613 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3614 that the narrower operation is cheaper. */
3616 while (TREE_CODE (op0
) == NOP_EXPR
3617 || TREE_CODE (op0
) == CONVERT_EXPR
3618 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3620 tree inner
= TREE_OPERAND (op0
, 0);
3621 if (inner
== error_mark_node
3622 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3623 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3624 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3629 while (TREE_CODE (op1
) == NOP_EXPR
3630 || TREE_CODE (op1
) == CONVERT_EXPR
3631 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3633 tree inner
= TREE_OPERAND (op1
, 0);
3634 if (inner
== error_mark_node
3635 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3636 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3637 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3642 if (TREE_CODE (op0
) == ADDR_EXPR
3643 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
3644 && TREE_CODE (op1
) == ADDR_EXPR
3645 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
3646 return null_pointer_node
;
3657 /* Output assembler code for constant EXP to FILE, with no label.
3658 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3659 Assumes output_addressed_constants has been done on EXP already.
3661 Generate exactly SIZE bytes of assembler data, padding at the end
3662 with zeros if necessary. SIZE must always be specified.
3664 SIZE is important for structure constructors,
3665 since trailing members may have been omitted from the constructor.
3666 It is also important for initialization of arrays from string constants
3667 since the full length of the string constant might not be wanted.
3668 It is also needed for initialization of unions, where the initializer's
3669 type is just one member, and that may not be as long as the union.
3671 There a case in which we would fail to output exactly SIZE bytes:
3672 for a structure constructor that wants to produce more than SIZE bytes.
3673 But such constructors will never be generated for any possible input.
3675 ALIGN is the alignment of the data in bits. */
3678 output_constant (tree exp
, unsigned HOST_WIDE_INT size
, unsigned int align
)
3680 enum tree_code code
;
3681 unsigned HOST_WIDE_INT thissize
;
3683 /* Some front-ends use constants other than the standard language-independent
3684 varieties, but which may still be output directly. Give the front-end a
3685 chance to convert EXP to a language-independent representation. */
3686 exp
= (*lang_hooks
.expand_constant
) (exp
);
3688 if (size
== 0 || flag_syntax_only
)
3691 /* Eliminate any conversions since we'll be outputting the underlying
3693 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3694 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3695 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3696 exp
= TREE_OPERAND (exp
, 0);
3698 code
= TREE_CODE (TREE_TYPE (exp
));
3699 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3701 /* Allow a constructor with no elements for any data type.
3702 This means to fill the space with zeros. */
3703 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3705 assemble_zeros (size
);
3709 if (TREE_CODE (exp
) == FDESC_EXPR
)
3711 #ifdef ASM_OUTPUT_FDESC
3712 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3713 tree decl
= TREE_OPERAND (exp
, 0);
3714 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3721 /* Now output the underlying data. If we've handling the padding, return.
3722 Otherwise, break and ensure THISSIZE is the size written. */
3730 case REFERENCE_TYPE
:
3731 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3732 EXPAND_INITIALIZER
),
3734 error ("initializer for integer value is too complicated");
3738 if (TREE_CODE (exp
) != REAL_CST
)
3739 error ("initializer for floating value is not a floating constant");
3741 assemble_real (TREE_REAL_CST (exp
),
3742 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0),
3747 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3748 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3749 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
3754 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3756 output_constructor (exp
, size
, align
);
3759 else if (TREE_CODE (exp
) == STRING_CST
)
3761 thissize
= MIN ((unsigned HOST_WIDE_INT
)TREE_STRING_LENGTH (exp
),
3763 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
3765 else if (TREE_CODE (exp
) == VECTOR_CST
)
3769 unsigned int nalign
;
3770 enum machine_mode inner
;
3772 inner
= GET_MODE_INNER (TYPE_MODE (TREE_TYPE (exp
)));
3773 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
3775 elt_size
= GET_MODE_UNIT_SIZE (TYPE_MODE (TREE_TYPE (exp
)));
3777 link
= TREE_VECTOR_CST_ELTS (exp
);
3778 output_constant (TREE_VALUE (link
), elt_size
, align
);
3779 while ((link
= TREE_CHAIN (link
)) != NULL
)
3780 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
3788 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3789 output_constructor (exp
, size
, align
);
3795 if (TREE_CODE (exp
) == INTEGER_CST
)
3796 assemble_integer (expand_expr (exp
, NULL_RTX
,
3797 VOIDmode
, EXPAND_INITIALIZER
),
3798 thissize
, align
, 1);
3799 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3801 unsigned char *buffer
= (unsigned char *) alloca (thissize
);
3802 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
3804 assemble_string ((char *) buffer
, thissize
);
3807 error ("unknown set constructor type");
3817 if (size
> thissize
)
3818 assemble_zeros (size
- thissize
);
3822 /* Subroutine of output_constructor, used for computing the size of
3823 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3824 type with an unspecified upper bound. */
3826 static unsigned HOST_WIDE_INT
3827 array_size_for_constructor (tree val
)
3831 /* This code used to attempt to handle string constants that are not
3832 arrays of single-bytes, but nothing else does, so there's no point in
3834 if (TREE_CODE (val
) == STRING_CST
)
3835 return TREE_STRING_LENGTH (val
);
3837 max_index
= NULL_TREE
;
3838 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
3840 tree index
= TREE_PURPOSE (i
);
3842 if (TREE_CODE (index
) == RANGE_EXPR
)
3843 index
= TREE_OPERAND (index
, 1);
3844 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
3848 if (max_index
== NULL_TREE
)
3851 /* Compute the total number of array elements. */
3852 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
3854 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
3855 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
3857 /* Multiply by the array element unit size to find number of bytes. */
3858 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
3860 return tree_low_cst (i
, 1);
3863 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3864 Generate at least SIZE bytes, padding if necessary. */
3867 output_constructor (tree exp
, unsigned HOST_WIDE_INT size
,
3870 tree type
= TREE_TYPE (exp
);
3871 tree link
, field
= 0;
3873 /* Number of bytes output or skipped so far.
3874 In other words, current position within the constructor. */
3875 HOST_WIDE_INT total_bytes
= 0;
3876 /* Nonzero means BYTE contains part of a byte, to be output. */
3877 int byte_buffer_in_use
= 0;
3880 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3883 if (TREE_CODE (type
) == RECORD_TYPE
)
3884 field
= TYPE_FIELDS (type
);
3886 if (TREE_CODE (type
) == ARRAY_TYPE
3887 && TYPE_DOMAIN (type
) != 0)
3888 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
3890 /* As LINK goes through the elements of the constant,
3891 FIELD goes through the structure fields, if the constant is a structure.
3892 if the constant is a union, then we override this,
3893 by getting the field from the TREE_LIST element.
3894 But the constant could also be an array. Then FIELD is zero.
3896 There is always a maximum of one element in the chain LINK for unions
3897 (even if the initializer in a source program incorrectly contains
3899 for (link
= CONSTRUCTOR_ELTS (exp
);
3901 link
= TREE_CHAIN (link
),
3902 field
= field
? TREE_CHAIN (field
) : 0)
3904 tree val
= TREE_VALUE (link
);
3907 /* The element in a union constructor specifies the proper field
3909 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
3910 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
3911 && TREE_PURPOSE (link
) != 0)
3912 field
= TREE_PURPOSE (link
);
3914 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3915 index
= TREE_PURPOSE (link
);
3917 /* Eliminate the marker that makes a cast not be an lvalue. */
3921 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
3923 unsigned HOST_WIDE_INT fieldsize
3924 = int_size_in_bytes (TREE_TYPE (type
));
3925 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
3926 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
3927 HOST_WIDE_INT index
;
3928 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
3930 for (index
= lo_index
; index
<= hi_index
; index
++)
3932 /* Output the element's initial value. */
3934 assemble_zeros (fieldsize
);
3936 output_constant (val
, fieldsize
, align2
);
3938 /* Count its size. */
3939 total_bytes
+= fieldsize
;
3942 else if (field
== 0 || !DECL_BIT_FIELD (field
))
3944 /* An element that is not a bit-field. */
3946 unsigned HOST_WIDE_INT fieldsize
;
3947 /* Since this structure is static,
3948 we know the positions are constant. */
3949 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
3950 unsigned int align2
;
3953 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
3954 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
3956 /* Output any buffered-up bit-fields preceding this element. */
3957 if (byte_buffer_in_use
)
3959 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3961 byte_buffer_in_use
= 0;
3964 /* Advance to offset of this element.
3965 Note no alignment needed in an array, since that is guaranteed
3966 if each element has the proper size. */
3967 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
3969 assemble_zeros (pos
- total_bytes
);
3973 /* Find the alignment of this element. */
3974 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
3976 /* Determine size this element should occupy. */
3981 /* If this is an array with an unspecified upper bound,
3982 the initializer determines the size. */
3983 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
3984 but we cannot do this until the deprecated support for
3985 initializing zero-length array members is removed. */
3986 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
3987 && TYPE_DOMAIN (TREE_TYPE (field
))
3988 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
3990 fieldsize
= array_size_for_constructor (val
);
3991 /* Given a non-empty initialization, this field had
3993 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
3996 else if (DECL_SIZE_UNIT (field
))
3998 /* ??? This can't be right. If the decl size overflows
3999 a host integer we will silently emit no data. */
4000 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4001 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4005 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4007 /* Output the element's initial value. */
4009 assemble_zeros (fieldsize
);
4011 output_constant (val
, fieldsize
, align2
);
4013 /* Count its size. */
4014 total_bytes
+= fieldsize
;
4016 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4017 error ("invalid initial value for member `%s'",
4018 IDENTIFIER_POINTER (DECL_NAME (field
)));
4021 /* Element that is a bit-field. */
4023 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4024 HOST_WIDE_INT end_offset
4025 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4028 val
= integer_zero_node
;
4030 /* If this field does not start in this (or, next) byte,
4032 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4034 /* Output remnant of any bit field in previous bytes. */
4035 if (byte_buffer_in_use
)
4037 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4039 byte_buffer_in_use
= 0;
4042 /* If still not at proper byte, advance to there. */
4043 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4045 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4046 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4050 if (! byte_buffer_in_use
)
4053 /* We must split the element into pieces that fall within
4054 separate bytes, and combine each byte with previous or
4055 following bit-fields. */
4057 /* next_offset is the offset n fbits from the beginning of
4058 the structure to the next bit of this element to be processed.
4059 end_offset is the offset of the first bit past the end of
4061 while (next_offset
< end_offset
)
4065 HOST_WIDE_INT value
;
4066 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4067 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4069 /* Advance from byte to byte
4070 within this element when necessary. */
4071 while (next_byte
!= total_bytes
)
4073 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4078 /* Number of bits we can process at once
4079 (all part of the same byte). */
4080 this_time
= MIN (end_offset
- next_offset
,
4081 BITS_PER_UNIT
- next_bit
);
4082 if (BYTES_BIG_ENDIAN
)
4084 /* On big-endian machine, take the most significant bits
4085 first (of the bits that are significant)
4086 and put them into bytes from the most significant end. */
4087 shift
= end_offset
- next_offset
- this_time
;
4089 /* Don't try to take a bunch of bits that cross
4090 the word boundary in the INTEGER_CST. We can
4091 only select bits from the LOW or HIGH part
4093 if (shift
< HOST_BITS_PER_WIDE_INT
4094 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4096 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4097 shift
= HOST_BITS_PER_WIDE_INT
;
4100 /* Now get the bits from the appropriate constant word. */
4101 if (shift
< HOST_BITS_PER_WIDE_INT
)
4102 value
= TREE_INT_CST_LOW (val
);
4103 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4105 value
= TREE_INT_CST_HIGH (val
);
4106 shift
-= HOST_BITS_PER_WIDE_INT
;
4111 /* Get the result. This works only when:
4112 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4113 byte
|= (((value
>> shift
)
4114 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4115 << (BITS_PER_UNIT
- this_time
- next_bit
));
4119 /* On little-endian machines,
4120 take first the least significant bits of the value
4121 and pack them starting at the least significant
4122 bits of the bytes. */
4123 shift
= next_offset
- int_bit_position (field
);
4125 /* Don't try to take a bunch of bits that cross
4126 the word boundary in the INTEGER_CST. We can
4127 only select bits from the LOW or HIGH part
4129 if (shift
< HOST_BITS_PER_WIDE_INT
4130 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4131 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4133 /* Now get the bits from the appropriate constant word. */
4134 if (shift
< HOST_BITS_PER_WIDE_INT
)
4135 value
= TREE_INT_CST_LOW (val
);
4136 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4138 value
= TREE_INT_CST_HIGH (val
);
4139 shift
-= HOST_BITS_PER_WIDE_INT
;
4144 /* Get the result. This works only when:
4145 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4146 byte
|= (((value
>> shift
)
4147 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4151 next_offset
+= this_time
;
4152 byte_buffer_in_use
= 1;
4157 if (byte_buffer_in_use
)
4159 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4163 if ((unsigned HOST_WIDE_INT
)total_bytes
< size
)
4164 assemble_zeros (size
- total_bytes
);
4167 /* This TREE_LIST contains any weak symbol declarations waiting
4169 static GTY(()) tree weak_decls
;
4171 /* Mark DECL as weak. */
4174 mark_weak (tree decl
)
4176 DECL_WEAK (decl
) = 1;
4178 if (DECL_RTL_SET_P (decl
)
4179 && GET_CODE (DECL_RTL (decl
)) == MEM
4180 && XEXP (DECL_RTL (decl
), 0)
4181 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4182 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4185 /* Merge weak status between NEWDECL and OLDDECL. */
4188 merge_weak (tree newdecl
, tree olddecl
)
4190 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4193 if (DECL_WEAK (newdecl
))
4197 /* NEWDECL is weak, but OLDDECL is not. */
4199 /* If we already output the OLDDECL, we're in trouble; we can't
4200 go back and make it weak. This error cannot caught in
4201 declare_weak because the NEWDECL and OLDDECL was not yet
4202 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4203 if (TREE_ASM_WRITTEN (olddecl
))
4204 error_with_decl (newdecl
,
4205 "weak declaration of `%s' must precede definition");
4207 /* If we've already generated rtl referencing OLDDECL, we may
4208 have done so in a way that will not function properly with
4210 else if (TREE_USED (olddecl
)
4211 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4212 warning_with_decl (newdecl
, "weak declaration of `%s' after first use results in unspecified behavior");
4216 /* We put the NEWDECL on the weak_decls list at some point.
4217 Replace it with the OLDDECL. */
4218 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4219 if (TREE_VALUE (wd
) == newdecl
)
4221 TREE_VALUE (wd
) = olddecl
;
4224 /* We may not find the entry on the list. If NEWDECL is a
4225 weak alias, then we will have already called
4226 globalize_decl to remove the entry; in that case, we do
4227 not need to do anything. */
4230 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4231 mark_weak (olddecl
);
4234 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4235 weak. Just update NEWDECL to indicate that it's weak too. */
4236 mark_weak (newdecl
);
4239 /* Declare DECL to be a weak symbol. */
4242 declare_weak (tree decl
)
4244 if (! TREE_PUBLIC (decl
))
4245 error_with_decl (decl
, "weak declaration of `%s' must be public");
4246 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4247 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4248 else if (SUPPORTS_WEAK
)
4250 if (! DECL_WEAK (decl
))
4251 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4254 warning_with_decl (decl
, "weak declaration of `%s' not supported");
4259 /* Emit any pending weak declarations. */
4266 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4268 tree decl
= TREE_VALUE (t
);
4269 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4270 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4273 if (! TREE_USED (decl
))
4276 #ifdef ASM_WEAKEN_DECL
4277 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4279 #ifdef ASM_WEAKEN_LABEL
4280 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4282 #ifdef ASM_OUTPUT_WEAK_ALIAS
4283 warning ("only weak aliases are supported in this configuration");
4291 /* Emit the assembly bits to indicate that DECL is globally visible. */
4294 globalize_decl (tree decl
)
4296 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4298 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4299 if (DECL_WEAK (decl
))
4303 #ifdef ASM_WEAKEN_DECL
4304 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4306 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4309 /* Remove this function from the pending weak list so that
4310 we do not emit multiple .weak directives for it. */
4311 for (p
= &weak_decls
; (t
= *p
) ; )
4313 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4314 *p
= TREE_CHAIN (t
);
4316 p
= &TREE_CHAIN (t
);
4322 (*targetm
.asm_out
.globalize_label
) (asm_out_file
, name
);
4325 /* Emit an assembler directive to make the symbol for DECL an alias to
4326 the symbol for TARGET. */
4329 assemble_alias (tree decl
, tree target ATTRIBUTE_UNUSED
)
4333 /* We must force creation of DECL_RTL for debug info generation, even though
4334 we don't use it here. */
4335 make_decl_rtl (decl
, NULL
);
4337 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4339 #ifdef ASM_OUTPUT_DEF
4340 /* Make name accessible from other files, if appropriate. */
4342 if (TREE_PUBLIC (decl
))
4344 globalize_decl (decl
);
4345 maybe_assemble_visibility (decl
);
4348 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4349 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4351 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4353 #else /* !ASM_OUTPUT_DEF */
4354 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4355 if (! DECL_WEAK (decl
))
4356 warning ("only weak aliases are supported in this configuration");
4358 #ifdef ASM_WEAKEN_DECL
4359 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4361 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4364 warning ("alias definitions not supported in this configuration; ignored");
4368 TREE_USED (decl
) = 1;
4369 TREE_ASM_WRITTEN (decl
) = 1;
4370 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4373 /* Emit an assembler directive to set symbol for DECL visibility to
4374 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4377 default_assemble_visibility (tree decl
, int vis
)
4379 static const char * const visibility_types
[] = {
4380 NULL
, "internal", "hidden", "protected"
4383 const char *name
, *type
;
4385 name
= (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4386 type
= visibility_types
[vis
];
4388 #ifdef HAVE_GAS_HIDDEN
4389 fprintf (asm_out_file
, "\t.%s\t", type
);
4390 assemble_name (asm_out_file
, name
);
4391 fprintf (asm_out_file
, "\n");
4393 warning ("visibility attribute not supported in this configuration; ignored");
4397 /* A helper function to call assemble_visibility when needed for a decl. */
4400 maybe_assemble_visibility (tree decl
)
4402 enum symbol_visibility vis
= decl_visibility (decl
);
4404 if (vis
!= VISIBILITY_DEFAULT
)
4405 (* targetm
.asm_out
.visibility
) (decl
, vis
);
4408 /* Returns 1 if the target configuration supports defining public symbols
4409 so that one of them will be chosen at link time instead of generating a
4410 multiply-defined symbol error, whether through the use of weak symbols or
4411 a target-specific mechanism for having duplicates discarded. */
4414 supports_one_only (void)
4416 if (SUPPORTS_ONE_ONLY
)
4418 return SUPPORTS_WEAK
;
4421 /* Set up DECL as a public symbol that can be defined in multiple
4422 translation units without generating a linker error. */
4425 make_decl_one_only (tree decl
)
4427 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4430 TREE_PUBLIC (decl
) = 1;
4432 if (TREE_CODE (decl
) == VAR_DECL
4433 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4434 DECL_COMMON (decl
) = 1;
4435 else if (SUPPORTS_ONE_ONLY
)
4437 #ifdef MAKE_DECL_ONE_ONLY
4438 MAKE_DECL_ONE_ONLY (decl
);
4440 DECL_ONE_ONLY (decl
) = 1;
4442 else if (SUPPORTS_WEAK
)
4443 DECL_WEAK (decl
) = 1;
4449 init_varasm_once (void)
4451 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4452 in_named_entry_eq
, NULL
);
4453 const_desc_htab
= htab_create_ggc (1009, const_desc_hash
,
4454 const_desc_eq
, NULL
);
4456 const_alias_set
= new_alias_set ();
4460 decl_tls_model (tree decl
)
4462 enum tls_model kind
;
4463 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4468 attr
= TREE_VALUE (TREE_VALUE (attr
));
4469 if (TREE_CODE (attr
) != STRING_CST
)
4471 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4472 kind
= TLS_MODEL_LOCAL_EXEC
;
4473 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4474 kind
= TLS_MODEL_INITIAL_EXEC
;
4475 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4476 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4477 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4478 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4484 is_local
= (*targetm
.binds_local_p
) (decl
);
4488 kind
= TLS_MODEL_LOCAL_EXEC
;
4490 kind
= TLS_MODEL_INITIAL_EXEC
;
4492 /* Local dynamic is inefficient when we're not combining the
4493 parts of the address. */
4494 else if (optimize
&& is_local
)
4495 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4497 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4498 if (kind
< flag_tls_default
)
4499 kind
= flag_tls_default
;
4504 enum symbol_visibility
4505 decl_visibility (tree decl
)
4507 tree attr
= lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
));
4511 const char *which
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
4513 if (strcmp (which
, "default") == 0)
4514 return VISIBILITY_DEFAULT
;
4515 if (strcmp (which
, "internal") == 0)
4516 return VISIBILITY_INTERNAL
;
4517 if (strcmp (which
, "hidden") == 0)
4518 return VISIBILITY_HIDDEN
;
4519 if (strcmp (which
, "protected") == 0)
4520 return VISIBILITY_PROTECTED
;
4525 return VISIBILITY_DEFAULT
;
4528 /* Select a set of attributes for section NAME based on the properties
4529 of DECL and whether or not RELOC indicates that DECL's initializer
4530 might contain runtime relocations.
4532 We make the section read-only and executable for a function decl,
4533 read-only for a const data decl, and writable for a non-const data decl. */
4536 default_section_type_flags (tree decl
, const char *name
, int reloc
)
4538 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4542 default_section_type_flags_1 (tree decl
, const char *name
, int reloc
,
4547 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4548 flags
= SECTION_CODE
;
4549 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4552 flags
= SECTION_WRITE
;
4554 if (decl
&& DECL_ONE_ONLY (decl
))
4555 flags
|= SECTION_LINKONCE
;
4557 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4558 flags
|= SECTION_TLS
| SECTION_WRITE
;
4560 if (strcmp (name
, ".bss") == 0
4561 || strncmp (name
, ".bss.", 5) == 0
4562 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4563 || strcmp (name
, ".sbss") == 0
4564 || strncmp (name
, ".sbss.", 6) == 0
4565 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0
4566 || strcmp (name
, ".tbss") == 0
4567 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4568 flags
|= SECTION_BSS
;
4570 if (strcmp (name
, ".tdata") == 0
4571 || strcmp (name
, ".tbss") == 0
4572 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0
4573 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4574 flags
|= SECTION_TLS
;
4576 /* These three sections have special ELF types. They are neither
4577 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4578 want to print a section type (@progbits or @nobits). If someone
4579 is silly enough to emit code or TLS variables to one of these
4580 sections, then don't handle them specially. */
4581 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4582 && (strcmp (name
, ".init_array") == 0
4583 || strcmp (name
, ".fini_array") == 0
4584 || strcmp (name
, ".preinit_array") == 0))
4585 flags
|= SECTION_NOTYPE
;
4590 /* Output assembly to switch to section NAME with attribute FLAGS.
4591 Four variants for common object file formats. */
4594 default_no_named_section (const char *name ATTRIBUTE_UNUSED
,
4595 unsigned int flags ATTRIBUTE_UNUSED
)
4597 /* Some object formats don't support named sections at all. The
4598 front-end should already have flagged this as an error. */
4603 default_elf_asm_named_section (const char *name
, unsigned int flags
)
4605 char flagchars
[10], *f
= flagchars
;
4607 if (! named_section_first_declaration (name
))
4609 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4613 if (!(flags
& SECTION_DEBUG
))
4615 if (flags
& SECTION_WRITE
)
4617 if (flags
& SECTION_CODE
)
4619 if (flags
& SECTION_SMALL
)
4621 if (flags
& SECTION_MERGE
)
4623 if (flags
& SECTION_STRINGS
)
4625 if (flags
& SECTION_TLS
)
4629 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4631 if (!(flags
& SECTION_NOTYPE
))
4635 if (flags
& SECTION_BSS
)
4640 fprintf (asm_out_file
, ",@%s", type
);
4642 if (flags
& SECTION_ENTSIZE
)
4643 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4646 putc ('\n', asm_out_file
);
4650 default_coff_asm_named_section (const char *name
, unsigned int flags
)
4652 char flagchars
[8], *f
= flagchars
;
4654 if (flags
& SECTION_WRITE
)
4656 if (flags
& SECTION_CODE
)
4660 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4664 default_pe_asm_named_section (const char *name
, unsigned int flags
)
4666 default_coff_asm_named_section (name
, flags
);
4668 if (flags
& SECTION_LINKONCE
)
4670 /* Functions may have been compiled at various levels of
4671 optimization so we can't use `same_size' here.
4672 Instead, have the linker pick one. */
4673 fprintf (asm_out_file
, "\t.linkonce %s\n",
4674 (flags
& SECTION_CODE
? "discard" : "same_size"));
4678 /* Used for vtable gc in GNU binutils. Record that the pointer at OFFSET
4679 from SYMBOL is used in all classes derived from SYMBOL. */
4682 assemble_vtable_entry (rtx symbol
, HOST_WIDE_INT offset
)
4684 fputs ("\t.vtable_entry ", asm_out_file
);
4685 output_addr_const (asm_out_file
, symbol
);
4686 fprintf (asm_out_file
, ", " HOST_WIDE_INT_PRINT_DEC
"\n", offset
);
4689 /* Used for vtable gc in GNU binutils. Record the class hierarchy by noting
4690 that the vtable symbol CHILD is derived from the vtable symbol PARENT. */
4693 assemble_vtable_inherit (rtx child
, rtx parent
)
4695 fputs ("\t.vtable_inherit ", asm_out_file
);
4696 output_addr_const (asm_out_file
, child
);
4697 fputs (", ", asm_out_file
);
4698 output_addr_const (asm_out_file
, parent
);
4699 fputc ('\n', asm_out_file
);
4702 /* The lame default section selector. */
4705 default_select_section (tree decl
, int reloc
,
4706 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4708 bool readonly
= false;
4712 if (decl_readonly_section (decl
, reloc
))
4715 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4717 if (! ((flag_pic
&& reloc
)
4718 || !TREE_READONLY (decl
)
4719 || TREE_SIDE_EFFECTS (decl
)
4720 || !TREE_CONSTANT (decl
)))
4723 else if (TREE_CODE (decl
) == STRING_CST
)
4724 readonly
= !flag_writable_strings
;
4725 else if (! (flag_pic
&& reloc
))
4729 readonly_data_section ();
4734 /* A helper function for default_elf_select_section and
4735 default_elf_unique_section. Categorizes the DECL. */
4737 enum section_category
4742 SECCAT_RODATA_MERGE_STR
,
4743 SECCAT_RODATA_MERGE_STR_INIT
,
4744 SECCAT_RODATA_MERGE_CONST
,
4749 /* To optimize loading of shared programs, define following subsections
4751 _REL Contains data that has relocations, so they get grouped
4752 together and dynamic linker will visit fewer pages in memory.
4753 _RO Contains data that is otherwise read-only. This is useful
4754 with prelinking as most relocations won't be dynamically
4755 linked and thus stay read only.
4756 _LOCAL Marks data containing relocations only to local objects.
4757 These relocations will get fully resolved by prelinking. */
4759 SECCAT_DATA_REL_LOCAL
,
4761 SECCAT_DATA_REL_RO_LOCAL
,
4771 static enum section_category
4772 categorize_decl_for_section (tree
, int, int);
4774 static enum section_category
4775 categorize_decl_for_section (tree decl
, int reloc
, int shlib
)
4777 enum section_category ret
;
4779 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4781 else if (TREE_CODE (decl
) == STRING_CST
)
4783 if (flag_writable_strings
)
4786 return SECCAT_RODATA_MERGE_STR
;
4788 else if (TREE_CODE (decl
) == VAR_DECL
)
4790 if (DECL_INITIAL (decl
) == NULL
4791 || DECL_INITIAL (decl
) == error_mark_node
)
4793 else if (! TREE_READONLY (decl
)
4794 || TREE_SIDE_EFFECTS (decl
)
4795 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
4797 if (shlib
&& (reloc
& 2))
4798 ret
= SECCAT_DATA_REL
;
4799 else if (shlib
&& reloc
)
4800 ret
= SECCAT_DATA_REL_LOCAL
;
4804 else if (shlib
&& (reloc
& 2))
4805 ret
= SECCAT_DATA_REL_RO
;
4806 else if (shlib
&& reloc
)
4807 ret
= SECCAT_DATA_REL_RO_LOCAL
;
4808 else if (reloc
|| flag_merge_constants
< 2)
4809 /* C and C++ don't allow different variables to share the same
4810 location. -fmerge-all-constants allows even that (at the
4811 expense of not conforming). */
4812 ret
= SECCAT_RODATA
;
4813 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
4814 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
4816 ret
= SECCAT_RODATA_MERGE_CONST
;
4818 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4820 if ((shlib
&& reloc
)
4821 || TREE_SIDE_EFFECTS (decl
)
4822 || ! TREE_CONSTANT (decl
))
4825 ret
= SECCAT_RODATA
;
4828 ret
= SECCAT_RODATA
;
4830 /* There are no read-only thread-local sections. */
4831 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4833 if (ret
== SECCAT_BSS
)
4839 /* If the target uses small data sections, select it. */
4840 else if ((*targetm
.in_small_data_p
) (decl
))
4842 if (ret
== SECCAT_BSS
)
4844 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
4845 ret
= SECCAT_SRODATA
;
4854 decl_readonly_section (tree decl
, int reloc
)
4856 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
4860 decl_readonly_section_1 (tree decl
, int reloc
, int shlib
)
4862 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4865 case SECCAT_RODATA_MERGE_STR
:
4866 case SECCAT_RODATA_MERGE_STR_INIT
:
4867 case SECCAT_RODATA_MERGE_CONST
:
4868 case SECCAT_SRODATA
:
4877 /* Select a section based on the above categorization. */
4880 default_elf_select_section (tree decl
, int reloc
,
4881 unsigned HOST_WIDE_INT align
)
4883 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
4887 default_elf_select_section_1 (tree decl
, int reloc
,
4888 unsigned HOST_WIDE_INT align
, int shlib
)
4890 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4893 /* We're not supposed to be called on FUNCTION_DECLs. */
4896 readonly_data_section ();
4898 case SECCAT_RODATA_MERGE_STR
:
4899 mergeable_string_section (decl
, align
, 0);
4901 case SECCAT_RODATA_MERGE_STR_INIT
:
4902 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
4904 case SECCAT_RODATA_MERGE_CONST
:
4905 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
4907 case SECCAT_SRODATA
:
4908 named_section (NULL_TREE
, ".sdata2", reloc
);
4913 case SECCAT_DATA_REL
:
4914 named_section (NULL_TREE
, ".data.rel", reloc
);
4916 case SECCAT_DATA_REL_LOCAL
:
4917 named_section (NULL_TREE
, ".data.rel.local", reloc
);
4919 case SECCAT_DATA_REL_RO
:
4920 named_section (NULL_TREE
, ".data.rel.ro", reloc
);
4922 case SECCAT_DATA_REL_RO_LOCAL
:
4923 named_section (NULL_TREE
, ".data.rel.ro.local", reloc
);
4926 named_section (NULL_TREE
, ".sdata", reloc
);
4929 named_section (NULL_TREE
, ".tdata", reloc
);
4932 #ifdef BSS_SECTION_ASM_OP
4935 named_section (NULL_TREE
, ".bss", reloc
);
4939 named_section (NULL_TREE
, ".sbss", reloc
);
4942 named_section (NULL_TREE
, ".tbss", reloc
);
4949 /* Construct a unique section name based on the decl name and the
4950 categorization performed above. */
4953 default_unique_section (tree decl
, int reloc
)
4955 default_unique_section_1 (decl
, reloc
, flag_pic
);
4959 default_unique_section_1 (tree decl
, int reloc
, int shlib
)
4961 bool one_only
= DECL_ONE_ONLY (decl
);
4962 const char *prefix
, *name
;
4966 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4969 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
4972 case SECCAT_RODATA_MERGE_STR
:
4973 case SECCAT_RODATA_MERGE_STR_INIT
:
4974 case SECCAT_RODATA_MERGE_CONST
:
4975 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
4977 case SECCAT_SRODATA
:
4978 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
4981 case SECCAT_DATA_REL
:
4982 case SECCAT_DATA_REL_LOCAL
:
4983 case SECCAT_DATA_REL_RO
:
4984 case SECCAT_DATA_REL_RO_LOCAL
:
4985 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
4988 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
4991 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
4994 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
4997 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
5000 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
5005 plen
= strlen (prefix
);
5007 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5008 name
= (* targetm
.strip_name_encoding
) (name
);
5009 nlen
= strlen (name
);
5011 string
= alloca (nlen
+ plen
+ 1);
5012 memcpy (string
, prefix
, plen
);
5013 memcpy (string
+ plen
, name
, nlen
+ 1);
5015 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
5019 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
5021 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
5024 switch (GET_CODE (x
))
5036 readonly_data_section ();
5040 default_elf_select_rtx_section (enum machine_mode mode
, rtx x
,
5041 unsigned HOST_WIDE_INT align
)
5043 /* ??? Handle small data here somehow. */
5046 switch (GET_CODE (x
))
5050 named_section (NULL_TREE
, ".data.rel.ro", 3);
5054 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
5061 mergeable_constant_section (mode
, align
, 0);
5064 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
5067 default_encode_section_info (tree decl
, rtx rtl
, int first ATTRIBUTE_UNUSED
)
5072 /* Careful not to prod global register variables. */
5073 if (GET_CODE (rtl
) != MEM
)
5075 symbol
= XEXP (rtl
, 0);
5076 if (GET_CODE (symbol
) != SYMBOL_REF
)
5080 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5081 flags
|= SYMBOL_FLAG_FUNCTION
;
5082 if ((*targetm
.binds_local_p
) (decl
))
5083 flags
|= SYMBOL_FLAG_LOCAL
;
5084 if ((*targetm
.in_small_data_p
) (decl
))
5085 flags
|= SYMBOL_FLAG_SMALL
;
5086 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5087 flags
|= decl_tls_model (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
5088 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
5089 being PUBLIC, the thing *must* be defined in this translation unit.
5090 Prevent this buglet from being propagated into rtl code as well. */
5091 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
5092 flags
|= SYMBOL_FLAG_EXTERNAL
;
5094 SYMBOL_REF_FLAGS (symbol
) = flags
;
5097 /* By default, we do nothing for encode_section_info, so we need not
5098 do anything but discard the '*' marker. */
5101 default_strip_name_encoding (const char *str
)
5103 return str
+ (*str
== '*');
5106 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5107 wrt cross-module name binding. */
5110 default_binds_local_p (tree exp
)
5112 return default_binds_local_p_1 (exp
, flag_shlib
);
5116 default_binds_local_p_1 (tree exp
, int shlib
)
5120 /* A non-decl is an entry in the constant pool. */
5123 /* Static variables are always local. */
5124 else if (! TREE_PUBLIC (exp
))
5126 /* A variable is local if the user tells us so. */
5127 else if (decl_visibility (exp
) != VISIBILITY_DEFAULT
)
5129 /* Otherwise, variables defined outside this object may not be local. */
5130 else if (DECL_EXTERNAL (exp
))
5132 /* Linkonce and weak data are never local. */
5133 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
5135 /* If PIC, then assume that any global name can be overridden by
5136 symbols resolved from other modules. */
5139 /* Uninitialized COMMON variable may be unified with symbols
5140 resolved from other modules. */
5141 else if (DECL_COMMON (exp
)
5142 && (DECL_INITIAL (exp
) == NULL
5143 || DECL_INITIAL (exp
) == error_mark_node
))
5145 /* Otherwise we're left with initialized (or non-common) global data
5146 which is of necessity defined locally. */
5153 /* Determine whether or not a pointer mode is valid. Assume defaults
5154 of ptr_mode or Pmode - can be overridden. */
5156 default_valid_pointer_mode (enum machine_mode mode
)
5158 return (mode
== ptr_mode
|| mode
== Pmode
);
5161 /* Default function to output code that will globalize a label. A
5162 target must define GLOBAL_ASM_OP or provide it's own function to
5163 globalize a label. */
5164 #ifdef GLOBAL_ASM_OP
5166 default_globalize_label (FILE * stream
, const char *name
)
5168 fputs (GLOBAL_ASM_OP
, stream
);
5169 assemble_name (stream
, name
);
5170 putc ('\n', stream
);
5172 #endif /* GLOBAL_ASM_OP */
5174 /* This is how to output an internal numbered label where PREFIX is
5175 the class of label and LABELNO is the number within the class. */
5178 default_internal_label (FILE *stream
, const char *prefix
,
5179 unsigned long labelno
)
5181 char *const buf
= alloca (40 + strlen (prefix
));
5182 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5183 ASM_OUTPUT_LABEL (stream
, buf
);
5186 /* This is the default behavior at the beginning of a file. It's
5187 controlled by two other target-hook toggles. */
5189 default_file_start (void)
5191 if (targetm
.file_start_app_off
&& !flag_verbose_asm
)
5192 fputs (ASM_APP_OFF
, asm_out_file
);
5194 if (targetm
.file_start_file_directive
)
5195 output_file_directive (asm_out_file
, main_input_filename
);
5198 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5199 which emits a special section directive used to indicate whether or
5200 not this object file needs an executable stack. This is primarily
5201 a GNU extension to ELF but could be used on other targets. */
5203 file_end_indicate_exec_stack (void)
5205 unsigned int flags
= SECTION_DEBUG
;
5206 if (trampolines_created
)
5207 flags
|= SECTION_CODE
;
5209 named_section_flags (".note.GNU-stack", flags
);
5212 #include "gt-varasm.h"