1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
32 #include "coretypes.h"
39 #include "hard-reg-set.h"
47 #include "langhooks.h"
53 #ifdef XCOFF_DEBUGGING_INFO
54 #include "xcoffout.h" /* Needed for external data
55 declarations for e.g. AIX 4.x. */
58 #ifndef TRAMPOLINE_ALIGNMENT
59 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
63 #define ASM_STABS_OP "\t.stabs\t"
66 /* The (assembler) name of the first globally-visible object output. */
67 const char *first_global_object_name
;
68 const char *weak_global_object_name
;
71 struct constant_descriptor_rtx
;
75 #define MAX_RTX_HASH_TABLE 61
77 struct varasm_status
GTY(())
79 /* Hash facility for making memory-constants
80 from constant rtl-expressions. It is used on RISC machines
81 where immediate integer arguments and constant addresses are restricted
82 so that such constants must be stored in memory.
84 This pool of constants is reinitialized for each function
85 so each function gets its own constants-pool that comes right before
87 struct constant_descriptor_rtx
** GTY ((length ("MAX_RTX_HASH_TABLE")))
88 x_const_rtx_hash_table
;
89 struct pool_constant
** GTY ((length ("MAX_RTX_HASH_TABLE")))
90 x_const_rtx_sym_hash_table
;
92 /* Pointers to first and last constant in pool. */
93 struct pool_constant
*x_first_pool
;
94 struct pool_constant
*x_last_pool
;
96 /* Current offset in constant pool (does not include any machine-specific
98 HOST_WIDE_INT x_pool_offset
;
100 /* Number of tree-constants deferred during the expansion of this
102 unsigned int deferred_constants
;
105 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
106 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
107 #define first_pool (cfun->varasm->x_first_pool)
108 #define last_pool (cfun->varasm->x_last_pool)
109 #define pool_offset (cfun->varasm->x_pool_offset)
110 #define n_deferred_constants (cfun->varasm->deferred_constants)
112 /* Number for making the label on the next
113 constant that is stored in memory. */
115 static GTY(()) int const_labelno
;
117 /* Carry information from ASM_DECLARE_OBJECT_NAME
118 to ASM_FINISH_DECLARE_OBJECT. */
120 int size_directive_output
;
122 /* The last decl for which assemble_variable was called,
123 if it did ASM_DECLARE_OBJECT_NAME.
124 If the last call to assemble_variable didn't do that,
127 tree last_assemble_variable_decl
;
129 /* RTX_UNCHANGING_P in a MEM can mean it is stored into, for initialization.
130 So giving constant the alias set for the type will allow such
131 initializations to appear to conflict with the load of the constant. We
132 avoid this by giving all constants an alias set for just constants.
133 Since there will be no stores to that alias set, nothing will ever
134 conflict with them. */
136 static HOST_WIDE_INT const_alias_set
;
138 static const char *strip_reg_name (const char *);
139 static int contains_pointers_p (tree
);
140 static void decode_addr_const (tree
, struct addr_const
*);
141 static hashval_t
const_desc_hash (const void *);
142 static int const_desc_eq (const void *, const void *);
143 static hashval_t
const_hash_1 (const tree
);
144 static int compare_constant (const tree
, const tree
);
145 static tree
copy_constant (tree
);
146 static void output_constant_def_contents (rtx
);
147 static void decode_rtx_const (enum machine_mode
, rtx
, struct rtx_const
*);
148 static unsigned int const_hash_rtx (enum machine_mode
, rtx
);
149 static int compare_constant_rtx (enum machine_mode
, rtx
,
150 struct constant_descriptor_rtx
*);
151 static struct constant_descriptor_rtx
* record_constant_rtx
152 (enum machine_mode
, rtx
);
153 static struct pool_constant
*find_pool_constant (struct function
*, rtx
);
154 static void mark_constant_pool (void);
155 static void mark_constants (rtx
);
156 static int mark_constant (rtx
*current_rtx
, void *data
);
157 static int output_addressed_constants (tree
);
158 static unsigned HOST_WIDE_INT
array_size_for_constructor (tree
);
159 static unsigned min_align (unsigned, unsigned);
160 static void output_constructor (tree
, unsigned HOST_WIDE_INT
, unsigned int);
161 static void globalize_decl (tree
);
162 static void maybe_assemble_visibility (tree
);
163 static int in_named_entry_eq (const void *, const void *);
164 static hashval_t
in_named_entry_hash (const void *);
165 #ifdef ASM_OUTPUT_BSS
166 static void asm_output_bss (FILE *, tree
, const char *,
167 unsigned HOST_WIDE_INT
, unsigned HOST_WIDE_INT
);
169 #ifdef BSS_SECTION_ASM_OP
170 #ifdef ASM_OUTPUT_ALIGNED_BSS
171 static void asm_output_aligned_bss (FILE *, tree
, const char *,
172 unsigned HOST_WIDE_INT
, int)
175 #endif /* BSS_SECTION_ASM_OP */
176 static bool asm_emit_uninitialised (tree
, const char*,
177 unsigned HOST_WIDE_INT
,
178 unsigned HOST_WIDE_INT
);
179 static void mark_weak (tree
);
181 enum in_section
{ no_section
, in_text
, in_data
, in_named
182 #ifdef BSS_SECTION_ASM_OP
185 #ifdef CTORS_SECTION_ASM_OP
188 #ifdef DTORS_SECTION_ASM_OP
191 #ifdef READONLY_DATA_SECTION_ASM_OP
194 #ifdef EXTRA_SECTIONS
198 static GTY(()) enum in_section in_section
= no_section
;
200 /* Return a nonzero value if DECL has a section attribute. */
201 #ifndef IN_NAMED_SECTION
202 #define IN_NAMED_SECTION(DECL) \
203 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
204 && DECL_SECTION_NAME (DECL) != NULL_TREE)
207 /* Text of section name when in_section == in_named. */
208 static GTY(()) const char *in_named_name
;
210 /* Hash table of flags that have been used for a particular named section. */
212 struct in_named_entry
GTY(())
219 static GTY((param_is (struct in_named_entry
))) htab_t in_named_htab
;
221 /* Define functions like text_section for any extra sections. */
222 #ifdef EXTRA_SECTION_FUNCTIONS
223 EXTRA_SECTION_FUNCTIONS
226 /* Tell assembler to switch to text section. */
231 if (in_section
!= in_text
)
233 in_section
= in_text
;
237 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
242 /* Tell assembler to switch to data section. */
247 if (in_section
!= in_data
)
249 in_section
= in_data
;
250 if (flag_shared_data
)
252 #ifdef SHARED_SECTION_ASM_OP
253 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
255 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
259 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
263 /* Tell assembler to switch to read-only data section. This is normally
267 readonly_data_section (void)
269 #ifdef READONLY_DATA_SECTION
270 READONLY_DATA_SECTION (); /* Note this can call data_section. */
272 #ifdef READONLY_DATA_SECTION_ASM_OP
273 if (in_section
!= in_readonly_data
)
275 in_section
= in_readonly_data
;
276 fputs (READONLY_DATA_SECTION_ASM_OP
, asm_out_file
);
277 fputc ('\n', asm_out_file
);
285 /* Determine if we're in the text section. */
288 in_text_section (void)
290 return in_section
== in_text
;
293 /* Determine if we're in the data section. */
296 in_data_section (void)
298 return in_section
== in_data
;
301 /* Helper routines for maintaining in_named_htab. */
304 in_named_entry_eq (const void *p1
, const void *p2
)
306 const struct in_named_entry
*old
= p1
;
307 const char *new = p2
;
309 return strcmp (old
->name
, new) == 0;
313 in_named_entry_hash (const void *p
)
315 const struct in_named_entry
*old
= p
;
316 return htab_hash_string (old
->name
);
319 /* If SECTION has been seen before as a named section, return the flags
320 that were used. Otherwise, return 0. Note, that 0 is a perfectly valid
321 set of flags for a section to have, so 0 does not mean that the section
322 has not been seen. */
325 get_named_section_flags (const char *section
)
327 struct in_named_entry
**slot
;
329 slot
= (struct in_named_entry
**)
330 htab_find_slot_with_hash (in_named_htab
, section
,
331 htab_hash_string (section
), NO_INSERT
);
333 return slot
? (*slot
)->flags
: 0;
336 /* Returns true if the section has been declared before. Sets internal
337 flag on this section in in_named_hash so subsequent calls on this
338 section will return false. */
341 named_section_first_declaration (const char *name
)
343 struct in_named_entry
**slot
;
345 slot
= (struct in_named_entry
**)
346 htab_find_slot_with_hash (in_named_htab
, name
,
347 htab_hash_string (name
), NO_INSERT
);
348 if (! (*slot
)->declared
)
350 (*slot
)->declared
= true;
360 /* Record FLAGS for SECTION. If SECTION was previously recorded with a
361 different set of flags, return false. */
364 set_named_section_flags (const char *section
, unsigned int flags
)
366 struct in_named_entry
**slot
, *entry
;
368 slot
= (struct in_named_entry
**)
369 htab_find_slot_with_hash (in_named_htab
, section
,
370 htab_hash_string (section
), INSERT
);
375 entry
= ggc_alloc (sizeof (*entry
));
377 entry
->name
= ggc_strdup (section
);
378 entry
->flags
= flags
;
379 entry
->declared
= false;
381 else if (entry
->flags
!= flags
)
387 /* Tell assembler to change to section NAME with attributes FLAGS. */
390 named_section_flags (const char *name
, unsigned int flags
)
392 if (in_section
!= in_named
|| strcmp (name
, in_named_name
) != 0)
394 if (! set_named_section_flags (name
, flags
))
397 (*targetm
.asm_out
.named_section
) (name
, flags
);
399 if (flags
& SECTION_FORGET
)
400 in_section
= no_section
;
403 in_named_name
= ggc_strdup (name
);
404 in_section
= in_named
;
409 /* Tell assembler to change to section NAME for DECL.
410 If DECL is NULL, just switch to section NAME.
411 If NAME is NULL, get the name from DECL.
412 If RELOC is 1, the initializer for DECL contains relocs. */
415 named_section (tree decl
, const char *name
, int reloc
)
419 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
422 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
424 flags
= (* targetm
.section_type_flags
) (decl
, name
, reloc
);
426 /* Sanity check user variables for flag changes. Non-user
427 section flag changes will abort in named_section_flags.
428 However, don't complain if SECTION_OVERRIDE is set.
429 We trust that the setter knows that it is safe to ignore
430 the default flags for this decl. */
431 if (decl
&& ! set_named_section_flags (name
, flags
))
433 flags
= get_named_section_flags (name
);
434 if ((flags
& SECTION_OVERRIDE
) == 0)
435 error ("%H%D causes a section type conflict",
436 &DECL_SOURCE_LOCATION (decl
), decl
);
439 named_section_flags (name
, flags
);
442 /* If required, set DECL_SECTION_NAME to a unique name. */
445 resolve_unique_section (tree decl
, int reloc ATTRIBUTE_UNUSED
,
446 int flag_function_or_data_sections
)
448 if (DECL_SECTION_NAME (decl
) == NULL_TREE
449 && targetm
.have_named_sections
450 && (flag_function_or_data_sections
451 || DECL_ONE_ONLY (decl
)))
452 (*targetm
.asm_out
.unique_section
) (decl
, reloc
);
455 #ifdef BSS_SECTION_ASM_OP
457 /* Tell the assembler to switch to the bss section. */
462 if (in_section
!= in_bss
)
464 #ifdef SHARED_BSS_SECTION_ASM_OP
465 if (flag_shared_data
)
466 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
469 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
475 #ifdef ASM_OUTPUT_BSS
477 /* Utility function for ASM_OUTPUT_BSS for targets to use if
478 they don't support alignments in .bss.
479 ??? It is believed that this function will work in most cases so such
480 support is localized here. */
483 asm_output_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
485 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
486 unsigned HOST_WIDE_INT rounded
)
488 (*targetm
.asm_out
.globalize_label
) (file
, name
);
490 #ifdef ASM_DECLARE_OBJECT_NAME
491 last_assemble_variable_decl
= decl
;
492 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
494 /* Standard thing is just output label for the object. */
495 ASM_OUTPUT_LABEL (file
, name
);
496 #endif /* ASM_DECLARE_OBJECT_NAME */
497 ASM_OUTPUT_SKIP (file
, rounded
? rounded
: 1);
502 #ifdef ASM_OUTPUT_ALIGNED_BSS
504 /* Utility function for targets to use in implementing
505 ASM_OUTPUT_ALIGNED_BSS.
506 ??? It is believed that this function will work in most cases so such
507 support is localized here. */
510 asm_output_aligned_bss (FILE *file
, tree decl ATTRIBUTE_UNUSED
,
511 const char *name
, unsigned HOST_WIDE_INT size
,
515 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
516 #ifdef ASM_DECLARE_OBJECT_NAME
517 last_assemble_variable_decl
= decl
;
518 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
520 /* Standard thing is just output label for the object. */
521 ASM_OUTPUT_LABEL (file
, name
);
522 #endif /* ASM_DECLARE_OBJECT_NAME */
523 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
528 #endif /* BSS_SECTION_ASM_OP */
530 /* Switch to the section for function DECL.
532 If DECL is NULL_TREE, switch to the text section.
533 ??? It's not clear that we will ever be passed NULL_TREE, but it's
534 safer to handle it. */
537 function_section (tree decl
)
539 if (decl
!= NULL_TREE
540 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
541 named_section (decl
, (char *) 0, 0);
546 /* Switch to section for variable DECL. RELOC is the same as the
547 argument to SELECT_SECTION. */
550 variable_section (tree decl
, int reloc
)
552 if (IN_NAMED_SECTION (decl
))
553 named_section (decl
, NULL
, reloc
);
555 (*targetm
.asm_out
.select_section
) (decl
, reloc
, DECL_ALIGN (decl
));
558 /* Tell assembler to switch to the section for string merging. */
561 mergeable_string_section (tree decl ATTRIBUTE_UNUSED
,
562 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
563 unsigned int flags ATTRIBUTE_UNUSED
)
565 #ifdef HAVE_GAS_SHF_MERGE
566 if (flag_merge_constants
567 && TREE_CODE (decl
) == STRING_CST
568 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
570 && TREE_STRING_LENGTH (decl
) >= int_size_in_bytes (TREE_TYPE (decl
)))
572 enum machine_mode mode
;
573 unsigned int modesize
;
578 mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (decl
)));
579 modesize
= GET_MODE_BITSIZE (mode
);
580 if (modesize
>= 8 && modesize
<= 256
581 && (modesize
& (modesize
- 1)) == 0)
583 if (align
< modesize
)
586 str
= TREE_STRING_POINTER (decl
);
587 len
= TREE_STRING_LENGTH (decl
);
588 unit
= GET_MODE_SIZE (mode
);
590 /* Check for embedded NUL characters. */
591 for (i
= 0; i
< len
; i
+= unit
)
593 for (j
= 0; j
< unit
; j
++)
594 if (str
[i
+ j
] != '\0')
601 sprintf (name
, ".rodata.str%d.%d", modesize
/ 8,
603 flags
|= (modesize
/ 8) | SECTION_MERGE
| SECTION_STRINGS
;
604 if (!i
&& modesize
< align
)
606 /* A "" string with requested alignment greater than
607 character size might cause a problem:
608 if some other string required even bigger
609 alignment than "", then linker might think the
610 "" is just part of padding after some other string
611 and not put it into the hash table initially.
612 But this means "" could have smaller alignment
614 #ifdef ASM_OUTPUT_SECTION_START
615 named_section_flags (name
, flags
);
616 ASM_OUTPUT_SECTION_START (asm_out_file
);
618 readonly_data_section ();
623 named_section_flags (name
, flags
);
629 readonly_data_section ();
632 /* Tell assembler to switch to the section for constant merging. */
635 mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
636 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
,
637 unsigned int flags ATTRIBUTE_UNUSED
)
639 #ifdef HAVE_GAS_SHF_MERGE
640 unsigned int modesize
= GET_MODE_BITSIZE (mode
);
642 if (flag_merge_constants
648 && (align
& (align
- 1)) == 0)
652 sprintf (name
, ".rodata.cst%d", (int) (align
/ 8));
653 flags
|= (align
/ 8) | SECTION_MERGE
;
654 named_section_flags (name
, flags
);
658 readonly_data_section ();
661 /* Given NAME, a putative register name, discard any customary prefixes. */
664 strip_reg_name (const char *name
)
666 #ifdef REGISTER_PREFIX
667 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
668 name
+= strlen (REGISTER_PREFIX
);
670 if (name
[0] == '%' || name
[0] == '#')
675 /* Decode an `asm' spec for a declaration as a register name.
676 Return the register number, or -1 if nothing specified,
677 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
678 or -3 if ASMSPEC is `cc' and is not recognized,
679 or -4 if ASMSPEC is `memory' and is not recognized.
680 Accept an exact spelling or a decimal number.
681 Prefixes such as % are optional. */
684 decode_reg_name (const char *asmspec
)
690 /* Get rid of confusing prefixes. */
691 asmspec
= strip_reg_name (asmspec
);
693 /* Allow a decimal number as a "register name". */
694 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
695 if (! ISDIGIT (asmspec
[i
]))
697 if (asmspec
[0] != 0 && i
< 0)
700 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
706 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
708 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
711 #ifdef ADDITIONAL_REGISTER_NAMES
713 static const struct { const char *const name
; const int number
; } table
[]
714 = ADDITIONAL_REGISTER_NAMES
;
716 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
717 if (! strcmp (asmspec
, table
[i
].name
))
718 return table
[i
].number
;
720 #endif /* ADDITIONAL_REGISTER_NAMES */
722 if (!strcmp (asmspec
, "memory"))
725 if (!strcmp (asmspec
, "cc"))
734 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
735 have static storage duration. In other words, it should not be an
736 automatic variable, including PARM_DECLs.
738 There is, however, one exception: this function handles variables
739 explicitly placed in a particular register by the user.
741 ASMSPEC, if not 0, is the string which the user specified as the
742 assembler symbol name.
744 This is never called for PARM_DECL nodes. */
747 make_decl_rtl (tree decl
, const char *asmspec
)
749 const char *name
= 0;
753 /* Check that we are not being given an automatic variable. */
754 /* A weak alias has TREE_PUBLIC set but not the other bits. */
755 if (TREE_CODE (decl
) == PARM_DECL
756 || TREE_CODE (decl
) == RESULT_DECL
757 || (TREE_CODE (decl
) == VAR_DECL
758 && !TREE_STATIC (decl
)
759 && !TREE_PUBLIC (decl
)
760 && !DECL_EXTERNAL (decl
)
761 && !DECL_REGISTER (decl
)))
763 /* And that we were not given a type or a label. */
764 else if (TREE_CODE (decl
) == TYPE_DECL
765 || TREE_CODE (decl
) == LABEL_DECL
)
768 /* For a duplicate declaration, we can be called twice on the
769 same DECL node. Don't discard the RTL already made. */
770 if (DECL_RTL_SET_P (decl
))
772 /* If the old RTL had the wrong mode, fix the mode. */
773 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
774 SET_DECL_RTL (decl
, adjust_address_nv (DECL_RTL (decl
),
775 DECL_MODE (decl
), 0));
777 /* ??? Another way to do this would be to maintain a hashed
778 table of such critters. Instead of adding stuff to a DECL
779 to give certain attributes to it, we could use an external
780 hash map from DECL to set of attributes. */
782 /* Let the target reassign the RTL if it wants.
783 This is necessary, for example, when one machine specific
784 decl attribute overrides another. */
785 (* targetm
.encode_section_info
) (decl
, DECL_RTL (decl
), false);
789 reg_number
= decode_reg_name (asmspec
);
790 if (reg_number
== -2)
792 /* ASMSPEC is given, and not the name of a register. Mark the
793 name with a star so assemble_name won't munge it. */
794 char *starred
= alloca (strlen (asmspec
) + 2);
796 strcpy (starred
+ 1, asmspec
);
797 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (starred
));
800 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
802 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
804 /* First detect errors in declaring global registers. */
805 if (reg_number
== -1)
806 error ("%Hregister name not specified for '%D'",
807 &DECL_SOURCE_LOCATION (decl
), decl
);
808 else if (reg_number
< 0)
809 error ("%Hinvalid register name for '%D'",
810 &DECL_SOURCE_LOCATION (decl
), decl
);
811 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
812 error ("%Hdata type of '%D' isn't suitable for a register",
813 &DECL_SOURCE_LOCATION (decl
), decl
);
814 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
815 error ("%Hregister specified for '%D' isn't suitable for data type",
816 &DECL_SOURCE_LOCATION (decl
), decl
);
817 /* Now handle properly declared static register variables. */
822 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
824 DECL_INITIAL (decl
) = 0;
825 error ("global register variable has initial value");
827 if (TREE_THIS_VOLATILE (decl
))
828 warning ("volatile register variables don't work as you might wish");
830 /* If the user specified one of the eliminables registers here,
831 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
832 confused with that register and be eliminated. This usage is
833 somewhat suspect... */
835 SET_DECL_RTL (decl
, gen_rtx_raw_REG (DECL_MODE (decl
), reg_number
));
836 ORIGINAL_REGNO (DECL_RTL (decl
)) = reg_number
;
837 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
839 if (TREE_STATIC (decl
))
841 /* Make this register global, so not usable for anything
843 #ifdef ASM_DECLARE_REGISTER_GLOBAL
844 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
846 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
848 globalize_reg (reg_number
+ --nregs
);
851 /* As a register variable, it has no section. */
856 /* Now handle ordinary static variables and functions (in memory).
857 Also handle vars declared register invalidly. */
859 if (reg_number
>= 0 || reg_number
== -3)
860 error ("%Hregister name given for non-register variable '%D'",
861 &DECL_SOURCE_LOCATION (decl
), decl
);
863 /* Specifying a section attribute on a variable forces it into a
864 non-.bss section, and thus it cannot be common. */
865 if (TREE_CODE (decl
) == VAR_DECL
866 && DECL_SECTION_NAME (decl
) != NULL_TREE
867 && DECL_INITIAL (decl
) == NULL_TREE
868 && DECL_COMMON (decl
))
869 DECL_COMMON (decl
) = 0;
871 /* Variables can't be both common and weak. */
872 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_WEAK (decl
))
873 DECL_COMMON (decl
) = 0;
875 x
= gen_rtx_SYMBOL_REF (Pmode
, name
);
876 SYMBOL_REF_WEAK (x
) = DECL_WEAK (decl
);
877 SYMBOL_REF_DECL (x
) = decl
;
879 x
= gen_rtx_MEM (DECL_MODE (decl
), x
);
880 if (TREE_CODE (decl
) != FUNCTION_DECL
)
881 set_mem_attributes (x
, decl
, 1);
882 SET_DECL_RTL (decl
, x
);
884 /* Optionally set flags or add text to the name to record information
885 such as that it is a function name.
886 If the name is changed, the macro ASM_OUTPUT_LABELREF
887 will have to know how to strip this information. */
888 (* targetm
.encode_section_info
) (decl
, DECL_RTL (decl
), true);
891 /* Make the rtl for variable VAR be volatile.
892 Use this only for static variables. */
895 make_var_volatile (tree var
)
897 if (GET_CODE (DECL_RTL (var
)) != MEM
)
900 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
903 /* Output a string of literal assembler code
904 for an `asm' keyword used between functions. */
907 assemble_asm (tree string
)
911 if (TREE_CODE (string
) == ADDR_EXPR
)
912 string
= TREE_OPERAND (string
, 0);
914 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
917 /* Record an element in the table of global destructors. SYMBOL is
918 a SYMBOL_REF of the function to be called; PRIORITY is a number
919 between 0 and MAX_INIT_PRIORITY. */
922 default_stabs_asm_out_destructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
924 /* Tell GNU LD that this is part of the static destructor set.
925 This will work for any system that uses stabs, most usefully
927 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
928 assemble_name (asm_out_file
, XSTR (symbol
, 0));
929 fputc ('\n', asm_out_file
);
933 default_named_section_asm_out_destructor (rtx symbol
, int priority
)
935 const char *section
= ".dtors";
938 /* ??? This only works reliably with the GNU linker. */
939 if (priority
!= DEFAULT_INIT_PRIORITY
)
941 sprintf (buf
, ".dtors.%.5u",
942 /* Invert the numbering so the linker puts us in the proper
943 order; constructors are run from right to left, and the
944 linker sorts in increasing order. */
945 MAX_INIT_PRIORITY
- priority
);
949 named_section_flags (section
, SECTION_WRITE
);
950 assemble_align (POINTER_SIZE
);
951 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
954 #ifdef DTORS_SECTION_ASM_OP
958 if (in_section
!= in_dtors
)
960 in_section
= in_dtors
;
961 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
962 fputc ('\n', asm_out_file
);
967 default_dtor_section_asm_out_destructor (rtx symbol
,
968 int priority ATTRIBUTE_UNUSED
)
971 assemble_align (POINTER_SIZE
);
972 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
976 /* Likewise for global constructors. */
979 default_stabs_asm_out_constructor (rtx symbol
, int priority ATTRIBUTE_UNUSED
)
981 /* Tell GNU LD that this is part of the static destructor set.
982 This will work for any system that uses stabs, most usefully
984 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
985 assemble_name (asm_out_file
, XSTR (symbol
, 0));
986 fputc ('\n', asm_out_file
);
990 default_named_section_asm_out_constructor (rtx symbol
, int priority
)
992 const char *section
= ".ctors";
995 /* ??? This only works reliably with the GNU linker. */
996 if (priority
!= DEFAULT_INIT_PRIORITY
)
998 sprintf (buf
, ".ctors.%.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 CTORS_SECTION_ASM_OP
1013 ctors_section (void)
1015 if (in_section
!= in_ctors
)
1017 in_section
= in_ctors
;
1018 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
1019 fputc ('\n', asm_out_file
);
1024 default_ctor_section_asm_out_constructor (rtx symbol
,
1025 int priority ATTRIBUTE_UNUSED
)
1028 assemble_align (POINTER_SIZE
);
1029 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, POINTER_SIZE
, 1);
1033 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
1034 a nonzero value if the constant pool should be output before the
1035 start of the function, or a zero value if the pool should output
1036 after the end of the function. The default is to put it before the
1039 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
1040 #define CONSTANT_POOL_BEFORE_FUNCTION 1
1043 /* Output assembler code for the constant pool of a function and associated
1044 with defining the name of the function. DECL describes the function.
1045 NAME is the function's name. For the constant pool, we use the current
1046 constant pool data. */
1049 assemble_start_function (tree decl
, const char *fnname
)
1053 /* The following code does not need preprocessing in the assembler. */
1057 if (CONSTANT_POOL_BEFORE_FUNCTION
)
1058 output_constant_pool (fnname
, decl
);
1060 resolve_unique_section (decl
, 0, flag_function_sections
);
1061 function_section (decl
);
1063 /* Tell assembler to move to target machine's alignment for functions. */
1064 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1065 if (align
< force_align_functions_log
)
1066 align
= force_align_functions_log
;
1069 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1072 /* Handle a user-specified function alignment.
1073 Note that we still need to align to FUNCTION_BOUNDARY, as above,
1074 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
1075 if (align_functions_log
> align
1076 && cfun
->function_frequency
!= FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
)
1078 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
1079 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
1080 align_functions_log
, align_functions
- 1);
1082 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
1086 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
1087 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
1090 (*debug_hooks
->begin_function
) (decl
);
1092 /* Make function name accessible from other files, if appropriate. */
1094 if (TREE_PUBLIC (decl
))
1096 if (! first_global_object_name
)
1101 p
= (* targetm
.strip_name_encoding
) (fnname
);
1104 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1105 first_global_object_name
= name
;
1107 weak_global_object_name
= name
;
1110 globalize_decl (decl
);
1112 maybe_assemble_visibility (decl
);
1115 /* Do any machine/system dependent processing of the function name */
1116 #ifdef ASM_DECLARE_FUNCTION_NAME
1117 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1119 /* Standard thing is just output label for the function. */
1120 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1121 #endif /* ASM_DECLARE_FUNCTION_NAME */
1124 /* Output assembler code associated with defining the size of the
1125 function. DECL describes the function. NAME is the function's name. */
1128 assemble_end_function (tree decl
, const char *fnname
)
1130 #ifdef ASM_DECLARE_FUNCTION_SIZE
1131 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1133 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1135 output_constant_pool (fnname
, decl
);
1136 function_section (decl
); /* need to switch back */
1140 /* Assemble code to leave SIZE bytes of zeros. */
1143 assemble_zeros (unsigned HOST_WIDE_INT size
)
1145 /* Do no output if -fsyntax-only. */
1146 if (flag_syntax_only
)
1149 #ifdef ASM_NO_SKIP_IN_TEXT
1150 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1151 so we must output 0s explicitly in the text section. */
1152 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1154 unsigned HOST_WIDE_INT i
;
1155 for (i
= 0; i
< size
; i
++)
1156 assemble_integer (const0_rtx
, 1, BITS_PER_UNIT
, 1);
1161 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1164 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1167 assemble_align (int align
)
1169 if (align
> BITS_PER_UNIT
)
1171 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1175 /* Assemble a string constant with the specified C string as contents. */
1178 assemble_string (const char *p
, int size
)
1183 /* If the string is very long, split it up. */
1187 int thissize
= size
- pos
;
1188 if (thissize
> maximum
)
1191 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1199 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1200 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1201 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1203 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1204 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1205 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1207 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1208 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1212 #if defined ASM_OUTPUT_ALIGNED_BSS
1213 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1214 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1216 #if defined ASM_OUTPUT_BSS
1217 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1218 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1224 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1225 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1226 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1228 #if defined ASM_OUTPUT_ALIGNED_COMMON
1229 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1230 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1232 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1233 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1238 asm_emit_uninitialised (tree decl
, const char *name
,
1239 unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED
,
1240 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
)
1248 destination
= asm_dest_local
;
1250 /* ??? We should handle .bss via select_section mechanisms rather than
1251 via special target hooks. That would eliminate this special case. */
1252 if (TREE_PUBLIC (decl
))
1254 if (!DECL_COMMON (decl
))
1256 destination
= asm_dest_bss
;
1261 destination
= asm_dest_common
;
1264 if (destination
== asm_dest_bss
)
1265 globalize_decl (decl
);
1266 resolve_unique_section (decl
, 0, flag_data_sections
);
1268 if (flag_shared_data
)
1270 switch (destination
)
1272 #ifdef ASM_OUTPUT_SHARED_BSS
1274 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1277 #ifdef ASM_OUTPUT_SHARED_COMMON
1278 case asm_dest_common
:
1279 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1282 #ifdef ASM_OUTPUT_SHARED_LOCAL
1283 case asm_dest_local
:
1284 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1292 switch (destination
)
1296 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1299 case asm_dest_common
:
1300 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1302 case asm_dest_local
:
1303 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1312 /* Assemble everything that is needed for a variable or function declaration.
1313 Not used for automatic variables, and not used for function definitions.
1314 Should not be called for variables of incomplete structure type.
1316 TOP_LEVEL is nonzero if this variable has file scope.
1317 AT_END is nonzero if this is the special handling, at end of compilation,
1318 to define things that have had only tentative definitions.
1319 DONT_OUTPUT_DATA if nonzero means don't actually output the
1320 initial value (that will be done by the caller). */
1323 assemble_variable (tree decl
, int top_level ATTRIBUTE_UNUSED
,
1324 int at_end ATTRIBUTE_UNUSED
, int dont_output_data
)
1331 if (lang_hooks
.decls
.prepare_assemble_variable
)
1332 (*lang_hooks
.decls
.prepare_assemble_variable
) (decl
);
1334 last_assemble_variable_decl
= 0;
1336 /* Normally no need to say anything here for external references,
1337 since assemble_external is called by the language-specific code
1338 when a declaration is first seen. */
1340 if (DECL_EXTERNAL (decl
))
1343 /* Output no assembler code for a function declaration.
1344 Only definitions of functions output anything. */
1346 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1349 /* Do nothing for global register variables. */
1350 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1352 TREE_ASM_WRITTEN (decl
) = 1;
1356 /* If type was incomplete when the variable was declared,
1357 see if it is complete now. */
1359 if (DECL_SIZE (decl
) == 0)
1360 layout_decl (decl
, 0);
1362 /* Still incomplete => don't allocate it; treat the tentative defn
1363 (which is what it must have been) as an `extern' reference. */
1365 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1367 error ("%Hstorage size of `%s' isn't known",
1368 &DECL_SOURCE_LOCATION (decl
),
1369 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1370 TREE_ASM_WRITTEN (decl
) = 1;
1374 /* The first declaration of a variable that comes through this function
1375 decides whether it is global (in C, has external linkage)
1376 or local (in C, has internal linkage). So do nothing more
1377 if this function has already run. */
1379 if (TREE_ASM_WRITTEN (decl
))
1382 /* Make sure targetm.encode_section_info is invoked before we set
1384 decl_rtl
= DECL_RTL (decl
);
1386 TREE_ASM_WRITTEN (decl
) = 1;
1388 /* Do no output if -fsyntax-only. */
1389 if (flag_syntax_only
)
1394 if (! dont_output_data
1395 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1397 error ("%Hsize of variable '%D' is too large",
1398 &DECL_SOURCE_LOCATION (decl
), decl
);
1402 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1403 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1404 && ! first_global_object_name
1405 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1406 || DECL_INITIAL (decl
) == error_mark_node
))
1407 && ! DECL_WEAK (decl
)
1408 && ! DECL_ONE_ONLY (decl
))
1413 p
= (* targetm
.strip_name_encoding
) (name
);
1414 xname
= xstrdup (p
);
1415 first_global_object_name
= xname
;
1418 /* Compute the alignment of this data. */
1420 align
= DECL_ALIGN (decl
);
1422 /* In the case for initialing an array whose length isn't specified,
1423 where we have not yet been able to do the layout,
1424 figure out the proper alignment now. */
1425 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1426 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1427 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1429 /* Some object file formats have a maximum alignment which they support.
1430 In particular, a.out format supports a maximum alignment of 4. */
1431 #ifndef MAX_OFILE_ALIGNMENT
1432 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1434 if (align
> MAX_OFILE_ALIGNMENT
)
1436 warning ("%Halignment of '%D' is greater than maximum object "
1437 "file alignment. Using %d", &DECL_SOURCE_LOCATION (decl
),
1438 decl
, MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1439 align
= MAX_OFILE_ALIGNMENT
;
1442 /* On some machines, it is good to increase alignment sometimes. */
1443 if (! DECL_USER_ALIGN (decl
))
1445 #ifdef DATA_ALIGNMENT
1446 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1448 #ifdef CONSTANT_ALIGNMENT
1449 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1450 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1454 /* Reset the alignment in case we have made it tighter, so we can benefit
1455 from it in get_pointer_alignment. */
1456 DECL_ALIGN (decl
) = align
;
1457 set_mem_align (decl_rtl
, align
);
1459 if (TREE_PUBLIC (decl
))
1460 maybe_assemble_visibility (decl
);
1462 /* Output any data that we will need to use the address of. */
1463 if (DECL_INITIAL (decl
) == error_mark_node
)
1464 reloc
= contains_pointers_p (TREE_TYPE (decl
)) ? 3 : 0;
1465 else if (DECL_INITIAL (decl
))
1466 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1467 resolve_unique_section (decl
, reloc
, flag_data_sections
);
1469 /* Handle uninitialized definitions. */
1471 /* If the decl has been given an explicit section name, then it
1472 isn't common, and shouldn't be handled as such. */
1473 if (DECL_SECTION_NAME (decl
) || dont_output_data
)
1475 /* We don't implement common thread-local data at present. */
1476 else if (DECL_THREAD_LOCAL (decl
))
1478 if (DECL_COMMON (decl
))
1479 sorry ("thread-local COMMON data not implemented");
1481 else if (DECL_INITIAL (decl
) == 0
1482 || DECL_INITIAL (decl
) == error_mark_node
1483 || (flag_zero_initialized_in_bss
1484 /* Leave constant zeroes in .rodata so they can be shared. */
1485 && !TREE_READONLY (decl
)
1486 && initializer_zerop (DECL_INITIAL (decl
))))
1488 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1489 unsigned HOST_WIDE_INT rounded
= size
;
1491 /* Don't allocate zero bytes of common,
1492 since that means "undefined external" in the linker. */
1496 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1497 so that each uninitialized object starts on such a boundary. */
1498 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1499 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1500 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1502 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1503 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1504 warning ("%Hrequested alignment for '%D' is greater than "
1505 "implemented alignment of %d", &DECL_SOURCE_LOCATION (decl
),
1509 /* If the target cannot output uninitialized but not common global data
1510 in .bss, then we have to use .data, so fall through. */
1511 if (asm_emit_uninitialised (decl
, name
, size
, rounded
))
1515 /* Handle initialized definitions.
1516 Also handle uninitialized global definitions if -fno-common and the
1517 target doesn't support ASM_OUTPUT_BSS. */
1519 /* First make the assembler name(s) global if appropriate. */
1520 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1521 globalize_decl (decl
);
1523 /* Switch to the appropriate section. */
1524 variable_section (decl
, reloc
);
1526 /* dbxout.c needs to know this. */
1527 if (in_text_section ())
1528 DECL_IN_TEXT_SECTION (decl
) = 1;
1530 /* Output the alignment of this data. */
1531 if (align
> BITS_PER_UNIT
)
1533 ASM_OUTPUT_ALIGN (asm_out_file
,
1534 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1537 /* Do any machine/system dependent processing of the object. */
1538 #ifdef ASM_DECLARE_OBJECT_NAME
1539 last_assemble_variable_decl
= decl
;
1540 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1542 /* Standard thing is just output label for the object. */
1543 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1544 #endif /* ASM_DECLARE_OBJECT_NAME */
1546 if (!dont_output_data
)
1548 if (DECL_INITIAL (decl
) && DECL_INITIAL (decl
) != error_mark_node
)
1549 /* Output the actual data. */
1550 output_constant (DECL_INITIAL (decl
),
1551 tree_low_cst (DECL_SIZE_UNIT (decl
), 1),
1554 /* Leave space for it. */
1555 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1559 /* Return 1 if type TYPE contains any pointers. */
1562 contains_pointers_p (tree type
)
1564 switch (TREE_CODE (type
))
1567 case REFERENCE_TYPE
:
1568 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1569 so I'll play safe and return 1. */
1575 case QUAL_UNION_TYPE
:
1578 /* For a type that has fields, see if the fields have pointers. */
1579 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1580 if (TREE_CODE (fields
) == FIELD_DECL
1581 && contains_pointers_p (TREE_TYPE (fields
)))
1587 /* An array type contains pointers if its element type does. */
1588 return contains_pointers_p (TREE_TYPE (type
));
1595 /* Output something to declare an external symbol to the assembler.
1596 (Most assemblers don't need this, so we normally output nothing.)
1597 Do nothing if DECL is not external. */
1600 assemble_external (tree decl ATTRIBUTE_UNUSED
)
1602 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1603 main body of this code is only rarely exercised. To provide some
1604 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1605 open. If it's not, we should not be calling this function. */
1609 #ifdef ASM_OUTPUT_EXTERNAL
1610 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1612 rtx rtl
= DECL_RTL (decl
);
1614 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1615 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1617 /* Some systems do require some output. */
1618 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1619 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1625 /* Similar, for calling a library function FUN. */
1628 assemble_external_libcall (rtx fun ATTRIBUTE_UNUSED
)
1630 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1631 /* Declare library function name external when first used, if nec. */
1632 if (! SYMBOL_REF_USED (fun
))
1634 SYMBOL_REF_USED (fun
) = 1;
1635 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1640 /* Assemble a label named NAME. */
1643 assemble_label (const char *name
)
1645 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1648 /* Set the symbol_referenced flag for ID and notify callgraph code. */
1650 mark_referenced (tree id
)
1652 if (!TREE_SYMBOL_REFERENCED (id
))
1654 struct cgraph_node
*node
;
1655 struct cgraph_varpool_node
*vnode
;
1657 if (!cgraph_global_info_ready
)
1659 node
= cgraph_node_for_identifier (id
);
1661 cgraph_mark_needed_node (node
, 1);
1664 vnode
= cgraph_varpool_node_for_identifier (id
);
1666 cgraph_varpool_mark_needed_node (vnode
);
1668 TREE_SYMBOL_REFERENCED (id
) = 1;
1671 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1672 If NAME starts with a *, the rest of NAME is output verbatim.
1673 Otherwise NAME is transformed in an implementation-defined way
1674 (usually by the addition of an underscore).
1675 Many macros in the tm file are defined to call this function. */
1678 assemble_name (FILE *file
, const char *name
)
1680 const char *real_name
;
1683 real_name
= (* targetm
.strip_name_encoding
) (name
);
1685 id
= maybe_get_identifier (real_name
);
1687 mark_referenced (id
);
1690 fputs (&name
[1], file
);
1692 ASM_OUTPUT_LABELREF (file
, name
);
1695 /* Allocate SIZE bytes writable static space with a gensym name
1696 and return an RTX to refer to its address. */
1699 assemble_static_space (unsigned HOST_WIDE_INT size
)
1702 const char *namestring
;
1706 if (flag_shared_data
)
1710 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1712 namestring
= ggc_strdup (name
);
1714 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1715 SYMBOL_REF_FLAGS (x
) = SYMBOL_FLAG_LOCAL
;
1717 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1718 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1721 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1722 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1725 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1726 so that each uninitialized object starts on such a boundary. */
1727 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1728 unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED
1729 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1730 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1731 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1732 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1739 /* Assemble the static constant template for function entry trampolines.
1740 This is done at most once per compilation.
1741 Returns an RTX for the address of the template. */
1743 #ifdef TRAMPOLINE_TEMPLATE
1745 assemble_trampoline_template (void)
1752 /* By default, put trampoline templates in read-only data section. */
1754 #ifdef TRAMPOLINE_SECTION
1755 TRAMPOLINE_SECTION ();
1757 readonly_data_section ();
1760 /* Write the assembler code to define one. */
1761 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1764 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1767 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LTRAMP", 0);
1768 TRAMPOLINE_TEMPLATE (asm_out_file
);
1770 /* Record the rtl to refer to it. */
1771 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1772 name
= ggc_strdup (label
);
1773 symbol
= gen_rtx_SYMBOL_REF (Pmode
, name
);
1774 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
1780 /* A and B are either alignments or offsets. Return the minimum alignment
1781 that may be assumed after adding the two together. */
1783 static inline unsigned
1784 min_align (unsigned int a
, unsigned int b
)
1786 return (a
| b
) & -(a
| b
);
1789 /* Return the assembler directive for creating a given kind of integer
1790 object. SIZE is the number of bytes in the object and ALIGNED_P
1791 indicates whether it is known to be aligned. Return NULL if the
1792 assembly dialect has no such directive.
1794 The returned string should be printed at the start of a new line and
1795 be followed immediately by the object's initial value. */
1798 integer_asm_op (int size
, int aligned_p
)
1800 struct asm_int_op
*ops
;
1803 ops
= &targetm
.asm_out
.aligned_op
;
1805 ops
= &targetm
.asm_out
.unaligned_op
;
1810 return targetm
.asm_out
.byte_op
;
1824 /* Use directive OP to assemble an integer object X. Print OP at the
1825 start of the line, followed immediately by the value of X. */
1828 assemble_integer_with_op (const char *op
, rtx x
)
1830 fputs (op
, asm_out_file
);
1831 output_addr_const (asm_out_file
, x
);
1832 fputc ('\n', asm_out_file
);
1835 /* The default implementation of the asm_out.integer target hook. */
1838 default_assemble_integer (rtx x ATTRIBUTE_UNUSED
,
1839 unsigned int size ATTRIBUTE_UNUSED
,
1840 int aligned_p ATTRIBUTE_UNUSED
)
1842 const char *op
= integer_asm_op (size
, aligned_p
);
1843 return op
&& (assemble_integer_with_op (op
, x
), true);
1846 /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is
1847 the alignment of the integer in bits. Return 1 if we were able to output
1848 the constant, otherwise 0. If FORCE is nonzero, abort if we can't output
1852 assemble_integer (rtx x
, unsigned int size
, unsigned int align
, int force
)
1856 aligned_p
= (align
>= MIN (size
* BITS_PER_UNIT
, BIGGEST_ALIGNMENT
));
1858 /* See if the target hook can handle this kind of object. */
1859 if ((*targetm
.asm_out
.integer
) (x
, size
, aligned_p
))
1862 /* If the object is a multi-byte one, try splitting it up. Split
1863 it into words it if is multi-word, otherwise split it into bytes. */
1866 enum machine_mode omode
, imode
;
1867 unsigned int subalign
;
1868 unsigned int subsize
, i
;
1870 subsize
= size
> UNITS_PER_WORD
? UNITS_PER_WORD
: 1;
1871 subalign
= MIN (align
, subsize
* BITS_PER_UNIT
);
1872 omode
= mode_for_size (subsize
* BITS_PER_UNIT
, MODE_INT
, 0);
1873 imode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1875 for (i
= 0; i
< size
; i
+= subsize
)
1877 rtx partial
= simplify_subreg (omode
, x
, imode
, i
);
1878 if (!partial
|| !assemble_integer (partial
, subsize
, subalign
, 0))
1884 /* If we've printed some of it, but not all of it, there's no going
1897 assemble_real (REAL_VALUE_TYPE d
, enum machine_mode mode
, unsigned int align
)
1901 unsigned int nalign
= min_align (align
, 32);
1903 switch (BITS_PER_UNIT
)
1909 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1910 assemble_integer (GEN_INT (l
), 4, align
, 1);
1913 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1914 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1915 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1918 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
1919 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1920 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1921 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
1924 REAL_VALUE_TO_TARGET_LONG_DOUBLE (d
, data
);
1925 assemble_integer (GEN_INT (data
[0]), 4, align
, 1);
1926 assemble_integer (GEN_INT (data
[1]), 4, nalign
, 1);
1927 assemble_integer (GEN_INT (data
[2]), 4, nalign
, 1);
1928 assemble_integer (GEN_INT (data
[3]), 4, nalign
, 1);
1939 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1940 assemble_integer (GEN_INT (l
), 2, align
, 1);
1943 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1944 assemble_integer (GEN_INT (data
[0]), 2, align
, 1);
1945 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
1956 REAL_VALUE_TO_TARGET_SINGLE (d
, l
);
1957 assemble_integer (GEN_INT (l
), 1, align
, 1);
1960 REAL_VALUE_TO_TARGET_DOUBLE (d
, data
);
1961 assemble_integer (GEN_INT (data
[0]), 1, align
, 1);
1962 assemble_integer (GEN_INT (data
[1]), 1, nalign
, 1);
1974 /* Given an expression EXP with a constant value,
1975 reduce it to the sum of an assembler symbol and an integer.
1976 Store them both in the structure *VALUE.
1977 Abort if EXP does not reduce. */
1979 struct addr_const
GTY(())
1982 HOST_WIDE_INT offset
;
1986 decode_addr_const (tree exp
, struct addr_const
*value
)
1988 tree target
= TREE_OPERAND (exp
, 0);
1994 if (TREE_CODE (target
) == COMPONENT_REF
1995 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
1998 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
1999 target
= TREE_OPERAND (target
, 0);
2001 else if (TREE_CODE (target
) == ARRAY_REF
2002 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2004 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2005 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2006 target
= TREE_OPERAND (target
, 0);
2012 switch (TREE_CODE (target
))
2016 x
= DECL_RTL (target
);
2020 x
= gen_rtx_MEM (FUNCTION_MODE
,
2021 gen_rtx_LABEL_REF (VOIDmode
, force_label_rtx (target
)));
2029 x
= output_constant_def (target
, 1);
2036 if (GET_CODE (x
) != MEM
)
2041 value
->offset
= offset
;
2044 /* We do RTX_UNSPEC + XINT (blah), so nothing can go after RTX_UNSPEC. */
2045 enum kind
{ RTX_UNKNOWN
, RTX_DOUBLE
, RTX_VECTOR
, RTX_INT
, RTX_UNSPEC
};
2046 struct rtx_const
GTY(())
2048 ENUM_BITFIELD(kind
) kind
: 16;
2049 ENUM_BITFIELD(machine_mode
) mode
: 16;
2050 union rtx_const_un
{
2051 REAL_VALUE_TYPE
GTY ((tag ("4"))) du
;
2052 struct rtx_const_u_addr
{
2055 HOST_WIDE_INT offset
;
2056 } GTY ((tag ("1"))) addr
;
2057 struct rtx_const_u_di
{
2060 } GTY ((tag ("0"))) di
;
2062 /* The max vector size we have is 16 wide; two variants for
2063 integral and floating point vectors. */
2064 struct rtx_const_int_vec
{
2067 } GTY ((tag ("2"))) int_vec
[16];
2069 REAL_VALUE_TYPE
GTY ((tag ("3"))) fp_vec
[8];
2071 } GTY ((desc ("%1.kind >= RTX_INT"), descbits ("1"))) un
;
2074 /* Uniquize all constants that appear in memory.
2075 Each constant in memory thus far output is recorded
2076 in `const_hash_table'. */
2078 struct constant_descriptor_tree
GTY(())
2080 /* A MEM for the constant. */
2083 /* The value of the constant. */
2087 static GTY((param_is (struct constant_descriptor_tree
)))
2088 htab_t const_desc_htab
;
2090 static struct constant_descriptor_tree
* build_constant_desc (tree
);
2091 static void maybe_output_constant_def_contents (struct constant_descriptor_tree
*, int);
2093 /* Compute a hash code for a constant expression. */
2096 const_desc_hash (const void *ptr
)
2098 return const_hash_1 (((struct constant_descriptor_tree
*)ptr
)->value
);
2102 const_hash_1 (const tree exp
)
2107 enum tree_code code
= TREE_CODE (exp
);
2109 /* Either set P and LEN to the address and len of something to hash and
2110 exit the switch or return a value. */
2115 p
= (char *) &TREE_INT_CST (exp
);
2116 len
= sizeof TREE_INT_CST (exp
);
2120 return real_hash (TREE_REAL_CST_PTR (exp
));
2123 p
= TREE_STRING_POINTER (exp
);
2124 len
= TREE_STRING_LENGTH (exp
);
2127 return (const_hash_1 (TREE_REALPART (exp
)) * 5
2128 + const_hash_1 (TREE_IMAGPART (exp
)));
2131 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2135 len
= int_size_in_bytes (TREE_TYPE (exp
));
2137 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2145 hi
= 5 + int_size_in_bytes (TREE_TYPE (exp
));
2147 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2148 if (TREE_VALUE (link
))
2149 hi
= hi
* 603 + const_hash_1 (TREE_VALUE (link
));
2157 struct addr_const value
;
2159 decode_addr_const (exp
, &value
);
2160 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2162 /* Don't hash the address of the SYMBOL_REF;
2163 only use the offset and the symbol name. */
2165 p
= XSTR (value
.base
, 0);
2166 for (i
= 0; p
[i
] != 0; i
++)
2167 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2169 else if (GET_CODE (value
.base
) == LABEL_REF
)
2170 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2178 return (const_hash_1 (TREE_OPERAND (exp
, 0)) * 9
2179 + const_hash_1 (TREE_OPERAND (exp
, 1)));
2183 case NON_LVALUE_EXPR
:
2184 return const_hash_1 (TREE_OPERAND (exp
, 0)) * 7 + 2;
2187 /* A language specific constant. Just hash the code. */
2191 /* Compute hashing function. */
2193 for (i
= 0; i
< len
; i
++)
2194 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2199 /* Wrapper of compare_constant, for the htab interface. */
2201 const_desc_eq (const void *p1
, const void *p2
)
2203 return compare_constant (((struct constant_descriptor_tree
*)p1
)->value
,
2204 ((struct constant_descriptor_tree
*)p2
)->value
);
2207 /* Compare t1 and t2, and return 1 only if they are known to result in
2208 the same bit pattern on output. */
2211 compare_constant (const tree t1
, const tree t2
)
2213 enum tree_code typecode
;
2215 if (t1
== NULL_TREE
)
2216 return t2
== NULL_TREE
;
2217 if (t2
== NULL_TREE
)
2220 if (TREE_CODE (t1
) != TREE_CODE (t2
))
2223 switch (TREE_CODE (t1
))
2226 /* Integer constants are the same only if the same width of type. */
2227 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2229 return tree_int_cst_equal (t1
, t2
);
2232 /* Real constants are the same only if the same width of type. */
2233 if (TYPE_PRECISION (TREE_TYPE (t1
)) != TYPE_PRECISION (TREE_TYPE (t2
)))
2236 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
2239 if (flag_writable_strings
)
2242 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
)))
2245 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
2246 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
2247 TREE_STRING_LENGTH (t1
)));
2250 return (compare_constant (TREE_REALPART (t1
), TREE_REALPART (t2
))
2251 && compare_constant (TREE_IMAGPART (t1
), TREE_IMAGPART (t2
)));
2254 typecode
= TREE_CODE (TREE_TYPE (t1
));
2255 if (typecode
!= TREE_CODE (TREE_TYPE (t2
)))
2258 if (typecode
== SET_TYPE
)
2260 int len
= int_size_in_bytes (TREE_TYPE (t2
));
2261 unsigned char *tmp1
, *tmp2
;
2263 if (int_size_in_bytes (TREE_TYPE (t1
)) != len
)
2266 tmp1
= alloca (len
);
2267 tmp2
= alloca (len
);
2269 if (get_set_constructor_bytes (t1
, tmp1
, len
) != NULL_TREE
)
2271 if (get_set_constructor_bytes (t2
, tmp2
, len
) != NULL_TREE
)
2274 return memcmp (tmp1
, tmp2
, len
) != 0;
2280 if (typecode
== ARRAY_TYPE
)
2282 HOST_WIDE_INT size_1
= int_size_in_bytes (TREE_TYPE (t1
));
2283 /* For arrays, check that the sizes all match. */
2284 if (TYPE_MODE (TREE_TYPE (t1
)) != TYPE_MODE (TREE_TYPE (t2
))
2286 || size_1
!= int_size_in_bytes (TREE_TYPE (t2
)))
2291 /* For record and union constructors, require exact type
2293 if (TREE_TYPE (t1
) != TREE_TYPE (t2
))
2297 for (l1
= CONSTRUCTOR_ELTS (t1
), l2
= CONSTRUCTOR_ELTS (t2
);
2299 l1
= TREE_CHAIN (l1
), l2
= TREE_CHAIN (l2
))
2301 /* Check that each value is the same... */
2302 if (! compare_constant (TREE_VALUE (l1
), TREE_VALUE (l2
)))
2304 /* ... and that they apply to the same fields! */
2305 if (typecode
== ARRAY_TYPE
)
2307 if (! compare_constant (TREE_PURPOSE (l1
),
2313 if (TREE_PURPOSE (l1
) != TREE_PURPOSE (l2
))
2318 return l1
== NULL_TREE
&& l2
== NULL_TREE
;
2324 struct addr_const value1
, value2
;
2326 decode_addr_const (t1
, &value1
);
2327 decode_addr_const (t2
, &value2
);
2328 return (value1
.offset
== value2
.offset
2329 && strcmp (XSTR (value1
.base
, 0), XSTR (value2
.base
, 0)) == 0);
2335 return (compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0))
2336 && compare_constant(TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1)));
2340 case NON_LVALUE_EXPR
:
2341 return compare_constant (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
2346 nt1
= (*lang_hooks
.expand_constant
) (t1
);
2347 nt2
= (*lang_hooks
.expand_constant
) (t2
);
2348 if (nt1
!= t1
|| nt2
!= t2
)
2349 return compare_constant (nt1
, nt2
);
2355 /* Should not get here. */
2359 /* Make a copy of the whole tree structure for a constant. This
2360 handles the same types of nodes that compare_constant handles. */
2363 copy_constant (tree exp
)
2365 switch (TREE_CODE (exp
))
2368 /* For ADDR_EXPR, we do not want to copy the decl whose address
2369 is requested. We do want to copy constants though. */
2370 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2371 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2372 copy_constant (TREE_OPERAND (exp
, 0)));
2374 return copy_node (exp
);
2379 return copy_node (exp
);
2382 return build_complex (TREE_TYPE (exp
),
2383 copy_constant (TREE_REALPART (exp
)),
2384 copy_constant (TREE_IMAGPART (exp
)));
2388 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2389 copy_constant (TREE_OPERAND (exp
, 0)),
2390 copy_constant (TREE_OPERAND (exp
, 1)));
2394 case NON_LVALUE_EXPR
:
2395 case VIEW_CONVERT_EXPR
:
2396 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2397 copy_constant (TREE_OPERAND (exp
, 0)));
2401 tree copy
= copy_node (exp
);
2402 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2405 CONSTRUCTOR_ELTS (copy
) = list
;
2406 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2407 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2408 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2409 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2410 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2418 t
= (*lang_hooks
.expand_constant
) (exp
);
2420 return copy_constant (t
);
2427 /* Subroutine of output_constant_def:
2428 No constant equal to EXP is known to have been output.
2429 Make a constant descriptor to enter EXP in the hash table.
2430 Assign the label number and construct RTL to refer to the
2431 constant's location in memory.
2432 Caller is responsible for updating the hash table. */
2434 static struct constant_descriptor_tree
*
2435 build_constant_desc (tree exp
)
2441 struct constant_descriptor_tree
*desc
;
2443 desc
= ggc_alloc (sizeof (*desc
));
2444 desc
->value
= copy_constant (exp
);
2446 /* Create a string containing the label name, in LABEL. */
2447 labelno
= const_labelno
++;
2448 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
2450 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2451 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
2452 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
2453 SYMBOL_REF_DECL (symbol
) = desc
->value
;
2454 TREE_CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
2456 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)), symbol
);
2457 set_mem_attributes (rtl
, exp
, 1);
2458 set_mem_alias_set (rtl
, 0);
2459 set_mem_alias_set (rtl
, const_alias_set
);
2461 /* Set flags or add text to the name to record information, such as
2462 that it is a local symbol. If the name is changed, the macro
2463 ASM_OUTPUT_LABELREF will have to know how to strip this
2464 information. This call might invalidate our local variable
2465 SYMBOL; we can't use it afterward. */
2467 (*targetm
.encode_section_info
) (exp
, rtl
, true);
2474 /* Return an rtx representing a reference to constant data in memory
2475 for the constant expression EXP.
2477 If assembler code for such a constant has already been output,
2478 return an rtx to refer to it.
2479 Otherwise, output such a constant in memory
2480 and generate an rtx for it.
2482 If DEFER is nonzero, this constant can be deferred and output only
2483 if referenced in the function after all optimizations.
2485 The const_hash_table records which constants already have label strings. */
2488 output_constant_def (tree exp
, int defer
)
2490 struct constant_descriptor_tree
*desc
;
2491 struct constant_descriptor_tree key
;
2494 /* Look up EXP in the table of constant descriptors. If we didn't find
2495 it, create a new one. */
2497 loc
= htab_find_slot (const_desc_htab
, &key
, INSERT
);
2502 desc
= build_constant_desc (exp
);
2506 maybe_output_constant_def_contents (desc
, defer
);
2510 /* Subroutine of output_constant_def: Decide whether or not we need to
2511 output the constant DESC now, and if so, do it. */
2513 maybe_output_constant_def_contents (struct constant_descriptor_tree
*desc
,
2516 rtx symbol
= XEXP (desc
->rtl
, 0);
2517 tree exp
= desc
->value
;
2519 if (flag_syntax_only
)
2522 if (TREE_ASM_WRITTEN (exp
))
2523 /* Already output; don't do it again. */
2526 /* The only constants that cannot safely be deferred, assuming the
2527 context allows it, are strings under flag_writable_strings. */
2528 if (defer
&& (TREE_CODE (exp
) != STRING_CST
|| !flag_writable_strings
))
2530 /* Increment n_deferred_constants if it exists. It needs to be at
2531 least as large as the number of constants actually referred to
2532 by the function. If it's too small we'll stop looking too early
2533 and fail to emit constants; if it's too large we'll only look
2534 through the entire function when we could have stopped earlier. */
2536 n_deferred_constants
++;
2540 output_constant_def_contents (symbol
);
2543 /* We must output the constant data referred to by SYMBOL; do so. */
2546 output_constant_def_contents (rtx symbol
)
2548 tree exp
= SYMBOL_REF_DECL (symbol
);
2549 const char *label
= XSTR (symbol
, 0);
2552 /* Make sure any other constants whose addresses appear in EXP
2553 are assigned label numbers. */
2554 int reloc
= output_addressed_constants (exp
);
2556 /* Align the location counter as required by EXP's data type. */
2557 int align
= TYPE_ALIGN (TREE_TYPE (exp
));
2558 #ifdef CONSTANT_ALIGNMENT
2559 align
= CONSTANT_ALIGNMENT (exp
, align
);
2562 /* We are no longer deferring this constant. */
2563 TREE_ASM_WRITTEN (exp
) = 1;
2565 if (IN_NAMED_SECTION (exp
))
2566 named_section (exp
, NULL
, reloc
);
2568 (*targetm
.asm_out
.select_section
) (exp
, reloc
, align
);
2570 if (align
> BITS_PER_UNIT
)
2572 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2575 size
= int_size_in_bytes (TREE_TYPE (exp
));
2576 if (TREE_CODE (exp
) == STRING_CST
)
2577 size
= MAX (TREE_STRING_LENGTH (exp
), size
);
2579 /* Do any machine/system dependent processing of the constant. */
2580 #ifdef ASM_DECLARE_CONSTANT_NAME
2581 ASM_DECLARE_CONSTANT_NAME (asm_out_file
, label
, exp
, size
);
2583 /* Standard thing is just output label for the constant. */
2584 ASM_OUTPUT_LABEL (asm_out_file
, label
);
2585 #endif /* ASM_DECLARE_CONSTANT_NAME */
2587 /* Output the value of EXP. */
2588 output_constant (exp
, size
, align
);
2591 /* A constant which was deferred in its original location has been
2592 inserted by the RTL inliner into a different function. The
2593 current function's deferred constant count must be incremented. */
2595 notice_rtl_inlining_of_deferred_constant (void)
2597 n_deferred_constants
++;
2600 /* Look up EXP in the table of constant descriptors. Return the rtl
2601 if it has been emitted, else null. */
2604 lookup_constant_def (tree exp
)
2606 struct constant_descriptor_tree
*desc
;
2607 struct constant_descriptor_tree key
;
2610 desc
= htab_find (const_desc_htab
, &key
);
2612 return (desc
? desc
->rtl
: NULL_RTX
);
2615 /* Used in the hash tables to avoid outputting the same constant
2616 twice. Unlike 'struct constant_descriptor_tree', RTX constants
2617 are output once per function, not once per file; there seems
2618 to be no reason for the difference. */
2620 struct constant_descriptor_rtx
GTY(())
2622 /* More constant_descriptors with the same hash code. */
2623 struct constant_descriptor_rtx
*next
;
2625 /* A MEM for the constant. */
2628 /* The value of the constant. */
2629 struct rtx_const value
;
2632 /* Structure to represent sufficient information about a constant so that
2633 it can be output when the constant pool is output, so that function
2634 integration can be done, and to simplify handling on machines that reference
2635 constant pool as base+displacement. */
2637 struct pool_constant
GTY(())
2639 struct constant_descriptor_rtx
*desc
;
2640 struct pool_constant
*next
;
2641 struct pool_constant
*next_sym
;
2643 enum machine_mode mode
;
2646 HOST_WIDE_INT offset
;
2650 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2651 The argument is XSTR (... , 0) */
2653 #define SYMHASH(LABEL) (((unsigned long) (LABEL)) % MAX_RTX_HASH_TABLE)
2655 /* Initialize constant pool hashing for a new function. */
2658 init_varasm_status (struct function
*f
)
2660 struct varasm_status
*p
;
2661 p
= ggc_alloc (sizeof (struct varasm_status
));
2663 p
->x_const_rtx_hash_table
2664 = ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2665 * sizeof (struct constant_descriptor_rtx
*));
2666 p
->x_const_rtx_sym_hash_table
2667 = ggc_alloc_cleared (MAX_RTX_HASH_TABLE
2668 * sizeof (struct pool_constant
*));
2670 p
->x_first_pool
= p
->x_last_pool
= 0;
2671 p
->x_pool_offset
= 0;
2672 p
->deferred_constants
= 0;
2676 /* Express an rtx for a constant integer (perhaps symbolic)
2677 as the sum of a symbol or label plus an explicit integer.
2678 They are stored into VALUE. */
2681 decode_rtx_const (enum machine_mode mode
, rtx x
, struct rtx_const
*value
)
2683 /* Clear the whole structure, including any gaps. */
2684 memset (value
, 0, sizeof (struct rtx_const
));
2686 value
->kind
= RTX_INT
; /* Most usual kind. */
2689 switch (GET_CODE (x
))
2692 value
->kind
= RTX_DOUBLE
;
2693 if (GET_MODE (x
) != VOIDmode
)
2695 const REAL_VALUE_TYPE
*r
= CONST_DOUBLE_REAL_VALUE (x
);
2697 value
->mode
= GET_MODE (x
);
2699 /* Copy the REAL_VALUE_TYPE by members so that we don't
2700 copy garbage from the original structure into our
2701 carefully cleaned hashing structure. */
2702 value
->un
.du
.class = r
->class;
2703 value
->un
.du
.sign
= r
->sign
;
2710 value
->un
.du
.exp
= r
->exp
;
2713 memcpy (value
->un
.du
.sig
, r
->sig
, sizeof (r
->sig
));
2721 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
2722 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
2730 units
= CONST_VECTOR_NUNITS (x
);
2731 value
->kind
= RTX_VECTOR
;
2734 if (GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
)
2736 for (i
= 0; i
< units
; ++i
)
2738 rtx elt
= CONST_VECTOR_ELT (x
, i
);
2739 if (GET_CODE (elt
) == CONST_INT
)
2741 value
->un
.int_vec
[i
].low
= INTVAL (elt
);
2742 value
->un
.int_vec
[i
].high
= 0;
2746 value
->un
.int_vec
[i
].low
= CONST_DOUBLE_LOW (elt
);
2747 value
->un
.int_vec
[i
].high
= CONST_DOUBLE_HIGH (elt
);
2751 else if (GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
)
2753 for (i
= 0; i
< units
; ++i
)
2755 const REAL_VALUE_TYPE
*r
2756 = CONST_DOUBLE_REAL_VALUE (CONST_VECTOR_ELT (x
, i
));
2757 REAL_VALUE_TYPE
*d
= &value
->un
.fp_vec
[i
];
2759 /* Copy the REAL_VALUE_TYPE by members so that we don't
2760 copy garbage from the original structure into our
2761 carefully cleaned hashing structure. */
2762 d
->class = r
->class;
2773 memcpy (d
->sig
, r
->sig
, sizeof (r
->sig
));
2786 value
->un
.addr
.offset
= INTVAL (x
);
2792 value
->un
.addr
.base
= x
;
2797 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
2799 value
->un
.addr
.base
= XEXP (x
, 0);
2800 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
2802 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
2804 value
->un
.addr
.base
= XEXP (x
, 0);
2805 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
2809 value
->un
.addr
.base
= x
;
2810 value
->un
.addr
.offset
= 0;
2815 value
->kind
= RTX_UNKNOWN
;
2819 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0
2820 && GET_CODE (value
->un
.addr
.base
) == UNSPEC
)
2822 /* For a simple UNSPEC, the base is set to the
2823 operand, the kind field is set to the index of
2824 the unspec expression.
2825 Together with the code below, in case that
2826 the operand is a SYMBOL_REF or LABEL_REF,
2827 the address of the string or the code_label
2828 is taken as base. */
2829 if (XVECLEN (value
->un
.addr
.base
, 0) == 1)
2831 value
->kind
= RTX_UNSPEC
+ XINT (value
->un
.addr
.base
, 1);
2832 value
->un
.addr
.base
= XVECEXP (value
->un
.addr
.base
, 0, 0);
2836 if (value
->kind
>= RTX_INT
&& value
->un
.addr
.base
!= 0)
2837 switch (GET_CODE (value
->un
.addr
.base
))
2840 /* Use the string's address, not the SYMBOL_REF's address,
2841 for the sake of addresses of library routines. */
2842 value
->un
.addr
.symbol
= XSTR (value
->un
.addr
.base
, 0);
2843 value
->un
.addr
.base
= NULL_RTX
;
2847 /* For a LABEL_REF, compare labels. */
2848 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
2855 /* Given a MINUS expression, simplify it if both sides
2856 include the same symbol. */
2859 simplify_subtraction (rtx x
)
2861 struct rtx_const val0
, val1
;
2863 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
2864 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
2866 if (val0
.kind
>= RTX_INT
2867 && val0
.kind
== val1
.kind
2868 && val0
.un
.addr
.base
== val1
.un
.addr
.base
2869 && val0
.un
.addr
.symbol
== val1
.un
.addr
.symbol
)
2870 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
2875 /* Compute a hash code for a constant RTL expression. */
2878 const_hash_rtx (enum machine_mode mode
, rtx x
)
2881 struct rtx_const value
;
2882 unsigned int data
[sizeof(struct rtx_const
) / sizeof (unsigned int)];
2888 decode_rtx_const (mode
, x
, &u
.value
);
2890 /* Compute hashing function. */
2892 for (i
= 0; i
< ARRAY_SIZE (u
.data
); i
++)
2893 hi
= hi
* 613 + u
.data
[i
];
2895 return hi
% MAX_RTX_HASH_TABLE
;
2898 /* Compare a constant rtl object X with a constant-descriptor DESC.
2899 Return 1 if DESC describes a constant with the same value as X. */
2902 compare_constant_rtx (enum machine_mode mode
, rtx x
,
2903 struct constant_descriptor_rtx
*desc
)
2905 struct rtx_const value
;
2907 decode_rtx_const (mode
, x
, &value
);
2909 /* Compare constant contents. */
2910 return memcmp (&value
, &desc
->value
, sizeof (struct rtx_const
)) == 0;
2913 /* Construct a constant descriptor for the rtl-expression X.
2914 It is up to the caller to enter the descriptor in the hash table. */
2916 static struct constant_descriptor_rtx
*
2917 record_constant_rtx (enum machine_mode mode
, rtx x
)
2919 struct constant_descriptor_rtx
*ptr
;
2921 ptr
= ggc_alloc (sizeof (*ptr
));
2922 decode_rtx_const (mode
, x
, &ptr
->value
);
2927 /* Given a constant rtx X, make (or find) a memory constant for its value
2928 and return a MEM rtx to refer to it in memory. */
2931 force_const_mem (enum machine_mode mode
, rtx x
)
2934 struct constant_descriptor_rtx
*desc
;
2937 struct pool_constant
*pool
;
2940 /* If we're not allowed to drop X into the constant pool, don't. */
2941 if ((*targetm
.cannot_force_const_mem
) (x
))
2944 /* Compute hash code of X. Search the descriptors for that hash code
2945 to see if any of them describes X. If yes, we have an rtx to use. */
2946 hash
= const_hash_rtx (mode
, x
);
2947 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
2948 if (compare_constant_rtx (mode
, x
, desc
))
2951 /* No constant equal to X is known to have been output.
2952 Make a constant descriptor to enter X in the hash table
2953 and make a MEM for it. */
2954 desc
= record_constant_rtx (mode
, x
);
2955 desc
->next
= const_rtx_hash_table
[hash
];
2956 const_rtx_hash_table
[hash
] = desc
;
2958 /* Align the location counter as required by EXP's data type. */
2959 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
2960 #ifdef CONSTANT_ALIGNMENT
2962 tree type
= (*lang_hooks
.types
.type_for_mode
) (mode
, 0);
2963 if (type
!= NULL_TREE
)
2964 align
= CONSTANT_ALIGNMENT (make_tree (type
, x
), align
);
2968 pool_offset
+= (align
/ BITS_PER_UNIT
) - 1;
2969 pool_offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
2971 if (GET_CODE (x
) == LABEL_REF
)
2972 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
2974 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
2975 pool
= ggc_alloc (sizeof (struct pool_constant
));
2979 pool
->labelno
= const_labelno
;
2980 pool
->align
= align
;
2981 pool
->offset
= pool_offset
;
2988 last_pool
->next
= pool
;
2991 pool_offset
+= GET_MODE_SIZE (mode
);
2993 /* Create a string containing the label name, in LABEL. */
2994 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2998 /* Construct the SYMBOL_REF and the MEM. */
3000 symbol
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (label
));
3001 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
3003 pool
->desc
->rtl
= def
= gen_rtx_MEM (mode
, symbol
);
3004 set_mem_attributes (def
, (*lang_hooks
.types
.type_for_mode
) (mode
, 0), 1);
3005 RTX_UNCHANGING_P (def
) = 1;
3007 /* Add label to symbol hash table. */
3008 hash
= SYMHASH (XSTR (symbol
, 0));
3009 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3010 const_rtx_sym_hash_table
[hash
] = pool
;
3012 /* Mark the symbol_ref as belonging to this constants pool. */
3013 CONSTANT_POOL_ADDRESS_P (symbol
) = 1;
3014 SYMBOL_REF_FLAGS (symbol
) = SYMBOL_FLAG_LOCAL
;
3015 current_function_uses_const_pool
= 1;
3020 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3021 the corresponding pool_constant structure. */
3023 static struct pool_constant
*
3024 find_pool_constant (struct function
*f
, rtx addr
)
3026 struct pool_constant
*pool
;
3027 const char *label
= XSTR (addr
, 0);
3029 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3030 pool
= pool
->next_sym
)
3031 if (XSTR (XEXP (pool
->desc
->rtl
, 0), 0) == label
)
3037 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3040 get_pool_constant (rtx addr
)
3042 return (find_pool_constant (cfun
, addr
))->constant
;
3045 /* Given a constant pool SYMBOL_REF, return the corresponding constant
3046 and whether it has been output or not. */
3049 get_pool_constant_mark (rtx addr
, bool *pmarked
)
3051 struct pool_constant
*pool
= find_pool_constant (cfun
, addr
);
3052 *pmarked
= (pool
->mark
!= 0);
3053 return pool
->constant
;
3056 /* Likewise, but for the constant pool of a specific function. */
3059 get_pool_constant_for_function (struct function
*f
, rtx addr
)
3061 return (find_pool_constant (f
, addr
))->constant
;
3064 /* Similar, return the mode. */
3067 get_pool_mode (rtx addr
)
3069 return (find_pool_constant (cfun
, addr
))->mode
;
3073 get_pool_mode_for_function (struct function
*f
, rtx addr
)
3075 return (find_pool_constant (f
, addr
))->mode
;
3078 /* Similar, return the offset in the constant pool. */
3081 get_pool_offset (rtx addr
)
3083 return (find_pool_constant (cfun
, addr
))->offset
;
3086 /* Return the size of the constant pool. */
3089 get_pool_size (void)
3094 /* Write all the constants in the constant pool. */
3097 output_constant_pool (const char *fnname ATTRIBUTE_UNUSED
,
3098 tree fndecl ATTRIBUTE_UNUSED
)
3100 struct pool_constant
*pool
;
3104 /* It is possible for gcc to call force_const_mem and then to later
3105 discard the instructions which refer to the constant. In such a
3106 case we do not need to output the constant. */
3107 mark_constant_pool ();
3109 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3110 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3113 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3122 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3123 whose CODE_LABEL has been deleted. This can occur if a jump table
3124 is eliminated by optimization. If so, write a constant of zero
3125 instead. Note that this can also happen by turning the
3126 CODE_LABEL into a NOTE. */
3127 /* ??? This seems completely and utterly wrong. Certainly it's
3128 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3129 functioning even with INSN_DELETED_P and friends. */
3132 switch (GET_CODE (x
))
3135 if (GET_CODE (XEXP (x
, 0)) != PLUS
3136 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3138 tmp
= XEXP (XEXP (x
, 0), 0);
3143 if (INSN_DELETED_P (tmp
)
3144 || (GET_CODE (tmp
) == NOTE
3145 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3156 /* First switch to correct section. */
3157 (*targetm
.asm_out
.select_rtx_section
) (pool
->mode
, x
, pool
->align
);
3159 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3160 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3161 pool
->align
, pool
->labelno
, done
);
3164 assemble_align (pool
->align
);
3166 /* Output the label. */
3167 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LC", pool
->labelno
);
3169 /* Output the value of the constant itself. */
3170 switch (GET_MODE_CLASS (pool
->mode
))
3173 if (GET_CODE (x
) != CONST_DOUBLE
)
3176 REAL_VALUE_FROM_CONST_DOUBLE (r
, x
);
3177 assemble_real (r
, pool
->mode
, pool
->align
);
3181 case MODE_PARTIAL_INT
:
3182 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), pool
->align
, 1);
3185 case MODE_VECTOR_FLOAT
:
3190 if (GET_CODE (x
) != CONST_VECTOR
)
3193 units
= CONST_VECTOR_NUNITS (x
);
3195 for (i
= 0; i
< units
; i
++)
3197 elt
= CONST_VECTOR_ELT (x
, i
);
3198 REAL_VALUE_FROM_CONST_DOUBLE (r
, elt
);
3199 assemble_real (r
, GET_MODE_INNER (pool
->mode
), pool
->align
);
3204 case MODE_VECTOR_INT
:
3209 if (GET_CODE (x
) != CONST_VECTOR
)
3212 units
= CONST_VECTOR_NUNITS (x
);
3214 for (i
= 0; i
< units
; i
++)
3216 elt
= CONST_VECTOR_ELT (x
, i
);
3217 assemble_integer (elt
, GET_MODE_UNIT_SIZE (pool
->mode
),
3227 /* Make sure all constants in SECTION_MERGE and not SECTION_STRINGS
3228 sections have proper size. */
3229 if (pool
->align
> GET_MODE_BITSIZE (pool
->mode
)
3230 && in_section
== in_named
3231 && get_named_section_flags (in_named_name
) & SECTION_MERGE
)
3232 assemble_align (pool
->align
);
3234 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3239 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3240 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3243 /* Done with this pool. */
3244 first_pool
= last_pool
= 0;
3247 /* Look through the instructions for this function, and mark all the
3248 entries in the constant pool which are actually being used. Emit
3249 deferred constants which have indeed been used. */
3252 mark_constant_pool (void)
3256 struct pool_constant
*pool
;
3258 if (first_pool
== 0 && n_deferred_constants
== 0)
3261 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3264 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3266 mark_constants (PATTERN (insn
));
3268 for (link
= current_function_epilogue_delay_list
;
3270 link
= XEXP (link
, 1))
3272 insn
= XEXP (link
, 0);
3275 mark_constants (PATTERN (insn
));
3279 /* Look through appropriate parts of X, marking all entries in the
3280 constant pool which are actually being used. Entries that are only
3281 referenced by other constants are also marked as used. Emit
3282 deferred strings that are used. */
3285 mark_constants (rtx x
)
3288 const char *format_ptr
;
3293 if (GET_CODE (x
) == SYMBOL_REF
)
3295 mark_constant (&x
, NULL
);
3299 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3300 insns, not any notes that may be attached. We don't want to mark
3301 a constant just because it happens to appear in a REG_EQUIV note. */
3304 mark_constants (PATTERN (x
));
3308 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3310 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3312 switch (*format_ptr
++)
3315 mark_constants (XEXP (x
, i
));
3319 if (XVEC (x
, i
) != 0)
3323 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3324 mark_constants (XVECEXP (x
, i
, j
));
3344 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3345 to as used. Emit referenced deferred strings. This function can
3346 be used with for_each_rtx to mark all SYMBOL_REFs in an rtx. */
3349 mark_constant (rtx
*current_rtx
, void *data ATTRIBUTE_UNUSED
)
3351 rtx x
= *current_rtx
;
3356 else if (GET_CODE (x
) == SYMBOL_REF
)
3358 if (CONSTANT_POOL_ADDRESS_P (x
))
3360 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3361 if (pool
->mark
== 0)
3364 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3369 else if (TREE_CONSTANT_POOL_ADDRESS_P (x
))
3371 tree exp
= SYMBOL_REF_DECL (x
);
3372 if (!TREE_ASM_WRITTEN (exp
))
3374 n_deferred_constants
--;
3375 output_constant_def_contents (x
);
3382 /* Find all the constants whose addresses are referenced inside of EXP,
3383 and make sure assembler code with a label has been output for each one.
3384 Indicate whether an ADDR_EXPR has been encountered. */
3387 output_addressed_constants (tree exp
)
3389 int reloc
= 0, reloc2
;
3392 /* Give the front-end a chance to convert VALUE to something that
3393 looks more like a constant to the back-end. */
3394 exp
= (*lang_hooks
.expand_constant
) (exp
);
3396 switch (TREE_CODE (exp
))
3400 /* Go inside any operations that get_inner_reference can handle and see
3401 if what's inside is a constant: no need to do anything here for
3402 addresses of variables or functions. */
3403 for (tem
= TREE_OPERAND (exp
, 0); handled_component_p (tem
);
3404 tem
= TREE_OPERAND (tem
, 0))
3407 if (TREE_CODE_CLASS (TREE_CODE (tem
)) == 'c'
3408 || TREE_CODE (tem
) == CONSTRUCTOR
)
3409 output_constant_def (tem
, 0);
3411 if (TREE_PUBLIC (tem
))
3418 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3419 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3423 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3424 reloc2
= output_addressed_constants (TREE_OPERAND (exp
, 1));
3425 /* The difference of two local labels is computable at link time. */
3426 if (reloc
== 1 && reloc2
== 1)
3434 case NON_LVALUE_EXPR
:
3435 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3439 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
; tem
= TREE_CHAIN (tem
))
3440 if (TREE_VALUE (tem
) != 0)
3441 reloc
|= output_addressed_constants (TREE_VALUE (tem
));
3451 /* Return nonzero if VALUE is a valid constant-valued expression
3452 for use in initializing a static variable; one that can be an
3453 element of a "constant" initializer.
3455 Return null_pointer_node if the value is absolute;
3456 if it is relocatable, return the variable that determines the relocation.
3457 We assume that VALUE has been folded as much as possible;
3458 therefore, we do not need to check for such things as
3459 arithmetic-combinations of integers. */
3462 initializer_constant_valid_p (tree value
, tree endtype
)
3464 /* Give the front-end a chance to convert VALUE to something that
3465 looks more like a constant to the back-end. */
3466 value
= (*lang_hooks
.expand_constant
) (value
);
3468 switch (TREE_CODE (value
))
3471 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
3472 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
3473 && TREE_CONSTANT (value
)
3474 && CONSTRUCTOR_ELTS (value
))
3476 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
3479 return TREE_STATIC (value
) ? null_pointer_node
: 0;
3486 return null_pointer_node
;
3490 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
3492 case VIEW_CONVERT_EXPR
:
3493 case NON_LVALUE_EXPR
:
3494 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3498 /* Allow conversions between pointer types. */
3499 if (POINTER_TYPE_P (TREE_TYPE (value
))
3500 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3501 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3503 /* Allow conversions between real types. */
3504 if (FLOAT_TYPE_P (TREE_TYPE (value
))
3505 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3506 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3508 /* Allow length-preserving conversions between integer types. */
3509 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3510 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3511 && (TYPE_PRECISION (TREE_TYPE (value
))
3512 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3513 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
3515 /* Allow conversions between other integer types only if
3517 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3518 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3520 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3522 if (inner
== null_pointer_node
)
3523 return null_pointer_node
;
3527 /* Allow (int) &foo provided int is as wide as a pointer. */
3528 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
3529 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
3530 && (TYPE_PRECISION (TREE_TYPE (value
))
3531 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
3532 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3535 /* Likewise conversions from int to pointers, but also allow
3536 conversions from 0. */
3537 if (POINTER_TYPE_P (TREE_TYPE (value
))
3538 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
3540 if (integer_zerop (TREE_OPERAND (value
, 0)))
3541 return null_pointer_node
;
3542 else if (TYPE_PRECISION (TREE_TYPE (value
))
3543 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
3544 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3548 /* Allow conversions to union types if the value inside is okay. */
3549 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
3550 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3555 if (! INTEGRAL_TYPE_P (endtype
)
3556 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3558 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3560 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3562 /* If either term is absolute, use the other terms relocation. */
3563 if (valid0
== null_pointer_node
)
3565 if (valid1
== null_pointer_node
)
3571 if (! INTEGRAL_TYPE_P (endtype
)
3572 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
3574 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
3576 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
3578 /* Win if second argument is absolute. */
3579 if (valid1
== null_pointer_node
)
3581 /* Win if both arguments have the same relocation.
3582 Then the value is absolute. */
3583 if (valid0
== valid1
&& valid0
!= 0)
3584 return null_pointer_node
;
3586 /* Since GCC guarantees that string constants are unique in the
3587 generated code, a subtraction between two copies of the same
3588 constant string is absolute. */
3589 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
3590 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
3591 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
3592 return null_pointer_node
;
3595 /* Support differences between labels. */
3596 if (INTEGRAL_TYPE_P (endtype
))
3599 op0
= TREE_OPERAND (value
, 0);
3600 op1
= TREE_OPERAND (value
, 1);
3602 /* Like STRIP_NOPS except allow the operand mode to widen.
3603 This works around a feature of fold that simplifies
3604 (int)(p1 - p2) to ((int)p1 - (int)p2) under the theory
3605 that the narrower operation is cheaper. */
3607 while (TREE_CODE (op0
) == NOP_EXPR
3608 || TREE_CODE (op0
) == CONVERT_EXPR
3609 || TREE_CODE (op0
) == NON_LVALUE_EXPR
)
3611 tree inner
= TREE_OPERAND (op0
, 0);
3612 if (inner
== error_mark_node
3613 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3614 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0
)))
3615 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3620 while (TREE_CODE (op1
) == NOP_EXPR
3621 || TREE_CODE (op1
) == CONVERT_EXPR
3622 || TREE_CODE (op1
) == NON_LVALUE_EXPR
)
3624 tree inner
= TREE_OPERAND (op1
, 0);
3625 if (inner
== error_mark_node
3626 || ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner
)))
3627 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1
)))
3628 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner
)))))
3633 if (TREE_CODE (op0
) == ADDR_EXPR
3634 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
3635 && TREE_CODE (op1
) == ADDR_EXPR
3636 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
3637 return null_pointer_node
;
3648 /* Output assembler code for constant EXP to FILE, with no label.
3649 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3650 Assumes output_addressed_constants has been done on EXP already.
3652 Generate exactly SIZE bytes of assembler data, padding at the end
3653 with zeros if necessary. SIZE must always be specified.
3655 SIZE is important for structure constructors,
3656 since trailing members may have been omitted from the constructor.
3657 It is also important for initialization of arrays from string constants
3658 since the full length of the string constant might not be wanted.
3659 It is also needed for initialization of unions, where the initializer's
3660 type is just one member, and that may not be as long as the union.
3662 There a case in which we would fail to output exactly SIZE bytes:
3663 for a structure constructor that wants to produce more than SIZE bytes.
3664 But such constructors will never be generated for any possible input.
3666 ALIGN is the alignment of the data in bits. */
3669 output_constant (tree exp
, unsigned HOST_WIDE_INT size
, unsigned int align
)
3671 enum tree_code code
;
3672 unsigned HOST_WIDE_INT thissize
;
3674 /* Some front-ends use constants other than the standard language-independent
3675 varieties, but which may still be output directly. Give the front-end a
3676 chance to convert EXP to a language-independent representation. */
3677 exp
= (*lang_hooks
.expand_constant
) (exp
);
3679 if (size
== 0 || flag_syntax_only
)
3682 /* Eliminate any conversions since we'll be outputting the underlying
3684 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3685 || TREE_CODE (exp
) == NON_LVALUE_EXPR
3686 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3687 exp
= TREE_OPERAND (exp
, 0);
3689 code
= TREE_CODE (TREE_TYPE (exp
));
3690 thissize
= int_size_in_bytes (TREE_TYPE (exp
));
3692 /* Allow a constructor with no elements for any data type.
3693 This means to fill the space with zeros. */
3694 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3696 assemble_zeros (size
);
3700 if (TREE_CODE (exp
) == FDESC_EXPR
)
3702 #ifdef ASM_OUTPUT_FDESC
3703 HOST_WIDE_INT part
= tree_low_cst (TREE_OPERAND (exp
, 1), 0);
3704 tree decl
= TREE_OPERAND (exp
, 0);
3705 ASM_OUTPUT_FDESC (asm_out_file
, decl
, part
);
3712 /* Now output the underlying data. If we've handling the padding, return.
3713 Otherwise, break and ensure THISSIZE is the size written. */
3721 case REFERENCE_TYPE
:
3723 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3724 EXPAND_INITIALIZER
),
3726 error ("initializer for integer value is too complicated");
3730 if (TREE_CODE (exp
) != REAL_CST
)
3731 error ("initializer for floating value is not a floating constant");
3733 assemble_real (TREE_REAL_CST (exp
),
3734 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0),
3739 output_constant (TREE_REALPART (exp
), thissize
/ 2, align
);
3740 output_constant (TREE_IMAGPART (exp
), thissize
/ 2,
3741 min_align (align
, BITS_PER_UNIT
* (thissize
/ 2)));
3746 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3748 output_constructor (exp
, size
, align
);
3751 else if (TREE_CODE (exp
) == STRING_CST
)
3753 thissize
= MIN ((unsigned HOST_WIDE_INT
)TREE_STRING_LENGTH (exp
),
3755 assemble_string (TREE_STRING_POINTER (exp
), thissize
);
3757 else if (TREE_CODE (exp
) == VECTOR_CST
)
3761 unsigned int nalign
;
3762 enum machine_mode inner
;
3764 inner
= GET_MODE_INNER (TYPE_MODE (TREE_TYPE (exp
)));
3765 nalign
= MIN (align
, GET_MODE_ALIGNMENT (inner
));
3767 elt_size
= GET_MODE_UNIT_SIZE (TYPE_MODE (TREE_TYPE (exp
)));
3769 link
= TREE_VECTOR_CST_ELTS (exp
);
3770 output_constant (TREE_VALUE (link
), elt_size
, align
);
3771 while ((link
= TREE_CHAIN (link
)) != NULL
)
3772 output_constant (TREE_VALUE (link
), elt_size
, nalign
);
3780 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3781 output_constructor (exp
, size
, align
);
3787 if (TREE_CODE (exp
) == INTEGER_CST
)
3788 assemble_integer (expand_expr (exp
, NULL_RTX
,
3789 VOIDmode
, EXPAND_INITIALIZER
),
3790 thissize
, align
, 1);
3791 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3793 unsigned char *buffer
= alloca (thissize
);
3794 if (get_set_constructor_bytes (exp
, buffer
, thissize
))
3796 assemble_string ((char *) buffer
, thissize
);
3799 error ("unknown set constructor type");
3809 if (size
> thissize
)
3810 assemble_zeros (size
- thissize
);
3814 /* Subroutine of output_constructor, used for computing the size of
3815 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
3816 type with an unspecified upper bound. */
3818 static unsigned HOST_WIDE_INT
3819 array_size_for_constructor (tree val
)
3823 /* This code used to attempt to handle string constants that are not
3824 arrays of single-bytes, but nothing else does, so there's no point in
3826 if (TREE_CODE (val
) == STRING_CST
)
3827 return TREE_STRING_LENGTH (val
);
3829 max_index
= NULL_TREE
;
3830 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
3832 tree index
= TREE_PURPOSE (i
);
3834 if (TREE_CODE (index
) == RANGE_EXPR
)
3835 index
= TREE_OPERAND (index
, 1);
3836 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
3840 if (max_index
== NULL_TREE
)
3843 /* Compute the total number of array elements. */
3844 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
3846 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
3847 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
3849 /* Multiply by the array element unit size to find number of bytes. */
3850 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
3852 return tree_low_cst (i
, 1);
3855 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
3856 Generate at least SIZE bytes, padding if necessary. */
3859 output_constructor (tree exp
, unsigned HOST_WIDE_INT size
,
3862 tree type
= TREE_TYPE (exp
);
3863 tree link
, field
= 0;
3865 /* Number of bytes output or skipped so far.
3866 In other words, current position within the constructor. */
3867 HOST_WIDE_INT total_bytes
= 0;
3868 /* Nonzero means BYTE contains part of a byte, to be output. */
3869 int byte_buffer_in_use
= 0;
3872 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3875 if (TREE_CODE (type
) == RECORD_TYPE
)
3876 field
= TYPE_FIELDS (type
);
3878 if (TREE_CODE (type
) == ARRAY_TYPE
3879 && TYPE_DOMAIN (type
) != 0)
3880 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
3882 /* As LINK goes through the elements of the constant,
3883 FIELD goes through the structure fields, if the constant is a structure.
3884 if the constant is a union, then we override this,
3885 by getting the field from the TREE_LIST element.
3886 But the constant could also be an array. Then FIELD is zero.
3888 There is always a maximum of one element in the chain LINK for unions
3889 (even if the initializer in a source program incorrectly contains
3891 for (link
= CONSTRUCTOR_ELTS (exp
);
3893 link
= TREE_CHAIN (link
),
3894 field
= field
? TREE_CHAIN (field
) : 0)
3896 tree val
= TREE_VALUE (link
);
3899 /* The element in a union constructor specifies the proper field
3901 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
3902 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
3903 && TREE_PURPOSE (link
) != 0)
3904 field
= TREE_PURPOSE (link
);
3906 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3907 index
= TREE_PURPOSE (link
);
3909 /* Eliminate the marker that makes a cast not be an lvalue. */
3913 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
3915 unsigned HOST_WIDE_INT fieldsize
3916 = int_size_in_bytes (TREE_TYPE (type
));
3917 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
3918 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
3919 HOST_WIDE_INT index
;
3920 unsigned int align2
= min_align (align
, fieldsize
* BITS_PER_UNIT
);
3922 for (index
= lo_index
; index
<= hi_index
; index
++)
3924 /* Output the element's initial value. */
3926 assemble_zeros (fieldsize
);
3928 output_constant (val
, fieldsize
, align2
);
3930 /* Count its size. */
3931 total_bytes
+= fieldsize
;
3934 else if (field
== 0 || !DECL_BIT_FIELD (field
))
3936 /* An element that is not a bit-field. */
3938 unsigned HOST_WIDE_INT fieldsize
;
3939 /* Since this structure is static,
3940 we know the positions are constant. */
3941 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
3942 unsigned int align2
;
3945 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
3946 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
3948 /* Output any buffered-up bit-fields preceding this element. */
3949 if (byte_buffer_in_use
)
3951 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
3953 byte_buffer_in_use
= 0;
3956 /* Advance to offset of this element.
3957 Note no alignment needed in an array, since that is guaranteed
3958 if each element has the proper size. */
3959 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
3961 assemble_zeros (pos
- total_bytes
);
3965 /* Find the alignment of this element. */
3966 align2
= min_align (align
, BITS_PER_UNIT
* pos
);
3968 /* Determine size this element should occupy. */
3973 /* If this is an array with an unspecified upper bound,
3974 the initializer determines the size. */
3975 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
3976 but we cannot do this until the deprecated support for
3977 initializing zero-length array members is removed. */
3978 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
3979 && TYPE_DOMAIN (TREE_TYPE (field
))
3980 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
3982 fieldsize
= array_size_for_constructor (val
);
3983 /* Given a non-empty initialization, this field had
3985 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
3988 else if (DECL_SIZE_UNIT (field
))
3990 /* ??? This can't be right. If the decl size overflows
3991 a host integer we will silently emit no data. */
3992 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
3993 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
3997 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
3999 /* Output the element's initial value. */
4001 assemble_zeros (fieldsize
);
4003 output_constant (val
, fieldsize
, align2
);
4005 /* Count its size. */
4006 total_bytes
+= fieldsize
;
4008 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4009 error ("invalid initial value for member `%s'",
4010 IDENTIFIER_POINTER (DECL_NAME (field
)));
4013 /* Element that is a bit-field. */
4015 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4016 HOST_WIDE_INT end_offset
4017 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4020 val
= integer_zero_node
;
4022 /* If this field does not start in this (or, next) byte,
4024 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4026 /* Output remnant of any bit field in previous bytes. */
4027 if (byte_buffer_in_use
)
4029 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4031 byte_buffer_in_use
= 0;
4034 /* If still not at proper byte, advance to there. */
4035 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4037 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4038 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4042 if (! byte_buffer_in_use
)
4045 /* We must split the element into pieces that fall within
4046 separate bytes, and combine each byte with previous or
4047 following bit-fields. */
4049 /* next_offset is the offset n fbits from the beginning of
4050 the structure to the next bit of this element to be processed.
4051 end_offset is the offset of the first bit past the end of
4053 while (next_offset
< end_offset
)
4057 HOST_WIDE_INT value
;
4058 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4059 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4061 /* Advance from byte to byte
4062 within this element when necessary. */
4063 while (next_byte
!= total_bytes
)
4065 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4070 /* Number of bits we can process at once
4071 (all part of the same byte). */
4072 this_time
= MIN (end_offset
- next_offset
,
4073 BITS_PER_UNIT
- next_bit
);
4074 if (BYTES_BIG_ENDIAN
)
4076 /* On big-endian machine, take the most significant bits
4077 first (of the bits that are significant)
4078 and put them into bytes from the most significant end. */
4079 shift
= end_offset
- next_offset
- this_time
;
4081 /* Don't try to take a bunch of bits that cross
4082 the word boundary in the INTEGER_CST. We can
4083 only select bits from the LOW or HIGH part
4085 if (shift
< HOST_BITS_PER_WIDE_INT
4086 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4088 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4089 shift
= HOST_BITS_PER_WIDE_INT
;
4092 /* Now get the bits from the appropriate constant word. */
4093 if (shift
< HOST_BITS_PER_WIDE_INT
)
4094 value
= TREE_INT_CST_LOW (val
);
4095 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4097 value
= TREE_INT_CST_HIGH (val
);
4098 shift
-= HOST_BITS_PER_WIDE_INT
;
4103 /* Get the result. This works only when:
4104 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4105 byte
|= (((value
>> shift
)
4106 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4107 << (BITS_PER_UNIT
- this_time
- next_bit
));
4111 /* On little-endian machines,
4112 take first the least significant bits of the value
4113 and pack them starting at the least significant
4114 bits of the bytes. */
4115 shift
= next_offset
- int_bit_position (field
);
4117 /* Don't try to take a bunch of bits that cross
4118 the word boundary in the INTEGER_CST. We can
4119 only select bits from the LOW or HIGH part
4121 if (shift
< HOST_BITS_PER_WIDE_INT
4122 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4123 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4125 /* Now get the bits from the appropriate constant word. */
4126 if (shift
< HOST_BITS_PER_WIDE_INT
)
4127 value
= TREE_INT_CST_LOW (val
);
4128 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4130 value
= TREE_INT_CST_HIGH (val
);
4131 shift
-= HOST_BITS_PER_WIDE_INT
;
4136 /* Get the result. This works only when:
4137 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4138 byte
|= (((value
>> shift
)
4139 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4143 next_offset
+= this_time
;
4144 byte_buffer_in_use
= 1;
4149 if (byte_buffer_in_use
)
4151 assemble_integer (GEN_INT (byte
), 1, BITS_PER_UNIT
, 1);
4155 if ((unsigned HOST_WIDE_INT
)total_bytes
< size
)
4156 assemble_zeros (size
- total_bytes
);
4159 /* This TREE_LIST contains any weak symbol declarations waiting
4161 static GTY(()) tree weak_decls
;
4163 /* Mark DECL as weak. */
4166 mark_weak (tree decl
)
4168 DECL_WEAK (decl
) = 1;
4170 if (DECL_RTL_SET_P (decl
)
4171 && GET_CODE (DECL_RTL (decl
)) == MEM
4172 && XEXP (DECL_RTL (decl
), 0)
4173 && GET_CODE (XEXP (DECL_RTL (decl
), 0)) == SYMBOL_REF
)
4174 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = 1;
4177 /* Merge weak status between NEWDECL and OLDDECL. */
4180 merge_weak (tree newdecl
, tree olddecl
)
4182 if (DECL_WEAK (newdecl
) == DECL_WEAK (olddecl
))
4185 if (DECL_WEAK (newdecl
))
4189 /* NEWDECL is weak, but OLDDECL is not. */
4191 /* If we already output the OLDDECL, we're in trouble; we can't
4192 go back and make it weak. This error cannot caught in
4193 declare_weak because the NEWDECL and OLDDECL was not yet
4194 been merged; therefore, TREE_ASM_WRITTEN was not set. */
4195 if (TREE_ASM_WRITTEN (olddecl
))
4196 error ("%Hweak declaration of '%D' must precede definition",
4197 &DECL_SOURCE_LOCATION (newdecl
), newdecl
);
4199 /* If we've already generated rtl referencing OLDDECL, we may
4200 have done so in a way that will not function properly with
4202 else if (TREE_USED (olddecl
)
4203 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl
)))
4204 warning ("%Hweak declaration of '%D' after first use results "
4205 "in unspecified behavior",
4206 &DECL_SOURCE_LOCATION (newdecl
), newdecl
);
4210 /* We put the NEWDECL on the weak_decls list at some point.
4211 Replace it with the OLDDECL. */
4212 for (wd
= weak_decls
; wd
; wd
= TREE_CHAIN (wd
))
4213 if (TREE_VALUE (wd
) == newdecl
)
4215 TREE_VALUE (wd
) = olddecl
;
4218 /* We may not find the entry on the list. If NEWDECL is a
4219 weak alias, then we will have already called
4220 globalize_decl to remove the entry; in that case, we do
4221 not need to do anything. */
4224 /* Make the OLDDECL weak; it's OLDDECL that we'll be keeping. */
4225 mark_weak (olddecl
);
4228 /* OLDDECL was weak, but NEWDECL was not explicitly marked as
4229 weak. Just update NEWDECL to indicate that it's weak too. */
4230 mark_weak (newdecl
);
4233 /* Declare DECL to be a weak symbol. */
4236 declare_weak (tree decl
)
4238 if (! TREE_PUBLIC (decl
))
4239 error ("%Hweak declaration of '%D' must be public",
4240 &DECL_SOURCE_LOCATION (decl
), decl
);
4241 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
4242 error ("%Hweak declaration of '%D' must precede definition",
4243 &DECL_SOURCE_LOCATION (decl
), decl
);
4244 else if (SUPPORTS_WEAK
)
4246 if (! DECL_WEAK (decl
))
4247 weak_decls
= tree_cons (NULL
, decl
, weak_decls
);
4250 warning ("%Hweak declaration of '%D' not supported",
4251 &DECL_SOURCE_LOCATION (decl
), decl
);
4256 /* Emit any pending weak declarations. */
4263 for (t
= weak_decls
; t
; t
= TREE_CHAIN (t
))
4265 tree decl
= TREE_VALUE (t
);
4266 #if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
4267 const char *const name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4270 if (! TREE_USED (decl
))
4273 #ifdef ASM_WEAKEN_DECL
4274 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, NULL
);
4276 #ifdef ASM_WEAKEN_LABEL
4277 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4279 #ifdef ASM_OUTPUT_WEAK_ALIAS
4280 warning ("only weak aliases are supported in this configuration");
4288 /* Emit the assembly bits to indicate that DECL is globally visible. */
4291 globalize_decl (tree decl
)
4293 const char *name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4295 #if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
4296 if (DECL_WEAK (decl
))
4300 #ifdef ASM_WEAKEN_DECL
4301 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, 0);
4303 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4306 /* Remove this function from the pending weak list so that
4307 we do not emit multiple .weak directives for it. */
4308 for (p
= &weak_decls
; (t
= *p
) ; )
4310 if (DECL_ASSEMBLER_NAME (decl
) == DECL_ASSEMBLER_NAME (TREE_VALUE (t
)))
4311 *p
= TREE_CHAIN (t
);
4313 p
= &TREE_CHAIN (t
);
4319 (*targetm
.asm_out
.globalize_label
) (asm_out_file
, name
);
4322 /* Emit an assembler directive to make the symbol for DECL an alias to
4323 the symbol for TARGET. */
4326 assemble_alias (tree decl
, tree target ATTRIBUTE_UNUSED
)
4330 /* We must force creation of DECL_RTL for debug info generation, even though
4331 we don't use it here. */
4332 make_decl_rtl (decl
, NULL
);
4334 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4336 #ifdef ASM_OUTPUT_DEF
4337 /* Make name accessible from other files, if appropriate. */
4339 if (TREE_PUBLIC (decl
))
4341 globalize_decl (decl
);
4342 maybe_assemble_visibility (decl
);
4345 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4346 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4348 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4350 #else /* !ASM_OUTPUT_DEF */
4351 #if defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
4352 if (! DECL_WEAK (decl
))
4353 warning ("only weak aliases are supported in this configuration");
4355 #ifdef ASM_WEAKEN_DECL
4356 ASM_WEAKEN_DECL (asm_out_file
, decl
, name
, IDENTIFIER_POINTER (target
));
4358 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4361 warning ("alias definitions not supported in this configuration; ignored");
4365 TREE_USED (decl
) = 1;
4366 TREE_ASM_WRITTEN (decl
) = 1;
4367 TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl
)) = 1;
4370 /* Emit an assembler directive to set symbol for DECL visibility to
4371 the visibility type VIS, which must not be VISIBILITY_DEFAULT. */
4374 default_assemble_visibility (tree decl
, int vis
)
4376 static const char * const visibility_types
[] = {
4377 NULL
, "internal", "hidden", "protected"
4380 const char *name
, *type
;
4382 name
= (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4383 type
= visibility_types
[vis
];
4385 #ifdef HAVE_GAS_HIDDEN
4386 fprintf (asm_out_file
, "\t.%s\t", type
);
4387 assemble_name (asm_out_file
, name
);
4388 fprintf (asm_out_file
, "\n");
4390 warning ("visibility attribute not supported in this configuration; ignored");
4394 /* A helper function to call assemble_visibility when needed for a decl. */
4397 maybe_assemble_visibility (tree decl
)
4399 enum symbol_visibility vis
= decl_visibility (decl
);
4401 if (vis
!= VISIBILITY_DEFAULT
)
4402 (* targetm
.asm_out
.visibility
) (decl
, vis
);
4405 /* Returns 1 if the target configuration supports defining public symbols
4406 so that one of them will be chosen at link time instead of generating a
4407 multiply-defined symbol error, whether through the use of weak symbols or
4408 a target-specific mechanism for having duplicates discarded. */
4411 supports_one_only (void)
4413 if (SUPPORTS_ONE_ONLY
)
4415 return SUPPORTS_WEAK
;
4418 /* Set up DECL as a public symbol that can be defined in multiple
4419 translation units without generating a linker error. */
4422 make_decl_one_only (tree decl
)
4424 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4427 TREE_PUBLIC (decl
) = 1;
4429 if (TREE_CODE (decl
) == VAR_DECL
4430 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4431 DECL_COMMON (decl
) = 1;
4432 else if (SUPPORTS_ONE_ONLY
)
4434 #ifdef MAKE_DECL_ONE_ONLY
4435 MAKE_DECL_ONE_ONLY (decl
);
4437 DECL_ONE_ONLY (decl
) = 1;
4439 else if (SUPPORTS_WEAK
)
4440 DECL_WEAK (decl
) = 1;
4446 init_varasm_once (void)
4448 in_named_htab
= htab_create_ggc (31, in_named_entry_hash
,
4449 in_named_entry_eq
, NULL
);
4450 const_desc_htab
= htab_create_ggc (1009, const_desc_hash
,
4451 const_desc_eq
, NULL
);
4453 const_alias_set
= new_alias_set ();
4457 decl_tls_model (tree decl
)
4459 enum tls_model kind
;
4460 tree attr
= lookup_attribute ("tls_model", DECL_ATTRIBUTES (decl
));
4465 attr
= TREE_VALUE (TREE_VALUE (attr
));
4466 if (TREE_CODE (attr
) != STRING_CST
)
4468 if (!strcmp (TREE_STRING_POINTER (attr
), "local-exec"))
4469 kind
= TLS_MODEL_LOCAL_EXEC
;
4470 else if (!strcmp (TREE_STRING_POINTER (attr
), "initial-exec"))
4471 kind
= TLS_MODEL_INITIAL_EXEC
;
4472 else if (!strcmp (TREE_STRING_POINTER (attr
), "local-dynamic"))
4473 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
4474 else if (!strcmp (TREE_STRING_POINTER (attr
), "global-dynamic"))
4475 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4481 is_local
= (*targetm
.binds_local_p
) (decl
);
4485 kind
= TLS_MODEL_LOCAL_EXEC
;
4487 kind
= TLS_MODEL_INITIAL_EXEC
;
4489 /* Local dynamic is inefficient when we're not combining the
4490 parts of the address. */
4491 else if (optimize
&& is_local
)
4492 kind
= TLS_MODEL_LOCAL_DYNAMIC
;
4494 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
4495 if (kind
< flag_tls_default
)
4496 kind
= flag_tls_default
;
4501 enum symbol_visibility
4502 decl_visibility (tree decl
)
4504 tree attr
= lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
));
4508 const char *which
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
4510 if (strcmp (which
, "default") == 0)
4511 return VISIBILITY_DEFAULT
;
4512 if (strcmp (which
, "internal") == 0)
4513 return VISIBILITY_INTERNAL
;
4514 if (strcmp (which
, "hidden") == 0)
4515 return VISIBILITY_HIDDEN
;
4516 if (strcmp (which
, "protected") == 0)
4517 return VISIBILITY_PROTECTED
;
4522 return VISIBILITY_DEFAULT
;
4525 /* Select a set of attributes for section NAME based on the properties
4526 of DECL and whether or not RELOC indicates that DECL's initializer
4527 might contain runtime relocations.
4529 We make the section read-only and executable for a function decl,
4530 read-only for a const data decl, and writable for a non-const data decl. */
4533 default_section_type_flags (tree decl
, const char *name
, int reloc
)
4535 return default_section_type_flags_1 (decl
, name
, reloc
, flag_pic
);
4539 default_section_type_flags_1 (tree decl
, const char *name
, int reloc
,
4544 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4545 flags
= SECTION_CODE
;
4546 else if (decl
&& decl_readonly_section_1 (decl
, reloc
, shlib
))
4549 flags
= SECTION_WRITE
;
4551 if (decl
&& DECL_ONE_ONLY (decl
))
4552 flags
|= SECTION_LINKONCE
;
4554 if (decl
&& TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4555 flags
|= SECTION_TLS
| SECTION_WRITE
;
4557 if (strcmp (name
, ".bss") == 0
4558 || strncmp (name
, ".bss.", 5) == 0
4559 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4560 || strcmp (name
, ".sbss") == 0
4561 || strncmp (name
, ".sbss.", 6) == 0
4562 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0
4563 || strcmp (name
, ".tbss") == 0
4564 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4565 flags
|= SECTION_BSS
;
4567 if (strcmp (name
, ".tdata") == 0
4568 || strcmp (name
, ".tbss") == 0
4569 || strncmp (name
, ".gnu.linkonce.td.", 17) == 0
4570 || strncmp (name
, ".gnu.linkonce.tb.", 17) == 0)
4571 flags
|= SECTION_TLS
;
4573 /* These three sections have special ELF types. They are neither
4574 SHT_PROGBITS nor SHT_NOBITS, so when changing sections we don't
4575 want to print a section type (@progbits or @nobits). If someone
4576 is silly enough to emit code or TLS variables to one of these
4577 sections, then don't handle them specially. */
4578 if (!(flags
& (SECTION_CODE
| SECTION_BSS
| SECTION_TLS
))
4579 && (strcmp (name
, ".init_array") == 0
4580 || strcmp (name
, ".fini_array") == 0
4581 || strcmp (name
, ".preinit_array") == 0))
4582 flags
|= SECTION_NOTYPE
;
4587 /* Output assembly to switch to section NAME with attribute FLAGS.
4588 Four variants for common object file formats. */
4591 default_no_named_section (const char *name ATTRIBUTE_UNUSED
,
4592 unsigned int flags ATTRIBUTE_UNUSED
)
4594 /* Some object formats don't support named sections at all. The
4595 front-end should already have flagged this as an error. */
4600 default_elf_asm_named_section (const char *name
, unsigned int flags
)
4602 char flagchars
[10], *f
= flagchars
;
4604 if (! named_section_first_declaration (name
))
4606 fprintf (asm_out_file
, "\t.section\t%s\n", name
);
4610 if (!(flags
& SECTION_DEBUG
))
4612 if (flags
& SECTION_WRITE
)
4614 if (flags
& SECTION_CODE
)
4616 if (flags
& SECTION_SMALL
)
4618 if (flags
& SECTION_MERGE
)
4620 if (flags
& SECTION_STRINGS
)
4622 if (flags
& SECTION_TLS
)
4626 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"", name
, flagchars
);
4628 if (!(flags
& SECTION_NOTYPE
))
4632 if (flags
& SECTION_BSS
)
4637 fprintf (asm_out_file
, ",@%s", type
);
4639 if (flags
& SECTION_ENTSIZE
)
4640 fprintf (asm_out_file
, ",%d", flags
& SECTION_ENTSIZE
);
4643 putc ('\n', asm_out_file
);
4647 default_coff_asm_named_section (const char *name
, unsigned int flags
)
4649 char flagchars
[8], *f
= flagchars
;
4651 if (flags
& SECTION_WRITE
)
4653 if (flags
& SECTION_CODE
)
4657 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4661 default_pe_asm_named_section (const char *name
, unsigned int flags
)
4663 default_coff_asm_named_section (name
, flags
);
4665 if (flags
& SECTION_LINKONCE
)
4667 /* Functions may have been compiled at various levels of
4668 optimization so we can't use `same_size' here.
4669 Instead, have the linker pick one. */
4670 fprintf (asm_out_file
, "\t.linkonce %s\n",
4671 (flags
& SECTION_CODE
? "discard" : "same_size"));
4675 /* The lame default section selector. */
4678 default_select_section (tree decl
, int reloc
,
4679 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4681 bool readonly
= false;
4685 if (decl_readonly_section (decl
, reloc
))
4688 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4690 if (! ((flag_pic
&& reloc
)
4691 || !TREE_READONLY (decl
)
4692 || TREE_SIDE_EFFECTS (decl
)
4693 || !TREE_CONSTANT (decl
)))
4696 else if (TREE_CODE (decl
) == STRING_CST
)
4697 readonly
= !flag_writable_strings
;
4698 else if (! (flag_pic
&& reloc
))
4702 readonly_data_section ();
4707 /* A helper function for default_elf_select_section and
4708 default_elf_unique_section. Categorizes the DECL. */
4710 enum section_category
4715 SECCAT_RODATA_MERGE_STR
,
4716 SECCAT_RODATA_MERGE_STR_INIT
,
4717 SECCAT_RODATA_MERGE_CONST
,
4722 /* To optimize loading of shared programs, define following subsections
4724 _REL Contains data that has relocations, so they get grouped
4725 together and dynamic linker will visit fewer pages in memory.
4726 _RO Contains data that is otherwise read-only. This is useful
4727 with prelinking as most relocations won't be dynamically
4728 linked and thus stay read only.
4729 _LOCAL Marks data containing relocations only to local objects.
4730 These relocations will get fully resolved by prelinking. */
4732 SECCAT_DATA_REL_LOCAL
,
4734 SECCAT_DATA_REL_RO_LOCAL
,
4744 static enum section_category
4745 categorize_decl_for_section (tree
, int, int);
4747 static enum section_category
4748 categorize_decl_for_section (tree decl
, int reloc
, int shlib
)
4750 enum section_category ret
;
4752 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4754 else if (TREE_CODE (decl
) == STRING_CST
)
4756 if (flag_writable_strings
)
4759 return SECCAT_RODATA_MERGE_STR
;
4761 else if (TREE_CODE (decl
) == VAR_DECL
)
4763 if (DECL_INITIAL (decl
) == NULL
4764 || DECL_INITIAL (decl
) == error_mark_node
)
4766 else if (! TREE_READONLY (decl
)
4767 || TREE_SIDE_EFFECTS (decl
)
4768 || ! TREE_CONSTANT (DECL_INITIAL (decl
)))
4770 if (shlib
&& (reloc
& 2))
4771 ret
= SECCAT_DATA_REL
;
4772 else if (shlib
&& reloc
)
4773 ret
= SECCAT_DATA_REL_LOCAL
;
4777 else if (shlib
&& (reloc
& 2))
4778 ret
= SECCAT_DATA_REL_RO
;
4779 else if (shlib
&& reloc
)
4780 ret
= SECCAT_DATA_REL_RO_LOCAL
;
4781 else if (reloc
|| flag_merge_constants
< 2)
4782 /* C and C++ don't allow different variables to share the same
4783 location. -fmerge-all-constants allows even that (at the
4784 expense of not conforming). */
4785 ret
= SECCAT_RODATA
;
4786 else if (TREE_CODE (DECL_INITIAL (decl
)) == STRING_CST
)
4787 ret
= SECCAT_RODATA_MERGE_STR_INIT
;
4789 ret
= SECCAT_RODATA_MERGE_CONST
;
4791 else if (TREE_CODE (decl
) == CONSTRUCTOR
)
4793 if ((shlib
&& reloc
)
4794 || TREE_SIDE_EFFECTS (decl
)
4795 || ! TREE_CONSTANT (decl
))
4798 ret
= SECCAT_RODATA
;
4801 ret
= SECCAT_RODATA
;
4803 /* There are no read-only thread-local sections. */
4804 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
4806 if (ret
== SECCAT_BSS
)
4812 /* If the target uses small data sections, select it. */
4813 else if ((*targetm
.in_small_data_p
) (decl
))
4815 if (ret
== SECCAT_BSS
)
4817 else if (targetm
.have_srodata_section
&& ret
== SECCAT_RODATA
)
4818 ret
= SECCAT_SRODATA
;
4827 decl_readonly_section (tree decl
, int reloc
)
4829 return decl_readonly_section_1 (decl
, reloc
, flag_pic
);
4833 decl_readonly_section_1 (tree decl
, int reloc
, int shlib
)
4835 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4838 case SECCAT_RODATA_MERGE_STR
:
4839 case SECCAT_RODATA_MERGE_STR_INIT
:
4840 case SECCAT_RODATA_MERGE_CONST
:
4841 case SECCAT_SRODATA
:
4850 /* Select a section based on the above categorization. */
4853 default_elf_select_section (tree decl
, int reloc
,
4854 unsigned HOST_WIDE_INT align
)
4856 default_elf_select_section_1 (decl
, reloc
, align
, flag_pic
);
4860 default_elf_select_section_1 (tree decl
, int reloc
,
4861 unsigned HOST_WIDE_INT align
, int shlib
)
4863 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4866 /* We're not supposed to be called on FUNCTION_DECLs. */
4869 readonly_data_section ();
4871 case SECCAT_RODATA_MERGE_STR
:
4872 mergeable_string_section (decl
, align
, 0);
4874 case SECCAT_RODATA_MERGE_STR_INIT
:
4875 mergeable_string_section (DECL_INITIAL (decl
), align
, 0);
4877 case SECCAT_RODATA_MERGE_CONST
:
4878 mergeable_constant_section (DECL_MODE (decl
), align
, 0);
4880 case SECCAT_SRODATA
:
4881 named_section (NULL_TREE
, ".sdata2", reloc
);
4886 case SECCAT_DATA_REL
:
4887 named_section (NULL_TREE
, ".data.rel", reloc
);
4889 case SECCAT_DATA_REL_LOCAL
:
4890 named_section (NULL_TREE
, ".data.rel.local", reloc
);
4892 case SECCAT_DATA_REL_RO
:
4893 named_section (NULL_TREE
, ".data.rel.ro", reloc
);
4895 case SECCAT_DATA_REL_RO_LOCAL
:
4896 named_section (NULL_TREE
, ".data.rel.ro.local", reloc
);
4899 named_section (NULL_TREE
, ".sdata", reloc
);
4902 named_section (NULL_TREE
, ".tdata", reloc
);
4905 #ifdef BSS_SECTION_ASM_OP
4908 named_section (NULL_TREE
, ".bss", reloc
);
4912 named_section (NULL_TREE
, ".sbss", reloc
);
4915 named_section (NULL_TREE
, ".tbss", reloc
);
4922 /* Construct a unique section name based on the decl name and the
4923 categorization performed above. */
4926 default_unique_section (tree decl
, int reloc
)
4928 default_unique_section_1 (decl
, reloc
, flag_pic
);
4932 default_unique_section_1 (tree decl
, int reloc
, int shlib
)
4934 bool one_only
= DECL_ONE_ONLY (decl
);
4935 const char *prefix
, *name
;
4939 switch (categorize_decl_for_section (decl
, reloc
, shlib
))
4942 prefix
= one_only
? ".gnu.linkonce.t." : ".text.";
4945 case SECCAT_RODATA_MERGE_STR
:
4946 case SECCAT_RODATA_MERGE_STR_INIT
:
4947 case SECCAT_RODATA_MERGE_CONST
:
4948 prefix
= one_only
? ".gnu.linkonce.r." : ".rodata.";
4950 case SECCAT_SRODATA
:
4951 prefix
= one_only
? ".gnu.linkonce.s2." : ".sdata2.";
4954 case SECCAT_DATA_REL
:
4955 case SECCAT_DATA_REL_LOCAL
:
4956 case SECCAT_DATA_REL_RO
:
4957 case SECCAT_DATA_REL_RO_LOCAL
:
4958 prefix
= one_only
? ".gnu.linkonce.d." : ".data.";
4961 prefix
= one_only
? ".gnu.linkonce.s." : ".sdata.";
4964 prefix
= one_only
? ".gnu.linkonce.b." : ".bss.";
4967 prefix
= one_only
? ".gnu.linkonce.sb." : ".sbss.";
4970 prefix
= one_only
? ".gnu.linkonce.td." : ".tdata.";
4973 prefix
= one_only
? ".gnu.linkonce.tb." : ".tbss.";
4978 plen
= strlen (prefix
);
4980 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4981 name
= (* targetm
.strip_name_encoding
) (name
);
4982 nlen
= strlen (name
);
4984 string
= alloca (nlen
+ plen
+ 1);
4985 memcpy (string
, prefix
, plen
);
4986 memcpy (string
+ plen
, name
, nlen
+ 1);
4988 DECL_SECTION_NAME (decl
) = build_string (nlen
+ plen
, string
);
4992 default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED
,
4994 unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED
)
4997 switch (GET_CODE (x
))
5009 readonly_data_section ();
5013 default_elf_select_rtx_section (enum machine_mode mode
, rtx x
,
5014 unsigned HOST_WIDE_INT align
)
5016 /* ??? Handle small data here somehow. */
5019 switch (GET_CODE (x
))
5023 named_section (NULL_TREE
, ".data.rel.ro", 3);
5027 named_section (NULL_TREE
, ".data.rel.ro.local", 1);
5034 mergeable_constant_section (mode
, align
, 0);
5037 /* Set the generally applicable flags on the SYMBOL_REF for EXP. */
5040 default_encode_section_info (tree decl
, rtx rtl
, int first ATTRIBUTE_UNUSED
)
5045 /* Careful not to prod global register variables. */
5046 if (GET_CODE (rtl
) != MEM
)
5048 symbol
= XEXP (rtl
, 0);
5049 if (GET_CODE (symbol
) != SYMBOL_REF
)
5053 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5054 flags
|= SYMBOL_FLAG_FUNCTION
;
5055 if ((*targetm
.binds_local_p
) (decl
))
5056 flags
|= SYMBOL_FLAG_LOCAL
;
5057 if ((*targetm
.in_small_data_p
) (decl
))
5058 flags
|= SYMBOL_FLAG_SMALL
;
5059 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_THREAD_LOCAL (decl
))
5060 flags
|= decl_tls_model (decl
) << SYMBOL_FLAG_TLS_SHIFT
;
5061 /* ??? Why is DECL_EXTERNAL ever set for non-PUBLIC names? Without
5062 being PUBLIC, the thing *must* be defined in this translation unit.
5063 Prevent this buglet from being propagated into rtl code as well. */
5064 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
5065 flags
|= SYMBOL_FLAG_EXTERNAL
;
5067 SYMBOL_REF_FLAGS (symbol
) = flags
;
5070 /* By default, we do nothing for encode_section_info, so we need not
5071 do anything but discard the '*' marker. */
5074 default_strip_name_encoding (const char *str
)
5076 return str
+ (*str
== '*');
5079 /* Assume ELF-ish defaults, since that's pretty much the most liberal
5080 wrt cross-module name binding. */
5083 default_binds_local_p (tree exp
)
5085 return default_binds_local_p_1 (exp
, flag_shlib
);
5089 default_binds_local_p_1 (tree exp
, int shlib
)
5093 /* A non-decl is an entry in the constant pool. */
5096 /* Static variables are always local. */
5097 else if (! TREE_PUBLIC (exp
))
5099 /* A variable is local if the user tells us so. */
5100 else if (decl_visibility (exp
) != VISIBILITY_DEFAULT
)
5102 /* Otherwise, variables defined outside this object may not be local. */
5103 else if (DECL_EXTERNAL (exp
))
5105 /* Linkonce and weak data are never local. */
5106 else if (DECL_ONE_ONLY (exp
) || DECL_WEAK (exp
))
5108 /* If PIC, then assume that any global name can be overridden by
5109 symbols resolved from other modules. */
5112 /* Uninitialized COMMON variable may be unified with symbols
5113 resolved from other modules. */
5114 else if (DECL_COMMON (exp
)
5115 && (DECL_INITIAL (exp
) == NULL
5116 || DECL_INITIAL (exp
) == error_mark_node
))
5118 /* Otherwise we're left with initialized (or non-common) global data
5119 which is of necessity defined locally. */
5126 /* Determine whether or not a pointer mode is valid. Assume defaults
5127 of ptr_mode or Pmode - can be overridden. */
5129 default_valid_pointer_mode (enum machine_mode mode
)
5131 return (mode
== ptr_mode
|| mode
== Pmode
);
5134 /* Default function to output code that will globalize a label. A
5135 target must define GLOBAL_ASM_OP or provide it's own function to
5136 globalize a label. */
5137 #ifdef GLOBAL_ASM_OP
5139 default_globalize_label (FILE * stream
, const char *name
)
5141 fputs (GLOBAL_ASM_OP
, stream
);
5142 assemble_name (stream
, name
);
5143 putc ('\n', stream
);
5145 #endif /* GLOBAL_ASM_OP */
5147 /* This is how to output an internal numbered label where PREFIX is
5148 the class of label and LABELNO is the number within the class. */
5151 default_internal_label (FILE *stream
, const char *prefix
,
5152 unsigned long labelno
)
5154 char *const buf
= alloca (40 + strlen (prefix
));
5155 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, labelno
);
5156 ASM_OUTPUT_LABEL (stream
, buf
);
5159 /* This is the default behavior at the beginning of a file. It's
5160 controlled by two other target-hook toggles. */
5162 default_file_start (void)
5164 if (targetm
.file_start_app_off
&& !flag_verbose_asm
)
5165 fputs (ASM_APP_OFF
, asm_out_file
);
5167 if (targetm
.file_start_file_directive
)
5168 output_file_directive (asm_out_file
, main_input_filename
);
5171 /* This is a generic routine suitable for use as TARGET_ASM_FILE_END
5172 which emits a special section directive used to indicate whether or
5173 not this object file needs an executable stack. This is primarily
5174 a GNU extension to ELF but could be used on other targets. */
5176 file_end_indicate_exec_stack (void)
5178 unsigned int flags
= SECTION_DEBUG
;
5179 if (trampolines_created
)
5180 flags
|= SECTION_CODE
;
5182 named_section_flags (".note.GNU-stack", flags
);
5185 #include "gt-varasm.h"