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 /* Carry information from ASM_DECLARE_OBJECT_NAME
118 to ASM_FINISH_DECLARE_OBJECT. */
120 int size_directive_output
;
122 /* The last decl for which assemble_variable was called,
123 if it did ASM_DECLARE_OBJECT_NAME.
124 If the last call to assemble_variable didn't do that,
127 tree last_assemble_variable_decl
;
129 /* RTX_UNCHANGING_P in a MEM can mean it is stored into, for initialization.
130 So giving constant the alias set for the type will allow such
131 initializations to appear to conflict with the load of the constant. We
132 avoid this by giving all constants an alias set for just constants.
133 Since there will be no stores to that alias set, nothing will ever
134 conflict with them. */
136 static HOST_WIDE_INT const_alias_set
;
138 static const char *strip_reg_name (const char *);
139 static int contains_pointers_p (tree
);
140 static void decode_addr_const (tree
, struct addr_const
*);
141 static hashval_t
const_desc_hash (const void *);
142 static int const_desc_eq (const void *, const void *);
143 static hashval_t
const_hash_1 (const tree
);
144 static int compare_constant (const tree
, const tree
);
145 static tree
copy_constant (tree
);
146 static void output_constant_def_contents (rtx
);
147 static void decode_rtx_const (enum machine_mode
, rtx
, struct rtx_const
*);
148 static unsigned int const_hash_rtx (enum machine_mode
, rtx
);
149 static int compare_constant_rtx (enum machine_mode
, rtx
,
150 struct constant_descriptor_rtx
*);
151 static struct constant_descriptor_rtx
* record_constant_rtx
152 (enum machine_mode
, rtx
);
153 static struct pool_constant
*find_pool_constant (struct function
*, rtx
);
154 static void mark_constant_pool (void);
155 static void mark_constants (rtx
);
156 static int mark_constant (rtx
*current_rtx
, void *data
);
157 static int output_addressed_constants (tree
);
158 static unsigned HOST_WIDE_INT
array_size_for_constructor (tree
);
159 static unsigned min_align (unsigned, unsigned);
160 static void output_constructor (tree
, unsigned HOST_WIDE_INT
, unsigned int);
161 static void globalize_decl (tree
);
162 static void maybe_assemble_visibility (tree
);
163 static int in_named_entry_eq (const void *, const void *);
164 static hashval_t
in_named_entry_hash (const void *);
165 #ifdef ASM_OUTPUT_BSS
166 static void asm_output_bss (FILE *, tree
, const char *,
167 unsigned HOST_WIDE_INT
, unsigned HOST_WIDE_INT
);
169 #ifdef BSS_SECTION_ASM_OP
170 #ifdef ASM_OUTPUT_ALIGNED_BSS
171 static void asm_output_aligned_bss (FILE *, tree
, const char *,
172 unsigned HOST_WIDE_INT
, int)
175 #endif /* BSS_SECTION_ASM_OP */
176 static bool asm_emit_uninitialised (tree
, const char*,
177 unsigned HOST_WIDE_INT
,
178 unsigned HOST_WIDE_INT
);
179 static void mark_weak (tree
);
181 enum in_section
{ no_section
, in_text
, in_data
, in_named
182 #ifdef BSS_SECTION_ASM_OP
185 #ifdef CTORS_SECTION_ASM_OP
188 #ifdef DTORS_SECTION_ASM_OP
191 #ifdef READONLY_DATA_SECTION_ASM_OP
194 #ifdef EXTRA_SECTIONS
198 static GTY(()) enum in_section in_section
= no_section
;
200 /* Return a nonzero value if DECL has a section attribute. */
201 #ifndef IN_NAMED_SECTION
202 #define IN_NAMED_SECTION(DECL) \
203 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
204 && DECL_SECTION_NAME (DECL) != NULL_TREE)
207 /* Text of section name when in_section == in_named. */
208 static GTY(()) const char *in_named_name
;
210 /* Hash table of flags that have been used for a particular named section. */
212 struct in_named_entry
GTY(())
219 static GTY((param_is (struct in_named_entry
))) htab_t in_named_htab
;
221 /* Define functions like text_section for any extra sections. */
222 #ifdef EXTRA_SECTION_FUNCTIONS
223 EXTRA_SECTION_FUNCTIONS
226 /* Tell assembler to switch to text section. */
231 if (in_section
!= in_text
)
233 in_section
= in_text
;
237 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
242 /* Tell assembler to switch to data section. */
247 if (in_section
!= in_data
)
249 in_section
= in_data
;
250 if (flag_shared_data
)
252 #ifdef SHARED_SECTION_ASM_OP
253 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
255 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
259 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
263 /* Tell assembler to switch to read-only data section. This is normally
267 readonly_data_section (void)
269 #ifdef READONLY_DATA_SECTION
270 READONLY_DATA_SECTION (); /* Note this can call data_section. */
272 #ifdef READONLY_DATA_SECTION_ASM_OP
273 if (in_section
!= in_readonly_data
)
275 in_section
= in_readonly_data
;
276 fputs (READONLY_DATA_SECTION_ASM_OP
, asm_out_file
);
277 fputc ('\n', asm_out_file
);
285 /* Determine if we're in the text section. */
288 in_text_section (void)
290 return in_section
== in_text
;
293 /* Determine if we're in the data section. */
296 in_data_section (void)
298 return in_section
== in_data
;
301 /* Helper routines for maintaining in_named_htab. */
304 in_named_entry_eq (const void *p1
, const void *p2
)
306 const struct in_named_entry
*old
= p1
;
307 const char *new = p2
;
309 return strcmp (old
->name
, new) == 0;
313 in_named_entry_hash (const void *p
)
315 const struct in_named_entry
*old
= p
;
316 return htab_hash_string (old
->name
);
319 /* If SECTION has been seen before as a named section, return the flags
320 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
321 set of flags for a section to have, so 0 does not mean that the section
322 has not been seen. */
325 get_named_section_flags (const char *section
)
327 struct in_named_entry
**slot
;
329 slot
= (struct in_named_entry
**)
330 htab_find_slot_with_hash (in_named_htab
, section
,
331 htab_hash_string (section
), NO_INSERT
);
333 return slot
? (*slot
)->flags
: 0;
336 /* Returns true if the section has been declared before. Sets internal
337 flag on this section in in_named_hash so subsequent calls on this
338 section will return false. */
341 named_section_first_declaration (const char *name
)
343 struct in_named_entry
**slot
;
345 slot
= (struct in_named_entry
**)
346 htab_find_slot_with_hash (in_named_htab
, name
,
347 htab_hash_string (name
), NO_INSERT
);
348 if (! (*slot
)->declared
)
350 (*slot
)->declared
= true;
360 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
361 different set of flags, return false. */
364 set_named_section_flags (const char *section
, unsigned int flags
)
366 struct in_named_entry
**slot
, *entry
;
368 slot
= (struct in_named_entry
**)
369 htab_find_slot_with_hash (in_named_htab
, section
,
370 htab_hash_string (section
), INSERT
);
375 entry
= ggc_alloc (sizeof (*entry
));
377 entry
->name
= ggc_strdup (section
);
378 entry
->flags
= flags
;
379 entry
->declared
= false;
381 else if (entry
->flags
!= flags
)
387 /* Tell assembler to change to section NAME with attributes FLAGS. */
390 named_section_flags (const char *name
, unsigned int flags
)
392 if (in_section
!= in_named
|| strcmp (name
, in_named_name
) != 0)
394 if (! set_named_section_flags (name
, flags
))
397 (*targetm
.asm_out
.named_section
) (name
, flags
);
399 if (flags
& SECTION_FORGET
)
400 in_section
= no_section
;
403 in_named_name
= ggc_strdup (name
);
404 in_section
= in_named
;
409 /* Tell assembler to change to section NAME for DECL.
410 If DECL is NULL, just switch to section NAME.
411 If NAME is NULL, get the name from DECL.
412 If RELOC is 1, the initializer for DECL contains relocs. */
415 named_section (tree decl
, const char *name
, int reloc
)
419 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
422 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
424 flags
= (* targetm
.section_type_flags
) (decl
, name
, reloc
);
426 /* Sanity check user variables for flag changes. Non-user
427 section flag changes will abort in named_section_flags.
428 However, don't complain if SECTION_OVERRIDE is set.
429 We trust that the setter knows that it is safe to ignore
430 the default flags for this decl. */
431 if (decl
&& ! set_named_section_flags (name
, flags
))
433 flags
= get_named_section_flags (name
);
434 if ((flags
& SECTION_OVERRIDE
) == 0)
435 error ("%J%D causes a section type conflict", decl
, decl
);
438 named_section_flags (name
, flags
);
441 /* If required, set DECL_SECTION_NAME to a unique name. */
444 resolve_unique_section (tree decl
, int reloc ATTRIBUTE_UNUSED
,
445 int flag_function_or_data_sections
)
447 if (DECL_SECTION_NAME (decl
) == NULL_TREE
448 && targetm
.have_named_sections
449 && (flag_function_or_data_sections
450 || DECL_ONE_ONLY (decl
)))
451 (*targetm
.asm_out
.unique_section
) (decl
, reloc
);
454 #ifdef BSS_SECTION_ASM_OP
456 /* Tell the assembler to switch to the bss section. */
461 if (in_section
!= in_bss
)
463 #ifdef SHARED_BSS_SECTION_ASM_OP
464 if (flag_shared_data
)
465 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
468 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
474 #ifdef ASM_OUTPUT_BSS
476 /* Utility function for ASM_OUTPUT_BSS for targets to use if
477 they don't support alignments in .bss.
478 ??? It is believed that this function will work in most cases so such
479 support is localized here. */
482 asm_output_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
484 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
485 unsigned HOST_WIDE_INT rounded
)
487 (*targetm
.asm_out
.globalize_label
) (file
, name
);
489 #ifdef ASM_DECLARE_OBJECT_NAME
490 last_assemble_variable_decl
= decl
;
491 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
493 /* Standard thing is just output label for the object. */
494 ASM_OUTPUT_LABEL (file
, name
);
495 #endif /* ASM_DECLARE_OBJECT_NAME */
496 ASM_OUTPUT_SKIP (file
, rounded
? rounded
: 1);
501 #ifdef ASM_OUTPUT_ALIGNED_BSS
503 /* Utility function for targets to use in implementing
504 ASM_OUTPUT_ALIGNED_BSS.
505 ??? It is believed that this function will work in most cases so such
506 support is localized here. */
509 asm_output_aligned_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
510 const char *name
, unsigned HOST_WIDE_INT size
,
514 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
515 #ifdef ASM_DECLARE_OBJECT_NAME
516 last_assemble_variable_decl
= decl
;
517 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
519 /* Standard thing is just output label for the object. */
520 ASM_OUTPUT_LABEL (file
, name
);
521 #endif /* ASM_DECLARE_OBJECT_NAME */
522 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
527 #endif /* BSS_SECTION_ASM_OP */
529 /* Switch to the section for function DECL.
531 If DECL is NULL_TREE, switch to the text section.
532 ??? It's not clear that we will ever be passed NULL_TREE, but it's
533 safer to handle it. */
536 function_section (tree decl
)
538 if (decl
!= NULL_TREE
539 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
540 named_section (decl
, (char *) 0, 0);
545 /* Switch to section for variable DECL. RELOC is the same as the
546 argument to SELECT_SECTION. */
549 variable_section (tree decl
, int reloc
)
551 if (IN_NAMED_SECTION (decl
))
552 named_section (decl
, NULL
, reloc
);
554 (*targetm
.asm_out
.select_section
) (decl
, reloc
, DECL_ALIGN (decl
));
557 /* Tell assembler to switch to the section for string merging. */
560 mergeable_string_section (tree decl ATTRIBUTE_UNUSED
,
561 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
562 unsigned int flags ATTRIBUTE_UNUSED
)
564 #ifdef HAVE_GAS_SHF_MERGE
565 if (flag_merge_constants
566 && TREE_CODE (decl
) == STRING_CST
567 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
569 && TREE_STRING_LENGTH (decl
) >= int_size_in_bytes (TREE_TYPE (decl
)))
571 enum machine_mode mode
;
572 unsigned int modesize
;
577 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (decl
)));
578 modesize
= GET_MODE_BITSIZE (mode
);
579 if (modesize
>= 8 && modesize
<= 256
580 && (modesize
& (modesize
- 1)) == 0)
582 if (align
< modesize
)
585 str
= TREE_STRING_POINTER (decl
);
586 len
= TREE_STRING_LENGTH (decl
);
587 unit
= GET_MODE_SIZE (mode
);
589 /* Check for embedded NUL characters. */
590 for (i
= 0; i
< len
; i
+= unit
)
592 for (j
= 0; j
< unit
; j
++)
593 if (str
[i
+ j
] != '\0')
600 sprintf (name
, ".rodata.str%d.%d", modesize
/ 8,
602 flags
|= (modesize
/ 8) | SECTION_MERGE
| SECTION_STRINGS
;
603 if (!i
&& modesize
< align
)
605 /* A "" string with requested alignment greater than
606 character size might cause a problem:
607 if some other string required even bigger
608 alignment than "", then linker might think the
609 "" is just part of padding after some other string
610 and not put it into the hash table initially.
611 But this means "" could have smaller alignment
613 #ifdef ASM_OUTPUT_SECTION_START
614 named_section_flags (name
, flags
);
615 ASM_OUTPUT_SECTION_START (asm_out_file
);
617 readonly_data_section ();
622 named_section_flags (name
, flags
);
628 readonly_data_section ();
631 /* Tell assembler to switch to the section for constant merging. */
634 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
635 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
636 unsigned int flags ATTRIBUTE_UNUSED
)
638 #ifdef HAVE_GAS_SHF_MERGE
639 unsigned int modesize
= GET_MODE_BITSIZE (mode
);
641 if (flag_merge_constants
647 && (align
& (align
- 1)) == 0)
651 sprintf (name
, ".rodata.cst%d", (int) (align
/ 8));
652 flags
|= (align
/ 8) | SECTION_MERGE
;
653 named_section_flags (name
, flags
);
657 readonly_data_section ();
660 /* Given NAME, a putative register name, discard any customary prefixes. */
663 strip_reg_name (const char *name
)
665 #ifdef REGISTER_PREFIX
666 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
667 name
+= strlen (REGISTER_PREFIX
);
669 if (name
[0] == '%' || name
[0] == '#')
674 /* Decode an `asm' spec for a declaration as a register name.
675 Return the register number, or -1 if nothing specified,
676 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
677 or -3 if ASMSPEC is `cc' and is not recognized,
678 or -4 if ASMSPEC is `memory' and is not recognized.
679 Accept an exact spelling or a decimal number.
680 Prefixes such as % are optional. */
683 decode_reg_name (const char *asmspec
)
689 /* Get rid of confusing prefixes. */
690 asmspec
= strip_reg_name (asmspec
);
692 /* Allow a decimal number as a "register name". */
693 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
694 if (! ISDIGIT (asmspec
[i
]))
696 if (asmspec
[0] != 0 && i
< 0)
699 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
705 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
707 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
710 #ifdef ADDITIONAL_REGISTER_NAMES
712 static const struct { const char *const name
; const int number
; } table
[]
713 = ADDITIONAL_REGISTER_NAMES
;
715 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
716 if (! strcmp (asmspec
, table
[i
].name
))
717 return table
[i
].number
;
719 #endif /* ADDITIONAL_REGISTER_NAMES */
721 if (!strcmp (asmspec
, "memory"))
724 if (!strcmp (asmspec
, "cc"))
733 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
734 have static storage duration. In other words, it should not be an
735 automatic variable, including PARM_DECLs.
737 There is, however, one exception: this function handles variables
738 explicitly placed in a particular register by the user.
740 ASMSPEC, if not 0, is the string which the user specified as the
741 assembler symbol name.
743 This is never called for PARM_DECL nodes. */
746 make_decl_rtl (tree decl
, const char *asmspec
)
748 const char *name
= 0;
752 /* Check that we are not being given an automatic variable. */
753 /* A weak alias has TREE_PUBLIC set but not the other bits. */
754 if (TREE_CODE (decl
) == PARM_DECL
755 || TREE_CODE (decl
) == RESULT_DECL
756 || (TREE_CODE (decl
) == VAR_DECL
757 && !TREE_STATIC (decl
)
758 && !TREE_PUBLIC (decl
)
759 && !DECL_EXTERNAL (decl
)
760 && !DECL_REGISTER (decl
)))
762 /* And that we were not given a type or a label. */
763 else if (TREE_CODE (decl
) == TYPE_DECL
764 || TREE_CODE (decl
) == LABEL_DECL
)
767 /* For a duplicate declaration, we can be called twice on the
768 same DECL node. Don't discard the RTL already made. */
769 if (DECL_RTL_SET_P (decl
))
771 /* If the old RTL had the wrong mode, fix the mode. */
772 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
773 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
774 DECL_MODE (decl
), 0));
776 /* ??? Another way to do this would be to maintain a hashed
777 table of such critters. Instead of adding stuff to a DECL
778 to give certain attributes to it, we could use an external
779 hash map from DECL to set of attributes. */
781 /* Let the target reassign the RTL if it wants.
782 This is necessary, for example, when one machine specific
783 decl attribute overrides another. */
784 (* targetm
.encode_section_info
) (decl
, DECL_RTL (decl
), false);
788 reg_number
= decode_reg_name (asmspec
);
789 if (reg_number
== -2)
791 /* ASMSPEC is given, and not the name of a register. Mark the
792 name with a star so assemble_name won't munge it. */
793 char *starred
= alloca (strlen (asmspec
) + 2);
795 strcpy (starred
+ 1, asmspec
);
796 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (starred
));
799 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
801 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
803 /* First detect errors in declaring global registers. */
804 if (reg_number
== -1)
805 error ("%Jregister name not specified for '%D'", decl
, decl
);
806 else if (reg_number
< 0)
807 error ("%Jinvalid register name for '%D'", decl
, decl
);
808 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
809 error ("%Jdata type of '%D' isn't suitable for a register",
811 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
812 error ("%Jregister specified for '%D' isn't suitable for data type",
814 /* Now handle properly declared static register variables. */
819 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
821 DECL_INITIAL (decl
) = 0;
822 error ("global register variable has initial value");
824 if (TREE_THIS_VOLATILE (decl
))
825 warning ("volatile register variables don't work as you might wish");
827 /* If the user specified one of the eliminables registers here,
828 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
829 confused with that register and be eliminated. This usage is
830 somewhat suspect... */
832 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
833 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
834 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
836 if (TREE_STATIC (decl
))
838 /* Make this register global, so not usable for anything
840 #ifdef ASM_DECLARE_REGISTER_GLOBAL
841 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
843 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
845 globalize_reg (reg_number
+ --nregs
);
848 /* As a register variable, it has no section. */
853 /* Now handle ordinary static variables and functions (in memory).
854 Also handle vars declared register invalidly. */
856 if (reg_number
>= 0 || reg_number
== -3)
857 error ("%Jregister name given for non-register variable '%D'", decl
, decl
);
859 /* Specifying a section attribute on a variable forces it into a
860 non-.bss section, and thus it cannot be common. */
861 if (TREE_CODE (decl
) == VAR_DECL
862 && DECL_SECTION_NAME (decl
) != NULL_TREE
863 && DECL_INITIAL (decl
) == NULL_TREE
864 && DECL_COMMON (decl
))
865 DECL_COMMON (decl
) = 0;
867 /* Variables can't be both common and weak. */
868 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
869 DECL_COMMON (decl
) = 0;
871 x
= gen_rtx_SYMBOL_REF (Pmode
, name
);
872 SYMBOL_REF_WEAK (x
) = DECL_WEAK (decl
);
873 SYMBOL_REF_DECL (x
) = decl
;
875 x
= gen_rtx_MEM (DECL_MODE (decl
), x
);
876 if (TREE_CODE (decl
) != FUNCTION_DECL
)
877 set_mem_attributes (x
, decl
, 1);
878 SET_DECL_RTL (decl
, x
);
880 /* Optionally set flags or add text to the name to record information
881 such as that it is a function name.
882 If the name is changed, the macro ASM_OUTPUT_LABELREF
883 will have to know how to strip this information. */
884 (* targetm
.encode_section_info
) (decl
, DECL_RTL (decl
), true);
887 /* Make the rtl for variable VAR be volatile.
888 Use this only for static variables. */
891 make_var_volatile (tree var
)
893 if (GET_CODE (DECL_RTL (var
)) != MEM
)
896 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
899 /* Output a string of literal assembler code
900 for an `asm' keyword used between functions. */
903 assemble_asm (tree string
)
907 if (TREE_CODE (string
) == ADDR_EXPR
)
908 string
= TREE_OPERAND (string
, 0);
910 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
913 /* Record an element in the table of global destructors. SYMBOL is
914 a SYMBOL_REF of the function to be called; PRIORITY is a number
915 between 0 and MAX_INIT_PRIORITY. */
918 default_stabs_asm_out_destructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
920 /* Tell GNU LD that this is part of the static destructor set.
921 This will work for any system that uses stabs, most usefully
923 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
924 assemble_name (asm_out_file
, XSTR (symbol
, 0));
925 fputc ('\n', asm_out_file
);
929 default_named_section_asm_out_destructor (rtx symbol
, int priority
)
931 const char *section
= ".dtors";
934 /* ??? This only works reliably with the GNU linker. */
935 if (priority
!= DEFAULT_INIT_PRIORITY
)
937 sprintf (buf
, ".dtors.%.5u",
938 /* Invert the numbering so the linker puts us in the proper
939 order; constructors are run from right to left, and the
940 linker sorts in increasing order. */
941 MAX_INIT_PRIORITY
- priority
);
945 named_section_flags (section
, SECTION_WRITE
);
946 assemble_align (POINTER_SIZE
);
947 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
950 #ifdef DTORS_SECTION_ASM_OP
954 if (in_section
!= in_dtors
)
956 in_section
= in_dtors
;
957 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
958 fputc ('\n', asm_out_file
);
963 default_dtor_section_asm_out_destructor (rtx symbol
,
964 int priority ATTRIBUTE_UNUSED
)
967 assemble_align (POINTER_SIZE
);
968 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
972 /* Likewise for global constructors. */
975 default_stabs_asm_out_constructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
977 /* Tell GNU LD that this is part of the static destructor set.
978 This will work for any system that uses stabs, most usefully
980 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
981 assemble_name (asm_out_file
, XSTR (symbol
, 0));
982 fputc ('\n', asm_out_file
);
986 default_named_section_asm_out_constructor (rtx symbol
, int priority
)
988 const char *section
= ".ctors";
991 /* ??? This only works reliably with the GNU linker. */
992 if (priority
!= DEFAULT_INIT_PRIORITY
)
994 sprintf (buf
, ".ctors.%.5u",
995 /* Invert the numbering so the linker puts us in the proper
996 order; constructors are run from right to left, and the
997 linker sorts in increasing order. */
998 MAX_INIT_PRIORITY
- priority
);
1002 named_section_flags (section
, SECTION_WRITE
);
1003 assemble_align (POINTER_SIZE
);
1004 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1007 #ifdef CTORS_SECTION_ASM_OP
1009 ctors_section (void)
1011 if (in_section
!= in_ctors
)
1013 in_section
= in_ctors
;
1014 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1015 fputc ('\n', asm_out_file
);
1020 default_ctor_section_asm_out_constructor (rtx symbol
,
1021 int priority ATTRIBUTE_UNUSED
)
1024 assemble_align (POINTER_SIZE
);
1025 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1029 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1030 a nonzero value if the constant pool should be output before the
1031 start of the function, or a zero value if the pool should output
1032 after the end of the function. The default is to put it before the
1035 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1036 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1039 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
1040 to be output to assembler.
1041 Set first_global_object_name and weak_global_object_name as appropriate. */
1044 notice_global_symbol (tree decl
)
1046 if ((!first_global_object_name
|| !weak_global_object_name
)
1047 && TREE_PUBLIC (decl
) && !DECL_COMMON (decl
)
1048 && (TREE_CODE (decl
) == FUNCTION_DECL
1049 || (TREE_CODE (decl
) == VAR_DECL
1050 && (DECL_INITIAL (decl
) != 0
1051 && DECL_INITIAL (decl
) != error_mark_node
))))
1055 rtx decl_rtl
= DECL_RTL (decl
);
1057 p
= (* targetm
.strip_name_encoding
) (XSTR (XEXP (decl_rtl
, 0), 0));
1060 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1061 first_global_object_name
= name
;
1063 weak_global_object_name
= name
;
1067 /* Output assembler code for the constant pool of a function and associated
1068 with defining the name of the function. DECL describes the function.
1069 NAME is the function's name. For the constant pool, we use the current
1070 constant pool data. */
1073 assemble_start_function (tree decl
, const char *fnname
)
1077 /* The following code does not need preprocessing in the assembler. */
1081 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1082 output_constant_pool (fnname
, decl
);
1084 resolve_unique_section (decl
, 0, flag_function_sections
);
1085 function_section (decl
);
1087 /* Tell assembler to move to target machine's alignment for functions. */
1088 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1089 if (align
< force_align_functions_log
)
1090 align
= force_align_functions_log
;
1093 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1096 /* Handle a user-specified function alignment.
1097 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1098 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1099 if (align_functions_log
> align
1100 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1102 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1103 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1104 align_functions_log
, align_functions
- 1);
1106 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1110 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1111 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1114 (*debug_hooks
->begin_function
) (decl
);
1116 /* Make function name accessible from other files, if appropriate. */
1118 if (TREE_PUBLIC (decl
))
1120 notice_global_symbol (decl
);
1122 globalize_decl (decl
);
1124 maybe_assemble_visibility (decl
);
1127 /* Do any machine/system dependent processing of the function name */
1128 #ifdef ASM_DECLARE_FUNCTION_NAME
1129 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1131 /* Standard thing is just output label for the function. */
1132 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1133 #endif /* ASM_DECLARE_FUNCTION_NAME */
1136 /* Output assembler code associated with defining the size of the
1137 function. DECL describes the function. NAME is the function's name. */
1140 assemble_end_function (tree decl
, const char *fnname
)
1142 #ifdef ASM_DECLARE_FUNCTION_SIZE
1143 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1145 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1147 output_constant_pool (fnname
, decl
);
1148 function_section (decl
); /* need to switch back */
1152 /* Assemble code to leave SIZE bytes of zeros. */
1155 assemble_zeros (unsigned HOST_WIDE_INT size
)
1157 /* Do no output if -fsyntax-only. */
1158 if (flag_syntax_only
)
1161 #ifdef ASM_NO_SKIP_IN_TEXT
1162 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1163 so we must output 0s explicitly in the text section. */
1164 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1166 unsigned HOST_WIDE_INT i
;
1167 for (i
= 0; i
< size
; i
++)
1168 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1173 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1176 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1179 assemble_align (int align
)
1181 if (align
> BITS_PER_UNIT
)
1183 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1187 /* Assemble a string constant with the specified C string as contents. */
1190 assemble_string (const char *p
, int size
)
1195 /* If the string is very long, split it up. */
1199 int thissize
= size
- pos
;
1200 if (thissize
> maximum
)
1203 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1211 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1212 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1213 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1215 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1216 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1217 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1219 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1220 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1224 #if defined ASM_OUTPUT_ALIGNED_BSS
1225 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1226 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1228 #if defined ASM_OUTPUT_BSS
1229 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1230 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1236 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1237 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1238 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1240 #if defined ASM_OUTPUT_ALIGNED_COMMON
1241 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1242 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1244 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1245 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1250 asm_emit_uninitialised (tree decl
, const char *name
,
1251 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
1252 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
)
1260 destination
= asm_dest_local
;
1262 /* ??? We should handle .bss via select_section mechanisms rather than
1263 via special target hooks. That would eliminate this special case. */
1264 if (TREE_PUBLIC (decl
))
1266 if (!DECL_COMMON (decl
))
1268 destination
= asm_dest_bss
;
1273 destination
= asm_dest_common
;
1276 if (destination
== asm_dest_bss
)
1277 globalize_decl (decl
);
1278 resolve_unique_section (decl
, 0, flag_data_sections
);
1280 if (flag_shared_data
)
1282 switch (destination
)
1284 #ifdef ASM_OUTPUT_SHARED_BSS
1286 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1289 #ifdef ASM_OUTPUT_SHARED_COMMON
1290 case asm_dest_common
:
1291 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1294 #ifdef ASM_OUTPUT_SHARED_LOCAL
1295 case asm_dest_local
:
1296 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1304 switch (destination
)
1308 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1311 case asm_dest_common
:
1312 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1314 case asm_dest_local
:
1315 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1324 /* Assemble everything that is needed for a variable or function declaration.
1325 Not used for automatic variables, and not used for function definitions.
1326 Should not be called for variables of incomplete structure type.
1328 TOP_LEVEL is nonzero if this variable has file scope.
1329 AT_END is nonzero if this is the special handling, at end of compilation,
1330 to define things that have had only tentative definitions.
1331 DONT_OUTPUT_DATA if nonzero means don't actually output the
1332 initial value (that will be done by the caller). */
1335 assemble_variable (tree decl
, int top_level ATTRIBUTE_UNUSED
,
1336 int at_end ATTRIBUTE_UNUSED
, int dont_output_data
)
1343 if (lang_hooks
.decls
.prepare_assemble_variable
)
1344 (*lang_hooks
.decls
.prepare_assemble_variable
) (decl
);
1346 last_assemble_variable_decl
= 0;
1348 /* Normally no need to say anything here for external references,
1349 since assemble_external is called by the language-specific code
1350 when a declaration is first seen. */
1352 if (DECL_EXTERNAL (decl
))
1355 /* Output no assembler code for a function declaration.
1356 Only definitions of functions output anything. */
1358 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1361 /* Do nothing for global register variables. */
1362 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1364 TREE_ASM_WRITTEN (decl
) = 1;
1368 /* If type was incomplete when the variable was declared,
1369 see if it is complete now. */
1371 if (DECL_SIZE (decl
) == 0)
1372 layout_decl (decl
, 0);
1374 /* Still incomplete => don't allocate it; treat the tentative defn
1375 (which is what it must have been) as an `extern' reference. */
1377 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1379 error ("%Jstorage size of `%D' isn't known", decl
, decl
);
1380 TREE_ASM_WRITTEN (decl
) = 1;
1384 /* The first declaration of a variable that comes through this function
1385 decides whether it is global (in C, has external linkage)
1386 or local (in C, has internal linkage). So do nothing more
1387 if this function has already run. */
1389 if (TREE_ASM_WRITTEN (decl
))
1392 /* Make sure targetm.encode_section_info is invoked before we set
1394 decl_rtl
= DECL_RTL (decl
);
1396 TREE_ASM_WRITTEN (decl
) = 1;
1398 /* Do no output if -fsyntax-only. */
1399 if (flag_syntax_only
)
1404 if (! dont_output_data
1405 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1407 error ("%Jsize of variable '%D' is too large", decl
, decl
);
1411 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1412 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1413 notice_global_symbol (decl
);
1415 /* Compute the alignment of this data. */
1417 align
= DECL_ALIGN (decl
);
1419 /* In the case for initialing an array whose length isn't specified,
1420 where we have not yet been able to do the layout,
1421 figure out the proper alignment now. */
1422 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1423 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1424 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1426 /* Some object file formats have a maximum alignment which they support.
1427 In particular, a.out format supports a maximum alignment of 4. */
1428 #ifndef MAX_OFILE_ALIGNMENT
1429 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1431 if (align
> MAX_OFILE_ALIGNMENT
)
1433 warning ("%Jalignment of '%D' is greater than maximum object "
1434 "file alignment. Using %d", decl
, decl
,
1435 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1436 align
= MAX_OFILE_ALIGNMENT
;
1439 /* On some machines, it is good to increase alignment sometimes. */
1440 if (! DECL_USER_ALIGN (decl
))
1442 #ifdef DATA_ALIGNMENT
1443 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1445 #ifdef CONSTANT_ALIGNMENT
1446 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1447 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1451 /* Reset the alignment in case we have made it tighter, so we can benefit
1452 from it in get_pointer_alignment. */
1453 DECL_ALIGN (decl
) = align
;
1454 set_mem_align (decl_rtl
, align
);
1456 if (TREE_PUBLIC (decl
))
1457 maybe_assemble_visibility (decl
);
1459 /* Output any data that we will need to use the address of. */
1460 if (DECL_INITIAL (decl
) == error_mark_node
)
1461 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1462 else if (DECL_INITIAL (decl
))
1463 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1464 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1466 /* Handle uninitialized definitions. */
1468 /* If the decl has been given an explicit section name, then it
1469 isn't common, and shouldn't be handled as such. */
1470 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1472 /* We don't implement common thread-local data at present. */
1473 else if (DECL_THREAD_LOCAL (decl
))
1475 if (DECL_COMMON (decl
))
1476 sorry ("thread-local COMMON data not implemented");
1478 else if (DECL_INITIAL (decl
) == 0
1479 || DECL_INITIAL (decl
) == error_mark_node
1480 || (flag_zero_initialized_in_bss
1481 /* Leave constant zeroes in .rodata so they can be shared. */
1482 && !TREE_READONLY (decl
)
1483 && initializer_zerop (DECL_INITIAL (decl
))))
1485 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1486 unsigned HOST_WIDE_INT rounded
= size
;
1488 /* Don't allocate zero bytes of common,
1489 since that means "undefined external" in the linker. */
1493 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1494 so that each uninitialized object starts on such a boundary. */
1495 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1496 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1497 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1499 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1500 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1501 warning ("%Jrequested alignment for '%D' is greater than "
1502 "implemented alignment of %d", decl
, decl
, rounded
);
1505 /* If the target cannot output uninitialized but not common global data
1506 in .bss, then we have to use .data, so fall through. */
1507 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1511 /* Handle initialized definitions.
1512 Also handle uninitialized global definitions if -fno-common and the
1513 target doesn't support ASM_OUTPUT_BSS. */
1515 /* First make the assembler name(s) global if appropriate. */
1516 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1517 globalize_decl (decl
);
1519 /* Switch to the appropriate section. */
1520 variable_section (decl
, reloc
);
1522 /* dbxout.c needs to know this. */
1523 if (in_text_section ())
1524 DECL_IN_TEXT_SECTION (decl
) = 1;
1526 /* Output the alignment of this data. */
1527 if (align
> BITS_PER_UNIT
)
1529 ASM_OUTPUT_ALIGN (asm_out_file
,
1530 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1533 /* Do any machine/system dependent processing of the object. */
1534 #ifdef ASM_DECLARE_OBJECT_NAME
1535 last_assemble_variable_decl
= decl
;
1536 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1538 /* Standard thing is just output label for the object. */
1539 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1540 #endif /* ASM_DECLARE_OBJECT_NAME */
1542 if (!dont_output_data
)
1544 if (DECL_INITIAL (decl
) && DECL_INITIAL (decl
) != error_mark_node
)
1545 /* Output the actual data. */
1546 output_constant (DECL_INITIAL (decl
),
1547 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1550 /* Leave space for it. */
1551 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1555 /* Return 1 if type TYPE contains any pointers. */
1558 contains_pointers_p (tree type
)
1560 switch (TREE_CODE (type
))
1563 case REFERENCE_TYPE
:
1564 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1565 so I'll play safe and return 1. */
1571 case QUAL_UNION_TYPE
:
1574 /* For a type that has fields, see if the fields have pointers. */
1575 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1576 if (TREE_CODE (fields
) == FIELD_DECL
1577 && contains_pointers_p (TREE_TYPE (fields
)))
1583 /* An array type contains pointers if its element type does. */
1584 return contains_pointers_p (TREE_TYPE (type
));
1591 /* Output something to declare an external symbol to the assembler.
1592 (Most assemblers don't need this, so we normally output nothing.)
1593 Do nothing if DECL is not external. */
1596 assemble_external (tree decl ATTRIBUTE_UNUSED
)
1598 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1599 main body of this code is only rarely exercised. To provide some
1600 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1601 open. If it's not, we should not be calling this function. */
1605 #ifdef ASM_OUTPUT_EXTERNAL
1606 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1608 rtx rtl
= DECL_RTL (decl
);
1610 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1611 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1613 /* Some systems do require some output. */
1614 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1615 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1621 /* Similar, for calling a library function FUN. */
1624 assemble_external_libcall (rtx fun
)
1626 /* Declare library function name external when first used, if nec. */
1627 if (! SYMBOL_REF_USED (fun
))
1629 SYMBOL_REF_USED (fun
) = 1;
1630 (*targetm
.asm_out
.external_libcall
) (fun
);
1634 /* Assemble a label named NAME. */
1637 assemble_label (const char *name
)
1639 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1642 /* Set the symbol_referenced flag for ID and notify callgraph code. */
1644 mark_referenced (tree id
)
1646 if (!TREE_SYMBOL_REFERENCED (id
))
1648 struct cgraph_node
*node
;
1649 struct cgraph_varpool_node
*vnode
;
1651 if (!cgraph_global_info_ready
)
1653 node
= cgraph_node_for_identifier (id
);
1655 cgraph_mark_needed_node (node
);
1658 vnode
= cgraph_varpool_node_for_identifier (id
);
1660 cgraph_varpool_mark_needed_node (vnode
);
1662 TREE_SYMBOL_REFERENCED (id
) = 1;
1665 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1666 If NAME starts with a *, the rest of NAME is output verbatim.
1667 Otherwise NAME is transformed in an implementation-defined way
1668 (usually by the addition of an underscore).
1669 Many macros in the tm file are defined to call this function. */
1672 assemble_name (FILE *file
, const char *name
)
1674 const char *real_name
;
1677 real_name
= (* targetm
.strip_name_encoding
) (name
);
1679 id
= maybe_get_identifier (real_name
);
1681 mark_referenced (id
);
1684 fputs (&name
[1], file
);
1686 ASM_OUTPUT_LABELREF (file
, name
);
1689 /* Allocate SIZE bytes writable static space with a gensym name
1690 and return an RTX to refer to its address. */
1693 assemble_static_space (unsigned HOST_WIDE_INT size
)
1696 const char *namestring
;
1700 if (flag_shared_data
)
1704 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1706 namestring
= ggc_strdup (name
);
1708 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1709 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
1711 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1712 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1715 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1716 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1719 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1720 so that each uninitialized object starts on such a boundary. */
1721 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1722 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1723 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1724 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1725 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1726 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1733 /* Assemble the static constant template for function entry trampolines.
1734 This is done at most once per compilation.
1735 Returns an RTX for the address of the template. */
1737 #ifdef TRAMPOLINE_TEMPLATE
1739 assemble_trampoline_template (void)
1746 /* By default, put trampoline templates in read-only data section. */
1748 #ifdef TRAMPOLINE_SECTION
1749 TRAMPOLINE_SECTION ();
1751 readonly_data_section ();
1754 /* Write the assembler code to define one. */
1755 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1758 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1761 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LTRAMP", 0);
1762 TRAMPOLINE_TEMPLATE (asm_out_file
);
1764 /* Record the rtl to refer to it. */
1765 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1766 name
= ggc_strdup (label
);
1767 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
1768 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
1774 /* A and B are either alignments or offsets. Return the minimum alignment
1775 that may be assumed after adding the two together. */
1777 static inline unsigned
1778 min_align (unsigned int a
, unsigned int b
)
1780 return (a
| b
) & -(a
| b
);
1783 /* Return the assembler directive for creating a given kind of integer
1784 object. SIZE is the number of bytes in the object and ALIGNED_P
1785 indicates whether it is known to be aligned. Return NULL if the
1786 assembly dialect has no such directive.
1788 The returned string should be printed at the start of a new line and
1789 be followed immediately by the object's initial value. */
1792 integer_asm_op (int size
, int aligned_p
)
1794 struct asm_int_op
*ops
;
1797 ops
= &targetm
.asm_out
.aligned_op
;
1799 ops
= &targetm
.asm_out
.unaligned_op
;
1804 return targetm
.asm_out
.byte_op
;
1818 /* Use directive OP to assemble an integer object X. Print OP at the
1819 start of the line, followed immediately by the value of X. */
1822 assemble_integer_with_op (const char *op
, rtx x
)
1824 fputs (op
, asm_out_file
);
1825 output_addr_const (asm_out_file
, x
);
1826 fputc ('\n', asm_out_file
);
1829 /* The default implementation of the asm_out.integer target hook. */
1832 default_assemble_integer (rtx x ATTRIBUTE_UNUSED
,
1833 unsigned int size ATTRIBUTE_UNUSED
,
1834 int aligned_p ATTRIBUTE_UNUSED
)
1836 const char *op
= integer_asm_op (size
, aligned_p
);
1837 return op
&& (assemble_integer_with_op (op
, x
), true);
1840 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1841 the alignment of the integer in bits. Return 1 if we were able to output
1842 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1846 assemble_integer (rtx x
, unsigned int size
, unsigned int align
, int force
)
1850 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
1852 /* See if the target hook can handle this kind of object. */
1853 if ((*targetm
.asm_out
.integer
) (x
, size
, aligned_p
))
1856 /* If the object is a multi-byte one, try splitting it up. Split
1857 it into words it if is multi-word, otherwise split it into bytes. */
1860 enum machine_mode omode
, imode
;
1861 unsigned int subalign
;
1862 unsigned int subsize
, i
;
1864 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
1865 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
1866 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
1867 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1869 for (i
= 0; i
< size
; i
+= subsize
)
1871 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
1872 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
1878 /* If we've printed some of it, but not all of it, there's no going
1891 assemble_real (REAL_VALUE_TYPE d
, enum machine_mode mode
, unsigned int align
)
1895 unsigned int nalign
= min_align (align
, 32);
1897 switch (BITS_PER_UNIT
)
1903 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1904 assemble_integer (GEN_INT (l
), 4, align
, 1);
1907 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1908 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1909 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1912 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
1913 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1914 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1915 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
1918 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
1919 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1920 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1921 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
1922 assemble_integer (GEN_INT (data
[3]), 4, nalign
, 1);
1933 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1934 assemble_integer (GEN_INT (l
), 2, align
, 1);
1937 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1938 assemble_integer (GEN_INT (data
[0]), 2, align
, 1);
1939 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
1950 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1951 assemble_integer (GEN_INT (l
), 1, align
, 1);
1954 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1955 assemble_integer (GEN_INT (data
[0]), 1, align
, 1);
1956 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
1968 /* Given an expression EXP with a constant value,
1969 reduce it to the sum of an assembler symbol and an integer.
1970 Store them both in the structure *VALUE.
1971 Abort if EXP does not reduce. */
1973 struct addr_const
GTY(())
1976 HOST_WIDE_INT offset
;
1980 decode_addr_const (tree exp
, struct addr_const
*value
)
1982 tree target
= TREE_OPERAND (exp
, 0);
1988 if (TREE_CODE (target
) == COMPONENT_REF
1989 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
1992 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
1993 target
= TREE_OPERAND (target
, 0);
1995 else if (TREE_CODE (target
) == ARRAY_REF
1996 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
1998 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
1999 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2000 target
= TREE_OPERAND (target
, 0);
2006 switch (TREE_CODE (target
))
2010 x
= DECL_RTL (target
);
2014 x
= gen_rtx_MEM (FUNCTION_MODE
,
2015 gen_rtx_LABEL_REF (VOIDmode
, force_label_rtx (target
)));
2023 x
= output_constant_def (target
, 1);
2030 if (GET_CODE (x
) != MEM
)
2035 value
->offset
= offset
;
2038 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2039 enum kind
{ RTX_UNKNOWN
, RTX_DOUBLE
, RTX_VECTOR
, RTX_INT
, RTX_UNSPEC
};
2040 struct rtx_const
GTY(())
2042 ENUM_BITFIELD(kind
) kind
: 16;
2043 ENUM_BITFIELD(machine_mode
) mode
: 16;
2044 union rtx_const_un
{
2045 REAL_VALUE_TYPE
GTY ((tag ("4"))) du
;
2046 struct rtx_const_u_addr
{
2049 HOST_WIDE_INT offset
;
2050 } GTY ((tag ("1"))) addr
;
2051 struct rtx_const_u_di
{
2054 } GTY ((tag ("0"))) di
;
2056 /* The max vector size we have is 16 wide; two variants for
2057 integral and floating point vectors. */
2058 struct rtx_const_int_vec
{
2061 } GTY ((tag ("2"))) int_vec
[16];
2063 REAL_VALUE_TYPE
GTY ((tag ("3"))) fp_vec
[8];
2065 } GTY ((desc ("%1.kind >= RTX_INT"), descbits ("1"))) un
;
2068 /* Uniquize all constants that appear in memory.
2069 Each constant in memory thus far output is recorded
2070 in `const_hash_table'. */
2072 struct constant_descriptor_tree
GTY(())
2074 /* A MEM for the constant. */
2077 /* The value of the constant. */
2081 static GTY((param_is (struct constant_descriptor_tree
)))
2082 htab_t const_desc_htab
;
2084 static struct constant_descriptor_tree
* build_constant_desc (tree
);
2085 static void maybe_output_constant_def_contents (struct constant_descriptor_tree
*, int);
2087 /* Compute a hash code for a constant expression. */
2090 const_desc_hash (const void *ptr
)
2092 return const_hash_1 (((struct constant_descriptor_tree
*)ptr
)->value
);
2096 const_hash_1 (const tree exp
)
2101 enum tree_code code
= TREE_CODE (exp
);
2103 /* Either set P and LEN to the address and len of something to hash and
2104 exit the switch or return a value. */
2109 p
= (char *) &TREE_INT_CST (exp
);
2110 len
= sizeof TREE_INT_CST (exp
);
2114 return real_hash (TREE_REAL_CST_PTR (exp
));
2117 p
= TREE_STRING_POINTER (exp
);
2118 len
= TREE_STRING_LENGTH (exp
);
2121 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2122 + const_hash_1 (TREE_IMAGPART (exp
)));
2125 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2129 len
= int_size_in_bytes (TREE_TYPE (exp
));
2131 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2139 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2141 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2142 if (TREE_VALUE (link
))
2143 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2151 struct addr_const value
;
2153 decode_addr_const (exp
, &value
);
2154 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2156 /* Don't hash the address of the SYMBOL_REF;
2157 only use the offset and the symbol name. */
2159 p
= XSTR (value
.base
, 0);
2160 for (i
= 0; p
[i
] != 0; i
++)
2161 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2163 else if (GET_CODE (value
.base
) == LABEL_REF
)
2164 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2172 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2173 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2177 case NON_LVALUE_EXPR
:
2178 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2181 /* A language specific constant. Just hash the code. */
2185 /* Compute hashing function. */
2187 for (i
= 0; i
< len
; i
++)
2188 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2193 /* Wrapper of compare_constant, for the htab interface. */
2195 const_desc_eq (const void *p1
, const void *p2
)
2197 return compare_constant (((struct constant_descriptor_tree
*)p1
)->value
,
2198 ((struct constant_descriptor_tree
*)p2
)->value
);
2201 /* Compare t1 and t2, and return 1 only if they are known to result in
2202 the same bit pattern on output. */
2205 compare_constant (const tree t1
, const tree t2
)
2207 enum tree_code typecode
;
2209 if (t1
== NULL_TREE
)
2210 return t2
== NULL_TREE
;
2211 if (t2
== NULL_TREE
)
2214 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2217 switch (TREE_CODE (t1
))
2220 /* Integer constants are the same only if the same width of type. */
2221 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2223 return tree_int_cst_equal (t1
, t2
);
2226 /* Real constants are the same only if the same width of type. */
2227 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2230 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2233 if (flag_writable_strings
)
2236 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2239 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2240 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2241 TREE_STRING_LENGTH (t1
)));
2244 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2245 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2248 typecode
= TREE_CODE (TREE_TYPE (t1
));
2249 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2252 if (typecode
== SET_TYPE
)
2254 int len
= int_size_in_bytes (TREE_TYPE (t2
));
2255 unsigned char *tmp1
, *tmp2
;
2257 if (int_size_in_bytes (TREE_TYPE (t1
)) != len
)
2260 tmp1
= alloca (len
);
2261 tmp2
= alloca (len
);
2263 if (get_set_constructor_bytes (t1
, tmp1
, len
) != NULL_TREE
)
2265 if (get_set_constructor_bytes (t2
, tmp2
, len
) != NULL_TREE
)
2268 return memcmp (tmp1
, tmp2
, len
) != 0;
2274 if (typecode
== ARRAY_TYPE
)
2276 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2277 /* For arrays, check that the sizes all match. */
2278 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2280 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2285 /* For record and union constructors, require exact type
2287 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2291 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2293 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2295 /* Check that each value is the same... */
2296 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2298 /* ... and that they apply to the same fields! */
2299 if (typecode
== ARRAY_TYPE
)
2301 if (! compare_constant (TREE_PURPOSE (l1
),
2307 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2312 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2318 struct addr_const value1
, value2
;
2320 decode_addr_const (t1
, &value1
);
2321 decode_addr_const (t2
, &value2
);
2322 return (value1
.offset
== value2
.offset
2323 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2329 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2330 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2334 case NON_LVALUE_EXPR
:
2335 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2340 nt1
= (*lang_hooks
.expand_constant
) (t1
);
2341 nt2
= (*lang_hooks
.expand_constant
) (t2
);
2342 if (nt1
!= t1
|| nt2
!= t2
)
2343 return compare_constant (nt1
, nt2
);
2349 /* Should not get here. */
2353 /* Make a copy of the whole tree structure for a constant. This
2354 handles the same types of nodes that compare_constant handles. */
2357 copy_constant (tree exp
)
2359 switch (TREE_CODE (exp
))
2362 /* For ADDR_EXPR, we do not want to copy the decl whose address
2363 is requested. We do want to copy constants though. */
2364 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2365 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2366 copy_constant (TREE_OPERAND (exp
, 0)));
2368 return copy_node (exp
);
2373 return copy_node (exp
);
2376 return build_complex (TREE_TYPE (exp
),
2377 copy_constant (TREE_REALPART (exp
)),
2378 copy_constant (TREE_IMAGPART (exp
)));
2382 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2383 copy_constant (TREE_OPERAND (exp
, 0)),
2384 copy_constant (TREE_OPERAND (exp
, 1)));
2388 case NON_LVALUE_EXPR
:
2389 case VIEW_CONVERT_EXPR
:
2390 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2391 copy_constant (TREE_OPERAND (exp
, 0)));
2395 tree copy
= copy_node (exp
);
2396 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2399 CONSTRUCTOR_ELTS (copy
) = list
;
2400 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2401 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2402 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2403 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2404 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2412 t
= (*lang_hooks
.expand_constant
) (exp
);
2414 return copy_constant (t
);
2421 /* Subroutine of output_constant_def:
2422 No constant equal to EXP is known to have been output.
2423 Make a constant descriptor to enter EXP in the hash table.
2424 Assign the label number and construct RTL to refer to the
2425 constant's location in memory.
2426 Caller is responsible for updating the hash table. */
2428 static struct constant_descriptor_tree
*
2429 build_constant_desc (tree exp
)
2435 struct constant_descriptor_tree
*desc
;
2437 desc
= ggc_alloc (sizeof (*desc
));
2438 desc
->value
= copy_constant (exp
);
2440 /* Create a string containing the label name, in LABEL. */
2441 labelno
= const_labelno
++;
2442 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2444 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2445 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2446 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2447 SYMBOL_REF_DECL (symbol
) = desc
->value
;
2448 TREE_CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2450 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2451 set_mem_attributes (rtl
, exp
, 1);
2452 set_mem_alias_set (rtl
, 0);
2453 set_mem_alias_set (rtl
, const_alias_set
);
2455 /* Set flags or add text to the name to record information, such as
2456 that it is a local symbol. If the name is changed, the macro
2457 ASM_OUTPUT_LABELREF will have to know how to strip this
2458 information. This call might invalidate our local variable
2459 SYMBOL; we can't use it afterward. */
2461 (*targetm
.encode_section_info
) (exp
, rtl
, true);
2468 /* Return an rtx representing a reference to constant data in memory
2469 for the constant expression EXP.
2471 If assembler code for such a constant has already been output,
2472 return an rtx to refer to it.
2473 Otherwise, output such a constant in memory
2474 and generate an rtx for it.
2476 If DEFER is nonzero, this constant can be deferred and output only
2477 if referenced in the function after all optimizations.
2479 The const_hash_table records which constants already have label strings. */
2482 output_constant_def (tree exp
, int defer
)
2484 struct constant_descriptor_tree
*desc
;
2485 struct constant_descriptor_tree key
;
2488 /* Look up EXP in the table of constant descriptors. If we didn't find
2489 it, create a new one. */
2491 loc
= htab_find_slot (const_desc_htab
, &key
, INSERT
);
2496 desc
= build_constant_desc (exp
);
2500 maybe_output_constant_def_contents (desc
, defer
);
2504 /* Subroutine of output_constant_def: Decide whether or not we need to
2505 output the constant DESC now, and if so, do it. */
2507 maybe_output_constant_def_contents (struct constant_descriptor_tree
*desc
,
2510 rtx symbol
= XEXP (desc
->rtl
, 0);
2511 tree exp
= desc
->value
;
2513 if (flag_syntax_only
)
2516 if (TREE_ASM_WRITTEN (exp
))
2517 /* Already output; don't do it again. */
2520 /* The only constants that cannot safely be deferred, assuming the
2521 context allows it, are strings under flag_writable_strings. */
2522 if (defer
&& (TREE_CODE (exp
) != STRING_CST
|| !flag_writable_strings
))
2524 /* Increment n_deferred_constants if it exists. It needs to be at
2525 least as large as the number of constants actually referred to
2526 by the function. If it's too small we'll stop looking too early
2527 and fail to emit constants; if it's too large we'll only look
2528 through the entire function when we could have stopped earlier. */
2530 n_deferred_constants
++;
2534 output_constant_def_contents (symbol
);
2537 /* We must output the constant data referred to by SYMBOL; do so. */
2540 output_constant_def_contents (rtx symbol
)
2542 tree exp
= SYMBOL_REF_DECL (symbol
);
2543 const char *label
= XSTR (symbol
, 0);
2546 /* Make sure any other constants whose addresses appear in EXP
2547 are assigned label numbers. */
2548 int reloc
= output_addressed_constants (exp
);
2550 /* Align the location counter as required by EXP's data type. */
2551 int align
= TYPE_ALIGN (TREE_TYPE (exp
));
2552 #ifdef CONSTANT_ALIGNMENT
2553 align
= CONSTANT_ALIGNMENT (exp
, align
);
2556 /* We are no longer deferring this constant. */
2557 TREE_ASM_WRITTEN (exp
) = 1;
2559 if (IN_NAMED_SECTION (exp
))
2560 named_section (exp
, NULL
, reloc
);
2562 (*targetm
.asm_out
.select_section
) (exp
, reloc
, align
);
2564 if (align
> BITS_PER_UNIT
)
2566 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2569 size
= int_size_in_bytes (TREE_TYPE (exp
));
2570 if (TREE_CODE (exp
) == STRING_CST
)
2571 size
= MAX (TREE_STRING_LENGTH (exp
), size
);
2573 /* Do any machine/system dependent processing of the constant. */
2574 #ifdef ASM_DECLARE_CONSTANT_NAME
2575 ASM_DECLARE_CONSTANT_NAME (asm_out_file
, label
, exp
, size
);
2577 /* Standard thing is just output label for the constant. */
2578 ASM_OUTPUT_LABEL (asm_out_file
, label
);
2579 #endif /* ASM_DECLARE_CONSTANT_NAME */
2581 /* Output the value of EXP. */
2582 output_constant (exp
, size
, align
);
2585 /* A constant which was deferred in its original location has been
2586 inserted by the RTL inliner into a different function. The
2587 current function's deferred constant count must be incremented. */
2589 notice_rtl_inlining_of_deferred_constant (void)
2591 n_deferred_constants
++;
2594 /* Look up EXP in the table of constant descriptors. Return the rtl
2595 if it has been emitted, else null. */
2598 lookup_constant_def (tree exp
)
2600 struct constant_descriptor_tree
*desc
;
2601 struct constant_descriptor_tree key
;
2604 desc
= htab_find (const_desc_htab
, &key
);
2606 return (desc
? desc
->rtl
: NULL_RTX
);
2609 /* Used in the hash tables to avoid outputting the same constant
2610 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2611 are output once per function, not once per file; there seems
2612 to be no reason for the difference. */
2614 struct constant_descriptor_rtx
GTY(())
2616 /* More constant_descriptors with the same hash code. */
2617 struct constant_descriptor_rtx
*next
;
2619 /* A MEM for the constant. */
2622 /* The value of the constant. */
2623 struct rtx_const value
;
2626 /* Structure to represent sufficient information about a constant so that
2627 it can be output when the constant pool is output, so that function
2628 integration can be done, and to simplify handling on machines that reference
2629 constant pool as base+displacement. */
2631 struct pool_constant
GTY(())
2633 struct constant_descriptor_rtx
*desc
;
2634 struct pool_constant
*next
;
2635 struct pool_constant
*next_sym
;
2637 enum machine_mode mode
;
2640 HOST_WIDE_INT offset
;
2644 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2645 The argument is XSTR (... , 0) */
2647 #define SYMHASH(LABEL) (((unsigned long) (LABEL)) % MAX_RTX_HASH_TABLE)
2649 /* Initialize constant pool hashing for a new function. */
2652 init_varasm_status (struct function
*f
)
2654 struct varasm_status
*p
;
2655 p
= ggc_alloc (sizeof (struct varasm_status
));
2657 p
->x_const_rtx_hash_table
2658 = ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2659 * sizeof (struct constant_descriptor_rtx
*));
2660 p
->x_const_rtx_sym_hash_table
2661 = ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2662 * sizeof (struct pool_constant
*));
2664 p
->x_first_pool
= p
->x_last_pool
= 0;
2665 p
->x_pool_offset
= 0;
2666 p
->deferred_constants
= 0;
2670 /* Express an rtx for a constant integer (perhaps symbolic)
2671 as the sum of a symbol or label plus an explicit integer.
2672 They are stored into VALUE. */
2675 decode_rtx_const (enum machine_mode mode
, rtx x
, struct rtx_const
*value
)
2677 /* Clear the whole structure, including any gaps. */
2678 memset (value
, 0, sizeof (struct rtx_const
));
2680 value
->kind
= RTX_INT
; /* Most usual kind. */
2683 switch (GET_CODE (x
))
2686 value
->kind
= RTX_DOUBLE
;
2687 if (GET_MODE (x
) != VOIDmode
)
2689 const REAL_VALUE_TYPE
*r
= CONST_DOUBLE_REAL_VALUE (x
);
2691 value
->mode
= GET_MODE (x
);
2693 /* Copy the REAL_VALUE_TYPE by members so that we don't
2694 copy garbage from the original structure into our
2695 carefully cleaned hashing structure. */
2696 value
->un
.du
.class = r
->class;
2697 value
->un
.du
.sign
= r
->sign
;
2704 value
->un
.du
.exp
= r
->exp
;
2707 memcpy (value
->un
.du
.sig
, r
->sig
, sizeof (r
->sig
));
2715 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
2716 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
2724 units
= CONST_VECTOR_NUNITS (x
);
2725 value
->kind
= RTX_VECTOR
;
2728 if (GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
)
2730 for (i
= 0; i
< units
; ++i
)
2732 rtx elt
= CONST_VECTOR_ELT (x
, i
);
2733 if (GET_CODE (elt
) == CONST_INT
)
2735 value
->un
.int_vec
[i
].low
= INTVAL (elt
);
2736 value
->un
.int_vec
[i
].high
= 0;
2740 value
->un
.int_vec
[i
].low
= CONST_DOUBLE_LOW (elt
);
2741 value
->un
.int_vec
[i
].high
= CONST_DOUBLE_HIGH (elt
);
2745 else if (GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
2747 for (i
= 0; i
< units
; ++i
)
2749 const REAL_VALUE_TYPE
*r
2750 = CONST_DOUBLE_REAL_VALUE (CONST_VECTOR_ELT (x
, i
));
2751 REAL_VALUE_TYPE
*d
= &value
->un
.fp_vec
[i
];
2753 /* Copy the REAL_VALUE_TYPE by members so that we don't
2754 copy garbage from the original structure into our
2755 carefully cleaned hashing structure. */
2756 d
->class = r
->class;
2767 memcpy (d
->sig
, r
->sig
, sizeof (r
->sig
));
2780 value
->un
.addr
.offset
= INTVAL (x
);
2786 value
->un
.addr
.base
= x
;
2791 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
2793 value
->un
.addr
.base
= XEXP (x
, 0);
2794 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
2796 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
2798 value
->un
.addr
.base
= XEXP (x
, 0);
2799 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
2803 value
->un
.addr
.base
= x
;
2804 value
->un
.addr
.offset
= 0;
2809 value
->kind
= RTX_UNKNOWN
;
2813 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0
2814 && GET_CODE (value
->un
.addr
.base
) == UNSPEC
)
2816 /* For a simple UNSPEC, the base is set to the
2817 operand, the kind field is set to the index of
2818 the unspec expression.
2819 Together with the code below, in case that
2820 the operand is a SYMBOL_REF or LABEL_REF,
2821 the address of the string or the code_label
2822 is taken as base. */
2823 if (XVECLEN (value
->un
.addr
.base
, 0) == 1)
2825 value
->kind
= RTX_UNSPEC
+ XINT (value
->un
.addr
.base
, 1);
2826 value
->un
.addr
.base
= XVECEXP (value
->un
.addr
.base
, 0, 0);
2830 if (value
->kind
>= RTX_INT
&& value
->un
.addr
.base
!= 0)
2831 switch (GET_CODE (value
->un
.addr
.base
))
2834 /* Use the string's address, not the SYMBOL_REF's address,
2835 for the sake of addresses of library routines. */
2836 value
->un
.addr
.symbol
= XSTR (value
->un
.addr
.base
, 0);
2837 value
->un
.addr
.base
= NULL_RTX
;
2841 /* For a LABEL_REF, compare labels. */
2842 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
2849 /* Given a MINUS expression, simplify it if both sides
2850 include the same symbol. */
2853 simplify_subtraction (rtx x
)
2855 struct rtx_const val0
, val1
;
2857 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
2858 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
2860 if (val0
.kind
>= RTX_INT
2861 && val0
.kind
== val1
.kind
2862 && val0
.un
.addr
.base
== val1
.un
.addr
.base
2863 && val0
.un
.addr
.symbol
== val1
.un
.addr
.symbol
)
2864 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
2869 /* Compute a hash code for a constant RTL expression. */
2872 const_hash_rtx (enum machine_mode mode
, rtx x
)
2875 struct rtx_const value
;
2876 unsigned int data
[sizeof(struct rtx_const
) / sizeof (unsigned int)];
2882 decode_rtx_const (mode
, x
, &u
.value
);
2884 /* Compute hashing function. */
2886 for (i
= 0; i
< ARRAY_SIZE (u
.data
); i
++)
2887 hi
= hi
* 613 + u
.data
[i
];
2889 return hi
% MAX_RTX_HASH_TABLE
;
2892 /* Compare a constant rtl object X with a constant-descriptor DESC.
2893 Return 1 if DESC describes a constant with the same value as X. */
2896 compare_constant_rtx (enum machine_mode mode
, rtx x
,
2897 struct constant_descriptor_rtx
*desc
)
2899 struct rtx_const value
;
2901 decode_rtx_const (mode
, x
, &value
);
2903 /* Compare constant contents. */
2904 return memcmp (&value
, &desc
->value
, sizeof (struct rtx_const
)) == 0;
2907 /* Construct a constant descriptor for the rtl-expression X.
2908 It is up to the caller to enter the descriptor in the hash table. */
2910 static struct constant_descriptor_rtx
*
2911 record_constant_rtx (enum machine_mode mode
, rtx x
)
2913 struct constant_descriptor_rtx
*ptr
;
2915 ptr
= ggc_alloc (sizeof (*ptr
));
2916 decode_rtx_const (mode
, x
, &ptr
->value
);
2921 /* Given a constant rtx X, make (or find) a memory constant for its value
2922 and return a MEM rtx to refer to it in memory. */
2925 force_const_mem (enum machine_mode mode
, rtx x
)
2928 struct constant_descriptor_rtx
*desc
;
2931 struct pool_constant
*pool
;
2934 /* If we're not allowed to drop X into the constant pool, don't. */
2935 if ((*targetm
.cannot_force_const_mem
) (x
))
2938 /* Compute hash code of X. Search the descriptors for that hash code
2939 to see if any of them describes X. If yes, we have an rtx to use. */
2940 hash
= const_hash_rtx (mode
, x
);
2941 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
2942 if (compare_constant_rtx (mode
, x
, desc
))
2945 /* No constant equal to X is known to have been output.
2946 Make a constant descriptor to enter X in the hash table
2947 and make a MEM for it. */
2948 desc
= record_constant_rtx (mode
, x
);
2949 desc
->next
= const_rtx_hash_table
[hash
];
2950 const_rtx_hash_table
[hash
] = desc
;
2952 /* Align the location counter as required by EXP's data type. */
2953 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
2954 #ifdef CONSTANT_ALIGNMENT
2956 tree type
= (*lang_hooks
.types
.type_for_mode
) (mode
, 0);
2957 if (type
!= NULL_TREE
)
2958 align
= CONSTANT_ALIGNMENT (make_tree (type
, x
), align
);
2962 pool_offset
+= (align
/ BITS_PER_UNIT
) - 1;
2963 pool_offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
2965 if (GET_CODE (x
) == LABEL_REF
)
2966 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
2968 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
2969 pool
= ggc_alloc (sizeof (struct pool_constant
));
2973 pool
->labelno
= const_labelno
;
2974 pool
->align
= align
;
2975 pool
->offset
= pool_offset
;
2982 last_pool
->next
= pool
;
2985 pool_offset
+= GET_MODE_SIZE (mode
);
2987 /* Create a string containing the label name, in LABEL. */
2988 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2992 /* Construct the SYMBOL_REF and the MEM. */
2994 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2995 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2997 pool
->desc
->rtl
= def
= gen_rtx_MEM (mode
, symbol
);
2998 set_mem_attributes (def
, (*lang_hooks
.types
.type_for_mode
) (mode
, 0), 1);
2999 RTX_UNCHANGING_P (def
) = 1;
3001 /* Add label to symbol hash table. */
3002 hash
= SYMHASH (XSTR (symbol
, 0));
3003 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3004 const_rtx_sym_hash_table
[hash
] = pool
;
3006 /* Mark the symbol_ref as belonging to this constants pool. */
3007 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
3008 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
3009 current_function_uses_const_pool
= 1;
3014 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3015 the corresponding pool_constant structure. */
3017 static struct pool_constant
*
3018 find_pool_constant (struct function
*f
, rtx addr
)
3020 struct pool_constant
*pool
;
3021 const char *label
= XSTR (addr
, 0);
3023 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3024 pool
= pool
->next_sym
)
3025 if (XSTR (XEXP (pool
->desc
->rtl
, 0), 0) == label
)
3031 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3034 get_pool_constant (rtx addr
)
3036 return (find_pool_constant (cfun
, addr
))->constant
;
3039 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3040 and whether it has been output or not. */
3043 get_pool_constant_mark (rtx addr
, bool *pmarked
)
3045 struct pool_constant
*pool
= find_pool_constant (cfun
, addr
);
3046 *pmarked
= (pool
->mark
!= 0);
3047 return pool
->constant
;
3050 /* Likewise, but for the constant pool of a specific function. */
3053 get_pool_constant_for_function (struct function
*f
, rtx addr
)
3055 return (find_pool_constant (f
, addr
))->constant
;
3058 /* Similar, return the mode. */
3061 get_pool_mode (rtx addr
)
3063 return (find_pool_constant (cfun
, addr
))->mode
;
3067 get_pool_mode_for_function (struct function
*f
, rtx addr
)
3069 return (find_pool_constant (f
, addr
))->mode
;
3072 /* Similar, return the offset in the constant pool. */
3075 get_pool_offset (rtx addr
)
3077 return (find_pool_constant (cfun
, addr
))->offset
;
3080 /* Return the size of the constant pool. */
3083 get_pool_size (void)
3088 /* Write all the constants in the constant pool. */
3091 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED
,
3092 tree fndecl ATTRIBUTE_UNUSED
)
3094 struct pool_constant
*pool
;
3098 /* It is possible for gcc to call force_const_mem and then to later
3099 discard the instructions which refer to the constant. In such a
3100 case we do not need to output the constant. */
3101 mark_constant_pool ();
3103 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3104 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3107 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3116 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3117 whose CODE_LABEL has been deleted. This can occur if a jump table
3118 is eliminated by optimization. If so, write a constant of zero
3119 instead. Note that this can also happen by turning the
3120 CODE_LABEL into a NOTE. */
3121 /* ??? This seems completely and utterly wrong. Certainly it's
3122 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3123 functioning even with INSN_DELETED_P and friends. */
3126 switch (GET_CODE (x
))
3129 if (GET_CODE (XEXP (x
, 0)) != PLUS
3130 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3132 tmp
= XEXP (XEXP (x
, 0), 0);
3137 if (INSN_DELETED_P (tmp
)
3138 || (GET_CODE (tmp
) == NOTE
3139 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3150 /* First switch to correct section. */
3151 (*targetm
.asm_out
.select_rtx_section
) (pool
->mode
, x
, pool
->align
);
3153 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3154 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3155 pool
->align
, pool
->labelno
, done
);
3158 assemble_align (pool
->align
);
3160 /* Output the label. */
3161 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LC", pool
->labelno
);
3163 /* Output the value of the constant itself. */
3164 switch (GET_MODE_CLASS (pool
->mode
))
3167 if (GET_CODE (x
) != CONST_DOUBLE
)
3170 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3171 assemble_real (r
, pool
->mode
, pool
->align
);
3175 case MODE_PARTIAL_INT
:
3176 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), pool
->align
, 1);
3179 case MODE_VECTOR_FLOAT
:
3184 if (GET_CODE (x
) != CONST_VECTOR
)
3187 units
= CONST_VECTOR_NUNITS (x
);
3189 for (i
= 0; i
< units
; i
++)
3191 elt
= CONST_VECTOR_ELT (x
, i
);
3192 REAL_VALUE_FROM_CONST_DOUBLE (r
, elt
);
3193 assemble_real (r
, GET_MODE_INNER (pool
->mode
), pool
->align
);
3198 case MODE_VECTOR_INT
:
3203 if (GET_CODE (x
) != CONST_VECTOR
)
3206 units
= CONST_VECTOR_NUNITS (x
);
3208 for (i
= 0; i
< units
; i
++)
3210 elt
= CONST_VECTOR_ELT (x
, i
);
3211 assemble_integer (elt
, GET_MODE_UNIT_SIZE (pool
->mode
),
3221 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3222 sections have proper size. */
3223 if (pool
->align
> GET_MODE_BITSIZE (pool
->mode
)
3224 && in_section
== in_named
3225 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3226 assemble_align (pool
->align
);
3228 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3233 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3234 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3237 /* Done with this pool. */
3238 first_pool
= last_pool
= 0;
3241 /* Look through the instructions for this function, and mark all the
3242 entries in the constant pool which are actually being used. Emit
3243 deferred constants which have indeed been used. */
3246 mark_constant_pool (void)
3250 struct pool_constant
*pool
;
3252 if (first_pool
== 0 && n_deferred_constants
== 0)
3255 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3258 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3260 mark_constants (PATTERN (insn
));
3262 for (link
= current_function_epilogue_delay_list
;
3264 link
= XEXP (link
, 1))
3266 insn
= XEXP (link
, 0);
3269 mark_constants (PATTERN (insn
));
3273 /* Look through appropriate parts of X, marking all entries in the
3274 constant pool which are actually being used. Entries that are only
3275 referenced by other constants are also marked as used. Emit
3276 deferred strings that are used. */
3279 mark_constants (rtx x
)
3282 const char *format_ptr
;
3287 if (GET_CODE (x
) == SYMBOL_REF
)
3289 mark_constant (&x
, NULL
);
3293 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3294 insns, not any notes that may be attached. We don't want to mark
3295 a constant just because it happens to appear in a REG_EQUIV note. */
3298 mark_constants (PATTERN (x
));
3302 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3304 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3306 switch (*format_ptr
++)
3309 mark_constants (XEXP (x
, i
));
3313 if (XVEC (x
, i
) != 0)
3317 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3318 mark_constants (XVECEXP (x
, i
, j
));
3338 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3339 to as used. Emit referenced deferred strings. This function can
3340 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3343 mark_constant (rtx
*current_rtx
, void *data ATTRIBUTE_UNUSED
)
3345 rtx x
= *current_rtx
;
3350 else if (GET_CODE (x
) == SYMBOL_REF
)
3352 if (CONSTANT_POOL_ADDRESS_P (x
))
3354 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3355 if (pool
->mark
== 0)
3358 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3363 else if (TREE_CONSTANT_POOL_ADDRESS_P (x
))
3365 tree exp
= SYMBOL_REF_DECL (x
);
3366 if (!TREE_ASM_WRITTEN (exp
))
3368 n_deferred_constants
--;
3369 output_constant_def_contents (x
);
3376 /* Find all the constants whose addresses are referenced inside of EXP,
3377 and make sure assembler code with a label has been output for each one.
3378 Indicate whether an ADDR_EXPR has been encountered. */
3381 output_addressed_constants (tree exp
)
3383 int reloc
= 0, reloc2
;
3386 /* Give the front-end a chance to convert VALUE to something that
3387 looks more like a constant to the back-end. */
3388 exp
= (*lang_hooks
.expand_constant
) (exp
);
3390 switch (TREE_CODE (exp
))
3394 /* Go inside any operations that get_inner_reference can handle and see
3395 if what's inside is a constant: no need to do anything here for
3396 addresses of variables or functions. */
3397 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3398 tem
= TREE_OPERAND (tem
, 0))
3401 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
3402 || TREE_CODE (tem
) == CONSTRUCTOR
)
3403 output_constant_def (tem
, 0);
3405 if (TREE_PUBLIC (tem
))
3412 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3413 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3417 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3418 reloc2
= output_addressed_constants (TREE_OPERAND (exp
, 1));
3419 /* The difference of two local labels is computable at link time. */
3420 if (reloc
== 1 && reloc2
== 1)
3428 case NON_LVALUE_EXPR
:
3429 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3433 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3434 if (TREE_VALUE (tem
) != 0)
3435 reloc
|= output_addressed_constants (TREE_VALUE (tem
));
3445 /* Return nonzero if VALUE is a valid constant-valued expression
3446 for use in initializing a static variable; one that can be an
3447 element of a "constant" initializer.
3449 Return null_pointer_node if the value is absolute;
3450 if it is relocatable, return the variable that determines the relocation.
3451 We assume that VALUE has been folded as much as possible;
3452 therefore, we do not need to check for such things as
3453 arithmetic-combinations of integers. */
3456 initializer_constant_valid_p (tree value
, tree endtype
)
3458 /* Give the front-end a chance to convert VALUE to something that
3459 looks more like a constant to the back-end. */
3460 value
= (*lang_hooks
.expand_constant
) (value
);
3462 switch (TREE_CODE (value
))
3465 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3466 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3467 && TREE_CONSTANT (value
)
3468 && CONSTRUCTOR_ELTS (value
))
3471 bool absolute
= true;
3473 for (elt
= CONSTRUCTOR_ELTS (value
); elt
; elt
= TREE_CHAIN (elt
))
3476 value
= TREE_VALUE (elt
);
3477 reloc
= initializer_constant_valid_p (value
, TREE_TYPE (value
));
3480 if (reloc
!= null_pointer_node
)
3483 /* For a non-absolute relocation, there is no single
3484 variable that can be "the variable that determines the
3486 return absolute
? null_pointer_node
: error_mark_node
;
3489 return TREE_STATIC (value
) ? null_pointer_node
: NULL_TREE
;
3496 return null_pointer_node
;
3500 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
3502 case VIEW_CONVERT_EXPR
:
3503 case NON_LVALUE_EXPR
:
3504 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3508 /* Allow conversions between pointer types. */
3509 if (POINTER_TYPE_P (TREE_TYPE (value
))
3510 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3511 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3513 /* Allow conversions between real types. */
3514 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3515 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3516 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3518 /* Allow length-preserving conversions between integer types. */
3519 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3520 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3521 && (TYPE_PRECISION (TREE_TYPE (value
))
3522 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3523 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3525 /* Allow conversions between other integer types only if
3527 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3528 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3530 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3532 if (inner
== null_pointer_node
)
3533 return null_pointer_node
;
3537 /* Allow (int) &foo provided int is as wide as a pointer. */
3538 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3539 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3540 && (TYPE_PRECISION (TREE_TYPE (value
))
3541 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3542 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3545 /* Likewise conversions from int to pointers, but also allow
3546 conversions from 0. */
3547 if (POINTER_TYPE_P (TREE_TYPE (value
))
3548 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3550 if (integer_zerop (TREE_OPERAND (value
, 0)))
3551 return null_pointer_node
;
3552 else if (TYPE_PRECISION (TREE_TYPE (value
))
3553 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
3554 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3558 /* Allow conversions to union types if the value inside is okay. */
3559 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
3560 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3565 if (! INTEGRAL_TYPE_P (endtype
)
3566 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3568 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3570 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3572 /* If either term is absolute, use the other terms relocation. */
3573 if (valid0
== null_pointer_node
)
3575 if (valid1
== null_pointer_node
)
3581 if (! INTEGRAL_TYPE_P (endtype
)
3582 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3584 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3586 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3588 /* Win if second argument is absolute. */
3589 if (valid1
== null_pointer_node
)
3591 /* Win if both arguments have the same relocation.
3592 Then the value is absolute. */
3593 if (valid0
== valid1
&& valid0
!= 0)
3594 return null_pointer_node
;
3596 /* Since GCC guarantees that string constants are unique in the
3597 generated code, a subtraction between two copies of the same
3598 constant string is absolute. */
3599 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
3600 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
3601 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
3602 return null_pointer_node
;
3605 /* Support differences between labels. */
3606 if (INTEGRAL_TYPE_P (endtype
))
3609 op0
= TREE_OPERAND (value
, 0);
3610 op1
= TREE_OPERAND (value
, 1);
3612 /* Like STRIP_NOPS except allow the operand mode to widen.
3613 This works around a feature of fold that simplifies
3614 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3615 that the narrower operation is cheaper. */
3617 while (TREE_CODE (op0
) == NOP_EXPR
3618 || TREE_CODE (op0
) == CONVERT_EXPR
3619 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3621 tree inner
= TREE_OPERAND (op0
, 0);
3622 if (inner
== error_mark_node
3623 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3624 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3625 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3630 while (TREE_CODE (op1
) == NOP_EXPR
3631 || TREE_CODE (op1
) == CONVERT_EXPR
3632 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3634 tree inner
= TREE_OPERAND (op1
, 0);
3635 if (inner
== error_mark_node
3636 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3637 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3638 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3643 if (TREE_CODE (op0
) == ADDR_EXPR
3644 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
3645 && TREE_CODE (op1
) == ADDR_EXPR
3646 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
3647 return null_pointer_node
;
3658 /* Output assembler code for constant EXP to FILE, with no label.
3659 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3660 Assumes output_addressed_constants has been done on EXP already.
3662 Generate exactly SIZE bytes of assembler data, padding at the end
3663 with zeros if necessary. SIZE must always be specified.
3665 SIZE is important for structure constructors,
3666 since trailing members may have been omitted from the constructor.
3667 It is also important for initialization of arrays from string constants
3668 since the full length of the string constant might not be wanted.
3669 It is also needed for initialization of unions, where the initializer's
3670 type is just one member, and that may not be as long as the union.
3672 There a case in which we would fail to output exactly SIZE bytes:
3673 for a structure constructor that wants to produce more than SIZE bytes.
3674 But such constructors will never be generated for any possible input.
3676 ALIGN is the alignment of the data in bits. */
3679 output_constant (tree exp
, unsigned HOST_WIDE_INT size
, unsigned int align
)
3681 enum tree_code code
;
3682 unsigned HOST_WIDE_INT thissize
;
3684 /* Some front-ends use constants other than the standard language-independent
3685 varieties, but which may still be output directly. Give the front-end a
3686 chance to convert EXP to a language-independent representation. */
3687 exp
= (*lang_hooks
.expand_constant
) (exp
);
3689 if (size
== 0 || flag_syntax_only
)
3692 /* Eliminate any conversions since we'll be outputting the underlying
3694 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3695 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3696 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3697 exp
= TREE_OPERAND (exp
, 0);
3699 code
= TREE_CODE (TREE_TYPE (exp
));
3700 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3702 /* Allow a constructor with no elements for any data type.
3703 This means to fill the space with zeros. */
3704 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3706 assemble_zeros (size
);
3710 if (TREE_CODE (exp
) == FDESC_EXPR
)
3712 #ifdef ASM_OUTPUT_FDESC
3713 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3714 tree decl
= TREE_OPERAND (exp
, 0);
3715 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3722 /* Now output the underlying data. If we've handling the padding, return.
3723 Otherwise, break and ensure THISSIZE is the size written. */
3731 case REFERENCE_TYPE
:
3733 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3734 EXPAND_INITIALIZER
),
3736 error ("initializer for integer value is too complicated");
3740 if (TREE_CODE (exp
) != REAL_CST
)
3741 error ("initializer for floating value is not a floating constant");
3743 assemble_real (TREE_REAL_CST (exp
),
3744 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0),
3749 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3750 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3751 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
3756 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3758 output_constructor (exp
, size
, align
);
3761 else if (TREE_CODE (exp
) == STRING_CST
)
3763 thissize
= MIN ((unsigned HOST_WIDE_INT
)TREE_STRING_LENGTH (exp
),
3765 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
3767 else if (TREE_CODE (exp
) == VECTOR_CST
)
3771 unsigned int nalign
;
3772 enum machine_mode inner
;
3774 inner
= GET_MODE_INNER (TYPE_MODE (TREE_TYPE (exp
)));
3775 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
3777 elt_size
= GET_MODE_UNIT_SIZE (TYPE_MODE (TREE_TYPE (exp
)));
3779 link
= TREE_VECTOR_CST_ELTS (exp
);
3780 output_constant (TREE_VALUE (link
), elt_size
, align
);
3781 while ((link
= TREE_CHAIN (link
)) != NULL
)
3782 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
3790 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3791 output_constructor (exp
, size
, align
);
3797 if (TREE_CODE (exp
) == INTEGER_CST
)
3798 assemble_integer (expand_expr (exp
, NULL_RTX
,
3799 VOIDmode
, EXPAND_INITIALIZER
),
3800 thissize
, align
, 1);
3801 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3803 unsigned char *buffer
= alloca (thissize
);
3804 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
3806 assemble_string ((char *) buffer
, thissize
);
3809 error ("unknown set constructor type");
3819 if (size
> thissize
)
3820 assemble_zeros (size
- thissize
);
3824 /* Subroutine of output_constructor, used for computing the size of
3825 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3826 type with an unspecified upper bound. */
3828 static unsigned HOST_WIDE_INT
3829 array_size_for_constructor (tree val
)
3833 /* This code used to attempt to handle string constants that are not
3834 arrays of single-bytes, but nothing else does, so there's no point in
3836 if (TREE_CODE (val
) == STRING_CST
)
3837 return TREE_STRING_LENGTH (val
);
3839 max_index
= NULL_TREE
;
3840 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
3842 tree index
= TREE_PURPOSE (i
);
3844 if (TREE_CODE (index
) == RANGE_EXPR
)
3845 index
= TREE_OPERAND (index
, 1);
3846 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
3850 if (max_index
== NULL_TREE
)
3853 /* Compute the total number of array elements. */
3854 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
3856 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
3857 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
3859 /* Multiply by the array element unit size to find number of bytes. */
3860 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
3862 return tree_low_cst (i
, 1);
3865 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3866 Generate at least SIZE bytes, padding if necessary. */
3869 output_constructor (tree exp
, unsigned HOST_WIDE_INT size
,
3872 tree type
= TREE_TYPE (exp
);
3873 tree link
, field
= 0;
3875 /* Number of bytes output or skipped so far.
3876 In other words, current position within the constructor. */
3877 HOST_WIDE_INT total_bytes
= 0;
3878 /* Nonzero means BYTE contains part of a byte, to be output. */
3879 int byte_buffer_in_use
= 0;
3882 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3885 if (TREE_CODE (type
) == RECORD_TYPE
)
3886 field
= TYPE_FIELDS (type
);
3888 if (TREE_CODE (type
) == ARRAY_TYPE
3889 && TYPE_DOMAIN (type
) != 0)
3890 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
3892 /* As LINK goes through the elements of the constant,
3893 FIELD goes through the structure fields, if the constant is a structure.
3894 if the constant is a union, then we override this,
3895 by getting the field from the TREE_LIST element.
3896 But the constant could also be an array. Then FIELD is zero.
3898 There is always a maximum of one element in the chain LINK for unions
3899 (even if the initializer in a source program incorrectly contains
3901 for (link
= CONSTRUCTOR_ELTS (exp
);
3903 link
= TREE_CHAIN (link
),
3904 field
= field
? TREE_CHAIN (field
) : 0)
3906 tree val
= TREE_VALUE (link
);
3909 /* The element in a union constructor specifies the proper field
3911 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
3912 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
3913 && TREE_PURPOSE (link
) != 0)
3914 field
= TREE_PURPOSE (link
);
3916 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3917 index
= TREE_PURPOSE (link
);
3919 /* Eliminate the marker that makes a cast not be an lvalue. */
3923 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
3925 unsigned HOST_WIDE_INT fieldsize
3926 = int_size_in_bytes (TREE_TYPE (type
));
3927 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
3928 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
3929 HOST_WIDE_INT index
;
3930 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
3932 for (index
= lo_index
; index
<= hi_index
; index
++)
3934 /* Output the element's initial value. */
3936 assemble_zeros (fieldsize
);
3938 output_constant (val
, fieldsize
, align2
);
3940 /* Count its size. */
3941 total_bytes
+= fieldsize
;
3944 else if (field
== 0 || !DECL_BIT_FIELD (field
))
3946 /* An element that is not a bit-field. */
3948 unsigned HOST_WIDE_INT fieldsize
;
3949 /* Since this structure is static,
3950 we know the positions are constant. */
3951 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
3952 unsigned int align2
;
3955 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
3956 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
3958 /* Output any buffered-up bit-fields preceding this element. */
3959 if (byte_buffer_in_use
)
3961 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3963 byte_buffer_in_use
= 0;
3966 /* Advance to offset of this element.
3967 Note no alignment needed in an array, since that is guaranteed
3968 if each element has the proper size. */
3969 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
3971 assemble_zeros (pos
- total_bytes
);
3975 /* Find the alignment of this element. */
3976 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
3978 /* Determine size this element should occupy. */
3983 /* If this is an array with an unspecified upper bound,
3984 the initializer determines the size. */
3985 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
3986 but we cannot do this until the deprecated support for
3987 initializing zero-length array members is removed. */
3988 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
3989 && TYPE_DOMAIN (TREE_TYPE (field
))
3990 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
3992 fieldsize
= array_size_for_constructor (val
);
3993 /* Given a non-empty initialization, this field had
3995 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
3998 else if (DECL_SIZE_UNIT (field
))
4000 /* ??? This can't be right. If the decl size overflows
4001 a host integer we will silently emit no data. */
4002 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4003 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4007 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4009 /* Output the element's initial value. */
4011 assemble_zeros (fieldsize
);
4013 output_constant (val
, fieldsize
, align2
);
4015 /* Count its size. */
4016 total_bytes
+= fieldsize
;
4018 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4019 error ("invalid initial value for member `%s'",
4020 IDENTIFIER_POINTER (DECL_NAME (field
)));
4023 /* Element that is a bit-field. */
4025 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4026 HOST_WIDE_INT end_offset
4027 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4030 val
= integer_zero_node
;
4032 /* If this field does not start in this (or, next) byte,
4034 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4036 /* Output remnant of any bit field in previous bytes. */
4037 if (byte_buffer_in_use
)
4039 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4041 byte_buffer_in_use
= 0;
4044 /* If still not at proper byte, advance to there. */
4045 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4047 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4048 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4052 if (! byte_buffer_in_use
)
4055 /* We must split the element into pieces that fall within
4056 separate bytes, and combine each byte with previous or
4057 following bit-fields. */
4059 /* next_offset is the offset n fbits from the beginning of
4060 the structure to the next bit of this element to be processed.
4061 end_offset is the offset of the first bit past the end of
4063 while (next_offset
< end_offset
)
4067 HOST_WIDE_INT value
;
4068 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4069 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4071 /* Advance from byte to byte
4072 within this element when necessary. */
4073 while (next_byte
!= total_bytes
)
4075 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4080 /* Number of bits we can process at once
4081 (all part of the same byte). */
4082 this_time
= MIN (end_offset
- next_offset
,
4083 BITS_PER_UNIT
- next_bit
);
4084 if (BYTES_BIG_ENDIAN
)
4086 /* On big-endian machine, take the most significant bits
4087 first (of the bits that are significant)
4088 and put them into bytes from the most significant end. */
4089 shift
= end_offset
- next_offset
- this_time
;
4091 /* Don't try to take a bunch of bits that cross
4092 the word boundary in the INTEGER_CST. We can
4093 only select bits from the LOW or HIGH part
4095 if (shift
< HOST_BITS_PER_WIDE_INT
4096 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4098 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4099 shift
= HOST_BITS_PER_WIDE_INT
;
4102 /* Now get the bits from the appropriate constant word. */
4103 if (shift
< HOST_BITS_PER_WIDE_INT
)
4104 value
= TREE_INT_CST_LOW (val
);
4105 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4107 value
= TREE_INT_CST_HIGH (val
);
4108 shift
-= HOST_BITS_PER_WIDE_INT
;
4113 /* Get the result. This works only when:
4114 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4115 byte
|= (((value
>> shift
)
4116 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4117 << (BITS_PER_UNIT
- this_time
- next_bit
));
4121 /* On little-endian machines,
4122 take first the least significant bits of the value
4123 and pack them starting at the least significant
4124 bits of the bytes. */
4125 shift
= next_offset
- int_bit_position (field
);
4127 /* Don't try to take a bunch of bits that cross
4128 the word boundary in the INTEGER_CST. We can
4129 only select bits from the LOW or HIGH part
4131 if (shift
< HOST_BITS_PER_WIDE_INT
4132 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4133 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4135 /* Now get the bits from the appropriate constant word. */
4136 if (shift
< HOST_BITS_PER_WIDE_INT
)
4137 value
= TREE_INT_CST_LOW (val
);
4138 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4140 value
= TREE_INT_CST_HIGH (val
);
4141 shift
-= HOST_BITS_PER_WIDE_INT
;
4146 /* Get the result. This works only when:
4147 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4148 byte
|= (((value
>> shift
)
4149 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4153 next_offset
+= this_time
;
4154 byte_buffer_in_use
= 1;
4159 if (byte_buffer_in_use
)
4161 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4165 if ((unsigned HOST_WIDE_INT
)total_bytes
< size
)
4166 assemble_zeros (size
- total_bytes
);
4169 /* This TREE_LIST contains any weak symbol declarations waiting
4171 static GTY(()) tree weak_decls
;
4173 /* Mark DECL as weak. */
4176 mark_weak (tree decl
)
4178 DECL_WEAK (decl
) = 1;
4180 if (DECL_RTL_SET_P (decl
)
4181 && GET_CODE (DECL_RTL (decl
)) == MEM
4182 && XEXP (DECL_RTL (decl
), 0)
4183 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4184 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4187 /* Merge weak status between NEWDECL and OLDDECL. */
4190 merge_weak (tree newdecl
, tree olddecl
)
4192 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4195 if (DECL_WEAK (newdecl
))
4199 /* NEWDECL is weak, but OLDDECL is not. */
4201 /* If we already output the OLDDECL, we're in trouble; we can't
4202 go back and make it weak. This error cannot caught in
4203 declare_weak because the NEWDECL and OLDDECL was not yet
4204 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4205 if (TREE_ASM_WRITTEN (olddecl
))
4206 error ("%Jweak declaration of '%D' must precede definition",
4209 /* If we've already generated rtl referencing OLDDECL, we may
4210 have done so in a way that will not function properly with
4212 else if (TREE_USED (olddecl
)
4213 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4214 warning ("%Jweak declaration of '%D' after first use results "
4215 "in unspecified behavior", newdecl
, newdecl
);
4219 /* We put the NEWDECL on the weak_decls list at some point.
4220 Replace it with the OLDDECL. */
4221 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4222 if (TREE_VALUE (wd
) == newdecl
)
4224 TREE_VALUE (wd
) = olddecl
;
4227 /* We may not find the entry on the list. If NEWDECL is a
4228 weak alias, then we will have already called
4229 globalize_decl to remove the entry; in that case, we do
4230 not need to do anything. */
4233 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4234 mark_weak (olddecl
);
4237 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4238 weak. Just update NEWDECL to indicate that it's weak too. */
4239 mark_weak (newdecl
);
4242 /* Declare DECL to be a weak symbol. */
4245 declare_weak (tree decl
)
4247 if (! TREE_PUBLIC (decl
))
4248 error ("%Jweak declaration of '%D' must be public", decl
, decl
);
4249 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4250 error ("%Jweak declaration of '%D' must precede definition", decl
, decl
);
4251 else if (SUPPORTS_WEAK
)
4253 if (! DECL_WEAK (decl
))
4254 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4257 warning ("%Jweak declaration of '%D' not supported", decl
, decl
);
4262 /* Emit any pending weak declarations. */
4269 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4271 tree decl
= TREE_VALUE (t
);
4272 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4273 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4276 if (! TREE_USED (decl
))
4279 #ifdef ASM_WEAKEN_DECL
4280 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4282 #ifdef ASM_WEAKEN_LABEL
4283 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4285 #ifdef ASM_OUTPUT_WEAK_ALIAS
4286 warning ("only weak aliases are supported in this configuration");
4294 /* Emit the assembly bits to indicate that DECL is globally visible. */
4297 globalize_decl (tree decl
)
4299 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4301 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4302 if (DECL_WEAK (decl
))
4306 #ifdef ASM_WEAKEN_DECL
4307 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4309 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4312 /* Remove this function from the pending weak list so that
4313 we do not emit multiple .weak directives for it. */
4314 for (p
= &weak_decls
; (t
= *p
) ; )
4316 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4317 *p
= TREE_CHAIN (t
);
4319 p
= &TREE_CHAIN (t
);
4325 (*targetm
.asm_out
.globalize_label
) (asm_out_file
, name
);
4328 /* Emit an assembler directive to make the symbol for DECL an alias to
4329 the symbol for TARGET. */
4332 assemble_alias (tree decl
, tree target ATTRIBUTE_UNUSED
)
4336 /* We must force creation of DECL_RTL for debug info generation, even though
4337 we don't use it here. */
4338 make_decl_rtl (decl
, NULL
);
4340 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4342 #ifdef ASM_OUTPUT_DEF
4343 /* Make name accessible from other files, if appropriate. */
4345 if (TREE_PUBLIC (decl
))
4347 globalize_decl (decl
);
4348 maybe_assemble_visibility (decl
);
4351 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4352 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4354 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4356 #else /* !ASM_OUTPUT_DEF */
4357 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4358 if (! DECL_WEAK (decl
))
4359 warning ("only weak aliases are supported in this configuration");
4361 #ifdef ASM_WEAKEN_DECL
4362 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4364 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4367 warning ("alias definitions not supported in this configuration; ignored");
4371 TREE_USED (decl
) = 1;
4372 TREE_ASM_WRITTEN (decl
) = 1;
4373 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4376 /* Emit an assembler directive to set symbol for DECL visibility to
4377 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4380 default_assemble_visibility (tree decl
, int vis
)
4382 static const char * const visibility_types
[] = {
4383 NULL
, "internal", "hidden", "protected"
4386 const char *name
, *type
;
4388 name
= (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4389 type
= visibility_types
[vis
];
4391 #ifdef HAVE_GAS_HIDDEN
4392 fprintf (asm_out_file
, "\t.%s\t", type
);
4393 assemble_name (asm_out_file
, name
);
4394 fprintf (asm_out_file
, "\n");
4396 warning ("visibility attribute not supported in this configuration; ignored");
4400 /* A helper function to call assemble_visibility when needed for a decl. */
4403 maybe_assemble_visibility (tree decl
)
4405 enum symbol_visibility vis
= decl_visibility (decl
);
4407 if (vis
!= VISIBILITY_DEFAULT
)
4408 (* targetm
.asm_out
.visibility
) (decl
, vis
);
4411 /* Returns 1 if the target configuration supports defining public symbols
4412 so that one of them will be chosen at link time instead of generating a
4413 multiply-defined symbol error, whether through the use of weak symbols or
4414 a target-specific mechanism for having duplicates discarded. */
4417 supports_one_only (void)
4419 if (SUPPORTS_ONE_ONLY
)
4421 return SUPPORTS_WEAK
;
4424 /* Set up DECL as a public symbol that can be defined in multiple
4425 translation units without generating a linker error. */
4428 make_decl_one_only (tree decl
)
4430 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4433 TREE_PUBLIC (decl
) = 1;
4435 if (TREE_CODE (decl
) == VAR_DECL
4436 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4437 DECL_COMMON (decl
) = 1;
4438 else if (SUPPORTS_ONE_ONLY
)
4440 #ifdef MAKE_DECL_ONE_ONLY
4441 MAKE_DECL_ONE_ONLY (decl
);
4443 DECL_ONE_ONLY (decl
) = 1;
4445 else if (SUPPORTS_WEAK
)
4446 DECL_WEAK (decl
) = 1;
4452 init_varasm_once (void)
4454 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4455 in_named_entry_eq
, NULL
);
4456 const_desc_htab
= htab_create_ggc (1009, const_desc_hash
,
4457 const_desc_eq
, NULL
);
4459 const_alias_set
= new_alias_set ();
4463 decl_tls_model (tree decl
)
4465 enum tls_model kind
;
4466 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4471 attr
= TREE_VALUE (TREE_VALUE (attr
));
4472 if (TREE_CODE (attr
) != STRING_CST
)
4474 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4475 kind
= TLS_MODEL_LOCAL_EXEC
;
4476 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4477 kind
= TLS_MODEL_INITIAL_EXEC
;
4478 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4479 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4480 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4481 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4487 is_local
= (*targetm
.binds_local_p
) (decl
);
4491 kind
= TLS_MODEL_LOCAL_EXEC
;
4493 kind
= TLS_MODEL_INITIAL_EXEC
;
4495 /* Local dynamic is inefficient when we're not combining the
4496 parts of the address. */
4497 else if (optimize
&& is_local
)
4498 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4500 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4501 if (kind
< flag_tls_default
)
4502 kind
= flag_tls_default
;
4507 enum symbol_visibility
4508 decl_visibility (tree decl
)
4510 tree attr
= lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
));
4514 const char *which
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
4516 if (strcmp (which
, "default") == 0)
4517 return VISIBILITY_DEFAULT
;
4518 if (strcmp (which
, "internal") == 0)
4519 return VISIBILITY_INTERNAL
;
4520 if (strcmp (which
, "hidden") == 0)
4521 return VISIBILITY_HIDDEN
;
4522 if (strcmp (which
, "protected") == 0)
4523 return VISIBILITY_PROTECTED
;
4528 return VISIBILITY_DEFAULT
;
4531 /* Select a set of attributes for section NAME based on the properties
4532 of DECL and whether or not RELOC indicates that DECL's initializer
4533 might contain runtime relocations.
4535 We make the section read-only and executable for a function decl,
4536 read-only for a const data decl, and writable for a non-const data decl. */
4539 default_section_type_flags (tree decl
, const char *name
, int reloc
)
4541 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4545 default_section_type_flags_1 (tree decl
, const char *name
, int reloc
,
4550 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4551 flags
= SECTION_CODE
;
4552 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4555 flags
= SECTION_WRITE
;
4557 if (decl
&& DECL_ONE_ONLY (decl
))
4558 flags
|= SECTION_LINKONCE
;
4560 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4561 flags
|= SECTION_TLS
| SECTION_WRITE
;
4563 if (strcmp (name
, ".bss") == 0
4564 || strncmp (name
, ".bss.", 5) == 0
4565 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4566 || strcmp (name
, ".sbss") == 0
4567 || strncmp (name
, ".sbss.", 6) == 0
4568 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0
4569 || strcmp (name
, ".tbss") == 0
4570 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4571 flags
|= SECTION_BSS
;
4573 if (strcmp (name
, ".tdata") == 0
4574 || strcmp (name
, ".tbss") == 0
4575 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0
4576 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4577 flags
|= SECTION_TLS
;
4579 /* These three sections have special ELF types. They are neither
4580 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4581 want to print a section type (@progbits or @nobits). If someone
4582 is silly enough to emit code or TLS variables to one of these
4583 sections, then don't handle them specially. */
4584 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4585 && (strcmp (name
, ".init_array") == 0
4586 || strcmp (name
, ".fini_array") == 0
4587 || strcmp (name
, ".preinit_array") == 0))
4588 flags
|= SECTION_NOTYPE
;
4593 /* Output assembly to switch to section NAME with attribute FLAGS.
4594 Four variants for common object file formats. */
4597 default_no_named_section (const char *name ATTRIBUTE_UNUSED
,
4598 unsigned int flags ATTRIBUTE_UNUSED
)
4600 /* Some object formats don't support named sections at all. The
4601 front-end should already have flagged this as an error. */
4606 default_elf_asm_named_section (const char *name
, unsigned int flags
)
4608 char flagchars
[10], *f
= flagchars
;
4610 if (! named_section_first_declaration (name
))
4612 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4616 if (!(flags
& SECTION_DEBUG
))
4618 if (flags
& SECTION_WRITE
)
4620 if (flags
& SECTION_CODE
)
4622 if (flags
& SECTION_SMALL
)
4624 if (flags
& SECTION_MERGE
)
4626 if (flags
& SECTION_STRINGS
)
4628 if (flags
& SECTION_TLS
)
4632 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4634 if (!(flags
& SECTION_NOTYPE
))
4638 if (flags
& SECTION_BSS
)
4643 fprintf (asm_out_file
, ",@%s", type
);
4645 if (flags
& SECTION_ENTSIZE
)
4646 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4649 putc ('\n', asm_out_file
);
4653 default_coff_asm_named_section (const char *name
, unsigned int flags
)
4655 char flagchars
[8], *f
= flagchars
;
4657 if (flags
& SECTION_WRITE
)
4659 if (flags
& SECTION_CODE
)
4663 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4667 default_pe_asm_named_section (const char *name
, unsigned int flags
)
4669 default_coff_asm_named_section (name
, flags
);
4671 if (flags
& SECTION_LINKONCE
)
4673 /* Functions may have been compiled at various levels of
4674 optimization so we can't use `same_size' here.
4675 Instead, have the linker pick one. */
4676 fprintf (asm_out_file
, "\t.linkonce %s\n",
4677 (flags
& SECTION_CODE
? "discard" : "same_size"));
4681 /* The lame default section selector. */
4684 default_select_section (tree decl
, int reloc
,
4685 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4687 bool readonly
= false;
4691 if (decl_readonly_section (decl
, reloc
))
4694 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4696 if (! ((flag_pic
&& reloc
)
4697 || !TREE_READONLY (decl
)
4698 || TREE_SIDE_EFFECTS (decl
)
4699 || !TREE_CONSTANT (decl
)))
4702 else if (TREE_CODE (decl
) == STRING_CST
)
4703 readonly
= !flag_writable_strings
;
4704 else if (! (flag_pic
&& reloc
))
4708 readonly_data_section ();
4713 /* A helper function for default_elf_select_section and
4714 default_elf_unique_section. Categorizes the DECL. */
4716 enum section_category
4721 SECCAT_RODATA_MERGE_STR
,
4722 SECCAT_RODATA_MERGE_STR_INIT
,
4723 SECCAT_RODATA_MERGE_CONST
,
4728 /* To optimize loading of shared programs, define following subsections
4730 _REL Contains data that has relocations, so they get grouped
4731 together and dynamic linker will visit fewer pages in memory.
4732 _RO Contains data that is otherwise read-only. This is useful
4733 with prelinking as most relocations won't be dynamically
4734 linked and thus stay read only.
4735 _LOCAL Marks data containing relocations only to local objects.
4736 These relocations will get fully resolved by prelinking. */
4738 SECCAT_DATA_REL_LOCAL
,
4740 SECCAT_DATA_REL_RO_LOCAL
,
4750 static enum section_category
4751 categorize_decl_for_section (tree
, int, int);
4753 static enum section_category
4754 categorize_decl_for_section (tree decl
, int reloc
, int shlib
)
4756 enum section_category ret
;
4758 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4760 else if (TREE_CODE (decl
) == STRING_CST
)
4762 if (flag_writable_strings
)
4765 return SECCAT_RODATA_MERGE_STR
;
4767 else if (TREE_CODE (decl
) == VAR_DECL
)
4769 if (DECL_INITIAL (decl
) == NULL
4770 || DECL_INITIAL (decl
) == error_mark_node
)
4772 else if (! TREE_READONLY (decl
)
4773 || TREE_SIDE_EFFECTS (decl
)
4774 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
4776 if (shlib
&& (reloc
& 2))
4777 ret
= SECCAT_DATA_REL
;
4778 else if (shlib
&& reloc
)
4779 ret
= SECCAT_DATA_REL_LOCAL
;
4783 else if (shlib
&& (reloc
& 2))
4784 ret
= SECCAT_DATA_REL_RO
;
4785 else if (shlib
&& reloc
)
4786 ret
= SECCAT_DATA_REL_RO_LOCAL
;
4787 else if (reloc
|| flag_merge_constants
< 2)
4788 /* C and C++ don't allow different variables to share the same
4789 location. -fmerge-all-constants allows even that (at the
4790 expense of not conforming). */
4791 ret
= SECCAT_RODATA
;
4792 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
4793 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
4795 ret
= SECCAT_RODATA_MERGE_CONST
;
4797 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4799 if ((shlib
&& reloc
)
4800 || TREE_SIDE_EFFECTS (decl
)
4801 || ! TREE_CONSTANT (decl
))
4804 ret
= SECCAT_RODATA
;
4807 ret
= SECCAT_RODATA
;
4809 /* There are no read-only thread-local sections. */
4810 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4812 if (ret
== SECCAT_BSS
)
4818 /* If the target uses small data sections, select it. */
4819 else if ((*targetm
.in_small_data_p
) (decl
))
4821 if (ret
== SECCAT_BSS
)
4823 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
4824 ret
= SECCAT_SRODATA
;
4833 decl_readonly_section (tree decl
, int reloc
)
4835 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
4839 decl_readonly_section_1 (tree decl
, int reloc
, int shlib
)
4841 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4844 case SECCAT_RODATA_MERGE_STR
:
4845 case SECCAT_RODATA_MERGE_STR_INIT
:
4846 case SECCAT_RODATA_MERGE_CONST
:
4847 case SECCAT_SRODATA
:
4856 /* Select a section based on the above categorization. */
4859 default_elf_select_section (tree decl
, int reloc
,
4860 unsigned HOST_WIDE_INT align
)
4862 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
4866 default_elf_select_section_1 (tree decl
, int reloc
,
4867 unsigned HOST_WIDE_INT align
, int shlib
)
4869 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4872 /* We're not supposed to be called on FUNCTION_DECLs. */
4875 readonly_data_section ();
4877 case SECCAT_RODATA_MERGE_STR
:
4878 mergeable_string_section (decl
, align
, 0);
4880 case SECCAT_RODATA_MERGE_STR_INIT
:
4881 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
4883 case SECCAT_RODATA_MERGE_CONST
:
4884 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
4886 case SECCAT_SRODATA
:
4887 named_section (NULL_TREE
, ".sdata2", reloc
);
4892 case SECCAT_DATA_REL
:
4893 named_section (NULL_TREE
, ".data.rel", reloc
);
4895 case SECCAT_DATA_REL_LOCAL
:
4896 named_section (NULL_TREE
, ".data.rel.local", reloc
);
4898 case SECCAT_DATA_REL_RO
:
4899 named_section (NULL_TREE
, ".data.rel.ro", reloc
);
4901 case SECCAT_DATA_REL_RO_LOCAL
:
4902 named_section (NULL_TREE
, ".data.rel.ro.local", reloc
);
4905 named_section (NULL_TREE
, ".sdata", reloc
);
4908 named_section (NULL_TREE
, ".tdata", reloc
);
4911 #ifdef BSS_SECTION_ASM_OP
4914 named_section (NULL_TREE
, ".bss", reloc
);
4918 named_section (NULL_TREE
, ".sbss", reloc
);
4921 named_section (NULL_TREE
, ".tbss", reloc
);
4928 /* Construct a unique section name based on the decl name and the
4929 categorization performed above. */
4932 default_unique_section (tree decl
, int reloc
)
4934 default_unique_section_1 (decl
, reloc
, flag_pic
);
4938 default_unique_section_1 (tree decl
, int reloc
, int shlib
)
4940 bool one_only
= DECL_ONE_ONLY (decl
);
4941 const char *prefix
, *name
;
4945 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4948 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
4951 case SECCAT_RODATA_MERGE_STR
:
4952 case SECCAT_RODATA_MERGE_STR_INIT
:
4953 case SECCAT_RODATA_MERGE_CONST
:
4954 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
4956 case SECCAT_SRODATA
:
4957 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
4960 case SECCAT_DATA_REL
:
4961 case SECCAT_DATA_REL_LOCAL
:
4962 case SECCAT_DATA_REL_RO
:
4963 case SECCAT_DATA_REL_RO_LOCAL
:
4964 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
4967 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
4970 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
4973 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
4976 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
4979 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
4984 plen
= strlen (prefix
);
4986 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4987 name
= (* targetm
.strip_name_encoding
) (name
);
4988 nlen
= strlen (name
);
4990 string
= alloca (nlen
+ plen
+ 1);
4991 memcpy (string
, prefix
, plen
);
4992 memcpy (string
+ plen
, name
, nlen
+ 1);
4994 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
4998 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
5000 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
5003 switch (GET_CODE (x
))
5015 readonly_data_section ();
5019 default_elf_select_rtx_section (enum machine_mode mode
, rtx x
,
5020 unsigned HOST_WIDE_INT align
)
5022 /* ??? Handle small data here somehow. */
5025 switch (GET_CODE (x
))
5029 named_section (NULL_TREE
, ".data.rel.ro", 3);
5033 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
5040 mergeable_constant_section (mode
, align
, 0);
5043 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
5046 default_encode_section_info (tree decl
, rtx rtl
, int first ATTRIBUTE_UNUSED
)
5051 /* Careful not to prod global register variables. */
5052 if (GET_CODE (rtl
) != MEM
)
5054 symbol
= XEXP (rtl
, 0);
5055 if (GET_CODE (symbol
) != SYMBOL_REF
)
5059 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5060 flags
|= SYMBOL_FLAG_FUNCTION
;
5061 if ((*targetm
.binds_local_p
) (decl
))
5062 flags
|= SYMBOL_FLAG_LOCAL
;
5063 if ((*targetm
.in_small_data_p
) (decl
))
5064 flags
|= SYMBOL_FLAG_SMALL
;
5065 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5066 flags
|= decl_tls_model (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
5067 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
5068 being PUBLIC, the thing *must* be defined in this translation unit.
5069 Prevent this buglet from being propagated into rtl code as well. */
5070 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
5071 flags
|= SYMBOL_FLAG_EXTERNAL
;
5073 SYMBOL_REF_FLAGS (symbol
) = flags
;
5076 /* By default, we do nothing for encode_section_info, so we need not
5077 do anything but discard the '*' marker. */
5080 default_strip_name_encoding (const char *str
)
5082 return str
+ (*str
== '*');
5085 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5086 wrt cross-module name binding. */
5089 default_binds_local_p (tree exp
)
5091 return default_binds_local_p_1 (exp
, flag_shlib
);
5095 default_binds_local_p_1 (tree exp
, int shlib
)
5099 /* A non-decl is an entry in the constant pool. */
5102 /* Static variables are always local. */
5103 else if (! TREE_PUBLIC (exp
))
5105 /* A variable is local if the user tells us so. */
5106 else if (decl_visibility (exp
) != VISIBILITY_DEFAULT
)
5108 /* Otherwise, variables defined outside this object may not be local. */
5109 else if (DECL_EXTERNAL (exp
))
5111 /* Linkonce and weak data are never local. */
5112 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
5114 /* If PIC, then assume that any global name can be overridden by
5115 symbols resolved from other modules. */
5118 /* Uninitialized COMMON variable may be unified with symbols
5119 resolved from other modules. */
5120 else if (DECL_COMMON (exp
)
5121 && (DECL_INITIAL (exp
) == NULL
5122 || DECL_INITIAL (exp
) == error_mark_node
))
5124 /* Otherwise we're left with initialized (or non-common) global data
5125 which is of necessity defined locally. */
5132 /* Determine whether or not a pointer mode is valid. Assume defaults
5133 of ptr_mode or Pmode - can be overridden. */
5135 default_valid_pointer_mode (enum machine_mode mode
)
5137 return (mode
== ptr_mode
|| mode
== Pmode
);
5140 /* Default function to output code that will globalize a label. A
5141 target must define GLOBAL_ASM_OP or provide it's own function to
5142 globalize a label. */
5143 #ifdef GLOBAL_ASM_OP
5145 default_globalize_label (FILE * stream
, const char *name
)
5147 fputs (GLOBAL_ASM_OP
, stream
);
5148 assemble_name (stream
, name
);
5149 putc ('\n', stream
);
5151 #endif /* GLOBAL_ASM_OP */
5153 /* This is how to output an internal numbered label where PREFIX is
5154 the class of label and LABELNO is the number within the class. */
5157 default_internal_label (FILE *stream
, const char *prefix
,
5158 unsigned long labelno
)
5160 char *const buf
= alloca (40 + strlen (prefix
));
5161 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5162 ASM_OUTPUT_LABEL (stream
, buf
);
5165 /* This is the default behavior at the beginning of a file. It's
5166 controlled by two other target-hook toggles. */
5168 default_file_start (void)
5170 if (targetm
.file_start_app_off
&& !flag_verbose_asm
)
5171 fputs (ASM_APP_OFF
, asm_out_file
);
5173 if (targetm
.file_start_file_directive
)
5174 output_file_directive (asm_out_file
, main_input_filename
);
5177 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5178 which emits a special section directive used to indicate whether or
5179 not this object file needs an executable stack. This is primarily
5180 a GNU extension to ELF but could be used on other targets. */
5182 file_end_indicate_exec_stack (void)
5184 unsigned int flags
= SECTION_DEBUG
;
5185 if (trampolines_created
)
5186 flags
|= SECTION_CODE
;
5188 named_section_flags (".note.GNU-stack", flags
);
5191 #include "gt-varasm.h"