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 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
565 && TREE_CODE (decl
) == STRING_CST
566 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
568 && TREE_STRING_LENGTH (decl
) >= int_size_in_bytes (TREE_TYPE (decl
)))
570 enum machine_mode mode
;
571 unsigned int modesize
;
576 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (decl
)));
577 modesize
= GET_MODE_BITSIZE (mode
);
578 if (modesize
>= 8 && modesize
<= 256
579 && (modesize
& (modesize
- 1)) == 0)
581 if (align
< modesize
)
584 str
= TREE_STRING_POINTER (decl
);
585 len
= TREE_STRING_LENGTH (decl
);
586 unit
= GET_MODE_SIZE (mode
);
588 /* Check for embedded NUL characters. */
589 for (i
= 0; i
< len
; i
+= unit
)
591 for (j
= 0; j
< unit
; j
++)
592 if (str
[i
+ j
] != '\0')
599 sprintf (name
, ".rodata.str%d.%d", modesize
/ 8,
601 flags
|= (modesize
/ 8) | SECTION_MERGE
| SECTION_STRINGS
;
602 if (!i
&& modesize
< align
)
604 /* A "" string with requested alignment greater than
605 character size might cause a problem:
606 if some other string required even bigger
607 alignment than "", then linker might think the
608 "" is just part of padding after some other string
609 and not put it into the hash table initially.
610 But this means "" could have smaller alignment
612 #ifdef ASM_OUTPUT_SECTION_START
613 named_section_flags (name
, flags
);
614 ASM_OUTPUT_SECTION_START (asm_out_file
);
616 readonly_data_section ();
621 named_section_flags (name
, flags
);
627 readonly_data_section ();
630 /* Tell assembler to switch to the section for constant merging. */
633 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
634 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
635 unsigned int flags ATTRIBUTE_UNUSED
)
637 unsigned int modesize
= GET_MODE_BITSIZE (mode
);
639 if (HAVE_GAS_SHF_MERGE
&& flag_merge_constants
645 && (align
& (align
- 1)) == 0)
649 sprintf (name
, ".rodata.cst%d", (int) (align
/ 8));
650 flags
|= (align
/ 8) | SECTION_MERGE
;
651 named_section_flags (name
, flags
);
655 readonly_data_section ();
658 /* Given NAME, a putative register name, discard any customary prefixes. */
661 strip_reg_name (const char *name
)
663 #ifdef REGISTER_PREFIX
664 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
665 name
+= strlen (REGISTER_PREFIX
);
667 if (name
[0] == '%' || name
[0] == '#')
672 /* Decode an `asm' spec for a declaration as a register name.
673 Return the register number, or -1 if nothing specified,
674 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
675 or -3 if ASMSPEC is `cc' and is not recognized,
676 or -4 if ASMSPEC is `memory' and is not recognized.
677 Accept an exact spelling or a decimal number.
678 Prefixes such as % are optional. */
681 decode_reg_name (const char *asmspec
)
687 /* Get rid of confusing prefixes. */
688 asmspec
= strip_reg_name (asmspec
);
690 /* Allow a decimal number as a "register name". */
691 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
692 if (! ISDIGIT (asmspec
[i
]))
694 if (asmspec
[0] != 0 && i
< 0)
697 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
703 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
705 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
708 #ifdef ADDITIONAL_REGISTER_NAMES
710 static const struct { const char *const name
; const int number
; } table
[]
711 = ADDITIONAL_REGISTER_NAMES
;
713 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
714 if (! strcmp (asmspec
, table
[i
].name
))
715 return table
[i
].number
;
717 #endif /* ADDITIONAL_REGISTER_NAMES */
719 if (!strcmp (asmspec
, "memory"))
722 if (!strcmp (asmspec
, "cc"))
731 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
732 have static storage duration. In other words, it should not be an
733 automatic variable, including PARM_DECLs.
735 There is, however, one exception: this function handles variables
736 explicitly placed in a particular register by the user.
738 ASMSPEC, if not 0, is the string which the user specified as the
739 assembler symbol name.
741 This is never called for PARM_DECL nodes. */
744 make_decl_rtl (tree decl
, const char *asmspec
)
746 const char *name
= 0;
750 /* Check that we are not being given an automatic variable. */
751 /* A weak alias has TREE_PUBLIC set but not the other bits. */
752 if (TREE_CODE (decl
) == PARM_DECL
753 || TREE_CODE (decl
) == RESULT_DECL
754 || (TREE_CODE (decl
) == VAR_DECL
755 && !TREE_STATIC (decl
)
756 && !TREE_PUBLIC (decl
)
757 && !DECL_EXTERNAL (decl
)
758 && !DECL_REGISTER (decl
)))
760 /* And that we were not given a type or a label. */
761 else if (TREE_CODE (decl
) == TYPE_DECL
762 || TREE_CODE (decl
) == LABEL_DECL
)
765 /* For a duplicate declaration, we can be called twice on the
766 same DECL node. Don't discard the RTL already made. */
767 if (DECL_RTL_SET_P (decl
))
769 /* If the old RTL had the wrong mode, fix the mode. */
770 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
771 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
772 DECL_MODE (decl
), 0));
774 /* ??? Another way to do this would be to maintain a hashed
775 table of such critters. Instead of adding stuff to a DECL
776 to give certain attributes to it, we could use an external
777 hash map from DECL to set of attributes. */
779 /* Let the target reassign the RTL if it wants.
780 This is necessary, for example, when one machine specific
781 decl attribute overrides another. */
782 (* targetm
.encode_section_info
) (decl
, DECL_RTL (decl
), false);
786 reg_number
= decode_reg_name (asmspec
);
787 if (reg_number
== -2)
789 /* ASMSPEC is given, and not the name of a register. Mark the
790 name with a star so assemble_name won't munge it. */
791 char *starred
= alloca (strlen (asmspec
) + 2);
793 strcpy (starred
+ 1, asmspec
);
794 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (starred
));
797 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
799 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
801 /* First detect errors in declaring global registers. */
802 if (reg_number
== -1)
803 error ("%Jregister name not specified for '%D'", decl
, decl
);
804 else if (reg_number
< 0)
805 error ("%Jinvalid register name for '%D'", decl
, decl
);
806 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
807 error ("%Jdata type of '%D' isn't suitable for a register",
809 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
810 error ("%Jregister specified for '%D' isn't suitable for data type",
812 /* Now handle properly declared static register variables. */
817 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
819 DECL_INITIAL (decl
) = 0;
820 error ("global register variable has initial value");
822 if (TREE_THIS_VOLATILE (decl
))
823 warning ("volatile register variables don't work as you might wish");
825 /* If the user specified one of the eliminables registers here,
826 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
827 confused with that register and be eliminated. This usage is
828 somewhat suspect... */
830 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
831 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
832 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
834 if (TREE_STATIC (decl
))
836 /* Make this register global, so not usable for anything
838 #ifdef ASM_DECLARE_REGISTER_GLOBAL
839 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
841 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
843 globalize_reg (reg_number
+ --nregs
);
846 /* As a register variable, it has no section. */
851 /* Now handle ordinary static variables and functions (in memory).
852 Also handle vars declared register invalidly. */
854 if (reg_number
>= 0 || reg_number
== -3)
855 error ("%Jregister name given for non-register variable '%D'", decl
, decl
);
857 /* Specifying a section attribute on a variable forces it into a
858 non-.bss section, and thus it cannot be common. */
859 if (TREE_CODE (decl
) == VAR_DECL
860 && DECL_SECTION_NAME (decl
) != NULL_TREE
861 && DECL_INITIAL (decl
) == NULL_TREE
862 && DECL_COMMON (decl
))
863 DECL_COMMON (decl
) = 0;
865 /* Variables can't be both common and weak. */
866 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
867 DECL_COMMON (decl
) = 0;
869 x
= gen_rtx_SYMBOL_REF (Pmode
, name
);
870 SYMBOL_REF_WEAK (x
) = DECL_WEAK (decl
);
871 SYMBOL_REF_DECL (x
) = decl
;
873 x
= gen_rtx_MEM (DECL_MODE (decl
), x
);
874 if (TREE_CODE (decl
) != FUNCTION_DECL
)
875 set_mem_attributes (x
, decl
, 1);
876 SET_DECL_RTL (decl
, x
);
878 /* Optionally set flags or add text to the name to record information
879 such as that it is a function name.
880 If the name is changed, the macro ASM_OUTPUT_LABELREF
881 will have to know how to strip this information. */
882 (* targetm
.encode_section_info
) (decl
, DECL_RTL (decl
), true);
885 /* Make the rtl for variable VAR be volatile.
886 Use this only for static variables. */
889 make_var_volatile (tree var
)
891 if (GET_CODE (DECL_RTL (var
)) != MEM
)
894 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
897 /* Output a string of literal assembler code
898 for an `asm' keyword used between functions. */
901 assemble_asm (tree string
)
905 if (TREE_CODE (string
) == ADDR_EXPR
)
906 string
= TREE_OPERAND (string
, 0);
908 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
911 /* Record an element in the table of global destructors. SYMBOL is
912 a SYMBOL_REF of the function to be called; PRIORITY is a number
913 between 0 and MAX_INIT_PRIORITY. */
916 default_stabs_asm_out_destructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
918 /* Tell GNU LD that this is part of the static destructor set.
919 This will work for any system that uses stabs, most usefully
921 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
922 assemble_name (asm_out_file
, XSTR (symbol
, 0));
923 fputc ('\n', asm_out_file
);
927 default_named_section_asm_out_destructor (rtx symbol
, int priority
)
929 const char *section
= ".dtors";
932 /* ??? This only works reliably with the GNU linker. */
933 if (priority
!= DEFAULT_INIT_PRIORITY
)
935 sprintf (buf
, ".dtors.%.5u",
936 /* Invert the numbering so the linker puts us in the proper
937 order; constructors are run from right to left, and the
938 linker sorts in increasing order. */
939 MAX_INIT_PRIORITY
- priority
);
943 named_section_flags (section
, SECTION_WRITE
);
944 assemble_align (POINTER_SIZE
);
945 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
948 #ifdef DTORS_SECTION_ASM_OP
952 if (in_section
!= in_dtors
)
954 in_section
= in_dtors
;
955 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
956 fputc ('\n', asm_out_file
);
961 default_dtor_section_asm_out_destructor (rtx symbol
,
962 int priority ATTRIBUTE_UNUSED
)
965 assemble_align (POINTER_SIZE
);
966 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
970 /* Likewise for global constructors. */
973 default_stabs_asm_out_constructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
975 /* Tell GNU LD that this is part of the static destructor set.
976 This will work for any system that uses stabs, most usefully
978 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
979 assemble_name (asm_out_file
, XSTR (symbol
, 0));
980 fputc ('\n', asm_out_file
);
984 default_named_section_asm_out_constructor (rtx symbol
, int priority
)
986 const char *section
= ".ctors";
989 /* ??? This only works reliably with the GNU linker. */
990 if (priority
!= DEFAULT_INIT_PRIORITY
)
992 sprintf (buf
, ".ctors.%.5u",
993 /* Invert the numbering so the linker puts us in the proper
994 order; constructors are run from right to left, and the
995 linker sorts in increasing order. */
996 MAX_INIT_PRIORITY
- priority
);
1000 named_section_flags (section
, SECTION_WRITE
);
1001 assemble_align (POINTER_SIZE
);
1002 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1005 #ifdef CTORS_SECTION_ASM_OP
1007 ctors_section (void)
1009 if (in_section
!= in_ctors
)
1011 in_section
= in_ctors
;
1012 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1013 fputc ('\n', asm_out_file
);
1018 default_ctor_section_asm_out_constructor (rtx symbol
,
1019 int priority ATTRIBUTE_UNUSED
)
1022 assemble_align (POINTER_SIZE
);
1023 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1027 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1028 a nonzero value if the constant pool should be output before the
1029 start of the function, or a zero value if the pool should output
1030 after the end of the function. The default is to put it before the
1033 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1034 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1037 /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going
1038 to be output to assembler.
1039 Set first_global_object_name and weak_global_object_name as appropriate. */
1042 notice_global_symbol (tree decl
)
1044 if ((!first_global_object_name
|| !weak_global_object_name
)
1045 && TREE_PUBLIC (decl
) && !DECL_COMMON (decl
)
1046 && (TREE_CODE (decl
) == FUNCTION_DECL
1047 || (TREE_CODE (decl
) == VAR_DECL
1048 && (DECL_INITIAL (decl
) != 0
1049 && DECL_INITIAL (decl
) != error_mark_node
))))
1053 rtx decl_rtl
= DECL_RTL (decl
);
1055 p
= (* targetm
.strip_name_encoding
) (XSTR (XEXP (decl_rtl
, 0), 0));
1058 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1059 first_global_object_name
= name
;
1061 weak_global_object_name
= name
;
1065 /* Output assembler code for the constant pool of a function and associated
1066 with defining the name of the function. DECL describes the function.
1067 NAME is the function's name. For the constant pool, we use the current
1068 constant pool data. */
1071 assemble_start_function (tree decl
, const char *fnname
)
1075 /* The following code does not need preprocessing in the assembler. */
1079 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1080 output_constant_pool (fnname
, decl
);
1082 resolve_unique_section (decl
, 0, flag_function_sections
);
1083 function_section (decl
);
1085 /* Tell assembler to move to target machine's alignment for functions. */
1086 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1087 if (align
< force_align_functions_log
)
1088 align
= force_align_functions_log
;
1091 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1094 /* Handle a user-specified function alignment.
1095 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1096 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1097 if (align_functions_log
> align
1098 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1100 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1101 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1102 align_functions_log
, align_functions
- 1);
1104 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1108 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1109 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1112 (*debug_hooks
->begin_function
) (decl
);
1114 /* Make function name accessible from other files, if appropriate. */
1116 if (TREE_PUBLIC (decl
))
1118 notice_global_symbol (decl
);
1120 globalize_decl (decl
);
1122 maybe_assemble_visibility (decl
);
1125 /* Do any machine/system dependent processing of the function name */
1126 #ifdef ASM_DECLARE_FUNCTION_NAME
1127 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1129 /* Standard thing is just output label for the function. */
1130 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1131 #endif /* ASM_DECLARE_FUNCTION_NAME */
1134 /* Output assembler code associated with defining the size of the
1135 function. DECL describes the function. NAME is the function's name. */
1138 assemble_end_function (tree decl
, const char *fnname
)
1140 #ifdef ASM_DECLARE_FUNCTION_SIZE
1141 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1143 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1145 output_constant_pool (fnname
, decl
);
1146 function_section (decl
); /* need to switch back */
1150 /* Assemble code to leave SIZE bytes of zeros. */
1153 assemble_zeros (unsigned HOST_WIDE_INT size
)
1155 /* Do no output if -fsyntax-only. */
1156 if (flag_syntax_only
)
1159 #ifdef ASM_NO_SKIP_IN_TEXT
1160 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1161 so we must output 0s explicitly in the text section. */
1162 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1164 unsigned HOST_WIDE_INT i
;
1165 for (i
= 0; i
< size
; i
++)
1166 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1171 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1174 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1177 assemble_align (int align
)
1179 if (align
> BITS_PER_UNIT
)
1181 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1185 /* Assemble a string constant with the specified C string as contents. */
1188 assemble_string (const char *p
, int size
)
1193 /* If the string is very long, split it up. */
1197 int thissize
= size
- pos
;
1198 if (thissize
> maximum
)
1201 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1209 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1210 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1211 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1213 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1214 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1215 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1217 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1218 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1222 #if defined ASM_OUTPUT_ALIGNED_BSS
1223 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1224 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1226 #if defined ASM_OUTPUT_BSS
1227 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1228 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1234 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1235 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1236 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1238 #if defined ASM_OUTPUT_ALIGNED_COMMON
1239 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1240 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1242 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1243 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1248 asm_emit_uninitialised (tree decl
, const char *name
,
1249 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
1250 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
)
1258 destination
= asm_dest_local
;
1260 /* ??? We should handle .bss via select_section mechanisms rather than
1261 via special target hooks. That would eliminate this special case. */
1262 if (TREE_PUBLIC (decl
))
1264 if (!DECL_COMMON (decl
))
1266 destination
= asm_dest_bss
;
1271 destination
= asm_dest_common
;
1274 if (destination
== asm_dest_bss
)
1275 globalize_decl (decl
);
1276 resolve_unique_section (decl
, 0, flag_data_sections
);
1278 if (flag_shared_data
)
1280 switch (destination
)
1282 #ifdef ASM_OUTPUT_SHARED_BSS
1284 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1287 #ifdef ASM_OUTPUT_SHARED_COMMON
1288 case asm_dest_common
:
1289 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1292 #ifdef ASM_OUTPUT_SHARED_LOCAL
1293 case asm_dest_local
:
1294 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1302 switch (destination
)
1306 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1309 case asm_dest_common
:
1310 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1312 case asm_dest_local
:
1313 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1322 /* Assemble everything that is needed for a variable or function declaration.
1323 Not used for automatic variables, and not used for function definitions.
1324 Should not be called for variables of incomplete structure type.
1326 TOP_LEVEL is nonzero if this variable has file scope.
1327 AT_END is nonzero if this is the special handling, at end of compilation,
1328 to define things that have had only tentative definitions.
1329 DONT_OUTPUT_DATA if nonzero means don't actually output the
1330 initial value (that will be done by the caller). */
1333 assemble_variable (tree decl
, int top_level ATTRIBUTE_UNUSED
,
1334 int at_end ATTRIBUTE_UNUSED
, int dont_output_data
)
1341 if (lang_hooks
.decls
.prepare_assemble_variable
)
1342 (*lang_hooks
.decls
.prepare_assemble_variable
) (decl
);
1344 last_assemble_variable_decl
= 0;
1346 /* Normally no need to say anything here for external references,
1347 since assemble_external is called by the language-specific code
1348 when a declaration is first seen. */
1350 if (DECL_EXTERNAL (decl
))
1353 /* Output no assembler code for a function declaration.
1354 Only definitions of functions output anything. */
1356 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1359 /* Do nothing for global register variables. */
1360 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1362 TREE_ASM_WRITTEN (decl
) = 1;
1366 /* If type was incomplete when the variable was declared,
1367 see if it is complete now. */
1369 if (DECL_SIZE (decl
) == 0)
1370 layout_decl (decl
, 0);
1372 /* Still incomplete => don't allocate it; treat the tentative defn
1373 (which is what it must have been) as an `extern' reference. */
1375 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1377 error ("%Jstorage size of `%D' isn't known", decl
, decl
);
1378 TREE_ASM_WRITTEN (decl
) = 1;
1382 /* The first declaration of a variable that comes through this function
1383 decides whether it is global (in C, has external linkage)
1384 or local (in C, has internal linkage). So do nothing more
1385 if this function has already run. */
1387 if (TREE_ASM_WRITTEN (decl
))
1390 /* Make sure targetm.encode_section_info is invoked before we set
1392 decl_rtl
= DECL_RTL (decl
);
1394 TREE_ASM_WRITTEN (decl
) = 1;
1396 /* Do no output if -fsyntax-only. */
1397 if (flag_syntax_only
)
1402 if (! dont_output_data
1403 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1405 error ("%Jsize of variable '%D' is too large", decl
, decl
);
1409 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1410 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1411 notice_global_symbol (decl
);
1413 /* Compute the alignment of this data. */
1415 align
= DECL_ALIGN (decl
);
1417 /* In the case for initialing an array whose length isn't specified,
1418 where we have not yet been able to do the layout,
1419 figure out the proper alignment now. */
1420 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1421 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1422 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1424 /* Some object file formats have a maximum alignment which they support.
1425 In particular, a.out format supports a maximum alignment of 4. */
1426 #ifndef MAX_OFILE_ALIGNMENT
1427 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1429 if (align
> MAX_OFILE_ALIGNMENT
)
1431 warning ("%Jalignment of '%D' is greater than maximum object "
1432 "file alignment. Using %d", decl
, decl
,
1433 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1434 align
= MAX_OFILE_ALIGNMENT
;
1437 /* On some machines, it is good to increase alignment sometimes. */
1438 if (! DECL_USER_ALIGN (decl
))
1440 #ifdef DATA_ALIGNMENT
1441 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1443 #ifdef CONSTANT_ALIGNMENT
1444 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1445 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1449 /* Reset the alignment in case we have made it tighter, so we can benefit
1450 from it in get_pointer_alignment. */
1451 DECL_ALIGN (decl
) = align
;
1452 set_mem_align (decl_rtl
, align
);
1454 if (TREE_PUBLIC (decl
))
1455 maybe_assemble_visibility (decl
);
1457 /* Output any data that we will need to use the address of. */
1458 if (DECL_INITIAL (decl
) == error_mark_node
)
1459 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1460 else if (DECL_INITIAL (decl
))
1461 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1462 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1464 /* Handle uninitialized definitions. */
1466 /* If the decl has been given an explicit section name, then it
1467 isn't common, and shouldn't be handled as such. */
1468 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1470 /* We don't implement common thread-local data at present. */
1471 else if (DECL_THREAD_LOCAL (decl
))
1473 if (DECL_COMMON (decl
))
1474 sorry ("thread-local COMMON data not implemented");
1476 else if (DECL_INITIAL (decl
) == 0
1477 || DECL_INITIAL (decl
) == error_mark_node
1478 || (flag_zero_initialized_in_bss
1479 /* Leave constant zeroes in .rodata so they can be shared. */
1480 && !TREE_READONLY (decl
)
1481 && initializer_zerop (DECL_INITIAL (decl
))))
1483 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1484 unsigned HOST_WIDE_INT rounded
= size
;
1486 /* Don't allocate zero bytes of common,
1487 since that means "undefined external" in the linker. */
1491 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1492 so that each uninitialized object starts on such a boundary. */
1493 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1494 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1495 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1497 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1498 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1499 warning ("%Jrequested alignment for '%D' is greater than "
1500 "implemented alignment of %d", decl
, decl
, rounded
);
1503 /* If the target cannot output uninitialized but not common global data
1504 in .bss, then we have to use .data, so fall through. */
1505 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1509 /* Handle initialized definitions.
1510 Also handle uninitialized global definitions if -fno-common and the
1511 target doesn't support ASM_OUTPUT_BSS. */
1513 /* First make the assembler name(s) global if appropriate. */
1514 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1515 globalize_decl (decl
);
1517 /* Switch to the appropriate section. */
1518 variable_section (decl
, reloc
);
1520 /* dbxout.c needs to know this. */
1521 if (in_text_section ())
1522 DECL_IN_TEXT_SECTION (decl
) = 1;
1524 /* Output the alignment of this data. */
1525 if (align
> BITS_PER_UNIT
)
1527 ASM_OUTPUT_ALIGN (asm_out_file
,
1528 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1531 /* Do any machine/system dependent processing of the object. */
1532 #ifdef ASM_DECLARE_OBJECT_NAME
1533 last_assemble_variable_decl
= decl
;
1534 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1536 /* Standard thing is just output label for the object. */
1537 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1538 #endif /* ASM_DECLARE_OBJECT_NAME */
1540 if (!dont_output_data
)
1542 if (DECL_INITIAL (decl
) && DECL_INITIAL (decl
) != error_mark_node
)
1543 /* Output the actual data. */
1544 output_constant (DECL_INITIAL (decl
),
1545 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1548 /* Leave space for it. */
1549 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1553 /* Return 1 if type TYPE contains any pointers. */
1556 contains_pointers_p (tree type
)
1558 switch (TREE_CODE (type
))
1561 case REFERENCE_TYPE
:
1562 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1563 so I'll play safe and return 1. */
1569 case QUAL_UNION_TYPE
:
1572 /* For a type that has fields, see if the fields have pointers. */
1573 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1574 if (TREE_CODE (fields
) == FIELD_DECL
1575 && contains_pointers_p (TREE_TYPE (fields
)))
1581 /* An array type contains pointers if its element type does. */
1582 return contains_pointers_p (TREE_TYPE (type
));
1589 /* Output something to declare an external symbol to the assembler.
1590 (Most assemblers don't need this, so we normally output nothing.)
1591 Do nothing if DECL is not external. */
1594 assemble_external (tree decl ATTRIBUTE_UNUSED
)
1596 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1597 main body of this code is only rarely exercised. To provide some
1598 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1599 open. If it's not, we should not be calling this function. */
1603 #ifdef ASM_OUTPUT_EXTERNAL
1604 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1606 rtx rtl
= DECL_RTL (decl
);
1608 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1609 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1611 /* Some systems do require some output. */
1612 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1613 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1619 /* Similar, for calling a library function FUN. */
1622 assemble_external_libcall (rtx fun
)
1624 /* Declare library function name external when first used, if nec. */
1625 if (! SYMBOL_REF_USED (fun
))
1627 SYMBOL_REF_USED (fun
) = 1;
1628 (*targetm
.asm_out
.external_libcall
) (fun
);
1632 /* Assemble a label named NAME. */
1635 assemble_label (const char *name
)
1637 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1640 /* Set the symbol_referenced flag for ID and notify callgraph code. */
1642 mark_referenced (tree id
)
1644 if (!TREE_SYMBOL_REFERENCED (id
))
1646 struct cgraph_node
*node
;
1647 struct cgraph_varpool_node
*vnode
;
1649 if (!cgraph_global_info_ready
)
1651 node
= cgraph_node_for_identifier (id
);
1653 cgraph_mark_needed_node (node
);
1656 vnode
= cgraph_varpool_node_for_identifier (id
);
1658 cgraph_varpool_mark_needed_node (vnode
);
1660 TREE_SYMBOL_REFERENCED (id
) = 1;
1663 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1664 If NAME starts with a *, the rest of NAME is output verbatim.
1665 Otherwise NAME is transformed in an implementation-defined way
1666 (usually by the addition of an underscore).
1667 Many macros in the tm file are defined to call this function. */
1670 assemble_name (FILE *file
, const char *name
)
1672 const char *real_name
;
1675 real_name
= (* targetm
.strip_name_encoding
) (name
);
1677 id
= maybe_get_identifier (real_name
);
1679 mark_referenced (id
);
1682 fputs (&name
[1], file
);
1684 ASM_OUTPUT_LABELREF (file
, name
);
1687 /* Allocate SIZE bytes writable static space with a gensym name
1688 and return an RTX to refer to its address. */
1691 assemble_static_space (unsigned HOST_WIDE_INT size
)
1694 const char *namestring
;
1698 if (flag_shared_data
)
1702 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1704 namestring
= ggc_strdup (name
);
1706 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1707 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
1709 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1710 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1713 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1714 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1717 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1718 so that each uninitialized object starts on such a boundary. */
1719 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1720 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1721 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1722 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1723 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1724 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1731 /* Assemble the static constant template for function entry trampolines.
1732 This is done at most once per compilation.
1733 Returns an RTX for the address of the template. */
1735 #ifdef TRAMPOLINE_TEMPLATE
1737 assemble_trampoline_template (void)
1744 /* By default, put trampoline templates in read-only data section. */
1746 #ifdef TRAMPOLINE_SECTION
1747 TRAMPOLINE_SECTION ();
1749 readonly_data_section ();
1752 /* Write the assembler code to define one. */
1753 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1756 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1759 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LTRAMP", 0);
1760 TRAMPOLINE_TEMPLATE (asm_out_file
);
1762 /* Record the rtl to refer to it. */
1763 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1764 name
= ggc_strdup (label
);
1765 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
1766 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
1772 /* A and B are either alignments or offsets. Return the minimum alignment
1773 that may be assumed after adding the two together. */
1775 static inline unsigned
1776 min_align (unsigned int a
, unsigned int b
)
1778 return (a
| b
) & -(a
| b
);
1781 /* Return the assembler directive for creating a given kind of integer
1782 object. SIZE is the number of bytes in the object and ALIGNED_P
1783 indicates whether it is known to be aligned. Return NULL if the
1784 assembly dialect has no such directive.
1786 The returned string should be printed at the start of a new line and
1787 be followed immediately by the object's initial value. */
1790 integer_asm_op (int size
, int aligned_p
)
1792 struct asm_int_op
*ops
;
1795 ops
= &targetm
.asm_out
.aligned_op
;
1797 ops
= &targetm
.asm_out
.unaligned_op
;
1802 return targetm
.asm_out
.byte_op
;
1816 /* Use directive OP to assemble an integer object X. Print OP at the
1817 start of the line, followed immediately by the value of X. */
1820 assemble_integer_with_op (const char *op
, rtx x
)
1822 fputs (op
, asm_out_file
);
1823 output_addr_const (asm_out_file
, x
);
1824 fputc ('\n', asm_out_file
);
1827 /* The default implementation of the asm_out.integer target hook. */
1830 default_assemble_integer (rtx x ATTRIBUTE_UNUSED
,
1831 unsigned int size ATTRIBUTE_UNUSED
,
1832 int aligned_p ATTRIBUTE_UNUSED
)
1834 const char *op
= integer_asm_op (size
, aligned_p
);
1835 return op
&& (assemble_integer_with_op (op
, x
), true);
1838 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1839 the alignment of the integer in bits. Return 1 if we were able to output
1840 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1844 assemble_integer (rtx x
, unsigned int size
, unsigned int align
, int force
)
1848 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
1850 /* See if the target hook can handle this kind of object. */
1851 if ((*targetm
.asm_out
.integer
) (x
, size
, aligned_p
))
1854 /* If the object is a multi-byte one, try splitting it up. Split
1855 it into words it if is multi-word, otherwise split it into bytes. */
1858 enum machine_mode omode
, imode
;
1859 unsigned int subalign
;
1860 unsigned int subsize
, i
;
1862 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
1863 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
1864 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
1865 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1867 for (i
= 0; i
< size
; i
+= subsize
)
1869 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
1870 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
1876 /* If we've printed some of it, but not all of it, there's no going
1889 assemble_real (REAL_VALUE_TYPE d
, enum machine_mode mode
, unsigned int align
)
1893 unsigned int nalign
= min_align (align
, 32);
1895 switch (BITS_PER_UNIT
)
1901 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1902 assemble_integer (GEN_INT (l
), 4, align
, 1);
1905 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1906 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1907 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1910 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
1911 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1912 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1913 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
1916 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
1917 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1918 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1919 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
1920 assemble_integer (GEN_INT (data
[3]), 4, nalign
, 1);
1931 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1932 assemble_integer (GEN_INT (l
), 2, align
, 1);
1935 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1936 assemble_integer (GEN_INT (data
[0]), 2, align
, 1);
1937 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
1948 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1949 assemble_integer (GEN_INT (l
), 1, align
, 1);
1952 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1953 assemble_integer (GEN_INT (data
[0]), 1, align
, 1);
1954 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
1966 /* Given an expression EXP with a constant value,
1967 reduce it to the sum of an assembler symbol and an integer.
1968 Store them both in the structure *VALUE.
1969 Abort if EXP does not reduce. */
1971 struct addr_const
GTY(())
1974 HOST_WIDE_INT offset
;
1978 decode_addr_const (tree exp
, struct addr_const
*value
)
1980 tree target
= TREE_OPERAND (exp
, 0);
1986 if (TREE_CODE (target
) == COMPONENT_REF
1987 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
1990 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
1991 target
= TREE_OPERAND (target
, 0);
1993 else if (TREE_CODE (target
) == ARRAY_REF
1994 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
1996 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
1997 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
1998 target
= TREE_OPERAND (target
, 0);
2004 switch (TREE_CODE (target
))
2008 x
= DECL_RTL (target
);
2012 x
= gen_rtx_MEM (FUNCTION_MODE
,
2013 gen_rtx_LABEL_REF (VOIDmode
, force_label_rtx (target
)));
2021 x
= output_constant_def (target
, 1);
2028 if (GET_CODE (x
) != MEM
)
2033 value
->offset
= offset
;
2036 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2037 enum kind
{ RTX_UNKNOWN
, RTX_DOUBLE
, RTX_VECTOR
, RTX_INT
, RTX_UNSPEC
};
2038 struct rtx_const
GTY(())
2040 ENUM_BITFIELD(kind
) kind
: 16;
2041 ENUM_BITFIELD(machine_mode
) mode
: 16;
2042 union rtx_const_un
{
2043 REAL_VALUE_TYPE
GTY ((tag ("4"))) du
;
2044 struct rtx_const_u_addr
{
2047 HOST_WIDE_INT offset
;
2048 } GTY ((tag ("1"))) addr
;
2049 struct rtx_const_u_di
{
2052 } GTY ((tag ("0"))) di
;
2054 /* The max vector size we have is 16 wide; two variants for
2055 integral and floating point vectors. */
2056 struct rtx_const_int_vec
{
2059 } GTY ((tag ("2"))) int_vec
[16];
2061 REAL_VALUE_TYPE
GTY ((tag ("3"))) fp_vec
[8];
2063 } GTY ((desc ("%1.kind >= RTX_INT"), descbits ("1"))) un
;
2066 /* Uniquize all constants that appear in memory.
2067 Each constant in memory thus far output is recorded
2068 in `const_hash_table'. */
2070 struct constant_descriptor_tree
GTY(())
2072 /* A MEM for the constant. */
2075 /* The value of the constant. */
2079 static GTY((param_is (struct constant_descriptor_tree
)))
2080 htab_t const_desc_htab
;
2082 static struct constant_descriptor_tree
* build_constant_desc (tree
);
2083 static void maybe_output_constant_def_contents (struct constant_descriptor_tree
*, int);
2085 /* Compute a hash code for a constant expression. */
2088 const_desc_hash (const void *ptr
)
2090 return const_hash_1 (((struct constant_descriptor_tree
*)ptr
)->value
);
2094 const_hash_1 (const tree exp
)
2099 enum tree_code code
= TREE_CODE (exp
);
2101 /* Either set P and LEN to the address and len of something to hash and
2102 exit the switch or return a value. */
2107 p
= (char *) &TREE_INT_CST (exp
);
2108 len
= sizeof TREE_INT_CST (exp
);
2112 return real_hash (TREE_REAL_CST_PTR (exp
));
2115 p
= TREE_STRING_POINTER (exp
);
2116 len
= TREE_STRING_LENGTH (exp
);
2119 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2120 + const_hash_1 (TREE_IMAGPART (exp
)));
2123 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2127 len
= int_size_in_bytes (TREE_TYPE (exp
));
2129 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2137 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2139 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2140 if (TREE_VALUE (link
))
2141 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2149 struct addr_const value
;
2151 decode_addr_const (exp
, &value
);
2152 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2154 /* Don't hash the address of the SYMBOL_REF;
2155 only use the offset and the symbol name. */
2157 p
= XSTR (value
.base
, 0);
2158 for (i
= 0; p
[i
] != 0; i
++)
2159 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2161 else if (GET_CODE (value
.base
) == LABEL_REF
)
2162 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2170 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2171 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2175 case NON_LVALUE_EXPR
:
2176 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2179 /* A language specific constant. Just hash the code. */
2183 /* Compute hashing function. */
2185 for (i
= 0; i
< len
; i
++)
2186 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2191 /* Wrapper of compare_constant, for the htab interface. */
2193 const_desc_eq (const void *p1
, const void *p2
)
2195 return compare_constant (((struct constant_descriptor_tree
*)p1
)->value
,
2196 ((struct constant_descriptor_tree
*)p2
)->value
);
2199 /* Compare t1 and t2, and return 1 only if they are known to result in
2200 the same bit pattern on output. */
2203 compare_constant (const tree t1
, const tree t2
)
2205 enum tree_code typecode
;
2207 if (t1
== NULL_TREE
)
2208 return t2
== NULL_TREE
;
2209 if (t2
== NULL_TREE
)
2212 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2215 switch (TREE_CODE (t1
))
2218 /* Integer constants are the same only if the same width of type. */
2219 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2221 return tree_int_cst_equal (t1
, t2
);
2224 /* Real constants are the same only if the same width of type. */
2225 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2228 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2231 if (flag_writable_strings
)
2234 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2237 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2238 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2239 TREE_STRING_LENGTH (t1
)));
2242 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2243 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2246 typecode
= TREE_CODE (TREE_TYPE (t1
));
2247 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2250 if (typecode
== SET_TYPE
)
2252 int len
= int_size_in_bytes (TREE_TYPE (t2
));
2253 unsigned char *tmp1
, *tmp2
;
2255 if (int_size_in_bytes (TREE_TYPE (t1
)) != len
)
2258 tmp1
= alloca (len
);
2259 tmp2
= alloca (len
);
2261 if (get_set_constructor_bytes (t1
, tmp1
, len
) != NULL_TREE
)
2263 if (get_set_constructor_bytes (t2
, tmp2
, len
) != NULL_TREE
)
2266 return memcmp (tmp1
, tmp2
, len
) != 0;
2272 if (typecode
== ARRAY_TYPE
)
2274 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2275 /* For arrays, check that the sizes all match. */
2276 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2278 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2283 /* For record and union constructors, require exact type
2285 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2289 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2291 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2293 /* Check that each value is the same... */
2294 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2296 /* ... and that they apply to the same fields! */
2297 if (typecode
== ARRAY_TYPE
)
2299 if (! compare_constant (TREE_PURPOSE (l1
),
2305 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2310 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2316 struct addr_const value1
, value2
;
2318 decode_addr_const (t1
, &value1
);
2319 decode_addr_const (t2
, &value2
);
2320 return (value1
.offset
== value2
.offset
2321 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2327 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2328 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2332 case NON_LVALUE_EXPR
:
2333 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2338 nt1
= (*lang_hooks
.expand_constant
) (t1
);
2339 nt2
= (*lang_hooks
.expand_constant
) (t2
);
2340 if (nt1
!= t1
|| nt2
!= t2
)
2341 return compare_constant (nt1
, nt2
);
2347 /* Should not get here. */
2351 /* Make a copy of the whole tree structure for a constant. This
2352 handles the same types of nodes that compare_constant handles. */
2355 copy_constant (tree exp
)
2357 switch (TREE_CODE (exp
))
2360 /* For ADDR_EXPR, we do not want to copy the decl whose address
2361 is requested. We do want to copy constants though. */
2362 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2363 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2364 copy_constant (TREE_OPERAND (exp
, 0)));
2366 return copy_node (exp
);
2371 return copy_node (exp
);
2374 return build_complex (TREE_TYPE (exp
),
2375 copy_constant (TREE_REALPART (exp
)),
2376 copy_constant (TREE_IMAGPART (exp
)));
2380 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2381 copy_constant (TREE_OPERAND (exp
, 0)),
2382 copy_constant (TREE_OPERAND (exp
, 1)));
2386 case NON_LVALUE_EXPR
:
2387 case VIEW_CONVERT_EXPR
:
2388 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2389 copy_constant (TREE_OPERAND (exp
, 0)));
2393 tree copy
= copy_node (exp
);
2394 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2397 CONSTRUCTOR_ELTS (copy
) = list
;
2398 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2399 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2400 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2401 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2402 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2410 t
= (*lang_hooks
.expand_constant
) (exp
);
2412 return copy_constant (t
);
2419 /* Subroutine of output_constant_def:
2420 No constant equal to EXP is known to have been output.
2421 Make a constant descriptor to enter EXP in the hash table.
2422 Assign the label number and construct RTL to refer to the
2423 constant's location in memory.
2424 Caller is responsible for updating the hash table. */
2426 static struct constant_descriptor_tree
*
2427 build_constant_desc (tree exp
)
2433 struct constant_descriptor_tree
*desc
;
2435 desc
= ggc_alloc (sizeof (*desc
));
2436 desc
->value
= copy_constant (exp
);
2438 /* Create a string containing the label name, in LABEL. */
2439 labelno
= const_labelno
++;
2440 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2442 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2443 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2444 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2445 SYMBOL_REF_DECL (symbol
) = desc
->value
;
2446 TREE_CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2448 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2449 set_mem_attributes (rtl
, exp
, 1);
2450 set_mem_alias_set (rtl
, 0);
2451 set_mem_alias_set (rtl
, const_alias_set
);
2453 /* Set flags or add text to the name to record information, such as
2454 that it is a local symbol. If the name is changed, the macro
2455 ASM_OUTPUT_LABELREF will have to know how to strip this
2456 information. This call might invalidate our local variable
2457 SYMBOL; we can't use it afterward. */
2459 (*targetm
.encode_section_info
) (exp
, rtl
, true);
2466 /* Return an rtx representing a reference to constant data in memory
2467 for the constant expression EXP.
2469 If assembler code for such a constant has already been output,
2470 return an rtx to refer to it.
2471 Otherwise, output such a constant in memory
2472 and generate an rtx for it.
2474 If DEFER is nonzero, this constant can be deferred and output only
2475 if referenced in the function after all optimizations.
2477 The const_hash_table records which constants already have label strings. */
2480 output_constant_def (tree exp
, int defer
)
2482 struct constant_descriptor_tree
*desc
;
2483 struct constant_descriptor_tree key
;
2486 /* Look up EXP in the table of constant descriptors. If we didn't find
2487 it, create a new one. */
2489 loc
= htab_find_slot (const_desc_htab
, &key
, INSERT
);
2494 desc
= build_constant_desc (exp
);
2498 maybe_output_constant_def_contents (desc
, defer
);
2502 /* Subroutine of output_constant_def: Decide whether or not we need to
2503 output the constant DESC now, and if so, do it. */
2505 maybe_output_constant_def_contents (struct constant_descriptor_tree
*desc
,
2508 rtx symbol
= XEXP (desc
->rtl
, 0);
2509 tree exp
= desc
->value
;
2511 if (flag_syntax_only
)
2514 if (TREE_ASM_WRITTEN (exp
))
2515 /* Already output; don't do it again. */
2518 /* The only constants that cannot safely be deferred, assuming the
2519 context allows it, are strings under flag_writable_strings. */
2520 if (defer
&& (TREE_CODE (exp
) != STRING_CST
|| !flag_writable_strings
))
2522 /* Increment n_deferred_constants if it exists. It needs to be at
2523 least as large as the number of constants actually referred to
2524 by the function. If it's too small we'll stop looking too early
2525 and fail to emit constants; if it's too large we'll only look
2526 through the entire function when we could have stopped earlier. */
2528 n_deferred_constants
++;
2532 output_constant_def_contents (symbol
);
2535 /* We must output the constant data referred to by SYMBOL; do so. */
2538 output_constant_def_contents (rtx symbol
)
2540 tree exp
= SYMBOL_REF_DECL (symbol
);
2541 const char *label
= XSTR (symbol
, 0);
2544 /* Make sure any other constants whose addresses appear in EXP
2545 are assigned label numbers. */
2546 int reloc
= output_addressed_constants (exp
);
2548 /* Align the location counter as required by EXP's data type. */
2549 int align
= TYPE_ALIGN (TREE_TYPE (exp
));
2550 #ifdef CONSTANT_ALIGNMENT
2551 align
= CONSTANT_ALIGNMENT (exp
, align
);
2554 /* We are no longer deferring this constant. */
2555 TREE_ASM_WRITTEN (exp
) = 1;
2557 if (IN_NAMED_SECTION (exp
))
2558 named_section (exp
, NULL
, reloc
);
2560 (*targetm
.asm_out
.select_section
) (exp
, reloc
, align
);
2562 if (align
> BITS_PER_UNIT
)
2564 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2567 size
= int_size_in_bytes (TREE_TYPE (exp
));
2568 if (TREE_CODE (exp
) == STRING_CST
)
2569 size
= MAX (TREE_STRING_LENGTH (exp
), size
);
2571 /* Do any machine/system dependent processing of the constant. */
2572 #ifdef ASM_DECLARE_CONSTANT_NAME
2573 ASM_DECLARE_CONSTANT_NAME (asm_out_file
, label
, exp
, size
);
2575 /* Standard thing is just output label for the constant. */
2576 ASM_OUTPUT_LABEL (asm_out_file
, label
);
2577 #endif /* ASM_DECLARE_CONSTANT_NAME */
2579 /* Output the value of EXP. */
2580 output_constant (exp
, size
, align
);
2583 /* A constant which was deferred in its original location has been
2584 inserted by the RTL inliner into a different function. The
2585 current function's deferred constant count must be incremented. */
2587 notice_rtl_inlining_of_deferred_constant (void)
2589 n_deferred_constants
++;
2592 /* Look up EXP in the table of constant descriptors. Return the rtl
2593 if it has been emitted, else null. */
2596 lookup_constant_def (tree exp
)
2598 struct constant_descriptor_tree
*desc
;
2599 struct constant_descriptor_tree key
;
2602 desc
= htab_find (const_desc_htab
, &key
);
2604 return (desc
? desc
->rtl
: NULL_RTX
);
2607 /* Used in the hash tables to avoid outputting the same constant
2608 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2609 are output once per function, not once per file; there seems
2610 to be no reason for the difference. */
2612 struct constant_descriptor_rtx
GTY(())
2614 /* More constant_descriptors with the same hash code. */
2615 struct constant_descriptor_rtx
*next
;
2617 /* A MEM for the constant. */
2620 /* The value of the constant. */
2621 struct rtx_const value
;
2624 /* Structure to represent sufficient information about a constant so that
2625 it can be output when the constant pool is output, so that function
2626 integration can be done, and to simplify handling on machines that reference
2627 constant pool as base+displacement. */
2629 struct pool_constant
GTY(())
2631 struct constant_descriptor_rtx
*desc
;
2632 struct pool_constant
*next
;
2633 struct pool_constant
*next_sym
;
2635 enum machine_mode mode
;
2638 HOST_WIDE_INT offset
;
2642 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2643 The argument is XSTR (... , 0) */
2645 #define SYMHASH(LABEL) (((unsigned long) (LABEL)) % MAX_RTX_HASH_TABLE)
2647 /* Initialize constant pool hashing for a new function. */
2650 init_varasm_status (struct function
*f
)
2652 struct varasm_status
*p
;
2653 p
= ggc_alloc (sizeof (struct varasm_status
));
2655 p
->x_const_rtx_hash_table
2656 = ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2657 * sizeof (struct constant_descriptor_rtx
*));
2658 p
->x_const_rtx_sym_hash_table
2659 = ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2660 * sizeof (struct pool_constant
*));
2662 p
->x_first_pool
= p
->x_last_pool
= 0;
2663 p
->x_pool_offset
= 0;
2664 p
->deferred_constants
= 0;
2668 /* Express an rtx for a constant integer (perhaps symbolic)
2669 as the sum of a symbol or label plus an explicit integer.
2670 They are stored into VALUE. */
2673 decode_rtx_const (enum machine_mode mode
, rtx x
, struct rtx_const
*value
)
2675 /* Clear the whole structure, including any gaps. */
2676 memset (value
, 0, sizeof (struct rtx_const
));
2678 value
->kind
= RTX_INT
; /* Most usual kind. */
2681 switch (GET_CODE (x
))
2684 value
->kind
= RTX_DOUBLE
;
2685 if (GET_MODE (x
) != VOIDmode
)
2687 const REAL_VALUE_TYPE
*r
= CONST_DOUBLE_REAL_VALUE (x
);
2689 value
->mode
= GET_MODE (x
);
2691 /* Copy the REAL_VALUE_TYPE by members so that we don't
2692 copy garbage from the original structure into our
2693 carefully cleaned hashing structure. */
2694 value
->un
.du
.class = r
->class;
2695 value
->un
.du
.sign
= r
->sign
;
2702 value
->un
.du
.exp
= r
->exp
;
2705 memcpy (value
->un
.du
.sig
, r
->sig
, sizeof (r
->sig
));
2713 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
2714 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
2722 units
= CONST_VECTOR_NUNITS (x
);
2723 value
->kind
= RTX_VECTOR
;
2726 if (GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
)
2728 for (i
= 0; i
< units
; ++i
)
2730 rtx elt
= CONST_VECTOR_ELT (x
, i
);
2731 if (GET_CODE (elt
) == CONST_INT
)
2733 value
->un
.int_vec
[i
].low
= INTVAL (elt
);
2734 value
->un
.int_vec
[i
].high
= 0;
2738 value
->un
.int_vec
[i
].low
= CONST_DOUBLE_LOW (elt
);
2739 value
->un
.int_vec
[i
].high
= CONST_DOUBLE_HIGH (elt
);
2743 else if (GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
2745 for (i
= 0; i
< units
; ++i
)
2747 const REAL_VALUE_TYPE
*r
2748 = CONST_DOUBLE_REAL_VALUE (CONST_VECTOR_ELT (x
, i
));
2749 REAL_VALUE_TYPE
*d
= &value
->un
.fp_vec
[i
];
2751 /* Copy the REAL_VALUE_TYPE by members so that we don't
2752 copy garbage from the original structure into our
2753 carefully cleaned hashing structure. */
2754 d
->class = r
->class;
2765 memcpy (d
->sig
, r
->sig
, sizeof (r
->sig
));
2778 value
->un
.addr
.offset
= INTVAL (x
);
2784 value
->un
.addr
.base
= x
;
2789 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
2791 value
->un
.addr
.base
= XEXP (x
, 0);
2792 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
2794 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
2796 value
->un
.addr
.base
= XEXP (x
, 0);
2797 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
2801 value
->un
.addr
.base
= x
;
2802 value
->un
.addr
.offset
= 0;
2807 value
->kind
= RTX_UNKNOWN
;
2811 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0
2812 && GET_CODE (value
->un
.addr
.base
) == UNSPEC
)
2814 /* For a simple UNSPEC, the base is set to the
2815 operand, the kind field is set to the index of
2816 the unspec expression.
2817 Together with the code below, in case that
2818 the operand is a SYMBOL_REF or LABEL_REF,
2819 the address of the string or the code_label
2820 is taken as base. */
2821 if (XVECLEN (value
->un
.addr
.base
, 0) == 1)
2823 value
->kind
= RTX_UNSPEC
+ XINT (value
->un
.addr
.base
, 1);
2824 value
->un
.addr
.base
= XVECEXP (value
->un
.addr
.base
, 0, 0);
2828 if (value
->kind
>= RTX_INT
&& value
->un
.addr
.base
!= 0)
2829 switch (GET_CODE (value
->un
.addr
.base
))
2832 /* Use the string's address, not the SYMBOL_REF's address,
2833 for the sake of addresses of library routines. */
2834 value
->un
.addr
.symbol
= XSTR (value
->un
.addr
.base
, 0);
2835 value
->un
.addr
.base
= NULL_RTX
;
2839 /* For a LABEL_REF, compare labels. */
2840 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
2847 /* Given a MINUS expression, simplify it if both sides
2848 include the same symbol. */
2851 simplify_subtraction (rtx x
)
2853 struct rtx_const val0
, val1
;
2855 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
2856 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
2858 if (val0
.kind
>= RTX_INT
2859 && val0
.kind
== val1
.kind
2860 && val0
.un
.addr
.base
== val1
.un
.addr
.base
2861 && val0
.un
.addr
.symbol
== val1
.un
.addr
.symbol
)
2862 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
2867 /* Compute a hash code for a constant RTL expression. */
2870 const_hash_rtx (enum machine_mode mode
, rtx x
)
2873 struct rtx_const value
;
2874 unsigned int data
[sizeof(struct rtx_const
) / sizeof (unsigned int)];
2880 decode_rtx_const (mode
, x
, &u
.value
);
2882 /* Compute hashing function. */
2884 for (i
= 0; i
< ARRAY_SIZE (u
.data
); i
++)
2885 hi
= hi
* 613 + u
.data
[i
];
2887 return hi
% MAX_RTX_HASH_TABLE
;
2890 /* Compare a constant rtl object X with a constant-descriptor DESC.
2891 Return 1 if DESC describes a constant with the same value as X. */
2894 compare_constant_rtx (enum machine_mode mode
, rtx x
,
2895 struct constant_descriptor_rtx
*desc
)
2897 struct rtx_const value
;
2899 decode_rtx_const (mode
, x
, &value
);
2901 /* Compare constant contents. */
2902 return memcmp (&value
, &desc
->value
, sizeof (struct rtx_const
)) == 0;
2905 /* Construct a constant descriptor for the rtl-expression X.
2906 It is up to the caller to enter the descriptor in the hash table. */
2908 static struct constant_descriptor_rtx
*
2909 record_constant_rtx (enum machine_mode mode
, rtx x
)
2911 struct constant_descriptor_rtx
*ptr
;
2913 ptr
= ggc_alloc (sizeof (*ptr
));
2914 decode_rtx_const (mode
, x
, &ptr
->value
);
2919 /* Given a constant rtx X, make (or find) a memory constant for its value
2920 and return a MEM rtx to refer to it in memory. */
2923 force_const_mem (enum machine_mode mode
, rtx x
)
2926 struct constant_descriptor_rtx
*desc
;
2929 struct pool_constant
*pool
;
2932 /* If we're not allowed to drop X into the constant pool, don't. */
2933 if ((*targetm
.cannot_force_const_mem
) (x
))
2936 /* Compute hash code of X. Search the descriptors for that hash code
2937 to see if any of them describes X. If yes, we have an rtx to use. */
2938 hash
= const_hash_rtx (mode
, x
);
2939 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
2940 if (compare_constant_rtx (mode
, x
, desc
))
2943 /* No constant equal to X is known to have been output.
2944 Make a constant descriptor to enter X in the hash table
2945 and make a MEM for it. */
2946 desc
= record_constant_rtx (mode
, x
);
2947 desc
->next
= const_rtx_hash_table
[hash
];
2948 const_rtx_hash_table
[hash
] = desc
;
2950 /* Align the location counter as required by EXP's data type. */
2951 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
2952 #ifdef CONSTANT_ALIGNMENT
2954 tree type
= (*lang_hooks
.types
.type_for_mode
) (mode
, 0);
2955 if (type
!= NULL_TREE
)
2956 align
= CONSTANT_ALIGNMENT (make_tree (type
, x
), align
);
2960 pool_offset
+= (align
/ BITS_PER_UNIT
) - 1;
2961 pool_offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
2963 if (GET_CODE (x
) == LABEL_REF
)
2964 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
2966 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
2967 pool
= ggc_alloc (sizeof (struct pool_constant
));
2971 pool
->labelno
= const_labelno
;
2972 pool
->align
= align
;
2973 pool
->offset
= pool_offset
;
2980 last_pool
->next
= pool
;
2983 pool_offset
+= GET_MODE_SIZE (mode
);
2985 /* Create a string containing the label name, in LABEL. */
2986 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2990 /* Construct the SYMBOL_REF and the MEM. */
2992 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2993 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2995 pool
->desc
->rtl
= def
= gen_rtx_MEM (mode
, symbol
);
2996 set_mem_attributes (def
, (*lang_hooks
.types
.type_for_mode
) (mode
, 0), 1);
2997 RTX_UNCHANGING_P (def
) = 1;
2999 /* Add label to symbol hash table. */
3000 hash
= SYMHASH (XSTR (symbol
, 0));
3001 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3002 const_rtx_sym_hash_table
[hash
] = pool
;
3004 /* Mark the symbol_ref as belonging to this constants pool. */
3005 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
3006 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
3007 current_function_uses_const_pool
= 1;
3012 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3013 the corresponding pool_constant structure. */
3015 static struct pool_constant
*
3016 find_pool_constant (struct function
*f
, rtx addr
)
3018 struct pool_constant
*pool
;
3019 const char *label
= XSTR (addr
, 0);
3021 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3022 pool
= pool
->next_sym
)
3023 if (XSTR (XEXP (pool
->desc
->rtl
, 0), 0) == label
)
3029 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3032 get_pool_constant (rtx addr
)
3034 return (find_pool_constant (cfun
, addr
))->constant
;
3037 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3038 and whether it has been output or not. */
3041 get_pool_constant_mark (rtx addr
, bool *pmarked
)
3043 struct pool_constant
*pool
= find_pool_constant (cfun
, addr
);
3044 *pmarked
= (pool
->mark
!= 0);
3045 return pool
->constant
;
3048 /* Likewise, but for the constant pool of a specific function. */
3051 get_pool_constant_for_function (struct function
*f
, rtx addr
)
3053 return (find_pool_constant (f
, addr
))->constant
;
3056 /* Similar, return the mode. */
3059 get_pool_mode (rtx addr
)
3061 return (find_pool_constant (cfun
, addr
))->mode
;
3065 get_pool_mode_for_function (struct function
*f
, rtx addr
)
3067 return (find_pool_constant (f
, addr
))->mode
;
3070 /* Similar, return the offset in the constant pool. */
3073 get_pool_offset (rtx addr
)
3075 return (find_pool_constant (cfun
, addr
))->offset
;
3078 /* Return the size of the constant pool. */
3081 get_pool_size (void)
3086 /* Write all the constants in the constant pool. */
3089 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED
,
3090 tree fndecl ATTRIBUTE_UNUSED
)
3092 struct pool_constant
*pool
;
3096 /* It is possible for gcc to call force_const_mem and then to later
3097 discard the instructions which refer to the constant. In such a
3098 case we do not need to output the constant. */
3099 mark_constant_pool ();
3101 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3102 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3105 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3114 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3115 whose CODE_LABEL has been deleted. This can occur if a jump table
3116 is eliminated by optimization. If so, write a constant of zero
3117 instead. Note that this can also happen by turning the
3118 CODE_LABEL into a NOTE. */
3119 /* ??? This seems completely and utterly wrong. Certainly it's
3120 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3121 functioning even with INSN_DELETED_P and friends. */
3124 switch (GET_CODE (x
))
3127 if (GET_CODE (XEXP (x
, 0)) != PLUS
3128 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3130 tmp
= XEXP (XEXP (x
, 0), 0);
3135 if (INSN_DELETED_P (tmp
)
3136 || (GET_CODE (tmp
) == NOTE
3137 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3148 /* First switch to correct section. */
3149 (*targetm
.asm_out
.select_rtx_section
) (pool
->mode
, x
, pool
->align
);
3151 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3152 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3153 pool
->align
, pool
->labelno
, done
);
3156 assemble_align (pool
->align
);
3158 /* Output the label. */
3159 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LC", pool
->labelno
);
3161 /* Output the value of the constant itself. */
3162 switch (GET_MODE_CLASS (pool
->mode
))
3165 if (GET_CODE (x
) != CONST_DOUBLE
)
3168 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3169 assemble_real (r
, pool
->mode
, pool
->align
);
3173 case MODE_PARTIAL_INT
:
3174 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), pool
->align
, 1);
3177 case MODE_VECTOR_FLOAT
:
3182 if (GET_CODE (x
) != CONST_VECTOR
)
3185 units
= CONST_VECTOR_NUNITS (x
);
3187 for (i
= 0; i
< units
; i
++)
3189 elt
= CONST_VECTOR_ELT (x
, i
);
3190 REAL_VALUE_FROM_CONST_DOUBLE (r
, elt
);
3191 assemble_real (r
, GET_MODE_INNER (pool
->mode
), pool
->align
);
3196 case MODE_VECTOR_INT
:
3201 if (GET_CODE (x
) != CONST_VECTOR
)
3204 units
= CONST_VECTOR_NUNITS (x
);
3206 for (i
= 0; i
< units
; i
++)
3208 elt
= CONST_VECTOR_ELT (x
, i
);
3209 assemble_integer (elt
, GET_MODE_UNIT_SIZE (pool
->mode
),
3219 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3220 sections have proper size. */
3221 if (pool
->align
> GET_MODE_BITSIZE (pool
->mode
)
3222 && in_section
== in_named
3223 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3224 assemble_align (pool
->align
);
3226 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3231 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3232 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3235 /* Done with this pool. */
3236 first_pool
= last_pool
= 0;
3239 /* Look through the instructions for this function, and mark all the
3240 entries in the constant pool which are actually being used. Emit
3241 deferred constants which have indeed been used. */
3244 mark_constant_pool (void)
3248 struct pool_constant
*pool
;
3250 if (first_pool
== 0 && n_deferred_constants
== 0)
3253 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3256 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3258 mark_constants (PATTERN (insn
));
3260 for (link
= current_function_epilogue_delay_list
;
3262 link
= XEXP (link
, 1))
3264 insn
= XEXP (link
, 0);
3267 mark_constants (PATTERN (insn
));
3271 /* Look through appropriate parts of X, marking all entries in the
3272 constant pool which are actually being used. Entries that are only
3273 referenced by other constants are also marked as used. Emit
3274 deferred strings that are used. */
3277 mark_constants (rtx x
)
3280 const char *format_ptr
;
3285 if (GET_CODE (x
) == SYMBOL_REF
)
3287 mark_constant (&x
, NULL
);
3291 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3292 insns, not any notes that may be attached. We don't want to mark
3293 a constant just because it happens to appear in a REG_EQUIV note. */
3296 mark_constants (PATTERN (x
));
3300 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3302 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3304 switch (*format_ptr
++)
3307 mark_constants (XEXP (x
, i
));
3311 if (XVEC (x
, i
) != 0)
3315 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3316 mark_constants (XVECEXP (x
, i
, j
));
3336 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3337 to as used. Emit referenced deferred strings. This function can
3338 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3341 mark_constant (rtx
*current_rtx
, void *data ATTRIBUTE_UNUSED
)
3343 rtx x
= *current_rtx
;
3348 else if (GET_CODE (x
) == SYMBOL_REF
)
3350 if (CONSTANT_POOL_ADDRESS_P (x
))
3352 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3353 if (pool
->mark
== 0)
3356 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3361 else if (TREE_CONSTANT_POOL_ADDRESS_P (x
))
3363 tree exp
= SYMBOL_REF_DECL (x
);
3364 if (!TREE_ASM_WRITTEN (exp
))
3366 n_deferred_constants
--;
3367 output_constant_def_contents (x
);
3374 /* Find all the constants whose addresses are referenced inside of EXP,
3375 and make sure assembler code with a label has been output for each one.
3376 Indicate whether an ADDR_EXPR has been encountered. */
3379 output_addressed_constants (tree exp
)
3381 int reloc
= 0, reloc2
;
3384 /* Give the front-end a chance to convert VALUE to something that
3385 looks more like a constant to the back-end. */
3386 exp
= (*lang_hooks
.expand_constant
) (exp
);
3388 switch (TREE_CODE (exp
))
3392 /* Go inside any operations that get_inner_reference can handle and see
3393 if what's inside is a constant: no need to do anything here for
3394 addresses of variables or functions. */
3395 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3396 tem
= TREE_OPERAND (tem
, 0))
3399 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
3400 || TREE_CODE (tem
) == CONSTRUCTOR
)
3401 output_constant_def (tem
, 0);
3403 if (TREE_PUBLIC (tem
))
3410 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3411 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3415 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3416 reloc2
= output_addressed_constants (TREE_OPERAND (exp
, 1));
3417 /* The difference of two local labels is computable at link time. */
3418 if (reloc
== 1 && reloc2
== 1)
3426 case NON_LVALUE_EXPR
:
3427 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3431 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3432 if (TREE_VALUE (tem
) != 0)
3433 reloc
|= output_addressed_constants (TREE_VALUE (tem
));
3443 /* Return nonzero if VALUE is a valid constant-valued expression
3444 for use in initializing a static variable; one that can be an
3445 element of a "constant" initializer.
3447 Return null_pointer_node if the value is absolute;
3448 if it is relocatable, return the variable that determines the relocation.
3449 We assume that VALUE has been folded as much as possible;
3450 therefore, we do not need to check for such things as
3451 arithmetic-combinations of integers. */
3454 initializer_constant_valid_p (tree value
, tree endtype
)
3456 /* Give the front-end a chance to convert VALUE to something that
3457 looks more like a constant to the back-end. */
3458 value
= (*lang_hooks
.expand_constant
) (value
);
3460 switch (TREE_CODE (value
))
3463 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3464 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3465 && TREE_CONSTANT (value
)
3466 && CONSTRUCTOR_ELTS (value
))
3469 bool absolute
= true;
3471 for (elt
= CONSTRUCTOR_ELTS (value
); elt
; elt
= TREE_CHAIN (elt
))
3474 value
= TREE_VALUE (elt
);
3475 reloc
= initializer_constant_valid_p (value
, TREE_TYPE (value
));
3478 if (reloc
!= null_pointer_node
)
3481 /* For a non-absolute relocation, there is no single
3482 variable that can be "the variable that determines the
3484 return absolute
? null_pointer_node
: error_mark_node
;
3487 return TREE_STATIC (value
) ? null_pointer_node
: NULL_TREE
;
3494 return null_pointer_node
;
3498 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
3500 case VIEW_CONVERT_EXPR
:
3501 case NON_LVALUE_EXPR
:
3502 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3506 /* Allow conversions between pointer types. */
3507 if (POINTER_TYPE_P (TREE_TYPE (value
))
3508 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3509 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3511 /* Allow conversions between real types. */
3512 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3513 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3514 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3516 /* Allow length-preserving conversions between integer types. */
3517 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3518 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3519 && (TYPE_PRECISION (TREE_TYPE (value
))
3520 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3521 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3523 /* Allow conversions between other integer types only if
3525 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3526 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3528 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3530 if (inner
== null_pointer_node
)
3531 return null_pointer_node
;
3535 /* Allow (int) &foo provided int is as wide as a pointer. */
3536 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3537 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3538 && (TYPE_PRECISION (TREE_TYPE (value
))
3539 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3540 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3543 /* Likewise conversions from int to pointers, but also allow
3544 conversions from 0. */
3545 if (POINTER_TYPE_P (TREE_TYPE (value
))
3546 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3548 if (integer_zerop (TREE_OPERAND (value
, 0)))
3549 return null_pointer_node
;
3550 else if (TYPE_PRECISION (TREE_TYPE (value
))
3551 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
3552 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3556 /* Allow conversions to union types if the value inside is okay. */
3557 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
3558 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3563 if (! INTEGRAL_TYPE_P (endtype
)
3564 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3566 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3568 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3570 /* If either term is absolute, use the other terms relocation. */
3571 if (valid0
== null_pointer_node
)
3573 if (valid1
== null_pointer_node
)
3579 if (! INTEGRAL_TYPE_P (endtype
)
3580 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3582 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3584 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3586 /* Win if second argument is absolute. */
3587 if (valid1
== null_pointer_node
)
3589 /* Win if both arguments have the same relocation.
3590 Then the value is absolute. */
3591 if (valid0
== valid1
&& valid0
!= 0)
3592 return null_pointer_node
;
3594 /* Since GCC guarantees that string constants are unique in the
3595 generated code, a subtraction between two copies of the same
3596 constant string is absolute. */
3597 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
3598 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
3599 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
3600 return null_pointer_node
;
3603 /* Support differences between labels. */
3604 if (INTEGRAL_TYPE_P (endtype
))
3607 op0
= TREE_OPERAND (value
, 0);
3608 op1
= TREE_OPERAND (value
, 1);
3610 /* Like STRIP_NOPS except allow the operand mode to widen.
3611 This works around a feature of fold that simplifies
3612 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3613 that the narrower operation is cheaper. */
3615 while (TREE_CODE (op0
) == NOP_EXPR
3616 || TREE_CODE (op0
) == CONVERT_EXPR
3617 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3619 tree inner
= TREE_OPERAND (op0
, 0);
3620 if (inner
== error_mark_node
3621 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3622 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3623 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3628 while (TREE_CODE (op1
) == NOP_EXPR
3629 || TREE_CODE (op1
) == CONVERT_EXPR
3630 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3632 tree inner
= TREE_OPERAND (op1
, 0);
3633 if (inner
== error_mark_node
3634 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3635 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3636 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3641 if (TREE_CODE (op0
) == ADDR_EXPR
3642 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
3643 && TREE_CODE (op1
) == ADDR_EXPR
3644 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
3645 return null_pointer_node
;
3656 /* Output assembler code for constant EXP to FILE, with no label.
3657 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3658 Assumes output_addressed_constants has been done on EXP already.
3660 Generate exactly SIZE bytes of assembler data, padding at the end
3661 with zeros if necessary. SIZE must always be specified.
3663 SIZE is important for structure constructors,
3664 since trailing members may have been omitted from the constructor.
3665 It is also important for initialization of arrays from string constants
3666 since the full length of the string constant might not be wanted.
3667 It is also needed for initialization of unions, where the initializer's
3668 type is just one member, and that may not be as long as the union.
3670 There a case in which we would fail to output exactly SIZE bytes:
3671 for a structure constructor that wants to produce more than SIZE bytes.
3672 But such constructors will never be generated for any possible input.
3674 ALIGN is the alignment of the data in bits. */
3677 output_constant (tree exp
, unsigned HOST_WIDE_INT size
, unsigned int align
)
3679 enum tree_code code
;
3680 unsigned HOST_WIDE_INT thissize
;
3682 /* Some front-ends use constants other than the standard language-independent
3683 varieties, but which may still be output directly. Give the front-end a
3684 chance to convert EXP to a language-independent representation. */
3685 exp
= (*lang_hooks
.expand_constant
) (exp
);
3687 if (size
== 0 || flag_syntax_only
)
3690 /* Eliminate any conversions since we'll be outputting the underlying
3692 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3693 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3694 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3695 exp
= TREE_OPERAND (exp
, 0);
3697 code
= TREE_CODE (TREE_TYPE (exp
));
3698 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3700 /* Allow a constructor with no elements for any data type.
3701 This means to fill the space with zeros. */
3702 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3704 assemble_zeros (size
);
3708 if (TREE_CODE (exp
) == FDESC_EXPR
)
3710 #ifdef ASM_OUTPUT_FDESC
3711 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3712 tree decl
= TREE_OPERAND (exp
, 0);
3713 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3720 /* Now output the underlying data. If we've handling the padding, return.
3721 Otherwise, break and ensure THISSIZE is the size written. */
3729 case REFERENCE_TYPE
:
3731 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3732 EXPAND_INITIALIZER
),
3734 error ("initializer for integer value is too complicated");
3738 if (TREE_CODE (exp
) != REAL_CST
)
3739 error ("initializer for floating value is not a floating constant");
3741 assemble_real (TREE_REAL_CST (exp
),
3742 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0),
3747 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3748 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3749 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
3754 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3756 output_constructor (exp
, size
, align
);
3759 else if (TREE_CODE (exp
) == STRING_CST
)
3761 thissize
= MIN ((unsigned HOST_WIDE_INT
)TREE_STRING_LENGTH (exp
),
3763 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
3765 else if (TREE_CODE (exp
) == VECTOR_CST
)
3769 unsigned int nalign
;
3770 enum machine_mode inner
;
3772 inner
= GET_MODE_INNER (TYPE_MODE (TREE_TYPE (exp
)));
3773 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
3775 elt_size
= GET_MODE_UNIT_SIZE (TYPE_MODE (TREE_TYPE (exp
)));
3777 link
= TREE_VECTOR_CST_ELTS (exp
);
3778 output_constant (TREE_VALUE (link
), elt_size
, align
);
3779 while ((link
= TREE_CHAIN (link
)) != NULL
)
3780 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
3788 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3789 output_constructor (exp
, size
, align
);
3795 if (TREE_CODE (exp
) == INTEGER_CST
)
3796 assemble_integer (expand_expr (exp
, NULL_RTX
,
3797 VOIDmode
, EXPAND_INITIALIZER
),
3798 thissize
, align
, 1);
3799 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3801 unsigned char *buffer
= alloca (thissize
);
3802 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
3804 assemble_string ((char *) buffer
, thissize
);
3807 error ("unknown set constructor type");
3817 if (size
> thissize
)
3818 assemble_zeros (size
- thissize
);
3822 /* Subroutine of output_constructor, used for computing the size of
3823 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3824 type with an unspecified upper bound. */
3826 static unsigned HOST_WIDE_INT
3827 array_size_for_constructor (tree val
)
3831 /* This code used to attempt to handle string constants that are not
3832 arrays of single-bytes, but nothing else does, so there's no point in
3834 if (TREE_CODE (val
) == STRING_CST
)
3835 return TREE_STRING_LENGTH (val
);
3837 max_index
= NULL_TREE
;
3838 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
3840 tree index
= TREE_PURPOSE (i
);
3842 if (TREE_CODE (index
) == RANGE_EXPR
)
3843 index
= TREE_OPERAND (index
, 1);
3844 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
3848 if (max_index
== NULL_TREE
)
3851 /* Compute the total number of array elements. */
3852 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
3854 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
3855 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
3857 /* Multiply by the array element unit size to find number of bytes. */
3858 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
3860 return tree_low_cst (i
, 1);
3863 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3864 Generate at least SIZE bytes, padding if necessary. */
3867 output_constructor (tree exp
, unsigned HOST_WIDE_INT size
,
3870 tree type
= TREE_TYPE (exp
);
3871 tree link
, field
= 0;
3873 /* Number of bytes output or skipped so far.
3874 In other words, current position within the constructor. */
3875 HOST_WIDE_INT total_bytes
= 0;
3876 /* Nonzero means BYTE contains part of a byte, to be output. */
3877 int byte_buffer_in_use
= 0;
3880 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3883 if (TREE_CODE (type
) == RECORD_TYPE
)
3884 field
= TYPE_FIELDS (type
);
3886 if (TREE_CODE (type
) == ARRAY_TYPE
3887 && TYPE_DOMAIN (type
) != 0)
3888 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
3890 /* As LINK goes through the elements of the constant,
3891 FIELD goes through the structure fields, if the constant is a structure.
3892 if the constant is a union, then we override this,
3893 by getting the field from the TREE_LIST element.
3894 But the constant could also be an array. Then FIELD is zero.
3896 There is always a maximum of one element in the chain LINK for unions
3897 (even if the initializer in a source program incorrectly contains
3899 for (link
= CONSTRUCTOR_ELTS (exp
);
3901 link
= TREE_CHAIN (link
),
3902 field
= field
? TREE_CHAIN (field
) : 0)
3904 tree val
= TREE_VALUE (link
);
3907 /* The element in a union constructor specifies the proper field
3909 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
3910 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
3911 && TREE_PURPOSE (link
) != 0)
3912 field
= TREE_PURPOSE (link
);
3914 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3915 index
= TREE_PURPOSE (link
);
3917 /* Eliminate the marker that makes a cast not be an lvalue. */
3921 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
3923 unsigned HOST_WIDE_INT fieldsize
3924 = int_size_in_bytes (TREE_TYPE (type
));
3925 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
3926 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
3927 HOST_WIDE_INT index
;
3928 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
3930 for (index
= lo_index
; index
<= hi_index
; index
++)
3932 /* Output the element's initial value. */
3934 assemble_zeros (fieldsize
);
3936 output_constant (val
, fieldsize
, align2
);
3938 /* Count its size. */
3939 total_bytes
+= fieldsize
;
3942 else if (field
== 0 || !DECL_BIT_FIELD (field
))
3944 /* An element that is not a bit-field. */
3946 unsigned HOST_WIDE_INT fieldsize
;
3947 /* Since this structure is static,
3948 we know the positions are constant. */
3949 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
3950 unsigned int align2
;
3953 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
3954 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
3956 /* Output any buffered-up bit-fields preceding this element. */
3957 if (byte_buffer_in_use
)
3959 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3961 byte_buffer_in_use
= 0;
3964 /* Advance to offset of this element.
3965 Note no alignment needed in an array, since that is guaranteed
3966 if each element has the proper size. */
3967 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
3969 assemble_zeros (pos
- total_bytes
);
3973 /* Find the alignment of this element. */
3974 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
3976 /* Determine size this element should occupy. */
3981 /* If this is an array with an unspecified upper bound,
3982 the initializer determines the size. */
3983 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
3984 but we cannot do this until the deprecated support for
3985 initializing zero-length array members is removed. */
3986 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
3987 && TYPE_DOMAIN (TREE_TYPE (field
))
3988 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
3990 fieldsize
= array_size_for_constructor (val
);
3991 /* Given a non-empty initialization, this field had
3993 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
3996 else if (DECL_SIZE_UNIT (field
))
3998 /* ??? This can't be right. If the decl size overflows
3999 a host integer we will silently emit no data. */
4000 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4001 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4005 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4007 /* Output the element's initial value. */
4009 assemble_zeros (fieldsize
);
4011 output_constant (val
, fieldsize
, align2
);
4013 /* Count its size. */
4014 total_bytes
+= fieldsize
;
4016 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4017 error ("invalid initial value for member `%s'",
4018 IDENTIFIER_POINTER (DECL_NAME (field
)));
4021 /* Element that is a bit-field. */
4023 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4024 HOST_WIDE_INT end_offset
4025 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4028 val
= integer_zero_node
;
4030 /* If this field does not start in this (or, next) byte,
4032 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4034 /* Output remnant of any bit field in previous bytes. */
4035 if (byte_buffer_in_use
)
4037 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4039 byte_buffer_in_use
= 0;
4042 /* If still not at proper byte, advance to there. */
4043 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4045 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4046 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4050 if (! byte_buffer_in_use
)
4053 /* We must split the element into pieces that fall within
4054 separate bytes, and combine each byte with previous or
4055 following bit-fields. */
4057 /* next_offset is the offset n fbits from the beginning of
4058 the structure to the next bit of this element to be processed.
4059 end_offset is the offset of the first bit past the end of
4061 while (next_offset
< end_offset
)
4065 HOST_WIDE_INT value
;
4066 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4067 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4069 /* Advance from byte to byte
4070 within this element when necessary. */
4071 while (next_byte
!= total_bytes
)
4073 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4078 /* Number of bits we can process at once
4079 (all part of the same byte). */
4080 this_time
= MIN (end_offset
- next_offset
,
4081 BITS_PER_UNIT
- next_bit
);
4082 if (BYTES_BIG_ENDIAN
)
4084 /* On big-endian machine, take the most significant bits
4085 first (of the bits that are significant)
4086 and put them into bytes from the most significant end. */
4087 shift
= end_offset
- next_offset
- this_time
;
4089 /* Don't try to take a bunch of bits that cross
4090 the word boundary in the INTEGER_CST. We can
4091 only select bits from the LOW or HIGH part
4093 if (shift
< HOST_BITS_PER_WIDE_INT
4094 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4096 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4097 shift
= HOST_BITS_PER_WIDE_INT
;
4100 /* Now get the bits from the appropriate constant word. */
4101 if (shift
< HOST_BITS_PER_WIDE_INT
)
4102 value
= TREE_INT_CST_LOW (val
);
4103 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4105 value
= TREE_INT_CST_HIGH (val
);
4106 shift
-= HOST_BITS_PER_WIDE_INT
;
4111 /* Get the result. This works only when:
4112 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4113 byte
|= (((value
>> shift
)
4114 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4115 << (BITS_PER_UNIT
- this_time
- next_bit
));
4119 /* On little-endian machines,
4120 take first the least significant bits of the value
4121 and pack them starting at the least significant
4122 bits of the bytes. */
4123 shift
= next_offset
- int_bit_position (field
);
4125 /* Don't try to take a bunch of bits that cross
4126 the word boundary in the INTEGER_CST. We can
4127 only select bits from the LOW or HIGH part
4129 if (shift
< HOST_BITS_PER_WIDE_INT
4130 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4131 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4133 /* Now get the bits from the appropriate constant word. */
4134 if (shift
< HOST_BITS_PER_WIDE_INT
)
4135 value
= TREE_INT_CST_LOW (val
);
4136 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4138 value
= TREE_INT_CST_HIGH (val
);
4139 shift
-= HOST_BITS_PER_WIDE_INT
;
4144 /* Get the result. This works only when:
4145 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4146 byte
|= (((value
>> shift
)
4147 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4151 next_offset
+= this_time
;
4152 byte_buffer_in_use
= 1;
4157 if (byte_buffer_in_use
)
4159 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4163 if ((unsigned HOST_WIDE_INT
)total_bytes
< size
)
4164 assemble_zeros (size
- total_bytes
);
4167 /* This TREE_LIST contains any weak symbol declarations waiting
4169 static GTY(()) tree weak_decls
;
4171 /* Mark DECL as weak. */
4174 mark_weak (tree decl
)
4176 DECL_WEAK (decl
) = 1;
4178 if (DECL_RTL_SET_P (decl
)
4179 && GET_CODE (DECL_RTL (decl
)) == MEM
4180 && XEXP (DECL_RTL (decl
), 0)
4181 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4182 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4185 /* Merge weak status between NEWDECL and OLDDECL. */
4188 merge_weak (tree newdecl
, tree olddecl
)
4190 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4193 if (DECL_WEAK (newdecl
))
4197 /* NEWDECL is weak, but OLDDECL is not. */
4199 /* If we already output the OLDDECL, we're in trouble; we can't
4200 go back and make it weak. This error cannot caught in
4201 declare_weak because the NEWDECL and OLDDECL was not yet
4202 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4203 if (TREE_ASM_WRITTEN (olddecl
))
4204 error ("%Jweak declaration of '%D' must precede definition",
4207 /* If we've already generated rtl referencing OLDDECL, we may
4208 have done so in a way that will not function properly with
4210 else if (TREE_USED (olddecl
)
4211 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4212 warning ("%Jweak declaration of '%D' after first use results "
4213 "in unspecified behavior", newdecl
, newdecl
);
4217 /* We put the NEWDECL on the weak_decls list at some point.
4218 Replace it with the OLDDECL. */
4219 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4220 if (TREE_VALUE (wd
) == newdecl
)
4222 TREE_VALUE (wd
) = olddecl
;
4225 /* We may not find the entry on the list. If NEWDECL is a
4226 weak alias, then we will have already called
4227 globalize_decl to remove the entry; in that case, we do
4228 not need to do anything. */
4231 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4232 mark_weak (olddecl
);
4235 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4236 weak. Just update NEWDECL to indicate that it's weak too. */
4237 mark_weak (newdecl
);
4240 /* Declare DECL to be a weak symbol. */
4243 declare_weak (tree decl
)
4245 if (! TREE_PUBLIC (decl
))
4246 error ("%Jweak declaration of '%D' must be public", decl
, decl
);
4247 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4248 error ("%Jweak declaration of '%D' must precede definition", decl
, decl
);
4249 else if (SUPPORTS_WEAK
)
4251 if (! DECL_WEAK (decl
))
4252 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4255 warning ("%Jweak declaration of '%D' not supported", decl
, decl
);
4260 /* Emit any pending weak declarations. */
4267 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4269 tree decl
= TREE_VALUE (t
);
4270 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4271 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4274 if (! TREE_USED (decl
))
4277 #ifdef ASM_WEAKEN_DECL
4278 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4280 #ifdef ASM_WEAKEN_LABEL
4281 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4283 #ifdef ASM_OUTPUT_WEAK_ALIAS
4284 warning ("only weak aliases are supported in this configuration");
4292 /* Emit the assembly bits to indicate that DECL is globally visible. */
4295 globalize_decl (tree decl
)
4297 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4299 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4300 if (DECL_WEAK (decl
))
4304 #ifdef ASM_WEAKEN_DECL
4305 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4307 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4310 /* Remove this function from the pending weak list so that
4311 we do not emit multiple .weak directives for it. */
4312 for (p
= &weak_decls
; (t
= *p
) ; )
4314 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4315 *p
= TREE_CHAIN (t
);
4317 p
= &TREE_CHAIN (t
);
4323 (*targetm
.asm_out
.globalize_label
) (asm_out_file
, name
);
4326 /* Emit an assembler directive to make the symbol for DECL an alias to
4327 the symbol for TARGET. */
4330 assemble_alias (tree decl
, tree target ATTRIBUTE_UNUSED
)
4334 /* We must force creation of DECL_RTL for debug info generation, even though
4335 we don't use it here. */
4336 make_decl_rtl (decl
, NULL
);
4338 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4340 #ifdef ASM_OUTPUT_DEF
4341 /* Make name accessible from other files, if appropriate. */
4343 if (TREE_PUBLIC (decl
))
4345 globalize_decl (decl
);
4346 maybe_assemble_visibility (decl
);
4349 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4350 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4352 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4354 #else /* !ASM_OUTPUT_DEF */
4355 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4356 if (! DECL_WEAK (decl
))
4357 warning ("only weak aliases are supported in this configuration");
4359 #ifdef ASM_WEAKEN_DECL
4360 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4362 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4365 warning ("alias definitions not supported in this configuration; ignored");
4369 TREE_USED (decl
) = 1;
4370 TREE_ASM_WRITTEN (decl
) = 1;
4371 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4374 /* Emit an assembler directive to set symbol for DECL visibility to
4375 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4378 default_assemble_visibility (tree decl
, int vis
)
4380 static const char * const visibility_types
[] = {
4381 NULL
, "internal", "hidden", "protected"
4384 const char *name
, *type
;
4386 name
= (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4387 type
= visibility_types
[vis
];
4389 #ifdef HAVE_GAS_HIDDEN
4390 fprintf (asm_out_file
, "\t.%s\t", type
);
4391 assemble_name (asm_out_file
, name
);
4392 fprintf (asm_out_file
, "\n");
4394 warning ("visibility attribute not supported in this configuration; ignored");
4398 /* A helper function to call assemble_visibility when needed for a decl. */
4401 maybe_assemble_visibility (tree decl
)
4403 enum symbol_visibility vis
= decl_visibility (decl
);
4405 if (vis
!= VISIBILITY_DEFAULT
)
4406 (* targetm
.asm_out
.visibility
) (decl
, vis
);
4409 /* Returns 1 if the target configuration supports defining public symbols
4410 so that one of them will be chosen at link time instead of generating a
4411 multiply-defined symbol error, whether through the use of weak symbols or
4412 a target-specific mechanism for having duplicates discarded. */
4415 supports_one_only (void)
4417 if (SUPPORTS_ONE_ONLY
)
4419 return SUPPORTS_WEAK
;
4422 /* Set up DECL as a public symbol that can be defined in multiple
4423 translation units without generating a linker error. */
4426 make_decl_one_only (tree decl
)
4428 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4431 TREE_PUBLIC (decl
) = 1;
4433 if (TREE_CODE (decl
) == VAR_DECL
4434 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4435 DECL_COMMON (decl
) = 1;
4436 else if (SUPPORTS_ONE_ONLY
)
4438 #ifdef MAKE_DECL_ONE_ONLY
4439 MAKE_DECL_ONE_ONLY (decl
);
4441 DECL_ONE_ONLY (decl
) = 1;
4443 else if (SUPPORTS_WEAK
)
4444 DECL_WEAK (decl
) = 1;
4450 init_varasm_once (void)
4452 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4453 in_named_entry_eq
, NULL
);
4454 const_desc_htab
= htab_create_ggc (1009, const_desc_hash
,
4455 const_desc_eq
, NULL
);
4457 const_alias_set
= new_alias_set ();
4461 decl_tls_model (tree decl
)
4463 enum tls_model kind
;
4464 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4469 attr
= TREE_VALUE (TREE_VALUE (attr
));
4470 if (TREE_CODE (attr
) != STRING_CST
)
4472 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4473 kind
= TLS_MODEL_LOCAL_EXEC
;
4474 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4475 kind
= TLS_MODEL_INITIAL_EXEC
;
4476 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4477 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4478 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4479 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4485 is_local
= (*targetm
.binds_local_p
) (decl
);
4489 kind
= TLS_MODEL_LOCAL_EXEC
;
4491 kind
= TLS_MODEL_INITIAL_EXEC
;
4493 /* Local dynamic is inefficient when we're not combining the
4494 parts of the address. */
4495 else if (optimize
&& is_local
)
4496 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4498 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4499 if (kind
< flag_tls_default
)
4500 kind
= flag_tls_default
;
4505 enum symbol_visibility
4506 decl_visibility (tree decl
)
4508 tree attr
= lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
));
4512 const char *which
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
4514 if (strcmp (which
, "default") == 0)
4515 return VISIBILITY_DEFAULT
;
4516 if (strcmp (which
, "internal") == 0)
4517 return VISIBILITY_INTERNAL
;
4518 if (strcmp (which
, "hidden") == 0)
4519 return VISIBILITY_HIDDEN
;
4520 if (strcmp (which
, "protected") == 0)
4521 return VISIBILITY_PROTECTED
;
4526 return VISIBILITY_DEFAULT
;
4529 /* Select a set of attributes for section NAME based on the properties
4530 of DECL and whether or not RELOC indicates that DECL's initializer
4531 might contain runtime relocations.
4533 We make the section read-only and executable for a function decl,
4534 read-only for a const data decl, and writable for a non-const data decl. */
4537 default_section_type_flags (tree decl
, const char *name
, int reloc
)
4539 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4543 default_section_type_flags_1 (tree decl
, const char *name
, int reloc
,
4548 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4549 flags
= SECTION_CODE
;
4550 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4553 flags
= SECTION_WRITE
;
4555 if (decl
&& DECL_ONE_ONLY (decl
))
4556 flags
|= SECTION_LINKONCE
;
4558 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4559 flags
|= SECTION_TLS
| SECTION_WRITE
;
4561 if (strcmp (name
, ".bss") == 0
4562 || strncmp (name
, ".bss.", 5) == 0
4563 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4564 || strcmp (name
, ".sbss") == 0
4565 || strncmp (name
, ".sbss.", 6) == 0
4566 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0
4567 || strcmp (name
, ".tbss") == 0
4568 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4569 flags
|= SECTION_BSS
;
4571 if (strcmp (name
, ".tdata") == 0
4572 || strcmp (name
, ".tbss") == 0
4573 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0
4574 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4575 flags
|= SECTION_TLS
;
4577 /* These three sections have special ELF types. They are neither
4578 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4579 want to print a section type (@progbits or @nobits). If someone
4580 is silly enough to emit code or TLS variables to one of these
4581 sections, then don't handle them specially. */
4582 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4583 && (strcmp (name
, ".init_array") == 0
4584 || strcmp (name
, ".fini_array") == 0
4585 || strcmp (name
, ".preinit_array") == 0))
4586 flags
|= SECTION_NOTYPE
;
4591 /* Output assembly to switch to section NAME with attribute FLAGS.
4592 Four variants for common object file formats. */
4595 default_no_named_section (const char *name ATTRIBUTE_UNUSED
,
4596 unsigned int flags ATTRIBUTE_UNUSED
)
4598 /* Some object formats don't support named sections at all. The
4599 front-end should already have flagged this as an error. */
4604 default_elf_asm_named_section (const char *name
, unsigned int flags
)
4606 char flagchars
[10], *f
= flagchars
;
4608 if (! named_section_first_declaration (name
))
4610 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4614 if (!(flags
& SECTION_DEBUG
))
4616 if (flags
& SECTION_WRITE
)
4618 if (flags
& SECTION_CODE
)
4620 if (flags
& SECTION_SMALL
)
4622 if (flags
& SECTION_MERGE
)
4624 if (flags
& SECTION_STRINGS
)
4626 if (flags
& SECTION_TLS
)
4630 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4632 if (!(flags
& SECTION_NOTYPE
))
4636 if (flags
& SECTION_BSS
)
4641 fprintf (asm_out_file
, ",@%s", type
);
4643 if (flags
& SECTION_ENTSIZE
)
4644 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4647 putc ('\n', asm_out_file
);
4651 default_coff_asm_named_section (const char *name
, unsigned int flags
)
4653 char flagchars
[8], *f
= flagchars
;
4655 if (flags
& SECTION_WRITE
)
4657 if (flags
& SECTION_CODE
)
4661 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4665 default_pe_asm_named_section (const char *name
, unsigned int flags
)
4667 default_coff_asm_named_section (name
, flags
);
4669 if (flags
& SECTION_LINKONCE
)
4671 /* Functions may have been compiled at various levels of
4672 optimization so we can't use `same_size' here.
4673 Instead, have the linker pick one. */
4674 fprintf (asm_out_file
, "\t.linkonce %s\n",
4675 (flags
& SECTION_CODE
? "discard" : "same_size"));
4679 /* The lame default section selector. */
4682 default_select_section (tree decl
, int reloc
,
4683 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4685 bool readonly
= false;
4689 if (decl_readonly_section (decl
, reloc
))
4692 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4694 if (! ((flag_pic
&& reloc
)
4695 || !TREE_READONLY (decl
)
4696 || TREE_SIDE_EFFECTS (decl
)
4697 || !TREE_CONSTANT (decl
)))
4700 else if (TREE_CODE (decl
) == STRING_CST
)
4701 readonly
= !flag_writable_strings
;
4702 else if (! (flag_pic
&& reloc
))
4706 readonly_data_section ();
4711 /* A helper function for default_elf_select_section and
4712 default_elf_unique_section. Categorizes the DECL. */
4714 enum section_category
4719 SECCAT_RODATA_MERGE_STR
,
4720 SECCAT_RODATA_MERGE_STR_INIT
,
4721 SECCAT_RODATA_MERGE_CONST
,
4726 /* To optimize loading of shared programs, define following subsections
4728 _REL Contains data that has relocations, so they get grouped
4729 together and dynamic linker will visit fewer pages in memory.
4730 _RO Contains data that is otherwise read-only. This is useful
4731 with prelinking as most relocations won't be dynamically
4732 linked and thus stay read only.
4733 _LOCAL Marks data containing relocations only to local objects.
4734 These relocations will get fully resolved by prelinking. */
4736 SECCAT_DATA_REL_LOCAL
,
4738 SECCAT_DATA_REL_RO_LOCAL
,
4748 static enum section_category
4749 categorize_decl_for_section (tree
, int, int);
4751 static enum section_category
4752 categorize_decl_for_section (tree decl
, int reloc
, int shlib
)
4754 enum section_category ret
;
4756 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4758 else if (TREE_CODE (decl
) == STRING_CST
)
4760 if (flag_writable_strings
)
4763 return SECCAT_RODATA_MERGE_STR
;
4765 else if (TREE_CODE (decl
) == VAR_DECL
)
4767 if (DECL_INITIAL (decl
) == NULL
4768 || DECL_INITIAL (decl
) == error_mark_node
)
4770 else if (! TREE_READONLY (decl
)
4771 || TREE_SIDE_EFFECTS (decl
)
4772 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
4774 if (shlib
&& (reloc
& 2))
4775 ret
= SECCAT_DATA_REL
;
4776 else if (shlib
&& reloc
)
4777 ret
= SECCAT_DATA_REL_LOCAL
;
4781 else if (shlib
&& (reloc
& 2))
4782 ret
= SECCAT_DATA_REL_RO
;
4783 else if (shlib
&& reloc
)
4784 ret
= SECCAT_DATA_REL_RO_LOCAL
;
4785 else if (reloc
|| flag_merge_constants
< 2)
4786 /* C and C++ don't allow different variables to share the same
4787 location. -fmerge-all-constants allows even that (at the
4788 expense of not conforming). */
4789 ret
= SECCAT_RODATA
;
4790 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
4791 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
4793 ret
= SECCAT_RODATA_MERGE_CONST
;
4795 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4797 if ((shlib
&& reloc
)
4798 || TREE_SIDE_EFFECTS (decl
)
4799 || ! TREE_CONSTANT (decl
))
4802 ret
= SECCAT_RODATA
;
4805 ret
= SECCAT_RODATA
;
4807 /* There are no read-only thread-local sections. */
4808 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4810 if (ret
== SECCAT_BSS
)
4816 /* If the target uses small data sections, select it. */
4817 else if ((*targetm
.in_small_data_p
) (decl
))
4819 if (ret
== SECCAT_BSS
)
4821 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
4822 ret
= SECCAT_SRODATA
;
4831 decl_readonly_section (tree decl
, int reloc
)
4833 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
4837 decl_readonly_section_1 (tree decl
, int reloc
, int shlib
)
4839 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4842 case SECCAT_RODATA_MERGE_STR
:
4843 case SECCAT_RODATA_MERGE_STR_INIT
:
4844 case SECCAT_RODATA_MERGE_CONST
:
4845 case SECCAT_SRODATA
:
4854 /* Select a section based on the above categorization. */
4857 default_elf_select_section (tree decl
, int reloc
,
4858 unsigned HOST_WIDE_INT align
)
4860 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
4864 default_elf_select_section_1 (tree decl
, int reloc
,
4865 unsigned HOST_WIDE_INT align
, int shlib
)
4867 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4870 /* We're not supposed to be called on FUNCTION_DECLs. */
4873 readonly_data_section ();
4875 case SECCAT_RODATA_MERGE_STR
:
4876 mergeable_string_section (decl
, align
, 0);
4878 case SECCAT_RODATA_MERGE_STR_INIT
:
4879 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
4881 case SECCAT_RODATA_MERGE_CONST
:
4882 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
4884 case SECCAT_SRODATA
:
4885 named_section (NULL_TREE
, ".sdata2", reloc
);
4890 case SECCAT_DATA_REL
:
4891 named_section (NULL_TREE
, ".data.rel", reloc
);
4893 case SECCAT_DATA_REL_LOCAL
:
4894 named_section (NULL_TREE
, ".data.rel.local", reloc
);
4896 case SECCAT_DATA_REL_RO
:
4897 named_section (NULL_TREE
, ".data.rel.ro", reloc
);
4899 case SECCAT_DATA_REL_RO_LOCAL
:
4900 named_section (NULL_TREE
, ".data.rel.ro.local", reloc
);
4903 named_section (NULL_TREE
, ".sdata", reloc
);
4906 named_section (NULL_TREE
, ".tdata", reloc
);
4909 #ifdef BSS_SECTION_ASM_OP
4912 named_section (NULL_TREE
, ".bss", reloc
);
4916 named_section (NULL_TREE
, ".sbss", reloc
);
4919 named_section (NULL_TREE
, ".tbss", reloc
);
4926 /* Construct a unique section name based on the decl name and the
4927 categorization performed above. */
4930 default_unique_section (tree decl
, int reloc
)
4932 default_unique_section_1 (decl
, reloc
, flag_pic
);
4936 default_unique_section_1 (tree decl
, int reloc
, int shlib
)
4938 bool one_only
= DECL_ONE_ONLY (decl
);
4939 const char *prefix
, *name
;
4943 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4946 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
4949 case SECCAT_RODATA_MERGE_STR
:
4950 case SECCAT_RODATA_MERGE_STR_INIT
:
4951 case SECCAT_RODATA_MERGE_CONST
:
4952 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
4954 case SECCAT_SRODATA
:
4955 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
4958 case SECCAT_DATA_REL
:
4959 case SECCAT_DATA_REL_LOCAL
:
4960 case SECCAT_DATA_REL_RO
:
4961 case SECCAT_DATA_REL_RO_LOCAL
:
4962 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
4965 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
4968 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
4971 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
4974 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
4977 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
4982 plen
= strlen (prefix
);
4984 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4985 name
= (* targetm
.strip_name_encoding
) (name
);
4986 nlen
= strlen (name
);
4988 string
= alloca (nlen
+ plen
+ 1);
4989 memcpy (string
, prefix
, plen
);
4990 memcpy (string
+ plen
, name
, nlen
+ 1);
4992 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
4996 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
4998 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
5001 switch (GET_CODE (x
))
5013 readonly_data_section ();
5017 default_elf_select_rtx_section (enum machine_mode mode
, rtx x
,
5018 unsigned HOST_WIDE_INT align
)
5020 /* ??? Handle small data here somehow. */
5023 switch (GET_CODE (x
))
5027 named_section (NULL_TREE
, ".data.rel.ro", 3);
5031 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
5038 mergeable_constant_section (mode
, align
, 0);
5041 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
5044 default_encode_section_info (tree decl
, rtx rtl
, int first ATTRIBUTE_UNUSED
)
5049 /* Careful not to prod global register variables. */
5050 if (GET_CODE (rtl
) != MEM
)
5052 symbol
= XEXP (rtl
, 0);
5053 if (GET_CODE (symbol
) != SYMBOL_REF
)
5057 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5058 flags
|= SYMBOL_FLAG_FUNCTION
;
5059 if ((*targetm
.binds_local_p
) (decl
))
5060 flags
|= SYMBOL_FLAG_LOCAL
;
5061 if ((*targetm
.in_small_data_p
) (decl
))
5062 flags
|= SYMBOL_FLAG_SMALL
;
5063 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5064 flags
|= decl_tls_model (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
5065 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
5066 being PUBLIC, the thing *must* be defined in this translation unit.
5067 Prevent this buglet from being propagated into rtl code as well. */
5068 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
5069 flags
|= SYMBOL_FLAG_EXTERNAL
;
5071 SYMBOL_REF_FLAGS (symbol
) = flags
;
5074 /* By default, we do nothing for encode_section_info, so we need not
5075 do anything but discard the '*' marker. */
5078 default_strip_name_encoding (const char *str
)
5080 return str
+ (*str
== '*');
5083 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5084 wrt cross-module name binding. */
5087 default_binds_local_p (tree exp
)
5089 return default_binds_local_p_1 (exp
, flag_shlib
);
5093 default_binds_local_p_1 (tree exp
, int shlib
)
5097 /* A non-decl is an entry in the constant pool. */
5100 /* Static variables are always local. */
5101 else if (! TREE_PUBLIC (exp
))
5103 /* A variable is local if the user tells us so. */
5104 else if (decl_visibility (exp
) != VISIBILITY_DEFAULT
)
5106 /* Otherwise, variables defined outside this object may not be local. */
5107 else if (DECL_EXTERNAL (exp
))
5109 /* Linkonce and weak data are never local. */
5110 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
5112 /* If PIC, then assume that any global name can be overridden by
5113 symbols resolved from other modules. */
5116 /* Uninitialized COMMON variable may be unified with symbols
5117 resolved from other modules. */
5118 else if (DECL_COMMON (exp
)
5119 && (DECL_INITIAL (exp
) == NULL
5120 || DECL_INITIAL (exp
) == error_mark_node
))
5122 /* Otherwise we're left with initialized (or non-common) global data
5123 which is of necessity defined locally. */
5130 /* Determine whether or not a pointer mode is valid. Assume defaults
5131 of ptr_mode or Pmode - can be overridden. */
5133 default_valid_pointer_mode (enum machine_mode mode
)
5135 return (mode
== ptr_mode
|| mode
== Pmode
);
5138 /* Default function to output code that will globalize a label. A
5139 target must define GLOBAL_ASM_OP or provide it's own function to
5140 globalize a label. */
5141 #ifdef GLOBAL_ASM_OP
5143 default_globalize_label (FILE * stream
, const char *name
)
5145 fputs (GLOBAL_ASM_OP
, stream
);
5146 assemble_name (stream
, name
);
5147 putc ('\n', stream
);
5149 #endif /* GLOBAL_ASM_OP */
5151 /* This is how to output an internal numbered label where PREFIX is
5152 the class of label and LABELNO is the number within the class. */
5155 default_internal_label (FILE *stream
, const char *prefix
,
5156 unsigned long labelno
)
5158 char *const buf
= alloca (40 + strlen (prefix
));
5159 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5160 ASM_OUTPUT_LABEL (stream
, buf
);
5163 /* This is the default behavior at the beginning of a file. It's
5164 controlled by two other target-hook toggles. */
5166 default_file_start (void)
5168 if (targetm
.file_start_app_off
&& !flag_verbose_asm
)
5169 fputs (ASM_APP_OFF
, asm_out_file
);
5171 if (targetm
.file_start_file_directive
)
5172 output_file_directive (asm_out_file
, main_input_filename
);
5175 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5176 which emits a special section directive used to indicate whether or
5177 not this object file needs an executable stack. This is primarily
5178 a GNU extension to ELF but could be used on other targets. */
5180 file_end_indicate_exec_stack (void)
5182 unsigned int flags
= SECTION_DEBUG
;
5183 if (trampolines_created
)
5184 flags
|= SECTION_CODE
;
5186 named_section_flags (".note.GNU-stack", flags
);
5189 #include "gt-varasm.h"