1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
32 #include "coretypes.h"
39 #include "hard-reg-set.h"
48 #include "langhooks.h"
53 #ifdef XCOFF_DEBUGGING_INFO
54 #include "xcoffout.h" /* Needed for external data
55 declarations for e.g. AIX 4.x. */
58 #ifndef TRAMPOLINE_ALIGNMENT
59 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
63 #define ASM_STABS_OP "\t.stabs\t"
66 /* The (assembler) name of the first globally-visible object output. */
67 const char *first_global_object_name
;
68 const char *weak_global_object_name
;
71 struct constant_descriptor_rtx
;
75 #define MAX_RTX_HASH_TABLE 61
77 struct varasm_status
GTY(())
79 /* Hash facility for making memory-constants
80 from constant rtl-expressions. It is used on RISC machines
81 where immediate integer arguments and constant addresses are restricted
82 so that such constants must be stored in memory.
84 This pool of constants is reinitialized for each function
85 so each function gets its own constants-pool that comes right before
87 struct constant_descriptor_rtx
** GTY ((length ("MAX_RTX_HASH_TABLE")))
88 x_const_rtx_hash_table
;
89 struct pool_constant
** GTY ((length ("MAX_RTX_HASH_TABLE")))
90 x_const_rtx_sym_hash_table
;
92 /* Pointers to first and last constant in pool. */
93 struct pool_constant
*x_first_pool
;
94 struct pool_constant
*x_last_pool
;
96 /* Current offset in constant pool (does not include any machine-specific
98 HOST_WIDE_INT x_pool_offset
;
100 /* Number of tree-constants deferred during the expansion of this
102 unsigned int deferred_constants
;
105 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
106 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
107 #define first_pool (cfun->varasm->x_first_pool)
108 #define last_pool (cfun->varasm->x_last_pool)
109 #define pool_offset (cfun->varasm->x_pool_offset)
110 #define n_deferred_constants (cfun->varasm->deferred_constants)
112 /* Number for making the label on the next
113 constant that is stored in memory. */
115 static GTY(()) int const_labelno
;
117 /* Number for making the label on the next
118 static variable internal to a function. */
120 static GTY(()) int var_labelno
;
122 /* Carry information from ASM_DECLARE_OBJECT_NAME
123 to ASM_FINISH_DECLARE_OBJECT. */
125 int size_directive_output
;
127 /* The last decl for which assemble_variable was called,
128 if it did ASM_DECLARE_OBJECT_NAME.
129 If the last call to assemble_variable didn't do that,
132 tree last_assemble_variable_decl
;
134 /* RTX_UNCHANGING_P in a MEM can mean it is stored into, for initialization.
135 So giving constant the alias set for the type will allow such
136 initializations to appear to conflict with the load of the constant. We
137 avoid this by giving all constants an alias set for just constants.
138 Since there will be no stores to that alias set, nothing will ever
139 conflict with them. */
141 static HOST_WIDE_INT const_alias_set
;
143 static const char *strip_reg_name
PARAMS ((const char *));
144 static int contains_pointers_p
PARAMS ((tree
));
145 static void decode_addr_const
PARAMS ((tree
, struct addr_const
*));
146 static hashval_t const_desc_hash
PARAMS ((const void *));
147 static int const_desc_eq
PARAMS ((const void *, const void *));
148 static hashval_t const_hash_1
PARAMS ((const tree
));
149 static int compare_constant
PARAMS ((const tree
, const tree
));
150 static tree copy_constant
PARAMS ((tree
));
151 static void output_constant_def_contents
PARAMS ((rtx
));
152 static void decode_rtx_const
PARAMS ((enum machine_mode
, rtx
,
153 struct rtx_const
*));
154 static unsigned int const_hash_rtx
PARAMS ((enum machine_mode
, rtx
));
155 static int compare_constant_rtx
156 PARAMS ((enum machine_mode
, rtx
, struct constant_descriptor_rtx
*));
157 static struct constant_descriptor_rtx
* record_constant_rtx
158 PARAMS ((enum machine_mode
, rtx
));
159 static struct pool_constant
*find_pool_constant
PARAMS ((struct function
*, rtx
));
160 static void mark_constant_pool
PARAMS ((void));
161 static void mark_constants
PARAMS ((rtx
));
162 static int mark_constant
PARAMS ((rtx
*current_rtx
, void *data
));
163 static int output_addressed_constants
PARAMS ((tree
));
164 static unsigned HOST_WIDE_INT array_size_for_constructor
PARAMS ((tree
));
165 static unsigned min_align
PARAMS ((unsigned, unsigned));
166 static void output_constructor
PARAMS ((tree
, HOST_WIDE_INT
,
168 static void globalize_decl
PARAMS ((tree
));
169 static void maybe_assemble_visibility
PARAMS ((tree
));
170 static int in_named_entry_eq
PARAMS ((const PTR
, const PTR
));
171 static hashval_t in_named_entry_hash
PARAMS ((const PTR
));
172 #ifdef ASM_OUTPUT_BSS
173 static void asm_output_bss
PARAMS ((FILE *, tree
, const char *, int, int));
175 #ifdef BSS_SECTION_ASM_OP
176 #ifdef ASM_OUTPUT_ALIGNED_BSS
177 static void asm_output_aligned_bss
178 PARAMS ((FILE *, tree
, const char *, int, int)) ATTRIBUTE_UNUSED
;
180 #endif /* BSS_SECTION_ASM_OP */
181 static bool asm_emit_uninitialised
PARAMS ((tree
, const char*, int, int));
182 static void resolve_unique_section
PARAMS ((tree
, int, int));
183 static void mark_weak
PARAMS ((tree
));
185 enum in_section
{ no_section
, in_text
, in_data
, in_named
186 #ifdef BSS_SECTION_ASM_OP
189 #ifdef CTORS_SECTION_ASM_OP
192 #ifdef DTORS_SECTION_ASM_OP
195 #ifdef READONLY_DATA_SECTION_ASM_OP
198 #ifdef EXTRA_SECTIONS
202 static GTY(()) enum in_section in_section
= no_section
;
204 /* Return a nonzero value if DECL has a section attribute. */
205 #ifndef IN_NAMED_SECTION
206 #define IN_NAMED_SECTION(DECL) \
207 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
208 && DECL_SECTION_NAME (DECL) != NULL_TREE)
211 /* Text of section name when in_section == in_named. */
212 static GTY(()) const char *in_named_name
;
214 /* Hash table of flags that have been used for a particular named section. */
216 struct in_named_entry
GTY(())
223 static GTY((param_is (struct in_named_entry
))) htab_t in_named_htab
;
225 /* Define functions like text_section for any extra sections. */
226 #ifdef EXTRA_SECTION_FUNCTIONS
227 EXTRA_SECTION_FUNCTIONS
230 /* Tell assembler to switch to text section. */
235 if (in_section
!= in_text
)
237 in_section
= in_text
;
241 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
246 /* Tell assembler to switch to data section. */
251 if (in_section
!= in_data
)
253 in_section
= in_data
;
254 if (flag_shared_data
)
256 #ifdef SHARED_SECTION_ASM_OP
257 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
259 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
263 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
267 /* Tell assembler to switch to read-only data section. This is normally
271 readonly_data_section ()
273 #ifdef READONLY_DATA_SECTION
274 READONLY_DATA_SECTION (); /* Note this can call data_section. */
276 #ifdef READONLY_DATA_SECTION_ASM_OP
277 if (in_section
!= in_readonly_data
)
279 in_section
= in_readonly_data
;
280 fputs (READONLY_DATA_SECTION_ASM_OP
, asm_out_file
);
281 fputc ('\n', asm_out_file
);
289 /* Determine if we're in the text section. */
294 return in_section
== in_text
;
297 /* Determine if we're in the data section. */
302 return in_section
== in_data
;
305 /* Helper routines for maintaining in_named_htab. */
308 in_named_entry_eq (p1
, p2
)
312 const struct in_named_entry
*old
= p1
;
313 const char *new = p2
;
315 return strcmp (old
->name
, new) == 0;
319 in_named_entry_hash (p
)
322 const struct in_named_entry
*old
= p
;
323 return htab_hash_string (old
->name
);
326 /* If SECTION has been seen before as a named section, return the flags
327 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
328 set of flags for a section to have, so 0 does not mean that the section
329 has not been seen. */
332 get_named_section_flags (section
)
335 struct in_named_entry
**slot
;
337 slot
= (struct in_named_entry
**)
338 htab_find_slot_with_hash (in_named_htab
, section
,
339 htab_hash_string (section
), NO_INSERT
);
341 return slot
? (*slot
)->flags
: 0;
344 /* Returns true if the section has been declared before. Sets internal
345 flag on this section in in_named_hash so subsequent calls on this
346 section will return false. */
349 named_section_first_declaration (name
)
352 struct in_named_entry
**slot
;
354 slot
= (struct in_named_entry
**)
355 htab_find_slot_with_hash (in_named_htab
, name
,
356 htab_hash_string (name
), NO_INSERT
);
357 if (! (*slot
)->declared
)
359 (*slot
)->declared
= true;
369 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
370 different set of flags, return false. */
373 set_named_section_flags (section
, flags
)
377 struct in_named_entry
**slot
, *entry
;
379 slot
= (struct in_named_entry
**)
380 htab_find_slot_with_hash (in_named_htab
, section
,
381 htab_hash_string (section
), INSERT
);
386 entry
= (struct in_named_entry
*) ggc_alloc (sizeof (*entry
));
388 entry
->name
= ggc_strdup (section
);
389 entry
->flags
= flags
;
390 entry
->declared
= false;
392 else if (entry
->flags
!= flags
)
398 /* Tell assembler to change to section NAME with attributes FLAGS. */
401 named_section_flags (name
, flags
)
405 if (in_section
!= in_named
|| strcmp (name
, in_named_name
) != 0)
407 if (! set_named_section_flags (name
, flags
))
410 (*targetm
.asm_out
.named_section
) (name
, flags
);
412 if (flags
& SECTION_FORGET
)
413 in_section
= no_section
;
416 in_named_name
= ggc_strdup (name
);
417 in_section
= in_named
;
422 /* Tell assembler to change to section NAME for DECL.
423 If DECL is NULL, just switch to section NAME.
424 If NAME is NULL, get the name from DECL.
425 If RELOC is 1, the initializer for DECL contains relocs. */
428 named_section (decl
, name
, reloc
)
435 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
438 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
440 flags
= (* targetm
.section_type_flags
) (decl
, name
, reloc
);
442 /* Sanity check user variables for flag changes. Non-user
443 section flag changes will abort in named_section_flags.
444 However, don't complain if SECTION_OVERRIDE is set.
445 We trust that the setter knows that it is safe to ignore
446 the default flags for this decl. */
447 if (decl
&& ! set_named_section_flags (name
, flags
))
449 flags
= get_named_section_flags (name
);
450 if ((flags
& SECTION_OVERRIDE
) == 0)
451 error_with_decl (decl
, "%s causes a section type conflict");
454 named_section_flags (name
, flags
);
457 /* If required, set DECL_SECTION_NAME to a unique name. */
460 resolve_unique_section (decl
, reloc
, flag_function_or_data_sections
)
462 int reloc ATTRIBUTE_UNUSED
;
463 int flag_function_or_data_sections
;
465 if (DECL_SECTION_NAME (decl
) == NULL_TREE
466 && targetm
.have_named_sections
467 && (flag_function_or_data_sections
468 || DECL_ONE_ONLY (decl
)))
469 (*targetm
.asm_out
.unique_section
) (decl
, reloc
);
472 #ifdef BSS_SECTION_ASM_OP
474 /* Tell the assembler to switch to the bss section. */
479 if (in_section
!= in_bss
)
481 #ifdef SHARED_BSS_SECTION_ASM_OP
482 if (flag_shared_data
)
483 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
486 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
492 #ifdef ASM_OUTPUT_BSS
494 /* Utility function for ASM_OUTPUT_BSS for targets to use if
495 they don't support alignments in .bss.
496 ??? It is believed that this function will work in most cases so such
497 support is localized here. */
500 asm_output_bss (file
, decl
, name
, size
, rounded
)
502 tree decl ATTRIBUTE_UNUSED
;
504 int size ATTRIBUTE_UNUSED
, rounded
;
506 (*targetm
.asm_out
.globalize_label
) (file
, name
);
508 #ifdef ASM_DECLARE_OBJECT_NAME
509 last_assemble_variable_decl
= decl
;
510 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
512 /* Standard thing is just output label for the object. */
513 ASM_OUTPUT_LABEL (file
, name
);
514 #endif /* ASM_DECLARE_OBJECT_NAME */
515 ASM_OUTPUT_SKIP (file
, rounded
? rounded
: 1);
520 #ifdef ASM_OUTPUT_ALIGNED_BSS
522 /* Utility function for targets to use in implementing
523 ASM_OUTPUT_ALIGNED_BSS.
524 ??? It is believed that this function will work in most cases so such
525 support is localized here. */
528 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
530 tree decl ATTRIBUTE_UNUSED
;
535 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
536 #ifdef ASM_DECLARE_OBJECT_NAME
537 last_assemble_variable_decl
= decl
;
538 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
540 /* Standard thing is just output label for the object. */
541 ASM_OUTPUT_LABEL (file
, name
);
542 #endif /* ASM_DECLARE_OBJECT_NAME */
543 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
548 #endif /* BSS_SECTION_ASM_OP */
550 /* Switch to the section for function DECL.
552 If DECL is NULL_TREE, switch to the text section.
553 ??? It's not clear that we will ever be passed NULL_TREE, but it's
554 safer to handle it. */
557 function_section (decl
)
560 if (decl
!= NULL_TREE
561 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
562 named_section (decl
, (char *) 0, 0);
567 /* Switch to section for variable DECL. RELOC is the same as the
568 argument to SELECT_SECTION. */
571 variable_section (decl
, reloc
)
575 if (IN_NAMED_SECTION (decl
))
576 named_section (decl
, NULL
, reloc
);
578 (*targetm
.asm_out
.select_section
) (decl
, reloc
, DECL_ALIGN (decl
));
581 /* Tell assembler to switch to the section for string merging. */
584 mergeable_string_section (decl
, align
, flags
)
585 tree decl ATTRIBUTE_UNUSED
;
586 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
587 unsigned int flags ATTRIBUTE_UNUSED
;
589 #ifdef HAVE_GAS_SHF_MERGE
590 if (flag_merge_constants
591 && TREE_CODE (decl
) == STRING_CST
592 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
594 && TREE_STRING_LENGTH (decl
) >= int_size_in_bytes (TREE_TYPE (decl
)))
596 enum machine_mode mode
;
597 unsigned int modesize
;
602 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (decl
)));
603 modesize
= GET_MODE_BITSIZE (mode
);
604 if (modesize
>= 8 && modesize
<= 256
605 && (modesize
& (modesize
- 1)) == 0)
607 if (align
< modesize
)
610 str
= TREE_STRING_POINTER (decl
);
611 len
= TREE_STRING_LENGTH (decl
);
612 unit
= GET_MODE_SIZE (mode
);
614 /* Check for embedded NUL characters. */
615 for (i
= 0; i
< len
; i
+= unit
)
617 for (j
= 0; j
< unit
; j
++)
618 if (str
[i
+ j
] != '\0')
625 sprintf (name
, ".rodata.str%d.%d", modesize
/ 8,
627 flags
|= (modesize
/ 8) | SECTION_MERGE
| SECTION_STRINGS
;
628 if (!i
&& modesize
< align
)
630 /* A "" string with requested alignment greater than
631 character size might cause a problem:
632 if some other string required even bigger
633 alignment than "", then linker might think the
634 "" is just part of padding after some other string
635 and not put it into the hash table initially.
636 But this means "" could have smaller alignment
638 #ifdef ASM_OUTPUT_SECTION_START
639 named_section_flags (name
, flags
);
640 ASM_OUTPUT_SECTION_START (asm_out_file
);
642 readonly_data_section ();
647 named_section_flags (name
, flags
);
653 readonly_data_section ();
656 /* Tell assembler to switch to the section for constant merging. */
659 mergeable_constant_section (mode
, align
, flags
)
660 enum machine_mode mode ATTRIBUTE_UNUSED
;
661 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
662 unsigned int flags ATTRIBUTE_UNUSED
;
664 #ifdef HAVE_GAS_SHF_MERGE
665 unsigned int modesize
= GET_MODE_BITSIZE (mode
);
667 if (flag_merge_constants
673 && (align
& (align
- 1)) == 0)
677 sprintf (name
, ".rodata.cst%d", (int) (align
/ 8));
678 flags
|= (align
/ 8) | SECTION_MERGE
;
679 named_section_flags (name
, flags
);
683 readonly_data_section ();
686 /* Given NAME, a putative register name, discard any customary prefixes. */
689 strip_reg_name (name
)
692 #ifdef REGISTER_PREFIX
693 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
694 name
+= strlen (REGISTER_PREFIX
);
696 if (name
[0] == '%' || name
[0] == '#')
701 /* Decode an `asm' spec for a declaration as a register name.
702 Return the register number, or -1 if nothing specified,
703 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
704 or -3 if ASMSPEC is `cc' and is not recognized,
705 or -4 if ASMSPEC is `memory' and is not recognized.
706 Accept an exact spelling or a decimal number.
707 Prefixes such as % are optional. */
710 decode_reg_name (asmspec
)
717 /* Get rid of confusing prefixes. */
718 asmspec
= strip_reg_name (asmspec
);
720 /* Allow a decimal number as a "register name". */
721 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
722 if (! ISDIGIT (asmspec
[i
]))
724 if (asmspec
[0] != 0 && i
< 0)
727 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
733 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
735 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
738 #ifdef ADDITIONAL_REGISTER_NAMES
740 static const struct { const char *const name
; const int number
; } table
[]
741 = ADDITIONAL_REGISTER_NAMES
;
743 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
744 if (! strcmp (asmspec
, table
[i
].name
))
745 return table
[i
].number
;
747 #endif /* ADDITIONAL_REGISTER_NAMES */
749 if (!strcmp (asmspec
, "memory"))
752 if (!strcmp (asmspec
, "cc"))
761 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
762 have static storage duration. In other words, it should not be an
763 automatic variable, including PARM_DECLs.
765 There is, however, one exception: this function handles variables
766 explicitly placed in a particular register by the user.
768 ASMSPEC, if not 0, is the string which the user specified as the
769 assembler symbol name.
771 This is never called for PARM_DECL nodes. */
774 make_decl_rtl (decl
, asmspec
)
778 int top_level
= (DECL_CONTEXT (decl
) == NULL_TREE
);
779 const char *name
= 0;
780 const char *new_name
= 0;
784 /* Check that we are not being given an automatic variable. */
785 /* A weak alias has TREE_PUBLIC set but not the other bits. */
786 if (TREE_CODE (decl
) == PARM_DECL
787 || TREE_CODE (decl
) == RESULT_DECL
788 || (TREE_CODE (decl
) == VAR_DECL
789 && !TREE_STATIC (decl
)
790 && !TREE_PUBLIC (decl
)
791 && !DECL_EXTERNAL (decl
)
792 && !DECL_REGISTER (decl
)))
794 /* And that we were not given a type or a label. */
795 else if (TREE_CODE (decl
) == TYPE_DECL
796 || TREE_CODE (decl
) == LABEL_DECL
)
799 /* For a duplicate declaration, we can be called twice on the
800 same DECL node. Don't discard the RTL already made. */
801 if (DECL_RTL_SET_P (decl
))
803 /* If the old RTL had the wrong mode, fix the mode. */
804 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
805 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
806 DECL_MODE (decl
), 0));
808 /* ??? Another way to do this would be to maintain a hashed
809 table of such critters. Instead of adding stuff to a DECL
810 to give certain attributes to it, we could use an external
811 hash map from DECL to set of attributes. */
813 /* Let the target reassign the RTL if it wants.
814 This is necessary, for example, when one machine specific
815 decl attribute overrides another. */
816 (* targetm
.encode_section_info
) (decl
, DECL_RTL (decl
), false);
820 new_name
= name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
822 reg_number
= decode_reg_name (asmspec
);
823 if (reg_number
== -2)
825 /* ASMSPEC is given, and not the name of a register. Mark the
826 name with a star so assemble_name won't munge it. */
827 char *starred
= alloca (strlen (asmspec
) + 2);
829 strcpy (starred
+ 1, asmspec
);
833 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
835 /* First detect errors in declaring global registers. */
836 if (reg_number
== -1)
837 error_with_decl (decl
, "register name not specified for `%s'");
838 else if (reg_number
< 0)
839 error_with_decl (decl
, "invalid register name for `%s'");
840 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
841 error_with_decl (decl
,
842 "data type of `%s' isn't suitable for a register");
843 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
844 error_with_decl (decl
,
845 "register specified for `%s' isn't suitable for data type");
846 /* Now handle properly declared static register variables. */
851 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
853 DECL_INITIAL (decl
) = 0;
854 error ("global register variable has initial value");
856 if (TREE_THIS_VOLATILE (decl
))
857 warning ("volatile register variables don't work as you might wish");
859 /* If the user specified one of the eliminables registers here,
860 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
861 confused with that register and be eliminated. This usage is
862 somewhat suspect... */
864 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
865 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
866 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
868 if (TREE_STATIC (decl
))
870 /* Make this register global, so not usable for anything
872 #ifdef ASM_DECLARE_REGISTER_GLOBAL
873 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
875 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
877 globalize_reg (reg_number
+ --nregs
);
880 /* As a register variable, it has no section. */
885 /* Now handle ordinary static variables and functions (in memory).
886 Also handle vars declared register invalidly. */
888 if (reg_number
>= 0 || reg_number
== -3)
889 error_with_decl (decl
,
890 "register name given for non-register variable `%s'");
892 /* Specifying a section attribute on a variable forces it into a
893 non-.bss section, and thus it cannot be common. */
894 if (TREE_CODE (decl
) == VAR_DECL
895 && DECL_SECTION_NAME (decl
) != NULL_TREE
896 && DECL_INITIAL (decl
) == NULL_TREE
897 && DECL_COMMON (decl
))
898 DECL_COMMON (decl
) = 0;
900 /* Variables can't be both common and weak. */
901 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
902 DECL_COMMON (decl
) = 0;
904 /* Can't use just the variable's own name for a variable
905 whose scope is less than the whole file, unless it's a member
906 of a local class (which will already be unambiguous).
907 Concatenate a distinguishing number. */
908 if (!top_level
&& !TREE_PUBLIC (decl
)
909 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
911 && name
== IDENTIFIER_POINTER (DECL_NAME (decl
)))
915 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
920 if (name
!= new_name
)
922 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (new_name
));
923 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
926 x
= gen_rtx_SYMBOL_REF (Pmode
, name
);
927 SYMBOL_REF_WEAK (x
) = DECL_WEAK (decl
);
928 SYMBOL_REF_DECL (x
) = decl
;
930 x
= gen_rtx_MEM (DECL_MODE (decl
), x
);
931 if (TREE_CODE (decl
) != FUNCTION_DECL
)
932 set_mem_attributes (x
, decl
, 1);
933 SET_DECL_RTL (decl
, x
);
935 /* Optionally set flags or add text to the name to record information
936 such as that it is a function name.
937 If the name is changed, the macro ASM_OUTPUT_LABELREF
938 will have to know how to strip this information. */
939 (* targetm
.encode_section_info
) (decl
, DECL_RTL (decl
), true);
942 /* Make the rtl for variable VAR be volatile.
943 Use this only for static variables. */
946 make_var_volatile (var
)
949 if (GET_CODE (DECL_RTL (var
)) != MEM
)
952 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
955 /* Output a string of literal assembler code
956 for an `asm' keyword used between functions. */
959 assemble_asm (string
)
964 if (TREE_CODE (string
) == ADDR_EXPR
)
965 string
= TREE_OPERAND (string
, 0);
967 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
970 /* Record an element in the table of global destructors. SYMBOL is
971 a SYMBOL_REF of the function to be called; PRIORITY is a number
972 between 0 and MAX_INIT_PRIORITY. */
975 default_stabs_asm_out_destructor (symbol
, priority
)
977 int priority ATTRIBUTE_UNUSED
;
979 /* Tell GNU LD that this is part of the static destructor set.
980 This will work for any system that uses stabs, most usefully
982 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
983 assemble_name (asm_out_file
, XSTR (symbol
, 0));
984 fputc ('\n', asm_out_file
);
988 default_named_section_asm_out_destructor (symbol
, priority
)
992 const char *section
= ".dtors";
995 /* ??? This only works reliably with the GNU linker. */
996 if (priority
!= DEFAULT_INIT_PRIORITY
)
998 sprintf (buf
, ".dtors.%.5u",
999 /* Invert the numbering so the linker puts us in the proper
1000 order; constructors are run from right to left, and the
1001 linker sorts in increasing order. */
1002 MAX_INIT_PRIORITY
- priority
);
1006 named_section_flags (section
, SECTION_WRITE
);
1007 assemble_align (POINTER_SIZE
);
1008 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1011 #ifdef DTORS_SECTION_ASM_OP
1015 if (in_section
!= in_dtors
)
1017 in_section
= in_dtors
;
1018 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
1019 fputc ('\n', asm_out_file
);
1024 default_dtor_section_asm_out_destructor (symbol
, priority
)
1026 int priority ATTRIBUTE_UNUSED
;
1029 assemble_align (POINTER_SIZE
);
1030 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1034 /* Likewise for global constructors. */
1037 default_stabs_asm_out_constructor (symbol
, priority
)
1039 int priority ATTRIBUTE_UNUSED
;
1041 /* Tell GNU LD that this is part of the static destructor set.
1042 This will work for any system that uses stabs, most usefully
1044 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
1045 assemble_name (asm_out_file
, XSTR (symbol
, 0));
1046 fputc ('\n', asm_out_file
);
1050 default_named_section_asm_out_constructor (symbol
, priority
)
1054 const char *section
= ".ctors";
1057 /* ??? This only works reliably with the GNU linker. */
1058 if (priority
!= DEFAULT_INIT_PRIORITY
)
1060 sprintf (buf
, ".ctors.%.5u",
1061 /* Invert the numbering so the linker puts us in the proper
1062 order; constructors are run from right to left, and the
1063 linker sorts in increasing order. */
1064 MAX_INIT_PRIORITY
- priority
);
1068 named_section_flags (section
, SECTION_WRITE
);
1069 assemble_align (POINTER_SIZE
);
1070 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1073 #ifdef CTORS_SECTION_ASM_OP
1077 if (in_section
!= in_ctors
)
1079 in_section
= in_ctors
;
1080 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1081 fputc ('\n', asm_out_file
);
1086 default_ctor_section_asm_out_constructor (symbol
, priority
)
1088 int priority ATTRIBUTE_UNUSED
;
1091 assemble_align (POINTER_SIZE
);
1092 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1096 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1097 a nonzero value if the constant pool should be output before the
1098 start of the function, or a zero value if the pool should output
1099 after the end of the function. The default is to put it before the
1102 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1103 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1106 /* Output assembler code for the constant pool of a function and associated
1107 with defining the name of the function. DECL describes the function.
1108 NAME is the function's name. For the constant pool, we use the current
1109 constant pool data. */
1112 assemble_start_function (decl
, fnname
)
1118 /* The following code does not need preprocessing in the assembler. */
1122 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1123 output_constant_pool (fnname
, decl
);
1125 resolve_unique_section (decl
, 0, flag_function_sections
);
1126 function_section (decl
);
1128 /* Tell assembler to move to target machine's alignment for functions. */
1129 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1130 if (align
< force_align_functions_log
)
1131 align
= force_align_functions_log
;
1134 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1137 /* Handle a user-specified function alignment.
1138 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1139 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1140 if (align_functions_log
> align
1141 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1143 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1144 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1145 align_functions_log
, align_functions
- 1);
1147 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1151 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1152 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1155 (*debug_hooks
->begin_function
) (decl
);
1157 /* Make function name accessible from other files, if appropriate. */
1159 if (TREE_PUBLIC (decl
))
1161 if (! first_global_object_name
)
1166 p
= (* targetm
.strip_name_encoding
) (fnname
);
1169 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1170 first_global_object_name
= name
;
1172 weak_global_object_name
= name
;
1175 globalize_decl (decl
);
1177 maybe_assemble_visibility (decl
);
1180 /* Do any machine/system dependent processing of the function name */
1181 #ifdef ASM_DECLARE_FUNCTION_NAME
1182 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1184 /* Standard thing is just output label for the function. */
1185 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1186 #endif /* ASM_DECLARE_FUNCTION_NAME */
1189 /* Output assembler code associated with defining the size of the
1190 function. DECL describes the function. NAME is the function's name. */
1193 assemble_end_function (decl
, fnname
)
1197 #ifdef ASM_DECLARE_FUNCTION_SIZE
1198 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1200 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1202 output_constant_pool (fnname
, decl
);
1203 function_section (decl
); /* need to switch back */
1207 /* Assemble code to leave SIZE bytes of zeros. */
1210 assemble_zeros (size
)
1213 /* Do no output if -fsyntax-only. */
1214 if (flag_syntax_only
)
1217 #ifdef ASM_NO_SKIP_IN_TEXT
1218 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1219 so we must output 0s explicitly in the text section. */
1220 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1223 for (i
= 0; i
< size
; i
++)
1224 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1229 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1232 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1235 assemble_align (align
)
1238 if (align
> BITS_PER_UNIT
)
1240 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1244 /* Assemble a string constant with the specified C string as contents. */
1247 assemble_string (p
, size
)
1254 /* If the string is very long, split it up. */
1258 int thissize
= size
- pos
;
1259 if (thissize
> maximum
)
1262 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1270 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1271 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1272 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1274 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1275 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1276 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1278 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1279 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1283 #if defined ASM_OUTPUT_ALIGNED_BSS
1284 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1285 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1287 #if defined ASM_OUTPUT_BSS
1288 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1289 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1295 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1296 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1297 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1299 #if defined ASM_OUTPUT_ALIGNED_COMMON
1300 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1301 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1303 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1304 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1309 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1312 int size ATTRIBUTE_UNUSED
;
1313 int rounded ATTRIBUTE_UNUSED
;
1321 destination
= asm_dest_local
;
1323 /* ??? We should handle .bss via select_section mechanisms rather than
1324 via special target hooks. That would eliminate this special case. */
1325 if (TREE_PUBLIC (decl
))
1327 if (!DECL_COMMON (decl
))
1329 destination
= asm_dest_bss
;
1334 destination
= asm_dest_common
;
1337 if (destination
== asm_dest_bss
)
1338 globalize_decl (decl
);
1339 resolve_unique_section (decl
, 0, flag_data_sections
);
1341 if (flag_shared_data
)
1343 switch (destination
)
1345 #ifdef ASM_OUTPUT_SHARED_BSS
1347 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1350 #ifdef ASM_OUTPUT_SHARED_COMMON
1351 case asm_dest_common
:
1352 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1355 #ifdef ASM_OUTPUT_SHARED_LOCAL
1356 case asm_dest_local
:
1357 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1365 switch (destination
)
1369 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1372 case asm_dest_common
:
1373 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1375 case asm_dest_local
:
1376 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1385 /* Assemble everything that is needed for a variable or function declaration.
1386 Not used for automatic variables, and not used for function definitions.
1387 Should not be called for variables of incomplete structure type.
1389 TOP_LEVEL is nonzero if this variable has file scope.
1390 AT_END is nonzero if this is the special handling, at end of compilation,
1391 to define things that have had only tentative definitions.
1392 DONT_OUTPUT_DATA if nonzero means don't actually output the
1393 initial value (that will be done by the caller). */
1396 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1398 int top_level ATTRIBUTE_UNUSED
;
1399 int at_end ATTRIBUTE_UNUSED
;
1400 int dont_output_data
;
1407 last_assemble_variable_decl
= 0;
1409 /* Normally no need to say anything here for external references,
1410 since assemble_external is called by the language-specific code
1411 when a declaration is first seen. */
1413 if (DECL_EXTERNAL (decl
))
1416 /* Output no assembler code for a function declaration.
1417 Only definitions of functions output anything. */
1419 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1422 /* Do nothing for global register variables. */
1423 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1425 TREE_ASM_WRITTEN (decl
) = 1;
1429 /* If type was incomplete when the variable was declared,
1430 see if it is complete now. */
1432 if (DECL_SIZE (decl
) == 0)
1433 layout_decl (decl
, 0);
1435 /* Still incomplete => don't allocate it; treat the tentative defn
1436 (which is what it must have been) as an `extern' reference. */
1438 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1440 error ("%Hstorage size of `%s' isn't known",
1441 &DECL_SOURCE_LOCATION (decl
),
1442 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1443 TREE_ASM_WRITTEN (decl
) = 1;
1447 /* The first declaration of a variable that comes through this function
1448 decides whether it is global (in C, has external linkage)
1449 or local (in C, has internal linkage). So do nothing more
1450 if this function has already run. */
1452 if (TREE_ASM_WRITTEN (decl
))
1455 /* Make sure targetm.encode_section_info is invoked before we set
1457 decl_rtl
= DECL_RTL (decl
);
1459 TREE_ASM_WRITTEN (decl
) = 1;
1461 /* Do no output if -fsyntax-only. */
1462 if (flag_syntax_only
)
1467 if (! dont_output_data
1468 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1470 error_with_decl (decl
, "size of variable `%s' is too large");
1474 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1475 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1476 && ! first_global_object_name
1477 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1478 || DECL_INITIAL (decl
) == error_mark_node
))
1479 && ! DECL_WEAK (decl
)
1480 && ! DECL_ONE_ONLY (decl
))
1485 p
= (* targetm
.strip_name_encoding
) (name
);
1486 xname
= xstrdup (p
);
1487 first_global_object_name
= xname
;
1490 /* Compute the alignment of this data. */
1492 align
= DECL_ALIGN (decl
);
1494 /* In the case for initialing an array whose length isn't specified,
1495 where we have not yet been able to do the layout,
1496 figure out the proper alignment now. */
1497 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1498 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1499 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1501 /* Some object file formats have a maximum alignment which they support.
1502 In particular, a.out format supports a maximum alignment of 4. */
1503 #ifndef MAX_OFILE_ALIGNMENT
1504 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1506 if (align
> MAX_OFILE_ALIGNMENT
)
1508 warning_with_decl (decl
,
1509 "alignment of `%s' is greater than maximum object file alignment. Using %d",
1510 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1511 align
= MAX_OFILE_ALIGNMENT
;
1514 /* On some machines, it is good to increase alignment sometimes. */
1515 if (! DECL_USER_ALIGN (decl
))
1517 #ifdef DATA_ALIGNMENT
1518 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1520 #ifdef CONSTANT_ALIGNMENT
1521 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1522 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1526 /* Reset the alignment in case we have made it tighter, so we can benefit
1527 from it in get_pointer_alignment. */
1528 DECL_ALIGN (decl
) = align
;
1529 set_mem_align (decl_rtl
, align
);
1531 if (TREE_PUBLIC (decl
))
1532 maybe_assemble_visibility (decl
);
1534 /* Output any data that we will need to use the address of. */
1535 if (DECL_INITIAL (decl
) == error_mark_node
)
1536 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1537 else if (DECL_INITIAL (decl
))
1538 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1539 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1541 /* Handle uninitialized definitions. */
1543 /* If the decl has been given an explicit section name, then it
1544 isn't common, and shouldn't be handled as such. */
1545 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1547 /* We don't implement common thread-local data at present. */
1548 else if (DECL_THREAD_LOCAL (decl
))
1550 if (DECL_COMMON (decl
))
1551 sorry ("thread-local COMMON data not implemented");
1553 else if (DECL_INITIAL (decl
) == 0
1554 || DECL_INITIAL (decl
) == error_mark_node
1555 || (flag_zero_initialized_in_bss
1556 /* Leave constant zeroes in .rodata so they can be shared. */
1557 && !TREE_READONLY (decl
)
1558 && initializer_zerop (DECL_INITIAL (decl
))))
1560 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1561 unsigned HOST_WIDE_INT rounded
= size
;
1563 /* Don't allocate zero bytes of common,
1564 since that means "undefined external" in the linker. */
1568 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1569 so that each uninitialized object starts on such a boundary. */
1570 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1571 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1572 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1574 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1575 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1577 (decl
, "requested alignment for %s is greater than implemented alignment of %d",rounded
);
1580 /* If the target cannot output uninitialized but not common global data
1581 in .bss, then we have to use .data, so fall through. */
1582 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1586 /* Handle initialized definitions.
1587 Also handle uninitialized global definitions if -fno-common and the
1588 target doesn't support ASM_OUTPUT_BSS. */
1590 /* First make the assembler name(s) global if appropriate. */
1591 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1592 globalize_decl (decl
);
1594 /* Switch to the appropriate section. */
1595 variable_section (decl
, reloc
);
1597 /* dbxout.c needs to know this. */
1598 if (in_text_section ())
1599 DECL_IN_TEXT_SECTION (decl
) = 1;
1601 /* Output the alignment of this data. */
1602 if (align
> BITS_PER_UNIT
)
1604 ASM_OUTPUT_ALIGN (asm_out_file
,
1605 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1608 /* Do any machine/system dependent processing of the object. */
1609 #ifdef ASM_DECLARE_OBJECT_NAME
1610 last_assemble_variable_decl
= decl
;
1611 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1613 /* Standard thing is just output label for the object. */
1614 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1615 #endif /* ASM_DECLARE_OBJECT_NAME */
1617 if (!dont_output_data
)
1619 if (DECL_INITIAL (decl
) && DECL_INITIAL (decl
) != error_mark_node
)
1620 /* Output the actual data. */
1621 output_constant (DECL_INITIAL (decl
),
1622 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1625 /* Leave space for it. */
1626 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1630 /* Return 1 if type TYPE contains any pointers. */
1633 contains_pointers_p (type
)
1636 switch (TREE_CODE (type
))
1639 case REFERENCE_TYPE
:
1640 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1641 so I'll play safe and return 1. */
1647 case QUAL_UNION_TYPE
:
1650 /* For a type that has fields, see if the fields have pointers. */
1651 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1652 if (TREE_CODE (fields
) == FIELD_DECL
1653 && contains_pointers_p (TREE_TYPE (fields
)))
1659 /* An array type contains pointers if its element type does. */
1660 return contains_pointers_p (TREE_TYPE (type
));
1667 /* Output something to declare an external symbol to the assembler.
1668 (Most assemblers don't need this, so we normally output nothing.)
1669 Do nothing if DECL is not external. */
1672 assemble_external (decl
)
1673 tree decl ATTRIBUTE_UNUSED
;
1675 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1676 main body of this code is only rarely exercised. To provide some
1677 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1678 open. If it's not, we should not be calling this function. */
1682 #ifdef ASM_OUTPUT_EXTERNAL
1683 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1685 rtx rtl
= DECL_RTL (decl
);
1687 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1688 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1690 /* Some systems do require some output. */
1691 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1692 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1698 /* Similar, for calling a library function FUN. */
1701 assemble_external_libcall (fun
)
1702 rtx fun ATTRIBUTE_UNUSED
;
1704 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1705 /* Declare library function name external when first used, if nec. */
1706 if (! SYMBOL_REF_USED (fun
))
1708 SYMBOL_REF_USED (fun
) = 1;
1709 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1714 /* Assemble a label named NAME. */
1717 assemble_label (name
)
1720 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1723 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1724 If NAME starts with a *, the rest of NAME is output verbatim.
1725 Otherwise NAME is transformed in an implementation-defined way
1726 (usually by the addition of an underscore).
1727 Many macros in the tm file are defined to call this function. */
1730 assemble_name (file
, name
)
1734 const char *real_name
;
1737 real_name
= (* targetm
.strip_name_encoding
) (name
);
1739 id
= maybe_get_identifier (real_name
);
1741 TREE_SYMBOL_REFERENCED (id
) = 1;
1744 fputs (&name
[1], file
);
1746 ASM_OUTPUT_LABELREF (file
, name
);
1749 /* Allocate SIZE bytes writable static space with a gensym name
1750 and return an RTX to refer to its address. */
1753 assemble_static_space (size
)
1757 const char *namestring
;
1761 if (flag_shared_data
)
1765 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1767 namestring
= ggc_strdup (name
);
1769 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1770 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
1772 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1773 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1776 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1777 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1780 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1781 so that each uninitialized object starts on such a boundary. */
1782 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1783 int rounded ATTRIBUTE_UNUSED
1784 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1785 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1786 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1787 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1794 /* Assemble the static constant template for function entry trampolines.
1795 This is done at most once per compilation.
1796 Returns an RTX for the address of the template. */
1798 #ifdef TRAMPOLINE_TEMPLATE
1800 assemble_trampoline_template ()
1807 /* By default, put trampoline templates in read-only data section. */
1809 #ifdef TRAMPOLINE_SECTION
1810 TRAMPOLINE_SECTION ();
1812 readonly_data_section ();
1815 /* Write the assembler code to define one. */
1816 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1819 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1822 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LTRAMP", 0);
1823 TRAMPOLINE_TEMPLATE (asm_out_file
);
1825 /* Record the rtl to refer to it. */
1826 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1827 name
= ggc_strdup (label
);
1828 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
1829 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
1835 /* A and B are either alignments or offsets. Return the minimum alignment
1836 that may be assumed after adding the two together. */
1838 static inline unsigned
1842 return (a
| b
) & -(a
| b
);
1845 /* Return the assembler directive for creating a given kind of integer
1846 object. SIZE is the number of bytes in the object and ALIGNED_P
1847 indicates whether it is known to be aligned. Return NULL if the
1848 assembly dialect has no such directive.
1850 The returned string should be printed at the start of a new line and
1851 be followed immediately by the object's initial value. */
1854 integer_asm_op (size
, aligned_p
)
1858 struct asm_int_op
*ops
;
1861 ops
= &targetm
.asm_out
.aligned_op
;
1863 ops
= &targetm
.asm_out
.unaligned_op
;
1868 return targetm
.asm_out
.byte_op
;
1882 /* Use directive OP to assemble an integer object X. Print OP at the
1883 start of the line, followed immediately by the value of X. */
1886 assemble_integer_with_op (op
, x
)
1890 fputs (op
, asm_out_file
);
1891 output_addr_const (asm_out_file
, x
);
1892 fputc ('\n', asm_out_file
);
1895 /* The default implementation of the asm_out.integer target hook. */
1898 default_assemble_integer (x
, size
, aligned_p
)
1899 rtx x ATTRIBUTE_UNUSED
;
1900 unsigned int size ATTRIBUTE_UNUSED
;
1901 int aligned_p ATTRIBUTE_UNUSED
;
1903 const char *op
= integer_asm_op (size
, aligned_p
);
1904 return op
&& (assemble_integer_with_op (op
, x
), true);
1907 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1908 the alignment of the integer in bits. Return 1 if we were able to output
1909 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1913 assemble_integer (x
, size
, align
, force
)
1921 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
1923 /* See if the target hook can handle this kind of object. */
1924 if ((*targetm
.asm_out
.integer
) (x
, size
, aligned_p
))
1927 /* If the object is a multi-byte one, try splitting it up. Split
1928 it into words it if is multi-word, otherwise split it into bytes. */
1931 enum machine_mode omode
, imode
;
1932 unsigned int subalign
;
1933 unsigned int subsize
, i
;
1935 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
1936 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
1937 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
1938 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1940 for (i
= 0; i
< size
; i
+= subsize
)
1942 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
1943 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
1949 /* If we've printed some of it, but not all of it, there's no going
1962 assemble_real (d
, mode
, align
)
1964 enum machine_mode mode
;
1969 unsigned int nalign
= min_align (align
, 32);
1971 switch (BITS_PER_UNIT
)
1977 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1978 assemble_integer (GEN_INT (l
), 4, align
, 1);
1981 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1982 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1983 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1986 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
1987 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1988 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1989 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
1992 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
1993 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1994 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1995 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
1996 assemble_integer (GEN_INT (data
[3]), 4, nalign
, 1);
2007 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
2008 assemble_integer (GEN_INT (l
), 2, align
, 1);
2011 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
2012 assemble_integer (GEN_INT (data
[0]), 2, align
, 1);
2013 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
2024 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
2025 assemble_integer (GEN_INT (l
), 1, align
, 1);
2028 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
2029 assemble_integer (GEN_INT (data
[0]), 1, align
, 1);
2030 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
2042 /* Given an expression EXP with a constant value,
2043 reduce it to the sum of an assembler symbol and an integer.
2044 Store them both in the structure *VALUE.
2045 Abort if EXP does not reduce. */
2047 struct addr_const
GTY(())
2050 HOST_WIDE_INT offset
;
2054 decode_addr_const (exp
, value
)
2056 struct addr_const
*value
;
2058 tree target
= TREE_OPERAND (exp
, 0);
2064 if (TREE_CODE (target
) == COMPONENT_REF
2065 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2068 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2069 target
= TREE_OPERAND (target
, 0);
2071 else if (TREE_CODE (target
) == ARRAY_REF
2072 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2074 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2075 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2076 target
= TREE_OPERAND (target
, 0);
2082 switch (TREE_CODE (target
))
2086 x
= DECL_RTL (target
);
2090 x
= gen_rtx_MEM (FUNCTION_MODE
,
2091 gen_rtx_LABEL_REF (VOIDmode
,
2092 label_rtx (TREE_OPERAND (exp
, 0))));
2100 x
= output_constant_def (target
, 1);
2107 if (GET_CODE (x
) != MEM
)
2112 value
->offset
= offset
;
2115 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2116 enum kind
{ RTX_UNKNOWN
, RTX_DOUBLE
, RTX_VECTOR
, RTX_INT
, RTX_UNSPEC
};
2117 struct rtx_const
GTY(())
2119 ENUM_BITFIELD(kind
) kind
: 16;
2120 ENUM_BITFIELD(machine_mode
) mode
: 16;
2121 union rtx_const_un
{
2122 REAL_VALUE_TYPE
GTY ((tag ("4"))) du
;
2123 struct rtx_const_u_addr
{
2126 HOST_WIDE_INT offset
;
2127 } GTY ((tag ("1"))) addr
;
2128 struct rtx_const_u_di
{
2131 } GTY ((tag ("0"))) di
;
2133 /* The max vector size we have is 16 wide; two variants for
2134 integral and floating point vectors. */
2135 struct rtx_const_int_vec
{
2138 } GTY ((tag ("2"))) int_vec
[16];
2140 REAL_VALUE_TYPE
GTY ((tag ("3"))) fp_vec
[8];
2142 } GTY ((desc ("%1.kind >= RTX_INT"), descbits ("1"))) un
;
2145 /* Uniquize all constants that appear in memory.
2146 Each constant in memory thus far output is recorded
2147 in `const_hash_table'. */
2149 struct constant_descriptor_tree
GTY(())
2151 /* A MEM for the constant. */
2154 /* The value of the constant. */
2158 static GTY((param_is (struct constant_descriptor_tree
)))
2159 htab_t const_desc_htab
;
2161 static struct constant_descriptor_tree
* build_constant_desc
PARAMS ((tree
));
2162 static void maybe_output_constant_def_contents
2163 PARAMS ((struct constant_descriptor_tree
*, int));
2165 /* Compute a hash code for a constant expression. */
2168 const_desc_hash (ptr
)
2171 return const_hash_1 (((struct constant_descriptor_tree
*)ptr
)->value
);
2181 enum tree_code code
= TREE_CODE (exp
);
2183 /* Either set P and LEN to the address and len of something to hash and
2184 exit the switch or return a value. */
2189 p
= (char *) &TREE_INT_CST (exp
);
2190 len
= sizeof TREE_INT_CST (exp
);
2194 return real_hash (TREE_REAL_CST_PTR (exp
));
2197 p
= TREE_STRING_POINTER (exp
);
2198 len
= TREE_STRING_LENGTH (exp
);
2201 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2202 + const_hash_1 (TREE_IMAGPART (exp
)));
2205 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2209 len
= int_size_in_bytes (TREE_TYPE (exp
));
2210 tmp
= (char *) alloca (len
);
2211 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2219 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2221 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2222 if (TREE_VALUE (link
))
2223 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2231 struct addr_const value
;
2233 decode_addr_const (exp
, &value
);
2234 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2236 /* Don't hash the address of the SYMBOL_REF;
2237 only use the offset and the symbol name. */
2239 p
= XSTR (value
.base
, 0);
2240 for (i
= 0; p
[i
] != 0; i
++)
2241 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2243 else if (GET_CODE (value
.base
) == LABEL_REF
)
2244 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2252 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2253 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2257 case NON_LVALUE_EXPR
:
2258 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2261 /* A language specific constant. Just hash the code. */
2265 /* Compute hashing function */
2267 for (i
= 0; i
< len
; i
++)
2268 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2273 /* Wrapper of compare_constant, for the htab interface. */
2275 const_desc_eq (p1
, p2
)
2279 return compare_constant (((struct constant_descriptor_tree
*)p1
)->value
,
2280 ((struct constant_descriptor_tree
*)p2
)->value
);
2283 /* Compare t1 and t2, and return 1 only if they are known to result in
2284 the same bit pattern on output. */
2287 compare_constant (t1
, t2
)
2291 enum tree_code typecode
;
2293 if (t1
== NULL_TREE
)
2294 return t2
== NULL_TREE
;
2295 if (t2
== NULL_TREE
)
2298 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2301 switch (TREE_CODE (t1
))
2304 /* Integer constants are the same only if the same width of type. */
2305 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2307 return tree_int_cst_equal (t1
, t2
);
2310 /* Real constants are the same only if the same width of type. */
2311 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2314 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2317 if (flag_writable_strings
)
2320 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2323 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2324 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2325 TREE_STRING_LENGTH (t1
)));
2328 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2329 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2332 typecode
= TREE_CODE (TREE_TYPE (t1
));
2333 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2336 if (typecode
== SET_TYPE
)
2338 int len
= int_size_in_bytes (TREE_TYPE (t2
));
2339 unsigned char *tmp1
, *tmp2
;
2341 if (int_size_in_bytes (TREE_TYPE (t1
)) != len
)
2344 tmp1
= (unsigned char *) alloca (len
);
2345 tmp2
= (unsigned char *) alloca (len
);
2347 if (get_set_constructor_bytes (t1
, tmp1
, len
) != NULL_TREE
)
2349 if (get_set_constructor_bytes (t2
, tmp2
, len
) != NULL_TREE
)
2352 return memcmp (tmp1
, tmp2
, len
) != 0;
2358 if (typecode
== ARRAY_TYPE
)
2360 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2361 /* For arrays, check that the sizes all match. */
2362 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2364 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2369 /* For record and union constructors, require exact type
2371 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2375 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2377 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2379 /* Check that each value is the same... */
2380 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2382 /* ... and that they apply to the same fields! */
2383 if (typecode
== ARRAY_TYPE
)
2385 if (! compare_constant (TREE_PURPOSE (l1
),
2391 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2396 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2402 struct addr_const value1
, value2
;
2404 decode_addr_const (t1
, &value1
);
2405 decode_addr_const (t2
, &value2
);
2406 return (value1
.offset
== value2
.offset
2407 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2413 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2414 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2418 case NON_LVALUE_EXPR
:
2419 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2424 nt1
= (*lang_hooks
.expand_constant
) (t1
);
2425 nt2
= (*lang_hooks
.expand_constant
) (t2
);
2426 if (nt1
!= t1
|| nt2
!= t2
)
2427 return compare_constant (nt1
, nt2
);
2433 /* Should not get here. */
2437 /* Make a copy of the whole tree structure for a constant. This
2438 handles the same types of nodes that compare_constant handles. */
2444 switch (TREE_CODE (exp
))
2447 /* For ADDR_EXPR, we do not want to copy the decl whose address
2448 is requested. We do want to copy constants though. */
2449 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2450 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2451 copy_constant (TREE_OPERAND (exp
, 0)));
2453 return copy_node (exp
);
2458 return copy_node (exp
);
2461 return build_complex (TREE_TYPE (exp
),
2462 copy_constant (TREE_REALPART (exp
)),
2463 copy_constant (TREE_IMAGPART (exp
)));
2467 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2468 copy_constant (TREE_OPERAND (exp
, 0)),
2469 copy_constant (TREE_OPERAND (exp
, 1)));
2473 case NON_LVALUE_EXPR
:
2474 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2475 copy_constant (TREE_OPERAND (exp
, 0)));
2479 tree copy
= copy_node (exp
);
2480 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2483 CONSTRUCTOR_ELTS (copy
) = list
;
2484 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2485 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2486 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2487 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2488 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2496 t
= (*lang_hooks
.expand_constant
) (exp
);
2498 return copy_constant (t
);
2505 /* Subroutine of output_constant_def:
2506 No constant equal to EXP is known to have been output.
2507 Make a constant descriptor to enter EXP in the hash table.
2508 Assign the label number and construct RTL to refer to the
2509 constant's location in memory.
2510 Caller is responsible for updating the hash table. */
2512 static struct constant_descriptor_tree
*
2513 build_constant_desc (exp
)
2520 struct constant_descriptor_tree
*desc
;
2522 desc
= ggc_alloc (sizeof (*desc
));
2523 desc
->value
= copy_constant (exp
);
2525 /* Create a string containing the label name, in LABEL. */
2526 labelno
= const_labelno
++;
2527 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2529 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2530 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2531 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2532 SYMBOL_REF_DECL (symbol
) = exp
;
2534 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2535 set_mem_attributes (rtl
, exp
, 1);
2536 set_mem_alias_set (rtl
, 0);
2537 set_mem_alias_set (rtl
, const_alias_set
);
2539 /* Set flags or add text to the name to record information, such as
2540 that it is a local symbol. If the name is changed, the macro
2541 ASM_OUTPUT_LABELREF will have to know how to strip this
2542 information. This call might invalidate our local variable
2543 SYMBOL; we can't use it afterward. */
2545 (*targetm
.encode_section_info
) (exp
, rtl
, true);
2547 /* Descriptors start out deferred; this simplifies the logic in
2548 maybe_output_constant_def_contents. However, we do not bump
2549 n_deferred_constants here, because we don't know if we're inside
2550 a function and have an n_deferred_constants to bump. */
2551 DEFERRED_CONSTANT_P (XEXP (rtl
, 0)) = 1;
2558 /* Return an rtx representing a reference to constant data in memory
2559 for the constant expression EXP.
2561 If assembler code for such a constant has already been output,
2562 return an rtx to refer to it.
2563 Otherwise, output such a constant in memory
2564 and generate an rtx for it.
2566 If DEFER is nonzero, this constant can be deferred and output only
2567 if referenced in the function after all optimizations.
2569 The const_hash_table records which constants already have label strings. */
2572 output_constant_def (exp
, defer
)
2576 struct constant_descriptor_tree
*desc
;
2577 struct constant_descriptor_tree key
;
2580 /* Look up EXP in the table of constant descriptors. If we didn't find
2581 it, create a new one. */
2583 loc
= htab_find_slot (const_desc_htab
, &key
, INSERT
);
2588 desc
= build_constant_desc (exp
);
2592 maybe_output_constant_def_contents (desc
, defer
);
2596 /* Subroutine of output_constant_def: Decide whether or not we need to
2597 output the constant DESC now, and if so, do it. */
2599 maybe_output_constant_def_contents (desc
, defer
)
2600 struct constant_descriptor_tree
*desc
;
2603 rtx symbol
= XEXP (desc
->rtl
, 0);
2605 if (flag_syntax_only
)
2608 if (!DEFERRED_CONSTANT_P (symbol
))
2609 /* Already output; don't do it again. */
2612 /* The only constants that cannot safely be deferred, assuming the
2613 context allows it, are strings under flag_writable_strings. */
2614 if (defer
&& (TREE_CODE (desc
->value
) != STRING_CST
2615 || !flag_writable_strings
))
2618 n_deferred_constants
++;
2622 output_constant_def_contents (symbol
);
2625 /* We must output the constant data referred to by SYMBOL; do so. */
2628 output_constant_def_contents (symbol
)
2631 tree exp
= SYMBOL_REF_DECL (symbol
);
2632 const char *label
= XSTR (symbol
, 0);
2634 /* Make sure any other constants whose addresses appear in EXP
2635 are assigned label numbers. */
2636 int reloc
= output_addressed_constants (exp
);
2638 /* Align the location counter as required by EXP's data type. */
2639 int align
= TYPE_ALIGN (TREE_TYPE (exp
));
2640 #ifdef CONSTANT_ALIGNMENT
2641 align
= CONSTANT_ALIGNMENT (exp
, align
);
2644 /* We are no longer deferring this constant. */
2645 DEFERRED_CONSTANT_P (symbol
) = 0;
2647 if (IN_NAMED_SECTION (exp
))
2648 named_section (exp
, NULL
, reloc
);
2650 (*targetm
.asm_out
.select_section
) (exp
, reloc
, align
);
2652 if (align
> BITS_PER_UNIT
)
2654 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2657 /* Output the label itself. */
2658 ASM_OUTPUT_LABEL (asm_out_file
, label
);
2660 /* Output the value of EXP. */
2661 output_constant (exp
,
2662 (TREE_CODE (exp
) == STRING_CST
2663 ? MAX (TREE_STRING_LENGTH (exp
),
2664 int_size_in_bytes (TREE_TYPE (exp
)))
2665 : int_size_in_bytes (TREE_TYPE (exp
))),
2670 /* Used in the hash tables to avoid outputting the same constant
2671 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2672 are output once per function, not once per file; there seems
2673 to be no reason for the difference. */
2675 struct constant_descriptor_rtx
GTY(())
2677 /* More constant_descriptors with the same hash code. */
2678 struct constant_descriptor_rtx
*next
;
2680 /* A MEM for the constant. */
2683 /* The value of the constant. */
2684 struct rtx_const value
;
2687 /* Structure to represent sufficient information about a constant so that
2688 it can be output when the constant pool is output, so that function
2689 integration can be done, and to simplify handling on machines that reference
2690 constant pool as base+displacement. */
2692 struct pool_constant
GTY(())
2694 struct constant_descriptor_rtx
*desc
;
2695 struct pool_constant
*next
;
2696 struct pool_constant
*next_sym
;
2698 enum machine_mode mode
;
2701 HOST_WIDE_INT offset
;
2705 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2706 The argument is XSTR (... , 0) */
2708 #define SYMHASH(LABEL) (((unsigned long) (LABEL)) % MAX_RTX_HASH_TABLE)
2710 /* Initialize constant pool hashing for a new function. */
2713 init_varasm_status (f
)
2716 struct varasm_status
*p
;
2717 p
= (struct varasm_status
*) ggc_alloc (sizeof (struct varasm_status
));
2719 p
->x_const_rtx_hash_table
2720 = ((struct constant_descriptor_rtx
**)
2721 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2722 * sizeof (struct constant_descriptor_rtx
*)));
2723 p
->x_const_rtx_sym_hash_table
2724 = ((struct pool_constant
**)
2725 ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2726 * sizeof (struct pool_constant
*)));
2728 p
->x_first_pool
= p
->x_last_pool
= 0;
2729 p
->x_pool_offset
= 0;
2730 p
->deferred_constants
= 0;
2734 /* Express an rtx for a constant integer (perhaps symbolic)
2735 as the sum of a symbol or label plus an explicit integer.
2736 They are stored into VALUE. */
2739 decode_rtx_const (mode
, x
, value
)
2740 enum machine_mode mode
;
2742 struct rtx_const
*value
;
2744 /* Clear the whole structure, including any gaps. */
2745 memset (value
, 0, sizeof (struct rtx_const
));
2747 value
->kind
= RTX_INT
; /* Most usual kind. */
2750 switch (GET_CODE (x
))
2753 value
->kind
= RTX_DOUBLE
;
2754 if (GET_MODE (x
) != VOIDmode
)
2756 const REAL_VALUE_TYPE
*r
= CONST_DOUBLE_REAL_VALUE (x
);
2758 value
->mode
= GET_MODE (x
);
2760 /* Copy the REAL_VALUE_TYPE by members so that we don't
2761 copy garbage from the original structure into our
2762 carefully cleaned hashing structure. */
2763 value
->un
.du
.class = r
->class;
2764 value
->un
.du
.sign
= r
->sign
;
2771 value
->un
.du
.exp
= r
->exp
;
2774 memcpy (value
->un
.du
.sig
, r
->sig
, sizeof (r
->sig
));
2782 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
2783 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
2791 units
= CONST_VECTOR_NUNITS (x
);
2792 value
->kind
= RTX_VECTOR
;
2795 if (GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
)
2797 for (i
= 0; i
< units
; ++i
)
2799 rtx elt
= CONST_VECTOR_ELT (x
, i
);
2800 if (GET_CODE (elt
) == CONST_INT
)
2802 value
->un
.int_vec
[i
].low
= INTVAL (elt
);
2803 value
->un
.int_vec
[i
].high
= 0;
2807 value
->un
.int_vec
[i
].low
= CONST_DOUBLE_LOW (elt
);
2808 value
->un
.int_vec
[i
].high
= CONST_DOUBLE_HIGH (elt
);
2812 else if (GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
2814 for (i
= 0; i
< units
; ++i
)
2816 const REAL_VALUE_TYPE
*r
2817 = CONST_DOUBLE_REAL_VALUE (CONST_VECTOR_ELT (x
, i
));
2818 REAL_VALUE_TYPE
*d
= &value
->un
.fp_vec
[i
];
2820 /* Copy the REAL_VALUE_TYPE by members so that we don't
2821 copy garbage from the original structure into our
2822 carefully cleaned hashing structure. */
2823 d
->class = r
->class;
2834 memcpy (d
->sig
, r
->sig
, sizeof (r
->sig
));
2847 value
->un
.addr
.offset
= INTVAL (x
);
2853 value
->un
.addr
.base
= x
;
2858 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
2860 value
->un
.addr
.base
= XEXP (x
, 0);
2861 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
2863 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
2865 value
->un
.addr
.base
= XEXP (x
, 0);
2866 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
2870 value
->un
.addr
.base
= x
;
2871 value
->un
.addr
.offset
= 0;
2876 value
->kind
= RTX_UNKNOWN
;
2880 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0
2881 && GET_CODE (value
->un
.addr
.base
) == UNSPEC
)
2883 /* For a simple UNSPEC, the base is set to the
2884 operand, the kind field is set to the index of
2885 the unspec expression.
2886 Together with the code below, in case that
2887 the operand is a SYMBOL_REF or LABEL_REF,
2888 the address of the string or the code_label
2889 is taken as base. */
2890 if (XVECLEN (value
->un
.addr
.base
, 0) == 1)
2892 value
->kind
= RTX_UNSPEC
+ XINT (value
->un
.addr
.base
, 1);
2893 value
->un
.addr
.base
= XVECEXP (value
->un
.addr
.base
, 0, 0);
2897 if (value
->kind
>= RTX_INT
&& value
->un
.addr
.base
!= 0)
2898 switch (GET_CODE (value
->un
.addr
.base
))
2901 /* Use the string's address, not the SYMBOL_REF's address,
2902 for the sake of addresses of library routines. */
2903 value
->un
.addr
.symbol
= XSTR (value
->un
.addr
.base
, 0);
2904 value
->un
.addr
.base
= NULL_RTX
;
2908 /* For a LABEL_REF, compare labels. */
2909 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
2916 /* Given a MINUS expression, simplify it if both sides
2917 include the same symbol. */
2920 simplify_subtraction (x
)
2923 struct rtx_const val0
, val1
;
2925 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
2926 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
2928 if (val0
.kind
>= RTX_INT
2929 && val0
.kind
== val1
.kind
2930 && val0
.un
.addr
.base
== val1
.un
.addr
.base
2931 && val0
.un
.addr
.symbol
== val1
.un
.addr
.symbol
)
2932 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
2937 /* Compute a hash code for a constant RTL expression. */
2940 const_hash_rtx (mode
, x
)
2941 enum machine_mode mode
;
2945 struct rtx_const value
;
2946 unsigned int data
[sizeof(struct rtx_const
) / sizeof (unsigned int)];
2952 decode_rtx_const (mode
, x
, &u
.value
);
2954 /* Compute hashing function */
2956 for (i
= 0; i
< ARRAY_SIZE (u
.data
); i
++)
2957 hi
= hi
* 613 + u
.data
[i
];
2959 return hi
% MAX_RTX_HASH_TABLE
;
2962 /* Compare a constant rtl object X with a constant-descriptor DESC.
2963 Return 1 if DESC describes a constant with the same value as X. */
2966 compare_constant_rtx (mode
, x
, desc
)
2967 enum machine_mode mode
;
2969 struct constant_descriptor_rtx
*desc
;
2971 struct rtx_const value
;
2973 decode_rtx_const (mode
, x
, &value
);
2975 /* Compare constant contents. */
2976 return memcmp (&value
, &desc
->value
, sizeof (struct rtx_const
)) == 0;
2979 /* Construct a constant descriptor for the rtl-expression X.
2980 It is up to the caller to enter the descriptor in the hash table. */
2982 static struct constant_descriptor_rtx
*
2983 record_constant_rtx (mode
, x
)
2984 enum machine_mode mode
;
2987 struct constant_descriptor_rtx
*ptr
;
2989 ptr
= (struct constant_descriptor_rtx
*) ggc_alloc (sizeof (*ptr
));
2990 decode_rtx_const (mode
, x
, &ptr
->value
);
2995 /* Given a constant rtx X, return a MEM for the location in memory at which
2996 this constant has been placed. Return 0 if it not has been placed yet. */
2999 mem_for_const_double (x
)
3002 enum machine_mode mode
= GET_MODE (x
);
3003 struct constant_descriptor_rtx
*desc
;
3005 for (desc
= const_rtx_hash_table
[const_hash_rtx (mode
, x
)]; desc
;
3007 if (compare_constant_rtx (mode
, x
, desc
))
3013 /* Given a constant rtx X, make (or find) a memory constant for its value
3014 and return a MEM rtx to refer to it in memory. */
3017 force_const_mem (mode
, x
)
3018 enum machine_mode mode
;
3022 struct constant_descriptor_rtx
*desc
;
3025 struct pool_constant
*pool
;
3028 /* If we're not allowed to drop X into the constant pool, don't. */
3029 if ((*targetm
.cannot_force_const_mem
) (x
))
3032 /* Compute hash code of X. Search the descriptors for that hash code
3033 to see if any of them describes X. If yes, we have an rtx to use. */
3034 hash
= const_hash_rtx (mode
, x
);
3035 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3036 if (compare_constant_rtx (mode
, x
, desc
))
3039 /* No constant equal to X is known to have been output.
3040 Make a constant descriptor to enter X in the hash table
3041 and make a MEM for it. */
3042 desc
= record_constant_rtx (mode
, x
);
3043 desc
->next
= const_rtx_hash_table
[hash
];
3044 const_rtx_hash_table
[hash
] = desc
;
3046 /* Align the location counter as required by EXP's data type. */
3047 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
3048 #ifdef CONSTANT_ALIGNMENT
3049 align
= CONSTANT_ALIGNMENT (make_tree ((*lang_hooks
.types
.type_for_mode
)
3050 (mode
, 0), x
), align
);
3053 pool_offset
+= (align
/ BITS_PER_UNIT
) - 1;
3054 pool_offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
3056 if (GET_CODE (x
) == LABEL_REF
)
3057 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
3059 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3060 pool
= (struct pool_constant
*) ggc_alloc (sizeof (struct pool_constant
));
3064 pool
->labelno
= const_labelno
;
3065 pool
->align
= align
;
3066 pool
->offset
= pool_offset
;
3073 last_pool
->next
= pool
;
3076 pool_offset
+= GET_MODE_SIZE (mode
);
3078 /* Create a string containing the label name, in LABEL. */
3079 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3083 /* Construct the SYMBOL_REF and the MEM. */
3085 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
3086 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
3088 pool
->desc
->rtl
= def
= gen_rtx_MEM (mode
, symbol
);
3089 set_mem_attributes (def
, (*lang_hooks
.types
.type_for_mode
) (mode
, 0), 1);
3090 RTX_UNCHANGING_P (def
) = 1;
3092 /* Add label to symbol hash table. */
3093 hash
= SYMHASH (XSTR (symbol
, 0));
3094 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3095 const_rtx_sym_hash_table
[hash
] = pool
;
3097 /* Mark the symbol_ref as belonging to this constants pool. */
3098 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
3099 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
3100 current_function_uses_const_pool
= 1;
3105 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3106 the corresponding pool_constant structure. */
3108 static struct pool_constant
*
3109 find_pool_constant (f
, addr
)
3113 struct pool_constant
*pool
;
3114 const char *label
= XSTR (addr
, 0);
3116 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3117 pool
= pool
->next_sym
)
3118 if (XSTR (XEXP (pool
->desc
->rtl
, 0), 0) == label
)
3124 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3127 get_pool_constant (addr
)
3130 return (find_pool_constant (cfun
, addr
))->constant
;
3133 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3134 and whether it has been output or not. */
3137 get_pool_constant_mark (addr
, pmarked
)
3141 struct pool_constant
*pool
= find_pool_constant (cfun
, addr
);
3142 *pmarked
= (pool
->mark
!= 0);
3143 return pool
->constant
;
3146 /* Likewise, but for the constant pool of a specific function. */
3149 get_pool_constant_for_function (f
, addr
)
3153 return (find_pool_constant (f
, addr
))->constant
;
3156 /* Similar, return the mode. */
3159 get_pool_mode (addr
)
3162 return (find_pool_constant (cfun
, addr
))->mode
;
3166 get_pool_mode_for_function (f
, addr
)
3170 return (find_pool_constant (f
, addr
))->mode
;
3173 /* Similar, return the offset in the constant pool. */
3176 get_pool_offset (addr
)
3179 return (find_pool_constant (cfun
, addr
))->offset
;
3182 /* Return the size of the constant pool. */
3190 /* Write all the constants in the constant pool. */
3193 output_constant_pool (fnname
, fndecl
)
3194 const char *fnname ATTRIBUTE_UNUSED
;
3195 tree fndecl ATTRIBUTE_UNUSED
;
3197 struct pool_constant
*pool
;
3201 /* It is possible for gcc to call force_const_mem and then to later
3202 discard the instructions which refer to the constant. In such a
3203 case we do not need to output the constant. */
3204 mark_constant_pool ();
3206 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3207 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3210 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3219 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3220 whose CODE_LABEL has been deleted. This can occur if a jump table
3221 is eliminated by optimization. If so, write a constant of zero
3222 instead. Note that this can also happen by turning the
3223 CODE_LABEL into a NOTE. */
3224 /* ??? This seems completely and utterly wrong. Certainly it's
3225 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3226 functioning even with INSN_DELETED_P and friends. */
3229 switch (GET_CODE (x
))
3232 if (GET_CODE (XEXP (x
, 0)) != PLUS
3233 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3235 tmp
= XEXP (XEXP (x
, 0), 0);
3240 if (INSN_DELETED_P (tmp
)
3241 || (GET_CODE (tmp
) == NOTE
3242 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3253 /* First switch to correct section. */
3254 (*targetm
.asm_out
.select_rtx_section
) (pool
->mode
, x
, pool
->align
);
3256 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3257 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3258 pool
->align
, pool
->labelno
, done
);
3261 assemble_align (pool
->align
);
3263 /* Output the label. */
3264 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LC", pool
->labelno
);
3266 /* Output the value of the constant itself. */
3267 switch (GET_MODE_CLASS (pool
->mode
))
3270 if (GET_CODE (x
) != CONST_DOUBLE
)
3273 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3274 assemble_real (r
, pool
->mode
, pool
->align
);
3278 case MODE_PARTIAL_INT
:
3279 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), pool
->align
, 1);
3282 case MODE_VECTOR_FLOAT
:
3287 if (GET_CODE (x
) != CONST_VECTOR
)
3290 units
= CONST_VECTOR_NUNITS (x
);
3292 for (i
= 0; i
< units
; i
++)
3294 elt
= CONST_VECTOR_ELT (x
, i
);
3295 REAL_VALUE_FROM_CONST_DOUBLE (r
, elt
);
3296 assemble_real (r
, GET_MODE_INNER (pool
->mode
), pool
->align
);
3301 case MODE_VECTOR_INT
:
3306 if (GET_CODE (x
) != CONST_VECTOR
)
3309 units
= CONST_VECTOR_NUNITS (x
);
3311 for (i
= 0; i
< units
; i
++)
3313 elt
= CONST_VECTOR_ELT (x
, i
);
3314 assemble_integer (elt
, GET_MODE_UNIT_SIZE (pool
->mode
),
3324 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3325 sections have proper size. */
3326 if (pool
->align
> GET_MODE_BITSIZE (pool
->mode
)
3327 && in_section
== in_named
3328 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3329 assemble_align (pool
->align
);
3331 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3336 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3337 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3340 /* Done with this pool. */
3341 first_pool
= last_pool
= 0;
3344 /* Look through the instructions for this function, and mark all the
3345 entries in the constant pool which are actually being used. Emit
3346 deferred constants which have indeed been used. */
3349 mark_constant_pool ()
3353 struct pool_constant
*pool
;
3355 if (first_pool
== 0 && n_deferred_constants
== 0)
3358 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3361 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3363 mark_constants (PATTERN (insn
));
3365 for (link
= current_function_epilogue_delay_list
;
3367 link
= XEXP (link
, 1))
3369 insn
= XEXP (link
, 0);
3372 mark_constants (PATTERN (insn
));
3376 /* Look through appropriate parts of X, marking all entries in the
3377 constant pool which are actually being used. Entries that are only
3378 referenced by other constants are also marked as used. Emit
3379 deferred strings that are used. */
3386 const char *format_ptr
;
3391 if (GET_CODE (x
) == SYMBOL_REF
)
3393 mark_constant (&x
, NULL
);
3397 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3398 insns, not any notes that may be attached. We don't want to mark
3399 a constant just because it happens to appear in a REG_EQUIV note. */
3402 mark_constants (PATTERN (x
));
3406 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3408 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3410 switch (*format_ptr
++)
3413 mark_constants (XEXP (x
, i
));
3417 if (XVEC (x
, i
) != 0)
3421 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3422 mark_constants (XVECEXP (x
, i
, j
));
3442 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3443 to as used. Emit referenced deferred strings. This function can
3444 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3447 mark_constant (current_rtx
, data
)
3449 void *data ATTRIBUTE_UNUSED
;
3451 rtx x
= *current_rtx
;
3456 else if (GET_CODE (x
) == SYMBOL_REF
)
3458 if (CONSTANT_POOL_ADDRESS_P (x
))
3460 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3461 if (pool
->mark
== 0)
3464 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3469 else if (DEFERRED_CONSTANT_P (x
))
3471 n_deferred_constants
--;
3472 output_constant_def_contents (x
);
3478 /* Find all the constants whose addresses are referenced inside of EXP,
3479 and make sure assembler code with a label has been output for each one.
3480 Indicate whether an ADDR_EXPR has been encountered. */
3483 output_addressed_constants (exp
)
3486 int reloc
= 0, reloc2
;
3489 /* Give the front-end a chance to convert VALUE to something that
3490 looks more like a constant to the back-end. */
3491 exp
= (*lang_hooks
.expand_constant
) (exp
);
3493 switch (TREE_CODE (exp
))
3497 /* Go inside any operations that get_inner_reference can handle and see
3498 if what's inside is a constant: no need to do anything here for
3499 addresses of variables or functions. */
3500 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3501 tem
= TREE_OPERAND (tem
, 0))
3504 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
3505 || TREE_CODE (tem
) == CONSTRUCTOR
)
3506 output_constant_def (tem
, 0);
3508 if (TREE_PUBLIC (tem
))
3515 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3516 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3520 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3521 reloc2
= output_addressed_constants (TREE_OPERAND (exp
, 1));
3522 /* The difference of two local labels is computable at link time. */
3523 if (reloc
== 1 && reloc2
== 1)
3531 case NON_LVALUE_EXPR
:
3532 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3536 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3537 if (TREE_VALUE (tem
) != 0)
3538 reloc
|= output_addressed_constants (TREE_VALUE (tem
));
3548 /* Return nonzero if VALUE is a valid constant-valued expression
3549 for use in initializing a static variable; one that can be an
3550 element of a "constant" initializer.
3552 Return null_pointer_node if the value is absolute;
3553 if it is relocatable, return the variable that determines the relocation.
3554 We assume that VALUE has been folded as much as possible;
3555 therefore, we do not need to check for such things as
3556 arithmetic-combinations of integers. */
3559 initializer_constant_valid_p (value
, endtype
)
3563 /* Give the front-end a chance to convert VALUE to something that
3564 looks more like a constant to the back-end. */
3565 value
= (*lang_hooks
.expand_constant
) (value
);
3567 switch (TREE_CODE (value
))
3570 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3571 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3572 && TREE_CONSTANT (value
)
3573 && CONSTRUCTOR_ELTS (value
))
3575 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
3578 return TREE_STATIC (value
) ? null_pointer_node
: 0;
3585 return null_pointer_node
;
3589 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
3591 case VIEW_CONVERT_EXPR
:
3592 case NON_LVALUE_EXPR
:
3593 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3597 /* Allow conversions between pointer types. */
3598 if (POINTER_TYPE_P (TREE_TYPE (value
))
3599 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3600 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3602 /* Allow conversions between real types. */
3603 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3604 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3605 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3607 /* Allow length-preserving conversions between integer types. */
3608 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3609 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3610 && (TYPE_PRECISION (TREE_TYPE (value
))
3611 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3612 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3614 /* Allow conversions between other integer types only if
3616 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3617 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3619 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3621 if (inner
== null_pointer_node
)
3622 return null_pointer_node
;
3626 /* Allow (int) &foo provided int is as wide as a pointer. */
3627 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3628 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3629 && (TYPE_PRECISION (TREE_TYPE (value
))
3630 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3631 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3634 /* Likewise conversions from int to pointers, but also allow
3635 conversions from 0. */
3636 if (POINTER_TYPE_P (TREE_TYPE (value
))
3637 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3639 if (integer_zerop (TREE_OPERAND (value
, 0)))
3640 return null_pointer_node
;
3641 else if (TYPE_PRECISION (TREE_TYPE (value
))
3642 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
3643 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3647 /* Allow conversions to union types if the value inside is okay. */
3648 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
3649 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3654 if (! INTEGRAL_TYPE_P (endtype
)
3655 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3657 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3659 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3661 /* If either term is absolute, use the other terms relocation. */
3662 if (valid0
== null_pointer_node
)
3664 if (valid1
== null_pointer_node
)
3670 if (! INTEGRAL_TYPE_P (endtype
)
3671 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3673 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3675 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3677 /* Win if second argument is absolute. */
3678 if (valid1
== null_pointer_node
)
3680 /* Win if both arguments have the same relocation.
3681 Then the value is absolute. */
3682 if (valid0
== valid1
&& valid0
!= 0)
3683 return null_pointer_node
;
3685 /* Since GCC guarantees that string constants are unique in the
3686 generated code, a subtraction between two copies of the same
3687 constant string is absolute. */
3688 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
3689 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
3690 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
3691 return null_pointer_node
;
3694 /* Support differences between labels. */
3695 if (INTEGRAL_TYPE_P (endtype
))
3698 op0
= TREE_OPERAND (value
, 0);
3699 op1
= TREE_OPERAND (value
, 1);
3701 /* Like STRIP_NOPS except allow the operand mode to widen.
3702 This works around a feature of fold that simplifies
3703 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3704 that the narrower operation is cheaper. */
3706 while (TREE_CODE (op0
) == NOP_EXPR
3707 || TREE_CODE (op0
) == CONVERT_EXPR
3708 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3710 tree inner
= TREE_OPERAND (op0
, 0);
3711 if (inner
== error_mark_node
3712 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3713 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3714 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3719 while (TREE_CODE (op1
) == NOP_EXPR
3720 || TREE_CODE (op1
) == CONVERT_EXPR
3721 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3723 tree inner
= TREE_OPERAND (op1
, 0);
3724 if (inner
== error_mark_node
3725 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3726 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3727 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3732 if (TREE_CODE (op0
) == ADDR_EXPR
3733 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
3734 && TREE_CODE (op1
) == ADDR_EXPR
3735 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
3736 return null_pointer_node
;
3747 /* Output assembler code for constant EXP to FILE, with no label.
3748 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3749 Assumes output_addressed_constants has been done on EXP already.
3751 Generate exactly SIZE bytes of assembler data, padding at the end
3752 with zeros if necessary. SIZE must always be specified.
3754 SIZE is important for structure constructors,
3755 since trailing members may have been omitted from the constructor.
3756 It is also important for initialization of arrays from string constants
3757 since the full length of the string constant might not be wanted.
3758 It is also needed for initialization of unions, where the initializer's
3759 type is just one member, and that may not be as long as the union.
3761 There a case in which we would fail to output exactly SIZE bytes:
3762 for a structure constructor that wants to produce more than SIZE bytes.
3763 But such constructors will never be generated for any possible input.
3765 ALIGN is the alignment of the data in bits. */
3768 output_constant (exp
, size
, align
)
3773 enum tree_code code
;
3774 HOST_WIDE_INT thissize
;
3776 /* Some front-ends use constants other than the standard language-independent
3777 varieties, but which may still be output directly. Give the front-end a
3778 chance to convert EXP to a language-independent representation. */
3779 exp
= (*lang_hooks
.expand_constant
) (exp
);
3781 if (size
== 0 || flag_syntax_only
)
3784 /* Eliminate any conversions since we'll be outputting the underlying
3786 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3787 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3788 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3789 exp
= TREE_OPERAND (exp
, 0);
3791 code
= TREE_CODE (TREE_TYPE (exp
));
3792 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3794 /* Allow a constructor with no elements for any data type.
3795 This means to fill the space with zeros. */
3796 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3798 assemble_zeros (size
);
3802 if (TREE_CODE (exp
) == FDESC_EXPR
)
3804 #ifdef ASM_OUTPUT_FDESC
3805 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3806 tree decl
= TREE_OPERAND (exp
, 0);
3807 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3814 /* Now output the underlying data. If we've handling the padding, return.
3815 Otherwise, break and ensure THISSIZE is the size written. */
3823 case REFERENCE_TYPE
:
3824 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3825 EXPAND_INITIALIZER
),
3827 error ("initializer for integer value is too complicated");
3831 if (TREE_CODE (exp
) != REAL_CST
)
3832 error ("initializer for floating value is not a floating constant");
3834 assemble_real (TREE_REAL_CST (exp
),
3835 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0),
3840 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3841 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3842 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
3847 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3849 output_constructor (exp
, size
, align
);
3852 else if (TREE_CODE (exp
) == STRING_CST
)
3854 thissize
= MIN (TREE_STRING_LENGTH (exp
), size
);
3855 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
3857 else if (TREE_CODE (exp
) == VECTOR_CST
)
3861 unsigned int nalign
;
3862 enum machine_mode inner
;
3864 inner
= GET_MODE_INNER (TYPE_MODE (TREE_TYPE (exp
)));
3865 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
3867 elt_size
= GET_MODE_UNIT_SIZE (TYPE_MODE (TREE_TYPE (exp
)));
3869 link
= TREE_VECTOR_CST_ELTS (exp
);
3870 output_constant (TREE_VALUE (link
), elt_size
, align
);
3871 while ((link
= TREE_CHAIN (link
)) != NULL
)
3872 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
3880 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3881 output_constructor (exp
, size
, align
);
3887 if (TREE_CODE (exp
) == INTEGER_CST
)
3888 assemble_integer (expand_expr (exp
, NULL_RTX
,
3889 VOIDmode
, EXPAND_INITIALIZER
),
3890 thissize
, align
, 1);
3891 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3893 unsigned char *buffer
= (unsigned char *) alloca (thissize
);
3894 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
3896 assemble_string ((char *) buffer
, thissize
);
3899 error ("unknown set constructor type");
3911 assemble_zeros (size
);
3915 /* Subroutine of output_constructor, used for computing the size of
3916 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3917 type with an unspecified upper bound. */
3919 static unsigned HOST_WIDE_INT
3920 array_size_for_constructor (val
)
3925 /* This code used to attempt to handle string constants that are not
3926 arrays of single-bytes, but nothing else does, so there's no point in
3928 if (TREE_CODE (val
) == STRING_CST
)
3929 return TREE_STRING_LENGTH (val
);
3931 max_index
= NULL_TREE
;
3932 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
3934 tree index
= TREE_PURPOSE (i
);
3936 if (TREE_CODE (index
) == RANGE_EXPR
)
3937 index
= TREE_OPERAND (index
, 1);
3938 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
3942 if (max_index
== NULL_TREE
)
3945 /* Compute the total number of array elements. */
3946 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
3948 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
3949 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
3951 /* Multiply by the array element unit size to find number of bytes. */
3952 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
3954 return tree_low_cst (i
, 1);
3957 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3958 Generate at least SIZE bytes, padding if necessary. */
3961 output_constructor (exp
, size
, align
)
3966 tree type
= TREE_TYPE (exp
);
3967 tree link
, field
= 0;
3969 /* Number of bytes output or skipped so far.
3970 In other words, current position within the constructor. */
3971 HOST_WIDE_INT total_bytes
= 0;
3972 /* Nonzero means BYTE contains part of a byte, to be output. */
3973 int byte_buffer_in_use
= 0;
3976 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3979 if (TREE_CODE (type
) == RECORD_TYPE
)
3980 field
= TYPE_FIELDS (type
);
3982 if (TREE_CODE (type
) == ARRAY_TYPE
3983 && TYPE_DOMAIN (type
) != 0)
3984 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
3986 /* As LINK goes through the elements of the constant,
3987 FIELD goes through the structure fields, if the constant is a structure.
3988 if the constant is a union, then we override this,
3989 by getting the field from the TREE_LIST element.
3990 But the constant could also be an array. Then FIELD is zero.
3992 There is always a maximum of one element in the chain LINK for unions
3993 (even if the initializer in a source program incorrectly contains
3995 for (link
= CONSTRUCTOR_ELTS (exp
);
3997 link
= TREE_CHAIN (link
),
3998 field
= field
? TREE_CHAIN (field
) : 0)
4000 tree val
= TREE_VALUE (link
);
4003 /* The element in a union constructor specifies the proper field
4005 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4006 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4007 && TREE_PURPOSE (link
) != 0)
4008 field
= TREE_PURPOSE (link
);
4010 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4011 index
= TREE_PURPOSE (link
);
4013 /* Eliminate the marker that makes a cast not be an lvalue. */
4017 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4019 unsigned HOST_WIDE_INT fieldsize
4020 = int_size_in_bytes (TREE_TYPE (type
));
4021 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
4022 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
4023 HOST_WIDE_INT index
;
4024 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
4026 for (index
= lo_index
; index
<= hi_index
; index
++)
4028 /* Output the element's initial value. */
4030 assemble_zeros (fieldsize
);
4032 output_constant (val
, fieldsize
, align2
);
4034 /* Count its size. */
4035 total_bytes
+= fieldsize
;
4038 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4040 /* An element that is not a bit-field. */
4042 unsigned HOST_WIDE_INT fieldsize
;
4043 /* Since this structure is static,
4044 we know the positions are constant. */
4045 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
4046 unsigned int align2
;
4049 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4050 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
4052 /* Output any buffered-up bit-fields preceding this element. */
4053 if (byte_buffer_in_use
)
4055 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4057 byte_buffer_in_use
= 0;
4060 /* Advance to offset of this element.
4061 Note no alignment needed in an array, since that is guaranteed
4062 if each element has the proper size. */
4063 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
4065 assemble_zeros (pos
- total_bytes
);
4069 /* Find the alignment of this element. */
4070 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
4072 /* Determine size this element should occupy. */
4077 /* If this is an array with an unspecified upper bound,
4078 the initializer determines the size. */
4079 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4080 but we cannot do this until the deprecated support for
4081 initializing zero-length array members is removed. */
4082 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4083 && TYPE_DOMAIN (TREE_TYPE (field
))
4084 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4086 fieldsize
= array_size_for_constructor (val
);
4087 /* Given a non-empty initialization, this field had
4089 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4092 else if (DECL_SIZE_UNIT (field
))
4094 /* ??? This can't be right. If the decl size overflows
4095 a host integer we will silently emit no data. */
4096 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4097 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4101 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4103 /* Output the element's initial value. */
4105 assemble_zeros (fieldsize
);
4107 output_constant (val
, fieldsize
, align2
);
4109 /* Count its size. */
4110 total_bytes
+= fieldsize
;
4112 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4113 error ("invalid initial value for member `%s'",
4114 IDENTIFIER_POINTER (DECL_NAME (field
)));
4117 /* Element that is a bit-field. */
4119 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4120 HOST_WIDE_INT end_offset
4121 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4124 val
= integer_zero_node
;
4126 /* If this field does not start in this (or, next) byte,
4128 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4130 /* Output remnant of any bit field in previous bytes. */
4131 if (byte_buffer_in_use
)
4133 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4135 byte_buffer_in_use
= 0;
4138 /* If still not at proper byte, advance to there. */
4139 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4141 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4142 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4146 if (! byte_buffer_in_use
)
4149 /* We must split the element into pieces that fall within
4150 separate bytes, and combine each byte with previous or
4151 following bit-fields. */
4153 /* next_offset is the offset n fbits from the beginning of
4154 the structure to the next bit of this element to be processed.
4155 end_offset is the offset of the first bit past the end of
4157 while (next_offset
< end_offset
)
4161 HOST_WIDE_INT value
;
4162 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4163 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4165 /* Advance from byte to byte
4166 within this element when necessary. */
4167 while (next_byte
!= total_bytes
)
4169 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4174 /* Number of bits we can process at once
4175 (all part of the same byte). */
4176 this_time
= MIN (end_offset
- next_offset
,
4177 BITS_PER_UNIT
- next_bit
);
4178 if (BYTES_BIG_ENDIAN
)
4180 /* On big-endian machine, take the most significant bits
4181 first (of the bits that are significant)
4182 and put them into bytes from the most significant end. */
4183 shift
= end_offset
- next_offset
- this_time
;
4185 /* Don't try to take a bunch of bits that cross
4186 the word boundary in the INTEGER_CST. We can
4187 only select bits from the LOW or HIGH part
4189 if (shift
< HOST_BITS_PER_WIDE_INT
4190 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4192 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4193 shift
= HOST_BITS_PER_WIDE_INT
;
4196 /* Now get the bits from the appropriate constant word. */
4197 if (shift
< HOST_BITS_PER_WIDE_INT
)
4198 value
= TREE_INT_CST_LOW (val
);
4199 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4201 value
= TREE_INT_CST_HIGH (val
);
4202 shift
-= HOST_BITS_PER_WIDE_INT
;
4207 /* Get the result. This works only when:
4208 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4209 byte
|= (((value
>> shift
)
4210 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4211 << (BITS_PER_UNIT
- this_time
- next_bit
));
4215 /* On little-endian machines,
4216 take first the least significant bits of the value
4217 and pack them starting at the least significant
4218 bits of the bytes. */
4219 shift
= next_offset
- int_bit_position (field
);
4221 /* Don't try to take a bunch of bits that cross
4222 the word boundary in the INTEGER_CST. We can
4223 only select bits from the LOW or HIGH part
4225 if (shift
< HOST_BITS_PER_WIDE_INT
4226 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4227 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4229 /* Now get the bits from the appropriate constant word. */
4230 if (shift
< HOST_BITS_PER_WIDE_INT
)
4231 value
= TREE_INT_CST_LOW (val
);
4232 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4234 value
= TREE_INT_CST_HIGH (val
);
4235 shift
-= HOST_BITS_PER_WIDE_INT
;
4240 /* Get the result. This works only when:
4241 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4242 byte
|= (((value
>> shift
)
4243 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4247 next_offset
+= this_time
;
4248 byte_buffer_in_use
= 1;
4253 if (byte_buffer_in_use
)
4255 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4259 if (total_bytes
< size
)
4260 assemble_zeros (size
- total_bytes
);
4263 /* This TREE_LIST contains any weak symbol declarations waiting
4265 static GTY(()) tree weak_decls
;
4267 /* Mark DECL as weak. */
4273 DECL_WEAK (decl
) = 1;
4275 if (DECL_RTL_SET_P (decl
)
4276 && GET_CODE (DECL_RTL (decl
)) == MEM
4277 && XEXP (DECL_RTL (decl
), 0)
4278 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4279 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4282 /* Merge weak status between NEWDECL and OLDDECL. */
4285 merge_weak (newdecl
, olddecl
)
4289 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4292 if (DECL_WEAK (newdecl
))
4296 /* NEWDECL is weak, but OLDDECL is not. */
4298 /* If we already output the OLDDECL, we're in trouble; we can't
4299 go back and make it weak. This error cannot caught in
4300 declare_weak because the NEWDECL and OLDDECL was not yet
4301 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4302 if (TREE_ASM_WRITTEN (olddecl
))
4303 error_with_decl (newdecl
,
4304 "weak declaration of `%s' must precede definition");
4306 /* If we've already generated rtl referencing OLDDECL, we may
4307 have done so in a way that will not function properly with
4309 else if (TREE_USED (olddecl
)
4310 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4311 warning_with_decl (newdecl
, "weak declaration of `%s' after first use results in unspecified behavior");
4315 /* We put the NEWDECL on the weak_decls list at some point.
4316 Replace it with the OLDDECL. */
4317 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4318 if (TREE_VALUE (wd
) == newdecl
)
4320 TREE_VALUE (wd
) = olddecl
;
4323 /* We may not find the entry on the list. If NEWDECL is a
4324 weak alias, then we will have already called
4325 globalize_decl to remove the entry; in that case, we do
4326 not need to do anything. */
4329 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4330 mark_weak (olddecl
);
4333 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4334 weak. Just update NEWDECL to indicate that it's weak too. */
4335 mark_weak (newdecl
);
4338 /* Declare DECL to be a weak symbol. */
4344 if (! TREE_PUBLIC (decl
))
4345 error_with_decl (decl
, "weak declaration of `%s' must be public");
4346 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4347 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4348 else if (SUPPORTS_WEAK
)
4350 if (! DECL_WEAK (decl
))
4351 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4354 warning_with_decl (decl
, "weak declaration of `%s' not supported");
4359 /* Emit any pending weak declarations. */
4366 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4368 tree decl
= TREE_VALUE (t
);
4369 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4370 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4373 if (! TREE_USED (decl
))
4376 #ifdef ASM_WEAKEN_DECL
4377 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4379 #ifdef ASM_WEAKEN_LABEL
4380 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4382 #ifdef ASM_OUTPUT_WEAK_ALIAS
4383 warning ("only weak aliases are supported in this configuration");
4391 /* Emit the assembly bits to indicate that DECL is globally visible. */
4394 globalize_decl (decl
)
4397 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4399 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4400 if (DECL_WEAK (decl
))
4404 #ifdef ASM_WEAKEN_DECL
4405 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4407 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4410 /* Remove this function from the pending weak list so that
4411 we do not emit multiple .weak directives for it. */
4412 for (p
= &weak_decls
; (t
= *p
) ; )
4414 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4415 *p
= TREE_CHAIN (t
);
4417 p
= &TREE_CHAIN (t
);
4423 (*targetm
.asm_out
.globalize_label
) (asm_out_file
, name
);
4426 /* Emit an assembler directive to make the symbol for DECL an alias to
4427 the symbol for TARGET. */
4430 assemble_alias (decl
, target
)
4431 tree decl
, target ATTRIBUTE_UNUSED
;
4435 /* We must force creation of DECL_RTL for debug info generation, even though
4436 we don't use it here. */
4437 make_decl_rtl (decl
, NULL
);
4439 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4441 #ifdef ASM_OUTPUT_DEF
4442 /* Make name accessible from other files, if appropriate. */
4444 if (TREE_PUBLIC (decl
))
4446 globalize_decl (decl
);
4447 maybe_assemble_visibility (decl
);
4450 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4451 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4453 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4455 #else /* !ASM_OUTPUT_DEF */
4456 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4457 if (! DECL_WEAK (decl
))
4458 warning ("only weak aliases are supported in this configuration");
4460 #ifdef ASM_WEAKEN_DECL
4461 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4463 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4466 warning ("alias definitions not supported in this configuration; ignored");
4470 TREE_USED (decl
) = 1;
4471 TREE_ASM_WRITTEN (decl
) = 1;
4472 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4475 /* Emit an assembler directive to set symbol for DECL visibility to
4476 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4479 default_assemble_visibility (decl
, vis
)
4483 static const char * const visibility_types
[] = {
4484 NULL
, "internal", "hidden", "protected"
4487 const char *name
, *type
;
4489 name
= (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4490 type
= visibility_types
[vis
];
4492 #ifdef HAVE_GAS_HIDDEN
4493 fprintf (asm_out_file
, "\t.%s\t", type
);
4494 assemble_name (asm_out_file
, name
);
4495 fprintf (asm_out_file
, "\n");
4497 warning ("visibility attribute not supported in this configuration; ignored");
4501 /* A helper function to call assemble_visibility when needed for a decl. */
4504 maybe_assemble_visibility (decl
)
4507 enum symbol_visibility vis
= decl_visibility (decl
);
4509 if (vis
!= VISIBILITY_DEFAULT
)
4510 (* targetm
.asm_out
.visibility
) (decl
, vis
);
4513 /* Returns 1 if the target configuration supports defining public symbols
4514 so that one of them will be chosen at link time instead of generating a
4515 multiply-defined symbol error, whether through the use of weak symbols or
4516 a target-specific mechanism for having duplicates discarded. */
4519 supports_one_only ()
4521 if (SUPPORTS_ONE_ONLY
)
4523 return SUPPORTS_WEAK
;
4526 /* Set up DECL as a public symbol that can be defined in multiple
4527 translation units without generating a linker error. */
4530 make_decl_one_only (decl
)
4533 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4536 TREE_PUBLIC (decl
) = 1;
4538 if (TREE_CODE (decl
) == VAR_DECL
4539 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4540 DECL_COMMON (decl
) = 1;
4541 else if (SUPPORTS_ONE_ONLY
)
4543 #ifdef MAKE_DECL_ONE_ONLY
4544 MAKE_DECL_ONE_ONLY (decl
);
4546 DECL_ONE_ONLY (decl
) = 1;
4548 else if (SUPPORTS_WEAK
)
4549 DECL_WEAK (decl
) = 1;
4557 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4558 in_named_entry_eq
, NULL
);
4559 const_desc_htab
= htab_create_ggc (1009, const_desc_hash
,
4560 const_desc_eq
, NULL
);
4562 const_alias_set
= new_alias_set ();
4566 decl_tls_model (decl
)
4569 enum tls_model kind
;
4570 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4575 attr
= TREE_VALUE (TREE_VALUE (attr
));
4576 if (TREE_CODE (attr
) != STRING_CST
)
4578 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4579 kind
= TLS_MODEL_LOCAL_EXEC
;
4580 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4581 kind
= TLS_MODEL_INITIAL_EXEC
;
4582 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4583 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4584 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4585 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4591 is_local
= (*targetm
.binds_local_p
) (decl
);
4595 kind
= TLS_MODEL_LOCAL_EXEC
;
4597 kind
= TLS_MODEL_INITIAL_EXEC
;
4599 /* Local dynamic is inefficient when we're not combining the
4600 parts of the address. */
4601 else if (optimize
&& is_local
)
4602 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4604 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4605 if (kind
< flag_tls_default
)
4606 kind
= flag_tls_default
;
4611 enum symbol_visibility
4612 decl_visibility (decl
)
4615 tree attr
= lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
));
4619 const char *which
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
4621 if (strcmp (which
, "default") == 0)
4622 return VISIBILITY_DEFAULT
;
4623 if (strcmp (which
, "internal") == 0)
4624 return VISIBILITY_INTERNAL
;
4625 if (strcmp (which
, "hidden") == 0)
4626 return VISIBILITY_HIDDEN
;
4627 if (strcmp (which
, "protected") == 0)
4628 return VISIBILITY_PROTECTED
;
4633 return VISIBILITY_DEFAULT
;
4636 /* Select a set of attributes for section NAME based on the properties
4637 of DECL and whether or not RELOC indicates that DECL's initializer
4638 might contain runtime relocations.
4640 We make the section read-only and executable for a function decl,
4641 read-only for a const data decl, and writable for a non-const data decl. */
4644 default_section_type_flags (decl
, name
, reloc
)
4649 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4653 default_section_type_flags_1 (decl
, name
, reloc
, shlib
)
4661 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4662 flags
= SECTION_CODE
;
4663 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4666 flags
= SECTION_WRITE
;
4668 if (decl
&& DECL_ONE_ONLY (decl
))
4669 flags
|= SECTION_LINKONCE
;
4671 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4672 flags
|= SECTION_TLS
| SECTION_WRITE
;
4674 if (strcmp (name
, ".bss") == 0
4675 || strncmp (name
, ".bss.", 5) == 0
4676 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4677 || strcmp (name
, ".sbss") == 0
4678 || strncmp (name
, ".sbss.", 6) == 0
4679 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0
4680 || strcmp (name
, ".tbss") == 0
4681 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4682 flags
|= SECTION_BSS
;
4684 if (strcmp (name
, ".tdata") == 0
4685 || strcmp (name
, ".tbss") == 0
4686 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0
4687 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4688 flags
|= SECTION_TLS
;
4690 /* These three sections have special ELF types. They are neither
4691 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4692 want to print a section type (@progbits or @nobits). If someone
4693 is silly enough to emit code or TLS variables to one of these
4694 sections, then don't handle them specially. */
4695 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4696 && (strcmp (name
, ".init_array") == 0
4697 || strcmp (name
, ".fini_array") == 0
4698 || strcmp (name
, ".preinit_array") == 0))
4699 flags
|= SECTION_NOTYPE
;
4704 /* Output assembly to switch to section NAME with attribute FLAGS.
4705 Four variants for common object file formats. */
4708 default_no_named_section (name
, flags
)
4709 const char *name ATTRIBUTE_UNUSED
;
4710 unsigned int flags ATTRIBUTE_UNUSED
;
4712 /* Some object formats don't support named sections at all. The
4713 front-end should already have flagged this as an error. */
4718 default_elf_asm_named_section (name
, flags
)
4722 char flagchars
[10], *f
= flagchars
;
4724 if (! named_section_first_declaration (name
))
4726 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4730 if (!(flags
& SECTION_DEBUG
))
4732 if (flags
& SECTION_WRITE
)
4734 if (flags
& SECTION_CODE
)
4736 if (flags
& SECTION_SMALL
)
4738 if (flags
& SECTION_MERGE
)
4740 if (flags
& SECTION_STRINGS
)
4742 if (flags
& SECTION_TLS
)
4746 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4748 if (!(flags
& SECTION_NOTYPE
))
4752 if (flags
& SECTION_BSS
)
4757 fprintf (asm_out_file
, ",@%s", type
);
4759 if (flags
& SECTION_ENTSIZE
)
4760 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4763 putc ('\n', asm_out_file
);
4767 default_coff_asm_named_section (name
, flags
)
4771 char flagchars
[8], *f
= flagchars
;
4773 if (flags
& SECTION_WRITE
)
4775 if (flags
& SECTION_CODE
)
4779 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4783 default_pe_asm_named_section (name
, flags
)
4787 default_coff_asm_named_section (name
, flags
);
4789 if (flags
& SECTION_LINKONCE
)
4791 /* Functions may have been compiled at various levels of
4792 optimization so we can't use `same_size' here.
4793 Instead, have the linker pick one. */
4794 fprintf (asm_out_file
, "\t.linkonce %s\n",
4795 (flags
& SECTION_CODE
? "discard" : "same_size"));
4799 /* Used for vtable gc in GNU binutils. Record that the pointer at OFFSET
4800 from SYMBOL is used in all classes derived from SYMBOL. */
4803 assemble_vtable_entry (symbol
, offset
)
4805 HOST_WIDE_INT offset
;
4807 fputs ("\t.vtable_entry ", asm_out_file
);
4808 output_addr_const (asm_out_file
, symbol
);
4809 fputs (", ", asm_out_file
);
4810 fprintf (asm_out_file
, HOST_WIDE_INT_PRINT_DEC
, offset
);
4811 fputc ('\n', asm_out_file
);
4814 /* Used for vtable gc in GNU binutils. Record the class hierarchy by noting
4815 that the vtable symbol CHILD is derived from the vtable symbol PARENT. */
4818 assemble_vtable_inherit (child
, parent
)
4821 fputs ("\t.vtable_inherit ", asm_out_file
);
4822 output_addr_const (asm_out_file
, child
);
4823 fputs (", ", asm_out_file
);
4824 output_addr_const (asm_out_file
, parent
);
4825 fputc ('\n', asm_out_file
);
4828 /* The lame default section selector. */
4831 default_select_section (decl
, reloc
, align
)
4834 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
4836 bool readonly
= false;
4840 if (decl_readonly_section (decl
, reloc
))
4843 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4845 if (! ((flag_pic
&& reloc
)
4846 || !TREE_READONLY (decl
)
4847 || TREE_SIDE_EFFECTS (decl
)
4848 || !TREE_CONSTANT (decl
)))
4851 else if (TREE_CODE (decl
) == STRING_CST
)
4852 readonly
= !flag_writable_strings
;
4853 else if (! (flag_pic
&& reloc
))
4857 readonly_data_section ();
4862 /* A helper function for default_elf_select_section and
4863 default_elf_unique_section. Categorizes the DECL. */
4865 enum section_category
4870 SECCAT_RODATA_MERGE_STR
,
4871 SECCAT_RODATA_MERGE_STR_INIT
,
4872 SECCAT_RODATA_MERGE_CONST
,
4877 /* To optimize loading of shared programs, define following subsections
4879 _REL Contains data that has relocations, so they get grouped
4880 together and dynamic linker will visit fewer pages in memory.
4881 _RO Contains data that is otherwise read-only. This is useful
4882 with prelinking as most relocations won't be dynamically
4883 linked and thus stay read only.
4884 _LOCAL Marks data containing relocations only to local objects.
4885 These relocations will get fully resolved by prelinking. */
4887 SECCAT_DATA_REL_LOCAL
,
4889 SECCAT_DATA_REL_RO_LOCAL
,
4899 static enum section_category
4900 categorize_decl_for_section
PARAMS ((tree
, int, int));
4902 static enum section_category
4903 categorize_decl_for_section (decl
, reloc
, shlib
)
4908 enum section_category ret
;
4910 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4912 else if (TREE_CODE (decl
) == STRING_CST
)
4914 if (flag_writable_strings
)
4917 return SECCAT_RODATA_MERGE_STR
;
4919 else if (TREE_CODE (decl
) == VAR_DECL
)
4921 if (DECL_INITIAL (decl
) == NULL
4922 || DECL_INITIAL (decl
) == error_mark_node
)
4924 else if (! TREE_READONLY (decl
)
4925 || TREE_SIDE_EFFECTS (decl
)
4926 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
4928 if (shlib
&& (reloc
& 2))
4929 ret
= SECCAT_DATA_REL
;
4930 else if (shlib
&& reloc
)
4931 ret
= SECCAT_DATA_REL_LOCAL
;
4935 else if (shlib
&& (reloc
& 2))
4936 ret
= SECCAT_DATA_REL_RO
;
4937 else if (shlib
&& reloc
)
4938 ret
= SECCAT_DATA_REL_RO_LOCAL
;
4939 else if (reloc
|| flag_merge_constants
< 2)
4940 /* C and C++ don't allow different variables to share the same
4941 location. -fmerge-all-constants allows even that (at the
4942 expense of not conforming). */
4943 ret
= SECCAT_RODATA
;
4944 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
4945 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
4947 ret
= SECCAT_RODATA_MERGE_CONST
;
4949 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4951 if ((shlib
&& reloc
)
4952 || TREE_SIDE_EFFECTS (decl
)
4953 || ! TREE_CONSTANT (decl
))
4956 ret
= SECCAT_RODATA
;
4959 ret
= SECCAT_RODATA
;
4961 /* There are no read-only thread-local sections. */
4962 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4964 if (ret
== SECCAT_BSS
)
4970 /* If the target uses small data sections, select it. */
4971 else if ((*targetm
.in_small_data_p
) (decl
))
4973 if (ret
== SECCAT_BSS
)
4975 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
4976 ret
= SECCAT_SRODATA
;
4985 decl_readonly_section (decl
, reloc
)
4989 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
4993 decl_readonly_section_1 (decl
, reloc
, shlib
)
4998 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5001 case SECCAT_RODATA_MERGE_STR
:
5002 case SECCAT_RODATA_MERGE_STR_INIT
:
5003 case SECCAT_RODATA_MERGE_CONST
:
5004 case SECCAT_SRODATA
:
5013 /* Select a section based on the above categorization. */
5016 default_elf_select_section (decl
, reloc
, align
)
5019 unsigned HOST_WIDE_INT align
;
5021 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
5025 default_elf_select_section_1 (decl
, reloc
, align
, shlib
)
5028 unsigned HOST_WIDE_INT align
;
5031 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5034 /* We're not supposed to be called on FUNCTION_DECLs. */
5037 readonly_data_section ();
5039 case SECCAT_RODATA_MERGE_STR
:
5040 mergeable_string_section (decl
, align
, 0);
5042 case SECCAT_RODATA_MERGE_STR_INIT
:
5043 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
5045 case SECCAT_RODATA_MERGE_CONST
:
5046 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
5048 case SECCAT_SRODATA
:
5049 named_section (NULL_TREE
, ".sdata2", reloc
);
5054 case SECCAT_DATA_REL
:
5055 named_section (NULL_TREE
, ".data.rel", reloc
);
5057 case SECCAT_DATA_REL_LOCAL
:
5058 named_section (NULL_TREE
, ".data.rel.local", reloc
);
5060 case SECCAT_DATA_REL_RO
:
5061 named_section (NULL_TREE
, ".data.rel.ro", reloc
);
5063 case SECCAT_DATA_REL_RO_LOCAL
:
5064 named_section (NULL_TREE
, ".data.rel.ro.local", reloc
);
5067 named_section (NULL_TREE
, ".sdata", reloc
);
5070 named_section (NULL_TREE
, ".tdata", reloc
);
5073 #ifdef BSS_SECTION_ASM_OP
5076 named_section (NULL_TREE
, ".bss", reloc
);
5080 named_section (NULL_TREE
, ".sbss", reloc
);
5083 named_section (NULL_TREE
, ".tbss", reloc
);
5090 /* Construct a unique section name based on the decl name and the
5091 categorization performed above. */
5094 default_unique_section (decl
, reloc
)
5098 default_unique_section_1 (decl
, reloc
, flag_pic
);
5102 default_unique_section_1 (decl
, reloc
, shlib
)
5107 bool one_only
= DECL_ONE_ONLY (decl
);
5108 const char *prefix
, *name
;
5112 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
5115 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
5118 case SECCAT_RODATA_MERGE_STR
:
5119 case SECCAT_RODATA_MERGE_STR_INIT
:
5120 case SECCAT_RODATA_MERGE_CONST
:
5121 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
5123 case SECCAT_SRODATA
:
5124 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
5127 case SECCAT_DATA_REL
:
5128 case SECCAT_DATA_REL_LOCAL
:
5129 case SECCAT_DATA_REL_RO
:
5130 case SECCAT_DATA_REL_RO_LOCAL
:
5131 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
5134 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
5137 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
5140 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
5143 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
5146 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
5151 plen
= strlen (prefix
);
5153 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5154 name
= (* targetm
.strip_name_encoding
) (name
);
5155 nlen
= strlen (name
);
5157 string
= alloca (nlen
+ plen
+ 1);
5158 memcpy (string
, prefix
, plen
);
5159 memcpy (string
+ plen
, name
, nlen
+ 1);
5161 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
5165 default_select_rtx_section (mode
, x
, align
)
5166 enum machine_mode mode ATTRIBUTE_UNUSED
;
5168 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
;
5171 switch (GET_CODE (x
))
5183 readonly_data_section ();
5187 default_elf_select_rtx_section (mode
, x
, align
)
5188 enum machine_mode mode
;
5190 unsigned HOST_WIDE_INT align
;
5192 /* ??? Handle small data here somehow. */
5195 switch (GET_CODE (x
))
5199 named_section (NULL_TREE
, ".data.rel.ro", 3);
5203 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
5210 mergeable_constant_section (mode
, align
, 0);
5213 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
5216 default_encode_section_info (decl
, rtl
, first
)
5219 int first ATTRIBUTE_UNUSED
;
5224 /* Careful not to prod global register variables. */
5225 if (GET_CODE (rtl
) != MEM
)
5227 symbol
= XEXP (rtl
, 0);
5228 if (GET_CODE (symbol
) != SYMBOL_REF
)
5232 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5233 flags
|= SYMBOL_FLAG_FUNCTION
;
5234 if ((*targetm
.binds_local_p
) (decl
))
5235 flags
|= SYMBOL_FLAG_LOCAL
;
5236 if ((*targetm
.in_small_data_p
) (decl
))
5237 flags
|= SYMBOL_FLAG_SMALL
;
5238 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5239 flags
|= decl_tls_model (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
5240 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
5241 being PUBLIC, the thing *must* be defined in this translation unit.
5242 Prevent this buglet from being propagated into rtl code as well. */
5243 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
5244 flags
|= SYMBOL_FLAG_EXTERNAL
;
5246 SYMBOL_REF_FLAGS (symbol
) = flags
;
5249 /* By default, we do nothing for encode_section_info, so we need not
5250 do anything but discard the '*' marker. */
5253 default_strip_name_encoding (str
)
5256 return str
+ (*str
== '*');
5259 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5260 wrt cross-module name binding. */
5263 default_binds_local_p (exp
)
5266 return default_binds_local_p_1 (exp
, flag_pic
);
5270 default_binds_local_p_1 (exp
, shlib
)
5276 /* A non-decl is an entry in the constant pool. */
5279 /* Static variables are always local. */
5280 else if (! TREE_PUBLIC (exp
))
5282 /* A variable is local if the user tells us so. */
5283 else if (decl_visibility (exp
) != VISIBILITY_DEFAULT
)
5285 /* Otherwise, variables defined outside this object may not be local. */
5286 else if (DECL_EXTERNAL (exp
))
5288 /* Linkonce and weak data are never local. */
5289 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
5291 /* If PIC, then assume that any global name can be overridden by
5292 symbols resolved from other modules. */
5295 /* Uninitialized COMMON variable may be unified with symbols
5296 resolved from other modules. */
5297 else if (DECL_COMMON (exp
)
5298 && (DECL_INITIAL (exp
) == NULL
5299 || DECL_INITIAL (exp
) == error_mark_node
))
5301 /* Otherwise we're left with initialized (or non-common) global data
5302 which is of necessity defined locally. */
5309 /* Determine whether or not a pointer mode is valid. Assume defaults
5310 of ptr_mode or Pmode - can be overridden. */
5312 default_valid_pointer_mode (mode
)
5313 enum machine_mode mode
;
5315 return (mode
== ptr_mode
|| mode
== Pmode
);
5318 /* Default function to output code that will globalize a label. A
5319 target must define GLOBAL_ASM_OP or provide it's own function to
5320 globalize a label. */
5321 #ifdef GLOBAL_ASM_OP
5323 default_globalize_label (stream
, name
)
5327 fputs (GLOBAL_ASM_OP
, stream
);
5328 assemble_name (stream
, name
);
5329 putc ('\n', stream
);
5331 #endif /* GLOBAL_ASM_OP */
5333 /* This is how to output an internal numbered label where PREFIX is
5334 the class of label and LABELNO is the number within the class. */
5337 default_internal_label (stream
, prefix
, labelno
)
5340 unsigned long labelno
;
5342 char *const buf
= alloca (40 + strlen (prefix
));
5343 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5344 ASM_OUTPUT_LABEL (stream
, buf
);
5347 #include "gt-varasm.h"